Home
last modified time | relevance | path

Searched defs:node (Results 1 – 25 of 44) sorted by relevance

12

/tools/lib/
Drbtree.c72 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert()
204 struct rb_node *node = NULL, *sibling, *tmp1, *tmp2; in ____rb_erase_color() local
376 static inline void dummy_propagate(struct rb_node *node, struct rb_node *stop) {} in dummy_propagate()
384 void rb_insert_color(struct rb_node *node, struct rb_root *root) in rb_insert_color()
389 void rb_erase(struct rb_node *node, struct rb_root *root) in rb_erase()
404 void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, in __rb_insert_augmented()
437 struct rb_node *rb_next(const struct rb_node *node) in rb_next()
468 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev()
512 static struct rb_node *rb_left_deepest_node(const struct rb_node *node) in rb_left_deepest_node()
524 struct rb_node *rb_next_postorder(const struct rb_node *node) in rb_next_postorder()
/tools/perf/util/
Dintlist.c19 struct int_node *node = malloc(sizeof(*node)); in intlist__node_new() local
38 struct int_node *node = container_of(rb_node, struct int_node, rb_node); in intlist__node_delete() local
46 struct int_node *node = container_of(rb_node, struct int_node, rb_node); in intlist__node_cmp() local
56 void intlist__remove(struct intlist *ilist, struct int_node *node) in intlist__remove()
64 struct int_node *node = NULL; in __intlist__findnew() local
138 struct int_node *node = NULL; in intlist__entry() local
Dcallchain.c244 __sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node, in __sort_chain_flat()
273 static void __sort_chain_graph_abs(struct callchain_node *node, in __sort_chain_graph_abs()
301 static void __sort_chain_graph_rel(struct callchain_node *node, in __sort_chain_graph_rel()
394 fill_node(struct callchain_node *node, struct callchain_cursor *cursor) in fill_node()
437 static s64 match_chain(struct callchain_cursor_node *node, in match_chain()
486 struct callchain_cursor_node *node; in split_add_child() local
527 struct callchain_cursor_node *node; in append_chain_children() local
579 struct callchain_cursor_node *node; in append_chain() local
688 struct callchain_cursor_node *node = *cursor->last; in callchain_cursor_append() local
731 int fill_callchain_info(struct addr_location *al, struct callchain_cursor_node *node, in fill_callchain_info()
[all …]
Dstrfilter.c13 static void strfilter_node__delete(struct strfilter_node *node) in strfilter_node__delete()
65 struct strfilter_node *node = zalloc(sizeof(*node)); in strfilter_node__alloc() local
213 static bool strfilter_node__compare(struct strfilter_node *node, in strfilter_node__compare()
244 static int strfilter_node__sprint_pt(struct strfilter_node *node, char *buf) in strfilter_node__sprint_pt()
259 static int strfilter_node__sprint(struct strfilter_node *node, char *buf) in strfilter_node__sprint()
Drblist.c120 struct rb_node *node; in rblist__entry() local
Dthread.h18 struct list_head node; member
Dcallchain.h68 struct callchain_node node; member
142 static inline u64 callchain_cumul_hits(struct callchain_node *node) in callchain_cumul_hits()
Dannotate.h56 struct list_head node; member
102 struct rb_node node; member
/tools/perf/tests/
Dhists_output.c98 struct rb_node *node; in del_hist_entries() local
132 struct rb_node *node; in test1() local
234 struct rb_node *node; in test2() local
290 struct rb_node *node; in test3() local
364 struct rb_node *node; in test4() local
466 struct rb_node *node; in test5() local
Dhists_common.c161 struct rb_node *node; in print_hists_in() local
191 struct rb_node *node; in print_hists_out() local
Dswitch-tracking.c207 struct event_node *node; in add_event() local
234 struct event_node *node; in free_event_nodes() local
258 struct event_node *events_array, *node; in process_events() local
Dhists_link.c155 struct rb_node *node; in __validate_match() local
205 struct rb_node *node; in __validate_link() local
Dhists_cumulate.c132 struct rb_node *node; in del_hist_entries() local
175 } node[10]; member
185 struct rb_node *node; in do_test() local
/tools/include/linux/
Drbtree.h55 #define RB_EMPTY_NODE(node) \ argument
57 #define RB_CLEAR_NODE(node) \ argument
79 static inline void rb_link_node(struct rb_node *node, struct rb_node *parent, in rb_link_node()
Drbtree_augmented.h60 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented()
140 __rb_erase_augmented(struct rb_node *node, struct rb_root *root, in __rb_erase_augmented()
237 rb_erase_augmented(struct rb_node *node, struct rb_root *root, in rb_erase_augmented()
/tools/usb/usbip/libsrc/
Dusbip_host_driver.h36 struct list_head node; member
/tools/lib/lockdep/
Dpreload.c31 struct rb_node node; member
101 struct rb_node **node = &locks.rb_node; in __get_lock_node() local
177 struct rb_node **node, *parent; in __get_lock() local
/tools/perf/
Dbuiltin-kmem.c57 struct rb_node node; member
71 struct rb_node **node = &root_alloc_stat.rb_node; in insert_alloc_stat() local
114 struct rb_node **node = &root_caller_stat.rb_node; in insert_caller_stat() local
196 struct rb_node *node = root->rb_node; in search_alloc_stat() local
260 struct rb_node node; member
317 struct rb_node *node; in build_alloc_func_list() local
370 struct callchain_cursor_node *node; in find_callsite() local
423 struct rb_node **node = &page_live_tree.rb_node; in __page_stat__findnew_page() local
472 struct rb_node **node = &page_alloc_tree.rb_node; in __page_stat__findnew_alloc() local
527 struct rb_node **node = &page_caller_tree.rb_node; in __page_stat__findnew_caller() local
[all …]
Dbuiltin-lock.c120 struct rb_node *node; in thread_stat_find() local
301 struct rb_node *node = result.rb_node; in pop_from_result() local
761 struct rb_node *node; in dump_threads() local
/tools/perf/ui/stdio/
Dhist.c84 struct rb_node *node, *next; in __callchain__fprintf_graph() local
166 struct rb_node *node; in callchain__fprintf_graph() local
214 static size_t __callchain__fprintf_flat(FILE *fp, struct callchain_node *node, in __callchain__fprintf_flat()
/tools/perf/ui/browsers/
Dhists.c156 static int callchain_node__count_rows_rb_tree(struct callchain_node *node) in callchain_node__count_rows_rb_tree()
181 static int callchain_node__count_rows(struct callchain_node *node) in callchain_node__count_rows()
204 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); in callchain__count_rows() local
235 static void callchain_node__init_have_children_rb_tree(struct callchain_node *node) in callchain_node__init_have_children_rb_tree()
258 static void callchain_node__init_have_children(struct callchain_node *node, in callchain_node__init_have_children()
280 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); in callchain__init_have_children() local
329 static int callchain_node__set_folding_rb_tree(struct callchain_node *node, bool unfold) in callchain_node__set_folding_rb_tree()
352 static int callchain_node__set_folding(struct callchain_node *node, bool unfold) in callchain_node__set_folding()
376 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); in callchain__set_folding() local
587 struct rb_node *node; in hist_browser__show_callchain() local
Dscripts.c21 struct list_head node; member
/tools/perf/bench/
Dnuma.c233 static int is_node_present(int node) in is_node_present()
241 static bool node_has_cpus(int node) in node_has_cpus()
333 static void bind_to_memnode(int node) in bind_to_memnode()
373 int node = numa_node_of_cpu(0); in alloc_data() local
877 int node; in count_process_nodes() local
904 static int count_node_processes(int node) in count_node_processes()
969 int node; in calc_convergence() local
/tools/testing/selftests/x86/
Dtest_vsyscall.c174 static inline long sys_getcpu(unsigned * cpu, unsigned * node, in sys_getcpu()
323 unsigned node = 0; in test_getcpu() local
/tools/perf/ui/gtk/
Dhists.c99 struct callchain_node *node; in perf_gtk__add_callchain() local

12