perf arm-spe: Add raw decoding for SPEv1.2 previous branch address
[linux-2.6-block.git] / fs / gfs2 / bmap.c
CommitLineData
7336d0e6 1// SPDX-License-Identifier: GPL-2.0-only
b3b94faa
DT
2/*
3 * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
3a8a9a10 4 * Copyright (C) 2004-2006 Red Hat, Inc. All rights reserved.
b3b94faa
DT
5 */
6
b3b94faa
DT
7#include <linux/spinlock.h>
8#include <linux/completion.h>
9#include <linux/buffer_head.h>
64dd153c 10#include <linux/blkdev.h>
5c676f6d 11#include <linux/gfs2_ondisk.h>
71b86f56 12#include <linux/crc32.h>
3974320c 13#include <linux/iomap.h>
98583b3e 14#include <linux/ktime.h>
b3b94faa
DT
15
16#include "gfs2.h"
5c676f6d 17#include "incore.h"
b3b94faa
DT
18#include "bmap.h"
19#include "glock.h"
20#include "inode.h"
b3b94faa 21#include "meta_io.h"
b3b94faa
DT
22#include "quota.h"
23#include "rgrp.h"
45138990 24#include "log.h"
4c16c36a 25#include "super.h"
b3b94faa 26#include "trans.h"
18ec7d5c 27#include "dir.h"
5c676f6d 28#include "util.h"
64bc06bb 29#include "aops.h"
63997775 30#include "trace_gfs2.h"
b3b94faa
DT
31
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
34 * keep it small.
35 */
36struct metapath {
dbac6710 37 struct buffer_head *mp_bh[GFS2_MAX_META_HEIGHT];
b3b94faa 38 __u16 mp_list[GFS2_MAX_META_HEIGHT];
5f8bd444
BP
39 int mp_fheight; /* find_metapath height */
40 int mp_aheight; /* actual height (lookup height) */
b3b94faa
DT
41};
42
64bc06bb
AG
43static int punch_hole(struct gfs2_inode *ip, u64 offset, u64 length);
44
f25ef0c1
SW
45/**
46 * gfs2_unstuffer_page - unstuff a stuffed inode into a block cached by a page
47 * @ip: the inode
48 * @dibh: the dinode buffer
49 * @block: the block number that was allocated
ff8f33c8 50 * @page: The (optional) page. This is looked up if @page is NULL
f25ef0c1
SW
51 *
52 * Returns: errno
53 */
54
55static int gfs2_unstuffer_page(struct gfs2_inode *ip, struct buffer_head *dibh,
cd915493 56 u64 block, struct page *page)
f25ef0c1 57{
f25ef0c1 58 struct inode *inode = &ip->i_inode;
f25ef0c1
SW
59
60 if (!PageUptodate(page)) {
61 void *kaddr = kmap(page);
602c89d2
SW
62 u64 dsize = i_size_read(inode);
63
602c89d2 64 memcpy(kaddr, dibh->b_data + sizeof(struct gfs2_dinode), dsize);
09cbfeaf 65 memset(kaddr + dsize, 0, PAGE_SIZE - dsize);
f25ef0c1
SW
66 kunmap(page);
67
68 SetPageUptodate(page);
69 }
70
2164f9b9
CH
71 if (gfs2_is_jdata(ip)) {
72 struct buffer_head *bh;
f25ef0c1 73
2164f9b9
CH
74 if (!page_has_buffers(page))
75 create_empty_buffers(page, BIT(inode->i_blkbits),
76 BIT(BH_Uptodate));
f25ef0c1 77
2164f9b9
CH
78 bh = page_buffers(page);
79 if (!buffer_mapped(bh))
80 map_bh(bh, inode->i_sb, block);
f25ef0c1 81
2164f9b9 82 set_buffer_uptodate(bh);
350a9b0a 83 gfs2_trans_add_data(ip->i_gl, bh);
2164f9b9
CH
84 } else {
85 set_page_dirty(page);
845802b1
AG
86 gfs2_ordered_add_inode(ip);
87 }
f25ef0c1 88
f25ef0c1
SW
89 return 0;
90}
91
7a607a41 92static int __gfs2_unstuff_inode(struct gfs2_inode *ip, struct page *page)
b3b94faa
DT
93{
94 struct buffer_head *bh, *dibh;
48516ced 95 struct gfs2_dinode *di;
cd915493 96 u64 block = 0;
18ec7d5c 97 int isdir = gfs2_is_dir(ip);
b3b94faa
DT
98 int error;
99
b3b94faa
DT
100 error = gfs2_meta_inode_buffer(ip, &dibh);
101 if (error)
7a607a41 102 return error;
907b9bce 103
a2e0f799 104 if (i_size_read(&ip->i_inode)) {
b3b94faa
DT
105 /* Get a free block, fill it with the stuffed data,
106 and write it out to disk */
107
b45e41d7 108 unsigned int n = 1;
6e87ed0f 109 error = gfs2_alloc_blocks(ip, &block, &n, 0, NULL);
09010978
SW
110 if (error)
111 goto out_brelse;
18ec7d5c 112 if (isdir) {
fbb27873 113 gfs2_trans_remove_revoke(GFS2_SB(&ip->i_inode), block, 1);
61e085a8 114 error = gfs2_dir_get_new_buffer(ip, block, &bh);
b3b94faa
DT
115 if (error)
116 goto out_brelse;
48516ced 117 gfs2_buffer_copy_tail(bh, sizeof(struct gfs2_meta_header),
b3b94faa
DT
118 dibh, sizeof(struct gfs2_dinode));
119 brelse(bh);
120 } else {
f25ef0c1 121 error = gfs2_unstuffer_page(ip, dibh, block, page);
b3b94faa
DT
122 if (error)
123 goto out_brelse;
124 }
125 }
126
127 /* Set up the pointer to the new block */
128
350a9b0a 129 gfs2_trans_add_meta(ip->i_gl, dibh);
48516ced 130 di = (struct gfs2_dinode *)dibh->b_data;
b3b94faa
DT
131 gfs2_buffer_clear_tail(dibh, sizeof(struct gfs2_dinode));
132
a2e0f799 133 if (i_size_read(&ip->i_inode)) {
48516ced 134 *(__be64 *)(di + 1) = cpu_to_be64(block);
77658aad
SW
135 gfs2_add_inode_blocks(&ip->i_inode, 1);
136 di->di_blocks = cpu_to_be64(gfs2_get_inode_blocks(&ip->i_inode));
b3b94faa
DT
137 }
138
ecc30c79 139 ip->i_height = 1;
48516ced 140 di->di_height = cpu_to_be16(1);
b3b94faa 141
a91ea69f 142out_brelse:
b3b94faa 143 brelse(dibh);
7a607a41
AG
144 return error;
145}
146
147/**
148 * gfs2_unstuff_dinode - Unstuff a dinode when the data has grown too big
149 * @ip: The GFS2 inode to unstuff
150 *
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.
153 *
154 * Returns: errno
155 */
156
157int gfs2_unstuff_dinode(struct gfs2_inode *ip)
158{
159 struct inode *inode = &ip->i_inode;
160 struct page *page;
161 int error;
162
163 down_write(&ip->i_rw_mutex);
164 page = find_or_create_page(inode->i_mapping, 0, GFP_NOFS);
165 error = -ENOMEM;
166 if (!page)
167 goto out;
168 error = __gfs2_unstuff_inode(ip, page);
169 unlock_page(page);
170 put_page(page);
a91ea69f 171out:
b3b94faa 172 up_write(&ip->i_rw_mutex);
b3b94faa
DT
173 return error;
174}
175
b3b94faa
DT
176/**
177 * find_metapath - Find path through the metadata tree
9b8c81d1 178 * @sdp: The superblock
b3b94faa 179 * @block: The disk block to look up
07e23d68 180 * @mp: The metapath to return the result in
9b8c81d1 181 * @height: The pre-calculated height of the metadata tree
b3b94faa
DT
182 *
183 * This routine returns a struct metapath structure that defines a path
184 * through the metadata of inode "ip" to get to block "block".
185 *
186 * Example:
187 * Given: "ip" is a height 3 file, "offset" is 101342453, and this is a
188 * filesystem with a blocksize of 4096.
189 *
190 * find_metapath() would return a struct metapath structure set to:
07e23d68 191 * mp_fheight = 3, mp_list[0] = 0, mp_list[1] = 48, and mp_list[2] = 165.
b3b94faa
DT
192 *
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.
198 *
199 * ----------------------------------------
200 * | Dinode | |
201 * | | 4|
202 * | |0 1 2 3 4 5 9|
203 * | | 6|
204 * ----------------------------------------
205 * |
206 * |
207 * V
208 * ----------------------------------------
209 * | Indirect Block |
210 * | 5|
211 * | 4 4 4 4 4 5 5 1|
212 * |0 5 6 7 8 9 0 1 2|
213 * ----------------------------------------
214 * |
215 * |
216 * V
217 * ----------------------------------------
218 * | Indirect Block |
219 * | 1 1 1 1 1 5|
220 * | 6 6 6 6 6 1|
221 * |0 3 4 5 6 7 2|
222 * ----------------------------------------
223 * |
224 * |
225 * V
226 * ----------------------------------------
227 * | Data block containing offset |
228 * | 101342453 |
229 * | |
230 * | |
231 * ----------------------------------------
232 *
233 */
234
9b8c81d1
SW
235static void find_metapath(const struct gfs2_sbd *sdp, u64 block,
236 struct metapath *mp, unsigned int height)
b3b94faa 237{
b3b94faa
DT
238 unsigned int i;
239
5f8bd444 240 mp->mp_fheight = height;
9b8c81d1 241 for (i = height; i--;)
7eabb77e 242 mp->mp_list[i] = do_div(block, sdp->sd_inptrs);
b3b94faa
DT
243}
244
5af4e7a0 245static inline unsigned int metapath_branch_start(const struct metapath *mp)
9b8c81d1 246{
5af4e7a0
BM
247 if (mp->mp_list[0] == 0)
248 return 2;
249 return 1;
9b8c81d1
SW
250}
251
d552a2b9 252/**
20cdc193 253 * metaptr1 - Return the first possible metadata pointer in a metapath buffer
d552a2b9
BP
254 * @height: The metadata height (0 = dinode)
255 * @mp: The metapath
256 */
257static inline __be64 *metaptr1(unsigned int height, const struct metapath *mp)
258{
259 struct buffer_head *bh = mp->mp_bh[height];
260 if (height == 0)
261 return ((__be64 *)(bh->b_data + sizeof(struct gfs2_dinode)));
262 return ((__be64 *)(bh->b_data + sizeof(struct gfs2_meta_header)));
263}
264
b3b94faa
DT
265/**
266 * metapointer - Return pointer to start of metadata in a buffer
b3b94faa
DT
267 * @height: The metadata height (0 = dinode)
268 * @mp: The metapath
269 *
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
272 * metadata tree.
273 */
274
9b8c81d1 275static inline __be64 *metapointer(unsigned int height, const struct metapath *mp)
b3b94faa 276{
d552a2b9
BP
277 __be64 *p = metaptr1(height, mp);
278 return p + mp->mp_list[height];
b3b94faa
DT
279}
280
7841b9f0
AG
281static inline const __be64 *metaend(unsigned int height, const struct metapath *mp)
282{
283 const struct buffer_head *bh = mp->mp_bh[height];
284 return (const __be64 *)(bh->b_data + bh->b_size);
285}
286
287static void clone_metapath(struct metapath *clone, struct metapath *mp)
288{
289 unsigned int hgt;
290
291 *clone = *mp;
292 for (hgt = 0; hgt < mp->mp_aheight; hgt++)
293 get_bh(clone->mp_bh[hgt]);
294}
295
5cf26b1e 296static void gfs2_metapath_ra(struct gfs2_glock *gl, __be64 *start, __be64 *end)
b99b98dc 297{
b99b98dc
SW
298 const __be64 *t;
299
5cf26b1e 300 for (t = start; t < end; t++) {
c3ce5aa9
AG
301 struct buffer_head *rabh;
302
b99b98dc
SW
303 if (!*t)
304 continue;
305
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;
1420c4a5
BVA
310 submit_bh(REQ_OP_READ | REQ_RAHEAD | REQ_META |
311 REQ_PRIO, rabh);
b99b98dc
SW
312 continue;
313 }
314 unlock_buffer(rabh);
315 }
316 brelse(rabh);
317 }
318}
319
e8b43fe0
AG
320static int __fillup_metapath(struct gfs2_inode *ip, struct metapath *mp,
321 unsigned int x, unsigned int h)
d552a2b9 322{
e8b43fe0
AG
323 for (; x < h; x++) {
324 __be64 *ptr = metapointer(x, mp);
325 u64 dblock = be64_to_cpu(*ptr);
326 int ret;
d552a2b9 327
e8b43fe0
AG
328 if (!dblock)
329 break;
6d8da302 330 ret = gfs2_meta_buffer(ip, GFS2_METATYPE_IN, dblock, &mp->mp_bh[x + 1]);
e8b43fe0
AG
331 if (ret)
332 return ret;
333 }
334 mp->mp_aheight = x + 1;
335 return 0;
d552a2b9
BP
336}
337
b3b94faa 338/**
9b8c81d1
SW
339 * lookup_metapath - Walk the metadata tree to a specific point
340 * @ip: The inode
b3b94faa 341 * @mp: The metapath
b3b94faa 342 *
9b8c81d1
SW
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().
346 *
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.
b3b94faa 351 *
e8b43fe0 352 * Returns: error
b3b94faa
DT
353 */
354
9b8c81d1 355static int lookup_metapath(struct gfs2_inode *ip, struct metapath *mp)
11707ea0 356{
e8b43fe0 357 return __fillup_metapath(ip, mp, 0, ip->i_height - 1);
dbac6710
SW
358}
359
d552a2b9
BP
360/**
361 * fillup_metapath - fill up buffers for the metadata path to a specific height
362 * @ip: The inode
363 * @mp: The metapath
364 * @h: The height to which it should be mapped
365 *
366 * Similar to lookup_metapath, but does lookups for a range of heights
367 *
c3ce5aa9 368 * Returns: error or the number of buffers filled
d552a2b9
BP
369 */
370
371static int fillup_metapath(struct gfs2_inode *ip, struct metapath *mp, int h)
372{
e8b43fe0 373 unsigned int x = 0;
c3ce5aa9 374 int ret;
d552a2b9
BP
375
376 if (h) {
377 /* find the first buffer we need to look up. */
e8b43fe0
AG
378 for (x = h - 1; x > 0; x--) {
379 if (mp->mp_bh[x])
380 break;
d552a2b9
BP
381 }
382 }
c3ce5aa9
AG
383 ret = __fillup_metapath(ip, mp, x, h);
384 if (ret)
385 return ret;
386 return mp->mp_aheight - x - 1;
d552a2b9
BP
387}
388
a27a0c9b
AG
389static sector_t metapath_to_block(struct gfs2_sbd *sdp, struct metapath *mp)
390{
391 sector_t factor = 1, block = 0;
392 int hgt;
393
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;
398 }
399 return block;
400}
401
64bc06bb 402static void release_metapath(struct metapath *mp)
dbac6710
SW
403{
404 int i;
405
9b8c81d1
SW
406 for (i = 0; i < GFS2_MAX_META_HEIGHT; i++) {
407 if (mp->mp_bh[i] == NULL)
408 break;
409 brelse(mp->mp_bh[i]);
64bc06bb 410 mp->mp_bh[i] = NULL;
9b8c81d1 411 }
11707ea0
SW
412}
413
30cbf189
SW
414/**
415 * gfs2_extent_length - Returns length of an extent of blocks
bcfe9413
AG
416 * @bh: The metadata block
417 * @ptr: Current position in @bh
418 * @limit: Max extent length to return
30cbf189
SW
419 * @eob: Set to 1 if we hit "end of block"
420 *
30cbf189
SW
421 * Returns: The length of the extent (minimum of one block)
422 */
423
bcfe9413 424static inline unsigned int gfs2_extent_length(struct buffer_head *bh, __be64 *ptr, size_t limit, int *eob)
30cbf189 425{
bcfe9413 426 const __be64 *end = (__be64 *)(bh->b_data + bh->b_size);
30cbf189
SW
427 const __be64 *first = ptr;
428 u64 d = be64_to_cpu(*ptr);
429
430 *eob = 0;
431 do {
432 ptr++;
433 if (ptr >= end)
434 break;
bcfe9413 435 d++;
30cbf189
SW
436 } while(be64_to_cpu(*ptr) == d);
437 if (ptr >= end)
438 *eob = 1;
bcfe9413 439 return ptr - first;
30cbf189
SW
440}
441
a27a0c9b
AG
442enum walker_status { WALK_STOP, WALK_FOLLOW, WALK_CONTINUE };
443
444/*
445 * gfs2_metadata_walker - walk an indirect block
446 * @mp: Metapath to indirect block
447 * @ptrs: Number of pointers to look at
448 *
449 * When returning WALK_FOLLOW, the walker must update @mp to point at the right
450 * indirect block to follow.
451 */
452typedef enum walker_status (*gfs2_metadata_walker)(struct metapath *mp,
453 unsigned int ptrs);
7841b9f0 454
a27a0c9b
AG
455/*
456 * gfs2_walk_metadata - walk a tree of indirect blocks
457 * @inode: The inode
458 * @mp: Starting point of walk
459 * @max_len: Maximum number of blocks to walk
460 * @walker: Called during the walk
461 *
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.
464 */
7841b9f0 465
a27a0c9b
AG
466static int gfs2_walk_metadata(struct inode *inode, struct metapath *mp,
467 u64 max_len, gfs2_metadata_walker walker)
7841b9f0 468{
7841b9f0
AG
469 struct gfs2_inode *ip = GFS2_I(inode);
470 struct gfs2_sbd *sdp = GFS2_SB(inode);
7841b9f0
AG
471 u64 factor = 1;
472 unsigned int hgt;
a27a0c9b 473 int ret;
7841b9f0 474
a27a0c9b
AG
475 /*
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.
479 */
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;
7841b9f0 483 factor *= sdp->sd_inptrs;
a27a0c9b 484 }
7841b9f0
AG
485
486 for (;;) {
a27a0c9b
AG
487 u16 start = mp->mp_list[hgt];
488 enum walker_status status;
489 unsigned int ptrs;
490 u64 len;
7841b9f0
AG
491
492 /* Walk indirect block. */
a27a0c9b
AG
493 ptrs = (hgt >= 1 ? sdp->sd_inptrs : sdp->sd_diptrs) - start;
494 len = ptrs * factor;
495 if (len > max_len)
496 ptrs = DIV_ROUND_UP_ULL(max_len, factor);
497 status = walker(mp, ptrs);
498 switch (status) {
499 case WALK_STOP:
500 return 1;
501 case WALK_FOLLOW:
502 BUG_ON(mp->mp_aheight == mp->mp_fheight);
503 ptrs = mp->mp_list[hgt] - start;
504 len = ptrs * factor;
7841b9f0 505 break;
a27a0c9b 506 case WALK_CONTINUE:
7841b9f0 507 break;
7841b9f0 508 }
a27a0c9b
AG
509 if (len >= max_len)
510 break;
511 max_len -= len;
512 if (status == WALK_FOLLOW)
513 goto fill_up_metapath;
7841b9f0
AG
514
515lower_metapath:
516 /* Decrease height of metapath. */
7841b9f0
AG
517 brelse(mp->mp_bh[hgt]);
518 mp->mp_bh[hgt] = NULL;
a27a0c9b 519 mp->mp_list[hgt] = 0;
7841b9f0
AG
520 if (!hgt)
521 break;
522 hgt--;
523 factor *= sdp->sd_inptrs;
524
525 /* Advance in metadata tree. */
526 (mp->mp_list[hgt])++;
566a2ab3
AG
527 if (hgt) {
528 if (mp->mp_list[hgt] >= sdp->sd_inptrs)
529 goto lower_metapath;
530 } else {
531 if (mp->mp_list[hgt] >= sdp->sd_diptrs)
7841b9f0 532 break;
7841b9f0
AG
533 }
534
535fill_up_metapath:
536 /* Increase height of metapath. */
7841b9f0
AG
537 ret = fillup_metapath(ip, mp, ip->i_height - 1);
538 if (ret < 0)
a27a0c9b 539 return ret;
7841b9f0
AG
540 hgt += ret;
541 for (; ret; ret--)
542 do_div(factor, sdp->sd_inptrs);
543 mp->mp_aheight = hgt + 1;
544 }
a27a0c9b 545 return 0;
7841b9f0
AG
546}
547
a27a0c9b
AG
548static enum walker_status gfs2_hole_walker(struct metapath *mp,
549 unsigned int ptrs)
7841b9f0 550{
a27a0c9b
AG
551 const __be64 *start, *ptr, *end;
552 unsigned int hgt;
553
554 hgt = mp->mp_aheight - 1;
555 start = metapointer(hgt, mp);
556 end = start + ptrs;
7841b9f0
AG
557
558 for (ptr = start; ptr < end; ptr++) {
559 if (*ptr) {
a27a0c9b 560 mp->mp_list[hgt] += ptr - start;
7841b9f0
AG
561 if (mp->mp_aheight == mp->mp_fheight)
562 return WALK_STOP;
a27a0c9b 563 return WALK_FOLLOW;
7841b9f0
AG
564 }
565 }
a27a0c9b 566 return WALK_CONTINUE;
7841b9f0
AG
567}
568
569/**
570 * gfs2_hole_size - figure out the size of a hole
571 * @inode: The inode
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
576 *
577 * This function modifies @mp.
578 *
579 * Returns: errno on error
580 */
581static int gfs2_hole_size(struct inode *inode, sector_t lblock, u64 len,
582 struct metapath *mp, struct iomap *iomap)
583{
a27a0c9b
AG
584 struct metapath clone;
585 u64 hole_size;
586 int ret;
587
588 clone_metapath(&clone, mp);
589 ret = gfs2_walk_metadata(inode, &clone, len, gfs2_hole_walker);
590 if (ret < 0)
591 goto out;
7841b9f0 592
a27a0c9b
AG
593 if (ret == 1)
594 hole_size = metapath_to_block(GFS2_SB(inode), &clone) - lblock;
595 else
596 hole_size = len;
597 iomap->length = hole_size << inode->i_blkbits;
598 ret = 0;
599
600out:
601 release_metapath(&clone);
7841b9f0
AG
602 return ret;
603}
604
b2963932
BP
605static inline void gfs2_indirect_init(struct metapath *mp,
606 struct gfs2_glock *gl, unsigned int i,
607 unsigned offset, u64 bn)
9b8c81d1
SW
608{
609 __be64 *ptr = (__be64 *)(mp->mp_bh[i - 1]->b_data +
610 ((i > 1) ? sizeof(struct gfs2_meta_header) :
611 sizeof(struct gfs2_dinode)));
612 BUG_ON(i < 1);
613 BUG_ON(mp->mp_bh[i] != NULL);
614 mp->mp_bh[i] = gfs2_meta_new(gl, bn);
350a9b0a 615 gfs2_trans_add_meta(gl, mp->mp_bh[i]);
9b8c81d1
SW
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));
618 ptr += offset;
619 *ptr = cpu_to_be64(bn);
9b8c81d1
SW
620}
621
622enum alloc_state {
623 ALLOC_DATA = 0,
624 ALLOC_GROW_DEPTH = 1,
625 ALLOC_GROW_HEIGHT = 2,
626 /* ALLOC_UNSTUFF = 3, TBD and rather complicated */
627};
628
629/**
54992257 630 * __gfs2_iomap_alloc - Build a metadata tree of the requested height
9b8c81d1 631 * @inode: The GFS2 inode
628e366d 632 * @iomap: The iomap structure
5f8bd444 633 * @mp: The metapath, with proper height information calculated
9b8c81d1
SW
634 *
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
638 * iii) Data blocks
639 *
54992257 640 * This function is called after __gfs2_iomap_get, which works out the
64bc06bb
AG
641 * total number of blocks which we need via gfs2_alloc_size.
642 *
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.
9b8c81d1 647 *
628e366d
AG
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.
654 *
9b8c81d1
SW
655 * Returns: errno on error
656 */
657
54992257
AG
658static int __gfs2_iomap_alloc(struct inode *inode, struct iomap *iomap,
659 struct metapath *mp)
9b8c81d1
SW
660{
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];
5f8bd444 664 u64 bn;
5af4e7a0 665 unsigned n, i, blks, alloced = 0, iblks = 0, branch_start = 0;
64bc06bb 666 size_t dblks = iomap->length >> inode->i_blkbits;
5f8bd444 667 const unsigned end_of_metadata = mp->mp_fheight - 1;
628e366d 668 int ret;
9b8c81d1
SW
669 enum alloc_state state;
670 __be64 *ptr;
671 __be64 zero_bn = 0;
672
5f8bd444 673 BUG_ON(mp->mp_aheight < 1);
9b8c81d1 674 BUG_ON(dibh == NULL);
64bc06bb 675 BUG_ON(dblks < 1);
9b8c81d1 676
350a9b0a 677 gfs2_trans_add_meta(ip->i_gl, dibh);
9b8c81d1 678
628e366d
AG
679 down_write(&ip->i_rw_mutex);
680
5f8bd444 681 if (mp->mp_fheight == mp->mp_aheight) {
64bc06bb 682 /* Bottom indirect block exists */
9b8c81d1
SW
683 state = ALLOC_DATA;
684 } else {
685 /* Need to allocate indirect blocks */
5f8bd444 686 if (mp->mp_fheight == ip->i_height) {
9b8c81d1 687 /* Writing into existing tree, extend tree down */
5f8bd444 688 iblks = mp->mp_fheight - mp->mp_aheight;
9b8c81d1
SW
689 state = ALLOC_GROW_DEPTH;
690 } else {
691 /* Building up tree height */
692 state = ALLOC_GROW_HEIGHT;
5f8bd444 693 iblks = mp->mp_fheight - ip->i_height;
5af4e7a0 694 branch_start = metapath_branch_start(mp);
5f8bd444 695 iblks += (mp->mp_fheight - branch_start);
9b8c81d1
SW
696 }
697 }
698
699 /* start of the second part of the function (state machine) */
700
3974320c 701 blks = dblks + iblks;
5f8bd444 702 i = mp->mp_aheight;
9b8c81d1
SW
703 do {
704 n = blks - alloced;
628e366d
AG
705 ret = gfs2_alloc_blocks(ip, &bn, &n, 0, NULL);
706 if (ret)
707 goto out;
9b8c81d1
SW
708 alloced += n;
709 if (state != ALLOC_DATA || gfs2_is_jdata(ip))
fbb27873 710 gfs2_trans_remove_revoke(sdp, bn, n);
9b8c81d1
SW
711 switch (state) {
712 /* Growing height of tree */
713 case ALLOC_GROW_HEIGHT:
714 if (i == 1) {
715 ptr = (__be64 *)(dibh->b_data +
716 sizeof(struct gfs2_dinode));
717 zero_bn = *ptr;
718 }
5f8bd444
BP
719 for (; i - 1 < mp->mp_fheight - ip->i_height && n > 0;
720 i++, n--)
9b8c81d1 721 gfs2_indirect_init(mp, ip->i_gl, i, 0, bn++);
5f8bd444 722 if (i - 1 == mp->mp_fheight - ip->i_height) {
9b8c81d1
SW
723 i--;
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) +
729 sizeof(__be64));
730 ptr = (__be64 *)(mp->mp_bh[i]->b_data +
731 sizeof(struct gfs2_meta_header));
732 *ptr = zero_bn;
733 state = ALLOC_GROW_DEPTH;
5f8bd444 734 for(i = branch_start; i < mp->mp_fheight; i++) {
9b8c81d1
SW
735 if (mp->mp_bh[i] == NULL)
736 break;
737 brelse(mp->mp_bh[i]);
738 mp->mp_bh[i] = NULL;
739 }
5af4e7a0 740 i = branch_start;
9b8c81d1
SW
741 }
742 if (n == 0)
743 break;
df561f66 744 fallthrough; /* To branching from existing tree */
9b8c81d1 745 case ALLOC_GROW_DEPTH:
5f8bd444 746 if (i > 1 && i < mp->mp_fheight)
350a9b0a 747 gfs2_trans_add_meta(ip->i_gl, mp->mp_bh[i-1]);
5f8bd444 748 for (; i < mp->mp_fheight && n > 0; i++, n--)
9b8c81d1
SW
749 gfs2_indirect_init(mp, ip->i_gl, i,
750 mp->mp_list[i-1], bn++);
5f8bd444 751 if (i == mp->mp_fheight)
9b8c81d1
SW
752 state = ALLOC_DATA;
753 if (n == 0)
754 break;
df561f66 755 fallthrough; /* To tree complete, adding data blocks */
9b8c81d1 756 case ALLOC_DATA:
3974320c 757 BUG_ON(n > dblks);
9b8c81d1 758 BUG_ON(mp->mp_bh[end_of_metadata] == NULL);
350a9b0a 759 gfs2_trans_add_meta(ip->i_gl, mp->mp_bh[end_of_metadata]);
3974320c 760 dblks = n;
9b8c81d1 761 ptr = metapointer(end_of_metadata, mp);
3974320c 762 iomap->addr = bn << inode->i_blkbits;
628e366d 763 iomap->flags |= IOMAP_F_MERGED | IOMAP_F_NEW;
9b8c81d1
SW
764 while (n-- > 0)
765 *ptr++ = cpu_to_be64(bn++);
766 break;
767 }
3974320c 768 } while (iomap->addr == IOMAP_NULL_ADDR);
9b8c81d1 769
d505a96a 770 iomap->type = IOMAP_MAPPED;
3974320c 771 iomap->length = (u64)dblks << inode->i_blkbits;
5f8bd444 772 ip->i_height = mp->mp_fheight;
9b8c81d1 773 gfs2_add_inode_blocks(&ip->i_inode, alloced);
628e366d
AG
774 gfs2_dinode_out(ip, dibh->b_data);
775out:
776 up_write(&ip->i_rw_mutex);
777 return ret;
9b8c81d1
SW
778}
779
7ee66c03
CH
780#define IOMAP_F_GFS2_BOUNDARY IOMAP_F_PRIVATE
781
64bc06bb
AG
782/**
783 * gfs2_alloc_size - Compute the maximum allocation size
784 * @inode: The inode
785 * @mp: The metapath
786 * @size: Requested size in blocks
787 *
788 * Compute the maximum size of the next allocation at @mp.
789 *
790 * Returns: size in blocks
791 */
792static u64 gfs2_alloc_size(struct inode *inode, struct metapath *mp, u64 size)
3974320c
BP
793{
794 struct gfs2_inode *ip = GFS2_I(inode);
64bc06bb
AG
795 struct gfs2_sbd *sdp = GFS2_SB(inode);
796 const __be64 *first, *ptr, *end;
797
798 /*
799 * For writes to stuffed files, this function is called twice via
54992257 800 * __gfs2_iomap_get, before and after unstuffing. The size we return the
64bc06bb
AG
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
54992257 803 * be exact or else __gfs2_iomap_alloc won't do the right thing.
64bc06bb
AG
804 */
805
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];
810 if (size > maxsize)
811 size = maxsize;
812 return size;
813 }
3974320c 814
64bc06bb
AG
815 first = metapointer(ip->i_height - 1, mp);
816 end = metaend(ip->i_height - 1, mp);
817 if (end - first > size)
818 end = first + size;
819 for (ptr = first; ptr < end; ptr++) {
820 if (*ptr)
821 break;
822 }
823 return ptr - first;
3974320c
BP
824}
825
826/**
54992257 827 * __gfs2_iomap_get - Map blocks from an inode to disk blocks
3974320c
BP
828 * @inode: The inode
829 * @pos: Starting position in bytes
830 * @length: Length to map, in bytes
831 * @flags: iomap flags
832 * @iomap: The iomap structure
628e366d 833 * @mp: The metapath
3974320c
BP
834 *
835 * Returns: errno
836 */
54992257
AG
837static int __gfs2_iomap_get(struct inode *inode, loff_t pos, loff_t length,
838 unsigned flags, struct iomap *iomap,
839 struct metapath *mp)
b3b94faa 840{
feaa7bba
SW
841 struct gfs2_inode *ip = GFS2_I(inode);
842 struct gfs2_sbd *sdp = GFS2_SB(inode);
d505a96a 843 loff_t size = i_size_read(inode);
9b8c81d1 844 __be64 *ptr;
3974320c 845 sector_t lblock;
628e366d
AG
846 sector_t lblock_stop;
847 int ret;
9b8c81d1 848 int eob;
628e366d 849 u64 len;
d505a96a 850 struct buffer_head *dibh = NULL, *bh;
9b8c81d1 851 u8 height;
7276b3b0 852
628e366d
AG
853 if (!length)
854 return -EINVAL;
b3b94faa 855
d505a96a
AG
856 down_read(&ip->i_rw_mutex);
857
858 ret = gfs2_meta_inode_buffer(ip, &dibh);
859 if (ret)
860 goto unlock;
c26b5aa8 861 mp->mp_bh[0] = dibh;
d505a96a 862
49edd5bf 863 if (gfs2_is_stuffed(ip)) {
d505a96a
AG
864 if (flags & IOMAP_WRITE) {
865 loff_t max_size = gfs2_max_stuffed_size(ip);
866
867 if (pos + length > max_size)
868 goto unstuff;
869 iomap->length = max_size;
870 } else {
871 if (pos >= size) {
872 if (flags & IOMAP_REPORT) {
873 ret = -ENOENT;
874 goto unlock;
875 } else {
d505a96a
AG
876 iomap->offset = pos;
877 iomap->length = length;
566a2ab3 878 goto hole_found;
d505a96a
AG
879 }
880 }
881 iomap->length = size;
49edd5bf 882 }
d505a96a
AG
883 iomap->addr = (ip->i_no_addr << inode->i_blkbits) +
884 sizeof(struct gfs2_dinode);
885 iomap->type = IOMAP_INLINE;
64bc06bb 886 iomap->inline_data = dibh->b_data + sizeof(struct gfs2_dinode);
d505a96a 887 goto out;
3974320c 888 }
d505a96a
AG
889
890unstuff:
3974320c 891 lblock = pos >> inode->i_blkbits;
3974320c 892 iomap->offset = lblock << inode->i_blkbits;
628e366d
AG
893 lblock_stop = (pos + length - 1) >> inode->i_blkbits;
894 len = lblock_stop - lblock + 1;
d505a96a 895 iomap->length = len << inode->i_blkbits;
628e366d 896
9b8c81d1 897 height = ip->i_height;
9a38662b 898 while ((lblock + 1) * sdp->sd_sb.sb_bsize > sdp->sd_heightsize[height])
9b8c81d1 899 height++;
628e366d 900 find_metapath(sdp, lblock, mp, height);
9b8c81d1
SW
901 if (height > ip->i_height || gfs2_is_stuffed(ip))
902 goto do_alloc;
3974320c 903
628e366d 904 ret = lookup_metapath(ip, mp);
e8b43fe0 905 if (ret)
628e366d 906 goto unlock;
3974320c 907
628e366d 908 if (mp->mp_aheight != ip->i_height)
9b8c81d1 909 goto do_alloc;
3974320c 910
628e366d 911 ptr = metapointer(ip->i_height - 1, mp);
9b8c81d1
SW
912 if (*ptr == 0)
913 goto do_alloc;
3974320c 914
628e366d 915 bh = mp->mp_bh[ip->i_height - 1];
bcfe9413 916 len = gfs2_extent_length(bh, ptr, len, &eob);
3974320c 917
628e366d
AG
918 iomap->addr = be64_to_cpu(*ptr) << inode->i_blkbits;
919 iomap->length = len << inode->i_blkbits;
920 iomap->type = IOMAP_MAPPED;
0ed91eca 921 iomap->flags |= IOMAP_F_MERGED;
9b8c81d1 922 if (eob)
7ee66c03 923 iomap->flags |= IOMAP_F_GFS2_BOUNDARY;
3974320c 924
3974320c 925out:
628e366d
AG
926 iomap->bdev = inode->i_sb->s_bdev;
927unlock:
928 up_read(&ip->i_rw_mutex);
9b8c81d1 929 return ret;
30cbf189 930
9b8c81d1 931do_alloc:
628e366d 932 if (flags & IOMAP_REPORT) {
49edd5bf 933 if (pos >= size)
3974320c 934 ret = -ENOENT;
628e366d
AG
935 else if (height == ip->i_height)
936 ret = gfs2_hole_size(inode, lblock, len, mp, iomap);
49edd5bf 937 else
f3506eee 938 iomap->length = size - iomap->offset;
64bc06bb
AG
939 } else if (flags & IOMAP_WRITE) {
940 u64 alloc_size;
941
967bcc91
AG
942 if (flags & IOMAP_DIRECT)
943 goto out; /* (see gfs2_file_direct_write) */
944
64bc06bb
AG
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;
949 } else {
d505a96a
AG
950 if (pos < size && height == ip->i_height)
951 ret = gfs2_hole_size(inode, lblock, len, mp, iomap);
b3b94faa 952 }
566a2ab3
AG
953hole_found:
954 iomap->addr = IOMAP_NULL_ADDR;
955 iomap->type = IOMAP_HOLE;
628e366d 956 goto out;
3974320c
BP
957}
958
d0a22a4b 959static int gfs2_iomap_page_prepare(struct inode *inode, loff_t pos,
1d25d0ae 960 unsigned len)
d0a22a4b 961{
2741b672 962 unsigned int blockmask = i_blocksize(inode) - 1;
d0a22a4b 963 struct gfs2_sbd *sdp = GFS2_SB(inode);
2741b672 964 unsigned int blocks;
d0a22a4b 965
2741b672
AG
966 blocks = ((pos & blockmask) + len + blockmask) >> inode->i_blkbits;
967 return gfs2_trans_begin(sdp, RES_DINODE + blocks, 0);
d0a22a4b
AG
968}
969
df0db3ec 970static void gfs2_iomap_page_done(struct inode *inode, loff_t pos,
1d25d0ae 971 unsigned copied, struct page *page)
64bc06bb 972{
706cb549 973 struct gfs2_trans *tr = current->journal_info;
64bc06bb 974 struct gfs2_inode *ip = GFS2_I(inode);
d0a22a4b 975 struct gfs2_sbd *sdp = GFS2_SB(inode);
64bc06bb 976
d0a22a4b 977 if (page && !gfs2_is_stuffed(ip))
df0db3ec 978 gfs2_page_add_databufs(ip, page, offset_in_page(pos), copied);
706cb549
AG
979
980 if (tr->tr_num_buf_new)
981 __mark_inode_dirty(inode, I_DIRTY_DATASYNC);
982
d0a22a4b 983 gfs2_trans_end(sdp);
64bc06bb
AG
984}
985
df0db3ec 986static const struct iomap_page_ops gfs2_iomap_page_ops = {
d0a22a4b 987 .page_prepare = gfs2_iomap_page_prepare,
df0db3ec
AG
988 .page_done = gfs2_iomap_page_done,
989};
990
64bc06bb
AG
991static int gfs2_iomap_begin_write(struct inode *inode, loff_t pos,
992 loff_t length, unsigned flags,
c26b5aa8
AG
993 struct iomap *iomap,
994 struct metapath *mp)
64bc06bb 995{
64bc06bb
AG
996 struct gfs2_inode *ip = GFS2_I(inode);
997 struct gfs2_sbd *sdp = GFS2_SB(inode);
34aad20b 998 bool unstuff;
64bc06bb
AG
999 int ret;
1000
64bc06bb
AG
1001 unstuff = gfs2_is_stuffed(ip) &&
1002 pos + length > gfs2_max_stuffed_size(ip);
1003
34aad20b
AG
1004 if (unstuff || iomap->type == IOMAP_HOLE) {
1005 unsigned int data_blocks, ind_blocks;
1006 struct gfs2_alloc_parms ap = {};
1007 unsigned int rblocks;
1008 struct gfs2_trans *tr;
64bc06bb 1009
64bc06bb
AG
1010 gfs2_write_calc_reserv(ip, iomap->length, &data_blocks,
1011 &ind_blocks);
34aad20b 1012 ap.target = data_blocks + ind_blocks;
64bc06bb
AG
1013 ret = gfs2_quota_lock_check(ip, &ap);
1014 if (ret)
34aad20b 1015 return ret;
64bc06bb
AG
1016
1017 ret = gfs2_inplace_reserve(ip, &ap);
1018 if (ret)
1019 goto out_qunlock;
64bc06bb 1020
34aad20b
AG
1021 rblocks = RES_DINODE + ind_blocks;
1022 if (gfs2_is_jdata(ip))
1023 rblocks += data_blocks;
1024 if (ind_blocks || data_blocks)
1025 rblocks += RES_STATFS + RES_QUOTA;
1026 if (inode == sdp->sd_rindex)
1027 rblocks += 2 * RES_STATFS;
64bc06bb
AG
1028 rblocks += gfs2_rg_blocks(ip, data_blocks + ind_blocks);
1029
d0a22a4b
AG
1030 ret = gfs2_trans_begin(sdp, rblocks,
1031 iomap->length >> inode->i_blkbits);
64bc06bb 1032 if (ret)
d0a22a4b
AG
1033 goto out_trans_fail;
1034
1035 if (unstuff) {
7a607a41 1036 ret = gfs2_unstuff_dinode(ip);
d0a22a4b
AG
1037 if (ret)
1038 goto out_trans_end;
1039 release_metapath(mp);
54992257
AG
1040 ret = __gfs2_iomap_get(inode, iomap->offset,
1041 iomap->length, flags, iomap, mp);
d0a22a4b
AG
1042 if (ret)
1043 goto out_trans_end;
1044 }
64bc06bb 1045
d0a22a4b 1046 if (iomap->type == IOMAP_HOLE) {
54992257 1047 ret = __gfs2_iomap_alloc(inode, iomap, mp);
d0a22a4b
AG
1048 if (ret) {
1049 gfs2_trans_end(sdp);
1050 gfs2_inplace_release(ip);
1051 punch_hole(ip, iomap->offset, iomap->length);
1052 goto out_qunlock;
1053 }
64bc06bb 1054 }
d0a22a4b
AG
1055
1056 tr = current->journal_info;
1057 if (tr->tr_num_buf_new)
1058 __mark_inode_dirty(inode, I_DIRTY_DATASYNC);
d0a22a4b
AG
1059
1060 gfs2_trans_end(sdp);
64bc06bb 1061 }
d0a22a4b
AG
1062
1063 if (gfs2_is_stuffed(ip) || gfs2_is_jdata(ip))
df0db3ec 1064 iomap->page_ops = &gfs2_iomap_page_ops;
64bc06bb
AG
1065 return 0;
1066
1067out_trans_end:
1068 gfs2_trans_end(sdp);
1069out_trans_fail:
34aad20b 1070 gfs2_inplace_release(ip);
64bc06bb 1071out_qunlock:
34aad20b 1072 gfs2_quota_unlock(ip);
64bc06bb
AG
1073 return ret;
1074}
1075
628e366d 1076static int gfs2_iomap_begin(struct inode *inode, loff_t pos, loff_t length,
c039b997
GR
1077 unsigned flags, struct iomap *iomap,
1078 struct iomap *srcmap)
628e366d
AG
1079{
1080 struct gfs2_inode *ip = GFS2_I(inode);
1081 struct metapath mp = { .mp_aheight = 1, };
1082 int ret;
1083
2164f9b9
CH
1084 if (gfs2_is_jdata(ip))
1085 iomap->flags |= IOMAP_F_BUFFER_HEAD;
0ed91eca 1086
628e366d 1087 trace_gfs2_iomap_start(ip, pos, length, flags);
54992257 1088 ret = __gfs2_iomap_get(inode, pos, length, flags, iomap, &mp);
34aad20b
AG
1089 if (ret)
1090 goto out_unlock;
1091
72d36d05 1092 switch(flags & (IOMAP_WRITE | IOMAP_ZERO)) {
34aad20b
AG
1093 case IOMAP_WRITE:
1094 if (flags & IOMAP_DIRECT) {
1095 /*
1096 * Silently fall back to buffered I/O for stuffed files
1097 * or if we've got a hole (see gfs2_file_direct_write).
1098 */
1099 if (iomap->type != IOMAP_MAPPED)
1100 ret = -ENOTBLK;
1101 goto out_unlock;
1102 }
1103 break;
72d36d05
AG
1104 case IOMAP_ZERO:
1105 if (iomap->type == IOMAP_HOLE)
1106 goto out_unlock;
1107 break;
34aad20b
AG
1108 default:
1109 goto out_unlock;
1110 }
1111
1112 ret = gfs2_iomap_begin_write(inode, pos, length, flags, iomap, &mp);
1113
1114out_unlock:
c26b5aa8 1115 release_metapath(&mp);
628e366d
AG
1116 trace_gfs2_iomap_end(ip, iomap, ret);
1117 return ret;
1118}
1119
64bc06bb
AG
1120static int gfs2_iomap_end(struct inode *inode, loff_t pos, loff_t length,
1121 ssize_t written, unsigned flags, struct iomap *iomap)
1122{
1123 struct gfs2_inode *ip = GFS2_I(inode);
1124 struct gfs2_sbd *sdp = GFS2_SB(inode);
64bc06bb 1125
72d36d05 1126 switch (flags & (IOMAP_WRITE | IOMAP_ZERO)) {
34aad20b
AG
1127 case IOMAP_WRITE:
1128 if (flags & IOMAP_DIRECT)
1129 return 0;
1130 break;
72d36d05
AG
1131 case IOMAP_ZERO:
1132 if (iomap->type == IOMAP_HOLE)
1133 return 0;
1134 break;
34aad20b
AG
1135 default:
1136 return 0;
1137 }
64bc06bb 1138
d0a22a4b 1139 if (!gfs2_is_stuffed(ip))
64bc06bb
AG
1140 gfs2_ordered_add_inode(ip);
1141
d0a22a4b 1142 if (inode == sdp->sd_rindex)
64bc06bb 1143 adjust_fs_space(inode);
64bc06bb 1144
64bc06bb
AG
1145 gfs2_inplace_release(ip);
1146
7009fa9c
AG
1147 if (ip->i_qadata && ip->i_qadata->qa_qd_num)
1148 gfs2_quota_unlock(ip);
1149
64bc06bb
AG
1150 if (length != written && (iomap->flags & IOMAP_F_NEW)) {
1151 /* Deallocate blocks that were just allocated. */
d031a886
AG
1152 loff_t hstart = round_up(pos + written, i_blocksize(inode));
1153 loff_t hend = iomap->offset + iomap->length;
64bc06bb 1154
d031a886
AG
1155 if (hstart < hend) {
1156 truncate_pagecache_range(inode, hstart, hend - 1);
1157 punch_hole(ip, hstart, hend - hstart);
64bc06bb
AG
1158 }
1159 }
1160
706cb549 1161 if (unlikely(!written))
b924bdab 1162 return 0;
706cb549 1163
8d3e72a1
AG
1164 if (iomap->flags & IOMAP_F_SIZE_CHANGED)
1165 mark_inode_dirty(inode);
706cb549 1166 set_bit(GLF_DIRTY, &ip->i_gl->gl_flags);
64bc06bb
AG
1167 return 0;
1168}
1169
628e366d
AG
1170const struct iomap_ops gfs2_iomap_ops = {
1171 .iomap_begin = gfs2_iomap_begin,
64bc06bb 1172 .iomap_end = gfs2_iomap_end,
628e366d
AG
1173};
1174
3974320c 1175/**
d39d18e0 1176 * gfs2_block_map - Map one or more blocks of an inode to a disk block
3974320c
BP
1177 * @inode: The inode
1178 * @lblock: The logical block number
1179 * @bh_map: The bh to be mapped
1180 * @create: True if its ok to alloc blocks to satify the request
1181 *
d39d18e0
AG
1182 * The size of the requested mapping is defined in bh_map->b_size.
1183 *
1184 * Clears buffer_mapped(bh_map) and leaves bh_map->b_size unchanged
1185 * when @lblock is not mapped. Sets buffer_mapped(bh_map) and
1186 * bh_map->b_size to indicate the size of the mapping when @lblock and
1187 * successive blocks are mapped, up to the requested size.
1188 *
1189 * Sets buffer_boundary() if a read of metadata will be required
1190 * before the next block can be mapped. Sets buffer_new() if new
1191 * blocks were allocated.
3974320c
BP
1192 *
1193 * Returns: errno
1194 */
1195
1196int gfs2_block_map(struct inode *inode, sector_t lblock,
1197 struct buffer_head *bh_map, int create)
1198{
1199 struct gfs2_inode *ip = GFS2_I(inode);
628e366d
AG
1200 loff_t pos = (loff_t)lblock << inode->i_blkbits;
1201 loff_t length = bh_map->b_size;
628e366d
AG
1202 struct iomap iomap = { };
1203 int ret;
3974320c
BP
1204
1205 clear_buffer_mapped(bh_map);
1206 clear_buffer_new(bh_map);
1207 clear_buffer_boundary(bh_map);
1208 trace_gfs2_bmap(ip, bh_map, lblock, create, 1);
1209
54992257
AG
1210 if (!create)
1211 ret = gfs2_iomap_get(inode, pos, length, &iomap);
1212 else
1213 ret = gfs2_iomap_alloc(inode, pos, length, &iomap);
628e366d
AG
1214 if (ret)
1215 goto out;
3974320c
BP
1216
1217 if (iomap.length > bh_map->b_size) {
1218 iomap.length = bh_map->b_size;
7ee66c03 1219 iomap.flags &= ~IOMAP_F_GFS2_BOUNDARY;
5f8bd444 1220 }
3974320c
BP
1221 if (iomap.addr != IOMAP_NULL_ADDR)
1222 map_bh(bh_map, inode->i_sb, iomap.addr >> inode->i_blkbits);
1223 bh_map->b_size = iomap.length;
7ee66c03 1224 if (iomap.flags & IOMAP_F_GFS2_BOUNDARY)
3974320c
BP
1225 set_buffer_boundary(bh_map);
1226 if (iomap.flags & IOMAP_F_NEW)
1227 set_buffer_new(bh_map);
1228
1229out:
1230 trace_gfs2_bmap(ip, bh_map, lblock, create, ret);
1231 return ret;
fd88de56
SW
1232}
1233
9153dac1
AG
1234int gfs2_get_extent(struct inode *inode, u64 lblock, u64 *dblock,
1235 unsigned int *extlen)
fd88de56 1236{
9153dac1
AG
1237 unsigned int blkbits = inode->i_blkbits;
1238 struct iomap iomap = { };
1239 unsigned int len;
7a6bbacb 1240 int ret;
9153dac1
AG
1241
1242 ret = gfs2_iomap_get(inode, lblock << blkbits, *extlen << blkbits,
1243 &iomap);
1244 if (ret)
1245 return ret;
1246 if (iomap.type != IOMAP_MAPPED)
1247 return -EIO;
1248 *dblock = iomap.addr >> blkbits;
1249 len = iomap.length >> blkbits;
1250 if (len < *extlen)
1251 *extlen = len;
1252 return 0;
1253}
1254
1255int gfs2_alloc_extent(struct inode *inode, u64 lblock, u64 *dblock,
1256 unsigned int *extlen, bool *new)
1257{
1258 unsigned int blkbits = inode->i_blkbits;
1259 struct iomap iomap = { };
1260 unsigned int len;
1261 int ret;
1262
1263 ret = gfs2_iomap_alloc(inode, lblock << blkbits, *extlen << blkbits,
1264 &iomap);
1265 if (ret)
1266 return ret;
1267 if (iomap.type != IOMAP_MAPPED)
1268 return -EIO;
1269 *dblock = iomap.addr >> blkbits;
1270 len = iomap.length >> blkbits;
1271 if (len < *extlen)
1272 *extlen = len;
1273 *new = iomap.flags & IOMAP_F_NEW;
1274 return 0;
b3b94faa
DT
1275}
1276
70499cdf
BP
1277/*
1278 * NOTE: Never call gfs2_block_zero_range with an open transaction because it
1279 * uses iomap write to perform its actions, which begin their own transactions
1280 * (iomap_begin, page_prepare, etc.)
1281 */
bdba0d5e
AG
1282static int gfs2_block_zero_range(struct inode *inode, loff_t from,
1283 unsigned int length)
ba7f7290 1284{
70499cdf 1285 BUG_ON(current->journal_info);
2257e468 1286 return iomap_zero_range(inode, from, length, NULL, &gfs2_iomap_ops);
ba7f7290
SW
1287}
1288
c62baf65
FF
1289#define GFS2_JTRUNC_REVOKES 8192
1290
fa731fc4
SW
1291/**
1292 * gfs2_journaled_truncate - Wrapper for truncate_pagecache for jdata files
1293 * @inode: The inode being truncated
1294 * @oldsize: The original (larger) size
1295 * @newsize: The new smaller size
1296 *
1297 * With jdata files, we have to journal a revoke for each block which is
1298 * truncated. As a result, we need to split this into separate transactions
1299 * if the number of pages being truncated gets too large.
1300 */
1301
fa731fc4
SW
1302static int gfs2_journaled_truncate(struct inode *inode, u64 oldsize, u64 newsize)
1303{
1304 struct gfs2_sbd *sdp = GFS2_SB(inode);
1305 u64 max_chunk = GFS2_JTRUNC_REVOKES * sdp->sd_vfs->s_blocksize;
1306 u64 chunk;
1307 int error;
1308
1309 while (oldsize != newsize) {
e7fdf004
AG
1310 struct gfs2_trans *tr;
1311 unsigned int offs;
1312
fa731fc4
SW
1313 chunk = oldsize - newsize;
1314 if (chunk > max_chunk)
1315 chunk = max_chunk;
e7fdf004
AG
1316
1317 offs = oldsize & ~PAGE_MASK;
1318 if (offs && chunk > PAGE_SIZE)
1319 chunk = offs + ((chunk - offs) & PAGE_MASK);
1320
7caef267 1321 truncate_pagecache(inode, oldsize - chunk);
fa731fc4 1322 oldsize -= chunk;
e7fdf004
AG
1323
1324 tr = current->journal_info;
1325 if (!test_bit(TR_TOUCHED, &tr->tr_flags))
1326 continue;
1327
fa731fc4
SW
1328 gfs2_trans_end(sdp);
1329 error = gfs2_trans_begin(sdp, RES_DINODE, GFS2_JTRUNC_REVOKES);
1330 if (error)
1331 return error;
1332 }
1333
1334 return 0;
1335}
1336
8b5860a3 1337static int trunc_start(struct inode *inode, u64 newsize)
b3b94faa 1338{
ff8f33c8
SW
1339 struct gfs2_inode *ip = GFS2_I(inode);
1340 struct gfs2_sbd *sdp = GFS2_SB(inode);
80990f40 1341 struct buffer_head *dibh = NULL;
b3b94faa 1342 int journaled = gfs2_is_jdata(ip);
8b5860a3 1343 u64 oldsize = inode->i_size;
b3b94faa
DT
1344 int error;
1345
70499cdf
BP
1346 if (!gfs2_is_stuffed(ip)) {
1347 unsigned int blocksize = i_blocksize(inode);
1348 unsigned int offs = newsize & (blocksize - 1);
1349 if (offs) {
1350 error = gfs2_block_zero_range(inode, newsize,
1351 blocksize - offs);
1352 if (error)
1353 return error;
1354 }
1355 }
fa731fc4
SW
1356 if (journaled)
1357 error = gfs2_trans_begin(sdp, RES_DINODE + RES_JDATA, GFS2_JTRUNC_REVOKES);
1358 else
1359 error = gfs2_trans_begin(sdp, RES_DINODE, 0);
b3b94faa
DT
1360 if (error)
1361 return error;
1362
1363 error = gfs2_meta_inode_buffer(ip, &dibh);
1364 if (error)
1365 goto out;
1366
350a9b0a 1367 gfs2_trans_add_meta(ip->i_gl, dibh);
ff8f33c8 1368
70499cdf 1369 if (gfs2_is_stuffed(ip))
ff8f33c8 1370 gfs2_buffer_clear_tail(dibh, sizeof(struct gfs2_dinode) + newsize);
70499cdf 1371 else
ff8f33c8 1372 ip->i_diskflags |= GFS2_DIF_TRUNC_IN_PROG;
b3b94faa 1373
ff8f33c8 1374 i_size_write(inode, newsize);
078cd827 1375 ip->i_inode.i_mtime = ip->i_inode.i_ctime = current_time(&ip->i_inode);
ff8f33c8 1376 gfs2_dinode_out(ip, dibh->b_data);
b3b94faa 1377
fa731fc4
SW
1378 if (journaled)
1379 error = gfs2_journaled_truncate(inode, oldsize, newsize);
1380 else
7caef267 1381 truncate_pagecache(inode, newsize);
fa731fc4 1382
a91ea69f 1383out:
80990f40
AG
1384 brelse(dibh);
1385 if (current->journal_info)
1386 gfs2_trans_end(sdp);
b3b94faa
DT
1387 return error;
1388}
1389
54992257
AG
1390int gfs2_iomap_get(struct inode *inode, loff_t pos, loff_t length,
1391 struct iomap *iomap)
1392{
1393 struct metapath mp = { .mp_aheight = 1, };
1394 int ret;
1395
1396 ret = __gfs2_iomap_get(inode, pos, length, 0, iomap, &mp);
1397 release_metapath(&mp);
1398 return ret;
1399}
1400
1401int gfs2_iomap_alloc(struct inode *inode, loff_t pos, loff_t length,
1402 struct iomap *iomap)
628e366d
AG
1403{
1404 struct metapath mp = { .mp_aheight = 1, };
1405 int ret;
1406
54992257 1407 ret = __gfs2_iomap_get(inode, pos, length, IOMAP_WRITE, iomap, &mp);
628e366d 1408 if (!ret && iomap->type == IOMAP_HOLE)
54992257 1409 ret = __gfs2_iomap_alloc(inode, iomap, &mp);
628e366d
AG
1410 release_metapath(&mp);
1411 return ret;
1412}
1413
d552a2b9
BP
1414/**
1415 * sweep_bh_for_rgrps - find an rgrp in a meta buffer and free blocks therein
1416 * @ip: inode
c551f66c 1417 * @rd_gh: holder of resource group glock
5cf26b1e
AG
1418 * @bh: buffer head to sweep
1419 * @start: starting point in bh
1420 * @end: end point in bh
1421 * @meta: true if bh points to metadata (rather than data)
d552a2b9 1422 * @btotal: place to keep count of total blocks freed
d552a2b9
BP
1423 *
1424 * We sweep a metadata buffer (provided by the metapath) for blocks we need to
1425 * free, and free them all. However, we do it one rgrp at a time. If this
1426 * block has references to multiple rgrps, we break it into individual
1427 * transactions. This allows other processes to use the rgrps while we're
1428 * focused on a single one, for better concurrency / performance.
1429 * At every transaction boundary, we rewrite the inode into the journal.
1430 * That way the bitmaps are kept consistent with the inode and we can recover
1431 * if we're interrupted by power-outages.
1432 *
1433 * Returns: 0, or return code if an error occurred.
1434 * *btotal has the total number of blocks freed
1435 */
1436static int sweep_bh_for_rgrps(struct gfs2_inode *ip, struct gfs2_holder *rd_gh,
5cf26b1e
AG
1437 struct buffer_head *bh, __be64 *start, __be64 *end,
1438 bool meta, u32 *btotal)
b3b94faa 1439{
9b8c81d1 1440 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
d552a2b9
BP
1441 struct gfs2_rgrpd *rgd;
1442 struct gfs2_trans *tr;
5cf26b1e 1443 __be64 *p;
d552a2b9
BP
1444 int blks_outside_rgrp;
1445 u64 bn, bstart, isize_blks;
1446 s64 blen; /* needs to be s64 or gfs2_add_inode_blocks breaks */
d552a2b9
BP
1447 int ret = 0;
1448 bool buf_in_tr = false; /* buffer was added to transaction */
1449
d552a2b9 1450more_rgrps:
5cf26b1e
AG
1451 rgd = NULL;
1452 if (gfs2_holder_initialized(rd_gh)) {
1453 rgd = gfs2_glock2rgrp(rd_gh->gh_gl);
1454 gfs2_assert_withdraw(sdp,
1455 gfs2_glock_is_locked_by_me(rd_gh->gh_gl));
1456 }
d552a2b9
BP
1457 blks_outside_rgrp = 0;
1458 bstart = 0;
1459 blen = 0;
d552a2b9 1460
5cf26b1e 1461 for (p = start; p < end; p++) {
d552a2b9
BP
1462 if (!*p)
1463 continue;
1464 bn = be64_to_cpu(*p);
5cf26b1e
AG
1465
1466 if (rgd) {
1467 if (!rgrp_contains_block(rgd, bn)) {
1468 blks_outside_rgrp++;
1469 continue;
1470 }
d552a2b9 1471 } else {
90bcab99 1472 rgd = gfs2_blk2rgrpd(sdp, bn, true);
5cf26b1e
AG
1473 if (unlikely(!rgd)) {
1474 ret = -EIO;
1475 goto out;
1476 }
d552a2b9 1477 ret = gfs2_glock_nq_init(rgd->rd_gl, LM_ST_EXCLUSIVE,
4fc7ec31 1478 LM_FLAG_NODE_SCOPE, rd_gh);
d552a2b9
BP
1479 if (ret)
1480 goto out;
1481
1482 /* Must be done with the rgrp glock held: */
1483 if (gfs2_rs_active(&ip->i_res) &&
c65b76b8 1484 rgd == ip->i_res.rs_rgd)
d552a2b9
BP
1485 gfs2_rs_deltree(&ip->i_res);
1486 }
1487
d552a2b9
BP
1488 /* The size of our transactions will be unknown until we
1489 actually process all the metadata blocks that relate to
1490 the rgrp. So we estimate. We know it can't be more than
1491 the dinode's i_blocks and we don't want to exceed the
1492 journal flush threshold, sd_log_thresh2. */
1493 if (current->journal_info == NULL) {
1494 unsigned int jblocks_rqsted, revokes;
1495
1496 jblocks_rqsted = rgd->rd_length + RES_DINODE +
1497 RES_INDIRECT;
1498 isize_blks = gfs2_get_inode_blocks(&ip->i_inode);
1499 if (isize_blks > atomic_read(&sdp->sd_log_thresh2))
1500 jblocks_rqsted +=
1501 atomic_read(&sdp->sd_log_thresh2);
1502 else
1503 jblocks_rqsted += isize_blks;
1504 revokes = jblocks_rqsted;
1505 if (meta)
5cf26b1e 1506 revokes += end - start;
d552a2b9
BP
1507 else if (ip->i_depth)
1508 revokes += sdp->sd_inptrs;
1509 ret = gfs2_trans_begin(sdp, jblocks_rqsted, revokes);
1510 if (ret)
1511 goto out_unlock;
1512 down_write(&ip->i_rw_mutex);
1513 }
1514 /* check if we will exceed the transaction blocks requested */
1515 tr = current->journal_info;
1516 if (tr->tr_num_buf_new + RES_STATFS +
1517 RES_QUOTA >= atomic_read(&sdp->sd_log_thresh2)) {
1518 /* We set blks_outside_rgrp to ensure the loop will
1519 be repeated for the same rgrp, but with a new
1520 transaction. */
1521 blks_outside_rgrp++;
1522 /* This next part is tricky. If the buffer was added
1523 to the transaction, we've already set some block
1524 pointers to 0, so we better follow through and free
1525 them, or we will introduce corruption (so break).
1526 This may be impossible, or at least rare, but I
1527 decided to cover the case regardless.
1528
1529 If the buffer was not added to the transaction
1530 (this call), doing so would exceed our transaction
1531 size, so we need to end the transaction and start a
1532 new one (so goto). */
1533
1534 if (buf_in_tr)
1535 break;
1536 goto out_unlock;
1537 }
1538
1539 gfs2_trans_add_meta(ip->i_gl, bh);
1540 buf_in_tr = true;
1541 *p = 0;
1542 if (bstart + blen == bn) {
1543 blen++;
1544 continue;
1545 }
1546 if (bstart) {
0ddeded4 1547 __gfs2_free_blocks(ip, rgd, bstart, (u32)blen, meta);
d552a2b9
BP
1548 (*btotal) += blen;
1549 gfs2_add_inode_blocks(&ip->i_inode, -blen);
1550 }
1551 bstart = bn;
1552 blen = 1;
1553 }
1554 if (bstart) {
0ddeded4 1555 __gfs2_free_blocks(ip, rgd, bstart, (u32)blen, meta);
d552a2b9
BP
1556 (*btotal) += blen;
1557 gfs2_add_inode_blocks(&ip->i_inode, -blen);
1558 }
1559out_unlock:
1560 if (!ret && blks_outside_rgrp) { /* If buffer still has non-zero blocks
1561 outside the rgrp we just processed,
1562 do it all over again. */
1563 if (current->journal_info) {
5cf26b1e
AG
1564 struct buffer_head *dibh;
1565
1566 ret = gfs2_meta_inode_buffer(ip, &dibh);
1567 if (ret)
1568 goto out;
d552a2b9
BP
1569
1570 /* Every transaction boundary, we rewrite the dinode
1571 to keep its di_blocks current in case of failure. */
1572 ip->i_inode.i_mtime = ip->i_inode.i_ctime =
b32c8c76 1573 current_time(&ip->i_inode);
d552a2b9
BP
1574 gfs2_trans_add_meta(ip->i_gl, dibh);
1575 gfs2_dinode_out(ip, dibh->b_data);
5cf26b1e 1576 brelse(dibh);
d552a2b9
BP
1577 up_write(&ip->i_rw_mutex);
1578 gfs2_trans_end(sdp);
f0b444b3 1579 buf_in_tr = false;
d552a2b9
BP
1580 }
1581 gfs2_glock_dq_uninit(rd_gh);
1582 cond_resched();
1583 goto more_rgrps;
1584 }
1585out:
1586 return ret;
1587}
1588
10d2cf94
AG
1589static bool mp_eq_to_hgt(struct metapath *mp, __u16 *list, unsigned int h)
1590{
1591 if (memcmp(mp->mp_list, list, h * sizeof(mp->mp_list[0])))
1592 return false;
1593 return true;
1594}
1595
d552a2b9
BP
1596/**
1597 * find_nonnull_ptr - find a non-null pointer given a metapath and height
c551f66c 1598 * @sdp: The superblock
d552a2b9
BP
1599 * @mp: starting metapath
1600 * @h: desired height to search
c551f66c
LJ
1601 * @end_list: See punch_hole().
1602 * @end_aligned: See punch_hole().
d552a2b9 1603 *
10d2cf94 1604 * Assumes the metapath is valid (with buffers) out to height h.
d552a2b9
BP
1605 * Returns: true if a non-null pointer was found in the metapath buffer
1606 * false if all remaining pointers are NULL in the buffer
1607 */
1608static bool find_nonnull_ptr(struct gfs2_sbd *sdp, struct metapath *mp,
10d2cf94
AG
1609 unsigned int h,
1610 __u16 *end_list, unsigned int end_aligned)
d552a2b9 1611{
10d2cf94
AG
1612 struct buffer_head *bh = mp->mp_bh[h];
1613 __be64 *first, *ptr, *end;
1614
1615 first = metaptr1(h, mp);
1616 ptr = first + mp->mp_list[h];
1617 end = (__be64 *)(bh->b_data + bh->b_size);
1618 if (end_list && mp_eq_to_hgt(mp, end_list, h)) {
1619 bool keep_end = h < end_aligned;
1620 end = first + end_list[h] + keep_end;
1621 }
d552a2b9 1622
10d2cf94 1623 while (ptr < end) {
c4a9d189 1624 if (*ptr) { /* if we have a non-null pointer */
10d2cf94 1625 mp->mp_list[h] = ptr - first;
c4a9d189
BP
1626 h++;
1627 if (h < GFS2_MAX_META_HEIGHT)
10d2cf94 1628 mp->mp_list[h] = 0;
d552a2b9 1629 return true;
c4a9d189 1630 }
10d2cf94 1631 ptr++;
d552a2b9 1632 }
10d2cf94 1633 return false;
d552a2b9
BP
1634}
1635
1636enum dealloc_states {
1637 DEALLOC_MP_FULL = 0, /* Strip a metapath with all buffers read in */
1638 DEALLOC_MP_LOWER = 1, /* lower the metapath strip height */
1639 DEALLOC_FILL_MP = 2, /* Fill in the metapath to the given height. */
1640 DEALLOC_DONE = 3, /* process complete */
1641};
b3b94faa 1642
5cf26b1e
AG
1643static inline void
1644metapointer_range(struct metapath *mp, int height,
1645 __u16 *start_list, unsigned int start_aligned,
10d2cf94 1646 __u16 *end_list, unsigned int end_aligned,
5cf26b1e
AG
1647 __be64 **start, __be64 **end)
1648{
1649 struct buffer_head *bh = mp->mp_bh[height];
1650 __be64 *first;
1651
1652 first = metaptr1(height, mp);
1653 *start = first;
1654 if (mp_eq_to_hgt(mp, start_list, height)) {
1655 bool keep_start = height < start_aligned;
1656 *start = first + start_list[height] + keep_start;
1657 }
1658 *end = (__be64 *)(bh->b_data + bh->b_size);
10d2cf94
AG
1659 if (end_list && mp_eq_to_hgt(mp, end_list, height)) {
1660 bool keep_end = height < end_aligned;
1661 *end = first + end_list[height] + keep_end;
1662 }
1663}
1664
1665static inline bool walk_done(struct gfs2_sbd *sdp,
1666 struct metapath *mp, int height,
1667 __u16 *end_list, unsigned int end_aligned)
1668{
1669 __u16 end;
1670
1671 if (end_list) {
1672 bool keep_end = height < end_aligned;
1673 if (!mp_eq_to_hgt(mp, end_list, height))
1674 return false;
1675 end = end_list[height] + keep_end;
1676 } else
1677 end = (height > 0) ? sdp->sd_inptrs : sdp->sd_diptrs;
1678 return mp->mp_list[height] >= end;
5cf26b1e
AG
1679}
1680
d552a2b9 1681/**
10d2cf94 1682 * punch_hole - deallocate blocks in a file
d552a2b9 1683 * @ip: inode to truncate
10d2cf94
AG
1684 * @offset: the start of the hole
1685 * @length: the size of the hole (or 0 for truncate)
1686 *
1687 * Punch a hole into a file or truncate a file at a given position. This
1688 * function operates in whole blocks (@offset and @length are rounded
1689 * accordingly); partially filled blocks must be cleared otherwise.
d552a2b9 1690 *
10d2cf94
AG
1691 * This function works from the bottom up, and from the right to the left. In
1692 * other words, it strips off the highest layer (data) before stripping any of
1693 * the metadata. Doing it this way is best in case the operation is interrupted
1694 * by power failure, etc. The dinode is rewritten in every transaction to
1695 * guarantee integrity.
d552a2b9 1696 */
10d2cf94 1697static int punch_hole(struct gfs2_inode *ip, u64 offset, u64 length)
d552a2b9
BP
1698{
1699 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
bb491ce6 1700 u64 maxsize = sdp->sd_heightsize[ip->i_height];
10d2cf94 1701 struct metapath mp = {};
d552a2b9
BP
1702 struct buffer_head *dibh, *bh;
1703 struct gfs2_holder rd_gh;
cb7f0903 1704 unsigned int bsize_shift = sdp->sd_sb.sb_bsize_shift;
10d2cf94
AG
1705 u64 lblock = (offset + (1 << bsize_shift) - 1) >> bsize_shift;
1706 __u16 start_list[GFS2_MAX_META_HEIGHT];
1707 __u16 __end_list[GFS2_MAX_META_HEIGHT], *end_list = NULL;
3f649ab7 1708 unsigned int start_aligned, end_aligned;
d552a2b9
BP
1709 unsigned int strip_h = ip->i_height - 1;
1710 u32 btotal = 0;
1711 int ret, state;
1712 int mp_h; /* metapath buffers are read in to this height */
d552a2b9 1713 u64 prev_bnr = 0;
5cf26b1e 1714 __be64 *start, *end;
b3b94faa 1715
bb491ce6
AG
1716 if (offset >= maxsize) {
1717 /*
1718 * The starting point lies beyond the allocated meta-data;
1719 * there are no blocks do deallocate.
1720 */
1721 return 0;
1722 }
1723
10d2cf94
AG
1724 /*
1725 * The start position of the hole is defined by lblock, start_list, and
1726 * start_aligned. The end position of the hole is defined by lend,
1727 * end_list, and end_aligned.
1728 *
1729 * start_aligned and end_aligned define down to which height the start
1730 * and end positions are aligned to the metadata tree (i.e., the
1731 * position is a multiple of the metadata granularity at the height
1732 * above). This determines at which heights additional meta pointers
1733 * needs to be preserved for the remaining data.
1734 */
b3b94faa 1735
10d2cf94 1736 if (length) {
10d2cf94
AG
1737 u64 end_offset = offset + length;
1738 u64 lend;
1739
1740 /*
1741 * Clip the end at the maximum file size for the given height:
1742 * that's how far the metadata goes; files bigger than that
1743 * will have additional layers of indirection.
1744 */
1745 if (end_offset > maxsize)
1746 end_offset = maxsize;
1747 lend = end_offset >> bsize_shift;
1748
1749 if (lblock >= lend)
1750 return 0;
1751
1752 find_metapath(sdp, lend, &mp, ip->i_height);
1753 end_list = __end_list;
1754 memcpy(end_list, mp.mp_list, sizeof(mp.mp_list));
1755
1756 for (mp_h = ip->i_height - 1; mp_h > 0; mp_h--) {
1757 if (end_list[mp_h])
1758 break;
1759 }
1760 end_aligned = mp_h;
1761 }
1762
1763 find_metapath(sdp, lblock, &mp, ip->i_height);
cb7f0903
AG
1764 memcpy(start_list, mp.mp_list, sizeof(start_list));
1765
cb7f0903
AG
1766 for (mp_h = ip->i_height - 1; mp_h > 0; mp_h--) {
1767 if (start_list[mp_h])
1768 break;
1769 }
1770 start_aligned = mp_h;
d552a2b9
BP
1771
1772 ret = gfs2_meta_inode_buffer(ip, &dibh);
1773 if (ret)
1774 return ret;
b3b94faa 1775
d552a2b9
BP
1776 mp.mp_bh[0] = dibh;
1777 ret = lookup_metapath(ip, &mp);
e8b43fe0
AG
1778 if (ret)
1779 goto out_metapath;
c3ce5aa9
AG
1780
1781 /* issue read-ahead on metadata */
5cf26b1e
AG
1782 for (mp_h = 0; mp_h < mp.mp_aheight - 1; mp_h++) {
1783 metapointer_range(&mp, mp_h, start_list, start_aligned,
10d2cf94 1784 end_list, end_aligned, &start, &end);
5cf26b1e
AG
1785 gfs2_metapath_ra(ip->i_gl, start, end);
1786 }
c3ce5aa9 1787
e8b43fe0 1788 if (mp.mp_aheight == ip->i_height)
d552a2b9
BP
1789 state = DEALLOC_MP_FULL; /* We have a complete metapath */
1790 else
1791 state = DEALLOC_FILL_MP; /* deal with partial metapath */
b3b94faa 1792
d552a2b9
BP
1793 ret = gfs2_rindex_update(sdp);
1794 if (ret)
1795 goto out_metapath;
1796
1797 ret = gfs2_quota_hold(ip, NO_UID_QUOTA_CHANGE, NO_GID_QUOTA_CHANGE);
1798 if (ret)
1799 goto out_metapath;
1800 gfs2_holder_mark_uninitialized(&rd_gh);
1801
1802 mp_h = strip_h;
1803
1804 while (state != DEALLOC_DONE) {
1805 switch (state) {
1806 /* Truncate a full metapath at the given strip height.
1807 * Note that strip_h == mp_h in order to be in this state. */
1808 case DEALLOC_MP_FULL:
d552a2b9
BP
1809 bh = mp.mp_bh[mp_h];
1810 gfs2_assert_withdraw(sdp, bh);
1811 if (gfs2_assert_withdraw(sdp,
1812 prev_bnr != bh->b_blocknr)) {
f29e62ee
BP
1813 fs_emerg(sdp, "inode %llu, block:%llu, i_h:%u,"
1814 "s_h:%u, mp_h:%u\n",
d552a2b9
BP
1815 (unsigned long long)ip->i_no_addr,
1816 prev_bnr, ip->i_height, strip_h, mp_h);
1817 }
1818 prev_bnr = bh->b_blocknr;
cb7f0903 1819
5cf26b1e
AG
1820 if (gfs2_metatype_check(sdp, bh,
1821 (mp_h ? GFS2_METATYPE_IN :
1822 GFS2_METATYPE_DI))) {
1823 ret = -EIO;
1824 goto out;
1825 }
1826
10d2cf94
AG
1827 /*
1828 * Below, passing end_aligned as 0 gives us the
1829 * metapointer range excluding the end point: the end
1830 * point is the first metapath we must not deallocate!
1831 */
1832
5cf26b1e 1833 metapointer_range(&mp, mp_h, start_list, start_aligned,
10d2cf94 1834 end_list, 0 /* end_aligned */,
5cf26b1e
AG
1835 &start, &end);
1836 ret = sweep_bh_for_rgrps(ip, &rd_gh, mp.mp_bh[mp_h],
1837 start, end,
1838 mp_h != ip->i_height - 1,
1839 &btotal);
cb7f0903 1840
d552a2b9
BP
1841 /* If we hit an error or just swept dinode buffer,
1842 just exit. */
1843 if (ret || !mp_h) {
1844 state = DEALLOC_DONE;
1845 break;
1846 }
1847 state = DEALLOC_MP_LOWER;
1848 break;
1849
1850 /* lower the metapath strip height */
1851 case DEALLOC_MP_LOWER:
1852 /* We're done with the current buffer, so release it,
1853 unless it's the dinode buffer. Then back up to the
1854 previous pointer. */
1855 if (mp_h) {
1856 brelse(mp.mp_bh[mp_h]);
1857 mp.mp_bh[mp_h] = NULL;
1858 }
1859 /* If we can't get any lower in height, we've stripped
1860 off all we can. Next step is to back up and start
1861 stripping the previous level of metadata. */
1862 if (mp_h == 0) {
1863 strip_h--;
cb7f0903 1864 memcpy(mp.mp_list, start_list, sizeof(start_list));
d552a2b9
BP
1865 mp_h = strip_h;
1866 state = DEALLOC_FILL_MP;
1867 break;
1868 }
1869 mp.mp_list[mp_h] = 0;
1870 mp_h--; /* search one metadata height down */
d552a2b9 1871 mp.mp_list[mp_h]++;
10d2cf94
AG
1872 if (walk_done(sdp, &mp, mp_h, end_list, end_aligned))
1873 break;
d552a2b9
BP
1874 /* Here we've found a part of the metapath that is not
1875 * allocated. We need to search at that height for the
1876 * next non-null pointer. */
10d2cf94 1877 if (find_nonnull_ptr(sdp, &mp, mp_h, end_list, end_aligned)) {
d552a2b9
BP
1878 state = DEALLOC_FILL_MP;
1879 mp_h++;
1880 }
1881 /* No more non-null pointers at this height. Back up
1882 to the previous height and try again. */
1883 break; /* loop around in the same state */
1884
1885 /* Fill the metapath with buffers to the given height. */
1886 case DEALLOC_FILL_MP:
1887 /* Fill the buffers out to the current height. */
1888 ret = fillup_metapath(ip, &mp, mp_h);
c3ce5aa9 1889 if (ret < 0)
d552a2b9 1890 goto out;
c3ce5aa9 1891
e7445ced
AG
1892 /* On the first pass, issue read-ahead on metadata. */
1893 if (mp.mp_aheight > 1 && strip_h == ip->i_height - 1) {
1894 unsigned int height = mp.mp_aheight - 1;
1895
1896 /* No read-ahead for data blocks. */
1897 if (mp.mp_aheight - 1 == strip_h)
1898 height--;
1899
1900 for (; height >= mp.mp_aheight - ret; height--) {
1901 metapointer_range(&mp, height,
5cf26b1e 1902 start_list, start_aligned,
10d2cf94 1903 end_list, end_aligned,
5cf26b1e
AG
1904 &start, &end);
1905 gfs2_metapath_ra(ip->i_gl, start, end);
1906 }
c3ce5aa9 1907 }
d552a2b9
BP
1908
1909 /* If buffers found for the entire strip height */
e8b43fe0 1910 if (mp.mp_aheight - 1 == strip_h) {
d552a2b9
BP
1911 state = DEALLOC_MP_FULL;
1912 break;
1913 }
e8b43fe0
AG
1914 if (mp.mp_aheight < ip->i_height) /* We have a partial height */
1915 mp_h = mp.mp_aheight - 1;
d552a2b9
BP
1916
1917 /* If we find a non-null block pointer, crawl a bit
1918 higher up in the metapath and try again, otherwise
1919 we need to look lower for a new starting point. */
10d2cf94 1920 if (find_nonnull_ptr(sdp, &mp, mp_h, end_list, end_aligned))
d552a2b9
BP
1921 mp_h++;
1922 else
1923 state = DEALLOC_MP_LOWER;
b3b94faa 1924 break;
d552a2b9 1925 }
b3b94faa
DT
1926 }
1927
d552a2b9
BP
1928 if (btotal) {
1929 if (current->journal_info == NULL) {
1930 ret = gfs2_trans_begin(sdp, RES_DINODE + RES_STATFS +
1931 RES_QUOTA, 0);
1932 if (ret)
1933 goto out;
1934 down_write(&ip->i_rw_mutex);
1935 }
1936 gfs2_statfs_change(sdp, 0, +btotal, 0);
1937 gfs2_quota_change(ip, -(s64)btotal, ip->i_inode.i_uid,
1938 ip->i_inode.i_gid);
b32c8c76 1939 ip->i_inode.i_mtime = ip->i_inode.i_ctime = current_time(&ip->i_inode);
d552a2b9
BP
1940 gfs2_trans_add_meta(ip->i_gl, dibh);
1941 gfs2_dinode_out(ip, dibh->b_data);
1942 up_write(&ip->i_rw_mutex);
1943 gfs2_trans_end(sdp);
1944 }
b3b94faa 1945
d552a2b9
BP
1946out:
1947 if (gfs2_holder_initialized(&rd_gh))
1948 gfs2_glock_dq_uninit(&rd_gh);
1949 if (current->journal_info) {
1950 up_write(&ip->i_rw_mutex);
1951 gfs2_trans_end(sdp);
1952 cond_resched();
1953 }
1954 gfs2_quota_unhold(ip);
1955out_metapath:
1956 release_metapath(&mp);
1957 return ret;
b3b94faa
DT
1958}
1959
1960static int trunc_end(struct gfs2_inode *ip)
1961{
feaa7bba 1962 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
b3b94faa
DT
1963 struct buffer_head *dibh;
1964 int error;
1965
1966 error = gfs2_trans_begin(sdp, RES_DINODE, 0);
1967 if (error)
1968 return error;
1969
1970 down_write(&ip->i_rw_mutex);
1971
1972 error = gfs2_meta_inode_buffer(ip, &dibh);
1973 if (error)
1974 goto out;
1975
a2e0f799 1976 if (!i_size_read(&ip->i_inode)) {
ecc30c79 1977 ip->i_height = 0;
ce276b06 1978 ip->i_goal = ip->i_no_addr;
b3b94faa 1979 gfs2_buffer_clear_tail(dibh, sizeof(struct gfs2_dinode));
45138990 1980 gfs2_ordered_del_inode(ip);
b3b94faa 1981 }
078cd827 1982 ip->i_inode.i_mtime = ip->i_inode.i_ctime = current_time(&ip->i_inode);
383f01fb 1983 ip->i_diskflags &= ~GFS2_DIF_TRUNC_IN_PROG;
b3b94faa 1984
350a9b0a 1985 gfs2_trans_add_meta(ip->i_gl, dibh);
539e5d6b 1986 gfs2_dinode_out(ip, dibh->b_data);
b3b94faa
DT
1987 brelse(dibh);
1988
a91ea69f 1989out:
b3b94faa 1990 up_write(&ip->i_rw_mutex);
b3b94faa 1991 gfs2_trans_end(sdp);
b3b94faa
DT
1992 return error;
1993}
1994
1995/**
1996 * do_shrink - make a file smaller
ff8f33c8 1997 * @inode: the inode
ff8f33c8 1998 * @newsize: the size to make the file
b3b94faa 1999 *
ff8f33c8
SW
2000 * Called with an exclusive lock on @inode. The @size must
2001 * be equal to or smaller than the current inode size.
b3b94faa
DT
2002 *
2003 * Returns: errno
2004 */
2005
8b5860a3 2006static int do_shrink(struct inode *inode, u64 newsize)
b3b94faa 2007{
ff8f33c8 2008 struct gfs2_inode *ip = GFS2_I(inode);
b3b94faa
DT
2009 int error;
2010
8b5860a3 2011 error = trunc_start(inode, newsize);
b3b94faa
DT
2012 if (error < 0)
2013 return error;
ff8f33c8 2014 if (gfs2_is_stuffed(ip))
b3b94faa
DT
2015 return 0;
2016
10d2cf94 2017 error = punch_hole(ip, newsize, 0);
ff8f33c8 2018 if (error == 0)
b3b94faa
DT
2019 error = trunc_end(ip);
2020
2021 return error;
2022}
2023
ff8f33c8 2024void gfs2_trim_blocks(struct inode *inode)
a13b8c5f 2025{
ff8f33c8
SW
2026 int ret;
2027
8b5860a3 2028 ret = do_shrink(inode, inode->i_size);
ff8f33c8
SW
2029 WARN_ON(ret != 0);
2030}
2031
2032/**
2033 * do_grow - Touch and update inode size
2034 * @inode: The inode
2035 * @size: The new size
2036 *
2037 * This function updates the timestamps on the inode and
2038 * may also increase the size of the inode. This function
2039 * must not be called with @size any smaller than the current
2040 * inode size.
2041 *
2042 * Although it is not strictly required to unstuff files here,
2043 * earlier versions of GFS2 have a bug in the stuffed file reading
2044 * code which will result in a buffer overrun if the size is larger
2045 * than the max stuffed file size. In order to prevent this from
25985edc 2046 * occurring, such files are unstuffed, but in other cases we can
ff8f33c8
SW
2047 * just update the inode size directly.
2048 *
2049 * Returns: 0 on success, or -ve on error
2050 */
2051
2052static int do_grow(struct inode *inode, u64 size)
2053{
2054 struct gfs2_inode *ip = GFS2_I(inode);
2055 struct gfs2_sbd *sdp = GFS2_SB(inode);
7b9cff46 2056 struct gfs2_alloc_parms ap = { .target = 1, };
a13b8c5f
WC
2057 struct buffer_head *dibh;
2058 int error;
2f7ee358 2059 int unstuff = 0;
a13b8c5f 2060
235628c5 2061 if (gfs2_is_stuffed(ip) && size > gfs2_max_stuffed_size(ip)) {
b8fbf471 2062 error = gfs2_quota_lock_check(ip, &ap);
ff8f33c8 2063 if (error)
5407e242 2064 return error;
ff8f33c8 2065
7b9cff46 2066 error = gfs2_inplace_reserve(ip, &ap);
ff8f33c8
SW
2067 if (error)
2068 goto do_grow_qunlock;
2f7ee358 2069 unstuff = 1;
ff8f33c8
SW
2070 }
2071
a01aedfe 2072 error = gfs2_trans_begin(sdp, RES_DINODE + RES_STATFS + RES_RG_BIT +
bc020561
BP
2073 (unstuff &&
2074 gfs2_is_jdata(ip) ? RES_JDATA : 0) +
a01aedfe
BP
2075 (sdp->sd_args.ar_quota == GFS2_QUOTA_OFF ?
2076 0 : RES_QUOTA), 0);
a13b8c5f 2077 if (error)
ff8f33c8 2078 goto do_grow_release;
a13b8c5f 2079
2f7ee358 2080 if (unstuff) {
7a607a41 2081 error = gfs2_unstuff_dinode(ip);
ff8f33c8
SW
2082 if (error)
2083 goto do_end_trans;
2084 }
a13b8c5f
WC
2085
2086 error = gfs2_meta_inode_buffer(ip, &dibh);
2087 if (error)
ff8f33c8 2088 goto do_end_trans;
a13b8c5f 2089
b473bc2d 2090 truncate_setsize(inode, size);
078cd827 2091 ip->i_inode.i_mtime = ip->i_inode.i_ctime = current_time(&ip->i_inode);
350a9b0a 2092 gfs2_trans_add_meta(ip->i_gl, dibh);
a13b8c5f
WC
2093 gfs2_dinode_out(ip, dibh->b_data);
2094 brelse(dibh);
2095
ff8f33c8 2096do_end_trans:
a13b8c5f 2097 gfs2_trans_end(sdp);
ff8f33c8 2098do_grow_release:
2f7ee358 2099 if (unstuff) {
ff8f33c8
SW
2100 gfs2_inplace_release(ip);
2101do_grow_qunlock:
2102 gfs2_quota_unlock(ip);
ff8f33c8 2103 }
a13b8c5f
WC
2104 return error;
2105}
2106
b3b94faa 2107/**
ff8f33c8
SW
2108 * gfs2_setattr_size - make a file a given size
2109 * @inode: the inode
2110 * @newsize: the size to make the file
b3b94faa 2111 *
ff8f33c8 2112 * The file size can grow, shrink, or stay the same size. This
3e7aafc3 2113 * is called holding i_rwsem and an exclusive glock on the inode
ff8f33c8 2114 * in question.
b3b94faa
DT
2115 *
2116 * Returns: errno
2117 */
2118
ff8f33c8 2119int gfs2_setattr_size(struct inode *inode, u64 newsize)
b3b94faa 2120{
af5c2697 2121 struct gfs2_inode *ip = GFS2_I(inode);
ff8f33c8 2122 int ret;
b3b94faa 2123
ff8f33c8 2124 BUG_ON(!S_ISREG(inode->i_mode));
b3b94faa 2125
ff8f33c8
SW
2126 ret = inode_newsize_ok(inode, newsize);
2127 if (ret)
2128 return ret;
b3b94faa 2129
562c72aa
CH
2130 inode_dio_wait(inode);
2131
2fba46a0 2132 ret = gfs2_qa_get(ip);
d2b47cfb 2133 if (ret)
2b3dcf35 2134 goto out;
d2b47cfb 2135
8b5860a3 2136 if (newsize >= inode->i_size) {
2b3dcf35
BP
2137 ret = do_grow(inode, newsize);
2138 goto out;
2139 }
ff8f33c8 2140
8b5860a3 2141 ret = do_shrink(inode, newsize);
2b3dcf35 2142out:
7336905a 2143 gfs2_rs_delete(ip);
1595548f 2144 gfs2_qa_put(ip);
2b3dcf35 2145 return ret;
b3b94faa
DT
2146}
2147
2148int gfs2_truncatei_resume(struct gfs2_inode *ip)
2149{
2150 int error;
10d2cf94 2151 error = punch_hole(ip, i_size_read(&ip->i_inode), 0);
b3b94faa
DT
2152 if (!error)
2153 error = trunc_end(ip);
2154 return error;
2155}
2156
2157int gfs2_file_dealloc(struct gfs2_inode *ip)
2158{
10d2cf94 2159 return punch_hole(ip, 0, 0);
b3b94faa
DT
2160}
2161
b50f227b
SW
2162/**
2163 * gfs2_free_journal_extents - Free cached journal bmap info
2164 * @jd: The journal
2165 *
2166 */
2167
2168void gfs2_free_journal_extents(struct gfs2_jdesc *jd)
2169{
2170 struct gfs2_journal_extent *jext;
2171
2172 while(!list_empty(&jd->extent_list)) {
969183bc 2173 jext = list_first_entry(&jd->extent_list, struct gfs2_journal_extent, list);
b50f227b
SW
2174 list_del(&jext->list);
2175 kfree(jext);
2176 }
2177}
2178
2179/**
2180 * gfs2_add_jextent - Add or merge a new extent to extent cache
2181 * @jd: The journal descriptor
2182 * @lblock: The logical block at start of new extent
c62baf65 2183 * @dblock: The physical block at start of new extent
b50f227b
SW
2184 * @blocks: Size of extent in fs blocks
2185 *
2186 * Returns: 0 on success or -ENOMEM
2187 */
2188
2189static int gfs2_add_jextent(struct gfs2_jdesc *jd, u64 lblock, u64 dblock, u64 blocks)
2190{
2191 struct gfs2_journal_extent *jext;
2192
2193 if (!list_empty(&jd->extent_list)) {
969183bc 2194 jext = list_last_entry(&jd->extent_list, struct gfs2_journal_extent, list);
b50f227b
SW
2195 if ((jext->dblock + jext->blocks) == dblock) {
2196 jext->blocks += blocks;
2197 return 0;
2198 }
2199 }
2200
2201 jext = kzalloc(sizeof(struct gfs2_journal_extent), GFP_NOFS);
2202 if (jext == NULL)
2203 return -ENOMEM;
2204 jext->dblock = dblock;
2205 jext->lblock = lblock;
2206 jext->blocks = blocks;
2207 list_add_tail(&jext->list, &jd->extent_list);
2208 jd->nr_extents++;
2209 return 0;
2210}
2211
2212/**
2213 * gfs2_map_journal_extents - Cache journal bmap info
2214 * @sdp: The super block
2215 * @jd: The journal to map
2216 *
2217 * Create a reusable "extent" mapping from all logical
2218 * blocks to all physical blocks for the given journal. This will save
2219 * us time when writing journal blocks. Most journals will have only one
2220 * extent that maps all their logical blocks. That's because gfs2.mkfs
2221 * arranges the journal blocks sequentially to maximize performance.
2222 * So the extent would map the first block for the entire file length.
2223 * However, gfs2_jadd can happen while file activity is happening, so
2224 * those journals may not be sequential. Less likely is the case where
2225 * the users created their own journals by mounting the metafs and
2226 * laying it out. But it's still possible. These journals might have
2227 * several extents.
2228 *
2229 * Returns: 0 on success, or error on failure
2230 */
2231
2232int gfs2_map_journal_extents(struct gfs2_sbd *sdp, struct gfs2_jdesc *jd)
2233{
2234 u64 lblock = 0;
2235 u64 lblock_stop;
2236 struct gfs2_inode *ip = GFS2_I(jd->jd_inode);
2237 struct buffer_head bh;
2238 unsigned int shift = sdp->sd_sb.sb_bsize_shift;
2239 u64 size;
2240 int rc;
98583b3e 2241 ktime_t start, end;
b50f227b 2242
98583b3e 2243 start = ktime_get();
b50f227b
SW
2244 lblock_stop = i_size_read(jd->jd_inode) >> shift;
2245 size = (lblock_stop - lblock) << shift;
2246 jd->nr_extents = 0;
2247 WARN_ON(!list_empty(&jd->extent_list));
2248
2249 do {
2250 bh.b_state = 0;
2251 bh.b_blocknr = 0;
2252 bh.b_size = size;
2253 rc = gfs2_block_map(jd->jd_inode, lblock, &bh, 0);
2254 if (rc || !buffer_mapped(&bh))
2255 goto fail;
2256 rc = gfs2_add_jextent(jd, lblock, bh.b_blocknr, bh.b_size >> shift);
2257 if (rc)
2258 goto fail;
2259 size -= bh.b_size;
2260 lblock += (bh.b_size >> ip->i_inode.i_blkbits);
2261 } while(size > 0);
2262
98583b3e
AD
2263 end = ktime_get();
2264 fs_info(sdp, "journal %d mapped with %u extents in %lldms\n", jd->jd_jid,
2265 jd->nr_extents, ktime_ms_delta(end, start));
b50f227b
SW
2266 return 0;
2267
2268fail:
2269 fs_warn(sdp, "error %d mapping journal %u at offset %llu (extent %u)\n",
2270 rc, jd->jd_jid,
2271 (unsigned long long)(i_size_read(jd->jd_inode) - size),
2272 jd->nr_extents);
2273 fs_warn(sdp, "bmap=%d lblock=%llu block=%llu, state=0x%08lx, size=%llu\n",
2274 rc, (unsigned long long)lblock, (unsigned long long)bh.b_blocknr,
2275 bh.b_state, (unsigned long long)bh.b_size);
2276 gfs2_free_journal_extents(jd);
2277 return rc;
2278}
2279
b3b94faa
DT
2280/**
2281 * gfs2_write_alloc_required - figure out if a write will require an allocation
2282 * @ip: the file being written to
2283 * @offset: the offset to write to
2284 * @len: the number of bytes being written
b3b94faa 2285 *
461cb419 2286 * Returns: 1 if an alloc is required, 0 otherwise
b3b94faa
DT
2287 */
2288
cd915493 2289int gfs2_write_alloc_required(struct gfs2_inode *ip, u64 offset,
461cb419 2290 unsigned int len)
b3b94faa 2291{
feaa7bba 2292 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
941e6d7d
SW
2293 struct buffer_head bh;
2294 unsigned int shift;
2295 u64 lblock, lblock_stop, size;
7ed122e4 2296 u64 end_of_file;
b3b94faa 2297
b3b94faa
DT
2298 if (!len)
2299 return 0;
2300
2301 if (gfs2_is_stuffed(ip)) {
235628c5 2302 if (offset + len > gfs2_max_stuffed_size(ip))
461cb419 2303 return 1;
b3b94faa
DT
2304 return 0;
2305 }
2306
941e6d7d 2307 shift = sdp->sd_sb.sb_bsize_shift;
7ed122e4 2308 BUG_ON(gfs2_is_dir(ip));
a2e0f799 2309 end_of_file = (i_size_read(&ip->i_inode) + sdp->sd_sb.sb_bsize - 1) >> shift;
7ed122e4
SW
2310 lblock = offset >> shift;
2311 lblock_stop = (offset + len + sdp->sd_sb.sb_bsize - 1) >> shift;
77612578 2312 if (lblock_stop > end_of_file && ip != GFS2_I(sdp->sd_rindex))
461cb419 2313 return 1;
b3b94faa 2314
941e6d7d
SW
2315 size = (lblock_stop - lblock) << shift;
2316 do {
2317 bh.b_state = 0;
2318 bh.b_size = size;
2319 gfs2_block_map(&ip->i_inode, lblock, &bh, 0);
2320 if (!buffer_mapped(&bh))
461cb419 2321 return 1;
941e6d7d
SW
2322 size -= bh.b_size;
2323 lblock += (bh.b_size >> ip->i_inode.i_blkbits);
2324 } while(size > 0);
b3b94faa
DT
2325
2326 return 0;
2327}
2328
4e56a641
AG
2329static int stuffed_zero_range(struct inode *inode, loff_t offset, loff_t length)
2330{
2331 struct gfs2_inode *ip = GFS2_I(inode);
2332 struct buffer_head *dibh;
2333 int error;
2334
2335 if (offset >= inode->i_size)
2336 return 0;
2337 if (offset + length > inode->i_size)
2338 length = inode->i_size - offset;
2339
2340 error = gfs2_meta_inode_buffer(ip, &dibh);
2341 if (error)
2342 return error;
2343 gfs2_trans_add_meta(ip->i_gl, dibh);
2344 memset(dibh->b_data + sizeof(struct gfs2_dinode) + offset, 0,
2345 length);
2346 brelse(dibh);
2347 return 0;
2348}
2349
2350static int gfs2_journaled_truncate_range(struct inode *inode, loff_t offset,
2351 loff_t length)
2352{
2353 struct gfs2_sbd *sdp = GFS2_SB(inode);
2354 loff_t max_chunk = GFS2_JTRUNC_REVOKES * sdp->sd_vfs->s_blocksize;
2355 int error;
2356
2357 while (length) {
2358 struct gfs2_trans *tr;
2359 loff_t chunk;
2360 unsigned int offs;
2361
2362 chunk = length;
2363 if (chunk > max_chunk)
2364 chunk = max_chunk;
2365
2366 offs = offset & ~PAGE_MASK;
2367 if (offs && chunk > PAGE_SIZE)
2368 chunk = offs + ((chunk - offs) & PAGE_MASK);
2369
2370 truncate_pagecache_range(inode, offset, chunk);
2371 offset += chunk;
2372 length -= chunk;
2373
2374 tr = current->journal_info;
2375 if (!test_bit(TR_TOUCHED, &tr->tr_flags))
2376 continue;
2377
2378 gfs2_trans_end(sdp);
2379 error = gfs2_trans_begin(sdp, RES_DINODE, GFS2_JTRUNC_REVOKES);
2380 if (error)
2381 return error;
2382 }
2383 return 0;
2384}
2385
2386int __gfs2_punch_hole(struct file *file, loff_t offset, loff_t length)
2387{
2388 struct inode *inode = file_inode(file);
2389 struct gfs2_inode *ip = GFS2_I(inode);
2390 struct gfs2_sbd *sdp = GFS2_SB(inode);
39c3a948
AG
2391 unsigned int blocksize = i_blocksize(inode);
2392 loff_t start, end;
4e56a641
AG
2393 int error;
2394
70499cdf 2395 if (!gfs2_is_stuffed(ip)) {
39c3a948 2396 unsigned int start_off, end_len;
4e56a641 2397
4e56a641 2398 start_off = offset & (blocksize - 1);
00251a16 2399 end_len = (offset + length) & (blocksize - 1);
4e56a641
AG
2400 if (start_off) {
2401 unsigned int len = length;
2402 if (length > blocksize - start_off)
2403 len = blocksize - start_off;
2404 error = gfs2_block_zero_range(inode, offset, len);
2405 if (error)
2406 goto out;
2407 if (start_off + length < blocksize)
00251a16 2408 end_len = 0;
4e56a641 2409 }
00251a16 2410 if (end_len) {
4e56a641 2411 error = gfs2_block_zero_range(inode,
00251a16 2412 offset + length - end_len, end_len);
4e56a641
AG
2413 if (error)
2414 goto out;
2415 }
2416 }
2417
70499cdf
BP
2418 start = round_down(offset, blocksize);
2419 end = round_up(offset + length, blocksize) - 1;
2420 error = filemap_write_and_wait_range(inode->i_mapping, start, end);
2421 if (error)
2422 return error;
2423
2424 if (gfs2_is_jdata(ip))
2425 error = gfs2_trans_begin(sdp, RES_DINODE + 2 * RES_JDATA,
2426 GFS2_JTRUNC_REVOKES);
2427 else
2428 error = gfs2_trans_begin(sdp, RES_DINODE, 0);
2429 if (error)
2430 return error;
2431
2432 if (gfs2_is_stuffed(ip)) {
2433 error = stuffed_zero_range(inode, offset, length);
2434 if (error)
2435 goto out;
2436 }
2437
4e56a641
AG
2438 if (gfs2_is_jdata(ip)) {
2439 BUG_ON(!current->journal_info);
2440 gfs2_journaled_truncate_range(inode, offset, length);
2441 } else
2442 truncate_pagecache_range(inode, offset, offset + length - 1);
2443
2444 file_update_time(file);
2445 mark_inode_dirty(inode);
2446
2447 if (current->journal_info)
2448 gfs2_trans_end(sdp);
2449
2450 if (!gfs2_is_stuffed(ip))
2451 error = punch_hole(ip, offset, length);
2452
2453out:
2454 if (current->journal_info)
2455 gfs2_trans_end(sdp);
2456 return error;
2457}
2164f9b9
CH
2458
2459static int gfs2_map_blocks(struct iomap_writepage_ctx *wpc, struct inode *inode,
2460 loff_t offset)
2461{
2164f9b9
CH
2462 int ret;
2463
2464 if (WARN_ON_ONCE(gfs2_is_stuffed(GFS2_I(inode))))
2465 return -EIO;
2466
2467 if (offset >= wpc->iomap.offset &&
2468 offset < wpc->iomap.offset + wpc->iomap.length)
2469 return 0;
2470
2471 memset(&wpc->iomap, 0, sizeof(wpc->iomap));
54992257 2472 ret = gfs2_iomap_get(inode, offset, INT_MAX, &wpc->iomap);
2164f9b9
CH
2473 return ret;
2474}
2475
2476const struct iomap_writeback_ops gfs2_writeback_ops = {
2477 .map_blocks = gfs2_map_blocks,
2478};