hb-buffer.cc 47.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

B
Behdad Esfahbod 已提交
34 35 36 37
#ifndef HB_DEBUG_BUFFER
#define HB_DEBUG_BUFFER (HB_DEBUG+0)
#endif

38 39 40 41 42 43 44 45 46
/**
 * 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.
 **/
47

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



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

B
Behdad Esfahbod 已提交
111

112 113 114 115 116

/* Internal API */

bool
hb_buffer_t::enlarge (unsigned int size)
117
{
118
  if (unlikely (in_error))
119
    return false;
B
Behdad Esfahbod 已提交
120 121 122 123 124
  if (unlikely (size > max_len))
  {
    in_error = true;
    return false;
  }
125

126
  unsigned int new_allocated = allocated;
B
Behdad Esfahbod 已提交
127 128
  hb_glyph_position_t *new_pos = NULL;
  hb_glyph_info_t *new_info = NULL;
129
  bool separate_out = out_info != info;
130

131
  if (unlikely (_hb_unsigned_int_mul_overflows (size, sizeof (info[0]))))
B
Behdad Esfahbod 已提交
132
    goto done;
133

134
  while (size >= new_allocated)
135
    new_allocated += (new_allocated >> 1) + 32;
136

137 138
  ASSERT_STATIC (sizeof (info[0]) == sizeof (pos[0]));
  if (unlikely (_hb_unsigned_int_mul_overflows (new_allocated, sizeof (info[0]))))
B
Behdad Esfahbod 已提交
139 140
    goto done;

141 142
  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]));
143

B
Behdad Esfahbod 已提交
144
done:
145
  if (unlikely (!new_pos || !new_info))
146
    in_error = true;
147 148

  if (likely (new_pos))
149
    pos = new_pos;
150 151

  if (likely (new_info))
152 153 154 155 156 157 158 159 160 161 162 163 164
    info = new_info;

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

  return likely (!in_error);
}

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

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

176
  return true;
177 178
}

179 180 181 182 183 184 185
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]));
186 187 188 189 190 191
  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]));
  }
192 193 194 195 196 197
  len += count;
  idx += count;

  return true;
}

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

204
  out_len = 0;
205 206
  out_info = info;

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

212

B
Behdad Esfahbod 已提交
213

214 215 216 217 218 219 220 221 222
/* HarfBuzz-Internal API */

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

  hb_unicode_funcs_destroy (unicode);
223
  unicode = hb_unicode_funcs_get_default ();
224
  flags = HB_BUFFER_FLAG_DEFAULT;
225
  replacement = HB_BUFFER_REPLACEMENT_CODEPOINT_DEFAULT;
226

B
Behdad Esfahbod 已提交
227 228 229 230 231 232 233 234 235
  clear ();
}

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

236
  hb_segment_properties_t default_props = HB_SEGMENT_PROPERTIES_DEFAULT;
237
  props = default_props;
238
  scratch_flags = HB_BUFFER_SCRATCH_FLAG_DEFAULT;
239

240
  content_type = HB_BUFFER_CONTENT_TYPE_INVALID;
241 242 243
  in_error = false;
  have_output = false;
  have_positions = false;
244

245 246 247
  idx = 0;
  len = 0;
  out_len = 0;
248
  out_info = info;
249

250
  serial = 0;
251 252 253

  memset (context, 0, sizeof context);
  memset (context_len, 0, sizeof context_len);
254 255

  deallocate_var_all ();
256 257
}

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

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

  glyph = &info[len];

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

  len++;
274
}
275

276 277 278 279 280 281 282 283 284 285 286
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 已提交
287 288 289 290 291 292 293 294 295 296 297 298 299
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;
}

300 301
void
hb_buffer_t::clear_output (void)
B
Behdad Esfahbod 已提交
302
{
303 304 305
  if (unlikely (hb_object_is_inert (this)))
    return;

306 307
  have_output = true;
  have_positions = false;
308

309 310 311 312 313 314 315 316 317 318
  out_len = 0;
  out_info = info;
}

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

319 320
  have_output = false;
  have_positions = true;
321

322 323 324
  out_len = 0;
  out_info = info;

