OLD | NEW |
(Empty) | |
| 1 /* |
| 2 * Copyright © 2009 Red Hat, Inc. |
| 3 * Copyright © 2011 Codethink Limited |
| 4 * Copyright © 2010,2011 Google, Inc. |
| 5 * |
| 6 * This is part of HarfBuzz, a text shaping library. |
| 7 * |
| 8 * Permission is hereby granted, without written agreement and without |
| 9 * license or royalty fees, to use, copy, modify, and distribute this |
| 10 * software and its documentation for any purpose, provided that the |
| 11 * above copyright notice and the following two paragraphs appear in |
| 12 * all copies of this software. |
| 13 * |
| 14 * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR |
| 15 * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES |
| 16 * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN |
| 17 * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH |
| 18 * DAMAGE. |
| 19 * |
| 20 * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, |
| 21 * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND |
| 22 * FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS |
| 23 * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO |
| 24 * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS. |
| 25 * |
| 26 * Red Hat Author(s): Behdad Esfahbod |
| 27 * Codethink Author(s): Ryan Lortie |
| 28 * Google Author(s): Behdad Esfahbod |
| 29 */ |
| 30 |
| 31 #ifndef HB_UNICODE_PRIVATE_HH |
| 32 #define HB_UNICODE_PRIVATE_HH |
| 33 |
| 34 #include "hb-private.hh" |
| 35 |
| 36 #include "hb-unicode.h" |
| 37 #include "hb-object-private.hh" |
| 38 |
| 39 |
| 40 |
| 41 /* |
| 42 * hb_unicode_funcs_t |
| 43 */ |
| 44 |
| 45 #define HB_UNICODE_FUNCS_IMPLEMENT_CALLBACKS \ |
| 46 HB_UNICODE_FUNC_IMPLEMENT (combining_class) \ |
| 47 HB_UNICODE_FUNC_IMPLEMENT (eastasian_width) \ |
| 48 HB_UNICODE_FUNC_IMPLEMENT (general_category) \ |
| 49 HB_UNICODE_FUNC_IMPLEMENT (mirroring) \ |
| 50 HB_UNICODE_FUNC_IMPLEMENT (script) \ |
| 51 HB_UNICODE_FUNC_IMPLEMENT (compose) \ |
| 52 HB_UNICODE_FUNC_IMPLEMENT (decompose) \ |
| 53 /* ^--- Add new callbacks here */ |
| 54 |
| 55 /* Simple callbacks are those taking a hb_codepoint_t and returning a hb_codepoi
nt_t */ |
| 56 #define HB_UNICODE_FUNCS_IMPLEMENT_CALLBACKS_SIMPLE \ |
| 57 HB_UNICODE_FUNC_IMPLEMENT (unsigned int, combining_class) \ |
| 58 HB_UNICODE_FUNC_IMPLEMENT (unsigned int, eastasian_width) \ |
| 59 HB_UNICODE_FUNC_IMPLEMENT (hb_unicode_general_category_t, general_category) \ |
| 60 HB_UNICODE_FUNC_IMPLEMENT (hb_codepoint_t, mirroring) \ |
| 61 HB_UNICODE_FUNC_IMPLEMENT (hb_script_t, script) \ |
| 62 /* ^--- Add new simple callbacks here */ |
| 63 |
| 64 struct _hb_unicode_funcs_t { |
| 65 hb_object_header_t header; |
| 66 |
| 67 hb_unicode_funcs_t *parent; |
| 68 |
| 69 bool immutable; |
| 70 |
| 71 /* Don't access these directly. Call hb_unicode_*() instead. */ |
| 72 |
| 73 struct { |
| 74 #define HB_UNICODE_FUNC_IMPLEMENT(name) hb_unicode_##name##_func_t name; |
| 75 HB_UNICODE_FUNCS_IMPLEMENT_CALLBACKS |
| 76 #undef HB_UNICODE_FUNC_IMPLEMENT |
| 77 } func; |
| 78 |
| 79 struct { |
| 80 #define HB_UNICODE_FUNC_IMPLEMENT(name) void *name; |
| 81 HB_UNICODE_FUNCS_IMPLEMENT_CALLBACKS |
| 82 #undef HB_UNICODE_FUNC_IMPLEMENT |
| 83 } user_data; |
| 84 |
| 85 struct { |
| 86 #define HB_UNICODE_FUNC_IMPLEMENT(name) hb_destroy_func_t name; |
| 87 HB_UNICODE_FUNCS_IMPLEMENT_CALLBACKS |
| 88 #undef HB_UNICODE_FUNC_IMPLEMENT |
| 89 } destroy; |
| 90 }; |
| 91 |
| 92 |
| 93 #ifdef HAVE_GLIB |
| 94 extern HB_INTERNAL hb_unicode_funcs_t _hb_glib_unicode_funcs; |
| 95 #define _hb_unicode_funcs_default _hb_glib_unicode_funcs |
| 96 #elif defined(HAVE_ICU) |
| 97 extern HB_INTERNAL hb_unicode_funcs_t _hb_icu_unicode_funcs; |
| 98 #define _hb_unicode_funcs_default _hb_icu_unicode_funcs |
| 99 #else |
| 100 extern HB_INTERNAL hb_unicode_funcs_t _hb_unicode_funcs_nil; |
| 101 #define _hb_unicode_funcs_default _hb_unicode_funcs_nil |
| 102 #endif |
| 103 |
| 104 |
| 105 |
| 106 |
| 107 #endif /* HB_UNICODE_PRIVATE_HH */ |
OLD | NEW |