debug.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355
  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/proc_fs.h>
  16. #include <linux/f2fs_fs.h>
  17. #include <linux/blkdev.h>
  18. #include <linux/debugfs.h>
  19. #include <linux/seq_file.h>
  20. #include "f2fs.h"
  21. #include "node.h"
  22. #include "segment.h"
  23. #include "gc.h"
  24. static LIST_HEAD(f2fs_stat_list);
  25. static struct dentry *debugfs_root;
  26. static DEFINE_MUTEX(f2fs_stat_mutex);
  27. static void update_general_status(struct f2fs_sb_info *sbi)
  28. {
  29. struct f2fs_stat_info *si = sbi->stat_info;
  30. int i;
  31. /* valid check of the segment numbers */
  32. si->hit_ext = sbi->read_hit_ext;
  33. si->total_ext = sbi->total_hit_ext;
  34. si->ndirty_node = get_pages(sbi, F2FS_DIRTY_NODES);
  35. si->ndirty_dent = get_pages(sbi, F2FS_DIRTY_DENTS);
  36. si->ndirty_dirs = sbi->n_dirty_dirs;
  37. si->ndirty_meta = get_pages(sbi, F2FS_DIRTY_META);
  38. si->total_count = (int)sbi->user_block_count / sbi->blocks_per_seg;
  39. si->rsvd_segs = reserved_segments(sbi);
  40. si->overp_segs = overprovision_segments(sbi);
  41. si->valid_count = valid_user_blocks(sbi);
  42. si->valid_node_count = valid_node_count(sbi);
  43. si->valid_inode_count = valid_inode_count(sbi);
  44. si->utilization = utilization(sbi);
  45. si->free_segs = free_segments(sbi);
  46. si->free_secs = free_sections(sbi);
  47. si->prefree_count = prefree_segments(sbi);
  48. si->dirty_count = dirty_segments(sbi);
  49. si->node_pages = sbi->node_inode->i_mapping->nrpages;
  50. si->meta_pages = sbi->meta_inode->i_mapping->nrpages;
  51. si->nats = NM_I(sbi)->nat_cnt;
  52. si->sits = SIT_I(sbi)->dirty_sentries;
  53. si->fnids = NM_I(sbi)->fcnt;
  54. si->bg_gc = sbi->bg_gc;
  55. si->util_free = (int)(free_user_blocks(sbi) >> sbi->log_blocks_per_seg)
  56. * 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
  57. / 2;
  58. si->util_valid = (int)(written_block_count(sbi) >>
  59. sbi->log_blocks_per_seg)
  60. * 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
  61. / 2;
  62. si->util_invalid = 50 - si->util_free - si->util_valid;
  63. for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_NODE; i++) {
  64. struct curseg_info *curseg = CURSEG_I(sbi, i);
  65. si->curseg[i] = curseg->segno;
  66. si->cursec[i] = curseg->segno / sbi->segs_per_sec;
  67. si->curzone[i] = si->cursec[i] / sbi->secs_per_zone;
  68. }
  69. for (i = 0; i < 2; i++) {
  70. si->segment_count[i] = sbi->segment_count[i];
  71. si->block_count[i] = sbi->block_count[i];
  72. }
  73. }
  74. /*
  75. * This function calculates BDF of every segments
  76. */
  77. static void update_sit_info(struct f2fs_sb_info *sbi)
  78. {
  79. struct f2fs_stat_info *si = sbi->stat_info;
  80. unsigned int blks_per_sec, hblks_per_sec, total_vblocks, bimodal, dist;
  81. struct sit_info *sit_i = SIT_I(sbi);
  82. unsigned int segno, vblocks;
  83. int ndirty = 0;
  84. bimodal = 0;
  85. total_vblocks = 0;
  86. blks_per_sec = sbi->segs_per_sec * (1 << sbi->log_blocks_per_seg);
  87. hblks_per_sec = blks_per_sec / 2;
  88. mutex_lock(&sit_i->sentry_lock);
  89. for (segno = 0; segno < TOTAL_SEGS(sbi); segno += sbi->segs_per_sec) {
  90. vblocks = get_valid_blocks(sbi, segno, sbi->segs_per_sec);
  91. dist = abs(vblocks - hblks_per_sec);
  92. bimodal += dist * dist;
  93. if (vblocks > 0 && vblocks < blks_per_sec) {
  94. total_vblocks += vblocks;
  95. ndirty++;
  96. }
  97. }
  98. mutex_unlock(&sit_i->sentry_lock);
  99. dist = sbi->total_sections * hblks_per_sec * hblks_per_sec / 100;
  100. si->bimodal = bimodal / dist;
  101. if (si->dirty_count)
  102. si->avg_vblocks = total_vblocks / ndirty;
  103. else
  104. si->avg_vblocks = 0;
  105. }
  106. /*
  107. * This function calculates memory footprint.
  108. */
  109. static void update_mem_info(struct f2fs_sb_info *sbi)
  110. {
  111. struct f2fs_stat_info *si = sbi->stat_info;
  112. unsigned npages;
  113. if (si->base_mem)
  114. goto get_cache;
  115. si->base_mem = sizeof(struct f2fs_sb_info) + sbi->sb->s_blocksize;
  116. si->base_mem += 2 * sizeof(struct f2fs_inode_info);
  117. si->base_mem += sizeof(*sbi->ckpt);
  118. /* build sm */
  119. si->base_mem += sizeof(struct f2fs_sm_info);
  120. /* build sit */
  121. si->base_mem += sizeof(struct sit_info);
  122. si->base_mem += TOTAL_SEGS(sbi) * sizeof(struct seg_entry);
  123. si->base_mem += f2fs_bitmap_size(TOTAL_SEGS(sbi));
  124. si->base_mem += 2 * SIT_VBLOCK_MAP_SIZE * TOTAL_SEGS(sbi);
  125. if (sbi->segs_per_sec > 1)
  126. si->base_mem += sbi->total_sections *
  127. sizeof(struct sec_entry);
  128. si->base_mem += __bitmap_size(sbi, SIT_BITMAP);
  129. /* build free segmap */
  130. si->base_mem += sizeof(struct free_segmap_info);
  131. si->base_mem += f2fs_bitmap_size(TOTAL_SEGS(sbi));
  132. si->base_mem += f2fs_bitmap_size(sbi->total_sections);
  133. /* build curseg */
  134. si->base_mem += sizeof(struct curseg_info) * NR_CURSEG_TYPE;
  135. si->base_mem += PAGE_CACHE_SIZE * NR_CURSEG_TYPE;
  136. /* build dirty segmap */
  137. si->base_mem += sizeof(struct dirty_seglist_info);
  138. si->base_mem += NR_DIRTY_TYPE * f2fs_bitmap_size(TOTAL_SEGS(sbi));
  139. si->base_mem += 2 * f2fs_bitmap_size(TOTAL_SEGS(sbi));
  140. /* buld nm */
  141. si->base_mem += sizeof(struct f2fs_nm_info);
  142. si->base_mem += __bitmap_size(sbi, NAT_BITMAP);
  143. /* build gc */
  144. si->base_mem += sizeof(struct f2fs_gc_kthread);
  145. get_cache:
  146. /* free nids */
  147. si->cache_mem = NM_I(sbi)->fcnt;
  148. si->cache_mem += NM_I(sbi)->nat_cnt;
  149. npages = sbi->node_inode->i_mapping->nrpages;
  150. si->cache_mem += npages << PAGE_CACHE_SHIFT;
  151. npages = sbi->meta_inode->i_mapping->nrpages;
  152. si->cache_mem += npages << PAGE_CACHE_SHIFT;
  153. si->cache_mem += sbi->n_orphans * sizeof(struct orphan_inode_entry);
  154. si->cache_mem += sbi->n_dirty_dirs * sizeof(struct dir_inode_entry);
  155. }
  156. static int stat_show(struct seq_file *s, void *v)
  157. {
  158. struct f2fs_stat_info *si, *next;
  159. int i = 0;
  160. int j;
  161. mutex_lock(&f2fs_stat_mutex);
  162. list_for_each_entry_safe(si, next, &f2fs_stat_list, stat_list) {
  163. char devname[BDEVNAME_SIZE];
  164. update_general_status(si->sbi);
  165. seq_printf(s, "\n=====[ partition info(%s). #%d ]=====\n",
  166. bdevname(si->sbi->sb->s_bdev, devname), i++);
  167. seq_printf(s, "[SB: 1] [CP: 2] [SIT: %d] [NAT: %d] ",
  168. si->sit_area_segs, si->nat_area_segs);
  169. seq_printf(s, "[SSA: %d] [MAIN: %d",
  170. si->ssa_area_segs, si->main_area_segs);
  171. seq_printf(s, "(OverProv:%d Resv:%d)]\n\n",
  172. si->overp_segs, si->rsvd_segs);
  173. seq_printf(s, "Utilization: %d%% (%d valid blocks)\n",
  174. si->utilization, si->valid_count);
  175. seq_printf(s, " - Node: %u (Inode: %u, ",
  176. si->valid_node_count, si->valid_inode_count);
  177. seq_printf(s, "Other: %u)\n - Data: %u\n",
  178. si->valid_node_count - si->valid_inode_count,
  179. si->valid_count - si->valid_node_count);
  180. seq_printf(s, "\nMain area: %d segs, %d secs %d zones\n",
  181. si->main_area_segs, si->main_area_sections,
  182. si->main_area_zones);
  183. seq_printf(s, " - COLD data: %d, %d, %d\n",
  184. si->curseg[CURSEG_COLD_DATA],
  185. si->cursec[CURSEG_COLD_DATA],
  186. si->curzone[CURSEG_COLD_DATA]);
  187. seq_printf(s, " - WARM data: %d, %d, %d\n",
  188. si->curseg[CURSEG_WARM_DATA],
  189. si->cursec[CURSEG_WARM_DATA],
  190. si->curzone[CURSEG_WARM_DATA]);
  191. seq_printf(s, " - HOT data: %d, %d, %d\n",
  192. si->curseg[CURSEG_HOT_DATA],
  193. si->cursec[CURSEG_HOT_DATA],
  194. si->curzone[CURSEG_HOT_DATA]);
  195. seq_printf(s, " - Dir dnode: %d, %d, %d\n",
  196. si->curseg[CURSEG_HOT_NODE],
  197. si->cursec[CURSEG_HOT_NODE],
  198. si->curzone[CURSEG_HOT_NODE]);
  199. seq_printf(s, " - File dnode: %d, %d, %d\n",
  200. si->curseg[CURSEG_WARM_NODE],
  201. si->cursec[CURSEG_WARM_NODE],
  202. si->curzone[CURSEG_WARM_NODE]);
  203. seq_printf(s, " - Indir nodes: %d, %d, %d\n",
  204. si->curseg[CURSEG_COLD_NODE],
  205. si->cursec[CURSEG_COLD_NODE],
  206. si->curzone[CURSEG_COLD_NODE]);
  207. seq_printf(s, "\n - Valid: %d\n - Dirty: %d\n",
  208. si->main_area_segs - si->dirty_count -
  209. si->prefree_count - si->free_segs,
  210. si->dirty_count);
  211. seq_printf(s, " - Prefree: %d\n - Free: %d (%d)\n\n",
  212. si->prefree_count, si->free_segs, si->free_secs);
  213. seq_printf(s, "GC calls: %d (BG: %d)\n",
  214. si->call_count, si->bg_gc);
  215. seq_printf(s, " - data segments : %d\n", si->data_segs);
  216. seq_printf(s, " - node segments : %d\n", si->node_segs);
  217. seq_printf(s, "Try to move %d blocks\n", si->tot_blks);
  218. seq_printf(s, " - data blocks : %d\n", si->data_blks);
  219. seq_printf(s, " - node blocks : %d\n", si->node_blks);
  220. seq_printf(s, "\nExtent Hit Ratio: %d / %d\n",
  221. si->hit_ext, si->total_ext);
  222. seq_printf(s, "\nBalancing F2FS Async:\n");
  223. seq_printf(s, " - nodes %4d in %4d\n",
  224. si->ndirty_node, si->node_pages);
  225. seq_printf(s, " - dents %4d in dirs:%4d\n",
  226. si->ndirty_dent, si->ndirty_dirs);
  227. seq_printf(s, " - meta %4d in %4d\n",
  228. si->ndirty_meta, si->meta_pages);
  229. seq_printf(s, " - NATs %5d > %lu\n",
  230. si->nats, NM_WOUT_THRESHOLD);
  231. seq_printf(s, " - SITs: %5d\n - free_nids: %5d\n",
  232. si->sits, si->fnids);
  233. seq_printf(s, "\nDistribution of User Blocks:");
  234. seq_printf(s, " [ valid | invalid | free ]\n");
  235. seq_printf(s, " [");
  236. for (j = 0; j < si->util_valid; j++)
  237. seq_printf(s, "-");
  238. seq_printf(s, "|");
  239. for (j = 0; j < si->util_invalid; j++)
  240. seq_printf(s, "-");
  241. seq_printf(s, "|");
  242. for (j = 0; j < si->util_free; j++)
  243. seq_printf(s, "-");
  244. seq_printf(s, "]\n\n");
  245. seq_printf(s, "SSR: %u blocks in %u segments\n",
  246. si->block_count[SSR], si->segment_count[SSR]);
  247. seq_printf(s, "LFS: %u blocks in %u segments\n",
  248. si->block_count[LFS], si->segment_count[LFS]);
  249. /* segment usage info */
  250. update_sit_info(si->sbi);
  251. seq_printf(s, "\nBDF: %u, avg. vblocks: %u\n",
  252. si->bimodal, si->avg_vblocks);
  253. /* memory footprint */
  254. update_mem_info(si->sbi);
  255. seq_printf(s, "\nMemory: %u KB = static: %u + cached: %u\n",
  256. (si->base_mem + si->cache_mem) >> 10,
  257. si->base_mem >> 10, si->cache_mem >> 10);
  258. }
  259. mutex_unlock(&f2fs_stat_mutex);
  260. return 0;
  261. }
  262. static int stat_open(struct inode *inode, struct file *file)
  263. {
  264. return single_open(file, stat_show, inode->i_private);
  265. }
  266. static const struct file_operations stat_fops = {
  267. .open = stat_open,
  268. .read = seq_read,
  269. .llseek = seq_lseek,
  270. .release = single_release,
  271. };
  272. int f2fs_build_stats(struct f2fs_sb_info *sbi)
  273. {
  274. struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
  275. struct f2fs_stat_info *si;
  276. sbi->stat_info = kzalloc(sizeof(struct f2fs_stat_info), GFP_KERNEL);
  277. if (!sbi->stat_info)
  278. return -ENOMEM;
  279. si = sbi->stat_info;
  280. si->all_area_segs = le32_to_cpu(raw_super->segment_count);
  281. si->sit_area_segs = le32_to_cpu(raw_super->segment_count_sit);
  282. si->nat_area_segs = le32_to_cpu(raw_super->segment_count_nat);
  283. si->ssa_area_segs = le32_to_cpu(raw_super->segment_count_ssa);
  284. si->main_area_segs = le32_to_cpu(raw_super->segment_count_main);
  285. si->main_area_sections = le32_to_cpu(raw_super->section_count);
  286. si->main_area_zones = si->main_area_sections /
  287. le32_to_cpu(raw_super->secs_per_zone);
  288. si->sbi = sbi;
  289. mutex_lock(&f2fs_stat_mutex);
  290. list_add_tail(&si->stat_list, &f2fs_stat_list);
  291. mutex_unlock(&f2fs_stat_mutex);
  292. return 0;
  293. }
  294. void f2fs_destroy_stats(struct f2fs_sb_info *sbi)
  295. {
  296. struct f2fs_stat_info *si = sbi->stat_info;
  297. mutex_lock(&f2fs_stat_mutex);
  298. list_del(&si->stat_list);
  299. mutex_unlock(&f2fs_stat_mutex);
  300. kfree(sbi->stat_info);
  301. }
  302. void __init f2fs_create_root_stats(void)
  303. {
  304. debugfs_root = debugfs_create_dir("f2fs", NULL);
  305. if (debugfs_root)
  306. debugfs_create_file("status", S_IRUGO, debugfs_root,
  307. NULL, &stat_fops);
  308. }
  309. void f2fs_destroy_root_stats(void)
  310. {
  311. debugfs_remove_recursive(debugfs_root);
  312. debugfs_root = NULL;
  313. }