Lines Matching defs:leaf
128 * node, otherwise it is a leaf node
153 * leaf[0]: The unicode version, stored as a generation number that is
157 * leaf[1]: Canonical Combining Class. During normalization, we need
165 * leaf[2]: Decomposition. If leaf[1] == 255, then leaf[2] is the
197 /* Size of the synthesized leaf used for Hangul syllable decomposition. */
272 /* Fill in base of leaf. */
296 * Returns the leaf if one exists, NULL otherwise.
372 * Returns the leaf if one exists, NULL otherwise.
389 utf8leaf_t *leaf;
394 leaf = utf8nlookup(um, n, hangul, s, len);
395 if (!leaf)
397 if (um->tables->utf8agetab[LEAF_GEN(leaf)] >
400 else if (LEAF_CCC(leaf) == DECOMPOSE)
401 ret += strlen(LEAF_STR(leaf));
473 utf8leaf_t *leaf;
500 leaf = utf8lookup(u8c->um, u8c->n, u8c->hangul, u8c->s);
502 leaf = utf8nlookup(u8c->um, u8c->n, u8c->hangul,
506 /* No leaf found implies that the input is a binary blob. */
507 if (!leaf)
510 ccc = LEAF_CCC(leaf);
512 if (u8c->um->tables->utf8agetab[LEAF_GEN(leaf)] >
518 u8c->s = LEAF_STR(leaf);
527 leaf = utf8lookup(u8c->um, u8c->n, u8c->hangul, u8c->s);
528 if (!leaf)
530 ccc = LEAF_CCC(leaf);