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