debug.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414
  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_ext = sbi->read_hit_ext;
  32. si->total_ext = sbi->total_hit_ext;
  33. si->ext_tree = sbi->total_ext_tree;
  34. si->ext_node = atomic_read(&sbi->total_ext_node);
  35. si->ndirty_node = get_pages(sbi, F2FS_DIRTY_NODES);
  36. si->ndirty_dent = get_pages(sbi, F2FS_DIRTY_DENTS);
  37. si->ndirty_dirs = sbi->n_dirty_dirs;
  38. si->ndirty_meta = get_pages(sbi, F2FS_DIRTY_META);
  39. si->inmem_pages = get_pages(sbi, F2FS_INMEM_PAGES);
  40. si->wb_pages = get_pages(sbi, F2FS_WRITEBACK);
  41. si->total_count = (int)sbi->user_block_count / sbi->blocks_per_seg;
  42. si->rsvd_segs = reserved_segments(sbi);
  43. si->overp_segs = overprovision_segments(sbi);
  44. si->valid_count = valid_user_blocks(sbi);
  45. si->valid_node_count = valid_node_count(sbi);
  46. si->valid_inode_count = valid_inode_count(sbi);
  47. si->inline_inode = atomic_read(&sbi->inline_inode);
  48. si->inline_dir = atomic_read(&sbi->inline_dir);
  49. si->utilization = utilization(sbi);
  50. si->free_segs = free_segments(sbi);
  51. si->free_secs = free_sections(sbi);
  52. si->prefree_count = prefree_segments(sbi);
  53. si->dirty_count = dirty_segments(sbi);
  54. si->node_pages = NODE_MAPPING(sbi)->nrpages;
  55. si->meta_pages = META_MAPPING(sbi)->nrpages;
  56. si->nats = NM_I(sbi)->nat_cnt;
  57. si->dirty_nats = NM_I(sbi)->dirty_nat_cnt;
  58. si->sits = MAIN_SEGS(sbi);
  59. si->dirty_sits = SIT_I(sbi)->dirty_sentries;
  60. si->fnids = NM_I(sbi)->fcnt;
  61. si->bg_gc = sbi->bg_gc;
  62. si->util_free = (int)(free_user_blocks(sbi) >> sbi->log_blocks_per_seg)
  63. * 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
  64. / 2;
  65. si->util_valid = (int)(written_block_count(sbi) >>
  66. sbi->log_blocks_per_seg)
  67. * 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
  68. / 2;
  69. si->util_invalid = 50 - si->util_free - si->util_valid;
  70. for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_NODE; i++) {
  71. struct curseg_info *curseg = CURSEG_I(sbi, i);
  72. si->curseg[i] = curseg->segno;
  73. si->cursec[i] = curseg->segno / sbi->segs_per_sec;
  74. si->curzone[i] = si->cursec[i] / sbi->secs_per_zone;
  75. }
  76. for (i = 0; i < 2; i++) {
  77. si->segment_count[i] = sbi->segment_count[i];
  78. si->block_count[i] = sbi->block_count[i];
  79. }
  80. si->inplace_count = atomic_read(&sbi->inplace_count);
  81. }
  82. /*
  83. * This function calculates BDF of every segments
  84. */
  85. static void update_sit_info(struct f2fs_sb_info *sbi)
  86. {
  87. struct f2fs_stat_info *si = F2FS_STAT(sbi);
  88. unsigned long long blks_per_sec, hblks_per_sec, total_vblocks;
  89. unsigned long long bimodal, dist;
  90. unsigned int segno, vblocks;
  91. int ndirty = 0;
  92. bimodal = 0;
  93. total_vblocks = 0;
  94. blks_per_sec = sbi->segs_per_sec * (1 << sbi->log_blocks_per_seg);
  95. hblks_per_sec = blks_per_sec / 2;
  96. for (segno = 0; segno < MAIN_SEGS(sbi); segno += sbi->segs_per_sec) {
  97. vblocks = get_valid_blocks(sbi, segno, sbi->segs_per_sec);
  98. dist = abs(vblocks - hblks_per_sec);
  99. bimodal += dist * dist;
  100. if (vblocks > 0 && vblocks < blks_per_sec) {
  101. total_vblocks += vblocks;
  102. ndirty++;
  103. }
  104. }
  105. dist = div_u64(MAIN_SECS(sbi) * hblks_per_sec * hblks_per_sec, 100);
  106. si->bimodal = div_u64(bimodal, dist);
  107. if (si->dirty_count)
  108. si->avg_vblocks = div_u64(total_vblocks, ndirty);
  109. else
  110. si->avg_vblocks = 0;
  111. }
  112. /*
  113. * This function calculates memory footprint.
  114. */
  115. static void update_mem_info(struct f2fs_sb_info *sbi)
  116. {
  117. struct f2fs_stat_info *si = F2FS_STAT(sbi);
  118. unsigned npages;
  119. int i;
  120. if (si->base_mem)
  121. goto get_cache;
  122. si->base_mem = sizeof(struct f2fs_sb_info) + sbi->sb->s_blocksize;
  123. si->base_mem += 2 * sizeof(struct f2fs_inode_info);
  124. si->base_mem += sizeof(*sbi->ckpt);
  125. /* build sm */
  126. si->base_mem += sizeof(struct f2fs_sm_info);
  127. /* build sit */
  128. si->base_mem += sizeof(struct sit_info);
  129. si->base_mem += MAIN_SEGS(sbi) * sizeof(struct seg_entry);
  130. si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
  131. si->base_mem += 3 * SIT_VBLOCK_MAP_SIZE * MAIN_SEGS(sbi);
  132. si->base_mem += SIT_VBLOCK_MAP_SIZE;
  133. if (sbi->segs_per_sec > 1)
  134. si->base_mem += MAIN_SECS(sbi) * sizeof(struct sec_entry);
  135. si->base_mem += __bitmap_size(sbi, SIT_BITMAP);
  136. /* build free segmap */
  137. si->base_mem += sizeof(struct free_segmap_info);
  138. si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
  139. si->base_mem += f2fs_bitmap_size(MAIN_SECS(sbi));
  140. /* build curseg */
  141. si->base_mem += sizeof(struct curseg_info) * NR_CURSEG_TYPE;
  142. si->base_mem += PAGE_CACHE_SIZE * NR_CURSEG_TYPE;
  143. /* build dirty segmap */
  144. si->base_mem += sizeof(struct dirty_seglist_info);
  145. si->base_mem += NR_DIRTY_TYPE * f2fs_bitmap_size(MAIN_SEGS(sbi));
  146. si->base_mem += f2fs_bitmap_size(MAIN_SECS(sbi));
  147. /* build nm */
  148. si->base_mem += sizeof(struct f2fs_nm_info);
  149. si->base_mem += __bitmap_size(sbi, NAT_BITMAP);
  150. get_cache:
  151. si->cache_mem = 0;
  152. /* build gc */
  153. if (sbi->gc_thread)
  154. si->cache_mem += sizeof(struct f2fs_gc_kthread);
  155. /* build merge flush thread */
  156. if (SM_I(sbi)->cmd_control_info)
  157. si->cache_mem += sizeof(struct flush_cmd_control);
  158. /* free nids */
  159. si->cache_mem += NM_I(sbi)->fcnt * sizeof(struct free_nid);
  160. si->cache_mem += NM_I(sbi)->nat_cnt * sizeof(struct nat_entry);
  161. si->cache_mem += NM_I(sbi)->dirty_nat_cnt *
  162. sizeof(struct nat_entry_set);
  163. si->cache_mem += si->inmem_pages * sizeof(struct inmem_pages);
  164. si->cache_mem += sbi->n_dirty_dirs * sizeof(struct inode_entry);
  165. for (i = 0; i <= UPDATE_INO; i++)
  166. si->cache_mem += sbi->im[i].ino_num * sizeof(struct ino_entry);
  167. si->cache_mem += sbi->total_ext_tree * sizeof(struct extent_tree);
  168. si->cache_mem += atomic_read(&sbi->total_ext_node) *
  169. sizeof(struct extent_node);
  170. si->page_mem = 0;
  171. npages = NODE_MAPPING(sbi)->nrpages;
  172. si->page_mem += npages << PAGE_CACHE_SHIFT;
  173. npages = META_MAPPING(sbi)->nrpages;
  174. si->page_mem += npages << PAGE_CACHE_SHIFT;
  175. }
  176. static int stat_show(struct seq_file *s, void *v)
  177. {
  178. struct f2fs_stat_info *si;
  179. int i = 0;
  180. int j;
  181. mutex_lock(&f2fs_stat_mutex);
  182. list_for_each_entry(si, &f2fs_stat_list, stat_list) {
  183. char devname[BDEVNAME_SIZE];
  184. update_general_status(si->sbi);
  185. seq_printf(s, "\n=====[ partition info(%s). #%d ]=====\n",
  186. bdevname(si->sbi->sb->s_bdev, devname), i++);
  187. seq_printf(s, "[SB: 1] [CP: 2] [SIT: %d] [NAT: %d] ",
  188. si->sit_area_segs, si->nat_area_segs);
  189. seq_printf(s, "[SSA: %d] [MAIN: %d",
  190. si->ssa_area_segs, si->main_area_segs);
  191. seq_printf(s, "(OverProv:%d Resv:%d)]\n\n",
  192. si->overp_segs, si->rsvd_segs);
  193. seq_printf(s, "Utilization: %d%% (%d valid blocks)\n",
  194. si->utilization, si->valid_count);
  195. seq_printf(s, " - Node: %u (Inode: %u, ",
  196. si->valid_node_count, si->valid_inode_count);
  197. seq_printf(s, "Other: %u)\n - Data: %u\n",
  198. si->valid_node_count - si->valid_inode_count,
  199. si->valid_count - si->valid_node_count);
  200. seq_printf(s, " - Inline_data Inode: %u\n",
  201. si->inline_inode);
  202. seq_printf(s, " - Inline_dentry Inode: %u\n",
  203. si->inline_dir);
  204. seq_printf(s, "\nMain area: %d segs, %d secs %d zones\n",
  205. si->main_area_segs, si->main_area_sections,
  206. si->main_area_zones);
  207. seq_printf(s, " - COLD data: %d, %d, %d\n",
  208. si->curseg[CURSEG_COLD_DATA],
  209. si->cursec[CURSEG_COLD_DATA],
  210. si->curzone[CURSEG_COLD_DATA]);
  211. seq_printf(s, " - WARM data: %d, %d, %d\n",
  212. si->curseg[CURSEG_WARM_DATA],
  213. si->cursec[CURSEG_WARM_DATA],
  214. si->curzone[CURSEG_WARM_DATA]);
  215. seq_printf(s, " - HOT data: %d, %d, %d\n",
  216. si->curseg[CURSEG_HOT_DATA],
  217. si->cursec[CURSEG_HOT_DATA],
  218. si->curzone[CURSEG_HOT_DATA]);
  219. seq_printf(s, " - Dir dnode: %d, %d, %d\n",
  220. si->curseg[CURSEG_HOT_NODE],
  221. si->cursec[CURSEG_HOT_NODE],
  222. si->curzone[CURSEG_HOT_NODE]);
  223. seq_printf(s, " - File dnode: %d, %d, %d\n",
  224. si->curseg[CURSEG_WARM_NODE],
  225. si->cursec[CURSEG_WARM_NODE],
  226. si->curzone[CURSEG_WARM_NODE]);
  227. seq_printf(s, " - Indir nodes: %d, %d, %d\n",
  228. si->curseg[CURSEG_COLD_NODE],
  229. si->cursec[CURSEG_COLD_NODE],
  230. si->curzone[CURSEG_COLD_NODE]);
  231. seq_printf(s, "\n - Valid: %d\n - Dirty: %d\n",
  232. si->main_area_segs - si->dirty_count -
  233. si->prefree_count - si->free_segs,
  234. si->dirty_count);
  235. seq_printf(s, " - Prefree: %d\n - Free: %d (%d)\n\n",
  236. si->prefree_count, si->free_segs, si->free_secs);
  237. seq_printf(s, "CP calls: %d\n", si->cp_count);
  238. seq_printf(s, "GC calls: %d (BG: %d)\n",
  239. si->call_count, si->bg_gc);
  240. seq_printf(s, " - data segments : %d (%d)\n",
  241. si->data_segs, si->bg_data_segs);
  242. seq_printf(s, " - node segments : %d (%d)\n",
  243. si->node_segs, si->bg_node_segs);
  244. seq_printf(s, "Try to move %d blocks (BG: %d)\n", si->tot_blks,
  245. si->bg_data_blks + si->bg_node_blks);
  246. seq_printf(s, " - data blocks : %d (%d)\n", si->data_blks,
  247. si->bg_data_blks);
  248. seq_printf(s, " - node blocks : %d (%d)\n", si->node_blks,
  249. si->bg_node_blks);
  250. seq_printf(s, "\nExtent Hit Ratio: %d / %d\n",
  251. si->hit_ext, si->total_ext);
  252. seq_printf(s, "\nExtent Tree Count: %d\n", si->ext_tree);
  253. seq_printf(s, "\nExtent Node Count: %d\n", si->ext_node);
  254. seq_puts(s, "\nBalancing F2FS Async:\n");
  255. seq_printf(s, " - inmem: %4d, wb: %4d\n",
  256. si->inmem_pages, si->wb_pages);
  257. seq_printf(s, " - nodes: %4d in %4d\n",
  258. si->ndirty_node, si->node_pages);
  259. seq_printf(s, " - dents: %4d in dirs:%4d\n",
  260. si->ndirty_dent, si->ndirty_dirs);
  261. seq_printf(s, " - meta: %4d in %4d\n",
  262. si->ndirty_meta, si->meta_pages);
  263. seq_printf(s, " - NATs: %9d/%9d\n - SITs: %9d/%9d\n",
  264. si->dirty_nats, si->nats, si->dirty_sits, si->sits);
  265. seq_printf(s, " - free_nids: %9d\n",
  266. si->fnids);
  267. seq_puts(s, "\nDistribution of User Blocks:");
  268. seq_puts(s, " [ valid | invalid | free ]\n");
  269. seq_puts(s, " [");
  270. for (j = 0; j < si->util_valid; j++)
  271. seq_putc(s, '-');
  272. seq_putc(s, '|');
  273. for (j = 0; j < si->util_invalid; j++)
  274. seq_putc(s, '-');
  275. seq_putc(s, '|');
  276. for (j = 0; j < si->util_free; j++)
  277. seq_putc(s, '-');
  278. seq_puts(s, "]\n\n");
  279. seq_printf(s, "IPU: %u blocks\n", si->inplace_count);
  280. seq_printf(s, "SSR: %u blocks in %u segments\n",
  281. si->block_count[SSR], si->segment_count[SSR]);
  282. seq_printf(s, "LFS: %u blocks in %u segments\n",
  283. si->block_count[LFS], si->segment_count[LFS]);
  284. /* segment usage info */
  285. update_sit_info(si->sbi);
  286. seq_printf(s, "\nBDF: %u, avg. vblocks: %u\n",
  287. si->bimodal, si->avg_vblocks);
  288. /* memory footprint */
  289. update_mem_info(si->sbi);
  290. seq_printf(s, "\nMemory: %u KB\n",
  291. (si->base_mem + si->cache_mem + si->page_mem) >> 10);
  292. seq_printf(s, " - static: %u KB\n",
  293. si->base_mem >> 10);
  294. seq_printf(s, " - cached: %u KB\n",
  295. si->cache_mem >> 10);
  296. seq_printf(s, " - paged : %u KB\n",
  297. si->page_mem >> 10);
  298. }
  299. mutex_unlock(&f2fs_stat_mutex);
  300. return 0;
  301. }
  302. static int stat_open(struct inode *inode, struct file *file)
  303. {
  304. return single_open(file, stat_show, inode->i_private);
  305. }
  306. static const struct file_operations stat_fops = {
  307. .open = stat_open,
  308. .read = seq_read,
  309. .llseek = seq_lseek,
  310. .release = single_release,
  311. };
  312. int f2fs_build_stats(struct f2fs_sb_info *sbi)
  313. {
  314. struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
  315. struct f2fs_stat_info *si;
  316. si = kzalloc(sizeof(struct f2fs_stat_info), GFP_KERNEL);
  317. if (!si)
  318. return -ENOMEM;
  319. si->all_area_segs = le32_to_cpu(raw_super->segment_count);
  320. si->sit_area_segs = le32_to_cpu(raw_super->segment_count_sit);
  321. si->nat_area_segs = le32_to_cpu(raw_super->segment_count_nat);
  322. si->ssa_area_segs = le32_to_cpu(raw_super->segment_count_ssa);
  323. si->main_area_segs = le32_to_cpu(raw_super->segment_count_main);
  324. si->main_area_sections = le32_to_cpu(raw_super->section_count);
  325. si->main_area_zones = si->main_area_sections /
  326. le32_to_cpu(raw_super->secs_per_zone);
  327. si->sbi = sbi;
  328. sbi->stat_info = si;
  329. atomic_set(&sbi->inline_inode, 0);
  330. atomic_set(&sbi->inline_dir, 0);
  331. atomic_set(&sbi->inplace_count, 0);
  332. mutex_lock(&f2fs_stat_mutex);
  333. list_add_tail(&si->stat_list, &f2fs_stat_list);
  334. mutex_unlock(&f2fs_stat_mutex);
  335. return 0;
  336. }
  337. void f2fs_destroy_stats(struct f2fs_sb_info *sbi)
  338. {
  339. struct f2fs_stat_info *si = F2FS_STAT(sbi);
  340. mutex_lock(&f2fs_stat_mutex);
  341. list_del(&si->stat_list);
  342. mutex_unlock(&f2fs_stat_mutex);
  343. kfree(si);
  344. }
  345. void __init f2fs_create_root_stats(void)
  346. {
  347. struct dentry *file;
  348. f2fs_debugfs_root = debugfs_create_dir("f2fs", NULL);
  349. if (!f2fs_debugfs_root)
  350. return;
  351. file = debugfs_create_file("status", S_IRUGO, f2fs_debugfs_root,
  352. NULL, &stat_fops);
  353. if (!file) {
  354. debugfs_remove(f2fs_debugfs_root);
  355. f2fs_debugfs_root = NULL;
  356. }
  357. }
  358. void f2fs_destroy_root_stats(void)
  359. {
  360. if (!f2fs_debugfs_root)
  361. return;
  362. debugfs_remove_recursive(f2fs_debugfs_root);
  363. f2fs_debugfs_root = NULL;
  364. }