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> |
1f466a47 | 16 | #include <linux/prefetch.h> |
f15ab561 | 17 | #include <linux/blkdev.h> |
7c9ca621 | 18 | #include <linux/rbtree.h> |
9dbe9610 | 19 | #include <linux/random.h> |
b3b94faa DT |
20 | |
21 | #include "gfs2.h" | |
5c676f6d | 22 | #include "incore.h" |
b3b94faa DT |
23 | #include "glock.h" |
24 | #include "glops.h" | |
b3b94faa DT |
25 | #include "lops.h" |
26 | #include "meta_io.h" | |
27 | #include "quota.h" | |
28 | #include "rgrp.h" | |
29 | #include "super.h" | |
30 | #include "trans.h" | |
5c676f6d | 31 | #include "util.h" |
172e045a | 32 | #include "log.h" |
c8cdf479 | 33 | #include "inode.h" |
63997775 | 34 | #include "trace_gfs2.h" |
b3b94faa | 35 | |
2c1e52aa | 36 | #define BFITNOENT ((u32)~0) |
6760bdcd | 37 | #define NO_BLOCK ((u64)~0) |
88c8ab1f | 38 | |
1f466a47 BP |
39 | #if BITS_PER_LONG == 32 |
40 | #define LBITMASK (0x55555555UL) | |
41 | #define LBITSKIP55 (0x55555555UL) | |
42 | #define LBITSKIP00 (0x00000000UL) | |
43 | #else | |
44 | #define LBITMASK (0x5555555555555555UL) | |
45 | #define LBITSKIP55 (0x5555555555555555UL) | |
46 | #define LBITSKIP00 (0x0000000000000000UL) | |
47 | #endif | |
48 | ||
88c8ab1f SW |
49 | /* |
50 | * These routines are used by the resource group routines (rgrp.c) | |
51 | * to keep track of block allocation. Each block is represented by two | |
feaa7bba SW |
52 | * bits. So, each byte represents GFS2_NBBY (i.e. 4) blocks. |
53 | * | |
54 | * 0 = Free | |
55 | * 1 = Used (not metadata) | |
56 | * 2 = Unlinked (still in use) inode | |
57 | * 3 = Used (metadata) | |
88c8ab1f SW |
58 | */ |
59 | ||
60 | static const char valid_change[16] = { | |
61 | /* current */ | |
feaa7bba | 62 | /* n */ 0, 1, 1, 1, |
88c8ab1f | 63 | /* e */ 1, 0, 0, 0, |
feaa7bba | 64 | /* w */ 0, 0, 0, 1, |
88c8ab1f SW |
65 | 1, 0, 0, 0 |
66 | }; | |
67 | ||
ff7f4cb4 SW |
68 | static int gfs2_rbm_find(struct gfs2_rbm *rbm, u8 state, u32 minext, |
69 | const struct gfs2_inode *ip, bool nowrap); | |
70 | ||
71 | ||
88c8ab1f SW |
72 | /** |
73 | * gfs2_setbit - Set a bit in the bitmaps | |
3e6339dd SW |
74 | * @rbm: The position of the bit to set |
75 | * @do_clone: Also set the clone bitmap, if it exists | |
88c8ab1f SW |
76 | * @new_state: the new state of the block |
77 | * | |
78 | */ | |
79 | ||
3e6339dd | 80 | static inline void gfs2_setbit(const struct gfs2_rbm *rbm, bool do_clone, |
06344b91 | 81 | unsigned char new_state) |
88c8ab1f | 82 | { |
b45e41d7 | 83 | unsigned char *byte1, *byte2, *end, cur_state; |
3e6339dd SW |
84 | unsigned int buflen = rbm->bi->bi_len; |
85 | const unsigned int bit = (rbm->offset % GFS2_NBBY) * GFS2_BIT_SIZE; | |
88c8ab1f | 86 | |
3e6339dd SW |
87 | byte1 = rbm->bi->bi_bh->b_data + rbm->bi->bi_offset + (rbm->offset / GFS2_NBBY); |
88 | end = rbm->bi->bi_bh->b_data + rbm->bi->bi_offset + buflen; | |
88c8ab1f | 89 | |
b45e41d7 | 90 | BUG_ON(byte1 >= end); |
88c8ab1f | 91 | |
b45e41d7 | 92 | cur_state = (*byte1 >> bit) & GFS2_BIT_MASK; |
88c8ab1f | 93 | |
b45e41d7 | 94 | if (unlikely(!valid_change[new_state * 4 + cur_state])) { |
3e6339dd SW |
95 | printk(KERN_WARNING "GFS2: buf_blk = 0x%x old_state=%d, " |
96 | "new_state=%d\n", rbm->offset, cur_state, new_state); | |
97 | printk(KERN_WARNING "GFS2: rgrp=0x%llx bi_start=0x%x\n", | |
98 | (unsigned long long)rbm->rgd->rd_addr, | |
99 | rbm->bi->bi_start); | |
100 | printk(KERN_WARNING "GFS2: bi_offset=0x%x bi_len=0x%x\n", | |
101 | rbm->bi->bi_offset, rbm->bi->bi_len); | |
95c8e17f | 102 | dump_stack(); |
3e6339dd | 103 | gfs2_consist_rgrpd(rbm->rgd); |
b45e41d7 SW |
104 | return; |
105 | } | |
106 | *byte1 ^= (cur_state ^ new_state) << bit; | |
107 | ||
3e6339dd SW |
108 | if (do_clone && rbm->bi->bi_clone) { |
109 | byte2 = rbm->bi->bi_clone + rbm->bi->bi_offset + (rbm->offset / GFS2_NBBY); | |
b45e41d7 SW |
110 | cur_state = (*byte2 >> bit) & GFS2_BIT_MASK; |
111 | *byte2 ^= (cur_state ^ new_state) << bit; | |
112 | } | |
88c8ab1f SW |
113 | } |
114 | ||
115 | /** | |
116 | * gfs2_testbit - test a bit in the bitmaps | |
c04a2ef3 | 117 | * @rbm: The bit to test |
88c8ab1f | 118 | * |
c04a2ef3 | 119 | * Returns: The two bit block state of the requested bit |
88c8ab1f SW |
120 | */ |
121 | ||
c04a2ef3 | 122 | static inline u8 gfs2_testbit(const struct gfs2_rbm *rbm) |
88c8ab1f | 123 | { |
c04a2ef3 SW |
124 | const u8 *buffer = rbm->bi->bi_bh->b_data + rbm->bi->bi_offset; |
125 | const u8 *byte; | |
88c8ab1f SW |
126 | unsigned int bit; |
127 | ||
c04a2ef3 SW |
128 | byte = buffer + (rbm->offset / GFS2_NBBY); |
129 | bit = (rbm->offset % GFS2_NBBY) * GFS2_BIT_SIZE; | |
88c8ab1f | 130 | |
c04a2ef3 | 131 | return (*byte >> bit) & GFS2_BIT_MASK; |
88c8ab1f SW |
132 | } |
133 | ||
223b2b88 SW |
134 | /** |
135 | * gfs2_bit_search | |
136 | * @ptr: Pointer to bitmap data | |
137 | * @mask: Mask to use (normally 0x55555.... but adjusted for search start) | |
138 | * @state: The state we are searching for | |
139 | * | |
140 | * We xor the bitmap data with a patter which is the bitwise opposite | |
141 | * of what we are looking for, this gives rise to a pattern of ones | |
142 | * wherever there is a match. Since we have two bits per entry, we | |
143 | * take this pattern, shift it down by one place and then and it with | |
144 | * the original. All the even bit positions (0,2,4, etc) then represent | |
145 | * successful matches, so we mask with 0x55555..... to remove the unwanted | |
146 | * odd bit positions. | |
147 | * | |
148 | * This allows searching of a whole u64 at once (32 blocks) with a | |
149 | * single test (on 64 bit arches). | |
150 | */ | |
151 | ||
152 | static inline u64 gfs2_bit_search(const __le64 *ptr, u64 mask, u8 state) | |
153 | { | |
154 | u64 tmp; | |
155 | static const u64 search[] = { | |
075ac448 HE |
156 | [0] = 0xffffffffffffffffULL, |
157 | [1] = 0xaaaaaaaaaaaaaaaaULL, | |
158 | [2] = 0x5555555555555555ULL, | |
159 | [3] = 0x0000000000000000ULL, | |
223b2b88 SW |
160 | }; |
161 | tmp = le64_to_cpu(*ptr) ^ search[state]; | |
162 | tmp &= (tmp >> 1); | |
163 | tmp &= mask; | |
164 | return tmp; | |
165 | } | |
166 | ||
8e2e0047 BP |
167 | /** |
168 | * rs_cmp - multi-block reservation range compare | |
169 | * @blk: absolute file system block number of the new reservation | |
170 | * @len: number of blocks in the new reservation | |
171 | * @rs: existing reservation to compare against | |
172 | * | |
173 | * returns: 1 if the block range is beyond the reach of the reservation | |
174 | * -1 if the block range is before the start of the reservation | |
175 | * 0 if the block range overlaps with the reservation | |
176 | */ | |
177 | static inline int rs_cmp(u64 blk, u32 len, struct gfs2_blkreserv *rs) | |
178 | { | |
4a993fb1 | 179 | u64 startblk = gfs2_rbm_to_block(&rs->rs_rbm); |
8e2e0047 BP |
180 | |
181 | if (blk >= startblk + rs->rs_free) | |
182 | return 1; | |
183 | if (blk + len - 1 < startblk) | |
184 | return -1; | |
185 | return 0; | |
186 | } | |
187 | ||
88c8ab1f SW |
188 | /** |
189 | * gfs2_bitfit - Search an rgrp's bitmap buffer to find a bit-pair representing | |
190 | * a block in a given allocation state. | |
886b1416 | 191 | * @buf: the buffer that holds the bitmaps |
223b2b88 | 192 | * @len: the length (in bytes) of the buffer |
88c8ab1f | 193 | * @goal: start search at this block's bit-pair (within @buffer) |
223b2b88 | 194 | * @state: GFS2_BLKST_XXX the state of the block we're looking for. |
88c8ab1f SW |
195 | * |
196 | * Scope of @goal and returned block number is only within this bitmap buffer, | |
197 | * not entire rgrp or filesystem. @buffer will be offset from the actual | |
223b2b88 SW |
198 | * beginning of a bitmap block buffer, skipping any header structures, but |
199 | * headers are always a multiple of 64 bits long so that the buffer is | |
200 | * always aligned to a 64 bit boundary. | |
201 | * | |
202 | * The size of the buffer is in bytes, but is it assumed that it is | |
fd589a8f | 203 | * always ok to read a complete multiple of 64 bits at the end |
223b2b88 | 204 | * of the block in case the end is no aligned to a natural boundary. |
88c8ab1f SW |
205 | * |
206 | * Return: the block number (bitmap buffer scope) that was found | |
207 | */ | |
208 | ||
02ab1721 HE |
209 | static u32 gfs2_bitfit(const u8 *buf, const unsigned int len, |
210 | u32 goal, u8 state) | |
88c8ab1f | 211 | { |
223b2b88 SW |
212 | u32 spoint = (goal << 1) & ((8*sizeof(u64)) - 1); |
213 | const __le64 *ptr = ((__le64 *)buf) + (goal >> 5); | |
214 | const __le64 *end = (__le64 *)(buf + ALIGN(len, sizeof(u64))); | |
215 | u64 tmp; | |
075ac448 | 216 | u64 mask = 0x5555555555555555ULL; |
223b2b88 SW |
217 | u32 bit; |
218 | ||
223b2b88 SW |
219 | /* Mask off bits we don't care about at the start of the search */ |
220 | mask <<= spoint; | |
221 | tmp = gfs2_bit_search(ptr, mask, state); | |
222 | ptr++; | |
223 | while(tmp == 0 && ptr < end) { | |
075ac448 | 224 | tmp = gfs2_bit_search(ptr, 0x5555555555555555ULL, state); |
223b2b88 | 225 | ptr++; |
1f466a47 | 226 | } |
223b2b88 SW |
227 | /* Mask off any bits which are more than len bytes from the start */ |
228 | if (ptr == end && (len & (sizeof(u64) - 1))) | |
229 | tmp &= (((u64)~0) >> (64 - 8*(len & (sizeof(u64) - 1)))); | |
230 | /* Didn't find anything, so return */ | |
231 | if (tmp == 0) | |
232 | return BFITNOENT; | |
233 | ptr--; | |
d8bd504a | 234 | bit = __ffs64(tmp); |
223b2b88 SW |
235 | bit /= 2; /* two bits per entry in the bitmap */ |
236 | return (((const unsigned char *)ptr - buf) * GFS2_NBBY) + bit; | |
88c8ab1f SW |
237 | } |
238 | ||
ff7f4cb4 SW |
239 | /** |
240 | * gfs2_rbm_from_block - Set the rbm based upon rgd and block number | |
241 | * @rbm: The rbm with rgd already set correctly | |
242 | * @block: The block number (filesystem relative) | |
243 | * | |
244 | * This sets the bi and offset members of an rbm based on a | |
245 | * resource group and a filesystem relative block number. The | |
246 | * resource group must be set in the rbm on entry, the bi and | |
247 | * offset members will be set by this function. | |
248 | * | |
249 | * Returns: 0 on success, or an error code | |
250 | */ | |
251 | ||
252 | static int gfs2_rbm_from_block(struct gfs2_rbm *rbm, u64 block) | |
253 | { | |
254 | u64 rblock = block - rbm->rgd->rd_data0; | |
a68a0a35 | 255 | u32 x; |
ff7f4cb4 SW |
256 | |
257 | if (WARN_ON_ONCE(rblock > UINT_MAX)) | |
258 | return -EINVAL; | |
259 | if (block >= rbm->rgd->rd_data0 + rbm->rgd->rd_data) | |
260 | return -E2BIG; | |
261 | ||
a68a0a35 BP |
262 | rbm->bi = rbm->rgd->rd_bits; |
263 | rbm->offset = (u32)(rblock); | |
264 | /* Check if the block is within the first block */ | |
7e230f57 | 265 | if (rbm->offset < rbm->bi->bi_blocks) |
a68a0a35 BP |
266 | return 0; |
267 | ||
268 | /* Adjust for the size diff between gfs2_meta_header and gfs2_rgrp */ | |
269 | rbm->offset += (sizeof(struct gfs2_rgrp) - | |
270 | sizeof(struct gfs2_meta_header)) * GFS2_NBBY; | |
271 | x = rbm->offset / rbm->rgd->rd_sbd->sd_blocks_per_bitmap; | |
272 | rbm->offset -= x * rbm->rgd->rd_sbd->sd_blocks_per_bitmap; | |
273 | rbm->bi += x; | |
ff7f4cb4 SW |
274 | return 0; |
275 | } | |
276 | ||
277 | /** | |
278 | * gfs2_unaligned_extlen - Look for free blocks which are not byte aligned | |
279 | * @rbm: Position to search (value/result) | |
280 | * @n_unaligned: Number of unaligned blocks to check | |
281 | * @len: Decremented for each block found (terminate on zero) | |
282 | * | |
283 | * Returns: true if a non-free block is encountered | |
284 | */ | |
285 | ||
286 | static bool gfs2_unaligned_extlen(struct gfs2_rbm *rbm, u32 n_unaligned, u32 *len) | |
287 | { | |
288 | u64 block; | |
289 | u32 n; | |
290 | u8 res; | |
291 | ||
292 | for (n = 0; n < n_unaligned; n++) { | |
293 | res = gfs2_testbit(rbm); | |
294 | if (res != GFS2_BLKST_FREE) | |
295 | return true; | |
296 | (*len)--; | |
297 | if (*len == 0) | |
298 | return true; | |
299 | block = gfs2_rbm_to_block(rbm); | |
300 | if (gfs2_rbm_from_block(rbm, block + 1)) | |
301 | return true; | |
302 | } | |
303 | ||
304 | return false; | |
305 | } | |
306 | ||
307 | /** | |
308 | * gfs2_free_extlen - Return extent length of free blocks | |
309 | * @rbm: Starting position | |
310 | * @len: Max length to check | |
311 | * | |
312 | * Starting at the block specified by the rbm, see how many free blocks | |
313 | * there are, not reading more than len blocks ahead. This can be done | |
314 | * using memchr_inv when the blocks are byte aligned, but has to be done | |
315 | * on a block by block basis in case of unaligned blocks. Also this | |
316 | * function can cope with bitmap boundaries (although it must stop on | |
317 | * a resource group boundary) | |
318 | * | |
319 | * Returns: Number of free blocks in the extent | |
320 | */ | |
321 | ||
322 | static u32 gfs2_free_extlen(const struct gfs2_rbm *rrbm, u32 len) | |
323 | { | |
324 | struct gfs2_rbm rbm = *rrbm; | |
325 | u32 n_unaligned = rbm.offset & 3; | |
326 | u32 size = len; | |
327 | u32 bytes; | |
328 | u32 chunk_size; | |
329 | u8 *ptr, *start, *end; | |
330 | u64 block; | |
331 | ||
332 | if (n_unaligned && | |
333 | gfs2_unaligned_extlen(&rbm, 4 - n_unaligned, &len)) | |
334 | goto out; | |
335 | ||
3701530a | 336 | n_unaligned = len & 3; |
ff7f4cb4 SW |
337 | /* Start is now byte aligned */ |
338 | while (len > 3) { | |
339 | start = rbm.bi->bi_bh->b_data; | |
340 | if (rbm.bi->bi_clone) | |
341 | start = rbm.bi->bi_clone; | |
342 | end = start + rbm.bi->bi_bh->b_size; | |
343 | start += rbm.bi->bi_offset; | |
344 | BUG_ON(rbm.offset & 3); | |
345 | start += (rbm.offset / GFS2_NBBY); | |
346 | bytes = min_t(u32, len / GFS2_NBBY, (end - start)); | |
347 | ptr = memchr_inv(start, 0, bytes); | |
348 | chunk_size = ((ptr == NULL) ? bytes : (ptr - start)); | |
349 | chunk_size *= GFS2_NBBY; | |
350 | BUG_ON(len < chunk_size); | |
351 | len -= chunk_size; | |
352 | block = gfs2_rbm_to_block(&rbm); | |
15bd50ad BP |
353 | if (gfs2_rbm_from_block(&rbm, block + chunk_size)) { |
354 | n_unaligned = 0; | |
ff7f4cb4 | 355 | break; |
15bd50ad BP |
356 | } |
357 | if (ptr) { | |
358 | n_unaligned = 3; | |
359 | break; | |
360 | } | |
ff7f4cb4 SW |
361 | n_unaligned = len & 3; |
362 | } | |
363 | ||
364 | /* Deal with any bits left over at the end */ | |
365 | if (n_unaligned) | |
366 | gfs2_unaligned_extlen(&rbm, n_unaligned, &len); | |
367 | out: | |
368 | return size - len; | |
369 | } | |
370 | ||
88c8ab1f SW |
371 | /** |
372 | * gfs2_bitcount - count the number of bits in a certain state | |
886b1416 | 373 | * @rgd: the resource group descriptor |
88c8ab1f SW |
374 | * @buffer: the buffer that holds the bitmaps |
375 | * @buflen: the length (in bytes) of the buffer | |
376 | * @state: the state of the block we're looking for | |
377 | * | |
378 | * Returns: The number of bits | |
379 | */ | |
380 | ||
110acf38 SW |
381 | static u32 gfs2_bitcount(struct gfs2_rgrpd *rgd, const u8 *buffer, |
382 | unsigned int buflen, u8 state) | |
88c8ab1f | 383 | { |
110acf38 SW |
384 | const u8 *byte = buffer; |
385 | const u8 *end = buffer + buflen; | |
386 | const u8 state1 = state << 2; | |
387 | const u8 state2 = state << 4; | |
388 | const u8 state3 = state << 6; | |
cd915493 | 389 | u32 count = 0; |
88c8ab1f SW |
390 | |
391 | for (; byte < end; byte++) { | |
392 | if (((*byte) & 0x03) == state) | |
393 | count++; | |
394 | if (((*byte) & 0x0C) == state1) | |
395 | count++; | |
396 | if (((*byte) & 0x30) == state2) | |
397 | count++; | |
398 | if (((*byte) & 0xC0) == state3) | |
399 | count++; | |
400 | } | |
401 | ||
402 | return count; | |
403 | } | |
404 | ||
b3b94faa DT |
405 | /** |
406 | * gfs2_rgrp_verify - Verify that a resource group is consistent | |
b3b94faa DT |
407 | * @rgd: the rgrp |
408 | * | |
409 | */ | |
410 | ||
411 | void gfs2_rgrp_verify(struct gfs2_rgrpd *rgd) | |
412 | { | |
413 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
414 | struct gfs2_bitmap *bi = NULL; | |
bb8d8a6f | 415 | u32 length = rgd->rd_length; |
cd915493 | 416 | u32 count[4], tmp; |
b3b94faa DT |
417 | int buf, x; |
418 | ||
cd915493 | 419 | memset(count, 0, 4 * sizeof(u32)); |
b3b94faa DT |
420 | |
421 | /* Count # blocks in each of 4 possible allocation states */ | |
422 | for (buf = 0; buf < length; buf++) { | |
423 | bi = rgd->rd_bits + buf; | |
424 | for (x = 0; x < 4; x++) | |
425 | count[x] += gfs2_bitcount(rgd, | |
426 | bi->bi_bh->b_data + | |
427 | bi->bi_offset, | |
428 | bi->bi_len, x); | |
429 | } | |
430 | ||
cfc8b549 | 431 | if (count[0] != rgd->rd_free) { |
b3b94faa DT |
432 | if (gfs2_consist_rgrpd(rgd)) |
433 | fs_err(sdp, "free data mismatch: %u != %u\n", | |
cfc8b549 | 434 | count[0], rgd->rd_free); |
b3b94faa DT |
435 | return; |
436 | } | |
437 | ||
73f74948 | 438 | tmp = rgd->rd_data - rgd->rd_free - rgd->rd_dinodes; |
6b946170 | 439 | if (count[1] != tmp) { |
b3b94faa DT |
440 | if (gfs2_consist_rgrpd(rgd)) |
441 | fs_err(sdp, "used data mismatch: %u != %u\n", | |
442 | count[1], tmp); | |
443 | return; | |
444 | } | |
445 | ||
6b946170 | 446 | if (count[2] + count[3] != rgd->rd_dinodes) { |
b3b94faa | 447 | if (gfs2_consist_rgrpd(rgd)) |
feaa7bba | 448 | fs_err(sdp, "used metadata mismatch: %u != %u\n", |
6b946170 | 449 | count[2] + count[3], rgd->rd_dinodes); |
b3b94faa DT |
450 | return; |
451 | } | |
b3b94faa DT |
452 | } |
453 | ||
bb8d8a6f | 454 | static inline int rgrp_contains_block(struct gfs2_rgrpd *rgd, u64 block) |
b3b94faa | 455 | { |
bb8d8a6f SW |
456 | u64 first = rgd->rd_data0; |
457 | u64 last = first + rgd->rd_data; | |
16910427 | 458 | return first <= block && block < last; |
b3b94faa DT |
459 | } |
460 | ||
461 | /** | |
462 | * gfs2_blk2rgrpd - Find resource group for a given data/meta block number | |
463 | * @sdp: The GFS2 superblock | |
886b1416 BP |
464 | * @blk: The data block number |
465 | * @exact: True if this needs to be an exact match | |
b3b94faa DT |
466 | * |
467 | * Returns: The resource group, or NULL if not found | |
468 | */ | |
469 | ||
66fc061b | 470 | struct gfs2_rgrpd *gfs2_blk2rgrpd(struct gfs2_sbd *sdp, u64 blk, bool exact) |
b3b94faa | 471 | { |
66fc061b | 472 | struct rb_node *n, *next; |
f75bbfb4 | 473 | struct gfs2_rgrpd *cur; |
b3b94faa DT |
474 | |
475 | spin_lock(&sdp->sd_rindex_spin); | |
66fc061b SW |
476 | n = sdp->sd_rindex_tree.rb_node; |
477 | while (n) { | |
478 | cur = rb_entry(n, struct gfs2_rgrpd, rd_node); | |
479 | next = NULL; | |
7c9ca621 | 480 | if (blk < cur->rd_addr) |
66fc061b | 481 | next = n->rb_left; |
f75bbfb4 | 482 | else if (blk >= cur->rd_data0 + cur->rd_data) |
66fc061b SW |
483 | next = n->rb_right; |
484 | if (next == NULL) { | |
b3b94faa | 485 | spin_unlock(&sdp->sd_rindex_spin); |
66fc061b SW |
486 | if (exact) { |
487 | if (blk < cur->rd_addr) | |
488 | return NULL; | |
489 | if (blk >= cur->rd_data0 + cur->rd_data) | |
490 | return NULL; | |
491 | } | |
7c9ca621 | 492 | return cur; |
b3b94faa | 493 | } |
66fc061b | 494 | n = next; |
b3b94faa | 495 | } |
b3b94faa DT |
496 | spin_unlock(&sdp->sd_rindex_spin); |
497 | ||
498 | return NULL; | |
499 | } | |
500 | ||
501 | /** | |
502 | * gfs2_rgrpd_get_first - get the first Resource Group in the filesystem | |
503 | * @sdp: The GFS2 superblock | |
504 | * | |
505 | * Returns: The first rgrp in the filesystem | |
506 | */ | |
507 | ||
508 | struct gfs2_rgrpd *gfs2_rgrpd_get_first(struct gfs2_sbd *sdp) | |
509 | { | |
7c9ca621 BP |
510 | const struct rb_node *n; |
511 | struct gfs2_rgrpd *rgd; | |
512 | ||
8339ee54 | 513 | spin_lock(&sdp->sd_rindex_spin); |
7c9ca621 BP |
514 | n = rb_first(&sdp->sd_rindex_tree); |
515 | rgd = rb_entry(n, struct gfs2_rgrpd, rd_node); | |
8339ee54 | 516 | spin_unlock(&sdp->sd_rindex_spin); |
7c9ca621 BP |
517 | |
518 | return rgd; | |
b3b94faa DT |
519 | } |
520 | ||
521 | /** | |
522 | * gfs2_rgrpd_get_next - get the next RG | |
886b1416 | 523 | * @rgd: the resource group descriptor |
b3b94faa DT |
524 | * |
525 | * Returns: The next rgrp | |
526 | */ | |
527 | ||
528 | struct gfs2_rgrpd *gfs2_rgrpd_get_next(struct gfs2_rgrpd *rgd) | |
529 | { | |
7c9ca621 BP |
530 | struct gfs2_sbd *sdp = rgd->rd_sbd; |
531 | const struct rb_node *n; | |
532 | ||
533 | spin_lock(&sdp->sd_rindex_spin); | |
534 | n = rb_next(&rgd->rd_node); | |
535 | if (n == NULL) | |
536 | n = rb_first(&sdp->sd_rindex_tree); | |
537 | ||
538 | if (unlikely(&rgd->rd_node == n)) { | |
539 | spin_unlock(&sdp->sd_rindex_spin); | |
b3b94faa | 540 | return NULL; |
7c9ca621 BP |
541 | } |
542 | rgd = rb_entry(n, struct gfs2_rgrpd, rd_node); | |
543 | spin_unlock(&sdp->sd_rindex_spin); | |
544 | return rgd; | |
b3b94faa DT |
545 | } |
546 | ||
8339ee54 SW |
547 | void gfs2_free_clones(struct gfs2_rgrpd *rgd) |
548 | { | |
549 | int x; | |
550 | ||
551 | for (x = 0; x < rgd->rd_length; x++) { | |
552 | struct gfs2_bitmap *bi = rgd->rd_bits + x; | |
553 | kfree(bi->bi_clone); | |
554 | bi->bi_clone = NULL; | |
555 | } | |
556 | } | |
557 | ||
0a305e49 BP |
558 | /** |
559 | * gfs2_rs_alloc - make sure we have a reservation assigned to the inode | |
560 | * @ip: the inode for this reservation | |
561 | */ | |
562 | int gfs2_rs_alloc(struct gfs2_inode *ip) | |
563 | { | |
f1213cac | 564 | int error = 0; |
8e2e0047 | 565 | |
f1213cac | 566 | down_write(&ip->i_rw_mutex); |
8e2e0047 | 567 | if (ip->i_res) |
f1213cac | 568 | goto out; |
0a305e49 | 569 | |
f1213cac AD |
570 | ip->i_res = kmem_cache_zalloc(gfs2_rsrv_cachep, GFP_NOFS); |
571 | if (!ip->i_res) { | |
572 | error = -ENOMEM; | |
573 | goto out; | |
574 | } | |
4a993fb1 | 575 | |
f1213cac AD |
576 | RB_CLEAR_NODE(&ip->i_res->rs_node); |
577 | out: | |
0a305e49 | 578 | up_write(&ip->i_rw_mutex); |
441362d0 | 579 | return error; |
0a305e49 BP |
580 | } |
581 | ||
9e733d39 | 582 | static void dump_rs(struct seq_file *seq, const struct gfs2_blkreserv *rs) |
8e2e0047 | 583 | { |
9e733d39 SW |
584 | gfs2_print_dbg(seq, " B: n:%llu s:%llu b:%u f:%u\n", |
585 | (unsigned long long)rs->rs_inum, | |
586 | (unsigned long long)gfs2_rbm_to_block(&rs->rs_rbm), | |
4a993fb1 | 587 | rs->rs_rbm.offset, rs->rs_free); |
8e2e0047 BP |
588 | } |
589 | ||
0a305e49 | 590 | /** |
8e2e0047 BP |
591 | * __rs_deltree - remove a multi-block reservation from the rgd tree |
592 | * @rs: The reservation to remove | |
593 | * | |
594 | */ | |
20095218 | 595 | static void __rs_deltree(struct gfs2_blkreserv *rs) |
8e2e0047 BP |
596 | { |
597 | struct gfs2_rgrpd *rgd; | |
598 | ||
599 | if (!gfs2_rs_active(rs)) | |
600 | return; | |
601 | ||
4a993fb1 | 602 | rgd = rs->rs_rbm.rgd; |
9e733d39 | 603 | trace_gfs2_rs(rs, TRACE_RS_TREEDEL); |
4a993fb1 | 604 | rb_erase(&rs->rs_node, &rgd->rd_rstree); |
24d634e8 | 605 | RB_CLEAR_NODE(&rs->rs_node); |
8e2e0047 BP |
606 | |
607 | if (rs->rs_free) { | |
20095218 | 608 | /* return reserved blocks to the rgrp */ |
4a993fb1 SW |
609 | BUG_ON(rs->rs_rbm.rgd->rd_reserved < rs->rs_free); |
610 | rs->rs_rbm.rgd->rd_reserved -= rs->rs_free; | |
8e2e0047 | 611 | rs->rs_free = 0; |
4a993fb1 | 612 | clear_bit(GBF_FULL, &rs->rs_rbm.bi->bi_flags); |
8e2e0047 BP |
613 | smp_mb__after_clear_bit(); |
614 | } | |
8e2e0047 BP |
615 | } |
616 | ||
617 | /** | |
618 | * gfs2_rs_deltree - remove a multi-block reservation from the rgd tree | |
619 | * @rs: The reservation to remove | |
620 | * | |
621 | */ | |
20095218 | 622 | void gfs2_rs_deltree(struct gfs2_blkreserv *rs) |
8e2e0047 BP |
623 | { |
624 | struct gfs2_rgrpd *rgd; | |
625 | ||
4a993fb1 SW |
626 | rgd = rs->rs_rbm.rgd; |
627 | if (rgd) { | |
628 | spin_lock(&rgd->rd_rsspin); | |
20095218 | 629 | __rs_deltree(rs); |
4a993fb1 SW |
630 | spin_unlock(&rgd->rd_rsspin); |
631 | } | |
8e2e0047 BP |
632 | } |
633 | ||
634 | /** | |
635 | * gfs2_rs_delete - delete a multi-block reservation | |
0a305e49 BP |
636 | * @ip: The inode for this reservation |
637 | * | |
638 | */ | |
639 | void gfs2_rs_delete(struct gfs2_inode *ip) | |
640 | { | |
2b3dcf35 BP |
641 | struct inode *inode = &ip->i_inode; |
642 | ||
0a305e49 | 643 | down_write(&ip->i_rw_mutex); |
2b3dcf35 | 644 | if (ip->i_res && atomic_read(&inode->i_writecount) <= 1) { |
20095218 | 645 | gfs2_rs_deltree(ip->i_res); |
8e2e0047 | 646 | BUG_ON(ip->i_res->rs_free); |
0a305e49 BP |
647 | kmem_cache_free(gfs2_rsrv_cachep, ip->i_res); |
648 | ip->i_res = NULL; | |
649 | } | |
650 | up_write(&ip->i_rw_mutex); | |
651 | } | |
652 | ||
8e2e0047 BP |
653 | /** |
654 | * return_all_reservations - return all reserved blocks back to the rgrp. | |
655 | * @rgd: the rgrp that needs its space back | |
656 | * | |
657 | * We previously reserved a bunch of blocks for allocation. Now we need to | |
658 | * give them back. This leave the reservation structures in tact, but removes | |
659 | * all of their corresponding "no-fly zones". | |
660 | */ | |
661 | static void return_all_reservations(struct gfs2_rgrpd *rgd) | |
662 | { | |
663 | struct rb_node *n; | |
664 | struct gfs2_blkreserv *rs; | |
665 | ||
666 | spin_lock(&rgd->rd_rsspin); | |
667 | while ((n = rb_first(&rgd->rd_rstree))) { | |
668 | rs = rb_entry(n, struct gfs2_blkreserv, rs_node); | |
20095218 | 669 | __rs_deltree(rs); |
8e2e0047 BP |
670 | } |
671 | spin_unlock(&rgd->rd_rsspin); | |
672 | } | |
673 | ||
8339ee54 | 674 | void gfs2_clear_rgrpd(struct gfs2_sbd *sdp) |
b3b94faa | 675 | { |
7c9ca621 | 676 | struct rb_node *n; |
b3b94faa DT |
677 | struct gfs2_rgrpd *rgd; |
678 | struct gfs2_glock *gl; | |
679 | ||
7c9ca621 BP |
680 | while ((n = rb_first(&sdp->sd_rindex_tree))) { |
681 | rgd = rb_entry(n, struct gfs2_rgrpd, rd_node); | |
b3b94faa DT |
682 | gl = rgd->rd_gl; |
683 | ||
7c9ca621 | 684 | rb_erase(n, &sdp->sd_rindex_tree); |
b3b94faa DT |
685 | |
686 | if (gl) { | |
8339ee54 | 687 | spin_lock(&gl->gl_spin); |
5c676f6d | 688 | gl->gl_object = NULL; |
8339ee54 | 689 | spin_unlock(&gl->gl_spin); |
29687a2a | 690 | gfs2_glock_add_to_lru(gl); |
b3b94faa DT |
691 | gfs2_glock_put(gl); |
692 | } | |
693 | ||
8339ee54 | 694 | gfs2_free_clones(rgd); |
b3b94faa | 695 | kfree(rgd->rd_bits); |
8e2e0047 | 696 | return_all_reservations(rgd); |
6bdd9be6 | 697 | kmem_cache_free(gfs2_rgrpd_cachep, rgd); |
b3b94faa DT |
698 | } |
699 | } | |
700 | ||
bb8d8a6f SW |
701 | static void gfs2_rindex_print(const struct gfs2_rgrpd *rgd) |
702 | { | |
703 | printk(KERN_INFO " ri_addr = %llu\n", (unsigned long long)rgd->rd_addr); | |
704 | printk(KERN_INFO " ri_length = %u\n", rgd->rd_length); | |
705 | printk(KERN_INFO " ri_data0 = %llu\n", (unsigned long long)rgd->rd_data0); | |
706 | printk(KERN_INFO " ri_data = %u\n", rgd->rd_data); | |
707 | printk(KERN_INFO " ri_bitbytes = %u\n", rgd->rd_bitbytes); | |
708 | } | |
709 | ||
b3b94faa DT |
710 | /** |
711 | * gfs2_compute_bitstructs - Compute the bitmap sizes | |
712 | * @rgd: The resource group descriptor | |
713 | * | |
714 | * Calculates bitmap descriptors, one for each block that contains bitmap data | |
715 | * | |
716 | * Returns: errno | |
717 | */ | |
718 | ||
719 | static int compute_bitstructs(struct gfs2_rgrpd *rgd) | |
720 | { | |
721 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
722 | struct gfs2_bitmap *bi; | |
bb8d8a6f | 723 | u32 length = rgd->rd_length; /* # blocks in hdr & bitmap */ |
cd915493 | 724 | u32 bytes_left, bytes; |
b3b94faa DT |
725 | int x; |
726 | ||
feaa7bba SW |
727 | if (!length) |
728 | return -EINVAL; | |
729 | ||
dd894be8 | 730 | rgd->rd_bits = kcalloc(length, sizeof(struct gfs2_bitmap), GFP_NOFS); |
b3b94faa DT |
731 | if (!rgd->rd_bits) |
732 | return -ENOMEM; | |
733 | ||
bb8d8a6f | 734 | bytes_left = rgd->rd_bitbytes; |
b3b94faa DT |
735 | |
736 | for (x = 0; x < length; x++) { | |
737 | bi = rgd->rd_bits + x; | |
738 | ||
60a0b8f9 | 739 | bi->bi_flags = 0; |
b3b94faa DT |
740 | /* small rgrp; bitmap stored completely in header block */ |
741 | if (length == 1) { | |
742 | bytes = bytes_left; | |
743 | bi->bi_offset = sizeof(struct gfs2_rgrp); | |
744 | bi->bi_start = 0; | |
745 | bi->bi_len = bytes; | |
7e230f57 | 746 | bi->bi_blocks = bytes * GFS2_NBBY; |
b3b94faa DT |
747 | /* header block */ |
748 | } else if (x == 0) { | |
749 | bytes = sdp->sd_sb.sb_bsize - sizeof(struct gfs2_rgrp); | |
750 | bi->bi_offset = sizeof(struct gfs2_rgrp); | |
751 | bi->bi_start = 0; | |
752 | bi->bi_len = bytes; | |
7e230f57 | 753 | bi->bi_blocks = bytes * GFS2_NBBY; |
b3b94faa DT |
754 | /* last block */ |
755 | } else if (x + 1 == length) { | |
756 | bytes = bytes_left; | |
757 | bi->bi_offset = sizeof(struct gfs2_meta_header); | |
bb8d8a6f | 758 | bi->bi_start = rgd->rd_bitbytes - bytes_left; |
b3b94faa | 759 | bi->bi_len = bytes; |
7e230f57 | 760 | bi->bi_blocks = bytes * GFS2_NBBY; |
b3b94faa DT |
761 | /* other blocks */ |
762 | } else { | |
568f4c96 SW |
763 | bytes = sdp->sd_sb.sb_bsize - |
764 | sizeof(struct gfs2_meta_header); | |
b3b94faa | 765 | bi->bi_offset = sizeof(struct gfs2_meta_header); |
bb8d8a6f | 766 | bi->bi_start = rgd->rd_bitbytes - bytes_left; |
b3b94faa | 767 | bi->bi_len = bytes; |
7e230f57 | 768 | bi->bi_blocks = bytes * GFS2_NBBY; |
b3b94faa DT |
769 | } |
770 | ||
771 | bytes_left -= bytes; | |
772 | } | |
773 | ||
774 | if (bytes_left) { | |
775 | gfs2_consist_rgrpd(rgd); | |
776 | return -EIO; | |
777 | } | |
778 | bi = rgd->rd_bits + (length - 1); | |
bb8d8a6f | 779 | if ((bi->bi_start + bi->bi_len) * GFS2_NBBY != rgd->rd_data) { |
b3b94faa | 780 | if (gfs2_consist_rgrpd(rgd)) { |
bb8d8a6f | 781 | gfs2_rindex_print(rgd); |
b3b94faa DT |
782 | fs_err(sdp, "start=%u len=%u offset=%u\n", |
783 | bi->bi_start, bi->bi_len, bi->bi_offset); | |
784 | } | |
785 | return -EIO; | |
786 | } | |
787 | ||
788 | return 0; | |
789 | } | |
790 | ||
7ae8fa84 RP |
791 | /** |
792 | * gfs2_ri_total - Total up the file system space, according to the rindex. | |
886b1416 | 793 | * @sdp: the filesystem |
7ae8fa84 RP |
794 | * |
795 | */ | |
796 | u64 gfs2_ri_total(struct gfs2_sbd *sdp) | |
797 | { | |
798 | u64 total_data = 0; | |
799 | struct inode *inode = sdp->sd_rindex; | |
800 | struct gfs2_inode *ip = GFS2_I(inode); | |
7ae8fa84 | 801 | char buf[sizeof(struct gfs2_rindex)]; |
7ae8fa84 RP |
802 | int error, rgrps; |
803 | ||
7ae8fa84 RP |
804 | for (rgrps = 0;; rgrps++) { |
805 | loff_t pos = rgrps * sizeof(struct gfs2_rindex); | |
806 | ||
bcd7278d | 807 | if (pos + sizeof(struct gfs2_rindex) > i_size_read(inode)) |
7ae8fa84 | 808 | break; |
4306629e | 809 | error = gfs2_internal_read(ip, buf, &pos, |
7ae8fa84 RP |
810 | sizeof(struct gfs2_rindex)); |
811 | if (error != sizeof(struct gfs2_rindex)) | |
812 | break; | |
bb8d8a6f | 813 | total_data += be32_to_cpu(((struct gfs2_rindex *)buf)->ri_data); |
7ae8fa84 | 814 | } |
7ae8fa84 RP |
815 | return total_data; |
816 | } | |
817 | ||
6aad1c3d | 818 | static int rgd_insert(struct gfs2_rgrpd *rgd) |
7c9ca621 BP |
819 | { |
820 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
821 | struct rb_node **newn = &sdp->sd_rindex_tree.rb_node, *parent = NULL; | |
822 | ||
823 | /* Figure out where to put new node */ | |
824 | while (*newn) { | |
825 | struct gfs2_rgrpd *cur = rb_entry(*newn, struct gfs2_rgrpd, | |
826 | rd_node); | |
827 | ||
828 | parent = *newn; | |
829 | if (rgd->rd_addr < cur->rd_addr) | |
830 | newn = &((*newn)->rb_left); | |
831 | else if (rgd->rd_addr > cur->rd_addr) | |
832 | newn = &((*newn)->rb_right); | |
833 | else | |
6aad1c3d | 834 | return -EEXIST; |
7c9ca621 BP |
835 | } |
836 | ||
837 | rb_link_node(&rgd->rd_node, parent, newn); | |
838 | rb_insert_color(&rgd->rd_node, &sdp->sd_rindex_tree); | |
6aad1c3d BP |
839 | sdp->sd_rgrps++; |
840 | return 0; | |
7c9ca621 BP |
841 | } |
842 | ||
b3b94faa | 843 | /** |
6c53267f | 844 | * read_rindex_entry - Pull in a new resource index entry from the disk |
4306629e | 845 | * @ip: Pointer to the rindex inode |
b3b94faa | 846 | * |
8339ee54 | 847 | * Returns: 0 on success, > 0 on EOF, error code otherwise |
6c53267f RP |
848 | */ |
849 | ||
4306629e | 850 | static int read_rindex_entry(struct gfs2_inode *ip) |
6c53267f RP |
851 | { |
852 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); | |
853 | loff_t pos = sdp->sd_rgrps * sizeof(struct gfs2_rindex); | |
8339ee54 | 854 | struct gfs2_rindex buf; |
6c53267f RP |
855 | int error; |
856 | struct gfs2_rgrpd *rgd; | |
857 | ||
8339ee54 SW |
858 | if (pos >= i_size_read(&ip->i_inode)) |
859 | return 1; | |
860 | ||
4306629e | 861 | error = gfs2_internal_read(ip, (char *)&buf, &pos, |
6c53267f | 862 | sizeof(struct gfs2_rindex)); |
8339ee54 SW |
863 | |
864 | if (error != sizeof(struct gfs2_rindex)) | |
865 | return (error == 0) ? 1 : error; | |
6c53267f | 866 | |
6bdd9be6 | 867 | rgd = kmem_cache_zalloc(gfs2_rgrpd_cachep, GFP_NOFS); |
6c53267f RP |
868 | error = -ENOMEM; |
869 | if (!rgd) | |
870 | return error; | |
871 | ||
6c53267f | 872 | rgd->rd_sbd = sdp; |
8339ee54 SW |
873 | rgd->rd_addr = be64_to_cpu(buf.ri_addr); |
874 | rgd->rd_length = be32_to_cpu(buf.ri_length); | |
875 | rgd->rd_data0 = be64_to_cpu(buf.ri_data0); | |
876 | rgd->rd_data = be32_to_cpu(buf.ri_data); | |
877 | rgd->rd_bitbytes = be32_to_cpu(buf.ri_bitbytes); | |
8e2e0047 | 878 | spin_lock_init(&rgd->rd_rsspin); |
7c9ca621 | 879 | |
6c53267f RP |
880 | error = compute_bitstructs(rgd); |
881 | if (error) | |
8339ee54 | 882 | goto fail; |
6c53267f | 883 | |
bb8d8a6f | 884 | error = gfs2_glock_get(sdp, rgd->rd_addr, |
6c53267f RP |
885 | &gfs2_rgrp_glops, CREATE, &rgd->rd_gl); |
886 | if (error) | |
8339ee54 | 887 | goto fail; |
6c53267f RP |
888 | |
889 | rgd->rd_gl->gl_object = rgd; | |
4e2f8849 | 890 | rgd->rd_rgl = (struct gfs2_rgrp_lvb *)rgd->rd_gl->gl_lksb.sb_lvbptr; |
cf45b752 | 891 | rgd->rd_flags &= ~GFS2_RDF_UPTODATE; |
7c9ca621 BP |
892 | if (rgd->rd_data > sdp->sd_max_rg_data) |
893 | sdp->sd_max_rg_data = rgd->rd_data; | |
8339ee54 | 894 | spin_lock(&sdp->sd_rindex_spin); |
6aad1c3d | 895 | error = rgd_insert(rgd); |
8339ee54 | 896 | spin_unlock(&sdp->sd_rindex_spin); |
6aad1c3d BP |
897 | if (!error) |
898 | return 0; | |
899 | ||
900 | error = 0; /* someone else read in the rgrp; free it and ignore it */ | |
c1ac539e | 901 | gfs2_glock_put(rgd->rd_gl); |
8339ee54 SW |
902 | |
903 | fail: | |
904 | kfree(rgd->rd_bits); | |
905 | kmem_cache_free(gfs2_rgrpd_cachep, rgd); | |
6c53267f RP |
906 | return error; |
907 | } | |
908 | ||
909 | /** | |
910 | * gfs2_ri_update - Pull in a new resource index from the disk | |
911 | * @ip: pointer to the rindex inode | |
912 | * | |
b3b94faa DT |
913 | * Returns: 0 on successful update, error code otherwise |
914 | */ | |
915 | ||
8339ee54 | 916 | static int gfs2_ri_update(struct gfs2_inode *ip) |
b3b94faa | 917 | { |
feaa7bba | 918 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
b3b94faa DT |
919 | int error; |
920 | ||
8339ee54 | 921 | do { |
4306629e | 922 | error = read_rindex_entry(ip); |
8339ee54 SW |
923 | } while (error == 0); |
924 | ||
925 | if (error < 0) | |
926 | return error; | |
b3b94faa | 927 | |
cf45b752 | 928 | sdp->sd_rindex_uptodate = 1; |
6c53267f RP |
929 | return 0; |
930 | } | |
b3b94faa | 931 | |
b3b94faa | 932 | /** |
8339ee54 | 933 | * gfs2_rindex_update - Update the rindex if required |
b3b94faa | 934 | * @sdp: The GFS2 superblock |
b3b94faa DT |
935 | * |
936 | * We grab a lock on the rindex inode to make sure that it doesn't | |
937 | * change whilst we are performing an operation. We keep this lock | |
938 | * for quite long periods of time compared to other locks. This | |
939 | * doesn't matter, since it is shared and it is very, very rarely | |
940 | * accessed in the exclusive mode (i.e. only when expanding the filesystem). | |
941 | * | |
942 | * This makes sure that we're using the latest copy of the resource index | |
943 | * special file, which might have been updated if someone expanded the | |
944 | * filesystem (via gfs2_grow utility), which adds new resource groups. | |
945 | * | |
8339ee54 | 946 | * Returns: 0 on succeess, error code otherwise |
b3b94faa DT |
947 | */ |
948 | ||
8339ee54 | 949 | int gfs2_rindex_update(struct gfs2_sbd *sdp) |
b3b94faa | 950 | { |
feaa7bba | 951 | struct gfs2_inode *ip = GFS2_I(sdp->sd_rindex); |
b3b94faa | 952 | struct gfs2_glock *gl = ip->i_gl; |
8339ee54 SW |
953 | struct gfs2_holder ri_gh; |
954 | int error = 0; | |
a365fbf3 | 955 | int unlock_required = 0; |
b3b94faa DT |
956 | |
957 | /* Read new copy from disk if we don't have the latest */ | |
cf45b752 | 958 | if (!sdp->sd_rindex_uptodate) { |
a365fbf3 SW |
959 | if (!gfs2_glock_is_locked_by_me(gl)) { |
960 | error = gfs2_glock_nq_init(gl, LM_ST_SHARED, 0, &ri_gh); | |
961 | if (error) | |
6aad1c3d | 962 | return error; |
a365fbf3 SW |
963 | unlock_required = 1; |
964 | } | |
8339ee54 | 965 | if (!sdp->sd_rindex_uptodate) |
b3b94faa | 966 | error = gfs2_ri_update(ip); |
a365fbf3 SW |
967 | if (unlock_required) |
968 | gfs2_glock_dq_uninit(&ri_gh); | |
b3b94faa DT |
969 | } |
970 | ||
971 | return error; | |
972 | } | |
973 | ||
42d52e38 | 974 | static void gfs2_rgrp_in(struct gfs2_rgrpd *rgd, const void *buf) |
bb8d8a6f SW |
975 | { |
976 | const struct gfs2_rgrp *str = buf; | |
42d52e38 | 977 | u32 rg_flags; |
bb8d8a6f | 978 | |
42d52e38 | 979 | rg_flags = be32_to_cpu(str->rg_flags); |
09010978 | 980 | rg_flags &= ~GFS2_RDF_MASK; |
1ce97e56 SW |
981 | rgd->rd_flags &= GFS2_RDF_MASK; |
982 | rgd->rd_flags |= rg_flags; | |
cfc8b549 | 983 | rgd->rd_free = be32_to_cpu(str->rg_free); |
73f74948 | 984 | rgd->rd_dinodes = be32_to_cpu(str->rg_dinodes); |
d8b71f73 | 985 | rgd->rd_igeneration = be64_to_cpu(str->rg_igeneration); |
bb8d8a6f SW |
986 | } |
987 | ||
42d52e38 | 988 | static void gfs2_rgrp_out(struct gfs2_rgrpd *rgd, void *buf) |
bb8d8a6f SW |
989 | { |
990 | struct gfs2_rgrp *str = buf; | |
991 | ||
09010978 | 992 | str->rg_flags = cpu_to_be32(rgd->rd_flags & ~GFS2_RDF_MASK); |
cfc8b549 | 993 | str->rg_free = cpu_to_be32(rgd->rd_free); |
73f74948 | 994 | str->rg_dinodes = cpu_to_be32(rgd->rd_dinodes); |
bb8d8a6f | 995 | str->__pad = cpu_to_be32(0); |
d8b71f73 | 996 | str->rg_igeneration = cpu_to_be64(rgd->rd_igeneration); |
bb8d8a6f SW |
997 | memset(&str->rg_reserved, 0, sizeof(str->rg_reserved)); |
998 | } | |
999 | ||
90306c41 BM |
1000 | static int gfs2_rgrp_lvb_valid(struct gfs2_rgrpd *rgd) |
1001 | { | |
1002 | struct gfs2_rgrp_lvb *rgl = rgd->rd_rgl; | |
1003 | struct gfs2_rgrp *str = (struct gfs2_rgrp *)rgd->rd_bits[0].bi_bh->b_data; | |
1004 | ||
1005 | if (rgl->rl_flags != str->rg_flags || rgl->rl_free != str->rg_free || | |
1006 | rgl->rl_dinodes != str->rg_dinodes || | |
1007 | rgl->rl_igeneration != str->rg_igeneration) | |
1008 | return 0; | |
1009 | return 1; | |
1010 | } | |
1011 | ||
1012 | static void gfs2_rgrp_ondisk2lvb(struct gfs2_rgrp_lvb *rgl, const void *buf) | |
1013 | { | |
1014 | const struct gfs2_rgrp *str = buf; | |
1015 | ||
1016 | rgl->rl_magic = cpu_to_be32(GFS2_MAGIC); | |
1017 | rgl->rl_flags = str->rg_flags; | |
1018 | rgl->rl_free = str->rg_free; | |
1019 | rgl->rl_dinodes = str->rg_dinodes; | |
1020 | rgl->rl_igeneration = str->rg_igeneration; | |
1021 | rgl->__pad = 0UL; | |
1022 | } | |
1023 | ||
1024 | static void update_rgrp_lvb_unlinked(struct gfs2_rgrpd *rgd, u32 change) | |
1025 | { | |
1026 | struct gfs2_rgrp_lvb *rgl = rgd->rd_rgl; | |
1027 | u32 unlinked = be32_to_cpu(rgl->rl_unlinked) + change; | |
1028 | rgl->rl_unlinked = cpu_to_be32(unlinked); | |
1029 | } | |
1030 | ||
1031 | static u32 count_unlinked(struct gfs2_rgrpd *rgd) | |
1032 | { | |
1033 | struct gfs2_bitmap *bi; | |
1034 | const u32 length = rgd->rd_length; | |
1035 | const u8 *buffer = NULL; | |
1036 | u32 i, goal, count = 0; | |
1037 | ||
1038 | for (i = 0, bi = rgd->rd_bits; i < length; i++, bi++) { | |
1039 | goal = 0; | |
1040 | buffer = bi->bi_bh->b_data + bi->bi_offset; | |
1041 | WARN_ON(!buffer_uptodate(bi->bi_bh)); | |
1042 | while (goal < bi->bi_len * GFS2_NBBY) { | |
1043 | goal = gfs2_bitfit(buffer, bi->bi_len, goal, | |
1044 | GFS2_BLKST_UNLINKED); | |
1045 | if (goal == BFITNOENT) | |
1046 | break; | |
1047 | count++; | |
1048 | goal++; | |
1049 | } | |
1050 | } | |
1051 | ||
1052 | return count; | |
1053 | } | |
1054 | ||
1055 | ||
b3b94faa | 1056 | /** |
90306c41 BM |
1057 | * gfs2_rgrp_bh_get - Read in a RG's header and bitmaps |
1058 | * @rgd: the struct gfs2_rgrpd describing the RG to read in | |
b3b94faa DT |
1059 | * |
1060 | * Read in all of a Resource Group's header and bitmap blocks. | |
1061 | * Caller must eventually call gfs2_rgrp_relse() to free the bitmaps. | |
1062 | * | |
1063 | * Returns: errno | |
1064 | */ | |
1065 | ||
90306c41 | 1066 | int gfs2_rgrp_bh_get(struct gfs2_rgrpd *rgd) |
b3b94faa DT |
1067 | { |
1068 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
1069 | struct gfs2_glock *gl = rgd->rd_gl; | |
bb8d8a6f | 1070 | unsigned int length = rgd->rd_length; |
b3b94faa DT |
1071 | struct gfs2_bitmap *bi; |
1072 | unsigned int x, y; | |
1073 | int error; | |
1074 | ||
90306c41 BM |
1075 | if (rgd->rd_bits[0].bi_bh != NULL) |
1076 | return 0; | |
1077 | ||
b3b94faa DT |
1078 | for (x = 0; x < length; x++) { |
1079 | bi = rgd->rd_bits + x; | |
bb8d8a6f | 1080 | error = gfs2_meta_read(gl, rgd->rd_addr + x, 0, &bi->bi_bh); |
b3b94faa DT |
1081 | if (error) |
1082 | goto fail; | |
1083 | } | |
1084 | ||
1085 | for (y = length; y--;) { | |
1086 | bi = rgd->rd_bits + y; | |
7276b3b0 | 1087 | error = gfs2_meta_wait(sdp, bi->bi_bh); |
b3b94faa DT |
1088 | if (error) |
1089 | goto fail; | |
feaa7bba | 1090 | if (gfs2_metatype_check(sdp, bi->bi_bh, y ? GFS2_METATYPE_RB : |
b3b94faa DT |
1091 | GFS2_METATYPE_RG)) { |
1092 | error = -EIO; | |
1093 | goto fail; | |
1094 | } | |
1095 | } | |
1096 | ||
cf45b752 | 1097 | if (!(rgd->rd_flags & GFS2_RDF_UPTODATE)) { |
60a0b8f9 SW |
1098 | for (x = 0; x < length; x++) |
1099 | clear_bit(GBF_FULL, &rgd->rd_bits[x].bi_flags); | |
42d52e38 | 1100 | gfs2_rgrp_in(rgd, (rgd->rd_bits[0].bi_bh)->b_data); |
1ce97e56 | 1101 | rgd->rd_flags |= (GFS2_RDF_UPTODATE | GFS2_RDF_CHECK); |
7c9ca621 | 1102 | rgd->rd_free_clone = rgd->rd_free; |
b3b94faa | 1103 | } |
90306c41 BM |
1104 | if (be32_to_cpu(GFS2_MAGIC) != rgd->rd_rgl->rl_magic) { |
1105 | rgd->rd_rgl->rl_unlinked = cpu_to_be32(count_unlinked(rgd)); | |
1106 | gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, | |
1107 | rgd->rd_bits[0].bi_bh->b_data); | |
1108 | } | |
1109 | else if (sdp->sd_args.ar_rgrplvb) { | |
1110 | if (!gfs2_rgrp_lvb_valid(rgd)){ | |
1111 | gfs2_consist_rgrpd(rgd); | |
1112 | error = -EIO; | |
1113 | goto fail; | |
1114 | } | |
1115 | if (rgd->rd_rgl->rl_unlinked == 0) | |
1116 | rgd->rd_flags &= ~GFS2_RDF_CHECK; | |
1117 | } | |
b3b94faa DT |
1118 | return 0; |
1119 | ||
feaa7bba | 1120 | fail: |
b3b94faa DT |
1121 | while (x--) { |
1122 | bi = rgd->rd_bits + x; | |
1123 | brelse(bi->bi_bh); | |
1124 | bi->bi_bh = NULL; | |
1125 | gfs2_assert_warn(sdp, !bi->bi_clone); | |
1126 | } | |
b3b94faa DT |
1127 | |
1128 | return error; | |
1129 | } | |
1130 | ||
90306c41 BM |
1131 | int update_rgrp_lvb(struct gfs2_rgrpd *rgd) |
1132 | { | |
1133 | u32 rl_flags; | |
1134 | ||
1135 | if (rgd->rd_flags & GFS2_RDF_UPTODATE) | |
1136 | return 0; | |
1137 | ||
1138 | if (be32_to_cpu(GFS2_MAGIC) != rgd->rd_rgl->rl_magic) | |
1139 | return gfs2_rgrp_bh_get(rgd); | |
1140 | ||
1141 | rl_flags = be32_to_cpu(rgd->rd_rgl->rl_flags); | |
1142 | rl_flags &= ~GFS2_RDF_MASK; | |
1143 | rgd->rd_flags &= GFS2_RDF_MASK; | |
1144 | rgd->rd_flags |= (rl_flags | GFS2_RDF_UPTODATE | GFS2_RDF_CHECK); | |
1145 | if (rgd->rd_rgl->rl_unlinked == 0) | |
1146 | rgd->rd_flags &= ~GFS2_RDF_CHECK; | |
1147 | rgd->rd_free = be32_to_cpu(rgd->rd_rgl->rl_free); | |
1148 | rgd->rd_free_clone = rgd->rd_free; | |
1149 | rgd->rd_dinodes = be32_to_cpu(rgd->rd_rgl->rl_dinodes); | |
1150 | rgd->rd_igeneration = be64_to_cpu(rgd->rd_rgl->rl_igeneration); | |
1151 | return 0; | |
1152 | } | |
1153 | ||
1154 | int gfs2_rgrp_go_lock(struct gfs2_holder *gh) | |
1155 | { | |
1156 | struct gfs2_rgrpd *rgd = gh->gh_gl->gl_object; | |
1157 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
1158 | ||
1159 | if (gh->gh_flags & GL_SKIP && sdp->sd_args.ar_rgrplvb) | |
1160 | return 0; | |
1161 | return gfs2_rgrp_bh_get((struct gfs2_rgrpd *)gh->gh_gl->gl_object); | |
1162 | } | |
1163 | ||
b3b94faa | 1164 | /** |
7c9ca621 | 1165 | * gfs2_rgrp_go_unlock - Release RG bitmaps read in with gfs2_rgrp_bh_get() |
886b1416 | 1166 | * @gh: The glock holder for the resource group |
b3b94faa DT |
1167 | * |
1168 | */ | |
1169 | ||
7c9ca621 | 1170 | void gfs2_rgrp_go_unlock(struct gfs2_holder *gh) |
b3b94faa | 1171 | { |
7c9ca621 | 1172 | struct gfs2_rgrpd *rgd = gh->gh_gl->gl_object; |
bb8d8a6f | 1173 | int x, length = rgd->rd_length; |
b3b94faa | 1174 | |
b3b94faa DT |
1175 | for (x = 0; x < length; x++) { |
1176 | struct gfs2_bitmap *bi = rgd->rd_bits + x; | |
90306c41 BM |
1177 | if (bi->bi_bh) { |
1178 | brelse(bi->bi_bh); | |
1179 | bi->bi_bh = NULL; | |
1180 | } | |
b3b94faa DT |
1181 | } |
1182 | ||
b3b94faa DT |
1183 | } |
1184 | ||
66fc061b | 1185 | int gfs2_rgrp_send_discards(struct gfs2_sbd *sdp, u64 offset, |
7c9ca621 | 1186 | struct buffer_head *bh, |
66fc061b | 1187 | const struct gfs2_bitmap *bi, unsigned minlen, u64 *ptrimmed) |
f15ab561 SW |
1188 | { |
1189 | struct super_block *sb = sdp->sd_vfs; | |
f15ab561 | 1190 | u64 blk; |
64d576ba | 1191 | sector_t start = 0; |
b2c87cae | 1192 | sector_t nr_blks = 0; |
f15ab561 SW |
1193 | int rv; |
1194 | unsigned int x; | |
66fc061b SW |
1195 | u32 trimmed = 0; |
1196 | u8 diff; | |
f15ab561 SW |
1197 | |
1198 | for (x = 0; x < bi->bi_len; x++) { | |
66fc061b SW |
1199 | const u8 *clone = bi->bi_clone ? bi->bi_clone : bi->bi_bh->b_data; |
1200 | clone += bi->bi_offset; | |
1201 | clone += x; | |
1202 | if (bh) { | |
1203 | const u8 *orig = bh->b_data + bi->bi_offset + x; | |
1204 | diff = ~(*orig | (*orig >> 1)) & (*clone | (*clone >> 1)); | |
1205 | } else { | |
1206 | diff = ~(*clone | (*clone >> 1)); | |
1207 | } | |
f15ab561 SW |
1208 | diff &= 0x55; |
1209 | if (diff == 0) | |
1210 | continue; | |
1211 | blk = offset + ((bi->bi_start + x) * GFS2_NBBY); | |
f15ab561 SW |
1212 | while(diff) { |
1213 | if (diff & 1) { | |
b2c87cae | 1214 | if (nr_blks == 0) |
f15ab561 | 1215 | goto start_new_extent; |
b2c87cae BP |
1216 | if ((start + nr_blks) != blk) { |
1217 | if (nr_blks >= minlen) { | |
1218 | rv = sb_issue_discard(sb, | |
1219 | start, nr_blks, | |
66fc061b SW |
1220 | GFP_NOFS, 0); |
1221 | if (rv) | |
1222 | goto fail; | |
b2c87cae | 1223 | trimmed += nr_blks; |
66fc061b | 1224 | } |
b2c87cae | 1225 | nr_blks = 0; |
f15ab561 SW |
1226 | start_new_extent: |
1227 | start = blk; | |
1228 | } | |
b2c87cae | 1229 | nr_blks++; |
f15ab561 SW |
1230 | } |
1231 | diff >>= 2; | |
b2c87cae | 1232 | blk++; |
f15ab561 SW |
1233 | } |
1234 | } | |
b2c87cae BP |
1235 | if (nr_blks >= minlen) { |
1236 | rv = sb_issue_discard(sb, start, nr_blks, GFP_NOFS, 0); | |
f15ab561 SW |
1237 | if (rv) |
1238 | goto fail; | |
b2c87cae | 1239 | trimmed += nr_blks; |
f15ab561 | 1240 | } |
66fc061b SW |
1241 | if (ptrimmed) |
1242 | *ptrimmed = trimmed; | |
1243 | return 0; | |
1244 | ||
f15ab561 | 1245 | fail: |
66fc061b SW |
1246 | if (sdp->sd_args.ar_discard) |
1247 | fs_warn(sdp, "error %d on discard request, turning discards off for this filesystem", rv); | |
f15ab561 | 1248 | sdp->sd_args.ar_discard = 0; |
66fc061b SW |
1249 | return -EIO; |
1250 | } | |
1251 | ||
1252 | /** | |
1253 | * gfs2_fitrim - Generate discard requests for unused bits of the filesystem | |
1254 | * @filp: Any file on the filesystem | |
1255 | * @argp: Pointer to the arguments (also used to pass result) | |
1256 | * | |
1257 | * Returns: 0 on success, otherwise error code | |
1258 | */ | |
1259 | ||
1260 | int gfs2_fitrim(struct file *filp, void __user *argp) | |
1261 | { | |
496ad9aa | 1262 | struct inode *inode = file_inode(filp); |
66fc061b SW |
1263 | struct gfs2_sbd *sdp = GFS2_SB(inode); |
1264 | struct request_queue *q = bdev_get_queue(sdp->sd_vfs->s_bdev); | |
1265 | struct buffer_head *bh; | |
1266 | struct gfs2_rgrpd *rgd; | |
1267 | struct gfs2_rgrpd *rgd_end; | |
1268 | struct gfs2_holder gh; | |
1269 | struct fstrim_range r; | |
1270 | int ret = 0; | |
1271 | u64 amt; | |
1272 | u64 trimmed = 0; | |
076f0faa | 1273 | u64 start, end, minlen; |
66fc061b | 1274 | unsigned int x; |
076f0faa | 1275 | unsigned bs_shift = sdp->sd_sb.sb_bsize_shift; |
66fc061b SW |
1276 | |
1277 | if (!capable(CAP_SYS_ADMIN)) | |
1278 | return -EPERM; | |
1279 | ||
1280 | if (!blk_queue_discard(q)) | |
1281 | return -EOPNOTSUPP; | |
1282 | ||
3a238ade | 1283 | if (copy_from_user(&r, argp, sizeof(r))) |
66fc061b SW |
1284 | return -EFAULT; |
1285 | ||
5e2f7d61 BP |
1286 | ret = gfs2_rindex_update(sdp); |
1287 | if (ret) | |
1288 | return ret; | |
1289 | ||
076f0faa LC |
1290 | start = r.start >> bs_shift; |
1291 | end = start + (r.len >> bs_shift); | |
1292 | minlen = max_t(u64, r.minlen, | |
1293 | q->limits.discard_granularity) >> bs_shift; | |
1294 | ||
6a98c333 AD |
1295 | if (end <= start || minlen > sdp->sd_max_rg_data) |
1296 | return -EINVAL; | |
1297 | ||
076f0faa | 1298 | rgd = gfs2_blk2rgrpd(sdp, start, 0); |
6a98c333 | 1299 | rgd_end = gfs2_blk2rgrpd(sdp, end, 0); |
076f0faa | 1300 | |
6a98c333 AD |
1301 | if ((gfs2_rgrpd_get_first(sdp) == gfs2_rgrpd_get_next(rgd_end)) |
1302 | && (start > rgd_end->rd_data0 + rgd_end->rd_data)) | |
1303 | return -EINVAL; /* start is beyond the end of the fs */ | |
66fc061b SW |
1304 | |
1305 | while (1) { | |
1306 | ||
1307 | ret = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_EXCLUSIVE, 0, &gh); | |
1308 | if (ret) | |
1309 | goto out; | |
1310 | ||
1311 | if (!(rgd->rd_flags & GFS2_RGF_TRIMMED)) { | |
1312 | /* Trim each bitmap in the rgrp */ | |
1313 | for (x = 0; x < rgd->rd_length; x++) { | |
1314 | struct gfs2_bitmap *bi = rgd->rd_bits + x; | |
076f0faa LC |
1315 | ret = gfs2_rgrp_send_discards(sdp, |
1316 | rgd->rd_data0, NULL, bi, minlen, | |
1317 | &amt); | |
66fc061b SW |
1318 | if (ret) { |
1319 | gfs2_glock_dq_uninit(&gh); | |
1320 | goto out; | |
1321 | } | |
1322 | trimmed += amt; | |
1323 | } | |
1324 | ||
1325 | /* Mark rgrp as having been trimmed */ | |
1326 | ret = gfs2_trans_begin(sdp, RES_RG_HDR, 0); | |
1327 | if (ret == 0) { | |
1328 | bh = rgd->rd_bits[0].bi_bh; | |
1329 | rgd->rd_flags |= GFS2_RGF_TRIMMED; | |
350a9b0a | 1330 | gfs2_trans_add_meta(rgd->rd_gl, bh); |
66fc061b | 1331 | gfs2_rgrp_out(rgd, bh->b_data); |
90306c41 | 1332 | gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, bh->b_data); |
66fc061b SW |
1333 | gfs2_trans_end(sdp); |
1334 | } | |
1335 | } | |
1336 | gfs2_glock_dq_uninit(&gh); | |
1337 | ||
1338 | if (rgd == rgd_end) | |
1339 | break; | |
1340 | ||
1341 | rgd = gfs2_rgrpd_get_next(rgd); | |
1342 | } | |
1343 | ||
1344 | out: | |
6a98c333 | 1345 | r.len = trimmed << bs_shift; |
3a238ade | 1346 | if (copy_to_user(argp, &r, sizeof(r))) |
66fc061b SW |
1347 | return -EFAULT; |
1348 | ||
1349 | return ret; | |
f15ab561 SW |
1350 | } |
1351 | ||
8e2e0047 BP |
1352 | /** |
1353 | * rs_insert - insert a new multi-block reservation into the rgrp's rb_tree | |
8e2e0047 | 1354 | * @ip: the inode structure |
8e2e0047 | 1355 | * |
8e2e0047 | 1356 | */ |
ff7f4cb4 | 1357 | static void rs_insert(struct gfs2_inode *ip) |
8e2e0047 BP |
1358 | { |
1359 | struct rb_node **newn, *parent = NULL; | |
1360 | int rc; | |
1361 | struct gfs2_blkreserv *rs = ip->i_res; | |
4a993fb1 | 1362 | struct gfs2_rgrpd *rgd = rs->rs_rbm.rgd; |
ff7f4cb4 | 1363 | u64 fsblock = gfs2_rbm_to_block(&rs->rs_rbm); |
8e2e0047 | 1364 | |
8e2e0047 | 1365 | BUG_ON(gfs2_rs_active(rs)); |
c743ffd0 | 1366 | |
ff7f4cb4 SW |
1367 | spin_lock(&rgd->rd_rsspin); |
1368 | newn = &rgd->rd_rstree.rb_node; | |
8e2e0047 BP |
1369 | while (*newn) { |
1370 | struct gfs2_blkreserv *cur = | |
1371 | rb_entry(*newn, struct gfs2_blkreserv, rs_node); | |
1372 | ||
1373 | parent = *newn; | |
ff7f4cb4 | 1374 | rc = rs_cmp(fsblock, rs->rs_free, cur); |
8e2e0047 BP |
1375 | if (rc > 0) |
1376 | newn = &((*newn)->rb_right); | |
1377 | else if (rc < 0) | |
1378 | newn = &((*newn)->rb_left); | |
1379 | else { | |
1380 | spin_unlock(&rgd->rd_rsspin); | |
ff7f4cb4 SW |
1381 | WARN_ON(1); |
1382 | return; | |
8e2e0047 BP |
1383 | } |
1384 | } | |
1385 | ||
8e2e0047 BP |
1386 | rb_link_node(&rs->rs_node, parent, newn); |
1387 | rb_insert_color(&rs->rs_node, &rgd->rd_rstree); | |
1388 | ||
8e2e0047 | 1389 | /* Do our rgrp accounting for the reservation */ |
ff7f4cb4 | 1390 | rgd->rd_reserved += rs->rs_free; /* blocks reserved */ |
8e2e0047 | 1391 | spin_unlock(&rgd->rd_rsspin); |
9e733d39 | 1392 | trace_gfs2_rs(rs, TRACE_RS_INSERT); |
8e2e0047 BP |
1393 | } |
1394 | ||
1395 | /** | |
ff7f4cb4 | 1396 | * rg_mblk_search - find a group of multiple free blocks to form a reservation |
8e2e0047 | 1397 | * @rgd: the resource group descriptor |
8e2e0047 | 1398 | * @ip: pointer to the inode for which we're reserving blocks |
c743ffd0 | 1399 | * @requested: number of blocks required for this allocation |
8e2e0047 | 1400 | * |
8e2e0047 BP |
1401 | */ |
1402 | ||
ff7f4cb4 SW |
1403 | static void rg_mblk_search(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip, |
1404 | unsigned requested) | |
8e2e0047 | 1405 | { |
ff7f4cb4 SW |
1406 | struct gfs2_rbm rbm = { .rgd = rgd, }; |
1407 | u64 goal; | |
1408 | struct gfs2_blkreserv *rs = ip->i_res; | |
1409 | u32 extlen; | |
1410 | u32 free_blocks = rgd->rd_free_clone - rgd->rd_reserved; | |
1411 | int ret; | |
af21ca8e | 1412 | struct inode *inode = &ip->i_inode; |
8e2e0047 | 1413 | |
af21ca8e BP |
1414 | if (S_ISDIR(inode->i_mode)) |
1415 | extlen = 1; | |
1416 | else { | |
1417 | extlen = max_t(u32, atomic_read(&rs->rs_sizehint), requested); | |
1418 | extlen = clamp(extlen, RGRP_RSRV_MINBLKS, free_blocks); | |
1419 | } | |
ff7f4cb4 | 1420 | if ((rgd->rd_free_clone < rgd->rd_reserved) || (free_blocks < extlen)) |
c743ffd0 SW |
1421 | return; |
1422 | ||
8e2e0047 BP |
1423 | /* Find bitmap block that contains bits for goal block */ |
1424 | if (rgrp_contains_block(rgd, ip->i_goal)) | |
ff7f4cb4 | 1425 | goal = ip->i_goal; |
8e2e0047 | 1426 | else |
ff7f4cb4 | 1427 | goal = rgd->rd_last_alloc + rgd->rd_data0; |
8e2e0047 | 1428 | |
ff7f4cb4 SW |
1429 | if (WARN_ON(gfs2_rbm_from_block(&rbm, goal))) |
1430 | return; | |
8e2e0047 | 1431 | |
ff7f4cb4 SW |
1432 | ret = gfs2_rbm_find(&rbm, GFS2_BLKST_FREE, extlen, ip, true); |
1433 | if (ret == 0) { | |
1434 | rs->rs_rbm = rbm; | |
1435 | rs->rs_free = extlen; | |
1436 | rs->rs_inum = ip->i_no_addr; | |
1437 | rs_insert(ip); | |
13d2eb01 BP |
1438 | } else { |
1439 | if (goal == rgd->rd_last_alloc + rgd->rd_data0) | |
1440 | rgd->rd_last_alloc = 0; | |
8e2e0047 | 1441 | } |
b3e47ca0 BP |
1442 | } |
1443 | ||
5b924ae2 SW |
1444 | /** |
1445 | * gfs2_next_unreserved_block - Return next block that is not reserved | |
1446 | * @rgd: The resource group | |
1447 | * @block: The starting block | |
ff7f4cb4 | 1448 | * @length: The required length |
5b924ae2 SW |
1449 | * @ip: Ignore any reservations for this inode |
1450 | * | |
1451 | * If the block does not appear in any reservation, then return the | |
1452 | * block number unchanged. If it does appear in the reservation, then | |
1453 | * keep looking through the tree of reservations in order to find the | |
1454 | * first block number which is not reserved. | |
1455 | */ | |
1456 | ||
1457 | static u64 gfs2_next_unreserved_block(struct gfs2_rgrpd *rgd, u64 block, | |
ff7f4cb4 | 1458 | u32 length, |
5b924ae2 SW |
1459 | const struct gfs2_inode *ip) |
1460 | { | |
1461 | struct gfs2_blkreserv *rs; | |
1462 | struct rb_node *n; | |
1463 | int rc; | |
1464 | ||
1465 | spin_lock(&rgd->rd_rsspin); | |
ff7f4cb4 | 1466 | n = rgd->rd_rstree.rb_node; |
5b924ae2 SW |
1467 | while (n) { |
1468 | rs = rb_entry(n, struct gfs2_blkreserv, rs_node); | |
ff7f4cb4 | 1469 | rc = rs_cmp(block, length, rs); |
5b924ae2 SW |
1470 | if (rc < 0) |
1471 | n = n->rb_left; | |
1472 | else if (rc > 0) | |
1473 | n = n->rb_right; | |
1474 | else | |
1475 | break; | |
1476 | } | |
1477 | ||
1478 | if (n) { | |
ff7f4cb4 | 1479 | while ((rs_cmp(block, length, rs) == 0) && (ip->i_res != rs)) { |
5b924ae2 | 1480 | block = gfs2_rbm_to_block(&rs->rs_rbm) + rs->rs_free; |
ff7f4cb4 | 1481 | n = n->rb_right; |
5b924ae2 SW |
1482 | if (n == NULL) |
1483 | break; | |
1484 | rs = rb_entry(n, struct gfs2_blkreserv, rs_node); | |
1485 | } | |
1486 | } | |
1487 | ||
1488 | spin_unlock(&rgd->rd_rsspin); | |
1489 | return block; | |
1490 | } | |
1491 | ||
5b924ae2 SW |
1492 | /** |
1493 | * gfs2_reservation_check_and_update - Check for reservations during block alloc | |
1494 | * @rbm: The current position in the resource group | |
ff7f4cb4 SW |
1495 | * @ip: The inode for which we are searching for blocks |
1496 | * @minext: The minimum extent length | |
5b924ae2 SW |
1497 | * |
1498 | * This checks the current position in the rgrp to see whether there is | |
1499 | * a reservation covering this block. If not then this function is a | |
1500 | * no-op. If there is, then the position is moved to the end of the | |
1501 | * contiguous reservation(s) so that we are pointing at the first | |
1502 | * non-reserved block. | |
1503 | * | |
1504 | * Returns: 0 if no reservation, 1 if @rbm has changed, otherwise an error | |
1505 | */ | |
1506 | ||
1507 | static int gfs2_reservation_check_and_update(struct gfs2_rbm *rbm, | |
ff7f4cb4 SW |
1508 | const struct gfs2_inode *ip, |
1509 | u32 minext) | |
5b924ae2 SW |
1510 | { |
1511 | u64 block = gfs2_rbm_to_block(rbm); | |
ff7f4cb4 | 1512 | u32 extlen = 1; |
5b924ae2 SW |
1513 | u64 nblock; |
1514 | int ret; | |
1515 | ||
ff7f4cb4 SW |
1516 | /* |
1517 | * If we have a minimum extent length, then skip over any extent | |
1518 | * which is less than the min extent length in size. | |
1519 | */ | |
1520 | if (minext) { | |
1521 | extlen = gfs2_free_extlen(rbm, minext); | |
1522 | nblock = block + extlen; | |
1523 | if (extlen < minext) | |
1524 | goto fail; | |
1525 | } | |
1526 | ||
1527 | /* | |
1528 | * Check the extent which has been found against the reservations | |
1529 | * and skip if parts of it are already reserved | |
1530 | */ | |
1531 | nblock = gfs2_next_unreserved_block(rbm->rgd, block, extlen, ip); | |
5b924ae2 SW |
1532 | if (nblock == block) |
1533 | return 0; | |
ff7f4cb4 | 1534 | fail: |
5b924ae2 SW |
1535 | ret = gfs2_rbm_from_block(rbm, nblock); |
1536 | if (ret < 0) | |
1537 | return ret; | |
1538 | return 1; | |
1539 | } | |
1540 | ||
1541 | /** | |
1542 | * gfs2_rbm_find - Look for blocks of a particular state | |
1543 | * @rbm: Value/result starting position and final position | |
1544 | * @state: The state which we want to find | |
ff7f4cb4 | 1545 | * @minext: The requested extent length (0 for a single block) |
5b924ae2 SW |
1546 | * @ip: If set, check for reservations |
1547 | * @nowrap: Stop looking at the end of the rgrp, rather than wrapping | |
1548 | * around until we've reached the starting point. | |
1549 | * | |
1550 | * Side effects: | |
1551 | * - If looking for free blocks, we set GBF_FULL on each bitmap which | |
1552 | * has no free blocks in it. | |
1553 | * | |
1554 | * Returns: 0 on success, -ENOSPC if there is no block of the requested state | |
1555 | */ | |
1556 | ||
ff7f4cb4 | 1557 | static int gfs2_rbm_find(struct gfs2_rbm *rbm, u8 state, u32 minext, |
5b924ae2 SW |
1558 | const struct gfs2_inode *ip, bool nowrap) |
1559 | { | |
1560 | struct buffer_head *bh; | |
1561 | struct gfs2_bitmap *initial_bi; | |
1562 | u32 initial_offset; | |
1563 | u32 offset; | |
1564 | u8 *buffer; | |
1565 | int index; | |
1566 | int n = 0; | |
1567 | int iters = rbm->rgd->rd_length; | |
1568 | int ret; | |
1569 | ||
1570 | /* If we are not starting at the beginning of a bitmap, then we | |
1571 | * need to add one to the bitmap count to ensure that we search | |
1572 | * the starting bitmap twice. | |
1573 | */ | |
1574 | if (rbm->offset != 0) | |
1575 | iters++; | |
1576 | ||
1577 | while(1) { | |
1578 | if (test_bit(GBF_FULL, &rbm->bi->bi_flags) && | |
1579 | (state == GFS2_BLKST_FREE)) | |
1580 | goto next_bitmap; | |
1581 | ||
1582 | bh = rbm->bi->bi_bh; | |
1583 | buffer = bh->b_data + rbm->bi->bi_offset; | |
1584 | WARN_ON(!buffer_uptodate(bh)); | |
1585 | if (state != GFS2_BLKST_UNLINKED && rbm->bi->bi_clone) | |
1586 | buffer = rbm->bi->bi_clone + rbm->bi->bi_offset; | |
5b924ae2 SW |
1587 | initial_offset = rbm->offset; |
1588 | offset = gfs2_bitfit(buffer, rbm->bi->bi_len, rbm->offset, state); | |
1589 | if (offset == BFITNOENT) | |
1590 | goto bitmap_full; | |
1591 | rbm->offset = offset; | |
1592 | if (ip == NULL) | |
1593 | return 0; | |
1594 | ||
1595 | initial_bi = rbm->bi; | |
ff7f4cb4 | 1596 | ret = gfs2_reservation_check_and_update(rbm, ip, minext); |
5b924ae2 SW |
1597 | if (ret == 0) |
1598 | return 0; | |
1599 | if (ret > 0) { | |
1600 | n += (rbm->bi - initial_bi); | |
8d8b752a | 1601 | goto next_iter; |
5b924ae2 | 1602 | } |
5d50d532 SW |
1603 | if (ret == -E2BIG) { |
1604 | index = 0; | |
1605 | rbm->offset = 0; | |
1606 | n += (rbm->bi - initial_bi); | |
1607 | goto res_covered_end_of_rgrp; | |
1608 | } | |
5b924ae2 SW |
1609 | return ret; |
1610 | ||
1611 | bitmap_full: /* Mark bitmap as full and fall through */ | |
1612 | if ((state == GFS2_BLKST_FREE) && initial_offset == 0) | |
1613 | set_bit(GBF_FULL, &rbm->bi->bi_flags); | |
1614 | ||
1615 | next_bitmap: /* Find next bitmap in the rgrp */ | |
1616 | rbm->offset = 0; | |
1617 | index = rbm->bi - rbm->rgd->rd_bits; | |
1618 | index++; | |
1619 | if (index == rbm->rgd->rd_length) | |
1620 | index = 0; | |
5d50d532 | 1621 | res_covered_end_of_rgrp: |
5b924ae2 SW |
1622 | rbm->bi = &rbm->rgd->rd_bits[index]; |
1623 | if ((index == 0) && nowrap) | |
1624 | break; | |
1625 | n++; | |
8d8b752a | 1626 | next_iter: |
5b924ae2 SW |
1627 | if (n >= iters) |
1628 | break; | |
1629 | } | |
1630 | ||
1631 | return -ENOSPC; | |
1632 | } | |
1633 | ||
c8cdf479 SW |
1634 | /** |
1635 | * try_rgrp_unlink - Look for any unlinked, allocated, but unused inodes | |
1636 | * @rgd: The rgrp | |
886b1416 BP |
1637 | * @last_unlinked: block address of the last dinode we unlinked |
1638 | * @skip: block address we should explicitly not unlink | |
c8cdf479 | 1639 | * |
1a0eae88 BP |
1640 | * Returns: 0 if no error |
1641 | * The inode, if one has been found, in inode. | |
c8cdf479 SW |
1642 | */ |
1643 | ||
044b9414 | 1644 | static void try_rgrp_unlink(struct gfs2_rgrpd *rgd, u64 *last_unlinked, u64 skip) |
c8cdf479 | 1645 | { |
5b924ae2 | 1646 | u64 block; |
5f3eae75 | 1647 | struct gfs2_sbd *sdp = rgd->rd_sbd; |
044b9414 SW |
1648 | struct gfs2_glock *gl; |
1649 | struct gfs2_inode *ip; | |
1650 | int error; | |
1651 | int found = 0; | |
5b924ae2 | 1652 | struct gfs2_rbm rbm = { .rgd = rgd, .bi = rgd->rd_bits, .offset = 0 }; |
c8cdf479 | 1653 | |
5b924ae2 | 1654 | while (1) { |
5f3eae75 | 1655 | down_write(&sdp->sd_log_flush_lock); |
ff7f4cb4 | 1656 | error = gfs2_rbm_find(&rbm, GFS2_BLKST_UNLINKED, 0, NULL, true); |
5f3eae75 | 1657 | up_write(&sdp->sd_log_flush_lock); |
5b924ae2 SW |
1658 | if (error == -ENOSPC) |
1659 | break; | |
1660 | if (WARN_ON_ONCE(error)) | |
24c73873 | 1661 | break; |
b3e47ca0 | 1662 | |
5b924ae2 SW |
1663 | block = gfs2_rbm_to_block(&rbm); |
1664 | if (gfs2_rbm_from_block(&rbm, block + 1)) | |
1665 | break; | |
1666 | if (*last_unlinked != NO_BLOCK && block <= *last_unlinked) | |
c8cdf479 | 1667 | continue; |
5b924ae2 | 1668 | if (block == skip) |
1e19a195 | 1669 | continue; |
5b924ae2 | 1670 | *last_unlinked = block; |
044b9414 | 1671 | |
5b924ae2 | 1672 | error = gfs2_glock_get(sdp, block, &gfs2_inode_glops, CREATE, &gl); |
044b9414 SW |
1673 | if (error) |
1674 | continue; | |
1675 | ||
1676 | /* If the inode is already in cache, we can ignore it here | |
1677 | * because the existing inode disposal code will deal with | |
1678 | * it when all refs have gone away. Accessing gl_object like | |
1679 | * this is not safe in general. Here it is ok because we do | |
1680 | * not dereference the pointer, and we only need an approx | |
1681 | * answer to whether it is NULL or not. | |
1682 | */ | |
1683 | ip = gl->gl_object; | |
1684 | ||
1685 | if (ip || queue_work(gfs2_delete_workqueue, &gl->gl_delete) == 0) | |
1686 | gfs2_glock_put(gl); | |
1687 | else | |
1688 | found++; | |
1689 | ||
1690 | /* Limit reclaim to sensible number of tasks */ | |
44ad37d6 | 1691 | if (found > NR_CPUS) |
044b9414 | 1692 | return; |
c8cdf479 SW |
1693 | } |
1694 | ||
1695 | rgd->rd_flags &= ~GFS2_RDF_CHECK; | |
044b9414 | 1696 | return; |
c8cdf479 SW |
1697 | } |
1698 | ||
bcd97c06 SW |
1699 | /** |
1700 | * gfs2_rgrp_congested - Use stats to figure out whether an rgrp is congested | |
1701 | * @rgd: The rgrp in question | |
1702 | * @loops: An indication of how picky we can be (0=very, 1=less so) | |
1703 | * | |
1704 | * This function uses the recently added glock statistics in order to | |
1705 | * figure out whether a parciular resource group is suffering from | |
1706 | * contention from multiple nodes. This is done purely on the basis | |
1707 | * of timings, since this is the only data we have to work with and | |
1708 | * our aim here is to reject a resource group which is highly contended | |
1709 | * but (very important) not to do this too often in order to ensure that | |
1710 | * we do not land up introducing fragmentation by changing resource | |
1711 | * groups when not actually required. | |
1712 | * | |
1713 | * The calculation is fairly simple, we want to know whether the SRTTB | |
1714 | * (i.e. smoothed round trip time for blocking operations) to acquire | |
1715 | * the lock for this rgrp's glock is significantly greater than the | |
1716 | * time taken for resource groups on average. We introduce a margin in | |
1717 | * the form of the variable @var which is computed as the sum of the two | |
1718 | * respective variences, and multiplied by a factor depending on @loops | |
1719 | * and whether we have a lot of data to base the decision on. This is | |
1720 | * then tested against the square difference of the means in order to | |
1721 | * decide whether the result is statistically significant or not. | |
1722 | * | |
1723 | * Returns: A boolean verdict on the congestion status | |
1724 | */ | |
1725 | ||
1726 | static bool gfs2_rgrp_congested(const struct gfs2_rgrpd *rgd, int loops) | |
1727 | { | |
1728 | const struct gfs2_glock *gl = rgd->rd_gl; | |
1729 | const struct gfs2_sbd *sdp = gl->gl_sbd; | |
1730 | struct gfs2_lkstats *st; | |
1731 | s64 r_dcount, l_dcount; | |
1732 | s64 r_srttb, l_srttb; | |
1733 | s64 srttb_diff; | |
1734 | s64 sqr_diff; | |
1735 | s64 var; | |
1736 | ||
1737 | preempt_disable(); | |
1738 | st = &this_cpu_ptr(sdp->sd_lkstats)->lkstats[LM_TYPE_RGRP]; | |
1739 | r_srttb = st->stats[GFS2_LKS_SRTTB]; | |
1740 | r_dcount = st->stats[GFS2_LKS_DCOUNT]; | |
1741 | var = st->stats[GFS2_LKS_SRTTVARB] + | |
1742 | gl->gl_stats.stats[GFS2_LKS_SRTTVARB]; | |
1743 | preempt_enable(); | |
1744 | ||
1745 | l_srttb = gl->gl_stats.stats[GFS2_LKS_SRTTB]; | |
1746 | l_dcount = gl->gl_stats.stats[GFS2_LKS_DCOUNT]; | |
1747 | ||
1748 | if ((l_dcount < 1) || (r_dcount < 1) || (r_srttb == 0)) | |
1749 | return false; | |
1750 | ||
1751 | srttb_diff = r_srttb - l_srttb; | |
1752 | sqr_diff = srttb_diff * srttb_diff; | |
1753 | ||
1754 | var *= 2; | |
1755 | if (l_dcount < 8 || r_dcount < 8) | |
1756 | var *= 2; | |
1757 | if (loops == 1) | |
1758 | var *= 2; | |
1759 | ||
1760 | return ((srttb_diff < 0) && (sqr_diff > var)); | |
1761 | } | |
1762 | ||
1763 | /** | |
1764 | * gfs2_rgrp_used_recently | |
1765 | * @rs: The block reservation with the rgrp to test | |
1766 | * @msecs: The time limit in milliseconds | |
1767 | * | |
1768 | * Returns: True if the rgrp glock has been used within the time limit | |
1769 | */ | |
1770 | static bool gfs2_rgrp_used_recently(const struct gfs2_blkreserv *rs, | |
1771 | u64 msecs) | |
1772 | { | |
1773 | u64 tdiff; | |
1774 | ||
1775 | tdiff = ktime_to_ns(ktime_sub(ktime_get_real(), | |
1776 | rs->rs_rbm.rgd->rd_gl->gl_dstamp)); | |
1777 | ||
1778 | return tdiff > (msecs * 1000 * 1000); | |
1779 | } | |
1780 | ||
9dbe9610 SW |
1781 | static u32 gfs2_orlov_skip(const struct gfs2_inode *ip) |
1782 | { | |
1783 | const struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); | |
1784 | u32 skip; | |
1785 | ||
1786 | get_random_bytes(&skip, sizeof(skip)); | |
1787 | return skip % sdp->sd_rgrps; | |
1788 | } | |
1789 | ||
c743ffd0 SW |
1790 | static bool gfs2_select_rgrp(struct gfs2_rgrpd **pos, const struct gfs2_rgrpd *begin) |
1791 | { | |
1792 | struct gfs2_rgrpd *rgd = *pos; | |
aa8920c9 | 1793 | struct gfs2_sbd *sdp = rgd->rd_sbd; |
c743ffd0 SW |
1794 | |
1795 | rgd = gfs2_rgrpd_get_next(rgd); | |
1796 | if (rgd == NULL) | |
aa8920c9 | 1797 | rgd = gfs2_rgrpd_get_first(sdp); |
c743ffd0 SW |
1798 | *pos = rgd; |
1799 | if (rgd != begin) /* If we didn't wrap */ | |
1800 | return true; | |
1801 | return false; | |
1802 | } | |
1803 | ||
b3b94faa | 1804 | /** |
666d1d8a | 1805 | * gfs2_inplace_reserve - Reserve space in the filesystem |
b3b94faa | 1806 | * @ip: the inode to reserve space for |
666d1d8a | 1807 | * @requested: the number of blocks to be reserved |
b3b94faa DT |
1808 | * |
1809 | * Returns: errno | |
1810 | */ | |
1811 | ||
9dbe9610 | 1812 | int gfs2_inplace_reserve(struct gfs2_inode *ip, u32 requested, u32 aflags) |
b3b94faa | 1813 | { |
feaa7bba | 1814 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
8e2e0047 | 1815 | struct gfs2_rgrpd *begin = NULL; |
564e12b1 | 1816 | struct gfs2_blkreserv *rs = ip->i_res; |
bcd97c06 | 1817 | int error = 0, rg_locked, flags = 0; |
666d1d8a | 1818 | u64 last_unlinked = NO_BLOCK; |
7c9ca621 | 1819 | int loops = 0; |
9dbe9610 | 1820 | u32 skip = 0; |
b3b94faa | 1821 | |
90306c41 BM |
1822 | if (sdp->sd_args.ar_rgrplvb) |
1823 | flags |= GL_SKIP; | |
c743ffd0 SW |
1824 | if (gfs2_assert_warn(sdp, requested)) |
1825 | return -EINVAL; | |
8e2e0047 | 1826 | if (gfs2_rs_active(rs)) { |
4a993fb1 | 1827 | begin = rs->rs_rbm.rgd; |
8e2e0047 | 1828 | } else if (ip->i_rgd && rgrp_contains_block(ip->i_rgd, ip->i_goal)) { |
4a993fb1 | 1829 | rs->rs_rbm.rgd = begin = ip->i_rgd; |
8e2e0047 | 1830 | } else { |
4a993fb1 | 1831 | rs->rs_rbm.rgd = begin = gfs2_blk2rgrpd(sdp, ip->i_goal, 1); |
8e2e0047 | 1832 | } |
9dbe9610 SW |
1833 | if (S_ISDIR(ip->i_inode.i_mode) && (aflags & GFS2_AF_ORLOV)) |
1834 | skip = gfs2_orlov_skip(ip); | |
4a993fb1 | 1835 | if (rs->rs_rbm.rgd == NULL) |
7c9ca621 BP |
1836 | return -EBADSLT; |
1837 | ||
1838 | while (loops < 3) { | |
c743ffd0 SW |
1839 | rg_locked = 1; |
1840 | ||
1841 | if (!gfs2_glock_is_locked_by_me(rs->rs_rbm.rgd->rd_gl)) { | |
1842 | rg_locked = 0; | |
9dbe9610 SW |
1843 | if (skip && skip--) |
1844 | goto next_rgrp; | |
bcd97c06 SW |
1845 | if (!gfs2_rs_active(rs) && (loops < 2) && |
1846 | gfs2_rgrp_used_recently(rs, 1000) && | |
1847 | gfs2_rgrp_congested(rs->rs_rbm.rgd, loops)) | |
1848 | goto next_rgrp; | |
4a993fb1 | 1849 | error = gfs2_glock_nq_init(rs->rs_rbm.rgd->rd_gl, |
8e2e0047 BP |
1850 | LM_ST_EXCLUSIVE, flags, |
1851 | &rs->rs_rgd_gh); | |
c743ffd0 SW |
1852 | if (unlikely(error)) |
1853 | return error; | |
bcd97c06 SW |
1854 | if (!gfs2_rs_active(rs) && (loops < 2) && |
1855 | gfs2_rgrp_congested(rs->rs_rbm.rgd, loops)) | |
1856 | goto skip_rgrp; | |
c743ffd0 | 1857 | if (sdp->sd_args.ar_rgrplvb) { |
4a993fb1 | 1858 | error = update_rgrp_lvb(rs->rs_rbm.rgd); |
c743ffd0 | 1859 | if (unlikely(error)) { |
90306c41 BM |
1860 | gfs2_glock_dq_uninit(&rs->rs_rgd_gh); |
1861 | return error; | |
1862 | } | |
1863 | } | |
292c8c14 | 1864 | } |
666d1d8a | 1865 | |
c743ffd0 SW |
1866 | /* Skip unuseable resource groups */ |
1867 | if (rs->rs_rbm.rgd->rd_flags & (GFS2_RGF_NOALLOC | GFS2_RDF_ERROR)) | |
1868 | goto skip_rgrp; | |
1869 | ||
1870 | if (sdp->sd_args.ar_rgrplvb) | |
1871 | gfs2_rgrp_bh_get(rs->rs_rbm.rgd); | |
1872 | ||
1873 | /* Get a reservation if we don't already have one */ | |
1874 | if (!gfs2_rs_active(rs)) | |
1875 | rg_mblk_search(rs->rs_rbm.rgd, ip, requested); | |
1876 | ||
1877 | /* Skip rgrps when we can't get a reservation on first pass */ | |
1878 | if (!gfs2_rs_active(rs) && (loops < 1)) | |
1879 | goto check_rgrp; | |
1880 | ||
1881 | /* If rgrp has enough free space, use it */ | |
1882 | if (rs->rs_rbm.rgd->rd_free_clone >= requested) { | |
1883 | ip->i_rgd = rs->rs_rbm.rgd; | |
1884 | return 0; | |
b3b94faa | 1885 | } |
c743ffd0 SW |
1886 | |
1887 | /* Drop reservation, if we couldn't use reserved rgrp */ | |
1888 | if (gfs2_rs_active(rs)) | |
20095218 | 1889 | gfs2_rs_deltree(rs); |
c743ffd0 SW |
1890 | check_rgrp: |
1891 | /* Check for unlinked inodes which can be reclaimed */ | |
1892 | if (rs->rs_rbm.rgd->rd_flags & GFS2_RDF_CHECK) | |
1893 | try_rgrp_unlink(rs->rs_rbm.rgd, &last_unlinked, | |
1894 | ip->i_no_addr); | |
1895 | skip_rgrp: | |
1896 | /* Unlock rgrp if required */ | |
1897 | if (!rg_locked) | |
1898 | gfs2_glock_dq_uninit(&rs->rs_rgd_gh); | |
1899 | next_rgrp: | |
1900 | /* Find the next rgrp, and continue looking */ | |
1901 | if (gfs2_select_rgrp(&rs->rs_rbm.rgd, begin)) | |
1902 | continue; | |
9dbe9610 SW |
1903 | if (skip) |
1904 | continue; | |
c743ffd0 SW |
1905 | |
1906 | /* If we've scanned all the rgrps, but found no free blocks | |
1907 | * then this checks for some less likely conditions before | |
1908 | * trying again. | |
1909 | */ | |
c743ffd0 SW |
1910 | loops++; |
1911 | /* Check that fs hasn't grown if writing to rindex */ | |
1912 | if (ip == GFS2_I(sdp->sd_rindex) && !sdp->sd_rindex_uptodate) { | |
1913 | error = gfs2_ri_update(ip); | |
1914 | if (error) | |
1915 | return error; | |
1916 | } | |
1917 | /* Flushing the log may release space */ | |
1918 | if (loops == 2) | |
1919 | gfs2_log_flush(sdp, NULL); | |
b3b94faa | 1920 | } |
b3b94faa | 1921 | |
c743ffd0 | 1922 | return -ENOSPC; |
b3b94faa DT |
1923 | } |
1924 | ||
1925 | /** | |
1926 | * gfs2_inplace_release - release an inplace reservation | |
1927 | * @ip: the inode the reservation was taken out on | |
1928 | * | |
1929 | * Release a reservation made by gfs2_inplace_reserve(). | |
1930 | */ | |
1931 | ||
1932 | void gfs2_inplace_release(struct gfs2_inode *ip) | |
1933 | { | |
564e12b1 | 1934 | struct gfs2_blkreserv *rs = ip->i_res; |
b3b94faa | 1935 | |
564e12b1 BP |
1936 | if (rs->rs_rgd_gh.gh_gl) |
1937 | gfs2_glock_dq_uninit(&rs->rs_rgd_gh); | |
b3b94faa DT |
1938 | } |
1939 | ||
1940 | /** | |
1941 | * gfs2_get_block_type - Check a block in a RG is of given type | |
1942 | * @rgd: the resource group holding the block | |
1943 | * @block: the block number | |
1944 | * | |
1945 | * Returns: The block type (GFS2_BLKST_*) | |
1946 | */ | |
1947 | ||
acf7e244 | 1948 | static unsigned char gfs2_get_block_type(struct gfs2_rgrpd *rgd, u64 block) |
b3b94faa | 1949 | { |
3983903a SW |
1950 | struct gfs2_rbm rbm = { .rgd = rgd, }; |
1951 | int ret; | |
b3b94faa | 1952 | |
3983903a SW |
1953 | ret = gfs2_rbm_from_block(&rbm, block); |
1954 | WARN_ON_ONCE(ret != 0); | |
b3b94faa | 1955 | |
c04a2ef3 | 1956 | return gfs2_testbit(&rbm); |
b3b94faa DT |
1957 | } |
1958 | ||
60a0b8f9 | 1959 | |
b3e47ca0 BP |
1960 | /** |
1961 | * gfs2_alloc_extent - allocate an extent from a given bitmap | |
4a993fb1 | 1962 | * @rbm: the resource group information |
b3e47ca0 | 1963 | * @dinode: TRUE if the first block we allocate is for a dinode |
c04a2ef3 | 1964 | * @n: The extent length (value/result) |
b3e47ca0 | 1965 | * |
c04a2ef3 | 1966 | * Add the bitmap buffer to the transaction. |
b3e47ca0 | 1967 | * Set the found bits to @new_state to change block's allocation state. |
b3e47ca0 | 1968 | */ |
c04a2ef3 | 1969 | static void gfs2_alloc_extent(const struct gfs2_rbm *rbm, bool dinode, |
4a993fb1 | 1970 | unsigned int *n) |
b3e47ca0 | 1971 | { |
c04a2ef3 | 1972 | struct gfs2_rbm pos = { .rgd = rbm->rgd, }; |
b3e47ca0 | 1973 | const unsigned int elen = *n; |
c04a2ef3 SW |
1974 | u64 block; |
1975 | int ret; | |
b3e47ca0 | 1976 | |
c04a2ef3 SW |
1977 | *n = 1; |
1978 | block = gfs2_rbm_to_block(rbm); | |
350a9b0a | 1979 | gfs2_trans_add_meta(rbm->rgd->rd_gl, rbm->bi->bi_bh); |
3e6339dd | 1980 | gfs2_setbit(rbm, true, dinode ? GFS2_BLKST_DINODE : GFS2_BLKST_USED); |
c04a2ef3 | 1981 | block++; |
60a0b8f9 | 1982 | while (*n < elen) { |
c04a2ef3 | 1983 | ret = gfs2_rbm_from_block(&pos, block); |
0688a5ec | 1984 | if (ret || gfs2_testbit(&pos) != GFS2_BLKST_FREE) |
60a0b8f9 | 1985 | break; |
350a9b0a | 1986 | gfs2_trans_add_meta(pos.rgd->rd_gl, pos.bi->bi_bh); |
3e6339dd | 1987 | gfs2_setbit(&pos, true, GFS2_BLKST_USED); |
60a0b8f9 | 1988 | (*n)++; |
c04a2ef3 | 1989 | block++; |
c8cdf479 | 1990 | } |
b3b94faa DT |
1991 | } |
1992 | ||
1993 | /** | |
1994 | * rgblk_free - Change alloc state of given block(s) | |
1995 | * @sdp: the filesystem | |
1996 | * @bstart: the start of a run of blocks to free | |
1997 | * @blen: the length of the block run (all must lie within ONE RG!) | |
1998 | * @new_state: GFS2_BLKST_XXX the after-allocation block state | |
1999 | * | |
2000 | * Returns: Resource group containing the block(s) | |
2001 | */ | |
2002 | ||
cd915493 SW |
2003 | static struct gfs2_rgrpd *rgblk_free(struct gfs2_sbd *sdp, u64 bstart, |
2004 | u32 blen, unsigned char new_state) | |
b3b94faa | 2005 | { |
3b1d0b9d | 2006 | struct gfs2_rbm rbm; |
b3b94faa | 2007 | |
3b1d0b9d SW |
2008 | rbm.rgd = gfs2_blk2rgrpd(sdp, bstart, 1); |
2009 | if (!rbm.rgd) { | |
b3b94faa | 2010 | if (gfs2_consist(sdp)) |
382066da | 2011 | fs_err(sdp, "block = %llu\n", (unsigned long long)bstart); |
b3b94faa DT |
2012 | return NULL; |
2013 | } | |
2014 | ||
b3b94faa | 2015 | while (blen--) { |
3b1d0b9d SW |
2016 | gfs2_rbm_from_block(&rbm, bstart); |
2017 | bstart++; | |
2018 | if (!rbm.bi->bi_clone) { | |
2019 | rbm.bi->bi_clone = kmalloc(rbm.bi->bi_bh->b_size, | |
2020 | GFP_NOFS | __GFP_NOFAIL); | |
2021 | memcpy(rbm.bi->bi_clone + rbm.bi->bi_offset, | |
2022 | rbm.bi->bi_bh->b_data + rbm.bi->bi_offset, | |
2023 | rbm.bi->bi_len); | |
b3b94faa | 2024 | } |
350a9b0a | 2025 | gfs2_trans_add_meta(rbm.rgd->rd_gl, rbm.bi->bi_bh); |
3e6339dd | 2026 | gfs2_setbit(&rbm, false, new_state); |
b3b94faa DT |
2027 | } |
2028 | ||
3b1d0b9d | 2029 | return rbm.rgd; |
b3b94faa DT |
2030 | } |
2031 | ||
2032 | /** | |
09010978 SW |
2033 | * gfs2_rgrp_dump - print out an rgrp |
2034 | * @seq: The iterator | |
2035 | * @gl: The glock in question | |
2036 | * | |
2037 | */ | |
2038 | ||
2039 | int gfs2_rgrp_dump(struct seq_file *seq, const struct gfs2_glock *gl) | |
2040 | { | |
8e2e0047 BP |
2041 | struct gfs2_rgrpd *rgd = gl->gl_object; |
2042 | struct gfs2_blkreserv *trs; | |
2043 | const struct rb_node *n; | |
2044 | ||
09010978 SW |
2045 | if (rgd == NULL) |
2046 | return 0; | |
8e2e0047 | 2047 | gfs2_print_dbg(seq, " R: n:%llu f:%02x b:%u/%u i:%u r:%u\n", |
09010978 | 2048 | (unsigned long long)rgd->rd_addr, rgd->rd_flags, |
8e2e0047 BP |
2049 | rgd->rd_free, rgd->rd_free_clone, rgd->rd_dinodes, |
2050 | rgd->rd_reserved); | |
2051 | spin_lock(&rgd->rd_rsspin); | |
2052 | for (n = rb_first(&rgd->rd_rstree); n; n = rb_next(&trs->rs_node)) { | |
2053 | trs = rb_entry(n, struct gfs2_blkreserv, rs_node); | |
2054 | dump_rs(seq, trs); | |
2055 | } | |
2056 | spin_unlock(&rgd->rd_rsspin); | |
09010978 SW |
2057 | return 0; |
2058 | } | |
2059 | ||
6050b9c7 SW |
2060 | static void gfs2_rgrp_error(struct gfs2_rgrpd *rgd) |
2061 | { | |
2062 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
2063 | fs_warn(sdp, "rgrp %llu has an error, marking it readonly until umount\n", | |
86d00636 | 2064 | (unsigned long long)rgd->rd_addr); |
6050b9c7 SW |
2065 | fs_warn(sdp, "umount on all nodes and run fsck.gfs2 to fix the error\n"); |
2066 | gfs2_rgrp_dump(NULL, rgd->rd_gl); | |
2067 | rgd->rd_flags |= GFS2_RDF_ERROR; | |
2068 | } | |
2069 | ||
8e2e0047 | 2070 | /** |
5b924ae2 SW |
2071 | * gfs2_adjust_reservation - Adjust (or remove) a reservation after allocation |
2072 | * @ip: The inode we have just allocated blocks for | |
2073 | * @rbm: The start of the allocated blocks | |
2074 | * @len: The extent length | |
8e2e0047 | 2075 | * |
5b924ae2 SW |
2076 | * Adjusts a reservation after an allocation has taken place. If the |
2077 | * reservation does not match the allocation, or if it is now empty | |
2078 | * then it is removed. | |
8e2e0047 | 2079 | */ |
5b924ae2 SW |
2080 | |
2081 | static void gfs2_adjust_reservation(struct gfs2_inode *ip, | |
2082 | const struct gfs2_rbm *rbm, unsigned len) | |
8e2e0047 BP |
2083 | { |
2084 | struct gfs2_blkreserv *rs = ip->i_res; | |
5b924ae2 SW |
2085 | struct gfs2_rgrpd *rgd = rbm->rgd; |
2086 | unsigned rlen; | |
2087 | u64 block; | |
2088 | int ret; | |
8e2e0047 | 2089 | |
5b924ae2 SW |
2090 | spin_lock(&rgd->rd_rsspin); |
2091 | if (gfs2_rs_active(rs)) { | |
2092 | if (gfs2_rbm_eq(&rs->rs_rbm, rbm)) { | |
2093 | block = gfs2_rbm_to_block(rbm); | |
2094 | ret = gfs2_rbm_from_block(&rs->rs_rbm, block + len); | |
2095 | rlen = min(rs->rs_free, len); | |
2096 | rs->rs_free -= rlen; | |
2097 | rgd->rd_reserved -= rlen; | |
9e733d39 | 2098 | trace_gfs2_rs(rs, TRACE_RS_CLAIM); |
5b924ae2 SW |
2099 | if (rs->rs_free && !ret) |
2100 | goto out; | |
2101 | } | |
20095218 | 2102 | __rs_deltree(rs); |
8e2e0047 | 2103 | } |
5b924ae2 SW |
2104 | out: |
2105 | spin_unlock(&rgd->rd_rsspin); | |
8e2e0047 BP |
2106 | } |
2107 | ||
09010978 | 2108 | /** |
6e87ed0f | 2109 | * gfs2_alloc_blocks - Allocate one or more blocks of data and/or a dinode |
1639431a | 2110 | * @ip: the inode to allocate the block for |
09010978 | 2111 | * @bn: Used to return the starting block number |
8e2e0047 | 2112 | * @nblocks: requested number of blocks/extent length (value/result) |
6e87ed0f | 2113 | * @dinode: 1 if we're allocating a dinode block, else 0 |
3c5d785a | 2114 | * @generation: the generation number of the inode |
b3b94faa | 2115 | * |
09010978 | 2116 | * Returns: 0 or error |
b3b94faa DT |
2117 | */ |
2118 | ||
6a8099ed | 2119 | int gfs2_alloc_blocks(struct gfs2_inode *ip, u64 *bn, unsigned int *nblocks, |
6e87ed0f | 2120 | bool dinode, u64 *generation) |
b3b94faa | 2121 | { |
feaa7bba | 2122 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
d9ba7615 | 2123 | struct buffer_head *dibh; |
4a993fb1 | 2124 | struct gfs2_rbm rbm = { .rgd = ip->i_rgd, }; |
6a8099ed | 2125 | unsigned int ndata; |
5b924ae2 | 2126 | u64 goal; |
3c5d785a | 2127 | u64 block; /* block, within the file system scope */ |
d9ba7615 | 2128 | int error; |
b3b94faa | 2129 | |
5b924ae2 SW |
2130 | if (gfs2_rs_active(ip->i_res)) |
2131 | goal = gfs2_rbm_to_block(&ip->i_res->rs_rbm); | |
2132 | else if (!dinode && rgrp_contains_block(rbm.rgd, ip->i_goal)) | |
2133 | goal = ip->i_goal; | |
62e252ee | 2134 | else |
5b924ae2 | 2135 | goal = rbm.rgd->rd_last_alloc + rbm.rgd->rd_data0; |
62e252ee | 2136 | |
5b924ae2 | 2137 | gfs2_rbm_from_block(&rbm, goal); |
ff7f4cb4 | 2138 | error = gfs2_rbm_find(&rbm, GFS2_BLKST_FREE, 0, ip, false); |
62e252ee | 2139 | |
137834a6 SW |
2140 | if (error == -ENOSPC) { |
2141 | gfs2_rbm_from_block(&rbm, goal); | |
ff7f4cb4 | 2142 | error = gfs2_rbm_find(&rbm, GFS2_BLKST_FREE, 0, NULL, false); |
137834a6 SW |
2143 | } |
2144 | ||
62e252ee | 2145 | /* Since all blocks are reserved in advance, this shouldn't happen */ |
5b924ae2 | 2146 | if (error) { |
9e733d39 SW |
2147 | fs_warn(sdp, "inum=%llu error=%d, nblocks=%u, full=%d\n", |
2148 | (unsigned long long)ip->i_no_addr, error, *nblocks, | |
5b924ae2 | 2149 | test_bit(GBF_FULL, &rbm.rgd->rd_bits->bi_flags)); |
62e252ee | 2150 | goto rgrp_error; |
8e2e0047 | 2151 | } |
62e252ee | 2152 | |
c04a2ef3 SW |
2153 | gfs2_alloc_extent(&rbm, dinode, nblocks); |
2154 | block = gfs2_rbm_to_block(&rbm); | |
c743ffd0 | 2155 | rbm.rgd->rd_last_alloc = block - rbm.rgd->rd_data0; |
5b924ae2 SW |
2156 | if (gfs2_rs_active(ip->i_res)) |
2157 | gfs2_adjust_reservation(ip, &rbm, *nblocks); | |
6a8099ed SW |
2158 | ndata = *nblocks; |
2159 | if (dinode) | |
2160 | ndata--; | |
b3e47ca0 | 2161 | |
3c5d785a | 2162 | if (!dinode) { |
6a8099ed | 2163 | ip->i_goal = block + ndata - 1; |
3c5d785a BP |
2164 | error = gfs2_meta_inode_buffer(ip, &dibh); |
2165 | if (error == 0) { | |
2166 | struct gfs2_dinode *di = | |
2167 | (struct gfs2_dinode *)dibh->b_data; | |
350a9b0a | 2168 | gfs2_trans_add_meta(ip->i_gl, dibh); |
3c5d785a BP |
2169 | di->di_goal_meta = di->di_goal_data = |
2170 | cpu_to_be64(ip->i_goal); | |
2171 | brelse(dibh); | |
2172 | } | |
d9ba7615 | 2173 | } |
4a993fb1 | 2174 | if (rbm.rgd->rd_free < *nblocks) { |
8e2e0047 | 2175 | printk(KERN_WARNING "nblocks=%u\n", *nblocks); |
09010978 | 2176 | goto rgrp_error; |
8e2e0047 | 2177 | } |
09010978 | 2178 | |
4a993fb1 | 2179 | rbm.rgd->rd_free -= *nblocks; |
3c5d785a | 2180 | if (dinode) { |
4a993fb1 SW |
2181 | rbm.rgd->rd_dinodes++; |
2182 | *generation = rbm.rgd->rd_igeneration++; | |
3c5d785a | 2183 | if (*generation == 0) |
4a993fb1 | 2184 | *generation = rbm.rgd->rd_igeneration++; |
3c5d785a | 2185 | } |
b3b94faa | 2186 | |
350a9b0a | 2187 | gfs2_trans_add_meta(rbm.rgd->rd_gl, rbm.rgd->rd_bits[0].bi_bh); |
4a993fb1 SW |
2188 | gfs2_rgrp_out(rbm.rgd, rbm.rgd->rd_bits[0].bi_bh->b_data); |
2189 | gfs2_rgrp_ondisk2lvb(rbm.rgd->rd_rgl, rbm.rgd->rd_bits[0].bi_bh->b_data); | |
b3b94faa | 2190 | |
6a8099ed | 2191 | gfs2_statfs_change(sdp, 0, -(s64)*nblocks, dinode ? 1 : 0); |
3c5d785a BP |
2192 | if (dinode) |
2193 | gfs2_trans_add_unrevoke(sdp, block, 1); | |
6a8099ed | 2194 | |
fd4b4e04 | 2195 | gfs2_quota_change(ip, *nblocks, ip->i_inode.i_uid, ip->i_inode.i_gid); |
b3b94faa | 2196 | |
4a993fb1 SW |
2197 | rbm.rgd->rd_free_clone -= *nblocks; |
2198 | trace_gfs2_block_alloc(ip, rbm.rgd, block, *nblocks, | |
6e87ed0f | 2199 | dinode ? GFS2_BLKST_DINODE : GFS2_BLKST_USED); |
6050b9c7 SW |
2200 | *bn = block; |
2201 | return 0; | |
2202 | ||
2203 | rgrp_error: | |
4a993fb1 | 2204 | gfs2_rgrp_error(rbm.rgd); |
6050b9c7 | 2205 | return -EIO; |
b3b94faa DT |
2206 | } |
2207 | ||
2208 | /** | |
46fcb2ed | 2209 | * __gfs2_free_blocks - free a contiguous run of block(s) |
b3b94faa DT |
2210 | * @ip: the inode these blocks are being freed from |
2211 | * @bstart: first block of a run of contiguous blocks | |
2212 | * @blen: the length of the block run | |
46fcb2ed | 2213 | * @meta: 1 if the blocks represent metadata |
b3b94faa DT |
2214 | * |
2215 | */ | |
2216 | ||
46fcb2ed | 2217 | void __gfs2_free_blocks(struct gfs2_inode *ip, u64 bstart, u32 blen, int meta) |
b3b94faa | 2218 | { |
feaa7bba | 2219 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
b3b94faa DT |
2220 | struct gfs2_rgrpd *rgd; |
2221 | ||
2222 | rgd = rgblk_free(sdp, bstart, blen, GFS2_BLKST_FREE); | |
2223 | if (!rgd) | |
2224 | return; | |
41db1ab9 | 2225 | trace_gfs2_block_alloc(ip, rgd, bstart, blen, GFS2_BLKST_FREE); |
cfc8b549 | 2226 | rgd->rd_free += blen; |
66fc061b | 2227 | rgd->rd_flags &= ~GFS2_RGF_TRIMMED; |
350a9b0a | 2228 | gfs2_trans_add_meta(rgd->rd_gl, rgd->rd_bits[0].bi_bh); |
42d52e38 | 2229 | gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data); |
90306c41 | 2230 | gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, rgd->rd_bits[0].bi_bh->b_data); |
b3b94faa | 2231 | |
6d3117b4 | 2232 | /* Directories keep their data in the metadata address space */ |
46fcb2ed | 2233 | if (meta || ip->i_depth) |
6d3117b4 | 2234 | gfs2_meta_wipe(ip, bstart, blen); |
4c16c36a | 2235 | } |
b3b94faa | 2236 | |
4c16c36a BP |
2237 | /** |
2238 | * gfs2_free_meta - free a contiguous run of data block(s) | |
2239 | * @ip: the inode these blocks are being freed from | |
2240 | * @bstart: first block of a run of contiguous blocks | |
2241 | * @blen: the length of the block run | |
2242 | * | |
2243 | */ | |
2244 | ||
2245 | void gfs2_free_meta(struct gfs2_inode *ip, u64 bstart, u32 blen) | |
2246 | { | |
2247 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); | |
2248 | ||
46fcb2ed | 2249 | __gfs2_free_blocks(ip, bstart, blen, 1); |
b3b94faa | 2250 | gfs2_statfs_change(sdp, 0, +blen, 0); |
2933f925 | 2251 | gfs2_quota_change(ip, -(s64)blen, ip->i_inode.i_uid, ip->i_inode.i_gid); |
b3b94faa DT |
2252 | } |
2253 | ||
feaa7bba SW |
2254 | void gfs2_unlink_di(struct inode *inode) |
2255 | { | |
2256 | struct gfs2_inode *ip = GFS2_I(inode); | |
2257 | struct gfs2_sbd *sdp = GFS2_SB(inode); | |
2258 | struct gfs2_rgrpd *rgd; | |
dbb7cae2 | 2259 | u64 blkno = ip->i_no_addr; |
feaa7bba SW |
2260 | |
2261 | rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_UNLINKED); | |
2262 | if (!rgd) | |
2263 | return; | |
41db1ab9 | 2264 | trace_gfs2_block_alloc(ip, rgd, blkno, 1, GFS2_BLKST_UNLINKED); |
350a9b0a | 2265 | gfs2_trans_add_meta(rgd->rd_gl, rgd->rd_bits[0].bi_bh); |
42d52e38 | 2266 | gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data); |
90306c41 BM |
2267 | gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, rgd->rd_bits[0].bi_bh->b_data); |
2268 | update_rgrp_lvb_unlinked(rgd, 1); | |
feaa7bba SW |
2269 | } |
2270 | ||
cd915493 | 2271 | static void gfs2_free_uninit_di(struct gfs2_rgrpd *rgd, u64 blkno) |
b3b94faa DT |
2272 | { |
2273 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
2274 | struct gfs2_rgrpd *tmp_rgd; | |
2275 | ||
2276 | tmp_rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_FREE); | |
2277 | if (!tmp_rgd) | |
2278 | return; | |
2279 | gfs2_assert_withdraw(sdp, rgd == tmp_rgd); | |
2280 | ||
73f74948 | 2281 | if (!rgd->rd_dinodes) |
b3b94faa | 2282 | gfs2_consist_rgrpd(rgd); |
73f74948 | 2283 | rgd->rd_dinodes--; |
cfc8b549 | 2284 | rgd->rd_free++; |
b3b94faa | 2285 | |
350a9b0a | 2286 | gfs2_trans_add_meta(rgd->rd_gl, rgd->rd_bits[0].bi_bh); |
42d52e38 | 2287 | gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data); |
90306c41 BM |
2288 | gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, rgd->rd_bits[0].bi_bh->b_data); |
2289 | update_rgrp_lvb_unlinked(rgd, -1); | |
b3b94faa DT |
2290 | |
2291 | gfs2_statfs_change(sdp, 0, +1, -1); | |
b3b94faa DT |
2292 | } |
2293 | ||
b3b94faa DT |
2294 | |
2295 | void gfs2_free_di(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip) | |
2296 | { | |
dbb7cae2 | 2297 | gfs2_free_uninit_di(rgd, ip->i_no_addr); |
41db1ab9 | 2298 | trace_gfs2_block_alloc(ip, rgd, ip->i_no_addr, 1, GFS2_BLKST_FREE); |
2933f925 | 2299 | gfs2_quota_change(ip, -1, ip->i_inode.i_uid, ip->i_inode.i_gid); |
dbb7cae2 | 2300 | gfs2_meta_wipe(ip, ip->i_no_addr, 1); |
b3b94faa DT |
2301 | } |
2302 | ||
acf7e244 SW |
2303 | /** |
2304 | * gfs2_check_blk_type - Check the type of a block | |
2305 | * @sdp: The superblock | |
2306 | * @no_addr: The block number to check | |
2307 | * @type: The block type we are looking for | |
2308 | * | |
2309 | * Returns: 0 if the block type matches the expected type | |
2310 | * -ESTALE if it doesn't match | |
2311 | * or -ve errno if something went wrong while checking | |
2312 | */ | |
2313 | ||
2314 | int gfs2_check_blk_type(struct gfs2_sbd *sdp, u64 no_addr, unsigned int type) | |
2315 | { | |
2316 | struct gfs2_rgrpd *rgd; | |
8339ee54 | 2317 | struct gfs2_holder rgd_gh; |
58884c4d | 2318 | int error = -EINVAL; |
acf7e244 | 2319 | |
66fc061b | 2320 | rgd = gfs2_blk2rgrpd(sdp, no_addr, 1); |
acf7e244 | 2321 | if (!rgd) |
8339ee54 | 2322 | goto fail; |
acf7e244 SW |
2323 | |
2324 | error = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_SHARED, 0, &rgd_gh); | |
2325 | if (error) | |
8339ee54 | 2326 | goto fail; |
acf7e244 SW |
2327 | |
2328 | if (gfs2_get_block_type(rgd, no_addr) != type) | |
2329 | error = -ESTALE; | |
2330 | ||
2331 | gfs2_glock_dq_uninit(&rgd_gh); | |
acf7e244 SW |
2332 | fail: |
2333 | return error; | |
2334 | } | |
2335 | ||
b3b94faa DT |
2336 | /** |
2337 | * gfs2_rlist_add - add a RG to a list of RGs | |
70b0c365 | 2338 | * @ip: the inode |
b3b94faa DT |
2339 | * @rlist: the list of resource groups |
2340 | * @block: the block | |
2341 | * | |
2342 | * Figure out what RG a block belongs to and add that RG to the list | |
2343 | * | |
2344 | * FIXME: Don't use NOFAIL | |
2345 | * | |
2346 | */ | |
2347 | ||
70b0c365 | 2348 | void gfs2_rlist_add(struct gfs2_inode *ip, struct gfs2_rgrp_list *rlist, |
cd915493 | 2349 | u64 block) |
b3b94faa | 2350 | { |
70b0c365 | 2351 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
b3b94faa DT |
2352 | struct gfs2_rgrpd *rgd; |
2353 | struct gfs2_rgrpd **tmp; | |
2354 | unsigned int new_space; | |
2355 | unsigned int x; | |
2356 | ||
2357 | if (gfs2_assert_warn(sdp, !rlist->rl_ghs)) | |
2358 | return; | |
2359 | ||
70b0c365 SW |
2360 | if (ip->i_rgd && rgrp_contains_block(ip->i_rgd, block)) |
2361 | rgd = ip->i_rgd; | |
2362 | else | |
66fc061b | 2363 | rgd = gfs2_blk2rgrpd(sdp, block, 1); |
b3b94faa | 2364 | if (!rgd) { |
70b0c365 | 2365 | fs_err(sdp, "rlist_add: no rgrp for block %llu\n", (unsigned long long)block); |
b3b94faa DT |
2366 | return; |
2367 | } | |
70b0c365 | 2368 | ip->i_rgd = rgd; |
b3b94faa DT |
2369 | |
2370 | for (x = 0; x < rlist->rl_rgrps; x++) | |
2371 | if (rlist->rl_rgd[x] == rgd) | |
2372 | return; | |
2373 | ||
2374 | if (rlist->rl_rgrps == rlist->rl_space) { | |
2375 | new_space = rlist->rl_space + 10; | |
2376 | ||
2377 | tmp = kcalloc(new_space, sizeof(struct gfs2_rgrpd *), | |
dd894be8 | 2378 | GFP_NOFS | __GFP_NOFAIL); |
b3b94faa DT |
2379 | |
2380 | if (rlist->rl_rgd) { | |
2381 | memcpy(tmp, rlist->rl_rgd, | |
2382 | rlist->rl_space * sizeof(struct gfs2_rgrpd *)); | |
2383 | kfree(rlist->rl_rgd); | |
2384 | } | |
2385 | ||
2386 | rlist->rl_space = new_space; | |
2387 | rlist->rl_rgd = tmp; | |
2388 | } | |
2389 | ||
2390 | rlist->rl_rgd[rlist->rl_rgrps++] = rgd; | |
2391 | } | |
2392 | ||
2393 | /** | |
2394 | * gfs2_rlist_alloc - all RGs have been added to the rlist, now allocate | |
2395 | * and initialize an array of glock holders for them | |
2396 | * @rlist: the list of resource groups | |
2397 | * @state: the lock state to acquire the RG lock in | |
b3b94faa DT |
2398 | * |
2399 | * FIXME: Don't use NOFAIL | |
2400 | * | |
2401 | */ | |
2402 | ||
fe6c991c | 2403 | void gfs2_rlist_alloc(struct gfs2_rgrp_list *rlist, unsigned int state) |
b3b94faa DT |
2404 | { |
2405 | unsigned int x; | |
2406 | ||
2407 | rlist->rl_ghs = kcalloc(rlist->rl_rgrps, sizeof(struct gfs2_holder), | |
dd894be8 | 2408 | GFP_NOFS | __GFP_NOFAIL); |
b3b94faa DT |
2409 | for (x = 0; x < rlist->rl_rgrps; x++) |
2410 | gfs2_holder_init(rlist->rl_rgd[x]->rd_gl, | |
fe6c991c | 2411 | state, 0, |
b3b94faa DT |
2412 | &rlist->rl_ghs[x]); |
2413 | } | |
2414 | ||
2415 | /** | |
2416 | * gfs2_rlist_free - free a resource group list | |
2417 | * @list: the list of resource groups | |
2418 | * | |
2419 | */ | |
2420 | ||
2421 | void gfs2_rlist_free(struct gfs2_rgrp_list *rlist) | |
2422 | { | |
2423 | unsigned int x; | |
2424 | ||
2425 | kfree(rlist->rl_rgd); | |
2426 | ||
2427 | if (rlist->rl_ghs) { | |
2428 | for (x = 0; x < rlist->rl_rgrps; x++) | |
2429 | gfs2_holder_uninit(&rlist->rl_ghs[x]); | |
2430 | kfree(rlist->rl_ghs); | |
8e2e0047 | 2431 | rlist->rl_ghs = NULL; |
b3b94faa DT |
2432 | } |
2433 | } | |
2434 |