walkero
/
harfbuzz
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Minor

This commit is contained in:
Behdad Esfahbod 2012-01-16 17:03:55 -05:00
parent 4d3aeb8cb2
commit 370f03e9c6
2 changed files with 4 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
src/hb-ot-layout-gsub-table.hh
View File

@ -343,7 +343,6 @@ struct Ligature
inline bool apply (hb_apply_context_t *c) const inline bool apply (hb_apply_context_t *c) const
{ {
TRACE_APPLY (); TRACE_APPLY ();
unsigned int i;
unsigned int j = c->buffer->idx; unsigned int j = c->buffer->idx;
unsigned int count = component.len; unsigned int count = component.len;
unsigned int end = MIN (c->buffer->len, j + c->context_length); unsigned int end = MIN (c->buffer->len, j + c->context_length);
@ -353,7 +352,7 @@ struct Ligature
bool first_was_mark = (c->property & HB_OT_LAYOUT_GLYPH_CLASS_MARK); bool first_was_mark = (c->property & HB_OT_LAYOUT_GLYPH_CLASS_MARK);
bool found_non_mark = false; bool found_non_mark = false;
for (i = 1; i < count; i++) for (unsigned int i = 1; i < count; i++)
{ {
unsigned int property; unsigned int property;
do do
@ -392,7 +391,7 @@ struct Ligature
value it is later possible to check whether a specific value it is later possible to check whether a specific
component value really belongs to a given ligature. */ component value really belongs to a given ligature. */
for (i = 1; i < count; i++) for (unsigned int i = 1; i < count; i++)
{ {
while (_hb_ot_layout_skip_mark (c->face, &c->buffer->info[c->buffer->idx], c->lookup_props, NULL)) while (_hb_ot_layout_skip_mark (c->face, &c->buffer->info[c->buffer->idx], c->lookup_props, NULL))
{ {

6
src/hb-ot-layout-gsubgpos-private.hh
View File

@ -132,13 +132,12 @@ static inline bool match_input (hb_apply_context_t *c,
const void *match_data, const void *match_data,
unsigned int *context_length_out) unsigned int *context_length_out)
{ {
unsigned int i;
unsigned int j = c->buffer->idx; unsigned int j = c->buffer->idx;
unsigned int end = MIN (c->buffer->len, j + c->context_length); unsigned int end = MIN (c->buffer->len, j + c->context_length);
if (unlikely (j + count > end)) if (unlikely (j + count > end))
return false; return false;
for (i = 1; i < count; i++) for (unsigned int i = 1; i < count; i++)
{ {
do do
{ {
@ -187,11 +186,10 @@ static inline bool match_lookahead (hb_apply_context_t *c,
const void *match_data, const void *match_data,
unsigned int offset) unsigned int offset)
{ {
unsigned int i;
unsigned int j = c->buffer->idx + offset - 1; unsigned int j = c->buffer->idx + offset - 1;
unsigned int end = MIN (c->buffer->len, c->buffer->idx + c->context_length); unsigned int end = MIN (c->buffer->len, c->buffer->idx + c->context_length);
for (i = 0; i < count; i++) for (unsigned int i = 0; i < count; i++)
{ {
do do
{ {