hb-buffer.cc 15.5 KB
Newer Older
1 2
/*
 * Copyright (C) 1998-2004  David Turner and Werner Lemberg
3
 * Copyright (C) 2004,2007,2009,2010  Red Hat, Inc.
4
 *
B
Behdad Esfahbod 已提交
5
 * This is part of HarfBuzz, a text shaping library.
6
 *
7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
 * Permission is hereby granted, without written agreement and without
 * license or royalty fees, to use, copy, modify, and distribute this
 * software and its documentation for any purpose, provided that the
 * above copyright notice and the following two paragraphs appear in
 * all copies of this software.
 *
 * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR
 * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
 * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN
 * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
 * DAMAGE.
 *
 * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING,
 * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
 * FITNESS FOR A PARTICULAR PURPOSE.  THE SOFTWARE PROVIDED HEREUNDER IS
 * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO
 * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
 *
 * Red Hat Author(s): Owen Taylor, Behdad Esfahbod
26 27
 */

28
#include "hb-buffer-private.hh"
29

B
Behdad Esfahbod 已提交
30 31
#include <string.h>

32

33
static hb_buffer_t _hb_buffer_nil = {
B
Behdad Esfahbod 已提交
34 35 36
  HB_REFERENCE_COUNT_INVALID, /* ref_count */

  &_hb_unicode_funcs_nil  /* unicode */
37 38
};

39 40
/* Here is how the buffer works internally:
 *
B
Behdad Esfahbod 已提交
41 42
 * There are two info pointers: info and out_info.  They always have
 * the same allocated size, but different lengths.
43
 *
44
 * As an optimization, both info and out_info may point to the
45
 * same piece of memory, which is owned by info.  This remains the
46
 * case as long as out_len doesn't exceed len at any time.
B
Behdad Esfahbod 已提交
47 48
 * In that case, swap() is no-op and the glyph operations operate
 * mostly in-place.
49
 *
50
 * As soon as out_info gets longer than info, out_info is moved over
B
Behdad Esfahbod 已提交
51 52 53 54
 * to an alternate buffer (which we reuse the pos buffer for!), and its
 * current contents (out_len entries) are copied to the new place.
 * This should all remain transparent to the user.  swap() then
 * switches info and out_info.
55 56
 */

B
Behdad Esfahbod 已提交
57

58 59
/* Internal API */

60
static hb_bool_t
B
Behdad Esfahbod 已提交
61 62
hb_buffer_ensure_separate (hb_buffer_t *buffer, unsigned int size)
{
63 64
  if (unlikely (!hb_buffer_ensure (buffer, size))) return FALSE;

65
  if (buffer->out_info == buffer->info)
66
  {
67
    assert (buffer->have_output);
68

69
    buffer->out_info = (hb_internal_glyph_info_t *) buffer->pos;
70
    memcpy (buffer->out_info, buffer->info, buffer->out_len * sizeof (buffer->out_info[0]));
71
  }
72 73

  return TRUE;
74 75
}

76 77
/* Public API */

78
hb_buffer_t *
79
hb_buffer_create (unsigned int pre_alloc_size)
80
{
81 82
  hb_buffer_t *buffer;

B
Behdad Esfahbod 已提交
83
  if (!HB_OBJECT_DO_CREATE (hb_buffer_t, buffer))
84
    return &_hb_buffer_nil;
85

86
  if (pre_alloc_size)
87
    hb_buffer_ensure (buffer, pre_alloc_size);
88

B
Behdad Esfahbod 已提交
89 90
  buffer->unicode = &_hb_unicode_funcs_nil;

91 92
  return buffer;
}
B
Behdad Esfahbod 已提交
93

94 95 96 97 98
hb_buffer_t *
hb_buffer_reference (hb_buffer_t *buffer)
{
  HB_OBJECT_DO_REFERENCE (buffer);
}
B
Behdad Esfahbod 已提交
99

100 101 102 103
unsigned int
hb_buffer_get_reference_count (hb_buffer_t *buffer)
{
  HB_OBJECT_DO_GET_REFERENCE_COUNT (buffer);
104
}
105

