bcache.h 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461
  1. #undef TRACE_SYSTEM
  2. #define TRACE_SYSTEM bcache
  3. #if !defined(_TRACE_BCACHE_H) || defined(TRACE_HEADER_MULTI_READ)
  4. #define _TRACE_BCACHE_H
  5. #include <linux/tracepoint.h>
  6. DECLARE_EVENT_CLASS(bcache_request,
  7. TP_PROTO(struct bcache_device *d, struct bio *bio),
  8. TP_ARGS(d, bio),
  9. TP_STRUCT__entry(
  10. __field(dev_t, dev )
  11. __field(unsigned int, orig_major )
  12. __field(unsigned int, orig_minor )
  13. __field(sector_t, sector )
  14. __field(dev_t, orig_sector )
  15. __field(unsigned int, nr_sector )
  16. __array(char, rwbs, 6 )
  17. ),
  18. TP_fast_assign(
  19. __entry->dev = bio->bi_bdev->bd_dev;
  20. __entry->orig_major = d->disk->major;
  21. __entry->orig_minor = d->disk->first_minor;
  22. __entry->sector = bio->bi_sector;
  23. __entry->orig_sector = bio->bi_sector - 16;
  24. __entry->nr_sector = bio->bi_size >> 9;
  25. blk_fill_rwbs(__entry->rwbs, bio->bi_rw, bio->bi_size);
  26. ),
  27. TP_printk("%d,%d %s %llu + %u (from %d,%d @ %llu)",
  28. MAJOR(__entry->dev), MINOR(__entry->dev),
  29. __entry->rwbs, (unsigned long long)__entry->sector,
  30. __entry->nr_sector, __entry->orig_major, __entry->orig_minor,
  31. (unsigned long long)__entry->orig_sector)
  32. );
  33. DECLARE_EVENT_CLASS(bkey,
  34. TP_PROTO(struct bkey *k),
  35. TP_ARGS(k),
  36. TP_STRUCT__entry(
  37. __field(u32, size )
  38. __field(u32, inode )
  39. __field(u64, offset )
  40. __field(bool, dirty )
  41. ),
  42. TP_fast_assign(
  43. __entry->inode = KEY_INODE(k);
  44. __entry->offset = KEY_OFFSET(k);
  45. __entry->size = KEY_SIZE(k);
  46. __entry->dirty = KEY_DIRTY(k);
  47. ),
  48. TP_printk("%u:%llu len %u dirty %u", __entry->inode,
  49. __entry->offset, __entry->size, __entry->dirty)
  50. );
  51. DECLARE_EVENT_CLASS(btree_node,
  52. TP_PROTO(struct btree *b),
  53. TP_ARGS(b),
  54. TP_STRUCT__entry(
  55. __field(size_t, bucket )
  56. ),
  57. TP_fast_assign(
  58. __entry->bucket = PTR_BUCKET_NR(b->c, &b->key, 0);
  59. ),
  60. TP_printk("bucket %zu", __entry->bucket)
  61. );
  62. /* request.c */
  63. DEFINE_EVENT(bcache_request, bcache_request_start,
  64. TP_PROTO(struct bcache_device *d, struct bio *bio),
  65. TP_ARGS(d, bio)
  66. );
  67. DEFINE_EVENT(bcache_request, bcache_request_end,
  68. TP_PROTO(struct bcache_device *d, struct bio *bio),
  69. TP_ARGS(d, bio)
  70. );
  71. DECLARE_EVENT_CLASS(bcache_bio,
  72. TP_PROTO(struct bio *bio),
  73. TP_ARGS(bio),
  74. TP_STRUCT__entry(
  75. __field(dev_t, dev )
  76. __field(sector_t, sector )
  77. __field(unsigned int, nr_sector )
  78. __array(char, rwbs, 6 )
  79. ),
  80. TP_fast_assign(
  81. __entry->dev = bio->bi_bdev->bd_dev;
  82. __entry->sector = bio->bi_sector;
  83. __entry->nr_sector = bio->bi_size >> 9;
  84. blk_fill_rwbs(__entry->rwbs, bio->bi_rw, bio->bi_size);
  85. ),
  86. TP_printk("%d,%d %s %llu + %u",
  87. MAJOR(__entry->dev), MINOR(__entry->dev), __entry->rwbs,
  88. (unsigned long long)__entry->sector, __entry->nr_sector)
  89. );
  90. DEFINE_EVENT(bcache_bio, bcache_bypass_sequential,
  91. TP_PROTO(struct bio *bio),
  92. TP_ARGS(bio)
  93. );
  94. DEFINE_EVENT(bcache_bio, bcache_bypass_congested,
  95. TP_PROTO(struct bio *bio),
  96. TP_ARGS(bio)
  97. );
  98. TRACE_EVENT(bcache_read,
  99. TP_PROTO(struct bio *bio, bool hit, bool bypass),
  100. TP_ARGS(bio, hit, bypass),
  101. TP_STRUCT__entry(
  102. __field(dev_t, dev )
  103. __field(sector_t, sector )
  104. __field(unsigned int, nr_sector )
  105. __array(char, rwbs, 6 )
  106. __field(bool, cache_hit )
  107. __field(bool, bypass )
  108. ),
  109. TP_fast_assign(
  110. __entry->dev = bio->bi_bdev->bd_dev;
  111. __entry->sector = bio->bi_sector;
  112. __entry->nr_sector = bio->bi_size >> 9;
  113. blk_fill_rwbs(__entry->rwbs, bio->bi_rw, bio->bi_size);
  114. __entry->cache_hit = hit;
  115. __entry->bypass = bypass;
  116. ),
  117. TP_printk("%d,%d %s %llu + %u hit %u bypass %u",
  118. MAJOR(__entry->dev), MINOR(__entry->dev),
  119. __entry->rwbs, (unsigned long long)__entry->sector,
  120. __entry->nr_sector, __entry->cache_hit, __entry->bypass)
  121. );
  122. TRACE_EVENT(bcache_write,
  123. TP_PROTO(struct bio *bio, bool writeback, bool bypass),
  124. TP_ARGS(bio, writeback, bypass),
  125. TP_STRUCT__entry(
  126. __field(dev_t, dev )
  127. __field(sector_t, sector )
  128. __field(unsigned int, nr_sector )
  129. __array(char, rwbs, 6 )
  130. __field(bool, writeback )
  131. __field(bool, bypass )
  132. ),
  133. TP_fast_assign(
  134. __entry->dev = bio->bi_bdev->bd_dev;
  135. __entry->sector = bio->bi_sector;
  136. __entry->nr_sector = bio->bi_size >> 9;
  137. blk_fill_rwbs(__entry->rwbs, bio->bi_rw, bio->bi_size);
  138. __entry->writeback = writeback;
  139. __entry->bypass = bypass;
  140. ),
  141. TP_printk("%d,%d %s %llu + %u hit %u bypass %u",
  142. MAJOR(__entry->dev), MINOR(__entry->dev),
  143. __entry->rwbs, (unsigned long long)__entry->sector,
  144. __entry->nr_sector, __entry->writeback, __entry->bypass)
  145. );
  146. DEFINE_EVENT(bcache_bio, bcache_read_retry,
  147. TP_PROTO(struct bio *bio),
  148. TP_ARGS(bio)
  149. );
  150. DEFINE_EVENT(bkey, bcache_cache_insert,
  151. TP_PROTO(struct bkey *k),
  152. TP_ARGS(k)
  153. );
  154. /* Journal */
  155. DECLARE_EVENT_CLASS(cache_set,
  156. TP_PROTO(struct cache_set *c),
  157. TP_ARGS(c),
  158. TP_STRUCT__entry(
  159. __array(char, uuid, 16 )
  160. ),
  161. TP_fast_assign(
  162. memcpy(__entry->uuid, c->sb.set_uuid, 16);
  163. ),
  164. TP_printk("%pU", __entry->uuid)
  165. );
  166. DEFINE_EVENT(bkey, bcache_journal_replay_key,
  167. TP_PROTO(struct bkey *k),
  168. TP_ARGS(k)
  169. );
  170. DEFINE_EVENT(cache_set, bcache_journal_full,
  171. TP_PROTO(struct cache_set *c),
  172. TP_ARGS(c)
  173. );
  174. DEFINE_EVENT(cache_set, bcache_journal_entry_full,
  175. TP_PROTO(struct cache_set *c),
  176. TP_ARGS(c)
  177. );
  178. DEFINE_EVENT(bcache_bio, bcache_journal_write,
  179. TP_PROTO(struct bio *bio),
  180. TP_ARGS(bio)
  181. );
  182. /* Btree */
  183. DEFINE_EVENT(cache_set, bcache_btree_cache_cannibalize,
  184. TP_PROTO(struct cache_set *c),
  185. TP_ARGS(c)
  186. );
  187. DEFINE_EVENT(btree_node, bcache_btree_read,
  188. TP_PROTO(struct btree *b),
  189. TP_ARGS(b)
  190. );
  191. TRACE_EVENT(bcache_btree_write,
  192. TP_PROTO(struct btree *b),
  193. TP_ARGS(b),
  194. TP_STRUCT__entry(
  195. __field(size_t, bucket )
  196. __field(unsigned, block )
  197. __field(unsigned, keys )
  198. ),
  199. TP_fast_assign(
  200. __entry->bucket = PTR_BUCKET_NR(b->c, &b->key, 0);
  201. __entry->block = b->written;
  202. __entry->keys = b->sets[b->nsets].data->keys;
  203. ),
  204. TP_printk("bucket %zu", __entry->bucket)
  205. );
  206. DEFINE_EVENT(btree_node, bcache_btree_node_alloc,
  207. TP_PROTO(struct btree *b),
  208. TP_ARGS(b)
  209. );
  210. DEFINE_EVENT(btree_node, bcache_btree_node_alloc_fail,
  211. TP_PROTO(struct btree *b),
  212. TP_ARGS(b)
  213. );
  214. DEFINE_EVENT(btree_node, bcache_btree_node_free,
  215. TP_PROTO(struct btree *b),
  216. TP_ARGS(b)
  217. );
  218. TRACE_EVENT(bcache_btree_gc_coalesce,
  219. TP_PROTO(unsigned nodes),
  220. TP_ARGS(nodes),
  221. TP_STRUCT__entry(
  222. __field(unsigned, nodes )
  223. ),
  224. TP_fast_assign(
  225. __entry->nodes = nodes;
  226. ),
  227. TP_printk("coalesced %u nodes", __entry->nodes)
  228. );
  229. DEFINE_EVENT(cache_set, bcache_gc_start,
  230. TP_PROTO(struct cache_set *c),
  231. TP_ARGS(c)
  232. );
  233. DEFINE_EVENT(cache_set, bcache_gc_end,
  234. TP_PROTO(struct cache_set *c),
  235. TP_ARGS(c)
  236. );
  237. DEFINE_EVENT(bkey, bcache_gc_copy,
  238. TP_PROTO(struct bkey *k),
  239. TP_ARGS(k)
  240. );
  241. DEFINE_EVENT(bkey, bcache_gc_copy_collision,
  242. TP_PROTO(struct bkey *k),
  243. TP_ARGS(k)
  244. );
  245. TRACE_EVENT(bcache_btree_insert_key,
  246. TP_PROTO(struct btree *b, struct bkey *k, unsigned op, unsigned status),
  247. TP_ARGS(b, k, op, status),
  248. TP_STRUCT__entry(
  249. __field(u64, btree_node )
  250. __field(u32, btree_level )
  251. __field(u32, inode )
  252. __field(u64, offset )
  253. __field(u32, size )
  254. __field(u8, dirty )
  255. __field(u8, op )
  256. __field(u8, status )
  257. ),
  258. TP_fast_assign(
  259. __entry->btree_node = PTR_BUCKET_NR(b->c, &b->key, 0);
  260. __entry->btree_level = b->level;
  261. __entry->inode = KEY_INODE(k);
  262. __entry->offset = KEY_OFFSET(k);
  263. __entry->size = KEY_SIZE(k);
  264. __entry->dirty = KEY_DIRTY(k);
  265. __entry->op = op;
  266. __entry->status = status;
  267. ),
  268. TP_printk("%u for %u at %llu(%u): %u:%llu len %u dirty %u",
  269. __entry->status, __entry->op,
  270. __entry->btree_node, __entry->btree_level,
  271. __entry->inode, __entry->offset,
  272. __entry->size, __entry->dirty)
  273. );
  274. DECLARE_EVENT_CLASS(btree_split,
  275. TP_PROTO(struct btree *b, unsigned keys),
  276. TP_ARGS(b, keys),
  277. TP_STRUCT__entry(
  278. __field(size_t, bucket )
  279. __field(unsigned, keys )
  280. ),
  281. TP_fast_assign(
  282. __entry->bucket = PTR_BUCKET_NR(b->c, &b->key, 0);
  283. __entry->keys = keys;
  284. ),
  285. TP_printk("bucket %zu keys %u", __entry->bucket, __entry->keys)
  286. );
  287. DEFINE_EVENT(btree_split, bcache_btree_node_split,
  288. TP_PROTO(struct btree *b, unsigned keys),
  289. TP_ARGS(b, keys)
  290. );
  291. DEFINE_EVENT(btree_split, bcache_btree_node_compact,
  292. TP_PROTO(struct btree *b, unsigned keys),
  293. TP_ARGS(b, keys)
  294. );
  295. DEFINE_EVENT(btree_node, bcache_btree_set_root,
  296. TP_PROTO(struct btree *b),
  297. TP_ARGS(b)
  298. );
  299. TRACE_EVENT(bcache_keyscan,
  300. TP_PROTO(unsigned nr_found,
  301. unsigned start_inode, uint64_t start_offset,
  302. unsigned end_inode, uint64_t end_offset),
  303. TP_ARGS(nr_found,
  304. start_inode, start_offset,
  305. end_inode, end_offset),
  306. TP_STRUCT__entry(
  307. __field(__u32, nr_found )
  308. __field(__u32, start_inode )
  309. __field(__u64, start_offset )
  310. __field(__u32, end_inode )
  311. __field(__u64, end_offset )
  312. ),
  313. TP_fast_assign(
  314. __entry->nr_found = nr_found;
  315. __entry->start_inode = start_inode;
  316. __entry->start_offset = start_offset;
  317. __entry->end_inode = end_inode;
  318. __entry->end_offset = end_offset;
  319. ),
  320. TP_printk("found %u keys from %u:%llu to %u:%llu", __entry->nr_found,
  321. __entry->start_inode, __entry->start_offset,
  322. __entry->end_inode, __entry->end_offset)
  323. );
  324. /* Allocator */
  325. TRACE_EVENT(bcache_alloc_invalidate,
  326. TP_PROTO(struct cache *ca),
  327. TP_ARGS(ca),
  328. TP_STRUCT__entry(
  329. __field(unsigned, free )
  330. __field(unsigned, free_inc )
  331. __field(unsigned, free_inc_size )
  332. __field(unsigned, unused )
  333. ),
  334. TP_fast_assign(
  335. __entry->free = fifo_used(&ca->free);
  336. __entry->free_inc = fifo_used(&ca->free_inc);
  337. __entry->free_inc_size = ca->free_inc.size;
  338. __entry->unused = fifo_used(&ca->unused);
  339. ),
  340. TP_printk("free %u free_inc %u/%u unused %u", __entry->free,
  341. __entry->free_inc, __entry->free_inc_size, __entry->unused)
  342. );
  343. TRACE_EVENT(bcache_alloc_fail,
  344. TP_PROTO(struct cache *ca),
  345. TP_ARGS(ca),
  346. TP_STRUCT__entry(
  347. __field(unsigned, free )
  348. __field(unsigned, free_inc )
  349. __field(unsigned, unused )
  350. __field(unsigned, blocked )
  351. ),
  352. TP_fast_assign(
  353. __entry->free = fifo_used(&ca->free);
  354. __entry->free_inc = fifo_used(&ca->free_inc);
  355. __entry->unused = fifo_used(&ca->unused);
  356. __entry->blocked = atomic_read(&ca->set->prio_blocked);
  357. ),
  358. TP_printk("free %u free_inc %u unused %u blocked %u", __entry->free,
  359. __entry->free_inc, __entry->unused, __entry->blocked)
  360. );
  361. /* Background writeback */
  362. DEFINE_EVENT(bkey, bcache_writeback,
  363. TP_PROTO(struct bkey *k),
  364. TP_ARGS(k)
  365. );
  366. DEFINE_EVENT(bkey, bcache_writeback_collision,
  367. TP_PROTO(struct bkey *k),
  368. TP_ARGS(k)
  369. );
  370. #endif /* _TRACE_BCACHE_H */
  371. /* This part must be outside protection */
  372. #include <trace/define_trace.h>