mirror of
				https://github.com/torvalds/linux.git
				synced 2025-11-04 10:40:15 +02:00 
			
		
		
		
	f2fs: show # of orphan inodes
This adds debug information for # of orphan inodes. Signed-off-by: Jaegeuk Kim <jaegeuk@kernel.org>
This commit is contained in:
		
							parent
							
								
									6e9619499f
								
							
						
					
					
						commit
						652be55162
					
				
					 2 changed files with 5 additions and 2 deletions
				
			
		| 
						 | 
					@ -58,6 +58,7 @@ static void update_general_status(struct f2fs_sb_info *sbi)
 | 
				
			||||||
	si->inline_xattr = atomic_read(&sbi->inline_xattr);
 | 
						si->inline_xattr = atomic_read(&sbi->inline_xattr);
 | 
				
			||||||
	si->inline_inode = atomic_read(&sbi->inline_inode);
 | 
						si->inline_inode = atomic_read(&sbi->inline_inode);
 | 
				
			||||||
	si->inline_dir = atomic_read(&sbi->inline_dir);
 | 
						si->inline_dir = atomic_read(&sbi->inline_dir);
 | 
				
			||||||
 | 
						si->orphans = sbi->im[ORPHAN_INO].ino_num;
 | 
				
			||||||
	si->utilization = utilization(sbi);
 | 
						si->utilization = utilization(sbi);
 | 
				
			||||||
 | 
					
 | 
				
			||||||
	si->free_segs = free_segments(sbi);
 | 
						si->free_segs = free_segments(sbi);
 | 
				
			||||||
| 
						 | 
					@ -192,7 +193,7 @@ static void update_mem_info(struct f2fs_sb_info *sbi)
 | 
				
			||||||
	si->cache_mem += NM_I(sbi)->dirty_nat_cnt *
 | 
						si->cache_mem += NM_I(sbi)->dirty_nat_cnt *
 | 
				
			||||||
					sizeof(struct nat_entry_set);
 | 
										sizeof(struct nat_entry_set);
 | 
				
			||||||
	si->cache_mem += si->inmem_pages * sizeof(struct inmem_pages);
 | 
						si->cache_mem += si->inmem_pages * sizeof(struct inmem_pages);
 | 
				
			||||||
	for (i = 0; i <= UPDATE_INO; i++)
 | 
						for (i = 0; i <= ORPHAN_INO; i++)
 | 
				
			||||||
		si->cache_mem += sbi->im[i].ino_num * sizeof(struct ino_entry);
 | 
							si->cache_mem += sbi->im[i].ino_num * sizeof(struct ino_entry);
 | 
				
			||||||
	si->cache_mem += atomic_read(&sbi->total_ext_tree) *
 | 
						si->cache_mem += atomic_read(&sbi->total_ext_tree) *
 | 
				
			||||||
						sizeof(struct extent_tree);
 | 
											sizeof(struct extent_tree);
 | 
				
			||||||
| 
						 | 
					@ -238,6 +239,8 @@ static int stat_show(struct seq_file *s, void *v)
 | 
				
			||||||
			   si->inline_inode);
 | 
								   si->inline_inode);
 | 
				
			||||||
		seq_printf(s, "  - Inline_dentry Inode: %u\n",
 | 
							seq_printf(s, "  - Inline_dentry Inode: %u\n",
 | 
				
			||||||
			   si->inline_dir);
 | 
								   si->inline_dir);
 | 
				
			||||||
 | 
							seq_printf(s, "  - Orphan Inode: %u\n",
 | 
				
			||||||
 | 
								   si->orphans);
 | 
				
			||||||
		seq_printf(s, "\nMain area: %d segs, %d secs %d zones\n",
 | 
							seq_printf(s, "\nMain area: %d segs, %d secs %d zones\n",
 | 
				
			||||||
			   si->main_area_segs, si->main_area_sections,
 | 
								   si->main_area_segs, si->main_area_sections,
 | 
				
			||||||
			   si->main_area_zones);
 | 
								   si->main_area_zones);
 | 
				
			||||||
| 
						 | 
					
 | 
				
			||||||
| 
						 | 
					@ -1997,7 +1997,7 @@ struct f2fs_stat_info {
 | 
				
			||||||
	int nats, dirty_nats, sits, dirty_sits, fnids;
 | 
						int nats, dirty_nats, sits, dirty_sits, fnids;
 | 
				
			||||||
	int total_count, utilization;
 | 
						int total_count, utilization;
 | 
				
			||||||
	int bg_gc, inmem_pages, wb_pages;
 | 
						int bg_gc, inmem_pages, wb_pages;
 | 
				
			||||||
	int inline_xattr, inline_inode, inline_dir;
 | 
						int inline_xattr, inline_inode, inline_dir, orphans;
 | 
				
			||||||
	unsigned int valid_count, valid_node_count, valid_inode_count;
 | 
						unsigned int valid_count, valid_node_count, valid_inode_count;
 | 
				
			||||||
	unsigned int bimodal, avg_vblocks;
 | 
						unsigned int bimodal, avg_vblocks;
 | 
				
			||||||
	int util_free, util_valid, util_invalid;
 | 
						int util_free, util_valid, util_invalid;
 | 
				
			||||||
| 
						 | 
					
 | 
				
			||||||
		Loading…
	
		Reference in a new issue