Lines Matching defs:trie
242 * The leaves of the trie are embedded in the trie, and so the same
266 * The decompositions in the trie have been fully expanded, with the
271 * The trie is constructed in such a way that leaves exist for all
274 * lookup in the trie can be used to validate the UTF-8 input.
387 * Use trie to scan s, touching at most len bytes.
397 utf8trie_t *trie;
408 trie = utf8data + data->offset;
411 offlen = (*trie & OFFLEN) >> OFFLEN_SHIFT;
412 if (*trie & NEXTBYTE) {
417 mask = 1 << (*trie & BITNUM);
421 /* Right node at offset of trie */
422 node = (*trie & RIGHTNODE);
423 offset = trie[offlen];
426 offset |= trie[offlen];
428 trie += offset;
429 } else if (*trie & RIGHTPATH) {
431 node = (*trie & TRIENODE);
432 trie++;
441 node = (*trie & LEFTNODE);
442 trie += offlen + 1;
443 } else if (*trie & RIGHTPATH) {
448 node = (*trie & TRIENODE);
449 trie++;
459 if (LEAF_CCC(trie) == DECOMPOSE && LEAF_STR(trie)[0] == HANGUL)
460 trie = utf8hangul(s - 2, hangul);
461 return trie;
465 * Use trie to scan s.