Lines Matching refs:trie
29 #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 to the correct position */
289 /* assert that trie is path compressed */
303 /* assert that trie is path compressed */
345 c_node = tid->trie; /* point at root of trie */
352 /* traverse trie to the correct position */
393 * once id is found, it is removed from the trie.
394 * Upon removing the id from a given node in the trie, path compression
415 "exist in trie\n", id));
420 /* check if 0 values are inserted in this trie */
448 "exist in trie\n", id));
460 "not exist in trie\n", id));
597 * removes a value associated with an id from the trie
613 /* traverse to node containing id and remove the id from the trie */
615 c_node = tid->trie;
642 c_node = tid->trie; /* point at root of trie */
649 /* traverse trie to the correct position */
711 c_node = tid->trie; /* point at root of trie */
713 /* ensure trie structure is allocated */
789 c_node = tid->trie;
791 /* ensure trie structure is allocated */