hb-buffer.cc 48.6 KB
Newer Older
1
/*
B
Behdad Esfahbod 已提交
2 3
 * Copyright © 1998-2004  David Turner and Werner Lemberg
 * Copyright © 2004,2007,2009,2010  Red Hat, Inc.
4
 * Copyright © 2011,2012  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
#include "hb-utf-private.hh"
32

33

34 35 36 37 38 39 40 41 42
/**
 * SECTION: hb-buffer
 * @title: Buffers
 * @short_description: Input and output buffers
 * @include: hb.h
 *
 * Buffers serve dual role in HarfBuzz; they hold the input characters that are
 * passed hb_shape(), and after shaping they hold the output glyphs.
 **/
43

S
Sascha Brawer 已提交
44
/**
B
Behdad Esfahbod 已提交
45
 * hb_segment_properties_equal:
K
Khaled Hosny 已提交
46 47 48 49 50
 * @a: first #hb_segment_properties_t to compare.
 * @b: second #hb_segment_properties_t to compare.
 *
 * Checks the equality of two #hb_segment_properties_t's.
 *
B
Behdad Esfahbod 已提交
51
 * Return value:
K
Khaled Hosny 已提交
52
 * %true if all properties of @a equal those of @b, false otherwise.
B
Behdad Esfahbod 已提交
53
 *
S
Sascha Brawer 已提交
54 55
 * Since: 0.9.7
 **/
56 57 58 59 60 61 62 63 64 65 66 67
hb_bool_t
hb_segment_properties_equal (const hb_segment_properties_t *a,
			     const hb_segment_properties_t *b)
{
  return a->direction == b->direction &&
	 a->script    == b->script    &&
	 a->language  == b->language  &&
	 a->reserved1 == b->reserved1 &&
	 a->reserved2 == b->reserved2;

}

S
Sascha Brawer 已提交
68
/**
B
Behdad Esfahbod 已提交
69
 * hb_segment_properties_hash:
K
Khaled Hosny 已提交
70 71 72 73 74 75
 * @p: #hb_segment_properties_t to hash.
 *
 * Creates a hash representing @p.
 *
 * Return value:
 * A hash of @p.
B
Behdad Esfahbod 已提交
76
 *
S
Sascha Brawer 已提交
77 78
 * Since: 0.9.7
 **/
79 80 81 82 83 84 85 86 87 88
unsigned int
hb_segment_properties_hash (const hb_segment_properties_t *p)
{
  return (unsigned int) p->direction ^
	 (unsigned int) p->script ^
	 (intptr_t) (p->language);
}



89 90
/* Here is how the buffer works internally:
 *
B
Behdad Esfahbod 已提交
91 92
 * There are two info pointers: info and out_info.  They always have
 * the same allocated size, but different lengths.
93
 *
94
 * As an optimization, both info and out_info may point to the
95
 * same piece of memory, which is owned by info.  This remains the
96
 * case as long as out_len doesn't exceed i at any time.
97
 * In that case, swap_buffers() is no-op and the glyph operations operate
B
Behdad Esfahbod 已提交
98
 * mostly in-place.
99
 *
100
 * As soon as out_info gets longer than info, out_info is moved over
B
Behdad Esfahbod 已提交
101 102
 * to an alternate buffer (which we reuse the pos buffer for!), and its
 * current contents (out_len entries) are copied to the new place.
103
 * This should all remain transparent to the user.  swap_buffers() then
B
Behdad Esfahbod 已提交
104
 * switches info and out_info.
105 106
 */

B
Behdad Esfahbod 已提交
107

108 109 110 111 112

/* Internal API */

bool
hb_buffer_t::enlarge (unsigned int size)
113
{
B
Behdad Esfahbod 已提交
114
  if (unlikely (!successful))
115
    return false;
B
Behdad Esfahbod 已提交
116 117
  if (unlikely (size > max_len))
  {
B
Behdad Esfahbod 已提交
118
    successful = false;
B
Behdad Esfahbod 已提交
119 120
    return false;
  }
121

122
  unsigned int new_allocated = allocated;
B
Behdad Esfahbod 已提交
123 124
  hb_glyph_position_t *new_pos = nullptr;
  hb_glyph_info_t *new_info = nullptr;
125
  bool separate_out = out_info != info;
126

127
  if (unlikely (hb_unsigned_mul_overflows (size, sizeof (info[0]))))
B
Behdad Esfahbod 已提交
128
    goto done;
129

130
  while (size >= new_allocated)
131
    new_allocated += (new_allocated >> 1) + 32;
132

133
  static_assert ((sizeof (info[0]) == sizeof (pos[0])), "");
134
  if (unlikely (hb_unsigned_mul_overflows (new_allocated, sizeof (info[0]))))
B
Behdad Esfahbod 已提交
135 136
    goto done;

137 138
  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]));
139

B
Behdad Esfahbod 已提交
140
done:
141
  if (unlikely (!new_pos || !new_info))
B
Behdad Esfahbod 已提交
142
    successful = false;
143 144

  if (likely (new_pos))
145
    pos = new_pos;
146 147

  if (likely (new_info))
148 149 150
    info = new_info;

  out_info = separate_out ? (hb_glyph_info_t *) pos : info;
B
Behdad Esfahbod 已提交
151
  if (likely (successful))
152 153
    allocated = new_allocated;

B
Behdad Esfahbod 已提交
154
  return likely (successful);
155 156 157 158 159 160
}

bool
hb_buffer_t::make_room_for (unsigned int num_in,
			    unsigned int num_out)
{
161
  if (unlikely (!ensure (out_len + num_out))) return false;
162 163 164 165 166 167 168 169 170 171

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

172
  return true;
173 174
}

175 176 177 178 179 180 181
bool
hb_buffer_t::shift_forward (unsigned int count)
{
  assert (have_output);
  if (unlikely (!ensure (len + count))) return false;

  memmove (info + idx + count, info + idx, (len - idx) * sizeof (info[0]));
182 183 184 185 186 187
  if (idx + count > len)
  {
    /* Under memory failure we might expose this area.  At least
     * clean it up.  Oh well... */
    memset (info + len, 0, (idx + count - len) * sizeof (info[0]));
  }
188 189 190 191 192 193
  len += count;
  idx += count;

  return true;
}

B
Behdad Esfahbod 已提交
194 195
hb_buffer_t::scratch_buffer_t *
hb_buffer_t::get_scratch_buffer (unsigned int *size)
196
{
197 198
  have_output = false;
  have_positions = false;
199

200
  out_len = 0;
201 202
  out_info = info;

203
  assert ((uintptr_t) pos % sizeof (scratch_buffer_t) == 0);
B
Behdad Esfahbod 已提交
204
  *size = allocated * sizeof (pos[0]) / sizeof (scratch_buffer_t);
205
  return (scratch_buffer_t *) (void *) pos;
206 207
}

208

B
Behdad Esfahbod 已提交
209

210 211 212 213 214 215 216 217 218
/* HarfBuzz-Internal API */

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

  hb_unicode_funcs_destroy (unicode);
219
  unicode = hb_unicode_funcs_reference (hb_unicode_funcs_get_default ());
220
  flags = HB_BUFFER_FLAG_DEFAULT;
221
  replacement = HB_BUFFER_REPLACEMENT_CODEPOINT_DEFAULT;
222

B
Behdad Esfahbod 已提交
223 224 225 226 227 228 229 230 231
  clear ();
}

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

232
  hb_segment_properties_t default_props = HB_SEGMENT_PROPERTIES_DEFAULT;
233
  props = default_props;
234
  scratch_flags = HB_BUFFER_SCRATCH_FLAG_DEFAULT;
235

236
  content_type = HB_BUFFER_CONTENT_TYPE_INVALID;
B
Behdad Esfahbod 已提交
237
  successful = true;
238 239
  have_output = false;
  have_positions = false;
240

241 242 243
  idx = 0;
  len = 0;
  out_len = 0;
244
  out_info = info;
245

246
  serial = 0;
247 248 249

  memset (context, 0, sizeof context);
  memset (context_len, 0, sizeof context_len);
250 251

  deallocate_var_all ();
252 253
}

254 255 256
void
hb_buffer_t::add (hb_codepoint_t  codepoint,
		  unsigned int    cluster)
257
{
258 259 260 261 262 263 264 265
  hb_glyph_info_t *glyph;

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

  glyph = &info[len];

  memset (glyph, 0, sizeof (*glyph));
  glyph->codepoint = codepoint;
266
  glyph->mask = 0;
267 268 269
  glyph->cluster = cluster;

  len++;
270
}
271

272 273 274 275 276 277 278 279 280 281 282
void
hb_buffer_t::add_info (const hb_glyph_info_t &glyph_info)
{
  if (unlikely (!ensure (len + 1))) return;

  info[len] = glyph_info;

  len++;
}


