hb-buffer.cc 49.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 31
#include "hb-buffer.hh"
#include "hb-utf.hh"
32

33

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

B
Behdad Esfahbod 已提交
44

S
Sascha Brawer 已提交
45
/**
B
Behdad Esfahbod 已提交
46
 * hb_segment_properties_equal:
K
Khaled Hosny 已提交
47 48 49 50 51
 * @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 已提交
52
 * Return value:
K
Khaled Hosny 已提交
53
 * %true if all properties of @a equal those of @b, false otherwise.
B
Behdad Esfahbod 已提交
54
 *
S
Sascha Brawer 已提交
55 56
 * Since: 0.9.7
 **/
57 58 59 60 61 62 63 64 65 66 67 68
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 已提交
69
/**
B
Behdad Esfahbod 已提交
70
 * hb_segment_properties_hash:
K
Khaled Hosny 已提交
71 72 73 74 75 76
 * @p: #hb_segment_properties_t to hash.
 *
 * Creates a hash representing @p.
 *
 * Return value:
 * A hash of @p.
B
Behdad Esfahbod 已提交
77
 *
S
Sascha Brawer 已提交
78 79
 * Since: 0.9.7
 **/
80 81 82 83 84 85 86 87 88 89
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);
}



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

B
Behdad Esfahbod 已提交
108

109 110 111 112 113

/* Internal API */

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

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

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

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

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

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

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

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

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

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

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

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

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

173
  return true;
174 175
}

176 177 178 179 180 181 182
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]));
183 184 185
  if (idx + count > len)
  {
    /* Under memory failure we might expose this area.  At least
B
Behdad Esfahbod 已提交
186 187 188 189 190
     * clean it up.  Oh well...
     *
     * Ideally, we should at least set Default_Ignorable bits on
     * these, as well as consistent cluster values.  But the former
     * is layering violation... */
191 192
    memset (info + len, 0, (idx + count - len) * sizeof (info[0]));
  }
193 194 195 196 197 198
  len += count;
  idx += count;

  return true;
}

B
Behdad Esfahbod 已提交
199 200
hb_buffer_t::scratch_buffer_t *
hb_buffer_t::get_scratch_buffer (unsigned int *size)
201
{
202 203
  have_output = false;
  have_positions = false;
204

205
  out_len = 0;
206 207
  out_info = info;

208
  assert ((uintptr_t) pos % sizeof (scratch_buffer_t) == 0);
B
Behdad Esfahbod 已提交
209
  *size = allocated * sizeof (pos[0]) / sizeof (scratch_buffer_t);
210
  return (scratch_buffer_t *) (void *) pos;
211 212
}

213

B
Behdad Esfahbod 已提交
214

215 216 217
/* HarfBuzz-Internal API */

void
218
hb_buffer_t::reset ()
219
{
220
  if (unlikely (hb_object_is_immutable (this)))
221 222 223
    return;

  hb_unicode_funcs_destroy (unicode);
224
  unicode = hb_unicode_funcs_reference (hb_unicode_funcs_get_default ());
225
  flags = HB_BUFFER_FLAG_DEFAULT;
226
  replacement = HB_BUFFER_REPLACEMENT_CODEPOINT_DEFAULT;
227
  invisible = 0;
228

B
Behdad Esfahbod 已提交
229 230 231 232
  clear ();
}

void
233
hb_buffer_t::clear ()
B
Behdad Esfahbod 已提交
234
{
235
  if (unlikely (hb_object_is_immutable (this)))
B
Behdad Esfahbod 已提交
236 237
    return;

238
  hb_segment_properties_t default_props = HB_SEGMENT_PROPERTIES_DEFAULT;
239
  props = default_props;
240
  scratch_flags = HB_BUFFER_SCRATCH_FLAG_DEFAULT;
241

242
  content_type = HB_BUFFER_CONTENT_TYPE_INVALID;
B
Behdad Esfahbod 已提交
243
  successful = true;
244 245
  have_output = false;
  have_positions = false;
246

247 248 249
  idx = 0;
  len = 0;
  out_len = 0;
250
  out_info = info;
251

252
  serial = 0;
253 254 255

  memset (context, 0, sizeof context);
  memset (context_len, 0, sizeof context_len);
256 257

  deallocate_var_all ();
258 259
}

260 261 262
void
hb_buffer_t::add (hb_codepoint_t  codepoint,
		  unsigned int    cluster)
263
{
264 265 266 267 268 269 270 271
  hb_glyph_info_t *glyph;

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

  glyph = &info[len];

  memset (glyph, 0, sizeof (*glyph));
  glyph->codepoint = codepoint;
272
  glyph->mask = 0;
273 274 275
  glyph->cluster = cluster;

  len++;
276
}
277

278 279 280 281 282 283 284 285 286 287 288
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 已提交
289
void
290
hb_buffer_t::remove_output ()
B
Behdad Esfahbod 已提交
291
{
292
  if (unlikely (hb_object_is_immutable (this)))
B
Behdad Esfahbod 已提交
293 294 295 296 297 298 299 300 301
    return;

  have_output = false;
  have_positions = false;

  out_len = 0;
  out_info = info;
}

302
void
303
hb_buffer_t::clear_output ()
B
Behdad Esfahbod 已提交
304
{
305
  if (unlikely (hb_object_is_immutable (this)))
306 307
    return;

308 309
  have_output = true;
  have_positions = false;
310

311 312 313 314 315
  out_len = 0;
  out_info = info;
}

void
316
hb_buffer_t::clear_positions ()
317
{
318
  if (unlikely (hb_object_is_immutable (this)))
319 320
    return;

321 322
  have_output = false;
  have_positions = true;
323

324 325 326
  out_len = 0;
  out_info = info;

327 328 329 330
  memset (pos, 0, sizeof (pos[0]) * len);
}

void
331
hb_buffer_t::swap_buffers ()
332
{
B
Behdad Esfahbod 已提交
333
  if (unlikely (!successful)) return;
334 335

  assert (have_output);
336
  have_output = false;
337 338

  if (out_info != info)
339
  {
340 341 342 343 344 345 346 347 348 349 350 351 352 353
    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;
}
354

B
Behdad Esfahbod 已提交
355

B
Behdad Esfahbod 已提交
356 357 358
void
hb_buffer_t::replace_glyphs (unsigned int num_in,
			     unsigned int num_out,
B
Minor  
Behdad Esfahbod 已提交
359
			     const uint32_t *glyph_data)
B
Behdad Esfahbod 已提交
360
{
361
  if (unlikely (!make_room_for (num_in, num_out))) return;
B
Behdad Esfahbod 已提交
362

B
Behdad Esfahbod 已提交
363 364
  assert (idx + num_in <= len);

365
  merge_clusters (idx, idx + num_in);
B
Behdad Esfahbod 已提交
366

367
  hb_glyph_info_t orig_info = info[idx];
B
Behdad Esfahbod 已提交
368 369 370 371 372 373 374 375
  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++;
  }

376
  idx  += num_in;
377
  out_len += num_out;
B
Behdad Esfahbod 已提交
378 379
}

