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 v.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_di.di_flags & 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 #include <linux/sched.h>
57 #include <linux/slab.h>
58 #include <linux/spinlock.h>
59 #include <linux/buffer_head.h>
60 #include <linux/sort.h>
61 #include <linux/gfs2_ondisk.h>
62 #include <linux/crc32.h>
63 #include <linux/vmalloc.h>
66 #include "lm_interface.h"
78 #define IS_LEAF 1 /* Hashed (leaf) directory */
79 #define IS_DINODE 2 /* Linear (stuffed dinode block) directory */
81 #define gfs2_disk_hash2offset(h) (((uint64_t)(h)) >> 1)
82 #define gfs2_dir_offset2hash(p) ((uint32_t)(((uint64_t)(p)) << 1))
84 typedef int (*leaf_call_t) (struct gfs2_inode *dip,
85 uint32_t index, uint32_t len, uint64_t leaf_no,
89 int gfs2_dir_get_new_buffer(struct gfs2_inode *ip, uint64_t block,
90 struct buffer_head **bhp)
92 struct buffer_head *bh;
94 bh = gfs2_meta_new(ip->i_gl, block);
95 gfs2_trans_add_bh(ip->i_gl, bh, 1);
96 gfs2_metatype_set(bh, GFS2_METATYPE_JD, GFS2_FORMAT_JD);
97 gfs2_buffer_clear_tail(bh, sizeof(struct gfs2_meta_header));
102 static int gfs2_dir_get_existing_buffer(struct gfs2_inode *ip, uint64_t block,
103 struct buffer_head **bhp)
105 struct buffer_head *bh;
108 error = gfs2_meta_read(ip->i_gl, block, DIO_START | DIO_WAIT, &bh);
111 if (gfs2_metatype_check(GFS2_SB(&ip->i_inode), bh, GFS2_METATYPE_JD)) {
119 static int gfs2_dir_write_stuffed(struct gfs2_inode *ip, const char *buf,
120 unsigned int offset, unsigned int size)
123 struct buffer_head *dibh;
126 error = gfs2_meta_inode_buffer(ip, &dibh);
130 gfs2_trans_add_bh(ip->i_gl, dibh, 1);
131 memcpy(dibh->b_data + offset + sizeof(struct gfs2_dinode), buf, size);
132 if (ip->i_di.di_size < offset + size)
133 ip->i_di.di_size = offset + size;
134 ip->i_di.di_mtime = ip->i_di.di_ctime = get_seconds();
135 gfs2_dinode_out(&ip->i_di, dibh->b_data);
145 * gfs2_dir_write_data - Write directory information to the inode
146 * @ip: The GFS2 inode
147 * @buf: The buffer containing information to be written
148 * @offset: The file offset to start writing at
149 * @size: The amount of data to write
151 * Returns: The number of bytes correctly written or error code
153 static int gfs2_dir_write_data(struct gfs2_inode *ip, const char *buf,
154 uint64_t offset, unsigned int size)
156 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
157 struct buffer_head *dibh;
158 uint64_t lblock, dblock;
167 if (gfs2_is_stuffed(ip) &&
168 offset + size <= sdp->sd_sb.sb_bsize - sizeof(struct gfs2_dinode))
169 return gfs2_dir_write_stuffed(ip, buf, (unsigned int)offset,
172 if (gfs2_assert_warn(sdp, gfs2_is_jdata(ip)))
175 if (gfs2_is_stuffed(ip)) {
176 error = gfs2_unstuff_dinode(ip, NULL, NULL);
182 o = do_div(lblock, sdp->sd_jbsize) + sizeof(struct gfs2_meta_header);
184 while (copied < size) {
186 struct buffer_head *bh;
189 amount = size - copied;
190 if (amount > sdp->sd_sb.sb_bsize - o)
191 amount = sdp->sd_sb.sb_bsize - o;
195 error = gfs2_extent_map(&ip->i_inode, lblock, &new,
200 if (gfs2_assert_withdraw(sdp, dblock))
204 if (amount == sdp->sd_jbsize || new)
205 error = gfs2_dir_get_new_buffer(ip, dblock, &bh);
207 error = gfs2_dir_get_existing_buffer(ip, dblock, &bh);
212 gfs2_trans_add_bh(ip->i_gl, bh, 1);
213 memcpy(bh->b_data + o, buf, amount);
223 o = sizeof(struct gfs2_meta_header);
227 error = gfs2_meta_inode_buffer(ip, &dibh);
231 if (ip->i_di.di_size < offset + copied)
232 ip->i_di.di_size = offset + copied;
233 ip->i_di.di_mtime = ip->i_di.di_ctime = get_seconds();
235 gfs2_trans_add_bh(ip->i_gl, dibh, 1);
236 gfs2_dinode_out(&ip->i_di, dibh->b_data);
246 static int gfs2_dir_read_stuffed(struct gfs2_inode *ip, char *buf,
247 unsigned int offset, unsigned int size)
249 struct buffer_head *dibh;
252 error = gfs2_meta_inode_buffer(ip, &dibh);
254 offset += sizeof(struct gfs2_dinode);
255 memcpy(buf, dibh->b_data + offset, size);
259 return (error) ? error : size;
264 * gfs2_dir_read_data - Read a data from a directory inode
265 * @ip: The GFS2 Inode
266 * @buf: The buffer to place result into
267 * @offset: File offset to begin jdata_readng from
268 * @size: Amount of data to transfer
270 * Returns: The amount of data actually copied or the error
272 static int gfs2_dir_read_data(struct gfs2_inode *ip, char *buf,
273 uint64_t offset, unsigned int size)
275 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
276 uint64_t lblock, dblock;
282 if (offset >= ip->i_di.di_size)
285 if ((offset + size) > ip->i_di.di_size)
286 size = ip->i_di.di_size - offset;
291 if (gfs2_is_stuffed(ip))
292 return gfs2_dir_read_stuffed(ip, buf, (unsigned int)offset,
295 if (gfs2_assert_warn(sdp, gfs2_is_jdata(ip)))
299 o = do_div(lblock, sdp->sd_jbsize) + sizeof(struct gfs2_meta_header);
301 while (copied < size) {
303 struct buffer_head *bh;
306 amount = size - copied;
307 if (amount > sdp->sd_sb.sb_bsize - o)
308 amount = sdp->sd_sb.sb_bsize - o;
312 error = gfs2_extent_map(&ip->i_inode, lblock, &new,
319 gfs2_meta_ra(ip->i_gl, dblock, extlen);
323 error = gfs2_dir_get_new_buffer(ip, dblock, &bh);
325 error = gfs2_dir_get_existing_buffer(ip, dblock, &bh);
333 memcpy(buf, bh->b_data + o, amount);
341 o = sizeof(struct gfs2_meta_header);
346 return (copied) ? copied : error;
349 typedef int (*gfs2_dscan_t)(const struct gfs2_dirent *dent,
350 const struct qstr *name,
353 static inline int __gfs2_dirent_find(const struct gfs2_dirent *dent,
354 const struct qstr *name, int ret)
356 if (dent->de_inum.no_addr != 0 &&
357 be32_to_cpu(dent->de_hash) == name->hash &&
358 be16_to_cpu(dent->de_name_len) == name->len &&
359 memcmp((char *)(dent+1), name->name, name->len) == 0)
364 static int gfs2_dirent_find(const struct gfs2_dirent *dent,
365 const struct qstr *name,
368 return __gfs2_dirent_find(dent, name, 1);
371 static int gfs2_dirent_prev(const struct gfs2_dirent *dent,
372 const struct qstr *name,
375 return __gfs2_dirent_find(dent, name, 2);
379 * name->name holds ptr to start of block.
380 * name->len holds size of block.
382 static int gfs2_dirent_last(const struct gfs2_dirent *dent,
383 const struct qstr *name,
386 const char *start = name->name;
387 const char *end = (const char *)dent + be16_to_cpu(dent->de_rec_len);
388 if (name->len == (end - start))
393 static int gfs2_dirent_find_space(const struct gfs2_dirent *dent,
394 const struct qstr *name,
397 unsigned required = GFS2_DIRENT_SIZE(name->len);
398 unsigned actual = GFS2_DIRENT_SIZE(be16_to_cpu(dent->de_name_len));
399 unsigned totlen = be16_to_cpu(dent->de_rec_len);
401 if (!dent->de_inum.no_addr)
402 actual = GFS2_DIRENT_SIZE(0);
403 if ((totlen - actual) >= required)
408 struct dirent_gather {
409 const struct gfs2_dirent **pdent;
413 static int gfs2_dirent_gather(const struct gfs2_dirent *dent,
414 const struct qstr *name,
417 struct dirent_gather *g = opaque;
418 if (dent->de_inum.no_addr) {
419 g->pdent[g->offset++] = dent;
425 * Other possible things to check:
426 * - Inode located within filesystem size (and on valid block)
427 * - Valid directory entry type
428 * Not sure how heavy-weight we want to make this... could also check
429 * hash is correct for example, but that would take a lot of extra time.
430 * For now the most important thing is to check that the various sizes
433 static int gfs2_check_dirent(struct gfs2_dirent *dent, unsigned int offset,
434 unsigned int size, unsigned int len, int first)
436 const char *msg = "gfs2_dirent too small";
437 if (unlikely(size < sizeof(struct gfs2_dirent)))
439 msg = "gfs2_dirent misaligned";
440 if (unlikely(offset & 0x7))
442 msg = "gfs2_dirent points beyond end of block";
443 if (unlikely(offset + size > len))
445 msg = "zero inode number";
446 if (unlikely(!first && !dent->de_inum.no_addr))
448 msg = "name length is greater than space in dirent";
449 if (dent->de_inum.no_addr &&
450 unlikely(sizeof(struct gfs2_dirent)+be16_to_cpu(dent->de_name_len) >
455 printk(KERN_WARNING "gfs2_check_dirent: %s (%s)\n", msg,
456 first ? "first in block" : "not first in block");
460 static int gfs2_dirent_offset(const void *buf)
462 const struct gfs2_meta_header *h = buf;
467 switch(be32_to_cpu(h->mh_type)) {
468 case GFS2_METATYPE_LF:
469 offset = sizeof(struct gfs2_leaf);
471 case GFS2_METATYPE_DI:
472 offset = sizeof(struct gfs2_dinode);
479 printk(KERN_WARNING "gfs2_scan_dirent: wrong block type %u\n",
480 be32_to_cpu(h->mh_type));
484 static struct gfs2_dirent *gfs2_dirent_scan(struct inode *inode,
486 unsigned int len, gfs2_dscan_t scan,
487 const struct qstr *name,
490 struct gfs2_dirent *dent, *prev;
495 ret = gfs2_dirent_offset(buf);
501 dent = (struct gfs2_dirent *)(buf + offset);
502 size = be16_to_cpu(dent->de_rec_len);
503 if (gfs2_check_dirent(dent, offset, size, len, 1))
506 ret = scan(dent, name, opaque);
513 dent = (struct gfs2_dirent *)(buf + offset);
514 size = be16_to_cpu(dent->de_rec_len);
515 if (gfs2_check_dirent(dent, offset, size, len, 0))
525 return prev ? prev : dent;
532 gfs2_consist_inode(GFS2_I(inode));
533 return ERR_PTR(-EIO);
538 * dirent_first - Return the first dirent
539 * @dip: the directory
541 * @dent: Pointer to list of dirents
543 * return first dirent whether bh points to leaf or stuffed dinode
545 * Returns: IS_LEAF, IS_DINODE, or -errno
548 static int dirent_first(struct gfs2_inode *dip, struct buffer_head *bh,
549 struct gfs2_dirent **dent)
551 struct gfs2_meta_header *h = (struct gfs2_meta_header *)bh->b_data;
553 if (be32_to_cpu(h->mh_type) == GFS2_METATYPE_LF) {
554 if (gfs2_meta_check(GFS2_SB(&dip->i_inode), bh))
556 *dent = (struct gfs2_dirent *)(bh->b_data +
557 sizeof(struct gfs2_leaf));
560 if (gfs2_metatype_check(GFS2_SB(&dip->i_inode), bh, GFS2_METATYPE_DI))
562 *dent = (struct gfs2_dirent *)(bh->b_data +
563 sizeof(struct gfs2_dinode));
569 * dirent_next - Next dirent
570 * @dip: the directory
572 * @dent: Pointer to list of dirents
574 * Returns: 0 on success, error code otherwise
577 static int dirent_next(struct gfs2_inode *dip, struct buffer_head *bh,
578 struct gfs2_dirent **dent)
580 struct gfs2_dirent *tmp, *cur;
582 uint16_t cur_rec_len;
585 bh_end = bh->b_data + bh->b_size;
586 cur_rec_len = be16_to_cpu(cur->de_rec_len);
588 if ((char *)cur + cur_rec_len >= bh_end) {
589 if ((char *)cur + cur_rec_len > bh_end) {
590 gfs2_consist_inode(dip);
596 tmp = (struct gfs2_dirent *)((char *)cur + cur_rec_len);
598 if ((char *)tmp + be16_to_cpu(tmp->de_rec_len) > bh_end) {
599 gfs2_consist_inode(dip);
603 if (cur_rec_len == 0) {
604 gfs2_consist_inode(dip);
608 /* Only the first dent could ever have de_inum.no_addr == 0 */
609 if (!tmp->de_inum.no_addr) {
610 gfs2_consist_inode(dip);
620 * dirent_del - Delete a dirent
621 * @dip: The GFS2 inode
623 * @prev: The previous dirent
624 * @cur: The current dirent
628 static void dirent_del(struct gfs2_inode *dip, struct buffer_head *bh,
629 struct gfs2_dirent *prev, struct gfs2_dirent *cur)
631 uint16_t cur_rec_len, prev_rec_len;
633 if (!cur->de_inum.no_addr) {
634 gfs2_consist_inode(dip);
638 gfs2_trans_add_bh(dip->i_gl, bh, 1);
640 /* If there is no prev entry, this is the first entry in the block.
641 The de_rec_len is already as big as it needs to be. Just zero
642 out the inode number and return. */
645 cur->de_inum.no_addr = 0; /* No endianess worries */
649 /* Combine this dentry with the previous one. */
651 prev_rec_len = be16_to_cpu(prev->de_rec_len);
652 cur_rec_len = be16_to_cpu(cur->de_rec_len);
654 if ((char *)prev + prev_rec_len != (char *)cur)
655 gfs2_consist_inode(dip);
656 if ((char *)cur + cur_rec_len > bh->b_data + bh->b_size)
657 gfs2_consist_inode(dip);
659 prev_rec_len += cur_rec_len;
660 prev->de_rec_len = cpu_to_be16(prev_rec_len);
664 * Takes a dent from which to grab space as an argument. Returns the
665 * newly created dent.
667 static struct gfs2_dirent *gfs2_init_dirent(struct inode *inode,
668 struct gfs2_dirent *dent,
669 const struct qstr *name,
670 struct buffer_head *bh)
672 struct gfs2_inode *ip = GFS2_I(inode);
673 struct gfs2_dirent *ndent;
674 unsigned offset = 0, totlen;
676 if (dent->de_inum.no_addr)
677 offset = GFS2_DIRENT_SIZE(be16_to_cpu(dent->de_name_len));
678 totlen = be16_to_cpu(dent->de_rec_len);
679 BUG_ON(offset + name->len > totlen);
680 gfs2_trans_add_bh(ip->i_gl, bh, 1);
681 ndent = (struct gfs2_dirent *)((char *)dent + offset);
682 dent->de_rec_len = cpu_to_be16(offset);
683 gfs2_qstr2dirent(name, totlen - offset, ndent);
687 static struct gfs2_dirent *gfs2_dirent_alloc(struct inode *inode,
688 struct buffer_head *bh,
689 const struct qstr *name)
691 struct gfs2_dirent *dent;
692 dent = gfs2_dirent_scan(inode, bh->b_data, bh->b_size,
693 gfs2_dirent_find_space, name, NULL);
694 if (!dent || IS_ERR(dent))
696 return gfs2_init_dirent(inode, dent, name, bh);
699 static int get_leaf(struct gfs2_inode *dip, uint64_t leaf_no,
700 struct buffer_head **bhp)
704 error = gfs2_meta_read(dip->i_gl, leaf_no, DIO_START | DIO_WAIT, bhp);
705 if (!error && gfs2_metatype_check(GFS2_SB(&dip->i_inode), *bhp, GFS2_METATYPE_LF)) {
706 /* printk(KERN_INFO "block num=%llu\n", leaf_no); */
714 * get_leaf_nr - Get a leaf number associated with the index
715 * @dip: The GFS2 inode
719 * Returns: 0 on success, error code otherwise
722 static int get_leaf_nr(struct gfs2_inode *dip, uint32_t index,
728 error = gfs2_dir_read_data(dip, (char *)&leaf_no,
729 index * sizeof(uint64_t),
731 if (error != sizeof(uint64_t))
732 return (error < 0) ? error : -EIO;
734 *leaf_out = be64_to_cpu(leaf_no);
739 static int get_first_leaf(struct gfs2_inode *dip, uint32_t index,
740 struct buffer_head **bh_out)
745 error = get_leaf_nr(dip, index, &leaf_no);
747 error = get_leaf(dip, leaf_no, bh_out);
752 static struct gfs2_dirent *gfs2_dirent_search(struct inode *inode,
753 const struct qstr *name,
755 struct buffer_head **pbh)
757 struct buffer_head *bh;
758 struct gfs2_dirent *dent;
759 struct gfs2_inode *ip = GFS2_I(inode);
762 if (ip->i_di.di_flags & GFS2_DIF_EXHASH) {
763 struct gfs2_leaf *leaf;
764 unsigned hsize = 1 << ip->i_di.di_depth;
767 if (hsize * sizeof(u64) != ip->i_di.di_size) {
768 gfs2_consist_inode(ip);
769 return ERR_PTR(-EIO);
772 index = name->hash >> (32 - ip->i_di.di_depth);
773 error = get_first_leaf(ip, index, &bh);
775 return ERR_PTR(error);
777 dent = gfs2_dirent_scan(inode, bh->b_data, bh->b_size,
781 leaf = (struct gfs2_leaf *)bh->b_data;
782 ln = be64_to_cpu(leaf->lf_next);
787 error = get_leaf(ip, ln, &bh);
790 return error ? ERR_PTR(error) : NULL;
794 error = gfs2_meta_inode_buffer(ip, &bh);
796 return ERR_PTR(error);
797 dent = gfs2_dirent_scan(inode, bh->b_data, bh->b_size, scan, name, NULL);
799 if (unlikely(dent == NULL || IS_ERR(dent))) {
807 static struct gfs2_leaf *new_leaf(struct inode *inode, struct buffer_head **pbh, u16 depth)
809 struct gfs2_inode *ip = GFS2_I(inode);
810 u64 bn = gfs2_alloc_meta(ip);
811 struct buffer_head *bh = gfs2_meta_new(ip->i_gl, bn);
812 struct gfs2_leaf *leaf;
813 struct gfs2_dirent *dent;
814 struct qstr name = { .name = "", .len = 0, .hash = 0 };
818 gfs2_trans_add_bh(ip->i_gl, bh, 1);
819 gfs2_metatype_set(bh, GFS2_METATYPE_LF, GFS2_FORMAT_LF);
820 leaf = (struct gfs2_leaf *)bh->b_data;
821 leaf->lf_depth = cpu_to_be16(depth);
822 leaf->lf_entries = cpu_to_be16(0);
823 leaf->lf_dirent_format = cpu_to_be16(GFS2_FORMAT_DE);
824 leaf->lf_next = cpu_to_be64(0);
825 memset(leaf->lf_reserved, 0, sizeof(leaf->lf_reserved));
826 dent = (struct gfs2_dirent *)(leaf+1);
827 gfs2_qstr2dirent(&name, bh->b_size - sizeof(struct gfs2_leaf), dent);
833 * dir_make_exhash - Convert a stuffed directory into an ExHash directory
834 * @dip: The GFS2 inode
836 * Returns: 0 on success, error code otherwise
839 static int dir_make_exhash(struct inode *inode)
841 struct gfs2_inode *dip = GFS2_I(inode);
842 struct gfs2_sbd *sdp = GFS2_SB(inode);
843 struct gfs2_dirent *dent;
845 struct buffer_head *bh, *dibh;
846 struct gfs2_leaf *leaf;
852 error = gfs2_meta_inode_buffer(dip, &dibh);
856 /* Turn over a new leaf */
858 leaf = new_leaf(inode, &bh, 0);
863 gfs2_assert(sdp, dip->i_di.di_entries < (1 << 16));
864 leaf->lf_entries = cpu_to_be16(dip->i_di.di_entries);
868 gfs2_buffer_copy_tail(bh, sizeof(struct gfs2_leaf), dibh,
869 sizeof(struct gfs2_dinode));
871 /* Find last entry */
874 args.len = bh->b_size - sizeof(struct gfs2_dinode) +
875 sizeof(struct gfs2_leaf);
876 args.name = bh->b_data;
877 dent = gfs2_dirent_scan(&dip->i_inode, bh->b_data, bh->b_size,
878 gfs2_dirent_last, &args, NULL);
887 return PTR_ERR(dent);
890 /* Adjust the last dirent's record length
891 (Remember that dent still points to the last entry.) */
893 dent->de_rec_len = cpu_to_be16(be16_to_cpu(dent->de_rec_len) +
894 sizeof(struct gfs2_dinode) -
895 sizeof(struct gfs2_leaf));
899 /* We're done with the new leaf block, now setup the new
902 gfs2_trans_add_bh(dip->i_gl, dibh, 1);
903 gfs2_buffer_clear_tail(dibh, sizeof(struct gfs2_dinode));
905 lp = (uint64_t *)(dibh->b_data + sizeof(struct gfs2_dinode));
907 for (x = sdp->sd_hash_ptrs; x--; lp++)
908 *lp = cpu_to_be64(bn);
910 dip->i_di.di_size = sdp->sd_sb.sb_bsize / 2;
911 dip->i_di.di_blocks++;
912 dip->i_di.di_flags |= GFS2_DIF_EXHASH;
913 dip->i_di.di_payload_format = 0;
915 for (x = sdp->sd_hash_ptrs, y = -1; x; x >>= 1, y++) ;
916 dip->i_di.di_depth = y;
918 gfs2_dinode_out(&dip->i_di, dibh->b_data);
926 * dir_split_leaf - Split a leaf block into two
927 * @dip: The GFS2 inode
931 * Returns: 0 on success, error code on failure
934 static int dir_split_leaf(struct inode *inode, const struct qstr *name)
936 struct gfs2_inode *dip = GFS2_I(inode);
937 struct buffer_head *nbh, *obh, *dibh;
938 struct gfs2_leaf *nleaf, *oleaf;
939 struct gfs2_dirent *dent = NULL, *prev = NULL, *next = NULL, *new;
940 uint32_t start, len, half_len, divider;
941 uint64_t bn, *lp, leaf_no;
946 index = name->hash >> (32 - dip->i_di.di_depth);
947 error = get_leaf_nr(dip, index, &leaf_no);
951 /* Get the old leaf block */
952 error = get_leaf(dip, leaf_no, &obh);
956 oleaf = (struct gfs2_leaf *)obh->b_data;
957 if (dip->i_di.di_depth == be16_to_cpu(oleaf->lf_depth)) {
959 return 1; /* can't split */
962 gfs2_trans_add_bh(dip->i_gl, obh, 1);
964 nleaf = new_leaf(inode, &nbh, be16_to_cpu(oleaf->lf_depth) + 1);
971 /* Compute the start and len of leaf pointers in the hash table. */
972 len = 1 << (dip->i_di.di_depth - be16_to_cpu(oleaf->lf_depth));
975 printk(KERN_WARNING "di_depth %u lf_depth %u index %u\n", dip->i_di.di_depth, be16_to_cpu(oleaf->lf_depth), index);
976 gfs2_consist_inode(dip);
981 start = (index & ~(len - 1));
983 /* Change the pointers.
984 Don't bother distinguishing stuffed from non-stuffed.
985 This code is complicated enough already. */
986 lp = kmalloc(half_len * sizeof(uint64_t), GFP_NOFS | __GFP_NOFAIL);
987 /* Change the pointers */
988 for (x = 0; x < half_len; x++)
989 lp[x] = cpu_to_be64(bn);
991 error = gfs2_dir_write_data(dip, (char *)lp, start * sizeof(uint64_t),
992 half_len * sizeof(uint64_t));
993 if (error != half_len * sizeof(uint64_t)) {
1001 /* Compute the divider */
1002 divider = (start + half_len) << (32 - dip->i_di.di_depth);
1004 /* Copy the entries */
1005 dirent_first(dip, obh, &dent);
1009 if (dirent_next(dip, obh, &next))
1012 if (dent->de_inum.no_addr &&
1013 be32_to_cpu(dent->de_hash) < divider) {
1015 str.name = (char*)(dent+1);
1016 str.len = be16_to_cpu(dent->de_name_len);
1017 str.hash = be32_to_cpu(dent->de_hash);
1018 new = gfs2_dirent_alloc(inode, nbh, &str);
1020 error = PTR_ERR(new);
1024 new->de_inum = dent->de_inum; /* No endian worries */
1025 new->de_type = dent->de_type; /* No endian worries */
1026 nleaf->lf_entries = cpu_to_be16(be16_to_cpu(nleaf->lf_entries)+1);
1028 dirent_del(dip, obh, prev, dent);
1030 if (!oleaf->lf_entries)
1031 gfs2_consist_inode(dip);
1032 oleaf->lf_entries = cpu_to_be16(be16_to_cpu(oleaf->lf_entries)-1);
1044 oleaf->lf_depth = nleaf->lf_depth;
1046 error = gfs2_meta_inode_buffer(dip, &dibh);
1047 if (!gfs2_assert_withdraw(GFS2_SB(&dip->i_inode), !error)) {
1048 dip->i_di.di_blocks++;
1049 gfs2_dinode_out(&dip->i_di, dibh->b_data);
1068 * dir_double_exhash - Double size of ExHash table
1069 * @dip: The GFS2 dinode
1071 * Returns: 0 on success, error code on failure
1074 static int dir_double_exhash(struct gfs2_inode *dip)
1076 struct gfs2_sbd *sdp = GFS2_SB(&dip->i_inode);
1077 struct buffer_head *dibh;
1080 uint64_t *from, *to;
1085 hsize = 1 << dip->i_di.di_depth;
1086 if (hsize * sizeof(uint64_t) != dip->i_di.di_size) {
1087 gfs2_consist_inode(dip);
1091 /* Allocate both the "from" and "to" buffers in one big chunk */
1093 buf = kcalloc(3, sdp->sd_hash_bsize, GFP_KERNEL | __GFP_NOFAIL);
1095 for (block = dip->i_di.di_size >> sdp->sd_hash_bsize_shift; block--;) {
1096 error = gfs2_dir_read_data(dip, (char *)buf,
1097 block * sdp->sd_hash_bsize,
1098 sdp->sd_hash_bsize);
1099 if (error != sdp->sd_hash_bsize) {
1106 to = (uint64_t *)((char *)buf + sdp->sd_hash_bsize);
1108 for (x = sdp->sd_hash_ptrs; x--; from++) {
1109 *to++ = *from; /* No endianess worries */
1113 error = gfs2_dir_write_data(dip,
1114 (char *)buf + sdp->sd_hash_bsize,
1115 block * sdp->sd_sb.sb_bsize,
1116 sdp->sd_sb.sb_bsize);
1117 if (error != sdp->sd_sb.sb_bsize) {
1126 error = gfs2_meta_inode_buffer(dip, &dibh);
1127 if (!gfs2_assert_withdraw(sdp, !error)) {
1128 dip->i_di.di_depth++;
1129 gfs2_dinode_out(&dip->i_di, dibh->b_data);
1142 * compare_dents - compare directory entries by hash value
1146 * When comparing the hash entries of @a to @b:
1152 static int compare_dents(const void *a, const void *b)
1154 struct gfs2_dirent *dent_a, *dent_b;
1155 uint32_t hash_a, hash_b;
1158 dent_a = *(struct gfs2_dirent **)a;
1159 hash_a = be32_to_cpu(dent_a->de_hash);
1161 dent_b = *(struct gfs2_dirent **)b;
1162 hash_b = be32_to_cpu(dent_b->de_hash);
1164 if (hash_a > hash_b)
1166 else if (hash_a < hash_b)
1169 unsigned int len_a = be16_to_cpu(dent_a->de_name_len);
1170 unsigned int len_b = be16_to_cpu(dent_b->de_name_len);
1174 else if (len_a < len_b)
1177 ret = memcmp((char *)(dent_a + 1),
1178 (char *)(dent_b + 1),
1186 * do_filldir_main - read out directory entries
1187 * @dip: The GFS2 inode
1188 * @offset: The offset in the file to read from
1189 * @opaque: opaque data to pass to filldir
1190 * @filldir: The function to pass entries to
1191 * @darr: an array of struct gfs2_dirent pointers to read
1192 * @entries: the number of entries in darr
1193 * @copied: pointer to int that's non-zero if a entry has been copied out
1195 * Jump through some hoops to make sure that if there are hash collsions,
1196 * they are read out at the beginning of a buffer. We want to minimize
1197 * the possibility that they will fall into different readdir buffers or
1198 * that someone will want to seek to that location.
1200 * Returns: errno, >0 on exception from filldir
1203 static int do_filldir_main(struct gfs2_inode *dip, uint64_t *offset,
1204 void *opaque, gfs2_filldir_t filldir,
1205 const struct gfs2_dirent **darr, uint32_t entries,
1208 const struct gfs2_dirent *dent, *dent_next;
1209 struct gfs2_inum inum;
1210 uint64_t off, off_next;
1215 sort(darr, entries, sizeof(struct gfs2_dirent *), compare_dents, NULL);
1217 dent_next = darr[0];
1218 off_next = be32_to_cpu(dent_next->de_hash);
1219 off_next = gfs2_disk_hash2offset(off_next);
1221 for (x = 0, y = 1; x < entries; x++, y++) {
1226 dent_next = darr[y];
1227 off_next = be32_to_cpu(dent_next->de_hash);
1228 off_next = gfs2_disk_hash2offset(off_next);
1234 if (off_next == off) {
1235 if (*copied && !run)
1246 gfs2_inum_in(&inum, (char *)&dent->de_inum);
1248 error = filldir(opaque, (char *)(dent + 1),
1249 be16_to_cpu(dent->de_name_len),
1251 be16_to_cpu(dent->de_type));
1258 /* Increment the *offset by one, so the next time we come into the
1259 do_filldir fxn, we get the next entry instead of the last one in the
1267 static int gfs2_dir_read_leaf(struct inode *inode, u64 *offset, void *opaque,
1268 gfs2_filldir_t filldir, int *copied,
1269 unsigned *depth, u64 leaf_no)
1271 struct gfs2_inode *ip = GFS2_I(inode);
1272 struct buffer_head *bh;
1273 struct gfs2_leaf *lf;
1274 unsigned entries = 0;
1275 unsigned leaves = 0;
1276 const struct gfs2_dirent **darr, *dent;
1277 struct dirent_gather g;
1278 struct buffer_head **larr;
1284 error = get_leaf(ip, lfn, &bh);
1287 lf = (struct gfs2_leaf *)bh->b_data;
1289 *depth = be16_to_cpu(lf->lf_depth);
1290 entries += be16_to_cpu(lf->lf_entries);
1292 lfn = be64_to_cpu(lf->lf_next);
1300 larr = vmalloc((leaves + entries) * sizeof(void*));
1303 darr = (const struct gfs2_dirent **)(larr + leaves);
1309 error = get_leaf(ip, lfn, &bh);
1312 lf = (struct gfs2_leaf *)bh->b_data;
1313 lfn = be64_to_cpu(lf->lf_next);
1314 if (lf->lf_entries) {
1315 dent = gfs2_dirent_scan(inode, bh->b_data, bh->b_size,
1316 gfs2_dirent_gather, NULL, &g);
1317 error = PTR_ERR(dent);
1328 error = do_filldir_main(ip, offset, opaque, filldir, darr,
1331 for(i = 0; i < leaf; i++)
1339 * dir_e_read - Reads the entries from a directory into a filldir buffer
1340 * @dip: dinode pointer
1341 * @offset: the hash of the last entry read shifted to the right once
1342 * @opaque: buffer for the filldir function to fill
1343 * @filldir: points to the filldir function to use
1348 static int dir_e_read(struct inode *inode, uint64_t *offset, void *opaque,
1349 gfs2_filldir_t filldir)
1351 struct gfs2_inode *dip = GFS2_I(inode);
1352 struct gfs2_sbd *sdp = GFS2_SB(inode);
1353 uint32_t hsize, len = 0;
1354 uint32_t ht_offset, lp_offset, ht_offset_cur = -1;
1355 uint32_t hash, index;
1361 hsize = 1 << dip->i_di.di_depth;
1362 if (hsize * sizeof(uint64_t) != dip->i_di.di_size) {
1363 gfs2_consist_inode(dip);
1367 hash = gfs2_dir_offset2hash(*offset);
1368 index = hash >> (32 - dip->i_di.di_depth);
1370 lp = kmalloc(sdp->sd_hash_bsize, GFP_KERNEL);
1374 while (index < hsize) {
1375 lp_offset = index & (sdp->sd_hash_ptrs - 1);
1376 ht_offset = index - lp_offset;
1378 if (ht_offset_cur != ht_offset) {
1379 error = gfs2_dir_read_data(dip, (char *)lp,
1380 ht_offset * sizeof(uint64_t),
1381 sdp->sd_hash_bsize);
1382 if (error != sdp->sd_hash_bsize) {
1387 ht_offset_cur = ht_offset;
1390 error = gfs2_dir_read_leaf(inode, offset, opaque, filldir,
1392 be64_to_cpu(lp[lp_offset]));
1396 len = 1 << (dip->i_di.di_depth - depth);
1397 index = (index & ~(len - 1)) + len;
1407 int gfs2_dir_read(struct inode *inode, uint64_t *offset, void *opaque,
1408 gfs2_filldir_t filldir)
1410 struct gfs2_inode *dip = GFS2_I(inode);
1411 struct dirent_gather g;
1412 const struct gfs2_dirent **darr, *dent;
1413 struct buffer_head *dibh;
1417 if (!dip->i_di.di_entries)
1420 if (dip->i_di.di_flags & GFS2_DIF_EXHASH)
1421 return dir_e_read(inode, offset, opaque, filldir);
1423 if (!gfs2_is_stuffed(dip)) {
1424 gfs2_consist_inode(dip);
1428 error = gfs2_meta_inode_buffer(dip, &dibh);
1433 darr = kmalloc(dip->i_di.di_entries * sizeof(struct gfs2_dirent *),
1438 dent = gfs2_dirent_scan(inode, dibh->b_data, dibh->b_size,
1439 gfs2_dirent_gather, NULL, &g);
1441 error = PTR_ERR(dent);
1444 error = do_filldir_main(dip, offset, opaque, filldir, darr,
1445 dip->i_di.di_entries, &copied);
1459 * gfs2_dir_search - Search a directory
1460 * @dip: The GFS2 inode
1464 * This routine searches a directory for a file or another directory.
1465 * Assumes a glock is held on dip.
1470 int gfs2_dir_search(struct inode *dir, const struct qstr *name,
1471 struct gfs2_inum *inum, unsigned int *type)
1473 struct buffer_head *bh;
1474 struct gfs2_dirent *dent;
1476 dent = gfs2_dirent_search(dir, name, gfs2_dirent_find, &bh);
1479 return PTR_ERR(dent);
1481 gfs2_inum_in(inum, (char *)&dent->de_inum);
1483 *type = be16_to_cpu(dent->de_type);
1490 static int dir_new_leaf(struct inode *inode, const struct qstr *name)
1492 struct buffer_head *bh, *obh;
1493 struct gfs2_inode *ip = GFS2_I(inode);
1494 struct gfs2_leaf *leaf, *oleaf;
1499 index = name->hash >> (32 - ip->i_di.di_depth);
1500 error = get_first_leaf(ip, index, &obh);
1504 oleaf = (struct gfs2_leaf *)obh->b_data;
1505 bn = be64_to_cpu(oleaf->lf_next);
1509 error = get_leaf(ip, bn, &obh);
1514 gfs2_trans_add_bh(ip->i_gl, obh, 1);
1516 leaf = new_leaf(inode, &bh, be16_to_cpu(oleaf->lf_depth));
1521 oleaf->lf_next = cpu_to_be64(bh->b_blocknr);
1525 error = gfs2_meta_inode_buffer(ip, &bh);
1528 gfs2_trans_add_bh(ip->i_gl, bh, 1);
1529 ip->i_di.di_blocks++;
1530 gfs2_dinode_out(&ip->i_di, bh->b_data);
1536 * gfs2_dir_add - Add new filename into directory
1537 * @dip: The GFS2 inode
1538 * @filename: The new name
1539 * @inode: The inode number of the entry
1540 * @type: The type of the entry
1542 * Returns: 0 on success, error code on failure
1545 int gfs2_dir_add(struct inode *inode, const struct qstr *name,
1546 const struct gfs2_inum *inum, unsigned type)
1548 struct gfs2_inode *ip = GFS2_I(inode);
1549 struct buffer_head *bh;
1550 struct gfs2_dirent *dent;
1551 struct gfs2_leaf *leaf;
1555 dent = gfs2_dirent_search(inode, name, gfs2_dirent_find_space,
1559 return PTR_ERR(dent);
1560 dent = gfs2_init_dirent(inode, dent, name, bh);
1561 gfs2_inum_out(inum, (char *)&dent->de_inum);
1562 dent->de_type = cpu_to_be16(type);
1563 if (ip->i_di.di_flags & GFS2_DIF_EXHASH) {
1564 leaf = (struct gfs2_leaf *)bh->b_data;
1565 leaf->lf_entries = cpu_to_be16(be16_to_cpu(leaf->lf_entries) + 1);
1568 error = gfs2_meta_inode_buffer(ip, &bh);
1571 gfs2_trans_add_bh(ip->i_gl, bh, 1);
1572 ip->i_di.di_entries++;
1573 ip->i_di.di_mtime = ip->i_di.di_ctime = get_seconds();
1574 gfs2_dinode_out(&ip->i_di, bh->b_data);
1579 if (!(ip->i_di.di_flags & GFS2_DIF_EXHASH)) {
1580 error = dir_make_exhash(inode);
1585 error = dir_split_leaf(inode, name);
1590 if (ip->i_di.di_depth < GFS2_DIR_MAX_DEPTH) {
1591 error = dir_double_exhash(ip);
1594 error = dir_split_leaf(inode, name);
1600 error = dir_new_leaf(inode, name);
1611 * gfs2_dir_del - Delete a directory entry
1612 * @dip: The GFS2 inode
1613 * @filename: The filename
1615 * Returns: 0 on success, error code on failure
1618 int gfs2_dir_del(struct gfs2_inode *dip, const struct qstr *name)
1620 struct gfs2_dirent *dent, *prev = NULL;
1621 struct buffer_head *bh;
1624 /* Returns _either_ the entry (if its first in block) or the
1625 previous entry otherwise */
1626 dent = gfs2_dirent_search(&dip->i_inode, name, gfs2_dirent_prev, &bh);
1628 gfs2_consist_inode(dip);
1632 gfs2_consist_inode(dip);
1633 return PTR_ERR(dent);
1635 /* If not first in block, adjust pointers accordingly */
1636 if (gfs2_dirent_find(dent, name, NULL) == 0) {
1638 dent = (struct gfs2_dirent *)((char *)dent + be16_to_cpu(prev->de_rec_len));
1641 dirent_del(dip, bh, prev, dent);
1642 if (dip->i_di.di_flags & GFS2_DIF_EXHASH) {
1643 struct gfs2_leaf *leaf = (struct gfs2_leaf *)bh->b_data;
1644 u16 entries = be16_to_cpu(leaf->lf_entries);
1646 gfs2_consist_inode(dip);
1647 leaf->lf_entries = cpu_to_be16(--entries);
1651 error = gfs2_meta_inode_buffer(dip, &bh);
1655 if (!dip->i_di.di_entries)
1656 gfs2_consist_inode(dip);
1657 gfs2_trans_add_bh(dip->i_gl, bh, 1);
1658 dip->i_di.di_entries--;
1659 dip->i_di.di_mtime = dip->i_di.di_ctime = get_seconds();
1660 gfs2_dinode_out(&dip->i_di, bh->b_data);
1662 mark_inode_dirty(&dip->i_inode);
1668 * gfs2_dir_mvino - Change inode number of directory entry
1669 * @dip: The GFS2 inode
1673 * This routine changes the inode number of a directory entry. It's used
1674 * by rename to change ".." when a directory is moved.
1675 * Assumes a glock is held on dvp.
1680 int gfs2_dir_mvino(struct gfs2_inode *dip, const struct qstr *filename,
1681 struct gfs2_inum *inum, unsigned int new_type)
1683 struct buffer_head *bh;
1684 struct gfs2_dirent *dent;
1687 dent = gfs2_dirent_search(&dip->i_inode, filename, gfs2_dirent_find, &bh);
1689 gfs2_consist_inode(dip);
1693 return PTR_ERR(dent);
1695 gfs2_trans_add_bh(dip->i_gl, bh, 1);
1696 gfs2_inum_out(inum, (char *)&dent->de_inum);
1697 dent->de_type = cpu_to_be16(new_type);
1699 if (dip->i_di.di_flags & GFS2_DIF_EXHASH) {
1701 error = gfs2_meta_inode_buffer(dip, &bh);
1704 gfs2_trans_add_bh(dip->i_gl, bh, 1);
1707 dip->i_di.di_mtime = dip->i_di.di_ctime = get_seconds();
1708 gfs2_dinode_out(&dip->i_di, bh->b_data);
1714 * foreach_leaf - call a function for each leaf in a directory
1715 * @dip: the directory
1716 * @lc: the function to call for each each
1717 * @data: private data to pass to it
1722 static int foreach_leaf(struct gfs2_inode *dip, leaf_call_t lc, void *data)
1724 struct gfs2_sbd *sdp = GFS2_SB(&dip->i_inode);
1725 struct buffer_head *bh;
1726 struct gfs2_leaf *leaf;
1727 uint32_t hsize, len;
1728 uint32_t ht_offset, lp_offset, ht_offset_cur = -1;
1734 hsize = 1 << dip->i_di.di_depth;
1735 if (hsize * sizeof(uint64_t) != dip->i_di.di_size) {
1736 gfs2_consist_inode(dip);
1740 lp = kmalloc(sdp->sd_hash_bsize, GFP_KERNEL);
1744 while (index < hsize) {
1745 lp_offset = index & (sdp->sd_hash_ptrs - 1);
1746 ht_offset = index - lp_offset;
1748 if (ht_offset_cur != ht_offset) {
1749 error = gfs2_dir_read_data(dip, (char *)lp,
1750 ht_offset * sizeof(uint64_t),
1751 sdp->sd_hash_bsize);
1752 if (error != sdp->sd_hash_bsize) {
1757 ht_offset_cur = ht_offset;
1760 leaf_no = be64_to_cpu(lp[lp_offset]);
1762 error = get_leaf(dip, leaf_no, &bh);
1765 leaf = (struct gfs2_leaf *)bh->b_data;
1768 len = 1 << (dip->i_di.di_depth - be16_to_cpu(leaf->lf_depth));
1770 error = lc(dip, index, len, leaf_no, data);
1774 index = (index & ~(len - 1)) + len;
1779 if (index != hsize) {
1780 gfs2_consist_inode(dip);
1791 * leaf_dealloc - Deallocate a directory leaf
1792 * @dip: the directory
1793 * @index: the hash table offset in the directory
1794 * @len: the number of pointers to this leaf
1795 * @leaf_no: the leaf number
1801 static int leaf_dealloc(struct gfs2_inode *dip, uint32_t index, uint32_t len,
1802 uint64_t leaf_no, void *data)
1804 struct gfs2_sbd *sdp = GFS2_SB(&dip->i_inode);
1805 struct gfs2_leaf *tmp_leaf;
1806 struct gfs2_rgrp_list rlist;
1807 struct buffer_head *bh, *dibh;
1809 unsigned int rg_blocks = 0, l_blocks = 0;
1811 unsigned int x, size = len * sizeof(uint64_t);
1814 memset(&rlist, 0, sizeof(struct gfs2_rgrp_list));
1816 ht = kzalloc(size, GFP_KERNEL);
1820 gfs2_alloc_get(dip);
1822 error = gfs2_quota_hold(dip, NO_QUOTA_CHANGE, NO_QUOTA_CHANGE);
1826 error = gfs2_rindex_hold(sdp, &dip->i_alloc.al_ri_gh);
1830 /* Count the number of leaves */
1832 for (blk = leaf_no; blk; blk = nblk) {
1833 error = get_leaf(dip, blk, &bh);
1836 tmp_leaf = (struct gfs2_leaf *)bh->b_data;
1837 nblk = be64_to_cpu(tmp_leaf->lf_next);
1840 gfs2_rlist_add(sdp, &rlist, blk);
1844 gfs2_rlist_alloc(&rlist, LM_ST_EXCLUSIVE, 0);
1846 for (x = 0; x < rlist.rl_rgrps; x++) {
1847 struct gfs2_rgrpd *rgd;
1848 rgd = rlist.rl_ghs[x].gh_gl->gl_object;
1849 rg_blocks += rgd->rd_ri.ri_length;
1852 error = gfs2_glock_nq_m(rlist.rl_rgrps, rlist.rl_ghs);
1856 error = gfs2_trans_begin(sdp,
1857 rg_blocks + (DIV_ROUND_UP(size, sdp->sd_jbsize) + 1) +
1858 RES_DINODE + RES_STATFS + RES_QUOTA, l_blocks);
1860 goto out_rg_gunlock;
1862 for (blk = leaf_no; blk; blk = nblk) {
1863 error = get_leaf(dip, blk, &bh);
1866 tmp_leaf = (struct gfs2_leaf *)bh->b_data;
1867 nblk = be64_to_cpu(tmp_leaf->lf_next);
1870 gfs2_free_meta(dip, blk, 1);
1872 if (!dip->i_di.di_blocks)
1873 gfs2_consist_inode(dip);
1874 dip->i_di.di_blocks--;
1877 error = gfs2_dir_write_data(dip, ht, index * sizeof(uint64_t), size);
1878 if (error != size) {
1884 error = gfs2_meta_inode_buffer(dip, &dibh);
1888 gfs2_trans_add_bh(dip->i_gl, dibh, 1);
1889 gfs2_dinode_out(&dip->i_di, dibh->b_data);
1893 gfs2_trans_end(sdp);
1896 gfs2_glock_dq_m(rlist.rl_rgrps, rlist.rl_ghs);
1899 gfs2_rlist_free(&rlist);
1900 gfs2_glock_dq_uninit(&dip->i_alloc.al_ri_gh);
1903 gfs2_quota_unhold(dip);
1906 gfs2_alloc_put(dip);
1913 * gfs2_dir_exhash_dealloc - free all the leaf blocks in a directory
1914 * @dip: the directory
1916 * Dealloc all on-disk directory leaves to FREEMETA state
1917 * Change on-disk inode type to "regular file"
1922 int gfs2_dir_exhash_dealloc(struct gfs2_inode *dip)
1924 struct gfs2_sbd *sdp = GFS2_SB(&dip->i_inode);
1925 struct buffer_head *bh;
1928 /* Dealloc on-disk leaves to FREEMETA state */
1929 error = foreach_leaf(dip, leaf_dealloc, NULL);
1933 /* Make this a regular file in case we crash.
1934 (We don't want to free these blocks a second time.) */
1936 error = gfs2_trans_begin(sdp, RES_DINODE, 0);
1940 error = gfs2_meta_inode_buffer(dip, &bh);
1942 gfs2_trans_add_bh(dip->i_gl, bh, 1);
1943 ((struct gfs2_dinode *)bh->b_data)->di_mode =
1944 cpu_to_be32(S_IFREG);
1948 gfs2_trans_end(sdp);
1954 * gfs2_diradd_alloc_required - find if adding entry will require an allocation
1955 * @ip: the file being written to
1956 * @filname: the filename that's going to be added
1958 * Returns: 1 if alloc required, 0 if not, -ve on error
1961 int gfs2_diradd_alloc_required(struct inode *inode, const struct qstr *name)
1963 struct gfs2_dirent *dent;
1964 struct buffer_head *bh;
1966 dent = gfs2_dirent_search(inode, name, gfs2_dirent_find_space, &bh);
1971 return PTR_ERR(dent);