B
Behdad Esfahbod 已提交
106
void
107
hb_buffer_destroy (hb_buffer_t *buffer)
B
Behdad Esfahbod 已提交
108
{
109 110
  HB_OBJECT_DO_DESTROY (buffer);

B
Behdad Esfahbod 已提交
111 112
  hb_unicode_funcs_destroy (buffer->unicode);

113
  free (buffer->info);
114
  free (buffer->pos);
115

116
  free (buffer);
B
Behdad Esfahbod 已提交
117 118
}

B
Behdad Esfahbod 已提交
119 120 121 122 123

void
hb_buffer_set_unicode_funcs (hb_buffer_t        *buffer,
			     hb_unicode_funcs_t *unicode)
{
B
Behdad Esfahbod 已提交
124 125 126
  if (!unicode)
    unicode = &_hb_unicode_funcs_nil;

B
Behdad Esfahbod 已提交
127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151
  hb_unicode_funcs_reference (unicode);
  hb_unicode_funcs_destroy (buffer->unicode);
  buffer->unicode = unicode;
}

hb_unicode_funcs_t *
hb_buffer_get_unicode_funcs (hb_buffer_t        *buffer)
{
  return buffer->unicode;
}

void
hb_buffer_set_direction (hb_buffer_t    *buffer,
			 hb_direction_t  direction)

{
  buffer->direction = direction;
}

hb_direction_t
hb_buffer_get_direction (hb_buffer_t    *buffer)
{
  return buffer->direction;
}

152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177
void
hb_buffer_set_script (hb_buffer_t *buffer,
		      hb_script_t  script)
{
  buffer->script = script;
}

hb_script_t
hb_buffer_get_script (hb_buffer_t *buffer)
{
  return buffer->script;
}

void
hb_buffer_set_language (hb_buffer_t   *buffer,
			hb_language_t  language)
{
  buffer->language = language;
}

hb_language_t
hb_buffer_get_language (hb_buffer_t *buffer)
{
  return buffer->language;
}

B
Behdad Esfahbod 已提交
178

B
Behdad Esfahbod 已提交
179
void
B
Behdad Esfahbod 已提交
180
hb_buffer_clear (hb_buffer_t *buffer)
B
Behdad Esfahbod 已提交
181
{
182
  buffer->have_output = FALSE;
183
  buffer->have_positions = FALSE;
184
  buffer->in_error = FALSE;
185
  buffer->len = 0;
186
  buffer->out_len = 0;
187
  buffer->i = 0;
188
  buffer->out_info = buffer->info;
B
Behdad Esfahbod 已提交
189
  buffer->max_lig_id = 0;
B
Behdad Esfahbod 已提交
190 191
}

192
hb_bool_t
B
Behdad Esfahbod 已提交
193 194
hb_buffer_ensure (hb_buffer_t *buffer, unsigned int size)
{
195
  if (unlikely (size > buffer->allocated))
B
Behdad Esfahbod 已提交
196
  {
197 198 199 200 201 202 203 204 205 206
    if (unlikely (buffer->in_error))
      return FALSE;

    unsigned int new_allocated = buffer->allocated;
    hb_internal_glyph_position_t *new_pos;
    hb_internal_glyph_info_t *new_info;
    bool separate_out;

    separate_out = buffer->out_info != buffer->info;

B
Behdad Esfahbod 已提交
207 208 209
    while (size > new_allocated)
      new_allocated += (new_allocated >> 1) + 8;

210 211
    new_pos = (hb_internal_glyph_position_t *) realloc (buffer->pos, new_allocated * sizeof (buffer->pos[0]));
    new_info = (hb_internal_glyph_info_t *) realloc (buffer->info, new_allocated * sizeof (buffer->info[0]));
B
Behdad Esfahbod 已提交
212

213 214
    if (unlikely (!new_pos || !new_info))
      buffer->in_error = TRUE;
B
Behdad Esfahbod 已提交
215

216 217 218 219 220 221 222 223 224
    if (likely (new_pos))
      buffer->pos = new_pos;

    if (likely (new_info))
      buffer->info = new_info;

    buffer->out_info = separate_out ? (hb_internal_glyph_info_t *) buffer->pos : buffer->info;
    if (likely (!buffer->in_error))
      buffer->allocated = new_allocated;
B
Behdad Esfahbod 已提交
225
  }
226 227

  return likely (!buffer->in_error);
B
Behdad Esfahbod 已提交
228 229
}

