]>
Commit | Line | Data |
---|---|---|
b3b94faa DT |
1 | /* |
2 | * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved. | |
fe6c991c | 3 | * Copyright (C) 2004-2008 Red Hat, Inc. All rights reserved. |
b3b94faa DT |
4 | * |
5 | * This copyrighted material is made available to anyone wishing to use, | |
6 | * modify, copy, or redistribute it subject to the terms and conditions | |
e9fc2aa0 | 7 | * of the GNU General Public License version 2. |
b3b94faa DT |
8 | */ |
9 | ||
b3b94faa DT |
10 | #include <linux/slab.h> |
11 | #include <linux/spinlock.h> | |
12 | #include <linux/completion.h> | |
13 | #include <linux/buffer_head.h> | |
f42faf4f | 14 | #include <linux/fs.h> |
5c676f6d | 15 | #include <linux/gfs2_ondisk.h> |
7d308590 | 16 | #include <linux/lm_interface.h> |
b3b94faa DT |
17 | |
18 | #include "gfs2.h" | |
5c676f6d | 19 | #include "incore.h" |
b3b94faa DT |
20 | #include "glock.h" |
21 | #include "glops.h" | |
b3b94faa DT |
22 | #include "lops.h" |
23 | #include "meta_io.h" | |
24 | #include "quota.h" | |
25 | #include "rgrp.h" | |
26 | #include "super.h" | |
27 | #include "trans.h" | |
5c676f6d | 28 | #include "util.h" |
172e045a | 29 | #include "log.h" |
c8cdf479 | 30 | #include "inode.h" |
51ff87bd | 31 | #include "ops_address.h" |
b3b94faa | 32 | |
2c1e52aa | 33 | #define BFITNOENT ((u32)~0) |
6760bdcd | 34 | #define NO_BLOCK ((u64)~0) |
88c8ab1f SW |
35 | |
36 | /* | |
37 | * These routines are used by the resource group routines (rgrp.c) | |
38 | * to keep track of block allocation. Each block is represented by two | |
feaa7bba SW |
39 | * bits. So, each byte represents GFS2_NBBY (i.e. 4) blocks. |
40 | * | |
41 | * 0 = Free | |
42 | * 1 = Used (not metadata) | |
43 | * 2 = Unlinked (still in use) inode | |
44 | * 3 = Used (metadata) | |
88c8ab1f SW |
45 | */ |
46 | ||
47 | static const char valid_change[16] = { | |
48 | /* current */ | |
feaa7bba | 49 | /* n */ 0, 1, 1, 1, |
88c8ab1f | 50 | /* e */ 1, 0, 0, 0, |
feaa7bba | 51 | /* w */ 0, 0, 0, 1, |
88c8ab1f SW |
52 | 1, 0, 0, 0 |
53 | }; | |
54 | ||
c8cdf479 SW |
55 | static u32 rgblk_search(struct gfs2_rgrpd *rgd, u32 goal, |
56 | unsigned char old_state, unsigned char new_state); | |
57 | ||
88c8ab1f SW |
58 | /** |
59 | * gfs2_setbit - Set a bit in the bitmaps | |
60 | * @buffer: the buffer that holds the bitmaps | |
61 | * @buflen: the length (in bytes) of the buffer | |
62 | * @block: the block to set | |
63 | * @new_state: the new state of the block | |
64 | * | |
65 | */ | |
66 | ||
3efd7534 | 67 | static void gfs2_setbit(struct gfs2_rgrpd *rgd, unsigned char *buffer, |
cd915493 | 68 | unsigned int buflen, u32 block, |
3efd7534 | 69 | unsigned char new_state) |
88c8ab1f SW |
70 | { |
71 | unsigned char *byte, *end, cur_state; | |
72 | unsigned int bit; | |
73 | ||
74 | byte = buffer + (block / GFS2_NBBY); | |
75 | bit = (block % GFS2_NBBY) * GFS2_BIT_SIZE; | |
76 | end = buffer + buflen; | |
77 | ||
78 | gfs2_assert(rgd->rd_sbd, byte < end); | |
79 | ||
80 | cur_state = (*byte >> bit) & GFS2_BIT_MASK; | |
81 | ||
82 | if (valid_change[new_state * 4 + cur_state]) { | |
83 | *byte ^= cur_state << bit; | |
84 | *byte |= new_state << bit; | |
85 | } else | |
86 | gfs2_consist_rgrpd(rgd); | |
87 | } | |
88 | ||
89 | /** | |
90 | * gfs2_testbit - test a bit in the bitmaps | |
91 | * @buffer: the buffer that holds the bitmaps | |
92 | * @buflen: the length (in bytes) of the buffer | |
93 | * @block: the block to read | |
94 | * | |
95 | */ | |
96 | ||
3efd7534 | 97 | static unsigned char gfs2_testbit(struct gfs2_rgrpd *rgd, unsigned char *buffer, |
cd915493 | 98 | unsigned int buflen, u32 block) |
88c8ab1f SW |
99 | { |
100 | unsigned char *byte, *end, cur_state; | |
101 | unsigned int bit; | |
102 | ||
103 | byte = buffer + (block / GFS2_NBBY); | |
104 | bit = (block % GFS2_NBBY) * GFS2_BIT_SIZE; | |
105 | end = buffer + buflen; | |
106 | ||
107 | gfs2_assert(rgd->rd_sbd, byte < end); | |
108 | ||
109 | cur_state = (*byte >> bit) & GFS2_BIT_MASK; | |
110 | ||
111 | return cur_state; | |
112 | } | |
113 | ||
114 | /** | |
115 | * gfs2_bitfit - Search an rgrp's bitmap buffer to find a bit-pair representing | |
116 | * a block in a given allocation state. | |
117 | * @buffer: the buffer that holds the bitmaps | |
118 | * @buflen: the length (in bytes) of the buffer | |
119 | * @goal: start search at this block's bit-pair (within @buffer) | |
6760bdcd | 120 | * @old_state: GFS2_BLKST_XXX the state of the block we're looking for. |
88c8ab1f SW |
121 | * |
122 | * Scope of @goal and returned block number is only within this bitmap buffer, | |
123 | * not entire rgrp or filesystem. @buffer will be offset from the actual | |
124 | * beginning of a bitmap block buffer, skipping any header structures. | |
125 | * | |
126 | * Return: the block number (bitmap buffer scope) that was found | |
127 | */ | |
128 | ||
110acf38 SW |
129 | static u32 gfs2_bitfit(const u8 *buffer, unsigned int buflen, u32 goal, |
130 | u8 old_state) | |
88c8ab1f | 131 | { |
110acf38 | 132 | const u8 *byte; |
cd915493 | 133 | u32 blk = goal; |
5fdc2eeb | 134 | unsigned int bit, bitlong; |
110acf38 SW |
135 | const unsigned long *plong; |
136 | #if BITS_PER_LONG == 32 | |
137 | const unsigned long plong55 = 0x55555555; | |
138 | #else | |
139 | const unsigned long plong55 = 0x5555555555555555; | |
140 | #endif | |
88c8ab1f SW |
141 | |
142 | byte = buffer + (goal / GFS2_NBBY); | |
110acf38 | 143 | plong = (const unsigned long *)(buffer + (goal / GFS2_NBBY)); |
88c8ab1f | 144 | bit = (goal % GFS2_NBBY) * GFS2_BIT_SIZE; |
5fdc2eeb | 145 | bitlong = bit; |
110acf38 | 146 | |
5fdc2eeb BP |
147 | while (byte < buffer + buflen) { |
148 | ||
149 | if (bitlong == 0 && old_state == 0 && *plong == plong55) { | |
150 | plong++; | |
151 | byte += sizeof(unsigned long); | |
152 | blk += sizeof(unsigned long) * GFS2_NBBY; | |
88c8ab1f SW |
153 | continue; |
154 | } | |
b3513fca | 155 | if (((*byte >> bit) & GFS2_BIT_MASK) == old_state) |
88c8ab1f | 156 | return blk; |
88c8ab1f SW |
157 | bit += GFS2_BIT_SIZE; |
158 | if (bit >= 8) { | |
159 | bit = 0; | |
160 | byte++; | |
161 | } | |
5fdc2eeb BP |
162 | bitlong += GFS2_BIT_SIZE; |
163 | if (bitlong >= sizeof(unsigned long) * 8) { | |
164 | bitlong = 0; | |
165 | plong++; | |
166 | } | |
88c8ab1f SW |
167 | |
168 | blk++; | |
169 | } | |
170 | ||
171 | return BFITNOENT; | |
172 | } | |
173 | ||
174 | /** | |
175 | * gfs2_bitcount - count the number of bits in a certain state | |
176 | * @buffer: the buffer that holds the bitmaps | |
177 | * @buflen: the length (in bytes) of the buffer | |
178 | * @state: the state of the block we're looking for | |
179 | * | |
180 | * Returns: The number of bits | |
181 | */ | |
182 | ||
110acf38 SW |
183 | static u32 gfs2_bitcount(struct gfs2_rgrpd *rgd, const u8 *buffer, |
184 | unsigned int buflen, u8 state) | |
88c8ab1f | 185 | { |
110acf38 SW |
186 | const u8 *byte = buffer; |
187 | const u8 *end = buffer + buflen; | |
188 | const u8 state1 = state << 2; | |
189 | const u8 state2 = state << 4; | |
190 | const u8 state3 = state << 6; | |
cd915493 | 191 | u32 count = 0; |
88c8ab1f SW |
192 | |
193 | for (; byte < end; byte++) { | |
194 | if (((*byte) & 0x03) == state) | |
195 | count++; | |
196 | if (((*byte) & 0x0C) == state1) | |
197 | count++; | |
198 | if (((*byte) & 0x30) == state2) | |
199 | count++; | |
200 | if (((*byte) & 0xC0) == state3) | |
201 | count++; | |
202 | } | |
203 | ||
204 | return count; | |
205 | } | |
206 | ||
b3b94faa DT |
207 | /** |
208 | * gfs2_rgrp_verify - Verify that a resource group is consistent | |
209 | * @sdp: the filesystem | |
210 | * @rgd: the rgrp | |
211 | * | |
212 | */ | |
213 | ||
214 | void gfs2_rgrp_verify(struct gfs2_rgrpd *rgd) | |
215 | { | |
216 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
217 | struct gfs2_bitmap *bi = NULL; | |
bb8d8a6f | 218 | u32 length = rgd->rd_length; |
cd915493 | 219 | u32 count[4], tmp; |
b3b94faa DT |
220 | int buf, x; |
221 | ||
cd915493 | 222 | memset(count, 0, 4 * sizeof(u32)); |
b3b94faa DT |
223 | |
224 | /* Count # blocks in each of 4 possible allocation states */ | |
225 | for (buf = 0; buf < length; buf++) { | |
226 | bi = rgd->rd_bits + buf; | |
227 | for (x = 0; x < 4; x++) | |
228 | count[x] += gfs2_bitcount(rgd, | |
229 | bi->bi_bh->b_data + | |
230 | bi->bi_offset, | |
231 | bi->bi_len, x); | |
232 | } | |
233 | ||
234 | if (count[0] != rgd->rd_rg.rg_free) { | |
235 | if (gfs2_consist_rgrpd(rgd)) | |
236 | fs_err(sdp, "free data mismatch: %u != %u\n", | |
237 | count[0], rgd->rd_rg.rg_free); | |
238 | return; | |
239 | } | |
240 | ||
bb8d8a6f | 241 | tmp = rgd->rd_data - |
b3b94faa DT |
242 | rgd->rd_rg.rg_free - |
243 | rgd->rd_rg.rg_dinodes; | |
feaa7bba | 244 | if (count[1] + count[2] != tmp) { |
b3b94faa DT |
245 | if (gfs2_consist_rgrpd(rgd)) |
246 | fs_err(sdp, "used data mismatch: %u != %u\n", | |
247 | count[1], tmp); | |
248 | return; | |
249 | } | |
250 | ||
feaa7bba | 251 | if (count[3] != rgd->rd_rg.rg_dinodes) { |
b3b94faa | 252 | if (gfs2_consist_rgrpd(rgd)) |
feaa7bba SW |
253 | fs_err(sdp, "used metadata mismatch: %u != %u\n", |
254 | count[3], rgd->rd_rg.rg_dinodes); | |
b3b94faa DT |
255 | return; |
256 | } | |
257 | ||
feaa7bba | 258 | if (count[2] > count[3]) { |
b3b94faa | 259 | if (gfs2_consist_rgrpd(rgd)) |
feaa7bba SW |
260 | fs_err(sdp, "unlinked inodes > inodes: %u\n", |
261 | count[2]); | |
b3b94faa DT |
262 | return; |
263 | } | |
feaa7bba | 264 | |
b3b94faa DT |
265 | } |
266 | ||
bb8d8a6f | 267 | static inline int rgrp_contains_block(struct gfs2_rgrpd *rgd, u64 block) |
b3b94faa | 268 | { |
bb8d8a6f SW |
269 | u64 first = rgd->rd_data0; |
270 | u64 last = first + rgd->rd_data; | |
16910427 | 271 | return first <= block && block < last; |
b3b94faa DT |
272 | } |
273 | ||
274 | /** | |
275 | * gfs2_blk2rgrpd - Find resource group for a given data/meta block number | |
276 | * @sdp: The GFS2 superblock | |
277 | * @n: The data block number | |
278 | * | |
279 | * Returns: The resource group, or NULL if not found | |
280 | */ | |
281 | ||
cd915493 | 282 | struct gfs2_rgrpd *gfs2_blk2rgrpd(struct gfs2_sbd *sdp, u64 blk) |
b3b94faa DT |
283 | { |
284 | struct gfs2_rgrpd *rgd; | |
285 | ||
286 | spin_lock(&sdp->sd_rindex_spin); | |
287 | ||
288 | list_for_each_entry(rgd, &sdp->sd_rindex_mru_list, rd_list_mru) { | |
bb8d8a6f | 289 | if (rgrp_contains_block(rgd, blk)) { |
b3b94faa DT |
290 | list_move(&rgd->rd_list_mru, &sdp->sd_rindex_mru_list); |
291 | spin_unlock(&sdp->sd_rindex_spin); | |
292 | return rgd; | |
293 | } | |
294 | } | |
295 | ||
296 | spin_unlock(&sdp->sd_rindex_spin); | |
297 | ||
298 | return NULL; | |
299 | } | |
300 | ||
301 | /** | |
302 | * gfs2_rgrpd_get_first - get the first Resource Group in the filesystem | |
303 | * @sdp: The GFS2 superblock | |
304 | * | |
305 | * Returns: The first rgrp in the filesystem | |
306 | */ | |
307 | ||
308 | struct gfs2_rgrpd *gfs2_rgrpd_get_first(struct gfs2_sbd *sdp) | |
309 | { | |
310 | gfs2_assert(sdp, !list_empty(&sdp->sd_rindex_list)); | |
311 | return list_entry(sdp->sd_rindex_list.next, struct gfs2_rgrpd, rd_list); | |
312 | } | |
313 | ||
314 | /** | |
315 | * gfs2_rgrpd_get_next - get the next RG | |
316 | * @rgd: A RG | |
317 | * | |
318 | * Returns: The next rgrp | |
319 | */ | |
320 | ||
321 | struct gfs2_rgrpd *gfs2_rgrpd_get_next(struct gfs2_rgrpd *rgd) | |
322 | { | |
323 | if (rgd->rd_list.next == &rgd->rd_sbd->sd_rindex_list) | |
324 | return NULL; | |
325 | return list_entry(rgd->rd_list.next, struct gfs2_rgrpd, rd_list); | |
326 | } | |
327 | ||
328 | static void clear_rgrpdi(struct gfs2_sbd *sdp) | |
329 | { | |
330 | struct list_head *head; | |
331 | struct gfs2_rgrpd *rgd; | |
332 | struct gfs2_glock *gl; | |
333 | ||
334 | spin_lock(&sdp->sd_rindex_spin); | |
335 | sdp->sd_rindex_forward = NULL; | |
336 | head = &sdp->sd_rindex_recent_list; | |
337 | while (!list_empty(head)) { | |
338 | rgd = list_entry(head->next, struct gfs2_rgrpd, rd_recent); | |
339 | list_del(&rgd->rd_recent); | |
340 | } | |
341 | spin_unlock(&sdp->sd_rindex_spin); | |
342 | ||
343 | head = &sdp->sd_rindex_list; | |
344 | while (!list_empty(head)) { | |
345 | rgd = list_entry(head->next, struct gfs2_rgrpd, rd_list); | |
346 | gl = rgd->rd_gl; | |
347 | ||
348 | list_del(&rgd->rd_list); | |
349 | list_del(&rgd->rd_list_mru); | |
350 | ||
351 | if (gl) { | |
5c676f6d | 352 | gl->gl_object = NULL; |
b3b94faa DT |
353 | gfs2_glock_put(gl); |
354 | } | |
355 | ||
356 | kfree(rgd->rd_bits); | |
6bdd9be6 | 357 | kmem_cache_free(gfs2_rgrpd_cachep, rgd); |
b3b94faa DT |
358 | } |
359 | } | |
360 | ||
361 | void gfs2_clear_rgrpd(struct gfs2_sbd *sdp) | |
362 | { | |
f55ab26a | 363 | mutex_lock(&sdp->sd_rindex_mutex); |
b3b94faa | 364 | clear_rgrpdi(sdp); |
f55ab26a | 365 | mutex_unlock(&sdp->sd_rindex_mutex); |
b3b94faa DT |
366 | } |
367 | ||
bb8d8a6f SW |
368 | static void gfs2_rindex_print(const struct gfs2_rgrpd *rgd) |
369 | { | |
370 | printk(KERN_INFO " ri_addr = %llu\n", (unsigned long long)rgd->rd_addr); | |
371 | printk(KERN_INFO " ri_length = %u\n", rgd->rd_length); | |
372 | printk(KERN_INFO " ri_data0 = %llu\n", (unsigned long long)rgd->rd_data0); | |
373 | printk(KERN_INFO " ri_data = %u\n", rgd->rd_data); | |
374 | printk(KERN_INFO " ri_bitbytes = %u\n", rgd->rd_bitbytes); | |
375 | } | |
376 | ||
b3b94faa DT |
377 | /** |
378 | * gfs2_compute_bitstructs - Compute the bitmap sizes | |
379 | * @rgd: The resource group descriptor | |
380 | * | |
381 | * Calculates bitmap descriptors, one for each block that contains bitmap data | |
382 | * | |
383 | * Returns: errno | |
384 | */ | |
385 | ||
386 | static int compute_bitstructs(struct gfs2_rgrpd *rgd) | |
387 | { | |
388 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
389 | struct gfs2_bitmap *bi; | |
bb8d8a6f | 390 | u32 length = rgd->rd_length; /* # blocks in hdr & bitmap */ |
cd915493 | 391 | u32 bytes_left, bytes; |
b3b94faa DT |
392 | int x; |
393 | ||
feaa7bba SW |
394 | if (!length) |
395 | return -EINVAL; | |
396 | ||
dd894be8 | 397 | rgd->rd_bits = kcalloc(length, sizeof(struct gfs2_bitmap), GFP_NOFS); |
b3b94faa DT |
398 | if (!rgd->rd_bits) |
399 | return -ENOMEM; | |
400 | ||
bb8d8a6f | 401 | bytes_left = rgd->rd_bitbytes; |
b3b94faa DT |
402 | |
403 | for (x = 0; x < length; x++) { | |
404 | bi = rgd->rd_bits + x; | |
405 | ||
406 | /* small rgrp; bitmap stored completely in header block */ | |
407 | if (length == 1) { | |
408 | bytes = bytes_left; | |
409 | bi->bi_offset = sizeof(struct gfs2_rgrp); | |
410 | bi->bi_start = 0; | |
411 | bi->bi_len = bytes; | |
412 | /* header block */ | |
413 | } else if (x == 0) { | |
414 | bytes = sdp->sd_sb.sb_bsize - sizeof(struct gfs2_rgrp); | |
415 | bi->bi_offset = sizeof(struct gfs2_rgrp); | |
416 | bi->bi_start = 0; | |
417 | bi->bi_len = bytes; | |
418 | /* last block */ | |
419 | } else if (x + 1 == length) { | |
420 | bytes = bytes_left; | |
421 | bi->bi_offset = sizeof(struct gfs2_meta_header); | |
bb8d8a6f | 422 | bi->bi_start = rgd->rd_bitbytes - bytes_left; |
b3b94faa DT |
423 | bi->bi_len = bytes; |
424 | /* other blocks */ | |
425 | } else { | |
568f4c96 SW |
426 | bytes = sdp->sd_sb.sb_bsize - |
427 | sizeof(struct gfs2_meta_header); | |
b3b94faa | 428 | bi->bi_offset = sizeof(struct gfs2_meta_header); |
bb8d8a6f | 429 | bi->bi_start = rgd->rd_bitbytes - bytes_left; |
b3b94faa DT |
430 | bi->bi_len = bytes; |
431 | } | |
432 | ||
433 | bytes_left -= bytes; | |
434 | } | |
435 | ||
436 | if (bytes_left) { | |
437 | gfs2_consist_rgrpd(rgd); | |
438 | return -EIO; | |
439 | } | |
440 | bi = rgd->rd_bits + (length - 1); | |
bb8d8a6f | 441 | if ((bi->bi_start + bi->bi_len) * GFS2_NBBY != rgd->rd_data) { |
b3b94faa | 442 | if (gfs2_consist_rgrpd(rgd)) { |
bb8d8a6f | 443 | gfs2_rindex_print(rgd); |
b3b94faa DT |
444 | fs_err(sdp, "start=%u len=%u offset=%u\n", |
445 | bi->bi_start, bi->bi_len, bi->bi_offset); | |
446 | } | |
447 | return -EIO; | |
448 | } | |
449 | ||
450 | return 0; | |
451 | } | |
452 | ||
7ae8fa84 RP |
453 | /** |
454 | * gfs2_ri_total - Total up the file system space, according to the rindex. | |
455 | * | |
456 | */ | |
457 | u64 gfs2_ri_total(struct gfs2_sbd *sdp) | |
458 | { | |
459 | u64 total_data = 0; | |
460 | struct inode *inode = sdp->sd_rindex; | |
461 | struct gfs2_inode *ip = GFS2_I(inode); | |
7ae8fa84 RP |
462 | char buf[sizeof(struct gfs2_rindex)]; |
463 | struct file_ra_state ra_state; | |
464 | int error, rgrps; | |
465 | ||
466 | mutex_lock(&sdp->sd_rindex_mutex); | |
467 | file_ra_state_init(&ra_state, inode->i_mapping); | |
468 | for (rgrps = 0;; rgrps++) { | |
469 | loff_t pos = rgrps * sizeof(struct gfs2_rindex); | |
470 | ||
471 | if (pos + sizeof(struct gfs2_rindex) >= ip->i_di.di_size) | |
472 | break; | |
473 | error = gfs2_internal_read(ip, &ra_state, buf, &pos, | |
474 | sizeof(struct gfs2_rindex)); | |
475 | if (error != sizeof(struct gfs2_rindex)) | |
476 | break; | |
bb8d8a6f | 477 | total_data += be32_to_cpu(((struct gfs2_rindex *)buf)->ri_data); |
7ae8fa84 RP |
478 | } |
479 | mutex_unlock(&sdp->sd_rindex_mutex); | |
480 | return total_data; | |
481 | } | |
482 | ||
bb8d8a6f SW |
483 | static void gfs2_rindex_in(struct gfs2_rgrpd *rgd, const void *buf) |
484 | { | |
485 | const struct gfs2_rindex *str = buf; | |
486 | ||
487 | rgd->rd_addr = be64_to_cpu(str->ri_addr); | |
488 | rgd->rd_length = be32_to_cpu(str->ri_length); | |
489 | rgd->rd_data0 = be64_to_cpu(str->ri_data0); | |
490 | rgd->rd_data = be32_to_cpu(str->ri_data); | |
491 | rgd->rd_bitbytes = be32_to_cpu(str->ri_bitbytes); | |
492 | } | |
493 | ||
b3b94faa | 494 | /** |
6c53267f | 495 | * read_rindex_entry - Pull in a new resource index entry from the disk |
b3b94faa DT |
496 | * @gl: The glock covering the rindex inode |
497 | * | |
6c53267f RP |
498 | * Returns: 0 on success, error code otherwise |
499 | */ | |
500 | ||
501 | static int read_rindex_entry(struct gfs2_inode *ip, | |
502 | struct file_ra_state *ra_state) | |
503 | { | |
504 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); | |
505 | loff_t pos = sdp->sd_rgrps * sizeof(struct gfs2_rindex); | |
506 | char buf[sizeof(struct gfs2_rindex)]; | |
507 | int error; | |
508 | struct gfs2_rgrpd *rgd; | |
509 | ||
510 | error = gfs2_internal_read(ip, ra_state, buf, &pos, | |
511 | sizeof(struct gfs2_rindex)); | |
512 | if (!error) | |
513 | return 0; | |
514 | if (error != sizeof(struct gfs2_rindex)) { | |
515 | if (error > 0) | |
516 | error = -EIO; | |
517 | return error; | |
518 | } | |
519 | ||
6bdd9be6 | 520 | rgd = kmem_cache_zalloc(gfs2_rgrpd_cachep, GFP_NOFS); |
6c53267f RP |
521 | error = -ENOMEM; |
522 | if (!rgd) | |
523 | return error; | |
524 | ||
525 | mutex_init(&rgd->rd_mutex); | |
526 | lops_init_le(&rgd->rd_le, &gfs2_rg_lops); | |
527 | rgd->rd_sbd = sdp; | |
528 | ||
529 | list_add_tail(&rgd->rd_list, &sdp->sd_rindex_list); | |
530 | list_add_tail(&rgd->rd_list_mru, &sdp->sd_rindex_mru_list); | |
531 | ||
bb8d8a6f | 532 | gfs2_rindex_in(rgd, buf); |
6c53267f RP |
533 | error = compute_bitstructs(rgd); |
534 | if (error) | |
535 | return error; | |
536 | ||
bb8d8a6f | 537 | error = gfs2_glock_get(sdp, rgd->rd_addr, |
6c53267f RP |
538 | &gfs2_rgrp_glops, CREATE, &rgd->rd_gl); |
539 | if (error) | |
540 | return error; | |
541 | ||
542 | rgd->rd_gl->gl_object = rgd; | |
543 | rgd->rd_rg_vn = rgd->rd_gl->gl_vn - 1; | |
c8cdf479 | 544 | rgd->rd_flags |= GFS2_RDF_CHECK; |
6c53267f RP |
545 | return error; |
546 | } | |
547 | ||
548 | /** | |
549 | * gfs2_ri_update - Pull in a new resource index from the disk | |
550 | * @ip: pointer to the rindex inode | |
551 | * | |
b3b94faa DT |
552 | * Returns: 0 on successful update, error code otherwise |
553 | */ | |
554 | ||
555 | static int gfs2_ri_update(struct gfs2_inode *ip) | |
556 | { | |
feaa7bba SW |
557 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
558 | struct inode *inode = &ip->i_inode; | |
f42faf4f | 559 | struct file_ra_state ra_state; |
cd81a4ba | 560 | u64 rgrp_count = ip->i_di.di_size; |
b3b94faa DT |
561 | int error; |
562 | ||
cd81a4ba | 563 | if (do_div(rgrp_count, sizeof(struct gfs2_rindex))) { |
b3b94faa DT |
564 | gfs2_consist_inode(ip); |
565 | return -EIO; | |
566 | } | |
567 | ||
568 | clear_rgrpdi(sdp); | |
569 | ||
f42faf4f | 570 | file_ra_state_init(&ra_state, inode->i_mapping); |
cd81a4ba | 571 | for (sdp->sd_rgrps = 0; sdp->sd_rgrps < rgrp_count; sdp->sd_rgrps++) { |
6c53267f RP |
572 | error = read_rindex_entry(ip, &ra_state); |
573 | if (error) { | |
574 | clear_rgrpdi(sdp); | |
575 | return error; | |
b3b94faa | 576 | } |
6c53267f | 577 | } |
b3b94faa | 578 | |
6c53267f RP |
579 | sdp->sd_rindex_vn = ip->i_gl->gl_vn; |
580 | return 0; | |
581 | } | |
b3b94faa | 582 | |
6c53267f RP |
583 | /** |
584 | * gfs2_ri_update_special - Pull in a new resource index from the disk | |
585 | * | |
586 | * This is a special version that's safe to call from gfs2_inplace_reserve_i. | |
587 | * In this case we know that we don't have any resource groups in memory yet. | |
588 | * | |
589 | * @ip: pointer to the rindex inode | |
590 | * | |
591 | * Returns: 0 on successful update, error code otherwise | |
592 | */ | |
593 | static int gfs2_ri_update_special(struct gfs2_inode *ip) | |
594 | { | |
595 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); | |
596 | struct inode *inode = &ip->i_inode; | |
597 | struct file_ra_state ra_state; | |
598 | int error; | |
b3b94faa | 599 | |
6c53267f RP |
600 | file_ra_state_init(&ra_state, inode->i_mapping); |
601 | for (sdp->sd_rgrps = 0;; sdp->sd_rgrps++) { | |
602 | /* Ignore partials */ | |
603 | if ((sdp->sd_rgrps + 1) * sizeof(struct gfs2_rindex) > | |
604 | ip->i_di.di_size) | |
605 | break; | |
606 | error = read_rindex_entry(ip, &ra_state); | |
607 | if (error) { | |
608 | clear_rgrpdi(sdp); | |
609 | return error; | |
610 | } | |
b3b94faa DT |
611 | } |
612 | ||
613 | sdp->sd_rindex_vn = ip->i_gl->gl_vn; | |
b3b94faa | 614 | return 0; |
b3b94faa DT |
615 | } |
616 | ||
617 | /** | |
618 | * gfs2_rindex_hold - Grab a lock on the rindex | |
619 | * @sdp: The GFS2 superblock | |
620 | * @ri_gh: the glock holder | |
621 | * | |
622 | * We grab a lock on the rindex inode to make sure that it doesn't | |
623 | * change whilst we are performing an operation. We keep this lock | |
624 | * for quite long periods of time compared to other locks. This | |
625 | * doesn't matter, since it is shared and it is very, very rarely | |
626 | * accessed in the exclusive mode (i.e. only when expanding the filesystem). | |
627 | * | |
628 | * This makes sure that we're using the latest copy of the resource index | |
629 | * special file, which might have been updated if someone expanded the | |
630 | * filesystem (via gfs2_grow utility), which adds new resource groups. | |
631 | * | |
632 | * Returns: 0 on success, error code otherwise | |
633 | */ | |
634 | ||
635 | int gfs2_rindex_hold(struct gfs2_sbd *sdp, struct gfs2_holder *ri_gh) | |
636 | { | |
feaa7bba | 637 | struct gfs2_inode *ip = GFS2_I(sdp->sd_rindex); |
b3b94faa DT |
638 | struct gfs2_glock *gl = ip->i_gl; |
639 | int error; | |
640 | ||
641 | error = gfs2_glock_nq_init(gl, LM_ST_SHARED, 0, ri_gh); | |
642 | if (error) | |
643 | return error; | |
644 | ||
645 | /* Read new copy from disk if we don't have the latest */ | |
646 | if (sdp->sd_rindex_vn != gl->gl_vn) { | |
f55ab26a | 647 | mutex_lock(&sdp->sd_rindex_mutex); |
b3b94faa DT |
648 | if (sdp->sd_rindex_vn != gl->gl_vn) { |
649 | error = gfs2_ri_update(ip); | |
650 | if (error) | |
651 | gfs2_glock_dq_uninit(ri_gh); | |
652 | } | |
f55ab26a | 653 | mutex_unlock(&sdp->sd_rindex_mutex); |
b3b94faa DT |
654 | } |
655 | ||
656 | return error; | |
657 | } | |
658 | ||
42d52e38 | 659 | static void gfs2_rgrp_in(struct gfs2_rgrpd *rgd, const void *buf) |
bb8d8a6f SW |
660 | { |
661 | const struct gfs2_rgrp *str = buf; | |
42d52e38 BP |
662 | struct gfs2_rgrp_host *rg = &rgd->rd_rg; |
663 | u32 rg_flags; | |
bb8d8a6f | 664 | |
42d52e38 BP |
665 | rg_flags = be32_to_cpu(str->rg_flags); |
666 | if (rg_flags & GFS2_RGF_NOALLOC) | |
667 | rgd->rd_flags |= GFS2_RDF_NOALLOC; | |
668 | else | |
669 | rgd->rd_flags &= ~GFS2_RDF_NOALLOC; | |
bb8d8a6f SW |
670 | rg->rg_free = be32_to_cpu(str->rg_free); |
671 | rg->rg_dinodes = be32_to_cpu(str->rg_dinodes); | |
672 | rg->rg_igeneration = be64_to_cpu(str->rg_igeneration); | |
673 | } | |
674 | ||
42d52e38 | 675 | static void gfs2_rgrp_out(struct gfs2_rgrpd *rgd, void *buf) |
bb8d8a6f SW |
676 | { |
677 | struct gfs2_rgrp *str = buf; | |
42d52e38 BP |
678 | struct gfs2_rgrp_host *rg = &rgd->rd_rg; |
679 | u32 rg_flags = 0; | |
bb8d8a6f | 680 | |
42d52e38 BP |
681 | if (rgd->rd_flags & GFS2_RDF_NOALLOC) |
682 | rg_flags |= GFS2_RGF_NOALLOC; | |
683 | str->rg_flags = cpu_to_be32(rg_flags); | |
bb8d8a6f SW |
684 | str->rg_free = cpu_to_be32(rg->rg_free); |
685 | str->rg_dinodes = cpu_to_be32(rg->rg_dinodes); | |
686 | str->__pad = cpu_to_be32(0); | |
687 | str->rg_igeneration = cpu_to_be64(rg->rg_igeneration); | |
688 | memset(&str->rg_reserved, 0, sizeof(str->rg_reserved)); | |
689 | } | |
690 | ||
b3b94faa DT |
691 | /** |
692 | * gfs2_rgrp_bh_get - Read in a RG's header and bitmaps | |
693 | * @rgd: the struct gfs2_rgrpd describing the RG to read in | |
694 | * | |
695 | * Read in all of a Resource Group's header and bitmap blocks. | |
696 | * Caller must eventually call gfs2_rgrp_relse() to free the bitmaps. | |
697 | * | |
698 | * Returns: errno | |
699 | */ | |
700 | ||
701 | int gfs2_rgrp_bh_get(struct gfs2_rgrpd *rgd) | |
702 | { | |
703 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
704 | struct gfs2_glock *gl = rgd->rd_gl; | |
bb8d8a6f | 705 | unsigned int length = rgd->rd_length; |
b3b94faa DT |
706 | struct gfs2_bitmap *bi; |
707 | unsigned int x, y; | |
708 | int error; | |
709 | ||
f55ab26a | 710 | mutex_lock(&rgd->rd_mutex); |
b3b94faa DT |
711 | |
712 | spin_lock(&sdp->sd_rindex_spin); | |
713 | if (rgd->rd_bh_count) { | |
714 | rgd->rd_bh_count++; | |
715 | spin_unlock(&sdp->sd_rindex_spin); | |
f55ab26a | 716 | mutex_unlock(&rgd->rd_mutex); |
b3b94faa DT |
717 | return 0; |
718 | } | |
719 | spin_unlock(&sdp->sd_rindex_spin); | |
720 | ||
721 | for (x = 0; x < length; x++) { | |
722 | bi = rgd->rd_bits + x; | |
bb8d8a6f | 723 | error = gfs2_meta_read(gl, rgd->rd_addr + x, 0, &bi->bi_bh); |
b3b94faa DT |
724 | if (error) |
725 | goto fail; | |
726 | } | |
727 | ||
728 | for (y = length; y--;) { | |
729 | bi = rgd->rd_bits + y; | |
7276b3b0 | 730 | error = gfs2_meta_wait(sdp, bi->bi_bh); |
b3b94faa DT |
731 | if (error) |
732 | goto fail; | |
feaa7bba | 733 | if (gfs2_metatype_check(sdp, bi->bi_bh, y ? GFS2_METATYPE_RB : |
b3b94faa DT |
734 | GFS2_METATYPE_RG)) { |
735 | error = -EIO; | |
736 | goto fail; | |
737 | } | |
738 | } | |
739 | ||
740 | if (rgd->rd_rg_vn != gl->gl_vn) { | |
42d52e38 | 741 | gfs2_rgrp_in(rgd, (rgd->rd_bits[0].bi_bh)->b_data); |
b3b94faa DT |
742 | rgd->rd_rg_vn = gl->gl_vn; |
743 | } | |
744 | ||
745 | spin_lock(&sdp->sd_rindex_spin); | |
746 | rgd->rd_free_clone = rgd->rd_rg.rg_free; | |
747 | rgd->rd_bh_count++; | |
748 | spin_unlock(&sdp->sd_rindex_spin); | |
749 | ||
f55ab26a | 750 | mutex_unlock(&rgd->rd_mutex); |
b3b94faa DT |
751 | |
752 | return 0; | |
753 | ||
feaa7bba | 754 | fail: |
b3b94faa DT |
755 | while (x--) { |
756 | bi = rgd->rd_bits + x; | |
757 | brelse(bi->bi_bh); | |
758 | bi->bi_bh = NULL; | |
759 | gfs2_assert_warn(sdp, !bi->bi_clone); | |
760 | } | |
f55ab26a | 761 | mutex_unlock(&rgd->rd_mutex); |
b3b94faa DT |
762 | |
763 | return error; | |
764 | } | |
765 | ||
766 | void gfs2_rgrp_bh_hold(struct gfs2_rgrpd *rgd) | |
767 | { | |
768 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
769 | ||
770 | spin_lock(&sdp->sd_rindex_spin); | |
771 | gfs2_assert_warn(rgd->rd_sbd, rgd->rd_bh_count); | |
772 | rgd->rd_bh_count++; | |
773 | spin_unlock(&sdp->sd_rindex_spin); | |
774 | } | |
775 | ||
776 | /** | |
777 | * gfs2_rgrp_bh_put - Release RG bitmaps read in with gfs2_rgrp_bh_get() | |
778 | * @rgd: the struct gfs2_rgrpd describing the RG to read in | |
779 | * | |
780 | */ | |
781 | ||
782 | void gfs2_rgrp_bh_put(struct gfs2_rgrpd *rgd) | |
783 | { | |
784 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
bb8d8a6f | 785 | int x, length = rgd->rd_length; |
b3b94faa DT |
786 | |
787 | spin_lock(&sdp->sd_rindex_spin); | |
788 | gfs2_assert_warn(rgd->rd_sbd, rgd->rd_bh_count); | |
789 | if (--rgd->rd_bh_count) { | |
790 | spin_unlock(&sdp->sd_rindex_spin); | |
791 | return; | |
792 | } | |
793 | ||
794 | for (x = 0; x < length; x++) { | |
795 | struct gfs2_bitmap *bi = rgd->rd_bits + x; | |
796 | kfree(bi->bi_clone); | |
797 | bi->bi_clone = NULL; | |
798 | brelse(bi->bi_bh); | |
799 | bi->bi_bh = NULL; | |
800 | } | |
801 | ||
802 | spin_unlock(&sdp->sd_rindex_spin); | |
803 | } | |
804 | ||
805 | void gfs2_rgrp_repolish_clones(struct gfs2_rgrpd *rgd) | |
806 | { | |
807 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
bb8d8a6f | 808 | unsigned int length = rgd->rd_length; |
b3b94faa DT |
809 | unsigned int x; |
810 | ||
811 | for (x = 0; x < length; x++) { | |
812 | struct gfs2_bitmap *bi = rgd->rd_bits + x; | |
813 | if (!bi->bi_clone) | |
814 | continue; | |
815 | memcpy(bi->bi_clone + bi->bi_offset, | |
feaa7bba | 816 | bi->bi_bh->b_data + bi->bi_offset, bi->bi_len); |
b3b94faa DT |
817 | } |
818 | ||
819 | spin_lock(&sdp->sd_rindex_spin); | |
820 | rgd->rd_free_clone = rgd->rd_rg.rg_free; | |
821 | spin_unlock(&sdp->sd_rindex_spin); | |
822 | } | |
823 | ||
824 | /** | |
825 | * gfs2_alloc_get - get the struct gfs2_alloc structure for an inode | |
826 | * @ip: the incore GFS2 inode structure | |
827 | * | |
828 | * Returns: the struct gfs2_alloc | |
829 | */ | |
830 | ||
831 | struct gfs2_alloc *gfs2_alloc_get(struct gfs2_inode *ip) | |
832 | { | |
6dbd8224 SW |
833 | BUG_ON(ip->i_alloc != NULL); |
834 | ip->i_alloc = kzalloc(sizeof(struct gfs2_alloc), GFP_KERNEL); | |
835 | return ip->i_alloc; | |
b3b94faa DT |
836 | } |
837 | ||
b3b94faa DT |
838 | /** |
839 | * try_rgrp_fit - See if a given reservation will fit in a given RG | |
840 | * @rgd: the RG data | |
841 | * @al: the struct gfs2_alloc structure describing the reservation | |
842 | * | |
843 | * If there's room for the requested blocks to be allocated from the RG: | |
b3b94faa DT |
844 | * Sets the $al_rgd field in @al. |
845 | * | |
846 | * Returns: 1 on success (it fits), 0 on failure (it doesn't fit) | |
847 | */ | |
848 | ||
849 | static int try_rgrp_fit(struct gfs2_rgrpd *rgd, struct gfs2_alloc *al) | |
850 | { | |
851 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
852 | int ret = 0; | |
853 | ||
42d52e38 | 854 | if (rgd->rd_flags & GFS2_RDF_NOALLOC) |
a43a4906 SW |
855 | return 0; |
856 | ||
b3b94faa DT |
857 | spin_lock(&sdp->sd_rindex_spin); |
858 | if (rgd->rd_free_clone >= al->al_requested) { | |
859 | al->al_rgd = rgd; | |
860 | ret = 1; | |
861 | } | |
862 | spin_unlock(&sdp->sd_rindex_spin); | |
863 | ||
864 | return ret; | |
865 | } | |
866 | ||
c8cdf479 SW |
867 | /** |
868 | * try_rgrp_unlink - Look for any unlinked, allocated, but unused inodes | |
869 | * @rgd: The rgrp | |
870 | * | |
871 | * Returns: The inode, if one has been found | |
872 | */ | |
873 | ||
874 | static struct inode *try_rgrp_unlink(struct gfs2_rgrpd *rgd, u64 *last_unlinked) | |
875 | { | |
876 | struct inode *inode; | |
6760bdcd | 877 | u32 goal = 0, block; |
bb9bcf06 | 878 | u64 no_addr; |
5f3eae75 | 879 | struct gfs2_sbd *sdp = rgd->rd_sbd; |
c8cdf479 SW |
880 | |
881 | for(;;) { | |
24c73873 BP |
882 | if (goal >= rgd->rd_data) |
883 | break; | |
5f3eae75 | 884 | down_write(&sdp->sd_log_flush_lock); |
6760bdcd BP |
885 | block = rgblk_search(rgd, goal, GFS2_BLKST_UNLINKED, |
886 | GFS2_BLKST_UNLINKED); | |
5f3eae75 | 887 | up_write(&sdp->sd_log_flush_lock); |
6760bdcd | 888 | if (block == BFITNOENT) |
24c73873 | 889 | break; |
6760bdcd BP |
890 | /* rgblk_search can return a block < goal, so we need to |
891 | keep it marching forward. */ | |
892 | no_addr = block + rgd->rd_data0; | |
24c73873 | 893 | goal++; |
6760bdcd | 894 | if (*last_unlinked != NO_BLOCK && no_addr <= *last_unlinked) |
c8cdf479 | 895 | continue; |
bb9bcf06 WC |
896 | *last_unlinked = no_addr; |
897 | inode = gfs2_inode_lookup(rgd->rd_sbd->sd_vfs, DT_UNKNOWN, | |
7a9f53b3 | 898 | no_addr, -1, 1); |
c8cdf479 SW |
899 | if (!IS_ERR(inode)) |
900 | return inode; | |
901 | } | |
902 | ||
903 | rgd->rd_flags &= ~GFS2_RDF_CHECK; | |
904 | return NULL; | |
905 | } | |
906 | ||
b3b94faa DT |
907 | /** |
908 | * recent_rgrp_first - get first RG from "recent" list | |
909 | * @sdp: The GFS2 superblock | |
910 | * @rglast: address of the rgrp used last | |
911 | * | |
912 | * Returns: The first rgrp in the recent list | |
913 | */ | |
914 | ||
915 | static struct gfs2_rgrpd *recent_rgrp_first(struct gfs2_sbd *sdp, | |
cd915493 | 916 | u64 rglast) |
b3b94faa DT |
917 | { |
918 | struct gfs2_rgrpd *rgd = NULL; | |
919 | ||
920 | spin_lock(&sdp->sd_rindex_spin); | |
921 | ||
922 | if (list_empty(&sdp->sd_rindex_recent_list)) | |
923 | goto out; | |
924 | ||
925 | if (!rglast) | |
926 | goto first; | |
927 | ||
928 | list_for_each_entry(rgd, &sdp->sd_rindex_recent_list, rd_recent) { | |
bb8d8a6f | 929 | if (rgd->rd_addr == rglast) |
b3b94faa DT |
930 | goto out; |
931 | } | |
932 | ||
feaa7bba | 933 | first: |
b3b94faa DT |
934 | rgd = list_entry(sdp->sd_rindex_recent_list.next, struct gfs2_rgrpd, |
935 | rd_recent); | |
feaa7bba | 936 | out: |
b3b94faa | 937 | spin_unlock(&sdp->sd_rindex_spin); |
b3b94faa DT |
938 | return rgd; |
939 | } | |
940 | ||
941 | /** | |
942 | * recent_rgrp_next - get next RG from "recent" list | |
943 | * @cur_rgd: current rgrp | |
944 | * @remove: | |
945 | * | |
946 | * Returns: The next rgrp in the recent list | |
947 | */ | |
948 | ||
949 | static struct gfs2_rgrpd *recent_rgrp_next(struct gfs2_rgrpd *cur_rgd, | |
950 | int remove) | |
951 | { | |
952 | struct gfs2_sbd *sdp = cur_rgd->rd_sbd; | |
953 | struct list_head *head; | |
954 | struct gfs2_rgrpd *rgd; | |
955 | ||
956 | spin_lock(&sdp->sd_rindex_spin); | |
957 | ||
958 | head = &sdp->sd_rindex_recent_list; | |
959 | ||
960 | list_for_each_entry(rgd, head, rd_recent) { | |
961 | if (rgd == cur_rgd) { | |
962 | if (cur_rgd->rd_recent.next != head) | |
963 | rgd = list_entry(cur_rgd->rd_recent.next, | |
964 | struct gfs2_rgrpd, rd_recent); | |
965 | else | |
966 | rgd = NULL; | |
967 | ||
968 | if (remove) | |
969 | list_del(&cur_rgd->rd_recent); | |
970 | ||
971 | goto out; | |
972 | } | |
973 | } | |
974 | ||
975 | rgd = NULL; | |
976 | if (!list_empty(head)) | |
977 | rgd = list_entry(head->next, struct gfs2_rgrpd, rd_recent); | |
978 | ||
feaa7bba | 979 | out: |
b3b94faa | 980 | spin_unlock(&sdp->sd_rindex_spin); |
b3b94faa DT |
981 | return rgd; |
982 | } | |
983 | ||
984 | /** | |
985 | * recent_rgrp_add - add an RG to tail of "recent" list | |
986 | * @new_rgd: The rgrp to add | |
987 | * | |
988 | */ | |
989 | ||
990 | static void recent_rgrp_add(struct gfs2_rgrpd *new_rgd) | |
991 | { | |
992 | struct gfs2_sbd *sdp = new_rgd->rd_sbd; | |
993 | struct gfs2_rgrpd *rgd; | |
994 | unsigned int count = 0; | |
995 | unsigned int max = sdp->sd_rgrps / gfs2_jindex_size(sdp); | |
996 | ||
997 | spin_lock(&sdp->sd_rindex_spin); | |
998 | ||
999 | list_for_each_entry(rgd, &sdp->sd_rindex_recent_list, rd_recent) { | |
1000 | if (rgd == new_rgd) | |
1001 | goto out; | |
1002 | ||
1003 | if (++count >= max) | |
1004 | goto out; | |
1005 | } | |
1006 | list_add_tail(&new_rgd->rd_recent, &sdp->sd_rindex_recent_list); | |
1007 | ||
feaa7bba | 1008 | out: |
b3b94faa DT |
1009 | spin_unlock(&sdp->sd_rindex_spin); |
1010 | } | |
1011 | ||
1012 | /** | |
1013 | * forward_rgrp_get - get an rgrp to try next from full list | |
1014 | * @sdp: The GFS2 superblock | |
1015 | * | |
1016 | * Returns: The rgrp to try next | |
1017 | */ | |
1018 | ||
1019 | static struct gfs2_rgrpd *forward_rgrp_get(struct gfs2_sbd *sdp) | |
1020 | { | |
1021 | struct gfs2_rgrpd *rgd; | |
1022 | unsigned int journals = gfs2_jindex_size(sdp); | |
1023 | unsigned int rg = 0, x; | |
1024 | ||
1025 | spin_lock(&sdp->sd_rindex_spin); | |
1026 | ||
1027 | rgd = sdp->sd_rindex_forward; | |
1028 | if (!rgd) { | |
1029 | if (sdp->sd_rgrps >= journals) | |
1030 | rg = sdp->sd_rgrps * sdp->sd_jdesc->jd_jid / journals; | |
1031 | ||
b8e1aabf | 1032 | for (x = 0, rgd = gfs2_rgrpd_get_first(sdp); x < rg; |
b3b94faa DT |
1033 | x++, rgd = gfs2_rgrpd_get_next(rgd)) |
1034 | /* Do Nothing */; | |
1035 | ||
1036 | sdp->sd_rindex_forward = rgd; | |
1037 | } | |
1038 | ||
1039 | spin_unlock(&sdp->sd_rindex_spin); | |
1040 | ||
1041 | return rgd; | |
1042 | } | |
1043 | ||
1044 | /** | |
1045 | * forward_rgrp_set - set the forward rgrp pointer | |
1046 | * @sdp: the filesystem | |
1047 | * @rgd: The new forward rgrp | |
1048 | * | |
1049 | */ | |
1050 | ||
1051 | static void forward_rgrp_set(struct gfs2_sbd *sdp, struct gfs2_rgrpd *rgd) | |
1052 | { | |
1053 | spin_lock(&sdp->sd_rindex_spin); | |
1054 | sdp->sd_rindex_forward = rgd; | |
1055 | spin_unlock(&sdp->sd_rindex_spin); | |
1056 | } | |
1057 | ||
1058 | /** | |
1059 | * get_local_rgrp - Choose and lock a rgrp for allocation | |
1060 | * @ip: the inode to reserve space for | |
1061 | * @rgp: the chosen and locked rgrp | |
1062 | * | |
1063 | * Try to acquire rgrp in way which avoids contending with others. | |
1064 | * | |
1065 | * Returns: errno | |
1066 | */ | |
1067 | ||
c8cdf479 | 1068 | static struct inode *get_local_rgrp(struct gfs2_inode *ip, u64 *last_unlinked) |
b3b94faa | 1069 | { |
c8cdf479 | 1070 | struct inode *inode = NULL; |
feaa7bba | 1071 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
b3b94faa | 1072 | struct gfs2_rgrpd *rgd, *begin = NULL; |
6dbd8224 | 1073 | struct gfs2_alloc *al = ip->i_alloc; |
b3b94faa DT |
1074 | int flags = LM_FLAG_TRY; |
1075 | int skipped = 0; | |
1076 | int loops = 0; | |
292c8c14 | 1077 | int error, rg_locked; |
b3b94faa DT |
1078 | |
1079 | /* Try recently successful rgrps */ | |
1080 | ||
1081 | rgd = recent_rgrp_first(sdp, ip->i_last_rg_alloc); | |
1082 | ||
1083 | while (rgd) { | |
292c8c14 AD |
1084 | rg_locked = 0; |
1085 | ||
1086 | if (gfs2_glock_is_locked_by_me(rgd->rd_gl)) { | |
1087 | rg_locked = 1; | |
1088 | error = 0; | |
1089 | } else { | |
1090 | error = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_EXCLUSIVE, | |
1091 | LM_FLAG_TRY, &al->al_rgd_gh); | |
1092 | } | |
b3b94faa DT |
1093 | switch (error) { |
1094 | case 0: | |
1095 | if (try_rgrp_fit(rgd, al)) | |
1096 | goto out; | |
c8cdf479 SW |
1097 | if (rgd->rd_flags & GFS2_RDF_CHECK) |
1098 | inode = try_rgrp_unlink(rgd, last_unlinked); | |
292c8c14 AD |
1099 | if (!rg_locked) |
1100 | gfs2_glock_dq_uninit(&al->al_rgd_gh); | |
c8cdf479 SW |
1101 | if (inode) |
1102 | return inode; | |
b3b94faa DT |
1103 | rgd = recent_rgrp_next(rgd, 1); |
1104 | break; | |
1105 | ||
1106 | case GLR_TRYFAILED: | |
1107 | rgd = recent_rgrp_next(rgd, 0); | |
1108 | break; | |
1109 | ||
1110 | default: | |
c8cdf479 | 1111 | return ERR_PTR(error); |
b3b94faa DT |
1112 | } |
1113 | } | |
1114 | ||
1115 | /* Go through full list of rgrps */ | |
1116 | ||
1117 | begin = rgd = forward_rgrp_get(sdp); | |
1118 | ||
1119 | for (;;) { | |
292c8c14 AD |
1120 | rg_locked = 0; |
1121 | ||
1122 | if (gfs2_glock_is_locked_by_me(rgd->rd_gl)) { | |
1123 | rg_locked = 1; | |
1124 | error = 0; | |
1125 | } else { | |
1126 | error = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_EXCLUSIVE, flags, | |
1127 | &al->al_rgd_gh); | |
1128 | } | |
b3b94faa DT |
1129 | switch (error) { |
1130 | case 0: | |
1131 | if (try_rgrp_fit(rgd, al)) | |
1132 | goto out; | |
c8cdf479 SW |
1133 | if (rgd->rd_flags & GFS2_RDF_CHECK) |
1134 | inode = try_rgrp_unlink(rgd, last_unlinked); | |
292c8c14 AD |
1135 | if (!rg_locked) |
1136 | gfs2_glock_dq_uninit(&al->al_rgd_gh); | |
c8cdf479 SW |
1137 | if (inode) |
1138 | return inode; | |
b3b94faa DT |
1139 | break; |
1140 | ||
1141 | case GLR_TRYFAILED: | |
1142 | skipped++; | |
1143 | break; | |
1144 | ||
1145 | default: | |
c8cdf479 | 1146 | return ERR_PTR(error); |
b3b94faa DT |
1147 | } |
1148 | ||
1149 | rgd = gfs2_rgrpd_get_next(rgd); | |
1150 | if (!rgd) | |
1151 | rgd = gfs2_rgrpd_get_first(sdp); | |
1152 | ||
1153 | if (rgd == begin) { | |
172e045a | 1154 | if (++loops >= 3) |
c8cdf479 | 1155 | return ERR_PTR(-ENOSPC); |
172e045a BM |
1156 | if (!skipped) |
1157 | loops++; | |
b3b94faa | 1158 | flags = 0; |
172e045a BM |
1159 | if (loops == 2) |
1160 | gfs2_log_flush(sdp, NULL); | |
b3b94faa DT |
1161 | } |
1162 | } | |
1163 | ||
feaa7bba | 1164 | out: |
bb8d8a6f | 1165 | ip->i_last_rg_alloc = rgd->rd_addr; |
b3b94faa DT |
1166 | |
1167 | if (begin) { | |
1168 | recent_rgrp_add(rgd); | |
1169 | rgd = gfs2_rgrpd_get_next(rgd); | |
1170 | if (!rgd) | |
1171 | rgd = gfs2_rgrpd_get_first(sdp); | |
1172 | forward_rgrp_set(sdp, rgd); | |
1173 | } | |
1174 | ||
c8cdf479 | 1175 | return NULL; |
b3b94faa DT |
1176 | } |
1177 | ||
1178 | /** | |
1179 | * gfs2_inplace_reserve_i - Reserve space in the filesystem | |
1180 | * @ip: the inode to reserve space for | |
1181 | * | |
1182 | * Returns: errno | |
1183 | */ | |
1184 | ||
1185 | int gfs2_inplace_reserve_i(struct gfs2_inode *ip, char *file, unsigned int line) | |
1186 | { | |
feaa7bba | 1187 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
6dbd8224 | 1188 | struct gfs2_alloc *al = ip->i_alloc; |
c8cdf479 | 1189 | struct inode *inode; |
7ae8fa84 | 1190 | int error = 0; |
6760bdcd | 1191 | u64 last_unlinked = NO_BLOCK; |
b3b94faa DT |
1192 | |
1193 | if (gfs2_assert_warn(sdp, al->al_requested)) | |
1194 | return -EINVAL; | |
1195 | ||
c8cdf479 | 1196 | try_again: |
7ae8fa84 RP |
1197 | /* We need to hold the rindex unless the inode we're using is |
1198 | the rindex itself, in which case it's already held. */ | |
1199 | if (ip != GFS2_I(sdp->sd_rindex)) | |
1200 | error = gfs2_rindex_hold(sdp, &al->al_ri_gh); | |
1201 | else if (!sdp->sd_rgrps) /* We may not have the rindex read in, so: */ | |
6c53267f | 1202 | error = gfs2_ri_update_special(ip); |
7ae8fa84 | 1203 | |
b3b94faa DT |
1204 | if (error) |
1205 | return error; | |
1206 | ||
c8cdf479 SW |
1207 | inode = get_local_rgrp(ip, &last_unlinked); |
1208 | if (inode) { | |
7ae8fa84 RP |
1209 | if (ip != GFS2_I(sdp->sd_rindex)) |
1210 | gfs2_glock_dq_uninit(&al->al_ri_gh); | |
c8cdf479 SW |
1211 | if (IS_ERR(inode)) |
1212 | return PTR_ERR(inode); | |
1213 | iput(inode); | |
1214 | gfs2_log_flush(sdp, NULL); | |
1215 | goto try_again; | |
b3b94faa DT |
1216 | } |
1217 | ||
1218 | al->al_file = file; | |
1219 | al->al_line = line; | |
1220 | ||
1221 | return 0; | |
1222 | } | |
1223 | ||
1224 | /** | |
1225 | * gfs2_inplace_release - release an inplace reservation | |
1226 | * @ip: the inode the reservation was taken out on | |
1227 | * | |
1228 | * Release a reservation made by gfs2_inplace_reserve(). | |
1229 | */ | |
1230 | ||
1231 | void gfs2_inplace_release(struct gfs2_inode *ip) | |
1232 | { | |
feaa7bba | 1233 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
6dbd8224 | 1234 | struct gfs2_alloc *al = ip->i_alloc; |
b3b94faa DT |
1235 | |
1236 | if (gfs2_assert_warn(sdp, al->al_alloced <= al->al_requested) == -1) | |
1237 | fs_warn(sdp, "al_alloced = %u, al_requested = %u " | |
1238 | "al_file = %s, al_line = %u\n", | |
1239 | al->al_alloced, al->al_requested, al->al_file, | |
1240 | al->al_line); | |
1241 | ||
1242 | al->al_rgd = NULL; | |
292c8c14 AD |
1243 | if (al->al_rgd_gh.gh_gl) |
1244 | gfs2_glock_dq_uninit(&al->al_rgd_gh); | |
7ae8fa84 RP |
1245 | if (ip != GFS2_I(sdp->sd_rindex)) |
1246 | gfs2_glock_dq_uninit(&al->al_ri_gh); | |
b3b94faa DT |
1247 | } |
1248 | ||
1249 | /** | |
1250 | * gfs2_get_block_type - Check a block in a RG is of given type | |
1251 | * @rgd: the resource group holding the block | |
1252 | * @block: the block number | |
1253 | * | |
1254 | * Returns: The block type (GFS2_BLKST_*) | |
1255 | */ | |
1256 | ||
cd915493 | 1257 | unsigned char gfs2_get_block_type(struct gfs2_rgrpd *rgd, u64 block) |
b3b94faa DT |
1258 | { |
1259 | struct gfs2_bitmap *bi = NULL; | |
cd915493 | 1260 | u32 length, rgrp_block, buf_block; |
b3b94faa DT |
1261 | unsigned int buf; |
1262 | unsigned char type; | |
1263 | ||
bb8d8a6f SW |
1264 | length = rgd->rd_length; |
1265 | rgrp_block = block - rgd->rd_data0; | |
b3b94faa DT |
1266 | |
1267 | for (buf = 0; buf < length; buf++) { | |
1268 | bi = rgd->rd_bits + buf; | |
1269 | if (rgrp_block < (bi->bi_start + bi->bi_len) * GFS2_NBBY) | |
1270 | break; | |
1271 | } | |
1272 | ||
1273 | gfs2_assert(rgd->rd_sbd, buf < length); | |
1274 | buf_block = rgrp_block - bi->bi_start * GFS2_NBBY; | |
1275 | ||
feaa7bba | 1276 | type = gfs2_testbit(rgd, bi->bi_bh->b_data + bi->bi_offset, |
b3b94faa DT |
1277 | bi->bi_len, buf_block); |
1278 | ||
1279 | return type; | |
1280 | } | |
1281 | ||
1282 | /** | |
1283 | * rgblk_search - find a block in @old_state, change allocation | |
1284 | * state to @new_state | |
1285 | * @rgd: the resource group descriptor | |
1286 | * @goal: the goal block within the RG (start here to search for avail block) | |
1287 | * @old_state: GFS2_BLKST_XXX the before-allocation state to find | |
1288 | * @new_state: GFS2_BLKST_XXX the after-allocation block state | |
1289 | * | |
1290 | * Walk rgrp's bitmap to find bits that represent a block in @old_state. | |
1291 | * Add the found bitmap buffer to the transaction. | |
1292 | * Set the found bits to @new_state to change block's allocation state. | |
1293 | * | |
1294 | * This function never fails, because we wouldn't call it unless we | |
1295 | * know (from reservation results, etc.) that a block is available. | |
1296 | * | |
1297 | * Scope of @goal and returned block is just within rgrp, not the whole | |
1298 | * filesystem. | |
1299 | * | |
1300 | * Returns: the block number allocated | |
1301 | */ | |
1302 | ||
cd915493 | 1303 | static u32 rgblk_search(struct gfs2_rgrpd *rgd, u32 goal, |
c8cdf479 | 1304 | unsigned char old_state, unsigned char new_state) |
b3b94faa DT |
1305 | { |
1306 | struct gfs2_bitmap *bi = NULL; | |
bb8d8a6f | 1307 | u32 length = rgd->rd_length; |
cd915493 | 1308 | u32 blk = 0; |
b3b94faa DT |
1309 | unsigned int buf, x; |
1310 | ||
1311 | /* Find bitmap block that contains bits for goal block */ | |
1312 | for (buf = 0; buf < length; buf++) { | |
1313 | bi = rgd->rd_bits + buf; | |
1314 | if (goal < (bi->bi_start + bi->bi_len) * GFS2_NBBY) | |
1315 | break; | |
1316 | } | |
1317 | ||
1318 | gfs2_assert(rgd->rd_sbd, buf < length); | |
1319 | ||
1320 | /* Convert scope of "goal" from rgrp-wide to within found bit block */ | |
1321 | goal -= bi->bi_start * GFS2_NBBY; | |
1322 | ||
1323 | /* Search (up to entire) bitmap in this rgrp for allocatable block. | |
1324 | "x <= length", instead of "x < length", because we typically start | |
1325 | the search in the middle of a bit block, but if we can't find an | |
1326 | allocatable block anywhere else, we want to be able wrap around and | |
1327 | search in the first part of our first-searched bit block. */ | |
1328 | for (x = 0; x <= length; x++) { | |
5f3eae75 BP |
1329 | /* The GFS2_BLKST_UNLINKED state doesn't apply to the clone |
1330 | bitmaps, so we must search the originals for that. */ | |
110acf38 | 1331 | const u8 *buffer = bi->bi_bh->b_data + bi->bi_offset; |
5f3eae75 | 1332 | if (old_state != GFS2_BLKST_UNLINKED && bi->bi_clone) |
110acf38 SW |
1333 | buffer = bi->bi_clone + bi->bi_offset; |
1334 | ||
1335 | blk = gfs2_bitfit(buffer, bi->bi_len, goal, old_state); | |
b3b94faa DT |
1336 | if (blk != BFITNOENT) |
1337 | break; | |
1338 | ||
1339 | /* Try next bitmap block (wrap back to rgrp header if at end) */ | |
1340 | buf = (buf + 1) % length; | |
1341 | bi = rgd->rd_bits + buf; | |
1342 | goal = 0; | |
1343 | } | |
1344 | ||
6760bdcd | 1345 | if (blk != BFITNOENT && old_state != new_state) { |
c8cdf479 SW |
1346 | gfs2_trans_add_bh(rgd->rd_gl, bi->bi_bh, 1); |
1347 | gfs2_setbit(rgd, bi->bi_bh->b_data + bi->bi_offset, | |
b3b94faa | 1348 | bi->bi_len, blk, new_state); |
c8cdf479 SW |
1349 | if (bi->bi_clone) |
1350 | gfs2_setbit(rgd, bi->bi_clone + bi->bi_offset, | |
1351 | bi->bi_len, blk, new_state); | |
1352 | } | |
b3b94faa | 1353 | |
6eefaf61 | 1354 | return (blk == BFITNOENT) ? blk : (bi->bi_start * GFS2_NBBY) + blk; |
b3b94faa DT |
1355 | } |
1356 | ||
1357 | /** | |
1358 | * rgblk_free - Change alloc state of given block(s) | |
1359 | * @sdp: the filesystem | |
1360 | * @bstart: the start of a run of blocks to free | |
1361 | * @blen: the length of the block run (all must lie within ONE RG!) | |
1362 | * @new_state: GFS2_BLKST_XXX the after-allocation block state | |
1363 | * | |
1364 | * Returns: Resource group containing the block(s) | |
1365 | */ | |
1366 | ||
cd915493 SW |
1367 | static struct gfs2_rgrpd *rgblk_free(struct gfs2_sbd *sdp, u64 bstart, |
1368 | u32 blen, unsigned char new_state) | |
b3b94faa DT |
1369 | { |
1370 | struct gfs2_rgrpd *rgd; | |
1371 | struct gfs2_bitmap *bi = NULL; | |
cd915493 | 1372 | u32 length, rgrp_blk, buf_blk; |
b3b94faa DT |
1373 | unsigned int buf; |
1374 | ||
1375 | rgd = gfs2_blk2rgrpd(sdp, bstart); | |
1376 | if (!rgd) { | |
1377 | if (gfs2_consist(sdp)) | |
382066da | 1378 | fs_err(sdp, "block = %llu\n", (unsigned long long)bstart); |
b3b94faa DT |
1379 | return NULL; |
1380 | } | |
1381 | ||
bb8d8a6f | 1382 | length = rgd->rd_length; |
b3b94faa | 1383 | |
bb8d8a6f | 1384 | rgrp_blk = bstart - rgd->rd_data0; |
b3b94faa DT |
1385 | |
1386 | while (blen--) { | |
1387 | for (buf = 0; buf < length; buf++) { | |
1388 | bi = rgd->rd_bits + buf; | |
1389 | if (rgrp_blk < (bi->bi_start + bi->bi_len) * GFS2_NBBY) | |
1390 | break; | |
1391 | } | |
1392 | ||
1393 | gfs2_assert(rgd->rd_sbd, buf < length); | |
1394 | ||
1395 | buf_blk = rgrp_blk - bi->bi_start * GFS2_NBBY; | |
1396 | rgrp_blk++; | |
1397 | ||
1398 | if (!bi->bi_clone) { | |
1399 | bi->bi_clone = kmalloc(bi->bi_bh->b_size, | |
dd894be8 | 1400 | GFP_NOFS | __GFP_NOFAIL); |
b3b94faa DT |
1401 | memcpy(bi->bi_clone + bi->bi_offset, |
1402 | bi->bi_bh->b_data + bi->bi_offset, | |
1403 | bi->bi_len); | |
1404 | } | |
d4e9c4c3 | 1405 | gfs2_trans_add_bh(rgd->rd_gl, bi->bi_bh, 1); |
dd894be8 | 1406 | gfs2_setbit(rgd, bi->bi_bh->b_data + bi->bi_offset, |
b3b94faa DT |
1407 | bi->bi_len, buf_blk, new_state); |
1408 | } | |
1409 | ||
1410 | return rgd; | |
1411 | } | |
1412 | ||
1413 | /** | |
1414 | * gfs2_alloc_data - Allocate a data block | |
1415 | * @ip: the inode to allocate the data block for | |
1416 | * | |
1417 | * Returns: the allocated block | |
1418 | */ | |
1419 | ||
4340fe62 | 1420 | u64 gfs2_alloc_data(struct gfs2_inode *ip) |
b3b94faa | 1421 | { |
feaa7bba | 1422 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
6dbd8224 | 1423 | struct gfs2_alloc *al = ip->i_alloc; |
b3b94faa | 1424 | struct gfs2_rgrpd *rgd = al->al_rgd; |
cd915493 SW |
1425 | u32 goal, blk; |
1426 | u64 block; | |
b3b94faa | 1427 | |
bb8d8a6f SW |
1428 | if (rgrp_contains_block(rgd, ip->i_di.di_goal_data)) |
1429 | goal = ip->i_di.di_goal_data - rgd->rd_data0; | |
b3b94faa DT |
1430 | else |
1431 | goal = rgd->rd_last_alloc_data; | |
1432 | ||
fd88de56 | 1433 | blk = rgblk_search(rgd, goal, GFS2_BLKST_FREE, GFS2_BLKST_USED); |
6eefaf61 | 1434 | BUG_ON(blk == BFITNOENT); |
b3b94faa DT |
1435 | rgd->rd_last_alloc_data = blk; |
1436 | ||
bb8d8a6f | 1437 | block = rgd->rd_data0 + blk; |
b3b94faa DT |
1438 | ip->i_di.di_goal_data = block; |
1439 | ||
1440 | gfs2_assert_withdraw(sdp, rgd->rd_rg.rg_free); | |
1441 | rgd->rd_rg.rg_free--; | |
1442 | ||
d4e9c4c3 | 1443 | gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1); |
42d52e38 | 1444 | gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data); |
b3b94faa DT |
1445 | |
1446 | al->al_alloced++; | |
1447 | ||
1448 | gfs2_statfs_change(sdp, 0, -1, 0); | |
2933f925 | 1449 | gfs2_quota_change(ip, +1, ip->i_inode.i_uid, ip->i_inode.i_gid); |
b3b94faa DT |
1450 | |
1451 | spin_lock(&sdp->sd_rindex_spin); | |
1452 | rgd->rd_free_clone--; | |
1453 | spin_unlock(&sdp->sd_rindex_spin); | |
1454 | ||
1455 | return block; | |
1456 | } | |
1457 | ||
1458 | /** | |
1459 | * gfs2_alloc_meta - Allocate a metadata block | |
1460 | * @ip: the inode to allocate the metadata block for | |
1461 | * | |
1462 | * Returns: the allocated block | |
1463 | */ | |
1464 | ||
4340fe62 | 1465 | u64 gfs2_alloc_meta(struct gfs2_inode *ip) |
b3b94faa | 1466 | { |
feaa7bba | 1467 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
6dbd8224 | 1468 | struct gfs2_alloc *al = ip->i_alloc; |
b3b94faa | 1469 | struct gfs2_rgrpd *rgd = al->al_rgd; |
cd915493 SW |
1470 | u32 goal, blk; |
1471 | u64 block; | |
b3b94faa | 1472 | |
bb8d8a6f SW |
1473 | if (rgrp_contains_block(rgd, ip->i_di.di_goal_meta)) |
1474 | goal = ip->i_di.di_goal_meta - rgd->rd_data0; | |
b3b94faa DT |
1475 | else |
1476 | goal = rgd->rd_last_alloc_meta; | |
1477 | ||
fd88de56 | 1478 | blk = rgblk_search(rgd, goal, GFS2_BLKST_FREE, GFS2_BLKST_USED); |
6eefaf61 | 1479 | BUG_ON(blk == BFITNOENT); |
b3b94faa DT |
1480 | rgd->rd_last_alloc_meta = blk; |
1481 | ||
bb8d8a6f | 1482 | block = rgd->rd_data0 + blk; |
b3b94faa DT |
1483 | ip->i_di.di_goal_meta = block; |
1484 | ||
1485 | gfs2_assert_withdraw(sdp, rgd->rd_rg.rg_free); | |
1486 | rgd->rd_rg.rg_free--; | |
1487 | ||
d4e9c4c3 | 1488 | gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1); |
42d52e38 | 1489 | gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data); |
b3b94faa DT |
1490 | |
1491 | al->al_alloced++; | |
1492 | ||
1493 | gfs2_statfs_change(sdp, 0, -1, 0); | |
2933f925 | 1494 | gfs2_quota_change(ip, +1, ip->i_inode.i_uid, ip->i_inode.i_gid); |
b3b94faa DT |
1495 | gfs2_trans_add_unrevoke(sdp, block); |
1496 | ||
1497 | spin_lock(&sdp->sd_rindex_spin); | |
1498 | rgd->rd_free_clone--; | |
1499 | spin_unlock(&sdp->sd_rindex_spin); | |
1500 | ||
1501 | return block; | |
1502 | } | |
1503 | ||
1504 | /** | |
1505 | * gfs2_alloc_di - Allocate a dinode | |
1506 | * @dip: the directory that the inode is going in | |
1507 | * | |
1508 | * Returns: the block allocated | |
1509 | */ | |
1510 | ||
4340fe62 | 1511 | u64 gfs2_alloc_di(struct gfs2_inode *dip, u64 *generation) |
b3b94faa | 1512 | { |
feaa7bba | 1513 | struct gfs2_sbd *sdp = GFS2_SB(&dip->i_inode); |
6dbd8224 | 1514 | struct gfs2_alloc *al = dip->i_alloc; |
b3b94faa | 1515 | struct gfs2_rgrpd *rgd = al->al_rgd; |
4340fe62 SW |
1516 | u32 blk; |
1517 | u64 block; | |
b3b94faa DT |
1518 | |
1519 | blk = rgblk_search(rgd, rgd->rd_last_alloc_meta, | |
1520 | GFS2_BLKST_FREE, GFS2_BLKST_DINODE); | |
6eefaf61 | 1521 | BUG_ON(blk == BFITNOENT); |
b3b94faa DT |
1522 | |
1523 | rgd->rd_last_alloc_meta = blk; | |
1524 | ||
bb8d8a6f | 1525 | block = rgd->rd_data0 + blk; |
b3b94faa DT |
1526 | |
1527 | gfs2_assert_withdraw(sdp, rgd->rd_rg.rg_free); | |
1528 | rgd->rd_rg.rg_free--; | |
1529 | rgd->rd_rg.rg_dinodes++; | |
4340fe62 | 1530 | *generation = rgd->rd_rg.rg_igeneration++; |
d4e9c4c3 | 1531 | gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1); |
42d52e38 | 1532 | gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data); |
b3b94faa DT |
1533 | |
1534 | al->al_alloced++; | |
1535 | ||
1536 | gfs2_statfs_change(sdp, 0, -1, +1); | |
1537 | gfs2_trans_add_unrevoke(sdp, block); | |
1538 | ||
1539 | spin_lock(&sdp->sd_rindex_spin); | |
1540 | rgd->rd_free_clone--; | |
1541 | spin_unlock(&sdp->sd_rindex_spin); | |
1542 | ||
1543 | return block; | |
1544 | } | |
1545 | ||
1546 | /** | |
1547 | * gfs2_free_data - free a contiguous run of data block(s) | |
1548 | * @ip: the inode these blocks are being freed from | |
1549 | * @bstart: first block of a run of contiguous blocks | |
1550 | * @blen: the length of the block run | |
1551 | * | |
1552 | */ | |
1553 | ||
cd915493 | 1554 | void gfs2_free_data(struct gfs2_inode *ip, u64 bstart, u32 blen) |
b3b94faa | 1555 | { |
feaa7bba | 1556 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
b3b94faa DT |
1557 | struct gfs2_rgrpd *rgd; |
1558 | ||
1559 | rgd = rgblk_free(sdp, bstart, blen, GFS2_BLKST_FREE); | |
1560 | if (!rgd) | |
1561 | return; | |
1562 | ||
1563 | rgd->rd_rg.rg_free += blen; | |
1564 | ||
d4e9c4c3 | 1565 | gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1); |
42d52e38 | 1566 | gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data); |
b3b94faa DT |
1567 | |
1568 | gfs2_trans_add_rg(rgd); | |
1569 | ||
1570 | gfs2_statfs_change(sdp, 0, +blen, 0); | |
2933f925 | 1571 | gfs2_quota_change(ip, -(s64)blen, ip->i_inode.i_uid, ip->i_inode.i_gid); |
b3b94faa DT |
1572 | } |
1573 | ||
1574 | /** | |
1575 | * gfs2_free_meta - free a contiguous run of data block(s) | |
1576 | * @ip: the inode these blocks are being freed from | |
1577 | * @bstart: first block of a run of contiguous blocks | |
1578 | * @blen: the length of the block run | |
1579 | * | |
1580 | */ | |
1581 | ||
cd915493 | 1582 | void gfs2_free_meta(struct gfs2_inode *ip, u64 bstart, u32 blen) |
b3b94faa | 1583 | { |
feaa7bba | 1584 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
b3b94faa DT |
1585 | struct gfs2_rgrpd *rgd; |
1586 | ||
1587 | rgd = rgblk_free(sdp, bstart, blen, GFS2_BLKST_FREE); | |
1588 | if (!rgd) | |
1589 | return; | |
1590 | ||
1591 | rgd->rd_rg.rg_free += blen; | |
1592 | ||
d4e9c4c3 | 1593 | gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1); |
42d52e38 | 1594 | gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data); |
b3b94faa DT |
1595 | |
1596 | gfs2_trans_add_rg(rgd); | |
1597 | ||
1598 | gfs2_statfs_change(sdp, 0, +blen, 0); | |
2933f925 | 1599 | gfs2_quota_change(ip, -(s64)blen, ip->i_inode.i_uid, ip->i_inode.i_gid); |
b3b94faa DT |
1600 | gfs2_meta_wipe(ip, bstart, blen); |
1601 | } | |
1602 | ||
feaa7bba SW |
1603 | void gfs2_unlink_di(struct inode *inode) |
1604 | { | |
1605 | struct gfs2_inode *ip = GFS2_I(inode); | |
1606 | struct gfs2_sbd *sdp = GFS2_SB(inode); | |
1607 | struct gfs2_rgrpd *rgd; | |
dbb7cae2 | 1608 | u64 blkno = ip->i_no_addr; |
feaa7bba SW |
1609 | |
1610 | rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_UNLINKED); | |
1611 | if (!rgd) | |
1612 | return; | |
1613 | gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1); | |
42d52e38 | 1614 | gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data); |
feaa7bba SW |
1615 | gfs2_trans_add_rg(rgd); |
1616 | } | |
1617 | ||
cd915493 | 1618 | static void gfs2_free_uninit_di(struct gfs2_rgrpd *rgd, u64 blkno) |
b3b94faa DT |
1619 | { |
1620 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
1621 | struct gfs2_rgrpd *tmp_rgd; | |
1622 | ||
1623 | tmp_rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_FREE); | |
1624 | if (!tmp_rgd) | |
1625 | return; | |
1626 | gfs2_assert_withdraw(sdp, rgd == tmp_rgd); | |
1627 | ||
1628 | if (!rgd->rd_rg.rg_dinodes) | |
1629 | gfs2_consist_rgrpd(rgd); | |
1630 | rgd->rd_rg.rg_dinodes--; | |
1631 | rgd->rd_rg.rg_free++; | |
1632 | ||
d4e9c4c3 | 1633 | gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1); |
42d52e38 | 1634 | gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data); |
b3b94faa DT |
1635 | |
1636 | gfs2_statfs_change(sdp, 0, +1, -1); | |
1637 | gfs2_trans_add_rg(rgd); | |
1638 | } | |
1639 | ||
b3b94faa DT |
1640 | |
1641 | void gfs2_free_di(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip) | |
1642 | { | |
dbb7cae2 | 1643 | gfs2_free_uninit_di(rgd, ip->i_no_addr); |
2933f925 | 1644 | gfs2_quota_change(ip, -1, ip->i_inode.i_uid, ip->i_inode.i_gid); |
dbb7cae2 | 1645 | gfs2_meta_wipe(ip, ip->i_no_addr, 1); |
b3b94faa DT |
1646 | } |
1647 | ||
1648 | /** | |
1649 | * gfs2_rlist_add - add a RG to a list of RGs | |
1650 | * @sdp: the filesystem | |
1651 | * @rlist: the list of resource groups | |
1652 | * @block: the block | |
1653 | * | |
1654 | * Figure out what RG a block belongs to and add that RG to the list | |
1655 | * | |
1656 | * FIXME: Don't use NOFAIL | |
1657 | * | |
1658 | */ | |
1659 | ||
1660 | void gfs2_rlist_add(struct gfs2_sbd *sdp, struct gfs2_rgrp_list *rlist, | |
cd915493 | 1661 | u64 block) |
b3b94faa DT |
1662 | { |
1663 | struct gfs2_rgrpd *rgd; | |
1664 | struct gfs2_rgrpd **tmp; | |
1665 | unsigned int new_space; | |
1666 | unsigned int x; | |
1667 | ||
1668 | if (gfs2_assert_warn(sdp, !rlist->rl_ghs)) | |
1669 | return; | |
1670 | ||
1671 | rgd = gfs2_blk2rgrpd(sdp, block); | |
1672 | if (!rgd) { | |
1673 | if (gfs2_consist(sdp)) | |
382066da | 1674 | fs_err(sdp, "block = %llu\n", (unsigned long long)block); |
b3b94faa DT |
1675 | return; |
1676 | } | |
1677 | ||
1678 | for (x = 0; x < rlist->rl_rgrps; x++) | |
1679 | if (rlist->rl_rgd[x] == rgd) | |
1680 | return; | |
1681 | ||
1682 | if (rlist->rl_rgrps == rlist->rl_space) { | |
1683 | new_space = rlist->rl_space + 10; | |
1684 | ||
1685 | tmp = kcalloc(new_space, sizeof(struct gfs2_rgrpd *), | |
dd894be8 | 1686 | GFP_NOFS | __GFP_NOFAIL); |
b3b94faa DT |
1687 | |
1688 | if (rlist->rl_rgd) { | |
1689 | memcpy(tmp, rlist->rl_rgd, | |
1690 | rlist->rl_space * sizeof(struct gfs2_rgrpd *)); | |
1691 | kfree(rlist->rl_rgd); | |
1692 | } | |
1693 | ||
1694 | rlist->rl_space = new_space; | |
1695 | rlist->rl_rgd = tmp; | |
1696 | } | |
1697 | ||
1698 | rlist->rl_rgd[rlist->rl_rgrps++] = rgd; | |
1699 | } | |
1700 | ||
1701 | /** | |
1702 | * gfs2_rlist_alloc - all RGs have been added to the rlist, now allocate | |
1703 | * and initialize an array of glock holders for them | |
1704 | * @rlist: the list of resource groups | |
1705 | * @state: the lock state to acquire the RG lock in | |
1706 | * @flags: the modifier flags for the holder structures | |
1707 | * | |
1708 | * FIXME: Don't use NOFAIL | |
1709 | * | |
1710 | */ | |
1711 | ||
fe6c991c | 1712 | void gfs2_rlist_alloc(struct gfs2_rgrp_list *rlist, unsigned int state) |
b3b94faa DT |
1713 | { |
1714 | unsigned int x; | |
1715 | ||
1716 | rlist->rl_ghs = kcalloc(rlist->rl_rgrps, sizeof(struct gfs2_holder), | |
dd894be8 | 1717 | GFP_NOFS | __GFP_NOFAIL); |
b3b94faa DT |
1718 | for (x = 0; x < rlist->rl_rgrps; x++) |
1719 | gfs2_holder_init(rlist->rl_rgd[x]->rd_gl, | |
fe6c991c | 1720 | state, 0, |
b3b94faa DT |
1721 | &rlist->rl_ghs[x]); |
1722 | } | |
1723 | ||
1724 | /** | |
1725 | * gfs2_rlist_free - free a resource group list | |
1726 | * @list: the list of resource groups | |
1727 | * | |
1728 | */ | |
1729 | ||
1730 | void gfs2_rlist_free(struct gfs2_rgrp_list *rlist) | |
1731 | { | |
1732 | unsigned int x; | |
1733 | ||
1734 | kfree(rlist->rl_rgd); | |
1735 | ||
1736 | if (rlist->rl_ghs) { | |
1737 | for (x = 0; x < rlist->rl_rgrps; x++) | |
1738 | gfs2_holder_uninit(&rlist->rl_ghs[x]); | |
1739 | kfree(rlist->rl_ghs); | |
1740 | } | |
1741 | } | |
1742 |