auxtrace.c 31 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359
  1. /*
  2. * auxtrace.c: AUX area trace support
  3. * Copyright (c) 2013-2015, Intel Corporation.
  4. *
  5. * This program is free software; you can redistribute it and/or modify it
  6. * under the terms and conditions of the GNU General Public License,
  7. * version 2, as published by the Free Software Foundation.
  8. *
  9. * This program is distributed in the hope it will be useful, but WITHOUT
  10. * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11. * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
  12. * more details.
  13. *
  14. */
  15. #include <sys/types.h>
  16. #include <sys/mman.h>
  17. #include <stdbool.h>
  18. #include <linux/kernel.h>
  19. #include <linux/perf_event.h>
  20. #include <linux/types.h>
  21. #include <linux/bitops.h>
  22. #include <linux/log2.h>
  23. #include <linux/string.h>
  24. #include <sys/param.h>
  25. #include <stdlib.h>
  26. #include <stdio.h>
  27. #include <string.h>
  28. #include <limits.h>
  29. #include <errno.h>
  30. #include <linux/list.h>
  31. #include "../perf.h"
  32. #include "util.h"
  33. #include "evlist.h"
  34. #include "cpumap.h"
  35. #include "thread_map.h"
  36. #include "asm/bug.h"
  37. #include "auxtrace.h"
  38. #include <linux/hash.h>
  39. #include "event.h"
  40. #include "session.h"
  41. #include "debug.h"
  42. #include "parse-options.h"
  43. int auxtrace_mmap__mmap(struct auxtrace_mmap *mm,
  44. struct auxtrace_mmap_params *mp,
  45. void *userpg, int fd)
  46. {
  47. struct perf_event_mmap_page *pc = userpg;
  48. WARN_ONCE(mm->base, "Uninitialized auxtrace_mmap\n");
  49. mm->userpg = userpg;
  50. mm->mask = mp->mask;
  51. mm->len = mp->len;
  52. mm->prev = 0;
  53. mm->idx = mp->idx;
  54. mm->tid = mp->tid;
  55. mm->cpu = mp->cpu;
  56. if (!mp->len) {
  57. mm->base = NULL;
  58. return 0;
  59. }
  60. #if BITS_PER_LONG != 64 && !defined(HAVE_SYNC_COMPARE_AND_SWAP_SUPPORT)
  61. pr_err("Cannot use AUX area tracing mmaps\n");
  62. return -1;
  63. #endif
  64. pc->aux_offset = mp->offset;
  65. pc->aux_size = mp->len;
  66. mm->base = mmap(NULL, mp->len, mp->prot, MAP_SHARED, fd, mp->offset);
  67. if (mm->base == MAP_FAILED) {
  68. pr_debug2("failed to mmap AUX area\n");
  69. mm->base = NULL;
  70. return -1;
  71. }
  72. return 0;
  73. }
  74. void auxtrace_mmap__munmap(struct auxtrace_mmap *mm)
  75. {
  76. if (mm->base) {
  77. munmap(mm->base, mm->len);
  78. mm->base = NULL;
  79. }
  80. }
  81. void auxtrace_mmap_params__init(struct auxtrace_mmap_params *mp,
  82. off_t auxtrace_offset,
  83. unsigned int auxtrace_pages,
  84. bool auxtrace_overwrite)
  85. {
  86. if (auxtrace_pages) {
  87. mp->offset = auxtrace_offset;
  88. mp->len = auxtrace_pages * (size_t)page_size;
  89. mp->mask = is_power_of_2(mp->len) ? mp->len - 1 : 0;
  90. mp->prot = PROT_READ | (auxtrace_overwrite ? 0 : PROT_WRITE);
  91. pr_debug2("AUX area mmap length %zu\n", mp->len);
  92. } else {
  93. mp->len = 0;
  94. }
  95. }
  96. void auxtrace_mmap_params__set_idx(struct auxtrace_mmap_params *mp,
  97. struct perf_evlist *evlist, int idx,
  98. bool per_cpu)
  99. {
  100. mp->idx = idx;
  101. if (per_cpu) {
  102. mp->cpu = evlist->cpus->map[idx];
  103. if (evlist->threads)
  104. mp->tid = thread_map__pid(evlist->threads, 0);
  105. else
  106. mp->tid = -1;
  107. } else {
  108. mp->cpu = -1;
  109. mp->tid = thread_map__pid(evlist->threads, idx);
  110. }
  111. }
  112. #define AUXTRACE_INIT_NR_QUEUES 32
  113. static struct auxtrace_queue *auxtrace_alloc_queue_array(unsigned int nr_queues)
  114. {
  115. struct auxtrace_queue *queue_array;
  116. unsigned int max_nr_queues, i;
  117. max_nr_queues = UINT_MAX / sizeof(struct auxtrace_queue);
  118. if (nr_queues > max_nr_queues)
  119. return NULL;
  120. queue_array = calloc(nr_queues, sizeof(struct auxtrace_queue));
  121. if (!queue_array)
  122. return NULL;
  123. for (i = 0; i < nr_queues; i++) {
  124. INIT_LIST_HEAD(&queue_array[i].head);
  125. queue_array[i].priv = NULL;
  126. }
  127. return queue_array;
  128. }
  129. int auxtrace_queues__init(struct auxtrace_queues *queues)
  130. {
  131. queues->nr_queues = AUXTRACE_INIT_NR_QUEUES;
  132. queues->queue_array = auxtrace_alloc_queue_array(queues->nr_queues);
  133. if (!queues->queue_array)
  134. return -ENOMEM;
  135. return 0;
  136. }
  137. static int auxtrace_queues__grow(struct auxtrace_queues *queues,
  138. unsigned int new_nr_queues)
  139. {
  140. unsigned int nr_queues = queues->nr_queues;
  141. struct auxtrace_queue *queue_array;
  142. unsigned int i;
  143. if (!nr_queues)
  144. nr_queues = AUXTRACE_INIT_NR_QUEUES;
  145. while (nr_queues && nr_queues < new_nr_queues)
  146. nr_queues <<= 1;
  147. if (nr_queues < queues->nr_queues || nr_queues < new_nr_queues)
  148. return -EINVAL;
  149. queue_array = auxtrace_alloc_queue_array(nr_queues);
  150. if (!queue_array)
  151. return -ENOMEM;
  152. for (i = 0; i < queues->nr_queues; i++) {
  153. list_splice_tail(&queues->queue_array[i].head,
  154. &queue_array[i].head);
  155. queue_array[i].priv = queues->queue_array[i].priv;
  156. }
  157. queues->nr_queues = nr_queues;
  158. queues->queue_array = queue_array;
  159. return 0;
  160. }
  161. static void *auxtrace_copy_data(u64 size, struct perf_session *session)
  162. {
  163. int fd = perf_data_file__fd(session->file);
  164. void *p;
  165. ssize_t ret;
  166. if (size > SSIZE_MAX)
  167. return NULL;
  168. p = malloc(size);
  169. if (!p)
  170. return NULL;
  171. ret = readn(fd, p, size);
  172. if (ret != (ssize_t)size) {
  173. free(p);
  174. return NULL;
  175. }
  176. return p;
  177. }
  178. static int auxtrace_queues__add_buffer(struct auxtrace_queues *queues,
  179. unsigned int idx,
  180. struct auxtrace_buffer *buffer)
  181. {
  182. struct auxtrace_queue *queue;
  183. int err;
  184. if (idx >= queues->nr_queues) {
  185. err = auxtrace_queues__grow(queues, idx + 1);
  186. if (err)
  187. return err;
  188. }
  189. queue = &queues->queue_array[idx];
  190. if (!queue->set) {
  191. queue->set = true;
  192. queue->tid = buffer->tid;
  193. queue->cpu = buffer->cpu;
  194. } else if (buffer->cpu != queue->cpu || buffer->tid != queue->tid) {
  195. pr_err("auxtrace queue conflict: cpu %d, tid %d vs cpu %d, tid %d\n",
  196. queue->cpu, queue->tid, buffer->cpu, buffer->tid);
  197. return -EINVAL;
  198. }
  199. buffer->buffer_nr = queues->next_buffer_nr++;
  200. list_add_tail(&buffer->list, &queue->head);
  201. queues->new_data = true;
  202. queues->populated = true;
  203. return 0;
  204. }
  205. /* Limit buffers to 32MiB on 32-bit */
  206. #define BUFFER_LIMIT_FOR_32_BIT (32 * 1024 * 1024)
  207. static int auxtrace_queues__split_buffer(struct auxtrace_queues *queues,
  208. unsigned int idx,
  209. struct auxtrace_buffer *buffer)
  210. {
  211. u64 sz = buffer->size;
  212. bool consecutive = false;
  213. struct auxtrace_buffer *b;
  214. int err;
  215. while (sz > BUFFER_LIMIT_FOR_32_BIT) {
  216. b = memdup(buffer, sizeof(struct auxtrace_buffer));
  217. if (!b)
  218. return -ENOMEM;
  219. b->size = BUFFER_LIMIT_FOR_32_BIT;
  220. b->consecutive = consecutive;
  221. err = auxtrace_queues__add_buffer(queues, idx, b);
  222. if (err) {
  223. auxtrace_buffer__free(b);
  224. return err;
  225. }
  226. buffer->data_offset += BUFFER_LIMIT_FOR_32_BIT;
  227. sz -= BUFFER_LIMIT_FOR_32_BIT;
  228. consecutive = true;
  229. }
  230. buffer->size = sz;
  231. buffer->consecutive = consecutive;
  232. return 0;
  233. }
  234. static int auxtrace_queues__add_event_buffer(struct auxtrace_queues *queues,
  235. struct perf_session *session,
  236. unsigned int idx,
  237. struct auxtrace_buffer *buffer)
  238. {
  239. if (session->one_mmap) {
  240. buffer->data = buffer->data_offset - session->one_mmap_offset +
  241. session->one_mmap_addr;
  242. } else if (perf_data_file__is_pipe(session->file)) {
  243. buffer->data = auxtrace_copy_data(buffer->size, session);
  244. if (!buffer->data)
  245. return -ENOMEM;
  246. buffer->data_needs_freeing = true;
  247. } else if (BITS_PER_LONG == 32 &&
  248. buffer->size > BUFFER_LIMIT_FOR_32_BIT) {
  249. int err;
  250. err = auxtrace_queues__split_buffer(queues, idx, buffer);
  251. if (err)
  252. return err;
  253. }
  254. return auxtrace_queues__add_buffer(queues, idx, buffer);
  255. }
  256. int auxtrace_queues__add_event(struct auxtrace_queues *queues,
  257. struct perf_session *session,
  258. union perf_event *event, off_t data_offset,
  259. struct auxtrace_buffer **buffer_ptr)
  260. {
  261. struct auxtrace_buffer *buffer;
  262. unsigned int idx;
  263. int err;
  264. buffer = zalloc(sizeof(struct auxtrace_buffer));
  265. if (!buffer)
  266. return -ENOMEM;
  267. buffer->pid = -1;
  268. buffer->tid = event->auxtrace.tid;
  269. buffer->cpu = event->auxtrace.cpu;
  270. buffer->data_offset = data_offset;
  271. buffer->offset = event->auxtrace.offset;
  272. buffer->reference = event->auxtrace.reference;
  273. buffer->size = event->auxtrace.size;
  274. idx = event->auxtrace.idx;
  275. err = auxtrace_queues__add_event_buffer(queues, session, idx, buffer);
  276. if (err)
  277. goto out_err;
  278. if (buffer_ptr)
  279. *buffer_ptr = buffer;
  280. return 0;
  281. out_err:
  282. auxtrace_buffer__free(buffer);
  283. return err;
  284. }
  285. static int auxtrace_queues__add_indexed_event(struct auxtrace_queues *queues,
  286. struct perf_session *session,
  287. off_t file_offset, size_t sz)
  288. {
  289. union perf_event *event;
  290. int err;
  291. char buf[PERF_SAMPLE_MAX_SIZE];
  292. err = perf_session__peek_event(session, file_offset, buf,
  293. PERF_SAMPLE_MAX_SIZE, &event, NULL);
  294. if (err)
  295. return err;
  296. if (event->header.type == PERF_RECORD_AUXTRACE) {
  297. if (event->header.size < sizeof(struct auxtrace_event) ||
  298. event->header.size != sz) {
  299. err = -EINVAL;
  300. goto out;
  301. }
  302. file_offset += event->header.size;
  303. err = auxtrace_queues__add_event(queues, session, event,
  304. file_offset, NULL);
  305. }
  306. out:
  307. return err;
  308. }
  309. void auxtrace_queues__free(struct auxtrace_queues *queues)
  310. {
  311. unsigned int i;
  312. for (i = 0; i < queues->nr_queues; i++) {
  313. while (!list_empty(&queues->queue_array[i].head)) {
  314. struct auxtrace_buffer *buffer;
  315. buffer = list_entry(queues->queue_array[i].head.next,
  316. struct auxtrace_buffer, list);
  317. list_del(&buffer->list);
  318. auxtrace_buffer__free(buffer);
  319. }
  320. }
  321. zfree(&queues->queue_array);
  322. queues->nr_queues = 0;
  323. }
  324. static void auxtrace_heapify(struct auxtrace_heap_item *heap_array,
  325. unsigned int pos, unsigned int queue_nr,
  326. u64 ordinal)
  327. {
  328. unsigned int parent;
  329. while (pos) {
  330. parent = (pos - 1) >> 1;
  331. if (heap_array[parent].ordinal <= ordinal)
  332. break;
  333. heap_array[pos] = heap_array[parent];
  334. pos = parent;
  335. }
  336. heap_array[pos].queue_nr = queue_nr;
  337. heap_array[pos].ordinal = ordinal;
  338. }
  339. int auxtrace_heap__add(struct auxtrace_heap *heap, unsigned int queue_nr,
  340. u64 ordinal)
  341. {
  342. struct auxtrace_heap_item *heap_array;
  343. if (queue_nr >= heap->heap_sz) {
  344. unsigned int heap_sz = AUXTRACE_INIT_NR_QUEUES;
  345. while (heap_sz <= queue_nr)
  346. heap_sz <<= 1;
  347. heap_array = realloc(heap->heap_array,
  348. heap_sz * sizeof(struct auxtrace_heap_item));
  349. if (!heap_array)
  350. return -ENOMEM;
  351. heap->heap_array = heap_array;
  352. heap->heap_sz = heap_sz;
  353. }
  354. auxtrace_heapify(heap->heap_array, heap->heap_cnt++, queue_nr, ordinal);
  355. return 0;
  356. }
  357. void auxtrace_heap__free(struct auxtrace_heap *heap)
  358. {
  359. zfree(&heap->heap_array);
  360. heap->heap_cnt = 0;
  361. heap->heap_sz = 0;
  362. }
  363. void auxtrace_heap__pop(struct auxtrace_heap *heap)
  364. {
  365. unsigned int pos, last, heap_cnt = heap->heap_cnt;
  366. struct auxtrace_heap_item *heap_array;
  367. if (!heap_cnt)
  368. return;
  369. heap->heap_cnt -= 1;
  370. heap_array = heap->heap_array;
  371. pos = 0;
  372. while (1) {
  373. unsigned int left, right;
  374. left = (pos << 1) + 1;
  375. if (left >= heap_cnt)
  376. break;
  377. right = left + 1;
  378. if (right >= heap_cnt) {
  379. heap_array[pos] = heap_array[left];
  380. return;
  381. }
  382. if (heap_array[left].ordinal < heap_array[right].ordinal) {
  383. heap_array[pos] = heap_array[left];
  384. pos = left;
  385. } else {
  386. heap_array[pos] = heap_array[right];
  387. pos = right;
  388. }
  389. }
  390. last = heap_cnt - 1;
  391. auxtrace_heapify(heap_array, pos, heap_array[last].queue_nr,
  392. heap_array[last].ordinal);
  393. }
  394. size_t auxtrace_record__info_priv_size(struct auxtrace_record *itr)
  395. {
  396. if (itr)
  397. return itr->info_priv_size(itr);
  398. return 0;
  399. }
  400. static int auxtrace_not_supported(void)
  401. {
  402. pr_err("AUX area tracing is not supported on this architecture\n");
  403. return -EINVAL;
  404. }
  405. int auxtrace_record__info_fill(struct auxtrace_record *itr,
  406. struct perf_session *session,
  407. struct auxtrace_info_event *auxtrace_info,
  408. size_t priv_size)
  409. {
  410. if (itr)
  411. return itr->info_fill(itr, session, auxtrace_info, priv_size);
  412. return auxtrace_not_supported();
  413. }
  414. void auxtrace_record__free(struct auxtrace_record *itr)
  415. {
  416. if (itr)
  417. itr->free(itr);
  418. }
  419. int auxtrace_record__snapshot_start(struct auxtrace_record *itr)
  420. {
  421. if (itr && itr->snapshot_start)
  422. return itr->snapshot_start(itr);
  423. return 0;
  424. }
  425. int auxtrace_record__snapshot_finish(struct auxtrace_record *itr)
  426. {
  427. if (itr && itr->snapshot_finish)
  428. return itr->snapshot_finish(itr);
  429. return 0;
  430. }
  431. int auxtrace_record__find_snapshot(struct auxtrace_record *itr, int idx,
  432. struct auxtrace_mmap *mm,
  433. unsigned char *data, u64 *head, u64 *old)
  434. {
  435. if (itr && itr->find_snapshot)
  436. return itr->find_snapshot(itr, idx, mm, data, head, old);
  437. return 0;
  438. }
  439. int auxtrace_record__options(struct auxtrace_record *itr,
  440. struct perf_evlist *evlist,
  441. struct record_opts *opts)
  442. {
  443. if (itr)
  444. return itr->recording_options(itr, evlist, opts);
  445. return 0;
  446. }
  447. u64 auxtrace_record__reference(struct auxtrace_record *itr)
  448. {
  449. if (itr)
  450. return itr->reference(itr);
  451. return 0;
  452. }
  453. int auxtrace_parse_snapshot_options(struct auxtrace_record *itr,
  454. struct record_opts *opts, const char *str)
  455. {
  456. if (!str)
  457. return 0;
  458. if (itr)
  459. return itr->parse_snapshot_options(itr, opts, str);
  460. pr_err("No AUX area tracing to snapshot\n");
  461. return -EINVAL;
  462. }
  463. struct auxtrace_record *__weak
  464. auxtrace_record__init(struct perf_evlist *evlist __maybe_unused, int *err)
  465. {
  466. *err = 0;
  467. return NULL;
  468. }
  469. static int auxtrace_index__alloc(struct list_head *head)
  470. {
  471. struct auxtrace_index *auxtrace_index;
  472. auxtrace_index = malloc(sizeof(struct auxtrace_index));
  473. if (!auxtrace_index)
  474. return -ENOMEM;
  475. auxtrace_index->nr = 0;
  476. INIT_LIST_HEAD(&auxtrace_index->list);
  477. list_add_tail(&auxtrace_index->list, head);
  478. return 0;
  479. }
  480. void auxtrace_index__free(struct list_head *head)
  481. {
  482. struct auxtrace_index *auxtrace_index, *n;
  483. list_for_each_entry_safe(auxtrace_index, n, head, list) {
  484. list_del(&auxtrace_index->list);
  485. free(auxtrace_index);
  486. }
  487. }
  488. static struct auxtrace_index *auxtrace_index__last(struct list_head *head)
  489. {
  490. struct auxtrace_index *auxtrace_index;
  491. int err;
  492. if (list_empty(head)) {
  493. err = auxtrace_index__alloc(head);
  494. if (err)
  495. return NULL;
  496. }
  497. auxtrace_index = list_entry(head->prev, struct auxtrace_index, list);
  498. if (auxtrace_index->nr >= PERF_AUXTRACE_INDEX_ENTRY_COUNT) {
  499. err = auxtrace_index__alloc(head);
  500. if (err)
  501. return NULL;
  502. auxtrace_index = list_entry(head->prev, struct auxtrace_index,
  503. list);
  504. }
  505. return auxtrace_index;
  506. }
  507. int auxtrace_index__auxtrace_event(struct list_head *head,
  508. union perf_event *event, off_t file_offset)
  509. {
  510. struct auxtrace_index *auxtrace_index;
  511. size_t nr;
  512. auxtrace_index = auxtrace_index__last(head);
  513. if (!auxtrace_index)
  514. return -ENOMEM;
  515. nr = auxtrace_index->nr;
  516. auxtrace_index->entries[nr].file_offset = file_offset;
  517. auxtrace_index->entries[nr].sz = event->header.size;
  518. auxtrace_index->nr += 1;
  519. return 0;
  520. }
  521. static int auxtrace_index__do_write(int fd,
  522. struct auxtrace_index *auxtrace_index)
  523. {
  524. struct auxtrace_index_entry ent;
  525. size_t i;
  526. for (i = 0; i < auxtrace_index->nr; i++) {
  527. ent.file_offset = auxtrace_index->entries[i].file_offset;
  528. ent.sz = auxtrace_index->entries[i].sz;
  529. if (writen(fd, &ent, sizeof(ent)) != sizeof(ent))
  530. return -errno;
  531. }
  532. return 0;
  533. }
  534. int auxtrace_index__write(int fd, struct list_head *head)
  535. {
  536. struct auxtrace_index *auxtrace_index;
  537. u64 total = 0;
  538. int err;
  539. list_for_each_entry(auxtrace_index, head, list)
  540. total += auxtrace_index->nr;
  541. if (writen(fd, &total, sizeof(total)) != sizeof(total))
  542. return -errno;
  543. list_for_each_entry(auxtrace_index, head, list) {
  544. err = auxtrace_index__do_write(fd, auxtrace_index);
  545. if (err)
  546. return err;
  547. }
  548. return 0;
  549. }
  550. static int auxtrace_index__process_entry(int fd, struct list_head *head,
  551. bool needs_swap)
  552. {
  553. struct auxtrace_index *auxtrace_index;
  554. struct auxtrace_index_entry ent;
  555. size_t nr;
  556. if (readn(fd, &ent, sizeof(ent)) != sizeof(ent))
  557. return -1;
  558. auxtrace_index = auxtrace_index__last(head);
  559. if (!auxtrace_index)
  560. return -1;
  561. nr = auxtrace_index->nr;
  562. if (needs_swap) {
  563. auxtrace_index->entries[nr].file_offset =
  564. bswap_64(ent.file_offset);
  565. auxtrace_index->entries[nr].sz = bswap_64(ent.sz);
  566. } else {
  567. auxtrace_index->entries[nr].file_offset = ent.file_offset;
  568. auxtrace_index->entries[nr].sz = ent.sz;
  569. }
  570. auxtrace_index->nr = nr + 1;
  571. return 0;
  572. }
  573. int auxtrace_index__process(int fd, u64 size, struct perf_session *session,
  574. bool needs_swap)
  575. {
  576. struct list_head *head = &session->auxtrace_index;
  577. u64 nr;
  578. if (readn(fd, &nr, sizeof(u64)) != sizeof(u64))
  579. return -1;
  580. if (needs_swap)
  581. nr = bswap_64(nr);
  582. if (sizeof(u64) + nr * sizeof(struct auxtrace_index_entry) > size)
  583. return -1;
  584. while (nr--) {
  585. int err;
  586. err = auxtrace_index__process_entry(fd, head, needs_swap);
  587. if (err)
  588. return -1;
  589. }
  590. return 0;
  591. }
  592. static int auxtrace_queues__process_index_entry(struct auxtrace_queues *queues,
  593. struct perf_session *session,
  594. struct auxtrace_index_entry *ent)
  595. {
  596. return auxtrace_queues__add_indexed_event(queues, session,
  597. ent->file_offset, ent->sz);
  598. }
  599. int auxtrace_queues__process_index(struct auxtrace_queues *queues,
  600. struct perf_session *session)
  601. {
  602. struct auxtrace_index *auxtrace_index;
  603. struct auxtrace_index_entry *ent;
  604. size_t i;
  605. int err;
  606. list_for_each_entry(auxtrace_index, &session->auxtrace_index, list) {
  607. for (i = 0; i < auxtrace_index->nr; i++) {
  608. ent = &auxtrace_index->entries[i];
  609. err = auxtrace_queues__process_index_entry(queues,
  610. session,
  611. ent);
  612. if (err)
  613. return err;
  614. }
  615. }
  616. return 0;
  617. }
  618. struct auxtrace_buffer *auxtrace_buffer__next(struct auxtrace_queue *queue,
  619. struct auxtrace_buffer *buffer)
  620. {
  621. if (buffer) {
  622. if (list_is_last(&buffer->list, &queue->head))
  623. return NULL;
  624. return list_entry(buffer->list.next, struct auxtrace_buffer,
  625. list);
  626. } else {
  627. if (list_empty(&queue->head))
  628. return NULL;
  629. return list_entry(queue->head.next, struct auxtrace_buffer,
  630. list);
  631. }
  632. }
  633. void *auxtrace_buffer__get_data(struct auxtrace_buffer *buffer, int fd)
  634. {
  635. size_t adj = buffer->data_offset & (page_size - 1);
  636. size_t size = buffer->size + adj;
  637. off_t file_offset = buffer->data_offset - adj;
  638. void *addr;
  639. if (buffer->data)
  640. return buffer->data;
  641. addr = mmap(NULL, size, PROT_READ, MAP_SHARED, fd, file_offset);
  642. if (addr == MAP_FAILED)
  643. return NULL;
  644. buffer->mmap_addr = addr;
  645. buffer->mmap_size = size;
  646. buffer->data = addr + adj;
  647. return buffer->data;
  648. }
  649. void auxtrace_buffer__put_data(struct auxtrace_buffer *buffer)
  650. {
  651. if (!buffer->data || !buffer->mmap_addr)
  652. return;
  653. munmap(buffer->mmap_addr, buffer->mmap_size);
  654. buffer->mmap_addr = NULL;
  655. buffer->mmap_size = 0;
  656. buffer->data = NULL;
  657. buffer->use_data = NULL;
  658. }
  659. void auxtrace_buffer__drop_data(struct auxtrace_buffer *buffer)
  660. {
  661. auxtrace_buffer__put_data(buffer);
  662. if (buffer->data_needs_freeing) {
  663. buffer->data_needs_freeing = false;
  664. zfree(&buffer->data);
  665. buffer->use_data = NULL;
  666. buffer->size = 0;
  667. }
  668. }
  669. void auxtrace_buffer__free(struct auxtrace_buffer *buffer)
  670. {
  671. auxtrace_buffer__drop_data(buffer);
  672. free(buffer);
  673. }
  674. void auxtrace_synth_error(struct auxtrace_error_event *auxtrace_error, int type,
  675. int code, int cpu, pid_t pid, pid_t tid, u64 ip,
  676. const char *msg)
  677. {
  678. size_t size;
  679. memset(auxtrace_error, 0, sizeof(struct auxtrace_error_event));
  680. auxtrace_error->header.type = PERF_RECORD_AUXTRACE_ERROR;
  681. auxtrace_error->type = type;
  682. auxtrace_error->code = code;
  683. auxtrace_error->cpu = cpu;
  684. auxtrace_error->pid = pid;
  685. auxtrace_error->tid = tid;
  686. auxtrace_error->ip = ip;
  687. strlcpy(auxtrace_error->msg, msg, MAX_AUXTRACE_ERROR_MSG);
  688. size = (void *)auxtrace_error->msg - (void *)auxtrace_error +
  689. strlen(auxtrace_error->msg) + 1;
  690. auxtrace_error->header.size = PERF_ALIGN(size, sizeof(u64));
  691. }
  692. int perf_event__synthesize_auxtrace_info(struct auxtrace_record *itr,
  693. struct perf_tool *tool,
  694. struct perf_session *session,
  695. perf_event__handler_t process)
  696. {
  697. union perf_event *ev;
  698. size_t priv_size;
  699. int err;
  700. pr_debug2("Synthesizing auxtrace information\n");
  701. priv_size = auxtrace_record__info_priv_size(itr);
  702. ev = zalloc(sizeof(struct auxtrace_info_event) + priv_size);
  703. if (!ev)
  704. return -ENOMEM;
  705. ev->auxtrace_info.header.type = PERF_RECORD_AUXTRACE_INFO;
  706. ev->auxtrace_info.header.size = sizeof(struct auxtrace_info_event) +
  707. priv_size;
  708. err = auxtrace_record__info_fill(itr, session, &ev->auxtrace_info,
  709. priv_size);
  710. if (err)
  711. goto out_free;
  712. err = process(tool, ev, NULL, NULL);
  713. out_free:
  714. free(ev);
  715. return err;
  716. }
  717. static bool auxtrace__dont_decode(struct perf_session *session)
  718. {
  719. return !session->itrace_synth_opts ||
  720. session->itrace_synth_opts->dont_decode;
  721. }
  722. int perf_event__process_auxtrace_info(struct perf_tool *tool __maybe_unused,
  723. union perf_event *event,
  724. struct perf_session *session __maybe_unused)
  725. {
  726. enum auxtrace_type type = event->auxtrace_info.type;
  727. if (dump_trace)
  728. fprintf(stdout, " type: %u\n", type);
  729. switch (type) {
  730. case PERF_AUXTRACE_UNKNOWN:
  731. default:
  732. return -EINVAL;
  733. }
  734. }
  735. s64 perf_event__process_auxtrace(struct perf_tool *tool,
  736. union perf_event *event,
  737. struct perf_session *session)
  738. {
  739. s64 err;
  740. if (dump_trace)
  741. fprintf(stdout, " size: %#"PRIx64" offset: %#"PRIx64" ref: %#"PRIx64" idx: %u tid: %d cpu: %d\n",
  742. event->auxtrace.size, event->auxtrace.offset,
  743. event->auxtrace.reference, event->auxtrace.idx,
  744. event->auxtrace.tid, event->auxtrace.cpu);
  745. if (auxtrace__dont_decode(session))
  746. return event->auxtrace.size;
  747. if (!session->auxtrace || event->header.type != PERF_RECORD_AUXTRACE)
  748. return -EINVAL;
  749. err = session->auxtrace->process_auxtrace_event(session, event, tool);
  750. if (err < 0)
  751. return err;
  752. return event->auxtrace.size;
  753. }
  754. #define PERF_ITRACE_DEFAULT_PERIOD_TYPE PERF_ITRACE_PERIOD_NANOSECS
  755. #define PERF_ITRACE_DEFAULT_PERIOD 100000
  756. #define PERF_ITRACE_DEFAULT_CALLCHAIN_SZ 16
  757. #define PERF_ITRACE_MAX_CALLCHAIN_SZ 1024
  758. void itrace_synth_opts__set_default(struct itrace_synth_opts *synth_opts)
  759. {
  760. synth_opts->instructions = true;
  761. synth_opts->branches = true;
  762. synth_opts->transactions = true;
  763. synth_opts->errors = true;
  764. synth_opts->period_type = PERF_ITRACE_DEFAULT_PERIOD_TYPE;
  765. synth_opts->period = PERF_ITRACE_DEFAULT_PERIOD;
  766. synth_opts->callchain_sz = PERF_ITRACE_DEFAULT_CALLCHAIN_SZ;
  767. }
  768. /*
  769. * Please check tools/perf/Documentation/perf-script.txt for information
  770. * about the options parsed here, which is introduced after this cset,
  771. * when support in 'perf script' for these options is introduced.
  772. */
  773. int itrace_parse_synth_opts(const struct option *opt, const char *str,
  774. int unset)
  775. {
  776. struct itrace_synth_opts *synth_opts = opt->value;
  777. const char *p;
  778. char *endptr;
  779. synth_opts->set = true;
  780. if (unset) {
  781. synth_opts->dont_decode = true;
  782. return 0;
  783. }
  784. if (!str) {
  785. itrace_synth_opts__set_default(synth_opts);
  786. return 0;
  787. }
  788. for (p = str; *p;) {
  789. switch (*p++) {
  790. case 'i':
  791. synth_opts->instructions = true;
  792. while (*p == ' ' || *p == ',')
  793. p += 1;
  794. if (isdigit(*p)) {
  795. synth_opts->period = strtoull(p, &endptr, 10);
  796. p = endptr;
  797. while (*p == ' ' || *p == ',')
  798. p += 1;
  799. switch (*p++) {
  800. case 'i':
  801. synth_opts->period_type =
  802. PERF_ITRACE_PERIOD_INSTRUCTIONS;
  803. break;
  804. case 't':
  805. synth_opts->period_type =
  806. PERF_ITRACE_PERIOD_TICKS;
  807. break;
  808. case 'm':
  809. synth_opts->period *= 1000;
  810. /* Fall through */
  811. case 'u':
  812. synth_opts->period *= 1000;
  813. /* Fall through */
  814. case 'n':
  815. if (*p++ != 's')
  816. goto out_err;
  817. synth_opts->period_type =
  818. PERF_ITRACE_PERIOD_NANOSECS;
  819. break;
  820. case '\0':
  821. goto out;
  822. default:
  823. goto out_err;
  824. }
  825. }
  826. break;
  827. case 'b':
  828. synth_opts->branches = true;
  829. break;
  830. case 'x':
  831. synth_opts->transactions = true;
  832. break;
  833. case 'e':
  834. synth_opts->errors = true;
  835. break;
  836. case 'd':
  837. synth_opts->log = true;
  838. break;
  839. case 'c':
  840. synth_opts->branches = true;
  841. synth_opts->calls = true;
  842. break;
  843. case 'r':
  844. synth_opts->branches = true;
  845. synth_opts->returns = true;
  846. break;
  847. case 'g':
  848. synth_opts->callchain = true;
  849. synth_opts->callchain_sz =
  850. PERF_ITRACE_DEFAULT_CALLCHAIN_SZ;
  851. while (*p == ' ' || *p == ',')
  852. p += 1;
  853. if (isdigit(*p)) {
  854. unsigned int val;
  855. val = strtoul(p, &endptr, 10);
  856. p = endptr;
  857. if (!val || val > PERF_ITRACE_MAX_CALLCHAIN_SZ)
  858. goto out_err;
  859. synth_opts->callchain_sz = val;
  860. }
  861. break;
  862. case ' ':
  863. case ',':
  864. break;
  865. default:
  866. goto out_err;
  867. }
  868. }
  869. out:
  870. if (synth_opts->instructions) {
  871. if (!synth_opts->period_type)
  872. synth_opts->period_type =
  873. PERF_ITRACE_DEFAULT_PERIOD_TYPE;
  874. if (!synth_opts->period)
  875. synth_opts->period = PERF_ITRACE_DEFAULT_PERIOD;
  876. }
  877. return 0;
  878. out_err:
  879. pr_err("Bad Instruction Tracing options '%s'\n", str);
  880. return -EINVAL;
  881. }
  882. static const char * const auxtrace_error_type_name[] = {
  883. [PERF_AUXTRACE_ERROR_ITRACE] = "instruction trace",
  884. };
  885. static const char *auxtrace_error_name(int type)
  886. {
  887. const char *error_type_name = NULL;
  888. if (type < PERF_AUXTRACE_ERROR_MAX)
  889. error_type_name = auxtrace_error_type_name[type];
  890. if (!error_type_name)
  891. error_type_name = "unknown AUX";
  892. return error_type_name;
  893. }
  894. size_t perf_event__fprintf_auxtrace_error(union perf_event *event, FILE *fp)
  895. {
  896. struct auxtrace_error_event *e = &event->auxtrace_error;
  897. int ret;
  898. ret = fprintf(fp, " %s error type %u",
  899. auxtrace_error_name(e->type), e->type);
  900. ret += fprintf(fp, " cpu %d pid %d tid %d ip %#"PRIx64" code %u: %s\n",
  901. e->cpu, e->pid, e->tid, e->ip, e->code, e->msg);
  902. return ret;
  903. }
  904. void perf_session__auxtrace_error_inc(struct perf_session *session,
  905. union perf_event *event)
  906. {
  907. struct auxtrace_error_event *e = &event->auxtrace_error;
  908. if (e->type < PERF_AUXTRACE_ERROR_MAX)
  909. session->evlist->stats.nr_auxtrace_errors[e->type] += 1;
  910. }
  911. void events_stats__auxtrace_error_warn(const struct events_stats *stats)
  912. {
  913. int i;
  914. for (i = 0; i < PERF_AUXTRACE_ERROR_MAX; i++) {
  915. if (!stats->nr_auxtrace_errors[i])
  916. continue;
  917. ui__warning("%u %s errors\n",
  918. stats->nr_auxtrace_errors[i],
  919. auxtrace_error_name(i));
  920. }
  921. }
  922. int perf_event__process_auxtrace_error(struct perf_tool *tool __maybe_unused,
  923. union perf_event *event,
  924. struct perf_session *session)
  925. {
  926. if (auxtrace__dont_decode(session))
  927. return 0;
  928. perf_event__fprintf_auxtrace_error(event, stdout);
  929. return 0;
  930. }
  931. static int __auxtrace_mmap__read(struct auxtrace_mmap *mm,
  932. struct auxtrace_record *itr,
  933. struct perf_tool *tool, process_auxtrace_t fn,
  934. bool snapshot, size_t snapshot_size)
  935. {
  936. u64 head, old = mm->prev, offset, ref;
  937. unsigned char *data = mm->base;
  938. size_t size, head_off, old_off, len1, len2, padding;
  939. union perf_event ev;
  940. void *data1, *data2;
  941. if (snapshot) {
  942. head = auxtrace_mmap__read_snapshot_head(mm);
  943. if (auxtrace_record__find_snapshot(itr, mm->idx, mm, data,
  944. &head, &old))
  945. return -1;
  946. } else {
  947. head = auxtrace_mmap__read_head(mm);
  948. }
  949. if (old == head)
  950. return 0;
  951. pr_debug3("auxtrace idx %d old %#"PRIx64" head %#"PRIx64" diff %#"PRIx64"\n",
  952. mm->idx, old, head, head - old);
  953. if (mm->mask) {
  954. head_off = head & mm->mask;
  955. old_off = old & mm->mask;
  956. } else {
  957. head_off = head % mm->len;
  958. old_off = old % mm->len;
  959. }
  960. if (head_off > old_off)
  961. size = head_off - old_off;
  962. else
  963. size = mm->len - (old_off - head_off);
  964. if (snapshot && size > snapshot_size)
  965. size = snapshot_size;
  966. ref = auxtrace_record__reference(itr);
  967. if (head > old || size <= head || mm->mask) {
  968. offset = head - size;
  969. } else {
  970. /*
  971. * When the buffer size is not a power of 2, 'head' wraps at the
  972. * highest multiple of the buffer size, so we have to subtract
  973. * the remainder here.
  974. */
  975. u64 rem = (0ULL - mm->len) % mm->len;
  976. offset = head - size - rem;
  977. }
  978. if (size > head_off) {
  979. len1 = size - head_off;
  980. data1 = &data[mm->len - len1];
  981. len2 = head_off;
  982. data2 = &data[0];
  983. } else {
  984. len1 = size;
  985. data1 = &data[head_off - len1];
  986. len2 = 0;
  987. data2 = NULL;
  988. }
  989. if (itr->alignment) {
  990. unsigned int unwanted = len1 % itr->alignment;
  991. len1 -= unwanted;
  992. size -= unwanted;
  993. }
  994. /* padding must be written by fn() e.g. record__process_auxtrace() */
  995. padding = size & 7;
  996. if (padding)
  997. padding = 8 - padding;
  998. memset(&ev, 0, sizeof(ev));
  999. ev.auxtrace.header.type = PERF_RECORD_AUXTRACE;
  1000. ev.auxtrace.header.size = sizeof(ev.auxtrace);
  1001. ev.auxtrace.size = size + padding;
  1002. ev.auxtrace.offset = offset;
  1003. ev.auxtrace.reference = ref;
  1004. ev.auxtrace.idx = mm->idx;
  1005. ev.auxtrace.tid = mm->tid;
  1006. ev.auxtrace.cpu = mm->cpu;
  1007. if (fn(tool, &ev, data1, len1, data2, len2))
  1008. return -1;
  1009. mm->prev = head;
  1010. if (!snapshot) {
  1011. auxtrace_mmap__write_tail(mm, head);
  1012. if (itr->read_finish) {
  1013. int err;
  1014. err = itr->read_finish(itr, mm->idx);
  1015. if (err < 0)
  1016. return err;
  1017. }
  1018. }
  1019. return 1;
  1020. }
  1021. int auxtrace_mmap__read(struct auxtrace_mmap *mm, struct auxtrace_record *itr,
  1022. struct perf_tool *tool, process_auxtrace_t fn)
  1023. {
  1024. return __auxtrace_mmap__read(mm, itr, tool, fn, false, 0);
  1025. }
  1026. int auxtrace_mmap__read_snapshot(struct auxtrace_mmap *mm,
  1027. struct auxtrace_record *itr,
  1028. struct perf_tool *tool, process_auxtrace_t fn,
  1029. size_t snapshot_size)
  1030. {
  1031. return __auxtrace_mmap__read(mm, itr, tool, fn, true, snapshot_size);
  1032. }
  1033. /**
  1034. * struct auxtrace_cache - hash table to implement a cache
  1035. * @hashtable: the hashtable
  1036. * @sz: hashtable size (number of hlists)
  1037. * @entry_size: size of an entry
  1038. * @limit: limit the number of entries to this maximum, when reached the cache
  1039. * is dropped and caching begins again with an empty cache
  1040. * @cnt: current number of entries
  1041. * @bits: hashtable size (@sz = 2^@bits)
  1042. */
  1043. struct auxtrace_cache {
  1044. struct hlist_head *hashtable;
  1045. size_t sz;
  1046. size_t entry_size;
  1047. size_t limit;
  1048. size_t cnt;
  1049. unsigned int bits;
  1050. };
  1051. struct auxtrace_cache *auxtrace_cache__new(unsigned int bits, size_t entry_size,
  1052. unsigned int limit_percent)
  1053. {
  1054. struct auxtrace_cache *c;
  1055. struct hlist_head *ht;
  1056. size_t sz, i;
  1057. c = zalloc(sizeof(struct auxtrace_cache));
  1058. if (!c)
  1059. return NULL;
  1060. sz = 1UL << bits;
  1061. ht = calloc(sz, sizeof(struct hlist_head));
  1062. if (!ht)
  1063. goto out_free;
  1064. for (i = 0; i < sz; i++)
  1065. INIT_HLIST_HEAD(&ht[i]);
  1066. c->hashtable = ht;
  1067. c->sz = sz;
  1068. c->entry_size = entry_size;
  1069. c->limit = (c->sz * limit_percent) / 100;
  1070. c->bits = bits;
  1071. return c;
  1072. out_free:
  1073. free(c);
  1074. return NULL;
  1075. }
  1076. static void auxtrace_cache__drop(struct auxtrace_cache *c)
  1077. {
  1078. struct auxtrace_cache_entry *entry;
  1079. struct hlist_node *tmp;
  1080. size_t i;
  1081. if (!c)
  1082. return;
  1083. for (i = 0; i < c->sz; i++) {
  1084. hlist_for_each_entry_safe(entry, tmp, &c->hashtable[i], hash) {
  1085. hlist_del(&entry->hash);
  1086. auxtrace_cache__free_entry(c, entry);
  1087. }
  1088. }
  1089. c->cnt = 0;
  1090. }
  1091. void auxtrace_cache__free(struct auxtrace_cache *c)
  1092. {
  1093. if (!c)
  1094. return;
  1095. auxtrace_cache__drop(c);
  1096. free(c->hashtable);
  1097. free(c);
  1098. }
  1099. void *auxtrace_cache__alloc_entry(struct auxtrace_cache *c)
  1100. {
  1101. return malloc(c->entry_size);
  1102. }
  1103. void auxtrace_cache__free_entry(struct auxtrace_cache *c __maybe_unused,
  1104. void *entry)
  1105. {
  1106. free(entry);
  1107. }
  1108. int auxtrace_cache__add(struct auxtrace_cache *c, u32 key,
  1109. struct auxtrace_cache_entry *entry)
  1110. {
  1111. if (c->limit && ++c->cnt > c->limit)
  1112. auxtrace_cache__drop(c);
  1113. entry->key = key;
  1114. hlist_add_head(&entry->hash, &c->hashtable[hash_32(key, c->bits)]);
  1115. return 0;
  1116. }
  1117. void *auxtrace_cache__lookup(struct auxtrace_cache *c, u32 key)
  1118. {
  1119. struct auxtrace_cache_entry *entry;
  1120. struct hlist_head *hlist;
  1121. if (!c)
  1122. return NULL;
  1123. hlist = &c->hashtable[hash_32(key, c->bits)];
  1124. hlist_for_each_entry(entry, hlist, hash) {
  1125. if (entry->key == key)
  1126. return entry;
  1127. }
  1128. return NULL;
  1129. }