Roll HarfBuzz to 0.9.32

third_party/harfbuzz-ng/src/main.cc

 /*
  * Copyright © 2007,2008,2009  Red Hat, Inc.
  *
  *  This is part of HarfBuzz, a text shaping library.
  *
  * Permission is hereby granted, without written agreement and without
  * license or royalty fees, to use, copy, modify, and distribute this
  * software and its documentation for any purpose, provided that the
  * above copyright notice and the following two paragraphs appear in
  * all copies of this software.
@@ skipping 113 matching lines @@
           printf ("      %d language system(s) found in script\n", num_langsys);
           for (int n_langsys = script.has_default_lang_sys() ? -1 : 0; n_langsys < num_langsys; n_langsys++) {
             const LangSys &langsys = n_langsys == -1
                                    ? script.get_default_lang_sys ()
                                    : script.get_lang_sys (n_langsys);
             if (n_langsys == -1)
               printf ("      Default Language System\n");
             else
               printf ("      Language System %2d of %2d: %.4s\n", n_langsys, num_langsys,
                       (const char *)script.get_lang_sys_tag (n_langsys));
-            if (langsys.get_required_feature_index () == Index::NOT_FOUND_INDEX)
+            if (!langsys.has_required_feature ())
               printf ("        No required feature\n");
+            else
+              printf ("        Required feature index: %d\n",
+                      langsys.get_required_feature_index ());
 
             int num_features = langsys.get_feature_count ();
             printf ("        %d feature(s) found in language system\n", num_features);
             for (int n_feature = 0; n_feature < num_features; n_feature++) {
               printf ("        Feature index %2d of %2d: %d\n", n_feature, num_features,
                       langsys.get_feature_index (n_feature));
             }
           }
         }
 
         int num_features = g.get_feature_count ();
         printf ("    %d feature(s) found in table\n", num_features);
         for (int n_feature = 0; n_feature < num_features; n_feature++) {
           const Feature &feature = g.get_feature (n_feature);
-          printf ("    Feature %2d of %2d: %.4s; %d lookup(s)\n", n_feature, num_features,
-                  (const char *)g.get_feature_tag(n_feature),
-                  feature.get_lookup_count());
+          int num_lookups = feature.get_lookup_count ();
+          printf ("    Feature %2d of %2d: %c%c%c%c\n", n_feature, num_features,
+                  HB_UNTAG(g.get_feature_tag(n_feature)));
 
-          int num_lookups = feature.get_lookup_count ();
           printf ("        %d lookup(s) found in feature\n", num_lookups);
           for (int n_lookup = 0; n_lookup < num_lookups; n_lookup++) {
             printf ("        Lookup index %2d of %2d: %d\n", n_lookup, num_lookups,
                     feature.get_lookup_index (n_lookup));
           }
         }
 
         int num_lookups = g.get_lookup_count ();
         printf ("    %d lookup(s) found in table\n", num_lookups);
         for (int n_lookup = 0; n_lookup < num_lookups; n_lookup++) {
@@ skipping 23 matching lines @@
         break;
         }
       }
     }
   }
 
   return 0;
 }