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>
32 #include "ops_address.h"
34 #define BFITNOENT ((u32)~0)
35 #define NO_BLOCK ((u64)~0)
37 #if BITS_PER_LONG == 32
38 #define LBITMASK (0x55555555UL)
39 #define LBITSKIP55 (0x55555555UL)
40 #define LBITSKIP00 (0x00000000UL)
42 #define LBITMASK (0x5555555555555555UL)
43 #define LBITSKIP55 (0x5555555555555555UL)
44 #define LBITSKIP00 (0x0000000000000000UL)
48 * These routines are used by the resource group routines (rgrp.c)
49 * to keep track of block allocation. Each block is represented by two
50 * bits. So, each byte represents GFS2_NBBY (i.e. 4) blocks.
53 * 1 = Used (not metadata)
54 * 2 = Unlinked (still in use) inode
58 static const char valid_change[16] = {
66 static u32 rgblk_search(struct gfs2_rgrpd *rgd, u32 goal,
67 unsigned char old_state, unsigned char new_state,
71 * gfs2_setbit - Set a bit in the bitmaps
72 * @buffer: the buffer that holds the bitmaps
73 * @buflen: the length (in bytes) of the buffer
74 * @block: the block to set
75 * @new_state: the new state of the block
79 static inline void gfs2_setbit(struct gfs2_rgrpd *rgd, unsigned char *buf1,
80 unsigned char *buf2, unsigned int offset,
81 unsigned int buflen, u32 block,
82 unsigned char new_state)
84 unsigned char *byte1, *byte2, *end, cur_state;
85 const unsigned int bit = (block % GFS2_NBBY) * GFS2_BIT_SIZE;
87 byte1 = buf1 + offset + (block / GFS2_NBBY);
88 end = buf1 + offset + buflen;
92 cur_state = (*byte1 >> bit) & GFS2_BIT_MASK;
94 if (unlikely(!valid_change[new_state * 4 + cur_state])) {
95 gfs2_consist_rgrpd(rgd);
98 *byte1 ^= (cur_state ^ new_state) << bit;
101 byte2 = buf2 + offset + (block / GFS2_NBBY);
102 cur_state = (*byte2 >> bit) & GFS2_BIT_MASK;
103 *byte2 ^= (cur_state ^ new_state) << bit;
108 * gfs2_testbit - test a bit in the bitmaps
109 * @buffer: the buffer that holds the bitmaps
110 * @buflen: the length (in bytes) of the buffer
111 * @block: the block to read
115 static inline unsigned char gfs2_testbit(struct gfs2_rgrpd *rgd,
116 const unsigned char *buffer,
117 unsigned int buflen, u32 block)
119 const unsigned char *byte, *end;
120 unsigned char cur_state;
123 byte = buffer + (block / GFS2_NBBY);
124 bit = (block % GFS2_NBBY) * GFS2_BIT_SIZE;
125 end = buffer + buflen;
127 gfs2_assert(rgd->rd_sbd, byte < end);
129 cur_state = (*byte >> bit) & GFS2_BIT_MASK;
136 * @ptr: Pointer to bitmap data
137 * @mask: Mask to use (normally 0x55555.... but adjusted for search start)
138 * @state: The state we are searching for
140 * We xor the bitmap data with a patter which is the bitwise opposite
141 * of what we are looking for, this gives rise to a pattern of ones
142 * wherever there is a match. Since we have two bits per entry, we
143 * take this pattern, shift it down by one place and then and it with
144 * the original. All the even bit positions (0,2,4, etc) then represent
145 * successful matches, so we mask with 0x55555..... to remove the unwanted
148 * This allows searching of a whole u64 at once (32 blocks) with a
149 * single test (on 64 bit arches).
152 static inline u64 gfs2_bit_search(const __le64 *ptr, u64 mask, u8 state)
155 static const u64 search[] = {
156 [0] = 0xffffffffffffffffULL,
157 [1] = 0xaaaaaaaaaaaaaaaaULL,
158 [2] = 0x5555555555555555ULL,
159 [3] = 0x0000000000000000ULL,
161 tmp = le64_to_cpu(*ptr) ^ search[state];
168 * gfs2_bitfit - Search an rgrp's bitmap buffer to find a bit-pair representing
169 * a block in a given allocation state.
170 * @buffer: the buffer that holds the bitmaps
171 * @len: the length (in bytes) of the buffer
172 * @goal: start search at this block's bit-pair (within @buffer)
173 * @state: GFS2_BLKST_XXX the state of the block we're looking for.
175 * Scope of @goal and returned block number is only within this bitmap buffer,
176 * not entire rgrp or filesystem. @buffer will be offset from the actual
177 * beginning of a bitmap block buffer, skipping any header structures, but
178 * headers are always a multiple of 64 bits long so that the buffer is
179 * always aligned to a 64 bit boundary.
181 * The size of the buffer is in bytes, but is it assumed that it is
182 * always ok to to read a complete multiple of 64 bits at the end
183 * of the block in case the end is no aligned to a natural boundary.
185 * Return: the block number (bitmap buffer scope) that was found
188 static u32 gfs2_bitfit(const u8 *buf, const unsigned int len,
191 u32 spoint = (goal << 1) & ((8*sizeof(u64)) - 1);
192 const __le64 *ptr = ((__le64 *)buf) + (goal >> 5);
193 const __le64 *end = (__le64 *)(buf + ALIGN(len, sizeof(u64)));
195 u64 mask = 0x5555555555555555ULL;
200 /* Mask off bits we don't care about at the start of the search */
202 tmp = gfs2_bit_search(ptr, mask, state);
204 while(tmp == 0 && ptr < end) {
205 tmp = gfs2_bit_search(ptr, 0x5555555555555555ULL, state);
208 /* Mask off any bits which are more than len bytes from the start */
209 if (ptr == end && (len & (sizeof(u64) - 1)))
210 tmp &= (((u64)~0) >> (64 - 8*(len & (sizeof(u64) - 1))));
211 /* Didn't find anything, so return */
216 bit /= 2; /* two bits per entry in the bitmap */
217 return (((const unsigned char *)ptr - buf) * GFS2_NBBY) + bit;
221 * gfs2_bitcount - count the number of bits in a certain state
222 * @buffer: the buffer that holds the bitmaps
223 * @buflen: the length (in bytes) of the buffer
224 * @state: the state of the block we're looking for
226 * Returns: The number of bits
229 static u32 gfs2_bitcount(struct gfs2_rgrpd *rgd, const u8 *buffer,
230 unsigned int buflen, u8 state)
232 const u8 *byte = buffer;
233 const u8 *end = buffer + buflen;
234 const u8 state1 = state << 2;
235 const u8 state2 = state << 4;
236 const u8 state3 = state << 6;
239 for (; byte < end; byte++) {
240 if (((*byte) & 0x03) == state)
242 if (((*byte) & 0x0C) == state1)
244 if (((*byte) & 0x30) == state2)
246 if (((*byte) & 0xC0) == state3)
254 * gfs2_rgrp_verify - Verify that a resource group is consistent
255 * @sdp: the filesystem
260 void gfs2_rgrp_verify(struct gfs2_rgrpd *rgd)
262 struct gfs2_sbd *sdp = rgd->rd_sbd;
263 struct gfs2_bitmap *bi = NULL;
264 u32 length = rgd->rd_length;
268 memset(count, 0, 4 * sizeof(u32));
270 /* Count # blocks in each of 4 possible allocation states */
271 for (buf = 0; buf < length; buf++) {
272 bi = rgd->rd_bits + buf;
273 for (x = 0; x < 4; x++)
274 count[x] += gfs2_bitcount(rgd,
280 if (count[0] != rgd->rd_free) {
281 if (gfs2_consist_rgrpd(rgd))
282 fs_err(sdp, "free data mismatch: %u != %u\n",
283 count[0], rgd->rd_free);
287 tmp = rgd->rd_data - rgd->rd_free - rgd->rd_dinodes;
288 if (count[1] + count[2] != tmp) {
289 if (gfs2_consist_rgrpd(rgd))
290 fs_err(sdp, "used data mismatch: %u != %u\n",
295 if (count[3] != rgd->rd_dinodes) {
296 if (gfs2_consist_rgrpd(rgd))
297 fs_err(sdp, "used metadata mismatch: %u != %u\n",
298 count[3], rgd->rd_dinodes);
302 if (count[2] > count[3]) {
303 if (gfs2_consist_rgrpd(rgd))
304 fs_err(sdp, "unlinked inodes > inodes: %u\n",
311 static inline int rgrp_contains_block(struct gfs2_rgrpd *rgd, u64 block)
313 u64 first = rgd->rd_data0;
314 u64 last = first + rgd->rd_data;
315 return first <= block && block < last;
319 * gfs2_blk2rgrpd - Find resource group for a given data/meta block number
320 * @sdp: The GFS2 superblock
321 * @n: The data block number
323 * Returns: The resource group, or NULL if not found
326 struct gfs2_rgrpd *gfs2_blk2rgrpd(struct gfs2_sbd *sdp, u64 blk)
328 struct gfs2_rgrpd *rgd;
330 spin_lock(&sdp->sd_rindex_spin);
332 list_for_each_entry(rgd, &sdp->sd_rindex_mru_list, rd_list_mru) {
333 if (rgrp_contains_block(rgd, blk)) {
334 list_move(&rgd->rd_list_mru, &sdp->sd_rindex_mru_list);
335 spin_unlock(&sdp->sd_rindex_spin);
340 spin_unlock(&sdp->sd_rindex_spin);
346 * gfs2_rgrpd_get_first - get the first Resource Group in the filesystem
347 * @sdp: The GFS2 superblock
349 * Returns: The first rgrp in the filesystem
352 struct gfs2_rgrpd *gfs2_rgrpd_get_first(struct gfs2_sbd *sdp)
354 gfs2_assert(sdp, !list_empty(&sdp->sd_rindex_list));
355 return list_entry(sdp->sd_rindex_list.next, struct gfs2_rgrpd, rd_list);
359 * gfs2_rgrpd_get_next - get the next RG
362 * Returns: The next rgrp
365 struct gfs2_rgrpd *gfs2_rgrpd_get_next(struct gfs2_rgrpd *rgd)
367 if (rgd->rd_list.next == &rgd->rd_sbd->sd_rindex_list)
369 return list_entry(rgd->rd_list.next, struct gfs2_rgrpd, rd_list);
372 static void clear_rgrpdi(struct gfs2_sbd *sdp)
374 struct list_head *head;
375 struct gfs2_rgrpd *rgd;
376 struct gfs2_glock *gl;
378 spin_lock(&sdp->sd_rindex_spin);
379 sdp->sd_rindex_forward = NULL;
380 spin_unlock(&sdp->sd_rindex_spin);
382 head = &sdp->sd_rindex_list;
383 while (!list_empty(head)) {
384 rgd = list_entry(head->next, struct gfs2_rgrpd, rd_list);
387 list_del(&rgd->rd_list);
388 list_del(&rgd->rd_list_mru);
391 gl->gl_object = NULL;
396 kmem_cache_free(gfs2_rgrpd_cachep, rgd);
400 void gfs2_clear_rgrpd(struct gfs2_sbd *sdp)
402 mutex_lock(&sdp->sd_rindex_mutex);
404 mutex_unlock(&sdp->sd_rindex_mutex);
407 static void gfs2_rindex_print(const struct gfs2_rgrpd *rgd)
409 printk(KERN_INFO " ri_addr = %llu\n", (unsigned long long)rgd->rd_addr);
410 printk(KERN_INFO " ri_length = %u\n", rgd->rd_length);
411 printk(KERN_INFO " ri_data0 = %llu\n", (unsigned long long)rgd->rd_data0);
412 printk(KERN_INFO " ri_data = %u\n", rgd->rd_data);
413 printk(KERN_INFO " ri_bitbytes = %u\n", rgd->rd_bitbytes);
417 * gfs2_compute_bitstructs - Compute the bitmap sizes
418 * @rgd: The resource group descriptor
420 * Calculates bitmap descriptors, one for each block that contains bitmap data
425 static int compute_bitstructs(struct gfs2_rgrpd *rgd)
427 struct gfs2_sbd *sdp = rgd->rd_sbd;
428 struct gfs2_bitmap *bi;
429 u32 length = rgd->rd_length; /* # blocks in hdr & bitmap */
430 u32 bytes_left, bytes;
436 rgd->rd_bits = kcalloc(length, sizeof(struct gfs2_bitmap), GFP_NOFS);
440 bytes_left = rgd->rd_bitbytes;
442 for (x = 0; x < length; x++) {
443 bi = rgd->rd_bits + x;
445 /* small rgrp; bitmap stored completely in header block */
448 bi->bi_offset = sizeof(struct gfs2_rgrp);
453 bytes = sdp->sd_sb.sb_bsize - sizeof(struct gfs2_rgrp);
454 bi->bi_offset = sizeof(struct gfs2_rgrp);
458 } else if (x + 1 == length) {
460 bi->bi_offset = sizeof(struct gfs2_meta_header);
461 bi->bi_start = rgd->rd_bitbytes - bytes_left;
465 bytes = sdp->sd_sb.sb_bsize -
466 sizeof(struct gfs2_meta_header);
467 bi->bi_offset = sizeof(struct gfs2_meta_header);
468 bi->bi_start = rgd->rd_bitbytes - bytes_left;
476 gfs2_consist_rgrpd(rgd);
479 bi = rgd->rd_bits + (length - 1);
480 if ((bi->bi_start + bi->bi_len) * GFS2_NBBY != rgd->rd_data) {
481 if (gfs2_consist_rgrpd(rgd)) {
482 gfs2_rindex_print(rgd);
483 fs_err(sdp, "start=%u len=%u offset=%u\n",
484 bi->bi_start, bi->bi_len, bi->bi_offset);
493 * gfs2_ri_total - Total up the file system space, according to the rindex.
496 u64 gfs2_ri_total(struct gfs2_sbd *sdp)
499 struct inode *inode = sdp->sd_rindex;
500 struct gfs2_inode *ip = GFS2_I(inode);
501 char buf[sizeof(struct gfs2_rindex)];
502 struct file_ra_state ra_state;
505 mutex_lock(&sdp->sd_rindex_mutex);
506 file_ra_state_init(&ra_state, inode->i_mapping);
507 for (rgrps = 0;; rgrps++) {
508 loff_t pos = rgrps * sizeof(struct gfs2_rindex);
510 if (pos + sizeof(struct gfs2_rindex) >= ip->i_disksize)
512 error = gfs2_internal_read(ip, &ra_state, buf, &pos,
513 sizeof(struct gfs2_rindex));
514 if (error != sizeof(struct gfs2_rindex))
516 total_data += be32_to_cpu(((struct gfs2_rindex *)buf)->ri_data);
518 mutex_unlock(&sdp->sd_rindex_mutex);
522 static void gfs2_rindex_in(struct gfs2_rgrpd *rgd, const void *buf)
524 const struct gfs2_rindex *str = buf;
526 rgd->rd_addr = be64_to_cpu(str->ri_addr);
527 rgd->rd_length = be32_to_cpu(str->ri_length);
528 rgd->rd_data0 = be64_to_cpu(str->ri_data0);
529 rgd->rd_data = be32_to_cpu(str->ri_data);
530 rgd->rd_bitbytes = be32_to_cpu(str->ri_bitbytes);
534 * read_rindex_entry - Pull in a new resource index entry from the disk
535 * @gl: The glock covering the rindex inode
537 * Returns: 0 on success, error code otherwise
540 static int read_rindex_entry(struct gfs2_inode *ip,
541 struct file_ra_state *ra_state)
543 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
544 loff_t pos = sdp->sd_rgrps * sizeof(struct gfs2_rindex);
545 char buf[sizeof(struct gfs2_rindex)];
547 struct gfs2_rgrpd *rgd;
549 error = gfs2_internal_read(ip, ra_state, buf, &pos,
550 sizeof(struct gfs2_rindex));
553 if (error != sizeof(struct gfs2_rindex)) {
559 rgd = kmem_cache_zalloc(gfs2_rgrpd_cachep, GFP_NOFS);
564 mutex_init(&rgd->rd_mutex);
565 lops_init_le(&rgd->rd_le, &gfs2_rg_lops);
568 list_add_tail(&rgd->rd_list, &sdp->sd_rindex_list);
569 list_add_tail(&rgd->rd_list_mru, &sdp->sd_rindex_mru_list);
571 gfs2_rindex_in(rgd, buf);
572 error = compute_bitstructs(rgd);
576 error = gfs2_glock_get(sdp, rgd->rd_addr,
577 &gfs2_rgrp_glops, CREATE, &rgd->rd_gl);
581 rgd->rd_gl->gl_object = rgd;
582 rgd->rd_flags &= ~GFS2_RDF_UPTODATE;
583 rgd->rd_flags |= GFS2_RDF_CHECK;
588 * gfs2_ri_update - Pull in a new resource index from the disk
589 * @ip: pointer to the rindex inode
591 * Returns: 0 on successful update, error code otherwise
594 static int gfs2_ri_update(struct gfs2_inode *ip)
596 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
597 struct inode *inode = &ip->i_inode;
598 struct file_ra_state ra_state;
599 u64 rgrp_count = ip->i_disksize;
602 if (do_div(rgrp_count, sizeof(struct gfs2_rindex))) {
603 gfs2_consist_inode(ip);
609 file_ra_state_init(&ra_state, inode->i_mapping);
610 for (sdp->sd_rgrps = 0; sdp->sd_rgrps < rgrp_count; sdp->sd_rgrps++) {
611 error = read_rindex_entry(ip, &ra_state);
618 sdp->sd_rindex_uptodate = 1;
623 * gfs2_ri_update_special - Pull in a new resource index from the disk
625 * This is a special version that's safe to call from gfs2_inplace_reserve_i.
626 * In this case we know that we don't have any resource groups in memory yet.
628 * @ip: pointer to the rindex inode
630 * Returns: 0 on successful update, error code otherwise
632 static int gfs2_ri_update_special(struct gfs2_inode *ip)
634 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
635 struct inode *inode = &ip->i_inode;
636 struct file_ra_state ra_state;
639 file_ra_state_init(&ra_state, inode->i_mapping);
640 for (sdp->sd_rgrps = 0;; sdp->sd_rgrps++) {
641 /* Ignore partials */
642 if ((sdp->sd_rgrps + 1) * sizeof(struct gfs2_rindex) >
645 error = read_rindex_entry(ip, &ra_state);
652 sdp->sd_rindex_uptodate = 1;
657 * gfs2_rindex_hold - Grab a lock on the rindex
658 * @sdp: The GFS2 superblock
659 * @ri_gh: the glock holder
661 * We grab a lock on the rindex inode to make sure that it doesn't
662 * change whilst we are performing an operation. We keep this lock
663 * for quite long periods of time compared to other locks. This
664 * doesn't matter, since it is shared and it is very, very rarely
665 * accessed in the exclusive mode (i.e. only when expanding the filesystem).
667 * This makes sure that we're using the latest copy of the resource index
668 * special file, which might have been updated if someone expanded the
669 * filesystem (via gfs2_grow utility), which adds new resource groups.
671 * Returns: 0 on success, error code otherwise
674 int gfs2_rindex_hold(struct gfs2_sbd *sdp, struct gfs2_holder *ri_gh)
676 struct gfs2_inode *ip = GFS2_I(sdp->sd_rindex);
677 struct gfs2_glock *gl = ip->i_gl;
680 error = gfs2_glock_nq_init(gl, LM_ST_SHARED, 0, ri_gh);
684 /* Read new copy from disk if we don't have the latest */
685 if (!sdp->sd_rindex_uptodate) {
686 mutex_lock(&sdp->sd_rindex_mutex);
687 if (!sdp->sd_rindex_uptodate) {
688 error = gfs2_ri_update(ip);
690 gfs2_glock_dq_uninit(ri_gh);
692 mutex_unlock(&sdp->sd_rindex_mutex);
698 static void gfs2_rgrp_in(struct gfs2_rgrpd *rgd, const void *buf)
700 const struct gfs2_rgrp *str = buf;
703 rg_flags = be32_to_cpu(str->rg_flags);
704 rg_flags &= ~GFS2_RDF_MASK;
705 rgd->rd_free = be32_to_cpu(str->rg_free);
706 rgd->rd_dinodes = be32_to_cpu(str->rg_dinodes);
707 rgd->rd_igeneration = be64_to_cpu(str->rg_igeneration);
710 static void gfs2_rgrp_out(struct gfs2_rgrpd *rgd, void *buf)
712 struct gfs2_rgrp *str = buf;
714 str->rg_flags = cpu_to_be32(rgd->rd_flags & ~GFS2_RDF_MASK);
715 str->rg_free = cpu_to_be32(rgd->rd_free);
716 str->rg_dinodes = cpu_to_be32(rgd->rd_dinodes);
717 str->__pad = cpu_to_be32(0);
718 str->rg_igeneration = cpu_to_be64(rgd->rd_igeneration);
719 memset(&str->rg_reserved, 0, sizeof(str->rg_reserved));
723 * gfs2_rgrp_bh_get - Read in a RG's header and bitmaps
724 * @rgd: the struct gfs2_rgrpd describing the RG to read in
726 * Read in all of a Resource Group's header and bitmap blocks.
727 * Caller must eventually call gfs2_rgrp_relse() to free the bitmaps.
732 int gfs2_rgrp_bh_get(struct gfs2_rgrpd *rgd)
734 struct gfs2_sbd *sdp = rgd->rd_sbd;
735 struct gfs2_glock *gl = rgd->rd_gl;
736 unsigned int length = rgd->rd_length;
737 struct gfs2_bitmap *bi;
741 mutex_lock(&rgd->rd_mutex);
743 spin_lock(&sdp->sd_rindex_spin);
744 if (rgd->rd_bh_count) {
746 spin_unlock(&sdp->sd_rindex_spin);
747 mutex_unlock(&rgd->rd_mutex);
750 spin_unlock(&sdp->sd_rindex_spin);
752 for (x = 0; x < length; x++) {
753 bi = rgd->rd_bits + x;
754 error = gfs2_meta_read(gl, rgd->rd_addr + x, 0, &bi->bi_bh);
759 for (y = length; y--;) {
760 bi = rgd->rd_bits + y;
761 error = gfs2_meta_wait(sdp, bi->bi_bh);
764 if (gfs2_metatype_check(sdp, bi->bi_bh, y ? GFS2_METATYPE_RB :
771 if (!(rgd->rd_flags & GFS2_RDF_UPTODATE)) {
772 gfs2_rgrp_in(rgd, (rgd->rd_bits[0].bi_bh)->b_data);
773 rgd->rd_flags |= GFS2_RDF_UPTODATE;
776 spin_lock(&sdp->sd_rindex_spin);
777 rgd->rd_free_clone = rgd->rd_free;
779 spin_unlock(&sdp->sd_rindex_spin);
781 mutex_unlock(&rgd->rd_mutex);
787 bi = rgd->rd_bits + x;
790 gfs2_assert_warn(sdp, !bi->bi_clone);
792 mutex_unlock(&rgd->rd_mutex);
797 void gfs2_rgrp_bh_hold(struct gfs2_rgrpd *rgd)
799 struct gfs2_sbd *sdp = rgd->rd_sbd;
801 spin_lock(&sdp->sd_rindex_spin);
802 gfs2_assert_warn(rgd->rd_sbd, rgd->rd_bh_count);
804 spin_unlock(&sdp->sd_rindex_spin);
808 * gfs2_rgrp_bh_put - Release RG bitmaps read in with gfs2_rgrp_bh_get()
809 * @rgd: the struct gfs2_rgrpd describing the RG to read in
813 void gfs2_rgrp_bh_put(struct gfs2_rgrpd *rgd)
815 struct gfs2_sbd *sdp = rgd->rd_sbd;
816 int x, length = rgd->rd_length;
818 spin_lock(&sdp->sd_rindex_spin);
819 gfs2_assert_warn(rgd->rd_sbd, rgd->rd_bh_count);
820 if (--rgd->rd_bh_count) {
821 spin_unlock(&sdp->sd_rindex_spin);
825 for (x = 0; x < length; x++) {
826 struct gfs2_bitmap *bi = rgd->rd_bits + x;
833 spin_unlock(&sdp->sd_rindex_spin);
836 static void gfs2_rgrp_send_discards(struct gfs2_sbd *sdp, u64 offset,
837 const struct gfs2_bitmap *bi)
839 struct super_block *sb = sdp->sd_vfs;
840 struct block_device *bdev = sb->s_bdev;
841 const unsigned int sects_per_blk = sdp->sd_sb.sb_bsize /
842 bdev_hardsect_size(sb->s_bdev);
845 sector_t nr_sects = 0;
849 for (x = 0; x < bi->bi_len; x++) {
850 const u8 *orig = bi->bi_bh->b_data + bi->bi_offset + x;
851 const u8 *clone = bi->bi_clone + bi->bi_offset + x;
852 u8 diff = ~(*orig | (*orig >> 1)) & (*clone | (*clone >> 1));
856 blk = offset + ((bi->bi_start + x) * GFS2_NBBY);
857 blk *= sects_per_blk; /* convert to sectors */
861 goto start_new_extent;
862 if ((start + nr_sects) != blk) {
863 rv = blkdev_issue_discard(bdev, start,
871 nr_sects += sects_per_blk;
874 blk += sects_per_blk;
878 rv = blkdev_issue_discard(bdev, start, nr_sects, GFP_NOFS);
884 fs_warn(sdp, "error %d on discard request, turning discards off for this filesystem", rv);
885 sdp->sd_args.ar_discard = 0;
888 void gfs2_rgrp_repolish_clones(struct gfs2_rgrpd *rgd)
890 struct gfs2_sbd *sdp = rgd->rd_sbd;
891 unsigned int length = rgd->rd_length;
894 for (x = 0; x < length; x++) {
895 struct gfs2_bitmap *bi = rgd->rd_bits + x;
898 if (sdp->sd_args.ar_discard)
899 gfs2_rgrp_send_discards(sdp, rgd->rd_data0, bi);
900 memcpy(bi->bi_clone + bi->bi_offset,
901 bi->bi_bh->b_data + bi->bi_offset, bi->bi_len);
904 spin_lock(&sdp->sd_rindex_spin);
905 rgd->rd_free_clone = rgd->rd_free;
906 spin_unlock(&sdp->sd_rindex_spin);
910 * gfs2_alloc_get - get the struct gfs2_alloc structure for an inode
911 * @ip: the incore GFS2 inode structure
913 * Returns: the struct gfs2_alloc
916 struct gfs2_alloc *gfs2_alloc_get(struct gfs2_inode *ip)
918 BUG_ON(ip->i_alloc != NULL);
919 ip->i_alloc = kzalloc(sizeof(struct gfs2_alloc), GFP_KERNEL);
924 * try_rgrp_fit - See if a given reservation will fit in a given RG
926 * @al: the struct gfs2_alloc structure describing the reservation
928 * If there's room for the requested blocks to be allocated from the RG:
929 * Sets the $al_rgd field in @al.
931 * Returns: 1 on success (it fits), 0 on failure (it doesn't fit)
934 static int try_rgrp_fit(struct gfs2_rgrpd *rgd, struct gfs2_alloc *al)
936 struct gfs2_sbd *sdp = rgd->rd_sbd;
939 if (rgd->rd_flags & (GFS2_RGF_NOALLOC | GFS2_RDF_ERROR))
942 spin_lock(&sdp->sd_rindex_spin);
943 if (rgd->rd_free_clone >= al->al_requested) {
947 spin_unlock(&sdp->sd_rindex_spin);
953 * try_rgrp_unlink - Look for any unlinked, allocated, but unused inodes
956 * Returns: The inode, if one has been found
959 static struct inode *try_rgrp_unlink(struct gfs2_rgrpd *rgd, u64 *last_unlinked)
964 struct gfs2_sbd *sdp = rgd->rd_sbd;
968 if (goal >= rgd->rd_data)
970 down_write(&sdp->sd_log_flush_lock);
972 block = rgblk_search(rgd, goal, GFS2_BLKST_UNLINKED,
973 GFS2_BLKST_UNLINKED, &n);
974 up_write(&sdp->sd_log_flush_lock);
975 if (block == BFITNOENT)
977 /* rgblk_search can return a block < goal, so we need to
978 keep it marching forward. */
979 no_addr = block + rgd->rd_data0;
981 if (*last_unlinked != NO_BLOCK && no_addr <= *last_unlinked)
983 *last_unlinked = no_addr;
984 inode = gfs2_inode_lookup(rgd->rd_sbd->sd_vfs, DT_UNKNOWN,
990 rgd->rd_flags &= ~GFS2_RDF_CHECK;
995 * recent_rgrp_next - get next RG from "recent" list
996 * @cur_rgd: current rgrp
998 * Returns: The next rgrp in the recent list
1001 static struct gfs2_rgrpd *recent_rgrp_next(struct gfs2_rgrpd *cur_rgd)
1003 struct gfs2_sbd *sdp = cur_rgd->rd_sbd;
1004 struct list_head *head;
1005 struct gfs2_rgrpd *rgd;
1007 spin_lock(&sdp->sd_rindex_spin);
1008 head = &sdp->sd_rindex_mru_list;
1009 if (unlikely(cur_rgd->rd_list_mru.next == head)) {
1010 spin_unlock(&sdp->sd_rindex_spin);
1013 rgd = list_entry(cur_rgd->rd_list_mru.next, struct gfs2_rgrpd, rd_list_mru);
1014 spin_unlock(&sdp->sd_rindex_spin);
1019 * forward_rgrp_get - get an rgrp to try next from full list
1020 * @sdp: The GFS2 superblock
1022 * Returns: The rgrp to try next
1025 static struct gfs2_rgrpd *forward_rgrp_get(struct gfs2_sbd *sdp)
1027 struct gfs2_rgrpd *rgd;
1028 unsigned int journals = gfs2_jindex_size(sdp);
1029 unsigned int rg = 0, x;
1031 spin_lock(&sdp->sd_rindex_spin);
1033 rgd = sdp->sd_rindex_forward;
1035 if (sdp->sd_rgrps >= journals)
1036 rg = sdp->sd_rgrps * sdp->sd_jdesc->jd_jid / journals;
1038 for (x = 0, rgd = gfs2_rgrpd_get_first(sdp); x < rg;
1039 x++, rgd = gfs2_rgrpd_get_next(rgd))
1042 sdp->sd_rindex_forward = rgd;
1045 spin_unlock(&sdp->sd_rindex_spin);
1051 * forward_rgrp_set - set the forward rgrp pointer
1052 * @sdp: the filesystem
1053 * @rgd: The new forward rgrp
1057 static void forward_rgrp_set(struct gfs2_sbd *sdp, struct gfs2_rgrpd *rgd)
1059 spin_lock(&sdp->sd_rindex_spin);
1060 sdp->sd_rindex_forward = rgd;
1061 spin_unlock(&sdp->sd_rindex_spin);
1065 * get_local_rgrp - Choose and lock a rgrp for allocation
1066 * @ip: the inode to reserve space for
1067 * @rgp: the chosen and locked rgrp
1069 * Try to acquire rgrp in way which avoids contending with others.
1074 static struct inode *get_local_rgrp(struct gfs2_inode *ip, u64 *last_unlinked)
1076 struct inode *inode = NULL;
1077 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1078 struct gfs2_rgrpd *rgd, *begin = NULL;
1079 struct gfs2_alloc *al = ip->i_alloc;
1080 int flags = LM_FLAG_TRY;
1083 int error, rg_locked;
1085 rgd = gfs2_blk2rgrpd(sdp, ip->i_goal);
1090 if (gfs2_glock_is_locked_by_me(rgd->rd_gl)) {
1094 error = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_EXCLUSIVE,
1095 LM_FLAG_TRY, &al->al_rgd_gh);
1099 if (try_rgrp_fit(rgd, al))
1101 if (rgd->rd_flags & GFS2_RDF_CHECK)
1102 inode = try_rgrp_unlink(rgd, last_unlinked);
1104 gfs2_glock_dq_uninit(&al->al_rgd_gh);
1109 rgd = recent_rgrp_next(rgd);
1113 return ERR_PTR(error);
1117 /* Go through full list of rgrps */
1119 begin = rgd = forward_rgrp_get(sdp);
1124 if (gfs2_glock_is_locked_by_me(rgd->rd_gl)) {
1128 error = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_EXCLUSIVE, flags,
1133 if (try_rgrp_fit(rgd, al))
1135 if (rgd->rd_flags & GFS2_RDF_CHECK)
1136 inode = try_rgrp_unlink(rgd, last_unlinked);
1138 gfs2_glock_dq_uninit(&al->al_rgd_gh);
1148 return ERR_PTR(error);
1151 rgd = gfs2_rgrpd_get_next(rgd);
1153 rgd = gfs2_rgrpd_get_first(sdp);
1157 return ERR_PTR(-ENOSPC);
1162 gfs2_log_flush(sdp, NULL);
1168 spin_lock(&sdp->sd_rindex_spin);
1169 list_move(&rgd->rd_list_mru, &sdp->sd_rindex_mru_list);
1170 spin_unlock(&sdp->sd_rindex_spin);
1171 rgd = gfs2_rgrpd_get_next(rgd);
1173 rgd = gfs2_rgrpd_get_first(sdp);
1174 forward_rgrp_set(sdp, rgd);
1181 * gfs2_inplace_reserve_i - Reserve space in the filesystem
1182 * @ip: the inode to reserve space for
1187 int gfs2_inplace_reserve_i(struct gfs2_inode *ip, char *file, unsigned int line)
1189 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1190 struct gfs2_alloc *al = ip->i_alloc;
1191 struct inode *inode;
1193 u64 last_unlinked = NO_BLOCK;
1195 if (gfs2_assert_warn(sdp, al->al_requested))
1199 /* We need to hold the rindex unless the inode we're using is
1200 the rindex itself, in which case it's already held. */
1201 if (ip != GFS2_I(sdp->sd_rindex))
1202 error = gfs2_rindex_hold(sdp, &al->al_ri_gh);
1203 else if (!sdp->sd_rgrps) /* We may not have the rindex read in, so: */
1204 error = gfs2_ri_update_special(ip);
1209 inode = get_local_rgrp(ip, &last_unlinked);
1211 if (ip != GFS2_I(sdp->sd_rindex))
1212 gfs2_glock_dq_uninit(&al->al_ri_gh);
1214 return PTR_ERR(inode);
1216 gfs2_log_flush(sdp, NULL);
1227 * gfs2_inplace_release - release an inplace reservation
1228 * @ip: the inode the reservation was taken out on
1230 * Release a reservation made by gfs2_inplace_reserve().
1233 void gfs2_inplace_release(struct gfs2_inode *ip)
1235 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1236 struct gfs2_alloc *al = ip->i_alloc;
1238 if (gfs2_assert_warn(sdp, al->al_alloced <= al->al_requested) == -1)
1239 fs_warn(sdp, "al_alloced = %u, al_requested = %u "
1240 "al_file = %s, al_line = %u\n",
1241 al->al_alloced, al->al_requested, al->al_file,
1245 if (al->al_rgd_gh.gh_gl)
1246 gfs2_glock_dq_uninit(&al->al_rgd_gh);
1247 if (ip != GFS2_I(sdp->sd_rindex))
1248 gfs2_glock_dq_uninit(&al->al_ri_gh);
1252 * gfs2_get_block_type - Check a block in a RG is of given type
1253 * @rgd: the resource group holding the block
1254 * @block: the block number
1256 * Returns: The block type (GFS2_BLKST_*)
1259 unsigned char gfs2_get_block_type(struct gfs2_rgrpd *rgd, u64 block)
1261 struct gfs2_bitmap *bi = NULL;
1262 u32 length, rgrp_block, buf_block;
1266 length = rgd->rd_length;
1267 rgrp_block = block - rgd->rd_data0;
1269 for (buf = 0; buf < length; buf++) {
1270 bi = rgd->rd_bits + buf;
1271 if (rgrp_block < (bi->bi_start + bi->bi_len) * GFS2_NBBY)
1275 gfs2_assert(rgd->rd_sbd, buf < length);
1276 buf_block = rgrp_block - bi->bi_start * GFS2_NBBY;
1278 type = gfs2_testbit(rgd, bi->bi_bh->b_data + bi->bi_offset,
1279 bi->bi_len, buf_block);
1285 * rgblk_search - find a block in @old_state, change allocation
1286 * state to @new_state
1287 * @rgd: the resource group descriptor
1288 * @goal: the goal block within the RG (start here to search for avail block)
1289 * @old_state: GFS2_BLKST_XXX the before-allocation state to find
1290 * @new_state: GFS2_BLKST_XXX the after-allocation block state
1291 * @n: The extent length
1293 * Walk rgrp's bitmap to find bits that represent a block in @old_state.
1294 * Add the found bitmap buffer to the transaction.
1295 * Set the found bits to @new_state to change block's allocation state.
1297 * This function never fails, because we wouldn't call it unless we
1298 * know (from reservation results, etc.) that a block is available.
1300 * Scope of @goal and returned block is just within rgrp, not the whole
1303 * Returns: the block number allocated
1306 static u32 rgblk_search(struct gfs2_rgrpd *rgd, u32 goal,
1307 unsigned char old_state, unsigned char new_state,
1310 struct gfs2_bitmap *bi = NULL;
1311 const u32 length = rgd->rd_length;
1313 unsigned int buf, x;
1314 const unsigned int elen = *n;
1318 /* Find bitmap block that contains bits for goal block */
1319 for (buf = 0; buf < length; buf++) {
1320 bi = rgd->rd_bits + buf;
1321 if (goal < (bi->bi_start + bi->bi_len) * GFS2_NBBY)
1325 gfs2_assert(rgd->rd_sbd, buf < length);
1327 /* Convert scope of "goal" from rgrp-wide to within found bit block */
1328 goal -= bi->bi_start * GFS2_NBBY;
1330 /* Search (up to entire) bitmap in this rgrp for allocatable block.
1331 "x <= length", instead of "x < length", because we typically start
1332 the search in the middle of a bit block, but if we can't find an
1333 allocatable block anywhere else, we want to be able wrap around and
1334 search in the first part of our first-searched bit block. */
1335 for (x = 0; x <= length; x++) {
1336 /* The GFS2_BLKST_UNLINKED state doesn't apply to the clone
1337 bitmaps, so we must search the originals for that. */
1338 buffer = bi->bi_bh->b_data + bi->bi_offset;
1339 if (old_state != GFS2_BLKST_UNLINKED && bi->bi_clone)
1340 buffer = bi->bi_clone + bi->bi_offset;
1342 blk = gfs2_bitfit(buffer, bi->bi_len, goal, old_state);
1343 if (blk != BFITNOENT)
1346 /* Try next bitmap block (wrap back to rgrp header if at end) */
1347 buf = (buf + 1) % length;
1348 bi = rgd->rd_bits + buf;
1352 if (blk != BFITNOENT && old_state != new_state) {
1354 gfs2_trans_add_bh(rgd->rd_gl, bi->bi_bh, 1);
1355 gfs2_setbit(rgd, bi->bi_bh->b_data, bi->bi_clone, bi->bi_offset,
1356 bi->bi_len, blk, new_state);
1360 if (goal >= (bi->bi_len * GFS2_NBBY))
1362 if (gfs2_testbit(rgd, buffer, bi->bi_len, goal) !=
1365 gfs2_setbit(rgd, bi->bi_bh->b_data, bi->bi_clone,
1366 bi->bi_offset, bi->bi_len, goal,
1372 return (blk == BFITNOENT) ? blk : (bi->bi_start * GFS2_NBBY) + blk;
1376 * rgblk_free - Change alloc state of given block(s)
1377 * @sdp: the filesystem
1378 * @bstart: the start of a run of blocks to free
1379 * @blen: the length of the block run (all must lie within ONE RG!)
1380 * @new_state: GFS2_BLKST_XXX the after-allocation block state
1382 * Returns: Resource group containing the block(s)
1385 static struct gfs2_rgrpd *rgblk_free(struct gfs2_sbd *sdp, u64 bstart,
1386 u32 blen, unsigned char new_state)
1388 struct gfs2_rgrpd *rgd;
1389 struct gfs2_bitmap *bi = NULL;
1390 u32 length, rgrp_blk, buf_blk;
1393 rgd = gfs2_blk2rgrpd(sdp, bstart);
1395 if (gfs2_consist(sdp))
1396 fs_err(sdp, "block = %llu\n", (unsigned long long)bstart);
1400 length = rgd->rd_length;
1402 rgrp_blk = bstart - rgd->rd_data0;
1405 for (buf = 0; buf < length; buf++) {
1406 bi = rgd->rd_bits + buf;
1407 if (rgrp_blk < (bi->bi_start + bi->bi_len) * GFS2_NBBY)
1411 gfs2_assert(rgd->rd_sbd, buf < length);
1413 buf_blk = rgrp_blk - bi->bi_start * GFS2_NBBY;
1416 if (!bi->bi_clone) {
1417 bi->bi_clone = kmalloc(bi->bi_bh->b_size,
1418 GFP_NOFS | __GFP_NOFAIL);
1419 memcpy(bi->bi_clone + bi->bi_offset,
1420 bi->bi_bh->b_data + bi->bi_offset,
1423 gfs2_trans_add_bh(rgd->rd_gl, bi->bi_bh, 1);
1424 gfs2_setbit(rgd, bi->bi_bh->b_data, NULL, bi->bi_offset,
1425 bi->bi_len, buf_blk, new_state);
1432 * gfs2_rgrp_dump - print out an rgrp
1433 * @seq: The iterator
1434 * @gl: The glock in question
1438 int gfs2_rgrp_dump(struct seq_file *seq, const struct gfs2_glock *gl)
1440 const struct gfs2_rgrpd *rgd = gl->gl_object;
1443 gfs2_print_dbg(seq, " R: n:%llu f:%02x b:%u/%u i:%u\n",
1444 (unsigned long long)rgd->rd_addr, rgd->rd_flags,
1445 rgd->rd_free, rgd->rd_free_clone, rgd->rd_dinodes);
1450 * gfs2_alloc_block - Allocate one or more blocks
1451 * @ip: the inode to allocate the block for
1452 * @bn: Used to return the starting block number
1453 * @n: requested number of blocks/extent length (value/result)
1455 * Returns: 0 or error
1458 int gfs2_alloc_block(struct gfs2_inode *ip, u64 *bn, unsigned int *n)
1460 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1461 struct buffer_head *dibh;
1462 struct gfs2_alloc *al = ip->i_alloc;
1463 struct gfs2_rgrpd *rgd = al->al_rgd;
1468 if (rgrp_contains_block(rgd, ip->i_goal))
1469 goal = ip->i_goal - rgd->rd_data0;
1471 goal = rgd->rd_last_alloc;
1473 blk = rgblk_search(rgd, goal, GFS2_BLKST_FREE, GFS2_BLKST_USED, n);
1475 /* Since all blocks are reserved in advance, this shouldn't happen */
1476 if (blk == BFITNOENT)
1479 rgd->rd_last_alloc = blk;
1480 block = rgd->rd_data0 + blk;
1482 error = gfs2_meta_inode_buffer(ip, &dibh);
1484 struct gfs2_dinode *di = (struct gfs2_dinode *)dibh->b_data;
1485 gfs2_trans_add_bh(ip->i_gl, dibh, 1);
1486 di->di_goal_meta = di->di_goal_data = cpu_to_be64(ip->i_goal);
1489 if (rgd->rd_free < *n)
1494 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1495 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
1497 al->al_alloced += *n;
1499 gfs2_statfs_change(sdp, 0, -(s64)*n, 0);
1500 gfs2_quota_change(ip, *n, ip->i_inode.i_uid, ip->i_inode.i_gid);
1502 spin_lock(&sdp->sd_rindex_spin);
1503 rgd->rd_free_clone -= *n;
1504 spin_unlock(&sdp->sd_rindex_spin);
1510 fs_warn(sdp, "rgrp %llu has an error, marking it readonly until umount\n",
1511 (unsigned long long)rgd->rd_addr);
1512 fs_warn(sdp, "umount on all nodes and run fsck.gfs2 to fix the error\n");
1513 gfs2_rgrp_dump(NULL, rgd->rd_gl);
1514 rgd->rd_flags |= GFS2_RDF_ERROR;
1519 * gfs2_alloc_di - Allocate a dinode
1520 * @dip: the directory that the inode is going in
1522 * Returns: the block allocated
1525 u64 gfs2_alloc_di(struct gfs2_inode *dip, u64 *generation)
1527 struct gfs2_sbd *sdp = GFS2_SB(&dip->i_inode);
1528 struct gfs2_alloc *al = dip->i_alloc;
1529 struct gfs2_rgrpd *rgd = al->al_rgd;
1534 blk = rgblk_search(rgd, rgd->rd_last_alloc,
1535 GFS2_BLKST_FREE, GFS2_BLKST_DINODE, &n);
1536 BUG_ON(blk == BFITNOENT);
1538 rgd->rd_last_alloc = blk;
1540 block = rgd->rd_data0 + blk;
1542 gfs2_assert_withdraw(sdp, rgd->rd_free);
1545 *generation = rgd->rd_igeneration++;
1546 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1547 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
1551 gfs2_statfs_change(sdp, 0, -1, +1);
1552 gfs2_trans_add_unrevoke(sdp, block, 1);
1554 spin_lock(&sdp->sd_rindex_spin);
1555 rgd->rd_free_clone--;
1556 spin_unlock(&sdp->sd_rindex_spin);
1562 * gfs2_free_data - free a contiguous run of data block(s)
1563 * @ip: the inode these blocks are being freed from
1564 * @bstart: first block of a run of contiguous blocks
1565 * @blen: the length of the block run
1569 void gfs2_free_data(struct gfs2_inode *ip, u64 bstart, u32 blen)
1571 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1572 struct gfs2_rgrpd *rgd;
1574 rgd = rgblk_free(sdp, bstart, blen, GFS2_BLKST_FREE);
1578 rgd->rd_free += blen;
1580 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1581 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
1583 gfs2_trans_add_rg(rgd);
1585 gfs2_statfs_change(sdp, 0, +blen, 0);
1586 gfs2_quota_change(ip, -(s64)blen, ip->i_inode.i_uid, ip->i_inode.i_gid);
1590 * gfs2_free_meta - free a contiguous run of data block(s)
1591 * @ip: the inode these blocks are being freed from
1592 * @bstart: first block of a run of contiguous blocks
1593 * @blen: the length of the block run
1597 void gfs2_free_meta(struct gfs2_inode *ip, u64 bstart, u32 blen)
1599 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1600 struct gfs2_rgrpd *rgd;
1602 rgd = rgblk_free(sdp, bstart, blen, GFS2_BLKST_FREE);
1606 rgd->rd_free += blen;
1608 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1609 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
1611 gfs2_trans_add_rg(rgd);
1613 gfs2_statfs_change(sdp, 0, +blen, 0);
1614 gfs2_quota_change(ip, -(s64)blen, ip->i_inode.i_uid, ip->i_inode.i_gid);
1615 gfs2_meta_wipe(ip, bstart, blen);
1618 void gfs2_unlink_di(struct inode *inode)
1620 struct gfs2_inode *ip = GFS2_I(inode);
1621 struct gfs2_sbd *sdp = GFS2_SB(inode);
1622 struct gfs2_rgrpd *rgd;
1623 u64 blkno = ip->i_no_addr;
1625 rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_UNLINKED);
1628 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1629 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
1630 gfs2_trans_add_rg(rgd);
1633 static void gfs2_free_uninit_di(struct gfs2_rgrpd *rgd, u64 blkno)
1635 struct gfs2_sbd *sdp = rgd->rd_sbd;
1636 struct gfs2_rgrpd *tmp_rgd;
1638 tmp_rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_FREE);
1641 gfs2_assert_withdraw(sdp, rgd == tmp_rgd);
1643 if (!rgd->rd_dinodes)
1644 gfs2_consist_rgrpd(rgd);
1648 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1649 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
1651 gfs2_statfs_change(sdp, 0, +1, -1);
1652 gfs2_trans_add_rg(rgd);
1656 void gfs2_free_di(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip)
1658 gfs2_free_uninit_di(rgd, ip->i_no_addr);
1659 gfs2_quota_change(ip, -1, ip->i_inode.i_uid, ip->i_inode.i_gid);
1660 gfs2_meta_wipe(ip, ip->i_no_addr, 1);
1664 * gfs2_rlist_add - add a RG to a list of RGs
1665 * @sdp: the filesystem
1666 * @rlist: the list of resource groups
1669 * Figure out what RG a block belongs to and add that RG to the list
1671 * FIXME: Don't use NOFAIL
1675 void gfs2_rlist_add(struct gfs2_sbd *sdp, struct gfs2_rgrp_list *rlist,
1678 struct gfs2_rgrpd *rgd;
1679 struct gfs2_rgrpd **tmp;
1680 unsigned int new_space;
1683 if (gfs2_assert_warn(sdp, !rlist->rl_ghs))
1686 rgd = gfs2_blk2rgrpd(sdp, block);
1688 if (gfs2_consist(sdp))
1689 fs_err(sdp, "block = %llu\n", (unsigned long long)block);
1693 for (x = 0; x < rlist->rl_rgrps; x++)
1694 if (rlist->rl_rgd[x] == rgd)
1697 if (rlist->rl_rgrps == rlist->rl_space) {
1698 new_space = rlist->rl_space + 10;
1700 tmp = kcalloc(new_space, sizeof(struct gfs2_rgrpd *),
1701 GFP_NOFS | __GFP_NOFAIL);
1703 if (rlist->rl_rgd) {
1704 memcpy(tmp, rlist->rl_rgd,
1705 rlist->rl_space * sizeof(struct gfs2_rgrpd *));
1706 kfree(rlist->rl_rgd);
1709 rlist->rl_space = new_space;
1710 rlist->rl_rgd = tmp;
1713 rlist->rl_rgd[rlist->rl_rgrps++] = rgd;
1717 * gfs2_rlist_alloc - all RGs have been added to the rlist, now allocate
1718 * and initialize an array of glock holders for them
1719 * @rlist: the list of resource groups
1720 * @state: the lock state to acquire the RG lock in
1721 * @flags: the modifier flags for the holder structures
1723 * FIXME: Don't use NOFAIL
1727 void gfs2_rlist_alloc(struct gfs2_rgrp_list *rlist, unsigned int state)
1731 rlist->rl_ghs = kcalloc(rlist->rl_rgrps, sizeof(struct gfs2_holder),
1732 GFP_NOFS | __GFP_NOFAIL);
1733 for (x = 0; x < rlist->rl_rgrps; x++)
1734 gfs2_holder_init(rlist->rl_rgd[x]->rd_gl,
1740 * gfs2_rlist_free - free a resource group list
1741 * @list: the list of resource groups
1745 void gfs2_rlist_free(struct gfs2_rgrp_list *rlist)
1749 kfree(rlist->rl_rgd);
1751 if (rlist->rl_ghs) {
1752 for (x = 0; x < rlist->rl_rgrps; x++)
1753 gfs2_holder_uninit(&rlist->rl_ghs[x]);
1754 kfree(rlist->rl_ghs);