| 1 | /* |
| 2 | * Copyright © 2018 Google, Inc. |
| 3 | * |
| 4 | * This is part of HarfBuzz, a text shaping library. |
| 5 | * |
| 6 | * Permission is hereby granted, without written agreement and without |
| 7 | * license or royalty fees, to use, copy, modify, and distribute this |
| 8 | * software and its documentation for any purpose, provided that the |
| 9 | * above copyright notice and the following two paragraphs appear in |
| 10 | * all copies of this software. |
| 11 | * |
| 12 | * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR |
| 13 | * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES |
| 14 | * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN |
| 15 | * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH |
| 16 | * DAMAGE. |
| 17 | * |
| 18 | * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, |
| 19 | * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND |
| 20 | * FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS |
| 21 | * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO |
| 22 | * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS. |
| 23 | * |
| 24 | * Google Author(s): Behdad Esfahbod |
| 25 | */ |
| 26 | |
| 27 | #include "hb.hh" |
| 28 | |
| 29 | #include "hb-open-type.hh" |
| 30 | #include "hb-face.hh" |
| 31 | |
| 32 | #include "hb-aat-layout-common.hh" |
| 33 | #include "hb-aat-layout-feat-table.hh" |
| 34 | #include "hb-ot-layout-common.hh" |
| 35 | #include "hb-ot-cmap-table.hh" |
| 36 | #include "hb-ot-head-table.hh" |
| 37 | #include "hb-ot-maxp-table.hh" |
| 38 | |
| 39 | #ifndef HB_NO_VISIBILITY |
| 40 | #include "hb-ot-name-language-static.hh" |
| 41 | |
| 42 | uint64_t const _hb_NullPool[(HB_NULL_POOL_SIZE + sizeof (uint64_t) - 1) / sizeof (uint64_t)] = {}; |
| 43 | /*thread_local*/ uint64_t _hb_CrapPool[(HB_NULL_POOL_SIZE + sizeof (uint64_t) - 1) / sizeof (uint64_t)] = {}; |
| 44 | |
| 45 | DEFINE_NULL_NAMESPACE_BYTES (OT, Index) = {0xFF,0xFF}; |
| 46 | DEFINE_NULL_NAMESPACE_BYTES (OT, LangSys) = {0x00,0x00, 0xFF,0xFF, 0x00,0x00}; |
| 47 | DEFINE_NULL_NAMESPACE_BYTES (OT, RangeRecord) = {0x00,0x01, 0x00,0x00, 0x00, 0x00}; |
| 48 | DEFINE_NULL_NAMESPACE_BYTES (OT, CmapSubtableLongGroup) = {0x00,0x00,0x00,0x01, 0x00,0x00,0x00,0x00, 0x00,0x00,0x00,0x00}; |
| 49 | DEFINE_NULL_NAMESPACE_BYTES (AAT, SettingName) = {0xFF,0xFF, 0xFF,0xFF}; |
| 50 | /* Hand-coded because Lookup is a template. Sad. */ |
| 51 | const unsigned char _hb_Null_AAT_Lookup[2] = {0xFF, 0xFF}; |
| 52 | |
| 53 | |
| 54 | |
| 55 | /* hb_face_t */ |
| 56 | |
| 57 | unsigned int |
| 58 | hb_face_t::load_num_glyphs () const |
| 59 | { |
| 60 | hb_sanitize_context_t c = hb_sanitize_context_t (); |
| 61 | c.set_num_glyphs (0); /* So we don't recurse ad infinitum. */ |
| 62 | hb_blob_t *maxp_blob = c.reference_table<OT::maxp> (this); |
| 63 | const OT::maxp *maxp_table = maxp_blob->as<OT::maxp> (); |
| 64 | |
| 65 | unsigned int ret = maxp_table->get_num_glyphs (); |
| 66 | num_glyphs.set_relaxed (ret); |
| 67 | hb_blob_destroy (maxp_blob); |
| 68 | return ret; |
| 69 | } |
| 70 | |
| 71 | unsigned int |
| 72 | hb_face_t::load_upem () const |
| 73 | { |
| 74 | unsigned int ret = table.head->get_upem (); |
| 75 | upem.set_relaxed (ret); |
| 76 | return ret; |
| 77 | } |
| 78 | |
| 79 | |
| 80 | /* hb_user_data_array_t */ |
| 81 | |
| 82 | bool |
| 83 | hb_user_data_array_t::set (hb_user_data_key_t *key, |
| 84 | void * data, |
| 85 | hb_destroy_func_t destroy, |
| 86 | hb_bool_t replace) |
| 87 | { |
| 88 | if (!key) |
| 89 | return false; |
| 90 | |
| 91 | if (replace) { |
| 92 | if (!data && !destroy) { |
| 93 | items.remove (key, lock); |
| 94 | return true; |
| 95 | } |
| 96 | } |
| 97 | hb_user_data_item_t item = {key, data, destroy}; |
| 98 | bool ret = !!items.replace_or_insert (item, lock, (bool) replace); |
| 99 | |
| 100 | return ret; |
| 101 | } |
| 102 | |
| 103 | void * |
| 104 | hb_user_data_array_t::get (hb_user_data_key_t *key) |
| 105 | { |
| 106 | hb_user_data_item_t item = {nullptr, nullptr, nullptr}; |
| 107 | |
| 108 | return items.find (key, &item, lock) ? item.data : nullptr; |
| 109 | } |
| 110 | |
| 111 | |
| 112 | #endif |
| 113 | |