230
void
231
hb_buffer_add_glyph (hb_buffer_t    *buffer,
232
		     hb_codepoint_t  codepoint,
233
		     hb_mask_t       mask,
234
		     unsigned int    cluster)
235
{
236
  hb_internal_glyph_info_t *glyph;
237

238
  if (unlikely (!hb_buffer_ensure (buffer, buffer->len + 1))) return;
239

240
  glyph = &buffer->info[buffer->len];
241
  glyph->codepoint = codepoint;
242
  glyph->mask = mask;
243 244
  glyph->cluster = cluster;
  glyph->component = 0;
245 246
  glyph->lig_id = 0;
  glyph->gproperty = HB_BUFFER_GLYPH_PROPERTIES_UNKNOWN;
247

248
  buffer->len++;
249 250
}

B
Behdad Esfahbod 已提交
251

252 253
/* HarfBuzz-Internal API */

B
Behdad Esfahbod 已提交
254
void
B
Behdad Esfahbod 已提交
255
_hb_buffer_clear_output (hb_buffer_t *buffer)
B
Behdad Esfahbod 已提交
256
{
257
  buffer->have_output = TRUE;
258
  buffer->have_positions = FALSE;
259
  buffer->out_len = 0;
260
  buffer->out_info = buffer->info;
B
Behdad Esfahbod 已提交
261 262
}

263 264
void
hb_buffer_clear_positions (hb_buffer_t *buffer)
265
{
B
Behdad Esfahbod 已提交
266
  _hb_buffer_clear_output (buffer);
267
  buffer->have_output = FALSE;
268
  buffer->have_positions = TRUE;
B
Behdad Esfahbod 已提交
269

270
  if (unlikely (!buffer->pos))
B
Behdad Esfahbod 已提交
271
  {
272
    buffer->pos = (hb_internal_glyph_position_t *) calloc (buffer->allocated, sizeof (buffer->pos[0]));
B
Behdad Esfahbod 已提交
273 274
    return;
  }
275

276
  memset (buffer->pos, 0, sizeof (buffer->pos[0]) * buffer->len);
277 278
}

B
Behdad Esfahbod 已提交
279
void
B
Behdad Esfahbod 已提交
280
_hb_buffer_swap (hb_buffer_t *buffer)
281
{
B
Behdad Esfahbod 已提交
282
  unsigned int tmp;
283

284 285
  assert (buffer->have_output);

286 287
  if (unlikely (buffer->in_error)) return;

288
  if (buffer->out_info != buffer->info)
289
  {
290
    hb_internal_glyph_info_t *tmp_string;
291
    tmp_string = buffer->info;
292 293
    buffer->info = buffer->out_info;
    buffer->out_info = tmp_string;
294
    buffer->pos = (hb_internal_glyph_position_t *) buffer->out_info;
295
  }
296

297
  tmp = buffer->len;
298 299
  buffer->len = buffer->out_len;
  buffer->out_len = tmp;
300

301
  buffer->i = 0;
302 303 304
}

/* The following function copies `num_out' elements from `glyph_data'
305
   to `buffer->out_info', advancing the in array pointer in the structure
306 307 308 309
   by `num_in' elements, and the out array pointer by `num_out' elements.
   Finally, it sets the `length' field of `out' equal to
   `pos' of the `out' structure.

310
   If `component' is 0xFFFF, the component value from buffer->i
311 312 313
   will copied `num_out' times, otherwise `component' itself will
   be used to fill the `component' fields.

314
   If `lig_id' is 0xFFFF, the lig_id value from buffer->i
315 316
   will copied `num_out' times, otherwise `lig_id' itself will
   be used to fill the `lig_id' fields.
317

318
   The mask for all replacement glyphs are taken
319
   from the glyph at position `buffer->i'.
320

321
   The cluster value for the glyph at position buffer->i is used
322
   for all replacement glyphs */
