Lines Matching refs:next
184 struct symbol *curr, *next;
195 next = rb_entry(nd, struct symbol, rb_node);
200 if (curr->start != next->start)
203 if (choose_best_symbol(curr, next) == SYMBOL_A) {
204 rb_erase_cached(&next->rb_node, symbols);
205 symbol__delete(next);
215 /* Update zero-sized symbols using the address of the next symbol */
320 struct rb_node *next = rb_first_cached(symbols);
322 while (next) {
323 pos = rb_entry(next, struct symbol, rb_node);
324 next = rb_next(&pos->rb_node);
741 * so that we can in the next step set the symbol ->end address and then
756 struct rb_node *next = rb_first_cached(root);
763 while (next) {
766 pos = rb_entry(next, struct symbol, rb_node);
767 next = rb_next(&pos->rb_node);
810 struct rb_node *next = rb_first_cached(root);
821 while (next) {
824 pos = rb_entry(next, struct symbol, rb_node);
825 next = rb_next(&pos->rb_node);
990 struct rb_node *next = rb_first(modules);
992 while (next) {
993 mi = rb_entry(next, struct module_info, rb_node);
994 next = rb_next(&mi->rb_node);
1282 old_map = list_entry(merged.next, struct map, node);
1300 struct map *old_map, *new_map, *replacement_map = NULL, *next;
1347 maps__for_each_entry_safe(kmaps, old_map, next) {
1369 replacement_map = list_entry(md.maps.next, struct map, node);
1373 new_map = list_entry(md.maps.next, struct map, node);
1432 map = list_entry(md.maps.next, struct map, node);