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