]>
Commit | Line | Data |
---|---|---|
328970de | 1 | // SPDX-License-Identifier: GPL-2.0-or-later |
ccd979bd MF |
2 | /* -*- mode: c; c-basic-offset: 8; -*- |
3 | * vim: noexpandtab sw=8 ts=8 sts=0: | |
4 | * | |
5 | * dir.c | |
6 | * | |
7 | * Creates, reads, walks and deletes directory-nodes | |
8 | * | |
9 | * Copyright (C) 2002, 2004 Oracle. All rights reserved. | |
10 | * | |
11 | * Portions of this code from linux/fs/ext3/dir.c | |
12 | * | |
13 | * Copyright (C) 1992, 1993, 1994, 1995 | |
14 | * Remy Card (card@masi.ibp.fr) | |
15 | * Laboratoire MASI - Institut Blaise pascal | |
16 | * Universite Pierre et Marie Curie (Paris VI) | |
17 | * | |
18 | * from | |
19 | * | |
20 | * linux/fs/minix/dir.c | |
21 | * | |
762515a8 | 22 | * Copyright (C) 1991, 1992 Linus Torvalds |
ccd979bd MF |
23 | */ |
24 | ||
25 | #include <linux/fs.h> | |
26 | #include <linux/types.h> | |
27 | #include <linux/slab.h> | |
28 | #include <linux/highmem.h> | |
a90714c1 | 29 | #include <linux/quotaops.h> |
9b7895ef | 30 | #include <linux/sort.h> |
cc56c33e | 31 | #include <linux/iversion.h> |
ccd979bd | 32 | |
ccd979bd MF |
33 | #include <cluster/masklog.h> |
34 | ||
35 | #include "ocfs2.h" | |
36 | ||
37 | #include "alloc.h" | |
c175a518 | 38 | #include "blockcheck.h" |
ccd979bd MF |
39 | #include "dir.h" |
40 | #include "dlmglue.h" | |
41 | #include "extent_map.h" | |
42 | #include "file.h" | |
43 | #include "inode.h" | |
44 | #include "journal.h" | |
45 | #include "namei.h" | |
46 | #include "suballoc.h" | |
316f4b9f | 47 | #include "super.h" |
9b7895ef | 48 | #include "sysfile.h" |
ccd979bd | 49 | #include "uptodate.h" |
f1088d47 | 50 | #include "ocfs2_trace.h" |
ccd979bd MF |
51 | |
52 | #include "buffer_head_io.h" | |
53 | ||
316f4b9f MF |
54 | #define NAMEI_RA_CHUNKS 2 |
55 | #define NAMEI_RA_BLOCKS 4 | |
56 | #define NAMEI_RA_SIZE (NAMEI_RA_CHUNKS * NAMEI_RA_BLOCKS) | |
316f4b9f | 57 | |
316f4b9f MF |
58 | static int ocfs2_do_extend_dir(struct super_block *sb, |
59 | handle_t *handle, | |
60 | struct inode *dir, | |
61 | struct buffer_head *parent_fe_bh, | |
62 | struct ocfs2_alloc_context *data_ac, | |
63 | struct ocfs2_alloc_context *meta_ac, | |
64 | struct buffer_head **new_bh); | |
e7c17e43 | 65 | static int ocfs2_dir_indexed(struct inode *inode); |
316f4b9f | 66 | |
87d35a74 MF |
67 | /* |
68 | * These are distinct checks because future versions of the file system will | |
69 | * want to have a trailing dirent structure independent of indexing. | |
70 | */ | |
e7c17e43 | 71 | static int ocfs2_supports_dir_trailer(struct inode *dir) |
87d35a74 | 72 | { |
e7c17e43 MF |
73 | struct ocfs2_super *osb = OCFS2_SB(dir->i_sb); |
74 | ||
87d35a74 MF |
75 | if (OCFS2_I(dir)->ip_dyn_features & OCFS2_INLINE_DATA_FL) |
76 | return 0; | |
77 | ||
e7c17e43 | 78 | return ocfs2_meta_ecc(osb) || ocfs2_dir_indexed(dir); |
87d35a74 MF |
79 | } |
80 | ||
e7c17e43 MF |
81 | /* |
82 | * "new' here refers to the point at which we're creating a new | |
83 | * directory via "mkdir()", but also when we're expanding an inline | |
84 | * directory. In either case, we don't yet have the indexing bit set | |
85 | * on the directory, so the standard checks will fail in when metaecc | |
86 | * is turned off. Only directory-initialization type functions should | |
87 | * use this then. Everything else wants ocfs2_supports_dir_trailer() | |
88 | */ | |
89 | static int ocfs2_new_dir_wants_trailer(struct inode *dir) | |
87d35a74 | 90 | { |
e7c17e43 MF |
91 | struct ocfs2_super *osb = OCFS2_SB(dir->i_sb); |
92 | ||
93 | return ocfs2_meta_ecc(osb) || | |
94 | ocfs2_supports_indexed_dirs(osb); | |
87d35a74 MF |
95 | } |
96 | ||
97 | static inline unsigned int ocfs2_dir_trailer_blk_off(struct super_block *sb) | |
98 | { | |
99 | return sb->s_blocksize - sizeof(struct ocfs2_dir_block_trailer); | |
100 | } | |
101 | ||
102 | #define ocfs2_trailer_from_bh(_bh, _sb) ((struct ocfs2_dir_block_trailer *) ((_bh)->b_data + ocfs2_dir_trailer_blk_off((_sb)))) | |
103 | ||
c175a518 JB |
104 | /* XXX ocfs2_block_dqtrailer() is similar but not quite - can we make |
105 | * them more consistent? */ | |
106 | struct ocfs2_dir_block_trailer *ocfs2_dir_trailer_from_size(int blocksize, | |
107 | void *data) | |
108 | { | |
109 | char *p = data; | |
110 | ||
111 | p += blocksize - sizeof(struct ocfs2_dir_block_trailer); | |
112 | return (struct ocfs2_dir_block_trailer *)p; | |
113 | } | |
114 | ||
87d35a74 MF |
115 | /* |
116 | * XXX: This is executed once on every dirent. We should consider optimizing | |
117 | * it. | |
118 | */ | |
119 | static int ocfs2_skip_dir_trailer(struct inode *dir, | |
120 | struct ocfs2_dir_entry *de, | |
121 | unsigned long offset, | |
122 | unsigned long blklen) | |
123 | { | |
124 | unsigned long toff = blklen - sizeof(struct ocfs2_dir_block_trailer); | |
125 | ||
e7c17e43 | 126 | if (!ocfs2_supports_dir_trailer(dir)) |
87d35a74 MF |
127 | return 0; |
128 | ||
129 | if (offset != toff) | |
130 | return 0; | |
131 | ||
132 | return 1; | |
133 | } | |
134 | ||
135 | static void ocfs2_init_dir_trailer(struct inode *inode, | |
e7c17e43 | 136 | struct buffer_head *bh, u16 rec_len) |
87d35a74 MF |
137 | { |
138 | struct ocfs2_dir_block_trailer *trailer; | |
139 | ||
140 | trailer = ocfs2_trailer_from_bh(bh, inode->i_sb); | |
141 | strcpy(trailer->db_signature, OCFS2_DIR_TRAILER_SIGNATURE); | |
142 | trailer->db_compat_rec_len = | |
143 | cpu_to_le16(sizeof(struct ocfs2_dir_block_trailer)); | |
144 | trailer->db_parent_dinode = cpu_to_le64(OCFS2_I(inode)->ip_blkno); | |
145 | trailer->db_blkno = cpu_to_le64(bh->b_blocknr); | |
e7c17e43 MF |
146 | trailer->db_free_rec_len = cpu_to_le16(rec_len); |
147 | } | |
148 | /* | |
149 | * Link an unindexed block with a dir trailer structure into the index free | |
150 | * list. This function will modify dirdata_bh, but assumes you've already | |
151 | * passed it to the journal. | |
152 | */ | |
153 | static int ocfs2_dx_dir_link_trailer(struct inode *dir, handle_t *handle, | |
154 | struct buffer_head *dx_root_bh, | |
155 | struct buffer_head *dirdata_bh) | |
156 | { | |
157 | int ret; | |
158 | struct ocfs2_dx_root_block *dx_root; | |
159 | struct ocfs2_dir_block_trailer *trailer; | |
160 | ||
0cf2f763 | 161 | ret = ocfs2_journal_access_dr(handle, INODE_CACHE(dir), dx_root_bh, |
e7c17e43 MF |
162 | OCFS2_JOURNAL_ACCESS_WRITE); |
163 | if (ret) { | |
164 | mlog_errno(ret); | |
165 | goto out; | |
166 | } | |
167 | trailer = ocfs2_trailer_from_bh(dirdata_bh, dir->i_sb); | |
168 | dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data; | |
169 | ||
170 | trailer->db_free_next = dx_root->dr_free_blk; | |
171 | dx_root->dr_free_blk = cpu_to_le64(dirdata_bh->b_blocknr); | |
172 | ||
173 | ocfs2_journal_dirty(handle, dx_root_bh); | |
174 | ||
175 | out: | |
176 | return ret; | |
177 | } | |
178 | ||
179 | static int ocfs2_free_list_at_root(struct ocfs2_dir_lookup_result *res) | |
180 | { | |
181 | return res->dl_prev_leaf_bh == NULL; | |
87d35a74 MF |
182 | } |
183 | ||
4a12ca3a MF |
184 | void ocfs2_free_dir_lookup_result(struct ocfs2_dir_lookup_result *res) |
185 | { | |
4ed8a6bb | 186 | brelse(res->dl_dx_root_bh); |
4a12ca3a | 187 | brelse(res->dl_leaf_bh); |
9b7895ef | 188 | brelse(res->dl_dx_leaf_bh); |
e7c17e43 | 189 | brelse(res->dl_prev_leaf_bh); |
9b7895ef MF |
190 | } |
191 | ||
192 | static int ocfs2_dir_indexed(struct inode *inode) | |
193 | { | |
194 | if (OCFS2_I(inode)->ip_dyn_features & OCFS2_INDEXED_DIR_FL) | |
195 | return 1; | |
196 | return 0; | |
197 | } | |
198 | ||
4ed8a6bb MF |
199 | static inline int ocfs2_dx_root_inline(struct ocfs2_dx_root_block *dx_root) |
200 | { | |
201 | return dx_root->dr_flags & OCFS2_DX_FLAG_INLINE; | |
202 | } | |
203 | ||
9b7895ef MF |
204 | /* |
205 | * Hashing code adapted from ext3 | |
206 | */ | |
207 | #define DELTA 0x9E3779B9 | |
208 | ||
209 | static void TEA_transform(__u32 buf[4], __u32 const in[]) | |
210 | { | |
211 | __u32 sum = 0; | |
212 | __u32 b0 = buf[0], b1 = buf[1]; | |
213 | __u32 a = in[0], b = in[1], c = in[2], d = in[3]; | |
214 | int n = 16; | |
215 | ||
216 | do { | |
217 | sum += DELTA; | |
218 | b0 += ((b1 << 4)+a) ^ (b1+sum) ^ ((b1 >> 5)+b); | |
219 | b1 += ((b0 << 4)+c) ^ (b0+sum) ^ ((b0 >> 5)+d); | |
220 | } while (--n); | |
221 | ||
222 | buf[0] += b0; | |
223 | buf[1] += b1; | |
224 | } | |
225 | ||
226 | static void str2hashbuf(const char *msg, int len, __u32 *buf, int num) | |
227 | { | |
228 | __u32 pad, val; | |
229 | int i; | |
230 | ||
231 | pad = (__u32)len | ((__u32)len << 8); | |
232 | pad |= pad << 16; | |
233 | ||
234 | val = pad; | |
235 | if (len > num*4) | |
236 | len = num * 4; | |
237 | for (i = 0; i < len; i++) { | |
238 | if ((i % 4) == 0) | |
239 | val = pad; | |
240 | val = msg[i] + (val << 8); | |
241 | if ((i % 4) == 3) { | |
242 | *buf++ = val; | |
243 | val = pad; | |
244 | num--; | |
245 | } | |
246 | } | |
247 | if (--num >= 0) | |
248 | *buf++ = val; | |
249 | while (--num >= 0) | |
250 | *buf++ = pad; | |
251 | } | |
252 | ||
253 | static void ocfs2_dx_dir_name_hash(struct inode *dir, const char *name, int len, | |
254 | struct ocfs2_dx_hinfo *hinfo) | |
255 | { | |
256 | struct ocfs2_super *osb = OCFS2_SB(dir->i_sb); | |
257 | const char *p; | |
258 | __u32 in[8], buf[4]; | |
259 | ||
260 | /* | |
261 | * XXX: Is this really necessary, if the index is never looked | |
262 | * at by readdir? Is a hash value of '0' a bad idea? | |
263 | */ | |
264 | if ((len == 1 && !strncmp(".", name, 1)) || | |
265 | (len == 2 && !strncmp("..", name, 2))) { | |
266 | buf[0] = buf[1] = 0; | |
267 | goto out; | |
268 | } | |
269 | ||
270 | #ifdef OCFS2_DEBUG_DX_DIRS | |
271 | /* | |
272 | * This makes it very easy to debug indexing problems. We | |
273 | * should never allow this to be selected without hand editing | |
274 | * this file though. | |
275 | */ | |
276 | buf[0] = buf[1] = len; | |
277 | goto out; | |
278 | #endif | |
279 | ||
280 | memcpy(buf, osb->osb_dx_seed, sizeof(buf)); | |
281 | ||
282 | p = name; | |
283 | while (len > 0) { | |
284 | str2hashbuf(p, len, in, 4); | |
285 | TEA_transform(buf, in); | |
286 | len -= 16; | |
287 | p += 16; | |
288 | } | |
289 | ||
290 | out: | |
291 | hinfo->major_hash = buf[0]; | |
292 | hinfo->minor_hash = buf[1]; | |
4a12ca3a MF |
293 | } |
294 | ||
23193e51 MF |
295 | /* |
296 | * bh passed here can be an inode block or a dir data block, depending | |
297 | * on the inode inline data flag. | |
298 | */ | |
5eae5b96 MF |
299 | static int ocfs2_check_dir_entry(struct inode * dir, |
300 | struct ocfs2_dir_entry * de, | |
301 | struct buffer_head * bh, | |
302 | unsigned long offset) | |
316f4b9f MF |
303 | { |
304 | const char *error_msg = NULL; | |
305 | const int rlen = le16_to_cpu(de->rec_len); | |
306 | ||
1dd9ffc8 | 307 | if (unlikely(rlen < OCFS2_DIR_REC_LEN(1))) |
316f4b9f | 308 | error_msg = "rec_len is smaller than minimal"; |
1dd9ffc8 | 309 | else if (unlikely(rlen % 4 != 0)) |
316f4b9f | 310 | error_msg = "rec_len % 4 != 0"; |
1dd9ffc8 | 311 | else if (unlikely(rlen < OCFS2_DIR_REC_LEN(de->name_len))) |
316f4b9f | 312 | error_msg = "rec_len is too small for name_len"; |
1dd9ffc8 TM |
313 | else if (unlikely( |
314 | ((char *) de - bh->b_data) + rlen > dir->i_sb->s_blocksize)) | |
316f4b9f MF |
315 | error_msg = "directory entry across blocks"; |
316 | ||
1dd9ffc8 | 317 | if (unlikely(error_msg != NULL)) |
316f4b9f MF |
318 | mlog(ML_ERROR, "bad entry in directory #%llu: %s - " |
319 | "offset=%lu, inode=%llu, rec_len=%d, name_len=%d\n", | |
320 | (unsigned long long)OCFS2_I(dir)->ip_blkno, error_msg, | |
321 | offset, (unsigned long long)le64_to_cpu(de->inode), rlen, | |
322 | de->name_len); | |
1dd9ffc8 | 323 | |
316f4b9f MF |
324 | return error_msg == NULL ? 1 : 0; |
325 | } | |
326 | ||
327 | static inline int ocfs2_match(int len, | |
328 | const char * const name, | |
329 | struct ocfs2_dir_entry *de) | |
330 | { | |
331 | if (len != de->name_len) | |
332 | return 0; | |
333 | if (!de->inode) | |
334 | return 0; | |
335 | return !memcmp(name, de->name, len); | |
336 | } | |
337 | ||
338 | /* | |
339 | * Returns 0 if not found, -1 on failure, and 1 on success | |
340 | */ | |
42b16b3f | 341 | static inline int ocfs2_search_dirblock(struct buffer_head *bh, |
316f4b9f MF |
342 | struct inode *dir, |
343 | const char *name, int namelen, | |
344 | unsigned long offset, | |
23193e51 MF |
345 | char *first_de, |
346 | unsigned int bytes, | |
316f4b9f MF |
347 | struct ocfs2_dir_entry **res_dir) |
348 | { | |
349 | struct ocfs2_dir_entry *de; | |
350 | char *dlimit, *de_buf; | |
351 | int de_len; | |
352 | int ret = 0; | |
353 | ||
23193e51 MF |
354 | de_buf = first_de; |
355 | dlimit = de_buf + bytes; | |
316f4b9f MF |
356 | |
357 | while (de_buf < dlimit) { | |
358 | /* this code is executed quadratically often */ | |
359 | /* do minimal checking `by hand' */ | |
360 | ||
361 | de = (struct ocfs2_dir_entry *) de_buf; | |
362 | ||
363 | if (de_buf + namelen <= dlimit && | |
364 | ocfs2_match(namelen, name, de)) { | |
365 | /* found a match - just to be sure, do a full check */ | |
366 | if (!ocfs2_check_dir_entry(dir, de, bh, offset)) { | |
367 | ret = -1; | |
368 | goto bail; | |
369 | } | |
370 | *res_dir = de; | |
371 | ret = 1; | |
372 | goto bail; | |
373 | } | |
374 | ||
375 | /* prevent looping on a bad block */ | |
376 | de_len = le16_to_cpu(de->rec_len); | |
377 | if (de_len <= 0) { | |
378 | ret = -1; | |
379 | goto bail; | |
380 | } | |
381 | ||
382 | de_buf += de_len; | |
383 | offset += de_len; | |
384 | } | |
385 | ||
386 | bail: | |
f1088d47 | 387 | trace_ocfs2_search_dirblock(ret); |
316f4b9f MF |
388 | return ret; |
389 | } | |
390 | ||
23193e51 MF |
391 | static struct buffer_head *ocfs2_find_entry_id(const char *name, |
392 | int namelen, | |
393 | struct inode *dir, | |
394 | struct ocfs2_dir_entry **res_dir) | |
395 | { | |
396 | int ret, found; | |
397 | struct buffer_head *di_bh = NULL; | |
398 | struct ocfs2_dinode *di; | |
399 | struct ocfs2_inline_data *data; | |
400 | ||
b657c95c | 401 | ret = ocfs2_read_inode_block(dir, &di_bh); |
23193e51 MF |
402 | if (ret) { |
403 | mlog_errno(ret); | |
404 | goto out; | |
405 | } | |
406 | ||
407 | di = (struct ocfs2_dinode *)di_bh->b_data; | |
408 | data = &di->id2.i_data; | |
409 | ||
410 | found = ocfs2_search_dirblock(di_bh, dir, name, namelen, 0, | |
411 | data->id_data, i_size_read(dir), res_dir); | |
412 | if (found == 1) | |
413 | return di_bh; | |
414 | ||
415 | brelse(di_bh); | |
416 | out: | |
417 | return NULL; | |
418 | } | |
419 | ||
a22305cc JB |
420 | static int ocfs2_validate_dir_block(struct super_block *sb, |
421 | struct buffer_head *bh) | |
422 | { | |
c175a518 JB |
423 | int rc; |
424 | struct ocfs2_dir_block_trailer *trailer = | |
425 | ocfs2_trailer_from_bh(bh, sb); | |
426 | ||
427 | ||
a22305cc | 428 | /* |
c175a518 | 429 | * We don't validate dirents here, that's handled |
a22305cc JB |
430 | * in-place when the code walks them. |
431 | */ | |
f1088d47 | 432 | trace_ocfs2_validate_dir_block((unsigned long long)bh->b_blocknr); |
a22305cc | 433 | |
c175a518 JB |
434 | BUG_ON(!buffer_uptodate(bh)); |
435 | ||
436 | /* | |
437 | * If the ecc fails, we return the error but otherwise | |
438 | * leave the filesystem running. We know any error is | |
439 | * local to this block. | |
440 | * | |
441 | * Note that we are safe to call this even if the directory | |
442 | * doesn't have a trailer. Filesystems without metaecc will do | |
443 | * nothing, and filesystems with it will have one. | |
444 | */ | |
445 | rc = ocfs2_validate_meta_ecc(sb, bh->b_data, &trailer->db_check); | |
446 | if (rc) | |
447 | mlog(ML_ERROR, "Checksum failed for dinode %llu\n", | |
448 | (unsigned long long)bh->b_blocknr); | |
449 | ||
450 | return rc; | |
a22305cc JB |
451 | } |
452 | ||
9b7895ef MF |
453 | /* |
454 | * Validate a directory trailer. | |
455 | * | |
456 | * We check the trailer here rather than in ocfs2_validate_dir_block() | |
457 | * because that function doesn't have the inode to test. | |
458 | */ | |
459 | static int ocfs2_check_dir_trailer(struct inode *dir, struct buffer_head *bh) | |
460 | { | |
461 | int rc = 0; | |
462 | struct ocfs2_dir_block_trailer *trailer; | |
463 | ||
464 | trailer = ocfs2_trailer_from_bh(bh, dir->i_sb); | |
465 | if (!OCFS2_IS_VALID_DIR_TRAILER(trailer)) { | |
17a5b9ab | 466 | rc = ocfs2_error(dir->i_sb, |
7ecef14a JP |
467 | "Invalid dirblock #%llu: signature = %.*s\n", |
468 | (unsigned long long)bh->b_blocknr, 7, | |
469 | trailer->db_signature); | |
9b7895ef MF |
470 | goto out; |
471 | } | |
472 | if (le64_to_cpu(trailer->db_blkno) != bh->b_blocknr) { | |
17a5b9ab | 473 | rc = ocfs2_error(dir->i_sb, |
7ecef14a JP |
474 | "Directory block #%llu has an invalid db_blkno of %llu\n", |
475 | (unsigned long long)bh->b_blocknr, | |
476 | (unsigned long long)le64_to_cpu(trailer->db_blkno)); | |
9b7895ef MF |
477 | goto out; |
478 | } | |
479 | if (le64_to_cpu(trailer->db_parent_dinode) != | |
480 | OCFS2_I(dir)->ip_blkno) { | |
17a5b9ab | 481 | rc = ocfs2_error(dir->i_sb, |
7ecef14a JP |
482 | "Directory block #%llu on dinode #%llu has an invalid parent_dinode of %llu\n", |
483 | (unsigned long long)bh->b_blocknr, | |
484 | (unsigned long long)OCFS2_I(dir)->ip_blkno, | |
485 | (unsigned long long)le64_to_cpu(trailer->db_blkno)); | |
9b7895ef MF |
486 | goto out; |
487 | } | |
488 | out: | |
489 | return rc; | |
490 | } | |
491 | ||
a22305cc JB |
492 | /* |
493 | * This function forces all errors to -EIO for consistency with its | |
494 | * predecessor, ocfs2_bread(). We haven't audited what returning the | |
495 | * real error codes would do to callers. We log the real codes with | |
496 | * mlog_errno() before we squash them. | |
497 | */ | |
498 | static int ocfs2_read_dir_block(struct inode *inode, u64 v_block, | |
499 | struct buffer_head **bh, int flags) | |
500 | { | |
501 | int rc = 0; | |
502 | struct buffer_head *tmp = *bh; | |
a22305cc | 503 | |
511308d9 JB |
504 | rc = ocfs2_read_virt_blocks(inode, v_block, 1, &tmp, flags, |
505 | ocfs2_validate_dir_block); | |
87d35a74 | 506 | if (rc) { |
a22305cc | 507 | mlog_errno(rc); |
87d35a74 MF |
508 | goto out; |
509 | } | |
510 | ||
87d35a74 | 511 | if (!(flags & OCFS2_BH_READAHEAD) && |
e7c17e43 | 512 | ocfs2_supports_dir_trailer(inode)) { |
9b7895ef MF |
513 | rc = ocfs2_check_dir_trailer(inode, tmp); |
514 | if (rc) { | |
515 | if (!*bh) | |
516 | brelse(tmp); | |
517 | mlog_errno(rc); | |
87d35a74 MF |
518 | goto out; |
519 | } | |
520 | } | |
a22305cc | 521 | |
511308d9 | 522 | /* If ocfs2_read_virt_blocks() got us a new bh, pass it up. */ |
87d35a74 | 523 | if (!*bh) |
a22305cc JB |
524 | *bh = tmp; |
525 | ||
87d35a74 | 526 | out: |
a22305cc JB |
527 | return rc ? -EIO : 0; |
528 | } | |
529 | ||
9b7895ef MF |
530 | /* |
531 | * Read the block at 'phys' which belongs to this directory | |
532 | * inode. This function does no virtual->physical block translation - | |
533 | * what's passed in is assumed to be a valid directory block. | |
534 | */ | |
535 | static int ocfs2_read_dir_block_direct(struct inode *dir, u64 phys, | |
536 | struct buffer_head **bh) | |
537 | { | |
538 | int ret; | |
539 | struct buffer_head *tmp = *bh; | |
540 | ||
8cb471e8 JB |
541 | ret = ocfs2_read_block(INODE_CACHE(dir), phys, &tmp, |
542 | ocfs2_validate_dir_block); | |
9b7895ef MF |
543 | if (ret) { |
544 | mlog_errno(ret); | |
545 | goto out; | |
546 | } | |
547 | ||
548 | if (ocfs2_supports_dir_trailer(dir)) { | |
549 | ret = ocfs2_check_dir_trailer(dir, tmp); | |
550 | if (ret) { | |
551 | if (!*bh) | |
552 | brelse(tmp); | |
553 | mlog_errno(ret); | |
554 | goto out; | |
555 | } | |
556 | } | |
557 | ||
558 | if (!ret && !*bh) | |
559 | *bh = tmp; | |
560 | out: | |
561 | return ret; | |
562 | } | |
563 | ||
564 | static int ocfs2_validate_dx_root(struct super_block *sb, | |
565 | struct buffer_head *bh) | |
566 | { | |
567 | int ret; | |
568 | struct ocfs2_dx_root_block *dx_root; | |
569 | ||
570 | BUG_ON(!buffer_uptodate(bh)); | |
571 | ||
572 | dx_root = (struct ocfs2_dx_root_block *) bh->b_data; | |
573 | ||
574 | ret = ocfs2_validate_meta_ecc(sb, bh->b_data, &dx_root->dr_check); | |
575 | if (ret) { | |
576 | mlog(ML_ERROR, | |
577 | "Checksum failed for dir index root block %llu\n", | |
578 | (unsigned long long)bh->b_blocknr); | |
579 | return ret; | |
580 | } | |
581 | ||
582 | if (!OCFS2_IS_VALID_DX_ROOT(dx_root)) { | |
17a5b9ab | 583 | ret = ocfs2_error(sb, |
7ecef14a JP |
584 | "Dir Index Root # %llu has bad signature %.*s\n", |
585 | (unsigned long long)le64_to_cpu(dx_root->dr_blkno), | |
586 | 7, dx_root->dr_signature); | |
9b7895ef MF |
587 | } |
588 | ||
17a5b9ab | 589 | return ret; |
9b7895ef MF |
590 | } |
591 | ||
592 | static int ocfs2_read_dx_root(struct inode *dir, struct ocfs2_dinode *di, | |
593 | struct buffer_head **dx_root_bh) | |
594 | { | |
595 | int ret; | |
596 | u64 blkno = le64_to_cpu(di->i_dx_root); | |
597 | struct buffer_head *tmp = *dx_root_bh; | |
598 | ||
8cb471e8 JB |
599 | ret = ocfs2_read_block(INODE_CACHE(dir), blkno, &tmp, |
600 | ocfs2_validate_dx_root); | |
9b7895ef MF |
601 | |
602 | /* If ocfs2_read_block() got us a new bh, pass it up. */ | |
603 | if (!ret && !*dx_root_bh) | |
604 | *dx_root_bh = tmp; | |
605 | ||
606 | return ret; | |
607 | } | |
608 | ||
609 | static int ocfs2_validate_dx_leaf(struct super_block *sb, | |
610 | struct buffer_head *bh) | |
611 | { | |
612 | int ret; | |
613 | struct ocfs2_dx_leaf *dx_leaf = (struct ocfs2_dx_leaf *)bh->b_data; | |
614 | ||
615 | BUG_ON(!buffer_uptodate(bh)); | |
616 | ||
617 | ret = ocfs2_validate_meta_ecc(sb, bh->b_data, &dx_leaf->dl_check); | |
618 | if (ret) { | |
619 | mlog(ML_ERROR, | |
620 | "Checksum failed for dir index leaf block %llu\n", | |
621 | (unsigned long long)bh->b_blocknr); | |
622 | return ret; | |
623 | } | |
624 | ||
625 | if (!OCFS2_IS_VALID_DX_LEAF(dx_leaf)) { | |
7ecef14a JP |
626 | ret = ocfs2_error(sb, "Dir Index Leaf has bad signature %.*s\n", |
627 | 7, dx_leaf->dl_signature); | |
9b7895ef MF |
628 | } |
629 | ||
17a5b9ab | 630 | return ret; |
9b7895ef MF |
631 | } |
632 | ||
633 | static int ocfs2_read_dx_leaf(struct inode *dir, u64 blkno, | |
634 | struct buffer_head **dx_leaf_bh) | |
635 | { | |
636 | int ret; | |
637 | struct buffer_head *tmp = *dx_leaf_bh; | |
638 | ||
8cb471e8 JB |
639 | ret = ocfs2_read_block(INODE_CACHE(dir), blkno, &tmp, |
640 | ocfs2_validate_dx_leaf); | |
9b7895ef MF |
641 | |
642 | /* If ocfs2_read_block() got us a new bh, pass it up. */ | |
643 | if (!ret && !*dx_leaf_bh) | |
644 | *dx_leaf_bh = tmp; | |
645 | ||
646 | return ret; | |
647 | } | |
648 | ||
649 | /* | |
650 | * Read a series of dx_leaf blocks. This expects all buffer_head | |
651 | * pointers to be NULL on function entry. | |
652 | */ | |
653 | static int ocfs2_read_dx_leaves(struct inode *dir, u64 start, int num, | |
654 | struct buffer_head **dx_leaf_bhs) | |
655 | { | |
656 | int ret; | |
657 | ||
8cb471e8 | 658 | ret = ocfs2_read_blocks(INODE_CACHE(dir), start, num, dx_leaf_bhs, 0, |
9b7895ef MF |
659 | ocfs2_validate_dx_leaf); |
660 | if (ret) | |
661 | mlog_errno(ret); | |
662 | ||
663 | return ret; | |
664 | } | |
665 | ||
0af4bd38 AB |
666 | static struct buffer_head *ocfs2_find_entry_el(const char *name, int namelen, |
667 | struct inode *dir, | |
668 | struct ocfs2_dir_entry **res_dir) | |
316f4b9f MF |
669 | { |
670 | struct super_block *sb; | |
671 | struct buffer_head *bh_use[NAMEI_RA_SIZE]; | |
672 | struct buffer_head *bh, *ret = NULL; | |
673 | unsigned long start, block, b; | |
674 | int ra_max = 0; /* Number of bh's in the readahead | |
675 | buffer, bh_use[] */ | |
676 | int ra_ptr = 0; /* Current index into readahead | |
677 | buffer */ | |
678 | int num = 0; | |
1a5692e4 | 679 | int nblocks, i; |
316f4b9f | 680 | |
316f4b9f MF |
681 | sb = dir->i_sb; |
682 | ||
683 | nblocks = i_size_read(dir) >> sb->s_blocksize_bits; | |
684 | start = OCFS2_I(dir)->ip_dir_start_lookup; | |
685 | if (start >= nblocks) | |
686 | start = 0; | |
687 | block = start; | |
688 | ||
689 | restart: | |
690 | do { | |
691 | /* | |
692 | * We deal with the read-ahead logic here. | |
693 | */ | |
694 | if (ra_ptr >= ra_max) { | |
695 | /* Refill the readahead buffer */ | |
696 | ra_ptr = 0; | |
697 | b = block; | |
698 | for (ra_max = 0; ra_max < NAMEI_RA_SIZE; ra_max++) { | |
699 | /* | |
700 | * Terminate if we reach the end of the | |
701 | * directory and must wrap, or if our | |
702 | * search has finished at this block. | |
703 | */ | |
704 | if (b >= nblocks || (num && block == start)) { | |
705 | bh_use[ra_max] = NULL; | |
706 | break; | |
707 | } | |
708 | num++; | |
709 | ||
a22305cc | 710 | bh = NULL; |
1a5692e4 | 711 | ocfs2_read_dir_block(dir, b++, &bh, |
a22305cc | 712 | OCFS2_BH_READAHEAD); |
316f4b9f MF |
713 | bh_use[ra_max] = bh; |
714 | } | |
715 | } | |
716 | if ((bh = bh_use[ra_ptr++]) == NULL) | |
717 | goto next; | |
a22305cc | 718 | if (ocfs2_read_dir_block(dir, block, &bh, 0)) { |
5e0b3dec | 719 | /* read error, skip block & hope for the best. |
a22305cc | 720 | * ocfs2_read_dir_block() has released the bh. */ |
61fb9ea4 | 721 | mlog(ML_ERROR, "reading directory %llu, " |
316f4b9f MF |
722 | "offset %lu\n", |
723 | (unsigned long long)OCFS2_I(dir)->ip_blkno, | |
724 | block); | |
316f4b9f MF |
725 | goto next; |
726 | } | |
727 | i = ocfs2_search_dirblock(bh, dir, name, namelen, | |
728 | block << sb->s_blocksize_bits, | |
23193e51 | 729 | bh->b_data, sb->s_blocksize, |
316f4b9f MF |
730 | res_dir); |
731 | if (i == 1) { | |
732 | OCFS2_I(dir)->ip_dir_start_lookup = block; | |
733 | ret = bh; | |
734 | goto cleanup_and_exit; | |
735 | } else { | |
736 | brelse(bh); | |
737 | if (i < 0) | |
738 | goto cleanup_and_exit; | |
739 | } | |
740 | next: | |
741 | if (++block >= nblocks) | |
742 | block = 0; | |
743 | } while (block != start); | |
744 | ||
745 | /* | |
746 | * If the directory has grown while we were searching, then | |
747 | * search the last part of the directory before giving up. | |
748 | */ | |
749 | block = nblocks; | |
750 | nblocks = i_size_read(dir) >> sb->s_blocksize_bits; | |
751 | if (block < nblocks) { | |
752 | start = 0; | |
753 | goto restart; | |
754 | } | |
755 | ||
756 | cleanup_and_exit: | |
757 | /* Clean up the read-ahead blocks */ | |
758 | for (; ra_ptr < ra_max; ra_ptr++) | |
759 | brelse(bh_use[ra_ptr]); | |
760 | ||
f1088d47 | 761 | trace_ocfs2_find_entry_el(ret); |
316f4b9f MF |
762 | return ret; |
763 | } | |
764 | ||
9b7895ef MF |
765 | static int ocfs2_dx_dir_lookup_rec(struct inode *inode, |
766 | struct ocfs2_extent_list *el, | |
767 | u32 major_hash, | |
768 | u32 *ret_cpos, | |
769 | u64 *ret_phys_blkno, | |
770 | unsigned int *ret_clen) | |
23193e51 | 771 | { |
9b7895ef MF |
772 | int ret = 0, i, found; |
773 | struct buffer_head *eb_bh = NULL; | |
774 | struct ocfs2_extent_block *eb; | |
775 | struct ocfs2_extent_rec *rec = NULL; | |
23193e51 | 776 | |
9b7895ef | 777 | if (el->l_tree_depth) { |
facdb77f JB |
778 | ret = ocfs2_find_leaf(INODE_CACHE(inode), el, major_hash, |
779 | &eb_bh); | |
9b7895ef MF |
780 | if (ret) { |
781 | mlog_errno(ret); | |
782 | goto out; | |
783 | } | |
23193e51 | 784 | |
9b7895ef MF |
785 | eb = (struct ocfs2_extent_block *) eb_bh->b_data; |
786 | el = &eb->h_list; | |
4a12ca3a | 787 | |
9b7895ef | 788 | if (el->l_tree_depth) { |
17a5b9ab | 789 | ret = ocfs2_error(inode->i_sb, |
7ecef14a JP |
790 | "Inode %lu has non zero tree depth in btree tree block %llu\n", |
791 | inode->i_ino, | |
792 | (unsigned long long)eb_bh->b_blocknr); | |
9b7895ef MF |
793 | goto out; |
794 | } | |
795 | } | |
796 | ||
797 | found = 0; | |
798 | for (i = le16_to_cpu(el->l_next_free_rec) - 1; i >= 0; i--) { | |
799 | rec = &el->l_recs[i]; | |
800 | ||
801 | if (le32_to_cpu(rec->e_cpos) <= major_hash) { | |
802 | found = 1; | |
803 | break; | |
804 | } | |
805 | } | |
806 | ||
807 | if (!found) { | |
7ecef14a JP |
808 | ret = ocfs2_error(inode->i_sb, |
809 | "Inode %lu has bad extent record (%u, %u, 0) in btree\n", | |
810 | inode->i_ino, | |
811 | le32_to_cpu(rec->e_cpos), | |
812 | ocfs2_rec_clusters(el, rec)); | |
9b7895ef MF |
813 | goto out; |
814 | } | |
815 | ||
816 | if (ret_phys_blkno) | |
817 | *ret_phys_blkno = le64_to_cpu(rec->e_blkno); | |
818 | if (ret_cpos) | |
819 | *ret_cpos = le32_to_cpu(rec->e_cpos); | |
820 | if (ret_clen) | |
821 | *ret_clen = le16_to_cpu(rec->e_leaf_clusters); | |
822 | ||
823 | out: | |
824 | brelse(eb_bh); | |
825 | return ret; | |
23193e51 MF |
826 | } |
827 | ||
5b6a3a2b | 828 | /* |
9b7895ef MF |
829 | * Returns the block index, from the start of the cluster which this |
830 | * hash belongs too. | |
5b6a3a2b | 831 | */ |
4ed8a6bb MF |
832 | static inline unsigned int __ocfs2_dx_dir_hash_idx(struct ocfs2_super *osb, |
833 | u32 minor_hash) | |
38760e24 | 834 | { |
9b7895ef MF |
835 | return minor_hash & osb->osb_dx_mask; |
836 | } | |
5b6a3a2b | 837 | |
4ed8a6bb MF |
838 | static inline unsigned int ocfs2_dx_dir_hash_idx(struct ocfs2_super *osb, |
839 | struct ocfs2_dx_hinfo *hinfo) | |
840 | { | |
841 | return __ocfs2_dx_dir_hash_idx(osb, hinfo->minor_hash); | |
842 | } | |
843 | ||
9b7895ef MF |
844 | static int ocfs2_dx_dir_lookup(struct inode *inode, |
845 | struct ocfs2_extent_list *el, | |
846 | struct ocfs2_dx_hinfo *hinfo, | |
847 | u32 *ret_cpos, | |
848 | u64 *ret_phys_blkno) | |
849 | { | |
850 | int ret = 0; | |
3f649ab7 KC |
851 | unsigned int cend, clen; |
852 | u32 cpos; | |
853 | u64 blkno; | |
9b7895ef | 854 | u32 name_hash = hinfo->major_hash; |
13723d00 | 855 | |
9b7895ef MF |
856 | ret = ocfs2_dx_dir_lookup_rec(inode, el, name_hash, &cpos, &blkno, |
857 | &clen); | |
38760e24 MF |
858 | if (ret) { |
859 | mlog_errno(ret); | |
860 | goto out; | |
861 | } | |
862 | ||
9b7895ef MF |
863 | cend = cpos + clen; |
864 | if (name_hash >= cend) { | |
865 | /* We want the last cluster */ | |
866 | blkno += ocfs2_clusters_to_blocks(inode->i_sb, clen - 1); | |
867 | cpos += clen - 1; | |
868 | } else { | |
869 | blkno += ocfs2_clusters_to_blocks(inode->i_sb, | |
870 | name_hash - cpos); | |
871 | cpos = name_hash; | |
872 | } | |
38760e24 | 873 | |
9b7895ef MF |
874 | /* |
875 | * We now have the cluster which should hold our entry. To | |
876 | * find the exact block from the start of the cluster to | |
877 | * search, we take the lower bits of the hash. | |
878 | */ | |
879 | blkno += ocfs2_dx_dir_hash_idx(OCFS2_SB(inode->i_sb), hinfo); | |
880 | ||
881 | if (ret_phys_blkno) | |
882 | *ret_phys_blkno = blkno; | |
883 | if (ret_cpos) | |
884 | *ret_cpos = cpos; | |
38760e24 MF |
885 | |
886 | out: | |
9b7895ef | 887 | |
38760e24 MF |
888 | return ret; |
889 | } | |
890 | ||
9b7895ef MF |
891 | static int ocfs2_dx_dir_search(const char *name, int namelen, |
892 | struct inode *dir, | |
4ed8a6bb | 893 | struct ocfs2_dx_root_block *dx_root, |
9b7895ef | 894 | struct ocfs2_dir_lookup_result *res) |
316f4b9f | 895 | { |
9b7895ef | 896 | int ret, i, found; |
3f649ab7 | 897 | u64 phys; |
9b7895ef MF |
898 | struct buffer_head *dx_leaf_bh = NULL; |
899 | struct ocfs2_dx_leaf *dx_leaf; | |
900 | struct ocfs2_dx_entry *dx_entry = NULL; | |
901 | struct buffer_head *dir_ent_bh = NULL; | |
902 | struct ocfs2_dir_entry *dir_ent = NULL; | |
903 | struct ocfs2_dx_hinfo *hinfo = &res->dl_hinfo; | |
4ed8a6bb MF |
904 | struct ocfs2_extent_list *dr_el; |
905 | struct ocfs2_dx_entry_list *entry_list; | |
9b7895ef MF |
906 | |
907 | ocfs2_dx_dir_name_hash(dir, name, namelen, &res->dl_hinfo); | |
908 | ||
4ed8a6bb MF |
909 | if (ocfs2_dx_root_inline(dx_root)) { |
910 | entry_list = &dx_root->dr_entries; | |
911 | goto search; | |
912 | } | |
913 | ||
914 | dr_el = &dx_root->dr_list; | |
915 | ||
9b7895ef MF |
916 | ret = ocfs2_dx_dir_lookup(dir, dr_el, hinfo, NULL, &phys); |
917 | if (ret) { | |
918 | mlog_errno(ret); | |
919 | goto out; | |
920 | } | |
316f4b9f | 921 | |
f1088d47 TM |
922 | trace_ocfs2_dx_dir_search((unsigned long long)OCFS2_I(dir)->ip_blkno, |
923 | namelen, name, hinfo->major_hash, | |
924 | hinfo->minor_hash, (unsigned long long)phys); | |
316f4b9f | 925 | |
9b7895ef MF |
926 | ret = ocfs2_read_dx_leaf(dir, phys, &dx_leaf_bh); |
927 | if (ret) { | |
928 | mlog_errno(ret); | |
929 | goto out; | |
930 | } | |
13723d00 | 931 | |
9b7895ef MF |
932 | dx_leaf = (struct ocfs2_dx_leaf *) dx_leaf_bh->b_data; |
933 | ||
f1088d47 TM |
934 | trace_ocfs2_dx_dir_search_leaf_info( |
935 | le16_to_cpu(dx_leaf->dl_list.de_num_used), | |
936 | le16_to_cpu(dx_leaf->dl_list.de_count)); | |
9b7895ef | 937 | |
4ed8a6bb MF |
938 | entry_list = &dx_leaf->dl_list; |
939 | ||
940 | search: | |
9b7895ef MF |
941 | /* |
942 | * Empty leaf is legal, so no need to check for that. | |
943 | */ | |
944 | found = 0; | |
4ed8a6bb MF |
945 | for (i = 0; i < le16_to_cpu(entry_list->de_num_used); i++) { |
946 | dx_entry = &entry_list->de_entries[i]; | |
9b7895ef MF |
947 | |
948 | if (hinfo->major_hash != le32_to_cpu(dx_entry->dx_major_hash) | |
949 | || hinfo->minor_hash != le32_to_cpu(dx_entry->dx_minor_hash)) | |
950 | continue; | |
951 | ||
952 | /* | |
953 | * Search unindexed leaf block now. We're not | |
954 | * guaranteed to find anything. | |
955 | */ | |
956 | ret = ocfs2_read_dir_block_direct(dir, | |
957 | le64_to_cpu(dx_entry->dx_dirent_blk), | |
958 | &dir_ent_bh); | |
959 | if (ret) { | |
960 | mlog_errno(ret); | |
961 | goto out; | |
316f4b9f | 962 | } |
9b7895ef MF |
963 | |
964 | /* | |
965 | * XXX: We should check the unindexed block here, | |
966 | * before using it. | |
967 | */ | |
968 | ||
969 | found = ocfs2_search_dirblock(dir_ent_bh, dir, name, namelen, | |
970 | 0, dir_ent_bh->b_data, | |
971 | dir->i_sb->s_blocksize, &dir_ent); | |
972 | if (found == 1) | |
973 | break; | |
974 | ||
975 | if (found == -1) { | |
976 | /* This means we found a bad directory entry. */ | |
977 | ret = -EIO; | |
978 | mlog_errno(ret); | |
979 | goto out; | |
980 | } | |
981 | ||
982 | brelse(dir_ent_bh); | |
983 | dir_ent_bh = NULL; | |
984 | } | |
985 | ||
986 | if (found <= 0) { | |
987 | ret = -ENOENT; | |
988 | goto out; | |
989 | } | |
990 | ||
991 | res->dl_leaf_bh = dir_ent_bh; | |
992 | res->dl_entry = dir_ent; | |
993 | res->dl_dx_leaf_bh = dx_leaf_bh; | |
994 | res->dl_dx_entry = dx_entry; | |
995 | ||
996 | ret = 0; | |
997 | out: | |
998 | if (ret) { | |
999 | brelse(dx_leaf_bh); | |
1000 | brelse(dir_ent_bh); | |
1001 | } | |
1002 | return ret; | |
1003 | } | |
1004 | ||
1005 | static int ocfs2_find_entry_dx(const char *name, int namelen, | |
1006 | struct inode *dir, | |
1007 | struct ocfs2_dir_lookup_result *lookup) | |
1008 | { | |
1009 | int ret; | |
1010 | struct buffer_head *di_bh = NULL; | |
1011 | struct ocfs2_dinode *di; | |
1012 | struct buffer_head *dx_root_bh = NULL; | |
1013 | struct ocfs2_dx_root_block *dx_root; | |
1014 | ||
1015 | ret = ocfs2_read_inode_block(dir, &di_bh); | |
1016 | if (ret) { | |
1017 | mlog_errno(ret); | |
1018 | goto out; | |
1019 | } | |
1020 | ||
1021 | di = (struct ocfs2_dinode *)di_bh->b_data; | |
1022 | ||
1023 | ret = ocfs2_read_dx_root(dir, di, &dx_root_bh); | |
1024 | if (ret) { | |
1025 | mlog_errno(ret); | |
1026 | goto out; | |
1027 | } | |
1028 | dx_root = (struct ocfs2_dx_root_block *) dx_root_bh->b_data; | |
1029 | ||
4ed8a6bb | 1030 | ret = ocfs2_dx_dir_search(name, namelen, dir, dx_root, lookup); |
9b7895ef MF |
1031 | if (ret) { |
1032 | if (ret != -ENOENT) | |
1033 | mlog_errno(ret); | |
1034 | goto out; | |
1035 | } | |
1036 | ||
4ed8a6bb MF |
1037 | lookup->dl_dx_root_bh = dx_root_bh; |
1038 | dx_root_bh = NULL; | |
9b7895ef MF |
1039 | out: |
1040 | brelse(di_bh); | |
1041 | brelse(dx_root_bh); | |
1042 | return ret; | |
1043 | } | |
1044 | ||
1045 | /* | |
1046 | * Try to find an entry of the provided name within 'dir'. | |
1047 | * | |
1048 | * If nothing was found, -ENOENT is returned. Otherwise, zero is | |
1049 | * returned and the struct 'res' will contain information useful to | |
1050 | * other directory manipulation functions. | |
1051 | * | |
1052 | * Caller can NOT assume anything about the contents of the | |
1053 | * buffer_heads - they are passed back only so that it can be passed | |
1054 | * into any one of the manipulation functions (add entry, delete | |
1055 | * entry, etc). As an example, bh in the extent directory case is a | |
1056 | * data block, in the inline-data case it actually points to an inode, | |
1057 | * in the indexed directory case, multiple buffers are involved. | |
1058 | */ | |
1059 | int ocfs2_find_entry(const char *name, int namelen, | |
1060 | struct inode *dir, struct ocfs2_dir_lookup_result *lookup) | |
1061 | { | |
1062 | struct buffer_head *bh; | |
1063 | struct ocfs2_dir_entry *res_dir = NULL; | |
1064 | ||
1065 | if (ocfs2_dir_indexed(dir)) | |
1066 | return ocfs2_find_entry_dx(name, namelen, dir, lookup); | |
1067 | ||
1068 | /* | |
1069 | * The unindexed dir code only uses part of the lookup | |
1070 | * structure, so there's no reason to push it down further | |
1071 | * than this. | |
1072 | */ | |
1073 | if (OCFS2_I(dir)->ip_dyn_features & OCFS2_INLINE_DATA_FL) | |
1074 | bh = ocfs2_find_entry_id(name, namelen, dir, &res_dir); | |
1075 | else | |
1076 | bh = ocfs2_find_entry_el(name, namelen, dir, &res_dir); | |
1077 | ||
1078 | if (bh == NULL) | |
1079 | return -ENOENT; | |
1080 | ||
1081 | lookup->dl_leaf_bh = bh; | |
1082 | lookup->dl_entry = res_dir; | |
1083 | return 0; | |
1084 | } | |
1085 | ||
1086 | /* | |
1087 | * Update inode number and type of a previously found directory entry. | |
1088 | */ | |
1089 | int ocfs2_update_entry(struct inode *dir, handle_t *handle, | |
1090 | struct ocfs2_dir_lookup_result *res, | |
1091 | struct inode *new_entry_inode) | |
1092 | { | |
1093 | int ret; | |
1094 | ocfs2_journal_access_func access = ocfs2_journal_access_db; | |
1095 | struct ocfs2_dir_entry *de = res->dl_entry; | |
1096 | struct buffer_head *de_bh = res->dl_leaf_bh; | |
1097 | ||
1098 | /* | |
1099 | * The same code works fine for both inline-data and extent | |
1100 | * based directories, so no need to split this up. The only | |
1101 | * difference is the journal_access function. | |
1102 | */ | |
1103 | ||
1104 | if (OCFS2_I(dir)->ip_dyn_features & OCFS2_INLINE_DATA_FL) | |
1105 | access = ocfs2_journal_access_di; | |
1106 | ||
0cf2f763 JB |
1107 | ret = access(handle, INODE_CACHE(dir), de_bh, |
1108 | OCFS2_JOURNAL_ACCESS_WRITE); | |
9b7895ef MF |
1109 | if (ret) { |
1110 | mlog_errno(ret); | |
1111 | goto out; | |
1112 | } | |
1113 | ||
1114 | de->inode = cpu_to_le64(OCFS2_I(new_entry_inode)->ip_blkno); | |
1115 | ocfs2_set_de_type(de, new_entry_inode->i_mode); | |
1116 | ||
1117 | ocfs2_journal_dirty(handle, de_bh); | |
1118 | ||
1119 | out: | |
1120 | return ret; | |
1121 | } | |
1122 | ||
1123 | /* | |
1124 | * __ocfs2_delete_entry deletes a directory entry by merging it with the | |
1125 | * previous entry | |
1126 | */ | |
1127 | static int __ocfs2_delete_entry(handle_t *handle, struct inode *dir, | |
1128 | struct ocfs2_dir_entry *de_del, | |
1129 | struct buffer_head *bh, char *first_de, | |
1130 | unsigned int bytes) | |
1131 | { | |
1132 | struct ocfs2_dir_entry *de, *pde; | |
1133 | int i, status = -ENOENT; | |
1134 | ocfs2_journal_access_func access = ocfs2_journal_access_db; | |
1135 | ||
9b7895ef MF |
1136 | if (OCFS2_I(dir)->ip_dyn_features & OCFS2_INLINE_DATA_FL) |
1137 | access = ocfs2_journal_access_di; | |
1138 | ||
1139 | i = 0; | |
1140 | pde = NULL; | |
1141 | de = (struct ocfs2_dir_entry *) first_de; | |
1142 | while (i < bytes) { | |
1143 | if (!ocfs2_check_dir_entry(dir, de, bh, i)) { | |
1144 | status = -EIO; | |
1145 | mlog_errno(status); | |
1146 | goto bail; | |
1147 | } | |
1148 | if (de == de_del) { | |
0cf2f763 | 1149 | status = access(handle, INODE_CACHE(dir), bh, |
13723d00 | 1150 | OCFS2_JOURNAL_ACCESS_WRITE); |
316f4b9f MF |
1151 | if (status < 0) { |
1152 | status = -EIO; | |
1153 | mlog_errno(status); | |
1154 | goto bail; | |
1155 | } | |
1156 | if (pde) | |
0dd3256e MS |
1157 | le16_add_cpu(&pde->rec_len, |
1158 | le16_to_cpu(de->rec_len)); | |
82985248 | 1159 | de->inode = 0; |
cc56c33e | 1160 | inode_inc_iversion(dir); |
ec20cec7 | 1161 | ocfs2_journal_dirty(handle, bh); |
316f4b9f MF |
1162 | goto bail; |
1163 | } | |
1164 | i += le16_to_cpu(de->rec_len); | |
1165 | pde = de; | |
1166 | de = (struct ocfs2_dir_entry *)((char *)de + le16_to_cpu(de->rec_len)); | |
1167 | } | |
1168 | bail: | |
316f4b9f MF |
1169 | return status; |
1170 | } | |
1171 | ||
e7c17e43 MF |
1172 | static unsigned int ocfs2_figure_dirent_hole(struct ocfs2_dir_entry *de) |
1173 | { | |
1174 | unsigned int hole; | |
1175 | ||
1176 | if (le64_to_cpu(de->inode) == 0) | |
1177 | hole = le16_to_cpu(de->rec_len); | |
1178 | else | |
1179 | hole = le16_to_cpu(de->rec_len) - | |
1180 | OCFS2_DIR_REC_LEN(de->name_len); | |
1181 | ||
1182 | return hole; | |
1183 | } | |
1184 | ||
1185 | static int ocfs2_find_max_rec_len(struct super_block *sb, | |
1186 | struct buffer_head *dirblock_bh) | |
1187 | { | |
1188 | int size, this_hole, largest_hole = 0; | |
1189 | char *trailer, *de_buf, *limit, *start = dirblock_bh->b_data; | |
1190 | struct ocfs2_dir_entry *de; | |
1191 | ||
1192 | trailer = (char *)ocfs2_trailer_from_bh(dirblock_bh, sb); | |
1193 | size = ocfs2_dir_trailer_blk_off(sb); | |
1194 | limit = start + size; | |
1195 | de_buf = start; | |
1196 | de = (struct ocfs2_dir_entry *)de_buf; | |
1197 | do { | |
1198 | if (de_buf != trailer) { | |
1199 | this_hole = ocfs2_figure_dirent_hole(de); | |
1200 | if (this_hole > largest_hole) | |
1201 | largest_hole = this_hole; | |
1202 | } | |
1203 | ||
1204 | de_buf += le16_to_cpu(de->rec_len); | |
1205 | de = (struct ocfs2_dir_entry *)de_buf; | |
1206 | } while (de_buf < limit); | |
1207 | ||
1208 | if (largest_hole >= OCFS2_DIR_MIN_REC_LEN) | |
1209 | return largest_hole; | |
1210 | return 0; | |
1211 | } | |
1212 | ||
4ed8a6bb MF |
1213 | static void ocfs2_dx_list_remove_entry(struct ocfs2_dx_entry_list *entry_list, |
1214 | int index) | |
9b7895ef | 1215 | { |
4ed8a6bb | 1216 | int num_used = le16_to_cpu(entry_list->de_num_used); |
9b7895ef MF |
1217 | |
1218 | if (num_used == 1 || index == (num_used - 1)) | |
1219 | goto clear; | |
1220 | ||
4ed8a6bb MF |
1221 | memmove(&entry_list->de_entries[index], |
1222 | &entry_list->de_entries[index + 1], | |
9b7895ef MF |
1223 | (num_used - index - 1)*sizeof(struct ocfs2_dx_entry)); |
1224 | clear: | |
1225 | num_used--; | |
4ed8a6bb | 1226 | memset(&entry_list->de_entries[num_used], 0, |
9b7895ef | 1227 | sizeof(struct ocfs2_dx_entry)); |
4ed8a6bb | 1228 | entry_list->de_num_used = cpu_to_le16(num_used); |
9b7895ef MF |
1229 | } |
1230 | ||
1231 | static int ocfs2_delete_entry_dx(handle_t *handle, struct inode *dir, | |
1232 | struct ocfs2_dir_lookup_result *lookup) | |
1233 | { | |
e7c17e43 | 1234 | int ret, index, max_rec_len, add_to_free_list = 0; |
4ed8a6bb | 1235 | struct buffer_head *dx_root_bh = lookup->dl_dx_root_bh; |
9b7895ef MF |
1236 | struct buffer_head *leaf_bh = lookup->dl_leaf_bh; |
1237 | struct ocfs2_dx_leaf *dx_leaf; | |
1238 | struct ocfs2_dx_entry *dx_entry = lookup->dl_dx_entry; | |
e7c17e43 | 1239 | struct ocfs2_dir_block_trailer *trailer; |
4ed8a6bb MF |
1240 | struct ocfs2_dx_root_block *dx_root; |
1241 | struct ocfs2_dx_entry_list *entry_list; | |
1242 | ||
e7c17e43 MF |
1243 | /* |
1244 | * This function gets a bit messy because we might have to | |
1245 | * modify the root block, regardless of whether the indexed | |
1246 | * entries are stored inline. | |
1247 | */ | |
1248 | ||
1249 | /* | |
1250 | * *Only* set 'entry_list' here, based on where we're looking | |
1251 | * for the indexed entries. Later, we might still want to | |
1252 | * journal both blocks, based on free list state. | |
1253 | */ | |
4ed8a6bb MF |
1254 | dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data; |
1255 | if (ocfs2_dx_root_inline(dx_root)) { | |
1256 | entry_list = &dx_root->dr_entries; | |
1257 | } else { | |
1258 | dx_leaf = (struct ocfs2_dx_leaf *) lookup->dl_dx_leaf_bh->b_data; | |
1259 | entry_list = &dx_leaf->dl_list; | |
1260 | } | |
9b7895ef | 1261 | |
9b7895ef MF |
1262 | /* Neither of these are a disk corruption - that should have |
1263 | * been caught by lookup, before we got here. */ | |
4ed8a6bb MF |
1264 | BUG_ON(le16_to_cpu(entry_list->de_count) <= 0); |
1265 | BUG_ON(le16_to_cpu(entry_list->de_num_used) <= 0); | |
9b7895ef | 1266 | |
4ed8a6bb | 1267 | index = (char *)dx_entry - (char *)entry_list->de_entries; |
9b7895ef MF |
1268 | index /= sizeof(*dx_entry); |
1269 | ||
4ed8a6bb | 1270 | if (index >= le16_to_cpu(entry_list->de_num_used)) { |
9b7895ef | 1271 | mlog(ML_ERROR, "Dir %llu: Bad dx_entry ptr idx %d, (%p, %p)\n", |
4ed8a6bb MF |
1272 | (unsigned long long)OCFS2_I(dir)->ip_blkno, index, |
1273 | entry_list, dx_entry); | |
9b7895ef MF |
1274 | return -EIO; |
1275 | } | |
1276 | ||
e7c17e43 MF |
1277 | /* |
1278 | * We know that removal of this dirent will leave enough room | |
1279 | * for a new one, so add this block to the free list if it | |
1280 | * isn't already there. | |
1281 | */ | |
1282 | trailer = ocfs2_trailer_from_bh(leaf_bh, dir->i_sb); | |
1283 | if (trailer->db_free_rec_len == 0) | |
1284 | add_to_free_list = 1; | |
1285 | ||
9b7895ef | 1286 | /* |
4ed8a6bb MF |
1287 | * Add the block holding our index into the journal before |
1288 | * removing the unindexed entry. If we get an error return | |
1289 | * from __ocfs2_delete_entry(), then it hasn't removed the | |
1290 | * entry yet. Likewise, successful return means we *must* | |
1291 | * remove the indexed entry. | |
1292 | * | |
e3a93c2d MF |
1293 | * We're also careful to journal the root tree block here as |
1294 | * the entry count needs to be updated. Also, we might be | |
1295 | * adding to the start of the free list. | |
9b7895ef | 1296 | */ |
0cf2f763 | 1297 | ret = ocfs2_journal_access_dr(handle, INODE_CACHE(dir), dx_root_bh, |
e3a93c2d MF |
1298 | OCFS2_JOURNAL_ACCESS_WRITE); |
1299 | if (ret) { | |
1300 | mlog_errno(ret); | |
1301 | goto out; | |
e7c17e43 MF |
1302 | } |
1303 | ||
1304 | if (!ocfs2_dx_root_inline(dx_root)) { | |
0cf2f763 | 1305 | ret = ocfs2_journal_access_dl(handle, INODE_CACHE(dir), |
4ed8a6bb MF |
1306 | lookup->dl_dx_leaf_bh, |
1307 | OCFS2_JOURNAL_ACCESS_WRITE); | |
1308 | if (ret) { | |
1309 | mlog_errno(ret); | |
1310 | goto out; | |
1311 | } | |
9b7895ef MF |
1312 | } |
1313 | ||
f1088d47 TM |
1314 | trace_ocfs2_delete_entry_dx((unsigned long long)OCFS2_I(dir)->ip_blkno, |
1315 | index); | |
4ed8a6bb | 1316 | |
9b7895ef MF |
1317 | ret = __ocfs2_delete_entry(handle, dir, lookup->dl_entry, |
1318 | leaf_bh, leaf_bh->b_data, leaf_bh->b_size); | |
1319 | if (ret) { | |
1320 | mlog_errno(ret); | |
1321 | goto out; | |
1322 | } | |
1323 | ||
e7c17e43 MF |
1324 | max_rec_len = ocfs2_find_max_rec_len(dir->i_sb, leaf_bh); |
1325 | trailer->db_free_rec_len = cpu_to_le16(max_rec_len); | |
1326 | if (add_to_free_list) { | |
1327 | trailer->db_free_next = dx_root->dr_free_blk; | |
1328 | dx_root->dr_free_blk = cpu_to_le64(leaf_bh->b_blocknr); | |
1329 | ocfs2_journal_dirty(handle, dx_root_bh); | |
1330 | } | |
1331 | ||
1332 | /* leaf_bh was journal_accessed for us in __ocfs2_delete_entry */ | |
1333 | ocfs2_journal_dirty(handle, leaf_bh); | |
1334 | ||
e3a93c2d MF |
1335 | le32_add_cpu(&dx_root->dr_num_entries, -1); |
1336 | ocfs2_journal_dirty(handle, dx_root_bh); | |
1337 | ||
4ed8a6bb | 1338 | ocfs2_dx_list_remove_entry(entry_list, index); |
9b7895ef | 1339 | |
e3a93c2d | 1340 | if (!ocfs2_dx_root_inline(dx_root)) |
4ed8a6bb | 1341 | ocfs2_journal_dirty(handle, lookup->dl_dx_leaf_bh); |
9b7895ef MF |
1342 | |
1343 | out: | |
1344 | return ret; | |
1345 | } | |
1346 | ||
5b6a3a2b MF |
1347 | static inline int ocfs2_delete_entry_id(handle_t *handle, |
1348 | struct inode *dir, | |
1349 | struct ocfs2_dir_entry *de_del, | |
1350 | struct buffer_head *bh) | |
1351 | { | |
1352 | int ret; | |
1353 | struct buffer_head *di_bh = NULL; | |
1354 | struct ocfs2_dinode *di; | |
1355 | struct ocfs2_inline_data *data; | |
1356 | ||
b657c95c | 1357 | ret = ocfs2_read_inode_block(dir, &di_bh); |
5b6a3a2b MF |
1358 | if (ret) { |
1359 | mlog_errno(ret); | |
1360 | goto out; | |
1361 | } | |
1362 | ||
1363 | di = (struct ocfs2_dinode *)di_bh->b_data; | |
1364 | data = &di->id2.i_data; | |
1365 | ||
1366 | ret = __ocfs2_delete_entry(handle, dir, de_del, bh, data->id_data, | |
1367 | i_size_read(dir)); | |
1368 | ||
1369 | brelse(di_bh); | |
1370 | out: | |
1371 | return ret; | |
1372 | } | |
1373 | ||
1374 | static inline int ocfs2_delete_entry_el(handle_t *handle, | |
1375 | struct inode *dir, | |
1376 | struct ocfs2_dir_entry *de_del, | |
1377 | struct buffer_head *bh) | |
1378 | { | |
1379 | return __ocfs2_delete_entry(handle, dir, de_del, bh, bh->b_data, | |
1380 | bh->b_size); | |
1381 | } | |
1382 | ||
1383 | /* | |
9b7895ef MF |
1384 | * Delete a directory entry. Hide the details of directory |
1385 | * implementation from the caller. | |
5b6a3a2b MF |
1386 | */ |
1387 | int ocfs2_delete_entry(handle_t *handle, | |
1388 | struct inode *dir, | |
4a12ca3a | 1389 | struct ocfs2_dir_lookup_result *res) |
5b6a3a2b | 1390 | { |
9b7895ef MF |
1391 | if (ocfs2_dir_indexed(dir)) |
1392 | return ocfs2_delete_entry_dx(handle, dir, res); | |
1393 | ||
5b6a3a2b | 1394 | if (OCFS2_I(dir)->ip_dyn_features & OCFS2_INLINE_DATA_FL) |
4a12ca3a MF |
1395 | return ocfs2_delete_entry_id(handle, dir, res->dl_entry, |
1396 | res->dl_leaf_bh); | |
5b6a3a2b | 1397 | |
4a12ca3a MF |
1398 | return ocfs2_delete_entry_el(handle, dir, res->dl_entry, |
1399 | res->dl_leaf_bh); | |
5b6a3a2b MF |
1400 | } |
1401 | ||
8553cf4f MF |
1402 | /* |
1403 | * Check whether 'de' has enough room to hold an entry of | |
1404 | * 'new_rec_len' bytes. | |
1405 | */ | |
1406 | static inline int ocfs2_dirent_would_fit(struct ocfs2_dir_entry *de, | |
1407 | unsigned int new_rec_len) | |
1408 | { | |
1409 | unsigned int de_really_used; | |
1410 | ||
1411 | /* Check whether this is an empty record with enough space */ | |
1412 | if (le64_to_cpu(de->inode) == 0 && | |
1413 | le16_to_cpu(de->rec_len) >= new_rec_len) | |
1414 | return 1; | |
1415 | ||
1416 | /* | |
1417 | * Record might have free space at the end which we can | |
1418 | * use. | |
1419 | */ | |
1420 | de_really_used = OCFS2_DIR_REC_LEN(de->name_len); | |
1421 | if (le16_to_cpu(de->rec_len) >= (de_really_used + new_rec_len)) | |
1422 | return 1; | |
1423 | ||
1424 | return 0; | |
1425 | } | |
1426 | ||
9b7895ef MF |
1427 | static void ocfs2_dx_dir_leaf_insert_tail(struct ocfs2_dx_leaf *dx_leaf, |
1428 | struct ocfs2_dx_entry *dx_new_entry) | |
1429 | { | |
1430 | int i; | |
1431 | ||
1432 | i = le16_to_cpu(dx_leaf->dl_list.de_num_used); | |
1433 | dx_leaf->dl_list.de_entries[i] = *dx_new_entry; | |
1434 | ||
1435 | le16_add_cpu(&dx_leaf->dl_list.de_num_used, 1); | |
1436 | } | |
1437 | ||
4ed8a6bb MF |
1438 | static void ocfs2_dx_entry_list_insert(struct ocfs2_dx_entry_list *entry_list, |
1439 | struct ocfs2_dx_hinfo *hinfo, | |
1440 | u64 dirent_blk) | |
1441 | { | |
1442 | int i; | |
1443 | struct ocfs2_dx_entry *dx_entry; | |
1444 | ||
1445 | i = le16_to_cpu(entry_list->de_num_used); | |
1446 | dx_entry = &entry_list->de_entries[i]; | |
1447 | ||
1448 | memset(dx_entry, 0, sizeof(*dx_entry)); | |
1449 | dx_entry->dx_major_hash = cpu_to_le32(hinfo->major_hash); | |
1450 | dx_entry->dx_minor_hash = cpu_to_le32(hinfo->minor_hash); | |
1451 | dx_entry->dx_dirent_blk = cpu_to_le64(dirent_blk); | |
1452 | ||
1453 | le16_add_cpu(&entry_list->de_num_used, 1); | |
1454 | } | |
1455 | ||
9b7895ef MF |
1456 | static int __ocfs2_dx_dir_leaf_insert(struct inode *dir, handle_t *handle, |
1457 | struct ocfs2_dx_hinfo *hinfo, | |
1458 | u64 dirent_blk, | |
1459 | struct buffer_head *dx_leaf_bh) | |
1460 | { | |
4ed8a6bb | 1461 | int ret; |
9b7895ef MF |
1462 | struct ocfs2_dx_leaf *dx_leaf; |
1463 | ||
0cf2f763 | 1464 | ret = ocfs2_journal_access_dl(handle, INODE_CACHE(dir), dx_leaf_bh, |
9b7895ef MF |
1465 | OCFS2_JOURNAL_ACCESS_WRITE); |
1466 | if (ret) { | |
1467 | mlog_errno(ret); | |
1468 | goto out; | |
1469 | } | |
1470 | ||
1471 | dx_leaf = (struct ocfs2_dx_leaf *)dx_leaf_bh->b_data; | |
4ed8a6bb MF |
1472 | ocfs2_dx_entry_list_insert(&dx_leaf->dl_list, hinfo, dirent_blk); |
1473 | ocfs2_journal_dirty(handle, dx_leaf_bh); | |
9b7895ef | 1474 | |
4ed8a6bb MF |
1475 | out: |
1476 | return ret; | |
1477 | } | |
9b7895ef | 1478 | |
e3a93c2d MF |
1479 | static void ocfs2_dx_inline_root_insert(struct inode *dir, handle_t *handle, |
1480 | struct ocfs2_dx_hinfo *hinfo, | |
1481 | u64 dirent_blk, | |
1482 | struct ocfs2_dx_root_block *dx_root) | |
4ed8a6bb | 1483 | { |
e3a93c2d MF |
1484 | ocfs2_dx_entry_list_insert(&dx_root->dr_entries, hinfo, dirent_blk); |
1485 | } | |
1486 | ||
1487 | static int ocfs2_dx_dir_insert(struct inode *dir, handle_t *handle, | |
1488 | struct ocfs2_dir_lookup_result *lookup) | |
1489 | { | |
1490 | int ret = 0; | |
4ed8a6bb | 1491 | struct ocfs2_dx_root_block *dx_root; |
e3a93c2d | 1492 | struct buffer_head *dx_root_bh = lookup->dl_dx_root_bh; |
9b7895ef | 1493 | |
0cf2f763 | 1494 | ret = ocfs2_journal_access_dr(handle, INODE_CACHE(dir), dx_root_bh, |
4ed8a6bb MF |
1495 | OCFS2_JOURNAL_ACCESS_WRITE); |
1496 | if (ret) { | |
1497 | mlog_errno(ret); | |
1498 | goto out; | |
1499 | } | |
1500 | ||
e3a93c2d MF |
1501 | dx_root = (struct ocfs2_dx_root_block *)lookup->dl_dx_root_bh->b_data; |
1502 | if (ocfs2_dx_root_inline(dx_root)) { | |
1503 | ocfs2_dx_inline_root_insert(dir, handle, | |
1504 | &lookup->dl_hinfo, | |
1505 | lookup->dl_leaf_bh->b_blocknr, | |
1506 | dx_root); | |
1507 | } else { | |
1508 | ret = __ocfs2_dx_dir_leaf_insert(dir, handle, &lookup->dl_hinfo, | |
1509 | lookup->dl_leaf_bh->b_blocknr, | |
1510 | lookup->dl_dx_leaf_bh); | |
1511 | if (ret) | |
1512 | goto out; | |
1513 | } | |
1514 | ||
1515 | le32_add_cpu(&dx_root->dr_num_entries, 1); | |
4ed8a6bb | 1516 | ocfs2_journal_dirty(handle, dx_root_bh); |
9b7895ef MF |
1517 | |
1518 | out: | |
1519 | return ret; | |
1520 | } | |
1521 | ||
e7c17e43 MF |
1522 | static void ocfs2_remove_block_from_free_list(struct inode *dir, |
1523 | handle_t *handle, | |
1524 | struct ocfs2_dir_lookup_result *lookup) | |
1525 | { | |
1526 | struct ocfs2_dir_block_trailer *trailer, *prev; | |
1527 | struct ocfs2_dx_root_block *dx_root; | |
1528 | struct buffer_head *bh; | |
1529 | ||
1530 | trailer = ocfs2_trailer_from_bh(lookup->dl_leaf_bh, dir->i_sb); | |
1531 | ||
1532 | if (ocfs2_free_list_at_root(lookup)) { | |
1533 | bh = lookup->dl_dx_root_bh; | |
1534 | dx_root = (struct ocfs2_dx_root_block *)bh->b_data; | |
1535 | dx_root->dr_free_blk = trailer->db_free_next; | |
1536 | } else { | |
1537 | bh = lookup->dl_prev_leaf_bh; | |
1538 | prev = ocfs2_trailer_from_bh(bh, dir->i_sb); | |
1539 | prev->db_free_next = trailer->db_free_next; | |
1540 | } | |
1541 | ||
1542 | trailer->db_free_rec_len = cpu_to_le16(0); | |
1543 | trailer->db_free_next = cpu_to_le64(0); | |
1544 | ||
1545 | ocfs2_journal_dirty(handle, bh); | |
1546 | ocfs2_journal_dirty(handle, lookup->dl_leaf_bh); | |
1547 | } | |
1548 | ||
1549 | /* | |
1550 | * This expects that a journal write has been reserved on | |
1551 | * lookup->dl_prev_leaf_bh or lookup->dl_dx_root_bh | |
1552 | */ | |
1553 | static void ocfs2_recalc_free_list(struct inode *dir, handle_t *handle, | |
1554 | struct ocfs2_dir_lookup_result *lookup) | |
1555 | { | |
1556 | int max_rec_len; | |
1557 | struct ocfs2_dir_block_trailer *trailer; | |
1558 | ||
1559 | /* Walk dl_leaf_bh to figure out what the new free rec_len is. */ | |
1560 | max_rec_len = ocfs2_find_max_rec_len(dir->i_sb, lookup->dl_leaf_bh); | |
1561 | if (max_rec_len) { | |
1562 | /* | |
1563 | * There's still room in this block, so no need to remove it | |
1564 | * from the free list. In this case, we just want to update | |
1565 | * the rec len accounting. | |
1566 | */ | |
1567 | trailer = ocfs2_trailer_from_bh(lookup->dl_leaf_bh, dir->i_sb); | |
1568 | trailer->db_free_rec_len = cpu_to_le16(max_rec_len); | |
1569 | ocfs2_journal_dirty(handle, lookup->dl_leaf_bh); | |
1570 | } else { | |
1571 | ocfs2_remove_block_from_free_list(dir, handle, lookup); | |
1572 | } | |
1573 | } | |
1574 | ||
316f4b9f MF |
1575 | /* we don't always have a dentry for what we want to add, so people |
1576 | * like orphan dir can call this instead. | |
1577 | * | |
4a12ca3a MF |
1578 | * The lookup context must have been filled from |
1579 | * ocfs2_prepare_dir_for_insert. | |
316f4b9f MF |
1580 | */ |
1581 | int __ocfs2_add_entry(handle_t *handle, | |
1582 | struct inode *dir, | |
1583 | const char *name, int namelen, | |
1584 | struct inode *inode, u64 blkno, | |
1585 | struct buffer_head *parent_fe_bh, | |
4a12ca3a | 1586 | struct ocfs2_dir_lookup_result *lookup) |
316f4b9f MF |
1587 | { |
1588 | unsigned long offset; | |
1589 | unsigned short rec_len; | |
1590 | struct ocfs2_dir_entry *de, *de1; | |
5b6a3a2b MF |
1591 | struct ocfs2_dinode *di = (struct ocfs2_dinode *)parent_fe_bh->b_data; |
1592 | struct super_block *sb = dir->i_sb; | |
2e173152 | 1593 | int retval; |
5b6a3a2b | 1594 | unsigned int size = sb->s_blocksize; |
4a12ca3a | 1595 | struct buffer_head *insert_bh = lookup->dl_leaf_bh; |
5b6a3a2b | 1596 | char *data_start = insert_bh->b_data; |
316f4b9f | 1597 | |
316f4b9f MF |
1598 | if (!namelen) |
1599 | return -EINVAL; | |
1600 | ||
e7c17e43 MF |
1601 | if (ocfs2_dir_indexed(dir)) { |
1602 | struct buffer_head *bh; | |
1603 | ||
1604 | /* | |
1605 | * An indexed dir may require that we update the free space | |
1606 | * list. Reserve a write to the previous node in the list so | |
1607 | * that we don't fail later. | |
1608 | * | |
1609 | * XXX: This can be either a dx_root_block, or an unindexed | |
1610 | * directory tree leaf block. | |
1611 | */ | |
1612 | if (ocfs2_free_list_at_root(lookup)) { | |
1613 | bh = lookup->dl_dx_root_bh; | |
0cf2f763 JB |
1614 | retval = ocfs2_journal_access_dr(handle, |
1615 | INODE_CACHE(dir), bh, | |
e7c17e43 MF |
1616 | OCFS2_JOURNAL_ACCESS_WRITE); |
1617 | } else { | |
1618 | bh = lookup->dl_prev_leaf_bh; | |
0cf2f763 JB |
1619 | retval = ocfs2_journal_access_db(handle, |
1620 | INODE_CACHE(dir), bh, | |
e7c17e43 MF |
1621 | OCFS2_JOURNAL_ACCESS_WRITE); |
1622 | } | |
1623 | if (retval) { | |
1624 | mlog_errno(retval); | |
1625 | return retval; | |
1626 | } | |
1627 | } else if (OCFS2_I(dir)->ip_dyn_features & OCFS2_INLINE_DATA_FL) { | |
5b6a3a2b MF |
1628 | data_start = di->id2.i_data.id_data; |
1629 | size = i_size_read(dir); | |
1630 | ||
1631 | BUG_ON(insert_bh != parent_fe_bh); | |
1632 | } | |
1633 | ||
316f4b9f MF |
1634 | rec_len = OCFS2_DIR_REC_LEN(namelen); |
1635 | offset = 0; | |
5b6a3a2b | 1636 | de = (struct ocfs2_dir_entry *) data_start; |
316f4b9f | 1637 | while (1) { |
5b6a3a2b MF |
1638 | BUG_ON((char *)de >= (size + data_start)); |
1639 | ||
316f4b9f MF |
1640 | /* These checks should've already been passed by the |
1641 | * prepare function, but I guess we can leave them | |
1642 | * here anyway. */ | |
1643 | if (!ocfs2_check_dir_entry(dir, de, insert_bh, offset)) { | |
1644 | retval = -ENOENT; | |
1645 | goto bail; | |
1646 | } | |
1647 | if (ocfs2_match(namelen, name, de)) { | |
1648 | retval = -EEXIST; | |
1649 | goto bail; | |
1650 | } | |
8553cf4f | 1651 | |
87d35a74 MF |
1652 | /* We're guaranteed that we should have space, so we |
1653 | * can't possibly have hit the trailer...right? */ | |
1654 | mlog_bug_on_msg(ocfs2_skip_dir_trailer(dir, de, offset, size), | |
1655 | "Hit dir trailer trying to insert %.*s " | |
1656 | "(namelen %d) into directory %llu. " | |
1657 | "offset is %lu, trailer offset is %d\n", | |
1658 | namelen, name, namelen, | |
1659 | (unsigned long long)parent_fe_bh->b_blocknr, | |
1660 | offset, ocfs2_dir_trailer_blk_off(dir->i_sb)); | |
1661 | ||
8553cf4f | 1662 | if (ocfs2_dirent_would_fit(de, rec_len)) { |
078cd827 | 1663 | dir->i_mtime = dir->i_ctime = current_time(dir); |
316f4b9f MF |
1664 | retval = ocfs2_mark_inode_dirty(handle, dir, parent_fe_bh); |
1665 | if (retval < 0) { | |
1666 | mlog_errno(retval); | |
1667 | goto bail; | |
1668 | } | |
1669 | ||
13723d00 | 1670 | if (insert_bh == parent_fe_bh) |
2e173152 | 1671 | retval = ocfs2_journal_access_di(handle, |
0cf2f763 | 1672 | INODE_CACHE(dir), |
13723d00 JB |
1673 | insert_bh, |
1674 | OCFS2_JOURNAL_ACCESS_WRITE); | |
9b7895ef | 1675 | else { |
2e173152 | 1676 | retval = ocfs2_journal_access_db(handle, |
0cf2f763 | 1677 | INODE_CACHE(dir), |
13723d00 | 1678 | insert_bh, |
4ed8a6bb MF |
1679 | OCFS2_JOURNAL_ACCESS_WRITE); |
1680 | ||
2e173152 DY |
1681 | if (!retval && ocfs2_dir_indexed(dir)) |
1682 | retval = ocfs2_dx_dir_insert(dir, | |
4ed8a6bb MF |
1683 | handle, |
1684 | lookup); | |
2e173152 DY |
1685 | } |
1686 | ||
1687 | if (retval) { | |
1688 | mlog_errno(retval); | |
1689 | goto bail; | |
9b7895ef MF |
1690 | } |
1691 | ||
316f4b9f MF |
1692 | /* By now the buffer is marked for journaling */ |
1693 | offset += le16_to_cpu(de->rec_len); | |
1694 | if (le64_to_cpu(de->inode)) { | |
1695 | de1 = (struct ocfs2_dir_entry *)((char *) de + | |
1696 | OCFS2_DIR_REC_LEN(de->name_len)); | |
1697 | de1->rec_len = | |
1698 | cpu_to_le16(le16_to_cpu(de->rec_len) - | |
1699 | OCFS2_DIR_REC_LEN(de->name_len)); | |
1700 | de->rec_len = cpu_to_le16(OCFS2_DIR_REC_LEN(de->name_len)); | |
1701 | de = de1; | |
1702 | } | |
9dc2108d | 1703 | de->file_type = FT_UNKNOWN; |
316f4b9f MF |
1704 | if (blkno) { |
1705 | de->inode = cpu_to_le64(blkno); | |
1706 | ocfs2_set_de_type(de, inode->i_mode); | |
1707 | } else | |
1708 | de->inode = 0; | |
1709 | de->name_len = namelen; | |
1710 | memcpy(de->name, name, namelen); | |
1711 | ||
e7c17e43 MF |
1712 | if (ocfs2_dir_indexed(dir)) |
1713 | ocfs2_recalc_free_list(dir, handle, lookup); | |
1714 | ||
cc56c33e | 1715 | inode_inc_iversion(dir); |
ec20cec7 | 1716 | ocfs2_journal_dirty(handle, insert_bh); |
316f4b9f MF |
1717 | retval = 0; |
1718 | goto bail; | |
1719 | } | |
87d35a74 | 1720 | |
316f4b9f MF |
1721 | offset += le16_to_cpu(de->rec_len); |
1722 | de = (struct ocfs2_dir_entry *) ((char *) de + le16_to_cpu(de->rec_len)); | |
1723 | } | |
1724 | ||
1725 | /* when you think about it, the assert above should prevent us | |
1726 | * from ever getting here. */ | |
1727 | retval = -ENOSPC; | |
1728 | bail: | |
c1e8d35e TM |
1729 | if (retval) |
1730 | mlog_errno(retval); | |
316f4b9f | 1731 | |
316f4b9f MF |
1732 | return retval; |
1733 | } | |
1734 | ||
23193e51 | 1735 | static int ocfs2_dir_foreach_blk_id(struct inode *inode, |
2b47c361 | 1736 | u64 *f_version, |
3704412b | 1737 | struct dir_context *ctx) |
23193e51 | 1738 | { |
3704412b AV |
1739 | int ret, i; |
1740 | unsigned long offset = ctx->pos; | |
23193e51 MF |
1741 | struct buffer_head *di_bh = NULL; |
1742 | struct ocfs2_dinode *di; | |
1743 | struct ocfs2_inline_data *data; | |
1744 | struct ocfs2_dir_entry *de; | |
1745 | ||
b657c95c | 1746 | ret = ocfs2_read_inode_block(inode, &di_bh); |
23193e51 MF |
1747 | if (ret) { |
1748 | mlog(ML_ERROR, "Unable to read inode block for dir %llu\n", | |
1749 | (unsigned long long)OCFS2_I(inode)->ip_blkno); | |
1750 | goto out; | |
1751 | } | |
1752 | ||
1753 | di = (struct ocfs2_dinode *)di_bh->b_data; | |
1754 | data = &di->id2.i_data; | |
1755 | ||
3704412b | 1756 | while (ctx->pos < i_size_read(inode)) { |
23193e51 MF |
1757 | /* If the dir block has changed since the last call to |
1758 | * readdir(2), then we might be pointing to an invalid | |
1759 | * dirent right now. Scan from the start of the block | |
1760 | * to make sure. */ | |
c472c07b | 1761 | if (!inode_eq_iversion(inode, *f_version)) { |
23193e51 MF |
1762 | for (i = 0; i < i_size_read(inode) && i < offset; ) { |
1763 | de = (struct ocfs2_dir_entry *) | |
1764 | (data->id_data + i); | |
1765 | /* It's too expensive to do a full | |
1766 | * dirent test each time round this | |
1767 | * loop, but we do have to test at | |
1768 | * least that it is non-zero. A | |
1769 | * failure will be detected in the | |
1770 | * dirent test below. */ | |
1771 | if (le16_to_cpu(de->rec_len) < | |
1772 | OCFS2_DIR_REC_LEN(1)) | |
1773 | break; | |
1774 | i += le16_to_cpu(de->rec_len); | |
1775 | } | |
3704412b | 1776 | ctx->pos = offset = i; |
cc56c33e | 1777 | *f_version = inode_query_iversion(inode); |
23193e51 MF |
1778 | } |
1779 | ||
3704412b AV |
1780 | de = (struct ocfs2_dir_entry *) (data->id_data + ctx->pos); |
1781 | if (!ocfs2_check_dir_entry(inode, de, di_bh, ctx->pos)) { | |
23193e51 | 1782 | /* On error, skip the f_pos to the end. */ |
3704412b AV |
1783 | ctx->pos = i_size_read(inode); |
1784 | break; | |
23193e51 MF |
1785 | } |
1786 | offset += le16_to_cpu(de->rec_len); | |
1787 | if (le64_to_cpu(de->inode)) { | |
3704412b | 1788 | if (!dir_emit(ctx, de->name, de->name_len, |
9dc2108d PP |
1789 | le64_to_cpu(de->inode), |
1790 | fs_ftype_to_dtype(de->file_type))) | |
3704412b | 1791 | goto out; |
23193e51 | 1792 | } |
3704412b | 1793 | ctx->pos += le16_to_cpu(de->rec_len); |
23193e51 | 1794 | } |
23193e51 MF |
1795 | out: |
1796 | brelse(di_bh); | |
23193e51 MF |
1797 | return 0; |
1798 | } | |
1799 | ||
9b7895ef MF |
1800 | /* |
1801 | * NOTE: This function can be called against unindexed directories, | |
1802 | * and indexed ones. | |
1803 | */ | |
23193e51 | 1804 | static int ocfs2_dir_foreach_blk_el(struct inode *inode, |
2b47c361 | 1805 | u64 *f_version, |
3704412b AV |
1806 | struct dir_context *ctx, |
1807 | bool persist) | |
ccd979bd | 1808 | { |
aa958874 | 1809 | unsigned long offset, blk, last_ra_blk = 0; |
3704412b | 1810 | int i; |
ccd979bd MF |
1811 | struct buffer_head * bh, * tmp; |
1812 | struct ocfs2_dir_entry * de; | |
ccd979bd | 1813 | struct super_block * sb = inode->i_sb; |
aa958874 | 1814 | unsigned int ra_sectors = 16; |
3704412b | 1815 | int stored = 0; |
ccd979bd | 1816 | |
ccd979bd MF |
1817 | bh = NULL; |
1818 | ||
3704412b | 1819 | offset = ctx->pos & (sb->s_blocksize - 1); |
ccd979bd | 1820 | |
3704412b AV |
1821 | while (ctx->pos < i_size_read(inode)) { |
1822 | blk = ctx->pos >> sb->s_blocksize_bits; | |
a22305cc JB |
1823 | if (ocfs2_read_dir_block(inode, blk, &bh, 0)) { |
1824 | /* Skip the corrupt dirblock and keep trying */ | |
3704412b | 1825 | ctx->pos += sb->s_blocksize - offset; |
ccd979bd MF |
1826 | continue; |
1827 | } | |
1828 | ||
aa958874 MF |
1829 | /* The idea here is to begin with 8k read-ahead and to stay |
1830 | * 4k ahead of our current position. | |
1831 | * | |
1832 | * TODO: Use the pagecache for this. We just need to | |
1833 | * make sure it's cluster-safe... */ | |
1834 | if (!last_ra_blk | |
1835 | || (((last_ra_blk - blk) << 9) <= (ra_sectors / 2))) { | |
1836 | for (i = ra_sectors >> (sb->s_blocksize_bits - 9); | |
ccd979bd | 1837 | i > 0; i--) { |
a22305cc JB |
1838 | tmp = NULL; |
1839 | if (!ocfs2_read_dir_block(inode, ++blk, &tmp, | |
1840 | OCFS2_BH_READAHEAD)) | |
1841 | brelse(tmp); | |
ccd979bd | 1842 | } |
aa958874 MF |
1843 | last_ra_blk = blk; |
1844 | ra_sectors = 8; | |
ccd979bd MF |
1845 | } |
1846 | ||
ccd979bd MF |
1847 | /* If the dir block has changed since the last call to |
1848 | * readdir(2), then we might be pointing to an invalid | |
1849 | * dirent right now. Scan from the start of the block | |
1850 | * to make sure. */ | |
c472c07b | 1851 | if (!inode_eq_iversion(inode, *f_version)) { |
ccd979bd MF |
1852 | for (i = 0; i < sb->s_blocksize && i < offset; ) { |
1853 | de = (struct ocfs2_dir_entry *) (bh->b_data + i); | |
1854 | /* It's too expensive to do a full | |
1855 | * dirent test each time round this | |
1856 | * loop, but we do have to test at | |
1857 | * least that it is non-zero. A | |
1858 | * failure will be detected in the | |
1859 | * dirent test below. */ | |
1860 | if (le16_to_cpu(de->rec_len) < | |
1861 | OCFS2_DIR_REC_LEN(1)) | |
1862 | break; | |
1863 | i += le16_to_cpu(de->rec_len); | |
1864 | } | |
1865 | offset = i; | |
3704412b | 1866 | ctx->pos = (ctx->pos & ~(sb->s_blocksize - 1)) |
ccd979bd | 1867 | | offset; |
cc56c33e | 1868 | *f_version = inode_query_iversion(inode); |
ccd979bd MF |
1869 | } |
1870 | ||
3704412b | 1871 | while (ctx->pos < i_size_read(inode) |
ccd979bd MF |
1872 | && offset < sb->s_blocksize) { |
1873 | de = (struct ocfs2_dir_entry *) (bh->b_data + offset); | |
1874 | if (!ocfs2_check_dir_entry(inode, de, bh, offset)) { | |
1875 | /* On error, skip the f_pos to the | |
1876 | next block. */ | |
3704412b | 1877 | ctx->pos = (ctx->pos | (sb->s_blocksize - 1)) + 1; |
29aa3016 | 1878 | break; |
ccd979bd | 1879 | } |
ccd979bd | 1880 | if (le64_to_cpu(de->inode)) { |
3704412b | 1881 | if (!dir_emit(ctx, de->name, |
ccd979bd | 1882 | de->name_len, |
7e853679 | 1883 | le64_to_cpu(de->inode), |
9dc2108d | 1884 | fs_ftype_to_dtype(de->file_type))) { |
3704412b AV |
1885 | brelse(bh); |
1886 | return 0; | |
e7b34019 | 1887 | } |
3704412b | 1888 | stored++; |
ccd979bd | 1889 | } |
3704412b AV |
1890 | offset += le16_to_cpu(de->rec_len); |
1891 | ctx->pos += le16_to_cpu(de->rec_len); | |
ccd979bd MF |
1892 | } |
1893 | offset = 0; | |
1894 | brelse(bh); | |
a22305cc | 1895 | bh = NULL; |
3704412b AV |
1896 | if (!persist && stored) |
1897 | break; | |
ccd979bd | 1898 | } |
3704412b | 1899 | return 0; |
b8bc5f4f MF |
1900 | } |
1901 | ||
2b47c361 | 1902 | static int ocfs2_dir_foreach_blk(struct inode *inode, u64 *f_version, |
3704412b AV |
1903 | struct dir_context *ctx, |
1904 | bool persist) | |
23193e51 MF |
1905 | { |
1906 | if (OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL) | |
3704412b AV |
1907 | return ocfs2_dir_foreach_blk_id(inode, f_version, ctx); |
1908 | return ocfs2_dir_foreach_blk_el(inode, f_version, ctx, persist); | |
23193e51 MF |
1909 | } |
1910 | ||
5eae5b96 MF |
1911 | /* |
1912 | * This is intended to be called from inside other kernel functions, | |
1913 | * so we fake some arguments. | |
1914 | */ | |
3704412b | 1915 | int ocfs2_dir_foreach(struct inode *inode, struct dir_context *ctx) |
5eae5b96 | 1916 | { |
cc56c33e | 1917 | u64 version = inode_query_iversion(inode); |
3704412b | 1918 | ocfs2_dir_foreach_blk(inode, &version, ctx, true); |
5eae5b96 MF |
1919 | return 0; |
1920 | } | |
1921 | ||
b8bc5f4f MF |
1922 | /* |
1923 | * ocfs2_readdir() | |
1924 | * | |
1925 | */ | |
3704412b | 1926 | int ocfs2_readdir(struct file *file, struct dir_context *ctx) |
b8bc5f4f MF |
1927 | { |
1928 | int error = 0; | |
3704412b | 1929 | struct inode *inode = file_inode(file); |
b8bc5f4f MF |
1930 | int lock_level = 0; |
1931 | ||
f1088d47 | 1932 | trace_ocfs2_readdir((unsigned long long)OCFS2_I(inode)->ip_blkno); |
b8bc5f4f | 1933 | |
c4c2416a | 1934 | error = ocfs2_inode_lock_atime(inode, file->f_path.mnt, &lock_level, 1); |
b8bc5f4f MF |
1935 | if (lock_level && error >= 0) { |
1936 | /* We release EX lock which used to update atime | |
1937 | * and get PR lock again to reduce contention | |
1938 | * on commonly accessed directories. */ | |
e63aecb6 | 1939 | ocfs2_inode_unlock(inode, 1); |
b8bc5f4f | 1940 | lock_level = 0; |
e63aecb6 | 1941 | error = ocfs2_inode_lock(inode, NULL, 0); |
b8bc5f4f MF |
1942 | } |
1943 | if (error < 0) { | |
1944 | if (error != -ENOENT) | |
1945 | mlog_errno(error); | |
1946 | /* we haven't got any yet, so propagate the error. */ | |
1947 | goto bail_nolock; | |
1948 | } | |
1949 | ||
3704412b | 1950 | error = ocfs2_dir_foreach_blk(inode, &file->f_version, ctx, false); |
b8bc5f4f | 1951 | |
e63aecb6 | 1952 | ocfs2_inode_unlock(inode, lock_level); |
c1e8d35e TM |
1953 | if (error) |
1954 | mlog_errno(error); | |
ccd979bd | 1955 | |
aa958874 | 1956 | bail_nolock: |
ccd979bd | 1957 | |
b8bc5f4f | 1958 | return error; |
ccd979bd MF |
1959 | } |
1960 | ||
1961 | /* | |
1b1dcc1b | 1962 | * NOTE: this should always be called with parent dir i_mutex taken. |
ccd979bd MF |
1963 | */ |
1964 | int ocfs2_find_files_on_disk(const char *name, | |
1965 | int namelen, | |
1966 | u64 *blkno, | |
1967 | struct inode *inode, | |
4a12ca3a | 1968 | struct ocfs2_dir_lookup_result *lookup) |
ccd979bd MF |
1969 | { |
1970 | int status = -ENOENT; | |
ccd979bd | 1971 | |
f1088d47 TM |
1972 | trace_ocfs2_find_files_on_disk(namelen, name, blkno, |
1973 | (unsigned long long)OCFS2_I(inode)->ip_blkno); | |
ccd979bd | 1974 | |
4a12ca3a MF |
1975 | status = ocfs2_find_entry(name, namelen, inode, lookup); |
1976 | if (status) | |
ccd979bd | 1977 | goto leave; |
ccd979bd | 1978 | |
4a12ca3a | 1979 | *blkno = le64_to_cpu(lookup->dl_entry->inode); |
ccd979bd MF |
1980 | |
1981 | status = 0; | |
1982 | leave: | |
ccd979bd | 1983 | |
ccd979bd MF |
1984 | return status; |
1985 | } | |
1986 | ||
be94d117 MF |
1987 | /* |
1988 | * Convenience function for callers which just want the block number | |
1989 | * mapped to a name and don't require the full dirent info, etc. | |
1990 | */ | |
1991 | int ocfs2_lookup_ino_from_name(struct inode *dir, const char *name, | |
1992 | int namelen, u64 *blkno) | |
1993 | { | |
1994 | int ret; | |
4a12ca3a | 1995 | struct ocfs2_dir_lookup_result lookup = { NULL, }; |
be94d117 | 1996 | |
4a12ca3a MF |
1997 | ret = ocfs2_find_files_on_disk(name, namelen, blkno, dir, &lookup); |
1998 | ocfs2_free_dir_lookup_result(&lookup); | |
be94d117 MF |
1999 | |
2000 | return ret; | |
2001 | } | |
2002 | ||
ccd979bd MF |
2003 | /* Check for a name within a directory. |
2004 | * | |
2005 | * Return 0 if the name does not exist | |
2006 | * Return -EEXIST if the directory contains the name | |
2007 | * | |
1b1dcc1b | 2008 | * Callers should have i_mutex + a cluster lock on dir |
ccd979bd MF |
2009 | */ |
2010 | int ocfs2_check_dir_for_entry(struct inode *dir, | |
2011 | const char *name, | |
2012 | int namelen) | |
2013 | { | |
7c01ad8f | 2014 | int ret = 0; |
4a12ca3a | 2015 | struct ocfs2_dir_lookup_result lookup = { NULL, }; |
ccd979bd | 2016 | |
f1088d47 TM |
2017 | trace_ocfs2_check_dir_for_entry( |
2018 | (unsigned long long)OCFS2_I(dir)->ip_blkno, namelen, name); | |
ccd979bd | 2019 | |
7c01ad8f DY |
2020 | if (ocfs2_find_entry(name, namelen, dir, &lookup) == 0) { |
2021 | ret = -EEXIST; | |
2022 | mlog_errno(ret); | |
2023 | } | |
ccd979bd | 2024 | |
4a12ca3a | 2025 | ocfs2_free_dir_lookup_result(&lookup); |
ccd979bd | 2026 | |
ccd979bd MF |
2027 | return ret; |
2028 | } | |
2029 | ||
0bfbbf62 | 2030 | struct ocfs2_empty_dir_priv { |
3704412b | 2031 | struct dir_context ctx; |
0bfbbf62 MF |
2032 | unsigned seen_dot; |
2033 | unsigned seen_dot_dot; | |
2034 | unsigned seen_other; | |
e3a93c2d | 2035 | unsigned dx_dir; |
0bfbbf62 | 2036 | }; |
ac7576f4 MS |
2037 | static int ocfs2_empty_dir_filldir(struct dir_context *ctx, const char *name, |
2038 | int name_len, loff_t pos, u64 ino, | |
2039 | unsigned type) | |
0bfbbf62 | 2040 | { |
ac7576f4 MS |
2041 | struct ocfs2_empty_dir_priv *p = |
2042 | container_of(ctx, struct ocfs2_empty_dir_priv, ctx); | |
0bfbbf62 MF |
2043 | |
2044 | /* | |
2045 | * Check the positions of "." and ".." records to be sure | |
2046 | * they're in the correct place. | |
e3a93c2d MF |
2047 | * |
2048 | * Indexed directories don't need to proceed past the first | |
2049 | * two entries, so we end the scan after seeing '..'. Despite | |
2050 | * that, we allow the scan to proceed In the event that we | |
2051 | * have a corrupted indexed directory (no dot or dot dot | |
2052 | * entries). This allows us to double check for existing | |
2053 | * entries which might not have been found in the index. | |
0bfbbf62 MF |
2054 | */ |
2055 | if (name_len == 1 && !strncmp(".", name, 1) && pos == 0) { | |
2056 | p->seen_dot = 1; | |
2057 | return 0; | |
2058 | } | |
2059 | ||
2060 | if (name_len == 2 && !strncmp("..", name, 2) && | |
2061 | pos == OCFS2_DIR_REC_LEN(1)) { | |
2062 | p->seen_dot_dot = 1; | |
e3a93c2d MF |
2063 | |
2064 | if (p->dx_dir && p->seen_dot) | |
2065 | return 1; | |
2066 | ||
0bfbbf62 MF |
2067 | return 0; |
2068 | } | |
2069 | ||
2070 | p->seen_other = 1; | |
2071 | return 1; | |
2072 | } | |
e3a93c2d MF |
2073 | |
2074 | static int ocfs2_empty_dir_dx(struct inode *inode, | |
2075 | struct ocfs2_empty_dir_priv *priv) | |
2076 | { | |
2077 | int ret; | |
2078 | struct buffer_head *di_bh = NULL; | |
2079 | struct buffer_head *dx_root_bh = NULL; | |
2080 | struct ocfs2_dinode *di; | |
2081 | struct ocfs2_dx_root_block *dx_root; | |
2082 | ||
2083 | priv->dx_dir = 1; | |
2084 | ||
2085 | ret = ocfs2_read_inode_block(inode, &di_bh); | |
2086 | if (ret) { | |
2087 | mlog_errno(ret); | |
2088 | goto out; | |
2089 | } | |
2090 | di = (struct ocfs2_dinode *)di_bh->b_data; | |
2091 | ||
2092 | ret = ocfs2_read_dx_root(inode, di, &dx_root_bh); | |
2093 | if (ret) { | |
2094 | mlog_errno(ret); | |
2095 | goto out; | |
2096 | } | |
2097 | dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data; | |
2098 | ||
2099 | if (le32_to_cpu(dx_root->dr_num_entries) != 2) | |
2100 | priv->seen_other = 1; | |
2101 | ||
2102 | out: | |
2103 | brelse(di_bh); | |
2104 | brelse(dx_root_bh); | |
2105 | return ret; | |
2106 | } | |
2107 | ||
ccd979bd MF |
2108 | /* |
2109 | * routine to check that the specified directory is empty (for rmdir) | |
0bfbbf62 MF |
2110 | * |
2111 | * Returns 1 if dir is empty, zero otherwise. | |
9b7895ef | 2112 | * |
e3a93c2d | 2113 | * XXX: This is a performance problem for unindexed directories. |
ccd979bd MF |
2114 | */ |
2115 | int ocfs2_empty_dir(struct inode *inode) | |
2116 | { | |
0bfbbf62 | 2117 | int ret; |
3704412b | 2118 | struct ocfs2_empty_dir_priv priv = { |
d6394b59 | 2119 | .ctx.actor = ocfs2_empty_dir_filldir, |
3704412b | 2120 | }; |
ccd979bd | 2121 | |
e3a93c2d MF |
2122 | if (ocfs2_dir_indexed(inode)) { |
2123 | ret = ocfs2_empty_dir_dx(inode, &priv); | |
2124 | if (ret) | |
2125 | mlog_errno(ret); | |
2126 | /* | |
2127 | * We still run ocfs2_dir_foreach to get the checks | |
2128 | * for "." and "..". | |
2129 | */ | |
2130 | } | |
2131 | ||
3704412b | 2132 | ret = ocfs2_dir_foreach(inode, &priv.ctx); |
0bfbbf62 MF |
2133 | if (ret) |
2134 | mlog_errno(ret); | |
2135 | ||
2136 | if (!priv.seen_dot || !priv.seen_dot_dot) { | |
2137 | mlog(ML_ERROR, "bad directory (dir #%llu) - no `.' or `..'\n", | |
b0697053 | 2138 | (unsigned long long)OCFS2_I(inode)->ip_blkno); |
0bfbbf62 MF |
2139 | /* |
2140 | * XXX: Is it really safe to allow an unlink to continue? | |
2141 | */ | |
ccd979bd MF |
2142 | return 1; |
2143 | } | |
0bfbbf62 MF |
2144 | |
2145 | return !priv.seen_other; | |
ccd979bd MF |
2146 | } |
2147 | ||
87d35a74 MF |
2148 | /* |
2149 | * Fills "." and ".." dirents in a new directory block. Returns dirent for | |
2150 | * "..", which might be used during creation of a directory with a trailing | |
2151 | * header. It is otherwise safe to ignore the return code. | |
2152 | */ | |
2153 | static struct ocfs2_dir_entry *ocfs2_fill_initial_dirents(struct inode *inode, | |
2154 | struct inode *parent, | |
2155 | char *start, | |
2156 | unsigned int size) | |
5b6a3a2b MF |
2157 | { |
2158 | struct ocfs2_dir_entry *de = (struct ocfs2_dir_entry *)start; | |
2159 | ||
2160 | de->inode = cpu_to_le64(OCFS2_I(inode)->ip_blkno); | |
2161 | de->name_len = 1; | |
2162 | de->rec_len = | |
2163 | cpu_to_le16(OCFS2_DIR_REC_LEN(de->name_len)); | |
2164 | strcpy(de->name, "."); | |
2165 | ocfs2_set_de_type(de, S_IFDIR); | |
2166 | ||
2167 | de = (struct ocfs2_dir_entry *) ((char *)de + le16_to_cpu(de->rec_len)); | |
2168 | de->inode = cpu_to_le64(OCFS2_I(parent)->ip_blkno); | |
2169 | de->rec_len = cpu_to_le16(size - OCFS2_DIR_REC_LEN(1)); | |
2170 | de->name_len = 2; | |
2171 | strcpy(de->name, ".."); | |
2172 | ocfs2_set_de_type(de, S_IFDIR); | |
87d35a74 MF |
2173 | |
2174 | return de; | |
5b6a3a2b MF |
2175 | } |
2176 | ||
2177 | /* | |
2178 | * This works together with code in ocfs2_mknod_locked() which sets | |
2179 | * the inline-data flag and initializes the inline-data section. | |
2180 | */ | |
2181 | static int ocfs2_fill_new_dir_id(struct ocfs2_super *osb, | |
2182 | handle_t *handle, | |
2183 | struct inode *parent, | |
2184 | struct inode *inode, | |
2185 | struct buffer_head *di_bh) | |
2186 | { | |
2187 | int ret; | |
2188 | struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data; | |
2189 | struct ocfs2_inline_data *data = &di->id2.i_data; | |
2190 | unsigned int size = le16_to_cpu(data->id_count); | |
2191 | ||
0cf2f763 | 2192 | ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh, |
13723d00 | 2193 | OCFS2_JOURNAL_ACCESS_WRITE); |
5b6a3a2b MF |
2194 | if (ret) { |
2195 | mlog_errno(ret); | |
2196 | goto out; | |
2197 | } | |
2198 | ||
2199 | ocfs2_fill_initial_dirents(inode, parent, data->id_data, size); | |
5b6a3a2b | 2200 | ocfs2_journal_dirty(handle, di_bh); |
5b6a3a2b MF |
2201 | |
2202 | i_size_write(inode, size); | |
bfe86848 | 2203 | set_nlink(inode, 2); |
5b6a3a2b MF |
2204 | inode->i_blocks = ocfs2_inode_sector_count(inode); |
2205 | ||
2206 | ret = ocfs2_mark_inode_dirty(handle, inode, di_bh); | |
2207 | if (ret < 0) | |
2208 | mlog_errno(ret); | |
2209 | ||
2210 | out: | |
2211 | return ret; | |
2212 | } | |
2213 | ||
2214 | static int ocfs2_fill_new_dir_el(struct ocfs2_super *osb, | |
2215 | handle_t *handle, | |
2216 | struct inode *parent, | |
2217 | struct inode *inode, | |
2218 | struct buffer_head *fe_bh, | |
9b7895ef MF |
2219 | struct ocfs2_alloc_context *data_ac, |
2220 | struct buffer_head **ret_new_bh) | |
316f4b9f MF |
2221 | { |
2222 | int status; | |
87d35a74 | 2223 | unsigned int size = osb->sb->s_blocksize; |
316f4b9f | 2224 | struct buffer_head *new_bh = NULL; |
87d35a74 | 2225 | struct ocfs2_dir_entry *de; |
316f4b9f | 2226 | |
e7c17e43 | 2227 | if (ocfs2_new_dir_wants_trailer(inode)) |
87d35a74 MF |
2228 | size = ocfs2_dir_trailer_blk_off(parent->i_sb); |
2229 | ||
316f4b9f MF |
2230 | status = ocfs2_do_extend_dir(osb->sb, handle, inode, fe_bh, |
2231 | data_ac, NULL, &new_bh); | |
2232 | if (status < 0) { | |
2233 | mlog_errno(status); | |
2234 | goto bail; | |
2235 | } | |
2236 | ||
8cb471e8 | 2237 | ocfs2_set_new_buffer_uptodate(INODE_CACHE(inode), new_bh); |
316f4b9f | 2238 | |
0cf2f763 | 2239 | status = ocfs2_journal_access_db(handle, INODE_CACHE(inode), new_bh, |
13723d00 | 2240 | OCFS2_JOURNAL_ACCESS_CREATE); |
316f4b9f MF |
2241 | if (status < 0) { |
2242 | mlog_errno(status); | |
2243 | goto bail; | |
2244 | } | |
2245 | memset(new_bh->b_data, 0, osb->sb->s_blocksize); | |
2246 | ||
87d35a74 | 2247 | de = ocfs2_fill_initial_dirents(inode, parent, new_bh->b_data, size); |
e7c17e43 MF |
2248 | if (ocfs2_new_dir_wants_trailer(inode)) { |
2249 | int size = le16_to_cpu(de->rec_len); | |
2250 | ||
2251 | /* | |
2252 | * Figure out the size of the hole left over after | |
2253 | * insertion of '.' and '..'. The trailer wants this | |
2254 | * information. | |
2255 | */ | |
2256 | size -= OCFS2_DIR_REC_LEN(2); | |
2257 | size -= sizeof(struct ocfs2_dir_block_trailer); | |
2258 | ||
2259 | ocfs2_init_dir_trailer(inode, new_bh, size); | |
2260 | } | |
316f4b9f | 2261 | |
ec20cec7 | 2262 | ocfs2_journal_dirty(handle, new_bh); |
316f4b9f MF |
2263 | |
2264 | i_size_write(inode, inode->i_sb->s_blocksize); | |
bfe86848 | 2265 | set_nlink(inode, 2); |
316f4b9f MF |
2266 | inode->i_blocks = ocfs2_inode_sector_count(inode); |
2267 | status = ocfs2_mark_inode_dirty(handle, inode, fe_bh); | |
2268 | if (status < 0) { | |
2269 | mlog_errno(status); | |
2270 | goto bail; | |
2271 | } | |
2272 | ||
2273 | status = 0; | |
9b7895ef MF |
2274 | if (ret_new_bh) { |
2275 | *ret_new_bh = new_bh; | |
2276 | new_bh = NULL; | |
2277 | } | |
316f4b9f | 2278 | bail: |
a81cb88b | 2279 | brelse(new_bh); |
316f4b9f | 2280 | |
316f4b9f MF |
2281 | return status; |
2282 | } | |
2283 | ||
9b7895ef MF |
2284 | static int ocfs2_dx_dir_attach_index(struct ocfs2_super *osb, |
2285 | handle_t *handle, struct inode *dir, | |
2286 | struct buffer_head *di_bh, | |
e7c17e43 | 2287 | struct buffer_head *dirdata_bh, |
9b7895ef | 2288 | struct ocfs2_alloc_context *meta_ac, |
e3a93c2d | 2289 | int dx_inline, u32 num_entries, |
9b7895ef | 2290 | struct buffer_head **ret_dx_root_bh) |
5b6a3a2b | 2291 | { |
9b7895ef MF |
2292 | int ret; |
2293 | struct ocfs2_dinode *di = (struct ocfs2_dinode *) di_bh->b_data; | |
2294 | u16 dr_suballoc_bit; | |
2b6cb576 | 2295 | u64 suballoc_loc, dr_blkno; |
9b7895ef MF |
2296 | unsigned int num_bits; |
2297 | struct buffer_head *dx_root_bh = NULL; | |
2298 | struct ocfs2_dx_root_block *dx_root; | |
e7c17e43 MF |
2299 | struct ocfs2_dir_block_trailer *trailer = |
2300 | ocfs2_trailer_from_bh(dirdata_bh, dir->i_sb); | |
9b7895ef | 2301 | |
2b6cb576 JB |
2302 | ret = ocfs2_claim_metadata(handle, meta_ac, 1, &suballoc_loc, |
2303 | &dr_suballoc_bit, &num_bits, &dr_blkno); | |
9b7895ef MF |
2304 | if (ret) { |
2305 | mlog_errno(ret); | |
2306 | goto out; | |
2307 | } | |
5b6a3a2b | 2308 | |
f1088d47 TM |
2309 | trace_ocfs2_dx_dir_attach_index( |
2310 | (unsigned long long)OCFS2_I(dir)->ip_blkno, | |
2311 | (unsigned long long)dr_blkno); | |
5b6a3a2b | 2312 | |
9b7895ef MF |
2313 | dx_root_bh = sb_getblk(osb->sb, dr_blkno); |
2314 | if (dx_root_bh == NULL) { | |
7391a294 | 2315 | ret = -ENOMEM; |
9b7895ef MF |
2316 | goto out; |
2317 | } | |
8cb471e8 | 2318 | ocfs2_set_new_buffer_uptodate(INODE_CACHE(dir), dx_root_bh); |
87d35a74 | 2319 | |
0cf2f763 | 2320 | ret = ocfs2_journal_access_dr(handle, INODE_CACHE(dir), dx_root_bh, |
9b7895ef MF |
2321 | OCFS2_JOURNAL_ACCESS_CREATE); |
2322 | if (ret < 0) { | |
2323 | mlog_errno(ret); | |
2324 | goto out; | |
2325 | } | |
87d35a74 | 2326 | |
9b7895ef MF |
2327 | dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data; |
2328 | memset(dx_root, 0, osb->sb->s_blocksize); | |
2329 | strcpy(dx_root->dr_signature, OCFS2_DX_ROOT_SIGNATURE); | |
b89c5428 | 2330 | dx_root->dr_suballoc_slot = cpu_to_le16(meta_ac->ac_alloc_slot); |
2b6cb576 | 2331 | dx_root->dr_suballoc_loc = cpu_to_le64(suballoc_loc); |
9b7895ef MF |
2332 | dx_root->dr_suballoc_bit = cpu_to_le16(dr_suballoc_bit); |
2333 | dx_root->dr_fs_generation = cpu_to_le32(osb->fs_generation); | |
2334 | dx_root->dr_blkno = cpu_to_le64(dr_blkno); | |
2335 | dx_root->dr_dir_blkno = cpu_to_le64(OCFS2_I(dir)->ip_blkno); | |
e3a93c2d | 2336 | dx_root->dr_num_entries = cpu_to_le32(num_entries); |
e7c17e43 MF |
2337 | if (le16_to_cpu(trailer->db_free_rec_len)) |
2338 | dx_root->dr_free_blk = cpu_to_le64(dirdata_bh->b_blocknr); | |
2339 | else | |
2340 | dx_root->dr_free_blk = cpu_to_le64(0); | |
4ed8a6bb MF |
2341 | |
2342 | if (dx_inline) { | |
2343 | dx_root->dr_flags |= OCFS2_DX_FLAG_INLINE; | |
2344 | dx_root->dr_entries.de_count = | |
2345 | cpu_to_le16(ocfs2_dx_entries_per_root(osb->sb)); | |
2346 | } else { | |
2347 | dx_root->dr_list.l_count = | |
2348 | cpu_to_le16(ocfs2_extent_recs_per_dx_root(osb->sb)); | |
2349 | } | |
ec20cec7 | 2350 | ocfs2_journal_dirty(handle, dx_root_bh); |
5b6a3a2b | 2351 | |
0cf2f763 | 2352 | ret = ocfs2_journal_access_di(handle, INODE_CACHE(dir), di_bh, |
9b7895ef MF |
2353 | OCFS2_JOURNAL_ACCESS_CREATE); |
2354 | if (ret) { | |
2355 | mlog_errno(ret); | |
2356 | goto out; | |
2357 | } | |
2358 | ||
2359 | di->i_dx_root = cpu_to_le64(dr_blkno); | |
2360 | ||
8ac33dc8 | 2361 | spin_lock(&OCFS2_I(dir)->ip_lock); |
9b7895ef MF |
2362 | OCFS2_I(dir)->ip_dyn_features |= OCFS2_INDEXED_DIR_FL; |
2363 | di->i_dyn_features = cpu_to_le16(OCFS2_I(dir)->ip_dyn_features); | |
8ac33dc8 | 2364 | spin_unlock(&OCFS2_I(dir)->ip_lock); |
9b7895ef | 2365 | |
ec20cec7 | 2366 | ocfs2_journal_dirty(handle, di_bh); |
9b7895ef MF |
2367 | |
2368 | *ret_dx_root_bh = dx_root_bh; | |
2369 | dx_root_bh = NULL; | |
2370 | ||
2371 | out: | |
2372 | brelse(dx_root_bh); | |
2373 | return ret; | |
2374 | } | |
2375 | ||
2376 | static int ocfs2_dx_dir_format_cluster(struct ocfs2_super *osb, | |
2377 | handle_t *handle, struct inode *dir, | |
2378 | struct buffer_head **dx_leaves, | |
2379 | int num_dx_leaves, u64 start_blk) | |
2380 | { | |
2381 | int ret, i; | |
2382 | struct ocfs2_dx_leaf *dx_leaf; | |
2383 | struct buffer_head *bh; | |
2384 | ||
2385 | for (i = 0; i < num_dx_leaves; i++) { | |
2386 | bh = sb_getblk(osb->sb, start_blk + i); | |
2387 | if (bh == NULL) { | |
7391a294 | 2388 | ret = -ENOMEM; |
9b7895ef MF |
2389 | goto out; |
2390 | } | |
2391 | dx_leaves[i] = bh; | |
2392 | ||
8cb471e8 | 2393 | ocfs2_set_new_buffer_uptodate(INODE_CACHE(dir), bh); |
9b7895ef | 2394 | |
0cf2f763 | 2395 | ret = ocfs2_journal_access_dl(handle, INODE_CACHE(dir), bh, |
9b7895ef MF |
2396 | OCFS2_JOURNAL_ACCESS_CREATE); |
2397 | if (ret < 0) { | |
2398 | mlog_errno(ret); | |
2399 | goto out; | |
2400 | } | |
2401 | ||
2402 | dx_leaf = (struct ocfs2_dx_leaf *) bh->b_data; | |
2403 | ||
2404 | memset(dx_leaf, 0, osb->sb->s_blocksize); | |
2405 | strcpy(dx_leaf->dl_signature, OCFS2_DX_LEAF_SIGNATURE); | |
2406 | dx_leaf->dl_fs_generation = cpu_to_le32(osb->fs_generation); | |
2407 | dx_leaf->dl_blkno = cpu_to_le64(bh->b_blocknr); | |
2408 | dx_leaf->dl_list.de_count = | |
2409 | cpu_to_le16(ocfs2_dx_entries_per_leaf(osb->sb)); | |
2410 | ||
f1088d47 TM |
2411 | trace_ocfs2_dx_dir_format_cluster( |
2412 | (unsigned long long)OCFS2_I(dir)->ip_blkno, | |
2413 | (unsigned long long)bh->b_blocknr, | |
2414 | le16_to_cpu(dx_leaf->dl_list.de_count)); | |
9b7895ef MF |
2415 | |
2416 | ocfs2_journal_dirty(handle, bh); | |
2417 | } | |
2418 | ||
2419 | ret = 0; | |
2420 | out: | |
2421 | return ret; | |
2422 | } | |
2423 | ||
2424 | /* | |
2425 | * Allocates and formats a new cluster for use in an indexed dir | |
2426 | * leaf. This version will not do the extent insert, so that it can be | |
2427 | * used by operations which need careful ordering. | |
2428 | */ | |
2429 | static int __ocfs2_dx_dir_new_cluster(struct inode *dir, | |
2430 | u32 cpos, handle_t *handle, | |
2431 | struct ocfs2_alloc_context *data_ac, | |
2432 | struct buffer_head **dx_leaves, | |
2433 | int num_dx_leaves, u64 *ret_phys_blkno) | |
2434 | { | |
2435 | int ret; | |
2436 | u32 phys, num; | |
2437 | u64 phys_blkno; | |
2438 | struct ocfs2_super *osb = OCFS2_SB(dir->i_sb); | |
2439 | ||
2440 | /* | |
2441 | * XXX: For create, this should claim cluster for the index | |
2442 | * *before* the unindexed insert so that we have a better | |
2443 | * chance of contiguousness as the directory grows in number | |
2444 | * of entries. | |
2445 | */ | |
1ed9b777 | 2446 | ret = __ocfs2_claim_clusters(handle, data_ac, 1, 1, &phys, &num); |
9b7895ef MF |
2447 | if (ret) { |
2448 | mlog_errno(ret); | |
2449 | goto out; | |
2450 | } | |
2451 | ||
2452 | /* | |
2453 | * Format the new cluster first. That way, we're inserting | |
2454 | * valid data. | |
2455 | */ | |
2456 | phys_blkno = ocfs2_clusters_to_blocks(osb->sb, phys); | |
2457 | ret = ocfs2_dx_dir_format_cluster(osb, handle, dir, dx_leaves, | |
2458 | num_dx_leaves, phys_blkno); | |
2459 | if (ret) { | |
2460 | mlog_errno(ret); | |
2461 | goto out; | |
2462 | } | |
2463 | ||
2464 | *ret_phys_blkno = phys_blkno; | |
2465 | out: | |
2466 | return ret; | |
2467 | } | |
2468 | ||
2469 | static int ocfs2_dx_dir_new_cluster(struct inode *dir, | |
2470 | struct ocfs2_extent_tree *et, | |
2471 | u32 cpos, handle_t *handle, | |
2472 | struct ocfs2_alloc_context *data_ac, | |
2473 | struct ocfs2_alloc_context *meta_ac, | |
2474 | struct buffer_head **dx_leaves, | |
2475 | int num_dx_leaves) | |
2476 | { | |
2477 | int ret; | |
2478 | u64 phys_blkno; | |
9b7895ef MF |
2479 | |
2480 | ret = __ocfs2_dx_dir_new_cluster(dir, cpos, handle, data_ac, dx_leaves, | |
2481 | num_dx_leaves, &phys_blkno); | |
2482 | if (ret) { | |
2483 | mlog_errno(ret); | |
2484 | goto out; | |
2485 | } | |
2486 | ||
cc79d8c1 | 2487 | ret = ocfs2_insert_extent(handle, et, cpos, phys_blkno, 1, 0, |
9b7895ef MF |
2488 | meta_ac); |
2489 | if (ret) | |
2490 | mlog_errno(ret); | |
2491 | out: | |
2492 | return ret; | |
2493 | } | |
2494 | ||
2495 | static struct buffer_head **ocfs2_dx_dir_kmalloc_leaves(struct super_block *sb, | |
2496 | int *ret_num_leaves) | |
2497 | { | |
2498 | int num_dx_leaves = ocfs2_clusters_to_blocks(sb, 1); | |
2499 | struct buffer_head **dx_leaves; | |
2500 | ||
2501 | dx_leaves = kcalloc(num_dx_leaves, sizeof(struct buffer_head *), | |
2502 | GFP_NOFS); | |
2503 | if (dx_leaves && ret_num_leaves) | |
2504 | *ret_num_leaves = num_dx_leaves; | |
2505 | ||
2506 | return dx_leaves; | |
2507 | } | |
2508 | ||
2509 | static int ocfs2_fill_new_dir_dx(struct ocfs2_super *osb, | |
2510 | handle_t *handle, | |
2511 | struct inode *parent, | |
2512 | struct inode *inode, | |
2513 | struct buffer_head *di_bh, | |
2514 | struct ocfs2_alloc_context *data_ac, | |
2515 | struct ocfs2_alloc_context *meta_ac) | |
2516 | { | |
4ed8a6bb | 2517 | int ret; |
9b7895ef MF |
2518 | struct buffer_head *leaf_bh = NULL; |
2519 | struct buffer_head *dx_root_bh = NULL; | |
9b7895ef | 2520 | struct ocfs2_dx_hinfo hinfo; |
4ed8a6bb MF |
2521 | struct ocfs2_dx_root_block *dx_root; |
2522 | struct ocfs2_dx_entry_list *entry_list; | |
9b7895ef MF |
2523 | |
2524 | /* | |
2525 | * Our strategy is to create the directory as though it were | |
2526 | * unindexed, then add the index block. This works with very | |
2527 | * little complication since the state of a new directory is a | |
2528 | * very well known quantity. | |
2529 | * | |
2530 | * Essentially, we have two dirents ("." and ".."), in the 1st | |
4ed8a6bb MF |
2531 | * block which need indexing. These are easily inserted into |
2532 | * the index block. | |
9b7895ef MF |
2533 | */ |
2534 | ||
2535 | ret = ocfs2_fill_new_dir_el(osb, handle, parent, inode, di_bh, | |
2536 | data_ac, &leaf_bh); | |
2537 | if (ret) { | |
2538 | mlog_errno(ret); | |
2539 | goto out; | |
2540 | } | |
2541 | ||
e7c17e43 | 2542 | ret = ocfs2_dx_dir_attach_index(osb, handle, inode, di_bh, leaf_bh, |
e3a93c2d | 2543 | meta_ac, 1, 2, &dx_root_bh); |
9b7895ef MF |
2544 | if (ret) { |
2545 | mlog_errno(ret); | |
2546 | goto out; | |
2547 | } | |
4ed8a6bb MF |
2548 | dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data; |
2549 | entry_list = &dx_root->dr_entries; | |
9b7895ef | 2550 | |
4ed8a6bb | 2551 | /* Buffer has been journaled for us by ocfs2_dx_dir_attach_index */ |
e7c17e43 | 2552 | ocfs2_dx_dir_name_hash(inode, ".", 1, &hinfo); |
4ed8a6bb | 2553 | ocfs2_dx_entry_list_insert(entry_list, &hinfo, leaf_bh->b_blocknr); |
9b7895ef MF |
2554 | |
2555 | ocfs2_dx_dir_name_hash(inode, "..", 2, &hinfo); | |
4ed8a6bb | 2556 | ocfs2_dx_entry_list_insert(entry_list, &hinfo, leaf_bh->b_blocknr); |
9b7895ef MF |
2557 | |
2558 | out: | |
9b7895ef MF |
2559 | brelse(dx_root_bh); |
2560 | brelse(leaf_bh); | |
2561 | return ret; | |
2562 | } | |
2563 | ||
2564 | int ocfs2_fill_new_dir(struct ocfs2_super *osb, | |
2565 | handle_t *handle, | |
2566 | struct inode *parent, | |
2567 | struct inode *inode, | |
2568 | struct buffer_head *fe_bh, | |
2569 | struct ocfs2_alloc_context *data_ac, | |
2570 | struct ocfs2_alloc_context *meta_ac) | |
2571 | ||
2572 | { | |
2573 | BUG_ON(!ocfs2_supports_inline_data(osb) && data_ac == NULL); | |
2574 | ||
2575 | if (OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL) | |
2576 | return ocfs2_fill_new_dir_id(osb, handle, parent, inode, fe_bh); | |
2577 | ||
2578 | if (ocfs2_supports_indexed_dirs(osb)) | |
2579 | return ocfs2_fill_new_dir_dx(osb, handle, parent, inode, fe_bh, | |
2580 | data_ac, meta_ac); | |
2581 | ||
2582 | return ocfs2_fill_new_dir_el(osb, handle, parent, inode, fe_bh, | |
2583 | data_ac, NULL); | |
2584 | } | |
2585 | ||
2586 | static int ocfs2_dx_dir_index_block(struct inode *dir, | |
2587 | handle_t *handle, | |
2588 | struct buffer_head **dx_leaves, | |
2589 | int num_dx_leaves, | |
e3a93c2d | 2590 | u32 *num_dx_entries, |
9b7895ef MF |
2591 | struct buffer_head *dirent_bh) |
2592 | { | |
0fba8137 | 2593 | int ret = 0, namelen, i; |
9b7895ef MF |
2594 | char *de_buf, *limit; |
2595 | struct ocfs2_dir_entry *de; | |
2596 | struct buffer_head *dx_leaf_bh; | |
2597 | struct ocfs2_dx_hinfo hinfo; | |
2598 | u64 dirent_blk = dirent_bh->b_blocknr; | |
2599 | ||
2600 | de_buf = dirent_bh->b_data; | |
2601 | limit = de_buf + dir->i_sb->s_blocksize; | |
2602 | ||
2603 | while (de_buf < limit) { | |
2604 | de = (struct ocfs2_dir_entry *)de_buf; | |
2605 | ||
2606 | namelen = de->name_len; | |
2607 | if (!namelen || !de->inode) | |
2608 | goto inc; | |
2609 | ||
2610 | ocfs2_dx_dir_name_hash(dir, de->name, namelen, &hinfo); | |
2611 | ||
2612 | i = ocfs2_dx_dir_hash_idx(OCFS2_SB(dir->i_sb), &hinfo); | |
2613 | dx_leaf_bh = dx_leaves[i]; | |
2614 | ||
2615 | ret = __ocfs2_dx_dir_leaf_insert(dir, handle, &hinfo, | |
2616 | dirent_blk, dx_leaf_bh); | |
2617 | if (ret) { | |
2618 | mlog_errno(ret); | |
2619 | goto out; | |
2620 | } | |
2621 | ||
e3a93c2d MF |
2622 | *num_dx_entries = *num_dx_entries + 1; |
2623 | ||
9b7895ef MF |
2624 | inc: |
2625 | de_buf += le16_to_cpu(de->rec_len); | |
2626 | } | |
2627 | ||
2628 | out: | |
2629 | return ret; | |
2630 | } | |
e7c17e43 MF |
2631 | |
2632 | /* | |
4ed8a6bb MF |
2633 | * XXX: This expects dx_root_bh to already be part of the transaction. |
2634 | */ | |
2635 | static void ocfs2_dx_dir_index_root_block(struct inode *dir, | |
2636 | struct buffer_head *dx_root_bh, | |
2637 | struct buffer_head *dirent_bh) | |
2638 | { | |
2639 | char *de_buf, *limit; | |
2640 | struct ocfs2_dx_root_block *dx_root; | |
2641 | struct ocfs2_dir_entry *de; | |
2642 | struct ocfs2_dx_hinfo hinfo; | |
2643 | u64 dirent_blk = dirent_bh->b_blocknr; | |
2644 | ||
2645 | dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data; | |
2646 | ||
2647 | de_buf = dirent_bh->b_data; | |
2648 | limit = de_buf + dir->i_sb->s_blocksize; | |
2649 | ||
2650 | while (de_buf < limit) { | |
2651 | de = (struct ocfs2_dir_entry *)de_buf; | |
2652 | ||
2653 | if (!de->name_len || !de->inode) | |
2654 | goto inc; | |
2655 | ||
2656 | ocfs2_dx_dir_name_hash(dir, de->name, de->name_len, &hinfo); | |
2657 | ||
f1088d47 TM |
2658 | trace_ocfs2_dx_dir_index_root_block( |
2659 | (unsigned long long)dir->i_ino, | |
2660 | hinfo.major_hash, hinfo.minor_hash, | |
2661 | de->name_len, de->name, | |
2662 | le16_to_cpu(dx_root->dr_entries.de_num_used)); | |
4ed8a6bb MF |
2663 | |
2664 | ocfs2_dx_entry_list_insert(&dx_root->dr_entries, &hinfo, | |
2665 | dirent_blk); | |
e3a93c2d MF |
2666 | |
2667 | le32_add_cpu(&dx_root->dr_num_entries, 1); | |
4ed8a6bb MF |
2668 | inc: |
2669 | de_buf += le16_to_cpu(de->rec_len); | |
2670 | } | |
2671 | } | |
2672 | ||
2673 | /* | |
2674 | * Count the number of inline directory entries in di_bh and compare | |
2675 | * them against the number of entries we can hold in an inline dx root | |
2676 | * block. | |
2677 | */ | |
2678 | static int ocfs2_new_dx_should_be_inline(struct inode *dir, | |
2679 | struct buffer_head *di_bh) | |
2680 | { | |
2681 | int dirent_count = 0; | |
2682 | char *de_buf, *limit; | |
2683 | struct ocfs2_dir_entry *de; | |
2684 | struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data; | |
2685 | ||
2686 | de_buf = di->id2.i_data.id_data; | |
2687 | limit = de_buf + i_size_read(dir); | |
2688 | ||
2689 | while (de_buf < limit) { | |
2690 | de = (struct ocfs2_dir_entry *)de_buf; | |
2691 | ||
2692 | if (de->name_len && de->inode) | |
2693 | dirent_count++; | |
2694 | ||
2695 | de_buf += le16_to_cpu(de->rec_len); | |
2696 | } | |
2697 | ||
2698 | /* We are careful to leave room for one extra record. */ | |
2699 | return dirent_count < ocfs2_dx_entries_per_root(dir->i_sb); | |
2700 | } | |
9b7895ef MF |
2701 | |
2702 | /* | |
2703 | * Expand rec_len of the rightmost dirent in a directory block so that it | |
2704 | * contains the end of our valid space for dirents. We do this during | |
2705 | * expansion from an inline directory to one with extents. The first dir block | |
2706 | * in that case is taken from the inline data portion of the inode block. | |
2707 | * | |
e7c17e43 MF |
2708 | * This will also return the largest amount of contiguous space for a dirent |
2709 | * in the block. That value is *not* necessarily the last dirent, even after | |
2710 | * expansion. The directory indexing code wants this value for free space | |
2711 | * accounting. We do this here since we're already walking the entire dir | |
2712 | * block. | |
2713 | * | |
9b7895ef MF |
2714 | * We add the dir trailer if this filesystem wants it. |
2715 | */ | |
e7c17e43 MF |
2716 | static unsigned int ocfs2_expand_last_dirent(char *start, unsigned int old_size, |
2717 | struct inode *dir) | |
9b7895ef | 2718 | { |
e7c17e43 | 2719 | struct super_block *sb = dir->i_sb; |
9b7895ef MF |
2720 | struct ocfs2_dir_entry *de; |
2721 | struct ocfs2_dir_entry *prev_de; | |
2722 | char *de_buf, *limit; | |
2723 | unsigned int new_size = sb->s_blocksize; | |
e7c17e43 MF |
2724 | unsigned int bytes, this_hole; |
2725 | unsigned int largest_hole = 0; | |
9b7895ef | 2726 | |
e7c17e43 | 2727 | if (ocfs2_new_dir_wants_trailer(dir)) |
9b7895ef MF |
2728 | new_size = ocfs2_dir_trailer_blk_off(sb); |
2729 | ||
2730 | bytes = new_size - old_size; | |
2731 | ||
2732 | limit = start + old_size; | |
2733 | de_buf = start; | |
2734 | de = (struct ocfs2_dir_entry *)de_buf; | |
5b6a3a2b | 2735 | do { |
e7c17e43 MF |
2736 | this_hole = ocfs2_figure_dirent_hole(de); |
2737 | if (this_hole > largest_hole) | |
2738 | largest_hole = this_hole; | |
2739 | ||
5b6a3a2b MF |
2740 | prev_de = de; |
2741 | de_buf += le16_to_cpu(de->rec_len); | |
2742 | de = (struct ocfs2_dir_entry *)de_buf; | |
2743 | } while (de_buf < limit); | |
2744 | ||
2745 | le16_add_cpu(&prev_de->rec_len, bytes); | |
e7c17e43 MF |
2746 | |
2747 | /* We need to double check this after modification of the final | |
2748 | * dirent. */ | |
2749 | this_hole = ocfs2_figure_dirent_hole(prev_de); | |
2750 | if (this_hole > largest_hole) | |
2751 | largest_hole = this_hole; | |
2752 | ||
2753 | if (largest_hole >= OCFS2_DIR_MIN_REC_LEN) | |
2754 | return largest_hole; | |
2755 | return 0; | |
5b6a3a2b MF |
2756 | } |
2757 | ||
2758 | /* | |
2759 | * We allocate enough clusters to fulfill "blocks_wanted", but set | |
2760 | * i_size to exactly one block. Ocfs2_extend_dir() will handle the | |
2761 | * rest automatically for us. | |
2762 | * | |
2763 | * *first_block_bh is a pointer to the 1st data block allocated to the | |
2764 | * directory. | |
2765 | */ | |
2766 | static int ocfs2_expand_inline_dir(struct inode *dir, struct buffer_head *di_bh, | |
2767 | unsigned int blocks_wanted, | |
9b7895ef | 2768 | struct ocfs2_dir_lookup_result *lookup, |
5b6a3a2b MF |
2769 | struct buffer_head **first_block_bh) |
2770 | { | |
e3a93c2d | 2771 | u32 alloc, dx_alloc, bit_off, len, num_dx_entries = 0; |
5b6a3a2b | 2772 | struct super_block *sb = dir->i_sb; |
4ed8a6bb | 2773 | int ret, i, num_dx_leaves = 0, dx_inline = 0, |
9b7895ef MF |
2774 | credits = ocfs2_inline_to_extents_credits(sb); |
2775 | u64 dx_insert_blkno, blkno, | |
2776 | bytes = blocks_wanted << sb->s_blocksize_bits; | |
5b6a3a2b MF |
2777 | struct ocfs2_super *osb = OCFS2_SB(dir->i_sb); |
2778 | struct ocfs2_inode_info *oi = OCFS2_I(dir); | |
5d44670f | 2779 | struct ocfs2_alloc_context *data_ac = NULL; |
9b7895ef | 2780 | struct ocfs2_alloc_context *meta_ac = NULL; |
5b6a3a2b | 2781 | struct buffer_head *dirdata_bh = NULL; |
9b7895ef MF |
2782 | struct buffer_head *dx_root_bh = NULL; |
2783 | struct buffer_head **dx_leaves = NULL; | |
5b6a3a2b MF |
2784 | struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data; |
2785 | handle_t *handle; | |
f99b9b7c | 2786 | struct ocfs2_extent_tree et; |
9b7895ef MF |
2787 | struct ocfs2_extent_tree dx_et; |
2788 | int did_quota = 0, bytes_allocated = 0; | |
f99b9b7c | 2789 | |
5e404e9e | 2790 | ocfs2_init_dinode_extent_tree(&et, INODE_CACHE(dir), di_bh); |
5b6a3a2b MF |
2791 | |
2792 | alloc = ocfs2_clusters_for_bytes(sb, bytes); | |
9b7895ef MF |
2793 | dx_alloc = 0; |
2794 | ||
edd45c08 JK |
2795 | down_write(&oi->ip_alloc_sem); |
2796 | ||
9b7895ef | 2797 | if (ocfs2_supports_indexed_dirs(osb)) { |
9b7895ef MF |
2798 | credits += ocfs2_add_dir_index_credits(sb); |
2799 | ||
4ed8a6bb MF |
2800 | dx_inline = ocfs2_new_dx_should_be_inline(dir, di_bh); |
2801 | if (!dx_inline) { | |
2802 | /* Add one more cluster for an index leaf */ | |
2803 | dx_alloc++; | |
2804 | dx_leaves = ocfs2_dx_dir_kmalloc_leaves(sb, | |
2805 | &num_dx_leaves); | |
2806 | if (!dx_leaves) { | |
2807 | ret = -ENOMEM; | |
2808 | mlog_errno(ret); | |
2809 | goto out; | |
2810 | } | |
9b7895ef MF |
2811 | } |
2812 | ||
2813 | /* This gets us the dx_root */ | |
2814 | ret = ocfs2_reserve_new_metadata_blocks(osb, 1, &meta_ac); | |
2815 | if (ret) { | |
2816 | mlog_errno(ret); | |
2817 | goto out; | |
2818 | } | |
2819 | } | |
5b6a3a2b MF |
2820 | |
2821 | /* | |
9b7895ef MF |
2822 | * We should never need more than 2 clusters for the unindexed |
2823 | * tree - maximum dirent size is far less than one block. In | |
2824 | * fact, the only time we'd need more than one cluster is if | |
5b6a3a2b MF |
2825 | * blocksize == clustersize and the dirent won't fit in the |
2826 | * extra space that the expansion to a single block gives. As | |
2827 | * of today, that only happens on 4k/4k file systems. | |
2828 | */ | |
2829 | BUG_ON(alloc > 2); | |
2830 | ||
035a5711 | 2831 | ret = ocfs2_reserve_clusters(osb, alloc + dx_alloc, &data_ac); |
5b6a3a2b MF |
2832 | if (ret) { |
2833 | mlog_errno(ret); | |
2834 | goto out; | |
2835 | } | |
2836 | ||
5b6a3a2b | 2837 | /* |
c78bad11 | 2838 | * Prepare for worst case allocation scenario of two separate |
9b7895ef | 2839 | * extents in the unindexed tree. |
5b6a3a2b MF |
2840 | */ |
2841 | if (alloc == 2) | |
2842 | credits += OCFS2_SUBALLOC_ALLOC; | |
2843 | ||
2844 | handle = ocfs2_start_trans(osb, credits); | |
2845 | if (IS_ERR(handle)) { | |
2846 | ret = PTR_ERR(handle); | |
2847 | mlog_errno(ret); | |
edd45c08 | 2848 | goto out; |
5b6a3a2b MF |
2849 | } |
2850 | ||
5dd4056d CH |
2851 | ret = dquot_alloc_space_nodirty(dir, |
2852 | ocfs2_clusters_to_bytes(osb->sb, alloc + dx_alloc)); | |
2853 | if (ret) | |
a90714c1 | 2854 | goto out_commit; |
a90714c1 | 2855 | did_quota = 1; |
9b7895ef | 2856 | |
4ed8a6bb | 2857 | if (ocfs2_supports_indexed_dirs(osb) && !dx_inline) { |
9b7895ef MF |
2858 | /* |
2859 | * Allocate our index cluster first, to maximize the | |
2860 | * possibility that unindexed leaves grow | |
2861 | * contiguously. | |
2862 | */ | |
2863 | ret = __ocfs2_dx_dir_new_cluster(dir, 0, handle, data_ac, | |
2864 | dx_leaves, num_dx_leaves, | |
2865 | &dx_insert_blkno); | |
2866 | if (ret) { | |
2867 | mlog_errno(ret); | |
2868 | goto out_commit; | |
2869 | } | |
2870 | bytes_allocated += ocfs2_clusters_to_bytes(dir->i_sb, 1); | |
2871 | } | |
2872 | ||
5b6a3a2b MF |
2873 | /* |
2874 | * Try to claim as many clusters as the bitmap can give though | |
2875 | * if we only get one now, that's enough to continue. The rest | |
2876 | * will be claimed after the conversion to extents. | |
2877 | */ | |
83f92318 MF |
2878 | if (ocfs2_dir_resv_allowed(osb)) |
2879 | data_ac->ac_resv = &oi->ip_la_data_resv; | |
1ed9b777 | 2880 | ret = ocfs2_claim_clusters(handle, data_ac, 1, &bit_off, &len); |
5b6a3a2b MF |
2881 | if (ret) { |
2882 | mlog_errno(ret); | |
2883 | goto out_commit; | |
2884 | } | |
9b7895ef | 2885 | bytes_allocated += ocfs2_clusters_to_bytes(dir->i_sb, 1); |
5b6a3a2b MF |
2886 | |
2887 | /* | |
2888 | * Operations are carefully ordered so that we set up the new | |
2889 | * data block first. The conversion from inline data to | |
2890 | * extents follows. | |
2891 | */ | |
2892 | blkno = ocfs2_clusters_to_blocks(dir->i_sb, bit_off); | |
2893 | dirdata_bh = sb_getblk(sb, blkno); | |
2894 | if (!dirdata_bh) { | |
7391a294 | 2895 | ret = -ENOMEM; |
5b6a3a2b MF |
2896 | mlog_errno(ret); |
2897 | goto out_commit; | |
2898 | } | |
2899 | ||
8cb471e8 | 2900 | ocfs2_set_new_buffer_uptodate(INODE_CACHE(dir), dirdata_bh); |
5b6a3a2b | 2901 | |
0cf2f763 | 2902 | ret = ocfs2_journal_access_db(handle, INODE_CACHE(dir), dirdata_bh, |
13723d00 | 2903 | OCFS2_JOURNAL_ACCESS_CREATE); |
5b6a3a2b MF |
2904 | if (ret) { |
2905 | mlog_errno(ret); | |
2906 | goto out_commit; | |
2907 | } | |
2908 | ||
2909 | memcpy(dirdata_bh->b_data, di->id2.i_data.id_data, i_size_read(dir)); | |
2910 | memset(dirdata_bh->b_data + i_size_read(dir), 0, | |
2911 | sb->s_blocksize - i_size_read(dir)); | |
e7c17e43 MF |
2912 | i = ocfs2_expand_last_dirent(dirdata_bh->b_data, i_size_read(dir), dir); |
2913 | if (ocfs2_new_dir_wants_trailer(dir)) { | |
2914 | /* | |
2915 | * Prepare the dir trailer up front. It will otherwise look | |
2916 | * like a valid dirent. Even if inserting the index fails | |
2917 | * (unlikely), then all we'll have done is given first dir | |
2918 | * block a small amount of fragmentation. | |
2919 | */ | |
2920 | ocfs2_init_dir_trailer(dir, dirdata_bh, i); | |
2921 | } | |
5b6a3a2b | 2922 | |
2931cdcb | 2923 | ocfs2_update_inode_fsync_trans(handle, dir, 1); |
ec20cec7 | 2924 | ocfs2_journal_dirty(handle, dirdata_bh); |
5b6a3a2b | 2925 | |
4ed8a6bb MF |
2926 | if (ocfs2_supports_indexed_dirs(osb) && !dx_inline) { |
2927 | /* | |
2928 | * Dx dirs with an external cluster need to do this up | |
2929 | * front. Inline dx root's get handled later, after | |
e3a93c2d MF |
2930 | * we've allocated our root block. We get passed back |
2931 | * a total number of items so that dr_num_entries can | |
2932 | * be correctly set once the dx_root has been | |
2933 | * allocated. | |
4ed8a6bb | 2934 | */ |
9b7895ef | 2935 | ret = ocfs2_dx_dir_index_block(dir, handle, dx_leaves, |
e3a93c2d MF |
2936 | num_dx_leaves, &num_dx_entries, |
2937 | dirdata_bh); | |
9b7895ef MF |
2938 | if (ret) { |
2939 | mlog_errno(ret); | |
2940 | goto out_commit; | |
2941 | } | |
2942 | } | |
2943 | ||
5b6a3a2b MF |
2944 | /* |
2945 | * Set extent, i_size, etc on the directory. After this, the | |
2946 | * inode should contain the same exact dirents as before and | |
2947 | * be fully accessible from system calls. | |
2948 | * | |
2949 | * We let the later dirent insert modify c/mtime - to the user | |
2950 | * the data hasn't changed. | |
2951 | */ | |
0cf2f763 | 2952 | ret = ocfs2_journal_access_di(handle, INODE_CACHE(dir), di_bh, |
13723d00 | 2953 | OCFS2_JOURNAL_ACCESS_CREATE); |
5b6a3a2b MF |
2954 | if (ret) { |
2955 | mlog_errno(ret); | |
2956 | goto out_commit; | |
2957 | } | |
2958 | ||
2959 | spin_lock(&oi->ip_lock); | |
2960 | oi->ip_dyn_features &= ~OCFS2_INLINE_DATA_FL; | |
2961 | di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features); | |
2962 | spin_unlock(&oi->ip_lock); | |
2963 | ||
2964 | ocfs2_dinode_new_extent_list(dir, di); | |
2965 | ||
2966 | i_size_write(dir, sb->s_blocksize); | |
078cd827 | 2967 | dir->i_mtime = dir->i_ctime = current_time(dir); |
5b6a3a2b MF |
2968 | |
2969 | di->i_size = cpu_to_le64(sb->s_blocksize); | |
2970 | di->i_ctime = di->i_mtime = cpu_to_le64(dir->i_ctime.tv_sec); | |
2971 | di->i_ctime_nsec = di->i_mtime_nsec = cpu_to_le32(dir->i_ctime.tv_nsec); | |
6fdb702d | 2972 | ocfs2_update_inode_fsync_trans(handle, dir, 1); |
5b6a3a2b MF |
2973 | |
2974 | /* | |
2975 | * This should never fail as our extent list is empty and all | |
2976 | * related blocks have been journaled already. | |
2977 | */ | |
cc79d8c1 | 2978 | ret = ocfs2_insert_extent(handle, &et, 0, blkno, len, |
f99b9b7c | 2979 | 0, NULL); |
5b6a3a2b MF |
2980 | if (ret) { |
2981 | mlog_errno(ret); | |
83cab533 | 2982 | goto out_commit; |
5b6a3a2b MF |
2983 | } |
2984 | ||
9780eb6c MF |
2985 | /* |
2986 | * Set i_blocks after the extent insert for the most up to | |
2987 | * date ip_clusters value. | |
2988 | */ | |
2989 | dir->i_blocks = ocfs2_inode_sector_count(dir); | |
2990 | ||
ec20cec7 | 2991 | ocfs2_journal_dirty(handle, di_bh); |
5b6a3a2b | 2992 | |
9b7895ef MF |
2993 | if (ocfs2_supports_indexed_dirs(osb)) { |
2994 | ret = ocfs2_dx_dir_attach_index(osb, handle, dir, di_bh, | |
e7c17e43 | 2995 | dirdata_bh, meta_ac, dx_inline, |
e3a93c2d | 2996 | num_dx_entries, &dx_root_bh); |
9b7895ef MF |
2997 | if (ret) { |
2998 | mlog_errno(ret); | |
2999 | goto out_commit; | |
3000 | } | |
3001 | ||
4ed8a6bb MF |
3002 | if (dx_inline) { |
3003 | ocfs2_dx_dir_index_root_block(dir, dx_root_bh, | |
3004 | dirdata_bh); | |
3005 | } else { | |
5e404e9e JB |
3006 | ocfs2_init_dx_root_extent_tree(&dx_et, |
3007 | INODE_CACHE(dir), | |
3008 | dx_root_bh); | |
cc79d8c1 | 3009 | ret = ocfs2_insert_extent(handle, &dx_et, 0, |
4ed8a6bb MF |
3010 | dx_insert_blkno, 1, 0, NULL); |
3011 | if (ret) | |
3012 | mlog_errno(ret); | |
3013 | } | |
9b7895ef MF |
3014 | } |
3015 | ||
5b6a3a2b MF |
3016 | /* |
3017 | * We asked for two clusters, but only got one in the 1st | |
3018 | * pass. Claim the 2nd cluster as a separate extent. | |
3019 | */ | |
3020 | if (alloc > len) { | |
1ed9b777 | 3021 | ret = ocfs2_claim_clusters(handle, data_ac, 1, &bit_off, |
5b6a3a2b MF |
3022 | &len); |
3023 | if (ret) { | |
3024 | mlog_errno(ret); | |
3025 | goto out_commit; | |
3026 | } | |
3027 | blkno = ocfs2_clusters_to_blocks(dir->i_sb, bit_off); | |
3028 | ||
cc79d8c1 | 3029 | ret = ocfs2_insert_extent(handle, &et, 1, |
f99b9b7c | 3030 | blkno, len, 0, NULL); |
5b6a3a2b MF |
3031 | if (ret) { |
3032 | mlog_errno(ret); | |
83cab533 | 3033 | goto out_commit; |
5b6a3a2b | 3034 | } |
9b7895ef | 3035 | bytes_allocated += ocfs2_clusters_to_bytes(dir->i_sb, 1); |
5b6a3a2b MF |
3036 | } |
3037 | ||
3038 | *first_block_bh = dirdata_bh; | |
3039 | dirdata_bh = NULL; | |
9b7895ef MF |
3040 | if (ocfs2_supports_indexed_dirs(osb)) { |
3041 | unsigned int off; | |
3042 | ||
4ed8a6bb MF |
3043 | if (!dx_inline) { |
3044 | /* | |
3045 | * We need to return the correct block within the | |
3046 | * cluster which should hold our entry. | |
3047 | */ | |
1119d3c0 | 3048 | off = ocfs2_dx_dir_hash_idx(osb, |
4ed8a6bb MF |
3049 | &lookup->dl_hinfo); |
3050 | get_bh(dx_leaves[off]); | |
3051 | lookup->dl_dx_leaf_bh = dx_leaves[off]; | |
3052 | } | |
3053 | lookup->dl_dx_root_bh = dx_root_bh; | |
3054 | dx_root_bh = NULL; | |
9b7895ef | 3055 | } |
5b6a3a2b MF |
3056 | |
3057 | out_commit: | |
a90714c1 | 3058 | if (ret < 0 && did_quota) |
5dd4056d | 3059 | dquot_free_space_nodirty(dir, bytes_allocated); |
9b7895ef | 3060 | |
5b6a3a2b MF |
3061 | ocfs2_commit_trans(osb, handle); |
3062 | ||
5b6a3a2b | 3063 | out: |
edd45c08 | 3064 | up_write(&oi->ip_alloc_sem); |
5b6a3a2b MF |
3065 | if (data_ac) |
3066 | ocfs2_free_alloc_context(data_ac); | |
9b7895ef MF |
3067 | if (meta_ac) |
3068 | ocfs2_free_alloc_context(meta_ac); | |
3069 | ||
3070 | if (dx_leaves) { | |
3071 | for (i = 0; i < num_dx_leaves; i++) | |
3072 | brelse(dx_leaves[i]); | |
3073 | kfree(dx_leaves); | |
3074 | } | |
5b6a3a2b MF |
3075 | |
3076 | brelse(dirdata_bh); | |
9b7895ef | 3077 | brelse(dx_root_bh); |
5b6a3a2b MF |
3078 | |
3079 | return ret; | |
3080 | } | |
3081 | ||
ccd979bd | 3082 | /* returns a bh of the 1st new block in the allocation. */ |
316f4b9f MF |
3083 | static int ocfs2_do_extend_dir(struct super_block *sb, |
3084 | handle_t *handle, | |
3085 | struct inode *dir, | |
3086 | struct buffer_head *parent_fe_bh, | |
3087 | struct ocfs2_alloc_context *data_ac, | |
3088 | struct ocfs2_alloc_context *meta_ac, | |
3089 | struct buffer_head **new_bh) | |
ccd979bd MF |
3090 | { |
3091 | int status; | |
a90714c1 | 3092 | int extend, did_quota = 0; |
8110b073 | 3093 | u64 p_blkno, v_blkno; |
ccd979bd MF |
3094 | |
3095 | spin_lock(&OCFS2_I(dir)->ip_lock); | |
3096 | extend = (i_size_read(dir) == ocfs2_clusters_to_bytes(sb, OCFS2_I(dir)->ip_clusters)); | |
3097 | spin_unlock(&OCFS2_I(dir)->ip_lock); | |
3098 | ||
3099 | if (extend) { | |
dcd0538f MF |
3100 | u32 offset = OCFS2_I(dir)->ip_clusters; |
3101 | ||
5dd4056d CH |
3102 | status = dquot_alloc_space_nodirty(dir, |
3103 | ocfs2_clusters_to_bytes(sb, 1)); | |
3104 | if (status) | |
a90714c1 | 3105 | goto bail; |
a90714c1 JK |
3106 | did_quota = 1; |
3107 | ||
0eb8d47e TM |
3108 | status = ocfs2_add_inode_data(OCFS2_SB(sb), dir, &offset, |
3109 | 1, 0, parent_fe_bh, handle, | |
3110 | data_ac, meta_ac, NULL); | |
ccd979bd MF |
3111 | BUG_ON(status == -EAGAIN); |
3112 | if (status < 0) { | |
3113 | mlog_errno(status); | |
3114 | goto bail; | |
3115 | } | |
3116 | } | |
3117 | ||
8110b073 MF |
3118 | v_blkno = ocfs2_blocks_for_bytes(sb, i_size_read(dir)); |
3119 | status = ocfs2_extent_map_get_blocks(dir, v_blkno, &p_blkno, NULL, NULL); | |
ccd979bd MF |
3120 | if (status < 0) { |
3121 | mlog_errno(status); | |
3122 | goto bail; | |
3123 | } | |
3124 | ||
3125 | *new_bh = sb_getblk(sb, p_blkno); | |
3126 | if (!*new_bh) { | |
7391a294 | 3127 | status = -ENOMEM; |
ccd979bd MF |
3128 | mlog_errno(status); |
3129 | goto bail; | |
3130 | } | |
3131 | status = 0; | |
3132 | bail: | |
a90714c1 | 3133 | if (did_quota && status < 0) |
5dd4056d | 3134 | dquot_free_space_nodirty(dir, ocfs2_clusters_to_bytes(sb, 1)); |
ccd979bd MF |
3135 | return status; |
3136 | } | |
3137 | ||
5b6a3a2b MF |
3138 | /* |
3139 | * Assumes you already have a cluster lock on the directory. | |
3140 | * | |
3141 | * 'blocks_wanted' is only used if we have an inline directory which | |
3142 | * is to be turned into an extent based one. The size of the dirent to | |
3143 | * insert might be larger than the space gained by growing to just one | |
3144 | * block, so we may have to grow the inode by two blocks in that case. | |
e7c17e43 MF |
3145 | * |
3146 | * If the directory is already indexed, dx_root_bh must be provided. | |
5b6a3a2b | 3147 | */ |
ccd979bd MF |
3148 | static int ocfs2_extend_dir(struct ocfs2_super *osb, |
3149 | struct inode *dir, | |
3150 | struct buffer_head *parent_fe_bh, | |
5b6a3a2b | 3151 | unsigned int blocks_wanted, |
9b7895ef | 3152 | struct ocfs2_dir_lookup_result *lookup, |
ccd979bd MF |
3153 | struct buffer_head **new_de_bh) |
3154 | { | |
3155 | int status = 0; | |
ee19a779 | 3156 | int credits, num_free_extents, drop_alloc_sem = 0; |
ccd979bd MF |
3157 | loff_t dir_i_size; |
3158 | struct ocfs2_dinode *fe = (struct ocfs2_dinode *) parent_fe_bh->b_data; | |
811f933d | 3159 | struct ocfs2_extent_list *el = &fe->id2.i_list; |
ccd979bd MF |
3160 | struct ocfs2_alloc_context *data_ac = NULL; |
3161 | struct ocfs2_alloc_context *meta_ac = NULL; | |
1fabe148 | 3162 | handle_t *handle = NULL; |
ccd979bd MF |
3163 | struct buffer_head *new_bh = NULL; |
3164 | struct ocfs2_dir_entry * de; | |
3165 | struct super_block *sb = osb->sb; | |
f99b9b7c | 3166 | struct ocfs2_extent_tree et; |
e7c17e43 | 3167 | struct buffer_head *dx_root_bh = lookup->dl_dx_root_bh; |
ccd979bd | 3168 | |
5b6a3a2b | 3169 | if (OCFS2_I(dir)->ip_dyn_features & OCFS2_INLINE_DATA_FL) { |
e7c17e43 MF |
3170 | /* |
3171 | * This would be a code error as an inline directory should | |
3172 | * never have an index root. | |
3173 | */ | |
3174 | BUG_ON(dx_root_bh); | |
3175 | ||
5b6a3a2b | 3176 | status = ocfs2_expand_inline_dir(dir, parent_fe_bh, |
9b7895ef MF |
3177 | blocks_wanted, lookup, |
3178 | &new_bh); | |
5b6a3a2b MF |
3179 | if (status) { |
3180 | mlog_errno(status); | |
3181 | goto bail; | |
3182 | } | |
3183 | ||
e7c17e43 MF |
3184 | /* Expansion from inline to an indexed directory will |
3185 | * have given us this. */ | |
3186 | dx_root_bh = lookup->dl_dx_root_bh; | |
3187 | ||
5b6a3a2b MF |
3188 | if (blocks_wanted == 1) { |
3189 | /* | |
3190 | * If the new dirent will fit inside the space | |
3191 | * created by pushing out to one block, then | |
3192 | * we can complete the operation | |
3193 | * here. Otherwise we have to expand i_size | |
3194 | * and format the 2nd block below. | |
3195 | */ | |
3196 | BUG_ON(new_bh == NULL); | |
3197 | goto bail_bh; | |
3198 | } | |
3199 | ||
3200 | /* | |
3201 | * Get rid of 'new_bh' - we want to format the 2nd | |
3202 | * data block and return that instead. | |
3203 | */ | |
3204 | brelse(new_bh); | |
3205 | new_bh = NULL; | |
3206 | ||
edd45c08 JK |
3207 | down_write(&OCFS2_I(dir)->ip_alloc_sem); |
3208 | drop_alloc_sem = 1; | |
5b6a3a2b MF |
3209 | dir_i_size = i_size_read(dir); |
3210 | credits = OCFS2_SIMPLE_DIR_EXTEND_CREDITS; | |
3211 | goto do_extend; | |
3212 | } | |
3213 | ||
edd45c08 JK |
3214 | down_write(&OCFS2_I(dir)->ip_alloc_sem); |
3215 | drop_alloc_sem = 1; | |
ccd979bd | 3216 | dir_i_size = i_size_read(dir); |
f1088d47 TM |
3217 | trace_ocfs2_extend_dir((unsigned long long)OCFS2_I(dir)->ip_blkno, |
3218 | dir_i_size); | |
ccd979bd | 3219 | |
ccd979bd MF |
3220 | /* dir->i_size is always block aligned. */ |
3221 | spin_lock(&OCFS2_I(dir)->ip_lock); | |
3222 | if (dir_i_size == ocfs2_clusters_to_bytes(sb, OCFS2_I(dir)->ip_clusters)) { | |
3223 | spin_unlock(&OCFS2_I(dir)->ip_lock); | |
5e404e9e JB |
3224 | ocfs2_init_dinode_extent_tree(&et, INODE_CACHE(dir), |
3225 | parent_fe_bh); | |
964f14a0 | 3226 | num_free_extents = ocfs2_num_free_extents(&et); |
ccd979bd MF |
3227 | if (num_free_extents < 0) { |
3228 | status = num_free_extents; | |
3229 | mlog_errno(status); | |
3230 | goto bail; | |
3231 | } | |
3232 | ||
3233 | if (!num_free_extents) { | |
811f933d | 3234 | status = ocfs2_reserve_new_metadata(osb, el, &meta_ac); |
ccd979bd MF |
3235 | if (status < 0) { |
3236 | if (status != -ENOSPC) | |
3237 | mlog_errno(status); | |
3238 | goto bail; | |
3239 | } | |
3240 | } | |
3241 | ||
da5cbf2f | 3242 | status = ocfs2_reserve_clusters(osb, 1, &data_ac); |
ccd979bd MF |
3243 | if (status < 0) { |
3244 | if (status != -ENOSPC) | |
3245 | mlog_errno(status); | |
3246 | goto bail; | |
3247 | } | |
3248 | ||
83f92318 MF |
3249 | if (ocfs2_dir_resv_allowed(osb)) |
3250 | data_ac->ac_resv = &OCFS2_I(dir)->ip_la_data_resv; | |
e3b4a97d | 3251 | |
06f9da6e | 3252 | credits = ocfs2_calc_extend_credits(sb, el); |
ccd979bd MF |
3253 | } else { |
3254 | spin_unlock(&OCFS2_I(dir)->ip_lock); | |
3255 | credits = OCFS2_SIMPLE_DIR_EXTEND_CREDITS; | |
3256 | } | |
3257 | ||
5b6a3a2b | 3258 | do_extend: |
e7c17e43 MF |
3259 | if (ocfs2_dir_indexed(dir)) |
3260 | credits++; /* For attaching the new dirent block to the | |
3261 | * dx_root */ | |
3262 | ||
65eff9cc | 3263 | handle = ocfs2_start_trans(osb, credits); |
ccd979bd MF |
3264 | if (IS_ERR(handle)) { |
3265 | status = PTR_ERR(handle); | |
3266 | handle = NULL; | |
3267 | mlog_errno(status); | |
3268 | goto bail; | |
3269 | } | |
3270 | ||
3271 | status = ocfs2_do_extend_dir(osb->sb, handle, dir, parent_fe_bh, | |
3272 | data_ac, meta_ac, &new_bh); | |
3273 | if (status < 0) { | |
3274 | mlog_errno(status); | |
3275 | goto bail; | |
3276 | } | |
3277 | ||
8cb471e8 | 3278 | ocfs2_set_new_buffer_uptodate(INODE_CACHE(dir), new_bh); |
ccd979bd | 3279 | |
0cf2f763 | 3280 | status = ocfs2_journal_access_db(handle, INODE_CACHE(dir), new_bh, |
13723d00 | 3281 | OCFS2_JOURNAL_ACCESS_CREATE); |
ccd979bd MF |
3282 | if (status < 0) { |
3283 | mlog_errno(status); | |
3284 | goto bail; | |
3285 | } | |
3286 | memset(new_bh->b_data, 0, sb->s_blocksize); | |
87d35a74 | 3287 | |
ccd979bd MF |
3288 | de = (struct ocfs2_dir_entry *) new_bh->b_data; |
3289 | de->inode = 0; | |
e7c17e43 | 3290 | if (ocfs2_supports_dir_trailer(dir)) { |
87d35a74 | 3291 | de->rec_len = cpu_to_le16(ocfs2_dir_trailer_blk_off(sb)); |
e7c17e43 MF |
3292 | |
3293 | ocfs2_init_dir_trailer(dir, new_bh, le16_to_cpu(de->rec_len)); | |
3294 | ||
3295 | if (ocfs2_dir_indexed(dir)) { | |
3296 | status = ocfs2_dx_dir_link_trailer(dir, handle, | |
3297 | dx_root_bh, new_bh); | |
3298 | if (status) { | |
3299 | mlog_errno(status); | |
3300 | goto bail; | |
3301 | } | |
3302 | } | |
87d35a74 MF |
3303 | } else { |
3304 | de->rec_len = cpu_to_le16(sb->s_blocksize); | |
3305 | } | |
2931cdcb | 3306 | ocfs2_update_inode_fsync_trans(handle, dir, 1); |
ec20cec7 | 3307 | ocfs2_journal_dirty(handle, new_bh); |
ccd979bd MF |
3308 | |
3309 | dir_i_size += dir->i_sb->s_blocksize; | |
3310 | i_size_write(dir, dir_i_size); | |
8110b073 | 3311 | dir->i_blocks = ocfs2_inode_sector_count(dir); |
ccd979bd MF |
3312 | status = ocfs2_mark_inode_dirty(handle, dir, parent_fe_bh); |
3313 | if (status < 0) { | |
3314 | mlog_errno(status); | |
3315 | goto bail; | |
3316 | } | |
3317 | ||
5b6a3a2b | 3318 | bail_bh: |
ccd979bd MF |
3319 | *new_de_bh = new_bh; |
3320 | get_bh(*new_de_bh); | |
3321 | bail: | |
3322 | if (handle) | |
02dc1af4 | 3323 | ocfs2_commit_trans(osb, handle); |
edd45c08 JK |
3324 | if (drop_alloc_sem) |
3325 | up_write(&OCFS2_I(dir)->ip_alloc_sem); | |
ccd979bd MF |
3326 | |
3327 | if (data_ac) | |
3328 | ocfs2_free_alloc_context(data_ac); | |
3329 | if (meta_ac) | |
3330 | ocfs2_free_alloc_context(meta_ac); | |
3331 | ||
a81cb88b | 3332 | brelse(new_bh); |
ccd979bd | 3333 | |
ccd979bd MF |
3334 | return status; |
3335 | } | |
3336 | ||
5b6a3a2b MF |
3337 | static int ocfs2_find_dir_space_id(struct inode *dir, struct buffer_head *di_bh, |
3338 | const char *name, int namelen, | |
3339 | struct buffer_head **ret_de_bh, | |
3340 | unsigned int *blocks_wanted) | |
ccd979bd | 3341 | { |
5b6a3a2b | 3342 | int ret; |
87d35a74 | 3343 | struct super_block *sb = dir->i_sb; |
5b6a3a2b MF |
3344 | struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data; |
3345 | struct ocfs2_dir_entry *de, *last_de = NULL; | |
3346 | char *de_buf, *limit; | |
3347 | unsigned long offset = 0; | |
87d35a74 MF |
3348 | unsigned int rec_len, new_rec_len, free_space = dir->i_sb->s_blocksize; |
3349 | ||
3350 | /* | |
3351 | * This calculates how many free bytes we'd have in block zero, should | |
3352 | * this function force expansion to an extent tree. | |
3353 | */ | |
e7c17e43 | 3354 | if (ocfs2_new_dir_wants_trailer(dir)) |
87d35a74 MF |
3355 | free_space = ocfs2_dir_trailer_blk_off(sb) - i_size_read(dir); |
3356 | else | |
3357 | free_space = dir->i_sb->s_blocksize - i_size_read(dir); | |
5b6a3a2b MF |
3358 | |
3359 | de_buf = di->id2.i_data.id_data; | |
3360 | limit = de_buf + i_size_read(dir); | |
3361 | rec_len = OCFS2_DIR_REC_LEN(namelen); | |
ccd979bd | 3362 | |
5b6a3a2b MF |
3363 | while (de_buf < limit) { |
3364 | de = (struct ocfs2_dir_entry *)de_buf; | |
ccd979bd | 3365 | |
5b6a3a2b MF |
3366 | if (!ocfs2_check_dir_entry(dir, de, di_bh, offset)) { |
3367 | ret = -ENOENT; | |
3368 | goto out; | |
3369 | } | |
3370 | if (ocfs2_match(namelen, name, de)) { | |
3371 | ret = -EEXIST; | |
3372 | goto out; | |
3373 | } | |
87d35a74 MF |
3374 | /* |
3375 | * No need to check for a trailing dirent record here as | |
3376 | * they're not used for inline dirs. | |
3377 | */ | |
3378 | ||
5b6a3a2b MF |
3379 | if (ocfs2_dirent_would_fit(de, rec_len)) { |
3380 | /* Ok, we found a spot. Return this bh and let | |
3381 | * the caller actually fill it in. */ | |
3382 | *ret_de_bh = di_bh; | |
3383 | get_bh(*ret_de_bh); | |
3384 | ret = 0; | |
3385 | goto out; | |
3386 | } | |
ccd979bd | 3387 | |
5b6a3a2b MF |
3388 | last_de = de; |
3389 | de_buf += le16_to_cpu(de->rec_len); | |
3390 | offset += le16_to_cpu(de->rec_len); | |
3391 | } | |
ccd979bd | 3392 | |
5b6a3a2b MF |
3393 | /* |
3394 | * We're going to require expansion of the directory - figure | |
3395 | * out how many blocks we'll need so that a place for the | |
3396 | * dirent can be found. | |
3397 | */ | |
3398 | *blocks_wanted = 1; | |
87d35a74 | 3399 | new_rec_len = le16_to_cpu(last_de->rec_len) + free_space; |
5b6a3a2b MF |
3400 | if (new_rec_len < (rec_len + OCFS2_DIR_REC_LEN(last_de->name_len))) |
3401 | *blocks_wanted = 2; | |
ccd979bd | 3402 | |
5b6a3a2b MF |
3403 | ret = -ENOSPC; |
3404 | out: | |
3405 | return ret; | |
3406 | } | |
3407 | ||
3408 | static int ocfs2_find_dir_space_el(struct inode *dir, const char *name, | |
3409 | int namelen, struct buffer_head **ret_de_bh) | |
3410 | { | |
3411 | unsigned long offset; | |
3412 | struct buffer_head *bh = NULL; | |
3413 | unsigned short rec_len; | |
3414 | struct ocfs2_dir_entry *de; | |
3415 | struct super_block *sb = dir->i_sb; | |
3416 | int status; | |
87d35a74 | 3417 | int blocksize = dir->i_sb->s_blocksize; |
ccd979bd | 3418 | |
a22305cc | 3419 | status = ocfs2_read_dir_block(dir, 0, &bh, 0); |
9b572691 | 3420 | if (status) |
ccd979bd | 3421 | goto bail; |
ccd979bd MF |
3422 | |
3423 | rec_len = OCFS2_DIR_REC_LEN(namelen); | |
3424 | offset = 0; | |
3425 | de = (struct ocfs2_dir_entry *) bh->b_data; | |
3426 | while (1) { | |
3427 | if ((char *)de >= sb->s_blocksize + bh->b_data) { | |
3428 | brelse(bh); | |
3429 | bh = NULL; | |
3430 | ||
3431 | if (i_size_read(dir) <= offset) { | |
5b6a3a2b MF |
3432 | /* |
3433 | * Caller will have to expand this | |
3434 | * directory. | |
3435 | */ | |
3436 | status = -ENOSPC; | |
ccd979bd MF |
3437 | goto bail; |
3438 | } | |
a22305cc JB |
3439 | status = ocfs2_read_dir_block(dir, |
3440 | offset >> sb->s_blocksize_bits, | |
3441 | &bh, 0); | |
9b572691 | 3442 | if (status) |
ccd979bd | 3443 | goto bail; |
9b572691 | 3444 | |
ccd979bd MF |
3445 | /* move to next block */ |
3446 | de = (struct ocfs2_dir_entry *) bh->b_data; | |
3447 | } | |
3448 | if (!ocfs2_check_dir_entry(dir, de, bh, offset)) { | |
3449 | status = -ENOENT; | |
3450 | goto bail; | |
3451 | } | |
3452 | if (ocfs2_match(namelen, name, de)) { | |
3453 | status = -EEXIST; | |
3454 | goto bail; | |
3455 | } | |
87d35a74 MF |
3456 | |
3457 | if (ocfs2_skip_dir_trailer(dir, de, offset % blocksize, | |
3458 | blocksize)) | |
3459 | goto next; | |
3460 | ||
8553cf4f | 3461 | if (ocfs2_dirent_would_fit(de, rec_len)) { |
ccd979bd MF |
3462 | /* Ok, we found a spot. Return this bh and let |
3463 | * the caller actually fill it in. */ | |
3464 | *ret_de_bh = bh; | |
3465 | get_bh(*ret_de_bh); | |
3466 | status = 0; | |
3467 | goto bail; | |
3468 | } | |
87d35a74 | 3469 | next: |
ccd979bd MF |
3470 | offset += le16_to_cpu(de->rec_len); |
3471 | de = (struct ocfs2_dir_entry *)((char *) de + le16_to_cpu(de->rec_len)); | |
3472 | } | |
3473 | ||
ccd979bd | 3474 | bail: |
a81cb88b | 3475 | brelse(bh); |
c1e8d35e TM |
3476 | if (status) |
3477 | mlog_errno(status); | |
ccd979bd | 3478 | |
ccd979bd MF |
3479 | return status; |
3480 | } | |
5b6a3a2b | 3481 | |
9b7895ef | 3482 | static int dx_leaf_sort_cmp(const void *a, const void *b) |
5b6a3a2b | 3483 | { |
9b7895ef MF |
3484 | const struct ocfs2_dx_entry *entry1 = a; |
3485 | const struct ocfs2_dx_entry *entry2 = b; | |
3486 | u32 major_hash1 = le32_to_cpu(entry1->dx_major_hash); | |
3487 | u32 major_hash2 = le32_to_cpu(entry2->dx_major_hash); | |
3488 | u32 minor_hash1 = le32_to_cpu(entry1->dx_minor_hash); | |
3489 | u32 minor_hash2 = le32_to_cpu(entry2->dx_minor_hash); | |
3490 | ||
3491 | if (major_hash1 > major_hash2) | |
3492 | return 1; | |
3493 | if (major_hash1 < major_hash2) | |
3494 | return -1; | |
3495 | ||
3496 | /* | |
3497 | * It is not strictly necessary to sort by minor | |
3498 | */ | |
3499 | if (minor_hash1 > minor_hash2) | |
3500 | return 1; | |
3501 | if (minor_hash1 < minor_hash2) | |
3502 | return -1; | |
3503 | return 0; | |
3504 | } | |
3505 | ||
3506 | static void dx_leaf_sort_swap(void *a, void *b, int size) | |
3507 | { | |
3508 | struct ocfs2_dx_entry *entry1 = a; | |
3509 | struct ocfs2_dx_entry *entry2 = b; | |
9b7895ef MF |
3510 | |
3511 | BUG_ON(size != sizeof(*entry1)); | |
3512 | ||
2a28f98c | 3513 | swap(*entry1, *entry2); |
9b7895ef MF |
3514 | } |
3515 | ||
3516 | static int ocfs2_dx_leaf_same_major(struct ocfs2_dx_leaf *dx_leaf) | |
3517 | { | |
3518 | struct ocfs2_dx_entry_list *dl_list = &dx_leaf->dl_list; | |
3519 | int i, num = le16_to_cpu(dl_list->de_num_used); | |
3520 | ||
3521 | for (i = 0; i < (num - 1); i++) { | |
3522 | if (le32_to_cpu(dl_list->de_entries[i].dx_major_hash) != | |
3523 | le32_to_cpu(dl_list->de_entries[i + 1].dx_major_hash)) | |
3524 | return 0; | |
3525 | } | |
3526 | ||
3527 | return 1; | |
3528 | } | |
3529 | ||
3530 | /* | |
3531 | * Find the optimal value to split this leaf on. This expects the leaf | |
3532 | * entries to be in sorted order. | |
3533 | * | |
3534 | * leaf_cpos is the cpos of the leaf we're splitting. insert_hash is | |
3535 | * the hash we want to insert. | |
3536 | * | |
3537 | * This function is only concerned with the major hash - that which | |
3538 | * determines which cluster an item belongs to. | |
3539 | */ | |
3540 | static int ocfs2_dx_dir_find_leaf_split(struct ocfs2_dx_leaf *dx_leaf, | |
3541 | u32 leaf_cpos, u32 insert_hash, | |
3542 | u32 *split_hash) | |
3543 | { | |
3544 | struct ocfs2_dx_entry_list *dl_list = &dx_leaf->dl_list; | |
3545 | int i, num_used = le16_to_cpu(dl_list->de_num_used); | |
3546 | int allsame; | |
3547 | ||
3548 | /* | |
3549 | * There's a couple rare, but nasty corner cases we have to | |
3550 | * check for here. All of them involve a leaf where all value | |
3551 | * have the same hash, which is what we look for first. | |
3552 | * | |
3553 | * Most of the time, all of the above is false, and we simply | |
3554 | * pick the median value for a split. | |
3555 | */ | |
3556 | allsame = ocfs2_dx_leaf_same_major(dx_leaf); | |
3557 | if (allsame) { | |
3558 | u32 val = le32_to_cpu(dl_list->de_entries[0].dx_major_hash); | |
3559 | ||
3560 | if (val == insert_hash) { | |
3561 | /* | |
3562 | * No matter where we would choose to split, | |
3563 | * the new entry would want to occupy the same | |
3564 | * block as these. Since there's no space left | |
3565 | * in their existing block, we know there | |
3566 | * won't be space after the split. | |
3567 | */ | |
3568 | return -ENOSPC; | |
3569 | } | |
3570 | ||
3571 | if (val == leaf_cpos) { | |
3572 | /* | |
3573 | * Because val is the same as leaf_cpos (which | |
3574 | * is the smallest value this leaf can have), | |
3575 | * yet is not equal to insert_hash, then we | |
3576 | * know that insert_hash *must* be larger than | |
3577 | * val (and leaf_cpos). At least cpos+1 in value. | |
3578 | * | |
3579 | * We also know then, that there cannot be an | |
3580 | * adjacent extent (otherwise we'd be looking | |
3581 | * at it). Choosing this value gives us a | |
3582 | * chance to get some contiguousness. | |
3583 | */ | |
3584 | *split_hash = leaf_cpos + 1; | |
3585 | return 0; | |
3586 | } | |
3587 | ||
3588 | if (val > insert_hash) { | |
3589 | /* | |
3590 | * val can not be the same as insert hash, and | |
3591 | * also must be larger than leaf_cpos. Also, | |
3592 | * we know that there can't be a leaf between | |
3593 | * cpos and val, otherwise the entries with | |
3594 | * hash 'val' would be there. | |
3595 | */ | |
3596 | *split_hash = val; | |
3597 | return 0; | |
3598 | } | |
3599 | ||
3600 | *split_hash = insert_hash; | |
3601 | return 0; | |
3602 | } | |
3603 | ||
3604 | /* | |
3605 | * Since the records are sorted and the checks above | |
3606 | * guaranteed that not all records in this block are the same, | |
3607 | * we simple travel forward, from the median, and pick the 1st | |
3608 | * record whose value is larger than leaf_cpos. | |
3609 | */ | |
3610 | for (i = (num_used / 2); i < num_used; i++) | |
3611 | if (le32_to_cpu(dl_list->de_entries[i].dx_major_hash) > | |
3612 | leaf_cpos) | |
3613 | break; | |
3614 | ||
3615 | BUG_ON(i == num_used); /* Should be impossible */ | |
3616 | *split_hash = le32_to_cpu(dl_list->de_entries[i].dx_major_hash); | |
3617 | return 0; | |
3618 | } | |
3619 | ||
3620 | /* | |
3621 | * Transfer all entries in orig_dx_leaves whose major hash is equal to or | |
3622 | * larger than split_hash into new_dx_leaves. We use a temporary | |
3623 | * buffer (tmp_dx_leaf) to make the changes to the original leaf blocks. | |
3624 | * | |
3625 | * Since the block offset inside a leaf (cluster) is a constant mask | |
3626 | * of minor_hash, we can optimize - an item at block offset X within | |
3627 | * the original cluster, will be at offset X within the new cluster. | |
3628 | */ | |
3629 | static void ocfs2_dx_dir_transfer_leaf(struct inode *dir, u32 split_hash, | |
3630 | handle_t *handle, | |
3631 | struct ocfs2_dx_leaf *tmp_dx_leaf, | |
3632 | struct buffer_head **orig_dx_leaves, | |
3633 | struct buffer_head **new_dx_leaves, | |
3634 | int num_dx_leaves) | |
3635 | { | |
3636 | int i, j, num_used; | |
3637 | u32 major_hash; | |
3638 | struct ocfs2_dx_leaf *orig_dx_leaf, *new_dx_leaf; | |
77461ba1 | 3639 | struct ocfs2_dx_entry_list *orig_list, *tmp_list; |
9b7895ef MF |
3640 | struct ocfs2_dx_entry *dx_entry; |
3641 | ||
3642 | tmp_list = &tmp_dx_leaf->dl_list; | |
3643 | ||
3644 | for (i = 0; i < num_dx_leaves; i++) { | |
3645 | orig_dx_leaf = (struct ocfs2_dx_leaf *) orig_dx_leaves[i]->b_data; | |
3646 | orig_list = &orig_dx_leaf->dl_list; | |
3647 | new_dx_leaf = (struct ocfs2_dx_leaf *) new_dx_leaves[i]->b_data; | |
9b7895ef MF |
3648 | |
3649 | num_used = le16_to_cpu(orig_list->de_num_used); | |
3650 | ||
3651 | memcpy(tmp_dx_leaf, orig_dx_leaf, dir->i_sb->s_blocksize); | |
3652 | tmp_list->de_num_used = cpu_to_le16(0); | |
3653 | memset(&tmp_list->de_entries, 0, sizeof(*dx_entry)*num_used); | |
3654 | ||
3655 | for (j = 0; j < num_used; j++) { | |
3656 | dx_entry = &orig_list->de_entries[j]; | |
3657 | major_hash = le32_to_cpu(dx_entry->dx_major_hash); | |
3658 | if (major_hash >= split_hash) | |
3659 | ocfs2_dx_dir_leaf_insert_tail(new_dx_leaf, | |
3660 | dx_entry); | |
3661 | else | |
3662 | ocfs2_dx_dir_leaf_insert_tail(tmp_dx_leaf, | |
3663 | dx_entry); | |
3664 | } | |
3665 | memcpy(orig_dx_leaf, tmp_dx_leaf, dir->i_sb->s_blocksize); | |
3666 | ||
3667 | ocfs2_journal_dirty(handle, orig_dx_leaves[i]); | |
3668 | ocfs2_journal_dirty(handle, new_dx_leaves[i]); | |
3669 | } | |
3670 | } | |
3671 | ||
3672 | static int ocfs2_dx_dir_rebalance_credits(struct ocfs2_super *osb, | |
3673 | struct ocfs2_dx_root_block *dx_root) | |
3674 | { | |
d006c71f | 3675 | int credits = ocfs2_clusters_to_blocks(osb->sb, 3); |
9b7895ef | 3676 | |
06f9da6e | 3677 | credits += ocfs2_calc_extend_credits(osb->sb, &dx_root->dr_list); |
9b7895ef MF |
3678 | credits += ocfs2_quota_trans_credits(osb->sb); |
3679 | return credits; | |
3680 | } | |
3681 | ||
3682 | /* | |
3683 | * Find the median value in dx_leaf_bh and allocate a new leaf to move | |
3684 | * half our entries into. | |
3685 | */ | |
3686 | static int ocfs2_dx_dir_rebalance(struct ocfs2_super *osb, struct inode *dir, | |
3687 | struct buffer_head *dx_root_bh, | |
3688 | struct buffer_head *dx_leaf_bh, | |
3689 | struct ocfs2_dx_hinfo *hinfo, u32 leaf_cpos, | |
3690 | u64 leaf_blkno) | |
3691 | { | |
3692 | struct ocfs2_dx_leaf *dx_leaf = (struct ocfs2_dx_leaf *)dx_leaf_bh->b_data; | |
3693 | int credits, ret, i, num_used, did_quota = 0; | |
3694 | u32 cpos, split_hash, insert_hash = hinfo->major_hash; | |
3695 | u64 orig_leaves_start; | |
3696 | int num_dx_leaves; | |
3697 | struct buffer_head **orig_dx_leaves = NULL; | |
3698 | struct buffer_head **new_dx_leaves = NULL; | |
3699 | struct ocfs2_alloc_context *data_ac = NULL, *meta_ac = NULL; | |
3700 | struct ocfs2_extent_tree et; | |
3701 | handle_t *handle = NULL; | |
3702 | struct ocfs2_dx_root_block *dx_root; | |
3703 | struct ocfs2_dx_leaf *tmp_dx_leaf = NULL; | |
3704 | ||
f1088d47 TM |
3705 | trace_ocfs2_dx_dir_rebalance((unsigned long long)OCFS2_I(dir)->ip_blkno, |
3706 | (unsigned long long)leaf_blkno, | |
3707 | insert_hash); | |
9b7895ef | 3708 | |
5e404e9e | 3709 | ocfs2_init_dx_root_extent_tree(&et, INODE_CACHE(dir), dx_root_bh); |
9b7895ef MF |
3710 | |
3711 | dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data; | |
3712 | /* | |
3713 | * XXX: This is a rather large limit. We should use a more | |
3714 | * realistic value. | |
3715 | */ | |
3716 | if (le32_to_cpu(dx_root->dr_clusters) == UINT_MAX) | |
3717 | return -ENOSPC; | |
3718 | ||
3719 | num_used = le16_to_cpu(dx_leaf->dl_list.de_num_used); | |
3720 | if (num_used < le16_to_cpu(dx_leaf->dl_list.de_count)) { | |
3721 | mlog(ML_ERROR, "DX Dir: %llu, Asked to rebalance empty leaf: " | |
3722 | "%llu, %d\n", (unsigned long long)OCFS2_I(dir)->ip_blkno, | |
3723 | (unsigned long long)leaf_blkno, num_used); | |
3724 | ret = -EIO; | |
3725 | goto out; | |
3726 | } | |
3727 | ||
3728 | orig_dx_leaves = ocfs2_dx_dir_kmalloc_leaves(osb->sb, &num_dx_leaves); | |
3729 | if (!orig_dx_leaves) { | |
3730 | ret = -ENOMEM; | |
3731 | mlog_errno(ret); | |
3732 | goto out; | |
3733 | } | |
3734 | ||
3735 | new_dx_leaves = ocfs2_dx_dir_kmalloc_leaves(osb->sb, NULL); | |
3736 | if (!new_dx_leaves) { | |
3737 | ret = -ENOMEM; | |
3738 | mlog_errno(ret); | |
3739 | goto out; | |
3740 | } | |
3741 | ||
3742 | ret = ocfs2_lock_allocators(dir, &et, 1, 0, &data_ac, &meta_ac); | |
3743 | if (ret) { | |
3744 | if (ret != -ENOSPC) | |
3745 | mlog_errno(ret); | |
3746 | goto out; | |
3747 | } | |
3748 | ||
3749 | credits = ocfs2_dx_dir_rebalance_credits(osb, dx_root); | |
3750 | handle = ocfs2_start_trans(osb, credits); | |
3751 | if (IS_ERR(handle)) { | |
3752 | ret = PTR_ERR(handle); | |
3753 | handle = NULL; | |
3754 | mlog_errno(ret); | |
3755 | goto out; | |
3756 | } | |
3757 | ||
5dd4056d CH |
3758 | ret = dquot_alloc_space_nodirty(dir, |
3759 | ocfs2_clusters_to_bytes(dir->i_sb, 1)); | |
3760 | if (ret) | |
9b7895ef | 3761 | goto out_commit; |
9b7895ef MF |
3762 | did_quota = 1; |
3763 | ||
0cf2f763 | 3764 | ret = ocfs2_journal_access_dl(handle, INODE_CACHE(dir), dx_leaf_bh, |
9b7895ef MF |
3765 | OCFS2_JOURNAL_ACCESS_WRITE); |
3766 | if (ret) { | |
3767 | mlog_errno(ret); | |
3768 | goto out_commit; | |
3769 | } | |
3770 | ||
3771 | /* | |
3772 | * This block is changing anyway, so we can sort it in place. | |
3773 | */ | |
3774 | sort(dx_leaf->dl_list.de_entries, num_used, | |
3775 | sizeof(struct ocfs2_dx_entry), dx_leaf_sort_cmp, | |
3776 | dx_leaf_sort_swap); | |
3777 | ||
ec20cec7 | 3778 | ocfs2_journal_dirty(handle, dx_leaf_bh); |
9b7895ef MF |
3779 | |
3780 | ret = ocfs2_dx_dir_find_leaf_split(dx_leaf, leaf_cpos, insert_hash, | |
3781 | &split_hash); | |
3782 | if (ret) { | |
3783 | mlog_errno(ret); | |
3784 | goto out_commit; | |
3785 | } | |
3786 | ||
f1088d47 | 3787 | trace_ocfs2_dx_dir_rebalance_split(leaf_cpos, split_hash, insert_hash); |
9b7895ef MF |
3788 | |
3789 | /* | |
3790 | * We have to carefully order operations here. There are items | |
3791 | * which want to be in the new cluster before insert, but in | |
3792 | * order to put those items in the new cluster, we alter the | |
3793 | * old cluster. A failure to insert gets nasty. | |
3794 | * | |
3795 | * So, start by reserving writes to the old | |
3796 | * cluster. ocfs2_dx_dir_new_cluster will reserve writes on | |
3797 | * the new cluster for us, before inserting it. The insert | |
3798 | * won't happen if there's an error before that. Once the | |
3799 | * insert is done then, we can transfer from one leaf into the | |
3800 | * other without fear of hitting any error. | |
3801 | */ | |
3802 | ||
3803 | /* | |
3804 | * The leaf transfer wants some scratch space so that we don't | |
3805 | * wind up doing a bunch of expensive memmove(). | |
3806 | */ | |
3807 | tmp_dx_leaf = kmalloc(osb->sb->s_blocksize, GFP_NOFS); | |
3808 | if (!tmp_dx_leaf) { | |
3809 | ret = -ENOMEM; | |
3810 | mlog_errno(ret); | |
3811 | goto out_commit; | |
3812 | } | |
3813 | ||
1d46dc08 | 3814 | orig_leaves_start = ocfs2_block_to_cluster_start(dir->i_sb, leaf_blkno); |
9b7895ef MF |
3815 | ret = ocfs2_read_dx_leaves(dir, orig_leaves_start, num_dx_leaves, |
3816 | orig_dx_leaves); | |
3817 | if (ret) { | |
3818 | mlog_errno(ret); | |
3819 | goto out_commit; | |
3820 | } | |
3821 | ||
0f4da216 TY |
3822 | cpos = split_hash; |
3823 | ret = ocfs2_dx_dir_new_cluster(dir, &et, cpos, handle, | |
3824 | data_ac, meta_ac, new_dx_leaves, | |
3825 | num_dx_leaves); | |
3826 | if (ret) { | |
3827 | mlog_errno(ret); | |
3828 | goto out_commit; | |
3829 | } | |
3830 | ||
9b7895ef | 3831 | for (i = 0; i < num_dx_leaves; i++) { |
0cf2f763 JB |
3832 | ret = ocfs2_journal_access_dl(handle, INODE_CACHE(dir), |
3833 | orig_dx_leaves[i], | |
9b7895ef MF |
3834 | OCFS2_JOURNAL_ACCESS_WRITE); |
3835 | if (ret) { | |
3836 | mlog_errno(ret); | |
3837 | goto out_commit; | |
3838 | } | |
9b7895ef | 3839 | |
0f4da216 TY |
3840 | ret = ocfs2_journal_access_dl(handle, INODE_CACHE(dir), |
3841 | new_dx_leaves[i], | |
3842 | OCFS2_JOURNAL_ACCESS_WRITE); | |
3843 | if (ret) { | |
3844 | mlog_errno(ret); | |
3845 | goto out_commit; | |
3846 | } | |
9b7895ef MF |
3847 | } |
3848 | ||
3849 | ocfs2_dx_dir_transfer_leaf(dir, split_hash, handle, tmp_dx_leaf, | |
3850 | orig_dx_leaves, new_dx_leaves, num_dx_leaves); | |
3851 | ||
3852 | out_commit: | |
3853 | if (ret < 0 && did_quota) | |
5dd4056d | 3854 | dquot_free_space_nodirty(dir, |
9b7895ef MF |
3855 | ocfs2_clusters_to_bytes(dir->i_sb, 1)); |
3856 | ||
2931cdcb | 3857 | ocfs2_update_inode_fsync_trans(handle, dir, 1); |
9b7895ef MF |
3858 | ocfs2_commit_trans(osb, handle); |
3859 | ||
3860 | out: | |
3861 | if (orig_dx_leaves || new_dx_leaves) { | |
3862 | for (i = 0; i < num_dx_leaves; i++) { | |
3863 | if (orig_dx_leaves) | |
3864 | brelse(orig_dx_leaves[i]); | |
3865 | if (new_dx_leaves) | |
3866 | brelse(new_dx_leaves[i]); | |
3867 | } | |
3868 | kfree(orig_dx_leaves); | |
3869 | kfree(new_dx_leaves); | |
3870 | } | |
3871 | ||
3872 | if (meta_ac) | |
3873 | ocfs2_free_alloc_context(meta_ac); | |
3874 | if (data_ac) | |
3875 | ocfs2_free_alloc_context(data_ac); | |
3876 | ||
3877 | kfree(tmp_dx_leaf); | |
3878 | return ret; | |
3879 | } | |
3880 | ||
e7c17e43 MF |
3881 | static int ocfs2_find_dir_space_dx(struct ocfs2_super *osb, struct inode *dir, |
3882 | struct buffer_head *di_bh, | |
3883 | struct buffer_head *dx_root_bh, | |
3884 | const char *name, int namelen, | |
3885 | struct ocfs2_dir_lookup_result *lookup) | |
3886 | { | |
3887 | int ret, rebalanced = 0; | |
3888 | struct ocfs2_dx_root_block *dx_root; | |
3889 | struct buffer_head *dx_leaf_bh = NULL; | |
3890 | struct ocfs2_dx_leaf *dx_leaf; | |
3891 | u64 blkno; | |
3892 | u32 leaf_cpos; | |
3893 | ||
3894 | dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data; | |
3895 | ||
3896 | restart_search: | |
3897 | ret = ocfs2_dx_dir_lookup(dir, &dx_root->dr_list, &lookup->dl_hinfo, | |
3898 | &leaf_cpos, &blkno); | |
3899 | if (ret) { | |
3900 | mlog_errno(ret); | |
3901 | goto out; | |
3902 | } | |
3903 | ||
3904 | ret = ocfs2_read_dx_leaf(dir, blkno, &dx_leaf_bh); | |
3905 | if (ret) { | |
3906 | mlog_errno(ret); | |
3907 | goto out; | |
3908 | } | |
3909 | ||
3910 | dx_leaf = (struct ocfs2_dx_leaf *)dx_leaf_bh->b_data; | |
3911 | ||
3912 | if (le16_to_cpu(dx_leaf->dl_list.de_num_used) >= | |
3913 | le16_to_cpu(dx_leaf->dl_list.de_count)) { | |
3914 | if (rebalanced) { | |
3915 | /* | |
3916 | * Rebalancing should have provided us with | |
3917 | * space in an appropriate leaf. | |
3918 | * | |
3919 | * XXX: Is this an abnormal condition then? | |
3920 | * Should we print a message here? | |
3921 | */ | |
3922 | ret = -ENOSPC; | |
3923 | goto out; | |
3924 | } | |
3925 | ||
3926 | ret = ocfs2_dx_dir_rebalance(osb, dir, dx_root_bh, dx_leaf_bh, | |
3927 | &lookup->dl_hinfo, leaf_cpos, | |
3928 | blkno); | |
3929 | if (ret) { | |
3930 | if (ret != -ENOSPC) | |
3931 | mlog_errno(ret); | |
3932 | goto out; | |
3933 | } | |
3934 | ||
3935 | /* | |
3936 | * Restart the lookup. The rebalance might have | |
3937 | * changed which block our item fits into. Mark our | |
3938 | * progress, so we only execute this once. | |
3939 | */ | |
3940 | brelse(dx_leaf_bh); | |
3941 | dx_leaf_bh = NULL; | |
3942 | rebalanced = 1; | |
3943 | goto restart_search; | |
3944 | } | |
3945 | ||
3946 | lookup->dl_dx_leaf_bh = dx_leaf_bh; | |
3947 | dx_leaf_bh = NULL; | |
3948 | ||
3949 | out: | |
3950 | brelse(dx_leaf_bh); | |
3951 | return ret; | |
3952 | } | |
3953 | ||
3954 | static int ocfs2_search_dx_free_list(struct inode *dir, | |
3955 | struct buffer_head *dx_root_bh, | |
3956 | int namelen, | |
3957 | struct ocfs2_dir_lookup_result *lookup) | |
3958 | { | |
3959 | int ret = -ENOSPC; | |
3960 | struct buffer_head *leaf_bh = NULL, *prev_leaf_bh = NULL; | |
3961 | struct ocfs2_dir_block_trailer *db; | |
3962 | u64 next_block; | |
3963 | int rec_len = OCFS2_DIR_REC_LEN(namelen); | |
3964 | struct ocfs2_dx_root_block *dx_root; | |
3965 | ||
3966 | dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data; | |
3967 | next_block = le64_to_cpu(dx_root->dr_free_blk); | |
3968 | ||
3969 | while (next_block) { | |
3970 | brelse(prev_leaf_bh); | |
3971 | prev_leaf_bh = leaf_bh; | |
3972 | leaf_bh = NULL; | |
3973 | ||
3974 | ret = ocfs2_read_dir_block_direct(dir, next_block, &leaf_bh); | |
3975 | if (ret) { | |
3976 | mlog_errno(ret); | |
3977 | goto out; | |
3978 | } | |
3979 | ||
3980 | db = ocfs2_trailer_from_bh(leaf_bh, dir->i_sb); | |
3981 | if (rec_len <= le16_to_cpu(db->db_free_rec_len)) { | |
3982 | lookup->dl_leaf_bh = leaf_bh; | |
3983 | lookup->dl_prev_leaf_bh = prev_leaf_bh; | |
3984 | leaf_bh = NULL; | |
3985 | prev_leaf_bh = NULL; | |
3986 | break; | |
3987 | } | |
3988 | ||
3989 | next_block = le64_to_cpu(db->db_free_next); | |
3990 | } | |
3991 | ||
3992 | if (!next_block) | |
3993 | ret = -ENOSPC; | |
3994 | ||
3995 | out: | |
3996 | ||
3997 | brelse(leaf_bh); | |
3998 | brelse(prev_leaf_bh); | |
3999 | return ret; | |
4000 | } | |
4001 | ||
4ed8a6bb MF |
4002 | static int ocfs2_expand_inline_dx_root(struct inode *dir, |
4003 | struct buffer_head *dx_root_bh) | |
4004 | { | |
4005 | int ret, num_dx_leaves, i, j, did_quota = 0; | |
4006 | struct buffer_head **dx_leaves = NULL; | |
4007 | struct ocfs2_extent_tree et; | |
4008 | u64 insert_blkno; | |
4009 | struct ocfs2_alloc_context *data_ac = NULL; | |
4010 | struct ocfs2_super *osb = OCFS2_SB(dir->i_sb); | |
4011 | handle_t *handle = NULL; | |
4012 | struct ocfs2_dx_root_block *dx_root; | |
4013 | struct ocfs2_dx_entry_list *entry_list; | |
4014 | struct ocfs2_dx_entry *dx_entry; | |
4015 | struct ocfs2_dx_leaf *target_leaf; | |
4016 | ||
4017 | ret = ocfs2_reserve_clusters(osb, 1, &data_ac); | |
4018 | if (ret) { | |
4019 | mlog_errno(ret); | |
4020 | goto out; | |
4021 | } | |
4022 | ||
4023 | dx_leaves = ocfs2_dx_dir_kmalloc_leaves(osb->sb, &num_dx_leaves); | |
4024 | if (!dx_leaves) { | |
4025 | ret = -ENOMEM; | |
4026 | mlog_errno(ret); | |
4027 | goto out; | |
4028 | } | |
4029 | ||
4030 | handle = ocfs2_start_trans(osb, ocfs2_calc_dxi_expand_credits(osb->sb)); | |
4031 | if (IS_ERR(handle)) { | |
4032 | ret = PTR_ERR(handle); | |
4033 | mlog_errno(ret); | |
4034 | goto out; | |
4035 | } | |
4036 | ||
5dd4056d CH |
4037 | ret = dquot_alloc_space_nodirty(dir, |
4038 | ocfs2_clusters_to_bytes(osb->sb, 1)); | |
4039 | if (ret) | |
4ed8a6bb | 4040 | goto out_commit; |
4ed8a6bb MF |
4041 | did_quota = 1; |
4042 | ||
4043 | /* | |
4044 | * We do this up front, before the allocation, so that a | |
4045 | * failure to add the dx_root_bh to the journal won't result | |
4046 | * us losing clusters. | |
4047 | */ | |
0cf2f763 | 4048 | ret = ocfs2_journal_access_dr(handle, INODE_CACHE(dir), dx_root_bh, |
4ed8a6bb MF |
4049 | OCFS2_JOURNAL_ACCESS_WRITE); |
4050 | if (ret) { | |
4051 | mlog_errno(ret); | |
4052 | goto out_commit; | |
4053 | } | |
4054 | ||
4055 | ret = __ocfs2_dx_dir_new_cluster(dir, 0, handle, data_ac, dx_leaves, | |
4056 | num_dx_leaves, &insert_blkno); | |
4057 | if (ret) { | |
4058 | mlog_errno(ret); | |
4059 | goto out_commit; | |
4060 | } | |
4061 | ||
4062 | /* | |
4063 | * Transfer the entries from our dx_root into the appropriate | |
4064 | * block | |
4065 | */ | |
4066 | dx_root = (struct ocfs2_dx_root_block *) dx_root_bh->b_data; | |
4067 | entry_list = &dx_root->dr_entries; | |
4068 | ||
4069 | for (i = 0; i < le16_to_cpu(entry_list->de_num_used); i++) { | |
4070 | dx_entry = &entry_list->de_entries[i]; | |
4071 | ||
4072 | j = __ocfs2_dx_dir_hash_idx(osb, | |
4073 | le32_to_cpu(dx_entry->dx_minor_hash)); | |
4074 | target_leaf = (struct ocfs2_dx_leaf *)dx_leaves[j]->b_data; | |
4075 | ||
4076 | ocfs2_dx_dir_leaf_insert_tail(target_leaf, dx_entry); | |
4077 | ||
4078 | /* Each leaf has been passed to the journal already | |
4079 | * via __ocfs2_dx_dir_new_cluster() */ | |
4080 | } | |
4081 | ||
4082 | dx_root->dr_flags &= ~OCFS2_DX_FLAG_INLINE; | |
4083 | memset(&dx_root->dr_list, 0, osb->sb->s_blocksize - | |
4084 | offsetof(struct ocfs2_dx_root_block, dr_list)); | |
4085 | dx_root->dr_list.l_count = | |
4086 | cpu_to_le16(ocfs2_extent_recs_per_dx_root(osb->sb)); | |
4087 | ||
4088 | /* This should never fail considering we start with an empty | |
4089 | * dx_root. */ | |
5e404e9e | 4090 | ocfs2_init_dx_root_extent_tree(&et, INODE_CACHE(dir), dx_root_bh); |
cc79d8c1 | 4091 | ret = ocfs2_insert_extent(handle, &et, 0, insert_blkno, 1, 0, NULL); |
4ed8a6bb MF |
4092 | if (ret) |
4093 | mlog_errno(ret); | |
4094 | did_quota = 0; | |
4095 | ||
2931cdcb | 4096 | ocfs2_update_inode_fsync_trans(handle, dir, 1); |
4ed8a6bb MF |
4097 | ocfs2_journal_dirty(handle, dx_root_bh); |
4098 | ||
4099 | out_commit: | |
4100 | if (ret < 0 && did_quota) | |
5dd4056d | 4101 | dquot_free_space_nodirty(dir, |
4ed8a6bb MF |
4102 | ocfs2_clusters_to_bytes(dir->i_sb, 1)); |
4103 | ||
4104 | ocfs2_commit_trans(osb, handle); | |
4105 | ||
4106 | out: | |
4107 | if (data_ac) | |
4108 | ocfs2_free_alloc_context(data_ac); | |
4109 | ||
4110 | if (dx_leaves) { | |
4111 | for (i = 0; i < num_dx_leaves; i++) | |
4112 | brelse(dx_leaves[i]); | |
4113 | kfree(dx_leaves); | |
4114 | } | |
4115 | return ret; | |
4116 | } | |
4117 | ||
4118 | static int ocfs2_inline_dx_has_space(struct buffer_head *dx_root_bh) | |
4119 | { | |
4120 | struct ocfs2_dx_root_block *dx_root; | |
4121 | struct ocfs2_dx_entry_list *entry_list; | |
4122 | ||
4123 | dx_root = (struct ocfs2_dx_root_block *) dx_root_bh->b_data; | |
4124 | entry_list = &dx_root->dr_entries; | |
4125 | ||
4126 | if (le16_to_cpu(entry_list->de_num_used) >= | |
4127 | le16_to_cpu(entry_list->de_count)) | |
4128 | return -ENOSPC; | |
4129 | ||
4130 | return 0; | |
4131 | } | |
4132 | ||
e7c17e43 MF |
4133 | static int ocfs2_prepare_dx_dir_for_insert(struct inode *dir, |
4134 | struct buffer_head *di_bh, | |
4135 | const char *name, | |
4136 | int namelen, | |
4137 | struct ocfs2_dir_lookup_result *lookup) | |
9b7895ef | 4138 | { |
e7c17e43 MF |
4139 | int ret, free_dx_root = 1; |
4140 | struct ocfs2_super *osb = OCFS2_SB(dir->i_sb); | |
9b7895ef | 4141 | struct buffer_head *dx_root_bh = NULL; |
e7c17e43 | 4142 | struct buffer_head *leaf_bh = NULL; |
9b7895ef | 4143 | struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data; |
e7c17e43 | 4144 | struct ocfs2_dx_root_block *dx_root; |
9b7895ef MF |
4145 | |
4146 | ret = ocfs2_read_dx_root(dir, di, &dx_root_bh); | |
4147 | if (ret) { | |
4148 | mlog_errno(ret); | |
4149 | goto out; | |
4150 | } | |
4151 | ||
4152 | dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data; | |
e3a93c2d MF |
4153 | if (le32_to_cpu(dx_root->dr_num_entries) == OCFS2_DX_ENTRIES_MAX) { |
4154 | ret = -ENOSPC; | |
4155 | mlog_errno(ret); | |
4156 | goto out; | |
4157 | } | |
4158 | ||
4ed8a6bb MF |
4159 | if (ocfs2_dx_root_inline(dx_root)) { |
4160 | ret = ocfs2_inline_dx_has_space(dx_root_bh); | |
4161 | ||
4162 | if (ret == 0) | |
4163 | goto search_el; | |
4164 | ||
4165 | /* | |
4166 | * We ran out of room in the root block. Expand it to | |
4167 | * an extent, then allow ocfs2_find_dir_space_dx to do | |
4168 | * the rest. | |
4169 | */ | |
4170 | ret = ocfs2_expand_inline_dx_root(dir, dx_root_bh); | |
4171 | if (ret) { | |
4172 | mlog_errno(ret); | |
4173 | goto out; | |
4174 | } | |
4175 | } | |
9b7895ef | 4176 | |
e7c17e43 MF |
4177 | /* |
4178 | * Insert preparation for an indexed directory is split into two | |
4179 | * steps. The call to find_dir_space_dx reserves room in the index for | |
4180 | * an additional item. If we run out of space there, it's a real error | |
4181 | * we can't continue on. | |
4182 | */ | |
4183 | ret = ocfs2_find_dir_space_dx(osb, dir, di_bh, dx_root_bh, name, | |
4184 | namelen, lookup); | |
9b7895ef MF |
4185 | if (ret) { |
4186 | mlog_errno(ret); | |
4187 | goto out; | |
4188 | } | |
4189 | ||
e7c17e43 MF |
4190 | search_el: |
4191 | /* | |
4192 | * Next, we need to find space in the unindexed tree. This call | |
4193 | * searches using the free space linked list. If the unindexed tree | |
4194 | * lacks sufficient space, we'll expand it below. The expansion code | |
4195 | * is smart enough to add any new blocks to the free space list. | |
4196 | */ | |
4197 | ret = ocfs2_search_dx_free_list(dir, dx_root_bh, namelen, lookup); | |
4198 | if (ret && ret != -ENOSPC) { | |
9b7895ef MF |
4199 | mlog_errno(ret); |
4200 | goto out; | |
4201 | } | |
4202 | ||
e7c17e43 MF |
4203 | /* Do this up here - ocfs2_extend_dir might need the dx_root */ |
4204 | lookup->dl_dx_root_bh = dx_root_bh; | |
4205 | free_dx_root = 0; | |
9b7895ef | 4206 | |
e7c17e43 MF |
4207 | if (ret == -ENOSPC) { |
4208 | ret = ocfs2_extend_dir(osb, dir, di_bh, 1, lookup, &leaf_bh); | |
9b7895ef | 4209 | |
9b7895ef | 4210 | if (ret) { |
e7c17e43 | 4211 | mlog_errno(ret); |
9b7895ef MF |
4212 | goto out; |
4213 | } | |
4214 | ||
4215 | /* | |
e7c17e43 MF |
4216 | * We make the assumption here that new leaf blocks are added |
4217 | * to the front of our free list. | |
9b7895ef | 4218 | */ |
e7c17e43 MF |
4219 | lookup->dl_prev_leaf_bh = NULL; |
4220 | lookup->dl_leaf_bh = leaf_bh; | |
9b7895ef MF |
4221 | } |
4222 | ||
9b7895ef | 4223 | out: |
e7c17e43 MF |
4224 | if (free_dx_root) |
4225 | brelse(dx_root_bh); | |
9b7895ef MF |
4226 | return ret; |
4227 | } | |
4228 | ||
4229 | /* | |
4230 | * Get a directory ready for insert. Any directory allocation required | |
4231 | * happens here. Success returns zero, and enough context in the dir | |
4232 | * lookup result that ocfs2_add_entry() will be able complete the task | |
4233 | * with minimal performance impact. | |
4234 | */ | |
4235 | int ocfs2_prepare_dir_for_insert(struct ocfs2_super *osb, | |
4236 | struct inode *dir, | |
4237 | struct buffer_head *parent_fe_bh, | |
4238 | const char *name, | |
4239 | int namelen, | |
4240 | struct ocfs2_dir_lookup_result *lookup) | |
4241 | { | |
4242 | int ret; | |
5b6a3a2b MF |
4243 | unsigned int blocks_wanted = 1; |
4244 | struct buffer_head *bh = NULL; | |
4245 | ||
f1088d47 TM |
4246 | trace_ocfs2_prepare_dir_for_insert( |
4247 | (unsigned long long)OCFS2_I(dir)->ip_blkno, namelen); | |
5b6a3a2b | 4248 | |
5b6a3a2b MF |
4249 | if (!namelen) { |
4250 | ret = -EINVAL; | |
4251 | mlog_errno(ret); | |
4252 | goto out; | |
4253 | } | |
4254 | ||
9b7895ef MF |
4255 | /* |
4256 | * Do this up front to reduce confusion. | |
4257 | * | |
4258 | * The directory might start inline, then be turned into an | |
4259 | * indexed one, in which case we'd need to hash deep inside | |
4260 | * ocfs2_find_dir_space_id(). Since | |
4261 | * ocfs2_prepare_dx_dir_for_insert() also needs this hash | |
4262 | * done, there seems no point in spreading out the calls. We | |
4263 | * can optimize away the case where the file system doesn't | |
4264 | * support indexing. | |
4265 | */ | |
4266 | if (ocfs2_supports_indexed_dirs(osb)) | |
4267 | ocfs2_dx_dir_name_hash(dir, name, namelen, &lookup->dl_hinfo); | |
4268 | ||
4269 | if (ocfs2_dir_indexed(dir)) { | |
e7c17e43 MF |
4270 | ret = ocfs2_prepare_dx_dir_for_insert(dir, parent_fe_bh, |
4271 | name, namelen, lookup); | |
4272 | if (ret) | |
9b7895ef | 4273 | mlog_errno(ret); |
e7c17e43 | 4274 | goto out; |
9b7895ef MF |
4275 | } |
4276 | ||
5b6a3a2b MF |
4277 | if (OCFS2_I(dir)->ip_dyn_features & OCFS2_INLINE_DATA_FL) { |
4278 | ret = ocfs2_find_dir_space_id(dir, parent_fe_bh, name, | |
4279 | namelen, &bh, &blocks_wanted); | |
4280 | } else | |
4281 | ret = ocfs2_find_dir_space_el(dir, name, namelen, &bh); | |
4282 | ||
4283 | if (ret && ret != -ENOSPC) { | |
4284 | mlog_errno(ret); | |
4285 | goto out; | |
4286 | } | |
4287 | ||
4288 | if (ret == -ENOSPC) { | |
4289 | /* | |
4290 | * We have to expand the directory to add this name. | |
4291 | */ | |
4292 | BUG_ON(bh); | |
4293 | ||
4294 | ret = ocfs2_extend_dir(osb, dir, parent_fe_bh, blocks_wanted, | |
9b7895ef | 4295 | lookup, &bh); |
5b6a3a2b MF |
4296 | if (ret) { |
4297 | if (ret != -ENOSPC) | |
4298 | mlog_errno(ret); | |
4299 | goto out; | |
4300 | } | |
4301 | ||
4302 | BUG_ON(!bh); | |
4303 | } | |
4304 | ||
4a12ca3a | 4305 | lookup->dl_leaf_bh = bh; |
5b6a3a2b MF |
4306 | bh = NULL; |
4307 | out: | |
a81cb88b | 4308 | brelse(bh); |
5b6a3a2b MF |
4309 | return ret; |
4310 | } | |
9b7895ef MF |
4311 | |
4312 | static int ocfs2_dx_dir_remove_index(struct inode *dir, | |
4313 | struct buffer_head *di_bh, | |
4314 | struct buffer_head *dx_root_bh) | |
4315 | { | |
4316 | int ret; | |
4317 | struct ocfs2_super *osb = OCFS2_SB(dir->i_sb); | |
4318 | struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data; | |
4319 | struct ocfs2_dx_root_block *dx_root; | |
4320 | struct inode *dx_alloc_inode = NULL; | |
4321 | struct buffer_head *dx_alloc_bh = NULL; | |
4322 | handle_t *handle; | |
4323 | u64 blk; | |
4324 | u16 bit; | |
4325 | u64 bg_blkno; | |
4326 | ||
4327 | dx_root = (struct ocfs2_dx_root_block *) dx_root_bh->b_data; | |
4328 | ||
4329 | dx_alloc_inode = ocfs2_get_system_file_inode(osb, | |
4330 | EXTENT_ALLOC_SYSTEM_INODE, | |
4331 | le16_to_cpu(dx_root->dr_suballoc_slot)); | |
4332 | if (!dx_alloc_inode) { | |
4333 | ret = -ENOMEM; | |
4334 | mlog_errno(ret); | |
4335 | goto out; | |
4336 | } | |
5955102c | 4337 | inode_lock(dx_alloc_inode); |
9b7895ef MF |
4338 | |
4339 | ret = ocfs2_inode_lock(dx_alloc_inode, &dx_alloc_bh, 1); | |
4340 | if (ret) { | |
4341 | mlog_errno(ret); | |
4342 | goto out_mutex; | |
4343 | } | |
4344 | ||
4345 | handle = ocfs2_start_trans(osb, OCFS2_DX_ROOT_REMOVE_CREDITS); | |
4346 | if (IS_ERR(handle)) { | |
4347 | ret = PTR_ERR(handle); | |
4348 | mlog_errno(ret); | |
4349 | goto out_unlock; | |
4350 | } | |
4351 | ||
0cf2f763 | 4352 | ret = ocfs2_journal_access_di(handle, INODE_CACHE(dir), di_bh, |
9b7895ef MF |
4353 | OCFS2_JOURNAL_ACCESS_WRITE); |
4354 | if (ret) { | |
4355 | mlog_errno(ret); | |
4356 | goto out_commit; | |
4357 | } | |
4358 | ||
8ac33dc8 | 4359 | spin_lock(&OCFS2_I(dir)->ip_lock); |
9b7895ef MF |
4360 | OCFS2_I(dir)->ip_dyn_features &= ~OCFS2_INDEXED_DIR_FL; |
4361 | di->i_dyn_features = cpu_to_le16(OCFS2_I(dir)->ip_dyn_features); | |
8ac33dc8 | 4362 | spin_unlock(&OCFS2_I(dir)->ip_lock); |
9b7895ef | 4363 | di->i_dx_root = cpu_to_le64(0ULL); |
6fdb702d | 4364 | ocfs2_update_inode_fsync_trans(handle, dir, 1); |
9b7895ef MF |
4365 | |
4366 | ocfs2_journal_dirty(handle, di_bh); | |
4367 | ||
4368 | blk = le64_to_cpu(dx_root->dr_blkno); | |
4369 | bit = le16_to_cpu(dx_root->dr_suballoc_bit); | |
74380c47 TM |
4370 | if (dx_root->dr_suballoc_loc) |
4371 | bg_blkno = le64_to_cpu(dx_root->dr_suballoc_loc); | |
4372 | else | |
4373 | bg_blkno = ocfs2_which_suballoc_group(blk, bit); | |
9b7895ef MF |
4374 | ret = ocfs2_free_suballoc_bits(handle, dx_alloc_inode, dx_alloc_bh, |
4375 | bit, bg_blkno, 1); | |
4376 | if (ret) | |
4377 | mlog_errno(ret); | |
4378 | ||
4379 | out_commit: | |
4380 | ocfs2_commit_trans(osb, handle); | |
4381 | ||
4382 | out_unlock: | |
4383 | ocfs2_inode_unlock(dx_alloc_inode, 1); | |
4384 | ||
4385 | out_mutex: | |
5955102c | 4386 | inode_unlock(dx_alloc_inode); |
9b7895ef MF |
4387 | brelse(dx_alloc_bh); |
4388 | out: | |
4389 | iput(dx_alloc_inode); | |
4390 | return ret; | |
4391 | } | |
4392 | ||
4393 | int ocfs2_dx_dir_truncate(struct inode *dir, struct buffer_head *di_bh) | |
4394 | { | |
4395 | int ret; | |
3f649ab7 KC |
4396 | unsigned int clen; |
4397 | u32 major_hash = UINT_MAX, p_cpos, cpos; | |
4398 | u64 blkno; | |
9b7895ef MF |
4399 | struct ocfs2_super *osb = OCFS2_SB(dir->i_sb); |
4400 | struct buffer_head *dx_root_bh = NULL; | |
4401 | struct ocfs2_dx_root_block *dx_root; | |
4402 | struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data; | |
4403 | struct ocfs2_cached_dealloc_ctxt dealloc; | |
4404 | struct ocfs2_extent_tree et; | |
4405 | ||
4406 | ocfs2_init_dealloc_ctxt(&dealloc); | |
4407 | ||
4408 | if (!ocfs2_dir_indexed(dir)) | |
4409 | return 0; | |
4410 | ||
4411 | ret = ocfs2_read_dx_root(dir, di, &dx_root_bh); | |
4412 | if (ret) { | |
4413 | mlog_errno(ret); | |
4414 | goto out; | |
4415 | } | |
4ed8a6bb | 4416 | dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data; |
9b7895ef | 4417 | |
4ed8a6bb MF |
4418 | if (ocfs2_dx_root_inline(dx_root)) |
4419 | goto remove_index; | |
9b7895ef | 4420 | |
5e404e9e | 4421 | ocfs2_init_dx_root_extent_tree(&et, INODE_CACHE(dir), dx_root_bh); |
9b7895ef MF |
4422 | |
4423 | /* XXX: What if dr_clusters is too large? */ | |
4424 | while (le32_to_cpu(dx_root->dr_clusters)) { | |
4425 | ret = ocfs2_dx_dir_lookup_rec(dir, &dx_root->dr_list, | |
4426 | major_hash, &cpos, &blkno, &clen); | |
4427 | if (ret) { | |
4428 | mlog_errno(ret); | |
4429 | goto out; | |
4430 | } | |
4431 | ||
4432 | p_cpos = ocfs2_blocks_to_clusters(dir->i_sb, blkno); | |
4433 | ||
78f94673 | 4434 | ret = ocfs2_remove_btree_range(dir, &et, cpos, p_cpos, clen, 0, |
f62f12b3 | 4435 | &dealloc, 0, false); |
9b7895ef MF |
4436 | if (ret) { |
4437 | mlog_errno(ret); | |
4438 | goto out; | |
4439 | } | |
4440 | ||
4441 | if (cpos == 0) | |
4442 | break; | |
4443 | ||
4444 | major_hash = cpos - 1; | |
4445 | } | |
4446 | ||
4ed8a6bb | 4447 | remove_index: |
9b7895ef MF |
4448 | ret = ocfs2_dx_dir_remove_index(dir, di_bh, dx_root_bh); |
4449 | if (ret) { | |
4450 | mlog_errno(ret); | |
4451 | goto out; | |
4452 | } | |
4453 | ||
8cb471e8 | 4454 | ocfs2_remove_from_cache(INODE_CACHE(dir), dx_root_bh); |
9b7895ef MF |
4455 | out: |
4456 | ocfs2_schedule_truncate_log_flush(osb, 1); | |
4457 | ocfs2_run_deallocs(osb, &dealloc); | |
4458 | ||
4459 | brelse(dx_root_bh); | |
4460 | return ret; | |
4461 | } |