Lines Matching refs:node
72 struct rb_node node;
90 struct rb_node **node = &root_alloc_stat.rb_node;
94 while (*node) {
95 parent = *node;
96 data = rb_entry(*node, struct alloc_stat, node);
99 node = &(*node)->rb_right;
101 node = &(*node)->rb_left;
122 rb_link_node(&data->node, parent, node);
123 rb_insert_color(&data->node, &root_alloc_stat);
135 struct rb_node **node = &root_caller_stat.rb_node;
139 while (*node) {
140 parent = *node;
141 data = rb_entry(*node, struct alloc_stat, node);
144 node = &(*node)->rb_right;
146 node = &(*node)->rb_left;
167 rb_link_node(&data->node, parent, node);
168 rb_insert_color(&data->node, &root_caller_stat);
192 * version of tracepoints") adds the field "node" into the
196 * also contain the field "node".
198 * If the tracepoint contains the field "node" the tool stats the
201 if (evsel__field(evsel, "node")) {
205 node2 = evsel__intval(evsel, sample, "node");
208 * If the field "node" is NUMA_NO_NODE (-1), we don't take it
226 struct rb_node *node = root->rb_node;
229 while (node) {
233 data = rb_entry(node, struct alloc_stat, node);
237 node = node->rb_left;
239 node = node->rb_right;
291 struct rb_node node;
348 struct rb_node *node;
369 map__for_each_symbol(kernel_map, sym, node) {
401 struct callchain_cursor_node *node;
424 node = callchain_cursor_current(cursor);
425 if (node == NULL)
428 key.start = key.end = node->ip;
433 if (node->ms.map)
434 addr = map__dso_unmap_ip(node->ms.map, node->ip);
436 addr = node->ip;
464 struct rb_node **node = &page_live_tree.rb_node;
468 while (*node) {
471 parent = *node;
472 data = rb_entry(*node, struct page_stat, node);
476 node = &parent->rb_left;
478 node = &parent->rb_right;
493 rb_link_node(&data->node, parent, node);
494 rb_insert_color(&data->node, &page_live_tree);
513 struct rb_node **node = &page_alloc_tree.rb_node;
518 while (*node) {
521 parent = *node;
522 data = rb_entry(*node, struct page_stat, node);
531 node = &parent->rb_left;
533 node = &parent->rb_right;
548 rb_link_node(&data->node, parent, node);
549 rb_insert_color(&data->node, &page_alloc_tree);
568 struct rb_node **node = &page_caller_tree.rb_node;
573 while (*node) {
576 parent = *node;
577 data = rb_entry(*node, struct page_stat, node);
586 node = &parent->rb_left;
588 node = &parent->rb_right;
603 rb_link_node(&data->node, parent, node);
604 rb_insert_color(&data->node, &page_caller_tree);
912 rb_erase(&pstat->node, &page_live_tree);
938 rb_erase(&pstat->node, &page_caller_tree);
1022 node);
1094 data = rb_entry(next, struct page_stat, node);
1136 data = rb_entry(next, struct page_stat, node);
1281 this = rb_entry(*new, struct alloc_stat, node);
1296 rb_link_node(&data->node, parent, new);
1297 rb_insert_color(&data->node, root);
1303 struct rb_node *node;
1307 node = rb_first(root);
1308 if (!node)
1311 rb_erase(node, root);
1312 data = rb_entry(node, struct alloc_stat, node);
1328 this = rb_entry(*new, struct page_stat, node);
1343 rb_link_node(&data->node, parent, new);
1344 rb_insert_color(&data->node, root);
1350 struct rb_node *node;
1354 node = rb_first(root);
1355 if (!node)
1358 rb_erase(node, root);
1359 data = rb_entry(node, struct page_stat, node);