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> |
b3b94faa DT |
19 | |
20 | #include "gfs2.h" | |
5c676f6d | 21 | #include "incore.h" |
b3b94faa DT |
22 | #include "glock.h" |
23 | #include "glops.h" | |
b3b94faa DT |
24 | #include "lops.h" |
25 | #include "meta_io.h" | |
26 | #include "quota.h" | |
27 | #include "rgrp.h" | |
28 | #include "super.h" | |
29 | #include "trans.h" | |
5c676f6d | 30 | #include "util.h" |
172e045a | 31 | #include "log.h" |
c8cdf479 | 32 | #include "inode.h" |
63997775 | 33 | #include "trace_gfs2.h" |
b3b94faa | 34 | |
2c1e52aa | 35 | #define BFITNOENT ((u32)~0) |
6760bdcd | 36 | #define NO_BLOCK ((u64)~0) |
88c8ab1f | 37 | |
1f466a47 BP |
38 | #if BITS_PER_LONG == 32 |
39 | #define LBITMASK (0x55555555UL) | |
40 | #define LBITSKIP55 (0x55555555UL) | |
41 | #define LBITSKIP00 (0x00000000UL) | |
42 | #else | |
43 | #define LBITMASK (0x5555555555555555UL) | |
44 | #define LBITSKIP55 (0x5555555555555555UL) | |
45 | #define LBITSKIP00 (0x0000000000000000UL) | |
46 | #endif | |
47 | ||
88c8ab1f SW |
48 | /* |
49 | * These routines are used by the resource group routines (rgrp.c) | |
50 | * to keep track of block allocation. Each block is represented by two | |
feaa7bba SW |
51 | * bits. So, each byte represents GFS2_NBBY (i.e. 4) blocks. |
52 | * | |
53 | * 0 = Free | |
54 | * 1 = Used (not metadata) | |
55 | * 2 = Unlinked (still in use) inode | |
56 | * 3 = Used (metadata) | |
88c8ab1f SW |
57 | */ |
58 | ||
59 | static const char valid_change[16] = { | |
60 | /* current */ | |
feaa7bba | 61 | /* n */ 0, 1, 1, 1, |
88c8ab1f | 62 | /* e */ 1, 0, 0, 0, |
feaa7bba | 63 | /* w */ 0, 0, 0, 1, |
88c8ab1f SW |
64 | 1, 0, 0, 0 |
65 | }; | |
66 | ||
c8cdf479 | 67 | static u32 rgblk_search(struct gfs2_rgrpd *rgd, u32 goal, |
6a8099ed | 68 | unsigned char old_state, |
b3e47ca0 | 69 | struct gfs2_bitmap **rbi); |
c8cdf479 | 70 | |
88c8ab1f SW |
71 | /** |
72 | * gfs2_setbit - Set a bit in the bitmaps | |
29c578f5 | 73 | * @rgd: the resource group descriptor |
29c578f5 BP |
74 | * @buf2: the clone buffer that holds the bitmaps |
75 | * @bi: the bitmap structure | |
88c8ab1f SW |
76 | * @block: the block to set |
77 | * @new_state: the new state of the block | |
78 | * | |
79 | */ | |
80 | ||
06344b91 BP |
81 | static inline void gfs2_setbit(struct gfs2_rgrpd *rgd, unsigned char *buf2, |
82 | struct gfs2_bitmap *bi, u32 block, | |
83 | unsigned char new_state) | |
88c8ab1f | 84 | { |
b45e41d7 | 85 | unsigned char *byte1, *byte2, *end, cur_state; |
95c8e17f | 86 | unsigned int buflen = bi->bi_len; |
b45e41d7 | 87 | const unsigned int bit = (block % GFS2_NBBY) * GFS2_BIT_SIZE; |
88c8ab1f | 88 | |
06344b91 BP |
89 | byte1 = bi->bi_bh->b_data + bi->bi_offset + (block / GFS2_NBBY); |
90 | end = bi->bi_bh->b_data + bi->bi_offset + buflen; | |
88c8ab1f | 91 | |
b45e41d7 | 92 | BUG_ON(byte1 >= end); |
88c8ab1f | 93 | |
b45e41d7 | 94 | cur_state = (*byte1 >> bit) & GFS2_BIT_MASK; |
88c8ab1f | 95 | |
b45e41d7 | 96 | if (unlikely(!valid_change[new_state * 4 + cur_state])) { |
95c8e17f BP |
97 | printk(KERN_WARNING "GFS2: buf_blk = 0x%llx old_state=%d, " |
98 | "new_state=%d\n", | |
99 | (unsigned long long)block, cur_state, new_state); | |
100 | printk(KERN_WARNING "GFS2: rgrp=0x%llx bi_start=0x%lx\n", | |
101 | (unsigned long long)rgd->rd_addr, | |
102 | (unsigned long)bi->bi_start); | |
103 | printk(KERN_WARNING "GFS2: bi_offset=0x%lx bi_len=0x%lx\n", | |
104 | (unsigned long)bi->bi_offset, | |
105 | (unsigned long)bi->bi_len); | |
106 | dump_stack(); | |
88c8ab1f | 107 | gfs2_consist_rgrpd(rgd); |
b45e41d7 SW |
108 | return; |
109 | } | |
110 | *byte1 ^= (cur_state ^ new_state) << bit; | |
111 | ||
112 | if (buf2) { | |
29c578f5 | 113 | byte2 = buf2 + bi->bi_offset + (block / GFS2_NBBY); |
b45e41d7 SW |
114 | cur_state = (*byte2 >> bit) & GFS2_BIT_MASK; |
115 | *byte2 ^= (cur_state ^ new_state) << bit; | |
116 | } | |
88c8ab1f SW |
117 | } |
118 | ||
119 | /** | |
120 | * gfs2_testbit - test a bit in the bitmaps | |
886b1416 | 121 | * @rgd: the resource group descriptor |
88c8ab1f SW |
122 | * @buffer: the buffer that holds the bitmaps |
123 | * @buflen: the length (in bytes) of the buffer | |
124 | * @block: the block to read | |
125 | * | |
126 | */ | |
127 | ||
b45e41d7 SW |
128 | static inline unsigned char gfs2_testbit(struct gfs2_rgrpd *rgd, |
129 | const unsigned char *buffer, | |
130 | unsigned int buflen, u32 block) | |
88c8ab1f | 131 | { |
b45e41d7 SW |
132 | const unsigned char *byte, *end; |
133 | unsigned char cur_state; | |
88c8ab1f SW |
134 | unsigned int bit; |
135 | ||
136 | byte = buffer + (block / GFS2_NBBY); | |
137 | bit = (block % GFS2_NBBY) * GFS2_BIT_SIZE; | |
138 | end = buffer + buflen; | |
139 | ||
140 | gfs2_assert(rgd->rd_sbd, byte < end); | |
141 | ||
142 | cur_state = (*byte >> bit) & GFS2_BIT_MASK; | |
143 | ||
144 | return cur_state; | |
145 | } | |
146 | ||
223b2b88 SW |
147 | /** |
148 | * gfs2_bit_search | |
149 | * @ptr: Pointer to bitmap data | |
150 | * @mask: Mask to use (normally 0x55555.... but adjusted for search start) | |
151 | * @state: The state we are searching for | |
152 | * | |
153 | * We xor the bitmap data with a patter which is the bitwise opposite | |
154 | * of what we are looking for, this gives rise to a pattern of ones | |
155 | * wherever there is a match. Since we have two bits per entry, we | |
156 | * take this pattern, shift it down by one place and then and it with | |
157 | * the original. All the even bit positions (0,2,4, etc) then represent | |
158 | * successful matches, so we mask with 0x55555..... to remove the unwanted | |
159 | * odd bit positions. | |
160 | * | |
161 | * This allows searching of a whole u64 at once (32 blocks) with a | |
162 | * single test (on 64 bit arches). | |
163 | */ | |
164 | ||
165 | static inline u64 gfs2_bit_search(const __le64 *ptr, u64 mask, u8 state) | |
166 | { | |
167 | u64 tmp; | |
168 | static const u64 search[] = { | |
075ac448 HE |
169 | [0] = 0xffffffffffffffffULL, |
170 | [1] = 0xaaaaaaaaaaaaaaaaULL, | |
171 | [2] = 0x5555555555555555ULL, | |
172 | [3] = 0x0000000000000000ULL, | |
223b2b88 SW |
173 | }; |
174 | tmp = le64_to_cpu(*ptr) ^ search[state]; | |
175 | tmp &= (tmp >> 1); | |
176 | tmp &= mask; | |
177 | return tmp; | |
178 | } | |
179 | ||
88c8ab1f SW |
180 | /** |
181 | * gfs2_bitfit - Search an rgrp's bitmap buffer to find a bit-pair representing | |
182 | * a block in a given allocation state. | |
886b1416 | 183 | * @buf: the buffer that holds the bitmaps |
223b2b88 | 184 | * @len: the length (in bytes) of the buffer |
88c8ab1f | 185 | * @goal: start search at this block's bit-pair (within @buffer) |
223b2b88 | 186 | * @state: GFS2_BLKST_XXX the state of the block we're looking for. |
88c8ab1f SW |
187 | * |
188 | * Scope of @goal and returned block number is only within this bitmap buffer, | |
189 | * not entire rgrp or filesystem. @buffer will be offset from the actual | |
223b2b88 SW |
190 | * beginning of a bitmap block buffer, skipping any header structures, but |
191 | * headers are always a multiple of 64 bits long so that the buffer is | |
192 | * always aligned to a 64 bit boundary. | |
193 | * | |
194 | * The size of the buffer is in bytes, but is it assumed that it is | |
fd589a8f | 195 | * always ok to read a complete multiple of 64 bits at the end |
223b2b88 | 196 | * of the block in case the end is no aligned to a natural boundary. |
88c8ab1f SW |
197 | * |
198 | * Return: the block number (bitmap buffer scope) that was found | |
199 | */ | |
200 | ||
02ab1721 HE |
201 | static u32 gfs2_bitfit(const u8 *buf, const unsigned int len, |
202 | u32 goal, u8 state) | |
88c8ab1f | 203 | { |
223b2b88 SW |
204 | u32 spoint = (goal << 1) & ((8*sizeof(u64)) - 1); |
205 | const __le64 *ptr = ((__le64 *)buf) + (goal >> 5); | |
206 | const __le64 *end = (__le64 *)(buf + ALIGN(len, sizeof(u64))); | |
207 | u64 tmp; | |
075ac448 | 208 | u64 mask = 0x5555555555555555ULL; |
223b2b88 SW |
209 | u32 bit; |
210 | ||
211 | BUG_ON(state > 3); | |
212 | ||
213 | /* Mask off bits we don't care about at the start of the search */ | |
214 | mask <<= spoint; | |
215 | tmp = gfs2_bit_search(ptr, mask, state); | |
216 | ptr++; | |
217 | while(tmp == 0 && ptr < end) { | |
075ac448 | 218 | tmp = gfs2_bit_search(ptr, 0x5555555555555555ULL, state); |
223b2b88 | 219 | ptr++; |
1f466a47 | 220 | } |
223b2b88 SW |
221 | /* Mask off any bits which are more than len bytes from the start */ |
222 | if (ptr == end && (len & (sizeof(u64) - 1))) | |
223 | tmp &= (((u64)~0) >> (64 - 8*(len & (sizeof(u64) - 1)))); | |
224 | /* Didn't find anything, so return */ | |
225 | if (tmp == 0) | |
226 | return BFITNOENT; | |
227 | ptr--; | |
d8bd504a | 228 | bit = __ffs64(tmp); |
223b2b88 SW |
229 | bit /= 2; /* two bits per entry in the bitmap */ |
230 | return (((const unsigned char *)ptr - buf) * GFS2_NBBY) + bit; | |
88c8ab1f SW |
231 | } |
232 | ||
233 | /** | |
234 | * gfs2_bitcount - count the number of bits in a certain state | |
886b1416 | 235 | * @rgd: the resource group descriptor |
88c8ab1f SW |
236 | * @buffer: the buffer that holds the bitmaps |
237 | * @buflen: the length (in bytes) of the buffer | |
238 | * @state: the state of the block we're looking for | |
239 | * | |
240 | * Returns: The number of bits | |
241 | */ | |
242 | ||
110acf38 SW |
243 | static u32 gfs2_bitcount(struct gfs2_rgrpd *rgd, const u8 *buffer, |
244 | unsigned int buflen, u8 state) | |
88c8ab1f | 245 | { |
110acf38 SW |
246 | const u8 *byte = buffer; |
247 | const u8 *end = buffer + buflen; | |
248 | const u8 state1 = state << 2; | |
249 | const u8 state2 = state << 4; | |
250 | const u8 state3 = state << 6; | |
cd915493 | 251 | u32 count = 0; |
88c8ab1f SW |
252 | |
253 | for (; byte < end; byte++) { | |
254 | if (((*byte) & 0x03) == state) | |
255 | count++; | |
256 | if (((*byte) & 0x0C) == state1) | |
257 | count++; | |
258 | if (((*byte) & 0x30) == state2) | |
259 | count++; | |
260 | if (((*byte) & 0xC0) == state3) | |
261 | count++; | |
262 | } | |
263 | ||
264 | return count; | |
265 | } | |
266 | ||
b3b94faa DT |
267 | /** |
268 | * gfs2_rgrp_verify - Verify that a resource group is consistent | |
b3b94faa DT |
269 | * @rgd: the rgrp |
270 | * | |
271 | */ | |
272 | ||
273 | void gfs2_rgrp_verify(struct gfs2_rgrpd *rgd) | |
274 | { | |
275 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
276 | struct gfs2_bitmap *bi = NULL; | |
bb8d8a6f | 277 | u32 length = rgd->rd_length; |
cd915493 | 278 | u32 count[4], tmp; |
b3b94faa DT |
279 | int buf, x; |
280 | ||
cd915493 | 281 | memset(count, 0, 4 * sizeof(u32)); |
b3b94faa DT |
282 | |
283 | /* Count # blocks in each of 4 possible allocation states */ | |
284 | for (buf = 0; buf < length; buf++) { | |
285 | bi = rgd->rd_bits + buf; | |
286 | for (x = 0; x < 4; x++) | |
287 | count[x] += gfs2_bitcount(rgd, | |
288 | bi->bi_bh->b_data + | |
289 | bi->bi_offset, | |
290 | bi->bi_len, x); | |
291 | } | |
292 | ||
cfc8b549 | 293 | if (count[0] != rgd->rd_free) { |
b3b94faa DT |
294 | if (gfs2_consist_rgrpd(rgd)) |
295 | fs_err(sdp, "free data mismatch: %u != %u\n", | |
cfc8b549 | 296 | count[0], rgd->rd_free); |
b3b94faa DT |
297 | return; |
298 | } | |
299 | ||
73f74948 | 300 | tmp = rgd->rd_data - rgd->rd_free - rgd->rd_dinodes; |
6b946170 | 301 | if (count[1] != tmp) { |
b3b94faa DT |
302 | if (gfs2_consist_rgrpd(rgd)) |
303 | fs_err(sdp, "used data mismatch: %u != %u\n", | |
304 | count[1], tmp); | |
305 | return; | |
306 | } | |
307 | ||
6b946170 | 308 | if (count[2] + count[3] != rgd->rd_dinodes) { |
b3b94faa | 309 | if (gfs2_consist_rgrpd(rgd)) |
feaa7bba | 310 | fs_err(sdp, "used metadata mismatch: %u != %u\n", |
6b946170 | 311 | count[2] + count[3], rgd->rd_dinodes); |
b3b94faa DT |
312 | return; |
313 | } | |
b3b94faa DT |
314 | } |
315 | ||
bb8d8a6f | 316 | static inline int rgrp_contains_block(struct gfs2_rgrpd *rgd, u64 block) |
b3b94faa | 317 | { |
bb8d8a6f SW |
318 | u64 first = rgd->rd_data0; |
319 | u64 last = first + rgd->rd_data; | |
16910427 | 320 | return first <= block && block < last; |
b3b94faa DT |
321 | } |
322 | ||
323 | /** | |
324 | * gfs2_blk2rgrpd - Find resource group for a given data/meta block number | |
325 | * @sdp: The GFS2 superblock | |
886b1416 BP |
326 | * @blk: The data block number |
327 | * @exact: True if this needs to be an exact match | |
b3b94faa DT |
328 | * |
329 | * Returns: The resource group, or NULL if not found | |
330 | */ | |
331 | ||
66fc061b | 332 | struct gfs2_rgrpd *gfs2_blk2rgrpd(struct gfs2_sbd *sdp, u64 blk, bool exact) |
b3b94faa | 333 | { |
66fc061b | 334 | struct rb_node *n, *next; |
f75bbfb4 | 335 | struct gfs2_rgrpd *cur; |
b3b94faa DT |
336 | |
337 | spin_lock(&sdp->sd_rindex_spin); | |
66fc061b SW |
338 | n = sdp->sd_rindex_tree.rb_node; |
339 | while (n) { | |
340 | cur = rb_entry(n, struct gfs2_rgrpd, rd_node); | |
341 | next = NULL; | |
7c9ca621 | 342 | if (blk < cur->rd_addr) |
66fc061b | 343 | next = n->rb_left; |
f75bbfb4 | 344 | else if (blk >= cur->rd_data0 + cur->rd_data) |
66fc061b SW |
345 | next = n->rb_right; |
346 | if (next == NULL) { | |
b3b94faa | 347 | spin_unlock(&sdp->sd_rindex_spin); |
66fc061b SW |
348 | if (exact) { |
349 | if (blk < cur->rd_addr) | |
350 | return NULL; | |
351 | if (blk >= cur->rd_data0 + cur->rd_data) | |
352 | return NULL; | |
353 | } | |
7c9ca621 | 354 | return cur; |
b3b94faa | 355 | } |
66fc061b | 356 | n = next; |
b3b94faa | 357 | } |
b3b94faa DT |
358 | spin_unlock(&sdp->sd_rindex_spin); |
359 | ||
360 | return NULL; | |
361 | } | |
362 | ||
363 | /** | |
364 | * gfs2_rgrpd_get_first - get the first Resource Group in the filesystem | |
365 | * @sdp: The GFS2 superblock | |
366 | * | |
367 | * Returns: The first rgrp in the filesystem | |
368 | */ | |
369 | ||
370 | struct gfs2_rgrpd *gfs2_rgrpd_get_first(struct gfs2_sbd *sdp) | |
371 | { | |
7c9ca621 BP |
372 | const struct rb_node *n; |
373 | struct gfs2_rgrpd *rgd; | |
374 | ||
8339ee54 | 375 | spin_lock(&sdp->sd_rindex_spin); |
7c9ca621 BP |
376 | n = rb_first(&sdp->sd_rindex_tree); |
377 | rgd = rb_entry(n, struct gfs2_rgrpd, rd_node); | |
8339ee54 | 378 | spin_unlock(&sdp->sd_rindex_spin); |
7c9ca621 BP |
379 | |
380 | return rgd; | |
b3b94faa DT |
381 | } |
382 | ||
383 | /** | |
384 | * gfs2_rgrpd_get_next - get the next RG | |
886b1416 | 385 | * @rgd: the resource group descriptor |
b3b94faa DT |
386 | * |
387 | * Returns: The next rgrp | |
388 | */ | |
389 | ||
390 | struct gfs2_rgrpd *gfs2_rgrpd_get_next(struct gfs2_rgrpd *rgd) | |
391 | { | |
7c9ca621 BP |
392 | struct gfs2_sbd *sdp = rgd->rd_sbd; |
393 | const struct rb_node *n; | |
394 | ||
395 | spin_lock(&sdp->sd_rindex_spin); | |
396 | n = rb_next(&rgd->rd_node); | |
397 | if (n == NULL) | |
398 | n = rb_first(&sdp->sd_rindex_tree); | |
399 | ||
400 | if (unlikely(&rgd->rd_node == n)) { | |
401 | spin_unlock(&sdp->sd_rindex_spin); | |
b3b94faa | 402 | return NULL; |
7c9ca621 BP |
403 | } |
404 | rgd = rb_entry(n, struct gfs2_rgrpd, rd_node); | |
405 | spin_unlock(&sdp->sd_rindex_spin); | |
406 | return rgd; | |
b3b94faa DT |
407 | } |
408 | ||
8339ee54 SW |
409 | void gfs2_free_clones(struct gfs2_rgrpd *rgd) |
410 | { | |
411 | int x; | |
412 | ||
413 | for (x = 0; x < rgd->rd_length; x++) { | |
414 | struct gfs2_bitmap *bi = rgd->rd_bits + x; | |
415 | kfree(bi->bi_clone); | |
416 | bi->bi_clone = NULL; | |
417 | } | |
418 | } | |
419 | ||
0a305e49 BP |
420 | /** |
421 | * gfs2_rs_alloc - make sure we have a reservation assigned to the inode | |
422 | * @ip: the inode for this reservation | |
423 | */ | |
424 | int gfs2_rs_alloc(struct gfs2_inode *ip) | |
425 | { | |
426 | int error = 0; | |
427 | ||
428 | down_write(&ip->i_rw_mutex); | |
429 | if (!ip->i_res) { | |
430 | ip->i_res = kmem_cache_zalloc(gfs2_rsrv_cachep, GFP_NOFS); | |
431 | if (!ip->i_res) | |
432 | error = -ENOMEM; | |
433 | } | |
434 | up_write(&ip->i_rw_mutex); | |
435 | return error; | |
436 | } | |
437 | ||
438 | /** | |
439 | * gfs2_rs_delete - delete a reservation | |
440 | * @ip: The inode for this reservation | |
441 | * | |
442 | */ | |
443 | void gfs2_rs_delete(struct gfs2_inode *ip) | |
444 | { | |
445 | down_write(&ip->i_rw_mutex); | |
446 | if (ip->i_res) { | |
447 | kmem_cache_free(gfs2_rsrv_cachep, ip->i_res); | |
448 | ip->i_res = NULL; | |
449 | } | |
450 | up_write(&ip->i_rw_mutex); | |
451 | } | |
452 | ||
8339ee54 | 453 | void gfs2_clear_rgrpd(struct gfs2_sbd *sdp) |
b3b94faa | 454 | { |
7c9ca621 | 455 | struct rb_node *n; |
b3b94faa DT |
456 | struct gfs2_rgrpd *rgd; |
457 | struct gfs2_glock *gl; | |
458 | ||
7c9ca621 BP |
459 | while ((n = rb_first(&sdp->sd_rindex_tree))) { |
460 | rgd = rb_entry(n, struct gfs2_rgrpd, rd_node); | |
b3b94faa DT |
461 | gl = rgd->rd_gl; |
462 | ||
7c9ca621 | 463 | rb_erase(n, &sdp->sd_rindex_tree); |
b3b94faa DT |
464 | |
465 | if (gl) { | |
8339ee54 | 466 | spin_lock(&gl->gl_spin); |
5c676f6d | 467 | gl->gl_object = NULL; |
8339ee54 | 468 | spin_unlock(&gl->gl_spin); |
29687a2a | 469 | gfs2_glock_add_to_lru(gl); |
b3b94faa DT |
470 | gfs2_glock_put(gl); |
471 | } | |
472 | ||
8339ee54 | 473 | gfs2_free_clones(rgd); |
b3b94faa | 474 | kfree(rgd->rd_bits); |
6bdd9be6 | 475 | kmem_cache_free(gfs2_rgrpd_cachep, rgd); |
b3b94faa DT |
476 | } |
477 | } | |
478 | ||
bb8d8a6f SW |
479 | static void gfs2_rindex_print(const struct gfs2_rgrpd *rgd) |
480 | { | |
481 | printk(KERN_INFO " ri_addr = %llu\n", (unsigned long long)rgd->rd_addr); | |
482 | printk(KERN_INFO " ri_length = %u\n", rgd->rd_length); | |
483 | printk(KERN_INFO " ri_data0 = %llu\n", (unsigned long long)rgd->rd_data0); | |
484 | printk(KERN_INFO " ri_data = %u\n", rgd->rd_data); | |
485 | printk(KERN_INFO " ri_bitbytes = %u\n", rgd->rd_bitbytes); | |
486 | } | |
487 | ||
b3b94faa DT |
488 | /** |
489 | * gfs2_compute_bitstructs - Compute the bitmap sizes | |
490 | * @rgd: The resource group descriptor | |
491 | * | |
492 | * Calculates bitmap descriptors, one for each block that contains bitmap data | |
493 | * | |
494 | * Returns: errno | |
495 | */ | |
496 | ||
497 | static int compute_bitstructs(struct gfs2_rgrpd *rgd) | |
498 | { | |
499 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
500 | struct gfs2_bitmap *bi; | |
bb8d8a6f | 501 | u32 length = rgd->rd_length; /* # blocks in hdr & bitmap */ |
cd915493 | 502 | u32 bytes_left, bytes; |
b3b94faa DT |
503 | int x; |
504 | ||
feaa7bba SW |
505 | if (!length) |
506 | return -EINVAL; | |
507 | ||
dd894be8 | 508 | rgd->rd_bits = kcalloc(length, sizeof(struct gfs2_bitmap), GFP_NOFS); |
b3b94faa DT |
509 | if (!rgd->rd_bits) |
510 | return -ENOMEM; | |
511 | ||
bb8d8a6f | 512 | bytes_left = rgd->rd_bitbytes; |
b3b94faa DT |
513 | |
514 | for (x = 0; x < length; x++) { | |
515 | bi = rgd->rd_bits + x; | |
516 | ||
60a0b8f9 | 517 | bi->bi_flags = 0; |
b3b94faa DT |
518 | /* small rgrp; bitmap stored completely in header block */ |
519 | if (length == 1) { | |
520 | bytes = bytes_left; | |
521 | bi->bi_offset = sizeof(struct gfs2_rgrp); | |
522 | bi->bi_start = 0; | |
523 | bi->bi_len = bytes; | |
524 | /* header block */ | |
525 | } else if (x == 0) { | |
526 | bytes = sdp->sd_sb.sb_bsize - sizeof(struct gfs2_rgrp); | |
527 | bi->bi_offset = sizeof(struct gfs2_rgrp); | |
528 | bi->bi_start = 0; | |
529 | bi->bi_len = bytes; | |
530 | /* last block */ | |
531 | } else if (x + 1 == length) { | |
532 | bytes = bytes_left; | |
533 | bi->bi_offset = sizeof(struct gfs2_meta_header); | |
bb8d8a6f | 534 | bi->bi_start = rgd->rd_bitbytes - bytes_left; |
b3b94faa DT |
535 | bi->bi_len = bytes; |
536 | /* other blocks */ | |
537 | } else { | |
568f4c96 SW |
538 | bytes = sdp->sd_sb.sb_bsize - |
539 | sizeof(struct gfs2_meta_header); | |
b3b94faa | 540 | bi->bi_offset = sizeof(struct gfs2_meta_header); |
bb8d8a6f | 541 | bi->bi_start = rgd->rd_bitbytes - bytes_left; |
b3b94faa DT |
542 | bi->bi_len = bytes; |
543 | } | |
544 | ||
545 | bytes_left -= bytes; | |
546 | } | |
547 | ||
548 | if (bytes_left) { | |
549 | gfs2_consist_rgrpd(rgd); | |
550 | return -EIO; | |
551 | } | |
552 | bi = rgd->rd_bits + (length - 1); | |
bb8d8a6f | 553 | if ((bi->bi_start + bi->bi_len) * GFS2_NBBY != rgd->rd_data) { |
b3b94faa | 554 | if (gfs2_consist_rgrpd(rgd)) { |
bb8d8a6f | 555 | gfs2_rindex_print(rgd); |
b3b94faa DT |
556 | fs_err(sdp, "start=%u len=%u offset=%u\n", |
557 | bi->bi_start, bi->bi_len, bi->bi_offset); | |
558 | } | |
559 | return -EIO; | |
560 | } | |
561 | ||
562 | return 0; | |
563 | } | |
564 | ||
7ae8fa84 RP |
565 | /** |
566 | * gfs2_ri_total - Total up the file system space, according to the rindex. | |
886b1416 | 567 | * @sdp: the filesystem |
7ae8fa84 RP |
568 | * |
569 | */ | |
570 | u64 gfs2_ri_total(struct gfs2_sbd *sdp) | |
571 | { | |
572 | u64 total_data = 0; | |
573 | struct inode *inode = sdp->sd_rindex; | |
574 | struct gfs2_inode *ip = GFS2_I(inode); | |
7ae8fa84 | 575 | char buf[sizeof(struct gfs2_rindex)]; |
7ae8fa84 RP |
576 | int error, rgrps; |
577 | ||
7ae8fa84 RP |
578 | for (rgrps = 0;; rgrps++) { |
579 | loff_t pos = rgrps * sizeof(struct gfs2_rindex); | |
580 | ||
bcd7278d | 581 | if (pos + sizeof(struct gfs2_rindex) > i_size_read(inode)) |
7ae8fa84 | 582 | break; |
4306629e | 583 | error = gfs2_internal_read(ip, buf, &pos, |
7ae8fa84 RP |
584 | sizeof(struct gfs2_rindex)); |
585 | if (error != sizeof(struct gfs2_rindex)) | |
586 | break; | |
bb8d8a6f | 587 | total_data += be32_to_cpu(((struct gfs2_rindex *)buf)->ri_data); |
7ae8fa84 | 588 | } |
7ae8fa84 RP |
589 | return total_data; |
590 | } | |
591 | ||
6aad1c3d | 592 | static int rgd_insert(struct gfs2_rgrpd *rgd) |
7c9ca621 BP |
593 | { |
594 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
595 | struct rb_node **newn = &sdp->sd_rindex_tree.rb_node, *parent = NULL; | |
596 | ||
597 | /* Figure out where to put new node */ | |
598 | while (*newn) { | |
599 | struct gfs2_rgrpd *cur = rb_entry(*newn, struct gfs2_rgrpd, | |
600 | rd_node); | |
601 | ||
602 | parent = *newn; | |
603 | if (rgd->rd_addr < cur->rd_addr) | |
604 | newn = &((*newn)->rb_left); | |
605 | else if (rgd->rd_addr > cur->rd_addr) | |
606 | newn = &((*newn)->rb_right); | |
607 | else | |
6aad1c3d | 608 | return -EEXIST; |
7c9ca621 BP |
609 | } |
610 | ||
611 | rb_link_node(&rgd->rd_node, parent, newn); | |
612 | rb_insert_color(&rgd->rd_node, &sdp->sd_rindex_tree); | |
6aad1c3d BP |
613 | sdp->sd_rgrps++; |
614 | return 0; | |
7c9ca621 BP |
615 | } |
616 | ||
b3b94faa | 617 | /** |
6c53267f | 618 | * read_rindex_entry - Pull in a new resource index entry from the disk |
4306629e | 619 | * @ip: Pointer to the rindex inode |
b3b94faa | 620 | * |
8339ee54 | 621 | * Returns: 0 on success, > 0 on EOF, error code otherwise |
6c53267f RP |
622 | */ |
623 | ||
4306629e | 624 | static int read_rindex_entry(struct gfs2_inode *ip) |
6c53267f RP |
625 | { |
626 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); | |
627 | loff_t pos = sdp->sd_rgrps * sizeof(struct gfs2_rindex); | |
8339ee54 | 628 | struct gfs2_rindex buf; |
6c53267f RP |
629 | int error; |
630 | struct gfs2_rgrpd *rgd; | |
631 | ||
8339ee54 SW |
632 | if (pos >= i_size_read(&ip->i_inode)) |
633 | return 1; | |
634 | ||
4306629e | 635 | error = gfs2_internal_read(ip, (char *)&buf, &pos, |
6c53267f | 636 | sizeof(struct gfs2_rindex)); |
8339ee54 SW |
637 | |
638 | if (error != sizeof(struct gfs2_rindex)) | |
639 | return (error == 0) ? 1 : error; | |
6c53267f | 640 | |
6bdd9be6 | 641 | rgd = kmem_cache_zalloc(gfs2_rgrpd_cachep, GFP_NOFS); |
6c53267f RP |
642 | error = -ENOMEM; |
643 | if (!rgd) | |
644 | return error; | |
645 | ||
6c53267f | 646 | rgd->rd_sbd = sdp; |
8339ee54 SW |
647 | rgd->rd_addr = be64_to_cpu(buf.ri_addr); |
648 | rgd->rd_length = be32_to_cpu(buf.ri_length); | |
649 | rgd->rd_data0 = be64_to_cpu(buf.ri_data0); | |
650 | rgd->rd_data = be32_to_cpu(buf.ri_data); | |
651 | rgd->rd_bitbytes = be32_to_cpu(buf.ri_bitbytes); | |
7c9ca621 | 652 | |
6c53267f RP |
653 | error = compute_bitstructs(rgd); |
654 | if (error) | |
8339ee54 | 655 | goto fail; |
6c53267f | 656 | |
bb8d8a6f | 657 | error = gfs2_glock_get(sdp, rgd->rd_addr, |
6c53267f RP |
658 | &gfs2_rgrp_glops, CREATE, &rgd->rd_gl); |
659 | if (error) | |
8339ee54 | 660 | goto fail; |
6c53267f RP |
661 | |
662 | rgd->rd_gl->gl_object = rgd; | |
90306c41 | 663 | rgd->rd_rgl = (struct gfs2_rgrp_lvb *)rgd->rd_gl->gl_lvb; |
cf45b752 | 664 | rgd->rd_flags &= ~GFS2_RDF_UPTODATE; |
7c9ca621 BP |
665 | if (rgd->rd_data > sdp->sd_max_rg_data) |
666 | sdp->sd_max_rg_data = rgd->rd_data; | |
8339ee54 | 667 | spin_lock(&sdp->sd_rindex_spin); |
6aad1c3d | 668 | error = rgd_insert(rgd); |
8339ee54 | 669 | spin_unlock(&sdp->sd_rindex_spin); |
6aad1c3d BP |
670 | if (!error) |
671 | return 0; | |
672 | ||
673 | error = 0; /* someone else read in the rgrp; free it and ignore it */ | |
c1ac539e | 674 | gfs2_glock_put(rgd->rd_gl); |
8339ee54 SW |
675 | |
676 | fail: | |
677 | kfree(rgd->rd_bits); | |
678 | kmem_cache_free(gfs2_rgrpd_cachep, rgd); | |
6c53267f RP |
679 | return error; |
680 | } | |
681 | ||
682 | /** | |
683 | * gfs2_ri_update - Pull in a new resource index from the disk | |
684 | * @ip: pointer to the rindex inode | |
685 | * | |
b3b94faa DT |
686 | * Returns: 0 on successful update, error code otherwise |
687 | */ | |
688 | ||
8339ee54 | 689 | static int gfs2_ri_update(struct gfs2_inode *ip) |
b3b94faa | 690 | { |
feaa7bba | 691 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
b3b94faa DT |
692 | int error; |
693 | ||
8339ee54 | 694 | do { |
4306629e | 695 | error = read_rindex_entry(ip); |
8339ee54 SW |
696 | } while (error == 0); |
697 | ||
698 | if (error < 0) | |
699 | return error; | |
b3b94faa | 700 | |
cf45b752 | 701 | sdp->sd_rindex_uptodate = 1; |
6c53267f RP |
702 | return 0; |
703 | } | |
b3b94faa | 704 | |
b3b94faa | 705 | /** |
8339ee54 | 706 | * gfs2_rindex_update - Update the rindex if required |
b3b94faa | 707 | * @sdp: The GFS2 superblock |
b3b94faa DT |
708 | * |
709 | * We grab a lock on the rindex inode to make sure that it doesn't | |
710 | * change whilst we are performing an operation. We keep this lock | |
711 | * for quite long periods of time compared to other locks. This | |
712 | * doesn't matter, since it is shared and it is very, very rarely | |
713 | * accessed in the exclusive mode (i.e. only when expanding the filesystem). | |
714 | * | |
715 | * This makes sure that we're using the latest copy of the resource index | |
716 | * special file, which might have been updated if someone expanded the | |
717 | * filesystem (via gfs2_grow utility), which adds new resource groups. | |
718 | * | |
8339ee54 | 719 | * Returns: 0 on succeess, error code otherwise |
b3b94faa DT |
720 | */ |
721 | ||
8339ee54 | 722 | int gfs2_rindex_update(struct gfs2_sbd *sdp) |
b3b94faa | 723 | { |
feaa7bba | 724 | struct gfs2_inode *ip = GFS2_I(sdp->sd_rindex); |
b3b94faa | 725 | struct gfs2_glock *gl = ip->i_gl; |
8339ee54 SW |
726 | struct gfs2_holder ri_gh; |
727 | int error = 0; | |
a365fbf3 | 728 | int unlock_required = 0; |
b3b94faa DT |
729 | |
730 | /* Read new copy from disk if we don't have the latest */ | |
cf45b752 | 731 | if (!sdp->sd_rindex_uptodate) { |
a365fbf3 SW |
732 | if (!gfs2_glock_is_locked_by_me(gl)) { |
733 | error = gfs2_glock_nq_init(gl, LM_ST_SHARED, 0, &ri_gh); | |
734 | if (error) | |
6aad1c3d | 735 | return error; |
a365fbf3 SW |
736 | unlock_required = 1; |
737 | } | |
8339ee54 | 738 | if (!sdp->sd_rindex_uptodate) |
b3b94faa | 739 | error = gfs2_ri_update(ip); |
a365fbf3 SW |
740 | if (unlock_required) |
741 | gfs2_glock_dq_uninit(&ri_gh); | |
b3b94faa DT |
742 | } |
743 | ||
744 | return error; | |
745 | } | |
746 | ||
42d52e38 | 747 | static void gfs2_rgrp_in(struct gfs2_rgrpd *rgd, const void *buf) |
bb8d8a6f SW |
748 | { |
749 | const struct gfs2_rgrp *str = buf; | |
42d52e38 | 750 | u32 rg_flags; |
bb8d8a6f | 751 | |
42d52e38 | 752 | rg_flags = be32_to_cpu(str->rg_flags); |
09010978 | 753 | rg_flags &= ~GFS2_RDF_MASK; |
1ce97e56 SW |
754 | rgd->rd_flags &= GFS2_RDF_MASK; |
755 | rgd->rd_flags |= rg_flags; | |
cfc8b549 | 756 | rgd->rd_free = be32_to_cpu(str->rg_free); |
73f74948 | 757 | rgd->rd_dinodes = be32_to_cpu(str->rg_dinodes); |
d8b71f73 | 758 | rgd->rd_igeneration = be64_to_cpu(str->rg_igeneration); |
bb8d8a6f SW |
759 | } |
760 | ||
42d52e38 | 761 | static void gfs2_rgrp_out(struct gfs2_rgrpd *rgd, void *buf) |
bb8d8a6f SW |
762 | { |
763 | struct gfs2_rgrp *str = buf; | |
764 | ||
09010978 | 765 | str->rg_flags = cpu_to_be32(rgd->rd_flags & ~GFS2_RDF_MASK); |
cfc8b549 | 766 | str->rg_free = cpu_to_be32(rgd->rd_free); |
73f74948 | 767 | str->rg_dinodes = cpu_to_be32(rgd->rd_dinodes); |
bb8d8a6f | 768 | str->__pad = cpu_to_be32(0); |
d8b71f73 | 769 | str->rg_igeneration = cpu_to_be64(rgd->rd_igeneration); |
bb8d8a6f SW |
770 | memset(&str->rg_reserved, 0, sizeof(str->rg_reserved)); |
771 | } | |
772 | ||
90306c41 BM |
773 | static int gfs2_rgrp_lvb_valid(struct gfs2_rgrpd *rgd) |
774 | { | |
775 | struct gfs2_rgrp_lvb *rgl = rgd->rd_rgl; | |
776 | struct gfs2_rgrp *str = (struct gfs2_rgrp *)rgd->rd_bits[0].bi_bh->b_data; | |
777 | ||
778 | if (rgl->rl_flags != str->rg_flags || rgl->rl_free != str->rg_free || | |
779 | rgl->rl_dinodes != str->rg_dinodes || | |
780 | rgl->rl_igeneration != str->rg_igeneration) | |
781 | return 0; | |
782 | return 1; | |
783 | } | |
784 | ||
785 | static void gfs2_rgrp_ondisk2lvb(struct gfs2_rgrp_lvb *rgl, const void *buf) | |
786 | { | |
787 | const struct gfs2_rgrp *str = buf; | |
788 | ||
789 | rgl->rl_magic = cpu_to_be32(GFS2_MAGIC); | |
790 | rgl->rl_flags = str->rg_flags; | |
791 | rgl->rl_free = str->rg_free; | |
792 | rgl->rl_dinodes = str->rg_dinodes; | |
793 | rgl->rl_igeneration = str->rg_igeneration; | |
794 | rgl->__pad = 0UL; | |
795 | } | |
796 | ||
797 | static void update_rgrp_lvb_unlinked(struct gfs2_rgrpd *rgd, u32 change) | |
798 | { | |
799 | struct gfs2_rgrp_lvb *rgl = rgd->rd_rgl; | |
800 | u32 unlinked = be32_to_cpu(rgl->rl_unlinked) + change; | |
801 | rgl->rl_unlinked = cpu_to_be32(unlinked); | |
802 | } | |
803 | ||
804 | static u32 count_unlinked(struct gfs2_rgrpd *rgd) | |
805 | { | |
806 | struct gfs2_bitmap *bi; | |
807 | const u32 length = rgd->rd_length; | |
808 | const u8 *buffer = NULL; | |
809 | u32 i, goal, count = 0; | |
810 | ||
811 | for (i = 0, bi = rgd->rd_bits; i < length; i++, bi++) { | |
812 | goal = 0; | |
813 | buffer = bi->bi_bh->b_data + bi->bi_offset; | |
814 | WARN_ON(!buffer_uptodate(bi->bi_bh)); | |
815 | while (goal < bi->bi_len * GFS2_NBBY) { | |
816 | goal = gfs2_bitfit(buffer, bi->bi_len, goal, | |
817 | GFS2_BLKST_UNLINKED); | |
818 | if (goal == BFITNOENT) | |
819 | break; | |
820 | count++; | |
821 | goal++; | |
822 | } | |
823 | } | |
824 | ||
825 | return count; | |
826 | } | |
827 | ||
828 | ||
b3b94faa | 829 | /** |
90306c41 BM |
830 | * gfs2_rgrp_bh_get - Read in a RG's header and bitmaps |
831 | * @rgd: the struct gfs2_rgrpd describing the RG to read in | |
b3b94faa DT |
832 | * |
833 | * Read in all of a Resource Group's header and bitmap blocks. | |
834 | * Caller must eventually call gfs2_rgrp_relse() to free the bitmaps. | |
835 | * | |
836 | * Returns: errno | |
837 | */ | |
838 | ||
90306c41 | 839 | int gfs2_rgrp_bh_get(struct gfs2_rgrpd *rgd) |
b3b94faa DT |
840 | { |
841 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
842 | struct gfs2_glock *gl = rgd->rd_gl; | |
bb8d8a6f | 843 | unsigned int length = rgd->rd_length; |
b3b94faa DT |
844 | struct gfs2_bitmap *bi; |
845 | unsigned int x, y; | |
846 | int error; | |
847 | ||
90306c41 BM |
848 | if (rgd->rd_bits[0].bi_bh != NULL) |
849 | return 0; | |
850 | ||
b3b94faa DT |
851 | for (x = 0; x < length; x++) { |
852 | bi = rgd->rd_bits + x; | |
bb8d8a6f | 853 | error = gfs2_meta_read(gl, rgd->rd_addr + x, 0, &bi->bi_bh); |
b3b94faa DT |
854 | if (error) |
855 | goto fail; | |
856 | } | |
857 | ||
858 | for (y = length; y--;) { | |
859 | bi = rgd->rd_bits + y; | |
7276b3b0 | 860 | error = gfs2_meta_wait(sdp, bi->bi_bh); |
b3b94faa DT |
861 | if (error) |
862 | goto fail; | |
feaa7bba | 863 | if (gfs2_metatype_check(sdp, bi->bi_bh, y ? GFS2_METATYPE_RB : |
b3b94faa DT |
864 | GFS2_METATYPE_RG)) { |
865 | error = -EIO; | |
866 | goto fail; | |
867 | } | |
868 | } | |
869 | ||
cf45b752 | 870 | if (!(rgd->rd_flags & GFS2_RDF_UPTODATE)) { |
60a0b8f9 SW |
871 | for (x = 0; x < length; x++) |
872 | clear_bit(GBF_FULL, &rgd->rd_bits[x].bi_flags); | |
42d52e38 | 873 | gfs2_rgrp_in(rgd, (rgd->rd_bits[0].bi_bh)->b_data); |
1ce97e56 | 874 | rgd->rd_flags |= (GFS2_RDF_UPTODATE | GFS2_RDF_CHECK); |
7c9ca621 | 875 | rgd->rd_free_clone = rgd->rd_free; |
b3b94faa | 876 | } |
90306c41 BM |
877 | if (be32_to_cpu(GFS2_MAGIC) != rgd->rd_rgl->rl_magic) { |
878 | rgd->rd_rgl->rl_unlinked = cpu_to_be32(count_unlinked(rgd)); | |
879 | gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, | |
880 | rgd->rd_bits[0].bi_bh->b_data); | |
881 | } | |
882 | else if (sdp->sd_args.ar_rgrplvb) { | |
883 | if (!gfs2_rgrp_lvb_valid(rgd)){ | |
884 | gfs2_consist_rgrpd(rgd); | |
885 | error = -EIO; | |
886 | goto fail; | |
887 | } | |
888 | if (rgd->rd_rgl->rl_unlinked == 0) | |
889 | rgd->rd_flags &= ~GFS2_RDF_CHECK; | |
890 | } | |
b3b94faa DT |
891 | return 0; |
892 | ||
feaa7bba | 893 | fail: |
b3b94faa DT |
894 | while (x--) { |
895 | bi = rgd->rd_bits + x; | |
896 | brelse(bi->bi_bh); | |
897 | bi->bi_bh = NULL; | |
898 | gfs2_assert_warn(sdp, !bi->bi_clone); | |
899 | } | |
b3b94faa DT |
900 | |
901 | return error; | |
902 | } | |
903 | ||
90306c41 BM |
904 | int update_rgrp_lvb(struct gfs2_rgrpd *rgd) |
905 | { | |
906 | u32 rl_flags; | |
907 | ||
908 | if (rgd->rd_flags & GFS2_RDF_UPTODATE) | |
909 | return 0; | |
910 | ||
911 | if (be32_to_cpu(GFS2_MAGIC) != rgd->rd_rgl->rl_magic) | |
912 | return gfs2_rgrp_bh_get(rgd); | |
913 | ||
914 | rl_flags = be32_to_cpu(rgd->rd_rgl->rl_flags); | |
915 | rl_flags &= ~GFS2_RDF_MASK; | |
916 | rgd->rd_flags &= GFS2_RDF_MASK; | |
917 | rgd->rd_flags |= (rl_flags | GFS2_RDF_UPTODATE | GFS2_RDF_CHECK); | |
918 | if (rgd->rd_rgl->rl_unlinked == 0) | |
919 | rgd->rd_flags &= ~GFS2_RDF_CHECK; | |
920 | rgd->rd_free = be32_to_cpu(rgd->rd_rgl->rl_free); | |
921 | rgd->rd_free_clone = rgd->rd_free; | |
922 | rgd->rd_dinodes = be32_to_cpu(rgd->rd_rgl->rl_dinodes); | |
923 | rgd->rd_igeneration = be64_to_cpu(rgd->rd_rgl->rl_igeneration); | |
924 | return 0; | |
925 | } | |
926 | ||
927 | int gfs2_rgrp_go_lock(struct gfs2_holder *gh) | |
928 | { | |
929 | struct gfs2_rgrpd *rgd = gh->gh_gl->gl_object; | |
930 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
931 | ||
932 | if (gh->gh_flags & GL_SKIP && sdp->sd_args.ar_rgrplvb) | |
933 | return 0; | |
934 | return gfs2_rgrp_bh_get((struct gfs2_rgrpd *)gh->gh_gl->gl_object); | |
935 | } | |
936 | ||
b3b94faa | 937 | /** |
7c9ca621 | 938 | * gfs2_rgrp_go_unlock - Release RG bitmaps read in with gfs2_rgrp_bh_get() |
886b1416 | 939 | * @gh: The glock holder for the resource group |
b3b94faa DT |
940 | * |
941 | */ | |
942 | ||
7c9ca621 | 943 | void gfs2_rgrp_go_unlock(struct gfs2_holder *gh) |
b3b94faa | 944 | { |
7c9ca621 | 945 | struct gfs2_rgrpd *rgd = gh->gh_gl->gl_object; |
bb8d8a6f | 946 | int x, length = rgd->rd_length; |
b3b94faa | 947 | |
b3b94faa DT |
948 | for (x = 0; x < length; x++) { |
949 | struct gfs2_bitmap *bi = rgd->rd_bits + x; | |
90306c41 BM |
950 | if (bi->bi_bh) { |
951 | brelse(bi->bi_bh); | |
952 | bi->bi_bh = NULL; | |
953 | } | |
b3b94faa DT |
954 | } |
955 | ||
b3b94faa DT |
956 | } |
957 | ||
66fc061b | 958 | int gfs2_rgrp_send_discards(struct gfs2_sbd *sdp, u64 offset, |
7c9ca621 | 959 | struct buffer_head *bh, |
66fc061b | 960 | const struct gfs2_bitmap *bi, unsigned minlen, u64 *ptrimmed) |
f15ab561 SW |
961 | { |
962 | struct super_block *sb = sdp->sd_vfs; | |
963 | struct block_device *bdev = sb->s_bdev; | |
964 | const unsigned int sects_per_blk = sdp->sd_sb.sb_bsize / | |
e1defc4f | 965 | bdev_logical_block_size(sb->s_bdev); |
f15ab561 | 966 | u64 blk; |
64d576ba | 967 | sector_t start = 0; |
f15ab561 SW |
968 | sector_t nr_sects = 0; |
969 | int rv; | |
970 | unsigned int x; | |
66fc061b SW |
971 | u32 trimmed = 0; |
972 | u8 diff; | |
f15ab561 SW |
973 | |
974 | for (x = 0; x < bi->bi_len; x++) { | |
66fc061b SW |
975 | const u8 *clone = bi->bi_clone ? bi->bi_clone : bi->bi_bh->b_data; |
976 | clone += bi->bi_offset; | |
977 | clone += x; | |
978 | if (bh) { | |
979 | const u8 *orig = bh->b_data + bi->bi_offset + x; | |
980 | diff = ~(*orig | (*orig >> 1)) & (*clone | (*clone >> 1)); | |
981 | } else { | |
982 | diff = ~(*clone | (*clone >> 1)); | |
983 | } | |
f15ab561 SW |
984 | diff &= 0x55; |
985 | if (diff == 0) | |
986 | continue; | |
987 | blk = offset + ((bi->bi_start + x) * GFS2_NBBY); | |
988 | blk *= sects_per_blk; /* convert to sectors */ | |
989 | while(diff) { | |
990 | if (diff & 1) { | |
991 | if (nr_sects == 0) | |
992 | goto start_new_extent; | |
993 | if ((start + nr_sects) != blk) { | |
66fc061b SW |
994 | if (nr_sects >= minlen) { |
995 | rv = blkdev_issue_discard(bdev, | |
996 | start, nr_sects, | |
997 | GFP_NOFS, 0); | |
998 | if (rv) | |
999 | goto fail; | |
1000 | trimmed += nr_sects; | |
1001 | } | |
f15ab561 SW |
1002 | nr_sects = 0; |
1003 | start_new_extent: | |
1004 | start = blk; | |
1005 | } | |
1006 | nr_sects += sects_per_blk; | |
1007 | } | |
1008 | diff >>= 2; | |
1009 | blk += sects_per_blk; | |
1010 | } | |
1011 | } | |
66fc061b | 1012 | if (nr_sects >= minlen) { |
dd3932ed | 1013 | rv = blkdev_issue_discard(bdev, start, nr_sects, GFP_NOFS, 0); |
f15ab561 SW |
1014 | if (rv) |
1015 | goto fail; | |
66fc061b | 1016 | trimmed += nr_sects; |
f15ab561 | 1017 | } |
66fc061b SW |
1018 | if (ptrimmed) |
1019 | *ptrimmed = trimmed; | |
1020 | return 0; | |
1021 | ||
f15ab561 | 1022 | fail: |
66fc061b SW |
1023 | if (sdp->sd_args.ar_discard) |
1024 | fs_warn(sdp, "error %d on discard request, turning discards off for this filesystem", rv); | |
f15ab561 | 1025 | sdp->sd_args.ar_discard = 0; |
66fc061b SW |
1026 | return -EIO; |
1027 | } | |
1028 | ||
1029 | /** | |
1030 | * gfs2_fitrim - Generate discard requests for unused bits of the filesystem | |
1031 | * @filp: Any file on the filesystem | |
1032 | * @argp: Pointer to the arguments (also used to pass result) | |
1033 | * | |
1034 | * Returns: 0 on success, otherwise error code | |
1035 | */ | |
1036 | ||
1037 | int gfs2_fitrim(struct file *filp, void __user *argp) | |
1038 | { | |
1039 | struct inode *inode = filp->f_dentry->d_inode; | |
1040 | struct gfs2_sbd *sdp = GFS2_SB(inode); | |
1041 | struct request_queue *q = bdev_get_queue(sdp->sd_vfs->s_bdev); | |
1042 | struct buffer_head *bh; | |
1043 | struct gfs2_rgrpd *rgd; | |
1044 | struct gfs2_rgrpd *rgd_end; | |
1045 | struct gfs2_holder gh; | |
1046 | struct fstrim_range r; | |
1047 | int ret = 0; | |
1048 | u64 amt; | |
1049 | u64 trimmed = 0; | |
1050 | unsigned int x; | |
1051 | ||
1052 | if (!capable(CAP_SYS_ADMIN)) | |
1053 | return -EPERM; | |
1054 | ||
1055 | if (!blk_queue_discard(q)) | |
1056 | return -EOPNOTSUPP; | |
1057 | ||
66fc061b SW |
1058 | if (argp == NULL) { |
1059 | r.start = 0; | |
1060 | r.len = ULLONG_MAX; | |
1061 | r.minlen = 0; | |
1062 | } else if (copy_from_user(&r, argp, sizeof(r))) | |
1063 | return -EFAULT; | |
1064 | ||
5e2f7d61 BP |
1065 | ret = gfs2_rindex_update(sdp); |
1066 | if (ret) | |
1067 | return ret; | |
1068 | ||
66fc061b SW |
1069 | rgd = gfs2_blk2rgrpd(sdp, r.start, 0); |
1070 | rgd_end = gfs2_blk2rgrpd(sdp, r.start + r.len, 0); | |
1071 | ||
1072 | while (1) { | |
1073 | ||
1074 | ret = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_EXCLUSIVE, 0, &gh); | |
1075 | if (ret) | |
1076 | goto out; | |
1077 | ||
1078 | if (!(rgd->rd_flags & GFS2_RGF_TRIMMED)) { | |
1079 | /* Trim each bitmap in the rgrp */ | |
1080 | for (x = 0; x < rgd->rd_length; x++) { | |
1081 | struct gfs2_bitmap *bi = rgd->rd_bits + x; | |
1082 | ret = gfs2_rgrp_send_discards(sdp, rgd->rd_data0, NULL, bi, r.minlen, &amt); | |
1083 | if (ret) { | |
1084 | gfs2_glock_dq_uninit(&gh); | |
1085 | goto out; | |
1086 | } | |
1087 | trimmed += amt; | |
1088 | } | |
1089 | ||
1090 | /* Mark rgrp as having been trimmed */ | |
1091 | ret = gfs2_trans_begin(sdp, RES_RG_HDR, 0); | |
1092 | if (ret == 0) { | |
1093 | bh = rgd->rd_bits[0].bi_bh; | |
1094 | rgd->rd_flags |= GFS2_RGF_TRIMMED; | |
1095 | gfs2_trans_add_bh(rgd->rd_gl, bh, 1); | |
1096 | gfs2_rgrp_out(rgd, bh->b_data); | |
90306c41 | 1097 | gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, bh->b_data); |
66fc061b SW |
1098 | gfs2_trans_end(sdp); |
1099 | } | |
1100 | } | |
1101 | gfs2_glock_dq_uninit(&gh); | |
1102 | ||
1103 | if (rgd == rgd_end) | |
1104 | break; | |
1105 | ||
1106 | rgd = gfs2_rgrpd_get_next(rgd); | |
1107 | } | |
1108 | ||
1109 | out: | |
1110 | r.len = trimmed << 9; | |
1111 | if (argp && copy_to_user(argp, &r, sizeof(r))) | |
1112 | return -EFAULT; | |
1113 | ||
1114 | return ret; | |
f15ab561 SW |
1115 | } |
1116 | ||
b3b94faa DT |
1117 | /** |
1118 | * try_rgrp_fit - See if a given reservation will fit in a given RG | |
1119 | * @rgd: the RG data | |
54335b1f | 1120 | * @ip: the inode |
b3b94faa DT |
1121 | * |
1122 | * If there's room for the requested blocks to be allocated from the RG: | |
b3b94faa DT |
1123 | * |
1124 | * Returns: 1 on success (it fits), 0 on failure (it doesn't fit) | |
1125 | */ | |
1126 | ||
54335b1f | 1127 | static int try_rgrp_fit(const struct gfs2_rgrpd *rgd, const struct gfs2_inode *ip) |
b3b94faa | 1128 | { |
564e12b1 | 1129 | const struct gfs2_blkreserv *rs = ip->i_res; |
54335b1f | 1130 | |
09010978 | 1131 | if (rgd->rd_flags & (GFS2_RGF_NOALLOC | GFS2_RDF_ERROR)) |
a43a4906 | 1132 | return 0; |
564e12b1 | 1133 | if (rgd->rd_free_clone >= rs->rs_requested) |
7c9ca621 | 1134 | return 1; |
7c9ca621 | 1135 | return 0; |
b3b94faa DT |
1136 | } |
1137 | ||
b3e47ca0 BP |
1138 | static inline u32 gfs2_bi2rgd_blk(struct gfs2_bitmap *bi, u32 blk) |
1139 | { | |
1140 | return (bi->bi_start * GFS2_NBBY) + blk; | |
1141 | } | |
1142 | ||
c8cdf479 SW |
1143 | /** |
1144 | * try_rgrp_unlink - Look for any unlinked, allocated, but unused inodes | |
1145 | * @rgd: The rgrp | |
886b1416 BP |
1146 | * @last_unlinked: block address of the last dinode we unlinked |
1147 | * @skip: block address we should explicitly not unlink | |
c8cdf479 | 1148 | * |
1a0eae88 BP |
1149 | * Returns: 0 if no error |
1150 | * The inode, if one has been found, in inode. | |
c8cdf479 SW |
1151 | */ |
1152 | ||
044b9414 | 1153 | static void try_rgrp_unlink(struct gfs2_rgrpd *rgd, u64 *last_unlinked, u64 skip) |
c8cdf479 | 1154 | { |
6760bdcd | 1155 | u32 goal = 0, block; |
bb9bcf06 | 1156 | u64 no_addr; |
5f3eae75 | 1157 | struct gfs2_sbd *sdp = rgd->rd_sbd; |
044b9414 SW |
1158 | struct gfs2_glock *gl; |
1159 | struct gfs2_inode *ip; | |
1160 | int error; | |
1161 | int found = 0; | |
b3e47ca0 | 1162 | struct gfs2_bitmap *bi; |
c8cdf479 | 1163 | |
044b9414 | 1164 | while (goal < rgd->rd_data) { |
5f3eae75 | 1165 | down_write(&sdp->sd_log_flush_lock); |
6a8099ed | 1166 | block = rgblk_search(rgd, goal, GFS2_BLKST_UNLINKED, &bi); |
5f3eae75 | 1167 | up_write(&sdp->sd_log_flush_lock); |
6760bdcd | 1168 | if (block == BFITNOENT) |
24c73873 | 1169 | break; |
b3e47ca0 BP |
1170 | |
1171 | block = gfs2_bi2rgd_blk(bi, block); | |
6760bdcd BP |
1172 | /* rgblk_search can return a block < goal, so we need to |
1173 | keep it marching forward. */ | |
1174 | no_addr = block + rgd->rd_data0; | |
44ad37d6 | 1175 | goal = max(block + 1, goal + 1); |
6760bdcd | 1176 | if (*last_unlinked != NO_BLOCK && no_addr <= *last_unlinked) |
c8cdf479 | 1177 | continue; |
1e19a195 SW |
1178 | if (no_addr == skip) |
1179 | continue; | |
bb9bcf06 | 1180 | *last_unlinked = no_addr; |
044b9414 SW |
1181 | |
1182 | error = gfs2_glock_get(sdp, no_addr, &gfs2_inode_glops, CREATE, &gl); | |
1183 | if (error) | |
1184 | continue; | |
1185 | ||
1186 | /* If the inode is already in cache, we can ignore it here | |
1187 | * because the existing inode disposal code will deal with | |
1188 | * it when all refs have gone away. Accessing gl_object like | |
1189 | * this is not safe in general. Here it is ok because we do | |
1190 | * not dereference the pointer, and we only need an approx | |
1191 | * answer to whether it is NULL or not. | |
1192 | */ | |
1193 | ip = gl->gl_object; | |
1194 | ||
1195 | if (ip || queue_work(gfs2_delete_workqueue, &gl->gl_delete) == 0) | |
1196 | gfs2_glock_put(gl); | |
1197 | else | |
1198 | found++; | |
1199 | ||
1200 | /* Limit reclaim to sensible number of tasks */ | |
44ad37d6 | 1201 | if (found > NR_CPUS) |
044b9414 | 1202 | return; |
c8cdf479 SW |
1203 | } |
1204 | ||
1205 | rgd->rd_flags &= ~GFS2_RDF_CHECK; | |
044b9414 | 1206 | return; |
c8cdf479 SW |
1207 | } |
1208 | ||
b3b94faa | 1209 | /** |
666d1d8a | 1210 | * gfs2_inplace_reserve - Reserve space in the filesystem |
b3b94faa | 1211 | * @ip: the inode to reserve space for |
666d1d8a | 1212 | * @requested: the number of blocks to be reserved |
b3b94faa DT |
1213 | * |
1214 | * Returns: errno | |
1215 | */ | |
1216 | ||
666d1d8a | 1217 | int gfs2_inplace_reserve(struct gfs2_inode *ip, u32 requested) |
b3b94faa | 1218 | { |
feaa7bba | 1219 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
b3b94faa | 1220 | struct gfs2_rgrpd *rgd, *begin = NULL; |
564e12b1 | 1221 | struct gfs2_blkreserv *rs = ip->i_res; |
666d1d8a BP |
1222 | int error = 0, rg_locked, flags = LM_FLAG_TRY; |
1223 | u64 last_unlinked = NO_BLOCK; | |
7c9ca621 | 1224 | int loops = 0; |
b3b94faa | 1225 | |
90306c41 BM |
1226 | if (sdp->sd_args.ar_rgrplvb) |
1227 | flags |= GL_SKIP; | |
666d1d8a BP |
1228 | rs = ip->i_res; |
1229 | rs->rs_requested = requested; | |
1230 | if (gfs2_assert_warn(sdp, requested)) { | |
1231 | error = -EINVAL; | |
1232 | goto out; | |
1233 | } | |
90306c41 | 1234 | |
54335b1f SW |
1235 | if (ip->i_rgd && rgrp_contains_block(ip->i_rgd, ip->i_goal)) |
1236 | rgd = begin = ip->i_rgd; | |
1237 | else | |
66fc061b | 1238 | rgd = begin = gfs2_blk2rgrpd(sdp, ip->i_goal, 1); |
b3b94faa | 1239 | |
7c9ca621 BP |
1240 | if (rgd == NULL) |
1241 | return -EBADSLT; | |
1242 | ||
1243 | while (loops < 3) { | |
292c8c14 AD |
1244 | rg_locked = 0; |
1245 | ||
1246 | if (gfs2_glock_is_locked_by_me(rgd->rd_gl)) { | |
1247 | rg_locked = 1; | |
1248 | error = 0; | |
1249 | } else { | |
1250 | error = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_EXCLUSIVE, | |
564e12b1 | 1251 | flags, &rs->rs_rgd_gh); |
90306c41 BM |
1252 | if (!error && sdp->sd_args.ar_rgrplvb) { |
1253 | error = update_rgrp_lvb(rgd); | |
1254 | if (error) { | |
1255 | gfs2_glock_dq_uninit(&rs->rs_rgd_gh); | |
1256 | return error; | |
1257 | } | |
1258 | } | |
292c8c14 | 1259 | } |
b3b94faa DT |
1260 | switch (error) { |
1261 | case 0: | |
54335b1f | 1262 | if (try_rgrp_fit(rgd, ip)) { |
90306c41 BM |
1263 | if (sdp->sd_args.ar_rgrplvb) |
1264 | gfs2_rgrp_bh_get(rgd); | |
54335b1f | 1265 | ip->i_rgd = rgd; |
7c9ca621 | 1266 | return 0; |
54335b1f | 1267 | } |
90306c41 BM |
1268 | if (rgd->rd_flags & GFS2_RDF_CHECK) { |
1269 | if (sdp->sd_args.ar_rgrplvb) | |
1270 | gfs2_rgrp_bh_get(rgd); | |
666d1d8a BP |
1271 | try_rgrp_unlink(rgd, &last_unlinked, |
1272 | ip->i_no_addr); | |
90306c41 | 1273 | } |
292c8c14 | 1274 | if (!rg_locked) |
564e12b1 | 1275 | gfs2_glock_dq_uninit(&rs->rs_rgd_gh); |
9cabcdbd | 1276 | /* fall through */ |
b3b94faa | 1277 | case GLR_TRYFAILED: |
7c9ca621 | 1278 | rgd = gfs2_rgrpd_get_next(rgd); |
294f2ad5 | 1279 | rgd = rgd ? : begin; /* if NULL, wrap */ |
666d1d8a BP |
1280 | if (rgd != begin) /* If we didn't wrap */ |
1281 | break; | |
1282 | ||
1283 | flags &= ~LM_FLAG_TRY; | |
1284 | loops++; | |
1285 | /* Check that fs hasn't grown if writing to rindex */ | |
1286 | if (ip == GFS2_I(sdp->sd_rindex) && | |
1287 | !sdp->sd_rindex_uptodate) { | |
1288 | error = gfs2_ri_update(ip); | |
1289 | if (error) | |
1290 | goto out; | |
1291 | } else if (loops == 2) | |
1292 | /* Flushing the log may release space */ | |
1293 | gfs2_log_flush(sdp, NULL); | |
b3b94faa | 1294 | break; |
b3b94faa | 1295 | default: |
666d1d8a | 1296 | goto out; |
b3b94faa | 1297 | } |
b3b94faa | 1298 | } |
666d1d8a | 1299 | error = -ENOSPC; |
b3b94faa | 1300 | |
564e12b1 BP |
1301 | out: |
1302 | if (error) | |
0a305e49 | 1303 | rs->rs_requested = 0; |
9ae32429 | 1304 | return error; |
b3b94faa DT |
1305 | } |
1306 | ||
1307 | /** | |
1308 | * gfs2_inplace_release - release an inplace reservation | |
1309 | * @ip: the inode the reservation was taken out on | |
1310 | * | |
1311 | * Release a reservation made by gfs2_inplace_reserve(). | |
1312 | */ | |
1313 | ||
1314 | void gfs2_inplace_release(struct gfs2_inode *ip) | |
1315 | { | |
564e12b1 | 1316 | struct gfs2_blkreserv *rs = ip->i_res; |
b3b94faa | 1317 | |
564e12b1 BP |
1318 | if (rs->rs_rgd_gh.gh_gl) |
1319 | gfs2_glock_dq_uninit(&rs->rs_rgd_gh); | |
0a305e49 | 1320 | rs->rs_requested = 0; |
b3b94faa DT |
1321 | } |
1322 | ||
1323 | /** | |
1324 | * gfs2_get_block_type - Check a block in a RG is of given type | |
1325 | * @rgd: the resource group holding the block | |
1326 | * @block: the block number | |
1327 | * | |
1328 | * Returns: The block type (GFS2_BLKST_*) | |
1329 | */ | |
1330 | ||
acf7e244 | 1331 | static unsigned char gfs2_get_block_type(struct gfs2_rgrpd *rgd, u64 block) |
b3b94faa DT |
1332 | { |
1333 | struct gfs2_bitmap *bi = NULL; | |
cd915493 | 1334 | u32 length, rgrp_block, buf_block; |
b3b94faa DT |
1335 | unsigned int buf; |
1336 | unsigned char type; | |
1337 | ||
bb8d8a6f SW |
1338 | length = rgd->rd_length; |
1339 | rgrp_block = block - rgd->rd_data0; | |
b3b94faa DT |
1340 | |
1341 | for (buf = 0; buf < length; buf++) { | |
1342 | bi = rgd->rd_bits + buf; | |
1343 | if (rgrp_block < (bi->bi_start + bi->bi_len) * GFS2_NBBY) | |
1344 | break; | |
1345 | } | |
1346 | ||
1347 | gfs2_assert(rgd->rd_sbd, buf < length); | |
1348 | buf_block = rgrp_block - bi->bi_start * GFS2_NBBY; | |
1349 | ||
feaa7bba | 1350 | type = gfs2_testbit(rgd, bi->bi_bh->b_data + bi->bi_offset, |
b3b94faa DT |
1351 | bi->bi_len, buf_block); |
1352 | ||
1353 | return type; | |
1354 | } | |
1355 | ||
1356 | /** | |
6a8099ed | 1357 | * rgblk_search - find a block in @state |
b3b94faa DT |
1358 | * @rgd: the resource group descriptor |
1359 | * @goal: the goal block within the RG (start here to search for avail block) | |
6a8099ed | 1360 | * @state: GFS2_BLKST_XXX the before-allocation state to find |
b3e47ca0 | 1361 | * @rbi: address of the pointer to the bitmap containing the block found |
b3b94faa | 1362 | * |
6a8099ed | 1363 | * Walk rgrp's bitmap to find bits that represent a block in @state. |
b3b94faa DT |
1364 | * |
1365 | * This function never fails, because we wouldn't call it unless we | |
1366 | * know (from reservation results, etc.) that a block is available. | |
1367 | * | |
b3e47ca0 BP |
1368 | * Scope of @goal is just within rgrp, not the whole filesystem. |
1369 | * Scope of @returned block is just within bitmap, not the whole filesystem. | |
b3b94faa | 1370 | * |
b3e47ca0 | 1371 | * Returns: the block number found relative to the bitmap rbi |
b3b94faa DT |
1372 | */ |
1373 | ||
886b1416 | 1374 | static u32 rgblk_search(struct gfs2_rgrpd *rgd, u32 goal, unsigned char state, |
b3e47ca0 | 1375 | struct gfs2_bitmap **rbi) |
b3b94faa DT |
1376 | { |
1377 | struct gfs2_bitmap *bi = NULL; | |
b45e41d7 | 1378 | const u32 length = rgd->rd_length; |
9598d25e | 1379 | u32 biblk = BFITNOENT; |
b3b94faa | 1380 | unsigned int buf, x; |
60a0b8f9 | 1381 | const u8 *buffer = NULL; |
b3b94faa | 1382 | |
b3e47ca0 | 1383 | *rbi = NULL; |
b3b94faa DT |
1384 | /* Find bitmap block that contains bits for goal block */ |
1385 | for (buf = 0; buf < length; buf++) { | |
1386 | bi = rgd->rd_bits + buf; | |
60a0b8f9 SW |
1387 | /* Convert scope of "goal" from rgrp-wide to within found bit block */ |
1388 | if (goal < (bi->bi_start + bi->bi_len) * GFS2_NBBY) { | |
1389 | goal -= bi->bi_start * GFS2_NBBY; | |
1390 | goto do_search; | |
1391 | } | |
b3b94faa | 1392 | } |
60a0b8f9 SW |
1393 | buf = 0; |
1394 | goal = 0; | |
b3b94faa | 1395 | |
60a0b8f9 | 1396 | do_search: |
b3b94faa DT |
1397 | /* Search (up to entire) bitmap in this rgrp for allocatable block. |
1398 | "x <= length", instead of "x < length", because we typically start | |
1399 | the search in the middle of a bit block, but if we can't find an | |
1400 | allocatable block anywhere else, we want to be able wrap around and | |
1401 | search in the first part of our first-searched bit block. */ | |
1402 | for (x = 0; x <= length; x++) { | |
60a0b8f9 SW |
1403 | bi = rgd->rd_bits + buf; |
1404 | ||
1405 | if (test_bit(GBF_FULL, &bi->bi_flags) && | |
6a8099ed | 1406 | (state == GFS2_BLKST_FREE)) |
60a0b8f9 SW |
1407 | goto skip; |
1408 | ||
5f3eae75 BP |
1409 | /* The GFS2_BLKST_UNLINKED state doesn't apply to the clone |
1410 | bitmaps, so we must search the originals for that. */ | |
b45e41d7 | 1411 | buffer = bi->bi_bh->b_data + bi->bi_offset; |
7c9ca621 | 1412 | WARN_ON(!buffer_uptodate(bi->bi_bh)); |
6a8099ed | 1413 | if (state != GFS2_BLKST_UNLINKED && bi->bi_clone) |
110acf38 SW |
1414 | buffer = bi->bi_clone + bi->bi_offset; |
1415 | ||
9598d25e BP |
1416 | biblk = gfs2_bitfit(buffer, bi->bi_len, goal, state); |
1417 | if (biblk != BFITNOENT) | |
b3b94faa DT |
1418 | break; |
1419 | ||
6a8099ed | 1420 | if ((goal == 0) && (state == GFS2_BLKST_FREE)) |
60a0b8f9 SW |
1421 | set_bit(GBF_FULL, &bi->bi_flags); |
1422 | ||
b3b94faa | 1423 | /* Try next bitmap block (wrap back to rgrp header if at end) */ |
60a0b8f9 SW |
1424 | skip: |
1425 | buf++; | |
1426 | buf %= length; | |
b3b94faa DT |
1427 | goal = 0; |
1428 | } | |
1429 | ||
9598d25e | 1430 | if (biblk != BFITNOENT) |
b3e47ca0 | 1431 | *rbi = bi; |
7c9ca621 | 1432 | |
9598d25e | 1433 | return biblk; |
b3e47ca0 | 1434 | } |
60a0b8f9 | 1435 | |
b3e47ca0 BP |
1436 | /** |
1437 | * gfs2_alloc_extent - allocate an extent from a given bitmap | |
1438 | * @rgd: the resource group descriptor | |
1439 | * @bi: the bitmap within the rgrp | |
1440 | * @blk: the block within the bitmap | |
1441 | * @dinode: TRUE if the first block we allocate is for a dinode | |
1442 | * @n: The extent length | |
1443 | * | |
1444 | * Add the found bitmap buffer to the transaction. | |
1445 | * Set the found bits to @new_state to change block's allocation state. | |
1446 | * Returns: starting block number of the extent (fs scope) | |
1447 | */ | |
1448 | static u64 gfs2_alloc_extent(struct gfs2_rgrpd *rgd, struct gfs2_bitmap *bi, | |
1449 | u32 blk, bool dinode, unsigned int *n) | |
1450 | { | |
1451 | const unsigned int elen = *n; | |
1452 | u32 goal; | |
1453 | const u8 *buffer = NULL; | |
1454 | ||
6a8099ed | 1455 | *n = 0; |
b3e47ca0 | 1456 | buffer = bi->bi_bh->b_data + bi->bi_offset; |
60a0b8f9 | 1457 | gfs2_trans_add_bh(rgd->rd_gl, bi->bi_bh, 1); |
06344b91 BP |
1458 | gfs2_setbit(rgd, bi->bi_clone, bi, blk, |
1459 | dinode ? GFS2_BLKST_DINODE : GFS2_BLKST_USED); | |
6a8099ed | 1460 | (*n)++; |
60a0b8f9 SW |
1461 | goal = blk; |
1462 | while (*n < elen) { | |
1463 | goal++; | |
1464 | if (goal >= (bi->bi_len * GFS2_NBBY)) | |
1465 | break; | |
1466 | if (gfs2_testbit(rgd, buffer, bi->bi_len, goal) != | |
1467 | GFS2_BLKST_FREE) | |
1468 | break; | |
06344b91 | 1469 | gfs2_setbit(rgd, bi->bi_clone, bi, goal, GFS2_BLKST_USED); |
60a0b8f9 | 1470 | (*n)++; |
c8cdf479 | 1471 | } |
b3e47ca0 | 1472 | blk = gfs2_bi2rgd_blk(bi, blk); |
6a8099ed | 1473 | rgd->rd_last_alloc = blk + *n - 1; |
b3e47ca0 | 1474 | return rgd->rd_data0 + blk; |
b3b94faa DT |
1475 | } |
1476 | ||
1477 | /** | |
1478 | * rgblk_free - Change alloc state of given block(s) | |
1479 | * @sdp: the filesystem | |
1480 | * @bstart: the start of a run of blocks to free | |
1481 | * @blen: the length of the block run (all must lie within ONE RG!) | |
1482 | * @new_state: GFS2_BLKST_XXX the after-allocation block state | |
1483 | * | |
1484 | * Returns: Resource group containing the block(s) | |
1485 | */ | |
1486 | ||
cd915493 SW |
1487 | static struct gfs2_rgrpd *rgblk_free(struct gfs2_sbd *sdp, u64 bstart, |
1488 | u32 blen, unsigned char new_state) | |
b3b94faa DT |
1489 | { |
1490 | struct gfs2_rgrpd *rgd; | |
1491 | struct gfs2_bitmap *bi = NULL; | |
cd915493 | 1492 | u32 length, rgrp_blk, buf_blk; |
b3b94faa DT |
1493 | unsigned int buf; |
1494 | ||
66fc061b | 1495 | rgd = gfs2_blk2rgrpd(sdp, bstart, 1); |
b3b94faa DT |
1496 | if (!rgd) { |
1497 | if (gfs2_consist(sdp)) | |
382066da | 1498 | fs_err(sdp, "block = %llu\n", (unsigned long long)bstart); |
b3b94faa DT |
1499 | return NULL; |
1500 | } | |
1501 | ||
bb8d8a6f | 1502 | length = rgd->rd_length; |
b3b94faa | 1503 | |
bb8d8a6f | 1504 | rgrp_blk = bstart - rgd->rd_data0; |
b3b94faa DT |
1505 | |
1506 | while (blen--) { | |
1507 | for (buf = 0; buf < length; buf++) { | |
1508 | bi = rgd->rd_bits + buf; | |
1509 | if (rgrp_blk < (bi->bi_start + bi->bi_len) * GFS2_NBBY) | |
1510 | break; | |
1511 | } | |
1512 | ||
1513 | gfs2_assert(rgd->rd_sbd, buf < length); | |
1514 | ||
1515 | buf_blk = rgrp_blk - bi->bi_start * GFS2_NBBY; | |
1516 | rgrp_blk++; | |
1517 | ||
1518 | if (!bi->bi_clone) { | |
1519 | bi->bi_clone = kmalloc(bi->bi_bh->b_size, | |
dd894be8 | 1520 | GFP_NOFS | __GFP_NOFAIL); |
b3b94faa DT |
1521 | memcpy(bi->bi_clone + bi->bi_offset, |
1522 | bi->bi_bh->b_data + bi->bi_offset, | |
1523 | bi->bi_len); | |
1524 | } | |
d4e9c4c3 | 1525 | gfs2_trans_add_bh(rgd->rd_gl, bi->bi_bh, 1); |
06344b91 | 1526 | gfs2_setbit(rgd, NULL, bi, buf_blk, new_state); |
b3b94faa DT |
1527 | } |
1528 | ||
1529 | return rgd; | |
1530 | } | |
1531 | ||
1532 | /** | |
09010978 SW |
1533 | * gfs2_rgrp_dump - print out an rgrp |
1534 | * @seq: The iterator | |
1535 | * @gl: The glock in question | |
1536 | * | |
1537 | */ | |
1538 | ||
1539 | int gfs2_rgrp_dump(struct seq_file *seq, const struct gfs2_glock *gl) | |
1540 | { | |
1541 | const struct gfs2_rgrpd *rgd = gl->gl_object; | |
1542 | if (rgd == NULL) | |
1543 | return 0; | |
1544 | gfs2_print_dbg(seq, " R: n:%llu f:%02x b:%u/%u i:%u\n", | |
1545 | (unsigned long long)rgd->rd_addr, rgd->rd_flags, | |
1546 | rgd->rd_free, rgd->rd_free_clone, rgd->rd_dinodes); | |
1547 | return 0; | |
1548 | } | |
1549 | ||
6050b9c7 SW |
1550 | static void gfs2_rgrp_error(struct gfs2_rgrpd *rgd) |
1551 | { | |
1552 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
1553 | fs_warn(sdp, "rgrp %llu has an error, marking it readonly until umount\n", | |
86d00636 | 1554 | (unsigned long long)rgd->rd_addr); |
6050b9c7 SW |
1555 | fs_warn(sdp, "umount on all nodes and run fsck.gfs2 to fix the error\n"); |
1556 | gfs2_rgrp_dump(NULL, rgd->rd_gl); | |
1557 | rgd->rd_flags |= GFS2_RDF_ERROR; | |
1558 | } | |
1559 | ||
09010978 | 1560 | /** |
6e87ed0f | 1561 | * gfs2_alloc_blocks - Allocate one or more blocks of data and/or a dinode |
1639431a | 1562 | * @ip: the inode to allocate the block for |
09010978 | 1563 | * @bn: Used to return the starting block number |
6a8099ed | 1564 | * @ndata: requested number of blocks/extent length (value/result) |
6e87ed0f | 1565 | * @dinode: 1 if we're allocating a dinode block, else 0 |
3c5d785a | 1566 | * @generation: the generation number of the inode |
b3b94faa | 1567 | * |
09010978 | 1568 | * Returns: 0 or error |
b3b94faa DT |
1569 | */ |
1570 | ||
6a8099ed | 1571 | int gfs2_alloc_blocks(struct gfs2_inode *ip, u64 *bn, unsigned int *nblocks, |
6e87ed0f | 1572 | bool dinode, u64 *generation) |
b3b94faa | 1573 | { |
feaa7bba | 1574 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
d9ba7615 | 1575 | struct buffer_head *dibh; |
9a3f236d | 1576 | struct gfs2_rgrpd *rgd; |
6a8099ed SW |
1577 | unsigned int ndata; |
1578 | u32 goal, blk; /* block, within the rgrp scope */ | |
3c5d785a | 1579 | u64 block; /* block, within the file system scope */ |
d9ba7615 | 1580 | int error; |
b3e47ca0 | 1581 | struct gfs2_bitmap *bi; |
b3b94faa | 1582 | |
9a3f236d SW |
1583 | /* Only happens if there is a bug in gfs2, return something distinctive |
1584 | * to ensure that it is noticed. | |
1585 | */ | |
0a305e49 | 1586 | if (ip->i_res->rs_requested == 0) |
9a3f236d SW |
1587 | return -ECANCELED; |
1588 | ||
54335b1f | 1589 | rgd = ip->i_rgd; |
9a3f236d | 1590 | |
3c5d785a | 1591 | if (!dinode && rgrp_contains_block(rgd, ip->i_goal)) |
ce276b06 | 1592 | goal = ip->i_goal - rgd->rd_data0; |
b3b94faa | 1593 | else |
ac576cc5 | 1594 | goal = rgd->rd_last_alloc; |
b3b94faa | 1595 | |
6a8099ed | 1596 | blk = rgblk_search(rgd, goal, GFS2_BLKST_FREE, &bi); |
09010978 SW |
1597 | |
1598 | /* Since all blocks are reserved in advance, this shouldn't happen */ | |
1599 | if (blk == BFITNOENT) | |
1600 | goto rgrp_error; | |
b3b94faa | 1601 | |
6a8099ed SW |
1602 | block = gfs2_alloc_extent(rgd, bi, blk, dinode, nblocks); |
1603 | ndata = *nblocks; | |
1604 | if (dinode) | |
1605 | ndata--; | |
b3e47ca0 | 1606 | |
3c5d785a | 1607 | if (!dinode) { |
6a8099ed | 1608 | ip->i_goal = block + ndata - 1; |
3c5d785a BP |
1609 | error = gfs2_meta_inode_buffer(ip, &dibh); |
1610 | if (error == 0) { | |
1611 | struct gfs2_dinode *di = | |
1612 | (struct gfs2_dinode *)dibh->b_data; | |
1613 | gfs2_trans_add_bh(ip->i_gl, dibh, 1); | |
1614 | di->di_goal_meta = di->di_goal_data = | |
1615 | cpu_to_be64(ip->i_goal); | |
1616 | brelse(dibh); | |
1617 | } | |
d9ba7615 | 1618 | } |
6a8099ed | 1619 | if (rgd->rd_free < *nblocks) |
09010978 SW |
1620 | goto rgrp_error; |
1621 | ||
6a8099ed | 1622 | rgd->rd_free -= *nblocks; |
3c5d785a BP |
1623 | if (dinode) { |
1624 | rgd->rd_dinodes++; | |
1625 | *generation = rgd->rd_igeneration++; | |
1626 | if (*generation == 0) | |
1627 | *generation = rgd->rd_igeneration++; | |
1628 | } | |
b3b94faa | 1629 | |
d4e9c4c3 | 1630 | gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1); |
42d52e38 | 1631 | gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data); |
90306c41 | 1632 | gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, rgd->rd_bits[0].bi_bh->b_data); |
b3b94faa | 1633 | |
6a8099ed | 1634 | gfs2_statfs_change(sdp, 0, -(s64)*nblocks, dinode ? 1 : 0); |
3c5d785a BP |
1635 | if (dinode) |
1636 | gfs2_trans_add_unrevoke(sdp, block, 1); | |
6a8099ed SW |
1637 | |
1638 | /* | |
1639 | * This needs reviewing to see why we cannot do the quota change | |
1640 | * at this point in the dinode case. | |
1641 | */ | |
1642 | if (ndata) | |
1643 | gfs2_quota_change(ip, ndata, ip->i_inode.i_uid, | |
3c5d785a | 1644 | ip->i_inode.i_gid); |
b3b94faa | 1645 | |
6a8099ed | 1646 | rgd->rd_free_clone -= *nblocks; |
41db1ab9 | 1647 | trace_gfs2_block_alloc(ip, rgd, block, *nblocks, |
6e87ed0f | 1648 | dinode ? GFS2_BLKST_DINODE : GFS2_BLKST_USED); |
6050b9c7 SW |
1649 | *bn = block; |
1650 | return 0; | |
1651 | ||
1652 | rgrp_error: | |
1653 | gfs2_rgrp_error(rgd); | |
1654 | return -EIO; | |
b3b94faa DT |
1655 | } |
1656 | ||
1657 | /** | |
46fcb2ed | 1658 | * __gfs2_free_blocks - free a contiguous run of block(s) |
b3b94faa DT |
1659 | * @ip: the inode these blocks are being freed from |
1660 | * @bstart: first block of a run of contiguous blocks | |
1661 | * @blen: the length of the block run | |
46fcb2ed | 1662 | * @meta: 1 if the blocks represent metadata |
b3b94faa DT |
1663 | * |
1664 | */ | |
1665 | ||
46fcb2ed | 1666 | void __gfs2_free_blocks(struct gfs2_inode *ip, u64 bstart, u32 blen, int meta) |
b3b94faa | 1667 | { |
feaa7bba | 1668 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
b3b94faa DT |
1669 | struct gfs2_rgrpd *rgd; |
1670 | ||
1671 | rgd = rgblk_free(sdp, bstart, blen, GFS2_BLKST_FREE); | |
1672 | if (!rgd) | |
1673 | return; | |
41db1ab9 | 1674 | trace_gfs2_block_alloc(ip, rgd, bstart, blen, GFS2_BLKST_FREE); |
cfc8b549 | 1675 | rgd->rd_free += blen; |
66fc061b | 1676 | rgd->rd_flags &= ~GFS2_RGF_TRIMMED; |
d4e9c4c3 | 1677 | gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1); |
42d52e38 | 1678 | gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data); |
90306c41 | 1679 | gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, rgd->rd_bits[0].bi_bh->b_data); |
b3b94faa | 1680 | |
6d3117b4 | 1681 | /* Directories keep their data in the metadata address space */ |
46fcb2ed | 1682 | if (meta || ip->i_depth) |
6d3117b4 | 1683 | gfs2_meta_wipe(ip, bstart, blen); |
4c16c36a | 1684 | } |
b3b94faa | 1685 | |
4c16c36a BP |
1686 | /** |
1687 | * gfs2_free_meta - free a contiguous run of data block(s) | |
1688 | * @ip: the inode these blocks are being freed from | |
1689 | * @bstart: first block of a run of contiguous blocks | |
1690 | * @blen: the length of the block run | |
1691 | * | |
1692 | */ | |
1693 | ||
1694 | void gfs2_free_meta(struct gfs2_inode *ip, u64 bstart, u32 blen) | |
1695 | { | |
1696 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); | |
1697 | ||
46fcb2ed | 1698 | __gfs2_free_blocks(ip, bstart, blen, 1); |
b3b94faa | 1699 | gfs2_statfs_change(sdp, 0, +blen, 0); |
2933f925 | 1700 | gfs2_quota_change(ip, -(s64)blen, ip->i_inode.i_uid, ip->i_inode.i_gid); |
b3b94faa DT |
1701 | } |
1702 | ||
feaa7bba SW |
1703 | void gfs2_unlink_di(struct inode *inode) |
1704 | { | |
1705 | struct gfs2_inode *ip = GFS2_I(inode); | |
1706 | struct gfs2_sbd *sdp = GFS2_SB(inode); | |
1707 | struct gfs2_rgrpd *rgd; | |
dbb7cae2 | 1708 | u64 blkno = ip->i_no_addr; |
feaa7bba SW |
1709 | |
1710 | rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_UNLINKED); | |
1711 | if (!rgd) | |
1712 | return; | |
41db1ab9 | 1713 | trace_gfs2_block_alloc(ip, rgd, blkno, 1, GFS2_BLKST_UNLINKED); |
feaa7bba | 1714 | gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1); |
42d52e38 | 1715 | gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data); |
90306c41 BM |
1716 | gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, rgd->rd_bits[0].bi_bh->b_data); |
1717 | update_rgrp_lvb_unlinked(rgd, 1); | |
feaa7bba SW |
1718 | } |
1719 | ||
cd915493 | 1720 | static void gfs2_free_uninit_di(struct gfs2_rgrpd *rgd, u64 blkno) |
b3b94faa DT |
1721 | { |
1722 | struct gfs2_sbd *sdp = rgd->rd_sbd; | |
1723 | struct gfs2_rgrpd *tmp_rgd; | |
1724 | ||
1725 | tmp_rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_FREE); | |
1726 | if (!tmp_rgd) | |
1727 | return; | |
1728 | gfs2_assert_withdraw(sdp, rgd == tmp_rgd); | |
1729 | ||
73f74948 | 1730 | if (!rgd->rd_dinodes) |
b3b94faa | 1731 | gfs2_consist_rgrpd(rgd); |
73f74948 | 1732 | rgd->rd_dinodes--; |
cfc8b549 | 1733 | rgd->rd_free++; |
b3b94faa | 1734 | |
d4e9c4c3 | 1735 | gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1); |
42d52e38 | 1736 | gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data); |
90306c41 BM |
1737 | gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, rgd->rd_bits[0].bi_bh->b_data); |
1738 | update_rgrp_lvb_unlinked(rgd, -1); | |
b3b94faa DT |
1739 | |
1740 | gfs2_statfs_change(sdp, 0, +1, -1); | |
b3b94faa DT |
1741 | } |
1742 | ||
b3b94faa DT |
1743 | |
1744 | void gfs2_free_di(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip) | |
1745 | { | |
dbb7cae2 | 1746 | gfs2_free_uninit_di(rgd, ip->i_no_addr); |
41db1ab9 | 1747 | trace_gfs2_block_alloc(ip, rgd, ip->i_no_addr, 1, GFS2_BLKST_FREE); |
2933f925 | 1748 | gfs2_quota_change(ip, -1, ip->i_inode.i_uid, ip->i_inode.i_gid); |
dbb7cae2 | 1749 | gfs2_meta_wipe(ip, ip->i_no_addr, 1); |
b3b94faa DT |
1750 | } |
1751 | ||
acf7e244 SW |
1752 | /** |
1753 | * gfs2_check_blk_type - Check the type of a block | |
1754 | * @sdp: The superblock | |
1755 | * @no_addr: The block number to check | |
1756 | * @type: The block type we are looking for | |
1757 | * | |
1758 | * Returns: 0 if the block type matches the expected type | |
1759 | * -ESTALE if it doesn't match | |
1760 | * or -ve errno if something went wrong while checking | |
1761 | */ | |
1762 | ||
1763 | int gfs2_check_blk_type(struct gfs2_sbd *sdp, u64 no_addr, unsigned int type) | |
1764 | { | |
1765 | struct gfs2_rgrpd *rgd; | |
8339ee54 | 1766 | struct gfs2_holder rgd_gh; |
58884c4d | 1767 | int error = -EINVAL; |
acf7e244 | 1768 | |
66fc061b | 1769 | rgd = gfs2_blk2rgrpd(sdp, no_addr, 1); |
acf7e244 | 1770 | if (!rgd) |
8339ee54 | 1771 | goto fail; |
acf7e244 SW |
1772 | |
1773 | error = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_SHARED, 0, &rgd_gh); | |
1774 | if (error) | |
8339ee54 | 1775 | goto fail; |
acf7e244 SW |
1776 | |
1777 | if (gfs2_get_block_type(rgd, no_addr) != type) | |
1778 | error = -ESTALE; | |
1779 | ||
1780 | gfs2_glock_dq_uninit(&rgd_gh); | |
acf7e244 SW |
1781 | fail: |
1782 | return error; | |
1783 | } | |
1784 | ||
b3b94faa DT |
1785 | /** |
1786 | * gfs2_rlist_add - add a RG to a list of RGs | |
70b0c365 | 1787 | * @ip: the inode |
b3b94faa DT |
1788 | * @rlist: the list of resource groups |
1789 | * @block: the block | |
1790 | * | |
1791 | * Figure out what RG a block belongs to and add that RG to the list | |
1792 | * | |
1793 | * FIXME: Don't use NOFAIL | |
1794 | * | |
1795 | */ | |
1796 | ||
70b0c365 | 1797 | void gfs2_rlist_add(struct gfs2_inode *ip, struct gfs2_rgrp_list *rlist, |
cd915493 | 1798 | u64 block) |
b3b94faa | 1799 | { |
70b0c365 | 1800 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
b3b94faa DT |
1801 | struct gfs2_rgrpd *rgd; |
1802 | struct gfs2_rgrpd **tmp; | |
1803 | unsigned int new_space; | |
1804 | unsigned int x; | |
1805 | ||
1806 | if (gfs2_assert_warn(sdp, !rlist->rl_ghs)) | |
1807 | return; | |
1808 | ||
70b0c365 SW |
1809 | if (ip->i_rgd && rgrp_contains_block(ip->i_rgd, block)) |
1810 | rgd = ip->i_rgd; | |
1811 | else | |
66fc061b | 1812 | rgd = gfs2_blk2rgrpd(sdp, block, 1); |
b3b94faa | 1813 | if (!rgd) { |
70b0c365 | 1814 | fs_err(sdp, "rlist_add: no rgrp for block %llu\n", (unsigned long long)block); |
b3b94faa DT |
1815 | return; |
1816 | } | |
70b0c365 | 1817 | ip->i_rgd = rgd; |
b3b94faa DT |
1818 | |
1819 | for (x = 0; x < rlist->rl_rgrps; x++) | |
1820 | if (rlist->rl_rgd[x] == rgd) | |
1821 | return; | |
1822 | ||
1823 | if (rlist->rl_rgrps == rlist->rl_space) { | |
1824 | new_space = rlist->rl_space + 10; | |
1825 | ||
1826 | tmp = kcalloc(new_space, sizeof(struct gfs2_rgrpd *), | |
dd894be8 | 1827 | GFP_NOFS | __GFP_NOFAIL); |
b3b94faa DT |
1828 | |
1829 | if (rlist->rl_rgd) { | |
1830 | memcpy(tmp, rlist->rl_rgd, | |
1831 | rlist->rl_space * sizeof(struct gfs2_rgrpd *)); | |
1832 | kfree(rlist->rl_rgd); | |
1833 | } | |
1834 | ||
1835 | rlist->rl_space = new_space; | |
1836 | rlist->rl_rgd = tmp; | |
1837 | } | |
1838 | ||
1839 | rlist->rl_rgd[rlist->rl_rgrps++] = rgd; | |
1840 | } | |
1841 | ||
1842 | /** | |
1843 | * gfs2_rlist_alloc - all RGs have been added to the rlist, now allocate | |
1844 | * and initialize an array of glock holders for them | |
1845 | * @rlist: the list of resource groups | |
1846 | * @state: the lock state to acquire the RG lock in | |
b3b94faa DT |
1847 | * |
1848 | * FIXME: Don't use NOFAIL | |
1849 | * | |
1850 | */ | |
1851 | ||
fe6c991c | 1852 | void gfs2_rlist_alloc(struct gfs2_rgrp_list *rlist, unsigned int state) |
b3b94faa DT |
1853 | { |
1854 | unsigned int x; | |
1855 | ||
1856 | rlist->rl_ghs = kcalloc(rlist->rl_rgrps, sizeof(struct gfs2_holder), | |
dd894be8 | 1857 | GFP_NOFS | __GFP_NOFAIL); |
b3b94faa DT |
1858 | for (x = 0; x < rlist->rl_rgrps; x++) |
1859 | gfs2_holder_init(rlist->rl_rgd[x]->rd_gl, | |
fe6c991c | 1860 | state, 0, |
b3b94faa DT |
1861 | &rlist->rl_ghs[x]); |
1862 | } | |
1863 | ||
1864 | /** | |
1865 | * gfs2_rlist_free - free a resource group list | |
1866 | * @list: the list of resource groups | |
1867 | * | |
1868 | */ | |
1869 | ||
1870 | void gfs2_rlist_free(struct gfs2_rgrp_list *rlist) | |
1871 | { | |
1872 | unsigned int x; | |
1873 | ||
1874 | kfree(rlist->rl_rgd); | |
1875 | ||
1876 | if (rlist->rl_ghs) { | |
1877 | for (x = 0; x < rlist->rl_rgrps; x++) | |
1878 | gfs2_holder_uninit(&rlist->rl_ghs[x]); | |
1879 | kfree(rlist->rl_ghs); | |
1880 | } | |
1881 | } | |
1882 |