Lines Matching defs:codepoint
29 either of them ored with 0x40 if it has a codepoint
33 byte 3 LSB of codepoint (only if it has a codepoint)
34 byte 4 middle byte of codepoint (ditto)
35 byte 5 MSB of codepoint (ditto), ored with 0x80 if node has children
37 if it doesn't have a codepoint, the above 3 bytes are omitted
41 byte 9 0xff (only if node doesn't have a codepoint and doesn't
45 representing end of the prefix codepoint is 0xd800 + index into
68 struct entry { const char *name; unsigned long codepoint; };
106 unsigned long codepoint;
158 if (e1->codepoint < e2->codepoint)
160 if (e1->codepoint > e2->codepoint)
195 unsigned long codepoint;
202 codepoint = strtoul (line, &l, 16);
211 if (codepoint > MAX_CODE_POINT)
232 if (codepoint >= generated_ranges[i].low
233 && codepoint <= generated_ranges[i].max_high)
239 if (codepoint == generated_ranges[i].low
246 codepoint = GENERATED + generated_ranges[i].idx;
253 else if (codepoint == generated_ranges[i].max_high
263 codepoint, (int) (l - name), name);
265 else if (codepoint
275 if (codepoint != generated_ranges[i].low)
278 codepoint = GENERATED + generated_ranges[i].idx;
282 codepoint, (int) (l - name), name);
318 entries[num_entries++].codepoint = codepoint;
330 unsigned long codepoint)
346 n->codepoint = codepoint;
374 n->codepoint = (*p)->codepoint;
377 (*p)->codepoint = NO_VALUE;
416 if (n->codepoint != NO_VALUE)
426 n->child_off = n->size_sum + (n->codepoint == NO_VALUE
465 if (n->codepoint != NO_VALUE)
473 if (n->codepoint != NO_VALUE)
475 assert (n->codepoint < (1L << 21));
476 tree[off++] = n->codepoint & 0xff;
477 tree[off++] = (n->codepoint >> 8) & 0xff;
478 tree[off] = (n->codepoint >> 16) & 0xff;
491 if (n->codepoint == NO_VALUE
529 entries[i].codepoint);
655 /* Unicode name to codepoint.\n\
Indexes created Tue Sep 15 00:24:42 UTC 2026