trace_stat.c 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386
  1. /*
  2. * Infrastructure for statistic tracing (histogram output).
  3. *
  4. * Copyright (C) 2008-2009 Frederic Weisbecker <fweisbec@gmail.com>
  5. *
  6. * Based on the code from trace_branch.c which is
  7. * Copyright (C) 2008 Steven Rostedt <srostedt@redhat.com>
  8. *
  9. */
  10. #include <linux/list.h>
  11. #include <linux/rbtree.h>
  12. #include <linux/debugfs.h>
  13. #include "trace_stat.h"
  14. #include "trace.h"
  15. /*
  16. * List of stat red-black nodes from a tracer
  17. * We use a such tree to sort quickly the stat
  18. * entries from the tracer.
  19. */
  20. struct stat_node {
  21. struct rb_node node;
  22. void *stat;
  23. };
  24. /* A stat session is the stats output in one file */
  25. struct stat_session {
  26. struct list_head session_list;
  27. struct tracer_stat *ts;
  28. struct rb_root stat_root;
  29. struct mutex stat_mutex;
  30. struct dentry *file;
  31. };
  32. /* All of the sessions currently in use. Each stat file embed one session */
  33. static LIST_HEAD(all_stat_sessions);
  34. static DEFINE_MUTEX(all_stat_sessions_mutex);
  35. /* The root directory for all stat files */
  36. static struct dentry *stat_dir;
  37. /*
  38. * Iterate through the rbtree using a post order traversal path
  39. * to release the next node.
  40. * It won't necessary release one at each iteration
  41. * but it will at least advance closer to the next one
  42. * to be released.
  43. */
  44. static struct rb_node *release_next(struct rb_node *node)
  45. {
  46. struct stat_node *snode;
  47. struct rb_node *parent = rb_parent(node);
  48. if (node->rb_left)
  49. return node->rb_left;
  50. else if (node->rb_right)
  51. return node->rb_right;
  52. else {
  53. if (!parent)
  54. return NULL;
  55. if (parent->rb_left == node)
  56. parent->rb_left = NULL;
  57. else
  58. parent->rb_right = NULL;
  59. snode = container_of(node, struct stat_node, node);
  60. kfree(snode);
  61. return parent;
  62. }
  63. }
  64. static void reset_stat_session(struct stat_session *session)
  65. {
  66. struct rb_node *node = session->stat_root.rb_node;
  67. while (node)
  68. node = release_next(node);
  69. session->stat_root = RB_ROOT;
  70. }
  71. static void destroy_session(struct stat_session *session)
  72. {
  73. debugfs_remove(session->file);
  74. reset_stat_session(session);
  75. mutex_destroy(&session->stat_mutex);
  76. kfree(session);
  77. }
  78. typedef int (*cmp_stat_t)(void *, void *);
  79. static void
  80. insert_stat(struct rb_root *root, struct stat_node *data, cmp_stat_t cmp)
  81. {
  82. struct rb_node **new = &(root->rb_node), *parent = NULL;
  83. /*
  84. * Figure out where to put new node
  85. * This is a descendent sorting
  86. */
  87. while (*new) {
  88. struct stat_node *this;
  89. int result;
  90. this = container_of(*new, struct stat_node, node);
  91. result = cmp(data->stat, this->stat);
  92. parent = *new;
  93. if (result >= 0)
  94. new = &((*new)->rb_left);
  95. else
  96. new = &((*new)->rb_right);
  97. }
  98. rb_link_node(&data->node, parent, new);
  99. rb_insert_color(&data->node, root);
  100. }
  101. /*
  102. * For tracers that don't provide a stat_cmp callback.
  103. * This one will force an immediate insertion on tail of
  104. * the list.
  105. */
  106. static int dummy_cmp(void *p1, void *p2)
  107. {
  108. return -1;
  109. }
  110. /*
  111. * Initialize the stat list at each trace_stat file opening.
  112. * All of these copies and sorting are required on all opening
  113. * since the stats could have changed between two file sessions.
  114. */
  115. static int stat_seq_init(struct stat_session *session)
  116. {
  117. struct tracer_stat *ts = session->ts;
  118. struct stat_node *new_entry;
  119. struct rb_root *root;
  120. void *stat;
  121. int ret = 0;
  122. int i;
  123. mutex_lock(&session->stat_mutex);
  124. reset_stat_session(session);
  125. if (!ts->stat_cmp)
  126. ts->stat_cmp = dummy_cmp;
  127. stat = ts->stat_start(ts);
  128. if (!stat)
  129. goto exit;
  130. /*
  131. * The first entry. Actually this is the second, but the first
  132. * one (the stat_list head) is pointless.
  133. */
  134. new_entry = kzalloc(sizeof(*new_entry), GFP_KERNEL);
  135. if (!new_entry) {
  136. ret = -ENOMEM;
  137. goto exit;
  138. }
  139. root = &session->stat_root;
  140. insert_stat(root, new_entry, dummy_cmp);
  141. new_entry->stat = stat;
  142. /*
  143. * Iterate over the tracer stat entries and store them in a sorted
  144. * list.
  145. */
  146. for (i = 1; ; i++) {
  147. stat = ts->stat_next(stat, i);
  148. /* End of insertion */
  149. if (!stat)
  150. break;
  151. new_entry = kzalloc(sizeof(*new_entry), GFP_KERNEL);
  152. if (!new_entry) {
  153. ret = -ENOMEM;
  154. goto exit_free_list;
  155. }
  156. new_entry->stat = stat;
  157. insert_stat(root, new_entry, ts->stat_cmp);
  158. }
  159. exit:
  160. mutex_unlock(&session->stat_mutex);
  161. return ret;
  162. exit_free_list:
  163. reset_stat_session(session);
  164. mutex_unlock(&session->stat_mutex);
  165. return ret;
  166. }
  167. static void *stat_seq_start(struct seq_file *s, loff_t *pos)
  168. {
  169. struct stat_session *session = s->private;
  170. struct rb_node *node;
  171. int i;
  172. /* Prevent from tracer switch or stat_list modification */
  173. mutex_lock(&session->stat_mutex);
  174. /* If we are in the beginning of the file, print the headers */
  175. if (!*pos && session->ts->stat_headers) {
  176. (*pos)++;
  177. return SEQ_START_TOKEN;
  178. }
  179. node = rb_first(&session->stat_root);
  180. for (i = 0; node && i < *pos; i++)
  181. node = rb_next(node);
  182. (*pos)++;
  183. return node;
  184. }
  185. static void *stat_seq_next(struct seq_file *s, void *p, loff_t *pos)
  186. {
  187. struct stat_session *session = s->private;
  188. struct rb_node *node = p;
  189. (*pos)++;
  190. if (p == SEQ_START_TOKEN)
  191. return rb_first(&session->stat_root);
  192. return rb_next(node);
  193. }
  194. static void stat_seq_stop(struct seq_file *s, void *p)
  195. {
  196. struct stat_session *session = s->private;
  197. mutex_unlock(&session->stat_mutex);
  198. }
  199. static int stat_seq_show(struct seq_file *s, void *v)
  200. {
  201. struct stat_session *session = s->private;
  202. struct stat_node *l = container_of(v, struct stat_node, node);
  203. if (v == SEQ_START_TOKEN)
  204. return session->ts->stat_headers(s);
  205. return session->ts->stat_show(s, l->stat);
  206. }
  207. static const struct seq_operations trace_stat_seq_ops = {
  208. .start = stat_seq_start,
  209. .next = stat_seq_next,
  210. .stop = stat_seq_stop,
  211. .show = stat_seq_show
  212. };
  213. /* The session stat is refilled and resorted at each stat file opening */
  214. static int tracing_stat_open(struct inode *inode, struct file *file)
  215. {
  216. int ret;
  217. struct stat_session *session = inode->i_private;
  218. ret = seq_open(file, &trace_stat_seq_ops);
  219. if (!ret) {
  220. struct seq_file *m = file->private_data;
  221. m->private = session;
  222. ret = stat_seq_init(session);
  223. }
  224. return ret;
  225. }
  226. /*
  227. * Avoid consuming memory with our now useless list.
  228. */
  229. static int tracing_stat_release(struct inode *i, struct file *f)
  230. {
  231. struct stat_session *session = i->i_private;
  232. mutex_lock(&session->stat_mutex);
  233. reset_stat_session(session);
  234. mutex_unlock(&session->stat_mutex);
  235. return 0;
  236. }
  237. static const struct file_operations tracing_stat_fops = {
  238. .open = tracing_stat_open,
  239. .read = seq_read,
  240. .llseek = seq_lseek,
  241. .release = tracing_stat_release
  242. };
  243. static int tracing_stat_init(void)
  244. {
  245. struct dentry *d_tracing;
  246. d_tracing = tracing_init_dentry();
  247. stat_dir = debugfs_create_dir("trace_stat", d_tracing);
  248. if (!stat_dir)
  249. pr_warning("Could not create debugfs "
  250. "'trace_stat' entry\n");
  251. return 0;
  252. }
  253. static int init_stat_file(struct stat_session *session)
  254. {
  255. if (!stat_dir && tracing_stat_init())
  256. return -ENODEV;
  257. session->file = debugfs_create_file(session->ts->name, 0644,
  258. stat_dir,
  259. session, &tracing_stat_fops);
  260. if (!session->file)
  261. return -ENOMEM;
  262. return 0;
  263. }
  264. int register_stat_tracer(struct tracer_stat *trace)
  265. {
  266. struct stat_session *session, *node, *tmp;
  267. int ret;
  268. if (!trace)
  269. return -EINVAL;
  270. if (!trace->stat_start || !trace->stat_next || !trace->stat_show)
  271. return -EINVAL;
  272. /* Already registered? */
  273. mutex_lock(&all_stat_sessions_mutex);
  274. list_for_each_entry_safe(node, tmp, &all_stat_sessions, session_list) {
  275. if (node->ts == trace) {
  276. mutex_unlock(&all_stat_sessions_mutex);
  277. return -EINVAL;
  278. }
  279. }
  280. mutex_unlock(&all_stat_sessions_mutex);
  281. /* Init the session */
  282. session = kzalloc(sizeof(*session), GFP_KERNEL);
  283. if (!session)
  284. return -ENOMEM;
  285. session->ts = trace;
  286. INIT_LIST_HEAD(&session->session_list);
  287. mutex_init(&session->stat_mutex);
  288. ret = init_stat_file(session);
  289. if (ret) {
  290. destroy_session(session);
  291. return ret;
  292. }
  293. /* Register */
  294. mutex_lock(&all_stat_sessions_mutex);
  295. list_add_tail(&session->session_list, &all_stat_sessions);
  296. mutex_unlock(&all_stat_sessions_mutex);
  297. return 0;
  298. }
  299. void unregister_stat_tracer(struct tracer_stat *trace)
  300. {
  301. struct stat_session *node, *tmp;
  302. mutex_lock(&all_stat_sessions_mutex);
  303. list_for_each_entry_safe(node, tmp, &all_stat_sessions, session_list) {
  304. if (node->ts == trace) {
  305. list_del(&node->session_list);
  306. destroy_session(node);
  307. break;
  308. }
  309. }
  310. mutex_unlock(&all_stat_sessions_mutex);
  311. }