2011-08-06 02:34:50 +02:00
|
|
|
/*
|
2012-05-11 01:25:34 +02:00
|
|
|
* Copyright © 2011,2012 Google, Inc.
|
2011-08-06 02:34:50 +02:00
|
|
|
*
|
|
|
|
* 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
|
|
|
|
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
|
|
|
|
* ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN
|
|
|
|
* IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
|
|
|
|
* DAMAGE.
|
|
|
|
*
|
|
|
|
* THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING,
|
|
|
|
* BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
|
|
|
|
* ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO
|
|
|
|
* PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
|
|
|
|
*
|
|
|
|
* Google Author(s): Behdad Esfahbod
|
|
|
|
*/
|
|
|
|
|
2011-08-17 14:19:59 +02:00
|
|
|
#ifndef HB_OT_NAME_TABLE_HH
|
|
|
|
#define HB_OT_NAME_TABLE_HH
|
2011-08-06 02:34:50 +02:00
|
|
|
|
|
|
|
#include "hb-open-type-private.hh"
|
|
|
|
|
|
|
|
|
2012-08-28 23:57:49 +02:00
|
|
|
namespace OT {
|
|
|
|
|
2011-08-06 02:34:50 +02:00
|
|
|
|
|
|
|
/*
|
2011-08-17 14:43:45 +02:00
|
|
|
* name -- The Naming Table
|
2011-08-06 02:34:50 +02:00
|
|
|
*/
|
|
|
|
|
|
|
|
#define HB_OT_TAG_name HB_TAG('n','a','m','e')
|
|
|
|
|
2011-08-17 14:43:45 +02:00
|
|
|
|
2011-08-06 02:34:50 +02:00
|
|
|
struct NameRecord
|
|
|
|
{
|
2011-08-07 04:06:52 +02:00
|
|
|
static int cmp (const NameRecord *a, const NameRecord *b)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
ret = b->platformID.cmp (a->platformID);
|
|
|
|
if (ret) return ret;
|
|
|
|
ret = b->encodingID.cmp (a->encodingID);
|
|
|
|
if (ret) return ret;
|
|
|
|
ret = b->languageID.cmp (a->languageID);
|
|
|
|
if (ret) return ret;
|
|
|
|
ret = b->nameID.cmp (a->nameID);
|
|
|
|
if (ret) return ret;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2015-02-17 15:27:44 +01:00
|
|
|
inline bool sanitize (hb_sanitize_context_t *c, const void *base) const
|
|
|
|
{
|
2012-11-23 21:32:14 +01:00
|
|
|
TRACE_SANITIZE (this);
|
2011-08-06 02:34:50 +02:00
|
|
|
/* We can check from base all the way up to the end of string... */
|
2012-05-11 01:25:34 +02:00
|
|
|
return TRACE_RETURN (c->check_struct (this) && c->check_range ((char *) base, (unsigned int) length + offset));
|
2011-08-06 02:34:50 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
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);
|
|
|
|
};
|
|
|
|
|
|
|
|
struct name
|
|
|
|
{
|
2013-09-09 21:43:10 +02:00
|
|
|
static const hb_tag_t tableTag = HB_OT_TAG_name;
|
2011-08-06 02:34:50 +02:00
|
|
|
|
2011-08-07 04:06:52 +02:00
|
|
|
inline unsigned int get_name (unsigned int platform_id,
|
|
|
|
unsigned int encoding_id,
|
|
|
|
unsigned int language_id,
|
|
|
|
unsigned int name_id,
|
|
|
|
void *buffer,
|
|
|
|
unsigned int buffer_length) const
|
|
|
|
{
|
|
|
|
NameRecord key;
|
|
|
|
key.platformID.set (platform_id);
|
|
|
|
key.encodingID.set (encoding_id);
|
|
|
|
key.languageID.set (language_id);
|
|
|
|
key.nameID.set (name_id);
|
|
|
|
NameRecord *match = (NameRecord *) bsearch (&key, nameRecord, count, sizeof (nameRecord[0]), (hb_compare_func_t) NameRecord::cmp);
|
|
|
|
|
|
|
|
if (!match)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
unsigned int length = MIN (buffer_length, (unsigned int) match->length);
|
2011-08-07 06:00:27 +02:00
|
|
|
memcpy (buffer, (char *) this + stringOffset + match->offset, length);
|
2011-08-07 04:06:52 +02:00
|
|
|
return length;
|
|
|
|
}
|
|
|
|
|
2013-07-21 23:05:02 +02:00
|
|
|
inline unsigned int get_size (void) const
|
|
|
|
{ return min_size + count * nameRecord[0].min_size; }
|
|
|
|
|
2011-08-06 02:34:50 +02:00
|
|
|
inline bool sanitize_records (hb_sanitize_context_t *c) {
|
2012-11-23 21:32:14 +01:00
|
|
|
TRACE_SANITIZE (this);
|
2011-08-17 14:47:41 +02:00
|
|
|
char *string_pool = (char *) this + stringOffset;
|
2011-08-06 02:34:50 +02:00
|
|
|
unsigned int _count = count;
|
|
|
|
for (unsigned int i = 0; i < _count; i++)
|
2012-05-11 01:25:34 +02:00
|
|
|
if (!nameRecord[i].sanitize (c, string_pool)) return TRACE_RETURN (false);
|
|
|
|
return TRACE_RETURN (true);
|
2011-08-06 02:34:50 +02:00
|
|
|
}
|
|
|
|
|
2015-02-17 15:27:44 +01:00
|
|
|
inline bool sanitize (hb_sanitize_context_t *c) const
|
|
|
|
{
|
2012-11-23 21:32:14 +01:00
|
|
|
TRACE_SANITIZE (this);
|
2012-05-11 01:25:34 +02:00
|
|
|
return TRACE_RETURN (c->check_struct (this) &&
|
|
|
|
likely (format == 0 || format == 1) &&
|
|
|
|
c->check_array (nameRecord, nameRecord[0].static_size, count) &&
|
|
|
|
sanitize_records (c));
|
2011-08-06 02:34:50 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* We only implement format 0 for now. */
|
|
|
|
USHORT format; /* Format selector (=0/1). */
|
|
|
|
USHORT count; /* Number of name records. */
|
2014-07-09 23:40:52 +02:00
|
|
|
Offset<> stringOffset; /* Offset to start of string storage (from start of table). */
|
2011-08-06 02:34:50 +02:00
|
|
|
NameRecord nameRecord[VAR]; /* The name records where count is the number of records. */
|
|
|
|
public:
|
|
|
|
DEFINE_SIZE_ARRAY (6, nameRecord);
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2012-11-17 03:49:54 +01:00
|
|
|
} /* namespace OT */
|
2012-08-28 23:57:49 +02:00
|
|
|
|
2011-08-06 02:34:50 +02:00
|
|
|
|
2011-08-17 14:19:59 +02:00
|
|
|
#endif /* HB_OT_NAME_TABLE_HH */
|