SAFE public projects git trees. - safe/jmp/linux-2.6/blob - tools/perf/util/thread.c

   1 #include "../perf.h"
   2 #include <stdlib.h>
   3 #include <stdio.h>
   4 #include <string.h>
   5 #include "thread.h"
   6 #include "util.h"
   7 #include "debug.h"
   8
   9 static struct rb_root threads;
  10 static struct thread *last_match;
  11
  12 void map_groups__init(struct map_groups *self)
  13 {
  14         int i;
  15         for (i = 0; i < MAP__NR_TYPES; ++i) {
  16                 self->maps[i] = RB_ROOT;
  17                 INIT_LIST_HEAD(&self->removed_maps[i]);
  18         }
  19 }
  20
  21 static struct thread *thread__new(pid_t pid)
  22 {
  23         struct thread *self = zalloc(sizeof(*self));
  24
  25         if (self != NULL) {
  26                 map_groups__init(&self->mg);
  27                 self->pid = pid;
  28                 self->comm = malloc(32);
  29                 if (self->comm)
  30                         snprintf(self->comm, 32, ":%d", self->pid);
  31         }
  32
  33         return self;
  34 }
  35
  36 int thread__set_comm(struct thread *self, const char *comm)
  37 {
  38         if (self->comm)
  39                 free(self->comm);
  40         self->comm = strdup(comm);
  41         return self->comm ? 0 : -ENOMEM;
  42 }
  43
  44 int thread__comm_len(struct thread *self)
  45 {
  46         if (!self->comm_len) {
  47                 if (!self->comm)
  48                         return 0;
  49                 self->comm_len = strlen(self->comm);
  50         }
  51
  52         return self->comm_len;
  53 }
  54
  55 static const char *map_type__name[MAP__NR_TYPES] = {
  56         [MAP__FUNCTION] = "Functions",
  57         [MAP__VARIABLE] = "Variables",
  58 };
  59
  60 static size_t __map_groups__fprintf_maps(struct map_groups *self,
  61                                          enum map_type type, FILE *fp)
  62 {
  63         size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
  64         struct rb_node *nd;
  65
  66         for (nd = rb_first(&self->maps[type]); nd; nd = rb_next(nd)) {
  67                 struct map *pos = rb_entry(nd, struct map, rb_node);
  68                 printed += fprintf(fp, "Map:");
  69                 printed += map__fprintf(pos, fp);
  70                 if (verbose > 1) {
  71                         printed += dso__fprintf(pos->dso, type, fp);
  72                         printed += fprintf(fp, "--\n");
  73                 }
  74         }
  75
  76         return printed;
  77 }
  78
  79 size_t map_groups__fprintf_maps(struct map_groups *self, FILE *fp)
  80 {
  81         size_t printed = 0, i;
  82         for (i = 0; i < MAP__NR_TYPES; ++i)
  83                 printed += __map_groups__fprintf_maps(self, i, fp);
  84         return printed;
  85 }
  86
  87 static size_t __map_groups__fprintf_removed_maps(struct map_groups *self,
  88                                                  enum map_type type, FILE *fp)
  89 {
  90         struct map *pos;
  91         size_t printed = 0;
  92
  93         list_for_each_entry(pos, &self->removed_maps[type], node) {
  94                 printed += fprintf(fp, "Map:");
  95                 printed += map__fprintf(pos, fp);
  96                 if (verbose > 1) {
  97                         printed += dso__fprintf(pos->dso, type, fp);
  98                         printed += fprintf(fp, "--\n");
  99                 }
 100         }
 101         return printed;
 102 }
 103
 104 static size_t map_groups__fprintf_removed_maps(struct map_groups *self, FILE *fp)
 105 {
 106         size_t printed = 0, i;
 107         for (i = 0; i < MAP__NR_TYPES; ++i)
 108                 printed += __map_groups__fprintf_removed_maps(self, i, fp);
 109         return printed;
 110 }
 111
 112 static size_t map_groups__fprintf(struct map_groups *self, FILE *fp)
 113 {
 114         size_t printed = map_groups__fprintf_maps(self, fp);
 115         printed += fprintf(fp, "Removed maps:\n");
 116         return printed + map_groups__fprintf_removed_maps(self, fp);
 117 }
 118
 119 static size_t thread__fprintf(struct thread *self, FILE *fp)
 120 {
 121         return fprintf(fp, "Thread %d %s\n", self->pid, self->comm) +
 122                map_groups__fprintf(&self->mg, fp);
 123 }
 124
 125 struct thread *threads__findnew(pid_t pid)
 126 {
 127         struct rb_node **p = &threads.rb_node;
 128         struct rb_node *parent = NULL;
 129         struct thread *th;
 130
 131         /*
 132          * Font-end cache - PID lookups come in blocks,
 133          * so most of the time we dont have to look up
 134          * the full rbtree:
 135          */
 136         if (last_match && last_match->pid == pid)
 137                 return last_match;
 138
 139         while (*p != NULL) {
 140                 parent = *p;
 141                 th = rb_entry(parent, struct thread, rb_node);
 142
 143                 if (th->pid == pid) {
 144                         last_match = th;
 145                         return th;
 146                 }
 147
 148                 if (pid < th->pid)
 149                         p = &(*p)->rb_left;
 150                 else
 151                         p = &(*p)->rb_right;
 152         }
 153
 154         th = thread__new(pid);
 155         if (th != NULL) {
 156                 rb_link_node(&th->rb_node, parent, p);
 157                 rb_insert_color(&th->rb_node, &threads);
 158                 last_match = th;
 159         }
 160
 161         return th;
 162 }
 163
 164 struct thread *register_idle_thread(void)
 165 {
 166         struct thread *thread = threads__findnew(0);
 167
 168         if (!thread || thread__set_comm(thread, "swapper")) {
 169                 fprintf(stderr, "problem inserting idle task.\n");
 170                 exit(-1);
 171         }
 172
 173         return thread;
 174 }
 175
 176 static void map_groups__remove_overlappings(struct map_groups *self,
 177                                             struct map *map)
 178 {
 179         struct rb_root *root = &self->maps[map->type];
 180         struct rb_node *next = rb_first(root);
 181
 182         while (next) {
 183                 struct map *pos = rb_entry(next, struct map, rb_node);
 184                 next = rb_next(&pos->rb_node);
 185
 186                 if (!map__overlap(pos, map))
 187                         continue;
 188
 189                 if (verbose >= 2) {
 190                         fputs("overlapping maps:\n", stderr);
 191                         map__fprintf(map, stderr);
 192                         map__fprintf(pos, stderr);
 193                 }
 194
 195                 rb_erase(&pos->rb_node, root);
 196                 /*
 197                  * We may have references to this map, for instance in some
 198                  * hist_entry instances, so just move them to a separate
 199                  * list.
 200                  */
 201                 list_add_tail(&pos->node, &self->removed_maps[map->type]);
 202         }
 203 }
 204
 205 void maps__insert(struct rb_root *maps, struct map *map)
 206 {
 207         struct rb_node **p = &maps->rb_node;
 208         struct rb_node *parent = NULL;
 209         const u64 ip = map->start;
 210         struct map *m;
 211
 212         while (*p != NULL) {
 213                 parent = *p;
 214                 m = rb_entry(parent, struct map, rb_node);
 215                 if (ip < m->start)
 216                         p = &(*p)->rb_left;
 217                 else
 218                         p = &(*p)->rb_right;
 219         }
 220
 221         rb_link_node(&map->rb_node, parent, p);
 222         rb_insert_color(&map->rb_node, maps);
 223 }
 224
 225 struct map *maps__find(struct rb_root *maps, u64 ip)
 226 {
 227         struct rb_node **p = &maps->rb_node;
 228         struct rb_node *parent = NULL;
 229         struct map *m;
 230
 231         while (*p != NULL) {
 232                 parent = *p;
 233                 m = rb_entry(parent, struct map, rb_node);
 234                 if (ip < m->start)
 235                         p = &(*p)->rb_left;
 236                 else if (ip > m->end)
 237                         p = &(*p)->rb_right;
 238                 else
 239                         return m;
 240         }
 241
 242         return NULL;
 243 }
 244
 245 void thread__insert_map(struct thread *self, struct map *map)
 246 {
 247         map_groups__remove_overlappings(&self->mg, map);
 248         map_groups__insert(&self->mg, map);
 249 }
 250
 251 /*
 252  * XXX This should not really _copy_ te maps, but refcount them.
 253  */
 254 static int map_groups__clone(struct map_groups *self,
 255                              struct map_groups *parent, enum map_type type)
 256 {
 257         struct rb_node *nd;
 258         for (nd = rb_first(&parent->maps[type]); nd; nd = rb_next(nd)) {
 259                 struct map *map = rb_entry(nd, struct map, rb_node);
 260                 struct map *new = map__clone(map);
 261                 if (new == NULL)
 262                         return -ENOMEM;
 263                 map_groups__insert(self, new);
 264         }
 265         return 0;
 266 }
 267
 268 int thread__fork(struct thread *self, struct thread *parent)
 269 {
 270         int i;
 271
 272         if (self->comm)
 273                 free(self->comm);
 274         self->comm = strdup(parent->comm);
 275         if (!self->comm)
 276                 return -ENOMEM;
 277
 278         for (i = 0; i < MAP__NR_TYPES; ++i)
 279                 if (map_groups__clone(&self->mg, &parent->mg, i) < 0)
 280                         return -ENOMEM;
 281         return 0;
 282 }
 283
 284 size_t threads__fprintf(FILE *fp)
 285 {
 286         size_t ret = 0;
 287         struct rb_node *nd;
 288
 289         for (nd = rb_first(&threads); nd; nd = rb_next(nd)) {
 290                 struct thread *pos = rb_entry(nd, struct thread, rb_node);
 291
 292                 ret += thread__fprintf(pos, fp);
 293         }
 294
 295         return ret;
 296 }
 297
 298 struct symbol *map_groups__find_symbol(struct map_groups *self,
 299                                        enum map_type type, u64 addr,
 300                                        symbol_filter_t filter)
 301 {
 302         struct map *map = map_groups__find(self, type, addr);
 303
 304         if (map != NULL)
 305                 return map__find_symbol(map, map->map_ip(map, addr), filter);
 306
 307         return NULL;
 308 }