hb-buffer.cc 16.4 KB
Newer Older
1
/*
B
Behdad Esfahbod 已提交
2 3 4
 * Copyright © 1998-2004  David Turner and Werner Lemberg
 * Copyright © 2004,2007,2009,2010  Red Hat, Inc.
 * Copyright © 2011  Google, Inc.
5
 *
6
 *  This is part of HarfBuzz, a text shaping library.
7
 *
8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
 * 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
27
 * Google Author(s): Behdad Esfahbod
28 29
 */

30
#include "hb-buffer-private.hh"
31

B
Behdad Esfahbod 已提交
32 33
#include <string.h>

B
Behdad Esfahbod 已提交
34

35

B
Behdad Esfahbod 已提交
36 37 38 39 40
#ifndef HB_DEBUG_BUFFER
#define HB_DEBUG_BUFFER (HB_DEBUG+0)
#endif


41
static hb_buffer_t _hb_buffer_nil = {
42
  HB_OBJECT_HEADER_STATIC,
B
Behdad Esfahbod 已提交
43

44
  &_hb_unicode_funcs_default,
45 46 47 48 49
  {
    HB_DIRECTION_INVALID,
    HB_SCRIPT_INVALID,
    NULL,
  },
B
Behdad Esfahbod 已提交
50 51 52 53

  TRUE, /* in_error */
  TRUE, /* have_output */
  TRUE  /* have_positions */
54 55
};

56 57
/* Here is how the buffer works internally:
 *
B
Behdad Esfahbod 已提交
58 59
 * There are two info pointers: info and out_info.  They always have
 * the same allocated size, but different lengths.
60
 *
61
 * As an optimization, both info and out_info may point to the
62
 * same piece of memory, which is owned by info.  This remains the
63
 * case as long as out_len doesn't exceed i at any time.
64
 * In that case, swap_buffers() is no-op and the glyph operations operate
B
Behdad Esfahbod 已提交
65
 * mostly in-place.
66
 *
67
 * As soon as out_info gets longer than info, out_info is moved over
B
Behdad Esfahbod 已提交
68 69
 * to an alternate buffer (which we reuse the pos buffer for!), and its
 * current contents (out_len entries) are copied to the new place.
70
 * This should all remain transparent to the user.  swap_buffers() then
B
Behdad Esfahbod 已提交
71
 * switches info and out_info.
72 73
 */

B
Behdad Esfahbod 已提交
74

75 76 77 78 79

/* Internal API */

bool
hb_buffer_t::enlarge (unsigned int size)
80
{
81
  if (unlikely (in_error))
82 83
    return FALSE;

84
  unsigned int new_allocated = allocated;
B
Behdad Esfahbod 已提交
85 86
  hb_glyph_position_t *new_pos = NULL;
  hb_glyph_info_t *new_info = NULL;
87
  bool separate_out = out_info != info;
88

89
  if (unlikely (_hb_unsigned_int_mul_overflows (size, sizeof (info[0]))))
B
Behdad Esfahbod 已提交
90
    goto done;
91 92

  while (size > new_allocated)
93
    new_allocated += (new_allocated >> 1) + 32;
94

95 96
  ASSERT_STATIC (sizeof (info[0]) == sizeof (pos[0]));
  if (unlikely (_hb_unsigned_int_mul_overflows (new_allocated, sizeof (info[0]))))
B
Behdad Esfahbod 已提交
97 98
    goto done;

99 100
  new_pos = (hb_glyph_position_t *) realloc (pos, new_allocated * sizeof (pos[0]));
  new_info = (hb_glyph_info_t *) realloc (info, new_allocated * sizeof (info[0]));
101

B
Behdad Esfahbod 已提交
102
done:
103
  if (unlikely (!new_pos || !new_info))
104
    in_error = TRUE;
105 106

  if (likely (new_pos))
107
    pos = new_pos;
108 109

  if (likely (new_info))
110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136
    info = new_info;

  out_info = separate_out ? (hb_glyph_info_t *) pos : info;
  if (likely (!in_error))
    allocated = new_allocated;

  return likely (!in_error);
}

bool
hb_buffer_t::make_room_for (unsigned int num_in,
			    unsigned int num_out)
{
  if (unlikely (!ensure (out_len + num_out))) return FALSE;

  if (out_info == info &&
      out_len + num_out > idx + num_in)
  {
    assert (have_output);

    out_info = (hb_glyph_info_t *) pos;
    memcpy (out_info, info, out_len * sizeof (out_info[0]));
  }

  return TRUE;
}

