2 * Copyright © 2009,2010 Red Hat, Inc.
3 * Copyright © 2011,2012 Google, Inc.
5 * This is part of HarfBuzz, a text shaping library.
7 * Permission is hereby granted, without written agreement and without
8 * license or royalty fees, to use, copy, modify, and distribute this
9 * software and its documentation for any purpose, provided that the
10 * above copyright notice and the following two paragraphs appear in
11 * all copies of this software.
13 * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR
14 * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
15 * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN
16 * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
19 * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING,
20 * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
21 * FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
22 * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO
23 * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
25 * Red Hat Author(s): Behdad Esfahbod
26 * Google Author(s): Behdad Esfahbod
29 #include "hb-private.hh"
31 #include "hb-mutex-private.hh"
32 #include "hb-object-private.hh"
39 hb_options_union_t _hb_options
;
42 _hb_options_init (void)
46 u
.opts
.initialized
= 1;
48 char *c
= getenv ("HB_OPTIONS");
49 u
.opts
.uniscribe_bug_compatible
= c
&& strstr (c
, "uniscribe-bug-compatible");
51 /* This is idempotent and threadsafe. */
60 * @str: (array length=len):
70 hb_tag_from_string (const char *str
, int len
)
75 if (!str
|| !len
|| !*str
)
78 if (len
< 0 || len
> 4)
80 for (i
= 0; i
< (unsigned) len
&& str
[i
]; i
++)
85 return HB_TAG_CHAR4 (tag
);
91 * @buf: (array fixed-size=4):
98 hb_tag_to_string (hb_tag_t tag
, char *buf
)
100 buf
[0] = (char) (uint8_t) (tag
>> 24);
101 buf
[1] = (char) (uint8_t) (tag
>> 16);
102 buf
[2] = (char) (uint8_t) (tag
>> 8);
103 buf
[3] = (char) (uint8_t) (tag
>> 0);
109 const char direction_strings
[][4] = {
117 * hb_direction_from_string:
118 * @str: (array length=len):
128 hb_direction_from_string (const char *str
, int len
)
130 if (unlikely (!str
|| !len
|| !*str
))
131 return HB_DIRECTION_INVALID
;
133 /* Lets match loosely: just match the first letter, such that
134 * all of "ltr", "left-to-right", etc work!
136 char c
= TOLOWER (str
[0]);
137 for (unsigned int i
= 0; i
< ARRAY_LENGTH (direction_strings
); i
++)
138 if (c
== direction_strings
[i
][0])
139 return (hb_direction_t
) (HB_DIRECTION_LTR
+ i
);
141 return HB_DIRECTION_INVALID
;
145 * hb_direction_to_string:
150 * Return value: (transfer none):
155 hb_direction_to_string (hb_direction_t direction
)
157 if (likely ((unsigned int) (direction
- HB_DIRECTION_LTR
)
158 < ARRAY_LENGTH (direction_strings
)))
159 return direction_strings
[direction
- HB_DIRECTION_LTR
];
167 struct hb_language_impl_t
{
171 static const char canon_map
[256] = {
172 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
173 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
174 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, '-', 0, 0,
175 '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 0, 0, 0, 0, 0, 0,
176 '-', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o',
177 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 0, 0, 0, 0, '-',
178 0, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o',
179 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 0, 0, 0, 0, 0
183 lang_equal (hb_language_t v1
,
186 const unsigned char *p1
= (const unsigned char *) v1
;
187 const unsigned char *p2
= (const unsigned char *) v2
;
189 while (*p1
&& *p1
== canon_map
[*p2
])
192 return *p1
== canon_map
[*p2
];
197 lang_hash (const void *key
)
199 const unsigned char *p
= key
;
201 while (canon_map
[*p
])
203 h
= (h
<< 5) - h
+ canon_map
[*p
];
212 struct hb_language_item_t
{
214 struct hb_language_item_t
*next
;
217 inline bool operator == (const char *s
) const {
218 return lang_equal (lang
, s
);
221 inline hb_language_item_t
& operator = (const char *s
) {
222 lang
= (hb_language_t
) strdup (s
);
223 for (unsigned char *p
= (unsigned char *) lang
; *p
; p
++)
229 void finish (void) { free ((void *) lang
); }
233 /* Thread-safe lock-free language list */
235 static hb_language_item_t
*langs
;
239 void free_langs (void)
242 hb_language_item_t
*next
= langs
->next
;
250 static hb_language_item_t
*
251 lang_find_or_insert (const char *key
)
254 hb_language_item_t
*first_lang
= (hb_language_item_t
*) hb_atomic_ptr_get (&langs
);
256 for (hb_language_item_t
*lang
= first_lang
; lang
; lang
= lang
->next
)
260 /* Not found; allocate one. */
261 hb_language_item_t
*lang
= (hb_language_item_t
*) calloc (1, sizeof (hb_language_item_t
));
262 if (unlikely (!lang
))
264 lang
->next
= first_lang
;
267 if (!hb_atomic_ptr_cmpexch (&langs
, first_lang
, lang
)) {
274 atexit (free_langs
); /* First person registers atexit() callback. */
282 * hb_language_from_string:
283 * @str: (array length=len):
293 hb_language_from_string (const char *str
, int len
)
297 if (!str
|| !len
|| !*str
)
298 return HB_LANGUAGE_INVALID
;
302 /* NUL-terminate it. */
303 len
= MIN (len
, (int) sizeof (strbuf
) - 1);
304 memcpy (strbuf
, str
, len
);
309 hb_language_item_t
*item
= lang_find_or_insert (str
);
311 return likely (item
) ? item
->lang
: HB_LANGUAGE_INVALID
;
315 * hb_language_to_string:
320 * Return value: (transfer none):
325 hb_language_to_string (hb_language_t language
)
327 /* This is actually NULL-safe! */
332 * hb_language_get_default:
341 hb_language_get_default (void)
343 static hb_language_t default_language
= HB_LANGUAGE_INVALID
;
345 hb_language_t language
= (hb_language_t
) hb_atomic_ptr_get (&default_language
);
346 if (unlikely (language
== HB_LANGUAGE_INVALID
)) {
347 language
= hb_language_from_string (setlocale (LC_CTYPE
, NULL
), -1);
348 hb_atomic_ptr_cmpexch (&default_language
, HB_LANGUAGE_INVALID
, language
);
351 return default_language
;
358 * hb_script_from_iso15924_tag:
368 hb_script_from_iso15924_tag (hb_tag_t tag
)
370 if (unlikely (tag
== HB_TAG_NONE
))
371 return HB_SCRIPT_INVALID
;
373 /* Be lenient, adjust case (one capital letter followed by three small letters) */
374 tag
= (tag
& 0xDFDFDFDFu
) | 0x00202020u
;
378 /* These graduated from the 'Q' private-area codes, but
379 * the old code is still aliased by Unicode, and the Qaai
380 * one in use by ICU. */
381 case HB_TAG('Q','a','a','i'): return HB_SCRIPT_INHERITED
;
382 case HB_TAG('Q','a','a','c'): return HB_SCRIPT_COPTIC
;
384 /* Script variants from http://unicode.org/iso15924/ */
385 case HB_TAG('C','y','r','s'): return HB_SCRIPT_CYRILLIC
;
386 case HB_TAG('L','a','t','f'): return HB_SCRIPT_LATIN
;
387 case HB_TAG('L','a','t','g'): return HB_SCRIPT_LATIN
;
388 case HB_TAG('S','y','r','e'): return HB_SCRIPT_SYRIAC
;
389 case HB_TAG('S','y','r','j'): return HB_SCRIPT_SYRIAC
;
390 case HB_TAG('S','y','r','n'): return HB_SCRIPT_SYRIAC
;
393 /* If it looks right, just use the tag as a script */
394 if (((uint32_t) tag
& 0xE0E0E0E0u
) == 0x40606060u
)
395 return (hb_script_t
) tag
;
397 /* Otherwise, return unknown */
398 return HB_SCRIPT_UNKNOWN
;
402 * hb_script_from_string:
403 * @s: (array length=len):
413 hb_script_from_string (const char *s
, int len
)
415 return hb_script_from_iso15924_tag (hb_tag_from_string (s
, len
));
419 * hb_script_to_iso15924_tag:
429 hb_script_to_iso15924_tag (hb_script_t script
)
431 return (hb_tag_t
) script
;
435 * hb_script_get_horizontal_direction:
445 hb_script_get_horizontal_direction (hb_script_t script
)
447 /* http://goo.gl/x9ilM */
448 switch ((hb_tag_t
) script
)
450 /* Unicode-1.1 additions */
451 case HB_SCRIPT_ARABIC
:
452 case HB_SCRIPT_HEBREW
:
454 /* Unicode-3.0 additions */
455 case HB_SCRIPT_SYRIAC
:
456 case HB_SCRIPT_THAANA
:
458 /* Unicode-4.0 additions */
459 case HB_SCRIPT_CYPRIOT
:
461 /* Unicode-4.1 additions */
462 case HB_SCRIPT_KHAROSHTHI
:
464 /* Unicode-5.0 additions */
465 case HB_SCRIPT_PHOENICIAN
:
468 /* Unicode-5.1 additions */
469 case HB_SCRIPT_LYDIAN
:
471 /* Unicode-5.2 additions */
472 case HB_SCRIPT_AVESTAN
:
473 case HB_SCRIPT_IMPERIAL_ARAMAIC
:
474 case HB_SCRIPT_INSCRIPTIONAL_PAHLAVI
:
475 case HB_SCRIPT_INSCRIPTIONAL_PARTHIAN
:
476 case HB_SCRIPT_OLD_SOUTH_ARABIAN
:
477 case HB_SCRIPT_OLD_TURKIC
:
478 case HB_SCRIPT_SAMARITAN
:
480 /* Unicode-6.0 additions */
481 case HB_SCRIPT_MANDAIC
:
483 /* Unicode-6.1 additions */
484 case HB_SCRIPT_MEROITIC_CURSIVE
:
485 case HB_SCRIPT_MEROITIC_HIEROGLYPHS
:
487 /* Unicode-7.0 additions */
488 case HB_SCRIPT_MANICHAEAN
:
489 case HB_SCRIPT_MENDE_KIKAKUI
:
490 case HB_SCRIPT_NABATAEAN
:
491 case HB_SCRIPT_OLD_NORTH_ARABIAN
:
492 case HB_SCRIPT_PALMYRENE
:
493 case HB_SCRIPT_PSALTER_PAHLAVI
:
495 return HB_DIRECTION_RTL
;
498 return HB_DIRECTION_LTR
;
502 /* hb_user_data_array_t */
505 hb_user_data_array_t::set (hb_user_data_key_t
*key
,
507 hb_destroy_func_t destroy
,
514 if (!data
&& !destroy
) {
515 items
.remove (key
, lock
);
519 hb_user_data_item_t item
= {key
, data
, destroy
};
520 bool ret
= !!items
.replace_or_insert (item
, lock
, replace
);
526 hb_user_data_array_t::get (hb_user_data_key_t
*key
)
528 hb_user_data_item_t item
= {NULL
};
530 return items
.find (key
, &item
, lock
) ? item
.data
: NULL
;
538 * @major: (out): Library major version component.
539 * @minor: (out): Library minor version component.
540 * @micro: (out): Library micro version component.
542 * Returns library version as three integer components.
547 hb_version (unsigned int *major
,
551 *major
= HB_VERSION_MAJOR
;
552 *minor
= HB_VERSION_MINOR
;
553 *micro
= HB_VERSION_MICRO
;
559 * Returns library version as a string with three components.
561 * Return value: library version string.
566 hb_version_string (void)
568 return HB_VERSION_STRING
;
572 * hb_version_atleast:
584 hb_version_atleast (unsigned int major
,
588 return HB_VERSION_ATLEAST (major
, minor
, micro
);