hb-buffer.cc 19.2 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
#ifndef HB_DEBUG_BUFFER
#define HB_DEBUG_BUFFER (HB_DEBUG+0)
#endif

40
#define _HB_BUFFER_UNICODE_FUNCS_DEFAULT (const_cast<hb_unicode_funcs_t *> (&_hb_unicode_funcs_default))
41
#define _HB_BUFFER_PROPS_DEFAULT { HB_DIRECTION_INVALID, HB_SCRIPT_INVALID, HB_LANGUAGE_INVALID }
42

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

B
Behdad Esfahbod 已提交
61

62 63 64 65 66

/* Internal API */

bool
hb_buffer_t::enlarge (unsigned int size)
67
{
68
  if (unlikely (in_error))
69
    return false;
70

71
  unsigned int new_allocated = allocated;
B
Behdad Esfahbod 已提交
72 73
  hb_glyph_position_t *new_pos = NULL;
  hb_glyph_info_t *new_info = NULL;
74
  bool separate_out = out_info != info;
75

76
  if (unlikely (_hb_unsigned_int_mul_overflows (size, sizeof (info[0]))))
B
Behdad Esfahbod 已提交
77
    goto done;
78 79

  while (size > new_allocated)
80
    new_allocated += (new_allocated >> 1) + 32;
81

82 83
  ASSERT_STATIC (sizeof (info[0]) == sizeof (pos[0]));
  if (unlikely (_hb_unsigned_int_mul_overflows (new_allocated, sizeof (info[0]))))
B
Behdad Esfahbod 已提交
84 85
    goto done;

86 87
  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]));
88

B
Behdad Esfahbod 已提交
89
done:
90
  if (unlikely (!new_pos || !new_info))
91
    in_error = true;
92 93

  if (likely (new_pos))
94
    pos = new_pos;
95 96

  if (likely (new_info))
97 98 99 100 101 102 103 104 105 106 107 108 109
    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)
{
110
  if (unlikely (!ensure (out_len + num_out))) return false;
111 112 113 114 115 116 117 118 119 120

  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]));
  }

121
  return true;
122 123
}

124 125 126
void *
hb_buffer_t::get_scratch_buffer (unsigned int *size)
{
127 128
  have_output = false;
  have_positions = false;
129 130 131 132 133
  out_len = 0;
  *size = allocated * sizeof (pos[0]);
  return pos;
}

134 135 136 137 138 139 140 141 142 143

/* HarfBuzz-Internal API */

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

  hb_unicode_funcs_destroy (unicode);
144
  unicode = _HB_BUFFER_UNICODE_FUNCS_DEFAULT;
145

146 147
  hb_segment_properties_t default_props = _HB_BUFFER_PROPS_DEFAULT;
  props = default_props;
148

149 150 151
  in_error = false;
  have_output = false;
  have_positions = false;
152

153 154 155
  idx = 0;
  len = 0;
  out_len = 0;
156

157
  serial = 0;
158 159
  memset (allocated_var_bytes, 0, sizeof allocated_var_bytes);
  memset (allocated_var_owner, 0, sizeof allocated_var_owner);
160 161

  out_info = info;
162 163
}

164 165 166 167
void
hb_buffer_t::add (hb_codepoint_t  codepoint,
		  hb_mask_t       mask,
		  unsigned int    cluster)
168
{
169 170 171 172 173 174 175 176 177 178 179 180
  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++;
181
}
182

183 184
void
hb_buffer_t::clear_output (void)
B
Behdad Esfahbod 已提交
185
{
186 187 188
  if (unlikely (hb_object_is_inert (this)))
    return;

189 190
  have_output = true;
  have_positions = false;
191

192 193 194 195 196 197 198 199 200 201
  out_len = 0;
  out_info = info;
}

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

202 203
  have_output = false;
  have_positions = true;
204 205 206 207 208 209 210 211 212 213

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

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

  assert (have_output);
214
  have_output = false;
215 216

  if (out_info != info)
217
  {
218 219 220 221 222 223 224 225 226 227 228 229 230 231
    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;
}
232

233 234 235 236 237 238 239 240 241 242 243 244
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);
245
  }
246

247 248 249 250 251 252 253 254 255 256 257 258
  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;
}

B
Behdad Esfahbod 已提交
259 260 261
void
hb_buffer_t::replace_glyphs (unsigned int num_in,
			     unsigned int num_out,
B
Minor  
Behdad Esfahbod 已提交
262
			     const uint32_t *glyph_data)
