Lines Matching refs:pos
238 struct map *pos = rb_entry(next, struct map, rb_node);
240 next = rb_next(&pos->rb_node);
241 rb_erase(&pos->rb_node, self);
242 map__delete(pos);
248 struct map *pos, *n;
250 list_for_each_entry_safe(pos, n, self, node) {
251 list_del(&pos->node);
252 map__delete(pos);
275 struct map *pos = rb_entry(next, struct map, rb_node);
276 next = rb_next(&pos->rb_node);
277 rb_erase(&pos->rb_node, root);
283 list_add_tail(&pos->node, &self->removed_maps[pos->type]);
313 struct map *pos = rb_entry(nd, struct map, rb_node);
314 struct symbol *sym = map__find_symbol_by_name(pos, name, filter);
319 *mapp = pos;
333 struct map *pos = rb_entry(nd, struct map, rb_node);
335 printed += map__fprintf(pos, fp);
337 printed += dso__fprintf(pos->dso, type, fp);
357 struct map *pos;
360 list_for_each_entry(pos, &self->removed_maps[type], node) {
362 printed += map__fprintf(pos, fp);
364 printed += dso__fprintf(pos->dso, type, fp);
395 struct map *pos = rb_entry(next, struct map, rb_node);
396 next = rb_next(&pos->rb_node);
398 if (!map__overlap(pos, map))
404 map__fprintf(pos, fp);
407 rb_erase(&pos->rb_node, root);
412 if (map->start > pos->start) {
413 struct map *before = map__clone(pos);
426 if (map->end < pos->end) {
427 struct map *after = map__clone(pos);
443 if (pos->referenced)
444 list_add_tail(&pos->node, &self->removed_maps[map->type]);
446 map__delete(pos);
561 struct dso *pos, *n;
563 list_for_each_entry_safe(pos, n, self, node) {
564 list_del(&pos->node);
565 dso__delete(pos);
589 struct machine *pos, *machine = malloc(sizeof(*machine));
601 pos = rb_entry(parent, struct machine, rb_node);
602 if (pid < pos->pid)
668 struct machine *pos = rb_entry(nd, struct machine, rb_node);
669 process(pos, data);
