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
326 char *to;
334 for (to = *toP, from = *fromP; from != fromLim; from++, to++)
335 *to = *from;
337 *toP = to;
345 unsigned short *to = *toP;
347 while (from != fromLim && to != toLim) {
350 *to++ = (unsigned short)(((from[0] & 0x1f) << 6) | (from[1] & 0x3f));
354 *to++ = (unsigned short)(((from[0] & 0xf) << 12)
361 if (to + 1 == toLim)
366 to[0] = (unsigned short)((n >> 10) | 0xD800);
367 to[1] = (unsigned short)((n & 0x3FF) | 0xDC00);
368 to += 2;
373 *to++ = *from++;
379 *toP = to;
690 /* CHAR_MATCHES is guaranteed to have MINBPC bytes available. */
831 /* CHAR_MATCHES is guaranteed to have MINBPC bytes available. */
1434 /* must match encodingNames up to here */
1489 encoding indices to encodings; INIT_ENC_INDEX(enc) is the index of
1587 way this can fail to be big-endian UTF-16 if it it's an