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;
60 if (!PageUptodate(page)) {
61 void *kaddr = kmap(page);
62 u64 dsize = i_size_read(inode);
64 memcpy(kaddr, dibh->b_data + sizeof(struct gfs2_dinode), dsize);
65 memset(kaddr + dsize, 0, PAGE_SIZE - dsize);
68 SetPageUptodate(page);
71 if (gfs2_is_jdata(ip)) {
72 struct buffer_head *bh;
74 if (!page_has_buffers(page))
75 create_empty_buffers(page, BIT(inode->i_blkbits),
78 bh = page_buffers(page);
79 if (!buffer_mapped(bh))
80 map_bh(bh, inode->i_sb, block);
82 set_buffer_uptodate(bh);
83 gfs2_trans_add_data(ip->i_gl, bh);
86 gfs2_ordered_add_inode(ip);
92 static int __gfs2_unstuff_inode(struct gfs2_inode *ip, struct page *page)
94 struct buffer_head *bh, *dibh;
95 struct gfs2_dinode *di;
97 int isdir = gfs2_is_dir(ip);
100 error = gfs2_meta_inode_buffer(ip, &dibh);
104 if (i_size_read(&ip->i_inode)) {
105 /* Get a free block, fill it with the stuffed data,
106 and write it out to disk */
109 error = gfs2_alloc_blocks(ip, &block, &n, 0, NULL);
113 gfs2_trans_remove_revoke(GFS2_SB(&ip->i_inode), block, 1);
114 error = gfs2_dir_get_new_buffer(ip, block, &bh);
117 gfs2_buffer_copy_tail(bh, sizeof(struct gfs2_meta_header),
118 dibh, sizeof(struct gfs2_dinode));
121 error = gfs2_unstuffer_page(ip, dibh, block, page);
127 /* Set up the pointer to the new block */
129 gfs2_trans_add_meta(ip->i_gl, dibh);
130 di = (struct gfs2_dinode *)dibh->b_data;
131 gfs2_buffer_clear_tail(dibh, sizeof(struct gfs2_dinode));
133 if (i_size_read(&ip->i_inode)) {
134 *(__be64 *)(di + 1) = cpu_to_be64(block);
135 gfs2_add_inode_blocks(&ip->i_inode, 1);
136 di->di_blocks = cpu_to_be64(gfs2_get_inode_blocks(&ip->i_inode));
140 di->di_height = cpu_to_be16(1);
148 * gfs2_unstuff_dinode - Unstuff a dinode when the data has grown too big
149 * @ip: The GFS2 inode to unstuff
151 * This routine unstuffs a dinode and returns it to a "normal" state such
152 * that the height can be grown in the traditional way.
157 int gfs2_unstuff_dinode(struct gfs2_inode *ip)
159 struct inode *inode = &ip->i_inode;
163 down_write(&ip->i_rw_mutex);
164 page = grab_cache_page(inode->i_mapping, 0);
168 error = __gfs2_unstuff_inode(ip, page);
172 up_write(&ip->i_rw_mutex);
177 * find_metapath - Find path through the metadata tree
178 * @sdp: The superblock
179 * @block: The disk block to look up
180 * @mp: The metapath to return the result in
181 * @height: The pre-calculated height of the metadata tree
183 * This routine returns a struct metapath structure that defines a path
184 * through the metadata of inode "ip" to get to block "block".
187 * Given: "ip" is a height 3 file, "offset" is 101342453, and this is a
188 * filesystem with a blocksize of 4096.
190 * find_metapath() would return a struct metapath structure set to:
191 * mp_fheight = 3, mp_list[0] = 0, mp_list[1] = 48, and mp_list[2] = 165.
193 * That means that in order to get to the block containing the byte at
194 * offset 101342453, we would load the indirect block pointed to by pointer
195 * 0 in the dinode. We would then load the indirect block pointed to by
196 * pointer 48 in that indirect block. We would then load the data block
197 * pointed to by pointer 165 in that indirect block.
199 * ----------------------------------------
204 * ----------------------------------------
208 * ----------------------------------------
212 * |0 5 6 7 8 9 0 1 2|
213 * ----------------------------------------
217 * ----------------------------------------
222 * ----------------------------------------
226 * ----------------------------------------
227 * | Data block containing offset |
231 * ----------------------------------------
235 static void find_metapath(const struct gfs2_sbd *sdp, u64 block,
236 struct metapath *mp, unsigned int height)
240 mp->mp_fheight = height;
241 for (i = height; i--;)
242 mp->mp_list[i] = do_div(block, sdp->sd_inptrs);
245 static inline unsigned int metapath_branch_start(const struct metapath *mp)
247 if (mp->mp_list[0] == 0)
253 * metaptr1 - Return the first possible metadata pointer in a metapath buffer
254 * @height: The metadata height (0 = dinode)
257 static inline __be64 *metaptr1(unsigned int height, const struct metapath *mp)
259 struct buffer_head *bh = mp->mp_bh[height];
261 return ((__be64 *)(bh->b_data + sizeof(struct gfs2_dinode)));
262 return ((__be64 *)(bh->b_data + sizeof(struct gfs2_meta_header)));
266 * metapointer - Return pointer to start of metadata in a buffer
267 * @height: The metadata height (0 = dinode)
270 * Return a pointer to the block number of the next height of the metadata
271 * tree given a buffer containing the pointer to the current height of the
275 static inline __be64 *metapointer(unsigned int height, const struct metapath *mp)
277 __be64 *p = metaptr1(height, mp);
278 return p + mp->mp_list[height];
281 static inline const __be64 *metaend(unsigned int height, const struct metapath *mp)
283 const struct buffer_head *bh = mp->mp_bh[height];
284 return (const __be64 *)(bh->b_data + bh->b_size);
287 static void clone_metapath(struct metapath *clone, struct metapath *mp)
292 for (hgt = 0; hgt < mp->mp_aheight; hgt++)
293 get_bh(clone->mp_bh[hgt]);
296 static void gfs2_metapath_ra(struct gfs2_glock *gl, __be64 *start, __be64 *end)
300 for (t = start; t < end; t++) {
301 struct buffer_head *rabh;
306 rabh = gfs2_getbuf(gl, be64_to_cpu(*t), CREATE);
307 if (trylock_buffer(rabh)) {
308 if (!buffer_uptodate(rabh)) {
309 rabh->b_end_io = end_buffer_read_sync;
310 submit_bh(REQ_OP_READ | REQ_RAHEAD | REQ_META |
320 static int __fillup_metapath(struct gfs2_inode *ip, struct metapath *mp,
321 unsigned int x, unsigned int h)
324 __be64 *ptr = metapointer(x, mp);
325 u64 dblock = be64_to_cpu(*ptr);
330 ret = gfs2_meta_buffer(ip, GFS2_METATYPE_IN, dblock, &mp->mp_bh[x + 1]);
334 mp->mp_aheight = x + 1;
339 * lookup_metapath - Walk the metadata tree to a specific point
343 * Assumes that the inode's buffer has already been looked up and
344 * hooked onto mp->mp_bh[0] and that the metapath has been initialised
345 * by find_metapath().
347 * If this function encounters part of the tree which has not been
348 * allocated, it returns the current height of the tree at the point
349 * at which it found the unallocated block. Blocks which are found are
350 * added to the mp->mp_bh[] list.
355 static int lookup_metapath(struct gfs2_inode *ip, struct metapath *mp)
357 return __fillup_metapath(ip, mp, 0, ip->i_height - 1);
361 * fillup_metapath - fill up buffers for the metadata path to a specific height
364 * @h: The height to which it should be mapped
366 * Similar to lookup_metapath, but does lookups for a range of heights
368 * Returns: error or the number of buffers filled
371 static int fillup_metapath(struct gfs2_inode *ip, struct metapath *mp, int h)
377 /* find the first buffer we need to look up. */
378 for (x = h - 1; x > 0; x--) {
383 ret = __fillup_metapath(ip, mp, x, h);
386 return mp->mp_aheight - x - 1;
389 static sector_t metapath_to_block(struct gfs2_sbd *sdp, struct metapath *mp)
391 sector_t factor = 1, block = 0;
394 for (hgt = mp->mp_fheight - 1; hgt >= 0; hgt--) {
395 if (hgt < mp->mp_aheight)
396 block += mp->mp_list[hgt] * factor;
397 factor *= sdp->sd_inptrs;
402 static void release_metapath(struct metapath *mp)
406 for (i = 0; i < GFS2_MAX_META_HEIGHT; i++) {
407 if (mp->mp_bh[i] == NULL)
409 brelse(mp->mp_bh[i]);
415 * gfs2_extent_length - Returns length of an extent of blocks
416 * @bh: The metadata block
417 * @ptr: Current position in @bh
418 * @limit: Max extent length to return
419 * @eob: Set to 1 if we hit "end of block"
421 * Returns: The length of the extent (minimum of one block)
424 static inline unsigned int gfs2_extent_length(struct buffer_head *bh, __be64 *ptr, size_t limit, int *eob)
426 const __be64 *end = (__be64 *)(bh->b_data + bh->b_size);
427 const __be64 *first = ptr;
428 u64 d = be64_to_cpu(*ptr);
436 } while(be64_to_cpu(*ptr) == d);
442 enum walker_status { WALK_STOP, WALK_FOLLOW, WALK_CONTINUE };
445 * gfs2_metadata_walker - walk an indirect block
446 * @mp: Metapath to indirect block
447 * @ptrs: Number of pointers to look at
449 * When returning WALK_FOLLOW, the walker must update @mp to point at the right
450 * indirect block to follow.
452 typedef enum walker_status (*gfs2_metadata_walker)(struct metapath *mp,
456 * gfs2_walk_metadata - walk a tree of indirect blocks
458 * @mp: Starting point of walk
459 * @max_len: Maximum number of blocks to walk
460 * @walker: Called during the walk
462 * Returns 1 if the walk was stopped by @walker, 0 if we went past @max_len or
463 * past the end of metadata, and a negative error code otherwise.
466 static int gfs2_walk_metadata(struct inode *inode, struct metapath *mp,
467 u64 max_len, gfs2_metadata_walker walker)
469 struct gfs2_inode *ip = GFS2_I(inode);
470 struct gfs2_sbd *sdp = GFS2_SB(inode);
476 * The walk starts in the lowest allocated indirect block, which may be
477 * before the position indicated by @mp. Adjust @max_len accordingly
478 * to avoid a short walk.
480 for (hgt = mp->mp_fheight - 1; hgt >= mp->mp_aheight; hgt--) {
481 max_len += mp->mp_list[hgt] * factor;
482 mp->mp_list[hgt] = 0;
483 factor *= sdp->sd_inptrs;
487 u16 start = mp->mp_list[hgt];
488 enum walker_status status;
492 /* Walk indirect block. */
493 ptrs = (hgt >= 1 ? sdp->sd_inptrs : sdp->sd_diptrs) - start;
496 ptrs = DIV_ROUND_UP_ULL(max_len, factor);
497 status = walker(mp, ptrs);
502 BUG_ON(mp->mp_aheight == mp->mp_fheight);
503 ptrs = mp->mp_list[hgt] - start;
512 if (status == WALK_FOLLOW)
513 goto fill_up_metapath;
516 /* Decrease height of metapath. */
517 brelse(mp->mp_bh[hgt]);
518 mp->mp_bh[hgt] = NULL;
519 mp->mp_list[hgt] = 0;
523 factor *= sdp->sd_inptrs;
525 /* Advance in metadata tree. */
526 (mp->mp_list[hgt])++;
528 if (mp->mp_list[hgt] >= sdp->sd_inptrs)
531 if (mp->mp_list[hgt] >= sdp->sd_diptrs)
536 /* Increase height of metapath. */
537 ret = fillup_metapath(ip, mp, ip->i_height - 1);
542 do_div(factor, sdp->sd_inptrs);
543 mp->mp_aheight = hgt + 1;
548 static enum walker_status gfs2_hole_walker(struct metapath *mp,
551 const __be64 *start, *ptr, *end;
554 hgt = mp->mp_aheight - 1;
555 start = metapointer(hgt, mp);
558 for (ptr = start; ptr < end; ptr++) {
560 mp->mp_list[hgt] += ptr - start;
561 if (mp->mp_aheight == mp->mp_fheight)
566 return WALK_CONTINUE;
570 * gfs2_hole_size - figure out the size of a hole
572 * @lblock: The logical starting block number
573 * @len: How far to look (in blocks)
574 * @mp: The metapath at lblock
575 * @iomap: The iomap to store the hole size in
577 * This function modifies @mp.
579 * Returns: errno on error
581 static int gfs2_hole_size(struct inode *inode, sector_t lblock, u64 len,
582 struct metapath *mp, struct iomap *iomap)
584 struct metapath clone;
588 clone_metapath(&clone, mp);
589 ret = gfs2_walk_metadata(inode, &clone, len, gfs2_hole_walker);
594 hole_size = metapath_to_block(GFS2_SB(inode), &clone) - lblock;
597 iomap->length = hole_size << inode->i_blkbits;
601 release_metapath(&clone);
605 static inline void gfs2_indirect_init(struct metapath *mp,
606 struct gfs2_glock *gl, unsigned int i,
607 unsigned offset, u64 bn)
609 __be64 *ptr = (__be64 *)(mp->mp_bh[i - 1]->b_data +
610 ((i > 1) ? sizeof(struct gfs2_meta_header) :
611 sizeof(struct gfs2_dinode)));
613 BUG_ON(mp->mp_bh[i] != NULL);
614 mp->mp_bh[i] = gfs2_meta_new(gl, bn);
615 gfs2_trans_add_meta(gl, mp->mp_bh[i]);
616 gfs2_metatype_set(mp->mp_bh[i], GFS2_METATYPE_IN, GFS2_FORMAT_IN);
617 gfs2_buffer_clear_tail(mp->mp_bh[i], sizeof(struct gfs2_meta_header));
619 *ptr = cpu_to_be64(bn);
624 ALLOC_GROW_DEPTH = 1,
625 ALLOC_GROW_HEIGHT = 2,
626 /* ALLOC_UNSTUFF = 3, TBD and rather complicated */
630 * __gfs2_iomap_alloc - Build a metadata tree of the requested height
631 * @inode: The GFS2 inode
632 * @iomap: The iomap structure
633 * @mp: The metapath, with proper height information calculated
635 * In this routine we may have to alloc:
636 * i) Indirect blocks to grow the metadata tree height
637 * ii) Indirect blocks to fill in lower part of the metadata tree
640 * This function is called after __gfs2_iomap_get, which works out the
641 * total number of blocks which we need via gfs2_alloc_size.
643 * We then do the actual allocation asking for an extent at a time (if
644 * enough contiguous free blocks are available, there will only be one
645 * allocation request per call) and uses the state machine to initialise
646 * the blocks in order.
648 * Right now, this function will allocate at most one indirect block
649 * worth of data -- with a default block size of 4K, that's slightly
650 * less than 2M. If this limitation is ever removed to allow huge
651 * allocations, we would probably still want to limit the iomap size we
652 * return to avoid stalling other tasks during huge writes; the next
653 * iomap iteration would then find the blocks already allocated.
655 * Returns: errno on error
658 static int __gfs2_iomap_alloc(struct inode *inode, struct iomap *iomap,
661 struct gfs2_inode *ip = GFS2_I(inode);
662 struct gfs2_sbd *sdp = GFS2_SB(inode);
663 struct buffer_head *dibh = mp->mp_bh[0];
665 unsigned n, i, blks, alloced = 0, iblks = 0, branch_start = 0;
666 size_t dblks = iomap->length >> inode->i_blkbits;
667 const unsigned end_of_metadata = mp->mp_fheight - 1;
669 enum alloc_state state;
673 BUG_ON(mp->mp_aheight < 1);
674 BUG_ON(dibh == NULL);
677 gfs2_trans_add_meta(ip->i_gl, dibh);
679 down_write(&ip->i_rw_mutex);
681 if (mp->mp_fheight == mp->mp_aheight) {
682 /* Bottom indirect block exists */
685 /* Need to allocate indirect blocks */
686 if (mp->mp_fheight == ip->i_height) {
687 /* Writing into existing tree, extend tree down */
688 iblks = mp->mp_fheight - mp->mp_aheight;
689 state = ALLOC_GROW_DEPTH;
691 /* Building up tree height */
692 state = ALLOC_GROW_HEIGHT;
693 iblks = mp->mp_fheight - ip->i_height;
694 branch_start = metapath_branch_start(mp);
695 iblks += (mp->mp_fheight - branch_start);
699 /* start of the second part of the function (state machine) */
701 blks = dblks + iblks;
705 ret = gfs2_alloc_blocks(ip, &bn, &n, 0, NULL);
709 if (state != ALLOC_DATA || gfs2_is_jdata(ip))
710 gfs2_trans_remove_revoke(sdp, bn, n);
712 /* Growing height of tree */
713 case ALLOC_GROW_HEIGHT:
715 ptr = (__be64 *)(dibh->b_data +
716 sizeof(struct gfs2_dinode));
719 for (; i - 1 < mp->mp_fheight - ip->i_height && n > 0;
721 gfs2_indirect_init(mp, ip->i_gl, i, 0, bn++);
722 if (i - 1 == mp->mp_fheight - ip->i_height) {
724 gfs2_buffer_copy_tail(mp->mp_bh[i],
725 sizeof(struct gfs2_meta_header),
726 dibh, sizeof(struct gfs2_dinode));
727 gfs2_buffer_clear_tail(dibh,
728 sizeof(struct gfs2_dinode) +
730 ptr = (__be64 *)(mp->mp_bh[i]->b_data +
731 sizeof(struct gfs2_meta_header));
733 state = ALLOC_GROW_DEPTH;
734 for(i = branch_start; i < mp->mp_fheight; i++) {
735 if (mp->mp_bh[i] == NULL)
737 brelse(mp->mp_bh[i]);
744 fallthrough; /* To branching from existing tree */
745 case ALLOC_GROW_DEPTH:
746 if (i > 1 && i < mp->mp_fheight)
747 gfs2_trans_add_meta(ip->i_gl, mp->mp_bh[i-1]);
748 for (; i < mp->mp_fheight && n > 0; i++, n--)
749 gfs2_indirect_init(mp, ip->i_gl, i,
750 mp->mp_list[i-1], bn++);
751 if (i == mp->mp_fheight)
755 fallthrough; /* To tree complete, adding data blocks */
758 BUG_ON(mp->mp_bh[end_of_metadata] == NULL);
759 gfs2_trans_add_meta(ip->i_gl, mp->mp_bh[end_of_metadata]);
761 ptr = metapointer(end_of_metadata, mp);
762 iomap->addr = bn << inode->i_blkbits;
763 iomap->flags |= IOMAP_F_MERGED | IOMAP_F_NEW;
765 *ptr++ = cpu_to_be64(bn++);
768 } while (iomap->addr == IOMAP_NULL_ADDR);
770 iomap->type = IOMAP_MAPPED;
771 iomap->length = (u64)dblks << inode->i_blkbits;
772 ip->i_height = mp->mp_fheight;
773 gfs2_add_inode_blocks(&ip->i_inode, alloced);
774 gfs2_dinode_out(ip, dibh->b_data);
776 up_write(&ip->i_rw_mutex);
780 #define IOMAP_F_GFS2_BOUNDARY IOMAP_F_PRIVATE
783 * gfs2_alloc_size - Compute the maximum allocation size
786 * @size: Requested size in blocks
788 * Compute the maximum size of the next allocation at @mp.
790 * Returns: size in blocks
792 static u64 gfs2_alloc_size(struct inode *inode, struct metapath *mp, u64 size)
794 struct gfs2_inode *ip = GFS2_I(inode);
795 struct gfs2_sbd *sdp = GFS2_SB(inode);
796 const __be64 *first, *ptr, *end;
799 * For writes to stuffed files, this function is called twice via
800 * __gfs2_iomap_get, before and after unstuffing. The size we return the
801 * first time needs to be large enough to get the reservation and
802 * allocation sizes right. The size we return the second time must
803 * be exact or else __gfs2_iomap_alloc won't do the right thing.
806 if (gfs2_is_stuffed(ip) || mp->mp_fheight != mp->mp_aheight) {
807 unsigned int maxsize = mp->mp_fheight > 1 ?
808 sdp->sd_inptrs : sdp->sd_diptrs;
809 maxsize -= mp->mp_list[mp->mp_fheight - 1];
815 first = metapointer(ip->i_height - 1, mp);
816 end = metaend(ip->i_height - 1, mp);
817 if (end - first > size)
819 for (ptr = first; ptr < end; ptr++) {
827 * __gfs2_iomap_get - Map blocks from an inode to disk blocks
829 * @pos: Starting position in bytes
830 * @length: Length to map, in bytes
831 * @flags: iomap flags
832 * @iomap: The iomap structure
837 static int __gfs2_iomap_get(struct inode *inode, loff_t pos, loff_t length,
838 unsigned flags, struct iomap *iomap,
841 struct gfs2_inode *ip = GFS2_I(inode);
842 struct gfs2_sbd *sdp = GFS2_SB(inode);
843 loff_t size = i_size_read(inode);
846 sector_t lblock_stop;
850 struct buffer_head *dibh = NULL, *bh;
856 down_read(&ip->i_rw_mutex);
858 ret = gfs2_meta_inode_buffer(ip, &dibh);
863 if (gfs2_is_stuffed(ip)) {
864 if (flags & IOMAP_WRITE) {
865 loff_t max_size = gfs2_max_stuffed_size(ip);
867 if (pos + length > max_size)
869 iomap->length = max_size;
872 if (flags & IOMAP_REPORT) {
877 iomap->length = length;
881 iomap->length = size;
883 iomap->addr = (ip->i_no_addr << inode->i_blkbits) +
884 sizeof(struct gfs2_dinode);
885 iomap->type = IOMAP_INLINE;
886 iomap->inline_data = dibh->b_data + sizeof(struct gfs2_dinode);
891 lblock = pos >> inode->i_blkbits;
892 iomap->offset = lblock << inode->i_blkbits;
893 lblock_stop = (pos + length - 1) >> inode->i_blkbits;
894 len = lblock_stop - lblock + 1;
895 iomap->length = len << inode->i_blkbits;
897 height = ip->i_height;
898 while ((lblock + 1) * sdp->sd_sb.sb_bsize > sdp->sd_heightsize[height])
900 find_metapath(sdp, lblock, mp, height);
901 if (height > ip->i_height || gfs2_is_stuffed(ip))
904 ret = lookup_metapath(ip, mp);
908 if (mp->mp_aheight != ip->i_height)
911 ptr = metapointer(ip->i_height - 1, mp);
915 bh = mp->mp_bh[ip->i_height - 1];
916 len = gfs2_extent_length(bh, ptr, len, &eob);
918 iomap->addr = be64_to_cpu(*ptr) << inode->i_blkbits;
919 iomap->length = len << inode->i_blkbits;
920 iomap->type = IOMAP_MAPPED;
921 iomap->flags |= IOMAP_F_MERGED;
923 iomap->flags |= IOMAP_F_GFS2_BOUNDARY;
926 iomap->bdev = inode->i_sb->s_bdev;
928 up_read(&ip->i_rw_mutex);
932 if (flags & IOMAP_REPORT) {
935 else if (height == ip->i_height)
936 ret = gfs2_hole_size(inode, lblock, len, mp, iomap);
938 iomap->length = size - iomap->offset;
939 } else if (flags & IOMAP_WRITE) {
942 if (flags & IOMAP_DIRECT)
943 goto out; /* (see gfs2_file_direct_write) */
945 len = gfs2_alloc_size(inode, mp, len);
946 alloc_size = len << inode->i_blkbits;
947 if (alloc_size < iomap->length)
948 iomap->length = alloc_size;
950 if (pos < size && height == ip->i_height)
951 ret = gfs2_hole_size(inode, lblock, len, mp, iomap);
954 iomap->addr = IOMAP_NULL_ADDR;
955 iomap->type = IOMAP_HOLE;
959 static struct folio *
960 gfs2_iomap_get_folio(struct iomap_iter *iter, loff_t pos, unsigned len)
962 struct inode *inode = iter->inode;
963 unsigned int blockmask = i_blocksize(inode) - 1;
964 struct gfs2_sbd *sdp = GFS2_SB(inode);
969 blocks = ((pos & blockmask) + len + blockmask) >> inode->i_blkbits;
970 status = gfs2_trans_begin(sdp, RES_DINODE + blocks, 0);
972 return ERR_PTR(status);
974 folio = iomap_get_folio(iter, pos);
980 static void gfs2_iomap_put_folio(struct inode *inode, loff_t pos,
981 unsigned copied, struct folio *folio)
983 struct gfs2_trans *tr = current->journal_info;
984 struct gfs2_inode *ip = GFS2_I(inode);
985 struct gfs2_sbd *sdp = GFS2_SB(inode);
987 if (!gfs2_is_stuffed(ip))
988 gfs2_trans_add_databufs(ip, folio, offset_in_folio(folio, pos),
994 if (tr->tr_num_buf_new)
995 __mark_inode_dirty(inode, I_DIRTY_DATASYNC);
1000 static const struct iomap_folio_ops gfs2_iomap_folio_ops = {
1001 .get_folio = gfs2_iomap_get_folio,
1002 .put_folio = gfs2_iomap_put_folio,
1005 static int gfs2_iomap_begin_write(struct inode *inode, loff_t pos,
1006 loff_t length, unsigned flags,
1007 struct iomap *iomap,
1008 struct metapath *mp)
1010 struct gfs2_inode *ip = GFS2_I(inode);
1011 struct gfs2_sbd *sdp = GFS2_SB(inode);
1015 unstuff = gfs2_is_stuffed(ip) &&
1016 pos + length > gfs2_max_stuffed_size(ip);
1018 if (unstuff || iomap->type == IOMAP_HOLE) {
1019 unsigned int data_blocks, ind_blocks;
1020 struct gfs2_alloc_parms ap = {};
1021 unsigned int rblocks;
1022 struct gfs2_trans *tr;
1024 gfs2_write_calc_reserv(ip, iomap->length, &data_blocks,
1026 ap.target = data_blocks + ind_blocks;
1027 ret = gfs2_quota_lock_check(ip, &ap);
1031 ret = gfs2_inplace_reserve(ip, &ap);
1035 rblocks = RES_DINODE + ind_blocks;
1036 if (gfs2_is_jdata(ip))
1037 rblocks += data_blocks;
1038 if (ind_blocks || data_blocks)
1039 rblocks += RES_STATFS + RES_QUOTA;
1040 if (inode == sdp->sd_rindex)
1041 rblocks += 2 * RES_STATFS;
1042 rblocks += gfs2_rg_blocks(ip, data_blocks + ind_blocks);
1044 ret = gfs2_trans_begin(sdp, rblocks,
1045 iomap->length >> inode->i_blkbits);
1047 goto out_trans_fail;
1050 ret = gfs2_unstuff_dinode(ip);
1053 release_metapath(mp);
1054 ret = __gfs2_iomap_get(inode, iomap->offset,
1055 iomap->length, flags, iomap, mp);
1060 if (iomap->type == IOMAP_HOLE) {
1061 ret = __gfs2_iomap_alloc(inode, iomap, mp);
1063 gfs2_trans_end(sdp);
1064 gfs2_inplace_release(ip);
1065 punch_hole(ip, iomap->offset, iomap->length);
1070 tr = current->journal_info;
1071 if (tr->tr_num_buf_new)
1072 __mark_inode_dirty(inode, I_DIRTY_DATASYNC);
1074 gfs2_trans_end(sdp);
1077 if (gfs2_is_stuffed(ip) || gfs2_is_jdata(ip))
1078 iomap->folio_ops = &gfs2_iomap_folio_ops;
1082 gfs2_trans_end(sdp);
1084 gfs2_inplace_release(ip);
1086 gfs2_quota_unlock(ip);
1090 static int gfs2_iomap_begin(struct inode *inode, loff_t pos, loff_t length,
1091 unsigned flags, struct iomap *iomap,
1092 struct iomap *srcmap)
1094 struct gfs2_inode *ip = GFS2_I(inode);
1095 struct metapath mp = { .mp_aheight = 1, };
1098 if (gfs2_is_jdata(ip))
1099 iomap->flags |= IOMAP_F_BUFFER_HEAD;
1101 trace_gfs2_iomap_start(ip, pos, length, flags);
1102 ret = __gfs2_iomap_get(inode, pos, length, flags, iomap, &mp);
1106 switch(flags & (IOMAP_WRITE | IOMAP_ZERO)) {
1108 if (flags & IOMAP_DIRECT) {
1110 * Silently fall back to buffered I/O for stuffed files
1111 * or if we've got a hole (see gfs2_file_direct_write).
1113 if (iomap->type != IOMAP_MAPPED)
1119 if (iomap->type == IOMAP_HOLE)
1126 ret = gfs2_iomap_begin_write(inode, pos, length, flags, iomap, &mp);
1129 release_metapath(&mp);
1130 trace_gfs2_iomap_end(ip, iomap, ret);
1134 static int gfs2_iomap_end(struct inode *inode, loff_t pos, loff_t length,
1135 ssize_t written, unsigned flags, struct iomap *iomap)
1137 struct gfs2_inode *ip = GFS2_I(inode);
1138 struct gfs2_sbd *sdp = GFS2_SB(inode);
1140 switch (flags & (IOMAP_WRITE | IOMAP_ZERO)) {
1142 if (flags & IOMAP_DIRECT)
1146 if (iomap->type == IOMAP_HOLE)
1153 if (!gfs2_is_stuffed(ip))
1154 gfs2_ordered_add_inode(ip);
1156 if (inode == sdp->sd_rindex)
1157 adjust_fs_space(inode);
1159 gfs2_inplace_release(ip);
1161 if (ip->i_qadata && ip->i_qadata->qa_qd_num)
1162 gfs2_quota_unlock(ip);
1164 if (length != written && (iomap->flags & IOMAP_F_NEW)) {
1165 /* Deallocate blocks that were just allocated. */
1166 loff_t hstart = round_up(pos + written, i_blocksize(inode));
1167 loff_t hend = iomap->offset + iomap->length;
1169 if (hstart < hend) {
1170 truncate_pagecache_range(inode, hstart, hend - 1);
1171 punch_hole(ip, hstart, hend - hstart);
1175 if (unlikely(!written))
1178 if (iomap->flags & IOMAP_F_SIZE_CHANGED)
1179 mark_inode_dirty(inode);
1180 set_bit(GLF_DIRTY, &ip->i_gl->gl_flags);
1184 const struct iomap_ops gfs2_iomap_ops = {
1185 .iomap_begin = gfs2_iomap_begin,
1186 .iomap_end = gfs2_iomap_end,
1190 * gfs2_block_map - Map one or more blocks of an inode to a disk block
1192 * @lblock: The logical block number
1193 * @bh_map: The bh to be mapped
1194 * @create: True if its ok to alloc blocks to satify the request
1196 * The size of the requested mapping is defined in bh_map->b_size.
1198 * Clears buffer_mapped(bh_map) and leaves bh_map->b_size unchanged
1199 * when @lblock is not mapped. Sets buffer_mapped(bh_map) and
1200 * bh_map->b_size to indicate the size of the mapping when @lblock and
1201 * successive blocks are mapped, up to the requested size.
1203 * Sets buffer_boundary() if a read of metadata will be required
1204 * before the next block can be mapped. Sets buffer_new() if new
1205 * blocks were allocated.
1210 int gfs2_block_map(struct inode *inode, sector_t lblock,
1211 struct buffer_head *bh_map, int create)
1213 struct gfs2_inode *ip = GFS2_I(inode);
1214 loff_t pos = (loff_t)lblock << inode->i_blkbits;
1215 loff_t length = bh_map->b_size;
1216 struct iomap iomap = { };
1219 clear_buffer_mapped(bh_map);
1220 clear_buffer_new(bh_map);
1221 clear_buffer_boundary(bh_map);
1222 trace_gfs2_bmap(ip, bh_map, lblock, create, 1);
1225 ret = gfs2_iomap_get(inode, pos, length, &iomap);
1227 ret = gfs2_iomap_alloc(inode, pos, length, &iomap);
1231 if (iomap.length > bh_map->b_size) {
1232 iomap.length = bh_map->b_size;
1233 iomap.flags &= ~IOMAP_F_GFS2_BOUNDARY;
1235 if (iomap.addr != IOMAP_NULL_ADDR)
1236 map_bh(bh_map, inode->i_sb, iomap.addr >> inode->i_blkbits);
1237 bh_map->b_size = iomap.length;
1238 if (iomap.flags & IOMAP_F_GFS2_BOUNDARY)
1239 set_buffer_boundary(bh_map);
1240 if (iomap.flags & IOMAP_F_NEW)
1241 set_buffer_new(bh_map);
1244 trace_gfs2_bmap(ip, bh_map, lblock, create, ret);
1248 int gfs2_get_extent(struct inode *inode, u64 lblock, u64 *dblock,
1249 unsigned int *extlen)
1251 unsigned int blkbits = inode->i_blkbits;
1252 struct iomap iomap = { };
1256 ret = gfs2_iomap_get(inode, lblock << blkbits, *extlen << blkbits,
1260 if (iomap.type != IOMAP_MAPPED)
1262 *dblock = iomap.addr >> blkbits;
1263 len = iomap.length >> blkbits;
1269 int gfs2_alloc_extent(struct inode *inode, u64 lblock, u64 *dblock,
1270 unsigned int *extlen, bool *new)
1272 unsigned int blkbits = inode->i_blkbits;
1273 struct iomap iomap = { };
1277 ret = gfs2_iomap_alloc(inode, lblock << blkbits, *extlen << blkbits,
1281 if (iomap.type != IOMAP_MAPPED)
1283 *dblock = iomap.addr >> blkbits;
1284 len = iomap.length >> blkbits;
1287 *new = iomap.flags & IOMAP_F_NEW;
1292 * NOTE: Never call gfs2_block_zero_range with an open transaction because it
1293 * uses iomap write to perform its actions, which begin their own transactions
1294 * (iomap_begin, get_folio, etc.)
1296 static int gfs2_block_zero_range(struct inode *inode, loff_t from,
1297 unsigned int length)
1299 BUG_ON(current->journal_info);
1300 return iomap_zero_range(inode, from, length, NULL, &gfs2_iomap_ops);
1303 #define GFS2_JTRUNC_REVOKES 8192
1306 * gfs2_journaled_truncate - Wrapper for truncate_pagecache for jdata files
1307 * @inode: The inode being truncated
1308 * @oldsize: The original (larger) size
1309 * @newsize: The new smaller size
1311 * With jdata files, we have to journal a revoke for each block which is
1312 * truncated. As a result, we need to split this into separate transactions
1313 * if the number of pages being truncated gets too large.
1316 static int gfs2_journaled_truncate(struct inode *inode, u64 oldsize, u64 newsize)
1318 struct gfs2_sbd *sdp = GFS2_SB(inode);
1319 u64 max_chunk = GFS2_JTRUNC_REVOKES * sdp->sd_vfs->s_blocksize;
1323 while (oldsize != newsize) {
1324 struct gfs2_trans *tr;
1327 chunk = oldsize - newsize;
1328 if (chunk > max_chunk)
1331 offs = oldsize & ~PAGE_MASK;
1332 if (offs && chunk > PAGE_SIZE)
1333 chunk = offs + ((chunk - offs) & PAGE_MASK);
1335 truncate_pagecache(inode, oldsize - chunk);
1338 tr = current->journal_info;
1339 if (!test_bit(TR_TOUCHED, &tr->tr_flags))
1342 gfs2_trans_end(sdp);
1343 error = gfs2_trans_begin(sdp, RES_DINODE, GFS2_JTRUNC_REVOKES);
1351 static int trunc_start(struct inode *inode, u64 newsize)
1353 struct gfs2_inode *ip = GFS2_I(inode);
1354 struct gfs2_sbd *sdp = GFS2_SB(inode);
1355 struct buffer_head *dibh = NULL;
1356 int journaled = gfs2_is_jdata(ip);
1357 u64 oldsize = inode->i_size;
1360 if (!gfs2_is_stuffed(ip)) {
1361 unsigned int blocksize = i_blocksize(inode);
1362 unsigned int offs = newsize & (blocksize - 1);
1364 error = gfs2_block_zero_range(inode, newsize,
1371 error = gfs2_trans_begin(sdp, RES_DINODE + RES_JDATA, GFS2_JTRUNC_REVOKES);
1373 error = gfs2_trans_begin(sdp, RES_DINODE, 0);
1377 error = gfs2_meta_inode_buffer(ip, &dibh);
1381 gfs2_trans_add_meta(ip->i_gl, dibh);
1383 if (gfs2_is_stuffed(ip))
1384 gfs2_buffer_clear_tail(dibh, sizeof(struct gfs2_dinode) + newsize);
1386 ip->i_diskflags |= GFS2_DIF_TRUNC_IN_PROG;
1388 i_size_write(inode, newsize);
1389 ip->i_inode.i_mtime = ip->i_inode.i_ctime = current_time(&ip->i_inode);
1390 gfs2_dinode_out(ip, dibh->b_data);
1393 error = gfs2_journaled_truncate(inode, oldsize, newsize);
1395 truncate_pagecache(inode, newsize);
1399 if (current->journal_info)
1400 gfs2_trans_end(sdp);
1404 int gfs2_iomap_get(struct inode *inode, loff_t pos, loff_t length,
1405 struct iomap *iomap)
1407 struct metapath mp = { .mp_aheight = 1, };
1410 ret = __gfs2_iomap_get(inode, pos, length, 0, iomap, &mp);
1411 release_metapath(&mp);
1415 int gfs2_iomap_alloc(struct inode *inode, loff_t pos, loff_t length,
1416 struct iomap *iomap)
1418 struct metapath mp = { .mp_aheight = 1, };
1421 ret = __gfs2_iomap_get(inode, pos, length, IOMAP_WRITE, iomap, &mp);
1422 if (!ret && iomap->type == IOMAP_HOLE)
1423 ret = __gfs2_iomap_alloc(inode, iomap, &mp);
1424 release_metapath(&mp);
1429 * sweep_bh_for_rgrps - find an rgrp in a meta buffer and free blocks therein
1431 * @rd_gh: holder of resource group glock
1432 * @bh: buffer head to sweep
1433 * @start: starting point in bh
1434 * @end: end point in bh
1435 * @meta: true if bh points to metadata (rather than data)
1436 * @btotal: place to keep count of total blocks freed
1438 * We sweep a metadata buffer (provided by the metapath) for blocks we need to
1439 * free, and free them all. However, we do it one rgrp at a time. If this
1440 * block has references to multiple rgrps, we break it into individual
1441 * transactions. This allows other processes to use the rgrps while we're
1442 * focused on a single one, for better concurrency / performance.
1443 * At every transaction boundary, we rewrite the inode into the journal.
1444 * That way the bitmaps are kept consistent with the inode and we can recover
1445 * if we're interrupted by power-outages.
1447 * Returns: 0, or return code if an error occurred.
1448 * *btotal has the total number of blocks freed
1450 static int sweep_bh_for_rgrps(struct gfs2_inode *ip, struct gfs2_holder *rd_gh,
1451 struct buffer_head *bh, __be64 *start, __be64 *end,
1452 bool meta, u32 *btotal)
1454 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1455 struct gfs2_rgrpd *rgd;
1456 struct gfs2_trans *tr;
1458 int blks_outside_rgrp;
1459 u64 bn, bstart, isize_blks;
1460 s64 blen; /* needs to be s64 or gfs2_add_inode_blocks breaks */
1462 bool buf_in_tr = false; /* buffer was added to transaction */
1466 if (gfs2_holder_initialized(rd_gh)) {
1467 rgd = gfs2_glock2rgrp(rd_gh->gh_gl);
1468 gfs2_assert_withdraw(sdp,
1469 gfs2_glock_is_locked_by_me(rd_gh->gh_gl));
1471 blks_outside_rgrp = 0;
1475 for (p = start; p < end; p++) {
1478 bn = be64_to_cpu(*p);
1481 if (!rgrp_contains_block(rgd, bn)) {
1482 blks_outside_rgrp++;
1486 rgd = gfs2_blk2rgrpd(sdp, bn, true);
1487 if (unlikely(!rgd)) {
1491 ret = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_EXCLUSIVE,
1492 LM_FLAG_NODE_SCOPE, rd_gh);
1496 /* Must be done with the rgrp glock held: */
1497 if (gfs2_rs_active(&ip->i_res) &&
1498 rgd == ip->i_res.rs_rgd)
1499 gfs2_rs_deltree(&ip->i_res);
1502 /* The size of our transactions will be unknown until we
1503 actually process all the metadata blocks that relate to
1504 the rgrp. So we estimate. We know it can't be more than
1505 the dinode's i_blocks and we don't want to exceed the
1506 journal flush threshold, sd_log_thresh2. */
1507 if (current->journal_info == NULL) {
1508 unsigned int jblocks_rqsted, revokes;
1510 jblocks_rqsted = rgd->rd_length + RES_DINODE +
1512 isize_blks = gfs2_get_inode_blocks(&ip->i_inode);
1513 if (isize_blks > atomic_read(&sdp->sd_log_thresh2))
1515 atomic_read(&sdp->sd_log_thresh2);
1517 jblocks_rqsted += isize_blks;
1518 revokes = jblocks_rqsted;
1520 revokes += end - start;
1521 else if (ip->i_depth)
1522 revokes += sdp->sd_inptrs;
1523 ret = gfs2_trans_begin(sdp, jblocks_rqsted, revokes);
1526 down_write(&ip->i_rw_mutex);
1528 /* check if we will exceed the transaction blocks requested */
1529 tr = current->journal_info;
1530 if (tr->tr_num_buf_new + RES_STATFS +
1531 RES_QUOTA >= atomic_read(&sdp->sd_log_thresh2)) {
1532 /* We set blks_outside_rgrp to ensure the loop will
1533 be repeated for the same rgrp, but with a new
1535 blks_outside_rgrp++;
1536 /* This next part is tricky. If the buffer was added
1537 to the transaction, we've already set some block
1538 pointers to 0, so we better follow through and free
1539 them, or we will introduce corruption (so break).
1540 This may be impossible, or at least rare, but I
1541 decided to cover the case regardless.
1543 If the buffer was not added to the transaction
1544 (this call), doing so would exceed our transaction
1545 size, so we need to end the transaction and start a
1546 new one (so goto). */
1553 gfs2_trans_add_meta(ip->i_gl, bh);
1556 if (bstart + blen == bn) {
1561 __gfs2_free_blocks(ip, rgd, bstart, (u32)blen, meta);
1563 gfs2_add_inode_blocks(&ip->i_inode, -blen);
1569 __gfs2_free_blocks(ip, rgd, bstart, (u32)blen, meta);
1571 gfs2_add_inode_blocks(&ip->i_inode, -blen);
1574 if (!ret && blks_outside_rgrp) { /* If buffer still has non-zero blocks
1575 outside the rgrp we just processed,
1576 do it all over again. */
1577 if (current->journal_info) {
1578 struct buffer_head *dibh;
1580 ret = gfs2_meta_inode_buffer(ip, &dibh);
1584 /* Every transaction boundary, we rewrite the dinode
1585 to keep its di_blocks current in case of failure. */
1586 ip->i_inode.i_mtime = ip->i_inode.i_ctime =
1587 current_time(&ip->i_inode);
1588 gfs2_trans_add_meta(ip->i_gl, dibh);
1589 gfs2_dinode_out(ip, dibh->b_data);
1591 up_write(&ip->i_rw_mutex);
1592 gfs2_trans_end(sdp);
1595 gfs2_glock_dq_uninit(rd_gh);
1603 static bool mp_eq_to_hgt(struct metapath *mp, __u16 *list, unsigned int h)
1605 if (memcmp(mp->mp_list, list, h * sizeof(mp->mp_list[0])))
1611 * find_nonnull_ptr - find a non-null pointer given a metapath and height
1612 * @sdp: The superblock
1613 * @mp: starting metapath
1614 * @h: desired height to search
1615 * @end_list: See punch_hole().
1616 * @end_aligned: See punch_hole().
1618 * Assumes the metapath is valid (with buffers) out to height h.
1619 * Returns: true if a non-null pointer was found in the metapath buffer
1620 * false if all remaining pointers are NULL in the buffer
1622 static bool find_nonnull_ptr(struct gfs2_sbd *sdp, struct metapath *mp,
1624 __u16 *end_list, unsigned int end_aligned)
1626 struct buffer_head *bh = mp->mp_bh[h];
1627 __be64 *first, *ptr, *end;
1629 first = metaptr1(h, mp);
1630 ptr = first + mp->mp_list[h];
1631 end = (__be64 *)(bh->b_data + bh->b_size);
1632 if (end_list && mp_eq_to_hgt(mp, end_list, h)) {
1633 bool keep_end = h < end_aligned;
1634 end = first + end_list[h] + keep_end;
1638 if (*ptr) { /* if we have a non-null pointer */
1639 mp->mp_list[h] = ptr - first;
1641 if (h < GFS2_MAX_META_HEIGHT)
1650 enum dealloc_states {
1651 DEALLOC_MP_FULL = 0, /* Strip a metapath with all buffers read in */
1652 DEALLOC_MP_LOWER = 1, /* lower the metapath strip height */
1653 DEALLOC_FILL_MP = 2, /* Fill in the metapath to the given height. */
1654 DEALLOC_DONE = 3, /* process complete */
1658 metapointer_range(struct metapath *mp, int height,
1659 __u16 *start_list, unsigned int start_aligned,
1660 __u16 *end_list, unsigned int end_aligned,
1661 __be64 **start, __be64 **end)
1663 struct buffer_head *bh = mp->mp_bh[height];
1666 first = metaptr1(height, mp);
1668 if (mp_eq_to_hgt(mp, start_list, height)) {
1669 bool keep_start = height < start_aligned;
1670 *start = first + start_list[height] + keep_start;
1672 *end = (__be64 *)(bh->b_data + bh->b_size);
1673 if (end_list && mp_eq_to_hgt(mp, end_list, height)) {
1674 bool keep_end = height < end_aligned;
1675 *end = first + end_list[height] + keep_end;
1679 static inline bool walk_done(struct gfs2_sbd *sdp,
1680 struct metapath *mp, int height,
1681 __u16 *end_list, unsigned int end_aligned)
1686 bool keep_end = height < end_aligned;
1687 if (!mp_eq_to_hgt(mp, end_list, height))
1689 end = end_list[height] + keep_end;
1691 end = (height > 0) ? sdp->sd_inptrs : sdp->sd_diptrs;
1692 return mp->mp_list[height] >= end;
1696 * punch_hole - deallocate blocks in a file
1697 * @ip: inode to truncate
1698 * @offset: the start of the hole
1699 * @length: the size of the hole (or 0 for truncate)
1701 * Punch a hole into a file or truncate a file at a given position. This
1702 * function operates in whole blocks (@offset and @length are rounded
1703 * accordingly); partially filled blocks must be cleared otherwise.
1705 * This function works from the bottom up, and from the right to the left. In
1706 * other words, it strips off the highest layer (data) before stripping any of
1707 * the metadata. Doing it this way is best in case the operation is interrupted
1708 * by power failure, etc. The dinode is rewritten in every transaction to
1709 * guarantee integrity.
1711 static int punch_hole(struct gfs2_inode *ip, u64 offset, u64 length)
1713 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1714 u64 maxsize = sdp->sd_heightsize[ip->i_height];
1715 struct metapath mp = {};
1716 struct buffer_head *dibh, *bh;
1717 struct gfs2_holder rd_gh;
1718 unsigned int bsize_shift = sdp->sd_sb.sb_bsize_shift;
1719 u64 lblock = (offset + (1 << bsize_shift) - 1) >> bsize_shift;
1720 __u16 start_list[GFS2_MAX_META_HEIGHT];
1721 __u16 __end_list[GFS2_MAX_META_HEIGHT], *end_list = NULL;
1722 unsigned int start_aligned, end_aligned;
1723 unsigned int strip_h = ip->i_height - 1;
1726 int mp_h; /* metapath buffers are read in to this height */
1728 __be64 *start, *end;
1730 if (offset >= maxsize) {
1732 * The starting point lies beyond the allocated metadata;
1733 * there are no blocks to deallocate.
1739 * The start position of the hole is defined by lblock, start_list, and
1740 * start_aligned. The end position of the hole is defined by lend,
1741 * end_list, and end_aligned.
1743 * start_aligned and end_aligned define down to which height the start
1744 * and end positions are aligned to the metadata tree (i.e., the
1745 * position is a multiple of the metadata granularity at the height
1746 * above). This determines at which heights additional meta pointers
1747 * needs to be preserved for the remaining data.
1751 u64 end_offset = offset + length;
1755 * Clip the end at the maximum file size for the given height:
1756 * that's how far the metadata goes; files bigger than that
1757 * will have additional layers of indirection.
1759 if (end_offset > maxsize)
1760 end_offset = maxsize;
1761 lend = end_offset >> bsize_shift;
1766 find_metapath(sdp, lend, &mp, ip->i_height);
1767 end_list = __end_list;
1768 memcpy(end_list, mp.mp_list, sizeof(mp.mp_list));
1770 for (mp_h = ip->i_height - 1; mp_h > 0; mp_h--) {
1777 find_metapath(sdp, lblock, &mp, ip->i_height);
1778 memcpy(start_list, mp.mp_list, sizeof(start_list));
1780 for (mp_h = ip->i_height - 1; mp_h > 0; mp_h--) {
1781 if (start_list[mp_h])
1784 start_aligned = mp_h;
1786 ret = gfs2_meta_inode_buffer(ip, &dibh);
1791 ret = lookup_metapath(ip, &mp);
1795 /* issue read-ahead on metadata */
1796 for (mp_h = 0; mp_h < mp.mp_aheight - 1; mp_h++) {
1797 metapointer_range(&mp, mp_h, start_list, start_aligned,
1798 end_list, end_aligned, &start, &end);
1799 gfs2_metapath_ra(ip->i_gl, start, end);
1802 if (mp.mp_aheight == ip->i_height)
1803 state = DEALLOC_MP_FULL; /* We have a complete metapath */
1805 state = DEALLOC_FILL_MP; /* deal with partial metapath */
1807 ret = gfs2_rindex_update(sdp);
1811 ret = gfs2_quota_hold(ip, NO_UID_QUOTA_CHANGE, NO_GID_QUOTA_CHANGE);
1814 gfs2_holder_mark_uninitialized(&rd_gh);
1818 while (state != DEALLOC_DONE) {
1820 /* Truncate a full metapath at the given strip height.
1821 * Note that strip_h == mp_h in order to be in this state. */
1822 case DEALLOC_MP_FULL:
1823 bh = mp.mp_bh[mp_h];
1824 gfs2_assert_withdraw(sdp, bh);
1825 if (gfs2_assert_withdraw(sdp,
1826 prev_bnr != bh->b_blocknr)) {
1827 fs_emerg(sdp, "inode %llu, block:%llu, i_h:%u,"
1828 "s_h:%u, mp_h:%u\n",
1829 (unsigned long long)ip->i_no_addr,
1830 prev_bnr, ip->i_height, strip_h, mp_h);
1832 prev_bnr = bh->b_blocknr;
1834 if (gfs2_metatype_check(sdp, bh,
1835 (mp_h ? GFS2_METATYPE_IN :
1836 GFS2_METATYPE_DI))) {
1842 * Below, passing end_aligned as 0 gives us the
1843 * metapointer range excluding the end point: the end
1844 * point is the first metapath we must not deallocate!
1847 metapointer_range(&mp, mp_h, start_list, start_aligned,
1848 end_list, 0 /* end_aligned */,
1850 ret = sweep_bh_for_rgrps(ip, &rd_gh, mp.mp_bh[mp_h],
1852 mp_h != ip->i_height - 1,
1855 /* If we hit an error or just swept dinode buffer,
1858 state = DEALLOC_DONE;
1861 state = DEALLOC_MP_LOWER;
1864 /* lower the metapath strip height */
1865 case DEALLOC_MP_LOWER:
1866 /* We're done with the current buffer, so release it,
1867 unless it's the dinode buffer. Then back up to the
1868 previous pointer. */
1870 brelse(mp.mp_bh[mp_h]);
1871 mp.mp_bh[mp_h] = NULL;
1873 /* If we can't get any lower in height, we've stripped
1874 off all we can. Next step is to back up and start
1875 stripping the previous level of metadata. */
1878 memcpy(mp.mp_list, start_list, sizeof(start_list));
1880 state = DEALLOC_FILL_MP;
1883 mp.mp_list[mp_h] = 0;
1884 mp_h--; /* search one metadata height down */
1886 if (walk_done(sdp, &mp, mp_h, end_list, end_aligned))
1888 /* Here we've found a part of the metapath that is not
1889 * allocated. We need to search at that height for the
1890 * next non-null pointer. */
1891 if (find_nonnull_ptr(sdp, &mp, mp_h, end_list, end_aligned)) {
1892 state = DEALLOC_FILL_MP;
1895 /* No more non-null pointers at this height. Back up
1896 to the previous height and try again. */
1897 break; /* loop around in the same state */
1899 /* Fill the metapath with buffers to the given height. */
1900 case DEALLOC_FILL_MP:
1901 /* Fill the buffers out to the current height. */
1902 ret = fillup_metapath(ip, &mp, mp_h);
1906 /* On the first pass, issue read-ahead on metadata. */
1907 if (mp.mp_aheight > 1 && strip_h == ip->i_height - 1) {
1908 unsigned int height = mp.mp_aheight - 1;
1910 /* No read-ahead for data blocks. */
1911 if (mp.mp_aheight - 1 == strip_h)
1914 for (; height >= mp.mp_aheight - ret; height--) {
1915 metapointer_range(&mp, height,
1916 start_list, start_aligned,
1917 end_list, end_aligned,
1919 gfs2_metapath_ra(ip->i_gl, start, end);
1923 /* If buffers found for the entire strip height */
1924 if (mp.mp_aheight - 1 == strip_h) {
1925 state = DEALLOC_MP_FULL;
1928 if (mp.mp_aheight < ip->i_height) /* We have a partial height */
1929 mp_h = mp.mp_aheight - 1;
1931 /* If we find a non-null block pointer, crawl a bit
1932 higher up in the metapath and try again, otherwise
1933 we need to look lower for a new starting point. */
1934 if (find_nonnull_ptr(sdp, &mp, mp_h, end_list, end_aligned))
1937 state = DEALLOC_MP_LOWER;
1943 if (current->journal_info == NULL) {
1944 ret = gfs2_trans_begin(sdp, RES_DINODE + RES_STATFS +
1948 down_write(&ip->i_rw_mutex);
1950 gfs2_statfs_change(sdp, 0, +btotal, 0);
1951 gfs2_quota_change(ip, -(s64)btotal, ip->i_inode.i_uid,
1953 ip->i_inode.i_mtime = ip->i_inode.i_ctime = current_time(&ip->i_inode);
1954 gfs2_trans_add_meta(ip->i_gl, dibh);
1955 gfs2_dinode_out(ip, dibh->b_data);
1956 up_write(&ip->i_rw_mutex);
1957 gfs2_trans_end(sdp);
1961 if (gfs2_holder_initialized(&rd_gh))
1962 gfs2_glock_dq_uninit(&rd_gh);
1963 if (current->journal_info) {
1964 up_write(&ip->i_rw_mutex);
1965 gfs2_trans_end(sdp);
1968 gfs2_quota_unhold(ip);
1970 release_metapath(&mp);
1974 static int trunc_end(struct gfs2_inode *ip)
1976 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1977 struct buffer_head *dibh;
1980 error = gfs2_trans_begin(sdp, RES_DINODE, 0);
1984 down_write(&ip->i_rw_mutex);
1986 error = gfs2_meta_inode_buffer(ip, &dibh);
1990 if (!i_size_read(&ip->i_inode)) {
1992 ip->i_goal = ip->i_no_addr;
1993 gfs2_buffer_clear_tail(dibh, sizeof(struct gfs2_dinode));
1994 gfs2_ordered_del_inode(ip);
1996 ip->i_inode.i_mtime = ip->i_inode.i_ctime = current_time(&ip->i_inode);
1997 ip->i_diskflags &= ~GFS2_DIF_TRUNC_IN_PROG;
1999 gfs2_trans_add_meta(ip->i_gl, dibh);
2000 gfs2_dinode_out(ip, dibh->b_data);
2004 up_write(&ip->i_rw_mutex);
2005 gfs2_trans_end(sdp);
2010 * do_shrink - make a file smaller
2012 * @newsize: the size to make the file
2014 * Called with an exclusive lock on @inode. The @size must
2015 * be equal to or smaller than the current inode size.
2020 static int do_shrink(struct inode *inode, u64 newsize)
2022 struct gfs2_inode *ip = GFS2_I(inode);
2025 error = trunc_start(inode, newsize);
2028 if (gfs2_is_stuffed(ip))
2031 error = punch_hole(ip, newsize, 0);
2033 error = trunc_end(ip);
2039 * do_grow - Touch and update inode size
2041 * @size: The new size
2043 * This function updates the timestamps on the inode and
2044 * may also increase the size of the inode. This function
2045 * must not be called with @size any smaller than the current
2048 * Although it is not strictly required to unstuff files here,
2049 * earlier versions of GFS2 have a bug in the stuffed file reading
2050 * code which will result in a buffer overrun if the size is larger
2051 * than the max stuffed file size. In order to prevent this from
2052 * occurring, such files are unstuffed, but in other cases we can
2053 * just update the inode size directly.
2055 * Returns: 0 on success, or -ve on error
2058 static int do_grow(struct inode *inode, u64 size)
2060 struct gfs2_inode *ip = GFS2_I(inode);
2061 struct gfs2_sbd *sdp = GFS2_SB(inode);
2062 struct gfs2_alloc_parms ap = { .target = 1, };
2063 struct buffer_head *dibh;
2067 if (gfs2_is_stuffed(ip) && size > gfs2_max_stuffed_size(ip)) {
2068 error = gfs2_quota_lock_check(ip, &ap);
2072 error = gfs2_inplace_reserve(ip, &ap);
2074 goto do_grow_qunlock;
2078 error = gfs2_trans_begin(sdp, RES_DINODE + RES_STATFS + RES_RG_BIT +
2080 gfs2_is_jdata(ip) ? RES_JDATA : 0) +
2081 (sdp->sd_args.ar_quota == GFS2_QUOTA_OFF ?
2084 goto do_grow_release;
2087 error = gfs2_unstuff_dinode(ip);
2092 error = gfs2_meta_inode_buffer(ip, &dibh);
2096 truncate_setsize(inode, size);
2097 ip->i_inode.i_mtime = ip->i_inode.i_ctime = current_time(&ip->i_inode);
2098 gfs2_trans_add_meta(ip->i_gl, dibh);
2099 gfs2_dinode_out(ip, dibh->b_data);
2103 gfs2_trans_end(sdp);
2106 gfs2_inplace_release(ip);
2108 gfs2_quota_unlock(ip);
2114 * gfs2_setattr_size - make a file a given size
2116 * @newsize: the size to make the file
2118 * The file size can grow, shrink, or stay the same size. This
2119 * is called holding i_rwsem and an exclusive glock on the inode
2125 int gfs2_setattr_size(struct inode *inode, u64 newsize)
2127 struct gfs2_inode *ip = GFS2_I(inode);
2130 BUG_ON(!S_ISREG(inode->i_mode));
2132 ret = inode_newsize_ok(inode, newsize);
2136 inode_dio_wait(inode);
2138 ret = gfs2_qa_get(ip);
2142 if (newsize >= inode->i_size) {
2143 ret = do_grow(inode, newsize);
2147 ret = do_shrink(inode, newsize);
2154 int gfs2_truncatei_resume(struct gfs2_inode *ip)
2157 error = punch_hole(ip, i_size_read(&ip->i_inode), 0);
2159 error = trunc_end(ip);
2163 int gfs2_file_dealloc(struct gfs2_inode *ip)
2165 return punch_hole(ip, 0, 0);
2169 * gfs2_free_journal_extents - Free cached journal bmap info
2174 void gfs2_free_journal_extents(struct gfs2_jdesc *jd)
2176 struct gfs2_journal_extent *jext;
2178 while(!list_empty(&jd->extent_list)) {
2179 jext = list_first_entry(&jd->extent_list, struct gfs2_journal_extent, list);
2180 list_del(&jext->list);
2186 * gfs2_add_jextent - Add or merge a new extent to extent cache
2187 * @jd: The journal descriptor
2188 * @lblock: The logical block at start of new extent
2189 * @dblock: The physical block at start of new extent
2190 * @blocks: Size of extent in fs blocks
2192 * Returns: 0 on success or -ENOMEM
2195 static int gfs2_add_jextent(struct gfs2_jdesc *jd, u64 lblock, u64 dblock, u64 blocks)
2197 struct gfs2_journal_extent *jext;
2199 if (!list_empty(&jd->extent_list)) {
2200 jext = list_last_entry(&jd->extent_list, struct gfs2_journal_extent, list);
2201 if ((jext->dblock + jext->blocks) == dblock) {
2202 jext->blocks += blocks;
2207 jext = kzalloc(sizeof(struct gfs2_journal_extent), GFP_NOFS);
2210 jext->dblock = dblock;
2211 jext->lblock = lblock;
2212 jext->blocks = blocks;
2213 list_add_tail(&jext->list, &jd->extent_list);
2219 * gfs2_map_journal_extents - Cache journal bmap info
2220 * @sdp: The super block
2221 * @jd: The journal to map
2223 * Create a reusable "extent" mapping from all logical
2224 * blocks to all physical blocks for the given journal. This will save
2225 * us time when writing journal blocks. Most journals will have only one
2226 * extent that maps all their logical blocks. That's because gfs2.mkfs
2227 * arranges the journal blocks sequentially to maximize performance.
2228 * So the extent would map the first block for the entire file length.
2229 * However, gfs2_jadd can happen while file activity is happening, so
2230 * those journals may not be sequential. Less likely is the case where
2231 * the users created their own journals by mounting the metafs and
2232 * laying it out. But it's still possible. These journals might have
2235 * Returns: 0 on success, or error on failure
2238 int gfs2_map_journal_extents(struct gfs2_sbd *sdp, struct gfs2_jdesc *jd)
2242 struct gfs2_inode *ip = GFS2_I(jd->jd_inode);
2243 struct buffer_head bh;
2244 unsigned int shift = sdp->sd_sb.sb_bsize_shift;
2249 start = ktime_get();
2250 lblock_stop = i_size_read(jd->jd_inode) >> shift;
2251 size = (lblock_stop - lblock) << shift;
2253 WARN_ON(!list_empty(&jd->extent_list));
2259 rc = gfs2_block_map(jd->jd_inode, lblock, &bh, 0);
2260 if (rc || !buffer_mapped(&bh))
2262 rc = gfs2_add_jextent(jd, lblock, bh.b_blocknr, bh.b_size >> shift);
2266 lblock += (bh.b_size >> ip->i_inode.i_blkbits);
2270 fs_info(sdp, "journal %d mapped with %u extents in %lldms\n", jd->jd_jid,
2271 jd->nr_extents, ktime_ms_delta(end, start));
2275 fs_warn(sdp, "error %d mapping journal %u at offset %llu (extent %u)\n",
2277 (unsigned long long)(i_size_read(jd->jd_inode) - size),
2279 fs_warn(sdp, "bmap=%d lblock=%llu block=%llu, state=0x%08lx, size=%llu\n",
2280 rc, (unsigned long long)lblock, (unsigned long long)bh.b_blocknr,
2281 bh.b_state, (unsigned long long)bh.b_size);
2282 gfs2_free_journal_extents(jd);
2287 * gfs2_write_alloc_required - figure out if a write will require an allocation
2288 * @ip: the file being written to
2289 * @offset: the offset to write to
2290 * @len: the number of bytes being written
2292 * Returns: 1 if an alloc is required, 0 otherwise
2295 int gfs2_write_alloc_required(struct gfs2_inode *ip, u64 offset,
2298 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
2299 struct buffer_head bh;
2301 u64 lblock, lblock_stop, size;
2307 if (gfs2_is_stuffed(ip)) {
2308 if (offset + len > gfs2_max_stuffed_size(ip))
2313 shift = sdp->sd_sb.sb_bsize_shift;
2314 BUG_ON(gfs2_is_dir(ip));
2315 end_of_file = (i_size_read(&ip->i_inode) + sdp->sd_sb.sb_bsize - 1) >> shift;
2316 lblock = offset >> shift;
2317 lblock_stop = (offset + len + sdp->sd_sb.sb_bsize - 1) >> shift;
2318 if (lblock_stop > end_of_file && ip != GFS2_I(sdp->sd_rindex))
2321 size = (lblock_stop - lblock) << shift;
2325 gfs2_block_map(&ip->i_inode, lblock, &bh, 0);
2326 if (!buffer_mapped(&bh))
2329 lblock += (bh.b_size >> ip->i_inode.i_blkbits);
2335 static int stuffed_zero_range(struct inode *inode, loff_t offset, loff_t length)
2337 struct gfs2_inode *ip = GFS2_I(inode);
2338 struct buffer_head *dibh;
2341 if (offset >= inode->i_size)
2343 if (offset + length > inode->i_size)
2344 length = inode->i_size - offset;
2346 error = gfs2_meta_inode_buffer(ip, &dibh);
2349 gfs2_trans_add_meta(ip->i_gl, dibh);
2350 memset(dibh->b_data + sizeof(struct gfs2_dinode) + offset, 0,
2356 static int gfs2_journaled_truncate_range(struct inode *inode, loff_t offset,
2359 struct gfs2_sbd *sdp = GFS2_SB(inode);
2360 loff_t max_chunk = GFS2_JTRUNC_REVOKES * sdp->sd_vfs->s_blocksize;
2364 struct gfs2_trans *tr;
2369 if (chunk > max_chunk)
2372 offs = offset & ~PAGE_MASK;
2373 if (offs && chunk > PAGE_SIZE)
2374 chunk = offs + ((chunk - offs) & PAGE_MASK);
2376 truncate_pagecache_range(inode, offset, chunk);
2380 tr = current->journal_info;
2381 if (!test_bit(TR_TOUCHED, &tr->tr_flags))
2384 gfs2_trans_end(sdp);
2385 error = gfs2_trans_begin(sdp, RES_DINODE, GFS2_JTRUNC_REVOKES);
2392 int __gfs2_punch_hole(struct file *file, loff_t offset, loff_t length)
2394 struct inode *inode = file_inode(file);
2395 struct gfs2_inode *ip = GFS2_I(inode);
2396 struct gfs2_sbd *sdp = GFS2_SB(inode);
2397 unsigned int blocksize = i_blocksize(inode);
2401 if (!gfs2_is_stuffed(ip)) {
2402 unsigned int start_off, end_len;
2404 start_off = offset & (blocksize - 1);
2405 end_len = (offset + length) & (blocksize - 1);
2407 unsigned int len = length;
2408 if (length > blocksize - start_off)
2409 len = blocksize - start_off;
2410 error = gfs2_block_zero_range(inode, offset, len);
2413 if (start_off + length < blocksize)
2417 error = gfs2_block_zero_range(inode,
2418 offset + length - end_len, end_len);
2424 start = round_down(offset, blocksize);
2425 end = round_up(offset + length, blocksize) - 1;
2426 error = filemap_write_and_wait_range(inode->i_mapping, start, end);
2430 if (gfs2_is_jdata(ip))
2431 error = gfs2_trans_begin(sdp, RES_DINODE + 2 * RES_JDATA,
2432 GFS2_JTRUNC_REVOKES);
2434 error = gfs2_trans_begin(sdp, RES_DINODE, 0);
2438 if (gfs2_is_stuffed(ip)) {
2439 error = stuffed_zero_range(inode, offset, length);
2444 if (gfs2_is_jdata(ip)) {
2445 BUG_ON(!current->journal_info);
2446 gfs2_journaled_truncate_range(inode, offset, length);
2448 truncate_pagecache_range(inode, offset, offset + length - 1);
2450 file_update_time(file);
2451 mark_inode_dirty(inode);
2453 if (current->journal_info)
2454 gfs2_trans_end(sdp);
2456 if (!gfs2_is_stuffed(ip))
2457 error = punch_hole(ip, offset, length);
2460 if (current->journal_info)
2461 gfs2_trans_end(sdp);
2465 static int gfs2_map_blocks(struct iomap_writepage_ctx *wpc, struct inode *inode,
2470 if (WARN_ON_ONCE(gfs2_is_stuffed(GFS2_I(inode))))
2473 if (offset >= wpc->iomap.offset &&
2474 offset < wpc->iomap.offset + wpc->iomap.length)
2477 memset(&wpc->iomap, 0, sizeof(wpc->iomap));
2478 ret = gfs2_iomap_get(inode, offset, INT_MAX, &wpc->iomap);
2482 const struct iomap_writeback_ops gfs2_writeback_ops = {
2483 .map_blocks = gfs2_map_blocks,