debug.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444
  1. /*
  2. * f2fs debugging statistics
  3. *
  4. * Copyright (c) 2012 Samsung Electronics Co., Ltd.
  5. * http://www.samsung.com/
  6. * Copyright (c) 2012 Linux Foundation
  7. * Copyright (c) 2012 Greg Kroah-Hartman <gregkh@linuxfoundation.org>
  8. *
  9. * This program is free software; you can redistribute it and/or modify
  10. * it under the terms of the GNU General Public License version 2 as
  11. * published by the Free Software Foundation.
  12. */
  13. #include <linux/fs.h>
  14. #include <linux/backing-dev.h>
  15. #include <linux/f2fs_fs.h>
  16. #include <linux/blkdev.h>
  17. #include <linux/debugfs.h>
  18. #include <linux/seq_file.h>
  19. #include "f2fs.h"
  20. #include "node.h"
  21. #include "segment.h"
  22. #include "gc.h"
  23. static LIST_HEAD(f2fs_stat_list);
  24. static struct dentry *f2fs_debugfs_root;
  25. static DEFINE_MUTEX(f2fs_stat_mutex);
  26. static void update_general_status(struct f2fs_sb_info *sbi)
  27. {
  28. struct f2fs_stat_info *si = F2FS_STAT(sbi);
  29. int i;
  30. /* validation check of the segment numbers */
  31. si->hit_largest = atomic64_read(&sbi->read_hit_largest);
  32. si->hit_cached = atomic64_read(&sbi->read_hit_cached);
  33. si->hit_rbtree = atomic64_read(&sbi->read_hit_rbtree);
  34. si->hit_total = si->hit_largest + si->hit_cached + si->hit_rbtree;
  35. si->total_ext = atomic64_read(&sbi->total_hit_ext);
  36. si->ext_tree = atomic_read(&sbi->total_ext_tree);
  37. si->zombie_tree = atomic_read(&sbi->total_zombie_tree);
  38. si->ext_node = atomic_read(&sbi->total_ext_node);
  39. si->ndirty_node = get_pages(sbi, F2FS_DIRTY_NODES);
  40. si->ndirty_dent = get_pages(sbi, F2FS_DIRTY_DENTS);
  41. si->ndirty_meta = get_pages(sbi, F2FS_DIRTY_META);
  42. si->ndirty_data = get_pages(sbi, F2FS_DIRTY_DATA);
  43. si->ndirty_dirs = sbi->ndirty_inode[DIR_INODE];
  44. si->ndirty_files = sbi->ndirty_inode[FILE_INODE];
  45. si->inmem_pages = get_pages(sbi, F2FS_INMEM_PAGES);
  46. si->wb_bios = atomic_read(&sbi->nr_wb_bios);
  47. si->total_count = (int)sbi->user_block_count / sbi->blocks_per_seg;
  48. si->rsvd_segs = reserved_segments(sbi);
  49. si->overp_segs = overprovision_segments(sbi);
  50. si->valid_count = valid_user_blocks(sbi);
  51. si->valid_node_count = valid_node_count(sbi);
  52. si->valid_inode_count = valid_inode_count(sbi);
  53. si->inline_xattr = atomic_read(&sbi->inline_xattr);
  54. si->inline_inode = atomic_read(&sbi->inline_inode);
  55. si->inline_dir = atomic_read(&sbi->inline_dir);
  56. si->orphans = sbi->im[ORPHAN_INO].ino_num;
  57. si->utilization = utilization(sbi);
  58. si->free_segs = free_segments(sbi);
  59. si->free_secs = free_sections(sbi);
  60. si->prefree_count = prefree_segments(sbi);
  61. si->dirty_count = dirty_segments(sbi);
  62. si->node_pages = NODE_MAPPING(sbi)->nrpages;
  63. si->meta_pages = META_MAPPING(sbi)->nrpages;
  64. si->nats = NM_I(sbi)->nat_cnt;
  65. si->dirty_nats = NM_I(sbi)->dirty_nat_cnt;
  66. si->sits = MAIN_SEGS(sbi);
  67. si->dirty_sits = SIT_I(sbi)->dirty_sentries;
  68. si->fnids = NM_I(sbi)->fcnt;
  69. si->bg_gc = sbi->bg_gc;
  70. si->util_free = (int)(free_user_blocks(sbi) >> sbi->log_blocks_per_seg)
  71. * 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
  72. / 2;
  73. si->util_valid = (int)(written_block_count(sbi) >>
  74. sbi->log_blocks_per_seg)
  75. * 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
  76. / 2;
  77. si->util_invalid = 50 - si->util_free - si->util_valid;
  78. for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_NODE; i++) {
  79. struct curseg_info *curseg = CURSEG_I(sbi, i);
  80. si->curseg[i] = curseg->segno;
  81. si->cursec[i] = curseg->segno / sbi->segs_per_sec;
  82. si->curzone[i] = si->cursec[i] / sbi->secs_per_zone;
  83. }
  84. for (i = 0; i < 2; i++) {
  85. si->segment_count[i] = sbi->segment_count[i];
  86. si->block_count[i] = sbi->block_count[i];
  87. }
  88. si->inplace_count = atomic_read(&sbi->inplace_count);
  89. }
  90. /*
  91. * This function calculates BDF of every segments
  92. */
  93. static void update_sit_info(struct f2fs_sb_info *sbi)
  94. {
  95. struct f2fs_stat_info *si = F2FS_STAT(sbi);
  96. unsigned long long blks_per_sec, hblks_per_sec, total_vblocks;
  97. unsigned long long bimodal, dist;
  98. unsigned int segno, vblocks;
  99. int ndirty = 0;
  100. bimodal = 0;
  101. total_vblocks = 0;
  102. blks_per_sec = sbi->segs_per_sec * sbi->blocks_per_seg;
  103. hblks_per_sec = blks_per_sec / 2;
  104. for (segno = 0; segno < MAIN_SEGS(sbi); segno += sbi->segs_per_sec) {
  105. vblocks = get_valid_blocks(sbi, segno, sbi->segs_per_sec);
  106. dist = abs(vblocks - hblks_per_sec);
  107. bimodal += dist * dist;
  108. if (vblocks > 0 && vblocks < blks_per_sec) {
  109. total_vblocks += vblocks;
  110. ndirty++;
  111. }
  112. }
  113. dist = div_u64(MAIN_SECS(sbi) * hblks_per_sec * hblks_per_sec, 100);
  114. si->bimodal = div64_u64(bimodal, dist);
  115. if (si->dirty_count)
  116. si->avg_vblocks = div_u64(total_vblocks, ndirty);
  117. else
  118. si->avg_vblocks = 0;
  119. }
  120. /*
  121. * This function calculates memory footprint.
  122. */
  123. static void update_mem_info(struct f2fs_sb_info *sbi)
  124. {
  125. struct f2fs_stat_info *si = F2FS_STAT(sbi);
  126. unsigned npages;
  127. int i;
  128. if (si->base_mem)
  129. goto get_cache;
  130. si->base_mem = sizeof(struct f2fs_sb_info) + sbi->sb->s_blocksize;
  131. si->base_mem += 2 * sizeof(struct f2fs_inode_info);
  132. si->base_mem += sizeof(*sbi->ckpt);
  133. si->base_mem += sizeof(struct percpu_counter) * NR_COUNT_TYPE;
  134. /* build sm */
  135. si->base_mem += sizeof(struct f2fs_sm_info);
  136. /* build sit */
  137. si->base_mem += sizeof(struct sit_info);
  138. si->base_mem += MAIN_SEGS(sbi) * sizeof(struct seg_entry);
  139. si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
  140. si->base_mem += 3 * SIT_VBLOCK_MAP_SIZE * MAIN_SEGS(sbi);
  141. si->base_mem += SIT_VBLOCK_MAP_SIZE;
  142. if (sbi->segs_per_sec > 1)
  143. si->base_mem += MAIN_SECS(sbi) * sizeof(struct sec_entry);
  144. si->base_mem += __bitmap_size(sbi, SIT_BITMAP);
  145. /* build free segmap */
  146. si->base_mem += sizeof(struct free_segmap_info);
  147. si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
  148. si->base_mem += f2fs_bitmap_size(MAIN_SECS(sbi));
  149. /* build curseg */
  150. si->base_mem += sizeof(struct curseg_info) * NR_CURSEG_TYPE;
  151. si->base_mem += PAGE_SIZE * NR_CURSEG_TYPE;
  152. /* build dirty segmap */
  153. si->base_mem += sizeof(struct dirty_seglist_info);
  154. si->base_mem += NR_DIRTY_TYPE * f2fs_bitmap_size(MAIN_SEGS(sbi));
  155. si->base_mem += f2fs_bitmap_size(MAIN_SECS(sbi));
  156. /* build nm */
  157. si->base_mem += sizeof(struct f2fs_nm_info);
  158. si->base_mem += __bitmap_size(sbi, NAT_BITMAP);
  159. get_cache:
  160. si->cache_mem = 0;
  161. /* build gc */
  162. if (sbi->gc_thread)
  163. si->cache_mem += sizeof(struct f2fs_gc_kthread);
  164. /* build merge flush thread */
  165. if (SM_I(sbi)->cmd_control_info)
  166. si->cache_mem += sizeof(struct flush_cmd_control);
  167. /* free nids */
  168. si->cache_mem += NM_I(sbi)->fcnt * sizeof(struct free_nid);
  169. si->cache_mem += NM_I(sbi)->nat_cnt * sizeof(struct nat_entry);
  170. si->cache_mem += NM_I(sbi)->dirty_nat_cnt *
  171. sizeof(struct nat_entry_set);
  172. si->cache_mem += si->inmem_pages * sizeof(struct inmem_pages);
  173. for (i = 0; i <= ORPHAN_INO; i++)
  174. si->cache_mem += sbi->im[i].ino_num * sizeof(struct ino_entry);
  175. si->cache_mem += atomic_read(&sbi->total_ext_tree) *
  176. sizeof(struct extent_tree);
  177. si->cache_mem += atomic_read(&sbi->total_ext_node) *
  178. sizeof(struct extent_node);
  179. si->page_mem = 0;
  180. npages = NODE_MAPPING(sbi)->nrpages;
  181. si->page_mem += (unsigned long long)npages << PAGE_SHIFT;
  182. npages = META_MAPPING(sbi)->nrpages;
  183. si->page_mem += (unsigned long long)npages << PAGE_SHIFT;
  184. }
  185. static int stat_show(struct seq_file *s, void *v)
  186. {
  187. struct f2fs_stat_info *si;
  188. int i = 0;
  189. int j;
  190. mutex_lock(&f2fs_stat_mutex);
  191. list_for_each_entry(si, &f2fs_stat_list, stat_list) {
  192. update_general_status(si->sbi);
  193. seq_printf(s, "\n=====[ partition info(%pg). #%d, %s]=====\n",
  194. si->sbi->sb->s_bdev, i++,
  195. f2fs_readonly(si->sbi->sb) ? "RO": "RW");
  196. seq_printf(s, "[SB: 1] [CP: 2] [SIT: %d] [NAT: %d] ",
  197. si->sit_area_segs, si->nat_area_segs);
  198. seq_printf(s, "[SSA: %d] [MAIN: %d",
  199. si->ssa_area_segs, si->main_area_segs);
  200. seq_printf(s, "(OverProv:%d Resv:%d)]\n\n",
  201. si->overp_segs, si->rsvd_segs);
  202. seq_printf(s, "Utilization: %d%% (%d valid blocks)\n",
  203. si->utilization, si->valid_count);
  204. seq_printf(s, " - Node: %u (Inode: %u, ",
  205. si->valid_node_count, si->valid_inode_count);
  206. seq_printf(s, "Other: %u)\n - Data: %u\n",
  207. si->valid_node_count - si->valid_inode_count,
  208. si->valid_count - si->valid_node_count);
  209. seq_printf(s, " - Inline_xattr Inode: %u\n",
  210. si->inline_xattr);
  211. seq_printf(s, " - Inline_data Inode: %u\n",
  212. si->inline_inode);
  213. seq_printf(s, " - Inline_dentry Inode: %u\n",
  214. si->inline_dir);
  215. seq_printf(s, " - Orphan Inode: %u\n",
  216. si->orphans);
  217. seq_printf(s, "\nMain area: %d segs, %d secs %d zones\n",
  218. si->main_area_segs, si->main_area_sections,
  219. si->main_area_zones);
  220. seq_printf(s, " - COLD data: %d, %d, %d\n",
  221. si->curseg[CURSEG_COLD_DATA],
  222. si->cursec[CURSEG_COLD_DATA],
  223. si->curzone[CURSEG_COLD_DATA]);
  224. seq_printf(s, " - WARM data: %d, %d, %d\n",
  225. si->curseg[CURSEG_WARM_DATA],
  226. si->cursec[CURSEG_WARM_DATA],
  227. si->curzone[CURSEG_WARM_DATA]);
  228. seq_printf(s, " - HOT data: %d, %d, %d\n",
  229. si->curseg[CURSEG_HOT_DATA],
  230. si->cursec[CURSEG_HOT_DATA],
  231. si->curzone[CURSEG_HOT_DATA]);
  232. seq_printf(s, " - Dir dnode: %d, %d, %d\n",
  233. si->curseg[CURSEG_HOT_NODE],
  234. si->cursec[CURSEG_HOT_NODE],
  235. si->curzone[CURSEG_HOT_NODE]);
  236. seq_printf(s, " - File dnode: %d, %d, %d\n",
  237. si->curseg[CURSEG_WARM_NODE],
  238. si->cursec[CURSEG_WARM_NODE],
  239. si->curzone[CURSEG_WARM_NODE]);
  240. seq_printf(s, " - Indir nodes: %d, %d, %d\n",
  241. si->curseg[CURSEG_COLD_NODE],
  242. si->cursec[CURSEG_COLD_NODE],
  243. si->curzone[CURSEG_COLD_NODE]);
  244. seq_printf(s, "\n - Valid: %d\n - Dirty: %d\n",
  245. si->main_area_segs - si->dirty_count -
  246. si->prefree_count - si->free_segs,
  247. si->dirty_count);
  248. seq_printf(s, " - Prefree: %d\n - Free: %d (%d)\n\n",
  249. si->prefree_count, si->free_segs, si->free_secs);
  250. seq_printf(s, "CP calls: %d (BG: %d)\n",
  251. si->cp_count, si->bg_cp_count);
  252. seq_printf(s, "GC calls: %d (BG: %d)\n",
  253. si->call_count, si->bg_gc);
  254. seq_printf(s, " - data segments : %d (%d)\n",
  255. si->data_segs, si->bg_data_segs);
  256. seq_printf(s, " - node segments : %d (%d)\n",
  257. si->node_segs, si->bg_node_segs);
  258. seq_printf(s, "Try to move %d blocks (BG: %d)\n", si->tot_blks,
  259. si->bg_data_blks + si->bg_node_blks);
  260. seq_printf(s, " - data blocks : %d (%d)\n", si->data_blks,
  261. si->bg_data_blks);
  262. seq_printf(s, " - node blocks : %d (%d)\n", si->node_blks,
  263. si->bg_node_blks);
  264. seq_puts(s, "\nExtent Cache:\n");
  265. seq_printf(s, " - Hit Count: L1-1:%llu L1-2:%llu L2:%llu\n",
  266. si->hit_largest, si->hit_cached,
  267. si->hit_rbtree);
  268. seq_printf(s, " - Hit Ratio: %llu%% (%llu / %llu)\n",
  269. !si->total_ext ? 0 :
  270. div64_u64(si->hit_total * 100, si->total_ext),
  271. si->hit_total, si->total_ext);
  272. seq_printf(s, " - Inner Struct Count: tree: %d(%d), node: %d\n",
  273. si->ext_tree, si->zombie_tree, si->ext_node);
  274. seq_puts(s, "\nBalancing F2FS Async:\n");
  275. seq_printf(s, " - inmem: %4lld, wb_bios: %4d\n",
  276. si->inmem_pages, si->wb_bios);
  277. seq_printf(s, " - nodes: %4lld in %4d\n",
  278. si->ndirty_node, si->node_pages);
  279. seq_printf(s, " - dents: %4lld in dirs:%4d\n",
  280. si->ndirty_dent, si->ndirty_dirs);
  281. seq_printf(s, " - datas: %4lld in files:%4d\n",
  282. si->ndirty_data, si->ndirty_files);
  283. seq_printf(s, " - meta: %4lld in %4d\n",
  284. si->ndirty_meta, si->meta_pages);
  285. seq_printf(s, " - NATs: %9d/%9d\n - SITs: %9d/%9d\n",
  286. si->dirty_nats, si->nats, si->dirty_sits, si->sits);
  287. seq_printf(s, " - free_nids: %9d\n",
  288. si->fnids);
  289. seq_puts(s, "\nDistribution of User Blocks:");
  290. seq_puts(s, " [ valid | invalid | free ]\n");
  291. seq_puts(s, " [");
  292. for (j = 0; j < si->util_valid; j++)
  293. seq_putc(s, '-');
  294. seq_putc(s, '|');
  295. for (j = 0; j < si->util_invalid; j++)
  296. seq_putc(s, '-');
  297. seq_putc(s, '|');
  298. for (j = 0; j < si->util_free; j++)
  299. seq_putc(s, '-');
  300. seq_puts(s, "]\n\n");
  301. seq_printf(s, "IPU: %u blocks\n", si->inplace_count);
  302. seq_printf(s, "SSR: %u blocks in %u segments\n",
  303. si->block_count[SSR], si->segment_count[SSR]);
  304. seq_printf(s, "LFS: %u blocks in %u segments\n",
  305. si->block_count[LFS], si->segment_count[LFS]);
  306. /* segment usage info */
  307. update_sit_info(si->sbi);
  308. seq_printf(s, "\nBDF: %u, avg. vblocks: %u\n",
  309. si->bimodal, si->avg_vblocks);
  310. /* memory footprint */
  311. update_mem_info(si->sbi);
  312. seq_printf(s, "\nMemory: %llu KB\n",
  313. (si->base_mem + si->cache_mem + si->page_mem) >> 10);
  314. seq_printf(s, " - static: %llu KB\n",
  315. si->base_mem >> 10);
  316. seq_printf(s, " - cached: %llu KB\n",
  317. si->cache_mem >> 10);
  318. seq_printf(s, " - paged : %llu KB\n",
  319. si->page_mem >> 10);
  320. }
  321. mutex_unlock(&f2fs_stat_mutex);
  322. return 0;
  323. }
  324. static int stat_open(struct inode *inode, struct file *file)
  325. {
  326. return single_open(file, stat_show, inode->i_private);
  327. }
  328. static const struct file_operations stat_fops = {
  329. .open = stat_open,
  330. .read = seq_read,
  331. .llseek = seq_lseek,
  332. .release = single_release,
  333. };
  334. int f2fs_build_stats(struct f2fs_sb_info *sbi)
  335. {
  336. struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
  337. struct f2fs_stat_info *si;
  338. si = kzalloc(sizeof(struct f2fs_stat_info), GFP_KERNEL);
  339. if (!si)
  340. return -ENOMEM;
  341. si->all_area_segs = le32_to_cpu(raw_super->segment_count);
  342. si->sit_area_segs = le32_to_cpu(raw_super->segment_count_sit);
  343. si->nat_area_segs = le32_to_cpu(raw_super->segment_count_nat);
  344. si->ssa_area_segs = le32_to_cpu(raw_super->segment_count_ssa);
  345. si->main_area_segs = le32_to_cpu(raw_super->segment_count_main);
  346. si->main_area_sections = le32_to_cpu(raw_super->section_count);
  347. si->main_area_zones = si->main_area_sections /
  348. le32_to_cpu(raw_super->secs_per_zone);
  349. si->sbi = sbi;
  350. sbi->stat_info = si;
  351. atomic64_set(&sbi->total_hit_ext, 0);
  352. atomic64_set(&sbi->read_hit_rbtree, 0);
  353. atomic64_set(&sbi->read_hit_largest, 0);
  354. atomic64_set(&sbi->read_hit_cached, 0);
  355. atomic_set(&sbi->inline_xattr, 0);
  356. atomic_set(&sbi->inline_inode, 0);
  357. atomic_set(&sbi->inline_dir, 0);
  358. atomic_set(&sbi->inplace_count, 0);
  359. mutex_lock(&f2fs_stat_mutex);
  360. list_add_tail(&si->stat_list, &f2fs_stat_list);
  361. mutex_unlock(&f2fs_stat_mutex);
  362. return 0;
  363. }
  364. void f2fs_destroy_stats(struct f2fs_sb_info *sbi)
  365. {
  366. struct f2fs_stat_info *si = F2FS_STAT(sbi);
  367. mutex_lock(&f2fs_stat_mutex);
  368. list_del(&si->stat_list);
  369. mutex_unlock(&f2fs_stat_mutex);
  370. kfree(si);
  371. }
  372. int __init f2fs_create_root_stats(void)
  373. {
  374. struct dentry *file;
  375. f2fs_debugfs_root = debugfs_create_dir("f2fs", NULL);
  376. if (!f2fs_debugfs_root)
  377. return -ENOMEM;
  378. file = debugfs_create_file("status", S_IRUGO, f2fs_debugfs_root,
  379. NULL, &stat_fops);
  380. if (!file) {
  381. debugfs_remove(f2fs_debugfs_root);
  382. f2fs_debugfs_root = NULL;
  383. return -ENOMEM;
  384. }
  385. return 0;
  386. }
  387. void f2fs_destroy_root_stats(void)
  388. {
  389. if (!f2fs_debugfs_root)
  390. return;
  391. debugfs_remove_recursive(f2fs_debugfs_root);
  392. f2fs_debugfs_root = NULL;
  393. }