release/src-rt-6.x.4708/linux/linux-2.6.36/tools/perf/util/map.c

   1 #include "symbol.h"
   2 #include <errno.h>
   3 #include <limits.h>
   4 #include <stdlib.h>
   5 #include <string.h>
   6 #include <stdio.h>
   7 #include <unistd.h>
   8 #include "map.h"
   9
  10 const char *map_type__name[MAP__NR_TYPES] = {
  11         [MAP__FUNCTION] = "Functions",
  12         [MAP__VARIABLE] = "Variables",
  13 };
  14
  15 static inline int is_anon_memory(const char *filename)
  16 {
  17         return strcmp(filename, "//anon") == 0;
  18 }
  19
  20 void map__init(struct map *self, enum map_type type,
  21                u64 start, u64 end, u64 pgoff, struct dso *dso)
  22 {
  23         self->type     = type;
  24         self->start    = start;
  25         self->end      = end;
  26         self->pgoff    = pgoff;
  27         self->dso      = dso;
  28         self->map_ip   = map__map_ip;
  29         self->unmap_ip = map__unmap_ip;
  30         RB_CLEAR_NODE(&self->rb_node);
  31         self->groups   = NULL;
  32         self->referenced = false;
  33 }
  34
  35 struct map *map__new(struct list_head *dsos__list, u64 start, u64 len,
  36                      u64 pgoff, u32 pid, char *filename,
  37                      enum map_type type)
  38 {
  39         struct map *self = malloc(sizeof(*self));
  40
  41         if (self != NULL) {
  42                 char newfilename[PATH_MAX];
  43                 struct dso *dso;
  44                 int anon;
  45
  46                 anon = is_anon_memory(filename);
  47
  48                 if (anon) {
  49                         snprintf(newfilename, sizeof(newfilename), "/tmp/perf-%d.map", pid);
  50                         filename = newfilename;
  51                 }
  52
  53                 dso = __dsos__findnew(dsos__list, filename);
  54                 if (dso == NULL)
  55                         goto out_delete;
  56
  57                 map__init(self, type, start, start + len, pgoff, dso);
  58
  59                 if (anon) {
  60 set_identity:
  61                         self->map_ip = self->unmap_ip = identity__map_ip;
  62                 } else if (strcmp(filename, "[vdso]") == 0) {
  63                         dso__set_loaded(dso, self->type);
  64                         goto set_identity;
  65                 }
  66         }
  67         return self;
  68 out_delete:
  69         free(self);
  70         return NULL;
  71 }
  72
  73 void map__delete(struct map *self)
  74 {
  75         free(self);
  76 }
  77
  78 void map__fixup_start(struct map *self)
  79 {
  80         struct rb_root *symbols = &self->dso->symbols[self->type];
  81         struct rb_node *nd = rb_first(symbols);
  82         if (nd != NULL) {
  83                 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
  84                 self->start = sym->start;
  85         }
  86 }
  87
  88 void map__fixup_end(struct map *self)
  89 {
  90         struct rb_root *symbols = &self->dso->symbols[self->type];
  91         struct rb_node *nd = rb_last(symbols);
  92         if (nd != NULL) {
  93                 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
  94                 self->end = sym->end;
  95         }
  96 }
  97
  98 #define DSO__DELETED "(deleted)"
  99
 100 int map__load(struct map *self, symbol_filter_t filter)
 101 {
 102         const char *name = self->dso->long_name;
 103         int nr;
 104
 105         if (dso__loaded(self->dso, self->type))
 106                 return 0;
 107
 108         nr = dso__load(self->dso, self, filter);
 109         if (nr < 0) {
 110                 if (self->dso->has_build_id) {
 111                         char sbuild_id[BUILD_ID_SIZE * 2 + 1];
 112
 113                         build_id__sprintf(self->dso->build_id,
 114                                           sizeof(self->dso->build_id),
 115                                           sbuild_id);
 116                         pr_warning("%s with build id %s not found",
 117                                    name, sbuild_id);
 118                 } else
 119                         pr_warning("Failed to open %s", name);
 120
 121                 pr_warning(", continuing without symbols\n");
 122                 return -1;
 123         } else if (nr == 0) {
 124                 const size_t len = strlen(name);
 125                 const size_t real_len = len - sizeof(DSO__DELETED);
 126
 127                 if (len > sizeof(DSO__DELETED) &&
 128                     strcmp(name + real_len + 1, DSO__DELETED) == 0) {
 129                         pr_warning("%.*s was updated, restart the long "
 130                                    "running apps that use it!\n",
 131                                    (int)real_len, name);
 132                 } else {
 133                         pr_warning("no symbols found in %s, maybe install "
 134                                    "a debug package?\n", name);
 135                 }
 136
 137                 return -1;
 138         }
 139         /*
 140          * Only applies to the kernel, as its symtabs aren't relative like the
 141          * module ones.
 142          */
 143         if (self->dso->kernel)
 144                 map__reloc_vmlinux(self);
 145
 146         return 0;
 147 }
 148
 149 struct symbol *map__find_symbol(struct map *self, u64 addr,
 150                                 symbol_filter_t filter)
 151 {
 152         if (map__load(self, filter) < 0)
 153                 return NULL;
 154
 155         return dso__find_symbol(self->dso, self->type, addr);
 156 }
 157
 158 struct symbol *map__find_symbol_by_name(struct map *self, const char *name,
 159                                         symbol_filter_t filter)
 160 {
 161         if (map__load(self, filter) < 0)
 162                 return NULL;
 163
 164         if (!dso__sorted_by_name(self->dso, self->type))
 165                 dso__sort_by_name(self->dso, self->type);
 166
 167         return dso__find_symbol_by_name(self->dso, self->type, name);
 168 }
 169
 170 struct map *map__clone(struct map *self)
 171 {
 172         struct map *map = malloc(sizeof(*self));
 173
 174         if (!map)
 175                 return NULL;
 176
 177         memcpy(map, self, sizeof(*self));
 178
 179         return map;
 180 }
 181
 182 int map__overlap(struct map *l, struct map *r)
 183 {
 184         if (l->start > r->start) {
 185                 struct map *t = l;
 186                 l = r;
 187                 r = t;
 188         }
 189
 190         if (l->end > r->start)
 191                 return 1;
 192
 193         return 0;
 194 }
 195
 196 size_t map__fprintf(struct map *self, FILE *fp)
 197 {
 198         return fprintf(fp, " %Lx-%Lx %Lx %s\n",
 199                        self->start, self->end, self->pgoff, self->dso->name);
 200 }
 201
 202 /*
 203  * objdump wants/reports absolute IPs for ET_EXEC, and RIPs for ET_DYN.
 204  * map->dso->adjust_symbols==1 for ET_EXEC-like cases.
 205  */
 206 u64 map__rip_2objdump(struct map *map, u64 rip)
 207 {
 208         u64 addr = map->dso->adjust_symbols ?
 209                         map->unmap_ip(map, rip) :       /* RIP -> IP */
 210                         rip;
 211         return addr;
 212 }
 213
 214 u64 map__objdump_2ip(struct map *map, u64 addr)
 215 {
 216         u64 ip = map->dso->adjust_symbols ?
 217                         addr :
 218                         map->unmap_ip(map, addr);       /* RIP -> IP */
 219         return ip;
 220 }
 221
 222 void map_groups__init(struct map_groups *self)
 223 {
 224         int i;
 225         for (i = 0; i < MAP__NR_TYPES; ++i) {
 226                 self->maps[i] = RB_ROOT;
 227                 INIT_LIST_HEAD(&self->removed_maps[i]);
 228         }
 229         self->machine = NULL;
 230 }
 231
 232 static void maps__delete(struct rb_root *self)
 233 {
 234         struct rb_node *next = rb_first(self);
 235
 236         while (next) {
 237                 struct map *pos = rb_entry(next, struct map, rb_node);
 238
 239                 next = rb_next(&pos->rb_node);
 240                 rb_erase(&pos->rb_node, self);
 241                 map__delete(pos);
 242         }
 243 }
 244
 245 static void maps__delete_removed(struct list_head *self)
 246 {
 247         struct map *pos, *n;
 248
 249         list_for_each_entry_safe(pos, n, self, node) {
 250                 list_del(&pos->node);
 251                 map__delete(pos);
 252         }
 253 }
 254
 255 void map_groups__exit(struct map_groups *self)
 256 {
 257         int i;
 258
 259         for (i = 0; i < MAP__NR_TYPES; ++i) {
 260                 maps__delete(&self->maps[i]);
 261                 maps__delete_removed(&self->removed_maps[i]);
 262         }
 263 }
 264
 265 void map_groups__flush(struct map_groups *self)
 266 {
 267         int type;
 268
 269         for (type = 0; type < MAP__NR_TYPES; type++) {
 270                 struct rb_root *root = &self->maps[type];
 271                 struct rb_node *next = rb_first(root);
 272
 273                 while (next) {
 274                         struct map *pos = rb_entry(next, struct map, rb_node);
 275                         next = rb_next(&pos->rb_node);
 276                         rb_erase(&pos->rb_node, root);
 277                         /*
 278                          * We may have references to this map, for
 279                          * instance in some hist_entry instances, so
 280                          * just move them to a separate list.
 281                          */
 282                         list_add_tail(&pos->node, &self->removed_maps[pos->type]);
 283                 }
 284         }
 285 }
 286
 287 struct symbol *map_groups__find_symbol(struct map_groups *self,
 288                                        enum map_type type, u64 addr,
 289                                        struct map **mapp,
 290                                        symbol_filter_t filter)
 291 {
 292         struct map *map = map_groups__find(self, type, addr);
 293
 294         if (map != NULL) {
 295                 if (mapp != NULL)
 296                         *mapp = map;
 297                 return map__find_symbol(map, map->map_ip(map, addr), filter);
 298         }
 299
 300         return NULL;
 301 }
 302
 303 struct symbol *map_groups__find_symbol_by_name(struct map_groups *self,
 304                                                enum map_type type,
 305                                                const char *name,
 306                                                struct map **mapp,
 307                                                symbol_filter_t filter)
 308 {
 309         struct rb_node *nd;
 310
 311         for (nd = rb_first(&self->maps[type]); nd; nd = rb_next(nd)) {
 312                 struct map *pos = rb_entry(nd, struct map, rb_node);
 313                 struct symbol *sym = map__find_symbol_by_name(pos, name, filter);
 314
 315                 if (sym == NULL)
 316                         continue;
 317                 if (mapp != NULL)
 318                         *mapp = pos;
 319                 return sym;
 320         }
 321
 322         return NULL;
 323 }
 324
 325 size_t __map_groups__fprintf_maps(struct map_groups *self,
 326                                   enum map_type type, int verbose, FILE *fp)
 327 {
 328         size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
 329         struct rb_node *nd;
 330
 331         for (nd = rb_first(&self->maps[type]); nd; nd = rb_next(nd)) {
 332                 struct map *pos = rb_entry(nd, struct map, rb_node);
 333                 printed += fprintf(fp, "Map:");
 334                 printed += map__fprintf(pos, fp);
 335                 if (verbose > 2) {
 336                         printed += dso__fprintf(pos->dso, type, fp);
 337                         printed += fprintf(fp, "--\n");
 338                 }
 339         }
 340
 341         return printed;
 342 }
 343
 344 size_t map_groups__fprintf_maps(struct map_groups *self, int verbose, FILE *fp)
 345 {
 346         size_t printed = 0, i;
 347         for (i = 0; i < MAP__NR_TYPES; ++i)
 348                 printed += __map_groups__fprintf_maps(self, i, verbose, fp);
 349         return printed;
 350 }
 351
 352 static size_t __map_groups__fprintf_removed_maps(struct map_groups *self,
 353                                                  enum map_type type,
 354                                                  int verbose, FILE *fp)
 355 {
 356         struct map *pos;
 357         size_t printed = 0;
 358
 359         list_for_each_entry(pos, &self->removed_maps[type], node) {
 360                 printed += fprintf(fp, "Map:");
 361                 printed += map__fprintf(pos, fp);
 362                 if (verbose > 1) {
 363                         printed += dso__fprintf(pos->dso, type, fp);
 364                         printed += fprintf(fp, "--\n");
 365                 }
 366         }
 367         return printed;
 368 }
 369
 370 static size_t map_groups__fprintf_removed_maps(struct map_groups *self,
 371                                                int verbose, FILE *fp)
 372 {
 373         size_t printed = 0, i;
 374         for (i = 0; i < MAP__NR_TYPES; ++i)
 375                 printed += __map_groups__fprintf_removed_maps(self, i, verbose, fp);
 376         return printed;
 377 }
 378
 379 size_t map_groups__fprintf(struct map_groups *self, int verbose, FILE *fp)
 380 {
 381         size_t printed = map_groups__fprintf_maps(self, verbose, fp);
 382         printed += fprintf(fp, "Removed maps:\n");
 383         return printed + map_groups__fprintf_removed_maps(self, verbose, fp);
 384 }
 385
 386 int map_groups__fixup_overlappings(struct map_groups *self, struct map *map,
 387                                    int verbose, FILE *fp)
 388 {
 389         struct rb_root *root = &self->maps[map->type];
 390         struct rb_node *next = rb_first(root);
 391         int err = 0;
 392
 393         while (next) {
 394                 struct map *pos = rb_entry(next, struct map, rb_node);
 395                 next = rb_next(&pos->rb_node);
 396
 397                 if (!map__overlap(pos, map))
 398                         continue;
 399
 400                 if (verbose >= 2) {
 401                         fputs("overlapping maps:\n", fp);
 402                         map__fprintf(map, fp);
 403                         map__fprintf(pos, fp);
 404                 }
 405
 406                 rb_erase(&pos->rb_node, root);
 407                 /*
 408                  * Now check if we need to create new maps for areas not
 409                  * overlapped by the new map:
 410                  */
 411                 if (map->start > pos->start) {
 412                         struct map *before = map__clone(pos);
 413
 414                         if (before == NULL) {
 415                                 err = -ENOMEM;
 416                                 goto move_map;
 417                         }
 418
 419                         before->end = map->start - 1;
 420                         map_groups__insert(self, before);
 421                         if (verbose >= 2)
 422                                 map__fprintf(before, fp);
 423                 }
 424
 425                 if (map->end < pos->end) {
 426                         struct map *after = map__clone(pos);
 427
 428                         if (after == NULL) {
 429                                 err = -ENOMEM;
 430                                 goto move_map;
 431                         }
 432
 433                         after->start = map->end + 1;
 434                         map_groups__insert(self, after);
 435                         if (verbose >= 2)
 436                                 map__fprintf(after, fp);
 437                 }
 438 move_map:
 439                 /*
 440                  * If we have references, just move them to a separate list.
 441                  */
 442                 if (pos->referenced)
 443                         list_add_tail(&pos->node, &self->removed_maps[map->type]);
 444                 else
 445                         map__delete(pos);
 446
 447                 if (err)
 448                         return err;
 449         }
 450
 451         return 0;
 452 }
 453
 454 int map_groups__clone(struct map_groups *self,
 455                       struct map_groups *parent, enum map_type type)
 456 {
 457         struct rb_node *nd;
 458         for (nd = rb_first(&parent->maps[type]); nd; nd = rb_next(nd)) {
 459                 struct map *map = rb_entry(nd, struct map, rb_node);
 460                 struct map *new = map__clone(map);
 461                 if (new == NULL)
 462                         return -ENOMEM;
 463                 map_groups__insert(self, new);
 464         }
 465         return 0;
 466 }
 467
 468 static u64 map__reloc_map_ip(struct map *map, u64 ip)
 469 {
 470         return ip + (s64)map->pgoff;
 471 }
 472
 473 static u64 map__reloc_unmap_ip(struct map *map, u64 ip)
 474 {
 475         return ip - (s64)map->pgoff;
 476 }
 477
 478 void map__reloc_vmlinux(struct map *self)
 479 {
 480         struct kmap *kmap = map__kmap(self);
 481         s64 reloc;
 482
 483         if (!kmap->ref_reloc_sym || !kmap->ref_reloc_sym->unrelocated_addr)
 484                 return;
 485
 486         reloc = (kmap->ref_reloc_sym->unrelocated_addr -
 487                  kmap->ref_reloc_sym->addr);
 488
 489         if (!reloc)
 490                 return;
 491
 492         self->map_ip   = map__reloc_map_ip;
 493         self->unmap_ip = map__reloc_unmap_ip;
 494         self->pgoff    = reloc;
 495 }
 496
 497 void maps__insert(struct rb_root *maps, struct map *map)
 498 {
 499         struct rb_node **p = &maps->rb_node;
 500         struct rb_node *parent = NULL;
 501         const u64 ip = map->start;
 502         struct map *m;
 503
 504         while (*p != NULL) {
 505                 parent = *p;
 506                 m = rb_entry(parent, struct map, rb_node);
 507                 if (ip < m->start)
 508                         p = &(*p)->rb_left;
 509                 else
 510                         p = &(*p)->rb_right;
 511         }
 512
 513         rb_link_node(&map->rb_node, parent, p);
 514         rb_insert_color(&map->rb_node, maps);
 515 }
 516
 517 void maps__remove(struct rb_root *self, struct map *map)
 518 {
 519         rb_erase(&map->rb_node, self);
 520 }
 521
 522 struct map *maps__find(struct rb_root *maps, u64 ip)
 523 {
 524         struct rb_node **p = &maps->rb_node;
 525         struct rb_node *parent = NULL;
 526         struct map *m;
 527
 528         while (*p != NULL) {
 529                 parent = *p;
 530                 m = rb_entry(parent, struct map, rb_node);
 531                 if (ip < m->start)
 532                         p = &(*p)->rb_left;
 533                 else if (ip > m->end)
 534                         p = &(*p)->rb_right;
 535                 else
 536                         return m;
 537         }
 538
 539         return NULL;
 540 }
 541
 542 int machine__init(struct machine *self, const char *root_dir, pid_t pid)
 543 {
 544         map_groups__init(&self->kmaps);
 545         RB_CLEAR_NODE(&self->rb_node);
 546         INIT_LIST_HEAD(&self->user_dsos);
 547         INIT_LIST_HEAD(&self->kernel_dsos);
 548
 549         self->kmaps.machine = self;
 550         self->pid           = pid;
 551         self->root_dir      = strdup(root_dir);
 552         return self->root_dir == NULL ? -ENOMEM : 0;
 553 }
 554
 555 static void dsos__delete(struct list_head *self)
 556 {
 557         struct dso *pos, *n;
 558
 559         list_for_each_entry_safe(pos, n, self, node) {
 560                 list_del(&pos->node);
 561                 dso__delete(pos);
 562         }
 563 }
 564
 565 void machine__exit(struct machine *self)
 566 {
 567         map_groups__exit(&self->kmaps);
 568         dsos__delete(&self->user_dsos);
 569         dsos__delete(&self->kernel_dsos);
 570         free(self->root_dir);
 571         self->root_dir = NULL;
 572 }
 573
 574 void machine__delete(struct machine *self)
 575 {
 576         machine__exit(self);
 577         free(self);
 578 }
 579
 580 struct machine *machines__add(struct rb_root *self, pid_t pid,
 581                               const char *root_dir)
 582 {
 583         struct rb_node **p = &self->rb_node;
 584         struct rb_node *parent = NULL;
 585         struct machine *pos, *machine = malloc(sizeof(*machine));
 586
 587         if (!machine)
 588                 return NULL;
 589
 590         if (machine__init(machine, root_dir, pid) != 0) {
 591                 free(machine);
 592                 return NULL;
 593         }
 594
 595         while (*p != NULL) {
 596                 parent = *p;
 597                 pos = rb_entry(parent, struct machine, rb_node);
 598                 if (pid < pos->pid)
 599                         p = &(*p)->rb_left;
 600                 else
 601                         p = &(*p)->rb_right;
 602         }
 603
 604         rb_link_node(&machine->rb_node, parent, p);
 605         rb_insert_color(&machine->rb_node, self);
 606
 607         return machine;
 608 }
 609
 610 struct machine *machines__find(struct rb_root *self, pid_t pid)
 611 {
 612         struct rb_node **p = &self->rb_node;
 613         struct rb_node *parent = NULL;
 614         struct machine *machine;
 615         struct machine *default_machine = NULL;
 616
 617         while (*p != NULL) {
 618                 parent = *p;
 619                 machine = rb_entry(parent, struct machine, rb_node);
 620                 if (pid < machine->pid)
 621                         p = &(*p)->rb_left;
 622                 else if (pid > machine->pid)
 623                         p = &(*p)->rb_right;
 624                 else
 625                         return machine;
 626                 if (!machine->pid)
 627                         default_machine = machine;
 628         }
 629
 630         return default_machine;
 631 }
 632
 633 struct machine *machines__findnew(struct rb_root *self, pid_t pid)
 634 {
 635         char path[PATH_MAX];
 636         const char *root_dir;
 637         struct machine *machine = machines__find(self, pid);
 638
 639         if (!machine || machine->pid != pid) {
 640                 if (pid == HOST_KERNEL_ID || pid == DEFAULT_GUEST_KERNEL_ID)
 641                         root_dir = "";
 642                 else {
 643                         if (!symbol_conf.guestmount)
 644                                 goto out;
 645                         sprintf(path, "%s/%d", symbol_conf.guestmount, pid);
 646                         if (access(path, R_OK)) {
 647                                 pr_err("Can't access file %s\n", path);
 648                                 goto out;
 649                         }
 650                         root_dir = path;
 651                 }
 652                 machine = machines__add(self, pid, root_dir);
 653         }
 654
 655 out:
 656         return machine;
 657 }
 658
 659 void machines__process(struct rb_root *self, machine__process_t process, void *data)
 660 {
 661         struct rb_node *nd;
 662
 663         for (nd = rb_first(self); nd; nd = rb_next(nd)) {
 664                 struct machine *pos = rb_entry(nd, struct machine, rb_node);
 665                 process(pos, data);
 666         }
 667 }
 668
 669 char *machine__mmap_name(struct machine *self, char *bf, size_t size)
 670 {
 671         if (machine__is_host(self))
 672                 snprintf(bf, size, "[%s]", "kernel.kallsyms");
 673         else if (machine__is_default_guest(self))
 674                 snprintf(bf, size, "[%s]", "guest.kernel.kallsyms");
 675         else
 676                 snprintf(bf, size, "[%s.%d]", "guest.kernel.kallsyms", self->pid);
 677
 678         return bf;
 679 }