380 381 382 383 384 385 386
bool
hb_buffer_t::move_to (unsigned int i)
{
  if (!have_output)
  {
    assert (i <= len);
    idx = i;
387
    return true;
388
  }
B
Behdad Esfahbod 已提交
389
  if (unlikely (!successful))
390
    return false;
391 392 393 394

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

  if (out_len < i)
395 396
  {
    unsigned int count = i - out_len;
397
    if (unlikely (!make_room_for (count, count))) return false;
398 399 400 401 402 403 404 405 406 407

    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;

408
    /* This will blow in our face if memory allocation fails later
B
Behdad Esfahbod 已提交
409 410 411 412 413 414 415 416
     * in this same lookup...
     *
     * We used to shift with extra 32 items, instead of the 0 below.
     * But that would leave empty slots in the buffer in case of allocation
     * failures.  Setting to zero for now to avoid other problems (see
     * comments in shift_forward().  This can cause O(N^2) behavior more
     * severely than adding 32 empty slots can... */
    if (unlikely (idx < count && !shift_forward (count + 0))) return false;
417 418 419 420 421 422 423

    assert (idx >= count);

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

425 426 427
  return true;
}

B
Behdad Esfahbod 已提交
428

429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459
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;

460
  if (end - start < 2)
461 462 463 464 465 466 467 468 469 470
    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;
  }

471
  if (have_positions) {
472 473 474 475 476 477 478 479 480 481 482
    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
483
hb_buffer_t::reverse ()
484 485 486 487 488 489 490 491
{
  if (unlikely (!len))
    return;

  reverse_range (0, len);
}

void
492
hb_buffer_t::reverse_clusters ()
493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511
{
  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);
512 513
}

514
void
B
Behdad Esfahbod 已提交
515 516
hb_buffer_t::merge_clusters_impl (unsigned int start,
				  unsigned int end)
517
{
518
  if (cluster_level == HB_BUFFER_CLUSTER_LEVEL_CHARACTERS)
519 520
  {
    unsafe_to_break (start, end);
521
    return;
522
  }
B
Behdad Esfahbod 已提交
523

524
  unsigned int cluster = info[start].cluster;
525 526

  for (unsigned int i = start + 1; i < end; i++)
527
    cluster = hb_min (cluster, info[i].cluster);
528 529 530 531 532

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

533 534 535 536 537 538
  /* 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)
539
    for (unsigned int i = out_len; i && out_info[i - 1].cluster == info[start].cluster; i--)
540
      set_cluster (out_info[i - 1], cluster);
541

542
  for (unsigned int i = start; i < end; i++)
543
    set_cluster (info[i], cluster);
544 545 546 547 548
}
void
hb_buffer_t::merge_out_clusters (unsigned int start,
				 unsigned int end)
{
549 550
  if (cluster_level == HB_BUFFER_CLUSTER_LEVEL_CHARACTERS)
    return;
B
Behdad Esfahbod 已提交
551

B
Minor  
Behdad Esfahbod 已提交
552
  if (unlikely (end - start < 2))
553 554
    return;

555
  unsigned int cluster = out_info[start].cluster;
556 557

  for (unsigned int i = start + 1; i < end; i++)
558
    cluster = hb_min (cluster, out_info[i].cluster);
559 560 561 562 563

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

564 565 566 567
  /* Extend end */
  while (end < out_len && out_info[end - 1].cluster == out_info[end].cluster)
    end++;

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

573
  for (unsigned int i = start; i < end; i++)
574
    set_cluster (out_info[i], cluster);
575
}
576
void
577
hb_buffer_t::delete_glyph ()
578
{
579 580
  /* The logic here is duplicated in hb_ot_hide_default_ignorables(). */

581 582 583 584 585 586 587 588 589 590 591 592
  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)
    {
593
      unsigned int mask = info[idx].mask;
594 595
      unsigned int old_cluster = out_info[out_len - 1].cluster;
      for (unsigned i = out_len; i && out_info[i - 1].cluster == old_cluster; i--)
596
	set_cluster (out_info[i - 1], cluster, mask);
597 598 599 600 601 602 603 604 605 606 607 608 609 610
    }
    goto done;
  }

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

done:
  skip_glyph ();
}
611

612 613 614
void
hb_buffer_t::unsafe_to_break_impl (unsigned int start, unsigned int end)
{
615
  unsigned int cluster = (unsigned int) -1;
616 617
  cluster = _unsafe_to_break_find_min_cluster (info, start, end, cluster);
  _unsafe_to_break_set_mask (info, start, end, cluster);
618 619 620 621
}
void
hb_buffer_t::unsafe_to_break_from_outbuffer (unsigned int start, unsigned int end)
{
622 623 624 625 626 627
  if (!have_output)
  {
    unsafe_to_break_impl (start, end);
    return;
  }

628 629 630
  assert (start <= out_len);
  assert (idx <= end);

631
  unsigned int cluster = (unsigned int) -1;
632 633 634 635
  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);
636 637
}

638
void
639
hb_buffer_t::guess_segment_properties ()
640
{
641 642
  assert (content_type == HB_BUFFER_CONTENT_TYPE_UNICODE ||
	  (!len && content_type == HB_BUFFER_CONTENT_TYPE_INVALID));
643

644 645 646
  /* If script is set to INVALID, guess from buffer contents */
  if (props.script == HB_SCRIPT_INVALID) {
    for (unsigned int i = 0; i < len; i++) {
647
      hb_script_t script = unicode->script (info[i].codepoint);
648 649 650 651 652 653 654 655 656 657 658 659
      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);
660 661
    if (props.direction == HB_DIRECTION_INVALID)
      props.direction = HB_DIRECTION_LTR;
662 663 664 665 666 667 668 669 670 671
  }

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


672 673
/* Public API */

674 675 676 677 678 679 680 681
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,
682
  0, /* invisible */
683 684 685 686 687 688 689 690 691 692 693 694 695 696
  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. */
};


