Home
last modified time | relevance | path

Searched refs:root (Results 1 – 25 of 60) sorted by relevance

123

/tools/testing/radix-tree/
Dtest.h11 int __item_insert(struct radix_tree_root *root, struct item *item,
13 int item_insert(struct radix_tree_root *root, unsigned long index);
14 int item_insert_order(struct radix_tree_root *root, unsigned long index,
16 int item_delete(struct radix_tree_root *root, unsigned long index);
17 struct item *item_lookup(struct radix_tree_root *root, unsigned long index);
19 void item_check_present(struct radix_tree_root *root, unsigned long index);
20 void item_check_absent(struct radix_tree_root *root, unsigned long index);
21 void item_gang_check_present(struct radix_tree_root *root,
24 void item_full_scan(struct radix_tree_root *root, unsigned long start,
26 void item_kill_tree(struct radix_tree_root *root);
[all …]
Dregression3.c30 RADIX_TREE(root, GFP_KERNEL); in regression3_test()
39 radix_tree_insert(&root, 0, ptr0); in regression3_test()
40 radix_tree_tag_set(&root, 0, 0); in regression3_test()
43 radix_tree_for_each_tagged(slot, &root, &iter, 0, 0) { in regression3_test()
46 radix_tree_insert(&root, 1, ptr); in regression3_test()
47 radix_tree_tag_set(&root, 1, 0); in regression3_test()
56 radix_tree_delete(&root, 1); in regression3_test()
59 radix_tree_for_each_slot(slot, &root, &iter, 0) { in regression3_test()
62 radix_tree_insert(&root, 1, ptr); in regression3_test()
71 radix_tree_delete(&root, 1); in regression3_test()
[all …]
Dtest.c11 item_tag_set(struct radix_tree_root *root, unsigned long index, int tag) in item_tag_set() argument
13 return radix_tree_tag_set(root, index, tag); in item_tag_set()
17 item_tag_clear(struct radix_tree_root *root, unsigned long index, int tag) in item_tag_clear() argument
19 return radix_tree_tag_clear(root, index, tag); in item_tag_clear()
22 int item_tag_get(struct radix_tree_root *root, unsigned long index, int tag) in item_tag_get() argument
24 return radix_tree_tag_get(root, index, tag); in item_tag_get()
27 int __item_insert(struct radix_tree_root *root, struct item *item, in __item_insert() argument
30 return __radix_tree_insert(root, item->index, order, item); in __item_insert()
33 int item_insert(struct radix_tree_root *root, unsigned long index) in item_insert() argument
35 return __item_insert(root, item_create(index), 0); in item_insert()
[all …]
/tools/perf/util/
Dstrfilter.c27 strfilter_node__delete(filter->root); in strfilter__delete()
79 struct strfilter_node root, *cur, *last_op; in strfilter_node__new() local
85 memset(&root, 0, sizeof(root)); in strfilter_node__new()
86 last_op = cur = &root; in strfilter_node__new()
101 if (!cur->r || !root.r) in strfilter_node__new()
103 cur = strfilter_node__alloc(OP_or, root.r, NULL); in strfilter_node__new()
106 root.r = cur; in strfilter_node__new()
142 return root.r; in strfilter_node__new()
147 strfilter_node__delete(root.r); in strfilter_node__new()
161 filter->root = strfilter_node__new(rules, &ep); in strfilter__new()
[all …]
Dcallchain.h142 static inline void callchain_init(struct callchain_root *root) in callchain_init() argument
144 INIT_LIST_HEAD(&root->node.val); in callchain_init()
145 INIT_LIST_HEAD(&root->node.parent_val); in callchain_init()
147 root->node.parent = NULL; in callchain_init()
148 root->node.hit = 0; in callchain_init()
149 root->node.children_hit = 0; in callchain_init()
150 root->node.rb_root_in = RB_ROOT; in callchain_init()
151 root->max_depth = 0; in callchain_init()
165 int callchain_append(struct callchain_root *root,
266 void free_callchain(struct callchain_root *root);
[all …]
Dblock-range.c5 struct rb_root root; member
19 for (rb = rb_first(&block_ranges.root); rb; rb = rb_next(rb)) { in block_range__debug()
32 struct rb_node **p = &block_ranges.root.rb_node; in block_range__find()
80 struct rb_node **p = &block_ranges.root.rb_node; in block_range__create()
129 rb_insert_color(&head->node, &block_ranges.root); in block_range__create()
152 rb_insert_color(&entry->node, &block_ranges.root); in block_range__create()
183 rb_insert_color(&head->node, &block_ranges.root); in block_range__create()
223 rb_insert_color(&tail->node, &block_ranges.root); in block_range__create()
261 rb_insert_color(&tail->node, &block_ranges.root); in block_range__create()
284 rb_insert_color(&hole->node, &block_ranges.root); in block_range__create()
Dcallchain.c226 rb_insert_callchain(struct rb_root *root, struct callchain_node *chain, in rb_insert_callchain() argument
229 struct rb_node **p = &root->rb_node; in rb_insert_callchain()
263 rb_insert_color(&chain->rb_node, root); in rb_insert_callchain()
290 sort_chain_flat(struct rb_root *rb_root, struct callchain_root *root, in sort_chain_flat() argument
294 __sort_chain_flat(rb_root, &root->node, min_hit); in sort_chain_flat()
586 append_chain(struct callchain_node *root,
591 append_chain_children(struct callchain_node *root, in append_chain_children() argument
597 struct rb_node **p = &root->rb_root_in.rb_node; in append_chain_children()
624 rnode = add_child(root, cursor, period); in append_chain_children()
629 rb_insert_color(&rnode->rb_node_in, &root->rb_root_in); in append_chain_children()
[all …]
Ddso.c574 struct rb_root *root = &dso->data.cache; in dso_cache__free() local
575 struct rb_node *next = rb_first(root); in dso_cache__free()
583 rb_erase(&cache->rb_node, root); in dso_cache__free()
591 const struct rb_root *root = &dso->data.cache; in dso_cache__find() local
592 struct rb_node * const *p = &root->rb_node; in dso_cache__find()
617 struct rb_root *root = &dso->data.cache; in dso_cache__insert() local
618 struct rb_node **p = &root->rb_node; in dso_cache__insert()
640 rb_insert_color(&new->rb_node, root); in dso_cache__insert()
909 static struct dso *__dso__findlink_by_longname(struct rb_root *root, in __dso__findlink_by_longname() argument
912 struct rb_node **p = &root->rb_node; in __dso__findlink_by_longname()
[all …]
Dhist.c1262 struct rb_root *root, in hierarchy_insert_entry() argument
1267 struct rb_node **p = &root->rb_node; in hierarchy_insert_entry()
1326 rb_insert_color(&new->rb_node_in, root); in hierarchy_insert_entry()
1331 struct rb_root *root, in hists__hierarchy_insert_entry() argument
1346 new_he = hierarchy_insert_entry(hists, root, he, parent, &node->hpp); in hists__hierarchy_insert_entry()
1352 root = &new_he->hroot_in; in hists__hierarchy_insert_entry()
1377 struct rb_root *root, in hists__collapse_insert_entry() argument
1380 struct rb_node **p = &root->rb_node; in hists__collapse_insert_entry()
1386 return hists__hierarchy_insert_entry(hists, root, he); in hists__collapse_insert_entry()
1420 rb_insert_color(&he->rb_node_in, root); in hists__collapse_insert_entry()
[all …]
Dcomm.c51 static struct comm_str *comm_str__findnew(const char *str, struct rb_root *root) in comm_str__findnew() argument
53 struct rb_node **p = &root->rb_node; in comm_str__findnew()
77 rb_insert_color(&new->rb_node, root); in comm_str__findnew()
Dstrfilter.h17 struct strfilter_node *root; member
/tools/lib/
Drbtree.c63 struct rb_root *root, int color) in __rb_rotate_set_parents() argument
68 __rb_change_child(old, new, parent, root); in __rb_rotate_set_parents()
72 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert() argument
155 __rb_rotate_set_parents(gparent, parent, root, RB_RED); in __rb_insert()
189 __rb_rotate_set_parents(gparent, parent, root, RB_RED); in __rb_insert()
201 ____rb_erase_color(struct rb_node *parent, struct rb_root *root, in ____rb_erase_color() argument
229 __rb_rotate_set_parents(parent, sibling, root, in ____rb_erase_color()
304 __rb_rotate_set_parents(parent, sibling, root, in ____rb_erase_color()
315 __rb_rotate_set_parents(parent, sibling, root, in ____rb_erase_color()
354 __rb_rotate_set_parents(parent, sibling, root, in ____rb_erase_color()
[all …]
/tools/include/linux/
Drbtree_augmented.h47 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
60 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented() argument
63 __rb_insert_augmented(node, root, augment->rotate); in rb_insert_augmented()
125 struct rb_node *parent, struct rb_root *root) in __rb_change_child() argument
133 root->rb_node = new; in __rb_change_child()
136 extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
140 __rb_erase_augmented(struct rb_node *node, struct rb_root *root, in __rb_erase_augmented() argument
157 __rb_change_child(node, child, parent, root); in __rb_erase_augmented()
168 __rb_change_child(node, tmp, parent, root); in __rb_erase_augmented()
219 __rb_change_child(node, successor, tmp, root); in __rb_erase_augmented()
[all …]
Drbtree.h52 #define RB_EMPTY_ROOT(root) ((root)->rb_node == NULL) argument
77 struct rb_root *root);
99 static inline void rb_erase_init(struct rb_node *n, struct rb_root *root) in rb_erase_init() argument
101 rb_erase(n, root); in rb_erase_init()
/tools/perf/tests/
Dhists_common.c161 struct rb_root *root; in print_hists_in() local
165 root = &hists->entries_collapsed; in print_hists_in()
167 root = hists->entries_in; in print_hists_in()
170 node = rb_first(root); in print_hists_in()
191 struct rb_root *root; in print_hists_out() local
194 root = &hists->entries; in print_hists_out()
197 node = rb_first(root); in print_hists_out()
Dhists_link.c142 struct rb_root *root; in __validate_match() local
149 root = &hists->entries_collapsed; in __validate_match()
151 root = hists->entries_in; in __validate_match()
153 node = rb_first(root); in __validate_match()
192 struct rb_root *root; in __validate_link() local
201 root = &hists->entries_collapsed; in __validate_link()
203 root = hists->entries_in; in __validate_link()
205 node = rb_first(root); in __validate_link()
Dhists_output.c126 struct rb_root *root; in test1() local
161 root = &hists->entries; in test1()
162 node = rb_first(root); in test1()
228 struct rb_root *root; in test2() local
261 root = &hists->entries; in test2()
262 node = rb_first(root); in test2()
284 struct rb_root *root; in test3() local
315 root = &hists->entries; in test3()
316 node = rb_first(root); in test3()
358 struct rb_root *root; in test4() local
[all …]
Dhists_cumulate.c179 struct rb_root *root; in do_test() local
198 root = &hists->entries; in do_test()
199 for (node = rb_first(root), i = 0; in do_test()
218 root = &he->callchain->node.rb_root; in do_test()
220 TEST_ASSERT_VAL("callchains expected", !RB_EMPTY_ROOT(root)); in do_test()
221 cnode = rb_entry(rb_first(root), struct callchain_node, rb_node); in do_test()
/tools/perf/ui/gtk/
Dhists.c92 static void perf_gtk__add_callchain_flat(struct rb_root *root, GtkTreeStore *store, in perf_gtk__add_callchain_flat() argument
96 bool has_single_node = (rb_first(root) == rb_last(root)); in perf_gtk__add_callchain_flat()
98 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_flat()
155 static void perf_gtk__add_callchain_folded(struct rb_root *root, GtkTreeStore *store, in perf_gtk__add_callchain_folded() argument
160 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_folded()
215 static void perf_gtk__add_callchain_graph(struct rb_root *root, GtkTreeStore *store, in perf_gtk__add_callchain_graph() argument
219 bool has_single_node = (rb_first(root) == rb_last(root)); in perf_gtk__add_callchain_graph()
221 for (nd = rb_first(root); nd; nd = rb_next(nd)) { in perf_gtk__add_callchain_graph()
265 static void perf_gtk__add_callchain(struct rb_root *root, GtkTreeStore *store, in perf_gtk__add_callchain() argument
269 perf_gtk__add_callchain_flat(root, store, parent, col, total); in perf_gtk__add_callchain()
[all …]
/tools/testing/selftests/net/
Drun_afpackettests4 echo $msg must be run as root >&2
/tools/perf/Documentation/
Dperf-buildid-cache.txt30 /proc/kcore which requires root permissions to read. Be aware that
31 running 'perf buildid-cache' as root may update root's build-id cache
36 permissions for root only. kcore will not be added if there is already a
Dperfconfig.example21 dir = /root/.debug
/tools/perf/scripts/python/
Dcall-graph-from-postgresql.py226 self.root = TreeItem(db, 0, None)
229 return self.root.columnCount()
235 parent_item = self.root
246 return self.root.columnHeader(section)
250 if child_item is self.root:
259 parent_item = self.root
/tools/lguest/
Dlguest.txt56 - Create or find a root disk image. There are several useful ones
57 around, such as the xm-test tiny root image at
71 - Run an lguest as root:
74 --block=rootfile root=/dev/vda
88 root=/dev/vda: this (and anything else on the command line) are
/tools/testing/selftests/rcutorture/doc/
Dinitrd.txt35 distro in place, the root-filesystem layout, and so on. To make this
43 [ -d /root ] || mkdir -m 0700 /root
83 export rootmnt=/root

123