auxtrace.c 47 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164
  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 "sane_ctype.h"
  53. #include "symbol/kallsyms.h"
  54. static bool auxtrace__dont_decode(struct perf_session *session)
  55. {
  56. return !session->itrace_synth_opts ||
  57. session->itrace_synth_opts->dont_decode;
  58. }
  59. int auxtrace_mmap__mmap(struct auxtrace_mmap *mm,
  60. struct auxtrace_mmap_params *mp,
  61. void *userpg, int fd)
  62. {
  63. struct perf_event_mmap_page *pc = userpg;
  64. WARN_ONCE(mm->base, "Uninitialized auxtrace_mmap\n");
  65. mm->userpg = userpg;
  66. mm->mask = mp->mask;
  67. mm->len = mp->len;
  68. mm->prev = 0;
  69. mm->idx = mp->idx;
  70. mm->tid = mp->tid;
  71. mm->cpu = mp->cpu;
  72. if (!mp->len) {
  73. mm->base = NULL;
  74. return 0;
  75. }
  76. #if BITS_PER_LONG != 64 && !defined(HAVE_SYNC_COMPARE_AND_SWAP_SUPPORT)
  77. pr_err("Cannot use AUX area tracing mmaps\n");
  78. return -1;
  79. #endif
  80. pc->aux_offset = mp->offset;
  81. pc->aux_size = mp->len;
  82. mm->base = mmap(NULL, mp->len, mp->prot, MAP_SHARED, fd, mp->offset);
  83. if (mm->base == MAP_FAILED) {
  84. pr_debug2("failed to mmap AUX area\n");
  85. mm->base = NULL;
  86. return -1;
  87. }
  88. return 0;
  89. }
  90. void auxtrace_mmap__munmap(struct auxtrace_mmap *mm)
  91. {
  92. if (mm->base) {
  93. munmap(mm->base, mm->len);
  94. mm->base = NULL;
  95. }
  96. }
  97. void auxtrace_mmap_params__init(struct auxtrace_mmap_params *mp,
  98. off_t auxtrace_offset,
  99. unsigned int auxtrace_pages,
  100. bool auxtrace_overwrite)
  101. {
  102. if (auxtrace_pages) {
  103. mp->offset = auxtrace_offset;
  104. mp->len = auxtrace_pages * (size_t)page_size;
  105. mp->mask = is_power_of_2(mp->len) ? mp->len - 1 : 0;
  106. mp->prot = PROT_READ | (auxtrace_overwrite ? 0 : PROT_WRITE);
  107. pr_debug2("AUX area mmap length %zu\n", mp->len);
  108. } else {
  109. mp->len = 0;
  110. }
  111. }
  112. void auxtrace_mmap_params__set_idx(struct auxtrace_mmap_params *mp,
  113. struct perf_evlist *evlist, int idx,
  114. bool per_cpu)
  115. {
  116. mp->idx = idx;
  117. if (per_cpu) {
  118. mp->cpu = evlist->cpus->map[idx];
  119. if (evlist->threads)
  120. mp->tid = thread_map__pid(evlist->threads, 0);
  121. else
  122. mp->tid = -1;
  123. } else {
  124. mp->cpu = -1;
  125. mp->tid = thread_map__pid(evlist->threads, idx);
  126. }
  127. }
  128. #define AUXTRACE_INIT_NR_QUEUES 32
  129. static struct auxtrace_queue *auxtrace_alloc_queue_array(unsigned int nr_queues)
  130. {
  131. struct auxtrace_queue *queue_array;
  132. unsigned int max_nr_queues, i;
  133. max_nr_queues = UINT_MAX / sizeof(struct auxtrace_queue);
  134. if (nr_queues > max_nr_queues)
  135. return NULL;
  136. queue_array = calloc(nr_queues, sizeof(struct auxtrace_queue));
  137. if (!queue_array)
  138. return NULL;
  139. for (i = 0; i < nr_queues; i++) {
  140. INIT_LIST_HEAD(&queue_array[i].head);
  141. queue_array[i].priv = NULL;
  142. }
  143. return queue_array;
  144. }
  145. int auxtrace_queues__init(struct auxtrace_queues *queues)
  146. {
  147. queues->nr_queues = AUXTRACE_INIT_NR_QUEUES;
  148. queues->queue_array = auxtrace_alloc_queue_array(queues->nr_queues);
  149. if (!queues->queue_array)
  150. return -ENOMEM;
  151. return 0;
  152. }
  153. static int auxtrace_queues__grow(struct auxtrace_queues *queues,
  154. unsigned int new_nr_queues)
  155. {
  156. unsigned int nr_queues = queues->nr_queues;
  157. struct auxtrace_queue *queue_array;
  158. unsigned int i;
  159. if (!nr_queues)
  160. nr_queues = AUXTRACE_INIT_NR_QUEUES;
  161. while (nr_queues && nr_queues < new_nr_queues)
  162. nr_queues <<= 1;
  163. if (nr_queues < queues->nr_queues || nr_queues < new_nr_queues)
  164. return -EINVAL;
  165. queue_array = auxtrace_alloc_queue_array(nr_queues);
  166. if (!queue_array)
  167. return -ENOMEM;
  168. for (i = 0; i < queues->nr_queues; i++) {
  169. list_splice_tail(&queues->queue_array[i].head,
  170. &queue_array[i].head);
  171. queue_array[i].priv = queues->queue_array[i].priv;
  172. }
  173. queues->nr_queues = nr_queues;
  174. queues->queue_array = queue_array;
  175. return 0;
  176. }
  177. static void *auxtrace_copy_data(u64 size, struct perf_session *session)
  178. {
  179. int fd = perf_data__fd(session->data);
  180. void *p;
  181. ssize_t ret;
  182. if (size > SSIZE_MAX)
  183. return NULL;
  184. p = malloc(size);
  185. if (!p)
  186. return NULL;
  187. ret = readn(fd, p, size);
  188. if (ret != (ssize_t)size) {
  189. free(p);
  190. return NULL;
  191. }
  192. return p;
  193. }
  194. static int auxtrace_queues__queue_buffer(struct auxtrace_queues *queues,
  195. unsigned int idx,
  196. struct auxtrace_buffer *buffer)
  197. {
  198. struct auxtrace_queue *queue;
  199. int err;
  200. if (idx >= queues->nr_queues) {
  201. err = auxtrace_queues__grow(queues, idx + 1);
  202. if (err)
  203. return err;
  204. }
  205. queue = &queues->queue_array[idx];
  206. if (!queue->set) {
  207. queue->set = true;
  208. queue->tid = buffer->tid;
  209. queue->cpu = buffer->cpu;
  210. } else if (buffer->cpu != queue->cpu || buffer->tid != queue->tid) {
  211. pr_err("auxtrace queue conflict: cpu %d, tid %d vs cpu %d, tid %d\n",
  212. queue->cpu, queue->tid, buffer->cpu, buffer->tid);
  213. return -EINVAL;
  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_UNKNOWN:
  762. default:
  763. return -EINVAL;
  764. }
  765. }
  766. s64 perf_event__process_auxtrace(struct perf_tool *tool,
  767. union perf_event *event,
  768. struct perf_session *session)
  769. {
  770. s64 err;
  771. if (dump_trace)
  772. fprintf(stdout, " size: %#"PRIx64" offset: %#"PRIx64" ref: %#"PRIx64" idx: %u tid: %d cpu: %d\n",
  773. event->auxtrace.size, event->auxtrace.offset,
  774. event->auxtrace.reference, event->auxtrace.idx,
  775. event->auxtrace.tid, event->auxtrace.cpu);
  776. if (auxtrace__dont_decode(session))
  777. return event->auxtrace.size;
  778. if (!session->auxtrace || event->header.type != PERF_RECORD_AUXTRACE)
  779. return -EINVAL;
  780. err = session->auxtrace->process_auxtrace_event(session, event, tool);
  781. if (err < 0)
  782. return err;
  783. return event->auxtrace.size;
  784. }
  785. #define PERF_ITRACE_DEFAULT_PERIOD_TYPE PERF_ITRACE_PERIOD_NANOSECS
  786. #define PERF_ITRACE_DEFAULT_PERIOD 100000
  787. #define PERF_ITRACE_DEFAULT_CALLCHAIN_SZ 16
  788. #define PERF_ITRACE_MAX_CALLCHAIN_SZ 1024
  789. #define PERF_ITRACE_DEFAULT_LAST_BRANCH_SZ 64
  790. #define PERF_ITRACE_MAX_LAST_BRANCH_SZ 1024
  791. void itrace_synth_opts__set_default(struct itrace_synth_opts *synth_opts)
  792. {
  793. synth_opts->instructions = true;
  794. synth_opts->branches = true;
  795. synth_opts->transactions = true;
  796. synth_opts->ptwrites = true;
  797. synth_opts->pwr_events = true;
  798. synth_opts->errors = true;
  799. synth_opts->period_type = PERF_ITRACE_DEFAULT_PERIOD_TYPE;
  800. synth_opts->period = PERF_ITRACE_DEFAULT_PERIOD;
  801. synth_opts->callchain_sz = PERF_ITRACE_DEFAULT_CALLCHAIN_SZ;
  802. synth_opts->last_branch_sz = PERF_ITRACE_DEFAULT_LAST_BRANCH_SZ;
  803. synth_opts->initial_skip = 0;
  804. }
  805. /*
  806. * Please check tools/perf/Documentation/perf-script.txt for information
  807. * about the options parsed here, which is introduced after this cset,
  808. * when support in 'perf script' for these options is introduced.
  809. */
  810. int itrace_parse_synth_opts(const struct option *opt, const char *str,
  811. int unset)
  812. {
  813. struct itrace_synth_opts *synth_opts = opt->value;
  814. const char *p;
  815. char *endptr;
  816. bool period_type_set = false;
  817. bool period_set = false;
  818. synth_opts->set = true;
  819. if (unset) {
  820. synth_opts->dont_decode = true;
  821. return 0;
  822. }
  823. if (!str) {
  824. itrace_synth_opts__set_default(synth_opts);
  825. return 0;
  826. }
  827. for (p = str; *p;) {
  828. switch (*p++) {
  829. case 'i':
  830. synth_opts->instructions = true;
  831. while (*p == ' ' || *p == ',')
  832. p += 1;
  833. if (isdigit(*p)) {
  834. synth_opts->period = strtoull(p, &endptr, 10);
  835. period_set = true;
  836. p = endptr;
  837. while (*p == ' ' || *p == ',')
  838. p += 1;
  839. switch (*p++) {
  840. case 'i':
  841. synth_opts->period_type =
  842. PERF_ITRACE_PERIOD_INSTRUCTIONS;
  843. period_type_set = true;
  844. break;
  845. case 't':
  846. synth_opts->period_type =
  847. PERF_ITRACE_PERIOD_TICKS;
  848. period_type_set = true;
  849. break;
  850. case 'm':
  851. synth_opts->period *= 1000;
  852. /* Fall through */
  853. case 'u':
  854. synth_opts->period *= 1000;
  855. /* Fall through */
  856. case 'n':
  857. if (*p++ != 's')
  858. goto out_err;
  859. synth_opts->period_type =
  860. PERF_ITRACE_PERIOD_NANOSECS;
  861. period_type_set = true;
  862. break;
  863. case '\0':
  864. goto out;
  865. default:
  866. goto out_err;
  867. }
  868. }
  869. break;
  870. case 'b':
  871. synth_opts->branches = true;
  872. break;
  873. case 'x':
  874. synth_opts->transactions = true;
  875. break;
  876. case 'w':
  877. synth_opts->ptwrites = true;
  878. break;
  879. case 'p':
  880. synth_opts->pwr_events = true;
  881. break;
  882. case 'e':
  883. synth_opts->errors = true;
  884. break;
  885. case 'd':
  886. synth_opts->log = true;
  887. break;
  888. case 'c':
  889. synth_opts->branches = true;
  890. synth_opts->calls = true;
  891. break;
  892. case 'r':
  893. synth_opts->branches = true;
  894. synth_opts->returns = true;
  895. break;
  896. case 'g':
  897. synth_opts->callchain = true;
  898. synth_opts->callchain_sz =
  899. PERF_ITRACE_DEFAULT_CALLCHAIN_SZ;
  900. while (*p == ' ' || *p == ',')
  901. p += 1;
  902. if (isdigit(*p)) {
  903. unsigned int val;
  904. val = strtoul(p, &endptr, 10);
  905. p = endptr;
  906. if (!val || val > PERF_ITRACE_MAX_CALLCHAIN_SZ)
  907. goto out_err;
  908. synth_opts->callchain_sz = val;
  909. }
  910. break;
  911. case 'l':
  912. synth_opts->last_branch = true;
  913. synth_opts->last_branch_sz =
  914. PERF_ITRACE_DEFAULT_LAST_BRANCH_SZ;
  915. while (*p == ' ' || *p == ',')
  916. p += 1;
  917. if (isdigit(*p)) {
  918. unsigned int val;
  919. val = strtoul(p, &endptr, 10);
  920. p = endptr;
  921. if (!val ||
  922. val > PERF_ITRACE_MAX_LAST_BRANCH_SZ)
  923. goto out_err;
  924. synth_opts->last_branch_sz = val;
  925. }
  926. break;
  927. case 's':
  928. synth_opts->initial_skip = strtoul(p, &endptr, 10);
  929. if (p == endptr)
  930. goto out_err;
  931. p = endptr;
  932. break;
  933. case ' ':
  934. case ',':
  935. break;
  936. default:
  937. goto out_err;
  938. }
  939. }
  940. out:
  941. if (synth_opts->instructions) {
  942. if (!period_type_set)
  943. synth_opts->period_type =
  944. PERF_ITRACE_DEFAULT_PERIOD_TYPE;
  945. if (!period_set)
  946. synth_opts->period = PERF_ITRACE_DEFAULT_PERIOD;
  947. }
  948. return 0;
  949. out_err:
  950. pr_err("Bad Instruction Tracing options '%s'\n", str);
  951. return -EINVAL;
  952. }
  953. static const char * const auxtrace_error_type_name[] = {
  954. [PERF_AUXTRACE_ERROR_ITRACE] = "instruction trace",
  955. };
  956. static const char *auxtrace_error_name(int type)
  957. {
  958. const char *error_type_name = NULL;
  959. if (type < PERF_AUXTRACE_ERROR_MAX)
  960. error_type_name = auxtrace_error_type_name[type];
  961. if (!error_type_name)
  962. error_type_name = "unknown AUX";
  963. return error_type_name;
  964. }
  965. size_t perf_event__fprintf_auxtrace_error(union perf_event *event, FILE *fp)
  966. {
  967. struct auxtrace_error_event *e = &event->auxtrace_error;
  968. int ret;
  969. ret = fprintf(fp, " %s error type %u",
  970. auxtrace_error_name(e->type), e->type);
  971. ret += fprintf(fp, " cpu %d pid %d tid %d ip %#"PRIx64" code %u: %s\n",
  972. e->cpu, e->pid, e->tid, e->ip, e->code, e->msg);
  973. return ret;
  974. }
  975. void perf_session__auxtrace_error_inc(struct perf_session *session,
  976. union perf_event *event)
  977. {
  978. struct auxtrace_error_event *e = &event->auxtrace_error;
  979. if (e->type < PERF_AUXTRACE_ERROR_MAX)
  980. session->evlist->stats.nr_auxtrace_errors[e->type] += 1;
  981. }
  982. void events_stats__auxtrace_error_warn(const struct events_stats *stats)
  983. {
  984. int i;
  985. for (i = 0; i < PERF_AUXTRACE_ERROR_MAX; i++) {
  986. if (!stats->nr_auxtrace_errors[i])
  987. continue;
  988. ui__warning("%u %s errors\n",
  989. stats->nr_auxtrace_errors[i],
  990. auxtrace_error_name(i));
  991. }
  992. }
  993. int perf_event__process_auxtrace_error(struct perf_tool *tool __maybe_unused,
  994. union perf_event *event,
  995. struct perf_session *session)
  996. {
  997. if (auxtrace__dont_decode(session))
  998. return 0;
  999. perf_event__fprintf_auxtrace_error(event, stdout);
  1000. return 0;
  1001. }
  1002. static int __auxtrace_mmap__read(struct auxtrace_mmap *mm,
  1003. struct auxtrace_record *itr,
  1004. struct perf_tool *tool, process_auxtrace_t fn,
  1005. bool snapshot, size_t snapshot_size)
  1006. {
  1007. u64 head, old = mm->prev, offset, ref;
  1008. unsigned char *data = mm->base;
  1009. size_t size, head_off, old_off, len1, len2, padding;
  1010. union perf_event ev;
  1011. void *data1, *data2;
  1012. if (snapshot) {
  1013. head = auxtrace_mmap__read_snapshot_head(mm);
  1014. if (auxtrace_record__find_snapshot(itr, mm->idx, mm, data,
  1015. &head, &old))
  1016. return -1;
  1017. } else {
  1018. head = auxtrace_mmap__read_head(mm);
  1019. }
  1020. if (old == head)
  1021. return 0;
  1022. pr_debug3("auxtrace idx %d old %#"PRIx64" head %#"PRIx64" diff %#"PRIx64"\n",
  1023. mm->idx, old, head, head - old);
  1024. if (mm->mask) {
  1025. head_off = head & mm->mask;
  1026. old_off = old & mm->mask;
  1027. } else {
  1028. head_off = head % mm->len;
  1029. old_off = old % mm->len;
  1030. }
  1031. if (head_off > old_off)
  1032. size = head_off - old_off;
  1033. else
  1034. size = mm->len - (old_off - head_off);
  1035. if (snapshot && size > snapshot_size)
  1036. size = snapshot_size;
  1037. ref = auxtrace_record__reference(itr);
  1038. if (head > old || size <= head || mm->mask) {
  1039. offset = head - size;
  1040. } else {
  1041. /*
  1042. * When the buffer size is not a power of 2, 'head' wraps at the
  1043. * highest multiple of the buffer size, so we have to subtract
  1044. * the remainder here.
  1045. */
  1046. u64 rem = (0ULL - mm->len) % mm->len;
  1047. offset = head - size - rem;
  1048. }
  1049. if (size > head_off) {
  1050. len1 = size - head_off;
  1051. data1 = &data[mm->len - len1];
  1052. len2 = head_off;
  1053. data2 = &data[0];
  1054. } else {
  1055. len1 = size;
  1056. data1 = &data[head_off - len1];
  1057. len2 = 0;
  1058. data2 = NULL;
  1059. }
  1060. if (itr->alignment) {
  1061. unsigned int unwanted = len1 % itr->alignment;
  1062. len1 -= unwanted;
  1063. size -= unwanted;
  1064. }
  1065. /* padding must be written by fn() e.g. record__process_auxtrace() */
  1066. padding = size & 7;
  1067. if (padding)
  1068. padding = 8 - padding;
  1069. memset(&ev, 0, sizeof(ev));
  1070. ev.auxtrace.header.type = PERF_RECORD_AUXTRACE;
  1071. ev.auxtrace.header.size = sizeof(ev.auxtrace);
  1072. ev.auxtrace.size = size + padding;
  1073. ev.auxtrace.offset = offset;
  1074. ev.auxtrace.reference = ref;
  1075. ev.auxtrace.idx = mm->idx;
  1076. ev.auxtrace.tid = mm->tid;
  1077. ev.auxtrace.cpu = mm->cpu;
  1078. if (fn(tool, &ev, data1, len1, data2, len2))
  1079. return -1;
  1080. mm->prev = head;
  1081. if (!snapshot) {
  1082. auxtrace_mmap__write_tail(mm, head);
  1083. if (itr->read_finish) {
  1084. int err;
  1085. err = itr->read_finish(itr, mm->idx);
  1086. if (err < 0)
  1087. return err;
  1088. }
  1089. }
  1090. return 1;
  1091. }
  1092. int auxtrace_mmap__read(struct auxtrace_mmap *mm, struct auxtrace_record *itr,
  1093. struct perf_tool *tool, process_auxtrace_t fn)
  1094. {
  1095. return __auxtrace_mmap__read(mm, itr, tool, fn, false, 0);
  1096. }
  1097. int auxtrace_mmap__read_snapshot(struct auxtrace_mmap *mm,
  1098. struct auxtrace_record *itr,
  1099. struct perf_tool *tool, process_auxtrace_t fn,
  1100. size_t snapshot_size)
  1101. {
  1102. return __auxtrace_mmap__read(mm, itr, tool, fn, true, snapshot_size);
  1103. }
  1104. /**
  1105. * struct auxtrace_cache - hash table to implement a cache
  1106. * @hashtable: the hashtable
  1107. * @sz: hashtable size (number of hlists)
  1108. * @entry_size: size of an entry
  1109. * @limit: limit the number of entries to this maximum, when reached the cache
  1110. * is dropped and caching begins again with an empty cache
  1111. * @cnt: current number of entries
  1112. * @bits: hashtable size (@sz = 2^@bits)
  1113. */
  1114. struct auxtrace_cache {
  1115. struct hlist_head *hashtable;
  1116. size_t sz;
  1117. size_t entry_size;
  1118. size_t limit;
  1119. size_t cnt;
  1120. unsigned int bits;
  1121. };
  1122. struct auxtrace_cache *auxtrace_cache__new(unsigned int bits, size_t entry_size,
  1123. unsigned int limit_percent)
  1124. {
  1125. struct auxtrace_cache *c;
  1126. struct hlist_head *ht;
  1127. size_t sz, i;
  1128. c = zalloc(sizeof(struct auxtrace_cache));
  1129. if (!c)
  1130. return NULL;
  1131. sz = 1UL << bits;
  1132. ht = calloc(sz, sizeof(struct hlist_head));
  1133. if (!ht)
  1134. goto out_free;
  1135. for (i = 0; i < sz; i++)
  1136. INIT_HLIST_HEAD(&ht[i]);
  1137. c->hashtable = ht;
  1138. c->sz = sz;
  1139. c->entry_size = entry_size;
  1140. c->limit = (c->sz * limit_percent) / 100;
  1141. c->bits = bits;
  1142. return c;
  1143. out_free:
  1144. free(c);
  1145. return NULL;
  1146. }
  1147. static void auxtrace_cache__drop(struct auxtrace_cache *c)
  1148. {
  1149. struct auxtrace_cache_entry *entry;
  1150. struct hlist_node *tmp;
  1151. size_t i;
  1152. if (!c)
  1153. return;
  1154. for (i = 0; i < c->sz; i++) {
  1155. hlist_for_each_entry_safe(entry, tmp, &c->hashtable[i], hash) {
  1156. hlist_del(&entry->hash);
  1157. auxtrace_cache__free_entry(c, entry);
  1158. }
  1159. }
  1160. c->cnt = 0;
  1161. }
  1162. void auxtrace_cache__free(struct auxtrace_cache *c)
  1163. {
  1164. if (!c)
  1165. return;
  1166. auxtrace_cache__drop(c);
  1167. free(c->hashtable);
  1168. free(c);
  1169. }
  1170. void *auxtrace_cache__alloc_entry(struct auxtrace_cache *c)
  1171. {
  1172. return malloc(c->entry_size);
  1173. }
  1174. void auxtrace_cache__free_entry(struct auxtrace_cache *c __maybe_unused,
  1175. void *entry)
  1176. {
  1177. free(entry);
  1178. }
  1179. int auxtrace_cache__add(struct auxtrace_cache *c, u32 key,
  1180. struct auxtrace_cache_entry *entry)
  1181. {
  1182. if (c->limit && ++c->cnt > c->limit)
  1183. auxtrace_cache__drop(c);
  1184. entry->key = key;
  1185. hlist_add_head(&entry->hash, &c->hashtable[hash_32(key, c->bits)]);
  1186. return 0;
  1187. }
  1188. void *auxtrace_cache__lookup(struct auxtrace_cache *c, u32 key)
  1189. {
  1190. struct auxtrace_cache_entry *entry;
  1191. struct hlist_head *hlist;
  1192. if (!c)
  1193. return NULL;
  1194. hlist = &c->hashtable[hash_32(key, c->bits)];
  1195. hlist_for_each_entry(entry, hlist, hash) {
  1196. if (entry->key == key)
  1197. return entry;
  1198. }
  1199. return NULL;
  1200. }
  1201. static void addr_filter__free_str(struct addr_filter *filt)
  1202. {
  1203. free(filt->str);
  1204. filt->action = NULL;
  1205. filt->sym_from = NULL;
  1206. filt->sym_to = NULL;
  1207. filt->filename = NULL;
  1208. filt->str = NULL;
  1209. }
  1210. static struct addr_filter *addr_filter__new(void)
  1211. {
  1212. struct addr_filter *filt = zalloc(sizeof(*filt));
  1213. if (filt)
  1214. INIT_LIST_HEAD(&filt->list);
  1215. return filt;
  1216. }
  1217. static void addr_filter__free(struct addr_filter *filt)
  1218. {
  1219. if (filt)
  1220. addr_filter__free_str(filt);
  1221. free(filt);
  1222. }
  1223. static void addr_filters__add(struct addr_filters *filts,
  1224. struct addr_filter *filt)
  1225. {
  1226. list_add_tail(&filt->list, &filts->head);
  1227. filts->cnt += 1;
  1228. }
  1229. static void addr_filters__del(struct addr_filters *filts,
  1230. struct addr_filter *filt)
  1231. {
  1232. list_del_init(&filt->list);
  1233. filts->cnt -= 1;
  1234. }
  1235. void addr_filters__init(struct addr_filters *filts)
  1236. {
  1237. INIT_LIST_HEAD(&filts->head);
  1238. filts->cnt = 0;
  1239. }
  1240. void addr_filters__exit(struct addr_filters *filts)
  1241. {
  1242. struct addr_filter *filt, *n;
  1243. list_for_each_entry_safe(filt, n, &filts->head, list) {
  1244. addr_filters__del(filts, filt);
  1245. addr_filter__free(filt);
  1246. }
  1247. }
  1248. static int parse_num_or_str(char **inp, u64 *num, const char **str,
  1249. const char *str_delim)
  1250. {
  1251. *inp += strspn(*inp, " ");
  1252. if (isdigit(**inp)) {
  1253. char *endptr;
  1254. if (!num)
  1255. return -EINVAL;
  1256. errno = 0;
  1257. *num = strtoull(*inp, &endptr, 0);
  1258. if (errno)
  1259. return -errno;
  1260. if (endptr == *inp)
  1261. return -EINVAL;
  1262. *inp = endptr;
  1263. } else {
  1264. size_t n;
  1265. if (!str)
  1266. return -EINVAL;
  1267. *inp += strspn(*inp, " ");
  1268. *str = *inp;
  1269. n = strcspn(*inp, str_delim);
  1270. if (!n)
  1271. return -EINVAL;
  1272. *inp += n;
  1273. if (**inp) {
  1274. **inp = '\0';
  1275. *inp += 1;
  1276. }
  1277. }
  1278. return 0;
  1279. }
  1280. static int parse_action(struct addr_filter *filt)
  1281. {
  1282. if (!strcmp(filt->action, "filter")) {
  1283. filt->start = true;
  1284. filt->range = true;
  1285. } else if (!strcmp(filt->action, "start")) {
  1286. filt->start = true;
  1287. } else if (!strcmp(filt->action, "stop")) {
  1288. filt->start = false;
  1289. } else if (!strcmp(filt->action, "tracestop")) {
  1290. filt->start = false;
  1291. filt->range = true;
  1292. filt->action += 5; /* Change 'tracestop' to 'stop' */
  1293. } else {
  1294. return -EINVAL;
  1295. }
  1296. return 0;
  1297. }
  1298. static int parse_sym_idx(char **inp, int *idx)
  1299. {
  1300. *idx = -1;
  1301. *inp += strspn(*inp, " ");
  1302. if (**inp != '#')
  1303. return 0;
  1304. *inp += 1;
  1305. if (**inp == 'g' || **inp == 'G') {
  1306. *inp += 1;
  1307. *idx = 0;
  1308. } else {
  1309. unsigned long num;
  1310. char *endptr;
  1311. errno = 0;
  1312. num = strtoul(*inp, &endptr, 0);
  1313. if (errno)
  1314. return -errno;
  1315. if (endptr == *inp || num > INT_MAX)
  1316. return -EINVAL;
  1317. *inp = endptr;
  1318. *idx = num;
  1319. }
  1320. return 0;
  1321. }
  1322. static int parse_addr_size(char **inp, u64 *num, const char **str, int *idx)
  1323. {
  1324. int err = parse_num_or_str(inp, num, str, " ");
  1325. if (!err && *str)
  1326. err = parse_sym_idx(inp, idx);
  1327. return err;
  1328. }
  1329. static int parse_one_filter(struct addr_filter *filt, const char **filter_inp)
  1330. {
  1331. char *fstr;
  1332. int err;
  1333. filt->str = fstr = strdup(*filter_inp);
  1334. if (!fstr)
  1335. return -ENOMEM;
  1336. err = parse_num_or_str(&fstr, NULL, &filt->action, " ");
  1337. if (err)
  1338. goto out_err;
  1339. err = parse_action(filt);
  1340. if (err)
  1341. goto out_err;
  1342. err = parse_addr_size(&fstr, &filt->addr, &filt->sym_from,
  1343. &filt->sym_from_idx);
  1344. if (err)
  1345. goto out_err;
  1346. fstr += strspn(fstr, " ");
  1347. if (*fstr == '/') {
  1348. fstr += 1;
  1349. err = parse_addr_size(&fstr, &filt->size, &filt->sym_to,
  1350. &filt->sym_to_idx);
  1351. if (err)
  1352. goto out_err;
  1353. filt->range = true;
  1354. }
  1355. fstr += strspn(fstr, " ");
  1356. if (*fstr == '@') {
  1357. fstr += 1;
  1358. err = parse_num_or_str(&fstr, NULL, &filt->filename, " ,");
  1359. if (err)
  1360. goto out_err;
  1361. }
  1362. fstr += strspn(fstr, " ,");
  1363. *filter_inp += fstr - filt->str;
  1364. return 0;
  1365. out_err:
  1366. addr_filter__free_str(filt);
  1367. return err;
  1368. }
  1369. int addr_filters__parse_bare_filter(struct addr_filters *filts,
  1370. const char *filter)
  1371. {
  1372. struct addr_filter *filt;
  1373. const char *fstr = filter;
  1374. int err;
  1375. while (*fstr) {
  1376. filt = addr_filter__new();
  1377. err = parse_one_filter(filt, &fstr);
  1378. if (err) {
  1379. addr_filter__free(filt);
  1380. addr_filters__exit(filts);
  1381. return err;
  1382. }
  1383. addr_filters__add(filts, filt);
  1384. }
  1385. return 0;
  1386. }
  1387. struct sym_args {
  1388. const char *name;
  1389. u64 start;
  1390. u64 size;
  1391. int idx;
  1392. int cnt;
  1393. bool started;
  1394. bool global;
  1395. bool selected;
  1396. bool duplicate;
  1397. bool near;
  1398. };
  1399. static bool kern_sym_match(struct sym_args *args, const char *name, char type)
  1400. {
  1401. /* A function with the same name, and global or the n'th found or any */
  1402. return kallsyms__is_function(type) &&
  1403. !strcmp(name, args->name) &&
  1404. ((args->global && isupper(type)) ||
  1405. (args->selected && ++(args->cnt) == args->idx) ||
  1406. (!args->global && !args->selected));
  1407. }
  1408. static int find_kern_sym_cb(void *arg, const char *name, char type, u64 start)
  1409. {
  1410. struct sym_args *args = arg;
  1411. if (args->started) {
  1412. if (!args->size)
  1413. args->size = start - args->start;
  1414. if (args->selected) {
  1415. if (args->size)
  1416. return 1;
  1417. } else if (kern_sym_match(args, name, type)) {
  1418. args->duplicate = true;
  1419. return 1;
  1420. }
  1421. } else if (kern_sym_match(args, name, type)) {
  1422. args->started = true;
  1423. args->start = start;
  1424. }
  1425. return 0;
  1426. }
  1427. static int print_kern_sym_cb(void *arg, const char *name, char type, u64 start)
  1428. {
  1429. struct sym_args *args = arg;
  1430. if (kern_sym_match(args, name, type)) {
  1431. pr_err("#%d\t0x%"PRIx64"\t%c\t%s\n",
  1432. ++args->cnt, start, type, name);
  1433. args->near = true;
  1434. } else if (args->near) {
  1435. args->near = false;
  1436. pr_err("\t\twhich is near\t\t%s\n", name);
  1437. }
  1438. return 0;
  1439. }
  1440. static int sym_not_found_error(const char *sym_name, int idx)
  1441. {
  1442. if (idx > 0) {
  1443. pr_err("N'th occurrence (N=%d) of symbol '%s' not found.\n",
  1444. idx, sym_name);
  1445. } else if (!idx) {
  1446. pr_err("Global symbol '%s' not found.\n", sym_name);
  1447. } else {
  1448. pr_err("Symbol '%s' not found.\n", sym_name);
  1449. }
  1450. pr_err("Note that symbols must be functions.\n");
  1451. return -EINVAL;
  1452. }
  1453. static int find_kern_sym(const char *sym_name, u64 *start, u64 *size, int idx)
  1454. {
  1455. struct sym_args args = {
  1456. .name = sym_name,
  1457. .idx = idx,
  1458. .global = !idx,
  1459. .selected = idx > 0,
  1460. };
  1461. int err;
  1462. *start = 0;
  1463. *size = 0;
  1464. err = kallsyms__parse("/proc/kallsyms", &args, find_kern_sym_cb);
  1465. if (err < 0) {
  1466. pr_err("Failed to parse /proc/kallsyms\n");
  1467. return err;
  1468. }
  1469. if (args.duplicate) {
  1470. pr_err("Multiple kernel symbols with name '%s'\n", sym_name);
  1471. args.cnt = 0;
  1472. kallsyms__parse("/proc/kallsyms", &args, print_kern_sym_cb);
  1473. pr_err("Disambiguate symbol name by inserting #n after the name e.g. %s #2\n",
  1474. sym_name);
  1475. pr_err("Or select a global symbol by inserting #0 or #g or #G\n");
  1476. return -EINVAL;
  1477. }
  1478. if (!args.started) {
  1479. pr_err("Kernel symbol lookup: ");
  1480. return sym_not_found_error(sym_name, idx);
  1481. }
  1482. *start = args.start;
  1483. *size = args.size;
  1484. return 0;
  1485. }
  1486. static int find_entire_kern_cb(void *arg, const char *name __maybe_unused,
  1487. char type, u64 start)
  1488. {
  1489. struct sym_args *args = arg;
  1490. if (!kallsyms__is_function(type))
  1491. return 0;
  1492. if (!args->started) {
  1493. args->started = true;
  1494. args->start = start;
  1495. }
  1496. /* Don't know exactly where the kernel ends, so we add a page */
  1497. args->size = round_up(start, page_size) + page_size - args->start;
  1498. return 0;
  1499. }
  1500. static int addr_filter__entire_kernel(struct addr_filter *filt)
  1501. {
  1502. struct sym_args args = { .started = false };
  1503. int err;
  1504. err = kallsyms__parse("/proc/kallsyms", &args, find_entire_kern_cb);
  1505. if (err < 0 || !args.started) {
  1506. pr_err("Failed to parse /proc/kallsyms\n");
  1507. return err;
  1508. }
  1509. filt->addr = args.start;
  1510. filt->size = args.size;
  1511. return 0;
  1512. }
  1513. static int check_end_after_start(struct addr_filter *filt, u64 start, u64 size)
  1514. {
  1515. if (start + size >= filt->addr)
  1516. return 0;
  1517. if (filt->sym_from) {
  1518. pr_err("Symbol '%s' (0x%"PRIx64") comes before '%s' (0x%"PRIx64")\n",
  1519. filt->sym_to, start, filt->sym_from, filt->addr);
  1520. } else {
  1521. pr_err("Symbol '%s' (0x%"PRIx64") comes before address 0x%"PRIx64")\n",
  1522. filt->sym_to, start, filt->addr);
  1523. }
  1524. return -EINVAL;
  1525. }
  1526. static int addr_filter__resolve_kernel_syms(struct addr_filter *filt)
  1527. {
  1528. bool no_size = false;
  1529. u64 start, size;
  1530. int err;
  1531. if (symbol_conf.kptr_restrict) {
  1532. pr_err("Kernel addresses are restricted. Unable to resolve kernel symbols.\n");
  1533. return -EINVAL;
  1534. }
  1535. if (filt->sym_from && !strcmp(filt->sym_from, "*"))
  1536. return addr_filter__entire_kernel(filt);
  1537. if (filt->sym_from) {
  1538. err = find_kern_sym(filt->sym_from, &start, &size,
  1539. filt->sym_from_idx);
  1540. if (err)
  1541. return err;
  1542. filt->addr = start;
  1543. if (filt->range && !filt->size && !filt->sym_to) {
  1544. filt->size = size;
  1545. no_size = !size;
  1546. }
  1547. }
  1548. if (filt->sym_to) {
  1549. err = find_kern_sym(filt->sym_to, &start, &size,
  1550. filt->sym_to_idx);
  1551. if (err)
  1552. return err;
  1553. err = check_end_after_start(filt, start, size);
  1554. if (err)
  1555. return err;
  1556. filt->size = start + size - filt->addr;
  1557. no_size = !size;
  1558. }
  1559. /* The very last symbol in kallsyms does not imply a particular size */
  1560. if (no_size) {
  1561. pr_err("Cannot determine size of symbol '%s'\n",
  1562. filt->sym_to ? filt->sym_to : filt->sym_from);
  1563. return -EINVAL;
  1564. }
  1565. return 0;
  1566. }
  1567. static struct dso *load_dso(const char *name)
  1568. {
  1569. struct map *map;
  1570. struct dso *dso;
  1571. map = dso__new_map(name);
  1572. if (!map)
  1573. return NULL;
  1574. map__load(map);
  1575. dso = dso__get(map->dso);
  1576. map__put(map);
  1577. return dso;
  1578. }
  1579. static bool dso_sym_match(struct symbol *sym, const char *name, int *cnt,
  1580. int idx)
  1581. {
  1582. /* Same name, and global or the n'th found or any */
  1583. return !arch__compare_symbol_names(name, sym->name) &&
  1584. ((!idx && sym->binding == STB_GLOBAL) ||
  1585. (idx > 0 && ++*cnt == idx) ||
  1586. idx < 0);
  1587. }
  1588. static void print_duplicate_syms(struct dso *dso, const char *sym_name)
  1589. {
  1590. struct symbol *sym;
  1591. bool near = false;
  1592. int cnt = 0;
  1593. pr_err("Multiple symbols with name '%s'\n", sym_name);
  1594. sym = dso__first_symbol(dso);
  1595. while (sym) {
  1596. if (dso_sym_match(sym, sym_name, &cnt, -1)) {
  1597. pr_err("#%d\t0x%"PRIx64"\t%c\t%s\n",
  1598. ++cnt, sym->start,
  1599. sym->binding == STB_GLOBAL ? 'g' :
  1600. sym->binding == STB_LOCAL ? 'l' : 'w',
  1601. sym->name);
  1602. near = true;
  1603. } else if (near) {
  1604. near = false;
  1605. pr_err("\t\twhich is near\t\t%s\n", sym->name);
  1606. }
  1607. sym = dso__next_symbol(sym);
  1608. }
  1609. pr_err("Disambiguate symbol name by inserting #n after the name e.g. %s #2\n",
  1610. sym_name);
  1611. pr_err("Or select a global symbol by inserting #0 or #g or #G\n");
  1612. }
  1613. static int find_dso_sym(struct dso *dso, const char *sym_name, u64 *start,
  1614. u64 *size, int idx)
  1615. {
  1616. struct symbol *sym;
  1617. int cnt = 0;
  1618. *start = 0;
  1619. *size = 0;
  1620. sym = dso__first_symbol(dso);
  1621. while (sym) {
  1622. if (*start) {
  1623. if (!*size)
  1624. *size = sym->start - *start;
  1625. if (idx > 0) {
  1626. if (*size)
  1627. return 1;
  1628. } else if (dso_sym_match(sym, sym_name, &cnt, idx)) {
  1629. print_duplicate_syms(dso, sym_name);
  1630. return -EINVAL;
  1631. }
  1632. } else if (dso_sym_match(sym, sym_name, &cnt, idx)) {
  1633. *start = sym->start;
  1634. *size = sym->end - sym->start;
  1635. }
  1636. sym = dso__next_symbol(sym);
  1637. }
  1638. if (!*start)
  1639. return sym_not_found_error(sym_name, idx);
  1640. return 0;
  1641. }
  1642. static int addr_filter__entire_dso(struct addr_filter *filt, struct dso *dso)
  1643. {
  1644. struct symbol *first_sym = dso__first_symbol(dso);
  1645. struct symbol *last_sym = dso__last_symbol(dso);
  1646. if (!first_sym || !last_sym) {
  1647. pr_err("Failed to determine filter for %s\nNo symbols found.\n",
  1648. filt->filename);
  1649. return -EINVAL;
  1650. }
  1651. filt->addr = first_sym->start;
  1652. filt->size = last_sym->end - first_sym->start;
  1653. return 0;
  1654. }
  1655. static int addr_filter__resolve_syms(struct addr_filter *filt)
  1656. {
  1657. u64 start, size;
  1658. struct dso *dso;
  1659. int err = 0;
  1660. if (!filt->sym_from && !filt->sym_to)
  1661. return 0;
  1662. if (!filt->filename)
  1663. return addr_filter__resolve_kernel_syms(filt);
  1664. dso = load_dso(filt->filename);
  1665. if (!dso) {
  1666. pr_err("Failed to load symbols from: %s\n", filt->filename);
  1667. return -EINVAL;
  1668. }
  1669. if (filt->sym_from && !strcmp(filt->sym_from, "*")) {
  1670. err = addr_filter__entire_dso(filt, dso);
  1671. goto put_dso;
  1672. }
  1673. if (filt->sym_from) {
  1674. err = find_dso_sym(dso, filt->sym_from, &start, &size,
  1675. filt->sym_from_idx);
  1676. if (err)
  1677. goto put_dso;
  1678. filt->addr = start;
  1679. if (filt->range && !filt->size && !filt->sym_to)
  1680. filt->size = size;
  1681. }
  1682. if (filt->sym_to) {
  1683. err = find_dso_sym(dso, filt->sym_to, &start, &size,
  1684. filt->sym_to_idx);
  1685. if (err)
  1686. goto put_dso;
  1687. err = check_end_after_start(filt, start, size);
  1688. if (err)
  1689. return err;
  1690. filt->size = start + size - filt->addr;
  1691. }
  1692. put_dso:
  1693. dso__put(dso);
  1694. return err;
  1695. }
  1696. static char *addr_filter__to_str(struct addr_filter *filt)
  1697. {
  1698. char filename_buf[PATH_MAX];
  1699. const char *at = "";
  1700. const char *fn = "";
  1701. char *filter;
  1702. int err;
  1703. if (filt->filename) {
  1704. at = "@";
  1705. fn = realpath(filt->filename, filename_buf);
  1706. if (!fn)
  1707. return NULL;
  1708. }
  1709. if (filt->range) {
  1710. err = asprintf(&filter, "%s 0x%"PRIx64"/0x%"PRIx64"%s%s",
  1711. filt->action, filt->addr, filt->size, at, fn);
  1712. } else {
  1713. err = asprintf(&filter, "%s 0x%"PRIx64"%s%s",
  1714. filt->action, filt->addr, at, fn);
  1715. }
  1716. return err < 0 ? NULL : filter;
  1717. }
  1718. static int parse_addr_filter(struct perf_evsel *evsel, const char *filter,
  1719. int max_nr)
  1720. {
  1721. struct addr_filters filts;
  1722. struct addr_filter *filt;
  1723. int err;
  1724. addr_filters__init(&filts);
  1725. err = addr_filters__parse_bare_filter(&filts, filter);
  1726. if (err)
  1727. goto out_exit;
  1728. if (filts.cnt > max_nr) {
  1729. pr_err("Error: number of address filters (%d) exceeds maximum (%d)\n",
  1730. filts.cnt, max_nr);
  1731. err = -EINVAL;
  1732. goto out_exit;
  1733. }
  1734. list_for_each_entry(filt, &filts.head, list) {
  1735. char *new_filter;
  1736. err = addr_filter__resolve_syms(filt);
  1737. if (err)
  1738. goto out_exit;
  1739. new_filter = addr_filter__to_str(filt);
  1740. if (!new_filter) {
  1741. err = -ENOMEM;
  1742. goto out_exit;
  1743. }
  1744. if (perf_evsel__append_addr_filter(evsel, new_filter)) {
  1745. err = -ENOMEM;
  1746. goto out_exit;
  1747. }
  1748. }
  1749. out_exit:
  1750. addr_filters__exit(&filts);
  1751. if (err) {
  1752. pr_err("Failed to parse address filter: '%s'\n", filter);
  1753. pr_err("Filter format is: filter|start|stop|tracestop <start symbol or address> [/ <end symbol or size>] [@<file name>]\n");
  1754. pr_err("Where multiple filters are separated by space or comma.\n");
  1755. }
  1756. return err;
  1757. }
  1758. static struct perf_pmu *perf_evsel__find_pmu(struct perf_evsel *evsel)
  1759. {
  1760. struct perf_pmu *pmu = NULL;
  1761. while ((pmu = perf_pmu__scan(pmu)) != NULL) {
  1762. if (pmu->type == evsel->attr.type)
  1763. break;
  1764. }
  1765. return pmu;
  1766. }
  1767. static int perf_evsel__nr_addr_filter(struct perf_evsel *evsel)
  1768. {
  1769. struct perf_pmu *pmu = perf_evsel__find_pmu(evsel);
  1770. int nr_addr_filters = 0;
  1771. if (!pmu)
  1772. return 0;
  1773. perf_pmu__scan_file(pmu, "nr_addr_filters", "%d", &nr_addr_filters);
  1774. return nr_addr_filters;
  1775. }
  1776. int auxtrace_parse_filters(struct perf_evlist *evlist)
  1777. {
  1778. struct perf_evsel *evsel;
  1779. char *filter;
  1780. int err, max_nr;
  1781. evlist__for_each_entry(evlist, evsel) {
  1782. filter = evsel->filter;
  1783. max_nr = perf_evsel__nr_addr_filter(evsel);
  1784. if (!filter || !max_nr)
  1785. continue;
  1786. evsel->filter = NULL;
  1787. err = parse_addr_filter(evsel, filter, max_nr);
  1788. free(filter);
  1789. if (err)
  1790. return err;
  1791. pr_debug("Address filter: %s\n", evsel->filter);
  1792. }
  1793. return 0;
  1794. }