697
/**
698
 * hb_buffer_create: (Xconstructor)
699
 *
700
 * Creates a new #hb_buffer_t with all properties to defaults.
701
 *
702 703
 * Return value: (transfer full):
 * A newly allocated #hb_buffer_t with a reference count of 1. The initial
K
Khaled Hosny 已提交
704
 * reference count should be released with hb_buffer_destroy() when you are done
705 706 707
 * 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.
708
 *
B
Behdad Esfahbod 已提交
709
 * Since: 0.9.2
710
 **/
711
hb_buffer_t *
712
hb_buffer_create ()
713
{
714 715
  hb_buffer_t *buffer;

716
  if (!(buffer = hb_object_create<hb_buffer_t> ()))
717
    return hb_buffer_get_empty ();
718

B
Behdad Esfahbod 已提交
719
  buffer->max_len = HB_BUFFER_MAX_LEN_DEFAULT;
720
  buffer->max_ops = HB_BUFFER_MAX_OPS_DEFAULT;
B
Behdad Esfahbod 已提交
721

722
  buffer->reset ();
B
Behdad Esfahbod 已提交
723

724 725
  return buffer;
}
B
Behdad Esfahbod 已提交
726

727 728 729
/**
 * hb_buffer_get_empty:
 *
730
 *
731 732 733
 *
 * Return value: (transfer full):
 *
B
Behdad Esfahbod 已提交
734
 * Since: 0.9.2
735
 **/
736
hb_buffer_t *
737
hb_buffer_get_empty ()
738
{
739
  return const_cast<hb_buffer_t *> (&Null(hb_buffer_t));
740 741
}

742 743
/**
 * hb_buffer_reference: (skip)
744
 * @buffer: an #hb_buffer_t.
745
 *
746 747
 * Increases the reference count on @buffer by one. This prevents @buffer from
 * being destroyed until a matching call to hb_buffer_destroy() is made.
748 749
 *
 * Return value: (transfer full):
750
 * The referenced #hb_buffer_t.
751
 *
B
Behdad Esfahbod 已提交
752
 * Since: 0.9.2
753
 **/
754 755 756
hb_buffer_t *
hb_buffer_reference (hb_buffer_t *buffer)
{
757
  return hb_object_reference (buffer);
758
}
B
Behdad Esfahbod 已提交
759

760 761
/**
 * hb_buffer_destroy: (skip)
762
 * @buffer: an #hb_buffer_t.
763
 *
764 765 766
 * 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().
767
 *
B
Behdad Esfahbod 已提交
768
 * Since: 0.9.2
769
 **/
B
Behdad Esfahbod 已提交
770
void
771
hb_buffer_destroy (hb_buffer_t *buffer)
B
Behdad Esfahbod 已提交
772
{
773
  if (!hb_object_destroy (buffer)) return;
774

B
Behdad Esfahbod 已提交
775 776
  hb_unicode_funcs_destroy (buffer->unicode);

777
  free (buffer->info);
778
  free (buffer->pos);
779 780
  if (buffer->message_destroy)
    buffer->message_destroy (buffer->message_data);
781

782
  free (buffer);
B
Behdad Esfahbod 已提交
783 784
}

785 786
/**
 * hb_buffer_set_user_data: (skip)
787
 * @buffer: an #hb_buffer_t.
788 789 790 791
 * @key:
 * @data:
 * @destroy:
 * @replace:
792 793
 *
 *
794 795
 *
 * Return value:
796
 *
B
Behdad Esfahbod 已提交
797
 * Since: 0.9.2
798
 **/
799 800 801 802
hb_bool_t
hb_buffer_set_user_data (hb_buffer_t        *buffer,
			 hb_user_data_key_t *key,
			 void *              data,
803 804
			 hb_destroy_func_t   destroy,
			 hb_bool_t           replace)
805
{
806
  return hb_object_set_user_data (buffer, key, data, destroy, replace);
807 808
}

809 810
/**
 * hb_buffer_get_user_data: (skip)
811
 * @buffer: an #hb_buffer_t.
812
 * @key:
813 814
 *
 *
815 816
 *
 * Return value:
817
 *
B
Behdad Esfahbod 已提交
818
 * Since: 0.9.2
819
 **/
820 821 822 823 824 825 826
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 已提交
827

828 829
/**
 * hb_buffer_set_content_type:
830
 * @buffer: an #hb_buffer_t.
831
 * @content_type: the type of buffer contents to set
832
 *
833 834
 * Sets the type of @buffer contents, buffers are either empty, contain
 * characters (before shaping) or glyphs (the result of shaping).
835
 *
S
Sascha Brawer 已提交
836
 * Since: 0.9.5
837
 **/
838 839 840 841 842 843 844
void
hb_buffer_set_content_type (hb_buffer_t              *buffer,
			    hb_buffer_content_type_t  content_type)
{
  buffer->content_type = content_type;
}

845 846
/**
 * hb_buffer_get_content_type:
847
 * @buffer: an #hb_buffer_t.
848
 *
849
 * see hb_buffer_set_content_type().
850
 *
851 852
 * Return value:
 * The type of @buffer contents.
853
 *
S
Sascha Brawer 已提交
854
 * Since: 0.9.5
855
 **/
856 857 858 859 860 861 862
hb_buffer_content_type_t
hb_buffer_get_content_type (hb_buffer_t *buffer)
{
  return buffer->content_type;
}


863 864
/**
 * hb_buffer_set_unicode_funcs:
865
 * @buffer: an #hb_buffer_t.
866 867
 * @unicode_funcs:
 *
868 869
 *
 *
B
Behdad Esfahbod 已提交
870
 * Since: 0.9.2
871
 **/
B
Behdad Esfahbod 已提交
872 873
void
hb_buffer_set_unicode_funcs (hb_buffer_t        *buffer,
874
			     hb_unicode_funcs_t *unicode_funcs)
B
Behdad Esfahbod 已提交
875
{
876
  if (unlikely (hb_object_is_immutable (buffer)))
B
Behdad Esfahbod 已提交
877 878
    return;

879 880
  if (!unicode_funcs)
    unicode_funcs = hb_unicode_funcs_get_default ();
881

882
  hb_unicode_funcs_reference (unicode_funcs);
B
Behdad Esfahbod 已提交
883
  hb_unicode_funcs_destroy (buffer->unicode);
884
  buffer->unicode = unicode_funcs;
B
Behdad Esfahbod 已提交
885 886
}

887 888
/**
 * hb_buffer_get_unicode_funcs:
889
 * @buffer: an #hb_buffer_t.
890 891
 *
 *
892 893
 *
 * Return value:
894
 *
B
Behdad Esfahbod 已提交
895
 * Since: 0.9.2
896
 **/
B
Behdad Esfahbod 已提交
897 898 899 900 901 902
hb_unicode_funcs_t *
hb_buffer_get_unicode_funcs (hb_buffer_t        *buffer)
{
  return buffer->unicode;
}

