Lines Matching refs:n_bits
32 size_t n_bits;
38 size_t n_bits);
42 size_t n_bits)
47 n = (n_bits + 7) / 8;
50 node = tlpm_match(list, key, n_bits);
51 if (node && node->n_bits == n_bits) {
56 /* add new entry with @key/@n_bits to @list and return new head */
62 node->n_bits = n_bits;
82 size_t n_bits)
87 /* Perform longest prefix-match on @key/@n_bits. That is, iterate all
94 for (i = 0; i < n_bits && i < list->n_bits; ++i) {
100 if (i >= list->n_bits) {
101 if (!best || i > best->n_bits)
111 size_t n_bits)
113 struct tlpm_node *best = tlpm_match(list, key, n_bits);
116 if (!best || best->n_bits != n_bits)
187 l2 = tlpm_add(l2, t1->key, t1->n_bits);
197 assert(t1->n_bits == t2->n_bits);
198 for (j = 0; j < t1->n_bits; ++j)
271 assert(t->n_bits == value[keysize]);
272 for (j = 0; j < t->n_bits; ++j)
287 key->prefixlen = list->n_bits;
291 list = tlpm_delete(list, list->key, list->n_bits);
308 assert(t->n_bits == value[keysize]);
309 for (j = 0; j < t->n_bits; ++j)