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