903 904
/**
 * hb_buffer_set_direction:
905
 * @buffer: an #hb_buffer_t.
906
 * @direction: the #hb_direction_t of the @buffer
907
 *
908 909 910 911 912 913 914
 * 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.
915
 *
B
Behdad Esfahbod 已提交
916
 * Since: 0.9.2
917
 **/
B
Behdad Esfahbod 已提交
918 919 920 921 922
void
hb_buffer_set_direction (hb_buffer_t    *buffer,
			 hb_direction_t  direction)

{
923
  if (unlikely (hb_object_is_immutable (buffer)))
B
Behdad Esfahbod 已提交
924 925
    return;

926
  buffer->props.direction = direction;
B
Behdad Esfahbod 已提交
927 928
}

929 930
/**
 * hb_buffer_get_direction:
931
 * @buffer: an #hb_buffer_t.
932
 *
933
 * See hb_buffer_set_direction()
934
 *
935 936
 * Return value:
 * The direction of the @buffer.
937
 *
B
Behdad Esfahbod 已提交
938
 * Since: 0.9.2
939
 **/
B
Behdad Esfahbod 已提交
940 941 942
hb_direction_t
hb_buffer_get_direction (hb_buffer_t    *buffer)
{
943
  return buffer->props.direction;
B
Behdad Esfahbod 已提交
944 945
}

946 947
/**
 * hb_buffer_set_script:
948
 * @buffer: an #hb_buffer_t.
949
 * @script: an #hb_script_t to set.
950
 *
951 952 953 954 955 956 957 958 959
 * 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.
960
 *
B
Behdad Esfahbod 已提交
961
 * Since: 0.9.2
962
 **/
963 964 965 966
void
hb_buffer_set_script (hb_buffer_t *buffer,
		      hb_script_t  script)
{
967
  if (unlikely (hb_object_is_immutable (buffer)))
B
Behdad Esfahbod 已提交
968 969
    return;

970
  buffer->props.script = script;
971 972
}

973 974
/**
 * hb_buffer_get_script:
975
 * @buffer: an #hb_buffer_t.
976
 *
977
 * See hb_buffer_set_script().
978
 *
979 980
 * Return value:
 * The #hb_script_t of the @buffer.
981
 *
B
Behdad Esfahbod 已提交
982
 * Since: 0.9.2
983
 **/
984 985 986
hb_script_t
hb_buffer_get_script (hb_buffer_t *buffer)
{
987
  return buffer->props.script;
988 989
}

990 991
/**
 * hb_buffer_set_language:
992
 * @buffer: an #hb_buffer_t.
993
 * @language: an hb_language_t to set.
994
 *
995 996 997 998 999 1000 1001
 * 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.
 *
D
David Corbett 已提交
1002
 * Use hb_language_from_string() to convert from BCP 47 language tags to
1003
 * #hb_language_t.
1004
 *
B
Behdad Esfahbod 已提交
1005
 * Since: 0.9.2
1006
 **/
1007 1008 1009 1010
void
hb_buffer_set_language (hb_buffer_t   *buffer,
			hb_language_t  language)
{
1011
  if (unlikely (hb_object_is_immutable (buffer)))
B
Behdad Esfahbod 已提交
1012 1013
    return;

1014
  buffer->props.language = language;
1015 1016
}

1017 1018
/**
 * hb_buffer_get_language:
1019
 * @buffer: an #hb_buffer_t.
1020
 *
1021
 * See hb_buffer_set_language().
1022
 *
1023
 * Return value: (transfer none):
1024
 * The #hb_language_t of the buffer. Must not be freed by the caller.
1025
 *
B
Behdad Esfahbod 已提交
1026
 * Since: 0.9.2
1027
 **/
1028 1029 1030
hb_language_t
hb_buffer_get_language (hb_buffer_t *buffer)
{
1031
  return buffer->props.language;
1032 1033
}

1034 1035
/**
 * hb_buffer_set_segment_properties:
1036
 * @buffer: an #hb_buffer_t.
K
Khaled Hosny 已提交
1037
 * @props: an #hb_segment_properties_t to use.
1038
 *
K
Khaled Hosny 已提交
1039 1040 1041
 * 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.
1042
 *
S
Sascha Brawer 已提交
1043
 * Since: 0.9.7
1044
 **/
1045 1046 1047 1048
void
hb_buffer_set_segment_properties (hb_buffer_t *buffer,
				  const hb_segment_properties_t *props)
{
1049
  if (unlikely (hb_object_is_immutable (buffer)))
1050 1051 1052 1053 1054
    return;

  buffer->props = *props;
}

1055 1056
/**
 * hb_buffer_get_segment_properties:
1057
 * @buffer: an #hb_buffer_t.
K
Khaled Hosny 已提交
1058
 * @props: (out): the output #hb_segment_properties_t.
1059
 *
K
Khaled Hosny 已提交
1060
 * Sets @props to the #hb_segment_properties_t of @buffer.
1061
 *
S
Sascha Brawer 已提交
1062
 * Since: 0.9.7
1063
 **/
1064 1065 1066 1067 1068 1069 1070 1071
void
hb_buffer_get_segment_properties (hb_buffer_t *buffer,
				  hb_segment_properties_t *props)
{
  *props = buffer->props;
}


1072 1073
/**
 * hb_buffer_set_flags:
1074
 * @buffer: an #hb_buffer_t.
1075
 * @flags: the buffer flags to set.
1076
 *
1077
 * Sets @buffer flags to @flags. See #hb_buffer_flags_t.
1078
 *
S
Sascha Brawer 已提交
1079
 * Since: 0.9.7
1080
 **/
B
Behdad Esfahbod 已提交
1081 1082 1083 1084
void
hb_buffer_set_flags (hb_buffer_t       *buffer,
		     hb_buffer_flags_t  flags)
{
1085
  if (unlikely (hb_object_is_immutable (buffer)))
B
Behdad Esfahbod 已提交
1086 1087 1088 1089 1090
    return;

  buffer->flags = flags;
}

1091 1092
/**
 * hb_buffer_get_flags:
1093
 * @buffer: an #hb_buffer_t.
1094
 *
1095
 * See hb_buffer_set_flags().
1096
 *
1097
 * Return value:
1098
 * The @buffer flags.
1099
 *
S
Sascha Brawer 已提交
1100
 * Since: 0.9.7
1101
 **/
B
Behdad Esfahbod 已提交
1102 1103 1104 1105 1106 1107
hb_buffer_flags_t
hb_buffer_get_flags (hb_buffer_t *buffer)
{
  return buffer->flags;
}

