trace.c 37 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684
  1. /*
  2. * ring buffer based function tracer
  3. *
  4. * Copyright (C) 2007-2008 Steven Rostedt <srostedt@redhat.com>
  5. * Copyright (C) 2008 Ingo Molnar <mingo@redhat.com>
  6. *
  7. * Originally taken from the RT patch by:
  8. * Arnaldo Carvalho de Melo <acme@redhat.com>
  9. *
  10. * Based on code from the latency_tracer, that is:
  11. * Copyright (C) 2004-2006 Ingo Molnar
  12. * Copyright (C) 2004 William Lee Irwin III
  13. */
  14. #include <linux/utsrelease.h>
  15. #include <linux/kallsyms.h>
  16. #include <linux/seq_file.h>
  17. #include <linux/debugfs.h>
  18. #include <linux/pagemap.h>
  19. #include <linux/hardirq.h>
  20. #include <linux/linkage.h>
  21. #include <linux/uaccess.h>
  22. #include <linux/ftrace.h>
  23. #include <linux/module.h>
  24. #include <linux/percpu.h>
  25. #include <linux/ctype.h>
  26. #include <linux/init.h>
  27. #include <linux/gfp.h>
  28. #include <linux/fs.h>
  29. #include "trace.h"
  30. unsigned long __read_mostly tracing_max_latency = (cycle_t)ULONG_MAX;
  31. unsigned long __read_mostly tracing_thresh;
  32. static long notrace
  33. ns2usecs(cycle_t nsec)
  34. {
  35. nsec += 500;
  36. do_div(nsec, 1000);
  37. return nsec;
  38. }
  39. static atomic_t tracer_counter;
  40. static struct trace_array global_trace;
  41. static DEFINE_PER_CPU(struct trace_array_cpu, global_trace_cpu);
  42. static struct trace_array max_tr;
  43. static DEFINE_PER_CPU(struct trace_array_cpu, max_data);
  44. static int tracer_enabled;
  45. static unsigned long trace_nr_entries = 16384UL;
  46. static struct tracer *trace_types __read_mostly;
  47. static struct tracer *current_trace __read_mostly;
  48. static int max_tracer_type_len;
  49. static DEFINE_MUTEX(trace_types_lock);
  50. #define ENTRIES_PER_PAGE (PAGE_SIZE / sizeof(struct trace_entry))
  51. static int __init set_nr_entries(char *str)
  52. {
  53. if (!str)
  54. return 0;
  55. trace_nr_entries = simple_strtoul(str, &str, 0);
  56. return 1;
  57. }
  58. __setup("trace_entries=", set_nr_entries);
  59. enum trace_type {
  60. __TRACE_FIRST_TYPE = 0,
  61. TRACE_FN,
  62. TRACE_CTX,
  63. __TRACE_LAST_TYPE
  64. };
  65. enum trace_flag_type {
  66. TRACE_FLAG_IRQS_OFF = 0x01,
  67. TRACE_FLAG_NEED_RESCHED = 0x02,
  68. TRACE_FLAG_HARDIRQ = 0x04,
  69. TRACE_FLAG_SOFTIRQ = 0x08,
  70. };
  71. enum trace_iterator_flags {
  72. TRACE_ITER_PRINT_PARENT = 0x01,
  73. TRACE_ITER_SYM_OFFSET = 0x02,
  74. TRACE_ITER_SYM_ADDR = 0x04,
  75. TRACE_ITER_VERBOSE = 0x08,
  76. };
  77. #define TRACE_ITER_SYM_MASK \
  78. (TRACE_ITER_PRINT_PARENT|TRACE_ITER_SYM_OFFSET|TRACE_ITER_SYM_ADDR)
  79. /* These must match the bit postions above */
  80. static const char *trace_options[] = {
  81. "print-parent",
  82. "sym-offset",
  83. "sym-addr",
  84. "verbose",
  85. NULL
  86. };
  87. static unsigned trace_flags;
  88. static DEFINE_SPINLOCK(ftrace_max_lock);
  89. /*
  90. * Copy the new maximum trace into the separate maximum-trace
  91. * structure. (this way the maximum trace is permanently saved,
  92. * for later retrieval via /debugfs/tracing/latency_trace)
  93. */
  94. static void notrace
  95. __update_max_tr(struct trace_array *tr, struct task_struct *tsk, int cpu)
  96. {
  97. struct trace_array_cpu *data = tr->data[cpu];
  98. max_tr.cpu = cpu;
  99. max_tr.time_start = data->preempt_timestamp;
  100. data = max_tr.data[cpu];
  101. data->saved_latency = tracing_max_latency;
  102. memcpy(data->comm, tsk->comm, TASK_COMM_LEN);
  103. data->pid = tsk->pid;
  104. data->uid = tsk->uid;
  105. data->nice = tsk->static_prio - 20 - MAX_RT_PRIO;
  106. data->policy = tsk->policy;
  107. data->rt_priority = tsk->rt_priority;
  108. /* record this tasks comm */
  109. tracing_record_cmdline(current);
  110. }
  111. notrace void
  112. update_max_tr(struct trace_array *tr, struct task_struct *tsk, int cpu)
  113. {
  114. struct trace_array_cpu *data;
  115. void *save_trace;
  116. struct list_head save_pages;
  117. int i;
  118. WARN_ON_ONCE(!irqs_disabled());
  119. spin_lock(&ftrace_max_lock);
  120. /* clear out all the previous traces */
  121. for_each_possible_cpu(i) {
  122. data = tr->data[i];
  123. save_trace = max_tr.data[i]->trace;
  124. save_pages = max_tr.data[i]->trace_pages;
  125. memcpy(max_tr.data[i], data, sizeof(*data));
  126. data->trace = save_trace;
  127. data->trace_pages = save_pages;
  128. tracing_reset(data);
  129. }
  130. __update_max_tr(tr, tsk, cpu);
  131. spin_unlock(&ftrace_max_lock);
  132. }
  133. /**
  134. * update_max_tr_single - only copy one trace over, and reset the rest
  135. * @tr - tracer
  136. * @tsk - task with the latency
  137. * @cpu - the cpu of the buffer to copy.
  138. */
  139. notrace void
  140. update_max_tr_single(struct trace_array *tr, struct task_struct *tsk, int cpu)
  141. {
  142. struct trace_array_cpu *data = tr->data[cpu];
  143. void *save_trace;
  144. struct list_head save_pages;
  145. int i;
  146. WARN_ON_ONCE(!irqs_disabled());
  147. spin_lock(&ftrace_max_lock);
  148. for_each_possible_cpu(i)
  149. tracing_reset(max_tr.data[i]);
  150. save_trace = max_tr.data[cpu]->trace;
  151. save_pages = max_tr.data[cpu]->trace_pages;
  152. memcpy(max_tr.data[cpu], data, sizeof(*data));
  153. data->trace = save_trace;
  154. data->trace_pages = save_pages;
  155. tracing_reset(data);
  156. __update_max_tr(tr, tsk, cpu);
  157. spin_unlock(&ftrace_max_lock);
  158. }
  159. int register_tracer(struct tracer *type)
  160. {
  161. struct tracer *t;
  162. int len;
  163. int ret = 0;
  164. if (!type->name) {
  165. pr_info("Tracer must have a name\n");
  166. return -1;
  167. }
  168. mutex_lock(&trace_types_lock);
  169. for (t = trace_types; t; t = t->next) {
  170. if (strcmp(type->name, t->name) == 0) {
  171. /* already found */
  172. pr_info("Trace %s already registered\n",
  173. type->name);
  174. ret = -1;
  175. goto out;
  176. }
  177. }
  178. type->next = trace_types;
  179. trace_types = type;
  180. len = strlen(type->name);
  181. if (len > max_tracer_type_len)
  182. max_tracer_type_len = len;
  183. out:
  184. mutex_unlock(&trace_types_lock);
  185. return ret;
  186. }
  187. void unregister_tracer(struct tracer *type)
  188. {
  189. struct tracer **t;
  190. int len;
  191. mutex_lock(&trace_types_lock);
  192. for (t = &trace_types; *t; t = &(*t)->next) {
  193. if (*t == type)
  194. goto found;
  195. }
  196. pr_info("Trace %s not registered\n", type->name);
  197. goto out;
  198. found:
  199. *t = (*t)->next;
  200. if (strlen(type->name) != max_tracer_type_len)
  201. goto out;
  202. max_tracer_type_len = 0;
  203. for (t = &trace_types; *t; t = &(*t)->next) {
  204. len = strlen((*t)->name);
  205. if (len > max_tracer_type_len)
  206. max_tracer_type_len = len;
  207. }
  208. out:
  209. mutex_unlock(&trace_types_lock);
  210. }
  211. void notrace tracing_reset(struct trace_array_cpu *data)
  212. {
  213. data->trace_idx = 0;
  214. data->trace_current = data->trace;
  215. data->trace_current_idx = 0;
  216. }
  217. #ifdef CONFIG_FTRACE
  218. static void notrace
  219. function_trace_call(unsigned long ip, unsigned long parent_ip)
  220. {
  221. struct trace_array *tr = &global_trace;
  222. struct trace_array_cpu *data;
  223. unsigned long flags;
  224. long disabled;
  225. int cpu;
  226. if (unlikely(!tracer_enabled))
  227. return;
  228. local_irq_save(flags);
  229. cpu = raw_smp_processor_id();
  230. data = tr->data[cpu];
  231. disabled = atomic_inc_return(&data->disabled);
  232. if (likely(disabled == 1))
  233. ftrace(tr, data, ip, parent_ip, flags);
  234. atomic_dec(&data->disabled);
  235. local_irq_restore(flags);
  236. }
  237. static struct ftrace_ops trace_ops __read_mostly =
  238. {
  239. .func = function_trace_call,
  240. };
  241. #endif
  242. notrace void tracing_start_function_trace(void)
  243. {
  244. register_ftrace_function(&trace_ops);
  245. }
  246. notrace void tracing_stop_function_trace(void)
  247. {
  248. unregister_ftrace_function(&trace_ops);
  249. }
  250. #define SAVED_CMDLINES 128
  251. static unsigned map_pid_to_cmdline[PID_MAX_DEFAULT+1];
  252. static unsigned map_cmdline_to_pid[SAVED_CMDLINES];
  253. static char saved_cmdlines[SAVED_CMDLINES][TASK_COMM_LEN];
  254. static int cmdline_idx;
  255. static DEFINE_SPINLOCK(trace_cmdline_lock);
  256. atomic_t trace_record_cmdline_disabled;
  257. static void trace_init_cmdlines(void)
  258. {
  259. memset(&map_pid_to_cmdline, -1, sizeof(map_pid_to_cmdline));
  260. memset(&map_cmdline_to_pid, -1, sizeof(map_cmdline_to_pid));
  261. cmdline_idx = 0;
  262. }
  263. notrace void trace_stop_cmdline_recording(void);
  264. static void notrace trace_save_cmdline(struct task_struct *tsk)
  265. {
  266. unsigned map;
  267. unsigned idx;
  268. if (!tsk->pid || unlikely(tsk->pid > PID_MAX_DEFAULT))
  269. return;
  270. /*
  271. * It's not the end of the world if we don't get
  272. * the lock, but we also don't want to spin
  273. * nor do we want to disable interrupts,
  274. * so if we miss here, then better luck next time.
  275. */
  276. if (!spin_trylock(&trace_cmdline_lock))
  277. return;
  278. idx = map_pid_to_cmdline[tsk->pid];
  279. if (idx >= SAVED_CMDLINES) {
  280. idx = (cmdline_idx + 1) % SAVED_CMDLINES;
  281. map = map_cmdline_to_pid[idx];
  282. if (map <= PID_MAX_DEFAULT)
  283. map_pid_to_cmdline[map] = (unsigned)-1;
  284. map_pid_to_cmdline[tsk->pid] = idx;
  285. cmdline_idx = idx;
  286. }
  287. memcpy(&saved_cmdlines[idx], tsk->comm, TASK_COMM_LEN);
  288. spin_unlock(&trace_cmdline_lock);
  289. }
  290. static notrace char *trace_find_cmdline(int pid)
  291. {
  292. char *cmdline = "<...>";
  293. unsigned map;
  294. if (!pid)
  295. return "<idle>";
  296. if (pid > PID_MAX_DEFAULT)
  297. goto out;
  298. map = map_pid_to_cmdline[pid];
  299. if (map >= SAVED_CMDLINES)
  300. goto out;
  301. cmdline = saved_cmdlines[map];
  302. out:
  303. return cmdline;
  304. }
  305. notrace void tracing_record_cmdline(struct task_struct *tsk)
  306. {
  307. if (atomic_read(&trace_record_cmdline_disabled))
  308. return;
  309. trace_save_cmdline(tsk);
  310. }
  311. static inline notrace struct trace_entry *
  312. tracing_get_trace_entry(struct trace_array *tr,
  313. struct trace_array_cpu *data)
  314. {
  315. unsigned long idx, idx_next;
  316. struct trace_entry *entry;
  317. struct page *page;
  318. struct list_head *next;
  319. data->trace_idx++;
  320. idx = data->trace_current_idx;
  321. idx_next = idx + 1;
  322. entry = data->trace_current + idx * TRACE_ENTRY_SIZE;
  323. if (unlikely(idx_next >= ENTRIES_PER_PAGE)) {
  324. page = virt_to_page(data->trace_current);
  325. if (unlikely(&page->lru == data->trace_pages.prev))
  326. next = data->trace_pages.next;
  327. else
  328. next = page->lru.next;
  329. page = list_entry(next, struct page, lru);
  330. data->trace_current = page_address(page);
  331. idx_next = 0;
  332. }
  333. data->trace_current_idx = idx_next;
  334. return entry;
  335. }
  336. static inline notrace void
  337. tracing_generic_entry_update(struct trace_entry *entry,
  338. unsigned long flags)
  339. {
  340. struct task_struct *tsk = current;
  341. unsigned long pc;
  342. pc = preempt_count();
  343. entry->idx = atomic_inc_return(&tracer_counter);
  344. entry->preempt_count = pc & 0xff;
  345. entry->pid = tsk->pid;
  346. entry->t = now(raw_smp_processor_id());
  347. entry->flags = (irqs_disabled_flags(flags) ? TRACE_FLAG_IRQS_OFF : 0) |
  348. ((pc & HARDIRQ_MASK) ? TRACE_FLAG_HARDIRQ : 0) |
  349. ((pc & SOFTIRQ_MASK) ? TRACE_FLAG_SOFTIRQ : 0) |
  350. (need_resched() ? TRACE_FLAG_NEED_RESCHED : 0);
  351. }
  352. notrace void
  353. ftrace(struct trace_array *tr, struct trace_array_cpu *data,
  354. unsigned long ip, unsigned long parent_ip,
  355. unsigned long flags)
  356. {
  357. struct trace_entry *entry;
  358. entry = tracing_get_trace_entry(tr, data);
  359. tracing_generic_entry_update(entry, flags);
  360. entry->type = TRACE_FN;
  361. entry->fn.ip = ip;
  362. entry->fn.parent_ip = parent_ip;
  363. }
  364. notrace void
  365. tracing_sched_switch_trace(struct trace_array *tr,
  366. struct trace_array_cpu *data,
  367. struct task_struct *prev, struct task_struct *next,
  368. unsigned long flags)
  369. {
  370. struct trace_entry *entry;
  371. entry = tracing_get_trace_entry(tr, data);
  372. tracing_generic_entry_update(entry, flags);
  373. entry->type = TRACE_CTX;
  374. entry->ctx.prev_pid = prev->pid;
  375. entry->ctx.prev_prio = prev->prio;
  376. entry->ctx.prev_state = prev->state;
  377. entry->ctx.next_pid = next->pid;
  378. entry->ctx.next_prio = next->prio;
  379. }
  380. enum trace_file_type {
  381. TRACE_FILE_LAT_FMT = 1,
  382. };
  383. static struct trace_entry *
  384. trace_entry_idx(struct trace_array *tr, struct trace_array_cpu *data,
  385. struct trace_iterator *iter, int cpu)
  386. {
  387. struct page *page;
  388. struct trace_entry *array;
  389. if (iter->next_idx[cpu] >= tr->entries ||
  390. iter->next_idx[cpu] >= data->trace_idx)
  391. return NULL;
  392. if (!iter->next_page[cpu]) {
  393. /*
  394. * Initialize. If the count of elements in
  395. * this buffer is greater than the max entries
  396. * we had an underrun. Which means we looped around.
  397. * We can simply use the current pointer as our
  398. * starting point.
  399. */
  400. if (data->trace_idx >= tr->entries) {
  401. page = virt_to_page(data->trace_current);
  402. iter->next_page[cpu] = &page->lru;
  403. iter->next_page_idx[cpu] = data->trace_current_idx;
  404. } else {
  405. iter->next_page[cpu] = data->trace_pages.next;
  406. iter->next_page_idx[cpu] = 0;
  407. }
  408. }
  409. page = list_entry(iter->next_page[cpu], struct page, lru);
  410. array = page_address(page);
  411. return &array[iter->next_page_idx[cpu]];
  412. }
  413. static struct notrace trace_entry *
  414. find_next_entry(struct trace_iterator *iter, int *ent_cpu)
  415. {
  416. struct trace_array *tr = iter->tr;
  417. struct trace_entry *ent, *next = NULL;
  418. int next_cpu = -1;
  419. int cpu;
  420. for_each_possible_cpu(cpu) {
  421. if (!tr->data[cpu]->trace)
  422. continue;
  423. ent = trace_entry_idx(tr, tr->data[cpu], iter, cpu);
  424. if (ent &&
  425. (!next || (long)(next->idx - ent->idx) > 0)) {
  426. next = ent;
  427. next_cpu = cpu;
  428. }
  429. }
  430. if (ent_cpu)
  431. *ent_cpu = next_cpu;
  432. return next;
  433. }
  434. static void *find_next_entry_inc(struct trace_iterator *iter)
  435. {
  436. struct trace_entry *next;
  437. int next_cpu = -1;
  438. next = find_next_entry(iter, &next_cpu);
  439. if (next) {
  440. iter->idx++;
  441. iter->next_idx[next_cpu]++;
  442. iter->next_page_idx[next_cpu]++;
  443. if (iter->next_page_idx[next_cpu] >= ENTRIES_PER_PAGE) {
  444. struct trace_array_cpu *data = iter->tr->data[next_cpu];
  445. iter->next_page_idx[next_cpu] = 0;
  446. iter->next_page[next_cpu] =
  447. iter->next_page[next_cpu]->next;
  448. if (iter->next_page[next_cpu] == &data->trace_pages)
  449. iter->next_page[next_cpu] =
  450. data->trace_pages.next;
  451. }
  452. }
  453. iter->ent = next;
  454. iter->cpu = next_cpu;
  455. return next ? iter : NULL;
  456. }
  457. static void notrace *
  458. s_next(struct seq_file *m, void *v, loff_t *pos)
  459. {
  460. struct trace_iterator *iter = m->private;
  461. void *ent;
  462. void *last_ent = iter->ent;
  463. int i = (int)*pos;
  464. (*pos)++;
  465. /* can't go backwards */
  466. if (iter->idx > i)
  467. return NULL;
  468. if (iter->idx < 0)
  469. ent = find_next_entry_inc(iter);
  470. else
  471. ent = iter;
  472. while (ent && iter->idx < i)
  473. ent = find_next_entry_inc(iter);
  474. iter->pos = *pos;
  475. if (last_ent && !ent)
  476. seq_puts(m, "\n\nvim:ft=help\n");
  477. return ent;
  478. }
  479. static void *s_start(struct seq_file *m, loff_t *pos)
  480. {
  481. struct trace_iterator *iter = m->private;
  482. void *p = NULL;
  483. loff_t l = 0;
  484. int i;
  485. mutex_lock(&trace_types_lock);
  486. if (!current_trace || current_trace != iter->trace)
  487. return NULL;
  488. atomic_inc(&trace_record_cmdline_disabled);
  489. /* let the tracer grab locks here if needed */
  490. if (current_trace->start)
  491. current_trace->start(iter);
  492. if (*pos != iter->pos) {
  493. iter->ent = NULL;
  494. iter->cpu = 0;
  495. iter->idx = -1;
  496. for_each_possible_cpu(i) {
  497. iter->next_idx[i] = 0;
  498. iter->next_page[i] = NULL;
  499. }
  500. for (p = iter; p && l < *pos; p = s_next(m, p, &l))
  501. ;
  502. } else {
  503. l = *pos - 1;
  504. p = s_next(m, p, &l);
  505. }
  506. return p;
  507. }
  508. static void s_stop(struct seq_file *m, void *p)
  509. {
  510. struct trace_iterator *iter = m->private;
  511. atomic_dec(&trace_record_cmdline_disabled);
  512. /* let the tracer release locks here if needed */
  513. if (current_trace && current_trace == iter->trace && iter->trace->stop)
  514. iter->trace->stop(iter);
  515. mutex_unlock(&trace_types_lock);
  516. }
  517. static void
  518. seq_print_sym_short(struct seq_file *m, const char *fmt, unsigned long address)
  519. {
  520. #ifdef CONFIG_KALLSYMS
  521. char str[KSYM_SYMBOL_LEN];
  522. kallsyms_lookup(address, NULL, NULL, NULL, str);
  523. seq_printf(m, fmt, str);
  524. #endif
  525. }
  526. static void
  527. seq_print_sym_offset(struct seq_file *m, const char *fmt, unsigned long address)
  528. {
  529. #ifdef CONFIG_KALLSYMS
  530. char str[KSYM_SYMBOL_LEN];
  531. sprint_symbol(str, address);
  532. seq_printf(m, fmt, str);
  533. #endif
  534. }
  535. #ifndef CONFIG_64BIT
  536. # define IP_FMT "%08lx"
  537. #else
  538. # define IP_FMT "%016lx"
  539. #endif
  540. static void notrace
  541. seq_print_ip_sym(struct seq_file *m, unsigned long ip, unsigned long sym_flags)
  542. {
  543. if (!ip) {
  544. seq_printf(m, "0");
  545. return;
  546. }
  547. if (sym_flags & TRACE_ITER_SYM_OFFSET)
  548. seq_print_sym_offset(m, "%s", ip);
  549. else
  550. seq_print_sym_short(m, "%s", ip);
  551. if (sym_flags & TRACE_ITER_SYM_ADDR)
  552. seq_printf(m, " <" IP_FMT ">", ip);
  553. }
  554. static void notrace print_lat_help_header(struct seq_file *m)
  555. {
  556. seq_puts(m, "# _------=> CPU# \n");
  557. seq_puts(m, "# / _-----=> irqs-off \n");
  558. seq_puts(m, "# | / _----=> need-resched \n");
  559. seq_puts(m, "# || / _---=> hardirq/softirq \n");
  560. seq_puts(m, "# ||| / _--=> preempt-depth \n");
  561. seq_puts(m, "# |||| / \n");
  562. seq_puts(m, "# ||||| delay \n");
  563. seq_puts(m, "# cmd pid ||||| time | caller \n");
  564. seq_puts(m, "# \\ / ||||| \\ | / \n");
  565. }
  566. static void notrace print_func_help_header(struct seq_file *m)
  567. {
  568. seq_puts(m, "# TASK-PID CPU# TIMESTAMP FUNCTION\n");
  569. seq_puts(m, "# | | | | |\n");
  570. }
  571. static void notrace
  572. print_trace_header(struct seq_file *m, struct trace_iterator *iter)
  573. {
  574. unsigned long sym_flags = (trace_flags & TRACE_ITER_SYM_MASK);
  575. struct trace_array *tr = iter->tr;
  576. struct trace_array_cpu *data = tr->data[tr->cpu];
  577. struct tracer *type = current_trace;
  578. unsigned long total = 0;
  579. unsigned long entries = 0;
  580. int cpu;
  581. const char *name = "preemption";
  582. if (type)
  583. name = type->name;
  584. for_each_possible_cpu(cpu) {
  585. if (tr->data[cpu]->trace) {
  586. total += tr->data[cpu]->trace_idx;
  587. if (tr->data[cpu]->trace_idx > tr->entries)
  588. entries += tr->entries;
  589. else
  590. entries += tr->data[cpu]->trace_idx;
  591. }
  592. }
  593. seq_printf(m, "%s latency trace v1.1.5 on %s\n",
  594. name, UTS_RELEASE);
  595. seq_puts(m, "-----------------------------------"
  596. "---------------------------------\n");
  597. seq_printf(m, " latency: %lu us, #%lu/%lu, CPU#%d |"
  598. " (M:%s VP:%d, KP:%d, SP:%d HP:%d",
  599. data->saved_latency,
  600. entries,
  601. total,
  602. tr->cpu,
  603. #if defined(CONFIG_PREEMPT_NONE)
  604. "server",
  605. #elif defined(CONFIG_PREEMPT_VOLUNTARY)
  606. "desktop",
  607. #elif defined(CONFIG_PREEMPT_DESKTOP)
  608. "preempt",
  609. #else
  610. "unknown",
  611. #endif
  612. /* These are reserved for later use */
  613. 0, 0, 0, 0);
  614. #ifdef CONFIG_SMP
  615. seq_printf(m, " #P:%d)\n", num_online_cpus());
  616. #else
  617. seq_puts(m, ")\n");
  618. #endif
  619. seq_puts(m, " -----------------\n");
  620. seq_printf(m, " | task: %.16s-%d "
  621. "(uid:%d nice:%ld policy:%ld rt_prio:%ld)\n",
  622. data->comm, data->pid, data->uid, data->nice,
  623. data->policy, data->rt_priority);
  624. seq_puts(m, " -----------------\n");
  625. if (data->critical_start) {
  626. seq_puts(m, " => started at: ");
  627. seq_print_ip_sym(m, data->critical_start, sym_flags);
  628. seq_puts(m, "\n => ended at: ");
  629. seq_print_ip_sym(m, data->critical_end, sym_flags);
  630. seq_puts(m, "\n");
  631. }
  632. seq_puts(m, "\n");
  633. }
  634. unsigned long nsecs_to_usecs(unsigned long nsecs)
  635. {
  636. return nsecs / 1000;
  637. }
  638. static void notrace
  639. lat_print_generic(struct seq_file *m, struct trace_entry *entry, int cpu)
  640. {
  641. int hardirq, softirq;
  642. char *comm;
  643. comm = trace_find_cmdline(entry->pid);
  644. seq_printf(m, "%8.8s-%-5d ", comm, entry->pid);
  645. seq_printf(m, "%d", cpu);
  646. seq_printf(m, "%c%c",
  647. (entry->flags & TRACE_FLAG_IRQS_OFF) ? 'd' : '.',
  648. ((entry->flags & TRACE_FLAG_NEED_RESCHED) ? 'N' : '.'));
  649. hardirq = entry->flags & TRACE_FLAG_HARDIRQ;
  650. softirq = entry->flags & TRACE_FLAG_SOFTIRQ;
  651. if (hardirq && softirq)
  652. seq_putc(m, 'H');
  653. else {
  654. if (hardirq)
  655. seq_putc(m, 'h');
  656. else {
  657. if (softirq)
  658. seq_putc(m, 's');
  659. else
  660. seq_putc(m, '.');
  661. }
  662. }
  663. if (entry->preempt_count)
  664. seq_printf(m, "%x", entry->preempt_count);
  665. else
  666. seq_puts(m, ".");
  667. }
  668. unsigned long preempt_mark_thresh = 100;
  669. static void notrace
  670. lat_print_timestamp(struct seq_file *m, unsigned long long abs_usecs,
  671. unsigned long rel_usecs)
  672. {
  673. seq_printf(m, " %4lldus", abs_usecs);
  674. if (rel_usecs > preempt_mark_thresh)
  675. seq_puts(m, "!: ");
  676. else if (rel_usecs > 1)
  677. seq_puts(m, "+: ");
  678. else
  679. seq_puts(m, " : ");
  680. }
  681. static const char state_to_char[] = TASK_STATE_TO_CHAR_STR;
  682. static void notrace
  683. print_lat_fmt(struct seq_file *m, struct trace_iterator *iter,
  684. unsigned int trace_idx, int cpu)
  685. {
  686. unsigned long sym_flags = (trace_flags & TRACE_ITER_SYM_MASK);
  687. struct trace_entry *next_entry = find_next_entry(iter, NULL);
  688. unsigned long verbose = (trace_flags & TRACE_ITER_VERBOSE);
  689. struct trace_entry *entry = iter->ent;
  690. unsigned long abs_usecs;
  691. unsigned long rel_usecs;
  692. char *comm;
  693. int S;
  694. if (!next_entry)
  695. next_entry = entry;
  696. rel_usecs = ns2usecs(next_entry->t - entry->t);
  697. abs_usecs = ns2usecs(entry->t - iter->tr->time_start);
  698. if (verbose) {
  699. comm = trace_find_cmdline(entry->pid);
  700. seq_printf(m, "%16s %5d %d %d %08x %08x [%08lx]"
  701. " %ld.%03ldms (+%ld.%03ldms): ",
  702. comm,
  703. entry->pid, cpu, entry->flags,
  704. entry->preempt_count, trace_idx,
  705. ns2usecs(entry->t),
  706. abs_usecs/1000,
  707. abs_usecs % 1000, rel_usecs/1000, rel_usecs % 1000);
  708. } else {
  709. lat_print_generic(m, entry, cpu);
  710. lat_print_timestamp(m, abs_usecs, rel_usecs);
  711. }
  712. switch (entry->type) {
  713. case TRACE_FN:
  714. seq_print_ip_sym(m, entry->fn.ip, sym_flags);
  715. seq_puts(m, " (");
  716. seq_print_ip_sym(m, entry->fn.parent_ip, sym_flags);
  717. seq_puts(m, ")\n");
  718. break;
  719. case TRACE_CTX:
  720. S = entry->ctx.prev_state < sizeof(state_to_char) ?
  721. state_to_char[entry->ctx.prev_state] : 'X';
  722. comm = trace_find_cmdline(entry->ctx.next_pid);
  723. seq_printf(m, " %d:%d:%c --> %d:%d %s\n",
  724. entry->ctx.prev_pid,
  725. entry->ctx.prev_prio,
  726. S,
  727. entry->ctx.next_pid,
  728. entry->ctx.next_prio,
  729. comm);
  730. break;
  731. default:
  732. seq_printf(m, "Unknown type %d\n", entry->type);
  733. }
  734. }
  735. static void notrace
  736. print_trace_fmt(struct seq_file *m, struct trace_iterator *iter)
  737. {
  738. unsigned long sym_flags = (trace_flags & TRACE_ITER_SYM_MASK);
  739. struct trace_entry *entry = iter->ent;
  740. unsigned long usec_rem;
  741. unsigned long long t;
  742. unsigned long secs;
  743. char *comm;
  744. int S;
  745. comm = trace_find_cmdline(iter->ent->pid);
  746. t = ns2usecs(entry->t);
  747. usec_rem = do_div(t, 1000000ULL);
  748. secs = (unsigned long)t;
  749. seq_printf(m, "%16s-%-5d ", comm, entry->pid);
  750. seq_printf(m, "[%02d] ", iter->cpu);
  751. seq_printf(m, "%5lu.%06lu: ", secs, usec_rem);
  752. switch (entry->type) {
  753. case TRACE_FN:
  754. seq_print_ip_sym(m, entry->fn.ip, sym_flags);
  755. if ((sym_flags & TRACE_ITER_PRINT_PARENT) &&
  756. entry->fn.parent_ip) {
  757. seq_printf(m, " <-");
  758. seq_print_ip_sym(m, entry->fn.parent_ip, sym_flags);
  759. }
  760. break;
  761. case TRACE_CTX:
  762. S = entry->ctx.prev_state < sizeof(state_to_char) ?
  763. state_to_char[entry->ctx.prev_state] : 'X';
  764. seq_printf(m, " %d:%d:%c ==> %d:%d\n",
  765. entry->ctx.prev_pid,
  766. entry->ctx.prev_prio,
  767. S,
  768. entry->ctx.next_pid,
  769. entry->ctx.next_prio);
  770. break;
  771. }
  772. seq_printf(m, "\n");
  773. }
  774. static int trace_empty(struct trace_iterator *iter)
  775. {
  776. struct trace_array_cpu *data;
  777. int cpu;
  778. for_each_possible_cpu(cpu) {
  779. data = iter->tr->data[cpu];
  780. if (data->trace &&
  781. data->trace_idx)
  782. return 0;
  783. }
  784. return 1;
  785. }
  786. static int s_show(struct seq_file *m, void *v)
  787. {
  788. struct trace_iterator *iter = v;
  789. if (iter->ent == NULL) {
  790. if (iter->tr) {
  791. seq_printf(m, "# tracer: %s\n", iter->trace->name);
  792. seq_puts(m, "#\n");
  793. }
  794. if (iter->iter_flags & TRACE_FILE_LAT_FMT) {
  795. /* print nothing if the buffers are empty */
  796. if (trace_empty(iter))
  797. return 0;
  798. print_trace_header(m, iter);
  799. if (!(trace_flags & TRACE_ITER_VERBOSE))
  800. print_lat_help_header(m);
  801. } else {
  802. if (!(trace_flags & TRACE_ITER_VERBOSE))
  803. print_func_help_header(m);
  804. }
  805. } else {
  806. if (iter->iter_flags & TRACE_FILE_LAT_FMT)
  807. print_lat_fmt(m, iter, iter->idx, iter->cpu);
  808. else
  809. print_trace_fmt(m, iter);
  810. }
  811. return 0;
  812. }
  813. static struct seq_operations tracer_seq_ops = {
  814. .start = s_start,
  815. .next = s_next,
  816. .stop = s_stop,
  817. .show = s_show,
  818. };
  819. static struct trace_iterator notrace *
  820. __tracing_open(struct inode *inode, struct file *file, int *ret)
  821. {
  822. struct trace_iterator *iter;
  823. iter = kzalloc(sizeof(*iter), GFP_KERNEL);
  824. if (!iter) {
  825. *ret = -ENOMEM;
  826. goto out;
  827. }
  828. mutex_lock(&trace_types_lock);
  829. if (current_trace && current_trace->print_max)
  830. iter->tr = &max_tr;
  831. else
  832. iter->tr = inode->i_private;
  833. iter->trace = current_trace;
  834. iter->pos = -1;
  835. /* TODO stop tracer */
  836. *ret = seq_open(file, &tracer_seq_ops);
  837. if (!*ret) {
  838. struct seq_file *m = file->private_data;
  839. m->private = iter;
  840. /* stop the trace while dumping */
  841. if (iter->tr->ctrl)
  842. tracer_enabled = 0;
  843. if (iter->trace && iter->trace->open)
  844. iter->trace->open(iter);
  845. } else {
  846. kfree(iter);
  847. iter = NULL;
  848. }
  849. mutex_unlock(&trace_types_lock);
  850. out:
  851. return iter;
  852. }
  853. int tracing_open_generic(struct inode *inode, struct file *filp)
  854. {
  855. filp->private_data = inode->i_private;
  856. return 0;
  857. }
  858. int tracing_release(struct inode *inode, struct file *file)
  859. {
  860. struct seq_file *m = (struct seq_file *)file->private_data;
  861. struct trace_iterator *iter = m->private;
  862. mutex_lock(&trace_types_lock);
  863. if (iter->trace && iter->trace->close)
  864. iter->trace->close(iter);
  865. /* reenable tracing if it was previously enabled */
  866. if (iter->tr->ctrl)
  867. tracer_enabled = 1;
  868. mutex_unlock(&trace_types_lock);
  869. seq_release(inode, file);
  870. kfree(iter);
  871. return 0;
  872. }
  873. static int tracing_open(struct inode *inode, struct file *file)
  874. {
  875. int ret;
  876. __tracing_open(inode, file, &ret);
  877. return ret;
  878. }
  879. static int tracing_lt_open(struct inode *inode, struct file *file)
  880. {
  881. struct trace_iterator *iter;
  882. int ret;
  883. iter = __tracing_open(inode, file, &ret);
  884. if (!ret)
  885. iter->iter_flags |= TRACE_FILE_LAT_FMT;
  886. return ret;
  887. }
  888. static void notrace *
  889. t_next(struct seq_file *m, void *v, loff_t *pos)
  890. {
  891. struct tracer *t = m->private;
  892. (*pos)++;
  893. if (t)
  894. t = t->next;
  895. m->private = t;
  896. return t;
  897. }
  898. static void *t_start(struct seq_file *m, loff_t *pos)
  899. {
  900. struct tracer *t = m->private;
  901. loff_t l = 0;
  902. mutex_lock(&trace_types_lock);
  903. for (; t && l < *pos; t = t_next(m, t, &l))
  904. ;
  905. return t;
  906. }
  907. static void t_stop(struct seq_file *m, void *p)
  908. {
  909. mutex_unlock(&trace_types_lock);
  910. }
  911. static int t_show(struct seq_file *m, void *v)
  912. {
  913. struct tracer *t = v;
  914. if (!t)
  915. return 0;
  916. seq_printf(m, "%s", t->name);
  917. if (t->next)
  918. seq_putc(m, ' ');
  919. else
  920. seq_putc(m, '\n');
  921. return 0;
  922. }
  923. static struct seq_operations show_traces_seq_ops = {
  924. .start = t_start,
  925. .next = t_next,
  926. .stop = t_stop,
  927. .show = t_show,
  928. };
  929. static int show_traces_open(struct inode *inode, struct file *file)
  930. {
  931. int ret;
  932. ret = seq_open(file, &show_traces_seq_ops);
  933. if (!ret) {
  934. struct seq_file *m = file->private_data;
  935. m->private = trace_types;
  936. }
  937. return ret;
  938. }
  939. static struct file_operations tracing_fops = {
  940. .open = tracing_open,
  941. .read = seq_read,
  942. .llseek = seq_lseek,
  943. .release = tracing_release,
  944. };
  945. static struct file_operations tracing_lt_fops = {
  946. .open = tracing_lt_open,
  947. .read = seq_read,
  948. .llseek = seq_lseek,
  949. .release = tracing_release,
  950. };
  951. static struct file_operations show_traces_fops = {
  952. .open = show_traces_open,
  953. .read = seq_read,
  954. .release = seq_release,
  955. };
  956. static ssize_t
  957. tracing_iter_ctrl_read(struct file *filp, char __user *ubuf,
  958. size_t cnt, loff_t *ppos)
  959. {
  960. char *buf;
  961. int r = 0;
  962. int len = 0;
  963. int i;
  964. /* calulate max size */
  965. for (i = 0; trace_options[i]; i++) {
  966. len += strlen(trace_options[i]);
  967. len += 3; /* "no" and space */
  968. }
  969. /* +2 for \n and \0 */
  970. buf = kmalloc(len + 2, GFP_KERNEL);
  971. if (!buf)
  972. return -ENOMEM;
  973. for (i = 0; trace_options[i]; i++) {
  974. if (trace_flags & (1 << i))
  975. r += sprintf(buf + r, "%s ", trace_options[i]);
  976. else
  977. r += sprintf(buf + r, "no%s ", trace_options[i]);
  978. }
  979. r += sprintf(buf + r, "\n");
  980. WARN_ON(r >= len + 2);
  981. r = simple_read_from_buffer(ubuf, cnt, ppos,
  982. buf, r);
  983. kfree(buf);
  984. return r;
  985. }
  986. static ssize_t
  987. tracing_iter_ctrl_write(struct file *filp, const char __user *ubuf,
  988. size_t cnt, loff_t *ppos)
  989. {
  990. char buf[64];
  991. char *cmp = buf;
  992. int neg = 0;
  993. int i;
  994. if (cnt > 63)
  995. cnt = 63;
  996. if (copy_from_user(&buf, ubuf, cnt))
  997. return -EFAULT;
  998. buf[cnt] = 0;
  999. if (strncmp(buf, "no", 2) == 0) {
  1000. neg = 1;
  1001. cmp += 2;
  1002. }
  1003. for (i = 0; trace_options[i]; i++) {
  1004. int len = strlen(trace_options[i]);
  1005. if (strncmp(cmp, trace_options[i], len) == 0) {
  1006. if (neg)
  1007. trace_flags &= ~(1 << i);
  1008. else
  1009. trace_flags |= (1 << i);
  1010. break;
  1011. }
  1012. }
  1013. filp->f_pos += cnt;
  1014. return cnt;
  1015. }
  1016. static struct file_operations tracing_iter_fops = {
  1017. .open = tracing_open_generic,
  1018. .read = tracing_iter_ctrl_read,
  1019. .write = tracing_iter_ctrl_write,
  1020. };
  1021. static ssize_t
  1022. tracing_ctrl_read(struct file *filp, char __user *ubuf,
  1023. size_t cnt, loff_t *ppos)
  1024. {
  1025. struct trace_array *tr = filp->private_data;
  1026. char buf[64];
  1027. int r;
  1028. r = sprintf(buf, "%ld\n", tr->ctrl);
  1029. return simple_read_from_buffer(ubuf, cnt, ppos,
  1030. buf, r);
  1031. }
  1032. static ssize_t
  1033. tracing_ctrl_write(struct file *filp, const char __user *ubuf,
  1034. size_t cnt, loff_t *ppos)
  1035. {
  1036. struct trace_array *tr = filp->private_data;
  1037. long val;
  1038. char buf[64];
  1039. if (cnt > 63)
  1040. cnt = 63;
  1041. if (copy_from_user(&buf, ubuf, cnt))
  1042. return -EFAULT;
  1043. buf[cnt] = 0;
  1044. val = simple_strtoul(buf, NULL, 10);
  1045. val = !!val;
  1046. mutex_lock(&trace_types_lock);
  1047. if (tr->ctrl ^ val) {
  1048. if (val)
  1049. tracer_enabled = 1;
  1050. else
  1051. tracer_enabled = 0;
  1052. tr->ctrl = val;
  1053. if (current_trace && current_trace->ctrl_update)
  1054. current_trace->ctrl_update(tr);
  1055. }
  1056. mutex_unlock(&trace_types_lock);
  1057. filp->f_pos += cnt;
  1058. return cnt;
  1059. }
  1060. static ssize_t
  1061. tracing_set_trace_read(struct file *filp, char __user *ubuf,
  1062. size_t cnt, loff_t *ppos)
  1063. {
  1064. char buf[max_tracer_type_len+2];
  1065. int r;
  1066. mutex_lock(&trace_types_lock);
  1067. if (current_trace)
  1068. r = sprintf(buf, "%s\n", current_trace->name);
  1069. else
  1070. r = sprintf(buf, "\n");
  1071. mutex_unlock(&trace_types_lock);
  1072. return simple_read_from_buffer(ubuf, cnt, ppos,
  1073. buf, r);
  1074. }
  1075. static ssize_t
  1076. tracing_set_trace_write(struct file *filp, const char __user *ubuf,
  1077. size_t cnt, loff_t *ppos)
  1078. {
  1079. struct trace_array *tr = &global_trace;
  1080. struct tracer *t;
  1081. char buf[max_tracer_type_len+1];
  1082. int i;
  1083. if (cnt > max_tracer_type_len)
  1084. cnt = max_tracer_type_len;
  1085. if (copy_from_user(&buf, ubuf, cnt))
  1086. return -EFAULT;
  1087. buf[cnt] = 0;
  1088. /* strip ending whitespace. */
  1089. for (i = cnt - 1; i > 0 && isspace(buf[i]); i--)
  1090. buf[i] = 0;
  1091. mutex_lock(&trace_types_lock);
  1092. for (t = trace_types; t; t = t->next) {
  1093. if (strcmp(t->name, buf) == 0)
  1094. break;
  1095. }
  1096. if (!t || t == current_trace)
  1097. goto out;
  1098. if (current_trace && current_trace->reset)
  1099. current_trace->reset(tr);
  1100. current_trace = t;
  1101. if (t->init)
  1102. t->init(tr);
  1103. out:
  1104. mutex_unlock(&trace_types_lock);
  1105. filp->f_pos += cnt;
  1106. return cnt;
  1107. }
  1108. static ssize_t
  1109. tracing_max_lat_read(struct file *filp, char __user *ubuf,
  1110. size_t cnt, loff_t *ppos)
  1111. {
  1112. unsigned long *ptr = filp->private_data;
  1113. char buf[64];
  1114. int r;
  1115. r = snprintf(buf, 64, "%ld\n",
  1116. *ptr == (unsigned long)-1 ? -1 : nsecs_to_usecs(*ptr));
  1117. if (r > 64)
  1118. r = 64;
  1119. return simple_read_from_buffer(ubuf, cnt, ppos,
  1120. buf, r);
  1121. }
  1122. static ssize_t
  1123. tracing_max_lat_write(struct file *filp, const char __user *ubuf,
  1124. size_t cnt, loff_t *ppos)
  1125. {
  1126. long *ptr = filp->private_data;
  1127. long val;
  1128. char buf[64];
  1129. if (cnt > 63)
  1130. cnt = 63;
  1131. if (copy_from_user(&buf, ubuf, cnt))
  1132. return -EFAULT;
  1133. buf[cnt] = 0;
  1134. val = simple_strtoul(buf, NULL, 10);
  1135. *ptr = val * 1000;
  1136. return cnt;
  1137. }
  1138. static struct file_operations tracing_max_lat_fops = {
  1139. .open = tracing_open_generic,
  1140. .read = tracing_max_lat_read,
  1141. .write = tracing_max_lat_write,
  1142. };
  1143. static struct file_operations tracing_ctrl_fops = {
  1144. .open = tracing_open_generic,
  1145. .read = tracing_ctrl_read,
  1146. .write = tracing_ctrl_write,
  1147. };
  1148. static struct file_operations set_tracer_fops = {
  1149. .open = tracing_open_generic,
  1150. .read = tracing_set_trace_read,
  1151. .write = tracing_set_trace_write,
  1152. };
  1153. #ifdef CONFIG_DYNAMIC_FTRACE
  1154. static ssize_t
  1155. tracing_read_long(struct file *filp, char __user *ubuf,
  1156. size_t cnt, loff_t *ppos)
  1157. {
  1158. unsigned long *p = filp->private_data;
  1159. char buf[64];
  1160. int r;
  1161. r = sprintf(buf, "%ld\n", *p);
  1162. return simple_read_from_buffer(ubuf, cnt, ppos,
  1163. buf, r);
  1164. }
  1165. static struct file_operations tracing_read_long_fops = {
  1166. .open = tracing_open_generic,
  1167. .read = tracing_read_long,
  1168. };
  1169. #endif
  1170. static struct dentry *d_tracer;
  1171. struct dentry *tracing_init_dentry(void)
  1172. {
  1173. static int once;
  1174. if (d_tracer)
  1175. return d_tracer;
  1176. d_tracer = debugfs_create_dir("tracing", NULL);
  1177. if (!d_tracer && !once) {
  1178. once = 1;
  1179. pr_warning("Could not create debugfs directory 'tracing'\n");
  1180. return NULL;
  1181. }
  1182. return d_tracer;
  1183. }
  1184. static __init void tracer_init_debugfs(void)
  1185. {
  1186. struct dentry *d_tracer;
  1187. struct dentry *entry;
  1188. d_tracer = tracing_init_dentry();
  1189. entry = debugfs_create_file("tracing_enabled", 0644, d_tracer,
  1190. &global_trace, &tracing_ctrl_fops);
  1191. if (!entry)
  1192. pr_warning("Could not create debugfs 'tracing_enabled' entry\n");
  1193. entry = debugfs_create_file("iter_ctrl", 0644, d_tracer,
  1194. NULL, &tracing_iter_fops);
  1195. if (!entry)
  1196. pr_warning("Could not create debugfs 'iter_ctrl' entry\n");
  1197. entry = debugfs_create_file("latency_trace", 0444, d_tracer,
  1198. &global_trace, &tracing_lt_fops);
  1199. if (!entry)
  1200. pr_warning("Could not create debugfs 'latency_trace' entry\n");
  1201. entry = debugfs_create_file("trace", 0444, d_tracer,
  1202. &global_trace, &tracing_fops);
  1203. if (!entry)
  1204. pr_warning("Could not create debugfs 'trace' entry\n");
  1205. entry = debugfs_create_file("available_tracers", 0444, d_tracer,
  1206. &global_trace, &show_traces_fops);
  1207. if (!entry)
  1208. pr_warning("Could not create debugfs 'trace' entry\n");
  1209. entry = debugfs_create_file("current_tracer", 0444, d_tracer,
  1210. &global_trace, &set_tracer_fops);
  1211. if (!entry)
  1212. pr_warning("Could not create debugfs 'trace' entry\n");
  1213. entry = debugfs_create_file("tracing_max_latency", 0644, d_tracer,
  1214. &tracing_max_latency,
  1215. &tracing_max_lat_fops);
  1216. if (!entry)
  1217. pr_warning("Could not create debugfs "
  1218. "'tracing_max_latency' entry\n");
  1219. entry = debugfs_create_file("tracing_thresh", 0644, d_tracer,
  1220. &tracing_thresh, &tracing_max_lat_fops);
  1221. if (!entry)
  1222. pr_warning("Could not create debugfs "
  1223. "'tracing_threash' entry\n");
  1224. #ifdef CONFIG_DYNAMIC_FTRACE
  1225. entry = debugfs_create_file("dyn_ftrace_total_info", 0444, d_tracer,
  1226. &ftrace_update_tot_cnt,
  1227. &tracing_read_long_fops);
  1228. if (!entry)
  1229. pr_warning("Could not create debugfs "
  1230. "'dyn_ftrace_total_info' entry\n");
  1231. #endif
  1232. }
  1233. /* dummy trace to disable tracing */
  1234. static struct tracer no_tracer __read_mostly =
  1235. {
  1236. .name = "none",
  1237. };
  1238. static int trace_alloc_page(void)
  1239. {
  1240. struct trace_array_cpu *data;
  1241. void *array;
  1242. struct page *page, *tmp;
  1243. LIST_HEAD(pages);
  1244. int i;
  1245. /* first allocate a page for each CPU */
  1246. for_each_possible_cpu(i) {
  1247. array = (void *)__get_free_page(GFP_KERNEL);
  1248. if (array == NULL) {
  1249. printk(KERN_ERR "tracer: failed to allocate page"
  1250. "for trace buffer!\n");
  1251. goto free_pages;
  1252. }
  1253. page = virt_to_page(array);
  1254. list_add(&page->lru, &pages);
  1255. /* Only allocate if we are actually using the max trace */
  1256. #ifdef CONFIG_TRACER_MAX_TRACE
  1257. array = (void *)__get_free_page(GFP_KERNEL);
  1258. if (array == NULL) {
  1259. printk(KERN_ERR "tracer: failed to allocate page"
  1260. "for trace buffer!\n");
  1261. goto free_pages;
  1262. }
  1263. page = virt_to_page(array);
  1264. list_add(&page->lru, &pages);
  1265. #endif
  1266. }
  1267. /* Now that we successfully allocate a page per CPU, add them */
  1268. for_each_possible_cpu(i) {
  1269. data = global_trace.data[i];
  1270. page = list_entry(pages.next, struct page, lru);
  1271. list_del(&page->lru);
  1272. list_add_tail(&page->lru, &data->trace_pages);
  1273. ClearPageLRU(page);
  1274. #ifdef CONFIG_TRACER_MAX_TRACE
  1275. data = max_tr.data[i];
  1276. page = list_entry(pages.next, struct page, lru);
  1277. list_del(&page->lru);
  1278. list_add_tail(&page->lru, &data->trace_pages);
  1279. SetPageLRU(page);
  1280. #endif
  1281. }
  1282. global_trace.entries += ENTRIES_PER_PAGE;
  1283. return 0;
  1284. free_pages:
  1285. list_for_each_entry_safe(page, tmp, &pages, lru) {
  1286. list_del(&page->lru);
  1287. __free_page(page);
  1288. }
  1289. return -ENOMEM;
  1290. }
  1291. __init static int tracer_alloc_buffers(void)
  1292. {
  1293. struct trace_array_cpu *data;
  1294. void *array;
  1295. struct page *page;
  1296. int pages = 0;
  1297. int i;
  1298. /* Allocate the first page for all buffers */
  1299. for_each_possible_cpu(i) {
  1300. data = global_trace.data[i] = &per_cpu(global_trace_cpu, i);
  1301. max_tr.data[i] = &per_cpu(max_data, i);
  1302. array = (void *)__get_free_page(GFP_KERNEL);
  1303. if (array == NULL) {
  1304. printk(KERN_ERR "tracer: failed to allocate page"
  1305. "for trace buffer!\n");
  1306. goto free_buffers;
  1307. }
  1308. data->trace = array;
  1309. /* set the array to the list */
  1310. INIT_LIST_HEAD(&data->trace_pages);
  1311. page = virt_to_page(array);
  1312. list_add(&page->lru, &data->trace_pages);
  1313. /* use the LRU flag to differentiate the two buffers */
  1314. ClearPageLRU(page);
  1315. /* Only allocate if we are actually using the max trace */
  1316. #ifdef CONFIG_TRACER_MAX_TRACE
  1317. array = (void *)__get_free_page(GFP_KERNEL);
  1318. if (array == NULL) {
  1319. printk(KERN_ERR "tracer: failed to allocate page"
  1320. "for trace buffer!\n");
  1321. goto free_buffers;
  1322. }
  1323. max_tr.data[i]->trace = array;
  1324. INIT_LIST_HEAD(&max_tr.data[i]->trace_pages);
  1325. page = virt_to_page(array);
  1326. list_add(&page->lru, &max_tr.data[i]->trace_pages);
  1327. SetPageLRU(page);
  1328. #endif
  1329. }
  1330. /*
  1331. * Since we allocate by orders of pages, we may be able to
  1332. * round up a bit.
  1333. */
  1334. global_trace.entries = ENTRIES_PER_PAGE;
  1335. pages++;
  1336. while (global_trace.entries < trace_nr_entries) {
  1337. if (trace_alloc_page())
  1338. break;
  1339. pages++;
  1340. }
  1341. max_tr.entries = global_trace.entries;
  1342. pr_info("tracer: %d pages allocated for %ld",
  1343. pages, trace_nr_entries);
  1344. pr_info(" entries of %ld bytes\n", (long)TRACE_ENTRY_SIZE);
  1345. pr_info(" actual entries %ld\n", global_trace.entries);
  1346. tracer_init_debugfs();
  1347. trace_init_cmdlines();
  1348. register_tracer(&no_tracer);
  1349. current_trace = &no_tracer;
  1350. return 0;
  1351. free_buffers:
  1352. for (i-- ; i >= 0; i--) {
  1353. struct page *page, *tmp;
  1354. struct trace_array_cpu *data = global_trace.data[i];
  1355. if (data && data->trace) {
  1356. list_for_each_entry_safe(page, tmp,
  1357. &data->trace_pages, lru) {
  1358. list_del(&page->lru);
  1359. __free_page(page);
  1360. }
  1361. data->trace = NULL;
  1362. }
  1363. #ifdef CONFIG_TRACER_MAX_TRACE
  1364. data = max_tr.data[i];
  1365. if (data && data->trace) {
  1366. list_for_each_entry_safe(page, tmp,
  1367. &data->trace_pages, lru) {
  1368. list_del(&page->lru);
  1369. __free_page(page);
  1370. }
  1371. data->trace = NULL;
  1372. }
  1373. #endif
  1374. }
  1375. return -ENOMEM;
  1376. }
  1377. device_initcall(tracer_alloc_buffers);