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 * @rbm: The position of the bit to set
73 * @do_clone: Also set the clone bitmap, if it exists
74 * @new_state: the new state of the block
78 static inline void gfs2_setbit(const struct gfs2_rbm *rbm, bool do_clone,
79 unsigned char new_state)
81 unsigned char *byte1, *byte2, *end, cur_state;
82 unsigned int buflen = rbm->bi->bi_len;
83 const unsigned int bit = (rbm->offset % GFS2_NBBY) * GFS2_BIT_SIZE;
85 byte1 = rbm->bi->bi_bh->b_data + rbm->bi->bi_offset + (rbm->offset / GFS2_NBBY);
86 end = rbm->bi->bi_bh->b_data + rbm->bi->bi_offset + buflen;
90 cur_state = (*byte1 >> bit) & GFS2_BIT_MASK;
92 if (unlikely(!valid_change[new_state * 4 + cur_state])) {
93 printk(KERN_WARNING "GFS2: buf_blk = 0x%x old_state=%d, "
94 "new_state=%d\n", rbm->offset, cur_state, new_state);
95 printk(KERN_WARNING "GFS2: rgrp=0x%llx bi_start=0x%x\n",
96 (unsigned long long)rbm->rgd->rd_addr,
98 printk(KERN_WARNING "GFS2: bi_offset=0x%x bi_len=0x%x\n",
99 rbm->bi->bi_offset, rbm->bi->bi_len);
101 gfs2_consist_rgrpd(rbm->rgd);
104 *byte1 ^= (cur_state ^ new_state) << bit;
106 if (do_clone && rbm->bi->bi_clone) {
107 byte2 = rbm->bi->bi_clone + rbm->bi->bi_offset + (rbm->offset / GFS2_NBBY);
108 cur_state = (*byte2 >> bit) & GFS2_BIT_MASK;
109 *byte2 ^= (cur_state ^ new_state) << bit;
114 * gfs2_testbit - test a bit in the bitmaps
115 * @rbm: The bit to test
117 * Returns: The two bit block state of the requested bit
120 static inline u8 gfs2_testbit(const struct gfs2_rbm *rbm)
122 const u8 *buffer = rbm->bi->bi_bh->b_data + rbm->bi->bi_offset;
126 byte = buffer + (rbm->offset / GFS2_NBBY);
127 bit = (rbm->offset % GFS2_NBBY) * GFS2_BIT_SIZE;
129 return (*byte >> bit) & GFS2_BIT_MASK;
134 * @ptr: Pointer to bitmap data
135 * @mask: Mask to use (normally 0x55555.... but adjusted for search start)
136 * @state: The state we are searching for
138 * We xor the bitmap data with a patter which is the bitwise opposite
139 * of what we are looking for, this gives rise to a pattern of ones
140 * wherever there is a match. Since we have two bits per entry, we
141 * take this pattern, shift it down by one place and then and it with
142 * the original. All the even bit positions (0,2,4, etc) then represent
143 * successful matches, so we mask with 0x55555..... to remove the unwanted
146 * This allows searching of a whole u64 at once (32 blocks) with a
147 * single test (on 64 bit arches).
150 static inline u64 gfs2_bit_search(const __le64 *ptr, u64 mask, u8 state)
153 static const u64 search[] = {
154 [0] = 0xffffffffffffffffULL,
155 [1] = 0xaaaaaaaaaaaaaaaaULL,
156 [2] = 0x5555555555555555ULL,
157 [3] = 0x0000000000000000ULL,
159 tmp = le64_to_cpu(*ptr) ^ search[state];
166 * rs_cmp - multi-block reservation range compare
167 * @blk: absolute file system block number of the new reservation
168 * @len: number of blocks in the new reservation
169 * @rs: existing reservation to compare against
171 * returns: 1 if the block range is beyond the reach of the reservation
172 * -1 if the block range is before the start of the reservation
173 * 0 if the block range overlaps with the reservation
175 static inline int rs_cmp(u64 blk, u32 len, struct gfs2_blkreserv *rs)
177 u64 startblk = gfs2_rbm_to_block(&rs->rs_rbm);
179 if (blk >= startblk + rs->rs_free)
181 if (blk + len - 1 < startblk)
187 * gfs2_bitfit - Search an rgrp's bitmap buffer to find a bit-pair representing
188 * a block in a given allocation state.
189 * @buf: the buffer that holds the bitmaps
190 * @len: the length (in bytes) of the buffer
191 * @goal: start search at this block's bit-pair (within @buffer)
192 * @state: GFS2_BLKST_XXX the state of the block we're looking for.
194 * Scope of @goal and returned block number is only within this bitmap buffer,
195 * not entire rgrp or filesystem. @buffer will be offset from the actual
196 * beginning of a bitmap block buffer, skipping any header structures, but
197 * headers are always a multiple of 64 bits long so that the buffer is
198 * always aligned to a 64 bit boundary.
200 * The size of the buffer is in bytes, but is it assumed that it is
201 * always ok to read a complete multiple of 64 bits at the end
202 * of the block in case the end is no aligned to a natural boundary.
204 * Return: the block number (bitmap buffer scope) that was found
207 static u32 gfs2_bitfit(const u8 *buf, const unsigned int len,
210 u32 spoint = (goal << 1) & ((8*sizeof(u64)) - 1);
211 const __le64 *ptr = ((__le64 *)buf) + (goal >> 5);
212 const __le64 *end = (__le64 *)(buf + ALIGN(len, sizeof(u64)));
214 u64 mask = 0x5555555555555555ULL;
217 /* Mask off bits we don't care about at the start of the search */
219 tmp = gfs2_bit_search(ptr, mask, state);
221 while(tmp == 0 && ptr < end) {
222 tmp = gfs2_bit_search(ptr, 0x5555555555555555ULL, state);
225 /* Mask off any bits which are more than len bytes from the start */
226 if (ptr == end && (len & (sizeof(u64) - 1)))
227 tmp &= (((u64)~0) >> (64 - 8*(len & (sizeof(u64) - 1))));
228 /* Didn't find anything, so return */
233 bit /= 2; /* two bits per entry in the bitmap */
234 return (((const unsigned char *)ptr - buf) * GFS2_NBBY) + bit;
238 * gfs2_bitcount - count the number of bits in a certain state
239 * @rgd: the resource group descriptor
240 * @buffer: the buffer that holds the bitmaps
241 * @buflen: the length (in bytes) of the buffer
242 * @state: the state of the block we're looking for
244 * Returns: The number of bits
247 static u32 gfs2_bitcount(struct gfs2_rgrpd *rgd, const u8 *buffer,
248 unsigned int buflen, u8 state)
250 const u8 *byte = buffer;
251 const u8 *end = buffer + buflen;
252 const u8 state1 = state << 2;
253 const u8 state2 = state << 4;
254 const u8 state3 = state << 6;
257 for (; byte < end; byte++) {
258 if (((*byte) & 0x03) == state)
260 if (((*byte) & 0x0C) == state1)
262 if (((*byte) & 0x30) == state2)
264 if (((*byte) & 0xC0) == state3)
272 * gfs2_rgrp_verify - Verify that a resource group is consistent
277 void gfs2_rgrp_verify(struct gfs2_rgrpd *rgd)
279 struct gfs2_sbd *sdp = rgd->rd_sbd;
280 struct gfs2_bitmap *bi = NULL;
281 u32 length = rgd->rd_length;
285 memset(count, 0, 4 * sizeof(u32));
287 /* Count # blocks in each of 4 possible allocation states */
288 for (buf = 0; buf < length; buf++) {
289 bi = rgd->rd_bits + buf;
290 for (x = 0; x < 4; x++)
291 count[x] += gfs2_bitcount(rgd,
297 if (count[0] != rgd->rd_free) {
298 if (gfs2_consist_rgrpd(rgd))
299 fs_err(sdp, "free data mismatch: %u != %u\n",
300 count[0], rgd->rd_free);
304 tmp = rgd->rd_data - rgd->rd_free - rgd->rd_dinodes;
305 if (count[1] != tmp) {
306 if (gfs2_consist_rgrpd(rgd))
307 fs_err(sdp, "used data mismatch: %u != %u\n",
312 if (count[2] + count[3] != rgd->rd_dinodes) {
313 if (gfs2_consist_rgrpd(rgd))
314 fs_err(sdp, "used metadata mismatch: %u != %u\n",
315 count[2] + count[3], rgd->rd_dinodes);
320 static inline int rgrp_contains_block(struct gfs2_rgrpd *rgd, u64 block)
322 u64 first = rgd->rd_data0;
323 u64 last = first + rgd->rd_data;
324 return first <= block && block < last;
328 * gfs2_blk2rgrpd - Find resource group for a given data/meta block number
329 * @sdp: The GFS2 superblock
330 * @blk: The data block number
331 * @exact: True if this needs to be an exact match
333 * Returns: The resource group, or NULL if not found
336 struct gfs2_rgrpd *gfs2_blk2rgrpd(struct gfs2_sbd *sdp, u64 blk, bool exact)
338 struct rb_node *n, *next;
339 struct gfs2_rgrpd *cur;
341 spin_lock(&sdp->sd_rindex_spin);
342 n = sdp->sd_rindex_tree.rb_node;
344 cur = rb_entry(n, struct gfs2_rgrpd, rd_node);
346 if (blk < cur->rd_addr)
348 else if (blk >= cur->rd_data0 + cur->rd_data)
351 spin_unlock(&sdp->sd_rindex_spin);
353 if (blk < cur->rd_addr)
355 if (blk >= cur->rd_data0 + cur->rd_data)
362 spin_unlock(&sdp->sd_rindex_spin);
368 * gfs2_rgrpd_get_first - get the first Resource Group in the filesystem
369 * @sdp: The GFS2 superblock
371 * Returns: The first rgrp in the filesystem
374 struct gfs2_rgrpd *gfs2_rgrpd_get_first(struct gfs2_sbd *sdp)
376 const struct rb_node *n;
377 struct gfs2_rgrpd *rgd;
379 spin_lock(&sdp->sd_rindex_spin);
380 n = rb_first(&sdp->sd_rindex_tree);
381 rgd = rb_entry(n, struct gfs2_rgrpd, rd_node);
382 spin_unlock(&sdp->sd_rindex_spin);
388 * gfs2_rgrpd_get_next - get the next RG
389 * @rgd: the resource group descriptor
391 * Returns: The next rgrp
394 struct gfs2_rgrpd *gfs2_rgrpd_get_next(struct gfs2_rgrpd *rgd)
396 struct gfs2_sbd *sdp = rgd->rd_sbd;
397 const struct rb_node *n;
399 spin_lock(&sdp->sd_rindex_spin);
400 n = rb_next(&rgd->rd_node);
402 n = rb_first(&sdp->sd_rindex_tree);
404 if (unlikely(&rgd->rd_node == n)) {
405 spin_unlock(&sdp->sd_rindex_spin);
408 rgd = rb_entry(n, struct gfs2_rgrpd, rd_node);
409 spin_unlock(&sdp->sd_rindex_spin);
413 void gfs2_free_clones(struct gfs2_rgrpd *rgd)
417 for (x = 0; x < rgd->rd_length; x++) {
418 struct gfs2_bitmap *bi = rgd->rd_bits + x;
425 * gfs2_rs_alloc - make sure we have a reservation assigned to the inode
426 * @ip: the inode for this reservation
428 int gfs2_rs_alloc(struct gfs2_inode *ip)
431 struct gfs2_blkreserv *res;
436 res = kmem_cache_zalloc(gfs2_rsrv_cachep, GFP_NOFS);
440 RB_CLEAR_NODE(&res->rs_node);
442 down_write(&ip->i_rw_mutex);
444 kmem_cache_free(gfs2_rsrv_cachep, res);
447 up_write(&ip->i_rw_mutex);
451 static void dump_rs(struct seq_file *seq, struct gfs2_blkreserv *rs)
453 gfs2_print_dbg(seq, " r: %llu s:%llu b:%u f:%u\n",
454 rs->rs_rbm.rgd->rd_addr, gfs2_rbm_to_block(&rs->rs_rbm),
455 rs->rs_rbm.offset, rs->rs_free);
459 * __rs_deltree - remove a multi-block reservation from the rgd tree
460 * @rs: The reservation to remove
463 static void __rs_deltree(struct gfs2_inode *ip, struct gfs2_blkreserv *rs)
465 struct gfs2_rgrpd *rgd;
467 if (!gfs2_rs_active(rs))
470 rgd = rs->rs_rbm.rgd;
471 trace_gfs2_rs(ip, rs, TRACE_RS_TREEDEL);
472 rb_erase(&rs->rs_node, &rgd->rd_rstree);
473 RB_CLEAR_NODE(&rs->rs_node);
474 BUG_ON(!rgd->rd_rs_cnt);
478 /* return reserved blocks to the rgrp and the ip */
479 BUG_ON(rs->rs_rbm.rgd->rd_reserved < rs->rs_free);
480 rs->rs_rbm.rgd->rd_reserved -= rs->rs_free;
482 clear_bit(GBF_FULL, &rs->rs_rbm.bi->bi_flags);
483 smp_mb__after_clear_bit();
488 * gfs2_rs_deltree - remove a multi-block reservation from the rgd tree
489 * @rs: The reservation to remove
492 void gfs2_rs_deltree(struct gfs2_inode *ip, struct gfs2_blkreserv *rs)
494 struct gfs2_rgrpd *rgd;
496 rgd = rs->rs_rbm.rgd;
498 spin_lock(&rgd->rd_rsspin);
499 __rs_deltree(ip, rs);
500 spin_unlock(&rgd->rd_rsspin);
505 * gfs2_rs_delete - delete a multi-block reservation
506 * @ip: The inode for this reservation
509 void gfs2_rs_delete(struct gfs2_inode *ip)
511 down_write(&ip->i_rw_mutex);
513 gfs2_rs_deltree(ip, ip->i_res);
514 trace_gfs2_rs(ip, ip->i_res, TRACE_RS_DELETE);
515 BUG_ON(ip->i_res->rs_free);
516 kmem_cache_free(gfs2_rsrv_cachep, ip->i_res);
519 up_write(&ip->i_rw_mutex);
523 * return_all_reservations - return all reserved blocks back to the rgrp.
524 * @rgd: the rgrp that needs its space back
526 * We previously reserved a bunch of blocks for allocation. Now we need to
527 * give them back. This leave the reservation structures in tact, but removes
528 * all of their corresponding "no-fly zones".
530 static void return_all_reservations(struct gfs2_rgrpd *rgd)
533 struct gfs2_blkreserv *rs;
535 spin_lock(&rgd->rd_rsspin);
536 while ((n = rb_first(&rgd->rd_rstree))) {
537 rs = rb_entry(n, struct gfs2_blkreserv, rs_node);
538 __rs_deltree(NULL, rs);
540 spin_unlock(&rgd->rd_rsspin);
543 void gfs2_clear_rgrpd(struct gfs2_sbd *sdp)
546 struct gfs2_rgrpd *rgd;
547 struct gfs2_glock *gl;
549 while ((n = rb_first(&sdp->sd_rindex_tree))) {
550 rgd = rb_entry(n, struct gfs2_rgrpd, rd_node);
553 rb_erase(n, &sdp->sd_rindex_tree);
556 spin_lock(&gl->gl_spin);
557 gl->gl_object = NULL;
558 spin_unlock(&gl->gl_spin);
559 gfs2_glock_add_to_lru(gl);
563 gfs2_free_clones(rgd);
565 return_all_reservations(rgd);
566 kmem_cache_free(gfs2_rgrpd_cachep, rgd);
570 static void gfs2_rindex_print(const struct gfs2_rgrpd *rgd)
572 printk(KERN_INFO " ri_addr = %llu\n", (unsigned long long)rgd->rd_addr);
573 printk(KERN_INFO " ri_length = %u\n", rgd->rd_length);
574 printk(KERN_INFO " ri_data0 = %llu\n", (unsigned long long)rgd->rd_data0);
575 printk(KERN_INFO " ri_data = %u\n", rgd->rd_data);
576 printk(KERN_INFO " ri_bitbytes = %u\n", rgd->rd_bitbytes);
580 * gfs2_compute_bitstructs - Compute the bitmap sizes
581 * @rgd: The resource group descriptor
583 * Calculates bitmap descriptors, one for each block that contains bitmap data
588 static int compute_bitstructs(struct gfs2_rgrpd *rgd)
590 struct gfs2_sbd *sdp = rgd->rd_sbd;
591 struct gfs2_bitmap *bi;
592 u32 length = rgd->rd_length; /* # blocks in hdr & bitmap */
593 u32 bytes_left, bytes;
599 rgd->rd_bits = kcalloc(length, sizeof(struct gfs2_bitmap), GFP_NOFS);
603 bytes_left = rgd->rd_bitbytes;
605 for (x = 0; x < length; x++) {
606 bi = rgd->rd_bits + x;
609 /* small rgrp; bitmap stored completely in header block */
612 bi->bi_offset = sizeof(struct gfs2_rgrp);
617 bytes = sdp->sd_sb.sb_bsize - sizeof(struct gfs2_rgrp);
618 bi->bi_offset = sizeof(struct gfs2_rgrp);
622 } else if (x + 1 == length) {
624 bi->bi_offset = sizeof(struct gfs2_meta_header);
625 bi->bi_start = rgd->rd_bitbytes - bytes_left;
629 bytes = sdp->sd_sb.sb_bsize -
630 sizeof(struct gfs2_meta_header);
631 bi->bi_offset = sizeof(struct gfs2_meta_header);
632 bi->bi_start = rgd->rd_bitbytes - bytes_left;
640 gfs2_consist_rgrpd(rgd);
643 bi = rgd->rd_bits + (length - 1);
644 if ((bi->bi_start + bi->bi_len) * GFS2_NBBY != rgd->rd_data) {
645 if (gfs2_consist_rgrpd(rgd)) {
646 gfs2_rindex_print(rgd);
647 fs_err(sdp, "start=%u len=%u offset=%u\n",
648 bi->bi_start, bi->bi_len, bi->bi_offset);
657 * gfs2_ri_total - Total up the file system space, according to the rindex.
658 * @sdp: the filesystem
661 u64 gfs2_ri_total(struct gfs2_sbd *sdp)
664 struct inode *inode = sdp->sd_rindex;
665 struct gfs2_inode *ip = GFS2_I(inode);
666 char buf[sizeof(struct gfs2_rindex)];
669 for (rgrps = 0;; rgrps++) {
670 loff_t pos = rgrps * sizeof(struct gfs2_rindex);
672 if (pos + sizeof(struct gfs2_rindex) > i_size_read(inode))
674 error = gfs2_internal_read(ip, buf, &pos,
675 sizeof(struct gfs2_rindex));
676 if (error != sizeof(struct gfs2_rindex))
678 total_data += be32_to_cpu(((struct gfs2_rindex *)buf)->ri_data);
683 static int rgd_insert(struct gfs2_rgrpd *rgd)
685 struct gfs2_sbd *sdp = rgd->rd_sbd;
686 struct rb_node **newn = &sdp->sd_rindex_tree.rb_node, *parent = NULL;
688 /* Figure out where to put new node */
690 struct gfs2_rgrpd *cur = rb_entry(*newn, struct gfs2_rgrpd,
694 if (rgd->rd_addr < cur->rd_addr)
695 newn = &((*newn)->rb_left);
696 else if (rgd->rd_addr > cur->rd_addr)
697 newn = &((*newn)->rb_right);
702 rb_link_node(&rgd->rd_node, parent, newn);
703 rb_insert_color(&rgd->rd_node, &sdp->sd_rindex_tree);
709 * read_rindex_entry - Pull in a new resource index entry from the disk
710 * @ip: Pointer to the rindex inode
712 * Returns: 0 on success, > 0 on EOF, error code otherwise
715 static int read_rindex_entry(struct gfs2_inode *ip)
717 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
718 loff_t pos = sdp->sd_rgrps * sizeof(struct gfs2_rindex);
719 struct gfs2_rindex buf;
721 struct gfs2_rgrpd *rgd;
723 if (pos >= i_size_read(&ip->i_inode))
726 error = gfs2_internal_read(ip, (char *)&buf, &pos,
727 sizeof(struct gfs2_rindex));
729 if (error != sizeof(struct gfs2_rindex))
730 return (error == 0) ? 1 : error;
732 rgd = kmem_cache_zalloc(gfs2_rgrpd_cachep, GFP_NOFS);
738 rgd->rd_addr = be64_to_cpu(buf.ri_addr);
739 rgd->rd_length = be32_to_cpu(buf.ri_length);
740 rgd->rd_data0 = be64_to_cpu(buf.ri_data0);
741 rgd->rd_data = be32_to_cpu(buf.ri_data);
742 rgd->rd_bitbytes = be32_to_cpu(buf.ri_bitbytes);
743 spin_lock_init(&rgd->rd_rsspin);
745 error = compute_bitstructs(rgd);
749 error = gfs2_glock_get(sdp, rgd->rd_addr,
750 &gfs2_rgrp_glops, CREATE, &rgd->rd_gl);
754 rgd->rd_gl->gl_object = rgd;
755 rgd->rd_rgl = (struct gfs2_rgrp_lvb *)rgd->rd_gl->gl_lvb;
756 rgd->rd_flags &= ~GFS2_RDF_UPTODATE;
757 if (rgd->rd_data > sdp->sd_max_rg_data)
758 sdp->sd_max_rg_data = rgd->rd_data;
759 spin_lock(&sdp->sd_rindex_spin);
760 error = rgd_insert(rgd);
761 spin_unlock(&sdp->sd_rindex_spin);
765 error = 0; /* someone else read in the rgrp; free it and ignore it */
766 gfs2_glock_put(rgd->rd_gl);
770 kmem_cache_free(gfs2_rgrpd_cachep, rgd);
775 * gfs2_ri_update - Pull in a new resource index from the disk
776 * @ip: pointer to the rindex inode
778 * Returns: 0 on successful update, error code otherwise
781 static int gfs2_ri_update(struct gfs2_inode *ip)
783 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
787 error = read_rindex_entry(ip);
788 } while (error == 0);
793 sdp->sd_rindex_uptodate = 1;
798 * gfs2_rindex_update - Update the rindex if required
799 * @sdp: The GFS2 superblock
801 * We grab a lock on the rindex inode to make sure that it doesn't
802 * change whilst we are performing an operation. We keep this lock
803 * for quite long periods of time compared to other locks. This
804 * doesn't matter, since it is shared and it is very, very rarely
805 * accessed in the exclusive mode (i.e. only when expanding the filesystem).
807 * This makes sure that we're using the latest copy of the resource index
808 * special file, which might have been updated if someone expanded the
809 * filesystem (via gfs2_grow utility), which adds new resource groups.
811 * Returns: 0 on succeess, error code otherwise
814 int gfs2_rindex_update(struct gfs2_sbd *sdp)
816 struct gfs2_inode *ip = GFS2_I(sdp->sd_rindex);
817 struct gfs2_glock *gl = ip->i_gl;
818 struct gfs2_holder ri_gh;
820 int unlock_required = 0;
822 /* Read new copy from disk if we don't have the latest */
823 if (!sdp->sd_rindex_uptodate) {
824 if (!gfs2_glock_is_locked_by_me(gl)) {
825 error = gfs2_glock_nq_init(gl, LM_ST_SHARED, 0, &ri_gh);
830 if (!sdp->sd_rindex_uptodate)
831 error = gfs2_ri_update(ip);
833 gfs2_glock_dq_uninit(&ri_gh);
839 static void gfs2_rgrp_in(struct gfs2_rgrpd *rgd, const void *buf)
841 const struct gfs2_rgrp *str = buf;
844 rg_flags = be32_to_cpu(str->rg_flags);
845 rg_flags &= ~GFS2_RDF_MASK;
846 rgd->rd_flags &= GFS2_RDF_MASK;
847 rgd->rd_flags |= rg_flags;
848 rgd->rd_free = be32_to_cpu(str->rg_free);
849 rgd->rd_dinodes = be32_to_cpu(str->rg_dinodes);
850 rgd->rd_igeneration = be64_to_cpu(str->rg_igeneration);
853 static void gfs2_rgrp_out(struct gfs2_rgrpd *rgd, void *buf)
855 struct gfs2_rgrp *str = buf;
857 str->rg_flags = cpu_to_be32(rgd->rd_flags & ~GFS2_RDF_MASK);
858 str->rg_free = cpu_to_be32(rgd->rd_free);
859 str->rg_dinodes = cpu_to_be32(rgd->rd_dinodes);
860 str->__pad = cpu_to_be32(0);
861 str->rg_igeneration = cpu_to_be64(rgd->rd_igeneration);
862 memset(&str->rg_reserved, 0, sizeof(str->rg_reserved));
865 static int gfs2_rgrp_lvb_valid(struct gfs2_rgrpd *rgd)
867 struct gfs2_rgrp_lvb *rgl = rgd->rd_rgl;
868 struct gfs2_rgrp *str = (struct gfs2_rgrp *)rgd->rd_bits[0].bi_bh->b_data;
870 if (rgl->rl_flags != str->rg_flags || rgl->rl_free != str->rg_free ||
871 rgl->rl_dinodes != str->rg_dinodes ||
872 rgl->rl_igeneration != str->rg_igeneration)
877 static void gfs2_rgrp_ondisk2lvb(struct gfs2_rgrp_lvb *rgl, const void *buf)
879 const struct gfs2_rgrp *str = buf;
881 rgl->rl_magic = cpu_to_be32(GFS2_MAGIC);
882 rgl->rl_flags = str->rg_flags;
883 rgl->rl_free = str->rg_free;
884 rgl->rl_dinodes = str->rg_dinodes;
885 rgl->rl_igeneration = str->rg_igeneration;
889 static void update_rgrp_lvb_unlinked(struct gfs2_rgrpd *rgd, u32 change)
891 struct gfs2_rgrp_lvb *rgl = rgd->rd_rgl;
892 u32 unlinked = be32_to_cpu(rgl->rl_unlinked) + change;
893 rgl->rl_unlinked = cpu_to_be32(unlinked);
896 static u32 count_unlinked(struct gfs2_rgrpd *rgd)
898 struct gfs2_bitmap *bi;
899 const u32 length = rgd->rd_length;
900 const u8 *buffer = NULL;
901 u32 i, goal, count = 0;
903 for (i = 0, bi = rgd->rd_bits; i < length; i++, bi++) {
905 buffer = bi->bi_bh->b_data + bi->bi_offset;
906 WARN_ON(!buffer_uptodate(bi->bi_bh));
907 while (goal < bi->bi_len * GFS2_NBBY) {
908 goal = gfs2_bitfit(buffer, bi->bi_len, goal,
909 GFS2_BLKST_UNLINKED);
910 if (goal == BFITNOENT)
922 * gfs2_rgrp_bh_get - Read in a RG's header and bitmaps
923 * @rgd: the struct gfs2_rgrpd describing the RG to read in
925 * Read in all of a Resource Group's header and bitmap blocks.
926 * Caller must eventually call gfs2_rgrp_relse() to free the bitmaps.
931 int gfs2_rgrp_bh_get(struct gfs2_rgrpd *rgd)
933 struct gfs2_sbd *sdp = rgd->rd_sbd;
934 struct gfs2_glock *gl = rgd->rd_gl;
935 unsigned int length = rgd->rd_length;
936 struct gfs2_bitmap *bi;
940 if (rgd->rd_bits[0].bi_bh != NULL)
943 for (x = 0; x < length; x++) {
944 bi = rgd->rd_bits + x;
945 error = gfs2_meta_read(gl, rgd->rd_addr + x, 0, &bi->bi_bh);
950 for (y = length; y--;) {
951 bi = rgd->rd_bits + y;
952 error = gfs2_meta_wait(sdp, bi->bi_bh);
955 if (gfs2_metatype_check(sdp, bi->bi_bh, y ? GFS2_METATYPE_RB :
962 if (!(rgd->rd_flags & GFS2_RDF_UPTODATE)) {
963 for (x = 0; x < length; x++)
964 clear_bit(GBF_FULL, &rgd->rd_bits[x].bi_flags);
965 gfs2_rgrp_in(rgd, (rgd->rd_bits[0].bi_bh)->b_data);
966 rgd->rd_flags |= (GFS2_RDF_UPTODATE | GFS2_RDF_CHECK);
967 rgd->rd_free_clone = rgd->rd_free;
969 if (be32_to_cpu(GFS2_MAGIC) != rgd->rd_rgl->rl_magic) {
970 rgd->rd_rgl->rl_unlinked = cpu_to_be32(count_unlinked(rgd));
971 gfs2_rgrp_ondisk2lvb(rgd->rd_rgl,
972 rgd->rd_bits[0].bi_bh->b_data);
974 else if (sdp->sd_args.ar_rgrplvb) {
975 if (!gfs2_rgrp_lvb_valid(rgd)){
976 gfs2_consist_rgrpd(rgd);
980 if (rgd->rd_rgl->rl_unlinked == 0)
981 rgd->rd_flags &= ~GFS2_RDF_CHECK;
987 bi = rgd->rd_bits + x;
990 gfs2_assert_warn(sdp, !bi->bi_clone);
996 int update_rgrp_lvb(struct gfs2_rgrpd *rgd)
1000 if (rgd->rd_flags & GFS2_RDF_UPTODATE)
1003 if (be32_to_cpu(GFS2_MAGIC) != rgd->rd_rgl->rl_magic)
1004 return gfs2_rgrp_bh_get(rgd);
1006 rl_flags = be32_to_cpu(rgd->rd_rgl->rl_flags);
1007 rl_flags &= ~GFS2_RDF_MASK;
1008 rgd->rd_flags &= GFS2_RDF_MASK;
1009 rgd->rd_flags |= (rl_flags | GFS2_RDF_UPTODATE | GFS2_RDF_CHECK);
1010 if (rgd->rd_rgl->rl_unlinked == 0)
1011 rgd->rd_flags &= ~GFS2_RDF_CHECK;
1012 rgd->rd_free = be32_to_cpu(rgd->rd_rgl->rl_free);
1013 rgd->rd_free_clone = rgd->rd_free;
1014 rgd->rd_dinodes = be32_to_cpu(rgd->rd_rgl->rl_dinodes);
1015 rgd->rd_igeneration = be64_to_cpu(rgd->rd_rgl->rl_igeneration);
1019 int gfs2_rgrp_go_lock(struct gfs2_holder *gh)
1021 struct gfs2_rgrpd *rgd = gh->gh_gl->gl_object;
1022 struct gfs2_sbd *sdp = rgd->rd_sbd;
1024 if (gh->gh_flags & GL_SKIP && sdp->sd_args.ar_rgrplvb)
1026 return gfs2_rgrp_bh_get((struct gfs2_rgrpd *)gh->gh_gl->gl_object);
1030 * gfs2_rgrp_go_unlock - Release RG bitmaps read in with gfs2_rgrp_bh_get()
1031 * @gh: The glock holder for the resource group
1035 void gfs2_rgrp_go_unlock(struct gfs2_holder *gh)
1037 struct gfs2_rgrpd *rgd = gh->gh_gl->gl_object;
1038 int x, length = rgd->rd_length;
1040 for (x = 0; x < length; x++) {
1041 struct gfs2_bitmap *bi = rgd->rd_bits + x;
1050 int gfs2_rgrp_send_discards(struct gfs2_sbd *sdp, u64 offset,
1051 struct buffer_head *bh,
1052 const struct gfs2_bitmap *bi, unsigned minlen, u64 *ptrimmed)
1054 struct super_block *sb = sdp->sd_vfs;
1055 struct block_device *bdev = sb->s_bdev;
1056 const unsigned int sects_per_blk = sdp->sd_sb.sb_bsize /
1057 bdev_logical_block_size(sb->s_bdev);
1060 sector_t nr_sects = 0;
1066 for (x = 0; x < bi->bi_len; x++) {
1067 const u8 *clone = bi->bi_clone ? bi->bi_clone : bi->bi_bh->b_data;
1068 clone += bi->bi_offset;
1071 const u8 *orig = bh->b_data + bi->bi_offset + x;
1072 diff = ~(*orig | (*orig >> 1)) & (*clone | (*clone >> 1));
1074 diff = ~(*clone | (*clone >> 1));
1079 blk = offset + ((bi->bi_start + x) * GFS2_NBBY);
1080 blk *= sects_per_blk; /* convert to sectors */
1084 goto start_new_extent;
1085 if ((start + nr_sects) != blk) {
1086 if (nr_sects >= minlen) {
1087 rv = blkdev_issue_discard(bdev,
1092 trimmed += nr_sects;
1098 nr_sects += sects_per_blk;
1101 blk += sects_per_blk;
1104 if (nr_sects >= minlen) {
1105 rv = blkdev_issue_discard(bdev, start, nr_sects, GFP_NOFS, 0);
1108 trimmed += nr_sects;
1111 *ptrimmed = trimmed;
1115 if (sdp->sd_args.ar_discard)
1116 fs_warn(sdp, "error %d on discard request, turning discards off for this filesystem", rv);
1117 sdp->sd_args.ar_discard = 0;
1122 * gfs2_fitrim - Generate discard requests for unused bits of the filesystem
1123 * @filp: Any file on the filesystem
1124 * @argp: Pointer to the arguments (also used to pass result)
1126 * Returns: 0 on success, otherwise error code
1129 int gfs2_fitrim(struct file *filp, void __user *argp)
1131 struct inode *inode = filp->f_dentry->d_inode;
1132 struct gfs2_sbd *sdp = GFS2_SB(inode);
1133 struct request_queue *q = bdev_get_queue(sdp->sd_vfs->s_bdev);
1134 struct buffer_head *bh;
1135 struct gfs2_rgrpd *rgd;
1136 struct gfs2_rgrpd *rgd_end;
1137 struct gfs2_holder gh;
1138 struct fstrim_range r;
1144 if (!capable(CAP_SYS_ADMIN))
1147 if (!blk_queue_discard(q))
1154 } else if (copy_from_user(&r, argp, sizeof(r)))
1157 ret = gfs2_rindex_update(sdp);
1161 rgd = gfs2_blk2rgrpd(sdp, r.start, 0);
1162 rgd_end = gfs2_blk2rgrpd(sdp, r.start + r.len, 0);
1166 ret = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_EXCLUSIVE, 0, &gh);
1170 if (!(rgd->rd_flags & GFS2_RGF_TRIMMED)) {
1171 /* Trim each bitmap in the rgrp */
1172 for (x = 0; x < rgd->rd_length; x++) {
1173 struct gfs2_bitmap *bi = rgd->rd_bits + x;
1174 ret = gfs2_rgrp_send_discards(sdp, rgd->rd_data0, NULL, bi, r.minlen, &amt);
1176 gfs2_glock_dq_uninit(&gh);
1182 /* Mark rgrp as having been trimmed */
1183 ret = gfs2_trans_begin(sdp, RES_RG_HDR, 0);
1185 bh = rgd->rd_bits[0].bi_bh;
1186 rgd->rd_flags |= GFS2_RGF_TRIMMED;
1187 gfs2_trans_add_bh(rgd->rd_gl, bh, 1);
1188 gfs2_rgrp_out(rgd, bh->b_data);
1189 gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, bh->b_data);
1190 gfs2_trans_end(sdp);
1193 gfs2_glock_dq_uninit(&gh);
1198 rgd = gfs2_rgrpd_get_next(rgd);
1202 r.len = trimmed << 9;
1203 if (argp && copy_to_user(argp, &r, sizeof(r)))
1210 * rs_insert - insert a new multi-block reservation into the rgrp's rb_tree
1211 * @bi: the bitmap with the blocks
1212 * @ip: the inode structure
1213 * @biblk: the 32-bit block number relative to the start of the bitmap
1214 * @amount: the number of blocks to reserve
1216 * Returns: NULL - reservation was already taken, so not inserted
1217 * pointer to the inserted reservation
1219 static struct gfs2_blkreserv *rs_insert(struct gfs2_bitmap *bi,
1220 struct gfs2_inode *ip, u32 biblk,
1223 struct rb_node **newn, *parent = NULL;
1225 struct gfs2_blkreserv *rs = ip->i_res;
1226 struct gfs2_rgrpd *rgd = rs->rs_rbm.rgd;
1227 u64 fsblock = gfs2_bi2rgd_blk(bi, biblk) + rgd->rd_data0;
1229 spin_lock(&rgd->rd_rsspin);
1230 newn = &rgd->rd_rstree.rb_node;
1232 BUG_ON(gfs2_rs_active(rs));
1233 /* Figure out where to put new node */
1234 /*BUG_ON(!gfs2_glock_is_locked_by_me(rgd->rd_gl));*/
1236 struct gfs2_blkreserv *cur =
1237 rb_entry(*newn, struct gfs2_blkreserv, rs_node);
1240 rc = rs_cmp(fsblock, amount, cur);
1242 newn = &((*newn)->rb_right);
1244 newn = &((*newn)->rb_left);
1246 spin_unlock(&rgd->rd_rsspin);
1247 return NULL; /* reservation already in use */
1251 /* Do our reservation work */
1253 rs->rs_free = amount;
1254 rs->rs_rbm.offset = biblk;
1256 rb_link_node(&rs->rs_node, parent, newn);
1257 rb_insert_color(&rs->rs_node, &rgd->rd_rstree);
1259 /* Do our rgrp accounting for the reservation */
1260 rgd->rd_reserved += amount; /* blocks reserved */
1261 rgd->rd_rs_cnt++; /* number of in-tree reservations */
1262 spin_unlock(&rgd->rd_rsspin);
1263 trace_gfs2_rs(ip, rs, TRACE_RS_INSERT);
1268 * unclaimed_blocks - return number of blocks that aren't spoken for
1270 static u32 unclaimed_blocks(struct gfs2_rgrpd *rgd)
1272 return rgd->rd_free_clone - rgd->rd_reserved;
1276 * rg_mblk_search - find a group of multiple free blocks
1277 * @rgd: the resource group descriptor
1278 * @rs: the block reservation
1279 * @ip: pointer to the inode for which we're reserving blocks
1281 * This is very similar to rgblk_search, except we're looking for whole
1282 * 64-bit words that represent a chunk of 32 free blocks. I'm only focusing
1283 * on aligned dwords for speed's sake.
1285 * Returns: 0 if successful or BFITNOENT if there isn't enough free space
1288 static int rg_mblk_search(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip, unsigned requested)
1290 struct gfs2_bitmap *bi = rgd->rd_bits;
1291 const u32 length = rgd->rd_length;
1293 unsigned int buf, x, search_bytes;
1295 u8 *ptr, *end, *nonzero;
1296 u32 goal, rsv_bytes;
1297 struct gfs2_blkreserv *rs;
1298 u32 best_rs_bytes, unclaimed;
1301 /* Find bitmap block that contains bits for goal block */
1302 if (rgrp_contains_block(rgd, ip->i_goal))
1303 goal = ip->i_goal - rgd->rd_data0;
1305 goal = rgd->rd_last_alloc;
1306 for (buf = 0; buf < length; buf++) {
1307 bi = rgd->rd_bits + buf;
1308 /* Convert scope of "goal" from rgrp-wide to within
1310 if (goal < (bi->bi_start + bi->bi_len) * GFS2_NBBY) {
1311 goal -= bi->bi_start * GFS2_NBBY;
1319 best_rs_blocks = max_t(int, atomic_read(&ip->i_res->rs_sizehint),
1320 (RGRP_RSRV_MINBLKS * rgd->rd_length));
1321 best_rs_bytes = (best_rs_blocks *
1322 (1 + (RSRV_CONTENTION_FACTOR * rgd->rd_rs_cnt))) /
1323 GFS2_NBBY; /* 1 + is for our not-yet-created reservation */
1324 best_rs_bytes = ALIGN(best_rs_bytes, sizeof(u64));
1325 unclaimed = unclaimed_blocks(rgd);
1326 if (best_rs_bytes * GFS2_NBBY > unclaimed)
1327 best_rs_bytes = unclaimed >> GFS2_BIT_SIZE;
1329 for (x = 0; x <= length; x++) {
1330 bi = rgd->rd_bits + buf;
1332 if (test_bit(GBF_FULL, &bi->bi_flags))
1335 WARN_ON(!buffer_uptodate(bi->bi_bh));
1337 buffer = bi->bi_clone + bi->bi_offset;
1339 buffer = bi->bi_bh->b_data + bi->bi_offset;
1341 /* We have to keep the reservations aligned on u64 boundaries
1342 otherwise we could get situations where a byte can't be
1343 used because it's after a reservation, but a free bit still
1344 is within the reservation's area. */
1345 ptr = buffer + ALIGN(goal >> GFS2_BIT_SIZE, sizeof(u64));
1346 end = (buffer + bi->bi_len);
1349 if ((ptr + best_rs_bytes) <= end)
1350 search_bytes = best_rs_bytes;
1352 search_bytes = end - ptr;
1353 BUG_ON(!search_bytes);
1354 nonzero = memchr_inv(ptr, 0, search_bytes);
1355 /* If the lot is all zeroes, reserve the whole size. If
1356 there's enough zeroes to satisfy the request, use
1357 what we can. If there's not enough, keep looking. */
1358 if (nonzero == NULL)
1359 rsv_bytes = search_bytes;
1360 else if ((nonzero - ptr) * GFS2_NBBY >= requested)
1361 rsv_bytes = (nonzero - ptr);
1364 blk = ((ptr - buffer) * GFS2_NBBY);
1365 BUG_ON(blk >= bi->bi_len * GFS2_NBBY);
1366 rs = rs_insert(bi, ip, blk,
1367 rsv_bytes * GFS2_NBBY);
1373 ptr += ALIGN(search_bytes, sizeof(u64));
1376 /* Try next bitmap block (wrap back to rgrp header
1387 * try_rgrp_fit - See if a given reservation will fit in a given RG
1391 * If there's room for the requested blocks to be allocated from the RG:
1392 * This will try to get a multi-block reservation first, and if that doesn't
1393 * fit, it will take what it can.
1395 * Returns: 1 on success (it fits), 0 on failure (it doesn't fit)
1398 static int try_rgrp_fit(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip,
1401 if (rgd->rd_flags & (GFS2_RGF_NOALLOC | GFS2_RDF_ERROR))
1403 /* Look for a multi-block reservation. */
1404 if (unclaimed_blocks(rgd) >= RGRP_RSRV_MINBLKS &&
1405 rg_mblk_search(rgd, ip, requested) != BFITNOENT)
1407 if (unclaimed_blocks(rgd) >= requested)
1414 * gfs2_next_unreserved_block - Return next block that is not reserved
1415 * @rgd: The resource group
1416 * @block: The starting block
1417 * @ip: Ignore any reservations for this inode
1419 * If the block does not appear in any reservation, then return the
1420 * block number unchanged. If it does appear in the reservation, then
1421 * keep looking through the tree of reservations in order to find the
1422 * first block number which is not reserved.
1425 static u64 gfs2_next_unreserved_block(struct gfs2_rgrpd *rgd, u64 block,
1426 const struct gfs2_inode *ip)
1428 struct gfs2_blkreserv *rs;
1432 spin_lock(&rgd->rd_rsspin);
1433 n = rb_first(&rgd->rd_rstree);
1435 rs = rb_entry(n, struct gfs2_blkreserv, rs_node);
1436 rc = rs_cmp(block, 1, rs);
1446 while ((rs_cmp(block, 1, rs) == 0) && (ip->i_res != rs)) {
1447 block = gfs2_rbm_to_block(&rs->rs_rbm) + rs->rs_free;
1448 n = rb_next(&rs->rs_node);
1451 rs = rb_entry(n, struct gfs2_blkreserv, rs_node);
1455 spin_unlock(&rgd->rd_rsspin);
1460 * gfs2_rbm_from_block - Set the rbm based upon rgd and block number
1461 * @rbm: The rbm with rgd already set correctly
1462 * @block: The block number (filesystem relative)
1464 * This sets the bi and offset members of an rbm based on a
1465 * resource group and a filesystem relative block number. The
1466 * resource group must be set in the rbm on entry, the bi and
1467 * offset members will be set by this function.
1469 * Returns: 0 on success, or an error code
1472 static int gfs2_rbm_from_block(struct gfs2_rbm *rbm, u64 block)
1474 u64 rblock = block - rbm->rgd->rd_data0;
1475 u32 goal = (u32)rblock;
1478 if (WARN_ON_ONCE(rblock > UINT_MAX))
1480 if (block >= rbm->rgd->rd_data0 + rbm->rgd->rd_data)
1483 for (x = 0; x < rbm->rgd->rd_length; x++) {
1484 rbm->bi = rbm->rgd->rd_bits + x;
1485 if (goal < (rbm->bi->bi_start + rbm->bi->bi_len) * GFS2_NBBY) {
1486 rbm->offset = goal - (rbm->bi->bi_start * GFS2_NBBY);
1495 * gfs2_reservation_check_and_update - Check for reservations during block alloc
1496 * @rbm: The current position in the resource group
1498 * This checks the current position in the rgrp to see whether there is
1499 * a reservation covering this block. If not then this function is a
1500 * no-op. If there is, then the position is moved to the end of the
1501 * contiguous reservation(s) so that we are pointing at the first
1502 * non-reserved block.
1504 * Returns: 0 if no reservation, 1 if @rbm has changed, otherwise an error
1507 static int gfs2_reservation_check_and_update(struct gfs2_rbm *rbm,
1508 const struct gfs2_inode *ip)
1510 u64 block = gfs2_rbm_to_block(rbm);
1514 nblock = gfs2_next_unreserved_block(rbm->rgd, block, ip);
1515 if (nblock == block)
1517 ret = gfs2_rbm_from_block(rbm, nblock);
1524 * gfs2_rbm_find - Look for blocks of a particular state
1525 * @rbm: Value/result starting position and final position
1526 * @state: The state which we want to find
1527 * @ip: If set, check for reservations
1528 * @nowrap: Stop looking at the end of the rgrp, rather than wrapping
1529 * around until we've reached the starting point.
1532 * - If looking for free blocks, we set GBF_FULL on each bitmap which
1533 * has no free blocks in it.
1535 * Returns: 0 on success, -ENOSPC if there is no block of the requested state
1538 static int gfs2_rbm_find(struct gfs2_rbm *rbm, u8 state,
1539 const struct gfs2_inode *ip, bool nowrap)
1541 struct buffer_head *bh;
1542 struct gfs2_bitmap *initial_bi;
1548 int iters = rbm->rgd->rd_length;
1551 /* If we are not starting at the beginning of a bitmap, then we
1552 * need to add one to the bitmap count to ensure that we search
1553 * the starting bitmap twice.
1555 if (rbm->offset != 0)
1559 if (test_bit(GBF_FULL, &rbm->bi->bi_flags) &&
1560 (state == GFS2_BLKST_FREE))
1563 bh = rbm->bi->bi_bh;
1564 buffer = bh->b_data + rbm->bi->bi_offset;
1565 WARN_ON(!buffer_uptodate(bh));
1566 if (state != GFS2_BLKST_UNLINKED && rbm->bi->bi_clone)
1567 buffer = rbm->bi->bi_clone + rbm->bi->bi_offset;
1568 initial_offset = rbm->offset;
1569 offset = gfs2_bitfit(buffer, rbm->bi->bi_len, rbm->offset, state);
1570 if (offset == BFITNOENT)
1572 rbm->offset = offset;
1576 initial_bi = rbm->bi;
1577 ret = gfs2_reservation_check_and_update(rbm, ip);
1581 n += (rbm->bi - initial_bi);
1584 if (ret == -E2BIG) {
1587 n += (rbm->bi - initial_bi);
1588 goto res_covered_end_of_rgrp;
1592 bitmap_full: /* Mark bitmap as full and fall through */
1593 if ((state == GFS2_BLKST_FREE) && initial_offset == 0)
1594 set_bit(GBF_FULL, &rbm->bi->bi_flags);
1596 next_bitmap: /* Find next bitmap in the rgrp */
1598 index = rbm->bi - rbm->rgd->rd_bits;
1600 if (index == rbm->rgd->rd_length)
1602 res_covered_end_of_rgrp:
1603 rbm->bi = &rbm->rgd->rd_bits[index];
1604 if ((index == 0) && nowrap)
1616 * try_rgrp_unlink - Look for any unlinked, allocated, but unused inodes
1618 * @last_unlinked: block address of the last dinode we unlinked
1619 * @skip: block address we should explicitly not unlink
1621 * Returns: 0 if no error
1622 * The inode, if one has been found, in inode.
1625 static void try_rgrp_unlink(struct gfs2_rgrpd *rgd, u64 *last_unlinked, u64 skip)
1628 struct gfs2_sbd *sdp = rgd->rd_sbd;
1629 struct gfs2_glock *gl;
1630 struct gfs2_inode *ip;
1633 struct gfs2_rbm rbm = { .rgd = rgd, .bi = rgd->rd_bits, .offset = 0 };
1636 down_write(&sdp->sd_log_flush_lock);
1637 error = gfs2_rbm_find(&rbm, GFS2_BLKST_UNLINKED, NULL, true);
1638 up_write(&sdp->sd_log_flush_lock);
1639 if (error == -ENOSPC)
1641 if (WARN_ON_ONCE(error))
1644 block = gfs2_rbm_to_block(&rbm);
1645 if (gfs2_rbm_from_block(&rbm, block + 1))
1647 if (*last_unlinked != NO_BLOCK && block <= *last_unlinked)
1651 *last_unlinked = block;
1653 error = gfs2_glock_get(sdp, block, &gfs2_inode_glops, CREATE, &gl);
1657 /* If the inode is already in cache, we can ignore it here
1658 * because the existing inode disposal code will deal with
1659 * it when all refs have gone away. Accessing gl_object like
1660 * this is not safe in general. Here it is ok because we do
1661 * not dereference the pointer, and we only need an approx
1662 * answer to whether it is NULL or not.
1666 if (ip || queue_work(gfs2_delete_workqueue, &gl->gl_delete) == 0)
1671 /* Limit reclaim to sensible number of tasks */
1672 if (found > NR_CPUS)
1676 rgd->rd_flags &= ~GFS2_RDF_CHECK;
1681 * gfs2_inplace_reserve - Reserve space in the filesystem
1682 * @ip: the inode to reserve space for
1683 * @requested: the number of blocks to be reserved
1688 int gfs2_inplace_reserve(struct gfs2_inode *ip, u32 requested)
1690 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1691 struct gfs2_rgrpd *begin = NULL;
1692 struct gfs2_blkreserv *rs = ip->i_res;
1693 int error = 0, rg_locked, flags = LM_FLAG_TRY;
1694 u64 last_unlinked = NO_BLOCK;
1697 if (sdp->sd_args.ar_rgrplvb)
1699 if (gfs2_assert_warn(sdp, requested)) {
1703 if (gfs2_rs_active(rs)) {
1704 begin = rs->rs_rbm.rgd;
1705 flags = 0; /* Yoda: Do or do not. There is no try */
1706 } else if (ip->i_rgd && rgrp_contains_block(ip->i_rgd, ip->i_goal)) {
1707 rs->rs_rbm.rgd = begin = ip->i_rgd;
1709 rs->rs_rbm.rgd = begin = gfs2_blk2rgrpd(sdp, ip->i_goal, 1);
1711 if (rs->rs_rbm.rgd == NULL)
1717 if (gfs2_glock_is_locked_by_me(rs->rs_rbm.rgd->rd_gl)) {
1720 } else if (!loops && !gfs2_rs_active(rs) &&
1721 rs->rs_rbm.rgd->rd_rs_cnt > RGRP_RSRV_MAX_CONTENDERS) {
1722 /* If the rgrp already is maxed out for contenders,
1723 we can eliminate it as a "first pass" without even
1724 requesting the rgrp glock. */
1725 error = GLR_TRYFAILED;
1727 error = gfs2_glock_nq_init(rs->rs_rbm.rgd->rd_gl,
1728 LM_ST_EXCLUSIVE, flags,
1730 if (!error && sdp->sd_args.ar_rgrplvb) {
1731 error = update_rgrp_lvb(rs->rs_rbm.rgd);
1733 gfs2_glock_dq_uninit(&rs->rs_rgd_gh);
1740 if (gfs2_rs_active(rs)) {
1741 if (unclaimed_blocks(rs->rs_rbm.rgd) +
1742 rs->rs_free >= requested) {
1743 ip->i_rgd = rs->rs_rbm.rgd;
1746 /* We have a multi-block reservation, but the
1747 rgrp doesn't have enough free blocks to
1748 satisfy the request. Free the reservation
1749 and look for a suitable rgrp. */
1750 gfs2_rs_deltree(ip, rs);
1752 if (try_rgrp_fit(rs->rs_rbm.rgd, ip, requested)) {
1753 if (sdp->sd_args.ar_rgrplvb)
1754 gfs2_rgrp_bh_get(rs->rs_rbm.rgd);
1755 ip->i_rgd = rs->rs_rbm.rgd;
1758 if (rs->rs_rbm.rgd->rd_flags & GFS2_RDF_CHECK) {
1759 if (sdp->sd_args.ar_rgrplvb)
1760 gfs2_rgrp_bh_get(rs->rs_rbm.rgd);
1761 try_rgrp_unlink(rs->rs_rbm.rgd, &last_unlinked,
1765 gfs2_glock_dq_uninit(&rs->rs_rgd_gh);
1768 rs->rs_rbm.rgd = gfs2_rgrpd_get_next(rs->rs_rbm.rgd);
1769 rs->rs_rbm.rgd = rs->rs_rbm.rgd ? : begin; /* if NULL, wrap */
1770 if (rs->rs_rbm.rgd != begin) /* If we didn't wrap */
1773 flags &= ~LM_FLAG_TRY;
1775 /* Check that fs hasn't grown if writing to rindex */
1776 if (ip == GFS2_I(sdp->sd_rindex) &&
1777 !sdp->sd_rindex_uptodate) {
1778 error = gfs2_ri_update(ip);
1781 } else if (loops == 2)
1782 /* Flushing the log may release space */
1783 gfs2_log_flush(sdp, NULL);
1796 * gfs2_inplace_release - release an inplace reservation
1797 * @ip: the inode the reservation was taken out on
1799 * Release a reservation made by gfs2_inplace_reserve().
1802 void gfs2_inplace_release(struct gfs2_inode *ip)
1804 struct gfs2_blkreserv *rs = ip->i_res;
1806 if (rs->rs_rgd_gh.gh_gl)
1807 gfs2_glock_dq_uninit(&rs->rs_rgd_gh);
1811 * gfs2_get_block_type - Check a block in a RG is of given type
1812 * @rgd: the resource group holding the block
1813 * @block: the block number
1815 * Returns: The block type (GFS2_BLKST_*)
1818 static unsigned char gfs2_get_block_type(struct gfs2_rgrpd *rgd, u64 block)
1820 struct gfs2_rbm rbm = { .rgd = rgd, };
1823 ret = gfs2_rbm_from_block(&rbm, block);
1824 WARN_ON_ONCE(ret != 0);
1826 return gfs2_testbit(&rbm);
1831 * gfs2_alloc_extent - allocate an extent from a given bitmap
1832 * @rbm: the resource group information
1833 * @dinode: TRUE if the first block we allocate is for a dinode
1834 * @n: The extent length (value/result)
1836 * Add the bitmap buffer to the transaction.
1837 * Set the found bits to @new_state to change block's allocation state.
1839 static void gfs2_alloc_extent(const struct gfs2_rbm *rbm, bool dinode,
1842 struct gfs2_rbm pos = { .rgd = rbm->rgd, };
1843 const unsigned int elen = *n;
1848 block = gfs2_rbm_to_block(rbm);
1849 gfs2_trans_add_bh(rbm->rgd->rd_gl, rbm->bi->bi_bh, 1);
1850 gfs2_setbit(rbm, true, dinode ? GFS2_BLKST_DINODE : GFS2_BLKST_USED);
1853 ret = gfs2_rbm_from_block(&pos, block);
1855 if (gfs2_testbit(&pos) != GFS2_BLKST_FREE)
1857 gfs2_trans_add_bh(pos.rgd->rd_gl, pos.bi->bi_bh, 1);
1858 gfs2_setbit(&pos, true, GFS2_BLKST_USED);
1865 * rgblk_free - Change alloc state of given block(s)
1866 * @sdp: the filesystem
1867 * @bstart: the start of a run of blocks to free
1868 * @blen: the length of the block run (all must lie within ONE RG!)
1869 * @new_state: GFS2_BLKST_XXX the after-allocation block state
1871 * Returns: Resource group containing the block(s)
1874 static struct gfs2_rgrpd *rgblk_free(struct gfs2_sbd *sdp, u64 bstart,
1875 u32 blen, unsigned char new_state)
1877 struct gfs2_rbm rbm;
1879 rbm.rgd = gfs2_blk2rgrpd(sdp, bstart, 1);
1881 if (gfs2_consist(sdp))
1882 fs_err(sdp, "block = %llu\n", (unsigned long long)bstart);
1887 gfs2_rbm_from_block(&rbm, bstart);
1889 if (!rbm.bi->bi_clone) {
1890 rbm.bi->bi_clone = kmalloc(rbm.bi->bi_bh->b_size,
1891 GFP_NOFS | __GFP_NOFAIL);
1892 memcpy(rbm.bi->bi_clone + rbm.bi->bi_offset,
1893 rbm.bi->bi_bh->b_data + rbm.bi->bi_offset,
1896 gfs2_trans_add_bh(rbm.rgd->rd_gl, rbm.bi->bi_bh, 1);
1897 gfs2_setbit(&rbm, false, new_state);
1904 * gfs2_rgrp_dump - print out an rgrp
1905 * @seq: The iterator
1906 * @gl: The glock in question
1910 int gfs2_rgrp_dump(struct seq_file *seq, const struct gfs2_glock *gl)
1912 struct gfs2_rgrpd *rgd = gl->gl_object;
1913 struct gfs2_blkreserv *trs;
1914 const struct rb_node *n;
1918 gfs2_print_dbg(seq, " R: n:%llu f:%02x b:%u/%u i:%u r:%u\n",
1919 (unsigned long long)rgd->rd_addr, rgd->rd_flags,
1920 rgd->rd_free, rgd->rd_free_clone, rgd->rd_dinodes,
1922 spin_lock(&rgd->rd_rsspin);
1923 for (n = rb_first(&rgd->rd_rstree); n; n = rb_next(&trs->rs_node)) {
1924 trs = rb_entry(n, struct gfs2_blkreserv, rs_node);
1927 spin_unlock(&rgd->rd_rsspin);
1931 static void gfs2_rgrp_error(struct gfs2_rgrpd *rgd)
1933 struct gfs2_sbd *sdp = rgd->rd_sbd;
1934 fs_warn(sdp, "rgrp %llu has an error, marking it readonly until umount\n",
1935 (unsigned long long)rgd->rd_addr);
1936 fs_warn(sdp, "umount on all nodes and run fsck.gfs2 to fix the error\n");
1937 gfs2_rgrp_dump(NULL, rgd->rd_gl);
1938 rgd->rd_flags |= GFS2_RDF_ERROR;
1942 * gfs2_adjust_reservation - Adjust (or remove) a reservation after allocation
1943 * @ip: The inode we have just allocated blocks for
1944 * @rbm: The start of the allocated blocks
1945 * @len: The extent length
1947 * Adjusts a reservation after an allocation has taken place. If the
1948 * reservation does not match the allocation, or if it is now empty
1949 * then it is removed.
1952 static void gfs2_adjust_reservation(struct gfs2_inode *ip,
1953 const struct gfs2_rbm *rbm, unsigned len)
1955 struct gfs2_blkreserv *rs = ip->i_res;
1956 struct gfs2_rgrpd *rgd = rbm->rgd;
1961 spin_lock(&rgd->rd_rsspin);
1962 if (gfs2_rs_active(rs)) {
1963 if (gfs2_rbm_eq(&rs->rs_rbm, rbm)) {
1964 block = gfs2_rbm_to_block(rbm);
1965 ret = gfs2_rbm_from_block(&rs->rs_rbm, block + len);
1966 rlen = min(rs->rs_free, len);
1967 rs->rs_free -= rlen;
1968 rgd->rd_reserved -= rlen;
1969 trace_gfs2_rs(ip, rs, TRACE_RS_CLAIM);
1970 if (rs->rs_free && !ret)
1973 __rs_deltree(ip, rs);
1976 spin_unlock(&rgd->rd_rsspin);
1980 * gfs2_alloc_blocks - Allocate one or more blocks of data and/or a dinode
1981 * @ip: the inode to allocate the block for
1982 * @bn: Used to return the starting block number
1983 * @nblocks: requested number of blocks/extent length (value/result)
1984 * @dinode: 1 if we're allocating a dinode block, else 0
1985 * @generation: the generation number of the inode
1987 * Returns: 0 or error
1990 int gfs2_alloc_blocks(struct gfs2_inode *ip, u64 *bn, unsigned int *nblocks,
1991 bool dinode, u64 *generation)
1993 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1994 struct buffer_head *dibh;
1995 struct gfs2_rbm rbm = { .rgd = ip->i_rgd, };
1998 u64 block; /* block, within the file system scope */
2001 if (gfs2_rs_active(ip->i_res))
2002 goal = gfs2_rbm_to_block(&ip->i_res->rs_rbm);
2003 else if (!dinode && rgrp_contains_block(rbm.rgd, ip->i_goal))
2006 goal = rbm.rgd->rd_last_alloc + rbm.rgd->rd_data0;
2008 if ((goal < rbm.rgd->rd_data0) ||
2009 (goal >= rbm.rgd->rd_data0 + rbm.rgd->rd_data))
2010 rbm.rgd = gfs2_blk2rgrpd(sdp, goal, 1);
2012 gfs2_rbm_from_block(&rbm, goal);
2013 error = gfs2_rbm_find(&rbm, GFS2_BLKST_FREE, ip, false);
2015 if (error == -ENOSPC) {
2016 gfs2_rbm_from_block(&rbm, goal);
2017 error = gfs2_rbm_find(&rbm, GFS2_BLKST_FREE, NULL, false);
2020 /* Since all blocks are reserved in advance, this shouldn't happen */
2022 fs_warn(sdp, "error=%d, nblocks=%u, full=%d\n", error, *nblocks,
2023 test_bit(GBF_FULL, &rbm.rgd->rd_bits->bi_flags));
2027 gfs2_alloc_extent(&rbm, dinode, nblocks);
2028 block = gfs2_rbm_to_block(&rbm);
2029 if (gfs2_rs_active(ip->i_res))
2030 gfs2_adjust_reservation(ip, &rbm, *nblocks);
2036 ip->i_goal = block + ndata - 1;
2037 error = gfs2_meta_inode_buffer(ip, &dibh);
2039 struct gfs2_dinode *di =
2040 (struct gfs2_dinode *)dibh->b_data;
2041 gfs2_trans_add_bh(ip->i_gl, dibh, 1);
2042 di->di_goal_meta = di->di_goal_data =
2043 cpu_to_be64(ip->i_goal);
2047 if (rbm.rgd->rd_free < *nblocks) {
2048 printk(KERN_WARNING "nblocks=%u\n", *nblocks);
2052 rbm.rgd->rd_free -= *nblocks;
2054 rbm.rgd->rd_dinodes++;
2055 *generation = rbm.rgd->rd_igeneration++;
2056 if (*generation == 0)
2057 *generation = rbm.rgd->rd_igeneration++;
2060 gfs2_trans_add_bh(rbm.rgd->rd_gl, rbm.rgd->rd_bits[0].bi_bh, 1);
2061 gfs2_rgrp_out(rbm.rgd, rbm.rgd->rd_bits[0].bi_bh->b_data);
2062 gfs2_rgrp_ondisk2lvb(rbm.rgd->rd_rgl, rbm.rgd->rd_bits[0].bi_bh->b_data);
2064 gfs2_statfs_change(sdp, 0, -(s64)*nblocks, dinode ? 1 : 0);
2066 gfs2_trans_add_unrevoke(sdp, block, 1);
2069 * This needs reviewing to see why we cannot do the quota change
2070 * at this point in the dinode case.
2073 gfs2_quota_change(ip, ndata, ip->i_inode.i_uid,
2076 rbm.rgd->rd_free_clone -= *nblocks;
2077 trace_gfs2_block_alloc(ip, rbm.rgd, block, *nblocks,
2078 dinode ? GFS2_BLKST_DINODE : GFS2_BLKST_USED);
2083 gfs2_rgrp_error(rbm.rgd);
2088 * __gfs2_free_blocks - free a contiguous run of block(s)
2089 * @ip: the inode these blocks are being freed from
2090 * @bstart: first block of a run of contiguous blocks
2091 * @blen: the length of the block run
2092 * @meta: 1 if the blocks represent metadata
2096 void __gfs2_free_blocks(struct gfs2_inode *ip, u64 bstart, u32 blen, int meta)
2098 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
2099 struct gfs2_rgrpd *rgd;
2101 rgd = rgblk_free(sdp, bstart, blen, GFS2_BLKST_FREE);
2104 trace_gfs2_block_alloc(ip, rgd, bstart, blen, GFS2_BLKST_FREE);
2105 rgd->rd_free += blen;
2106 rgd->rd_flags &= ~GFS2_RGF_TRIMMED;
2107 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
2108 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
2109 gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, rgd->rd_bits[0].bi_bh->b_data);
2111 /* Directories keep their data in the metadata address space */
2112 if (meta || ip->i_depth)
2113 gfs2_meta_wipe(ip, bstart, blen);
2117 * gfs2_free_meta - free a contiguous run of data block(s)
2118 * @ip: the inode these blocks are being freed from
2119 * @bstart: first block of a run of contiguous blocks
2120 * @blen: the length of the block run
2124 void gfs2_free_meta(struct gfs2_inode *ip, u64 bstart, u32 blen)
2126 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
2128 __gfs2_free_blocks(ip, bstart, blen, 1);
2129 gfs2_statfs_change(sdp, 0, +blen, 0);
2130 gfs2_quota_change(ip, -(s64)blen, ip->i_inode.i_uid, ip->i_inode.i_gid);
2133 void gfs2_unlink_di(struct inode *inode)
2135 struct gfs2_inode *ip = GFS2_I(inode);
2136 struct gfs2_sbd *sdp = GFS2_SB(inode);
2137 struct gfs2_rgrpd *rgd;
2138 u64 blkno = ip->i_no_addr;
2140 rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_UNLINKED);
2143 trace_gfs2_block_alloc(ip, rgd, blkno, 1, GFS2_BLKST_UNLINKED);
2144 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
2145 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
2146 gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, rgd->rd_bits[0].bi_bh->b_data);
2147 update_rgrp_lvb_unlinked(rgd, 1);
2150 static void gfs2_free_uninit_di(struct gfs2_rgrpd *rgd, u64 blkno)
2152 struct gfs2_sbd *sdp = rgd->rd_sbd;
2153 struct gfs2_rgrpd *tmp_rgd;
2155 tmp_rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_FREE);
2158 gfs2_assert_withdraw(sdp, rgd == tmp_rgd);
2160 if (!rgd->rd_dinodes)
2161 gfs2_consist_rgrpd(rgd);
2165 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
2166 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
2167 gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, rgd->rd_bits[0].bi_bh->b_data);
2168 update_rgrp_lvb_unlinked(rgd, -1);
2170 gfs2_statfs_change(sdp, 0, +1, -1);
2174 void gfs2_free_di(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip)
2176 gfs2_free_uninit_di(rgd, ip->i_no_addr);
2177 trace_gfs2_block_alloc(ip, rgd, ip->i_no_addr, 1, GFS2_BLKST_FREE);
2178 gfs2_quota_change(ip, -1, ip->i_inode.i_uid, ip->i_inode.i_gid);
2179 gfs2_meta_wipe(ip, ip->i_no_addr, 1);
2183 * gfs2_check_blk_type - Check the type of a block
2184 * @sdp: The superblock
2185 * @no_addr: The block number to check
2186 * @type: The block type we are looking for
2188 * Returns: 0 if the block type matches the expected type
2189 * -ESTALE if it doesn't match
2190 * or -ve errno if something went wrong while checking
2193 int gfs2_check_blk_type(struct gfs2_sbd *sdp, u64 no_addr, unsigned int type)
2195 struct gfs2_rgrpd *rgd;
2196 struct gfs2_holder rgd_gh;
2197 int error = -EINVAL;
2199 rgd = gfs2_blk2rgrpd(sdp, no_addr, 1);
2203 error = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_SHARED, 0, &rgd_gh);
2207 if (gfs2_get_block_type(rgd, no_addr) != type)
2210 gfs2_glock_dq_uninit(&rgd_gh);
2216 * gfs2_rlist_add - add a RG to a list of RGs
2218 * @rlist: the list of resource groups
2221 * Figure out what RG a block belongs to and add that RG to the list
2223 * FIXME: Don't use NOFAIL
2227 void gfs2_rlist_add(struct gfs2_inode *ip, struct gfs2_rgrp_list *rlist,
2230 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
2231 struct gfs2_rgrpd *rgd;
2232 struct gfs2_rgrpd **tmp;
2233 unsigned int new_space;
2236 if (gfs2_assert_warn(sdp, !rlist->rl_ghs))
2239 if (ip->i_rgd && rgrp_contains_block(ip->i_rgd, block))
2242 rgd = gfs2_blk2rgrpd(sdp, block, 1);
2244 fs_err(sdp, "rlist_add: no rgrp for block %llu\n", (unsigned long long)block);
2249 for (x = 0; x < rlist->rl_rgrps; x++)
2250 if (rlist->rl_rgd[x] == rgd)
2253 if (rlist->rl_rgrps == rlist->rl_space) {
2254 new_space = rlist->rl_space + 10;
2256 tmp = kcalloc(new_space, sizeof(struct gfs2_rgrpd *),
2257 GFP_NOFS | __GFP_NOFAIL);
2259 if (rlist->rl_rgd) {
2260 memcpy(tmp, rlist->rl_rgd,
2261 rlist->rl_space * sizeof(struct gfs2_rgrpd *));
2262 kfree(rlist->rl_rgd);
2265 rlist->rl_space = new_space;
2266 rlist->rl_rgd = tmp;
2269 rlist->rl_rgd[rlist->rl_rgrps++] = rgd;
2273 * gfs2_rlist_alloc - all RGs have been added to the rlist, now allocate
2274 * and initialize an array of glock holders for them
2275 * @rlist: the list of resource groups
2276 * @state: the lock state to acquire the RG lock in
2278 * FIXME: Don't use NOFAIL
2282 void gfs2_rlist_alloc(struct gfs2_rgrp_list *rlist, unsigned int state)
2286 rlist->rl_ghs = kcalloc(rlist->rl_rgrps, sizeof(struct gfs2_holder),
2287 GFP_NOFS | __GFP_NOFAIL);
2288 for (x = 0; x < rlist->rl_rgrps; x++)
2289 gfs2_holder_init(rlist->rl_rgd[x]->rd_gl,
2295 * gfs2_rlist_free - free a resource group list
2296 * @list: the list of resource groups
2300 void gfs2_rlist_free(struct gfs2_rgrp_list *rlist)
2304 kfree(rlist->rl_rgd);
2306 if (rlist->rl_ghs) {
2307 for (x = 0; x < rlist->rl_rgrps; x++)
2308 gfs2_holder_uninit(&rlist->rl_ghs[x]);
2309 kfree(rlist->rl_ghs);
2310 rlist->rl_ghs = NULL;