B
Behdad Esfahbod 已提交
283 284 285 286 287 288 289 290 291 292 293 294 295
void
hb_buffer_t::remove_output (void)
{
  if (unlikely (hb_object_is_inert (this)))
    return;

  have_output = false;
  have_positions = false;

  out_len = 0;
  out_info = info;
}

296 297
void
hb_buffer_t::clear_output (void)
B
Behdad Esfahbod 已提交
298
{
299 300 301
  if (unlikely (hb_object_is_inert (this)))
    return;

302 303
  have_output = true;
  have_positions = false;
304

305 306 307 308 309 310 311 312 313 314
  out_len = 0;
  out_info = info;
}

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

315 316
  have_output = false;
  have_positions = true;
317

318 319 320
  out_len = 0;
  out_info = info;

321 322 323 324 325 326
  memset (pos, 0, sizeof (pos[0]) * len);
}

void
hb_buffer_t::swap_buffers (void)
{
B
Behdad Esfahbod 已提交
327
  if (unlikely (!successful)) return;
328 329

  assert (have_output);
330
  have_output = false;
331 332

  if (out_info != info)
333
  {
334 335 336 337 338 339 340 341 342 343 344 345 346 347
    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;
}
348

B
Behdad Esfahbod 已提交
349

B
Behdad Esfahbod 已提交
350 351 352
void
hb_buffer_t::replace_glyphs (unsigned int num_in,
			     unsigned int num_out,
B
Minor  
Behdad Esfahbod 已提交
353
			     const uint32_t *glyph_data)
B
Behdad Esfahbod 已提交
354
{
355
  if (unlikely (!make_room_for (num_in, num_out))) return;
B
Behdad Esfahbod 已提交
356

357
  merge_clusters (idx, idx + num_in);
B
Behdad Esfahbod 已提交
358

359
  hb_glyph_info_t orig_info = info[idx];
B
Behdad Esfahbod 已提交
360 361 362 363 364 365 366 367
  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++;
  }

368
  idx  += num_in;
369
  out_len += num_out;
B
Behdad Esfahbod 已提交
370 371
}

372 373 374
void
hb_buffer_t::output_glyph (hb_codepoint_t glyph_index)
{
375
  if (unlikely (!make_room_for (0, 1))) return;
376 377 378 379 380 381 382

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

  out_len++;
}

383
void
384
hb_buffer_t::output_info (const hb_glyph_info_t &glyph_info)
385
{
386
  if (unlikely (!make_room_for (0, 1))) return;
387 388 389 390 391 392

  out_info[out_len] = glyph_info;

  out_len++;
}

393 394 395
void
hb_buffer_t::copy_glyph (void)
{
396
  if (unlikely (!make_room_for (0, 1))) return;
397 398 399 400 401 402

  out_info[out_len] = info[idx];

  out_len++;
}

403 404 405 406 407 408 409
bool
hb_buffer_t::move_to (unsigned int i)
{
  if (!have_output)
  {
    assert (i <= len);
    idx = i;
410
    return true;
411
  }
B
Behdad Esfahbod 已提交
412
  if (unlikely (!successful))
413
    return false;
414 415 416 417

  assert (i <= out_len + (len - idx));

  if (out_len < i)
418 419
  {
    unsigned int count = i - out_len;
420
    if (unlikely (!make_room_for (count, count))) return false;
421 422 423 424 425 426 427 428 429 430

    memmove (out_info + out_len, info + idx, count * sizeof (out_info[0]));
    idx += count;
    out_len += count;
  }
  else if (out_len > i)
  {
    /* Tricky part: rewinding... */
    unsigned int count = out_len - i;

431 432
    /* This will blow in our face if memory allocation fails later
     * in this same lookup... */
433 434 435 436 437 438 439 440
    if (unlikely (idx < count && !shift_forward (count + 32))) return false;

    assert (idx >= count);

    idx -= count;
    out_len -= count;
    memmove (info + idx, out_info + out_len, count * sizeof (out_info[0]));
  }
441

442 443 444
  return true;
}

445 446 447
void
hb_buffer_t::replace_glyph (hb_codepoint_t glyph_index)
{
B
Behdad Esfahbod 已提交
448
  if (unlikely (out_info != info || out_len != idx)) {
449
    if (unlikely (!make_room_for (1, 1))) return;
B
Behdad Esfahbod 已提交
450 451
    out_info[out_len] = info[idx];
  }
452 453
  out_info[out_len].codepoint = glyph_index;

454
  idx++;
455
  out_len++;
456 457
}

B
Behdad Esfahbod 已提交
458

459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489
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;

490
  if (end - start < 2)
491 492 493 494 495 496 497 498 499 500
    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;
  }

501
  if (have_positions) {
502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541
    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);
542 543
}

544
void
B
Behdad Esfahbod 已提交
545 546
hb_buffer_t::merge_clusters_impl (unsigned int start,
				  unsigned int end)
547
{
548
  if (cluster_level == HB_BUFFER_CLUSTER_LEVEL_CHARACTERS)
549 550
  {
    unsafe_to_break (start, end);
551
    return;
552
  }
B
Behdad Esfahbod 已提交
553

554
  unsigned int cluster = info[start].cluster;
555 556

  for (unsigned int i = start + 1; i < end; i++)
557
    cluster = MIN<unsigned int> (cluster, info[i].cluster);
558 559 560 561 562

  /* Extend end */
  while (end < len && info[end - 1].cluster == info[end].cluster)
    end++;

563 564 565 566 567 568
  /* Extend start */
  while (idx < start && info[start - 1].cluster == info[start].cluster)
    start--;

  /* If we hit the start of buffer, continue in out-buffer. */
  if (idx == start)
569
    for (unsigned int i = out_len; i && out_info[i - 1].cluster == info[start].cluster; i--)
570
      set_cluster (out_info[i - 1], cluster);
571

572
  for (unsigned int i = start; i < end; i++)
573
    set_cluster (info[i], cluster);
574 575 576 577 578
}
void
hb_buffer_t::merge_out_clusters (unsigned int start,
				 unsigned int end)
{
579 580
  if (cluster_level == HB_BUFFER_CLUSTER_LEVEL_CHARACTERS)
    return;
B
Behdad Esfahbod 已提交
581

B
Minor  
Behdad Esfahbod 已提交
582
  if (unlikely (end - start < 2))
583 584
    return;

585
  unsigned int cluster = out_info[start].cluster;
586 587

  for (unsigned int i = start + 1; i < end; i++)
588
    cluster = MIN<unsigned int> (cluster, out_info[i].cluster);
589 590 591 592 593

  /* Extend start */
  while (start && out_info[start - 1].cluster == out_info[start].cluster)
    start--;

594 595 596 597
  /* Extend end */
  while (end < out_len && out_info[end - 1].cluster == out_info[end].cluster)
    end++;

598 599
  /* If we hit the end of out-buffer, continue in buffer. */
  if (end == out_len)
600
    for (unsigned int i = idx; i < len && info[i].cluster == out_info[end - 1].cluster; i++)
601
      set_cluster (info[i], cluster);
602

603
  for (unsigned int i = start; i < end; i++)
604
    set_cluster (out_info[i], cluster);
605
}
606 607 608
void
hb_buffer_t::delete_glyph ()
{
609 610
  /* The logic here is duplicated in hb_ot_hide_default_ignorables(). */

611 612 613 614 615 616 617 618 619 620 621 622
  unsigned int cluster = info[idx].cluster;
  if (idx + 1 < len && cluster == info[idx + 1].cluster)
  {
    /* Cluster survives; do nothing. */
    goto done;
  }

  if (out_len)
  {
    /* Merge cluster backward. */
    if (cluster < out_info[out_len - 1].cluster)
    {
623
      unsigned int mask = info[idx].mask;
624 625
      unsigned int old_cluster = out_info[out_len - 1].cluster;
      for (unsigned i = out_len; i && out_info[i - 1].cluster == old_cluster; i--)
626
	set_cluster (out_info[i - 1], cluster, mask);
627 628 629 630 631 632 633 634 635 636 637 638 639 640
    }
    goto done;
  }

  if (idx + 1 < len)
  {
    /* Merge cluster forward. */
    merge_clusters (idx, idx + 2);
    goto done;
  }

done:
  skip_glyph ();
}
641

642 643 644
void
hb_buffer_t::unsafe_to_break_impl (unsigned int start, unsigned int end)
{
645
  unsigned int cluster = (unsigned int) -1;
646 647
  cluster = _unsafe_to_break_find_min_cluster (info, start, end, cluster);
  _unsafe_to_break_set_mask (info, start, end, cluster);
648 649 650 651
}
void
hb_buffer_t::unsafe_to_break_from_outbuffer (unsigned int start, unsigned int end)
{
652 653 654 655 656 657
  if (!have_output)
  {
    unsafe_to_break_impl (start, end);
    return;
  }

658 659 660
  assert (start <= out_len);
  assert (idx <= end);

661
  unsigned int cluster = (unsigned int) -1;
662 663 664 665
  cluster = _unsafe_to_break_find_min_cluster (out_info, start, out_len, cluster);
  cluster = _unsafe_to_break_find_min_cluster (info, idx, end, cluster);
  _unsafe_to_break_set_mask (out_info, start, out_len, cluster);
  _unsafe_to_break_set_mask (info, idx, end, cluster);
666 667
}

