Home
last modified time | relevance | path

Searched refs:tree (Results 1 – 13 of 13) sorted by relevance

/include/linux/
A Drbtree.h183 rb_insert_color_cached(node, tree, leftmost); in rb_add_cached()
198 struct rb_node **link = &tree->rb_node; in rb_add()
210 rb_insert_color(node, tree); in rb_add()
263 struct rb_node **link = &tree->rb_node; in rb_find_add()
280 rb_insert_color(node, tree); in rb_find_add()
299 struct rb_node **link = &tree->rb_node; in rb_find_add_rcu()
316 rb_insert_color(node, tree); in rb_find_add_rcu()
332 struct rb_node *node = tree->rb_node; in rb_find()
363 struct rb_node *node = tree->rb_node; in rb_find_rcu()
391 struct rb_node *node = tree->rb_node; in rb_find_first()
[all …]
A Dgeneric-radix-tree.h115 .tree = { \
130 struct __genradix 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, \
259 __genradix_ptr_alloc(&(_radix)->tree, \
[all …]
A Dvmpressure.h33 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
A Dmaple_tree.h439 struct maple_tree *tree; /* The tree we're operating in */ member
470 #define mas_lock(mas) spin_lock(&((mas)->tree->ma_lock))
472 spin_lock_nested(&((mas)->tree->ma_lock), subclass)
486 .tree = mt, \
507 #define MA_TOPIARY(name, tree) \ argument
511 .mtree = tree, \
552 mas->tree = tree; in mas_init()
648 mt_dump((__mas)->tree, mt_dump_hex); \
665 mt_dump((__wrmas)->mas->tree, mt_dump_hex); \
699 mt_dump((__mas)->tree, mt_dump_hex); \
[all …]
A Drbtree_latch.h46 struct rb_root tree[2]; member
79 struct rb_root *root = &ltr->tree[idx]; in __lt_insert()
102 rb_erase(&ltn->node[idx], &ltr->tree[idx]); in __lt_erase()
109 struct rb_node *node = rcu_dereference_raw(ltr->tree[idx].rb_node); in __lt_find()
A Drbtree_augmented.h64 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()
A Daudit.h54 struct audit_tree *tree; /* associated watched tree */ member
A Dmm_types.h1308 .tree = &(__mm)->mm_mt, \
A Dperf_event.h997 struct rb_root tree; member
A Dnetdevice.h258 struct rb_root tree; member
/include/trace/events/
A Dbtrfs.h2056 TP_PROTO(const struct extent_io_tree *tree,
2059 TP_ARGS(tree, start, len, set_bits),
2070 TP_fast_assign_btrfs(btrfs_extent_io_tree_to_fs_info(tree),
2073 __entry->owner = tree->owner;
2089 TP_PROTO(const struct extent_io_tree *tree,
2092 TP_ARGS(tree, start, len, clear_bits),
2103 TP_fast_assign_btrfs(btrfs_extent_io_tree_to_fs_info(tree),
2106 __entry->owner = tree->owner;
2122 TP_PROTO(const struct extent_io_tree *tree,
2125 TP_ARGS(tree, start, len, set_bits, clear_bits),
[all …]
/include/net/
A Dpkt_cls.h508 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/
A Ddrm_gpuvm.h259 struct rb_root_cached tree; member

Completed in 54 milliseconds