B
Behdad Esfahbod 已提交
263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284
{
  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);
  }

  hb_glyph_info_t *pinfo = &out_info[out_len];
  for (unsigned int i = 0; i < num_out; i++)
  {
    *pinfo = orig_info;
    pinfo->codepoint = glyph_data[i];
    pinfo++;
  }

  idx  += num_in;
  out_len += num_out;
}

285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308
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)
{
B
Behdad Esfahbod 已提交
309 310
  if (!make_room_for (1, 1)) return;

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 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419
  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);
420 421
}

422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444
void
hb_buffer_t::merge_clusters (unsigned int start,
			     unsigned int end)
{
  unsigned int cluster = this->info[start].cluster;

  for (unsigned int i = start + 1; i < end; i++)
    cluster = MIN (cluster, this->info[i].cluster);
  for (unsigned int i = start; i < end; i++)
    this->info[i].cluster = cluster;
}
void
hb_buffer_t::merge_out_clusters (unsigned int start,
				 unsigned int end)
{
  unsigned int cluster = this->out_info[start].cluster;

  for (unsigned int i = start + 1; i < end; i++)
    cluster = MIN (cluster, this->out_info[i].cluster);
  for (unsigned int i = start; i < end; i++)
    this->out_info[i].cluster = cluster;
}

445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473
void
hb_buffer_t::guess_properties (void)
{
  /* If script is set to INVALID, guess from buffer contents */
  if (props.script == HB_SCRIPT_INVALID) {
    for (unsigned int i = 0; i < len; i++) {
      hb_script_t script = hb_unicode_script (unicode, info[i].codepoint);
      if (likely (script != HB_SCRIPT_COMMON &&
		  script != HB_SCRIPT_INHERITED &&
		  script != HB_SCRIPT_UNKNOWN)) {
        props.script = script;
        break;
      }
    }
  }

  /* If direction is set to INVALID, guess from script */
  if (props.direction == HB_DIRECTION_INVALID) {
    props.direction = hb_script_get_horizontal_direction (props.script);
  }

  /* If language is not set, use default language from locale */
  if (props.language == HB_LANGUAGE_INVALID) {
    /* TODO get_default_for_script? using $LANGUAGE */
    props.language = hb_language_get_default ();
  }
}


B
Behdad Esfahbod 已提交
474 475 476 477 478
static inline void
dump_var_allocation (const hb_buffer_t *buffer)
{
  char buf[80];
  for (unsigned int i = 0; i < 8; i++)
479
    buf[i] = '0' + buffer->allocated_var_bytes[7 - i];
B
Behdad Esfahbod 已提交
480 481 482 483 484
  buf[8] = '\0';
  DEBUG_MSG (BUFFER, buffer,
	     "Current var allocation: %s",
	     buf);
}
485

486 487
void hb_buffer_t::allocate_var (unsigned int byte_i, unsigned int count, const char *owner)
{
488
  assert (byte_i < 8 && byte_i + count <= 8);
B
Behdad Esfahbod 已提交
489 490 491 492 493 494 495

  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);

496 497 498 499 500 501 502 503 504
  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)
{
505 506 507
  if (DEBUG (BUFFER))
    dump_var_allocation (this);

B
Behdad Esfahbod 已提交
508 509 510 511
  DEBUG_MSG (BUFFER, this,
	     "Deallocating var bytes %d..%d for %s",
	     byte_i, byte_i + count - 1, owner);

512
  assert (byte_i < 8 && byte_i + count <= 8);
513
  for (unsigned int i = byte_i; i < byte_i + count; i++) {
514 515
    assert (allocated_var_bytes[i]);
    assert (0 == strcmp (allocated_var_owner[i], owner));
516 517 518 519
    allocated_var_bytes[i]--;
  }
}

B
Behdad Esfahbod 已提交
520 521 522 523 524
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));
}
525

526 527
/* Public API */

528
hb_buffer_t *
529
hb_buffer_create ()
530
{
531 532
  hb_buffer_t *buffer;

533
  if (!(buffer = hb_object_create<hb_buffer_t> ()))
534
    return hb_buffer_get_empty ();
535

536
  buffer->reset ();
B
Behdad Esfahbod 已提交
537

538 539
  return buffer;
}
B
Behdad Esfahbod 已提交
540

