| /tools/testing/radix-tree/ |
| D | regression3.c | 31 RADIX_TREE(root, GFP_KERNEL); in regression3_test()
40 radix_tree_insert(&root, 0, ptr0); in regression3_test()
41 radix_tree_tag_set(&root, 0, 0); in regression3_test()
44 radix_tree_for_each_tagged(slot, &root, &iter, 0, 0) { in regression3_test()
47 radix_tree_insert(&root, 1, ptr); in regression3_test()
48 radix_tree_tag_set(&root, 1, 0); in regression3_test()
57 radix_tree_delete(&root, 1); in regression3_test()
60 radix_tree_for_each_slot(slot, &root, &iter, 0) { in regression3_test()
63 radix_tree_insert(&root, 1, ptr); in regression3_test()
73 radix_tree_for_each_slot(slot, &root, &iter, 0) { in regression3_test()
[all …]
|
| D | test.h | 14 int item_insert(struct radix_tree_root *root, unsigned long index);
17 int item_delete(struct radix_tree_root *root, unsigned long index);
19 struct item *item_lookup(struct radix_tree_root *root, unsigned long index);
21 void item_check_present(struct radix_tree_root *root, unsigned long index);
22 void item_check_absent(struct radix_tree_root *root, unsigned long index);
23 void item_gang_check_present(struct radix_tree_root *root,
26 void item_full_scan(struct radix_tree_root *root, unsigned long start,
28 void item_kill_tree(struct radix_tree_root *root);
43 item_tag_set(struct radix_tree_root *root, unsigned long index, int tag);
45 item_tag_clear(struct radix_tree_root *root, unsigned long index, int tag);
[all …]
|
| D | test.c | 12 item_tag_set(struct radix_tree_root *root, unsigned long index, int tag) in item_tag_set() argument
14 return radix_tree_tag_set(root, index, tag); in item_tag_set()
18 item_tag_clear(struct radix_tree_root *root, unsigned long index, int tag) in item_tag_clear() argument
20 return radix_tree_tag_clear(root, index, tag); in item_tag_clear()
23 int item_tag_get(struct radix_tree_root *root, unsigned long index, int tag) in item_tag_get() argument
25 return radix_tree_tag_get(root, index, tag); in item_tag_get()
37 int item_insert(struct radix_tree_root *root, unsigned long index) in item_insert() argument
40 int err = radix_tree_insert(root, item->index, item); in item_insert()
61 int item_delete(struct radix_tree_root *root, unsigned long index) in item_delete() argument
63 struct item *item = radix_tree_delete(root, index); in item_delete()
[all …]
|
| D | benchmark.c | 14 static long long benchmark_iter(struct radix_tree_root *root, bool tagged) in benchmark_iter() argument
29 radix_tree_for_each_tagged(slot, root, &iter, 0, 0) in benchmark_iter()
32 radix_tree_for_each_slot(slot, root, &iter, 0) in benchmark_iter()
52 static void benchmark_insert(struct radix_tree_root *root, in benchmark_insert() argument
62 item_insert(root, index); in benchmark_insert()
73 static void benchmark_tagging(struct radix_tree_root *root, in benchmark_tagging() argument
83 radix_tree_tag_set(root, index, 0); in benchmark_tagging()
94 static void benchmark_delete(struct radix_tree_root *root, in benchmark_delete() argument
104 item_delete(root, index); in benchmark_delete()
|
| /tools/include/linux/ |
| D | rbtree.h | 39 #define RB_EMPTY_ROOT(root) (READ_ONCE((root)->rb_node) == NULL) argument
64 struct rb_root *root);
97 #define rbtree_postorder_for_each_entry_safe(pos, n, root, field) \ argument
98 for (pos = rb_entry_safe(rb_first_postorder(root), typeof(*pos), field); \
103 static inline void rb_erase_init(struct rb_node *n, struct rb_root *root) in rb_erase_init() argument
105 rb_erase(n, root); in rb_erase_init()
127 #define rb_first_cached(root) (root)->rb_leftmost argument
130 struct rb_root_cached *root, in rb_insert_color_cached() argument
134 root->rb_leftmost = node; in rb_insert_color_cached()
135 rb_insert_color(node, &root->rb_root); in rb_insert_color_cached()
[all …]
|
| D | rbtree_augmented.h | 35 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
49 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented() argument
52 __rb_insert_augmented(node, root, augment->rotate); in rb_insert_augmented()
57 struct rb_root_cached *root, bool newleft, in rb_insert_augmented_cached() argument
61 root->rb_leftmost = node; in rb_insert_augmented_cached()
62 rb_insert_augmented(node, &root->rb_root, augment); in rb_insert_augmented_cached()
172 struct rb_node *parent, struct rb_root *root) in __rb_change_child() argument
180 WRITE_ONCE(root->rb_node, new); in __rb_change_child()
183 extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
187 __rb_erase_augmented(struct rb_node *node, struct rb_root *root, in __rb_erase_augmented() argument
[all …]
|
| /tools/testing/selftests/cgroup/ |
| D | test_core.c | 27 static int test_cgcore_populated(const char *root) in test_cgcore_populated() argument
33 cg_test_a = cg_name(root, "cg_test_a"); in test_cgcore_populated()
34 cg_test_b = cg_name(root, "cg_test_a/cg_test_b"); in test_cgcore_populated()
35 cg_test_c = cg_name(root, "cg_test_a/cg_test_b/cg_test_c"); in test_cgcore_populated()
36 cg_test_d = cg_name(root, "cg_test_a/cg_test_b/cg_test_d"); in test_cgcore_populated()
68 if (cg_enter_current(root)) in test_cgcore_populated()
109 static int test_cgcore_invalid_domain(const char *root) in test_cgcore_invalid_domain() argument
114 grandparent = cg_name(root, "cg_test_grandparent"); in test_cgcore_invalid_domain()
115 parent = cg_name(root, "cg_test_grandparent/cg_test_parent"); in test_cgcore_invalid_domain()
116 child = cg_name(root, "cg_test_grandparent/cg_test_parent/cg_test_child"); in test_cgcore_invalid_domain()
[all …]
|
| D | test_freezer.c | 193 static int test_cgfreezer_simple(const char *root) in test_cgfreezer_simple() argument
199 cgroup = cg_name(root, "cg_test_simple"); in test_cgfreezer_simple()
245 static int test_cgfreezer_tree(const char *root) in test_cgfreezer_tree() argument
251 cgroup[0] = cg_name(root, "cg_test_tree_A"); in test_cgfreezer_tree()
417 static int test_cgfreezer_forkbomb(const char *root) in test_cgfreezer_forkbomb() argument
422 cgroup = cg_name(root, "cg_forkbomb_test"); in test_cgfreezer_forkbomb()
456 static int test_cgfreezer_mkdir(const char *root) in test_cgfreezer_mkdir() argument
462 parent = cg_name(root, "cg_test_mkdir_A"); in test_cgfreezer_mkdir()
510 static int test_cgfreezer_rmdir(const char *root) in test_cgfreezer_rmdir() argument
515 parent = cg_name(root, "cg_test_rmdir_A"); in test_cgfreezer_rmdir()
[all …]
|
| D | test_memcontrol.c | 27 static int test_memcg_subtree_control(const char *root) in test_memcg_subtree_control() argument
34 parent = cg_name(root, "memcg_test_0"); in test_memcg_subtree_control()
35 child = cg_name(root, "memcg_test_0/memcg_test_1"); in test_memcg_subtree_control()
52 parent2 = cg_name(root, "memcg_test_1"); in test_memcg_subtree_control()
53 child2 = cg_name(root, "memcg_test_1/memcg_test_1"); in test_memcg_subtree_control()
157 static int test_memcg_current(const char *root) in test_memcg_current() argument
163 memcg = cg_name(root, "memcg_test"); in test_memcg_current()
264 static int test_memcg_min(const char *root) in test_memcg_min() argument
277 parent[0] = cg_name(root, "memcg_test_0"); in test_memcg_min()
420 static int test_memcg_low(const char *root) in test_memcg_low() argument
[all …]
|
| D | cgroup_util.h | 18 extern int cg_find_unified_root(char *root, size_t len);
19 extern char *cg_name(const char *root, const char *name);
20 extern char *cg_name_indexed(const char *root, const char *name, int index);
|
| D | cgroup_util.c | 57 char *cg_name(const char *root, const char *name) in cg_name() argument
59 size_t len = strlen(root) + strlen(name) + 2; in cg_name()
62 snprintf(ret, len, "%s/%s", root, name); in cg_name()
67 char *cg_name_indexed(const char *root, const char *name, int index) in cg_name_indexed() argument
69 size_t len = strlen(root) + strlen(name) + 10; in cg_name_indexed()
72 snprintf(ret, len, "%s/%s_%d", root, name, index); in cg_name_indexed()
174 int cg_find_unified_root(char *root, size_t len) in cg_find_unified_root() argument
195 strncpy(root, mount, len); in cg_find_unified_root()
|
| /tools/perf/util/ |
| D | strfilter.c | 33 strfilter_node__delete(filter->root); in strfilter__delete()
84 struct strfilter_node root, *cur, *last_op; in strfilter_node__new() local
90 memset(&root, 0, sizeof(root)); in strfilter_node__new()
91 last_op = cur = &root; in strfilter_node__new()
106 if (!cur->r || !root.r) in strfilter_node__new()
108 cur = strfilter_node__alloc(OP_or, root.r, NULL); in strfilter_node__new()
111 root.r = cur; in strfilter_node__new()
147 return root.r; in strfilter_node__new()
152 strfilter_node__delete(root.r); in strfilter_node__new()
166 filter->root = strfilter_node__new(rules, &ep); in strfilter__new()
[all …]
|
| D | callchain.h | 165 static inline void callchain_init(struct callchain_root *root) in callchain_init() argument
167 INIT_LIST_HEAD(&root->node.val); in callchain_init()
168 INIT_LIST_HEAD(&root->node.parent_val); in callchain_init()
170 root->node.parent = NULL; in callchain_init()
171 root->node.hit = 0; in callchain_init()
172 root->node.children_hit = 0; in callchain_init()
173 root->node.rb_root_in = RB_ROOT; in callchain_init()
174 root->max_depth = 0; in callchain_init()
188 int callchain_append(struct callchain_root *root,
285 void free_callchain(struct callchain_root *root);
[all …]
|
| D | dsos.h | 19 struct rb_root root; /* rbtree root sorted by long name */ member
31 struct dso *__dsos__findnew_link_by_longname(struct rb_root *root, struct dso *dso, const char *nam…
33 static inline struct dso *__dsos__findnew_by_longname(struct rb_root *root, const char *name) in __dsos__findnew_by_longname() argument
35 return __dsos__findnew_link_by_longname(root, NULL, name); in __dsos__findnew_by_longname()
|
| D | block-range.c | 8 struct rb_root root; member
22 for (rb = rb_first(&block_ranges.root); rb; rb = rb_next(rb)) { in block_range__debug()
35 struct rb_node **p = &block_ranges.root.rb_node; in block_range__find()
83 struct rb_node **p = &block_ranges.root.rb_node; in block_range__create()
132 rb_insert_color(&head->node, &block_ranges.root); in block_range__create()
155 rb_insert_color(&entry->node, &block_ranges.root); in block_range__create()
186 rb_insert_color(&head->node, &block_ranges.root); in block_range__create()
226 rb_insert_color(&tail->node, &block_ranges.root); in block_range__create()
264 rb_insert_color(&tail->node, &block_ranges.root); in block_range__create()
287 rb_insert_color(&hole->node, &block_ranges.root); in block_range__create()
|
| D | mem2node.c | 18 static void phys_entry__insert(struct phys_entry *entry, struct rb_root *root) in phys_entry__insert() argument
20 struct rb_node **p = &root->rb_node; in phys_entry__insert()
35 rb_insert_color(&entry->rb_node, root); in phys_entry__insert()
55 map->root = RB_ROOT; in mem2node__init()
106 phys_entry__insert(&entries[i], &map->root); in mem2node__init()
123 p = &map->root.rb_node; in mem2node__node()
|
| D | dsos.c | 42 struct dso *__dsos__findnew_link_by_longname(struct rb_root *root, struct dso *dso, const char *nam… in __dsos__findnew_link_by_longname() argument
44 struct rb_node **p = &root->rb_node; in __dsos__findnew_link_by_longname()
84 rb_insert_color(&dso->rb_node, root); in __dsos__findnew_link_by_longname()
85 dso->root = root; in __dsos__findnew_link_by_longname()
93 __dsos__findnew_link_by_longname(&dsos->root, dso, NULL); in __dsos__add()
134 return __dsos__findnew_by_longname(&dsos->root, name); in __dsos__find()
|
| D | comm.c | 61 struct comm_str *__comm_str__findnew(const char *str, struct rb_root *root) in __comm_str__findnew() argument
63 struct rb_node **p = &root->rb_node; in __comm_str__findnew()
92 rb_insert_color(&new->rb_node, root); in __comm_str__findnew()
97 static struct comm_str *comm_str__findnew(const char *str, struct rb_root *root) in comm_str__findnew() argument
102 cs = __comm_str__findnew(str, root); in comm_str__findnew()
|
| D | callchain.c | 372 rb_insert_callchain(struct rb_root *root, struct callchain_node *chain, in rb_insert_callchain() argument
375 struct rb_node **p = &root->rb_node; in rb_insert_callchain()
409 rb_insert_color(&chain->rb_node, root); in rb_insert_callchain()
436 sort_chain_flat(struct rb_root *rb_root, struct callchain_root *root, in sort_chain_flat() argument
440 __sort_chain_flat(rb_root, &root->node, min_hit); in sort_chain_flat()
862 append_chain(struct callchain_node *root,
867 append_chain_children(struct callchain_node *root, in append_chain_children() argument
873 struct rb_node **p = &root->rb_root_in.rb_node; in append_chain_children()
900 rnode = add_child(root, cursor, period); in append_chain_children()
905 rb_insert_color(&rnode->rb_node_in, &root->rb_root_in); in append_chain_children()
[all …]
|
| /tools/lib/ |
| D | rbtree.c | 76 struct rb_root *root, int color) in __rb_rotate_set_parents() argument
81 __rb_change_child(old, new, parent, root); in __rb_rotate_set_parents()
85 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert() argument
180 __rb_rotate_set_parents(gparent, parent, root, RB_RED); in __rb_insert()
215 __rb_rotate_set_parents(gparent, parent, root, RB_RED); in __rb_insert()
227 ____rb_erase_color(struct rb_node *parent, struct rb_root *root, in ____rb_erase_color() argument
256 __rb_rotate_set_parents(parent, sibling, root, in ____rb_erase_color()
348 __rb_rotate_set_parents(parent, sibling, root, in ____rb_erase_color()
360 __rb_rotate_set_parents(parent, sibling, root, in ____rb_erase_color()
401 __rb_rotate_set_parents(parent, sibling, root, in ____rb_erase_color()
[all …]
|
| /tools/perf/tests/ |
| D | hists_common.c | 166 struct rb_root_cached *root; in print_hists_in() local
170 root = &hists->entries_collapsed; in print_hists_in()
172 root = hists->entries_in; in print_hists_in()
175 node = rb_first_cached(root); in print_hists_in()
196 struct rb_root_cached *root; in print_hists_out() local
199 root = &hists->entries; in print_hists_out()
202 node = rb_first_cached(root); in print_hists_out()
|
| D | hists_link.c | 144 struct rb_root_cached *root; in __validate_match() local
151 root = &hists->entries_collapsed; in __validate_match()
153 root = hists->entries_in; in __validate_match()
155 node = rb_first_cached(root); in __validate_match()
194 struct rb_root_cached *root; in __validate_link() local
203 root = &hists->entries_collapsed; in __validate_link()
205 root = hists->entries_in; in __validate_link()
207 node = rb_first_cached(root); in __validate_link()
|
| D | hists_output.c | 130 struct rb_root_cached *root; in test1() local
165 root = &hists->entries; in test1()
166 node = rb_first_cached(root); in test1()
232 struct rb_root_cached *root; in test2() local
265 root = &hists->entries; in test2()
266 node = rb_first_cached(root); in test2()
288 struct rb_root_cached *root; in test3() local
319 root = &hists->entries; in test3()
320 node = rb_first_cached(root); in test3()
362 struct rb_root_cached *root; in test4() local
[all …]
|
| /tools/testing/selftests/kvm/lib/ |
| D | sparsebit.c | 183 struct node *root; member
209 for (nodep = s->root; nodep && nodep->left; nodep = nodep->left) in node_first()
278 struct node *root; in node_copy_subtree() local
281 root = calloc(1, sizeof(*root)); in node_copy_subtree()
282 if (!root) { in node_copy_subtree()
287 root->idx = subtree->idx; in node_copy_subtree()
288 root->mask = subtree->mask; in node_copy_subtree()
289 root->num_after = subtree->num_after; in node_copy_subtree()
293 root->left = node_copy_subtree(subtree->left); in node_copy_subtree()
294 root->left->parent = root; in node_copy_subtree()
[all …]
|
| /tools/perf/ui/gtk/ |
| D | hists.c | 97 static void perf_gtk__add_callchain_flat(struct rb_root *root, GtkTreeStore *store, in perf_gtk__add_callchain_flat() argument
101 bool has_single_node = (rb_first(root) == rb_last(root)); in perf_gtk__add_callchain_flat()
103 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_flat()
160 static void perf_gtk__add_callchain_folded(struct rb_root *root, GtkTreeStore *store, in perf_gtk__add_callchain_folded() argument
165 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_folded()
220 static void perf_gtk__add_callchain_graph(struct rb_root *root, GtkTreeStore *store, in perf_gtk__add_callchain_graph() argument
224 bool has_single_node = (rb_first(root) == rb_last(root)); in perf_gtk__add_callchain_graph()
226 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_graph()
270 static void perf_gtk__add_callchain(struct rb_root *root, GtkTreeStore *store, in perf_gtk__add_callchain() argument
274 perf_gtk__add_callchain_flat(root, store, parent, col, total); in perf_gtk__add_callchain()
[all …]
|