137 138 139 140 141 142 143 144 145 146
void *
hb_buffer_t::get_scratch_buffer (unsigned int *size)
{
  have_output = FALSE;
  have_positions = FALSE;
  out_len = 0;
  *size = allocated * sizeof (pos[0]);
  return pos;
}

147 148 149 150 151 152 153 154 155 156

/* HarfBuzz-Internal API */

void
hb_buffer_t::reset (void)
{
  if (unlikely (hb_object_is_inert (this)))
    return;

  hb_unicode_funcs_destroy (unicode);
157
  unicode = _hb_buffer_nil.unicode;
158

159
  props = _hb_buffer_nil.props;
160 161 162 163

  in_error = FALSE;
  have_output = FALSE;
  have_positions = FALSE;
164

165 166 167
  idx = 0;
  len = 0;
  out_len = 0;
168

169
  serial = 0;
170 171
  memset (allocated_var_bytes, 0, sizeof allocated_var_bytes);
  memset (allocated_var_owner, 0, sizeof allocated_var_owner);
172 173

  out_info = info;
174 175
}

176 177 178 179
void
hb_buffer_t::add (hb_codepoint_t  codepoint,
		  hb_mask_t       mask,
		  unsigned int    cluster)
180
{
181 182 183 184 185 186 187 188 189 190 191 192
  hb_glyph_info_t *glyph;

  if (unlikely (!ensure (len + 1))) return;

  glyph = &info[len];

  memset (glyph, 0, sizeof (*glyph));
  glyph->codepoint = codepoint;
  glyph->mask = mask;
  glyph->cluster = cluster;

  len++;
193
}
194

195 196
void
hb_buffer_t::clear_output (void)
B
Behdad Esfahbod 已提交
197
{
198 199 200 201 202
  if (unlikely (hb_object_is_inert (this)))
    return;

  have_output = TRUE;
  have_positions = FALSE;
203

204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227
  out_len = 0;
  out_info = info;
}

void
hb_buffer_t::clear_positions (void)
{
  if (unlikely (hb_object_is_inert (this)))
    return;

  have_output = FALSE;
  have_positions = TRUE;

  memset (pos, 0, sizeof (pos[0]) * len);
}

void
hb_buffer_t::swap_buffers (void)
{
  if (unlikely (in_error)) return;

  assert (have_output);

  if (out_info != info)
228
  {
229 230 231 232 233 234 235 236 237 238 239 240 241 242
    hb_glyph_info_t *tmp_string;
    tmp_string = info;
    info = out_info;
    out_info = tmp_string;
    pos = (hb_glyph_position_t *) out_info;
  }

  unsigned int tmp;
  tmp = len;
  len = out_len;
  out_len = tmp;

  idx = 0;
}
243

244 245 246 247 248 249 250 251 252 253 254 255
void
hb_buffer_t::replace_glyphs_be16 (unsigned int num_in,
				  unsigned int num_out,
				  const uint16_t *glyph_data_be)
{
  if (!make_room_for (num_in, num_out)) return;

  hb_glyph_info_t orig_info = info[idx];
  for (unsigned int i = 1; i < num_in; i++)
  {
    hb_glyph_info_t *inf = &info[idx + i];
    orig_info.cluster = MIN (orig_info.cluster, inf->cluster);
256
  }
257

258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402
  hb_glyph_info_t *pinfo = &out_info[out_len];
  for (unsigned int i = 0; i < num_out; i++)
  {
    *pinfo = orig_info;
    pinfo->codepoint = hb_be_uint16 (glyph_data_be[i]);
    pinfo++;
  }

  idx  += num_in;
  out_len += num_out;
}

void
hb_buffer_t::output_glyph (hb_codepoint_t glyph_index)
{
  if (!make_room_for (0, 1)) return;

  out_info[out_len] = info[idx];
  out_info[out_len].codepoint = glyph_index;

  out_len++;
}

void
hb_buffer_t::copy_glyph (void)
{
  if (!make_room_for (0, 1)) return;

  out_info[out_len] = info[idx];

  out_len++;
}

void
hb_buffer_t::replace_glyph (hb_codepoint_t glyph_index)
{
  out_info[out_len] = info[idx];
  out_info[out_len].codepoint = glyph_index;

  idx++;
  out_len++;
}

