1 // SPDX-License-Identifier: GPL-2.0-only
3 * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
4 * Copyright (C) 2004-2006 Red Hat, Inc. All rights reserved.
7 #include <linux/spinlock.h>
8 #include <linux/completion.h>
9 #include <linux/buffer_head.h>
10 #include <linux/blkdev.h>
11 #include <linux/gfs2_ondisk.h>
12 #include <linux/crc32.h>
13 #include <linux/iomap.h>
14 #include <linux/ktime.h>
30 #include "trace_gfs2.h"
32 /* This doesn't need to be that large as max 64 bit pointers in a 4k
33 * block is 512, so __u16 is fine for that. It saves stack space to
37 struct buffer_head *mp_bh[GFS2_MAX_META_HEIGHT];
38 __u16 mp_list[GFS2_MAX_META_HEIGHT];
39 int mp_fheight; /* find_metapath height */
40 int mp_aheight; /* actual height (lookup height) */
43 static int punch_hole(struct gfs2_inode *ip, u64 offset, u64 length);
46 * gfs2_unstuffer_page - unstuff a stuffed inode into a block cached by a page
48 * @dibh: the dinode buffer
49 * @block: the block number that was allocated
50 * @page: The (optional) page. This is looked up if @page is NULL
55 static int gfs2_unstuffer_page(struct gfs2_inode *ip, struct buffer_head *dibh,
56 u64 block, struct page *page)
58 struct inode *inode = &ip->i_inode;
59 struct buffer_head *bh;
62 if (!page || page->index) {
63 page = find_or_create_page(inode->i_mapping, 0, GFP_NOFS);
69 if (!PageUptodate(page)) {
70 void *kaddr = kmap(page);
71 u64 dsize = i_size_read(inode);
73 if (dsize > gfs2_max_stuffed_size(ip))
74 dsize = gfs2_max_stuffed_size(ip);
76 memcpy(kaddr, dibh->b_data + sizeof(struct gfs2_dinode), dsize);
77 memset(kaddr + dsize, 0, PAGE_SIZE - dsize);
80 SetPageUptodate(page);
83 if (!page_has_buffers(page))
84 create_empty_buffers(page, BIT(inode->i_blkbits),
87 bh = page_buffers(page);
89 if (!buffer_mapped(bh))
90 map_bh(bh, inode->i_sb, block);
92 set_buffer_uptodate(bh);
93 if (gfs2_is_jdata(ip))
94 gfs2_trans_add_data(ip->i_gl, bh);
96 mark_buffer_dirty(bh);
97 gfs2_ordered_add_inode(ip);
109 * gfs2_unstuff_dinode - Unstuff a dinode when the data has grown too big
110 * @ip: The GFS2 inode to unstuff
111 * @page: The (optional) page. This is looked up if the @page is NULL
113 * This routine unstuffs a dinode and returns it to a "normal" state such
114 * that the height can be grown in the traditional way.
119 int gfs2_unstuff_dinode(struct gfs2_inode *ip, struct page *page)
121 struct buffer_head *bh, *dibh;
122 struct gfs2_dinode *di;
124 int isdir = gfs2_is_dir(ip);
127 down_write(&ip->i_rw_mutex);
129 error = gfs2_meta_inode_buffer(ip, &dibh);
133 if (i_size_read(&ip->i_inode)) {
134 /* Get a free block, fill it with the stuffed data,
135 and write it out to disk */
138 error = gfs2_alloc_blocks(ip, &block, &n, 0, NULL);
142 gfs2_trans_remove_revoke(GFS2_SB(&ip->i_inode), block, 1);
143 error = gfs2_dir_get_new_buffer(ip, block, &bh);
146 gfs2_buffer_copy_tail(bh, sizeof(struct gfs2_meta_header),
147 dibh, sizeof(struct gfs2_dinode));
150 error = gfs2_unstuffer_page(ip, dibh, block, page);
156 /* Set up the pointer to the new block */
158 gfs2_trans_add_meta(ip->i_gl, dibh);
159 di = (struct gfs2_dinode *)dibh->b_data;
160 gfs2_buffer_clear_tail(dibh, sizeof(struct gfs2_dinode));
162 if (i_size_read(&ip->i_inode)) {
163 *(__be64 *)(di + 1) = cpu_to_be64(block);
164 gfs2_add_inode_blocks(&ip->i_inode, 1);
165 di->di_blocks = cpu_to_be64(gfs2_get_inode_blocks(&ip->i_inode));
169 di->di_height = cpu_to_be16(1);
174 up_write(&ip->i_rw_mutex);
180 * find_metapath - Find path through the metadata tree
181 * @sdp: The superblock
182 * @block: The disk block to look up
183 * @mp: The metapath to return the result in
184 * @height: The pre-calculated height of the metadata tree
186 * This routine returns a struct metapath structure that defines a path
187 * through the metadata of inode "ip" to get to block "block".
190 * Given: "ip" is a height 3 file, "offset" is 101342453, and this is a
191 * filesystem with a blocksize of 4096.
193 * find_metapath() would return a struct metapath structure set to:
194 * mp_fheight = 3, mp_list[0] = 0, mp_list[1] = 48, and mp_list[2] = 165.
196 * That means that in order to get to the block containing the byte at
197 * offset 101342453, we would load the indirect block pointed to by pointer
198 * 0 in the dinode. We would then load the indirect block pointed to by
199 * pointer 48 in that indirect block. We would then load the data block
200 * pointed to by pointer 165 in that indirect block.
202 * ----------------------------------------
207 * ----------------------------------------
211 * ----------------------------------------
215 * |0 5 6 7 8 9 0 1 2|
216 * ----------------------------------------
220 * ----------------------------------------
225 * ----------------------------------------
229 * ----------------------------------------
230 * | Data block containing offset |
234 * ----------------------------------------
238 static void find_metapath(const struct gfs2_sbd *sdp, u64 block,
239 struct metapath *mp, unsigned int height)
243 mp->mp_fheight = height;
244 for (i = height; i--;)
245 mp->mp_list[i] = do_div(block, sdp->sd_inptrs);
248 static inline unsigned int metapath_branch_start(const struct metapath *mp)
250 if (mp->mp_list[0] == 0)
256 * metaptr1 - Return the first possible metadata pointer in a metapath buffer
257 * @height: The metadata height (0 = dinode)
260 static inline __be64 *metaptr1(unsigned int height, const struct metapath *mp)
262 struct buffer_head *bh = mp->mp_bh[height];
264 return ((__be64 *)(bh->b_data + sizeof(struct gfs2_dinode)));
265 return ((__be64 *)(bh->b_data + sizeof(struct gfs2_meta_header)));
269 * metapointer - Return pointer to start of metadata in a buffer
270 * @height: The metadata height (0 = dinode)
273 * Return a pointer to the block number of the next height of the metadata
274 * tree given a buffer containing the pointer to the current height of the
278 static inline __be64 *metapointer(unsigned int height, const struct metapath *mp)
280 __be64 *p = metaptr1(height, mp);
281 return p + mp->mp_list[height];
284 static inline const __be64 *metaend(unsigned int height, const struct metapath *mp)
286 const struct buffer_head *bh = mp->mp_bh[height];
287 return (const __be64 *)(bh->b_data + bh->b_size);
290 static void clone_metapath(struct metapath *clone, struct metapath *mp)
295 for (hgt = 0; hgt < mp->mp_aheight; hgt++)
296 get_bh(clone->mp_bh[hgt]);
299 static void gfs2_metapath_ra(struct gfs2_glock *gl, __be64 *start, __be64 *end)
303 for (t = start; t < end; t++) {
304 struct buffer_head *rabh;
309 rabh = gfs2_getbuf(gl, be64_to_cpu(*t), CREATE);
310 if (trylock_buffer(rabh)) {
311 if (!buffer_uptodate(rabh)) {
312 rabh->b_end_io = end_buffer_read_sync;
313 submit_bh(REQ_OP_READ,
314 REQ_RAHEAD | REQ_META | REQ_PRIO,
324 static int __fillup_metapath(struct gfs2_inode *ip, struct metapath *mp,
325 unsigned int x, unsigned int h)
328 __be64 *ptr = metapointer(x, mp);
329 u64 dblock = be64_to_cpu(*ptr);
334 ret = gfs2_meta_indirect_buffer(ip, x + 1, dblock, &mp->mp_bh[x + 1]);
338 mp->mp_aheight = x + 1;
343 * lookup_metapath - Walk the metadata tree to a specific point
347 * Assumes that the inode's buffer has already been looked up and
348 * hooked onto mp->mp_bh[0] and that the metapath has been initialised
349 * by find_metapath().
351 * If this function encounters part of the tree which has not been
352 * allocated, it returns the current height of the tree at the point
353 * at which it found the unallocated block. Blocks which are found are
354 * added to the mp->mp_bh[] list.
359 static int lookup_metapath(struct gfs2_inode *ip, struct metapath *mp)
361 return __fillup_metapath(ip, mp, 0, ip->i_height - 1);
365 * fillup_metapath - fill up buffers for the metadata path to a specific height
368 * @h: The height to which it should be mapped
370 * Similar to lookup_metapath, but does lookups for a range of heights
372 * Returns: error or the number of buffers filled
375 static int fillup_metapath(struct gfs2_inode *ip, struct metapath *mp, int h)
381 /* find the first buffer we need to look up. */
382 for (x = h - 1; x > 0; x--) {
387 ret = __fillup_metapath(ip, mp, x, h);
390 return mp->mp_aheight - x - 1;
393 static sector_t metapath_to_block(struct gfs2_sbd *sdp, struct metapath *mp)
395 sector_t factor = 1, block = 0;
398 for (hgt = mp->mp_fheight - 1; hgt >= 0; hgt--) {
399 if (hgt < mp->mp_aheight)
400 block += mp->mp_list[hgt] * factor;
401 factor *= sdp->sd_inptrs;
406 static void release_metapath(struct metapath *mp)
410 for (i = 0; i < GFS2_MAX_META_HEIGHT; i++) {
411 if (mp->mp_bh[i] == NULL)
413 brelse(mp->mp_bh[i]);
419 * gfs2_extent_length - Returns length of an extent of blocks
420 * @bh: The metadata block
421 * @ptr: Current position in @bh
422 * @limit: Max extent length to return
423 * @eob: Set to 1 if we hit "end of block"
425 * Returns: The length of the extent (minimum of one block)
428 static inline unsigned int gfs2_extent_length(struct buffer_head *bh, __be64 *ptr, size_t limit, int *eob)
430 const __be64 *end = (__be64 *)(bh->b_data + bh->b_size);
431 const __be64 *first = ptr;
432 u64 d = be64_to_cpu(*ptr);
440 } while(be64_to_cpu(*ptr) == d);
446 enum walker_status { WALK_STOP, WALK_FOLLOW, WALK_CONTINUE };
449 * gfs2_metadata_walker - walk an indirect block
450 * @mp: Metapath to indirect block
451 * @ptrs: Number of pointers to look at
453 * When returning WALK_FOLLOW, the walker must update @mp to point at the right
454 * indirect block to follow.
456 typedef enum walker_status (*gfs2_metadata_walker)(struct metapath *mp,
460 * gfs2_walk_metadata - walk a tree of indirect blocks
462 * @mp: Starting point of walk
463 * @max_len: Maximum number of blocks to walk
464 * @walker: Called during the walk
466 * Returns 1 if the walk was stopped by @walker, 0 if we went past @max_len or
467 * past the end of metadata, and a negative error code otherwise.
470 static int gfs2_walk_metadata(struct inode *inode, struct metapath *mp,
471 u64 max_len, gfs2_metadata_walker walker)
473 struct gfs2_inode *ip = GFS2_I(inode);
474 struct gfs2_sbd *sdp = GFS2_SB(inode);
480 * The walk starts in the lowest allocated indirect block, which may be
481 * before the position indicated by @mp. Adjust @max_len accordingly
482 * to avoid a short walk.
484 for (hgt = mp->mp_fheight - 1; hgt >= mp->mp_aheight; hgt--) {
485 max_len += mp->mp_list[hgt] * factor;
486 mp->mp_list[hgt] = 0;
487 factor *= sdp->sd_inptrs;
491 u16 start = mp->mp_list[hgt];
492 enum walker_status status;
496 /* Walk indirect block. */
497 ptrs = (hgt >= 1 ? sdp->sd_inptrs : sdp->sd_diptrs) - start;
500 ptrs = DIV_ROUND_UP_ULL(max_len, factor);
501 status = walker(mp, ptrs);
506 BUG_ON(mp->mp_aheight == mp->mp_fheight);
507 ptrs = mp->mp_list[hgt] - start;
516 if (status == WALK_FOLLOW)
517 goto fill_up_metapath;
520 /* Decrease height of metapath. */
521 brelse(mp->mp_bh[hgt]);
522 mp->mp_bh[hgt] = NULL;
523 mp->mp_list[hgt] = 0;
527 factor *= sdp->sd_inptrs;
529 /* Advance in metadata tree. */
530 (mp->mp_list[hgt])++;
532 if (mp->mp_list[hgt] >= sdp->sd_inptrs)
535 if (mp->mp_list[hgt] >= sdp->sd_diptrs)
540 /* Increase height of metapath. */
541 ret = fillup_metapath(ip, mp, ip->i_height - 1);
546 do_div(factor, sdp->sd_inptrs);
547 mp->mp_aheight = hgt + 1;
552 static enum walker_status gfs2_hole_walker(struct metapath *mp,
555 const __be64 *start, *ptr, *end;
558 hgt = mp->mp_aheight - 1;
559 start = metapointer(hgt, mp);
562 for (ptr = start; ptr < end; ptr++) {
564 mp->mp_list[hgt] += ptr - start;
565 if (mp->mp_aheight == mp->mp_fheight)
570 return WALK_CONTINUE;
574 * gfs2_hole_size - figure out the size of a hole
576 * @lblock: The logical starting block number
577 * @len: How far to look (in blocks)
578 * @mp: The metapath at lblock
579 * @iomap: The iomap to store the hole size in
581 * This function modifies @mp.
583 * Returns: errno on error
585 static int gfs2_hole_size(struct inode *inode, sector_t lblock, u64 len,
586 struct metapath *mp, struct iomap *iomap)
588 struct metapath clone;
592 clone_metapath(&clone, mp);
593 ret = gfs2_walk_metadata(inode, &clone, len, gfs2_hole_walker);
598 hole_size = metapath_to_block(GFS2_SB(inode), &clone) - lblock;
601 iomap->length = hole_size << inode->i_blkbits;
605 release_metapath(&clone);
609 static inline __be64 *gfs2_indirect_init(struct metapath *mp,
610 struct gfs2_glock *gl, unsigned int i,
611 unsigned offset, u64 bn)
613 __be64 *ptr = (__be64 *)(mp->mp_bh[i - 1]->b_data +
614 ((i > 1) ? sizeof(struct gfs2_meta_header) :
615 sizeof(struct gfs2_dinode)));
617 BUG_ON(mp->mp_bh[i] != NULL);
618 mp->mp_bh[i] = gfs2_meta_new(gl, bn);
619 gfs2_trans_add_meta(gl, mp->mp_bh[i]);
620 gfs2_metatype_set(mp->mp_bh[i], GFS2_METATYPE_IN, GFS2_FORMAT_IN);
621 gfs2_buffer_clear_tail(mp->mp_bh[i], sizeof(struct gfs2_meta_header));
623 *ptr = cpu_to_be64(bn);
629 ALLOC_GROW_DEPTH = 1,
630 ALLOC_GROW_HEIGHT = 2,
631 /* ALLOC_UNSTUFF = 3, TBD and rather complicated */
635 * gfs2_iomap_alloc - Build a metadata tree of the requested height
636 * @inode: The GFS2 inode
637 * @iomap: The iomap structure
638 * @mp: The metapath, with proper height information calculated
640 * In this routine we may have to alloc:
641 * i) Indirect blocks to grow the metadata tree height
642 * ii) Indirect blocks to fill in lower part of the metadata tree
645 * This function is called after gfs2_iomap_get, which works out the
646 * total number of blocks which we need via gfs2_alloc_size.
648 * We then do the actual allocation asking for an extent at a time (if
649 * enough contiguous free blocks are available, there will only be one
650 * allocation request per call) and uses the state machine to initialise
651 * the blocks in order.
653 * Right now, this function will allocate at most one indirect block
654 * worth of data -- with a default block size of 4K, that's slightly
655 * less than 2M. If this limitation is ever removed to allow huge
656 * allocations, we would probably still want to limit the iomap size we
657 * return to avoid stalling other tasks during huge writes; the next
658 * iomap iteration would then find the blocks already allocated.
660 * Returns: errno on error
663 static int gfs2_iomap_alloc(struct inode *inode, struct iomap *iomap,
666 struct gfs2_inode *ip = GFS2_I(inode);
667 struct gfs2_sbd *sdp = GFS2_SB(inode);
668 struct buffer_head *dibh = mp->mp_bh[0];
670 unsigned n, i, blks, alloced = 0, iblks = 0, branch_start = 0;
671 size_t dblks = iomap->length >> inode->i_blkbits;
672 const unsigned end_of_metadata = mp->mp_fheight - 1;
674 enum alloc_state state;
678 BUG_ON(mp->mp_aheight < 1);
679 BUG_ON(dibh == NULL);
682 gfs2_trans_add_meta(ip->i_gl, dibh);
684 down_write(&ip->i_rw_mutex);
686 if (mp->mp_fheight == mp->mp_aheight) {
687 /* Bottom indirect block exists */
690 /* Need to allocate indirect blocks */
691 if (mp->mp_fheight == ip->i_height) {
692 /* Writing into existing tree, extend tree down */
693 iblks = mp->mp_fheight - mp->mp_aheight;
694 state = ALLOC_GROW_DEPTH;
696 /* Building up tree height */
697 state = ALLOC_GROW_HEIGHT;
698 iblks = mp->mp_fheight - ip->i_height;
699 branch_start = metapath_branch_start(mp);
700 iblks += (mp->mp_fheight - branch_start);
704 /* start of the second part of the function (state machine) */
706 blks = dblks + iblks;
710 ret = gfs2_alloc_blocks(ip, &bn, &n, 0, NULL);
714 if (state != ALLOC_DATA || gfs2_is_jdata(ip))
715 gfs2_trans_remove_revoke(sdp, bn, n);
717 /* Growing height of tree */
718 case ALLOC_GROW_HEIGHT:
720 ptr = (__be64 *)(dibh->b_data +
721 sizeof(struct gfs2_dinode));
724 for (; i - 1 < mp->mp_fheight - ip->i_height && n > 0;
726 gfs2_indirect_init(mp, ip->i_gl, i, 0, bn++);
727 if (i - 1 == mp->mp_fheight - ip->i_height) {
729 gfs2_buffer_copy_tail(mp->mp_bh[i],
730 sizeof(struct gfs2_meta_header),
731 dibh, sizeof(struct gfs2_dinode));
732 gfs2_buffer_clear_tail(dibh,
733 sizeof(struct gfs2_dinode) +
735 ptr = (__be64 *)(mp->mp_bh[i]->b_data +
736 sizeof(struct gfs2_meta_header));
738 state = ALLOC_GROW_DEPTH;
739 for(i = branch_start; i < mp->mp_fheight; i++) {
740 if (mp->mp_bh[i] == NULL)
742 brelse(mp->mp_bh[i]);
749 /* fall through - To branching from existing tree */
750 case ALLOC_GROW_DEPTH:
751 if (i > 1 && i < mp->mp_fheight)
752 gfs2_trans_add_meta(ip->i_gl, mp->mp_bh[i-1]);
753 for (; i < mp->mp_fheight && n > 0; i++, n--)
754 gfs2_indirect_init(mp, ip->i_gl, i,
755 mp->mp_list[i-1], bn++);
756 if (i == mp->mp_fheight)
760 /* fall through - To tree complete, adding data blocks */
763 BUG_ON(mp->mp_bh[end_of_metadata] == NULL);
764 gfs2_trans_add_meta(ip->i_gl, mp->mp_bh[end_of_metadata]);
766 ptr = metapointer(end_of_metadata, mp);
767 iomap->addr = bn << inode->i_blkbits;
768 iomap->flags |= IOMAP_F_MERGED | IOMAP_F_NEW;
770 *ptr++ = cpu_to_be64(bn++);
773 } while (iomap->addr == IOMAP_NULL_ADDR);
775 iomap->type = IOMAP_MAPPED;
776 iomap->length = (u64)dblks << inode->i_blkbits;
777 ip->i_height = mp->mp_fheight;
778 gfs2_add_inode_blocks(&ip->i_inode, alloced);
779 gfs2_dinode_out(ip, dibh->b_data);
781 up_write(&ip->i_rw_mutex);
785 #define IOMAP_F_GFS2_BOUNDARY IOMAP_F_PRIVATE
788 * gfs2_alloc_size - Compute the maximum allocation size
791 * @size: Requested size in blocks
793 * Compute the maximum size of the next allocation at @mp.
795 * Returns: size in blocks
797 static u64 gfs2_alloc_size(struct inode *inode, struct metapath *mp, u64 size)
799 struct gfs2_inode *ip = GFS2_I(inode);
800 struct gfs2_sbd *sdp = GFS2_SB(inode);
801 const __be64 *first, *ptr, *end;
804 * For writes to stuffed files, this function is called twice via
805 * gfs2_iomap_get, before and after unstuffing. The size we return the
806 * first time needs to be large enough to get the reservation and
807 * allocation sizes right. The size we return the second time must
808 * be exact or else gfs2_iomap_alloc won't do the right thing.
811 if (gfs2_is_stuffed(ip) || mp->mp_fheight != mp->mp_aheight) {
812 unsigned int maxsize = mp->mp_fheight > 1 ?
813 sdp->sd_inptrs : sdp->sd_diptrs;
814 maxsize -= mp->mp_list[mp->mp_fheight - 1];
820 first = metapointer(ip->i_height - 1, mp);
821 end = metaend(ip->i_height - 1, mp);
822 if (end - first > size)
824 for (ptr = first; ptr < end; ptr++) {
832 * gfs2_iomap_get - Map blocks from an inode to disk blocks
834 * @pos: Starting position in bytes
835 * @length: Length to map, in bytes
836 * @flags: iomap flags
837 * @iomap: The iomap structure
842 static int gfs2_iomap_get(struct inode *inode, loff_t pos, loff_t length,
843 unsigned flags, struct iomap *iomap,
846 struct gfs2_inode *ip = GFS2_I(inode);
847 struct gfs2_sbd *sdp = GFS2_SB(inode);
848 loff_t size = i_size_read(inode);
851 sector_t lblock_stop;
855 struct buffer_head *dibh = NULL, *bh;
861 down_read(&ip->i_rw_mutex);
863 ret = gfs2_meta_inode_buffer(ip, &dibh);
868 if (gfs2_is_stuffed(ip)) {
869 if (flags & IOMAP_WRITE) {
870 loff_t max_size = gfs2_max_stuffed_size(ip);
872 if (pos + length > max_size)
874 iomap->length = max_size;
877 if (flags & IOMAP_REPORT) {
882 iomap->length = length;
886 iomap->length = size;
888 iomap->addr = (ip->i_no_addr << inode->i_blkbits) +
889 sizeof(struct gfs2_dinode);
890 iomap->type = IOMAP_INLINE;
891 iomap->inline_data = dibh->b_data + sizeof(struct gfs2_dinode);
896 lblock = pos >> inode->i_blkbits;
897 iomap->offset = lblock << inode->i_blkbits;
898 lblock_stop = (pos + length - 1) >> inode->i_blkbits;
899 len = lblock_stop - lblock + 1;
900 iomap->length = len << inode->i_blkbits;
902 height = ip->i_height;
903 while ((lblock + 1) * sdp->sd_sb.sb_bsize > sdp->sd_heightsize[height])
905 find_metapath(sdp, lblock, mp, height);
906 if (height > ip->i_height || gfs2_is_stuffed(ip))
909 ret = lookup_metapath(ip, mp);
913 if (mp->mp_aheight != ip->i_height)
916 ptr = metapointer(ip->i_height - 1, mp);
920 bh = mp->mp_bh[ip->i_height - 1];
921 len = gfs2_extent_length(bh, ptr, len, &eob);
923 iomap->addr = be64_to_cpu(*ptr) << inode->i_blkbits;
924 iomap->length = len << inode->i_blkbits;
925 iomap->type = IOMAP_MAPPED;
926 iomap->flags |= IOMAP_F_MERGED;
928 iomap->flags |= IOMAP_F_GFS2_BOUNDARY;
931 iomap->bdev = inode->i_sb->s_bdev;
933 up_read(&ip->i_rw_mutex);
937 if (flags & IOMAP_REPORT) {
940 else if (height == ip->i_height)
941 ret = gfs2_hole_size(inode, lblock, len, mp, iomap);
943 iomap->length = size - pos;
944 } else if (flags & IOMAP_WRITE) {
947 if (flags & IOMAP_DIRECT)
948 goto out; /* (see gfs2_file_direct_write) */
950 len = gfs2_alloc_size(inode, mp, len);
951 alloc_size = len << inode->i_blkbits;
952 if (alloc_size < iomap->length)
953 iomap->length = alloc_size;
955 if (pos < size && height == ip->i_height)
956 ret = gfs2_hole_size(inode, lblock, len, mp, iomap);
959 iomap->addr = IOMAP_NULL_ADDR;
960 iomap->type = IOMAP_HOLE;
965 * gfs2_lblk_to_dblk - convert logical block to disk block
966 * @inode: the inode of the file we're mapping
967 * @lblock: the block relative to the start of the file
968 * @dblock: the returned dblock, if no error
970 * This function maps a single block from a file logical block (relative to
971 * the start of the file) to a file system absolute block using iomap.
973 * Returns: the absolute file system block, or an error
975 int gfs2_lblk_to_dblk(struct inode *inode, u32 lblock, u64 *dblock)
977 struct iomap iomap = { };
978 struct metapath mp = { .mp_aheight = 1, };
979 loff_t pos = (loff_t)lblock << inode->i_blkbits;
982 ret = gfs2_iomap_get(inode, pos, i_blocksize(inode), 0, &iomap, &mp);
983 release_metapath(&mp);
985 *dblock = iomap.addr >> inode->i_blkbits;
990 static int gfs2_write_lock(struct inode *inode)
992 struct gfs2_inode *ip = GFS2_I(inode);
993 struct gfs2_sbd *sdp = GFS2_SB(inode);
996 gfs2_holder_init(ip->i_gl, LM_ST_EXCLUSIVE, 0, &ip->i_gh);
997 error = gfs2_glock_nq(&ip->i_gh);
1000 if (&ip->i_inode == sdp->sd_rindex) {
1001 struct gfs2_inode *m_ip = GFS2_I(sdp->sd_statfs_inode);
1003 error = gfs2_glock_nq_init(m_ip->i_gl, LM_ST_EXCLUSIVE,
1004 GL_NOCACHE, &m_ip->i_gh);
1011 gfs2_glock_dq(&ip->i_gh);
1013 gfs2_holder_uninit(&ip->i_gh);
1017 static void gfs2_write_unlock(struct inode *inode)
1019 struct gfs2_inode *ip = GFS2_I(inode);
1020 struct gfs2_sbd *sdp = GFS2_SB(inode);
1022 if (&ip->i_inode == sdp->sd_rindex) {
1023 struct gfs2_inode *m_ip = GFS2_I(sdp->sd_statfs_inode);
1025 gfs2_glock_dq_uninit(&m_ip->i_gh);
1027 gfs2_glock_dq_uninit(&ip->i_gh);
1030 static int gfs2_iomap_page_prepare(struct inode *inode, loff_t pos,
1031 unsigned len, struct iomap *iomap)
1033 unsigned int blockmask = i_blocksize(inode) - 1;
1034 struct gfs2_sbd *sdp = GFS2_SB(inode);
1035 unsigned int blocks;
1037 blocks = ((pos & blockmask) + len + blockmask) >> inode->i_blkbits;
1038 return gfs2_trans_begin(sdp, RES_DINODE + blocks, 0);
1041 static void gfs2_iomap_page_done(struct inode *inode, loff_t pos,
1042 unsigned copied, struct page *page,
1043 struct iomap *iomap)
1045 struct gfs2_trans *tr = current->journal_info;
1046 struct gfs2_inode *ip = GFS2_I(inode);
1047 struct gfs2_sbd *sdp = GFS2_SB(inode);
1049 if (page && !gfs2_is_stuffed(ip))
1050 gfs2_page_add_databufs(ip, page, offset_in_page(pos), copied);
1052 if (tr->tr_num_buf_new)
1053 __mark_inode_dirty(inode, I_DIRTY_DATASYNC);
1055 gfs2_trans_end(sdp);
1058 static const struct iomap_page_ops gfs2_iomap_page_ops = {
1059 .page_prepare = gfs2_iomap_page_prepare,
1060 .page_done = gfs2_iomap_page_done,
1063 static int gfs2_iomap_begin_write(struct inode *inode, loff_t pos,
1064 loff_t length, unsigned flags,
1065 struct iomap *iomap,
1066 struct metapath *mp)
1068 struct gfs2_inode *ip = GFS2_I(inode);
1069 struct gfs2_sbd *sdp = GFS2_SB(inode);
1073 unstuff = gfs2_is_stuffed(ip) &&
1074 pos + length > gfs2_max_stuffed_size(ip);
1076 if (unstuff || iomap->type == IOMAP_HOLE) {
1077 unsigned int data_blocks, ind_blocks;
1078 struct gfs2_alloc_parms ap = {};
1079 unsigned int rblocks;
1080 struct gfs2_trans *tr;
1082 gfs2_write_calc_reserv(ip, iomap->length, &data_blocks,
1084 ap.target = data_blocks + ind_blocks;
1085 ret = gfs2_quota_lock_check(ip, &ap);
1089 ret = gfs2_inplace_reserve(ip, &ap);
1093 rblocks = RES_DINODE + ind_blocks;
1094 if (gfs2_is_jdata(ip))
1095 rblocks += data_blocks;
1096 if (ind_blocks || data_blocks)
1097 rblocks += RES_STATFS + RES_QUOTA;
1098 if (inode == sdp->sd_rindex)
1099 rblocks += 2 * RES_STATFS;
1100 rblocks += gfs2_rg_blocks(ip, data_blocks + ind_blocks);
1102 ret = gfs2_trans_begin(sdp, rblocks,
1103 iomap->length >> inode->i_blkbits);
1105 goto out_trans_fail;
1108 ret = gfs2_unstuff_dinode(ip, NULL);
1111 release_metapath(mp);
1112 ret = gfs2_iomap_get(inode, iomap->offset,
1113 iomap->length, flags, iomap, mp);
1118 if (iomap->type == IOMAP_HOLE) {
1119 ret = gfs2_iomap_alloc(inode, iomap, mp);
1121 gfs2_trans_end(sdp);
1122 gfs2_inplace_release(ip);
1123 punch_hole(ip, iomap->offset, iomap->length);
1128 tr = current->journal_info;
1129 if (tr->tr_num_buf_new)
1130 __mark_inode_dirty(inode, I_DIRTY_DATASYNC);
1132 gfs2_trans_end(sdp);
1135 if (gfs2_is_stuffed(ip) || gfs2_is_jdata(ip))
1136 iomap->page_ops = &gfs2_iomap_page_ops;
1140 gfs2_trans_end(sdp);
1142 gfs2_inplace_release(ip);
1144 gfs2_quota_unlock(ip);
1148 static inline bool gfs2_iomap_need_write_lock(unsigned flags)
1150 return (flags & IOMAP_WRITE) && !(flags & IOMAP_DIRECT);
1153 static int gfs2_iomap_begin(struct inode *inode, loff_t pos, loff_t length,
1154 unsigned flags, struct iomap *iomap,
1155 struct iomap *srcmap)
1157 struct gfs2_inode *ip = GFS2_I(inode);
1158 struct metapath mp = { .mp_aheight = 1, };
1161 iomap->flags |= IOMAP_F_BUFFER_HEAD;
1163 trace_gfs2_iomap_start(ip, pos, length, flags);
1164 if (gfs2_iomap_need_write_lock(flags)) {
1165 ret = gfs2_write_lock(inode);
1170 ret = gfs2_iomap_get(inode, pos, length, flags, iomap, &mp);
1174 switch(flags & (IOMAP_WRITE | IOMAP_ZERO)) {
1176 if (flags & IOMAP_DIRECT) {
1178 * Silently fall back to buffered I/O for stuffed files
1179 * or if we've got a hole (see gfs2_file_direct_write).
1181 if (iomap->type != IOMAP_MAPPED)
1187 if (iomap->type == IOMAP_HOLE)
1194 ret = gfs2_iomap_begin_write(inode, pos, length, flags, iomap, &mp);
1197 if (ret && gfs2_iomap_need_write_lock(flags))
1198 gfs2_write_unlock(inode);
1199 release_metapath(&mp);
1201 trace_gfs2_iomap_end(ip, iomap, ret);
1205 static int gfs2_iomap_end(struct inode *inode, loff_t pos, loff_t length,
1206 ssize_t written, unsigned flags, struct iomap *iomap)
1208 struct gfs2_inode *ip = GFS2_I(inode);
1209 struct gfs2_sbd *sdp = GFS2_SB(inode);
1211 switch (flags & (IOMAP_WRITE | IOMAP_ZERO)) {
1213 if (flags & IOMAP_DIRECT)
1217 if (iomap->type == IOMAP_HOLE)
1224 if (!gfs2_is_stuffed(ip))
1225 gfs2_ordered_add_inode(ip);
1227 if (inode == sdp->sd_rindex)
1228 adjust_fs_space(inode);
1230 gfs2_inplace_release(ip);
1232 if (length != written && (iomap->flags & IOMAP_F_NEW)) {
1233 /* Deallocate blocks that were just allocated. */
1234 loff_t blockmask = i_blocksize(inode) - 1;
1235 loff_t end = (pos + length) & ~blockmask;
1237 pos = (pos + written + blockmask) & ~blockmask;
1239 truncate_pagecache_range(inode, pos, end - 1);
1240 punch_hole(ip, pos, end - pos);
1244 if (ip->i_qadata && ip->i_qadata->qa_qd_num)
1245 gfs2_quota_unlock(ip);
1247 if (unlikely(!written))
1250 if (iomap->flags & IOMAP_F_SIZE_CHANGED)
1251 mark_inode_dirty(inode);
1252 set_bit(GLF_DIRTY, &ip->i_gl->gl_flags);
1255 if (gfs2_iomap_need_write_lock(flags))
1256 gfs2_write_unlock(inode);
1260 const struct iomap_ops gfs2_iomap_ops = {
1261 .iomap_begin = gfs2_iomap_begin,
1262 .iomap_end = gfs2_iomap_end,
1266 * gfs2_block_map - Map one or more blocks of an inode to a disk block
1268 * @lblock: The logical block number
1269 * @bh_map: The bh to be mapped
1270 * @create: True if its ok to alloc blocks to satify the request
1272 * The size of the requested mapping is defined in bh_map->b_size.
1274 * Clears buffer_mapped(bh_map) and leaves bh_map->b_size unchanged
1275 * when @lblock is not mapped. Sets buffer_mapped(bh_map) and
1276 * bh_map->b_size to indicate the size of the mapping when @lblock and
1277 * successive blocks are mapped, up to the requested size.
1279 * Sets buffer_boundary() if a read of metadata will be required
1280 * before the next block can be mapped. Sets buffer_new() if new
1281 * blocks were allocated.
1286 int gfs2_block_map(struct inode *inode, sector_t lblock,
1287 struct buffer_head *bh_map, int create)
1289 struct gfs2_inode *ip = GFS2_I(inode);
1290 loff_t pos = (loff_t)lblock << inode->i_blkbits;
1291 loff_t length = bh_map->b_size;
1292 struct metapath mp = { .mp_aheight = 1, };
1293 struct iomap iomap = { };
1296 clear_buffer_mapped(bh_map);
1297 clear_buffer_new(bh_map);
1298 clear_buffer_boundary(bh_map);
1299 trace_gfs2_bmap(ip, bh_map, lblock, create, 1);
1302 ret = gfs2_iomap_get(inode, pos, length, IOMAP_WRITE, &iomap, &mp);
1303 if (!ret && iomap.type == IOMAP_HOLE)
1304 ret = gfs2_iomap_alloc(inode, &iomap, &mp);
1305 release_metapath(&mp);
1307 ret = gfs2_iomap_get(inode, pos, length, 0, &iomap, &mp);
1308 release_metapath(&mp);
1313 if (iomap.length > bh_map->b_size) {
1314 iomap.length = bh_map->b_size;
1315 iomap.flags &= ~IOMAP_F_GFS2_BOUNDARY;
1317 if (iomap.addr != IOMAP_NULL_ADDR)
1318 map_bh(bh_map, inode->i_sb, iomap.addr >> inode->i_blkbits);
1319 bh_map->b_size = iomap.length;
1320 if (iomap.flags & IOMAP_F_GFS2_BOUNDARY)
1321 set_buffer_boundary(bh_map);
1322 if (iomap.flags & IOMAP_F_NEW)
1323 set_buffer_new(bh_map);
1326 trace_gfs2_bmap(ip, bh_map, lblock, create, ret);
1331 * Deprecated: do not use in new code
1333 int gfs2_extent_map(struct inode *inode, u64 lblock, int *new, u64 *dblock, unsigned *extlen)
1335 struct buffer_head bh = { .b_state = 0, .b_blocknr = 0 };
1343 bh.b_size = BIT(inode->i_blkbits + (create ? 0 : 5));
1344 ret = gfs2_block_map(inode, lblock, &bh, create);
1345 *extlen = bh.b_size >> inode->i_blkbits;
1346 *dblock = bh.b_blocknr;
1347 if (buffer_new(&bh))
1355 * NOTE: Never call gfs2_block_zero_range with an open transaction because it
1356 * uses iomap write to perform its actions, which begin their own transactions
1357 * (iomap_begin, page_prepare, etc.)
1359 static int gfs2_block_zero_range(struct inode *inode, loff_t from,
1360 unsigned int length)
1362 BUG_ON(current->journal_info);
1363 return iomap_zero_range(inode, from, length, NULL, &gfs2_iomap_ops);
1366 #define GFS2_JTRUNC_REVOKES 8192
1369 * gfs2_journaled_truncate - Wrapper for truncate_pagecache for jdata files
1370 * @inode: The inode being truncated
1371 * @oldsize: The original (larger) size
1372 * @newsize: The new smaller size
1374 * With jdata files, we have to journal a revoke for each block which is
1375 * truncated. As a result, we need to split this into separate transactions
1376 * if the number of pages being truncated gets too large.
1379 static int gfs2_journaled_truncate(struct inode *inode, u64 oldsize, u64 newsize)
1381 struct gfs2_sbd *sdp = GFS2_SB(inode);
1382 u64 max_chunk = GFS2_JTRUNC_REVOKES * sdp->sd_vfs->s_blocksize;
1386 while (oldsize != newsize) {
1387 struct gfs2_trans *tr;
1390 chunk = oldsize - newsize;
1391 if (chunk > max_chunk)
1394 offs = oldsize & ~PAGE_MASK;
1395 if (offs && chunk > PAGE_SIZE)
1396 chunk = offs + ((chunk - offs) & PAGE_MASK);
1398 truncate_pagecache(inode, oldsize - chunk);
1401 tr = current->journal_info;
1402 if (!test_bit(TR_TOUCHED, &tr->tr_flags))
1405 gfs2_trans_end(sdp);
1406 error = gfs2_trans_begin(sdp, RES_DINODE, GFS2_JTRUNC_REVOKES);
1414 static int trunc_start(struct inode *inode, u64 newsize)
1416 struct gfs2_inode *ip = GFS2_I(inode);
1417 struct gfs2_sbd *sdp = GFS2_SB(inode);
1418 struct buffer_head *dibh = NULL;
1419 int journaled = gfs2_is_jdata(ip);
1420 u64 oldsize = inode->i_size;
1423 if (!gfs2_is_stuffed(ip)) {
1424 unsigned int blocksize = i_blocksize(inode);
1425 unsigned int offs = newsize & (blocksize - 1);
1427 error = gfs2_block_zero_range(inode, newsize,
1434 error = gfs2_trans_begin(sdp, RES_DINODE + RES_JDATA, GFS2_JTRUNC_REVOKES);
1436 error = gfs2_trans_begin(sdp, RES_DINODE, 0);
1440 error = gfs2_meta_inode_buffer(ip, &dibh);
1444 gfs2_trans_add_meta(ip->i_gl, dibh);
1446 if (gfs2_is_stuffed(ip))
1447 gfs2_buffer_clear_tail(dibh, sizeof(struct gfs2_dinode) + newsize);
1449 ip->i_diskflags |= GFS2_DIF_TRUNC_IN_PROG;
1451 i_size_write(inode, newsize);
1452 ip->i_inode.i_mtime = ip->i_inode.i_ctime = current_time(&ip->i_inode);
1453 gfs2_dinode_out(ip, dibh->b_data);
1456 error = gfs2_journaled_truncate(inode, oldsize, newsize);
1458 truncate_pagecache(inode, newsize);
1462 if (current->journal_info)
1463 gfs2_trans_end(sdp);
1467 int gfs2_iomap_get_alloc(struct inode *inode, loff_t pos, loff_t length,
1468 struct iomap *iomap)
1470 struct metapath mp = { .mp_aheight = 1, };
1473 ret = gfs2_iomap_get(inode, pos, length, IOMAP_WRITE, iomap, &mp);
1474 if (!ret && iomap->type == IOMAP_HOLE)
1475 ret = gfs2_iomap_alloc(inode, iomap, &mp);
1476 release_metapath(&mp);
1481 * sweep_bh_for_rgrps - find an rgrp in a meta buffer and free blocks therein
1483 * @rg_gh: holder of resource group glock
1484 * @bh: buffer head to sweep
1485 * @start: starting point in bh
1486 * @end: end point in bh
1487 * @meta: true if bh points to metadata (rather than data)
1488 * @btotal: place to keep count of total blocks freed
1490 * We sweep a metadata buffer (provided by the metapath) for blocks we need to
1491 * free, and free them all. However, we do it one rgrp at a time. If this
1492 * block has references to multiple rgrps, we break it into individual
1493 * transactions. This allows other processes to use the rgrps while we're
1494 * focused on a single one, for better concurrency / performance.
1495 * At every transaction boundary, we rewrite the inode into the journal.
1496 * That way the bitmaps are kept consistent with the inode and we can recover
1497 * if we're interrupted by power-outages.
1499 * Returns: 0, or return code if an error occurred.
1500 * *btotal has the total number of blocks freed
1502 static int sweep_bh_for_rgrps(struct gfs2_inode *ip, struct gfs2_holder *rd_gh,
1503 struct buffer_head *bh, __be64 *start, __be64 *end,
1504 bool meta, u32 *btotal)
1506 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1507 struct gfs2_rgrpd *rgd;
1508 struct gfs2_trans *tr;
1510 int blks_outside_rgrp;
1511 u64 bn, bstart, isize_blks;
1512 s64 blen; /* needs to be s64 or gfs2_add_inode_blocks breaks */
1514 bool buf_in_tr = false; /* buffer was added to transaction */
1518 if (gfs2_holder_initialized(rd_gh)) {
1519 rgd = gfs2_glock2rgrp(rd_gh->gh_gl);
1520 gfs2_assert_withdraw(sdp,
1521 gfs2_glock_is_locked_by_me(rd_gh->gh_gl));
1523 blks_outside_rgrp = 0;
1527 for (p = start; p < end; p++) {
1530 bn = be64_to_cpu(*p);
1533 if (!rgrp_contains_block(rgd, bn)) {
1534 blks_outside_rgrp++;
1538 rgd = gfs2_blk2rgrpd(sdp, bn, true);
1539 if (unlikely(!rgd)) {
1543 ret = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_EXCLUSIVE,
1548 /* Must be done with the rgrp glock held: */
1549 if (gfs2_rs_active(&ip->i_res) &&
1550 rgd == ip->i_res.rs_rbm.rgd)
1551 gfs2_rs_deltree(&ip->i_res);
1554 /* The size of our transactions will be unknown until we
1555 actually process all the metadata blocks that relate to
1556 the rgrp. So we estimate. We know it can't be more than
1557 the dinode's i_blocks and we don't want to exceed the
1558 journal flush threshold, sd_log_thresh2. */
1559 if (current->journal_info == NULL) {
1560 unsigned int jblocks_rqsted, revokes;
1562 jblocks_rqsted = rgd->rd_length + RES_DINODE +
1564 isize_blks = gfs2_get_inode_blocks(&ip->i_inode);
1565 if (isize_blks > atomic_read(&sdp->sd_log_thresh2))
1567 atomic_read(&sdp->sd_log_thresh2);
1569 jblocks_rqsted += isize_blks;
1570 revokes = jblocks_rqsted;
1572 revokes += end - start;
1573 else if (ip->i_depth)
1574 revokes += sdp->sd_inptrs;
1575 ret = gfs2_trans_begin(sdp, jblocks_rqsted, revokes);
1578 down_write(&ip->i_rw_mutex);
1580 /* check if we will exceed the transaction blocks requested */
1581 tr = current->journal_info;
1582 if (tr->tr_num_buf_new + RES_STATFS +
1583 RES_QUOTA >= atomic_read(&sdp->sd_log_thresh2)) {
1584 /* We set blks_outside_rgrp to ensure the loop will
1585 be repeated for the same rgrp, but with a new
1587 blks_outside_rgrp++;
1588 /* This next part is tricky. If the buffer was added
1589 to the transaction, we've already set some block
1590 pointers to 0, so we better follow through and free
1591 them, or we will introduce corruption (so break).
1592 This may be impossible, or at least rare, but I
1593 decided to cover the case regardless.
1595 If the buffer was not added to the transaction
1596 (this call), doing so would exceed our transaction
1597 size, so we need to end the transaction and start a
1598 new one (so goto). */
1605 gfs2_trans_add_meta(ip->i_gl, bh);
1608 if (bstart + blen == bn) {
1613 __gfs2_free_blocks(ip, rgd, bstart, (u32)blen, meta);
1615 gfs2_add_inode_blocks(&ip->i_inode, -blen);
1621 __gfs2_free_blocks(ip, rgd, bstart, (u32)blen, meta);
1623 gfs2_add_inode_blocks(&ip->i_inode, -blen);
1626 if (!ret && blks_outside_rgrp) { /* If buffer still has non-zero blocks
1627 outside the rgrp we just processed,
1628 do it all over again. */
1629 if (current->journal_info) {
1630 struct buffer_head *dibh;
1632 ret = gfs2_meta_inode_buffer(ip, &dibh);
1636 /* Every transaction boundary, we rewrite the dinode
1637 to keep its di_blocks current in case of failure. */
1638 ip->i_inode.i_mtime = ip->i_inode.i_ctime =
1639 current_time(&ip->i_inode);
1640 gfs2_trans_add_meta(ip->i_gl, dibh);
1641 gfs2_dinode_out(ip, dibh->b_data);
1643 up_write(&ip->i_rw_mutex);
1644 gfs2_trans_end(sdp);
1647 gfs2_glock_dq_uninit(rd_gh);
1655 static bool mp_eq_to_hgt(struct metapath *mp, __u16 *list, unsigned int h)
1657 if (memcmp(mp->mp_list, list, h * sizeof(mp->mp_list[0])))
1663 * find_nonnull_ptr - find a non-null pointer given a metapath and height
1664 * @mp: starting metapath
1665 * @h: desired height to search
1667 * Assumes the metapath is valid (with buffers) out to height h.
1668 * Returns: true if a non-null pointer was found in the metapath buffer
1669 * false if all remaining pointers are NULL in the buffer
1671 static bool find_nonnull_ptr(struct gfs2_sbd *sdp, struct metapath *mp,
1673 __u16 *end_list, unsigned int end_aligned)
1675 struct buffer_head *bh = mp->mp_bh[h];
1676 __be64 *first, *ptr, *end;
1678 first = metaptr1(h, mp);
1679 ptr = first + mp->mp_list[h];
1680 end = (__be64 *)(bh->b_data + bh->b_size);
1681 if (end_list && mp_eq_to_hgt(mp, end_list, h)) {
1682 bool keep_end = h < end_aligned;
1683 end = first + end_list[h] + keep_end;
1687 if (*ptr) { /* if we have a non-null pointer */
1688 mp->mp_list[h] = ptr - first;
1690 if (h < GFS2_MAX_META_HEIGHT)
1699 enum dealloc_states {
1700 DEALLOC_MP_FULL = 0, /* Strip a metapath with all buffers read in */
1701 DEALLOC_MP_LOWER = 1, /* lower the metapath strip height */
1702 DEALLOC_FILL_MP = 2, /* Fill in the metapath to the given height. */
1703 DEALLOC_DONE = 3, /* process complete */
1707 metapointer_range(struct metapath *mp, int height,
1708 __u16 *start_list, unsigned int start_aligned,
1709 __u16 *end_list, unsigned int end_aligned,
1710 __be64 **start, __be64 **end)
1712 struct buffer_head *bh = mp->mp_bh[height];
1715 first = metaptr1(height, mp);
1717 if (mp_eq_to_hgt(mp, start_list, height)) {
1718 bool keep_start = height < start_aligned;
1719 *start = first + start_list[height] + keep_start;
1721 *end = (__be64 *)(bh->b_data + bh->b_size);
1722 if (end_list && mp_eq_to_hgt(mp, end_list, height)) {
1723 bool keep_end = height < end_aligned;
1724 *end = first + end_list[height] + keep_end;
1728 static inline bool walk_done(struct gfs2_sbd *sdp,
1729 struct metapath *mp, int height,
1730 __u16 *end_list, unsigned int end_aligned)
1735 bool keep_end = height < end_aligned;
1736 if (!mp_eq_to_hgt(mp, end_list, height))
1738 end = end_list[height] + keep_end;
1740 end = (height > 0) ? sdp->sd_inptrs : sdp->sd_diptrs;
1741 return mp->mp_list[height] >= end;
1745 * punch_hole - deallocate blocks in a file
1746 * @ip: inode to truncate
1747 * @offset: the start of the hole
1748 * @length: the size of the hole (or 0 for truncate)
1750 * Punch a hole into a file or truncate a file at a given position. This
1751 * function operates in whole blocks (@offset and @length are rounded
1752 * accordingly); partially filled blocks must be cleared otherwise.
1754 * This function works from the bottom up, and from the right to the left. In
1755 * other words, it strips off the highest layer (data) before stripping any of
1756 * the metadata. Doing it this way is best in case the operation is interrupted
1757 * by power failure, etc. The dinode is rewritten in every transaction to
1758 * guarantee integrity.
1760 static int punch_hole(struct gfs2_inode *ip, u64 offset, u64 length)
1762 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1763 u64 maxsize = sdp->sd_heightsize[ip->i_height];
1764 struct metapath mp = {};
1765 struct buffer_head *dibh, *bh;
1766 struct gfs2_holder rd_gh;
1767 unsigned int bsize_shift = sdp->sd_sb.sb_bsize_shift;
1768 u64 lblock = (offset + (1 << bsize_shift) - 1) >> bsize_shift;
1769 __u16 start_list[GFS2_MAX_META_HEIGHT];
1770 __u16 __end_list[GFS2_MAX_META_HEIGHT], *end_list = NULL;
1771 unsigned int start_aligned, end_aligned;
1772 unsigned int strip_h = ip->i_height - 1;
1775 int mp_h; /* metapath buffers are read in to this height */
1777 __be64 *start, *end;
1779 if (offset >= maxsize) {
1781 * The starting point lies beyond the allocated meta-data;
1782 * there are no blocks do deallocate.
1788 * The start position of the hole is defined by lblock, start_list, and
1789 * start_aligned. The end position of the hole is defined by lend,
1790 * end_list, and end_aligned.
1792 * start_aligned and end_aligned define down to which height the start
1793 * and end positions are aligned to the metadata tree (i.e., the
1794 * position is a multiple of the metadata granularity at the height
1795 * above). This determines at which heights additional meta pointers
1796 * needs to be preserved for the remaining data.
1800 u64 end_offset = offset + length;
1804 * Clip the end at the maximum file size for the given height:
1805 * that's how far the metadata goes; files bigger than that
1806 * will have additional layers of indirection.
1808 if (end_offset > maxsize)
1809 end_offset = maxsize;
1810 lend = end_offset >> bsize_shift;
1815 find_metapath(sdp, lend, &mp, ip->i_height);
1816 end_list = __end_list;
1817 memcpy(end_list, mp.mp_list, sizeof(mp.mp_list));
1819 for (mp_h = ip->i_height - 1; mp_h > 0; mp_h--) {
1826 find_metapath(sdp, lblock, &mp, ip->i_height);
1827 memcpy(start_list, mp.mp_list, sizeof(start_list));
1829 for (mp_h = ip->i_height - 1; mp_h > 0; mp_h--) {
1830 if (start_list[mp_h])
1833 start_aligned = mp_h;
1835 ret = gfs2_meta_inode_buffer(ip, &dibh);
1840 ret = lookup_metapath(ip, &mp);
1844 /* issue read-ahead on metadata */
1845 for (mp_h = 0; mp_h < mp.mp_aheight - 1; mp_h++) {
1846 metapointer_range(&mp, mp_h, start_list, start_aligned,
1847 end_list, end_aligned, &start, &end);
1848 gfs2_metapath_ra(ip->i_gl, start, end);
1851 if (mp.mp_aheight == ip->i_height)
1852 state = DEALLOC_MP_FULL; /* We have a complete metapath */
1854 state = DEALLOC_FILL_MP; /* deal with partial metapath */
1856 ret = gfs2_rindex_update(sdp);
1860 ret = gfs2_quota_hold(ip, NO_UID_QUOTA_CHANGE, NO_GID_QUOTA_CHANGE);
1863 gfs2_holder_mark_uninitialized(&rd_gh);
1867 while (state != DEALLOC_DONE) {
1869 /* Truncate a full metapath at the given strip height.
1870 * Note that strip_h == mp_h in order to be in this state. */
1871 case DEALLOC_MP_FULL:
1872 bh = mp.mp_bh[mp_h];
1873 gfs2_assert_withdraw(sdp, bh);
1874 if (gfs2_assert_withdraw(sdp,
1875 prev_bnr != bh->b_blocknr)) {
1876 fs_emerg(sdp, "inode %llu, block:%llu, i_h:%u,"
1877 "s_h:%u, mp_h:%u\n",
1878 (unsigned long long)ip->i_no_addr,
1879 prev_bnr, ip->i_height, strip_h, mp_h);
1881 prev_bnr = bh->b_blocknr;
1883 if (gfs2_metatype_check(sdp, bh,
1884 (mp_h ? GFS2_METATYPE_IN :
1885 GFS2_METATYPE_DI))) {
1891 * Below, passing end_aligned as 0 gives us the
1892 * metapointer range excluding the end point: the end
1893 * point is the first metapath we must not deallocate!
1896 metapointer_range(&mp, mp_h, start_list, start_aligned,
1897 end_list, 0 /* end_aligned */,
1899 ret = sweep_bh_for_rgrps(ip, &rd_gh, mp.mp_bh[mp_h],
1901 mp_h != ip->i_height - 1,
1904 /* If we hit an error or just swept dinode buffer,
1907 state = DEALLOC_DONE;
1910 state = DEALLOC_MP_LOWER;
1913 /* lower the metapath strip height */
1914 case DEALLOC_MP_LOWER:
1915 /* We're done with the current buffer, so release it,
1916 unless it's the dinode buffer. Then back up to the
1917 previous pointer. */
1919 brelse(mp.mp_bh[mp_h]);
1920 mp.mp_bh[mp_h] = NULL;
1922 /* If we can't get any lower in height, we've stripped
1923 off all we can. Next step is to back up and start
1924 stripping the previous level of metadata. */
1927 memcpy(mp.mp_list, start_list, sizeof(start_list));
1929 state = DEALLOC_FILL_MP;
1932 mp.mp_list[mp_h] = 0;
1933 mp_h--; /* search one metadata height down */
1935 if (walk_done(sdp, &mp, mp_h, end_list, end_aligned))
1937 /* Here we've found a part of the metapath that is not
1938 * allocated. We need to search at that height for the
1939 * next non-null pointer. */
1940 if (find_nonnull_ptr(sdp, &mp, mp_h, end_list, end_aligned)) {
1941 state = DEALLOC_FILL_MP;
1944 /* No more non-null pointers at this height. Back up
1945 to the previous height and try again. */
1946 break; /* loop around in the same state */
1948 /* Fill the metapath with buffers to the given height. */
1949 case DEALLOC_FILL_MP:
1950 /* Fill the buffers out to the current height. */
1951 ret = fillup_metapath(ip, &mp, mp_h);
1955 /* On the first pass, issue read-ahead on metadata. */
1956 if (mp.mp_aheight > 1 && strip_h == ip->i_height - 1) {
1957 unsigned int height = mp.mp_aheight - 1;
1959 /* No read-ahead for data blocks. */
1960 if (mp.mp_aheight - 1 == strip_h)
1963 for (; height >= mp.mp_aheight - ret; height--) {
1964 metapointer_range(&mp, height,
1965 start_list, start_aligned,
1966 end_list, end_aligned,
1968 gfs2_metapath_ra(ip->i_gl, start, end);
1972 /* If buffers found for the entire strip height */
1973 if (mp.mp_aheight - 1 == strip_h) {
1974 state = DEALLOC_MP_FULL;
1977 if (mp.mp_aheight < ip->i_height) /* We have a partial height */
1978 mp_h = mp.mp_aheight - 1;
1980 /* If we find a non-null block pointer, crawl a bit
1981 higher up in the metapath and try again, otherwise
1982 we need to look lower for a new starting point. */
1983 if (find_nonnull_ptr(sdp, &mp, mp_h, end_list, end_aligned))
1986 state = DEALLOC_MP_LOWER;
1992 if (current->journal_info == NULL) {
1993 ret = gfs2_trans_begin(sdp, RES_DINODE + RES_STATFS +
1997 down_write(&ip->i_rw_mutex);
1999 gfs2_statfs_change(sdp, 0, +btotal, 0);
2000 gfs2_quota_change(ip, -(s64)btotal, ip->i_inode.i_uid,
2002 ip->i_inode.i_mtime = ip->i_inode.i_ctime = current_time(&ip->i_inode);
2003 gfs2_trans_add_meta(ip->i_gl, dibh);
2004 gfs2_dinode_out(ip, dibh->b_data);
2005 up_write(&ip->i_rw_mutex);
2006 gfs2_trans_end(sdp);
2010 if (gfs2_holder_initialized(&rd_gh))
2011 gfs2_glock_dq_uninit(&rd_gh);
2012 if (current->journal_info) {
2013 up_write(&ip->i_rw_mutex);
2014 gfs2_trans_end(sdp);
2017 gfs2_quota_unhold(ip);
2019 release_metapath(&mp);
2023 static int trunc_end(struct gfs2_inode *ip)
2025 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
2026 struct buffer_head *dibh;
2029 error = gfs2_trans_begin(sdp, RES_DINODE, 0);
2033 down_write(&ip->i_rw_mutex);
2035 error = gfs2_meta_inode_buffer(ip, &dibh);
2039 if (!i_size_read(&ip->i_inode)) {
2041 ip->i_goal = ip->i_no_addr;
2042 gfs2_buffer_clear_tail(dibh, sizeof(struct gfs2_dinode));
2043 gfs2_ordered_del_inode(ip);
2045 ip->i_inode.i_mtime = ip->i_inode.i_ctime = current_time(&ip->i_inode);
2046 ip->i_diskflags &= ~GFS2_DIF_TRUNC_IN_PROG;
2048 gfs2_trans_add_meta(ip->i_gl, dibh);
2049 gfs2_dinode_out(ip, dibh->b_data);
2053 up_write(&ip->i_rw_mutex);
2054 gfs2_trans_end(sdp);
2059 * do_shrink - make a file smaller
2061 * @newsize: the size to make the file
2063 * Called with an exclusive lock on @inode. The @size must
2064 * be equal to or smaller than the current inode size.
2069 static int do_shrink(struct inode *inode, u64 newsize)
2071 struct gfs2_inode *ip = GFS2_I(inode);
2074 error = trunc_start(inode, newsize);
2077 if (gfs2_is_stuffed(ip))
2080 error = punch_hole(ip, newsize, 0);
2082 error = trunc_end(ip);
2087 void gfs2_trim_blocks(struct inode *inode)
2091 ret = do_shrink(inode, inode->i_size);
2096 * do_grow - Touch and update inode size
2098 * @size: The new size
2100 * This function updates the timestamps on the inode and
2101 * may also increase the size of the inode. This function
2102 * must not be called with @size any smaller than the current
2105 * Although it is not strictly required to unstuff files here,
2106 * earlier versions of GFS2 have a bug in the stuffed file reading
2107 * code which will result in a buffer overrun if the size is larger
2108 * than the max stuffed file size. In order to prevent this from
2109 * occurring, such files are unstuffed, but in other cases we can
2110 * just update the inode size directly.
2112 * Returns: 0 on success, or -ve on error
2115 static int do_grow(struct inode *inode, u64 size)
2117 struct gfs2_inode *ip = GFS2_I(inode);
2118 struct gfs2_sbd *sdp = GFS2_SB(inode);
2119 struct gfs2_alloc_parms ap = { .target = 1, };
2120 struct buffer_head *dibh;
2124 if (gfs2_is_stuffed(ip) && size > gfs2_max_stuffed_size(ip)) {
2125 error = gfs2_quota_lock_check(ip, &ap);
2129 error = gfs2_inplace_reserve(ip, &ap);
2131 goto do_grow_qunlock;
2135 error = gfs2_trans_begin(sdp, RES_DINODE + RES_STATFS + RES_RG_BIT +
2137 gfs2_is_jdata(ip) ? RES_JDATA : 0) +
2138 (sdp->sd_args.ar_quota == GFS2_QUOTA_OFF ?
2141 goto do_grow_release;
2144 error = gfs2_unstuff_dinode(ip, NULL);
2149 error = gfs2_meta_inode_buffer(ip, &dibh);
2153 truncate_setsize(inode, size);
2154 ip->i_inode.i_mtime = ip->i_inode.i_ctime = current_time(&ip->i_inode);
2155 gfs2_trans_add_meta(ip->i_gl, dibh);
2156 gfs2_dinode_out(ip, dibh->b_data);
2160 gfs2_trans_end(sdp);
2163 gfs2_inplace_release(ip);
2165 gfs2_quota_unlock(ip);
2171 * gfs2_setattr_size - make a file a given size
2173 * @newsize: the size to make the file
2175 * The file size can grow, shrink, or stay the same size. This
2176 * is called holding i_rwsem and an exclusive glock on the inode
2182 int gfs2_setattr_size(struct inode *inode, u64 newsize)
2184 struct gfs2_inode *ip = GFS2_I(inode);
2187 BUG_ON(!S_ISREG(inode->i_mode));
2189 ret = inode_newsize_ok(inode, newsize);
2193 inode_dio_wait(inode);
2195 ret = gfs2_qa_get(ip);
2199 if (newsize >= inode->i_size) {
2200 ret = do_grow(inode, newsize);
2204 ret = do_shrink(inode, newsize);
2206 gfs2_rs_delete(ip, NULL);
2211 int gfs2_truncatei_resume(struct gfs2_inode *ip)
2214 error = punch_hole(ip, i_size_read(&ip->i_inode), 0);
2216 error = trunc_end(ip);
2220 int gfs2_file_dealloc(struct gfs2_inode *ip)
2222 return punch_hole(ip, 0, 0);
2226 * gfs2_free_journal_extents - Free cached journal bmap info
2231 void gfs2_free_journal_extents(struct gfs2_jdesc *jd)
2233 struct gfs2_journal_extent *jext;
2235 while(!list_empty(&jd->extent_list)) {
2236 jext = list_first_entry(&jd->extent_list, struct gfs2_journal_extent, list);
2237 list_del(&jext->list);
2243 * gfs2_add_jextent - Add or merge a new extent to extent cache
2244 * @jd: The journal descriptor
2245 * @lblock: The logical block at start of new extent
2246 * @dblock: The physical block at start of new extent
2247 * @blocks: Size of extent in fs blocks
2249 * Returns: 0 on success or -ENOMEM
2252 static int gfs2_add_jextent(struct gfs2_jdesc *jd, u64 lblock, u64 dblock, u64 blocks)
2254 struct gfs2_journal_extent *jext;
2256 if (!list_empty(&jd->extent_list)) {
2257 jext = list_last_entry(&jd->extent_list, struct gfs2_journal_extent, list);
2258 if ((jext->dblock + jext->blocks) == dblock) {
2259 jext->blocks += blocks;
2264 jext = kzalloc(sizeof(struct gfs2_journal_extent), GFP_NOFS);
2267 jext->dblock = dblock;
2268 jext->lblock = lblock;
2269 jext->blocks = blocks;
2270 list_add_tail(&jext->list, &jd->extent_list);
2276 * gfs2_map_journal_extents - Cache journal bmap info
2277 * @sdp: The super block
2278 * @jd: The journal to map
2280 * Create a reusable "extent" mapping from all logical
2281 * blocks to all physical blocks for the given journal. This will save
2282 * us time when writing journal blocks. Most journals will have only one
2283 * extent that maps all their logical blocks. That's because gfs2.mkfs
2284 * arranges the journal blocks sequentially to maximize performance.
2285 * So the extent would map the first block for the entire file length.
2286 * However, gfs2_jadd can happen while file activity is happening, so
2287 * those journals may not be sequential. Less likely is the case where
2288 * the users created their own journals by mounting the metafs and
2289 * laying it out. But it's still possible. These journals might have
2292 * Returns: 0 on success, or error on failure
2295 int gfs2_map_journal_extents(struct gfs2_sbd *sdp, struct gfs2_jdesc *jd)
2299 struct gfs2_inode *ip = GFS2_I(jd->jd_inode);
2300 struct buffer_head bh;
2301 unsigned int shift = sdp->sd_sb.sb_bsize_shift;
2306 start = ktime_get();
2307 lblock_stop = i_size_read(jd->jd_inode) >> shift;
2308 size = (lblock_stop - lblock) << shift;
2310 WARN_ON(!list_empty(&jd->extent_list));
2316 rc = gfs2_block_map(jd->jd_inode, lblock, &bh, 0);
2317 if (rc || !buffer_mapped(&bh))
2319 rc = gfs2_add_jextent(jd, lblock, bh.b_blocknr, bh.b_size >> shift);
2323 lblock += (bh.b_size >> ip->i_inode.i_blkbits);
2327 fs_info(sdp, "journal %d mapped with %u extents in %lldms\n", jd->jd_jid,
2328 jd->nr_extents, ktime_ms_delta(end, start));
2332 fs_warn(sdp, "error %d mapping journal %u at offset %llu (extent %u)\n",
2334 (unsigned long long)(i_size_read(jd->jd_inode) - size),
2336 fs_warn(sdp, "bmap=%d lblock=%llu block=%llu, state=0x%08lx, size=%llu\n",
2337 rc, (unsigned long long)lblock, (unsigned long long)bh.b_blocknr,
2338 bh.b_state, (unsigned long long)bh.b_size);
2339 gfs2_free_journal_extents(jd);
2344 * gfs2_write_alloc_required - figure out if a write will require an allocation
2345 * @ip: the file being written to
2346 * @offset: the offset to write to
2347 * @len: the number of bytes being written
2349 * Returns: 1 if an alloc is required, 0 otherwise
2352 int gfs2_write_alloc_required(struct gfs2_inode *ip, u64 offset,
2355 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
2356 struct buffer_head bh;
2358 u64 lblock, lblock_stop, size;
2364 if (gfs2_is_stuffed(ip)) {
2365 if (offset + len > gfs2_max_stuffed_size(ip))
2370 shift = sdp->sd_sb.sb_bsize_shift;
2371 BUG_ON(gfs2_is_dir(ip));
2372 end_of_file = (i_size_read(&ip->i_inode) + sdp->sd_sb.sb_bsize - 1) >> shift;
2373 lblock = offset >> shift;
2374 lblock_stop = (offset + len + sdp->sd_sb.sb_bsize - 1) >> shift;
2375 if (lblock_stop > end_of_file && ip != GFS2_I(sdp->sd_rindex))
2378 size = (lblock_stop - lblock) << shift;
2382 gfs2_block_map(&ip->i_inode, lblock, &bh, 0);
2383 if (!buffer_mapped(&bh))
2386 lblock += (bh.b_size >> ip->i_inode.i_blkbits);
2392 static int stuffed_zero_range(struct inode *inode, loff_t offset, loff_t length)
2394 struct gfs2_inode *ip = GFS2_I(inode);
2395 struct buffer_head *dibh;
2398 if (offset >= inode->i_size)
2400 if (offset + length > inode->i_size)
2401 length = inode->i_size - offset;
2403 error = gfs2_meta_inode_buffer(ip, &dibh);
2406 gfs2_trans_add_meta(ip->i_gl, dibh);
2407 memset(dibh->b_data + sizeof(struct gfs2_dinode) + offset, 0,
2413 static int gfs2_journaled_truncate_range(struct inode *inode, loff_t offset,
2416 struct gfs2_sbd *sdp = GFS2_SB(inode);
2417 loff_t max_chunk = GFS2_JTRUNC_REVOKES * sdp->sd_vfs->s_blocksize;
2421 struct gfs2_trans *tr;
2426 if (chunk > max_chunk)
2429 offs = offset & ~PAGE_MASK;
2430 if (offs && chunk > PAGE_SIZE)
2431 chunk = offs + ((chunk - offs) & PAGE_MASK);
2433 truncate_pagecache_range(inode, offset, chunk);
2437 tr = current->journal_info;
2438 if (!test_bit(TR_TOUCHED, &tr->tr_flags))
2441 gfs2_trans_end(sdp);
2442 error = gfs2_trans_begin(sdp, RES_DINODE, GFS2_JTRUNC_REVOKES);
2449 int __gfs2_punch_hole(struct file *file, loff_t offset, loff_t length)
2451 struct inode *inode = file_inode(file);
2452 struct gfs2_inode *ip = GFS2_I(inode);
2453 struct gfs2_sbd *sdp = GFS2_SB(inode);
2454 unsigned int blocksize = i_blocksize(inode);
2458 if (!gfs2_is_stuffed(ip)) {
2459 unsigned int start_off, end_len;
2461 start_off = offset & (blocksize - 1);
2462 end_len = (offset + length) & (blocksize - 1);
2464 unsigned int len = length;
2465 if (length > blocksize - start_off)
2466 len = blocksize - start_off;
2467 error = gfs2_block_zero_range(inode, offset, len);
2470 if (start_off + length < blocksize)
2474 error = gfs2_block_zero_range(inode,
2475 offset + length - end_len, end_len);
2481 start = round_down(offset, blocksize);
2482 end = round_up(offset + length, blocksize) - 1;
2483 error = filemap_write_and_wait_range(inode->i_mapping, start, end);
2487 if (gfs2_is_jdata(ip))
2488 error = gfs2_trans_begin(sdp, RES_DINODE + 2 * RES_JDATA,
2489 GFS2_JTRUNC_REVOKES);
2491 error = gfs2_trans_begin(sdp, RES_DINODE, 0);
2495 if (gfs2_is_stuffed(ip)) {
2496 error = stuffed_zero_range(inode, offset, length);
2501 if (gfs2_is_jdata(ip)) {
2502 BUG_ON(!current->journal_info);
2503 gfs2_journaled_truncate_range(inode, offset, length);
2505 truncate_pagecache_range(inode, offset, offset + length - 1);
2507 file_update_time(file);
2508 mark_inode_dirty(inode);
2510 if (current->journal_info)
2511 gfs2_trans_end(sdp);
2513 if (!gfs2_is_stuffed(ip))
2514 error = punch_hole(ip, offset, length);
2517 if (current->journal_info)
2518 gfs2_trans_end(sdp);