blob: ccd4dcfc36457c211762e4dc7348949774c7df5b [file] [log] [blame]
Mark Fashehccd979b2005-12-15 14:31:24 -08001/* -*- 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 *
Jakub Wilk762515a2015-04-14 15:43:41 -070021 * Copyright (C) 1991, 1992 Linus Torvalds
Mark Fashehccd979b2005-12-15 14:31:24 -080022 *
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>
Jan Karaa90714c2008-10-09 19:38:40 +020043#include <linux/quotaops.h>
Mark Fasheh9b7895e2008-11-12 16:27:44 -080044#include <linux/sort.h>
Mark Fashehccd979b2005-12-15 14:31:24 -080045
Mark Fashehccd979b2005-12-15 14:31:24 -080046#include <cluster/masklog.h>
47
48#include "ocfs2.h"
49
50#include "alloc.h"
Joel Beckerc175a512008-12-10 17:58:22 -080051#include "blockcheck.h"
Mark Fashehccd979b2005-12-15 14:31:24 -080052#include "dir.h"
53#include "dlmglue.h"
54#include "extent_map.h"
55#include "file.h"
56#include "inode.h"
57#include "journal.h"
58#include "namei.h"
59#include "suballoc.h"
Mark Fasheh316f4b92007-09-07 18:21:26 -070060#include "super.h"
Mark Fasheh9b7895e2008-11-12 16:27:44 -080061#include "sysfile.h"
Mark Fashehccd979b2005-12-15 14:31:24 -080062#include "uptodate.h"
Tao Maf1088d42011-02-23 22:30:23 +080063#include "ocfs2_trace.h"
Mark Fashehccd979b2005-12-15 14:31:24 -080064
65#include "buffer_head_io.h"
66
Mark Fasheh316f4b92007-09-07 18:21:26 -070067#define NAMEI_RA_CHUNKS 2
68#define NAMEI_RA_BLOCKS 4
69#define NAMEI_RA_SIZE (NAMEI_RA_CHUNKS * NAMEI_RA_BLOCKS)
Mark Fasheh316f4b92007-09-07 18:21:26 -070070
Mark Fashehccd979b2005-12-15 14:31:24 -080071static unsigned char ocfs2_filetype_table[] = {
72 DT_UNKNOWN, DT_REG, DT_DIR, DT_CHR, DT_BLK, DT_FIFO, DT_SOCK, DT_LNK
73};
74
Mark Fasheh316f4b92007-09-07 18:21:26 -070075static int ocfs2_do_extend_dir(struct super_block *sb,
76 handle_t *handle,
77 struct inode *dir,
78 struct buffer_head *parent_fe_bh,
79 struct ocfs2_alloc_context *data_ac,
80 struct ocfs2_alloc_context *meta_ac,
81 struct buffer_head **new_bh);
Mark Fashehe7c17e42009-01-29 18:17:46 -080082static int ocfs2_dir_indexed(struct inode *inode);
Mark Fasheh316f4b92007-09-07 18:21:26 -070083
Mark Fasheh23193e52007-09-12 13:01:18 -070084/*
Mark Fasheh87d35a72008-12-10 17:36:25 -080085 * These are distinct checks because future versions of the file system will
86 * want to have a trailing dirent structure independent of indexing.
87 */
Mark Fashehe7c17e42009-01-29 18:17:46 -080088static int ocfs2_supports_dir_trailer(struct inode *dir)
Mark Fasheh87d35a72008-12-10 17:36:25 -080089{
Mark Fashehe7c17e42009-01-29 18:17:46 -080090 struct ocfs2_super *osb = OCFS2_SB(dir->i_sb);
91
Mark Fasheh87d35a72008-12-10 17:36:25 -080092 if (OCFS2_I(dir)->ip_dyn_features & OCFS2_INLINE_DATA_FL)
93 return 0;
94
Mark Fashehe7c17e42009-01-29 18:17:46 -080095 return ocfs2_meta_ecc(osb) || ocfs2_dir_indexed(dir);
Mark Fasheh87d35a72008-12-10 17:36:25 -080096}
97
Mark Fashehe7c17e42009-01-29 18:17:46 -080098/*
99 * "new' here refers to the point at which we're creating a new
100 * directory via "mkdir()", but also when we're expanding an inline
101 * directory. In either case, we don't yet have the indexing bit set
102 * on the directory, so the standard checks will fail in when metaecc
103 * is turned off. Only directory-initialization type functions should
104 * use this then. Everything else wants ocfs2_supports_dir_trailer()
105 */
106static int ocfs2_new_dir_wants_trailer(struct inode *dir)
Mark Fasheh87d35a72008-12-10 17:36:25 -0800107{
Mark Fashehe7c17e42009-01-29 18:17:46 -0800108 struct ocfs2_super *osb = OCFS2_SB(dir->i_sb);
109
110 return ocfs2_meta_ecc(osb) ||
111 ocfs2_supports_indexed_dirs(osb);
Mark Fasheh87d35a72008-12-10 17:36:25 -0800112}
113
114static inline unsigned int ocfs2_dir_trailer_blk_off(struct super_block *sb)
115{
116 return sb->s_blocksize - sizeof(struct ocfs2_dir_block_trailer);
117}
118
119#define ocfs2_trailer_from_bh(_bh, _sb) ((struct ocfs2_dir_block_trailer *) ((_bh)->b_data + ocfs2_dir_trailer_blk_off((_sb))))
120
Joel Beckerc175a512008-12-10 17:58:22 -0800121/* XXX ocfs2_block_dqtrailer() is similar but not quite - can we make
122 * them more consistent? */
123struct ocfs2_dir_block_trailer *ocfs2_dir_trailer_from_size(int blocksize,
124 void *data)
125{
126 char *p = data;
127
128 p += blocksize - sizeof(struct ocfs2_dir_block_trailer);
129 return (struct ocfs2_dir_block_trailer *)p;
130}
131
Mark Fasheh87d35a72008-12-10 17:36:25 -0800132/*
133 * XXX: This is executed once on every dirent. We should consider optimizing
134 * it.
135 */
136static int ocfs2_skip_dir_trailer(struct inode *dir,
137 struct ocfs2_dir_entry *de,
138 unsigned long offset,
139 unsigned long blklen)
140{
141 unsigned long toff = blklen - sizeof(struct ocfs2_dir_block_trailer);
142
Mark Fashehe7c17e42009-01-29 18:17:46 -0800143 if (!ocfs2_supports_dir_trailer(dir))
Mark Fasheh87d35a72008-12-10 17:36:25 -0800144 return 0;
145
146 if (offset != toff)
147 return 0;
148
149 return 1;
150}
151
152static void ocfs2_init_dir_trailer(struct inode *inode,
Mark Fashehe7c17e42009-01-29 18:17:46 -0800153 struct buffer_head *bh, u16 rec_len)
Mark Fasheh87d35a72008-12-10 17:36:25 -0800154{
155 struct ocfs2_dir_block_trailer *trailer;
156
157 trailer = ocfs2_trailer_from_bh(bh, inode->i_sb);
158 strcpy(trailer->db_signature, OCFS2_DIR_TRAILER_SIGNATURE);
159 trailer->db_compat_rec_len =
160 cpu_to_le16(sizeof(struct ocfs2_dir_block_trailer));
161 trailer->db_parent_dinode = cpu_to_le64(OCFS2_I(inode)->ip_blkno);
162 trailer->db_blkno = cpu_to_le64(bh->b_blocknr);
Mark Fashehe7c17e42009-01-29 18:17:46 -0800163 trailer->db_free_rec_len = cpu_to_le16(rec_len);
164}
165/*
166 * Link an unindexed block with a dir trailer structure into the index free
167 * list. This function will modify dirdata_bh, but assumes you've already
168 * passed it to the journal.
169 */
170static int ocfs2_dx_dir_link_trailer(struct inode *dir, handle_t *handle,
171 struct buffer_head *dx_root_bh,
172 struct buffer_head *dirdata_bh)
173{
174 int ret;
175 struct ocfs2_dx_root_block *dx_root;
176 struct ocfs2_dir_block_trailer *trailer;
177
Joel Becker0cf2f762009-02-12 16:41:25 -0800178 ret = ocfs2_journal_access_dr(handle, INODE_CACHE(dir), dx_root_bh,
Mark Fashehe7c17e42009-01-29 18:17:46 -0800179 OCFS2_JOURNAL_ACCESS_WRITE);
180 if (ret) {
181 mlog_errno(ret);
182 goto out;
183 }
184 trailer = ocfs2_trailer_from_bh(dirdata_bh, dir->i_sb);
185 dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data;
186
187 trailer->db_free_next = dx_root->dr_free_blk;
188 dx_root->dr_free_blk = cpu_to_le64(dirdata_bh->b_blocknr);
189
190 ocfs2_journal_dirty(handle, dx_root_bh);
191
192out:
193 return ret;
194}
195
196static int ocfs2_free_list_at_root(struct ocfs2_dir_lookup_result *res)
197{
198 return res->dl_prev_leaf_bh == NULL;
Mark Fasheh87d35a72008-12-10 17:36:25 -0800199}
200
Mark Fasheh4a12ca32008-11-12 15:43:34 -0800201void ocfs2_free_dir_lookup_result(struct ocfs2_dir_lookup_result *res)
202{
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -0800203 brelse(res->dl_dx_root_bh);
Mark Fasheh4a12ca32008-11-12 15:43:34 -0800204 brelse(res->dl_leaf_bh);
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800205 brelse(res->dl_dx_leaf_bh);
Mark Fashehe7c17e42009-01-29 18:17:46 -0800206 brelse(res->dl_prev_leaf_bh);
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800207}
208
209static int ocfs2_dir_indexed(struct inode *inode)
210{
211 if (OCFS2_I(inode)->ip_dyn_features & OCFS2_INDEXED_DIR_FL)
212 return 1;
213 return 0;
214}
215
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -0800216static inline int ocfs2_dx_root_inline(struct ocfs2_dx_root_block *dx_root)
217{
218 return dx_root->dr_flags & OCFS2_DX_FLAG_INLINE;
219}
220
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800221/*
222 * Hashing code adapted from ext3
223 */
224#define DELTA 0x9E3779B9
225
226static void TEA_transform(__u32 buf[4], __u32 const in[])
227{
228 __u32 sum = 0;
229 __u32 b0 = buf[0], b1 = buf[1];
230 __u32 a = in[0], b = in[1], c = in[2], d = in[3];
231 int n = 16;
232
233 do {
234 sum += DELTA;
235 b0 += ((b1 << 4)+a) ^ (b1+sum) ^ ((b1 >> 5)+b);
236 b1 += ((b0 << 4)+c) ^ (b0+sum) ^ ((b0 >> 5)+d);
237 } while (--n);
238
239 buf[0] += b0;
240 buf[1] += b1;
241}
242
243static void str2hashbuf(const char *msg, int len, __u32 *buf, int num)
244{
245 __u32 pad, val;
246 int i;
247
248 pad = (__u32)len | ((__u32)len << 8);
249 pad |= pad << 16;
250
251 val = pad;
252 if (len > num*4)
253 len = num * 4;
254 for (i = 0; i < len; i++) {
255 if ((i % 4) == 0)
256 val = pad;
257 val = msg[i] + (val << 8);
258 if ((i % 4) == 3) {
259 *buf++ = val;
260 val = pad;
261 num--;
262 }
263 }
264 if (--num >= 0)
265 *buf++ = val;
266 while (--num >= 0)
267 *buf++ = pad;
268}
269
270static void ocfs2_dx_dir_name_hash(struct inode *dir, const char *name, int len,
271 struct ocfs2_dx_hinfo *hinfo)
272{
273 struct ocfs2_super *osb = OCFS2_SB(dir->i_sb);
274 const char *p;
275 __u32 in[8], buf[4];
276
277 /*
278 * XXX: Is this really necessary, if the index is never looked
279 * at by readdir? Is a hash value of '0' a bad idea?
280 */
281 if ((len == 1 && !strncmp(".", name, 1)) ||
282 (len == 2 && !strncmp("..", name, 2))) {
283 buf[0] = buf[1] = 0;
284 goto out;
285 }
286
287#ifdef OCFS2_DEBUG_DX_DIRS
288 /*
289 * This makes it very easy to debug indexing problems. We
290 * should never allow this to be selected without hand editing
291 * this file though.
292 */
293 buf[0] = buf[1] = len;
294 goto out;
295#endif
296
297 memcpy(buf, osb->osb_dx_seed, sizeof(buf));
298
299 p = name;
300 while (len > 0) {
301 str2hashbuf(p, len, in, 4);
302 TEA_transform(buf, in);
303 len -= 16;
304 p += 16;
305 }
306
307out:
308 hinfo->major_hash = buf[0];
309 hinfo->minor_hash = buf[1];
Mark Fasheh4a12ca32008-11-12 15:43:34 -0800310}
311
Mark Fasheh87d35a72008-12-10 17:36:25 -0800312/*
Mark Fasheh23193e52007-09-12 13:01:18 -0700313 * bh passed here can be an inode block or a dir data block, depending
314 * on the inode inline data flag.
315 */
Mark Fasheh5eae5b92007-09-10 17:50:51 -0700316static int ocfs2_check_dir_entry(struct inode * dir,
317 struct ocfs2_dir_entry * de,
318 struct buffer_head * bh,
319 unsigned long offset)
Mark Fasheh316f4b92007-09-07 18:21:26 -0700320{
321 const char *error_msg = NULL;
322 const int rlen = le16_to_cpu(de->rec_len);
323
Tao Ma1dd9ffc2011-01-24 23:23:30 +0800324 if (unlikely(rlen < OCFS2_DIR_REC_LEN(1)))
Mark Fasheh316f4b92007-09-07 18:21:26 -0700325 error_msg = "rec_len is smaller than minimal";
Tao Ma1dd9ffc2011-01-24 23:23:30 +0800326 else if (unlikely(rlen % 4 != 0))
Mark Fasheh316f4b92007-09-07 18:21:26 -0700327 error_msg = "rec_len % 4 != 0";
Tao Ma1dd9ffc2011-01-24 23:23:30 +0800328 else if (unlikely(rlen < OCFS2_DIR_REC_LEN(de->name_len)))
Mark Fasheh316f4b92007-09-07 18:21:26 -0700329 error_msg = "rec_len is too small for name_len";
Tao Ma1dd9ffc2011-01-24 23:23:30 +0800330 else if (unlikely(
331 ((char *) de - bh->b_data) + rlen > dir->i_sb->s_blocksize))
Mark Fasheh316f4b92007-09-07 18:21:26 -0700332 error_msg = "directory entry across blocks";
333
Tao Ma1dd9ffc2011-01-24 23:23:30 +0800334 if (unlikely(error_msg != NULL))
Mark Fasheh316f4b92007-09-07 18:21:26 -0700335 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);
Tao Ma1dd9ffc2011-01-24 23:23:30 +0800340
Mark Fasheh316f4b92007-09-07 18:21:26 -0700341 return error_msg == NULL ? 1 : 0;
342}
343
344static inline int ocfs2_match(int len,
345 const char * const name,
346 struct ocfs2_dir_entry *de)
347{
348 if (len != de->name_len)
349 return 0;
350 if (!de->inode)
351 return 0;
352 return !memcmp(name, de->name, len);
353}
354
355/*
356 * Returns 0 if not found, -1 on failure, and 1 on success
357 */
Jesper Juhl42b16b32011-01-17 00:09:38 +0100358static inline int ocfs2_search_dirblock(struct buffer_head *bh,
Mark Fasheh316f4b92007-09-07 18:21:26 -0700359 struct inode *dir,
360 const char *name, int namelen,
361 unsigned long offset,
Mark Fasheh23193e52007-09-12 13:01:18 -0700362 char *first_de,
363 unsigned int bytes,
Mark Fasheh316f4b92007-09-07 18:21:26 -0700364 struct ocfs2_dir_entry **res_dir)
365{
366 struct ocfs2_dir_entry *de;
367 char *dlimit, *de_buf;
368 int de_len;
369 int ret = 0;
370
Mark Fasheh23193e52007-09-12 13:01:18 -0700371 de_buf = first_de;
372 dlimit = de_buf + bytes;
Mark Fasheh316f4b92007-09-07 18:21:26 -0700373
374 while (de_buf < dlimit) {
375 /* this code is executed quadratically often */
376 /* do minimal checking `by hand' */
377
378 de = (struct ocfs2_dir_entry *) de_buf;
379
380 if (de_buf + namelen <= dlimit &&
381 ocfs2_match(namelen, name, de)) {
382 /* found a match - just to be sure, do a full check */
383 if (!ocfs2_check_dir_entry(dir, de, bh, offset)) {
384 ret = -1;
385 goto bail;
386 }
387 *res_dir = de;
388 ret = 1;
389 goto bail;
390 }
391
392 /* prevent looping on a bad block */
393 de_len = le16_to_cpu(de->rec_len);
394 if (de_len <= 0) {
395 ret = -1;
396 goto bail;
397 }
398
399 de_buf += de_len;
400 offset += de_len;
401 }
402
403bail:
Tao Maf1088d42011-02-23 22:30:23 +0800404 trace_ocfs2_search_dirblock(ret);
Mark Fasheh316f4b92007-09-07 18:21:26 -0700405 return ret;
406}
407
Mark Fasheh23193e52007-09-12 13:01:18 -0700408static struct buffer_head *ocfs2_find_entry_id(const char *name,
409 int namelen,
410 struct inode *dir,
411 struct ocfs2_dir_entry **res_dir)
412{
413 int ret, found;
414 struct buffer_head *di_bh = NULL;
415 struct ocfs2_dinode *di;
416 struct ocfs2_inline_data *data;
417
Joel Beckerb657c952008-11-13 14:49:11 -0800418 ret = ocfs2_read_inode_block(dir, &di_bh);
Mark Fasheh23193e52007-09-12 13:01:18 -0700419 if (ret) {
420 mlog_errno(ret);
421 goto out;
422 }
423
424 di = (struct ocfs2_dinode *)di_bh->b_data;
425 data = &di->id2.i_data;
426
427 found = ocfs2_search_dirblock(di_bh, dir, name, namelen, 0,
428 data->id_data, i_size_read(dir), res_dir);
429 if (found == 1)
430 return di_bh;
431
432 brelse(di_bh);
433out:
434 return NULL;
435}
436
Joel Beckera22305c2008-11-13 14:49:17 -0800437static int ocfs2_validate_dir_block(struct super_block *sb,
438 struct buffer_head *bh)
439{
Joel Beckerc175a512008-12-10 17:58:22 -0800440 int rc;
441 struct ocfs2_dir_block_trailer *trailer =
442 ocfs2_trailer_from_bh(bh, sb);
443
444
Joel Beckera22305c2008-11-13 14:49:17 -0800445 /*
Joel Beckerc175a512008-12-10 17:58:22 -0800446 * We don't validate dirents here, that's handled
Joel Beckera22305c2008-11-13 14:49:17 -0800447 * in-place when the code walks them.
448 */
Tao Maf1088d42011-02-23 22:30:23 +0800449 trace_ocfs2_validate_dir_block((unsigned long long)bh->b_blocknr);
Joel Beckera22305c2008-11-13 14:49:17 -0800450
Joel Beckerc175a512008-12-10 17:58:22 -0800451 BUG_ON(!buffer_uptodate(bh));
452
453 /*
454 * If the ecc fails, we return the error but otherwise
455 * leave the filesystem running. We know any error is
456 * local to this block.
457 *
458 * Note that we are safe to call this even if the directory
459 * doesn't have a trailer. Filesystems without metaecc will do
460 * nothing, and filesystems with it will have one.
461 */
462 rc = ocfs2_validate_meta_ecc(sb, bh->b_data, &trailer->db_check);
463 if (rc)
464 mlog(ML_ERROR, "Checksum failed for dinode %llu\n",
465 (unsigned long long)bh->b_blocknr);
466
467 return rc;
Joel Beckera22305c2008-11-13 14:49:17 -0800468}
469
470/*
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800471 * Validate a directory trailer.
472 *
473 * We check the trailer here rather than in ocfs2_validate_dir_block()
474 * because that function doesn't have the inode to test.
475 */
476static int ocfs2_check_dir_trailer(struct inode *dir, struct buffer_head *bh)
477{
478 int rc = 0;
479 struct ocfs2_dir_block_trailer *trailer;
480
481 trailer = ocfs2_trailer_from_bh(bh, dir->i_sb);
482 if (!OCFS2_IS_VALID_DIR_TRAILER(trailer)) {
483 rc = -EINVAL;
484 ocfs2_error(dir->i_sb,
485 "Invalid dirblock #%llu: "
486 "signature = %.*s\n",
487 (unsigned long long)bh->b_blocknr, 7,
488 trailer->db_signature);
489 goto out;
490 }
491 if (le64_to_cpu(trailer->db_blkno) != bh->b_blocknr) {
492 rc = -EINVAL;
493 ocfs2_error(dir->i_sb,
494 "Directory block #%llu has an invalid "
495 "db_blkno of %llu",
496 (unsigned long long)bh->b_blocknr,
497 (unsigned long long)le64_to_cpu(trailer->db_blkno));
498 goto out;
499 }
500 if (le64_to_cpu(trailer->db_parent_dinode) !=
501 OCFS2_I(dir)->ip_blkno) {
502 rc = -EINVAL;
503 ocfs2_error(dir->i_sb,
504 "Directory block #%llu on dinode "
505 "#%llu has an invalid parent_dinode "
506 "of %llu",
507 (unsigned long long)bh->b_blocknr,
508 (unsigned long long)OCFS2_I(dir)->ip_blkno,
509 (unsigned long long)le64_to_cpu(trailer->db_blkno));
510 goto out;
511 }
512out:
513 return rc;
514}
515
516/*
Joel Beckera22305c2008-11-13 14:49:17 -0800517 * This function forces all errors to -EIO for consistency with its
518 * predecessor, ocfs2_bread(). We haven't audited what returning the
519 * real error codes would do to callers. We log the real codes with
520 * mlog_errno() before we squash them.
521 */
522static int ocfs2_read_dir_block(struct inode *inode, u64 v_block,
523 struct buffer_head **bh, int flags)
524{
525 int rc = 0;
526 struct buffer_head *tmp = *bh;
Joel Beckera22305c2008-11-13 14:49:17 -0800527
Joel Becker511308d2008-11-13 14:49:21 -0800528 rc = ocfs2_read_virt_blocks(inode, v_block, 1, &tmp, flags,
529 ocfs2_validate_dir_block);
Mark Fasheh87d35a72008-12-10 17:36:25 -0800530 if (rc) {
Joel Beckera22305c2008-11-13 14:49:17 -0800531 mlog_errno(rc);
Mark Fasheh87d35a72008-12-10 17:36:25 -0800532 goto out;
533 }
534
Mark Fasheh87d35a72008-12-10 17:36:25 -0800535 if (!(flags & OCFS2_BH_READAHEAD) &&
Mark Fashehe7c17e42009-01-29 18:17:46 -0800536 ocfs2_supports_dir_trailer(inode)) {
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800537 rc = ocfs2_check_dir_trailer(inode, tmp);
538 if (rc) {
539 if (!*bh)
540 brelse(tmp);
541 mlog_errno(rc);
Mark Fasheh87d35a72008-12-10 17:36:25 -0800542 goto out;
543 }
544 }
Joel Beckera22305c2008-11-13 14:49:17 -0800545
Joel Becker511308d2008-11-13 14:49:21 -0800546 /* If ocfs2_read_virt_blocks() got us a new bh, pass it up. */
Mark Fasheh87d35a72008-12-10 17:36:25 -0800547 if (!*bh)
Joel Beckera22305c2008-11-13 14:49:17 -0800548 *bh = tmp;
549
Mark Fasheh87d35a72008-12-10 17:36:25 -0800550out:
Joel Beckera22305c2008-11-13 14:49:17 -0800551 return rc ? -EIO : 0;
552}
553
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800554/*
555 * Read the block at 'phys' which belongs to this directory
556 * inode. This function does no virtual->physical block translation -
557 * what's passed in is assumed to be a valid directory block.
558 */
559static int ocfs2_read_dir_block_direct(struct inode *dir, u64 phys,
560 struct buffer_head **bh)
561{
562 int ret;
563 struct buffer_head *tmp = *bh;
564
Joel Becker8cb471e2009-02-10 20:00:41 -0800565 ret = ocfs2_read_block(INODE_CACHE(dir), phys, &tmp,
566 ocfs2_validate_dir_block);
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800567 if (ret) {
568 mlog_errno(ret);
569 goto out;
570 }
571
572 if (ocfs2_supports_dir_trailer(dir)) {
573 ret = ocfs2_check_dir_trailer(dir, tmp);
574 if (ret) {
575 if (!*bh)
576 brelse(tmp);
577 mlog_errno(ret);
578 goto out;
579 }
580 }
581
582 if (!ret && !*bh)
583 *bh = tmp;
584out:
585 return ret;
586}
587
588static int ocfs2_validate_dx_root(struct super_block *sb,
589 struct buffer_head *bh)
590{
591 int ret;
592 struct ocfs2_dx_root_block *dx_root;
593
594 BUG_ON(!buffer_uptodate(bh));
595
596 dx_root = (struct ocfs2_dx_root_block *) bh->b_data;
597
598 ret = ocfs2_validate_meta_ecc(sb, bh->b_data, &dx_root->dr_check);
599 if (ret) {
600 mlog(ML_ERROR,
601 "Checksum failed for dir index root block %llu\n",
602 (unsigned long long)bh->b_blocknr);
603 return ret;
604 }
605
606 if (!OCFS2_IS_VALID_DX_ROOT(dx_root)) {
607 ocfs2_error(sb,
608 "Dir Index Root # %llu has bad signature %.*s",
609 (unsigned long long)le64_to_cpu(dx_root->dr_blkno),
610 7, dx_root->dr_signature);
611 return -EINVAL;
612 }
613
614 return 0;
615}
616
617static int ocfs2_read_dx_root(struct inode *dir, struct ocfs2_dinode *di,
618 struct buffer_head **dx_root_bh)
619{
620 int ret;
621 u64 blkno = le64_to_cpu(di->i_dx_root);
622 struct buffer_head *tmp = *dx_root_bh;
623
Joel Becker8cb471e2009-02-10 20:00:41 -0800624 ret = ocfs2_read_block(INODE_CACHE(dir), blkno, &tmp,
625 ocfs2_validate_dx_root);
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800626
627 /* If ocfs2_read_block() got us a new bh, pass it up. */
628 if (!ret && !*dx_root_bh)
629 *dx_root_bh = tmp;
630
631 return ret;
632}
633
634static int ocfs2_validate_dx_leaf(struct super_block *sb,
635 struct buffer_head *bh)
636{
637 int ret;
638 struct ocfs2_dx_leaf *dx_leaf = (struct ocfs2_dx_leaf *)bh->b_data;
639
640 BUG_ON(!buffer_uptodate(bh));
641
642 ret = ocfs2_validate_meta_ecc(sb, bh->b_data, &dx_leaf->dl_check);
643 if (ret) {
644 mlog(ML_ERROR,
645 "Checksum failed for dir index leaf block %llu\n",
646 (unsigned long long)bh->b_blocknr);
647 return ret;
648 }
649
650 if (!OCFS2_IS_VALID_DX_LEAF(dx_leaf)) {
651 ocfs2_error(sb, "Dir Index Leaf has bad signature %.*s",
652 7, dx_leaf->dl_signature);
653 return -EROFS;
654 }
655
656 return 0;
657}
658
659static int ocfs2_read_dx_leaf(struct inode *dir, u64 blkno,
660 struct buffer_head **dx_leaf_bh)
661{
662 int ret;
663 struct buffer_head *tmp = *dx_leaf_bh;
664
Joel Becker8cb471e2009-02-10 20:00:41 -0800665 ret = ocfs2_read_block(INODE_CACHE(dir), blkno, &tmp,
666 ocfs2_validate_dx_leaf);
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800667
668 /* If ocfs2_read_block() got us a new bh, pass it up. */
669 if (!ret && !*dx_leaf_bh)
670 *dx_leaf_bh = tmp;
671
672 return ret;
673}
674
675/*
676 * Read a series of dx_leaf blocks. This expects all buffer_head
677 * pointers to be NULL on function entry.
678 */
679static int ocfs2_read_dx_leaves(struct inode *dir, u64 start, int num,
680 struct buffer_head **dx_leaf_bhs)
681{
682 int ret;
683
Joel Becker8cb471e2009-02-10 20:00:41 -0800684 ret = ocfs2_read_blocks(INODE_CACHE(dir), start, num, dx_leaf_bhs, 0,
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800685 ocfs2_validate_dx_leaf);
686 if (ret)
687 mlog_errno(ret);
688
689 return ret;
690}
691
Adrian Bunk0af4bd32007-10-24 18:23:27 +0200692static struct buffer_head *ocfs2_find_entry_el(const char *name, int namelen,
693 struct inode *dir,
694 struct ocfs2_dir_entry **res_dir)
Mark Fasheh316f4b92007-09-07 18:21:26 -0700695{
696 struct super_block *sb;
697 struct buffer_head *bh_use[NAMEI_RA_SIZE];
698 struct buffer_head *bh, *ret = NULL;
699 unsigned long start, block, b;
700 int ra_max = 0; /* Number of bh's in the readahead
701 buffer, bh_use[] */
702 int ra_ptr = 0; /* Current index into readahead
703 buffer */
704 int num = 0;
705 int nblocks, i, err;
706
Mark Fasheh316f4b92007-09-07 18:21:26 -0700707 sb = dir->i_sb;
708
709 nblocks = i_size_read(dir) >> sb->s_blocksize_bits;
710 start = OCFS2_I(dir)->ip_dir_start_lookup;
711 if (start >= nblocks)
712 start = 0;
713 block = start;
714
715restart:
716 do {
717 /*
718 * We deal with the read-ahead logic here.
719 */
720 if (ra_ptr >= ra_max) {
721 /* Refill the readahead buffer */
722 ra_ptr = 0;
723 b = block;
724 for (ra_max = 0; ra_max < NAMEI_RA_SIZE; ra_max++) {
725 /*
726 * Terminate if we reach the end of the
727 * directory and must wrap, or if our
728 * search has finished at this block.
729 */
730 if (b >= nblocks || (num && block == start)) {
731 bh_use[ra_max] = NULL;
732 break;
733 }
734 num++;
735
Joel Beckera22305c2008-11-13 14:49:17 -0800736 bh = NULL;
737 err = ocfs2_read_dir_block(dir, b++, &bh,
738 OCFS2_BH_READAHEAD);
Mark Fasheh316f4b92007-09-07 18:21:26 -0700739 bh_use[ra_max] = bh;
740 }
741 }
742 if ((bh = bh_use[ra_ptr++]) == NULL)
743 goto next;
Joel Beckera22305c2008-11-13 14:49:17 -0800744 if (ocfs2_read_dir_block(dir, block, &bh, 0)) {
Joel Becker5e0b3de2008-10-09 17:20:33 -0700745 /* read error, skip block & hope for the best.
Joel Beckera22305c2008-11-13 14:49:17 -0800746 * ocfs2_read_dir_block() has released the bh. */
jiangyiwen61fb9ea2014-12-10 15:42:02 -0800747 mlog(ML_ERROR, "reading directory %llu, "
Mark Fasheh316f4b92007-09-07 18:21:26 -0700748 "offset %lu\n",
749 (unsigned long long)OCFS2_I(dir)->ip_blkno,
750 block);
Mark Fasheh316f4b92007-09-07 18:21:26 -0700751 goto next;
752 }
753 i = ocfs2_search_dirblock(bh, dir, name, namelen,
754 block << sb->s_blocksize_bits,
Mark Fasheh23193e52007-09-12 13:01:18 -0700755 bh->b_data, sb->s_blocksize,
Mark Fasheh316f4b92007-09-07 18:21:26 -0700756 res_dir);
757 if (i == 1) {
758 OCFS2_I(dir)->ip_dir_start_lookup = block;
759 ret = bh;
760 goto cleanup_and_exit;
761 } else {
762 brelse(bh);
763 if (i < 0)
764 goto cleanup_and_exit;
765 }
766 next:
767 if (++block >= nblocks)
768 block = 0;
769 } while (block != start);
770
771 /*
772 * If the directory has grown while we were searching, then
773 * search the last part of the directory before giving up.
774 */
775 block = nblocks;
776 nblocks = i_size_read(dir) >> sb->s_blocksize_bits;
777 if (block < nblocks) {
778 start = 0;
779 goto restart;
780 }
781
782cleanup_and_exit:
783 /* Clean up the read-ahead blocks */
784 for (; ra_ptr < ra_max; ra_ptr++)
785 brelse(bh_use[ra_ptr]);
786
Tao Maf1088d42011-02-23 22:30:23 +0800787 trace_ocfs2_find_entry_el(ret);
Mark Fasheh316f4b92007-09-07 18:21:26 -0700788 return ret;
789}
790
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800791static int ocfs2_dx_dir_lookup_rec(struct inode *inode,
792 struct ocfs2_extent_list *el,
793 u32 major_hash,
794 u32 *ret_cpos,
795 u64 *ret_phys_blkno,
796 unsigned int *ret_clen)
797{
798 int ret = 0, i, found;
799 struct buffer_head *eb_bh = NULL;
800 struct ocfs2_extent_block *eb;
801 struct ocfs2_extent_rec *rec = NULL;
802
803 if (el->l_tree_depth) {
Joel Beckerfacdb772009-02-12 18:08:48 -0800804 ret = ocfs2_find_leaf(INODE_CACHE(inode), el, major_hash,
805 &eb_bh);
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800806 if (ret) {
807 mlog_errno(ret);
808 goto out;
809 }
810
811 eb = (struct ocfs2_extent_block *) eb_bh->b_data;
812 el = &eb->h_list;
813
814 if (el->l_tree_depth) {
815 ocfs2_error(inode->i_sb,
816 "Inode %lu has non zero tree depth in "
817 "btree tree block %llu\n", inode->i_ino,
818 (unsigned long long)eb_bh->b_blocknr);
819 ret = -EROFS;
820 goto out;
821 }
822 }
823
824 found = 0;
825 for (i = le16_to_cpu(el->l_next_free_rec) - 1; i >= 0; i--) {
826 rec = &el->l_recs[i];
827
828 if (le32_to_cpu(rec->e_cpos) <= major_hash) {
829 found = 1;
830 break;
831 }
832 }
833
834 if (!found) {
835 ocfs2_error(inode->i_sb, "Inode %lu has bad extent "
836 "record (%u, %u, 0) in btree", inode->i_ino,
837 le32_to_cpu(rec->e_cpos),
838 ocfs2_rec_clusters(el, rec));
839 ret = -EROFS;
840 goto out;
841 }
842
843 if (ret_phys_blkno)
844 *ret_phys_blkno = le64_to_cpu(rec->e_blkno);
845 if (ret_cpos)
846 *ret_cpos = le32_to_cpu(rec->e_cpos);
847 if (ret_clen)
848 *ret_clen = le16_to_cpu(rec->e_leaf_clusters);
849
850out:
851 brelse(eb_bh);
852 return ret;
853}
854
855/*
856 * Returns the block index, from the start of the cluster which this
857 * hash belongs too.
858 */
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -0800859static inline unsigned int __ocfs2_dx_dir_hash_idx(struct ocfs2_super *osb,
860 u32 minor_hash)
861{
862 return minor_hash & osb->osb_dx_mask;
863}
864
865static inline unsigned int ocfs2_dx_dir_hash_idx(struct ocfs2_super *osb,
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800866 struct ocfs2_dx_hinfo *hinfo)
867{
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -0800868 return __ocfs2_dx_dir_hash_idx(osb, hinfo->minor_hash);
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800869}
870
871static int ocfs2_dx_dir_lookup(struct inode *inode,
872 struct ocfs2_extent_list *el,
873 struct ocfs2_dx_hinfo *hinfo,
874 u32 *ret_cpos,
875 u64 *ret_phys_blkno)
876{
877 int ret = 0;
878 unsigned int cend, uninitialized_var(clen);
879 u32 uninitialized_var(cpos);
880 u64 uninitialized_var(blkno);
881 u32 name_hash = hinfo->major_hash;
882
883 ret = ocfs2_dx_dir_lookup_rec(inode, el, name_hash, &cpos, &blkno,
884 &clen);
885 if (ret) {
886 mlog_errno(ret);
887 goto out;
888 }
889
890 cend = cpos + clen;
891 if (name_hash >= cend) {
892 /* We want the last cluster */
893 blkno += ocfs2_clusters_to_blocks(inode->i_sb, clen - 1);
894 cpos += clen - 1;
895 } else {
896 blkno += ocfs2_clusters_to_blocks(inode->i_sb,
897 name_hash - cpos);
898 cpos = name_hash;
899 }
900
901 /*
902 * We now have the cluster which should hold our entry. To
903 * find the exact block from the start of the cluster to
904 * search, we take the lower bits of the hash.
905 */
906 blkno += ocfs2_dx_dir_hash_idx(OCFS2_SB(inode->i_sb), hinfo);
907
908 if (ret_phys_blkno)
909 *ret_phys_blkno = blkno;
910 if (ret_cpos)
911 *ret_cpos = cpos;
912
913out:
914
915 return ret;
916}
917
918static int ocfs2_dx_dir_search(const char *name, int namelen,
919 struct inode *dir,
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -0800920 struct ocfs2_dx_root_block *dx_root,
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800921 struct ocfs2_dir_lookup_result *res)
922{
923 int ret, i, found;
924 u64 uninitialized_var(phys);
925 struct buffer_head *dx_leaf_bh = NULL;
926 struct ocfs2_dx_leaf *dx_leaf;
927 struct ocfs2_dx_entry *dx_entry = NULL;
928 struct buffer_head *dir_ent_bh = NULL;
929 struct ocfs2_dir_entry *dir_ent = NULL;
930 struct ocfs2_dx_hinfo *hinfo = &res->dl_hinfo;
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -0800931 struct ocfs2_extent_list *dr_el;
932 struct ocfs2_dx_entry_list *entry_list;
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800933
934 ocfs2_dx_dir_name_hash(dir, name, namelen, &res->dl_hinfo);
935
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -0800936 if (ocfs2_dx_root_inline(dx_root)) {
937 entry_list = &dx_root->dr_entries;
938 goto search;
939 }
940
941 dr_el = &dx_root->dr_list;
942
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800943 ret = ocfs2_dx_dir_lookup(dir, dr_el, hinfo, NULL, &phys);
944 if (ret) {
945 mlog_errno(ret);
946 goto out;
947 }
948
Tao Maf1088d42011-02-23 22:30:23 +0800949 trace_ocfs2_dx_dir_search((unsigned long long)OCFS2_I(dir)->ip_blkno,
950 namelen, name, hinfo->major_hash,
951 hinfo->minor_hash, (unsigned long long)phys);
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800952
953 ret = ocfs2_read_dx_leaf(dir, phys, &dx_leaf_bh);
954 if (ret) {
955 mlog_errno(ret);
956 goto out;
957 }
958
959 dx_leaf = (struct ocfs2_dx_leaf *) dx_leaf_bh->b_data;
960
Tao Maf1088d42011-02-23 22:30:23 +0800961 trace_ocfs2_dx_dir_search_leaf_info(
962 le16_to_cpu(dx_leaf->dl_list.de_num_used),
963 le16_to_cpu(dx_leaf->dl_list.de_count));
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800964
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -0800965 entry_list = &dx_leaf->dl_list;
966
967search:
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800968 /*
969 * Empty leaf is legal, so no need to check for that.
970 */
971 found = 0;
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -0800972 for (i = 0; i < le16_to_cpu(entry_list->de_num_used); i++) {
973 dx_entry = &entry_list->de_entries[i];
Mark Fasheh9b7895e2008-11-12 16:27:44 -0800974
975 if (hinfo->major_hash != le32_to_cpu(dx_entry->dx_major_hash)
976 || hinfo->minor_hash != le32_to_cpu(dx_entry->dx_minor_hash))
977 continue;
978
979 /*
980 * Search unindexed leaf block now. We're not
981 * guaranteed to find anything.
982 */
983 ret = ocfs2_read_dir_block_direct(dir,
984 le64_to_cpu(dx_entry->dx_dirent_blk),
985 &dir_ent_bh);
986 if (ret) {
987 mlog_errno(ret);
988 goto out;
989 }
990
991 /*
992 * XXX: We should check the unindexed block here,
993 * before using it.
994 */
995
996 found = ocfs2_search_dirblock(dir_ent_bh, dir, name, namelen,
997 0, dir_ent_bh->b_data,
998 dir->i_sb->s_blocksize, &dir_ent);
999 if (found == 1)
1000 break;
1001
1002 if (found == -1) {
1003 /* This means we found a bad directory entry. */
1004 ret = -EIO;
1005 mlog_errno(ret);
1006 goto out;
1007 }
1008
1009 brelse(dir_ent_bh);
1010 dir_ent_bh = NULL;
1011 }
1012
1013 if (found <= 0) {
1014 ret = -ENOENT;
1015 goto out;
1016 }
1017
1018 res->dl_leaf_bh = dir_ent_bh;
1019 res->dl_entry = dir_ent;
1020 res->dl_dx_leaf_bh = dx_leaf_bh;
1021 res->dl_dx_entry = dx_entry;
1022
1023 ret = 0;
1024out:
1025 if (ret) {
1026 brelse(dx_leaf_bh);
1027 brelse(dir_ent_bh);
1028 }
1029 return ret;
1030}
1031
1032static int ocfs2_find_entry_dx(const char *name, int namelen,
1033 struct inode *dir,
1034 struct ocfs2_dir_lookup_result *lookup)
1035{
1036 int ret;
1037 struct buffer_head *di_bh = NULL;
1038 struct ocfs2_dinode *di;
1039 struct buffer_head *dx_root_bh = NULL;
1040 struct ocfs2_dx_root_block *dx_root;
1041
1042 ret = ocfs2_read_inode_block(dir, &di_bh);
1043 if (ret) {
1044 mlog_errno(ret);
1045 goto out;
1046 }
1047
1048 di = (struct ocfs2_dinode *)di_bh->b_data;
1049
1050 ret = ocfs2_read_dx_root(dir, di, &dx_root_bh);
1051 if (ret) {
1052 mlog_errno(ret);
1053 goto out;
1054 }
1055 dx_root = (struct ocfs2_dx_root_block *) dx_root_bh->b_data;
1056
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001057 ret = ocfs2_dx_dir_search(name, namelen, dir, dx_root, lookup);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001058 if (ret) {
1059 if (ret != -ENOENT)
1060 mlog_errno(ret);
1061 goto out;
1062 }
1063
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001064 lookup->dl_dx_root_bh = dx_root_bh;
1065 dx_root_bh = NULL;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001066out:
1067 brelse(di_bh);
1068 brelse(dx_root_bh);
1069 return ret;
1070}
1071
Mark Fasheh23193e52007-09-12 13:01:18 -07001072/*
1073 * Try to find an entry of the provided name within 'dir'.
1074 *
Mark Fasheh4a12ca32008-11-12 15:43:34 -08001075 * If nothing was found, -ENOENT is returned. Otherwise, zero is
1076 * returned and the struct 'res' will contain information useful to
1077 * other directory manipulation functions.
Mark Fasheh23193e52007-09-12 13:01:18 -07001078 *
1079 * Caller can NOT assume anything about the contents of the
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001080 * buffer_heads - they are passed back only so that it can be passed
1081 * into any one of the manipulation functions (add entry, delete
1082 * entry, etc). As an example, bh in the extent directory case is a
1083 * data block, in the inline-data case it actually points to an inode,
1084 * in the indexed directory case, multiple buffers are involved.
Mark Fasheh23193e52007-09-12 13:01:18 -07001085 */
Mark Fasheh4a12ca32008-11-12 15:43:34 -08001086int ocfs2_find_entry(const char *name, int namelen,
1087 struct inode *dir, struct ocfs2_dir_lookup_result *lookup)
Mark Fasheh23193e52007-09-12 13:01:18 -07001088{
Mark Fasheh4a12ca32008-11-12 15:43:34 -08001089 struct buffer_head *bh;
1090 struct ocfs2_dir_entry *res_dir = NULL;
Mark Fasheh23193e52007-09-12 13:01:18 -07001091
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001092 if (ocfs2_dir_indexed(dir))
1093 return ocfs2_find_entry_dx(name, namelen, dir, lookup);
1094
1095 /*
1096 * The unindexed dir code only uses part of the lookup
1097 * structure, so there's no reason to push it down further
1098 * than this.
1099 */
Mark Fasheh23193e52007-09-12 13:01:18 -07001100 if (OCFS2_I(dir)->ip_dyn_features & OCFS2_INLINE_DATA_FL)
Mark Fasheh4a12ca32008-11-12 15:43:34 -08001101 bh = ocfs2_find_entry_id(name, namelen, dir, &res_dir);
1102 else
1103 bh = ocfs2_find_entry_el(name, namelen, dir, &res_dir);
Mark Fasheh23193e52007-09-12 13:01:18 -07001104
Mark Fasheh4a12ca32008-11-12 15:43:34 -08001105 if (bh == NULL)
1106 return -ENOENT;
1107
1108 lookup->dl_leaf_bh = bh;
1109 lookup->dl_entry = res_dir;
1110 return 0;
Mark Fasheh23193e52007-09-12 13:01:18 -07001111}
1112
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07001113/*
1114 * Update inode number and type of a previously found directory entry.
1115 */
Mark Fasheh38760e22007-09-11 17:21:56 -07001116int ocfs2_update_entry(struct inode *dir, handle_t *handle,
Mark Fasheh4a12ca32008-11-12 15:43:34 -08001117 struct ocfs2_dir_lookup_result *res,
Mark Fasheh38760e22007-09-11 17:21:56 -07001118 struct inode *new_entry_inode)
1119{
1120 int ret;
Joel Becker13723d02008-10-17 19:25:01 -07001121 ocfs2_journal_access_func access = ocfs2_journal_access_db;
Mark Fasheh4a12ca32008-11-12 15:43:34 -08001122 struct ocfs2_dir_entry *de = res->dl_entry;
1123 struct buffer_head *de_bh = res->dl_leaf_bh;
Mark Fasheh38760e22007-09-11 17:21:56 -07001124
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07001125 /*
1126 * The same code works fine for both inline-data and extent
Joel Becker13723d02008-10-17 19:25:01 -07001127 * based directories, so no need to split this up. The only
1128 * difference is the journal_access function.
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07001129 */
1130
Joel Becker13723d02008-10-17 19:25:01 -07001131 if (OCFS2_I(dir)->ip_dyn_features & OCFS2_INLINE_DATA_FL)
1132 access = ocfs2_journal_access_di;
1133
Joel Becker0cf2f762009-02-12 16:41:25 -08001134 ret = access(handle, INODE_CACHE(dir), de_bh,
1135 OCFS2_JOURNAL_ACCESS_WRITE);
Mark Fasheh38760e22007-09-11 17:21:56 -07001136 if (ret) {
1137 mlog_errno(ret);
1138 goto out;
1139 }
1140
1141 de->inode = cpu_to_le64(OCFS2_I(new_entry_inode)->ip_blkno);
1142 ocfs2_set_de_type(de, new_entry_inode->i_mode);
1143
1144 ocfs2_journal_dirty(handle, de_bh);
1145
1146out:
1147 return ret;
1148}
1149
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001150/*
1151 * __ocfs2_delete_entry deletes a directory entry by merging it with the
1152 * previous entry
1153 */
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07001154static int __ocfs2_delete_entry(handle_t *handle, struct inode *dir,
1155 struct ocfs2_dir_entry *de_del,
1156 struct buffer_head *bh, char *first_de,
1157 unsigned int bytes)
Mark Fasheh316f4b92007-09-07 18:21:26 -07001158{
1159 struct ocfs2_dir_entry *de, *pde;
1160 int i, status = -ENOENT;
Joel Becker13723d02008-10-17 19:25:01 -07001161 ocfs2_journal_access_func access = ocfs2_journal_access_db;
Mark Fasheh316f4b92007-09-07 18:21:26 -07001162
Joel Becker13723d02008-10-17 19:25:01 -07001163 if (OCFS2_I(dir)->ip_dyn_features & OCFS2_INLINE_DATA_FL)
1164 access = ocfs2_journal_access_di;
1165
Mark Fasheh316f4b92007-09-07 18:21:26 -07001166 i = 0;
1167 pde = NULL;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07001168 de = (struct ocfs2_dir_entry *) first_de;
1169 while (i < bytes) {
Mark Fasheh316f4b92007-09-07 18:21:26 -07001170 if (!ocfs2_check_dir_entry(dir, de, bh, i)) {
1171 status = -EIO;
1172 mlog_errno(status);
1173 goto bail;
1174 }
1175 if (de == de_del) {
Joel Becker0cf2f762009-02-12 16:41:25 -08001176 status = access(handle, INODE_CACHE(dir), bh,
Joel Becker13723d02008-10-17 19:25:01 -07001177 OCFS2_JOURNAL_ACCESS_WRITE);
Mark Fasheh316f4b92007-09-07 18:21:26 -07001178 if (status < 0) {
1179 status = -EIO;
1180 mlog_errno(status);
1181 goto bail;
1182 }
1183 if (pde)
Marcin Slusarz0dd32562008-02-13 00:06:18 +01001184 le16_add_cpu(&pde->rec_len,
1185 le16_to_cpu(de->rec_len));
Wengang Wang82985242011-07-12 16:43:14 +08001186 de->inode = 0;
Mark Fasheh316f4b92007-09-07 18:21:26 -07001187 dir->i_version++;
Joel Beckerec20cec2010-03-19 14:13:52 -07001188 ocfs2_journal_dirty(handle, bh);
Mark Fasheh316f4b92007-09-07 18:21:26 -07001189 goto bail;
1190 }
1191 i += le16_to_cpu(de->rec_len);
1192 pde = de;
1193 de = (struct ocfs2_dir_entry *)((char *)de + le16_to_cpu(de->rec_len));
1194 }
1195bail:
Mark Fasheh316f4b92007-09-07 18:21:26 -07001196 return status;
1197}
1198
Mark Fashehe7c17e42009-01-29 18:17:46 -08001199static unsigned int ocfs2_figure_dirent_hole(struct ocfs2_dir_entry *de)
1200{
1201 unsigned int hole;
1202
1203 if (le64_to_cpu(de->inode) == 0)
1204 hole = le16_to_cpu(de->rec_len);
1205 else
1206 hole = le16_to_cpu(de->rec_len) -
1207 OCFS2_DIR_REC_LEN(de->name_len);
1208
1209 return hole;
1210}
1211
1212static int ocfs2_find_max_rec_len(struct super_block *sb,
1213 struct buffer_head *dirblock_bh)
1214{
1215 int size, this_hole, largest_hole = 0;
1216 char *trailer, *de_buf, *limit, *start = dirblock_bh->b_data;
1217 struct ocfs2_dir_entry *de;
1218
1219 trailer = (char *)ocfs2_trailer_from_bh(dirblock_bh, sb);
1220 size = ocfs2_dir_trailer_blk_off(sb);
1221 limit = start + size;
1222 de_buf = start;
1223 de = (struct ocfs2_dir_entry *)de_buf;
1224 do {
1225 if (de_buf != trailer) {
1226 this_hole = ocfs2_figure_dirent_hole(de);
1227 if (this_hole > largest_hole)
1228 largest_hole = this_hole;
1229 }
1230
1231 de_buf += le16_to_cpu(de->rec_len);
1232 de = (struct ocfs2_dir_entry *)de_buf;
1233 } while (de_buf < limit);
1234
1235 if (largest_hole >= OCFS2_DIR_MIN_REC_LEN)
1236 return largest_hole;
1237 return 0;
1238}
1239
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001240static void ocfs2_dx_list_remove_entry(struct ocfs2_dx_entry_list *entry_list,
1241 int index)
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001242{
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001243 int num_used = le16_to_cpu(entry_list->de_num_used);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001244
1245 if (num_used == 1 || index == (num_used - 1))
1246 goto clear;
1247
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001248 memmove(&entry_list->de_entries[index],
1249 &entry_list->de_entries[index + 1],
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001250 (num_used - index - 1)*sizeof(struct ocfs2_dx_entry));
1251clear:
1252 num_used--;
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001253 memset(&entry_list->de_entries[num_used], 0,
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001254 sizeof(struct ocfs2_dx_entry));
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001255 entry_list->de_num_used = cpu_to_le16(num_used);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001256}
1257
1258static int ocfs2_delete_entry_dx(handle_t *handle, struct inode *dir,
1259 struct ocfs2_dir_lookup_result *lookup)
1260{
Mark Fashehe7c17e42009-01-29 18:17:46 -08001261 int ret, index, max_rec_len, add_to_free_list = 0;
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001262 struct buffer_head *dx_root_bh = lookup->dl_dx_root_bh;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001263 struct buffer_head *leaf_bh = lookup->dl_leaf_bh;
1264 struct ocfs2_dx_leaf *dx_leaf;
1265 struct ocfs2_dx_entry *dx_entry = lookup->dl_dx_entry;
Mark Fashehe7c17e42009-01-29 18:17:46 -08001266 struct ocfs2_dir_block_trailer *trailer;
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001267 struct ocfs2_dx_root_block *dx_root;
1268 struct ocfs2_dx_entry_list *entry_list;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001269
Mark Fashehe7c17e42009-01-29 18:17:46 -08001270 /*
1271 * This function gets a bit messy because we might have to
1272 * modify the root block, regardless of whether the indexed
1273 * entries are stored inline.
1274 */
1275
1276 /*
1277 * *Only* set 'entry_list' here, based on where we're looking
1278 * for the indexed entries. Later, we might still want to
1279 * journal both blocks, based on free list state.
1280 */
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001281 dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data;
1282 if (ocfs2_dx_root_inline(dx_root)) {
1283 entry_list = &dx_root->dr_entries;
1284 } else {
1285 dx_leaf = (struct ocfs2_dx_leaf *) lookup->dl_dx_leaf_bh->b_data;
1286 entry_list = &dx_leaf->dl_list;
1287 }
1288
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001289 /* Neither of these are a disk corruption - that should have
1290 * been caught by lookup, before we got here. */
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001291 BUG_ON(le16_to_cpu(entry_list->de_count) <= 0);
1292 BUG_ON(le16_to_cpu(entry_list->de_num_used) <= 0);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001293
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001294 index = (char *)dx_entry - (char *)entry_list->de_entries;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001295 index /= sizeof(*dx_entry);
1296
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001297 if (index >= le16_to_cpu(entry_list->de_num_used)) {
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001298 mlog(ML_ERROR, "Dir %llu: Bad dx_entry ptr idx %d, (%p, %p)\n",
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001299 (unsigned long long)OCFS2_I(dir)->ip_blkno, index,
1300 entry_list, dx_entry);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001301 return -EIO;
1302 }
1303
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001304 /*
Mark Fashehe7c17e42009-01-29 18:17:46 -08001305 * We know that removal of this dirent will leave enough room
1306 * for a new one, so add this block to the free list if it
1307 * isn't already there.
1308 */
1309 trailer = ocfs2_trailer_from_bh(leaf_bh, dir->i_sb);
1310 if (trailer->db_free_rec_len == 0)
1311 add_to_free_list = 1;
1312
1313 /*
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001314 * Add the block holding our index into the journal before
1315 * removing the unindexed entry. If we get an error return
1316 * from __ocfs2_delete_entry(), then it hasn't removed the
1317 * entry yet. Likewise, successful return means we *must*
1318 * remove the indexed entry.
1319 *
Mark Fashehe3a93c22009-02-17 15:29:35 -08001320 * We're also careful to journal the root tree block here as
1321 * the entry count needs to be updated. Also, we might be
1322 * adding to the start of the free list.
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001323 */
Joel Becker0cf2f762009-02-12 16:41:25 -08001324 ret = ocfs2_journal_access_dr(handle, INODE_CACHE(dir), dx_root_bh,
Mark Fashehe3a93c22009-02-17 15:29:35 -08001325 OCFS2_JOURNAL_ACCESS_WRITE);
1326 if (ret) {
1327 mlog_errno(ret);
1328 goto out;
Mark Fashehe7c17e42009-01-29 18:17:46 -08001329 }
1330
1331 if (!ocfs2_dx_root_inline(dx_root)) {
Joel Becker0cf2f762009-02-12 16:41:25 -08001332 ret = ocfs2_journal_access_dl(handle, INODE_CACHE(dir),
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001333 lookup->dl_dx_leaf_bh,
1334 OCFS2_JOURNAL_ACCESS_WRITE);
1335 if (ret) {
1336 mlog_errno(ret);
1337 goto out;
1338 }
1339 }
1340
Tao Maf1088d42011-02-23 22:30:23 +08001341 trace_ocfs2_delete_entry_dx((unsigned long long)OCFS2_I(dir)->ip_blkno,
1342 index);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001343
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001344 ret = __ocfs2_delete_entry(handle, dir, lookup->dl_entry,
1345 leaf_bh, leaf_bh->b_data, leaf_bh->b_size);
1346 if (ret) {
1347 mlog_errno(ret);
1348 goto out;
1349 }
1350
Mark Fashehe7c17e42009-01-29 18:17:46 -08001351 max_rec_len = ocfs2_find_max_rec_len(dir->i_sb, leaf_bh);
1352 trailer->db_free_rec_len = cpu_to_le16(max_rec_len);
1353 if (add_to_free_list) {
1354 trailer->db_free_next = dx_root->dr_free_blk;
1355 dx_root->dr_free_blk = cpu_to_le64(leaf_bh->b_blocknr);
1356 ocfs2_journal_dirty(handle, dx_root_bh);
1357 }
1358
1359 /* leaf_bh was journal_accessed for us in __ocfs2_delete_entry */
1360 ocfs2_journal_dirty(handle, leaf_bh);
1361
Mark Fashehe3a93c22009-02-17 15:29:35 -08001362 le32_add_cpu(&dx_root->dr_num_entries, -1);
1363 ocfs2_journal_dirty(handle, dx_root_bh);
1364
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001365 ocfs2_dx_list_remove_entry(entry_list, index);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001366
Mark Fashehe3a93c22009-02-17 15:29:35 -08001367 if (!ocfs2_dx_root_inline(dx_root))
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001368 ocfs2_journal_dirty(handle, lookup->dl_dx_leaf_bh);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001369
1370out:
1371 return ret;
1372}
1373
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07001374static inline int ocfs2_delete_entry_id(handle_t *handle,
1375 struct inode *dir,
1376 struct ocfs2_dir_entry *de_del,
1377 struct buffer_head *bh)
1378{
1379 int ret;
1380 struct buffer_head *di_bh = NULL;
1381 struct ocfs2_dinode *di;
1382 struct ocfs2_inline_data *data;
1383
Joel Beckerb657c952008-11-13 14:49:11 -08001384 ret = ocfs2_read_inode_block(dir, &di_bh);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07001385 if (ret) {
1386 mlog_errno(ret);
1387 goto out;
1388 }
1389
1390 di = (struct ocfs2_dinode *)di_bh->b_data;
1391 data = &di->id2.i_data;
1392
1393 ret = __ocfs2_delete_entry(handle, dir, de_del, bh, data->id_data,
1394 i_size_read(dir));
1395
1396 brelse(di_bh);
1397out:
1398 return ret;
1399}
1400
1401static inline int ocfs2_delete_entry_el(handle_t *handle,
1402 struct inode *dir,
1403 struct ocfs2_dir_entry *de_del,
1404 struct buffer_head *bh)
1405{
1406 return __ocfs2_delete_entry(handle, dir, de_del, bh, bh->b_data,
1407 bh->b_size);
1408}
1409
1410/*
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001411 * Delete a directory entry. Hide the details of directory
1412 * implementation from the caller.
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07001413 */
1414int ocfs2_delete_entry(handle_t *handle,
1415 struct inode *dir,
Mark Fasheh4a12ca32008-11-12 15:43:34 -08001416 struct ocfs2_dir_lookup_result *res)
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07001417{
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001418 if (ocfs2_dir_indexed(dir))
1419 return ocfs2_delete_entry_dx(handle, dir, res);
1420
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07001421 if (OCFS2_I(dir)->ip_dyn_features & OCFS2_INLINE_DATA_FL)
Mark Fasheh4a12ca32008-11-12 15:43:34 -08001422 return ocfs2_delete_entry_id(handle, dir, res->dl_entry,
1423 res->dl_leaf_bh);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07001424
Mark Fasheh4a12ca32008-11-12 15:43:34 -08001425 return ocfs2_delete_entry_el(handle, dir, res->dl_entry,
1426 res->dl_leaf_bh);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07001427}
1428
Mark Fasheh8553cf42007-09-13 16:29:01 -07001429/*
1430 * Check whether 'de' has enough room to hold an entry of
1431 * 'new_rec_len' bytes.
1432 */
1433static inline int ocfs2_dirent_would_fit(struct ocfs2_dir_entry *de,
1434 unsigned int new_rec_len)
1435{
1436 unsigned int de_really_used;
1437
1438 /* Check whether this is an empty record with enough space */
1439 if (le64_to_cpu(de->inode) == 0 &&
1440 le16_to_cpu(de->rec_len) >= new_rec_len)
1441 return 1;
1442
1443 /*
1444 * Record might have free space at the end which we can
1445 * use.
1446 */
1447 de_really_used = OCFS2_DIR_REC_LEN(de->name_len);
1448 if (le16_to_cpu(de->rec_len) >= (de_really_used + new_rec_len))
1449 return 1;
1450
1451 return 0;
1452}
1453
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001454static void ocfs2_dx_dir_leaf_insert_tail(struct ocfs2_dx_leaf *dx_leaf,
1455 struct ocfs2_dx_entry *dx_new_entry)
1456{
1457 int i;
1458
1459 i = le16_to_cpu(dx_leaf->dl_list.de_num_used);
1460 dx_leaf->dl_list.de_entries[i] = *dx_new_entry;
1461
1462 le16_add_cpu(&dx_leaf->dl_list.de_num_used, 1);
1463}
1464
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001465static void ocfs2_dx_entry_list_insert(struct ocfs2_dx_entry_list *entry_list,
1466 struct ocfs2_dx_hinfo *hinfo,
1467 u64 dirent_blk)
1468{
1469 int i;
1470 struct ocfs2_dx_entry *dx_entry;
1471
1472 i = le16_to_cpu(entry_list->de_num_used);
1473 dx_entry = &entry_list->de_entries[i];
1474
1475 memset(dx_entry, 0, sizeof(*dx_entry));
1476 dx_entry->dx_major_hash = cpu_to_le32(hinfo->major_hash);
1477 dx_entry->dx_minor_hash = cpu_to_le32(hinfo->minor_hash);
1478 dx_entry->dx_dirent_blk = cpu_to_le64(dirent_blk);
1479
1480 le16_add_cpu(&entry_list->de_num_used, 1);
1481}
1482
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001483static int __ocfs2_dx_dir_leaf_insert(struct inode *dir, handle_t *handle,
1484 struct ocfs2_dx_hinfo *hinfo,
1485 u64 dirent_blk,
1486 struct buffer_head *dx_leaf_bh)
1487{
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001488 int ret;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001489 struct ocfs2_dx_leaf *dx_leaf;
1490
Joel Becker0cf2f762009-02-12 16:41:25 -08001491 ret = ocfs2_journal_access_dl(handle, INODE_CACHE(dir), dx_leaf_bh,
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001492 OCFS2_JOURNAL_ACCESS_WRITE);
1493 if (ret) {
1494 mlog_errno(ret);
1495 goto out;
1496 }
1497
1498 dx_leaf = (struct ocfs2_dx_leaf *)dx_leaf_bh->b_data;
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001499 ocfs2_dx_entry_list_insert(&dx_leaf->dl_list, hinfo, dirent_blk);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001500 ocfs2_journal_dirty(handle, dx_leaf_bh);
1501
1502out:
1503 return ret;
1504}
1505
Mark Fashehe3a93c22009-02-17 15:29:35 -08001506static void ocfs2_dx_inline_root_insert(struct inode *dir, handle_t *handle,
1507 struct ocfs2_dx_hinfo *hinfo,
1508 u64 dirent_blk,
1509 struct ocfs2_dx_root_block *dx_root)
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001510{
Mark Fashehe3a93c22009-02-17 15:29:35 -08001511 ocfs2_dx_entry_list_insert(&dx_root->dr_entries, hinfo, dirent_blk);
1512}
1513
1514static int ocfs2_dx_dir_insert(struct inode *dir, handle_t *handle,
1515 struct ocfs2_dir_lookup_result *lookup)
1516{
1517 int ret = 0;
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001518 struct ocfs2_dx_root_block *dx_root;
Mark Fashehe3a93c22009-02-17 15:29:35 -08001519 struct buffer_head *dx_root_bh = lookup->dl_dx_root_bh;
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001520
Joel Becker0cf2f762009-02-12 16:41:25 -08001521 ret = ocfs2_journal_access_dr(handle, INODE_CACHE(dir), dx_root_bh,
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001522 OCFS2_JOURNAL_ACCESS_WRITE);
1523 if (ret) {
1524 mlog_errno(ret);
1525 goto out;
1526 }
1527
Mark Fashehe3a93c22009-02-17 15:29:35 -08001528 dx_root = (struct ocfs2_dx_root_block *)lookup->dl_dx_root_bh->b_data;
1529 if (ocfs2_dx_root_inline(dx_root)) {
1530 ocfs2_dx_inline_root_insert(dir, handle,
1531 &lookup->dl_hinfo,
1532 lookup->dl_leaf_bh->b_blocknr,
1533 dx_root);
1534 } else {
1535 ret = __ocfs2_dx_dir_leaf_insert(dir, handle, &lookup->dl_hinfo,
1536 lookup->dl_leaf_bh->b_blocknr,
1537 lookup->dl_dx_leaf_bh);
1538 if (ret)
1539 goto out;
1540 }
1541
1542 le32_add_cpu(&dx_root->dr_num_entries, 1);
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001543 ocfs2_journal_dirty(handle, dx_root_bh);
1544
1545out:
1546 return ret;
1547}
1548
Mark Fashehe7c17e42009-01-29 18:17:46 -08001549static void ocfs2_remove_block_from_free_list(struct inode *dir,
1550 handle_t *handle,
1551 struct ocfs2_dir_lookup_result *lookup)
1552{
1553 struct ocfs2_dir_block_trailer *trailer, *prev;
1554 struct ocfs2_dx_root_block *dx_root;
1555 struct buffer_head *bh;
1556
1557 trailer = ocfs2_trailer_from_bh(lookup->dl_leaf_bh, dir->i_sb);
1558
1559 if (ocfs2_free_list_at_root(lookup)) {
1560 bh = lookup->dl_dx_root_bh;
1561 dx_root = (struct ocfs2_dx_root_block *)bh->b_data;
1562 dx_root->dr_free_blk = trailer->db_free_next;
1563 } else {
1564 bh = lookup->dl_prev_leaf_bh;
1565 prev = ocfs2_trailer_from_bh(bh, dir->i_sb);
1566 prev->db_free_next = trailer->db_free_next;
1567 }
1568
1569 trailer->db_free_rec_len = cpu_to_le16(0);
1570 trailer->db_free_next = cpu_to_le64(0);
1571
1572 ocfs2_journal_dirty(handle, bh);
1573 ocfs2_journal_dirty(handle, lookup->dl_leaf_bh);
1574}
1575
1576/*
1577 * This expects that a journal write has been reserved on
1578 * lookup->dl_prev_leaf_bh or lookup->dl_dx_root_bh
1579 */
1580static void ocfs2_recalc_free_list(struct inode *dir, handle_t *handle,
1581 struct ocfs2_dir_lookup_result *lookup)
1582{
1583 int max_rec_len;
1584 struct ocfs2_dir_block_trailer *trailer;
1585
1586 /* Walk dl_leaf_bh to figure out what the new free rec_len is. */
1587 max_rec_len = ocfs2_find_max_rec_len(dir->i_sb, lookup->dl_leaf_bh);
1588 if (max_rec_len) {
1589 /*
1590 * There's still room in this block, so no need to remove it
1591 * from the free list. In this case, we just want to update
1592 * the rec len accounting.
1593 */
1594 trailer = ocfs2_trailer_from_bh(lookup->dl_leaf_bh, dir->i_sb);
1595 trailer->db_free_rec_len = cpu_to_le16(max_rec_len);
1596 ocfs2_journal_dirty(handle, lookup->dl_leaf_bh);
1597 } else {
1598 ocfs2_remove_block_from_free_list(dir, handle, lookup);
1599 }
1600}
1601
Mark Fasheh316f4b92007-09-07 18:21:26 -07001602/* we don't always have a dentry for what we want to add, so people
1603 * like orphan dir can call this instead.
1604 *
Mark Fasheh4a12ca32008-11-12 15:43:34 -08001605 * The lookup context must have been filled from
1606 * ocfs2_prepare_dir_for_insert.
Mark Fasheh316f4b92007-09-07 18:21:26 -07001607 */
1608int __ocfs2_add_entry(handle_t *handle,
1609 struct inode *dir,
1610 const char *name, int namelen,
1611 struct inode *inode, u64 blkno,
1612 struct buffer_head *parent_fe_bh,
Mark Fasheh4a12ca32008-11-12 15:43:34 -08001613 struct ocfs2_dir_lookup_result *lookup)
Mark Fasheh316f4b92007-09-07 18:21:26 -07001614{
1615 unsigned long offset;
1616 unsigned short rec_len;
1617 struct ocfs2_dir_entry *de, *de1;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07001618 struct ocfs2_dinode *di = (struct ocfs2_dinode *)parent_fe_bh->b_data;
1619 struct super_block *sb = dir->i_sb;
Mark Fasheh316f4b92007-09-07 18:21:26 -07001620 int retval, status;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07001621 unsigned int size = sb->s_blocksize;
Mark Fasheh4a12ca32008-11-12 15:43:34 -08001622 struct buffer_head *insert_bh = lookup->dl_leaf_bh;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07001623 char *data_start = insert_bh->b_data;
Mark Fasheh316f4b92007-09-07 18:21:26 -07001624
Mark Fasheh316f4b92007-09-07 18:21:26 -07001625 if (!namelen)
1626 return -EINVAL;
1627
Mark Fashehe7c17e42009-01-29 18:17:46 -08001628 if (ocfs2_dir_indexed(dir)) {
1629 struct buffer_head *bh;
1630
1631 /*
1632 * An indexed dir may require that we update the free space
1633 * list. Reserve a write to the previous node in the list so
1634 * that we don't fail later.
1635 *
1636 * XXX: This can be either a dx_root_block, or an unindexed
1637 * directory tree leaf block.
1638 */
1639 if (ocfs2_free_list_at_root(lookup)) {
1640 bh = lookup->dl_dx_root_bh;
Joel Becker0cf2f762009-02-12 16:41:25 -08001641 retval = ocfs2_journal_access_dr(handle,
1642 INODE_CACHE(dir), bh,
Mark Fashehe7c17e42009-01-29 18:17:46 -08001643 OCFS2_JOURNAL_ACCESS_WRITE);
1644 } else {
1645 bh = lookup->dl_prev_leaf_bh;
Joel Becker0cf2f762009-02-12 16:41:25 -08001646 retval = ocfs2_journal_access_db(handle,
1647 INODE_CACHE(dir), bh,
Mark Fashehe7c17e42009-01-29 18:17:46 -08001648 OCFS2_JOURNAL_ACCESS_WRITE);
1649 }
1650 if (retval) {
1651 mlog_errno(retval);
1652 return retval;
1653 }
1654 } else if (OCFS2_I(dir)->ip_dyn_features & OCFS2_INLINE_DATA_FL) {
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07001655 data_start = di->id2.i_data.id_data;
1656 size = i_size_read(dir);
1657
1658 BUG_ON(insert_bh != parent_fe_bh);
1659 }
1660
Mark Fasheh316f4b92007-09-07 18:21:26 -07001661 rec_len = OCFS2_DIR_REC_LEN(namelen);
1662 offset = 0;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07001663 de = (struct ocfs2_dir_entry *) data_start;
Mark Fasheh316f4b92007-09-07 18:21:26 -07001664 while (1) {
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07001665 BUG_ON((char *)de >= (size + data_start));
1666
Mark Fasheh316f4b92007-09-07 18:21:26 -07001667 /* These checks should've already been passed by the
1668 * prepare function, but I guess we can leave them
1669 * here anyway. */
1670 if (!ocfs2_check_dir_entry(dir, de, insert_bh, offset)) {
1671 retval = -ENOENT;
1672 goto bail;
1673 }
1674 if (ocfs2_match(namelen, name, de)) {
1675 retval = -EEXIST;
1676 goto bail;
1677 }
Mark Fasheh8553cf42007-09-13 16:29:01 -07001678
Mark Fasheh87d35a72008-12-10 17:36:25 -08001679 /* We're guaranteed that we should have space, so we
1680 * can't possibly have hit the trailer...right? */
1681 mlog_bug_on_msg(ocfs2_skip_dir_trailer(dir, de, offset, size),
1682 "Hit dir trailer trying to insert %.*s "
1683 "(namelen %d) into directory %llu. "
1684 "offset is %lu, trailer offset is %d\n",
1685 namelen, name, namelen,
1686 (unsigned long long)parent_fe_bh->b_blocknr,
1687 offset, ocfs2_dir_trailer_blk_off(dir->i_sb));
1688
Mark Fasheh8553cf42007-09-13 16:29:01 -07001689 if (ocfs2_dirent_would_fit(de, rec_len)) {
Mark Fasheh316f4b92007-09-07 18:21:26 -07001690 dir->i_mtime = dir->i_ctime = CURRENT_TIME;
1691 retval = ocfs2_mark_inode_dirty(handle, dir, parent_fe_bh);
1692 if (retval < 0) {
1693 mlog_errno(retval);
1694 goto bail;
1695 }
1696
Joel Becker13723d02008-10-17 19:25:01 -07001697 if (insert_bh == parent_fe_bh)
Joel Becker0cf2f762009-02-12 16:41:25 -08001698 status = ocfs2_journal_access_di(handle,
1699 INODE_CACHE(dir),
Joel Becker13723d02008-10-17 19:25:01 -07001700 insert_bh,
1701 OCFS2_JOURNAL_ACCESS_WRITE);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001702 else {
Joel Becker0cf2f762009-02-12 16:41:25 -08001703 status = ocfs2_journal_access_db(handle,
1704 INODE_CACHE(dir),
Joel Becker13723d02008-10-17 19:25:01 -07001705 insert_bh,
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001706 OCFS2_JOURNAL_ACCESS_WRITE);
1707
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001708 if (ocfs2_dir_indexed(dir)) {
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08001709 status = ocfs2_dx_dir_insert(dir,
1710 handle,
1711 lookup);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001712 if (status) {
1713 mlog_errno(status);
1714 goto bail;
1715 }
1716 }
1717 }
1718
Mark Fasheh316f4b92007-09-07 18:21:26 -07001719 /* By now the buffer is marked for journaling */
1720 offset += le16_to_cpu(de->rec_len);
1721 if (le64_to_cpu(de->inode)) {
1722 de1 = (struct ocfs2_dir_entry *)((char *) de +
1723 OCFS2_DIR_REC_LEN(de->name_len));
1724 de1->rec_len =
1725 cpu_to_le16(le16_to_cpu(de->rec_len) -
1726 OCFS2_DIR_REC_LEN(de->name_len));
1727 de->rec_len = cpu_to_le16(OCFS2_DIR_REC_LEN(de->name_len));
1728 de = de1;
1729 }
1730 de->file_type = OCFS2_FT_UNKNOWN;
1731 if (blkno) {
1732 de->inode = cpu_to_le64(blkno);
1733 ocfs2_set_de_type(de, inode->i_mode);
1734 } else
1735 de->inode = 0;
1736 de->name_len = namelen;
1737 memcpy(de->name, name, namelen);
1738
Mark Fashehe7c17e42009-01-29 18:17:46 -08001739 if (ocfs2_dir_indexed(dir))
1740 ocfs2_recalc_free_list(dir, handle, lookup);
1741
Mark Fasheh316f4b92007-09-07 18:21:26 -07001742 dir->i_version++;
Joel Beckerec20cec2010-03-19 14:13:52 -07001743 ocfs2_journal_dirty(handle, insert_bh);
Mark Fasheh316f4b92007-09-07 18:21:26 -07001744 retval = 0;
1745 goto bail;
1746 }
Mark Fasheh87d35a72008-12-10 17:36:25 -08001747
Mark Fasheh316f4b92007-09-07 18:21:26 -07001748 offset += le16_to_cpu(de->rec_len);
1749 de = (struct ocfs2_dir_entry *) ((char *) de + le16_to_cpu(de->rec_len));
1750 }
1751
1752 /* when you think about it, the assert above should prevent us
1753 * from ever getting here. */
1754 retval = -ENOSPC;
1755bail:
Tao Mac1e8d352011-03-07 16:43:21 +08001756 if (retval)
1757 mlog_errno(retval);
Mark Fasheh316f4b92007-09-07 18:21:26 -07001758
Mark Fasheh316f4b92007-09-07 18:21:26 -07001759 return retval;
1760}
1761
Mark Fasheh23193e52007-09-12 13:01:18 -07001762static int ocfs2_dir_foreach_blk_id(struct inode *inode,
Mathieu Desnoyers2b47c362007-10-16 23:27:21 -07001763 u64 *f_version,
Al Viro3704412b2013-05-22 21:06:00 -04001764 struct dir_context *ctx)
Mark Fasheh23193e52007-09-12 13:01:18 -07001765{
Al Viro3704412b2013-05-22 21:06:00 -04001766 int ret, i;
1767 unsigned long offset = ctx->pos;
Mark Fasheh23193e52007-09-12 13:01:18 -07001768 struct buffer_head *di_bh = NULL;
1769 struct ocfs2_dinode *di;
1770 struct ocfs2_inline_data *data;
1771 struct ocfs2_dir_entry *de;
1772
Joel Beckerb657c952008-11-13 14:49:11 -08001773 ret = ocfs2_read_inode_block(inode, &di_bh);
Mark Fasheh23193e52007-09-12 13:01:18 -07001774 if (ret) {
1775 mlog(ML_ERROR, "Unable to read inode block for dir %llu\n",
1776 (unsigned long long)OCFS2_I(inode)->ip_blkno);
1777 goto out;
1778 }
1779
1780 di = (struct ocfs2_dinode *)di_bh->b_data;
1781 data = &di->id2.i_data;
1782
Al Viro3704412b2013-05-22 21:06:00 -04001783 while (ctx->pos < i_size_read(inode)) {
Mark Fasheh23193e52007-09-12 13:01:18 -07001784 /* If the dir block has changed since the last call to
1785 * readdir(2), then we might be pointing to an invalid
1786 * dirent right now. Scan from the start of the block
1787 * to make sure. */
1788 if (*f_version != inode->i_version) {
1789 for (i = 0; i < i_size_read(inode) && i < offset; ) {
1790 de = (struct ocfs2_dir_entry *)
1791 (data->id_data + i);
1792 /* It's too expensive to do a full
1793 * dirent test each time round this
1794 * loop, but we do have to test at
1795 * least that it is non-zero. A
1796 * failure will be detected in the
1797 * dirent test below. */
1798 if (le16_to_cpu(de->rec_len) <
1799 OCFS2_DIR_REC_LEN(1))
1800 break;
1801 i += le16_to_cpu(de->rec_len);
1802 }
Al Viro3704412b2013-05-22 21:06:00 -04001803 ctx->pos = offset = i;
Mark Fasheh23193e52007-09-12 13:01:18 -07001804 *f_version = inode->i_version;
1805 }
1806
Al Viro3704412b2013-05-22 21:06:00 -04001807 de = (struct ocfs2_dir_entry *) (data->id_data + ctx->pos);
1808 if (!ocfs2_check_dir_entry(inode, de, di_bh, ctx->pos)) {
Mark Fasheh23193e52007-09-12 13:01:18 -07001809 /* On error, skip the f_pos to the end. */
Al Viro3704412b2013-05-22 21:06:00 -04001810 ctx->pos = i_size_read(inode);
1811 break;
Mark Fasheh23193e52007-09-12 13:01:18 -07001812 }
1813 offset += le16_to_cpu(de->rec_len);
1814 if (le64_to_cpu(de->inode)) {
Mark Fasheh23193e52007-09-12 13:01:18 -07001815 unsigned char d_type = DT_UNKNOWN;
1816
1817 if (de->file_type < OCFS2_FT_MAX)
1818 d_type = ocfs2_filetype_table[de->file_type];
1819
Al Viro3704412b2013-05-22 21:06:00 -04001820 if (!dir_emit(ctx, de->name, de->name_len,
1821 le64_to_cpu(de->inode), d_type))
1822 goto out;
Mark Fasheh23193e52007-09-12 13:01:18 -07001823 }
Al Viro3704412b2013-05-22 21:06:00 -04001824 ctx->pos += le16_to_cpu(de->rec_len);
Mark Fasheh23193e52007-09-12 13:01:18 -07001825 }
Mark Fasheh23193e52007-09-12 13:01:18 -07001826out:
1827 brelse(di_bh);
Mark Fasheh23193e52007-09-12 13:01:18 -07001828 return 0;
1829}
1830
Mark Fasheh9b7895e2008-11-12 16:27:44 -08001831/*
1832 * NOTE: This function can be called against unindexed directories,
1833 * and indexed ones.
1834 */
Mark Fasheh23193e52007-09-12 13:01:18 -07001835static int ocfs2_dir_foreach_blk_el(struct inode *inode,
Mathieu Desnoyers2b47c362007-10-16 23:27:21 -07001836 u64 *f_version,
Al Viro3704412b2013-05-22 21:06:00 -04001837 struct dir_context *ctx,
1838 bool persist)
Mark Fashehccd979b2005-12-15 14:31:24 -08001839{
Mark Fashehaa958872006-04-21 13:49:02 -07001840 unsigned long offset, blk, last_ra_blk = 0;
Al Viro3704412b2013-05-22 21:06:00 -04001841 int i;
Mark Fashehccd979b2005-12-15 14:31:24 -08001842 struct buffer_head * bh, * tmp;
1843 struct ocfs2_dir_entry * de;
Mark Fashehccd979b2005-12-15 14:31:24 -08001844 struct super_block * sb = inode->i_sb;
Mark Fashehaa958872006-04-21 13:49:02 -07001845 unsigned int ra_sectors = 16;
Al Viro3704412b2013-05-22 21:06:00 -04001846 int stored = 0;
Mark Fashehccd979b2005-12-15 14:31:24 -08001847
Mark Fashehccd979b2005-12-15 14:31:24 -08001848 bh = NULL;
1849
Al Viro3704412b2013-05-22 21:06:00 -04001850 offset = ctx->pos & (sb->s_blocksize - 1);
Mark Fashehccd979b2005-12-15 14:31:24 -08001851
Al Viro3704412b2013-05-22 21:06:00 -04001852 while (ctx->pos < i_size_read(inode)) {
1853 blk = ctx->pos >> sb->s_blocksize_bits;
Joel Beckera22305c2008-11-13 14:49:17 -08001854 if (ocfs2_read_dir_block(inode, blk, &bh, 0)) {
1855 /* Skip the corrupt dirblock and keep trying */
Al Viro3704412b2013-05-22 21:06:00 -04001856 ctx->pos += sb->s_blocksize - offset;
Mark Fashehccd979b2005-12-15 14:31:24 -08001857 continue;
1858 }
1859
Mark Fashehaa958872006-04-21 13:49:02 -07001860 /* The idea here is to begin with 8k read-ahead and to stay
1861 * 4k ahead of our current position.
1862 *
1863 * TODO: Use the pagecache for this. We just need to
1864 * make sure it's cluster-safe... */
1865 if (!last_ra_blk
1866 || (((last_ra_blk - blk) << 9) <= (ra_sectors / 2))) {
1867 for (i = ra_sectors >> (sb->s_blocksize_bits - 9);
Mark Fashehccd979b2005-12-15 14:31:24 -08001868 i > 0; i--) {
Joel Beckera22305c2008-11-13 14:49:17 -08001869 tmp = NULL;
1870 if (!ocfs2_read_dir_block(inode, ++blk, &tmp,
1871 OCFS2_BH_READAHEAD))
1872 brelse(tmp);
Mark Fashehccd979b2005-12-15 14:31:24 -08001873 }
Mark Fashehaa958872006-04-21 13:49:02 -07001874 last_ra_blk = blk;
1875 ra_sectors = 8;
Mark Fashehccd979b2005-12-15 14:31:24 -08001876 }
1877
Mark Fashehccd979b2005-12-15 14:31:24 -08001878 /* If the dir block has changed since the last call to
1879 * readdir(2), then we might be pointing to an invalid
1880 * dirent right now. Scan from the start of the block
1881 * to make sure. */
Mark Fashehb8bc5f42007-09-10 17:17:52 -07001882 if (*f_version != inode->i_version) {
Mark Fashehccd979b2005-12-15 14:31:24 -08001883 for (i = 0; i < sb->s_blocksize && i < offset; ) {
1884 de = (struct ocfs2_dir_entry *) (bh->b_data + i);
1885 /* It's too expensive to do a full
1886 * dirent test each time round this
1887 * loop, but we do have to test at
1888 * least that it is non-zero. A
1889 * failure will be detected in the
1890 * dirent test below. */
1891 if (le16_to_cpu(de->rec_len) <
1892 OCFS2_DIR_REC_LEN(1))
1893 break;
1894 i += le16_to_cpu(de->rec_len);
1895 }
1896 offset = i;
Al Viro3704412b2013-05-22 21:06:00 -04001897 ctx->pos = (ctx->pos & ~(sb->s_blocksize - 1))
Mark Fashehccd979b2005-12-15 14:31:24 -08001898 | offset;
Mark Fashehb8bc5f42007-09-10 17:17:52 -07001899 *f_version = inode->i_version;
Mark Fashehccd979b2005-12-15 14:31:24 -08001900 }
1901
Al Viro3704412b2013-05-22 21:06:00 -04001902 while (ctx->pos < i_size_read(inode)
Mark Fashehccd979b2005-12-15 14:31:24 -08001903 && offset < sb->s_blocksize) {
1904 de = (struct ocfs2_dir_entry *) (bh->b_data + offset);
1905 if (!ocfs2_check_dir_entry(inode, de, bh, offset)) {
1906 /* On error, skip the f_pos to the
1907 next block. */
Al Viro3704412b2013-05-22 21:06:00 -04001908 ctx->pos = (ctx->pos | (sb->s_blocksize - 1)) + 1;
Mark Fashehccd979b2005-12-15 14:31:24 -08001909 brelse(bh);
Al Viro3704412b2013-05-22 21:06:00 -04001910 continue;
Mark Fashehccd979b2005-12-15 14:31:24 -08001911 }
Mark Fashehccd979b2005-12-15 14:31:24 -08001912 if (le64_to_cpu(de->inode)) {
Mark Fashehccd979b2005-12-15 14:31:24 -08001913 unsigned char d_type = DT_UNKNOWN;
1914
1915 if (de->file_type < OCFS2_FT_MAX)
1916 d_type = ocfs2_filetype_table[de->file_type];
Al Viro3704412b2013-05-22 21:06:00 -04001917 if (!dir_emit(ctx, de->name,
Mark Fashehccd979b2005-12-15 14:31:24 -08001918 de->name_len,
Mark Fasheh7e853672007-09-10 17:30:26 -07001919 le64_to_cpu(de->inode),
Al Viro3704412b2013-05-22 21:06:00 -04001920 d_type)) {
1921 brelse(bh);
1922 return 0;
Mark Fashehe7b34012007-09-24 14:25:27 -07001923 }
Al Viro3704412b2013-05-22 21:06:00 -04001924 stored++;
Mark Fashehccd979b2005-12-15 14:31:24 -08001925 }
Al Viro3704412b2013-05-22 21:06:00 -04001926 offset += le16_to_cpu(de->rec_len);
1927 ctx->pos += le16_to_cpu(de->rec_len);
Mark Fashehccd979b2005-12-15 14:31:24 -08001928 }
1929 offset = 0;
1930 brelse(bh);
Joel Beckera22305c2008-11-13 14:49:17 -08001931 bh = NULL;
Al Viro3704412b2013-05-22 21:06:00 -04001932 if (!persist && stored)
1933 break;
Mark Fashehccd979b2005-12-15 14:31:24 -08001934 }
Al Viro3704412b2013-05-22 21:06:00 -04001935 return 0;
Mark Fashehb8bc5f42007-09-10 17:17:52 -07001936}
1937
Mathieu Desnoyers2b47c362007-10-16 23:27:21 -07001938static int ocfs2_dir_foreach_blk(struct inode *inode, u64 *f_version,
Al Viro3704412b2013-05-22 21:06:00 -04001939 struct dir_context *ctx,
1940 bool persist)
Mark Fasheh23193e52007-09-12 13:01:18 -07001941{
1942 if (OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL)
Al Viro3704412b2013-05-22 21:06:00 -04001943 return ocfs2_dir_foreach_blk_id(inode, f_version, ctx);
1944 return ocfs2_dir_foreach_blk_el(inode, f_version, ctx, persist);
Mark Fasheh23193e52007-09-12 13:01:18 -07001945}
1946
Mark Fashehb8bc5f42007-09-10 17:17:52 -07001947/*
Mark Fasheh5eae5b92007-09-10 17:50:51 -07001948 * This is intended to be called from inside other kernel functions,
1949 * so we fake some arguments.
1950 */
Al Viro3704412b2013-05-22 21:06:00 -04001951int ocfs2_dir_foreach(struct inode *inode, struct dir_context *ctx)
Mark Fasheh5eae5b92007-09-10 17:50:51 -07001952{
Mathieu Desnoyers2b47c362007-10-16 23:27:21 -07001953 u64 version = inode->i_version;
Al Viro3704412b2013-05-22 21:06:00 -04001954 ocfs2_dir_foreach_blk(inode, &version, ctx, true);
Mark Fasheh5eae5b92007-09-10 17:50:51 -07001955 return 0;
1956}
1957
1958/*
Mark Fashehb8bc5f42007-09-10 17:17:52 -07001959 * ocfs2_readdir()
1960 *
1961 */
Al Viro3704412b2013-05-22 21:06:00 -04001962int ocfs2_readdir(struct file *file, struct dir_context *ctx)
Mark Fashehb8bc5f42007-09-10 17:17:52 -07001963{
1964 int error = 0;
Al Viro3704412b2013-05-22 21:06:00 -04001965 struct inode *inode = file_inode(file);
Mark Fashehb8bc5f42007-09-10 17:17:52 -07001966 int lock_level = 0;
1967
Tao Maf1088d42011-02-23 22:30:23 +08001968 trace_ocfs2_readdir((unsigned long long)OCFS2_I(inode)->ip_blkno);
Mark Fashehb8bc5f42007-09-10 17:17:52 -07001969
Al Viro3704412b2013-05-22 21:06:00 -04001970 error = ocfs2_inode_lock_atime(inode, file->f_path.mnt, &lock_level);
Mark Fashehb8bc5f42007-09-10 17:17:52 -07001971 if (lock_level && error >= 0) {
1972 /* We release EX lock which used to update atime
1973 * and get PR lock again to reduce contention
1974 * on commonly accessed directories. */
Mark Fashehe63aecb62007-10-18 15:30:42 -07001975 ocfs2_inode_unlock(inode, 1);
Mark Fashehb8bc5f42007-09-10 17:17:52 -07001976 lock_level = 0;
Mark Fashehe63aecb62007-10-18 15:30:42 -07001977 error = ocfs2_inode_lock(inode, NULL, 0);
Mark Fashehb8bc5f42007-09-10 17:17:52 -07001978 }
1979 if (error < 0) {
1980 if (error != -ENOENT)
1981 mlog_errno(error);
1982 /* we haven't got any yet, so propagate the error. */
1983 goto bail_nolock;
1984 }
1985
Al Viro3704412b2013-05-22 21:06:00 -04001986 error = ocfs2_dir_foreach_blk(inode, &file->f_version, ctx, false);
Mark Fashehb8bc5f42007-09-10 17:17:52 -07001987
Mark Fashehe63aecb62007-10-18 15:30:42 -07001988 ocfs2_inode_unlock(inode, lock_level);
Tao Mac1e8d352011-03-07 16:43:21 +08001989 if (error)
1990 mlog_errno(error);
Mark Fashehccd979b2005-12-15 14:31:24 -08001991
Mark Fashehaa958872006-04-21 13:49:02 -07001992bail_nolock:
Mark Fashehccd979b2005-12-15 14:31:24 -08001993
Mark Fashehb8bc5f42007-09-10 17:17:52 -07001994 return error;
Mark Fashehccd979b2005-12-15 14:31:24 -08001995}
1996
1997/*
Jes Sorensen1b1dcc12006-01-09 15:59:24 -08001998 * NOTE: this should always be called with parent dir i_mutex taken.
Mark Fashehccd979b2005-12-15 14:31:24 -08001999 */
2000int ocfs2_find_files_on_disk(const char *name,
2001 int namelen,
2002 u64 *blkno,
2003 struct inode *inode,
Mark Fasheh4a12ca32008-11-12 15:43:34 -08002004 struct ocfs2_dir_lookup_result *lookup)
Mark Fashehccd979b2005-12-15 14:31:24 -08002005{
2006 int status = -ENOENT;
Mark Fashehccd979b2005-12-15 14:31:24 -08002007
Tao Maf1088d42011-02-23 22:30:23 +08002008 trace_ocfs2_find_files_on_disk(namelen, name, blkno,
2009 (unsigned long long)OCFS2_I(inode)->ip_blkno);
Mark Fashehccd979b2005-12-15 14:31:24 -08002010
Mark Fasheh4a12ca32008-11-12 15:43:34 -08002011 status = ocfs2_find_entry(name, namelen, inode, lookup);
2012 if (status)
Mark Fashehccd979b2005-12-15 14:31:24 -08002013 goto leave;
Mark Fashehccd979b2005-12-15 14:31:24 -08002014
Mark Fasheh4a12ca32008-11-12 15:43:34 -08002015 *blkno = le64_to_cpu(lookup->dl_entry->inode);
Mark Fashehccd979b2005-12-15 14:31:24 -08002016
2017 status = 0;
2018leave:
Mark Fashehccd979b2005-12-15 14:31:24 -08002019
Mark Fashehccd979b2005-12-15 14:31:24 -08002020 return status;
2021}
2022
Mark Fashehbe94d112007-09-11 15:22:06 -07002023/*
2024 * Convenience function for callers which just want the block number
2025 * mapped to a name and don't require the full dirent info, etc.
2026 */
2027int ocfs2_lookup_ino_from_name(struct inode *dir, const char *name,
2028 int namelen, u64 *blkno)
2029{
2030 int ret;
Mark Fasheh4a12ca32008-11-12 15:43:34 -08002031 struct ocfs2_dir_lookup_result lookup = { NULL, };
Mark Fashehbe94d112007-09-11 15:22:06 -07002032
Mark Fasheh4a12ca32008-11-12 15:43:34 -08002033 ret = ocfs2_find_files_on_disk(name, namelen, blkno, dir, &lookup);
2034 ocfs2_free_dir_lookup_result(&lookup);
Mark Fashehbe94d112007-09-11 15:22:06 -07002035
2036 return ret;
2037}
2038
Mark Fashehccd979b2005-12-15 14:31:24 -08002039/* Check for a name within a directory.
2040 *
2041 * Return 0 if the name does not exist
2042 * Return -EEXIST if the directory contains the name
2043 *
Jes Sorensen1b1dcc12006-01-09 15:59:24 -08002044 * Callers should have i_mutex + a cluster lock on dir
Mark Fashehccd979b2005-12-15 14:31:24 -08002045 */
2046int ocfs2_check_dir_for_entry(struct inode *dir,
2047 const char *name,
2048 int namelen)
2049{
Daeseok Youn7c01ad82015-04-14 15:43:30 -07002050 int ret = 0;
Mark Fasheh4a12ca32008-11-12 15:43:34 -08002051 struct ocfs2_dir_lookup_result lookup = { NULL, };
Mark Fashehccd979b2005-12-15 14:31:24 -08002052
Tao Maf1088d42011-02-23 22:30:23 +08002053 trace_ocfs2_check_dir_for_entry(
2054 (unsigned long long)OCFS2_I(dir)->ip_blkno, namelen, name);
Mark Fashehccd979b2005-12-15 14:31:24 -08002055
Daeseok Youn7c01ad82015-04-14 15:43:30 -07002056 if (ocfs2_find_entry(name, namelen, dir, &lookup) == 0) {
2057 ret = -EEXIST;
2058 mlog_errno(ret);
2059 }
Mark Fashehccd979b2005-12-15 14:31:24 -08002060
Mark Fasheh4a12ca32008-11-12 15:43:34 -08002061 ocfs2_free_dir_lookup_result(&lookup);
Mark Fashehccd979b2005-12-15 14:31:24 -08002062
Mark Fashehccd979b2005-12-15 14:31:24 -08002063 return ret;
2064}
2065
Mark Fasheh0bfbbf62007-09-12 11:19:00 -07002066struct ocfs2_empty_dir_priv {
Al Viro3704412b2013-05-22 21:06:00 -04002067 struct dir_context ctx;
Mark Fasheh0bfbbf62007-09-12 11:19:00 -07002068 unsigned seen_dot;
2069 unsigned seen_dot_dot;
2070 unsigned seen_other;
Mark Fashehe3a93c22009-02-17 15:29:35 -08002071 unsigned dx_dir;
Mark Fasheh0bfbbf62007-09-12 11:19:00 -07002072};
Miklos Szerediac7576f2014-10-30 17:37:34 +01002073static int ocfs2_empty_dir_filldir(struct dir_context *ctx, const char *name,
2074 int name_len, loff_t pos, u64 ino,
2075 unsigned type)
Mark Fasheh0bfbbf62007-09-12 11:19:00 -07002076{
Miklos Szerediac7576f2014-10-30 17:37:34 +01002077 struct ocfs2_empty_dir_priv *p =
2078 container_of(ctx, struct ocfs2_empty_dir_priv, ctx);
Mark Fasheh0bfbbf62007-09-12 11:19:00 -07002079
2080 /*
2081 * Check the positions of "." and ".." records to be sure
2082 * they're in the correct place.
Mark Fashehe3a93c22009-02-17 15:29:35 -08002083 *
2084 * Indexed directories don't need to proceed past the first
2085 * two entries, so we end the scan after seeing '..'. Despite
2086 * that, we allow the scan to proceed In the event that we
2087 * have a corrupted indexed directory (no dot or dot dot
2088 * entries). This allows us to double check for existing
2089 * entries which might not have been found in the index.
Mark Fasheh0bfbbf62007-09-12 11:19:00 -07002090 */
2091 if (name_len == 1 && !strncmp(".", name, 1) && pos == 0) {
2092 p->seen_dot = 1;
2093 return 0;
2094 }
2095
2096 if (name_len == 2 && !strncmp("..", name, 2) &&
2097 pos == OCFS2_DIR_REC_LEN(1)) {
2098 p->seen_dot_dot = 1;
Mark Fashehe3a93c22009-02-17 15:29:35 -08002099
2100 if (p->dx_dir && p->seen_dot)
2101 return 1;
2102
Mark Fasheh0bfbbf62007-09-12 11:19:00 -07002103 return 0;
2104 }
2105
2106 p->seen_other = 1;
2107 return 1;
2108}
Mark Fashehe3a93c22009-02-17 15:29:35 -08002109
2110static int ocfs2_empty_dir_dx(struct inode *inode,
2111 struct ocfs2_empty_dir_priv *priv)
2112{
2113 int ret;
2114 struct buffer_head *di_bh = NULL;
2115 struct buffer_head *dx_root_bh = NULL;
2116 struct ocfs2_dinode *di;
2117 struct ocfs2_dx_root_block *dx_root;
2118
2119 priv->dx_dir = 1;
2120
2121 ret = ocfs2_read_inode_block(inode, &di_bh);
2122 if (ret) {
2123 mlog_errno(ret);
2124 goto out;
2125 }
2126 di = (struct ocfs2_dinode *)di_bh->b_data;
2127
2128 ret = ocfs2_read_dx_root(inode, di, &dx_root_bh);
2129 if (ret) {
2130 mlog_errno(ret);
2131 goto out;
2132 }
2133 dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data;
2134
2135 if (le32_to_cpu(dx_root->dr_num_entries) != 2)
2136 priv->seen_other = 1;
2137
2138out:
2139 brelse(di_bh);
2140 brelse(dx_root_bh);
2141 return ret;
2142}
2143
Mark Fashehccd979b2005-12-15 14:31:24 -08002144/*
2145 * routine to check that the specified directory is empty (for rmdir)
Mark Fasheh0bfbbf62007-09-12 11:19:00 -07002146 *
2147 * Returns 1 if dir is empty, zero otherwise.
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002148 *
Mark Fashehe3a93c22009-02-17 15:29:35 -08002149 * XXX: This is a performance problem for unindexed directories.
Mark Fashehccd979b2005-12-15 14:31:24 -08002150 */
2151int ocfs2_empty_dir(struct inode *inode)
2152{
Mark Fasheh0bfbbf62007-09-12 11:19:00 -07002153 int ret;
Al Viro3704412b2013-05-22 21:06:00 -04002154 struct ocfs2_empty_dir_priv priv = {
Jeff Liud6394b52013-08-13 16:01:01 -07002155 .ctx.actor = ocfs2_empty_dir_filldir,
Al Viro3704412b2013-05-22 21:06:00 -04002156 };
Mark Fashehccd979b2005-12-15 14:31:24 -08002157
Mark Fashehe3a93c22009-02-17 15:29:35 -08002158 if (ocfs2_dir_indexed(inode)) {
2159 ret = ocfs2_empty_dir_dx(inode, &priv);
2160 if (ret)
2161 mlog_errno(ret);
2162 /*
2163 * We still run ocfs2_dir_foreach to get the checks
2164 * for "." and "..".
2165 */
2166 }
2167
Al Viro3704412b2013-05-22 21:06:00 -04002168 ret = ocfs2_dir_foreach(inode, &priv.ctx);
Mark Fasheh0bfbbf62007-09-12 11:19:00 -07002169 if (ret)
2170 mlog_errno(ret);
2171
2172 if (!priv.seen_dot || !priv.seen_dot_dot) {
2173 mlog(ML_ERROR, "bad directory (dir #%llu) - no `.' or `..'\n",
Mark Fashehb06970532006-03-03 10:24:33 -08002174 (unsigned long long)OCFS2_I(inode)->ip_blkno);
Mark Fasheh0bfbbf62007-09-12 11:19:00 -07002175 /*
2176 * XXX: Is it really safe to allow an unlink to continue?
2177 */
Mark Fashehccd979b2005-12-15 14:31:24 -08002178 return 1;
2179 }
2180
Mark Fasheh0bfbbf62007-09-12 11:19:00 -07002181 return !priv.seen_other;
Mark Fashehccd979b2005-12-15 14:31:24 -08002182}
2183
Mark Fasheh87d35a72008-12-10 17:36:25 -08002184/*
2185 * Fills "." and ".." dirents in a new directory block. Returns dirent for
2186 * "..", which might be used during creation of a directory with a trailing
2187 * header. It is otherwise safe to ignore the return code.
2188 */
2189static struct ocfs2_dir_entry *ocfs2_fill_initial_dirents(struct inode *inode,
2190 struct inode *parent,
2191 char *start,
2192 unsigned int size)
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002193{
2194 struct ocfs2_dir_entry *de = (struct ocfs2_dir_entry *)start;
2195
2196 de->inode = cpu_to_le64(OCFS2_I(inode)->ip_blkno);
2197 de->name_len = 1;
2198 de->rec_len =
2199 cpu_to_le16(OCFS2_DIR_REC_LEN(de->name_len));
2200 strcpy(de->name, ".");
2201 ocfs2_set_de_type(de, S_IFDIR);
2202
2203 de = (struct ocfs2_dir_entry *) ((char *)de + le16_to_cpu(de->rec_len));
2204 de->inode = cpu_to_le64(OCFS2_I(parent)->ip_blkno);
2205 de->rec_len = cpu_to_le16(size - OCFS2_DIR_REC_LEN(1));
2206 de->name_len = 2;
2207 strcpy(de->name, "..");
2208 ocfs2_set_de_type(de, S_IFDIR);
Mark Fasheh87d35a72008-12-10 17:36:25 -08002209
2210 return de;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002211}
2212
2213/*
2214 * This works together with code in ocfs2_mknod_locked() which sets
2215 * the inline-data flag and initializes the inline-data section.
2216 */
2217static int ocfs2_fill_new_dir_id(struct ocfs2_super *osb,
2218 handle_t *handle,
2219 struct inode *parent,
2220 struct inode *inode,
2221 struct buffer_head *di_bh)
2222{
2223 int ret;
2224 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
2225 struct ocfs2_inline_data *data = &di->id2.i_data;
2226 unsigned int size = le16_to_cpu(data->id_count);
2227
Joel Becker0cf2f762009-02-12 16:41:25 -08002228 ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh,
Joel Becker13723d02008-10-17 19:25:01 -07002229 OCFS2_JOURNAL_ACCESS_WRITE);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002230 if (ret) {
2231 mlog_errno(ret);
2232 goto out;
2233 }
2234
2235 ocfs2_fill_initial_dirents(inode, parent, data->id_data, size);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002236 ocfs2_journal_dirty(handle, di_bh);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002237
2238 i_size_write(inode, size);
Miklos Szeredibfe86842011-10-28 14:13:29 +02002239 set_nlink(inode, 2);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002240 inode->i_blocks = ocfs2_inode_sector_count(inode);
2241
2242 ret = ocfs2_mark_inode_dirty(handle, inode, di_bh);
2243 if (ret < 0)
2244 mlog_errno(ret);
2245
2246out:
2247 return ret;
2248}
2249
2250static int ocfs2_fill_new_dir_el(struct ocfs2_super *osb,
2251 handle_t *handle,
2252 struct inode *parent,
2253 struct inode *inode,
2254 struct buffer_head *fe_bh,
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002255 struct ocfs2_alloc_context *data_ac,
2256 struct buffer_head **ret_new_bh)
Mark Fasheh316f4b92007-09-07 18:21:26 -07002257{
2258 int status;
Mark Fasheh87d35a72008-12-10 17:36:25 -08002259 unsigned int size = osb->sb->s_blocksize;
Mark Fasheh316f4b92007-09-07 18:21:26 -07002260 struct buffer_head *new_bh = NULL;
Mark Fasheh87d35a72008-12-10 17:36:25 -08002261 struct ocfs2_dir_entry *de;
Mark Fasheh316f4b92007-09-07 18:21:26 -07002262
Mark Fashehe7c17e42009-01-29 18:17:46 -08002263 if (ocfs2_new_dir_wants_trailer(inode))
Mark Fasheh87d35a72008-12-10 17:36:25 -08002264 size = ocfs2_dir_trailer_blk_off(parent->i_sb);
2265
Mark Fasheh316f4b92007-09-07 18:21:26 -07002266 status = ocfs2_do_extend_dir(osb->sb, handle, inode, fe_bh,
2267 data_ac, NULL, &new_bh);
2268 if (status < 0) {
2269 mlog_errno(status);
2270 goto bail;
2271 }
2272
Joel Becker8cb471e2009-02-10 20:00:41 -08002273 ocfs2_set_new_buffer_uptodate(INODE_CACHE(inode), new_bh);
Mark Fasheh316f4b92007-09-07 18:21:26 -07002274
Joel Becker0cf2f762009-02-12 16:41:25 -08002275 status = ocfs2_journal_access_db(handle, INODE_CACHE(inode), new_bh,
Joel Becker13723d02008-10-17 19:25:01 -07002276 OCFS2_JOURNAL_ACCESS_CREATE);
Mark Fasheh316f4b92007-09-07 18:21:26 -07002277 if (status < 0) {
2278 mlog_errno(status);
2279 goto bail;
2280 }
2281 memset(new_bh->b_data, 0, osb->sb->s_blocksize);
2282
Mark Fasheh87d35a72008-12-10 17:36:25 -08002283 de = ocfs2_fill_initial_dirents(inode, parent, new_bh->b_data, size);
Mark Fashehe7c17e42009-01-29 18:17:46 -08002284 if (ocfs2_new_dir_wants_trailer(inode)) {
2285 int size = le16_to_cpu(de->rec_len);
2286
2287 /*
2288 * Figure out the size of the hole left over after
2289 * insertion of '.' and '..'. The trailer wants this
2290 * information.
2291 */
2292 size -= OCFS2_DIR_REC_LEN(2);
2293 size -= sizeof(struct ocfs2_dir_block_trailer);
2294
2295 ocfs2_init_dir_trailer(inode, new_bh, size);
2296 }
Mark Fasheh316f4b92007-09-07 18:21:26 -07002297
Joel Beckerec20cec2010-03-19 14:13:52 -07002298 ocfs2_journal_dirty(handle, new_bh);
Mark Fasheh316f4b92007-09-07 18:21:26 -07002299
2300 i_size_write(inode, inode->i_sb->s_blocksize);
Miklos Szeredibfe86842011-10-28 14:13:29 +02002301 set_nlink(inode, 2);
Mark Fasheh316f4b92007-09-07 18:21:26 -07002302 inode->i_blocks = ocfs2_inode_sector_count(inode);
2303 status = ocfs2_mark_inode_dirty(handle, inode, fe_bh);
2304 if (status < 0) {
2305 mlog_errno(status);
2306 goto bail;
2307 }
2308
2309 status = 0;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002310 if (ret_new_bh) {
2311 *ret_new_bh = new_bh;
2312 new_bh = NULL;
2313 }
Mark Fasheh316f4b92007-09-07 18:21:26 -07002314bail:
Mark Fasheha81cb882008-10-07 14:25:16 -07002315 brelse(new_bh);
Mark Fasheh316f4b92007-09-07 18:21:26 -07002316
Mark Fasheh316f4b92007-09-07 18:21:26 -07002317 return status;
2318}
2319
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002320static int ocfs2_dx_dir_attach_index(struct ocfs2_super *osb,
2321 handle_t *handle, struct inode *dir,
2322 struct buffer_head *di_bh,
Mark Fashehe7c17e42009-01-29 18:17:46 -08002323 struct buffer_head *dirdata_bh,
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002324 struct ocfs2_alloc_context *meta_ac,
Mark Fashehe3a93c22009-02-17 15:29:35 -08002325 int dx_inline, u32 num_entries,
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002326 struct buffer_head **ret_dx_root_bh)
2327{
2328 int ret;
2329 struct ocfs2_dinode *di = (struct ocfs2_dinode *) di_bh->b_data;
2330 u16 dr_suballoc_bit;
Joel Becker2b6cb572010-03-26 10:09:15 +08002331 u64 suballoc_loc, dr_blkno;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002332 unsigned int num_bits;
2333 struct buffer_head *dx_root_bh = NULL;
2334 struct ocfs2_dx_root_block *dx_root;
Mark Fashehe7c17e42009-01-29 18:17:46 -08002335 struct ocfs2_dir_block_trailer *trailer =
2336 ocfs2_trailer_from_bh(dirdata_bh, dir->i_sb);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002337
Joel Becker2b6cb572010-03-26 10:09:15 +08002338 ret = ocfs2_claim_metadata(handle, meta_ac, 1, &suballoc_loc,
2339 &dr_suballoc_bit, &num_bits, &dr_blkno);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002340 if (ret) {
2341 mlog_errno(ret);
2342 goto out;
2343 }
2344
Tao Maf1088d42011-02-23 22:30:23 +08002345 trace_ocfs2_dx_dir_attach_index(
2346 (unsigned long long)OCFS2_I(dir)->ip_blkno,
2347 (unsigned long long)dr_blkno);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002348
2349 dx_root_bh = sb_getblk(osb->sb, dr_blkno);
2350 if (dx_root_bh == NULL) {
Rui Xiang7391a292013-11-12 15:06:54 -08002351 ret = -ENOMEM;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002352 goto out;
2353 }
Joel Becker8cb471e2009-02-10 20:00:41 -08002354 ocfs2_set_new_buffer_uptodate(INODE_CACHE(dir), dx_root_bh);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002355
Joel Becker0cf2f762009-02-12 16:41:25 -08002356 ret = ocfs2_journal_access_dr(handle, INODE_CACHE(dir), dx_root_bh,
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002357 OCFS2_JOURNAL_ACCESS_CREATE);
2358 if (ret < 0) {
2359 mlog_errno(ret);
2360 goto out;
2361 }
2362
2363 dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data;
2364 memset(dx_root, 0, osb->sb->s_blocksize);
2365 strcpy(dx_root->dr_signature, OCFS2_DX_ROOT_SIGNATURE);
Tiger Yangb89c5422010-01-25 14:11:06 +08002366 dx_root->dr_suballoc_slot = cpu_to_le16(meta_ac->ac_alloc_slot);
Joel Becker2b6cb572010-03-26 10:09:15 +08002367 dx_root->dr_suballoc_loc = cpu_to_le64(suballoc_loc);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002368 dx_root->dr_suballoc_bit = cpu_to_le16(dr_suballoc_bit);
2369 dx_root->dr_fs_generation = cpu_to_le32(osb->fs_generation);
2370 dx_root->dr_blkno = cpu_to_le64(dr_blkno);
2371 dx_root->dr_dir_blkno = cpu_to_le64(OCFS2_I(dir)->ip_blkno);
Mark Fashehe3a93c22009-02-17 15:29:35 -08002372 dx_root->dr_num_entries = cpu_to_le32(num_entries);
Mark Fashehe7c17e42009-01-29 18:17:46 -08002373 if (le16_to_cpu(trailer->db_free_rec_len))
2374 dx_root->dr_free_blk = cpu_to_le64(dirdata_bh->b_blocknr);
2375 else
2376 dx_root->dr_free_blk = cpu_to_le64(0);
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08002377
2378 if (dx_inline) {
2379 dx_root->dr_flags |= OCFS2_DX_FLAG_INLINE;
2380 dx_root->dr_entries.de_count =
2381 cpu_to_le16(ocfs2_dx_entries_per_root(osb->sb));
2382 } else {
2383 dx_root->dr_list.l_count =
2384 cpu_to_le16(ocfs2_extent_recs_per_dx_root(osb->sb));
2385 }
Joel Beckerec20cec2010-03-19 14:13:52 -07002386 ocfs2_journal_dirty(handle, dx_root_bh);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002387
Joel Becker0cf2f762009-02-12 16:41:25 -08002388 ret = ocfs2_journal_access_di(handle, INODE_CACHE(dir), di_bh,
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002389 OCFS2_JOURNAL_ACCESS_CREATE);
2390 if (ret) {
2391 mlog_errno(ret);
2392 goto out;
2393 }
2394
2395 di->i_dx_root = cpu_to_le64(dr_blkno);
2396
Tao Ma8ac33dc2010-12-15 16:30:00 +08002397 spin_lock(&OCFS2_I(dir)->ip_lock);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002398 OCFS2_I(dir)->ip_dyn_features |= OCFS2_INDEXED_DIR_FL;
2399 di->i_dyn_features = cpu_to_le16(OCFS2_I(dir)->ip_dyn_features);
Tao Ma8ac33dc2010-12-15 16:30:00 +08002400 spin_unlock(&OCFS2_I(dir)->ip_lock);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002401
Joel Beckerec20cec2010-03-19 14:13:52 -07002402 ocfs2_journal_dirty(handle, di_bh);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002403
2404 *ret_dx_root_bh = dx_root_bh;
2405 dx_root_bh = NULL;
2406
2407out:
2408 brelse(dx_root_bh);
2409 return ret;
2410}
2411
2412static int ocfs2_dx_dir_format_cluster(struct ocfs2_super *osb,
2413 handle_t *handle, struct inode *dir,
2414 struct buffer_head **dx_leaves,
2415 int num_dx_leaves, u64 start_blk)
2416{
2417 int ret, i;
2418 struct ocfs2_dx_leaf *dx_leaf;
2419 struct buffer_head *bh;
2420
2421 for (i = 0; i < num_dx_leaves; i++) {
2422 bh = sb_getblk(osb->sb, start_blk + i);
2423 if (bh == NULL) {
Rui Xiang7391a292013-11-12 15:06:54 -08002424 ret = -ENOMEM;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002425 goto out;
2426 }
2427 dx_leaves[i] = bh;
2428
Joel Becker8cb471e2009-02-10 20:00:41 -08002429 ocfs2_set_new_buffer_uptodate(INODE_CACHE(dir), bh);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002430
Joel Becker0cf2f762009-02-12 16:41:25 -08002431 ret = ocfs2_journal_access_dl(handle, INODE_CACHE(dir), bh,
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002432 OCFS2_JOURNAL_ACCESS_CREATE);
2433 if (ret < 0) {
2434 mlog_errno(ret);
2435 goto out;
2436 }
2437
2438 dx_leaf = (struct ocfs2_dx_leaf *) bh->b_data;
2439
2440 memset(dx_leaf, 0, osb->sb->s_blocksize);
2441 strcpy(dx_leaf->dl_signature, OCFS2_DX_LEAF_SIGNATURE);
2442 dx_leaf->dl_fs_generation = cpu_to_le32(osb->fs_generation);
2443 dx_leaf->dl_blkno = cpu_to_le64(bh->b_blocknr);
2444 dx_leaf->dl_list.de_count =
2445 cpu_to_le16(ocfs2_dx_entries_per_leaf(osb->sb));
2446
Tao Maf1088d42011-02-23 22:30:23 +08002447 trace_ocfs2_dx_dir_format_cluster(
2448 (unsigned long long)OCFS2_I(dir)->ip_blkno,
2449 (unsigned long long)bh->b_blocknr,
2450 le16_to_cpu(dx_leaf->dl_list.de_count));
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002451
2452 ocfs2_journal_dirty(handle, bh);
2453 }
2454
2455 ret = 0;
2456out:
2457 return ret;
2458}
2459
2460/*
2461 * Allocates and formats a new cluster for use in an indexed dir
2462 * leaf. This version will not do the extent insert, so that it can be
2463 * used by operations which need careful ordering.
2464 */
2465static int __ocfs2_dx_dir_new_cluster(struct inode *dir,
2466 u32 cpos, handle_t *handle,
2467 struct ocfs2_alloc_context *data_ac,
2468 struct buffer_head **dx_leaves,
2469 int num_dx_leaves, u64 *ret_phys_blkno)
2470{
2471 int ret;
2472 u32 phys, num;
2473 u64 phys_blkno;
2474 struct ocfs2_super *osb = OCFS2_SB(dir->i_sb);
2475
2476 /*
2477 * XXX: For create, this should claim cluster for the index
2478 * *before* the unindexed insert so that we have a better
2479 * chance of contiguousness as the directory grows in number
2480 * of entries.
2481 */
Joel Becker1ed9b772010-05-06 13:59:06 +08002482 ret = __ocfs2_claim_clusters(handle, data_ac, 1, 1, &phys, &num);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002483 if (ret) {
2484 mlog_errno(ret);
2485 goto out;
2486 }
2487
2488 /*
2489 * Format the new cluster first. That way, we're inserting
2490 * valid data.
2491 */
2492 phys_blkno = ocfs2_clusters_to_blocks(osb->sb, phys);
2493 ret = ocfs2_dx_dir_format_cluster(osb, handle, dir, dx_leaves,
2494 num_dx_leaves, phys_blkno);
2495 if (ret) {
2496 mlog_errno(ret);
2497 goto out;
2498 }
2499
2500 *ret_phys_blkno = phys_blkno;
2501out:
2502 return ret;
2503}
2504
2505static int ocfs2_dx_dir_new_cluster(struct inode *dir,
2506 struct ocfs2_extent_tree *et,
2507 u32 cpos, handle_t *handle,
2508 struct ocfs2_alloc_context *data_ac,
2509 struct ocfs2_alloc_context *meta_ac,
2510 struct buffer_head **dx_leaves,
2511 int num_dx_leaves)
2512{
2513 int ret;
2514 u64 phys_blkno;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002515
2516 ret = __ocfs2_dx_dir_new_cluster(dir, cpos, handle, data_ac, dx_leaves,
2517 num_dx_leaves, &phys_blkno);
2518 if (ret) {
2519 mlog_errno(ret);
2520 goto out;
2521 }
2522
Joel Beckercc79d8c2009-02-13 03:24:43 -08002523 ret = ocfs2_insert_extent(handle, et, cpos, phys_blkno, 1, 0,
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002524 meta_ac);
2525 if (ret)
2526 mlog_errno(ret);
2527out:
2528 return ret;
2529}
2530
2531static struct buffer_head **ocfs2_dx_dir_kmalloc_leaves(struct super_block *sb,
2532 int *ret_num_leaves)
2533{
2534 int num_dx_leaves = ocfs2_clusters_to_blocks(sb, 1);
2535 struct buffer_head **dx_leaves;
2536
2537 dx_leaves = kcalloc(num_dx_leaves, sizeof(struct buffer_head *),
2538 GFP_NOFS);
2539 if (dx_leaves && ret_num_leaves)
2540 *ret_num_leaves = num_dx_leaves;
2541
2542 return dx_leaves;
2543}
2544
2545static int ocfs2_fill_new_dir_dx(struct ocfs2_super *osb,
2546 handle_t *handle,
2547 struct inode *parent,
2548 struct inode *inode,
2549 struct buffer_head *di_bh,
2550 struct ocfs2_alloc_context *data_ac,
2551 struct ocfs2_alloc_context *meta_ac)
2552{
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08002553 int ret;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002554 struct buffer_head *leaf_bh = NULL;
2555 struct buffer_head *dx_root_bh = NULL;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002556 struct ocfs2_dx_hinfo hinfo;
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08002557 struct ocfs2_dx_root_block *dx_root;
2558 struct ocfs2_dx_entry_list *entry_list;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002559
2560 /*
2561 * Our strategy is to create the directory as though it were
2562 * unindexed, then add the index block. This works with very
2563 * little complication since the state of a new directory is a
2564 * very well known quantity.
2565 *
2566 * Essentially, we have two dirents ("." and ".."), in the 1st
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08002567 * block which need indexing. These are easily inserted into
2568 * the index block.
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002569 */
2570
2571 ret = ocfs2_fill_new_dir_el(osb, handle, parent, inode, di_bh,
2572 data_ac, &leaf_bh);
2573 if (ret) {
2574 mlog_errno(ret);
2575 goto out;
2576 }
2577
Mark Fashehe7c17e42009-01-29 18:17:46 -08002578 ret = ocfs2_dx_dir_attach_index(osb, handle, inode, di_bh, leaf_bh,
Mark Fashehe3a93c22009-02-17 15:29:35 -08002579 meta_ac, 1, 2, &dx_root_bh);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002580 if (ret) {
2581 mlog_errno(ret);
2582 goto out;
2583 }
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08002584 dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data;
2585 entry_list = &dx_root->dr_entries;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002586
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08002587 /* Buffer has been journaled for us by ocfs2_dx_dir_attach_index */
Mark Fashehe7c17e42009-01-29 18:17:46 -08002588 ocfs2_dx_dir_name_hash(inode, ".", 1, &hinfo);
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08002589 ocfs2_dx_entry_list_insert(entry_list, &hinfo, leaf_bh->b_blocknr);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002590
2591 ocfs2_dx_dir_name_hash(inode, "..", 2, &hinfo);
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08002592 ocfs2_dx_entry_list_insert(entry_list, &hinfo, leaf_bh->b_blocknr);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002593
2594out:
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002595 brelse(dx_root_bh);
2596 brelse(leaf_bh);
2597 return ret;
2598}
2599
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002600int ocfs2_fill_new_dir(struct ocfs2_super *osb,
2601 handle_t *handle,
2602 struct inode *parent,
2603 struct inode *inode,
2604 struct buffer_head *fe_bh,
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002605 struct ocfs2_alloc_context *data_ac,
2606 struct ocfs2_alloc_context *meta_ac)
2607
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002608{
2609 BUG_ON(!ocfs2_supports_inline_data(osb) && data_ac == NULL);
2610
2611 if (OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_DATA_FL)
2612 return ocfs2_fill_new_dir_id(osb, handle, parent, inode, fe_bh);
2613
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002614 if (ocfs2_supports_indexed_dirs(osb))
2615 return ocfs2_fill_new_dir_dx(osb, handle, parent, inode, fe_bh,
2616 data_ac, meta_ac);
2617
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002618 return ocfs2_fill_new_dir_el(osb, handle, parent, inode, fe_bh,
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002619 data_ac, NULL);
2620}
2621
2622static int ocfs2_dx_dir_index_block(struct inode *dir,
2623 handle_t *handle,
2624 struct buffer_head **dx_leaves,
2625 int num_dx_leaves,
Mark Fashehe3a93c22009-02-17 15:29:35 -08002626 u32 *num_dx_entries,
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002627 struct buffer_head *dirent_bh)
2628{
Tao Ma0fba8132009-03-19 05:08:43 +08002629 int ret = 0, namelen, i;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002630 char *de_buf, *limit;
2631 struct ocfs2_dir_entry *de;
2632 struct buffer_head *dx_leaf_bh;
2633 struct ocfs2_dx_hinfo hinfo;
2634 u64 dirent_blk = dirent_bh->b_blocknr;
2635
2636 de_buf = dirent_bh->b_data;
2637 limit = de_buf + dir->i_sb->s_blocksize;
2638
2639 while (de_buf < limit) {
2640 de = (struct ocfs2_dir_entry *)de_buf;
2641
2642 namelen = de->name_len;
2643 if (!namelen || !de->inode)
2644 goto inc;
2645
2646 ocfs2_dx_dir_name_hash(dir, de->name, namelen, &hinfo);
2647
2648 i = ocfs2_dx_dir_hash_idx(OCFS2_SB(dir->i_sb), &hinfo);
2649 dx_leaf_bh = dx_leaves[i];
2650
2651 ret = __ocfs2_dx_dir_leaf_insert(dir, handle, &hinfo,
2652 dirent_blk, dx_leaf_bh);
2653 if (ret) {
2654 mlog_errno(ret);
2655 goto out;
2656 }
2657
Mark Fashehe3a93c22009-02-17 15:29:35 -08002658 *num_dx_entries = *num_dx_entries + 1;
2659
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002660inc:
2661 de_buf += le16_to_cpu(de->rec_len);
2662 }
2663
2664out:
2665 return ret;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002666}
Mark Fashehe7c17e42009-01-29 18:17:46 -08002667
2668/*
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08002669 * XXX: This expects dx_root_bh to already be part of the transaction.
2670 */
2671static void ocfs2_dx_dir_index_root_block(struct inode *dir,
2672 struct buffer_head *dx_root_bh,
2673 struct buffer_head *dirent_bh)
2674{
2675 char *de_buf, *limit;
2676 struct ocfs2_dx_root_block *dx_root;
2677 struct ocfs2_dir_entry *de;
2678 struct ocfs2_dx_hinfo hinfo;
2679 u64 dirent_blk = dirent_bh->b_blocknr;
2680
2681 dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data;
2682
2683 de_buf = dirent_bh->b_data;
2684 limit = de_buf + dir->i_sb->s_blocksize;
2685
2686 while (de_buf < limit) {
2687 de = (struct ocfs2_dir_entry *)de_buf;
2688
2689 if (!de->name_len || !de->inode)
2690 goto inc;
2691
2692 ocfs2_dx_dir_name_hash(dir, de->name, de->name_len, &hinfo);
2693
Tao Maf1088d42011-02-23 22:30:23 +08002694 trace_ocfs2_dx_dir_index_root_block(
2695 (unsigned long long)dir->i_ino,
2696 hinfo.major_hash, hinfo.minor_hash,
2697 de->name_len, de->name,
2698 le16_to_cpu(dx_root->dr_entries.de_num_used));
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08002699
2700 ocfs2_dx_entry_list_insert(&dx_root->dr_entries, &hinfo,
2701 dirent_blk);
Mark Fashehe3a93c22009-02-17 15:29:35 -08002702
2703 le32_add_cpu(&dx_root->dr_num_entries, 1);
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08002704inc:
2705 de_buf += le16_to_cpu(de->rec_len);
2706 }
2707}
2708
2709/*
2710 * Count the number of inline directory entries in di_bh and compare
2711 * them against the number of entries we can hold in an inline dx root
2712 * block.
2713 */
2714static int ocfs2_new_dx_should_be_inline(struct inode *dir,
2715 struct buffer_head *di_bh)
2716{
2717 int dirent_count = 0;
2718 char *de_buf, *limit;
2719 struct ocfs2_dir_entry *de;
2720 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
2721
2722 de_buf = di->id2.i_data.id_data;
2723 limit = de_buf + i_size_read(dir);
2724
2725 while (de_buf < limit) {
2726 de = (struct ocfs2_dir_entry *)de_buf;
2727
2728 if (de->name_len && de->inode)
2729 dirent_count++;
2730
2731 de_buf += le16_to_cpu(de->rec_len);
2732 }
2733
2734 /* We are careful to leave room for one extra record. */
2735 return dirent_count < ocfs2_dx_entries_per_root(dir->i_sb);
2736}
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002737
Mark Fasheh87d35a72008-12-10 17:36:25 -08002738/*
2739 * Expand rec_len of the rightmost dirent in a directory block so that it
2740 * contains the end of our valid space for dirents. We do this during
2741 * expansion from an inline directory to one with extents. The first dir block
2742 * in that case is taken from the inline data portion of the inode block.
2743 *
Mark Fashehe7c17e42009-01-29 18:17:46 -08002744 * This will also return the largest amount of contiguous space for a dirent
2745 * in the block. That value is *not* necessarily the last dirent, even after
2746 * expansion. The directory indexing code wants this value for free space
2747 * accounting. We do this here since we're already walking the entire dir
2748 * block.
2749 *
Mark Fasheh87d35a72008-12-10 17:36:25 -08002750 * We add the dir trailer if this filesystem wants it.
2751 */
Mark Fashehe7c17e42009-01-29 18:17:46 -08002752static unsigned int ocfs2_expand_last_dirent(char *start, unsigned int old_size,
2753 struct inode *dir)
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002754{
Mark Fashehe7c17e42009-01-29 18:17:46 -08002755 struct super_block *sb = dir->i_sb;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002756 struct ocfs2_dir_entry *de;
2757 struct ocfs2_dir_entry *prev_de;
2758 char *de_buf, *limit;
Mark Fasheh87d35a72008-12-10 17:36:25 -08002759 unsigned int new_size = sb->s_blocksize;
Mark Fashehe7c17e42009-01-29 18:17:46 -08002760 unsigned int bytes, this_hole;
2761 unsigned int largest_hole = 0;
Mark Fasheh87d35a72008-12-10 17:36:25 -08002762
Mark Fashehe7c17e42009-01-29 18:17:46 -08002763 if (ocfs2_new_dir_wants_trailer(dir))
Mark Fasheh87d35a72008-12-10 17:36:25 -08002764 new_size = ocfs2_dir_trailer_blk_off(sb);
2765
2766 bytes = new_size - old_size;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002767
2768 limit = start + old_size;
2769 de_buf = start;
2770 de = (struct ocfs2_dir_entry *)de_buf;
2771 do {
Mark Fashehe7c17e42009-01-29 18:17:46 -08002772 this_hole = ocfs2_figure_dirent_hole(de);
2773 if (this_hole > largest_hole)
2774 largest_hole = this_hole;
2775
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002776 prev_de = de;
2777 de_buf += le16_to_cpu(de->rec_len);
2778 de = (struct ocfs2_dir_entry *)de_buf;
2779 } while (de_buf < limit);
2780
2781 le16_add_cpu(&prev_de->rec_len, bytes);
Mark Fashehe7c17e42009-01-29 18:17:46 -08002782
2783 /* We need to double check this after modification of the final
2784 * dirent. */
2785 this_hole = ocfs2_figure_dirent_hole(prev_de);
2786 if (this_hole > largest_hole)
2787 largest_hole = this_hole;
2788
2789 if (largest_hole >= OCFS2_DIR_MIN_REC_LEN)
2790 return largest_hole;
2791 return 0;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002792}
2793
2794/*
2795 * We allocate enough clusters to fulfill "blocks_wanted", but set
2796 * i_size to exactly one block. Ocfs2_extend_dir() will handle the
2797 * rest automatically for us.
2798 *
2799 * *first_block_bh is a pointer to the 1st data block allocated to the
2800 * directory.
2801 */
2802static int ocfs2_expand_inline_dir(struct inode *dir, struct buffer_head *di_bh,
2803 unsigned int blocks_wanted,
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002804 struct ocfs2_dir_lookup_result *lookup,
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002805 struct buffer_head **first_block_bh)
2806{
Mark Fashehe3a93c22009-02-17 15:29:35 -08002807 u32 alloc, dx_alloc, bit_off, len, num_dx_entries = 0;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002808 struct super_block *sb = dir->i_sb;
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08002809 int ret, i, num_dx_leaves = 0, dx_inline = 0,
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002810 credits = ocfs2_inline_to_extents_credits(sb);
2811 u64 dx_insert_blkno, blkno,
2812 bytes = blocks_wanted << sb->s_blocksize_bits;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002813 struct ocfs2_super *osb = OCFS2_SB(dir->i_sb);
2814 struct ocfs2_inode_info *oi = OCFS2_I(dir);
Marcus Meissner5d446702011-05-05 10:44:11 -07002815 struct ocfs2_alloc_context *data_ac = NULL;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002816 struct ocfs2_alloc_context *meta_ac = NULL;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002817 struct buffer_head *dirdata_bh = NULL;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002818 struct buffer_head *dx_root_bh = NULL;
2819 struct buffer_head **dx_leaves = NULL;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002820 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
2821 handle_t *handle;
Joel Beckerf99b9b72008-08-20 19:36:33 -07002822 struct ocfs2_extent_tree et;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002823 struct ocfs2_extent_tree dx_et;
2824 int did_quota = 0, bytes_allocated = 0;
Joel Beckerf99b9b72008-08-20 19:36:33 -07002825
Joel Becker5e404e92009-02-13 03:54:22 -08002826 ocfs2_init_dinode_extent_tree(&et, INODE_CACHE(dir), di_bh);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002827
2828 alloc = ocfs2_clusters_for_bytes(sb, bytes);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002829 dx_alloc = 0;
2830
Jan Karaedd45c02009-06-02 14:24:03 +02002831 down_write(&oi->ip_alloc_sem);
2832
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002833 if (ocfs2_supports_indexed_dirs(osb)) {
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002834 credits += ocfs2_add_dir_index_credits(sb);
2835
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08002836 dx_inline = ocfs2_new_dx_should_be_inline(dir, di_bh);
2837 if (!dx_inline) {
2838 /* Add one more cluster for an index leaf */
2839 dx_alloc++;
2840 dx_leaves = ocfs2_dx_dir_kmalloc_leaves(sb,
2841 &num_dx_leaves);
2842 if (!dx_leaves) {
2843 ret = -ENOMEM;
2844 mlog_errno(ret);
2845 goto out;
2846 }
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002847 }
2848
2849 /* This gets us the dx_root */
2850 ret = ocfs2_reserve_new_metadata_blocks(osb, 1, &meta_ac);
2851 if (ret) {
2852 mlog_errno(ret);
2853 goto out;
2854 }
2855 }
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002856
2857 /*
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002858 * We should never need more than 2 clusters for the unindexed
2859 * tree - maximum dirent size is far less than one block. In
2860 * fact, the only time we'd need more than one cluster is if
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002861 * blocksize == clustersize and the dirent won't fit in the
2862 * extra space that the expansion to a single block gives. As
2863 * of today, that only happens on 4k/4k file systems.
2864 */
2865 BUG_ON(alloc > 2);
2866
Tao Ma035a5712009-04-07 07:40:57 +08002867 ret = ocfs2_reserve_clusters(osb, alloc + dx_alloc, &data_ac);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002868 if (ret) {
2869 mlog_errno(ret);
2870 goto out;
2871 }
2872
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002873 /*
Joe Perchesc78bad12008-02-03 17:33:42 +02002874 * Prepare for worst case allocation scenario of two separate
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002875 * extents in the unindexed tree.
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002876 */
2877 if (alloc == 2)
2878 credits += OCFS2_SUBALLOC_ALLOC;
2879
2880 handle = ocfs2_start_trans(osb, credits);
2881 if (IS_ERR(handle)) {
2882 ret = PTR_ERR(handle);
2883 mlog_errno(ret);
Jan Karaedd45c02009-06-02 14:24:03 +02002884 goto out;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002885 }
2886
Christoph Hellwig5dd40562010-03-03 09:05:00 -05002887 ret = dquot_alloc_space_nodirty(dir,
2888 ocfs2_clusters_to_bytes(osb->sb, alloc + dx_alloc));
2889 if (ret)
Jan Karaa90714c2008-10-09 19:38:40 +02002890 goto out_commit;
Jan Karaa90714c2008-10-09 19:38:40 +02002891 did_quota = 1;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002892
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08002893 if (ocfs2_supports_indexed_dirs(osb) && !dx_inline) {
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002894 /*
2895 * Allocate our index cluster first, to maximize the
2896 * possibility that unindexed leaves grow
2897 * contiguously.
2898 */
2899 ret = __ocfs2_dx_dir_new_cluster(dir, 0, handle, data_ac,
2900 dx_leaves, num_dx_leaves,
2901 &dx_insert_blkno);
2902 if (ret) {
2903 mlog_errno(ret);
2904 goto out_commit;
2905 }
2906 bytes_allocated += ocfs2_clusters_to_bytes(dir->i_sb, 1);
2907 }
2908
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002909 /*
2910 * Try to claim as many clusters as the bitmap can give though
2911 * if we only get one now, that's enough to continue. The rest
2912 * will be claimed after the conversion to extents.
2913 */
Mark Fasheh83f92312010-04-05 18:17:16 -07002914 if (ocfs2_dir_resv_allowed(osb))
2915 data_ac->ac_resv = &oi->ip_la_data_resv;
Joel Becker1ed9b772010-05-06 13:59:06 +08002916 ret = ocfs2_claim_clusters(handle, data_ac, 1, &bit_off, &len);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002917 if (ret) {
2918 mlog_errno(ret);
2919 goto out_commit;
2920 }
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002921 bytes_allocated += ocfs2_clusters_to_bytes(dir->i_sb, 1);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002922
2923 /*
2924 * Operations are carefully ordered so that we set up the new
2925 * data block first. The conversion from inline data to
2926 * extents follows.
2927 */
2928 blkno = ocfs2_clusters_to_blocks(dir->i_sb, bit_off);
2929 dirdata_bh = sb_getblk(sb, blkno);
2930 if (!dirdata_bh) {
Rui Xiang7391a292013-11-12 15:06:54 -08002931 ret = -ENOMEM;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002932 mlog_errno(ret);
2933 goto out_commit;
2934 }
2935
Joel Becker8cb471e2009-02-10 20:00:41 -08002936 ocfs2_set_new_buffer_uptodate(INODE_CACHE(dir), dirdata_bh);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002937
Joel Becker0cf2f762009-02-12 16:41:25 -08002938 ret = ocfs2_journal_access_db(handle, INODE_CACHE(dir), dirdata_bh,
Joel Becker13723d02008-10-17 19:25:01 -07002939 OCFS2_JOURNAL_ACCESS_CREATE);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002940 if (ret) {
2941 mlog_errno(ret);
2942 goto out_commit;
2943 }
2944
2945 memcpy(dirdata_bh->b_data, di->id2.i_data.id_data, i_size_read(dir));
2946 memset(dirdata_bh->b_data + i_size_read(dir), 0,
2947 sb->s_blocksize - i_size_read(dir));
Mark Fashehe7c17e42009-01-29 18:17:46 -08002948 i = ocfs2_expand_last_dirent(dirdata_bh->b_data, i_size_read(dir), dir);
2949 if (ocfs2_new_dir_wants_trailer(dir)) {
2950 /*
2951 * Prepare the dir trailer up front. It will otherwise look
2952 * like a valid dirent. Even if inserting the index fails
2953 * (unlikely), then all we'll have done is given first dir
2954 * block a small amount of fragmentation.
2955 */
2956 ocfs2_init_dir_trailer(dir, dirdata_bh, i);
2957 }
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002958
Darrick J. Wong2931cdc2014-04-03 14:46:48 -07002959 ocfs2_update_inode_fsync_trans(handle, dir, 1);
Joel Beckerec20cec2010-03-19 14:13:52 -07002960 ocfs2_journal_dirty(handle, dirdata_bh);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002961
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08002962 if (ocfs2_supports_indexed_dirs(osb) && !dx_inline) {
2963 /*
2964 * Dx dirs with an external cluster need to do this up
2965 * front. Inline dx root's get handled later, after
Mark Fashehe3a93c22009-02-17 15:29:35 -08002966 * we've allocated our root block. We get passed back
2967 * a total number of items so that dr_num_entries can
2968 * be correctly set once the dx_root has been
2969 * allocated.
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08002970 */
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002971 ret = ocfs2_dx_dir_index_block(dir, handle, dx_leaves,
Mark Fashehe3a93c22009-02-17 15:29:35 -08002972 num_dx_leaves, &num_dx_entries,
2973 dirdata_bh);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08002974 if (ret) {
2975 mlog_errno(ret);
2976 goto out_commit;
2977 }
2978 }
2979
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002980 /*
2981 * Set extent, i_size, etc on the directory. After this, the
2982 * inode should contain the same exact dirents as before and
2983 * be fully accessible from system calls.
2984 *
2985 * We let the later dirent insert modify c/mtime - to the user
2986 * the data hasn't changed.
2987 */
Joel Becker0cf2f762009-02-12 16:41:25 -08002988 ret = ocfs2_journal_access_di(handle, INODE_CACHE(dir), di_bh,
Joel Becker13723d02008-10-17 19:25:01 -07002989 OCFS2_JOURNAL_ACCESS_CREATE);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07002990 if (ret) {
2991 mlog_errno(ret);
2992 goto out_commit;
2993 }
2994
2995 spin_lock(&oi->ip_lock);
2996 oi->ip_dyn_features &= ~OCFS2_INLINE_DATA_FL;
2997 di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features);
2998 spin_unlock(&oi->ip_lock);
2999
3000 ocfs2_dinode_new_extent_list(dir, di);
3001
3002 i_size_write(dir, sb->s_blocksize);
3003 dir->i_mtime = dir->i_ctime = CURRENT_TIME;
3004
3005 di->i_size = cpu_to_le64(sb->s_blocksize);
3006 di->i_ctime = di->i_mtime = cpu_to_le64(dir->i_ctime.tv_sec);
3007 di->i_ctime_nsec = di->i_mtime_nsec = cpu_to_le32(dir->i_ctime.tv_nsec);
Darrick J. Wong6fdb7022014-04-03 14:47:08 -07003008 ocfs2_update_inode_fsync_trans(handle, dir, 1);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003009
3010 /*
3011 * This should never fail as our extent list is empty and all
3012 * related blocks have been journaled already.
3013 */
Joel Beckercc79d8c2009-02-13 03:24:43 -08003014 ret = ocfs2_insert_extent(handle, &et, 0, blkno, len,
Joel Beckerf99b9b72008-08-20 19:36:33 -07003015 0, NULL);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003016 if (ret) {
3017 mlog_errno(ret);
Tao Ma83cab532008-08-21 14:14:27 +08003018 goto out_commit;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003019 }
3020
Mark Fasheh9780eb62008-08-05 11:32:46 -07003021 /*
3022 * Set i_blocks after the extent insert for the most up to
3023 * date ip_clusters value.
3024 */
3025 dir->i_blocks = ocfs2_inode_sector_count(dir);
3026
Joel Beckerec20cec2010-03-19 14:13:52 -07003027 ocfs2_journal_dirty(handle, di_bh);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003028
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003029 if (ocfs2_supports_indexed_dirs(osb)) {
3030 ret = ocfs2_dx_dir_attach_index(osb, handle, dir, di_bh,
Mark Fashehe7c17e42009-01-29 18:17:46 -08003031 dirdata_bh, meta_ac, dx_inline,
Mark Fashehe3a93c22009-02-17 15:29:35 -08003032 num_dx_entries, &dx_root_bh);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003033 if (ret) {
3034 mlog_errno(ret);
3035 goto out_commit;
3036 }
3037
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08003038 if (dx_inline) {
3039 ocfs2_dx_dir_index_root_block(dir, dx_root_bh,
3040 dirdata_bh);
3041 } else {
Joel Becker5e404e92009-02-13 03:54:22 -08003042 ocfs2_init_dx_root_extent_tree(&dx_et,
3043 INODE_CACHE(dir),
3044 dx_root_bh);
Joel Beckercc79d8c2009-02-13 03:24:43 -08003045 ret = ocfs2_insert_extent(handle, &dx_et, 0,
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08003046 dx_insert_blkno, 1, 0, NULL);
3047 if (ret)
3048 mlog_errno(ret);
3049 }
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003050 }
3051
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003052 /*
3053 * We asked for two clusters, but only got one in the 1st
3054 * pass. Claim the 2nd cluster as a separate extent.
3055 */
3056 if (alloc > len) {
Joel Becker1ed9b772010-05-06 13:59:06 +08003057 ret = ocfs2_claim_clusters(handle, data_ac, 1, &bit_off,
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003058 &len);
3059 if (ret) {
3060 mlog_errno(ret);
3061 goto out_commit;
3062 }
3063 blkno = ocfs2_clusters_to_blocks(dir->i_sb, bit_off);
3064
Joel Beckercc79d8c2009-02-13 03:24:43 -08003065 ret = ocfs2_insert_extent(handle, &et, 1,
Joel Beckerf99b9b72008-08-20 19:36:33 -07003066 blkno, len, 0, NULL);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003067 if (ret) {
3068 mlog_errno(ret);
Tao Ma83cab532008-08-21 14:14:27 +08003069 goto out_commit;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003070 }
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003071 bytes_allocated += ocfs2_clusters_to_bytes(dir->i_sb, 1);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003072 }
3073
3074 *first_block_bh = dirdata_bh;
3075 dirdata_bh = NULL;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003076 if (ocfs2_supports_indexed_dirs(osb)) {
3077 unsigned int off;
3078
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08003079 if (!dx_inline) {
3080 /*
3081 * We need to return the correct block within the
3082 * cluster which should hold our entry.
3083 */
3084 off = ocfs2_dx_dir_hash_idx(OCFS2_SB(dir->i_sb),
3085 &lookup->dl_hinfo);
3086 get_bh(dx_leaves[off]);
3087 lookup->dl_dx_leaf_bh = dx_leaves[off];
3088 }
3089 lookup->dl_dx_root_bh = dx_root_bh;
3090 dx_root_bh = NULL;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003091 }
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003092
3093out_commit:
Jan Karaa90714c2008-10-09 19:38:40 +02003094 if (ret < 0 && did_quota)
Christoph Hellwig5dd40562010-03-03 09:05:00 -05003095 dquot_free_space_nodirty(dir, bytes_allocated);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003096
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003097 ocfs2_commit_trans(osb, handle);
3098
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003099out:
Jan Karaedd45c02009-06-02 14:24:03 +02003100 up_write(&oi->ip_alloc_sem);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003101 if (data_ac)
3102 ocfs2_free_alloc_context(data_ac);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003103 if (meta_ac)
3104 ocfs2_free_alloc_context(meta_ac);
3105
3106 if (dx_leaves) {
3107 for (i = 0; i < num_dx_leaves; i++)
3108 brelse(dx_leaves[i]);
3109 kfree(dx_leaves);
3110 }
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003111
3112 brelse(dirdata_bh);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003113 brelse(dx_root_bh);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003114
3115 return ret;
3116}
3117
Mark Fashehccd979b2005-12-15 14:31:24 -08003118/* returns a bh of the 1st new block in the allocation. */
Mark Fasheh316f4b92007-09-07 18:21:26 -07003119static int ocfs2_do_extend_dir(struct super_block *sb,
3120 handle_t *handle,
3121 struct inode *dir,
3122 struct buffer_head *parent_fe_bh,
3123 struct ocfs2_alloc_context *data_ac,
3124 struct ocfs2_alloc_context *meta_ac,
3125 struct buffer_head **new_bh)
Mark Fashehccd979b2005-12-15 14:31:24 -08003126{
3127 int status;
Jan Karaa90714c2008-10-09 19:38:40 +02003128 int extend, did_quota = 0;
Mark Fasheh8110b072007-03-22 16:53:23 -07003129 u64 p_blkno, v_blkno;
Mark Fashehccd979b2005-12-15 14:31:24 -08003130
3131 spin_lock(&OCFS2_I(dir)->ip_lock);
3132 extend = (i_size_read(dir) == ocfs2_clusters_to_bytes(sb, OCFS2_I(dir)->ip_clusters));
3133 spin_unlock(&OCFS2_I(dir)->ip_lock);
3134
3135 if (extend) {
Mark Fashehdcd05382007-01-16 11:32:23 -08003136 u32 offset = OCFS2_I(dir)->ip_clusters;
3137
Christoph Hellwig5dd40562010-03-03 09:05:00 -05003138 status = dquot_alloc_space_nodirty(dir,
3139 ocfs2_clusters_to_bytes(sb, 1));
3140 if (status)
Jan Karaa90714c2008-10-09 19:38:40 +02003141 goto bail;
Jan Karaa90714c2008-10-09 19:38:40 +02003142 did_quota = 1;
3143
Tao Ma0eb8d472008-08-18 17:38:45 +08003144 status = ocfs2_add_inode_data(OCFS2_SB(sb), dir, &offset,
3145 1, 0, parent_fe_bh, handle,
3146 data_ac, meta_ac, NULL);
Mark Fashehccd979b2005-12-15 14:31:24 -08003147 BUG_ON(status == -EAGAIN);
3148 if (status < 0) {
3149 mlog_errno(status);
3150 goto bail;
3151 }
3152 }
3153
Mark Fasheh8110b072007-03-22 16:53:23 -07003154 v_blkno = ocfs2_blocks_for_bytes(sb, i_size_read(dir));
3155 status = ocfs2_extent_map_get_blocks(dir, v_blkno, &p_blkno, NULL, NULL);
Mark Fashehccd979b2005-12-15 14:31:24 -08003156 if (status < 0) {
3157 mlog_errno(status);
3158 goto bail;
3159 }
3160
3161 *new_bh = sb_getblk(sb, p_blkno);
3162 if (!*new_bh) {
Rui Xiang7391a292013-11-12 15:06:54 -08003163 status = -ENOMEM;
Mark Fashehccd979b2005-12-15 14:31:24 -08003164 mlog_errno(status);
3165 goto bail;
3166 }
3167 status = 0;
3168bail:
Jan Karaa90714c2008-10-09 19:38:40 +02003169 if (did_quota && status < 0)
Christoph Hellwig5dd40562010-03-03 09:05:00 -05003170 dquot_free_space_nodirty(dir, ocfs2_clusters_to_bytes(sb, 1));
Mark Fashehccd979b2005-12-15 14:31:24 -08003171 return status;
3172}
3173
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003174/*
3175 * Assumes you already have a cluster lock on the directory.
3176 *
3177 * 'blocks_wanted' is only used if we have an inline directory which
3178 * is to be turned into an extent based one. The size of the dirent to
3179 * insert might be larger than the space gained by growing to just one
3180 * block, so we may have to grow the inode by two blocks in that case.
Mark Fashehe7c17e42009-01-29 18:17:46 -08003181 *
3182 * If the directory is already indexed, dx_root_bh must be provided.
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003183 */
Mark Fashehccd979b2005-12-15 14:31:24 -08003184static int ocfs2_extend_dir(struct ocfs2_super *osb,
3185 struct inode *dir,
3186 struct buffer_head *parent_fe_bh,
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003187 unsigned int blocks_wanted,
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003188 struct ocfs2_dir_lookup_result *lookup,
Mark Fashehccd979b2005-12-15 14:31:24 -08003189 struct buffer_head **new_de_bh)
3190{
3191 int status = 0;
Joel Beckeree19a772007-03-28 18:27:07 -07003192 int credits, num_free_extents, drop_alloc_sem = 0;
Mark Fashehccd979b2005-12-15 14:31:24 -08003193 loff_t dir_i_size;
3194 struct ocfs2_dinode *fe = (struct ocfs2_dinode *) parent_fe_bh->b_data;
Tao Ma811f9332008-08-18 17:38:43 +08003195 struct ocfs2_extent_list *el = &fe->id2.i_list;
Mark Fashehccd979b2005-12-15 14:31:24 -08003196 struct ocfs2_alloc_context *data_ac = NULL;
3197 struct ocfs2_alloc_context *meta_ac = NULL;
Mark Fasheh1fabe142006-10-09 18:11:45 -07003198 handle_t *handle = NULL;
Mark Fashehccd979b2005-12-15 14:31:24 -08003199 struct buffer_head *new_bh = NULL;
3200 struct ocfs2_dir_entry * de;
3201 struct super_block *sb = osb->sb;
Joel Beckerf99b9b72008-08-20 19:36:33 -07003202 struct ocfs2_extent_tree et;
Mark Fashehe7c17e42009-01-29 18:17:46 -08003203 struct buffer_head *dx_root_bh = lookup->dl_dx_root_bh;
Mark Fashehccd979b2005-12-15 14:31:24 -08003204
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003205 if (OCFS2_I(dir)->ip_dyn_features & OCFS2_INLINE_DATA_FL) {
Mark Fashehe7c17e42009-01-29 18:17:46 -08003206 /*
3207 * This would be a code error as an inline directory should
3208 * never have an index root.
3209 */
3210 BUG_ON(dx_root_bh);
3211
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003212 status = ocfs2_expand_inline_dir(dir, parent_fe_bh,
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003213 blocks_wanted, lookup,
3214 &new_bh);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003215 if (status) {
3216 mlog_errno(status);
3217 goto bail;
3218 }
3219
Mark Fashehe7c17e42009-01-29 18:17:46 -08003220 /* Expansion from inline to an indexed directory will
3221 * have given us this. */
3222 dx_root_bh = lookup->dl_dx_root_bh;
3223
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003224 if (blocks_wanted == 1) {
3225 /*
3226 * If the new dirent will fit inside the space
3227 * created by pushing out to one block, then
3228 * we can complete the operation
3229 * here. Otherwise we have to expand i_size
3230 * and format the 2nd block below.
3231 */
3232 BUG_ON(new_bh == NULL);
3233 goto bail_bh;
3234 }
3235
3236 /*
3237 * Get rid of 'new_bh' - we want to format the 2nd
3238 * data block and return that instead.
3239 */
3240 brelse(new_bh);
3241 new_bh = NULL;
3242
Jan Karaedd45c02009-06-02 14:24:03 +02003243 down_write(&OCFS2_I(dir)->ip_alloc_sem);
3244 drop_alloc_sem = 1;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003245 dir_i_size = i_size_read(dir);
3246 credits = OCFS2_SIMPLE_DIR_EXTEND_CREDITS;
3247 goto do_extend;
3248 }
3249
Jan Karaedd45c02009-06-02 14:24:03 +02003250 down_write(&OCFS2_I(dir)->ip_alloc_sem);
3251 drop_alloc_sem = 1;
Mark Fashehccd979b2005-12-15 14:31:24 -08003252 dir_i_size = i_size_read(dir);
Tao Maf1088d42011-02-23 22:30:23 +08003253 trace_ocfs2_extend_dir((unsigned long long)OCFS2_I(dir)->ip_blkno,
3254 dir_i_size);
Mark Fashehccd979b2005-12-15 14:31:24 -08003255
Mark Fashehccd979b2005-12-15 14:31:24 -08003256 /* dir->i_size is always block aligned. */
3257 spin_lock(&OCFS2_I(dir)->ip_lock);
3258 if (dir_i_size == ocfs2_clusters_to_bytes(sb, OCFS2_I(dir)->ip_clusters)) {
3259 spin_unlock(&OCFS2_I(dir)->ip_lock);
Joel Becker5e404e92009-02-13 03:54:22 -08003260 ocfs2_init_dinode_extent_tree(&et, INODE_CACHE(dir),
3261 parent_fe_bh);
Joel Becker3d03a302009-02-12 17:49:26 -08003262 num_free_extents = ocfs2_num_free_extents(osb, &et);
Mark Fashehccd979b2005-12-15 14:31:24 -08003263 if (num_free_extents < 0) {
3264 status = num_free_extents;
3265 mlog_errno(status);
3266 goto bail;
3267 }
3268
3269 if (!num_free_extents) {
Tao Ma811f9332008-08-18 17:38:43 +08003270 status = ocfs2_reserve_new_metadata(osb, el, &meta_ac);
Mark Fashehccd979b2005-12-15 14:31:24 -08003271 if (status < 0) {
3272 if (status != -ENOSPC)
3273 mlog_errno(status);
3274 goto bail;
3275 }
3276 }
3277
Mark Fashehda5cbf22006-10-06 18:34:35 -07003278 status = ocfs2_reserve_clusters(osb, 1, &data_ac);
Mark Fashehccd979b2005-12-15 14:31:24 -08003279 if (status < 0) {
3280 if (status != -ENOSPC)
3281 mlog_errno(status);
3282 goto bail;
3283 }
3284
Mark Fasheh83f92312010-04-05 18:17:16 -07003285 if (ocfs2_dir_resv_allowed(osb))
3286 data_ac->ac_resv = &OCFS2_I(dir)->ip_la_data_resv;
Mark Fashehe3b4a972009-12-07 13:16:07 -08003287
Goldwyn Rodrigues06f9da62013-11-12 15:06:52 -08003288 credits = ocfs2_calc_extend_credits(sb, el);
Mark Fashehccd979b2005-12-15 14:31:24 -08003289 } else {
3290 spin_unlock(&OCFS2_I(dir)->ip_lock);
3291 credits = OCFS2_SIMPLE_DIR_EXTEND_CREDITS;
3292 }
3293
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003294do_extend:
Mark Fashehe7c17e42009-01-29 18:17:46 -08003295 if (ocfs2_dir_indexed(dir))
3296 credits++; /* For attaching the new dirent block to the
3297 * dx_root */
3298
Mark Fasheh65eff9c2006-10-09 17:26:22 -07003299 handle = ocfs2_start_trans(osb, credits);
Mark Fashehccd979b2005-12-15 14:31:24 -08003300 if (IS_ERR(handle)) {
3301 status = PTR_ERR(handle);
3302 handle = NULL;
3303 mlog_errno(status);
3304 goto bail;
3305 }
3306
3307 status = ocfs2_do_extend_dir(osb->sb, handle, dir, parent_fe_bh,
3308 data_ac, meta_ac, &new_bh);
3309 if (status < 0) {
3310 mlog_errno(status);
3311 goto bail;
3312 }
3313
Joel Becker8cb471e2009-02-10 20:00:41 -08003314 ocfs2_set_new_buffer_uptodate(INODE_CACHE(dir), new_bh);
Mark Fashehccd979b2005-12-15 14:31:24 -08003315
Joel Becker0cf2f762009-02-12 16:41:25 -08003316 status = ocfs2_journal_access_db(handle, INODE_CACHE(dir), new_bh,
Joel Becker13723d02008-10-17 19:25:01 -07003317 OCFS2_JOURNAL_ACCESS_CREATE);
Mark Fashehccd979b2005-12-15 14:31:24 -08003318 if (status < 0) {
3319 mlog_errno(status);
3320 goto bail;
3321 }
3322 memset(new_bh->b_data, 0, sb->s_blocksize);
Mark Fasheh87d35a72008-12-10 17:36:25 -08003323
Mark Fashehccd979b2005-12-15 14:31:24 -08003324 de = (struct ocfs2_dir_entry *) new_bh->b_data;
3325 de->inode = 0;
Mark Fashehe7c17e42009-01-29 18:17:46 -08003326 if (ocfs2_supports_dir_trailer(dir)) {
Mark Fasheh87d35a72008-12-10 17:36:25 -08003327 de->rec_len = cpu_to_le16(ocfs2_dir_trailer_blk_off(sb));
Mark Fashehe7c17e42009-01-29 18:17:46 -08003328
3329 ocfs2_init_dir_trailer(dir, new_bh, le16_to_cpu(de->rec_len));
3330
3331 if (ocfs2_dir_indexed(dir)) {
3332 status = ocfs2_dx_dir_link_trailer(dir, handle,
3333 dx_root_bh, new_bh);
3334 if (status) {
3335 mlog_errno(status);
3336 goto bail;
3337 }
3338 }
Mark Fasheh87d35a72008-12-10 17:36:25 -08003339 } else {
3340 de->rec_len = cpu_to_le16(sb->s_blocksize);
3341 }
Darrick J. Wong2931cdc2014-04-03 14:46:48 -07003342 ocfs2_update_inode_fsync_trans(handle, dir, 1);
Joel Beckerec20cec2010-03-19 14:13:52 -07003343 ocfs2_journal_dirty(handle, new_bh);
Mark Fashehccd979b2005-12-15 14:31:24 -08003344
3345 dir_i_size += dir->i_sb->s_blocksize;
3346 i_size_write(dir, dir_i_size);
Mark Fasheh8110b072007-03-22 16:53:23 -07003347 dir->i_blocks = ocfs2_inode_sector_count(dir);
Mark Fashehccd979b2005-12-15 14:31:24 -08003348 status = ocfs2_mark_inode_dirty(handle, dir, parent_fe_bh);
3349 if (status < 0) {
3350 mlog_errno(status);
3351 goto bail;
3352 }
3353
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003354bail_bh:
Mark Fashehccd979b2005-12-15 14:31:24 -08003355 *new_de_bh = new_bh;
3356 get_bh(*new_de_bh);
3357bail:
3358 if (handle)
Mark Fasheh02dc1af2006-10-09 16:48:10 -07003359 ocfs2_commit_trans(osb, handle);
Jan Karaedd45c02009-06-02 14:24:03 +02003360 if (drop_alloc_sem)
3361 up_write(&OCFS2_I(dir)->ip_alloc_sem);
Mark Fashehccd979b2005-12-15 14:31:24 -08003362
3363 if (data_ac)
3364 ocfs2_free_alloc_context(data_ac);
3365 if (meta_ac)
3366 ocfs2_free_alloc_context(meta_ac);
3367
Mark Fasheha81cb882008-10-07 14:25:16 -07003368 brelse(new_bh);
Mark Fashehccd979b2005-12-15 14:31:24 -08003369
Mark Fashehccd979b2005-12-15 14:31:24 -08003370 return status;
3371}
3372
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003373static int ocfs2_find_dir_space_id(struct inode *dir, struct buffer_head *di_bh,
3374 const char *name, int namelen,
3375 struct buffer_head **ret_de_bh,
3376 unsigned int *blocks_wanted)
3377{
3378 int ret;
Mark Fasheh87d35a72008-12-10 17:36:25 -08003379 struct super_block *sb = dir->i_sb;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003380 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
3381 struct ocfs2_dir_entry *de, *last_de = NULL;
3382 char *de_buf, *limit;
3383 unsigned long offset = 0;
Mark Fasheh87d35a72008-12-10 17:36:25 -08003384 unsigned int rec_len, new_rec_len, free_space = dir->i_sb->s_blocksize;
3385
3386 /*
3387 * This calculates how many free bytes we'd have in block zero, should
3388 * this function force expansion to an extent tree.
3389 */
Mark Fashehe7c17e42009-01-29 18:17:46 -08003390 if (ocfs2_new_dir_wants_trailer(dir))
Mark Fasheh87d35a72008-12-10 17:36:25 -08003391 free_space = ocfs2_dir_trailer_blk_off(sb) - i_size_read(dir);
3392 else
3393 free_space = dir->i_sb->s_blocksize - i_size_read(dir);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003394
3395 de_buf = di->id2.i_data.id_data;
3396 limit = de_buf + i_size_read(dir);
3397 rec_len = OCFS2_DIR_REC_LEN(namelen);
3398
3399 while (de_buf < limit) {
3400 de = (struct ocfs2_dir_entry *)de_buf;
3401
3402 if (!ocfs2_check_dir_entry(dir, de, di_bh, offset)) {
3403 ret = -ENOENT;
3404 goto out;
3405 }
3406 if (ocfs2_match(namelen, name, de)) {
3407 ret = -EEXIST;
3408 goto out;
3409 }
Mark Fasheh87d35a72008-12-10 17:36:25 -08003410 /*
3411 * No need to check for a trailing dirent record here as
3412 * they're not used for inline dirs.
3413 */
3414
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003415 if (ocfs2_dirent_would_fit(de, rec_len)) {
3416 /* Ok, we found a spot. Return this bh and let
3417 * the caller actually fill it in. */
3418 *ret_de_bh = di_bh;
3419 get_bh(*ret_de_bh);
3420 ret = 0;
3421 goto out;
3422 }
3423
3424 last_de = de;
3425 de_buf += le16_to_cpu(de->rec_len);
3426 offset += le16_to_cpu(de->rec_len);
3427 }
3428
3429 /*
3430 * We're going to require expansion of the directory - figure
3431 * out how many blocks we'll need so that a place for the
3432 * dirent can be found.
3433 */
3434 *blocks_wanted = 1;
Mark Fasheh87d35a72008-12-10 17:36:25 -08003435 new_rec_len = le16_to_cpu(last_de->rec_len) + free_space;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003436 if (new_rec_len < (rec_len + OCFS2_DIR_REC_LEN(last_de->name_len)))
3437 *blocks_wanted = 2;
3438
3439 ret = -ENOSPC;
3440out:
3441 return ret;
3442}
3443
3444static int ocfs2_find_dir_space_el(struct inode *dir, const char *name,
3445 int namelen, struct buffer_head **ret_de_bh)
Mark Fashehccd979b2005-12-15 14:31:24 -08003446{
3447 unsigned long offset;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003448 struct buffer_head *bh = NULL;
Mark Fashehccd979b2005-12-15 14:31:24 -08003449 unsigned short rec_len;
Mark Fashehccd979b2005-12-15 14:31:24 -08003450 struct ocfs2_dir_entry *de;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003451 struct super_block *sb = dir->i_sb;
Mark Fashehccd979b2005-12-15 14:31:24 -08003452 int status;
Mark Fasheh87d35a72008-12-10 17:36:25 -08003453 int blocksize = dir->i_sb->s_blocksize;
Mark Fashehccd979b2005-12-15 14:31:24 -08003454
Joel Beckera22305c2008-11-13 14:49:17 -08003455 status = ocfs2_read_dir_block(dir, 0, &bh, 0);
Daeseok Youn9b572692015-02-10 14:09:15 -08003456 if (status)
Mark Fashehccd979b2005-12-15 14:31:24 -08003457 goto bail;
Mark Fashehccd979b2005-12-15 14:31:24 -08003458
3459 rec_len = OCFS2_DIR_REC_LEN(namelen);
3460 offset = 0;
3461 de = (struct ocfs2_dir_entry *) bh->b_data;
3462 while (1) {
3463 if ((char *)de >= sb->s_blocksize + bh->b_data) {
3464 brelse(bh);
3465 bh = NULL;
3466
3467 if (i_size_read(dir) <= offset) {
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003468 /*
3469 * Caller will have to expand this
3470 * directory.
3471 */
3472 status = -ENOSPC;
Mark Fashehccd979b2005-12-15 14:31:24 -08003473 goto bail;
3474 }
Joel Beckera22305c2008-11-13 14:49:17 -08003475 status = ocfs2_read_dir_block(dir,
3476 offset >> sb->s_blocksize_bits,
3477 &bh, 0);
Daeseok Youn9b572692015-02-10 14:09:15 -08003478 if (status)
Mark Fashehccd979b2005-12-15 14:31:24 -08003479 goto bail;
Daeseok Youn9b572692015-02-10 14:09:15 -08003480
Mark Fashehccd979b2005-12-15 14:31:24 -08003481 /* move to next block */
3482 de = (struct ocfs2_dir_entry *) bh->b_data;
3483 }
3484 if (!ocfs2_check_dir_entry(dir, de, bh, offset)) {
3485 status = -ENOENT;
3486 goto bail;
3487 }
3488 if (ocfs2_match(namelen, name, de)) {
3489 status = -EEXIST;
3490 goto bail;
3491 }
Mark Fasheh87d35a72008-12-10 17:36:25 -08003492
3493 if (ocfs2_skip_dir_trailer(dir, de, offset % blocksize,
3494 blocksize))
3495 goto next;
3496
Mark Fasheh8553cf42007-09-13 16:29:01 -07003497 if (ocfs2_dirent_would_fit(de, rec_len)) {
Mark Fashehccd979b2005-12-15 14:31:24 -08003498 /* Ok, we found a spot. Return this bh and let
3499 * the caller actually fill it in. */
3500 *ret_de_bh = bh;
3501 get_bh(*ret_de_bh);
3502 status = 0;
3503 goto bail;
3504 }
Mark Fasheh87d35a72008-12-10 17:36:25 -08003505next:
Mark Fashehccd979b2005-12-15 14:31:24 -08003506 offset += le16_to_cpu(de->rec_len);
3507 de = (struct ocfs2_dir_entry *)((char *) de + le16_to_cpu(de->rec_len));
3508 }
3509
Mark Fashehccd979b2005-12-15 14:31:24 -08003510bail:
Mark Fasheha81cb882008-10-07 14:25:16 -07003511 brelse(bh);
Tao Mac1e8d352011-03-07 16:43:21 +08003512 if (status)
3513 mlog_errno(status);
Mark Fashehccd979b2005-12-15 14:31:24 -08003514
Mark Fashehccd979b2005-12-15 14:31:24 -08003515 return status;
3516}
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07003517
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003518static int dx_leaf_sort_cmp(const void *a, const void *b)
3519{
3520 const struct ocfs2_dx_entry *entry1 = a;
3521 const struct ocfs2_dx_entry *entry2 = b;
3522 u32 major_hash1 = le32_to_cpu(entry1->dx_major_hash);
3523 u32 major_hash2 = le32_to_cpu(entry2->dx_major_hash);
3524 u32 minor_hash1 = le32_to_cpu(entry1->dx_minor_hash);
3525 u32 minor_hash2 = le32_to_cpu(entry2->dx_minor_hash);
3526
3527 if (major_hash1 > major_hash2)
3528 return 1;
3529 if (major_hash1 < major_hash2)
3530 return -1;
3531
3532 /*
3533 * It is not strictly necessary to sort by minor
3534 */
3535 if (minor_hash1 > minor_hash2)
3536 return 1;
3537 if (minor_hash1 < minor_hash2)
3538 return -1;
3539 return 0;
3540}
3541
3542static void dx_leaf_sort_swap(void *a, void *b, int size)
3543{
3544 struct ocfs2_dx_entry *entry1 = a;
3545 struct ocfs2_dx_entry *entry2 = b;
3546 struct ocfs2_dx_entry tmp;
3547
3548 BUG_ON(size != sizeof(*entry1));
3549
3550 tmp = *entry1;
3551 *entry1 = *entry2;
3552 *entry2 = tmp;
3553}
3554
3555static int ocfs2_dx_leaf_same_major(struct ocfs2_dx_leaf *dx_leaf)
3556{
3557 struct ocfs2_dx_entry_list *dl_list = &dx_leaf->dl_list;
3558 int i, num = le16_to_cpu(dl_list->de_num_used);
3559
3560 for (i = 0; i < (num - 1); i++) {
3561 if (le32_to_cpu(dl_list->de_entries[i].dx_major_hash) !=
3562 le32_to_cpu(dl_list->de_entries[i + 1].dx_major_hash))
3563 return 0;
3564 }
3565
3566 return 1;
3567}
3568
3569/*
3570 * Find the optimal value to split this leaf on. This expects the leaf
3571 * entries to be in sorted order.
3572 *
3573 * leaf_cpos is the cpos of the leaf we're splitting. insert_hash is
3574 * the hash we want to insert.
3575 *
3576 * This function is only concerned with the major hash - that which
3577 * determines which cluster an item belongs to.
3578 */
3579static int ocfs2_dx_dir_find_leaf_split(struct ocfs2_dx_leaf *dx_leaf,
3580 u32 leaf_cpos, u32 insert_hash,
3581 u32 *split_hash)
3582{
3583 struct ocfs2_dx_entry_list *dl_list = &dx_leaf->dl_list;
3584 int i, num_used = le16_to_cpu(dl_list->de_num_used);
3585 int allsame;
3586
3587 /*
3588 * There's a couple rare, but nasty corner cases we have to
3589 * check for here. All of them involve a leaf where all value
3590 * have the same hash, which is what we look for first.
3591 *
3592 * Most of the time, all of the above is false, and we simply
3593 * pick the median value for a split.
3594 */
3595 allsame = ocfs2_dx_leaf_same_major(dx_leaf);
3596 if (allsame) {
3597 u32 val = le32_to_cpu(dl_list->de_entries[0].dx_major_hash);
3598
3599 if (val == insert_hash) {
3600 /*
3601 * No matter where we would choose to split,
3602 * the new entry would want to occupy the same
3603 * block as these. Since there's no space left
3604 * in their existing block, we know there
3605 * won't be space after the split.
3606 */
3607 return -ENOSPC;
3608 }
3609
3610 if (val == leaf_cpos) {
3611 /*
3612 * Because val is the same as leaf_cpos (which
3613 * is the smallest value this leaf can have),
3614 * yet is not equal to insert_hash, then we
3615 * know that insert_hash *must* be larger than
3616 * val (and leaf_cpos). At least cpos+1 in value.
3617 *
3618 * We also know then, that there cannot be an
3619 * adjacent extent (otherwise we'd be looking
3620 * at it). Choosing this value gives us a
3621 * chance to get some contiguousness.
3622 */
3623 *split_hash = leaf_cpos + 1;
3624 return 0;
3625 }
3626
3627 if (val > insert_hash) {
3628 /*
3629 * val can not be the same as insert hash, and
3630 * also must be larger than leaf_cpos. Also,
3631 * we know that there can't be a leaf between
3632 * cpos and val, otherwise the entries with
3633 * hash 'val' would be there.
3634 */
3635 *split_hash = val;
3636 return 0;
3637 }
3638
3639 *split_hash = insert_hash;
3640 return 0;
3641 }
3642
3643 /*
3644 * Since the records are sorted and the checks above
3645 * guaranteed that not all records in this block are the same,
3646 * we simple travel forward, from the median, and pick the 1st
3647 * record whose value is larger than leaf_cpos.
3648 */
3649 for (i = (num_used / 2); i < num_used; i++)
3650 if (le32_to_cpu(dl_list->de_entries[i].dx_major_hash) >
3651 leaf_cpos)
3652 break;
3653
3654 BUG_ON(i == num_used); /* Should be impossible */
3655 *split_hash = le32_to_cpu(dl_list->de_entries[i].dx_major_hash);
3656 return 0;
3657}
3658
3659/*
3660 * Transfer all entries in orig_dx_leaves whose major hash is equal to or
3661 * larger than split_hash into new_dx_leaves. We use a temporary
3662 * buffer (tmp_dx_leaf) to make the changes to the original leaf blocks.
3663 *
3664 * Since the block offset inside a leaf (cluster) is a constant mask
3665 * of minor_hash, we can optimize - an item at block offset X within
3666 * the original cluster, will be at offset X within the new cluster.
3667 */
3668static void ocfs2_dx_dir_transfer_leaf(struct inode *dir, u32 split_hash,
3669 handle_t *handle,
3670 struct ocfs2_dx_leaf *tmp_dx_leaf,
3671 struct buffer_head **orig_dx_leaves,
3672 struct buffer_head **new_dx_leaves,
3673 int num_dx_leaves)
3674{
3675 int i, j, num_used;
3676 u32 major_hash;
3677 struct ocfs2_dx_leaf *orig_dx_leaf, *new_dx_leaf;
3678 struct ocfs2_dx_entry_list *orig_list, *new_list, *tmp_list;
3679 struct ocfs2_dx_entry *dx_entry;
3680
3681 tmp_list = &tmp_dx_leaf->dl_list;
3682
3683 for (i = 0; i < num_dx_leaves; i++) {
3684 orig_dx_leaf = (struct ocfs2_dx_leaf *) orig_dx_leaves[i]->b_data;
3685 orig_list = &orig_dx_leaf->dl_list;
3686 new_dx_leaf = (struct ocfs2_dx_leaf *) new_dx_leaves[i]->b_data;
3687 new_list = &new_dx_leaf->dl_list;
3688
3689 num_used = le16_to_cpu(orig_list->de_num_used);
3690
3691 memcpy(tmp_dx_leaf, orig_dx_leaf, dir->i_sb->s_blocksize);
3692 tmp_list->de_num_used = cpu_to_le16(0);
3693 memset(&tmp_list->de_entries, 0, sizeof(*dx_entry)*num_used);
3694
3695 for (j = 0; j < num_used; j++) {
3696 dx_entry = &orig_list->de_entries[j];
3697 major_hash = le32_to_cpu(dx_entry->dx_major_hash);
3698 if (major_hash >= split_hash)
3699 ocfs2_dx_dir_leaf_insert_tail(new_dx_leaf,
3700 dx_entry);
3701 else
3702 ocfs2_dx_dir_leaf_insert_tail(tmp_dx_leaf,
3703 dx_entry);
3704 }
3705 memcpy(orig_dx_leaf, tmp_dx_leaf, dir->i_sb->s_blocksize);
3706
3707 ocfs2_journal_dirty(handle, orig_dx_leaves[i]);
3708 ocfs2_journal_dirty(handle, new_dx_leaves[i]);
3709 }
3710}
3711
3712static int ocfs2_dx_dir_rebalance_credits(struct ocfs2_super *osb,
3713 struct ocfs2_dx_root_block *dx_root)
3714{
3715 int credits = ocfs2_clusters_to_blocks(osb->sb, 2);
3716
Goldwyn Rodrigues06f9da62013-11-12 15:06:52 -08003717 credits += ocfs2_calc_extend_credits(osb->sb, &dx_root->dr_list);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003718 credits += ocfs2_quota_trans_credits(osb->sb);
3719 return credits;
3720}
3721
3722/*
3723 * Find the median value in dx_leaf_bh and allocate a new leaf to move
3724 * half our entries into.
3725 */
3726static int ocfs2_dx_dir_rebalance(struct ocfs2_super *osb, struct inode *dir,
3727 struct buffer_head *dx_root_bh,
3728 struct buffer_head *dx_leaf_bh,
3729 struct ocfs2_dx_hinfo *hinfo, u32 leaf_cpos,
3730 u64 leaf_blkno)
3731{
3732 struct ocfs2_dx_leaf *dx_leaf = (struct ocfs2_dx_leaf *)dx_leaf_bh->b_data;
3733 int credits, ret, i, num_used, did_quota = 0;
3734 u32 cpos, split_hash, insert_hash = hinfo->major_hash;
3735 u64 orig_leaves_start;
3736 int num_dx_leaves;
3737 struct buffer_head **orig_dx_leaves = NULL;
3738 struct buffer_head **new_dx_leaves = NULL;
3739 struct ocfs2_alloc_context *data_ac = NULL, *meta_ac = NULL;
3740 struct ocfs2_extent_tree et;
3741 handle_t *handle = NULL;
3742 struct ocfs2_dx_root_block *dx_root;
3743 struct ocfs2_dx_leaf *tmp_dx_leaf = NULL;
3744
Tao Maf1088d42011-02-23 22:30:23 +08003745 trace_ocfs2_dx_dir_rebalance((unsigned long long)OCFS2_I(dir)->ip_blkno,
3746 (unsigned long long)leaf_blkno,
3747 insert_hash);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003748
Joel Becker5e404e92009-02-13 03:54:22 -08003749 ocfs2_init_dx_root_extent_tree(&et, INODE_CACHE(dir), dx_root_bh);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003750
3751 dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data;
3752 /*
3753 * XXX: This is a rather large limit. We should use a more
3754 * realistic value.
3755 */
3756 if (le32_to_cpu(dx_root->dr_clusters) == UINT_MAX)
3757 return -ENOSPC;
3758
3759 num_used = le16_to_cpu(dx_leaf->dl_list.de_num_used);
3760 if (num_used < le16_to_cpu(dx_leaf->dl_list.de_count)) {
3761 mlog(ML_ERROR, "DX Dir: %llu, Asked to rebalance empty leaf: "
3762 "%llu, %d\n", (unsigned long long)OCFS2_I(dir)->ip_blkno,
3763 (unsigned long long)leaf_blkno, num_used);
3764 ret = -EIO;
3765 goto out;
3766 }
3767
3768 orig_dx_leaves = ocfs2_dx_dir_kmalloc_leaves(osb->sb, &num_dx_leaves);
3769 if (!orig_dx_leaves) {
3770 ret = -ENOMEM;
3771 mlog_errno(ret);
3772 goto out;
3773 }
3774
3775 new_dx_leaves = ocfs2_dx_dir_kmalloc_leaves(osb->sb, NULL);
3776 if (!new_dx_leaves) {
3777 ret = -ENOMEM;
3778 mlog_errno(ret);
3779 goto out;
3780 }
3781
3782 ret = ocfs2_lock_allocators(dir, &et, 1, 0, &data_ac, &meta_ac);
3783 if (ret) {
3784 if (ret != -ENOSPC)
3785 mlog_errno(ret);
3786 goto out;
3787 }
3788
3789 credits = ocfs2_dx_dir_rebalance_credits(osb, dx_root);
3790 handle = ocfs2_start_trans(osb, credits);
3791 if (IS_ERR(handle)) {
3792 ret = PTR_ERR(handle);
3793 handle = NULL;
3794 mlog_errno(ret);
3795 goto out;
3796 }
3797
Christoph Hellwig5dd40562010-03-03 09:05:00 -05003798 ret = dquot_alloc_space_nodirty(dir,
3799 ocfs2_clusters_to_bytes(dir->i_sb, 1));
3800 if (ret)
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003801 goto out_commit;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003802 did_quota = 1;
3803
Joel Becker0cf2f762009-02-12 16:41:25 -08003804 ret = ocfs2_journal_access_dl(handle, INODE_CACHE(dir), dx_leaf_bh,
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003805 OCFS2_JOURNAL_ACCESS_WRITE);
3806 if (ret) {
3807 mlog_errno(ret);
3808 goto out_commit;
3809 }
3810
3811 /*
3812 * This block is changing anyway, so we can sort it in place.
3813 */
3814 sort(dx_leaf->dl_list.de_entries, num_used,
3815 sizeof(struct ocfs2_dx_entry), dx_leaf_sort_cmp,
3816 dx_leaf_sort_swap);
3817
Joel Beckerec20cec2010-03-19 14:13:52 -07003818 ocfs2_journal_dirty(handle, dx_leaf_bh);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003819
3820 ret = ocfs2_dx_dir_find_leaf_split(dx_leaf, leaf_cpos, insert_hash,
3821 &split_hash);
3822 if (ret) {
3823 mlog_errno(ret);
3824 goto out_commit;
3825 }
3826
Tao Maf1088d42011-02-23 22:30:23 +08003827 trace_ocfs2_dx_dir_rebalance_split(leaf_cpos, split_hash, insert_hash);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003828
3829 /*
3830 * We have to carefully order operations here. There are items
3831 * which want to be in the new cluster before insert, but in
3832 * order to put those items in the new cluster, we alter the
3833 * old cluster. A failure to insert gets nasty.
3834 *
3835 * So, start by reserving writes to the old
3836 * cluster. ocfs2_dx_dir_new_cluster will reserve writes on
3837 * the new cluster for us, before inserting it. The insert
3838 * won't happen if there's an error before that. Once the
3839 * insert is done then, we can transfer from one leaf into the
3840 * other without fear of hitting any error.
3841 */
3842
3843 /*
3844 * The leaf transfer wants some scratch space so that we don't
3845 * wind up doing a bunch of expensive memmove().
3846 */
3847 tmp_dx_leaf = kmalloc(osb->sb->s_blocksize, GFP_NOFS);
3848 if (!tmp_dx_leaf) {
3849 ret = -ENOMEM;
3850 mlog_errno(ret);
3851 goto out_commit;
3852 }
3853
Mark Fasheh1d46dc02009-02-19 13:17:05 -08003854 orig_leaves_start = ocfs2_block_to_cluster_start(dir->i_sb, leaf_blkno);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003855 ret = ocfs2_read_dx_leaves(dir, orig_leaves_start, num_dx_leaves,
3856 orig_dx_leaves);
3857 if (ret) {
3858 mlog_errno(ret);
3859 goto out_commit;
3860 }
3861
Tristan Ye0f4da212010-09-08 17:12:38 +08003862 cpos = split_hash;
3863 ret = ocfs2_dx_dir_new_cluster(dir, &et, cpos, handle,
3864 data_ac, meta_ac, new_dx_leaves,
3865 num_dx_leaves);
3866 if (ret) {
3867 mlog_errno(ret);
3868 goto out_commit;
3869 }
3870
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003871 for (i = 0; i < num_dx_leaves; i++) {
Joel Becker0cf2f762009-02-12 16:41:25 -08003872 ret = ocfs2_journal_access_dl(handle, INODE_CACHE(dir),
3873 orig_dx_leaves[i],
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003874 OCFS2_JOURNAL_ACCESS_WRITE);
3875 if (ret) {
3876 mlog_errno(ret);
3877 goto out_commit;
3878 }
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003879
Tristan Ye0f4da212010-09-08 17:12:38 +08003880 ret = ocfs2_journal_access_dl(handle, INODE_CACHE(dir),
3881 new_dx_leaves[i],
3882 OCFS2_JOURNAL_ACCESS_WRITE);
3883 if (ret) {
3884 mlog_errno(ret);
3885 goto out_commit;
3886 }
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003887 }
3888
3889 ocfs2_dx_dir_transfer_leaf(dir, split_hash, handle, tmp_dx_leaf,
3890 orig_dx_leaves, new_dx_leaves, num_dx_leaves);
3891
3892out_commit:
3893 if (ret < 0 && did_quota)
Christoph Hellwig5dd40562010-03-03 09:05:00 -05003894 dquot_free_space_nodirty(dir,
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003895 ocfs2_clusters_to_bytes(dir->i_sb, 1));
3896
Darrick J. Wong2931cdc2014-04-03 14:46:48 -07003897 ocfs2_update_inode_fsync_trans(handle, dir, 1);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08003898 ocfs2_commit_trans(osb, handle);
3899
3900out:
3901 if (orig_dx_leaves || new_dx_leaves) {
3902 for (i = 0; i < num_dx_leaves; i++) {
3903 if (orig_dx_leaves)
3904 brelse(orig_dx_leaves[i]);
3905 if (new_dx_leaves)
3906 brelse(new_dx_leaves[i]);
3907 }
3908 kfree(orig_dx_leaves);
3909 kfree(new_dx_leaves);
3910 }
3911
3912 if (meta_ac)
3913 ocfs2_free_alloc_context(meta_ac);
3914 if (data_ac)
3915 ocfs2_free_alloc_context(data_ac);
3916
3917 kfree(tmp_dx_leaf);
3918 return ret;
3919}
3920
Mark Fashehe7c17e42009-01-29 18:17:46 -08003921static int ocfs2_find_dir_space_dx(struct ocfs2_super *osb, struct inode *dir,
3922 struct buffer_head *di_bh,
3923 struct buffer_head *dx_root_bh,
3924 const char *name, int namelen,
3925 struct ocfs2_dir_lookup_result *lookup)
3926{
3927 int ret, rebalanced = 0;
3928 struct ocfs2_dx_root_block *dx_root;
3929 struct buffer_head *dx_leaf_bh = NULL;
3930 struct ocfs2_dx_leaf *dx_leaf;
3931 u64 blkno;
3932 u32 leaf_cpos;
3933
3934 dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data;
3935
3936restart_search:
3937 ret = ocfs2_dx_dir_lookup(dir, &dx_root->dr_list, &lookup->dl_hinfo,
3938 &leaf_cpos, &blkno);
3939 if (ret) {
3940 mlog_errno(ret);
3941 goto out;
3942 }
3943
3944 ret = ocfs2_read_dx_leaf(dir, blkno, &dx_leaf_bh);
3945 if (ret) {
3946 mlog_errno(ret);
3947 goto out;
3948 }
3949
3950 dx_leaf = (struct ocfs2_dx_leaf *)dx_leaf_bh->b_data;
3951
3952 if (le16_to_cpu(dx_leaf->dl_list.de_num_used) >=
3953 le16_to_cpu(dx_leaf->dl_list.de_count)) {
3954 if (rebalanced) {
3955 /*
3956 * Rebalancing should have provided us with
3957 * space in an appropriate leaf.
3958 *
3959 * XXX: Is this an abnormal condition then?
3960 * Should we print a message here?
3961 */
3962 ret = -ENOSPC;
3963 goto out;
3964 }
3965
3966 ret = ocfs2_dx_dir_rebalance(osb, dir, dx_root_bh, dx_leaf_bh,
3967 &lookup->dl_hinfo, leaf_cpos,
3968 blkno);
3969 if (ret) {
3970 if (ret != -ENOSPC)
3971 mlog_errno(ret);
3972 goto out;
3973 }
3974
3975 /*
3976 * Restart the lookup. The rebalance might have
3977 * changed which block our item fits into. Mark our
3978 * progress, so we only execute this once.
3979 */
3980 brelse(dx_leaf_bh);
3981 dx_leaf_bh = NULL;
3982 rebalanced = 1;
3983 goto restart_search;
3984 }
3985
3986 lookup->dl_dx_leaf_bh = dx_leaf_bh;
3987 dx_leaf_bh = NULL;
3988
3989out:
3990 brelse(dx_leaf_bh);
3991 return ret;
3992}
3993
3994static int ocfs2_search_dx_free_list(struct inode *dir,
3995 struct buffer_head *dx_root_bh,
3996 int namelen,
3997 struct ocfs2_dir_lookup_result *lookup)
3998{
3999 int ret = -ENOSPC;
4000 struct buffer_head *leaf_bh = NULL, *prev_leaf_bh = NULL;
4001 struct ocfs2_dir_block_trailer *db;
4002 u64 next_block;
4003 int rec_len = OCFS2_DIR_REC_LEN(namelen);
4004 struct ocfs2_dx_root_block *dx_root;
4005
4006 dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data;
4007 next_block = le64_to_cpu(dx_root->dr_free_blk);
4008
4009 while (next_block) {
4010 brelse(prev_leaf_bh);
4011 prev_leaf_bh = leaf_bh;
4012 leaf_bh = NULL;
4013
4014 ret = ocfs2_read_dir_block_direct(dir, next_block, &leaf_bh);
4015 if (ret) {
4016 mlog_errno(ret);
4017 goto out;
4018 }
4019
4020 db = ocfs2_trailer_from_bh(leaf_bh, dir->i_sb);
4021 if (rec_len <= le16_to_cpu(db->db_free_rec_len)) {
4022 lookup->dl_leaf_bh = leaf_bh;
4023 lookup->dl_prev_leaf_bh = prev_leaf_bh;
4024 leaf_bh = NULL;
4025 prev_leaf_bh = NULL;
4026 break;
4027 }
4028
4029 next_block = le64_to_cpu(db->db_free_next);
4030 }
4031
4032 if (!next_block)
4033 ret = -ENOSPC;
4034
4035out:
4036
4037 brelse(leaf_bh);
4038 brelse(prev_leaf_bh);
4039 return ret;
4040}
4041
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08004042static int ocfs2_expand_inline_dx_root(struct inode *dir,
4043 struct buffer_head *dx_root_bh)
4044{
4045 int ret, num_dx_leaves, i, j, did_quota = 0;
4046 struct buffer_head **dx_leaves = NULL;
4047 struct ocfs2_extent_tree et;
4048 u64 insert_blkno;
4049 struct ocfs2_alloc_context *data_ac = NULL;
4050 struct ocfs2_super *osb = OCFS2_SB(dir->i_sb);
4051 handle_t *handle = NULL;
4052 struct ocfs2_dx_root_block *dx_root;
4053 struct ocfs2_dx_entry_list *entry_list;
4054 struct ocfs2_dx_entry *dx_entry;
4055 struct ocfs2_dx_leaf *target_leaf;
4056
4057 ret = ocfs2_reserve_clusters(osb, 1, &data_ac);
4058 if (ret) {
4059 mlog_errno(ret);
4060 goto out;
4061 }
4062
4063 dx_leaves = ocfs2_dx_dir_kmalloc_leaves(osb->sb, &num_dx_leaves);
4064 if (!dx_leaves) {
4065 ret = -ENOMEM;
4066 mlog_errno(ret);
4067 goto out;
4068 }
4069
4070 handle = ocfs2_start_trans(osb, ocfs2_calc_dxi_expand_credits(osb->sb));
4071 if (IS_ERR(handle)) {
4072 ret = PTR_ERR(handle);
4073 mlog_errno(ret);
4074 goto out;
4075 }
4076
Christoph Hellwig5dd40562010-03-03 09:05:00 -05004077 ret = dquot_alloc_space_nodirty(dir,
4078 ocfs2_clusters_to_bytes(osb->sb, 1));
4079 if (ret)
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08004080 goto out_commit;
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08004081 did_quota = 1;
4082
4083 /*
4084 * We do this up front, before the allocation, so that a
4085 * failure to add the dx_root_bh to the journal won't result
4086 * us losing clusters.
4087 */
Joel Becker0cf2f762009-02-12 16:41:25 -08004088 ret = ocfs2_journal_access_dr(handle, INODE_CACHE(dir), dx_root_bh,
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08004089 OCFS2_JOURNAL_ACCESS_WRITE);
4090 if (ret) {
4091 mlog_errno(ret);
4092 goto out_commit;
4093 }
4094
4095 ret = __ocfs2_dx_dir_new_cluster(dir, 0, handle, data_ac, dx_leaves,
4096 num_dx_leaves, &insert_blkno);
4097 if (ret) {
4098 mlog_errno(ret);
4099 goto out_commit;
4100 }
4101
4102 /*
4103 * Transfer the entries from our dx_root into the appropriate
4104 * block
4105 */
4106 dx_root = (struct ocfs2_dx_root_block *) dx_root_bh->b_data;
4107 entry_list = &dx_root->dr_entries;
4108
4109 for (i = 0; i < le16_to_cpu(entry_list->de_num_used); i++) {
4110 dx_entry = &entry_list->de_entries[i];
4111
4112 j = __ocfs2_dx_dir_hash_idx(osb,
4113 le32_to_cpu(dx_entry->dx_minor_hash));
4114 target_leaf = (struct ocfs2_dx_leaf *)dx_leaves[j]->b_data;
4115
4116 ocfs2_dx_dir_leaf_insert_tail(target_leaf, dx_entry);
4117
4118 /* Each leaf has been passed to the journal already
4119 * via __ocfs2_dx_dir_new_cluster() */
4120 }
4121
4122 dx_root->dr_flags &= ~OCFS2_DX_FLAG_INLINE;
4123 memset(&dx_root->dr_list, 0, osb->sb->s_blocksize -
4124 offsetof(struct ocfs2_dx_root_block, dr_list));
4125 dx_root->dr_list.l_count =
4126 cpu_to_le16(ocfs2_extent_recs_per_dx_root(osb->sb));
4127
4128 /* This should never fail considering we start with an empty
4129 * dx_root. */
Joel Becker5e404e92009-02-13 03:54:22 -08004130 ocfs2_init_dx_root_extent_tree(&et, INODE_CACHE(dir), dx_root_bh);
Joel Beckercc79d8c2009-02-13 03:24:43 -08004131 ret = ocfs2_insert_extent(handle, &et, 0, insert_blkno, 1, 0, NULL);
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08004132 if (ret)
4133 mlog_errno(ret);
4134 did_quota = 0;
4135
Darrick J. Wong2931cdc2014-04-03 14:46:48 -07004136 ocfs2_update_inode_fsync_trans(handle, dir, 1);
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08004137 ocfs2_journal_dirty(handle, dx_root_bh);
4138
4139out_commit:
4140 if (ret < 0 && did_quota)
Christoph Hellwig5dd40562010-03-03 09:05:00 -05004141 dquot_free_space_nodirty(dir,
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08004142 ocfs2_clusters_to_bytes(dir->i_sb, 1));
4143
4144 ocfs2_commit_trans(osb, handle);
4145
4146out:
4147 if (data_ac)
4148 ocfs2_free_alloc_context(data_ac);
4149
4150 if (dx_leaves) {
4151 for (i = 0; i < num_dx_leaves; i++)
4152 brelse(dx_leaves[i]);
4153 kfree(dx_leaves);
4154 }
4155 return ret;
4156}
4157
4158static int ocfs2_inline_dx_has_space(struct buffer_head *dx_root_bh)
4159{
4160 struct ocfs2_dx_root_block *dx_root;
4161 struct ocfs2_dx_entry_list *entry_list;
4162
4163 dx_root = (struct ocfs2_dx_root_block *) dx_root_bh->b_data;
4164 entry_list = &dx_root->dr_entries;
4165
4166 if (le16_to_cpu(entry_list->de_num_used) >=
4167 le16_to_cpu(entry_list->de_count))
4168 return -ENOSPC;
4169
4170 return 0;
4171}
4172
Mark Fashehe7c17e42009-01-29 18:17:46 -08004173static int ocfs2_prepare_dx_dir_for_insert(struct inode *dir,
4174 struct buffer_head *di_bh,
4175 const char *name,
4176 int namelen,
4177 struct ocfs2_dir_lookup_result *lookup)
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004178{
Mark Fashehe7c17e42009-01-29 18:17:46 -08004179 int ret, free_dx_root = 1;
4180 struct ocfs2_super *osb = OCFS2_SB(dir->i_sb);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004181 struct buffer_head *dx_root_bh = NULL;
Mark Fashehe7c17e42009-01-29 18:17:46 -08004182 struct buffer_head *leaf_bh = NULL;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004183 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
Mark Fashehe7c17e42009-01-29 18:17:46 -08004184 struct ocfs2_dx_root_block *dx_root;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004185
4186 ret = ocfs2_read_dx_root(dir, di, &dx_root_bh);
4187 if (ret) {
4188 mlog_errno(ret);
4189 goto out;
4190 }
4191
4192 dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data;
Mark Fashehe3a93c22009-02-17 15:29:35 -08004193 if (le32_to_cpu(dx_root->dr_num_entries) == OCFS2_DX_ENTRIES_MAX) {
4194 ret = -ENOSPC;
4195 mlog_errno(ret);
4196 goto out;
4197 }
4198
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08004199 if (ocfs2_dx_root_inline(dx_root)) {
4200 ret = ocfs2_inline_dx_has_space(dx_root_bh);
4201
4202 if (ret == 0)
4203 goto search_el;
4204
4205 /*
4206 * We ran out of room in the root block. Expand it to
4207 * an extent, then allow ocfs2_find_dir_space_dx to do
4208 * the rest.
4209 */
4210 ret = ocfs2_expand_inline_dx_root(dir, dx_root_bh);
4211 if (ret) {
4212 mlog_errno(ret);
4213 goto out;
4214 }
4215 }
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004216
Mark Fashehe7c17e42009-01-29 18:17:46 -08004217 /*
4218 * Insert preparation for an indexed directory is split into two
4219 * steps. The call to find_dir_space_dx reserves room in the index for
4220 * an additional item. If we run out of space there, it's a real error
4221 * we can't continue on.
4222 */
4223 ret = ocfs2_find_dir_space_dx(osb, dir, di_bh, dx_root_bh, name,
4224 namelen, lookup);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004225 if (ret) {
4226 mlog_errno(ret);
4227 goto out;
4228 }
4229
Mark Fashehe7c17e42009-01-29 18:17:46 -08004230search_el:
4231 /*
4232 * Next, we need to find space in the unindexed tree. This call
4233 * searches using the free space linked list. If the unindexed tree
4234 * lacks sufficient space, we'll expand it below. The expansion code
4235 * is smart enough to add any new blocks to the free space list.
4236 */
4237 ret = ocfs2_search_dx_free_list(dir, dx_root_bh, namelen, lookup);
4238 if (ret && ret != -ENOSPC) {
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004239 mlog_errno(ret);
4240 goto out;
4241 }
4242
Mark Fashehe7c17e42009-01-29 18:17:46 -08004243 /* Do this up here - ocfs2_extend_dir might need the dx_root */
4244 lookup->dl_dx_root_bh = dx_root_bh;
4245 free_dx_root = 0;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004246
Mark Fashehe7c17e42009-01-29 18:17:46 -08004247 if (ret == -ENOSPC) {
4248 ret = ocfs2_extend_dir(osb, dir, di_bh, 1, lookup, &leaf_bh);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004249
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004250 if (ret) {
Mark Fashehe7c17e42009-01-29 18:17:46 -08004251 mlog_errno(ret);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004252 goto out;
4253 }
4254
4255 /*
Mark Fashehe7c17e42009-01-29 18:17:46 -08004256 * We make the assumption here that new leaf blocks are added
4257 * to the front of our free list.
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004258 */
Mark Fashehe7c17e42009-01-29 18:17:46 -08004259 lookup->dl_prev_leaf_bh = NULL;
4260 lookup->dl_leaf_bh = leaf_bh;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004261 }
4262
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004263out:
Mark Fashehe7c17e42009-01-29 18:17:46 -08004264 if (free_dx_root)
4265 brelse(dx_root_bh);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004266 return ret;
4267}
4268
Mark Fasheh4a12ca32008-11-12 15:43:34 -08004269/*
4270 * Get a directory ready for insert. Any directory allocation required
4271 * happens here. Success returns zero, and enough context in the dir
4272 * lookup result that ocfs2_add_entry() will be able complete the task
4273 * with minimal performance impact.
4274 */
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07004275int ocfs2_prepare_dir_for_insert(struct ocfs2_super *osb,
4276 struct inode *dir,
4277 struct buffer_head *parent_fe_bh,
4278 const char *name,
4279 int namelen,
Mark Fasheh4a12ca32008-11-12 15:43:34 -08004280 struct ocfs2_dir_lookup_result *lookup)
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07004281{
4282 int ret;
4283 unsigned int blocks_wanted = 1;
4284 struct buffer_head *bh = NULL;
4285
Tao Maf1088d42011-02-23 22:30:23 +08004286 trace_ocfs2_prepare_dir_for_insert(
4287 (unsigned long long)OCFS2_I(dir)->ip_blkno, namelen);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07004288
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07004289 if (!namelen) {
4290 ret = -EINVAL;
4291 mlog_errno(ret);
4292 goto out;
4293 }
4294
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004295 /*
4296 * Do this up front to reduce confusion.
4297 *
4298 * The directory might start inline, then be turned into an
4299 * indexed one, in which case we'd need to hash deep inside
4300 * ocfs2_find_dir_space_id(). Since
4301 * ocfs2_prepare_dx_dir_for_insert() also needs this hash
4302 * done, there seems no point in spreading out the calls. We
4303 * can optimize away the case where the file system doesn't
4304 * support indexing.
4305 */
4306 if (ocfs2_supports_indexed_dirs(osb))
4307 ocfs2_dx_dir_name_hash(dir, name, namelen, &lookup->dl_hinfo);
4308
4309 if (ocfs2_dir_indexed(dir)) {
Mark Fashehe7c17e42009-01-29 18:17:46 -08004310 ret = ocfs2_prepare_dx_dir_for_insert(dir, parent_fe_bh,
4311 name, namelen, lookup);
4312 if (ret)
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004313 mlog_errno(ret);
Mark Fashehe7c17e42009-01-29 18:17:46 -08004314 goto out;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004315 }
4316
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07004317 if (OCFS2_I(dir)->ip_dyn_features & OCFS2_INLINE_DATA_FL) {
4318 ret = ocfs2_find_dir_space_id(dir, parent_fe_bh, name,
4319 namelen, &bh, &blocks_wanted);
4320 } else
4321 ret = ocfs2_find_dir_space_el(dir, name, namelen, &bh);
4322
4323 if (ret && ret != -ENOSPC) {
4324 mlog_errno(ret);
4325 goto out;
4326 }
4327
4328 if (ret == -ENOSPC) {
4329 /*
4330 * We have to expand the directory to add this name.
4331 */
4332 BUG_ON(bh);
4333
4334 ret = ocfs2_extend_dir(osb, dir, parent_fe_bh, blocks_wanted,
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004335 lookup, &bh);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07004336 if (ret) {
4337 if (ret != -ENOSPC)
4338 mlog_errno(ret);
4339 goto out;
4340 }
4341
4342 BUG_ON(!bh);
4343 }
4344
Mark Fasheh4a12ca32008-11-12 15:43:34 -08004345 lookup->dl_leaf_bh = bh;
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07004346 bh = NULL;
4347out:
Mark Fasheha81cb882008-10-07 14:25:16 -07004348 brelse(bh);
Mark Fasheh5b6a3a22007-09-13 16:33:54 -07004349 return ret;
4350}
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004351
4352static int ocfs2_dx_dir_remove_index(struct inode *dir,
4353 struct buffer_head *di_bh,
4354 struct buffer_head *dx_root_bh)
4355{
4356 int ret;
4357 struct ocfs2_super *osb = OCFS2_SB(dir->i_sb);
4358 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
4359 struct ocfs2_dx_root_block *dx_root;
4360 struct inode *dx_alloc_inode = NULL;
4361 struct buffer_head *dx_alloc_bh = NULL;
4362 handle_t *handle;
4363 u64 blk;
4364 u16 bit;
4365 u64 bg_blkno;
4366
4367 dx_root = (struct ocfs2_dx_root_block *) dx_root_bh->b_data;
4368
4369 dx_alloc_inode = ocfs2_get_system_file_inode(osb,
4370 EXTENT_ALLOC_SYSTEM_INODE,
4371 le16_to_cpu(dx_root->dr_suballoc_slot));
4372 if (!dx_alloc_inode) {
4373 ret = -ENOMEM;
4374 mlog_errno(ret);
4375 goto out;
4376 }
4377 mutex_lock(&dx_alloc_inode->i_mutex);
4378
4379 ret = ocfs2_inode_lock(dx_alloc_inode, &dx_alloc_bh, 1);
4380 if (ret) {
4381 mlog_errno(ret);
4382 goto out_mutex;
4383 }
4384
4385 handle = ocfs2_start_trans(osb, OCFS2_DX_ROOT_REMOVE_CREDITS);
4386 if (IS_ERR(handle)) {
4387 ret = PTR_ERR(handle);
4388 mlog_errno(ret);
4389 goto out_unlock;
4390 }
4391
Joel Becker0cf2f762009-02-12 16:41:25 -08004392 ret = ocfs2_journal_access_di(handle, INODE_CACHE(dir), di_bh,
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004393 OCFS2_JOURNAL_ACCESS_WRITE);
4394 if (ret) {
4395 mlog_errno(ret);
4396 goto out_commit;
4397 }
4398
Tao Ma8ac33dc2010-12-15 16:30:00 +08004399 spin_lock(&OCFS2_I(dir)->ip_lock);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004400 OCFS2_I(dir)->ip_dyn_features &= ~OCFS2_INDEXED_DIR_FL;
4401 di->i_dyn_features = cpu_to_le16(OCFS2_I(dir)->ip_dyn_features);
Tao Ma8ac33dc2010-12-15 16:30:00 +08004402 spin_unlock(&OCFS2_I(dir)->ip_lock);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004403 di->i_dx_root = cpu_to_le64(0ULL);
Darrick J. Wong6fdb7022014-04-03 14:47:08 -07004404 ocfs2_update_inode_fsync_trans(handle, dir, 1);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004405
4406 ocfs2_journal_dirty(handle, di_bh);
4407
4408 blk = le64_to_cpu(dx_root->dr_blkno);
4409 bit = le16_to_cpu(dx_root->dr_suballoc_bit);
Tao Ma74380c42010-03-22 14:20:18 +08004410 if (dx_root->dr_suballoc_loc)
4411 bg_blkno = le64_to_cpu(dx_root->dr_suballoc_loc);
4412 else
4413 bg_blkno = ocfs2_which_suballoc_group(blk, bit);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004414 ret = ocfs2_free_suballoc_bits(handle, dx_alloc_inode, dx_alloc_bh,
4415 bit, bg_blkno, 1);
4416 if (ret)
4417 mlog_errno(ret);
4418
4419out_commit:
4420 ocfs2_commit_trans(osb, handle);
4421
4422out_unlock:
4423 ocfs2_inode_unlock(dx_alloc_inode, 1);
4424
4425out_mutex:
4426 mutex_unlock(&dx_alloc_inode->i_mutex);
4427 brelse(dx_alloc_bh);
4428out:
4429 iput(dx_alloc_inode);
4430 return ret;
4431}
4432
4433int ocfs2_dx_dir_truncate(struct inode *dir, struct buffer_head *di_bh)
4434{
4435 int ret;
4436 unsigned int uninitialized_var(clen);
4437 u32 major_hash = UINT_MAX, p_cpos, uninitialized_var(cpos);
4438 u64 uninitialized_var(blkno);
4439 struct ocfs2_super *osb = OCFS2_SB(dir->i_sb);
4440 struct buffer_head *dx_root_bh = NULL;
4441 struct ocfs2_dx_root_block *dx_root;
4442 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
4443 struct ocfs2_cached_dealloc_ctxt dealloc;
4444 struct ocfs2_extent_tree et;
4445
4446 ocfs2_init_dealloc_ctxt(&dealloc);
4447
4448 if (!ocfs2_dir_indexed(dir))
4449 return 0;
4450
4451 ret = ocfs2_read_dx_root(dir, di, &dx_root_bh);
4452 if (ret) {
4453 mlog_errno(ret);
4454 goto out;
4455 }
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08004456 dx_root = (struct ocfs2_dx_root_block *)dx_root_bh->b_data;
4457
4458 if (ocfs2_dx_root_inline(dx_root))
4459 goto remove_index;
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004460
Joel Becker5e404e92009-02-13 03:54:22 -08004461 ocfs2_init_dx_root_extent_tree(&et, INODE_CACHE(dir), dx_root_bh);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004462
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004463 /* XXX: What if dr_clusters is too large? */
4464 while (le32_to_cpu(dx_root->dr_clusters)) {
4465 ret = ocfs2_dx_dir_lookup_rec(dir, &dx_root->dr_list,
4466 major_hash, &cpos, &blkno, &clen);
4467 if (ret) {
4468 mlog_errno(ret);
4469 goto out;
4470 }
4471
4472 p_cpos = ocfs2_blocks_to_clusters(dir->i_sb, blkno);
4473
Tristan Ye78f94672010-05-11 17:54:42 +08004474 ret = ocfs2_remove_btree_range(dir, &et, cpos, p_cpos, clen, 0,
Junxiao Bif62f12b2014-12-18 16:17:32 -08004475 &dealloc, 0, false);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004476 if (ret) {
4477 mlog_errno(ret);
4478 goto out;
4479 }
4480
4481 if (cpos == 0)
4482 break;
4483
4484 major_hash = cpos - 1;
4485 }
4486
Mark Fasheh4ed8a6b2008-11-24 17:02:08 -08004487remove_index:
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004488 ret = ocfs2_dx_dir_remove_index(dir, di_bh, dx_root_bh);
4489 if (ret) {
4490 mlog_errno(ret);
4491 goto out;
4492 }
4493
Joel Becker8cb471e2009-02-10 20:00:41 -08004494 ocfs2_remove_from_cache(INODE_CACHE(dir), dx_root_bh);
Mark Fasheh9b7895e2008-11-12 16:27:44 -08004495out:
4496 ocfs2_schedule_truncate_log_flush(osb, 1);
4497 ocfs2_run_deallocs(osb, &dealloc);
4498
4499 brelse(dx_root_bh);
4500 return ret;
4501}