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