auxtrace.c 48 KB

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