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 #if BITS_PER_LONG == 32
39 #define LBITMASK (0x55555555UL)
40 #define LBITSKIP55 (0x55555555UL)
41 #define LBITSKIP00 (0x00000000UL)
43 #define LBITMASK (0x5555555555555555UL)
44 #define LBITSKIP55 (0x5555555555555555UL)
45 #define LBITSKIP00 (0x0000000000000000UL)
49 * These routines are used by the resource group routines (rgrp.c)
50 * to keep track of block allocation. Each block is represented by two
51 * bits. So, each byte represents GFS2_NBBY (i.e. 4) blocks.
54 * 1 = Used (not metadata)
55 * 2 = Unlinked (still in use) inode
59 static const char valid_change[16] = {
67 static u32 rgblk_search(struct gfs2_rgrpd *rgd, u32 goal,
68 unsigned char old_state, unsigned char new_state,
72 * gfs2_setbit - Set a bit in the bitmaps
73 * @buffer: the buffer that holds the bitmaps
74 * @buflen: the length (in bytes) of the buffer
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 *buf1,
81 unsigned char *buf2, unsigned int offset,
82 struct gfs2_bitmap *bi, u32 block,
83 unsigned char new_state)
85 unsigned char *byte1, *byte2, *end, cur_state;
86 unsigned int buflen = bi->bi_len;
87 const unsigned int bit = (block % GFS2_NBBY) * GFS2_BIT_SIZE;
89 byte1 = buf1 + offset + (block / GFS2_NBBY);
90 end = buf1 + offset + buflen;
94 cur_state = (*byte1 >> bit) & GFS2_BIT_MASK;
96 if (unlikely(!valid_change[new_state * 4 + cur_state])) {
97 printk(KERN_WARNING "GFS2: buf_blk = 0x%llx old_state=%d, "
99 (unsigned long long)block, cur_state, new_state);
100 printk(KERN_WARNING "GFS2: rgrp=0x%llx bi_start=0x%lx\n",
101 (unsigned long long)rgd->rd_addr,
102 (unsigned long)bi->bi_start);
103 printk(KERN_WARNING "GFS2: bi_offset=0x%lx bi_len=0x%lx\n",
104 (unsigned long)bi->bi_offset,
105 (unsigned long)bi->bi_len);
107 gfs2_consist_rgrpd(rgd);
110 *byte1 ^= (cur_state ^ new_state) << bit;
113 byte2 = buf2 + offset + (block / GFS2_NBBY);
114 cur_state = (*byte2 >> bit) & GFS2_BIT_MASK;
115 *byte2 ^= (cur_state ^ new_state) << bit;
120 * gfs2_testbit - test a bit in the bitmaps
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 * gfs2_bitfit - Search an rgrp's bitmap buffer to find a bit-pair representing
181 * a block in a given allocation state.
182 * @buffer: the buffer that holds the bitmaps
183 * @len: the length (in bytes) of the buffer
184 * @goal: start search at this block's bit-pair (within @buffer)
185 * @state: GFS2_BLKST_XXX the state of the block we're looking for.
187 * Scope of @goal and returned block number is only within this bitmap buffer,
188 * not entire rgrp or filesystem. @buffer will be offset from the actual
189 * beginning of a bitmap block buffer, skipping any header structures, but
190 * headers are always a multiple of 64 bits long so that the buffer is
191 * always aligned to a 64 bit boundary.
193 * The size of the buffer is in bytes, but is it assumed that it is
194 * always ok to read a complete multiple of 64 bits at the end
195 * of the block in case the end is no aligned to a natural boundary.
197 * Return: the block number (bitmap buffer scope) that was found
200 static u32 gfs2_bitfit(const u8 *buf, const unsigned int len,
203 u32 spoint = (goal << 1) & ((8*sizeof(u64)) - 1);
204 const __le64 *ptr = ((__le64 *)buf) + (goal >> 5);
205 const __le64 *end = (__le64 *)(buf + ALIGN(len, sizeof(u64)));
207 u64 mask = 0x5555555555555555ULL;
212 /* Mask off bits we don't care about at the start of the search */
214 tmp = gfs2_bit_search(ptr, mask, state);
216 while(tmp == 0 && ptr < end) {
217 tmp = gfs2_bit_search(ptr, 0x5555555555555555ULL, state);
220 /* Mask off any bits which are more than len bytes from the start */
221 if (ptr == end && (len & (sizeof(u64) - 1)))
222 tmp &= (((u64)~0) >> (64 - 8*(len & (sizeof(u64) - 1))));
223 /* Didn't find anything, so return */
228 bit /= 2; /* two bits per entry in the bitmap */
229 return (((const unsigned char *)ptr - buf) * GFS2_NBBY) + bit;
233 * gfs2_bitcount - count the number of bits in a certain state
234 * @buffer: the buffer that holds the bitmaps
235 * @buflen: the length (in bytes) of the buffer
236 * @state: the state of the block we're looking for
238 * Returns: The number of bits
241 static u32 gfs2_bitcount(struct gfs2_rgrpd *rgd, const u8 *buffer,
242 unsigned int buflen, u8 state)
244 const u8 *byte = buffer;
245 const u8 *end = buffer + buflen;
246 const u8 state1 = state << 2;
247 const u8 state2 = state << 4;
248 const u8 state3 = state << 6;
251 for (; byte < end; byte++) {
252 if (((*byte) & 0x03) == state)
254 if (((*byte) & 0x0C) == state1)
256 if (((*byte) & 0x30) == state2)
258 if (((*byte) & 0xC0) == state3)
266 * gfs2_rgrp_verify - Verify that a resource group is consistent
267 * @sdp: the filesystem
272 void gfs2_rgrp_verify(struct gfs2_rgrpd *rgd)
274 struct gfs2_sbd *sdp = rgd->rd_sbd;
275 struct gfs2_bitmap *bi = NULL;
276 u32 length = rgd->rd_length;
280 memset(count, 0, 4 * sizeof(u32));
282 /* Count # blocks in each of 4 possible allocation states */
283 for (buf = 0; buf < length; buf++) {
284 bi = rgd->rd_bits + buf;
285 for (x = 0; x < 4; x++)
286 count[x] += gfs2_bitcount(rgd,
292 if (count[0] != rgd->rd_free) {
293 if (gfs2_consist_rgrpd(rgd))
294 fs_err(sdp, "free data mismatch: %u != %u\n",
295 count[0], rgd->rd_free);
299 tmp = rgd->rd_data - rgd->rd_free - rgd->rd_dinodes;
300 if (count[1] != tmp) {
301 if (gfs2_consist_rgrpd(rgd))
302 fs_err(sdp, "used data mismatch: %u != %u\n",
307 if (count[2] + count[3] != rgd->rd_dinodes) {
308 if (gfs2_consist_rgrpd(rgd))
309 fs_err(sdp, "used metadata mismatch: %u != %u\n",
310 count[2] + count[3], rgd->rd_dinodes);
315 static inline int rgrp_contains_block(struct gfs2_rgrpd *rgd, u64 block)
317 u64 first = rgd->rd_data0;
318 u64 last = first + rgd->rd_data;
319 return first <= block && block < last;
323 * gfs2_blk2rgrpd - Find resource group for a given data/meta block number
324 * @sdp: The GFS2 superblock
325 * @n: The data block number
327 * Returns: The resource group, or NULL if not found
330 struct gfs2_rgrpd *gfs2_blk2rgrpd(struct gfs2_sbd *sdp, u64 blk)
332 struct rb_node **newn, *parent = NULL;
334 spin_lock(&sdp->sd_rindex_spin);
335 newn = &sdp->sd_rindex_tree.rb_node;
337 struct gfs2_rgrpd *cur = rb_entry(*newn, struct gfs2_rgrpd,
340 if (blk < cur->rd_addr)
341 newn = &((*newn)->rb_left);
342 else if (blk > cur->rd_data0 + cur->rd_data)
343 newn = &((*newn)->rb_right);
345 spin_unlock(&sdp->sd_rindex_spin);
349 spin_unlock(&sdp->sd_rindex_spin);
355 * gfs2_rgrpd_get_first - get the first Resource Group in the filesystem
356 * @sdp: The GFS2 superblock
358 * Returns: The first rgrp in the filesystem
361 struct gfs2_rgrpd *gfs2_rgrpd_get_first(struct gfs2_sbd *sdp)
363 const struct rb_node *n;
364 struct gfs2_rgrpd *rgd;
366 spin_lock(&sdp->sd_rindex_spin);
367 n = rb_first(&sdp->sd_rindex_tree);
368 rgd = rb_entry(n, struct gfs2_rgrpd, rd_node);
369 spin_unlock(&sdp->sd_rindex_spin);
375 * gfs2_rgrpd_get_next - get the next RG
378 * Returns: The next rgrp
381 struct gfs2_rgrpd *gfs2_rgrpd_get_next(struct gfs2_rgrpd *rgd)
383 struct gfs2_sbd *sdp = rgd->rd_sbd;
384 const struct rb_node *n;
386 spin_lock(&sdp->sd_rindex_spin);
387 n = rb_next(&rgd->rd_node);
389 n = rb_first(&sdp->sd_rindex_tree);
391 if (unlikely(&rgd->rd_node == n)) {
392 spin_unlock(&sdp->sd_rindex_spin);
395 rgd = rb_entry(n, struct gfs2_rgrpd, rd_node);
396 spin_unlock(&sdp->sd_rindex_spin);
400 void gfs2_free_clones(struct gfs2_rgrpd *rgd)
404 for (x = 0; x < rgd->rd_length; x++) {
405 struct gfs2_bitmap *bi = rgd->rd_bits + x;
411 void gfs2_clear_rgrpd(struct gfs2_sbd *sdp)
414 struct gfs2_rgrpd *rgd;
415 struct gfs2_glock *gl;
417 while ((n = rb_first(&sdp->sd_rindex_tree))) {
418 rgd = rb_entry(n, struct gfs2_rgrpd, rd_node);
421 rb_erase(n, &sdp->sd_rindex_tree);
424 spin_lock(&gl->gl_spin);
425 gl->gl_object = NULL;
426 spin_unlock(&gl->gl_spin);
427 gfs2_glock_add_to_lru(gl);
431 gfs2_free_clones(rgd);
433 kmem_cache_free(gfs2_rgrpd_cachep, rgd);
437 static void gfs2_rindex_print(const struct gfs2_rgrpd *rgd)
439 printk(KERN_INFO " ri_addr = %llu\n", (unsigned long long)rgd->rd_addr);
440 printk(KERN_INFO " ri_length = %u\n", rgd->rd_length);
441 printk(KERN_INFO " ri_data0 = %llu\n", (unsigned long long)rgd->rd_data0);
442 printk(KERN_INFO " ri_data = %u\n", rgd->rd_data);
443 printk(KERN_INFO " ri_bitbytes = %u\n", rgd->rd_bitbytes);
447 * gfs2_compute_bitstructs - Compute the bitmap sizes
448 * @rgd: The resource group descriptor
450 * Calculates bitmap descriptors, one for each block that contains bitmap data
455 static int compute_bitstructs(struct gfs2_rgrpd *rgd)
457 struct gfs2_sbd *sdp = rgd->rd_sbd;
458 struct gfs2_bitmap *bi;
459 u32 length = rgd->rd_length; /* # blocks in hdr & bitmap */
460 u32 bytes_left, bytes;
466 rgd->rd_bits = kcalloc(length, sizeof(struct gfs2_bitmap), GFP_NOFS);
470 bytes_left = rgd->rd_bitbytes;
472 for (x = 0; x < length; x++) {
473 bi = rgd->rd_bits + x;
476 /* small rgrp; bitmap stored completely in header block */
479 bi->bi_offset = sizeof(struct gfs2_rgrp);
484 bytes = sdp->sd_sb.sb_bsize - sizeof(struct gfs2_rgrp);
485 bi->bi_offset = sizeof(struct gfs2_rgrp);
489 } else if (x + 1 == length) {
491 bi->bi_offset = sizeof(struct gfs2_meta_header);
492 bi->bi_start = rgd->rd_bitbytes - bytes_left;
496 bytes = sdp->sd_sb.sb_bsize -
497 sizeof(struct gfs2_meta_header);
498 bi->bi_offset = sizeof(struct gfs2_meta_header);
499 bi->bi_start = rgd->rd_bitbytes - bytes_left;
507 gfs2_consist_rgrpd(rgd);
510 bi = rgd->rd_bits + (length - 1);
511 if ((bi->bi_start + bi->bi_len) * GFS2_NBBY != rgd->rd_data) {
512 if (gfs2_consist_rgrpd(rgd)) {
513 gfs2_rindex_print(rgd);
514 fs_err(sdp, "start=%u len=%u offset=%u\n",
515 bi->bi_start, bi->bi_len, bi->bi_offset);
524 * gfs2_ri_total - Total up the file system space, according to the rindex.
527 u64 gfs2_ri_total(struct gfs2_sbd *sdp)
530 struct inode *inode = sdp->sd_rindex;
531 struct gfs2_inode *ip = GFS2_I(inode);
532 char buf[sizeof(struct gfs2_rindex)];
533 struct file_ra_state ra_state;
536 mutex_lock(&sdp->sd_rindex_mutex);
537 file_ra_state_init(&ra_state, inode->i_mapping);
538 for (rgrps = 0;; rgrps++) {
539 loff_t pos = rgrps * sizeof(struct gfs2_rindex);
541 if (pos + sizeof(struct gfs2_rindex) > i_size_read(inode))
543 error = gfs2_internal_read(ip, &ra_state, buf, &pos,
544 sizeof(struct gfs2_rindex));
545 if (error != sizeof(struct gfs2_rindex))
547 total_data += be32_to_cpu(((struct gfs2_rindex *)buf)->ri_data);
549 mutex_unlock(&sdp->sd_rindex_mutex);
553 static void rgd_insert(struct gfs2_rgrpd *rgd)
555 struct gfs2_sbd *sdp = rgd->rd_sbd;
556 struct rb_node **newn = &sdp->sd_rindex_tree.rb_node, *parent = NULL;
558 /* Figure out where to put new node */
560 struct gfs2_rgrpd *cur = rb_entry(*newn, struct gfs2_rgrpd,
564 if (rgd->rd_addr < cur->rd_addr)
565 newn = &((*newn)->rb_left);
566 else if (rgd->rd_addr > cur->rd_addr)
567 newn = &((*newn)->rb_right);
572 rb_link_node(&rgd->rd_node, parent, newn);
573 rb_insert_color(&rgd->rd_node, &sdp->sd_rindex_tree);
577 * read_rindex_entry - Pull in a new resource index entry from the disk
578 * @gl: The glock covering the rindex inode
580 * Returns: 0 on success, > 0 on EOF, error code otherwise
583 static int read_rindex_entry(struct gfs2_inode *ip,
584 struct file_ra_state *ra_state)
586 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
587 loff_t pos = sdp->sd_rgrps * sizeof(struct gfs2_rindex);
588 struct gfs2_rindex buf;
590 struct gfs2_rgrpd *rgd;
592 if (pos >= i_size_read(&ip->i_inode))
595 error = gfs2_internal_read(ip, ra_state, (char *)&buf, &pos,
596 sizeof(struct gfs2_rindex));
598 if (error != sizeof(struct gfs2_rindex))
599 return (error == 0) ? 1 : error;
601 rgd = kmem_cache_zalloc(gfs2_rgrpd_cachep, GFP_NOFS);
607 rgd->rd_addr = be64_to_cpu(buf.ri_addr);
608 rgd->rd_length = be32_to_cpu(buf.ri_length);
609 rgd->rd_data0 = be64_to_cpu(buf.ri_data0);
610 rgd->rd_data = be32_to_cpu(buf.ri_data);
611 rgd->rd_bitbytes = be32_to_cpu(buf.ri_bitbytes);
613 error = compute_bitstructs(rgd);
617 error = gfs2_glock_get(sdp, rgd->rd_addr,
618 &gfs2_rgrp_glops, CREATE, &rgd->rd_gl);
622 rgd->rd_gl->gl_object = rgd;
623 rgd->rd_flags &= ~GFS2_RDF_UPTODATE;
624 if (rgd->rd_data > sdp->sd_max_rg_data)
625 sdp->sd_max_rg_data = rgd->rd_data;
626 spin_lock(&sdp->sd_rindex_spin);
629 spin_unlock(&sdp->sd_rindex_spin);
634 kmem_cache_free(gfs2_rgrpd_cachep, rgd);
639 * gfs2_ri_update - Pull in a new resource index from the disk
640 * @ip: pointer to the rindex inode
642 * Returns: 0 on successful update, error code otherwise
645 static int gfs2_ri_update(struct gfs2_inode *ip)
647 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
648 struct inode *inode = &ip->i_inode;
649 struct file_ra_state ra_state;
652 file_ra_state_init(&ra_state, inode->i_mapping);
654 error = read_rindex_entry(ip, &ra_state);
655 } while (error == 0);
660 sdp->sd_rindex_uptodate = 1;
665 * gfs2_rindex_update - Update the rindex if required
666 * @sdp: The GFS2 superblock
668 * We grab a lock on the rindex inode to make sure that it doesn't
669 * change whilst we are performing an operation. We keep this lock
670 * for quite long periods of time compared to other locks. This
671 * doesn't matter, since it is shared and it is very, very rarely
672 * accessed in the exclusive mode (i.e. only when expanding the filesystem).
674 * This makes sure that we're using the latest copy of the resource index
675 * special file, which might have been updated if someone expanded the
676 * filesystem (via gfs2_grow utility), which adds new resource groups.
678 * Returns: 0 on succeess, error code otherwise
681 int gfs2_rindex_update(struct gfs2_sbd *sdp)
683 struct gfs2_inode *ip = GFS2_I(sdp->sd_rindex);
684 struct gfs2_glock *gl = ip->i_gl;
685 struct gfs2_holder ri_gh;
688 /* Read new copy from disk if we don't have the latest */
689 if (!sdp->sd_rindex_uptodate) {
690 mutex_lock(&sdp->sd_rindex_mutex);
691 error = gfs2_glock_nq_init(gl, LM_ST_SHARED, 0, &ri_gh);
694 if (!sdp->sd_rindex_uptodate)
695 error = gfs2_ri_update(ip);
696 gfs2_glock_dq_uninit(&ri_gh);
697 mutex_unlock(&sdp->sd_rindex_mutex);
704 static void gfs2_rgrp_in(struct gfs2_rgrpd *rgd, const void *buf)
706 const struct gfs2_rgrp *str = buf;
709 rg_flags = be32_to_cpu(str->rg_flags);
710 rg_flags &= ~GFS2_RDF_MASK;
711 rgd->rd_flags &= GFS2_RDF_MASK;
712 rgd->rd_flags |= rg_flags;
713 rgd->rd_free = be32_to_cpu(str->rg_free);
714 rgd->rd_dinodes = be32_to_cpu(str->rg_dinodes);
715 rgd->rd_igeneration = be64_to_cpu(str->rg_igeneration);
718 static void gfs2_rgrp_out(struct gfs2_rgrpd *rgd, void *buf)
720 struct gfs2_rgrp *str = buf;
722 str->rg_flags = cpu_to_be32(rgd->rd_flags & ~GFS2_RDF_MASK);
723 str->rg_free = cpu_to_be32(rgd->rd_free);
724 str->rg_dinodes = cpu_to_be32(rgd->rd_dinodes);
725 str->__pad = cpu_to_be32(0);
726 str->rg_igeneration = cpu_to_be64(rgd->rd_igeneration);
727 memset(&str->rg_reserved, 0, sizeof(str->rg_reserved));
731 * gfs2_rgrp_go_lock - Read in a RG's header and bitmaps
732 * @rgd: the struct gfs2_rgrpd describing the RG to read in
734 * Read in all of a Resource Group's header and bitmap blocks.
735 * Caller must eventually call gfs2_rgrp_relse() to free the bitmaps.
740 int gfs2_rgrp_go_lock(struct gfs2_holder *gh)
742 struct gfs2_rgrpd *rgd = gh->gh_gl->gl_object;
743 struct gfs2_sbd *sdp = rgd->rd_sbd;
744 struct gfs2_glock *gl = rgd->rd_gl;
745 unsigned int length = rgd->rd_length;
746 struct gfs2_bitmap *bi;
750 for (x = 0; x < length; x++) {
751 bi = rgd->rd_bits + x;
752 error = gfs2_meta_read(gl, rgd->rd_addr + x, 0, &bi->bi_bh);
757 for (y = length; y--;) {
758 bi = rgd->rd_bits + y;
759 error = gfs2_meta_wait(sdp, bi->bi_bh);
762 if (gfs2_metatype_check(sdp, bi->bi_bh, y ? GFS2_METATYPE_RB :
769 if (!(rgd->rd_flags & GFS2_RDF_UPTODATE)) {
770 for (x = 0; x < length; x++)
771 clear_bit(GBF_FULL, &rgd->rd_bits[x].bi_flags);
772 gfs2_rgrp_in(rgd, (rgd->rd_bits[0].bi_bh)->b_data);
773 rgd->rd_flags |= (GFS2_RDF_UPTODATE | GFS2_RDF_CHECK);
774 rgd->rd_free_clone = rgd->rd_free;
781 bi = rgd->rd_bits + x;
784 gfs2_assert_warn(sdp, !bi->bi_clone);
791 * gfs2_rgrp_go_unlock - Release RG bitmaps read in with gfs2_rgrp_bh_get()
792 * @rgd: the struct gfs2_rgrpd describing the RG to read in
796 void gfs2_rgrp_go_unlock(struct gfs2_holder *gh)
798 struct gfs2_rgrpd *rgd = gh->gh_gl->gl_object;
799 int x, length = rgd->rd_length;
801 for (x = 0; x < length; x++) {
802 struct gfs2_bitmap *bi = rgd->rd_bits + x;
809 void gfs2_rgrp_send_discards(struct gfs2_sbd *sdp, u64 offset,
810 struct buffer_head *bh,
811 const struct gfs2_bitmap *bi)
813 struct super_block *sb = sdp->sd_vfs;
814 struct block_device *bdev = sb->s_bdev;
815 const unsigned int sects_per_blk = sdp->sd_sb.sb_bsize /
816 bdev_logical_block_size(sb->s_bdev);
819 sector_t nr_sects = 0;
823 for (x = 0; x < bi->bi_len; x++) {
824 const u8 *orig = bh->b_data + bi->bi_offset + x;
825 const u8 *clone = bi->bi_clone + bi->bi_offset + x;
826 u8 diff = ~(*orig | (*orig >> 1)) & (*clone | (*clone >> 1));
830 blk = offset + ((bi->bi_start + x) * GFS2_NBBY);
831 blk *= sects_per_blk; /* convert to sectors */
835 goto start_new_extent;
836 if ((start + nr_sects) != blk) {
837 rv = blkdev_issue_discard(bdev, start,
846 nr_sects += sects_per_blk;
849 blk += sects_per_blk;
853 rv = blkdev_issue_discard(bdev, start, nr_sects, GFP_NOFS, 0);
859 fs_warn(sdp, "error %d on discard request, turning discards off for this filesystem", rv);
860 sdp->sd_args.ar_discard = 0;
864 * gfs2_alloc_get - get the struct gfs2_alloc structure for an inode
865 * @ip: the incore GFS2 inode structure
867 * Returns: the struct gfs2_alloc
870 struct gfs2_alloc *gfs2_alloc_get(struct gfs2_inode *ip)
872 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
874 BUG_ON(ip->i_alloc != NULL);
875 ip->i_alloc = kzalloc(sizeof(struct gfs2_alloc), GFP_NOFS);
876 error = gfs2_rindex_update(sdp);
878 fs_warn(sdp, "rindex update returns %d\n", error);
883 * try_rgrp_fit - See if a given reservation will fit in a given RG
887 * If there's room for the requested blocks to be allocated from the RG:
889 * Returns: 1 on success (it fits), 0 on failure (it doesn't fit)
892 static int try_rgrp_fit(const struct gfs2_rgrpd *rgd, const struct gfs2_inode *ip)
894 const struct gfs2_alloc *al = ip->i_alloc;
896 if (rgd->rd_flags & (GFS2_RGF_NOALLOC | GFS2_RDF_ERROR))
898 if (rgd->rd_free_clone >= al->al_requested)
904 * try_rgrp_unlink - Look for any unlinked, allocated, but unused inodes
907 * Returns: 0 if no error
908 * The inode, if one has been found, in inode.
911 static void try_rgrp_unlink(struct gfs2_rgrpd *rgd, u64 *last_unlinked, u64 skip)
915 struct gfs2_sbd *sdp = rgd->rd_sbd;
917 struct gfs2_glock *gl;
918 struct gfs2_inode *ip;
922 while (goal < rgd->rd_data) {
923 down_write(&sdp->sd_log_flush_lock);
925 block = rgblk_search(rgd, goal, GFS2_BLKST_UNLINKED,
926 GFS2_BLKST_UNLINKED, &n);
927 up_write(&sdp->sd_log_flush_lock);
928 if (block == BFITNOENT)
930 /* rgblk_search can return a block < goal, so we need to
931 keep it marching forward. */
932 no_addr = block + rgd->rd_data0;
933 goal = max(block + 1, goal + 1);
934 if (*last_unlinked != NO_BLOCK && no_addr <= *last_unlinked)
938 *last_unlinked = no_addr;
940 error = gfs2_glock_get(sdp, no_addr, &gfs2_inode_glops, CREATE, &gl);
944 /* If the inode is already in cache, we can ignore it here
945 * because the existing inode disposal code will deal with
946 * it when all refs have gone away. Accessing gl_object like
947 * this is not safe in general. Here it is ok because we do
948 * not dereference the pointer, and we only need an approx
949 * answer to whether it is NULL or not.
953 if (ip || queue_work(gfs2_delete_workqueue, &gl->gl_delete) == 0)
958 /* Limit reclaim to sensible number of tasks */
963 rgd->rd_flags &= ~GFS2_RDF_CHECK;
968 * get_local_rgrp - Choose and lock a rgrp for allocation
969 * @ip: the inode to reserve space for
970 * @rgp: the chosen and locked rgrp
972 * Try to acquire rgrp in way which avoids contending with others.
977 static int get_local_rgrp(struct gfs2_inode *ip, u64 *last_unlinked)
979 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
980 struct gfs2_rgrpd *rgd, *begin = NULL;
981 struct gfs2_alloc *al = ip->i_alloc;
982 int error, rg_locked;
985 if (ip->i_rgd && rgrp_contains_block(ip->i_rgd, ip->i_goal))
986 rgd = begin = ip->i_rgd;
988 rgd = begin = gfs2_blk2rgrpd(sdp, ip->i_goal);
996 if (gfs2_glock_is_locked_by_me(rgd->rd_gl)) {
1000 error = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_EXCLUSIVE,
1001 LM_FLAG_TRY, &al->al_rgd_gh);
1005 if (try_rgrp_fit(rgd, ip)) {
1009 if (rgd->rd_flags & GFS2_RDF_CHECK)
1010 try_rgrp_unlink(rgd, last_unlinked, ip->i_no_addr);
1012 gfs2_glock_dq_uninit(&al->al_rgd_gh);
1015 rgd = gfs2_rgrpd_get_next(rgd);
1028 * gfs2_inplace_reserve_i - Reserve space in the filesystem
1029 * @ip: the inode to reserve space for
1034 int gfs2_inplace_reserve_i(struct gfs2_inode *ip,
1035 char *file, unsigned int line)
1037 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1038 struct gfs2_alloc *al = ip->i_alloc;
1040 u64 last_unlinked = NO_BLOCK;
1043 if (gfs2_assert_warn(sdp, al->al_requested))
1047 error = get_local_rgrp(ip, &last_unlinked);
1048 if (error != -ENOSPC)
1050 /* Check that fs hasn't grown if writing to rindex */
1051 if (ip == GFS2_I(sdp->sd_rindex) && !sdp->sd_rindex_uptodate) {
1052 error = gfs2_ri_update(ip);
1057 /* Flushing the log may release space */
1058 gfs2_log_flush(sdp, NULL);
1059 } while (tries++ < 3);
1064 /* no error, so we have the rgrp set in the inode's allocation. */
1072 * gfs2_inplace_release - release an inplace reservation
1073 * @ip: the inode the reservation was taken out on
1075 * Release a reservation made by gfs2_inplace_reserve().
1078 void gfs2_inplace_release(struct gfs2_inode *ip)
1080 struct gfs2_alloc *al = ip->i_alloc;
1082 if (al->al_rgd_gh.gh_gl)
1083 gfs2_glock_dq_uninit(&al->al_rgd_gh);
1087 * gfs2_get_block_type - Check a block in a RG is of given type
1088 * @rgd: the resource group holding the block
1089 * @block: the block number
1091 * Returns: The block type (GFS2_BLKST_*)
1094 static unsigned char gfs2_get_block_type(struct gfs2_rgrpd *rgd, u64 block)
1096 struct gfs2_bitmap *bi = NULL;
1097 u32 length, rgrp_block, buf_block;
1101 length = rgd->rd_length;
1102 rgrp_block = block - rgd->rd_data0;
1104 for (buf = 0; buf < length; buf++) {
1105 bi = rgd->rd_bits + buf;
1106 if (rgrp_block < (bi->bi_start + bi->bi_len) * GFS2_NBBY)
1110 gfs2_assert(rgd->rd_sbd, buf < length);
1111 buf_block = rgrp_block - bi->bi_start * GFS2_NBBY;
1113 type = gfs2_testbit(rgd, bi->bi_bh->b_data + bi->bi_offset,
1114 bi->bi_len, buf_block);
1120 * rgblk_search - find a block in @old_state, change allocation
1121 * state to @new_state
1122 * @rgd: the resource group descriptor
1123 * @goal: the goal block within the RG (start here to search for avail block)
1124 * @old_state: GFS2_BLKST_XXX the before-allocation state to find
1125 * @new_state: GFS2_BLKST_XXX the after-allocation block state
1126 * @n: The extent length
1128 * Walk rgrp's bitmap to find bits that represent a block in @old_state.
1129 * Add the found bitmap buffer to the transaction.
1130 * Set the found bits to @new_state to change block's allocation state.
1132 * This function never fails, because we wouldn't call it unless we
1133 * know (from reservation results, etc.) that a block is available.
1135 * Scope of @goal and returned block is just within rgrp, not the whole
1138 * Returns: the block number allocated
1141 static u32 rgblk_search(struct gfs2_rgrpd *rgd, u32 goal,
1142 unsigned char old_state, unsigned char new_state,
1145 struct gfs2_bitmap *bi = NULL;
1146 const u32 length = rgd->rd_length;
1147 u32 blk = BFITNOENT;
1148 unsigned int buf, x;
1149 const unsigned int elen = *n;
1150 const u8 *buffer = NULL;
1153 /* Find bitmap block that contains bits for goal block */
1154 for (buf = 0; buf < length; buf++) {
1155 bi = rgd->rd_bits + buf;
1156 /* Convert scope of "goal" from rgrp-wide to within found bit block */
1157 if (goal < (bi->bi_start + bi->bi_len) * GFS2_NBBY) {
1158 goal -= bi->bi_start * GFS2_NBBY;
1166 /* Search (up to entire) bitmap in this rgrp for allocatable block.
1167 "x <= length", instead of "x < length", because we typically start
1168 the search in the middle of a bit block, but if we can't find an
1169 allocatable block anywhere else, we want to be able wrap around and
1170 search in the first part of our first-searched bit block. */
1171 for (x = 0; x <= length; x++) {
1172 bi = rgd->rd_bits + buf;
1174 if (test_bit(GBF_FULL, &bi->bi_flags) &&
1175 (old_state == GFS2_BLKST_FREE))
1178 /* The GFS2_BLKST_UNLINKED state doesn't apply to the clone
1179 bitmaps, so we must search the originals for that. */
1180 buffer = bi->bi_bh->b_data + bi->bi_offset;
1181 WARN_ON(!buffer_uptodate(bi->bi_bh));
1182 if (old_state != GFS2_BLKST_UNLINKED && bi->bi_clone)
1183 buffer = bi->bi_clone + bi->bi_offset;
1185 blk = gfs2_bitfit(buffer, bi->bi_len, goal, old_state);
1186 if (blk != BFITNOENT)
1189 if ((goal == 0) && (old_state == GFS2_BLKST_FREE))
1190 set_bit(GBF_FULL, &bi->bi_flags);
1192 /* Try next bitmap block (wrap back to rgrp header if at end) */
1199 if (blk == BFITNOENT)
1203 if (old_state == new_state)
1206 gfs2_trans_add_bh(rgd->rd_gl, bi->bi_bh, 1);
1207 gfs2_setbit(rgd, bi->bi_bh->b_data, bi->bi_clone, bi->bi_offset,
1208 bi, blk, new_state);
1212 if (goal >= (bi->bi_len * GFS2_NBBY))
1214 if (gfs2_testbit(rgd, buffer, bi->bi_len, goal) !=
1217 gfs2_setbit(rgd, bi->bi_bh->b_data, bi->bi_clone, bi->bi_offset,
1218 bi, goal, new_state);
1222 return (bi->bi_start * GFS2_NBBY) + blk;
1226 * rgblk_free - Change alloc state of given block(s)
1227 * @sdp: the filesystem
1228 * @bstart: the start of a run of blocks to free
1229 * @blen: the length of the block run (all must lie within ONE RG!)
1230 * @new_state: GFS2_BLKST_XXX the after-allocation block state
1232 * Returns: Resource group containing the block(s)
1235 static struct gfs2_rgrpd *rgblk_free(struct gfs2_sbd *sdp, u64 bstart,
1236 u32 blen, unsigned char new_state)
1238 struct gfs2_rgrpd *rgd;
1239 struct gfs2_bitmap *bi = NULL;
1240 u32 length, rgrp_blk, buf_blk;
1243 rgd = gfs2_blk2rgrpd(sdp, bstart);
1245 if (gfs2_consist(sdp))
1246 fs_err(sdp, "block = %llu\n", (unsigned long long)bstart);
1250 length = rgd->rd_length;
1252 rgrp_blk = bstart - rgd->rd_data0;
1255 for (buf = 0; buf < length; buf++) {
1256 bi = rgd->rd_bits + buf;
1257 if (rgrp_blk < (bi->bi_start + bi->bi_len) * GFS2_NBBY)
1261 gfs2_assert(rgd->rd_sbd, buf < length);
1263 buf_blk = rgrp_blk - bi->bi_start * GFS2_NBBY;
1266 if (!bi->bi_clone) {
1267 bi->bi_clone = kmalloc(bi->bi_bh->b_size,
1268 GFP_NOFS | __GFP_NOFAIL);
1269 memcpy(bi->bi_clone + bi->bi_offset,
1270 bi->bi_bh->b_data + bi->bi_offset,
1273 gfs2_trans_add_bh(rgd->rd_gl, bi->bi_bh, 1);
1274 gfs2_setbit(rgd, bi->bi_bh->b_data, NULL, bi->bi_offset,
1275 bi, buf_blk, new_state);
1282 * gfs2_rgrp_dump - print out an rgrp
1283 * @seq: The iterator
1284 * @gl: The glock in question
1288 int gfs2_rgrp_dump(struct seq_file *seq, const struct gfs2_glock *gl)
1290 const struct gfs2_rgrpd *rgd = gl->gl_object;
1293 gfs2_print_dbg(seq, " R: n:%llu f:%02x b:%u/%u i:%u\n",
1294 (unsigned long long)rgd->rd_addr, rgd->rd_flags,
1295 rgd->rd_free, rgd->rd_free_clone, rgd->rd_dinodes);
1299 static void gfs2_rgrp_error(struct gfs2_rgrpd *rgd)
1301 struct gfs2_sbd *sdp = rgd->rd_sbd;
1302 fs_warn(sdp, "rgrp %llu has an error, marking it readonly until umount\n",
1303 (unsigned long long)rgd->rd_addr);
1304 fs_warn(sdp, "umount on all nodes and run fsck.gfs2 to fix the error\n");
1305 gfs2_rgrp_dump(NULL, rgd->rd_gl);
1306 rgd->rd_flags |= GFS2_RDF_ERROR;
1310 * gfs2_alloc_block - Allocate one or more blocks
1311 * @ip: the inode to allocate the block for
1312 * @bn: Used to return the starting block number
1313 * @n: requested number of blocks/extent length (value/result)
1315 * Returns: 0 or error
1318 int gfs2_alloc_block(struct gfs2_inode *ip, u64 *bn, unsigned int *n)
1320 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1321 struct buffer_head *dibh;
1322 struct gfs2_alloc *al = ip->i_alloc;
1323 struct gfs2_rgrpd *rgd;
1328 /* Only happens if there is a bug in gfs2, return something distinctive
1329 * to ensure that it is noticed.
1336 if (rgrp_contains_block(rgd, ip->i_goal))
1337 goal = ip->i_goal - rgd->rd_data0;
1339 goal = rgd->rd_last_alloc;
1341 blk = rgblk_search(rgd, goal, GFS2_BLKST_FREE, GFS2_BLKST_USED, n);
1343 /* Since all blocks are reserved in advance, this shouldn't happen */
1344 if (blk == BFITNOENT)
1347 rgd->rd_last_alloc = blk;
1348 block = rgd->rd_data0 + blk;
1349 ip->i_goal = block + *n - 1;
1350 error = gfs2_meta_inode_buffer(ip, &dibh);
1352 struct gfs2_dinode *di = (struct gfs2_dinode *)dibh->b_data;
1353 gfs2_trans_add_bh(ip->i_gl, dibh, 1);
1354 di->di_goal_meta = di->di_goal_data = cpu_to_be64(ip->i_goal);
1357 if (rgd->rd_free < *n)
1362 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1363 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
1365 al->al_alloced += *n;
1367 gfs2_statfs_change(sdp, 0, -(s64)*n, 0);
1368 gfs2_quota_change(ip, *n, ip->i_inode.i_uid, ip->i_inode.i_gid);
1370 rgd->rd_free_clone -= *n;
1371 trace_gfs2_block_alloc(ip, block, *n, GFS2_BLKST_USED);
1376 gfs2_rgrp_error(rgd);
1381 * gfs2_alloc_di - Allocate a dinode
1382 * @dip: the directory that the inode is going in
1383 * @bn: the block number which is allocated
1384 * @generation: the generation number of the inode
1386 * Returns: 0 on success or error
1389 int gfs2_alloc_di(struct gfs2_inode *dip, u64 *bn, u64 *generation)
1391 struct gfs2_sbd *sdp = GFS2_SB(&dip->i_inode);
1392 struct gfs2_alloc *al = dip->i_alloc;
1393 struct gfs2_rgrpd *rgd = dip->i_rgd;
1398 blk = rgblk_search(rgd, rgd->rd_last_alloc,
1399 GFS2_BLKST_FREE, GFS2_BLKST_DINODE, &n);
1401 /* Since all blocks are reserved in advance, this shouldn't happen */
1402 if (blk == BFITNOENT)
1405 rgd->rd_last_alloc = blk;
1406 block = rgd->rd_data0 + blk;
1407 if (rgd->rd_free == 0)
1412 *generation = rgd->rd_igeneration++;
1413 if (*generation == 0)
1414 *generation = rgd->rd_igeneration++;
1415 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1416 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
1420 gfs2_statfs_change(sdp, 0, -1, +1);
1421 gfs2_trans_add_unrevoke(sdp, block, 1);
1423 rgd->rd_free_clone--;
1424 trace_gfs2_block_alloc(dip, block, 1, GFS2_BLKST_DINODE);
1429 gfs2_rgrp_error(rgd);
1434 * __gfs2_free_blocks - free a contiguous run of block(s)
1435 * @ip: the inode these blocks are being freed from
1436 * @bstart: first block of a run of contiguous blocks
1437 * @blen: the length of the block run
1438 * @meta: 1 if the blocks represent metadata
1442 void __gfs2_free_blocks(struct gfs2_inode *ip, u64 bstart, u32 blen, int meta)
1444 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1445 struct gfs2_rgrpd *rgd;
1447 rgd = rgblk_free(sdp, bstart, blen, GFS2_BLKST_FREE);
1450 trace_gfs2_block_alloc(ip, bstart, blen, GFS2_BLKST_FREE);
1451 rgd->rd_free += blen;
1453 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1454 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
1456 /* Directories keep their data in the metadata address space */
1457 if (meta || ip->i_depth)
1458 gfs2_meta_wipe(ip, bstart, blen);
1462 * gfs2_free_meta - free a contiguous run of data block(s)
1463 * @ip: the inode these blocks are being freed from
1464 * @bstart: first block of a run of contiguous blocks
1465 * @blen: the length of the block run
1469 void gfs2_free_meta(struct gfs2_inode *ip, u64 bstart, u32 blen)
1471 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1473 __gfs2_free_blocks(ip, bstart, blen, 1);
1474 gfs2_statfs_change(sdp, 0, +blen, 0);
1475 gfs2_quota_change(ip, -(s64)blen, ip->i_inode.i_uid, ip->i_inode.i_gid);
1478 void gfs2_unlink_di(struct inode *inode)
1480 struct gfs2_inode *ip = GFS2_I(inode);
1481 struct gfs2_sbd *sdp = GFS2_SB(inode);
1482 struct gfs2_rgrpd *rgd;
1483 u64 blkno = ip->i_no_addr;
1485 rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_UNLINKED);
1488 trace_gfs2_block_alloc(ip, blkno, 1, GFS2_BLKST_UNLINKED);
1489 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1490 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
1493 static void gfs2_free_uninit_di(struct gfs2_rgrpd *rgd, u64 blkno)
1495 struct gfs2_sbd *sdp = rgd->rd_sbd;
1496 struct gfs2_rgrpd *tmp_rgd;
1498 tmp_rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_FREE);
1501 gfs2_assert_withdraw(sdp, rgd == tmp_rgd);
1503 if (!rgd->rd_dinodes)
1504 gfs2_consist_rgrpd(rgd);
1508 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1509 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
1511 gfs2_statfs_change(sdp, 0, +1, -1);
1515 void gfs2_free_di(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip)
1517 gfs2_free_uninit_di(rgd, ip->i_no_addr);
1518 trace_gfs2_block_alloc(ip, ip->i_no_addr, 1, GFS2_BLKST_FREE);
1519 gfs2_quota_change(ip, -1, ip->i_inode.i_uid, ip->i_inode.i_gid);
1520 gfs2_meta_wipe(ip, ip->i_no_addr, 1);
1524 * gfs2_check_blk_type - Check the type of a block
1525 * @sdp: The superblock
1526 * @no_addr: The block number to check
1527 * @type: The block type we are looking for
1529 * Returns: 0 if the block type matches the expected type
1530 * -ESTALE if it doesn't match
1531 * or -ve errno if something went wrong while checking
1534 int gfs2_check_blk_type(struct gfs2_sbd *sdp, u64 no_addr, unsigned int type)
1536 struct gfs2_rgrpd *rgd;
1537 struct gfs2_holder rgd_gh;
1540 error = gfs2_rindex_update(sdp);
1545 rgd = gfs2_blk2rgrpd(sdp, no_addr);
1549 error = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_SHARED, 0, &rgd_gh);
1553 if (gfs2_get_block_type(rgd, no_addr) != type)
1556 gfs2_glock_dq_uninit(&rgd_gh);
1562 * gfs2_rlist_add - add a RG to a list of RGs
1564 * @rlist: the list of resource groups
1567 * Figure out what RG a block belongs to and add that RG to the list
1569 * FIXME: Don't use NOFAIL
1573 void gfs2_rlist_add(struct gfs2_inode *ip, struct gfs2_rgrp_list *rlist,
1576 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1577 struct gfs2_rgrpd *rgd;
1578 struct gfs2_rgrpd **tmp;
1579 unsigned int new_space;
1582 if (gfs2_assert_warn(sdp, !rlist->rl_ghs))
1585 if (ip->i_rgd && rgrp_contains_block(ip->i_rgd, block))
1588 rgd = gfs2_blk2rgrpd(sdp, block);
1590 fs_err(sdp, "rlist_add: no rgrp for block %llu\n", (unsigned long long)block);
1595 for (x = 0; x < rlist->rl_rgrps; x++)
1596 if (rlist->rl_rgd[x] == rgd)
1599 if (rlist->rl_rgrps == rlist->rl_space) {
1600 new_space = rlist->rl_space + 10;
1602 tmp = kcalloc(new_space, sizeof(struct gfs2_rgrpd *),
1603 GFP_NOFS | __GFP_NOFAIL);
1605 if (rlist->rl_rgd) {
1606 memcpy(tmp, rlist->rl_rgd,
1607 rlist->rl_space * sizeof(struct gfs2_rgrpd *));
1608 kfree(rlist->rl_rgd);
1611 rlist->rl_space = new_space;
1612 rlist->rl_rgd = tmp;
1615 rlist->rl_rgd[rlist->rl_rgrps++] = rgd;
1619 * gfs2_rlist_alloc - all RGs have been added to the rlist, now allocate
1620 * and initialize an array of glock holders for them
1621 * @rlist: the list of resource groups
1622 * @state: the lock state to acquire the RG lock in
1623 * @flags: the modifier flags for the holder structures
1625 * FIXME: Don't use NOFAIL
1629 void gfs2_rlist_alloc(struct gfs2_rgrp_list *rlist, unsigned int state)
1633 rlist->rl_ghs = kcalloc(rlist->rl_rgrps, sizeof(struct gfs2_holder),
1634 GFP_NOFS | __GFP_NOFAIL);
1635 for (x = 0; x < rlist->rl_rgrps; x++)
1636 gfs2_holder_init(rlist->rl_rgd[x]->rd_gl,
1642 * gfs2_rlist_free - free a resource group list
1643 * @list: the list of resource groups
1647 void gfs2_rlist_free(struct gfs2_rgrp_list *rlist)
1651 kfree(rlist->rl_rgd);
1653 if (rlist->rl_ghs) {
1654 for (x = 0; x < rlist->rl_rgrps; x++)
1655 gfs2_holder_uninit(&rlist->rl_ghs[x]);
1656 kfree(rlist->rl_ghs);