2 * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
3 * Copyright (C) 2004-2008 Red Hat, Inc. All rights reserved.
5 * This copyrighted material is made available to anyone wishing to use,
6 * modify, copy, or redistribute it subject to the terms and conditions
7 * of the GNU General Public License version 2.
10 #include <linux/slab.h>
11 #include <linux/spinlock.h>
12 #include <linux/completion.h>
13 #include <linux/buffer_head.h>
15 #include <linux/gfs2_ondisk.h>
16 #include <linux/prefetch.h>
17 #include <linux/blkdev.h>
18 #include <linux/rbtree.h>
33 #include "trace_gfs2.h"
35 #define BFITNOENT ((u32)~0)
36 #define NO_BLOCK ((u64)~0)
38 #if BITS_PER_LONG == 32
39 #define LBITMASK (0x55555555UL)
40 #define LBITSKIP55 (0x55555555UL)
41 #define LBITSKIP00 (0x00000000UL)
43 #define LBITMASK (0x5555555555555555UL)
44 #define LBITSKIP55 (0x5555555555555555UL)
45 #define LBITSKIP00 (0x0000000000000000UL)
49 * These routines are used by the resource group routines (rgrp.c)
50 * to keep track of block allocation. Each block is represented by two
51 * bits. So, each byte represents GFS2_NBBY (i.e. 4) blocks.
54 * 1 = Used (not metadata)
55 * 2 = Unlinked (still in use) inode
59 static const char valid_change[16] = {
67 static u32 rgblk_search(struct gfs2_rgrpd *rgd, u32 goal,
68 unsigned char old_state,
69 struct gfs2_bitmap **rbi);
72 * gfs2_setbit - Set a bit in the bitmaps
73 * @rgd: the resource group descriptor
74 * @buf1: the primary buffer that holds the bitmaps
75 * @buf2: the clone buffer that holds the bitmaps
76 * @bi: the bitmap structure
77 * @block: the block to set
78 * @new_state: the new state of the block
82 static inline void gfs2_setbit(struct gfs2_rgrpd *rgd, unsigned char *buf1,
83 unsigned char *buf2, struct gfs2_bitmap *bi,
84 u32 block, unsigned char new_state)
86 unsigned char *byte1, *byte2, *end, cur_state;
87 unsigned int buflen = bi->bi_len;
88 const unsigned int bit = (block % GFS2_NBBY) * GFS2_BIT_SIZE;
90 byte1 = buf1 + bi->bi_offset + (block / GFS2_NBBY);
91 end = buf1 + bi->bi_offset + buflen;
95 cur_state = (*byte1 >> bit) & GFS2_BIT_MASK;
97 if (unlikely(!valid_change[new_state * 4 + cur_state])) {
98 printk(KERN_WARNING "GFS2: buf_blk = 0x%llx old_state=%d, "
100 (unsigned long long)block, cur_state, new_state);
101 printk(KERN_WARNING "GFS2: rgrp=0x%llx bi_start=0x%lx\n",
102 (unsigned long long)rgd->rd_addr,
103 (unsigned long)bi->bi_start);
104 printk(KERN_WARNING "GFS2: bi_offset=0x%lx bi_len=0x%lx\n",
105 (unsigned long)bi->bi_offset,
106 (unsigned long)bi->bi_len);
108 gfs2_consist_rgrpd(rgd);
111 *byte1 ^= (cur_state ^ new_state) << bit;
114 byte2 = buf2 + bi->bi_offset + (block / GFS2_NBBY);
115 cur_state = (*byte2 >> bit) & GFS2_BIT_MASK;
116 *byte2 ^= (cur_state ^ new_state) << bit;
121 * gfs2_testbit - test a bit in the bitmaps
122 * @rgd: the resource group descriptor
123 * @buffer: the buffer that holds the bitmaps
124 * @buflen: the length (in bytes) of the buffer
125 * @block: the block to read
129 static inline unsigned char gfs2_testbit(struct gfs2_rgrpd *rgd,
130 const unsigned char *buffer,
131 unsigned int buflen, u32 block)
133 const unsigned char *byte, *end;
134 unsigned char cur_state;
137 byte = buffer + (block / GFS2_NBBY);
138 bit = (block % GFS2_NBBY) * GFS2_BIT_SIZE;
139 end = buffer + buflen;
141 gfs2_assert(rgd->rd_sbd, byte < end);
143 cur_state = (*byte >> bit) & GFS2_BIT_MASK;
150 * @ptr: Pointer to bitmap data
151 * @mask: Mask to use (normally 0x55555.... but adjusted for search start)
152 * @state: The state we are searching for
154 * We xor the bitmap data with a patter which is the bitwise opposite
155 * of what we are looking for, this gives rise to a pattern of ones
156 * wherever there is a match. Since we have two bits per entry, we
157 * take this pattern, shift it down by one place and then and it with
158 * the original. All the even bit positions (0,2,4, etc) then represent
159 * successful matches, so we mask with 0x55555..... to remove the unwanted
162 * This allows searching of a whole u64 at once (32 blocks) with a
163 * single test (on 64 bit arches).
166 static inline u64 gfs2_bit_search(const __le64 *ptr, u64 mask, u8 state)
169 static const u64 search[] = {
170 [0] = 0xffffffffffffffffULL,
171 [1] = 0xaaaaaaaaaaaaaaaaULL,
172 [2] = 0x5555555555555555ULL,
173 [3] = 0x0000000000000000ULL,
175 tmp = le64_to_cpu(*ptr) ^ search[state];
182 * gfs2_bitfit - Search an rgrp's bitmap buffer to find a bit-pair representing
183 * a block in a given allocation state.
184 * @buf: the buffer that holds the bitmaps
185 * @len: the length (in bytes) of the buffer
186 * @goal: start search at this block's bit-pair (within @buffer)
187 * @state: GFS2_BLKST_XXX the state of the block we're looking for.
189 * Scope of @goal and returned block number is only within this bitmap buffer,
190 * not entire rgrp or filesystem. @buffer will be offset from the actual
191 * beginning of a bitmap block buffer, skipping any header structures, but
192 * headers are always a multiple of 64 bits long so that the buffer is
193 * always aligned to a 64 bit boundary.
195 * The size of the buffer is in bytes, but is it assumed that it is
196 * always ok to read a complete multiple of 64 bits at the end
197 * of the block in case the end is no aligned to a natural boundary.
199 * Return: the block number (bitmap buffer scope) that was found
202 static u32 gfs2_bitfit(const u8 *buf, const unsigned int len,
205 u32 spoint = (goal << 1) & ((8*sizeof(u64)) - 1);
206 const __le64 *ptr = ((__le64 *)buf) + (goal >> 5);
207 const __le64 *end = (__le64 *)(buf + ALIGN(len, sizeof(u64)));
209 u64 mask = 0x5555555555555555ULL;
214 /* Mask off bits we don't care about at the start of the search */
216 tmp = gfs2_bit_search(ptr, mask, state);
218 while(tmp == 0 && ptr < end) {
219 tmp = gfs2_bit_search(ptr, 0x5555555555555555ULL, state);
222 /* Mask off any bits which are more than len bytes from the start */
223 if (ptr == end && (len & (sizeof(u64) - 1)))
224 tmp &= (((u64)~0) >> (64 - 8*(len & (sizeof(u64) - 1))));
225 /* Didn't find anything, so return */
230 bit /= 2; /* two bits per entry in the bitmap */
231 return (((const unsigned char *)ptr - buf) * GFS2_NBBY) + bit;
235 * gfs2_bitcount - count the number of bits in a certain state
236 * @rgd: the resource group descriptor
237 * @buffer: the buffer that holds the bitmaps
238 * @buflen: the length (in bytes) of the buffer
239 * @state: the state of the block we're looking for
241 * Returns: The number of bits
244 static u32 gfs2_bitcount(struct gfs2_rgrpd *rgd, const u8 *buffer,
245 unsigned int buflen, u8 state)
247 const u8 *byte = buffer;
248 const u8 *end = buffer + buflen;
249 const u8 state1 = state << 2;
250 const u8 state2 = state << 4;
251 const u8 state3 = state << 6;
254 for (; byte < end; byte++) {
255 if (((*byte) & 0x03) == state)
257 if (((*byte) & 0x0C) == state1)
259 if (((*byte) & 0x30) == state2)
261 if (((*byte) & 0xC0) == state3)
269 * gfs2_rgrp_verify - Verify that a resource group is consistent
274 void gfs2_rgrp_verify(struct gfs2_rgrpd *rgd)
276 struct gfs2_sbd *sdp = rgd->rd_sbd;
277 struct gfs2_bitmap *bi = NULL;
278 u32 length = rgd->rd_length;
282 memset(count, 0, 4 * sizeof(u32));
284 /* Count # blocks in each of 4 possible allocation states */
285 for (buf = 0; buf < length; buf++) {
286 bi = rgd->rd_bits + buf;
287 for (x = 0; x < 4; x++)
288 count[x] += gfs2_bitcount(rgd,
294 if (count[0] != rgd->rd_free) {
295 if (gfs2_consist_rgrpd(rgd))
296 fs_err(sdp, "free data mismatch: %u != %u\n",
297 count[0], rgd->rd_free);
301 tmp = rgd->rd_data - rgd->rd_free - rgd->rd_dinodes;
302 if (count[1] != tmp) {
303 if (gfs2_consist_rgrpd(rgd))
304 fs_err(sdp, "used data mismatch: %u != %u\n",
309 if (count[2] + count[3] != rgd->rd_dinodes) {
310 if (gfs2_consist_rgrpd(rgd))
311 fs_err(sdp, "used metadata mismatch: %u != %u\n",
312 count[2] + count[3], rgd->rd_dinodes);
317 static inline int rgrp_contains_block(struct gfs2_rgrpd *rgd, u64 block)
319 u64 first = rgd->rd_data0;
320 u64 last = first + rgd->rd_data;
321 return first <= block && block < last;
325 * gfs2_blk2rgrpd - Find resource group for a given data/meta block number
326 * @sdp: The GFS2 superblock
327 * @blk: The data block number
328 * @exact: True if this needs to be an exact match
330 * Returns: The resource group, or NULL if not found
333 struct gfs2_rgrpd *gfs2_blk2rgrpd(struct gfs2_sbd *sdp, u64 blk, bool exact)
335 struct rb_node *n, *next;
336 struct gfs2_rgrpd *cur;
338 spin_lock(&sdp->sd_rindex_spin);
339 n = sdp->sd_rindex_tree.rb_node;
341 cur = rb_entry(n, struct gfs2_rgrpd, rd_node);
343 if (blk < cur->rd_addr)
345 else if (blk >= cur->rd_data0 + cur->rd_data)
348 spin_unlock(&sdp->sd_rindex_spin);
350 if (blk < cur->rd_addr)
352 if (blk >= cur->rd_data0 + cur->rd_data)
359 spin_unlock(&sdp->sd_rindex_spin);
365 * gfs2_rgrpd_get_first - get the first Resource Group in the filesystem
366 * @sdp: The GFS2 superblock
368 * Returns: The first rgrp in the filesystem
371 struct gfs2_rgrpd *gfs2_rgrpd_get_first(struct gfs2_sbd *sdp)
373 const struct rb_node *n;
374 struct gfs2_rgrpd *rgd;
376 spin_lock(&sdp->sd_rindex_spin);
377 n = rb_first(&sdp->sd_rindex_tree);
378 rgd = rb_entry(n, struct gfs2_rgrpd, rd_node);
379 spin_unlock(&sdp->sd_rindex_spin);
385 * gfs2_rgrpd_get_next - get the next RG
386 * @rgd: the resource group descriptor
388 * Returns: The next rgrp
391 struct gfs2_rgrpd *gfs2_rgrpd_get_next(struct gfs2_rgrpd *rgd)
393 struct gfs2_sbd *sdp = rgd->rd_sbd;
394 const struct rb_node *n;
396 spin_lock(&sdp->sd_rindex_spin);
397 n = rb_next(&rgd->rd_node);
399 n = rb_first(&sdp->sd_rindex_tree);
401 if (unlikely(&rgd->rd_node == n)) {
402 spin_unlock(&sdp->sd_rindex_spin);
405 rgd = rb_entry(n, struct gfs2_rgrpd, rd_node);
406 spin_unlock(&sdp->sd_rindex_spin);
410 void gfs2_free_clones(struct gfs2_rgrpd *rgd)
414 for (x = 0; x < rgd->rd_length; x++) {
415 struct gfs2_bitmap *bi = rgd->rd_bits + x;
421 void gfs2_clear_rgrpd(struct gfs2_sbd *sdp)
424 struct gfs2_rgrpd *rgd;
425 struct gfs2_glock *gl;
427 while ((n = rb_first(&sdp->sd_rindex_tree))) {
428 rgd = rb_entry(n, struct gfs2_rgrpd, rd_node);
431 rb_erase(n, &sdp->sd_rindex_tree);
434 spin_lock(&gl->gl_spin);
435 gl->gl_object = NULL;
436 spin_unlock(&gl->gl_spin);
437 gfs2_glock_add_to_lru(gl);
441 gfs2_free_clones(rgd);
443 kmem_cache_free(gfs2_rgrpd_cachep, rgd);
447 static void gfs2_rindex_print(const struct gfs2_rgrpd *rgd)
449 printk(KERN_INFO " ri_addr = %llu\n", (unsigned long long)rgd->rd_addr);
450 printk(KERN_INFO " ri_length = %u\n", rgd->rd_length);
451 printk(KERN_INFO " ri_data0 = %llu\n", (unsigned long long)rgd->rd_data0);
452 printk(KERN_INFO " ri_data = %u\n", rgd->rd_data);
453 printk(KERN_INFO " ri_bitbytes = %u\n", rgd->rd_bitbytes);
457 * gfs2_compute_bitstructs - Compute the bitmap sizes
458 * @rgd: The resource group descriptor
460 * Calculates bitmap descriptors, one for each block that contains bitmap data
465 static int compute_bitstructs(struct gfs2_rgrpd *rgd)
467 struct gfs2_sbd *sdp = rgd->rd_sbd;
468 struct gfs2_bitmap *bi;
469 u32 length = rgd->rd_length; /* # blocks in hdr & bitmap */
470 u32 bytes_left, bytes;
476 rgd->rd_bits = kcalloc(length, sizeof(struct gfs2_bitmap), GFP_NOFS);
480 bytes_left = rgd->rd_bitbytes;
482 for (x = 0; x < length; x++) {
483 bi = rgd->rd_bits + x;
486 /* small rgrp; bitmap stored completely in header block */
489 bi->bi_offset = sizeof(struct gfs2_rgrp);
494 bytes = sdp->sd_sb.sb_bsize - sizeof(struct gfs2_rgrp);
495 bi->bi_offset = sizeof(struct gfs2_rgrp);
499 } else if (x + 1 == length) {
501 bi->bi_offset = sizeof(struct gfs2_meta_header);
502 bi->bi_start = rgd->rd_bitbytes - bytes_left;
506 bytes = sdp->sd_sb.sb_bsize -
507 sizeof(struct gfs2_meta_header);
508 bi->bi_offset = sizeof(struct gfs2_meta_header);
509 bi->bi_start = rgd->rd_bitbytes - bytes_left;
517 gfs2_consist_rgrpd(rgd);
520 bi = rgd->rd_bits + (length - 1);
521 if ((bi->bi_start + bi->bi_len) * GFS2_NBBY != rgd->rd_data) {
522 if (gfs2_consist_rgrpd(rgd)) {
523 gfs2_rindex_print(rgd);
524 fs_err(sdp, "start=%u len=%u offset=%u\n",
525 bi->bi_start, bi->bi_len, bi->bi_offset);
534 * gfs2_ri_total - Total up the file system space, according to the rindex.
535 * @sdp: the filesystem
538 u64 gfs2_ri_total(struct gfs2_sbd *sdp)
541 struct inode *inode = sdp->sd_rindex;
542 struct gfs2_inode *ip = GFS2_I(inode);
543 char buf[sizeof(struct gfs2_rindex)];
546 for (rgrps = 0;; rgrps++) {
547 loff_t pos = rgrps * sizeof(struct gfs2_rindex);
549 if (pos + sizeof(struct gfs2_rindex) > i_size_read(inode))
551 error = gfs2_internal_read(ip, buf, &pos,
552 sizeof(struct gfs2_rindex));
553 if (error != sizeof(struct gfs2_rindex))
555 total_data += be32_to_cpu(((struct gfs2_rindex *)buf)->ri_data);
560 static int rgd_insert(struct gfs2_rgrpd *rgd)
562 struct gfs2_sbd *sdp = rgd->rd_sbd;
563 struct rb_node **newn = &sdp->sd_rindex_tree.rb_node, *parent = NULL;
565 /* Figure out where to put new node */
567 struct gfs2_rgrpd *cur = rb_entry(*newn, struct gfs2_rgrpd,
571 if (rgd->rd_addr < cur->rd_addr)
572 newn = &((*newn)->rb_left);
573 else if (rgd->rd_addr > cur->rd_addr)
574 newn = &((*newn)->rb_right);
579 rb_link_node(&rgd->rd_node, parent, newn);
580 rb_insert_color(&rgd->rd_node, &sdp->sd_rindex_tree);
586 * read_rindex_entry - Pull in a new resource index entry from the disk
587 * @ip: Pointer to the rindex inode
589 * Returns: 0 on success, > 0 on EOF, error code otherwise
592 static int read_rindex_entry(struct gfs2_inode *ip)
594 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
595 loff_t pos = sdp->sd_rgrps * sizeof(struct gfs2_rindex);
596 struct gfs2_rindex buf;
598 struct gfs2_rgrpd *rgd;
600 if (pos >= i_size_read(&ip->i_inode))
603 error = gfs2_internal_read(ip, (char *)&buf, &pos,
604 sizeof(struct gfs2_rindex));
606 if (error != sizeof(struct gfs2_rindex))
607 return (error == 0) ? 1 : error;
609 rgd = kmem_cache_zalloc(gfs2_rgrpd_cachep, GFP_NOFS);
615 rgd->rd_addr = be64_to_cpu(buf.ri_addr);
616 rgd->rd_length = be32_to_cpu(buf.ri_length);
617 rgd->rd_data0 = be64_to_cpu(buf.ri_data0);
618 rgd->rd_data = be32_to_cpu(buf.ri_data);
619 rgd->rd_bitbytes = be32_to_cpu(buf.ri_bitbytes);
621 error = compute_bitstructs(rgd);
625 error = gfs2_glock_get(sdp, rgd->rd_addr,
626 &gfs2_rgrp_glops, CREATE, &rgd->rd_gl);
630 rgd->rd_gl->gl_object = rgd;
631 rgd->rd_flags &= ~GFS2_RDF_UPTODATE;
632 if (rgd->rd_data > sdp->sd_max_rg_data)
633 sdp->sd_max_rg_data = rgd->rd_data;
634 spin_lock(&sdp->sd_rindex_spin);
635 error = rgd_insert(rgd);
636 spin_unlock(&sdp->sd_rindex_spin);
640 error = 0; /* someone else read in the rgrp; free it and ignore it */
641 gfs2_glock_put(rgd->rd_gl);
645 kmem_cache_free(gfs2_rgrpd_cachep, rgd);
650 * gfs2_ri_update - Pull in a new resource index from the disk
651 * @ip: pointer to the rindex inode
653 * Returns: 0 on successful update, error code otherwise
656 static int gfs2_ri_update(struct gfs2_inode *ip)
658 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
662 error = read_rindex_entry(ip);
663 } while (error == 0);
668 sdp->sd_rindex_uptodate = 1;
673 * gfs2_rindex_update - Update the rindex if required
674 * @sdp: The GFS2 superblock
676 * We grab a lock on the rindex inode to make sure that it doesn't
677 * change whilst we are performing an operation. We keep this lock
678 * for quite long periods of time compared to other locks. This
679 * doesn't matter, since it is shared and it is very, very rarely
680 * accessed in the exclusive mode (i.e. only when expanding the filesystem).
682 * This makes sure that we're using the latest copy of the resource index
683 * special file, which might have been updated if someone expanded the
684 * filesystem (via gfs2_grow utility), which adds new resource groups.
686 * Returns: 0 on succeess, error code otherwise
689 int gfs2_rindex_update(struct gfs2_sbd *sdp)
691 struct gfs2_inode *ip = GFS2_I(sdp->sd_rindex);
692 struct gfs2_glock *gl = ip->i_gl;
693 struct gfs2_holder ri_gh;
695 int unlock_required = 0;
697 /* Read new copy from disk if we don't have the latest */
698 if (!sdp->sd_rindex_uptodate) {
699 if (!gfs2_glock_is_locked_by_me(gl)) {
700 error = gfs2_glock_nq_init(gl, LM_ST_SHARED, 0, &ri_gh);
705 if (!sdp->sd_rindex_uptodate)
706 error = gfs2_ri_update(ip);
708 gfs2_glock_dq_uninit(&ri_gh);
714 static void gfs2_rgrp_in(struct gfs2_rgrpd *rgd, const void *buf)
716 const struct gfs2_rgrp *str = buf;
719 rg_flags = be32_to_cpu(str->rg_flags);
720 rg_flags &= ~GFS2_RDF_MASK;
721 rgd->rd_flags &= GFS2_RDF_MASK;
722 rgd->rd_flags |= rg_flags;
723 rgd->rd_free = be32_to_cpu(str->rg_free);
724 rgd->rd_dinodes = be32_to_cpu(str->rg_dinodes);
725 rgd->rd_igeneration = be64_to_cpu(str->rg_igeneration);
728 static void gfs2_rgrp_out(struct gfs2_rgrpd *rgd, void *buf)
730 struct gfs2_rgrp *str = buf;
732 str->rg_flags = cpu_to_be32(rgd->rd_flags & ~GFS2_RDF_MASK);
733 str->rg_free = cpu_to_be32(rgd->rd_free);
734 str->rg_dinodes = cpu_to_be32(rgd->rd_dinodes);
735 str->__pad = cpu_to_be32(0);
736 str->rg_igeneration = cpu_to_be64(rgd->rd_igeneration);
737 memset(&str->rg_reserved, 0, sizeof(str->rg_reserved));
741 * gfs2_rgrp_go_lock - Read in a RG's header and bitmaps
742 * @gh: The glock holder for the resource group
744 * Read in all of a Resource Group's header and bitmap blocks.
745 * Caller must eventually call gfs2_rgrp_relse() to free the bitmaps.
750 int gfs2_rgrp_go_lock(struct gfs2_holder *gh)
752 struct gfs2_rgrpd *rgd = gh->gh_gl->gl_object;
753 struct gfs2_sbd *sdp = rgd->rd_sbd;
754 struct gfs2_glock *gl = rgd->rd_gl;
755 unsigned int length = rgd->rd_length;
756 struct gfs2_bitmap *bi;
760 for (x = 0; x < length; x++) {
761 bi = rgd->rd_bits + x;
762 error = gfs2_meta_read(gl, rgd->rd_addr + x, 0, &bi->bi_bh);
767 for (y = length; y--;) {
768 bi = rgd->rd_bits + y;
769 error = gfs2_meta_wait(sdp, bi->bi_bh);
772 if (gfs2_metatype_check(sdp, bi->bi_bh, y ? GFS2_METATYPE_RB :
779 if (!(rgd->rd_flags & GFS2_RDF_UPTODATE)) {
780 for (x = 0; x < length; x++)
781 clear_bit(GBF_FULL, &rgd->rd_bits[x].bi_flags);
782 gfs2_rgrp_in(rgd, (rgd->rd_bits[0].bi_bh)->b_data);
783 rgd->rd_flags |= (GFS2_RDF_UPTODATE | GFS2_RDF_CHECK);
784 rgd->rd_free_clone = rgd->rd_free;
791 bi = rgd->rd_bits + x;
794 gfs2_assert_warn(sdp, !bi->bi_clone);
801 * gfs2_rgrp_go_unlock - Release RG bitmaps read in with gfs2_rgrp_bh_get()
802 * @gh: The glock holder for the resource group
806 void gfs2_rgrp_go_unlock(struct gfs2_holder *gh)
808 struct gfs2_rgrpd *rgd = gh->gh_gl->gl_object;
809 int x, length = rgd->rd_length;
811 for (x = 0; x < length; x++) {
812 struct gfs2_bitmap *bi = rgd->rd_bits + x;
819 int gfs2_rgrp_send_discards(struct gfs2_sbd *sdp, u64 offset,
820 struct buffer_head *bh,
821 const struct gfs2_bitmap *bi, unsigned minlen, u64 *ptrimmed)
823 struct super_block *sb = sdp->sd_vfs;
824 struct block_device *bdev = sb->s_bdev;
825 const unsigned int sects_per_blk = sdp->sd_sb.sb_bsize /
826 bdev_logical_block_size(sb->s_bdev);
829 sector_t nr_sects = 0;
835 for (x = 0; x < bi->bi_len; x++) {
836 const u8 *clone = bi->bi_clone ? bi->bi_clone : bi->bi_bh->b_data;
837 clone += bi->bi_offset;
840 const u8 *orig = bh->b_data + bi->bi_offset + x;
841 diff = ~(*orig | (*orig >> 1)) & (*clone | (*clone >> 1));
843 diff = ~(*clone | (*clone >> 1));
848 blk = offset + ((bi->bi_start + x) * GFS2_NBBY);
849 blk *= sects_per_blk; /* convert to sectors */
853 goto start_new_extent;
854 if ((start + nr_sects) != blk) {
855 if (nr_sects >= minlen) {
856 rv = blkdev_issue_discard(bdev,
867 nr_sects += sects_per_blk;
870 blk += sects_per_blk;
873 if (nr_sects >= minlen) {
874 rv = blkdev_issue_discard(bdev, start, nr_sects, GFP_NOFS, 0);
884 if (sdp->sd_args.ar_discard)
885 fs_warn(sdp, "error %d on discard request, turning discards off for this filesystem", rv);
886 sdp->sd_args.ar_discard = 0;
891 * gfs2_fitrim - Generate discard requests for unused bits of the filesystem
892 * @filp: Any file on the filesystem
893 * @argp: Pointer to the arguments (also used to pass result)
895 * Returns: 0 on success, otherwise error code
898 int gfs2_fitrim(struct file *filp, void __user *argp)
900 struct inode *inode = filp->f_dentry->d_inode;
901 struct gfs2_sbd *sdp = GFS2_SB(inode);
902 struct request_queue *q = bdev_get_queue(sdp->sd_vfs->s_bdev);
903 struct buffer_head *bh;
904 struct gfs2_rgrpd *rgd;
905 struct gfs2_rgrpd *rgd_end;
906 struct gfs2_holder gh;
907 struct fstrim_range r;
913 if (!capable(CAP_SYS_ADMIN))
916 if (!blk_queue_discard(q))
923 } else if (copy_from_user(&r, argp, sizeof(r)))
926 ret = gfs2_rindex_update(sdp);
930 rgd = gfs2_blk2rgrpd(sdp, r.start, 0);
931 rgd_end = gfs2_blk2rgrpd(sdp, r.start + r.len, 0);
935 ret = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_EXCLUSIVE, 0, &gh);
939 if (!(rgd->rd_flags & GFS2_RGF_TRIMMED)) {
940 /* Trim each bitmap in the rgrp */
941 for (x = 0; x < rgd->rd_length; x++) {
942 struct gfs2_bitmap *bi = rgd->rd_bits + x;
943 ret = gfs2_rgrp_send_discards(sdp, rgd->rd_data0, NULL, bi, r.minlen, &amt);
945 gfs2_glock_dq_uninit(&gh);
951 /* Mark rgrp as having been trimmed */
952 ret = gfs2_trans_begin(sdp, RES_RG_HDR, 0);
954 bh = rgd->rd_bits[0].bi_bh;
955 rgd->rd_flags |= GFS2_RGF_TRIMMED;
956 gfs2_trans_add_bh(rgd->rd_gl, bh, 1);
957 gfs2_rgrp_out(rgd, bh->b_data);
961 gfs2_glock_dq_uninit(&gh);
966 rgd = gfs2_rgrpd_get_next(rgd);
970 r.len = trimmed << 9;
971 if (argp && copy_to_user(argp, &r, sizeof(r)))
978 * gfs2_qadata_get - get the struct gfs2_qadata structure for an inode
979 * @ip: the incore GFS2 inode structure
981 * Returns: the struct gfs2_qadata
984 struct gfs2_qadata *gfs2_qadata_get(struct gfs2_inode *ip)
986 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
988 BUG_ON(ip->i_qadata != NULL);
989 ip->i_qadata = kzalloc(sizeof(struct gfs2_qadata), GFP_NOFS);
990 error = gfs2_rindex_update(sdp);
992 fs_warn(sdp, "rindex update returns %d\n", error);
997 * gfs2_blkrsv_get - get the struct gfs2_blkreserv structure for an inode
998 * @ip: the incore GFS2 inode structure
1000 * Returns: the struct gfs2_qadata
1003 static int gfs2_blkrsv_get(struct gfs2_inode *ip)
1005 BUG_ON(ip->i_res != NULL);
1006 ip->i_res = kmem_cache_zalloc(gfs2_rsrv_cachep, GFP_NOFS);
1013 * try_rgrp_fit - See if a given reservation will fit in a given RG
1017 * If there's room for the requested blocks to be allocated from the RG:
1019 * Returns: 1 on success (it fits), 0 on failure (it doesn't fit)
1022 static int try_rgrp_fit(const struct gfs2_rgrpd *rgd, const struct gfs2_inode *ip)
1024 const struct gfs2_blkreserv *rs = ip->i_res;
1026 if (rgd->rd_flags & (GFS2_RGF_NOALLOC | GFS2_RDF_ERROR))
1028 if (rgd->rd_free_clone >= rs->rs_requested)
1033 static inline u32 gfs2_bi2rgd_blk(struct gfs2_bitmap *bi, u32 blk)
1035 return (bi->bi_start * GFS2_NBBY) + blk;
1039 * try_rgrp_unlink - Look for any unlinked, allocated, but unused inodes
1041 * @last_unlinked: block address of the last dinode we unlinked
1042 * @skip: block address we should explicitly not unlink
1044 * Returns: 0 if no error
1045 * The inode, if one has been found, in inode.
1048 static void try_rgrp_unlink(struct gfs2_rgrpd *rgd, u64 *last_unlinked, u64 skip)
1050 u32 goal = 0, block;
1052 struct gfs2_sbd *sdp = rgd->rd_sbd;
1053 struct gfs2_glock *gl;
1054 struct gfs2_inode *ip;
1057 struct gfs2_bitmap *bi;
1059 while (goal < rgd->rd_data) {
1060 down_write(&sdp->sd_log_flush_lock);
1061 block = rgblk_search(rgd, goal, GFS2_BLKST_UNLINKED, &bi);
1062 up_write(&sdp->sd_log_flush_lock);
1063 if (block == BFITNOENT)
1066 block = gfs2_bi2rgd_blk(bi, block);
1067 /* rgblk_search can return a block < goal, so we need to
1068 keep it marching forward. */
1069 no_addr = block + rgd->rd_data0;
1070 goal = max(block + 1, goal + 1);
1071 if (*last_unlinked != NO_BLOCK && no_addr <= *last_unlinked)
1073 if (no_addr == skip)
1075 *last_unlinked = no_addr;
1077 error = gfs2_glock_get(sdp, no_addr, &gfs2_inode_glops, CREATE, &gl);
1081 /* If the inode is already in cache, we can ignore it here
1082 * because the existing inode disposal code will deal with
1083 * it when all refs have gone away. Accessing gl_object like
1084 * this is not safe in general. Here it is ok because we do
1085 * not dereference the pointer, and we only need an approx
1086 * answer to whether it is NULL or not.
1090 if (ip || queue_work(gfs2_delete_workqueue, &gl->gl_delete) == 0)
1095 /* Limit reclaim to sensible number of tasks */
1096 if (found > NR_CPUS)
1100 rgd->rd_flags &= ~GFS2_RDF_CHECK;
1105 * get_local_rgrp - Choose and lock a rgrp for allocation
1106 * @ip: the inode to reserve space for
1107 * @last_unlinked: the last unlinked block
1109 * Try to acquire rgrp in way which avoids contending with others.
1114 static int get_local_rgrp(struct gfs2_inode *ip, u64 *last_unlinked)
1116 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1117 struct gfs2_rgrpd *rgd, *begin = NULL;
1118 struct gfs2_blkreserv *rs = ip->i_res;
1119 int error, rg_locked, flags = LM_FLAG_TRY;
1122 if (ip->i_rgd && rgrp_contains_block(ip->i_rgd, ip->i_goal))
1123 rgd = begin = ip->i_rgd;
1125 rgd = begin = gfs2_blk2rgrpd(sdp, ip->i_goal, 1);
1133 if (gfs2_glock_is_locked_by_me(rgd->rd_gl)) {
1137 error = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_EXCLUSIVE,
1138 flags, &rs->rs_rgd_gh);
1142 if (try_rgrp_fit(rgd, ip)) {
1146 if (rgd->rd_flags & GFS2_RDF_CHECK)
1147 try_rgrp_unlink(rgd, last_unlinked, ip->i_no_addr);
1149 gfs2_glock_dq_uninit(&rs->rs_rgd_gh);
1152 rgd = gfs2_rgrpd_get_next(rgd);
1166 static void gfs2_blkrsv_put(struct gfs2_inode *ip)
1168 BUG_ON(ip->i_res == NULL);
1169 kmem_cache_free(gfs2_rsrv_cachep, ip->i_res);
1174 * gfs2_inplace_reserve - Reserve space in the filesystem
1175 * @ip: the inode to reserve space for
1176 * @requested: the number of blocks to be reserved
1181 int gfs2_inplace_reserve(struct gfs2_inode *ip, u32 requested)
1183 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1184 struct gfs2_blkreserv *rs;
1186 u64 last_unlinked = NO_BLOCK;
1189 error = gfs2_blkrsv_get(ip);
1194 rs->rs_requested = requested;
1195 if (gfs2_assert_warn(sdp, requested)) {
1201 error = get_local_rgrp(ip, &last_unlinked);
1202 if (error != -ENOSPC)
1204 /* Check that fs hasn't grown if writing to rindex */
1205 if (ip == GFS2_I(sdp->sd_rindex) && !sdp->sd_rindex_uptodate) {
1206 error = gfs2_ri_update(ip);
1211 /* Flushing the log may release space */
1212 gfs2_log_flush(sdp, NULL);
1213 } while (tries++ < 3);
1217 gfs2_blkrsv_put(ip);
1222 * gfs2_inplace_release - release an inplace reservation
1223 * @ip: the inode the reservation was taken out on
1225 * Release a reservation made by gfs2_inplace_reserve().
1228 void gfs2_inplace_release(struct gfs2_inode *ip)
1230 struct gfs2_blkreserv *rs = ip->i_res;
1232 if (rs->rs_rgd_gh.gh_gl)
1233 gfs2_glock_dq_uninit(&rs->rs_rgd_gh);
1234 gfs2_blkrsv_put(ip);
1238 * gfs2_get_block_type - Check a block in a RG is of given type
1239 * @rgd: the resource group holding the block
1240 * @block: the block number
1242 * Returns: The block type (GFS2_BLKST_*)
1245 static unsigned char gfs2_get_block_type(struct gfs2_rgrpd *rgd, u64 block)
1247 struct gfs2_bitmap *bi = NULL;
1248 u32 length, rgrp_block, buf_block;
1252 length = rgd->rd_length;
1253 rgrp_block = block - rgd->rd_data0;
1255 for (buf = 0; buf < length; buf++) {
1256 bi = rgd->rd_bits + buf;
1257 if (rgrp_block < (bi->bi_start + bi->bi_len) * GFS2_NBBY)
1261 gfs2_assert(rgd->rd_sbd, buf < length);
1262 buf_block = rgrp_block - bi->bi_start * GFS2_NBBY;
1264 type = gfs2_testbit(rgd, bi->bi_bh->b_data + bi->bi_offset,
1265 bi->bi_len, buf_block);
1271 * rgblk_search - find a block in @state
1272 * @rgd: the resource group descriptor
1273 * @goal: the goal block within the RG (start here to search for avail block)
1274 * @state: GFS2_BLKST_XXX the before-allocation state to find
1275 * @rbi: address of the pointer to the bitmap containing the block found
1277 * Walk rgrp's bitmap to find bits that represent a block in @state.
1279 * This function never fails, because we wouldn't call it unless we
1280 * know (from reservation results, etc.) that a block is available.
1282 * Scope of @goal is just within rgrp, not the whole filesystem.
1283 * Scope of @returned block is just within bitmap, not the whole filesystem.
1285 * Returns: the block number found relative to the bitmap rbi
1288 static u32 rgblk_search(struct gfs2_rgrpd *rgd, u32 goal, unsigned char state,
1289 struct gfs2_bitmap **rbi)
1291 struct gfs2_bitmap *bi = NULL;
1292 const u32 length = rgd->rd_length;
1293 u32 biblk = BFITNOENT;
1294 unsigned int buf, x;
1295 const u8 *buffer = NULL;
1298 /* Find bitmap block that contains bits for goal block */
1299 for (buf = 0; buf < length; buf++) {
1300 bi = rgd->rd_bits + buf;
1301 /* Convert scope of "goal" from rgrp-wide to within found bit block */
1302 if (goal < (bi->bi_start + bi->bi_len) * GFS2_NBBY) {
1303 goal -= bi->bi_start * GFS2_NBBY;
1311 /* Search (up to entire) bitmap in this rgrp for allocatable block.
1312 "x <= length", instead of "x < length", because we typically start
1313 the search in the middle of a bit block, but if we can't find an
1314 allocatable block anywhere else, we want to be able wrap around and
1315 search in the first part of our first-searched bit block. */
1316 for (x = 0; x <= length; x++) {
1317 bi = rgd->rd_bits + buf;
1319 if (test_bit(GBF_FULL, &bi->bi_flags) &&
1320 (state == GFS2_BLKST_FREE))
1323 /* The GFS2_BLKST_UNLINKED state doesn't apply to the clone
1324 bitmaps, so we must search the originals for that. */
1325 buffer = bi->bi_bh->b_data + bi->bi_offset;
1326 WARN_ON(!buffer_uptodate(bi->bi_bh));
1327 if (state != GFS2_BLKST_UNLINKED && bi->bi_clone)
1328 buffer = bi->bi_clone + bi->bi_offset;
1330 biblk = gfs2_bitfit(buffer, bi->bi_len, goal, state);
1331 if (biblk != BFITNOENT)
1334 if ((goal == 0) && (state == GFS2_BLKST_FREE))
1335 set_bit(GBF_FULL, &bi->bi_flags);
1337 /* Try next bitmap block (wrap back to rgrp header if at end) */
1344 if (biblk != BFITNOENT)
1351 * gfs2_alloc_extent - allocate an extent from a given bitmap
1352 * @rgd: the resource group descriptor
1353 * @bi: the bitmap within the rgrp
1354 * @blk: the block within the bitmap
1355 * @dinode: TRUE if the first block we allocate is for a dinode
1356 * @n: The extent length
1358 * Add the found bitmap buffer to the transaction.
1359 * Set the found bits to @new_state to change block's allocation state.
1360 * Returns: starting block number of the extent (fs scope)
1362 static u64 gfs2_alloc_extent(struct gfs2_rgrpd *rgd, struct gfs2_bitmap *bi,
1363 u32 blk, bool dinode, unsigned int *n)
1365 const unsigned int elen = *n;
1367 const u8 *buffer = NULL;
1370 buffer = bi->bi_bh->b_data + bi->bi_offset;
1371 gfs2_trans_add_bh(rgd->rd_gl, bi->bi_bh, 1);
1372 gfs2_setbit(rgd, bi->bi_bh->b_data, bi->bi_clone,
1373 bi, blk, dinode ? GFS2_BLKST_DINODE : GFS2_BLKST_USED);
1378 if (goal >= (bi->bi_len * GFS2_NBBY))
1380 if (gfs2_testbit(rgd, buffer, bi->bi_len, goal) !=
1383 gfs2_setbit(rgd, bi->bi_bh->b_data, bi->bi_clone,
1384 bi, goal, GFS2_BLKST_USED);
1387 blk = gfs2_bi2rgd_blk(bi, blk);
1388 rgd->rd_last_alloc = blk + *n - 1;
1389 return rgd->rd_data0 + blk;
1393 * rgblk_free - Change alloc state of given block(s)
1394 * @sdp: the filesystem
1395 * @bstart: the start of a run of blocks to free
1396 * @blen: the length of the block run (all must lie within ONE RG!)
1397 * @new_state: GFS2_BLKST_XXX the after-allocation block state
1399 * Returns: Resource group containing the block(s)
1402 static struct gfs2_rgrpd *rgblk_free(struct gfs2_sbd *sdp, u64 bstart,
1403 u32 blen, unsigned char new_state)
1405 struct gfs2_rgrpd *rgd;
1406 struct gfs2_bitmap *bi = NULL;
1407 u32 length, rgrp_blk, buf_blk;
1410 rgd = gfs2_blk2rgrpd(sdp, bstart, 1);
1412 if (gfs2_consist(sdp))
1413 fs_err(sdp, "block = %llu\n", (unsigned long long)bstart);
1417 length = rgd->rd_length;
1419 rgrp_blk = bstart - rgd->rd_data0;
1422 for (buf = 0; buf < length; buf++) {
1423 bi = rgd->rd_bits + buf;
1424 if (rgrp_blk < (bi->bi_start + bi->bi_len) * GFS2_NBBY)
1428 gfs2_assert(rgd->rd_sbd, buf < length);
1430 buf_blk = rgrp_blk - bi->bi_start * GFS2_NBBY;
1433 if (!bi->bi_clone) {
1434 bi->bi_clone = kmalloc(bi->bi_bh->b_size,
1435 GFP_NOFS | __GFP_NOFAIL);
1436 memcpy(bi->bi_clone + bi->bi_offset,
1437 bi->bi_bh->b_data + bi->bi_offset,
1440 gfs2_trans_add_bh(rgd->rd_gl, bi->bi_bh, 1);
1441 gfs2_setbit(rgd, bi->bi_bh->b_data, NULL,
1442 bi, buf_blk, new_state);
1449 * gfs2_rgrp_dump - print out an rgrp
1450 * @seq: The iterator
1451 * @gl: The glock in question
1455 int gfs2_rgrp_dump(struct seq_file *seq, const struct gfs2_glock *gl)
1457 const struct gfs2_rgrpd *rgd = gl->gl_object;
1460 gfs2_print_dbg(seq, " R: n:%llu f:%02x b:%u/%u i:%u\n",
1461 (unsigned long long)rgd->rd_addr, rgd->rd_flags,
1462 rgd->rd_free, rgd->rd_free_clone, rgd->rd_dinodes);
1466 static void gfs2_rgrp_error(struct gfs2_rgrpd *rgd)
1468 struct gfs2_sbd *sdp = rgd->rd_sbd;
1469 fs_warn(sdp, "rgrp %llu has an error, marking it readonly until umount\n",
1470 (unsigned long long)rgd->rd_addr);
1471 fs_warn(sdp, "umount on all nodes and run fsck.gfs2 to fix the error\n");
1472 gfs2_rgrp_dump(NULL, rgd->rd_gl);
1473 rgd->rd_flags |= GFS2_RDF_ERROR;
1477 * gfs2_alloc_blocks - Allocate one or more blocks of data and/or a dinode
1478 * @ip: the inode to allocate the block for
1479 * @bn: Used to return the starting block number
1480 * @ndata: requested number of blocks/extent length (value/result)
1481 * @dinode: 1 if we're allocating a dinode block, else 0
1482 * @generation: the generation number of the inode
1484 * Returns: 0 or error
1487 int gfs2_alloc_blocks(struct gfs2_inode *ip, u64 *bn, unsigned int *nblocks,
1488 bool dinode, u64 *generation)
1490 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1491 struct buffer_head *dibh;
1492 struct gfs2_rgrpd *rgd;
1494 u32 goal, blk; /* block, within the rgrp scope */
1495 u64 block; /* block, within the file system scope */
1497 struct gfs2_bitmap *bi;
1499 /* Only happens if there is a bug in gfs2, return something distinctive
1500 * to ensure that it is noticed.
1502 if (ip->i_res == NULL)
1507 if (!dinode && rgrp_contains_block(rgd, ip->i_goal))
1508 goal = ip->i_goal - rgd->rd_data0;
1510 goal = rgd->rd_last_alloc;
1512 blk = rgblk_search(rgd, goal, GFS2_BLKST_FREE, &bi);
1514 /* Since all blocks are reserved in advance, this shouldn't happen */
1515 if (blk == BFITNOENT)
1518 block = gfs2_alloc_extent(rgd, bi, blk, dinode, nblocks);
1524 ip->i_goal = block + ndata - 1;
1525 error = gfs2_meta_inode_buffer(ip, &dibh);
1527 struct gfs2_dinode *di =
1528 (struct gfs2_dinode *)dibh->b_data;
1529 gfs2_trans_add_bh(ip->i_gl, dibh, 1);
1530 di->di_goal_meta = di->di_goal_data =
1531 cpu_to_be64(ip->i_goal);
1535 if (rgd->rd_free < *nblocks)
1538 rgd->rd_free -= *nblocks;
1541 *generation = rgd->rd_igeneration++;
1542 if (*generation == 0)
1543 *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);
1549 gfs2_statfs_change(sdp, 0, -(s64)*nblocks, dinode ? 1 : 0);
1551 gfs2_trans_add_unrevoke(sdp, block, 1);
1554 * This needs reviewing to see why we cannot do the quota change
1555 * at this point in the dinode case.
1558 gfs2_quota_change(ip, ndata, ip->i_inode.i_uid,
1561 rgd->rd_free_clone -= *nblocks;
1562 trace_gfs2_block_alloc(ip, block, *nblocks,
1563 dinode ? GFS2_BLKST_DINODE : GFS2_BLKST_USED);
1568 gfs2_rgrp_error(rgd);
1573 * __gfs2_free_blocks - free a contiguous run of block(s)
1574 * @ip: the inode these blocks are being freed from
1575 * @bstart: first block of a run of contiguous blocks
1576 * @blen: the length of the block run
1577 * @meta: 1 if the blocks represent metadata
1581 void __gfs2_free_blocks(struct gfs2_inode *ip, u64 bstart, u32 blen, int meta)
1583 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1584 struct gfs2_rgrpd *rgd;
1586 rgd = rgblk_free(sdp, bstart, blen, GFS2_BLKST_FREE);
1589 trace_gfs2_block_alloc(ip, bstart, blen, GFS2_BLKST_FREE);
1590 rgd->rd_free += blen;
1591 rgd->rd_flags &= ~GFS2_RGF_TRIMMED;
1592 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1593 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
1595 /* Directories keep their data in the metadata address space */
1596 if (meta || ip->i_depth)
1597 gfs2_meta_wipe(ip, bstart, blen);
1601 * gfs2_free_meta - free a contiguous run of data block(s)
1602 * @ip: the inode these blocks are being freed from
1603 * @bstart: first block of a run of contiguous blocks
1604 * @blen: the length of the block run
1608 void gfs2_free_meta(struct gfs2_inode *ip, u64 bstart, u32 blen)
1610 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1612 __gfs2_free_blocks(ip, bstart, blen, 1);
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);
1617 void gfs2_unlink_di(struct inode *inode)
1619 struct gfs2_inode *ip = GFS2_I(inode);
1620 struct gfs2_sbd *sdp = GFS2_SB(inode);
1621 struct gfs2_rgrpd *rgd;
1622 u64 blkno = ip->i_no_addr;
1624 rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_UNLINKED);
1627 trace_gfs2_block_alloc(ip, 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);
1632 static void gfs2_free_uninit_di(struct gfs2_rgrpd *rgd, u64 blkno)
1634 struct gfs2_sbd *sdp = rgd->rd_sbd;
1635 struct gfs2_rgrpd *tmp_rgd;
1637 tmp_rgd = rgblk_free(sdp, blkno, 1, GFS2_BLKST_FREE);
1640 gfs2_assert_withdraw(sdp, rgd == tmp_rgd);
1642 if (!rgd->rd_dinodes)
1643 gfs2_consist_rgrpd(rgd);
1647 gfs2_trans_add_bh(rgd->rd_gl, rgd->rd_bits[0].bi_bh, 1);
1648 gfs2_rgrp_out(rgd, rgd->rd_bits[0].bi_bh->b_data);
1650 gfs2_statfs_change(sdp, 0, +1, -1);
1654 void gfs2_free_di(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip)
1656 gfs2_free_uninit_di(rgd, ip->i_no_addr);
1657 trace_gfs2_block_alloc(ip, ip->i_no_addr, 1, GFS2_BLKST_FREE);
1658 gfs2_quota_change(ip, -1, ip->i_inode.i_uid, ip->i_inode.i_gid);
1659 gfs2_meta_wipe(ip, ip->i_no_addr, 1);
1663 * gfs2_check_blk_type - Check the type of a block
1664 * @sdp: The superblock
1665 * @no_addr: The block number to check
1666 * @type: The block type we are looking for
1668 * Returns: 0 if the block type matches the expected type
1669 * -ESTALE if it doesn't match
1670 * or -ve errno if something went wrong while checking
1673 int gfs2_check_blk_type(struct gfs2_sbd *sdp, u64 no_addr, unsigned int type)
1675 struct gfs2_rgrpd *rgd;
1676 struct gfs2_holder rgd_gh;
1677 int error = -EINVAL;
1679 rgd = gfs2_blk2rgrpd(sdp, no_addr, 1);
1683 error = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_SHARED, 0, &rgd_gh);
1687 if (gfs2_get_block_type(rgd, no_addr) != type)
1690 gfs2_glock_dq_uninit(&rgd_gh);
1696 * gfs2_rlist_add - add a RG to a list of RGs
1698 * @rlist: the list of resource groups
1701 * Figure out what RG a block belongs to and add that RG to the list
1703 * FIXME: Don't use NOFAIL
1707 void gfs2_rlist_add(struct gfs2_inode *ip, struct gfs2_rgrp_list *rlist,
1710 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1711 struct gfs2_rgrpd *rgd;
1712 struct gfs2_rgrpd **tmp;
1713 unsigned int new_space;
1716 if (gfs2_assert_warn(sdp, !rlist->rl_ghs))
1719 if (ip->i_rgd && rgrp_contains_block(ip->i_rgd, block))
1722 rgd = gfs2_blk2rgrpd(sdp, block, 1);
1724 fs_err(sdp, "rlist_add: no rgrp for block %llu\n", (unsigned long long)block);
1729 for (x = 0; x < rlist->rl_rgrps; x++)
1730 if (rlist->rl_rgd[x] == rgd)
1733 if (rlist->rl_rgrps == rlist->rl_space) {
1734 new_space = rlist->rl_space + 10;
1736 tmp = kcalloc(new_space, sizeof(struct gfs2_rgrpd *),
1737 GFP_NOFS | __GFP_NOFAIL);
1739 if (rlist->rl_rgd) {
1740 memcpy(tmp, rlist->rl_rgd,
1741 rlist->rl_space * sizeof(struct gfs2_rgrpd *));
1742 kfree(rlist->rl_rgd);
1745 rlist->rl_space = new_space;
1746 rlist->rl_rgd = tmp;
1749 rlist->rl_rgd[rlist->rl_rgrps++] = rgd;
1753 * gfs2_rlist_alloc - all RGs have been added to the rlist, now allocate
1754 * and initialize an array of glock holders for them
1755 * @rlist: the list of resource groups
1756 * @state: the lock state to acquire the RG lock in
1758 * FIXME: Don't use NOFAIL
1762 void gfs2_rlist_alloc(struct gfs2_rgrp_list *rlist, unsigned int state)
1766 rlist->rl_ghs = kcalloc(rlist->rl_rgrps, sizeof(struct gfs2_holder),
1767 GFP_NOFS | __GFP_NOFAIL);
1768 for (x = 0; x < rlist->rl_rgrps; x++)
1769 gfs2_holder_init(rlist->rl_rgd[x]->rd_gl,
1775 * gfs2_rlist_free - free a resource group list
1776 * @list: the list of resource groups
1780 void gfs2_rlist_free(struct gfs2_rgrp_list *rlist)
1784 kfree(rlist->rl_rgd);
1786 if (rlist->rl_ghs) {
1787 for (x = 0; x < rlist->rl_rgrps; x++)
1788 gfs2_holder_uninit(&rlist->rl_ghs[x]);
1789 kfree(rlist->rl_ghs);