Lines Matching defs:leaf
220 * node, otherwise it is a leaf node
245 * leaf[0]: The unicode version, stored as a generation number that is
249 * leaf[1]: Canonical Combining Class. During normalization, we need
257 * leaf[2]: Decomposition. If leaf[1] == 255, then leaf[2] is the
289 /* Size of the synthesized leaf used for Hangul syllable decomposition. */
364 /* Fill in base of leaf. */
388 * Returns the leaf if one exists, NULL otherwise.
466 * Returns the leaf if one exists, NULL otherwise.
484 utf8leaf_t *leaf;
493 leaf = utf8lookup(data, hangul, s);
494 if (!leaf)
497 leaf_age = utf8agetab[LEAF_GEN(leaf)];
514 utf8leaf_t *leaf;
523 leaf = utf8lookup(data, hangul, s);
524 if (!leaf)
526 leaf_age = utf8agetab[LEAF_GEN(leaf)];
542 utf8leaf_t *leaf;
551 leaf = utf8nlookup(data, hangul, s, len);
552 if (!leaf)
554 leaf_age = utf8agetab[LEAF_GEN(leaf)];
571 utf8leaf_t *leaf;
580 leaf = utf8nlookup(data, hangul, s, len);
581 if (!leaf)
583 leaf_age = utf8agetab[LEAF_GEN(leaf)];
602 utf8leaf_t *leaf;
609 leaf = utf8lookup(data, hangul, s);
610 if (!leaf)
612 if (utf8agetab[LEAF_GEN(leaf)] > data->maxage)
614 else if (LEAF_CCC(leaf) == DECOMPOSE)
615 ret += strlen(LEAF_STR(leaf));
631 utf8leaf_t *leaf;
638 leaf = utf8nlookup(data, hangul, s, len);
639 if (!leaf)
641 if (utf8agetab[LEAF_GEN(leaf)] > data->maxage)
643 else if (LEAF_CCC(leaf) == DECOMPOSE)
644 ret += strlen(LEAF_STR(leaf));
735 utf8leaf_t *leaf;
762 leaf = utf8lookup(u8c->data, u8c->hangul, u8c->s);
764 leaf = utf8nlookup(u8c->data, u8c->hangul,
768 /* No leaf found implies that the input is a binary blob. */
769 if (!leaf)
772 ccc = LEAF_CCC(leaf);
774 if (utf8agetab[LEAF_GEN(leaf)] > u8c->data->maxage) {
779 u8c->s = LEAF_STR(leaf);
788 leaf = utf8lookup(u8c->data, u8c->hangul, u8c->s);
789 if (!leaf)
791 ccc = LEAF_CCC(leaf);