Lines Matching refs:node
70 struct rb_node node;
88 struct rb_node **node = &root_alloc_stat.rb_node;
92 while (*node) {
93 parent = *node;
94 data = rb_entry(*node, struct alloc_stat, node);
97 node = &(*node)->rb_right;
99 node = &(*node)->rb_left;
120 rb_link_node(&data->node, parent, node);
121 rb_insert_color(&data->node, &root_alloc_stat);
133 struct rb_node **node = &root_caller_stat.rb_node;
137 while (*node) {
138 parent = *node;
139 data = rb_entry(*node, struct alloc_stat, node);
142 node = &(*node)->rb_right;
144 node = &(*node)->rb_left;
165 rb_link_node(&data->node, parent, node);
166 rb_insert_color(&data->node, &root_caller_stat);
196 node2 = evsel__intval(evsel, sample, "node");
213 struct rb_node *node = root->rb_node;
216 while (node) {
220 data = rb_entry(node, struct alloc_stat, node);
224 node = node->rb_left;
226 node = node->rb_right;
278 struct rb_node node;
335 struct rb_node *node;
356 map__for_each_symbol(kernel_map, sym, node) {
388 struct callchain_cursor_node *node;
403 node = callchain_cursor_current(&callchain_cursor);
404 if (node == NULL)
407 key.start = key.end = node->ip;
412 if (node->ms.map)
413 addr = map__unmap_ip(node->ms.map, node->ip);
415 addr = node->ip;
441 struct rb_node **node = &page_live_tree.rb_node;
445 while (*node) {
448 parent = *node;
449 data = rb_entry(*node, struct page_stat, node);
453 node = &parent->rb_left;
455 node = &parent->rb_right;
470 rb_link_node(&data->node, parent, node);
471 rb_insert_color(&data->node, &page_live_tree);
490 struct rb_node **node = &page_alloc_tree.rb_node;
495 while (*node) {
498 parent = *node;
499 data = rb_entry(*node, struct page_stat, node);
508 node = &parent->rb_left;
510 node = &parent->rb_right;
525 rb_link_node(&data->node, parent, node);
526 rb_insert_color(&data->node, &page_alloc_tree);
545 struct rb_node **node = &page_caller_tree.rb_node;
550 while (*node) {
553 parent = *node;
554 data = rb_entry(*node, struct page_stat, node);
563 node = &parent->rb_left;
565 node = &parent->rb_right;
580 rb_link_node(&data->node, parent, node);
581 rb_insert_color(&data->node, &page_caller_tree);
890 rb_erase(&pstat->node, &page_live_tree);
916 rb_erase(&pstat->node, &page_caller_tree);
1000 node);
1072 data = rb_entry(next, struct page_stat, node);
1114 data = rb_entry(next, struct page_stat, node);
1259 this = rb_entry(*new, struct alloc_stat, node);
1274 rb_link_node(&data->node, parent, new);
1275 rb_insert_color(&data->node, root);
1281 struct rb_node *node;
1285 node = rb_first(root);
1286 if (!node)
1289 rb_erase(node, root);
1290 data = rb_entry(node, struct alloc_stat, node);
1306 this = rb_entry(*new, struct page_stat, node);
1321 rb_link_node(&data->node, parent, new);
1322 rb_insert_color(&data->node, root);
1328 struct rb_node *node;
1332 node = rb_first(root);
1333 if (!node)
1336 rb_erase(node, root);
1337 data = rb_entry(node, struct page_stat, node);