2 * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
3 * Copyright (C) 2004-2006 Red Hat, Inc. All rights reserved.
5 * This copyrighted material is made available to anyone wishing to use,
6 * modify, copy, or redistribute it subject to the terms and conditions
7 * of the GNU General Public License version 2.
11 * Implements Extendible Hashing as described in:
12 * "Extendible Hashing" by Fagin, et al in
13 * __ACM Trans. on Database Systems__, Sept 1979.
16 * Here's the layout of dirents which is essentially the same as that of ext2
17 * within a single block. The field de_name_len is the number of bytes
18 * actually required for the name (no null terminator). The field de_rec_len
19 * is the number of bytes allocated to the dirent. The offset of the next
20 * dirent in the block is (dirent + dirent->de_rec_len). When a dirent is
21 * deleted, the preceding dirent inherits its allocated space, ie
22 * prev->de_rec_len += deleted->de_rec_len. Since the next dirent is obtained
23 * by adding de_rec_len to the current dirent, this essentially causes the
24 * deleted dirent to get jumped over when iterating through all the dirents.
26 * When deleting the first dirent in a block, there is no previous dirent so
27 * the field de_ino is set to zero to designate it as deleted. When allocating
28 * a dirent, gfs2_dirent_alloc iterates through the dirents in a block. If the
29 * first dirent has (de_ino == 0) and de_rec_len is large enough, this first
30 * dirent is allocated. Otherwise it must go through all the 'used' dirents
31 * searching for one in which the amount of total space minus the amount of
32 * used space will provide enough space for the new dirent.
34 * There are two types of blocks in which dirents reside. In a stuffed dinode,
35 * the dirents begin at offset sizeof(struct gfs2_dinode) from the beginning of
36 * the block. In leaves, they begin at offset sizeof(struct gfs2_leaf) from the
37 * beginning of the leaf block. The dirents reside in leaves when
39 * dip->i_diskflags & GFS2_DIF_EXHASH is true
41 * Otherwise, the dirents are "linear", within a single stuffed dinode block.
43 * When the dirents are in leaves, the actual contents of the directory file are
44 * used as an array of 64-bit block pointers pointing to the leaf blocks. The
45 * dirents are NOT in the directory file itself. There can be more than one
46 * block pointer in the array that points to the same leaf. In fact, when a
47 * directory is first converted from linear to exhash, all of the pointers
48 * point to the same leaf.
50 * When a leaf is completely full, the size of the hash table can be
51 * doubled unless it is already at the maximum size which is hard coded into
52 * GFS2_DIR_MAX_DEPTH. After that, leaves are chained together in a linked list,
53 * but never before the maximum hash table size has been reached.
56 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
58 #include <linux/slab.h>
59 #include <linux/spinlock.h>
60 #include <linux/buffer_head.h>
61 #include <linux/sort.h>
62 #include <linux/gfs2_ondisk.h>
63 #include <linux/crc32.h>
64 #include <linux/vmalloc.h>
65 #include <linux/bio.h>
79 #define IS_LEAF 1 /* Hashed (leaf) directory */
80 #define IS_DINODE 2 /* Linear (stuffed dinode block) directory */
82 #define MAX_RA_BLOCKS 32 /* max read-ahead blocks */
84 #define gfs2_disk_hash2offset(h) (((u64)(h)) >> 1)
85 #define gfs2_dir_offset2hash(p) ((u32)(((u64)(p)) << 1))
86 #define GFS2_HASH_INDEX_MASK 0xffffc000
87 #define GFS2_USE_HASH_FLAG 0x2000
89 struct qstr gfs2_qdot __read_mostly;
90 struct qstr gfs2_qdotdot __read_mostly;
92 typedef int (*gfs2_dscan_t)(const struct gfs2_dirent *dent,
93 const struct qstr *name, void *opaque);
95 int gfs2_dir_get_new_buffer(struct gfs2_inode *ip, u64 block,
96 struct buffer_head **bhp)
98 struct buffer_head *bh;
100 bh = gfs2_meta_new(ip->i_gl, block);
101 gfs2_trans_add_meta(ip->i_gl, bh);
102 gfs2_metatype_set(bh, GFS2_METATYPE_JD, GFS2_FORMAT_JD);
103 gfs2_buffer_clear_tail(bh, sizeof(struct gfs2_meta_header));
108 static int gfs2_dir_get_existing_buffer(struct gfs2_inode *ip, u64 block,
109 struct buffer_head **bhp)
111 struct buffer_head *bh;
114 error = gfs2_meta_read(ip->i_gl, block, DIO_WAIT, 0, &bh);
117 if (gfs2_metatype_check(GFS2_SB(&ip->i_inode), bh, GFS2_METATYPE_JD)) {
125 static int gfs2_dir_write_stuffed(struct gfs2_inode *ip, const char *buf,
126 unsigned int offset, unsigned int size)
128 struct buffer_head *dibh;
131 error = gfs2_meta_inode_buffer(ip, &dibh);
135 gfs2_trans_add_meta(ip->i_gl, dibh);
136 memcpy(dibh->b_data + offset + sizeof(struct gfs2_dinode), buf, size);
137 if (ip->i_inode.i_size < offset + size)
138 i_size_write(&ip->i_inode, offset + size);
139 ip->i_inode.i_mtime = ip->i_inode.i_ctime = current_time(&ip->i_inode);
140 gfs2_dinode_out(ip, dibh->b_data);
150 * gfs2_dir_write_data - Write directory information to the inode
151 * @ip: The GFS2 inode
152 * @buf: The buffer containing information to be written
153 * @offset: The file offset to start writing at
154 * @size: The amount of data to write
156 * Returns: The number of bytes correctly written or error code
158 static int gfs2_dir_write_data(struct gfs2_inode *ip, const char *buf,
159 u64 offset, unsigned int size)
161 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
162 struct buffer_head *dibh;
173 if (gfs2_is_stuffed(ip) && offset + size <= gfs2_max_stuffed_size(ip))
174 return gfs2_dir_write_stuffed(ip, buf, (unsigned int)offset,
177 if (gfs2_assert_warn(sdp, gfs2_is_jdata(ip)))
180 if (gfs2_is_stuffed(ip)) {
181 error = gfs2_unstuff_dinode(ip, NULL);
187 o = do_div(lblock, sdp->sd_jbsize) + sizeof(struct gfs2_meta_header);
189 while (copied < size) {
191 struct buffer_head *bh;
193 amount = size - copied;
194 if (amount > sdp->sd_sb.sb_bsize - o)
195 amount = sdp->sd_sb.sb_bsize - o;
199 error = gfs2_extent_map(&ip->i_inode, lblock, &new,
204 if (gfs2_assert_withdraw(sdp, dblock))
208 if (amount == sdp->sd_jbsize || new)
209 error = gfs2_dir_get_new_buffer(ip, dblock, &bh);
211 error = gfs2_dir_get_existing_buffer(ip, dblock, &bh);
216 gfs2_trans_add_meta(ip->i_gl, bh);
217 memcpy(bh->b_data + o, buf, amount);
226 o = sizeof(struct gfs2_meta_header);
230 error = gfs2_meta_inode_buffer(ip, &dibh);
234 if (ip->i_inode.i_size < offset + copied)
235 i_size_write(&ip->i_inode, offset + copied);
236 ip->i_inode.i_mtime = ip->i_inode.i_ctime = current_time(&ip->i_inode);
238 gfs2_trans_add_meta(ip->i_gl, dibh);
239 gfs2_dinode_out(ip, dibh->b_data);
249 static int gfs2_dir_read_stuffed(struct gfs2_inode *ip, __be64 *buf,
252 struct buffer_head *dibh;
255 error = gfs2_meta_inode_buffer(ip, &dibh);
257 memcpy(buf, dibh->b_data + sizeof(struct gfs2_dinode), size);
261 return (error) ? error : size;
266 * gfs2_dir_read_data - Read a data from a directory inode
267 * @ip: The GFS2 Inode
268 * @buf: The buffer to place result into
269 * @size: Amount of data to transfer
271 * Returns: The amount of data actually copied or the error
273 static int gfs2_dir_read_data(struct gfs2_inode *ip, __be64 *buf,
276 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
283 if (gfs2_is_stuffed(ip))
284 return gfs2_dir_read_stuffed(ip, buf, size);
286 if (gfs2_assert_warn(sdp, gfs2_is_jdata(ip)))
290 o = do_div(lblock, sdp->sd_jbsize) + sizeof(struct gfs2_meta_header);
292 while (copied < size) {
294 struct buffer_head *bh;
297 amount = size - copied;
298 if (amount > sdp->sd_sb.sb_bsize - o)
299 amount = sdp->sd_sb.sb_bsize - o;
303 error = gfs2_extent_map(&ip->i_inode, lblock, &new,
305 if (error || !dblock)
308 bh = gfs2_meta_ra(ip->i_gl, dblock, extlen);
310 error = gfs2_meta_read(ip->i_gl, dblock, DIO_WAIT, 0, &bh);
314 error = gfs2_metatype_check(sdp, bh, GFS2_METATYPE_JD);
321 memcpy(buf, bh->b_data + o, amount);
323 buf += (amount/sizeof(__be64));
326 o = sizeof(struct gfs2_meta_header);
331 return (copied) ? copied : error;
335 * gfs2_dir_get_hash_table - Get pointer to the dir hash table
336 * @ip: The inode in question
338 * Returns: The hash table or an error
341 static __be64 *gfs2_dir_get_hash_table(struct gfs2_inode *ip)
343 struct inode *inode = &ip->i_inode;
348 BUG_ON(!(ip->i_diskflags & GFS2_DIF_EXHASH));
350 hc = ip->i_hash_cache;
354 hsize = BIT(ip->i_depth);
355 hsize *= sizeof(__be64);
356 if (hsize != i_size_read(&ip->i_inode)) {
357 gfs2_consist_inode(ip);
358 return ERR_PTR(-EIO);
361 hc = kmalloc(hsize, GFP_NOFS | __GFP_NOWARN);
363 hc = __vmalloc(hsize, GFP_NOFS, PAGE_KERNEL);
366 return ERR_PTR(-ENOMEM);
368 ret = gfs2_dir_read_data(ip, hc, hsize);
374 spin_lock(&inode->i_lock);
375 if (likely(!ip->i_hash_cache)) {
376 ip->i_hash_cache = hc;
379 spin_unlock(&inode->i_lock);
382 return ip->i_hash_cache;
386 * gfs2_dir_hash_inval - Invalidate dir hash
387 * @ip: The directory inode
389 * Must be called with an exclusive glock, or during glock invalidation.
391 void gfs2_dir_hash_inval(struct gfs2_inode *ip)
395 spin_lock(&ip->i_inode.i_lock);
396 hc = ip->i_hash_cache;
397 ip->i_hash_cache = NULL;
398 spin_unlock(&ip->i_inode.i_lock);
403 static inline int gfs2_dirent_sentinel(const struct gfs2_dirent *dent)
405 return dent->de_inum.no_addr == 0 || dent->de_inum.no_formal_ino == 0;
408 static inline int __gfs2_dirent_find(const struct gfs2_dirent *dent,
409 const struct qstr *name, int ret)
411 if (!gfs2_dirent_sentinel(dent) &&
412 be32_to_cpu(dent->de_hash) == name->hash &&
413 be16_to_cpu(dent->de_name_len) == name->len &&
414 memcmp(dent+1, name->name, name->len) == 0)
419 static int gfs2_dirent_find(const struct gfs2_dirent *dent,
420 const struct qstr *name,
423 return __gfs2_dirent_find(dent, name, 1);
426 static int gfs2_dirent_prev(const struct gfs2_dirent *dent,
427 const struct qstr *name,
430 return __gfs2_dirent_find(dent, name, 2);
434 * name->name holds ptr to start of block.
435 * name->len holds size of block.
437 static int gfs2_dirent_last(const struct gfs2_dirent *dent,
438 const struct qstr *name,
441 const char *start = name->name;
442 const char *end = (const char *)dent + be16_to_cpu(dent->de_rec_len);
443 if (name->len == (end - start))
448 /* Look for the dirent that contains the offset specified in data. Once we
449 * find that dirent, there must be space available there for the new dirent */
450 static int gfs2_dirent_find_offset(const struct gfs2_dirent *dent,
451 const struct qstr *name,
454 unsigned required = GFS2_DIRENT_SIZE(name->len);
455 unsigned actual = GFS2_DIRENT_SIZE(be16_to_cpu(dent->de_name_len));
456 unsigned totlen = be16_to_cpu(dent->de_rec_len);
458 if (ptr < (void *)dent || ptr >= (void *)dent + totlen)
460 if (gfs2_dirent_sentinel(dent))
462 if (ptr < (void *)dent + actual)
464 if ((void *)dent + totlen >= ptr + required)
469 static int gfs2_dirent_find_space(const struct gfs2_dirent *dent,
470 const struct qstr *name,
473 unsigned required = GFS2_DIRENT_SIZE(name->len);
474 unsigned actual = GFS2_DIRENT_SIZE(be16_to_cpu(dent->de_name_len));
475 unsigned totlen = be16_to_cpu(dent->de_rec_len);
477 if (gfs2_dirent_sentinel(dent))
479 if (totlen - actual >= required)
484 struct dirent_gather {
485 const struct gfs2_dirent **pdent;
489 static int gfs2_dirent_gather(const struct gfs2_dirent *dent,
490 const struct qstr *name,
493 struct dirent_gather *g = opaque;
494 if (!gfs2_dirent_sentinel(dent)) {
495 g->pdent[g->offset++] = dent;
501 * Other possible things to check:
502 * - Inode located within filesystem size (and on valid block)
503 * - Valid directory entry type
504 * Not sure how heavy-weight we want to make this... could also check
505 * hash is correct for example, but that would take a lot of extra time.
506 * For now the most important thing is to check that the various sizes
509 static int gfs2_check_dirent(struct gfs2_dirent *dent, unsigned int offset,
510 unsigned int size, unsigned int len, int first)
512 const char *msg = "gfs2_dirent too small";
513 if (unlikely(size < sizeof(struct gfs2_dirent)))
515 msg = "gfs2_dirent misaligned";
516 if (unlikely(offset & 0x7))
518 msg = "gfs2_dirent points beyond end of block";
519 if (unlikely(offset + size > len))
521 msg = "zero inode number";
522 if (unlikely(!first && gfs2_dirent_sentinel(dent)))
524 msg = "name length is greater than space in dirent";
525 if (!gfs2_dirent_sentinel(dent) &&
526 unlikely(sizeof(struct gfs2_dirent)+be16_to_cpu(dent->de_name_len) >
531 pr_warn("%s: %s (%s)\n",
532 __func__, msg, first ? "first in block" : "not first in block");
536 static int gfs2_dirent_offset(const void *buf)
538 const struct gfs2_meta_header *h = buf;
543 switch(be32_to_cpu(h->mh_type)) {
544 case GFS2_METATYPE_LF:
545 offset = sizeof(struct gfs2_leaf);
547 case GFS2_METATYPE_DI:
548 offset = sizeof(struct gfs2_dinode);
555 pr_warn("%s: wrong block type %u\n", __func__, be32_to_cpu(h->mh_type));
559 static struct gfs2_dirent *gfs2_dirent_scan(struct inode *inode, void *buf,
560 unsigned int len, gfs2_dscan_t scan,
561 const struct qstr *name,
564 struct gfs2_dirent *dent, *prev;
569 ret = gfs2_dirent_offset(buf);
576 size = be16_to_cpu(dent->de_rec_len);
577 if (gfs2_check_dirent(dent, offset, size, len, 1))
580 ret = scan(dent, name, opaque);
588 size = be16_to_cpu(dent->de_rec_len);
589 if (gfs2_check_dirent(dent, offset, size, len, 0))
599 return prev ? prev : dent;
606 gfs2_consist_inode(GFS2_I(inode));
607 return ERR_PTR(-EIO);
610 static int dirent_check_reclen(struct gfs2_inode *dip,
611 const struct gfs2_dirent *d, const void *end_p)
614 u16 rec_len = be16_to_cpu(d->de_rec_len);
616 if (unlikely(rec_len < sizeof(struct gfs2_dirent)))
624 gfs2_consist_inode(dip);
629 * dirent_next - Next dirent
630 * @dip: the directory
632 * @dent: Pointer to list of dirents
634 * Returns: 0 on success, error code otherwise
637 static int dirent_next(struct gfs2_inode *dip, struct buffer_head *bh,
638 struct gfs2_dirent **dent)
640 struct gfs2_dirent *cur = *dent, *tmp;
641 char *bh_end = bh->b_data + bh->b_size;
644 ret = dirent_check_reclen(dip, cur, bh_end);
648 tmp = (void *)cur + ret;
649 ret = dirent_check_reclen(dip, tmp, bh_end);
653 /* Only the first dent could ever have de_inum.no_addr == 0 */
654 if (gfs2_dirent_sentinel(tmp)) {
655 gfs2_consist_inode(dip);
664 * dirent_del - Delete a dirent
665 * @dip: The GFS2 inode
667 * @prev: The previous dirent
668 * @cur: The current dirent
672 static void dirent_del(struct gfs2_inode *dip, struct buffer_head *bh,
673 struct gfs2_dirent *prev, struct gfs2_dirent *cur)
675 u16 cur_rec_len, prev_rec_len;
677 if (gfs2_dirent_sentinel(cur)) {
678 gfs2_consist_inode(dip);
682 gfs2_trans_add_meta(dip->i_gl, bh);
684 /* If there is no prev entry, this is the first entry in the block.
685 The de_rec_len is already as big as it needs to be. Just zero
686 out the inode number and return. */
689 cur->de_inum.no_addr = 0;
690 cur->de_inum.no_formal_ino = 0;
694 /* Combine this dentry with the previous one. */
696 prev_rec_len = be16_to_cpu(prev->de_rec_len);
697 cur_rec_len = be16_to_cpu(cur->de_rec_len);
699 if ((char *)prev + prev_rec_len != (char *)cur)
700 gfs2_consist_inode(dip);
701 if ((char *)cur + cur_rec_len > bh->b_data + bh->b_size)
702 gfs2_consist_inode(dip);
704 prev_rec_len += cur_rec_len;
705 prev->de_rec_len = cpu_to_be16(prev_rec_len);
709 static struct gfs2_dirent *do_init_dirent(struct inode *inode,
710 struct gfs2_dirent *dent,
711 const struct qstr *name,
712 struct buffer_head *bh,
715 struct gfs2_inode *ip = GFS2_I(inode);
716 struct gfs2_dirent *ndent;
719 totlen = be16_to_cpu(dent->de_rec_len);
720 BUG_ON(offset + name->len > totlen);
721 gfs2_trans_add_meta(ip->i_gl, bh);
722 ndent = (struct gfs2_dirent *)((char *)dent + offset);
723 dent->de_rec_len = cpu_to_be16(offset);
724 gfs2_qstr2dirent(name, totlen - offset, ndent);
730 * Takes a dent from which to grab space as an argument. Returns the
731 * newly created dent.
733 static struct gfs2_dirent *gfs2_init_dirent(struct inode *inode,
734 struct gfs2_dirent *dent,
735 const struct qstr *name,
736 struct buffer_head *bh)
740 if (!gfs2_dirent_sentinel(dent))
741 offset = GFS2_DIRENT_SIZE(be16_to_cpu(dent->de_name_len));
742 return do_init_dirent(inode, dent, name, bh, offset);
745 static struct gfs2_dirent *gfs2_dirent_split_alloc(struct inode *inode,
746 struct buffer_head *bh,
747 const struct qstr *name,
750 struct gfs2_dirent *dent;
751 dent = gfs2_dirent_scan(inode, bh->b_data, bh->b_size,
752 gfs2_dirent_find_offset, name, ptr);
753 if (!dent || IS_ERR(dent))
755 return do_init_dirent(inode, dent, name, bh,
756 (unsigned)(ptr - (void *)dent));
759 static int get_leaf(struct gfs2_inode *dip, u64 leaf_no,
760 struct buffer_head **bhp)
764 error = gfs2_meta_read(dip->i_gl, leaf_no, DIO_WAIT, 0, bhp);
765 if (!error && gfs2_metatype_check(GFS2_SB(&dip->i_inode), *bhp, GFS2_METATYPE_LF)) {
766 /* pr_info("block num=%llu\n", leaf_no); */
774 * get_leaf_nr - Get a leaf number associated with the index
775 * @dip: The GFS2 inode
779 * Returns: 0 on success, error code otherwise
782 static int get_leaf_nr(struct gfs2_inode *dip, u32 index,
788 hash = gfs2_dir_get_hash_table(dip);
789 error = PTR_ERR_OR_ZERO(hash);
792 *leaf_out = be64_to_cpu(*(hash + index));
797 static int get_first_leaf(struct gfs2_inode *dip, u32 index,
798 struct buffer_head **bh_out)
803 error = get_leaf_nr(dip, index, &leaf_no);
805 error = get_leaf(dip, leaf_no, bh_out);
810 static struct gfs2_dirent *gfs2_dirent_search(struct inode *inode,
811 const struct qstr *name,
813 struct buffer_head **pbh)
815 struct buffer_head *bh;
816 struct gfs2_dirent *dent;
817 struct gfs2_inode *ip = GFS2_I(inode);
820 if (ip->i_diskflags & GFS2_DIF_EXHASH) {
821 struct gfs2_leaf *leaf;
822 unsigned int hsize = BIT(ip->i_depth);
825 if (hsize * sizeof(u64) != i_size_read(inode)) {
826 gfs2_consist_inode(ip);
827 return ERR_PTR(-EIO);
830 index = name->hash >> (32 - ip->i_depth);
831 error = get_first_leaf(ip, index, &bh);
833 return ERR_PTR(error);
835 dent = gfs2_dirent_scan(inode, bh->b_data, bh->b_size,
839 leaf = (struct gfs2_leaf *)bh->b_data;
840 ln = be64_to_cpu(leaf->lf_next);
845 error = get_leaf(ip, ln, &bh);
848 return error ? ERR_PTR(error) : NULL;
852 error = gfs2_meta_inode_buffer(ip, &bh);
854 return ERR_PTR(error);
855 dent = gfs2_dirent_scan(inode, bh->b_data, bh->b_size, scan, name, NULL);
857 if (unlikely(dent == NULL || IS_ERR(dent))) {
865 static struct gfs2_leaf *new_leaf(struct inode *inode, struct buffer_head **pbh, u16 depth)
867 struct gfs2_inode *ip = GFS2_I(inode);
871 struct buffer_head *bh;
872 struct gfs2_leaf *leaf;
873 struct gfs2_dirent *dent;
874 struct timespec64 tv = current_time(inode);
876 error = gfs2_alloc_blocks(ip, &bn, &n, 0, NULL);
879 bh = gfs2_meta_new(ip->i_gl, bn);
883 gfs2_trans_add_unrevoke(GFS2_SB(inode), bn, 1);
884 gfs2_trans_add_meta(ip->i_gl, bh);
885 gfs2_metatype_set(bh, GFS2_METATYPE_LF, GFS2_FORMAT_LF);
886 leaf = (struct gfs2_leaf *)bh->b_data;
887 leaf->lf_depth = cpu_to_be16(depth);
888 leaf->lf_entries = 0;
889 leaf->lf_dirent_format = cpu_to_be32(GFS2_FORMAT_DE);
891 leaf->lf_inode = cpu_to_be64(ip->i_no_addr);
892 leaf->lf_dist = cpu_to_be32(1);
893 leaf->lf_nsec = cpu_to_be32(tv.tv_nsec);
894 leaf->lf_sec = cpu_to_be64(tv.tv_sec);
895 memset(leaf->lf_reserved2, 0, sizeof(leaf->lf_reserved2));
896 dent = (struct gfs2_dirent *)(leaf+1);
897 gfs2_qstr2dirent(&empty_name, bh->b_size - sizeof(struct gfs2_leaf), dent);
903 * dir_make_exhash - Convert a stuffed directory into an ExHash directory
904 * @dip: The GFS2 inode
906 * Returns: 0 on success, error code otherwise
909 static int dir_make_exhash(struct inode *inode)
911 struct gfs2_inode *dip = GFS2_I(inode);
912 struct gfs2_sbd *sdp = GFS2_SB(inode);
913 struct gfs2_dirent *dent;
915 struct buffer_head *bh, *dibh;
916 struct gfs2_leaf *leaf;
923 error = gfs2_meta_inode_buffer(dip, &dibh);
927 /* Turn over a new leaf */
929 leaf = new_leaf(inode, &bh, 0);
934 gfs2_assert(sdp, dip->i_entries < BIT(16));
935 leaf->lf_entries = cpu_to_be16(dip->i_entries);
939 gfs2_buffer_copy_tail(bh, sizeof(struct gfs2_leaf), dibh,
940 sizeof(struct gfs2_dinode));
942 /* Find last entry */
945 args.len = bh->b_size - sizeof(struct gfs2_dinode) +
946 sizeof(struct gfs2_leaf);
947 args.name = bh->b_data;
948 dent = gfs2_dirent_scan(&dip->i_inode, bh->b_data, bh->b_size,
949 gfs2_dirent_last, &args, NULL);
958 return PTR_ERR(dent);
961 /* Adjust the last dirent's record length
962 (Remember that dent still points to the last entry.) */
964 dent->de_rec_len = cpu_to_be16(be16_to_cpu(dent->de_rec_len) +
965 sizeof(struct gfs2_dinode) -
966 sizeof(struct gfs2_leaf));
970 /* We're done with the new leaf block, now setup the new
973 gfs2_trans_add_meta(dip->i_gl, dibh);
974 gfs2_buffer_clear_tail(dibh, sizeof(struct gfs2_dinode));
976 lp = (__be64 *)(dibh->b_data + sizeof(struct gfs2_dinode));
978 for (x = sdp->sd_hash_ptrs; x--; lp++)
979 *lp = cpu_to_be64(bn);
981 i_size_write(inode, sdp->sd_sb.sb_bsize / 2);
982 gfs2_add_inode_blocks(&dip->i_inode, 1);
983 dip->i_diskflags |= GFS2_DIF_EXHASH;
985 for (x = sdp->sd_hash_ptrs, y = -1; x; x >>= 1, y++) ;
988 gfs2_dinode_out(dip, dibh->b_data);
996 * dir_split_leaf - Split a leaf block into two
997 * @dip: The GFS2 inode
1001 * Returns: 0 on success, error code on failure
1004 static int dir_split_leaf(struct inode *inode, const struct qstr *name)
1006 struct gfs2_inode *dip = GFS2_I(inode);
1007 struct buffer_head *nbh, *obh, *dibh;
1008 struct gfs2_leaf *nleaf, *oleaf;
1009 struct gfs2_dirent *dent = NULL, *prev = NULL, *next = NULL, *new;
1010 u32 start, len, half_len, divider;
1017 index = name->hash >> (32 - dip->i_depth);
1018 error = get_leaf_nr(dip, index, &leaf_no);
1022 /* Get the old leaf block */
1023 error = get_leaf(dip, leaf_no, &obh);
1027 oleaf = (struct gfs2_leaf *)obh->b_data;
1028 if (dip->i_depth == be16_to_cpu(oleaf->lf_depth)) {
1030 return 1; /* can't split */
1033 gfs2_trans_add_meta(dip->i_gl, obh);
1035 nleaf = new_leaf(inode, &nbh, be16_to_cpu(oleaf->lf_depth) + 1);
1040 bn = nbh->b_blocknr;
1042 /* Compute the start and len of leaf pointers in the hash table. */
1043 len = BIT(dip->i_depth - be16_to_cpu(oleaf->lf_depth));
1044 half_len = len >> 1;
1046 pr_warn("i_depth %u lf_depth %u index %u\n",
1047 dip->i_depth, be16_to_cpu(oleaf->lf_depth), index);
1048 gfs2_consist_inode(dip);
1053 start = (index & ~(len - 1));
1055 /* Change the pointers.
1056 Don't bother distinguishing stuffed from non-stuffed.
1057 This code is complicated enough already. */
1058 lp = kmalloc_array(half_len, sizeof(__be64), GFP_NOFS);
1064 /* Change the pointers */
1065 for (x = 0; x < half_len; x++)
1066 lp[x] = cpu_to_be64(bn);
1068 gfs2_dir_hash_inval(dip);
1070 error = gfs2_dir_write_data(dip, (char *)lp, start * sizeof(u64),
1071 half_len * sizeof(u64));
1072 if (error != half_len * sizeof(u64)) {
1080 /* Compute the divider */
1081 divider = (start + half_len) << (32 - dip->i_depth);
1083 /* Copy the entries */
1084 dent = (struct gfs2_dirent *)(obh->b_data + sizeof(struct gfs2_leaf));
1088 if (dirent_next(dip, obh, &next))
1091 if (!gfs2_dirent_sentinel(dent) &&
1092 be32_to_cpu(dent->de_hash) < divider) {
1094 void *ptr = ((char *)dent - obh->b_data) + nbh->b_data;
1095 str.name = (char*)(dent+1);
1096 str.len = be16_to_cpu(dent->de_name_len);
1097 str.hash = be32_to_cpu(dent->de_hash);
1098 new = gfs2_dirent_split_alloc(inode, nbh, &str, ptr);
1100 error = PTR_ERR(new);
1104 new->de_inum = dent->de_inum; /* No endian worries */
1105 new->de_type = dent->de_type; /* No endian worries */
1106 be16_add_cpu(&nleaf->lf_entries, 1);
1108 dirent_del(dip, obh, prev, dent);
1110 if (!oleaf->lf_entries)
1111 gfs2_consist_inode(dip);
1112 be16_add_cpu(&oleaf->lf_entries, -1);
1124 oleaf->lf_depth = nleaf->lf_depth;
1126 error = gfs2_meta_inode_buffer(dip, &dibh);
1127 if (!gfs2_assert_withdraw(GFS2_SB(&dip->i_inode), !error)) {
1128 gfs2_trans_add_meta(dip->i_gl, dibh);
1129 gfs2_add_inode_blocks(&dip->i_inode, 1);
1130 gfs2_dinode_out(dip, dibh->b_data);
1149 * dir_double_exhash - Double size of ExHash table
1150 * @dip: The GFS2 dinode
1152 * Returns: 0 on success, error code on failure
1155 static int dir_double_exhash(struct gfs2_inode *dip)
1157 struct buffer_head *dibh;
1165 hsize = BIT(dip->i_depth);
1166 hsize_bytes = hsize * sizeof(__be64);
1168 hc = gfs2_dir_get_hash_table(dip);
1172 hc2 = kmalloc_array(hsize_bytes, 2, GFP_NOFS | __GFP_NOWARN);
1174 hc2 = __vmalloc(hsize_bytes * 2, GFP_NOFS, PAGE_KERNEL);
1180 error = gfs2_meta_inode_buffer(dip, &dibh);
1184 for (x = 0; x < hsize; x++) {
1190 error = gfs2_dir_write_data(dip, (char *)hc2, 0, hsize_bytes * 2);
1191 if (error != (hsize_bytes * 2))
1194 gfs2_dir_hash_inval(dip);
1195 dip->i_hash_cache = hc2;
1197 gfs2_dinode_out(dip, dibh->b_data);
1202 /* Replace original hash table & size */
1203 gfs2_dir_write_data(dip, (char *)hc, 0, hsize_bytes);
1204 i_size_write(&dip->i_inode, hsize_bytes);
1205 gfs2_dinode_out(dip, dibh->b_data);
1213 * compare_dents - compare directory entries by hash value
1217 * When comparing the hash entries of @a to @b:
1223 static int compare_dents(const void *a, const void *b)
1225 const struct gfs2_dirent *dent_a, *dent_b;
1229 dent_a = *(const struct gfs2_dirent **)a;
1230 hash_a = dent_a->de_cookie;
1232 dent_b = *(const struct gfs2_dirent **)b;
1233 hash_b = dent_b->de_cookie;
1235 if (hash_a > hash_b)
1237 else if (hash_a < hash_b)
1240 unsigned int len_a = be16_to_cpu(dent_a->de_name_len);
1241 unsigned int len_b = be16_to_cpu(dent_b->de_name_len);
1245 else if (len_a < len_b)
1248 ret = memcmp(dent_a + 1, dent_b + 1, len_a);
1255 * do_filldir_main - read out directory entries
1256 * @dip: The GFS2 inode
1257 * @ctx: what to feed the entries to
1258 * @darr: an array of struct gfs2_dirent pointers to read
1259 * @entries: the number of entries in darr
1260 * @copied: pointer to int that's non-zero if a entry has been copied out
1262 * Jump through some hoops to make sure that if there are hash collsions,
1263 * they are read out at the beginning of a buffer. We want to minimize
1264 * the possibility that they will fall into different readdir buffers or
1265 * that someone will want to seek to that location.
1267 * Returns: errno, >0 if the actor tells you to stop
1270 static int do_filldir_main(struct gfs2_inode *dip, struct dir_context *ctx,
1271 struct gfs2_dirent **darr, u32 entries,
1272 u32 sort_start, int *copied)
1274 const struct gfs2_dirent *dent, *dent_next;
1279 if (sort_start < entries)
1280 sort(&darr[sort_start], entries - sort_start,
1281 sizeof(struct gfs2_dirent *), compare_dents, NULL);
1283 dent_next = darr[0];
1284 off_next = dent_next->de_cookie;
1286 for (x = 0, y = 1; x < entries; x++, y++) {
1291 dent_next = darr[y];
1292 off_next = dent_next->de_cookie;
1298 if (off_next == off) {
1299 if (*copied && !run)
1310 if (!dir_emit(ctx, (const char *)(dent + 1),
1311 be16_to_cpu(dent->de_name_len),
1312 be64_to_cpu(dent->de_inum.no_addr),
1313 be16_to_cpu(dent->de_type)))
1319 /* Increment the ctx->pos by one, so the next time we come into the
1320 do_filldir fxn, we get the next entry instead of the last one in the
1328 static void *gfs2_alloc_sort_buffer(unsigned size)
1332 if (size < KMALLOC_MAX_SIZE)
1333 ptr = kmalloc(size, GFP_NOFS | __GFP_NOWARN);
1335 ptr = __vmalloc(size, GFP_NOFS, PAGE_KERNEL);
1340 static int gfs2_set_cookies(struct gfs2_sbd *sdp, struct buffer_head *bh,
1341 unsigned leaf_nr, struct gfs2_dirent **darr,
1347 for (i = 0; i < entries; i++) {
1350 darr[i]->de_cookie = be32_to_cpu(darr[i]->de_hash);
1351 darr[i]->de_cookie = gfs2_disk_hash2offset(darr[i]->de_cookie);
1353 if (!sdp->sd_args.ar_loccookie)
1355 offset = (char *)(darr[i]) -
1356 (bh->b_data + gfs2_dirent_offset(bh->b_data));
1357 offset /= GFS2_MIN_DIRENT_SIZE;
1358 offset += leaf_nr * sdp->sd_max_dents_per_leaf;
1359 if (offset >= GFS2_USE_HASH_FLAG ||
1360 leaf_nr >= GFS2_USE_HASH_FLAG) {
1361 darr[i]->de_cookie |= GFS2_USE_HASH_FLAG;
1366 darr[i]->de_cookie &= GFS2_HASH_INDEX_MASK;
1367 darr[i]->de_cookie |= offset;
1373 static int gfs2_dir_read_leaf(struct inode *inode, struct dir_context *ctx,
1374 int *copied, unsigned *depth,
1377 struct gfs2_inode *ip = GFS2_I(inode);
1378 struct gfs2_sbd *sdp = GFS2_SB(inode);
1379 struct buffer_head *bh;
1380 struct gfs2_leaf *lf;
1381 unsigned entries = 0, entries2 = 0;
1382 unsigned leaves = 0, leaf = 0, offset, sort_offset;
1383 struct gfs2_dirent **darr, *dent;
1384 struct dirent_gather g;
1385 struct buffer_head **larr;
1386 int error, i, need_sort = 0, sort_id;
1390 error = get_leaf(ip, lfn, &bh);
1393 lf = (struct gfs2_leaf *)bh->b_data;
1395 *depth = be16_to_cpu(lf->lf_depth);
1396 entries += be16_to_cpu(lf->lf_entries);
1398 lfn = be64_to_cpu(lf->lf_next);
1402 if (*depth < GFS2_DIR_MAX_DEPTH || !sdp->sd_args.ar_loccookie) {
1412 * The extra 99 entries are not normally used, but are a buffer
1413 * zone in case the number of entries in the leaf is corrupt.
1414 * 99 is the maximum number of entries that can fit in a single
1417 larr = gfs2_alloc_sort_buffer((leaves + entries + 99) * sizeof(void *));
1420 darr = (struct gfs2_dirent **)(larr + leaves);
1421 g.pdent = (const struct gfs2_dirent **)darr;
1426 error = get_leaf(ip, lfn, &bh);
1429 lf = (struct gfs2_leaf *)bh->b_data;
1430 lfn = be64_to_cpu(lf->lf_next);
1431 if (lf->lf_entries) {
1433 entries2 += be16_to_cpu(lf->lf_entries);
1434 dent = gfs2_dirent_scan(inode, bh->b_data, bh->b_size,
1435 gfs2_dirent_gather, NULL, &g);
1436 error = PTR_ERR(dent);
1439 if (entries2 != g.offset) {
1440 fs_warn(sdp, "Number of entries corrupt in dir "
1441 "leaf %llu, entries2 (%u) != "
1443 (unsigned long long)bh->b_blocknr,
1444 entries2, g.offset);
1445 gfs2_consist_inode(ip);
1450 sort_id = gfs2_set_cookies(sdp, bh, leaf, &darr[offset],
1451 be16_to_cpu(lf->lf_entries));
1452 if (!need_sort && sort_id >= 0) {
1454 sort_offset = offset + sort_id;
1458 larr[leaf++] = NULL;
1463 BUG_ON(entries2 != entries);
1464 error = do_filldir_main(ip, ctx, darr, entries, need_sort ?
1465 sort_offset : entries, copied);
1467 for(i = 0; i < leaf; i++)
1476 * gfs2_dir_readahead - Issue read-ahead requests for leaf blocks.
1478 * Note: we can't calculate each index like dir_e_read can because we don't
1479 * have the leaf, and therefore we don't have the depth, and therefore we
1480 * don't have the length. So we have to just read enough ahead to make up
1481 * for the loss of information.
1483 static void gfs2_dir_readahead(struct inode *inode, unsigned hsize, u32 index,
1484 struct file_ra_state *f_ra)
1486 struct gfs2_inode *ip = GFS2_I(inode);
1487 struct gfs2_glock *gl = ip->i_gl;
1488 struct buffer_head *bh;
1489 u64 blocknr = 0, last;
1492 /* First check if we've already read-ahead for the whole range. */
1493 if (index + MAX_RA_BLOCKS < f_ra->start)
1496 f_ra->start = max((pgoff_t)index, f_ra->start);
1497 for (count = 0; count < MAX_RA_BLOCKS; count++) {
1498 if (f_ra->start >= hsize) /* if exceeded the hash table */
1502 blocknr = be64_to_cpu(ip->i_hash_cache[f_ra->start]);
1504 if (blocknr == last)
1507 bh = gfs2_getbuf(gl, blocknr, 1);
1508 if (trylock_buffer(bh)) {
1509 if (buffer_uptodate(bh)) {
1514 bh->b_end_io = end_buffer_read_sync;
1515 submit_bh(REQ_OP_READ,
1516 REQ_RAHEAD | REQ_META | REQ_PRIO,
1525 * dir_e_read - Reads the entries from a directory into a filldir buffer
1526 * @dip: dinode pointer
1527 * @ctx: actor to feed the entries to
1532 static int dir_e_read(struct inode *inode, struct dir_context *ctx,
1533 struct file_ra_state *f_ra)
1535 struct gfs2_inode *dip = GFS2_I(inode);
1543 hsize = BIT(dip->i_depth);
1544 hash = gfs2_dir_offset2hash(ctx->pos);
1545 index = hash >> (32 - dip->i_depth);
1547 if (dip->i_hash_cache == NULL)
1549 lp = gfs2_dir_get_hash_table(dip);
1553 gfs2_dir_readahead(inode, hsize, index, f_ra);
1555 while (index < hsize) {
1556 error = gfs2_dir_read_leaf(inode, ctx,
1558 be64_to_cpu(lp[index]));
1562 len = BIT(dip->i_depth - depth);
1563 index = (index & ~(len - 1)) + len;
1571 int gfs2_dir_read(struct inode *inode, struct dir_context *ctx,
1572 struct file_ra_state *f_ra)
1574 struct gfs2_inode *dip = GFS2_I(inode);
1575 struct gfs2_sbd *sdp = GFS2_SB(inode);
1576 struct dirent_gather g;
1577 struct gfs2_dirent **darr, *dent;
1578 struct buffer_head *dibh;
1582 if (!dip->i_entries)
1585 if (dip->i_diskflags & GFS2_DIF_EXHASH)
1586 return dir_e_read(inode, ctx, f_ra);
1588 if (!gfs2_is_stuffed(dip)) {
1589 gfs2_consist_inode(dip);
1593 error = gfs2_meta_inode_buffer(dip, &dibh);
1598 /* 96 is max number of dirents which can be stuffed into an inode */
1599 darr = kmalloc_array(96, sizeof(struct gfs2_dirent *), GFP_NOFS);
1601 g.pdent = (const struct gfs2_dirent **)darr;
1603 dent = gfs2_dirent_scan(inode, dibh->b_data, dibh->b_size,
1604 gfs2_dirent_gather, NULL, &g);
1606 error = PTR_ERR(dent);
1609 if (dip->i_entries != g.offset) {
1610 fs_warn(sdp, "Number of entries corrupt in dir %llu, "
1611 "ip->i_entries (%u) != g.offset (%u)\n",
1612 (unsigned long long)dip->i_no_addr,
1615 gfs2_consist_inode(dip);
1619 gfs2_set_cookies(sdp, dibh, 0, darr, dip->i_entries);
1620 error = do_filldir_main(dip, ctx, darr,
1621 dip->i_entries, 0, &copied);
1635 * gfs2_dir_search - Search a directory
1636 * @dip: The GFS2 dir inode
1637 * @name: The name we are looking up
1638 * @fail_on_exist: Fail if the name exists rather than looking it up
1640 * This routine searches a directory for a file or another directory.
1641 * Assumes a glock is held on dip.
1646 struct inode *gfs2_dir_search(struct inode *dir, const struct qstr *name,
1649 struct buffer_head *bh;
1650 struct gfs2_dirent *dent;
1651 u64 addr, formal_ino;
1654 dent = gfs2_dirent_search(dir, name, gfs2_dirent_find, &bh);
1656 struct inode *inode;
1660 return ERR_CAST(dent);
1661 dtype = be16_to_cpu(dent->de_type);
1662 rahead = be16_to_cpu(dent->de_rahead);
1663 addr = be64_to_cpu(dent->de_inum.no_addr);
1664 formal_ino = be64_to_cpu(dent->de_inum.no_formal_ino);
1667 return ERR_PTR(-EEXIST);
1668 inode = gfs2_inode_lookup(dir->i_sb, dtype, addr, formal_ino,
1669 GFS2_BLKST_FREE /* ignore */);
1671 GFS2_I(inode)->i_rahead = rahead;
1674 return ERR_PTR(-ENOENT);
1677 int gfs2_dir_check(struct inode *dir, const struct qstr *name,
1678 const struct gfs2_inode *ip)
1680 struct buffer_head *bh;
1681 struct gfs2_dirent *dent;
1684 dent = gfs2_dirent_search(dir, name, gfs2_dirent_find, &bh);
1687 return PTR_ERR(dent);
1689 if (be64_to_cpu(dent->de_inum.no_addr) != ip->i_no_addr)
1691 if (be64_to_cpu(dent->de_inum.no_formal_ino) !=
1692 ip->i_no_formal_ino)
1694 if (unlikely(IF2DT(ip->i_inode.i_mode) !=
1695 be16_to_cpu(dent->de_type))) {
1696 gfs2_consist_inode(GFS2_I(dir));
1709 * dir_new_leaf - Add a new leaf onto hash chain
1710 * @inode: The directory
1711 * @name: The name we are adding
1713 * This adds a new dir leaf onto an existing leaf when there is not
1714 * enough space to add a new dir entry. This is a last resort after
1715 * we've expanded the hash table to max size and also split existing
1716 * leaf blocks, so it will only occur for very large directories.
1718 * The dist parameter is set to 1 for leaf blocks directly attached
1719 * to the hash table, 2 for one layer of indirection, 3 for two layers
1720 * etc. We are thus able to tell the difference between an old leaf
1721 * with dist set to zero (i.e. "don't know") and a new one where we
1722 * set this information for debug/fsck purposes.
1724 * Returns: 0 on success, or -ve on error
1727 static int dir_new_leaf(struct inode *inode, const struct qstr *name)
1729 struct buffer_head *bh, *obh;
1730 struct gfs2_inode *ip = GFS2_I(inode);
1731 struct gfs2_leaf *leaf, *oleaf;
1737 index = name->hash >> (32 - ip->i_depth);
1738 error = get_first_leaf(ip, index, &obh);
1743 oleaf = (struct gfs2_leaf *)obh->b_data;
1744 bn = be64_to_cpu(oleaf->lf_next);
1748 error = get_leaf(ip, bn, &obh);
1753 gfs2_trans_add_meta(ip->i_gl, obh);
1755 leaf = new_leaf(inode, &bh, be16_to_cpu(oleaf->lf_depth));
1760 leaf->lf_dist = cpu_to_be32(dist);
1761 oleaf->lf_next = cpu_to_be64(bh->b_blocknr);
1765 error = gfs2_meta_inode_buffer(ip, &bh);
1768 gfs2_trans_add_meta(ip->i_gl, bh);
1769 gfs2_add_inode_blocks(&ip->i_inode, 1);
1770 gfs2_dinode_out(ip, bh->b_data);
1775 static u16 gfs2_inode_ra_len(const struct gfs2_inode *ip)
1777 u64 where = ip->i_no_addr + 1;
1778 if (ip->i_eattr == where)
1784 * gfs2_dir_add - Add new filename into directory
1785 * @inode: The directory inode
1786 * @name: The new name
1787 * @nip: The GFS2 inode to be linked in to the directory
1788 * @da: The directory addition info
1790 * If the call to gfs2_diradd_alloc_required resulted in there being
1791 * no need to allocate any new directory blocks, then it will contain
1792 * a pointer to the directory entry and the bh in which it resides. We
1793 * can use that without having to repeat the search. If there was no
1794 * free space, then we must now create more space.
1796 * Returns: 0 on success, error code on failure
1799 int gfs2_dir_add(struct inode *inode, const struct qstr *name,
1800 const struct gfs2_inode *nip, struct gfs2_diradd *da)
1802 struct gfs2_inode *ip = GFS2_I(inode);
1803 struct buffer_head *bh = da->bh;
1804 struct gfs2_dirent *dent = da->dent;
1805 struct timespec64 tv;
1806 struct gfs2_leaf *leaf;
1810 if (da->bh == NULL) {
1811 dent = gfs2_dirent_search(inode, name,
1812 gfs2_dirent_find_space, &bh);
1816 return PTR_ERR(dent);
1817 dent = gfs2_init_dirent(inode, dent, name, bh);
1818 gfs2_inum_out(nip, dent);
1819 dent->de_type = cpu_to_be16(IF2DT(nip->i_inode.i_mode));
1820 dent->de_rahead = cpu_to_be16(gfs2_inode_ra_len(nip));
1821 tv = current_time(&ip->i_inode);
1822 if (ip->i_diskflags & GFS2_DIF_EXHASH) {
1823 leaf = (struct gfs2_leaf *)bh->b_data;
1824 be16_add_cpu(&leaf->lf_entries, 1);
1825 leaf->lf_nsec = cpu_to_be32(tv.tv_nsec);
1826 leaf->lf_sec = cpu_to_be64(tv.tv_sec);
1832 ip->i_inode.i_mtime = ip->i_inode.i_ctime = tv;
1833 if (S_ISDIR(nip->i_inode.i_mode))
1834 inc_nlink(&ip->i_inode);
1835 mark_inode_dirty(inode);
1839 if (!(ip->i_diskflags & GFS2_DIF_EXHASH)) {
1840 error = dir_make_exhash(inode);
1845 error = dir_split_leaf(inode, name);
1850 if (ip->i_depth < GFS2_DIR_MAX_DEPTH) {
1851 error = dir_double_exhash(ip);
1854 error = dir_split_leaf(inode, name);
1860 error = dir_new_leaf(inode, name);
1871 * gfs2_dir_del - Delete a directory entry
1872 * @dip: The GFS2 inode
1873 * @filename: The filename
1875 * Returns: 0 on success, error code on failure
1878 int gfs2_dir_del(struct gfs2_inode *dip, const struct dentry *dentry)
1880 const struct qstr *name = &dentry->d_name;
1881 struct gfs2_dirent *dent, *prev = NULL;
1882 struct buffer_head *bh;
1883 struct timespec64 tv = current_time(&dip->i_inode);
1885 /* Returns _either_ the entry (if its first in block) or the
1886 previous entry otherwise */
1887 dent = gfs2_dirent_search(&dip->i_inode, name, gfs2_dirent_prev, &bh);
1889 gfs2_consist_inode(dip);
1893 gfs2_consist_inode(dip);
1894 return PTR_ERR(dent);
1896 /* If not first in block, adjust pointers accordingly */
1897 if (gfs2_dirent_find(dent, name, NULL) == 0) {
1899 dent = (struct gfs2_dirent *)((char *)dent + be16_to_cpu(prev->de_rec_len));
1902 dirent_del(dip, bh, prev, dent);
1903 if (dip->i_diskflags & GFS2_DIF_EXHASH) {
1904 struct gfs2_leaf *leaf = (struct gfs2_leaf *)bh->b_data;
1905 u16 entries = be16_to_cpu(leaf->lf_entries);
1907 gfs2_consist_inode(dip);
1908 leaf->lf_entries = cpu_to_be16(--entries);
1909 leaf->lf_nsec = cpu_to_be32(tv.tv_nsec);
1910 leaf->lf_sec = cpu_to_be64(tv.tv_sec);
1914 if (!dip->i_entries)
1915 gfs2_consist_inode(dip);
1917 dip->i_inode.i_mtime = dip->i_inode.i_ctime = tv;
1918 if (d_is_dir(dentry))
1919 drop_nlink(&dip->i_inode);
1920 mark_inode_dirty(&dip->i_inode);
1926 * gfs2_dir_mvino - Change inode number of directory entry
1927 * @dip: The GFS2 inode
1931 * This routine changes the inode number of a directory entry. It's used
1932 * by rename to change ".." when a directory is moved.
1933 * Assumes a glock is held on dvp.
1938 int gfs2_dir_mvino(struct gfs2_inode *dip, const struct qstr *filename,
1939 const struct gfs2_inode *nip, unsigned int new_type)
1941 struct buffer_head *bh;
1942 struct gfs2_dirent *dent;
1944 dent = gfs2_dirent_search(&dip->i_inode, filename, gfs2_dirent_find, &bh);
1946 gfs2_consist_inode(dip);
1950 return PTR_ERR(dent);
1952 gfs2_trans_add_meta(dip->i_gl, bh);
1953 gfs2_inum_out(nip, dent);
1954 dent->de_type = cpu_to_be16(new_type);
1957 dip->i_inode.i_mtime = dip->i_inode.i_ctime = current_time(&dip->i_inode);
1958 mark_inode_dirty_sync(&dip->i_inode);
1963 * leaf_dealloc - Deallocate a directory leaf
1964 * @dip: the directory
1965 * @index: the hash table offset in the directory
1966 * @len: the number of pointers to this leaf
1967 * @leaf_no: the leaf number
1968 * @leaf_bh: buffer_head for the starting leaf
1969 * last_dealloc: 1 if this is the final dealloc for the leaf, else 0
1974 static int leaf_dealloc(struct gfs2_inode *dip, u32 index, u32 len,
1975 u64 leaf_no, struct buffer_head *leaf_bh,
1978 struct gfs2_sbd *sdp = GFS2_SB(&dip->i_inode);
1979 struct gfs2_leaf *tmp_leaf;
1980 struct gfs2_rgrp_list rlist;
1981 struct buffer_head *bh, *dibh;
1983 unsigned int rg_blocks = 0, l_blocks = 0;
1985 unsigned int x, size = len * sizeof(u64);
1988 error = gfs2_rindex_update(sdp);
1992 memset(&rlist, 0, sizeof(struct gfs2_rgrp_list));
1994 ht = kzalloc(size, GFP_NOFS | __GFP_NOWARN);
1996 ht = __vmalloc(size, GFP_NOFS | __GFP_NOWARN | __GFP_ZERO,
2001 error = gfs2_quota_hold(dip, NO_UID_QUOTA_CHANGE, NO_GID_QUOTA_CHANGE);
2005 /* Count the number of leaves */
2008 for (blk = leaf_no; blk; blk = nblk) {
2009 if (blk != leaf_no) {
2010 error = get_leaf(dip, blk, &bh);
2014 tmp_leaf = (struct gfs2_leaf *)bh->b_data;
2015 nblk = be64_to_cpu(tmp_leaf->lf_next);
2019 gfs2_rlist_add(dip, &rlist, blk);
2023 gfs2_rlist_alloc(&rlist, LM_ST_EXCLUSIVE);
2025 for (x = 0; x < rlist.rl_rgrps; x++) {
2026 struct gfs2_rgrpd *rgd = gfs2_glock2rgrp(rlist.rl_ghs[x].gh_gl);
2028 rg_blocks += rgd->rd_length;
2031 error = gfs2_glock_nq_m(rlist.rl_rgrps, rlist.rl_ghs);
2035 error = gfs2_trans_begin(sdp,
2036 rg_blocks + (DIV_ROUND_UP(size, sdp->sd_jbsize) + 1) +
2037 RES_DINODE + RES_STATFS + RES_QUOTA, l_blocks);
2039 goto out_rg_gunlock;
2043 for (blk = leaf_no; blk; blk = nblk) {
2044 if (blk != leaf_no) {
2045 error = get_leaf(dip, blk, &bh);
2049 tmp_leaf = (struct gfs2_leaf *)bh->b_data;
2050 nblk = be64_to_cpu(tmp_leaf->lf_next);
2054 gfs2_free_meta(dip, blk, 1);
2055 gfs2_add_inode_blocks(&dip->i_inode, -1);
2058 error = gfs2_dir_write_data(dip, ht, index * sizeof(u64), size);
2059 if (error != size) {
2065 error = gfs2_meta_inode_buffer(dip, &dibh);
2069 gfs2_trans_add_meta(dip->i_gl, dibh);
2070 /* On the last dealloc, make this a regular file in case we crash.
2071 (We don't want to free these blocks a second time.) */
2073 dip->i_inode.i_mode = S_IFREG;
2074 gfs2_dinode_out(dip, dibh->b_data);
2078 gfs2_trans_end(sdp);
2080 gfs2_glock_dq_m(rlist.rl_rgrps, rlist.rl_ghs);
2082 gfs2_rlist_free(&rlist);
2083 gfs2_quota_unhold(dip);
2090 * gfs2_dir_exhash_dealloc - free all the leaf blocks in a directory
2091 * @dip: the directory
2093 * Dealloc all on-disk directory leaves to FREEMETA state
2094 * Change on-disk inode type to "regular file"
2099 int gfs2_dir_exhash_dealloc(struct gfs2_inode *dip)
2101 struct buffer_head *bh;
2102 struct gfs2_leaf *leaf;
2104 u32 index = 0, next_index;
2107 int error = 0, last;
2109 hsize = BIT(dip->i_depth);
2111 lp = gfs2_dir_get_hash_table(dip);
2115 while (index < hsize) {
2116 leaf_no = be64_to_cpu(lp[index]);
2118 error = get_leaf(dip, leaf_no, &bh);
2121 leaf = (struct gfs2_leaf *)bh->b_data;
2122 len = BIT(dip->i_depth - be16_to_cpu(leaf->lf_depth));
2124 next_index = (index & ~(len - 1)) + len;
2125 last = ((next_index >= hsize) ? 1 : 0);
2126 error = leaf_dealloc(dip, index, len, leaf_no, bh,
2136 if (index != hsize) {
2137 gfs2_consist_inode(dip);
2147 * gfs2_diradd_alloc_required - find if adding entry will require an allocation
2148 * @ip: the file being written to
2149 * @filname: the filename that's going to be added
2150 * @da: The structure to return dir alloc info
2152 * Returns: 0 if ok, -ve on error
2155 int gfs2_diradd_alloc_required(struct inode *inode, const struct qstr *name,
2156 struct gfs2_diradd *da)
2158 struct gfs2_inode *ip = GFS2_I(inode);
2159 struct gfs2_sbd *sdp = GFS2_SB(inode);
2160 const unsigned int extra = sizeof(struct gfs2_dinode) - sizeof(struct gfs2_leaf);
2161 struct gfs2_dirent *dent;
2162 struct buffer_head *bh;
2168 dent = gfs2_dirent_search(inode, name, gfs2_dirent_find_space, &bh);
2170 da->nr_blocks = sdp->sd_max_dirres;
2171 if (!(ip->i_diskflags & GFS2_DIF_EXHASH) &&
2172 (GFS2_DIRENT_SIZE(name->len) < extra))
2177 return PTR_ERR(dent);