325 326 327 328 329 330 331 332 333
  memset (pos, 0, sizeof (pos[0]) * len);
}

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

  assert (have_output);
334
  have_output = false;
335 336

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

B
Behdad Esfahbod 已提交
353

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

361
  merge_clusters (idx, idx + num_in);
B
Behdad Esfahbod 已提交
362

363
  hb_glyph_info_t orig_info = info[idx];
B
Behdad Esfahbod 已提交
364 365 366 367 368 369 370 371
  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++;
  }

372
  idx  += num_in;
373
  out_len += num_out;
B
Behdad Esfahbod 已提交
374 375
}

376 377 378
void
hb_buffer_t::output_glyph (hb_codepoint_t glyph_index)
{
379
  if (unlikely (!make_room_for (0, 1))) return;
380 381 382 383 384 385 386

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

  out_len++;
}

387
void
388
hb_buffer_t::output_info (const hb_glyph_info_t &glyph_info)
389
{
390
  if (unlikely (!make_room_for (0, 1))) return;
391 392 393 394 395 396

  out_info[out_len] = glyph_info;

  out_len++;
}

397 398 399
void
hb_buffer_t::copy_glyph (void)
{
400
  if (unlikely (!make_room_for (0, 1))) return;
401 402 403 404 405 406

  out_info[out_len] = info[idx];

  out_len++;
}

407 408 409 410 411 412 413
bool
hb_buffer_t::move_to (unsigned int i)
{
  if (!have_output)
  {
    assert (i <= len);
    idx = i;
414
    return true;
415
  }
416 417
  if (unlikely (in_error))
    return false;
418 419 420 421

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

  if (out_len < i)
422 423
  {
    unsigned int count = i - out_len;
424
    if (unlikely (!make_room_for (count, count))) return false;
425 426 427 428 429 430 431 432 433 434

    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;

435 436
    /* This will blow in our face if memory allocation fails later
     * in this same lookup... */
437 438 439 440 441 442 443 444
    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]));
  }
445

446 447 448
  return true;
}

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

458
  idx++;
459
  out_len++;
460 461
}

B
Behdad Esfahbod 已提交
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 490 491 492 493
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;

494
  if (end - start < 2)
495 496 497 498 499 500 501 502 503 504
    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;
  }

505
  if (have_positions) {
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 542 543 544 545
    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);
546 547
}

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

558
  unsigned int cluster = info[start].cluster;
559 560

  for (unsigned int i = start + 1; i < end; i++)
561 562 563 564 565 566
    cluster = MIN (cluster, info[i].cluster);

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

567 568 569 570 571 572
  /* 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)
573
    for (unsigned int i = out_len; i && out_info[i - 1].cluster == info[start].cluster; i--)
574
      set_cluster (out_info[i - 1], cluster);
575

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

B
Minor  
Behdad Esfahbod 已提交
586
  if (unlikely (end - start < 2))
587 588
    return;

589
  unsigned int cluster = out_info[start].cluster;
590 591

  for (unsigned int i = start + 1; i < end; i++)
592
    cluster = MIN (cluster, out_info[i].cluster);
593 594 595 596 597

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

598 599 600 601
  /* Extend end */
  while (end < out_len && out_info[end - 1].cluster == out_info[end].cluster)
    end++;

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

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

615 616 617 618 619 620 621 622 623 624 625 626
  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)
    {
627
      unsigned int mask = info[idx].mask;
628 629
      unsigned int old_cluster = out_info[out_len - 1].cluster;
      for (unsigned i = out_len; i && out_info[i - 1].cluster == old_cluster; i--)
630
	set_cluster (out_info[i - 1], cluster, mask);
631 632 633 634 635 636 637 638 639 640 641 642 643 644
    }
    goto done;
  }

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

done:
  skip_glyph ();
}
645

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

662 663 664
  assert (start <= out_len);
  assert (idx <= end);

665
  unsigned int cluster = (unsigned int) -1;
666 667 668 669
  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);
670 671
}

