PageRenderTime 35ms CodeModel.GetById 11ms RepoModel.GetById 1ms app.codeStats 0ms

/gfx/harfbuzz/src/hb-ot-map-private.hh

https://bitbucket.org/soko/mozilla-central
C++ Header | 191 lines | 119 code | 45 blank | 27 comment | 2 complexity | 5f393bf5f0e0f11f5e61faa5e3043144 MD5 | raw file
Possible License(s): GPL-2.0, JSON, 0BSD, LGPL-3.0, AGPL-1.0, MIT, MPL-2.0-no-copyleft-exception, BSD-3-Clause, LGPL-2.1, Apache-2.0
  1. /*
  2. * Copyright © 2009,2010 Red Hat, Inc.
  3. * Copyright © 2010,2011 Google, Inc.
  4. *
  5. * This is part of HarfBuzz, a text shaping library.
  6. *
  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.
  12. *
  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
  17. * DAMAGE.
  18. *
  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.
  24. *
  25. * Red Hat Author(s): Behdad Esfahbod
  26. * Google Author(s): Behdad Esfahbod
  27. */
  28. #ifndef HB_OT_MAP_PRIVATE_HH
  29. #define HB_OT_MAP_PRIVATE_HH
  30. #include "hb-buffer-private.hh"
  31. #include "hb-ot-layout.h"
  32. static const hb_tag_t table_tags[2] = {HB_OT_TAG_GSUB, HB_OT_TAG_GPOS};
  33. struct hb_ot_map_t
  34. {
  35. friend struct hb_ot_map_builder_t;
  36. public:
  37. hb_ot_map_t (void) { memset (this, 0, sizeof (*this)); }
  38. typedef void (*gsub_pause_func_t) (const hb_ot_map_t *map, hb_face_t *face, hb_buffer_t *buffer, void *user_data);
  39. typedef void (*gpos_pause_func_t) (const hb_ot_map_t *map, hb_font_t *font, hb_buffer_t *buffer, void *user_data);
  40. inline hb_mask_t get_global_mask (void) const { return global_mask; }
  41. inline hb_mask_t get_mask (hb_tag_t tag, unsigned int *shift = NULL) const {
  42. const feature_map_t *map = features.bsearch (&tag);
  43. if (shift) *shift = map ? map->shift : 0;
  44. return map ? map->mask : 0;
  45. }
  46. inline hb_mask_t get_1_mask (hb_tag_t tag) const {
  47. const feature_map_t *map = features.bsearch (&tag);
  48. return map ? map->_1_mask : 0;
  49. }
  50. inline hb_tag_t get_chosen_script (unsigned int table_index) const
  51. { return chosen_script[table_index]; }
  52. inline void substitute (hb_face_t *face, hb_buffer_t *buffer) const
  53. { apply (0, (hb_ot_map_t::apply_lookup_func_t) hb_ot_layout_substitute_lookup, face, buffer); }
  54. inline void position (hb_font_t *font, hb_buffer_t *buffer) const
  55. { apply (1, (hb_ot_map_t::apply_lookup_func_t) hb_ot_layout_position_lookup, font, buffer); }
  56. inline void finish (void) {
  57. features.finish ();
  58. lookups[0].finish ();
  59. lookups[1].finish ();
  60. pauses[0].finish ();
  61. pauses[1].finish ();
  62. }
  63. private:
  64. struct feature_map_t {
  65. hb_tag_t tag; /* should be first for our bsearch to work */
  66. unsigned int index[2]; /* GSUB/GPOS */
  67. unsigned int stage[2]; /* GSUB/GPOS */
  68. unsigned int shift;
  69. hb_mask_t mask;
  70. hb_mask_t _1_mask; /* mask for value=1, for quick access */
  71. static int cmp (const feature_map_t *a, const feature_map_t *b)
  72. { return a->tag < b->tag ? -1 : a->tag > b->tag ? 1 : 0; }
  73. };
  74. struct lookup_map_t {
  75. unsigned int index;
  76. hb_mask_t mask;
  77. static int cmp (const lookup_map_t *a, const lookup_map_t *b)
  78. { return a->index < b->index ? -1 : a->index > b->index ? 1 : 0; }
  79. };
  80. typedef void (*pause_func_t) (const hb_ot_map_t *map, void *face_or_font, hb_buffer_t *buffer, void *user_data);
  81. typedef struct {
  82. pause_func_t func;
  83. void *user_data;
  84. } pause_callback_t;
  85. struct pause_map_t {
  86. unsigned int num_lookups; /* Cumulative */
  87. pause_callback_t callback;
  88. };
  89. typedef hb_bool_t (*apply_lookup_func_t) (void *face_or_font,
  90. hb_buffer_t *buffer,
  91. unsigned int lookup_index,
  92. hb_mask_t mask);
  93. HB_INTERNAL void add_lookups (hb_face_t *face,
  94. unsigned int table_index,
  95. unsigned int feature_index,
  96. hb_mask_t mask);
  97. HB_INTERNAL void apply (unsigned int table_index,
  98. hb_ot_map_t::apply_lookup_func_t apply_lookup_func,
  99. void *face_or_font,
  100. hb_buffer_t *buffer) const;
  101. hb_mask_t global_mask;
  102. hb_tag_t chosen_script[2];
  103. hb_prealloced_array_t<feature_map_t, 8> features;
  104. hb_prealloced_array_t<lookup_map_t, 32> lookups[2]; /* GSUB/GPOS */
  105. hb_prealloced_array_t<pause_map_t, 1> pauses[2]; /* GSUB/GPOS */
  106. };
  107. struct hb_ot_map_builder_t
  108. {
  109. public:
  110. hb_ot_map_builder_t (void) { memset (this, 0, sizeof (*this)); }
  111. HB_INTERNAL void add_feature (hb_tag_t tag, unsigned int value, bool global);
  112. inline void add_bool_feature (hb_tag_t tag, bool global = true)
  113. { add_feature (tag, 1, global); }
  114. inline void add_gsub_pause (hb_ot_map_t::gsub_pause_func_t pause_func, void *user_data)
  115. { add_pause (0, (hb_ot_map_t::pause_func_t) pause_func, user_data); }
  116. inline void add_gpos_pause (hb_ot_map_t::gpos_pause_func_t pause_func, void *user_data)
  117. { add_pause (1, (hb_ot_map_t::pause_func_t) pause_func, user_data); }
  118. HB_INTERNAL void compile (hb_face_t *face,
  119. const hb_segment_properties_t *props,
  120. struct hb_ot_map_t &m);
  121. inline void finish (void) {
  122. feature_infos.finish ();
  123. pauses[0].finish ();
  124. pauses[1].finish ();
  125. }
  126. private:
  127. struct feature_info_t {
  128. hb_tag_t tag;
  129. unsigned int seq; /* sequence#, used for stable sorting only */
  130. unsigned int max_value;
  131. bool global; /* whether the feature applies value to every glyph in the buffer */
  132. unsigned int default_value; /* for non-global features, what should the unset glyphs take */
  133. unsigned int stage[2]; /* GSUB/GPOS */
  134. static int cmp (const feature_info_t *a, const feature_info_t *b)
  135. { return (a->tag != b->tag) ? (a->tag < b->tag ? -1 : 1) : (a->seq < b->seq ? -1 : 1); }
  136. };
  137. struct pause_info_t {
  138. unsigned int stage;
  139. hb_ot_map_t::pause_callback_t callback;
  140. };
  141. HB_INTERNAL void add_pause (unsigned int table_index, hb_ot_map_t::pause_func_t pause_func, void *user_data);
  142. unsigned int current_stage[2]; /* GSUB/GPOS */
  143. hb_prealloced_array_t<feature_info_t,16> feature_infos;
  144. hb_prealloced_array_t<pause_info_t, 1> pauses[2]; /* GSUB/GPOS */
  145. };
  146. #endif /* HB_OT_MAP_PRIVATE_HH */