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/lm_interface.h>
31 #include "ops_address.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(unsigned char *buffer, unsigned int buflen, u32 goal,
130 unsigned char old_state)
134 unsigned int bit, bitlong;
135 unsigned long *plong, plong55;
137 byte = buffer + (goal / GFS2_NBBY);
138 plong = (unsigned long *)(buffer + (goal / GFS2_NBBY));
139 bit = (goal % GFS2_NBBY) * GFS2_BIT_SIZE;
141 #if BITS_PER_LONG == 32
142 plong55 = 0x55555555;
144 plong55 = 0x5555555555555555;
146 while (byte < buffer + buflen) {
148 if (bitlong == 0 && old_state == 0 && *plong == plong55) {
150 byte += sizeof(unsigned long);
151 blk += sizeof(unsigned long) * GFS2_NBBY;
154 if (((*byte >> bit) & GFS2_BIT_MASK) == old_state)
156 bit += GFS2_BIT_SIZE;
161 bitlong += GFS2_BIT_SIZE;
162 if (bitlong >= sizeof(unsigned long) * 8) {
174 * gfs2_bitcount - count the number of bits in a certain state
175 * @buffer: the buffer that holds the bitmaps
176 * @buflen: the length (in bytes) of the buffer
177 * @state: the state of the block we're looking for
179 * Returns: The number of bits
182 static u32 gfs2_bitcount(struct gfs2_rgrpd *rgd, unsigned char *buffer,
183 unsigned int buflen, unsigned char state)
185 unsigned char *byte = buffer;
186 unsigned char *end = buffer + buflen;
187 unsigned char state1 = state << 2;
188 unsigned char state2 = state << 4;
189 unsigned char state3 = state << 6;
192 for (; byte < end; byte++) {
193 if (((*byte) & 0x03) == state)
195 if (((*byte) & 0x0C) == state1)
197 if (((*byte) & 0x30) == state2)
199 if (((*byte) & 0xC0) == state3)
207 * gfs2_rgrp_verify - Verify that a resource group is consistent
208 * @sdp: the filesystem
213 void gfs2_rgrp_verify(struct gfs2_rgrpd *rgd)
215 struct gfs2_sbd *sdp = rgd->rd_sbd;
216 struct gfs2_bitmap *bi = NULL;
217 u32 length = rgd->rd_length;
221 memset(count, 0, 4 * sizeof(u32));
223 /* Count # blocks in each of 4 possible allocation states */
224 for (buf = 0; buf < length; buf++) {
225 bi = rgd->rd_bits + buf;
226 for (x = 0; x < 4; x++)
227 count[x] += gfs2_bitcount(rgd,
233 if (count[0] != rgd->rd_rg.rg_free) {
234 if (gfs2_consist_rgrpd(rgd))
235 fs_err(sdp, "free data mismatch: %u != %u\n",
236 count[0], rgd->rd_rg.rg_free);
242 rgd->rd_rg.rg_dinodes;
243 if (count[1] + count[2] != tmp) {
244 if (gfs2_consist_rgrpd(rgd))
245 fs_err(sdp, "used data mismatch: %u != %u\n",
250 if (count[3] != rgd->rd_rg.rg_dinodes) {
251 if (gfs2_consist_rgrpd(rgd))
252 fs_err(sdp, "used metadata mismatch: %u != %u\n",
253 count[3], rgd->rd_rg.rg_dinodes);
257 if (count[2] > count[3]) {
258 if (gfs2_consist_rgrpd(rgd))
259 fs_err(sdp, "unlinked inodes > inodes: %u\n",
266 static inline int rgrp_contains_block(struct gfs2_rgrpd *rgd, u64 block)
268 u64 first = rgd->rd_data0;
269 u64 last = first + rgd->rd_data;
270 return first <= block && block < last;
274 * gfs2_blk2rgrpd - Find resource group for a given data/meta block number
275 * @sdp: The GFS2 superblock
276 * @n: The data block number
278 * Returns: The resource group, or NULL if not found
281 struct gfs2_rgrpd *gfs2_blk2rgrpd(struct gfs2_sbd *sdp, u64 blk)
283 struct gfs2_rgrpd *rgd;
285 spin_lock(&sdp->sd_rindex_spin);
287 list_for_each_entry(rgd, &sdp->sd_rindex_mru_list, rd_list_mru) {
288 if (rgrp_contains_block(rgd, blk)) {
289 list_move(&rgd->rd_list_mru, &sdp->sd_rindex_mru_list);
290 spin_unlock(&sdp->sd_rindex_spin);
295 spin_unlock(&sdp->sd_rindex_spin);
301 * gfs2_rgrpd_get_first - get the first Resource Group in the filesystem
302 * @sdp: The GFS2 superblock
304 * Returns: The first rgrp in the filesystem
307 struct gfs2_rgrpd *gfs2_rgrpd_get_first(struct gfs2_sbd *sdp)
309 gfs2_assert(sdp, !list_empty(&sdp->sd_rindex_list));
310 return list_entry(sdp->sd_rindex_list.next, struct gfs2_rgrpd, rd_list);
314 * gfs2_rgrpd_get_next - get the next RG
317 * Returns: The next rgrp
320 struct gfs2_rgrpd *gfs2_rgrpd_get_next(struct gfs2_rgrpd *rgd)
322 if (rgd->rd_list.next == &rgd->rd_sbd->sd_rindex_list)
324 return list_entry(rgd->rd_list.next, struct gfs2_rgrpd, rd_list);
327 static void clear_rgrpdi(struct gfs2_sbd *sdp)
329 struct list_head *head;
330 struct gfs2_rgrpd *rgd;
331 struct gfs2_glock *gl;
333 spin_lock(&sdp->sd_rindex_spin);
334 sdp->sd_rindex_forward = NULL;
335 head = &sdp->sd_rindex_recent_list;
336 while (!list_empty(head)) {
337 rgd = list_entry(head->next, struct gfs2_rgrpd, rd_recent);
338 list_del(&rgd->rd_recent);
340 spin_unlock(&sdp->sd_rindex_spin);
342 head = &sdp->sd_rindex_list;
343 while (!list_empty(head)) {
344 rgd = list_entry(head->next, struct gfs2_rgrpd, rd_list);
347 list_del(&rgd->rd_list);
348 list_del(&rgd->rd_list_mru);
351 gl->gl_object = NULL;
356 kmem_cache_free(gfs2_rgrpd_cachep, rgd);
360 void gfs2_clear_rgrpd(struct gfs2_sbd *sdp)
362 mutex_lock(&sdp->sd_rindex_mutex);
364 mutex_unlock(&sdp->sd_rindex_mutex);
367 static void gfs2_rindex_print(const struct gfs2_rgrpd *rgd)
369 printk(KERN_INFO " ri_addr = %llu\n", (unsigned long long)rgd->rd_addr);
370 printk(KERN_INFO " ri_length = %u\n", rgd->rd_length);
371 printk(KERN_INFO " ri_data0 = %llu\n", (unsigned long long)rgd->rd_data0);
372 printk(KERN_INFO " ri_data = %u\n", rgd->rd_data);
373 printk(KERN_INFO " ri_bitbytes = %u\n", rgd->rd_bitbytes);
377 * gfs2_compute_bitstructs - Compute the bitmap sizes
378 * @rgd: The resource group descriptor
380 * Calculates bitmap descriptors, one for each block that contains bitmap data
385 static int compute_bitstructs(struct gfs2_rgrpd *rgd)
387 struct gfs2_sbd *sdp = rgd->rd_sbd;
388 struct gfs2_bitmap *bi;
389 u32 length = rgd->rd_length; /* # blocks in hdr & bitmap */
390 u32 bytes_left, bytes;
396 rgd->rd_bits = kcalloc(length, sizeof(struct gfs2_bitmap), GFP_NOFS);
400 bytes_left = rgd->rd_bitbytes;
402 for (x = 0; x < length; x++) {
403 bi = rgd->rd_bits + x;
405 /* small rgrp; bitmap stored completely in header block */
408 bi->bi_offset = sizeof(struct gfs2_rgrp);
413 bytes = sdp->sd_sb.sb_bsize - sizeof(struct gfs2_rgrp);
414 bi->bi_offset = sizeof(struct gfs2_rgrp);
418 } else if (x + 1 == length) {
420 bi->bi_offset = sizeof(struct gfs2_meta_header);
421 bi->bi_start = rgd->rd_bitbytes - bytes_left;
425 bytes = sdp->sd_sb.sb_bsize -
426 sizeof(struct gfs2_meta_header);
427 bi->bi_offset = sizeof(struct gfs2_meta_header);
428 bi->bi_start = rgd->rd_bitbytes - bytes_left;
436 gfs2_consist_rgrpd(rgd);
439 bi = rgd->rd_bits + (length - 1);
440 if ((bi->bi_start + bi->bi_len) * GFS2_NBBY != rgd->rd_data) {
441 if (gfs2_consist_rgrpd(rgd)) {
442 gfs2_rindex_print(rgd);
443 fs_err(sdp, "start=%u len=%u offset=%u\n",
444 bi->bi_start, bi->bi_len, bi->bi_offset);
453 * gfs2_ri_total - Total up the file system space, according to the rindex.
456 u64 gfs2_ri_total(struct gfs2_sbd *sdp)
459 struct inode *inode = sdp->sd_rindex;
460 struct gfs2_inode *ip = GFS2_I(inode);
461 char buf[sizeof(struct gfs2_rindex)];
462 struct file_ra_state ra_state;
465 mutex_lock(&sdp->sd_rindex_mutex);
466 file_ra_state_init(&ra_state, inode->i_mapping);
467 for (rgrps = 0;; rgrps++) {
468 loff_t pos = rgrps * sizeof(struct gfs2_rindex);
470 if (pos + sizeof(struct gfs2_rindex) >= ip->i_di.di_size)
472 error = gfs2_internal_read(ip, &ra_state, buf, &pos,
473 sizeof(struct gfs2_rindex));
474 if (error != sizeof(struct gfs2_rindex))
476 total_data += be32_to_cpu(((struct gfs2_rindex *)buf)->ri_data);
478 mutex_unlock(&sdp->sd_rindex_mutex);
482 static void gfs2_rindex_in(struct gfs2_rgrpd *rgd, const void *buf)
484 const struct gfs2_rindex *str = buf;
486 rgd->rd_addr = be64_to_cpu(str->ri_addr);
487 rgd->rd_length = be32_to_cpu(str->ri_length);
488 rgd->rd_data0 = be64_to_cpu(str->ri_data0);
489 rgd->rd_data = be32_to_cpu(str->ri_data);
490 rgd->rd_bitbytes = be32_to_cpu(str->ri_bitbytes);
494 * read_rindex_entry - Pull in a new resource index entry from the disk
495 * @gl: The glock covering the rindex inode
497 * Returns: 0 on success, error code otherwise
500 static int read_rindex_entry(struct gfs2_inode *ip,
501 struct file_ra_state *ra_state)
503 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
504 loff_t pos = sdp->sd_rgrps * sizeof(struct gfs2_rindex);
505 char buf[sizeof(struct gfs2_rindex)];
507 struct gfs2_rgrpd *rgd;
509 error = gfs2_internal_read(ip, ra_state, buf, &pos,
510 sizeof(struct gfs2_rindex));
513 if (error != sizeof(struct gfs2_rindex)) {
519 rgd = kmem_cache_zalloc(gfs2_rgrpd_cachep, GFP_NOFS);
524 mutex_init(&rgd->rd_mutex);
525 lops_init_le(&rgd->rd_le, &gfs2_rg_lops);
528 list_add_tail(&rgd->rd_list, &sdp->sd_rindex_list);
529 list_add_tail(&rgd->rd_list_mru, &sdp->sd_rindex_mru_list);
531 gfs2_rindex_in(rgd, buf);
532 error = compute_bitstructs(rgd);
536 error = gfs2_glock_get(sdp, rgd->rd_addr,
537 &gfs2_rgrp_glops, CREATE, &rgd->rd_gl);
541 rgd->rd_gl->gl_object = rgd;
542 rgd->rd_rg_vn = rgd->rd_gl->gl_vn - 1;
543 rgd->rd_flags |= GFS2_RDF_CHECK;
548 * gfs2_ri_update - Pull in a new resource index from the disk
549 * @ip: pointer to the rindex inode
551 * Returns: 0 on successful update, error code otherwise
554 static int gfs2_ri_update(struct gfs2_inode *ip)
556 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
557 struct inode *inode = &ip->i_inode;
558 struct file_ra_state ra_state;
559 u64 rgrp_count = ip->i_di.di_size;
562 if (do_div(rgrp_count, sizeof(struct gfs2_rindex))) {
563 gfs2_consist_inode(ip);
569 file_ra_state_init(&ra_state, inode->i_mapping);
570 for (sdp->sd_rgrps = 0; sdp->sd_rgrps < rgrp_count; sdp->sd_rgrps++) {
571 error = read_rindex_entry(ip, &ra_state);
578 sdp->sd_rindex_vn = ip->i_gl->gl_vn;
583 * gfs2_ri_update_special - Pull in a new resource index from the disk
585 * This is a special version that's safe to call from gfs2_inplace_reserve_i.
586 * In this case we know that we don't have any resource groups in memory yet.
588 * @ip: pointer to the rindex inode
590 * Returns: 0 on successful update, error code otherwise
592 static int gfs2_ri_update_special(struct gfs2_inode *ip)
594 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
595 struct inode *inode = &ip->i_inode;
596 struct file_ra_state ra_state;
599 file_ra_state_init(&ra_state, inode->i_mapping);
600 for (sdp->sd_rgrps = 0;; sdp->sd_rgrps++) {
601 /* Ignore partials */
602 if ((sdp->sd_rgrps + 1) * sizeof(struct gfs2_rindex) >
605 error = read_rindex_entry(ip, &ra_state);
612 sdp->sd_rindex_vn = ip->i_gl->gl_vn;
617 * gfs2_rindex_hold - Grab a lock on the rindex
618 * @sdp: The GFS2 superblock
619 * @ri_gh: the glock holder
621 * We grab a lock on the rindex inode to make sure that it doesn't
622 * change whilst we are performing an operation. We keep this lock
623 * for quite long periods of time compared to other locks. This
624 * doesn't matter, since it is shared and it is very, very rarely
625 * accessed in the exclusive mode (i.e. only when expanding the filesystem).
627 * This makes sure that we're using the latest copy of the resource index
628 * special file, which might have been updated if someone expanded the
629 * filesystem (via gfs2_grow utility), which adds new resource groups.
631 * Returns: 0 on success, error code otherwise
634 int gfs2_rindex_hold(struct gfs2_sbd *sdp, struct gfs2_holder *ri_gh)
636 struct gfs2_inode *ip = GFS2_I(sdp->sd_rindex);
637 struct gfs2_glock *gl = ip->i_gl;
640 error = gfs2_glock_nq_init(gl, LM_ST_SHARED, 0, ri_gh);
644 /* Read new copy from disk if we don't have the latest */
645 if (sdp->sd_rindex_vn != gl->gl_vn) {
646 mutex_lock(&sdp->sd_rindex_mutex);
647 if (sdp->sd_rindex_vn != gl->gl_vn) {
648 error = gfs2_ri_update(ip);
650 gfs2_glock_dq_uninit(ri_gh);
652 mutex_unlock(&sdp->sd_rindex_mutex);
658 static void gfs2_rgrp_in(struct gfs2_rgrpd *rgd, const void *buf)
660 const struct gfs2_rgrp *str = buf;
661 struct gfs2_rgrp_host *rg = &rgd->rd_rg;
664 rg_flags = be32_to_cpu(str->rg_flags);
665 if (rg_flags & GFS2_RGF_NOALLOC)
666 rgd->rd_flags |= GFS2_RDF_NOALLOC;
668 rgd->rd_flags &= ~GFS2_RDF_NOALLOC;
669 rg->rg_free = be32_to_cpu(str->rg_free);
670 rg->rg_dinodes = be32_to_cpu(str->rg_dinodes);
671 rg->rg_igeneration = be64_to_cpu(str->rg_igeneration);
674 static void gfs2_rgrp_out(struct gfs2_rgrpd *rgd, void *buf)
676 struct gfs2_rgrp *str = buf;
677 struct gfs2_rgrp_host *rg = &rgd->rd_rg;
680 if (rgd->rd_flags & GFS2_RDF_NOALLOC)
681 rg_flags |= GFS2_RGF_NOALLOC;
682 str->rg_flags = cpu_to_be32(rg_flags);
683 str->rg_free = cpu_to_be32(rg->rg_free);
684 str->rg_dinodes = cpu_to_be32(rg->rg_dinodes);
685 str->__pad = cpu_to_be32(0);
686 str->rg_igeneration = cpu_to_be64(rg->rg_igeneration);
687 memset(&str->rg_reserved, 0, sizeof(str->rg_reserved));
691 * gfs2_rgrp_bh_get - Read in a RG's header and bitmaps
692 * @rgd: the struct gfs2_rgrpd describing the RG to read in
694 * Read in all of a Resource Group's header and bitmap blocks.
695 * Caller must eventually call gfs2_rgrp_relse() to free the bitmaps.
700 int gfs2_rgrp_bh_get(struct gfs2_rgrpd *rgd)
702 struct gfs2_sbd *sdp = rgd->rd_sbd;
703 struct gfs2_glock *gl = rgd->rd_gl;
704 unsigned int length = rgd->rd_length;
705 struct gfs2_bitmap *bi;
709 mutex_lock(&rgd->rd_mutex);
711 spin_lock(&sdp->sd_rindex_spin);
712 if (rgd->rd_bh_count) {
714 spin_unlock(&sdp->sd_rindex_spin);
715 mutex_unlock(&rgd->rd_mutex);
718 spin_unlock(&sdp->sd_rindex_spin);
720 for (x = 0; x < length; x++) {
721 bi = rgd->rd_bits + x;
722 error = gfs2_meta_read(gl, rgd->rd_addr + x, 0, &bi->bi_bh);
727 for (y = length; y--;) {
728 bi = rgd->rd_bits + y;
729 error = gfs2_meta_wait(sdp, bi->bi_bh);
732 if (gfs2_metatype_check(sdp, bi->bi_bh, y ? GFS2_METATYPE_RB :
739 if (rgd->rd_rg_vn != gl->gl_vn) {
740 gfs2_rgrp_in(rgd, (rgd->rd_bits[0].bi_bh)->b_data);
741 rgd->rd_rg_vn = gl->gl_vn;
744 spin_lock(&sdp->sd_rindex_spin);
745 rgd->rd_free_clone = rgd->rd_rg.rg_free;
747 spin_unlock(&sdp->sd_rindex_spin);
749 mutex_unlock(&rgd->rd_mutex);
755 bi = rgd->rd_bits + x;
758 gfs2_assert_warn(sdp, !bi->bi_clone);
760 mutex_unlock(&rgd->rd_mutex);
765 void gfs2_rgrp_bh_hold(struct gfs2_rgrpd *rgd)
767 struct gfs2_sbd *sdp = rgd->rd_sbd;
769 spin_lock(&sdp->sd_rindex_spin);
770 gfs2_assert_warn(rgd->rd_sbd, rgd->rd_bh_count);
772 spin_unlock(&sdp->sd_rindex_spin);
776 * gfs2_rgrp_bh_put - Release RG bitmaps read in with gfs2_rgrp_bh_get()
777 * @rgd: the struct gfs2_rgrpd describing the RG to read in
781 void gfs2_rgrp_bh_put(struct gfs2_rgrpd *rgd)
783 struct gfs2_sbd *sdp = rgd->rd_sbd;
784 int x, length = rgd->rd_length;
786 spin_lock(&sdp->sd_rindex_spin);
787 gfs2_assert_warn(rgd->rd_sbd, rgd->rd_bh_count);
788 if (--rgd->rd_bh_count) {
789 spin_unlock(&sdp->sd_rindex_spin);
793 for (x = 0; x < length; x++) {
794 struct gfs2_bitmap *bi = rgd->rd_bits + x;
801 spin_unlock(&sdp->sd_rindex_spin);
804 void gfs2_rgrp_repolish_clones(struct gfs2_rgrpd *rgd)
806 struct gfs2_sbd *sdp = rgd->rd_sbd;
807 unsigned int length = rgd->rd_length;
810 for (x = 0; x < length; x++) {
811 struct gfs2_bitmap *bi = rgd->rd_bits + x;
814 memcpy(bi->bi_clone + bi->bi_offset,
815 bi->bi_bh->b_data + bi->bi_offset, bi->bi_len);
818 spin_lock(&sdp->sd_rindex_spin);
819 rgd->rd_free_clone = rgd->rd_rg.rg_free;
820 spin_unlock(&sdp->sd_rindex_spin);
824 * gfs2_alloc_get - get the struct gfs2_alloc structure for an inode
825 * @ip: the incore GFS2 inode structure
827 * Returns: the struct gfs2_alloc
830 struct gfs2_alloc *gfs2_alloc_get(struct gfs2_inode *ip)
832 BUG_ON(ip->i_alloc != NULL);
833 ip->i_alloc = kzalloc(sizeof(struct gfs2_alloc), GFP_KERNEL);
838 * try_rgrp_fit - See if a given reservation will fit in a given RG
840 * @al: the struct gfs2_alloc structure describing the reservation
842 * If there's room for the requested blocks to be allocated from the RG:
843 * Sets the $al_rgd field in @al.
845 * Returns: 1 on success (it fits), 0 on failure (it doesn't fit)
848 static int try_rgrp_fit(struct gfs2_rgrpd *rgd, struct gfs2_alloc *al)
850 struct gfs2_sbd *sdp = rgd->rd_sbd;
853 if (rgd->rd_flags & GFS2_RDF_NOALLOC)
856 spin_lock(&sdp->sd_rindex_spin);
857 if (rgd->rd_free_clone >= al->al_requested) {
861 spin_unlock(&sdp->sd_rindex_spin);
867 * try_rgrp_unlink - Look for any unlinked, allocated, but unused inodes
870 * Returns: The inode, if one has been found
873 static struct inode *try_rgrp_unlink(struct gfs2_rgrpd *rgd, u64 *last_unlinked)
878 struct gfs2_sbd *sdp = rgd->rd_sbd;
881 if (goal >= rgd->rd_data)
883 down_write(&sdp->sd_log_flush_lock);
884 block = rgblk_search(rgd, goal, GFS2_BLKST_UNLINKED,
885 GFS2_BLKST_UNLINKED);
886 up_write(&sdp->sd_log_flush_lock);
887 if (block == BFITNOENT)
889 /* rgblk_search can return a block < goal, so we need to
890 keep it marching forward. */
891 no_addr = block + rgd->rd_data0;
893 if (*last_unlinked != NO_BLOCK && no_addr <= *last_unlinked)
895 *last_unlinked = no_addr;
896 inode = gfs2_inode_lookup(rgd->rd_sbd->sd_vfs, DT_UNKNOWN,
902 rgd->rd_flags &= ~GFS2_RDF_CHECK;
907 * recent_rgrp_first - get first RG from "recent" list
908 * @sdp: The GFS2 superblock
909 * @rglast: address of the rgrp used last
911 * Returns: The first rgrp in the recent list
914 static struct gfs2_rgrpd *recent_rgrp_first(struct gfs2_sbd *sdp,
917 struct gfs2_rgrpd *rgd = NULL;
919 spin_lock(&sdp->sd_rindex_spin);
921 if (list_empty(&sdp->sd_rindex_recent_list))
927 list_for_each_entry(rgd, &sdp->sd_rindex_recent_list, rd_recent) {
928 if (rgd->rd_addr == rglast)
933 rgd = list_entry(sdp->sd_rindex_recent_list.next, struct gfs2_rgrpd,
936 spin_unlock(&sdp->sd_rindex_spin);
941 * recent_rgrp_next - get next RG from "recent" list
942 * @cur_rgd: current rgrp
945 * Returns: The next rgrp in the recent list
948 static struct gfs2_rgrpd *recent_rgrp_next(struct gfs2_rgrpd *cur_rgd,
951 struct gfs2_sbd *sdp = cur_rgd->rd_sbd;
952 struct list_head *head;
953 struct gfs2_rgrpd *rgd;
955 spin_lock(&sdp->sd_rindex_spin);
957 head = &sdp->sd_rindex_recent_list;
959 list_for_each_entry(rgd, head, rd_recent) {
960 if (rgd == cur_rgd) {
961 if (cur_rgd->rd_recent.next != head)
962 rgd = list_entry(cur_rgd->rd_recent.next,
963 struct gfs2_rgrpd, rd_recent);
968 list_del(&cur_rgd->rd_recent);
975 if (!list_empty(head))
976 rgd = list_entry(head->next, struct gfs2_rgrpd, rd_recent);
979 spin_unlock(&sdp->sd_rindex_spin);
984 * recent_rgrp_add - add an RG to tail of "recent" list
985 * @new_rgd: The rgrp to add
989 static void recent_rgrp_add(struct gfs2_rgrpd *new_rgd)
991 struct gfs2_sbd *sdp = new_rgd->rd_sbd;
992 struct gfs2_rgrpd *rgd;
993 unsigned int count = 0;
994 unsigned int max = sdp->sd_rgrps / gfs2_jindex_size(sdp);
996 spin_lock(&sdp->sd_rindex_spin);
998 list_for_each_entry(rgd, &sdp->sd_rindex_recent_list, rd_recent) {
1005 list_add_tail(&new_rgd->rd_recent, &sdp->sd_rindex_recent_list);
1008 spin_unlock(&sdp->sd_rindex_spin);
1012 * forward_rgrp_get - get an rgrp to try next from full list
1013 * @sdp: The GFS2 superblock
1015 * Returns: The rgrp to try next
1018 static struct gfs2_rgrpd *forward_rgrp_get(struct gfs2_sbd *sdp)
1020 struct gfs2_rgrpd *rgd;
1021 unsigned int journals = gfs2_jindex_size(sdp);
1022 unsigned int rg = 0, x;
1024 spin_lock(&sdp->sd_rindex_spin);
1026 rgd = sdp->sd_rindex_forward;
1028 if (sdp->sd_rgrps >= journals)
1029 rg = sdp->sd_rgrps * sdp->sd_jdesc->jd_jid / journals;
1031 for (x = 0, rgd = gfs2_rgrpd_get_first(sdp); x < rg;
1032 x++, rgd = gfs2_rgrpd_get_next(rgd))
1035 sdp->sd_rindex_forward = rgd;
1038 spin_unlock(&sdp->sd_rindex_spin);
1044 * forward_rgrp_set - set the forward rgrp pointer
1045 * @sdp: the filesystem
1046 * @rgd: The new forward rgrp
1050 static void forward_rgrp_set(struct gfs2_sbd *sdp, struct gfs2_rgrpd *rgd)
1052 spin_lock(&sdp->sd_rindex_spin);
1053 sdp->sd_rindex_forward = rgd;
1054 spin_unlock(&sdp->sd_rindex_spin);
1058 * get_local_rgrp - Choose and lock a rgrp for allocation
1059 * @ip: the inode to reserve space for
1060 * @rgp: the chosen and locked rgrp
1062 * Try to acquire rgrp in way which avoids contending with others.
1067 static struct inode *get_local_rgrp(struct gfs2_inode *ip, u64 *last_unlinked)
1069 struct inode *inode = NULL;
1070 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1071 struct gfs2_rgrpd *rgd, *begin = NULL;
1072 struct gfs2_alloc *al = ip->i_alloc;
1073 int flags = LM_FLAG_TRY;
1076 int error, rg_locked;
1078 /* Try recently successful rgrps */
1080 rgd = recent_rgrp_first(sdp, ip->i_last_rg_alloc);
1085 if (gfs2_glock_is_locked_by_me(rgd->rd_gl)) {
1089 error = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_EXCLUSIVE,
1090 LM_FLAG_TRY, &al->al_rgd_gh);
1094 if (try_rgrp_fit(rgd, al))
1096 if (rgd->rd_flags & GFS2_RDF_CHECK)
1097 inode = try_rgrp_unlink(rgd, last_unlinked);
1099 gfs2_glock_dq_uninit(&al->al_rgd_gh);
1102 rgd = recent_rgrp_next(rgd, 1);
1106 rgd = recent_rgrp_next(rgd, 0);
1110 return ERR_PTR(error);
1114 /* Go through full list of rgrps */
1116 begin = rgd = forward_rgrp_get(sdp);
1121 if (gfs2_glock_is_locked_by_me(rgd->rd_gl)) {
1125 error = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_EXCLUSIVE, flags,
1130 if (try_rgrp_fit(rgd, al))
1132 if (rgd->rd_flags & GFS2_RDF_CHECK)
1133 inode = try_rgrp_unlink(rgd, last_unlinked);
1135 gfs2_glock_dq_uninit(&al->al_rgd_gh);
1145 return ERR_PTR(error);
1148 rgd = gfs2_rgrpd_get_next(rgd);
1150 rgd = gfs2_rgrpd_get_first(sdp);
1154 return ERR_PTR(-ENOSPC);
1159 gfs2_log_flush(sdp, NULL);
1164 ip->i_last_rg_alloc = rgd->rd_addr;
1167 recent_rgrp_add(rgd);
1168 rgd = gfs2_rgrpd_get_next(rgd);
1170 rgd = gfs2_rgrpd_get_first(sdp);
1171 forward_rgrp_set(sdp, rgd);
1178 * gfs2_inplace_reserve_i - Reserve space in the filesystem
1179 * @ip: the inode to reserve space for
1184 int gfs2_inplace_reserve_i(struct gfs2_inode *ip, char *file, unsigned int line)
1186 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1187 struct gfs2_alloc *al = ip->i_alloc;
1188 struct inode *inode;
1190 u64 last_unlinked = NO_BLOCK;
1192 if (gfs2_assert_warn(sdp, al->al_requested))
1196 /* We need to hold the rindex unless the inode we're using is
1197 the rindex itself, in which case it's already held. */
1198 if (ip != GFS2_I(sdp->sd_rindex))
1199 error = gfs2_rindex_hold(sdp, &al->al_ri_gh);
1200 else if (!sdp->sd_rgrps) /* We may not have the rindex read in, so: */
1201 error = gfs2_ri_update_special(ip);
1206 inode = get_local_rgrp(ip, &last_unlinked);
1208 if (ip != GFS2_I(sdp->sd_rindex))
1209 gfs2_glock_dq_uninit(&al->al_ri_gh);
1211 return PTR_ERR(inode);
1213 gfs2_log_flush(sdp, NULL);
1224 * gfs2_inplace_release - release an inplace reservation
1225 * @ip: the inode the reservation was taken out on
1227 * Release a reservation made by gfs2_inplace_reserve().
1230 void gfs2_inplace_release(struct gfs2_inode *ip)
1232 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1233 struct gfs2_alloc *al = ip->i_alloc;
1235 if (gfs2_assert_warn(sdp, al->al_alloced <= al->al_requested) == -1)
1236 fs_warn(sdp, "al_alloced = %u, al_requested = %u "
1237 "al_file = %s, al_line = %u\n",
1238 al->al_alloced, al->al_requested, al->al_file,
1242 if (al->al_rgd_gh.gh_gl)
1243 gfs2_glock_dq_uninit(&al->al_rgd_gh);
1244 if (ip != GFS2_I(sdp->sd_rindex))
1245 gfs2_glock_dq_uninit(&al->al_ri_gh);
1249 * gfs2_get_block_type - Check a block in a RG is of given type
1250 * @rgd: the resource group holding the block
1251 * @block: the block number
1253 * Returns: The block type (GFS2_BLKST_*)
1256 unsigned char gfs2_get_block_type(struct gfs2_rgrpd *rgd, u64 block)
1258 struct gfs2_bitmap *bi = NULL;
1259 u32 length, rgrp_block, buf_block;
1263 length = rgd->rd_length;
1264 rgrp_block = block - rgd->rd_data0;
1266 for (buf = 0; buf < length; buf++) {
1267 bi = rgd->rd_bits + buf;
1268 if (rgrp_block < (bi->bi_start + bi->bi_len) * GFS2_NBBY)
1272 gfs2_assert(rgd->rd_sbd, buf < length);
1273 buf_block = rgrp_block - bi->bi_start * GFS2_NBBY;
1275 type = gfs2_testbit(rgd, bi->bi_bh->b_data + bi->bi_offset,
1276 bi->bi_len, buf_block);
1282 * rgblk_search - find a block in @old_state, change allocation
1283 * state to @new_state
1284 * @rgd: the resource group descriptor
1285 * @goal: the goal block within the RG (start here to search for avail block)
1286 * @old_state: GFS2_BLKST_XXX the before-allocation state to find
1287 * @new_state: GFS2_BLKST_XXX the after-allocation block state
1289 * Walk rgrp's bitmap to find bits that represent a block in @old_state.
1290 * Add the found bitmap buffer to the transaction.
1291 * Set the found bits to @new_state to change block's allocation state.
1293 * This function never fails, because we wouldn't call it unless we
1294 * know (from reservation results, etc.) that a block is available.
1296 * Scope of @goal and returned block is just within rgrp, not the whole
1299 * Returns: the block number allocated
1302 static u32 rgblk_search(struct gfs2_rgrpd *rgd, u32 goal,
1303 unsigned char old_state, unsigned char new_state)
1305 struct gfs2_bitmap *bi = NULL;
1306 u32 length = rgd->rd_length;
1308 unsigned int buf, x;
1310 /* Find bitmap block that contains bits for goal block */
1311 for (buf = 0; buf < length; buf++) {
1312 bi = rgd->rd_bits + buf;
1313 if (goal < (bi->bi_start + bi->bi_len) * GFS2_NBBY)
1317 gfs2_assert(rgd->rd_sbd, buf < length);
1319 /* Convert scope of "goal" from rgrp-wide to within found bit block */
1320 goal -= bi->bi_start * GFS2_NBBY;
1322 /* Search (up to entire) bitmap in this rgrp for allocatable block.
1323 "x <= length", instead of "x < length", because we typically start
1324 the search in the middle of a bit block, but if we can't find an
1325 allocatable block anywhere else, we want to be able wrap around and
1326 search in the first part of our first-searched bit block. */
1327 for (x = 0; x <= length; x++) {
1328 /* The GFS2_BLKST_UNLINKED state doesn't apply to the clone
1329 bitmaps, so we must search the originals for that. */
1330 if (old_state != GFS2_BLKST_UNLINKED && bi->bi_clone)
1331 blk = gfs2_bitfit(bi->bi_clone + bi->bi_offset,
1332 bi->bi_len, goal, old_state);
1334 blk = gfs2_bitfit(bi->bi_bh->b_data + bi->bi_offset,
1335 bi->bi_len, goal, old_state);
1336 if (blk != BFITNOENT)
1339 /* Try next bitmap block (wrap back to rgrp header if at end) */
1340 buf = (buf + 1) % length;
1341 bi = rgd->rd_bits + buf;
1345 if (blk != BFITNOENT && old_state != new_state) {
1346 gfs2_trans_add_bh(rgd->rd_gl, bi->bi_bh, 1);
1347 gfs2_setbit(rgd, bi->bi_bh->b_data + bi->bi_offset,
1348 bi->bi_len, blk, new_state);
1350 gfs2_setbit(rgd, bi->bi_clone + bi->bi_offset,
1351 bi->bi_len, blk, new_state);
1354 return (blk == BFITNOENT) ? blk : (bi->bi_start * GFS2_NBBY) + blk;
1358 * rgblk_free - Change alloc state of given block(s)
1359 * @sdp: the filesystem
1360 * @bstart: the start of a run of blocks to free
1361 * @blen: the length of the block run (all must lie within ONE RG!)
1362 * @new_state: GFS2_BLKST_XXX the after-allocation block state
1364 * Returns: Resource group containing the block(s)
1367 static struct gfs2_rgrpd *rgblk_free(struct gfs2_sbd *sdp, u64 bstart,
1368 u32 blen, unsigned char new_state)
1370 struct gfs2_rgrpd *rgd;
1371 struct gfs2_bitmap *bi = NULL;
1372 u32 length, rgrp_blk, buf_blk;
1375 rgd = gfs2_blk2rgrpd(sdp, bstart);
1377 if (gfs2_consist(sdp))
1378 fs_err(sdp, "block = %llu\n", (unsigned long long)bstart);
1382 length = rgd->rd_length;
1384 rgrp_blk = bstart - rgd->rd_data0;
1387 for (buf = 0; buf < length; buf++) {
1388 bi = rgd->rd_bits + buf;
1389 if (rgrp_blk < (bi->bi_start + bi->bi_len) * GFS2_NBBY)
1393 gfs2_assert(rgd->rd_sbd, buf < length);
1395 buf_blk = rgrp_blk - bi->bi_start * GFS2_NBBY;
1398 if (!bi->bi_clone) {
1399 bi->bi_clone = kmalloc(bi->bi_bh->b_size,
1400 GFP_NOFS | __GFP_NOFAIL);
1401 memcpy(bi->bi_clone + bi->bi_offset,
1402 bi->bi_bh->b_data + bi->bi_offset,
1405 gfs2_trans_add_bh(rgd->rd_gl, bi->bi_bh, 1);
1406 gfs2_setbit(rgd, bi->bi_bh->b_data + bi->bi_offset,
1407 bi->bi_len, buf_blk, new_state);
1414 * gfs2_alloc_data - Allocate a data block
1415 * @ip: the inode to allocate the data block for
1417 * Returns: the allocated block
1420 u64 gfs2_alloc_data(struct gfs2_inode *ip)
1422 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1423 struct gfs2_alloc *al = ip->i_alloc;
1424 struct gfs2_rgrpd *rgd = al->al_rgd;
1428 if (rgrp_contains_block(rgd, ip->i_di.di_goal_data))
1429 goal = ip->i_di.di_goal_data - rgd->rd_data0;
1431 goal = rgd->rd_last_alloc_data;
1433 blk = rgblk_search(rgd, goal, GFS2_BLKST_FREE, GFS2_BLKST_USED);
1434 BUG_ON(blk == BFITNOENT);
1435 rgd->rd_last_alloc_data = blk;
1437 block = rgd->rd_data0 + blk;
1438 ip->i_di.di_goal_data = block;
1440 gfs2_assert_withdraw(sdp, rgd->rd_rg.rg_free);
1441 rgd->rd_rg.rg_free--;
1443 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1444 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
1448 gfs2_statfs_change(sdp, 0, -1, 0);
1449 gfs2_quota_change(ip, +1, ip->i_inode.i_uid, ip->i_inode.i_gid);
1451 spin_lock(&sdp->sd_rindex_spin);
1452 rgd->rd_free_clone--;
1453 spin_unlock(&sdp->sd_rindex_spin);
1459 * gfs2_alloc_meta - Allocate a metadata block
1460 * @ip: the inode to allocate the metadata block for
1462 * Returns: the allocated block
1465 u64 gfs2_alloc_meta(struct gfs2_inode *ip)
1467 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1468 struct gfs2_alloc *al = ip->i_alloc;
1469 struct gfs2_rgrpd *rgd = al->al_rgd;
1473 if (rgrp_contains_block(rgd, ip->i_di.di_goal_meta))
1474 goal = ip->i_di.di_goal_meta - rgd->rd_data0;
1476 goal = rgd->rd_last_alloc_meta;
1478 blk = rgblk_search(rgd, goal, GFS2_BLKST_FREE, GFS2_BLKST_USED);
1479 BUG_ON(blk == BFITNOENT);
1480 rgd->rd_last_alloc_meta = blk;
1482 block = rgd->rd_data0 + blk;
1483 ip->i_di.di_goal_meta = block;
1485 gfs2_assert_withdraw(sdp, rgd->rd_rg.rg_free);
1486 rgd->rd_rg.rg_free--;
1488 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1489 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
1493 gfs2_statfs_change(sdp, 0, -1, 0);
1494 gfs2_quota_change(ip, +1, ip->i_inode.i_uid, ip->i_inode.i_gid);
1495 gfs2_trans_add_unrevoke(sdp, block);
1497 spin_lock(&sdp->sd_rindex_spin);
1498 rgd->rd_free_clone--;
1499 spin_unlock(&sdp->sd_rindex_spin);
1505 * gfs2_alloc_di - Allocate a dinode
1506 * @dip: the directory that the inode is going in
1508 * Returns: the block allocated
1511 u64 gfs2_alloc_di(struct gfs2_inode *dip, u64 *generation)
1513 struct gfs2_sbd *sdp = GFS2_SB(&dip->i_inode);
1514 struct gfs2_alloc *al = dip->i_alloc;
1515 struct gfs2_rgrpd *rgd = al->al_rgd;
1519 blk = rgblk_search(rgd, rgd->rd_last_alloc_meta,
1520 GFS2_BLKST_FREE, GFS2_BLKST_DINODE);
1521 BUG_ON(blk == BFITNOENT);
1523 rgd->rd_last_alloc_meta = blk;
1525 block = rgd->rd_data0 + blk;
1527 gfs2_assert_withdraw(sdp, rgd->rd_rg.rg_free);
1528 rgd->rd_rg.rg_free--;
1529 rgd->rd_rg.rg_dinodes++;
1530 *generation = rgd->rd_rg.rg_igeneration++;
1531 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1532 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
1536 gfs2_statfs_change(sdp, 0, -1, +1);
1537 gfs2_trans_add_unrevoke(sdp, block);
1539 spin_lock(&sdp->sd_rindex_spin);
1540 rgd->rd_free_clone--;
1541 spin_unlock(&sdp->sd_rindex_spin);
1547 * gfs2_free_data - free a contiguous run of data block(s)
1548 * @ip: the inode these blocks are being freed from
1549 * @bstart: first block of a run of contiguous blocks
1550 * @blen: the length of the block run
1554 void gfs2_free_data(struct gfs2_inode *ip, u64 bstart, u32 blen)
1556 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1557 struct gfs2_rgrpd *rgd;
1559 rgd = rgblk_free(sdp, bstart, blen, GFS2_BLKST_FREE);
1563 rgd->rd_rg.rg_free += blen;
1565 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1566 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
1568 gfs2_trans_add_rg(rgd);
1570 gfs2_statfs_change(sdp, 0, +blen, 0);
1571 gfs2_quota_change(ip, -(s64)blen, ip->i_inode.i_uid, ip->i_inode.i_gid);
1575 * gfs2_free_meta - free a contiguous run of data block(s)
1576 * @ip: the inode these blocks are being freed from
1577 * @bstart: first block of a run of contiguous blocks
1578 * @blen: the length of the block run
1582 void gfs2_free_meta(struct gfs2_inode *ip, u64 bstart, u32 blen)
1584 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1585 struct gfs2_rgrpd *rgd;
1587 rgd = rgblk_free(sdp, bstart, blen, GFS2_BLKST_FREE);
1591 rgd->rd_rg.rg_free += blen;
1593 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1594 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
1596 gfs2_trans_add_rg(rgd);
1598 gfs2_statfs_change(sdp, 0, +blen, 0);
1599 gfs2_quota_change(ip, -(s64)blen, ip->i_inode.i_uid, ip->i_inode.i_gid);
1600 gfs2_meta_wipe(ip, bstart, blen);
1603 void gfs2_unlink_di(struct inode *inode)
1605 struct gfs2_inode *ip = GFS2_I(inode);
1606 struct gfs2_sbd *sdp = GFS2_SB(inode);
1607 struct gfs2_rgrpd *rgd;
1608 u64 blkno = ip->i_no_addr;
1610 rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_UNLINKED);
1613 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1614 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
1615 gfs2_trans_add_rg(rgd);
1618 static void gfs2_free_uninit_di(struct gfs2_rgrpd *rgd, u64 blkno)
1620 struct gfs2_sbd *sdp = rgd->rd_sbd;
1621 struct gfs2_rgrpd *tmp_rgd;
1623 tmp_rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_FREE);
1626 gfs2_assert_withdraw(sdp, rgd == tmp_rgd);
1628 if (!rgd->rd_rg.rg_dinodes)
1629 gfs2_consist_rgrpd(rgd);
1630 rgd->rd_rg.rg_dinodes--;
1631 rgd->rd_rg.rg_free++;
1633 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1634 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
1636 gfs2_statfs_change(sdp, 0, +1, -1);
1637 gfs2_trans_add_rg(rgd);
1641 void gfs2_free_di(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip)
1643 gfs2_free_uninit_di(rgd, ip->i_no_addr);
1644 gfs2_quota_change(ip, -1, ip->i_inode.i_uid, ip->i_inode.i_gid);
1645 gfs2_meta_wipe(ip, ip->i_no_addr, 1);
1649 * gfs2_rlist_add - add a RG to a list of RGs
1650 * @sdp: the filesystem
1651 * @rlist: the list of resource groups
1654 * Figure out what RG a block belongs to and add that RG to the list
1656 * FIXME: Don't use NOFAIL
1660 void gfs2_rlist_add(struct gfs2_sbd *sdp, struct gfs2_rgrp_list *rlist,
1663 struct gfs2_rgrpd *rgd;
1664 struct gfs2_rgrpd **tmp;
1665 unsigned int new_space;
1668 if (gfs2_assert_warn(sdp, !rlist->rl_ghs))
1671 rgd = gfs2_blk2rgrpd(sdp, block);
1673 if (gfs2_consist(sdp))
1674 fs_err(sdp, "block = %llu\n", (unsigned long long)block);
1678 for (x = 0; x < rlist->rl_rgrps; x++)
1679 if (rlist->rl_rgd[x] == rgd)
1682 if (rlist->rl_rgrps == rlist->rl_space) {
1683 new_space = rlist->rl_space + 10;
1685 tmp = kcalloc(new_space, sizeof(struct gfs2_rgrpd *),
1686 GFP_NOFS | __GFP_NOFAIL);
1688 if (rlist->rl_rgd) {
1689 memcpy(tmp, rlist->rl_rgd,
1690 rlist->rl_space * sizeof(struct gfs2_rgrpd *));
1691 kfree(rlist->rl_rgd);
1694 rlist->rl_space = new_space;
1695 rlist->rl_rgd = tmp;
1698 rlist->rl_rgd[rlist->rl_rgrps++] = rgd;
1702 * gfs2_rlist_alloc - all RGs have been added to the rlist, now allocate
1703 * and initialize an array of glock holders for them
1704 * @rlist: the list of resource groups
1705 * @state: the lock state to acquire the RG lock in
1706 * @flags: the modifier flags for the holder structures
1708 * FIXME: Don't use NOFAIL
1712 void gfs2_rlist_alloc(struct gfs2_rgrp_list *rlist, unsigned int state)
1716 rlist->rl_ghs = kcalloc(rlist->rl_rgrps, sizeof(struct gfs2_holder),
1717 GFP_NOFS | __GFP_NOFAIL);
1718 for (x = 0; x < rlist->rl_rgrps; x++)
1719 gfs2_holder_init(rlist->rl_rgd[x]->rd_gl,
1725 * gfs2_rlist_free - free a resource group list
1726 * @list: the list of resource groups
1730 void gfs2_rlist_free(struct gfs2_rgrp_list *rlist)
1734 kfree(rlist->rl_rgd);
1736 if (rlist->rl_ghs) {
1737 for (x = 0; x < rlist->rl_rgrps; x++)
1738 gfs2_holder_uninit(&rlist->rl_ghs[x]);
1739 kfree(rlist->rl_ghs);