2 * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
3 * Copyright (C) 2004-2008 Red Hat, Inc. All rights reserved.
5 * This copyrighted material is made available to anyone wishing to use,
6 * modify, copy, or redistribute it subject to the terms and conditions
7 * of the GNU General Public License version 2.
10 #include <linux/slab.h>
11 #include <linux/spinlock.h>
12 #include <linux/completion.h>
13 #include <linux/buffer_head.h>
15 #include <linux/gfs2_ondisk.h>
16 #include <linux/lm_interface.h>
31 #include "ops_address.h"
33 #define BFITNOENT ((u32)~0)
34 #define NO_BLOCK ((u64)~0)
37 * These routines are used by the resource group routines (rgrp.c)
38 * to keep track of block allocation. Each block is represented by two
39 * bits. So, each byte represents GFS2_NBBY (i.e. 4) blocks.
42 * 1 = Used (not metadata)
43 * 2 = Unlinked (still in use) inode
47 static const char valid_change
[16] = {
55 static u32
rgblk_search(struct gfs2_rgrpd
*rgd
, u32 goal
,
56 unsigned char old_state
, unsigned char new_state
);
59 * gfs2_setbit - Set a bit in the bitmaps
60 * @buffer: the buffer that holds the bitmaps
61 * @buflen: the length (in bytes) of the buffer
62 * @block: the block to set
63 * @new_state: the new state of the block
67 static void gfs2_setbit(struct gfs2_rgrpd
*rgd
, unsigned char *buffer
,
68 unsigned int buflen
, u32 block
,
69 unsigned char new_state
)
71 unsigned char *byte
, *end
, cur_state
;
74 byte
= buffer
+ (block
/ GFS2_NBBY
);
75 bit
= (block
% GFS2_NBBY
) * GFS2_BIT_SIZE
;
76 end
= buffer
+ buflen
;
78 gfs2_assert(rgd
->rd_sbd
, byte
< end
);
80 cur_state
= (*byte
>> bit
) & GFS2_BIT_MASK
;
82 if (valid_change
[new_state
* 4 + cur_state
]) {
83 *byte
^= cur_state
<< bit
;
84 *byte
|= new_state
<< bit
;
86 gfs2_consist_rgrpd(rgd
);
90 * gfs2_testbit - test a bit in the bitmaps
91 * @buffer: the buffer that holds the bitmaps
92 * @buflen: the length (in bytes) of the buffer
93 * @block: the block to read
97 static unsigned char gfs2_testbit(struct gfs2_rgrpd
*rgd
, unsigned char *buffer
,
98 unsigned int buflen
, u32 block
)
100 unsigned char *byte
, *end
, cur_state
;
103 byte
= buffer
+ (block
/ GFS2_NBBY
);
104 bit
= (block
% GFS2_NBBY
) * GFS2_BIT_SIZE
;
105 end
= buffer
+ buflen
;
107 gfs2_assert(rgd
->rd_sbd
, byte
< end
);
109 cur_state
= (*byte
>> bit
) & GFS2_BIT_MASK
;
115 * gfs2_bitfit - Search an rgrp's bitmap buffer to find a bit-pair representing
116 * a block in a given allocation state.
117 * @buffer: the buffer that holds the bitmaps
118 * @buflen: the length (in bytes) of the buffer
119 * @goal: start search at this block's bit-pair (within @buffer)
120 * @old_state: GFS2_BLKST_XXX the state of the block we're looking for.
122 * Scope of @goal and returned block number is only within this bitmap buffer,
123 * not entire rgrp or filesystem. @buffer will be offset from the actual
124 * beginning of a bitmap block buffer, skipping any header structures.
126 * Return: the block number (bitmap buffer scope) that was found
129 static u32
gfs2_bitfit(const u8
*buffer
, unsigned int buflen
, u32 goal
,
134 unsigned int bit
, bitlong
;
135 const unsigned long *plong
;
136 #if BITS_PER_LONG == 32
137 const unsigned long plong55
= 0x55555555;
139 const unsigned long plong55
= 0x5555555555555555;
142 byte
= buffer
+ (goal
/ GFS2_NBBY
);
143 plong
= (const unsigned long *)(buffer
+ (goal
/ GFS2_NBBY
));
144 bit
= (goal
% GFS2_NBBY
) * GFS2_BIT_SIZE
;
147 while (byte
< buffer
+ buflen
) {
149 if (bitlong
== 0 && old_state
== 0 && *plong
== plong55
) {
151 byte
+= sizeof(unsigned long);
152 blk
+= sizeof(unsigned long) * GFS2_NBBY
;
155 if (((*byte
>> bit
) & GFS2_BIT_MASK
) == old_state
)
157 bit
+= GFS2_BIT_SIZE
;
162 bitlong
+= GFS2_BIT_SIZE
;
163 if (bitlong
>= sizeof(unsigned long) * 8) {
175 * gfs2_bitcount - count the number of bits in a certain state
176 * @buffer: the buffer that holds the bitmaps
177 * @buflen: the length (in bytes) of the buffer
178 * @state: the state of the block we're looking for
180 * Returns: The number of bits
183 static u32
gfs2_bitcount(struct gfs2_rgrpd
*rgd
, const u8
*buffer
,
184 unsigned int buflen
, u8 state
)
186 const u8
*byte
= buffer
;
187 const u8
*end
= buffer
+ buflen
;
188 const u8 state1
= state
<< 2;
189 const u8 state2
= state
<< 4;
190 const u8 state3
= state
<< 6;
193 for (; byte
< end
; byte
++) {
194 if (((*byte
) & 0x03) == state
)
196 if (((*byte
) & 0x0C) == state1
)
198 if (((*byte
) & 0x30) == state2
)
200 if (((*byte
) & 0xC0) == state3
)
208 * gfs2_rgrp_verify - Verify that a resource group is consistent
209 * @sdp: the filesystem
214 void gfs2_rgrp_verify(struct gfs2_rgrpd
*rgd
)
216 struct gfs2_sbd
*sdp
= rgd
->rd_sbd
;
217 struct gfs2_bitmap
*bi
= NULL
;
218 u32 length
= rgd
->rd_length
;
222 memset(count
, 0, 4 * sizeof(u32
));
224 /* Count # blocks in each of 4 possible allocation states */
225 for (buf
= 0; buf
< length
; buf
++) {
226 bi
= rgd
->rd_bits
+ buf
;
227 for (x
= 0; x
< 4; x
++)
228 count
[x
] += gfs2_bitcount(rgd
,
234 if (count
[0] != rgd
->rd_rg
.rg_free
) {
235 if (gfs2_consist_rgrpd(rgd
))
236 fs_err(sdp
, "free data mismatch: %u != %u\n",
237 count
[0], rgd
->rd_rg
.rg_free
);
243 rgd
->rd_rg
.rg_dinodes
;
244 if (count
[1] + count
[2] != tmp
) {
245 if (gfs2_consist_rgrpd(rgd
))
246 fs_err(sdp
, "used data mismatch: %u != %u\n",
251 if (count
[3] != rgd
->rd_rg
.rg_dinodes
) {
252 if (gfs2_consist_rgrpd(rgd
))
253 fs_err(sdp
, "used metadata mismatch: %u != %u\n",
254 count
[3], rgd
->rd_rg
.rg_dinodes
);
258 if (count
[2] > count
[3]) {
259 if (gfs2_consist_rgrpd(rgd
))
260 fs_err(sdp
, "unlinked inodes > inodes: %u\n",
267 static inline int rgrp_contains_block(struct gfs2_rgrpd
*rgd
, u64 block
)
269 u64 first
= rgd
->rd_data0
;
270 u64 last
= first
+ rgd
->rd_data
;
271 return first
<= block
&& block
< last
;
275 * gfs2_blk2rgrpd - Find resource group for a given data/meta block number
276 * @sdp: The GFS2 superblock
277 * @n: The data block number
279 * Returns: The resource group, or NULL if not found
282 struct gfs2_rgrpd
*gfs2_blk2rgrpd(struct gfs2_sbd
*sdp
, u64 blk
)
284 struct gfs2_rgrpd
*rgd
;
286 spin_lock(&sdp
->sd_rindex_spin
);
288 list_for_each_entry(rgd
, &sdp
->sd_rindex_mru_list
, rd_list_mru
) {
289 if (rgrp_contains_block(rgd
, blk
)) {
290 list_move(&rgd
->rd_list_mru
, &sdp
->sd_rindex_mru_list
);
291 spin_unlock(&sdp
->sd_rindex_spin
);
296 spin_unlock(&sdp
->sd_rindex_spin
);
302 * gfs2_rgrpd_get_first - get the first Resource Group in the filesystem
303 * @sdp: The GFS2 superblock
305 * Returns: The first rgrp in the filesystem
308 struct gfs2_rgrpd
*gfs2_rgrpd_get_first(struct gfs2_sbd
*sdp
)
310 gfs2_assert(sdp
, !list_empty(&sdp
->sd_rindex_list
));
311 return list_entry(sdp
->sd_rindex_list
.next
, struct gfs2_rgrpd
, rd_list
);
315 * gfs2_rgrpd_get_next - get the next RG
318 * Returns: The next rgrp
321 struct gfs2_rgrpd
*gfs2_rgrpd_get_next(struct gfs2_rgrpd
*rgd
)
323 if (rgd
->rd_list
.next
== &rgd
->rd_sbd
->sd_rindex_list
)
325 return list_entry(rgd
->rd_list
.next
, struct gfs2_rgrpd
, rd_list
);
328 static void clear_rgrpdi(struct gfs2_sbd
*sdp
)
330 struct list_head
*head
;
331 struct gfs2_rgrpd
*rgd
;
332 struct gfs2_glock
*gl
;
334 spin_lock(&sdp
->sd_rindex_spin
);
335 sdp
->sd_rindex_forward
= NULL
;
336 head
= &sdp
->sd_rindex_recent_list
;
337 while (!list_empty(head
)) {
338 rgd
= list_entry(head
->next
, struct gfs2_rgrpd
, rd_recent
);
339 list_del(&rgd
->rd_recent
);
341 spin_unlock(&sdp
->sd_rindex_spin
);
343 head
= &sdp
->sd_rindex_list
;
344 while (!list_empty(head
)) {
345 rgd
= list_entry(head
->next
, struct gfs2_rgrpd
, rd_list
);
348 list_del(&rgd
->rd_list
);
349 list_del(&rgd
->rd_list_mru
);
352 gl
->gl_object
= NULL
;
357 kmem_cache_free(gfs2_rgrpd_cachep
, rgd
);
361 void gfs2_clear_rgrpd(struct gfs2_sbd
*sdp
)
363 mutex_lock(&sdp
->sd_rindex_mutex
);
365 mutex_unlock(&sdp
->sd_rindex_mutex
);
368 static void gfs2_rindex_print(const struct gfs2_rgrpd
*rgd
)
370 printk(KERN_INFO
" ri_addr = %llu\n", (unsigned long long)rgd
->rd_addr
);
371 printk(KERN_INFO
" ri_length = %u\n", rgd
->rd_length
);
372 printk(KERN_INFO
" ri_data0 = %llu\n", (unsigned long long)rgd
->rd_data0
);
373 printk(KERN_INFO
" ri_data = %u\n", rgd
->rd_data
);
374 printk(KERN_INFO
" ri_bitbytes = %u\n", rgd
->rd_bitbytes
);
378 * gfs2_compute_bitstructs - Compute the bitmap sizes
379 * @rgd: The resource group descriptor
381 * Calculates bitmap descriptors, one for each block that contains bitmap data
386 static int compute_bitstructs(struct gfs2_rgrpd
*rgd
)
388 struct gfs2_sbd
*sdp
= rgd
->rd_sbd
;
389 struct gfs2_bitmap
*bi
;
390 u32 length
= rgd
->rd_length
; /* # blocks in hdr & bitmap */
391 u32 bytes_left
, bytes
;
397 rgd
->rd_bits
= kcalloc(length
, sizeof(struct gfs2_bitmap
), GFP_NOFS
);
401 bytes_left
= rgd
->rd_bitbytes
;
403 for (x
= 0; x
< length
; x
++) {
404 bi
= rgd
->rd_bits
+ x
;
406 /* small rgrp; bitmap stored completely in header block */
409 bi
->bi_offset
= sizeof(struct gfs2_rgrp
);
414 bytes
= sdp
->sd_sb
.sb_bsize
- sizeof(struct gfs2_rgrp
);
415 bi
->bi_offset
= sizeof(struct gfs2_rgrp
);
419 } else if (x
+ 1 == length
) {
421 bi
->bi_offset
= sizeof(struct gfs2_meta_header
);
422 bi
->bi_start
= rgd
->rd_bitbytes
- bytes_left
;
426 bytes
= sdp
->sd_sb
.sb_bsize
-
427 sizeof(struct gfs2_meta_header
);
428 bi
->bi_offset
= sizeof(struct gfs2_meta_header
);
429 bi
->bi_start
= rgd
->rd_bitbytes
- bytes_left
;
437 gfs2_consist_rgrpd(rgd
);
440 bi
= rgd
->rd_bits
+ (length
- 1);
441 if ((bi
->bi_start
+ bi
->bi_len
) * GFS2_NBBY
!= rgd
->rd_data
) {
442 if (gfs2_consist_rgrpd(rgd
)) {
443 gfs2_rindex_print(rgd
);
444 fs_err(sdp
, "start=%u len=%u offset=%u\n",
445 bi
->bi_start
, bi
->bi_len
, bi
->bi_offset
);
454 * gfs2_ri_total - Total up the file system space, according to the rindex.
457 u64
gfs2_ri_total(struct gfs2_sbd
*sdp
)
460 struct inode
*inode
= sdp
->sd_rindex
;
461 struct gfs2_inode
*ip
= GFS2_I(inode
);
462 char buf
[sizeof(struct gfs2_rindex
)];
463 struct file_ra_state ra_state
;
466 mutex_lock(&sdp
->sd_rindex_mutex
);
467 file_ra_state_init(&ra_state
, inode
->i_mapping
);
468 for (rgrps
= 0;; rgrps
++) {
469 loff_t pos
= rgrps
* sizeof(struct gfs2_rindex
);
471 if (pos
+ sizeof(struct gfs2_rindex
) >= ip
->i_di
.di_size
)
473 error
= gfs2_internal_read(ip
, &ra_state
, buf
, &pos
,
474 sizeof(struct gfs2_rindex
));
475 if (error
!= sizeof(struct gfs2_rindex
))
477 total_data
+= be32_to_cpu(((struct gfs2_rindex
*)buf
)->ri_data
);
479 mutex_unlock(&sdp
->sd_rindex_mutex
);
483 static void gfs2_rindex_in(struct gfs2_rgrpd
*rgd
, const void *buf
)
485 const struct gfs2_rindex
*str
= buf
;
487 rgd
->rd_addr
= be64_to_cpu(str
->ri_addr
);
488 rgd
->rd_length
= be32_to_cpu(str
->ri_length
);
489 rgd
->rd_data0
= be64_to_cpu(str
->ri_data0
);
490 rgd
->rd_data
= be32_to_cpu(str
->ri_data
);
491 rgd
->rd_bitbytes
= be32_to_cpu(str
->ri_bitbytes
);
495 * read_rindex_entry - Pull in a new resource index entry from the disk
496 * @gl: The glock covering the rindex inode
498 * Returns: 0 on success, error code otherwise
501 static int read_rindex_entry(struct gfs2_inode
*ip
,
502 struct file_ra_state
*ra_state
)
504 struct gfs2_sbd
*sdp
= GFS2_SB(&ip
->i_inode
);
505 loff_t pos
= sdp
->sd_rgrps
* sizeof(struct gfs2_rindex
);
506 char buf
[sizeof(struct gfs2_rindex
)];
508 struct gfs2_rgrpd
*rgd
;
510 error
= gfs2_internal_read(ip
, ra_state
, buf
, &pos
,
511 sizeof(struct gfs2_rindex
));
514 if (error
!= sizeof(struct gfs2_rindex
)) {
520 rgd
= kmem_cache_zalloc(gfs2_rgrpd_cachep
, GFP_NOFS
);
525 mutex_init(&rgd
->rd_mutex
);
526 lops_init_le(&rgd
->rd_le
, &gfs2_rg_lops
);
529 list_add_tail(&rgd
->rd_list
, &sdp
->sd_rindex_list
);
530 list_add_tail(&rgd
->rd_list_mru
, &sdp
->sd_rindex_mru_list
);
532 gfs2_rindex_in(rgd
, buf
);
533 error
= compute_bitstructs(rgd
);
537 error
= gfs2_glock_get(sdp
, rgd
->rd_addr
,
538 &gfs2_rgrp_glops
, CREATE
, &rgd
->rd_gl
);
542 rgd
->rd_gl
->gl_object
= rgd
;
543 rgd
->rd_rg_vn
= rgd
->rd_gl
->gl_vn
- 1;
544 rgd
->rd_flags
|= GFS2_RDF_CHECK
;
549 * gfs2_ri_update - Pull in a new resource index from the disk
550 * @ip: pointer to the rindex inode
552 * Returns: 0 on successful update, error code otherwise
555 static int gfs2_ri_update(struct gfs2_inode
*ip
)
557 struct gfs2_sbd
*sdp
= GFS2_SB(&ip
->i_inode
);
558 struct inode
*inode
= &ip
->i_inode
;
559 struct file_ra_state ra_state
;
560 u64 rgrp_count
= ip
->i_di
.di_size
;
563 if (do_div(rgrp_count
, sizeof(struct gfs2_rindex
))) {
564 gfs2_consist_inode(ip
);
570 file_ra_state_init(&ra_state
, inode
->i_mapping
);
571 for (sdp
->sd_rgrps
= 0; sdp
->sd_rgrps
< rgrp_count
; sdp
->sd_rgrps
++) {
572 error
= read_rindex_entry(ip
, &ra_state
);
579 sdp
->sd_rindex_vn
= ip
->i_gl
->gl_vn
;
584 * gfs2_ri_update_special - Pull in a new resource index from the disk
586 * This is a special version that's safe to call from gfs2_inplace_reserve_i.
587 * In this case we know that we don't have any resource groups in memory yet.
589 * @ip: pointer to the rindex inode
591 * Returns: 0 on successful update, error code otherwise
593 static int gfs2_ri_update_special(struct gfs2_inode
*ip
)
595 struct gfs2_sbd
*sdp
= GFS2_SB(&ip
->i_inode
);
596 struct inode
*inode
= &ip
->i_inode
;
597 struct file_ra_state ra_state
;
600 file_ra_state_init(&ra_state
, inode
->i_mapping
);
601 for (sdp
->sd_rgrps
= 0;; sdp
->sd_rgrps
++) {
602 /* Ignore partials */
603 if ((sdp
->sd_rgrps
+ 1) * sizeof(struct gfs2_rindex
) >
606 error
= read_rindex_entry(ip
, &ra_state
);
613 sdp
->sd_rindex_vn
= ip
->i_gl
->gl_vn
;
618 * gfs2_rindex_hold - Grab a lock on the rindex
619 * @sdp: The GFS2 superblock
620 * @ri_gh: the glock holder
622 * We grab a lock on the rindex inode to make sure that it doesn't
623 * change whilst we are performing an operation. We keep this lock
624 * for quite long periods of time compared to other locks. This
625 * doesn't matter, since it is shared and it is very, very rarely
626 * accessed in the exclusive mode (i.e. only when expanding the filesystem).
628 * This makes sure that we're using the latest copy of the resource index
629 * special file, which might have been updated if someone expanded the
630 * filesystem (via gfs2_grow utility), which adds new resource groups.
632 * Returns: 0 on success, error code otherwise
635 int gfs2_rindex_hold(struct gfs2_sbd
*sdp
, struct gfs2_holder
*ri_gh
)
637 struct gfs2_inode
*ip
= GFS2_I(sdp
->sd_rindex
);
638 struct gfs2_glock
*gl
= ip
->i_gl
;
641 error
= gfs2_glock_nq_init(gl
, LM_ST_SHARED
, 0, ri_gh
);
645 /* Read new copy from disk if we don't have the latest */
646 if (sdp
->sd_rindex_vn
!= gl
->gl_vn
) {
647 mutex_lock(&sdp
->sd_rindex_mutex
);
648 if (sdp
->sd_rindex_vn
!= gl
->gl_vn
) {
649 error
= gfs2_ri_update(ip
);
651 gfs2_glock_dq_uninit(ri_gh
);
653 mutex_unlock(&sdp
->sd_rindex_mutex
);
659 static void gfs2_rgrp_in(struct gfs2_rgrpd
*rgd
, const void *buf
)
661 const struct gfs2_rgrp
*str
= buf
;
662 struct gfs2_rgrp_host
*rg
= &rgd
->rd_rg
;
665 rg_flags
= be32_to_cpu(str
->rg_flags
);
666 if (rg_flags
& GFS2_RGF_NOALLOC
)
667 rgd
->rd_flags
|= GFS2_RDF_NOALLOC
;
669 rgd
->rd_flags
&= ~GFS2_RDF_NOALLOC
;
670 rg
->rg_free
= be32_to_cpu(str
->rg_free
);
671 rg
->rg_dinodes
= be32_to_cpu(str
->rg_dinodes
);
672 rg
->rg_igeneration
= be64_to_cpu(str
->rg_igeneration
);
675 static void gfs2_rgrp_out(struct gfs2_rgrpd
*rgd
, void *buf
)
677 struct gfs2_rgrp
*str
= buf
;
678 struct gfs2_rgrp_host
*rg
= &rgd
->rd_rg
;
681 if (rgd
->rd_flags
& GFS2_RDF_NOALLOC
)
682 rg_flags
|= GFS2_RGF_NOALLOC
;
683 str
->rg_flags
= cpu_to_be32(rg_flags
);
684 str
->rg_free
= cpu_to_be32(rg
->rg_free
);
685 str
->rg_dinodes
= cpu_to_be32(rg
->rg_dinodes
);
686 str
->__pad
= cpu_to_be32(0);
687 str
->rg_igeneration
= cpu_to_be64(rg
->rg_igeneration
);
688 memset(&str
->rg_reserved
, 0, sizeof(str
->rg_reserved
));
692 * gfs2_rgrp_bh_get - Read in a RG's header and bitmaps
693 * @rgd: the struct gfs2_rgrpd describing the RG to read in
695 * Read in all of a Resource Group's header and bitmap blocks.
696 * Caller must eventually call gfs2_rgrp_relse() to free the bitmaps.
701 int gfs2_rgrp_bh_get(struct gfs2_rgrpd
*rgd
)
703 struct gfs2_sbd
*sdp
= rgd
->rd_sbd
;
704 struct gfs2_glock
*gl
= rgd
->rd_gl
;
705 unsigned int length
= rgd
->rd_length
;
706 struct gfs2_bitmap
*bi
;
710 mutex_lock(&rgd
->rd_mutex
);
712 spin_lock(&sdp
->sd_rindex_spin
);
713 if (rgd
->rd_bh_count
) {
715 spin_unlock(&sdp
->sd_rindex_spin
);
716 mutex_unlock(&rgd
->rd_mutex
);
719 spin_unlock(&sdp
->sd_rindex_spin
);
721 for (x
= 0; x
< length
; x
++) {
722 bi
= rgd
->rd_bits
+ x
;
723 error
= gfs2_meta_read(gl
, rgd
->rd_addr
+ x
, 0, &bi
->bi_bh
);
728 for (y
= length
; y
--;) {
729 bi
= rgd
->rd_bits
+ y
;
730 error
= gfs2_meta_wait(sdp
, bi
->bi_bh
);
733 if (gfs2_metatype_check(sdp
, bi
->bi_bh
, y
? GFS2_METATYPE_RB
:
740 if (rgd
->rd_rg_vn
!= gl
->gl_vn
) {
741 gfs2_rgrp_in(rgd
, (rgd
->rd_bits
[0].bi_bh
)->b_data
);
742 rgd
->rd_rg_vn
= gl
->gl_vn
;
745 spin_lock(&sdp
->sd_rindex_spin
);
746 rgd
->rd_free_clone
= rgd
->rd_rg
.rg_free
;
748 spin_unlock(&sdp
->sd_rindex_spin
);
750 mutex_unlock(&rgd
->rd_mutex
);
756 bi
= rgd
->rd_bits
+ x
;
759 gfs2_assert_warn(sdp
, !bi
->bi_clone
);
761 mutex_unlock(&rgd
->rd_mutex
);
766 void gfs2_rgrp_bh_hold(struct gfs2_rgrpd
*rgd
)
768 struct gfs2_sbd
*sdp
= rgd
->rd_sbd
;
770 spin_lock(&sdp
->sd_rindex_spin
);
771 gfs2_assert_warn(rgd
->rd_sbd
, rgd
->rd_bh_count
);
773 spin_unlock(&sdp
->sd_rindex_spin
);
777 * gfs2_rgrp_bh_put - Release RG bitmaps read in with gfs2_rgrp_bh_get()
778 * @rgd: the struct gfs2_rgrpd describing the RG to read in
782 void gfs2_rgrp_bh_put(struct gfs2_rgrpd
*rgd
)
784 struct gfs2_sbd
*sdp
= rgd
->rd_sbd
;
785 int x
, length
= rgd
->rd_length
;
787 spin_lock(&sdp
->sd_rindex_spin
);
788 gfs2_assert_warn(rgd
->rd_sbd
, rgd
->rd_bh_count
);
789 if (--rgd
->rd_bh_count
) {
790 spin_unlock(&sdp
->sd_rindex_spin
);
794 for (x
= 0; x
< length
; x
++) {
795 struct gfs2_bitmap
*bi
= rgd
->rd_bits
+ x
;
802 spin_unlock(&sdp
->sd_rindex_spin
);
805 void gfs2_rgrp_repolish_clones(struct gfs2_rgrpd
*rgd
)
807 struct gfs2_sbd
*sdp
= rgd
->rd_sbd
;
808 unsigned int length
= rgd
->rd_length
;
811 for (x
= 0; x
< length
; x
++) {
812 struct gfs2_bitmap
*bi
= rgd
->rd_bits
+ x
;
815 memcpy(bi
->bi_clone
+ bi
->bi_offset
,
816 bi
->bi_bh
->b_data
+ bi
->bi_offset
, bi
->bi_len
);
819 spin_lock(&sdp
->sd_rindex_spin
);
820 rgd
->rd_free_clone
= rgd
->rd_rg
.rg_free
;
821 spin_unlock(&sdp
->sd_rindex_spin
);
825 * gfs2_alloc_get - get the struct gfs2_alloc structure for an inode
826 * @ip: the incore GFS2 inode structure
828 * Returns: the struct gfs2_alloc
831 struct gfs2_alloc
*gfs2_alloc_get(struct gfs2_inode
*ip
)
833 BUG_ON(ip
->i_alloc
!= NULL
);
834 ip
->i_alloc
= kzalloc(sizeof(struct gfs2_alloc
), GFP_KERNEL
);
839 * try_rgrp_fit - See if a given reservation will fit in a given RG
841 * @al: the struct gfs2_alloc structure describing the reservation
843 * If there's room for the requested blocks to be allocated from the RG:
844 * Sets the $al_rgd field in @al.
846 * Returns: 1 on success (it fits), 0 on failure (it doesn't fit)
849 static int try_rgrp_fit(struct gfs2_rgrpd
*rgd
, struct gfs2_alloc
*al
)
851 struct gfs2_sbd
*sdp
= rgd
->rd_sbd
;
854 if (rgd
->rd_flags
& GFS2_RDF_NOALLOC
)
857 spin_lock(&sdp
->sd_rindex_spin
);
858 if (rgd
->rd_free_clone
>= al
->al_requested
) {
862 spin_unlock(&sdp
->sd_rindex_spin
);
868 * try_rgrp_unlink - Look for any unlinked, allocated, but unused inodes
871 * Returns: The inode, if one has been found
874 static struct inode
*try_rgrp_unlink(struct gfs2_rgrpd
*rgd
, u64
*last_unlinked
)
879 struct gfs2_sbd
*sdp
= rgd
->rd_sbd
;
882 if (goal
>= rgd
->rd_data
)
884 down_write(&sdp
->sd_log_flush_lock
);
885 block
= rgblk_search(rgd
, goal
, GFS2_BLKST_UNLINKED
,
886 GFS2_BLKST_UNLINKED
);
887 up_write(&sdp
->sd_log_flush_lock
);
888 if (block
== BFITNOENT
)
890 /* rgblk_search can return a block < goal, so we need to
891 keep it marching forward. */
892 no_addr
= block
+ rgd
->rd_data0
;
894 if (*last_unlinked
!= NO_BLOCK
&& no_addr
<= *last_unlinked
)
896 *last_unlinked
= no_addr
;
897 inode
= gfs2_inode_lookup(rgd
->rd_sbd
->sd_vfs
, DT_UNKNOWN
,
903 rgd
->rd_flags
&= ~GFS2_RDF_CHECK
;
908 * recent_rgrp_first - get first RG from "recent" list
909 * @sdp: The GFS2 superblock
910 * @rglast: address of the rgrp used last
912 * Returns: The first rgrp in the recent list
915 static struct gfs2_rgrpd
*recent_rgrp_first(struct gfs2_sbd
*sdp
,
918 struct gfs2_rgrpd
*rgd
= NULL
;
920 spin_lock(&sdp
->sd_rindex_spin
);
922 if (list_empty(&sdp
->sd_rindex_recent_list
))
928 list_for_each_entry(rgd
, &sdp
->sd_rindex_recent_list
, rd_recent
) {
929 if (rgd
->rd_addr
== rglast
)
934 rgd
= list_entry(sdp
->sd_rindex_recent_list
.next
, struct gfs2_rgrpd
,
937 spin_unlock(&sdp
->sd_rindex_spin
);
942 * recent_rgrp_next - get next RG from "recent" list
943 * @cur_rgd: current rgrp
946 * Returns: The next rgrp in the recent list
949 static struct gfs2_rgrpd
*recent_rgrp_next(struct gfs2_rgrpd
*cur_rgd
,
952 struct gfs2_sbd
*sdp
= cur_rgd
->rd_sbd
;
953 struct list_head
*head
;
954 struct gfs2_rgrpd
*rgd
;
956 spin_lock(&sdp
->sd_rindex_spin
);
958 head
= &sdp
->sd_rindex_recent_list
;
960 list_for_each_entry(rgd
, head
, rd_recent
) {
961 if (rgd
== cur_rgd
) {
962 if (cur_rgd
->rd_recent
.next
!= head
)
963 rgd
= list_entry(cur_rgd
->rd_recent
.next
,
964 struct gfs2_rgrpd
, rd_recent
);
969 list_del(&cur_rgd
->rd_recent
);
976 if (!list_empty(head
))
977 rgd
= list_entry(head
->next
, struct gfs2_rgrpd
, rd_recent
);
980 spin_unlock(&sdp
->sd_rindex_spin
);
985 * recent_rgrp_add - add an RG to tail of "recent" list
986 * @new_rgd: The rgrp to add
990 static void recent_rgrp_add(struct gfs2_rgrpd
*new_rgd
)
992 struct gfs2_sbd
*sdp
= new_rgd
->rd_sbd
;
993 struct gfs2_rgrpd
*rgd
;
994 unsigned int count
= 0;
995 unsigned int max
= sdp
->sd_rgrps
/ gfs2_jindex_size(sdp
);
997 spin_lock(&sdp
->sd_rindex_spin
);
999 list_for_each_entry(rgd
, &sdp
->sd_rindex_recent_list
, rd_recent
) {
1006 list_add_tail(&new_rgd
->rd_recent
, &sdp
->sd_rindex_recent_list
);
1009 spin_unlock(&sdp
->sd_rindex_spin
);
1013 * forward_rgrp_get - get an rgrp to try next from full list
1014 * @sdp: The GFS2 superblock
1016 * Returns: The rgrp to try next
1019 static struct gfs2_rgrpd
*forward_rgrp_get(struct gfs2_sbd
*sdp
)
1021 struct gfs2_rgrpd
*rgd
;
1022 unsigned int journals
= gfs2_jindex_size(sdp
);
1023 unsigned int rg
= 0, x
;
1025 spin_lock(&sdp
->sd_rindex_spin
);
1027 rgd
= sdp
->sd_rindex_forward
;
1029 if (sdp
->sd_rgrps
>= journals
)
1030 rg
= sdp
->sd_rgrps
* sdp
->sd_jdesc
->jd_jid
/ journals
;
1032 for (x
= 0, rgd
= gfs2_rgrpd_get_first(sdp
); x
< rg
;
1033 x
++, rgd
= gfs2_rgrpd_get_next(rgd
))
1036 sdp
->sd_rindex_forward
= rgd
;
1039 spin_unlock(&sdp
->sd_rindex_spin
);
1045 * forward_rgrp_set - set the forward rgrp pointer
1046 * @sdp: the filesystem
1047 * @rgd: The new forward rgrp
1051 static void forward_rgrp_set(struct gfs2_sbd
*sdp
, struct gfs2_rgrpd
*rgd
)
1053 spin_lock(&sdp
->sd_rindex_spin
);
1054 sdp
->sd_rindex_forward
= rgd
;
1055 spin_unlock(&sdp
->sd_rindex_spin
);
1059 * get_local_rgrp - Choose and lock a rgrp for allocation
1060 * @ip: the inode to reserve space for
1061 * @rgp: the chosen and locked rgrp
1063 * Try to acquire rgrp in way which avoids contending with others.
1068 static struct inode
*get_local_rgrp(struct gfs2_inode
*ip
, u64
*last_unlinked
)
1070 struct inode
*inode
= NULL
;
1071 struct gfs2_sbd
*sdp
= GFS2_SB(&ip
->i_inode
);
1072 struct gfs2_rgrpd
*rgd
, *begin
= NULL
;
1073 struct gfs2_alloc
*al
= ip
->i_alloc
;
1074 int flags
= LM_FLAG_TRY
;
1077 int error
, rg_locked
;
1079 /* Try recently successful rgrps */
1081 rgd
= recent_rgrp_first(sdp
, ip
->i_last_rg_alloc
);
1086 if (gfs2_glock_is_locked_by_me(rgd
->rd_gl
)) {
1090 error
= gfs2_glock_nq_init(rgd
->rd_gl
, LM_ST_EXCLUSIVE
,
1091 LM_FLAG_TRY
, &al
->al_rgd_gh
);
1095 if (try_rgrp_fit(rgd
, al
))
1097 if (rgd
->rd_flags
& GFS2_RDF_CHECK
)
1098 inode
= try_rgrp_unlink(rgd
, last_unlinked
);
1100 gfs2_glock_dq_uninit(&al
->al_rgd_gh
);
1103 rgd
= recent_rgrp_next(rgd
, 1);
1107 rgd
= recent_rgrp_next(rgd
, 0);
1111 return ERR_PTR(error
);
1115 /* Go through full list of rgrps */
1117 begin
= rgd
= forward_rgrp_get(sdp
);
1122 if (gfs2_glock_is_locked_by_me(rgd
->rd_gl
)) {
1126 error
= gfs2_glock_nq_init(rgd
->rd_gl
, LM_ST_EXCLUSIVE
, flags
,
1131 if (try_rgrp_fit(rgd
, al
))
1133 if (rgd
->rd_flags
& GFS2_RDF_CHECK
)
1134 inode
= try_rgrp_unlink(rgd
, last_unlinked
);
1136 gfs2_glock_dq_uninit(&al
->al_rgd_gh
);
1146 return ERR_PTR(error
);
1149 rgd
= gfs2_rgrpd_get_next(rgd
);
1151 rgd
= gfs2_rgrpd_get_first(sdp
);
1155 return ERR_PTR(-ENOSPC
);
1160 gfs2_log_flush(sdp
, NULL
);
1165 ip
->i_last_rg_alloc
= rgd
->rd_addr
;
1168 recent_rgrp_add(rgd
);
1169 rgd
= gfs2_rgrpd_get_next(rgd
);
1171 rgd
= gfs2_rgrpd_get_first(sdp
);
1172 forward_rgrp_set(sdp
, rgd
);
1179 * gfs2_inplace_reserve_i - Reserve space in the filesystem
1180 * @ip: the inode to reserve space for
1185 int gfs2_inplace_reserve_i(struct gfs2_inode
*ip
, char *file
, unsigned int line
)
1187 struct gfs2_sbd
*sdp
= GFS2_SB(&ip
->i_inode
);
1188 struct gfs2_alloc
*al
= ip
->i_alloc
;
1189 struct inode
*inode
;
1191 u64 last_unlinked
= NO_BLOCK
;
1193 if (gfs2_assert_warn(sdp
, al
->al_requested
))
1197 /* We need to hold the rindex unless the inode we're using is
1198 the rindex itself, in which case it's already held. */
1199 if (ip
!= GFS2_I(sdp
->sd_rindex
))
1200 error
= gfs2_rindex_hold(sdp
, &al
->al_ri_gh
);
1201 else if (!sdp
->sd_rgrps
) /* We may not have the rindex read in, so: */
1202 error
= gfs2_ri_update_special(ip
);
1207 inode
= get_local_rgrp(ip
, &last_unlinked
);
1209 if (ip
!= GFS2_I(sdp
->sd_rindex
))
1210 gfs2_glock_dq_uninit(&al
->al_ri_gh
);
1212 return PTR_ERR(inode
);
1214 gfs2_log_flush(sdp
, NULL
);
1225 * gfs2_inplace_release - release an inplace reservation
1226 * @ip: the inode the reservation was taken out on
1228 * Release a reservation made by gfs2_inplace_reserve().
1231 void gfs2_inplace_release(struct gfs2_inode
*ip
)
1233 struct gfs2_sbd
*sdp
= GFS2_SB(&ip
->i_inode
);
1234 struct gfs2_alloc
*al
= ip
->i_alloc
;
1236 if (gfs2_assert_warn(sdp
, al
->al_alloced
<= al
->al_requested
) == -1)
1237 fs_warn(sdp
, "al_alloced = %u, al_requested = %u "
1238 "al_file = %s, al_line = %u\n",
1239 al
->al_alloced
, al
->al_requested
, al
->al_file
,
1243 if (al
->al_rgd_gh
.gh_gl
)
1244 gfs2_glock_dq_uninit(&al
->al_rgd_gh
);
1245 if (ip
!= GFS2_I(sdp
->sd_rindex
))
1246 gfs2_glock_dq_uninit(&al
->al_ri_gh
);
1250 * gfs2_get_block_type - Check a block in a RG is of given type
1251 * @rgd: the resource group holding the block
1252 * @block: the block number
1254 * Returns: The block type (GFS2_BLKST_*)
1257 unsigned char gfs2_get_block_type(struct gfs2_rgrpd
*rgd
, u64 block
)
1259 struct gfs2_bitmap
*bi
= NULL
;
1260 u32 length
, rgrp_block
, buf_block
;
1264 length
= rgd
->rd_length
;
1265 rgrp_block
= block
- rgd
->rd_data0
;
1267 for (buf
= 0; buf
< length
; buf
++) {
1268 bi
= rgd
->rd_bits
+ buf
;
1269 if (rgrp_block
< (bi
->bi_start
+ bi
->bi_len
) * GFS2_NBBY
)
1273 gfs2_assert(rgd
->rd_sbd
, buf
< length
);
1274 buf_block
= rgrp_block
- bi
->bi_start
* GFS2_NBBY
;
1276 type
= gfs2_testbit(rgd
, bi
->bi_bh
->b_data
+ bi
->bi_offset
,
1277 bi
->bi_len
, buf_block
);
1283 * rgblk_search - find a block in @old_state, change allocation
1284 * state to @new_state
1285 * @rgd: the resource group descriptor
1286 * @goal: the goal block within the RG (start here to search for avail block)
1287 * @old_state: GFS2_BLKST_XXX the before-allocation state to find
1288 * @new_state: GFS2_BLKST_XXX the after-allocation block state
1290 * Walk rgrp's bitmap to find bits that represent a block in @old_state.
1291 * Add the found bitmap buffer to the transaction.
1292 * Set the found bits to @new_state to change block's allocation state.
1294 * This function never fails, because we wouldn't call it unless we
1295 * know (from reservation results, etc.) that a block is available.
1297 * Scope of @goal and returned block is just within rgrp, not the whole
1300 * Returns: the block number allocated
1303 static u32
rgblk_search(struct gfs2_rgrpd
*rgd
, u32 goal
,
1304 unsigned char old_state
, unsigned char new_state
)
1306 struct gfs2_bitmap
*bi
= NULL
;
1307 u32 length
= rgd
->rd_length
;
1309 unsigned int buf
, x
;
1311 /* Find bitmap block that contains bits for goal block */
1312 for (buf
= 0; buf
< length
; buf
++) {
1313 bi
= rgd
->rd_bits
+ buf
;
1314 if (goal
< (bi
->bi_start
+ bi
->bi_len
) * GFS2_NBBY
)
1318 gfs2_assert(rgd
->rd_sbd
, buf
< length
);
1320 /* Convert scope of "goal" from rgrp-wide to within found bit block */
1321 goal
-= bi
->bi_start
* GFS2_NBBY
;
1323 /* Search (up to entire) bitmap in this rgrp for allocatable block.
1324 "x <= length", instead of "x < length", because we typically start
1325 the search in the middle of a bit block, but if we can't find an
1326 allocatable block anywhere else, we want to be able wrap around and
1327 search in the first part of our first-searched bit block. */
1328 for (x
= 0; x
<= length
; x
++) {
1329 /* The GFS2_BLKST_UNLINKED state doesn't apply to the clone
1330 bitmaps, so we must search the originals for that. */
1331 const u8
*buffer
= bi
->bi_bh
->b_data
+ bi
->bi_offset
;
1332 if (old_state
!= GFS2_BLKST_UNLINKED
&& bi
->bi_clone
)
1333 buffer
= bi
->bi_clone
+ bi
->bi_offset
;
1335 blk
= gfs2_bitfit(buffer
, bi
->bi_len
, goal
, old_state
);
1336 if (blk
!= BFITNOENT
)
1339 /* Try next bitmap block (wrap back to rgrp header if at end) */
1340 buf
= (buf
+ 1) % length
;
1341 bi
= rgd
->rd_bits
+ buf
;
1345 if (blk
!= BFITNOENT
&& old_state
!= new_state
) {
1346 gfs2_trans_add_bh(rgd
->rd_gl
, bi
->bi_bh
, 1);
1347 gfs2_setbit(rgd
, bi
->bi_bh
->b_data
+ bi
->bi_offset
,
1348 bi
->bi_len
, blk
, new_state
);
1350 gfs2_setbit(rgd
, bi
->bi_clone
+ bi
->bi_offset
,
1351 bi
->bi_len
, blk
, new_state
);
1354 return (blk
== BFITNOENT
) ? blk
: (bi
->bi_start
* GFS2_NBBY
) + blk
;
1358 * rgblk_free - Change alloc state of given block(s)
1359 * @sdp: the filesystem
1360 * @bstart: the start of a run of blocks to free
1361 * @blen: the length of the block run (all must lie within ONE RG!)
1362 * @new_state: GFS2_BLKST_XXX the after-allocation block state
1364 * Returns: Resource group containing the block(s)
1367 static struct gfs2_rgrpd
*rgblk_free(struct gfs2_sbd
*sdp
, u64 bstart
,
1368 u32 blen
, unsigned char new_state
)
1370 struct gfs2_rgrpd
*rgd
;
1371 struct gfs2_bitmap
*bi
= NULL
;
1372 u32 length
, rgrp_blk
, buf_blk
;
1375 rgd
= gfs2_blk2rgrpd(sdp
, bstart
);
1377 if (gfs2_consist(sdp
))
1378 fs_err(sdp
, "block = %llu\n", (unsigned long long)bstart
);
1382 length
= rgd
->rd_length
;
1384 rgrp_blk
= bstart
- rgd
->rd_data0
;
1387 for (buf
= 0; buf
< length
; buf
++) {
1388 bi
= rgd
->rd_bits
+ buf
;
1389 if (rgrp_blk
< (bi
->bi_start
+ bi
->bi_len
) * GFS2_NBBY
)
1393 gfs2_assert(rgd
->rd_sbd
, buf
< length
);
1395 buf_blk
= rgrp_blk
- bi
->bi_start
* GFS2_NBBY
;
1398 if (!bi
->bi_clone
) {
1399 bi
->bi_clone
= kmalloc(bi
->bi_bh
->b_size
,
1400 GFP_NOFS
| __GFP_NOFAIL
);
1401 memcpy(bi
->bi_clone
+ bi
->bi_offset
,
1402 bi
->bi_bh
->b_data
+ bi
->bi_offset
,
1405 gfs2_trans_add_bh(rgd
->rd_gl
, bi
->bi_bh
, 1);
1406 gfs2_setbit(rgd
, bi
->bi_bh
->b_data
+ bi
->bi_offset
,
1407 bi
->bi_len
, buf_blk
, new_state
);
1414 * gfs2_alloc_data - Allocate a data block
1415 * @ip: the inode to allocate the data block for
1417 * Returns: the allocated block
1420 u64
gfs2_alloc_data(struct gfs2_inode
*ip
)
1422 struct gfs2_sbd
*sdp
= GFS2_SB(&ip
->i_inode
);
1423 struct gfs2_alloc
*al
= ip
->i_alloc
;
1424 struct gfs2_rgrpd
*rgd
= al
->al_rgd
;
1428 if (rgrp_contains_block(rgd
, ip
->i_di
.di_goal_data
))
1429 goal
= ip
->i_di
.di_goal_data
- rgd
->rd_data0
;
1431 goal
= rgd
->rd_last_alloc_data
;
1433 blk
= rgblk_search(rgd
, goal
, GFS2_BLKST_FREE
, GFS2_BLKST_USED
);
1434 BUG_ON(blk
== BFITNOENT
);
1435 rgd
->rd_last_alloc_data
= blk
;
1437 block
= rgd
->rd_data0
+ blk
;
1438 ip
->i_di
.di_goal_data
= block
;
1440 gfs2_assert_withdraw(sdp
, rgd
->rd_rg
.rg_free
);
1441 rgd
->rd_rg
.rg_free
--;
1443 gfs2_trans_add_bh(rgd
->rd_gl
, rgd
->rd_bits
[0].bi_bh
, 1);
1444 gfs2_rgrp_out(rgd
, rgd
->rd_bits
[0].bi_bh
->b_data
);
1448 gfs2_statfs_change(sdp
, 0, -1, 0);
1449 gfs2_quota_change(ip
, +1, ip
->i_inode
.i_uid
, ip
->i_inode
.i_gid
);
1451 spin_lock(&sdp
->sd_rindex_spin
);
1452 rgd
->rd_free_clone
--;
1453 spin_unlock(&sdp
->sd_rindex_spin
);
1459 * gfs2_alloc_meta - Allocate a metadata block
1460 * @ip: the inode to allocate the metadata block for
1462 * Returns: the allocated block
1465 u64
gfs2_alloc_meta(struct gfs2_inode
*ip
)
1467 struct gfs2_sbd
*sdp
= GFS2_SB(&ip
->i_inode
);
1468 struct gfs2_alloc
*al
= ip
->i_alloc
;
1469 struct gfs2_rgrpd
*rgd
= al
->al_rgd
;
1473 if (rgrp_contains_block(rgd
, ip
->i_di
.di_goal_meta
))
1474 goal
= ip
->i_di
.di_goal_meta
- rgd
->rd_data0
;
1476 goal
= rgd
->rd_last_alloc_meta
;
1478 blk
= rgblk_search(rgd
, goal
, GFS2_BLKST_FREE
, GFS2_BLKST_USED
);
1479 BUG_ON(blk
== BFITNOENT
);
1480 rgd
->rd_last_alloc_meta
= blk
;
1482 block
= rgd
->rd_data0
+ blk
;
1483 ip
->i_di
.di_goal_meta
= block
;
1485 gfs2_assert_withdraw(sdp
, rgd
->rd_rg
.rg_free
);
1486 rgd
->rd_rg
.rg_free
--;
1488 gfs2_trans_add_bh(rgd
->rd_gl
, rgd
->rd_bits
[0].bi_bh
, 1);
1489 gfs2_rgrp_out(rgd
, rgd
->rd_bits
[0].bi_bh
->b_data
);
1493 gfs2_statfs_change(sdp
, 0, -1, 0);
1494 gfs2_quota_change(ip
, +1, ip
->i_inode
.i_uid
, ip
->i_inode
.i_gid
);
1495 gfs2_trans_add_unrevoke(sdp
, block
);
1497 spin_lock(&sdp
->sd_rindex_spin
);
1498 rgd
->rd_free_clone
--;
1499 spin_unlock(&sdp
->sd_rindex_spin
);
1505 * gfs2_alloc_di - Allocate a dinode
1506 * @dip: the directory that the inode is going in
1508 * Returns: the block allocated
1511 u64
gfs2_alloc_di(struct gfs2_inode
*dip
, u64
*generation
)
1513 struct gfs2_sbd
*sdp
= GFS2_SB(&dip
->i_inode
);
1514 struct gfs2_alloc
*al
= dip
->i_alloc
;
1515 struct gfs2_rgrpd
*rgd
= al
->al_rgd
;
1519 blk
= rgblk_search(rgd
, rgd
->rd_last_alloc_meta
,
1520 GFS2_BLKST_FREE
, GFS2_BLKST_DINODE
);
1521 BUG_ON(blk
== BFITNOENT
);
1523 rgd
->rd_last_alloc_meta
= blk
;
1525 block
= rgd
->rd_data0
+ blk
;
1527 gfs2_assert_withdraw(sdp
, rgd
->rd_rg
.rg_free
);
1528 rgd
->rd_rg
.rg_free
--;
1529 rgd
->rd_rg
.rg_dinodes
++;
1530 *generation
= rgd
->rd_rg
.rg_igeneration
++;
1531 gfs2_trans_add_bh(rgd
->rd_gl
, rgd
->rd_bits
[0].bi_bh
, 1);
1532 gfs2_rgrp_out(rgd
, rgd
->rd_bits
[0].bi_bh
->b_data
);
1536 gfs2_statfs_change(sdp
, 0, -1, +1);
1537 gfs2_trans_add_unrevoke(sdp
, block
);
1539 spin_lock(&sdp
->sd_rindex_spin
);
1540 rgd
->rd_free_clone
--;
1541 spin_unlock(&sdp
->sd_rindex_spin
);
1547 * gfs2_free_data - free a contiguous run of data block(s)
1548 * @ip: the inode these blocks are being freed from
1549 * @bstart: first block of a run of contiguous blocks
1550 * @blen: the length of the block run
1554 void gfs2_free_data(struct gfs2_inode
*ip
, u64 bstart
, u32 blen
)
1556 struct gfs2_sbd
*sdp
= GFS2_SB(&ip
->i_inode
);
1557 struct gfs2_rgrpd
*rgd
;
1559 rgd
= rgblk_free(sdp
, bstart
, blen
, GFS2_BLKST_FREE
);
1563 rgd
->rd_rg
.rg_free
+= blen
;
1565 gfs2_trans_add_bh(rgd
->rd_gl
, rgd
->rd_bits
[0].bi_bh
, 1);
1566 gfs2_rgrp_out(rgd
, rgd
->rd_bits
[0].bi_bh
->b_data
);
1568 gfs2_trans_add_rg(rgd
);
1570 gfs2_statfs_change(sdp
, 0, +blen
, 0);
1571 gfs2_quota_change(ip
, -(s64
)blen
, ip
->i_inode
.i_uid
, ip
->i_inode
.i_gid
);
1575 * gfs2_free_meta - free a contiguous run of data block(s)
1576 * @ip: the inode these blocks are being freed from
1577 * @bstart: first block of a run of contiguous blocks
1578 * @blen: the length of the block run
1582 void gfs2_free_meta(struct gfs2_inode
*ip
, u64 bstart
, u32 blen
)
1584 struct gfs2_sbd
*sdp
= GFS2_SB(&ip
->i_inode
);
1585 struct gfs2_rgrpd
*rgd
;
1587 rgd
= rgblk_free(sdp
, bstart
, blen
, GFS2_BLKST_FREE
);
1591 rgd
->rd_rg
.rg_free
+= blen
;
1593 gfs2_trans_add_bh(rgd
->rd_gl
, rgd
->rd_bits
[0].bi_bh
, 1);
1594 gfs2_rgrp_out(rgd
, rgd
->rd_bits
[0].bi_bh
->b_data
);
1596 gfs2_trans_add_rg(rgd
);
1598 gfs2_statfs_change(sdp
, 0, +blen
, 0);
1599 gfs2_quota_change(ip
, -(s64
)blen
, ip
->i_inode
.i_uid
, ip
->i_inode
.i_gid
);
1600 gfs2_meta_wipe(ip
, bstart
, blen
);
1603 void gfs2_unlink_di(struct inode
*inode
)
1605 struct gfs2_inode
*ip
= GFS2_I(inode
);
1606 struct gfs2_sbd
*sdp
= GFS2_SB(inode
);
1607 struct gfs2_rgrpd
*rgd
;
1608 u64 blkno
= ip
->i_no_addr
;
1610 rgd
= rgblk_free(sdp
, blkno
, 1, GFS2_BLKST_UNLINKED
);
1613 gfs2_trans_add_bh(rgd
->rd_gl
, rgd
->rd_bits
[0].bi_bh
, 1);
1614 gfs2_rgrp_out(rgd
, rgd
->rd_bits
[0].bi_bh
->b_data
);
1615 gfs2_trans_add_rg(rgd
);
1618 static void gfs2_free_uninit_di(struct gfs2_rgrpd
*rgd
, u64 blkno
)
1620 struct gfs2_sbd
*sdp
= rgd
->rd_sbd
;
1621 struct gfs2_rgrpd
*tmp_rgd
;
1623 tmp_rgd
= rgblk_free(sdp
, blkno
, 1, GFS2_BLKST_FREE
);
1626 gfs2_assert_withdraw(sdp
, rgd
== tmp_rgd
);
1628 if (!rgd
->rd_rg
.rg_dinodes
)
1629 gfs2_consist_rgrpd(rgd
);
1630 rgd
->rd_rg
.rg_dinodes
--;
1631 rgd
->rd_rg
.rg_free
++;
1633 gfs2_trans_add_bh(rgd
->rd_gl
, rgd
->rd_bits
[0].bi_bh
, 1);
1634 gfs2_rgrp_out(rgd
, rgd
->rd_bits
[0].bi_bh
->b_data
);
1636 gfs2_statfs_change(sdp
, 0, +1, -1);
1637 gfs2_trans_add_rg(rgd
);
1641 void gfs2_free_di(struct gfs2_rgrpd
*rgd
, struct gfs2_inode
*ip
)
1643 gfs2_free_uninit_di(rgd
, ip
->i_no_addr
);
1644 gfs2_quota_change(ip
, -1, ip
->i_inode
.i_uid
, ip
->i_inode
.i_gid
);
1645 gfs2_meta_wipe(ip
, ip
->i_no_addr
, 1);
1649 * gfs2_rlist_add - add a RG to a list of RGs
1650 * @sdp: the filesystem
1651 * @rlist: the list of resource groups
1654 * Figure out what RG a block belongs to and add that RG to the list
1656 * FIXME: Don't use NOFAIL
1660 void gfs2_rlist_add(struct gfs2_sbd
*sdp
, struct gfs2_rgrp_list
*rlist
,
1663 struct gfs2_rgrpd
*rgd
;
1664 struct gfs2_rgrpd
**tmp
;
1665 unsigned int new_space
;
1668 if (gfs2_assert_warn(sdp
, !rlist
->rl_ghs
))
1671 rgd
= gfs2_blk2rgrpd(sdp
, block
);
1673 if (gfs2_consist(sdp
))
1674 fs_err(sdp
, "block = %llu\n", (unsigned long long)block
);
1678 for (x
= 0; x
< rlist
->rl_rgrps
; x
++)
1679 if (rlist
->rl_rgd
[x
] == rgd
)
1682 if (rlist
->rl_rgrps
== rlist
->rl_space
) {
1683 new_space
= rlist
->rl_space
+ 10;
1685 tmp
= kcalloc(new_space
, sizeof(struct gfs2_rgrpd
*),
1686 GFP_NOFS
| __GFP_NOFAIL
);
1688 if (rlist
->rl_rgd
) {
1689 memcpy(tmp
, rlist
->rl_rgd
,
1690 rlist
->rl_space
* sizeof(struct gfs2_rgrpd
*));
1691 kfree(rlist
->rl_rgd
);
1694 rlist
->rl_space
= new_space
;
1695 rlist
->rl_rgd
= tmp
;
1698 rlist
->rl_rgd
[rlist
->rl_rgrps
++] = rgd
;
1702 * gfs2_rlist_alloc - all RGs have been added to the rlist, now allocate
1703 * and initialize an array of glock holders for them
1704 * @rlist: the list of resource groups
1705 * @state: the lock state to acquire the RG lock in
1706 * @flags: the modifier flags for the holder structures
1708 * FIXME: Don't use NOFAIL
1712 void gfs2_rlist_alloc(struct gfs2_rgrp_list
*rlist
, unsigned int state
)
1716 rlist
->rl_ghs
= kcalloc(rlist
->rl_rgrps
, sizeof(struct gfs2_holder
),
1717 GFP_NOFS
| __GFP_NOFAIL
);
1718 for (x
= 0; x
< rlist
->rl_rgrps
; x
++)
1719 gfs2_holder_init(rlist
->rl_rgd
[x
]->rd_gl
,
1725 * gfs2_rlist_free - free a resource group list
1726 * @list: the list of resource groups
1730 void gfs2_rlist_free(struct gfs2_rgrp_list
*rlist
)
1734 kfree(rlist
->rl_rgd
);
1736 if (rlist
->rl_ghs
) {
1737 for (x
= 0; x
< rlist
->rl_rgrps
; x
++)
1738 gfs2_holder_uninit(&rlist
->rl_ghs
[x
]);
1739 kfree(rlist
->rl_ghs
);