Searched refs:trie (Results 1 - 7 of 7) sorted by relevance

/illumos-gate/usr/src/uts/common/ipp/ipgpc/
H A Dclassifier-objects.h43 /* trie id's */
50 * IPv6 trie id's
164 /* trie node structure */
176 typedef node_p trie; typedef
212 /* identification structure for a trie */
214 trie trie; /* pointer to the trie structure */ member in struct:trie_id_s
215 krwlock_t rw_lock; /* lock protecting this trie */
H A Dfilters.c36 #include <ipp/ipgpc/trie.h>
49 trie_id_t ipgpc_trie_list[NUM_TRIES]; /* list of all trie structures ids */
56 kmem_cache_t *trie_node_cache = NULL; /* trie node cache */
74 static trie saddr_trie; /* IPv4 source address trie */
75 static trie daddr_trie; /* IPv4 destination address trie */
76 static trie sport_trie; /* source port trie */
77 static trie dport_tri
[all...]
H A Dtrie.c29 #include <ipp/ipgpc/trie.h>
34 /* trie data structure used for classifying IP addresses and TCP/UDP ports */
48 * generates a pointer to a new trie node
91 * trie A contains keys 111011, 0, 10
109 * trie A same as above, before insert
208 * inserts a new value, id, into the trie, tid->trie with the input key
230 c_node = tid->trie; /* point at trie root */
232 /* traverse trie t
[all...]
/illumos-gate/usr/src/lib/libast/common/regex/
H A Dregcomp.c209 triedrop(disc, e->re.trie.root[i]);
613 if ((env->stats.m += e->re.trie.min) < cm)
616 if ((env->stats.n += e->re.trie.max) < cn)
619 if (!env->stats.y || env->stats.y->re.trie.min < e->re.trie.min)
1919 if (!(t = g->re.trie.root[*s]) && !(t = g->re.trie.root[*s] = trienode(env, *s)))
1939 if (g->re.trie.min > len)
1940 g->re.trie.min = len;
1941 if (g->re.trie
1954 trie(Cenv_t* env, Rex_t* e, Rex_t* f) function
[all...]
H A Dregdecomp.c310 if (e->re.trie.root[c])
318 detrie(e->re.trie.root[c], sp, pfx, pfx, &pfx[sizeof(pfx)], delimiter);
H A Dreglib.h524 Trie_t trie; /* trie */ member in union:Rex_s::__anon2663
H A Dregnexec.c1733 if (((s + rex->re.trie.min) > env->end) || !(x = rex->re.trie.root[rex->map ? rex->map[*s] : *s]))

Completed in 94 milliseconds