323

B
Behdad Esfahbod 已提交
324
void
325 326 327
_hb_buffer_add_output_glyphs (hb_buffer_t *buffer,
			      unsigned int num_in,
			      unsigned int num_out,
328
			      const hb_codepoint_t *glyph_data,
329
			      unsigned short component,
330
			      unsigned short lig_id)
331
{
332
  unsigned int i;
333
  unsigned int mask;
334
  unsigned int cluster;
335

336
  if (buffer->out_info != buffer->info ||
337
      buffer->out_len + num_out > buffer->i + num_in)
338
  {
339 340
    if (unlikely (!hb_buffer_ensure_separate (buffer, buffer->out_len + num_out)))
      return;
341
  }
342

343 344
  mask = buffer->info[buffer->i].mask;
  cluster = buffer->info[buffer->i].cluster;
B
Behdad Esfahbod 已提交
345
  if (component == 0xFFFF)
346
    component = buffer->info[buffer->i].component;
347
  if (lig_id == 0xFFFF)
348
    lig_id = buffer->info[buffer->i].lig_id;
349

B
Behdad Esfahbod 已提交
350
  for (i = 0; i < num_out; i++)
351
  {
352
    hb_internal_glyph_info_t *info = &buffer->out_info[buffer->out_len + i];
353
    info->codepoint = glyph_data[i];
354
    info->mask = mask;
B
Behdad Esfahbod 已提交
355 356
    info->cluster = cluster;
    info->component = component;
357 358
    info->lig_id = lig_id;
    info->gproperty = HB_BUFFER_GLYPH_PROPERTIES_UNKNOWN;
359 360
  }

361
  buffer->i  += num_in;
362
  buffer->out_len += num_out;
363 364
}

365 366 367 368 369 370 371 372 373 374 375 376
void
_hb_buffer_add_output_glyphs_be16 (hb_buffer_t *buffer,
				   unsigned int num_in,
				   unsigned int num_out,
				   const uint16_t *glyph_data_be,
				   unsigned short component,
				   unsigned short lig_id)
{
  unsigned int i;
  unsigned int mask;
  unsigned int cluster;

377
  if (buffer->out_info != buffer->info ||
378
      buffer->out_len + num_out > buffer->i + num_in)
379
  {
380 381
    if (unlikely (!hb_buffer_ensure_separate (buffer, buffer->out_len + num_out)))
      return;
382 383
  }

384 385
  mask = buffer->info[buffer->i].mask;
  cluster = buffer->info[buffer->i].cluster;
386
  if (component == 0xFFFF)
387
    component = buffer->info[buffer->i].component;
388
  if (lig_id == 0xFFFF)
389
    lig_id = buffer->info[buffer->i].lig_id;
390 391 392

  for (i = 0; i < num_out; i++)
  {
393
    hb_internal_glyph_info_t *info = &buffer->out_info[buffer->out_len + i];
394 395 396 397 398 399 400 401
    info->codepoint = hb_be_uint16 (glyph_data_be[i]);
    info->mask = mask;
    info->cluster = cluster;
    info->component = component;
    info->lig_id = lig_id;
    info->gproperty = HB_BUFFER_GLYPH_PROPERTIES_UNKNOWN;
  }

402
  buffer->i  += num_in;
403
  buffer->out_len += num_out;
404
}
B
Behdad Esfahbod 已提交
405

B
Behdad Esfahbod 已提交
406
void
407 408 409
_hb_buffer_add_output_glyph (hb_buffer_t *buffer,
			     hb_codepoint_t glyph_index,
			     unsigned short component,
410
			     unsigned short lig_id)
