blob: bcaf066c70bcd91d382365ffd89fbfa4d7ba6747 [file] [log] [blame]
Behdad Esfahboda2a9a022008-01-15 22:46:32 +00001/*
Behdad Esfahbod2409d5f2011-04-21 17:14:28 -04002 * Copyright © 1998-2004 David Turner and Werner Lemberg
3 * Copyright © 2004,2007,2009,2010 Red Hat, Inc.
Behdad Esfahbod05207a72012-09-25 17:44:53 -04004 * Copyright © 2011,2012 Google, Inc.
Behdad Esfahbod6b347132007-10-11 08:30:50 +00005 *
Behdad Esfahbod8f0d7e02011-04-15 18:59:56 -04006 * This is part of HarfBuzz, a text shaping library.
Behdad Esfahbod6b347132007-10-11 08:30:50 +00007 *
Behdad Esfahboda2a9a022008-01-15 22:46:32 +00008 * 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.
Behdad Esfahbod6b347132007-10-11 08:30:50 +000013 *
Behdad Esfahboda2a9a022008-01-15 22:46:32 +000014 * 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): Owen Taylor, Behdad Esfahbod
Behdad Esfahbod468e9cb2011-07-22 11:28:07 -040027 * Google Author(s): Behdad Esfahbod
Behdad Esfahbod6b347132007-10-11 08:30:50 +000028 */
Behdad Esfahboda2a9a022008-01-15 22:46:32 +000029
Behdad Esfahbodc77ae402018-08-25 22:36:36 -070030#ifndef HB_BUFFER_HH
31#define HB_BUFFER_HH
Behdad Esfahbod6b347132007-10-11 08:30:50 +000032
Behdad Esfahbodc77ae402018-08-25 22:36:36 -070033#include "hb.hh"
34#include "hb-unicode.hh"
Behdad Esfahbod6b347132007-10-11 08:30:50 +000035
Behdad Esfahbod6b347132007-10-11 08:30:50 +000036
Behdad Esfahbodbaf77792017-11-14 21:53:48 -080037#ifndef HB_BUFFER_MAX_LEN_FACTOR
38#define HB_BUFFER_MAX_LEN_FACTOR 32
Behdad Esfahbod43017032015-11-05 23:44:59 -080039#endif
40#ifndef HB_BUFFER_MAX_LEN_MIN
41#define HB_BUFFER_MAX_LEN_MIN 8192
42#endif
Behdad Esfahbodf1c4adb2015-11-06 09:46:05 -080043#ifndef HB_BUFFER_MAX_LEN_DEFAULT
Behdad Esfahbod43017032015-11-05 23:44:59 -080044#define HB_BUFFER_MAX_LEN_DEFAULT 0x3FFFFFFF /* Shaping more than a billion chars? Let us know! */
45#endif
46
Behdad Esfahbodbaf77792017-11-14 21:53:48 -080047#ifndef HB_BUFFER_MAX_OPS_FACTOR
48#define HB_BUFFER_MAX_OPS_FACTOR 64
49#endif
50#ifndef HB_BUFFER_MAX_OPS_MIN
51#define HB_BUFFER_MAX_OPS_MIN 1024
52#endif
53#ifndef HB_BUFFER_MAX_OPS_DEFAULT
54#define HB_BUFFER_MAX_OPS_DEFAULT 0x1FFFFFFF /* Shaping more than a billion operations? Let us know! */
55#endif
56
Behdad Esfahbod606bf572018-09-16 19:33:48 +020057static_assert ((sizeof (hb_glyph_info_t) == 20), "");
58static_assert ((sizeof (hb_glyph_info_t) == sizeof (hb_glyph_position_t)), "");
Behdad Esfahbodf1322e52009-08-01 22:53:04 -040059
Chun-wei Fan167c3272015-11-09 17:17:56 +080060HB_MARK_AS_FLAG_T (hb_buffer_flags_t);
61HB_MARK_AS_FLAG_T (hb_buffer_serialize_flags_t);
Jonathan Kew331d66c2014-07-19 23:09:09 +010062HB_MARK_AS_FLAG_T (hb_buffer_diff_flags_t);
Behdad Esfahbodaa7044d2015-11-04 16:25:57 -080063
Behdad Esfahbod49ef6302015-11-04 17:27:07 -080064enum hb_buffer_scratch_flags_t {
65 HB_BUFFER_SCRATCH_FLAG_DEFAULT = 0x00000000u,
Behdad Esfahbode3e4bb02015-11-04 18:58:02 -080066 HB_BUFFER_SCRATCH_FLAG_HAS_NON_ASCII = 0x00000001u,
67 HB_BUFFER_SCRATCH_FLAG_HAS_DEFAULT_IGNORABLES = 0x00000002u,
68 HB_BUFFER_SCRATCH_FLAG_HAS_SPACE_FALLBACK = 0x00000004u,
Behdad Esfahbodcbc3a762016-02-11 16:48:13 +070069 HB_BUFFER_SCRATCH_FLAG_HAS_GPOS_ATTACHMENT = 0x00000008u,
Behdad Esfahbod1c17c2b2017-08-11 19:06:07 -070070 HB_BUFFER_SCRATCH_FLAG_HAS_UNSAFE_TO_BREAK = 0x00000010u,
Behdad Esfahbodc36f3f52018-10-02 14:34:29 +020071 HB_BUFFER_SCRATCH_FLAG_HAS_CGJ = 0x00000020u,
Behdad Esfahbod1c17c2b2017-08-11 19:06:07 -070072
Behdad Esfahbod73fec392015-11-05 15:22:18 -080073 /* Reserved for complex shapers' internal use. */
74 HB_BUFFER_SCRATCH_FLAG_COMPLEX0 = 0x01000000u,
75 HB_BUFFER_SCRATCH_FLAG_COMPLEX1 = 0x02000000u,
76 HB_BUFFER_SCRATCH_FLAG_COMPLEX2 = 0x04000000u,
77 HB_BUFFER_SCRATCH_FLAG_COMPLEX3 = 0x08000000u,
Behdad Esfahbod49ef6302015-11-04 17:27:07 -080078};
Chun-wei Fan167c3272015-11-09 17:17:56 +080079HB_MARK_AS_FLAG_T (hb_buffer_scratch_flags_t);
Behdad Esfahbod49ef6302015-11-04 17:27:07 -080080
Behdad Esfahbod2f87ceb2012-07-27 04:02:38 -040081
82/*
Behdad Esfahbod2f87ceb2012-07-27 04:02:38 -040083 * hb_buffer_t
84 */
Behdad Esfahbodf1322e52009-08-01 22:53:04 -040085
Behdad Esfahbod35066722018-08-06 06:17:48 -070086struct hb_buffer_t
87{
Behdad Esfahbodfca368c2011-04-21 18:24:02 -040088 hb_object_header_t header;
Behdad Esfahbod6220e5f2012-06-06 03:30:09 -040089 ASSERT_POD ();
Behdad Esfahbodd0316a82010-05-12 23:34:52 -040090
91 /* Information about how the text in the buffer should be treated */
Behdad Esfahboda7c50462010-10-08 18:47:47 -040092 hb_unicode_funcs_t *unicode; /* Unicode functions */
Behdad Esfahbod0c7df222012-11-13 14:42:35 -080093 hb_buffer_flags_t flags; /* BOT / EOT / etc. */
Behdad Esfahbod376d5872015-07-22 16:51:12 +010094 hb_buffer_cluster_level_t cluster_level;
Behdad Esfahbod976c8f42014-07-16 15:34:20 -040095 hb_codepoint_t replacement; /* U+FFFD or something else. */
Bruce Mitchener90218fa2018-01-31 20:44:45 +070096 hb_buffer_scratch_flags_t scratch_flags; /* Have space-fallback, etc. */
Behdad Esfahbod43017032015-11-05 23:44:59 -080097 unsigned int max_len; /* Maximum allowed len. */
Behdad Esfahbodbaf77792017-11-14 21:53:48 -080098 int max_ops; /* Maximum allowed operations. */
Behdad Esfahbodd0316a82010-05-12 23:34:52 -040099
100 /* Buffer contents */
Behdad Esfahbod96fdc042012-09-06 22:26:16 -0400101 hb_buffer_content_type_t content_type;
Behdad Esfahbodb5fbc3b2014-08-11 18:40:01 -0400102 hb_segment_properties_t props; /* Script, language, direction */
Behdad Esfahbod96fdc042012-09-06 22:26:16 -0400103
Behdad Esfahbod7185b272018-05-31 20:03:00 -0700104 bool successful; /* Allocations successful */
Behdad Esfahbodfca368c2011-04-21 18:24:02 -0400105 bool have_output; /* Whether we have an output buffer going on */
106 bool have_positions; /* Whether we have positions */
Behdad Esfahbod910a33f2010-05-14 22:13:38 -0400107
Behdad Esfahbod468e9cb2011-07-22 11:28:07 -0400108 unsigned int idx; /* Cursor into ->info and ->pos arrays */
Behdad Esfahbod910a33f2010-05-14 22:13:38 -0400109 unsigned int len; /* Length of ->info and ->pos arrays */
Behdad Esfahbodcc1a8a92011-01-06 14:58:52 -0500110 unsigned int out_len; /* Length of ->out array if have_output */
Behdad Esfahbodd0316a82010-05-12 23:34:52 -0400111
Behdad Esfahbodc0af1932011-04-15 19:26:24 -0400112 unsigned int allocated; /* Length of allocated arrays */
Behdad Esfahbod88474c62010-10-27 14:42:15 -0400113 hb_glyph_info_t *info;
114 hb_glyph_info_t *out_info;
115 hb_glyph_position_t *pos;
Behdad Esfahbodd0316a82010-05-12 23:34:52 -0400116
Behdad Esfahbodf4a579b2011-07-25 16:20:16 -0400117 unsigned int serial;
Behdad Esfahbod05207a72012-09-25 17:44:53 -0400118
Behdad Esfahbod05207a72012-09-25 17:44:53 -0400119 /* Text before / after the main buffer contents.
120 * Always in Unicode, and ordered outward.
121 * Index 0 is for "pre-context", 1 for "post-context". */
Behdad Esfahbodfda994e2018-09-07 15:02:57 -0400122 enum { CONTEXT_LENGTH = 5 };
Behdad Esfahbod05207a72012-09-25 17:44:53 -0400123 hb_codepoint_t context[2][CONTEXT_LENGTH];
124 unsigned int context_len[2];
125
Behdad Esfahbod98816502016-02-25 12:23:02 +0900126 /* Debugging API */
Behdad Esfahbod0475ef22015-12-18 18:17:07 +0000127 hb_buffer_message_func_t message_func;
128 void *message_data;
129 hb_destroy_func_t message_destroy;
130
Behdad Esfahbod98816502016-02-25 12:23:02 +0900131 /* Internal debugging. */
Behdad Esfahbod0c7fb742016-02-25 14:40:09 +0900132 /* The bits here reflect current allocations of the bytes in glyph_info_t's var1 and var2. */
133#ifndef HB_NDEBUG
134 uint8_t allocated_var_bits;
Behdad Esfahbod98816502016-02-25 12:23:02 +0900135#endif
Behdad Esfahbod173dab62017-11-14 21:27:24 -0800136
137
138 /* Methods */
139
Behdad Esfahbod0c7fb742016-02-25 14:40:09 +0900140 inline void allocate_var (unsigned int start, unsigned int count)
141 {
142#ifndef HB_NDEBUG
143 unsigned int end = start + count;
144 assert (end <= 8);
Behdad Esfahbod33317312016-08-08 17:24:04 -0700145 unsigned int bits = (1u<<end) - (1u<<start);
Behdad Esfahbod0c7fb742016-02-25 14:40:09 +0900146 assert (0 == (allocated_var_bits & bits));
147 allocated_var_bits |= bits;
148#endif
149 }
150 inline void deallocate_var (unsigned int start, unsigned int count)
151 {
152#ifndef HB_NDEBUG
153 unsigned int end = start + count;
154 assert (end <= 8);
Behdad Esfahbod33317312016-08-08 17:24:04 -0700155 unsigned int bits = (1u<<end) - (1u<<start);
Behdad Esfahbod0c7fb742016-02-25 14:40:09 +0900156 assert (bits == (allocated_var_bits & bits));
157 allocated_var_bits &= ~bits;
158#endif
159 }
160 inline void assert_var (unsigned int start, unsigned int count)
161 {
162#ifndef HB_NDEBUG
163 unsigned int end = start + count;
164 assert (end <= 8);
Behdad Esfahbod33317312016-08-08 17:24:04 -0700165 unsigned int bits = (1u<<end) - (1u<<start);
Behdad Esfahbod0c7fb742016-02-25 14:40:09 +0900166 assert (bits == (allocated_var_bits & bits));
167#endif
168 }
169 inline void deallocate_var_all (void)
170 {
171#ifndef HB_NDEBUG
172 allocated_var_bits = 0;
173#endif
174 }
Behdad Esfahbod98816502016-02-25 12:23:02 +0900175
Behdad Esfahbod173dab62017-11-14 21:27:24 -0800176 inline hb_glyph_info_t &cur (unsigned int i = 0) { return info[idx + i]; }
177 inline hb_glyph_info_t cur (unsigned int i = 0) const { return info[idx + i]; }
Behdad Esfahbodd0316a82010-05-12 23:34:52 -0400178
Behdad Esfahbod173dab62017-11-14 21:27:24 -0800179 inline hb_glyph_position_t &cur_pos (unsigned int i = 0) { return pos[idx + i]; }
180 inline hb_glyph_position_t cur_pos (unsigned int i = 0) const { return pos[idx + i]; }
181
182 inline hb_glyph_info_t &prev (void) { return out_info[out_len ? out_len - 1 : 0]; }
183 inline hb_glyph_info_t prev (void) const { return out_info[out_len ? out_len - 1 : 0]; }
184
185 inline bool has_separate_output (void) const { return info != out_info; }
186
Behdad Esfahbod468e9cb2011-07-22 11:28:07 -0400187
188 HB_INTERNAL void reset (void);
Behdad Esfahbod82ecaff2012-11-13 13:57:52 -0800189 HB_INTERNAL void clear (void);
Behdad Esfahbod468e9cb2011-07-22 11:28:07 -0400190
Behdad Esfahbodcc1a8a92011-01-06 14:58:52 -0500191 inline unsigned int backtrack_len (void) const
Behdad Esfahbod468e9cb2011-07-22 11:28:07 -0400192 { return have_output? out_len : idx; }
Behdad Esfahbod6b65a762013-10-14 18:51:39 +0200193 inline unsigned int lookahead_len (void) const
194 { return len - idx; }
Behdad Esfahboddbf56b12010-10-27 17:06:12 -0400195 inline unsigned int next_serial (void) { return serial++; }
Behdad Esfahbod468e9cb2011-07-22 11:28:07 -0400196
197 HB_INTERNAL void add (hb_codepoint_t codepoint,
Behdad Esfahbod468e9cb2011-07-22 11:28:07 -0400198 unsigned int cluster);
Behdad Esfahbod847794e2013-02-27 17:59:28 -0500199 HB_INTERNAL void add_info (const hb_glyph_info_t &glyph_info);
Behdad Esfahbod468e9cb2011-07-22 11:28:07 -0400200
201 HB_INTERNAL void reverse_range (unsigned int start, unsigned int end);
202 HB_INTERNAL void reverse (void);
203 HB_INTERNAL void reverse_clusters (void);
Behdad Esfahbod3f82f8f2012-11-15 18:45:31 -0800204 HB_INTERNAL void guess_segment_properties (void);
Behdad Esfahbod468e9cb2011-07-22 11:28:07 -0400205
206 HB_INTERNAL void swap_buffers (void);
Behdad Esfahbod0bc7a382012-10-29 22:02:45 -0700207 HB_INTERNAL void remove_output (void);
Behdad Esfahbod468e9cb2011-07-22 11:28:07 -0400208 HB_INTERNAL void clear_output (void);
209 HB_INTERNAL void clear_positions (void);
Behdad Esfahbod69cc4922012-07-31 14:51:36 -0400210
Behdad Esfahbod9ebe8c02011-08-26 09:29:42 +0200211 HB_INTERNAL void replace_glyphs (unsigned int num_in,
212 unsigned int num_out,
Behdad Esfahbod8e3715f2012-04-23 22:18:54 -0400213 const hb_codepoint_t *glyph_data);
Behdad Esfahbod69cc4922012-07-31 14:51:36 -0400214
Behdad Esfahbod468e9cb2011-07-22 11:28:07 -0400215 HB_INTERNAL void replace_glyph (hb_codepoint_t glyph_index);
216 /* Makes a copy of the glyph at idx to output and replace glyph_index */
217 HB_INTERNAL void output_glyph (hb_codepoint_t glyph_index);
Behdad Esfahbod847794e2013-02-27 17:59:28 -0500218 HB_INTERNAL void output_info (const hb_glyph_info_t &glyph_info);
Behdad Esfahbod468e9cb2011-07-22 11:28:07 -0400219 /* Copies glyph at idx to output but doesn't advance idx */
220 HB_INTERNAL void copy_glyph (void);
Behdad Esfahbod6b65a762013-10-14 18:51:39 +0200221 HB_INTERNAL bool move_to (unsigned int i); /* i is output-buffer index. */
Behdad Esfahbod468e9cb2011-07-22 11:28:07 -0400222 /* Copies glyph at idx to output and advance idx.
223 * If there's no output, just advance idx. */
Behdad Esfahbod1be368e2012-08-31 16:29:17 -0400224 inline void
225 next_glyph (void)
226 {
227 if (have_output)
228 {
229 if (unlikely (out_info != info || out_len != idx)) {
Behdad Esfahbod13188cb2015-11-19 11:59:03 -0800230 if (unlikely (!make_room_for (1, 1))) return;
Behdad Esfahbod1be368e2012-08-31 16:29:17 -0400231 out_info[out_len] = info[idx];
232 }
233 out_len++;
234 }
Behdad Esfahbod18e1c6b2015-11-19 11:50:58 -0800235
Behdad Esfahbod1be368e2012-08-31 16:29:17 -0400236 idx++;
237 }
238
Behdad Esfahbod468e9cb2011-07-22 11:28:07 -0400239 /* Advance idx without copying to output. */
240 inline void skip_glyph (void) { idx++; }
Behdad Esfahbod1ce7b872010-05-21 17:31:45 +0100241
Behdad Esfahbodbd7378b2010-10-13 18:33:16 -0400242 inline void reset_masks (hb_mask_t mask)
243 {
Behdad Esfahbod31f18ab2011-06-15 09:49:58 -0400244 for (unsigned int j = 0; j < len; j++)
245 info[j].mask = mask;
Behdad Esfahbodbd7378b2010-10-13 18:33:16 -0400246 }
247 inline void add_masks (hb_mask_t mask)
248 {
Behdad Esfahbod31f18ab2011-06-15 09:49:58 -0400249 for (unsigned int j = 0; j < len; j++)
250 info[j].mask |= mask;
Behdad Esfahbodbd7378b2010-10-13 18:33:16 -0400251 }
Behdad Esfahbod40bd7e92016-05-02 14:47:45 +0200252 HB_INTERNAL void set_masks (hb_mask_t value, hb_mask_t mask,
253 unsigned int cluster_start, unsigned int cluster_end);
Behdad Esfahbod468e9cb2011-07-22 11:28:07 -0400254
Behdad Esfahbod40bd7e92016-05-02 14:47:45 +0200255 inline void merge_clusters (unsigned int start, unsigned int end)
Behdad Esfahbod701112d2015-07-22 15:42:20 +0100256 {
257 if (end - start < 2)
258 return;
259 merge_clusters_impl (start, end);
260 }
Behdad Esfahbod40bd7e92016-05-02 14:47:45 +0200261 HB_INTERNAL void merge_clusters_impl (unsigned int start, unsigned int end);
262 HB_INTERNAL void merge_out_clusters (unsigned int start, unsigned int end);
Behdad Esfahbod5f13bbd2015-06-19 13:31:49 -0700263 /* Merge clusters for deleting current glyph, and skip it. */
264 HB_INTERNAL void delete_glyph (void);
Behdad Esfahbodd4cc4472012-04-07 21:52:28 -0400265
Behdad Esfahbod40bd7e92016-05-02 14:47:45 +0200266 inline void unsafe_to_break (unsigned int start,
267 unsigned int end)
268 {
269 if (end - start < 2)
270 return;
271 unsafe_to_break_impl (start, end);
272 }
273 HB_INTERNAL void unsafe_to_break_impl (unsigned int start, unsigned int end);
274 HB_INTERNAL void unsafe_to_break_from_outbuffer (unsigned int start, unsigned int end);
275
276
Behdad Esfahbod468e9cb2011-07-22 11:28:07 -0400277 /* Internal methods */
278 HB_INTERNAL bool enlarge (unsigned int size);
279
280 inline bool ensure (unsigned int size)
Behdad Esfahbod02c6c8c2013-11-15 13:05:38 -0500281 { return likely (!size || size < allocated) ? true : enlarge (size); }
Behdad Esfahbod468e9cb2011-07-22 11:28:07 -0400282
Behdad Esfahboda6b8dc82014-08-11 15:08:19 -0400283 inline bool ensure_inplace (unsigned int size)
284 { return likely (!size || size < allocated); }
285
Behdad Esfahbod468e9cb2011-07-22 11:28:07 -0400286 HB_INTERNAL bool make_room_for (unsigned int num_in, unsigned int num_out);
Behdad Esfahbod6b65a762013-10-14 18:51:39 +0200287 HB_INTERNAL bool shift_forward (unsigned int count);
Behdad Esfahbode62df432011-08-03 17:38:54 -0400288
Behdad Esfahbod061cb462013-11-13 14:50:25 -0500289 typedef long scratch_buffer_t;
Behdad Esfahbod68c372e2013-11-13 14:44:01 -0500290 HB_INTERNAL scratch_buffer_t *get_scratch_buffer (unsigned int *size);
Behdad Esfahbod05207a72012-09-25 17:44:53 -0400291
292 inline void clear_context (unsigned int side) { context_len[side] = 0; }
Behdad Esfahbode995d332015-09-01 16:13:32 +0100293
294 HB_INTERNAL void sort (unsigned int start, unsigned int end, int(*compar)(const hb_glyph_info_t *, const hb_glyph_info_t *));
Behdad Esfahbod0475ef22015-12-18 18:17:07 +0000295
296 inline bool messaging (void) { return unlikely (message_func); }
297 inline bool message (hb_font_t *font, const char *fmt, ...) HB_PRINTF_FUNC(3, 4)
298 {
299 if (!messaging ())
300 return true;
301 va_list ap;
302 va_start (ap, fmt);
303 bool ret = message_impl (font, fmt, ap);
304 va_end (ap);
305 return ret;
306 }
307 HB_INTERNAL bool message_impl (hb_font_t *font, const char *fmt, va_list ap) HB_PRINTF_FUNC(3, 0);
Behdad Esfahbode2a2b5b2017-08-10 20:10:12 -0700308
309 static inline void
Behdad Esfahbod3f291ff2018-01-11 17:57:46 +0100310 set_cluster (hb_glyph_info_t &inf, unsigned int cluster, unsigned int mask = 0)
Behdad Esfahbode2a2b5b2017-08-10 20:10:12 -0700311 {
Behdad Esfahbod3f291ff2018-01-11 17:57:46 +0100312 if (inf.cluster != cluster)
Behdad Esfahbode2a2b5b2017-08-10 20:10:12 -0700313 {
314 if (mask & HB_GLYPH_FLAG_UNSAFE_TO_BREAK)
Behdad Esfahbod3f291ff2018-01-11 17:57:46 +0100315 inf.mask |= HB_GLYPH_FLAG_UNSAFE_TO_BREAK;
Behdad Esfahbode2a2b5b2017-08-10 20:10:12 -0700316 else
Behdad Esfahbod3f291ff2018-01-11 17:57:46 +0100317 inf.mask &= ~HB_GLYPH_FLAG_UNSAFE_TO_BREAK;
Behdad Esfahbode2a2b5b2017-08-10 20:10:12 -0700318 }
Behdad Esfahbod3f291ff2018-01-11 17:57:46 +0100319 inf.cluster = cluster;
Behdad Esfahbode2a2b5b2017-08-10 20:10:12 -0700320 }
Behdad Esfahbod1c17c2b2017-08-11 19:06:07 -0700321
Behdad Esfahbode4da3802017-11-10 17:14:27 -0800322 inline int
Behdad Esfahbod3f291ff2018-01-11 17:57:46 +0100323 _unsafe_to_break_find_min_cluster (const hb_glyph_info_t *infos,
Behdad Esfahbod1c17c2b2017-08-11 19:06:07 -0700324 unsigned int start, unsigned int end,
325 unsigned int cluster) const
326 {
327 for (unsigned int i = start; i < end; i++)
Behdad Esfahbod3f291ff2018-01-11 17:57:46 +0100328 cluster = MIN<unsigned int> (cluster, infos[i].cluster);
Behdad Esfahbod1c17c2b2017-08-11 19:06:07 -0700329 return cluster;
330 }
Behdad Esfahbode4da3802017-11-10 17:14:27 -0800331 inline void
Behdad Esfahbod3f291ff2018-01-11 17:57:46 +0100332 _unsafe_to_break_set_mask (hb_glyph_info_t *infos,
Behdad Esfahbod1c17c2b2017-08-11 19:06:07 -0700333 unsigned int start, unsigned int end,
334 unsigned int cluster)
335 {
336 for (unsigned int i = start; i < end; i++)
Behdad Esfahbod3f291ff2018-01-11 17:57:46 +0100337 if (cluster != infos[i].cluster)
Behdad Esfahbod1c17c2b2017-08-11 19:06:07 -0700338 {
339 scratch_flags |= HB_BUFFER_SCRATCH_FLAG_HAS_UNSAFE_TO_BREAK;
Behdad Esfahbod3f291ff2018-01-11 17:57:46 +0100340 infos[i].mask |= HB_GLYPH_FLAG_UNSAFE_TO_BREAK;
Behdad Esfahbod1c17c2b2017-08-11 19:06:07 -0700341 }
342 }
Behdad Esfahbode4da3802017-11-10 17:14:27 -0800343
344 inline void
345 unsafe_to_break_all (void)
346 {
David Corbett21646cc2018-02-16 12:08:55 -0500347 unsafe_to_break_impl (0, len);
Behdad Esfahbode4da3802017-11-10 17:14:27 -0800348 }
349 inline void
350 safe_to_break_all (void)
351 {
352 for (unsigned int i = 0; i < len; i++)
353 info[i].mask &= ~HB_GLYPH_FLAG_UNSAFE_TO_BREAK;
354 }
Behdad Esfahbodd0316a82010-05-12 23:34:52 -0400355};
Behdad Esfahbod35066722018-08-06 06:17:48 -0700356DECLARE_NULL_INSTANCE (hb_buffer_t);
Behdad Esfahbodd0316a82010-05-12 23:34:52 -0400357
358
Behdad Esfahbod1c17c2b2017-08-11 19:06:07 -0700359/* Loop over clusters. Duplicated in foreach_syllable(). */
360#define foreach_cluster(buffer, start, end) \
361 for (unsigned int \
362 _count = buffer->len, \
363 start = 0, end = _count ? _next_cluster (buffer, 0) : 0; \
364 start < _count; \
365 start = end, end = _next_cluster (buffer, start))
366
367static inline unsigned int
368_next_cluster (hb_buffer_t *buffer, unsigned int start)
369{
370 hb_glyph_info_t *info = buffer->info;
371 unsigned int count = buffer->len;
372
373 unsigned int cluster = info[start].cluster;
374 while (++start < count && cluster == info[start].cluster)
375 ;
376
377 return start;
378}
379
380
Behdad Esfahbod0c7fb742016-02-25 14:40:09 +0900381#define HB_BUFFER_XALLOCATE_VAR(b, func, var) \
Behdad Esfahbodb65c0602011-07-28 16:48:43 -0400382 b->func (offsetof (hb_glyph_info_t, var) - offsetof(hb_glyph_info_t, var1), \
Behdad Esfahbod0c7fb742016-02-25 14:40:09 +0900383 sizeof (b->info[0].var))
384#define HB_BUFFER_ALLOCATE_VAR(b, var) HB_BUFFER_XALLOCATE_VAR (b, allocate_var, var ())
385#define HB_BUFFER_DEALLOCATE_VAR(b, var) HB_BUFFER_XALLOCATE_VAR (b, deallocate_var, var ())
386#define HB_BUFFER_ASSERT_VAR(b, var) HB_BUFFER_XALLOCATE_VAR (b, assert_var, var ())
Behdad Esfahbodb65c0602011-07-28 16:48:43 -0400387
388
Behdad Esfahbodc77ae402018-08-25 22:36:36 -0700389#endif /* HB_BUFFER_HH */