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

/net/bridge/
H A Dbr_private_stp.h35 bridge_id root; member in struct:br_config_bpdu
H A Dbr_stp.c107 br_notice(br, "port %u(%s) tried to become root port (blocked)",
176 bpdu.root = br->designated_root;
183 struct net_bridge_port *root local
185 bpdu.message_age = (jiffies - root->designated_age)
205 p->designated_root = bpdu->root;
234 br_notice(br, "root port %u not found for topology notice\n",
287 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/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/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.c362 struct rb_root *root)
364 struct rb_node **p = &root->rb_node;
383 rb_insert_color(&new->node, root);
387 static struct ceph_pg_mapping *__lookup_pg_mapping(struct rb_root *root, argument
390 struct rb_node *n = root->rb_node;
410 static int __remove_pg_mapping(struct rb_root *root, struct ceph_pg pgid) argument
412 struct ceph_pg_mapping *pg = __lookup_pg_mapping(root, pgid);
417 rb_erase(&pg->node, root);
428 static int __insert_pg_pool(struct rb_root *root, struct ceph_pg_pool_info *new) argument
430 struct rb_node **p = &root
361 __insert_pg_mapping(struct ceph_pg_mapping *new, struct rb_root *root) argument
450 __lookup_pg_pool(struct rb_root *root, u64 id) argument
497 __remove_pg_pool(struct rb_root *root, struct ceph_pg_pool_info *pi) argument
[all...]
/net/ipv4/
H A Dinetpeer.c87 bp->root = peer_avl_empty_rcu;
228 *stackptr++ = &_base->root; \
229 for (u = rcu_deref_locked(_base->root, _base); \
254 struct inet_peer *u = rcu_dereference(base->root);
591 struct inet_peer *root; local
595 root = rcu_deref_locked(base->root, base);
596 if (root != peer_avl_empty) {
597 base->root = peer_avl_empty_rcu;
599 call_rcu(&root
[all...]
/net/netfilter/ipset/
H A Dip_set_hash_netiface.c46 rbtree_destroy(struct rb_root *root) argument
48 struct rb_node *p, *n = root->rb_node;
64 *root = RB_ROOT;
76 iface_test(struct rb_root *root, const char **iface) argument
78 struct rb_node *n = root->rb_node;
97 iface_add(struct rb_root *root, const char **iface) argument
99 struct rb_node **n = &(root->rb_node), *p = NULL;
123 rb_insert_color(&d->node, root);
/net/ipv6/
H A Dip6_fib.c322 w->root = &table->tb6_root;
333 cb->args[5] = w->root->fn_sernum;
336 if (cb->args[5] != w->root->fn_sernum) {
337 /* Begin at the root if the tree changed */
338 cb->args[5] = w->root->fn_sernum;
340 w->node = w->root;
428 static struct fib6_node * fib6_add_1(struct fib6_node *root, void *addr, argument
444 fn = root;
802 int fib6_add(struct fib6_node *root, struct rt6_info *rt, struct nl_info *info) argument
818 fn = fib6_add_1(root,
951 fib6_lookup_1(struct fib6_node *root, struct lookup_args *args) argument
1006 fib6_lookup(struct fib6_node *root, const struct in6_addr *daddr, const struct in6_addr *saddr) argument
1039 fib6_locate_1(struct fib6_node *root, const struct in6_addr *addr, int plen, int offset) argument
1069 fib6_locate(struct fib6_node *root, const struct in6_addr *daddr, int dst_len, const struct in6_addr *saddr, int src_len) argument
1499 fib6_clean_tree(struct net *net, struct fib6_node *root, int (*func)(struct rt6_info *, void *arg), int prune, void *arg) argument
[all...]
/net/sunrpc/
H A Drpc_pipe.c928 * @dentry: dentry from the rpc_pipefs root to the new directory
1110 struct dentry *root; local
1122 sb->s_root = root = d_make_root(inode);
1123 if (!root)
1125 if (rpc_populate(root, files, RPCAUTH_lockd, RPCAUTH_RootEOF, NULL))
1143 __rpc_depopulate(root, files, RPCAUTH_lockd, RPCAUTH_RootEOF);
/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/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/sched/
H A Dsch_api.c204 (root qdisc, all its children, children of children etc.)
207 static struct Qdisc *qdisc_match_from_root(struct Qdisc *root, u32 handle) argument
211 if (!(root->flags & TCQ_F_BUILTIN) &&
212 root->handle == handle)
213 return root;
215 list_for_each_entry(q, &root->list, list) {
1287 static int tc_dump_qdisc_root(struct Qdisc *root, struct sk_buff *skb, argument
1294 if (!root)
1297 q = root;
1307 list_for_each_entry(q, &root
1618 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 */
1046 parent = &q->root;
1117 if (cl != &q->root)
1127 if (cl->level > 0 || cl->filter_cnt > 0 || cl == &q->root)
1163 head = &q->root;
1164 tcf = q->root.filter_list;
1295 cl = &q->root;
1424 if (q->root
[all...]
H A Dsch_htb.c52 Each class is assigned level. Leaf has ALWAYS level 0 and root
250 static void htb_add_to_id_tree(struct rb_root *root, argument
253 struct rb_node **p = &root->rb_node, *parent = NULL;
266 rb_insert_color(&cl->node[prio], root);
331 static void htb_safe_rb_erase(struct rb_node *rb, struct rb_root *root) argument
336 rb_erase(rb, root);
736 struct rb_node *root; member in struct:__anon151
742 sp->root = tree->rb_node;
752 htb_id_find_next_upper(prio, sp->root, *sp->pid);
758 *sp->pptr = sp->root;
[all...]
/net/netfilter/
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...]

Completed in 315 milliseconds