?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
Merge branch 'drm-nouveau-fixes-3.9' of git://anongit.freedesktop.org/git/nouveau...
[linux-2.6/libata-dev.git] / fs / f2fs / debug.c
blob025b9e2f935d811566d9fa1f2d2b1e3e738da73d
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/proc_fs.h>
17 #include <linux/f2fs_fs.h>
18 #include <linux/blkdev.h>
19 #include <linux/debugfs.h>
20 #include <linux/seq_file.h>
21
22 #include "f2fs.h"
23 #include "node.h"
24 #include "segment.h"
25 #include "gc.h"
26
27 static LIST_HEAD(f2fs_stat_list);
28 static struct dentry *debugfs_root;
29 static DEFINE_MUTEX(f2fs_stat_mutex);
30
31 static void update_general_status(struct f2fs_sb_info *sbi)
32 {
33 struct f2fs_stat_info *si = sbi->stat_info;
34 int i;
35
36 /* valid check of the segment numbers */
37 si->hit_ext = sbi->read_hit_ext;
38 si->total_ext = sbi->total_hit_ext;
39 si->ndirty_node = get_pages(sbi, F2FS_DIRTY_NODES);
40 si->ndirty_dent = get_pages(sbi, F2FS_DIRTY_DENTS);
41 si->ndirty_dirs = sbi->n_dirty_dirs;
42 si->ndirty_meta = get_pages(sbi, F2FS_DIRTY_META);
43 si->total_count = (int)sbi->user_block_count / sbi->blocks_per_seg;
44 si->rsvd_segs = reserved_segments(sbi);
45 si->overp_segs = overprovision_segments(sbi);
46 si->valid_count = valid_user_blocks(sbi);
47 si->valid_node_count = valid_node_count(sbi);
48 si->valid_inode_count = valid_inode_count(sbi);
49 si->utilization = utilization(sbi);
50
51 si->free_segs = free_segments(sbi);
52 si->free_secs = free_sections(sbi);
53 si->prefree_count = prefree_segments(sbi);
54 si->dirty_count = dirty_segments(sbi);
55 si->node_pages = sbi->node_inode->i_mapping->nrpages;
56 si->meta_pages = sbi->meta_inode->i_mapping->nrpages;
57 si->nats = NM_I(sbi)->nat_cnt;
58 si->sits = SIT_I(sbi)->dirty_sentries;
59 si->fnids = NM_I(sbi)->fcnt;
60 si->bg_gc = sbi->bg_gc;
61 si->util_free = (int)(free_user_blocks(sbi) >> sbi->log_blocks_per_seg)
62 * 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
63 / 2;
64 si->util_valid = (int)(written_block_count(sbi) >>
65 sbi->log_blocks_per_seg)
66 * 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
67 / 2;
68 si->util_invalid = 50 - si->util_free - si->util_valid;
69 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_NODE; i++) {
70 struct curseg_info *curseg = CURSEG_I(sbi, i);
71 si->curseg[i] = curseg->segno;
72 si->cursec[i] = curseg->segno / sbi->segs_per_sec;
73 si->curzone[i] = si->cursec[i] / sbi->secs_per_zone;
74 }
75
76 for (i = 0; i < 2; i++) {
77 si->segment_count[i] = sbi->segment_count[i];
78 si->block_count[i] = sbi->block_count[i];
79 }
80 }
81
82 /*
83 * This function calculates BDF of every segments
84 */
85 static void update_sit_info(struct f2fs_sb_info *sbi)
86 {
87 struct f2fs_stat_info *si = sbi->stat_info;
88 unsigned int blks_per_sec, hblks_per_sec, total_vblocks, bimodal, dist;
89 struct sit_info *sit_i = SIT_I(sbi);
90 unsigned int segno, vblocks;
91 int ndirty = 0;
92
93 bimodal = 0;
94 total_vblocks = 0;
95 blks_per_sec = sbi->segs_per_sec * (1 << sbi->log_blocks_per_seg);
96 hblks_per_sec = blks_per_sec / 2;
97 mutex_lock(&sit_i->sentry_lock);
98 for (segno = 0; segno < TOTAL_SEGS(sbi); segno += sbi->segs_per_sec) {
99 vblocks = get_valid_blocks(sbi, segno, sbi->segs_per_sec);
100 dist = abs(vblocks - hblks_per_sec);
101 bimodal += dist * dist;
102
103 if (vblocks > 0 && vblocks < blks_per_sec) {
104 total_vblocks += vblocks;
105 ndirty++;
106 }
107 }
108 mutex_unlock(&sit_i->sentry_lock);
109 dist = sbi->total_sections * hblks_per_sec * hblks_per_sec / 100;
110 si->bimodal = bimodal / dist;
111 if (si->dirty_count)
112 si->avg_vblocks = total_vblocks / ndirty;
113 else
114 si->avg_vblocks = 0;
115 }
116
117 /*
118 * This function calculates memory footprint.
119 */
120 static void update_mem_info(struct f2fs_sb_info *sbi)
121 {
122 struct f2fs_stat_info *si = sbi->stat_info;
123 unsigned npages;
124
125 if (si->base_mem)
126 goto get_cache;
127
128 si->base_mem = sizeof(struct f2fs_sb_info) + sbi->sb->s_blocksize;
129 si->base_mem += 2 * sizeof(struct f2fs_inode_info);
130 si->base_mem += sizeof(*sbi->ckpt);
131
132 /* build sm */
133 si->base_mem += sizeof(struct f2fs_sm_info);
134
135 /* build sit */
136 si->base_mem += sizeof(struct sit_info);
137 si->base_mem += TOTAL_SEGS(sbi) * sizeof(struct seg_entry);
138 si->base_mem += f2fs_bitmap_size(TOTAL_SEGS(sbi));
139 si->base_mem += 2 * SIT_VBLOCK_MAP_SIZE * TOTAL_SEGS(sbi);
140 if (sbi->segs_per_sec > 1)
141 si->base_mem += sbi->total_sections *
142 sizeof(struct sec_entry);
143 si->base_mem += __bitmap_size(sbi, SIT_BITMAP);
144
145 /* build free segmap */
146 si->base_mem += sizeof(struct free_segmap_info);
147 si->base_mem += f2fs_bitmap_size(TOTAL_SEGS(sbi));
148 si->base_mem += f2fs_bitmap_size(sbi->total_sections);
149
150 /* build curseg */
151 si->base_mem += sizeof(struct curseg_info) * NR_CURSEG_TYPE;
152 si->base_mem += PAGE_CACHE_SIZE * NR_CURSEG_TYPE;
153
154 /* build dirty segmap */
155 si->base_mem += sizeof(struct dirty_seglist_info);
156 si->base_mem += NR_DIRTY_TYPE * f2fs_bitmap_size(TOTAL_SEGS(sbi));
157 si->base_mem += 2 * f2fs_bitmap_size(TOTAL_SEGS(sbi));
158
159 /* buld nm */
160 si->base_mem += sizeof(struct f2fs_nm_info);
161 si->base_mem += __bitmap_size(sbi, NAT_BITMAP);
162
163 /* build gc */
164 si->base_mem += sizeof(struct f2fs_gc_kthread);
165
166 get_cache:
167 /* free nids */
168 si->cache_mem = NM_I(sbi)->fcnt;
169 si->cache_mem += NM_I(sbi)->nat_cnt;
170 npages = sbi->node_inode->i_mapping->nrpages;
171 si->cache_mem += npages << PAGE_CACHE_SHIFT;
172 npages = sbi->meta_inode->i_mapping->nrpages;
173 si->cache_mem += npages << PAGE_CACHE_SHIFT;
174 si->cache_mem += sbi->n_orphans * sizeof(struct orphan_inode_entry);
175 si->cache_mem += sbi->n_dirty_dirs * sizeof(struct dir_inode_entry);
176 }
177
178 static int stat_show(struct seq_file *s, void *v)
179 {
180 struct f2fs_stat_info *si, *next;
181 int i = 0;
182 int j;
183
184 mutex_lock(&f2fs_stat_mutex);
185 list_for_each_entry_safe(si, next, &f2fs_stat_list, stat_list) {
186 char devname[BDEVNAME_SIZE];
187
188 update_general_status(si->sbi);
189
190 seq_printf(s, "\n=====[ partition info(%s). #%d ]=====\n",
191 bdevname(si->sbi->sb->s_bdev, devname), i++);
192 seq_printf(s, "[SB: 1] [CP: 2] [SIT: %d] [NAT: %d] ",
193 si->sit_area_segs, si->nat_area_segs);
194 seq_printf(s, "[SSA: %d] [MAIN: %d",
195 si->ssa_area_segs, si->main_area_segs);
196 seq_printf(s, "(OverProv:%d Resv:%d)]\n\n",
197 si->overp_segs, si->rsvd_segs);
198 seq_printf(s, "Utilization: %d%% (%d valid blocks)\n",
199 si->utilization, si->valid_count);
200 seq_printf(s, " - Node: %u (Inode: %u, ",
201 si->valid_node_count, si->valid_inode_count);
202 seq_printf(s, "Other: %u)\n - Data: %u\n",
203 si->valid_node_count - si->valid_inode_count,
204 si->valid_count - si->valid_node_count);
205 seq_printf(s, "\nMain area: %d segs, %d secs %d zones\n",
206 si->main_area_segs, si->main_area_sections,
207 si->main_area_zones);
208 seq_printf(s, " - COLD data: %d, %d, %d\n",
209 si->curseg[CURSEG_COLD_DATA],
210 si->cursec[CURSEG_COLD_DATA],
211 si->curzone[CURSEG_COLD_DATA]);
212 seq_printf(s, " - WARM data: %d, %d, %d\n",
213 si->curseg[CURSEG_WARM_DATA],
214 si->cursec[CURSEG_WARM_DATA],
215 si->curzone[CURSEG_WARM_DATA]);
216 seq_printf(s, " - HOT data: %d, %d, %d\n",
217 si->curseg[CURSEG_HOT_DATA],
218 si->cursec[CURSEG_HOT_DATA],
219 si->curzone[CURSEG_HOT_DATA]);
220 seq_printf(s, " - Dir dnode: %d, %d, %d\n",
221 si->curseg[CURSEG_HOT_NODE],
222 si->cursec[CURSEG_HOT_NODE],
223 si->curzone[CURSEG_HOT_NODE]);
224 seq_printf(s, " - File dnode: %d, %d, %d\n",
225 si->curseg[CURSEG_WARM_NODE],
226 si->cursec[CURSEG_WARM_NODE],
227 si->curzone[CURSEG_WARM_NODE]);
228 seq_printf(s, " - Indir nodes: %d, %d, %d\n",
229 si->curseg[CURSEG_COLD_NODE],
230 si->cursec[CURSEG_COLD_NODE],
231 si->curzone[CURSEG_COLD_NODE]);
232 seq_printf(s, "\n - Valid: %d\n - Dirty: %d\n",
233 si->main_area_segs - si->dirty_count -
234 si->prefree_count - si->free_segs,
235 si->dirty_count);
236 seq_printf(s, " - Prefree: %d\n - Free: %d (%d)\n\n",
237 si->prefree_count, si->free_segs, si->free_secs);
238 seq_printf(s, "GC calls: %d (BG: %d)\n",
239 si->call_count, si->bg_gc);
240 seq_printf(s, " - data segments : %d\n", si->data_segs);
241 seq_printf(s, " - node segments : %d\n", si->node_segs);
242 seq_printf(s, "Try to move %d blocks\n", si->tot_blks);
243 seq_printf(s, " - data blocks : %d\n", si->data_blks);
244 seq_printf(s, " - node blocks : %d\n", si->node_blks);
245 seq_printf(s, "\nExtent Hit Ratio: %d / %d\n",
246 si->hit_ext, si->total_ext);
247 seq_printf(s, "\nBalancing F2FS Async:\n");
248 seq_printf(s, " - nodes %4d in %4d\n",
249 si->ndirty_node, si->node_pages);
250 seq_printf(s, " - dents %4d in dirs:%4d\n",
251 si->ndirty_dent, si->ndirty_dirs);
252 seq_printf(s, " - meta %4d in %4d\n",
253 si->ndirty_meta, si->meta_pages);
254 seq_printf(s, " - NATs %5d > %lu\n",
255 si->nats, NM_WOUT_THRESHOLD);
256 seq_printf(s, " - SITs: %5d\n - free_nids: %5d\n",
257 si->sits, si->fnids);
258 seq_printf(s, "\nDistribution of User Blocks:");
259 seq_printf(s, " [ valid | invalid | free ]\n");
260 seq_printf(s, " [");
261
262 for (j = 0; j < si->util_valid; j++)
263 seq_printf(s, "-");
264 seq_printf(s, "|");
265
266 for (j = 0; j < si->util_invalid; j++)
267 seq_printf(s, "-");
268 seq_printf(s, "|");
269
270 for (j = 0; j < si->util_free; j++)
271 seq_printf(s, "-");
272 seq_printf(s, "]\n\n");
273 seq_printf(s, "SSR: %u blocks in %u segments\n",
274 si->block_count[SSR], si->segment_count[SSR]);
275 seq_printf(s, "LFS: %u blocks in %u segments\n",
276 si->block_count[LFS], si->segment_count[LFS]);
277
278 /* segment usage info */
279 update_sit_info(si->sbi);
280 seq_printf(s, "\nBDF: %u, avg. vblocks: %u\n",
281 si->bimodal, si->avg_vblocks);
282
283 /* memory footprint */
284 update_mem_info(si->sbi);
285 seq_printf(s, "\nMemory: %u KB = static: %u + cached: %u\n",
286 (si->base_mem + si->cache_mem) >> 10,
287 si->base_mem >> 10, si->cache_mem >> 10);
288 }
289 mutex_unlock(&f2fs_stat_mutex);
290 return 0;
291 }
292
293 static int stat_open(struct inode *inode, struct file *file)
294 {
295 return single_open(file, stat_show, inode->i_private);
296 }
297
298 static const struct file_operations stat_fops = {
299 .open = stat_open,
300 .read = seq_read,
301 .llseek = seq_lseek,
302 .release = single_release,
303 };
304
305 int f2fs_build_stats(struct f2fs_sb_info *sbi)
306 {
307 struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
308 struct f2fs_stat_info *si;
309
310 sbi->stat_info = kzalloc(sizeof(struct f2fs_stat_info), GFP_KERNEL);
311 if (!sbi->stat_info)
312 return -ENOMEM;
313
314 si = sbi->stat_info;
315 si->all_area_segs = le32_to_cpu(raw_super->segment_count);
316 si->sit_area_segs = le32_to_cpu(raw_super->segment_count_sit);
317 si->nat_area_segs = le32_to_cpu(raw_super->segment_count_nat);
318 si->ssa_area_segs = le32_to_cpu(raw_super->segment_count_ssa);
319 si->main_area_segs = le32_to_cpu(raw_super->segment_count_main);
320 si->main_area_sections = le32_to_cpu(raw_super->section_count);
321 si->main_area_zones = si->main_area_sections /
322 le32_to_cpu(raw_super->secs_per_zone);
323 si->sbi = sbi;
324
325 mutex_lock(&f2fs_stat_mutex);
326 list_add_tail(&si->stat_list, &f2fs_stat_list);
327 mutex_unlock(&f2fs_stat_mutex);
328
329 return 0;
330 }
331
332 void f2fs_destroy_stats(struct f2fs_sb_info *sbi)
333 {
334 struct f2fs_stat_info *si = sbi->stat_info;
335
336 mutex_lock(&f2fs_stat_mutex);
337 list_del(&si->stat_list);
338 mutex_unlock(&f2fs_stat_mutex);
339
340 kfree(sbi->stat_info);
341 }
342
343 void __init f2fs_create_root_stats(void)
344 {
345 debugfs_root = debugfs_create_dir("f2fs", NULL);
346 if (debugfs_root)
347 debugfs_create_file("status", S_IRUGO, debugfs_root,
348 NULL, &stat_fops);
349 }
350
351 void f2fs_destroy_root_stats(void)
352 {
353 debugfs_remove_recursive(debugfs_root);
354 debugfs_root = NULL;
355 }
Linux 2.6 libata-dev (mirror)