1108 1109
/**
 * hb_buffer_set_cluster_level:
1110
 * @buffer: an #hb_buffer_t.
1111 1112
 * @cluster_level:
 *
1113 1114 1115 1116 1117 1118 1119 1120
 *
 *
 * Since: 0.9.42
 **/
void
hb_buffer_set_cluster_level (hb_buffer_t       *buffer,
		     hb_buffer_cluster_level_t  cluster_level)
{
1121
  if (unlikely (hb_object_is_immutable (buffer)))
1122 1123 1124 1125 1126 1127 1128
    return;

  buffer->cluster_level = cluster_level;
}

/**
 * hb_buffer_get_cluster_level:
1129
 * @buffer: an #hb_buffer_t.
1130 1131
 *
 *
1132 1133
 *
 * Return value:
1134 1135 1136 1137 1138 1139 1140 1141 1142
 *
 * 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 已提交
1143

1144 1145
/**
 * hb_buffer_set_replacement_codepoint:
1146
 * @buffer: an #hb_buffer_t.
K
Khaled Hosny 已提交
1147
 * @replacement: the replacement #hb_codepoint_t
1148
 *
K
Khaled Hosny 已提交
1149 1150 1151 1152
 * 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.
1153
 *
S
Sascha Brawer 已提交
1154
 * Since: 0.9.31
1155 1156 1157 1158 1159
 **/
void
hb_buffer_set_replacement_codepoint (hb_buffer_t    *buffer,
				     hb_codepoint_t  replacement)
{
1160
  if (unlikely (hb_object_is_immutable (buffer)))
1161 1162 1163 1164 1165 1166 1167
    return;

  buffer->replacement = replacement;
}

/**
 * hb_buffer_get_replacement_codepoint:
1168
 * @buffer: an #hb_buffer_t.
1169
 *
K
Khaled Hosny 已提交
1170
 * See hb_buffer_set_replacement_codepoint().
1171
 *
1172
 * Return value:
K
Khaled Hosny 已提交
1173
 * The @buffer replacement #hb_codepoint_t.
1174
 *
S
Sascha Brawer 已提交
1175
 * Since: 0.9.31
1176 1177 1178 1179 1180 1181 1182 1183
 **/
hb_codepoint_t
hb_buffer_get_replacement_codepoint (hb_buffer_t    *buffer)
{
  return buffer->replacement;
}


1184
/**
1185
 * hb_buffer_set_invisible_glyph:
1186 1187 1188 1189 1190 1191 1192 1193
 * @buffer: an #hb_buffer_t.
 * @invisible: the invisible #hb_codepoint_t
 *
 * Sets the #hb_codepoint_t that replaces invisible characters in
 * the shaping result.  If set to zero (default), the glyph for the
 * U+0020 SPACE character is used.  Otherwise, this value is used
 * verbatim.
 *
B
2.0.0  
Behdad Esfahbod 已提交
1194
 * Since: 2.0.0
1195 1196
 **/
void
1197 1198
hb_buffer_set_invisible_glyph (hb_buffer_t    *buffer,
			       hb_codepoint_t  invisible)
1199
{
1200
  if (unlikely (hb_object_is_immutable (buffer)))
1201 1202 1203 1204 1205 1206
    return;

  buffer->invisible = invisible;
}

/**
1207
 * hb_buffer_get_invisible_glyph:
1208 1209
 * @buffer: an #hb_buffer_t.
 *
1210
 * See hb_buffer_set_invisible_glyph().
1211
 *
1212
 * Return value:
1213 1214
 * The @buffer invisible #hb_codepoint_t.
 *
B
2.0.0  
Behdad Esfahbod 已提交
1215
 * Since: 2.0.0
1216 1217
 **/
hb_codepoint_t
1218
hb_buffer_get_invisible_glyph (hb_buffer_t    *buffer)
1219 1220 1221 1222 1223
{
  return buffer->invisible;
}


1224 1225
/**
 * hb_buffer_reset:
1226
 * @buffer: an #hb_buffer_t.
1227
 *
K
Khaled Hosny 已提交
1228 1229
 * Resets the buffer to its initial status, as if it was just newly created
 * with hb_buffer_create().
1230
 *
B
Behdad Esfahbod 已提交
1231
 * Since: 0.9.2
1232
 **/
1233 1234
void
hb_buffer_reset (hb_buffer_t *buffer)
B
Behdad Esfahbod 已提交
1235
{
1236
  buffer->reset ();
B
Behdad Esfahbod 已提交
1237 1238
}

1239 1240
/**
 * hb_buffer_clear_contents:
1241
 * @buffer: an #hb_buffer_t.
1242
 *
K
Khaled Hosny 已提交
1243 1244
 * Similar to hb_buffer_reset(), but does not clear the Unicode functions and
 * the replacement code point.
1245
 *
S
Sascha Brawer 已提交
1246
 * Since: 0.9.11
1247
 **/
B
Behdad Esfahbod 已提交
1248
void
1249
hb_buffer_clear_contents (hb_buffer_t *buffer)
B
Behdad Esfahbod 已提交
1250 1251 1252 1253
{
  buffer->clear ();
}

1254 1255
/**
 * hb_buffer_pre_allocate:
1256
 * @buffer: an #hb_buffer_t.
1257
 * @size: number of items to pre allocate.
1258
 *
1259
 * Pre allocates memory for @buffer to fit at least @size number of items.
1260
 *
1261
 * Return value:
K
Khaled Hosny 已提交
1262
 * %true if @buffer memory allocation succeeded, %false otherwise.
1263
 *
B
Behdad Esfahbod 已提交
1264
 * Since: 0.9.2
1265
 **/
1266
hb_bool_t
1267
hb_buffer_pre_allocate (hb_buffer_t *buffer, unsigned int size)
B
Behdad Esfahbod 已提交
1268
{
1269
  return buffer->ensure (size);
B
Behdad Esfahbod 已提交
1270 1271
}

1272 1273
/**
 * hb_buffer_allocation_successful:
1274
 * @buffer: an #hb_buffer_t.
1275
 *
1276
 * Check if allocating memory for the buffer succeeded.
1277
 *
1278
 * Return value:
K
Khaled Hosny 已提交
1279
 * %true if @buffer memory allocation succeeded, %false otherwise.
1280
 *
B
Behdad Esfahbod 已提交
1281
 * Since: 0.9.2
1282
 **/
1283 1284 1285
hb_bool_t
hb_buffer_allocation_successful (hb_buffer_t  *buffer)
{
B
Behdad Esfahbod 已提交
1286
  return buffer->successful;
1287 1288
}

