debug.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516
  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_qdata = get_pages(sbi, F2FS_DIRTY_QDATA);
  44. si->ndirty_imeta = get_pages(sbi, F2FS_DIRTY_IMETA);
  45. si->ndirty_dirs = sbi->ndirty_inode[DIR_INODE];
  46. si->ndirty_files = sbi->ndirty_inode[FILE_INODE];
  47. si->nquota_files = sbi->nquota_files;
  48. si->ndirty_all = sbi->ndirty_inode[DIRTY_META];
  49. si->inmem_pages = get_pages(sbi, F2FS_INMEM_PAGES);
  50. si->aw_cnt = atomic_read(&sbi->aw_cnt);
  51. si->vw_cnt = atomic_read(&sbi->vw_cnt);
  52. si->max_aw_cnt = atomic_read(&sbi->max_aw_cnt);
  53. si->max_vw_cnt = atomic_read(&sbi->max_vw_cnt);
  54. si->nr_wb_cp_data = get_pages(sbi, F2FS_WB_CP_DATA);
  55. si->nr_wb_data = get_pages(sbi, F2FS_WB_DATA);
  56. if (SM_I(sbi) && SM_I(sbi)->fcc_info) {
  57. si->nr_flushed =
  58. atomic_read(&SM_I(sbi)->fcc_info->issued_flush);
  59. si->nr_flushing =
  60. atomic_read(&SM_I(sbi)->fcc_info->issing_flush);
  61. si->flush_list_empty =
  62. llist_empty(&SM_I(sbi)->fcc_info->issue_list);
  63. }
  64. if (SM_I(sbi) && SM_I(sbi)->dcc_info) {
  65. si->nr_discarded =
  66. atomic_read(&SM_I(sbi)->dcc_info->issued_discard);
  67. si->nr_discarding =
  68. atomic_read(&SM_I(sbi)->dcc_info->issing_discard);
  69. si->nr_discard_cmd =
  70. atomic_read(&SM_I(sbi)->dcc_info->discard_cmd_cnt);
  71. si->undiscard_blks = SM_I(sbi)->dcc_info->undiscard_blks;
  72. }
  73. si->total_count = (int)sbi->user_block_count / sbi->blocks_per_seg;
  74. si->rsvd_segs = reserved_segments(sbi);
  75. si->overp_segs = overprovision_segments(sbi);
  76. si->valid_count = valid_user_blocks(sbi);
  77. si->discard_blks = discard_blocks(sbi);
  78. si->valid_node_count = valid_node_count(sbi);
  79. si->valid_inode_count = valid_inode_count(sbi);
  80. si->inline_xattr = atomic_read(&sbi->inline_xattr);
  81. si->inline_inode = atomic_read(&sbi->inline_inode);
  82. si->inline_dir = atomic_read(&sbi->inline_dir);
  83. si->append = sbi->im[APPEND_INO].ino_num;
  84. si->update = sbi->im[UPDATE_INO].ino_num;
  85. si->orphans = sbi->im[ORPHAN_INO].ino_num;
  86. si->utilization = utilization(sbi);
  87. si->free_segs = free_segments(sbi);
  88. si->free_secs = free_sections(sbi);
  89. si->prefree_count = prefree_segments(sbi);
  90. si->dirty_count = dirty_segments(sbi);
  91. si->node_pages = NODE_MAPPING(sbi)->nrpages;
  92. si->meta_pages = META_MAPPING(sbi)->nrpages;
  93. si->nats = NM_I(sbi)->nat_cnt;
  94. si->dirty_nats = NM_I(sbi)->dirty_nat_cnt;
  95. si->sits = MAIN_SEGS(sbi);
  96. si->dirty_sits = SIT_I(sbi)->dirty_sentries;
  97. si->free_nids = NM_I(sbi)->nid_cnt[FREE_NID];
  98. si->avail_nids = NM_I(sbi)->available_nids;
  99. si->alloc_nids = NM_I(sbi)->nid_cnt[PREALLOC_NID];
  100. si->bg_gc = sbi->bg_gc;
  101. si->util_free = (int)(free_user_blocks(sbi) >> sbi->log_blocks_per_seg)
  102. * 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
  103. / 2;
  104. si->util_valid = (int)(written_block_count(sbi) >>
  105. sbi->log_blocks_per_seg)
  106. * 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
  107. / 2;
  108. si->util_invalid = 50 - si->util_free - si->util_valid;
  109. for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_NODE; i++) {
  110. struct curseg_info *curseg = CURSEG_I(sbi, i);
  111. si->curseg[i] = curseg->segno;
  112. si->cursec[i] = GET_SEC_FROM_SEG(sbi, curseg->segno);
  113. si->curzone[i] = GET_ZONE_FROM_SEC(sbi, si->cursec[i]);
  114. }
  115. for (i = 0; i < 2; i++) {
  116. si->segment_count[i] = sbi->segment_count[i];
  117. si->block_count[i] = sbi->block_count[i];
  118. }
  119. si->inplace_count = atomic_read(&sbi->inplace_count);
  120. }
  121. /*
  122. * This function calculates BDF of every segments
  123. */
  124. static void update_sit_info(struct f2fs_sb_info *sbi)
  125. {
  126. struct f2fs_stat_info *si = F2FS_STAT(sbi);
  127. unsigned long long blks_per_sec, hblks_per_sec, total_vblocks;
  128. unsigned long long bimodal, dist;
  129. unsigned int segno, vblocks;
  130. int ndirty = 0;
  131. bimodal = 0;
  132. total_vblocks = 0;
  133. blks_per_sec = BLKS_PER_SEC(sbi);
  134. hblks_per_sec = blks_per_sec / 2;
  135. for (segno = 0; segno < MAIN_SEGS(sbi); segno += sbi->segs_per_sec) {
  136. vblocks = get_valid_blocks(sbi, segno, true);
  137. dist = abs(vblocks - hblks_per_sec);
  138. bimodal += dist * dist;
  139. if (vblocks > 0 && vblocks < blks_per_sec) {
  140. total_vblocks += vblocks;
  141. ndirty++;
  142. }
  143. }
  144. dist = div_u64(MAIN_SECS(sbi) * hblks_per_sec * hblks_per_sec, 100);
  145. si->bimodal = div64_u64(bimodal, dist);
  146. if (si->dirty_count)
  147. si->avg_vblocks = div_u64(total_vblocks, ndirty);
  148. else
  149. si->avg_vblocks = 0;
  150. }
  151. /*
  152. * This function calculates memory footprint.
  153. */
  154. static void update_mem_info(struct f2fs_sb_info *sbi)
  155. {
  156. struct f2fs_stat_info *si = F2FS_STAT(sbi);
  157. unsigned npages;
  158. int i;
  159. if (si->base_mem)
  160. goto get_cache;
  161. /* build stat */
  162. si->base_mem = sizeof(struct f2fs_stat_info);
  163. /* build superblock */
  164. si->base_mem += sizeof(struct f2fs_sb_info) + sbi->sb->s_blocksize;
  165. si->base_mem += 2 * sizeof(struct f2fs_inode_info);
  166. si->base_mem += sizeof(*sbi->ckpt);
  167. /* build sm */
  168. si->base_mem += sizeof(struct f2fs_sm_info);
  169. /* build sit */
  170. si->base_mem += sizeof(struct sit_info);
  171. si->base_mem += MAIN_SEGS(sbi) * sizeof(struct seg_entry);
  172. si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
  173. si->base_mem += 2 * SIT_VBLOCK_MAP_SIZE * MAIN_SEGS(sbi);
  174. if (f2fs_discard_en(sbi))
  175. si->base_mem += SIT_VBLOCK_MAP_SIZE * MAIN_SEGS(sbi);
  176. si->base_mem += SIT_VBLOCK_MAP_SIZE;
  177. if (sbi->segs_per_sec > 1)
  178. si->base_mem += MAIN_SECS(sbi) * sizeof(struct sec_entry);
  179. si->base_mem += __bitmap_size(sbi, SIT_BITMAP);
  180. /* build free segmap */
  181. si->base_mem += sizeof(struct free_segmap_info);
  182. si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
  183. si->base_mem += f2fs_bitmap_size(MAIN_SECS(sbi));
  184. /* build curseg */
  185. si->base_mem += sizeof(struct curseg_info) * NR_CURSEG_TYPE;
  186. si->base_mem += PAGE_SIZE * NR_CURSEG_TYPE;
  187. /* build dirty segmap */
  188. si->base_mem += sizeof(struct dirty_seglist_info);
  189. si->base_mem += NR_DIRTY_TYPE * f2fs_bitmap_size(MAIN_SEGS(sbi));
  190. si->base_mem += f2fs_bitmap_size(MAIN_SECS(sbi));
  191. /* build nm */
  192. si->base_mem += sizeof(struct f2fs_nm_info);
  193. si->base_mem += __bitmap_size(sbi, NAT_BITMAP);
  194. si->base_mem += (NM_I(sbi)->nat_bits_blocks << F2FS_BLKSIZE_BITS);
  195. si->base_mem += NM_I(sbi)->nat_blocks * NAT_ENTRY_BITMAP_SIZE;
  196. si->base_mem += NM_I(sbi)->nat_blocks / 8;
  197. si->base_mem += NM_I(sbi)->nat_blocks * sizeof(unsigned short);
  198. get_cache:
  199. si->cache_mem = 0;
  200. /* build gc */
  201. if (sbi->gc_thread)
  202. si->cache_mem += sizeof(struct f2fs_gc_kthread);
  203. /* build merge flush thread */
  204. if (SM_I(sbi)->fcc_info)
  205. si->cache_mem += sizeof(struct flush_cmd_control);
  206. if (SM_I(sbi)->dcc_info) {
  207. si->cache_mem += sizeof(struct discard_cmd_control);
  208. si->cache_mem += sizeof(struct discard_cmd) *
  209. atomic_read(&SM_I(sbi)->dcc_info->discard_cmd_cnt);
  210. }
  211. /* free nids */
  212. si->cache_mem += (NM_I(sbi)->nid_cnt[FREE_NID] +
  213. NM_I(sbi)->nid_cnt[PREALLOC_NID]) *
  214. sizeof(struct free_nid);
  215. si->cache_mem += NM_I(sbi)->nat_cnt * sizeof(struct nat_entry);
  216. si->cache_mem += NM_I(sbi)->dirty_nat_cnt *
  217. sizeof(struct nat_entry_set);
  218. si->cache_mem += si->inmem_pages * sizeof(struct inmem_pages);
  219. for (i = 0; i < MAX_INO_ENTRY; i++)
  220. si->cache_mem += sbi->im[i].ino_num * sizeof(struct ino_entry);
  221. si->cache_mem += atomic_read(&sbi->total_ext_tree) *
  222. sizeof(struct extent_tree);
  223. si->cache_mem += atomic_read(&sbi->total_ext_node) *
  224. sizeof(struct extent_node);
  225. si->page_mem = 0;
  226. npages = NODE_MAPPING(sbi)->nrpages;
  227. si->page_mem += (unsigned long long)npages << PAGE_SHIFT;
  228. npages = META_MAPPING(sbi)->nrpages;
  229. si->page_mem += (unsigned long long)npages << PAGE_SHIFT;
  230. }
  231. static int stat_show(struct seq_file *s, void *v)
  232. {
  233. struct f2fs_stat_info *si;
  234. int i = 0;
  235. int j;
  236. mutex_lock(&f2fs_stat_mutex);
  237. list_for_each_entry(si, &f2fs_stat_list, stat_list) {
  238. update_general_status(si->sbi);
  239. seq_printf(s, "\n=====[ partition info(%pg). #%d, %s, CP: %s]=====\n",
  240. si->sbi->sb->s_bdev, i++,
  241. f2fs_readonly(si->sbi->sb) ? "RO": "RW",
  242. f2fs_cp_error(si->sbi) ? "Error": "Good");
  243. seq_printf(s, "[SB: 1] [CP: 2] [SIT: %d] [NAT: %d] ",
  244. si->sit_area_segs, si->nat_area_segs);
  245. seq_printf(s, "[SSA: %d] [MAIN: %d",
  246. si->ssa_area_segs, si->main_area_segs);
  247. seq_printf(s, "(OverProv:%d Resv:%d)]\n\n",
  248. si->overp_segs, si->rsvd_segs);
  249. if (test_opt(si->sbi, DISCARD))
  250. seq_printf(s, "Utilization: %u%% (%u valid blocks, %u discard blocks)\n",
  251. si->utilization, si->valid_count, si->discard_blks);
  252. else
  253. seq_printf(s, "Utilization: %u%% (%u valid blocks)\n",
  254. si->utilization, si->valid_count);
  255. seq_printf(s, " - Node: %u (Inode: %u, ",
  256. si->valid_node_count, si->valid_inode_count);
  257. seq_printf(s, "Other: %u)\n - Data: %u\n",
  258. si->valid_node_count - si->valid_inode_count,
  259. si->valid_count - si->valid_node_count);
  260. seq_printf(s, " - Inline_xattr Inode: %u\n",
  261. si->inline_xattr);
  262. seq_printf(s, " - Inline_data Inode: %u\n",
  263. si->inline_inode);
  264. seq_printf(s, " - Inline_dentry Inode: %u\n",
  265. si->inline_dir);
  266. seq_printf(s, " - Orphan/Append/Update Inode: %u, %u, %u\n",
  267. si->orphans, si->append, si->update);
  268. seq_printf(s, "\nMain area: %d segs, %d secs %d zones\n",
  269. si->main_area_segs, si->main_area_sections,
  270. si->main_area_zones);
  271. seq_printf(s, " - COLD data: %d, %d, %d\n",
  272. si->curseg[CURSEG_COLD_DATA],
  273. si->cursec[CURSEG_COLD_DATA],
  274. si->curzone[CURSEG_COLD_DATA]);
  275. seq_printf(s, " - WARM data: %d, %d, %d\n",
  276. si->curseg[CURSEG_WARM_DATA],
  277. si->cursec[CURSEG_WARM_DATA],
  278. si->curzone[CURSEG_WARM_DATA]);
  279. seq_printf(s, " - HOT data: %d, %d, %d\n",
  280. si->curseg[CURSEG_HOT_DATA],
  281. si->cursec[CURSEG_HOT_DATA],
  282. si->curzone[CURSEG_HOT_DATA]);
  283. seq_printf(s, " - Dir dnode: %d, %d, %d\n",
  284. si->curseg[CURSEG_HOT_NODE],
  285. si->cursec[CURSEG_HOT_NODE],
  286. si->curzone[CURSEG_HOT_NODE]);
  287. seq_printf(s, " - File dnode: %d, %d, %d\n",
  288. si->curseg[CURSEG_WARM_NODE],
  289. si->cursec[CURSEG_WARM_NODE],
  290. si->curzone[CURSEG_WARM_NODE]);
  291. seq_printf(s, " - Indir nodes: %d, %d, %d\n",
  292. si->curseg[CURSEG_COLD_NODE],
  293. si->cursec[CURSEG_COLD_NODE],
  294. si->curzone[CURSEG_COLD_NODE]);
  295. seq_printf(s, "\n - Valid: %d\n - Dirty: %d\n",
  296. si->main_area_segs - si->dirty_count -
  297. si->prefree_count - si->free_segs,
  298. si->dirty_count);
  299. seq_printf(s, " - Prefree: %d\n - Free: %d (%d)\n\n",
  300. si->prefree_count, si->free_segs, si->free_secs);
  301. seq_printf(s, "CP calls: %d (BG: %d)\n",
  302. si->cp_count, si->bg_cp_count);
  303. seq_printf(s, "GC calls: %d (BG: %d)\n",
  304. si->call_count, si->bg_gc);
  305. seq_printf(s, " - data segments : %d (%d)\n",
  306. si->data_segs, si->bg_data_segs);
  307. seq_printf(s, " - node segments : %d (%d)\n",
  308. si->node_segs, si->bg_node_segs);
  309. seq_printf(s, "Try to move %d blocks (BG: %d)\n", si->tot_blks,
  310. si->bg_data_blks + si->bg_node_blks);
  311. seq_printf(s, " - data blocks : %d (%d)\n", si->data_blks,
  312. si->bg_data_blks);
  313. seq_printf(s, " - node blocks : %d (%d)\n", si->node_blks,
  314. si->bg_node_blks);
  315. seq_puts(s, "\nExtent Cache:\n");
  316. seq_printf(s, " - Hit Count: L1-1:%llu L1-2:%llu L2:%llu\n",
  317. si->hit_largest, si->hit_cached,
  318. si->hit_rbtree);
  319. seq_printf(s, " - Hit Ratio: %llu%% (%llu / %llu)\n",
  320. !si->total_ext ? 0 :
  321. div64_u64(si->hit_total * 100, si->total_ext),
  322. si->hit_total, si->total_ext);
  323. seq_printf(s, " - Inner Struct Count: tree: %d(%d), node: %d\n",
  324. si->ext_tree, si->zombie_tree, si->ext_node);
  325. seq_puts(s, "\nBalancing F2FS Async:\n");
  326. seq_printf(s, " - IO (CP: %4d, Data: %4d, Flush: (%4d %4d %4d), "
  327. "Discard: (%4d %4d)) cmd: %4d undiscard:%4u\n",
  328. si->nr_wb_cp_data, si->nr_wb_data,
  329. si->nr_flushing, si->nr_flushed,
  330. si->flush_list_empty,
  331. si->nr_discarding, si->nr_discarded,
  332. si->nr_discard_cmd, si->undiscard_blks);
  333. seq_printf(s, " - inmem: %4d, atomic IO: %4d (Max. %4d), "
  334. "volatile IO: %4d (Max. %4d)\n",
  335. si->inmem_pages, si->aw_cnt, si->max_aw_cnt,
  336. si->vw_cnt, si->max_vw_cnt);
  337. seq_printf(s, " - nodes: %4d in %4d\n",
  338. si->ndirty_node, si->node_pages);
  339. seq_printf(s, " - dents: %4d in dirs:%4d (%4d)\n",
  340. si->ndirty_dent, si->ndirty_dirs, si->ndirty_all);
  341. seq_printf(s, " - datas: %4d in files:%4d\n",
  342. si->ndirty_data, si->ndirty_files);
  343. seq_printf(s, " - quota datas: %4d in quota files:%4d\n",
  344. si->ndirty_qdata, si->nquota_files);
  345. seq_printf(s, " - meta: %4d in %4d\n",
  346. si->ndirty_meta, si->meta_pages);
  347. seq_printf(s, " - imeta: %4d\n",
  348. si->ndirty_imeta);
  349. seq_printf(s, " - NATs: %9d/%9d\n - SITs: %9d/%9d\n",
  350. si->dirty_nats, si->nats, si->dirty_sits, si->sits);
  351. seq_printf(s, " - free_nids: %9d/%9d\n - alloc_nids: %9d\n",
  352. si->free_nids, si->avail_nids, si->alloc_nids);
  353. seq_puts(s, "\nDistribution of User Blocks:");
  354. seq_puts(s, " [ valid | invalid | free ]\n");
  355. seq_puts(s, " [");
  356. for (j = 0; j < si->util_valid; j++)
  357. seq_putc(s, '-');
  358. seq_putc(s, '|');
  359. for (j = 0; j < si->util_invalid; j++)
  360. seq_putc(s, '-');
  361. seq_putc(s, '|');
  362. for (j = 0; j < si->util_free; j++)
  363. seq_putc(s, '-');
  364. seq_puts(s, "]\n\n");
  365. seq_printf(s, "IPU: %u blocks\n", si->inplace_count);
  366. seq_printf(s, "SSR: %u blocks in %u segments\n",
  367. si->block_count[SSR], si->segment_count[SSR]);
  368. seq_printf(s, "LFS: %u blocks in %u segments\n",
  369. si->block_count[LFS], si->segment_count[LFS]);
  370. /* segment usage info */
  371. update_sit_info(si->sbi);
  372. seq_printf(s, "\nBDF: %u, avg. vblocks: %u\n",
  373. si->bimodal, si->avg_vblocks);
  374. /* memory footprint */
  375. update_mem_info(si->sbi);
  376. seq_printf(s, "\nMemory: %llu KB\n",
  377. (si->base_mem + si->cache_mem + si->page_mem) >> 10);
  378. seq_printf(s, " - static: %llu KB\n",
  379. si->base_mem >> 10);
  380. seq_printf(s, " - cached: %llu KB\n",
  381. si->cache_mem >> 10);
  382. seq_printf(s, " - paged : %llu KB\n",
  383. si->page_mem >> 10);
  384. }
  385. mutex_unlock(&f2fs_stat_mutex);
  386. return 0;
  387. }
  388. static int stat_open(struct inode *inode, struct file *file)
  389. {
  390. return single_open(file, stat_show, inode->i_private);
  391. }
  392. static const struct file_operations stat_fops = {
  393. .owner = THIS_MODULE,
  394. .open = stat_open,
  395. .read = seq_read,
  396. .llseek = seq_lseek,
  397. .release = single_release,
  398. };
  399. int f2fs_build_stats(struct f2fs_sb_info *sbi)
  400. {
  401. struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
  402. struct f2fs_stat_info *si;
  403. si = f2fs_kzalloc(sbi, sizeof(struct f2fs_stat_info), GFP_KERNEL);
  404. if (!si)
  405. return -ENOMEM;
  406. si->all_area_segs = le32_to_cpu(raw_super->segment_count);
  407. si->sit_area_segs = le32_to_cpu(raw_super->segment_count_sit);
  408. si->nat_area_segs = le32_to_cpu(raw_super->segment_count_nat);
  409. si->ssa_area_segs = le32_to_cpu(raw_super->segment_count_ssa);
  410. si->main_area_segs = le32_to_cpu(raw_super->segment_count_main);
  411. si->main_area_sections = le32_to_cpu(raw_super->section_count);
  412. si->main_area_zones = si->main_area_sections /
  413. le32_to_cpu(raw_super->secs_per_zone);
  414. si->sbi = sbi;
  415. sbi->stat_info = si;
  416. atomic64_set(&sbi->total_hit_ext, 0);
  417. atomic64_set(&sbi->read_hit_rbtree, 0);
  418. atomic64_set(&sbi->read_hit_largest, 0);
  419. atomic64_set(&sbi->read_hit_cached, 0);
  420. atomic_set(&sbi->inline_xattr, 0);
  421. atomic_set(&sbi->inline_inode, 0);
  422. atomic_set(&sbi->inline_dir, 0);
  423. atomic_set(&sbi->inplace_count, 0);
  424. atomic_set(&sbi->aw_cnt, 0);
  425. atomic_set(&sbi->vw_cnt, 0);
  426. atomic_set(&sbi->max_aw_cnt, 0);
  427. atomic_set(&sbi->max_vw_cnt, 0);
  428. mutex_lock(&f2fs_stat_mutex);
  429. list_add_tail(&si->stat_list, &f2fs_stat_list);
  430. mutex_unlock(&f2fs_stat_mutex);
  431. return 0;
  432. }
  433. void f2fs_destroy_stats(struct f2fs_sb_info *sbi)
  434. {
  435. struct f2fs_stat_info *si = F2FS_STAT(sbi);
  436. mutex_lock(&f2fs_stat_mutex);
  437. list_del(&si->stat_list);
  438. mutex_unlock(&f2fs_stat_mutex);
  439. kfree(si);
  440. }
  441. int __init f2fs_create_root_stats(void)
  442. {
  443. struct dentry *file;
  444. f2fs_debugfs_root = debugfs_create_dir("f2fs", NULL);
  445. if (!f2fs_debugfs_root)
  446. return -ENOMEM;
  447. file = debugfs_create_file("status", S_IRUGO, f2fs_debugfs_root,
  448. NULL, &stat_fops);
  449. if (!file) {
  450. debugfs_remove(f2fs_debugfs_root);
  451. f2fs_debugfs_root = NULL;
  452. return -ENOMEM;
  453. }
  454. return 0;
  455. }
  456. void f2fs_destroy_root_stats(void)
  457. {
  458. if (!f2fs_debugfs_root)
  459. return;
  460. debugfs_remove_recursive(f2fs_debugfs_root);
  461. f2fs_debugfs_root = NULL;
  462. }