541 542 543
hb_buffer_t *
hb_buffer_get_empty (void)
{
544 545 546 547 548 549
  static const hb_buffer_t _hb_buffer_nil = {
    HB_OBJECT_HEADER_STATIC,

    _HB_BUFFER_UNICODE_FUNCS_DEFAULT,
    _HB_BUFFER_PROPS_DEFAULT,

550 551 552
    true, /* in_error */
    true, /* have_output */
    true  /* have_positions */
553 554 555
  };

  return const_cast<hb_buffer_t *> (&_hb_buffer_nil);
556 557
}

558 559 560
hb_buffer_t *
hb_buffer_reference (hb_buffer_t *buffer)
{
561
  return hb_object_reference (buffer);
562
}
B
Behdad Esfahbod 已提交
563

B
Behdad Esfahbod 已提交
564
void
565
hb_buffer_destroy (hb_buffer_t *buffer)
B
Behdad Esfahbod 已提交
566
{
567
  if (!hb_object_destroy (buffer)) return;
568

B
Behdad Esfahbod 已提交
569 570
  hb_unicode_funcs_destroy (buffer->unicode);

571
  free (buffer->info);
572
  free (buffer->pos);
573

574
  free (buffer);
B
Behdad Esfahbod 已提交
575 576
}

577 578 579 580
hb_bool_t
hb_buffer_set_user_data (hb_buffer_t        *buffer,
			 hb_user_data_key_t *key,
			 void *              data,
581 582
			 hb_destroy_func_t   destroy,
			 hb_bool_t           replace)
583
{
584
  return hb_object_set_user_data (buffer, key, data, destroy, replace);
585 586 587 588 589 590 591 592 593
}

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 已提交
594 595 596 597 598

void
hb_buffer_set_unicode_funcs (hb_buffer_t        *buffer,
			     hb_unicode_funcs_t *unicode)
{
B
Behdad Esfahbod 已提交
599 600 601
  if (unlikely (hb_object_is_inert (buffer)))
    return;

B
Behdad Esfahbod 已提交
602
  if (!unicode)
603
    unicode = _HB_BUFFER_UNICODE_FUNCS_DEFAULT;
B
Behdad Esfahbod 已提交
604

B
Behdad Esfahbod 已提交
605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620
  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 已提交
621 622 623
  if (unlikely (hb_object_is_inert (buffer)))
    return;

624
  buffer->props.direction = direction;
B
Behdad Esfahbod 已提交
625 626 627 628 629
}

hb_direction_t
hb_buffer_get_direction (hb_buffer_t    *buffer)
{
630
  return buffer->props.direction;
B
Behdad Esfahbod 已提交
631 632
}

633 634 635 636
void
hb_buffer_set_script (hb_buffer_t *buffer,
		      hb_script_t  script)
{
B
Behdad Esfahbod 已提交
637 638 639
  if (unlikely (hb_object_is_inert (buffer)))
    return;

640
  buffer->props.script = script;
641 642 643 644 645
}

hb_script_t
hb_buffer_get_script (hb_buffer_t *buffer)
{
646
  return buffer->props.script;
647 648 649 650 651 652
}

void
hb_buffer_set_language (hb_buffer_t   *buffer,
			hb_language_t  language)
{
B
Behdad Esfahbod 已提交
653 654 655
  if (unlikely (hb_object_is_inert (buffer)))
    return;

656
  buffer->props.language = language;
657 658 659 660 661
}

hb_language_t
hb_buffer_get_language (hb_buffer_t *buffer)
{
662
  return buffer->props.language;
663 664
}

B
Behdad Esfahbod 已提交
665

666 667
void
hb_buffer_reset (hb_buffer_t *buffer)
B
Behdad Esfahbod 已提交
668
{
669
  buffer->reset ();
B
Behdad Esfahbod 已提交
670 671
}

672
hb_bool_t
673
hb_buffer_pre_allocate (hb_buffer_t *buffer, unsigned int size)
B
Behdad Esfahbod 已提交
674
{
675
  return buffer->ensure (size);
B
Behdad Esfahbod 已提交
676 677
}

678 679 680 681 682 683
hb_bool_t
hb_buffer_allocation_successful (hb_buffer_t  *buffer)
{
  return !buffer->in_error;
}

