| /tools/perf/tests/ |
| D | hists_output.c | 105 he = rb_entry(node, struct hist_entry, rb_node); in del_hist_entries()
163 he = rb_entry(node, struct hist_entry, rb_node); in test1()
169 he = rb_entry(node, struct hist_entry, rb_node); in test1()
175 he = rb_entry(node, struct hist_entry, rb_node); in test1()
181 he = rb_entry(node, struct hist_entry, rb_node); in test1()
187 he = rb_entry(node, struct hist_entry, rb_node); in test1()
193 he = rb_entry(node, struct hist_entry, rb_node); in test1()
199 he = rb_entry(node, struct hist_entry, rb_node); in test1()
205 he = rb_entry(node, struct hist_entry, rb_node); in test1()
211 he = rb_entry(node, struct hist_entry, rb_node); in test1()
[all …]
|
| D | hists_common.c | 174 he = rb_entry(node, struct hist_entry, rb_node_in); in print_hists_in()
201 he = rb_entry(node, struct hist_entry, rb_node); in print_hists_out()
|
| D | hists_cumulate.c | 139 he = rb_entry(node, struct hist_entry, rb_node); in del_hist_entries()
200 node && (he = rb_entry(node, struct hist_entry, rb_node)); in do_test()
221 cnode = rb_entry(rb_first(root), struct callchain_node, rb_node); in do_test()
|
| D | hists_link.c | 157 he = rb_entry(node, struct hist_entry, rb_node_in); in __validate_match()
209 he = rb_entry(node, struct hist_entry, rb_node_in); in __validate_link()
|
| /tools/include/linux/ |
| D | rbtree_augmented.h | 72 rbstruct *node = rb_entry(rb, rbstruct, rbfield); \
83 rbstruct *old = rb_entry(rb_old, rbstruct, rbfield); \
84 rbstruct *new = rb_entry(rb_new, rbstruct, rbfield); \
90 rbstruct *old = rb_entry(rb_old, rbstruct, rbfield); \
91 rbstruct *new = rb_entry(rb_new, rbstruct, rbfield); \
|
| D | rbtree.h | 50 #define rb_entry(ptr, type, member) container_of(ptr, type, member) macro
90 ____ptr ? rb_entry(____ptr, type, member) : NULL; \
|
| /tools/perf/util/ |
| D | rb_resort.h | 65 a = rb_entry(nda, struct __name##_sorted_entry, rb_node); \
66 b = rb_entry(ndb, struct __name##_sorted_entry, rb_node); \
128 __name##_entry = rb_entry(__nd, struct __name##_sorted_entry, \
|
| D | strlist.h | 60 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; in strlist__first()
68 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; in strlist__next()
|
| D | intlist.h | 48 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL; in intlist__first()
56 return rn ? rb_entry(rn, struct int_node, rb_node) : NULL; in intlist__next()
|
| D | hist.c | 206 n = rb_entry(next, struct hist_entry, rb_node); in hists__output_recalc_col_len()
288 child = rb_entry(node, struct hist_entry, rb_node); in hists__decay_entry()
331 n = rb_entry(next, struct hist_entry, rb_node); in hists__decay_entries()
347 n = rb_entry(next, struct hist_entry, rb_node); in hists__delete_entries()
506 he = rb_entry(parent, struct hist_entry, rb_node_in); in hists__findnew_entry()
1275 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hierarchy_insert_entry()
1390 iter = rb_entry(parent, struct hist_entry, rb_node_in); in hists__collapse_insert_entry()
1466 n = rb_entry(next, struct hist_entry, rb_node_in); in hists__collapse_resort()
1551 he = rb_entry(node, struct hist_entry, rb_node); in hierarchy_recalc_total_periods()
1570 iter = rb_entry(parent, struct hist_entry, rb_node); in hierarchy_insert_output_entry()
[all …]
|
| D | symbol.c | 162 curr = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_duplicate()
165 next = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_duplicate()
193 curr = rb_entry(prevnd, struct symbol, rb_node); in symbols__fixup_end()
197 curr = rb_entry(nd, struct symbol, rb_node); in symbols__fixup_end()
273 pos = rb_entry(next, struct symbol, rb_node); in symbols__delete()
300 s = rb_entry(parent, struct symbol, rb_node); in __symbols__insert()
325 struct symbol *s = rb_entry(n, struct symbol, rb_node); in symbols__find()
343 return rb_entry(n, struct symbol, rb_node); in symbols__first()
353 return rb_entry(n, struct symbol, rb_node); in symbols__last()
363 return rb_entry(n, struct symbol, rb_node); in symbols__next()
[all …]
|
| D | block-range.c | 20 struct block_range *entry = rb_entry(rb, struct block_range, node); in block_range__debug()
38 entry = rb_entry(parent, struct block_range, node); in block_range__find()
87 entry = rb_entry(parent, struct block_range, node); in block_range__create()
114 next = rb_entry(n, struct block_range, node); in block_range__create()
|
| D | map.c | 267 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map__fixup_start()
277 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map__fixup_end()
497 struct map *pos = rb_entry(next, struct map, rb_node); in __maps__purge()
579 struct map *pos = rb_entry(nd, struct map, rb_node); in maps__find_symbol_by_name()
631 struct map *pos = rb_entry(nd, struct map, rb_node); in maps__fprintf()
678 struct map *pos = rb_entry(next, struct map, rb_node); in maps__fixup_overlappings()
784 m = rb_entry(parent, struct map, rb_node); in __maps__insert()
826 m = rb_entry(parent, struct map, rb_node); in maps__find()
846 return rb_entry(first, struct map, rb_node); in maps__first()
855 return rb_entry(next, struct map, rb_node); in map__next()
|
| D | block-range.h | 38 return rb_entry(n, struct block_range, node); in block_range__next()
|
| D | symbol_fprintf.c | 66 pos = rb_entry(nd, struct symbol_name_rb_node, rb_node); in dso__fprintf_symbols_by_name()
|
| D | callchain.c | 238 rnode = rb_entry(parent, struct callchain_node, rb_node); in rb_insert_callchain()
275 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_flat()
307 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_abs()
337 child = rb_entry(n, struct callchain_node, rb_node_in); in __sort_chain_graph_rel()
402 child = rb_entry(n, struct callchain_node, rb_node_in); in create_child()
567 first = rb_entry(p, struct callchain_node, rb_node_in); in split_add_child()
609 rnode = rb_entry(parent, struct callchain_node, rb_node_in); in append_chain_children()
|
| D | machine.c | 119 struct thread *t = rb_entry(nd, struct thread, rb_node); in machine__delete_threads()
175 pos = rb_entry(parent, struct machine, rb_node); in machines__add()
195 struct machine *machine = rb_entry(nd, struct machine, rb_node); in machines__set_comm_exec()
213 machine = rb_entry(parent, struct machine, rb_node); in machines__find()
267 struct machine *pos = rb_entry(nd, struct machine, rb_node); in machines__process_guests()
294 machine = rb_entry(node, struct machine, rb_node); in machines__set_id_hdr_size()
377 th = rb_entry(parent, struct thread, rb_node); in ____machine__findnew_thread()
623 struct machine *pos = rb_entry(nd, struct machine, rb_node); in machines__fprintf_dsos()
643 struct machine *pos = rb_entry(nd, struct machine, rb_node); in machines__fprintf_dsos_buildid()
678 struct thread *pos = rb_entry(nd, struct thread, rb_node); in machine__fprintf()
[all …]
|
| D | comm.c | 60 iter = rb_entry(parent, struct comm_str, rb_node); in comm_str__findnew()
|
| D | call-path.c | 103 cp = rb_entry(node_parent, struct call_path, rb_node); in call_path__findnew()
|
| /tools/perf/ui/browsers/ |
| D | map.c | 22 struct symbol *sym = rb_entry(nd, struct symbol, rb_node); in map_browser__write()
116 struct symbol *pos = rb_entry(nd, struct symbol, rb_node); in map__browse()
|
| D | hists.c | 46 rb_entry(nd, struct hist_entry, rb_node); in hist_browser__get_folding()
153 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); in callchain_node__count_rows_rb_tree()
234 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); in callchain__count_rows()
258 child = rb_entry(node, struct hist_entry, rb_node); in hierarchy_count_rows()
302 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); in callchain_node__init_have_children_rb_tree()
342 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); in callchain__init_have_children()
438 struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); in callchain_node__set_folding_rb_tree()
479 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); in callchain__set_folding()
495 child = rb_entry(nd, struct hist_entry, rb_node); in hierarchy_set_folding()
532 he = rb_entry(nd, struct hist_entry, rb_node); in __hist_browser__set_folding()
[all …]
|
| /tools/perf/ |
| D | builtin-kmem.c | 77 data = rb_entry(*node, struct alloc_stat, node); in insert_alloc_stat()
120 data = rb_entry(*node, struct alloc_stat, node); in insert_caller_stat()
203 data = rb_entry(node, struct alloc_stat, node); in search_alloc_stat()
431 data = rb_entry(*node, struct page_stat, node); in __page_stat__findnew_page()
481 data = rb_entry(*node, struct page_stat, node); in __page_stat__findnew_alloc()
536 data = rb_entry(*node, struct page_stat, node); in __page_stat__findnew_caller()
972 struct alloc_stat *data = rb_entry(next, struct alloc_stat, in __print_slab_result()
1045 data = rb_entry(next, struct page_stat, node); in __print_page_alloc_result()
1087 data = rb_entry(next, struct page_stat, node); in __print_page_caller_result()
1227 this = rb_entry(*new, struct alloc_stat, node); in sort_slab_insert()
[all …]
|
| /tools/perf/ui/stdio/ |
| D | hist.c | 100 child = rb_entry(node, struct callchain_node, rb_node); in __callchain__fprintf_graph()
183 cnode = rb_entry(node, struct callchain_node, rb_node); in need_percent_display()
202 cnode = rb_entry(node, struct callchain_node, rb_node); in callchain__fprintf_graph()
276 chain = rb_entry(rb_node, struct callchain_node, rb_node); in callchain__fprintf_flat()
328 chain = rb_entry(rb_node, struct callchain_node, rb_node); in callchain__fprintf_folded()
758 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in hists__fprintf()
|
| /tools/perf/ui/gtk/ |
| D | hists.c | 104 node = rb_entry(nd, struct callchain_node, rb_node); in perf_gtk__add_callchain_flat()
168 node = rb_entry(nd, struct callchain_node, rb_node); in perf_gtk__add_callchain_folded()
228 node = rb_entry(nd, struct callchain_node, rb_node); in perf_gtk__add_callchain_graph()
354 struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); in perf_gtk__show_hists()
419 he = rb_entry(node, struct hist_entry, rb_node); in perf_gtk__add_hierarchy_entries()
|
| /tools/lib/lockdep/ |
| D | preload.c | 107 l = rb_entry(*node, struct lock_lookup, node); in __get_lock_node()
184 return rb_entry(*node, struct lock_lookup, node); in __get_lock()
|