aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
-rw-r--r--tools/perf/util/map.c74
-rw-r--r--tools/perf/util/map.h42
2 files changed, 58 insertions, 58 deletions
diff --git a/tools/perf/util/map.c b/tools/perf/util/map.c
index a16ecab5229d..aa2f9fd178e1 100644
--- a/tools/perf/util/map.c
+++ b/tools/perf/util/map.c
@@ -220,55 +220,55 @@ u64 map__objdump_2ip(struct map *map, u64 addr)
220 return ip; 220 return ip;
221} 221}
222 222
223void map_groups__init(struct map_groups *self) 223void map_groups__init(struct map_groups *mg)
224{ 224{
225 int i; 225 int i;
226 for (i = 0; i < MAP__NR_TYPES; ++i) { 226 for (i = 0; i < MAP__NR_TYPES; ++i) {
227 self->maps[i] = RB_ROOT; 227 mg->maps[i] = RB_ROOT;
228 INIT_LIST_HEAD(&self->removed_maps[i]); 228 INIT_LIST_HEAD(&mg->removed_maps[i]);
229 } 229 }
230 self->machine = NULL; 230 mg->machine = NULL;
231} 231}
232 232
233static void maps__delete(struct rb_root *self) 233static void maps__delete(struct rb_root *maps)
234{ 234{
235 struct rb_node *next = rb_first(self); 235 struct rb_node *next = rb_first(maps);
236 236
237 while (next) { 237 while (next) {
238 struct map *pos = rb_entry(next, struct map, rb_node); 238 struct map *pos = rb_entry(next, struct map, rb_node);
239 239
240 next = rb_next(&pos->rb_node); 240 next = rb_next(&pos->rb_node);
241 rb_erase(&pos->rb_node, self); 241 rb_erase(&pos->rb_node, maps);
242 map__delete(pos); 242 map__delete(pos);
243 } 243 }
244} 244}
245 245
246static void maps__delete_removed(struct list_head *self) 246static void maps__delete_removed(struct list_head *maps)
247{ 247{
248 struct map *pos, *n; 248 struct map *pos, *n;
249 249
250 list_for_each_entry_safe(pos, n, self, node) { 250 list_for_each_entry_safe(pos, n, maps, node) {
251 list_del(&pos->node); 251 list_del(&pos->node);
252 map__delete(pos); 252 map__delete(pos);
253 } 253 }
254} 254}
255 255
256void map_groups__exit(struct map_groups *self) 256void map_groups__exit(struct map_groups *mg)
257{ 257{
258 int i; 258 int i;
259 259
260 for (i = 0; i < MAP__NR_TYPES; ++i) { 260 for (i = 0; i < MAP__NR_TYPES; ++i) {
261 maps__delete(&self->maps[i]); 261 maps__delete(&mg->maps[i]);
262 maps__delete_removed(&self->removed_maps[i]); 262 maps__delete_removed(&mg->removed_maps[i]);
263 } 263 }
264} 264}
265 265
266void map_groups__flush(struct map_groups *self) 266void map_groups__flush(struct map_groups *mg)
267{ 267{
268 int type; 268 int type;
269 269
270 for (type = 0; type < MAP__NR_TYPES; type++) { 270 for (type = 0; type < MAP__NR_TYPES; type++) {
271 struct rb_root *root = &self->maps[type]; 271 struct rb_root *root = &mg->maps[type];
272 struct rb_node *next = rb_first(root); 272 struct rb_node *next = rb_first(root);
273 273
274 while (next) { 274 while (next) {
@@ -280,17 +280,17 @@ void map_groups__flush(struct map_groups *self)
280 * instance in some hist_entry instances, so 280 * instance in some hist_entry instances, so
281 * just move them to a separate list. 281 * just move them to a separate list.
282 */ 282 */
283 list_add_tail(&pos->node, &self->removed_maps[pos->type]); 283 list_add_tail(&pos->node, &mg->removed_maps[pos->type]);
284 } 284 }
285 } 285 }
286} 286}
287 287
288struct symbol *map_groups__find_symbol(struct map_groups *self, 288struct symbol *map_groups__find_symbol(struct map_groups *mg,
289 enum map_type type, u64 addr, 289 enum map_type type, u64 addr,
290 struct map **mapp, 290 struct map **mapp,
291 symbol_filter_t filter) 291 symbol_filter_t filter)
292{ 292{
293 struct map *map = map_groups__find(self, type, addr); 293 struct map *map = map_groups__find(mg, type, addr);
294 294
295 if (map != NULL) { 295 if (map != NULL) {
296 if (mapp != NULL) 296 if (mapp != NULL)
@@ -301,7 +301,7 @@ struct symbol *map_groups__find_symbol(struct map_groups *self,
301 return NULL; 301 return NULL;
302} 302}
303 303
304struct symbol *map_groups__find_symbol_by_name(struct map_groups *self, 304struct symbol *map_groups__find_symbol_by_name(struct map_groups *mg,
305 enum map_type type, 305 enum map_type type,
306 const char *name, 306 const char *name,
307 struct map **mapp, 307 struct map **mapp,
@@ -309,7 +309,7 @@ struct symbol *map_groups__find_symbol_by_name(struct map_groups *self,
309{ 309{
310 struct rb_node *nd; 310 struct rb_node *nd;
311 311
312 for (nd = rb_first(&self->maps[type]); nd; nd = rb_next(nd)) { 312 for (nd = rb_first(&mg->maps[type]); nd; nd = rb_next(nd)) {
313 struct map *pos = rb_entry(nd, struct map, rb_node); 313 struct map *pos = rb_entry(nd, struct map, rb_node);
314 struct symbol *sym = map__find_symbol_by_name(pos, name, filter); 314 struct symbol *sym = map__find_symbol_by_name(pos, name, filter);
315 315
@@ -323,13 +323,13 @@ struct symbol *map_groups__find_symbol_by_name(struct map_groups *self,
323 return NULL; 323 return NULL;
324} 324}
325 325
326size_t __map_groups__fprintf_maps(struct map_groups *self, 326size_t __map_groups__fprintf_maps(struct map_groups *mg,
327 enum map_type type, int verbose, FILE *fp) 327 enum map_type type, int verbose, FILE *fp)
328{ 328{
329 size_t printed = fprintf(fp, "%s:\n", map_type__name[type]); 329 size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
330 struct rb_node *nd; 330 struct rb_node *nd;
331 331
332 for (nd = rb_first(&self->maps[type]); nd; nd = rb_next(nd)) { 332 for (nd = rb_first(&mg->maps[type]); nd; nd = rb_next(nd)) {
333 struct map *pos = rb_entry(nd, struct map, rb_node); 333 struct map *pos = rb_entry(nd, struct map, rb_node);
334 printed += fprintf(fp, "Map:"); 334 printed += fprintf(fp, "Map:");
335 printed += map__fprintf(pos, fp); 335 printed += map__fprintf(pos, fp);
@@ -342,22 +342,22 @@ size_t __map_groups__fprintf_maps(struct map_groups *self,
342 return printed; 342 return printed;
343} 343}
344 344
345size_t map_groups__fprintf_maps(struct map_groups *self, int verbose, FILE *fp) 345size_t map_groups__fprintf_maps(struct map_groups *mg, int verbose, FILE *fp)
346{ 346{
347 size_t printed = 0, i; 347 size_t printed = 0, i;
348 for (i = 0; i < MAP__NR_TYPES; ++i) 348 for (i = 0; i < MAP__NR_TYPES; ++i)
349 printed += __map_groups__fprintf_maps(self, i, verbose, fp); 349 printed += __map_groups__fprintf_maps(mg, i, verbose, fp);
350 return printed; 350 return printed;
351} 351}
352 352
353static size_t __map_groups__fprintf_removed_maps(struct map_groups *self, 353static size_t __map_groups__fprintf_removed_maps(struct map_groups *mg,
354 enum map_type type, 354 enum map_type type,
355 int verbose, FILE *fp) 355 int verbose, FILE *fp)
356{ 356{
357 struct map *pos; 357 struct map *pos;
358 size_t printed = 0; 358 size_t printed = 0;
359 359
360 list_for_each_entry(pos, &self->removed_maps[type], node) { 360 list_for_each_entry(pos, &mg->removed_maps[type], node) {
361 printed += fprintf(fp, "Map:"); 361 printed += fprintf(fp, "Map:");
362 printed += map__fprintf(pos, fp); 362 printed += map__fprintf(pos, fp);
363 if (verbose > 1) { 363 if (verbose > 1) {
@@ -368,26 +368,26 @@ static size_t __map_groups__fprintf_removed_maps(struct map_groups *self,
368 return printed; 368 return printed;
369} 369}
370 370
371static size_t map_groups__fprintf_removed_maps(struct map_groups *self, 371static size_t map_groups__fprintf_removed_maps(struct map_groups *mg,
372 int verbose, FILE *fp) 372 int verbose, FILE *fp)
373{ 373{
374 size_t printed = 0, i; 374 size_t printed = 0, i;
375 for (i = 0; i < MAP__NR_TYPES; ++i) 375 for (i = 0; i < MAP__NR_TYPES; ++i)
376 printed += __map_groups__fprintf_removed_maps(self, i, verbose, fp); 376 printed += __map_groups__fprintf_removed_maps(mg, i, verbose, fp);
377 return printed; 377 return printed;
378} 378}
379 379
380size_t map_groups__fprintf(struct map_groups *self, int verbose, FILE *fp) 380size_t map_groups__fprintf(struct map_groups *mg, int verbose, FILE *fp)
381{ 381{
382 size_t printed = map_groups__fprintf_m