Lines Matching defs:to
52 the bottom 5 and 6 bits of the bytes. We need 8 bits to index into
53 pages, 3 bits to add to that index and 5 bits to generate the mask.
62 the bottom 4, 6 and 6 bits of the bytes. We need 8 bits to index
63 into pages, 3 bits to add to that index and 5 bits to generate the
327 char *to;
336 for (to = *toP, from = *fromP; (from < fromLim) && (to < toLim); from++, to++)
337 *to = *from;
339 *toP = to;
341 if ((to == toLim) && (from < fromLim))
353 unsigned short *to = *toP;
355 while (from < fromLim && to < toLim) {
362 *to++ = (unsigned short)(((from[0] & 0x1f) << 6) | (from[1] & 0x3f));
370 *to++ = (unsigned short)(((from[0] & 0xf) << 12)
377 if (toLim - to < 2) {
388 to[0] = (unsigned short)((n >> 10) | 0xD800);
389 to[1] = (unsigned short)((n & 0x3FF) | 0xDC00);
390 to += 2;
395 *to++ = *from++;
401 *toP = to;
578 fromLim = from + (((fromLim - from) >> 1) << 1); /* shrink to even */ \
650 fromLim = *fromP + (((fromLim - *fromP) >> 1) << 1); /* shrink to even */ \
740 /* CHAR_MATCHES is guaranteed to have MINBPC bytes available. */
881 /* CHAR_MATCHES is guaranteed to have MINBPC bytes available. */
1489 /* must match encodingNames up to here */
1544 encoding indices to encodings; INIT_ENC_INDEX(enc) is the index of
1642 way this can fail to be big-endian UTF-16 if it it's an
