Lines Matching refs:bytes
73 const uint8_t *bytes, int32_t length,
79 const uint8_t *bytes, int32_t length);
83 const uint8_t *bytes, int32_t length,
89 const uint8_t *bytes, int32_t length,
111 printBytes(char *buffer, const uint8_t *bytes, int32_t length) {
114 *s++=hexDigit((uint8_t)(*bytes>>4));
115 *s++=hexDigit((uint8_t)(*bytes&0xf));
116 ++bytes;
222 /* allocate 1M * maxCharLength bytes for at most 1M mappings */
367 const uint8_t *bytes, int32_t length,
391 entry=mbcsData->ucm->states.stateTable[state][bytes[i++]];
395 (short)state, printBytes(buffer, bytes, length), (int)c);
402 fprintf(stderr, "error: byte sequence too long by %d bytes, final state %u: 0x%s (U+%x)\n",
403 (int)(length-i), state, printBytes(buffer, bytes, length), (int)c);
409 (int)c, printBytes(buffer, bytes, length));
413 (int)c, printBytes(buffer, bytes, length));
417 (int)c, printBytes(buffer, bytes, length));
432 (int)c, printBytes(buffer, bytes, length), (int)old);
436 (int)c, printBytes(buffer, bytes, length), (int)old);
452 mbcsData->ucm->states.stateTable[state][bytes[i-1]]=entry;
462 (int)c, printBytes(buffer, bytes, length), (int)old);
466 (int)c, printBytes(buffer, bytes, length), (int)old);
471 (int)c, printBytes(buffer, bytes, length));
500 (int)c, printBytes(buffer, bytes, length), (int)real);
504 (int)c, printBytes(buffer, bytes, length), (int)real);
538 (int)entry, printBytes(buffer, bytes, length), (int)c);
550 const uint8_t *bytes, int32_t length) {
553 return (UBool)(1==ucm_countChars(&mbcsData->ucm->states, bytes, length));
558 const uint8_t *bytes, int32_t /*length*/,
580 b=*bytes;
676 const uint8_t *bytes, int32_t length,
690 (!IGNORE_SISO_CHECK && (*bytes==0xe || *bytes==0xf))
693 (int)c, printBytes(buffer, bytes, length));
697 if(flag==1 && length==1 && *bytes==0) {
699 (int)c, *bytes);
732 (int)c, printBytes(buffer, bytes, length));
780 (int)c, printBytes(buffer, bytes, length));
783 /* each block has 16*maxCharLength bytes */
826 /* write the codepage bytes into stage 3 and get the previous bytes */
828 /* assemble the bytes into a single integer */
829 pb=bytes;
872 (int)c, printBytes(buffer, bytes, length), (int)old);
876 (int)c, printBytes(buffer, bytes, length), (int)old);
891 const uint8_t *bytes, int32_t length,
899 * - a multi-byte mapping with leading 0x00 bytes (no explicit length field)
904 (flag==1 && bytes[0]==0) || /* testing length==1 would be redundant with the next test */
905 (flag<=1 && length>1 && bytes[0]==0)
917 if(mbcsData->utf8Friendly && flag<=1 && c<=mbcsData->utf8Max && (bytes[0]==0 || flag==1)) {
934 /* we can assume that the table only contains 1:1 mappings with <=4 bytes each */
1016 isOK&=MBCSAddToUnicode(mbcsData, m->b.bytes, m->bLen, c, f);
1019 isOK&=MBCSSingleAddFromUnicode(mbcsData, m->b.bytes, m->bLen, c, f);
1020 } else if(MBCSOkForBaseFromUnicode(mbcsData, m->b.bytes, m->bLen, c, f)) {
1021 isOK&=MBCSAddFromUnicode(mbcsData, m->b.bytes, m->bLen, c, f);
1031 isOK&=MBCSSingleAddFromUnicode(mbcsData, m->b.bytes, m->bLen, c, f);
1032 } else if(MBCSOkForBaseFromUnicode(mbcsData, m->b.bytes, m->bLen, c, f)) {
1034 isOK&=MBCSAddFromUnicode(mbcsData, m->b.bytes, m->bLen, c, f);
1050 isOK&=MBCSAddToUnicode(mbcsData, m->b.bytes, m->bLen, c, f);
1084 /* test if all first bytes are in {0, 0x8e, 0x8f} */
1205 printf("compacting stage 2 from stage2Top=0x%lx to 0x%lx, saving %ld bytes\n",
1259 printf("compacting stage 3 from stage3Top=0x%lx to 0x%lx, saving %ld bytes\n",
1317 printf("compacting stage 2 from stage2Top=0x%lx to 0x%lx, saving %ld bytes\n",
1442 printf("+ total size savings: %lu bytes\n", (unsigned long)stage2Start*4+mbcsData->stage3Top);
1460 /* stage2Top/Length have counted 16-bit results, now we need to count bytes */
1461 /* also round up to a multiple of 4 bytes */
1464 /* stage3Top has counted 16-bit results, now we need to count bytes */
1475 /* stage2Top/Length have counted 32-bit results, now we need to count bytes */
1484 /* stage3Top has already counted bytes */
1558 /* return the number of bytes that should have been written */
