Lines Matching defs:next
27 * Free everything to try to do it from the rbtree in the next search
139 struct map_rb_node *pos, *next;
144 maps__for_each_entry_safe(maps, pos, next) {
280 struct rb_node *next, *first;
291 next = root->rb_node;
293 while (next) {
294 struct map_rb_node *pos = rb_entry(next, struct map_rb_node, rb_node);
297 first = next;
300 next = next->rb_left;
302 next = next->rb_right;
305 next = first;
306 while (next && !err) {
307 struct map_rb_node *pos = rb_entry(next, struct map_rb_node, rb_node);
308 next = rb_next(&pos->rb_node);
312 * Maps are ordered by start: next will not overlap for sure.
466 struct rb_node *next;
471 next = rb_next(&node->rb_node);
473 if (!next)
476 return rb_entry(next, struct map_rb_node, rb_node);