2 * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
3 * Copyright (C) 2004-2008 Red Hat, Inc. All rights reserved.
5 * This copyrighted material is made available to anyone wishing to use,
6 * modify, copy, or redistribute it subject to the terms and conditions
7 * of the GNU General Public License version 2.
10 #include <linux/slab.h>
11 #include <linux/spinlock.h>
12 #include <linux/completion.h>
13 #include <linux/buffer_head.h>
15 #include <linux/gfs2_ondisk.h>
16 #include <linux/prefetch.h>
17 #include <linux/blkdev.h>
18 #include <linux/rbtree.h>
33 #include "trace_gfs2.h"
35 #define BFITNOENT ((u32)~0)
36 #define NO_BLOCK ((u64)~0)
38 #define RSRV_CONTENTION_FACTOR 4
39 #define RGRP_RSRV_MAX_CONTENDERS 2
41 #if BITS_PER_LONG == 32
42 #define LBITMASK (0x55555555UL)
43 #define LBITSKIP55 (0x55555555UL)
44 #define LBITSKIP00 (0x00000000UL)
46 #define LBITMASK (0x5555555555555555UL)
47 #define LBITSKIP55 (0x5555555555555555UL)
48 #define LBITSKIP00 (0x0000000000000000UL)
52 * These routines are used by the resource group routines (rgrp.c)
53 * to keep track of block allocation. Each block is represented by two
54 * bits. So, each byte represents GFS2_NBBY (i.e. 4) blocks.
57 * 1 = Used (not metadata)
58 * 2 = Unlinked (still in use) inode
62 static const char valid_change[16] = {
71 * gfs2_setbit - Set a bit in the bitmaps
72 * @rgd: the resource group descriptor
73 * @buf2: the clone buffer that holds the bitmaps
74 * @bi: the bitmap structure
75 * @block: the block to set
76 * @new_state: the new state of the block
80 static inline void gfs2_setbit(struct gfs2_rgrpd *rgd, unsigned char *buf2,
81 struct gfs2_bitmap *bi, u32 block,
82 unsigned char new_state)
84 unsigned char *byte1, *byte2, *end, cur_state;
85 unsigned int buflen = bi->bi_len;
86 const unsigned int bit = (block % GFS2_NBBY) * GFS2_BIT_SIZE;
88 byte1 = bi->bi_bh->b_data + bi->bi_offset + (block / GFS2_NBBY);
89 end = bi->bi_bh->b_data + bi->bi_offset + buflen;
93 cur_state = (*byte1 >> bit) & GFS2_BIT_MASK;
95 if (unlikely(!valid_change[new_state * 4 + cur_state])) {
96 printk(KERN_WARNING "GFS2: buf_blk = 0x%llx old_state=%d, "
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);
106 gfs2_consist_rgrpd(rgd);
109 *byte1 ^= (cur_state ^ new_state) << bit;
112 byte2 = buf2 + bi->bi_offset + (block / GFS2_NBBY);
113 cur_state = (*byte2 >> bit) & GFS2_BIT_MASK;
114 *byte2 ^= (cur_state ^ new_state) << bit;
119 * gfs2_testbit - test a bit in the bitmaps
120 * @rbm: The bit to test
122 * Returns: The two bit block state of the requested bit
125 static inline u8 gfs2_testbit(const struct gfs2_rbm *rbm)
127 const u8 *buffer = rbm->bi->bi_bh->b_data + rbm->bi->bi_offset;
131 byte = buffer + (rbm->offset / GFS2_NBBY);
132 bit = (rbm->offset % GFS2_NBBY) * GFS2_BIT_SIZE;
134 return (*byte >> bit) & GFS2_BIT_MASK;
139 * @ptr: Pointer to bitmap data
140 * @mask: Mask to use (normally 0x55555.... but adjusted for search start)
141 * @state: The state we are searching for
143 * We xor the bitmap data with a patter which is the bitwise opposite
144 * of what we are looking for, this gives rise to a pattern of ones
145 * wherever there is a match. Since we have two bits per entry, we
146 * take this pattern, shift it down by one place and then and it with
147 * the original. All the even bit positions (0,2,4, etc) then represent
148 * successful matches, so we mask with 0x55555..... to remove the unwanted
151 * This allows searching of a whole u64 at once (32 blocks) with a
152 * single test (on 64 bit arches).
155 static inline u64 gfs2_bit_search(const __le64 *ptr, u64 mask, u8 state)
158 static const u64 search[] = {
159 [0] = 0xffffffffffffffffULL,
160 [1] = 0xaaaaaaaaaaaaaaaaULL,
161 [2] = 0x5555555555555555ULL,
162 [3] = 0x0000000000000000ULL,
164 tmp = le64_to_cpu(*ptr) ^ search[state];
171 * rs_cmp - multi-block reservation range compare
172 * @blk: absolute file system block number of the new reservation
173 * @len: number of blocks in the new reservation
174 * @rs: existing reservation to compare against
176 * returns: 1 if the block range is beyond the reach of the reservation
177 * -1 if the block range is before the start of the reservation
178 * 0 if the block range overlaps with the reservation
180 static inline int rs_cmp(u64 blk, u32 len, struct gfs2_blkreserv *rs)
182 u64 startblk = gfs2_rbm_to_block(&rs->rs_rbm);
184 if (blk >= startblk + rs->rs_free)
186 if (blk + len - 1 < startblk)
192 * gfs2_bitfit - Search an rgrp's bitmap buffer to find a bit-pair representing
193 * a block in a given allocation state.
194 * @buf: the buffer that holds the bitmaps
195 * @len: the length (in bytes) of the buffer
196 * @goal: start search at this block's bit-pair (within @buffer)
197 * @state: GFS2_BLKST_XXX the state of the block we're looking for.
199 * Scope of @goal and returned block number is only within this bitmap buffer,
200 * not entire rgrp or filesystem. @buffer will be offset from the actual
201 * beginning of a bitmap block buffer, skipping any header structures, but
202 * headers are always a multiple of 64 bits long so that the buffer is
203 * always aligned to a 64 bit boundary.
205 * The size of the buffer is in bytes, but is it assumed that it is
206 * always ok to read a complete multiple of 64 bits at the end
207 * of the block in case the end is no aligned to a natural boundary.
209 * Return: the block number (bitmap buffer scope) that was found
212 static u32 gfs2_bitfit(const u8 *buf, const unsigned int len,
215 u32 spoint = (goal << 1) & ((8*sizeof(u64)) - 1);
216 const __le64 *ptr = ((__le64 *)buf) + (goal >> 5);
217 const __le64 *end = (__le64 *)(buf + ALIGN(len, sizeof(u64)));
219 u64 mask = 0x5555555555555555ULL;
222 /* Mask off bits we don't care about at the start of the search */
224 tmp = gfs2_bit_search(ptr, mask, state);
226 while(tmp == 0 && ptr < end) {
227 tmp = gfs2_bit_search(ptr, 0x5555555555555555ULL, state);
230 /* Mask off any bits which are more than len bytes from the start */
231 if (ptr == end && (len & (sizeof(u64) - 1)))
232 tmp &= (((u64)~0) >> (64 - 8*(len & (sizeof(u64) - 1))));
233 /* Didn't find anything, so return */
238 bit /= 2; /* two bits per entry in the bitmap */
239 return (((const unsigned char *)ptr - buf) * GFS2_NBBY) + bit;
243 * gfs2_bitcount - count the number of bits in a certain state
244 * @rgd: the resource group descriptor
245 * @buffer: the buffer that holds the bitmaps
246 * @buflen: the length (in bytes) of the buffer
247 * @state: the state of the block we're looking for
249 * Returns: The number of bits
252 static u32 gfs2_bitcount(struct gfs2_rgrpd *rgd, const u8 *buffer,
253 unsigned int buflen, u8 state)
255 const u8 *byte = buffer;
256 const u8 *end = buffer + buflen;
257 const u8 state1 = state << 2;
258 const u8 state2 = state << 4;
259 const u8 state3 = state << 6;
262 for (; byte < end; byte++) {
263 if (((*byte) & 0x03) == state)
265 if (((*byte) & 0x0C) == state1)
267 if (((*byte) & 0x30) == state2)
269 if (((*byte) & 0xC0) == state3)
277 * gfs2_rgrp_verify - Verify that a resource group is consistent
282 void gfs2_rgrp_verify(struct gfs2_rgrpd *rgd)
284 struct gfs2_sbd *sdp = rgd->rd_sbd;
285 struct gfs2_bitmap *bi = NULL;
286 u32 length = rgd->rd_length;
290 memset(count, 0, 4 * sizeof(u32));
292 /* Count # blocks in each of 4 possible allocation states */
293 for (buf = 0; buf < length; buf++) {
294 bi = rgd->rd_bits + buf;
295 for (x = 0; x < 4; x++)
296 count[x] += gfs2_bitcount(rgd,
302 if (count[0] != rgd->rd_free) {
303 if (gfs2_consist_rgrpd(rgd))
304 fs_err(sdp, "free data mismatch: %u != %u\n",
305 count[0], rgd->rd_free);
309 tmp = rgd->rd_data - rgd->rd_free - rgd->rd_dinodes;
310 if (count[1] != tmp) {
311 if (gfs2_consist_rgrpd(rgd))
312 fs_err(sdp, "used data mismatch: %u != %u\n",
317 if (count[2] + count[3] != rgd->rd_dinodes) {
318 if (gfs2_consist_rgrpd(rgd))
319 fs_err(sdp, "used metadata mismatch: %u != %u\n",
320 count[2] + count[3], rgd->rd_dinodes);
325 static inline int rgrp_contains_block(struct gfs2_rgrpd *rgd, u64 block)
327 u64 first = rgd->rd_data0;
328 u64 last = first + rgd->rd_data;
329 return first <= block && block < last;
333 * gfs2_blk2rgrpd - Find resource group for a given data/meta block number
334 * @sdp: The GFS2 superblock
335 * @blk: The data block number
336 * @exact: True if this needs to be an exact match
338 * Returns: The resource group, or NULL if not found
341 struct gfs2_rgrpd *gfs2_blk2rgrpd(struct gfs2_sbd *sdp, u64 blk, bool exact)
343 struct rb_node *n, *next;
344 struct gfs2_rgrpd *cur;
346 spin_lock(&sdp->sd_rindex_spin);
347 n = sdp->sd_rindex_tree.rb_node;
349 cur = rb_entry(n, struct gfs2_rgrpd, rd_node);
351 if (blk < cur->rd_addr)
353 else if (blk >= cur->rd_data0 + cur->rd_data)
356 spin_unlock(&sdp->sd_rindex_spin);
358 if (blk < cur->rd_addr)
360 if (blk >= cur->rd_data0 + cur->rd_data)
367 spin_unlock(&sdp->sd_rindex_spin);
373 * gfs2_rgrpd_get_first - get the first Resource Group in the filesystem
374 * @sdp: The GFS2 superblock
376 * Returns: The first rgrp in the filesystem
379 struct gfs2_rgrpd *gfs2_rgrpd_get_first(struct gfs2_sbd *sdp)
381 const struct rb_node *n;
382 struct gfs2_rgrpd *rgd;
384 spin_lock(&sdp->sd_rindex_spin);
385 n = rb_first(&sdp->sd_rindex_tree);
386 rgd = rb_entry(n, struct gfs2_rgrpd, rd_node);
387 spin_unlock(&sdp->sd_rindex_spin);
393 * gfs2_rgrpd_get_next - get the next RG
394 * @rgd: the resource group descriptor
396 * Returns: The next rgrp
399 struct gfs2_rgrpd *gfs2_rgrpd_get_next(struct gfs2_rgrpd *rgd)
401 struct gfs2_sbd *sdp = rgd->rd_sbd;
402 const struct rb_node *n;
404 spin_lock(&sdp->sd_rindex_spin);
405 n = rb_next(&rgd->rd_node);
407 n = rb_first(&sdp->sd_rindex_tree);
409 if (unlikely(&rgd->rd_node == n)) {
410 spin_unlock(&sdp->sd_rindex_spin);
413 rgd = rb_entry(n, struct gfs2_rgrpd, rd_node);
414 spin_unlock(&sdp->sd_rindex_spin);
418 void gfs2_free_clones(struct gfs2_rgrpd *rgd)
422 for (x = 0; x < rgd->rd_length; x++) {
423 struct gfs2_bitmap *bi = rgd->rd_bits + x;
430 * gfs2_rs_alloc - make sure we have a reservation assigned to the inode
431 * @ip: the inode for this reservation
433 int gfs2_rs_alloc(struct gfs2_inode *ip)
436 struct gfs2_blkreserv *res;
441 res = kmem_cache_zalloc(gfs2_rsrv_cachep, GFP_NOFS);
445 RB_CLEAR_NODE(&res->rs_node);
447 down_write(&ip->i_rw_mutex);
449 kmem_cache_free(gfs2_rsrv_cachep, res);
452 up_write(&ip->i_rw_mutex);
456 static void dump_rs(struct seq_file *seq, struct gfs2_blkreserv *rs)
458 gfs2_print_dbg(seq, " r: %llu s:%llu b:%u f:%u\n",
459 rs->rs_rbm.rgd->rd_addr, gfs2_rbm_to_block(&rs->rs_rbm),
460 rs->rs_rbm.offset, rs->rs_free);
464 * __rs_deltree - remove a multi-block reservation from the rgd tree
465 * @rs: The reservation to remove
468 static void __rs_deltree(struct gfs2_inode *ip, struct gfs2_blkreserv *rs)
470 struct gfs2_rgrpd *rgd;
472 if (!gfs2_rs_active(rs))
475 rgd = rs->rs_rbm.rgd;
476 trace_gfs2_rs(ip, rs, TRACE_RS_TREEDEL);
477 rb_erase(&rs->rs_node, &rgd->rd_rstree);
478 RB_CLEAR_NODE(&rs->rs_node);
479 BUG_ON(!rgd->rd_rs_cnt);
483 /* return reserved blocks to the rgrp and the ip */
484 BUG_ON(rs->rs_rbm.rgd->rd_reserved < rs->rs_free);
485 rs->rs_rbm.rgd->rd_reserved -= rs->rs_free;
487 clear_bit(GBF_FULL, &rs->rs_rbm.bi->bi_flags);
488 smp_mb__after_clear_bit();
493 * gfs2_rs_deltree - remove a multi-block reservation from the rgd tree
494 * @rs: The reservation to remove
497 void gfs2_rs_deltree(struct gfs2_inode *ip, struct gfs2_blkreserv *rs)
499 struct gfs2_rgrpd *rgd;
501 rgd = rs->rs_rbm.rgd;
503 spin_lock(&rgd->rd_rsspin);
504 __rs_deltree(ip, rs);
505 spin_unlock(&rgd->rd_rsspin);
510 * gfs2_rs_delete - delete a multi-block reservation
511 * @ip: The inode for this reservation
514 void gfs2_rs_delete(struct gfs2_inode *ip)
516 down_write(&ip->i_rw_mutex);
518 gfs2_rs_deltree(ip, ip->i_res);
519 trace_gfs2_rs(ip, ip->i_res, TRACE_RS_DELETE);
520 BUG_ON(ip->i_res->rs_free);
521 kmem_cache_free(gfs2_rsrv_cachep, ip->i_res);
524 up_write(&ip->i_rw_mutex);
528 * return_all_reservations - return all reserved blocks back to the rgrp.
529 * @rgd: the rgrp that needs its space back
531 * We previously reserved a bunch of blocks for allocation. Now we need to
532 * give them back. This leave the reservation structures in tact, but removes
533 * all of their corresponding "no-fly zones".
535 static void return_all_reservations(struct gfs2_rgrpd *rgd)
538 struct gfs2_blkreserv *rs;
540 spin_lock(&rgd->rd_rsspin);
541 while ((n = rb_first(&rgd->rd_rstree))) {
542 rs = rb_entry(n, struct gfs2_blkreserv, rs_node);
543 __rs_deltree(NULL, rs);
545 spin_unlock(&rgd->rd_rsspin);
548 void gfs2_clear_rgrpd(struct gfs2_sbd *sdp)
551 struct gfs2_rgrpd *rgd;
552 struct gfs2_glock *gl;
554 while ((n = rb_first(&sdp->sd_rindex_tree))) {
555 rgd = rb_entry(n, struct gfs2_rgrpd, rd_node);
558 rb_erase(n, &sdp->sd_rindex_tree);
561 spin_lock(&gl->gl_spin);
562 gl->gl_object = NULL;
563 spin_unlock(&gl->gl_spin);
564 gfs2_glock_add_to_lru(gl);
568 gfs2_free_clones(rgd);
570 return_all_reservations(rgd);
571 kmem_cache_free(gfs2_rgrpd_cachep, rgd);
575 static void gfs2_rindex_print(const struct gfs2_rgrpd *rgd)
577 printk(KERN_INFO " ri_addr = %llu\n", (unsigned long long)rgd->rd_addr);
578 printk(KERN_INFO " ri_length = %u\n", rgd->rd_length);
579 printk(KERN_INFO " ri_data0 = %llu\n", (unsigned long long)rgd->rd_data0);
580 printk(KERN_INFO " ri_data = %u\n", rgd->rd_data);
581 printk(KERN_INFO " ri_bitbytes = %u\n", rgd->rd_bitbytes);
585 * gfs2_compute_bitstructs - Compute the bitmap sizes
586 * @rgd: The resource group descriptor
588 * Calculates bitmap descriptors, one for each block that contains bitmap data
593 static int compute_bitstructs(struct gfs2_rgrpd *rgd)
595 struct gfs2_sbd *sdp = rgd->rd_sbd;
596 struct gfs2_bitmap *bi;
597 u32 length = rgd->rd_length; /* # blocks in hdr & bitmap */
598 u32 bytes_left, bytes;
604 rgd->rd_bits = kcalloc(length, sizeof(struct gfs2_bitmap), GFP_NOFS);
608 bytes_left = rgd->rd_bitbytes;
610 for (x = 0; x < length; x++) {
611 bi = rgd->rd_bits + x;
614 /* small rgrp; bitmap stored completely in header block */
617 bi->bi_offset = sizeof(struct gfs2_rgrp);
622 bytes = sdp->sd_sb.sb_bsize - sizeof(struct gfs2_rgrp);
623 bi->bi_offset = sizeof(struct gfs2_rgrp);
627 } else if (x + 1 == length) {
629 bi->bi_offset = sizeof(struct gfs2_meta_header);
630 bi->bi_start = rgd->rd_bitbytes - bytes_left;
634 bytes = sdp->sd_sb.sb_bsize -
635 sizeof(struct gfs2_meta_header);
636 bi->bi_offset = sizeof(struct gfs2_meta_header);
637 bi->bi_start = rgd->rd_bitbytes - bytes_left;
645 gfs2_consist_rgrpd(rgd);
648 bi = rgd->rd_bits + (length - 1);
649 if ((bi->bi_start + bi->bi_len) * GFS2_NBBY != rgd->rd_data) {
650 if (gfs2_consist_rgrpd(rgd)) {
651 gfs2_rindex_print(rgd);
652 fs_err(sdp, "start=%u len=%u offset=%u\n",
653 bi->bi_start, bi->bi_len, bi->bi_offset);
662 * gfs2_ri_total - Total up the file system space, according to the rindex.
663 * @sdp: the filesystem
666 u64 gfs2_ri_total(struct gfs2_sbd *sdp)
669 struct inode *inode = sdp->sd_rindex;
670 struct gfs2_inode *ip = GFS2_I(inode);
671 char buf[sizeof(struct gfs2_rindex)];
674 for (rgrps = 0;; rgrps++) {
675 loff_t pos = rgrps * sizeof(struct gfs2_rindex);
677 if (pos + sizeof(struct gfs2_rindex) > i_size_read(inode))
679 error = gfs2_internal_read(ip, buf, &pos,
680 sizeof(struct gfs2_rindex));
681 if (error != sizeof(struct gfs2_rindex))
683 total_data += be32_to_cpu(((struct gfs2_rindex *)buf)->ri_data);
688 static int rgd_insert(struct gfs2_rgrpd *rgd)
690 struct gfs2_sbd *sdp = rgd->rd_sbd;
691 struct rb_node **newn = &sdp->sd_rindex_tree.rb_node, *parent = NULL;
693 /* Figure out where to put new node */
695 struct gfs2_rgrpd *cur = rb_entry(*newn, struct gfs2_rgrpd,
699 if (rgd->rd_addr < cur->rd_addr)
700 newn = &((*newn)->rb_left);
701 else if (rgd->rd_addr > cur->rd_addr)
702 newn = &((*newn)->rb_right);
707 rb_link_node(&rgd->rd_node, parent, newn);
708 rb_insert_color(&rgd->rd_node, &sdp->sd_rindex_tree);
714 * read_rindex_entry - Pull in a new resource index entry from the disk
715 * @ip: Pointer to the rindex inode
717 * Returns: 0 on success, > 0 on EOF, error code otherwise
720 static int read_rindex_entry(struct gfs2_inode *ip)
722 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
723 loff_t pos = sdp->sd_rgrps * sizeof(struct gfs2_rindex);
724 struct gfs2_rindex buf;
726 struct gfs2_rgrpd *rgd;
728 if (pos >= i_size_read(&ip->i_inode))
731 error = gfs2_internal_read(ip, (char *)&buf, &pos,
732 sizeof(struct gfs2_rindex));
734 if (error != sizeof(struct gfs2_rindex))
735 return (error == 0) ? 1 : error;
737 rgd = kmem_cache_zalloc(gfs2_rgrpd_cachep, GFP_NOFS);
743 rgd->rd_addr = be64_to_cpu(buf.ri_addr);
744 rgd->rd_length = be32_to_cpu(buf.ri_length);
745 rgd->rd_data0 = be64_to_cpu(buf.ri_data0);
746 rgd->rd_data = be32_to_cpu(buf.ri_data);
747 rgd->rd_bitbytes = be32_to_cpu(buf.ri_bitbytes);
748 spin_lock_init(&rgd->rd_rsspin);
750 error = compute_bitstructs(rgd);
754 error = gfs2_glock_get(sdp, rgd->rd_addr,
755 &gfs2_rgrp_glops, CREATE, &rgd->rd_gl);
759 rgd->rd_gl->gl_object = rgd;
760 rgd->rd_rgl = (struct gfs2_rgrp_lvb *)rgd->rd_gl->gl_lvb;
761 rgd->rd_flags &= ~GFS2_RDF_UPTODATE;
762 if (rgd->rd_data > sdp->sd_max_rg_data)
763 sdp->sd_max_rg_data = rgd->rd_data;
764 spin_lock(&sdp->sd_rindex_spin);
765 error = rgd_insert(rgd);
766 spin_unlock(&sdp->sd_rindex_spin);
770 error = 0; /* someone else read in the rgrp; free it and ignore it */
771 gfs2_glock_put(rgd->rd_gl);
775 kmem_cache_free(gfs2_rgrpd_cachep, rgd);
780 * gfs2_ri_update - Pull in a new resource index from the disk
781 * @ip: pointer to the rindex inode
783 * Returns: 0 on successful update, error code otherwise
786 static int gfs2_ri_update(struct gfs2_inode *ip)
788 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
792 error = read_rindex_entry(ip);
793 } while (error == 0);
798 sdp->sd_rindex_uptodate = 1;
803 * gfs2_rindex_update - Update the rindex if required
804 * @sdp: The GFS2 superblock
806 * We grab a lock on the rindex inode to make sure that it doesn't
807 * change whilst we are performing an operation. We keep this lock
808 * for quite long periods of time compared to other locks. This
809 * doesn't matter, since it is shared and it is very, very rarely
810 * accessed in the exclusive mode (i.e. only when expanding the filesystem).
812 * This makes sure that we're using the latest copy of the resource index
813 * special file, which might have been updated if someone expanded the
814 * filesystem (via gfs2_grow utility), which adds new resource groups.
816 * Returns: 0 on succeess, error code otherwise
819 int gfs2_rindex_update(struct gfs2_sbd *sdp)
821 struct gfs2_inode *ip = GFS2_I(sdp->sd_rindex);
822 struct gfs2_glock *gl = ip->i_gl;
823 struct gfs2_holder ri_gh;
825 int unlock_required = 0;
827 /* Read new copy from disk if we don't have the latest */
828 if (!sdp->sd_rindex_uptodate) {
829 if (!gfs2_glock_is_locked_by_me(gl)) {
830 error = gfs2_glock_nq_init(gl, LM_ST_SHARED, 0, &ri_gh);
835 if (!sdp->sd_rindex_uptodate)
836 error = gfs2_ri_update(ip);
838 gfs2_glock_dq_uninit(&ri_gh);
844 static void gfs2_rgrp_in(struct gfs2_rgrpd *rgd, const void *buf)
846 const struct gfs2_rgrp *str = buf;
849 rg_flags = be32_to_cpu(str->rg_flags);
850 rg_flags &= ~GFS2_RDF_MASK;
851 rgd->rd_flags &= GFS2_RDF_MASK;
852 rgd->rd_flags |= rg_flags;
853 rgd->rd_free = be32_to_cpu(str->rg_free);
854 rgd->rd_dinodes = be32_to_cpu(str->rg_dinodes);
855 rgd->rd_igeneration = be64_to_cpu(str->rg_igeneration);
858 static void gfs2_rgrp_out(struct gfs2_rgrpd *rgd, void *buf)
860 struct gfs2_rgrp *str = buf;
862 str->rg_flags = cpu_to_be32(rgd->rd_flags & ~GFS2_RDF_MASK);
863 str->rg_free = cpu_to_be32(rgd->rd_free);
864 str->rg_dinodes = cpu_to_be32(rgd->rd_dinodes);
865 str->__pad = cpu_to_be32(0);
866 str->rg_igeneration = cpu_to_be64(rgd->rd_igeneration);
867 memset(&str->rg_reserved, 0, sizeof(str->rg_reserved));
870 static int gfs2_rgrp_lvb_valid(struct gfs2_rgrpd *rgd)
872 struct gfs2_rgrp_lvb *rgl = rgd->rd_rgl;
873 struct gfs2_rgrp *str = (struct gfs2_rgrp *)rgd->rd_bits[0].bi_bh->b_data;
875 if (rgl->rl_flags != str->rg_flags || rgl->rl_free != str->rg_free ||
876 rgl->rl_dinodes != str->rg_dinodes ||
877 rgl->rl_igeneration != str->rg_igeneration)
882 static void gfs2_rgrp_ondisk2lvb(struct gfs2_rgrp_lvb *rgl, const void *buf)
884 const struct gfs2_rgrp *str = buf;
886 rgl->rl_magic = cpu_to_be32(GFS2_MAGIC);
887 rgl->rl_flags = str->rg_flags;
888 rgl->rl_free = str->rg_free;
889 rgl->rl_dinodes = str->rg_dinodes;
890 rgl->rl_igeneration = str->rg_igeneration;
894 static void update_rgrp_lvb_unlinked(struct gfs2_rgrpd *rgd, u32 change)
896 struct gfs2_rgrp_lvb *rgl = rgd->rd_rgl;
897 u32 unlinked = be32_to_cpu(rgl->rl_unlinked) + change;
898 rgl->rl_unlinked = cpu_to_be32(unlinked);
901 static u32 count_unlinked(struct gfs2_rgrpd *rgd)
903 struct gfs2_bitmap *bi;
904 const u32 length = rgd->rd_length;
905 const u8 *buffer = NULL;
906 u32 i, goal, count = 0;
908 for (i = 0, bi = rgd->rd_bits; i < length; i++, bi++) {
910 buffer = bi->bi_bh->b_data + bi->bi_offset;
911 WARN_ON(!buffer_uptodate(bi->bi_bh));
912 while (goal < bi->bi_len * GFS2_NBBY) {
913 goal = gfs2_bitfit(buffer, bi->bi_len, goal,
914 GFS2_BLKST_UNLINKED);
915 if (goal == BFITNOENT)
927 * gfs2_rgrp_bh_get - Read in a RG's header and bitmaps
928 * @rgd: the struct gfs2_rgrpd describing the RG to read in
930 * Read in all of a Resource Group's header and bitmap blocks.
931 * Caller must eventually call gfs2_rgrp_relse() to free the bitmaps.
936 int gfs2_rgrp_bh_get(struct gfs2_rgrpd *rgd)
938 struct gfs2_sbd *sdp = rgd->rd_sbd;
939 struct gfs2_glock *gl = rgd->rd_gl;
940 unsigned int length = rgd->rd_length;
941 struct gfs2_bitmap *bi;
945 if (rgd->rd_bits[0].bi_bh != NULL)
948 for (x = 0; x < length; x++) {
949 bi = rgd->rd_bits + x;
950 error = gfs2_meta_read(gl, rgd->rd_addr + x, 0, &bi->bi_bh);
955 for (y = length; y--;) {
956 bi = rgd->rd_bits + y;
957 error = gfs2_meta_wait(sdp, bi->bi_bh);
960 if (gfs2_metatype_check(sdp, bi->bi_bh, y ? GFS2_METATYPE_RB :
967 if (!(rgd->rd_flags & GFS2_RDF_UPTODATE)) {
968 for (x = 0; x < length; x++)
969 clear_bit(GBF_FULL, &rgd->rd_bits[x].bi_flags);
970 gfs2_rgrp_in(rgd, (rgd->rd_bits[0].bi_bh)->b_data);
971 rgd->rd_flags |= (GFS2_RDF_UPTODATE | GFS2_RDF_CHECK);
972 rgd->rd_free_clone = rgd->rd_free;
974 if (be32_to_cpu(GFS2_MAGIC) != rgd->rd_rgl->rl_magic) {
975 rgd->rd_rgl->rl_unlinked = cpu_to_be32(count_unlinked(rgd));
976 gfs2_rgrp_ondisk2lvb(rgd->rd_rgl,
977 rgd->rd_bits[0].bi_bh->b_data);
979 else if (sdp->sd_args.ar_rgrplvb) {
980 if (!gfs2_rgrp_lvb_valid(rgd)){
981 gfs2_consist_rgrpd(rgd);
985 if (rgd->rd_rgl->rl_unlinked == 0)
986 rgd->rd_flags &= ~GFS2_RDF_CHECK;
992 bi = rgd->rd_bits + x;
995 gfs2_assert_warn(sdp, !bi->bi_clone);
1001 int update_rgrp_lvb(struct gfs2_rgrpd *rgd)
1005 if (rgd->rd_flags & GFS2_RDF_UPTODATE)
1008 if (be32_to_cpu(GFS2_MAGIC) != rgd->rd_rgl->rl_magic)
1009 return gfs2_rgrp_bh_get(rgd);
1011 rl_flags = be32_to_cpu(rgd->rd_rgl->rl_flags);
1012 rl_flags &= ~GFS2_RDF_MASK;
1013 rgd->rd_flags &= GFS2_RDF_MASK;
1014 rgd->rd_flags |= (rl_flags | GFS2_RDF_UPTODATE | GFS2_RDF_CHECK);
1015 if (rgd->rd_rgl->rl_unlinked == 0)
1016 rgd->rd_flags &= ~GFS2_RDF_CHECK;
1017 rgd->rd_free = be32_to_cpu(rgd->rd_rgl->rl_free);
1018 rgd->rd_free_clone = rgd->rd_free;
1019 rgd->rd_dinodes = be32_to_cpu(rgd->rd_rgl->rl_dinodes);
1020 rgd->rd_igeneration = be64_to_cpu(rgd->rd_rgl->rl_igeneration);
1024 int gfs2_rgrp_go_lock(struct gfs2_holder *gh)
1026 struct gfs2_rgrpd *rgd = gh->gh_gl->gl_object;
1027 struct gfs2_sbd *sdp = rgd->rd_sbd;
1029 if (gh->gh_flags & GL_SKIP && sdp->sd_args.ar_rgrplvb)
1031 return gfs2_rgrp_bh_get((struct gfs2_rgrpd *)gh->gh_gl->gl_object);
1035 * gfs2_rgrp_go_unlock - Release RG bitmaps read in with gfs2_rgrp_bh_get()
1036 * @gh: The glock holder for the resource group
1040 void gfs2_rgrp_go_unlock(struct gfs2_holder *gh)
1042 struct gfs2_rgrpd *rgd = gh->gh_gl->gl_object;
1043 int x, length = rgd->rd_length;
1045 for (x = 0; x < length; x++) {
1046 struct gfs2_bitmap *bi = rgd->rd_bits + x;
1055 int gfs2_rgrp_send_discards(struct gfs2_sbd *sdp, u64 offset,
1056 struct buffer_head *bh,
1057 const struct gfs2_bitmap *bi, unsigned minlen, u64 *ptrimmed)
1059 struct super_block *sb = sdp->sd_vfs;
1060 struct block_device *bdev = sb->s_bdev;
1061 const unsigned int sects_per_blk = sdp->sd_sb.sb_bsize /
1062 bdev_logical_block_size(sb->s_bdev);
1065 sector_t nr_sects = 0;
1071 for (x = 0; x < bi->bi_len; x++) {
1072 const u8 *clone = bi->bi_clone ? bi->bi_clone : bi->bi_bh->b_data;
1073 clone += bi->bi_offset;
1076 const u8 *orig = bh->b_data + bi->bi_offset + x;
1077 diff = ~(*orig | (*orig >> 1)) & (*clone | (*clone >> 1));
1079 diff = ~(*clone | (*clone >> 1));
1084 blk = offset + ((bi->bi_start + x) * GFS2_NBBY);
1085 blk *= sects_per_blk; /* convert to sectors */
1089 goto start_new_extent;
1090 if ((start + nr_sects) != blk) {
1091 if (nr_sects >= minlen) {
1092 rv = blkdev_issue_discard(bdev,
1097 trimmed += nr_sects;
1103 nr_sects += sects_per_blk;
1106 blk += sects_per_blk;
1109 if (nr_sects >= minlen) {
1110 rv = blkdev_issue_discard(bdev, start, nr_sects, GFP_NOFS, 0);
1113 trimmed += nr_sects;
1116 *ptrimmed = trimmed;
1120 if (sdp->sd_args.ar_discard)
1121 fs_warn(sdp, "error %d on discard request, turning discards off for this filesystem", rv);
1122 sdp->sd_args.ar_discard = 0;
1127 * gfs2_fitrim - Generate discard requests for unused bits of the filesystem
1128 * @filp: Any file on the filesystem
1129 * @argp: Pointer to the arguments (also used to pass result)
1131 * Returns: 0 on success, otherwise error code
1134 int gfs2_fitrim(struct file *filp, void __user *argp)
1136 struct inode *inode = filp->f_dentry->d_inode;
1137 struct gfs2_sbd *sdp = GFS2_SB(inode);
1138 struct request_queue *q = bdev_get_queue(sdp->sd_vfs->s_bdev);
1139 struct buffer_head *bh;
1140 struct gfs2_rgrpd *rgd;
1141 struct gfs2_rgrpd *rgd_end;
1142 struct gfs2_holder gh;
1143 struct fstrim_range r;
1149 if (!capable(CAP_SYS_ADMIN))
1152 if (!blk_queue_discard(q))
1159 } else if (copy_from_user(&r, argp, sizeof(r)))
1162 ret = gfs2_rindex_update(sdp);
1166 rgd = gfs2_blk2rgrpd(sdp, r.start, 0);
1167 rgd_end = gfs2_blk2rgrpd(sdp, r.start + r.len, 0);
1171 ret = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_EXCLUSIVE, 0, &gh);
1175 if (!(rgd->rd_flags & GFS2_RGF_TRIMMED)) {
1176 /* Trim each bitmap in the rgrp */
1177 for (x = 0; x < rgd->rd_length; x++) {
1178 struct gfs2_bitmap *bi = rgd->rd_bits + x;
1179 ret = gfs2_rgrp_send_discards(sdp, rgd->rd_data0, NULL, bi, r.minlen, &amt);
1181 gfs2_glock_dq_uninit(&gh);
1187 /* Mark rgrp as having been trimmed */
1188 ret = gfs2_trans_begin(sdp, RES_RG_HDR, 0);
1190 bh = rgd->rd_bits[0].bi_bh;
1191 rgd->rd_flags |= GFS2_RGF_TRIMMED;
1192 gfs2_trans_add_bh(rgd->rd_gl, bh, 1);
1193 gfs2_rgrp_out(rgd, bh->b_data);
1194 gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, bh->b_data);
1195 gfs2_trans_end(sdp);
1198 gfs2_glock_dq_uninit(&gh);
1203 rgd = gfs2_rgrpd_get_next(rgd);
1207 r.len = trimmed << 9;
1208 if (argp && copy_to_user(argp, &r, sizeof(r)))
1215 * rs_insert - insert a new multi-block reservation into the rgrp's rb_tree
1216 * @bi: the bitmap with the blocks
1217 * @ip: the inode structure
1218 * @biblk: the 32-bit block number relative to the start of the bitmap
1219 * @amount: the number of blocks to reserve
1221 * Returns: NULL - reservation was already taken, so not inserted
1222 * pointer to the inserted reservation
1224 static struct gfs2_blkreserv *rs_insert(struct gfs2_bitmap *bi,
1225 struct gfs2_inode *ip, u32 biblk,
1228 struct rb_node **newn, *parent = NULL;
1230 struct gfs2_blkreserv *rs = ip->i_res;
1231 struct gfs2_rgrpd *rgd = rs->rs_rbm.rgd;
1232 u64 fsblock = gfs2_bi2rgd_blk(bi, biblk) + rgd->rd_data0;
1234 spin_lock(&rgd->rd_rsspin);
1235 newn = &rgd->rd_rstree.rb_node;
1237 BUG_ON(gfs2_rs_active(rs));
1238 /* Figure out where to put new node */
1239 /*BUG_ON(!gfs2_glock_is_locked_by_me(rgd->rd_gl));*/
1241 struct gfs2_blkreserv *cur =
1242 rb_entry(*newn, struct gfs2_blkreserv, rs_node);
1245 rc = rs_cmp(fsblock, amount, cur);
1247 newn = &((*newn)->rb_right);
1249 newn = &((*newn)->rb_left);
1251 spin_unlock(&rgd->rd_rsspin);
1252 return NULL; /* reservation already in use */
1256 /* Do our reservation work */
1258 rs->rs_free = amount;
1259 rs->rs_rbm.offset = biblk;
1261 rb_link_node(&rs->rs_node, parent, newn);
1262 rb_insert_color(&rs->rs_node, &rgd->rd_rstree);
1264 /* Do our rgrp accounting for the reservation */
1265 rgd->rd_reserved += amount; /* blocks reserved */
1266 rgd->rd_rs_cnt++; /* number of in-tree reservations */
1267 spin_unlock(&rgd->rd_rsspin);
1268 trace_gfs2_rs(ip, rs, TRACE_RS_INSERT);
1273 * unclaimed_blocks - return number of blocks that aren't spoken for
1275 static u32 unclaimed_blocks(struct gfs2_rgrpd *rgd)
1277 return rgd->rd_free_clone - rgd->rd_reserved;
1281 * rg_mblk_search - find a group of multiple free blocks
1282 * @rgd: the resource group descriptor
1283 * @rs: the block reservation
1284 * @ip: pointer to the inode for which we're reserving blocks
1286 * This is very similar to rgblk_search, except we're looking for whole
1287 * 64-bit words that represent a chunk of 32 free blocks. I'm only focusing
1288 * on aligned dwords for speed's sake.
1290 * Returns: 0 if successful or BFITNOENT if there isn't enough free space
1293 static int rg_mblk_search(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip, unsigned requested)
1295 struct gfs2_bitmap *bi = rgd->rd_bits;
1296 const u32 length = rgd->rd_length;
1298 unsigned int buf, x, search_bytes;
1300 u8 *ptr, *end, *nonzero;
1301 u32 goal, rsv_bytes;
1302 struct gfs2_blkreserv *rs;
1303 u32 best_rs_bytes, unclaimed;
1306 /* Find bitmap block that contains bits for goal block */
1307 if (rgrp_contains_block(rgd, ip->i_goal))
1308 goal = ip->i_goal - rgd->rd_data0;
1310 goal = rgd->rd_last_alloc;
1311 for (buf = 0; buf < length; buf++) {
1312 bi = rgd->rd_bits + buf;
1313 /* Convert scope of "goal" from rgrp-wide to within
1315 if (goal < (bi->bi_start + bi->bi_len) * GFS2_NBBY) {
1316 goal -= bi->bi_start * GFS2_NBBY;
1324 best_rs_blocks = max_t(int, atomic_read(&ip->i_res->rs_sizehint),
1325 (RGRP_RSRV_MINBLKS * rgd->rd_length));
1326 best_rs_bytes = (best_rs_blocks *
1327 (1 + (RSRV_CONTENTION_FACTOR * rgd->rd_rs_cnt))) /
1328 GFS2_NBBY; /* 1 + is for our not-yet-created reservation */
1329 best_rs_bytes = ALIGN(best_rs_bytes, sizeof(u64));
1330 unclaimed = unclaimed_blocks(rgd);
1331 if (best_rs_bytes * GFS2_NBBY > unclaimed)
1332 best_rs_bytes = unclaimed >> GFS2_BIT_SIZE;
1334 for (x = 0; x <= length; x++) {
1335 bi = rgd->rd_bits + buf;
1337 if (test_bit(GBF_FULL, &bi->bi_flags))
1340 WARN_ON(!buffer_uptodate(bi->bi_bh));
1342 buffer = bi->bi_clone + bi->bi_offset;
1344 buffer = bi->bi_bh->b_data + bi->bi_offset;
1346 /* We have to keep the reservations aligned on u64 boundaries
1347 otherwise we could get situations where a byte can't be
1348 used because it's after a reservation, but a free bit still
1349 is within the reservation's area. */
1350 ptr = buffer + ALIGN(goal >> GFS2_BIT_SIZE, sizeof(u64));
1351 end = (buffer + bi->bi_len);
1354 if ((ptr + best_rs_bytes) <= end)
1355 search_bytes = best_rs_bytes;
1357 search_bytes = end - ptr;
1358 BUG_ON(!search_bytes);
1359 nonzero = memchr_inv(ptr, 0, search_bytes);
1360 /* If the lot is all zeroes, reserve the whole size. If
1361 there's enough zeroes to satisfy the request, use
1362 what we can. If there's not enough, keep looking. */
1363 if (nonzero == NULL)
1364 rsv_bytes = search_bytes;
1365 else if ((nonzero - ptr) * GFS2_NBBY >= requested)
1366 rsv_bytes = (nonzero - ptr);
1369 blk = ((ptr - buffer) * GFS2_NBBY);
1370 BUG_ON(blk >= bi->bi_len * GFS2_NBBY);
1371 rs = rs_insert(bi, ip, blk,
1372 rsv_bytes * GFS2_NBBY);
1378 ptr += ALIGN(search_bytes, sizeof(u64));
1381 /* Try next bitmap block (wrap back to rgrp header
1392 * try_rgrp_fit - See if a given reservation will fit in a given RG
1396 * If there's room for the requested blocks to be allocated from the RG:
1397 * This will try to get a multi-block reservation first, and if that doesn't
1398 * fit, it will take what it can.
1400 * Returns: 1 on success (it fits), 0 on failure (it doesn't fit)
1403 static int try_rgrp_fit(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip,
1406 if (rgd->rd_flags & (GFS2_RGF_NOALLOC | GFS2_RDF_ERROR))
1408 /* Look for a multi-block reservation. */
1409 if (unclaimed_blocks(rgd) >= RGRP_RSRV_MINBLKS &&
1410 rg_mblk_search(rgd, ip, requested) != BFITNOENT)
1412 if (unclaimed_blocks(rgd) >= requested)
1419 * gfs2_next_unreserved_block - Return next block that is not reserved
1420 * @rgd: The resource group
1421 * @block: The starting block
1422 * @ip: Ignore any reservations for this inode
1424 * If the block does not appear in any reservation, then return the
1425 * block number unchanged. If it does appear in the reservation, then
1426 * keep looking through the tree of reservations in order to find the
1427 * first block number which is not reserved.
1430 static u64 gfs2_next_unreserved_block(struct gfs2_rgrpd *rgd, u64 block,
1431 const struct gfs2_inode *ip)
1433 struct gfs2_blkreserv *rs;
1437 spin_lock(&rgd->rd_rsspin);
1438 n = rb_first(&rgd->rd_rstree);
1440 rs = rb_entry(n, struct gfs2_blkreserv, rs_node);
1441 rc = rs_cmp(block, 1, rs);
1451 while ((rs_cmp(block, 1, rs) == 0) && (ip->i_res != rs)) {
1452 block = gfs2_rbm_to_block(&rs->rs_rbm) + rs->rs_free;
1453 n = rb_next(&rs->rs_node);
1456 rs = rb_entry(n, struct gfs2_blkreserv, rs_node);
1460 spin_unlock(&rgd->rd_rsspin);
1465 * gfs2_rbm_from_block - Set the rbm based upon rgd and block number
1466 * @rbm: The rbm with rgd already set correctly
1467 * @block: The block number (filesystem relative)
1469 * This sets the bi and offset members of an rbm based on a
1470 * resource group and a filesystem relative block number. The
1471 * resource group must be set in the rbm on entry, the bi and
1472 * offset members will be set by this function.
1474 * Returns: 0 on success, or an error code
1477 static int gfs2_rbm_from_block(struct gfs2_rbm *rbm, u64 block)
1479 u64 rblock = block - rbm->rgd->rd_data0;
1480 u32 goal = (u32)rblock;
1483 if (WARN_ON_ONCE(rblock > UINT_MAX))
1485 if (block >= rbm->rgd->rd_data0 + rbm->rgd->rd_data)
1488 for (x = 0; x < rbm->rgd->rd_length; x++) {
1489 rbm->bi = rbm->rgd->rd_bits + x;
1490 if (goal < (rbm->bi->bi_start + rbm->bi->bi_len) * GFS2_NBBY) {
1491 rbm->offset = goal - (rbm->bi->bi_start * GFS2_NBBY);
1500 * gfs2_reservation_check_and_update - Check for reservations during block alloc
1501 * @rbm: The current position in the resource group
1503 * This checks the current position in the rgrp to see whether there is
1504 * a reservation covering this block. If not then this function is a
1505 * no-op. If there is, then the position is moved to the end of the
1506 * contiguous reservation(s) so that we are pointing at the first
1507 * non-reserved block.
1509 * Returns: 0 if no reservation, 1 if @rbm has changed, otherwise an error
1512 static int gfs2_reservation_check_and_update(struct gfs2_rbm *rbm,
1513 const struct gfs2_inode *ip)
1515 u64 block = gfs2_rbm_to_block(rbm);
1519 nblock = gfs2_next_unreserved_block(rbm->rgd, block, ip);
1520 if (nblock == block)
1522 ret = gfs2_rbm_from_block(rbm, nblock);
1529 * gfs2_rbm_find - Look for blocks of a particular state
1530 * @rbm: Value/result starting position and final position
1531 * @state: The state which we want to find
1532 * @ip: If set, check for reservations
1533 * @nowrap: Stop looking at the end of the rgrp, rather than wrapping
1534 * around until we've reached the starting point.
1537 * - If looking for free blocks, we set GBF_FULL on each bitmap which
1538 * has no free blocks in it.
1540 * Returns: 0 on success, -ENOSPC if there is no block of the requested state
1543 static int gfs2_rbm_find(struct gfs2_rbm *rbm, u8 state,
1544 const struct gfs2_inode *ip, bool nowrap)
1546 struct buffer_head *bh;
1547 struct gfs2_bitmap *initial_bi;
1553 int iters = rbm->rgd->rd_length;
1556 /* If we are not starting at the beginning of a bitmap, then we
1557 * need to add one to the bitmap count to ensure that we search
1558 * the starting bitmap twice.
1560 if (rbm->offset != 0)
1564 if (test_bit(GBF_FULL, &rbm->bi->bi_flags) &&
1565 (state == GFS2_BLKST_FREE))
1568 bh = rbm->bi->bi_bh;
1569 buffer = bh->b_data + rbm->bi->bi_offset;
1570 WARN_ON(!buffer_uptodate(bh));
1571 if (state != GFS2_BLKST_UNLINKED && rbm->bi->bi_clone)
1572 buffer = rbm->bi->bi_clone + rbm->bi->bi_offset;
1573 initial_offset = rbm->offset;
1574 offset = gfs2_bitfit(buffer, rbm->bi->bi_len, rbm->offset, state);
1575 if (offset == BFITNOENT)
1577 rbm->offset = offset;
1581 initial_bi = rbm->bi;
1582 ret = gfs2_reservation_check_and_update(rbm, ip);
1586 n += (rbm->bi - initial_bi);
1589 if (ret == -E2BIG) {
1592 n += (rbm->bi - initial_bi);
1593 goto res_covered_end_of_rgrp;
1597 bitmap_full: /* Mark bitmap as full and fall through */
1598 if ((state == GFS2_BLKST_FREE) && initial_offset == 0)
1599 set_bit(GBF_FULL, &rbm->bi->bi_flags);
1601 next_bitmap: /* Find next bitmap in the rgrp */
1603 index = rbm->bi - rbm->rgd->rd_bits;
1605 if (index == rbm->rgd->rd_length)
1607 res_covered_end_of_rgrp:
1608 rbm->bi = &rbm->rgd->rd_bits[index];
1609 if ((index == 0) && nowrap)
1621 * try_rgrp_unlink - Look for any unlinked, allocated, but unused inodes
1623 * @last_unlinked: block address of the last dinode we unlinked
1624 * @skip: block address we should explicitly not unlink
1626 * Returns: 0 if no error
1627 * The inode, if one has been found, in inode.
1630 static void try_rgrp_unlink(struct gfs2_rgrpd *rgd, u64 *last_unlinked, u64 skip)
1633 struct gfs2_sbd *sdp = rgd->rd_sbd;
1634 struct gfs2_glock *gl;
1635 struct gfs2_inode *ip;
1638 struct gfs2_rbm rbm = { .rgd = rgd, .bi = rgd->rd_bits, .offset = 0 };
1641 down_write(&sdp->sd_log_flush_lock);
1642 error = gfs2_rbm_find(&rbm, GFS2_BLKST_UNLINKED, NULL, true);
1643 up_write(&sdp->sd_log_flush_lock);
1644 if (error == -ENOSPC)
1646 if (WARN_ON_ONCE(error))
1649 block = gfs2_rbm_to_block(&rbm);
1650 if (gfs2_rbm_from_block(&rbm, block + 1))
1652 if (*last_unlinked != NO_BLOCK && block <= *last_unlinked)
1656 *last_unlinked = block;
1658 error = gfs2_glock_get(sdp, block, &gfs2_inode_glops, CREATE, &gl);
1662 /* If the inode is already in cache, we can ignore it here
1663 * because the existing inode disposal code will deal with
1664 * it when all refs have gone away. Accessing gl_object like
1665 * this is not safe in general. Here it is ok because we do
1666 * not dereference the pointer, and we only need an approx
1667 * answer to whether it is NULL or not.
1671 if (ip || queue_work(gfs2_delete_workqueue, &gl->gl_delete) == 0)
1676 /* Limit reclaim to sensible number of tasks */
1677 if (found > NR_CPUS)
1681 rgd->rd_flags &= ~GFS2_RDF_CHECK;
1686 * gfs2_inplace_reserve - Reserve space in the filesystem
1687 * @ip: the inode to reserve space for
1688 * @requested: the number of blocks to be reserved
1693 int gfs2_inplace_reserve(struct gfs2_inode *ip, u32 requested)
1695 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1696 struct gfs2_rgrpd *begin = NULL;
1697 struct gfs2_blkreserv *rs = ip->i_res;
1698 int error = 0, rg_locked, flags = LM_FLAG_TRY;
1699 u64 last_unlinked = NO_BLOCK;
1702 if (sdp->sd_args.ar_rgrplvb)
1704 if (gfs2_assert_warn(sdp, requested)) {
1708 if (gfs2_rs_active(rs)) {
1709 begin = rs->rs_rbm.rgd;
1710 flags = 0; /* Yoda: Do or do not. There is no try */
1711 } else if (ip->i_rgd && rgrp_contains_block(ip->i_rgd, ip->i_goal)) {
1712 rs->rs_rbm.rgd = begin = ip->i_rgd;
1714 rs->rs_rbm.rgd = begin = gfs2_blk2rgrpd(sdp, ip->i_goal, 1);
1716 if (rs->rs_rbm.rgd == NULL)
1722 if (gfs2_glock_is_locked_by_me(rs->rs_rbm.rgd->rd_gl)) {
1725 } else if (!loops && !gfs2_rs_active(rs) &&
1726 rs->rs_rbm.rgd->rd_rs_cnt > RGRP_RSRV_MAX_CONTENDERS) {
1727 /* If the rgrp already is maxed out for contenders,
1728 we can eliminate it as a "first pass" without even
1729 requesting the rgrp glock. */
1730 error = GLR_TRYFAILED;
1732 error = gfs2_glock_nq_init(rs->rs_rbm.rgd->rd_gl,
1733 LM_ST_EXCLUSIVE, flags,
1735 if (!error && sdp->sd_args.ar_rgrplvb) {
1736 error = update_rgrp_lvb(rs->rs_rbm.rgd);
1738 gfs2_glock_dq_uninit(&rs->rs_rgd_gh);
1745 if (gfs2_rs_active(rs)) {
1746 if (unclaimed_blocks(rs->rs_rbm.rgd) +
1747 rs->rs_free >= requested) {
1748 ip->i_rgd = rs->rs_rbm.rgd;
1751 /* We have a multi-block reservation, but the
1752 rgrp doesn't have enough free blocks to
1753 satisfy the request. Free the reservation
1754 and look for a suitable rgrp. */
1755 gfs2_rs_deltree(ip, rs);
1757 if (try_rgrp_fit(rs->rs_rbm.rgd, ip, requested)) {
1758 if (sdp->sd_args.ar_rgrplvb)
1759 gfs2_rgrp_bh_get(rs->rs_rbm.rgd);
1760 ip->i_rgd = rs->rs_rbm.rgd;
1763 if (rs->rs_rbm.rgd->rd_flags & GFS2_RDF_CHECK) {
1764 if (sdp->sd_args.ar_rgrplvb)
1765 gfs2_rgrp_bh_get(rs->rs_rbm.rgd);
1766 try_rgrp_unlink(rs->rs_rbm.rgd, &last_unlinked,
1770 gfs2_glock_dq_uninit(&rs->rs_rgd_gh);
1773 rs->rs_rbm.rgd = gfs2_rgrpd_get_next(rs->rs_rbm.rgd);
1774 rs->rs_rbm.rgd = rs->rs_rbm.rgd ? : begin; /* if NULL, wrap */
1775 if (rs->rs_rbm.rgd != begin) /* If we didn't wrap */
1778 flags &= ~LM_FLAG_TRY;
1780 /* Check that fs hasn't grown if writing to rindex */
1781 if (ip == GFS2_I(sdp->sd_rindex) &&
1782 !sdp->sd_rindex_uptodate) {
1783 error = gfs2_ri_update(ip);
1786 } else if (loops == 2)
1787 /* Flushing the log may release space */
1788 gfs2_log_flush(sdp, NULL);
1801 * gfs2_inplace_release - release an inplace reservation
1802 * @ip: the inode the reservation was taken out on
1804 * Release a reservation made by gfs2_inplace_reserve().
1807 void gfs2_inplace_release(struct gfs2_inode *ip)
1809 struct gfs2_blkreserv *rs = ip->i_res;
1811 if (rs->rs_rgd_gh.gh_gl)
1812 gfs2_glock_dq_uninit(&rs->rs_rgd_gh);
1816 * gfs2_get_block_type - Check a block in a RG is of given type
1817 * @rgd: the resource group holding the block
1818 * @block: the block number
1820 * Returns: The block type (GFS2_BLKST_*)
1823 static unsigned char gfs2_get_block_type(struct gfs2_rgrpd *rgd, u64 block)
1825 struct gfs2_rbm rbm = { .rgd = rgd, };
1828 ret = gfs2_rbm_from_block(&rbm, block);
1829 WARN_ON_ONCE(ret != 0);
1831 return gfs2_testbit(&rbm);
1836 * gfs2_alloc_extent - allocate an extent from a given bitmap
1837 * @rbm: the resource group information
1838 * @dinode: TRUE if the first block we allocate is for a dinode
1839 * @n: The extent length (value/result)
1841 * Add the bitmap buffer to the transaction.
1842 * Set the found bits to @new_state to change block's allocation state.
1844 static void gfs2_alloc_extent(const struct gfs2_rbm *rbm, bool dinode,
1847 struct gfs2_rbm pos = { .rgd = rbm->rgd, };
1848 const unsigned int elen = *n;
1853 block = gfs2_rbm_to_block(rbm);
1854 gfs2_trans_add_bh(rbm->rgd->rd_gl, rbm->bi->bi_bh, 1);
1855 gfs2_setbit(rbm->rgd, rbm->bi->bi_clone, rbm->bi, rbm->offset,
1856 dinode ? GFS2_BLKST_DINODE : GFS2_BLKST_USED);
1859 ret = gfs2_rbm_from_block(&pos, block);
1861 if (gfs2_testbit(&pos) != GFS2_BLKST_FREE)
1863 gfs2_trans_add_bh(pos.rgd->rd_gl, pos.bi->bi_bh, 1);
1864 gfs2_setbit(pos.rgd, pos.bi->bi_clone, pos.bi, pos.offset, GFS2_BLKST_USED);
1871 * rgblk_free - Change alloc state of given block(s)
1872 * @sdp: the filesystem
1873 * @bstart: the start of a run of blocks to free
1874 * @blen: the length of the block run (all must lie within ONE RG!)
1875 * @new_state: GFS2_BLKST_XXX the after-allocation block state
1877 * Returns: Resource group containing the block(s)
1880 static struct gfs2_rgrpd *rgblk_free(struct gfs2_sbd *sdp, u64 bstart,
1881 u32 blen, unsigned char new_state)
1883 struct gfs2_rbm rbm;
1885 rbm.rgd = gfs2_blk2rgrpd(sdp, bstart, 1);
1887 if (gfs2_consist(sdp))
1888 fs_err(sdp, "block = %llu\n", (unsigned long long)bstart);
1893 gfs2_rbm_from_block(&rbm, bstart);
1895 if (!rbm.bi->bi_clone) {
1896 rbm.bi->bi_clone = kmalloc(rbm.bi->bi_bh->b_size,
1897 GFP_NOFS | __GFP_NOFAIL);
1898 memcpy(rbm.bi->bi_clone + rbm.bi->bi_offset,
1899 rbm.bi->bi_bh->b_data + rbm.bi->bi_offset,
1902 gfs2_trans_add_bh(rbm.rgd->rd_gl, rbm.bi->bi_bh, 1);
1903 gfs2_setbit(rbm.rgd, NULL, rbm.bi, rbm.offset, new_state);
1910 * gfs2_rgrp_dump - print out an rgrp
1911 * @seq: The iterator
1912 * @gl: The glock in question
1916 int gfs2_rgrp_dump(struct seq_file *seq, const struct gfs2_glock *gl)
1918 struct gfs2_rgrpd *rgd = gl->gl_object;
1919 struct gfs2_blkreserv *trs;
1920 const struct rb_node *n;
1924 gfs2_print_dbg(seq, " R: n:%llu f:%02x b:%u/%u i:%u r:%u\n",
1925 (unsigned long long)rgd->rd_addr, rgd->rd_flags,
1926 rgd->rd_free, rgd->rd_free_clone, rgd->rd_dinodes,
1928 spin_lock(&rgd->rd_rsspin);
1929 for (n = rb_first(&rgd->rd_rstree); n; n = rb_next(&trs->rs_node)) {
1930 trs = rb_entry(n, struct gfs2_blkreserv, rs_node);
1933 spin_unlock(&rgd->rd_rsspin);
1937 static void gfs2_rgrp_error(struct gfs2_rgrpd *rgd)
1939 struct gfs2_sbd *sdp = rgd->rd_sbd;
1940 fs_warn(sdp, "rgrp %llu has an error, marking it readonly until umount\n",
1941 (unsigned long long)rgd->rd_addr);
1942 fs_warn(sdp, "umount on all nodes and run fsck.gfs2 to fix the error\n");
1943 gfs2_rgrp_dump(NULL, rgd->rd_gl);
1944 rgd->rd_flags |= GFS2_RDF_ERROR;
1948 * gfs2_adjust_reservation - Adjust (or remove) a reservation after allocation
1949 * @ip: The inode we have just allocated blocks for
1950 * @rbm: The start of the allocated blocks
1951 * @len: The extent length
1953 * Adjusts a reservation after an allocation has taken place. If the
1954 * reservation does not match the allocation, or if it is now empty
1955 * then it is removed.
1958 static void gfs2_adjust_reservation(struct gfs2_inode *ip,
1959 const struct gfs2_rbm *rbm, unsigned len)
1961 struct gfs2_blkreserv *rs = ip->i_res;
1962 struct gfs2_rgrpd *rgd = rbm->rgd;
1967 spin_lock(&rgd->rd_rsspin);
1968 if (gfs2_rs_active(rs)) {
1969 if (gfs2_rbm_eq(&rs->rs_rbm, rbm)) {
1970 block = gfs2_rbm_to_block(rbm);
1971 ret = gfs2_rbm_from_block(&rs->rs_rbm, block + len);
1972 rlen = min(rs->rs_free, len);
1973 rs->rs_free -= rlen;
1974 rgd->rd_reserved -= rlen;
1975 trace_gfs2_rs(ip, rs, TRACE_RS_CLAIM);
1976 if (rs->rs_free && !ret)
1979 __rs_deltree(ip, rs);
1982 spin_unlock(&rgd->rd_rsspin);
1986 * gfs2_alloc_blocks - Allocate one or more blocks of data and/or a dinode
1987 * @ip: the inode to allocate the block for
1988 * @bn: Used to return the starting block number
1989 * @nblocks: requested number of blocks/extent length (value/result)
1990 * @dinode: 1 if we're allocating a dinode block, else 0
1991 * @generation: the generation number of the inode
1993 * Returns: 0 or error
1996 int gfs2_alloc_blocks(struct gfs2_inode *ip, u64 *bn, unsigned int *nblocks,
1997 bool dinode, u64 *generation)
1999 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
2000 struct buffer_head *dibh;
2001 struct gfs2_rbm rbm = { .rgd = ip->i_rgd, };
2004 u64 block; /* block, within the file system scope */
2007 if (gfs2_rs_active(ip->i_res))
2008 goal = gfs2_rbm_to_block(&ip->i_res->rs_rbm);
2009 else if (!dinode && rgrp_contains_block(rbm.rgd, ip->i_goal))
2012 goal = rbm.rgd->rd_last_alloc + rbm.rgd->rd_data0;
2014 if ((goal < rbm.rgd->rd_data0) ||
2015 (goal >= rbm.rgd->rd_data0 + rbm.rgd->rd_data))
2016 rbm.rgd = gfs2_blk2rgrpd(sdp, goal, 1);
2018 gfs2_rbm_from_block(&rbm, goal);
2019 error = gfs2_rbm_find(&rbm, GFS2_BLKST_FREE, ip, false);
2021 /* Since all blocks are reserved in advance, this shouldn't happen */
2023 fs_warn(sdp, "error=%d, nblocks=%u, full=%d\n", error, *nblocks,
2024 test_bit(GBF_FULL, &rbm.rgd->rd_bits->bi_flags));
2028 gfs2_alloc_extent(&rbm, dinode, nblocks);
2029 block = gfs2_rbm_to_block(&rbm);
2030 if (gfs2_rs_active(ip->i_res))
2031 gfs2_adjust_reservation(ip, &rbm, *nblocks);
2037 ip->i_goal = block + ndata - 1;
2038 error = gfs2_meta_inode_buffer(ip, &dibh);
2040 struct gfs2_dinode *di =
2041 (struct gfs2_dinode *)dibh->b_data;
2042 gfs2_trans_add_bh(ip->i_gl, dibh, 1);
2043 di->di_goal_meta = di->di_goal_data =
2044 cpu_to_be64(ip->i_goal);
2048 if (rbm.rgd->rd_free < *nblocks) {
2049 printk(KERN_WARNING "nblocks=%u\n", *nblocks);
2053 rbm.rgd->rd_free -= *nblocks;
2055 rbm.rgd->rd_dinodes++;
2056 *generation = rbm.rgd->rd_igeneration++;
2057 if (*generation == 0)
2058 *generation = rbm.rgd->rd_igeneration++;
2061 gfs2_trans_add_bh(rbm.rgd->rd_gl, rbm.rgd->rd_bits[0].bi_bh, 1);
2062 gfs2_rgrp_out(rbm.rgd, rbm.rgd->rd_bits[0].bi_bh->b_data);
2063 gfs2_rgrp_ondisk2lvb(rbm.rgd->rd_rgl, rbm.rgd->rd_bits[0].bi_bh->b_data);
2065 gfs2_statfs_change(sdp, 0, -(s64)*nblocks, dinode ? 1 : 0);
2067 gfs2_trans_add_unrevoke(sdp, block, 1);
2070 * This needs reviewing to see why we cannot do the quota change
2071 * at this point in the dinode case.
2074 gfs2_quota_change(ip, ndata, ip->i_inode.i_uid,
2077 rbm.rgd->rd_free_clone -= *nblocks;
2078 trace_gfs2_block_alloc(ip, rbm.rgd, block, *nblocks,
2079 dinode ? GFS2_BLKST_DINODE : GFS2_BLKST_USED);
2084 gfs2_rgrp_error(rbm.rgd);
2089 * __gfs2_free_blocks - free a contiguous run of block(s)
2090 * @ip: the inode these blocks are being freed from
2091 * @bstart: first block of a run of contiguous blocks
2092 * @blen: the length of the block run
2093 * @meta: 1 if the blocks represent metadata
2097 void __gfs2_free_blocks(struct gfs2_inode *ip, u64 bstart, u32 blen, int meta)
2099 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
2100 struct gfs2_rgrpd *rgd;
2102 rgd = rgblk_free(sdp, bstart, blen, GFS2_BLKST_FREE);
2105 trace_gfs2_block_alloc(ip, rgd, bstart, blen, GFS2_BLKST_FREE);
2106 rgd->rd_free += blen;
2107 rgd->rd_flags &= ~GFS2_RGF_TRIMMED;
2108 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
2109 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
2110 gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, rgd->rd_bits[0].bi_bh->b_data);
2112 /* Directories keep their data in the metadata address space */
2113 if (meta || ip->i_depth)
2114 gfs2_meta_wipe(ip, bstart, blen);
2118 * gfs2_free_meta - free a contiguous run of data block(s)
2119 * @ip: the inode these blocks are being freed from
2120 * @bstart: first block of a run of contiguous blocks
2121 * @blen: the length of the block run
2125 void gfs2_free_meta(struct gfs2_inode *ip, u64 bstart, u32 blen)
2127 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
2129 __gfs2_free_blocks(ip, bstart, blen, 1);
2130 gfs2_statfs_change(sdp, 0, +blen, 0);
2131 gfs2_quota_change(ip, -(s64)blen, ip->i_inode.i_uid, ip->i_inode.i_gid);
2134 void gfs2_unlink_di(struct inode *inode)
2136 struct gfs2_inode *ip = GFS2_I(inode);
2137 struct gfs2_sbd *sdp = GFS2_SB(inode);
2138 struct gfs2_rgrpd *rgd;
2139 u64 blkno = ip->i_no_addr;
2141 rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_UNLINKED);
2144 trace_gfs2_block_alloc(ip, rgd, blkno, 1, GFS2_BLKST_UNLINKED);
2145 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
2146 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
2147 gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, rgd->rd_bits[0].bi_bh->b_data);
2148 update_rgrp_lvb_unlinked(rgd, 1);
2151 static void gfs2_free_uninit_di(struct gfs2_rgrpd *rgd, u64 blkno)
2153 struct gfs2_sbd *sdp = rgd->rd_sbd;
2154 struct gfs2_rgrpd *tmp_rgd;
2156 tmp_rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_FREE);
2159 gfs2_assert_withdraw(sdp, rgd == tmp_rgd);
2161 if (!rgd->rd_dinodes)
2162 gfs2_consist_rgrpd(rgd);
2166 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
2167 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
2168 gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, rgd->rd_bits[0].bi_bh->b_data);
2169 update_rgrp_lvb_unlinked(rgd, -1);
2171 gfs2_statfs_change(sdp, 0, +1, -1);
2175 void gfs2_free_di(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip)
2177 gfs2_free_uninit_di(rgd, ip->i_no_addr);
2178 trace_gfs2_block_alloc(ip, rgd, ip->i_no_addr, 1, GFS2_BLKST_FREE);
2179 gfs2_quota_change(ip, -1, ip->i_inode.i_uid, ip->i_inode.i_gid);
2180 gfs2_meta_wipe(ip, ip->i_no_addr, 1);
2184 * gfs2_check_blk_type - Check the type of a block
2185 * @sdp: The superblock
2186 * @no_addr: The block number to check
2187 * @type: The block type we are looking for
2189 * Returns: 0 if the block type matches the expected type
2190 * -ESTALE if it doesn't match
2191 * or -ve errno if something went wrong while checking
2194 int gfs2_check_blk_type(struct gfs2_sbd *sdp, u64 no_addr, unsigned int type)
2196 struct gfs2_rgrpd *rgd;
2197 struct gfs2_holder rgd_gh;
2198 int error = -EINVAL;
2200 rgd = gfs2_blk2rgrpd(sdp, no_addr, 1);
2204 error = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_SHARED, 0, &rgd_gh);
2208 if (gfs2_get_block_type(rgd, no_addr) != type)
2211 gfs2_glock_dq_uninit(&rgd_gh);
2217 * gfs2_rlist_add - add a RG to a list of RGs
2219 * @rlist: the list of resource groups
2222 * Figure out what RG a block belongs to and add that RG to the list
2224 * FIXME: Don't use NOFAIL
2228 void gfs2_rlist_add(struct gfs2_inode *ip, struct gfs2_rgrp_list *rlist,
2231 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
2232 struct gfs2_rgrpd *rgd;
2233 struct gfs2_rgrpd **tmp;
2234 unsigned int new_space;
2237 if (gfs2_assert_warn(sdp, !rlist->rl_ghs))
2240 if (ip->i_rgd && rgrp_contains_block(ip->i_rgd, block))
2243 rgd = gfs2_blk2rgrpd(sdp, block, 1);
2245 fs_err(sdp, "rlist_add: no rgrp for block %llu\n", (unsigned long long)block);
2250 for (x = 0; x < rlist->rl_rgrps; x++)
2251 if (rlist->rl_rgd[x] == rgd)
2254 if (rlist->rl_rgrps == rlist->rl_space) {
2255 new_space = rlist->rl_space + 10;
2257 tmp = kcalloc(new_space, sizeof(struct gfs2_rgrpd *),
2258 GFP_NOFS | __GFP_NOFAIL);
2260 if (rlist->rl_rgd) {
2261 memcpy(tmp, rlist->rl_rgd,
2262 rlist->rl_space * sizeof(struct gfs2_rgrpd *));
2263 kfree(rlist->rl_rgd);
2266 rlist->rl_space = new_space;
2267 rlist->rl_rgd = tmp;
2270 rlist->rl_rgd[rlist->rl_rgrps++] = rgd;
2274 * gfs2_rlist_alloc - all RGs have been added to the rlist, now allocate
2275 * and initialize an array of glock holders for them
2276 * @rlist: the list of resource groups
2277 * @state: the lock state to acquire the RG lock in
2279 * FIXME: Don't use NOFAIL
2283 void gfs2_rlist_alloc(struct gfs2_rgrp_list *rlist, unsigned int state)
2287 rlist->rl_ghs = kcalloc(rlist->rl_rgrps, sizeof(struct gfs2_holder),
2288 GFP_NOFS | __GFP_NOFAIL);
2289 for (x = 0; x < rlist->rl_rgrps; x++)
2290 gfs2_holder_init(rlist->rl_rgd[x]->rd_gl,
2296 * gfs2_rlist_free - free a resource group list
2297 * @list: the list of resource groups
2301 void gfs2_rlist_free(struct gfs2_rgrp_list *rlist)
2305 kfree(rlist->rl_rgd);
2307 if (rlist->rl_ghs) {
2308 for (x = 0; x < rlist->rl_rgrps; x++)
2309 gfs2_holder_uninit(&rlist->rl_ghs[x]);
2310 kfree(rlist->rl_ghs);
2311 rlist->rl_ghs = NULL;