| /include/linux/ |
| D | rbtree.h | 165 rb_add_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_add_cached() argument
168 struct rb_node **link = &tree->rb_root.rb_node; in rb_add_cached()
183 rb_insert_color_cached(node, tree, leftmost); in rb_add_cached()
195 rb_add(struct rb_node *node, struct rb_root *tree, in rb_add() argument
198 struct rb_node **link = &tree->rb_node; in rb_add()
210 rb_insert_color(node, tree); in rb_add()
223 rb_find_add(struct rb_node *node, struct rb_root *tree, in rb_find_add() argument
226 struct rb_node **link = &tree->rb_node; in rb_find_add()
243 rb_insert_color(node, tree); in rb_find_add()
259 rb_find_add_rcu(struct rb_node *node, struct rb_root *tree, in rb_find_add_rcu() argument
[all …]
|
| D | generic-radix-tree.h | 115 .tree = { \
130 struct __genradix tree; \
156 #define genradix_free(_radix) __genradix_free(&(_radix)->tree)
206 __genradix_ptr_inlined(&(_radix)->tree, \
220 __genradix_ptr(&(_radix)->tree, \
228 (__genradix_ptr_inlined(&(_radix)->tree, \
230 __genradix_ptr_alloc(&(_radix)->tree, \
236 (__genradix_ptr_inlined(&(_radix)->tree, \
238 __genradix_ptr_alloc(&(_radix)->tree, \
253 __genradix_ptr_alloc(&(_radix)->tree, \
[all …]
|
| D | rbtree_latch.h | 46 struct rb_root tree[2]; member
79 struct rb_root *root = <r->tree[idx]; in __lt_insert()
102 rb_erase(<n->node[idx], <r->tree[idx]); in __lt_erase()
109 struct rb_node *node = rcu_dereference_raw(ltr->tree[idx].rb_node); in __lt_find()
|
| D | vmpressure.h | 33 extern void vmpressure(gfp_t gfp, struct mem_cgroup *memcg, bool tree,
47 static inline void vmpressure(gfp_t gfp, struct mem_cgroup *memcg, bool tree, in vmpressure() argument
|
| D | maple_tree.h | 439 struct maple_tree *tree; /* The tree we're operating in */ member
468 #define mas_lock(mas) spin_lock(&((mas)->tree->ma_lock))
470 spin_lock_nested(&((mas)->tree->ma_lock), subclass)
471 #define mas_unlock(mas) spin_unlock(&((mas)->tree->ma_lock))
484 .tree = mt, \
503 #define MA_TOPIARY(name, tree) \ argument
507 .mtree = tree, \
544 static inline void mas_init(struct ma_state *mas, struct maple_tree *tree, in mas_init() argument
548 mas->tree = tree; in mas_init()
644 mt_dump((__mas)->tree, mt_dump_hex); \
[all …]
|
| D | rbtree_augmented.h | 64 rb_add_augmented_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_add_augmented_cached() argument
68 struct rb_node **link = &tree->rb_root.rb_node; in rb_add_augmented_cached()
84 rb_insert_augmented_cached(node, tree, leftmost, augment); in rb_add_augmented_cached()
|
| D | audit.h | 54 struct audit_tree *tree; /* associated watched tree */ member
|
| D | mm_types.h | 1174 .tree = &(__mm)->mm_mt, \
|
| D | perf_event.h | 952 struct rb_root tree; member
|
| D | netdevice.h | 256 struct rb_root tree; member
|
| /include/trace/events/ |
| D | btrfs.h | 2059 TP_PROTO(const struct extent_io_tree *tree,
2062 TP_ARGS(tree, start, len, set_bits),
2073 TP_fast_assign_btrfs(extent_io_tree_to_fs_info(tree),
2074 const struct btrfs_inode *inode = extent_io_tree_to_inode_const(tree);
2076 __entry->owner = tree->owner;
2092 TP_PROTO(const struct extent_io_tree *tree,
2095 TP_ARGS(tree, start, len, clear_bits),
2106 TP_fast_assign_btrfs(extent_io_tree_to_fs_info(tree),
2107 const struct btrfs_inode *inode = extent_io_tree_to_inode_const(tree);
2109 __entry->owner = tree->owner;
[all …]
|
| /include/net/ |
| D | pkt_cls.h | 508 struct tcf_ematch_tree *tree, in tcf_em_tree_match() argument
511 if (tree->hdr.nmatches) in tcf_em_tree_match()
512 return __tcf_em_tree_match(skb, tree, info); in tcf_em_tree_match()
|
| /include/drm/ |
| D | drm_gpuvm.h | 259 struct rb_root_cached tree; member
|