debug.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * f2fs debugging statistics
  4. *
  5. * Copyright (c) 2012 Samsung Electronics Co., Ltd.
  6. * http://www.samsung.com/
  7. * Copyright (c) 2012 Linux Foundation
  8. * Copyright (c) 2012 Greg Kroah-Hartman <gregkh@linuxfoundation.org>
  9. */
  10. #include <linux/fs.h>
  11. #include <linux/backing-dev.h>
  12. #include <linux/f2fs_fs.h>
  13. #include <linux/blkdev.h>
  14. #include <linux/debugfs.h>
  15. #include <linux/seq_file.h>
  16. #include "f2fs.h"
  17. #include "node.h"
  18. #include "segment.h"
  19. #include "gc.h"
  20. static LIST_HEAD(f2fs_stat_list);
  21. static DEFINE_MUTEX(f2fs_stat_mutex);
  22. #ifdef CONFIG_DEBUG_FS
  23. static struct dentry *f2fs_debugfs_root;
  24. #endif
  25. /*
  26. * This function calculates BDF of every segments
  27. */
  28. void f2fs_update_sit_info(struct f2fs_sb_info *sbi)
  29. {
  30. struct f2fs_stat_info *si = F2FS_STAT(sbi);
  31. unsigned long long blks_per_sec, hblks_per_sec, total_vblocks;
  32. unsigned long long bimodal, dist;
  33. unsigned int segno, vblocks;
  34. int ndirty = 0;
  35. bimodal = 0;
  36. total_vblocks = 0;
  37. blks_per_sec = BLKS_PER_SEC(sbi);
  38. hblks_per_sec = blks_per_sec / 2;
  39. for (segno = 0; segno < MAIN_SEGS(sbi); segno += sbi->segs_per_sec) {
  40. vblocks = get_valid_blocks(sbi, segno, true);
  41. dist = abs(vblocks - hblks_per_sec);
  42. bimodal += dist * dist;
  43. if (vblocks > 0 && vblocks < blks_per_sec) {
  44. total_vblocks += vblocks;
  45. ndirty++;
  46. }
  47. }
  48. dist = div_u64(MAIN_SECS(sbi) * hblks_per_sec * hblks_per_sec, 100);
  49. si->bimodal = div64_u64(bimodal, dist);
  50. if (si->dirty_count)
  51. si->avg_vblocks = div_u64(total_vblocks, ndirty);
  52. else
  53. si->avg_vblocks = 0;
  54. }
  55. #ifdef CONFIG_DEBUG_FS
  56. static void update_general_status(struct f2fs_sb_info *sbi)
  57. {
  58. struct f2fs_stat_info *si = F2FS_STAT(sbi);
  59. struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
  60. int i;
  61. /* these will be changed if online resize is done */
  62. si->main_area_segs = le32_to_cpu(raw_super->segment_count_main);
  63. si->main_area_sections = le32_to_cpu(raw_super->section_count);
  64. si->main_area_zones = si->main_area_sections /
  65. le32_to_cpu(raw_super->secs_per_zone);
  66. /* validation check of the segment numbers */
  67. si->hit_largest = atomic64_read(&sbi->read_hit_largest);
  68. si->hit_cached = atomic64_read(&sbi->read_hit_cached);
  69. si->hit_rbtree = atomic64_read(&sbi->read_hit_rbtree);
  70. si->hit_total = si->hit_largest + si->hit_cached + si->hit_rbtree;
  71. si->total_ext = atomic64_read(&sbi->total_hit_ext);
  72. si->ext_tree = atomic_read(&sbi->total_ext_tree);
  73. si->zombie_tree = atomic_read(&sbi->total_zombie_tree);
  74. si->ext_node = atomic_read(&sbi->total_ext_node);
  75. si->ndirty_node = get_pages(sbi, F2FS_DIRTY_NODES);
  76. si->ndirty_dent = get_pages(sbi, F2FS_DIRTY_DENTS);
  77. si->ndirty_meta = get_pages(sbi, F2FS_DIRTY_META);
  78. si->ndirty_data = get_pages(sbi, F2FS_DIRTY_DATA);
  79. si->ndirty_qdata = get_pages(sbi, F2FS_DIRTY_QDATA);
  80. si->ndirty_imeta = get_pages(sbi, F2FS_DIRTY_IMETA);
  81. si->ndirty_dirs = sbi->ndirty_inode[DIR_INODE];
  82. si->ndirty_files = sbi->ndirty_inode[FILE_INODE];
  83. si->nquota_files = sbi->nquota_files;
  84. si->ndirty_all = sbi->ndirty_inode[DIRTY_META];
  85. si->inmem_pages = get_pages(sbi, F2FS_INMEM_PAGES);
  86. si->aw_cnt = sbi->atomic_files;
  87. si->vw_cnt = atomic_read(&sbi->vw_cnt);
  88. si->max_aw_cnt = atomic_read(&sbi->max_aw_cnt);
  89. si->max_vw_cnt = atomic_read(&sbi->max_vw_cnt);
  90. si->nr_dio_read = get_pages(sbi, F2FS_DIO_READ);
  91. si->nr_dio_write = get_pages(sbi, F2FS_DIO_WRITE);
  92. si->nr_wb_cp_data = get_pages(sbi, F2FS_WB_CP_DATA);
  93. si->nr_wb_data = get_pages(sbi, F2FS_WB_DATA);
  94. si->nr_rd_data = get_pages(sbi, F2FS_RD_DATA);
  95. si->nr_rd_node = get_pages(sbi, F2FS_RD_NODE);
  96. si->nr_rd_meta = get_pages(sbi, F2FS_RD_META);
  97. if (SM_I(sbi)->fcc_info) {
  98. si->nr_flushed =
  99. atomic_read(&SM_I(sbi)->fcc_info->issued_flush);
  100. si->nr_flushing =
  101. atomic_read(&SM_I(sbi)->fcc_info->queued_flush);
  102. si->flush_list_empty =
  103. llist_empty(&SM_I(sbi)->fcc_info->issue_list);
  104. }
  105. if (SM_I(sbi)->dcc_info) {
  106. si->nr_discarded =
  107. atomic_read(&SM_I(sbi)->dcc_info->issued_discard);
  108. si->nr_discarding =
  109. atomic_read(&SM_I(sbi)->dcc_info->queued_discard);
  110. si->nr_discard_cmd =
  111. atomic_read(&SM_I(sbi)->dcc_info->discard_cmd_cnt);
  112. si->undiscard_blks = SM_I(sbi)->dcc_info->undiscard_blks;
  113. }
  114. si->nr_issued_ckpt = atomic_read(&sbi->cprc_info.issued_ckpt);
  115. si->nr_total_ckpt = atomic_read(&sbi->cprc_info.total_ckpt);
  116. si->nr_queued_ckpt = atomic_read(&sbi->cprc_info.queued_ckpt);
  117. spin_lock(&sbi->cprc_info.stat_lock);
  118. si->cur_ckpt_time = sbi->cprc_info.cur_time;
  119. si->peak_ckpt_time = sbi->cprc_info.peak_time;
  120. spin_unlock(&sbi->cprc_info.stat_lock);
  121. si->total_count = (int)sbi->user_block_count / sbi->blocks_per_seg;
  122. si->rsvd_segs = reserved_segments(sbi);
  123. si->overp_segs = overprovision_segments(sbi);
  124. si->valid_count = valid_user_blocks(sbi);
  125. si->discard_blks = discard_blocks(sbi);
  126. si->valid_node_count = valid_node_count(sbi);
  127. si->valid_inode_count = valid_inode_count(sbi);
  128. si->inline_xattr = atomic_read(&sbi->inline_xattr);
  129. si->inline_inode = atomic_read(&sbi->inline_inode);
  130. si->inline_dir = atomic_read(&sbi->inline_dir);
  131. si->compr_inode = atomic_read(&sbi->compr_inode);
  132. si->compr_blocks = atomic64_read(&sbi->compr_blocks);
  133. si->append = sbi->im[APPEND_INO].ino_num;
  134. si->update = sbi->im[UPDATE_INO].ino_num;
  135. si->orphans = sbi->im[ORPHAN_INO].ino_num;
  136. si->utilization = utilization(sbi);
  137. si->free_segs = free_segments(sbi);
  138. si->free_secs = free_sections(sbi);
  139. si->prefree_count = prefree_segments(sbi);
  140. si->dirty_count = dirty_segments(sbi);
  141. if (sbi->node_inode)
  142. si->node_pages = NODE_MAPPING(sbi)->nrpages;
  143. if (sbi->meta_inode)
  144. si->meta_pages = META_MAPPING(sbi)->nrpages;
  145. #ifdef CONFIG_F2FS_FS_COMPRESSION
  146. if (sbi->compress_inode) {
  147. si->compress_pages = COMPRESS_MAPPING(sbi)->nrpages;
  148. si->compress_page_hit = atomic_read(&sbi->compress_page_hit);
  149. }
  150. #endif
  151. si->nats = NM_I(sbi)->nat_cnt[TOTAL_NAT];
  152. si->dirty_nats = NM_I(sbi)->nat_cnt[DIRTY_NAT];
  153. si->sits = MAIN_SEGS(sbi);
  154. si->dirty_sits = SIT_I(sbi)->dirty_sentries;
  155. si->free_nids = NM_I(sbi)->nid_cnt[FREE_NID];
  156. si->avail_nids = NM_I(sbi)->available_nids;
  157. si->alloc_nids = NM_I(sbi)->nid_cnt[PREALLOC_NID];
  158. si->io_skip_bggc = sbi->io_skip_bggc;
  159. si->other_skip_bggc = sbi->other_skip_bggc;
  160. si->skipped_atomic_files[BG_GC] = sbi->skipped_atomic_files[BG_GC];
  161. si->skipped_atomic_files[FG_GC] = sbi->skipped_atomic_files[FG_GC];
  162. si->util_free = (int)(free_user_blocks(sbi) >> sbi->log_blocks_per_seg)
  163. * 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
  164. / 2;
  165. si->util_valid = (int)(written_block_count(sbi) >>
  166. sbi->log_blocks_per_seg)
  167. * 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
  168. / 2;
  169. si->util_invalid = 50 - si->util_free - si->util_valid;
  170. for (i = CURSEG_HOT_DATA; i < NO_CHECK_TYPE; i++) {
  171. struct curseg_info *curseg = CURSEG_I(sbi, i);
  172. si->curseg[i] = curseg->segno;
  173. si->cursec[i] = GET_SEC_FROM_SEG(sbi, curseg->segno);
  174. si->curzone[i] = GET_ZONE_FROM_SEC(sbi, si->cursec[i]);
  175. }
  176. for (i = META_CP; i < META_MAX; i++)
  177. si->meta_count[i] = atomic_read(&sbi->meta_count[i]);
  178. for (i = 0; i < NO_CHECK_TYPE; i++) {
  179. si->dirty_seg[i] = 0;
  180. si->full_seg[i] = 0;
  181. si->valid_blks[i] = 0;
  182. }
  183. for (i = 0; i < MAIN_SEGS(sbi); i++) {
  184. int blks = get_seg_entry(sbi, i)->valid_blocks;
  185. int type = get_seg_entry(sbi, i)->type;
  186. if (!blks)
  187. continue;
  188. if (blks == sbi->blocks_per_seg)
  189. si->full_seg[type]++;
  190. else
  191. si->dirty_seg[type]++;
  192. si->valid_blks[type] += blks;
  193. }
  194. for (i = 0; i < 2; i++) {
  195. si->segment_count[i] = sbi->segment_count[i];
  196. si->block_count[i] = sbi->block_count[i];
  197. }
  198. si->inplace_count = atomic_read(&sbi->inplace_count);
  199. }
  200. /*
  201. * This function calculates memory footprint.
  202. */
  203. static void update_mem_info(struct f2fs_sb_info *sbi)
  204. {
  205. struct f2fs_stat_info *si = F2FS_STAT(sbi);
  206. int i;
  207. if (si->base_mem)
  208. goto get_cache;
  209. /* build stat */
  210. si->base_mem = sizeof(struct f2fs_stat_info);
  211. /* build superblock */
  212. si->base_mem += sizeof(struct f2fs_sb_info) + sbi->sb->s_blocksize;
  213. si->base_mem += 2 * sizeof(struct f2fs_inode_info);
  214. si->base_mem += sizeof(*sbi->ckpt);
  215. /* build sm */
  216. si->base_mem += sizeof(struct f2fs_sm_info);
  217. /* build sit */
  218. si->base_mem += sizeof(struct sit_info);
  219. si->base_mem += MAIN_SEGS(sbi) * sizeof(struct seg_entry);
  220. si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
  221. si->base_mem += 2 * SIT_VBLOCK_MAP_SIZE * MAIN_SEGS(sbi);
  222. si->base_mem += SIT_VBLOCK_MAP_SIZE * MAIN_SEGS(sbi);
  223. si->base_mem += SIT_VBLOCK_MAP_SIZE;
  224. if (__is_large_section(sbi))
  225. si->base_mem += MAIN_SECS(sbi) * sizeof(struct sec_entry);
  226. si->base_mem += __bitmap_size(sbi, SIT_BITMAP);
  227. /* build free segmap */
  228. si->base_mem += sizeof(struct free_segmap_info);
  229. si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
  230. si->base_mem += f2fs_bitmap_size(MAIN_SECS(sbi));
  231. /* build curseg */
  232. si->base_mem += sizeof(struct curseg_info) * NR_CURSEG_TYPE;
  233. si->base_mem += PAGE_SIZE * NR_CURSEG_TYPE;
  234. /* build dirty segmap */
  235. si->base_mem += sizeof(struct dirty_seglist_info);
  236. si->base_mem += NR_DIRTY_TYPE * f2fs_bitmap_size(MAIN_SEGS(sbi));
  237. si->base_mem += f2fs_bitmap_size(MAIN_SECS(sbi));
  238. /* build nm */
  239. si->base_mem += sizeof(struct f2fs_nm_info);
  240. si->base_mem += __bitmap_size(sbi, NAT_BITMAP);
  241. si->base_mem += (NM_I(sbi)->nat_bits_blocks << F2FS_BLKSIZE_BITS);
  242. si->base_mem += NM_I(sbi)->nat_blocks *
  243. f2fs_bitmap_size(NAT_ENTRY_PER_BLOCK);
  244. si->base_mem += NM_I(sbi)->nat_blocks / 8;
  245. si->base_mem += NM_I(sbi)->nat_blocks * sizeof(unsigned short);
  246. get_cache:
  247. si->cache_mem = 0;
  248. /* build gc */
  249. if (sbi->gc_thread)
  250. si->cache_mem += sizeof(struct f2fs_gc_kthread);
  251. /* build merge flush thread */
  252. if (SM_I(sbi)->fcc_info)
  253. si->cache_mem += sizeof(struct flush_cmd_control);
  254. if (SM_I(sbi)->dcc_info) {
  255. si->cache_mem += sizeof(struct discard_cmd_control);
  256. si->cache_mem += sizeof(struct discard_cmd) *
  257. atomic_read(&SM_I(sbi)->dcc_info->discard_cmd_cnt);
  258. }
  259. /* free nids */
  260. si->cache_mem += (NM_I(sbi)->nid_cnt[FREE_NID] +
  261. NM_I(sbi)->nid_cnt[PREALLOC_NID]) *
  262. sizeof(struct free_nid);
  263. si->cache_mem += NM_I(sbi)->nat_cnt[TOTAL_NAT] *
  264. sizeof(struct nat_entry);
  265. si->cache_mem += NM_I(sbi)->nat_cnt[DIRTY_NAT] *
  266. sizeof(struct nat_entry_set);
  267. si->cache_mem += si->inmem_pages * sizeof(struct inmem_pages);
  268. for (i = 0; i < MAX_INO_ENTRY; i++)
  269. si->cache_mem += sbi->im[i].ino_num * sizeof(struct ino_entry);
  270. si->cache_mem += atomic_read(&sbi->total_ext_tree) *
  271. sizeof(struct extent_tree);
  272. si->cache_mem += atomic_read(&sbi->total_ext_node) *
  273. sizeof(struct extent_node);
  274. si->page_mem = 0;
  275. if (sbi->node_inode) {
  276. unsigned npages = NODE_MAPPING(sbi)->nrpages;
  277. si->page_mem += (unsigned long long)npages << PAGE_SHIFT;
  278. }
  279. if (sbi->meta_inode) {
  280. unsigned npages = META_MAPPING(sbi)->nrpages;
  281. si->page_mem += (unsigned long long)npages << PAGE_SHIFT;
  282. }
  283. #ifdef CONFIG_F2FS_FS_COMPRESSION
  284. if (sbi->compress_inode) {
  285. unsigned npages = COMPRESS_MAPPING(sbi)->nrpages;
  286. si->page_mem += (unsigned long long)npages << PAGE_SHIFT;
  287. }
  288. #endif
  289. }
  290. static int stat_show(struct seq_file *s, void *v)
  291. {
  292. struct f2fs_stat_info *si;
  293. int i = 0;
  294. int j;
  295. mutex_lock(&f2fs_stat_mutex);
  296. list_for_each_entry(si, &f2fs_stat_list, stat_list) {
  297. update_general_status(si->sbi);
  298. seq_printf(s, "\n=====[ partition info(%pg). #%d, %s, CP: %s]=====\n",
  299. si->sbi->sb->s_bdev, i++,
  300. f2fs_readonly(si->sbi->sb) ? "RO": "RW",
  301. is_set_ckpt_flags(si->sbi, CP_DISABLED_FLAG) ?
  302. "Disabled": (f2fs_cp_error(si->sbi) ? "Error": "Good"));
  303. seq_printf(s, "[SB: 1] [CP: 2] [SIT: %d] [NAT: %d] ",
  304. si->sit_area_segs, si->nat_area_segs);
  305. seq_printf(s, "[SSA: %d] [MAIN: %d",
  306. si->ssa_area_segs, si->main_area_segs);
  307. seq_printf(s, "(OverProv:%d Resv:%d)]\n\n",
  308. si->overp_segs, si->rsvd_segs);
  309. seq_printf(s, "Current Time Sec: %llu / Mounted Time Sec: %llu\n\n",
  310. ktime_get_boottime_seconds(),
  311. SIT_I(si->sbi)->mounted_time);
  312. if (test_opt(si->sbi, DISCARD))
  313. seq_printf(s, "Utilization: %u%% (%u valid blocks, %u discard blocks)\n",
  314. si->utilization, si->valid_count, si->discard_blks);
  315. else
  316. seq_printf(s, "Utilization: %u%% (%u valid blocks)\n",
  317. si->utilization, si->valid_count);
  318. seq_printf(s, " - Node: %u (Inode: %u, ",
  319. si->valid_node_count, si->valid_inode_count);
  320. seq_printf(s, "Other: %u)\n - Data: %u\n",
  321. si->valid_node_count - si->valid_inode_count,
  322. si->valid_count - si->valid_node_count);
  323. seq_printf(s, " - Inline_xattr Inode: %u\n",
  324. si->inline_xattr);
  325. seq_printf(s, " - Inline_data Inode: %u\n",
  326. si->inline_inode);
  327. seq_printf(s, " - Inline_dentry Inode: %u\n",
  328. si->inline_dir);
  329. seq_printf(s, " - Compressed Inode: %u, Blocks: %llu\n",
  330. si->compr_inode, si->compr_blocks);
  331. seq_printf(s, " - Orphan/Append/Update Inode: %u, %u, %u\n",
  332. si->orphans, si->append, si->update);
  333. seq_printf(s, "\nMain area: %d segs, %d secs %d zones\n",
  334. si->main_area_segs, si->main_area_sections,
  335. si->main_area_zones);
  336. seq_printf(s, " TYPE %8s %8s %8s %10s %10s %10s\n",
  337. "segno", "secno", "zoneno", "dirty_seg", "full_seg", "valid_blk");
  338. seq_printf(s, " - COLD data: %8d %8d %8d %10u %10u %10u\n",
  339. si->curseg[CURSEG_COLD_DATA],
  340. si->cursec[CURSEG_COLD_DATA],
  341. si->curzone[CURSEG_COLD_DATA],
  342. si->dirty_seg[CURSEG_COLD_DATA],
  343. si->full_seg[CURSEG_COLD_DATA],
  344. si->valid_blks[CURSEG_COLD_DATA]);
  345. seq_printf(s, " - WARM data: %8d %8d %8d %10u %10u %10u\n",
  346. si->curseg[CURSEG_WARM_DATA],
  347. si->cursec[CURSEG_WARM_DATA],
  348. si->curzone[CURSEG_WARM_DATA],
  349. si->dirty_seg[CURSEG_WARM_DATA],
  350. si->full_seg[CURSEG_WARM_DATA],
  351. si->valid_blks[CURSEG_WARM_DATA]);
  352. seq_printf(s, " - HOT data: %8d %8d %8d %10u %10u %10u\n",
  353. si->curseg[CURSEG_HOT_DATA],
  354. si->cursec[CURSEG_HOT_DATA],
  355. si->curzone[CURSEG_HOT_DATA],
  356. si->dirty_seg[CURSEG_HOT_DATA],
  357. si->full_seg[CURSEG_HOT_DATA],
  358. si->valid_blks[CURSEG_HOT_DATA]);
  359. seq_printf(s, " - Dir dnode: %8d %8d %8d %10u %10u %10u\n",
  360. si->curseg[CURSEG_HOT_NODE],
  361. si->cursec[CURSEG_HOT_NODE],
  362. si->curzone[CURSEG_HOT_NODE],
  363. si->dirty_seg[CURSEG_HOT_NODE],
  364. si->full_seg[CURSEG_HOT_NODE],
  365. si->valid_blks[CURSEG_HOT_NODE]);
  366. seq_printf(s, " - File dnode: %8d %8d %8d %10u %10u %10u\n",
  367. si->curseg[CURSEG_WARM_NODE],
  368. si->cursec[CURSEG_WARM_NODE],
  369. si->curzone[CURSEG_WARM_NODE],
  370. si->dirty_seg[CURSEG_WARM_NODE],
  371. si->full_seg[CURSEG_WARM_NODE],
  372. si->valid_blks[CURSEG_WARM_NODE]);
  373. seq_printf(s, " - Indir nodes: %8d %8d %8d %10u %10u %10u\n",
  374. si->curseg[CURSEG_COLD_NODE],
  375. si->cursec[CURSEG_COLD_NODE],
  376. si->curzone[CURSEG_COLD_NODE],
  377. si->dirty_seg[CURSEG_COLD_NODE],
  378. si->full_seg[CURSEG_COLD_NODE],
  379. si->valid_blks[CURSEG_COLD_NODE]);
  380. seq_printf(s, " - Pinned file: %8d %8d %8d\n",
  381. si->curseg[CURSEG_COLD_DATA_PINNED],
  382. si->cursec[CURSEG_COLD_DATA_PINNED],
  383. si->curzone[CURSEG_COLD_DATA_PINNED]);
  384. seq_printf(s, " - ATGC data: %8d %8d %8d\n",
  385. si->curseg[CURSEG_ALL_DATA_ATGC],
  386. si->cursec[CURSEG_ALL_DATA_ATGC],
  387. si->curzone[CURSEG_ALL_DATA_ATGC]);
  388. seq_printf(s, "\n - Valid: %d\n - Dirty: %d\n",
  389. si->main_area_segs - si->dirty_count -
  390. si->prefree_count - si->free_segs,
  391. si->dirty_count);
  392. seq_printf(s, " - Prefree: %d\n - Free: %d (%d)\n\n",
  393. si->prefree_count, si->free_segs, si->free_secs);
  394. seq_printf(s, "CP calls: %d (BG: %d)\n",
  395. si->cp_count, si->bg_cp_count);
  396. seq_printf(s, " - cp blocks : %u\n", si->meta_count[META_CP]);
  397. seq_printf(s, " - sit blocks : %u\n",
  398. si->meta_count[META_SIT]);
  399. seq_printf(s, " - nat blocks : %u\n",
  400. si->meta_count[META_NAT]);
  401. seq_printf(s, " - ssa blocks : %u\n",
  402. si->meta_count[META_SSA]);
  403. seq_printf(s, "CP merge (Queued: %4d, Issued: %4d, Total: %4d, "
  404. "Cur time: %4d(ms), Peak time: %4d(ms))\n",
  405. si->nr_queued_ckpt, si->nr_issued_ckpt,
  406. si->nr_total_ckpt, si->cur_ckpt_time,
  407. si->peak_ckpt_time);
  408. seq_printf(s, "GC calls: %d (BG: %d)\n",
  409. si->call_count, si->bg_gc);
  410. seq_printf(s, " - data segments : %d (%d)\n",
  411. si->data_segs, si->bg_data_segs);
  412. seq_printf(s, " - node segments : %d (%d)\n",
  413. si->node_segs, si->bg_node_segs);
  414. seq_printf(s, " - Reclaimed segs : Normal (%d), Idle CB (%d), "
  415. "Idle Greedy (%d), Idle AT (%d), "
  416. "Urgent High (%d), Urgent Low (%d)\n",
  417. si->sbi->gc_reclaimed_segs[GC_NORMAL],
  418. si->sbi->gc_reclaimed_segs[GC_IDLE_CB],
  419. si->sbi->gc_reclaimed_segs[GC_IDLE_GREEDY],
  420. si->sbi->gc_reclaimed_segs[GC_IDLE_AT],
  421. si->sbi->gc_reclaimed_segs[GC_URGENT_HIGH],
  422. si->sbi->gc_reclaimed_segs[GC_URGENT_LOW]);
  423. seq_printf(s, "Try to move %d blocks (BG: %d)\n", si->tot_blks,
  424. si->bg_data_blks + si->bg_node_blks);
  425. seq_printf(s, " - data blocks : %d (%d)\n", si->data_blks,
  426. si->bg_data_blks);
  427. seq_printf(s, " - node blocks : %d (%d)\n", si->node_blks,
  428. si->bg_node_blks);
  429. seq_printf(s, "Skipped : atomic write %llu (%llu)\n",
  430. si->skipped_atomic_files[BG_GC] +
  431. si->skipped_atomic_files[FG_GC],
  432. si->skipped_atomic_files[BG_GC]);
  433. seq_printf(s, "BG skip : IO: %u, Other: %u\n",
  434. si->io_skip_bggc, si->other_skip_bggc);
  435. seq_puts(s, "\nExtent Cache:\n");
  436. seq_printf(s, " - Hit Count: L1-1:%llu L1-2:%llu L2:%llu\n",
  437. si->hit_largest, si->hit_cached,
  438. si->hit_rbtree);
  439. seq_printf(s, " - Hit Ratio: %llu%% (%llu / %llu)\n",
  440. !si->total_ext ? 0 :
  441. div64_u64(si->hit_total * 100, si->total_ext),
  442. si->hit_total, si->total_ext);
  443. seq_printf(s, " - Inner Struct Count: tree: %d(%d), node: %d\n",
  444. si->ext_tree, si->zombie_tree, si->ext_node);
  445. seq_puts(s, "\nBalancing F2FS Async:\n");
  446. seq_printf(s, " - DIO (R: %4d, W: %4d)\n",
  447. si->nr_dio_read, si->nr_dio_write);
  448. seq_printf(s, " - IO_R (Data: %4d, Node: %4d, Meta: %4d\n",
  449. si->nr_rd_data, si->nr_rd_node, si->nr_rd_meta);
  450. seq_printf(s, " - IO_W (CP: %4d, Data: %4d, Flush: (%4d %4d %4d), "
  451. "Discard: (%4d %4d)) cmd: %4d undiscard:%4u\n",
  452. si->nr_wb_cp_data, si->nr_wb_data,
  453. si->nr_flushing, si->nr_flushed,
  454. si->flush_list_empty,
  455. si->nr_discarding, si->nr_discarded,
  456. si->nr_discard_cmd, si->undiscard_blks);
  457. seq_printf(s, " - inmem: %4d, atomic IO: %4d (Max. %4d), "
  458. "volatile IO: %4d (Max. %4d)\n",
  459. si->inmem_pages, si->aw_cnt, si->max_aw_cnt,
  460. si->vw_cnt, si->max_vw_cnt);
  461. seq_printf(s, " - compress: %4d, hit:%8d\n", si->compress_pages, si->compress_page_hit);
  462. seq_printf(s, " - nodes: %4d in %4d\n",
  463. si->ndirty_node, si->node_pages);
  464. seq_printf(s, " - dents: %4d in dirs:%4d (%4d)\n",
  465. si->ndirty_dent, si->ndirty_dirs, si->ndirty_all);
  466. seq_printf(s, " - datas: %4d in files:%4d\n",
  467. si->ndirty_data, si->ndirty_files);
  468. seq_printf(s, " - quota datas: %4d in quota files:%4d\n",
  469. si->ndirty_qdata, si->nquota_files);
  470. seq_printf(s, " - meta: %4d in %4d\n",
  471. si->ndirty_meta, si->meta_pages);
  472. seq_printf(s, " - imeta: %4d\n",
  473. si->ndirty_imeta);
  474. seq_printf(s, " - NATs: %9d/%9d\n - SITs: %9d/%9d\n",
  475. si->dirty_nats, si->nats, si->dirty_sits, si->sits);
  476. seq_printf(s, " - free_nids: %9d/%9d\n - alloc_nids: %9d\n",
  477. si->free_nids, si->avail_nids, si->alloc_nids);
  478. seq_puts(s, "\nDistribution of User Blocks:");
  479. seq_puts(s, " [ valid | invalid | free ]\n");
  480. seq_puts(s, " [");
  481. for (j = 0; j < si->util_valid; j++)
  482. seq_putc(s, '-');
  483. seq_putc(s, '|');
  484. for (j = 0; j < si->util_invalid; j++)
  485. seq_putc(s, '-');
  486. seq_putc(s, '|');
  487. for (j = 0; j < si->util_free; j++)
  488. seq_putc(s, '-');
  489. seq_puts(s, "]\n\n");
  490. seq_printf(s, "IPU: %u blocks\n", si->inplace_count);
  491. seq_printf(s, "SSR: %u blocks in %u segments\n",
  492. si->block_count[SSR], si->segment_count[SSR]);
  493. seq_printf(s, "LFS: %u blocks in %u segments\n",
  494. si->block_count[LFS], si->segment_count[LFS]);
  495. /* segment usage info */
  496. f2fs_update_sit_info(si->sbi);
  497. seq_printf(s, "\nBDF: %u, avg. vblocks: %u\n",
  498. si->bimodal, si->avg_vblocks);
  499. /* memory footprint */
  500. update_mem_info(si->sbi);
  501. seq_printf(s, "\nMemory: %llu KB\n",
  502. (si->base_mem + si->cache_mem + si->page_mem) >> 10);
  503. seq_printf(s, " - static: %llu KB\n",
  504. si->base_mem >> 10);
  505. seq_printf(s, " - cached: %llu KB\n",
  506. si->cache_mem >> 10);
  507. seq_printf(s, " - paged : %llu KB\n",
  508. si->page_mem >> 10);
  509. }
  510. mutex_unlock(&f2fs_stat_mutex);
  511. return 0;
  512. }
  513. DEFINE_SHOW_ATTRIBUTE(stat);
  514. #endif
  515. int f2fs_build_stats(struct f2fs_sb_info *sbi)
  516. {
  517. struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
  518. struct f2fs_stat_info *si;
  519. int i;
  520. si = f2fs_kzalloc(sbi, sizeof(struct f2fs_stat_info), GFP_KERNEL);
  521. if (!si)
  522. return -ENOMEM;
  523. si->all_area_segs = le32_to_cpu(raw_super->segment_count);
  524. si->sit_area_segs = le32_to_cpu(raw_super->segment_count_sit);
  525. si->nat_area_segs = le32_to_cpu(raw_super->segment_count_nat);
  526. si->ssa_area_segs = le32_to_cpu(raw_super->segment_count_ssa);
  527. si->main_area_segs = le32_to_cpu(raw_super->segment_count_main);
  528. si->main_area_sections = le32_to_cpu(raw_super->section_count);
  529. si->main_area_zones = si->main_area_sections /
  530. le32_to_cpu(raw_super->secs_per_zone);
  531. si->sbi = sbi;
  532. sbi->stat_info = si;
  533. atomic64_set(&sbi->total_hit_ext, 0);
  534. atomic64_set(&sbi->read_hit_rbtree, 0);
  535. atomic64_set(&sbi->read_hit_largest, 0);
  536. atomic64_set(&sbi->read_hit_cached, 0);
  537. atomic_set(&sbi->inline_xattr, 0);
  538. atomic_set(&sbi->inline_inode, 0);
  539. atomic_set(&sbi->inline_dir, 0);
  540. atomic_set(&sbi->compr_inode, 0);
  541. atomic64_set(&sbi->compr_blocks, 0);
  542. atomic_set(&sbi->inplace_count, 0);
  543. for (i = META_CP; i < META_MAX; i++)
  544. atomic_set(&sbi->meta_count[i], 0);
  545. atomic_set(&sbi->vw_cnt, 0);
  546. atomic_set(&sbi->max_aw_cnt, 0);
  547. atomic_set(&sbi->max_vw_cnt, 0);
  548. mutex_lock(&f2fs_stat_mutex);
  549. list_add_tail(&si->stat_list, &f2fs_stat_list);
  550. mutex_unlock(&f2fs_stat_mutex);
  551. return 0;
  552. }
  553. void f2fs_destroy_stats(struct f2fs_sb_info *sbi)
  554. {
  555. struct f2fs_stat_info *si = F2FS_STAT(sbi);
  556. mutex_lock(&f2fs_stat_mutex);
  557. list_del(&si->stat_list);
  558. mutex_unlock(&f2fs_stat_mutex);
  559. kfree(si);
  560. }
  561. void __init f2fs_create_root_stats(void)
  562. {
  563. #ifdef CONFIG_DEBUG_FS
  564. f2fs_debugfs_root = debugfs_create_dir("f2fs", NULL);
  565. debugfs_create_file("status", S_IRUGO, f2fs_debugfs_root, NULL,
  566. &stat_fops);
  567. #endif
  568. }
  569. void f2fs_destroy_root_stats(void)
  570. {
  571. #ifdef CONFIG_DEBUG_FS
  572. debugfs_remove_recursive(f2fs_debugfs_root);
  573. f2fs_debugfs_root = NULL;
  574. #endif
  575. }