672
void
673
hb_buffer_t::guess_segment_properties (void)
674
{
675 676
  assert (content_type == HB_BUFFER_CONTENT_TYPE_UNICODE ||
	  (!len && content_type == HB_BUFFER_CONTENT_TYPE_INVALID));
677

678 679 680
  /* If script is set to INVALID, guess from buffer contents */
  if (props.script == HB_SCRIPT_INVALID) {
    for (unsigned int i = 0; i < len; i++) {
681
      hb_script_t script = unicode->script (info[i].codepoint);
682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703
      if (likely (script != HB_SCRIPT_COMMON &&
		  script != HB_SCRIPT_INHERITED &&
		  script != HB_SCRIPT_UNKNOWN)) {
        props.script = script;
        break;
      }
    }
  }

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

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


704 705
/* Public API */

706
/**
707
 * hb_buffer_create: (Xconstructor)
708
 *
709
 * Creates a new #hb_buffer_t with all properties to defaults.
710
 *
711 712
 * Return value: (transfer full):
 * A newly allocated #hb_buffer_t with a reference count of 1. The initial
K
Khaled Hosny 已提交
713
 * reference count should be released with hb_buffer_destroy() when you are done
714 715 716
 * 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.
717
 *
B
Behdad Esfahbod 已提交
718
 * Since: 0.9.2
719
 **/
720
hb_buffer_t *
B
Minor  
Behdad Esfahbod 已提交
721
hb_buffer_create (void)
722
{
723 724
  hb_buffer_t *buffer;

725
  if (!(buffer = hb_object_create<hb_buffer_t> ()))
726
    return hb_buffer_get_empty ();
727

B
Behdad Esfahbod 已提交
728 729
  buffer->max_len = HB_BUFFER_MAX_LEN_DEFAULT;

730
  buffer->reset ();
B
Behdad Esfahbod 已提交
731

732 733
  return buffer;
}
B
Behdad Esfahbod 已提交
734

735 736 737 738 739 740 741
/**
 * hb_buffer_get_empty:
 *
 * 
 *
 * Return value: (transfer full):
 *
B
Behdad Esfahbod 已提交
742
 * Since: 0.9.2
743
 **/
744 745 746
hb_buffer_t *
hb_buffer_get_empty (void)
{
747 748 749
  static const hb_buffer_t _hb_buffer_nil = {
    HB_OBJECT_HEADER_STATIC,

750
    const_cast<hb_unicode_funcs_t *> (&_hb_unicode_funcs_nil),
751
    HB_BUFFER_FLAG_DEFAULT,
752
    HB_BUFFER_CLUSTER_LEVEL_DEFAULT,
753
    HB_BUFFER_REPLACEMENT_CODEPOINT_DEFAULT,
754
    HB_BUFFER_SCRATCH_FLAG_DEFAULT,
B
Behdad Esfahbod 已提交
755
    HB_BUFFER_MAX_LEN_DEFAULT,
756

757
    HB_BUFFER_CONTENT_TYPE_INVALID,
758
    HB_SEGMENT_PROPERTIES_DEFAULT,
759 760 761
    true, /* in_error */
    true, /* have_output */
    true  /* have_positions */
762 763

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

  return const_cast<hb_buffer_t *> (&_hb_buffer_nil);
767 768
}

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

787 788
/**
 * hb_buffer_destroy: (skip)
789
 * @buffer: an #hb_buffer_t.
790
 *
791 792 793
 * 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().
794
 *
B
Behdad Esfahbod 已提交
795
 * Since: 0.9.2
796
 **/
B
Behdad Esfahbod 已提交
797
void
798
hb_buffer_destroy (hb_buffer_t *buffer)
B
Behdad Esfahbod 已提交
799
{
800
  if (!hb_object_destroy (buffer)) return;
801

B
Behdad Esfahbod 已提交
802 803
  hb_unicode_funcs_destroy (buffer->unicode);

804
  free (buffer->info);
805
  free (buffer->pos);
806 807
  if (buffer->message_destroy)
    buffer->message_destroy (buffer->message_data);
808

809
  free (buffer);
B
Behdad Esfahbod 已提交
810 811
}

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

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

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

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


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

906 907
  if (!unicode_funcs)
    unicode_funcs = hb_unicode_funcs_get_default ();
908

B
Behdad Esfahbod 已提交
909

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

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

931 932
/**
 * hb_buffer_set_direction:
933
 * @buffer: an #hb_buffer_t.
934
 * @direction: the #hb_direction_t of the @buffer
935
 *
936 937 938 939 940 941 942
 * 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.
943
 *
B
Behdad Esfahbod 已提交
944
 * Since: 0.9.2
945
 **/
B
Behdad Esfahbod 已提交
946 947 948 949 950
void
hb_buffer_set_direction (hb_buffer_t    *buffer,
			 hb_direction_t  direction)

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

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

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

974 975
/**
 * hb_buffer_set_script:
976
 * @buffer: an #hb_buffer_t.
977
 * @script: an #hb_script_t to set.
978
 *
979 980 981 982 983 984 985 986 987
 * 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.
988
 *
B
Behdad Esfahbod 已提交
989
 * Since: 0.9.2
990
 **/
991 992 993 994
void
hb_buffer_set_script (hb_buffer_t *buffer,
		      hb_script_t  script)
{
B
Behdad Esfahbod 已提交
995 996 997
  if (unlikely (hb_object_is_inert (buffer)))
    return;

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

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

1018 1019
/**
 * hb_buffer_set_language:
1020
 * @buffer: an #hb_buffer_t.
1021
 * @language: an hb_language_t to set.
1022
 *
1023 1024 1025 1026 1027 1028 1029 1030 1031
 * 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.
1032
 *
B
Behdad Esfahbod 已提交
1033
 * Since: 0.9.2
1034
 **/
1035 1036 1037 1038
void
hb_buffer_set_language (hb_buffer_t   *buffer,
			hb_language_t  language)
{
B
Behdad Esfahbod 已提交
1039 1040 1041
  if (unlikely (hb_object_is_inert (buffer)))
    return;

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

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

1062 1063
/**
 * hb_buffer_set_segment_properties:
1064
 * @buffer: an #hb_buffer_t.
K
Khaled Hosny 已提交
1065
 * @props: an #hb_segment_properties_t to use.
1066
 *
K
Khaled Hosny 已提交
1067 1068 1069
 * 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.
1070
 *
S
Sascha Brawer 已提交
1071
 * Since: 0.9.7
1072
 **/
1073 1074 1075 1076 1077 1078 1079 1080 1081 1082
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;
}

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


1100 1101
/**
 * hb_buffer_set_flags:
1102
 * @buffer: an #hb_buffer_t.
1103
 * @flags: the buffer flags to set.
1104
 *
1105
 * Sets @buffer flags to @flags. See #hb_buffer_flags_t.
1106
 *
S
Sascha Brawer 已提交
1107
 * Since: 0.9.7
1108
 **/
B
Behdad Esfahbod 已提交
1109 1110 1111 1112 1113 1114 1115 1116 1117 1118
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;
}

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

1136 1137
/**
 * hb_buffer_set_cluster_level:
1138
 * @buffer: an #hb_buffer_t.
1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156
 * @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:
1157
 * @buffer: an #hb_buffer_t.
1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170
 *
 * 
 *
 * 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 已提交
1171

1172 1173
/**
 * hb_buffer_set_replacement_codepoint:
1174
 * @buffer: an #hb_buffer_t.
K
Khaled Hosny 已提交
1175
 * @replacement: the replacement #hb_codepoint_t
1176
 *
K
Khaled Hosny 已提交
1177 1178 1179 1180
 * 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.
1181
 *
S
Sascha Brawer 已提交
1182
 * Since: 0.9.31
1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195
 **/
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:
1196
 * @buffer: an #hb_buffer_t.
1197
 *
K
Khaled Hosny 已提交
1198
 * See hb_buffer_set_replacement_codepoint().
1199 1200
 *
 * Return value: 
K
Khaled Hosny 已提交
1201
 * The @buffer replacement #hb_codepoint_t.
1202
 *
S
Sascha Brawer 已提交
1203
 * Since: 0.9.31
1204 1205 1206 1207 1208 1209 1210 1211
 **/
hb_codepoint_t
hb_buffer_get_replacement_codepoint (hb_buffer_t    *buffer)
{
  return buffer->replacement;
}


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

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

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

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

1277 1278
/**
 * hb_buffer_add:
1279 1280 1281
 * @buffer: an #hb_buffer_t.
 * @codepoint: a Unicode code point.
 * @cluster: the cluster value of @codepoint.
1282
 *
1283 1284 1285 1286 1287
 * 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.
1288
 *
K
Khaled Hosny 已提交
1289 1290 1291
 * 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 已提交
1292
 * Since: 0.9.7
1293
 **/
1294
void
1295 1296 1297
hb_buffer_add (hb_buffer_t    *buffer,
	       hb_codepoint_t  codepoint,
	       unsigned int    cluster)
1298
{
1299
  buffer->add (codepoint, cluster);
1300
  buffer->clear_context (1);
1301 1302
}

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

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

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

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

1342
  return true;
1343 1344
}

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

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

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

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

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

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

B
Behdad Esfahbod 已提交
1414 1415
/**
 * hb_buffer_reverse:
1416
 * @buffer: an #hb_buffer_t.
B
Behdad Esfahbod 已提交
1417 1418 1419
 *
 * Reverses buffer contents.
 *
B
Behdad Esfahbod 已提交
1420
 * Since: 0.9.2
B
Behdad Esfahbod 已提交
1421
 **/
1422 1423 1424
void
hb_buffer_reverse (hb_buffer_t *buffer)
{
1425
  buffer->reverse ();
1426 1427
}

1428 1429
/**
 * hb_buffer_reverse_range:
1430
 * @buffer: an #hb_buffer_t.
1431 1432 1433
 * @start: start index.
 * @end: end index.
 *
B
Behdad Esfahbod 已提交
1434
 * Reverses buffer contents between start to end.
1435
 *
B
Behdad Esfahbod 已提交
1436
 * Since: 0.9.41
1437 1438 1439 1440 1441 1442 1443 1444
 **/
void
hb_buffer_reverse_range (hb_buffer_t *buffer,
			 unsigned int start, unsigned int end)
{
  buffer->reverse_range (start, end);
}

B
Behdad Esfahbod 已提交
1445 1446
/**
 * hb_buffer_reverse_clusters:
1447
 * @buffer: an #hb_buffer_t.
B
Behdad Esfahbod 已提交
1448 1449 1450 1451 1452
 *
 * 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 已提交
1453
 * Since: 0.9.2
B
Behdad Esfahbod 已提交
1454
 **/
1455 1456 1457
void
hb_buffer_reverse_clusters (hb_buffer_t *buffer)
{
1458
  buffer->reverse_clusters ();
1459 1460
}

B
Behdad Esfahbod 已提交
1461 1462
/**
 * hb_buffer_guess_segment_properties:
1463
 * @buffer: an #hb_buffer_t.
B
Behdad Esfahbod 已提交
1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482
 *
 * 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().
 *
 * 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 已提交
1483
 * Since: 0.9.7
B
Behdad Esfahbod 已提交
1484
 **/
1485
void
1486
hb_buffer_guess_segment_properties (hb_buffer_t *buffer)
1487
{
1488
  buffer->guess_segment_properties ();
1489 1490
}

1491
template <typename utf_t>
1492 1493
static inline void
hb_buffer_add_utf (hb_buffer_t  *buffer,
1494
		   const typename utf_t::codepoint_t *text,
1495 1496 1497 1498
		   int           text_length,
		   unsigned int  item_offset,
		   int           item_length)
{
1499
  typedef typename utf_t::codepoint_t T;
1500
  const hb_codepoint_t replacement = buffer->replacement;
1501

1502 1503 1504 1505 1506 1507
  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 已提交
1508
  if (text_length == -1)
1509
    text_length = utf_t::strlen (text);
1510 1511 1512 1513 1514 1515

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

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

1516 1517 1518 1519 1520 1521 1522 1523
  /* 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)
1524 1525 1526 1527 1528 1529 1530 1531
  {
    /* 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;
1532
      prev = utf_t::prev (prev, start, &u, replacement);
1533 1534 1535 1536 1537
      buffer->context[0][buffer->context_len[0]++] = u;
    }
  }

  const T *next = text + item_offset;
1538
  const T *end = next + item_length;
1539 1540
  while (next < end)
  {
1541 1542
    hb_codepoint_t u;
    const T *old_next = next;
1543
    next = utf_t::next (next, end, &u, replacement);
1544
    buffer->add (u, old_next - (const T *) text);
1545 1546 1547 1548 1549 1550 1551 1552
  }

  /* 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;
1553
    next = utf_t::next (next, end, &u, replacement);
1554
    buffer->context[1][buffer->context_len[1]++] = u;
1555 1556 1557
  }

  buffer->content_type = HB_BUFFER_CONTENT_TYPE_UNICODE;
1558 1559
}

1560 1561
/**
 * hb_buffer_add_utf8:
1562
 * @buffer: an #hb_buffer_t.
K
Khaled Hosny 已提交
1563 1564
 * @text: (array length=text_length) (element-type uint8_t): an array of UTF-8
 *               characters to append.
1565 1566 1567 1568
 * @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).
1569
 *
1570
 * See hb_buffer_add_codepoints().
1571
 *
K
Khaled Hosny 已提交
1572 1573 1574
 * Replaces invalid UTF-8 characters with the @buffer replacement code point,
 * see hb_buffer_set_replacement_codepoint().
 *
B
Behdad Esfahbod 已提交
1575
 * Since: 0.9.2
1576
 **/
1577 1578 1579
void
hb_buffer_add_utf8 (hb_buffer_t  *buffer,
		    const char   *text,
1580
		    int           text_length,
1581
		    unsigned int  item_offset,
1582
		    int           item_length)
1583
{
1584
  hb_buffer_add_utf<hb_utf8_t> (buffer, (const uint8_t *) text, text_length, item_offset, item_length);
1585 1586
}

1587 1588
/**
 * hb_buffer_add_utf16:
1589 1590 1591 1592 1593 1594
 * @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).
1595
 *
1596
 * See hb_buffer_add_codepoints().
1597
 *
K
Khaled Hosny 已提交
1598 1599 1600
 * Replaces invalid UTF-16 characters with the @buffer replacement code point,
 * see hb_buffer_set_replacement_codepoint().
 *
B
Behdad Esfahbod 已提交
1601
 * Since: 0.9.2
1602
 **/
1603 1604 1605
void
hb_buffer_add_utf16 (hb_buffer_t    *buffer,
		     const uint16_t *text,
1606
		     int             text_length,
1607
		     unsigned int    item_offset,
1608
		     int             item_length)
1609
{
1610
  hb_buffer_add_utf<hb_utf16_t> (buffer, text, text_length, item_offset, item_length);
1611 1612
}

1613 1614
/**
 * hb_buffer_add_utf32:
1615 1616 1617 1618 1619 1620
 * @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).
1621
 *
1622
 * See hb_buffer_add_codepoints().
1623
 *
K
Khaled Hosny 已提交
1624 1625 1626
 * Replaces invalid UTF-32 characters with the @buffer replacement code point,
 * see hb_buffer_set_replacement_codepoint().
 *
B
Behdad Esfahbod 已提交
1627
 * Since: 0.9.2
1628
 **/
1629 1630 1631
void
hb_buffer_add_utf32 (hb_buffer_t    *buffer,
		     const uint32_t *text,
1632
		     int             text_length,
1633
		     unsigned int    item_offset,
1634
		     int             item_length)
1635
{
1636 1637 1638 1639 1640
  hb_buffer_add_utf<hb_utf32_t<> > (buffer, text, text_length, item_offset, item_length);
}

/**
 * hb_buffer_add_latin1:
1641
 * @buffer: an #hb_buffer_t.
K
Khaled Hosny 已提交
1642 1643 1644 1645 1646 1647
 * @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).
1648
 *
K
Khaled Hosny 已提交
1649 1650 1651 1652
 * 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>
1653
 *
S
Sascha Brawer 已提交
1654
 * Since: 0.9.39
1655 1656 1657 1658 1659 1660 1661 1662 1663
 **/
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);
1664 1665 1666 1667
}

