Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 | #include "../perf.h" #include <stdlib.h> #include <stdio.h> #include <string.h> #include "thread.h" #include "util.h" #include "debug.h" static struct thread *thread__new(pid_t pid) { struct thread *self = calloc(1, sizeof(*self)); if (self != NULL) { self->pid = pid; self->comm = malloc(32); if (self->comm) snprintf(self->comm, 32, ":%d", self->pid); INIT_LIST_HEAD(&self->maps); } return self; } int thread__set_comm(struct thread *self, const char *comm) { if (self->comm) free(self->comm); self->comm = strdup(comm); return self->comm ? 0 : -ENOMEM; } static size_t thread__fprintf(struct thread *self, FILE *fp) { struct map *pos; size_t ret = fprintf(fp, "Thread %d %s\n", self->pid, self->comm); list_for_each_entry(pos, &self->maps, node) ret += map__fprintf(pos, fp); return ret; } struct thread * threads__findnew(pid_t pid, struct rb_root *threads, struct thread **last_match) { struct rb_node **p = &threads->rb_node; struct rb_node *parent = NULL; struct thread *th; /* * Font-end cache - PID lookups come in blocks, * so most of the time we dont have to look up * the full rbtree: */ if (*last_match && (*last_match)->pid == pid) return *last_match; while (*p != NULL) { parent = *p; th = rb_entry(parent, struct thread, rb_node); if (th->pid == pid) { *last_match = th; return th; } if (pid < th->pid) p = &(*p)->rb_left; else p = &(*p)->rb_right; } th = thread__new(pid); if (th != NULL) { rb_link_node(&th->rb_node, parent, p); rb_insert_color(&th->rb_node, threads); *last_match = th; } return th; } struct thread * register_idle_thread(struct rb_root *threads, struct thread **last_match) { struct thread *thread = threads__findnew(0, threads, last_match); if (!thread || thread__set_comm(thread, "swapper")) { fprintf(stderr, "problem inserting idle task.\n"); exit(-1); } return thread; } void thread__insert_map(struct thread *self, struct map *map) { struct map *pos, *tmp; list_for_each_entry_safe(pos, tmp, &self->maps, node) { if (map__overlap(pos, map)) { if (verbose >= 2) { printf("overlapping maps:\n"); map__fprintf(map, stdout); map__fprintf(pos, stdout); } if (map->start <= pos->start && map->end > pos->start) pos->start = map->end; if (map->end >= pos->end && map->start < pos->end) pos->end = map->start; if (verbose >= 2) { printf("after collision:\n"); map__fprintf(pos, stdout); } if (pos->start >= pos->end) { list_del_init(&pos->node); free(pos); } } } list_add_tail(&map->node, &self->maps); } int thread__fork(struct thread *self, struct thread *parent) { struct map *map; if (self->comm) free(self->comm); self->comm = strdup(parent->comm); if (!self->comm) return -ENOMEM; list_for_each_entry(map, &parent->maps, node) { struct map *new = map__clone(map); if (!new) return -ENOMEM; thread__insert_map(self, new); } return 0; } struct map *thread__find_map(struct thread *self, u64 ip) { struct map *pos; if (self == NULL) return NULL; list_for_each_entry(pos, &self->maps, node) if (ip >= pos->start && ip <= pos->end) return pos; return NULL; } size_t threads__fprintf(FILE *fp, struct rb_root *threads) { size_t ret = 0; struct rb_node *nd; for (nd = rb_first(threads); nd; nd = rb_next(nd)) { struct thread *pos = rb_entry(nd, struct thread, rb_node); ret += thread__fprintf(pos, fp); } return ret; } |