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

[subset-cff] Another handrolled memcpy

This commit is contained in:
Behdad Esfahbod 2022-11-22 12:46:25 -07:00
parent ae578705c2
commit c53c648127
1 changed files with 7 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
src/hb-subset-cff-common.hh
View File

@ -113,11 +113,10 @@ struct str_encoder_t
else if (unlikely (!buff.resize (offset + length))) else if (unlikely (!buff.resize (offset + length)))
return; return;
/* Since our strings are one or two bytes typically, /* Faster than memcpy for small strings. */
* this is faster than memcpy. */
for (unsigned i = 0; i < length; i++) for (unsigned i = 0; i < length; i++)
buff.arrayZ[i + offset] = str[i]; buff.arrayZ[i + offset] = str[i];
// memcpy (buff.arrayZ + offset, str, length); //hb_memcpy (buff.arrayZ + offset, str, length);
} }
bool is_error () const { return buff.in_error (); } bool is_error () const { return buff.in_error (); }
@ -183,9 +182,12 @@ struct cff_font_dict_op_serializer_t : op_serializer_t
} }
else else
{ {
HBUINT8 *d = c->allocate_size<HBUINT8> (opstr.length); unsigned char *d = c->allocate_size<unsigned char> (opstr.length);
if (unlikely (!d)) return_trace (false); if (unlikely (!d)) return_trace (false);
memcpy (d, opstr.ptr, opstr.length); /* Faster than memcpy for small strings. */
for (unsigned i = 0; i < opstr.length; i++)
d[i] = opstr.ptr[i];
//hb_memcpy (d, opstr.ptr, opstr.length);
} }
return_trace (true); return_trace (true);
} }