]>
Commit | Line | Data |
---|---|---|
ac27a0ec | 1 | /* |
617ba13b | 2 | * linux/fs/ext4/ialloc.c |
ac27a0ec DK |
3 | * |
4 | * Copyright (C) 1992, 1993, 1994, 1995 | |
5 | * Remy Card (card@masi.ibp.fr) | |
6 | * Laboratoire MASI - Institut Blaise Pascal | |
7 | * Universite Pierre et Marie Curie (Paris VI) | |
8 | * | |
9 | * BSD ufs-inspired inode and directory allocation by | |
10 | * Stephen Tweedie (sct@redhat.com), 1993 | |
11 | * Big-endian to little-endian byte-swapping/bitmaps by | |
12 | * David S. Miller (davem@caip.rutgers.edu), 1995 | |
13 | */ | |
14 | ||
15 | #include <linux/time.h> | |
16 | #include <linux/fs.h> | |
dab291af | 17 | #include <linux/jbd2.h> |
ac27a0ec DK |
18 | #include <linux/stat.h> |
19 | #include <linux/string.h> | |
20 | #include <linux/quotaops.h> | |
21 | #include <linux/buffer_head.h> | |
22 | #include <linux/random.h> | |
23 | #include <linux/bitops.h> | |
3a5b2ecd | 24 | #include <linux/blkdev.h> |
ac27a0ec | 25 | #include <asm/byteorder.h> |
9bffad1e | 26 | |
3dcf5451 CH |
27 | #include "ext4.h" |
28 | #include "ext4_jbd2.h" | |
ac27a0ec DK |
29 | #include "xattr.h" |
30 | #include "acl.h" | |
31 | ||
9bffad1e TT |
32 | #include <trace/events/ext4.h> |
33 | ||
ac27a0ec DK |
34 | /* |
35 | * ialloc.c contains the inodes allocation and deallocation routines | |
36 | */ | |
37 | ||
38 | /* | |
39 | * The free inodes are managed by bitmaps. A file system contains several | |
40 | * blocks groups. Each group contains 1 bitmap block for blocks, 1 bitmap | |
41 | * block for inodes, N blocks for the inode table and data blocks. | |
42 | * | |
43 | * The file system contains group descriptors which are located after the | |
44 | * super block. Each descriptor contains the number of the bitmap block and | |
45 | * the free blocks count in the block. | |
46 | */ | |
47 | ||
717d50e4 AD |
48 | /* |
49 | * To avoid calling the atomic setbit hundreds or thousands of times, we only | |
50 | * need to use it within a single byte (to ensure we get endianness right). | |
51 | * We can use memset for the rest of the bitmap as there are no other users. | |
52 | */ | |
61d08673 | 53 | void ext4_mark_bitmap_end(int start_bit, int end_bit, char *bitmap) |
717d50e4 AD |
54 | { |
55 | int i; | |
56 | ||
57 | if (start_bit >= end_bit) | |
58 | return; | |
59 | ||
60 | ext4_debug("mark end bits +%d through +%d used\n", start_bit, end_bit); | |
61 | for (i = start_bit; i < ((start_bit + 7) & ~7UL); i++) | |
62 | ext4_set_bit(i, bitmap); | |
63 | if (i < end_bit) | |
64 | memset(bitmap + (i >> 3), 0xff, (end_bit - i) >> 3); | |
65 | } | |
66 | ||
67 | /* Initializes an uninitialized inode bitmap */ | |
1f109d5a TT |
68 | static unsigned ext4_init_inode_bitmap(struct super_block *sb, |
69 | struct buffer_head *bh, | |
70 | ext4_group_t block_group, | |
71 | struct ext4_group_desc *gdp) | |
717d50e4 AD |
72 | { |
73 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
74 | ||
75 | J_ASSERT_BH(bh, buffer_locked(bh)); | |
76 | ||
77 | /* If checksum is bad mark all blocks and inodes use to prevent | |
78 | * allocation, essentially implementing a per-group read-only flag. */ | |
79 | if (!ext4_group_desc_csum_verify(sbi, block_group, gdp)) { | |
12062ddd | 80 | ext4_error(sb, "Checksum bad for group %u", block_group); |
021b65bb | 81 | ext4_free_group_clusters_set(sb, gdp, 0); |
560671a0 AK |
82 | ext4_free_inodes_set(sb, gdp, 0); |
83 | ext4_itable_unused_set(sb, gdp, 0); | |
717d50e4 AD |
84 | memset(bh->b_data, 0xff, sb->s_blocksize); |
85 | return 0; | |
86 | } | |
87 | ||
88 | memset(bh->b_data, 0, (EXT4_INODES_PER_GROUP(sb) + 7) / 8); | |
61d08673 | 89 | ext4_mark_bitmap_end(EXT4_INODES_PER_GROUP(sb), sb->s_blocksize * 8, |
717d50e4 AD |
90 | bh->b_data); |
91 | ||
92 | return EXT4_INODES_PER_GROUP(sb); | |
93 | } | |
ac27a0ec | 94 | |
813e5727 TT |
95 | void ext4_end_bitmap_read(struct buffer_head *bh, int uptodate) |
96 | { | |
97 | if (uptodate) { | |
98 | set_buffer_uptodate(bh); | |
99 | set_bitmap_uptodate(bh); | |
100 | } | |
101 | unlock_buffer(bh); | |
102 | put_bh(bh); | |
103 | } | |
104 | ||
ac27a0ec DK |
105 | /* |
106 | * Read the inode allocation bitmap for a given block_group, reading | |
107 | * into the specified slot in the superblock's bitmap cache. | |
108 | * | |
109 | * Return buffer_head of bitmap on success or NULL. | |
110 | */ | |
111 | static struct buffer_head * | |
e29d1cde | 112 | ext4_read_inode_bitmap(struct super_block *sb, ext4_group_t block_group) |
ac27a0ec | 113 | { |
617ba13b | 114 | struct ext4_group_desc *desc; |
ac27a0ec | 115 | struct buffer_head *bh = NULL; |
e29d1cde | 116 | ext4_fsblk_t bitmap_blk; |
ac27a0ec | 117 | |
617ba13b | 118 | desc = ext4_get_group_desc(sb, block_group, NULL); |
ac27a0ec | 119 | if (!desc) |
e29d1cde | 120 | return NULL; |
bfff6873 | 121 | |
e29d1cde ES |
122 | bitmap_blk = ext4_inode_bitmap(sb, desc); |
123 | bh = sb_getblk(sb, bitmap_blk); | |
124 | if (unlikely(!bh)) { | |
12062ddd | 125 | ext4_error(sb, "Cannot read inode bitmap - " |
a9df9a49 | 126 | "block_group = %u, inode_bitmap = %llu", |
e29d1cde ES |
127 | block_group, bitmap_blk); |
128 | return NULL; | |
129 | } | |
2ccb5fb9 | 130 | if (bitmap_uptodate(bh)) |
e29d1cde ES |
131 | return bh; |
132 | ||
c806e68f | 133 | lock_buffer(bh); |
2ccb5fb9 AK |
134 | if (bitmap_uptodate(bh)) { |
135 | unlock_buffer(bh); | |
136 | return bh; | |
137 | } | |
bfff6873 | 138 | |
955ce5f5 | 139 | ext4_lock_group(sb, block_group); |
717d50e4 | 140 | if (desc->bg_flags & cpu_to_le16(EXT4_BG_INODE_UNINIT)) { |
e29d1cde | 141 | ext4_init_inode_bitmap(sb, bh, block_group, desc); |
2ccb5fb9 | 142 | set_bitmap_uptodate(bh); |
e29d1cde | 143 | set_buffer_uptodate(bh); |
955ce5f5 | 144 | ext4_unlock_group(sb, block_group); |
3300beda | 145 | unlock_buffer(bh); |
e29d1cde | 146 | return bh; |
717d50e4 | 147 | } |
955ce5f5 | 148 | ext4_unlock_group(sb, block_group); |
bfff6873 | 149 | |
2ccb5fb9 AK |
150 | if (buffer_uptodate(bh)) { |
151 | /* | |
152 | * if not uninit if bh is uptodate, | |
153 | * bitmap is also uptodate | |
154 | */ | |
155 | set_bitmap_uptodate(bh); | |
156 | unlock_buffer(bh); | |
157 | return bh; | |
158 | } | |
159 | /* | |
813e5727 | 160 | * submit the buffer_head for reading |
2ccb5fb9 | 161 | */ |
0562e0ba | 162 | trace_ext4_load_inode_bitmap(sb, block_group); |
813e5727 TT |
163 | bh->b_end_io = ext4_end_bitmap_read; |
164 | get_bh(bh); | |
165 | submit_bh(READ, bh); | |
166 | wait_on_buffer(bh); | |
167 | if (!buffer_uptodate(bh)) { | |
e29d1cde | 168 | put_bh(bh); |
12062ddd | 169 | ext4_error(sb, "Cannot read inode bitmap - " |
813e5727 TT |
170 | "block_group = %u, inode_bitmap = %llu", |
171 | block_group, bitmap_blk); | |
e29d1cde ES |
172 | return NULL; |
173 | } | |
ac27a0ec DK |
174 | return bh; |
175 | } | |
176 | ||
177 | /* | |
178 | * NOTE! When we get the inode, we're the only people | |
179 | * that have access to it, and as such there are no | |
180 | * race conditions we have to worry about. The inode | |
181 | * is not on the hash-lists, and it cannot be reached | |
182 | * through the filesystem because the directory entry | |
183 | * has been deleted earlier. | |
184 | * | |
185 | * HOWEVER: we must make sure that we get no aliases, | |
186 | * which means that we have to call "clear_inode()" | |
187 | * _before_ we mark the inode not in use in the inode | |
188 | * bitmaps. Otherwise a newly created file might use | |
189 | * the same inode number (not actually the same pointer | |
190 | * though), and then we'd have two inodes sharing the | |
191 | * same inode number and space on the harddisk. | |
192 | */ | |
af5bc92d | 193 | void ext4_free_inode(handle_t *handle, struct inode *inode) |
ac27a0ec | 194 | { |
af5bc92d | 195 | struct super_block *sb = inode->i_sb; |
ac27a0ec DK |
196 | int is_directory; |
197 | unsigned long ino; | |
198 | struct buffer_head *bitmap_bh = NULL; | |
199 | struct buffer_head *bh2; | |
fd2d4291 | 200 | ext4_group_t block_group; |
ac27a0ec | 201 | unsigned long bit; |
af5bc92d TT |
202 | struct ext4_group_desc *gdp; |
203 | struct ext4_super_block *es; | |
617ba13b | 204 | struct ext4_sb_info *sbi; |
7ce9d5d1 | 205 | int fatal = 0, err, count, cleared; |
ac27a0ec DK |
206 | |
207 | if (atomic_read(&inode->i_count) > 1) { | |
4776004f TT |
208 | printk(KERN_ERR "ext4_free_inode: inode has count=%d\n", |
209 | atomic_read(&inode->i_count)); | |
ac27a0ec DK |
210 | return; |
211 | } | |
212 | if (inode->i_nlink) { | |
4776004f TT |
213 | printk(KERN_ERR "ext4_free_inode: inode has nlink=%d\n", |
214 | inode->i_nlink); | |
ac27a0ec DK |
215 | return; |
216 | } | |
217 | if (!sb) { | |
4776004f TT |
218 | printk(KERN_ERR "ext4_free_inode: inode on " |
219 | "nonexistent device\n"); | |
ac27a0ec DK |
220 | return; |
221 | } | |
617ba13b | 222 | sbi = EXT4_SB(sb); |
ac27a0ec DK |
223 | |
224 | ino = inode->i_ino; | |
af5bc92d | 225 | ext4_debug("freeing inode %lu\n", ino); |
9bffad1e | 226 | trace_ext4_free_inode(inode); |
ac27a0ec DK |
227 | |
228 | /* | |
229 | * Note: we must free any quota before locking the superblock, | |
230 | * as writing the quota to disk may need the lock as well. | |
231 | */ | |
871a2931 | 232 | dquot_initialize(inode); |
617ba13b | 233 | ext4_xattr_delete_inode(handle, inode); |
63936dda | 234 | dquot_free_inode(inode); |
9f754758 | 235 | dquot_drop(inode); |
ac27a0ec DK |
236 | |
237 | is_directory = S_ISDIR(inode->i_mode); | |
238 | ||
239 | /* Do this BEFORE marking the inode not in use or returning an error */ | |
0930fcc1 | 240 | ext4_clear_inode(inode); |
ac27a0ec | 241 | |
617ba13b MC |
242 | es = EXT4_SB(sb)->s_es; |
243 | if (ino < EXT4_FIRST_INO(sb) || ino > le32_to_cpu(es->s_inodes_count)) { | |
12062ddd | 244 | ext4_error(sb, "reserved or nonexistent inode %lu", ino); |
ac27a0ec DK |
245 | goto error_return; |
246 | } | |
617ba13b MC |
247 | block_group = (ino - 1) / EXT4_INODES_PER_GROUP(sb); |
248 | bit = (ino - 1) % EXT4_INODES_PER_GROUP(sb); | |
e29d1cde | 249 | bitmap_bh = ext4_read_inode_bitmap(sb, block_group); |
ac27a0ec DK |
250 | if (!bitmap_bh) |
251 | goto error_return; | |
252 | ||
253 | BUFFER_TRACE(bitmap_bh, "get_write_access"); | |
617ba13b | 254 | fatal = ext4_journal_get_write_access(handle, bitmap_bh); |
ac27a0ec DK |
255 | if (fatal) |
256 | goto error_return; | |
257 | ||
d17413c0 DM |
258 | fatal = -ESRCH; |
259 | gdp = ext4_get_group_desc(sb, block_group, &bh2); | |
260 | if (gdp) { | |
ac27a0ec | 261 | BUFFER_TRACE(bh2, "get_write_access"); |
617ba13b | 262 | fatal = ext4_journal_get_write_access(handle, bh2); |
d17413c0 DM |
263 | } |
264 | ext4_lock_group(sb, block_group); | |
597d508c | 265 | cleared = ext4_test_and_clear_bit(bit, bitmap_bh->b_data); |
d17413c0 DM |
266 | if (fatal || !cleared) { |
267 | ext4_unlock_group(sb, block_group); | |
268 | goto out; | |
269 | } | |
7d39db14 | 270 | |
d17413c0 DM |
271 | count = ext4_free_inodes_count(sb, gdp) + 1; |
272 | ext4_free_inodes_set(sb, gdp, count); | |
273 | if (is_directory) { | |
274 | count = ext4_used_dirs_count(sb, gdp) - 1; | |
275 | ext4_used_dirs_set(sb, gdp, count); | |
276 | percpu_counter_dec(&sbi->s_dirs_counter); | |
ac27a0ec | 277 | } |
d17413c0 DM |
278 | gdp->bg_checksum = ext4_group_desc_csum(sbi, block_group, gdp); |
279 | ext4_unlock_group(sb, block_group); | |
ac27a0ec | 280 | |
d17413c0 DM |
281 | percpu_counter_inc(&sbi->s_freeinodes_counter); |
282 | if (sbi->s_log_groups_per_flex) { | |
283 | ext4_group_t f = ext4_flex_group(sbi, block_group); | |
9f24e420 | 284 | |
d17413c0 DM |
285 | atomic_inc(&sbi->s_flex_groups[f].free_inodes); |
286 | if (is_directory) | |
287 | atomic_dec(&sbi->s_flex_groups[f].used_dirs); | |
ac27a0ec | 288 | } |
d17413c0 DM |
289 | BUFFER_TRACE(bh2, "call ext4_handle_dirty_metadata"); |
290 | fatal = ext4_handle_dirty_metadata(handle, NULL, bh2); | |
291 | out: | |
292 | if (cleared) { | |
293 | BUFFER_TRACE(bitmap_bh, "call ext4_handle_dirty_metadata"); | |
294 | err = ext4_handle_dirty_metadata(handle, NULL, bitmap_bh); | |
295 | if (!fatal) | |
296 | fatal = err; | |
a0375156 | 297 | ext4_mark_super_dirty(sb); |
d17413c0 DM |
298 | } else |
299 | ext4_error(sb, "bit already cleared for inode %lu", ino); | |
300 | ||
ac27a0ec DK |
301 | error_return: |
302 | brelse(bitmap_bh); | |
617ba13b | 303 | ext4_std_error(sb, fatal); |
ac27a0ec DK |
304 | } |
305 | ||
a4912123 TT |
306 | struct orlov_stats { |
307 | __u32 free_inodes; | |
24aaa8ef | 308 | __u32 free_clusters; |
a4912123 TT |
309 | __u32 used_dirs; |
310 | }; | |
311 | ||
312 | /* | |
313 | * Helper function for Orlov's allocator; returns critical information | |
314 | * for a particular block group or flex_bg. If flex_size is 1, then g | |
315 | * is a block group number; otherwise it is flex_bg number. | |
316 | */ | |
1f109d5a TT |
317 | static void get_orlov_stats(struct super_block *sb, ext4_group_t g, |
318 | int flex_size, struct orlov_stats *stats) | |
a4912123 TT |
319 | { |
320 | struct ext4_group_desc *desc; | |
7d39db14 | 321 | struct flex_groups *flex_group = EXT4_SB(sb)->s_flex_groups; |
a4912123 | 322 | |
7d39db14 TT |
323 | if (flex_size > 1) { |
324 | stats->free_inodes = atomic_read(&flex_group[g].free_inodes); | |
24aaa8ef | 325 | stats->free_clusters = atomic_read(&flex_group[g].free_clusters); |
7d39db14 TT |
326 | stats->used_dirs = atomic_read(&flex_group[g].used_dirs); |
327 | return; | |
328 | } | |
a4912123 | 329 | |
7d39db14 TT |
330 | desc = ext4_get_group_desc(sb, g, NULL); |
331 | if (desc) { | |
332 | stats->free_inodes = ext4_free_inodes_count(sb, desc); | |
021b65bb | 333 | stats->free_clusters = ext4_free_group_clusters(sb, desc); |
7d39db14 TT |
334 | stats->used_dirs = ext4_used_dirs_count(sb, desc); |
335 | } else { | |
336 | stats->free_inodes = 0; | |
24aaa8ef | 337 | stats->free_clusters = 0; |
7d39db14 | 338 | stats->used_dirs = 0; |
a4912123 TT |
339 | } |
340 | } | |
341 | ||
ac27a0ec DK |
342 | /* |
343 | * Orlov's allocator for directories. | |
344 | * | |
345 | * We always try to spread first-level directories. | |
346 | * | |
347 | * If there are blockgroups with both free inodes and free blocks counts | |
348 | * not worse than average we return one with smallest directory count. | |
349 | * Otherwise we simply return a random group. | |
350 | * | |
351 | * For the rest rules look so: | |
352 | * | |
353 | * It's OK to put directory into a group unless | |
354 | * it has too many directories already (max_dirs) or | |
355 | * it has too few free inodes left (min_inodes) or | |
356 | * it has too few free blocks left (min_blocks) or | |
1cc8dcf5 | 357 | * Parent's group is preferred, if it doesn't satisfy these |
ac27a0ec DK |
358 | * conditions we search cyclically through the rest. If none |
359 | * of the groups look good we just look for a group with more | |
360 | * free inodes than average (starting at parent's group). | |
ac27a0ec DK |
361 | */ |
362 | ||
2aa9fc4c | 363 | static int find_group_orlov(struct super_block *sb, struct inode *parent, |
dcca3fec | 364 | ext4_group_t *group, umode_t mode, |
f157a4aa | 365 | const struct qstr *qstr) |
ac27a0ec | 366 | { |
fd2d4291 | 367 | ext4_group_t parent_group = EXT4_I(parent)->i_block_group; |
617ba13b | 368 | struct ext4_sb_info *sbi = EXT4_SB(sb); |
8df9675f | 369 | ext4_group_t real_ngroups = ext4_get_groups_count(sb); |
617ba13b | 370 | int inodes_per_group = EXT4_INODES_PER_GROUP(sb); |
14c83c9f | 371 | unsigned int freei, avefreei, grp_free; |
24aaa8ef | 372 | ext4_fsblk_t freeb, avefreec; |
ac27a0ec | 373 | unsigned int ndirs; |
a4912123 | 374 | int max_dirs, min_inodes; |
24aaa8ef | 375 | ext4_grpblk_t min_clusters; |
8df9675f | 376 | ext4_group_t i, grp, g, ngroups; |
617ba13b | 377 | struct ext4_group_desc *desc; |
a4912123 TT |
378 | struct orlov_stats stats; |
379 | int flex_size = ext4_flex_bg_size(sbi); | |
f157a4aa | 380 | struct dx_hash_info hinfo; |
a4912123 | 381 | |
8df9675f | 382 | ngroups = real_ngroups; |
a4912123 | 383 | if (flex_size > 1) { |
8df9675f | 384 | ngroups = (real_ngroups + flex_size - 1) >> |
a4912123 TT |
385 | sbi->s_log_groups_per_flex; |
386 | parent_group >>= sbi->s_log_groups_per_flex; | |
387 | } | |
ac27a0ec DK |
388 | |
389 | freei = percpu_counter_read_positive(&sbi->s_freeinodes_counter); | |
390 | avefreei = freei / ngroups; | |
57042651 TT |
391 | freeb = EXT4_C2B(sbi, |
392 | percpu_counter_read_positive(&sbi->s_freeclusters_counter)); | |
24aaa8ef TT |
393 | avefreec = freeb; |
394 | do_div(avefreec, ngroups); | |
ac27a0ec DK |
395 | ndirs = percpu_counter_read_positive(&sbi->s_dirs_counter); |
396 | ||
a4912123 TT |
397 | if (S_ISDIR(mode) && |
398 | ((parent == sb->s_root->d_inode) || | |
12e9b892 | 399 | (ext4_test_inode_flag(parent, EXT4_INODE_TOPDIR)))) { |
ac27a0ec | 400 | int best_ndir = inodes_per_group; |
2aa9fc4c | 401 | int ret = -1; |
ac27a0ec | 402 | |
f157a4aa TT |
403 | if (qstr) { |
404 | hinfo.hash_version = DX_HASH_HALF_MD4; | |
405 | hinfo.seed = sbi->s_hash_seed; | |
406 | ext4fs_dirhash(qstr->name, qstr->len, &hinfo); | |
407 | grp = hinfo.hash; | |
408 | } else | |
409 | get_random_bytes(&grp, sizeof(grp)); | |
2aa9fc4c | 410 | parent_group = (unsigned)grp % ngroups; |
ac27a0ec | 411 | for (i = 0; i < ngroups; i++) { |
a4912123 TT |
412 | g = (parent_group + i) % ngroups; |
413 | get_orlov_stats(sb, g, flex_size, &stats); | |
414 | if (!stats.free_inodes) | |
ac27a0ec | 415 | continue; |
a4912123 | 416 | if (stats.used_dirs >= best_ndir) |
ac27a0ec | 417 | continue; |
a4912123 | 418 | if (stats.free_inodes < avefreei) |
ac27a0ec | 419 | continue; |
24aaa8ef | 420 | if (stats.free_clusters < avefreec) |
ac27a0ec | 421 | continue; |
a4912123 | 422 | grp = g; |
2aa9fc4c | 423 | ret = 0; |
a4912123 TT |
424 | best_ndir = stats.used_dirs; |
425 | } | |
426 | if (ret) | |
427 | goto fallback; | |
428 | found_flex_bg: | |
429 | if (flex_size == 1) { | |
430 | *group = grp; | |
431 | return 0; | |
432 | } | |
433 | ||
434 | /* | |
435 | * We pack inodes at the beginning of the flexgroup's | |
436 | * inode tables. Block allocation decisions will do | |
437 | * something similar, although regular files will | |
438 | * start at 2nd block group of the flexgroup. See | |
439 | * ext4_ext_find_goal() and ext4_find_near(). | |
440 | */ | |
441 | grp *= flex_size; | |
442 | for (i = 0; i < flex_size; i++) { | |
8df9675f | 443 | if (grp+i >= real_ngroups) |
a4912123 TT |
444 | break; |
445 | desc = ext4_get_group_desc(sb, grp+i, NULL); | |
446 | if (desc && ext4_free_inodes_count(sb, desc)) { | |
447 | *group = grp+i; | |
448 | return 0; | |
449 | } | |
ac27a0ec | 450 | } |
ac27a0ec DK |
451 | goto fallback; |
452 | } | |
453 | ||
ac27a0ec | 454 | max_dirs = ndirs / ngroups + inodes_per_group / 16; |
a4912123 TT |
455 | min_inodes = avefreei - inodes_per_group*flex_size / 4; |
456 | if (min_inodes < 1) | |
457 | min_inodes = 1; | |
24aaa8ef | 458 | min_clusters = avefreec - EXT4_CLUSTERS_PER_GROUP(sb)*flex_size / 4; |
a4912123 TT |
459 | |
460 | /* | |
461 | * Start looking in the flex group where we last allocated an | |
462 | * inode for this parent directory | |
463 | */ | |
464 | if (EXT4_I(parent)->i_last_alloc_group != ~0) { | |
465 | parent_group = EXT4_I(parent)->i_last_alloc_group; | |
466 | if (flex_size > 1) | |
467 | parent_group >>= sbi->s_log_groups_per_flex; | |
468 | } | |
ac27a0ec DK |
469 | |
470 | for (i = 0; i < ngroups; i++) { | |
a4912123 TT |
471 | grp = (parent_group + i) % ngroups; |
472 | get_orlov_stats(sb, grp, flex_size, &stats); | |
473 | if (stats.used_dirs >= max_dirs) | |
ac27a0ec | 474 | continue; |
a4912123 | 475 | if (stats.free_inodes < min_inodes) |
ac27a0ec | 476 | continue; |
24aaa8ef | 477 | if (stats.free_clusters < min_clusters) |
ac27a0ec | 478 | continue; |
a4912123 | 479 | goto found_flex_bg; |
ac27a0ec DK |
480 | } |
481 | ||
482 | fallback: | |
8df9675f | 483 | ngroups = real_ngroups; |
a4912123 | 484 | avefreei = freei / ngroups; |
b5451f7b | 485 | fallback_retry: |
a4912123 | 486 | parent_group = EXT4_I(parent)->i_block_group; |
ac27a0ec | 487 | for (i = 0; i < ngroups; i++) { |
a4912123 TT |
488 | grp = (parent_group + i) % ngroups; |
489 | desc = ext4_get_group_desc(sb, grp, NULL); | |
14c83c9f TT |
490 | grp_free = ext4_free_inodes_count(sb, desc); |
491 | if (desc && grp_free && grp_free >= avefreei) { | |
a4912123 | 492 | *group = grp; |
2aa9fc4c | 493 | return 0; |
a4912123 | 494 | } |
ac27a0ec DK |
495 | } |
496 | ||
497 | if (avefreei) { | |
498 | /* | |
499 | * The free-inodes counter is approximate, and for really small | |
500 | * filesystems the above test can fail to find any blockgroups | |
501 | */ | |
502 | avefreei = 0; | |
b5451f7b | 503 | goto fallback_retry; |
ac27a0ec DK |
504 | } |
505 | ||
506 | return -1; | |
507 | } | |
508 | ||
2aa9fc4c | 509 | static int find_group_other(struct super_block *sb, struct inode *parent, |
dcca3fec | 510 | ext4_group_t *group, umode_t mode) |
ac27a0ec | 511 | { |
fd2d4291 | 512 | ext4_group_t parent_group = EXT4_I(parent)->i_block_group; |
8df9675f | 513 | ext4_group_t i, last, ngroups = ext4_get_groups_count(sb); |
617ba13b | 514 | struct ext4_group_desc *desc; |
a4912123 TT |
515 | int flex_size = ext4_flex_bg_size(EXT4_SB(sb)); |
516 | ||
517 | /* | |
518 | * Try to place the inode is the same flex group as its | |
519 | * parent. If we can't find space, use the Orlov algorithm to | |
520 | * find another flex group, and store that information in the | |
521 | * parent directory's inode information so that use that flex | |
522 | * group for future allocations. | |
523 | */ | |
524 | if (flex_size > 1) { | |
525 | int retry = 0; | |
526 | ||
527 | try_again: | |
528 | parent_group &= ~(flex_size-1); | |
529 | last = parent_group + flex_size; | |
530 | if (last > ngroups) | |
531 | last = ngroups; | |
532 | for (i = parent_group; i < last; i++) { | |
533 | desc = ext4_get_group_desc(sb, i, NULL); | |
534 | if (desc && ext4_free_inodes_count(sb, desc)) { | |
535 | *group = i; | |
536 | return 0; | |
537 | } | |
538 | } | |
539 | if (!retry && EXT4_I(parent)->i_last_alloc_group != ~0) { | |
540 | retry = 1; | |
541 | parent_group = EXT4_I(parent)->i_last_alloc_group; | |
542 | goto try_again; | |
543 | } | |
544 | /* | |
545 | * If this didn't work, use the Orlov search algorithm | |
546 | * to find a new flex group; we pass in the mode to | |
547 | * avoid the topdir algorithms. | |
548 | */ | |
549 | *group = parent_group + flex_size; | |
550 | if (*group > ngroups) | |
551 | *group = 0; | |
7dc57615 | 552 | return find_group_orlov(sb, parent, group, mode, NULL); |
a4912123 | 553 | } |
ac27a0ec DK |
554 | |
555 | /* | |
556 | * Try to place the inode in its parent directory | |
557 | */ | |
2aa9fc4c AM |
558 | *group = parent_group; |
559 | desc = ext4_get_group_desc(sb, *group, NULL); | |
560671a0 | 560 | if (desc && ext4_free_inodes_count(sb, desc) && |
021b65bb | 561 | ext4_free_group_clusters(sb, desc)) |
2aa9fc4c | 562 | return 0; |
ac27a0ec DK |
563 | |
564 | /* | |
565 | * We're going to place this inode in a different blockgroup from its | |
566 | * parent. We want to cause files in a common directory to all land in | |
567 | * the same blockgroup. But we want files which are in a different | |
568 | * directory which shares a blockgroup with our parent to land in a | |
569 | * different blockgroup. | |
570 | * | |
571 | * So add our directory's i_ino into the starting point for the hash. | |
572 | */ | |
2aa9fc4c | 573 | *group = (*group + parent->i_ino) % ngroups; |
ac27a0ec DK |
574 | |
575 | /* | |
576 | * Use a quadratic hash to find a group with a free inode and some free | |
577 | * blocks. | |
578 | */ | |
579 | for (i = 1; i < ngroups; i <<= 1) { | |
2aa9fc4c AM |
580 | *group += i; |
581 | if (*group >= ngroups) | |
582 | *group -= ngroups; | |
583 | desc = ext4_get_group_desc(sb, *group, NULL); | |
560671a0 | 584 | if (desc && ext4_free_inodes_count(sb, desc) && |
021b65bb | 585 | ext4_free_group_clusters(sb, desc)) |
2aa9fc4c | 586 | return 0; |
ac27a0ec DK |
587 | } |
588 | ||
589 | /* | |
590 | * That failed: try linear search for a free inode, even if that group | |
591 | * has no free blocks. | |
592 | */ | |
2aa9fc4c | 593 | *group = parent_group; |
ac27a0ec | 594 | for (i = 0; i < ngroups; i++) { |
2aa9fc4c AM |
595 | if (++*group >= ngroups) |
596 | *group = 0; | |
597 | desc = ext4_get_group_desc(sb, *group, NULL); | |
560671a0 | 598 | if (desc && ext4_free_inodes_count(sb, desc)) |
2aa9fc4c | 599 | return 0; |
ac27a0ec DK |
600 | } |
601 | ||
602 | return -1; | |
603 | } | |
604 | ||
605 | /* | |
606 | * There are two policies for allocating an inode. If the new inode is | |
607 | * a directory, then a forward search is made for a block group with both | |
608 | * free space and a low directory-to-inode ratio; if that fails, then of | |
609 | * the groups with above-average free space, that group with the fewest | |
610 | * directories already is chosen. | |
611 | * | |
612 | * For other inodes, search forward from the parent directory's block | |
613 | * group to find a free inode. | |
614 | */ | |
dcca3fec | 615 | struct inode *ext4_new_inode(handle_t *handle, struct inode *dir, umode_t mode, |
5cb81dab | 616 | const struct qstr *qstr, __u32 goal, uid_t *owner) |
ac27a0ec DK |
617 | { |
618 | struct super_block *sb; | |
3300beda AK |
619 | struct buffer_head *inode_bitmap_bh = NULL; |
620 | struct buffer_head *group_desc_bh; | |
8df9675f | 621 | ext4_group_t ngroups, group = 0; |
ac27a0ec | 622 | unsigned long ino = 0; |
af5bc92d TT |
623 | struct inode *inode; |
624 | struct ext4_group_desc *gdp = NULL; | |
617ba13b MC |
625 | struct ext4_inode_info *ei; |
626 | struct ext4_sb_info *sbi; | |
39341867 | 627 | int ret2, err = 0; |
ac27a0ec | 628 | struct inode *ret; |
2aa9fc4c | 629 | ext4_group_t i; |
772cb7c8 | 630 | ext4_group_t flex_group; |
ac27a0ec DK |
631 | |
632 | /* Cannot create files in a deleted directory */ | |
633 | if (!dir || !dir->i_nlink) | |
634 | return ERR_PTR(-EPERM); | |
635 | ||
636 | sb = dir->i_sb; | |
8df9675f | 637 | ngroups = ext4_get_groups_count(sb); |
9bffad1e | 638 | trace_ext4_request_inode(dir, mode); |
ac27a0ec DK |
639 | inode = new_inode(sb); |
640 | if (!inode) | |
641 | return ERR_PTR(-ENOMEM); | |
617ba13b | 642 | ei = EXT4_I(inode); |
617ba13b | 643 | sbi = EXT4_SB(sb); |
772cb7c8 | 644 | |
11013911 AD |
645 | if (!goal) |
646 | goal = sbi->s_inode_goal; | |
647 | ||
e6462869 | 648 | if (goal && goal <= le32_to_cpu(sbi->s_es->s_inodes_count)) { |
11013911 AD |
649 | group = (goal - 1) / EXT4_INODES_PER_GROUP(sb); |
650 | ino = (goal - 1) % EXT4_INODES_PER_GROUP(sb); | |
651 | ret2 = 0; | |
652 | goto got_group; | |
653 | } | |
654 | ||
4113c4ca LC |
655 | if (S_ISDIR(mode)) |
656 | ret2 = find_group_orlov(sb, dir, &group, mode, qstr); | |
657 | else | |
a4912123 | 658 | ret2 = find_group_other(sb, dir, &group, mode); |
ac27a0ec | 659 | |
772cb7c8 | 660 | got_group: |
a4912123 | 661 | EXT4_I(dir)->i_last_alloc_group = group; |
ac27a0ec | 662 | err = -ENOSPC; |
2aa9fc4c | 663 | if (ret2 == -1) |
ac27a0ec DK |
664 | goto out; |
665 | ||
119c0d44 TT |
666 | /* |
667 | * Normally we will only go through one pass of this loop, | |
668 | * unless we get unlucky and it turns out the group we selected | |
669 | * had its last inode grabbed by someone else. | |
670 | */ | |
11013911 | 671 | for (i = 0; i < ngroups; i++, ino = 0) { |
ac27a0ec DK |
672 | err = -EIO; |
673 | ||
3300beda | 674 | gdp = ext4_get_group_desc(sb, group, &group_desc_bh); |
ac27a0ec DK |
675 | if (!gdp) |
676 | goto fail; | |
677 | ||
3300beda AK |
678 | brelse(inode_bitmap_bh); |
679 | inode_bitmap_bh = ext4_read_inode_bitmap(sb, group); | |
680 | if (!inode_bitmap_bh) | |
ac27a0ec DK |
681 | goto fail; |
682 | ||
ac27a0ec | 683 | repeat_in_this_group: |
617ba13b | 684 | ino = ext4_find_next_zero_bit((unsigned long *) |
3300beda AK |
685 | inode_bitmap_bh->b_data, |
686 | EXT4_INODES_PER_GROUP(sb), ino); | |
119c0d44 TT |
687 | if (ino >= EXT4_INODES_PER_GROUP(sb)) { |
688 | if (++group == ngroups) | |
689 | group = 0; | |
690 | continue; | |
ac27a0ec | 691 | } |
119c0d44 TT |
692 | if (group == 0 && (ino+1) < EXT4_FIRST_INO(sb)) { |
693 | ext4_error(sb, "reserved inode found cleared - " | |
694 | "inode=%lu", ino + 1); | |
695 | continue; | |
696 | } | |
697 | ext4_lock_group(sb, group); | |
698 | ret2 = ext4_test_and_set_bit(ino, inode_bitmap_bh->b_data); | |
699 | ext4_unlock_group(sb, group); | |
700 | ino++; /* the inode bitmap is zero-based */ | |
701 | if (!ret2) | |
702 | goto got; /* we grabbed the inode! */ | |
703 | if (ino < EXT4_INODES_PER_GROUP(sb)) | |
704 | goto repeat_in_this_group; | |
ac27a0ec DK |
705 | } |
706 | err = -ENOSPC; | |
707 | goto out; | |
708 | ||
709 | got: | |
717d50e4 AD |
710 | /* We may have to initialize the block bitmap if it isn't already */ |
711 | if (EXT4_HAS_RO_COMPAT_FEATURE(sb, EXT4_FEATURE_RO_COMPAT_GDT_CSUM) && | |
712 | gdp->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT)) { | |
3300beda | 713 | struct buffer_head *block_bitmap_bh; |
717d50e4 | 714 | |
3300beda AK |
715 | block_bitmap_bh = ext4_read_block_bitmap(sb, group); |
716 | BUFFER_TRACE(block_bitmap_bh, "get block bitmap access"); | |
717 | err = ext4_journal_get_write_access(handle, block_bitmap_bh); | |
717d50e4 | 718 | if (err) { |
3300beda | 719 | brelse(block_bitmap_bh); |
717d50e4 AD |
720 | goto fail; |
721 | } | |
722 | ||
fd034a84 TT |
723 | BUFFER_TRACE(block_bitmap_bh, "dirty block bitmap"); |
724 | err = ext4_handle_dirty_metadata(handle, NULL, block_bitmap_bh); | |
725 | brelse(block_bitmap_bh); | |
726 | ||
717d50e4 | 727 | /* recheck and clear flag under lock if we still need to */ |
fd034a84 | 728 | ext4_lock_group(sb, group); |
717d50e4 | 729 | if (gdp->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT)) { |
3300beda | 730 | gdp->bg_flags &= cpu_to_le16(~EXT4_BG_BLOCK_UNINIT); |
021b65bb | 731 | ext4_free_group_clusters_set(sb, gdp, |
cff1dfd7 | 732 | ext4_free_clusters_after_init(sb, group, gdp)); |
23712a9c FB |
733 | gdp->bg_checksum = ext4_group_desc_csum(sbi, group, |
734 | gdp); | |
717d50e4 | 735 | } |
955ce5f5 | 736 | ext4_unlock_group(sb, group); |
717d50e4 | 737 | |
717d50e4 AD |
738 | if (err) |
739 | goto fail; | |
740 | } | |
119c0d44 TT |
741 | |
742 | BUFFER_TRACE(inode_bitmap_bh, "get_write_access"); | |
743 | err = ext4_journal_get_write_access(handle, inode_bitmap_bh); | |
744 | if (err) | |
745 | goto fail; | |
746 | ||
747 | BUFFER_TRACE(group_desc_bh, "get_write_access"); | |
748 | err = ext4_journal_get_write_access(handle, group_desc_bh); | |
749 | if (err) | |
750 | goto fail; | |
751 | ||
752 | /* Update the relevant bg descriptor fields */ | |
753 | if (EXT4_HAS_RO_COMPAT_FEATURE(sb, EXT4_FEATURE_RO_COMPAT_GDT_CSUM)) { | |
754 | int free; | |
755 | struct ext4_group_info *grp = ext4_get_group_info(sb, group); | |
756 | ||
757 | down_read(&grp->alloc_sem); /* protect vs itable lazyinit */ | |
758 | ext4_lock_group(sb, group); /* while we modify the bg desc */ | |
759 | free = EXT4_INODES_PER_GROUP(sb) - | |
760 | ext4_itable_unused_count(sb, gdp); | |
761 | if (gdp->bg_flags & cpu_to_le16(EXT4_BG_INODE_UNINIT)) { | |
762 | gdp->bg_flags &= cpu_to_le16(~EXT4_BG_INODE_UNINIT); | |
763 | free = 0; | |
764 | } | |
765 | /* | |
766 | * Check the relative inode number against the last used | |
767 | * relative inode number in this group. if it is greater | |
768 | * we need to update the bg_itable_unused count | |
769 | */ | |
770 | if (ino > free) | |
771 | ext4_itable_unused_set(sb, gdp, | |
772 | (EXT4_INODES_PER_GROUP(sb) - ino)); | |
773 | up_read(&grp->alloc_sem); | |
774 | } | |
775 | ext4_free_inodes_set(sb, gdp, ext4_free_inodes_count(sb, gdp) - 1); | |
776 | if (S_ISDIR(mode)) { | |
777 | ext4_used_dirs_set(sb, gdp, ext4_used_dirs_count(sb, gdp) + 1); | |
778 | if (sbi->s_log_groups_per_flex) { | |
779 | ext4_group_t f = ext4_flex_group(sbi, group); | |
780 | ||
781 | atomic_inc(&sbi->s_flex_groups[f].used_dirs); | |
782 | } | |
783 | } | |
784 | if (EXT4_HAS_RO_COMPAT_FEATURE(sb, EXT4_FEATURE_RO_COMPAT_GDT_CSUM)) { | |
785 | gdp->bg_checksum = ext4_group_desc_csum(sbi, group, gdp); | |
786 | ext4_unlock_group(sb, group); | |
787 | } | |
788 | ||
789 | BUFFER_TRACE(inode_bitmap_bh, "call ext4_handle_dirty_metadata"); | |
790 | err = ext4_handle_dirty_metadata(handle, NULL, inode_bitmap_bh); | |
791 | if (err) | |
792 | goto fail; | |
793 | ||
3300beda AK |
794 | BUFFER_TRACE(group_desc_bh, "call ext4_handle_dirty_metadata"); |
795 | err = ext4_handle_dirty_metadata(handle, NULL, group_desc_bh); | |
39341867 AK |
796 | if (err) |
797 | goto fail; | |
ac27a0ec DK |
798 | |
799 | percpu_counter_dec(&sbi->s_freeinodes_counter); | |
800 | if (S_ISDIR(mode)) | |
801 | percpu_counter_inc(&sbi->s_dirs_counter); | |
a0375156 | 802 | ext4_mark_super_dirty(sb); |
ac27a0ec | 803 | |
772cb7c8 JS |
804 | if (sbi->s_log_groups_per_flex) { |
805 | flex_group = ext4_flex_group(sbi, group); | |
9f24e420 | 806 | atomic_dec(&sbi->s_flex_groups[flex_group].free_inodes); |
772cb7c8 | 807 | } |
5cb81dab DM |
808 | if (owner) { |
809 | inode->i_mode = mode; | |
810 | inode->i_uid = owner[0]; | |
811 | inode->i_gid = owner[1]; | |
812 | } else if (test_opt(sb, GRPID)) { | |
b10b8520 DM |
813 | inode->i_mode = mode; |
814 | inode->i_uid = current_fsuid(); | |
ac27a0ec | 815 | inode->i_gid = dir->i_gid; |
ac27a0ec | 816 | } else |
b10b8520 | 817 | inode_init_owner(inode, dir, mode); |
ac27a0ec | 818 | |
717d50e4 | 819 | inode->i_ino = ino + group * EXT4_INODES_PER_GROUP(sb); |
ac27a0ec DK |
820 | /* This is the optimal IO size (for stat), not the fs block size */ |
821 | inode->i_blocks = 0; | |
ef7f3835 KS |
822 | inode->i_mtime = inode->i_atime = inode->i_ctime = ei->i_crtime = |
823 | ext4_current_time(inode); | |
ac27a0ec DK |
824 | |
825 | memset(ei->i_data, 0, sizeof(ei->i_data)); | |
826 | ei->i_dir_start_lookup = 0; | |
827 | ei->i_disksize = 0; | |
828 | ||
4af83508 | 829 | /* Don't inherit extent flag from directory, amongst others. */ |
2dc6b0d4 DG |
830 | ei->i_flags = |
831 | ext4_mask_flags(mode, EXT4_I(dir)->i_flags & EXT4_FL_INHERITED); | |
ac27a0ec | 832 | ei->i_file_acl = 0; |
ac27a0ec | 833 | ei->i_dtime = 0; |
ac27a0ec | 834 | ei->i_block_group = group; |
a4912123 | 835 | ei->i_last_alloc_group = ~0; |
ac27a0ec | 836 | |
617ba13b | 837 | ext4_set_inode_flags(inode); |
ac27a0ec | 838 | if (IS_DIRSYNC(inode)) |
0390131b | 839 | ext4_handle_sync(handle); |
6b38e842 | 840 | if (insert_inode_locked(inode) < 0) { |
acd6ad83 JK |
841 | /* |
842 | * Likely a bitmap corruption causing inode to be allocated | |
843 | * twice. | |
844 | */ | |
845 | err = -EIO; | |
846 | goto fail; | |
6b38e842 | 847 | } |
ac27a0ec DK |
848 | spin_lock(&sbi->s_next_gen_lock); |
849 | inode->i_generation = sbi->s_next_generation++; | |
850 | spin_unlock(&sbi->s_next_gen_lock); | |
851 | ||
353eb83c | 852 | ext4_clear_state_flags(ei); /* Only relevant on 32-bit archs */ |
19f5fb7a | 853 | ext4_set_inode_state(inode, EXT4_STATE_NEW); |
ef7f3835 KS |
854 | |
855 | ei->i_extra_isize = EXT4_SB(sb)->s_want_extra_isize; | |
ac27a0ec DK |
856 | |
857 | ret = inode; | |
871a2931 | 858 | dquot_initialize(inode); |
63936dda CH |
859 | err = dquot_alloc_inode(inode); |
860 | if (err) | |
ac27a0ec | 861 | goto fail_drop; |
ac27a0ec | 862 | |
617ba13b | 863 | err = ext4_init_acl(handle, inode, dir); |
ac27a0ec DK |
864 | if (err) |
865 | goto fail_free_drop; | |
866 | ||
2a7dba39 | 867 | err = ext4_init_security(handle, inode, dir, qstr); |
ac27a0ec DK |
868 | if (err) |
869 | goto fail_free_drop; | |
870 | ||
83982b6f | 871 | if (EXT4_HAS_INCOMPAT_FEATURE(sb, EXT4_FEATURE_INCOMPAT_EXTENTS)) { |
e4079a11 | 872 | /* set extent flag only for directory, file and normal symlink*/ |
e65187e6 | 873 | if (S_ISDIR(mode) || S_ISREG(mode) || S_ISLNK(mode)) { |
12e9b892 | 874 | ext4_set_inode_flag(inode, EXT4_INODE_EXTENTS); |
42bf0383 | 875 | ext4_ext_tree_init(handle, inode); |
42bf0383 | 876 | } |
a86c6181 | 877 | } |
ac27a0ec | 878 | |
688f869c TT |
879 | if (ext4_handle_valid(handle)) { |
880 | ei->i_sync_tid = handle->h_transaction->t_tid; | |
881 | ei->i_datasync_tid = handle->h_transaction->t_tid; | |
882 | } | |
883 | ||
8753e88f AK |
884 | err = ext4_mark_inode_dirty(handle, inode); |
885 | if (err) { | |
886 | ext4_std_error(sb, err); | |
887 | goto fail_free_drop; | |
888 | } | |
889 | ||
617ba13b | 890 | ext4_debug("allocating inode %lu\n", inode->i_ino); |
9bffad1e | 891 | trace_ext4_allocate_inode(inode, dir, mode); |
ac27a0ec DK |
892 | goto really_out; |
893 | fail: | |
617ba13b | 894 | ext4_std_error(sb, err); |
ac27a0ec DK |
895 | out: |
896 | iput(inode); | |
897 | ret = ERR_PTR(err); | |
898 | really_out: | |
3300beda | 899 | brelse(inode_bitmap_bh); |
ac27a0ec DK |
900 | return ret; |
901 | ||
902 | fail_free_drop: | |
63936dda | 903 | dquot_free_inode(inode); |
ac27a0ec DK |
904 | |
905 | fail_drop: | |
9f754758 | 906 | dquot_drop(inode); |
ac27a0ec | 907 | inode->i_flags |= S_NOQUOTA; |
6d6b77f1 | 908 | clear_nlink(inode); |
6b38e842 | 909 | unlock_new_inode(inode); |
ac27a0ec | 910 | iput(inode); |
3300beda | 911 | brelse(inode_bitmap_bh); |
ac27a0ec DK |
912 | return ERR_PTR(err); |
913 | } | |
914 | ||
915 | /* Verify that we are loading a valid orphan from disk */ | |
617ba13b | 916 | struct inode *ext4_orphan_get(struct super_block *sb, unsigned long ino) |
ac27a0ec | 917 | { |
617ba13b | 918 | unsigned long max_ino = le32_to_cpu(EXT4_SB(sb)->s_es->s_inodes_count); |
fd2d4291 | 919 | ext4_group_t block_group; |
ac27a0ec | 920 | int bit; |
1d1fe1ee | 921 | struct buffer_head *bitmap_bh; |
ac27a0ec | 922 | struct inode *inode = NULL; |
1d1fe1ee | 923 | long err = -EIO; |
ac27a0ec DK |
924 | |
925 | /* Error cases - e2fsck has already cleaned up for us */ | |
926 | if (ino > max_ino) { | |
12062ddd | 927 | ext4_warning(sb, "bad orphan ino %lu! e2fsck was run?", ino); |
1d1fe1ee | 928 | goto error; |
ac27a0ec DK |
929 | } |
930 | ||
617ba13b MC |
931 | block_group = (ino - 1) / EXT4_INODES_PER_GROUP(sb); |
932 | bit = (ino - 1) % EXT4_INODES_PER_GROUP(sb); | |
e29d1cde | 933 | bitmap_bh = ext4_read_inode_bitmap(sb, block_group); |
ac27a0ec | 934 | if (!bitmap_bh) { |
12062ddd | 935 | ext4_warning(sb, "inode bitmap error for orphan %lu", ino); |
1d1fe1ee | 936 | goto error; |
ac27a0ec DK |
937 | } |
938 | ||
939 | /* Having the inode bit set should be a 100% indicator that this | |
940 | * is a valid orphan (no e2fsck run on fs). Orphans also include | |
941 | * inodes that were being truncated, so we can't check i_nlink==0. | |
942 | */ | |
1d1fe1ee DH |
943 | if (!ext4_test_bit(bit, bitmap_bh->b_data)) |
944 | goto bad_orphan; | |
945 | ||
946 | inode = ext4_iget(sb, ino); | |
947 | if (IS_ERR(inode)) | |
948 | goto iget_failed; | |
949 | ||
91ef4caf DG |
950 | /* |
951 | * If the orphans has i_nlinks > 0 then it should be able to be | |
952 | * truncated, otherwise it won't be removed from the orphan list | |
953 | * during processing and an infinite loop will result. | |
954 | */ | |
955 | if (inode->i_nlink && !ext4_can_truncate(inode)) | |
956 | goto bad_orphan; | |
957 | ||
1d1fe1ee DH |
958 | if (NEXT_ORPHAN(inode) > max_ino) |
959 | goto bad_orphan; | |
960 | brelse(bitmap_bh); | |
961 | return inode; | |
962 | ||
963 | iget_failed: | |
964 | err = PTR_ERR(inode); | |
965 | inode = NULL; | |
966 | bad_orphan: | |
12062ddd | 967 | ext4_warning(sb, "bad orphan inode %lu! e2fsck was run?", ino); |
1d1fe1ee DH |
968 | printk(KERN_NOTICE "ext4_test_bit(bit=%d, block=%llu) = %d\n", |
969 | bit, (unsigned long long)bitmap_bh->b_blocknr, | |
970 | ext4_test_bit(bit, bitmap_bh->b_data)); | |
971 | printk(KERN_NOTICE "inode=%p\n", inode); | |
972 | if (inode) { | |
973 | printk(KERN_NOTICE "is_bad_inode(inode)=%d\n", | |
974 | is_bad_inode(inode)); | |
975 | printk(KERN_NOTICE "NEXT_ORPHAN(inode)=%u\n", | |
976 | NEXT_ORPHAN(inode)); | |
977 | printk(KERN_NOTICE "max_ino=%lu\n", max_ino); | |
91ef4caf | 978 | printk(KERN_NOTICE "i_nlink=%u\n", inode->i_nlink); |
ac27a0ec | 979 | /* Avoid freeing blocks if we got a bad deleted inode */ |
1d1fe1ee | 980 | if (inode->i_nlink == 0) |
ac27a0ec DK |
981 | inode->i_blocks = 0; |
982 | iput(inode); | |
ac27a0ec | 983 | } |
ac27a0ec | 984 | brelse(bitmap_bh); |
1d1fe1ee DH |
985 | error: |
986 | return ERR_PTR(err); | |
ac27a0ec DK |
987 | } |
988 | ||
af5bc92d | 989 | unsigned long ext4_count_free_inodes(struct super_block *sb) |
ac27a0ec DK |
990 | { |
991 | unsigned long desc_count; | |
617ba13b | 992 | struct ext4_group_desc *gdp; |
8df9675f | 993 | ext4_group_t i, ngroups = ext4_get_groups_count(sb); |
617ba13b MC |
994 | #ifdef EXT4FS_DEBUG |
995 | struct ext4_super_block *es; | |
ac27a0ec DK |
996 | unsigned long bitmap_count, x; |
997 | struct buffer_head *bitmap_bh = NULL; | |
998 | ||
617ba13b | 999 | es = EXT4_SB(sb)->s_es; |
ac27a0ec DK |
1000 | desc_count = 0; |
1001 | bitmap_count = 0; | |
1002 | gdp = NULL; | |
8df9675f | 1003 | for (i = 0; i < ngroups; i++) { |
af5bc92d | 1004 | gdp = ext4_get_group_desc(sb, i, NULL); |
ac27a0ec DK |
1005 | if (!gdp) |
1006 | continue; | |
560671a0 | 1007 | desc_count += ext4_free_inodes_count(sb, gdp); |
ac27a0ec | 1008 | brelse(bitmap_bh); |
e29d1cde | 1009 | bitmap_bh = ext4_read_inode_bitmap(sb, i); |
ac27a0ec DK |
1010 | if (!bitmap_bh) |
1011 | continue; | |
1012 | ||
617ba13b | 1013 | x = ext4_count_free(bitmap_bh, EXT4_INODES_PER_GROUP(sb) / 8); |
c549a95d | 1014 | printk(KERN_DEBUG "group %lu: stored = %d, counted = %lu\n", |
785b4b3a | 1015 | (unsigned long) i, ext4_free_inodes_count(sb, gdp), x); |
ac27a0ec DK |
1016 | bitmap_count += x; |
1017 | } | |
1018 | brelse(bitmap_bh); | |
4776004f TT |
1019 | printk(KERN_DEBUG "ext4_count_free_inodes: " |
1020 | "stored = %u, computed = %lu, %lu\n", | |
1021 | le32_to_cpu(es->s_free_inodes_count), desc_count, bitmap_count); | |
ac27a0ec DK |
1022 | return desc_count; |
1023 | #else | |
1024 | desc_count = 0; | |
8df9675f | 1025 | for (i = 0; i < ngroups; i++) { |
af5bc92d | 1026 | gdp = ext4_get_group_desc(sb, i, NULL); |
ac27a0ec DK |
1027 | if (!gdp) |
1028 | continue; | |
560671a0 | 1029 | desc_count += ext4_free_inodes_count(sb, gdp); |
ac27a0ec DK |
1030 | cond_resched(); |
1031 | } | |
1032 | return desc_count; | |
1033 | #endif | |
1034 | } | |
1035 | ||
1036 | /* Called at mount-time, super-block is locked */ | |
af5bc92d | 1037 | unsigned long ext4_count_dirs(struct super_block * sb) |
ac27a0ec DK |
1038 | { |
1039 | unsigned long count = 0; | |
8df9675f | 1040 | ext4_group_t i, ngroups = ext4_get_groups_count(sb); |
ac27a0ec | 1041 | |
8df9675f | 1042 | for (i = 0; i < ngroups; i++) { |
af5bc92d | 1043 | struct ext4_group_desc *gdp = ext4_get_group_desc(sb, i, NULL); |
ac27a0ec DK |
1044 | if (!gdp) |
1045 | continue; | |
560671a0 | 1046 | count += ext4_used_dirs_count(sb, gdp); |
ac27a0ec DK |
1047 | } |
1048 | return count; | |
1049 | } | |
bfff6873 LC |
1050 | |
1051 | /* | |
1052 | * Zeroes not yet zeroed inode table - just write zeroes through the whole | |
1053 | * inode table. Must be called without any spinlock held. The only place | |
1054 | * where it is called from on active part of filesystem is ext4lazyinit | |
1055 | * thread, so we do not need any special locks, however we have to prevent | |
1056 | * inode allocation from the current group, so we take alloc_sem lock, to | |
119c0d44 | 1057 | * block ext4_new_inode() until we are finished. |
bfff6873 | 1058 | */ |
e0cbee3e | 1059 | int ext4_init_inode_table(struct super_block *sb, ext4_group_t group, |
bfff6873 LC |
1060 | int barrier) |
1061 | { | |
1062 | struct ext4_group_info *grp = ext4_get_group_info(sb, group); | |
1063 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
1064 | struct ext4_group_desc *gdp = NULL; | |
1065 | struct buffer_head *group_desc_bh; | |
1066 | handle_t *handle; | |
1067 | ext4_fsblk_t blk; | |
1068 | int num, ret = 0, used_blks = 0; | |
bfff6873 LC |
1069 | |
1070 | /* This should not happen, but just to be sure check this */ | |
1071 | if (sb->s_flags & MS_RDONLY) { | |
1072 | ret = 1; | |
1073 | goto out; | |
1074 | } | |
1075 | ||
1076 | gdp = ext4_get_group_desc(sb, group, &group_desc_bh); | |
1077 | if (!gdp) | |
1078 | goto out; | |
1079 | ||
1080 | /* | |
1081 | * We do not need to lock this, because we are the only one | |
1082 | * handling this flag. | |
1083 | */ | |
1084 | if (gdp->bg_flags & cpu_to_le16(EXT4_BG_INODE_ZEROED)) | |
1085 | goto out; | |
1086 | ||
1087 | handle = ext4_journal_start_sb(sb, 1); | |
1088 | if (IS_ERR(handle)) { | |
1089 | ret = PTR_ERR(handle); | |
1090 | goto out; | |
1091 | } | |
1092 | ||
1093 | down_write(&grp->alloc_sem); | |
1094 | /* | |
1095 | * If inode bitmap was already initialized there may be some | |
1096 | * used inodes so we need to skip blocks with used inodes in | |
1097 | * inode table. | |
1098 | */ | |
1099 | if (!(gdp->bg_flags & cpu_to_le16(EXT4_BG_INODE_UNINIT))) | |
1100 | used_blks = DIV_ROUND_UP((EXT4_INODES_PER_GROUP(sb) - | |
1101 | ext4_itable_unused_count(sb, gdp)), | |
1102 | sbi->s_inodes_per_block); | |
1103 | ||
857ac889 LC |
1104 | if ((used_blks < 0) || (used_blks > sbi->s_itb_per_group)) { |
1105 | ext4_error(sb, "Something is wrong with group %u\n" | |
1106 | "Used itable blocks: %d" | |
1107 | "itable unused count: %u\n", | |
1108 | group, used_blks, | |
1109 | ext4_itable_unused_count(sb, gdp)); | |
1110 | ret = 1; | |
33853a0d | 1111 | goto err_out; |
857ac889 LC |
1112 | } |
1113 | ||
bfff6873 LC |
1114 | blk = ext4_inode_table(sb, gdp) + used_blks; |
1115 | num = sbi->s_itb_per_group - used_blks; | |
1116 | ||
1117 | BUFFER_TRACE(group_desc_bh, "get_write_access"); | |
1118 | ret = ext4_journal_get_write_access(handle, | |
1119 | group_desc_bh); | |
1120 | if (ret) | |
1121 | goto err_out; | |
1122 | ||
bfff6873 LC |
1123 | /* |
1124 | * Skip zeroout if the inode table is full. But we set the ZEROED | |
1125 | * flag anyway, because obviously, when it is full it does not need | |
1126 | * further zeroing. | |
1127 | */ | |
1128 | if (unlikely(num == 0)) | |
1129 | goto skip_zeroout; | |
1130 | ||
1131 | ext4_debug("going to zero out inode table in group %d\n", | |
1132 | group); | |
a107e5a3 | 1133 | ret = sb_issue_zeroout(sb, blk, num, GFP_NOFS); |
bfff6873 LC |
1134 | if (ret < 0) |
1135 | goto err_out; | |
a107e5a3 TT |
1136 | if (barrier) |
1137 | blkdev_issue_flush(sb->s_bdev, GFP_NOFS, NULL); | |
bfff6873 LC |
1138 | |
1139 | skip_zeroout: | |
1140 | ext4_lock_group(sb, group); | |
1141 | gdp->bg_flags |= cpu_to_le16(EXT4_BG_INODE_ZEROED); | |
1142 | gdp->bg_checksum = ext4_group_desc_csum(sbi, group, gdp); | |
1143 | ext4_unlock_group(sb, group); | |
1144 | ||
1145 | BUFFER_TRACE(group_desc_bh, | |
1146 | "call ext4_handle_dirty_metadata"); | |
1147 | ret = ext4_handle_dirty_metadata(handle, NULL, | |
1148 | group_desc_bh); | |
1149 | ||
1150 | err_out: | |
1151 | up_write(&grp->alloc_sem); | |
1152 | ext4_journal_stop(handle); | |
1153 | out: | |
1154 | return ret; | |
1155 | } |