411
{
412
  hb_internal_glyph_info_t *info;
B
Behdad Esfahbod 已提交
413

414
  if (buffer->out_info != buffer->info)
415
  {
416
    if (unlikely (!hb_buffer_ensure (buffer, buffer->out_len + 1))) return;
417
    buffer->out_info[buffer->out_len] = buffer->info[buffer->i];
418
  }
419 420
  else if (buffer->out_len != buffer->i)
    buffer->out_info[buffer->out_len] = buffer->info[buffer->i];
421

422
  info = &buffer->out_info[buffer->out_len];
423
  info->codepoint = glyph_index;
B
Behdad Esfahbod 已提交
424 425
  if (component != 0xFFFF)
    info->component = component;
426 427 428
  if (lig_id != 0xFFFF)
    info->lig_id = lig_id;
  info->gproperty = HB_BUFFER_GLYPH_PROPERTIES_UNKNOWN;
B
Behdad Esfahbod 已提交
429

430
  buffer->i++;
431
  buffer->out_len++;
432 433
}

B
Behdad Esfahbod 已提交
434
void
B
Behdad Esfahbod 已提交
435
_hb_buffer_next_glyph (hb_buffer_t *buffer)
B
Behdad Esfahbod 已提交
436
{
437
  if (buffer->have_output)
438
  {
439
    if (buffer->out_info != buffer->info)
440
    {
441
      if (unlikely (!hb_buffer_ensure (buffer, buffer->out_len + 1))) return;
442
      buffer->out_info[buffer->out_len] = buffer->info[buffer->i];
443
    }
444 445
    else if (buffer->out_len != buffer->i)
      buffer->out_info[buffer->out_len] = buffer->info[buffer->i];
446

447
    buffer->out_len++;
448
  }
449

450
  buffer->i++;
451 452
}

453 454

unsigned int
455
hb_buffer_get_length (hb_buffer_t *buffer)
456
{
457
  return buffer->len;
458 459 460 461 462 463
}

/* Return value valid as long as buffer not modified */
hb_glyph_info_t *
hb_buffer_get_glyph_infos (hb_buffer_t *buffer)
{
464
  return (hb_glyph_info_t *) buffer->info;
465 466 467 468 469 470
}

/* Return value valid as long as buffer not modified */
hb_glyph_position_t *
hb_buffer_get_glyph_positions (hb_buffer_t *buffer)
{
471
  if (!buffer->have_positions)
472 473
    hb_buffer_clear_positions (buffer);

474
  return (hb_glyph_position_t *) buffer->pos;
475
}
B
Behdad Esfahbod 已提交
476 477


478 479 480 481
static void
reverse_range (hb_buffer_t *buffer,
	       unsigned int start,
	       unsigned int end)
B
Behdad Esfahbod 已提交
482 483 484
{
  unsigned int i, j;

485
  for (i = start, j = end - 1; i < j; i++, j--) {
B
Behdad Esfahbod 已提交
486 487
    hb_internal_glyph_info_t t;

488 489 490
    t = buffer->info[i];
    buffer->info[i] = buffer->info[j];
    buffer->info[j] = t;
B
Behdad Esfahbod 已提交
491 492
  }

493
  if (buffer->pos) {
494
    for (i = 0, j = end - 1; i < j; i++, j--) {
B
Behdad Esfahbod 已提交
495 496
      hb_internal_glyph_position_t t;

497 498 499
      t = buffer->pos[i];
      buffer->pos[i] = buffer->pos[j];
      buffer->pos[j] = t;
B
Behdad Esfahbod 已提交
500 501 502
    }
  }
}
503

504 505 506
void
hb_buffer_reverse (hb_buffer_t *buffer)
{
507
  if (unlikely (!buffer->len))
508 509
    return;

510
  reverse_range (buffer, 0, buffer->len);
511 512 513 514 515 516 517
}

void
hb_buffer_reverse_clusters (hb_buffer_t *buffer)
{
  unsigned int i, start, count, last_cluster;

518
  if (unlikely (!buffer->len))
519 520 521 522
    return;

  hb_buffer_reverse (buffer);

523
  count = buffer->len;
524
  start = 0;
525
  last_cluster = buffer->info[0].cluster;
526
  for (i = 1; i < count; i++) {
527
    if (last_cluster != buffer->info[i].cluster) {
528 529
      reverse_range (buffer, start, i);
      start = i;
530
      last_cluster = buffer->info[i].cluster;
531 532 533 534 535
    }
  }
  reverse_range (buffer, start, i);
}

