2 * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
3 * Copyright (C) 2004-2006 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 v.2.
10 #include <linux/sched.h>
11 #include <linux/slab.h>
12 #include <linux/spinlock.h>
13 #include <linux/completion.h>
14 #include <linux/buffer_head.h>
16 #include <linux/gfs2_ondisk.h>
19 #include "lm_interface.h"
32 #define BFITNOENT 0xFFFFFFFF
35 * These routines are used by the resource group routines (rgrp.c)
36 * to keep track of block allocation. Each block is represented by two
37 * bits. So, each byte represents GFS2_NBBY (i.e. 4) blocks.
40 * 1 = Used (not metadata)
41 * 2 = Unlinked (still in use) inode
45 static const char valid_change
[16] = {
54 * gfs2_setbit - Set a bit in the bitmaps
55 * @buffer: the buffer that holds the bitmaps
56 * @buflen: the length (in bytes) of the buffer
57 * @block: the block to set
58 * @new_state: the new state of the block
62 static void gfs2_setbit(struct gfs2_rgrpd
*rgd
, unsigned char *buffer
,
63 unsigned int buflen
, uint32_t block
,
64 unsigned char new_state
)
66 unsigned char *byte
, *end
, cur_state
;
69 byte
= buffer
+ (block
/ GFS2_NBBY
);
70 bit
= (block
% GFS2_NBBY
) * GFS2_BIT_SIZE
;
71 end
= buffer
+ buflen
;
73 gfs2_assert(rgd
->rd_sbd
, byte
< end
);
75 cur_state
= (*byte
>> bit
) & GFS2_BIT_MASK
;
77 if (valid_change
[new_state
* 4 + cur_state
]) {
78 *byte
^= cur_state
<< bit
;
79 *byte
|= new_state
<< bit
;
81 gfs2_consist_rgrpd(rgd
);
85 * gfs2_testbit - test a bit in the bitmaps
86 * @buffer: the buffer that holds the bitmaps
87 * @buflen: the length (in bytes) of the buffer
88 * @block: the block to read
92 static unsigned char gfs2_testbit(struct gfs2_rgrpd
*rgd
, unsigned char *buffer
,
93 unsigned int buflen
, uint32_t block
)
95 unsigned char *byte
, *end
, cur_state
;
98 byte
= buffer
+ (block
/ GFS2_NBBY
);
99 bit
= (block
% GFS2_NBBY
) * GFS2_BIT_SIZE
;
100 end
= buffer
+ buflen
;
102 gfs2_assert(rgd
->rd_sbd
, byte
< end
);
104 cur_state
= (*byte
>> bit
) & GFS2_BIT_MASK
;
110 * gfs2_bitfit - Search an rgrp's bitmap buffer to find a bit-pair representing
111 * a block in a given allocation state.
112 * @buffer: the buffer that holds the bitmaps
113 * @buflen: the length (in bytes) of the buffer
114 * @goal: start search at this block's bit-pair (within @buffer)
115 * @old_state: GFS2_BLKST_XXX the state of the block we're looking for;
116 * bit 0 = alloc(1)/free(0), bit 1 = meta(1)/data(0)
118 * Scope of @goal and returned block number is only within this bitmap buffer,
119 * not entire rgrp or filesystem. @buffer will be offset from the actual
120 * beginning of a bitmap block buffer, skipping any header structures.
122 * Return: the block number (bitmap buffer scope) that was found
125 static uint32_t gfs2_bitfit(struct gfs2_rgrpd
*rgd
, unsigned char *buffer
,
126 unsigned int buflen
, uint32_t goal
,
127 unsigned char old_state
)
129 unsigned char *byte
, *end
, alloc
;
133 byte
= buffer
+ (goal
/ GFS2_NBBY
);
134 bit
= (goal
% GFS2_NBBY
) * GFS2_BIT_SIZE
;
135 end
= buffer
+ buflen
;
136 alloc
= (old_state
& 1) ? 0 : 0x55;
139 if ((*byte
& 0x55) == alloc
) {
140 blk
+= (8 - bit
) >> 1;
148 if (((*byte
>> bit
) & GFS2_BIT_MASK
) == old_state
)
151 bit
+= GFS2_BIT_SIZE
;
164 * gfs2_bitcount - count the number of bits in a certain state
165 * @buffer: the buffer that holds the bitmaps
166 * @buflen: the length (in bytes) of the buffer
167 * @state: the state of the block we're looking for
169 * Returns: The number of bits
172 static uint32_t gfs2_bitcount(struct gfs2_rgrpd
*rgd
, unsigned char *buffer
,
173 unsigned int buflen
, unsigned char state
)
175 unsigned char *byte
= buffer
;
176 unsigned char *end
= buffer
+ buflen
;
177 unsigned char state1
= state
<< 2;
178 unsigned char state2
= state
<< 4;
179 unsigned char state3
= state
<< 6;
182 for (; byte
< end
; byte
++) {
183 if (((*byte
) & 0x03) == state
)
185 if (((*byte
) & 0x0C) == state1
)
187 if (((*byte
) & 0x30) == state2
)
189 if (((*byte
) & 0xC0) == state3
)
197 * gfs2_rgrp_verify - Verify that a resource group is consistent
198 * @sdp: the filesystem
203 void gfs2_rgrp_verify(struct gfs2_rgrpd
*rgd
)
205 struct gfs2_sbd
*sdp
= rgd
->rd_sbd
;
206 struct gfs2_bitmap
*bi
= NULL
;
207 uint32_t length
= rgd
->rd_ri
.ri_length
;
208 uint32_t count
[4], tmp
;
211 memset(count
, 0, 4 * sizeof(uint32_t));
213 /* Count # blocks in each of 4 possible allocation states */
214 for (buf
= 0; buf
< length
; buf
++) {
215 bi
= rgd
->rd_bits
+ buf
;
216 for (x
= 0; x
< 4; x
++)
217 count
[x
] += gfs2_bitcount(rgd
,
223 if (count
[0] != rgd
->rd_rg
.rg_free
) {
224 if (gfs2_consist_rgrpd(rgd
))
225 fs_err(sdp
, "free data mismatch: %u != %u\n",
226 count
[0], rgd
->rd_rg
.rg_free
);
230 tmp
= rgd
->rd_ri
.ri_data
-
232 rgd
->rd_rg
.rg_dinodes
;
233 if (count
[1] + count
[2] != tmp
) {
234 if (gfs2_consist_rgrpd(rgd
))
235 fs_err(sdp
, "used data mismatch: %u != %u\n",
240 if (count
[3] != rgd
->rd_rg
.rg_dinodes
) {
241 if (gfs2_consist_rgrpd(rgd
))
242 fs_err(sdp
, "used metadata mismatch: %u != %u\n",
243 count
[3], rgd
->rd_rg
.rg_dinodes
);
247 if (count
[2] > count
[3]) {
248 if (gfs2_consist_rgrpd(rgd
))
249 fs_err(sdp
, "unlinked inodes > inodes: %u\n",
256 static inline int rgrp_contains_block(struct gfs2_rindex
*ri
, uint64_t block
)
258 uint64_t first
= ri
->ri_data0
;
259 uint64_t last
= first
+ ri
->ri_data
;
260 return !!(first
<= block
&& block
< last
);
264 * gfs2_blk2rgrpd - Find resource group for a given data/meta block number
265 * @sdp: The GFS2 superblock
266 * @n: The data block number
268 * Returns: The resource group, or NULL if not found
271 struct gfs2_rgrpd
*gfs2_blk2rgrpd(struct gfs2_sbd
*sdp
, uint64_t blk
)
273 struct gfs2_rgrpd
*rgd
;
275 spin_lock(&sdp
->sd_rindex_spin
);
277 list_for_each_entry(rgd
, &sdp
->sd_rindex_mru_list
, rd_list_mru
) {
278 if (rgrp_contains_block(&rgd
->rd_ri
, blk
)) {
279 list_move(&rgd
->rd_list_mru
, &sdp
->sd_rindex_mru_list
);
280 spin_unlock(&sdp
->sd_rindex_spin
);
285 spin_unlock(&sdp
->sd_rindex_spin
);
291 * gfs2_rgrpd_get_first - get the first Resource Group in the filesystem
292 * @sdp: The GFS2 superblock
294 * Returns: The first rgrp in the filesystem
297 struct gfs2_rgrpd
*gfs2_rgrpd_get_first(struct gfs2_sbd
*sdp
)
299 gfs2_assert(sdp
, !list_empty(&sdp
->sd_rindex_list
));
300 return list_entry(sdp
->sd_rindex_list
.next
, struct gfs2_rgrpd
, rd_list
);
304 * gfs2_rgrpd_get_next - get the next RG
307 * Returns: The next rgrp
310 struct gfs2_rgrpd
*gfs2_rgrpd_get_next(struct gfs2_rgrpd
*rgd
)
312 if (rgd
->rd_list
.next
== &rgd
->rd_sbd
->sd_rindex_list
)
314 return list_entry(rgd
->rd_list
.next
, struct gfs2_rgrpd
, rd_list
);
317 static void clear_rgrpdi(struct gfs2_sbd
*sdp
)
319 struct list_head
*head
;
320 struct gfs2_rgrpd
*rgd
;
321 struct gfs2_glock
*gl
;
323 spin_lock(&sdp
->sd_rindex_spin
);
324 sdp
->sd_rindex_forward
= NULL
;
325 head
= &sdp
->sd_rindex_recent_list
;
326 while (!list_empty(head
)) {
327 rgd
= list_entry(head
->next
, struct gfs2_rgrpd
, rd_recent
);
328 list_del(&rgd
->rd_recent
);
330 spin_unlock(&sdp
->sd_rindex_spin
);
332 head
= &sdp
->sd_rindex_list
;
333 while (!list_empty(head
)) {
334 rgd
= list_entry(head
->next
, struct gfs2_rgrpd
, rd_list
);
337 list_del(&rgd
->rd_list
);
338 list_del(&rgd
->rd_list_mru
);
341 gl
->gl_object
= NULL
;
350 void gfs2_clear_rgrpd(struct gfs2_sbd
*sdp
)
352 mutex_lock(&sdp
->sd_rindex_mutex
);
354 mutex_unlock(&sdp
->sd_rindex_mutex
);
358 * gfs2_compute_bitstructs - Compute the bitmap sizes
359 * @rgd: The resource group descriptor
361 * Calculates bitmap descriptors, one for each block that contains bitmap data
366 static int compute_bitstructs(struct gfs2_rgrpd
*rgd
)
368 struct gfs2_sbd
*sdp
= rgd
->rd_sbd
;
369 struct gfs2_bitmap
*bi
;
370 uint32_t length
= rgd
->rd_ri
.ri_length
; /* # blocks in hdr & bitmap */
371 uint32_t bytes_left
, bytes
;
377 rgd
->rd_bits
= kcalloc(length
, sizeof(struct gfs2_bitmap
), GFP_KERNEL
);
381 bytes_left
= rgd
->rd_ri
.ri_bitbytes
;
383 for (x
= 0; x
< length
; x
++) {
384 bi
= rgd
->rd_bits
+ x
;
386 /* small rgrp; bitmap stored completely in header block */
389 bi
->bi_offset
= sizeof(struct gfs2_rgrp
);
394 bytes
= sdp
->sd_sb
.sb_bsize
- sizeof(struct gfs2_rgrp
);
395 bi
->bi_offset
= sizeof(struct gfs2_rgrp
);
399 } else if (x
+ 1 == length
) {
401 bi
->bi_offset
= sizeof(struct gfs2_meta_header
);
402 bi
->bi_start
= rgd
->rd_ri
.ri_bitbytes
- bytes_left
;
406 bytes
= sdp
->sd_sb
.sb_bsize
-
407 sizeof(struct gfs2_meta_header
);
408 bi
->bi_offset
= sizeof(struct gfs2_meta_header
);
409 bi
->bi_start
= rgd
->rd_ri
.ri_bitbytes
- bytes_left
;
417 gfs2_consist_rgrpd(rgd
);
420 bi
= rgd
->rd_bits
+ (length
- 1);
421 if ((bi
->bi_start
+ bi
->bi_len
) * GFS2_NBBY
!= rgd
->rd_ri
.ri_data
) {
422 if (gfs2_consist_rgrpd(rgd
)) {
423 gfs2_rindex_print(&rgd
->rd_ri
);
424 fs_err(sdp
, "start=%u len=%u offset=%u\n",
425 bi
->bi_start
, bi
->bi_len
, bi
->bi_offset
);
434 * gfs2_ri_update - Pull in a new resource index from the disk
435 * @gl: The glock covering the rindex inode
437 * Returns: 0 on successful update, error code otherwise
440 static int gfs2_ri_update(struct gfs2_inode
*ip
)
442 struct gfs2_sbd
*sdp
= GFS2_SB(&ip
->i_inode
);
443 struct inode
*inode
= &ip
->i_inode
;
444 struct gfs2_rgrpd
*rgd
;
445 char buf
[sizeof(struct gfs2_rindex
)];
446 struct file_ra_state ra_state
;
447 uint64_t junk
= ip
->i_di
.di_size
;
450 printk(KERN_INFO
"gfs2_ri_update inode=%p\n", inode
);
452 if (do_div(junk
, sizeof(struct gfs2_rindex
))) {
453 gfs2_consist_inode(ip
);
459 printk(KERN_INFO
"rgrps cleared\n");
461 file_ra_state_init(&ra_state
, inode
->i_mapping
);
462 for (sdp
->sd_rgrps
= 0;; sdp
->sd_rgrps
++) {
463 loff_t pos
= sdp
->sd_rgrps
* sizeof(struct gfs2_rindex
);
464 printk(KERN_INFO
"reading rgrp %d\n", sdp
->sd_rgrps
);
465 error
= gfs2_internal_read(ip
, &ra_state
, buf
, &pos
,
466 sizeof(struct gfs2_rindex
));
469 if (error
!= sizeof(struct gfs2_rindex
)) {
475 rgd
= kzalloc(sizeof(struct gfs2_rgrpd
), GFP_KERNEL
);
480 mutex_init(&rgd
->rd_mutex
);
481 lops_init_le(&rgd
->rd_le
, &gfs2_rg_lops
);
484 list_add_tail(&rgd
->rd_list
, &sdp
->sd_rindex_list
);
485 list_add_tail(&rgd
->rd_list_mru
, &sdp
->sd_rindex_mru_list
);
487 gfs2_rindex_in(&rgd
->rd_ri
, buf
);
488 printk(KERN_INFO
"compute bitstructs\n");
489 error
= compute_bitstructs(rgd
);
493 printk(KERN_INFO
"gfs2_glock_get\n");
494 error
= gfs2_glock_get(sdp
, rgd
->rd_ri
.ri_addr
,
495 &gfs2_rgrp_glops
, CREATE
, &rgd
->rd_gl
);
496 printk(KERN_INFO
"gfs2_glock_got one\n");
500 rgd
->rd_gl
->gl_object
= rgd
;
501 rgd
->rd_rg_vn
= rgd
->rd_gl
->gl_vn
- 1;
504 printk(KERN_INFO
"ok, finished\n");
505 sdp
->sd_rindex_vn
= ip
->i_gl
->gl_vn
;
509 printk(KERN_INFO
"fail\n");
511 printk(KERN_INFO
"cleared rgrps\n");
516 * gfs2_rindex_hold - Grab a lock on the rindex
517 * @sdp: The GFS2 superblock
518 * @ri_gh: the glock holder
520 * We grab a lock on the rindex inode to make sure that it doesn't
521 * change whilst we are performing an operation. We keep this lock
522 * for quite long periods of time compared to other locks. This
523 * doesn't matter, since it is shared and it is very, very rarely
524 * accessed in the exclusive mode (i.e. only when expanding the filesystem).
526 * This makes sure that we're using the latest copy of the resource index
527 * special file, which might have been updated if someone expanded the
528 * filesystem (via gfs2_grow utility), which adds new resource groups.
530 * Returns: 0 on success, error code otherwise
533 int gfs2_rindex_hold(struct gfs2_sbd
*sdp
, struct gfs2_holder
*ri_gh
)
535 struct gfs2_inode
*ip
= GFS2_I(sdp
->sd_rindex
);
536 struct gfs2_glock
*gl
= ip
->i_gl
;
539 error
= gfs2_glock_nq_init(gl
, LM_ST_SHARED
, 0, ri_gh
);
543 /* Read new copy from disk if we don't have the latest */
544 if (sdp
->sd_rindex_vn
!= gl
->gl_vn
) {
545 mutex_lock(&sdp
->sd_rindex_mutex
);
546 if (sdp
->sd_rindex_vn
!= gl
->gl_vn
) {
547 error
= gfs2_ri_update(ip
);
549 gfs2_glock_dq_uninit(ri_gh
);
551 mutex_unlock(&sdp
->sd_rindex_mutex
);
558 * gfs2_rgrp_bh_get - Read in a RG's header and bitmaps
559 * @rgd: the struct gfs2_rgrpd describing the RG to read in
561 * Read in all of a Resource Group's header and bitmap blocks.
562 * Caller must eventually call gfs2_rgrp_relse() to free the bitmaps.
567 int gfs2_rgrp_bh_get(struct gfs2_rgrpd
*rgd
)
569 struct gfs2_sbd
*sdp
= rgd
->rd_sbd
;
570 struct gfs2_glock
*gl
= rgd
->rd_gl
;
571 unsigned int length
= rgd
->rd_ri
.ri_length
;
572 struct gfs2_bitmap
*bi
;
576 mutex_lock(&rgd
->rd_mutex
);
578 spin_lock(&sdp
->sd_rindex_spin
);
579 if (rgd
->rd_bh_count
) {
581 spin_unlock(&sdp
->sd_rindex_spin
);
582 mutex_unlock(&rgd
->rd_mutex
);
585 spin_unlock(&sdp
->sd_rindex_spin
);
587 for (x
= 0; x
< length
; x
++) {
588 bi
= rgd
->rd_bits
+ x
;
589 error
= gfs2_meta_read(gl
, rgd
->rd_ri
.ri_addr
+ x
, DIO_START
,
595 for (y
= length
; y
--;) {
596 bi
= rgd
->rd_bits
+ y
;
597 error
= gfs2_meta_reread(sdp
, bi
->bi_bh
, DIO_WAIT
);
600 if (gfs2_metatype_check(sdp
, bi
->bi_bh
, y
? GFS2_METATYPE_RB
:
607 if (rgd
->rd_rg_vn
!= gl
->gl_vn
) {
608 gfs2_rgrp_in(&rgd
->rd_rg
, (rgd
->rd_bits
[0].bi_bh
)->b_data
);
609 rgd
->rd_rg_vn
= gl
->gl_vn
;
612 spin_lock(&sdp
->sd_rindex_spin
);
613 rgd
->rd_free_clone
= rgd
->rd_rg
.rg_free
;
615 spin_unlock(&sdp
->sd_rindex_spin
);
617 mutex_unlock(&rgd
->rd_mutex
);
623 bi
= rgd
->rd_bits
+ x
;
626 gfs2_assert_warn(sdp
, !bi
->bi_clone
);
628 mutex_unlock(&rgd
->rd_mutex
);
633 void gfs2_rgrp_bh_hold(struct gfs2_rgrpd
*rgd
)
635 struct gfs2_sbd
*sdp
= rgd
->rd_sbd
;
637 spin_lock(&sdp
->sd_rindex_spin
);
638 gfs2_assert_warn(rgd
->rd_sbd
, rgd
->rd_bh_count
);
640 spin_unlock(&sdp
->sd_rindex_spin
);
644 * gfs2_rgrp_bh_put - Release RG bitmaps read in with gfs2_rgrp_bh_get()
645 * @rgd: the struct gfs2_rgrpd describing the RG to read in
649 void gfs2_rgrp_bh_put(struct gfs2_rgrpd
*rgd
)
651 struct gfs2_sbd
*sdp
= rgd
->rd_sbd
;
652 int x
, length
= rgd
->rd_ri
.ri_length
;
654 spin_lock(&sdp
->sd_rindex_spin
);
655 gfs2_assert_warn(rgd
->rd_sbd
, rgd
->rd_bh_count
);
656 if (--rgd
->rd_bh_count
) {
657 spin_unlock(&sdp
->sd_rindex_spin
);
661 for (x
= 0; x
< length
; x
++) {
662 struct gfs2_bitmap
*bi
= rgd
->rd_bits
+ x
;
669 spin_unlock(&sdp
->sd_rindex_spin
);
672 void gfs2_rgrp_repolish_clones(struct gfs2_rgrpd
*rgd
)
674 struct gfs2_sbd
*sdp
= rgd
->rd_sbd
;
675 unsigned int length
= rgd
->rd_ri
.ri_length
;
678 for (x
= 0; x
< length
; x
++) {
679 struct gfs2_bitmap
*bi
= rgd
->rd_bits
+ x
;
682 memcpy(bi
->bi_clone
+ bi
->bi_offset
,
683 bi
->bi_bh
->b_data
+ bi
->bi_offset
, bi
->bi_len
);
686 spin_lock(&sdp
->sd_rindex_spin
);
687 rgd
->rd_free_clone
= rgd
->rd_rg
.rg_free
;
688 spin_unlock(&sdp
->sd_rindex_spin
);
692 * gfs2_alloc_get - get the struct gfs2_alloc structure for an inode
693 * @ip: the incore GFS2 inode structure
695 * Returns: the struct gfs2_alloc
698 struct gfs2_alloc
*gfs2_alloc_get(struct gfs2_inode
*ip
)
700 struct gfs2_alloc
*al
= &ip
->i_alloc
;
702 /* FIXME: Should assert that the correct locks are held here... */
703 memset(al
, 0, sizeof(*al
));
708 * gfs2_alloc_put - throw away the struct gfs2_alloc for an inode
713 void gfs2_alloc_put(struct gfs2_inode
*ip
)
719 * try_rgrp_fit - See if a given reservation will fit in a given RG
721 * @al: the struct gfs2_alloc structure describing the reservation
723 * If there's room for the requested blocks to be allocated from the RG:
724 * Sets the $al_reserved_data field in @al.
725 * Sets the $al_reserved_meta field in @al.
726 * Sets the $al_rgd field in @al.
728 * Returns: 1 on success (it fits), 0 on failure (it doesn't fit)
731 static int try_rgrp_fit(struct gfs2_rgrpd
*rgd
, struct gfs2_alloc
*al
)
733 struct gfs2_sbd
*sdp
= rgd
->rd_sbd
;
736 spin_lock(&sdp
->sd_rindex_spin
);
737 if (rgd
->rd_free_clone
>= al
->al_requested
) {
741 spin_unlock(&sdp
->sd_rindex_spin
);
747 * recent_rgrp_first - get first RG from "recent" list
748 * @sdp: The GFS2 superblock
749 * @rglast: address of the rgrp used last
751 * Returns: The first rgrp in the recent list
754 static struct gfs2_rgrpd
*recent_rgrp_first(struct gfs2_sbd
*sdp
,
757 struct gfs2_rgrpd
*rgd
= NULL
;
759 spin_lock(&sdp
->sd_rindex_spin
);
761 if (list_empty(&sdp
->sd_rindex_recent_list
))
767 list_for_each_entry(rgd
, &sdp
->sd_rindex_recent_list
, rd_recent
) {
768 if (rgd
->rd_ri
.ri_addr
== rglast
)
773 rgd
= list_entry(sdp
->sd_rindex_recent_list
.next
, struct gfs2_rgrpd
,
776 spin_unlock(&sdp
->sd_rindex_spin
);
781 * recent_rgrp_next - get next RG from "recent" list
782 * @cur_rgd: current rgrp
785 * Returns: The next rgrp in the recent list
788 static struct gfs2_rgrpd
*recent_rgrp_next(struct gfs2_rgrpd
*cur_rgd
,
791 struct gfs2_sbd
*sdp
= cur_rgd
->rd_sbd
;
792 struct list_head
*head
;
793 struct gfs2_rgrpd
*rgd
;
795 spin_lock(&sdp
->sd_rindex_spin
);
797 head
= &sdp
->sd_rindex_recent_list
;
799 list_for_each_entry(rgd
, head
, rd_recent
) {
800 if (rgd
== cur_rgd
) {
801 if (cur_rgd
->rd_recent
.next
!= head
)
802 rgd
= list_entry(cur_rgd
->rd_recent
.next
,
803 struct gfs2_rgrpd
, rd_recent
);
808 list_del(&cur_rgd
->rd_recent
);
815 if (!list_empty(head
))
816 rgd
= list_entry(head
->next
, struct gfs2_rgrpd
, rd_recent
);
819 spin_unlock(&sdp
->sd_rindex_spin
);
824 * recent_rgrp_add - add an RG to tail of "recent" list
825 * @new_rgd: The rgrp to add
829 static void recent_rgrp_add(struct gfs2_rgrpd
*new_rgd
)
831 struct gfs2_sbd
*sdp
= new_rgd
->rd_sbd
;
832 struct gfs2_rgrpd
*rgd
;
833 unsigned int count
= 0;
834 unsigned int max
= sdp
->sd_rgrps
/ gfs2_jindex_size(sdp
);
836 spin_lock(&sdp
->sd_rindex_spin
);
838 list_for_each_entry(rgd
, &sdp
->sd_rindex_recent_list
, rd_recent
) {
845 list_add_tail(&new_rgd
->rd_recent
, &sdp
->sd_rindex_recent_list
);
848 spin_unlock(&sdp
->sd_rindex_spin
);
852 * forward_rgrp_get - get an rgrp to try next from full list
853 * @sdp: The GFS2 superblock
855 * Returns: The rgrp to try next
858 static struct gfs2_rgrpd
*forward_rgrp_get(struct gfs2_sbd
*sdp
)
860 struct gfs2_rgrpd
*rgd
;
861 unsigned int journals
= gfs2_jindex_size(sdp
);
862 unsigned int rg
= 0, x
;
864 spin_lock(&sdp
->sd_rindex_spin
);
866 rgd
= sdp
->sd_rindex_forward
;
868 if (sdp
->sd_rgrps
>= journals
)
869 rg
= sdp
->sd_rgrps
* sdp
->sd_jdesc
->jd_jid
/ journals
;
871 for (x
= 0, rgd
= gfs2_rgrpd_get_first(sdp
);
873 x
++, rgd
= gfs2_rgrpd_get_next(rgd
))
876 sdp
->sd_rindex_forward
= rgd
;
879 spin_unlock(&sdp
->sd_rindex_spin
);
885 * forward_rgrp_set - set the forward rgrp pointer
886 * @sdp: the filesystem
887 * @rgd: The new forward rgrp
891 static void forward_rgrp_set(struct gfs2_sbd
*sdp
, struct gfs2_rgrpd
*rgd
)
893 spin_lock(&sdp
->sd_rindex_spin
);
894 sdp
->sd_rindex_forward
= rgd
;
895 spin_unlock(&sdp
->sd_rindex_spin
);
899 * get_local_rgrp - Choose and lock a rgrp for allocation
900 * @ip: the inode to reserve space for
901 * @rgp: the chosen and locked rgrp
903 * Try to acquire rgrp in way which avoids contending with others.
908 static int get_local_rgrp(struct gfs2_inode
*ip
)
910 struct gfs2_sbd
*sdp
= GFS2_SB(&ip
->i_inode
);
911 struct gfs2_rgrpd
*rgd
, *begin
= NULL
;
912 struct gfs2_alloc
*al
= &ip
->i_alloc
;
913 int flags
= LM_FLAG_TRY
;
918 /* Try recently successful rgrps */
920 rgd
= recent_rgrp_first(sdp
, ip
->i_last_rg_alloc
);
923 error
= gfs2_glock_nq_init(rgd
->rd_gl
,
924 LM_ST_EXCLUSIVE
, LM_FLAG_TRY
,
928 if (try_rgrp_fit(rgd
, al
))
930 gfs2_glock_dq_uninit(&al
->al_rgd_gh
);
931 rgd
= recent_rgrp_next(rgd
, 1);
935 rgd
= recent_rgrp_next(rgd
, 0);
943 /* Go through full list of rgrps */
945 begin
= rgd
= forward_rgrp_get(sdp
);
948 error
= gfs2_glock_nq_init(rgd
->rd_gl
,
949 LM_ST_EXCLUSIVE
, flags
,
953 if (try_rgrp_fit(rgd
, al
))
955 gfs2_glock_dq_uninit(&al
->al_rgd_gh
);
966 rgd
= gfs2_rgrpd_get_next(rgd
);
968 rgd
= gfs2_rgrpd_get_first(sdp
);
971 if (++loops
>= 2 || !skipped
)
978 ip
->i_last_rg_alloc
= rgd
->rd_ri
.ri_addr
;
981 recent_rgrp_add(rgd
);
982 rgd
= gfs2_rgrpd_get_next(rgd
);
984 rgd
= gfs2_rgrpd_get_first(sdp
);
985 forward_rgrp_set(sdp
, rgd
);
992 * gfs2_inplace_reserve_i - Reserve space in the filesystem
993 * @ip: the inode to reserve space for
998 int gfs2_inplace_reserve_i(struct gfs2_inode
*ip
, char *file
, unsigned int line
)
1000 struct gfs2_sbd
*sdp
= GFS2_SB(&ip
->i_inode
);
1001 struct gfs2_alloc
*al
= &ip
->i_alloc
;
1004 if (gfs2_assert_warn(sdp
, al
->al_requested
))
1007 error
= gfs2_rindex_hold(sdp
, &al
->al_ri_gh
);
1011 error
= get_local_rgrp(ip
);
1013 gfs2_glock_dq_uninit(&al
->al_ri_gh
);
1024 * gfs2_inplace_release - release an inplace reservation
1025 * @ip: the inode the reservation was taken out on
1027 * Release a reservation made by gfs2_inplace_reserve().
1030 void gfs2_inplace_release(struct gfs2_inode
*ip
)
1032 struct gfs2_sbd
*sdp
= GFS2_SB(&ip
->i_inode
);
1033 struct gfs2_alloc
*al
= &ip
->i_alloc
;
1035 if (gfs2_assert_warn(sdp
, al
->al_alloced
<= al
->al_requested
) == -1)
1036 fs_warn(sdp
, "al_alloced = %u, al_requested = %u "
1037 "al_file = %s, al_line = %u\n",
1038 al
->al_alloced
, al
->al_requested
, al
->al_file
,
1042 gfs2_glock_dq_uninit(&al
->al_rgd_gh
);
1043 gfs2_glock_dq_uninit(&al
->al_ri_gh
);
1047 * gfs2_get_block_type - Check a block in a RG is of given type
1048 * @rgd: the resource group holding the block
1049 * @block: the block number
1051 * Returns: The block type (GFS2_BLKST_*)
1054 unsigned char gfs2_get_block_type(struct gfs2_rgrpd
*rgd
, uint64_t block
)
1056 struct gfs2_bitmap
*bi
= NULL
;
1057 uint32_t length
, rgrp_block
, buf_block
;
1061 length
= rgd
->rd_ri
.ri_length
;
1062 rgrp_block
= block
- rgd
->rd_ri
.ri_data0
;
1064 for (buf
= 0; buf
< length
; buf
++) {
1065 bi
= rgd
->rd_bits
+ buf
;
1066 if (rgrp_block
< (bi
->bi_start
+ bi
->bi_len
) * GFS2_NBBY
)
1070 gfs2_assert(rgd
->rd_sbd
, buf
< length
);
1071 buf_block
= rgrp_block
- bi
->bi_start
* GFS2_NBBY
;
1073 type
= gfs2_testbit(rgd
, bi
->bi_bh
->b_data
+ bi
->bi_offset
,
1074 bi
->bi_len
, buf_block
);
1080 * rgblk_search - find a block in @old_state, change allocation
1081 * state to @new_state
1082 * @rgd: the resource group descriptor
1083 * @goal: the goal block within the RG (start here to search for avail block)
1084 * @old_state: GFS2_BLKST_XXX the before-allocation state to find
1085 * @new_state: GFS2_BLKST_XXX the after-allocation block state
1087 * Walk rgrp's bitmap to find bits that represent a block in @old_state.
1088 * Add the found bitmap buffer to the transaction.
1089 * Set the found bits to @new_state to change block's allocation state.
1091 * This function never fails, because we wouldn't call it unless we
1092 * know (from reservation results, etc.) that a block is available.
1094 * Scope of @goal and returned block is just within rgrp, not the whole
1097 * Returns: the block number allocated
1100 static uint32_t rgblk_search(struct gfs2_rgrpd
*rgd
, uint32_t goal
,
1101 unsigned char old_state
, unsigned char new_state
)
1103 struct gfs2_bitmap
*bi
= NULL
;
1104 uint32_t length
= rgd
->rd_ri
.ri_length
;
1106 unsigned int buf
, x
;
1108 /* Find bitmap block that contains bits for goal block */
1109 for (buf
= 0; buf
< length
; buf
++) {
1110 bi
= rgd
->rd_bits
+ buf
;
1111 if (goal
< (bi
->bi_start
+ bi
->bi_len
) * GFS2_NBBY
)
1115 gfs2_assert(rgd
->rd_sbd
, buf
< length
);
1117 /* Convert scope of "goal" from rgrp-wide to within found bit block */
1118 goal
-= bi
->bi_start
* GFS2_NBBY
;
1120 /* Search (up to entire) bitmap in this rgrp for allocatable block.
1121 "x <= length", instead of "x < length", because we typically start
1122 the search in the middle of a bit block, but if we can't find an
1123 allocatable block anywhere else, we want to be able wrap around and
1124 search in the first part of our first-searched bit block. */
1125 for (x
= 0; x
<= length
; x
++) {
1127 blk
= gfs2_bitfit(rgd
, bi
->bi_clone
+ bi
->bi_offset
,
1128 bi
->bi_len
, goal
, old_state
);
1130 blk
= gfs2_bitfit(rgd
,
1131 bi
->bi_bh
->b_data
+ bi
->bi_offset
,
1132 bi
->bi_len
, goal
, old_state
);
1133 if (blk
!= BFITNOENT
)
1136 /* Try next bitmap block (wrap back to rgrp header if at end) */
1137 buf
= (buf
+ 1) % length
;
1138 bi
= rgd
->rd_bits
+ buf
;
1142 if (gfs2_assert_withdraw(rgd
->rd_sbd
, x
<= length
))
1145 gfs2_trans_add_bh(rgd
->rd_gl
, bi
->bi_bh
, 1);
1146 gfs2_setbit(rgd
, bi
->bi_bh
->b_data
+ bi
->bi_offset
,
1147 bi
->bi_len
, blk
, new_state
);
1149 gfs2_setbit(rgd
, bi
->bi_clone
+ bi
->bi_offset
,
1150 bi
->bi_len
, blk
, new_state
);
1152 return bi
->bi_start
* GFS2_NBBY
+ blk
;
1156 * rgblk_free - Change alloc state of given block(s)
1157 * @sdp: the filesystem
1158 * @bstart: the start of a run of blocks to free
1159 * @blen: the length of the block run (all must lie within ONE RG!)
1160 * @new_state: GFS2_BLKST_XXX the after-allocation block state
1162 * Returns: Resource group containing the block(s)
1165 static struct gfs2_rgrpd
*rgblk_free(struct gfs2_sbd
*sdp
, uint64_t bstart
,
1166 uint32_t blen
, unsigned char new_state
)
1168 struct gfs2_rgrpd
*rgd
;
1169 struct gfs2_bitmap
*bi
= NULL
;
1170 uint32_t length
, rgrp_blk
, buf_blk
;
1173 rgd
= gfs2_blk2rgrpd(sdp
, bstart
);
1175 if (gfs2_consist(sdp
))
1176 fs_err(sdp
, "block = %llu\n", (unsigned long long)bstart
);
1180 length
= rgd
->rd_ri
.ri_length
;
1182 rgrp_blk
= bstart
- rgd
->rd_ri
.ri_data0
;
1185 for (buf
= 0; buf
< length
; buf
++) {
1186 bi
= rgd
->rd_bits
+ buf
;
1187 if (rgrp_blk
< (bi
->bi_start
+ bi
->bi_len
) * GFS2_NBBY
)
1191 gfs2_assert(rgd
->rd_sbd
, buf
< length
);
1193 buf_blk
= rgrp_blk
- bi
->bi_start
* GFS2_NBBY
;
1196 if (!bi
->bi_clone
) {
1197 bi
->bi_clone
= kmalloc(bi
->bi_bh
->b_size
,
1198 GFP_KERNEL
| __GFP_NOFAIL
);
1199 memcpy(bi
->bi_clone
+ bi
->bi_offset
,
1200 bi
->bi_bh
->b_data
+ bi
->bi_offset
,
1203 gfs2_trans_add_bh(rgd
->rd_gl
, bi
->bi_bh
, 1);
1205 bi
->bi_bh
->b_data
+ bi
->bi_offset
,
1206 bi
->bi_len
, buf_blk
, new_state
);
1213 * gfs2_alloc_data - Allocate a data block
1214 * @ip: the inode to allocate the data block for
1216 * Returns: the allocated block
1219 uint64_t gfs2_alloc_data(struct gfs2_inode
*ip
)
1221 struct gfs2_sbd
*sdp
= GFS2_SB(&ip
->i_inode
);
1222 struct gfs2_alloc
*al
= &ip
->i_alloc
;
1223 struct gfs2_rgrpd
*rgd
= al
->al_rgd
;
1227 if (rgrp_contains_block(&rgd
->rd_ri
, ip
->i_di
.di_goal_data
))
1228 goal
= ip
->i_di
.di_goal_data
- rgd
->rd_ri
.ri_data0
;
1230 goal
= rgd
->rd_last_alloc_data
;
1232 blk
= rgblk_search(rgd
, goal
, GFS2_BLKST_FREE
, GFS2_BLKST_USED
);
1233 rgd
->rd_last_alloc_data
= blk
;
1235 block
= rgd
->rd_ri
.ri_data0
+ blk
;
1236 ip
->i_di
.di_goal_data
= block
;
1238 gfs2_assert_withdraw(sdp
, rgd
->rd_rg
.rg_free
);
1239 rgd
->rd_rg
.rg_free
--;
1241 gfs2_trans_add_bh(rgd
->rd_gl
, rgd
->rd_bits
[0].bi_bh
, 1);
1242 gfs2_rgrp_out(&rgd
->rd_rg
, rgd
->rd_bits
[0].bi_bh
->b_data
);
1246 gfs2_statfs_change(sdp
, 0, -1, 0);
1247 gfs2_quota_change(ip
, +1, ip
->i_di
.di_uid
, ip
->i_di
.di_gid
);
1249 spin_lock(&sdp
->sd_rindex_spin
);
1250 rgd
->rd_free_clone
--;
1251 spin_unlock(&sdp
->sd_rindex_spin
);
1257 * gfs2_alloc_meta - Allocate a metadata block
1258 * @ip: the inode to allocate the metadata block for
1260 * Returns: the allocated block
1263 uint64_t gfs2_alloc_meta(struct gfs2_inode
*ip
)
1265 struct gfs2_sbd
*sdp
= GFS2_SB(&ip
->i_inode
);
1266 struct gfs2_alloc
*al
= &ip
->i_alloc
;
1267 struct gfs2_rgrpd
*rgd
= al
->al_rgd
;
1271 if (rgrp_contains_block(&rgd
->rd_ri
, ip
->i_di
.di_goal_meta
))
1272 goal
= ip
->i_di
.di_goal_meta
- rgd
->rd_ri
.ri_data0
;
1274 goal
= rgd
->rd_last_alloc_meta
;
1276 blk
= rgblk_search(rgd
, goal
, GFS2_BLKST_FREE
, GFS2_BLKST_USED
);
1277 rgd
->rd_last_alloc_meta
= blk
;
1279 block
= rgd
->rd_ri
.ri_data0
+ blk
;
1280 ip
->i_di
.di_goal_meta
= block
;
1282 gfs2_assert_withdraw(sdp
, rgd
->rd_rg
.rg_free
);
1283 rgd
->rd_rg
.rg_free
--;
1285 gfs2_trans_add_bh(rgd
->rd_gl
, rgd
->rd_bits
[0].bi_bh
, 1);
1286 gfs2_rgrp_out(&rgd
->rd_rg
, rgd
->rd_bits
[0].bi_bh
->b_data
);
1290 gfs2_statfs_change(sdp
, 0, -1, 0);
1291 gfs2_quota_change(ip
, +1, ip
->i_di
.di_uid
, ip
->i_di
.di_gid
);
1292 gfs2_trans_add_unrevoke(sdp
, block
);
1294 spin_lock(&sdp
->sd_rindex_spin
);
1295 rgd
->rd_free_clone
--;
1296 spin_unlock(&sdp
->sd_rindex_spin
);
1302 * gfs2_alloc_di - Allocate a dinode
1303 * @dip: the directory that the inode is going in
1305 * Returns: the block allocated
1308 uint64_t gfs2_alloc_di(struct gfs2_inode
*dip
)
1310 struct gfs2_sbd
*sdp
= GFS2_SB(&dip
->i_inode
);
1311 struct gfs2_alloc
*al
= &dip
->i_alloc
;
1312 struct gfs2_rgrpd
*rgd
= al
->al_rgd
;
1316 blk
= rgblk_search(rgd
, rgd
->rd_last_alloc_meta
,
1317 GFS2_BLKST_FREE
, GFS2_BLKST_DINODE
);
1319 rgd
->rd_last_alloc_meta
= blk
;
1321 block
= rgd
->rd_ri
.ri_data0
+ blk
;
1323 gfs2_assert_withdraw(sdp
, rgd
->rd_rg
.rg_free
);
1324 rgd
->rd_rg
.rg_free
--;
1325 rgd
->rd_rg
.rg_dinodes
++;
1327 gfs2_trans_add_bh(rgd
->rd_gl
, rgd
->rd_bits
[0].bi_bh
, 1);
1328 gfs2_rgrp_out(&rgd
->rd_rg
, rgd
->rd_bits
[0].bi_bh
->b_data
);
1332 gfs2_statfs_change(sdp
, 0, -1, +1);
1333 gfs2_trans_add_unrevoke(sdp
, block
);
1335 spin_lock(&sdp
->sd_rindex_spin
);
1336 rgd
->rd_free_clone
--;
1337 spin_unlock(&sdp
->sd_rindex_spin
);
1343 * gfs2_free_data - free a contiguous run of data block(s)
1344 * @ip: the inode these blocks are being freed from
1345 * @bstart: first block of a run of contiguous blocks
1346 * @blen: the length of the block run
1350 void gfs2_free_data(struct gfs2_inode
*ip
, uint64_t bstart
, uint32_t blen
)
1352 struct gfs2_sbd
*sdp
= GFS2_SB(&ip
->i_inode
);
1353 struct gfs2_rgrpd
*rgd
;
1355 rgd
= rgblk_free(sdp
, bstart
, blen
, GFS2_BLKST_FREE
);
1359 rgd
->rd_rg
.rg_free
+= blen
;
1361 gfs2_trans_add_bh(rgd
->rd_gl
, rgd
->rd_bits
[0].bi_bh
, 1);
1362 gfs2_rgrp_out(&rgd
->rd_rg
, rgd
->rd_bits
[0].bi_bh
->b_data
);
1364 gfs2_trans_add_rg(rgd
);
1366 gfs2_statfs_change(sdp
, 0, +blen
, 0);
1367 gfs2_quota_change(ip
, -(int64_t)blen
,
1368 ip
->i_di
.di_uid
, ip
->i_di
.di_gid
);
1372 * gfs2_free_meta - free a contiguous run of data block(s)
1373 * @ip: the inode these blocks are being freed from
1374 * @bstart: first block of a run of contiguous blocks
1375 * @blen: the length of the block run
1379 void gfs2_free_meta(struct gfs2_inode
*ip
, uint64_t bstart
, uint32_t blen
)
1381 struct gfs2_sbd
*sdp
= GFS2_SB(&ip
->i_inode
);
1382 struct gfs2_rgrpd
*rgd
;
1384 rgd
= rgblk_free(sdp
, bstart
, blen
, GFS2_BLKST_FREE
);
1388 rgd
->rd_rg
.rg_free
+= blen
;
1390 gfs2_trans_add_bh(rgd
->rd_gl
, rgd
->rd_bits
[0].bi_bh
, 1);
1391 gfs2_rgrp_out(&rgd
->rd_rg
, rgd
->rd_bits
[0].bi_bh
->b_data
);
1393 gfs2_trans_add_rg(rgd
);
1395 gfs2_statfs_change(sdp
, 0, +blen
, 0);
1396 gfs2_quota_change(ip
, -(int64_t)blen
, ip
->i_di
.di_uid
, ip
->i_di
.di_gid
);
1397 gfs2_meta_wipe(ip
, bstart
, blen
);
1400 void gfs2_unlink_di(struct inode
*inode
)
1402 struct gfs2_inode
*ip
= GFS2_I(inode
);
1403 struct gfs2_sbd
*sdp
= GFS2_SB(inode
);
1404 struct gfs2_rgrpd
*rgd
;
1405 u64 blkno
= ip
->i_num
.no_addr
;
1407 rgd
= rgblk_free(sdp
, blkno
, 1, GFS2_BLKST_UNLINKED
);
1410 gfs2_trans_add_bh(rgd
->rd_gl
, rgd
->rd_bits
[0].bi_bh
, 1);
1411 gfs2_rgrp_out(&rgd
->rd_rg
, rgd
->rd_bits
[0].bi_bh
->b_data
);
1412 gfs2_trans_add_rg(rgd
);
1415 void gfs2_free_uninit_di(struct gfs2_rgrpd
*rgd
, uint64_t blkno
)
1417 struct gfs2_sbd
*sdp
= rgd
->rd_sbd
;
1418 struct gfs2_rgrpd
*tmp_rgd
;
1420 tmp_rgd
= rgblk_free(sdp
, blkno
, 1, GFS2_BLKST_FREE
);
1423 gfs2_assert_withdraw(sdp
, rgd
== tmp_rgd
);
1425 if (!rgd
->rd_rg
.rg_dinodes
)
1426 gfs2_consist_rgrpd(rgd
);
1427 rgd
->rd_rg
.rg_dinodes
--;
1428 rgd
->rd_rg
.rg_free
++;
1430 gfs2_trans_add_bh(rgd
->rd_gl
, rgd
->rd_bits
[0].bi_bh
, 1);
1431 gfs2_rgrp_out(&rgd
->rd_rg
, rgd
->rd_bits
[0].bi_bh
->b_data
);
1433 gfs2_statfs_change(sdp
, 0, +1, -1);
1434 gfs2_trans_add_rg(rgd
);
1438 void gfs2_free_di(struct gfs2_rgrpd
*rgd
, struct gfs2_inode
*ip
)
1440 gfs2_free_uninit_di(rgd
, ip
->i_num
.no_addr
);
1441 gfs2_quota_change(ip
, -1, ip
->i_di
.di_uid
, ip
->i_di
.di_gid
);
1442 gfs2_meta_wipe(ip
, ip
->i_num
.no_addr
, 1);
1446 * gfs2_rlist_add - add a RG to a list of RGs
1447 * @sdp: the filesystem
1448 * @rlist: the list of resource groups
1451 * Figure out what RG a block belongs to and add that RG to the list
1453 * FIXME: Don't use NOFAIL
1457 void gfs2_rlist_add(struct gfs2_sbd
*sdp
, struct gfs2_rgrp_list
*rlist
,
1460 struct gfs2_rgrpd
*rgd
;
1461 struct gfs2_rgrpd
**tmp
;
1462 unsigned int new_space
;
1465 if (gfs2_assert_warn(sdp
, !rlist
->rl_ghs
))
1468 rgd
= gfs2_blk2rgrpd(sdp
, block
);
1470 if (gfs2_consist(sdp
))
1471 fs_err(sdp
, "block = %llu\n", (unsigned long long)block
);
1475 for (x
= 0; x
< rlist
->rl_rgrps
; x
++)
1476 if (rlist
->rl_rgd
[x
] == rgd
)
1479 if (rlist
->rl_rgrps
== rlist
->rl_space
) {
1480 new_space
= rlist
->rl_space
+ 10;
1482 tmp
= kcalloc(new_space
, sizeof(struct gfs2_rgrpd
*),
1483 GFP_KERNEL
| __GFP_NOFAIL
);
1485 if (rlist
->rl_rgd
) {
1486 memcpy(tmp
, rlist
->rl_rgd
,
1487 rlist
->rl_space
* sizeof(struct gfs2_rgrpd
*));
1488 kfree(rlist
->rl_rgd
);
1491 rlist
->rl_space
= new_space
;
1492 rlist
->rl_rgd
= tmp
;
1495 rlist
->rl_rgd
[rlist
->rl_rgrps
++] = rgd
;
1499 * gfs2_rlist_alloc - all RGs have been added to the rlist, now allocate
1500 * and initialize an array of glock holders for them
1501 * @rlist: the list of resource groups
1502 * @state: the lock state to acquire the RG lock in
1503 * @flags: the modifier flags for the holder structures
1505 * FIXME: Don't use NOFAIL
1509 void gfs2_rlist_alloc(struct gfs2_rgrp_list
*rlist
, unsigned int state
,
1514 rlist
->rl_ghs
= kcalloc(rlist
->rl_rgrps
, sizeof(struct gfs2_holder
),
1515 GFP_KERNEL
| __GFP_NOFAIL
);
1516 for (x
= 0; x
< rlist
->rl_rgrps
; x
++)
1517 gfs2_holder_init(rlist
->rl_rgd
[x
]->rd_gl
,
1523 * gfs2_rlist_free - free a resource group list
1524 * @list: the list of resource groups
1528 void gfs2_rlist_free(struct gfs2_rgrp_list
*rlist
)
1532 kfree(rlist
->rl_rgd
);
1534 if (rlist
->rl_ghs
) {
1535 for (x
= 0; x
< rlist
->rl_rgrps
; x
++)
1536 gfs2_holder_uninit(&rlist
->rl_ghs
[x
]);
1537 kfree(rlist
->rl_ghs
);