void
hb_buffer_t::next_glyph (void)
{
  if (have_output)
  {
    if (out_info != info)
    {
      if (unlikely (!ensure (out_len + 1))) return;
      out_info[out_len] = info[idx];
    }
    else if (out_len != idx)
      out_info[out_len] = info[idx];

    out_len++;
  }

  idx++;
}

void
hb_buffer_t::set_masks (hb_mask_t    value,
			hb_mask_t    mask,
			unsigned int cluster_start,
			unsigned int cluster_end)
{
  hb_mask_t not_mask = ~mask;
  value &= mask;

  if (!mask)
    return;

  if (cluster_start == 0 && cluster_end == (unsigned int)-1) {
    unsigned int count = len;
    for (unsigned int i = 0; i < count; i++)
      info[i].mask = (info[i].mask & not_mask) | value;
    return;
  }

  unsigned int count = len;
  for (unsigned int i = 0; i < count; i++)
    if (cluster_start <= info[i].cluster && info[i].cluster < cluster_end)
      info[i].mask = (info[i].mask & not_mask) | value;
}

void
hb_buffer_t::reverse_range (unsigned int start,
			    unsigned int end)
{
  unsigned int i, j;

  if (start == end - 1)
    return;

  for (i = start, j = end - 1; i < j; i++, j--) {
    hb_glyph_info_t t;

    t = info[i];
    info[i] = info[j];
    info[j] = t;
  }

  if (pos) {
    for (i = start, j = end - 1; i < j; i++, j--) {
      hb_glyph_position_t t;

      t = pos[i];
      pos[i] = pos[j];
      pos[j] = t;
    }
  }
}

void
hb_buffer_t::reverse (void)
{
  if (unlikely (!len))
    return;

  reverse_range (0, len);
}

void
hb_buffer_t::reverse_clusters (void)
{
  unsigned int i, start, count, last_cluster;

  if (unlikely (!len))
    return;

  reverse ();

  count = len;
  start = 0;
  last_cluster = info[0].cluster;
  for (i = 1; i < count; i++) {
    if (last_cluster != info[i].cluster) {
      reverse_range (start, i);
      start = i;
      last_cluster = info[i].cluster;
    }
  }
  reverse_range (start, i);
403 404
}

B
Behdad Esfahbod 已提交
405 406 407 408 409
static inline void
dump_var_allocation (const hb_buffer_t *buffer)
{
  char buf[80];
  for (unsigned int i = 0; i < 8; i++)
410
    buf[i] = '0' + buffer->allocated_var_bytes[7 - i];
B
Behdad Esfahbod 已提交
411 412 413 414 415
  buf[8] = '\0';
  DEBUG_MSG (BUFFER, buffer,
	     "Current var allocation: %s",
	     buf);
}
416

417 418
void hb_buffer_t::allocate_var (unsigned int byte_i, unsigned int count, const char *owner)
{
419
  assert (byte_i < 8 && byte_i + count <= 8);
B
Behdad Esfahbod 已提交
420 421 422 423 424 425 426

  if (DEBUG (BUFFER))
    dump_var_allocation (this);
  DEBUG_MSG (BUFFER, this,
	     "Allocating var bytes %d..%d for %s",
	     byte_i, byte_i + count - 1, owner);

427 428 429 430 431 432 433 434 435
  for (unsigned int i = byte_i; i < byte_i + count; i++) {
    assert (!allocated_var_bytes[i]);
    allocated_var_bytes[i]++;
    allocated_var_owner[i] = owner;
  }
}

void hb_buffer_t::deallocate_var (unsigned int byte_i, unsigned int count, const char *owner)
{
436 437 438
  if (DEBUG (BUFFER))
    dump_var_allocation (this);

B
Behdad Esfahbod 已提交
439 440 441 442
  DEBUG_MSG (BUFFER, this,
	     "Deallocating var bytes %d..%d for %s",
	     byte_i, byte_i + count - 1, owner);

443
  assert (byte_i < 8 && byte_i + count <= 8);
444
  for (unsigned int i = byte_i; i < byte_i + count; i++) {
445 446
    assert (allocated_var_bytes[i]);
    assert (0 == strcmp (allocated_var_owner[i], owner));
447 448 449 450
    allocated_var_bytes[i]--;
  }
}

