Lines Matching defs:table
31 /* table structure used for exact-match classification of selectors */
52 * inserts id into table with filter_id as the value
62 hash_table table = taid->table;
75 if (((table[x].key == key) && (table[x].info == 1)) ||
76 (table[x].info == 0)) {
77 table[x].key = key;
78 table[x].info = 1;
79 (void) ipgpc_list_insert(&table[x].elements, id);
80 } else if (table[x].next == NULL) {
81 table[x].next = kmem_cache_alloc(ht_node_cache, KM_SLEEP);
82 table[x].next->elements = NULL;
83 table[x].next->next = NULL;
84 table[x].next->key = key;
85 table[x].next->info = 1;
86 (void) ipgpc_list_insert(&table[x].next->elements, id);
88 p = table[x].next;
108 p->next = table[x].next;
109 table[x].next = p->next;
120 * ht_search(table, key)
123 * found in table. NULL is returned if key not found
126 ht_search(hash_table table, int key)
132 if ((table[x].key == key) && (table[x].info == 1)) {
133 return (table[x].elements);
135 p = table[x].next;
159 hash_table table = taid->table;
165 alist = ht_search(table, key);
195 * table
200 hash_table table = taid->table;
213 if ((table[x].key == key) && (table[x].info == 1)) {
214 if (table[x].elements != NULL) {
215 if (ipgpc_list_remove(&table[x].elements, id)) {
220 if (table[x].elements == NULL) {
222 if (table[x].next != NULL) {
223 table[x].elements = table[x].next->elements;
224 table[x].info = table[x].next->info;
225 table[x].key = table[x].next->key;
226 p = table[x].next; /* use p as temp */
227 table[x].next = table[x].next->next;
230 table[x].info = 0; /* mark entry as empty */
231 table[x].key = 0;
235 p = &table[x];