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