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