2 * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
3 * Copyright (C) 2004-2007 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/lm_interface.h>
33 #define BFITNOENT ((u32)~0)
34 #define NO_BLOCK ((u64)~0)
37 * These routines are used by the resource group routines (rgrp.c)
38 * to keep track of block allocation. Each block is represented by two
39 * bits. So, each byte represents GFS2_NBBY (i.e. 4) blocks.
42 * 1 = Used (not metadata)
43 * 2 = Unlinked (still in use) inode
47 static const char valid_change[16] = {
55 static u32 rgblk_search(struct gfs2_rgrpd *rgd, u32 goal,
56 unsigned char old_state, unsigned char new_state);
59 * gfs2_setbit - Set a bit in the bitmaps
60 * @buffer: the buffer that holds the bitmaps
61 * @buflen: the length (in bytes) of the buffer
62 * @block: the block to set
63 * @new_state: the new state of the block
67 static void gfs2_setbit(struct gfs2_rgrpd *rgd, unsigned char *buffer,
68 unsigned int buflen, u32 block,
69 unsigned char new_state)
71 unsigned char *byte, *end, cur_state;
74 byte = buffer + (block / GFS2_NBBY);
75 bit = (block % GFS2_NBBY) * GFS2_BIT_SIZE;
76 end = buffer + buflen;
78 gfs2_assert(rgd->rd_sbd, byte < end);
80 cur_state = (*byte >> bit) & GFS2_BIT_MASK;
82 if (valid_change[new_state * 4 + cur_state]) {
83 *byte ^= cur_state << bit;
84 *byte |= new_state << bit;
86 gfs2_consist_rgrpd(rgd);
90 * gfs2_testbit - test a bit in the bitmaps
91 * @buffer: the buffer that holds the bitmaps
92 * @buflen: the length (in bytes) of the buffer
93 * @block: the block to read
97 static unsigned char gfs2_testbit(struct gfs2_rgrpd *rgd, unsigned char *buffer,
98 unsigned int buflen, u32 block)
100 unsigned char *byte, *end, cur_state;
103 byte = buffer + (block / GFS2_NBBY);
104 bit = (block % GFS2_NBBY) * GFS2_BIT_SIZE;
105 end = buffer + buflen;
107 gfs2_assert(rgd->rd_sbd, byte < end);
109 cur_state = (*byte >> bit) & GFS2_BIT_MASK;
115 * gfs2_bitfit - Search an rgrp's bitmap buffer to find a bit-pair representing
116 * a block in a given allocation state.
117 * @buffer: the buffer that holds the bitmaps
118 * @buflen: the length (in bytes) of the buffer
119 * @goal: start search at this block's bit-pair (within @buffer)
120 * @old_state: GFS2_BLKST_XXX the state of the block we're looking for.
122 * Scope of @goal and returned block number is only within this bitmap buffer,
123 * not entire rgrp or filesystem. @buffer will be offset from the actual
124 * beginning of a bitmap block buffer, skipping any header structures.
126 * Return: the block number (bitmap buffer scope) that was found
129 static u32 gfs2_bitfit(struct gfs2_rgrpd *rgd, unsigned char *buffer,
130 unsigned int buflen, u32 goal,
131 unsigned char old_state)
133 unsigned char *byte, *end, alloc;
137 byte = buffer + (goal / GFS2_NBBY);
138 bit = (goal % GFS2_NBBY) * GFS2_BIT_SIZE;
139 end = buffer + buflen;
140 alloc = (old_state == GFS2_BLKST_FREE) ? 0x55 : 0;
143 /* If we're looking for a free block we can eliminate all
144 bitmap settings with 0x55, which represents four data
145 blocks in a row. If we're looking for a data block, we can
146 eliminate 0x00 which corresponds to four free blocks. */
147 if ((*byte & 0x55) == alloc) {
148 blk += (8 - bit) >> 1;
156 if (((*byte >> bit) & GFS2_BIT_MASK) == old_state)
159 bit += GFS2_BIT_SIZE;
172 * gfs2_bitcount - count the number of bits in a certain state
173 * @buffer: the buffer that holds the bitmaps
174 * @buflen: the length (in bytes) of the buffer
175 * @state: the state of the block we're looking for
177 * Returns: The number of bits
180 static u32 gfs2_bitcount(struct gfs2_rgrpd *rgd, unsigned char *buffer,
181 unsigned int buflen, unsigned char state)
183 unsigned char *byte = buffer;
184 unsigned char *end = buffer + buflen;
185 unsigned char state1 = state << 2;
186 unsigned char state2 = state << 4;
187 unsigned char state3 = state << 6;
190 for (; byte < end; byte++) {
191 if (((*byte) & 0x03) == state)
193 if (((*byte) & 0x0C) == state1)
195 if (((*byte) & 0x30) == state2)
197 if (((*byte) & 0xC0) == state3)
205 * gfs2_rgrp_verify - Verify that a resource group is consistent
206 * @sdp: the filesystem
211 void gfs2_rgrp_verify(struct gfs2_rgrpd *rgd)
213 struct gfs2_sbd *sdp = rgd->rd_sbd;
214 struct gfs2_bitmap *bi = NULL;
215 u32 length = rgd->rd_length;
219 memset(count, 0, 4 * sizeof(u32));
221 /* Count # blocks in each of 4 possible allocation states */
222 for (buf = 0; buf < length; buf++) {
223 bi = rgd->rd_bits + buf;
224 for (x = 0; x < 4; x++)
225 count[x] += gfs2_bitcount(rgd,
231 if (count[0] != rgd->rd_rg.rg_free) {
232 if (gfs2_consist_rgrpd(rgd))
233 fs_err(sdp, "free data mismatch: %u != %u\n",
234 count[0], rgd->rd_rg.rg_free);
240 rgd->rd_rg.rg_dinodes;
241 if (count[1] + count[2] != tmp) {
242 if (gfs2_consist_rgrpd(rgd))
243 fs_err(sdp, "used data mismatch: %u != %u\n",
248 if (count[3] != rgd->rd_rg.rg_dinodes) {
249 if (gfs2_consist_rgrpd(rgd))
250 fs_err(sdp, "used metadata mismatch: %u != %u\n",
251 count[3], rgd->rd_rg.rg_dinodes);
255 if (count[2] > count[3]) {
256 if (gfs2_consist_rgrpd(rgd))
257 fs_err(sdp, "unlinked inodes > inodes: %u\n",
264 static inline int rgrp_contains_block(struct gfs2_rgrpd *rgd, u64 block)
266 u64 first = rgd->rd_data0;
267 u64 last = first + rgd->rd_data;
268 return first <= block && block < last;
272 * gfs2_blk2rgrpd - Find resource group for a given data/meta block number
273 * @sdp: The GFS2 superblock
274 * @n: The data block number
276 * Returns: The resource group, or NULL if not found
279 struct gfs2_rgrpd *gfs2_blk2rgrpd(struct gfs2_sbd *sdp, u64 blk)
281 struct gfs2_rgrpd *rgd;
283 spin_lock(&sdp->sd_rindex_spin);
285 list_for_each_entry(rgd, &sdp->sd_rindex_mru_list, rd_list_mru) {
286 if (rgrp_contains_block(rgd, blk)) {
287 list_move(&rgd->rd_list_mru, &sdp->sd_rindex_mru_list);
288 spin_unlock(&sdp->sd_rindex_spin);
293 spin_unlock(&sdp->sd_rindex_spin);
299 * gfs2_rgrpd_get_first - get the first Resource Group in the filesystem
300 * @sdp: The GFS2 superblock
302 * Returns: The first rgrp in the filesystem
305 struct gfs2_rgrpd *gfs2_rgrpd_get_first(struct gfs2_sbd *sdp)
307 gfs2_assert(sdp, !list_empty(&sdp->sd_rindex_list));
308 return list_entry(sdp->sd_rindex_list.next, struct gfs2_rgrpd, rd_list);
312 * gfs2_rgrpd_get_next - get the next RG
315 * Returns: The next rgrp
318 struct gfs2_rgrpd *gfs2_rgrpd_get_next(struct gfs2_rgrpd *rgd)
320 if (rgd->rd_list.next == &rgd->rd_sbd->sd_rindex_list)
322 return list_entry(rgd->rd_list.next, struct gfs2_rgrpd, rd_list);
325 static void clear_rgrpdi(struct gfs2_sbd *sdp)
327 struct list_head *head;
328 struct gfs2_rgrpd *rgd;
329 struct gfs2_glock *gl;
331 spin_lock(&sdp->sd_rindex_spin);
332 sdp->sd_rindex_forward = NULL;
333 head = &sdp->sd_rindex_recent_list;
334 while (!list_empty(head)) {
335 rgd = list_entry(head->next, struct gfs2_rgrpd, rd_recent);
336 list_del(&rgd->rd_recent);
338 spin_unlock(&sdp->sd_rindex_spin);
340 head = &sdp->sd_rindex_list;
341 while (!list_empty(head)) {
342 rgd = list_entry(head->next, struct gfs2_rgrpd, rd_list);
345 list_del(&rgd->rd_list);
346 list_del(&rgd->rd_list_mru);
349 gl->gl_object = NULL;
358 void gfs2_clear_rgrpd(struct gfs2_sbd *sdp)
360 mutex_lock(&sdp->sd_rindex_mutex);
362 mutex_unlock(&sdp->sd_rindex_mutex);
365 static void gfs2_rindex_print(const struct gfs2_rgrpd *rgd)
367 printk(KERN_INFO " ri_addr = %llu\n", (unsigned long long)rgd->rd_addr);
368 printk(KERN_INFO " ri_length = %u\n", rgd->rd_length);
369 printk(KERN_INFO " ri_data0 = %llu\n", (unsigned long long)rgd->rd_data0);
370 printk(KERN_INFO " ri_data = %u\n", rgd->rd_data);
371 printk(KERN_INFO " ri_bitbytes = %u\n", rgd->rd_bitbytes);
375 * gfs2_compute_bitstructs - Compute the bitmap sizes
376 * @rgd: The resource group descriptor
378 * Calculates bitmap descriptors, one for each block that contains bitmap data
383 static int compute_bitstructs(struct gfs2_rgrpd *rgd)
385 struct gfs2_sbd *sdp = rgd->rd_sbd;
386 struct gfs2_bitmap *bi;
387 u32 length = rgd->rd_length; /* # blocks in hdr & bitmap */
388 u32 bytes_left, bytes;
394 rgd->rd_bits = kcalloc(length, sizeof(struct gfs2_bitmap), GFP_NOFS);
398 bytes_left = rgd->rd_bitbytes;
400 for (x = 0; x < length; x++) {
401 bi = rgd->rd_bits + x;
403 /* small rgrp; bitmap stored completely in header block */
406 bi->bi_offset = sizeof(struct gfs2_rgrp);
411 bytes = sdp->sd_sb.sb_bsize - sizeof(struct gfs2_rgrp);
412 bi->bi_offset = sizeof(struct gfs2_rgrp);
416 } else if (x + 1 == length) {
418 bi->bi_offset = sizeof(struct gfs2_meta_header);
419 bi->bi_start = rgd->rd_bitbytes - bytes_left;
423 bytes = sdp->sd_sb.sb_bsize -
424 sizeof(struct gfs2_meta_header);
425 bi->bi_offset = sizeof(struct gfs2_meta_header);
426 bi->bi_start = rgd->rd_bitbytes - bytes_left;
434 gfs2_consist_rgrpd(rgd);
437 bi = rgd->rd_bits + (length - 1);
438 if ((bi->bi_start + bi->bi_len) * GFS2_NBBY != rgd->rd_data) {
439 if (gfs2_consist_rgrpd(rgd)) {
440 gfs2_rindex_print(rgd);
441 fs_err(sdp, "start=%u len=%u offset=%u\n",
442 bi->bi_start, bi->bi_len, bi->bi_offset);
451 * gfs2_ri_total - Total up the file system space, according to the rindex.
454 u64 gfs2_ri_total(struct gfs2_sbd *sdp)
457 struct inode *inode = sdp->sd_rindex;
458 struct gfs2_inode *ip = GFS2_I(inode);
459 char buf[sizeof(struct gfs2_rindex)];
460 struct file_ra_state ra_state;
463 mutex_lock(&sdp->sd_rindex_mutex);
464 file_ra_state_init(&ra_state, inode->i_mapping);
465 for (rgrps = 0;; rgrps++) {
466 loff_t pos = rgrps * sizeof(struct gfs2_rindex);
468 if (pos + sizeof(struct gfs2_rindex) >= ip->i_di.di_size)
470 error = gfs2_internal_read(ip, &ra_state, buf, &pos,
471 sizeof(struct gfs2_rindex));
472 if (error != sizeof(struct gfs2_rindex))
474 total_data += be32_to_cpu(((struct gfs2_rindex *)buf)->ri_data);
476 mutex_unlock(&sdp->sd_rindex_mutex);
480 static void gfs2_rindex_in(struct gfs2_rgrpd *rgd, const void *buf)
482 const struct gfs2_rindex *str = buf;
484 rgd->rd_addr = be64_to_cpu(str->ri_addr);
485 rgd->rd_length = be32_to_cpu(str->ri_length);
486 rgd->rd_data0 = be64_to_cpu(str->ri_data0);
487 rgd->rd_data = be32_to_cpu(str->ri_data);
488 rgd->rd_bitbytes = be32_to_cpu(str->ri_bitbytes);
492 * read_rindex_entry - Pull in a new resource index entry from the disk
493 * @gl: The glock covering the rindex inode
495 * Returns: 0 on success, error code otherwise
498 static int read_rindex_entry(struct gfs2_inode *ip,
499 struct file_ra_state *ra_state)
501 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
502 loff_t pos = sdp->sd_rgrps * sizeof(struct gfs2_rindex);
503 char buf[sizeof(struct gfs2_rindex)];
505 struct gfs2_rgrpd *rgd;
507 error = gfs2_internal_read(ip, ra_state, buf, &pos,
508 sizeof(struct gfs2_rindex));
511 if (error != sizeof(struct gfs2_rindex)) {
517 rgd = kzalloc(sizeof(struct gfs2_rgrpd), GFP_NOFS);
522 mutex_init(&rgd->rd_mutex);
523 lops_init_le(&rgd->rd_le, &gfs2_rg_lops);
526 list_add_tail(&rgd->rd_list, &sdp->sd_rindex_list);
527 list_add_tail(&rgd->rd_list_mru, &sdp->sd_rindex_mru_list);
529 gfs2_rindex_in(rgd, buf);
530 error = compute_bitstructs(rgd);
534 error = gfs2_glock_get(sdp, rgd->rd_addr,
535 &gfs2_rgrp_glops, CREATE, &rgd->rd_gl);
539 rgd->rd_gl->gl_object = rgd;
540 rgd->rd_rg_vn = rgd->rd_gl->gl_vn - 1;
541 rgd->rd_flags |= GFS2_RDF_CHECK;
546 * gfs2_ri_update - Pull in a new resource index from the disk
547 * @ip: pointer to the rindex inode
549 * Returns: 0 on successful update, error code otherwise
552 static int gfs2_ri_update(struct gfs2_inode *ip)
554 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
555 struct inode *inode = &ip->i_inode;
556 struct file_ra_state ra_state;
557 u64 rgrp_count = ip->i_di.di_size;
560 if (do_div(rgrp_count, sizeof(struct gfs2_rindex))) {
561 gfs2_consist_inode(ip);
567 file_ra_state_init(&ra_state, inode->i_mapping);
568 for (sdp->sd_rgrps = 0; sdp->sd_rgrps < rgrp_count; sdp->sd_rgrps++) {
569 error = read_rindex_entry(ip, &ra_state);
576 sdp->sd_rindex_vn = ip->i_gl->gl_vn;
581 * gfs2_ri_update_special - Pull in a new resource index from the disk
583 * This is a special version that's safe to call from gfs2_inplace_reserve_i.
584 * In this case we know that we don't have any resource groups in memory yet.
586 * @ip: pointer to the rindex inode
588 * Returns: 0 on successful update, error code otherwise
590 static int gfs2_ri_update_special(struct gfs2_inode *ip)
592 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
593 struct inode *inode = &ip->i_inode;
594 struct file_ra_state ra_state;
597 file_ra_state_init(&ra_state, inode->i_mapping);
598 for (sdp->sd_rgrps = 0;; sdp->sd_rgrps++) {
599 /* Ignore partials */
600 if ((sdp->sd_rgrps + 1) * sizeof(struct gfs2_rindex) >
603 error = read_rindex_entry(ip, &ra_state);
610 sdp->sd_rindex_vn = ip->i_gl->gl_vn;
615 * gfs2_rindex_hold - Grab a lock on the rindex
616 * @sdp: The GFS2 superblock
617 * @ri_gh: the glock holder
619 * We grab a lock on the rindex inode to make sure that it doesn't
620 * change whilst we are performing an operation. We keep this lock
621 * for quite long periods of time compared to other locks. This
622 * doesn't matter, since it is shared and it is very, very rarely
623 * accessed in the exclusive mode (i.e. only when expanding the filesystem).
625 * This makes sure that we're using the latest copy of the resource index
626 * special file, which might have been updated if someone expanded the
627 * filesystem (via gfs2_grow utility), which adds new resource groups.
629 * Returns: 0 on success, error code otherwise
632 int gfs2_rindex_hold(struct gfs2_sbd *sdp, struct gfs2_holder *ri_gh)
634 struct gfs2_inode *ip = GFS2_I(sdp->sd_rindex);
635 struct gfs2_glock *gl = ip->i_gl;
638 error = gfs2_glock_nq_init(gl, LM_ST_SHARED, 0, ri_gh);
642 /* Read new copy from disk if we don't have the latest */
643 if (sdp->sd_rindex_vn != gl->gl_vn) {
644 mutex_lock(&sdp->sd_rindex_mutex);
645 if (sdp->sd_rindex_vn != gl->gl_vn) {
646 error = gfs2_ri_update(ip);
648 gfs2_glock_dq_uninit(ri_gh);
650 mutex_unlock(&sdp->sd_rindex_mutex);
656 static void gfs2_rgrp_in(struct gfs2_rgrp_host *rg, const void *buf)
658 const struct gfs2_rgrp *str = buf;
660 rg->rg_flags = be32_to_cpu(str->rg_flags);
661 rg->rg_free = be32_to_cpu(str->rg_free);
662 rg->rg_dinodes = be32_to_cpu(str->rg_dinodes);
663 rg->rg_igeneration = be64_to_cpu(str->rg_igeneration);
666 static void gfs2_rgrp_out(const struct gfs2_rgrp_host *rg, void *buf)
668 struct gfs2_rgrp *str = buf;
670 str->rg_flags = cpu_to_be32(rg->rg_flags);
671 str->rg_free = cpu_to_be32(rg->rg_free);
672 str->rg_dinodes = cpu_to_be32(rg->rg_dinodes);
673 str->__pad = cpu_to_be32(0);
674 str->rg_igeneration = cpu_to_be64(rg->rg_igeneration);
675 memset(&str->rg_reserved, 0, sizeof(str->rg_reserved));
679 * gfs2_rgrp_bh_get - Read in a RG's header and bitmaps
680 * @rgd: the struct gfs2_rgrpd describing the RG to read in
682 * Read in all of a Resource Group's header and bitmap blocks.
683 * Caller must eventually call gfs2_rgrp_relse() to free the bitmaps.
688 int gfs2_rgrp_bh_get(struct gfs2_rgrpd *rgd)
690 struct gfs2_sbd *sdp = rgd->rd_sbd;
691 struct gfs2_glock *gl = rgd->rd_gl;
692 unsigned int length = rgd->rd_length;
693 struct gfs2_bitmap *bi;
697 mutex_lock(&rgd->rd_mutex);
699 spin_lock(&sdp->sd_rindex_spin);
700 if (rgd->rd_bh_count) {
702 spin_unlock(&sdp->sd_rindex_spin);
703 mutex_unlock(&rgd->rd_mutex);
706 spin_unlock(&sdp->sd_rindex_spin);
708 for (x = 0; x < length; x++) {
709 bi = rgd->rd_bits + x;
710 error = gfs2_meta_read(gl, rgd->rd_addr + x, 0, &bi->bi_bh);
715 for (y = length; y--;) {
716 bi = rgd->rd_bits + y;
717 error = gfs2_meta_wait(sdp, bi->bi_bh);
720 if (gfs2_metatype_check(sdp, bi->bi_bh, y ? GFS2_METATYPE_RB :
727 if (rgd->rd_rg_vn != gl->gl_vn) {
728 gfs2_rgrp_in(&rgd->rd_rg, (rgd->rd_bits[0].bi_bh)->b_data);
729 rgd->rd_rg_vn = gl->gl_vn;
732 spin_lock(&sdp->sd_rindex_spin);
733 rgd->rd_free_clone = rgd->rd_rg.rg_free;
735 spin_unlock(&sdp->sd_rindex_spin);
737 mutex_unlock(&rgd->rd_mutex);
743 bi = rgd->rd_bits + x;
746 gfs2_assert_warn(sdp, !bi->bi_clone);
748 mutex_unlock(&rgd->rd_mutex);
753 void gfs2_rgrp_bh_hold(struct gfs2_rgrpd *rgd)
755 struct gfs2_sbd *sdp = rgd->rd_sbd;
757 spin_lock(&sdp->sd_rindex_spin);
758 gfs2_assert_warn(rgd->rd_sbd, rgd->rd_bh_count);
760 spin_unlock(&sdp->sd_rindex_spin);
764 * gfs2_rgrp_bh_put - Release RG bitmaps read in with gfs2_rgrp_bh_get()
765 * @rgd: the struct gfs2_rgrpd describing the RG to read in
769 void gfs2_rgrp_bh_put(struct gfs2_rgrpd *rgd)
771 struct gfs2_sbd *sdp = rgd->rd_sbd;
772 int x, length = rgd->rd_length;
774 spin_lock(&sdp->sd_rindex_spin);
775 gfs2_assert_warn(rgd->rd_sbd, rgd->rd_bh_count);
776 if (--rgd->rd_bh_count) {
777 spin_unlock(&sdp->sd_rindex_spin);
781 for (x = 0; x < length; x++) {
782 struct gfs2_bitmap *bi = rgd->rd_bits + x;
789 spin_unlock(&sdp->sd_rindex_spin);
792 void gfs2_rgrp_repolish_clones(struct gfs2_rgrpd *rgd)
794 struct gfs2_sbd *sdp = rgd->rd_sbd;
795 unsigned int length = rgd->rd_length;
798 for (x = 0; x < length; x++) {
799 struct gfs2_bitmap *bi = rgd->rd_bits + x;
802 memcpy(bi->bi_clone + bi->bi_offset,
803 bi->bi_bh->b_data + bi->bi_offset, bi->bi_len);
806 spin_lock(&sdp->sd_rindex_spin);
807 rgd->rd_free_clone = rgd->rd_rg.rg_free;
808 spin_unlock(&sdp->sd_rindex_spin);
812 * gfs2_alloc_get - get the struct gfs2_alloc structure for an inode
813 * @ip: the incore GFS2 inode structure
815 * Returns: the struct gfs2_alloc
818 struct gfs2_alloc *gfs2_alloc_get(struct gfs2_inode *ip)
820 struct gfs2_alloc *al = &ip->i_alloc;
822 /* FIXME: Should assert that the correct locks are held here... */
823 memset(al, 0, sizeof(*al));
828 * try_rgrp_fit - See if a given reservation will fit in a given RG
830 * @al: the struct gfs2_alloc structure describing the reservation
832 * If there's room for the requested blocks to be allocated from the RG:
833 * Sets the $al_rgd field in @al.
835 * Returns: 1 on success (it fits), 0 on failure (it doesn't fit)
838 static int try_rgrp_fit(struct gfs2_rgrpd *rgd, struct gfs2_alloc *al)
840 struct gfs2_sbd *sdp = rgd->rd_sbd;
843 if (rgd->rd_rg.rg_flags & GFS2_RGF_NOALLOC)
846 spin_lock(&sdp->sd_rindex_spin);
847 if (rgd->rd_free_clone >= al->al_requested) {
851 spin_unlock(&sdp->sd_rindex_spin);
857 * try_rgrp_unlink - Look for any unlinked, allocated, but unused inodes
860 * Returns: The inode, if one has been found
863 static struct inode *try_rgrp_unlink(struct gfs2_rgrpd *rgd, u64 *last_unlinked)
870 if (goal >= rgd->rd_data)
872 block = rgblk_search(rgd, goal, GFS2_BLKST_UNLINKED,
873 GFS2_BLKST_UNLINKED);
874 if (block == BFITNOENT)
876 /* rgblk_search can return a block < goal, so we need to
877 keep it marching forward. */
878 no_addr = block + rgd->rd_data0;
880 if (*last_unlinked != NO_BLOCK && no_addr <= *last_unlinked)
882 *last_unlinked = no_addr;
883 inode = gfs2_inode_lookup(rgd->rd_sbd->sd_vfs, DT_UNKNOWN,
889 rgd->rd_flags &= ~GFS2_RDF_CHECK;
894 * recent_rgrp_first - get first RG from "recent" list
895 * @sdp: The GFS2 superblock
896 * @rglast: address of the rgrp used last
898 * Returns: The first rgrp in the recent list
901 static struct gfs2_rgrpd *recent_rgrp_first(struct gfs2_sbd *sdp,
904 struct gfs2_rgrpd *rgd = NULL;
906 spin_lock(&sdp->sd_rindex_spin);
908 if (list_empty(&sdp->sd_rindex_recent_list))
914 list_for_each_entry(rgd, &sdp->sd_rindex_recent_list, rd_recent) {
915 if (rgd->rd_addr == rglast)
920 rgd = list_entry(sdp->sd_rindex_recent_list.next, struct gfs2_rgrpd,
923 spin_unlock(&sdp->sd_rindex_spin);
928 * recent_rgrp_next - get next RG from "recent" list
929 * @cur_rgd: current rgrp
932 * Returns: The next rgrp in the recent list
935 static struct gfs2_rgrpd *recent_rgrp_next(struct gfs2_rgrpd *cur_rgd,
938 struct gfs2_sbd *sdp = cur_rgd->rd_sbd;
939 struct list_head *head;
940 struct gfs2_rgrpd *rgd;
942 spin_lock(&sdp->sd_rindex_spin);
944 head = &sdp->sd_rindex_recent_list;
946 list_for_each_entry(rgd, head, rd_recent) {
947 if (rgd == cur_rgd) {
948 if (cur_rgd->rd_recent.next != head)
949 rgd = list_entry(cur_rgd->rd_recent.next,
950 struct gfs2_rgrpd, rd_recent);
955 list_del(&cur_rgd->rd_recent);
962 if (!list_empty(head))
963 rgd = list_entry(head->next, struct gfs2_rgrpd, rd_recent);
966 spin_unlock(&sdp->sd_rindex_spin);
971 * recent_rgrp_add - add an RG to tail of "recent" list
972 * @new_rgd: The rgrp to add
976 static void recent_rgrp_add(struct gfs2_rgrpd *new_rgd)
978 struct gfs2_sbd *sdp = new_rgd->rd_sbd;
979 struct gfs2_rgrpd *rgd;
980 unsigned int count = 0;
981 unsigned int max = sdp->sd_rgrps / gfs2_jindex_size(sdp);
983 spin_lock(&sdp->sd_rindex_spin);
985 list_for_each_entry(rgd, &sdp->sd_rindex_recent_list, rd_recent) {
992 list_add_tail(&new_rgd->rd_recent, &sdp->sd_rindex_recent_list);
995 spin_unlock(&sdp->sd_rindex_spin);
999 * forward_rgrp_get - get an rgrp to try next from full list
1000 * @sdp: The GFS2 superblock
1002 * Returns: The rgrp to try next
1005 static struct gfs2_rgrpd *forward_rgrp_get(struct gfs2_sbd *sdp)
1007 struct gfs2_rgrpd *rgd;
1008 unsigned int journals = gfs2_jindex_size(sdp);
1009 unsigned int rg = 0, x;
1011 spin_lock(&sdp->sd_rindex_spin);
1013 rgd = sdp->sd_rindex_forward;
1015 if (sdp->sd_rgrps >= journals)
1016 rg = sdp->sd_rgrps * sdp->sd_jdesc->jd_jid / journals;
1018 for (x = 0, rgd = gfs2_rgrpd_get_first(sdp); x < rg;
1019 x++, rgd = gfs2_rgrpd_get_next(rgd))
1022 sdp->sd_rindex_forward = rgd;
1025 spin_unlock(&sdp->sd_rindex_spin);
1031 * forward_rgrp_set - set the forward rgrp pointer
1032 * @sdp: the filesystem
1033 * @rgd: The new forward rgrp
1037 static void forward_rgrp_set(struct gfs2_sbd *sdp, struct gfs2_rgrpd *rgd)
1039 spin_lock(&sdp->sd_rindex_spin);
1040 sdp->sd_rindex_forward = rgd;
1041 spin_unlock(&sdp->sd_rindex_spin);
1045 * get_local_rgrp - Choose and lock a rgrp for allocation
1046 * @ip: the inode to reserve space for
1047 * @rgp: the chosen and locked rgrp
1049 * Try to acquire rgrp in way which avoids contending with others.
1054 static struct inode *get_local_rgrp(struct gfs2_inode *ip, u64 *last_unlinked)
1056 struct inode *inode = NULL;
1057 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1058 struct gfs2_rgrpd *rgd, *begin = NULL;
1059 struct gfs2_alloc *al = &ip->i_alloc;
1060 int flags = LM_FLAG_TRY;
1065 /* Try recently successful rgrps */
1067 rgd = recent_rgrp_first(sdp, ip->i_last_rg_alloc);
1070 error = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_EXCLUSIVE,
1071 LM_FLAG_TRY, &al->al_rgd_gh);
1074 if (try_rgrp_fit(rgd, al))
1076 if (rgd->rd_flags & GFS2_RDF_CHECK)
1077 inode = try_rgrp_unlink(rgd, last_unlinked);
1078 gfs2_glock_dq_uninit(&al->al_rgd_gh);
1081 rgd = recent_rgrp_next(rgd, 1);
1085 rgd = recent_rgrp_next(rgd, 0);
1089 return ERR_PTR(error);
1093 /* Go through full list of rgrps */
1095 begin = rgd = forward_rgrp_get(sdp);
1098 error = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_EXCLUSIVE, flags,
1102 if (try_rgrp_fit(rgd, al))
1104 if (rgd->rd_flags & GFS2_RDF_CHECK)
1105 inode = try_rgrp_unlink(rgd, last_unlinked);
1106 gfs2_glock_dq_uninit(&al->al_rgd_gh);
1116 return ERR_PTR(error);
1119 rgd = gfs2_rgrpd_get_next(rgd);
1121 rgd = gfs2_rgrpd_get_first(sdp);
1125 return ERR_PTR(-ENOSPC);
1130 gfs2_log_flush(sdp, NULL);
1135 ip->i_last_rg_alloc = rgd->rd_addr;
1138 recent_rgrp_add(rgd);
1139 rgd = gfs2_rgrpd_get_next(rgd);
1141 rgd = gfs2_rgrpd_get_first(sdp);
1142 forward_rgrp_set(sdp, rgd);
1149 * gfs2_inplace_reserve_i - Reserve space in the filesystem
1150 * @ip: the inode to reserve space for
1155 int gfs2_inplace_reserve_i(struct gfs2_inode *ip, char *file, unsigned int line)
1157 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1158 struct gfs2_alloc *al = &ip->i_alloc;
1159 struct inode *inode;
1161 u64 last_unlinked = NO_BLOCK;
1163 if (gfs2_assert_warn(sdp, al->al_requested))
1167 /* We need to hold the rindex unless the inode we're using is
1168 the rindex itself, in which case it's already held. */
1169 if (ip != GFS2_I(sdp->sd_rindex))
1170 error = gfs2_rindex_hold(sdp, &al->al_ri_gh);
1171 else if (!sdp->sd_rgrps) /* We may not have the rindex read in, so: */
1172 error = gfs2_ri_update_special(ip);
1177 inode = get_local_rgrp(ip, &last_unlinked);
1179 if (ip != GFS2_I(sdp->sd_rindex))
1180 gfs2_glock_dq_uninit(&al->al_ri_gh);
1182 return PTR_ERR(inode);
1184 gfs2_log_flush(sdp, NULL);
1195 * gfs2_inplace_release - release an inplace reservation
1196 * @ip: the inode the reservation was taken out on
1198 * Release a reservation made by gfs2_inplace_reserve().
1201 void gfs2_inplace_release(struct gfs2_inode *ip)
1203 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1204 struct gfs2_alloc *al = &ip->i_alloc;
1206 if (gfs2_assert_warn(sdp, al->al_alloced <= al->al_requested) == -1)
1207 fs_warn(sdp, "al_alloced = %u, al_requested = %u "
1208 "al_file = %s, al_line = %u\n",
1209 al->al_alloced, al->al_requested, al->al_file,
1213 gfs2_glock_dq_uninit(&al->al_rgd_gh);
1214 if (ip != GFS2_I(sdp->sd_rindex))
1215 gfs2_glock_dq_uninit(&al->al_ri_gh);
1219 * gfs2_get_block_type - Check a block in a RG is of given type
1220 * @rgd: the resource group holding the block
1221 * @block: the block number
1223 * Returns: The block type (GFS2_BLKST_*)
1226 unsigned char gfs2_get_block_type(struct gfs2_rgrpd *rgd, u64 block)
1228 struct gfs2_bitmap *bi = NULL;
1229 u32 length, rgrp_block, buf_block;
1233 length = rgd->rd_length;
1234 rgrp_block = block - rgd->rd_data0;
1236 for (buf = 0; buf < length; buf++) {
1237 bi = rgd->rd_bits + buf;
1238 if (rgrp_block < (bi->bi_start + bi->bi_len) * GFS2_NBBY)
1242 gfs2_assert(rgd->rd_sbd, buf < length);
1243 buf_block = rgrp_block - bi->bi_start * GFS2_NBBY;
1245 type = gfs2_testbit(rgd, bi->bi_bh->b_data + bi->bi_offset,
1246 bi->bi_len, buf_block);
1252 * rgblk_search - find a block in @old_state, change allocation
1253 * state to @new_state
1254 * @rgd: the resource group descriptor
1255 * @goal: the goal block within the RG (start here to search for avail block)
1256 * @old_state: GFS2_BLKST_XXX the before-allocation state to find
1257 * @new_state: GFS2_BLKST_XXX the after-allocation block state
1259 * Walk rgrp's bitmap to find bits that represent a block in @old_state.
1260 * Add the found bitmap buffer to the transaction.
1261 * Set the found bits to @new_state to change block's allocation state.
1263 * This function never fails, because we wouldn't call it unless we
1264 * know (from reservation results, etc.) that a block is available.
1266 * Scope of @goal and returned block is just within rgrp, not the whole
1269 * Returns: the block number allocated
1272 static u32 rgblk_search(struct gfs2_rgrpd *rgd, u32 goal,
1273 unsigned char old_state, unsigned char new_state)
1275 struct gfs2_bitmap *bi = NULL;
1276 u32 length = rgd->rd_length;
1278 unsigned int buf, x;
1280 /* Find bitmap block that contains bits for goal block */
1281 for (buf = 0; buf < length; buf++) {
1282 bi = rgd->rd_bits + buf;
1283 if (goal < (bi->bi_start + bi->bi_len) * GFS2_NBBY)
1287 gfs2_assert(rgd->rd_sbd, buf < length);
1289 /* Convert scope of "goal" from rgrp-wide to within found bit block */
1290 goal -= bi->bi_start * GFS2_NBBY;
1292 /* Search (up to entire) bitmap in this rgrp for allocatable block.
1293 "x <= length", instead of "x < length", because we typically start
1294 the search in the middle of a bit block, but if we can't find an
1295 allocatable block anywhere else, we want to be able wrap around and
1296 search in the first part of our first-searched bit block. */
1297 for (x = 0; x <= length; x++) {
1299 blk = gfs2_bitfit(rgd, bi->bi_clone + bi->bi_offset,
1300 bi->bi_len, goal, old_state);
1302 blk = gfs2_bitfit(rgd,
1303 bi->bi_bh->b_data + bi->bi_offset,
1304 bi->bi_len, goal, old_state);
1305 if (blk != BFITNOENT)
1308 /* Try next bitmap block (wrap back to rgrp header if at end) */
1309 buf = (buf + 1) % length;
1310 bi = rgd->rd_bits + buf;
1314 if (blk != BFITNOENT && old_state != new_state) {
1315 gfs2_trans_add_bh(rgd->rd_gl, bi->bi_bh, 1);
1316 gfs2_setbit(rgd, bi->bi_bh->b_data + bi->bi_offset,
1317 bi->bi_len, blk, new_state);
1319 gfs2_setbit(rgd, bi->bi_clone + bi->bi_offset,
1320 bi->bi_len, blk, new_state);
1323 return (blk == BFITNOENT) ? blk : (bi->bi_start * GFS2_NBBY) + blk;
1327 * rgblk_free - Change alloc state of given block(s)
1328 * @sdp: the filesystem
1329 * @bstart: the start of a run of blocks to free
1330 * @blen: the length of the block run (all must lie within ONE RG!)
1331 * @new_state: GFS2_BLKST_XXX the after-allocation block state
1333 * Returns: Resource group containing the block(s)
1336 static struct gfs2_rgrpd *rgblk_free(struct gfs2_sbd *sdp, u64 bstart,
1337 u32 blen, unsigned char new_state)
1339 struct gfs2_rgrpd *rgd;
1340 struct gfs2_bitmap *bi = NULL;
1341 u32 length, rgrp_blk, buf_blk;
1344 rgd = gfs2_blk2rgrpd(sdp, bstart);
1346 if (gfs2_consist(sdp))
1347 fs_err(sdp, "block = %llu\n", (unsigned long long)bstart);
1351 length = rgd->rd_length;
1353 rgrp_blk = bstart - rgd->rd_data0;
1356 for (buf = 0; buf < length; buf++) {
1357 bi = rgd->rd_bits + buf;
1358 if (rgrp_blk < (bi->bi_start + bi->bi_len) * GFS2_NBBY)
1362 gfs2_assert(rgd->rd_sbd, buf < length);
1364 buf_blk = rgrp_blk - bi->bi_start * GFS2_NBBY;
1367 if (!bi->bi_clone) {
1368 bi->bi_clone = kmalloc(bi->bi_bh->b_size,
1369 GFP_NOFS | __GFP_NOFAIL);
1370 memcpy(bi->bi_clone + bi->bi_offset,
1371 bi->bi_bh->b_data + bi->bi_offset,
1374 gfs2_trans_add_bh(rgd->rd_gl, bi->bi_bh, 1);
1375 gfs2_setbit(rgd, bi->bi_bh->b_data + bi->bi_offset,
1376 bi->bi_len, buf_blk, new_state);
1383 * gfs2_alloc_data - Allocate a data block
1384 * @ip: the inode to allocate the data block for
1386 * Returns: the allocated block
1389 u64 gfs2_alloc_data(struct gfs2_inode *ip)
1391 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1392 struct gfs2_alloc *al = &ip->i_alloc;
1393 struct gfs2_rgrpd *rgd = al->al_rgd;
1397 if (rgrp_contains_block(rgd, ip->i_di.di_goal_data))
1398 goal = ip->i_di.di_goal_data - rgd->rd_data0;
1400 goal = rgd->rd_last_alloc_data;
1402 blk = rgblk_search(rgd, goal, GFS2_BLKST_FREE, GFS2_BLKST_USED);
1403 BUG_ON(blk == BFITNOENT);
1404 rgd->rd_last_alloc_data = blk;
1406 block = rgd->rd_data0 + blk;
1407 ip->i_di.di_goal_data = block;
1409 gfs2_assert_withdraw(sdp, rgd->rd_rg.rg_free);
1410 rgd->rd_rg.rg_free--;
1412 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1413 gfs2_rgrp_out(&rgd->rd_rg, rgd->rd_bits[0].bi_bh->b_data);
1417 gfs2_statfs_change(sdp, 0, -1, 0);
1418 gfs2_quota_change(ip, +1, ip->i_inode.i_uid, ip->i_inode.i_gid);
1420 spin_lock(&sdp->sd_rindex_spin);
1421 rgd->rd_free_clone--;
1422 spin_unlock(&sdp->sd_rindex_spin);
1428 * gfs2_alloc_meta - Allocate a metadata block
1429 * @ip: the inode to allocate the metadata block for
1431 * Returns: the allocated block
1434 u64 gfs2_alloc_meta(struct gfs2_inode *ip)
1436 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1437 struct gfs2_alloc *al = &ip->i_alloc;
1438 struct gfs2_rgrpd *rgd = al->al_rgd;
1442 if (rgrp_contains_block(rgd, ip->i_di.di_goal_meta))
1443 goal = ip->i_di.di_goal_meta - rgd->rd_data0;
1445 goal = rgd->rd_last_alloc_meta;
1447 blk = rgblk_search(rgd, goal, GFS2_BLKST_FREE, GFS2_BLKST_USED);
1448 BUG_ON(blk == BFITNOENT);
1449 rgd->rd_last_alloc_meta = blk;
1451 block = rgd->rd_data0 + blk;
1452 ip->i_di.di_goal_meta = block;
1454 gfs2_assert_withdraw(sdp, rgd->rd_rg.rg_free);
1455 rgd->rd_rg.rg_free--;
1457 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1458 gfs2_rgrp_out(&rgd->rd_rg, rgd->rd_bits[0].bi_bh->b_data);
1462 gfs2_statfs_change(sdp, 0, -1, 0);
1463 gfs2_quota_change(ip, +1, ip->i_inode.i_uid, ip->i_inode.i_gid);
1464 gfs2_trans_add_unrevoke(sdp, block);
1466 spin_lock(&sdp->sd_rindex_spin);
1467 rgd->rd_free_clone--;
1468 spin_unlock(&sdp->sd_rindex_spin);
1474 * gfs2_alloc_di - Allocate a dinode
1475 * @dip: the directory that the inode is going in
1477 * Returns: the block allocated
1480 u64 gfs2_alloc_di(struct gfs2_inode *dip, u64 *generation)
1482 struct gfs2_sbd *sdp = GFS2_SB(&dip->i_inode);
1483 struct gfs2_alloc *al = &dip->i_alloc;
1484 struct gfs2_rgrpd *rgd = al->al_rgd;
1488 blk = rgblk_search(rgd, rgd->rd_last_alloc_meta,
1489 GFS2_BLKST_FREE, GFS2_BLKST_DINODE);
1490 BUG_ON(blk == BFITNOENT);
1492 rgd->rd_last_alloc_meta = blk;
1494 block = rgd->rd_data0 + blk;
1496 gfs2_assert_withdraw(sdp, rgd->rd_rg.rg_free);
1497 rgd->rd_rg.rg_free--;
1498 rgd->rd_rg.rg_dinodes++;
1499 *generation = rgd->rd_rg.rg_igeneration++;
1500 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1501 gfs2_rgrp_out(&rgd->rd_rg, rgd->rd_bits[0].bi_bh->b_data);
1505 gfs2_statfs_change(sdp, 0, -1, +1);
1506 gfs2_trans_add_unrevoke(sdp, block);
1508 spin_lock(&sdp->sd_rindex_spin);
1509 rgd->rd_free_clone--;
1510 spin_unlock(&sdp->sd_rindex_spin);
1516 * gfs2_free_data - free a contiguous run of data block(s)
1517 * @ip: the inode these blocks are being freed from
1518 * @bstart: first block of a run of contiguous blocks
1519 * @blen: the length of the block run
1523 void gfs2_free_data(struct gfs2_inode *ip, u64 bstart, u32 blen)
1525 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1526 struct gfs2_rgrpd *rgd;
1528 rgd = rgblk_free(sdp, bstart, blen, GFS2_BLKST_FREE);
1532 rgd->rd_rg.rg_free += blen;
1534 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1535 gfs2_rgrp_out(&rgd->rd_rg, rgd->rd_bits[0].bi_bh->b_data);
1537 gfs2_trans_add_rg(rgd);
1539 gfs2_statfs_change(sdp, 0, +blen, 0);
1540 gfs2_quota_change(ip, -(s64)blen, ip->i_inode.i_uid, ip->i_inode.i_gid);
1544 * gfs2_free_meta - free a contiguous run of data block(s)
1545 * @ip: the inode these blocks are being freed from
1546 * @bstart: first block of a run of contiguous blocks
1547 * @blen: the length of the block run
1551 void gfs2_free_meta(struct gfs2_inode *ip, u64 bstart, u32 blen)
1553 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1554 struct gfs2_rgrpd *rgd;
1556 rgd = rgblk_free(sdp, bstart, blen, GFS2_BLKST_FREE);
1560 rgd->rd_rg.rg_free += blen;
1562 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1563 gfs2_rgrp_out(&rgd->rd_rg, rgd->rd_bits[0].bi_bh->b_data);
1565 gfs2_trans_add_rg(rgd);
1567 gfs2_statfs_change(sdp, 0, +blen, 0);
1568 gfs2_quota_change(ip, -(s64)blen, ip->i_inode.i_uid, ip->i_inode.i_gid);
1569 gfs2_meta_wipe(ip, bstart, blen);
1572 void gfs2_unlink_di(struct inode *inode)
1574 struct gfs2_inode *ip = GFS2_I(inode);
1575 struct gfs2_sbd *sdp = GFS2_SB(inode);
1576 struct gfs2_rgrpd *rgd;
1577 u64 blkno = ip->i_no_addr;
1579 rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_UNLINKED);
1582 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1583 gfs2_rgrp_out(&rgd->rd_rg, rgd->rd_bits[0].bi_bh->b_data);
1584 gfs2_trans_add_rg(rgd);
1587 static void gfs2_free_uninit_di(struct gfs2_rgrpd *rgd, u64 blkno)
1589 struct gfs2_sbd *sdp = rgd->rd_sbd;
1590 struct gfs2_rgrpd *tmp_rgd;
1592 tmp_rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_FREE);
1595 gfs2_assert_withdraw(sdp, rgd == tmp_rgd);
1597 if (!rgd->rd_rg.rg_dinodes)
1598 gfs2_consist_rgrpd(rgd);
1599 rgd->rd_rg.rg_dinodes--;
1600 rgd->rd_rg.rg_free++;
1602 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1603 gfs2_rgrp_out(&rgd->rd_rg, rgd->rd_bits[0].bi_bh->b_data);
1605 gfs2_statfs_change(sdp, 0, +1, -1);
1606 gfs2_trans_add_rg(rgd);
1610 void gfs2_free_di(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip)
1612 gfs2_free_uninit_di(rgd, ip->i_no_addr);
1613 gfs2_quota_change(ip, -1, ip->i_inode.i_uid, ip->i_inode.i_gid);
1614 gfs2_meta_wipe(ip, ip->i_no_addr, 1);
1618 * gfs2_rlist_add - add a RG to a list of RGs
1619 * @sdp: the filesystem
1620 * @rlist: the list of resource groups
1623 * Figure out what RG a block belongs to and add that RG to the list
1625 * FIXME: Don't use NOFAIL
1629 void gfs2_rlist_add(struct gfs2_sbd *sdp, struct gfs2_rgrp_list *rlist,
1632 struct gfs2_rgrpd *rgd;
1633 struct gfs2_rgrpd **tmp;
1634 unsigned int new_space;
1637 if (gfs2_assert_warn(sdp, !rlist->rl_ghs))
1640 rgd = gfs2_blk2rgrpd(sdp, block);
1642 if (gfs2_consist(sdp))
1643 fs_err(sdp, "block = %llu\n", (unsigned long long)block);
1647 for (x = 0; x < rlist->rl_rgrps; x++)
1648 if (rlist->rl_rgd[x] == rgd)
1651 if (rlist->rl_rgrps == rlist->rl_space) {
1652 new_space = rlist->rl_space + 10;
1654 tmp = kcalloc(new_space, sizeof(struct gfs2_rgrpd *),
1655 GFP_NOFS | __GFP_NOFAIL);
1657 if (rlist->rl_rgd) {
1658 memcpy(tmp, rlist->rl_rgd,
1659 rlist->rl_space * sizeof(struct gfs2_rgrpd *));
1660 kfree(rlist->rl_rgd);
1663 rlist->rl_space = new_space;
1664 rlist->rl_rgd = tmp;
1667 rlist->rl_rgd[rlist->rl_rgrps++] = rgd;
1671 * gfs2_rlist_alloc - all RGs have been added to the rlist, now allocate
1672 * and initialize an array of glock holders for them
1673 * @rlist: the list of resource groups
1674 * @state: the lock state to acquire the RG lock in
1675 * @flags: the modifier flags for the holder structures
1677 * FIXME: Don't use NOFAIL
1681 void gfs2_rlist_alloc(struct gfs2_rgrp_list *rlist, unsigned int state,
1686 rlist->rl_ghs = kcalloc(rlist->rl_rgrps, sizeof(struct gfs2_holder),
1687 GFP_NOFS | __GFP_NOFAIL);
1688 for (x = 0; x < rlist->rl_rgrps; x++)
1689 gfs2_holder_init(rlist->rl_rgd[x]->rd_gl,
1695 * gfs2_rlist_free - free a resource group list
1696 * @list: the list of resource groups
1700 void gfs2_rlist_free(struct gfs2_rgrp_list *rlist)
1704 kfree(rlist->rl_rgd);
1706 if (rlist->rl_ghs) {
1707 for (x = 0; x < rlist->rl_rgrps; x++)
1708 gfs2_holder_uninit(&rlist->rl_ghs[x]);
1709 kfree(rlist->rl_ghs);