Commit | Line | Data |
---|---|---|
b3b94faa DT |
1 | /* |
2 | * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved. | |
3a8a9a10 | 3 | * Copyright (C) 2004-2006 Red Hat, Inc. All rights reserved. |
b3b94faa DT |
4 | * |
5 | * This copyrighted material is made available to anyone wishing to use, | |
6 | * modify, copy, or redistribute it subject to the terms and conditions | |
e9fc2aa0 | 7 | * of the GNU General Public License version 2. |
b3b94faa DT |
8 | */ |
9 | ||
b3b94faa DT |
10 | #include <linux/spinlock.h> |
11 | #include <linux/completion.h> | |
12 | #include <linux/buffer_head.h> | |
5c676f6d | 13 | #include <linux/gfs2_ondisk.h> |
71b86f56 | 14 | #include <linux/crc32.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" | |
4c16c36a | 24 | #include "super.h" |
b3b94faa | 25 | #include "trans.h" |
18ec7d5c | 26 | #include "dir.h" |
5c676f6d | 27 | #include "util.h" |
63997775 | 28 | #include "trace_gfs2.h" |
b3b94faa DT |
29 | |
30 | /* This doesn't need to be that large as max 64 bit pointers in a 4k | |
31 | * block is 512, so __u16 is fine for that. It saves stack space to | |
32 | * keep it small. | |
33 | */ | |
34 | struct metapath { | |
dbac6710 | 35 | struct buffer_head *mp_bh[GFS2_MAX_META_HEIGHT]; |
b3b94faa DT |
36 | __u16 mp_list[GFS2_MAX_META_HEIGHT]; |
37 | }; | |
38 | ||
39 | typedef int (*block_call_t) (struct gfs2_inode *ip, struct buffer_head *dibh, | |
b44b84d7 AV |
40 | struct buffer_head *bh, __be64 *top, |
41 | __be64 *bottom, unsigned int height, | |
b3b94faa DT |
42 | void *data); |
43 | ||
44 | struct strip_mine { | |
45 | int sm_first; | |
46 | unsigned int sm_height; | |
47 | }; | |
48 | ||
f25ef0c1 SW |
49 | /** |
50 | * gfs2_unstuffer_page - unstuff a stuffed inode into a block cached by a page | |
51 | * @ip: the inode | |
52 | * @dibh: the dinode buffer | |
53 | * @block: the block number that was allocated | |
ff8f33c8 | 54 | * @page: The (optional) page. This is looked up if @page is NULL |
f25ef0c1 SW |
55 | * |
56 | * Returns: errno | |
57 | */ | |
58 | ||
59 | static int gfs2_unstuffer_page(struct gfs2_inode *ip, struct buffer_head *dibh, | |
cd915493 | 60 | u64 block, struct page *page) |
f25ef0c1 | 61 | { |
f25ef0c1 SW |
62 | struct inode *inode = &ip->i_inode; |
63 | struct buffer_head *bh; | |
64 | int release = 0; | |
65 | ||
66 | if (!page || page->index) { | |
67 | page = grab_cache_page(inode->i_mapping, 0); | |
68 | if (!page) | |
69 | return -ENOMEM; | |
70 | release = 1; | |
71 | } | |
72 | ||
73 | if (!PageUptodate(page)) { | |
74 | void *kaddr = kmap(page); | |
602c89d2 SW |
75 | u64 dsize = i_size_read(inode); |
76 | ||
77 | if (dsize > (dibh->b_size - sizeof(struct gfs2_dinode))) | |
78 | dsize = dibh->b_size - sizeof(struct gfs2_dinode); | |
f25ef0c1 | 79 | |
602c89d2 SW |
80 | memcpy(kaddr, dibh->b_data + sizeof(struct gfs2_dinode), dsize); |
81 | memset(kaddr + dsize, 0, PAGE_CACHE_SIZE - dsize); | |
f25ef0c1 SW |
82 | kunmap(page); |
83 | ||
84 | SetPageUptodate(page); | |
85 | } | |
86 | ||
87 | if (!page_has_buffers(page)) | |
88 | create_empty_buffers(page, 1 << inode->i_blkbits, | |
89 | (1 << BH_Uptodate)); | |
90 | ||
91 | bh = page_buffers(page); | |
92 | ||
93 | if (!buffer_mapped(bh)) | |
94 | map_bh(bh, inode->i_sb, block); | |
95 | ||
96 | set_buffer_uptodate(bh); | |
eaf96527 SW |
97 | if (!gfs2_is_jdata(ip)) |
98 | mark_buffer_dirty(bh); | |
bf36a713 | 99 | if (!gfs2_is_writeback(ip)) |
8475487b | 100 | gfs2_trans_add_bh(ip->i_gl, bh, 0); |
f25ef0c1 SW |
101 | |
102 | if (release) { | |
103 | unlock_page(page); | |
104 | page_cache_release(page); | |
105 | } | |
106 | ||
107 | return 0; | |
108 | } | |
109 | ||
b3b94faa DT |
110 | /** |
111 | * gfs2_unstuff_dinode - Unstuff a dinode when the data has grown too big | |
112 | * @ip: The GFS2 inode to unstuff | |
ff8f33c8 | 113 | * @page: The (optional) page. This is looked up if the @page is NULL |
b3b94faa DT |
114 | * |
115 | * This routine unstuffs a dinode and returns it to a "normal" state such | |
116 | * that the height can be grown in the traditional way. | |
117 | * | |
118 | * Returns: errno | |
119 | */ | |
120 | ||
f25ef0c1 | 121 | int gfs2_unstuff_dinode(struct gfs2_inode *ip, struct page *page) |
b3b94faa DT |
122 | { |
123 | struct buffer_head *bh, *dibh; | |
48516ced | 124 | struct gfs2_dinode *di; |
cd915493 | 125 | u64 block = 0; |
18ec7d5c | 126 | int isdir = gfs2_is_dir(ip); |
b3b94faa DT |
127 | int error; |
128 | ||
129 | down_write(&ip->i_rw_mutex); | |
130 | ||
131 | error = gfs2_meta_inode_buffer(ip, &dibh); | |
132 | if (error) | |
133 | goto out; | |
907b9bce | 134 | |
a2e0f799 | 135 | if (i_size_read(&ip->i_inode)) { |
b3b94faa DT |
136 | /* Get a free block, fill it with the stuffed data, |
137 | and write it out to disk */ | |
138 | ||
b45e41d7 | 139 | unsigned int n = 1; |
09010978 SW |
140 | error = gfs2_alloc_block(ip, &block, &n); |
141 | if (error) | |
142 | goto out_brelse; | |
18ec7d5c | 143 | if (isdir) { |
5731be53 | 144 | gfs2_trans_add_unrevoke(GFS2_SB(&ip->i_inode), block, 1); |
61e085a8 | 145 | error = gfs2_dir_get_new_buffer(ip, block, &bh); |
b3b94faa DT |
146 | if (error) |
147 | goto out_brelse; | |
48516ced | 148 | gfs2_buffer_copy_tail(bh, sizeof(struct gfs2_meta_header), |
b3b94faa DT |
149 | dibh, sizeof(struct gfs2_dinode)); |
150 | brelse(bh); | |
151 | } else { | |
f25ef0c1 | 152 | error = gfs2_unstuffer_page(ip, dibh, block, page); |
b3b94faa DT |
153 | if (error) |
154 | goto out_brelse; | |
155 | } | |
156 | } | |
157 | ||
158 | /* Set up the pointer to the new block */ | |
159 | ||
d4e9c4c3 | 160 | gfs2_trans_add_bh(ip->i_gl, dibh, 1); |
48516ced | 161 | di = (struct gfs2_dinode *)dibh->b_data; |
b3b94faa DT |
162 | gfs2_buffer_clear_tail(dibh, sizeof(struct gfs2_dinode)); |
163 | ||
a2e0f799 | 164 | if (i_size_read(&ip->i_inode)) { |
48516ced | 165 | *(__be64 *)(di + 1) = cpu_to_be64(block); |
77658aad SW |
166 | gfs2_add_inode_blocks(&ip->i_inode, 1); |
167 | di->di_blocks = cpu_to_be64(gfs2_get_inode_blocks(&ip->i_inode)); | |
b3b94faa DT |
168 | } |
169 | ||
ecc30c79 | 170 | ip->i_height = 1; |
48516ced | 171 | di->di_height = cpu_to_be16(1); |
b3b94faa | 172 | |
a91ea69f | 173 | out_brelse: |
b3b94faa | 174 | brelse(dibh); |
a91ea69f | 175 | out: |
b3b94faa | 176 | up_write(&ip->i_rw_mutex); |
b3b94faa DT |
177 | return error; |
178 | } | |
179 | ||
b3b94faa DT |
180 | |
181 | /** | |
182 | * find_metapath - Find path through the metadata tree | |
9b8c81d1 | 183 | * @sdp: The superblock |
b3b94faa DT |
184 | * @mp: The metapath to return the result in |
185 | * @block: The disk block to look up | |
9b8c81d1 | 186 | * @height: The pre-calculated height of the metadata tree |
b3b94faa DT |
187 | * |
188 | * This routine returns a struct metapath structure that defines a path | |
189 | * through the metadata of inode "ip" to get to block "block". | |
190 | * | |
191 | * Example: | |
192 | * Given: "ip" is a height 3 file, "offset" is 101342453, and this is a | |
193 | * filesystem with a blocksize of 4096. | |
194 | * | |
195 | * find_metapath() would return a struct metapath structure set to: | |
196 | * mp_offset = 101342453, mp_height = 3, mp_list[0] = 0, mp_list[1] = 48, | |
197 | * and mp_list[2] = 165. | |
198 | * | |
199 | * That means that in order to get to the block containing the byte at | |
200 | * offset 101342453, we would load the indirect block pointed to by pointer | |
201 | * 0 in the dinode. We would then load the indirect block pointed to by | |
202 | * pointer 48 in that indirect block. We would then load the data block | |
203 | * pointed to by pointer 165 in that indirect block. | |
204 | * | |
205 | * ---------------------------------------- | |
206 | * | Dinode | | | |
207 | * | | 4| | |
208 | * | |0 1 2 3 4 5 9| | |
209 | * | | 6| | |
210 | * ---------------------------------------- | |
211 | * | | |
212 | * | | |
213 | * V | |
214 | * ---------------------------------------- | |
215 | * | Indirect Block | | |
216 | * | 5| | |
217 | * | 4 4 4 4 4 5 5 1| | |
218 | * |0 5 6 7 8 9 0 1 2| | |
219 | * ---------------------------------------- | |
220 | * | | |
221 | * | | |
222 | * V | |
223 | * ---------------------------------------- | |
224 | * | Indirect Block | | |
225 | * | 1 1 1 1 1 5| | |
226 | * | 6 6 6 6 6 1| | |
227 | * |0 3 4 5 6 7 2| | |
228 | * ---------------------------------------- | |
229 | * | | |
230 | * | | |
231 | * V | |
232 | * ---------------------------------------- | |
233 | * | Data block containing offset | | |
234 | * | 101342453 | | |
235 | * | | | |
236 | * | | | |
237 | * ---------------------------------------- | |
238 | * | |
239 | */ | |
240 | ||
9b8c81d1 SW |
241 | static void find_metapath(const struct gfs2_sbd *sdp, u64 block, |
242 | struct metapath *mp, unsigned int height) | |
b3b94faa | 243 | { |
b3b94faa DT |
244 | unsigned int i; |
245 | ||
9b8c81d1 | 246 | for (i = height; i--;) |
7eabb77e | 247 | mp->mp_list[i] = do_div(block, sdp->sd_inptrs); |
b3b94faa DT |
248 | |
249 | } | |
250 | ||
5af4e7a0 | 251 | static inline unsigned int metapath_branch_start(const struct metapath *mp) |
9b8c81d1 | 252 | { |
5af4e7a0 BM |
253 | if (mp->mp_list[0] == 0) |
254 | return 2; | |
255 | return 1; | |
9b8c81d1 SW |
256 | } |
257 | ||
b3b94faa DT |
258 | /** |
259 | * metapointer - Return pointer to start of metadata in a buffer | |
b3b94faa DT |
260 | * @height: The metadata height (0 = dinode) |
261 | * @mp: The metapath | |
262 | * | |
263 | * Return a pointer to the block number of the next height of the metadata | |
264 | * tree given a buffer containing the pointer to the current height of the | |
265 | * metadata tree. | |
266 | */ | |
267 | ||
9b8c81d1 | 268 | static inline __be64 *metapointer(unsigned int height, const struct metapath *mp) |
b3b94faa | 269 | { |
dbac6710 | 270 | struct buffer_head *bh = mp->mp_bh[height]; |
b3b94faa DT |
271 | unsigned int head_size = (height > 0) ? |
272 | sizeof(struct gfs2_meta_header) : sizeof(struct gfs2_dinode); | |
9b8c81d1 | 273 | return ((__be64 *)(bh->b_data + head_size)) + mp->mp_list[height]; |
b3b94faa DT |
274 | } |
275 | ||
276 | /** | |
9b8c81d1 SW |
277 | * lookup_metapath - Walk the metadata tree to a specific point |
278 | * @ip: The inode | |
b3b94faa | 279 | * @mp: The metapath |
b3b94faa | 280 | * |
9b8c81d1 SW |
281 | * Assumes that the inode's buffer has already been looked up and |
282 | * hooked onto mp->mp_bh[0] and that the metapath has been initialised | |
283 | * by find_metapath(). | |
284 | * | |
285 | * If this function encounters part of the tree which has not been | |
286 | * allocated, it returns the current height of the tree at the point | |
287 | * at which it found the unallocated block. Blocks which are found are | |
288 | * added to the mp->mp_bh[] list. | |
b3b94faa | 289 | * |
9b8c81d1 | 290 | * Returns: error or height of metadata tree |
b3b94faa DT |
291 | */ |
292 | ||
9b8c81d1 | 293 | static int lookup_metapath(struct gfs2_inode *ip, struct metapath *mp) |
11707ea0 | 294 | { |
11707ea0 SW |
295 | unsigned int end_of_metadata = ip->i_height - 1; |
296 | unsigned int x; | |
9b8c81d1 SW |
297 | __be64 *ptr; |
298 | u64 dblock; | |
e23159d2 | 299 | int ret; |
11707ea0 SW |
300 | |
301 | for (x = 0; x < end_of_metadata; x++) { | |
9b8c81d1 SW |
302 | ptr = metapointer(x, mp); |
303 | dblock = be64_to_cpu(*ptr); | |
304 | if (!dblock) | |
305 | return x + 1; | |
11707ea0 | 306 | |
9b8c81d1 | 307 | ret = gfs2_meta_indirect_buffer(ip, x+1, dblock, 0, &mp->mp_bh[x+1]); |
11707ea0 SW |
308 | if (ret) |
309 | return ret; | |
310 | } | |
311 | ||
9b8c81d1 | 312 | return ip->i_height; |
dbac6710 SW |
313 | } |
314 | ||
9b8c81d1 | 315 | static inline void release_metapath(struct metapath *mp) |
dbac6710 SW |
316 | { |
317 | int i; | |
318 | ||
9b8c81d1 SW |
319 | for (i = 0; i < GFS2_MAX_META_HEIGHT; i++) { |
320 | if (mp->mp_bh[i] == NULL) | |
321 | break; | |
322 | brelse(mp->mp_bh[i]); | |
323 | } | |
11707ea0 SW |
324 | } |
325 | ||
30cbf189 SW |
326 | /** |
327 | * gfs2_extent_length - Returns length of an extent of blocks | |
328 | * @start: Start of the buffer | |
329 | * @len: Length of the buffer in bytes | |
330 | * @ptr: Current position in the buffer | |
331 | * @limit: Max extent length to return (0 = unlimited) | |
332 | * @eob: Set to 1 if we hit "end of block" | |
333 | * | |
334 | * If the first block is zero (unallocated) it will return the number of | |
335 | * unallocated blocks in the extent, otherwise it will return the number | |
336 | * of contiguous blocks in the extent. | |
337 | * | |
338 | * Returns: The length of the extent (minimum of one block) | |
339 | */ | |
340 | ||
341 | static inline unsigned int gfs2_extent_length(void *start, unsigned int len, __be64 *ptr, unsigned limit, int *eob) | |
342 | { | |
343 | const __be64 *end = (start + len); | |
344 | const __be64 *first = ptr; | |
345 | u64 d = be64_to_cpu(*ptr); | |
346 | ||
347 | *eob = 0; | |
348 | do { | |
349 | ptr++; | |
350 | if (ptr >= end) | |
351 | break; | |
352 | if (limit && --limit == 0) | |
353 | break; | |
354 | if (d) | |
355 | d++; | |
356 | } while(be64_to_cpu(*ptr) == d); | |
357 | if (ptr >= end) | |
358 | *eob = 1; | |
359 | return (ptr - first); | |
360 | } | |
361 | ||
9b8c81d1 | 362 | static inline void bmap_lock(struct gfs2_inode *ip, int create) |
4cf1ed81 | 363 | { |
4cf1ed81 SW |
364 | if (create) |
365 | down_write(&ip->i_rw_mutex); | |
366 | else | |
367 | down_read(&ip->i_rw_mutex); | |
368 | } | |
369 | ||
9b8c81d1 | 370 | static inline void bmap_unlock(struct gfs2_inode *ip, int create) |
4cf1ed81 | 371 | { |
4cf1ed81 SW |
372 | if (create) |
373 | up_write(&ip->i_rw_mutex); | |
374 | else | |
375 | up_read(&ip->i_rw_mutex); | |
376 | } | |
377 | ||
9b8c81d1 SW |
378 | static inline __be64 *gfs2_indirect_init(struct metapath *mp, |
379 | struct gfs2_glock *gl, unsigned int i, | |
380 | unsigned offset, u64 bn) | |
381 | { | |
382 | __be64 *ptr = (__be64 *)(mp->mp_bh[i - 1]->b_data + | |
383 | ((i > 1) ? sizeof(struct gfs2_meta_header) : | |
384 | sizeof(struct gfs2_dinode))); | |
385 | BUG_ON(i < 1); | |
386 | BUG_ON(mp->mp_bh[i] != NULL); | |
387 | mp->mp_bh[i] = gfs2_meta_new(gl, bn); | |
388 | gfs2_trans_add_bh(gl, mp->mp_bh[i], 1); | |
389 | gfs2_metatype_set(mp->mp_bh[i], GFS2_METATYPE_IN, GFS2_FORMAT_IN); | |
390 | gfs2_buffer_clear_tail(mp->mp_bh[i], sizeof(struct gfs2_meta_header)); | |
391 | ptr += offset; | |
392 | *ptr = cpu_to_be64(bn); | |
393 | return ptr; | |
394 | } | |
395 | ||
396 | enum alloc_state { | |
397 | ALLOC_DATA = 0, | |
398 | ALLOC_GROW_DEPTH = 1, | |
399 | ALLOC_GROW_HEIGHT = 2, | |
400 | /* ALLOC_UNSTUFF = 3, TBD and rather complicated */ | |
401 | }; | |
402 | ||
403 | /** | |
404 | * gfs2_bmap_alloc - Build a metadata tree of the requested height | |
405 | * @inode: The GFS2 inode | |
406 | * @lblock: The logical starting block of the extent | |
407 | * @bh_map: This is used to return the mapping details | |
408 | * @mp: The metapath | |
409 | * @sheight: The starting height (i.e. whats already mapped) | |
410 | * @height: The height to build to | |
411 | * @maxlen: The max number of data blocks to alloc | |
412 | * | |
413 | * In this routine we may have to alloc: | |
414 | * i) Indirect blocks to grow the metadata tree height | |
415 | * ii) Indirect blocks to fill in lower part of the metadata tree | |
416 | * iii) Data blocks | |
417 | * | |
418 | * The function is in two parts. The first part works out the total | |
419 | * number of blocks which we need. The second part does the actual | |
420 | * allocation asking for an extent at a time (if enough contiguous free | |
421 | * blocks are available, there will only be one request per bmap call) | |
422 | * and uses the state machine to initialise the blocks in order. | |
423 | * | |
424 | * Returns: errno on error | |
425 | */ | |
426 | ||
427 | static int gfs2_bmap_alloc(struct inode *inode, const sector_t lblock, | |
428 | struct buffer_head *bh_map, struct metapath *mp, | |
429 | const unsigned int sheight, | |
430 | const unsigned int height, | |
431 | const unsigned int maxlen) | |
432 | { | |
433 | struct gfs2_inode *ip = GFS2_I(inode); | |
434 | struct gfs2_sbd *sdp = GFS2_SB(inode); | |
435 | struct buffer_head *dibh = mp->mp_bh[0]; | |
436 | u64 bn, dblock = 0; | |
5af4e7a0 | 437 | unsigned n, i, blks, alloced = 0, iblks = 0, branch_start = 0; |
9b8c81d1 SW |
438 | unsigned dblks = 0; |
439 | unsigned ptrs_per_blk; | |
440 | const unsigned end_of_metadata = height - 1; | |
441 | int eob = 0; | |
442 | enum alloc_state state; | |
443 | __be64 *ptr; | |
444 | __be64 zero_bn = 0; | |
445 | ||
446 | BUG_ON(sheight < 1); | |
447 | BUG_ON(dibh == NULL); | |
448 | ||
449 | gfs2_trans_add_bh(ip->i_gl, dibh, 1); | |
450 | ||
451 | if (height == sheight) { | |
452 | struct buffer_head *bh; | |
453 | /* Bottom indirect block exists, find unalloced extent size */ | |
454 | ptr = metapointer(end_of_metadata, mp); | |
455 | bh = mp->mp_bh[end_of_metadata]; | |
456 | dblks = gfs2_extent_length(bh->b_data, bh->b_size, ptr, maxlen, | |
457 | &eob); | |
458 | BUG_ON(dblks < 1); | |
459 | state = ALLOC_DATA; | |
460 | } else { | |
461 | /* Need to allocate indirect blocks */ | |
462 | ptrs_per_blk = height > 1 ? sdp->sd_inptrs : sdp->sd_diptrs; | |
463 | dblks = min(maxlen, ptrs_per_blk - mp->mp_list[end_of_metadata]); | |
464 | if (height == ip->i_height) { | |
465 | /* Writing into existing tree, extend tree down */ | |
466 | iblks = height - sheight; | |
467 | state = ALLOC_GROW_DEPTH; | |
468 | } else { | |
469 | /* Building up tree height */ | |
470 | state = ALLOC_GROW_HEIGHT; | |
471 | iblks = height - ip->i_height; | |
5af4e7a0 BM |
472 | branch_start = metapath_branch_start(mp); |
473 | iblks += (height - branch_start); | |
9b8c81d1 SW |
474 | } |
475 | } | |
476 | ||
477 | /* start of the second part of the function (state machine) */ | |
478 | ||
479 | blks = dblks + iblks; | |
480 | i = sheight; | |
481 | do { | |
09010978 | 482 | int error; |
9b8c81d1 | 483 | n = blks - alloced; |
09010978 SW |
484 | error = gfs2_alloc_block(ip, &bn, &n); |
485 | if (error) | |
486 | return error; | |
9b8c81d1 SW |
487 | alloced += n; |
488 | if (state != ALLOC_DATA || gfs2_is_jdata(ip)) | |
489 | gfs2_trans_add_unrevoke(sdp, bn, n); | |
490 | switch (state) { | |
491 | /* Growing height of tree */ | |
492 | case ALLOC_GROW_HEIGHT: | |
493 | if (i == 1) { | |
494 | ptr = (__be64 *)(dibh->b_data + | |
495 | sizeof(struct gfs2_dinode)); | |
496 | zero_bn = *ptr; | |
497 | } | |
498 | for (; i - 1 < height - ip->i_height && n > 0; i++, n--) | |
499 | gfs2_indirect_init(mp, ip->i_gl, i, 0, bn++); | |
500 | if (i - 1 == height - ip->i_height) { | |
501 | i--; | |
502 | gfs2_buffer_copy_tail(mp->mp_bh[i], | |
503 | sizeof(struct gfs2_meta_header), | |
504 | dibh, sizeof(struct gfs2_dinode)); | |
505 | gfs2_buffer_clear_tail(dibh, | |
506 | sizeof(struct gfs2_dinode) + | |
507 | sizeof(__be64)); | |
508 | ptr = (__be64 *)(mp->mp_bh[i]->b_data + | |
509 | sizeof(struct gfs2_meta_header)); | |
510 | *ptr = zero_bn; | |
511 | state = ALLOC_GROW_DEPTH; | |
5af4e7a0 | 512 | for(i = branch_start; i < height; i++) { |
9b8c81d1 SW |
513 | if (mp->mp_bh[i] == NULL) |
514 | break; | |
515 | brelse(mp->mp_bh[i]); | |
516 | mp->mp_bh[i] = NULL; | |
517 | } | |
5af4e7a0 | 518 | i = branch_start; |
9b8c81d1 SW |
519 | } |
520 | if (n == 0) | |
521 | break; | |
522 | /* Branching from existing tree */ | |
523 | case ALLOC_GROW_DEPTH: | |
524 | if (i > 1 && i < height) | |
525 | gfs2_trans_add_bh(ip->i_gl, mp->mp_bh[i-1], 1); | |
526 | for (; i < height && n > 0; i++, n--) | |
527 | gfs2_indirect_init(mp, ip->i_gl, i, | |
528 | mp->mp_list[i-1], bn++); | |
529 | if (i == height) | |
530 | state = ALLOC_DATA; | |
531 | if (n == 0) | |
532 | break; | |
533 | /* Tree complete, adding data blocks */ | |
534 | case ALLOC_DATA: | |
535 | BUG_ON(n > dblks); | |
536 | BUG_ON(mp->mp_bh[end_of_metadata] == NULL); | |
537 | gfs2_trans_add_bh(ip->i_gl, mp->mp_bh[end_of_metadata], 1); | |
538 | dblks = n; | |
539 | ptr = metapointer(end_of_metadata, mp); | |
540 | dblock = bn; | |
541 | while (n-- > 0) | |
542 | *ptr++ = cpu_to_be64(bn++); | |
543 | break; | |
544 | } | |
07ccb7bf | 545 | } while ((state != ALLOC_DATA) || !dblock); |
9b8c81d1 SW |
546 | |
547 | ip->i_height = height; | |
548 | gfs2_add_inode_blocks(&ip->i_inode, alloced); | |
549 | gfs2_dinode_out(ip, mp->mp_bh[0]->b_data); | |
550 | map_bh(bh_map, inode->i_sb, dblock); | |
551 | bh_map->b_size = dblks << inode->i_blkbits; | |
552 | set_buffer_new(bh_map); | |
553 | return 0; | |
554 | } | |
555 | ||
b3b94faa | 556 | /** |
4cf1ed81 | 557 | * gfs2_block_map - Map a block from an inode to a disk block |
fd88de56 | 558 | * @inode: The inode |
b3b94faa | 559 | * @lblock: The logical block number |
4cf1ed81 | 560 | * @bh_map: The bh to be mapped |
9b8c81d1 | 561 | * @create: True if its ok to alloc blocks to satify the request |
b3b94faa | 562 | * |
9b8c81d1 SW |
563 | * Sets buffer_mapped() if successful, sets buffer_boundary() if a |
564 | * read of metadata will be required before the next block can be | |
565 | * mapped. Sets buffer_new() if new blocks were allocated. | |
b3b94faa DT |
566 | * |
567 | * Returns: errno | |
568 | */ | |
569 | ||
e9e1ef2b BP |
570 | int gfs2_block_map(struct inode *inode, sector_t lblock, |
571 | struct buffer_head *bh_map, int create) | |
b3b94faa | 572 | { |
feaa7bba SW |
573 | struct gfs2_inode *ip = GFS2_I(inode); |
574 | struct gfs2_sbd *sdp = GFS2_SB(inode); | |
ecc30c79 | 575 | unsigned int bsize = sdp->sd_sb.sb_bsize; |
9b8c81d1 | 576 | const unsigned int maxlen = bh_map->b_size >> inode->i_blkbits; |
ecc30c79 | 577 | const u64 *arr = sdp->sd_heightsize; |
9b8c81d1 SW |
578 | __be64 *ptr; |
579 | u64 size; | |
580 | struct metapath mp; | |
581 | int ret; | |
582 | int eob; | |
583 | unsigned int len; | |
584 | struct buffer_head *bh; | |
585 | u8 height; | |
7276b3b0 | 586 | |
9b8c81d1 | 587 | BUG_ON(maxlen == 0); |
b3b94faa | 588 | |
dbac6710 | 589 | memset(mp.mp_bh, 0, sizeof(mp.mp_bh)); |
9b8c81d1 | 590 | bmap_lock(ip, create); |
4cf1ed81 SW |
591 | clear_buffer_mapped(bh_map); |
592 | clear_buffer_new(bh_map); | |
593 | clear_buffer_boundary(bh_map); | |
63997775 | 594 | trace_gfs2_bmap(ip, bh_map, lblock, create, 1); |
ecc30c79 SW |
595 | if (gfs2_is_dir(ip)) { |
596 | bsize = sdp->sd_jbsize; | |
597 | arr = sdp->sd_jheightsize; | |
598 | } | |
4cf1ed81 | 599 | |
9b8c81d1 SW |
600 | ret = gfs2_meta_inode_buffer(ip, &mp.mp_bh[0]); |
601 | if (ret) | |
602 | goto out; | |
b3b94faa | 603 | |
9b8c81d1 SW |
604 | height = ip->i_height; |
605 | size = (lblock + 1) * bsize; | |
606 | while (size > arr[height]) | |
607 | height++; | |
608 | find_metapath(sdp, lblock, &mp, height); | |
609 | ret = 1; | |
610 | if (height > ip->i_height || gfs2_is_stuffed(ip)) | |
611 | goto do_alloc; | |
612 | ret = lookup_metapath(ip, &mp); | |
613 | if (ret < 0) | |
614 | goto out; | |
615 | if (ret != ip->i_height) | |
616 | goto do_alloc; | |
617 | ptr = metapointer(ip->i_height - 1, &mp); | |
618 | if (*ptr == 0) | |
619 | goto do_alloc; | |
620 | map_bh(bh_map, inode->i_sb, be64_to_cpu(*ptr)); | |
621 | bh = mp.mp_bh[ip->i_height - 1]; | |
622 | len = gfs2_extent_length(bh->b_data, bh->b_size, ptr, maxlen, &eob); | |
623 | bh_map->b_size = (len << inode->i_blkbits); | |
624 | if (eob) | |
625 | set_buffer_boundary(bh_map); | |
626 | ret = 0; | |
627 | out: | |
628 | release_metapath(&mp); | |
63997775 | 629 | trace_gfs2_bmap(ip, bh_map, lblock, create, ret); |
9b8c81d1 SW |
630 | bmap_unlock(ip, create); |
631 | return ret; | |
30cbf189 | 632 | |
9b8c81d1 SW |
633 | do_alloc: |
634 | /* All allocations are done here, firstly check create flag */ | |
635 | if (!create) { | |
636 | BUG_ON(gfs2_is_stuffed(ip)); | |
637 | ret = 0; | |
638 | goto out; | |
b3b94faa | 639 | } |
9b8c81d1 SW |
640 | |
641 | /* At this point ret is the tree depth of already allocated blocks */ | |
642 | ret = gfs2_bmap_alloc(inode, lblock, bh_map, &mp, ret, height, maxlen); | |
643 | goto out; | |
fd88de56 SW |
644 | } |
645 | ||
941e6d7d SW |
646 | /* |
647 | * Deprecated: do not use in new code | |
648 | */ | |
fd88de56 SW |
649 | int gfs2_extent_map(struct inode *inode, u64 lblock, int *new, u64 *dblock, unsigned *extlen) |
650 | { | |
23591256 | 651 | struct buffer_head bh = { .b_state = 0, .b_blocknr = 0 }; |
7a6bbacb | 652 | int ret; |
fd88de56 SW |
653 | int create = *new; |
654 | ||
655 | BUG_ON(!extlen); | |
656 | BUG_ON(!dblock); | |
657 | BUG_ON(!new); | |
658 | ||
9b8c81d1 | 659 | bh.b_size = 1 << (inode->i_blkbits + (create ? 0 : 5)); |
e9e1ef2b | 660 | ret = gfs2_block_map(inode, lblock, &bh, create); |
7a6bbacb SW |
661 | *extlen = bh.b_size >> inode->i_blkbits; |
662 | *dblock = bh.b_blocknr; | |
663 | if (buffer_new(&bh)) | |
664 | *new = 1; | |
665 | else | |
666 | *new = 0; | |
667 | return ret; | |
b3b94faa DT |
668 | } |
669 | ||
670 | /** | |
671 | * recursive_scan - recursively scan through the end of a file | |
672 | * @ip: the inode | |
673 | * @dibh: the dinode buffer | |
674 | * @mp: the path through the metadata to the point to start | |
675 | * @height: the height the recursion is at | |
676 | * @block: the indirect block to look at | |
677 | * @first: 1 if this is the first block | |
678 | * @bc: the call to make for each piece of metadata | |
679 | * @data: data opaque to this function to pass to @bc | |
680 | * | |
681 | * When this is first called @height and @block should be zero and | |
682 | * @first should be 1. | |
683 | * | |
684 | * Returns: errno | |
685 | */ | |
686 | ||
687 | static int recursive_scan(struct gfs2_inode *ip, struct buffer_head *dibh, | |
688 | struct metapath *mp, unsigned int height, | |
cd915493 | 689 | u64 block, int first, block_call_t bc, |
b3b94faa DT |
690 | void *data) |
691 | { | |
feaa7bba | 692 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
b3b94faa | 693 | struct buffer_head *bh = NULL; |
b44b84d7 | 694 | __be64 *top, *bottom; |
cd915493 | 695 | u64 bn; |
b3b94faa DT |
696 | int error; |
697 | int mh_size = sizeof(struct gfs2_meta_header); | |
698 | ||
699 | if (!height) { | |
700 | error = gfs2_meta_inode_buffer(ip, &bh); | |
701 | if (error) | |
702 | return error; | |
703 | dibh = bh; | |
704 | ||
b44b84d7 AV |
705 | top = (__be64 *)(bh->b_data + sizeof(struct gfs2_dinode)) + mp->mp_list[0]; |
706 | bottom = (__be64 *)(bh->b_data + sizeof(struct gfs2_dinode)) + sdp->sd_diptrs; | |
b3b94faa DT |
707 | } else { |
708 | error = gfs2_meta_indirect_buffer(ip, height, block, 0, &bh); | |
709 | if (error) | |
710 | return error; | |
711 | ||
b44b84d7 | 712 | top = (__be64 *)(bh->b_data + mh_size) + |
c5392124 | 713 | (first ? mp->mp_list[height] : 0); |
b3b94faa | 714 | |
b44b84d7 | 715 | bottom = (__be64 *)(bh->b_data + mh_size) + sdp->sd_inptrs; |
b3b94faa DT |
716 | } |
717 | ||
718 | error = bc(ip, dibh, bh, top, bottom, height, data); | |
719 | if (error) | |
720 | goto out; | |
721 | ||
ecc30c79 | 722 | if (height < ip->i_height - 1) |
b3b94faa DT |
723 | for (; top < bottom; top++, first = 0) { |
724 | if (!*top) | |
725 | continue; | |
726 | ||
727 | bn = be64_to_cpu(*top); | |
728 | ||
729 | error = recursive_scan(ip, dibh, mp, height + 1, bn, | |
730 | first, bc, data); | |
731 | if (error) | |
732 | break; | |
733 | } | |
734 | ||
a91ea69f | 735 | out: |
b3b94faa | 736 | brelse(bh); |
b3b94faa DT |
737 | return error; |
738 | } | |
739 | ||
740 | /** | |
741 | * do_strip - Look for a layer a particular layer of the file and strip it off | |
742 | * @ip: the inode | |
743 | * @dibh: the dinode buffer | |
744 | * @bh: A buffer of pointers | |
745 | * @top: The first pointer in the buffer | |
746 | * @bottom: One more than the last pointer | |
747 | * @height: the height this buffer is at | |
748 | * @data: a pointer to a struct strip_mine | |
749 | * | |
750 | * Returns: errno | |
751 | */ | |
752 | ||
753 | static int do_strip(struct gfs2_inode *ip, struct buffer_head *dibh, | |
b44b84d7 | 754 | struct buffer_head *bh, __be64 *top, __be64 *bottom, |
b3b94faa DT |
755 | unsigned int height, void *data) |
756 | { | |
feaa7bba SW |
757 | struct strip_mine *sm = data; |
758 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); | |
b3b94faa | 759 | struct gfs2_rgrp_list rlist; |
cd915493 | 760 | u64 bn, bstart; |
4c16c36a | 761 | u32 blen, btotal; |
b44b84d7 | 762 | __be64 *p; |
b3b94faa DT |
763 | unsigned int rg_blocks = 0; |
764 | int metadata; | |
765 | unsigned int revokes = 0; | |
766 | int x; | |
e06dfc49 | 767 | int error = 0; |
b3b94faa DT |
768 | |
769 | if (!*top) | |
770 | sm->sm_first = 0; | |
771 | ||
772 | if (height != sm->sm_height) | |
773 | return 0; | |
774 | ||
775 | if (sm->sm_first) { | |
776 | top++; | |
777 | sm->sm_first = 0; | |
778 | } | |
779 | ||
ecc30c79 | 780 | metadata = (height != ip->i_height - 1); |
b3b94faa DT |
781 | if (metadata) |
782 | revokes = (height) ? sdp->sd_inptrs : sdp->sd_diptrs; | |
783 | ||
086d8334 BM |
784 | if (ip != GFS2_I(sdp->sd_rindex)) |
785 | error = gfs2_rindex_hold(sdp, &ip->i_alloc->al_ri_gh); | |
786 | else if (!sdp->sd_rgrps) | |
787 | error = gfs2_ri_update(ip); | |
788 | ||
b3b94faa DT |
789 | if (error) |
790 | return error; | |
791 | ||
792 | memset(&rlist, 0, sizeof(struct gfs2_rgrp_list)); | |
793 | bstart = 0; | |
794 | blen = 0; | |
795 | ||
796 | for (p = top; p < bottom; p++) { | |
797 | if (!*p) | |
798 | continue; | |
799 | ||
800 | bn = be64_to_cpu(*p); | |
801 | ||
802 | if (bstart + blen == bn) | |
803 | blen++; | |
804 | else { | |
805 | if (bstart) | |
806 | gfs2_rlist_add(sdp, &rlist, bstart); | |
807 | ||
808 | bstart = bn; | |
809 | blen = 1; | |
810 | } | |
811 | } | |
812 | ||
813 | if (bstart) | |
814 | gfs2_rlist_add(sdp, &rlist, bstart); | |
815 | else | |
816 | goto out; /* Nothing to do */ | |
817 | ||
fe6c991c | 818 | gfs2_rlist_alloc(&rlist, LM_ST_EXCLUSIVE); |
b3b94faa DT |
819 | |
820 | for (x = 0; x < rlist.rl_rgrps; x++) { | |
821 | struct gfs2_rgrpd *rgd; | |
5c676f6d | 822 | rgd = rlist.rl_ghs[x].gh_gl->gl_object; |
bb8d8a6f | 823 | rg_blocks += rgd->rd_length; |
b3b94faa DT |
824 | } |
825 | ||
826 | error = gfs2_glock_nq_m(rlist.rl_rgrps, rlist.rl_ghs); | |
827 | if (error) | |
828 | goto out_rlist; | |
829 | ||
830 | error = gfs2_trans_begin(sdp, rg_blocks + RES_DINODE + | |
831 | RES_INDIRECT + RES_STATFS + RES_QUOTA, | |
832 | revokes); | |
833 | if (error) | |
834 | goto out_rg_gunlock; | |
835 | ||
836 | down_write(&ip->i_rw_mutex); | |
837 | ||
d4e9c4c3 SW |
838 | gfs2_trans_add_bh(ip->i_gl, dibh, 1); |
839 | gfs2_trans_add_bh(ip->i_gl, bh, 1); | |
b3b94faa DT |
840 | |
841 | bstart = 0; | |
842 | blen = 0; | |
4c16c36a | 843 | btotal = 0; |
b3b94faa DT |
844 | |
845 | for (p = top; p < bottom; p++) { | |
846 | if (!*p) | |
847 | continue; | |
848 | ||
849 | bn = be64_to_cpu(*p); | |
850 | ||
851 | if (bstart + blen == bn) | |
852 | blen++; | |
853 | else { | |
854 | if (bstart) { | |
855 | if (metadata) | |
4c16c36a | 856 | __gfs2_free_meta(ip, bstart, blen); |
b3b94faa | 857 | else |
4c16c36a BP |
858 | __gfs2_free_data(ip, bstart, blen); |
859 | ||
860 | btotal += blen; | |
b3b94faa DT |
861 | } |
862 | ||
863 | bstart = bn; | |
864 | blen = 1; | |
865 | } | |
866 | ||
867 | *p = 0; | |
77658aad | 868 | gfs2_add_inode_blocks(&ip->i_inode, -1); |
b3b94faa DT |
869 | } |
870 | if (bstart) { | |
871 | if (metadata) | |
4c16c36a | 872 | __gfs2_free_meta(ip, bstart, blen); |
b3b94faa | 873 | else |
4c16c36a BP |
874 | __gfs2_free_data(ip, bstart, blen); |
875 | ||
876 | btotal += blen; | |
b3b94faa DT |
877 | } |
878 | ||
4c16c36a BP |
879 | gfs2_statfs_change(sdp, 0, +btotal, 0); |
880 | gfs2_quota_change(ip, -(s64)btotal, ip->i_inode.i_uid, | |
881 | ip->i_inode.i_gid); | |
882 | ||
4bd91ba1 | 883 | ip->i_inode.i_mtime = ip->i_inode.i_ctime = CURRENT_TIME; |
b3b94faa | 884 | |
539e5d6b | 885 | gfs2_dinode_out(ip, dibh->b_data); |
b3b94faa DT |
886 | |
887 | up_write(&ip->i_rw_mutex); | |
888 | ||
889 | gfs2_trans_end(sdp); | |
890 | ||
a91ea69f | 891 | out_rg_gunlock: |
b3b94faa | 892 | gfs2_glock_dq_m(rlist.rl_rgrps, rlist.rl_ghs); |
a91ea69f | 893 | out_rlist: |
b3b94faa | 894 | gfs2_rlist_free(&rlist); |
a91ea69f | 895 | out: |
086d8334 BM |
896 | if (ip != GFS2_I(sdp->sd_rindex)) |
897 | gfs2_glock_dq_uninit(&ip->i_alloc->al_ri_gh); | |
b3b94faa DT |
898 | return error; |
899 | } | |
900 | ||
ba7f7290 SW |
901 | /** |
902 | * gfs2_block_truncate_page - Deal with zeroing out data for truncate | |
903 | * | |
904 | * This is partly borrowed from ext3. | |
905 | */ | |
ff8f33c8 | 906 | static int gfs2_block_truncate_page(struct address_space *mapping, loff_t from) |
ba7f7290 SW |
907 | { |
908 | struct inode *inode = mapping->host; | |
909 | struct gfs2_inode *ip = GFS2_I(inode); | |
ba7f7290 SW |
910 | unsigned long index = from >> PAGE_CACHE_SHIFT; |
911 | unsigned offset = from & (PAGE_CACHE_SIZE-1); | |
912 | unsigned blocksize, iblock, length, pos; | |
913 | struct buffer_head *bh; | |
914 | struct page *page; | |
ba7f7290 SW |
915 | int err; |
916 | ||
917 | page = grab_cache_page(mapping, index); | |
918 | if (!page) | |
919 | return 0; | |
920 | ||
921 | blocksize = inode->i_sb->s_blocksize; | |
922 | length = blocksize - (offset & (blocksize - 1)); | |
923 | iblock = index << (PAGE_CACHE_SHIFT - inode->i_sb->s_blocksize_bits); | |
924 | ||
925 | if (!page_has_buffers(page)) | |
926 | create_empty_buffers(page, blocksize, 0); | |
927 | ||
928 | /* Find the buffer that contains "offset" */ | |
929 | bh = page_buffers(page); | |
930 | pos = blocksize; | |
931 | while (offset >= pos) { | |
932 | bh = bh->b_this_page; | |
933 | iblock++; | |
934 | pos += blocksize; | |
935 | } | |
936 | ||
937 | err = 0; | |
938 | ||
939 | if (!buffer_mapped(bh)) { | |
e9e1ef2b | 940 | gfs2_block_map(inode, iblock, bh, 0); |
ba7f7290 SW |
941 | /* unmapped? It's a hole - nothing to do */ |
942 | if (!buffer_mapped(bh)) | |
943 | goto unlock; | |
944 | } | |
945 | ||
946 | /* Ok, it's mapped. Make sure it's up-to-date */ | |
947 | if (PageUptodate(page)) | |
948 | set_buffer_uptodate(bh); | |
949 | ||
950 | if (!buffer_uptodate(bh)) { | |
951 | err = -EIO; | |
952 | ll_rw_block(READ, 1, &bh); | |
953 | wait_on_buffer(bh); | |
954 | /* Uhhuh. Read error. Complain and punt. */ | |
955 | if (!buffer_uptodate(bh)) | |
956 | goto unlock; | |
1875f2f3 | 957 | err = 0; |
ba7f7290 SW |
958 | } |
959 | ||
bf36a713 | 960 | if (!gfs2_is_writeback(ip)) |
ba7f7290 SW |
961 | gfs2_trans_add_bh(ip->i_gl, bh, 0); |
962 | ||
eebd2aa3 | 963 | zero_user(page, offset, length); |
40bc9a27 | 964 | mark_buffer_dirty(bh); |
ba7f7290 SW |
965 | unlock: |
966 | unlock_page(page); | |
967 | page_cache_release(page); | |
968 | return err; | |
969 | } | |
970 | ||
ff8f33c8 | 971 | static int trunc_start(struct inode *inode, u64 oldsize, u64 newsize) |
b3b94faa | 972 | { |
ff8f33c8 SW |
973 | struct gfs2_inode *ip = GFS2_I(inode); |
974 | struct gfs2_sbd *sdp = GFS2_SB(inode); | |
975 | struct address_space *mapping = inode->i_mapping; | |
b3b94faa DT |
976 | struct buffer_head *dibh; |
977 | int journaled = gfs2_is_jdata(ip); | |
978 | int error; | |
979 | ||
980 | error = gfs2_trans_begin(sdp, | |
c5392124 | 981 | RES_DINODE + (journaled ? RES_JDATA : 0), 0); |
b3b94faa DT |
982 | if (error) |
983 | return error; | |
984 | ||
985 | error = gfs2_meta_inode_buffer(ip, &dibh); | |
986 | if (error) | |
987 | goto out; | |
988 | ||
ff8f33c8 SW |
989 | gfs2_trans_add_bh(ip->i_gl, dibh, 1); |
990 | ||
b3b94faa | 991 | if (gfs2_is_stuffed(ip)) { |
ff8f33c8 | 992 | gfs2_buffer_clear_tail(dibh, sizeof(struct gfs2_dinode) + newsize); |
b3b94faa | 993 | } else { |
ff8f33c8 SW |
994 | if (newsize & (u64)(sdp->sd_sb.sb_bsize - 1)) { |
995 | error = gfs2_block_truncate_page(mapping, newsize); | |
996 | if (error) | |
997 | goto out_brelse; | |
b3b94faa | 998 | } |
ff8f33c8 | 999 | ip->i_diskflags |= GFS2_DIF_TRUNC_IN_PROG; |
b3b94faa DT |
1000 | } |
1001 | ||
ff8f33c8 | 1002 | i_size_write(inode, newsize); |
ff8f33c8 SW |
1003 | ip->i_inode.i_mtime = ip->i_inode.i_ctime = CURRENT_TIME; |
1004 | gfs2_dinode_out(ip, dibh->b_data); | |
b3b94faa | 1005 | |
ff8f33c8 SW |
1006 | truncate_pagecache(inode, oldsize, newsize); |
1007 | out_brelse: | |
1008 | brelse(dibh); | |
a91ea69f | 1009 | out: |
b3b94faa | 1010 | gfs2_trans_end(sdp); |
b3b94faa DT |
1011 | return error; |
1012 | } | |
1013 | ||
cd915493 | 1014 | static int trunc_dealloc(struct gfs2_inode *ip, u64 size) |
b3b94faa | 1015 | { |
9b8c81d1 | 1016 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
ecc30c79 | 1017 | unsigned int height = ip->i_height; |
cd915493 | 1018 | u64 lblock; |
b3b94faa DT |
1019 | struct metapath mp; |
1020 | int error; | |
1021 | ||
1022 | if (!size) | |
1023 | lblock = 0; | |
18ec7d5c | 1024 | else |
9b8c81d1 | 1025 | lblock = (size - 1) >> sdp->sd_sb.sb_bsize_shift; |
b3b94faa | 1026 | |
9b8c81d1 | 1027 | find_metapath(sdp, lblock, &mp, ip->i_height); |
182fe5ab CG |
1028 | if (!gfs2_alloc_get(ip)) |
1029 | return -ENOMEM; | |
b3b94faa DT |
1030 | |
1031 | error = gfs2_quota_hold(ip, NO_QUOTA_CHANGE, NO_QUOTA_CHANGE); | |
1032 | if (error) | |
1033 | goto out; | |
1034 | ||
1035 | while (height--) { | |
1036 | struct strip_mine sm; | |
1037 | sm.sm_first = !!size; | |
1038 | sm.sm_height = height; | |
1039 | ||
1040 | error = recursive_scan(ip, NULL, &mp, 0, 0, 1, do_strip, &sm); | |
1041 | if (error) | |
1042 | break; | |
1043 | } | |
1044 | ||
1045 | gfs2_quota_unhold(ip); | |
1046 | ||
a91ea69f | 1047 | out: |
b3b94faa DT |
1048 | gfs2_alloc_put(ip); |
1049 | return error; | |
1050 | } | |
1051 | ||
1052 | static int trunc_end(struct gfs2_inode *ip) | |
1053 | { | |
feaa7bba | 1054 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
b3b94faa DT |
1055 | struct buffer_head *dibh; |
1056 | int error; | |
1057 | ||
1058 | error = gfs2_trans_begin(sdp, RES_DINODE, 0); | |
1059 | if (error) | |
1060 | return error; | |
1061 | ||
1062 | down_write(&ip->i_rw_mutex); | |
1063 | ||
1064 | error = gfs2_meta_inode_buffer(ip, &dibh); | |
1065 | if (error) | |
1066 | goto out; | |
1067 | ||
a2e0f799 | 1068 | if (!i_size_read(&ip->i_inode)) { |
ecc30c79 | 1069 | ip->i_height = 0; |
ce276b06 | 1070 | ip->i_goal = ip->i_no_addr; |
b3b94faa DT |
1071 | gfs2_buffer_clear_tail(dibh, sizeof(struct gfs2_dinode)); |
1072 | } | |
4bd91ba1 | 1073 | ip->i_inode.i_mtime = ip->i_inode.i_ctime = CURRENT_TIME; |
383f01fb | 1074 | ip->i_diskflags &= ~GFS2_DIF_TRUNC_IN_PROG; |
b3b94faa | 1075 | |
d4e9c4c3 | 1076 | gfs2_trans_add_bh(ip->i_gl, dibh, 1); |
539e5d6b | 1077 | gfs2_dinode_out(ip, dibh->b_data); |
b3b94faa DT |
1078 | brelse(dibh); |
1079 | ||
a91ea69f | 1080 | out: |
b3b94faa | 1081 | up_write(&ip->i_rw_mutex); |
b3b94faa | 1082 | gfs2_trans_end(sdp); |
b3b94faa DT |
1083 | return error; |
1084 | } | |
1085 | ||
1086 | /** | |
1087 | * do_shrink - make a file smaller | |
ff8f33c8 SW |
1088 | * @inode: the inode |
1089 | * @oldsize: the current inode size | |
1090 | * @newsize: the size to make the file | |
b3b94faa | 1091 | * |
ff8f33c8 SW |
1092 | * Called with an exclusive lock on @inode. The @size must |
1093 | * be equal to or smaller than the current inode size. | |
b3b94faa DT |
1094 | * |
1095 | * Returns: errno | |
1096 | */ | |
1097 | ||
ff8f33c8 | 1098 | static int do_shrink(struct inode *inode, u64 oldsize, u64 newsize) |
b3b94faa | 1099 | { |
ff8f33c8 | 1100 | struct gfs2_inode *ip = GFS2_I(inode); |
b3b94faa DT |
1101 | int error; |
1102 | ||
ff8f33c8 | 1103 | error = trunc_start(inode, oldsize, newsize); |
b3b94faa DT |
1104 | if (error < 0) |
1105 | return error; | |
ff8f33c8 | 1106 | if (gfs2_is_stuffed(ip)) |
b3b94faa DT |
1107 | return 0; |
1108 | ||
ff8f33c8 SW |
1109 | error = trunc_dealloc(ip, newsize); |
1110 | if (error == 0) | |
b3b94faa DT |
1111 | error = trunc_end(ip); |
1112 | ||
1113 | return error; | |
1114 | } | |
1115 | ||
ff8f33c8 | 1116 | void gfs2_trim_blocks(struct inode *inode) |
a13b8c5f | 1117 | { |
ff8f33c8 SW |
1118 | u64 size = inode->i_size; |
1119 | int ret; | |
1120 | ||
1121 | ret = do_shrink(inode, size, size); | |
1122 | WARN_ON(ret != 0); | |
1123 | } | |
1124 | ||
1125 | /** | |
1126 | * do_grow - Touch and update inode size | |
1127 | * @inode: The inode | |
1128 | * @size: The new size | |
1129 | * | |
1130 | * This function updates the timestamps on the inode and | |
1131 | * may also increase the size of the inode. This function | |
1132 | * must not be called with @size any smaller than the current | |
1133 | * inode size. | |
1134 | * | |
1135 | * Although it is not strictly required to unstuff files here, | |
1136 | * earlier versions of GFS2 have a bug in the stuffed file reading | |
1137 | * code which will result in a buffer overrun if the size is larger | |
1138 | * than the max stuffed file size. In order to prevent this from | |
1139 | * occuring, such files are unstuffed, but in other cases we can | |
1140 | * just update the inode size directly. | |
1141 | * | |
1142 | * Returns: 0 on success, or -ve on error | |
1143 | */ | |
1144 | ||
1145 | static int do_grow(struct inode *inode, u64 size) | |
1146 | { | |
1147 | struct gfs2_inode *ip = GFS2_I(inode); | |
1148 | struct gfs2_sbd *sdp = GFS2_SB(inode); | |
a13b8c5f | 1149 | struct buffer_head *dibh; |
ff8f33c8 | 1150 | struct gfs2_alloc *al = NULL; |
a13b8c5f WC |
1151 | int error; |
1152 | ||
ff8f33c8 SW |
1153 | if (gfs2_is_stuffed(ip) && |
1154 | (size > (sdp->sd_sb.sb_bsize - sizeof(struct gfs2_dinode)))) { | |
1155 | al = gfs2_alloc_get(ip); | |
1156 | if (al == NULL) | |
1157 | return -ENOMEM; | |
1158 | ||
1159 | error = gfs2_quota_lock_check(ip); | |
1160 | if (error) | |
1161 | goto do_grow_alloc_put; | |
1162 | ||
1163 | al->al_requested = 1; | |
1164 | error = gfs2_inplace_reserve(ip); | |
1165 | if (error) | |
1166 | goto do_grow_qunlock; | |
1167 | } | |
1168 | ||
bf97b673 | 1169 | error = gfs2_trans_begin(sdp, RES_DINODE + RES_STATFS + RES_RG_BIT, 0); |
a13b8c5f | 1170 | if (error) |
ff8f33c8 | 1171 | goto do_grow_release; |
a13b8c5f | 1172 | |
ff8f33c8 SW |
1173 | if (al) { |
1174 | error = gfs2_unstuff_dinode(ip, NULL); | |
1175 | if (error) | |
1176 | goto do_end_trans; | |
1177 | } | |
a13b8c5f WC |
1178 | |
1179 | error = gfs2_meta_inode_buffer(ip, &dibh); | |
1180 | if (error) | |
ff8f33c8 | 1181 | goto do_end_trans; |
a13b8c5f | 1182 | |
ff8f33c8 | 1183 | i_size_write(inode, size); |
a13b8c5f WC |
1184 | ip->i_inode.i_mtime = ip->i_inode.i_ctime = CURRENT_TIME; |
1185 | gfs2_trans_add_bh(ip->i_gl, dibh, 1); | |
1186 | gfs2_dinode_out(ip, dibh->b_data); | |
1187 | brelse(dibh); | |
1188 | ||
ff8f33c8 | 1189 | do_end_trans: |
a13b8c5f | 1190 | gfs2_trans_end(sdp); |
ff8f33c8 SW |
1191 | do_grow_release: |
1192 | if (al) { | |
1193 | gfs2_inplace_release(ip); | |
1194 | do_grow_qunlock: | |
1195 | gfs2_quota_unlock(ip); | |
1196 | do_grow_alloc_put: | |
1197 | gfs2_alloc_put(ip); | |
1198 | } | |
a13b8c5f WC |
1199 | return error; |
1200 | } | |
1201 | ||
b3b94faa | 1202 | /** |
ff8f33c8 SW |
1203 | * gfs2_setattr_size - make a file a given size |
1204 | * @inode: the inode | |
1205 | * @newsize: the size to make the file | |
b3b94faa | 1206 | * |
ff8f33c8 SW |
1207 | * The file size can grow, shrink, or stay the same size. This |
1208 | * is called holding i_mutex and an exclusive glock on the inode | |
1209 | * in question. | |
b3b94faa DT |
1210 | * |
1211 | * Returns: errno | |
1212 | */ | |
1213 | ||
ff8f33c8 | 1214 | int gfs2_setattr_size(struct inode *inode, u64 newsize) |
b3b94faa | 1215 | { |
ff8f33c8 SW |
1216 | int ret; |
1217 | u64 oldsize; | |
b3b94faa | 1218 | |
ff8f33c8 | 1219 | BUG_ON(!S_ISREG(inode->i_mode)); |
b3b94faa | 1220 | |
ff8f33c8 SW |
1221 | ret = inode_newsize_ok(inode, newsize); |
1222 | if (ret) | |
1223 | return ret; | |
b3b94faa | 1224 | |
ff8f33c8 SW |
1225 | oldsize = inode->i_size; |
1226 | if (newsize >= oldsize) | |
1227 | return do_grow(inode, newsize); | |
1228 | ||
1229 | return do_shrink(inode, oldsize, newsize); | |
b3b94faa DT |
1230 | } |
1231 | ||
1232 | int gfs2_truncatei_resume(struct gfs2_inode *ip) | |
1233 | { | |
1234 | int error; | |
a2e0f799 | 1235 | error = trunc_dealloc(ip, i_size_read(&ip->i_inode)); |
b3b94faa DT |
1236 | if (!error) |
1237 | error = trunc_end(ip); | |
1238 | return error; | |
1239 | } | |
1240 | ||
1241 | int gfs2_file_dealloc(struct gfs2_inode *ip) | |
1242 | { | |
1243 | return trunc_dealloc(ip, 0); | |
1244 | } | |
1245 | ||
b3b94faa DT |
1246 | /** |
1247 | * gfs2_write_alloc_required - figure out if a write will require an allocation | |
1248 | * @ip: the file being written to | |
1249 | * @offset: the offset to write to | |
1250 | * @len: the number of bytes being written | |
b3b94faa | 1251 | * |
461cb419 | 1252 | * Returns: 1 if an alloc is required, 0 otherwise |
b3b94faa DT |
1253 | */ |
1254 | ||
cd915493 | 1255 | int gfs2_write_alloc_required(struct gfs2_inode *ip, u64 offset, |
461cb419 | 1256 | unsigned int len) |
b3b94faa | 1257 | { |
feaa7bba | 1258 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
941e6d7d SW |
1259 | struct buffer_head bh; |
1260 | unsigned int shift; | |
1261 | u64 lblock, lblock_stop, size; | |
7ed122e4 | 1262 | u64 end_of_file; |
b3b94faa | 1263 | |
b3b94faa DT |
1264 | if (!len) |
1265 | return 0; | |
1266 | ||
1267 | if (gfs2_is_stuffed(ip)) { | |
1268 | if (offset + len > | |
1269 | sdp->sd_sb.sb_bsize - sizeof(struct gfs2_dinode)) | |
461cb419 | 1270 | return 1; |
b3b94faa DT |
1271 | return 0; |
1272 | } | |
1273 | ||
941e6d7d | 1274 | shift = sdp->sd_sb.sb_bsize_shift; |
7ed122e4 | 1275 | BUG_ON(gfs2_is_dir(ip)); |
a2e0f799 | 1276 | end_of_file = (i_size_read(&ip->i_inode) + sdp->sd_sb.sb_bsize - 1) >> shift; |
7ed122e4 SW |
1277 | lblock = offset >> shift; |
1278 | lblock_stop = (offset + len + sdp->sd_sb.sb_bsize - 1) >> shift; | |
1279 | if (lblock_stop > end_of_file) | |
461cb419 | 1280 | return 1; |
b3b94faa | 1281 | |
941e6d7d SW |
1282 | size = (lblock_stop - lblock) << shift; |
1283 | do { | |
1284 | bh.b_state = 0; | |
1285 | bh.b_size = size; | |
1286 | gfs2_block_map(&ip->i_inode, lblock, &bh, 0); | |
1287 | if (!buffer_mapped(&bh)) | |
461cb419 | 1288 | return 1; |
941e6d7d SW |
1289 | size -= bh.b_size; |
1290 | lblock += (bh.b_size >> ip->i_inode.i_blkbits); | |
1291 | } while(size > 0); | |
b3b94faa DT |
1292 | |
1293 | return 0; | |
1294 | } | |
1295 |