auxtrace.c 47 KB

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