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 * @rgd: the resource group descriptor
121 * @buffer: the buffer that holds the bitmaps
122 * @buflen: the length (in bytes) of the buffer
123 * @block: the block to read
127 static inline unsigned char gfs2_testbit(struct gfs2_rgrpd *rgd,
128 const unsigned char *buffer,
129 unsigned int buflen, u32 block)
131 const unsigned char *byte, *end;
132 unsigned char cur_state;
135 byte = buffer + (block / GFS2_NBBY);
136 bit = (block % GFS2_NBBY) * GFS2_BIT_SIZE;
137 end = buffer + buflen;
139 gfs2_assert(rgd->rd_sbd, byte < end);
141 cur_state = (*byte >> bit) & GFS2_BIT_MASK;
148 * @ptr: Pointer to bitmap data
149 * @mask: Mask to use (normally 0x55555.... but adjusted for search start)
150 * @state: The state we are searching for
152 * We xor the bitmap data with a patter which is the bitwise opposite
153 * of what we are looking for, this gives rise to a pattern of ones
154 * wherever there is a match. Since we have two bits per entry, we
155 * take this pattern, shift it down by one place and then and it with
156 * the original. All the even bit positions (0,2,4, etc) then represent
157 * successful matches, so we mask with 0x55555..... to remove the unwanted
160 * This allows searching of a whole u64 at once (32 blocks) with a
161 * single test (on 64 bit arches).
164 static inline u64 gfs2_bit_search(const __le64 *ptr, u64 mask, u8 state)
167 static const u64 search[] = {
168 [0] = 0xffffffffffffffffULL,
169 [1] = 0xaaaaaaaaaaaaaaaaULL,
170 [2] = 0x5555555555555555ULL,
171 [3] = 0x0000000000000000ULL,
173 tmp = le64_to_cpu(*ptr) ^ search[state];
180 * rs_cmp - multi-block reservation range compare
181 * @blk: absolute file system block number of the new reservation
182 * @len: number of blocks in the new reservation
183 * @rs: existing reservation to compare against
185 * returns: 1 if the block range is beyond the reach of the reservation
186 * -1 if the block range is before the start of the reservation
187 * 0 if the block range overlaps with the reservation
189 static inline int rs_cmp(u64 blk, u32 len, struct gfs2_blkreserv *rs)
191 u64 startblk = gfs2_rbm_to_block(&rs->rs_rbm);
193 if (blk >= startblk + rs->rs_free)
195 if (blk + len - 1 < startblk)
201 * gfs2_bitfit - Search an rgrp's bitmap buffer to find a bit-pair representing
202 * a block in a given allocation state.
203 * @buf: the buffer that holds the bitmaps
204 * @len: the length (in bytes) of the buffer
205 * @goal: start search at this block's bit-pair (within @buffer)
206 * @state: GFS2_BLKST_XXX the state of the block we're looking for.
208 * Scope of @goal and returned block number is only within this bitmap buffer,
209 * not entire rgrp or filesystem. @buffer will be offset from the actual
210 * beginning of a bitmap block buffer, skipping any header structures, but
211 * headers are always a multiple of 64 bits long so that the buffer is
212 * always aligned to a 64 bit boundary.
214 * The size of the buffer is in bytes, but is it assumed that it is
215 * always ok to read a complete multiple of 64 bits at the end
216 * of the block in case the end is no aligned to a natural boundary.
218 * Return: the block number (bitmap buffer scope) that was found
221 static u32 gfs2_bitfit(const u8 *buf, const unsigned int len,
224 u32 spoint = (goal << 1) & ((8*sizeof(u64)) - 1);
225 const __le64 *ptr = ((__le64 *)buf) + (goal >> 5);
226 const __le64 *end = (__le64 *)(buf + ALIGN(len, sizeof(u64)));
228 u64 mask = 0x5555555555555555ULL;
233 /* Mask off bits we don't care about at the start of the search */
235 tmp = gfs2_bit_search(ptr, mask, state);
237 while(tmp == 0 && ptr < end) {
238 tmp = gfs2_bit_search(ptr, 0x5555555555555555ULL, state);
241 /* Mask off any bits which are more than len bytes from the start */
242 if (ptr == end && (len & (sizeof(u64) - 1)))
243 tmp &= (((u64)~0) >> (64 - 8*(len & (sizeof(u64) - 1))));
244 /* Didn't find anything, so return */
249 bit /= 2; /* two bits per entry in the bitmap */
250 return (((const unsigned char *)ptr - buf) * GFS2_NBBY) + bit;
254 * gfs2_bitcount - count the number of bits in a certain state
255 * @rgd: the resource group descriptor
256 * @buffer: the buffer that holds the bitmaps
257 * @buflen: the length (in bytes) of the buffer
258 * @state: the state of the block we're looking for
260 * Returns: The number of bits
263 static u32 gfs2_bitcount(struct gfs2_rgrpd *rgd, const u8 *buffer,
264 unsigned int buflen, u8 state)
266 const u8 *byte = buffer;
267 const u8 *end = buffer + buflen;
268 const u8 state1 = state << 2;
269 const u8 state2 = state << 4;
270 const u8 state3 = state << 6;
273 for (; byte < end; byte++) {
274 if (((*byte) & 0x03) == state)
276 if (((*byte) & 0x0C) == state1)
278 if (((*byte) & 0x30) == state2)
280 if (((*byte) & 0xC0) == state3)
288 * gfs2_rgrp_verify - Verify that a resource group is consistent
293 void gfs2_rgrp_verify(struct gfs2_rgrpd *rgd)
295 struct gfs2_sbd *sdp = rgd->rd_sbd;
296 struct gfs2_bitmap *bi = NULL;
297 u32 length = rgd->rd_length;
301 memset(count, 0, 4 * sizeof(u32));
303 /* Count # blocks in each of 4 possible allocation states */
304 for (buf = 0; buf < length; buf++) {
305 bi = rgd->rd_bits + buf;
306 for (x = 0; x < 4; x++)
307 count[x] += gfs2_bitcount(rgd,
313 if (count[0] != rgd->rd_free) {
314 if (gfs2_consist_rgrpd(rgd))
315 fs_err(sdp, "free data mismatch: %u != %u\n",
316 count[0], rgd->rd_free);
320 tmp = rgd->rd_data - rgd->rd_free - rgd->rd_dinodes;
321 if (count[1] != tmp) {
322 if (gfs2_consist_rgrpd(rgd))
323 fs_err(sdp, "used data mismatch: %u != %u\n",
328 if (count[2] + count[3] != rgd->rd_dinodes) {
329 if (gfs2_consist_rgrpd(rgd))
330 fs_err(sdp, "used metadata mismatch: %u != %u\n",
331 count[2] + count[3], rgd->rd_dinodes);
336 static inline int rgrp_contains_block(struct gfs2_rgrpd *rgd, u64 block)
338 u64 first = rgd->rd_data0;
339 u64 last = first + rgd->rd_data;
340 return first <= block && block < last;
344 * gfs2_blk2rgrpd - Find resource group for a given data/meta block number
345 * @sdp: The GFS2 superblock
346 * @blk: The data block number
347 * @exact: True if this needs to be an exact match
349 * Returns: The resource group, or NULL if not found
352 struct gfs2_rgrpd *gfs2_blk2rgrpd(struct gfs2_sbd *sdp, u64 blk, bool exact)
354 struct rb_node *n, *next;
355 struct gfs2_rgrpd *cur;
357 spin_lock(&sdp->sd_rindex_spin);
358 n = sdp->sd_rindex_tree.rb_node;
360 cur = rb_entry(n, struct gfs2_rgrpd, rd_node);
362 if (blk < cur->rd_addr)
364 else if (blk >= cur->rd_data0 + cur->rd_data)
367 spin_unlock(&sdp->sd_rindex_spin);
369 if (blk < cur->rd_addr)
371 if (blk >= cur->rd_data0 + cur->rd_data)
378 spin_unlock(&sdp->sd_rindex_spin);
384 * gfs2_rgrpd_get_first - get the first Resource Group in the filesystem
385 * @sdp: The GFS2 superblock
387 * Returns: The first rgrp in the filesystem
390 struct gfs2_rgrpd *gfs2_rgrpd_get_first(struct gfs2_sbd *sdp)
392 const struct rb_node *n;
393 struct gfs2_rgrpd *rgd;
395 spin_lock(&sdp->sd_rindex_spin);
396 n = rb_first(&sdp->sd_rindex_tree);
397 rgd = rb_entry(n, struct gfs2_rgrpd, rd_node);
398 spin_unlock(&sdp->sd_rindex_spin);
404 * gfs2_rgrpd_get_next - get the next RG
405 * @rgd: the resource group descriptor
407 * Returns: The next rgrp
410 struct gfs2_rgrpd *gfs2_rgrpd_get_next(struct gfs2_rgrpd *rgd)
412 struct gfs2_sbd *sdp = rgd->rd_sbd;
413 const struct rb_node *n;
415 spin_lock(&sdp->sd_rindex_spin);
416 n = rb_next(&rgd->rd_node);
418 n = rb_first(&sdp->sd_rindex_tree);
420 if (unlikely(&rgd->rd_node == n)) {
421 spin_unlock(&sdp->sd_rindex_spin);
424 rgd = rb_entry(n, struct gfs2_rgrpd, rd_node);
425 spin_unlock(&sdp->sd_rindex_spin);
429 void gfs2_free_clones(struct gfs2_rgrpd *rgd)
433 for (x = 0; x < rgd->rd_length; x++) {
434 struct gfs2_bitmap *bi = rgd->rd_bits + x;
441 * gfs2_rs_alloc - make sure we have a reservation assigned to the inode
442 * @ip: the inode for this reservation
444 int gfs2_rs_alloc(struct gfs2_inode *ip)
447 struct gfs2_blkreserv *res;
452 res = kmem_cache_zalloc(gfs2_rsrv_cachep, GFP_NOFS);
456 RB_CLEAR_NODE(&res->rs_node);
458 down_write(&ip->i_rw_mutex);
460 kmem_cache_free(gfs2_rsrv_cachep, res);
463 up_write(&ip->i_rw_mutex);
467 static void dump_rs(struct seq_file *seq, struct gfs2_blkreserv *rs)
469 gfs2_print_dbg(seq, " r: %llu s:%llu b:%u f:%u\n",
470 rs->rs_rbm.rgd->rd_addr, gfs2_rbm_to_block(&rs->rs_rbm),
471 rs->rs_rbm.offset, rs->rs_free);
475 * __rs_deltree - remove a multi-block reservation from the rgd tree
476 * @rs: The reservation to remove
479 static void __rs_deltree(struct gfs2_inode *ip, struct gfs2_blkreserv *rs)
481 struct gfs2_rgrpd *rgd;
483 if (!gfs2_rs_active(rs))
486 rgd = rs->rs_rbm.rgd;
487 trace_gfs2_rs(ip, rs, TRACE_RS_TREEDEL);
488 rb_erase(&rs->rs_node, &rgd->rd_rstree);
489 RB_CLEAR_NODE(&rs->rs_node);
490 BUG_ON(!rgd->rd_rs_cnt);
494 /* return reserved blocks to the rgrp and the ip */
495 BUG_ON(rs->rs_rbm.rgd->rd_reserved < rs->rs_free);
496 rs->rs_rbm.rgd->rd_reserved -= rs->rs_free;
498 clear_bit(GBF_FULL, &rs->rs_rbm.bi->bi_flags);
499 smp_mb__after_clear_bit();
504 * gfs2_rs_deltree - remove a multi-block reservation from the rgd tree
505 * @rs: The reservation to remove
508 void gfs2_rs_deltree(struct gfs2_inode *ip, struct gfs2_blkreserv *rs)
510 struct gfs2_rgrpd *rgd;
512 rgd = rs->rs_rbm.rgd;
514 spin_lock(&rgd->rd_rsspin);
515 __rs_deltree(ip, rs);
516 spin_unlock(&rgd->rd_rsspin);
521 * gfs2_rs_delete - delete a multi-block reservation
522 * @ip: The inode for this reservation
525 void gfs2_rs_delete(struct gfs2_inode *ip)
527 down_write(&ip->i_rw_mutex);
529 gfs2_rs_deltree(ip, ip->i_res);
530 trace_gfs2_rs(ip, ip->i_res, TRACE_RS_DELETE);
531 BUG_ON(ip->i_res->rs_free);
532 kmem_cache_free(gfs2_rsrv_cachep, ip->i_res);
535 up_write(&ip->i_rw_mutex);
539 * return_all_reservations - return all reserved blocks back to the rgrp.
540 * @rgd: the rgrp that needs its space back
542 * We previously reserved a bunch of blocks for allocation. Now we need to
543 * give them back. This leave the reservation structures in tact, but removes
544 * all of their corresponding "no-fly zones".
546 static void return_all_reservations(struct gfs2_rgrpd *rgd)
549 struct gfs2_blkreserv *rs;
551 spin_lock(&rgd->rd_rsspin);
552 while ((n = rb_first(&rgd->rd_rstree))) {
553 rs = rb_entry(n, struct gfs2_blkreserv, rs_node);
554 __rs_deltree(NULL, rs);
556 spin_unlock(&rgd->rd_rsspin);
559 void gfs2_clear_rgrpd(struct gfs2_sbd *sdp)
562 struct gfs2_rgrpd *rgd;
563 struct gfs2_glock *gl;
565 while ((n = rb_first(&sdp->sd_rindex_tree))) {
566 rgd = rb_entry(n, struct gfs2_rgrpd, rd_node);
569 rb_erase(n, &sdp->sd_rindex_tree);
572 spin_lock(&gl->gl_spin);
573 gl->gl_object = NULL;
574 spin_unlock(&gl->gl_spin);
575 gfs2_glock_add_to_lru(gl);
579 gfs2_free_clones(rgd);
581 return_all_reservations(rgd);
582 kmem_cache_free(gfs2_rgrpd_cachep, rgd);
586 static void gfs2_rindex_print(const struct gfs2_rgrpd *rgd)
588 printk(KERN_INFO " ri_addr = %llu\n", (unsigned long long)rgd->rd_addr);
589 printk(KERN_INFO " ri_length = %u\n", rgd->rd_length);
590 printk(KERN_INFO " ri_data0 = %llu\n", (unsigned long long)rgd->rd_data0);
591 printk(KERN_INFO " ri_data = %u\n", rgd->rd_data);
592 printk(KERN_INFO " ri_bitbytes = %u\n", rgd->rd_bitbytes);
596 * gfs2_compute_bitstructs - Compute the bitmap sizes
597 * @rgd: The resource group descriptor
599 * Calculates bitmap descriptors, one for each block that contains bitmap data
604 static int compute_bitstructs(struct gfs2_rgrpd *rgd)
606 struct gfs2_sbd *sdp = rgd->rd_sbd;
607 struct gfs2_bitmap *bi;
608 u32 length = rgd->rd_length; /* # blocks in hdr & bitmap */
609 u32 bytes_left, bytes;
615 rgd->rd_bits = kcalloc(length, sizeof(struct gfs2_bitmap), GFP_NOFS);
619 bytes_left = rgd->rd_bitbytes;
621 for (x = 0; x < length; x++) {
622 bi = rgd->rd_bits + x;
625 /* small rgrp; bitmap stored completely in header block */
628 bi->bi_offset = sizeof(struct gfs2_rgrp);
633 bytes = sdp->sd_sb.sb_bsize - sizeof(struct gfs2_rgrp);
634 bi->bi_offset = sizeof(struct gfs2_rgrp);
638 } else if (x + 1 == length) {
640 bi->bi_offset = sizeof(struct gfs2_meta_header);
641 bi->bi_start = rgd->rd_bitbytes - bytes_left;
645 bytes = sdp->sd_sb.sb_bsize -
646 sizeof(struct gfs2_meta_header);
647 bi->bi_offset = sizeof(struct gfs2_meta_header);
648 bi->bi_start = rgd->rd_bitbytes - bytes_left;
656 gfs2_consist_rgrpd(rgd);
659 bi = rgd->rd_bits + (length - 1);
660 if ((bi->bi_start + bi->bi_len) * GFS2_NBBY != rgd->rd_data) {
661 if (gfs2_consist_rgrpd(rgd)) {
662 gfs2_rindex_print(rgd);
663 fs_err(sdp, "start=%u len=%u offset=%u\n",
664 bi->bi_start, bi->bi_len, bi->bi_offset);
673 * gfs2_ri_total - Total up the file system space, according to the rindex.
674 * @sdp: the filesystem
677 u64 gfs2_ri_total(struct gfs2_sbd *sdp)
680 struct inode *inode = sdp->sd_rindex;
681 struct gfs2_inode *ip = GFS2_I(inode);
682 char buf[sizeof(struct gfs2_rindex)];
685 for (rgrps = 0;; rgrps++) {
686 loff_t pos = rgrps * sizeof(struct gfs2_rindex);
688 if (pos + sizeof(struct gfs2_rindex) > i_size_read(inode))
690 error = gfs2_internal_read(ip, buf, &pos,
691 sizeof(struct gfs2_rindex));
692 if (error != sizeof(struct gfs2_rindex))
694 total_data += be32_to_cpu(((struct gfs2_rindex *)buf)->ri_data);
699 static int rgd_insert(struct gfs2_rgrpd *rgd)
701 struct gfs2_sbd *sdp = rgd->rd_sbd;
702 struct rb_node **newn = &sdp->sd_rindex_tree.rb_node, *parent = NULL;
704 /* Figure out where to put new node */
706 struct gfs2_rgrpd *cur = rb_entry(*newn, struct gfs2_rgrpd,
710 if (rgd->rd_addr < cur->rd_addr)
711 newn = &((*newn)->rb_left);
712 else if (rgd->rd_addr > cur->rd_addr)
713 newn = &((*newn)->rb_right);
718 rb_link_node(&rgd->rd_node, parent, newn);
719 rb_insert_color(&rgd->rd_node, &sdp->sd_rindex_tree);
725 * read_rindex_entry - Pull in a new resource index entry from the disk
726 * @ip: Pointer to the rindex inode
728 * Returns: 0 on success, > 0 on EOF, error code otherwise
731 static int read_rindex_entry(struct gfs2_inode *ip)
733 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
734 loff_t pos = sdp->sd_rgrps * sizeof(struct gfs2_rindex);
735 struct gfs2_rindex buf;
737 struct gfs2_rgrpd *rgd;
739 if (pos >= i_size_read(&ip->i_inode))
742 error = gfs2_internal_read(ip, (char *)&buf, &pos,
743 sizeof(struct gfs2_rindex));
745 if (error != sizeof(struct gfs2_rindex))
746 return (error == 0) ? 1 : error;
748 rgd = kmem_cache_zalloc(gfs2_rgrpd_cachep, GFP_NOFS);
754 rgd->rd_addr = be64_to_cpu(buf.ri_addr);
755 rgd->rd_length = be32_to_cpu(buf.ri_length);
756 rgd->rd_data0 = be64_to_cpu(buf.ri_data0);
757 rgd->rd_data = be32_to_cpu(buf.ri_data);
758 rgd->rd_bitbytes = be32_to_cpu(buf.ri_bitbytes);
759 spin_lock_init(&rgd->rd_rsspin);
761 error = compute_bitstructs(rgd);
765 error = gfs2_glock_get(sdp, rgd->rd_addr,
766 &gfs2_rgrp_glops, CREATE, &rgd->rd_gl);
770 rgd->rd_gl->gl_object = rgd;
771 rgd->rd_rgl = (struct gfs2_rgrp_lvb *)rgd->rd_gl->gl_lvb;
772 rgd->rd_flags &= ~GFS2_RDF_UPTODATE;
773 if (rgd->rd_data > sdp->sd_max_rg_data)
774 sdp->sd_max_rg_data = rgd->rd_data;
775 spin_lock(&sdp->sd_rindex_spin);
776 error = rgd_insert(rgd);
777 spin_unlock(&sdp->sd_rindex_spin);
781 error = 0; /* someone else read in the rgrp; free it and ignore it */
782 gfs2_glock_put(rgd->rd_gl);
786 kmem_cache_free(gfs2_rgrpd_cachep, rgd);
791 * gfs2_ri_update - Pull in a new resource index from the disk
792 * @ip: pointer to the rindex inode
794 * Returns: 0 on successful update, error code otherwise
797 static int gfs2_ri_update(struct gfs2_inode *ip)
799 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
803 error = read_rindex_entry(ip);
804 } while (error == 0);
809 sdp->sd_rindex_uptodate = 1;
814 * gfs2_rindex_update - Update the rindex if required
815 * @sdp: The GFS2 superblock
817 * We grab a lock on the rindex inode to make sure that it doesn't
818 * change whilst we are performing an operation. We keep this lock
819 * for quite long periods of time compared to other locks. This
820 * doesn't matter, since it is shared and it is very, very rarely
821 * accessed in the exclusive mode (i.e. only when expanding the filesystem).
823 * This makes sure that we're using the latest copy of the resource index
824 * special file, which might have been updated if someone expanded the
825 * filesystem (via gfs2_grow utility), which adds new resource groups.
827 * Returns: 0 on succeess, error code otherwise
830 int gfs2_rindex_update(struct gfs2_sbd *sdp)
832 struct gfs2_inode *ip = GFS2_I(sdp->sd_rindex);
833 struct gfs2_glock *gl = ip->i_gl;
834 struct gfs2_holder ri_gh;
836 int unlock_required = 0;
838 /* Read new copy from disk if we don't have the latest */
839 if (!sdp->sd_rindex_uptodate) {
840 if (!gfs2_glock_is_locked_by_me(gl)) {
841 error = gfs2_glock_nq_init(gl, LM_ST_SHARED, 0, &ri_gh);
846 if (!sdp->sd_rindex_uptodate)
847 error = gfs2_ri_update(ip);
849 gfs2_glock_dq_uninit(&ri_gh);
855 static void gfs2_rgrp_in(struct gfs2_rgrpd *rgd, const void *buf)
857 const struct gfs2_rgrp *str = buf;
860 rg_flags = be32_to_cpu(str->rg_flags);
861 rg_flags &= ~GFS2_RDF_MASK;
862 rgd->rd_flags &= GFS2_RDF_MASK;
863 rgd->rd_flags |= rg_flags;
864 rgd->rd_free = be32_to_cpu(str->rg_free);
865 rgd->rd_dinodes = be32_to_cpu(str->rg_dinodes);
866 rgd->rd_igeneration = be64_to_cpu(str->rg_igeneration);
869 static void gfs2_rgrp_out(struct gfs2_rgrpd *rgd, void *buf)
871 struct gfs2_rgrp *str = buf;
873 str->rg_flags = cpu_to_be32(rgd->rd_flags & ~GFS2_RDF_MASK);
874 str->rg_free = cpu_to_be32(rgd->rd_free);
875 str->rg_dinodes = cpu_to_be32(rgd->rd_dinodes);
876 str->__pad = cpu_to_be32(0);
877 str->rg_igeneration = cpu_to_be64(rgd->rd_igeneration);
878 memset(&str->rg_reserved, 0, sizeof(str->rg_reserved));
881 static int gfs2_rgrp_lvb_valid(struct gfs2_rgrpd *rgd)
883 struct gfs2_rgrp_lvb *rgl = rgd->rd_rgl;
884 struct gfs2_rgrp *str = (struct gfs2_rgrp *)rgd->rd_bits[0].bi_bh->b_data;
886 if (rgl->rl_flags != str->rg_flags || rgl->rl_free != str->rg_free ||
887 rgl->rl_dinodes != str->rg_dinodes ||
888 rgl->rl_igeneration != str->rg_igeneration)
893 static void gfs2_rgrp_ondisk2lvb(struct gfs2_rgrp_lvb *rgl, const void *buf)
895 const struct gfs2_rgrp *str = buf;
897 rgl->rl_magic = cpu_to_be32(GFS2_MAGIC);
898 rgl->rl_flags = str->rg_flags;
899 rgl->rl_free = str->rg_free;
900 rgl->rl_dinodes = str->rg_dinodes;
901 rgl->rl_igeneration = str->rg_igeneration;
905 static void update_rgrp_lvb_unlinked(struct gfs2_rgrpd *rgd, u32 change)
907 struct gfs2_rgrp_lvb *rgl = rgd->rd_rgl;
908 u32 unlinked = be32_to_cpu(rgl->rl_unlinked) + change;
909 rgl->rl_unlinked = cpu_to_be32(unlinked);
912 static u32 count_unlinked(struct gfs2_rgrpd *rgd)
914 struct gfs2_bitmap *bi;
915 const u32 length = rgd->rd_length;
916 const u8 *buffer = NULL;
917 u32 i, goal, count = 0;
919 for (i = 0, bi = rgd->rd_bits; i < length; i++, bi++) {
921 buffer = bi->bi_bh->b_data + bi->bi_offset;
922 WARN_ON(!buffer_uptodate(bi->bi_bh));
923 while (goal < bi->bi_len * GFS2_NBBY) {
924 goal = gfs2_bitfit(buffer, bi->bi_len, goal,
925 GFS2_BLKST_UNLINKED);
926 if (goal == BFITNOENT)
938 * gfs2_rgrp_bh_get - Read in a RG's header and bitmaps
939 * @rgd: the struct gfs2_rgrpd describing the RG to read in
941 * Read in all of a Resource Group's header and bitmap blocks.
942 * Caller must eventually call gfs2_rgrp_relse() to free the bitmaps.
947 int gfs2_rgrp_bh_get(struct gfs2_rgrpd *rgd)
949 struct gfs2_sbd *sdp = rgd->rd_sbd;
950 struct gfs2_glock *gl = rgd->rd_gl;
951 unsigned int length = rgd->rd_length;
952 struct gfs2_bitmap *bi;
956 if (rgd->rd_bits[0].bi_bh != NULL)
959 for (x = 0; x < length; x++) {
960 bi = rgd->rd_bits + x;
961 error = gfs2_meta_read(gl, rgd->rd_addr + x, 0, &bi->bi_bh);
966 for (y = length; y--;) {
967 bi = rgd->rd_bits + y;
968 error = gfs2_meta_wait(sdp, bi->bi_bh);
971 if (gfs2_metatype_check(sdp, bi->bi_bh, y ? GFS2_METATYPE_RB :
978 if (!(rgd->rd_flags & GFS2_RDF_UPTODATE)) {
979 for (x = 0; x < length; x++)
980 clear_bit(GBF_FULL, &rgd->rd_bits[x].bi_flags);
981 gfs2_rgrp_in(rgd, (rgd->rd_bits[0].bi_bh)->b_data);
982 rgd->rd_flags |= (GFS2_RDF_UPTODATE | GFS2_RDF_CHECK);
983 rgd->rd_free_clone = rgd->rd_free;
985 if (be32_to_cpu(GFS2_MAGIC) != rgd->rd_rgl->rl_magic) {
986 rgd->rd_rgl->rl_unlinked = cpu_to_be32(count_unlinked(rgd));
987 gfs2_rgrp_ondisk2lvb(rgd->rd_rgl,
988 rgd->rd_bits[0].bi_bh->b_data);
990 else if (sdp->sd_args.ar_rgrplvb) {
991 if (!gfs2_rgrp_lvb_valid(rgd)){
992 gfs2_consist_rgrpd(rgd);
996 if (rgd->rd_rgl->rl_unlinked == 0)
997 rgd->rd_flags &= ~GFS2_RDF_CHECK;
1003 bi = rgd->rd_bits + x;
1006 gfs2_assert_warn(sdp, !bi->bi_clone);
1012 int update_rgrp_lvb(struct gfs2_rgrpd *rgd)
1016 if (rgd->rd_flags & GFS2_RDF_UPTODATE)
1019 if (be32_to_cpu(GFS2_MAGIC) != rgd->rd_rgl->rl_magic)
1020 return gfs2_rgrp_bh_get(rgd);
1022 rl_flags = be32_to_cpu(rgd->rd_rgl->rl_flags);
1023 rl_flags &= ~GFS2_RDF_MASK;
1024 rgd->rd_flags &= GFS2_RDF_MASK;
1025 rgd->rd_flags |= (rl_flags | GFS2_RDF_UPTODATE | GFS2_RDF_CHECK);
1026 if (rgd->rd_rgl->rl_unlinked == 0)
1027 rgd->rd_flags &= ~GFS2_RDF_CHECK;
1028 rgd->rd_free = be32_to_cpu(rgd->rd_rgl->rl_free);
1029 rgd->rd_free_clone = rgd->rd_free;
1030 rgd->rd_dinodes = be32_to_cpu(rgd->rd_rgl->rl_dinodes);
1031 rgd->rd_igeneration = be64_to_cpu(rgd->rd_rgl->rl_igeneration);
1035 int gfs2_rgrp_go_lock(struct gfs2_holder *gh)
1037 struct gfs2_rgrpd *rgd = gh->gh_gl->gl_object;
1038 struct gfs2_sbd *sdp = rgd->rd_sbd;
1040 if (gh->gh_flags & GL_SKIP && sdp->sd_args.ar_rgrplvb)
1042 return gfs2_rgrp_bh_get((struct gfs2_rgrpd *)gh->gh_gl->gl_object);
1046 * gfs2_rgrp_go_unlock - Release RG bitmaps read in with gfs2_rgrp_bh_get()
1047 * @gh: The glock holder for the resource group
1051 void gfs2_rgrp_go_unlock(struct gfs2_holder *gh)
1053 struct gfs2_rgrpd *rgd = gh->gh_gl->gl_object;
1054 int x, length = rgd->rd_length;
1056 for (x = 0; x < length; x++) {
1057 struct gfs2_bitmap *bi = rgd->rd_bits + x;
1066 int gfs2_rgrp_send_discards(struct gfs2_sbd *sdp, u64 offset,
1067 struct buffer_head *bh,
1068 const struct gfs2_bitmap *bi, unsigned minlen, u64 *ptrimmed)
1070 struct super_block *sb = sdp->sd_vfs;
1071 struct block_device *bdev = sb->s_bdev;
1072 const unsigned int sects_per_blk = sdp->sd_sb.sb_bsize /
1073 bdev_logical_block_size(sb->s_bdev);
1076 sector_t nr_sects = 0;
1082 for (x = 0; x < bi->bi_len; x++) {
1083 const u8 *clone = bi->bi_clone ? bi->bi_clone : bi->bi_bh->b_data;
1084 clone += bi->bi_offset;
1087 const u8 *orig = bh->b_data + bi->bi_offset + x;
1088 diff = ~(*orig | (*orig >> 1)) & (*clone | (*clone >> 1));
1090 diff = ~(*clone | (*clone >> 1));
1095 blk = offset + ((bi->bi_start + x) * GFS2_NBBY);
1096 blk *= sects_per_blk; /* convert to sectors */
1100 goto start_new_extent;
1101 if ((start + nr_sects) != blk) {
1102 if (nr_sects >= minlen) {
1103 rv = blkdev_issue_discard(bdev,
1108 trimmed += nr_sects;
1114 nr_sects += sects_per_blk;
1117 blk += sects_per_blk;
1120 if (nr_sects >= minlen) {
1121 rv = blkdev_issue_discard(bdev, start, nr_sects, GFP_NOFS, 0);
1124 trimmed += nr_sects;
1127 *ptrimmed = trimmed;
1131 if (sdp->sd_args.ar_discard)
1132 fs_warn(sdp, "error %d on discard request, turning discards off for this filesystem", rv);
1133 sdp->sd_args.ar_discard = 0;
1138 * gfs2_fitrim - Generate discard requests for unused bits of the filesystem
1139 * @filp: Any file on the filesystem
1140 * @argp: Pointer to the arguments (also used to pass result)
1142 * Returns: 0 on success, otherwise error code
1145 int gfs2_fitrim(struct file *filp, void __user *argp)
1147 struct inode *inode = filp->f_dentry->d_inode;
1148 struct gfs2_sbd *sdp = GFS2_SB(inode);
1149 struct request_queue *q = bdev_get_queue(sdp->sd_vfs->s_bdev);
1150 struct buffer_head *bh;
1151 struct gfs2_rgrpd *rgd;
1152 struct gfs2_rgrpd *rgd_end;
1153 struct gfs2_holder gh;
1154 struct fstrim_range r;
1160 if (!capable(CAP_SYS_ADMIN))
1163 if (!blk_queue_discard(q))
1170 } else if (copy_from_user(&r, argp, sizeof(r)))
1173 ret = gfs2_rindex_update(sdp);
1177 rgd = gfs2_blk2rgrpd(sdp, r.start, 0);
1178 rgd_end = gfs2_blk2rgrpd(sdp, r.start + r.len, 0);
1182 ret = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_EXCLUSIVE, 0, &gh);
1186 if (!(rgd->rd_flags & GFS2_RGF_TRIMMED)) {
1187 /* Trim each bitmap in the rgrp */
1188 for (x = 0; x < rgd->rd_length; x++) {
1189 struct gfs2_bitmap *bi = rgd->rd_bits + x;
1190 ret = gfs2_rgrp_send_discards(sdp, rgd->rd_data0, NULL, bi, r.minlen, &amt);
1192 gfs2_glock_dq_uninit(&gh);
1198 /* Mark rgrp as having been trimmed */
1199 ret = gfs2_trans_begin(sdp, RES_RG_HDR, 0);
1201 bh = rgd->rd_bits[0].bi_bh;
1202 rgd->rd_flags |= GFS2_RGF_TRIMMED;
1203 gfs2_trans_add_bh(rgd->rd_gl, bh, 1);
1204 gfs2_rgrp_out(rgd, bh->b_data);
1205 gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, bh->b_data);
1206 gfs2_trans_end(sdp);
1209 gfs2_glock_dq_uninit(&gh);
1214 rgd = gfs2_rgrpd_get_next(rgd);
1218 r.len = trimmed << 9;
1219 if (argp && copy_to_user(argp, &r, sizeof(r)))
1226 * rs_insert - insert a new multi-block reservation into the rgrp's rb_tree
1227 * @bi: the bitmap with the blocks
1228 * @ip: the inode structure
1229 * @biblk: the 32-bit block number relative to the start of the bitmap
1230 * @amount: the number of blocks to reserve
1232 * Returns: NULL - reservation was already taken, so not inserted
1233 * pointer to the inserted reservation
1235 static struct gfs2_blkreserv *rs_insert(struct gfs2_bitmap *bi,
1236 struct gfs2_inode *ip, u32 biblk,
1239 struct rb_node **newn, *parent = NULL;
1241 struct gfs2_blkreserv *rs = ip->i_res;
1242 struct gfs2_rgrpd *rgd = rs->rs_rbm.rgd;
1243 u64 fsblock = gfs2_bi2rgd_blk(bi, biblk) + rgd->rd_data0;
1245 spin_lock(&rgd->rd_rsspin);
1246 newn = &rgd->rd_rstree.rb_node;
1248 BUG_ON(gfs2_rs_active(rs));
1249 /* Figure out where to put new node */
1250 /*BUG_ON(!gfs2_glock_is_locked_by_me(rgd->rd_gl));*/
1252 struct gfs2_blkreserv *cur =
1253 rb_entry(*newn, struct gfs2_blkreserv, rs_node);
1256 rc = rs_cmp(fsblock, amount, cur);
1258 newn = &((*newn)->rb_right);
1260 newn = &((*newn)->rb_left);
1262 spin_unlock(&rgd->rd_rsspin);
1263 return NULL; /* reservation already in use */
1267 /* Do our reservation work */
1269 rs->rs_free = amount;
1270 rs->rs_rbm.offset = biblk;
1272 rb_link_node(&rs->rs_node, parent, newn);
1273 rb_insert_color(&rs->rs_node, &rgd->rd_rstree);
1275 /* Do our rgrp accounting for the reservation */
1276 rgd->rd_reserved += amount; /* blocks reserved */
1277 rgd->rd_rs_cnt++; /* number of in-tree reservations */
1278 spin_unlock(&rgd->rd_rsspin);
1279 trace_gfs2_rs(ip, rs, TRACE_RS_INSERT);
1284 * unclaimed_blocks - return number of blocks that aren't spoken for
1286 static u32 unclaimed_blocks(struct gfs2_rgrpd *rgd)
1288 return rgd->rd_free_clone - rgd->rd_reserved;
1292 * rg_mblk_search - find a group of multiple free blocks
1293 * @rgd: the resource group descriptor
1294 * @rs: the block reservation
1295 * @ip: pointer to the inode for which we're reserving blocks
1297 * This is very similar to rgblk_search, except we're looking for whole
1298 * 64-bit words that represent a chunk of 32 free blocks. I'm only focusing
1299 * on aligned dwords for speed's sake.
1301 * Returns: 0 if successful or BFITNOENT if there isn't enough free space
1304 static int rg_mblk_search(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip, unsigned requested)
1306 struct gfs2_bitmap *bi = rgd->rd_bits;
1307 const u32 length = rgd->rd_length;
1309 unsigned int buf, x, search_bytes;
1311 u8 *ptr, *end, *nonzero;
1312 u32 goal, rsv_bytes;
1313 struct gfs2_blkreserv *rs;
1314 u32 best_rs_bytes, unclaimed;
1317 /* Find bitmap block that contains bits for goal block */
1318 if (rgrp_contains_block(rgd, ip->i_goal))
1319 goal = ip->i_goal - rgd->rd_data0;
1321 goal = rgd->rd_last_alloc;
1322 for (buf = 0; buf < length; buf++) {
1323 bi = rgd->rd_bits + buf;
1324 /* Convert scope of "goal" from rgrp-wide to within
1326 if (goal < (bi->bi_start + bi->bi_len) * GFS2_NBBY) {
1327 goal -= bi->bi_start * GFS2_NBBY;
1335 best_rs_blocks = max_t(int, atomic_read(&ip->i_res->rs_sizehint),
1336 (RGRP_RSRV_MINBLKS * rgd->rd_length));
1337 best_rs_bytes = (best_rs_blocks *
1338 (1 + (RSRV_CONTENTION_FACTOR * rgd->rd_rs_cnt))) /
1339 GFS2_NBBY; /* 1 + is for our not-yet-created reservation */
1340 best_rs_bytes = ALIGN(best_rs_bytes, sizeof(u64));
1341 unclaimed = unclaimed_blocks(rgd);
1342 if (best_rs_bytes * GFS2_NBBY > unclaimed)
1343 best_rs_bytes = unclaimed >> GFS2_BIT_SIZE;
1345 for (x = 0; x <= length; x++) {
1346 bi = rgd->rd_bits + buf;
1348 if (test_bit(GBF_FULL, &bi->bi_flags))
1351 WARN_ON(!buffer_uptodate(bi->bi_bh));
1353 buffer = bi->bi_clone + bi->bi_offset;
1355 buffer = bi->bi_bh->b_data + bi->bi_offset;
1357 /* We have to keep the reservations aligned on u64 boundaries
1358 otherwise we could get situations where a byte can't be
1359 used because it's after a reservation, but a free bit still
1360 is within the reservation's area. */
1361 ptr = buffer + ALIGN(goal >> GFS2_BIT_SIZE, sizeof(u64));
1362 end = (buffer + bi->bi_len);
1365 if ((ptr + best_rs_bytes) <= end)
1366 search_bytes = best_rs_bytes;
1368 search_bytes = end - ptr;
1369 BUG_ON(!search_bytes);
1370 nonzero = memchr_inv(ptr, 0, search_bytes);
1371 /* If the lot is all zeroes, reserve the whole size. If
1372 there's enough zeroes to satisfy the request, use
1373 what we can. If there's not enough, keep looking. */
1374 if (nonzero == NULL)
1375 rsv_bytes = search_bytes;
1376 else if ((nonzero - ptr) * GFS2_NBBY >= requested)
1377 rsv_bytes = (nonzero - ptr);
1380 blk = ((ptr - buffer) * GFS2_NBBY);
1381 BUG_ON(blk >= bi->bi_len * GFS2_NBBY);
1382 rs = rs_insert(bi, ip, blk,
1383 rsv_bytes * GFS2_NBBY);
1389 ptr += ALIGN(search_bytes, sizeof(u64));
1392 /* Try next bitmap block (wrap back to rgrp header
1403 * try_rgrp_fit - See if a given reservation will fit in a given RG
1407 * If there's room for the requested blocks to be allocated from the RG:
1408 * This will try to get a multi-block reservation first, and if that doesn't
1409 * fit, it will take what it can.
1411 * Returns: 1 on success (it fits), 0 on failure (it doesn't fit)
1414 static int try_rgrp_fit(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip,
1417 if (rgd->rd_flags & (GFS2_RGF_NOALLOC | GFS2_RDF_ERROR))
1419 /* Look for a multi-block reservation. */
1420 if (unclaimed_blocks(rgd) >= RGRP_RSRV_MINBLKS &&
1421 rg_mblk_search(rgd, ip, requested) != BFITNOENT)
1423 if (unclaimed_blocks(rgd) >= requested)
1430 * gfs2_next_unreserved_block - Return next block that is not reserved
1431 * @rgd: The resource group
1432 * @block: The starting block
1433 * @ip: Ignore any reservations for this inode
1435 * If the block does not appear in any reservation, then return the
1436 * block number unchanged. If it does appear in the reservation, then
1437 * keep looking through the tree of reservations in order to find the
1438 * first block number which is not reserved.
1441 static u64 gfs2_next_unreserved_block(struct gfs2_rgrpd *rgd, u64 block,
1442 const struct gfs2_inode *ip)
1444 struct gfs2_blkreserv *rs;
1448 spin_lock(&rgd->rd_rsspin);
1449 n = rb_first(&rgd->rd_rstree);
1451 rs = rb_entry(n, struct gfs2_blkreserv, rs_node);
1452 rc = rs_cmp(block, 1, rs);
1462 while ((rs_cmp(block, 1, rs) == 0) && (ip->i_res != rs)) {
1463 block = gfs2_rbm_to_block(&rs->rs_rbm) + rs->rs_free;
1464 n = rb_next(&rs->rs_node);
1467 rs = rb_entry(n, struct gfs2_blkreserv, rs_node);
1471 spin_unlock(&rgd->rd_rsspin);
1476 * gfs2_rbm_from_block - Set the rbm based upon rgd and block number
1477 * @rbm: The rbm with rgd already set correctly
1478 * @block: The block number (filesystem relative)
1480 * This sets the bi and offset members of an rbm based on a
1481 * resource group and a filesystem relative block number. The
1482 * resource group must be set in the rbm on entry, the bi and
1483 * offset members will be set by this function.
1485 * Returns: 0 on success, or an error code
1488 static int gfs2_rbm_from_block(struct gfs2_rbm *rbm, u64 block)
1490 u64 rblock = block - rbm->rgd->rd_data0;
1491 u32 goal = (u32)rblock;
1494 if (WARN_ON_ONCE(rblock > UINT_MAX))
1497 for (x = 0; x < rbm->rgd->rd_length; x++) {
1498 rbm->bi = rbm->rgd->rd_bits + x;
1499 if (goal < (rbm->bi->bi_start + rbm->bi->bi_len) * GFS2_NBBY) {
1500 rbm->offset = goal - (rbm->bi->bi_start * GFS2_NBBY);
1509 * gfs2_reservation_check_and_update - Check for reservations during block alloc
1510 * @rbm: The current position in the resource group
1512 * This checks the current position in the rgrp to see whether there is
1513 * a reservation covering this block. If not then this function is a
1514 * no-op. If there is, then the position is moved to the end of the
1515 * contiguous reservation(s) so that we are pointing at the first
1516 * non-reserved block.
1518 * Returns: 0 if no reservation, 1 if @rbm has changed, otherwise an error
1521 static int gfs2_reservation_check_and_update(struct gfs2_rbm *rbm,
1522 const struct gfs2_inode *ip)
1524 u64 block = gfs2_rbm_to_block(rbm);
1528 nblock = gfs2_next_unreserved_block(rbm->rgd, block, ip);
1529 if (nblock == block)
1531 ret = gfs2_rbm_from_block(rbm, nblock);
1538 * gfs2_rbm_find - Look for blocks of a particular state
1539 * @rbm: Value/result starting position and final position
1540 * @state: The state which we want to find
1541 * @ip: If set, check for reservations
1542 * @nowrap: Stop looking at the end of the rgrp, rather than wrapping
1543 * around until we've reached the starting point.
1546 * - If looking for free blocks, we set GBF_FULL on each bitmap which
1547 * has no free blocks in it.
1549 * Returns: 0 on success, -ENOSPC if there is no block of the requested state
1552 static int gfs2_rbm_find(struct gfs2_rbm *rbm, u8 state,
1553 const struct gfs2_inode *ip, bool nowrap)
1555 struct buffer_head *bh;
1556 struct gfs2_bitmap *initial_bi;
1562 int iters = rbm->rgd->rd_length;
1565 /* If we are not starting at the beginning of a bitmap, then we
1566 * need to add one to the bitmap count to ensure that we search
1567 * the starting bitmap twice.
1569 if (rbm->offset != 0)
1573 if (test_bit(GBF_FULL, &rbm->bi->bi_flags) &&
1574 (state == GFS2_BLKST_FREE))
1577 bh = rbm->bi->bi_bh;
1578 buffer = bh->b_data + rbm->bi->bi_offset;
1579 WARN_ON(!buffer_uptodate(bh));
1580 if (state != GFS2_BLKST_UNLINKED && rbm->bi->bi_clone)
1581 buffer = rbm->bi->bi_clone + rbm->bi->bi_offset;
1583 initial_offset = rbm->offset;
1584 offset = gfs2_bitfit(buffer, rbm->bi->bi_len, rbm->offset, state);
1585 if (offset == BFITNOENT)
1587 rbm->offset = offset;
1591 initial_bi = rbm->bi;
1592 ret = gfs2_reservation_check_and_update(rbm, ip);
1596 n += (rbm->bi - initial_bi);
1599 if (ret == -E2BIG) {
1602 n += (rbm->bi - initial_bi);
1603 goto res_covered_end_of_rgrp;
1607 bitmap_full: /* Mark bitmap as full and fall through */
1608 if ((state == GFS2_BLKST_FREE) && initial_offset == 0)
1609 set_bit(GBF_FULL, &rbm->bi->bi_flags);
1611 next_bitmap: /* Find next bitmap in the rgrp */
1613 index = rbm->bi - rbm->rgd->rd_bits;
1615 if (index == rbm->rgd->rd_length)
1617 res_covered_end_of_rgrp:
1618 rbm->bi = &rbm->rgd->rd_bits[index];
1619 if ((index == 0) && nowrap)
1630 * try_rgrp_unlink - Look for any unlinked, allocated, but unused inodes
1632 * @last_unlinked: block address of the last dinode we unlinked
1633 * @skip: block address we should explicitly not unlink
1635 * Returns: 0 if no error
1636 * The inode, if one has been found, in inode.
1639 static void try_rgrp_unlink(struct gfs2_rgrpd *rgd, u64 *last_unlinked, u64 skip)
1642 struct gfs2_sbd *sdp = rgd->rd_sbd;
1643 struct gfs2_glock *gl;
1644 struct gfs2_inode *ip;
1647 struct gfs2_rbm rbm = { .rgd = rgd, .bi = rgd->rd_bits, .offset = 0 };
1650 down_write(&sdp->sd_log_flush_lock);
1651 error = gfs2_rbm_find(&rbm, GFS2_BLKST_UNLINKED, NULL, true);
1652 up_write(&sdp->sd_log_flush_lock);
1653 if (error == -ENOSPC)
1655 if (WARN_ON_ONCE(error))
1658 block = gfs2_rbm_to_block(&rbm);
1659 if (gfs2_rbm_from_block(&rbm, block + 1))
1661 if (*last_unlinked != NO_BLOCK && block <= *last_unlinked)
1665 *last_unlinked = block;
1667 error = gfs2_glock_get(sdp, block, &gfs2_inode_glops, CREATE, &gl);
1671 /* If the inode is already in cache, we can ignore it here
1672 * because the existing inode disposal code will deal with
1673 * it when all refs have gone away. Accessing gl_object like
1674 * this is not safe in general. Here it is ok because we do
1675 * not dereference the pointer, and we only need an approx
1676 * answer to whether it is NULL or not.
1680 if (ip || queue_work(gfs2_delete_workqueue, &gl->gl_delete) == 0)
1685 /* Limit reclaim to sensible number of tasks */
1686 if (found > NR_CPUS)
1690 rgd->rd_flags &= ~GFS2_RDF_CHECK;
1695 * gfs2_inplace_reserve - Reserve space in the filesystem
1696 * @ip: the inode to reserve space for
1697 * @requested: the number of blocks to be reserved
1702 int gfs2_inplace_reserve(struct gfs2_inode *ip, u32 requested)
1704 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1705 struct gfs2_rgrpd *begin = NULL;
1706 struct gfs2_blkreserv *rs = ip->i_res;
1707 int error = 0, rg_locked, flags = LM_FLAG_TRY;
1708 u64 last_unlinked = NO_BLOCK;
1711 if (sdp->sd_args.ar_rgrplvb)
1713 if (gfs2_assert_warn(sdp, requested)) {
1717 if (gfs2_rs_active(rs)) {
1718 begin = rs->rs_rbm.rgd;
1719 flags = 0; /* Yoda: Do or do not. There is no try */
1720 } else if (ip->i_rgd && rgrp_contains_block(ip->i_rgd, ip->i_goal)) {
1721 rs->rs_rbm.rgd = begin = ip->i_rgd;
1723 rs->rs_rbm.rgd = begin = gfs2_blk2rgrpd(sdp, ip->i_goal, 1);
1725 if (rs->rs_rbm.rgd == NULL)
1731 if (gfs2_glock_is_locked_by_me(rs->rs_rbm.rgd->rd_gl)) {
1734 } else if (!loops && !gfs2_rs_active(rs) &&
1735 rs->rs_rbm.rgd->rd_rs_cnt > RGRP_RSRV_MAX_CONTENDERS) {
1736 /* If the rgrp already is maxed out for contenders,
1737 we can eliminate it as a "first pass" without even
1738 requesting the rgrp glock. */
1739 error = GLR_TRYFAILED;
1741 error = gfs2_glock_nq_init(rs->rs_rbm.rgd->rd_gl,
1742 LM_ST_EXCLUSIVE, flags,
1744 if (!error && sdp->sd_args.ar_rgrplvb) {
1745 error = update_rgrp_lvb(rs->rs_rbm.rgd);
1747 gfs2_glock_dq_uninit(&rs->rs_rgd_gh);
1754 if (gfs2_rs_active(rs)) {
1755 if (unclaimed_blocks(rs->rs_rbm.rgd) +
1756 rs->rs_free >= requested) {
1757 ip->i_rgd = rs->rs_rbm.rgd;
1760 /* We have a multi-block reservation, but the
1761 rgrp doesn't have enough free blocks to
1762 satisfy the request. Free the reservation
1763 and look for a suitable rgrp. */
1764 gfs2_rs_deltree(ip, rs);
1766 if (try_rgrp_fit(rs->rs_rbm.rgd, ip, requested)) {
1767 if (sdp->sd_args.ar_rgrplvb)
1768 gfs2_rgrp_bh_get(rs->rs_rbm.rgd);
1769 ip->i_rgd = rs->rs_rbm.rgd;
1772 if (rs->rs_rbm.rgd->rd_flags & GFS2_RDF_CHECK) {
1773 if (sdp->sd_args.ar_rgrplvb)
1774 gfs2_rgrp_bh_get(rs->rs_rbm.rgd);
1775 try_rgrp_unlink(rs->rs_rbm.rgd, &last_unlinked,
1779 gfs2_glock_dq_uninit(&rs->rs_rgd_gh);
1782 rs->rs_rbm.rgd = gfs2_rgrpd_get_next(rs->rs_rbm.rgd);
1783 rs->rs_rbm.rgd = rs->rs_rbm.rgd ? : begin; /* if NULL, wrap */
1784 if (rs->rs_rbm.rgd != begin) /* If we didn't wrap */
1787 flags &= ~LM_FLAG_TRY;
1789 /* Check that fs hasn't grown if writing to rindex */
1790 if (ip == GFS2_I(sdp->sd_rindex) &&
1791 !sdp->sd_rindex_uptodate) {
1792 error = gfs2_ri_update(ip);
1795 } else if (loops == 2)
1796 /* Flushing the log may release space */
1797 gfs2_log_flush(sdp, NULL);
1810 * gfs2_inplace_release - release an inplace reservation
1811 * @ip: the inode the reservation was taken out on
1813 * Release a reservation made by gfs2_inplace_reserve().
1816 void gfs2_inplace_release(struct gfs2_inode *ip)
1818 struct gfs2_blkreserv *rs = ip->i_res;
1820 if (rs->rs_rgd_gh.gh_gl)
1821 gfs2_glock_dq_uninit(&rs->rs_rgd_gh);
1825 * gfs2_get_block_type - Check a block in a RG is of given type
1826 * @rgd: the resource group holding the block
1827 * @block: the block number
1829 * Returns: The block type (GFS2_BLKST_*)
1832 static unsigned char gfs2_get_block_type(struct gfs2_rgrpd *rgd, u64 block)
1834 struct gfs2_rbm rbm = { .rgd = rgd, };
1837 ret = gfs2_rbm_from_block(&rbm, block);
1838 WARN_ON_ONCE(ret != 0);
1840 return gfs2_testbit(rgd, rbm.bi->bi_bh->b_data + rbm.bi->bi_offset,
1841 rbm.bi->bi_len, rbm.offset);
1846 * gfs2_alloc_extent - allocate an extent from a given bitmap
1847 * @rbm: the resource group information
1848 * @dinode: TRUE if the first block we allocate is for a dinode
1849 * @n: The extent length
1851 * Add the found bitmap buffer to the transaction.
1852 * Set the found bits to @new_state to change block's allocation state.
1853 * Returns: starting block number of the extent (fs scope)
1855 static u64 gfs2_alloc_extent(const struct gfs2_rbm *rbm, bool dinode,
1858 struct gfs2_rgrpd *rgd = rbm->rgd;
1859 struct gfs2_bitmap *bi = rbm->bi;
1860 u32 blk = rbm->offset;
1861 const unsigned int elen = *n;
1863 const u8 *buffer = NULL;
1866 buffer = bi->bi_bh->b_data + bi->bi_offset;
1867 gfs2_trans_add_bh(rgd->rd_gl, bi->bi_bh, 1);
1868 gfs2_setbit(rgd, bi->bi_clone, bi, blk,
1869 dinode ? GFS2_BLKST_DINODE : GFS2_BLKST_USED);
1874 if (goal >= (bi->bi_len * GFS2_NBBY))
1876 if (gfs2_testbit(rgd, buffer, bi->bi_len, goal) !=
1879 gfs2_setbit(rgd, bi->bi_clone, bi, goal, GFS2_BLKST_USED);
1882 blk = gfs2_bi2rgd_blk(bi, blk);
1883 rgd->rd_last_alloc = blk + *n - 1;
1884 return rgd->rd_data0 + blk;
1888 * rgblk_free - Change alloc state of given block(s)
1889 * @sdp: the filesystem
1890 * @bstart: the start of a run of blocks to free
1891 * @blen: the length of the block run (all must lie within ONE RG!)
1892 * @new_state: GFS2_BLKST_XXX the after-allocation block state
1894 * Returns: Resource group containing the block(s)
1897 static struct gfs2_rgrpd *rgblk_free(struct gfs2_sbd *sdp, u64 bstart,
1898 u32 blen, unsigned char new_state)
1900 struct gfs2_rbm rbm;
1902 rbm.rgd = gfs2_blk2rgrpd(sdp, bstart, 1);
1904 if (gfs2_consist(sdp))
1905 fs_err(sdp, "block = %llu\n", (unsigned long long)bstart);
1910 gfs2_rbm_from_block(&rbm, bstart);
1912 if (!rbm.bi->bi_clone) {
1913 rbm.bi->bi_clone = kmalloc(rbm.bi->bi_bh->b_size,
1914 GFP_NOFS | __GFP_NOFAIL);
1915 memcpy(rbm.bi->bi_clone + rbm.bi->bi_offset,
1916 rbm.bi->bi_bh->b_data + rbm.bi->bi_offset,
1919 gfs2_trans_add_bh(rbm.rgd->rd_gl, rbm.bi->bi_bh, 1);
1920 gfs2_setbit(rbm.rgd, NULL, rbm.bi, rbm.offset, new_state);
1927 * gfs2_rgrp_dump - print out an rgrp
1928 * @seq: The iterator
1929 * @gl: The glock in question
1933 int gfs2_rgrp_dump(struct seq_file *seq, const struct gfs2_glock *gl)
1935 struct gfs2_rgrpd *rgd = gl->gl_object;
1936 struct gfs2_blkreserv *trs;
1937 const struct rb_node *n;
1941 gfs2_print_dbg(seq, " R: n:%llu f:%02x b:%u/%u i:%u r:%u\n",
1942 (unsigned long long)rgd->rd_addr, rgd->rd_flags,
1943 rgd->rd_free, rgd->rd_free_clone, rgd->rd_dinodes,
1945 spin_lock(&rgd->rd_rsspin);
1946 for (n = rb_first(&rgd->rd_rstree); n; n = rb_next(&trs->rs_node)) {
1947 trs = rb_entry(n, struct gfs2_blkreserv, rs_node);
1950 spin_unlock(&rgd->rd_rsspin);
1954 static void gfs2_rgrp_error(struct gfs2_rgrpd *rgd)
1956 struct gfs2_sbd *sdp = rgd->rd_sbd;
1957 fs_warn(sdp, "rgrp %llu has an error, marking it readonly until umount\n",
1958 (unsigned long long)rgd->rd_addr);
1959 fs_warn(sdp, "umount on all nodes and run fsck.gfs2 to fix the error\n");
1960 gfs2_rgrp_dump(NULL, rgd->rd_gl);
1961 rgd->rd_flags |= GFS2_RDF_ERROR;
1965 * gfs2_adjust_reservation - Adjust (or remove) a reservation after allocation
1966 * @ip: The inode we have just allocated blocks for
1967 * @rbm: The start of the allocated blocks
1968 * @len: The extent length
1970 * Adjusts a reservation after an allocation has taken place. If the
1971 * reservation does not match the allocation, or if it is now empty
1972 * then it is removed.
1975 static void gfs2_adjust_reservation(struct gfs2_inode *ip,
1976 const struct gfs2_rbm *rbm, unsigned len)
1978 struct gfs2_blkreserv *rs = ip->i_res;
1979 struct gfs2_rgrpd *rgd = rbm->rgd;
1984 spin_lock(&rgd->rd_rsspin);
1985 if (gfs2_rs_active(rs)) {
1986 if (gfs2_rbm_eq(&rs->rs_rbm, rbm)) {
1987 block = gfs2_rbm_to_block(rbm);
1988 ret = gfs2_rbm_from_block(&rs->rs_rbm, block + len);
1989 rlen = min(rs->rs_free, len);
1990 rs->rs_free -= rlen;
1991 rgd->rd_reserved -= rlen;
1992 trace_gfs2_rs(ip, rs, TRACE_RS_CLAIM);
1993 if (rs->rs_free && !ret)
1996 __rs_deltree(ip, rs);
1999 spin_unlock(&rgd->rd_rsspin);
2003 * gfs2_alloc_blocks - Allocate one or more blocks of data and/or a dinode
2004 * @ip: the inode to allocate the block for
2005 * @bn: Used to return the starting block number
2006 * @nblocks: requested number of blocks/extent length (value/result)
2007 * @dinode: 1 if we're allocating a dinode block, else 0
2008 * @generation: the generation number of the inode
2010 * Returns: 0 or error
2013 int gfs2_alloc_blocks(struct gfs2_inode *ip, u64 *bn, unsigned int *nblocks,
2014 bool dinode, u64 *generation)
2016 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
2017 struct buffer_head *dibh;
2018 struct gfs2_rbm rbm = { .rgd = ip->i_rgd, };
2021 u64 block; /* block, within the file system scope */
2024 if (gfs2_rs_active(ip->i_res))
2025 goal = gfs2_rbm_to_block(&ip->i_res->rs_rbm);
2026 else if (!dinode && rgrp_contains_block(rbm.rgd, ip->i_goal))
2029 goal = rbm.rgd->rd_last_alloc + rbm.rgd->rd_data0;
2031 gfs2_rbm_from_block(&rbm, goal);
2032 error = gfs2_rbm_find(&rbm, GFS2_BLKST_FREE, ip, false);
2034 /* Since all blocks are reserved in advance, this shouldn't happen */
2036 fs_warn(sdp, "error=%d, nblocks=%u, full=%d\n", error, *nblocks,
2037 test_bit(GBF_FULL, &rbm.rgd->rd_bits->bi_flags));
2041 block = gfs2_alloc_extent(&rbm, dinode, nblocks);
2042 if (gfs2_rs_active(ip->i_res))
2043 gfs2_adjust_reservation(ip, &rbm, *nblocks);
2049 ip->i_goal = block + ndata - 1;
2050 error = gfs2_meta_inode_buffer(ip, &dibh);
2052 struct gfs2_dinode *di =
2053 (struct gfs2_dinode *)dibh->b_data;
2054 gfs2_trans_add_bh(ip->i_gl, dibh, 1);
2055 di->di_goal_meta = di->di_goal_data =
2056 cpu_to_be64(ip->i_goal);
2060 if (rbm.rgd->rd_free < *nblocks) {
2061 printk(KERN_WARNING "nblocks=%u\n", *nblocks);
2065 rbm.rgd->rd_free -= *nblocks;
2067 rbm.rgd->rd_dinodes++;
2068 *generation = rbm.rgd->rd_igeneration++;
2069 if (*generation == 0)
2070 *generation = rbm.rgd->rd_igeneration++;
2073 gfs2_trans_add_bh(rbm.rgd->rd_gl, rbm.rgd->rd_bits[0].bi_bh, 1);
2074 gfs2_rgrp_out(rbm.rgd, rbm.rgd->rd_bits[0].bi_bh->b_data);
2075 gfs2_rgrp_ondisk2lvb(rbm.rgd->rd_rgl, rbm.rgd->rd_bits[0].bi_bh->b_data);
2077 gfs2_statfs_change(sdp, 0, -(s64)*nblocks, dinode ? 1 : 0);
2079 gfs2_trans_add_unrevoke(sdp, block, 1);
2082 * This needs reviewing to see why we cannot do the quota change
2083 * at this point in the dinode case.
2086 gfs2_quota_change(ip, ndata, ip->i_inode.i_uid,
2089 rbm.rgd->rd_free_clone -= *nblocks;
2090 trace_gfs2_block_alloc(ip, rbm.rgd, block, *nblocks,
2091 dinode ? GFS2_BLKST_DINODE : GFS2_BLKST_USED);
2096 gfs2_rgrp_error(rbm.rgd);
2101 * __gfs2_free_blocks - free a contiguous run of block(s)
2102 * @ip: the inode these blocks are being freed from
2103 * @bstart: first block of a run of contiguous blocks
2104 * @blen: the length of the block run
2105 * @meta: 1 if the blocks represent metadata
2109 void __gfs2_free_blocks(struct gfs2_inode *ip, u64 bstart, u32 blen, int meta)
2111 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
2112 struct gfs2_rgrpd *rgd;
2114 rgd = rgblk_free(sdp, bstart, blen, GFS2_BLKST_FREE);
2117 trace_gfs2_block_alloc(ip, rgd, bstart, blen, GFS2_BLKST_FREE);
2118 rgd->rd_free += blen;
2119 rgd->rd_flags &= ~GFS2_RGF_TRIMMED;
2120 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
2121 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
2122 gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, rgd->rd_bits[0].bi_bh->b_data);
2124 /* Directories keep their data in the metadata address space */
2125 if (meta || ip->i_depth)
2126 gfs2_meta_wipe(ip, bstart, blen);
2130 * gfs2_free_meta - free a contiguous run of data block(s)
2131 * @ip: the inode these blocks are being freed from
2132 * @bstart: first block of a run of contiguous blocks
2133 * @blen: the length of the block run
2137 void gfs2_free_meta(struct gfs2_inode *ip, u64 bstart, u32 blen)
2139 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
2141 __gfs2_free_blocks(ip, bstart, blen, 1);
2142 gfs2_statfs_change(sdp, 0, +blen, 0);
2143 gfs2_quota_change(ip, -(s64)blen, ip->i_inode.i_uid, ip->i_inode.i_gid);
2146 void gfs2_unlink_di(struct inode *inode)
2148 struct gfs2_inode *ip = GFS2_I(inode);
2149 struct gfs2_sbd *sdp = GFS2_SB(inode);
2150 struct gfs2_rgrpd *rgd;
2151 u64 blkno = ip->i_no_addr;
2153 rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_UNLINKED);
2156 trace_gfs2_block_alloc(ip, rgd, blkno, 1, GFS2_BLKST_UNLINKED);
2157 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
2158 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
2159 gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, rgd->rd_bits[0].bi_bh->b_data);
2160 update_rgrp_lvb_unlinked(rgd, 1);
2163 static void gfs2_free_uninit_di(struct gfs2_rgrpd *rgd, u64 blkno)
2165 struct gfs2_sbd *sdp = rgd->rd_sbd;
2166 struct gfs2_rgrpd *tmp_rgd;
2168 tmp_rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_FREE);
2171 gfs2_assert_withdraw(sdp, rgd == tmp_rgd);
2173 if (!rgd->rd_dinodes)
2174 gfs2_consist_rgrpd(rgd);
2178 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
2179 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
2180 gfs2_rgrp_ondisk2lvb(rgd->rd_rgl, rgd->rd_bits[0].bi_bh->b_data);
2181 update_rgrp_lvb_unlinked(rgd, -1);
2183 gfs2_statfs_change(sdp, 0, +1, -1);
2187 void gfs2_free_di(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip)
2189 gfs2_free_uninit_di(rgd, ip->i_no_addr);
2190 trace_gfs2_block_alloc(ip, rgd, ip->i_no_addr, 1, GFS2_BLKST_FREE);
2191 gfs2_quota_change(ip, -1, ip->i_inode.i_uid, ip->i_inode.i_gid);
2192 gfs2_meta_wipe(ip, ip->i_no_addr, 1);
2196 * gfs2_check_blk_type - Check the type of a block
2197 * @sdp: The superblock
2198 * @no_addr: The block number to check
2199 * @type: The block type we are looking for
2201 * Returns: 0 if the block type matches the expected type
2202 * -ESTALE if it doesn't match
2203 * or -ve errno if something went wrong while checking
2206 int gfs2_check_blk_type(struct gfs2_sbd *sdp, u64 no_addr, unsigned int type)
2208 struct gfs2_rgrpd *rgd;
2209 struct gfs2_holder rgd_gh;
2210 int error = -EINVAL;
2212 rgd = gfs2_blk2rgrpd(sdp, no_addr, 1);
2216 error = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_SHARED, 0, &rgd_gh);
2220 if (gfs2_get_block_type(rgd, no_addr) != type)
2223 gfs2_glock_dq_uninit(&rgd_gh);
2229 * gfs2_rlist_add - add a RG to a list of RGs
2231 * @rlist: the list of resource groups
2234 * Figure out what RG a block belongs to and add that RG to the list
2236 * FIXME: Don't use NOFAIL
2240 void gfs2_rlist_add(struct gfs2_inode *ip, struct gfs2_rgrp_list *rlist,
2243 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
2244 struct gfs2_rgrpd *rgd;
2245 struct gfs2_rgrpd **tmp;
2246 unsigned int new_space;
2249 if (gfs2_assert_warn(sdp, !rlist->rl_ghs))
2252 if (ip->i_rgd && rgrp_contains_block(ip->i_rgd, block))
2255 rgd = gfs2_blk2rgrpd(sdp, block, 1);
2257 fs_err(sdp, "rlist_add: no rgrp for block %llu\n", (unsigned long long)block);
2262 for (x = 0; x < rlist->rl_rgrps; x++)
2263 if (rlist->rl_rgd[x] == rgd)
2266 if (rlist->rl_rgrps == rlist->rl_space) {
2267 new_space = rlist->rl_space + 10;
2269 tmp = kcalloc(new_space, sizeof(struct gfs2_rgrpd *),
2270 GFP_NOFS | __GFP_NOFAIL);
2272 if (rlist->rl_rgd) {
2273 memcpy(tmp, rlist->rl_rgd,
2274 rlist->rl_space * sizeof(struct gfs2_rgrpd *));
2275 kfree(rlist->rl_rgd);
2278 rlist->rl_space = new_space;
2279 rlist->rl_rgd = tmp;
2282 rlist->rl_rgd[rlist->rl_rgrps++] = rgd;
2286 * gfs2_rlist_alloc - all RGs have been added to the rlist, now allocate
2287 * and initialize an array of glock holders for them
2288 * @rlist: the list of resource groups
2289 * @state: the lock state to acquire the RG lock in
2291 * FIXME: Don't use NOFAIL
2295 void gfs2_rlist_alloc(struct gfs2_rgrp_list *rlist, unsigned int state)
2299 rlist->rl_ghs = kcalloc(rlist->rl_rgrps, sizeof(struct gfs2_holder),
2300 GFP_NOFS | __GFP_NOFAIL);
2301 for (x = 0; x < rlist->rl_rgrps; x++)
2302 gfs2_holder_init(rlist->rl_rgd[x]->rd_gl,
2308 * gfs2_rlist_free - free a resource group list
2309 * @list: the list of resource groups
2313 void gfs2_rlist_free(struct gfs2_rgrp_list *rlist)
2317 kfree(rlist->rl_rgd);
2319 if (rlist->rl_ghs) {
2320 for (x = 0; x < rlist->rl_rgrps; x++)
2321 gfs2_holder_uninit(&rlist->rl_ghs[x]);
2322 kfree(rlist->rl_ghs);
2323 rlist->rl_ghs = NULL;