auxtrace.c 47 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166
  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 <inttypes.h>
  16. #include <sys/types.h>
  17. #include <sys/mman.h>
  18. #include <stdbool.h>
  19. #include <string.h>
  20. #include <limits.h>
  21. #include <errno.h>
  22. #include <linux/kernel.h>
  23. #include <linux/perf_event.h>
  24. #include <linux/types.h>
  25. #include <linux/bitops.h>
  26. #include <linux/log2.h>
  27. #include <linux/string.h>
  28. #include <sys/param.h>
  29. #include <stdlib.h>
  30. #include <stdio.h>
  31. #include <linux/list.h>
  32. #include "../perf.h"
  33. #include "util.h"
  34. #include "evlist.h"
  35. #include "dso.h"
  36. #include "map.h"
  37. #include "pmu.h"
  38. #include "evsel.h"
  39. #include "cpumap.h"
  40. #include "thread_map.h"
  41. #include "asm/bug.h"
  42. #include "auxtrace.h"
  43. #include <linux/hash.h>
  44. #include "event.h"
  45. #include "session.h"
  46. #include "debug.h"
  47. #include <subcmd/parse-options.h>
  48. #include "cs-etm.h"
  49. #include "intel-pt.h"
  50. #include "intel-bts.h"
  51. #include "arm-spe.h"
  52. #include "s390-cpumsf.h"
  53. #include "sane_ctype.h"
  54. #include "symbol/kallsyms.h"
  55. static bool auxtrace__dont_decode(struct perf_session *session)
  56. {
  57. return !session->itrace_synth_opts ||
  58. session->itrace_synth_opts->dont_decode;
  59. }
  60. int auxtrace_mmap__mmap(struct auxtrace_mmap *mm,
  61. struct auxtrace_mmap_params *mp,
  62. void *userpg, int fd)
  63. {
  64. struct perf_event_mmap_page *pc = userpg;
  65. WARN_ONCE(mm->base, "Uninitialized auxtrace_mmap\n");
  66. mm->userpg = userpg;
  67. mm->mask = mp->mask;
  68. mm->len = mp->len;
  69. mm->prev = 0;
  70. mm->idx = mp->idx;
  71. mm->tid = mp->tid;
  72. mm->cpu = mp->cpu;
  73. if (!mp->len) {
  74. mm->base = NULL;
  75. return 0;
  76. }
  77. #if BITS_PER_LONG != 64 && !defined(HAVE_SYNC_COMPARE_AND_SWAP_SUPPORT)
  78. pr_err("Cannot use AUX area tracing mmaps\n");
  79. return -1;
  80. #endif
  81. pc->aux_offset = mp->offset;
  82. pc->aux_size = mp->len;
  83. mm->base = mmap(NULL, mp->len, mp->prot, MAP_SHARED, fd, mp->offset);
  84. if (mm->base == MAP_FAILED) {
  85. pr_debug2("failed to mmap AUX area\n");
  86. mm->base = NULL;
  87. return -1;
  88. }
  89. return 0;
  90. }
  91. void auxtrace_mmap__munmap(struct auxtrace_mmap *mm)
  92. {
  93. if (mm->base) {
  94. munmap(mm->base, mm->len);
  95. mm->base = NULL;
  96. }
  97. }
  98. void auxtrace_mmap_params__init(struct auxtrace_mmap_params *mp,
  99. off_t auxtrace_offset,
  100. unsigned int auxtrace_pages,
  101. bool auxtrace_overwrite)
  102. {
  103. if (auxtrace_pages) {
  104. mp->offset = auxtrace_offset;
  105. mp->len = auxtrace_pages * (size_t)page_size;
  106. mp->mask = is_power_of_2(mp->len) ? mp->len - 1 : 0;
  107. mp->prot = PROT_READ | (auxtrace_overwrite ? 0 : PROT_WRITE);
  108. pr_debug2("AUX area mmap length %zu\n", mp->len);
  109. } else {
  110. mp->len = 0;
  111. }
  112. }
  113. void auxtrace_mmap_params__set_idx(struct auxtrace_mmap_params *mp,
  114. struct perf_evlist *evlist, int idx,
  115. bool per_cpu)
  116. {
  117. mp->idx = idx;
  118. if (per_cpu) {
  119. mp->cpu = evlist->cpus->map[idx];
  120. if (evlist->threads)
  121. mp->tid = thread_map__pid(evlist->threads, 0);
  122. else
  123. mp->tid = -1;
  124. } else {
  125. mp->cpu = -1;
  126. mp->tid = thread_map__pid(evlist->threads, idx);
  127. }
  128. }
  129. #define AUXTRACE_INIT_NR_QUEUES 32
  130. static struct auxtrace_queue *auxtrace_alloc_queue_array(unsigned int nr_queues)
  131. {
  132. struct auxtrace_queue *queue_array;
  133. unsigned int max_nr_queues, i;
  134. max_nr_queues = UINT_MAX / sizeof(struct auxtrace_queue);
  135. if (nr_queues > max_nr_queues)
  136. return NULL;
  137. queue_array = calloc(nr_queues, sizeof(struct auxtrace_queue));
  138. if (!queue_array)
  139. return NULL;
  140. for (i = 0; i < nr_queues; i++) {
  141. INIT_LIST_HEAD(&queue_array[i].head);
  142. queue_array[i].priv = NULL;
  143. }
  144. return queue_array;
  145. }
  146. int auxtrace_queues__init(struct auxtrace_queues *queues)
  147. {
  148. queues->nr_queues = AUXTRACE_INIT_NR_QUEUES;
  149. queues->queue_array = auxtrace_alloc_queue_array(queues->nr_queues);
  150. if (!queues->queue_array)
  151. return -ENOMEM;
  152. return 0;
  153. }
  154. static int auxtrace_queues__grow(struct auxtrace_queues *queues,
  155. unsigned int new_nr_queues)
  156. {
  157. unsigned int nr_queues = queues->nr_queues;
  158. struct auxtrace_queue *queue_array;
  159. unsigned int i;
  160. if (!nr_queues)
  161. nr_queues = AUXTRACE_INIT_NR_QUEUES;
  162. while (nr_queues && nr_queues < new_nr_queues)
  163. nr_queues <<= 1;
  164. if (nr_queues < queues->nr_queues || nr_queues < new_nr_queues)
  165. return -EINVAL;
  166. queue_array = auxtrace_alloc_queue_array(nr_queues);
  167. if (!queue_array)
  168. return -ENOMEM;
  169. for (i = 0; i < queues->nr_queues; i++) {
  170. list_splice_tail(&queues->queue_array[i].head,
  171. &queue_array[i].head);
  172. queue_array[i].tid = queues->queue_array[i].tid;
  173. queue_array[i].cpu = queues->queue_array[i].cpu;
  174. queue_array[i].set = queues->queue_array[i].set;
  175. queue_array[i].priv = queues->queue_array[i].priv;
  176. }
  177. queues->nr_queues = nr_queues;
  178. queues->queue_array = queue_array;
  179. return 0;
  180. }
  181. static void *auxtrace_copy_data(u64 size, struct perf_session *session)
  182. {
  183. int fd = perf_data__fd(session->data);
  184. void *p;
  185. ssize_t ret;
  186. if (size > SSIZE_MAX)
  187. return NULL;
  188. p = malloc(size);
  189. if (!p)
  190. return NULL;
  191. ret = readn(fd, p, size);
  192. if (ret != (ssize_t)size) {
  193. free(p);
  194. return NULL;
  195. }
  196. return p;
  197. }
  198. static int auxtrace_queues__queue_buffer(struct auxtrace_queues *queues,
  199. unsigned int idx,
  200. struct auxtrace_buffer *buffer)
  201. {
  202. struct auxtrace_queue *queue;
  203. int err;
  204. if (idx >= queues->nr_queues) {
  205. err = auxtrace_queues__grow(queues, idx + 1);
  206. if (err)
  207. return err;
  208. }
  209. queue = &queues->queue_array[idx];
  210. if (!queue->set) {
  211. queue->set = true;
  212. queue->tid = buffer->tid;
  213. queue->cpu = buffer->cpu;
  214. }
  215. buffer->buffer_nr = queues->next_buffer_nr++;
  216. list_add_tail(&buffer->list, &queue->head);
  217. queues->new_data = true;
  218. queues->populated = true;
  219. return 0;
  220. }
  221. /* Limit buffers to 32MiB on 32-bit */
  222. #define BUFFER_LIMIT_FOR_32_BIT (32 * 1024 * 1024)
  223. static int auxtrace_queues__split_buffer(struct auxtrace_queues *queues,
  224. unsigned int idx,
  225. struct auxtrace_buffer *buffer)
  226. {
  227. u64 sz = buffer->size;
  228. bool consecutive = false;
  229. struct auxtrace_buffer *b;
  230. int err;
  231. while (sz > BUFFER_LIMIT_FOR_32_BIT) {
  232. b = memdup(buffer, sizeof(struct auxtrace_buffer));
  233. if (!b)
  234. return -ENOMEM;
  235. b->size = BUFFER_LIMIT_FOR_32_BIT;
  236. b->consecutive = consecutive;
  237. err = auxtrace_queues__queue_buffer(queues, idx, b);
  238. if (err) {
  239. auxtrace_buffer__free(b);
  240. return err;
  241. }
  242. buffer->data_offset += BUFFER_LIMIT_FOR_32_BIT;
  243. sz -= BUFFER_LIMIT_FOR_32_BIT;
  244. consecutive = true;
  245. }
  246. buffer->size = sz;
  247. buffer->consecutive = consecutive;
  248. return 0;
  249. }
  250. static bool filter_cpu(struct perf_session *session, int cpu)
  251. {
  252. unsigned long *cpu_bitmap = session->itrace_synth_opts->cpu_bitmap;
  253. return cpu_bitmap && cpu != -1 && !test_bit(cpu, cpu_bitmap);
  254. }
  255. static int auxtrace_queues__add_buffer(struct auxtrace_queues *queues,
  256. struct perf_session *session,
  257. unsigned int idx,
  258. struct auxtrace_buffer *buffer,
  259. struct auxtrace_buffer **buffer_ptr)
  260. {
  261. int err = -ENOMEM;
  262. if (filter_cpu(session, buffer->cpu))
  263. return 0;
  264. buffer = memdup(buffer, sizeof(*buffer));
  265. if (!buffer)
  266. return -ENOMEM;
  267. if (session->one_mmap) {
  268. buffer->data = buffer->data_offset - session->one_mmap_offset +
  269. session->one_mmap_addr;
  270. } else if (perf_data__is_pipe(session->data)) {
  271. buffer->data = auxtrace_copy_data(buffer->size, session);
  272. if (!buffer->data)
  273. goto out_free;
  274. buffer->data_needs_freeing = true;
  275. } else if (BITS_PER_LONG == 32 &&
  276. buffer->size > BUFFER_LIMIT_FOR_32_BIT) {
  277. err = auxtrace_queues__split_buffer(queues, idx, buffer);
  278. if (err)
  279. goto out_free;
  280. }
  281. err = auxtrace_queues__queue_buffer(queues, idx, buffer);
  282. if (err)
  283. goto out_free;
  284. /* FIXME: Doesn't work for split buffer */
  285. if (buffer_ptr)
  286. *buffer_ptr = buffer;
  287. return 0;
  288. out_free:
  289. auxtrace_buffer__free(buffer);
  290. return err;
  291. }
  292. int auxtrace_queues__add_event(struct auxtrace_queues *queues,
  293. struct perf_session *session,
  294. union perf_event *event, off_t data_offset,
  295. struct auxtrace_buffer **buffer_ptr)
  296. {
  297. struct auxtrace_buffer buffer = {
  298. .pid = -1,
  299. .tid = event->auxtrace.tid,
  300. .cpu = event->auxtrace.cpu,
  301. .data_offset = data_offset,
  302. .offset = event->auxtrace.offset,
  303. .reference = event->auxtrace.reference,
  304. .size = event->auxtrace.size,
  305. };
  306. unsigned int idx = event->auxtrace.idx;
  307. return auxtrace_queues__add_buffer(queues, session, idx, &buffer,
  308. buffer_ptr);
  309. }
  310. static int auxtrace_queues__add_indexed_event(struct auxtrace_queues *queues,
  311. struct perf_session *session,
  312. off_t file_offset, size_t sz)
  313. {
  314. union perf_event *event;
  315. int err;
  316. char buf[PERF_SAMPLE_MAX_SIZE];
  317. err = perf_session__peek_event(session, file_offset, buf,
  318. PERF_SAMPLE_MAX_SIZE, &event, NULL);
  319. if (err)
  320. return err;
  321. if (event->header.type == PERF_RECORD_AUXTRACE) {
  322. if (event->header.size < sizeof(struct auxtrace_event) ||
  323. event->header.size != sz) {
  324. err = -EINVAL;
  325. goto out;
  326. }
  327. file_offset += event->header.size;
  328. err = auxtrace_queues__add_event(queues, session, event,
  329. file_offset, NULL);
  330. }
  331. out:
  332. return err;
  333. }
  334. void auxtrace_queues__free(struct auxtrace_queues *queues)
  335. {
  336. unsigned int i;
  337. for (i = 0; i < queues->nr_queues; i++) {
  338. while (!list_empty(&queues->queue_array[i].head)) {
  339. struct auxtrace_buffer *buffer;
  340. buffer = list_entry(queues->queue_array[i].head.next,
  341. struct auxtrace_buffer, list);
  342. list_del(&buffer->list);
  343. auxtrace_buffer__free(buffer);
  344. }
  345. }
  346. zfree(&queues->queue_array);
  347. queues->nr_queues = 0;
  348. }
  349. static void auxtrace_heapify(struct auxtrace_heap_item *heap_array,
  350. unsigned int pos, unsigned int queue_nr,
  351. u64 ordinal)
  352. {
  353. unsigned int parent;
  354. while (pos) {
  355. parent = (pos - 1) >> 1;
  356. if (heap_array[parent].ordinal <= ordinal)
  357. break;
  358. heap_array[pos] = heap_array[parent];
  359. pos = parent;
  360. }
  361. heap_array[pos].queue_nr = queue_nr;
  362. heap_array[pos].ordinal = ordinal;
  363. }
  364. int auxtrace_heap__add(struct auxtrace_heap *heap, unsigned int queue_nr,
  365. u64 ordinal)
  366. {
  367. struct auxtrace_heap_item *heap_array;
  368. if (queue_nr >= heap->heap_sz) {
  369. unsigned int heap_sz = AUXTRACE_INIT_NR_QUEUES;
  370. while (heap_sz <= queue_nr)
  371. heap_sz <<= 1;
  372. heap_array = realloc(heap->heap_array,
  373. heap_sz * sizeof(struct auxtrace_heap_item));
  374. if (!heap_array)
  375. return -ENOMEM;
  376. heap->heap_array = heap_array;
  377. heap->heap_sz = heap_sz;
  378. }
  379. auxtrace_heapify(heap->heap_array, heap->heap_cnt++, queue_nr, ordinal);
  380. return 0;
  381. }
  382. void auxtrace_heap__free(struct auxtrace_heap *heap)
  383. {
  384. zfree(&heap->heap_array);
  385. heap->heap_cnt = 0;
  386. heap->heap_sz = 0;
  387. }
  388. void auxtrace_heap__pop(struct auxtrace_heap *heap)
  389. {
  390. unsigned int pos, last, heap_cnt = heap->heap_cnt;
  391. struct auxtrace_heap_item *heap_array;
  392. if (!heap_cnt)
  393. return;
  394. heap->heap_cnt -= 1;
  395. heap_array = heap->heap_array;
  396. pos = 0;
  397. while (1) {
  398. unsigned int left, right;
  399. left = (pos << 1) + 1;
  400. if (left >= heap_cnt)
  401. break;
  402. right = left + 1;
  403. if (right >= heap_cnt) {
  404. heap_array[pos] = heap_array[left];
  405. return;
  406. }
  407. if (heap_array[left].ordinal < heap_array[right].ordinal) {
  408. heap_array[pos] = heap_array[left];
  409. pos = left;
  410. } else {
  411. heap_array[pos] = heap_array[right];
  412. pos = right;
  413. }
  414. }
  415. last = heap_cnt - 1;
  416. auxtrace_heapify(heap_array, pos, heap_array[last].queue_nr,
  417. heap_array[last].ordinal);
  418. }
  419. size_t auxtrace_record__info_priv_size(struct auxtrace_record *itr,
  420. struct perf_evlist *evlist)
  421. {
  422. if (itr)
  423. return itr->info_priv_size(itr, evlist);
  424. return 0;
  425. }
  426. static int auxtrace_not_supported(void)
  427. {
  428. pr_err("AUX area tracing is not supported on this architecture\n");
  429. return -EINVAL;
  430. }
  431. int auxtrace_record__info_fill(struct auxtrace_record *itr,
  432. struct perf_session *session,
  433. struct auxtrace_info_event *auxtrace_info,
  434. size_t priv_size)
  435. {
  436. if (itr)
  437. return itr->info_fill(itr, session, auxtrace_info, priv_size);
  438. return auxtrace_not_supported();
  439. }
  440. void auxtrace_record__free(struct auxtrace_record *itr)
  441. {
  442. if (itr)
  443. itr->free(itr);
  444. }
  445. int auxtrace_record__snapshot_start(struct auxtrace_record *itr)
  446. {
  447. if (itr && itr->snapshot_start)
  448. return itr->snapshot_start(itr);
  449. return 0;
  450. }
  451. int auxtrace_record__snapshot_finish(struct auxtrace_record *itr)
  452. {
  453. if (itr && itr->snapshot_finish)
  454. return itr->snapshot_finish(itr);
  455. return 0;
  456. }
  457. int auxtrace_record__find_snapshot(struct auxtrace_record *itr, int idx,
  458. struct auxtrace_mmap *mm,
  459. unsigned char *data, u64 *head, u64 *old)
  460. {
  461. if (itr && itr->find_snapshot)
  462. return itr->find_snapshot(itr, idx, mm, data, head, old);
  463. return 0;
  464. }
  465. int auxtrace_record__options(struct auxtrace_record *itr,
  466. struct perf_evlist *evlist,
  467. struct record_opts *opts)
  468. {
  469. if (itr)
  470. return itr->recording_options(itr, evlist, opts);
  471. return 0;
  472. }
  473. u64 auxtrace_record__reference(struct auxtrace_record *itr)
  474. {
  475. if (itr)
  476. return itr->reference(itr);
  477. return 0;
  478. }
  479. int auxtrace_parse_snapshot_options(struct auxtrace_record *itr,
  480. struct record_opts *opts, const char *str)
  481. {
  482. if (!str)
  483. return 0;
  484. if (itr)
  485. return itr->parse_snapshot_options(itr, opts, str);
  486. pr_err("No AUX area tracing to snapshot\n");
  487. return -EINVAL;
  488. }
  489. struct auxtrace_record *__weak
  490. auxtrace_record__init(struct perf_evlist *evlist __maybe_unused, int *err)
  491. {
  492. *err = 0;
  493. return NULL;
  494. }
  495. static int auxtrace_index__alloc(struct list_head *head)
  496. {
  497. struct auxtrace_index *auxtrace_index;
  498. auxtrace_index = malloc(sizeof(struct auxtrace_index));
  499. if (!auxtrace_index)
  500. return -ENOMEM;
  501. auxtrace_index->nr = 0;
  502. INIT_LIST_HEAD(&auxtrace_index->list);
  503. list_add_tail(&auxtrace_index->list, head);
  504. return 0;
  505. }
  506. void auxtrace_index__free(struct list_head *head)
  507. {
  508. struct auxtrace_index *auxtrace_index, *n;
  509. list_for_each_entry_safe(auxtrace_index, n, head, list) {
  510. list_del(&auxtrace_index->list);
  511. free(auxtrace_index);
  512. }
  513. }
  514. static struct auxtrace_index *auxtrace_index__last(struct list_head *head)
  515. {
  516. struct auxtrace_index *auxtrace_index;
  517. int err;
  518. if (list_empty(head)) {
  519. err = auxtrace_index__alloc(head);
  520. if (err)
  521. return NULL;
  522. }
  523. auxtrace_index = list_entry(head->prev, struct auxtrace_index, list);
  524. if (auxtrace_index->nr >= PERF_AUXTRACE_INDEX_ENTRY_COUNT) {
  525. err = auxtrace_index__alloc(head);
  526. if (err)
  527. return NULL;
  528. auxtrace_index = list_entry(head->prev, struct auxtrace_index,
  529. list);
  530. }
  531. return auxtrace_index;
  532. }
  533. int auxtrace_index__auxtrace_event(struct list_head *head,
  534. union perf_event *event, off_t file_offset)
  535. {
  536. struct auxtrace_index *auxtrace_index;
  537. size_t nr;
  538. auxtrace_index = auxtrace_index__last(head);
  539. if (!auxtrace_index)
  540. return -ENOMEM;
  541. nr = auxtrace_index->nr;
  542. auxtrace_index->entries[nr].file_offset = file_offset;
  543. auxtrace_index->entries[nr].sz = event->header.size;
  544. auxtrace_index->nr += 1;
  545. return 0;
  546. }
  547. static int auxtrace_index__do_write(int fd,
  548. struct auxtrace_index *auxtrace_index)
  549. {
  550. struct auxtrace_index_entry ent;
  551. size_t i;
  552. for (i = 0; i < auxtrace_index->nr; i++) {
  553. ent.file_offset = auxtrace_index->entries[i].file_offset;
  554. ent.sz = auxtrace_index->entries[i].sz;
  555. if (writen(fd, &ent, sizeof(ent)) != sizeof(ent))
  556. return -errno;
  557. }
  558. return 0;
  559. }
  560. int auxtrace_index__write(int fd, struct list_head *head)
  561. {
  562. struct auxtrace_index *auxtrace_index;
  563. u64 total = 0;
  564. int err;
  565. list_for_each_entry(auxtrace_index, head, list)
  566. total += auxtrace_index->nr;
  567. if (writen(fd, &total, sizeof(total)) != sizeof(total))
  568. return -errno;
  569. list_for_each_entry(auxtrace_index, head, list) {
  570. err = auxtrace_index__do_write(fd, auxtrace_index);
  571. if (err)
  572. return err;
  573. }
  574. return 0;
  575. }
  576. static int auxtrace_index__process_entry(int fd, struct list_head *head,
  577. bool needs_swap)
  578. {
  579. struct auxtrace_index *auxtrace_index;
  580. struct auxtrace_index_entry ent;
  581. size_t nr;
  582. if (readn(fd, &ent, sizeof(ent)) != sizeof(ent))
  583. return -1;
  584. auxtrace_index = auxtrace_index__last(head);
  585. if (!auxtrace_index)
  586. return -1;
  587. nr = auxtrace_index->nr;
  588. if (needs_swap) {
  589. auxtrace_index->entries[nr].file_offset =
  590. bswap_64(ent.file_offset);
  591. auxtrace_index->entries[nr].sz = bswap_64(ent.sz);
  592. } else {
  593. auxtrace_index->entries[nr].file_offset = ent.file_offset;
  594. auxtrace_index->entries[nr].sz = ent.sz;
  595. }
  596. auxtrace_index->nr = nr + 1;
  597. return 0;
  598. }
  599. int auxtrace_index__process(int fd, u64 size, struct perf_session *session,
  600. bool needs_swap)
  601. {
  602. struct list_head *head = &session->auxtrace_index;
  603. u64 nr;
  604. if (readn(fd, &nr, sizeof(u64)) != sizeof(u64))
  605. return -1;
  606. if (needs_swap)
  607. nr = bswap_64(nr);
  608. if (sizeof(u64) + nr * sizeof(struct auxtrace_index_entry) > size)
  609. return -1;
  610. while (nr--) {
  611. int err;
  612. err = auxtrace_index__process_entry(fd, head, needs_swap);
  613. if (err)
  614. return -1;
  615. }
  616. return 0;
  617. }
  618. static int auxtrace_queues__process_index_entry(struct auxtrace_queues *queues,
  619. struct perf_session *session,
  620. struct auxtrace_index_entry *ent)
  621. {
  622. return auxtrace_queues__add_indexed_event(queues, session,
  623. ent->file_offset, ent->sz);
  624. }
  625. int auxtrace_queues__process_index(struct auxtrace_queues *queues,
  626. struct perf_session *session)
  627. {
  628. struct auxtrace_index *auxtrace_index;
  629. struct auxtrace_index_entry *ent;
  630. size_t i;
  631. int err;
  632. if (auxtrace__dont_decode(session))
  633. return 0;
  634. list_for_each_entry(auxtrace_index, &session->auxtrace_index, list) {
  635. for (i = 0; i < auxtrace_index->nr; i++) {
  636. ent = &auxtrace_index->entries[i];
  637. err = auxtrace_queues__process_index_entry(queues,
  638. session,
  639. ent);
  640. if (err)
  641. return err;
  642. }
  643. }
  644. return 0;
  645. }
  646. struct auxtrace_buffer *auxtrace_buffer__next(struct auxtrace_queue *queue,
  647. struct auxtrace_buffer *buffer)
  648. {
  649. if (buffer) {
  650. if (list_is_last(&buffer->list, &queue->head))
  651. return NULL;
  652. return list_entry(buffer->list.next, struct auxtrace_buffer,
  653. list);
  654. } else {
  655. if (list_empty(&queue->head))
  656. return NULL;
  657. return list_entry(queue->head.next, struct auxtrace_buffer,
  658. list);
  659. }
  660. }
  661. void *auxtrace_buffer__get_data(struct auxtrace_buffer *buffer, int fd)
  662. {
  663. size_t adj = buffer->data_offset & (page_size - 1);
  664. size_t size = buffer->size + adj;
  665. off_t file_offset = buffer->data_offset - adj;
  666. void *addr;
  667. if (buffer->data)
  668. return buffer->data;
  669. addr = mmap(NULL, size, PROT_READ, MAP_SHARED, fd, file_offset);
  670. if (addr == MAP_FAILED)
  671. return NULL;
  672. buffer->mmap_addr = addr;
  673. buffer->mmap_size = size;
  674. buffer->data = addr + adj;
  675. return buffer->data;
  676. }
  677. void auxtrace_buffer__put_data(struct auxtrace_buffer *buffer)
  678. {
  679. if (!buffer->data || !buffer->mmap_addr)
  680. return;
  681. munmap(buffer->mmap_addr, buffer->mmap_size);
  682. buffer->mmap_addr = NULL;
  683. buffer->mmap_size = 0;
  684. buffer->data = NULL;
  685. buffer->use_data = NULL;
  686. }
  687. void auxtrace_buffer__drop_data(struct auxtrace_buffer *buffer)
  688. {
  689. auxtrace_buffer__put_data(buffer);
  690. if (buffer->data_needs_freeing) {
  691. buffer->data_needs_freeing = false;
  692. zfree(&buffer->data);
  693. buffer->use_data = NULL;
  694. buffer->size = 0;
  695. }
  696. }
  697. void auxtrace_buffer__free(struct auxtrace_buffer *buffer)
  698. {
  699. auxtrace_buffer__drop_data(buffer);
  700. free(buffer);
  701. }
  702. void auxtrace_synth_error(struct auxtrace_error_event *auxtrace_error, int type,
  703. int code, int cpu, pid_t pid, pid_t tid, u64 ip,
  704. const char *msg)
  705. {
  706. size_t size;
  707. memset(auxtrace_error, 0, sizeof(struct auxtrace_error_event));
  708. auxtrace_error->header.type = PERF_RECORD_AUXTRACE_ERROR;
  709. auxtrace_error->type = type;
  710. auxtrace_error->code = code;
  711. auxtrace_error->cpu = cpu;
  712. auxtrace_error->pid = pid;
  713. auxtrace_error->tid = tid;
  714. auxtrace_error->ip = ip;
  715. strlcpy(auxtrace_error->msg, msg, MAX_AUXTRACE_ERROR_MSG);
  716. size = (void *)auxtrace_error->msg - (void *)auxtrace_error +
  717. strlen(auxtrace_error->msg) + 1;
  718. auxtrace_error->header.size = PERF_ALIGN(size, sizeof(u64));
  719. }
  720. int perf_event__synthesize_auxtrace_info(struct auxtrace_record *itr,
  721. struct perf_tool *tool,
  722. struct perf_session *session,
  723. perf_event__handler_t process)
  724. {
  725. union perf_event *ev;
  726. size_t priv_size;
  727. int err;
  728. pr_debug2("Synthesizing auxtrace information\n");
  729. priv_size = auxtrace_record__info_priv_size(itr, session->evlist);
  730. ev = zalloc(sizeof(struct auxtrace_info_event) + priv_size);
  731. if (!ev)
  732. return -ENOMEM;
  733. ev->auxtrace_info.header.type = PERF_RECORD_AUXTRACE_INFO;
  734. ev->auxtrace_info.header.size = sizeof(struct auxtrace_info_event) +
  735. priv_size;
  736. err = auxtrace_record__info_fill(itr, session, &ev->auxtrace_info,
  737. priv_size);
  738. if (err)
  739. goto out_free;
  740. err = process(tool, ev, NULL, NULL);
  741. out_free:
  742. free(ev);
  743. return err;
  744. }
  745. int perf_event__process_auxtrace_info(struct perf_tool *tool __maybe_unused,
  746. union perf_event *event,
  747. struct perf_session *session)
  748. {
  749. enum auxtrace_type type = event->auxtrace_info.type;
  750. if (dump_trace)
  751. fprintf(stdout, " type: %u\n", type);
  752. switch (type) {
  753. case PERF_AUXTRACE_INTEL_PT:
  754. return intel_pt_process_auxtrace_info(event, session);
  755. case PERF_AUXTRACE_INTEL_BTS:
  756. return intel_bts_process_auxtrace_info(event, session);
  757. case PERF_AUXTRACE_ARM_SPE:
  758. return arm_spe_process_auxtrace_info(event, session);
  759. case PERF_AUXTRACE_CS_ETM:
  760. return cs_etm__process_auxtrace_info(event, session);
  761. case PERF_AUXTRACE_S390_CPUMSF:
  762. return s390_cpumsf_process_auxtrace_info(event, session);
  763. case PERF_AUXTRACE_UNKNOWN:
  764. default:
  765. return -EINVAL;
  766. }
  767. }
  768. s64 perf_event__process_auxtrace(struct perf_tool *tool,
  769. union perf_event *event,
  770. struct perf_session *session)
  771. {
  772. s64 err;
  773. if (dump_trace)
  774. fprintf(stdout, " size: %#"PRIx64" offset: %#"PRIx64" ref: %#"PRIx64" idx: %u tid: %d cpu: %d\n",
  775. event->auxtrace.size, event->auxtrace.offset,
  776. event->auxtrace.reference, event->auxtrace.idx,
  777. event->auxtrace.tid, event->auxtrace.cpu);
  778. if (auxtrace__dont_decode(session))
  779. return event->auxtrace.size;
  780. if (!session->auxtrace || event->header.type != PERF_RECORD_AUXTRACE)
  781. return -EINVAL;
  782. err = session->auxtrace->process_auxtrace_event(session, event, tool);
  783. if (err < 0)
  784. return err;
  785. return event->auxtrace.size;
  786. }
  787. #define PERF_ITRACE_DEFAULT_PERIOD_TYPE PERF_ITRACE_PERIOD_NANOSECS
  788. #define PERF_ITRACE_DEFAULT_PERIOD 100000
  789. #define PERF_ITRACE_DEFAULT_CALLCHAIN_SZ 16
  790. #define PERF_ITRACE_MAX_CALLCHAIN_SZ 1024
  791. #define PERF_ITRACE_DEFAULT_LAST_BRANCH_SZ 64
  792. #define PERF_ITRACE_MAX_LAST_BRANCH_SZ 1024
  793. void itrace_synth_opts__set_default(struct itrace_synth_opts *synth_opts)
  794. {
  795. synth_opts->instructions = true;
  796. synth_opts->branches = true;
  797. synth_opts->transactions = true;
  798. synth_opts->ptwrites = true;
  799. synth_opts->pwr_events = true;
  800. synth_opts->errors = true;
  801. synth_opts->period_type = PERF_ITRACE_DEFAULT_PERIOD_TYPE;
  802. synth_opts->period = PERF_ITRACE_DEFAULT_PERIOD;
  803. synth_opts->callchain_sz = PERF_ITRACE_DEFAULT_CALLCHAIN_SZ;
  804. synth_opts->last_branch_sz = PERF_ITRACE_DEFAULT_LAST_BRANCH_SZ;
  805. synth_opts->initial_skip = 0;
  806. }
  807. /*
  808. * Please check tools/perf/Documentation/perf-script.txt for information
  809. * about the options parsed here, which is introduced after this cset,
  810. * when support in 'perf script' for these options is introduced.
  811. */
  812. int itrace_parse_synth_opts(const struct option *opt, const char *str,
  813. int unset)
  814. {
  815. struct itrace_synth_opts *synth_opts = opt->value;
  816. const char *p;
  817. char *endptr;
  818. bool period_type_set = false;
  819. bool period_set = false;
  820. synth_opts->set = true;
  821. if (unset) {
  822. synth_opts->dont_decode = true;
  823. return 0;
  824. }
  825. if (!str) {
  826. itrace_synth_opts__set_default(synth_opts);
  827. return 0;
  828. }
  829. for (p = str; *p;) {
  830. switch (*p++) {
  831. case 'i':
  832. synth_opts->instructions = true;
  833. while (*p == ' ' || *p == ',')
  834. p += 1;
  835. if (isdigit(*p)) {
  836. synth_opts->period = strtoull(p, &endptr, 10);
  837. period_set = true;
  838. p = endptr;
  839. while (*p == ' ' || *p == ',')
  840. p += 1;
  841. switch (*p++) {
  842. case 'i':
  843. synth_opts->period_type =
  844. PERF_ITRACE_PERIOD_INSTRUCTIONS;
  845. period_type_set = true;
  846. break;
  847. case 't':
  848. synth_opts->period_type =
  849. PERF_ITRACE_PERIOD_TICKS;
  850. period_type_set = true;
  851. break;
  852. case 'm':
  853. synth_opts->period *= 1000;
  854. /* Fall through */
  855. case 'u':
  856. synth_opts->period *= 1000;
  857. /* Fall through */
  858. case 'n':
  859. if (*p++ != 's')
  860. goto out_err;
  861. synth_opts->period_type =
  862. PERF_ITRACE_PERIOD_NANOSECS;
  863. period_type_set = true;
  864. break;
  865. case '\0':
  866. goto out;
  867. default:
  868. goto out_err;
  869. }
  870. }
  871. break;
  872. case 'b':
  873. synth_opts->branches = true;
  874. break;
  875. case 'x':
  876. synth_opts->transactions = true;
  877. break;
  878. case 'w':
  879. synth_opts->ptwrites = true;
  880. break;
  881. case 'p':
  882. synth_opts->pwr_events = true;
  883. break;
  884. case 'e':
  885. synth_opts->errors = true;
  886. break;
  887. case 'd':
  888. synth_opts->log = true;
  889. break;
  890. case 'c':
  891. synth_opts->branches = true;
  892. synth_opts->calls = true;
  893. break;
  894. case 'r':
  895. synth_opts->branches = true;
  896. synth_opts->returns = true;
  897. break;
  898. case 'g':
  899. synth_opts->callchain = true;
  900. synth_opts->callchain_sz =
  901. PERF_ITRACE_DEFAULT_CALLCHAIN_SZ;
  902. while (*p == ' ' || *p == ',')
  903. p += 1;
  904. if (isdigit(*p)) {
  905. unsigned int val;
  906. val = strtoul(p, &endptr, 10);
  907. p = endptr;
  908. if (!val || val > PERF_ITRACE_MAX_CALLCHAIN_SZ)
  909. goto out_err;
  910. synth_opts->callchain_sz = val;
  911. }
  912. break;
  913. case 'l':
  914. synth_opts->last_branch = true;
  915. synth_opts->last_branch_sz =
  916. PERF_ITRACE_DEFAULT_LAST_BRANCH_SZ;
  917. while (*p == ' ' || *p == ',')
  918. p += 1;
  919. if (isdigit(*p)) {
  920. unsigned int val;
  921. val = strtoul(p, &endptr, 10);
  922. p = endptr;
  923. if (!val ||
  924. val > PERF_ITRACE_MAX_LAST_BRANCH_SZ)
  925. goto out_err;
  926. synth_opts->last_branch_sz = val;
  927. }
  928. break;
  929. case 's':
  930. synth_opts->initial_skip = strtoul(p, &endptr, 10);
  931. if (p == endptr)
  932. goto out_err;
  933. p = endptr;
  934. break;
  935. case ' ':
  936. case ',':
  937. break;
  938. default:
  939. goto out_err;
  940. }
  941. }
  942. out:
  943. if (synth_opts->instructions) {
  944. if (!period_type_set)
  945. synth_opts->period_type =
  946. PERF_ITRACE_DEFAULT_PERIOD_TYPE;
  947. if (!period_set)
  948. synth_opts->period = PERF_ITRACE_DEFAULT_PERIOD;
  949. }
  950. return 0;
  951. out_err:
  952. pr_err("Bad Instruction Tracing options '%s'\n", str);
  953. return -EINVAL;
  954. }
  955. static const char * const auxtrace_error_type_name[] = {
  956. [PERF_AUXTRACE_ERROR_ITRACE] = "instruction trace",
  957. };
  958. static const char *auxtrace_error_name(int type)
  959. {
  960. const char *error_type_name = NULL;
  961. if (type < PERF_AUXTRACE_ERROR_MAX)
  962. error_type_name = auxtrace_error_type_name[type];
  963. if (!error_type_name)
  964. error_type_name = "unknown AUX";
  965. return error_type_name;
  966. }
  967. size_t perf_event__fprintf_auxtrace_error(union perf_event *event, FILE *fp)
  968. {
  969. struct auxtrace_error_event *e = &event->auxtrace_error;
  970. int ret;
  971. ret = fprintf(fp, " %s error type %u",
  972. auxtrace_error_name(e->type), e->type);
  973. ret += fprintf(fp, " cpu %d pid %d tid %d ip %#"PRIx64" code %u: %s\n",
  974. e->cpu, e->pid, e->tid, e->ip, e->code, e->msg);
  975. return ret;
  976. }
  977. void perf_session__auxtrace_error_inc(struct perf_session *session,
  978. union perf_event *event)
  979. {
  980. struct auxtrace_error_event *e = &event->auxtrace_error;
  981. if (e->type < PERF_AUXTRACE_ERROR_MAX)
  982. session->evlist->stats.nr_auxtrace_errors[e->type] += 1;
  983. }
  984. void events_stats__auxtrace_error_warn(const struct events_stats *stats)
  985. {
  986. int i;
  987. for (i = 0; i < PERF_AUXTRACE_ERROR_MAX; i++) {
  988. if (!stats->nr_auxtrace_errors[i])
  989. continue;
  990. ui__warning("%u %s errors\n",
  991. stats->nr_auxtrace_errors[i],
  992. auxtrace_error_name(i));
  993. }
  994. }
  995. int perf_event__process_auxtrace_error(struct perf_tool *tool __maybe_unused,
  996. union perf_event *event,
  997. struct perf_session *session)
  998. {
  999. if (auxtrace__dont_decode(session))
  1000. return 0;
  1001. perf_event__fprintf_auxtrace_error(event, stdout);
  1002. return 0;
  1003. }
  1004. static int __auxtrace_mmap__read(struct auxtrace_mmap *mm,
  1005. struct auxtrace_record *itr,
  1006. struct perf_tool *tool, process_auxtrace_t fn,
  1007. bool snapshot, size_t snapshot_size)
  1008. {
  1009. u64 head, old = mm->prev, offset, ref;
  1010. unsigned char *data = mm->base;
  1011. size_t size, head_off, old_off, len1, len2, padding;
  1012. union perf_event ev;
  1013. void *data1, *data2;
  1014. if (snapshot) {
  1015. head = auxtrace_mmap__read_snapshot_head(mm);
  1016. if (auxtrace_record__find_snapshot(itr, mm->idx, mm, data,
  1017. &head, &old))
  1018. return -1;
  1019. } else {
  1020. head = auxtrace_mmap__read_head(mm);
  1021. }
  1022. if (old == head)
  1023. return 0;
  1024. pr_debug3("auxtrace idx %d old %#"PRIx64" head %#"PRIx64" diff %#"PRIx64"\n",
  1025. mm->idx, old, head, head - old);
  1026. if (mm->mask) {
  1027. head_off = head & mm->mask;
  1028. old_off = old & mm->mask;
  1029. } else {
  1030. head_off = head % mm->len;
  1031. old_off = old % mm->len;
  1032. }
  1033. if (head_off > old_off)
  1034. size = head_off - old_off;
  1035. else
  1036. size = mm->len - (old_off - head_off);
  1037. if (snapshot && size > snapshot_size)
  1038. size = snapshot_size;
  1039. ref = auxtrace_record__reference(itr);
  1040. if (head > old || size <= head || mm->mask) {
  1041. offset = head - size;
  1042. } else {
  1043. /*
  1044. * When the buffer size is not a power of 2, 'head' wraps at the
  1045. * highest multiple of the buffer size, so we have to subtract
  1046. * the remainder here.
  1047. */
  1048. u64 rem = (0ULL - mm->len) % mm->len;
  1049. offset = head - size - rem;
  1050. }
  1051. if (size > head_off) {
  1052. len1 = size - head_off;
  1053. data1 = &data[mm->len - len1];
  1054. len2 = head_off;
  1055. data2 = &data[0];
  1056. } else {
  1057. len1 = size;
  1058. data1 = &data[head_off - len1];
  1059. len2 = 0;
  1060. data2 = NULL;
  1061. }
  1062. if (itr->alignment) {
  1063. unsigned int unwanted = len1 % itr->alignment;
  1064. len1 -= unwanted;
  1065. size -= unwanted;
  1066. }
  1067. /* padding must be written by fn() e.g. record__process_auxtrace() */
  1068. padding = size & (PERF_AUXTRACE_RECORD_ALIGNMENT - 1);
  1069. if (padding)
  1070. padding = PERF_AUXTRACE_RECORD_ALIGNMENT - padding;
  1071. memset(&ev, 0, sizeof(ev));
  1072. ev.auxtrace.header.type = PERF_RECORD_AUXTRACE;
  1073. ev.auxtrace.header.size = sizeof(ev.auxtrace);
  1074. ev.auxtrace.size = size + padding;
  1075. ev.auxtrace.offset = offset;
  1076. ev.auxtrace.reference = ref;
  1077. ev.auxtrace.idx = mm->idx;
  1078. ev.auxtrace.tid = mm->tid;
  1079. ev.auxtrace.cpu = mm->cpu;
  1080. if (fn(tool, &ev, data1, len1, data2, len2))
  1081. return -1;
  1082. mm->prev = head;
  1083. if (!snapshot) {
  1084. auxtrace_mmap__write_tail(mm, head);
  1085. if (itr->read_finish) {
  1086. int err;
  1087. err = itr->read_finish(itr, mm->idx);
  1088. if (err < 0)
  1089. return err;
  1090. }
  1091. }
  1092. return 1;
  1093. }
  1094. int auxtrace_mmap__read(struct auxtrace_mmap *mm, struct auxtrace_record *itr,
  1095. struct perf_tool *tool, process_auxtrace_t fn)
  1096. {
  1097. return __auxtrace_mmap__read(mm, itr, tool, fn, false, 0);
  1098. }
  1099. int auxtrace_mmap__read_snapshot(struct auxtrace_mmap *mm,
  1100. struct auxtrace_record *itr,
  1101. struct perf_tool *tool, process_auxtrace_t fn,
  1102. size_t snapshot_size)
  1103. {
  1104. return __auxtrace_mmap__read(mm, itr, tool, fn, true, snapshot_size);
  1105. }
  1106. /**
  1107. * struct auxtrace_cache - hash table to implement a cache
  1108. * @hashtable: the hashtable
  1109. * @sz: hashtable size (number of hlists)
  1110. * @entry_size: size of an entry
  1111. * @limit: limit the number of entries to this maximum, when reached the cache
  1112. * is dropped and caching begins again with an empty cache
  1113. * @cnt: current number of entries
  1114. * @bits: hashtable size (@sz = 2^@bits)
  1115. */
  1116. struct auxtrace_cache {
  1117. struct hlist_head *hashtable;
  1118. size_t sz;
  1119. size_t entry_size;
  1120. size_t limit;
  1121. size_t cnt;
  1122. unsigned int bits;
  1123. };
  1124. struct auxtrace_cache *auxtrace_cache__new(unsigned int bits, size_t entry_size,
  1125. unsigned int limit_percent)
  1126. {
  1127. struct auxtrace_cache *c;
  1128. struct hlist_head *ht;
  1129. size_t sz, i;
  1130. c = zalloc(sizeof(struct auxtrace_cache));
  1131. if (!c)
  1132. return NULL;
  1133. sz = 1UL << bits;
  1134. ht = calloc(sz, sizeof(struct hlist_head));
  1135. if (!ht)
  1136. goto out_free;
  1137. for (i = 0; i < sz; i++)
  1138. INIT_HLIST_HEAD(&ht[i]);
  1139. c->hashtable = ht;
  1140. c->sz = sz;
  1141. c->entry_size = entry_size;
  1142. c->limit = (c->sz * limit_percent) / 100;
  1143. c->bits = bits;
  1144. return c;
  1145. out_free:
  1146. free(c);
  1147. return NULL;
  1148. }
  1149. static void auxtrace_cache__drop(struct auxtrace_cache *c)
  1150. {
  1151. struct auxtrace_cache_entry *entry;
  1152. struct hlist_node *tmp;
  1153. size_t i;
  1154. if (!c)
  1155. return;
  1156. for (i = 0; i < c->sz; i++) {
  1157. hlist_for_each_entry_safe(entry, tmp, &c->hashtable[i], hash) {
  1158. hlist_del(&entry->hash);
  1159. auxtrace_cache__free_entry(c, entry);
  1160. }
  1161. }
  1162. c->cnt = 0;
  1163. }
  1164. void auxtrace_cache__free(struct auxtrace_cache *c)
  1165. {
  1166. if (!c)
  1167. return;
  1168. auxtrace_cache__drop(c);
  1169. free(c->hashtable);
  1170. free(c);
  1171. }
  1172. void *auxtrace_cache__alloc_entry(struct auxtrace_cache *c)
  1173. {
  1174. return malloc(c->entry_size);
  1175. }
  1176. void auxtrace_cache__free_entry(struct auxtrace_cache *c __maybe_unused,
  1177. void *entry)
  1178. {
  1179. free(entry);
  1180. }
  1181. int auxtrace_cache__add(struct auxtrace_cache *c, u32 key,
  1182. struct auxtrace_cache_entry *entry)
  1183. {
  1184. if (c->limit && ++c->cnt > c->limit)
  1185. auxtrace_cache__drop(c);
  1186. entry->key = key;
  1187. hlist_add_head(&entry->hash, &c->hashtable[hash_32(key, c->bits)]);
  1188. return 0;
  1189. }
  1190. void *auxtrace_cache__lookup(struct auxtrace_cache *c, u32 key)
  1191. {
  1192. struct auxtrace_cache_entry *entry;
  1193. struct hlist_head *hlist;
  1194. if (!c)
  1195. return NULL;
  1196. hlist = &c->hashtable[hash_32(key, c->bits)];
  1197. hlist_for_each_entry(entry, hlist, hash) {
  1198. if (entry->key == key)
  1199. return entry;
  1200. }
  1201. return NULL;
  1202. }
  1203. static void addr_filter__free_str(struct addr_filter *filt)
  1204. {
  1205. free(filt->str);
  1206. filt->action = NULL;
  1207. filt->sym_from = NULL;
  1208. filt->sym_to = NULL;
  1209. filt->filename = NULL;
  1210. filt->str = NULL;
  1211. }
  1212. static struct addr_filter *addr_filter__new(void)
  1213. {
  1214. struct addr_filter *filt = zalloc(sizeof(*filt));
  1215. if (filt)
  1216. INIT_LIST_HEAD(&filt->list);
  1217. return filt;
  1218. }
  1219. static void addr_filter__free(struct addr_filter *filt)
  1220. {
  1221. if (filt)
  1222. addr_filter__free_str(filt);
  1223. free(filt);
  1224. }
  1225. static void addr_filters__add(struct addr_filters *filts,
  1226. struct addr_filter *filt)
  1227. {
  1228. list_add_tail(&filt->list, &filts->head);
  1229. filts->cnt += 1;
  1230. }
  1231. static void addr_filters__del(struct addr_filters *filts,
  1232. struct addr_filter *filt)
  1233. {
  1234. list_del_init(&filt->list);
  1235. filts->cnt -= 1;
  1236. }
  1237. void addr_filters__init(struct addr_filters *filts)
  1238. {
  1239. INIT_LIST_HEAD(&filts->head);
  1240. filts->cnt = 0;
  1241. }
  1242. void addr_filters__exit(struct addr_filters *filts)
  1243. {
  1244. struct addr_filter *filt, *n;
  1245. list_for_each_entry_safe(filt, n, &filts->head, list) {
  1246. addr_filters__del(filts, filt);
  1247. addr_filter__free(filt);
  1248. }
  1249. }
  1250. static int parse_num_or_str(char **inp, u64 *num, const char **str,
  1251. const char *str_delim)
  1252. {
  1253. *inp += strspn(*inp, " ");
  1254. if (isdigit(**inp)) {
  1255. char *endptr;
  1256. if (!num)
  1257. return -EINVAL;
  1258. errno = 0;
  1259. *num = strtoull(*inp, &endptr, 0);
  1260. if (errno)
  1261. return -errno;
  1262. if (endptr == *inp)
  1263. return -EINVAL;
  1264. *inp = endptr;
  1265. } else {
  1266. size_t n;
  1267. if (!str)
  1268. return -EINVAL;
  1269. *inp += strspn(*inp, " ");
  1270. *str = *inp;
  1271. n = strcspn(*inp, str_delim);
  1272. if (!n)
  1273. return -EINVAL;
  1274. *inp += n;
  1275. if (**inp) {
  1276. **inp = '\0';
  1277. *inp += 1;
  1278. }
  1279. }
  1280. return 0;
  1281. }
  1282. static int parse_action(struct addr_filter *filt)
  1283. {
  1284. if (!strcmp(filt->action, "filter")) {
  1285. filt->start = true;
  1286. filt->range = true;
  1287. } else if (!strcmp(filt->action, "start")) {
  1288. filt->start = true;
  1289. } else if (!strcmp(filt->action, "stop")) {
  1290. filt->start = false;
  1291. } else if (!strcmp(filt->action, "tracestop")) {
  1292. filt->start = false;
  1293. filt->range = true;
  1294. filt->action += 5; /* Change 'tracestop' to 'stop' */
  1295. } else {
  1296. return -EINVAL;
  1297. }
  1298. return 0;
  1299. }
  1300. static int parse_sym_idx(char **inp, int *idx)
  1301. {
  1302. *idx = -1;
  1303. *inp += strspn(*inp, " ");
  1304. if (**inp != '#')
  1305. return 0;
  1306. *inp += 1;
  1307. if (**inp == 'g' || **inp == 'G') {
  1308. *inp += 1;
  1309. *idx = 0;
  1310. } else {
  1311. unsigned long num;
  1312. char *endptr;
  1313. errno = 0;
  1314. num = strtoul(*inp, &endptr, 0);
  1315. if (errno)
  1316. return -errno;
  1317. if (endptr == *inp || num > INT_MAX)
  1318. return -EINVAL;
  1319. *inp = endptr;
  1320. *idx = num;
  1321. }
  1322. return 0;
  1323. }
  1324. static int parse_addr_size(char **inp, u64 *num, const char **str, int *idx)
  1325. {
  1326. int err = parse_num_or_str(inp, num, str, " ");
  1327. if (!err && *str)
  1328. err = parse_sym_idx(inp, idx);
  1329. return err;
  1330. }
  1331. static int parse_one_filter(struct addr_filter *filt, const char **filter_inp)
  1332. {
  1333. char *fstr;
  1334. int err;
  1335. filt->str = fstr = strdup(*filter_inp);
  1336. if (!fstr)
  1337. return -ENOMEM;
  1338. err = parse_num_or_str(&fstr, NULL, &filt->action, " ");
  1339. if (err)
  1340. goto out_err;
  1341. err = parse_action(filt);
  1342. if (err)
  1343. goto out_err;
  1344. err = parse_addr_size(&fstr, &filt->addr, &filt->sym_from,
  1345. &filt->sym_from_idx);
  1346. if (err)
  1347. goto out_err;
  1348. fstr += strspn(fstr, " ");
  1349. if (*fstr == '/') {
  1350. fstr += 1;
  1351. err = parse_addr_size(&fstr, &filt->size, &filt->sym_to,
  1352. &filt->sym_to_idx);
  1353. if (err)
  1354. goto out_err;
  1355. filt->range = true;
  1356. }
  1357. fstr += strspn(fstr, " ");
  1358. if (*fstr == '@') {
  1359. fstr += 1;
  1360. err = parse_num_or_str(&fstr, NULL, &filt->filename, " ,");
  1361. if (err)
  1362. goto out_err;
  1363. }
  1364. fstr += strspn(fstr, " ,");
  1365. *filter_inp += fstr - filt->str;
  1366. return 0;
  1367. out_err:
  1368. addr_filter__free_str(filt);
  1369. return err;
  1370. }
  1371. int addr_filters__parse_bare_filter(struct addr_filters *filts,
  1372. const char *filter)
  1373. {
  1374. struct addr_filter *filt;
  1375. const char *fstr = filter;
  1376. int err;
  1377. while (*fstr) {
  1378. filt = addr_filter__new();
  1379. err = parse_one_filter(filt, &fstr);
  1380. if (err) {
  1381. addr_filter__free(filt);
  1382. addr_filters__exit(filts);
  1383. return err;
  1384. }
  1385. addr_filters__add(filts, filt);
  1386. }
  1387. return 0;
  1388. }
  1389. struct sym_args {
  1390. const char *name;
  1391. u64 start;
  1392. u64 size;
  1393. int idx;
  1394. int cnt;
  1395. bool started;
  1396. bool global;
  1397. bool selected;
  1398. bool duplicate;
  1399. bool near;
  1400. };
  1401. static bool kern_sym_match(struct sym_args *args, const char *name, char type)
  1402. {
  1403. /* A function with the same name, and global or the n'th found or any */
  1404. return kallsyms__is_function(type) &&
  1405. !strcmp(name, args->name) &&
  1406. ((args->global && isupper(type)) ||
  1407. (args->selected && ++(args->cnt) == args->idx) ||
  1408. (!args->global && !args->selected));
  1409. }
  1410. static int find_kern_sym_cb(void *arg, const char *name, char type, u64 start)
  1411. {
  1412. struct sym_args *args = arg;
  1413. if (args->started) {
  1414. if (!args->size)
  1415. args->size = start - args->start;
  1416. if (args->selected) {
  1417. if (args->size)
  1418. return 1;
  1419. } else if (kern_sym_match(args, name, type)) {
  1420. args->duplicate = true;
  1421. return 1;
  1422. }
  1423. } else if (kern_sym_match(args, name, type)) {
  1424. args->started = true;
  1425. args->start = start;
  1426. }
  1427. return 0;
  1428. }
  1429. static int print_kern_sym_cb(void *arg, const char *name, char type, u64 start)
  1430. {
  1431. struct sym_args *args = arg;
  1432. if (kern_sym_match(args, name, type)) {
  1433. pr_err("#%d\t0x%"PRIx64"\t%c\t%s\n",
  1434. ++args->cnt, start, type, name);
  1435. args->near = true;
  1436. } else if (args->near) {
  1437. args->near = false;
  1438. pr_err("\t\twhich is near\t\t%s\n", name);
  1439. }
  1440. return 0;
  1441. }
  1442. static int sym_not_found_error(const char *sym_name, int idx)
  1443. {
  1444. if (idx > 0) {
  1445. pr_err("N'th occurrence (N=%d) of symbol '%s' not found.\n",
  1446. idx, sym_name);
  1447. } else if (!idx) {
  1448. pr_err("Global symbol '%s' not found.\n", sym_name);
  1449. } else {
  1450. pr_err("Symbol '%s' not found.\n", sym_name);
  1451. }
  1452. pr_err("Note that symbols must be functions.\n");
  1453. return -EINVAL;
  1454. }
  1455. static int find_kern_sym(const char *sym_name, u64 *start, u64 *size, int idx)
  1456. {
  1457. struct sym_args args = {
  1458. .name = sym_name,
  1459. .idx = idx,
  1460. .global = !idx,
  1461. .selected = idx > 0,
  1462. };
  1463. int err;
  1464. *start = 0;
  1465. *size = 0;
  1466. err = kallsyms__parse("/proc/kallsyms", &args, find_kern_sym_cb);
  1467. if (err < 0) {
  1468. pr_err("Failed to parse /proc/kallsyms\n");
  1469. return err;
  1470. }
  1471. if (args.duplicate) {
  1472. pr_err("Multiple kernel symbols with name '%s'\n", sym_name);
  1473. args.cnt = 0;
  1474. kallsyms__parse("/proc/kallsyms", &args, print_kern_sym_cb);
  1475. pr_err("Disambiguate symbol name by inserting #n after the name e.g. %s #2\n",
  1476. sym_name);
  1477. pr_err("Or select a global symbol by inserting #0 or #g or #G\n");
  1478. return -EINVAL;
  1479. }
  1480. if (!args.started) {
  1481. pr_err("Kernel symbol lookup: ");
  1482. return sym_not_found_error(sym_name, idx);
  1483. }
  1484. *start = args.start;
  1485. *size = args.size;
  1486. return 0;
  1487. }
  1488. static int find_entire_kern_cb(void *arg, const char *name __maybe_unused,
  1489. char type, u64 start)
  1490. {
  1491. struct sym_args *args = arg;
  1492. if (!kallsyms__is_function(type))
  1493. return 0;
  1494. if (!args->started) {
  1495. args->started = true;
  1496. args->start = start;
  1497. }
  1498. /* Don't know exactly where the kernel ends, so we add a page */
  1499. args->size = round_up(start, page_size) + page_size - args->start;
  1500. return 0;
  1501. }
  1502. static int addr_filter__entire_kernel(struct addr_filter *filt)
  1503. {
  1504. struct sym_args args = { .started = false };
  1505. int err;
  1506. err = kallsyms__parse("/proc/kallsyms", &args, find_entire_kern_cb);
  1507. if (err < 0 || !args.started) {
  1508. pr_err("Failed to parse /proc/kallsyms\n");
  1509. return err;
  1510. }
  1511. filt->addr = args.start;
  1512. filt->size = args.size;
  1513. return 0;
  1514. }
  1515. static int check_end_after_start(struct addr_filter *filt, u64 start, u64 size)
  1516. {
  1517. if (start + size >= filt->addr)
  1518. return 0;
  1519. if (filt->sym_from) {
  1520. pr_err("Symbol '%s' (0x%"PRIx64") comes before '%s' (0x%"PRIx64")\n",
  1521. filt->sym_to, start, filt->sym_from, filt->addr);
  1522. } else {
  1523. pr_err("Symbol '%s' (0x%"PRIx64") comes before address 0x%"PRIx64")\n",
  1524. filt->sym_to, start, filt->addr);
  1525. }
  1526. return -EINVAL;
  1527. }
  1528. static int addr_filter__resolve_kernel_syms(struct addr_filter *filt)
  1529. {
  1530. bool no_size = false;
  1531. u64 start, size;
  1532. int err;
  1533. if (symbol_conf.kptr_restrict) {
  1534. pr_err("Kernel addresses are restricted. Unable to resolve kernel symbols.\n");
  1535. return -EINVAL;
  1536. }
  1537. if (filt->sym_from && !strcmp(filt->sym_from, "*"))
  1538. return addr_filter__entire_kernel(filt);
  1539. if (filt->sym_from) {
  1540. err = find_kern_sym(filt->sym_from, &start, &size,
  1541. filt->sym_from_idx);
  1542. if (err)
  1543. return err;
  1544. filt->addr = start;
  1545. if (filt->range && !filt->size && !filt->sym_to) {
  1546. filt->size = size;
  1547. no_size = !size;
  1548. }
  1549. }
  1550. if (filt->sym_to) {
  1551. err = find_kern_sym(filt->sym_to, &start, &size,
  1552. filt->sym_to_idx);
  1553. if (err)
  1554. return err;
  1555. err = check_end_after_start(filt, start, size);
  1556. if (err)
  1557. return err;
  1558. filt->size = start + size - filt->addr;
  1559. no_size = !size;
  1560. }
  1561. /* The very last symbol in kallsyms does not imply a particular size */
  1562. if (no_size) {
  1563. pr_err("Cannot determine size of symbol '%s'\n",
  1564. filt->sym_to ? filt->sym_to : filt->sym_from);
  1565. return -EINVAL;
  1566. }
  1567. return 0;
  1568. }
  1569. static struct dso *load_dso(const char *name)
  1570. {
  1571. struct map *map;
  1572. struct dso *dso;
  1573. map = dso__new_map(name);
  1574. if (!map)
  1575. return NULL;
  1576. map__load(map);
  1577. dso = dso__get(map->dso);
  1578. map__put(map);
  1579. return dso;
  1580. }
  1581. static bool dso_sym_match(struct symbol *sym, const char *name, int *cnt,
  1582. int idx)
  1583. {
  1584. /* Same name, and global or the n'th found or any */
  1585. return !arch__compare_symbol_names(name, sym->name) &&
  1586. ((!idx && sym->binding == STB_GLOBAL) ||
  1587. (idx > 0 && ++*cnt == idx) ||
  1588. idx < 0);
  1589. }
  1590. static void print_duplicate_syms(struct dso *dso, const char *sym_name)
  1591. {
  1592. struct symbol *sym;
  1593. bool near = false;
  1594. int cnt = 0;
  1595. pr_err("Multiple symbols with name '%s'\n", sym_name);
  1596. sym = dso__first_symbol(dso);
  1597. while (sym) {
  1598. if (dso_sym_match(sym, sym_name, &cnt, -1)) {
  1599. pr_err("#%d\t0x%"PRIx64"\t%c\t%s\n",
  1600. ++cnt, sym->start,
  1601. sym->binding == STB_GLOBAL ? 'g' :
  1602. sym->binding == STB_LOCAL ? 'l' : 'w',
  1603. sym->name);
  1604. near = true;
  1605. } else if (near) {
  1606. near = false;
  1607. pr_err("\t\twhich is near\t\t%s\n", sym->name);
  1608. }
  1609. sym = dso__next_symbol(sym);
  1610. }
  1611. pr_err("Disambiguate symbol name by inserting #n after the name e.g. %s #2\n",
  1612. sym_name);
  1613. pr_err("Or select a global symbol by inserting #0 or #g or #G\n");
  1614. }
  1615. static int find_dso_sym(struct dso *dso, const char *sym_name, u64 *start,
  1616. u64 *size, int idx)
  1617. {
  1618. struct symbol *sym;
  1619. int cnt = 0;
  1620. *start = 0;
  1621. *size = 0;
  1622. sym = dso__first_symbol(dso);
  1623. while (sym) {
  1624. if (*start) {
  1625. if (!*size)
  1626. *size = sym->start - *start;
  1627. if (idx > 0) {
  1628. if (*size)
  1629. return 1;
  1630. } else if (dso_sym_match(sym, sym_name, &cnt, idx)) {
  1631. print_duplicate_syms(dso, sym_name);
  1632. return -EINVAL;
  1633. }
  1634. } else if (dso_sym_match(sym, sym_name, &cnt, idx)) {
  1635. *start = sym->start;
  1636. *size = sym->end - sym->start;
  1637. }
  1638. sym = dso__next_symbol(sym);
  1639. }
  1640. if (!*start)
  1641. return sym_not_found_error(sym_name, idx);
  1642. return 0;
  1643. }
  1644. static int addr_filter__entire_dso(struct addr_filter *filt, struct dso *dso)
  1645. {
  1646. struct symbol *first_sym = dso__first_symbol(dso);
  1647. struct symbol *last_sym = dso__last_symbol(dso);
  1648. if (!first_sym || !last_sym) {
  1649. pr_err("Failed to determine filter for %s\nNo symbols found.\n",
  1650. filt->filename);
  1651. return -EINVAL;
  1652. }
  1653. filt->addr = first_sym->start;
  1654. filt->size = last_sym->end - first_sym->start;
  1655. return 0;
  1656. }
  1657. static int addr_filter__resolve_syms(struct addr_filter *filt)
  1658. {
  1659. u64 start, size;
  1660. struct dso *dso;
  1661. int err = 0;
  1662. if (!filt->sym_from && !filt->sym_to)
  1663. return 0;
  1664. if (!filt->filename)
  1665. return addr_filter__resolve_kernel_syms(filt);
  1666. dso = load_dso(filt->filename);
  1667. if (!dso) {
  1668. pr_err("Failed to load symbols from: %s\n", filt->filename);
  1669. return -EINVAL;
  1670. }
  1671. if (filt->sym_from && !strcmp(filt->sym_from, "*")) {
  1672. err = addr_filter__entire_dso(filt, dso);
  1673. goto put_dso;
  1674. }
  1675. if (filt->sym_from) {
  1676. err = find_dso_sym(dso, filt->sym_from, &start, &size,
  1677. filt->sym_from_idx);
  1678. if (err)
  1679. goto put_dso;
  1680. filt->addr = start;
  1681. if (filt->range && !filt->size && !filt->sym_to)
  1682. filt->size = size;
  1683. }
  1684. if (filt->sym_to) {
  1685. err = find_dso_sym(dso, filt->sym_to, &start, &size,
  1686. filt->sym_to_idx);
  1687. if (err)
  1688. goto put_dso;
  1689. err = check_end_after_start(filt, start, size);
  1690. if (err)
  1691. return err;
  1692. filt->size = start + size - filt->addr;
  1693. }
  1694. put_dso:
  1695. dso__put(dso);
  1696. return err;
  1697. }
  1698. static char *addr_filter__to_str(struct addr_filter *filt)
  1699. {
  1700. char filename_buf[PATH_MAX];
  1701. const char *at = "";
  1702. const char *fn = "";
  1703. char *filter;
  1704. int err;
  1705. if (filt->filename) {
  1706. at = "@";
  1707. fn = realpath(filt->filename, filename_buf);
  1708. if (!fn)
  1709. return NULL;
  1710. }
  1711. if (filt->range) {
  1712. err = asprintf(&filter, "%s 0x%"PRIx64"/0x%"PRIx64"%s%s",
  1713. filt->action, filt->addr, filt->size, at, fn);
  1714. } else {
  1715. err = asprintf(&filter, "%s 0x%"PRIx64"%s%s",
  1716. filt->action, filt->addr, at, fn);
  1717. }
  1718. return err < 0 ? NULL : filter;
  1719. }
  1720. static int parse_addr_filter(struct perf_evsel *evsel, const char *filter,
  1721. int max_nr)
  1722. {
  1723. struct addr_filters filts;
  1724. struct addr_filter *filt;
  1725. int err;
  1726. addr_filters__init(&filts);
  1727. err = addr_filters__parse_bare_filter(&filts, filter);
  1728. if (err)
  1729. goto out_exit;
  1730. if (filts.cnt > max_nr) {
  1731. pr_err("Error: number of address filters (%d) exceeds maximum (%d)\n",
  1732. filts.cnt, max_nr);
  1733. err = -EINVAL;
  1734. goto out_exit;
  1735. }
  1736. list_for_each_entry(filt, &filts.head, list) {
  1737. char *new_filter;
  1738. err = addr_filter__resolve_syms(filt);
  1739. if (err)
  1740. goto out_exit;
  1741. new_filter = addr_filter__to_str(filt);
  1742. if (!new_filter) {
  1743. err = -ENOMEM;
  1744. goto out_exit;
  1745. }
  1746. if (perf_evsel__append_addr_filter(evsel, new_filter)) {
  1747. err = -ENOMEM;
  1748. goto out_exit;
  1749. }
  1750. }
  1751. out_exit:
  1752. addr_filters__exit(&filts);
  1753. if (err) {
  1754. pr_err("Failed to parse address filter: '%s'\n", filter);
  1755. pr_err("Filter format is: filter|start|stop|tracestop <start symbol or address> [/ <end symbol or size>] [@<file name>]\n");
  1756. pr_err("Where multiple filters are separated by space or comma.\n");
  1757. }
  1758. return err;
  1759. }
  1760. static struct perf_pmu *perf_evsel__find_pmu(struct perf_evsel *evsel)
  1761. {
  1762. struct perf_pmu *pmu = NULL;
  1763. while ((pmu = perf_pmu__scan(pmu)) != NULL) {
  1764. if (pmu->type == evsel->attr.type)
  1765. break;
  1766. }
  1767. return pmu;
  1768. }
  1769. static int perf_evsel__nr_addr_filter(struct perf_evsel *evsel)
  1770. {
  1771. struct perf_pmu *pmu = perf_evsel__find_pmu(evsel);
  1772. int nr_addr_filters = 0;
  1773. if (!pmu)
  1774. return 0;
  1775. perf_pmu__scan_file(pmu, "nr_addr_filters", "%d", &nr_addr_filters);
  1776. return nr_addr_filters;
  1777. }
  1778. int auxtrace_parse_filters(struct perf_evlist *evlist)
  1779. {
  1780. struct perf_evsel *evsel;
  1781. char *filter;
  1782. int err, max_nr;
  1783. evlist__for_each_entry(evlist, evsel) {
  1784. filter = evsel->filter;
  1785. max_nr = perf_evsel__nr_addr_filter(evsel);
  1786. if (!filter || !max_nr)
  1787. continue;
  1788. evsel->filter = NULL;
  1789. err = parse_addr_filter(evsel, filter, max_nr);
  1790. free(filter);
  1791. if (err)
  1792. return err;
  1793. pr_debug("Address filter: %s\n", evsel->filter);
  1794. }
  1795. return 0;
  1796. }