]>
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 | ||
10 | /* | |
61e085a8 SW |
11 | * Implements Extendible Hashing as described in: |
12 | * "Extendible Hashing" by Fagin, et al in | |
13 | * __ACM Trans. on Database Systems__, Sept 1979. | |
14 | * | |
15 | * | |
16 | * Here's the layout of dirents which is essentially the same as that of ext2 | |
17 | * within a single block. The field de_name_len is the number of bytes | |
18 | * actually required for the name (no null terminator). The field de_rec_len | |
19 | * is the number of bytes allocated to the dirent. The offset of the next | |
20 | * dirent in the block is (dirent + dirent->de_rec_len). When a dirent is | |
21 | * deleted, the preceding dirent inherits its allocated space, ie | |
22 | * prev->de_rec_len += deleted->de_rec_len. Since the next dirent is obtained | |
23 | * by adding de_rec_len to the current dirent, this essentially causes the | |
24 | * deleted dirent to get jumped over when iterating through all the dirents. | |
25 | * | |
26 | * When deleting the first dirent in a block, there is no previous dirent so | |
27 | * the field de_ino is set to zero to designate it as deleted. When allocating | |
28 | * a dirent, gfs2_dirent_alloc iterates through the dirents in a block. If the | |
29 | * first dirent has (de_ino == 0) and de_rec_len is large enough, this first | |
30 | * dirent is allocated. Otherwise it must go through all the 'used' dirents | |
31 | * searching for one in which the amount of total space minus the amount of | |
32 | * used space will provide enough space for the new dirent. | |
33 | * | |
34 | * There are two types of blocks in which dirents reside. In a stuffed dinode, | |
35 | * the dirents begin at offset sizeof(struct gfs2_dinode) from the beginning of | |
36 | * the block. In leaves, they begin at offset sizeof(struct gfs2_leaf) from the | |
37 | * beginning of the leaf block. The dirents reside in leaves when | |
38 | * | |
383f01fb | 39 | * dip->i_diskflags & GFS2_DIF_EXHASH is true |
61e085a8 SW |
40 | * |
41 | * Otherwise, the dirents are "linear", within a single stuffed dinode block. | |
42 | * | |
43 | * When the dirents are in leaves, the actual contents of the directory file are | |
44 | * used as an array of 64-bit block pointers pointing to the leaf blocks. The | |
45 | * dirents are NOT in the directory file itself. There can be more than one | |
46 | * block pointer in the array that points to the same leaf. In fact, when a | |
47 | * directory is first converted from linear to exhash, all of the pointers | |
48 | * point to the same leaf. | |
49 | * | |
50 | * When a leaf is completely full, the size of the hash table can be | |
51 | * doubled unless it is already at the maximum size which is hard coded into | |
52 | * GFS2_DIR_MAX_DEPTH. After that, leaves are chained together in a linked list, | |
53 | * but never before the maximum hash table size has been reached. | |
54 | */ | |
b3b94faa | 55 | |
d77d1b58 JP |
56 | #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt |
57 | ||
b3b94faa DT |
58 | #include <linux/slab.h> |
59 | #include <linux/spinlock.h> | |
b3b94faa DT |
60 | #include <linux/buffer_head.h> |
61 | #include <linux/sort.h> | |
5c676f6d | 62 | #include <linux/gfs2_ondisk.h> |
71b86f56 | 63 | #include <linux/crc32.h> |
fe1bdedc | 64 | #include <linux/vmalloc.h> |
b3b94faa DT |
65 | |
66 | #include "gfs2.h" | |
5c676f6d | 67 | #include "incore.h" |
b3b94faa DT |
68 | #include "dir.h" |
69 | #include "glock.h" | |
70 | #include "inode.h" | |
b3b94faa DT |
71 | #include "meta_io.h" |
72 | #include "quota.h" | |
73 | #include "rgrp.h" | |
74 | #include "trans.h" | |
e13940ba | 75 | #include "bmap.h" |
5c676f6d | 76 | #include "util.h" |
b3b94faa DT |
77 | |
78 | #define IS_LEAF 1 /* Hashed (leaf) directory */ | |
79 | #define IS_DINODE 2 /* Linear (stuffed dinode block) directory */ | |
80 | ||
dfe4d34b BP |
81 | #define MAX_RA_BLOCKS 32 /* max read-ahead blocks */ |
82 | ||
cd915493 SW |
83 | #define gfs2_disk_hash2offset(h) (((u64)(h)) >> 1) |
84 | #define gfs2_dir_offset2hash(p) ((u32)(((u64)(p)) << 1)) | |
b3b94faa | 85 | |
8d123585 SW |
86 | struct qstr gfs2_qdot __read_mostly; |
87 | struct qstr gfs2_qdotdot __read_mostly; | |
88 | ||
2bdbc5d7 SW |
89 | typedef int (*gfs2_dscan_t)(const struct gfs2_dirent *dent, |
90 | const struct qstr *name, void *opaque); | |
b3b94faa | 91 | |
cd915493 | 92 | int gfs2_dir_get_new_buffer(struct gfs2_inode *ip, u64 block, |
61e085a8 | 93 | struct buffer_head **bhp) |
e13940ba SW |
94 | { |
95 | struct buffer_head *bh; | |
e13940ba | 96 | |
61e085a8 | 97 | bh = gfs2_meta_new(ip->i_gl, block); |
350a9b0a | 98 | gfs2_trans_add_meta(ip->i_gl, bh); |
61e085a8 SW |
99 | gfs2_metatype_set(bh, GFS2_METATYPE_JD, GFS2_FORMAT_JD); |
100 | gfs2_buffer_clear_tail(bh, sizeof(struct gfs2_meta_header)); | |
e13940ba SW |
101 | *bhp = bh; |
102 | return 0; | |
103 | } | |
104 | ||
cd915493 | 105 | static int gfs2_dir_get_existing_buffer(struct gfs2_inode *ip, u64 block, |
61e085a8 SW |
106 | struct buffer_head **bhp) |
107 | { | |
108 | struct buffer_head *bh; | |
109 | int error; | |
e13940ba | 110 | |
7276b3b0 | 111 | error = gfs2_meta_read(ip->i_gl, block, DIO_WAIT, &bh); |
61e085a8 SW |
112 | if (error) |
113 | return error; | |
feaa7bba | 114 | if (gfs2_metatype_check(GFS2_SB(&ip->i_inode), bh, GFS2_METATYPE_JD)) { |
61e085a8 SW |
115 | brelse(bh); |
116 | return -EIO; | |
117 | } | |
118 | *bhp = bh; | |
119 | return 0; | |
120 | } | |
e13940ba SW |
121 | |
122 | static int gfs2_dir_write_stuffed(struct gfs2_inode *ip, const char *buf, | |
123 | unsigned int offset, unsigned int size) | |
e13940ba SW |
124 | { |
125 | struct buffer_head *dibh; | |
126 | int error; | |
127 | ||
128 | error = gfs2_meta_inode_buffer(ip, &dibh); | |
129 | if (error) | |
130 | return error; | |
131 | ||
350a9b0a | 132 | gfs2_trans_add_meta(ip->i_gl, dibh); |
c752666c | 133 | memcpy(dibh->b_data + offset + sizeof(struct gfs2_dinode), buf, size); |
a2e0f799 SW |
134 | if (ip->i_inode.i_size < offset + size) |
135 | i_size_write(&ip->i_inode, offset + size); | |
4bd91ba1 | 136 | ip->i_inode.i_mtime = ip->i_inode.i_ctime = CURRENT_TIME; |
539e5d6b | 137 | gfs2_dinode_out(ip, dibh->b_data); |
e13940ba SW |
138 | |
139 | brelse(dibh); | |
140 | ||
141 | return size; | |
142 | } | |
143 | ||
144 | ||
145 | ||
146 | /** | |
147 | * gfs2_dir_write_data - Write directory information to the inode | |
148 | * @ip: The GFS2 inode | |
149 | * @buf: The buffer containing information to be written | |
150 | * @offset: The file offset to start writing at | |
151 | * @size: The amount of data to write | |
152 | * | |
153 | * Returns: The number of bytes correctly written or error code | |
154 | */ | |
155 | static int gfs2_dir_write_data(struct gfs2_inode *ip, const char *buf, | |
cd915493 | 156 | u64 offset, unsigned int size) |
e13940ba | 157 | { |
feaa7bba | 158 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
e13940ba | 159 | struct buffer_head *dibh; |
cd915493 SW |
160 | u64 lblock, dblock; |
161 | u32 extlen = 0; | |
e13940ba SW |
162 | unsigned int o; |
163 | int copied = 0; | |
164 | int error = 0; | |
9b8c81d1 | 165 | int new = 0; |
e13940ba SW |
166 | |
167 | if (!size) | |
168 | return 0; | |
169 | ||
170 | if (gfs2_is_stuffed(ip) && | |
171 | offset + size <= sdp->sd_sb.sb_bsize - sizeof(struct gfs2_dinode)) | |
568f4c96 SW |
172 | return gfs2_dir_write_stuffed(ip, buf, (unsigned int)offset, |
173 | size); | |
e13940ba SW |
174 | |
175 | if (gfs2_assert_warn(sdp, gfs2_is_jdata(ip))) | |
176 | return -EINVAL; | |
177 | ||
178 | if (gfs2_is_stuffed(ip)) { | |
f25ef0c1 | 179 | error = gfs2_unstuff_dinode(ip, NULL); |
e13940ba | 180 | if (error) |
c752666c | 181 | return error; |
e13940ba SW |
182 | } |
183 | ||
184 | lblock = offset; | |
185 | o = do_div(lblock, sdp->sd_jbsize) + sizeof(struct gfs2_meta_header); | |
186 | ||
187 | while (copied < size) { | |
188 | unsigned int amount; | |
189 | struct buffer_head *bh; | |
e13940ba SW |
190 | |
191 | amount = size - copied; | |
192 | if (amount > sdp->sd_sb.sb_bsize - o) | |
193 | amount = sdp->sd_sb.sb_bsize - o; | |
194 | ||
195 | if (!extlen) { | |
196 | new = 1; | |
feaa7bba | 197 | error = gfs2_extent_map(&ip->i_inode, lblock, &new, |
fd88de56 | 198 | &dblock, &extlen); |
e13940ba SW |
199 | if (error) |
200 | goto fail; | |
201 | error = -EIO; | |
202 | if (gfs2_assert_withdraw(sdp, dblock)) | |
203 | goto fail; | |
204 | } | |
205 | ||
61e085a8 SW |
206 | if (amount == sdp->sd_jbsize || new) |
207 | error = gfs2_dir_get_new_buffer(ip, dblock, &bh); | |
208 | else | |
209 | error = gfs2_dir_get_existing_buffer(ip, dblock, &bh); | |
210 | ||
e13940ba SW |
211 | if (error) |
212 | goto fail; | |
213 | ||
350a9b0a | 214 | gfs2_trans_add_meta(ip->i_gl, bh); |
e13940ba SW |
215 | memcpy(bh->b_data + o, buf, amount); |
216 | brelse(bh); | |
e13940ba | 217 | |
899bb264 | 218 | buf += amount; |
e13940ba SW |
219 | copied += amount; |
220 | lblock++; | |
221 | dblock++; | |
222 | extlen--; | |
223 | ||
224 | o = sizeof(struct gfs2_meta_header); | |
225 | } | |
226 | ||
227 | out: | |
228 | error = gfs2_meta_inode_buffer(ip, &dibh); | |
229 | if (error) | |
230 | return error; | |
231 | ||
a2e0f799 SW |
232 | if (ip->i_inode.i_size < offset + copied) |
233 | i_size_write(&ip->i_inode, offset + copied); | |
4bd91ba1 | 234 | ip->i_inode.i_mtime = ip->i_inode.i_ctime = CURRENT_TIME; |
e13940ba | 235 | |
350a9b0a | 236 | gfs2_trans_add_meta(ip->i_gl, dibh); |
539e5d6b | 237 | gfs2_dinode_out(ip, dibh->b_data); |
e13940ba SW |
238 | brelse(dibh); |
239 | ||
240 | return copied; | |
241 | fail: | |
242 | if (copied) | |
243 | goto out; | |
244 | return error; | |
245 | } | |
246 | ||
4c28d338 SW |
247 | static int gfs2_dir_read_stuffed(struct gfs2_inode *ip, __be64 *buf, |
248 | unsigned int size) | |
e13940ba SW |
249 | { |
250 | struct buffer_head *dibh; | |
251 | int error; | |
252 | ||
253 | error = gfs2_meta_inode_buffer(ip, &dibh); | |
254 | if (!error) { | |
4c28d338 | 255 | memcpy(buf, dibh->b_data + sizeof(struct gfs2_dinode), size); |
e13940ba SW |
256 | brelse(dibh); |
257 | } | |
258 | ||
259 | return (error) ? error : size; | |
260 | } | |
261 | ||
262 | ||
263 | /** | |
264 | * gfs2_dir_read_data - Read a data from a directory inode | |
265 | * @ip: The GFS2 Inode | |
266 | * @buf: The buffer to place result into | |
e13940ba SW |
267 | * @size: Amount of data to transfer |
268 | * | |
269 | * Returns: The amount of data actually copied or the error | |
270 | */ | |
4c28d338 SW |
271 | static int gfs2_dir_read_data(struct gfs2_inode *ip, __be64 *buf, |
272 | unsigned int size) | |
e13940ba | 273 | { |
feaa7bba | 274 | struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode); |
cd915493 SW |
275 | u64 lblock, dblock; |
276 | u32 extlen = 0; | |
e13940ba SW |
277 | unsigned int o; |
278 | int copied = 0; | |
279 | int error = 0; | |
e13940ba SW |
280 | |
281 | if (gfs2_is_stuffed(ip)) | |
4c28d338 | 282 | return gfs2_dir_read_stuffed(ip, buf, size); |
e13940ba SW |
283 | |
284 | if (gfs2_assert_warn(sdp, gfs2_is_jdata(ip))) | |
285 | return -EINVAL; | |
286 | ||
4c28d338 | 287 | lblock = 0; |
e13940ba SW |
288 | o = do_div(lblock, sdp->sd_jbsize) + sizeof(struct gfs2_meta_header); |
289 | ||
290 | while (copied < size) { | |
291 | unsigned int amount; | |
292 | struct buffer_head *bh; | |
293 | int new; | |
294 | ||
295 | amount = size - copied; | |
296 | if (amount > sdp->sd_sb.sb_bsize - o) | |
297 | amount = sdp->sd_sb.sb_bsize - o; | |
298 | ||
299 | if (!extlen) { | |
300 | new = 0; | |
feaa7bba | 301 | error = gfs2_extent_map(&ip->i_inode, lblock, &new, |
fd88de56 | 302 | &dblock, &extlen); |
7276b3b0 | 303 | if (error || !dblock) |
e13940ba | 304 | goto fail; |
7276b3b0 | 305 | BUG_ON(extlen < 1); |
7276b3b0 | 306 | bh = gfs2_meta_ra(ip->i_gl, dblock, extlen); |
b7d8ac3e | 307 | } else { |
7276b3b0 | 308 | error = gfs2_meta_read(ip->i_gl, dblock, DIO_WAIT, &bh); |
e13940ba SW |
309 | if (error) |
310 | goto fail; | |
7276b3b0 SW |
311 | } |
312 | error = gfs2_metatype_check(sdp, bh, GFS2_METATYPE_JD); | |
313 | if (error) { | |
314 | brelse(bh); | |
315 | goto fail; | |
316 | } | |
317 | dblock++; | |
318 | extlen--; | |
e13940ba SW |
319 | memcpy(buf, bh->b_data + o, amount); |
320 | brelse(bh); | |
4c28d338 | 321 | buf += (amount/sizeof(__be64)); |
e13940ba SW |
322 | copied += amount; |
323 | lblock++; | |
e13940ba SW |
324 | o = sizeof(struct gfs2_meta_header); |
325 | } | |
326 | ||
327 | return copied; | |
328 | fail: | |
329 | return (copied) ? copied : error; | |
330 | } | |
331 | ||
17d539f0 SW |
332 | /** |
333 | * gfs2_dir_get_hash_table - Get pointer to the dir hash table | |
334 | * @ip: The inode in question | |
335 | * | |
336 | * Returns: The hash table or an error | |
337 | */ | |
338 | ||
339 | static __be64 *gfs2_dir_get_hash_table(struct gfs2_inode *ip) | |
340 | { | |
341 | struct inode *inode = &ip->i_inode; | |
342 | int ret; | |
343 | u32 hsize; | |
344 | __be64 *hc; | |
345 | ||
346 | BUG_ON(!(ip->i_diskflags & GFS2_DIF_EXHASH)); | |
347 | ||
348 | hc = ip->i_hash_cache; | |
349 | if (hc) | |
350 | return hc; | |
351 | ||
352 | hsize = 1 << ip->i_depth; | |
353 | hsize *= sizeof(__be64); | |
354 | if (hsize != i_size_read(&ip->i_inode)) { | |
355 | gfs2_consist_inode(ip); | |
356 | return ERR_PTR(-EIO); | |
357 | } | |
358 | ||
e8830d88 BP |
359 | hc = kmalloc(hsize, GFP_NOFS | __GFP_NOWARN); |
360 | if (hc == NULL) | |
361 | hc = __vmalloc(hsize, GFP_NOFS, PAGE_KERNEL); | |
362 | ||
17d539f0 SW |
363 | if (hc == NULL) |
364 | return ERR_PTR(-ENOMEM); | |
365 | ||
4c28d338 | 366 | ret = gfs2_dir_read_data(ip, hc, hsize); |
17d539f0 | 367 | if (ret < 0) { |
3cdcf63e | 368 | kvfree(hc); |
17d539f0 SW |
369 | return ERR_PTR(ret); |
370 | } | |
371 | ||
372 | spin_lock(&inode->i_lock); | |
9265f1d0 | 373 | if (likely(!ip->i_hash_cache)) { |
17d539f0 | 374 | ip->i_hash_cache = hc; |
9265f1d0 AV |
375 | hc = NULL; |
376 | } | |
17d539f0 | 377 | spin_unlock(&inode->i_lock); |
9265f1d0 | 378 | kvfree(hc); |
17d539f0 SW |
379 | |
380 | return ip->i_hash_cache; | |
381 | } | |
382 | ||
383 | /** | |
384 | * gfs2_dir_hash_inval - Invalidate dir hash | |
385 | * @ip: The directory inode | |
386 | * | |
387 | * Must be called with an exclusive glock, or during glock invalidation. | |
388 | */ | |
389 | void gfs2_dir_hash_inval(struct gfs2_inode *ip) | |
390 | { | |
c36b97e9 BP |
391 | __be64 *hc; |
392 | ||
393 | spin_lock(&ip->i_inode.i_lock); | |
394 | hc = ip->i_hash_cache; | |
17d539f0 | 395 | ip->i_hash_cache = NULL; |
c36b97e9 BP |
396 | spin_unlock(&ip->i_inode.i_lock); |
397 | ||
3cdcf63e | 398 | kvfree(hc); |
17d539f0 SW |
399 | } |
400 | ||
5e7d65cd SW |
401 | static inline int gfs2_dirent_sentinel(const struct gfs2_dirent *dent) |
402 | { | |
403 | return dent->de_inum.no_addr == 0 || dent->de_inum.no_formal_ino == 0; | |
404 | } | |
405 | ||
c752666c SW |
406 | static inline int __gfs2_dirent_find(const struct gfs2_dirent *dent, |
407 | const struct qstr *name, int ret) | |
408 | { | |
5e7d65cd | 409 | if (!gfs2_dirent_sentinel(dent) && |
c752666c SW |
410 | be32_to_cpu(dent->de_hash) == name->hash && |
411 | be16_to_cpu(dent->de_name_len) == name->len && | |
2bdbc5d7 | 412 | memcmp(dent+1, name->name, name->len) == 0) |
c752666c SW |
413 | return ret; |
414 | return 0; | |
415 | } | |
416 | ||
417 | static int gfs2_dirent_find(const struct gfs2_dirent *dent, | |
71b86f56 SW |
418 | const struct qstr *name, |
419 | void *opaque) | |
c752666c SW |
420 | { |
421 | return __gfs2_dirent_find(dent, name, 1); | |
422 | } | |
423 | ||
424 | static int gfs2_dirent_prev(const struct gfs2_dirent *dent, | |
71b86f56 SW |
425 | const struct qstr *name, |
426 | void *opaque) | |
c752666c SW |
427 | { |
428 | return __gfs2_dirent_find(dent, name, 2); | |
429 | } | |
430 | ||
431 | /* | |
432 | * name->name holds ptr to start of block. | |
433 | * name->len holds size of block. | |
b3b94faa | 434 | */ |
c752666c | 435 | static int gfs2_dirent_last(const struct gfs2_dirent *dent, |
71b86f56 SW |
436 | const struct qstr *name, |
437 | void *opaque) | |
c752666c SW |
438 | { |
439 | const char *start = name->name; | |
440 | const char *end = (const char *)dent + be16_to_cpu(dent->de_rec_len); | |
441 | if (name->len == (end - start)) | |
442 | return 1; | |
443 | return 0; | |
444 | } | |
b3b94faa | 445 | |
c752666c | 446 | static int gfs2_dirent_find_space(const struct gfs2_dirent *dent, |
71b86f56 SW |
447 | const struct qstr *name, |
448 | void *opaque) | |
b3b94faa | 449 | { |
c752666c SW |
450 | unsigned required = GFS2_DIRENT_SIZE(name->len); |
451 | unsigned actual = GFS2_DIRENT_SIZE(be16_to_cpu(dent->de_name_len)); | |
452 | unsigned totlen = be16_to_cpu(dent->de_rec_len); | |
453 | ||
5e7d65cd | 454 | if (gfs2_dirent_sentinel(dent)) |
728a756b | 455 | actual = 0; |
c5392124 | 456 | if (totlen - actual >= required) |
c752666c SW |
457 | return 1; |
458 | return 0; | |
459 | } | |
460 | ||
71b86f56 SW |
461 | struct dirent_gather { |
462 | const struct gfs2_dirent **pdent; | |
463 | unsigned offset; | |
464 | }; | |
465 | ||
466 | static int gfs2_dirent_gather(const struct gfs2_dirent *dent, | |
467 | const struct qstr *name, | |
468 | void *opaque) | |
469 | { | |
470 | struct dirent_gather *g = opaque; | |
5e7d65cd | 471 | if (!gfs2_dirent_sentinel(dent)) { |
71b86f56 SW |
472 | g->pdent[g->offset++] = dent; |
473 | } | |
474 | return 0; | |
475 | } | |
476 | ||
c752666c SW |
477 | /* |
478 | * Other possible things to check: | |
479 | * - Inode located within filesystem size (and on valid block) | |
480 | * - Valid directory entry type | |
481 | * Not sure how heavy-weight we want to make this... could also check | |
482 | * hash is correct for example, but that would take a lot of extra time. | |
483 | * For now the most important thing is to check that the various sizes | |
484 | * are correct. | |
485 | */ | |
486 | static int gfs2_check_dirent(struct gfs2_dirent *dent, unsigned int offset, | |
487 | unsigned int size, unsigned int len, int first) | |
488 | { | |
489 | const char *msg = "gfs2_dirent too small"; | |
490 | if (unlikely(size < sizeof(struct gfs2_dirent))) | |
491 | goto error; | |
492 | msg = "gfs2_dirent misaligned"; | |
493 | if (unlikely(offset & 0x7)) | |
494 | goto error; | |
495 | msg = "gfs2_dirent points beyond end of block"; | |
496 | if (unlikely(offset + size > len)) | |
497 | goto error; | |
498 | msg = "zero inode number"; | |
5e7d65cd | 499 | if (unlikely(!first && gfs2_dirent_sentinel(dent))) |
c752666c SW |
500 | goto error; |
501 | msg = "name length is greater than space in dirent"; | |
5e7d65cd | 502 | if (!gfs2_dirent_sentinel(dent) && |
c752666c SW |
503 | unlikely(sizeof(struct gfs2_dirent)+be16_to_cpu(dent->de_name_len) > |
504 | size)) | |
505 | goto error; | |
506 | return 0; | |
507 | error: | |
d77d1b58 JP |
508 | pr_warn("%s: %s (%s)\n", |
509 | __func__, msg, first ? "first in block" : "not first in block"); | |
c752666c | 510 | return -EIO; |
b3b94faa DT |
511 | } |
512 | ||
71b86f56 | 513 | static int gfs2_dirent_offset(const void *buf) |
c752666c | 514 | { |
71b86f56 SW |
515 | const struct gfs2_meta_header *h = buf; |
516 | int offset; | |
c752666c SW |
517 | |
518 | BUG_ON(buf == NULL); | |
c752666c | 519 | |
e3167ded | 520 | switch(be32_to_cpu(h->mh_type)) { |
c752666c SW |
521 | case GFS2_METATYPE_LF: |
522 | offset = sizeof(struct gfs2_leaf); | |
523 | break; | |
524 | case GFS2_METATYPE_DI: | |
525 | offset = sizeof(struct gfs2_dinode); | |
526 | break; | |
527 | default: | |
528 | goto wrong_type; | |
529 | } | |
71b86f56 SW |
530 | return offset; |
531 | wrong_type: | |
d77d1b58 | 532 | pr_warn("%s: wrong block type %u\n", __func__, be32_to_cpu(h->mh_type)); |
71b86f56 SW |
533 | return -1; |
534 | } | |
535 | ||
2bdbc5d7 | 536 | static struct gfs2_dirent *gfs2_dirent_scan(struct inode *inode, void *buf, |
71b86f56 SW |
537 | unsigned int len, gfs2_dscan_t scan, |
538 | const struct qstr *name, | |
539 | void *opaque) | |
540 | { | |
541 | struct gfs2_dirent *dent, *prev; | |
542 | unsigned offset; | |
543 | unsigned size; | |
544 | int ret = 0; | |
c752666c | 545 | |
71b86f56 SW |
546 | ret = gfs2_dirent_offset(buf); |
547 | if (ret < 0) | |
548 | goto consist_inode; | |
549 | ||
550 | offset = ret; | |
c752666c | 551 | prev = NULL; |
2bdbc5d7 | 552 | dent = buf + offset; |
c752666c SW |
553 | size = be16_to_cpu(dent->de_rec_len); |
554 | if (gfs2_check_dirent(dent, offset, size, len, 1)) | |
555 | goto consist_inode; | |
556 | do { | |
71b86f56 | 557 | ret = scan(dent, name, opaque); |
c752666c SW |
558 | if (ret) |
559 | break; | |
560 | offset += size; | |
561 | if (offset == len) | |
562 | break; | |
563 | prev = dent; | |
2bdbc5d7 | 564 | dent = buf + offset; |
c752666c SW |
565 | size = be16_to_cpu(dent->de_rec_len); |
566 | if (gfs2_check_dirent(dent, offset, size, len, 0)) | |
567 | goto consist_inode; | |
568 | } while(1); | |
569 | ||
570 | switch(ret) { | |
571 | case 0: | |
572 | return NULL; | |
573 | case 1: | |
574 | return dent; | |
575 | case 2: | |
576 | return prev ? prev : dent; | |
577 | default: | |
578 | BUG_ON(ret > 0); | |
579 | return ERR_PTR(ret); | |
580 | } | |
581 | ||
c752666c | 582 | consist_inode: |
feaa7bba | 583 | gfs2_consist_inode(GFS2_I(inode)); |
c752666c SW |
584 | return ERR_PTR(-EIO); |
585 | } | |
586 | ||
2bdbc5d7 SW |
587 | static int dirent_check_reclen(struct gfs2_inode *dip, |
588 | const struct gfs2_dirent *d, const void *end_p) | |
589 | { | |
590 | const void *ptr = d; | |
591 | u16 rec_len = be16_to_cpu(d->de_rec_len); | |
592 | ||
593 | if (unlikely(rec_len < sizeof(struct gfs2_dirent))) | |
594 | goto broken; | |
595 | ptr += rec_len; | |
596 | if (ptr < end_p) | |
597 | return rec_len; | |
598 | if (ptr == end_p) | |
599 | return -ENOENT; | |
600 | broken: | |
601 | gfs2_consist_inode(dip); | |
602 | return -EIO; | |
603 | } | |
604 | ||
b3b94faa DT |
605 | /** |
606 | * dirent_next - Next dirent | |
607 | * @dip: the directory | |
608 | * @bh: The buffer | |
609 | * @dent: Pointer to list of dirents | |
610 | * | |
611 | * Returns: 0 on success, error code otherwise | |
612 | */ | |
613 | ||
614 | static int dirent_next(struct gfs2_inode *dip, struct buffer_head *bh, | |
615 | struct gfs2_dirent **dent) | |
616 | { | |
2bdbc5d7 SW |
617 | struct gfs2_dirent *cur = *dent, *tmp; |
618 | char *bh_end = bh->b_data + bh->b_size; | |
619 | int ret; | |
b3b94faa | 620 | |
2bdbc5d7 SW |
621 | ret = dirent_check_reclen(dip, cur, bh_end); |
622 | if (ret < 0) | |
623 | return ret; | |
4dd651ad | 624 | |
2bdbc5d7 SW |
625 | tmp = (void *)cur + ret; |
626 | ret = dirent_check_reclen(dip, tmp, bh_end); | |
627 | if (ret == -EIO) | |
628 | return ret; | |
4dd651ad | 629 | |
b3b94faa | 630 | /* Only the first dent could ever have de_inum.no_addr == 0 */ |
5e7d65cd | 631 | if (gfs2_dirent_sentinel(tmp)) { |
b3b94faa DT |
632 | gfs2_consist_inode(dip); |
633 | return -EIO; | |
634 | } | |
635 | ||
636 | *dent = tmp; | |
b3b94faa DT |
637 | return 0; |
638 | } | |
639 | ||
640 | /** | |
641 | * dirent_del - Delete a dirent | |
642 | * @dip: The GFS2 inode | |
643 | * @bh: The buffer | |
644 | * @prev: The previous dirent | |
645 | * @cur: The current dirent | |
646 | * | |
647 | */ | |
648 | ||
649 | static void dirent_del(struct gfs2_inode *dip, struct buffer_head *bh, | |
650 | struct gfs2_dirent *prev, struct gfs2_dirent *cur) | |
651 | { | |
cd915493 | 652 | u16 cur_rec_len, prev_rec_len; |
b3b94faa | 653 | |
5e7d65cd | 654 | if (gfs2_dirent_sentinel(cur)) { |
b3b94faa DT |
655 | gfs2_consist_inode(dip); |
656 | return; | |
657 | } | |
658 | ||
350a9b0a | 659 | gfs2_trans_add_meta(dip->i_gl, bh); |
b3b94faa DT |
660 | |
661 | /* If there is no prev entry, this is the first entry in the block. | |
662 | The de_rec_len is already as big as it needs to be. Just zero | |
663 | out the inode number and return. */ | |
664 | ||
665 | if (!prev) { | |
5e7d65cd SW |
666 | cur->de_inum.no_addr = 0; |
667 | cur->de_inum.no_formal_ino = 0; | |
b3b94faa DT |
668 | return; |
669 | } | |
670 | ||
671 | /* Combine this dentry with the previous one. */ | |
672 | ||
fc69d0d3 SW |
673 | prev_rec_len = be16_to_cpu(prev->de_rec_len); |
674 | cur_rec_len = be16_to_cpu(cur->de_rec_len); | |
b3b94faa DT |
675 | |
676 | if ((char *)prev + prev_rec_len != (char *)cur) | |
677 | gfs2_consist_inode(dip); | |
678 | if ((char *)cur + cur_rec_len > bh->b_data + bh->b_size) | |
679 | gfs2_consist_inode(dip); | |
680 | ||
681 | prev_rec_len += cur_rec_len; | |
fc69d0d3 | 682 | prev->de_rec_len = cpu_to_be16(prev_rec_len); |
b3b94faa DT |
683 | } |
684 | ||
c752666c SW |
685 | /* |
686 | * Takes a dent from which to grab space as an argument. Returns the | |
687 | * newly created dent. | |
b3b94faa | 688 | */ |
08bc2dbc AB |
689 | static struct gfs2_dirent *gfs2_init_dirent(struct inode *inode, |
690 | struct gfs2_dirent *dent, | |
691 | const struct qstr *name, | |
692 | struct buffer_head *bh) | |
b3b94faa | 693 | { |
feaa7bba | 694 | struct gfs2_inode *ip = GFS2_I(inode); |
c752666c SW |
695 | struct gfs2_dirent *ndent; |
696 | unsigned offset = 0, totlen; | |
697 | ||
5e7d65cd | 698 | if (!gfs2_dirent_sentinel(dent)) |
c752666c SW |
699 | offset = GFS2_DIRENT_SIZE(be16_to_cpu(dent->de_name_len)); |
700 | totlen = be16_to_cpu(dent->de_rec_len); | |
701 | BUG_ON(offset + name->len > totlen); | |
350a9b0a | 702 | gfs2_trans_add_meta(ip->i_gl, bh); |
c752666c SW |
703 | ndent = (struct gfs2_dirent *)((char *)dent + offset); |
704 | dent->de_rec_len = cpu_to_be16(offset); | |
705 | gfs2_qstr2dirent(name, totlen - offset, ndent); | |
706 | return ndent; | |
b3b94faa DT |
707 | } |
708 | ||
c752666c SW |
709 | static struct gfs2_dirent *gfs2_dirent_alloc(struct inode *inode, |
710 | struct buffer_head *bh, | |
711 | const struct qstr *name) | |
b3b94faa DT |
712 | { |
713 | struct gfs2_dirent *dent; | |
907b9bce | 714 | dent = gfs2_dirent_scan(inode, bh->b_data, bh->b_size, |
71b86f56 | 715 | gfs2_dirent_find_space, name, NULL); |
c752666c SW |
716 | if (!dent || IS_ERR(dent)) |
717 | return dent; | |
718 | return gfs2_init_dirent(inode, dent, name, bh); | |
b3b94faa DT |
719 | } |
720 | ||
cd915493 | 721 | static int get_leaf(struct gfs2_inode *dip, u64 leaf_no, |
b3b94faa DT |
722 | struct buffer_head **bhp) |
723 | { | |
724 | int error; | |
725 | ||
7276b3b0 | 726 | error = gfs2_meta_read(dip->i_gl, leaf_no, DIO_WAIT, bhp); |
feaa7bba | 727 | if (!error && gfs2_metatype_check(GFS2_SB(&dip->i_inode), *bhp, GFS2_METATYPE_LF)) { |
d77d1b58 | 728 | /* pr_info("block num=%llu\n", leaf_no); */ |
b3b94faa | 729 | error = -EIO; |
feaa7bba | 730 | } |
b3b94faa DT |
731 | |
732 | return error; | |
733 | } | |
734 | ||
735 | /** | |
736 | * get_leaf_nr - Get a leaf number associated with the index | |
737 | * @dip: The GFS2 inode | |
738 | * @index: | |
739 | * @leaf_out: | |
740 | * | |
741 | * Returns: 0 on success, error code otherwise | |
742 | */ | |
743 | ||
cd915493 SW |
744 | static int get_leaf_nr(struct gfs2_inode *dip, u32 index, |
745 | u64 *leaf_out) | |
b3b94faa | 746 | { |
17d539f0 | 747 | __be64 *hash; |
b3b94faa | 748 | |
17d539f0 SW |
749 | hash = gfs2_dir_get_hash_table(dip); |
750 | if (IS_ERR(hash)) | |
751 | return PTR_ERR(hash); | |
752 | *leaf_out = be64_to_cpu(*(hash + index)); | |
b3b94faa DT |
753 | return 0; |
754 | } | |
755 | ||
cd915493 | 756 | static int get_first_leaf(struct gfs2_inode *dip, u32 index, |
b3b94faa DT |
757 | struct buffer_head **bh_out) |
758 | { | |
cd915493 | 759 | u64 leaf_no; |
b3b94faa DT |
760 | int error; |
761 | ||
762 | error = get_leaf_nr(dip, index, &leaf_no); | |
763 | if (!error) | |
764 | error = get_leaf(dip, leaf_no, bh_out); | |
765 | ||
766 | return error; | |
767 | } | |
768 | ||
c752666c SW |
769 | static struct gfs2_dirent *gfs2_dirent_search(struct inode *inode, |
770 | const struct qstr *name, | |
771 | gfs2_dscan_t scan, | |
772 | struct buffer_head **pbh) | |
b3b94faa | 773 | { |
c752666c SW |
774 | struct buffer_head *bh; |
775 | struct gfs2_dirent *dent; | |
feaa7bba | 776 | struct gfs2_inode *ip = GFS2_I(inode); |
b3b94faa DT |
777 | int error; |
778 | ||
383f01fb | 779 | if (ip->i_diskflags & GFS2_DIF_EXHASH) { |
c752666c | 780 | struct gfs2_leaf *leaf; |
9a004508 | 781 | unsigned hsize = 1 << ip->i_depth; |
c752666c SW |
782 | unsigned index; |
783 | u64 ln; | |
a2e0f799 | 784 | if (hsize * sizeof(u64) != i_size_read(inode)) { |
c752666c SW |
785 | gfs2_consist_inode(ip); |
786 | return ERR_PTR(-EIO); | |
787 | } | |
907b9bce | 788 | |
9a004508 | 789 | index = name->hash >> (32 - ip->i_depth); |
c752666c SW |
790 | error = get_first_leaf(ip, index, &bh); |
791 | if (error) | |
792 | return ERR_PTR(error); | |
793 | do { | |
794 | dent = gfs2_dirent_scan(inode, bh->b_data, bh->b_size, | |
71b86f56 | 795 | scan, name, NULL); |
c752666c SW |
796 | if (dent) |
797 | goto got_dent; | |
798 | leaf = (struct gfs2_leaf *)bh->b_data; | |
799 | ln = be64_to_cpu(leaf->lf_next); | |
f4154ea0 | 800 | brelse(bh); |
c752666c SW |
801 | if (!ln) |
802 | break; | |
907b9bce | 803 | |
c752666c SW |
804 | error = get_leaf(ip, ln, &bh); |
805 | } while(!error); | |
b3b94faa | 806 | |
c752666c | 807 | return error ? ERR_PTR(error) : NULL; |
b3b94faa | 808 | } |
b3b94faa | 809 | |
907b9bce | 810 | |
c752666c SW |
811 | error = gfs2_meta_inode_buffer(ip, &bh); |
812 | if (error) | |
813 | return ERR_PTR(error); | |
71b86f56 | 814 | dent = gfs2_dirent_scan(inode, bh->b_data, bh->b_size, scan, name, NULL); |
c752666c | 815 | got_dent: |
f4154ea0 | 816 | if (unlikely(dent == NULL || IS_ERR(dent))) { |
ed386507 SW |
817 | brelse(bh); |
818 | bh = NULL; | |
819 | } | |
c752666c SW |
820 | *pbh = bh; |
821 | return dent; | |
822 | } | |
b3b94faa | 823 | |
c752666c SW |
824 | static struct gfs2_leaf *new_leaf(struct inode *inode, struct buffer_head **pbh, u16 depth) |
825 | { | |
feaa7bba | 826 | struct gfs2_inode *ip = GFS2_I(inode); |
b45e41d7 | 827 | unsigned int n = 1; |
09010978 SW |
828 | u64 bn; |
829 | int error; | |
830 | struct buffer_head *bh; | |
c752666c SW |
831 | struct gfs2_leaf *leaf; |
832 | struct gfs2_dirent *dent; | |
26fe5750 | 833 | struct qstr name = { .name = "" }; |
01bcb0de | 834 | struct timespec tv = CURRENT_TIME; |
09010978 | 835 | |
6e87ed0f | 836 | error = gfs2_alloc_blocks(ip, &bn, &n, 0, NULL); |
09010978 SW |
837 | if (error) |
838 | return NULL; | |
839 | bh = gfs2_meta_new(ip->i_gl, bn); | |
c752666c SW |
840 | if (!bh) |
841 | return NULL; | |
09010978 | 842 | |
5731be53 | 843 | gfs2_trans_add_unrevoke(GFS2_SB(inode), bn, 1); |
350a9b0a | 844 | gfs2_trans_add_meta(ip->i_gl, bh); |
c752666c SW |
845 | gfs2_metatype_set(bh, GFS2_METATYPE_LF, GFS2_FORMAT_LF); |
846 | leaf = (struct gfs2_leaf *)bh->b_data; | |
847 | leaf->lf_depth = cpu_to_be16(depth); | |
2bdbc5d7 | 848 | leaf->lf_entries = 0; |
a2d7d021 | 849 | leaf->lf_dirent_format = cpu_to_be32(GFS2_FORMAT_DE); |
2bdbc5d7 | 850 | leaf->lf_next = 0; |
01bcb0de SW |
851 | leaf->lf_inode = cpu_to_be64(ip->i_no_addr); |
852 | leaf->lf_dist = cpu_to_be32(1); | |
853 | leaf->lf_nsec = cpu_to_be32(tv.tv_nsec); | |
854 | leaf->lf_sec = cpu_to_be64(tv.tv_sec); | |
855 | memset(leaf->lf_reserved2, 0, sizeof(leaf->lf_reserved2)); | |
c752666c | 856 | dent = (struct gfs2_dirent *)(leaf+1); |
71b86f56 | 857 | gfs2_qstr2dirent(&name, bh->b_size - sizeof(struct gfs2_leaf), dent); |
c752666c SW |
858 | *pbh = bh; |
859 | return leaf; | |
b3b94faa DT |
860 | } |
861 | ||
862 | /** | |
863 | * dir_make_exhash - Convert a stuffed directory into an ExHash directory | |
864 | * @dip: The GFS2 inode | |
865 | * | |
866 | * Returns: 0 on success, error code otherwise | |
867 | */ | |
868 | ||
c752666c | 869 | static int dir_make_exhash(struct inode *inode) |
b3b94faa | 870 | { |
feaa7bba SW |
871 | struct gfs2_inode *dip = GFS2_I(inode); |
872 | struct gfs2_sbd *sdp = GFS2_SB(inode); | |
b3b94faa | 873 | struct gfs2_dirent *dent; |
c752666c | 874 | struct qstr args; |
b3b94faa DT |
875 | struct buffer_head *bh, *dibh; |
876 | struct gfs2_leaf *leaf; | |
877 | int y; | |
cd915493 | 878 | u32 x; |
b44b84d7 AV |
879 | __be64 *lp; |
880 | u64 bn; | |
b3b94faa DT |
881 | int error; |
882 | ||
883 | error = gfs2_meta_inode_buffer(dip, &dibh); | |
884 | if (error) | |
885 | return error; | |
886 | ||
b3b94faa DT |
887 | /* Turn over a new leaf */ |
888 | ||
c752666c SW |
889 | leaf = new_leaf(inode, &bh, 0); |
890 | if (!leaf) | |
891 | return -ENOSPC; | |
892 | bn = bh->b_blocknr; | |
b3b94faa | 893 | |
ad6203f2 SW |
894 | gfs2_assert(sdp, dip->i_entries < (1 << 16)); |
895 | leaf->lf_entries = cpu_to_be16(dip->i_entries); | |
b3b94faa DT |
896 | |
897 | /* Copy dirents */ | |
898 | ||
899 | gfs2_buffer_copy_tail(bh, sizeof(struct gfs2_leaf), dibh, | |
900 | sizeof(struct gfs2_dinode)); | |
901 | ||
902 | /* Find last entry */ | |
903 | ||
904 | x = 0; | |
c752666c SW |
905 | args.len = bh->b_size - sizeof(struct gfs2_dinode) + |
906 | sizeof(struct gfs2_leaf); | |
907 | args.name = bh->b_data; | |
feaa7bba | 908 | dent = gfs2_dirent_scan(&dip->i_inode, bh->b_data, bh->b_size, |
71b86f56 | 909 | gfs2_dirent_last, &args, NULL); |
c752666c SW |
910 | if (!dent) { |
911 | brelse(bh); | |
912 | brelse(dibh); | |
913 | return -EIO; | |
914 | } | |
915 | if (IS_ERR(dent)) { | |
916 | brelse(bh); | |
917 | brelse(dibh); | |
918 | return PTR_ERR(dent); | |
b3b94faa | 919 | } |
b3b94faa DT |
920 | |
921 | /* Adjust the last dirent's record length | |
922 | (Remember that dent still points to the last entry.) */ | |
923 | ||
4dd651ad | 924 | dent->de_rec_len = cpu_to_be16(be16_to_cpu(dent->de_rec_len) + |
b3b94faa | 925 | sizeof(struct gfs2_dinode) - |
4dd651ad | 926 | sizeof(struct gfs2_leaf)); |
b3b94faa DT |
927 | |
928 | brelse(bh); | |
929 | ||
930 | /* We're done with the new leaf block, now setup the new | |
931 | hash table. */ | |
932 | ||
350a9b0a | 933 | gfs2_trans_add_meta(dip->i_gl, dibh); |
b3b94faa DT |
934 | gfs2_buffer_clear_tail(dibh, sizeof(struct gfs2_dinode)); |
935 | ||
b44b84d7 | 936 | lp = (__be64 *)(dibh->b_data + sizeof(struct gfs2_dinode)); |
b3b94faa DT |
937 | |
938 | for (x = sdp->sd_hash_ptrs; x--; lp++) | |
939 | *lp = cpu_to_be64(bn); | |
940 | ||
a2e0f799 | 941 | i_size_write(inode, sdp->sd_sb.sb_bsize / 2); |
77658aad | 942 | gfs2_add_inode_blocks(&dip->i_inode, 1); |
383f01fb | 943 | dip->i_diskflags |= GFS2_DIF_EXHASH; |
b3b94faa DT |
944 | |
945 | for (x = sdp->sd_hash_ptrs, y = -1; x; x >>= 1, y++) ; | |
9a004508 | 946 | dip->i_depth = y; |
b3b94faa | 947 | |
539e5d6b | 948 | gfs2_dinode_out(dip, dibh->b_data); |
b3b94faa DT |
949 | |
950 | brelse(dibh); | |
951 | ||
952 | return 0; | |
953 | } | |
954 | ||
955 | /** | |
956 | * dir_split_leaf - Split a leaf block into two | |
957 | * @dip: The GFS2 inode | |
958 | * @index: | |
959 | * @leaf_no: | |
960 | * | |
961 | * Returns: 0 on success, error code on failure | |
962 | */ | |
963 | ||
c752666c | 964 | static int dir_split_leaf(struct inode *inode, const struct qstr *name) |
b3b94faa | 965 | { |
feaa7bba | 966 | struct gfs2_inode *dip = GFS2_I(inode); |
b3b94faa DT |
967 | struct buffer_head *nbh, *obh, *dibh; |
968 | struct gfs2_leaf *nleaf, *oleaf; | |
4da3c646 | 969 | struct gfs2_dirent *dent = NULL, *prev = NULL, *next = NULL, *new; |
cd915493 | 970 | u32 start, len, half_len, divider; |
b44b84d7 AV |
971 | u64 bn, leaf_no; |
972 | __be64 *lp; | |
cd915493 | 973 | u32 index; |
b3b94faa DT |
974 | int x, moved = 0; |
975 | int error; | |
976 | ||
9a004508 | 977 | index = name->hash >> (32 - dip->i_depth); |
c752666c SW |
978 | error = get_leaf_nr(dip, index, &leaf_no); |
979 | if (error) | |
980 | return error; | |
b3b94faa DT |
981 | |
982 | /* Get the old leaf block */ | |
b3b94faa DT |
983 | error = get_leaf(dip, leaf_no, &obh); |
984 | if (error) | |
e90deff5 | 985 | return error; |
b3b94faa | 986 | |
b3b94faa | 987 | oleaf = (struct gfs2_leaf *)obh->b_data; |
9a004508 | 988 | if (dip->i_depth == be16_to_cpu(oleaf->lf_depth)) { |
e90deff5 SW |
989 | brelse(obh); |
990 | return 1; /* can't split */ | |
991 | } | |
992 | ||
350a9b0a | 993 | gfs2_trans_add_meta(dip->i_gl, obh); |
b3b94faa | 994 | |
c752666c SW |
995 | nleaf = new_leaf(inode, &nbh, be16_to_cpu(oleaf->lf_depth) + 1); |
996 | if (!nleaf) { | |
997 | brelse(obh); | |
998 | return -ENOSPC; | |
999 | } | |
1000 | bn = nbh->b_blocknr; | |
b3b94faa | 1001 | |
c752666c | 1002 | /* Compute the start and len of leaf pointers in the hash table. */ |
9a004508 | 1003 | len = 1 << (dip->i_depth - be16_to_cpu(oleaf->lf_depth)); |
b3b94faa DT |
1004 | half_len = len >> 1; |
1005 | if (!half_len) { | |
d77d1b58 JP |
1006 | pr_warn("i_depth %u lf_depth %u index %u\n", |
1007 | dip->i_depth, be16_to_cpu(oleaf->lf_depth), index); | |
b3b94faa DT |
1008 | gfs2_consist_inode(dip); |
1009 | error = -EIO; | |
1010 | goto fail_brelse; | |
1011 | } | |
1012 | ||
1013 | start = (index & ~(len - 1)); | |
1014 | ||
1015 | /* Change the pointers. | |
1016 | Don't bother distinguishing stuffed from non-stuffed. | |
1017 | This code is complicated enough already. */ | |
4244b52e DR |
1018 | lp = kmalloc(half_len * sizeof(__be64), GFP_NOFS); |
1019 | if (!lp) { | |
1020 | error = -ENOMEM; | |
1021 | goto fail_brelse; | |
1022 | } | |
1023 | ||
b3b94faa | 1024 | /* Change the pointers */ |
b3b94faa DT |
1025 | for (x = 0; x < half_len; x++) |
1026 | lp[x] = cpu_to_be64(bn); | |
1027 | ||
17d539f0 SW |
1028 | gfs2_dir_hash_inval(dip); |
1029 | ||
cd915493 SW |
1030 | error = gfs2_dir_write_data(dip, (char *)lp, start * sizeof(u64), |
1031 | half_len * sizeof(u64)); | |
1032 | if (error != half_len * sizeof(u64)) { | |
b3b94faa DT |
1033 | if (error >= 0) |
1034 | error = -EIO; | |
1035 | goto fail_lpfree; | |
1036 | } | |
1037 | ||
1038 | kfree(lp); | |
1039 | ||
1040 | /* Compute the divider */ | |
9a004508 | 1041 | divider = (start + half_len) << (32 - dip->i_depth); |
b3b94faa DT |
1042 | |
1043 | /* Copy the entries */ | |
1579343a | 1044 | dent = (struct gfs2_dirent *)(obh->b_data + sizeof(struct gfs2_leaf)); |
b3b94faa DT |
1045 | |
1046 | do { | |
1047 | next = dent; | |
1048 | if (dirent_next(dip, obh, &next)) | |
1049 | next = NULL; | |
1050 | ||
5e7d65cd | 1051 | if (!gfs2_dirent_sentinel(dent) && |
b3b94faa | 1052 | be32_to_cpu(dent->de_hash) < divider) { |
c752666c SW |
1053 | struct qstr str; |
1054 | str.name = (char*)(dent+1); | |
1055 | str.len = be16_to_cpu(dent->de_name_len); | |
1056 | str.hash = be32_to_cpu(dent->de_hash); | |
71b86f56 | 1057 | new = gfs2_dirent_alloc(inode, nbh, &str); |
c752666c SW |
1058 | if (IS_ERR(new)) { |
1059 | error = PTR_ERR(new); | |
1060 | break; | |
1061 | } | |
b3b94faa DT |
1062 | |
1063 | new->de_inum = dent->de_inum; /* No endian worries */ | |
b3b94faa | 1064 | new->de_type = dent->de_type; /* No endian worries */ |
bb16b342 | 1065 | be16_add_cpu(&nleaf->lf_entries, 1); |
b3b94faa DT |
1066 | |
1067 | dirent_del(dip, obh, prev, dent); | |
1068 | ||
1069 | if (!oleaf->lf_entries) | |
1070 | gfs2_consist_inode(dip); | |
bb16b342 | 1071 | be16_add_cpu(&oleaf->lf_entries, -1); |
b3b94faa DT |
1072 | |
1073 | if (!prev) | |
1074 | prev = dent; | |
1075 | ||
1076 | moved = 1; | |
c752666c | 1077 | } else { |
b3b94faa | 1078 | prev = dent; |
c752666c | 1079 | } |
b3b94faa | 1080 | dent = next; |
c752666c | 1081 | } while (dent); |
b3b94faa | 1082 | |
c752666c | 1083 | oleaf->lf_depth = nleaf->lf_depth; |
b3b94faa DT |
1084 | |
1085 | error = gfs2_meta_inode_buffer(dip, &dibh); | |
feaa7bba | 1086 | if (!gfs2_assert_withdraw(GFS2_SB(&dip->i_inode), !error)) { |
350a9b0a | 1087 | gfs2_trans_add_meta(dip->i_gl, dibh); |
77658aad | 1088 | gfs2_add_inode_blocks(&dip->i_inode, 1); |
539e5d6b | 1089 | gfs2_dinode_out(dip, dibh->b_data); |
b3b94faa DT |
1090 | brelse(dibh); |
1091 | } | |
1092 | ||
1093 | brelse(obh); | |
1094 | brelse(nbh); | |
1095 | ||
1096 | return error; | |
1097 | ||
e90deff5 | 1098 | fail_lpfree: |
b3b94faa DT |
1099 | kfree(lp); |
1100 | ||
e90deff5 | 1101 | fail_brelse: |
b3b94faa | 1102 | brelse(obh); |
b3b94faa DT |
1103 | brelse(nbh); |
1104 | return error; | |
1105 | } | |
1106 | ||
1107 | /** | |
1108 | * dir_double_exhash - Double size of ExHash table | |
1109 | * @dip: The GFS2 dinode | |
1110 | * | |
1111 | * Returns: 0 on success, error code on failure | |
1112 | */ | |
1113 | ||
1114 | static int dir_double_exhash(struct gfs2_inode *dip) | |
1115 | { | |
b3b94faa | 1116 | struct buffer_head *dibh; |
cd915493 | 1117 | u32 hsize; |
17d539f0 SW |
1118 | u32 hsize_bytes; |
1119 | __be64 *hc; | |
1120 | __be64 *hc2, *h; | |
b3b94faa DT |
1121 | int x; |
1122 | int error = 0; | |
1123 | ||
9a004508 | 1124 | hsize = 1 << dip->i_depth; |
17d539f0 | 1125 | hsize_bytes = hsize * sizeof(__be64); |
b3b94faa | 1126 | |
17d539f0 SW |
1127 | hc = gfs2_dir_get_hash_table(dip); |
1128 | if (IS_ERR(hc)) | |
1129 | return PTR_ERR(hc); | |
b3b94faa | 1130 | |
512cbf02 | 1131 | hc2 = kmalloc(hsize_bytes * 2, GFP_NOFS | __GFP_NOWARN); |
e8830d88 BP |
1132 | if (hc2 == NULL) |
1133 | hc2 = __vmalloc(hsize_bytes * 2, GFP_NOFS, PAGE_KERNEL); | |
1134 | ||
17d539f0 | 1135 | if (!hc2) |
4244b52e | 1136 | return -ENOMEM; |
b3b94faa | 1137 | |
512cbf02 | 1138 | h = hc2; |
17d539f0 SW |
1139 | error = gfs2_meta_inode_buffer(dip, &dibh); |
1140 | if (error) | |
1141 | goto out_kfree; | |
b3b94faa | 1142 | |
17d539f0 SW |
1143 | for (x = 0; x < hsize; x++) { |
1144 | *h++ = *hc; | |
1145 | *h++ = *hc; | |
1146 | hc++; | |
b3b94faa DT |
1147 | } |
1148 | ||
17d539f0 SW |
1149 | error = gfs2_dir_write_data(dip, (char *)hc2, 0, hsize_bytes * 2); |
1150 | if (error != (hsize_bytes * 2)) | |
1151 | goto fail; | |
b3b94faa | 1152 | |
17d539f0 SW |
1153 | gfs2_dir_hash_inval(dip); |
1154 | dip->i_hash_cache = hc2; | |
1155 | dip->i_depth++; | |
1156 | gfs2_dinode_out(dip, dibh->b_data); | |
1157 | brelse(dibh); | |
1158 | return 0; | |
b3b94faa | 1159 | |
a91ea69f | 1160 | fail: |
17d539f0 SW |
1161 | /* Replace original hash table & size */ |
1162 | gfs2_dir_write_data(dip, (char *)hc, 0, hsize_bytes); | |
1163 | i_size_write(&dip->i_inode, hsize_bytes); | |
1164 | gfs2_dinode_out(dip, dibh->b_data); | |
1165 | brelse(dibh); | |
1166 | out_kfree: | |
3cdcf63e | 1167 | kvfree(hc2); |
b3b94faa DT |
1168 | return error; |
1169 | } | |
1170 | ||
1171 | /** | |
1172 | * compare_dents - compare directory entries by hash value | |
1173 | * @a: first dent | |
1174 | * @b: second dent | |
1175 | * | |
1176 | * When comparing the hash entries of @a to @b: | |
1177 | * gt: returns 1 | |
1178 | * lt: returns -1 | |
1179 | * eq: returns 0 | |
1180 | */ | |
1181 | ||
1182 | static int compare_dents(const void *a, const void *b) | |
1183 | { | |
2bdbc5d7 | 1184 | const struct gfs2_dirent *dent_a, *dent_b; |
cd915493 | 1185 | u32 hash_a, hash_b; |
b3b94faa DT |
1186 | int ret = 0; |
1187 | ||
2bdbc5d7 | 1188 | dent_a = *(const struct gfs2_dirent **)a; |
c752666c | 1189 | hash_a = be32_to_cpu(dent_a->de_hash); |
b3b94faa | 1190 | |
2bdbc5d7 | 1191 | dent_b = *(const struct gfs2_dirent **)b; |
c752666c | 1192 | hash_b = be32_to_cpu(dent_b->de_hash); |
b3b94faa DT |
1193 | |
1194 | if (hash_a > hash_b) | |
1195 | ret = 1; | |
1196 | else if (hash_a < hash_b) | |
1197 | ret = -1; | |
1198 | else { | |
4dd651ad SW |
1199 | unsigned int len_a = be16_to_cpu(dent_a->de_name_len); |
1200 | unsigned int len_b = be16_to_cpu(dent_b->de_name_len); | |
b3b94faa DT |
1201 | |
1202 | if (len_a > len_b) | |
1203 | ret = 1; | |
1204 | else if (len_a < len_b) | |
1205 | ret = -1; | |
1206 | else | |
2bdbc5d7 | 1207 | ret = memcmp(dent_a + 1, dent_b + 1, len_a); |
b3b94faa DT |
1208 | } |
1209 | ||
1210 | return ret; | |
1211 | } | |
1212 | ||
1213 | /** | |
1214 | * do_filldir_main - read out directory entries | |
1215 | * @dip: The GFS2 inode | |
d81a8ef5 | 1216 | * @ctx: what to feed the entries to |
b3b94faa DT |
1217 | * @darr: an array of struct gfs2_dirent pointers to read |
1218 | * @entries: the number of entries in darr | |
1219 | * @copied: pointer to int that's non-zero if a entry has been copied out | |
1220 | * | |
1221 | * Jump through some hoops to make sure that if there are hash collsions, | |
1222 | * they are read out at the beginning of a buffer. We want to minimize | |
1223 | * the possibility that they will fall into different readdir buffers or | |
1224 | * that someone will want to seek to that location. | |
1225 | * | |
d81a8ef5 | 1226 | * Returns: errno, >0 if the actor tells you to stop |
b3b94faa DT |
1227 | */ |
1228 | ||
d81a8ef5 | 1229 | static int do_filldir_main(struct gfs2_inode *dip, struct dir_context *ctx, |
cd915493 | 1230 | const struct gfs2_dirent **darr, u32 entries, |
b3b94faa DT |
1231 | int *copied) |
1232 | { | |
71b86f56 | 1233 | const struct gfs2_dirent *dent, *dent_next; |
cd915493 | 1234 | u64 off, off_next; |
b3b94faa DT |
1235 | unsigned int x, y; |
1236 | int run = 0; | |
b3b94faa DT |
1237 | |
1238 | sort(darr, entries, sizeof(struct gfs2_dirent *), compare_dents, NULL); | |
1239 | ||
1240 | dent_next = darr[0]; | |
1241 | off_next = be32_to_cpu(dent_next->de_hash); | |
1242 | off_next = gfs2_disk_hash2offset(off_next); | |
1243 | ||
1244 | for (x = 0, y = 1; x < entries; x++, y++) { | |
1245 | dent = dent_next; | |
1246 | off = off_next; | |
1247 | ||
1248 | if (y < entries) { | |
1249 | dent_next = darr[y]; | |
1250 | off_next = be32_to_cpu(dent_next->de_hash); | |
1251 | off_next = gfs2_disk_hash2offset(off_next); | |
1252 | ||
d81a8ef5 | 1253 | if (off < ctx->pos) |
b3b94faa | 1254 | continue; |
d81a8ef5 | 1255 | ctx->pos = off; |
b3b94faa DT |
1256 | |
1257 | if (off_next == off) { | |
1258 | if (*copied && !run) | |
1259 | return 1; | |
1260 | run = 1; | |
1261 | } else | |
1262 | run = 0; | |
1263 | } else { | |
d81a8ef5 | 1264 | if (off < ctx->pos) |
b3b94faa | 1265 | continue; |
d81a8ef5 | 1266 | ctx->pos = off; |
b3b94faa DT |
1267 | } |
1268 | ||
d81a8ef5 | 1269 | if (!dir_emit(ctx, (const char *)(dent + 1), |
4dd651ad | 1270 | be16_to_cpu(dent->de_name_len), |
d81a8ef5 AV |
1271 | be64_to_cpu(dent->de_inum.no_addr), |
1272 | be16_to_cpu(dent->de_type))) | |
b3b94faa DT |
1273 | return 1; |
1274 | ||
1275 | *copied = 1; | |
1276 | } | |
1277 | ||
d81a8ef5 | 1278 | /* Increment the ctx->pos by one, so the next time we come into the |
b3b94faa DT |
1279 | do_filldir fxn, we get the next entry instead of the last one in the |
1280 | current leaf */ | |
1281 | ||
d81a8ef5 | 1282 | ctx->pos++; |
b3b94faa DT |
1283 | |
1284 | return 0; | |
1285 | } | |
1286 | ||
d2a97a4e SW |
1287 | static void *gfs2_alloc_sort_buffer(unsigned size) |
1288 | { | |
1289 | void *ptr = NULL; | |
1290 | ||
1291 | if (size < KMALLOC_MAX_SIZE) | |
1292 | ptr = kmalloc(size, GFP_NOFS | __GFP_NOWARN); | |
1293 | if (!ptr) | |
1294 | ptr = __vmalloc(size, GFP_NOFS, PAGE_KERNEL); | |
1295 | return ptr; | |
1296 | } | |
1297 | ||
d81a8ef5 AV |
1298 | static int gfs2_dir_read_leaf(struct inode *inode, struct dir_context *ctx, |
1299 | int *copied, unsigned *depth, | |
3699e3a4 | 1300 | u64 leaf_no) |
b3b94faa | 1301 | { |
feaa7bba | 1302 | struct gfs2_inode *ip = GFS2_I(inode); |
bdd19a22 | 1303 | struct gfs2_sbd *sdp = GFS2_SB(inode); |
71b86f56 SW |
1304 | struct buffer_head *bh; |
1305 | struct gfs2_leaf *lf; | |
bdd19a22 | 1306 | unsigned entries = 0, entries2 = 0; |
71b86f56 SW |
1307 | unsigned leaves = 0; |
1308 | const struct gfs2_dirent **darr, *dent; | |
1309 | struct dirent_gather g; | |
1310 | struct buffer_head **larr; | |
1311 | int leaf = 0; | |
1312 | int error, i; | |
1313 | u64 lfn = leaf_no; | |
b3b94faa | 1314 | |
b3b94faa | 1315 | do { |
71b86f56 | 1316 | error = get_leaf(ip, lfn, &bh); |
b3b94faa | 1317 | if (error) |
71b86f56 SW |
1318 | goto out; |
1319 | lf = (struct gfs2_leaf *)bh->b_data; | |
1320 | if (leaves == 0) | |
1321 | *depth = be16_to_cpu(lf->lf_depth); | |
1322 | entries += be16_to_cpu(lf->lf_entries); | |
1323 | leaves++; | |
1324 | lfn = be64_to_cpu(lf->lf_next); | |
1325 | brelse(bh); | |
1326 | } while(lfn); | |
b3b94faa DT |
1327 | |
1328 | if (!entries) | |
1329 | return 0; | |
1330 | ||
71b86f56 | 1331 | error = -ENOMEM; |
bdd19a22 SW |
1332 | /* |
1333 | * The extra 99 entries are not normally used, but are a buffer | |
1334 | * zone in case the number of entries in the leaf is corrupt. | |
1335 | * 99 is the maximum number of entries that can fit in a single | |
1336 | * leaf block. | |
1337 | */ | |
d2a97a4e | 1338 | larr = gfs2_alloc_sort_buffer((leaves + entries + 99) * sizeof(void *)); |
71b86f56 SW |
1339 | if (!larr) |
1340 | goto out; | |
1341 | darr = (const struct gfs2_dirent **)(larr + leaves); | |
1342 | g.pdent = darr; | |
1343 | g.offset = 0; | |
1344 | lfn = leaf_no; | |
b3b94faa | 1345 | |
71b86f56 SW |
1346 | do { |
1347 | error = get_leaf(ip, lfn, &bh); | |
b3b94faa | 1348 | if (error) |
d2a97a4e | 1349 | goto out_free; |
71b86f56 SW |
1350 | lf = (struct gfs2_leaf *)bh->b_data; |
1351 | lfn = be64_to_cpu(lf->lf_next); | |
1352 | if (lf->lf_entries) { | |
bdd19a22 | 1353 | entries2 += be16_to_cpu(lf->lf_entries); |
71b86f56 SW |
1354 | dent = gfs2_dirent_scan(inode, bh->b_data, bh->b_size, |
1355 | gfs2_dirent_gather, NULL, &g); | |
1356 | error = PTR_ERR(dent); | |
bdd19a22 | 1357 | if (IS_ERR(dent)) |
d2a97a4e | 1358 | goto out_free; |
bdd19a22 | 1359 | if (entries2 != g.offset) { |
f391a4ea AM |
1360 | fs_warn(sdp, "Number of entries corrupt in dir " |
1361 | "leaf %llu, entries2 (%u) != " | |
1362 | "g.offset (%u)\n", | |
1363 | (unsigned long long)bh->b_blocknr, | |
1364 | entries2, g.offset); | |
bdd19a22 SW |
1365 | |
1366 | error = -EIO; | |
d2a97a4e | 1367 | goto out_free; |
71b86f56 SW |
1368 | } |
1369 | error = 0; | |
1370 | larr[leaf++] = bh; | |
b3b94faa | 1371 | } else { |
71b86f56 | 1372 | brelse(bh); |
b3b94faa | 1373 | } |
71b86f56 | 1374 | } while(lfn); |
b3b94faa | 1375 | |
bdd19a22 | 1376 | BUG_ON(entries2 != entries); |
d81a8ef5 | 1377 | error = do_filldir_main(ip, ctx, darr, entries, copied); |
d2a97a4e | 1378 | out_free: |
71b86f56 SW |
1379 | for(i = 0; i < leaf; i++) |
1380 | brelse(larr[i]); | |
3cdcf63e | 1381 | kvfree(larr); |
71b86f56 | 1382 | out: |
b3b94faa DT |
1383 | return error; |
1384 | } | |
1385 | ||
79c4c379 SW |
1386 | /** |
1387 | * gfs2_dir_readahead - Issue read-ahead requests for leaf blocks. | |
dfe4d34b BP |
1388 | * |
1389 | * Note: we can't calculate each index like dir_e_read can because we don't | |
1390 | * have the leaf, and therefore we don't have the depth, and therefore we | |
1391 | * don't have the length. So we have to just read enough ahead to make up | |
79c4c379 SW |
1392 | * for the loss of information. |
1393 | */ | |
dfe4d34b BP |
1394 | static void gfs2_dir_readahead(struct inode *inode, unsigned hsize, u32 index, |
1395 | struct file_ra_state *f_ra) | |
1396 | { | |
1397 | struct gfs2_inode *ip = GFS2_I(inode); | |
1398 | struct gfs2_glock *gl = ip->i_gl; | |
1399 | struct buffer_head *bh; | |
1400 | u64 blocknr = 0, last; | |
1401 | unsigned count; | |
1402 | ||
1403 | /* First check if we've already read-ahead for the whole range. */ | |
79c4c379 | 1404 | if (index + MAX_RA_BLOCKS < f_ra->start) |
dfe4d34b BP |
1405 | return; |
1406 | ||
1407 | f_ra->start = max((pgoff_t)index, f_ra->start); | |
1408 | for (count = 0; count < MAX_RA_BLOCKS; count++) { | |
1409 | if (f_ra->start >= hsize) /* if exceeded the hash table */ | |
1410 | break; | |
1411 | ||
1412 | last = blocknr; | |
1413 | blocknr = be64_to_cpu(ip->i_hash_cache[f_ra->start]); | |
1414 | f_ra->start++; | |
1415 | if (blocknr == last) | |
1416 | continue; | |
1417 | ||
1418 | bh = gfs2_getbuf(gl, blocknr, 1); | |
1419 | if (trylock_buffer(bh)) { | |
1420 | if (buffer_uptodate(bh)) { | |
1421 | unlock_buffer(bh); | |
1422 | brelse(bh); | |
1423 | continue; | |
1424 | } | |
1425 | bh->b_end_io = end_buffer_read_sync; | |
1426 | submit_bh(READA | REQ_META, bh); | |
1427 | continue; | |
1428 | } | |
1429 | brelse(bh); | |
1430 | } | |
1431 | } | |
17d539f0 | 1432 | |
b3b94faa | 1433 | /** |
c752666c SW |
1434 | * dir_e_read - Reads the entries from a directory into a filldir buffer |
1435 | * @dip: dinode pointer | |
d81a8ef5 | 1436 | * @ctx: actor to feed the entries to |
b3b94faa | 1437 | * |
c752666c | 1438 | * Returns: errno |
b3b94faa DT |
1439 | */ |
1440 | ||
d81a8ef5 AV |
1441 | static int dir_e_read(struct inode *inode, struct dir_context *ctx, |
1442 | struct file_ra_state *f_ra) | |
b3b94faa | 1443 | { |
feaa7bba | 1444 | struct gfs2_inode *dip = GFS2_I(inode); |
cd915493 | 1445 | u32 hsize, len = 0; |
cd915493 | 1446 | u32 hash, index; |
b44b84d7 | 1447 | __be64 *lp; |
c752666c SW |
1448 | int copied = 0; |
1449 | int error = 0; | |
4da3c646 | 1450 | unsigned depth = 0; |
b3b94faa | 1451 | |
9a004508 | 1452 | hsize = 1 << dip->i_depth; |
d81a8ef5 | 1453 | hash = gfs2_dir_offset2hash(ctx->pos); |
9a004508 | 1454 | index = hash >> (32 - dip->i_depth); |
b3b94faa | 1455 | |
79c4c379 | 1456 | if (dip->i_hash_cache == NULL) |
dfe4d34b | 1457 | f_ra->start = 0; |
17d539f0 SW |
1458 | lp = gfs2_dir_get_hash_table(dip); |
1459 | if (IS_ERR(lp)) | |
1460 | return PTR_ERR(lp); | |
b3b94faa | 1461 | |
dfe4d34b BP |
1462 | gfs2_dir_readahead(inode, hsize, index, f_ra); |
1463 | ||
b3b94faa | 1464 | while (index < hsize) { |
d81a8ef5 | 1465 | error = gfs2_dir_read_leaf(inode, ctx, |
71b86f56 | 1466 | &copied, &depth, |
17d539f0 | 1467 | be64_to_cpu(lp[index])); |
b3b94faa | 1468 | if (error) |
71b86f56 | 1469 | break; |
b3b94faa | 1470 | |
9a004508 | 1471 | len = 1 << (dip->i_depth - depth); |
b3b94faa DT |
1472 | index = (index & ~(len - 1)) + len; |
1473 | } | |
1474 | ||
71b86f56 SW |
1475 | if (error > 0) |
1476 | error = 0; | |
b3b94faa DT |
1477 | return error; |
1478 | } | |
1479 | ||
d81a8ef5 AV |
1480 | int gfs2_dir_read(struct inode *inode, struct dir_context *ctx, |
1481 | struct file_ra_state *f_ra) | |
b3b94faa | 1482 | { |
feaa7bba | 1483 | struct gfs2_inode *dip = GFS2_I(inode); |
bdd19a22 | 1484 | struct gfs2_sbd *sdp = GFS2_SB(inode); |
71b86f56 SW |
1485 | struct dirent_gather g; |
1486 | const struct gfs2_dirent **darr, *dent; | |
b3b94faa DT |
1487 | struct buffer_head *dibh; |
1488 | int copied = 0; | |
1489 | int error; | |
1490 | ||
ad6203f2 | 1491 | if (!dip->i_entries) |
71b86f56 SW |
1492 | return 0; |
1493 | ||
383f01fb | 1494 | if (dip->i_diskflags & GFS2_DIF_EXHASH) |
d81a8ef5 | 1495 | return dir_e_read(inode, ctx, f_ra); |
71b86f56 | 1496 | |
b3b94faa DT |
1497 | if (!gfs2_is_stuffed(dip)) { |
1498 | gfs2_consist_inode(dip); | |
1499 | return -EIO; | |
1500 | } | |
1501 | ||
b3b94faa DT |
1502 | error = gfs2_meta_inode_buffer(dip, &dibh); |
1503 | if (error) | |
1504 | return error; | |
1505 | ||
71b86f56 | 1506 | error = -ENOMEM; |
bdd19a22 | 1507 | /* 96 is max number of dirents which can be stuffed into an inode */ |
16c5f06f | 1508 | darr = kmalloc(96 * sizeof(struct gfs2_dirent *), GFP_NOFS); |
71b86f56 SW |
1509 | if (darr) { |
1510 | g.pdent = darr; | |
1511 | g.offset = 0; | |
1512 | dent = gfs2_dirent_scan(inode, dibh->b_data, dibh->b_size, | |
1513 | gfs2_dirent_gather, NULL, &g); | |
1514 | if (IS_ERR(dent)) { | |
1515 | error = PTR_ERR(dent); | |
1516 | goto out; | |
1517 | } | |
ad6203f2 | 1518 | if (dip->i_entries != g.offset) { |
bdd19a22 | 1519 | fs_warn(sdp, "Number of entries corrupt in dir %llu, " |
ad6203f2 | 1520 | "ip->i_entries (%u) != g.offset (%u)\n", |
dbb7cae2 | 1521 | (unsigned long long)dip->i_no_addr, |
ad6203f2 | 1522 | dip->i_entries, |
bdd19a22 SW |
1523 | g.offset); |
1524 | error = -EIO; | |
1525 | goto out; | |
1526 | } | |
d81a8ef5 | 1527 | error = do_filldir_main(dip, ctx, darr, |
ad6203f2 | 1528 | dip->i_entries, &copied); |
71b86f56 SW |
1529 | out: |
1530 | kfree(darr); | |
1531 | } | |
1532 | ||
b3b94faa DT |
1533 | if (error > 0) |
1534 | error = 0; | |
1535 | ||
1536 | brelse(dibh); | |
1537 | ||
1538 | return error; | |
1539 | } | |
1540 | ||
b3b94faa DT |
1541 | /** |
1542 | * gfs2_dir_search - Search a directory | |
5a00f3cc SW |
1543 | * @dip: The GFS2 dir inode |
1544 | * @name: The name we are looking up | |
1545 | * @fail_on_exist: Fail if the name exists rather than looking it up | |
b3b94faa DT |
1546 | * |
1547 | * This routine searches a directory for a file or another directory. | |
1548 | * Assumes a glock is held on dip. | |
1549 | * | |
1550 | * Returns: errno | |
1551 | */ | |
1552 | ||
5a00f3cc SW |
1553 | struct inode *gfs2_dir_search(struct inode *dir, const struct qstr *name, |
1554 | bool fail_on_exist) | |
b3b94faa | 1555 | { |
c752666c SW |
1556 | struct buffer_head *bh; |
1557 | struct gfs2_dirent *dent; | |
5a00f3cc SW |
1558 | u64 addr, formal_ino; |
1559 | u16 dtype; | |
dbb7cae2 SW |
1560 | |
1561 | dent = gfs2_dirent_search(dir, name, gfs2_dirent_find, &bh); | |
1562 | if (dent) { | |
1563 | if (IS_ERR(dent)) | |
e231c2ee | 1564 | return ERR_CAST(dent); |
5a00f3cc SW |
1565 | dtype = be16_to_cpu(dent->de_type); |
1566 | addr = be64_to_cpu(dent->de_inum.no_addr); | |
1567 | formal_ino = be64_to_cpu(dent->de_inum.no_formal_ino); | |
dbb7cae2 | 1568 | brelse(bh); |
5a00f3cc SW |
1569 | if (fail_on_exist) |
1570 | return ERR_PTR(-EEXIST); | |
1571 | return gfs2_inode_lookup(dir->i_sb, dtype, addr, formal_ino, 0); | |
dbb7cae2 SW |
1572 | } |
1573 | return ERR_PTR(-ENOENT); | |
1574 | } | |
1575 | ||
1576 | int gfs2_dir_check(struct inode *dir, const struct qstr *name, | |
1577 | const struct gfs2_inode *ip) | |
1578 | { | |
1579 | struct buffer_head *bh; | |
1580 | struct gfs2_dirent *dent; | |
1581 | int ret = -ENOENT; | |
c752666c SW |
1582 | |
1583 | dent = gfs2_dirent_search(dir, name, gfs2_dirent_find, &bh); | |
1584 | if (dent) { | |
1585 | if (IS_ERR(dent)) | |
1586 | return PTR_ERR(dent); | |
dbb7cae2 SW |
1587 | if (ip) { |
1588 | if (be64_to_cpu(dent->de_inum.no_addr) != ip->i_no_addr) | |
1589 | goto out; | |
1590 | if (be64_to_cpu(dent->de_inum.no_formal_ino) != | |
1591 | ip->i_no_formal_ino) | |
1592 | goto out; | |
1593 | if (unlikely(IF2DT(ip->i_inode.i_mode) != | |
1594 | be16_to_cpu(dent->de_type))) { | |
1595 | gfs2_consist_inode(GFS2_I(dir)); | |
1596 | ret = -EIO; | |
1597 | goto out; | |
1598 | } | |
1599 | } | |
1600 | ret = 0; | |
1601 | out: | |
c752666c | 1602 | brelse(bh); |
c752666c | 1603 | } |
dbb7cae2 | 1604 | return ret; |
c752666c SW |
1605 | } |
1606 | ||
01bcb0de SW |
1607 | /** |
1608 | * dir_new_leaf - Add a new leaf onto hash chain | |
1609 | * @inode: The directory | |
1610 | * @name: The name we are adding | |
1611 | * | |
1612 | * This adds a new dir leaf onto an existing leaf when there is not | |
1613 | * enough space to add a new dir entry. This is a last resort after | |
1614 | * we've expanded the hash table to max size and also split existing | |
1615 | * leaf blocks, so it will only occur for very large directories. | |
1616 | * | |
1617 | * The dist parameter is set to 1 for leaf blocks directly attached | |
1618 | * to the hash table, 2 for one layer of indirection, 3 for two layers | |
1619 | * etc. We are thus able to tell the difference between an old leaf | |
1620 | * with dist set to zero (i.e. "don't know") and a new one where we | |
1621 | * set this information for debug/fsck purposes. | |
1622 | * | |
1623 | * Returns: 0 on success, or -ve on error | |
1624 | */ | |
1625 | ||
c752666c SW |
1626 | static int dir_new_leaf(struct inode *inode, const struct qstr *name) |
1627 | { | |
1628 | struct buffer_head *bh, *obh; | |
feaa7bba | 1629 | struct gfs2_inode *ip = GFS2_I(inode); |
c752666c | 1630 | struct gfs2_leaf *leaf, *oleaf; |
01bcb0de | 1631 | u32 dist = 1; |
b3b94faa | 1632 | int error; |
c752666c SW |
1633 | u32 index; |
1634 | u64 bn; | |
b3b94faa | 1635 | |
9a004508 | 1636 | index = name->hash >> (32 - ip->i_depth); |
c752666c SW |
1637 | error = get_first_leaf(ip, index, &obh); |
1638 | if (error) | |
1639 | return error; | |
1640 | do { | |
01bcb0de | 1641 | dist++; |
c752666c SW |
1642 | oleaf = (struct gfs2_leaf *)obh->b_data; |
1643 | bn = be64_to_cpu(oleaf->lf_next); | |
1644 | if (!bn) | |
1645 | break; | |
1646 | brelse(obh); | |
1647 | error = get_leaf(ip, bn, &obh); | |
1648 | if (error) | |
1649 | return error; | |
1650 | } while(1); | |
b3b94faa | 1651 | |
350a9b0a | 1652 | gfs2_trans_add_meta(ip->i_gl, obh); |
c752666c SW |
1653 | |
1654 | leaf = new_leaf(inode, &bh, be16_to_cpu(oleaf->lf_depth)); | |
1655 | if (!leaf) { | |
1656 | brelse(obh); | |
1657 | return -ENOSPC; | |
1658 | } | |
01bcb0de | 1659 | leaf->lf_dist = cpu_to_be32(dist); |
4d8012b6 | 1660 | oleaf->lf_next = cpu_to_be64(bh->b_blocknr); |
c752666c SW |
1661 | brelse(bh); |
1662 | brelse(obh); | |
1663 | ||
1664 | error = gfs2_meta_inode_buffer(ip, &bh); | |
1665 | if (error) | |
1666 | return error; | |
350a9b0a | 1667 | gfs2_trans_add_meta(ip->i_gl, bh); |
77658aad | 1668 | gfs2_add_inode_blocks(&ip->i_inode, 1); |
539e5d6b | 1669 | gfs2_dinode_out(ip, bh->b_data); |
c752666c SW |
1670 | brelse(bh); |
1671 | return 0; | |
b3b94faa DT |
1672 | } |
1673 | ||
44aaada9 SW |
1674 | static u16 gfs2_inode_ra_len(const struct gfs2_inode *ip) |
1675 | { | |
1676 | u64 where = ip->i_no_addr + 1; | |
1677 | if (ip->i_eattr == where) | |
1678 | return 1; | |
1679 | return 0; | |
1680 | } | |
1681 | ||
b3b94faa DT |
1682 | /** |
1683 | * gfs2_dir_add - Add new filename into directory | |
2b47dad8 SW |
1684 | * @inode: The directory inode |
1685 | * @name: The new name | |
1686 | * @nip: The GFS2 inode to be linked in to the directory | |
1687 | * @da: The directory addition info | |
1688 | * | |
1689 | * If the call to gfs2_diradd_alloc_required resulted in there being | |
1690 | * no need to allocate any new directory blocks, then it will contain | |
1691 | * a pointer to the directory entry and the bh in which it resides. We | |
1692 | * can use that without having to repeat the search. If there was no | |
1693 | * free space, then we must now create more space. | |
b3b94faa DT |
1694 | * |
1695 | * Returns: 0 on success, error code on failure | |
1696 | */ | |
1697 | ||
c752666c | 1698 | int gfs2_dir_add(struct inode *inode, const struct qstr *name, |
2b47dad8 | 1699 | const struct gfs2_inode *nip, struct gfs2_diradd *da) |
b3b94faa | 1700 | { |
feaa7bba | 1701 | struct gfs2_inode *ip = GFS2_I(inode); |
2b47dad8 SW |
1702 | struct buffer_head *bh = da->bh; |
1703 | struct gfs2_dirent *dent = da->dent; | |
01bcb0de | 1704 | struct timespec tv; |
c752666c | 1705 | struct gfs2_leaf *leaf; |
b3b94faa DT |
1706 | int error; |
1707 | ||
c752666c | 1708 | while(1) { |
2b47dad8 SW |
1709 | if (da->bh == NULL) { |
1710 | dent = gfs2_dirent_search(inode, name, | |
1711 | gfs2_dirent_find_space, &bh); | |
1712 | } | |
c752666c SW |
1713 | if (dent) { |
1714 | if (IS_ERR(dent)) | |
1715 | return PTR_ERR(dent); | |
1716 | dent = gfs2_init_dirent(inode, dent, name, bh); | |
dbb7cae2 | 1717 | gfs2_inum_out(nip, dent); |
3d6ecb7d | 1718 | dent->de_type = cpu_to_be16(IF2DT(nip->i_inode.i_mode)); |
44aaada9 | 1719 | dent->de_rahead = cpu_to_be16(gfs2_inode_ra_len(nip)); |
01bcb0de | 1720 | tv = CURRENT_TIME; |
383f01fb | 1721 | if (ip->i_diskflags & GFS2_DIF_EXHASH) { |
c752666c | 1722 | leaf = (struct gfs2_leaf *)bh->b_data; |
bb16b342 | 1723 | be16_add_cpu(&leaf->lf_entries, 1); |
01bcb0de SW |
1724 | leaf->lf_nsec = cpu_to_be32(tv.tv_nsec); |
1725 | leaf->lf_sec = cpu_to_be64(tv.tv_sec); | |
c752666c | 1726 | } |
2b47dad8 SW |
1727 | da->dent = NULL; |
1728 | da->bh = NULL; | |
c752666c | 1729 | brelse(bh); |
ad6203f2 | 1730 | ip->i_entries++; |
01bcb0de | 1731 | ip->i_inode.i_mtime = ip->i_inode.i_ctime = tv; |
3d6ecb7d SW |
1732 | if (S_ISDIR(nip->i_inode.i_mode)) |
1733 | inc_nlink(&ip->i_inode); | |
343cd8f0 | 1734 | mark_inode_dirty(inode); |
c752666c SW |
1735 | error = 0; |
1736 | break; | |
1737 | } | |
383f01fb | 1738 | if (!(ip->i_diskflags & GFS2_DIF_EXHASH)) { |
c752666c SW |
1739 | error = dir_make_exhash(inode); |
1740 | if (error) | |
1741 | break; | |
1742 | continue; | |
1743 | } | |
1744 | error = dir_split_leaf(inode, name); | |
1745 | if (error == 0) | |
1746 | continue; | |
e90deff5 | 1747 | if (error < 0) |
c752666c | 1748 | break; |
9a004508 | 1749 | if (ip->i_depth < GFS2_DIR_MAX_DEPTH) { |
c752666c SW |
1750 | error = dir_double_exhash(ip); |
1751 | if (error) | |
1752 | break; | |
1753 | error = dir_split_leaf(inode, name); | |
e90deff5 | 1754 | if (error < 0) |
c752666c | 1755 | break; |
e90deff5 SW |
1756 | if (error == 0) |
1757 | continue; | |
c752666c SW |
1758 | } |
1759 | error = dir_new_leaf(inode, name); | |
1760 | if (!error) | |
1761 | continue; | |
1762 | error = -ENOSPC; | |
1763 | break; | |
1764 | } | |
b3b94faa DT |
1765 | return error; |
1766 | } | |
1767 | ||
c752666c | 1768 | |
b3b94faa DT |
1769 | /** |
1770 | * gfs2_dir_del - Delete a directory entry | |
1771 | * @dip: The GFS2 inode | |
1772 | * @filename: The filename | |
1773 | * | |
1774 | * Returns: 0 on success, error code on failure | |
1775 | */ | |
1776 | ||
855d23ce | 1777 | int gfs2_dir_del(struct gfs2_inode *dip, const struct dentry *dentry) |
b3b94faa | 1778 | { |
855d23ce | 1779 | const struct qstr *name = &dentry->d_name; |
c752666c SW |
1780 | struct gfs2_dirent *dent, *prev = NULL; |
1781 | struct buffer_head *bh; | |
01bcb0de | 1782 | struct timespec tv = CURRENT_TIME; |
b3b94faa | 1783 | |
c752666c SW |
1784 | /* Returns _either_ the entry (if its first in block) or the |
1785 | previous entry otherwise */ | |
feaa7bba | 1786 | dent = gfs2_dirent_search(&dip->i_inode, name, gfs2_dirent_prev, &bh); |
c752666c SW |
1787 | if (!dent) { |
1788 | gfs2_consist_inode(dip); | |
1789 | return -EIO; | |
1790 | } | |
1791 | if (IS_ERR(dent)) { | |
1792 | gfs2_consist_inode(dip); | |
1793 | return PTR_ERR(dent); | |
1794 | } | |
1795 | /* If not first in block, adjust pointers accordingly */ | |
71b86f56 | 1796 | if (gfs2_dirent_find(dent, name, NULL) == 0) { |
c752666c SW |
1797 | prev = dent; |
1798 | dent = (struct gfs2_dirent *)((char *)dent + be16_to_cpu(prev->de_rec_len)); | |
1799 | } | |
1800 | ||
1801 | dirent_del(dip, bh, prev, dent); | |
383f01fb | 1802 | if (dip->i_diskflags & GFS2_DIF_EXHASH) { |
c752666c SW |
1803 | struct gfs2_leaf *leaf = (struct gfs2_leaf *)bh->b_data; |
1804 | u16 entries = be16_to_cpu(leaf->lf_entries); | |
1805 | if (!entries) | |
1806 | gfs2_consist_inode(dip); | |
1807 | leaf->lf_entries = cpu_to_be16(--entries); | |
01bcb0de SW |
1808 | leaf->lf_nsec = cpu_to_be32(tv.tv_nsec); |
1809 | leaf->lf_sec = cpu_to_be64(tv.tv_sec); | |
c752666c | 1810 | } |
ed386507 | 1811 | brelse(bh); |
c752666c | 1812 | |
ad6203f2 | 1813 | if (!dip->i_entries) |
c752666c | 1814 | gfs2_consist_inode(dip); |
ad6203f2 | 1815 | dip->i_entries--; |
01bcb0de | 1816 | dip->i_inode.i_mtime = dip->i_inode.i_ctime = tv; |
e36cb0b8 | 1817 | if (d_is_dir(dentry)) |
855d23ce | 1818 | drop_nlink(&dip->i_inode); |
feaa7bba | 1819 | mark_inode_dirty(&dip->i_inode); |
b3b94faa | 1820 | |
ab9bbda0 | 1821 | return 0; |
b3b94faa DT |
1822 | } |
1823 | ||
b3b94faa DT |
1824 | /** |
1825 | * gfs2_dir_mvino - Change inode number of directory entry | |
1826 | * @dip: The GFS2 inode | |
1827 | * @filename: | |
1828 | * @new_inode: | |
1829 | * | |
1830 | * This routine changes the inode number of a directory entry. It's used | |
1831 | * by rename to change ".." when a directory is moved. | |
1832 | * Assumes a glock is held on dvp. | |
1833 | * | |
1834 | * Returns: errno | |
1835 | */ | |
1836 | ||
c752666c | 1837 | int gfs2_dir_mvino(struct gfs2_inode *dip, const struct qstr *filename, |
dbb7cae2 | 1838 | const struct gfs2_inode *nip, unsigned int new_type) |
b3b94faa | 1839 | { |
c752666c SW |
1840 | struct buffer_head *bh; |
1841 | struct gfs2_dirent *dent; | |
b3b94faa DT |
1842 | int error; |
1843 | ||
feaa7bba | 1844 | dent = gfs2_dirent_search(&dip->i_inode, filename, gfs2_dirent_find, &bh); |
c752666c SW |
1845 | if (!dent) { |
1846 | gfs2_consist_inode(dip); | |
1847 | return -EIO; | |
1848 | } | |
1849 | if (IS_ERR(dent)) | |
1850 | return PTR_ERR(dent); | |
b3b94faa | 1851 | |
350a9b0a | 1852 | gfs2_trans_add_meta(dip->i_gl, bh); |
dbb7cae2 | 1853 | gfs2_inum_out(nip, dent); |
c752666c SW |
1854 | dent->de_type = cpu_to_be16(new_type); |
1855 | ||
383f01fb | 1856 | if (dip->i_diskflags & GFS2_DIF_EXHASH) { |
c752666c SW |
1857 | brelse(bh); |
1858 | error = gfs2_meta_inode_buffer(dip, &bh); | |
1859 | if (error) | |
1860 | return error; | |
350a9b0a | 1861 | gfs2_trans_add_meta(dip->i_gl, bh); |
c752666c SW |
1862 | } |
1863 | ||
4bd91ba1 | 1864 | dip->i_inode.i_mtime = dip->i_inode.i_ctime = CURRENT_TIME; |
539e5d6b | 1865 | gfs2_dinode_out(dip, bh->b_data); |
c752666c SW |
1866 | brelse(bh); |
1867 | return 0; | |
b3b94faa DT |
1868 | } |
1869 | ||
b3b94faa DT |
1870 | /** |
1871 | * leaf_dealloc - Deallocate a directory leaf | |
1872 | * @dip: the directory | |
1873 | * @index: the hash table offset in the directory | |
1874 | * @len: the number of pointers to this leaf | |
1875 | * @leaf_no: the leaf number | |
ec038c82 | 1876 | * @leaf_bh: buffer_head for the starting leaf |
d24a7a43 | 1877 | * last_dealloc: 1 if this is the final dealloc for the leaf, else 0 |
b3b94faa DT |
1878 | * |
1879 | * Returns: errno | |
1880 | */ | |
1881 | ||
cd915493 | 1882 | static int leaf_dealloc(struct gfs2_inode *dip, u32 index, u32 len, |
ec038c82 BP |
1883 | u64 leaf_no, struct buffer_head *leaf_bh, |
1884 | int last_dealloc) | |
b3b94faa | 1885 | { |
feaa7bba | 1886 | struct gfs2_sbd *sdp = GFS2_SB(&dip->i_inode); |
c752666c | 1887 | struct gfs2_leaf *tmp_leaf; |
b3b94faa DT |
1888 | struct gfs2_rgrp_list rlist; |
1889 | struct buffer_head *bh, *dibh; | |
cd915493 | 1890 | u64 blk, nblk; |
b3b94faa DT |
1891 | unsigned int rg_blocks = 0, l_blocks = 0; |
1892 | char *ht; | |
cd915493 | 1893 | unsigned int x, size = len * sizeof(u64); |
b3b94faa DT |
1894 | int error; |
1895 | ||
5e2f7d61 BP |
1896 | error = gfs2_rindex_update(sdp); |
1897 | if (error) | |
1898 | return error; | |
1899 | ||
b3b94faa DT |
1900 | memset(&rlist, 0, sizeof(struct gfs2_rgrp_list)); |
1901 | ||
8be04b93 | 1902 | ht = kzalloc(size, GFP_NOFS | __GFP_NOWARN); |
e8830d88 | 1903 | if (ht == NULL) |
7456a37d OD |
1904 | ht = __vmalloc(size, GFP_NOFS | __GFP_NOWARN | __GFP_ZERO, |
1905 | PAGE_KERNEL); | |
b3b94faa DT |
1906 | if (!ht) |
1907 | return -ENOMEM; | |
1908 | ||
f4108a60 | 1909 | error = gfs2_quota_hold(dip, NO_UID_QUOTA_CHANGE, NO_GID_QUOTA_CHANGE); |
b3b94faa | 1910 | if (error) |
5407e242 | 1911 | goto out; |
b3b94faa | 1912 | |
b3b94faa | 1913 | /* Count the number of leaves */ |
ec038c82 | 1914 | bh = leaf_bh; |
b3b94faa | 1915 | |
c752666c | 1916 | for (blk = leaf_no; blk; blk = nblk) { |
ec038c82 BP |
1917 | if (blk != leaf_no) { |
1918 | error = get_leaf(dip, blk, &bh); | |
1919 | if (error) | |
1920 | goto out_rlist; | |
1921 | } | |
c752666c SW |
1922 | tmp_leaf = (struct gfs2_leaf *)bh->b_data; |
1923 | nblk = be64_to_cpu(tmp_leaf->lf_next); | |
ec038c82 BP |
1924 | if (blk != leaf_no) |
1925 | brelse(bh); | |
b3b94faa | 1926 | |
70b0c365 | 1927 | gfs2_rlist_add(dip, &rlist, blk); |
b3b94faa DT |
1928 | l_blocks++; |
1929 | } | |
1930 | ||
fe6c991c | 1931 | gfs2_rlist_alloc(&rlist, LM_ST_EXCLUSIVE); |
b3b94faa DT |
1932 | |
1933 | for (x = 0; x < rlist.rl_rgrps; x++) { | |
1934 | struct gfs2_rgrpd *rgd; | |
5c676f6d | 1935 | rgd = rlist.rl_ghs[x].gh_gl->gl_object; |
bb8d8a6f | 1936 | rg_blocks += rgd->rd_length; |
b3b94faa DT |
1937 | } |
1938 | ||
1939 | error = gfs2_glock_nq_m(rlist.rl_rgrps, rlist.rl_ghs); | |
1940 | if (error) | |
1941 | goto out_rlist; | |
1942 | ||
1943 | error = gfs2_trans_begin(sdp, | |
5c676f6d | 1944 | rg_blocks + (DIV_ROUND_UP(size, sdp->sd_jbsize) + 1) + |
b3b94faa DT |
1945 | RES_DINODE + RES_STATFS + RES_QUOTA, l_blocks); |
1946 | if (error) | |
1947 | goto out_rg_gunlock; | |
1948 | ||
ec038c82 BP |
1949 | bh = leaf_bh; |
1950 | ||
c752666c | 1951 | for (blk = leaf_no; blk; blk = nblk) { |
ec038c82 BP |
1952 | if (blk != leaf_no) { |
1953 | error = get_leaf(dip, blk, &bh); | |
1954 | if (error) | |
1955 | goto out_end_trans; | |
1956 | } | |
c752666c SW |
1957 | tmp_leaf = (struct gfs2_leaf *)bh->b_data; |
1958 | nblk = be64_to_cpu(tmp_leaf->lf_next); | |
ec038c82 BP |
1959 | if (blk != leaf_no) |
1960 | brelse(bh); | |
b3b94faa DT |
1961 | |
1962 | gfs2_free_meta(dip, blk, 1); | |
77658aad | 1963 | gfs2_add_inode_blocks(&dip->i_inode, -1); |
b3b94faa DT |
1964 | } |
1965 | ||
cd915493 | 1966 | error = gfs2_dir_write_data(dip, ht, index * sizeof(u64), size); |
b3b94faa DT |
1967 | if (error != size) { |
1968 | if (error >= 0) | |
1969 | error = -EIO; | |
1970 | goto out_end_trans; | |
1971 | } | |
1972 | ||
1973 | error = gfs2_meta_inode_buffer(dip, &dibh); | |
1974 | if (error) | |
1975 | goto out_end_trans; | |
1976 | ||
350a9b0a | 1977 | gfs2_trans_add_meta(dip->i_gl, dibh); |
d24a7a43 BP |
1978 | /* On the last dealloc, make this a regular file in case we crash. |
1979 | (We don't want to free these blocks a second time.) */ | |
1980 | if (last_dealloc) | |
1981 | dip->i_inode.i_mode = S_IFREG; | |
539e5d6b | 1982 | gfs2_dinode_out(dip, dibh->b_data); |
b3b94faa DT |
1983 | brelse(dibh); |
1984 | ||
a91ea69f | 1985 | out_end_trans: |
b3b94faa | 1986 | gfs2_trans_end(sdp); |
a91ea69f | 1987 | out_rg_gunlock: |
b3b94faa | 1988 | gfs2_glock_dq_m(rlist.rl_rgrps, rlist.rl_ghs); |
a91ea69f | 1989 | out_rlist: |
b3b94faa | 1990 | gfs2_rlist_free(&rlist); |
b3b94faa | 1991 | gfs2_quota_unhold(dip); |
182fe5ab | 1992 | out: |
3cdcf63e | 1993 | kvfree(ht); |
b3b94faa DT |
1994 | return error; |
1995 | } | |
1996 | ||
1997 | /** | |
1998 | * gfs2_dir_exhash_dealloc - free all the leaf blocks in a directory | |
1999 | * @dip: the directory | |
2000 | * | |
2001 | * Dealloc all on-disk directory leaves to FREEMETA state | |
2002 | * Change on-disk inode type to "regular file" | |
2003 | * | |
2004 | * Returns: errno | |
2005 | */ | |
2006 | ||
2007 | int gfs2_dir_exhash_dealloc(struct gfs2_inode *dip) | |
2008 | { | |
556bb179 BP |
2009 | struct buffer_head *bh; |
2010 | struct gfs2_leaf *leaf; | |
2011 | u32 hsize, len; | |
556bb179 BP |
2012 | u32 index = 0, next_index; |
2013 | __be64 *lp; | |
2014 | u64 leaf_no; | |
2015 | int error = 0, last; | |
2016 | ||
2017 | hsize = 1 << dip->i_depth; | |
556bb179 | 2018 | |
17d539f0 SW |
2019 | lp = gfs2_dir_get_hash_table(dip); |
2020 | if (IS_ERR(lp)) | |
2021 | return PTR_ERR(lp); | |
556bb179 BP |
2022 | |
2023 | while (index < hsize) { | |
17d539f0 | 2024 | leaf_no = be64_to_cpu(lp[index]); |
556bb179 BP |
2025 | if (leaf_no) { |
2026 | error = get_leaf(dip, leaf_no, &bh); | |
2027 | if (error) | |
2028 | goto out; | |
2029 | leaf = (struct gfs2_leaf *)bh->b_data; | |
2030 | len = 1 << (dip->i_depth - be16_to_cpu(leaf->lf_depth)); | |
2031 | ||
2032 | next_index = (index & ~(len - 1)) + len; | |
2033 | last = ((next_index >= hsize) ? 1 : 0); | |
2034 | error = leaf_dealloc(dip, index, len, leaf_no, bh, | |
2035 | last); | |
2036 | brelse(bh); | |
2037 | if (error) | |
2038 | goto out; | |
2039 | index = next_index; | |
2040 | } else | |
2041 | index++; | |
2042 | } | |
2043 | ||
2044 | if (index != hsize) { | |
2045 | gfs2_consist_inode(dip); | |
2046 | error = -EIO; | |
2047 | } | |
2048 | ||
2049 | out: | |
556bb179 BP |
2050 | |
2051 | return error; | |
b3b94faa DT |
2052 | } |
2053 | ||
2054 | /** | |
2055 | * gfs2_diradd_alloc_required - find if adding entry will require an allocation | |
2056 | * @ip: the file being written to | |
2057 | * @filname: the filename that's going to be added | |
3c1c0ae1 | 2058 | * @da: The structure to return dir alloc info |
b3b94faa | 2059 | * |
3c1c0ae1 | 2060 | * Returns: 0 if ok, -ve on error |
b3b94faa DT |
2061 | */ |
2062 | ||
3c1c0ae1 SW |
2063 | int gfs2_diradd_alloc_required(struct inode *inode, const struct qstr *name, |
2064 | struct gfs2_diradd *da) | |
b3b94faa | 2065 | { |
22b5a6c0 | 2066 | struct gfs2_inode *ip = GFS2_I(inode); |
3c1c0ae1 | 2067 | struct gfs2_sbd *sdp = GFS2_SB(inode); |
22b5a6c0 | 2068 | const unsigned int extra = sizeof(struct gfs2_dinode) - sizeof(struct gfs2_leaf); |
c752666c SW |
2069 | struct gfs2_dirent *dent; |
2070 | struct buffer_head *bh; | |
b3b94faa | 2071 | |
3c1c0ae1 | 2072 | da->nr_blocks = 0; |
2b47dad8 SW |
2073 | da->bh = NULL; |
2074 | da->dent = NULL; | |
3c1c0ae1 | 2075 | |
c752666c | 2076 | dent = gfs2_dirent_search(inode, name, gfs2_dirent_find_space, &bh); |
ed386507 | 2077 | if (!dent) { |
3c1c0ae1 | 2078 | da->nr_blocks = sdp->sd_max_dirres; |
22b5a6c0 SW |
2079 | if (!(ip->i_diskflags & GFS2_DIF_EXHASH) && |
2080 | (GFS2_DIRENT_SIZE(name->len) < extra)) | |
2081 | da->nr_blocks = 1; | |
3c1c0ae1 | 2082 | return 0; |
ed386507 | 2083 | } |
c752666c SW |
2084 | if (IS_ERR(dent)) |
2085 | return PTR_ERR(dent); | |
19aeb5a6 BP |
2086 | |
2087 | if (da->save_loc) { | |
2088 | da->bh = bh; | |
2089 | da->dent = dent; | |
2090 | } else { | |
2091 | brelse(bh); | |
2092 | } | |
c752666c | 2093 | return 0; |
b3b94faa DT |
2094 | } |
2095 |