B
Behdad Esfahbod 已提交
451 452 453 454 455
void hb_buffer_t::deallocate_var_all (void)
{
  memset (allocated_var_bytes, 0, sizeof (allocated_var_bytes));
  memset (allocated_var_owner, 0, sizeof (allocated_var_owner));
}
456

457 458
/* Public API */

459
hb_buffer_t *
460
hb_buffer_create (unsigned int pre_alloc_size)
461
{
462 463
  hb_buffer_t *buffer;

464
  if (!(buffer = hb_object_create<hb_buffer_t> ()))
465
    return &_hb_buffer_nil;
466

467
  buffer->reset ();
B
Behdad Esfahbod 已提交
468

469
  if (pre_alloc_size && !buffer->ensure (pre_alloc_size)) {
470
    hb_buffer_destroy (buffer);
471
    return &_hb_buffer_nil;
472 473
  }

474 475
  return buffer;
}
B
Behdad Esfahbod 已提交
476

477 478 479
hb_buffer_t *
hb_buffer_get_empty (void)
{
480
  return &_hb_buffer_nil;
481 482
}

483 484 485
hb_buffer_t *
hb_buffer_reference (hb_buffer_t *buffer)
{
486
  return hb_object_reference (buffer);
487
}
B
Behdad Esfahbod 已提交
488

B
Behdad Esfahbod 已提交
489
void
490
hb_buffer_destroy (hb_buffer_t *buffer)
B
Behdad Esfahbod 已提交
491
{
492
  if (!hb_object_destroy (buffer)) return;
493

B
Behdad Esfahbod 已提交
494 495
  hb_unicode_funcs_destroy (buffer->unicode);

496
  free (buffer->info);
497
  free (buffer->pos);
498

499
  free (buffer);
B
Behdad Esfahbod 已提交
500 501
}

502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517
hb_bool_t
hb_buffer_set_user_data (hb_buffer_t        *buffer,
			 hb_user_data_key_t *key,
			 void *              data,
			 hb_destroy_func_t   destroy)
{
  return hb_object_set_user_data (buffer, key, data, destroy);
}

void *
hb_buffer_get_user_data (hb_buffer_t        *buffer,
			 hb_user_data_key_t *key)
{
  return hb_object_get_user_data (buffer, key);
}

B
Behdad Esfahbod 已提交
518 519 520 521 522

void
hb_buffer_set_unicode_funcs (hb_buffer_t        *buffer,
			     hb_unicode_funcs_t *unicode)
{
B
Behdad Esfahbod 已提交
523 524 525
  if (unlikely (hb_object_is_inert (buffer)))
    return;

B
Behdad Esfahbod 已提交
526
  if (!unicode)
527
    unicode = _hb_buffer_nil.unicode;
B
Behdad Esfahbod 已提交
528

B
Behdad Esfahbod 已提交
529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544
  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)

{
B
Behdad Esfahbod 已提交
545 546 547
  if (unlikely (hb_object_is_inert (buffer)))
    return;

548
  buffer->props.direction = direction;
B
Behdad Esfahbod 已提交
549 550 551 552 553
}

hb_direction_t
hb_buffer_get_direction (hb_buffer_t    *buffer)
{
554
  return buffer->props.direction;
B
Behdad Esfahbod 已提交
555 556
}

557 558 559 560
void
hb_buffer_set_script (hb_buffer_t *buffer,
		      hb_script_t  script)
{
B
Behdad Esfahbod 已提交
561 562 563
  if (unlikely (hb_object_is_inert (buffer)))
    return;

564
  buffer->props.script = script;
565 566 567 568 569
}

hb_script_t
hb_buffer_get_script (hb_buffer_t *buffer)
{
570
  return buffer->props.script;
571 572 573 574 575 576
}

void
hb_buffer_set_language (hb_buffer_t   *buffer,
			hb_language_t  language)
{
B
Behdad Esfahbod 已提交
577 578 579
  if (unlikely (hb_object_is_inert (buffer)))
    return;

580
  buffer->props.language = language;
581 582 583 584 585
}

hb_language_t
hb_buffer_get_language (hb_buffer_t *buffer)
{
586
  return buffer->props.language;
587 588
}

B
Behdad Esfahbod 已提交
589

