Lines Matching refs:trie
167 * The leaves of the trie are embedded in the trie, and so the same
191 * The decompositions in the trie have been fully expanded, with the
196 * The trie is constructed in such a way that leaves exist for all
199 * lookup in the trie can be used to validate the UTF-8 input.
312 * Use trie to scan s, touching at most len bytes.
322 utf8trie_t *trie = NULL;
333 trie = utf8data + data->offset;
336 offlen = (*trie & OFFLEN) >> OFFLEN_SHIFT;
337 if (*trie & NEXTBYTE) {
342 mask = 1 << (*trie & BITNUM);
346 /* Right node at offset of trie */
347 node = (*trie & RIGHTNODE);
348 offset = trie[offlen];
351 offset |= trie[offlen];
353 trie += offset;
354 } else if (*trie & RIGHTPATH) {
356 node = (*trie & TRIENODE);
357 trie++;
366 node = (*trie & LEFTNODE);
367 trie += offlen + 1;
368 } else if (*trie & RIGHTPATH) {
373 node = (*trie & TRIENODE);
374 trie++;
384 if (LEAF_CCC(trie) == DECOMPOSE && LEAF_STR(trie)[0] == HANGUL)
385 trie = utf8hangul(s - 2, hangul);
386 return trie;
390 * Use trie to scan s.