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