evlist.c 3.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159
  1. #include <poll.h>
  2. #include "evlist.h"
  3. #include "evsel.h"
  4. #include "util.h"
  5. #include <linux/bitops.h>
  6. #include <linux/hash.h>
  7. struct perf_evlist *perf_evlist__new(void)
  8. {
  9. struct perf_evlist *evlist = zalloc(sizeof(*evlist));
  10. if (evlist != NULL) {
  11. int i;
  12. for (i = 0; i < PERF_EVLIST__HLIST_SIZE; ++i)
  13. INIT_HLIST_HEAD(&evlist->heads[i]);
  14. INIT_LIST_HEAD(&evlist->entries);
  15. }
  16. return evlist;
  17. }
  18. static void perf_evlist__purge(struct perf_evlist *evlist)
  19. {
  20. struct perf_evsel *pos, *n;
  21. list_for_each_entry_safe(pos, n, &evlist->entries, node) {
  22. list_del_init(&pos->node);
  23. perf_evsel__delete(pos);
  24. }
  25. evlist->nr_entries = 0;
  26. }
  27. void perf_evlist__delete(struct perf_evlist *evlist)
  28. {
  29. perf_evlist__purge(evlist);
  30. free(evlist->mmap);
  31. free(evlist->pollfd);
  32. free(evlist);
  33. }
  34. void perf_evlist__add(struct perf_evlist *evlist, struct perf_evsel *entry)
  35. {
  36. list_add_tail(&entry->node, &evlist->entries);
  37. ++evlist->nr_entries;
  38. }
  39. int perf_evlist__add_default(struct perf_evlist *evlist)
  40. {
  41. struct perf_event_attr attr = {
  42. .type = PERF_TYPE_HARDWARE,
  43. .config = PERF_COUNT_HW_CPU_CYCLES,
  44. };
  45. struct perf_evsel *evsel = perf_evsel__new(&attr, 0);
  46. if (evsel == NULL)
  47. return -ENOMEM;
  48. perf_evlist__add(evlist, evsel);
  49. return 0;
  50. }
  51. int perf_evlist__alloc_pollfd(struct perf_evlist *evlist, int ncpus, int nthreads)
  52. {
  53. int nfds = ncpus * nthreads * evlist->nr_entries;
  54. evlist->pollfd = malloc(sizeof(struct pollfd) * nfds);
  55. return evlist->pollfd != NULL ? 0 : -ENOMEM;
  56. }
  57. void perf_evlist__add_pollfd(struct perf_evlist *evlist, int fd)
  58. {
  59. fcntl(fd, F_SETFL, O_NONBLOCK);
  60. evlist->pollfd[evlist->nr_fds].fd = fd;
  61. evlist->pollfd[evlist->nr_fds].events = POLLIN;
  62. evlist->nr_fds++;
  63. }
  64. struct perf_evsel *perf_evlist__id2evsel(struct perf_evlist *evlist, u64 id)
  65. {
  66. struct hlist_head *head;
  67. struct hlist_node *pos;
  68. struct perf_sample_id *sid;
  69. int hash;
  70. if (evlist->nr_entries == 1)
  71. return list_entry(evlist->entries.next, struct perf_evsel, node);
  72. hash = hash_64(id, PERF_EVLIST__HLIST_BITS);
  73. head = &evlist->heads[hash];
  74. hlist_for_each_entry(sid, pos, head, node)
  75. if (sid->id == id)
  76. return sid->evsel;
  77. return NULL;
  78. }
  79. event_t *perf_evlist__read_on_cpu(struct perf_evlist *evlist, int cpu)
  80. {
  81. /* XXX Move this to perf.c, making it generally available */
  82. unsigned int page_size = sysconf(_SC_PAGE_SIZE);
  83. struct perf_mmap *md = &evlist->mmap[cpu];
  84. unsigned int head = perf_mmap__read_head(md);
  85. unsigned int old = md->prev;
  86. unsigned char *data = md->base + page_size;
  87. event_t *event = NULL;
  88. int diff;
  89. /*
  90. * If we're further behind than half the buffer, there's a chance
  91. * the writer will bite our tail and mess up the samples under us.
  92. *
  93. * If we somehow ended up ahead of the head, we got messed up.
  94. *
  95. * In either case, truncate and restart at head.
  96. */
  97. diff = head - old;
  98. if (diff > md->mask / 2 || diff < 0) {
  99. fprintf(stderr, "WARNING: failed to keep up with mmap data.\n");
  100. /*
  101. * head points to a known good entry, start there.
  102. */
  103. old = head;
  104. }
  105. if (old != head) {
  106. size_t size;
  107. event = (event_t *)&data[old & md->mask];
  108. size = event->header.size;
  109. /*
  110. * Event straddles the mmap boundary -- header should always
  111. * be inside due to u64 alignment of output.
  112. */
  113. if ((old & md->mask) + size != ((old + size) & md->mask)) {
  114. unsigned int offset = old;
  115. unsigned int len = min(sizeof(*event), size), cpy;
  116. void *dst = &evlist->event_copy;
  117. do {
  118. cpy = min(md->mask + 1 - (offset & md->mask), len);
  119. memcpy(dst, &data[offset & md->mask], cpy);
  120. offset += cpy;
  121. dst += cpy;
  122. len -= cpy;
  123. } while (len);
  124. event = &evlist->event_copy;
  125. }
  126. old += size;
  127. }
  128. md->prev = old;
  129. return event;
  130. }