1289 1290
/**
 * hb_buffer_add:
1291 1292 1293
 * @buffer: an #hb_buffer_t.
 * @codepoint: a Unicode code point.
 * @cluster: the cluster value of @codepoint.
1294
 *
1295 1296 1297 1298 1299
 * 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.
1300
 *
K
Khaled Hosny 已提交
1301 1302 1303
 * 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 已提交
1304
 * Since: 0.9.7
1305
 **/
1306
void
1307 1308 1309
hb_buffer_add (hb_buffer_t    *buffer,
	       hb_codepoint_t  codepoint,
	       unsigned int    cluster)
1310
{
1311
  buffer->add (codepoint, cluster);
1312
  buffer->clear_context (1);
1313 1314
}

1315 1316
/**
 * hb_buffer_set_length:
1317
 * @buffer: an #hb_buffer_t.
K
Khaled Hosny 已提交
1318
 * @length: the new length of @buffer.
1319
 *
K
Khaled Hosny 已提交
1320 1321
 * Similar to hb_buffer_pre_allocate(), but clears any new items added at the
 * end.
1322
 *
1323
 * Return value:
K
Khaled Hosny 已提交
1324
 * %true if @buffer memory allocation succeeded, %false otherwise.
1325
 *
B
Behdad Esfahbod 已提交
1326
 * Since: 0.9.2
1327
 **/
