Lines Matching defs:node
76 static int callchain_node__count_rows_rb_tree(struct callchain_node *node)
81 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
101 static int callchain_node__count_rows(struct callchain_node *node)
107 list_for_each_entry(chain, &node->val, list) {
113 n += callchain_node__count_rows_rb_tree(node);
124 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
125 n += callchain_node__count_rows(node);
143 static void callchain_node__init_have_children_rb_tree(struct callchain_node *node)
145 struct rb_node *nd = rb_first(&node->rb_root);
147 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
166 static void callchain_node__init_have_children(struct callchain_node *node)
170 list_for_each_entry(chain, &node->val, list)
171 chain->ms.has_children = !RB_EMPTY_ROOT(&node->rb_root);
173 callchain_node__init_have_children_rb_tree(node);
181 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
182 callchain_node__init_have_children(node);
217 static int callchain_node__set_folding_rb_tree(struct callchain_node *node, bool unfold)
222 for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
240 static int callchain_node__set_folding(struct callchain_node *node, bool unfold)
246 list_for_each_entry(chain, &node->val, list) {
253 n += callchain_node__set_folding_rb_tree(node, unfold);
264 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
265 n += callchain_node__set_folding(node, unfold);
423 struct rb_node *node;
433 node = rb_first(&chain_node->rb_root);
434 while (node) {
435 struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
436 struct rb_node *next = rb_next(node);
504 node = next;
511 struct callchain_node *node,
522 list_for_each_entry(chain, &node->val, list) {
553 row += hist_browser__show_callchain_node_rb_tree(browser, node,
572 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
574 row += hist_browser__show_callchain_node(browser, node, level,
630 list_for_each_entry(pair, &he->pairs.head, pairs.node) {
1003 struct rb_node *node;
1014 node = rb_first(&chain_node->rb_root);
1015 while (node) {
1016 struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
1017 struct rb_node *next = rb_next(node);
1062 node = next;
1069 struct callchain_node *node,
1077 list_for_each_entry(chain, &node->val, list) {
1086 printed += hist_browser__fprintf_callchain_node_rb_tree(browser, node,
1099 struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);
1101 printed += hist_browser__fprintf_callchain_node(browser, node, level, fp);
1759 struct perf_evsel *evsel = list_entry(entry, struct perf_evsel, node);
1849 if (pos->node.next == &evlist->entries)
1850 pos = list_entry(evlist->entries.next, struct perf_evsel, node);
1852 pos = list_entry(pos->node.next, struct perf_evsel, node);
1855 if (pos->node.prev == &evlist->entries)
1856 pos = list_entry(evlist->entries.prev, struct perf_evsel, node);
1858 pos = list_entry(pos->node.prev, struct perf_evsel, node);
1895 struct perf_evsel *evsel = list_entry(entry, struct perf_evsel, node);
1926 list_for_each_entry(pos, &evlist->entries, node) {
1947 struct perf_evsel, node);
1959 list_for_each_entry(pos, &evlist->entries, node)