684
void
685 686 687 688
hb_buffer_add (hb_buffer_t    *buffer,
	       hb_codepoint_t  codepoint,
	       hb_mask_t       mask,
	       unsigned int    cluster)
689
{
690
  buffer->add (codepoint, mask, cluster);
691 692
}

693 694 695 696
hb_bool_t
hb_buffer_set_length (hb_buffer_t  *buffer,
		      unsigned int  length)
{
697 698 699
  if (unlikely (hb_object_is_inert (buffer)))
    return length == 0;

700
  if (!buffer->ensure (length))
701
    return false;
702 703 704 705 706 707 708 709 710

  /* 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;
711
  return true;
712 713
}

714
unsigned int
715
hb_buffer_get_length (hb_buffer_t *buffer)
716
{
717
  return buffer->len;
718 719 720 721
}

/* Return value valid as long as buffer not modified */
hb_glyph_info_t *
722 723
hb_buffer_get_glyph_infos (hb_buffer_t  *buffer,
                           unsigned int *length)
724
{
725 726 727
  if (length)
    *length = buffer->len;

728
  return (hb_glyph_info_t *) buffer->info;
729 730 731 732
}

/* Return value valid as long as buffer not modified */
hb_glyph_position_t *
733 734
hb_buffer_get_glyph_positions (hb_buffer_t  *buffer,
                               unsigned int *length)
735
{
736
  if (!buffer->have_positions)
737
    buffer->clear_positions ();
738

739 740 741
  if (length)
    *length = buffer->len;

742
  return (hb_glyph_position_t *) buffer->pos;
743
}
B
Behdad Esfahbod 已提交
744

745 746 747
void
hb_buffer_reverse (hb_buffer_t *buffer)
{
748
  buffer->reverse ();
749 750 751 752 753
}

void
hb_buffer_reverse_clusters (hb_buffer_t *buffer)
{
754
  buffer->reverse_clusters ();
755 756
}

757 758 759 760 761 762
void
hb_buffer_guess_properties (hb_buffer_t *buffer)
{
  buffer->guess_properties ();
}

763 764
#define ADD_UTF(T) \
	HB_STMT_START { \
765 766 767 768 769 770 771 772 773 774
	  if (text_length == -1) { \
	    text_length = 0; \
	    const T *p = (const T *) text; \
	    while (*p) { \
	      text_length++; \
	      p++; \
	    } \
	  } \
	  if (item_length == -1) \
	    item_length = text_length - item_offset; \
775
	  buffer->ensure (buffer->len + item_length * sizeof (T) / 4); \
776 777 778 779 780 781
	  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); \
782
	    hb_buffer_add (buffer, u, 1,  old_next - (const T *) text); \
783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801
	  } \
	} 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;

802
  /* TODO check for overlong sequences? */
B
Behdad Esfahbod 已提交
803

804
  UTF8_COMPUTE (c, mask, len);
805
  if (unlikely (!len || (unsigned int) (end - text) < len)) {
806 807 808 809 810 811 812 813
    *unicode = -1;
    return text + 1;
  } else {
    hb_codepoint_t result;
    unsigned int i;
    result = c & mask;
    for (i = 1; i < len; i++)
      {
814
	if (unlikely ((text[i] & 0xc0) != 0x80))
815 816 817 818 819 820 821 822 823 824 825 826 827 828 829
	  {
	    *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,
830
		    int           text_length,
831
		    unsigned int  item_offset,
832
		    int           item_length)
833 834 835 836 837 838 839 840 841 842 843 844 845
{
#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++;

846
  if (unlikely (c >= 0xd800 && c < 0xdc00)) {
847 848
    /* high surrogate */
    uint16_t l;
B
Minor  
Behdad Esfahbod 已提交
849
    if (text < end && ((l = *text), likely (l >= 0xdc00 && l < 0xe000))) {
850 851 852 853 854 855 856 857 858 859 860 861 862 863
      /* 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,
864
		     int             text_length,
865
		     unsigned int    item_offset,
866
		     int            item_length)
867 868 869 870 871 872 873 874 875
{
#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,
876
		     int             text_length,
877
		     unsigned int    item_offset,
878
		     int             item_length)
879 880 881 882 883
{
#define UTF_NEXT(S, E, U)	((U) = *(S), (S)+1)
  ADD_UTF (uint32_t);
#undef UTF_NEXT
}
B
Behdad Esfahbod 已提交
884 885