1328 1329 1330 1331
hb_bool_t
hb_buffer_set_length (hb_buffer_t  *buffer,
		      unsigned int  length)
{
1332
  if (unlikely (hb_object_is_immutable (buffer)))
1333 1334
    return length == 0;

1335
  if (!buffer->ensure (length))
1336
    return false;
1337 1338 1339 1340 1341 1342 1343 1344 1345

  /* 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;
1346 1347

  if (!length)
1348 1349
  {
    buffer->content_type = HB_BUFFER_CONTENT_TYPE_INVALID;
1350
    buffer->clear_context (0);
1351
  }
1352 1353
  buffer->clear_context (1);

1354
  return true;
1355 1356
}

B
Behdad Esfahbod 已提交
1357 1358
/**
 * hb_buffer_get_length:
1359
 * @buffer: an #hb_buffer_t.
B
Behdad Esfahbod 已提交
1360 1361 1362
 *
 * Returns the number of items in the buffer.
 *
1363 1364
 * Return value:
 * The @buffer length.
K
Khaled Hosny 已提交
1365
 * The value valid as long as buffer has not been modified.
B
Behdad Esfahbod 已提交
1366
 *
B
Behdad Esfahbod 已提交
1367
 * Since: 0.9.2
B
Behdad Esfahbod 已提交
1368
 **/
1369
unsigned int
1370
hb_buffer_get_length (hb_buffer_t *buffer)
1371
{
1372
  return buffer->len;
1373 1374
}

B
Behdad Esfahbod 已提交
1375 1376
/**
 * hb_buffer_get_glyph_infos:
1377
 * @buffer: an #hb_buffer_t.
B
Behdad Esfahbod 已提交
1378 1379
 * @length: (out): output array length.
 *
1380 1381
 * Returns @buffer glyph information array.  Returned pointer
 * is valid as long as @buffer contents are not modified.
B
Behdad Esfahbod 已提交
1382
 *
1383 1384
 * Return value: (transfer none) (array length=length):
 * The @buffer glyph information array.
K
Khaled Hosny 已提交
1385
 * The value valid as long as buffer has not been modified.
B
Behdad Esfahbod 已提交
1386
 *
B
Behdad Esfahbod 已提交
1387
 * Since: 0.9.2
B
Behdad Esfahbod 已提交
1388
 **/
1389
hb_glyph_info_t *
1390 1391
hb_buffer_get_glyph_infos (hb_buffer_t  *buffer,
                           unsigned int *length)
1392
{
1393 1394 1395
  if (length)
    *length = buffer->len;

1396
  return (hb_glyph_info_t *) buffer->info;
1397 1398
}

B
Behdad Esfahbod 已提交
1399 1400
/**
 * hb_buffer_get_glyph_positions:
1401
 * @buffer: an #hb_buffer_t.
B
Behdad Esfahbod 已提交
1402 1403
 * @length: (out): output length.
 *
1404 1405
 * Returns @buffer glyph position array.  Returned pointer
 * is valid as long as @buffer contents are not modified.
B
Behdad Esfahbod 已提交
1406
 *
1407 1408
 * Return value: (transfer none) (array length=length):
 * The @buffer glyph position array.
K
Khaled Hosny 已提交
1409
 * The value valid as long as buffer has not been modified.
B
Behdad Esfahbod 已提交
1410
 *
B
Behdad Esfahbod 已提交
1411
 * Since: 0.9.2
B
Behdad Esfahbod 已提交
1412
 **/
1413
hb_glyph_position_t *
1414 1415
hb_buffer_get_glyph_positions (hb_buffer_t  *buffer,
                               unsigned int *length)
1416
{
1417
  if (!buffer->have_positions)
1418
    buffer->clear_positions ();
1419

1420 1421 1422
  if (length)
    *length = buffer->len;

1423
  return (hb_glyph_position_t *) buffer->pos;
1424
}
B
Behdad Esfahbod 已提交
1425

1426 1427
/**
 * hb_glyph_info_get_glyph_flags:
B
Behdad Esfahbod 已提交
1428
 * @info: a #hb_glyph_info_t.
1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442
 *
 * 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 已提交
1443 1444
/**
 * hb_buffer_reverse:
1445
 * @buffer: an #hb_buffer_t.
B
Behdad Esfahbod 已提交
1446 1447 1448
 *
 * Reverses buffer contents.
 *
B
Behdad Esfahbod 已提交
1449
 * Since: 0.9.2
B
Behdad Esfahbod 已提交
1450
 **/
1451 1452 1453
void
hb_buffer_reverse (hb_buffer_t *buffer)
{
1454
  buffer->reverse ();
1455 1456
}

1457 1458
/**
 * hb_buffer_reverse_range:
1459
 * @buffer: an #hb_buffer_t.
1460 1461 1462
 * @start: start index.
 * @end: end index.
 *
B
Behdad Esfahbod 已提交
1463
 * Reverses buffer contents between start to end.
1464
 *
B
Behdad Esfahbod 已提交
1465
 * Since: 0.9.41
1466 1467 1468 1469 1470 1471 1472 1473
 **/
void
hb_buffer_reverse_range (hb_buffer_t *buffer,
			 unsigned int start, unsigned int end)
{
  buffer->reverse_range (start, end);
}

B
Behdad Esfahbod 已提交
1474 1475
/**
 * hb_buffer_reverse_clusters:
1476
 * @buffer: an #hb_buffer_t.
B
Behdad Esfahbod 已提交
1477 1478 1479 1480 1481
 *
 * 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 已提交
1482
 * Since: 0.9.2
B
Behdad Esfahbod 已提交
1483
 **/
1484 1485 1486
void
hb_buffer_reverse_clusters (hb_buffer_t *buffer)
{
1487
  buffer->reverse_clusters ();
1488 1489
}

B
Behdad Esfahbod 已提交
1490 1491
/**
 * hb_buffer_guess_segment_properties:
1492
 * @buffer: an #hb_buffer_t.
B
Behdad Esfahbod 已提交
1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505
 *
 * 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().
1506 1507
 * If hb_script_get_horizontal_direction() returns %HB_DIRECTION_INVALID,
 * then %HB_DIRECTION_LTR is used.
B
Behdad Esfahbod 已提交
1508 1509 1510 1511 1512
 *
 * 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.
1513 1514
 * Note that hb_language_get_default() is NOT threadsafe the first time
 * it is called.  See documentation for that function for details.
B
Behdad Esfahbod 已提交
1515
 *
S
Sascha Brawer 已提交
1516
 * Since: 0.9.7
B
Behdad Esfahbod 已提交
1517
 **/
1518
void
1519
hb_buffer_guess_segment_properties (hb_buffer_t *buffer)
1520
{
1521
  buffer->guess_segment_properties ();
1522 1523
}

1524
template <typename utf_t>
1525 1526
static inline void
hb_buffer_add_utf (hb_buffer_t  *buffer,
1527
		   const typename utf_t::codepoint_t *text,
1528 1529 1530 1531
		   int           text_length,
		   unsigned int  item_offset,
		   int           item_length)
{
1532
  typedef typename utf_t::codepoint_t T;
1533
  const hb_codepoint_t replacement = buffer->replacement;
1534

1535 1536 1537
  assert (buffer->content_type == HB_BUFFER_CONTENT_TYPE_UNICODE ||
	  (!buffer->len && buffer->content_type == HB_BUFFER_CONTENT_TYPE_INVALID));

1538
  if (unlikely (hb_object_is_immutable (buffer)))
1539 1540
    return;

B
Behdad Esfahbod 已提交
1541
  if (text_length == -1)
1542
    text_length = utf_t::strlen (text);
1543 1544 1545 1546 1547 1548

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

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

1549 1550 1551 1552 1553 1554 1555 1556
  /* 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)
1557 1558 1559 1560 1561 1562 1563 1564
  {
    /* 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;
1565
      prev = utf_t::prev (prev, start, &u, replacement);
1566 1567 1568 1569 1570
      buffer->context[0][buffer->context_len[0]++] = u;
    }
  }

  const T *next = text + item_offset;
1571
  const T *end = next + item_length;
1572 1573
  while (next < end)
  {
1574 1575
    hb_codepoint_t u;
    const T *old_next = next;
1576
    next = utf_t::next (next, end, &u, replacement);
1577
    buffer->add (u, old_next - (const T *) text);
1578 1579 1580 1581 1582 1583 1584 1585
  }

  /* 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;
1586
    next = utf_t::next (next, end, &u, replacement);
1587
    buffer->context[1][buffer->context_len[1]++] = u;
1588 1589 1590
  }

  buffer->content_type = HB_BUFFER_CONTENT_TYPE_UNICODE;
1591 1592
}

1593 1594
/**
 * hb_buffer_add_utf8:
1595
 * @buffer: an #hb_buffer_t.
K
Khaled Hosny 已提交
1596 1597
 * @text: (array length=text_length) (element-type uint8_t): an array of UTF-8
 *               characters to append.
1598 1599 1600 1601
 * @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).
1602
 *
1603
 * See hb_buffer_add_codepoints().
1604
 *
K
Khaled Hosny 已提交
1605 1606 1607
 * Replaces invalid UTF-8 characters with the @buffer replacement code point,
 * see hb_buffer_set_replacement_codepoint().
 *
B
Behdad Esfahbod 已提交
1608
 * Since: 0.9.2
1609
 **/
1610 1611 1612
void
hb_buffer_add_utf8 (hb_buffer_t  *buffer,
		    const char   *text,
1613
		    int           text_length,
1614
		    unsigned int  item_offset,
1615
		    int           item_length)
1616
{
1617
  hb_buffer_add_utf<hb_utf8_t> (buffer, (const uint8_t *) text, text_length, item_offset, item_length);
1618 1619
}

1620 1621
/**
 * hb_buffer_add_utf16:
1622 1623 1624 1625 1626 1627
 * @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).
1628
 *
1629
 * See hb_buffer_add_codepoints().
1630
 *
K
Khaled Hosny 已提交
1631 1632 1633
 * Replaces invalid UTF-16 characters with the @buffer replacement code point,
 * see hb_buffer_set_replacement_codepoint().
 *
B
Behdad Esfahbod 已提交
1634
 * Since: 0.9.2
1635
 **/
1636 1637 1638
void
hb_buffer_add_utf16 (hb_buffer_t    *buffer,
		     const uint16_t *text,
1639
		     int             text_length,
1640
		     unsigned int    item_offset,
1641
		     int             item_length)
1642
{
1643
  hb_buffer_add_utf<hb_utf16_t> (buffer, text, text_length, item_offset, item_length);
1644 1645
}

1646 1647
/**
 * hb_buffer_add_utf32:
1648 1649 1650 1651 1652 1653
 * @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).
1654
 *
1655
 * See hb_buffer_add_codepoints().
1656
 *
K
Khaled Hosny 已提交
1657 1658 1659
 * Replaces invalid UTF-32 characters with the @buffer replacement code point,
 * see hb_buffer_set_replacement_codepoint().
 *
B
Behdad Esfahbod 已提交
1660
 * Since: 0.9.2
1661
 **/
1662 1663 1664
void
hb_buffer_add_utf32 (hb_buffer_t    *buffer,
		     const uint32_t *text,
1665
		     int             text_length,
1666
		     unsigned int    item_offset,
1667
		     int             item_length)
1668
{
B
Behdad Esfahbod 已提交
1669
  hb_buffer_add_utf<hb_utf32_t> (buffer, text, text_length, item_offset, item_length);
1670 1671 1672 1673
}

/**
 * hb_buffer_add_latin1:
1674
 * @buffer: an #hb_buffer_t.
K
Khaled Hosny 已提交
1675 1676 1677 1678 1679 1680
 * @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).
1681
 *
K
Khaled Hosny 已提交
1682 1683 1684 1685
 * 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>
1686
 *
S
Sascha Brawer 已提交
1687
 * Since: 0.9.39
1688 1689 1690 1691 1692 1693 1694 1695 1696
 **/
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);
1697 1698 1699 1700
}

