trace.c 37 KB

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