Searched defs:root (Results 1 - 20 of 20) sorted by relevance

/net/bridge/
H A Dbr_private_stp.h35 bridge_id root; member in struct:br_config_bpdu
H A Dbr_stp.c112 br_notice(br, "port %u(%s) tried to become root port (blocked)",
181 bpdu.root = br->designated_root;
188 struct net_bridge_port *root local
190 bpdu.message_age = (jiffies - root->designated_age)
210 p->designated_root = bpdu->root;
239 br_notice(br, "root port %u not found for topology notice\n",
292 t = memcmp(&bpdu->root, &p->designated_root, 8);
/net/
H A Dsysctl_net.c30 net_ctl_header_lookup(struct ctl_table_root *root, struct nsproxy *namespaces) argument
48 /* Allow network administrator to have same access as root. */
54 /* Allow netns root group to have the same access as the root group */
/net/netfilter/
H A Dnft_rbtree.c24 struct rb_root root; member in struct:nft_rbtree
40 const struct rb_node *parent = priv->root.rb_node;
94 p = &priv->root.rb_node;
107 rb_insert_color(&new->node, &priv->root);
149 rb_erase(&rbe->node, &priv->root);
157 const struct rb_node *parent = priv->root.rb_node;
194 for (node = rb_first(&priv->root); node != NULL; node = rb_next(node)) {
227 priv->root = RB_ROOT;
237 while ((node = priv->root.rb_node) != NULL) {
238 rb_erase(node, &priv->root);
[all...]
H A Dxt_connlimit.c187 static void tree_nodes_free(struct rb_root *root, argument
195 rb_erase(&rbconn->node, root);
201 count_tree(struct net *net, struct rb_root *root, argument
216 rbnode = &(root->rb_node);
234 tree_nodes_free(root, gc_nodes, gc_count);
255 tree_nodes_free(root, gc_nodes, gc_count);
284 rb_insert_color(&rbconn->node, root);
295 struct rb_root *root; local
301 root = &data->climit_root6[hash];
304 root
[all...]
H A Dxt_qtaguid.c146 /* root pwnd */
159 /* root pwnd */
176 static struct tag_node *tag_node_tree_search(struct rb_root *root, tag_t tag) argument
178 struct rb_node *node = root->rb_node;
199 static void tag_node_tree_insert(struct tag_node *data, struct rb_root *root) argument
201 struct rb_node **new = &(root->rb_node), *parent = NULL;
223 rb_insert_color(&data->node, root);
226 static void tag_stat_tree_insert(struct tag_stat *data, struct rb_root *root) argument
228 tag_node_tree_insert(&data->tn, root);
231 static struct tag_stat *tag_stat_tree_search(struct rb_root *root, tag_ argument
239 tag_counter_set_tree_insert(struct tag_counter_set *data, struct rb_root *root) argument
245 tag_counter_set_tree_search(struct rb_root *root, tag_t tag) argument
255 tag_ref_tree_insert(struct tag_ref *data, struct rb_root *root) argument
260 tag_ref_tree_search(struct rb_root *root, tag_t tag) argument
268 sock_tag_tree_search(struct rb_root *root, const struct sock *sk) argument
286 sock_tag_tree_insert(struct sock_tag *data, struct rb_root *root) argument
328 proc_qtu_data_tree_search(struct rb_root *root, const pid_t pid) argument
347 proc_qtu_data_tree_insert(struct proc_qtu_data *data, struct rb_root *root) argument
371 uid_tag_data_tree_insert(struct uid_tag_data *data, struct rb_root *root) argument
395 uid_tag_data_tree_search(struct rb_root *root, uid_t uid) argument
[all...]
/net/sched/
H A Dcls_cgroup.c32 struct cls_cgroup_head *head = rcu_dereference_bh(tp->root);
83 static void cls_cgroup_destroy_rcu(struct rcu_head *root) argument
85 struct cls_cgroup_head *head = container_of(root,
100 struct cls_cgroup_head *head = rtnl_dereference(tp->root);
145 rcu_assign_pointer(tp->root, new);
156 struct cls_cgroup_head *head = rtnl_dereference(tp->root);
159 RCU_INIT_POINTER(tp->root, NULL);
171 struct cls_cgroup_head *head = rtnl_dereference(tp->root);
187 struct cls_cgroup_head *head = rtnl_dereference(tp->root);
H A Dsch_fq.c175 struct rb_root *root,
182 p = &root->rb_node;
209 rb_erase(&f->fq_node, root);
218 struct rb_root *root; local
232 root = &q->fq_root[hash_32((u32)(long)sk, q->fq_trees_log)];
236 fq_gc(q, root, sk);
238 p = &root->rb_node;
276 rb_insert_color(&f->fq_node, root);
503 struct rb_root *root; local
516 root
174 fq_gc(struct fq_sched_data *q, struct rb_root *root, struct sock *sk) argument
[all...]
H A Dsch_api.c256 (root qdisc, all its children, children of children etc.)
259 static struct Qdisc *qdisc_match_from_root(struct Qdisc *root, u32 handle) argument
263 if (!(root->flags & TCQ_F_BUILTIN) &&
264 root->handle == handle)
265 return root;
267 list_for_each_entry(q, &root->list, list) {
277 struct Qdisc *root = qdisc_dev(q)->qdisc; local
279 WARN_ON_ONCE(root == &noop_qdisc);
280 list_add_tail(&q->list, &root->list);
1419 static int tc_dump_qdisc_root(struct Qdisc *root, struc argument
1750 tc_dump_tclass_root(struct Qdisc *root, struct sk_buff *skb, struct tcmsg *tcm, struct netlink_callback *cb, int *t_p, int s_t) argument
[all...]
H A Dsch_hfsc.c177 struct hfsc_class root; /* root class */ member in struct:hfsc_sched
310 /* if root-class's cfmin is bigger than cur_time nothing to do */
1049 parent = &q->root;
1120 if (cl != &q->root)
1130 if (cl->level > 0 || cl->filter_cnt > 0 || cl == &q->root)
1166 head = &q->root;
1167 tcf = rcu_dereference_bh(q->root.filter_list);
1298 cl = &q->root;
1425 if (q->root
[all...]
H A Dsch_htb.c52 Each class is assigned level. Leaf has ALWAYS level 0 and root
269 static void htb_add_to_id_tree(struct rb_root *root, argument
272 struct rb_node **p = &root->rb_node, *parent = NULL;
285 rb_insert_color(&cl->node[prio], root);
350 static void htb_safe_rb_erase(struct rb_node *rb, struct rb_root *root) argument
355 rb_erase(rb, root);
759 struct rb_node *root; member in struct:__anon155
765 sp->root = hprio->row.rb_node;
775 htb_id_find_next_upper(prio, sp->root, *sp->pid);
781 *sp->pptr = sp->root;
[all...]
/net/bridge/netfilter/
H A Debt_stp.c30 uint8_t root[8]; member in struct:stp_config_pdu
56 v16 = NR16(stpc->root);
64 verdict |= (stpc->root[2+i] ^ c->root_addr[i]) &
/net/ipv4/
H A Dinetpeer.c73 bp->root = peer_avl_empty_rcu;
188 *stackptr++ = &_base->root; \
189 for (u = rcu_deref_locked(_base->root, _base); \
214 struct inet_peer *u = rcu_dereference(base->root);
545 struct inet_peer *root; local
549 root = rcu_deref_locked(base->root, base);
550 if (root != peer_avl_empty) {
551 base->root = peer_avl_empty_rcu;
553 call_rcu(&root
[all...]
/net/netfilter/ipset/
H A Dip_set_hash_netiface.c49 rbtree_destroy(struct rb_root *root) argument
53 rbtree_postorder_for_each_entry_safe(node, next, root, node)
56 *root = RB_ROOT;
60 iface_test(struct rb_root *root, const char **iface) argument
62 struct rb_node *n = root->rb_node;
81 iface_add(struct rb_root *root, const char **iface) argument
83 struct rb_node **n = &(root->rb_node), *p = NULL;
107 rb_insert_color(&d->node, root);
/net/rds/
H A Drdma.c66 static struct rds_mr *rds_mr_tree_walk(struct rb_root *root, u64 key, argument
69 struct rb_node **p = &root->rb_node;
87 rb_insert_color(&insert->r_rb_node, root);
/net/ceph/
H A Dosdmap.c367 struct rb_root *root)
369 struct rb_node **p = &root->rb_node;
388 rb_insert_color(&new->node, root);
392 static struct ceph_pg_mapping *__lookup_pg_mapping(struct rb_root *root, argument
395 struct rb_node *n = root->rb_node;
415 static int __remove_pg_mapping(struct rb_root *root, struct ceph_pg pgid) argument
417 struct ceph_pg_mapping *pg = __lookup_pg_mapping(root, pgid);
422 rb_erase(&pg->node, root);
433 static int __insert_pg_pool(struct rb_root *root, struct ceph_pg_pool_info *new) argument
435 struct rb_node **p = &root
366 __insert_pg_mapping(struct ceph_pg_mapping *new, struct rb_root *root) argument
455 __lookup_pg_pool(struct rb_root *root, u64 id) argument
507 __remove_pg_pool(struct rb_root *root, struct ceph_pg_pool_info *pi) argument
[all...]
/net/ipv4/netfilter/
H A Dip_tables.c258 const struct ipt_entry *root; local
265 root = get_entry(table_base, private->hook_entry[hook]);
270 xt_entry_foreach(iter, root, private->size - private->hook_entry[hook])
/net/ipv6/
H A Dip6_fib.c315 w->root = &table->tb6_root;
326 cb->args[5] = w->root->fn_sernum;
329 if (cb->args[5] != w->root->fn_sernum) {
330 /* Begin at the root if the tree changed */
331 cb->args[5] = w->root->fn_sernum;
333 w->node = w->root;
421 static struct fib6_node *fib6_add_1(struct fib6_node *root, argument
436 fn = root;
841 int fib6_add(struct fib6_node *root, struct rt6_info *rt, struct nl_info *info, argument
859 fn = fib6_add_1(root,
992 fib6_lookup_1(struct fib6_node *root, struct lookup_args *args) argument
1055 fib6_lookup(struct fib6_node *root, const struct in6_addr *daddr, const struct in6_addr *saddr) argument
1088 fib6_locate_1(struct fib6_node *root, const struct in6_addr *addr, int plen, int offset) argument
1118 fib6_locate(struct fib6_node *root, const struct in6_addr *daddr, int dst_len, const struct in6_addr *saddr, int src_len) argument
1563 fib6_clean_tree(struct net *net, struct fib6_node *root, int (*func)(struct rt6_info *, void *arg), bool prune, int sernum, void *arg) argument
[all...]
/net/ipv6/netfilter/
H A Dip6_tables.c284 const struct ip6t_entry *root; local
291 root = get_entry(table_base, private->hook_entry[hook]);
296 xt_entry_foreach(iter, root, private->size - private->hook_entry[hook])
/net/sunrpc/
H A Drpc_pipe.c1319 * @root: root of the rpc_pipefs filesystem
1326 rpc_gssd_dummy_populate(struct dentry *root, struct rpc_pipe *pipe_data) argument
1336 gssd_dentry = d_hash_and_lookup(root, &q);
1388 struct dentry *root, *gssd_dentry; local
1401 sb->s_root = root = d_make_root(inode);
1402 if (!root)
1404 if (rpc_populate(root, files, RPCAUTH_lockd, RPCAUTH_RootEOF, NULL))
1407 gssd_dentry = rpc_gssd_dummy_populate(root, sn->gssd_dummy);
1409 __rpc_depopulate(root, file
[all...]

Completed in 250 milliseconds