blktrace.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576
  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. unsigned long flags;
  74. char *buf;
  75. local_irq_save(flags);
  76. buf = per_cpu_ptr(bt->msg_data, smp_processor_id());
  77. va_start(args, fmt);
  78. n = vscnprintf(buf, BLK_TN_MAX_MSG, fmt, args);
  79. va_end(args);
  80. trace_note(bt, 0, BLK_TN_MESSAGE, buf, n);
  81. local_irq_restore(flags);
  82. }
  83. EXPORT_SYMBOL_GPL(__trace_note_message);
  84. static int act_log_check(struct blk_trace *bt, u32 what, sector_t sector,
  85. pid_t pid)
  86. {
  87. if (((bt->act_mask << BLK_TC_SHIFT) & what) == 0)
  88. return 1;
  89. if (sector < bt->start_lba || sector > bt->end_lba)
  90. return 1;
  91. if (bt->pid && pid != bt->pid)
  92. return 1;
  93. return 0;
  94. }
  95. /*
  96. * Data direction bit lookup
  97. */
  98. static u32 ddir_act[2] __read_mostly = { BLK_TC_ACT(BLK_TC_READ), BLK_TC_ACT(BLK_TC_WRITE) };
  99. /*
  100. * Bio action bits of interest
  101. */
  102. 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) };
  103. /*
  104. * More could be added as needed, taking care to increment the decrementer
  105. * to get correct indexing
  106. */
  107. #define trace_barrier_bit(rw) \
  108. (((rw) & (1 << BIO_RW_BARRIER)) >> (BIO_RW_BARRIER - 0))
  109. #define trace_sync_bit(rw) \
  110. (((rw) & (1 << BIO_RW_SYNC)) >> (BIO_RW_SYNC - 1))
  111. #define trace_ahead_bit(rw) \
  112. (((rw) & (1 << BIO_RW_AHEAD)) << (2 - BIO_RW_AHEAD))
  113. #define trace_meta_bit(rw) \
  114. (((rw) & (1 << BIO_RW_META)) >> (BIO_RW_META - 3))
  115. /*
  116. * The worker for the various blk_add_trace*() types. Fills out a
  117. * blk_io_trace structure and places it in a per-cpu subbuffer.
  118. */
  119. void __blk_add_trace(struct blk_trace *bt, sector_t sector, int bytes,
  120. int rw, u32 what, int error, int pdu_len, void *pdu_data)
  121. {
  122. struct task_struct *tsk = current;
  123. struct blk_io_trace *t;
  124. unsigned long flags;
  125. unsigned long *sequence;
  126. pid_t pid;
  127. int cpu;
  128. if (unlikely(bt->trace_state != Blktrace_running))
  129. return;
  130. what |= ddir_act[rw & WRITE];
  131. what |= bio_act[trace_barrier_bit(rw)];
  132. what |= bio_act[trace_sync_bit(rw)];
  133. what |= bio_act[trace_ahead_bit(rw)];
  134. what |= bio_act[trace_meta_bit(rw)];
  135. pid = tsk->pid;
  136. if (unlikely(act_log_check(bt, what, sector, pid)))
  137. return;
  138. /*
  139. * A word about the locking here - we disable interrupts to reserve
  140. * some space in the relay per-cpu buffer, to prevent an irq
  141. * from coming in and stepping on our toes.
  142. */
  143. local_irq_save(flags);
  144. if (unlikely(tsk->btrace_seq != blktrace_seq))
  145. trace_note_tsk(bt, tsk);
  146. t = relay_reserve(bt->rchan, sizeof(*t) + pdu_len);
  147. if (t) {
  148. cpu = smp_processor_id();
  149. sequence = per_cpu_ptr(bt->sequence, cpu);
  150. t->magic = BLK_IO_TRACE_MAGIC | BLK_IO_TRACE_VERSION;
  151. t->sequence = ++(*sequence);
  152. t->time = ktime_to_ns(ktime_get());
  153. t->sector = sector;
  154. t->bytes = bytes;
  155. t->action = what;
  156. t->pid = pid;
  157. t->device = bt->dev;
  158. t->cpu = cpu;
  159. t->error = error;
  160. t->pdu_len = pdu_len;
  161. if (pdu_len)
  162. memcpy((void *) t + sizeof(*t), pdu_data, pdu_len);
  163. }
  164. local_irq_restore(flags);
  165. }
  166. EXPORT_SYMBOL_GPL(__blk_add_trace);
  167. static struct dentry *blk_tree_root;
  168. static DEFINE_MUTEX(blk_tree_mutex);
  169. static unsigned int root_users;
  170. static inline void blk_remove_root(void)
  171. {
  172. if (blk_tree_root) {
  173. debugfs_remove(blk_tree_root);
  174. blk_tree_root = NULL;
  175. }
  176. }
  177. static void blk_remove_tree(struct dentry *dir)
  178. {
  179. mutex_lock(&blk_tree_mutex);
  180. debugfs_remove(dir);
  181. if (--root_users == 0)
  182. blk_remove_root();
  183. mutex_unlock(&blk_tree_mutex);
  184. }
  185. static struct dentry *blk_create_tree(const char *blk_name)
  186. {
  187. struct dentry *dir = NULL;
  188. int created = 0;
  189. mutex_lock(&blk_tree_mutex);
  190. if (!blk_tree_root) {
  191. blk_tree_root = debugfs_create_dir("block", NULL);
  192. if (!blk_tree_root)
  193. goto err;
  194. created = 1;
  195. }
  196. dir = debugfs_create_dir(blk_name, blk_tree_root);
  197. if (dir)
  198. root_users++;
  199. else {
  200. /* Delete root only if we created it */
  201. if (created)
  202. blk_remove_root();
  203. }
  204. err:
  205. mutex_unlock(&blk_tree_mutex);
  206. return dir;
  207. }
  208. static void blk_trace_cleanup(struct blk_trace *bt)
  209. {
  210. relay_close(bt->rchan);
  211. debugfs_remove(bt->msg_file);
  212. debugfs_remove(bt->dropped_file);
  213. blk_remove_tree(bt->dir);
  214. free_percpu(bt->sequence);
  215. free_percpu(bt->msg_data);
  216. kfree(bt);
  217. }
  218. int blk_trace_remove(struct request_queue *q)
  219. {
  220. struct blk_trace *bt;
  221. bt = xchg(&q->blk_trace, NULL);
  222. if (!bt)
  223. return -EINVAL;
  224. if (bt->trace_state == Blktrace_setup ||
  225. bt->trace_state == Blktrace_stopped)
  226. blk_trace_cleanup(bt);
  227. return 0;
  228. }
  229. EXPORT_SYMBOL_GPL(blk_trace_remove);
  230. static int blk_dropped_open(struct inode *inode, struct file *filp)
  231. {
  232. filp->private_data = inode->i_private;
  233. return 0;
  234. }
  235. static ssize_t blk_dropped_read(struct file *filp, char __user *buffer,
  236. size_t count, loff_t *ppos)
  237. {
  238. struct blk_trace *bt = filp->private_data;
  239. char buf[16];
  240. snprintf(buf, sizeof(buf), "%u\n", atomic_read(&bt->dropped));
  241. return simple_read_from_buffer(buffer, count, ppos, buf, strlen(buf));
  242. }
  243. static const struct file_operations blk_dropped_fops = {
  244. .owner = THIS_MODULE,
  245. .open = blk_dropped_open,
  246. .read = blk_dropped_read,
  247. };
  248. static int blk_msg_open(struct inode *inode, struct file *filp)
  249. {
  250. filp->private_data = inode->i_private;
  251. return 0;
  252. }
  253. static ssize_t blk_msg_write(struct file *filp, const char __user *buffer,
  254. size_t count, loff_t *ppos)
  255. {
  256. char *msg;
  257. struct blk_trace *bt;
  258. if (count > BLK_TN_MAX_MSG)
  259. return -EINVAL;
  260. msg = kmalloc(count, GFP_KERNEL);
  261. if (msg == NULL)
  262. return -ENOMEM;
  263. if (copy_from_user(msg, buffer, count)) {
  264. kfree(msg);
  265. return -EFAULT;
  266. }
  267. bt = filp->private_data;
  268. __trace_note_message(bt, "%s", msg);
  269. kfree(msg);
  270. return count;
  271. }
  272. static const struct file_operations blk_msg_fops = {
  273. .owner = THIS_MODULE,
  274. .open = blk_msg_open,
  275. .write = blk_msg_write,
  276. };
  277. /*
  278. * Keep track of how many times we encountered a full subbuffer, to aid
  279. * the user space app in telling how many lost events there were.
  280. */
  281. static int blk_subbuf_start_callback(struct rchan_buf *buf, void *subbuf,
  282. void *prev_subbuf, size_t prev_padding)
  283. {
  284. struct blk_trace *bt;
  285. if (!relay_buf_full(buf))
  286. return 1;
  287. bt = buf->chan->private_data;
  288. atomic_inc(&bt->dropped);
  289. return 0;
  290. }
  291. static int blk_remove_buf_file_callback(struct dentry *dentry)
  292. {
  293. debugfs_remove(dentry);
  294. return 0;
  295. }
  296. static struct dentry *blk_create_buf_file_callback(const char *filename,
  297. struct dentry *parent,
  298. int mode,
  299. struct rchan_buf *buf,
  300. int *is_global)
  301. {
  302. return debugfs_create_file(filename, mode, parent, buf,
  303. &relay_file_operations);
  304. }
  305. static struct rchan_callbacks blk_relay_callbacks = {
  306. .subbuf_start = blk_subbuf_start_callback,
  307. .create_buf_file = blk_create_buf_file_callback,
  308. .remove_buf_file = blk_remove_buf_file_callback,
  309. };
  310. /*
  311. * Setup everything required to start tracing
  312. */
  313. int do_blk_trace_setup(struct request_queue *q, char *name, dev_t dev,
  314. struct blk_user_trace_setup *buts)
  315. {
  316. struct blk_trace *old_bt, *bt = NULL;
  317. struct dentry *dir = NULL;
  318. int ret, i;
  319. if (!buts->buf_size || !buts->buf_nr)
  320. return -EINVAL;
  321. strcpy(buts->name, name);
  322. /*
  323. * some device names have larger paths - convert the slashes
  324. * to underscores for this to work as expected
  325. */
  326. for (i = 0; i < strlen(buts->name); i++)
  327. if (buts->name[i] == '/')
  328. buts->name[i] = '_';
  329. ret = -ENOMEM;
  330. bt = kzalloc(sizeof(*bt), GFP_KERNEL);
  331. if (!bt)
  332. goto err;
  333. bt->sequence = alloc_percpu(unsigned long);
  334. if (!bt->sequence)
  335. goto err;
  336. bt->msg_data = __alloc_percpu(BLK_TN_MAX_MSG);
  337. if (!bt->msg_data)
  338. goto err;
  339. ret = -ENOENT;
  340. dir = blk_create_tree(buts->name);
  341. if (!dir)
  342. goto err;
  343. bt->dir = dir;
  344. bt->dev = dev;
  345. atomic_set(&bt->dropped, 0);
  346. ret = -EIO;
  347. bt->dropped_file = debugfs_create_file("dropped", 0444, dir, bt, &blk_dropped_fops);
  348. if (!bt->dropped_file)
  349. goto err;
  350. bt->msg_file = debugfs_create_file("msg", 0222, dir, bt, &blk_msg_fops);
  351. if (!bt->msg_file)
  352. goto err;
  353. bt->rchan = relay_open("trace", dir, buts->buf_size,
  354. buts->buf_nr, &blk_relay_callbacks, bt);
  355. if (!bt->rchan)
  356. goto err;
  357. bt->act_mask = buts->act_mask;
  358. if (!bt->act_mask)
  359. bt->act_mask = (u16) -1;
  360. bt->start_lba = buts->start_lba;
  361. bt->end_lba = buts->end_lba;
  362. if (!bt->end_lba)
  363. bt->end_lba = -1ULL;
  364. bt->pid = buts->pid;
  365. bt->trace_state = Blktrace_setup;
  366. ret = -EBUSY;
  367. old_bt = xchg(&q->blk_trace, bt);
  368. if (old_bt) {
  369. (void) xchg(&q->blk_trace, old_bt);
  370. goto err;
  371. }
  372. return 0;
  373. err:
  374. if (dir)
  375. blk_remove_tree(dir);
  376. if (bt) {
  377. if (bt->msg_file)
  378. debugfs_remove(bt->msg_file);
  379. if (bt->dropped_file)
  380. debugfs_remove(bt->dropped_file);
  381. free_percpu(bt->sequence);
  382. free_percpu(bt->msg_data);
  383. if (bt->rchan)
  384. relay_close(bt->rchan);
  385. kfree(bt);
  386. }
  387. return ret;
  388. }
  389. int blk_trace_setup(struct request_queue *q, char *name, dev_t dev,
  390. char __user *arg)
  391. {
  392. struct blk_user_trace_setup buts;
  393. int ret;
  394. ret = copy_from_user(&buts, arg, sizeof(buts));
  395. if (ret)
  396. return -EFAULT;
  397. ret = do_blk_trace_setup(q, name, dev, &buts);
  398. if (ret)
  399. return ret;
  400. if (copy_to_user(arg, &buts, sizeof(buts)))
  401. return -EFAULT;
  402. return 0;
  403. }
  404. EXPORT_SYMBOL_GPL(blk_trace_setup);
  405. int blk_trace_startstop(struct request_queue *q, int start)
  406. {
  407. struct blk_trace *bt;
  408. int ret;
  409. if ((bt = q->blk_trace) == NULL)
  410. return -EINVAL;
  411. /*
  412. * For starting a trace, we can transition from a setup or stopped
  413. * trace. For stopping a trace, the state must be running
  414. */
  415. ret = -EINVAL;
  416. if (start) {
  417. if (bt->trace_state == Blktrace_setup ||
  418. bt->trace_state == Blktrace_stopped) {
  419. blktrace_seq++;
  420. smp_mb();
  421. bt->trace_state = Blktrace_running;
  422. trace_note_time(bt);
  423. ret = 0;
  424. }
  425. } else {
  426. if (bt->trace_state == Blktrace_running) {
  427. bt->trace_state = Blktrace_stopped;
  428. relay_flush(bt->rchan);
  429. ret = 0;
  430. }
  431. }
  432. return ret;
  433. }
  434. EXPORT_SYMBOL_GPL(blk_trace_startstop);
  435. /**
  436. * blk_trace_ioctl: - handle the ioctls associated with tracing
  437. * @bdev: the block device
  438. * @cmd: the ioctl cmd
  439. * @arg: the argument data, if any
  440. *
  441. **/
  442. int blk_trace_ioctl(struct block_device *bdev, unsigned cmd, char __user *arg)
  443. {
  444. struct request_queue *q;
  445. int ret, start = 0;
  446. char b[BDEVNAME_SIZE];
  447. q = bdev_get_queue(bdev);
  448. if (!q)
  449. return -ENXIO;
  450. mutex_lock(&bdev->bd_mutex);
  451. switch (cmd) {
  452. case BLKTRACESETUP:
  453. bdevname(bdev, b);
  454. ret = blk_trace_setup(q, b, bdev->bd_dev, arg);
  455. break;
  456. case BLKTRACESTART:
  457. start = 1;
  458. case BLKTRACESTOP:
  459. ret = blk_trace_startstop(q, start);
  460. break;
  461. case BLKTRACETEARDOWN:
  462. ret = blk_trace_remove(q);
  463. break;
  464. default:
  465. ret = -ENOTTY;
  466. break;
  467. }
  468. mutex_unlock(&bdev->bd_mutex);
  469. return ret;
  470. }
  471. /**
  472. * blk_trace_shutdown: - stop and cleanup trace structures
  473. * @q: the request queue associated with the device
  474. *
  475. **/
  476. void blk_trace_shutdown(struct request_queue *q)
  477. {
  478. if (q->blk_trace) {
  479. blk_trace_startstop(q, 0);
  480. blk_trace_remove(q);
  481. }
  482. }