2008-01-15 22:46:32 +00:00
|
|
|
/*
|
2011-04-21 21:14:28 +00:00
|
|
|
* Copyright © 1998-2004 David Turner and Werner Lemberg
|
|
|
|
* Copyright © 2004,2007,2009,2010 Red Hat, Inc.
|
|
|
|
* Copyright © 2011 Google, Inc.
|
2006-03-31 12:28:09 +00:00
|
|
|
*
|
2011-04-15 22:59:56 +00:00
|
|
|
* This is part of HarfBuzz, a text shaping library.
|
2006-03-31 12:28:09 +00:00
|
|
|
*
|
2008-01-15 22:46:32 +00:00
|
|
|
* 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
|
2011-04-13 19:49:06 +00:00
|
|
|
* Google Author(s): Behdad Esfahbod
|
2006-03-31 12:28:09 +00:00
|
|
|
*/
|
|
|
|
|
2010-05-12 22:23:21 +00:00
|
|
|
#include "hb-buffer-private.hh"
|
2006-03-31 12:28:09 +00:00
|
|
|
|
2009-05-25 07:39:11 +00:00
|
|
|
#include <string.h>
|
|
|
|
|
2010-07-23 19:11:18 +00:00
|
|
|
|
2009-08-02 02:53:04 +00:00
|
|
|
|
2011-07-28 19:42:18 +00:00
|
|
|
#ifndef HB_DEBUG_BUFFER
|
|
|
|
#define HB_DEBUG_BUFFER (HB_DEBUG+0)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
2011-07-25 20:30:32 +00:00
|
|
|
static hb_buffer_t _hb_buffer_nil = {
|
2011-04-21 22:24:02 +00:00
|
|
|
HB_OBJECT_HEADER_STATIC,
|
2009-11-03 20:15:07 +00:00
|
|
|
|
2011-04-27 13:24:37 +00:00
|
|
|
&_hb_unicode_funcs_default,
|
2011-04-15 23:26:24 +00:00
|
|
|
{
|
|
|
|
HB_DIRECTION_INVALID,
|
|
|
|
HB_SCRIPT_INVALID,
|
|
|
|
NULL,
|
|
|
|
},
|
2011-04-28 16:56:49 +00:00
|
|
|
|
|
|
|
TRUE, /* in_error */
|
|
|
|
TRUE, /* have_output */
|
|
|
|
TRUE /* have_positions */
|
2009-08-02 02:19:06 +00:00
|
|
|
};
|
|
|
|
|
2007-10-11 00:07:58 +00:00
|
|
|
/* Here is how the buffer works internally:
|
|
|
|
*
|
2010-05-15 02:13:38 +00:00
|
|
|
* There are two info pointers: info and out_info. They always have
|
|
|
|
* the same allocated size, but different lengths.
|
2007-10-11 00:07:58 +00:00
|
|
|
*
|
2010-05-15 02:03:11 +00:00
|
|
|
* As an optimization, both info and out_info may point to the
|
2010-05-15 02:02:37 +00:00
|
|
|
* same piece of memory, which is owned by info. This remains the
|
2011-01-06 19:58:52 +00:00
|
|
|
* case as long as out_len doesn't exceed i at any time.
|
2011-07-22 15:28:07 +00:00
|
|
|
* In that case, swap_buffers() is no-op and the glyph operations operate
|
2010-05-15 02:13:38 +00:00
|
|
|
* mostly in-place.
|
2007-10-11 00:07:58 +00:00
|
|
|
*
|
2010-05-15 02:03:11 +00:00
|
|
|
* As soon as out_info gets longer than info, out_info is moved over
|
2010-05-15 02:13:38 +00:00
|
|
|
* to an alternate buffer (which we reuse the pos buffer for!), and its
|
|
|
|
* current contents (out_len entries) are copied to the new place.
|
2011-07-22 15:28:07 +00:00
|
|
|
* This should all remain transparent to the user. swap_buffers() then
|
2010-05-15 02:13:38 +00:00
|
|
|
* switches info and out_info.
|
2007-10-11 00:07:58 +00:00
|
|
|
*/
|
|
|
|
|
2009-05-25 08:04:24 +00:00
|
|
|
|
2011-07-22 15:28:07 +00:00
|
|
|
|
|
|
|
/* Internal API */
|
|
|
|
|
|
|
|
bool
|
|
|
|
hb_buffer_t::enlarge (unsigned int size)
|
2010-05-15 03:28:44 +00:00
|
|
|
{
|
2011-07-22 15:28:07 +00:00
|
|
|
if (unlikely (in_error))
|
2010-05-15 03:28:44 +00:00
|
|
|
return FALSE;
|
|
|
|
|
2011-07-22 15:28:07 +00:00
|
|
|
unsigned int new_allocated = allocated;
|
2011-04-28 16:56:49 +00:00
|
|
|
hb_glyph_position_t *new_pos = NULL;
|
|
|
|
hb_glyph_info_t *new_info = NULL;
|
2011-07-22 15:28:07 +00:00
|
|
|
bool separate_out = out_info != info;
|
2010-05-15 03:28:44 +00:00
|
|
|
|
2011-07-22 15:28:07 +00:00
|
|
|
if (unlikely (_hb_unsigned_int_mul_overflows (size, sizeof (info[0]))))
|
2011-04-28 16:56:49 +00:00
|
|
|
goto done;
|
2010-05-15 03:28:44 +00:00
|
|
|
|
|
|
|
while (size > new_allocated)
|
2011-04-27 13:33:58 +00:00
|
|
|
new_allocated += (new_allocated >> 1) + 32;
|
2010-05-15 03:28:44 +00:00
|
|
|
|
2011-07-22 15:28:07 +00:00
|
|
|
ASSERT_STATIC (sizeof (info[0]) == sizeof (pos[0]));
|
|
|
|
if (unlikely (_hb_unsigned_int_mul_overflows (new_allocated, sizeof (info[0]))))
|
2011-04-28 16:56:49 +00:00
|
|
|
goto done;
|
|
|
|
|
2011-07-22 15:28:07 +00:00
|
|
|
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]));
|
2010-05-15 03:28:44 +00:00
|
|
|
|
2011-04-28 16:56:49 +00:00
|
|
|
done:
|
2010-05-15 03:28:44 +00:00
|
|
|
if (unlikely (!new_pos || !new_info))
|
2011-07-22 15:28:07 +00:00
|
|
|
in_error = TRUE;
|
2010-05-15 03:28:44 +00:00
|
|
|
|
|
|
|
if (likely (new_pos))
|
2011-07-22 15:28:07 +00:00
|
|
|
pos = new_pos;
|
2010-05-15 03:28:44 +00:00
|
|
|
|
|
|
|
if (likely (new_info))
|
2011-07-22 15:28:07 +00:00
|
|
|
info = new_info;
|
|
|
|
|
|
|
|
out_info = separate_out ? (hb_glyph_info_t *) pos : info;
|
|
|
|
if (likely (!in_error))
|
|
|
|
allocated = new_allocated;
|
|
|
|
|
|
|
|
return likely (!in_error);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
hb_buffer_t::make_room_for (unsigned int num_in,
|
|
|
|
unsigned int num_out)
|
|
|
|
{
|
|
|
|
if (unlikely (!ensure (out_len + num_out))) return FALSE;
|
|
|
|
|
|
|
|
if (out_info == info &&
|
|
|
|
out_len + num_out > idx + num_in)
|
|
|
|
{
|
|
|
|
assert (have_output);
|
|
|
|
|
|
|
|
out_info = (hb_glyph_info_t *) pos;
|
|
|
|
memcpy (out_info, info, out_len * sizeof (out_info[0]));
|
|
|
|
}
|
|
|
|
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
|
2011-08-03 21:38:54 +00:00
|
|
|
void *
|
|
|
|
hb_buffer_t::get_scratch_buffer (unsigned int *size)
|
|
|
|
{
|
|
|
|
have_output = FALSE;
|
|
|
|
have_positions = FALSE;
|
|
|
|
out_len = 0;
|
|
|
|
*size = allocated * sizeof (pos[0]);
|
|
|
|
return pos;
|
|
|
|
}
|
|
|
|
|
2011-07-22 15:28:07 +00:00
|
|
|
|
|
|
|
/* HarfBuzz-Internal API */
|
|
|
|
|
|
|
|
void
|
|
|
|
hb_buffer_t::reset (void)
|
|
|
|
{
|
|
|
|
if (unlikely (hb_object_is_inert (this)))
|
|
|
|
return;
|
|
|
|
|
|
|
|
hb_unicode_funcs_destroy (unicode);
|
2011-07-25 20:30:32 +00:00
|
|
|
unicode = _hb_buffer_nil.unicode;
|
2011-07-22 15:28:07 +00:00
|
|
|
|
2011-07-25 20:30:32 +00:00
|
|
|
props = _hb_buffer_nil.props;
|
2011-07-22 15:28:07 +00:00
|
|
|
|
|
|
|
in_error = FALSE;
|
|
|
|
have_output = FALSE;
|
|
|
|
have_positions = FALSE;
|
2010-05-15 03:28:44 +00:00
|
|
|
|
2011-07-22 15:28:07 +00:00
|
|
|
idx = 0;
|
|
|
|
len = 0;
|
|
|
|
out_len = 0;
|
2010-05-15 03:28:44 +00:00
|
|
|
|
2011-07-22 15:28:07 +00:00
|
|
|
serial = 0;
|
2011-07-25 20:20:16 +00:00
|
|
|
memset (allocated_var_bytes, 0, sizeof allocated_var_bytes);
|
|
|
|
memset (allocated_var_owner, 0, sizeof allocated_var_owner);
|
2011-07-22 15:28:07 +00:00
|
|
|
|
|
|
|
out_info = info;
|
2010-05-15 03:28:44 +00:00
|
|
|
}
|
|
|
|
|
2011-07-22 15:28:07 +00:00
|
|
|
void
|
|
|
|
hb_buffer_t::add (hb_codepoint_t codepoint,
|
|
|
|
hb_mask_t mask,
|
|
|
|
unsigned int cluster)
|
2010-05-15 03:28:44 +00:00
|
|
|
{
|
2011-07-22 15:28:07 +00:00
|
|
|
hb_glyph_info_t *glyph;
|
|
|
|
|
|
|
|
if (unlikely (!ensure (len + 1))) return;
|
|
|
|
|
|
|
|
glyph = &info[len];
|
|
|
|
|
|
|
|
memset (glyph, 0, sizeof (*glyph));
|
|
|
|
glyph->codepoint = codepoint;
|
|
|
|
glyph->mask = mask;
|
|
|
|
glyph->cluster = cluster;
|
|
|
|
|
|
|
|
len++;
|
2010-05-15 03:28:44 +00:00
|
|
|
}
|
2007-10-11 08:30:50 +00:00
|
|
|
|
2011-07-22 15:28:07 +00:00
|
|
|
void
|
|
|
|
hb_buffer_t::clear_output (void)
|
2009-05-25 08:04:24 +00:00
|
|
|
{
|
2011-07-22 15:28:07 +00:00
|
|
|
if (unlikely (hb_object_is_inert (this)))
|
|
|
|
return;
|
|
|
|
|
|
|
|
have_output = TRUE;
|
|
|
|
have_positions = FALSE;
|
2010-05-15 03:20:16 +00:00
|
|
|
|
2011-07-22 15:28:07 +00:00
|
|
|
out_len = 0;
|
|
|
|
out_info = info;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
hb_buffer_t::clear_positions (void)
|
|
|
|
{
|
|
|
|
if (unlikely (hb_object_is_inert (this)))
|
|
|
|
return;
|
|
|
|
|
|
|
|
have_output = FALSE;
|
|
|
|
have_positions = TRUE;
|
|
|
|
|
|
|
|
memset (pos, 0, sizeof (pos[0]) * len);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
hb_buffer_t::swap_buffers (void)
|
|
|
|
{
|
|
|
|
if (unlikely (in_error)) return;
|
|
|
|
|
|
|
|
assert (have_output);
|
|
|
|
|
|
|
|
if (out_info != info)
|
2009-05-30 16:02:46 +00:00
|
|
|
{
|
2011-07-22 15:28:07 +00:00
|
|
|
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;
|
|
|
|
}
|
2009-05-30 16:02:46 +00:00
|
|
|
|
2011-07-22 15:28:07 +00:00
|
|
|
void
|
|
|
|
hb_buffer_t::replace_glyphs_be16 (unsigned int num_in,
|
|
|
|
unsigned int num_out,
|
|
|
|
const uint16_t *glyph_data_be)
|
|
|
|
{
|
|
|
|
if (!make_room_for (num_in, num_out)) return;
|
|
|
|
|
|
|
|
hb_glyph_info_t orig_info = info[idx];
|
|
|
|
for (unsigned int i = 1; i < num_in; i++)
|
|
|
|
{
|
|
|
|
hb_glyph_info_t *inf = &info[idx + i];
|
|
|
|
orig_info.cluster = MIN (orig_info.cluster, inf->cluster);
|
2009-05-30 16:02:46 +00:00
|
|
|
}
|
2010-05-15 03:20:16 +00:00
|
|
|
|
2011-07-22 15:28:07 +00:00
|
|
|
hb_glyph_info_t *pinfo = &out_info[out_len];
|
|
|
|
for (unsigned int i = 0; i < num_out; i++)
|
|
|
|
{
|
|
|
|
*pinfo = orig_info;
|
|
|
|
pinfo->codepoint = hb_be_uint16 (glyph_data_be[i]);
|
|
|
|
pinfo++;
|
|
|
|
}
|
|
|
|
|
|
|
|
idx += num_in;
|
|
|
|
out_len += num_out;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
hb_buffer_t::output_glyph (hb_codepoint_t glyph_index)
|
|
|
|
{
|
|
|
|
if (!make_room_for (0, 1)) return;
|
|
|
|
|
|
|
|
out_info[out_len] = info[idx];
|
|
|
|
out_info[out_len].codepoint = glyph_index;
|
|
|
|
|
|
|
|
out_len++;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
hb_buffer_t::copy_glyph (void)
|
|
|
|
{
|
|
|
|
if (!make_room_for (0, 1)) return;
|
|
|
|
|
|
|
|
out_info[out_len] = info[idx];
|
|
|
|
|
|
|
|
out_len++;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
hb_buffer_t::replace_glyph (hb_codepoint_t glyph_index)
|
|
|
|
{
|
|
|
|
out_info[out_len] = info[idx];
|
|
|
|
out_info[out_len].codepoint = glyph_index;
|
|
|
|
|
|
|
|
idx++;
|
|
|
|
out_len++;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
hb_buffer_t::next_glyph (void)
|
|
|
|
{
|
|
|
|
if (have_output)
|
|
|
|
{
|
|
|
|
if (out_info != info)
|
|
|
|
{
|
|
|
|
if (unlikely (!ensure (out_len + 1))) return;
|
|
|
|
out_info[out_len] = info[idx];
|
|
|
|
}
|
|
|
|
else if (out_len != idx)
|
|
|
|
out_info[out_len] = info[idx];
|
|
|
|
|
|
|
|
out_len++;
|
|
|
|
}
|
|
|
|
|
|
|
|
idx++;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
hb_buffer_t::set_masks (hb_mask_t value,
|
|
|
|
hb_mask_t mask,
|
|
|
|
unsigned int cluster_start,
|
|
|
|
unsigned int cluster_end)
|
|
|
|
{
|
|
|
|
hb_mask_t not_mask = ~mask;
|
|
|
|
value &= mask;
|
|
|
|
|
|
|
|
if (!mask)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (cluster_start == 0 && cluster_end == (unsigned int)-1) {
|
|
|
|
unsigned int count = len;
|
|
|
|
for (unsigned int i = 0; i < count; i++)
|
|
|
|
info[i].mask = (info[i].mask & not_mask) | value;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned int count = len;
|
|
|
|
for (unsigned int i = 0; i < count; i++)
|
|
|
|
if (cluster_start <= info[i].cluster && info[i].cluster < cluster_end)
|
|
|
|
info[i].mask = (info[i].mask & not_mask) | value;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
hb_buffer_t::reverse_range (unsigned int start,
|
|
|
|
unsigned int end)
|
|
|
|
{
|
|
|
|
unsigned int i, j;
|
|
|
|
|
|
|
|
if (start == end - 1)
|
|
|
|
return;
|
|
|
|
|
|
|
|
for (i = start, j = end - 1; i < j; i++, j--) {
|
|
|
|
hb_glyph_info_t t;
|
|
|
|
|
|
|
|
t = info[i];
|
|
|
|
info[i] = info[j];
|
|
|
|
info[j] = t;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (pos) {
|
|
|
|
for (i = start, j = end - 1; i < j; i++, j--) {
|
|
|
|
hb_glyph_position_t t;
|
|
|
|
|
|
|
|
t = pos[i];
|
|
|
|
pos[i] = pos[j];
|
|
|
|
pos[j] = t;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
hb_buffer_t::reverse (void)
|
|
|
|
{
|
|
|
|
if (unlikely (!len))
|
|
|
|
return;
|
|
|
|
|
|
|
|
reverse_range (0, len);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
hb_buffer_t::reverse_clusters (void)
|
|
|
|
{
|
|
|
|
unsigned int i, start, count, last_cluster;
|
|
|
|
|
|
|
|
if (unlikely (!len))
|
|
|
|
return;
|
|
|
|
|
|
|
|
reverse ();
|
|
|
|
|
|
|
|
count = len;
|
|
|
|
start = 0;
|
|
|
|
last_cluster = info[0].cluster;
|
|
|
|
for (i = 1; i < count; i++) {
|
|
|
|
if (last_cluster != info[i].cluster) {
|
|
|
|
reverse_range (start, i);
|
|
|
|
start = i;
|
|
|
|
last_cluster = info[i].cluster;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
reverse_range (start, i);
|
2007-10-11 00:07:58 +00:00
|
|
|
}
|
|
|
|
|
2011-07-28 19:42:18 +00:00
|
|
|
static inline void
|
|
|
|
dump_var_allocation (const hb_buffer_t *buffer)
|
|
|
|
{
|
|
|
|
char buf[80];
|
|
|
|
for (unsigned int i = 0; i < 8; i++)
|
2011-07-28 20:48:43 +00:00
|
|
|
buf[i] = '0' + buffer->allocated_var_bytes[7 - i];
|
2011-07-28 19:42:18 +00:00
|
|
|
buf[8] = '\0';
|
|
|
|
DEBUG_MSG (BUFFER, buffer,
|
|
|
|
"Current var allocation: %s",
|
|
|
|
buf);
|
|
|
|
}
|
2010-05-15 03:28:44 +00:00
|
|
|
|
2011-07-25 20:20:16 +00:00
|
|
|
void hb_buffer_t::allocate_var (unsigned int byte_i, unsigned int count, const char *owner)
|
|
|
|
{
|
2011-07-28 20:48:43 +00:00
|
|
|
assert (byte_i < 8 && byte_i + count <= 8);
|
2011-07-28 19:42:18 +00:00
|
|
|
|
|
|
|
if (DEBUG (BUFFER))
|
|
|
|
dump_var_allocation (this);
|
|
|
|
DEBUG_MSG (BUFFER, this,
|
|
|
|
"Allocating var bytes %d..%d for %s",
|
|
|
|
byte_i, byte_i + count - 1, owner);
|
|
|
|
|
2011-07-25 20:20:16 +00:00
|
|
|
for (unsigned int i = byte_i; i < byte_i + count; i++) {
|
|
|
|
assert (!allocated_var_bytes[i]);
|
|
|
|
allocated_var_bytes[i]++;
|
|
|
|
allocated_var_owner[i] = owner;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void hb_buffer_t::deallocate_var (unsigned int byte_i, unsigned int count, const char *owner)
|
|
|
|
{
|
2011-07-28 20:48:43 +00:00
|
|
|
if (DEBUG (BUFFER))
|
|
|
|
dump_var_allocation (this);
|
|
|
|
|
2011-07-28 19:42:18 +00:00
|
|
|
DEBUG_MSG (BUFFER, this,
|
|
|
|
"Deallocating var bytes %d..%d for %s",
|
|
|
|
byte_i, byte_i + count - 1, owner);
|
|
|
|
|
2011-07-28 20:48:43 +00:00
|
|
|
assert (byte_i < 8 && byte_i + count <= 8);
|
2011-07-25 20:20:16 +00:00
|
|
|
for (unsigned int i = byte_i; i < byte_i + count; i++) {
|
2011-07-28 20:48:43 +00:00
|
|
|
assert (allocated_var_bytes[i]);
|
|
|
|
assert (0 == strcmp (allocated_var_owner[i], owner));
|
2011-07-25 20:20:16 +00:00
|
|
|
allocated_var_bytes[i]--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-07-28 19:42:18 +00:00
|
|
|
void hb_buffer_t::deallocate_var_all (void)
|
|
|
|
{
|
|
|
|
memset (allocated_var_bytes, 0, sizeof (allocated_var_bytes));
|
|
|
|
memset (allocated_var_owner, 0, sizeof (allocated_var_owner));
|
|
|
|
}
|
2011-07-25 20:20:16 +00:00
|
|
|
|
2007-10-11 08:30:50 +00:00
|
|
|
/* Public API */
|
|
|
|
|
2009-05-20 09:35:14 +00:00
|
|
|
hb_buffer_t *
|
2009-08-02 02:19:06 +00:00
|
|
|
hb_buffer_create (unsigned int pre_alloc_size)
|
2006-03-31 12:28:09 +00:00
|
|
|
{
|
2009-05-20 09:35:14 +00:00
|
|
|
hb_buffer_t *buffer;
|
|
|
|
|
2011-04-27 20:38:03 +00:00
|
|
|
if (!(buffer = hb_object_create<hb_buffer_t> ()))
|
2011-07-25 20:30:32 +00:00
|
|
|
return &_hb_buffer_nil;
|
2006-03-31 12:28:09 +00:00
|
|
|
|
2011-07-22 15:28:07 +00:00
|
|
|
buffer->reset ();
|
2009-11-03 20:15:07 +00:00
|
|
|
|
2011-07-22 15:28:07 +00:00
|
|
|
if (pre_alloc_size && !buffer->ensure (pre_alloc_size)) {
|
2011-05-02 23:35:05 +00:00
|
|
|
hb_buffer_destroy (buffer);
|
2011-07-25 20:30:32 +00:00
|
|
|
return &_hb_buffer_nil;
|
2011-05-02 23:35:05 +00:00
|
|
|
}
|
|
|
|
|
2009-08-02 02:19:06 +00:00
|
|
|
return buffer;
|
|
|
|
}
|
2007-10-11 07:21:31 +00:00
|
|
|
|
2011-05-11 22:14:44 +00:00
|
|
|
hb_buffer_t *
|
|
|
|
hb_buffer_get_empty (void)
|
|
|
|
{
|
2011-07-25 20:30:32 +00:00
|
|
|
return &_hb_buffer_nil;
|
2011-05-11 22:14:44 +00:00
|
|
|
}
|
|
|
|
|
2009-08-02 02:19:06 +00:00
|
|
|
hb_buffer_t *
|
|
|
|
hb_buffer_reference (hb_buffer_t *buffer)
|
|
|
|
{
|
2011-04-27 20:38:03 +00:00
|
|
|
return hb_object_reference (buffer);
|
2009-08-02 02:19:06 +00:00
|
|
|
}
|
2009-07-28 19:43:34 +00:00
|
|
|
|
2007-10-11 07:21:31 +00:00
|
|
|
void
|
2009-08-02 02:19:06 +00:00
|
|
|
hb_buffer_destroy (hb_buffer_t *buffer)
|
2007-10-11 07:21:31 +00:00
|
|
|
{
|
2011-04-27 20:38:03 +00:00
|
|
|
if (!hb_object_destroy (buffer)) return;
|
2009-08-02 02:19:06 +00:00
|
|
|
|
2009-11-03 20:15:07 +00:00
|
|
|
hb_unicode_funcs_destroy (buffer->unicode);
|
|
|
|
|
2010-05-15 02:02:37 +00:00
|
|
|
free (buffer->info);
|
2010-05-15 02:05:53 +00:00
|
|
|
free (buffer->pos);
|
2009-08-02 02:19:06 +00:00
|
|
|
|
2009-05-20 09:35:14 +00:00
|
|
|
free (buffer);
|
2007-10-11 07:21:31 +00:00
|
|
|
}
|
|
|
|
|
2011-04-28 01:46:01 +00:00
|
|
|
hb_bool_t
|
|
|
|
hb_buffer_set_user_data (hb_buffer_t *buffer,
|
|
|
|
hb_user_data_key_t *key,
|
|
|
|
void * data,
|
|
|
|
hb_destroy_func_t destroy)
|
|
|
|
{
|
|
|
|
return hb_object_set_user_data (buffer, key, data, destroy);
|
|
|
|
}
|
|
|
|
|
|
|
|
void *
|
|
|
|
hb_buffer_get_user_data (hb_buffer_t *buffer,
|
|
|
|
hb_user_data_key_t *key)
|
|
|
|
{
|
|
|
|
return hb_object_get_user_data (buffer, key);
|
|
|
|
}
|
|
|
|
|
2009-11-03 20:15:07 +00:00
|
|
|
|
|
|
|
void
|
|
|
|
hb_buffer_set_unicode_funcs (hb_buffer_t *buffer,
|
|
|
|
hb_unicode_funcs_t *unicode)
|
|
|
|
{
|
2011-04-28 16:56:49 +00:00
|
|
|
if (unlikely (hb_object_is_inert (buffer)))
|
|
|
|
return;
|
|
|
|
|
2009-12-20 15:25:18 +00:00
|
|
|
if (!unicode)
|
2011-07-25 20:30:32 +00:00
|
|
|
unicode = _hb_buffer_nil.unicode;
|
2009-12-20 15:25:18 +00:00
|
|
|
|
2009-11-03 20:15:07 +00:00
|
|
|
hb_unicode_funcs_reference (unicode);
|
|
|
|
hb_unicode_funcs_destroy (buffer->unicode);
|
|
|
|
buffer->unicode = unicode;
|
|
|
|
}
|
|
|
|
|
|
|
|
hb_unicode_funcs_t *
|
|
|
|
hb_buffer_get_unicode_funcs (hb_buffer_t *buffer)
|
|
|
|
{
|
|
|
|
return buffer->unicode;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
hb_buffer_set_direction (hb_buffer_t *buffer,
|
|
|
|
hb_direction_t direction)
|
|
|
|
|
|
|
|
{
|
2011-04-28 16:56:49 +00:00
|
|
|
if (unlikely (hb_object_is_inert (buffer)))
|
|
|
|
return;
|
|
|
|
|
2010-07-23 21:22:11 +00:00
|
|
|
buffer->props.direction = direction;
|
2009-11-03 20:15:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
hb_direction_t
|
|
|
|
hb_buffer_get_direction (hb_buffer_t *buffer)
|
|
|
|
{
|
2010-07-23 21:22:11 +00:00
|
|
|
return buffer->props.direction;
|
2009-11-03 20:15:07 +00:00
|
|
|
}
|
|
|
|
|
2009-11-05 01:29:54 +00:00
|
|
|
void
|
|
|
|
hb_buffer_set_script (hb_buffer_t *buffer,
|
|
|
|
hb_script_t script)
|
|
|
|
{
|
2011-04-28 16:56:49 +00:00
|
|
|
if (unlikely (hb_object_is_inert (buffer)))
|
|
|
|
return;
|
|
|
|
|
2010-07-23 21:22:11 +00:00
|
|
|
buffer->props.script = script;
|
2009-11-05 01:29:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
hb_script_t
|
|
|
|
hb_buffer_get_script (hb_buffer_t *buffer)
|
|
|
|
{
|
2010-07-23 21:22:11 +00:00
|
|
|
return buffer->props.script;
|
2009-11-05 01:29:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
hb_buffer_set_language (hb_buffer_t *buffer,
|
|
|
|
hb_language_t language)
|
|
|
|
{
|
2011-04-28 16:56:49 +00:00
|
|
|
if (unlikely (hb_object_is_inert (buffer)))
|
|
|
|
return;
|
|
|
|
|
2010-07-23 21:22:11 +00:00
|
|
|
buffer->props.language = language;
|
2009-11-05 01:29:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
hb_language_t
|
|
|
|
hb_buffer_get_language (hb_buffer_t *buffer)
|
|
|
|
{
|
2010-07-23 21:22:11 +00:00
|
|
|
return buffer->props.language;
|
2009-11-05 01:29:54 +00:00
|
|
|
}
|
|
|
|
|
2009-11-03 20:15:07 +00:00
|
|
|
|
2011-04-13 19:49:06 +00:00
|
|
|
void
|
|
|
|
hb_buffer_reset (hb_buffer_t *buffer)
|
2007-10-11 07:21:31 +00:00
|
|
|
{
|
2011-07-22 15:28:07 +00:00
|
|
|
buffer->reset ();
|
2007-10-11 07:21:31 +00:00
|
|
|
}
|
|
|
|
|
2010-05-15 03:20:16 +00:00
|
|
|
hb_bool_t
|
2011-04-15 22:34:45 +00:00
|
|
|
hb_buffer_pre_allocate (hb_buffer_t *buffer, unsigned int size)
|
2009-07-28 19:43:34 +00:00
|
|
|
{
|
2011-07-22 15:28:07 +00:00
|
|
|
return buffer->ensure (size);
|
2009-07-28 19:43:34 +00:00
|
|
|
}
|
|
|
|
|
2011-04-19 04:32:19 +00:00
|
|
|
hb_bool_t
|
|
|
|
hb_buffer_allocation_successful (hb_buffer_t *buffer)
|
|
|
|
{
|
|
|
|
return !buffer->in_error;
|
|
|
|
}
|
|
|
|
|
2009-05-20 09:35:14 +00:00
|
|
|
void
|
2011-04-19 04:38:01 +00:00
|
|
|
hb_buffer_add (hb_buffer_t *buffer,
|
|
|
|
hb_codepoint_t codepoint,
|
|
|
|
hb_mask_t mask,
|
|
|
|
unsigned int cluster)
|
2007-10-11 08:30:50 +00:00
|
|
|
{
|
2011-07-22 15:28:07 +00:00
|
|
|
buffer->add (codepoint, mask, cluster);
|
2011-07-21 04:58:29 +00:00
|
|
|
}
|
|
|
|
|
2011-04-13 19:49:06 +00:00
|
|
|
hb_bool_t
|
|
|
|
hb_buffer_set_length (hb_buffer_t *buffer,
|
|
|
|
unsigned int length)
|
|
|
|
{
|
2011-07-22 15:28:07 +00:00
|
|
|
if (!buffer->ensure (length))
|
2011-04-13 19:49:06 +00:00
|
|
|
return FALSE;
|
|
|
|
|
|
|
|
/* Wipe the new space */
|
|
|
|
if (length > buffer->len) {
|
|
|
|
memset (buffer->info + buffer->len, 0, sizeof (buffer->info[0]) * (length - buffer->len));
|
|
|
|
if (buffer->have_positions)
|
|
|
|
memset (buffer->pos + buffer->len, 0, sizeof (buffer->pos[0]) * (length - buffer->len));
|
|
|
|
}
|
|
|
|
|
|
|
|
buffer->len = length;
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
|
2009-08-02 02:19:06 +00:00
|
|
|
unsigned int
|
2009-11-06 20:13:17 +00:00
|
|
|
hb_buffer_get_length (hb_buffer_t *buffer)
|
2009-08-02 02:19:06 +00:00
|
|
|
{
|
2010-05-15 02:07:46 +00:00
|
|
|
return buffer->len;
|
2009-08-02 02:19:06 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Return value valid as long as buffer not modified */
|
|
|
|
hb_glyph_info_t *
|
2011-04-15 22:32:36 +00:00
|
|
|
hb_buffer_get_glyph_infos (hb_buffer_t *buffer,
|
|
|
|
unsigned int *length)
|
2009-08-02 02:19:06 +00:00
|
|
|
{
|
2011-04-15 22:32:36 +00:00
|
|
|
if (length)
|
|
|
|
*length = buffer->len;
|
|
|
|
|
2010-05-15 02:02:37 +00:00
|
|
|
return (hb_glyph_info_t *) buffer->info;
|
2009-08-02 02:19:06 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Return value valid as long as buffer not modified */
|
|
|
|
hb_glyph_position_t *
|
2011-04-15 22:32:36 +00:00
|
|
|
hb_buffer_get_glyph_positions (hb_buffer_t *buffer,
|
|
|
|
unsigned int *length)
|
2009-08-02 02:19:06 +00:00
|
|
|
{
|
2009-12-20 13:50:42 +00:00
|
|
|
if (!buffer->have_positions)
|
2011-07-22 15:28:07 +00:00
|
|
|
buffer->clear_positions ();
|
2009-08-02 02:19:06 +00:00
|
|
|
|
2011-04-15 22:32:36 +00:00
|
|
|
if (length)
|
|
|
|
*length = buffer->len;
|
|
|
|
|
2010-05-15 02:05:53 +00:00
|
|
|
return (hb_glyph_position_t *) buffer->pos;
|
2009-08-02 02:19:06 +00:00
|
|
|
}
|
2009-08-11 00:59:25 +00:00
|
|
|
|
2009-11-07 00:48:16 +00:00
|
|
|
void
|
|
|
|
hb_buffer_reverse (hb_buffer_t *buffer)
|
|
|
|
{
|
2011-07-22 15:28:07 +00:00
|
|
|
buffer->reverse ();
|
2009-11-07 00:48:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
hb_buffer_reverse_clusters (hb_buffer_t *buffer)
|
|
|
|
{
|
2011-07-22 15:28:07 +00:00
|
|
|
buffer->reverse_clusters ();
|
2009-11-07 00:48:16 +00:00
|
|
|
}
|
|
|
|
|
2009-08-11 02:47:57 +00:00
|
|
|
#define ADD_UTF(T) \
|
|
|
|
HB_STMT_START { \
|
|
|
|
const T *next = (const T *) text + item_offset; \
|
|
|
|
const T *end = next + item_length; \
|
|
|
|
while (next < end) { \
|
|
|
|
hb_codepoint_t u; \
|
|
|
|
const T *old_next = next; \
|
|
|
|
next = UTF_NEXT (next, end, u); \
|
2011-04-19 04:38:01 +00:00
|
|
|
hb_buffer_add (buffer, u, 1, old_next - (const T *) text); \
|
2009-08-11 02:47:57 +00:00
|
|
|
} \
|
|
|
|
} HB_STMT_END
|
|
|
|
|
|
|
|
|
|
|
|
#define UTF8_COMPUTE(Char, Mask, Len) \
|
|
|
|
if (Char < 128) { Len = 1; Mask = 0x7f; } \
|
|
|
|
else if ((Char & 0xe0) == 0xc0) { Len = 2; Mask = 0x1f; } \
|
|
|
|
else if ((Char & 0xf0) == 0xe0) { Len = 3; Mask = 0x0f; } \
|
|
|
|
else if ((Char & 0xf8) == 0xf0) { Len = 4; Mask = 0x07; } \
|
|
|
|
else Len = 0;
|
|
|
|
|
|
|
|
static inline const uint8_t *
|
|
|
|
hb_utf8_next (const uint8_t *text,
|
|
|
|
const uint8_t *end,
|
|
|
|
hb_codepoint_t *unicode)
|
|
|
|
{
|
|
|
|
uint8_t c = *text;
|
|
|
|
unsigned int mask, len;
|
|
|
|
|
2011-04-28 23:37:51 +00:00
|
|
|
/* TODO check for overlong sequences? */
|
2010-05-27 18:04:15 +00:00
|
|
|
|
2009-08-11 02:47:57 +00:00
|
|
|
UTF8_COMPUTE (c, mask, len);
|
2010-05-04 02:51:19 +00:00
|
|
|
if (unlikely (!len || (unsigned int) (end - text) < len)) {
|
2009-08-11 02:47:57 +00:00
|
|
|
*unicode = -1;
|
|
|
|
return text + 1;
|
|
|
|
} else {
|
|
|
|
hb_codepoint_t result;
|
|
|
|
unsigned int i;
|
|
|
|
result = c & mask;
|
|
|
|
for (i = 1; i < len; i++)
|
|
|
|
{
|
2010-05-04 02:51:19 +00:00
|
|
|
if (unlikely ((text[i] & 0xc0) != 0x80))
|
2009-08-11 02:47:57 +00:00
|
|
|
{
|
|
|
|
*unicode = -1;
|
|
|
|
return text + 1;
|
|
|
|
}
|
|
|
|
result <<= 6;
|
|
|
|
result |= (text[i] & 0x3f);
|
|
|
|
}
|
|
|
|
*unicode = result;
|
|
|
|
return text + len;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
hb_buffer_add_utf8 (hb_buffer_t *buffer,
|
|
|
|
const char *text,
|
2010-04-29 17:56:44 +00:00
|
|
|
unsigned int text_length HB_UNUSED,
|
2009-08-11 02:47:57 +00:00
|
|
|
unsigned int item_offset,
|
|
|
|
unsigned int item_length)
|
|
|
|
{
|
|
|
|
#define UTF_NEXT(S, E, U) hb_utf8_next (S, E, &(U))
|
|
|
|
ADD_UTF (uint8_t);
|
|
|
|
#undef UTF_NEXT
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline const uint16_t *
|
|
|
|
hb_utf16_next (const uint16_t *text,
|
|
|
|
const uint16_t *end,
|
|
|
|
hb_codepoint_t *unicode)
|
|
|
|
{
|
|
|
|
uint16_t c = *text++;
|
|
|
|
|
2010-05-04 02:51:19 +00:00
|
|
|
if (unlikely (c >= 0xd800 && c < 0xdc00)) {
|
2009-08-11 02:47:57 +00:00
|
|
|
/* high surrogate */
|
|
|
|
uint16_t l;
|
2011-04-13 19:02:40 +00:00
|
|
|
if (text < end && ((l = *text), likely (l >= 0xdc00 && l < 0xe000))) {
|
2009-08-11 02:47:57 +00:00
|
|
|
/* low surrogate */
|
|
|
|
*unicode = ((hb_codepoint_t) ((c) - 0xd800) * 0x400 + (l) - 0xdc00 + 0x10000);
|
|
|
|
text++;
|
|
|
|
} else
|
|
|
|
*unicode = -1;
|
|
|
|
} else
|
|
|
|
*unicode = c;
|
|
|
|
|
|
|
|
return text;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
hb_buffer_add_utf16 (hb_buffer_t *buffer,
|
|
|
|
const uint16_t *text,
|
2010-04-29 17:56:44 +00:00
|
|
|
unsigned int text_length HB_UNUSED,
|
2009-08-11 02:47:57 +00:00
|
|
|
unsigned int item_offset,
|
|
|
|
unsigned int item_length)
|
|
|
|
{
|
|
|
|
#define UTF_NEXT(S, E, U) hb_utf16_next (S, E, &(U))
|
|
|
|
ADD_UTF (uint16_t);
|
|
|
|
#undef UTF_NEXT
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
hb_buffer_add_utf32 (hb_buffer_t *buffer,
|
|
|
|
const uint32_t *text,
|
2010-04-29 17:56:44 +00:00
|
|
|
unsigned int text_length HB_UNUSED,
|
2009-08-11 02:47:57 +00:00
|
|
|
unsigned int item_offset,
|
|
|
|
unsigned int item_length)
|
|
|
|
{
|
|
|
|
#define UTF_NEXT(S, E, U) ((U) = *(S), (S)+1)
|
|
|
|
ADD_UTF (uint32_t);
|
|
|
|
#undef UTF_NEXT
|
|
|
|
}
|
2010-07-23 19:11:18 +00:00
|
|
|
|
|
|
|
|