/**
 * hb_buffer_add_codepoints:
1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716
 * @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.
1717
 *
K
Khaled Hosny 已提交
1718 1719 1720
 * 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 已提交
1721
 * Since: 0.9.31
1722 1723 1724 1725 1726 1727 1728 1729
 **/
void
hb_buffer_add_codepoints (hb_buffer_t          *buffer,
			  const hb_codepoint_t *text,
			  int                   text_length,
			  unsigned int          item_offset,
			  int                   item_length)
{
B
Behdad Esfahbod 已提交
1730
  hb_buffer_add_utf<hb_utf32_novalidate_t> (buffer, text, text_length, item_offset, item_length);
1731
}
B
Behdad Esfahbod 已提交
1732 1733


B
Behdad Esfahbod 已提交
1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751
/**
 * 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);
1752 1753
  assert (buffer->have_positions == source->have_positions ||
	  !buffer->len || !source->len);
B
Behdad Esfahbod 已提交
1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765
  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;
1766 1767
  if (!buffer->have_positions && source->have_positions)
    buffer->clear_positions ();
B
Behdad Esfahbod 已提交
1768

B
Behdad Esfahbod 已提交
1769
  if (buffer->len + (end - start) < buffer->len) /* Overflows. */
B
Behdad Esfahbod 已提交
1770
  {
B
Behdad Esfahbod 已提交
1771
    buffer->successful = false;
B
Behdad Esfahbod 已提交
1772 1773 1774 1775 1776
    return;
  }

  unsigned int orig_len = buffer->len;
  hb_buffer_set_length (buffer, buffer->len + (end - start));
B
Behdad Esfahbod 已提交
1777
  if (unlikely (!buffer->successful))
B
Behdad Esfahbod 已提交
1778 1779 1780 1781 1782 1783 1784 1785
    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]));
}


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 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827
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;

1828
    hb_stable_sort (buffer->info + start, end - start - 1, compare_info_codepoint, buffer->pos + start);
1829 1830 1831 1832 1833 1834 1835 1836
  } 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;
    }
1837
    hb_stable_sort (buffer->info + start + 1, end - start - 1, compare_info_codepoint, buffer->pos + start + 1);
1838 1839 1840
  }
}

1841 1842
/**
 * hb_buffer_normalize_glyphs:
1843
 * @buffer: an #hb_buffer_t.
1844
 *
K
Khaled Hosny 已提交
1845 1846 1847 1848
 * 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>
1849
 *
S
Sascha Brawer 已提交
1850
 * Since: 0.9.2
1851
 **/
1852 1853 1854 1855
void
hb_buffer_normalize_glyphs (hb_buffer_t *buffer)
{
  assert (buffer->have_positions);
B
Behdad Esfahbod 已提交
1856 1857
  assert (buffer->content_type == HB_BUFFER_CONTENT_TYPE_GLYPHS ||
	  (!buffer->len && buffer->content_type == HB_BUFFER_CONTENT_TYPE_INVALID));
1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873

  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);
}
1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894

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;
    }
  }
}
1895

1896 1897 1898 1899 1900

/*
 * Comparing buffers.
 */

B
Behdad Esfahbod 已提交
1901 1902
/**
 * hb_buffer_diff:
B
Behdad Esfahbod 已提交
1903 1904 1905 1906
 * @buffer: a buffer.
 * @reference: other buffer to compare to.
 * @dottedcircle_glyph: glyph id of U+25CC DOTTED CIRCLE, or (hb_codepont_t) -1.
 * @position_fuzz: allowed absolute difference in position values.
B
Behdad Esfahbod 已提交
1907
 *
B
Behdad Esfahbod 已提交
1908 1909 1910
 * 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 已提交
1911 1912 1913
 *
 * Since: 1.5.0
 **/
1914 1915 1916 1917 1918 1919
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)
{
1920
  if (buffer->content_type != reference->content_type && buffer->len && reference->len)
1921 1922 1923
    return HB_BUFFER_DIFF_FLAG_CONTENT_TYPE_MISMATCH;

  hb_buffer_diff_flags_t result = HB_BUFFER_DIFF_FLAG_EQUAL;
B
Behdad Esfahbod 已提交
1924
  bool contains = dottedcircle_glyph != (hb_codepoint_t) -1;
1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937

  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 已提交
1938
      if (contains && info[i].codepoint == dottedcircle_glyph)
1939
        result |= HB_BUFFER_DIFF_FLAG_DOTTED_CIRCLE_PRESENT;
B
Behdad Esfahbod 已提交
1940
      if (contains && info[i].codepoint == 0)
1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957
        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;
1958
    if ((buf_info->mask & ~ref_info->mask & HB_GLYPH_FLAG_DEFINED))
1959
      result |= HB_BUFFER_DIFF_FLAG_GLYPH_FLAGS_MISMATCH;
B
Behdad Esfahbod 已提交
1960
    if (contains && ref_info->codepoint == dottedcircle_glyph)
1961
      result |= HB_BUFFER_DIFF_FLAG_DOTTED_CIRCLE_PRESENT;
B
Behdad Esfahbod 已提交
1962
    if (contains && ref_info->codepoint == 0)
1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974
      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++)
    {
1975 1976 1977 1978
      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)
1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991
      {
        result |= HB_BUFFER_DIFF_FLAG_POSITION_MISMATCH;
        break;
      }
      buf_pos++;
      ref_pos++;
    }
  }

  return result;
}


1992 1993 1994 1995
/*
 * Debugging.
 */

1996
#ifndef HB_NO_BUFFER_MESSAGE
1997 1998
/**
 * hb_buffer_set_message_func:
1999
 * @buffer: an #hb_buffer_t.
2000 2001 2002 2003
 * @func: (closure user_data) (destroy destroy) (scope notified):
 * @user_data:
 * @destroy:
 *
2004
 *
2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020
 *
 * 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 已提交
2021 2022 2023
    buffer->message_func = nullptr;
    buffer->message_data = nullptr;
    buffer->message_destroy = nullptr;
2024 2025 2026 2027 2028 2029
  }
}
bool
hb_buffer_t::message_impl (hb_font_t *font, const char *fmt, va_list ap)
{
  char buf[100];
2030
  vsnprintf (buf, sizeof (buf), fmt, ap);
2031 2032
  return (bool) this->message_func (this, font, buf, this->message_data);
}
2033
#endif