X-Git-Url: http://review.tizen.org/git/?a=blobdiff_plain;f=src%2Fhb-open-type-private.hh;h=ab2a3462d8d717c8e05f21fa8dff7245d06763ac;hb=97158392a5899ddb739afaac925128f33f699bd7;hp=2ab639c4cacec18c9a834e14cfed32453366372d;hpb=cf5585cfa6cac6fdf627a99941299e76af5ae0f7;p=framework%2Fuifw%2Fharfbuzz.git diff --git a/src/hb-open-type-private.hh b/src/hb-open-type-private.hh index 2ab639c..ab2a346 100644 --- a/src/hb-open-type-private.hh +++ b/src/hb-open-type-private.hh @@ -1,5 +1,5 @@ /* - * Copyright (C) 2007,2008,2009,2010 Red Hat, Inc. + * Copyright © 2007,2008,2009,2010 Red Hat, Inc. * * This is part of HarfBuzz, a text shaping library. * @@ -24,13 +24,15 @@ * Red Hat Author(s): Behdad Esfahbod */ -#ifndef HB_OPEN_TYPES_PRIVATE_HH -#define HB_OPEN_TYPES_PRIVATE_HH +#ifndef HB_OPEN_TYPE_PRIVATE_HH +#define HB_OPEN_TYPE_PRIVATE_HH -#include "hb-private.h" +#include "hb-private.hh" #include "hb-blob.h" +HB_BEGIN_DECLS +HB_END_DECLS /* @@ -124,7 +126,7 @@ static const void *_NullPool[64 / sizeof (void *)]; /* Generic nul-content Null objects. */ template -static inline const Type& Null () { +static inline const Type& Null (void) { ASSERT_STATIC (Type::min_size <= sizeof (_NullPool)); return *CastP (_NullPool); } @@ -133,7 +135,7 @@ static inline const Type& Null () { #define DEFINE_NULL_DATA(Type, data) \ static const char _Null##Type[Type::min_size + 1] = data; /* +1 is for nul-termination in data */ \ template <> \ -inline const Type& Null () { \ +inline const Type& Null (void) { \ return *CastP (_Null##Type); \ } /* The following line really exists such that we end in a place needing semicolon */ \ ASSERT_STATIC (Type::min_size + 1 <= sizeof (_Null##Type)) @@ -142,66 +144,47 @@ ASSERT_STATIC (Type::min_size + 1 <= sizeof (_Null##Type)) #define Null(Type) Null() -/* - * Trace - */ - - -template -struct hb_trace_t { - explicit hb_trace_t (unsigned int *pdepth, const char *what, const char *function, const void *obj) : pdepth(pdepth) { - if (*pdepth < max_depth) - fprintf (stderr, "%s(%p) %-*d-> %s\n", what, obj, *pdepth, *pdepth, function); - if (max_depth) ++*pdepth; - } - ~hb_trace_t (void) { if (max_depth) --*pdepth; } - - private: - unsigned int *pdepth; -}; -template <> /* Optimize when tracing is disabled */ -struct hb_trace_t<0> { - explicit hb_trace_t (unsigned int *pdepth HB_UNUSED, const char *what HB_UNUSED, const char *function HB_UNUSED, const void *obj HB_UNUSED) {} -}; - - /* * Sanitize */ #ifndef HB_DEBUG_SANITIZE -#define HB_DEBUG_SANITIZE HB_DEBUG+0 +#define HB_DEBUG_SANITIZE (HB_DEBUG+0) #endif #define TRACE_SANITIZE() \ - hb_trace_t trace (&c->debug_depth, "SANITIZE", HB_FUNC, this); \ + hb_auto_trace_t trace (&c->debug_depth, "SANITIZE", this, NULL, HB_FUNC); struct hb_sanitize_context_t { - inline void init (hb_blob_t *blob) + inline void init (hb_blob_t *b) { - this->blob = hb_blob_reference (blob); - this->start = hb_blob_lock (blob); - this->end = this->start + hb_blob_get_length (blob); - this->writable = hb_blob_is_writable (blob); + this->blob = hb_blob_reference (b); + this->writable = false; + } + + inline void setup (void) + { + this->start = hb_blob_get_data (this->blob, NULL); + this->end = this->start + hb_blob_get_length (this->blob); this->edit_count = 0; this->debug_depth = 0; - if (HB_DEBUG_SANITIZE) - fprintf (stderr, "sanitize %p init [%p..%p] (%u bytes)\n", - this->blob, this->start, this->end, this->end - this->start); + DEBUG_MSG (SANITIZE, this->blob, + "init [%p..%p] (%lu bytes)", + this->start, this->end, + (unsigned long) (this->end - this->start)); } inline void finish (void) { - if (HB_DEBUG_SANITIZE) - fprintf (stderr, "sanitize %p fini [%p..%p] %u edit requests\n", - this->blob, this->start, this->end, this->edit_count); + DEBUG_MSG (SANITIZE, this->blob, + "fini [%p..%p] %u edit requests", + this->start, this->end, this->edit_count); - hb_blob_unlock (this->blob); hb_blob_destroy (this->blob); this->blob = NULL; this->start = this->end = NULL; @@ -214,13 +197,12 @@ struct hb_sanitize_context_t p <= this->end && (unsigned int) (this->end - p) >= len; - if (HB_DEBUG_SANITIZE && (int) this->debug_depth < (int) HB_DEBUG_SANITIZE) \ - fprintf (stderr, "SANITIZE(%p) %-*d-> range [%p..%p] (%d bytes) in [%p..%p] -> %s\n", \ - p, - this->debug_depth, this->debug_depth, - p, p + len, len, - this->start, this->end, - ret ? "pass" : "FAIL"); + DEBUG_MSG_LEVEL (SANITIZE, this->blob, this->debug_depth, + "%-*d-> range [%p..%p] (%d bytes) in [%p..%p] -> %s", + this->debug_depth, this->debug_depth, + p, p + len, len, + this->start, this->end, + ret ? "pass" : "FAIL"); return likely (ret); } @@ -228,15 +210,14 @@ struct hb_sanitize_context_t inline bool check_array (const void *base, unsigned int record_size, unsigned int len) const { const char *p = (const char *) base; - bool overflows = len >= ((unsigned int) -1) / record_size; + bool overflows = _hb_unsigned_int_mul_overflows (len, record_size); - if (HB_DEBUG_SANITIZE && (int) this->debug_depth < (int) HB_DEBUG_SANITIZE) - fprintf (stderr, "SANITIZE(%p) %-*d-> array [%p..%p] (%d*%d=%ld bytes) in [%p..%p] -> %s\n", \ - p, - this->debug_depth, this->debug_depth, - p, p + (record_size * len), record_size, len, (unsigned long) record_size * len, - this->start, this->end, - !overflows ? "does not overflow" : "OVERFLOWS FAIL"); + DEBUG_MSG_LEVEL (SANITIZE, this->blob, this->debug_depth, + "%-*d-> array [%p..%p] (%d*%d=%ld bytes) in [%p..%p] -> %s", + this->debug_depth, this->debug_depth, + p, p + (record_size * len), record_size, len, (unsigned long) record_size * len, + this->start, this->end, + !overflows ? "does not overflow" : "OVERFLOWS FAIL"); return likely (!overflows && this->check_range (base, record_size * len)); } @@ -252,14 +233,13 @@ struct hb_sanitize_context_t const char *p = (const char *) base; this->edit_count++; - if (HB_DEBUG_SANITIZE && (int) this->debug_depth < (int) HB_DEBUG_SANITIZE) - fprintf (stderr, "SANITIZE(%p) %-*d-> edit(%u) [%p..%p] (%d bytes) in [%p..%p] -> %s\n", \ - p, - this->debug_depth, this->debug_depth, - this->edit_count, - p, p + len, len, - this->start, this->end, - this->writable ? "granted" : "REJECTED"); + DEBUG_MSG_LEVEL (SANITIZE, this->blob, this->debug_depth, + "%-*d-> edit(%u) [%p..%p] (%d bytes) in [%p..%p] -> %s", + this->debug_depth, this->debug_depth, + this->edit_count, + p, p + len, len, + this->start, this->end, + this->writable ? "granted" : "REJECTED"); return this->writable; } @@ -283,11 +263,12 @@ struct Sanitizer /* TODO is_sane() stuff */ + c->init (blob); + retry: - if (HB_DEBUG_SANITIZE) - fprintf (stderr, "Sanitizer %p start %s\n", blob, HB_FUNC); + DEBUG_MSG_FUNC (SANITIZE, blob, "start"); - c->init (blob); + c->setup (); if (unlikely (!c->start)) { c->finish (); @@ -299,44 +280,45 @@ struct Sanitizer sane = t->sanitize (c); if (sane) { if (c->edit_count) { - if (HB_DEBUG_SANITIZE) - fprintf (stderr, "Sanitizer %p passed first round with %d edits; doing a second round %s\n", - blob, c->edit_count, HB_FUNC); + DEBUG_MSG_FUNC (SANITIZE, blob, "passed first round with %d edits; going for second round", c->edit_count); /* sanitize again to ensure no toe-stepping */ c->edit_count = 0; sane = t->sanitize (c); if (c->edit_count) { - if (HB_DEBUG_SANITIZE) - fprintf (stderr, "Sanitizer %p requested %d edits in second round; FAILLING %s\n", - blob, c->edit_count, HB_FUNC); + DEBUG_MSG_FUNC (SANITIZE, blob, "requested %d edits in second round; FAILLING", c->edit_count); sane = false; } } - c->finish (); } else { unsigned int edit_count = c->edit_count; - c->finish (); - if (edit_count && !hb_blob_is_writable (blob) && hb_blob_try_writable (blob)) { - /* ok, we made it writable by relocating. try again */ - if (HB_DEBUG_SANITIZE) - fprintf (stderr, "Sanitizer %p retry %s\n", blob, HB_FUNC); - goto retry; + if (edit_count && !c->writable) { + c->start = hb_blob_get_data_writable (blob, NULL); + c->end = c->start + hb_blob_get_length (blob); + + if (c->start) { + c->writable = true; + /* ok, we made it writable by relocating. try again */ + DEBUG_MSG_FUNC (SANITIZE, blob, "retry"); + goto retry; + } } } - if (HB_DEBUG_SANITIZE) - fprintf (stderr, "Sanitizer %p %s %s\n", blob, sane ? "passed" : "FAILED", HB_FUNC); + c->finish (); + + DEBUG_MSG_FUNC (SANITIZE, blob, sane ? "PASSED" : "FAILED"); if (sane) return blob; else { hb_blob_destroy (blob); - return hb_blob_create_empty (); + return hb_blob_get_empty (); } } static const Type* lock_instance (hb_blob_t *blob) { - const char *base = hb_blob_lock (blob); + hb_blob_make_immutable (blob); + const char *base = hb_blob_get_data (blob, NULL); return unlikely (!base) ? &Null(Type) : CastP (base); } }; @@ -366,9 +348,9 @@ template class BEInt { public: - inline class BEInt& operator = (Type i) { hb_be_uint16_put (v,i); return *this; } - inline operator Type () const { return hb_be_uint16_get (v); } - inline bool operator == (const BEInt& o) const { return hb_be_uint16_cmp (v, o.v); } + inline void set (Type i) { hb_be_uint16_put (v,i); } + inline operator Type (void) const { return hb_be_uint16_get (v); } + inline bool operator == (const BEInt& o) const { return hb_be_uint16_eq (v, o.v); } inline bool operator != (const BEInt& o) const { return !(*this == o); } private: uint8_t v[2]; }; @@ -376,9 +358,9 @@ template class BEInt { public: - inline class BEInt& operator = (Type i) { hb_be_uint32_put (v,i); return *this; } - inline operator Type () const { return hb_be_uint32_get (v); } - inline bool operator == (const BEInt& o) const { return hb_be_uint32_cmp (v, o.v); } + inline void set (Type i) { hb_be_uint32_put (v,i); } + inline operator Type (void) const { return hb_be_uint32_get (v); } + inline bool operator == (const BEInt& o) const { return hb_be_uint32_eq (v, o.v); } inline bool operator != (const BEInt& o) const { return !(*this == o); } private: uint8_t v[4]; }; @@ -387,10 +369,11 @@ class BEInt template struct IntType { - inline void set (Type i) { v = i; } + inline void set (Type i) { v.set (i); } inline operator Type(void) const { return v; } inline bool operator == (const IntType &o) const { return v == o.v; } inline bool operator != (const IntType &o) const { return v != o.v; } + inline int cmp (Type a) const { Type b = v; return a < b ? -1 : a == b ? 0 : +1; } inline bool sanitize (hb_sanitize_context_t *c) { TRACE_SANITIZE (); return likely (c->check_struct (this)); @@ -472,7 +455,7 @@ struct CheckSum : ULONG struct FixedVersion { - inline operator uint32_t (void) const { return (major << 16) + minor; } + inline uint32_t to_int (void) const { return (major << 16) + minor; } inline bool sanitize (hb_sanitize_context_t *c) { TRACE_SANITIZE (); @@ -564,24 +547,22 @@ struct GenericArrayOf if (unlikely (i >= len)) return Null(Type); return array[i]; } - inline unsigned int get_size () const + inline unsigned int get_size (void) const { return len.static_size + len * Type::static_size; } inline bool sanitize (hb_sanitize_context_t *c) { TRACE_SANITIZE (); if (unlikely (!sanitize_shallow (c))) return false; + /* Note: for structs that do not reference other structs, * we do not need to call their sanitize() as we already did - * a bound check on the aggregate array size, hence the return. + * a bound check on the aggregate array size. We just include + * a small unreachable expression to make sure the structs + * pointed to do have a simple sanitize(), ie. they do not + * reference other structs via offsets. */ - return true; - /* We do keep this code though to make sure the structs pointed - * to do have a simple sanitize(), ie. they do not reference - * other structs. */ - unsigned int count = len; - for (unsigned int i = 0; i < count; i++) - if (array[i].sanitize (c)) - return false; + (void) (false && array[0].sanitize (c)); + return true; } inline bool sanitize (hb_sanitize_context_t *c, void *base) { @@ -670,7 +651,7 @@ struct HeadlessArrayOf if (unlikely (i >= len || !i)) return Null(Type); return array[i-1]; } - inline unsigned int get_size () const + inline unsigned int get_size (void) const { return len.static_size + (len ? len - 1 : 0) * Type::static_size; } inline bool sanitize_shallow (hb_sanitize_context_t *c) { @@ -681,19 +662,16 @@ struct HeadlessArrayOf inline bool sanitize (hb_sanitize_context_t *c) { TRACE_SANITIZE (); if (unlikely (!sanitize_shallow (c))) return false; + /* Note: for structs that do not reference other structs, * we do not need to call their sanitize() as we already did - * a bound check on the aggregate array size, hence the return. + * a bound check on the aggregate array size. We just include + * a small unreachable expression to make sure the structs + * pointed to do have a simple sanitize(), ie. they do not + * reference other structs via offsets. */ - return true; - /* We do keep this code though to make sure the structs pointed - * to do have a simple sanitize(), ie. they do not reference - * other structs. */ - unsigned int count = len ? len - 1 : 0; - Type *a = array; - for (unsigned int i = 0; i < count; i++) - if (unlikely (!a[i].sanitize (c))) - return false; + (void) (false && array[0].sanitize (c)); + return true; } @@ -704,4 +682,22 @@ struct HeadlessArrayOf }; +/* An array with sorted elements. Supports binary searching. */ +template +struct SortedArrayOf : ArrayOf { + + template + inline int search (const SearchType &x) const { + class Cmp { + public: static int cmp (const SearchType *a, const Type *b) { return b->cmp (*a); } + }; + const Type *p = (const Type *) bsearch (&x, this->array, this->len, sizeof (this->array[0]), (hb_compare_func_t) Cmp::cmp); + return p ? p - this->array : -1; + } +}; + + +HB_BEGIN_DECLS +HB_END_DECLS + #endif /* HB_OPEN_TYPE_PRIVATE_HH */