debug.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728
  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 <[email protected]>
  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_RAW_SPINLOCK(f2fs_stat_lock);
  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 = CAP_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. /* general extent cache stats */
  67. for (i = 0; i < NR_EXTENT_CACHES; i++) {
  68. struct extent_tree_info *eti = &sbi->extent_tree[i];
  69. si->hit_cached[i] = atomic64_read(&sbi->read_hit_cached[i]);
  70. si->hit_rbtree[i] = atomic64_read(&sbi->read_hit_rbtree[i]);
  71. si->total_ext[i] = atomic64_read(&sbi->total_hit_ext[i]);
  72. si->hit_total[i] = si->hit_cached[i] + si->hit_rbtree[i];
  73. si->ext_tree[i] = atomic_read(&eti->total_ext_tree);
  74. si->zombie_tree[i] = atomic_read(&eti->total_zombie_tree);
  75. si->ext_node[i] = atomic_read(&eti->total_ext_node);
  76. }
  77. /* read extent_cache only */
  78. si->hit_largest = atomic64_read(&sbi->read_hit_largest);
  79. si->hit_total[EX_READ] += si->hit_largest;
  80. /* block age extent_cache only */
  81. si->allocated_data_blocks = atomic64_read(&sbi->allocated_data_blocks);
  82. /* validation check of the segment numbers */
  83. si->ndirty_node = get_pages(sbi, F2FS_DIRTY_NODES);
  84. si->ndirty_dent = get_pages(sbi, F2FS_DIRTY_DENTS);
  85. si->ndirty_meta = get_pages(sbi, F2FS_DIRTY_META);
  86. si->ndirty_data = get_pages(sbi, F2FS_DIRTY_DATA);
  87. si->ndirty_qdata = get_pages(sbi, F2FS_DIRTY_QDATA);
  88. si->ndirty_imeta = get_pages(sbi, F2FS_DIRTY_IMETA);
  89. si->ndirty_dirs = sbi->ndirty_inode[DIR_INODE];
  90. si->ndirty_files = sbi->ndirty_inode[FILE_INODE];
  91. si->nquota_files = sbi->nquota_files;
  92. si->ndirty_all = sbi->ndirty_inode[DIRTY_META];
  93. si->aw_cnt = atomic_read(&sbi->atomic_files);
  94. si->max_aw_cnt = atomic_read(&sbi->max_aw_cnt);
  95. si->nr_dio_read = get_pages(sbi, F2FS_DIO_READ);
  96. si->nr_dio_write = get_pages(sbi, F2FS_DIO_WRITE);
  97. si->nr_wb_cp_data = get_pages(sbi, F2FS_WB_CP_DATA);
  98. si->nr_wb_data = get_pages(sbi, F2FS_WB_DATA);
  99. si->nr_rd_data = get_pages(sbi, F2FS_RD_DATA);
  100. si->nr_rd_node = get_pages(sbi, F2FS_RD_NODE);
  101. si->nr_rd_meta = get_pages(sbi, F2FS_RD_META);
  102. if (SM_I(sbi)->fcc_info) {
  103. si->nr_flushed =
  104. atomic_read(&SM_I(sbi)->fcc_info->issued_flush);
  105. si->nr_flushing =
  106. atomic_read(&SM_I(sbi)->fcc_info->queued_flush);
  107. si->flush_list_empty =
  108. llist_empty(&SM_I(sbi)->fcc_info->issue_list);
  109. }
  110. if (SM_I(sbi)->dcc_info) {
  111. si->nr_discarded =
  112. atomic_read(&SM_I(sbi)->dcc_info->issued_discard);
  113. si->nr_discarding =
  114. atomic_read(&SM_I(sbi)->dcc_info->queued_discard);
  115. si->nr_discard_cmd =
  116. atomic_read(&SM_I(sbi)->dcc_info->discard_cmd_cnt);
  117. si->undiscard_blks = SM_I(sbi)->dcc_info->undiscard_blks;
  118. }
  119. si->nr_issued_ckpt = atomic_read(&sbi->cprc_info.issued_ckpt);
  120. si->nr_total_ckpt = atomic_read(&sbi->cprc_info.total_ckpt);
  121. si->nr_queued_ckpt = atomic_read(&sbi->cprc_info.queued_ckpt);
  122. spin_lock(&sbi->cprc_info.stat_lock);
  123. si->cur_ckpt_time = sbi->cprc_info.cur_time;
  124. si->peak_ckpt_time = sbi->cprc_info.peak_time;
  125. spin_unlock(&sbi->cprc_info.stat_lock);
  126. si->total_count = (int)sbi->user_block_count / sbi->blocks_per_seg;
  127. si->rsvd_segs = reserved_segments(sbi);
  128. si->overp_segs = overprovision_segments(sbi);
  129. si->valid_count = valid_user_blocks(sbi);
  130. si->discard_blks = discard_blocks(sbi);
  131. si->valid_node_count = valid_node_count(sbi);
  132. si->valid_inode_count = valid_inode_count(sbi);
  133. si->inline_xattr = atomic_read(&sbi->inline_xattr);
  134. si->inline_inode = atomic_read(&sbi->inline_inode);
  135. si->inline_dir = atomic_read(&sbi->inline_dir);
  136. si->compr_inode = atomic_read(&sbi->compr_inode);
  137. si->swapfile_inode = atomic_read(&sbi->swapfile_inode);
  138. si->compr_blocks = atomic64_read(&sbi->compr_blocks);
  139. si->append = sbi->im[APPEND_INO].ino_num;
  140. si->update = sbi->im[UPDATE_INO].ino_num;
  141. si->orphans = sbi->im[ORPHAN_INO].ino_num;
  142. si->utilization = utilization(sbi);
  143. si->free_segs = free_segments(sbi);
  144. si->free_secs = free_sections(sbi);
  145. si->prefree_count = prefree_segments(sbi);
  146. si->dirty_count = dirty_segments(sbi);
  147. if (sbi->node_inode)
  148. si->node_pages = NODE_MAPPING(sbi)->nrpages;
  149. if (sbi->meta_inode)
  150. si->meta_pages = META_MAPPING(sbi)->nrpages;
  151. #ifdef CONFIG_F2FS_FS_COMPRESSION
  152. if (sbi->compress_inode) {
  153. si->compress_pages = COMPRESS_MAPPING(sbi)->nrpages;
  154. si->compress_page_hit = atomic_read(&sbi->compress_page_hit);
  155. }
  156. #endif
  157. si->nats = NM_I(sbi)->nat_cnt[TOTAL_NAT];
  158. si->dirty_nats = NM_I(sbi)->nat_cnt[DIRTY_NAT];
  159. si->sits = MAIN_SEGS(sbi);
  160. si->dirty_sits = SIT_I(sbi)->dirty_sentries;
  161. si->free_nids = NM_I(sbi)->nid_cnt[FREE_NID];
  162. si->avail_nids = NM_I(sbi)->available_nids;
  163. si->alloc_nids = NM_I(sbi)->nid_cnt[PREALLOC_NID];
  164. si->io_skip_bggc = sbi->io_skip_bggc;
  165. si->other_skip_bggc = sbi->other_skip_bggc;
  166. si->util_free = (int)(free_user_blocks(sbi) >> sbi->log_blocks_per_seg)
  167. * 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
  168. / 2;
  169. si->util_valid = (int)(written_block_count(sbi) >>
  170. sbi->log_blocks_per_seg)
  171. * 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
  172. / 2;
  173. si->util_invalid = 50 - si->util_free - si->util_valid;
  174. for (i = CURSEG_HOT_DATA; i < NO_CHECK_TYPE; i++) {
  175. struct curseg_info *curseg = CURSEG_I(sbi, i);
  176. si->curseg[i] = curseg->segno;
  177. si->cursec[i] = GET_SEC_FROM_SEG(sbi, curseg->segno);
  178. si->curzone[i] = GET_ZONE_FROM_SEC(sbi, si->cursec[i]);
  179. }
  180. for (i = META_CP; i < META_MAX; i++)
  181. si->meta_count[i] = atomic_read(&sbi->meta_count[i]);
  182. for (i = 0; i < NO_CHECK_TYPE; i++) {
  183. si->dirty_seg[i] = 0;
  184. si->full_seg[i] = 0;
  185. si->valid_blks[i] = 0;
  186. }
  187. for (i = 0; i < MAIN_SEGS(sbi); i++) {
  188. int blks = get_seg_entry(sbi, i)->valid_blocks;
  189. int type = get_seg_entry(sbi, i)->type;
  190. if (!blks)
  191. continue;
  192. if (blks == sbi->blocks_per_seg)
  193. si->full_seg[type]++;
  194. else
  195. si->dirty_seg[type]++;
  196. si->valid_blks[type] += blks;
  197. }
  198. for (i = 0; i < 2; i++) {
  199. si->segment_count[i] = sbi->segment_count[i];
  200. si->block_count[i] = sbi->block_count[i];
  201. }
  202. si->inplace_count = atomic_read(&sbi->inplace_count);
  203. }
  204. /*
  205. * This function calculates memory footprint.
  206. */
  207. static void update_mem_info(struct f2fs_sb_info *sbi)
  208. {
  209. struct f2fs_stat_info *si = F2FS_STAT(sbi);
  210. int i;
  211. if (si->base_mem)
  212. goto get_cache;
  213. /* build stat */
  214. si->base_mem = sizeof(struct f2fs_stat_info);
  215. /* build superblock */
  216. si->base_mem += sizeof(struct f2fs_sb_info) + sbi->sb->s_blocksize;
  217. si->base_mem += 2 * sizeof(struct f2fs_inode_info);
  218. si->base_mem += sizeof(*sbi->ckpt);
  219. /* build sm */
  220. si->base_mem += sizeof(struct f2fs_sm_info);
  221. /* build sit */
  222. si->base_mem += sizeof(struct sit_info);
  223. si->base_mem += MAIN_SEGS(sbi) * sizeof(struct seg_entry);
  224. si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
  225. si->base_mem += 2 * SIT_VBLOCK_MAP_SIZE * MAIN_SEGS(sbi);
  226. si->base_mem += SIT_VBLOCK_MAP_SIZE * MAIN_SEGS(sbi);
  227. si->base_mem += SIT_VBLOCK_MAP_SIZE;
  228. if (__is_large_section(sbi))
  229. si->base_mem += MAIN_SECS(sbi) * sizeof(struct sec_entry);
  230. si->base_mem += __bitmap_size(sbi, SIT_BITMAP);
  231. /* build free segmap */
  232. si->base_mem += sizeof(struct free_segmap_info);
  233. si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
  234. si->base_mem += f2fs_bitmap_size(MAIN_SECS(sbi));
  235. /* build curseg */
  236. si->base_mem += sizeof(struct curseg_info) * NR_CURSEG_TYPE;
  237. si->base_mem += PAGE_SIZE * NR_CURSEG_TYPE;
  238. /* build dirty segmap */
  239. si->base_mem += sizeof(struct dirty_seglist_info);
  240. si->base_mem += NR_DIRTY_TYPE * f2fs_bitmap_size(MAIN_SEGS(sbi));
  241. si->base_mem += f2fs_bitmap_size(MAIN_SECS(sbi));
  242. /* build nm */
  243. si->base_mem += sizeof(struct f2fs_nm_info);
  244. si->base_mem += __bitmap_size(sbi, NAT_BITMAP);
  245. si->base_mem += (NM_I(sbi)->nat_bits_blocks << F2FS_BLKSIZE_BITS);
  246. si->base_mem += NM_I(sbi)->nat_blocks *
  247. f2fs_bitmap_size(NAT_ENTRY_PER_BLOCK);
  248. si->base_mem += NM_I(sbi)->nat_blocks / 8;
  249. si->base_mem += NM_I(sbi)->nat_blocks * sizeof(unsigned short);
  250. get_cache:
  251. si->cache_mem = 0;
  252. /* build gc */
  253. if (sbi->gc_thread)
  254. si->cache_mem += sizeof(struct f2fs_gc_kthread);
  255. /* build merge flush thread */
  256. if (SM_I(sbi)->fcc_info)
  257. si->cache_mem += sizeof(struct flush_cmd_control);
  258. if (SM_I(sbi)->dcc_info) {
  259. si->cache_mem += sizeof(struct discard_cmd_control);
  260. si->cache_mem += sizeof(struct discard_cmd) *
  261. atomic_read(&SM_I(sbi)->dcc_info->discard_cmd_cnt);
  262. }
  263. /* free nids */
  264. si->cache_mem += (NM_I(sbi)->nid_cnt[FREE_NID] +
  265. NM_I(sbi)->nid_cnt[PREALLOC_NID]) *
  266. sizeof(struct free_nid);
  267. si->cache_mem += NM_I(sbi)->nat_cnt[TOTAL_NAT] *
  268. sizeof(struct nat_entry);
  269. si->cache_mem += NM_I(sbi)->nat_cnt[DIRTY_NAT] *
  270. sizeof(struct nat_entry_set);
  271. for (i = 0; i < MAX_INO_ENTRY; i++)
  272. si->cache_mem += sbi->im[i].ino_num * sizeof(struct ino_entry);
  273. for (i = 0; i < NR_EXTENT_CACHES; i++) {
  274. struct extent_tree_info *eti = &sbi->extent_tree[i];
  275. si->ext_mem[i] = atomic_read(&eti->total_ext_tree) *
  276. sizeof(struct extent_tree);
  277. si->ext_mem[i] += atomic_read(&eti->total_ext_node) *
  278. sizeof(struct extent_node);
  279. si->cache_mem += si->ext_mem[i];
  280. }
  281. si->page_mem = 0;
  282. if (sbi->node_inode) {
  283. unsigned long npages = NODE_MAPPING(sbi)->nrpages;
  284. si->page_mem += (unsigned long long)npages << PAGE_SHIFT;
  285. }
  286. if (sbi->meta_inode) {
  287. unsigned long npages = META_MAPPING(sbi)->nrpages;
  288. si->page_mem += (unsigned long long)npages << PAGE_SHIFT;
  289. }
  290. #ifdef CONFIG_F2FS_FS_COMPRESSION
  291. if (sbi->compress_inode) {
  292. unsigned long npages = COMPRESS_MAPPING(sbi)->nrpages;
  293. si->page_mem += (unsigned long long)npages << PAGE_SHIFT;
  294. }
  295. #endif
  296. }
  297. static const char *s_flag[MAX_SBI_FLAG] = {
  298. [SBI_IS_DIRTY] = "fs_dirty",
  299. [SBI_IS_CLOSE] = "closing",
  300. [SBI_NEED_FSCK] = "need_fsck",
  301. [SBI_POR_DOING] = "recovering",
  302. [SBI_NEED_SB_WRITE] = "sb_dirty",
  303. [SBI_NEED_CP] = "need_cp",
  304. [SBI_IS_SHUTDOWN] = "shutdown",
  305. [SBI_IS_RECOVERED] = "recovered",
  306. [SBI_CP_DISABLED] = "cp_disabled",
  307. [SBI_CP_DISABLED_QUICK] = "cp_disabled_quick",
  308. [SBI_QUOTA_NEED_FLUSH] = "quota_need_flush",
  309. [SBI_QUOTA_SKIP_FLUSH] = "quota_skip_flush",
  310. [SBI_QUOTA_NEED_REPAIR] = "quota_need_repair",
  311. [SBI_IS_RESIZEFS] = "resizefs",
  312. [SBI_IS_FREEZING] = "freezefs",
  313. [SBI_IS_WRITABLE] = "writable",
  314. };
  315. static const char *ipu_mode_names[F2FS_IPU_MAX] = {
  316. [F2FS_IPU_FORCE] = "FORCE",
  317. [F2FS_IPU_SSR] = "SSR",
  318. [F2FS_IPU_UTIL] = "UTIL",
  319. [F2FS_IPU_SSR_UTIL] = "SSR_UTIL",
  320. [F2FS_IPU_FSYNC] = "FSYNC",
  321. [F2FS_IPU_ASYNC] = "ASYNC",
  322. [F2FS_IPU_NOCACHE] = "NOCACHE",
  323. [F2FS_IPU_HONOR_OPU_WRITE] = "HONOR_OPU_WRITE",
  324. };
  325. static int stat_show(struct seq_file *s, void *v)
  326. {
  327. struct f2fs_stat_info *si;
  328. int i = 0, j = 0;
  329. unsigned long flags;
  330. raw_spin_lock_irqsave(&f2fs_stat_lock, flags);
  331. list_for_each_entry(si, &f2fs_stat_list, stat_list) {
  332. struct f2fs_sb_info *sbi = si->sbi;
  333. update_general_status(sbi);
  334. seq_printf(s, "\n=====[ partition info(%pg). #%d, %s, CP: %s]=====\n",
  335. sbi->sb->s_bdev, i++,
  336. f2fs_readonly(sbi->sb) ? "RO" : "RW",
  337. is_set_ckpt_flags(sbi, CP_DISABLED_FLAG) ?
  338. "Disabled" : (f2fs_cp_error(sbi) ? "Error" : "Good"));
  339. if (sbi->s_flag) {
  340. seq_puts(s, "[SBI:");
  341. for_each_set_bit(j, &sbi->s_flag, MAX_SBI_FLAG)
  342. seq_printf(s, " %s", s_flag[j]);
  343. seq_puts(s, "]\n");
  344. }
  345. seq_printf(s, "[SB: 1] [CP: 2] [SIT: %d] [NAT: %d] ",
  346. si->sit_area_segs, si->nat_area_segs);
  347. seq_printf(s, "[SSA: %d] [MAIN: %d",
  348. si->ssa_area_segs, si->main_area_segs);
  349. seq_printf(s, "(OverProv:%d Resv:%d)]\n\n",
  350. si->overp_segs, si->rsvd_segs);
  351. seq_printf(s, "Current Time Sec: %llu / Mounted Time Sec: %llu\n\n",
  352. ktime_get_boottime_seconds(),
  353. SIT_I(sbi)->mounted_time);
  354. seq_puts(s, "Policy:\n");
  355. seq_puts(s, " - IPU: [");
  356. if (IS_F2FS_IPU_DISABLE(sbi)) {
  357. seq_puts(s, " DISABLE");
  358. } else {
  359. unsigned long policy = SM_I(sbi)->ipu_policy;
  360. for_each_set_bit(j, &policy, F2FS_IPU_MAX)
  361. seq_printf(s, " %s", ipu_mode_names[j]);
  362. }
  363. seq_puts(s, " ]\n\n");
  364. if (test_opt(sbi, DISCARD))
  365. seq_printf(s, "Utilization: %u%% (%u valid blocks, %u discard blocks)\n",
  366. si->utilization, si->valid_count, si->discard_blks);
  367. else
  368. seq_printf(s, "Utilization: %u%% (%u valid blocks)\n",
  369. si->utilization, si->valid_count);
  370. seq_printf(s, " - Node: %u (Inode: %u, ",
  371. si->valid_node_count, si->valid_inode_count);
  372. seq_printf(s, "Other: %u)\n - Data: %u\n",
  373. si->valid_node_count - si->valid_inode_count,
  374. si->valid_count - si->valid_node_count);
  375. seq_printf(s, " - Inline_xattr Inode: %u\n",
  376. si->inline_xattr);
  377. seq_printf(s, " - Inline_data Inode: %u\n",
  378. si->inline_inode);
  379. seq_printf(s, " - Inline_dentry Inode: %u\n",
  380. si->inline_dir);
  381. seq_printf(s, " - Compressed Inode: %u, Blocks: %llu\n",
  382. si->compr_inode, si->compr_blocks);
  383. seq_printf(s, " - Swapfile Inode: %u\n",
  384. si->swapfile_inode);
  385. seq_printf(s, " - Orphan/Append/Update Inode: %u, %u, %u\n",
  386. si->orphans, si->append, si->update);
  387. seq_printf(s, "\nMain area: %d segs, %d secs %d zones\n",
  388. si->main_area_segs, si->main_area_sections,
  389. si->main_area_zones);
  390. seq_printf(s, " TYPE %8s %8s %8s %10s %10s %10s\n",
  391. "segno", "secno", "zoneno", "dirty_seg", "full_seg", "valid_blk");
  392. seq_printf(s, " - COLD data: %8d %8d %8d %10u %10u %10u\n",
  393. si->curseg[CURSEG_COLD_DATA],
  394. si->cursec[CURSEG_COLD_DATA],
  395. si->curzone[CURSEG_COLD_DATA],
  396. si->dirty_seg[CURSEG_COLD_DATA],
  397. si->full_seg[CURSEG_COLD_DATA],
  398. si->valid_blks[CURSEG_COLD_DATA]);
  399. seq_printf(s, " - WARM data: %8d %8d %8d %10u %10u %10u\n",
  400. si->curseg[CURSEG_WARM_DATA],
  401. si->cursec[CURSEG_WARM_DATA],
  402. si->curzone[CURSEG_WARM_DATA],
  403. si->dirty_seg[CURSEG_WARM_DATA],
  404. si->full_seg[CURSEG_WARM_DATA],
  405. si->valid_blks[CURSEG_WARM_DATA]);
  406. seq_printf(s, " - HOT data: %8d %8d %8d %10u %10u %10u\n",
  407. si->curseg[CURSEG_HOT_DATA],
  408. si->cursec[CURSEG_HOT_DATA],
  409. si->curzone[CURSEG_HOT_DATA],
  410. si->dirty_seg[CURSEG_HOT_DATA],
  411. si->full_seg[CURSEG_HOT_DATA],
  412. si->valid_blks[CURSEG_HOT_DATA]);
  413. seq_printf(s, " - Dir dnode: %8d %8d %8d %10u %10u %10u\n",
  414. si->curseg[CURSEG_HOT_NODE],
  415. si->cursec[CURSEG_HOT_NODE],
  416. si->curzone[CURSEG_HOT_NODE],
  417. si->dirty_seg[CURSEG_HOT_NODE],
  418. si->full_seg[CURSEG_HOT_NODE],
  419. si->valid_blks[CURSEG_HOT_NODE]);
  420. seq_printf(s, " - File dnode: %8d %8d %8d %10u %10u %10u\n",
  421. si->curseg[CURSEG_WARM_NODE],
  422. si->cursec[CURSEG_WARM_NODE],
  423. si->curzone[CURSEG_WARM_NODE],
  424. si->dirty_seg[CURSEG_WARM_NODE],
  425. si->full_seg[CURSEG_WARM_NODE],
  426. si->valid_blks[CURSEG_WARM_NODE]);
  427. seq_printf(s, " - Indir nodes: %8d %8d %8d %10u %10u %10u\n",
  428. si->curseg[CURSEG_COLD_NODE],
  429. si->cursec[CURSEG_COLD_NODE],
  430. si->curzone[CURSEG_COLD_NODE],
  431. si->dirty_seg[CURSEG_COLD_NODE],
  432. si->full_seg[CURSEG_COLD_NODE],
  433. si->valid_blks[CURSEG_COLD_NODE]);
  434. seq_printf(s, " - Pinned file: %8d %8d %8d\n",
  435. si->curseg[CURSEG_COLD_DATA_PINNED],
  436. si->cursec[CURSEG_COLD_DATA_PINNED],
  437. si->curzone[CURSEG_COLD_DATA_PINNED]);
  438. seq_printf(s, " - ATGC data: %8d %8d %8d\n",
  439. si->curseg[CURSEG_ALL_DATA_ATGC],
  440. si->cursec[CURSEG_ALL_DATA_ATGC],
  441. si->curzone[CURSEG_ALL_DATA_ATGC]);
  442. seq_printf(s, "\n - Valid: %d\n - Dirty: %d\n",
  443. si->main_area_segs - si->dirty_count -
  444. si->prefree_count - si->free_segs,
  445. si->dirty_count);
  446. seq_printf(s, " - Prefree: %d\n - Free: %d (%d)\n\n",
  447. si->prefree_count, si->free_segs, si->free_secs);
  448. seq_printf(s, "CP calls: %d (BG: %d)\n",
  449. si->cp_count, si->bg_cp_count);
  450. seq_printf(s, " - cp blocks : %u\n", si->meta_count[META_CP]);
  451. seq_printf(s, " - sit blocks : %u\n",
  452. si->meta_count[META_SIT]);
  453. seq_printf(s, " - nat blocks : %u\n",
  454. si->meta_count[META_NAT]);
  455. seq_printf(s, " - ssa blocks : %u\n",
  456. si->meta_count[META_SSA]);
  457. seq_puts(s, "CP merge:\n");
  458. seq_printf(s, " - Queued : %4d\n", si->nr_queued_ckpt);
  459. seq_printf(s, " - Issued : %4d\n", si->nr_issued_ckpt);
  460. seq_printf(s, " - Total : %4d\n", si->nr_total_ckpt);
  461. seq_printf(s, " - Cur time : %4d(ms)\n", si->cur_ckpt_time);
  462. seq_printf(s, " - Peak time : %4d(ms)\n", si->peak_ckpt_time);
  463. seq_printf(s, "GC calls: %d (BG: %d)\n",
  464. si->call_count, si->bg_gc);
  465. seq_printf(s, " - data segments : %d (%d)\n",
  466. si->data_segs, si->bg_data_segs);
  467. seq_printf(s, " - node segments : %d (%d)\n",
  468. si->node_segs, si->bg_node_segs);
  469. seq_puts(s, " - Reclaimed segs :\n");
  470. seq_printf(s, " - Normal : %d\n", sbi->gc_reclaimed_segs[GC_NORMAL]);
  471. seq_printf(s, " - Idle CB : %d\n", sbi->gc_reclaimed_segs[GC_IDLE_CB]);
  472. seq_printf(s, " - Idle Greedy : %d\n",
  473. sbi->gc_reclaimed_segs[GC_IDLE_GREEDY]);
  474. seq_printf(s, " - Idle AT : %d\n", sbi->gc_reclaimed_segs[GC_IDLE_AT]);
  475. seq_printf(s, " - Urgent High : %d\n",
  476. sbi->gc_reclaimed_segs[GC_URGENT_HIGH]);
  477. seq_printf(s, " - Urgent Mid : %d\n", sbi->gc_reclaimed_segs[GC_URGENT_MID]);
  478. seq_printf(s, " - Urgent Low : %d\n", sbi->gc_reclaimed_segs[GC_URGENT_LOW]);
  479. seq_printf(s, "Try to move %d blocks (BG: %d)\n", si->tot_blks,
  480. si->bg_data_blks + si->bg_node_blks);
  481. seq_printf(s, " - data blocks : %d (%d)\n", si->data_blks,
  482. si->bg_data_blks);
  483. seq_printf(s, " - node blocks : %d (%d)\n", si->node_blks,
  484. si->bg_node_blks);
  485. seq_printf(s, "BG skip : IO: %u, Other: %u\n",
  486. si->io_skip_bggc, si->other_skip_bggc);
  487. seq_puts(s, "\nExtent Cache (Read):\n");
  488. seq_printf(s, " - Hit Count: L1-1:%llu L1-2:%llu L2:%llu\n",
  489. si->hit_largest, si->hit_cached[EX_READ],
  490. si->hit_rbtree[EX_READ]);
  491. seq_printf(s, " - Hit Ratio: %llu%% (%llu / %llu)\n",
  492. !si->total_ext[EX_READ] ? 0 :
  493. div64_u64(si->hit_total[EX_READ] * 100,
  494. si->total_ext[EX_READ]),
  495. si->hit_total[EX_READ], si->total_ext[EX_READ]);
  496. seq_printf(s, " - Inner Struct Count: tree: %d(%d), node: %d\n",
  497. si->ext_tree[EX_READ], si->zombie_tree[EX_READ],
  498. si->ext_node[EX_READ]);
  499. seq_puts(s, "\nExtent Cache (Block Age):\n");
  500. seq_printf(s, " - Allocated Data Blocks: %llu\n",
  501. si->allocated_data_blocks);
  502. seq_printf(s, " - Hit Count: L1:%llu L2:%llu\n",
  503. si->hit_cached[EX_BLOCK_AGE],
  504. si->hit_rbtree[EX_BLOCK_AGE]);
  505. seq_printf(s, " - Hit Ratio: %llu%% (%llu / %llu)\n",
  506. !si->total_ext[EX_BLOCK_AGE] ? 0 :
  507. div64_u64(si->hit_total[EX_BLOCK_AGE] * 100,
  508. si->total_ext[EX_BLOCK_AGE]),
  509. si->hit_total[EX_BLOCK_AGE],
  510. si->total_ext[EX_BLOCK_AGE]);
  511. seq_printf(s, " - Inner Struct Count: tree: %d(%d), node: %d\n",
  512. si->ext_tree[EX_BLOCK_AGE],
  513. si->zombie_tree[EX_BLOCK_AGE],
  514. si->ext_node[EX_BLOCK_AGE]);
  515. seq_puts(s, "\nBalancing F2FS Async:\n");
  516. seq_printf(s, " - DIO (R: %4d, W: %4d)\n",
  517. si->nr_dio_read, si->nr_dio_write);
  518. seq_printf(s, " - IO_R (Data: %4d, Node: %4d, Meta: %4d\n",
  519. si->nr_rd_data, si->nr_rd_node, si->nr_rd_meta);
  520. seq_printf(s, " - IO_W (CP: %4d, Data: %4d, Flush: (%4d %4d %4d), ",
  521. si->nr_wb_cp_data, si->nr_wb_data,
  522. si->nr_flushing, si->nr_flushed,
  523. si->flush_list_empty);
  524. seq_printf(s, "Discard: (%4d %4d)) cmd: %4d undiscard:%4u\n",
  525. si->nr_discarding, si->nr_discarded,
  526. si->nr_discard_cmd, si->undiscard_blks);
  527. seq_printf(s, " - atomic IO: %4d (Max. %4d)\n",
  528. si->aw_cnt, si->max_aw_cnt);
  529. seq_printf(s, " - compress: %4d, hit:%8d\n", si->compress_pages, si->compress_page_hit);
  530. seq_printf(s, " - nodes: %4d in %4d\n",
  531. si->ndirty_node, si->node_pages);
  532. seq_printf(s, " - dents: %4d in dirs:%4d (%4d)\n",
  533. si->ndirty_dent, si->ndirty_dirs, si->ndirty_all);
  534. seq_printf(s, " - datas: %4d in files:%4d\n",
  535. si->ndirty_data, si->ndirty_files);
  536. seq_printf(s, " - quota datas: %4d in quota files:%4d\n",
  537. si->ndirty_qdata, si->nquota_files);
  538. seq_printf(s, " - meta: %4d in %4d\n",
  539. si->ndirty_meta, si->meta_pages);
  540. seq_printf(s, " - imeta: %4d\n",
  541. si->ndirty_imeta);
  542. seq_printf(s, " - fsync mark: %4lld\n",
  543. percpu_counter_sum_positive(
  544. &sbi->rf_node_block_count));
  545. seq_printf(s, " - NATs: %9d/%9d\n - SITs: %9d/%9d\n",
  546. si->dirty_nats, si->nats, si->dirty_sits, si->sits);
  547. seq_printf(s, " - free_nids: %9d/%9d\n - alloc_nids: %9d\n",
  548. si->free_nids, si->avail_nids, si->alloc_nids);
  549. seq_puts(s, "\nDistribution of User Blocks:");
  550. seq_puts(s, " [ valid | invalid | free ]\n");
  551. seq_puts(s, " [");
  552. for (j = 0; j < si->util_valid; j++)
  553. seq_putc(s, '-');
  554. seq_putc(s, '|');
  555. for (j = 0; j < si->util_invalid; j++)
  556. seq_putc(s, '-');
  557. seq_putc(s, '|');
  558. for (j = 0; j < si->util_free; j++)
  559. seq_putc(s, '-');
  560. seq_puts(s, "]\n\n");
  561. seq_printf(s, "IPU: %u blocks\n", si->inplace_count);
  562. seq_printf(s, "SSR: %u blocks in %u segments\n",
  563. si->block_count[SSR], si->segment_count[SSR]);
  564. seq_printf(s, "LFS: %u blocks in %u segments\n",
  565. si->block_count[LFS], si->segment_count[LFS]);
  566. /* segment usage info */
  567. f2fs_update_sit_info(sbi);
  568. seq_printf(s, "\nBDF: %u, avg. vblocks: %u\n",
  569. si->bimodal, si->avg_vblocks);
  570. /* memory footprint */
  571. update_mem_info(sbi);
  572. seq_printf(s, "\nMemory: %llu KB\n",
  573. (si->base_mem + si->cache_mem + si->page_mem) >> 10);
  574. seq_printf(s, " - static: %llu KB\n",
  575. si->base_mem >> 10);
  576. seq_printf(s, " - cached all: %llu KB\n",
  577. si->cache_mem >> 10);
  578. seq_printf(s, " - read extent cache: %llu KB\n",
  579. si->ext_mem[EX_READ] >> 10);
  580. seq_printf(s, " - block age extent cache: %llu KB\n",
  581. si->ext_mem[EX_BLOCK_AGE] >> 10);
  582. seq_printf(s, " - paged : %llu KB\n",
  583. si->page_mem >> 10);
  584. }
  585. raw_spin_unlock_irqrestore(&f2fs_stat_lock, flags);
  586. return 0;
  587. }
  588. DEFINE_SHOW_ATTRIBUTE(stat);
  589. #endif
  590. int f2fs_build_stats(struct f2fs_sb_info *sbi)
  591. {
  592. struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
  593. struct f2fs_stat_info *si;
  594. unsigned long flags;
  595. int i;
  596. si = f2fs_kzalloc(sbi, sizeof(struct f2fs_stat_info), GFP_KERNEL);
  597. if (!si)
  598. return -ENOMEM;
  599. si->all_area_segs = le32_to_cpu(raw_super->segment_count);
  600. si->sit_area_segs = le32_to_cpu(raw_super->segment_count_sit);
  601. si->nat_area_segs = le32_to_cpu(raw_super->segment_count_nat);
  602. si->ssa_area_segs = le32_to_cpu(raw_super->segment_count_ssa);
  603. si->main_area_segs = le32_to_cpu(raw_super->segment_count_main);
  604. si->main_area_sections = le32_to_cpu(raw_super->section_count);
  605. si->main_area_zones = si->main_area_sections /
  606. le32_to_cpu(raw_super->secs_per_zone);
  607. si->sbi = sbi;
  608. sbi->stat_info = si;
  609. /* general extent cache stats */
  610. for (i = 0; i < NR_EXTENT_CACHES; i++) {
  611. atomic64_set(&sbi->total_hit_ext[i], 0);
  612. atomic64_set(&sbi->read_hit_rbtree[i], 0);
  613. atomic64_set(&sbi->read_hit_cached[i], 0);
  614. }
  615. /* read extent_cache only */
  616. atomic64_set(&sbi->read_hit_largest, 0);
  617. atomic_set(&sbi->inline_xattr, 0);
  618. atomic_set(&sbi->inline_inode, 0);
  619. atomic_set(&sbi->inline_dir, 0);
  620. atomic_set(&sbi->compr_inode, 0);
  621. atomic64_set(&sbi->compr_blocks, 0);
  622. atomic_set(&sbi->swapfile_inode, 0);
  623. atomic_set(&sbi->atomic_files, 0);
  624. atomic_set(&sbi->inplace_count, 0);
  625. for (i = META_CP; i < META_MAX; i++)
  626. atomic_set(&sbi->meta_count[i], 0);
  627. atomic_set(&sbi->max_aw_cnt, 0);
  628. raw_spin_lock_irqsave(&f2fs_stat_lock, flags);
  629. list_add_tail(&si->stat_list, &f2fs_stat_list);
  630. raw_spin_unlock_irqrestore(&f2fs_stat_lock, flags);
  631. return 0;
  632. }
  633. void f2fs_destroy_stats(struct f2fs_sb_info *sbi)
  634. {
  635. struct f2fs_stat_info *si = F2FS_STAT(sbi);
  636. unsigned long flags;
  637. raw_spin_lock_irqsave(&f2fs_stat_lock, flags);
  638. list_del(&si->stat_list);
  639. raw_spin_unlock_irqrestore(&f2fs_stat_lock, flags);
  640. kfree(si);
  641. }
  642. void __init f2fs_create_root_stats(void)
  643. {
  644. #ifdef CONFIG_DEBUG_FS
  645. f2fs_debugfs_root = debugfs_create_dir("f2fs", NULL);
  646. debugfs_create_file("status", 0444, f2fs_debugfs_root, NULL,
  647. &stat_fops);
  648. #endif
  649. }
  650. void f2fs_destroy_root_stats(void)
  651. {
  652. #ifdef CONFIG_DEBUG_FS
  653. debugfs_remove_recursive(f2fs_debugfs_root);
  654. f2fs_debugfs_root = NULL;
  655. #endif
  656. }