blktrace.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533
  1. /*
  2. * Copyright (C) 2006 Jens Axboe <axboe@kernel.dk>
  3. *
  4. * This program is free software; you can redistribute it and/or modify
  5. * it under the terms of the GNU General Public License version 2 as
  6. * published by the Free Software Foundation.
  7. *
  8. * This program is distributed in the hope that it will be useful,
  9. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  11. * GNU General Public License for more details.
  12. *
  13. * You should have received a copy of the GNU General Public License
  14. * along with this program; if not, write to the Free Software
  15. * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  16. *
  17. */
  18. #include <linux/kernel.h>
  19. #include <linux/blkdev.h>
  20. #include <linux/blktrace_api.h>
  21. #include <linux/percpu.h>
  22. #include <linux/init.h>
  23. #include <linux/mutex.h>
  24. #include <linux/debugfs.h>
  25. #include <linux/time.h>
  26. #include <asm/uaccess.h>
  27. static unsigned int blktrace_seq __read_mostly = 1;
  28. /*
  29. * Send out a notify message.
  30. */
  31. static void trace_note(struct blk_trace *bt, pid_t pid, int action,
  32. const void *data, size_t len)
  33. {
  34. struct blk_io_trace *t;
  35. t = relay_reserve(bt->rchan, sizeof(*t) + len);
  36. if (t) {
  37. const int cpu = smp_processor_id();
  38. t->magic = BLK_IO_TRACE_MAGIC | BLK_IO_TRACE_VERSION;
  39. t->time = ktime_to_ns(ktime_get());
  40. t->device = bt->dev;
  41. t->action = action;
  42. t->pid = pid;
  43. t->cpu = cpu;
  44. t->pdu_len = len;
  45. memcpy((void *) t + sizeof(*t), data, len);
  46. }
  47. }
  48. /*
  49. * Send out a notify for this process, if we haven't done so since a trace
  50. * started
  51. */
  52. static void trace_note_tsk(struct blk_trace *bt, struct task_struct *tsk)
  53. {
  54. tsk->btrace_seq = blktrace_seq;
  55. trace_note(bt, tsk->pid, BLK_TN_PROCESS, tsk->comm, sizeof(tsk->comm));
  56. }
  57. static void trace_note_time(struct blk_trace *bt)
  58. {
  59. struct timespec now;
  60. unsigned long flags;
  61. u32 words[2];
  62. getnstimeofday(&now);
  63. words[0] = now.tv_sec;
  64. words[1] = now.tv_nsec;
  65. local_irq_save(flags);
  66. trace_note(bt, 0, BLK_TN_TIMESTAMP, words, sizeof(words));
  67. local_irq_restore(flags);
  68. }
  69. void __trace_note_message(struct blk_trace *bt, const char *fmt, ...)
  70. {
  71. int n;
  72. va_list args;
  73. char *buf;
  74. preempt_disable();
  75. buf = per_cpu_ptr(bt->msg_data, smp_processor_id());
  76. va_start(args, fmt);
  77. n = vscnprintf(buf, BLK_TN_MAX_MSG, fmt, args);
  78. va_end(args);
  79. trace_note(bt, 0, BLK_TN_MESSAGE, buf, n);
  80. preempt_enable();
  81. }
  82. EXPORT_SYMBOL_GPL(__trace_note_message);
  83. static int act_log_check(struct blk_trace *bt, u32 what, sector_t sector,
  84. pid_t pid)
  85. {
  86. if (((bt->act_mask << BLK_TC_SHIFT) & what) == 0)
  87. return 1;
  88. if (sector < bt->start_lba || sector > bt->end_lba)
  89. return 1;
  90. if (bt->pid && pid != bt->pid)
  91. return 1;
  92. return 0;
  93. }
  94. /*
  95. * Data direction bit lookup
  96. */
  97. static u32 ddir_act[2] __read_mostly = { BLK_TC_ACT(BLK_TC_READ), BLK_TC_ACT(BLK_TC_WRITE) };
  98. /*
  99. * Bio action bits of interest
  100. */
  101. static u32 bio_act[9] __read_mostly = { 0, BLK_TC_ACT(BLK_TC_BARRIER), BLK_TC_ACT(BLK_TC_SYNC), 0, BLK_TC_ACT(BLK_TC_AHEAD), 0, 0, 0, BLK_TC_ACT(BLK_TC_META) };
  102. /*
  103. * More could be added as needed, taking care to increment the decrementer
  104. * to get correct indexing
  105. */
  106. #define trace_barrier_bit(rw) \
  107. (((rw) & (1 << BIO_RW_BARRIER)) >> (BIO_RW_BARRIER - 0))
  108. #define trace_sync_bit(rw) \
  109. (((rw) & (1 << BIO_RW_SYNC)) >> (BIO_RW_SYNC - 1))
  110. #define trace_ahead_bit(rw) \
  111. (((rw) & (1 << BIO_RW_AHEAD)) << (2 - BIO_RW_AHEAD))
  112. #define trace_meta_bit(rw) \
  113. (((rw) & (1 << BIO_RW_META)) >> (BIO_RW_META - 3))
  114. /*
  115. * The worker for the various blk_add_trace*() types. Fills out a
  116. * blk_io_trace structure and places it in a per-cpu subbuffer.
  117. */
  118. void __blk_add_trace(struct blk_trace *bt, sector_t sector, int bytes,
  119. int rw, u32 what, int error, int pdu_len, void *pdu_data)
  120. {
  121. struct task_struct *tsk = current;
  122. struct blk_io_trace *t;
  123. unsigned long flags;
  124. unsigned long *sequence;
  125. pid_t pid;
  126. int cpu;
  127. if (unlikely(bt->trace_state != Blktrace_running))
  128. return;
  129. what |= ddir_act[rw & WRITE];
  130. what |= bio_act[trace_barrier_bit(rw)];
  131. what |= bio_act[trace_sync_bit(rw)];
  132. what |= bio_act[trace_ahead_bit(rw)];
  133. what |= bio_act[trace_meta_bit(rw)];
  134. pid = tsk->pid;
  135. if (unlikely(act_log_check(bt, what, sector, pid)))
  136. return;
  137. /*
  138. * A word about the locking here - we disable interrupts to reserve
  139. * some space in the relay per-cpu buffer, to prevent an irq
  140. * from coming in and stepping on our toes. Once reserved, it's
  141. * enough to get preemption disabled to prevent read of this data
  142. * before we are through filling it. get_cpu()/put_cpu() does this
  143. * for us
  144. */
  145. local_irq_save(flags);
  146. if (unlikely(tsk->btrace_seq != blktrace_seq))
  147. trace_note_tsk(bt, tsk);
  148. t = relay_reserve(bt->rchan, sizeof(*t) + pdu_len);
  149. if (t) {
  150. cpu = smp_processor_id();
  151. sequence = per_cpu_ptr(bt->sequence, cpu);
  152. t->magic = BLK_IO_TRACE_MAGIC | BLK_IO_TRACE_VERSION;
  153. t->sequence = ++(*sequence);
  154. t->time = ktime_to_ns(ktime_get());
  155. t->sector = sector;
  156. t->bytes = bytes;
  157. t->action = what;
  158. t->pid = pid;
  159. t->device = bt->dev;
  160. t->cpu = cpu;
  161. t->error = error;
  162. t->pdu_len = pdu_len;
  163. if (pdu_len)
  164. memcpy((void *) t + sizeof(*t), pdu_data, pdu_len);
  165. }
  166. local_irq_restore(flags);
  167. }
  168. EXPORT_SYMBOL_GPL(__blk_add_trace);
  169. static struct dentry *blk_tree_root;
  170. static DEFINE_MUTEX(blk_tree_mutex);
  171. static unsigned int root_users;
  172. static inline void blk_remove_root(void)
  173. {
  174. if (blk_tree_root) {
  175. debugfs_remove(blk_tree_root);
  176. blk_tree_root = NULL;
  177. }
  178. }
  179. static void blk_remove_tree(struct dentry *dir)
  180. {
  181. mutex_lock(&blk_tree_mutex);
  182. debugfs_remove(dir);
  183. if (--root_users == 0)
  184. blk_remove_root();
  185. mutex_unlock(&blk_tree_mutex);
  186. }
  187. static struct dentry *blk_create_tree(const char *blk_name)
  188. {
  189. struct dentry *dir = NULL;
  190. int created = 0;
  191. mutex_lock(&blk_tree_mutex);
  192. if (!blk_tree_root) {
  193. blk_tree_root = debugfs_create_dir("block", NULL);
  194. if (!blk_tree_root)
  195. goto err;
  196. created = 1;
  197. }
  198. dir = debugfs_create_dir(blk_name, blk_tree_root);
  199. if (dir)
  200. root_users++;
  201. else {
  202. /* Delete root only if we created it */
  203. if (created)
  204. blk_remove_root();
  205. }
  206. err:
  207. mutex_unlock(&blk_tree_mutex);
  208. return dir;
  209. }
  210. static void blk_trace_cleanup(struct blk_trace *bt)
  211. {
  212. relay_close(bt->rchan);
  213. debugfs_remove(bt->dropped_file);
  214. blk_remove_tree(bt->dir);
  215. free_percpu(bt->sequence);
  216. free_percpu(bt->msg_data);
  217. kfree(bt);
  218. }
  219. int blk_trace_remove(struct request_queue *q)
  220. {
  221. struct blk_trace *bt;
  222. bt = xchg(&q->blk_trace, NULL);
  223. if (!bt)
  224. return -EINVAL;
  225. if (bt->trace_state == Blktrace_setup ||
  226. bt->trace_state == Blktrace_stopped)
  227. blk_trace_cleanup(bt);
  228. return 0;
  229. }
  230. EXPORT_SYMBOL_GPL(blk_trace_remove);
  231. static int blk_dropped_open(struct inode *inode, struct file *filp)
  232. {
  233. filp->private_data = inode->i_private;
  234. return 0;
  235. }
  236. static ssize_t blk_dropped_read(struct file *filp, char __user *buffer,
  237. size_t count, loff_t *ppos)
  238. {
  239. struct blk_trace *bt = filp->private_data;
  240. char buf[16];
  241. snprintf(buf, sizeof(buf), "%u\n", atomic_read(&bt->dropped));
  242. return simple_read_from_buffer(buffer, count, ppos, buf, strlen(buf));
  243. }
  244. static const struct file_operations blk_dropped_fops = {
  245. .owner = THIS_MODULE,
  246. .open = blk_dropped_open,
  247. .read = blk_dropped_read,
  248. };
  249. /*
  250. * Keep track of how many times we encountered a full subbuffer, to aid
  251. * the user space app in telling how many lost events there were.
  252. */
  253. static int blk_subbuf_start_callback(struct rchan_buf *buf, void *subbuf,
  254. void *prev_subbuf, size_t prev_padding)
  255. {
  256. struct blk_trace *bt;
  257. if (!relay_buf_full(buf))
  258. return 1;
  259. bt = buf->chan->private_data;
  260. atomic_inc(&bt->dropped);
  261. return 0;
  262. }
  263. static int blk_remove_buf_file_callback(struct dentry *dentry)
  264. {
  265. debugfs_remove(dentry);
  266. return 0;
  267. }
  268. static struct dentry *blk_create_buf_file_callback(const char *filename,
  269. struct dentry *parent,
  270. int mode,
  271. struct rchan_buf *buf,
  272. int *is_global)
  273. {
  274. return debugfs_create_file(filename, mode, parent, buf,
  275. &relay_file_operations);
  276. }
  277. static struct rchan_callbacks blk_relay_callbacks = {
  278. .subbuf_start = blk_subbuf_start_callback,
  279. .create_buf_file = blk_create_buf_file_callback,
  280. .remove_buf_file = blk_remove_buf_file_callback,
  281. };
  282. /*
  283. * Setup everything required to start tracing
  284. */
  285. int do_blk_trace_setup(struct request_queue *q, char *name, dev_t dev,
  286. struct blk_user_trace_setup *buts)
  287. {
  288. struct blk_trace *old_bt, *bt = NULL;
  289. struct dentry *dir = NULL;
  290. int ret, i;
  291. if (!buts->buf_size || !buts->buf_nr)
  292. return -EINVAL;
  293. strcpy(buts->name, name);
  294. /*
  295. * some device names have larger paths - convert the slashes
  296. * to underscores for this to work as expected
  297. */
  298. for (i = 0; i < strlen(buts->name); i++)
  299. if (buts->name[i] == '/')
  300. buts->name[i] = '_';
  301. ret = -ENOMEM;
  302. bt = kzalloc(sizeof(*bt), GFP_KERNEL);
  303. if (!bt)
  304. goto err;
  305. bt->sequence = alloc_percpu(unsigned long);
  306. if (!bt->sequence)
  307. goto err;
  308. bt->msg_data = __alloc_percpu(BLK_TN_MAX_MSG);
  309. if (!bt->msg_data)
  310. goto err;
  311. ret = -ENOENT;
  312. dir = blk_create_tree(buts->name);
  313. if (!dir)
  314. goto err;
  315. bt->dir = dir;
  316. bt->dev = dev;
  317. atomic_set(&bt->dropped, 0);
  318. ret = -EIO;
  319. bt->dropped_file = debugfs_create_file("dropped", 0444, dir, bt, &blk_dropped_fops);
  320. if (!bt->dropped_file)
  321. goto err;
  322. bt->rchan = relay_open("trace", dir, buts->buf_size,
  323. buts->buf_nr, &blk_relay_callbacks, bt);
  324. if (!bt->rchan)
  325. goto err;
  326. bt->act_mask = buts->act_mask;
  327. if (!bt->act_mask)
  328. bt->act_mask = (u16) -1;
  329. bt->start_lba = buts->start_lba;
  330. bt->end_lba = buts->end_lba;
  331. if (!bt->end_lba)
  332. bt->end_lba = -1ULL;
  333. bt->pid = buts->pid;
  334. bt->trace_state = Blktrace_setup;
  335. ret = -EBUSY;
  336. old_bt = xchg(&q->blk_trace, bt);
  337. if (old_bt) {
  338. (void) xchg(&q->blk_trace, old_bt);
  339. goto err;
  340. }
  341. return 0;
  342. err:
  343. if (dir)
  344. blk_remove_tree(dir);
  345. if (bt) {
  346. if (bt->dropped_file)
  347. debugfs_remove(bt->dropped_file);
  348. free_percpu(bt->sequence);
  349. free_percpu(bt->msg_data);
  350. if (bt->rchan)
  351. relay_close(bt->rchan);
  352. kfree(bt);
  353. }
  354. return ret;
  355. }
  356. int blk_trace_setup(struct request_queue *q, char *name, dev_t dev,
  357. char __user *arg)
  358. {
  359. struct blk_user_trace_setup buts;
  360. int ret;
  361. ret = copy_from_user(&buts, arg, sizeof(buts));
  362. if (ret)
  363. return -EFAULT;
  364. ret = do_blk_trace_setup(q, name, dev, &buts);
  365. if (ret)
  366. return ret;
  367. if (copy_to_user(arg, &buts, sizeof(buts)))
  368. return -EFAULT;
  369. return 0;
  370. }
  371. EXPORT_SYMBOL_GPL(blk_trace_setup);
  372. int blk_trace_startstop(struct request_queue *q, int start)
  373. {
  374. struct blk_trace *bt;
  375. int ret;
  376. if ((bt = q->blk_trace) == NULL)
  377. return -EINVAL;
  378. /*
  379. * For starting a trace, we can transition from a setup or stopped
  380. * trace. For stopping a trace, the state must be running
  381. */
  382. ret = -EINVAL;
  383. if (start) {
  384. if (bt->trace_state == Blktrace_setup ||
  385. bt->trace_state == Blktrace_stopped) {
  386. blktrace_seq++;
  387. smp_mb();
  388. bt->trace_state = Blktrace_running;
  389. trace_note_time(bt);
  390. ret = 0;
  391. }
  392. } else {
  393. if (bt->trace_state == Blktrace_running) {
  394. bt->trace_state = Blktrace_stopped;
  395. relay_flush(bt->rchan);
  396. ret = 0;
  397. }
  398. }
  399. return ret;
  400. }
  401. EXPORT_SYMBOL_GPL(blk_trace_startstop);
  402. /**
  403. * blk_trace_ioctl: - handle the ioctls associated with tracing
  404. * @bdev: the block device
  405. * @cmd: the ioctl cmd
  406. * @arg: the argument data, if any
  407. *
  408. **/
  409. int blk_trace_ioctl(struct block_device *bdev, unsigned cmd, char __user *arg)
  410. {
  411. struct request_queue *q;
  412. int ret, start = 0;
  413. char b[BDEVNAME_SIZE];
  414. q = bdev_get_queue(bdev);
  415. if (!q)
  416. return -ENXIO;
  417. mutex_lock(&bdev->bd_mutex);
  418. switch (cmd) {
  419. case BLKTRACESETUP:
  420. bdevname(bdev, b);
  421. ret = blk_trace_setup(q, b, bdev->bd_dev, arg);
  422. break;
  423. case BLKTRACESTART:
  424. start = 1;
  425. case BLKTRACESTOP:
  426. ret = blk_trace_startstop(q, start);
  427. break;
  428. case BLKTRACETEARDOWN:
  429. ret = blk_trace_remove(q);
  430. break;
  431. default:
  432. ret = -ENOTTY;
  433. break;
  434. }
  435. mutex_unlock(&bdev->bd_mutex);
  436. return ret;
  437. }
  438. /**
  439. * blk_trace_shutdown: - stop and cleanup trace structures
  440. * @q: the request queue associated with the device
  441. *
  442. **/
  443. void blk_trace_shutdown(struct request_queue *q)
  444. {
  445. if (q->blk_trace) {
  446. blk_trace_startstop(q, 0);
  447. blk_trace_remove(q);
  448. }
  449. }