/linux-master/net/sched/ |
H A D | sch_hfsc.c | 170 struct hfsc_class root; /* root class */ member in struct:hfsc_sched 301 /* if root-class's cfmin is bigger than cur_time nothing to do */ 1016 parent = &q->root; 1073 if (!(parent->cl_flags & HFSC_FSC) && parent != &q->root) { 1099 if (cl != &q->root) 1111 cl == &q->root) { 1145 head = &q->root; 1146 tcf = rcu_dereference_bh(q->root.filter_list); 1264 cl = &q->root; [all...] |
H A D | sch_fq.c | 258 struct rb_root *root, 266 p = &root->rb_node; 292 rb_erase(&f->fq_node, root); 353 struct rb_root *root; local 395 root = &q->fq_root[hash_ptr(sk, q->fq_trees_log)]; 397 fq_gc(q, root, sk); 399 p = &root->rb_node; 448 rb_insert_color(&f->fq_node, root); 783 struct rb_root *root; local 797 root 257 fq_gc(struct fq_sched_data *q, struct rb_root *root, struct sock *sk) argument [all...] |
H A D | sch_api.c | 257 * (root qdisc, all its children, children of children etc.) 261 static struct Qdisc *qdisc_match_from_root(struct Qdisc *root, u32 handle) argument 265 if (!qdisc_dev(root)) 266 return (root->handle == handle ? root : NULL); 268 if (!(root->flags & TCQ_F_BUILTIN) && 269 root->handle == handle) 270 return root; 272 hash_for_each_possible_rcu(qdisc_dev(root)->qdisc_hash, q, hash, handle, 1363 NL_SET_ERR_MSG(extack, "Cannot attach rate estimator to a multi-queue root qdis 1798 tc_dump_qdisc_root(struct Qdisc *root, struct sk_buff *skb, struct netlink_callback *cb, int *q_idx_p, int s_q_idx, bool recur, bool dump_invisible) argument 2307 tc_dump_tclass_root(struct Qdisc *root, struct sk_buff *skb, struct tcmsg *tcm, struct netlink_callback *cb, int *t_p, int s_t, bool recur) argument [all...] |
H A D | cls_flower.c | 318 struct cls_fl_head *head = rcu_dereference_bh(tp->root); 363 rcu_assign_pointer(tp->root, head); 413 /* Flower classifier only changes root pointer during init and destroy. 415 * API, so tp->root pointer is protected from concurrent call to 418 return rcu_dereference_raw(tp->root); 541 struct cls_fl_head *head = rcu_dereference_bh(tp->root);
|
/linux-master/net/iucv/ |
H A D | iucv.c | 1818 .root = NULL, 1869 iucv_if.root = iucv_root;
|
/linux-master/net/ipv6/ |
H A D | ip6_fib.c | 474 w->root = &tb->tb6_root; 583 w->root = &table->tb6_root; 595 cb->args[5] = READ_ONCE(w->root->fn_sernum); 598 int sernum = READ_ONCE(w->root->fn_sernum); 600 /* Begin at the root if the tree changed */ 603 w->node = w->root; 749 struct fib6_node *root, 763 fn = root; 796 /* remove null_entry in the root node */ 1385 int fib6_add(struct fib6_node *root, struc argument 747 fib6_add_1(struct net *net, struct fib6_table *table, struct fib6_node *root, struct in6_addr *addr, int plen, int offset, int allow_create, int replace_required, struct netlink_ext_ack *extack) argument 1562 fib6_node_lookup_1(struct fib6_node *root, struct lookup_args *args) argument 1631 fib6_node_lookup(struct fib6_node *root, const struct in6_addr *daddr, const struct in6_addr *saddr) argument 1671 fib6_locate_1(struct fib6_node *root, const struct in6_addr *addr, int plen, int offset, bool exact_match) argument 1721 fib6_locate(struct fib6_node *root, const struct in6_addr *daddr, int dst_len, const struct in6_addr *saddr, int src_len, bool exact_match) argument 2238 fib6_clean_tree(struct net *net, struct fib6_node *root, int (*func)(struct fib6_info *, void *arg), int sernum, void *arg, bool skip_notify) argument [all...] |
/linux-master/net/ipv4/ |
H A D | tcp_input.c | 5288 struct rb_root *root) 5295 rb_erase(&skb->rbnode, root); 5304 void tcp_rbtree_insert(struct rb_root *root, struct sk_buff *skb) argument 5306 struct rb_node **p = &root->rb_node; 5319 rb_insert_color(&skb->rbnode, root); 5331 tcp_collapse(struct sock *sk, struct sk_buff_head *list, struct rb_root *root, argument 5347 skb = tcp_collapse_one(sk, skb, list, root); 5413 skb = tcp_collapse_one(sk, skb, list, root); 5426 tcp_rbtree_insert(root, skb); 5286 tcp_collapse_one(struct sock *sk, struct sk_buff *skb, struct sk_buff_head *list, struct rb_root *root) argument
|
H A D | inet_fragment.c | 267 unsigned int inet_frag_rbtree_purge(struct rb_root *root, argument 270 struct rb_node *p = rb_first(root); 277 rb_erase(&skb->rbnode, root);
|
/linux-master/net/core/ |
H A D | skbuff.c | 3892 * @root: root of the rbtree to empty 3900 unsigned int skb_rbtree_purge(struct rb_root *root) argument 3902 struct rb_node *p = rb_first(root); 3909 rb_erase(&skb->rbnode, root);
|
/linux-master/kernel/sched/ |
H A D | sched.h | 302 * each root domain; 310 * With respect to SMP, bandwidth is given on a per root domain basis, 313 * - total_bw is the currently allocated bandwidth in each root domain; 746 struct rb_root_cached root; member in struct:dl_rq 856 * We add the notion of a root-domain which will be used to define per-domain 859 * exclusive cpuset is created, we also create and attach a new root-domain
|
/linux-master/kernel/irq/ |
H A D | irqdomain.c | 218 * Hierarchical domains use the domain lock of the root domain 221 * For non-hierarchical domains (as for root domains), the root 222 * pointer is set to the domain itself so that &domain->root->mutex 226 domain->root = domain; 512 lockdep_assert_held(&domain->root->mutex); 528 * This also makes sure that all domains point to the same root when 531 lockdep_assert_held(&domain->root->mutex); 553 mutex_lock(&domain->root->mutex); 575 mutex_unlock(&domain->root 1980 irq_domain_debugfs_init(struct dentry *root) argument [all...] |
H A D | internals.h | 512 void irq_domain_debugfs_init(struct dentry *root); 514 static inline void irq_domain_debugfs_init(struct dentry *root) argument
|
/linux-master/kernel/bpf/ |
H A D | lpm_trie.c | 34 struct lpm_trie_node __rcu *root; member in struct:lpm_trie 59 * As the trie is empty initially, the new node (1) will be places as root 146 * The lookup starts at the root node. If the current node matches and if there 245 /* Start walking the trie from the root node ... */ 247 for (node = rcu_dereference_check(trie->root, rcu_read_lock_bh_held()); 356 * from the root and match as many bits as possible for each node until 360 slot = &trie->root; 375 /* If the slot is empty (a free child pointer or an empty root), 470 trim = &trie->root; 595 /* Always start at the root an [all...] |
H A D | helpers.c | 2016 #define bpf_rbtree_postorder_for_each_entry_safe(pos, n, root) \ 2017 for (pos = rb_first_postorder(root); \ 2024 struct rb_root_cached orig_root, *root = rb_root; local 2032 orig_root = *root; 2033 *root = RB_ROOT_CACHED; 2206 __bpf_kfunc struct bpf_rb_node *bpf_rbtree_remove(struct bpf_rb_root *root, argument 2210 struct rb_root_cached *r = (struct rb_root_cached *)root; 2213 /* node_internal->owner != root implies either RB_EMPTY_NODE(n) or 2216 if (READ_ONCE(node_internal->owner) != root) 2228 static int __bpf_rbtree_add(struct bpf_rb_root *root, argument 2262 bpf_rbtree_add_impl(struct bpf_rb_root *root, struct bpf_rb_node *node, bool (less)(struct bpf_rb_node *a, const struct bpf_rb_node *b), void *meta__ign, u64 off) argument 2272 bpf_rbtree_first(struct bpf_rb_root *root) argument [all...] |
/linux-master/include/trace/events/ |
H A D | btrfs.h | 198 TP_printk_btrfs("root=%llu(%s) gen=%llu", 227 BTRFS_I(inode)->root->root_key.objectid; 230 TP_printk_btrfs("root=%llu(%s) gen=%llu ino=%llu blocks=%llu " 282 TP_PROTO(const struct btrfs_root *root, const struct btrfs_inode *inode, 285 TP_ARGS(root, inode, map), 301 TP_fast_assign_btrfs(root->fs_info, 302 __entry->root_objectid = root->root_key.objectid; 313 TP_printk_btrfs("root=%llu(%s) ino=%llu start=%llu len=%llu " 388 TP_fast_assign_btrfs(bi->root->fs_info, 389 __entry->root_obj = bi->root [all...] |
/linux-master/include/net/ |
H A D | tcp.h | 2082 void tcp_rbtree_insert(struct rb_root *root, struct sk_buff *skb);
|
H A D | sch_generic.h | 92 #define TCQ_F_NOPARENT 0x40 /* root of its hierarchy : 192 * the qdisc root lock acquired. 409 void __rcu *root; member in struct:tcf_proto 567 struct Qdisc *root = qdisc_root_sleeping(qdisc); local 570 return qdisc_lock(root); 1079 /* Instead of calling kfree_skb() while root qdisc lock is held, 1127 /* we can reuse ->gso_skb because peek isn't called for root qdiscs */
|
H A D | ip6_fib.h | 359 struct fib6_node *root, *node; member in struct:fib6_walker 381 #define RTN_ROOT 0x0002 /* tree root node */ 453 struct fib6_node *fib6_node_lookup(struct fib6_node *root, 457 struct fib6_node *fib6_locate(struct fib6_node *root, 468 int fib6_add(struct fib6_node *root, struct fib6_info *rt,
|
/linux-master/include/linux/ |
H A D | seq_file.h | 174 const struct path *root, const char *esc);
|
H A D | namei.h | 45 #define LOOKUP_IN_ROOT 0x100000 /* Treat dirfd as fs root. */ 73 const struct path *root);
|
H A D | acpi.h | 1084 int acpi_ioapic_add(acpi_handle root); 1086 static inline int acpi_ioapic_add(acpi_handle root) { return 0; } argument
|
/linux-master/include/linux/mlx5/ |
H A D | driver.h | 218 struct dentry *root; member in struct:mlx5_rsc_debug 286 struct dentry *root; member in struct:mlx5_cmd_stats
|
/linux-master/fs/tracefs/ |
H A D | inode.c | 190 * If the root is not the mount point, then check the root's 393 struct super_block *sb = fc->root->d_sb; 404 static int tracefs_show_options(struct seq_file *m, struct dentry *root) argument 406 struct tracefs_fs_info *fsi = root->d_sb->s_fs_info; 539 /* If the parent is not specified, we create it in the root. 540 * We need the root dentry to do this, which is in the super 584 /* If parent is NULL then use root inode */ 588 /* Find the inode that is flagged as an instance or the root inode */ 605 * file will be created in the root o [all...] |
/linux-master/fs/ |
H A D | seq_file.c | 505 * Same as seq_path, but relative to supplied root. 508 const struct path *root, const char *esc) 517 p = __d_path(path, root, buf, size); 535 * returns the path of the 'dentry' from the root of its filesystem. 507 seq_path_root(struct seq_file *m, const struct path *path, const struct path *root, const char *esc) argument
|
/linux-master/fs/qnx6/ |
H A D | inode.c | 36 static int qnx6_show_options(struct seq_file *seq, struct dentry *root); 46 static int qnx6_show_options(struct seq_file *seq, struct dentry *root) argument 48 struct super_block *sb = root->d_sb; 58 struct super_block *sb = fc->root->d_sb; 176 * Check the root directory of the filesystem to make sure 185 struct inode *root = d_inode(s->s_root); local 186 struct address_space *mapping = root->i_mapping; 189 return "error reading root directory"; 199 return "error reading root directory."; 300 struct inode *root; local [all...] |