668
void
669
hb_buffer_t::guess_segment_properties (void)
670
{
671 672
  assert (content_type == HB_BUFFER_CONTENT_TYPE_UNICODE ||
	  (!len && content_type == HB_BUFFER_CONTENT_TYPE_INVALID));
673

674 675 676
  /* If script is set to INVALID, guess from buffer contents */
  if (props.script == HB_SCRIPT_INVALID) {
    for (unsigned int i = 0; i < len; i++) {
677
      hb_script_t script = unicode->script (info[i].codepoint);
678 679 680 681 682 683 684 685 686 687 688 689
      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);
690 691
    if (props.direction == HB_DIRECTION_INVALID)
      props.direction = HB_DIRECTION_LTR;
692 693 694 695 696 697 698 699 700 701
  }

  /* 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 ();
  }
}


702 703
/* Public API */

704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725
DEFINE_NULL_INSTANCE (hb_buffer_t) =
{
  HB_OBJECT_HEADER_STATIC,

  const_cast<hb_unicode_funcs_t *> (&_hb_Null_hb_unicode_funcs_t),
  HB_BUFFER_FLAG_DEFAULT,
  HB_BUFFER_CLUSTER_LEVEL_DEFAULT,
  HB_BUFFER_REPLACEMENT_CODEPOINT_DEFAULT,
  HB_BUFFER_SCRATCH_FLAG_DEFAULT,
  HB_BUFFER_MAX_LEN_DEFAULT,
  HB_BUFFER_MAX_OPS_DEFAULT,

  HB_BUFFER_CONTENT_TYPE_INVALID,
  HB_SEGMENT_PROPERTIES_DEFAULT,
  false, /* successful */
  true, /* have_output */
  true  /* have_positions */

  /* Zero is good enough for everything else. */
};


726
/**
727
 * hb_buffer_create: (Xconstructor)
728
 *
729
 * Creates a new #hb_buffer_t with all properties to defaults.
730
 *
731 732
 * Return value: (transfer full):
 * A newly allocated #hb_buffer_t with a reference count of 1. The initial
K
Khaled Hosny 已提交
733
 * reference count should be released with hb_buffer_destroy() when you are done
734 735 736
 * using the #hb_buffer_t. This function never returns %NULL. If memory cannot
 * be allocated, a special #hb_buffer_t object will be returned on which
 * hb_buffer_allocation_successful() returns %false.
737
 *
B
Behdad Esfahbod 已提交
738
 * Since: 0.9.2
739
 **/
740
hb_buffer_t *
B
Minor  
Behdad Esfahbod 已提交
741
hb_buffer_create (void)
742
{
743 744
  hb_buffer_t *buffer;

745
  if (!(buffer = hb_object_create<hb_buffer_t> ()))
746
    return hb_buffer_get_empty ();
747

B
Behdad Esfahbod 已提交
748
  buffer->max_len = HB_BUFFER_MAX_LEN_DEFAULT;
749
  buffer->max_ops = HB_BUFFER_MAX_OPS_DEFAULT;
B
Behdad Esfahbod 已提交
750

751
  buffer->reset ();
B
Behdad Esfahbod 已提交
752

753 754
  return buffer;
}
B
Behdad Esfahbod 已提交
755

756 757 758 759 760 761 762
/**
 * hb_buffer_get_empty:
 *
 * 
 *
 * Return value: (transfer full):
 *
B
Behdad Esfahbod 已提交
763
 * Since: 0.9.2
764
 **/
765 766 767
hb_buffer_t *
hb_buffer_get_empty (void)
{
768
  return const_cast<hb_buffer_t *> (&Null(hb_buffer_t));
769 770
}

771 772
/**
 * hb_buffer_reference: (skip)
773
 * @buffer: an #hb_buffer_t.
774
 *
775 776
 * Increases the reference count on @buffer by one. This prevents @buffer from
 * being destroyed until a matching call to hb_buffer_destroy() is made.
777 778
 *
 * Return value: (transfer full):
779
 * The referenced #hb_buffer_t.
780
 *
B
Behdad Esfahbod 已提交
781
 * Since: 0.9.2
782
 **/
783 784 785
hb_buffer_t *
hb_buffer_reference (hb_buffer_t *buffer)
{
786
  return hb_object_reference (buffer);
787
}
B
Behdad Esfahbod 已提交
788

789 790
/**
 * hb_buffer_destroy: (skip)
791
 * @buffer: an #hb_buffer_t.
792
 *
793 794 795
 * Deallocate the @buffer.
 * Decreases the reference count on @buffer by one. If the result is zero, then
 * @buffer and all associated resources are freed. See hb_buffer_reference().
796
 *
B
Behdad Esfahbod 已提交
797
 * Since: 0.9.2
798
 **/
B
Behdad Esfahbod 已提交
799
void
800
hb_buffer_destroy (hb_buffer_t *buffer)
B
Behdad Esfahbod 已提交
801
{
802
  if (!hb_object_destroy (buffer)) return;
803

B
Behdad Esfahbod 已提交
804 805
  hb_unicode_funcs_destroy (buffer->unicode);

806
  free (buffer->info);
807
  free (buffer->pos);
808 809
  if (buffer->message_destroy)
    buffer->message_destroy (buffer->message_data);
810

811
  free (buffer);
B
Behdad Esfahbod 已提交
812 813
}

814 815
/**
 * hb_buffer_set_user_data: (skip)
816
 * @buffer: an #hb_buffer_t.
817 818 819 820 821 822 823 824 825
 * @key: 
 * @data: 
 * @destroy: 
 * @replace: 
 *
 * 
 *
 * Return value: 
 *
B
Behdad Esfahbod 已提交
826
 * Since: 0.9.2
827
 **/
828 829 830 831
hb_bool_t
hb_buffer_set_user_data (hb_buffer_t        *buffer,
			 hb_user_data_key_t *key,
			 void *              data,
832 833
			 hb_destroy_func_t   destroy,
			 hb_bool_t           replace)
834
{
835
  return hb_object_set_user_data (buffer, key, data, destroy, replace);
836 837
}

838 839
/**
 * hb_buffer_get_user_data: (skip)
840
 * @buffer: an #hb_buffer_t.
841 842 843 844 845 846
 * @key: 
 *
 * 
 *
 * Return value: 
 *
B
Behdad Esfahbod 已提交
847
 * Since: 0.9.2
848
 **/
849 850 851 852 853 854 855
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 已提交
856

857 858
/**
 * hb_buffer_set_content_type:
859
 * @buffer: an #hb_buffer_t.
860
 * @content_type: the type of buffer contents to set
861
 *
862 863
 * Sets the type of @buffer contents, buffers are either empty, contain
 * characters (before shaping) or glyphs (the result of shaping).
864
 *
S
Sascha Brawer 已提交
865
 * Since: 0.9.5
866
 **/
867 868 869 870 871 872 873
void
hb_buffer_set_content_type (hb_buffer_t              *buffer,
			    hb_buffer_content_type_t  content_type)
{
  buffer->content_type = content_type;
}

874 875
/**
 * hb_buffer_get_content_type:
876
 * @buffer: an #hb_buffer_t.
877
 *
878
 * see hb_buffer_set_content_type().
879
 *
880 881
 * Return value:
 * The type of @buffer contents.
882
 *
S
Sascha Brawer 已提交
883
 * Since: 0.9.5
884
 **/
885 886 887 888 889 890 891
hb_buffer_content_type_t
hb_buffer_get_content_type (hb_buffer_t *buffer)
{
  return buffer->content_type;
}


892 893
/**
 * hb_buffer_set_unicode_funcs:
894
 * @buffer: an #hb_buffer_t.
895 896 897 898
 * @unicode_funcs: 
 *
 * 
 *
B
Behdad Esfahbod 已提交
899
 * Since: 0.9.2
900
 **/
B
Behdad Esfahbod 已提交
901 902
void
hb_buffer_set_unicode_funcs (hb_buffer_t        *buffer,
903
			     hb_unicode_funcs_t *unicode_funcs)
B
Behdad Esfahbod 已提交
904
{
B
Behdad Esfahbod 已提交
905 906 907
  if (unlikely (hb_object_is_inert (buffer)))
    return;

908 909
  if (!unicode_funcs)
    unicode_funcs = hb_unicode_funcs_get_default ();
910

911
  hb_unicode_funcs_reference (unicode_funcs);
B
Behdad Esfahbod 已提交
912
  hb_unicode_funcs_destroy (buffer->unicode);
913
  buffer->unicode = unicode_funcs;
B
Behdad Esfahbod 已提交
914 915
}

916 917
/**
 * hb_buffer_get_unicode_funcs:
918
 * @buffer: an #hb_buffer_t.
919 920 921 922 923
 *
 * 
 *
 * Return value: 
 *
B
Behdad Esfahbod 已提交
924
 * Since: 0.9.2
925
 **/
B
Behdad Esfahbod 已提交
926 927 928 929 930 931
hb_unicode_funcs_t *
hb_buffer_get_unicode_funcs (hb_buffer_t        *buffer)
{
  return buffer->unicode;
}

932 933
/**
 * hb_buffer_set_direction:
934
 * @buffer: an #hb_buffer_t.
935
 * @direction: the #hb_direction_t of the @buffer
936
 *
937 938 939 940 941 942 943
 * Set the text flow direction of the buffer. No shaping can happen without
 * setting @buffer direction, and it controls the visual direction for the
 * output glyphs; for RTL direction the glyphs will be reversed. Many layout
 * features depend on the proper setting of the direction, for example,
 * reversing RTL text before shaping, then shaping with LTR direction is not
 * the same as keeping the text in logical order and shaping with RTL
 * direction.
944
 *
B
Behdad Esfahbod 已提交
945
 * Since: 0.9.2
946
 **/
B
Behdad Esfahbod 已提交
947 948 949 950 951
void
hb_buffer_set_direction (hb_buffer_t    *buffer,
			 hb_direction_t  direction)

{
B
Behdad Esfahbod 已提交
952 953 954
  if (unlikely (hb_object_is_inert (buffer)))
    return;

955
  buffer->props.direction = direction;
B
Behdad Esfahbod 已提交
956 957
}

958 959
/**
 * hb_buffer_get_direction:
960
 * @buffer: an #hb_buffer_t.
961
 *
962
 * See hb_buffer_set_direction()
963
 *
964 965
 * Return value:
 * The direction of the @buffer.
966
 *
B
Behdad Esfahbod 已提交
967
 * Since: 0.9.2
968
 **/
B
Behdad Esfahbod 已提交
969 970 971
hb_direction_t
hb_buffer_get_direction (hb_buffer_t    *buffer)
{
972
  return buffer->props.direction;
B
Behdad Esfahbod 已提交
973 974
}

975 976
/**
 * hb_buffer_set_script:
977
 * @buffer: an #hb_buffer_t.
978
 * @script: an #hb_script_t to set.
979
 *
980 981 982 983 984 985 986 987 988
 * Sets the script of @buffer to @script.
 *
 * Script is crucial for choosing the proper shaping behaviour for scripts that
 * require it (e.g. Arabic) and the which OpenType features defined in the font
 * to be applied.
 *
 * You can pass one of the predefined #hb_script_t values, or use
 * hb_script_from_string() or hb_script_from_iso15924_tag() to get the
 * corresponding script from an ISO 15924 script tag.
989
 *
B
Behdad Esfahbod 已提交
990
 * Since: 0.9.2
991
 **/
992 993 994 995
void
hb_buffer_set_script (hb_buffer_t *buffer,
		      hb_script_t  script)
{
B
Behdad Esfahbod 已提交
996 997 998
  if (unlikely (hb_object_is_inert (buffer)))
    return;

999
  buffer->props.script = script;
1000 1001
}

1002 1003
/**
 * hb_buffer_get_script:
1004
 * @buffer: an #hb_buffer_t.
1005
 *
1006
 * See hb_buffer_set_script().
1007
 *
1008 1009
 * Return value:
 * The #hb_script_t of the @buffer.
1010
 *
B
Behdad Esfahbod 已提交
1011
 * Since: 0.9.2
1012
 **/
1013 1014 1015
hb_script_t
hb_buffer_get_script (hb_buffer_t *buffer)
{
1016
  return buffer->props.script;
1017 1018
}

1019 1020
/**
 * hb_buffer_set_language:
1021
 * @buffer: an #hb_buffer_t.
1022
 * @language: an hb_language_t to set.
1023
 *
1024 1025 1026 1027 1028 1029 1030 1031 1032
 * Sets the language of @buffer to @language.
 *
 * Languages are crucial for selecting which OpenType feature to apply to the
 * buffer which can result in applying language-specific behaviour. Languages
 * are orthogonal to the scripts, and though they are related, they are
 * different concepts and should not be confused with each other.
 *
 * Use hb_language_from_string() to convert from ISO 639 language codes to
 * #hb_language_t.
1033
 *
B
Behdad Esfahbod 已提交
1034
 * Since: 0.9.2
1035
 **/
1036 1037 1038 1039
void
hb_buffer_set_language (hb_buffer_t   *buffer,
			hb_language_t  language)
{
B
Behdad Esfahbod 已提交
1040 1041 1042
  if (unlikely (hb_object_is_inert (buffer)))
    return;

1043
  buffer->props.language = language;
1044 1045
}

1046 1047
/**
 * hb_buffer_get_language:
1048
 * @buffer: an #hb_buffer_t.
1049
 *
1050
 * See hb_buffer_set_language().
1051
 *
1052
 * Return value: (transfer none):
1053
 * The #hb_language_t of the buffer. Must not be freed by the caller.
1054
 *
B
Behdad Esfahbod 已提交
1055
 * Since: 0.9.2
1056
 **/
1057 1058 1059
hb_language_t
hb_buffer_get_language (hb_buffer_t *buffer)
{
1060
  return buffer->props.language;
1061 1062
}

1063 1064
/**
 * hb_buffer_set_segment_properties:
1065
 * @buffer: an #hb_buffer_t.
K
Khaled Hosny 已提交
1066
 * @props: an #hb_segment_properties_t to use.
1067
 *
K
Khaled Hosny 已提交
1068 1069 1070
 * Sets the segment properties of the buffer, a shortcut for calling
 * hb_buffer_set_direction(), hb_buffer_set_script() and
 * hb_buffer_set_language() individually.
1071
 *
S
Sascha Brawer 已提交
1072
 * Since: 0.9.7
1073
 **/
1074 1075 1076 1077 1078 1079 1080 1081 1082 1083
void
hb_buffer_set_segment_properties (hb_buffer_t *buffer,
				  const hb_segment_properties_t *props)
{
  if (unlikely (hb_object_is_inert (buffer)))
    return;

  buffer->props = *props;
}

1084 1085
/**
 * hb_buffer_get_segment_properties:
1086
 * @buffer: an #hb_buffer_t.
K
Khaled Hosny 已提交
1087
 * @props: (out): the output #hb_segment_properties_t.
1088
 *
K
Khaled Hosny 已提交
1089
 * Sets @props to the #hb_segment_properties_t of @buffer.
1090
 *
S
Sascha Brawer 已提交
1091
 * Since: 0.9.7
1092
 **/
1093 1094 1095 1096 1097 1098 1099 1100
void
hb_buffer_get_segment_properties (hb_buffer_t *buffer,
				  hb_segment_properties_t *props)
{
  *props = buffer->props;
}


1101 1102
/**
 * hb_buffer_set_flags:
1103
 * @buffer: an #hb_buffer_t.
1104
 * @flags: the buffer flags to set.
1105
 *
1106
 * Sets @buffer flags to @flags. See #hb_buffer_flags_t.
1107
 *
S
Sascha Brawer 已提交
1108
 * Since: 0.9.7
1109
 **/
B
Behdad Esfahbod 已提交
1110 1111 1112 1113 1114 1115 1116 1117 1118 1119
void
hb_buffer_set_flags (hb_buffer_t       *buffer,
		     hb_buffer_flags_t  flags)
{
  if (unlikely (hb_object_is_inert (buffer)))
    return;

  buffer->flags = flags;
}

1120 1121
/**
 * hb_buffer_get_flags:
1122
 * @buffer: an #hb_buffer_t.
1123
 *
1124
 * See hb_buffer_set_flags().
1125 1126
 *
 * Return value: 
1127
 * The @buffer flags.
1128
 *
S
Sascha Brawer 已提交
1129
 * Since: 0.9.7
1130
 **/
B
Behdad Esfahbod 已提交
1131 1132 1133 1134 1135 1136
hb_buffer_flags_t
hb_buffer_get_flags (hb_buffer_t *buffer)
{
  return buffer->flags;
}

1137 1138
/**
 * hb_buffer_set_cluster_level:
1139
 * @buffer: an #hb_buffer_t.
1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157
 * @cluster_level: 
 *
 * 
 *
 * Since: 0.9.42
 **/
void
hb_buffer_set_cluster_level (hb_buffer_t       *buffer,
		     hb_buffer_cluster_level_t  cluster_level)
{
  if (unlikely (hb_object_is_inert (buffer)))
    return;

  buffer->cluster_level = cluster_level;
}

/**
 * hb_buffer_get_cluster_level:
1158
 * @buffer: an #hb_buffer_t.
1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171
 *
 * 
 *
 * Return value: 
 *
 * Since: 0.9.42
 **/
hb_buffer_cluster_level_t
hb_buffer_get_cluster_level (hb_buffer_t *buffer)
{
  return buffer->cluster_level;
}

B
Behdad Esfahbod 已提交
1172

1173 1174
/**
 * hb_buffer_set_replacement_codepoint:
1175
 * @buffer: an #hb_buffer_t.
K
Khaled Hosny 已提交
1176
 * @replacement: the replacement #hb_codepoint_t
1177
 *
K
Khaled Hosny 已提交
1178 1179 1180 1181
 * Sets the #hb_codepoint_t that replaces invalid entries for a given encoding
 * when adding text to @buffer.
 *
 * Default is %HB_BUFFER_REPLACEMENT_CODEPOINT_DEFAULT.
1182
 *
S
Sascha Brawer 已提交
1183
 * Since: 0.9.31
1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196
 **/
void
hb_buffer_set_replacement_codepoint (hb_buffer_t    *buffer,
				     hb_codepoint_t  replacement)
{
  if (unlikely (hb_object_is_inert (buffer)))
    return;

  buffer->replacement = replacement;
}

/**
 * hb_buffer_get_replacement_codepoint:
1197
 * @buffer: an #hb_buffer_t.
1198
 *
K
Khaled Hosny 已提交
1199
 * See hb_buffer_set_replacement_codepoint().
1200 1201
 *
 * Return value: 
K
Khaled Hosny 已提交
1202
 * The @buffer replacement #hb_codepoint_t.
1203
 *
S
Sascha Brawer 已提交
1204
 * Since: 0.9.31
1205 1206 1207 1208 1209 1210 1211 1212
 **/
hb_codepoint_t
hb_buffer_get_replacement_codepoint (hb_buffer_t    *buffer)
{
  return buffer->replacement;
}


1213 1214
/**
 * hb_buffer_reset:
1215
 * @buffer: an #hb_buffer_t.
1216
 *
K
Khaled Hosny 已提交
1217 1218
 * Resets the buffer to its initial status, as if it was just newly created
 * with hb_buffer_create().
1219
 *
B
Behdad Esfahbod 已提交
1220
 * Since: 0.9.2
1221
 **/
1222 1223
void
hb_buffer_reset (hb_buffer_t *buffer)
B
Behdad Esfahbod 已提交
1224
{
1225
  buffer->reset ();
B
Behdad Esfahbod 已提交
1226 1227
}

1228 1229
/**
 * hb_buffer_clear_contents:
1230
 * @buffer: an #hb_buffer_t.
1231
 *
K
Khaled Hosny 已提交
1232 1233
 * Similar to hb_buffer_reset(), but does not clear the Unicode functions and
 * the replacement code point.
1234
 *
S
Sascha Brawer 已提交
1235
 * Since: 0.9.11
1236
 **/
B
Behdad Esfahbod 已提交
1237
void
1238
hb_buffer_clear_contents (hb_buffer_t *buffer)
B
Behdad Esfahbod 已提交
1239 1240 1241 1242
{
  buffer->clear ();
}

1243 1244
/**
 * hb_buffer_pre_allocate:
1245
 * @buffer: an #hb_buffer_t.
1246
 * @size: number of items to pre allocate.
1247
 *
1248
 * Pre allocates memory for @buffer to fit at least @size number of items.
1249
 *
1250
 * Return value:
K
Khaled Hosny 已提交
1251
 * %true if @buffer memory allocation succeeded, %false otherwise.
1252
 *
B
Behdad Esfahbod 已提交
1253
 * Since: 0.9.2
1254
 **/
1255
hb_bool_t
1256
hb_buffer_pre_allocate (hb_buffer_t *buffer, unsigned int size)
B
Behdad Esfahbod 已提交
1257
{
1258
  return buffer->ensure (size);
B
Behdad Esfahbod 已提交
1259 1260
}

1261 1262
/**
 * hb_buffer_allocation_successful:
1263
 * @buffer: an #hb_buffer_t.
1264
 *
1265
 * Check if allocating memory for the buffer succeeded.
1266
 *
1267
 * Return value:
K
Khaled Hosny 已提交
1268
 * %true if @buffer memory allocation succeeded, %false otherwise.
1269
 *
B
Behdad Esfahbod 已提交
1270
 * Since: 0.9.2
1271
 **/
1272 1273 1274
hb_bool_t
hb_buffer_allocation_successful (hb_buffer_t  *buffer)
{
B
Behdad Esfahbod 已提交
1275
  return buffer->successful;
1276 1277
}

1278 1279
/**
 * hb_buffer_add:
1280 1281 1282
 * @buffer: an #hb_buffer_t.
 * @codepoint: a Unicode code point.
 * @cluster: the cluster value of @codepoint.
1283
 *
1284 1285 1286 1287 1288
 * Appends a character with the Unicode value of @codepoint to @buffer, and
 * gives it the initial cluster value of @cluster. Clusters can be any thing
 * the client wants, they are usually used to refer to the index of the
 * character in the input text stream and are output in
 * #hb_glyph_info_t.cluster field.
1289
 *
K
Khaled Hosny 已提交
1290 1291 1292
 * This function does not check the validity of @codepoint, it is up to the
 * caller to ensure it is a valid Unicode code point.
 *
B
Behdad Esfahbod 已提交
1293
 * Since: 0.9.7
1294
 **/
1295
void
1296 1297 1298
hb_buffer_add (hb_buffer_t    *buffer,
	       hb_codepoint_t  codepoint,
	       unsigned int    cluster)
1299
{
1300
  buffer->add (codepoint, cluster);
1301
  buffer->clear_context (1);
1302 1303
}

1304 1305
/**
 * hb_buffer_set_length:
1306
 * @buffer: an #hb_buffer_t.
K
Khaled Hosny 已提交
1307
 * @length: the new length of @buffer.
1308
 *
K
Khaled Hosny 已提交
1309 1310
 * Similar to hb_buffer_pre_allocate(), but clears any new items added at the
 * end.
1311 1312
 *
 * Return value: 
K
Khaled Hosny 已提交
1313
 * %true if @buffer memory allocation succeeded, %false otherwise.
1314
 *
B
Behdad Esfahbod 已提交
1315
 * Since: 0.9.2
1316
 **/
1317 1318 1319 1320
hb_bool_t
hb_buffer_set_length (hb_buffer_t  *buffer,
		      unsigned int  length)
{
1321 1322 1323
  if (unlikely (hb_object_is_inert (buffer)))
    return length == 0;

1324
  if (!buffer->ensure (length))
1325
    return false;
1326 1327 1328 1329 1330 1331 1332 1333 1334

  /* 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;
1335 1336

  if (!length)
1337 1338
  {
    buffer->content_type = HB_BUFFER_CONTENT_TYPE_INVALID;
1339
    buffer->clear_context (0);
1340
  }
1341 1342
  buffer->clear_context (1);

1343
  return true;
1344 1345
}

B
Behdad Esfahbod 已提交
1346 1347
/**
 * hb_buffer_get_length:
1348
 * @buffer: an #hb_buffer_t.
B
Behdad Esfahbod 已提交
1349 1350 1351
 *
 * Returns the number of items in the buffer.
 *
1352 1353
 * Return value:
 * The @buffer length.
K
Khaled Hosny 已提交
1354
 * The value valid as long as buffer has not been modified.
B
Behdad Esfahbod 已提交
1355
 *
B
Behdad Esfahbod 已提交
1356
 * Since: 0.9.2
B
Behdad Esfahbod 已提交
1357
 **/
1358
unsigned int
1359
hb_buffer_get_length (hb_buffer_t *buffer)
1360
{
1361
  return buffer->len;
1362 1363
}

B
Behdad Esfahbod 已提交
1364 1365
/**
 * hb_buffer_get_glyph_infos:
1366
 * @buffer: an #hb_buffer_t.
B
Behdad Esfahbod 已提交
1367 1368
 * @length: (out): output array length.
 *
1369 1370
 * Returns @buffer glyph information array.  Returned pointer
 * is valid as long as @buffer contents are not modified.
B
Behdad Esfahbod 已提交
1371
 *
1372 1373
 * Return value: (transfer none) (array length=length):
 * The @buffer glyph information array.
K
Khaled Hosny 已提交
1374
 * The value valid as long as buffer has not been modified.
B
Behdad Esfahbod 已提交
1375
 *
B
Behdad Esfahbod 已提交
1376
 * Since: 0.9.2
B
Behdad Esfahbod 已提交
1377
 **/
1378
hb_glyph_info_t *
1379 1380
hb_buffer_get_glyph_infos (hb_buffer_t  *buffer,
                           unsigned int *length)
1381
{
1382 1383 1384
  if (length)
    *length = buffer->len;

1385
  return (hb_glyph_info_t *) buffer->info;
1386 1387
}

B
Behdad Esfahbod 已提交
1388 1389
/**
 * hb_buffer_get_glyph_positions:
1390
 * @buffer: an #hb_buffer_t.
B
Behdad Esfahbod 已提交
1391 1392
 * @length: (out): output length.
 *
1393 1394
 * Returns @buffer glyph position array.  Returned pointer
 * is valid as long as @buffer contents are not modified.
B
Behdad Esfahbod 已提交
1395
 *
1396 1397
 * Return value: (transfer none) (array length=length):
 * The @buffer glyph position array.
K
Khaled Hosny 已提交
1398
 * The value valid as long as buffer has not been modified.
B
Behdad Esfahbod 已提交
1399
 *
B
Behdad Esfahbod 已提交
1400
 * Since: 0.9.2
B
Behdad Esfahbod 已提交
1401
 **/
1402
hb_glyph_position_t *
1403 1404
hb_buffer_get_glyph_positions (hb_buffer_t  *buffer,
                               unsigned int *length)
1405
{
1406
  if (!buffer->have_positions)
1407
    buffer->clear_positions ();
1408

1409 1410 1411
  if (length)
    *length = buffer->len;

1412
  return (hb_glyph_position_t *) buffer->pos;
1413
}
B
Behdad Esfahbod 已提交
1414

1415 1416
/**
 * hb_glyph_info_get_glyph_flags:
B
Behdad Esfahbod 已提交
1417
 * @info: a #hb_glyph_info_t.
1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431
 *
 * Returns glyph flags encoded within a #hb_glyph_info_t.
 *
 * Return value:
 * The #hb_glyph_flags_t encoded within @info.
 *
 * Since: 1.5.0
 **/
hb_glyph_flags_t
(hb_glyph_info_get_glyph_flags) (const hb_glyph_info_t *info)
{
  return hb_glyph_info_get_glyph_flags (info);
}

B
Behdad Esfahbod 已提交
1432 1433
/**
 * hb_buffer_reverse:
1434
 * @buffer: an #hb_buffer_t.
B
Behdad Esfahbod 已提交
1435 1436 1437
 *
 * Reverses buffer contents.
 *
B
Behdad Esfahbod 已提交
1438
 * Since: 0.9.2
B
Behdad Esfahbod 已提交
1439
 **/
1440 1441 1442
void
hb_buffer_reverse (hb_buffer_t *buffer)
{
1443
  buffer->reverse ();
1444 1445
}

1446 1447
/**
 * hb_buffer_reverse_range:
1448
 * @buffer: an #hb_buffer_t.
1449 1450 1451
 * @start: start index.
 * @end: end index.
 *
B
Behdad Esfahbod 已提交
1452
 * Reverses buffer contents between start to end.
1453
 *
B
Behdad Esfahbod 已提交
1454
 * Since: 0.9.41
1455 1456 1457 1458 1459 1460 1461 1462
 **/
void
hb_buffer_reverse_range (hb_buffer_t *buffer,
			 unsigned int start, unsigned int end)
{
  buffer->reverse_range (start, end);
}

B
Behdad Esfahbod 已提交
1463 1464
/**
 * hb_buffer_reverse_clusters:
1465
 * @buffer: an #hb_buffer_t.
B
Behdad Esfahbod 已提交
1466 1467 1468 1469 1470
 *
 * Reverses buffer clusters.  That is, the buffer contents are
 * reversed, then each cluster (consecutive items having the
 * same cluster number) are reversed again.
 *
B
Behdad Esfahbod 已提交
1471
 * Since: 0.9.2
B
Behdad Esfahbod 已提交
1472
 **/
1473 1474 1475
void
hb_buffer_reverse_clusters (hb_buffer_t *buffer)
{
1476
  buffer->reverse_clusters ();
1477 1478
}

B
Behdad Esfahbod 已提交
1479 1480
/**
 * hb_buffer_guess_segment_properties:
1481
 * @buffer: an #hb_buffer_t.
B
Behdad Esfahbod 已提交
1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494
 *
 * Sets unset buffer segment properties based on buffer Unicode
 * contents.  If buffer is not empty, it must have content type
 * %HB_BUFFER_CONTENT_TYPE_UNICODE.
 *
 * If buffer script is not set (ie. is %HB_SCRIPT_INVALID), it
 * will be set to the Unicode script of the first character in
 * the buffer that has a script other than %HB_SCRIPT_COMMON,
 * %HB_SCRIPT_INHERITED, and %HB_SCRIPT_UNKNOWN.
 *
 * Next, if buffer direction is not set (ie. is %HB_DIRECTION_INVALID),
 * it will be set to the natural horizontal direction of the
 * buffer script as returned by hb_script_get_horizontal_direction().
1495 1496
 * If hb_script_get_horizontal_direction() returns %HB_DIRECTION_INVALID,
 * then %HB_DIRECTION_LTR is used.
B
Behdad Esfahbod 已提交
1497 1498 1499 1500 1501 1502
 *
 * Finally, if buffer language is not set (ie. is %HB_LANGUAGE_INVALID),
 * it will be set to the process's default language as returned by
 * hb_language_get_default().  This may change in the future by
 * taking buffer script into consideration when choosing a language.
 *
S
Sascha Brawer 已提交
1503
 * Since: 0.9.7
B
Behdad Esfahbod 已提交
1504
 **/
1505
void
1506
hb_buffer_guess_segment_properties (hb_buffer_t *buffer)
1507
{
1508
  buffer->guess_segment_properties ();
1509 1510
}

1511
template <typename utf_t>
1512 1513
static inline void
hb_buffer_add_utf (hb_buffer_t  *buffer,
1514
		   const typename utf_t::codepoint_t *text,
1515 1516 1517 1518
		   int           text_length,
		   unsigned int  item_offset,
		   int           item_length)
{
1519
  typedef typename utf_t::codepoint_t T;
1520
  const hb_codepoint_t replacement = buffer->replacement;
1521

1522 1523 1524 1525 1526 1527
  assert (buffer->content_type == HB_BUFFER_CONTENT_TYPE_UNICODE ||
	  (!buffer->len && buffer->content_type == HB_BUFFER_CONTENT_TYPE_INVALID));

  if (unlikely (hb_object_is_inert (buffer)))
    return;

B
Behdad Esfahbod 已提交
1528
  if (text_length == -1)
1529
    text_length = utf_t::strlen (text);
1530 1531 1532 1533 1534 1535

  if (item_length == -1)
    item_length = text_length - item_offset;

  buffer->ensure (buffer->len + item_length * sizeof (T) / 4);

1536 1537 1538 1539 1540 1541 1542 1543
  /* If buffer is empty and pre-context provided, install it.
   * This check is written this way, to make sure people can
   * provide pre-context in one add_utf() call, then provide
   * text in a follow-up call.  See:
   *
   * https://bugzilla.mozilla.org/show_bug.cgi?id=801410#c13
   */
  if (!buffer->len && item_offset > 0)
1544 1545 1546 1547 1548 1549 1550 1551
  {
    /* Add pre-context */
    buffer->clear_context (0);
    const T *prev = text + item_offset;
    const T *start = text;
    while (start < prev && buffer->context_len[0] < buffer->CONTEXT_LENGTH)
    {
      hb_codepoint_t u;
1552
      prev = utf_t::prev (prev, start, &u, replacement);
1553 1554 1555 1556 1557
      buffer->context[0][buffer->context_len[0]++] = u;
    }
  }

  const T *next = text + item_offset;
1558
  const T *end = next + item_length;
1559 1560
  while (next < end)
  {
1561 1562
    hb_codepoint_t u;
    const T *old_next = next;
1563
    next = utf_t::next (next, end, &u, replacement);
1564
    buffer->add (u, old_next - (const T *) text);
1565 1566 1567 1568 1569 1570 1571 1572
  }

  /* Add post-context */
  buffer->clear_context (1);
  end = text + text_length;
  while (next < end && buffer->context_len[1] < buffer->CONTEXT_LENGTH)
  {
    hb_codepoint_t u;
1573
    next = utf_t::next (next, end, &u, replacement);
1574
    buffer->context[1][buffer->context_len[1]++] = u;
1575 1576 1577
  }

  buffer->content_type = HB_BUFFER_CONTENT_TYPE_UNICODE;
1578 1579
}

1580 1581
/**
 * hb_buffer_add_utf8:
1582
 * @buffer: an #hb_buffer_t.
K
Khaled Hosny 已提交
1583 1584
 * @text: (array length=text_length) (element-type uint8_t): an array of UTF-8
 *               characters to append.
1585 1586 1587 1588
 * @text_length: the length of the @text, or -1 if it is %NULL terminated.
 * @item_offset: the offset of the first character to add to the @buffer.
 * @item_length: the number of characters to add to the @buffer, or -1 for the
 *               end of @text (assuming it is %NULL terminated).
1589
 *
1590
 * See hb_buffer_add_codepoints().
1591
 *
K
Khaled Hosny 已提交
1592 1593 1594
 * Replaces invalid UTF-8 characters with the @buffer replacement code point,
 * see hb_buffer_set_replacement_codepoint().
 *
B
Behdad Esfahbod 已提交
1595
 * Since: 0.9.2
1596
 **/
1597 1598 1599
void
hb_buffer_add_utf8 (hb_buffer_t  *buffer,
		    const char   *text,
1600
		    int           text_length,
1601
		    unsigned int  item_offset,
1602
		    int           item_length)
1603
{
1604
  hb_buffer_add_utf<hb_utf8_t> (buffer, (const uint8_t *) text, text_length, item_offset, item_length);
1605 1606
}

1607 1608
/**
 * hb_buffer_add_utf16:
1609 1610 1611 1612 1613 1614
 * @buffer: an #hb_buffer_t.
 * @text: (array length=text_length): an array of UTF-16 characters to append.
 * @text_length: the length of the @text, or -1 if it is %NULL terminated.
 * @item_offset: the offset of the first character to add to the @buffer.
 * @item_length: the number of characters to add to the @buffer, or -1 for the
 *               end of @text (assuming it is %NULL terminated).
1615
 *
1616
 * See hb_buffer_add_codepoints().
1617
 *
K
Khaled Hosny 已提交
1618 1619 1620
 * Replaces invalid UTF-16 characters with the @buffer replacement code point,
 * see hb_buffer_set_replacement_codepoint().
 *
B
Behdad Esfahbod 已提交
1621
 * Since: 0.9.2
1622
 **/
1623 1624 1625
void
hb_buffer_add_utf16 (hb_buffer_t    *buffer,
		     const uint16_t *text,
1626
		     int             text_length,
1627
		     unsigned int    item_offset,
1628
		     int             item_length)
1629
{
1630
  hb_buffer_add_utf<hb_utf16_t> (buffer, text, text_length, item_offset, item_length);
1631 1632
}

1633 1634
/**
 * hb_buffer_add_utf32:
1635 1636 1637 1638 1639 1640
 * @buffer: an #hb_buffer_t.
 * @text: (array length=text_length): an array of UTF-32 characters to append.
 * @text_length: the length of the @text, or -1 if it is %NULL terminated.
 * @item_offset: the offset of the first character to add to the @buffer.
 * @item_length: the number of characters to add to the @buffer, or -1 for the
 *               end of @text (assuming it is %NULL terminated).
1641
 *
1642
 * See hb_buffer_add_codepoints().
1643
 *
K
Khaled Hosny 已提交
1644 1645 1646
 * Replaces invalid UTF-32 characters with the @buffer replacement code point,
 * see hb_buffer_set_replacement_codepoint().
 *
B
Behdad Esfahbod 已提交
1647
 * Since: 0.9.2
1648
 **/
1649 1650 1651
void
hb_buffer_add_utf32 (hb_buffer_t    *buffer,
		     const uint32_t *text,
1652
		     int             text_length,
1653
		     unsigned int    item_offset,
1654
		     int             item_length)
1655
{
1656 1657 1658 1659 1660
  hb_buffer_add_utf<hb_utf32_t<> > (buffer, text, text_length, item_offset, item_length);
}

/**
 * hb_buffer_add_latin1:
1661
 * @buffer: an #hb_buffer_t.
K
Khaled Hosny 已提交
1662 1663 1664 1665 1666 1667
 * @text: (array length=text_length) (element-type uint8_t): an array of UTF-8
 *               characters to append.
 * @text_length: the length of the @text, or -1 if it is %NULL terminated.
 * @item_offset: the offset of the first character to add to the @buffer.
 * @item_length: the number of characters to add to the @buffer, or -1 for the
 *               end of @text (assuming it is %NULL terminated).
1668
 *
K
Khaled Hosny 已提交
1669 1670 1671 1672
 * Similar to hb_buffer_add_codepoints(), but allows only access to first 256
 * Unicode code points that can fit in 8-bit strings.
 *
 * <note>Has nothing to do with non-Unicode Latin-1 encoding.</note>
1673
 *
S
Sascha Brawer 已提交
1674
 * Since: 0.9.39
1675 1676 1677 1678 1679 1680 1681 1682 1683
 **/
void
hb_buffer_add_latin1 (hb_buffer_t   *buffer,
		      const uint8_t *text,
		      int            text_length,
		      unsigned int   item_offset,
		      int            item_length)
{
  hb_buffer_add_utf<hb_latin1_t> (buffer, text, text_length, item_offset, item_length);
1684 1685 1686 1687
}

/**
 * hb_buffer_add_codepoints:
1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703
 * @buffer: a #hb_buffer_t to append characters to.
 * @text: (array length=text_length): an array of Unicode code points to append.
 * @text_length: the length of the @text, or -1 if it is %NULL terminated.
 * @item_offset: the offset of the first code point to add to the @buffer.
 * @item_length: the number of code points to add to the @buffer, or -1 for the
 *               end of @text (assuming it is %NULL terminated).
 *
 * Appends characters from @text array to @buffer. The @item_offset is the
 * position of the first character from @text that will be appended, and
 * @item_length is the number of character. When shaping part of a larger text
 * (e.g. a run of text from a paragraph), instead of passing just the substring
 * corresponding to the run, it is preferable to pass the whole
 * paragraph and specify the run start and length as @item_offset and
 * @item_length, respectively, to give HarfBuzz the full context to be able,
 * for example, to do cross-run Arabic shaping or properly handle combining
 * marks at stat of run.
1704
 *
K
Khaled Hosny 已提交
1705 1706 1707
 * This function does not check the validity of @text, it is up to the caller
 * to ensure it contains a valid Unicode code points.
 *
S
Sascha Brawer 已提交
1708
 * Since: 0.9.31
1709 1710 1711 1712 1713 1714 1715 1716
 **/
void
hb_buffer_add_codepoints (hb_buffer_t          *buffer,
			  const hb_codepoint_t *text,
			  int                   text_length,
			  unsigned int          item_offset,
			  int                   item_length)
{
1717
  hb_buffer_add_utf<hb_utf32_t<false> > (buffer, text, text_length, item_offset, item_length);
1718
}
B
Behdad Esfahbod 已提交
1719 1720


B
Behdad Esfahbod 已提交
1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738
/**
 * hb_buffer_append:
 * @buffer: an #hb_buffer_t.
 * @source: source #hb_buffer_t.
 * @start: start index into source buffer to copy.  Use 0 to copy from start of buffer.
 * @end: end index into source buffer to copy.  Use (unsigned int) -1 to copy to end of buffer.
 *
 * Append (part of) contents of another buffer to this buffer.
 *
 * Since: 1.5.0
 **/
HB_EXTERN void
hb_buffer_append (hb_buffer_t *buffer,
		  hb_buffer_t *source,
		  unsigned int start,
		  unsigned int end)
{
  assert (!buffer->have_output && !source->have_output);
1739 1740
  assert (buffer->have_positions == source->have_positions ||
	  !buffer->len || !source->len);
B
Behdad Esfahbod 已提交
1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752
  assert (buffer->content_type == source->content_type ||
	  !buffer->len || !source->len);

  if (end > source->len)
    end = source->len;
  if (start > end)
    start = end;
  if (start == end)
    return;

  if (!buffer->len)
    buffer->content_type = source->content_type;
1753 1754
  if (!buffer->have_positions && source->have_positions)
    buffer->clear_positions ();
B
Behdad Esfahbod 已提交
1755

B
Behdad Esfahbod 已提交
1756
  if (buffer->len + (end - start) < buffer->len) /* Overflows. */
B
Behdad Esfahbod 已提交
1757
  {
B
Behdad Esfahbod 已提交
1758
    buffer->successful = false;
B
Behdad Esfahbod 已提交
1759 1760 1761 1762 1763
    return;
  }

  unsigned int orig_len = buffer->len;
  hb_buffer_set_length (buffer, buffer->len + (end - start));
B
Behdad Esfahbod 已提交
1764
  if (unlikely (!buffer->successful))
B
Behdad Esfahbod 已提交
1765 1766 1767 1768 1769 1770 1771 1772
    return;

  memcpy (buffer->info + orig_len, source->info + start, (end - start) * sizeof (buffer->info[0]));
  if (buffer->have_positions)
    memcpy (buffer->pos + orig_len, source->pos + start, (end - start) * sizeof (buffer->pos[0]));
}


1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814
static int
compare_info_codepoint (const hb_glyph_info_t *pa,
			const hb_glyph_info_t *pb)
{
  return (int) pb->codepoint - (int) pa->codepoint;
}

static inline void
normalize_glyphs_cluster (hb_buffer_t *buffer,
			  unsigned int start,
			  unsigned int end,
			  bool backward)
{
  hb_glyph_position_t *pos = buffer->pos;

  /* Total cluster advance */
  hb_position_t total_x_advance = 0, total_y_advance = 0;
  for (unsigned int i = start; i < end; i++)
  {
    total_x_advance += pos[i].x_advance;
    total_y_advance += pos[i].y_advance;
  }

  hb_position_t x_advance = 0, y_advance = 0;
  for (unsigned int i = start; i < end; i++)
  {
    pos[i].x_offset += x_advance;
    pos[i].y_offset += y_advance;

    x_advance += pos[i].x_advance;
    y_advance += pos[i].y_advance;

    pos[i].x_advance = 0;
    pos[i].y_advance = 0;
  }

  if (backward)
  {
    /* Transfer all cluster advance to the last glyph. */
    pos[end - 1].x_advance = total_x_advance;
    pos[end - 1].y_advance = total_y_advance;

1815
    hb_stable_sort (buffer->info + start, end - start - 1, compare_info_codepoint, buffer->pos + start);
1816 1817 1818 1819 1820 1821 1822 1823
  } else {
    /* Transfer all cluster advance to the first glyph. */
    pos[start].x_advance += total_x_advance;
    pos[start].y_advance += total_y_advance;
    for (unsigned int i = start + 1; i < end; i++) {
      pos[i].x_offset -= total_x_advance;
      pos[i].y_offset -= total_y_advance;
    }
1824
    hb_stable_sort (buffer->info + start + 1, end - start - 1, compare_info_codepoint, buffer->pos + start + 1);
1825 1826 1827
  }
}

1828 1829
/**
 * hb_buffer_normalize_glyphs:
1830
 * @buffer: an #hb_buffer_t.
1831
 *
K
Khaled Hosny 已提交
1832 1833 1834 1835
 * Reorders a glyph buffer to have canonical in-cluster glyph order / position.
 * The resulting clusters should behave identical to pre-reordering clusters.
 *
 * <note>This has nothing to do with Unicode normalization.</note>
1836
 *
S
Sascha Brawer 已提交
1837
 * Since: 0.9.2
1838
 **/
1839 1840 1841 1842
void
hb_buffer_normalize_glyphs (hb_buffer_t *buffer)
{
  assert (buffer->have_positions);
B
Behdad Esfahbod 已提交
1843 1844
  assert (buffer->content_type == HB_BUFFER_CONTENT_TYPE_GLYPHS ||
	  (!buffer->len && buffer->content_type == HB_BUFFER_CONTENT_TYPE_INVALID));
1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860

  bool backward = HB_DIRECTION_IS_BACKWARD (buffer->props.direction);

  unsigned int count = buffer->len;
  if (unlikely (!count)) return;
  hb_glyph_info_t *info = buffer->info;

  unsigned int start = 0;
  unsigned int end;
  for (end = start + 1; end < count; end++)
    if (info[start].cluster != info[end].cluster) {
      normalize_glyphs_cluster (buffer, start, end, backward);
      start = end;
    }
  normalize_glyphs_cluster (buffer, start, end, backward);
}
1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881

void
hb_buffer_t::sort (unsigned int start, unsigned int end, int(*compar)(const hb_glyph_info_t *, const hb_glyph_info_t *))
{
  assert (!have_positions);
  for (unsigned int i = start + 1; i < end; i++)
  {
    unsigned int j = i;
    while (j > start && compar (&info[j - 1], &info[i]) > 0)
      j--;
    if (i == j)
      continue;
    /* Move item i to occupy place for item j, shift what's in between. */
    merge_clusters (j, i + 1);
    {
      hb_glyph_info_t t = info[i];
      memmove (&info[j + 1], &info[j], (i - j) * sizeof (hb_glyph_info_t));
      info[j] = t;
    }
  }
}
1882

1883 1884 1885 1886 1887

/*
 * Comparing buffers.
 */

B
Behdad Esfahbod 已提交
1888 1889 1890
/**
 * hb_buffer_diff:
 *
B
Behdad Esfahbod 已提交
1891 1892 1893
 * If dottedcircle_glyph is (hb_codepoint_t) -1 then %HB_BUFFER_DIFF_FLAG_DOTTED_CIRCLE_PRESENT
 * and %HB_BUFFER_DIFF_FLAG_NOTDEF_PRESENT are never returned.  This should be used by most
 * callers if just comparing two buffers is needed.
B
Behdad Esfahbod 已提交
1894 1895 1896
 *
 * Since: 1.5.0
 **/
1897 1898 1899 1900 1901 1902
hb_buffer_diff_flags_t
hb_buffer_diff (hb_buffer_t *buffer,
		hb_buffer_t *reference,
		hb_codepoint_t dottedcircle_glyph,
		unsigned int position_fuzz)
{
1903
  if (buffer->content_type != reference->content_type && buffer->len && reference->len)
1904 1905 1906
    return HB_BUFFER_DIFF_FLAG_CONTENT_TYPE_MISMATCH;

  hb_buffer_diff_flags_t result = HB_BUFFER_DIFF_FLAG_EQUAL;
B
Behdad Esfahbod 已提交
1907
  bool contains = dottedcircle_glyph != (hb_codepoint_t) -1;
1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920

  unsigned int count = reference->len;

  if (buffer->len != count)
  {
    /*
     * we can't compare glyph-by-glyph, but we do want to know if there
     * are .notdef or dottedcircle glyphs present in the reference buffer
     */
    const hb_glyph_info_t *info = reference->info;
    unsigned int i;
    for (i = 0; i < count; i++)
    {
B
Behdad Esfahbod 已提交
1921
      if (contains && info[i].codepoint == dottedcircle_glyph)
1922
        result |= HB_BUFFER_DIFF_FLAG_DOTTED_CIRCLE_PRESENT;
B
Behdad Esfahbod 已提交
1923
      if (contains && info[i].codepoint == 0)
1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940
        result |= HB_BUFFER_DIFF_FLAG_NOTDEF_PRESENT;
    }
    result |= HB_BUFFER_DIFF_FLAG_LENGTH_MISMATCH;
    return hb_buffer_diff_flags_t (result);
  }

  if (!count)
    return hb_buffer_diff_flags_t (result);

  const hb_glyph_info_t *buf_info = buffer->info;
  const hb_glyph_info_t *ref_info = reference->info;
  for (unsigned int i = 0; i < count; i++)
  {
    if (buf_info->codepoint != ref_info->codepoint)
      result |= HB_BUFFER_DIFF_FLAG_CODEPOINT_MISMATCH;
    if (buf_info->cluster != ref_info->cluster)
      result |= HB_BUFFER_DIFF_FLAG_CLUSTER_MISMATCH;
1941
    if ((buf_info->mask & ~ref_info->mask & HB_GLYPH_FLAG_DEFINED))
1942
      result |= HB_BUFFER_DIFF_FLAG_GLYPH_FLAGS_MISMATCH;
B
Behdad Esfahbod 已提交
1943
    if (contains && ref_info->codepoint == dottedcircle_glyph)
1944
      result |= HB_BUFFER_DIFF_FLAG_DOTTED_CIRCLE_PRESENT;
B
Behdad Esfahbod 已提交
1945
    if (contains && ref_info->codepoint == 0)
1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957
      result |= HB_BUFFER_DIFF_FLAG_NOTDEF_PRESENT;
    buf_info++;
    ref_info++;
  }

  if (buffer->content_type == HB_BUFFER_CONTENT_TYPE_GLYPHS)
  {
    assert (buffer->have_positions);
    const hb_glyph_position_t *buf_pos = buffer->pos;
    const hb_glyph_position_t *ref_pos = reference->pos;
    for (unsigned int i = 0; i < count; i++)
    {
1958 1959 1960 1961
      if ((unsigned int) abs (buf_pos->x_advance - ref_pos->x_advance) > position_fuzz ||
          (unsigned int) abs (buf_pos->y_advance - ref_pos->y_advance) > position_fuzz ||
          (unsigned int) abs (buf_pos->x_offset - ref_pos->x_offset) > position_fuzz ||
          (unsigned int) abs (buf_pos->y_offset - ref_pos->y_offset) > position_fuzz)
1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974
      {
        result |= HB_BUFFER_DIFF_FLAG_POSITION_MISMATCH;
        break;
      }
      buf_pos++;
      ref_pos++;
    }
  }

  return result;
}


1975 1976 1977 1978 1979 1980
/*
 * Debugging.
 */

/**
 * hb_buffer_set_message_func:
1981
 * @buffer: an #hb_buffer_t.
1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002
 * @func: (closure user_data) (destroy destroy) (scope notified):
 * @user_data:
 * @destroy:
 *
 * 
 *
 * Since: 1.1.3
 **/
void
hb_buffer_set_message_func (hb_buffer_t *buffer,
			    hb_buffer_message_func_t func,
			    void *user_data, hb_destroy_func_t destroy)
{
  if (buffer->message_destroy)
    buffer->message_destroy (buffer->message_data);

  if (func) {
    buffer->message_func = func;
    buffer->message_data = user_data;
    buffer->message_destroy = destroy;
  } else {
B
Behdad Esfahbod 已提交
2003 2004 2005
    buffer->message_func = nullptr;
    buffer->message_data = nullptr;
    buffer->message_destroy = nullptr;
2006 2007 2008 2009 2010 2011 2012 2013 2014 2015
  }
}

bool
hb_buffer_t::message_impl (hb_font_t *font, const char *fmt, va_list ap)
{
  char buf[100];
  vsnprintf (buf, sizeof (buf),  fmt, ap);
  return (bool) this->message_func (this, font, buf, this->message_data);
}