590 591
void
hb_buffer_reset (hb_buffer_t *buffer)
B
Behdad Esfahbod 已提交
592
{
593
  buffer->reset ();
B
Behdad Esfahbod 已提交
594 595
}

596
hb_bool_t
597
hb_buffer_pre_allocate (hb_buffer_t *buffer, unsigned int size)
B
Behdad Esfahbod 已提交
598
{
599
  return buffer->ensure (size);
B
Behdad Esfahbod 已提交
600 601
}

602 603 604 605 606 607
hb_bool_t
hb_buffer_allocation_successful (hb_buffer_t  *buffer)
{
  return !buffer->in_error;
}

608
void
609 610 611 612
hb_buffer_add (hb_buffer_t    *buffer,
	       hb_codepoint_t  codepoint,
	       hb_mask_t       mask,
	       unsigned int    cluster)
613
{
614
  buffer->add (codepoint, mask, cluster);
615 616
}

617 618 619 620
hb_bool_t
hb_buffer_set_length (hb_buffer_t  *buffer,
		      unsigned int  length)
{
621
  if (!buffer->ensure (length))
622 623 624 625 626 627 628 629 630 631 632 633 634
    return FALSE;

  /* Wipe the new space */
  if (length > buffer->len) {
    memset (buffer->info + buffer->len, 0, sizeof (buffer->info[0]) * (length - buffer->len));
    if (buffer->have_positions)
      memset (buffer->pos + buffer->len, 0, sizeof (buffer->pos[0]) * (length - buffer->len));
  }

  buffer->len = length;
  return TRUE;
}

635
unsigned int
636
hb_buffer_get_length (hb_buffer_t *buffer)
637
{
638
  return buffer->len;
639 640 641 642
}

/* Return value valid as long as buffer not modified */
hb_glyph_info_t *
643 644
hb_buffer_get_glyph_infos (hb_buffer_t  *buffer,
                           unsigned int *length)
645
{
646 647 648
  if (length)
    *length = buffer->len;

649
  return (hb_glyph_info_t *) buffer->info;
650 651 652 653
}

/* Return value valid as long as buffer not modified */
hb_glyph_position_t *
654 655
hb_buffer_get_glyph_positions (hb_buffer_t  *buffer,
                               unsigned int *length)
656
{
657
  if (!buffer->have_positions)
658
    buffer->clear_positions ();
659

660 661 662
  if (length)
    *length = buffer->len;

663
  return (hb_glyph_position_t *) buffer->pos;
664
}
B
Behdad Esfahbod 已提交
665

666 667 668
void
hb_buffer_reverse (hb_buffer_t *buffer)
{
669
  buffer->reverse ();
670 671 672 673 674
}

void
hb_buffer_reverse_clusters (hb_buffer_t *buffer)
{
675
  buffer->reverse_clusters ();
676 677
}

678 679 680 681 682 683 684 685
#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); \
686
	    hb_buffer_add (buffer, u, 1,  old_next - (const T *) text); \
687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705
	  } \
	} 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;

706
  /* TODO check for overlong sequences? */
B
Behdad Esfahbod 已提交
707

708
  UTF8_COMPUTE (c, mask, len);
709
  if (unlikely (!len || (unsigned int) (end - text) < len)) {
710 711 712 713 714 715 716 717
    *unicode = -1;
    return text + 1;
  } else {
    hb_codepoint_t result;
    unsigned int i;
    result = c & mask;
    for (i = 1; i < len; i++)
      {
718
	if (unlikely ((text[i] & 0xc0) != 0x80))
719 720 721 722 723 724 725 726 727 728 729 730 731 732 733
	  {
	    *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,
734
		    unsigned int  text_length HB_UNUSED,
735 736 737 738 739 740 741 742 743 744 745 746 747 748 749
		    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++;

750
  if (unlikely (c >= 0xd800 && c < 0xdc00)) {
751 752
    /* high surrogate */
    uint16_t l;
B
Minor  
Behdad Esfahbod 已提交
753
    if (text < end && ((l = *text), likely (l >= 0xdc00 && l < 0xe000))) {
754 755 756 757 758 759 760 761 762 763 764 765 766 767
      /* 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,
768
		     unsigned int    text_length HB_UNUSED,
769 770 771 772 773 774 775 776 777 778 779
		     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,
780
		     unsigned int    text_length HB_UNUSED,
781 782 783 784 785 786 787
		     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
}
B
Behdad Esfahbod 已提交
788 789