Lines Matching defs:rb_node
38 struct rb_node **p = &maps__entries(maps)->rb_node;
39 struct rb_node *parent = NULL;
47 RB_CLEAR_NODE(&new_rb_node->rb_node);
52 m = rb_entry(parent, struct map_rb_node, rb_node);
59 rb_link_node(&new_rb_node->rb_node, parent, p);
60 rb_insert_color(&new_rb_node->rb_node, maps__entries(maps));
113 static void __maps__remove(struct maps *maps, struct map_rb_node *rb_node)
115 rb_erase_init(&rb_node->rb_node, maps__entries(maps));
116 map__put(rb_node->map);
117 free(rb_node);
122 struct map_rb_node *rb_node;
128 rb_node = maps__find_node(maps, map);
129 assert(rb_node->RC_CHK_ACCESS(map) == RC_CHK_ACCESS(map));
130 __maps__remove(maps, rb_node);
145 rb_erase_init(&pos->rb_node, maps__entries(maps));
280 struct rb_node *next, *first;
291 next = root->rb_node;
294 struct map_rb_node *pos = rb_entry(next, struct map_rb_node, rb_node);
307 struct map_rb_node *pos = rb_entry(next, struct map_rb_node, rb_node);
308 next = rb_next(&pos->rb_node);
329 rb_erase_init(&pos->rb_node, root);
390 struct map_rb_node *rb_node;
394 maps__for_each_entry(parent, rb_node) {
395 struct map *new = map__clone(rb_node->map);
421 struct map_rb_node *rb_node;
423 maps__for_each_entry(maps, rb_node) {
424 if (rb_node->RC_CHK_ACCESS(map) == RC_CHK_ACCESS(map))
425 return rb_node;
432 struct rb_node *p;
438 p = maps__entries(maps)->rb_node;
440 m = rb_entry(p, struct map_rb_node, rb_node);
457 struct rb_node *first = rb_first(maps__entries(maps));
460 return rb_entry(first, struct map_rb_node, rb_node);
466 struct rb_node *next;
471 next = rb_next(&node->rb_node);
476 return rb_entry(next, struct map_rb_node, rb_node);