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): Garret Rieger, Roderick Sheeter 25 */ 26 27 #ifndef HB_SUBSET_PLAN_HH 28 #define HB_SUBSET_PLAN_HH 29 30 #include "hb.hh" 31 32 #include "hb-subset.h" 33 #include "hb-subset-input.hh" 34 35 #include "hb-map.hh" 36 37 struct hb_subset_plan_t 38 { 39 hb_object_header_t header; 40 41 bool drop_hints : 1; 42 bool drop_layout : 1; 43 bool desubroutinize : 1; 44 45 // For each cp that we'd like to retain maps to the corresponding gid. 46 hb_set_t *unicodes; 47 48 hb_vector_t<hb_codepoint_t> glyphs; 49 hb_set_t *glyphset; 50 51 hb_map_t *codepoint_to_glyph; 52 hb_map_t *glyph_map; 53 54 // Plan is only good for a specific source/dest so keep them with it 55 hb_face_t *source; 56 hb_face_t *dest; 57 new_gid_for_codepointhb_subset_plan_t58 bool new_gid_for_codepoint (hb_codepoint_t codepoint, 59 hb_codepoint_t *new_gid) const 60 { 61 hb_codepoint_t old_gid = codepoint_to_glyph->get (codepoint); 62 if (old_gid == HB_MAP_VALUE_INVALID) 63 return false; 64 65 return new_gid_for_old_gid (old_gid, new_gid); 66 } 67 new_gid_for_old_gidhb_subset_plan_t68 bool new_gid_for_old_gid (hb_codepoint_t old_gid, 69 hb_codepoint_t *new_gid) const 70 { 71 hb_codepoint_t gid = glyph_map->get (old_gid); 72 if (gid == HB_MAP_VALUE_INVALID) 73 return false; 74 75 *new_gid = gid; 76 return true; 77 } 78 79 bool add_tablehb_subset_plan_t80 add_table (hb_tag_t tag, 81 hb_blob_t *contents) 82 { 83 hb_blob_t *source_blob = source->reference_table (tag); 84 DEBUG_MSG(SUBSET, nullptr, "add table %c%c%c%c, dest %d bytes, source %d bytes", 85 HB_UNTAG(tag), 86 hb_blob_get_length (contents), 87 hb_blob_get_length (source_blob)); 88 hb_blob_destroy (source_blob); 89 return hb_face_builder_add_table (dest, tag, contents); 90 } 91 }; 92 93 typedef struct hb_subset_plan_t hb_subset_plan_t; 94 95 HB_INTERNAL hb_subset_plan_t * 96 hb_subset_plan_create (hb_face_t *face, 97 hb_subset_input_t *input); 98 99 HB_INTERNAL void 100 hb_subset_plan_destroy (hb_subset_plan_t *plan); 101 102 #endif /* HB_SUBSET_PLAN_HH */ 103