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