/**
 * hb_buffer_add_codepoints:
1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683
 * @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.
1684
 *
K
Khaled Hosny 已提交
1685 1686 1687
 * 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 已提交
1688
 * Since: 0.9.31
1689 1690 1691 1692 1693 1694 1695 1696
 **/
void
hb_buffer_add_codepoints (hb_buffer_t          *buffer,
			  const hb_codepoint_t *text,
			  int                   text_length,
			  unsigned int          item_offset,
			  int                   item_length)
{
1697
  hb_buffer_add_utf<hb_utf32_t<false> > (buffer, text, text_length, item_offset, item_length);
1698
}
B
Behdad Esfahbod 已提交
1699 1700


B
Behdad Esfahbod 已提交
1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718
/**
 * 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);
1719 1720
  assert (buffer->have_positions == source->have_positions ||
	  !buffer->len || !source->len);
B
Behdad Esfahbod 已提交
1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732
  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;
1733 1734
  if (!buffer->have_positions && source->have_positions)
    buffer->clear_positions ();
B
Behdad Esfahbod 已提交
1735

B
Behdad Esfahbod 已提交
1736
  if (buffer->len + (end - start) < buffer->len) /* Overflows. */
B
Behdad Esfahbod 已提交
1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752
  {
    buffer->in_error = true;
    return;
  }

  unsigned int orig_len = buffer->len;
  hb_buffer_set_length (buffer, buffer->len + (end - start));
  if (buffer->in_error)
    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]));
}


