trace_functions_graph.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775
  1. /*
  2. *
  3. * Function graph tracer.
  4. * Copyright (c) 2008-2009 Frederic Weisbecker <fweisbec@gmail.com>
  5. * Mostly borrowed from function tracer which
  6. * is Copyright (c) Steven Rostedt <srostedt@redhat.com>
  7. *
  8. */
  9. #include <linux/debugfs.h>
  10. #include <linux/uaccess.h>
  11. #include <linux/ftrace.h>
  12. #include <linux/fs.h>
  13. #include "trace.h"
  14. #include "trace_output.h"
  15. #define TRACE_GRAPH_INDENT 2
  16. /* Flag options */
  17. #define TRACE_GRAPH_PRINT_OVERRUN 0x1
  18. #define TRACE_GRAPH_PRINT_CPU 0x2
  19. #define TRACE_GRAPH_PRINT_OVERHEAD 0x4
  20. #define TRACE_GRAPH_PRINT_PROC 0x8
  21. #define TRACE_GRAPH_PRINT_DURATION 0x10
  22. #define TRACE_GRAPH_PRINT_ABS_TIME 0X20
  23. static struct tracer_opt trace_opts[] = {
  24. /* Display overruns? (for self-debug purpose) */
  25. { TRACER_OPT(funcgraph-overrun, TRACE_GRAPH_PRINT_OVERRUN) },
  26. /* Display CPU ? */
  27. { TRACER_OPT(funcgraph-cpu, TRACE_GRAPH_PRINT_CPU) },
  28. /* Display Overhead ? */
  29. { TRACER_OPT(funcgraph-overhead, TRACE_GRAPH_PRINT_OVERHEAD) },
  30. /* Display proc name/pid */
  31. { TRACER_OPT(funcgraph-proc, TRACE_GRAPH_PRINT_PROC) },
  32. /* Display duration of execution */
  33. { TRACER_OPT(funcgraph-duration, TRACE_GRAPH_PRINT_DURATION) },
  34. /* Display absolute time of an entry */
  35. { TRACER_OPT(funcgraph-abstime, TRACE_GRAPH_PRINT_ABS_TIME) },
  36. { } /* Empty entry */
  37. };
  38. static struct tracer_flags tracer_flags = {
  39. /* Don't display overruns and proc by default */
  40. .val = TRACE_GRAPH_PRINT_CPU | TRACE_GRAPH_PRINT_OVERHEAD |
  41. TRACE_GRAPH_PRINT_DURATION,
  42. .opts = trace_opts
  43. };
  44. /* pid on the last trace processed */
  45. static int graph_trace_init(struct trace_array *tr)
  46. {
  47. int ret = register_ftrace_graph(&trace_graph_return,
  48. &trace_graph_entry);
  49. if (ret)
  50. return ret;
  51. tracing_start_cmdline_record();
  52. return 0;
  53. }
  54. static void graph_trace_reset(struct trace_array *tr)
  55. {
  56. tracing_stop_cmdline_record();
  57. unregister_ftrace_graph();
  58. }
  59. static inline int log10_cpu(int nb)
  60. {
  61. if (nb / 100)
  62. return 3;
  63. if (nb / 10)
  64. return 2;
  65. return 1;
  66. }
  67. static enum print_line_t
  68. print_graph_cpu(struct trace_seq *s, int cpu)
  69. {
  70. int i;
  71. int ret;
  72. int log10_this = log10_cpu(cpu);
  73. int log10_all = log10_cpu(cpumask_weight(cpu_online_mask));
  74. /*
  75. * Start with a space character - to make it stand out
  76. * to the right a bit when trace output is pasted into
  77. * email:
  78. */
  79. ret = trace_seq_printf(s, " ");
  80. /*
  81. * Tricky - we space the CPU field according to the max
  82. * number of online CPUs. On a 2-cpu system it would take
  83. * a maximum of 1 digit - on a 128 cpu system it would
  84. * take up to 3 digits:
  85. */
  86. for (i = 0; i < log10_all - log10_this; i++) {
  87. ret = trace_seq_printf(s, " ");
  88. if (!ret)
  89. return TRACE_TYPE_PARTIAL_LINE;
  90. }
  91. ret = trace_seq_printf(s, "%d) ", cpu);
  92. if (!ret)
  93. return TRACE_TYPE_PARTIAL_LINE;
  94. return TRACE_TYPE_HANDLED;
  95. }
  96. #define TRACE_GRAPH_PROCINFO_LENGTH 14
  97. static enum print_line_t
  98. print_graph_proc(struct trace_seq *s, pid_t pid)
  99. {
  100. int i;
  101. int ret;
  102. int len;
  103. char comm[8];
  104. int spaces = 0;
  105. /* sign + log10(MAX_INT) + '\0' */
  106. char pid_str[11];
  107. strncpy(comm, trace_find_cmdline(pid), 7);
  108. comm[7] = '\0';
  109. sprintf(pid_str, "%d", pid);
  110. /* 1 stands for the "-" character */
  111. len = strlen(comm) + strlen(pid_str) + 1;
  112. if (len < TRACE_GRAPH_PROCINFO_LENGTH)
  113. spaces = TRACE_GRAPH_PROCINFO_LENGTH - len;
  114. /* First spaces to align center */
  115. for (i = 0; i < spaces / 2; i++) {
  116. ret = trace_seq_printf(s, " ");
  117. if (!ret)
  118. return TRACE_TYPE_PARTIAL_LINE;
  119. }
  120. ret = trace_seq_printf(s, "%s-%s", comm, pid_str);
  121. if (!ret)
  122. return TRACE_TYPE_PARTIAL_LINE;
  123. /* Last spaces to align center */
  124. for (i = 0; i < spaces - (spaces / 2); i++) {
  125. ret = trace_seq_printf(s, " ");
  126. if (!ret)
  127. return TRACE_TYPE_PARTIAL_LINE;
  128. }
  129. return TRACE_TYPE_HANDLED;
  130. }
  131. /* If the pid changed since the last trace, output this event */
  132. static enum print_line_t
  133. verif_pid(struct trace_seq *s, pid_t pid, int cpu, pid_t *last_pids_cpu)
  134. {
  135. pid_t prev_pid;
  136. pid_t *last_pid;
  137. int ret;
  138. if (!last_pids_cpu)
  139. return TRACE_TYPE_HANDLED;
  140. last_pid = per_cpu_ptr(last_pids_cpu, cpu);
  141. if (*last_pid == pid)
  142. return TRACE_TYPE_HANDLED;
  143. prev_pid = *last_pid;
  144. *last_pid = pid;
  145. if (prev_pid == -1)
  146. return TRACE_TYPE_HANDLED;
  147. /*
  148. * Context-switch trace line:
  149. ------------------------------------------
  150. | 1) migration/0--1 => sshd-1755
  151. ------------------------------------------
  152. */
  153. ret = trace_seq_printf(s,
  154. " ------------------------------------------\n");
  155. if (!ret)
  156. return TRACE_TYPE_PARTIAL_LINE;
  157. ret = print_graph_cpu(s, cpu);
  158. if (ret == TRACE_TYPE_PARTIAL_LINE)
  159. return TRACE_TYPE_PARTIAL_LINE;
  160. ret = print_graph_proc(s, prev_pid);
  161. if (ret == TRACE_TYPE_PARTIAL_LINE)
  162. return TRACE_TYPE_PARTIAL_LINE;
  163. ret = trace_seq_printf(s, " => ");
  164. if (!ret)
  165. return TRACE_TYPE_PARTIAL_LINE;
  166. ret = print_graph_proc(s, pid);
  167. if (ret == TRACE_TYPE_PARTIAL_LINE)
  168. return TRACE_TYPE_PARTIAL_LINE;
  169. ret = trace_seq_printf(s,
  170. "\n ------------------------------------------\n\n");
  171. if (!ret)
  172. return TRACE_TYPE_PARTIAL_LINE;
  173. return TRACE_TYPE_HANDLED;
  174. }
  175. static struct ftrace_graph_ret_entry *
  176. get_return_for_leaf(struct trace_iterator *iter,
  177. struct ftrace_graph_ent_entry *curr)
  178. {
  179. struct ring_buffer_iter *ring_iter;
  180. struct ring_buffer_event *event;
  181. struct ftrace_graph_ret_entry *next;
  182. ring_iter = iter->buffer_iter[iter->cpu];
  183. /* First peek to compare current entry and the next one */
  184. if (ring_iter)
  185. event = ring_buffer_iter_peek(ring_iter, NULL);
  186. else {
  187. /* We need to consume the current entry to see the next one */
  188. ring_buffer_consume(iter->tr->buffer, iter->cpu, NULL);
  189. event = ring_buffer_peek(iter->tr->buffer, iter->cpu,
  190. NULL);
  191. }
  192. if (!event)
  193. return NULL;
  194. next = ring_buffer_event_data(event);
  195. if (next->ent.type != TRACE_GRAPH_RET)
  196. return NULL;
  197. if (curr->ent.pid != next->ent.pid ||
  198. curr->graph_ent.func != next->ret.func)
  199. return NULL;
  200. /* this is a leaf, now advance the iterator */
  201. if (ring_iter)
  202. ring_buffer_read(ring_iter, NULL);
  203. return next;
  204. }
  205. /* Signal a overhead of time execution to the output */
  206. static int
  207. print_graph_overhead(unsigned long long duration, struct trace_seq *s)
  208. {
  209. /* If duration disappear, we don't need anything */
  210. if (!(tracer_flags.val & TRACE_GRAPH_PRINT_DURATION))
  211. return 1;
  212. /* Non nested entry or return */
  213. if (duration == -1)
  214. return trace_seq_printf(s, " ");
  215. if (tracer_flags.val & TRACE_GRAPH_PRINT_OVERHEAD) {
  216. /* Duration exceeded 100 msecs */
  217. if (duration > 100000ULL)
  218. return trace_seq_printf(s, "! ");
  219. /* Duration exceeded 10 msecs */
  220. if (duration > 10000ULL)
  221. return trace_seq_printf(s, "+ ");
  222. }
  223. return trace_seq_printf(s, " ");
  224. }
  225. static enum print_line_t
  226. print_graph_irq(struct trace_seq *s, unsigned long addr,
  227. enum trace_type type, int cpu, pid_t pid)
  228. {
  229. int ret;
  230. if (addr < (unsigned long)__irqentry_text_start ||
  231. addr >= (unsigned long)__irqentry_text_end)
  232. return TRACE_TYPE_UNHANDLED;
  233. /* Cpu */
  234. if (tracer_flags.val & TRACE_GRAPH_PRINT_CPU) {
  235. ret = print_graph_cpu(s, cpu);
  236. if (ret == TRACE_TYPE_PARTIAL_LINE)
  237. return TRACE_TYPE_PARTIAL_LINE;
  238. }
  239. /* Proc */
  240. if (tracer_flags.val & TRACE_GRAPH_PRINT_PROC) {
  241. ret = print_graph_proc(s, pid);
  242. if (ret == TRACE_TYPE_PARTIAL_LINE)
  243. return TRACE_TYPE_PARTIAL_LINE;
  244. ret = trace_seq_printf(s, " | ");
  245. if (!ret)
  246. return TRACE_TYPE_PARTIAL_LINE;
  247. }
  248. /* No overhead */
  249. ret = print_graph_overhead(-1, s);
  250. if (!ret)
  251. return TRACE_TYPE_PARTIAL_LINE;
  252. if (type == TRACE_GRAPH_ENT)
  253. ret = trace_seq_printf(s, "==========>");
  254. else
  255. ret = trace_seq_printf(s, "<==========");
  256. if (!ret)
  257. return TRACE_TYPE_PARTIAL_LINE;
  258. /* Don't close the duration column if haven't one */
  259. if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION)
  260. trace_seq_printf(s, " |");
  261. ret = trace_seq_printf(s, "\n");
  262. if (!ret)
  263. return TRACE_TYPE_PARTIAL_LINE;
  264. return TRACE_TYPE_HANDLED;
  265. }
  266. static enum print_line_t
  267. print_graph_duration(unsigned long long duration, struct trace_seq *s)
  268. {
  269. unsigned long nsecs_rem = do_div(duration, 1000);
  270. /* log10(ULONG_MAX) + '\0' */
  271. char msecs_str[21];
  272. char nsecs_str[5];
  273. int ret, len;
  274. int i;
  275. sprintf(msecs_str, "%lu", (unsigned long) duration);
  276. /* Print msecs */
  277. ret = trace_seq_printf(s, "%s", msecs_str);
  278. if (!ret)
  279. return TRACE_TYPE_PARTIAL_LINE;
  280. len = strlen(msecs_str);
  281. /* Print nsecs (we don't want to exceed 7 numbers) */
  282. if (len < 7) {
  283. snprintf(nsecs_str, 8 - len, "%03lu", nsecs_rem);
  284. ret = trace_seq_printf(s, ".%s", nsecs_str);
  285. if (!ret)
  286. return TRACE_TYPE_PARTIAL_LINE;
  287. len += strlen(nsecs_str);
  288. }
  289. ret = trace_seq_printf(s, " us ");
  290. if (!ret)
  291. return TRACE_TYPE_PARTIAL_LINE;
  292. /* Print remaining spaces to fit the row's width */
  293. for (i = len; i < 7; i++) {
  294. ret = trace_seq_printf(s, " ");
  295. if (!ret)
  296. return TRACE_TYPE_PARTIAL_LINE;
  297. }
  298. ret = trace_seq_printf(s, "| ");
  299. if (!ret)
  300. return TRACE_TYPE_PARTIAL_LINE;
  301. return TRACE_TYPE_HANDLED;
  302. }
  303. static int print_graph_abs_time(u64 t, struct trace_seq *s)
  304. {
  305. unsigned long usecs_rem;
  306. usecs_rem = do_div(t, 1000000000);
  307. usecs_rem /= 1000;
  308. return trace_seq_printf(s, "%5lu.%06lu | ",
  309. (unsigned long)t, usecs_rem);
  310. }
  311. /* Case of a leaf function on its call entry */
  312. static enum print_line_t
  313. print_graph_entry_leaf(struct trace_iterator *iter,
  314. struct ftrace_graph_ent_entry *entry,
  315. struct ftrace_graph_ret_entry *ret_entry, struct trace_seq *s)
  316. {
  317. struct ftrace_graph_ret *graph_ret;
  318. struct ftrace_graph_ent *call;
  319. unsigned long long duration;
  320. int ret;
  321. int i;
  322. graph_ret = &ret_entry->ret;
  323. call = &entry->graph_ent;
  324. duration = graph_ret->rettime - graph_ret->calltime;
  325. /* Overhead */
  326. ret = print_graph_overhead(duration, s);
  327. if (!ret)
  328. return TRACE_TYPE_PARTIAL_LINE;
  329. /* Duration */
  330. if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION) {
  331. ret = print_graph_duration(duration, s);
  332. if (ret == TRACE_TYPE_PARTIAL_LINE)
  333. return TRACE_TYPE_PARTIAL_LINE;
  334. }
  335. /* Function */
  336. for (i = 0; i < call->depth * TRACE_GRAPH_INDENT; i++) {
  337. ret = trace_seq_printf(s, " ");
  338. if (!ret)
  339. return TRACE_TYPE_PARTIAL_LINE;
  340. }
  341. ret = seq_print_ip_sym(s, call->func, 0);
  342. if (!ret)
  343. return TRACE_TYPE_PARTIAL_LINE;
  344. ret = trace_seq_printf(s, "();\n");
  345. if (!ret)
  346. return TRACE_TYPE_PARTIAL_LINE;
  347. return TRACE_TYPE_HANDLED;
  348. }
  349. static enum print_line_t
  350. print_graph_entry_nested(struct ftrace_graph_ent_entry *entry,
  351. struct trace_seq *s, pid_t pid, int cpu)
  352. {
  353. int i;
  354. int ret;
  355. struct ftrace_graph_ent *call = &entry->graph_ent;
  356. /* No overhead */
  357. ret = print_graph_overhead(-1, s);
  358. if (!ret)
  359. return TRACE_TYPE_PARTIAL_LINE;
  360. /* No time */
  361. if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION) {
  362. ret = trace_seq_printf(s, " | ");
  363. if (!ret)
  364. return TRACE_TYPE_PARTIAL_LINE;
  365. }
  366. /* Function */
  367. for (i = 0; i < call->depth * TRACE_GRAPH_INDENT; i++) {
  368. ret = trace_seq_printf(s, " ");
  369. if (!ret)
  370. return TRACE_TYPE_PARTIAL_LINE;
  371. }
  372. ret = seq_print_ip_sym(s, call->func, 0);
  373. if (!ret)
  374. return TRACE_TYPE_PARTIAL_LINE;
  375. ret = trace_seq_printf(s, "() {\n");
  376. if (!ret)
  377. return TRACE_TYPE_PARTIAL_LINE;
  378. /*
  379. * we already consumed the current entry to check the next one
  380. * and see if this is a leaf.
  381. */
  382. return TRACE_TYPE_NO_CONSUME;
  383. }
  384. static enum print_line_t
  385. print_graph_entry(struct ftrace_graph_ent_entry *field, struct trace_seq *s,
  386. struct trace_iterator *iter)
  387. {
  388. int ret;
  389. int cpu = iter->cpu;
  390. pid_t *last_entry = iter->private;
  391. struct trace_entry *ent = iter->ent;
  392. struct ftrace_graph_ent *call = &field->graph_ent;
  393. struct ftrace_graph_ret_entry *leaf_ret;
  394. /* Pid */
  395. if (verif_pid(s, ent->pid, cpu, last_entry) == TRACE_TYPE_PARTIAL_LINE)
  396. return TRACE_TYPE_PARTIAL_LINE;
  397. /* Interrupt */
  398. ret = print_graph_irq(s, call->func, TRACE_GRAPH_ENT, cpu, ent->pid);
  399. if (ret == TRACE_TYPE_PARTIAL_LINE)
  400. return TRACE_TYPE_PARTIAL_LINE;
  401. /* Absolute time */
  402. if (tracer_flags.val & TRACE_GRAPH_PRINT_ABS_TIME) {
  403. ret = print_graph_abs_time(iter->ts, s);
  404. if (!ret)
  405. return TRACE_TYPE_PARTIAL_LINE;
  406. }
  407. /* Cpu */
  408. if (tracer_flags.val & TRACE_GRAPH_PRINT_CPU) {
  409. ret = print_graph_cpu(s, cpu);
  410. if (ret == TRACE_TYPE_PARTIAL_LINE)
  411. return TRACE_TYPE_PARTIAL_LINE;
  412. }
  413. /* Proc */
  414. if (tracer_flags.val & TRACE_GRAPH_PRINT_PROC) {
  415. ret = print_graph_proc(s, ent->pid);
  416. if (ret == TRACE_TYPE_PARTIAL_LINE)
  417. return TRACE_TYPE_PARTIAL_LINE;
  418. ret = trace_seq_printf(s, " | ");
  419. if (!ret)
  420. return TRACE_TYPE_PARTIAL_LINE;
  421. }
  422. leaf_ret = get_return_for_leaf(iter, field);
  423. if (leaf_ret)
  424. return print_graph_entry_leaf(iter, field, leaf_ret, s);
  425. else
  426. return print_graph_entry_nested(field, s, iter->ent->pid, cpu);
  427. }
  428. static enum print_line_t
  429. print_graph_return(struct ftrace_graph_ret *trace, struct trace_seq *s,
  430. struct trace_entry *ent, struct trace_iterator *iter)
  431. {
  432. int i;
  433. int ret;
  434. int cpu = iter->cpu;
  435. pid_t *last_pid = iter->private;
  436. unsigned long long duration = trace->rettime - trace->calltime;
  437. /* Pid */
  438. if (verif_pid(s, ent->pid, cpu, last_pid) == TRACE_TYPE_PARTIAL_LINE)
  439. return TRACE_TYPE_PARTIAL_LINE;
  440. /* Absolute time */
  441. if (tracer_flags.val & TRACE_GRAPH_PRINT_ABS_TIME) {
  442. ret = print_graph_abs_time(iter->ts, s);
  443. if (!ret)
  444. return TRACE_TYPE_PARTIAL_LINE;
  445. }
  446. /* Cpu */
  447. if (tracer_flags.val & TRACE_GRAPH_PRINT_CPU) {
  448. ret = print_graph_cpu(s, cpu);
  449. if (ret == TRACE_TYPE_PARTIAL_LINE)
  450. return TRACE_TYPE_PARTIAL_LINE;
  451. }
  452. /* Proc */
  453. if (tracer_flags.val & TRACE_GRAPH_PRINT_PROC) {
  454. ret = print_graph_proc(s, ent->pid);
  455. if (ret == TRACE_TYPE_PARTIAL_LINE)
  456. return TRACE_TYPE_PARTIAL_LINE;
  457. ret = trace_seq_printf(s, " | ");
  458. if (!ret)
  459. return TRACE_TYPE_PARTIAL_LINE;
  460. }
  461. /* Overhead */
  462. ret = print_graph_overhead(duration, s);
  463. if (!ret)
  464. return TRACE_TYPE_PARTIAL_LINE;
  465. /* Duration */
  466. if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION) {
  467. ret = print_graph_duration(duration, s);
  468. if (ret == TRACE_TYPE_PARTIAL_LINE)
  469. return TRACE_TYPE_PARTIAL_LINE;
  470. }
  471. /* Closing brace */
  472. for (i = 0; i < trace->depth * TRACE_GRAPH_INDENT; i++) {
  473. ret = trace_seq_printf(s, " ");
  474. if (!ret)
  475. return TRACE_TYPE_PARTIAL_LINE;
  476. }
  477. ret = trace_seq_printf(s, "}\n");
  478. if (!ret)
  479. return TRACE_TYPE_PARTIAL_LINE;
  480. /* Overrun */
  481. if (tracer_flags.val & TRACE_GRAPH_PRINT_OVERRUN) {
  482. ret = trace_seq_printf(s, " (Overruns: %lu)\n",
  483. trace->overrun);
  484. if (!ret)
  485. return TRACE_TYPE_PARTIAL_LINE;
  486. }
  487. ret = print_graph_irq(s, trace->func, TRACE_GRAPH_RET, cpu, ent->pid);
  488. if (ret == TRACE_TYPE_PARTIAL_LINE)
  489. return TRACE_TYPE_PARTIAL_LINE;
  490. return TRACE_TYPE_HANDLED;
  491. }
  492. static enum print_line_t
  493. print_graph_comment(struct print_entry *trace, struct trace_seq *s,
  494. struct trace_entry *ent, struct trace_iterator *iter)
  495. {
  496. int i;
  497. int ret;
  498. int cpu = iter->cpu;
  499. pid_t *last_pid = iter->private;
  500. /* Absolute time */
  501. if (tracer_flags.val & TRACE_GRAPH_PRINT_ABS_TIME) {
  502. ret = print_graph_abs_time(iter->ts, s);
  503. if (!ret)
  504. return TRACE_TYPE_PARTIAL_LINE;
  505. }
  506. /* Pid */
  507. if (verif_pid(s, ent->pid, cpu, last_pid) == TRACE_TYPE_PARTIAL_LINE)
  508. return TRACE_TYPE_PARTIAL_LINE;
  509. /* Cpu */
  510. if (tracer_flags.val & TRACE_GRAPH_PRINT_CPU) {
  511. ret = print_graph_cpu(s, cpu);
  512. if (ret == TRACE_TYPE_PARTIAL_LINE)
  513. return TRACE_TYPE_PARTIAL_LINE;
  514. }
  515. /* Proc */
  516. if (tracer_flags.val & TRACE_GRAPH_PRINT_PROC) {
  517. ret = print_graph_proc(s, ent->pid);
  518. if (ret == TRACE_TYPE_PARTIAL_LINE)
  519. return TRACE_TYPE_PARTIAL_LINE;
  520. ret = trace_seq_printf(s, " | ");
  521. if (!ret)
  522. return TRACE_TYPE_PARTIAL_LINE;
  523. }
  524. /* No overhead */
  525. ret = print_graph_overhead(-1, s);
  526. if (!ret)
  527. return TRACE_TYPE_PARTIAL_LINE;
  528. /* No time */
  529. if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION) {
  530. ret = trace_seq_printf(s, " | ");
  531. if (!ret)
  532. return TRACE_TYPE_PARTIAL_LINE;
  533. }
  534. /* Indentation */
  535. if (trace->depth > 0)
  536. for (i = 0; i < (trace->depth + 1) * TRACE_GRAPH_INDENT; i++) {
  537. ret = trace_seq_printf(s, " ");
  538. if (!ret)
  539. return TRACE_TYPE_PARTIAL_LINE;
  540. }
  541. /* The comment */
  542. ret = trace_seq_printf(s, "/* %s", trace->buf);
  543. if (!ret)
  544. return TRACE_TYPE_PARTIAL_LINE;
  545. /* Strip ending newline */
  546. if (s->buffer[s->len - 1] == '\n') {
  547. s->buffer[s->len - 1] = '\0';
  548. s->len--;
  549. }
  550. ret = trace_seq_printf(s, " */\n");
  551. if (!ret)
  552. return TRACE_TYPE_PARTIAL_LINE;
  553. return TRACE_TYPE_HANDLED;
  554. }
  555. enum print_line_t
  556. print_graph_function(struct trace_iterator *iter)
  557. {
  558. struct trace_seq *s = &iter->seq;
  559. struct trace_entry *entry = iter->ent;
  560. switch (entry->type) {
  561. case TRACE_GRAPH_ENT: {
  562. struct ftrace_graph_ent_entry *field;
  563. trace_assign_type(field, entry);
  564. return print_graph_entry(field, s, iter);
  565. }
  566. case TRACE_GRAPH_RET: {
  567. struct ftrace_graph_ret_entry *field;
  568. trace_assign_type(field, entry);
  569. return print_graph_return(&field->ret, s, entry, iter);
  570. }
  571. case TRACE_PRINT: {
  572. struct print_entry *field;
  573. trace_assign_type(field, entry);
  574. return print_graph_comment(field, s, entry, iter);
  575. }
  576. default:
  577. return TRACE_TYPE_UNHANDLED;
  578. }
  579. }
  580. static void print_graph_headers(struct seq_file *s)
  581. {
  582. /* 1st line */
  583. seq_printf(s, "# ");
  584. if (tracer_flags.val & TRACE_GRAPH_PRINT_ABS_TIME)
  585. seq_printf(s, " TIME ");
  586. if (tracer_flags.val & TRACE_GRAPH_PRINT_CPU)
  587. seq_printf(s, "CPU");
  588. if (tracer_flags.val & TRACE_GRAPH_PRINT_PROC)
  589. seq_printf(s, " TASK/PID ");
  590. if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION)
  591. seq_printf(s, " DURATION ");
  592. seq_printf(s, " FUNCTION CALLS\n");
  593. /* 2nd line */
  594. seq_printf(s, "# ");
  595. if (tracer_flags.val & TRACE_GRAPH_PRINT_ABS_TIME)
  596. seq_printf(s, " | ");
  597. if (tracer_flags.val & TRACE_GRAPH_PRINT_CPU)
  598. seq_printf(s, "| ");
  599. if (tracer_flags.val & TRACE_GRAPH_PRINT_PROC)
  600. seq_printf(s, " | | ");
  601. if (tracer_flags.val & TRACE_GRAPH_PRINT_DURATION)
  602. seq_printf(s, " | | ");
  603. seq_printf(s, " | | | |\n");
  604. }
  605. static void graph_trace_open(struct trace_iterator *iter)
  606. {
  607. /* pid on the last trace processed */
  608. pid_t *last_pid = alloc_percpu(pid_t);
  609. int cpu;
  610. if (!last_pid)
  611. pr_warning("function graph tracer: not enough memory\n");
  612. else
  613. for_each_possible_cpu(cpu) {
  614. pid_t *pid = per_cpu_ptr(last_pid, cpu);
  615. *pid = -1;
  616. }
  617. iter->private = last_pid;
  618. }
  619. static void graph_trace_close(struct trace_iterator *iter)
  620. {
  621. percpu_free(iter->private);
  622. }
  623. static struct tracer graph_trace __read_mostly = {
  624. .name = "function_graph",
  625. .open = graph_trace_open,
  626. .close = graph_trace_close,
  627. .init = graph_trace_init,
  628. .reset = graph_trace_reset,
  629. .print_line = print_graph_function,
  630. .print_header = print_graph_headers,
  631. .flags = &tracer_flags,
  632. #ifdef CONFIG_FTRACE_SELFTEST
  633. .selftest = trace_selftest_startup_function_graph,
  634. #endif
  635. };
  636. static __init int init_graph_trace(void)
  637. {
  638. return register_tracer(&graph_trace);
  639. }
  640. device_initcall(init_graph_trace);