2 * Copyright (C) 1998-2004 David Turner and Werner Lemberg
3 * Copyright (C) 2004,2007,2009,2010 Red Hat, Inc.
5 * This is part of HarfBuzz, a text shaping library.
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.
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
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.
25 * Red Hat Author(s): Owen Taylor, Behdad Esfahbod
28 #include "hb-buffer-private.hh"
35 static hb_buffer_t _hb_buffer_nil = {
36 HB_REFERENCE_COUNT_INVALID, /* ref_count */
38 &_hb_unicode_funcs_nil /* unicode */
41 /* Here is how the buffer works internally:
43 * There are two info pointers: info and out_info. They always have
44 * the same allocated size, but different lengths.
46 * As an optimization, both info and out_info may point to the
47 * same piece of memory, which is owned by info. This remains the
48 * case as long as out_len doesn't exceed i at any time.
49 * In that case, swap() is no-op and the glyph operations operate
52 * As soon as out_info gets longer than info, out_info is moved over
53 * to an alternate buffer (which we reuse the pos buffer for!), and its
54 * current contents (out_len entries) are copied to the new place.
55 * This should all remain transparent to the user. swap() then
56 * switches info and out_info.
61 _hb_buffer_enlarge (hb_buffer_t *buffer, unsigned int size)
63 if (unlikely (buffer->in_error))
66 unsigned int new_allocated = buffer->allocated;
67 hb_glyph_position_t *new_pos;
68 hb_glyph_info_t *new_info;
71 separate_out = buffer->out_info != buffer->info;
73 while (size > new_allocated)
74 new_allocated += (new_allocated >> 1) + 8;
76 new_pos = (hb_glyph_position_t *) realloc (buffer->pos, new_allocated * sizeof (buffer->pos[0]));
77 new_info = (hb_glyph_info_t *) realloc (buffer->info, new_allocated * sizeof (buffer->info[0]));
79 if (unlikely (!new_pos || !new_info))
80 buffer->in_error = TRUE;
83 buffer->pos = new_pos;
85 if (likely (new_info))
86 buffer->info = new_info;
88 buffer->out_info = separate_out ? (hb_glyph_info_t *) buffer->pos : buffer->info;
89 if (likely (!buffer->in_error))
90 buffer->allocated = new_allocated;
92 return likely (!buffer->in_error);
95 static inline hb_bool_t
96 _hb_buffer_ensure (hb_buffer_t *buffer, unsigned int size)
98 return likely (size <= buffer->allocated) ? TRUE : _hb_buffer_enlarge (buffer, size);
101 static inline hb_bool_t
102 _hb_buffer_ensure_separate (hb_buffer_t *buffer, unsigned int size)
104 if (unlikely (!_hb_buffer_ensure (buffer, size))) return FALSE;
106 if (buffer->out_info == buffer->info)
108 assert (buffer->have_output);
110 buffer->out_info = (hb_glyph_info_t *) buffer->pos;
111 memcpy (buffer->out_info, buffer->info, buffer->out_len * sizeof (buffer->out_info[0]));
121 hb_buffer_create (unsigned int pre_alloc_size)
125 if (!HB_OBJECT_DO_CREATE (hb_buffer_t, buffer))
126 return &_hb_buffer_nil;
129 _hb_buffer_ensure (buffer, pre_alloc_size);
131 buffer->unicode = &_hb_unicode_funcs_nil;
137 hb_buffer_reference (hb_buffer_t *buffer)
139 HB_OBJECT_DO_REFERENCE (buffer);
143 hb_buffer_get_reference_count (hb_buffer_t *buffer)
145 HB_OBJECT_DO_GET_REFERENCE_COUNT (buffer);
149 hb_buffer_destroy (hb_buffer_t *buffer)
151 HB_OBJECT_DO_DESTROY (buffer);
153 hb_unicode_funcs_destroy (buffer->unicode);
163 hb_buffer_set_unicode_funcs (hb_buffer_t *buffer,
164 hb_unicode_funcs_t *unicode)
167 unicode = &_hb_unicode_funcs_nil;
169 hb_unicode_funcs_reference (unicode);
170 hb_unicode_funcs_destroy (buffer->unicode);
171 buffer->unicode = unicode;
175 hb_buffer_get_unicode_funcs (hb_buffer_t *buffer)
177 return buffer->unicode;
181 hb_buffer_set_direction (hb_buffer_t *buffer,
182 hb_direction_t direction)
185 buffer->props.direction = direction;
189 hb_buffer_get_direction (hb_buffer_t *buffer)
191 return buffer->props.direction;
195 hb_buffer_set_script (hb_buffer_t *buffer,
198 buffer->props.script = script;
202 hb_buffer_get_script (hb_buffer_t *buffer)
204 return buffer->props.script;
208 hb_buffer_set_language (hb_buffer_t *buffer,
209 hb_language_t language)
211 buffer->props.language = language;
215 hb_buffer_get_language (hb_buffer_t *buffer)
217 return buffer->props.language;
222 hb_buffer_clear (hb_buffer_t *buffer)
224 buffer->have_output = FALSE;
225 buffer->have_positions = FALSE;
226 buffer->in_error = FALSE;
230 buffer->out_info = buffer->info;
235 hb_buffer_ensure (hb_buffer_t *buffer, unsigned int size)
237 return _hb_buffer_ensure (buffer, size);
241 hb_buffer_add_glyph (hb_buffer_t *buffer,
242 hb_codepoint_t codepoint,
244 unsigned int cluster)
246 hb_glyph_info_t *glyph;
248 if (unlikely (!_hb_buffer_ensure (buffer, buffer->len + 1))) return;
250 glyph = &buffer->info[buffer->len];
252 memset (glyph, 0, sizeof (*glyph));
253 glyph->codepoint = codepoint;
255 glyph->cluster = cluster;
261 hb_buffer_clear_positions (hb_buffer_t *buffer)
263 _hb_buffer_clear_output (buffer);
264 buffer->have_output = FALSE;
265 buffer->have_positions = TRUE;
267 memset (buffer->pos, 0, sizeof (buffer->pos[0]) * buffer->len);
270 /* HarfBuzz-Internal API */
273 _hb_buffer_clear_output (hb_buffer_t *buffer)
275 buffer->have_output = TRUE;
276 buffer->have_positions = FALSE;
278 buffer->out_info = buffer->info;
282 _hb_buffer_swap (hb_buffer_t *buffer)
286 assert (buffer->have_output);
288 if (unlikely (buffer->in_error)) return;
290 if (buffer->out_info != buffer->info)
292 hb_glyph_info_t *tmp_string;
293 tmp_string = buffer->info;
294 buffer->info = buffer->out_info;
295 buffer->out_info = tmp_string;
296 buffer->pos = (hb_glyph_position_t *) buffer->out_info;
300 buffer->len = buffer->out_len;
301 buffer->out_len = tmp;
307 _hb_buffer_replace_glyphs_be16 (hb_buffer_t *buffer,
309 unsigned int num_out,
310 const uint16_t *glyph_data_be)
312 if (buffer->out_info != buffer->info ||
313 buffer->out_len + num_out > buffer->i + num_in)
315 if (unlikely (!_hb_buffer_ensure_separate (buffer, buffer->out_len + num_out)))
319 hb_glyph_info_t orig_info = buffer->info[buffer->i];
321 for (unsigned int i = 0; i < num_out; i++)
323 hb_glyph_info_t *info = &buffer->out_info[buffer->out_len + i];
325 info->codepoint = hb_be_uint16 (glyph_data_be[i]);
329 buffer->out_len += num_out;
333 _hb_buffer_replace_glyph (hb_buffer_t *buffer,
334 hb_codepoint_t glyph_index)
336 hb_glyph_info_t *info;
338 if (buffer->out_info != buffer->info)
340 if (unlikely (!_hb_buffer_ensure (buffer, buffer->out_len + 1))) return;
341 buffer->out_info[buffer->out_len] = buffer->info[buffer->i];
343 else if (buffer->out_len != buffer->i)
344 buffer->out_info[buffer->out_len] = buffer->info[buffer->i];
346 info = &buffer->out_info[buffer->out_len];
347 info->codepoint = glyph_index;
354 _hb_buffer_next_glyph (hb_buffer_t *buffer)
356 if (buffer->have_output)
358 if (buffer->out_info != buffer->info)
360 if (unlikely (!_hb_buffer_ensure (buffer, buffer->out_len + 1))) return;
361 buffer->out_info[buffer->out_len] = buffer->info[buffer->i];
363 else if (buffer->out_len != buffer->i)
364 buffer->out_info[buffer->out_len] = buffer->info[buffer->i];
373 _hb_buffer_reset_masks (hb_buffer_t *buffer,
376 unsigned int count = buffer->len;
377 for (unsigned int i = 0; i < count; i++)
378 buffer->info[i].mask = mask;
382 _hb_buffer_add_masks (hb_buffer_t *buffer,
385 unsigned int count = buffer->len;
386 for (unsigned int i = 0; i < count; i++)
387 buffer->info[i].mask |= mask;
391 _hb_buffer_set_masks (hb_buffer_t *buffer,
394 unsigned int cluster_start,
395 unsigned int cluster_end)
397 hb_mask_t not_mask = ~mask;
403 if (cluster_start == 0 && cluster_end == (unsigned int)-1) {
404 unsigned int count = buffer->len;
405 for (unsigned int i = 0; i < count; i++)
406 buffer->info[i].mask = (buffer->info[i].mask & not_mask) | value;
410 /* XXX can't bsearch since .cluster may not be sorted. */
411 /* Binary search to find the start position and go from there. */
412 unsigned int min = 0, max = buffer->len;
415 unsigned int mid = min + ((max - min) / 2);
416 if (buffer->info[mid].cluster < cluster_start)
421 unsigned int count = buffer->len;
422 for (unsigned int i = min; i < count && buffer->info[i].cluster < cluster_end; i++)
423 buffer->info[i].mask = (buffer->info[i].mask & not_mask) | value;
427 /* Public API again */
430 hb_buffer_get_length (hb_buffer_t *buffer)
435 /* Return value valid as long as buffer not modified */
437 hb_buffer_get_glyph_infos (hb_buffer_t *buffer)
439 return (hb_glyph_info_t *) buffer->info;
442 /* Return value valid as long as buffer not modified */
443 hb_glyph_position_t *
444 hb_buffer_get_glyph_positions (hb_buffer_t *buffer)
446 if (!buffer->have_positions)
447 hb_buffer_clear_positions (buffer);
449 return (hb_glyph_position_t *) buffer->pos;
454 reverse_range (hb_buffer_t *buffer,
460 for (i = start, j = end - 1; i < j; i++, j--) {
464 buffer->info[i] = buffer->info[j];
469 for (i = 0, j = end - 1; i < j; i++, j--) {
470 hb_glyph_position_t t;
473 buffer->pos[i] = buffer->pos[j];
480 hb_buffer_reverse (hb_buffer_t *buffer)
482 if (unlikely (!buffer->len))
485 reverse_range (buffer, 0, buffer->len);
489 hb_buffer_reverse_clusters (hb_buffer_t *buffer)
491 unsigned int i, start, count, last_cluster;
493 if (unlikely (!buffer->len))
496 hb_buffer_reverse (buffer);
500 last_cluster = buffer->info[0].cluster;
501 for (i = 1; i < count; i++) {
502 if (last_cluster != buffer->info[i].cluster) {
503 reverse_range (buffer, start, i);
505 last_cluster = buffer->info[i].cluster;
508 reverse_range (buffer, start, i);
514 const T *next = (const T *) text + item_offset; \
515 const T *end = next + item_length; \
516 while (next < end) { \
518 const T *old_next = next; \
519 next = UTF_NEXT (next, end, u); \
520 hb_buffer_add_glyph (buffer, u, 1, old_next - (const T *) text); \
525 #define UTF8_COMPUTE(Char, Mask, Len) \
526 if (Char < 128) { Len = 1; Mask = 0x7f; } \
527 else if ((Char & 0xe0) == 0xc0) { Len = 2; Mask = 0x1f; } \
528 else if ((Char & 0xf0) == 0xe0) { Len = 3; Mask = 0x0f; } \
529 else if ((Char & 0xf8) == 0xf0) { Len = 4; Mask = 0x07; } \
532 static inline const uint8_t *
533 hb_utf8_next (const uint8_t *text,
535 hb_codepoint_t *unicode)
538 unsigned int mask, len;
540 /* TODO check for overlong sequences? also: optimize? */
542 UTF8_COMPUTE (c, mask, len);
543 if (unlikely (!len || (unsigned int) (end - text) < len)) {
547 hb_codepoint_t result;
550 for (i = 1; i < len; i++)
552 if (unlikely ((text[i] & 0xc0) != 0x80))
558 result |= (text[i] & 0x3f);
566 hb_buffer_add_utf8 (hb_buffer_t *buffer,
568 unsigned int text_length HB_UNUSED,
569 unsigned int item_offset,
570 unsigned int item_length)
572 #define UTF_NEXT(S, E, U) hb_utf8_next (S, E, &(U))
577 static inline const uint16_t *
578 hb_utf16_next (const uint16_t *text,
580 hb_codepoint_t *unicode)
582 uint16_t c = *text++;
584 if (unlikely (c >= 0xd800 && c < 0xdc00)) {
587 if (text < end && ((l = *text), unlikely (l >= 0xdc00 && l < 0xe000))) {
589 *unicode = ((hb_codepoint_t) ((c) - 0xd800) * 0x400 + (l) - 0xdc00 + 0x10000);
600 hb_buffer_add_utf16 (hb_buffer_t *buffer,
601 const uint16_t *text,
602 unsigned int text_length HB_UNUSED,
603 unsigned int item_offset,
604 unsigned int item_length)
606 #define UTF_NEXT(S, E, U) hb_utf16_next (S, E, &(U))
612 hb_buffer_add_utf32 (hb_buffer_t *buffer,
613 const uint32_t *text,
614 unsigned int text_length HB_UNUSED,
615 unsigned int item_offset,
616 unsigned int item_length)
618 #define UTF_NEXT(S, E, U) ((U) = *(S), (S)+1)