536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565

#define ADD_UTF(T) \
	HB_STMT_START { \
	  const T *next = (const T *) text + item_offset; \
	  const T *end = next + item_length; \
	  while (next < end) { \
	    hb_codepoint_t u; \
	    const T *old_next = next; \
	    next = UTF_NEXT (next, end, u); \
	    hb_buffer_add_glyph (buffer, u, 0,  old_next - (const T *) text); \
	  } \
	} HB_STMT_END


#define UTF8_COMPUTE(Char, Mask, Len) \
  if (Char < 128) { Len = 1; Mask = 0x7f; } \
  else if ((Char & 0xe0) == 0xc0) { Len = 2; Mask = 0x1f; } \
  else if ((Char & 0xf0) == 0xe0) { Len = 3; Mask = 0x0f; } \
  else if ((Char & 0xf8) == 0xf0) { Len = 4; Mask = 0x07; } \
  else Len = 0;

static inline const uint8_t *
hb_utf8_next (const uint8_t *text,
	      const uint8_t *end,
	      hb_codepoint_t *unicode)
{
  uint8_t c = *text;
  unsigned int mask, len;

  UTF8_COMPUTE (c, mask, len);
566
  if (unlikely (!len || (unsigned int) (end - text) < len)) {
567 568 569 570 571 572 573 574
    *unicode = -1;
    return text + 1;
  } else {
    hb_codepoint_t result;
    unsigned int i;
    result = c & mask;
    for (i = 1; i < len; i++)
      {
575
	if (unlikely ((text[i] & 0xc0) != 0x80))
576 577 578 579 580 581 582 583 584 585 586 587 588 589 590
	  {
	    *unicode = -1;
	    return text + 1;
	  }
	result <<= 6;
	result |= (text[i] & 0x3f);
      }
    *unicode = result;
    return text + len;
  }
}

void
hb_buffer_add_utf8 (hb_buffer_t  *buffer,
		    const char   *text,
591
		    unsigned int  text_length HB_UNUSED,
592 593 594 595 596 597 598 599 600 601 602 603 604 605 606
		    unsigned int  item_offset,
		    unsigned int  item_length)
{
#define UTF_NEXT(S, E, U)	hb_utf8_next (S, E, &(U))
  ADD_UTF (uint8_t);
#undef UTF_NEXT
}

static inline const uint16_t *
hb_utf16_next (const uint16_t *text,
	       const uint16_t *end,
	       hb_codepoint_t *unicode)
{
  uint16_t c = *text++;

607
  if (unlikely (c >= 0xd800 && c < 0xdc00)) {
608 609
    /* high surrogate */
    uint16_t l;
610
    if (text < end && ((l = *text), unlikely (l >= 0xdc00 && l < 0xe000))) {
611 612 613 614 615 616 617 618 619 620 621 622 623 624
      /* low surrogate */
      *unicode = ((hb_codepoint_t) ((c) - 0xd800) * 0x400 + (l) - 0xdc00 + 0x10000);
       text++;
    } else
      *unicode = -1;
  } else
    *unicode = c;

  return text;
}

void
hb_buffer_add_utf16 (hb_buffer_t    *buffer,
		     const uint16_t *text,
625
		     unsigned int    text_length HB_UNUSED,
626 627 628 629 630 631 632 633 634 635 636
		     unsigned int    item_offset,
		     unsigned int    item_length)
{
#define UTF_NEXT(S, E, U)	hb_utf16_next (S, E, &(U))
  ADD_UTF (uint16_t);
#undef UTF_NEXT
}

void
hb_buffer_add_utf32 (hb_buffer_t    *buffer,
		     const uint32_t *text,
637
		     unsigned int    text_length HB_UNUSED,
638 639 640 641 642 643 644
		     unsigned int    item_offset,
		     unsigned int    item_length)
{
#define UTF_NEXT(S, E, U)	((U) = *(S), (S)+1)
  ADD_UTF (uint32_t);
#undef UTF_NEXT
}