Searched refs:tree (Results 1 – 7 of 7) sorted by relevance
| /net/sched/ |
| A D | ematch.c | 165 return &tree->matches[index]; in tcf_em_get_match()
306 struct tcf_ematch_tree *tree) in tcf_em_tree_validate() argument
314 memset(tree, 0, sizeof(*tree)); in tcf_em_tree_validate()
338 if (tree->matches == NULL) in tcf_em_tree_validate()
362 em = tcf_em_get_match(tree, idx); in tcf_em_tree_validate()
386 tcf_em_tree_destroy(tree); in tcf_em_tree_validate()
404 if (tree->matches == NULL) in tcf_em_tree_destroy()
419 tree->hdr.nmatches = 0; in tcf_em_tree_destroy()
420 kfree(tree->matches); in tcf_em_tree_destroy()
421 tree->matches = NULL; in tcf_em_tree_destroy()
[all …]
|
| A D | Kconfig | 610 Size of the local stack variable used while evaluating the tree of
611 ematches. Limits the depth of the tree, i.e. the number of
|
| /net/netfilter/ |
| A D | nf_conncount.c | 304 static void schedule_gc_worker(struct nf_conncount_data *data, int tree) in schedule_gc_worker() argument
306 set_bit(tree, data->pending_trees); in schedule_gc_worker()
461 unsigned int tree, next_tree, gc_count = 0; in tree_gc_worker() local
463 tree = data->gc_tree % CONNCOUNT_SLOTS; in tree_gc_worker()
464 root = &data->root[tree]; in tree_gc_worker()
478 spin_lock_bh(&nf_conncount_locks[tree]); in tree_gc_worker()
500 clear_bit(tree, data->pending_trees); in tree_gc_worker()
502 next_tree = (tree + 1) % CONNCOUNT_SLOTS; in tree_gc_worker()
510 spin_unlock_bh(&nf_conncount_locks[tree]); in tree_gc_worker()
|
| /net/core/ |
| A D | dev_addr_lists.c | 24 struct rb_node **ins_point = &list->tree.rb_node, *parent = NULL; in __hw_addr_insert()
45 rb_insert_color(&new->node, &list->tree); in __hw_addr_insert()
78 struct rb_node **ins_point = &list->tree.rb_node, *parent = NULL; in __hw_addr_add_ex()
123 rb_insert_color(&ha->node, &list->tree); in __hw_addr_add_ex()
158 rb_erase(&ha->node, &list->tree); in __hw_addr_del_entry()
172 node = list->tree.rb_node; in __hw_addr_lookup()
488 list->tree = RB_ROOT; in __hw_addr_flush()
500 list->tree = RB_ROOT; in __hw_addr_init()
581 rb_erase(&ha->node, &dev->dev_addrs.tree); in dev_addr_mod()
|
| /net/tipc/ |
| A D | group.c | 199 struct rb_root *tree = &grp->members; in tipc_group_join() local
204 rbtree_postorder_for_each_entry_safe(m, tmp, tree, tree_node) { in tipc_group_join()
214 struct rb_root *tree = &grp->members; in tipc_group_delete() local
220 rbtree_postorder_for_each_entry_safe(m, tmp, tree, tree_node) { in tipc_group_delete()
|
| /net/bridge/ |
| A D | Kconfig | 16 networks of Ethernets using the IEEE 802.1 spanning tree algorithm.
|
| /net/sctp/ |
| A D | stream.c | 223 new->out.tree.root = NULL; in sctp_stream_update()
224 new->in.tree.root = NULL; in sctp_stream_update()
|
Completed in 15 milliseconds