1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794
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;

1795
    hb_stable_sort (buffer->info + start, end - start - 1, compare_info_codepoint, buffer->pos + start);
1796 1797 1798 1799 1800 1801 1802 1803
  } 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;
    }
1804
    hb_stable_sort (buffer->info + start + 1, end - start - 1, compare_info_codepoint, buffer->pos + start + 1);
1805 1806 1807
  }
}

1808 1809
/**
 * hb_buffer_normalize_glyphs:
1810
 * @buffer: an #hb_buffer_t.
1811
 *
K
Khaled Hosny 已提交
1812 1813 1814 1815
 * 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>
1816
 *
S
Sascha Brawer 已提交
1817
 * Since: 0.9.2
1818
 **/
1819 1820 1821 1822
void
hb_buffer_normalize_glyphs (hb_buffer_t *buffer)
{
  assert (buffer->have_positions);
B
Behdad Esfahbod 已提交
1823 1824
  assert (buffer->content_type == HB_BUFFER_CONTENT_TYPE_GLYPHS ||
	  (!buffer->len && buffer->content_type == HB_BUFFER_CONTENT_TYPE_INVALID));
1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840

  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);
}
1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861

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

1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911

/*
 * Comparing buffers.
 */

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)
{
  if (buffer->content_type != reference->content_type)
    return HB_BUFFER_DIFF_FLAG_CONTENT_TYPE_MISMATCH;

  hb_buffer_diff_flags_t result = HB_BUFFER_DIFF_FLAG_EQUAL;

  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++)
    {
      if (info[i].codepoint == dottedcircle_glyph)
        result |= HB_BUFFER_DIFF_FLAG_DOTTED_CIRCLE_PRESENT;
      else if (info[i].codepoint == 0)
        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;
    if ((buf_info->mask & HB_GLYPH_FLAG_DEFINED) != (ref_info->mask & HB_GLYPH_FLAG_DEFINED))
1912
      result |= HB_BUFFER_DIFF_FLAG_GLYPH_FLAGS_MISMATCH;
1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927
    if (ref_info->codepoint == dottedcircle_glyph)
      result |= HB_BUFFER_DIFF_FLAG_DOTTED_CIRCLE_PRESENT;
    else if (ref_info->codepoint == 0)
      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++)
    {
1928 1929 1930 1931
      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)
1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944
      {
        result |= HB_BUFFER_DIFF_FLAG_POSITION_MISMATCH;
        break;
      }
      buf_pos++;
      ref_pos++;
    }
  }

  return result;
}


1945 1946 1947 1948 1949 1950
/*
 * Debugging.
 */

/**
 * hb_buffer_set_message_func:
1951
 * @buffer: an #hb_buffer_t.
1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985
 * @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 {
    buffer->message_func = NULL;
    buffer->message_data = NULL;
    buffer->message_destroy = NULL;
  }
}

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