Roll harfbuzz-ng 3b8fd9c48f4bde368bf2d465c148b9743a9216ee

third_party/harfbuzz-ng/src/hb-ot-name-table.hh

 /*
- * Copyright © 2011  Google, Inc.
+ * Copyright © 2011,2012  Google, 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.
  *
  * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR
@@ skipping 37 matching lines @@
     ret = b->languageID.cmp (a->languageID);
     if (ret) return ret;
     ret = b->nameID.cmp (a->nameID);
     if (ret) return ret;
     return 0;
   }
 
   inline bool sanitize (hb_sanitize_context_t *c, void *base) {
     TRACE_SANITIZE ();
     /* We can check from base all the way up to the end of string... */
-    return c->check_struct (this) &&
-           c->check_range ((char *) base, (unsigned int) length + offset);
+    return TRACE_RETURN (c->check_struct (this) && c->check_range ((char *) base, (unsigned int) length + offset));
   }
 
   USHORT        platformID;     /* Platform ID. */
   USHORT        encodingID;     /* Platform-specific encoding ID. */
   USHORT        languageID;     /* Language ID. */
   USHORT        nameID;         /* Name ID. */
   USHORT        length;         /* String length (in bytes). */
   USHORT        offset;         /* String offset from start of storage area (in bytes). */
   public:
   DEFINE_SIZE_STATIC (12);
@@ skipping 23 matching lines @@
     unsigned int length = MIN (buffer_length, (unsigned int) match->length);
     memcpy (buffer, (char *) this + stringOffset + match->offset, length);
     return length;
   }
 
   inline bool sanitize_records (hb_sanitize_context_t *c) {
     TRACE_SANITIZE ();
     char *string_pool = (char *) this + stringOffset;
     unsigned int _count = count;
     for (unsigned int i = 0; i < _count; i++)
-      if (!nameRecord[i].sanitize (c, string_pool)) return false;
-    return true;
+      if (!nameRecord[i].sanitize (c, string_pool)) return TRACE_RETURN (false);
+    return TRACE_RETURN (true);
   }
 
   inline bool sanitize (hb_sanitize_context_t *c) {
     TRACE_SANITIZE ();
-    return c->check_struct (this) &&
-           likely (format == 0 || format == 1) &&
-           c->check_array (nameRecord, nameRecord[0].static_size, count) &&
-           sanitize_records (c);
+    return TRACE_RETURN (c->check_struct (this) &&
+                         likely (format == 0 || format == 1) &&
+                         c->check_array (nameRecord, nameRecord[0].static_size, count) &&
+                         sanitize_records (c));
   }
 
   /* We only implement format 0 for now. */
   private:
   USHORT        format;                 /* Format selector (=0/1). */
   USHORT        count;                  /* Number of name records. */
   Offset        stringOffset;           /* Offset to start of string storage (from start of table). */
   NameRecord    nameRecord[VAR];        /* The name records where count is the number of records. */
   public:
   DEFINE_SIZE_ARRAY (6, nameRecord);
 };
 
 
 
 #endif /* HB_OT_NAME_TABLE_HH */