commit 985b19f678cbccc57853796d2ee0e6885b9e7244
author Garret Rieger <grieger@google.com> Wed Sep 07 22:21:16 2022 +0000
committer Garret Rieger <grieger@google.com> Thu Dec 01 20:17:39 2022 +0000
tree a2b5c260eef4c0c2435fdf6be7f3ec6e51f0d4c0
parent 2658370f00981ac95c7031e9acaf8163f2e0f526

[repacker] begin implementing a fuzzer for the repacker api.

src/graph/graph.hh

diff --git a/src/graph/graph.hh b/src/graph/graph.hh
index c6f0884..20d6463 100644
--- a/src/graph/graph.hh
+++ b/src/graph/graph.hh
@@ -941,6 +941,18 @@
     return made_change;
   }
 
+  bool is_fully_connected ()
+  {
+    update_parents();
+
+    for (unsigned i = 0; i < root_idx (); i++)
+    {
+      if (!vertices_[i].parents)
+        return false;
+    }
+    return true;
+  }
+
   void print_orphaned_nodes ()
   {
     if (!DEBUG_ENABLED(SUBSET_REPACK)) return;

src/hb-repacker.hh

diff --git a/src/hb-repacker.hh b/src/hb-repacker.hh
index 70f1d0e..ba30557 100644
--- a/src/hb-repacker.hh
+++ b/src/hb-repacker.hh
@@ -376,6 +376,12 @@
                       unsigned max_rounds = 20,
                       bool recalculate_extensions = false) {
   graph_t sorted_graph (packed);
+  if (!sorted_graph.is_fully_connected ())
+  {
+    DEBUG_MSG (SUBSET_REPACK, nullptr, "Input graph is not fully connected.");
+    return nullptr;
+  }
+
   if (!hb_resolve_graph_overflows (table_tag, max_rounds, recalculate_extensions, sorted_graph))
     return nullptr;