2 * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
3 * Copyright (C) 2004-2005 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 */
82 #define gfs2_disk_hash2offset(h) (((uint64_t)(h)) >> 1)
83 #define gfs2_dir_offset2hash(p) ((uint32_t)(((uint64_t)(p)) << 1))
85 #define gfs2_disk_hash2offset(h) (((uint64_t)(h)))
86 #define gfs2_dir_offset2hash(p) ((uint32_t)(((uint64_t)(p))))
89 typedef int (*leaf_call_t) (struct gfs2_inode *dip,
90 uint32_t index, uint32_t len, uint64_t leaf_no,
94 int gfs2_dir_get_new_buffer(struct gfs2_inode *ip, uint64_t block,
95 struct buffer_head **bhp)
97 struct buffer_head *bh;
99 bh = gfs2_meta_new(ip->i_gl, block);
100 gfs2_trans_add_bh(ip->i_gl, bh, 1);
101 gfs2_metatype_set(bh, GFS2_METATYPE_JD, GFS2_FORMAT_JD);
102 gfs2_buffer_clear_tail(bh, sizeof(struct gfs2_meta_header));
107 static int gfs2_dir_get_existing_buffer(struct gfs2_inode *ip, uint64_t block,
108 struct buffer_head **bhp)
110 struct buffer_head *bh;
113 error = gfs2_meta_read(ip->i_gl, block, DIO_START | DIO_WAIT, &bh);
116 if (gfs2_metatype_check(ip->i_sbd, bh, GFS2_METATYPE_JD)) {
124 static int gfs2_dir_write_stuffed(struct gfs2_inode *ip, const char *buf,
125 unsigned int offset, unsigned int size)
128 struct buffer_head *dibh;
131 error = gfs2_meta_inode_buffer(ip, &dibh);
135 gfs2_trans_add_bh(ip->i_gl, dibh, 1);
136 memcpy(dibh->b_data + offset + sizeof(struct gfs2_dinode), buf, size);
137 if (ip->i_di.di_size < offset + size)
138 ip->i_di.di_size = offset + size;
139 ip->i_di.di_mtime = ip->i_di.di_ctime = get_seconds();
140 gfs2_dinode_out(&ip->i_di, 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 uint64_t offset, unsigned int size)
161 struct gfs2_sbd *sdp = ip->i_sbd;
162 struct buffer_head *dibh;
163 uint64_t lblock, dblock;
172 if (gfs2_is_stuffed(ip) &&
173 offset + size <= sdp->sd_sb.sb_bsize - sizeof(struct gfs2_dinode))
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, NULL);
187 o = do_div(lblock, sdp->sd_jbsize) + sizeof(struct gfs2_meta_header);
189 while (copied < size) {
191 struct buffer_head *bh;
194 amount = size - copied;
195 if (amount > sdp->sd_sb.sb_bsize - o)
196 amount = sdp->sd_sb.sb_bsize - o;
200 error = gfs2_extent_map(ip->i_vnode, lblock, &new,
205 if (gfs2_assert_withdraw(sdp, dblock))
209 if (amount == sdp->sd_jbsize || new)
210 error = gfs2_dir_get_new_buffer(ip, dblock, &bh);
212 error = gfs2_dir_get_existing_buffer(ip, dblock, &bh);
217 gfs2_trans_add_bh(ip->i_gl, bh, 1);
218 memcpy(bh->b_data + o, buf, amount);
228 o = sizeof(struct gfs2_meta_header);
232 error = gfs2_meta_inode_buffer(ip, &dibh);
236 if (ip->i_di.di_size < offset + copied)
237 ip->i_di.di_size = offset + copied;
238 ip->i_di.di_mtime = ip->i_di.di_ctime = get_seconds();
240 gfs2_trans_add_bh(ip->i_gl, dibh, 1);
241 gfs2_dinode_out(&ip->i_di, dibh->b_data);
251 static int gfs2_dir_read_stuffed(struct gfs2_inode *ip, char *buf,
252 unsigned int offset, unsigned int size)
254 struct buffer_head *dibh;
257 error = gfs2_meta_inode_buffer(ip, &dibh);
259 offset += sizeof(struct gfs2_dinode);
260 memcpy(buf, dibh->b_data + offset, size);
264 return (error) ? error : size;
269 * gfs2_dir_read_data - Read a data from a directory inode
270 * @ip: The GFS2 Inode
271 * @buf: The buffer to place result into
272 * @offset: File offset to begin jdata_readng from
273 * @size: Amount of data to transfer
275 * Returns: The amount of data actually copied or the error
277 static int gfs2_dir_read_data(struct gfs2_inode *ip, char *buf,
278 uint64_t offset, unsigned int size)
280 struct gfs2_sbd *sdp = ip->i_sbd;
281 uint64_t lblock, dblock;
287 if (offset >= ip->i_di.di_size)
290 if ((offset + size) > ip->i_di.di_size)
291 size = ip->i_di.di_size - offset;
296 if (gfs2_is_stuffed(ip))
297 return gfs2_dir_read_stuffed(ip, buf, (unsigned int)offset,
300 if (gfs2_assert_warn(sdp, gfs2_is_jdata(ip)))
304 o = do_div(lblock, sdp->sd_jbsize) + sizeof(struct gfs2_meta_header);
306 while (copied < size) {
308 struct buffer_head *bh;
311 amount = size - copied;
312 if (amount > sdp->sd_sb.sb_bsize - o)
313 amount = sdp->sd_sb.sb_bsize - o;
317 error = gfs2_extent_map(ip->i_vnode, lblock, &new,
324 gfs2_meta_ra(ip->i_gl, dblock, extlen);
328 error = gfs2_dir_get_new_buffer(ip, dblock, &bh);
330 error = gfs2_dir_get_existing_buffer(ip, dblock, &bh);
338 memcpy(buf, bh->b_data + o, amount);
346 o = sizeof(struct gfs2_meta_header);
351 return (copied) ? copied : error;
354 typedef int (*gfs2_dscan_t)(const struct gfs2_dirent *dent,
355 const struct qstr *name,
358 static inline int __gfs2_dirent_find(const struct gfs2_dirent *dent,
359 const struct qstr *name, int ret)
361 if (dent->de_inum.no_addr != 0 &&
362 be32_to_cpu(dent->de_hash) == name->hash &&
363 be16_to_cpu(dent->de_name_len) == name->len &&
364 memcmp((char *)(dent+1), name->name, name->len) == 0)
369 static int gfs2_dirent_find(const struct gfs2_dirent *dent,
370 const struct qstr *name,
373 return __gfs2_dirent_find(dent, name, 1);
376 static int gfs2_dirent_prev(const struct gfs2_dirent *dent,
377 const struct qstr *name,
380 return __gfs2_dirent_find(dent, name, 2);
384 * name->name holds ptr to start of block.
385 * name->len holds size of block.
387 static int gfs2_dirent_last(const struct gfs2_dirent *dent,
388 const struct qstr *name,
391 const char *start = name->name;
392 const char *end = (const char *)dent + be16_to_cpu(dent->de_rec_len);
393 if (name->len == (end - start))
398 static int gfs2_dirent_find_space(const struct gfs2_dirent *dent,
399 const struct qstr *name,
402 unsigned required = GFS2_DIRENT_SIZE(name->len);
403 unsigned actual = GFS2_DIRENT_SIZE(be16_to_cpu(dent->de_name_len));
404 unsigned totlen = be16_to_cpu(dent->de_rec_len);
406 if (!dent->de_inum.no_addr)
407 actual = GFS2_DIRENT_SIZE(0);
408 if ((totlen - actual) >= required)
413 struct dirent_gather {
414 const struct gfs2_dirent **pdent;
418 static int gfs2_dirent_gather(const struct gfs2_dirent *dent,
419 const struct qstr *name,
422 struct dirent_gather *g = opaque;
423 if (dent->de_inum.no_addr) {
424 g->pdent[g->offset++] = dent;
430 * Other possible things to check:
431 * - Inode located within filesystem size (and on valid block)
432 * - Valid directory entry type
433 * Not sure how heavy-weight we want to make this... could also check
434 * hash is correct for example, but that would take a lot of extra time.
435 * For now the most important thing is to check that the various sizes
438 static int gfs2_check_dirent(struct gfs2_dirent *dent, unsigned int offset,
439 unsigned int size, unsigned int len, int first)
441 const char *msg = "gfs2_dirent too small";
442 if (unlikely(size < sizeof(struct gfs2_dirent)))
444 msg = "gfs2_dirent misaligned";
445 if (unlikely(offset & 0x7))
447 msg = "gfs2_dirent points beyond end of block";
448 if (unlikely(offset + size > len))
450 msg = "zero inode number";
451 if (unlikely(!first && !dent->de_inum.no_addr))
453 msg = "name length is greater than space in dirent";
454 if (dent->de_inum.no_addr &&
455 unlikely(sizeof(struct gfs2_dirent)+be16_to_cpu(dent->de_name_len) >
460 printk(KERN_WARNING "gfs2_check_dirent: %s (%s)\n", msg,
461 first ? "first in block" : "not first in block");
465 static int gfs2_dirent_offset(const void *buf)
467 const struct gfs2_meta_header *h = buf;
472 switch(be32_to_cpu(h->mh_type)) {
473 case GFS2_METATYPE_LF:
474 offset = sizeof(struct gfs2_leaf);
476 case GFS2_METATYPE_DI:
477 offset = sizeof(struct gfs2_dinode);
484 printk(KERN_WARNING "gfs2_scan_dirent: wrong block type %u\n",
485 be32_to_cpu(h->mh_type));
489 static struct gfs2_dirent *gfs2_dirent_scan(struct inode *inode,
491 unsigned int len, gfs2_dscan_t scan,
492 const struct qstr *name,
495 struct gfs2_dirent *dent, *prev;
500 ret = gfs2_dirent_offset(buf);
506 dent = (struct gfs2_dirent *)(buf + offset);
507 size = be16_to_cpu(dent->de_rec_len);
508 if (gfs2_check_dirent(dent, offset, size, len, 1))
511 ret = scan(dent, name, opaque);
518 dent = (struct gfs2_dirent *)(buf + offset);
519 size = be16_to_cpu(dent->de_rec_len);
520 if (gfs2_check_dirent(dent, offset, size, len, 0))
530 return prev ? prev : dent;
537 gfs2_consist_inode(inode->u.generic_ip);
538 return ERR_PTR(-EIO);
543 * dirent_first - Return the first dirent
544 * @dip: the directory
546 * @dent: Pointer to list of dirents
548 * return first dirent whether bh points to leaf or stuffed dinode
550 * Returns: IS_LEAF, IS_DINODE, or -errno
553 static int dirent_first(struct gfs2_inode *dip, struct buffer_head *bh,
554 struct gfs2_dirent **dent)
556 struct gfs2_meta_header *h = (struct gfs2_meta_header *)bh->b_data;
558 if (be32_to_cpu(h->mh_type) == GFS2_METATYPE_LF) {
559 if (gfs2_meta_check(dip->i_sbd, bh))
561 *dent = (struct gfs2_dirent *)(bh->b_data +
562 sizeof(struct gfs2_leaf));
565 if (gfs2_metatype_check(dip->i_sbd, bh, GFS2_METATYPE_DI))
567 *dent = (struct gfs2_dirent *)(bh->b_data +
568 sizeof(struct gfs2_dinode));
574 * dirent_next - Next dirent
575 * @dip: the directory
577 * @dent: Pointer to list of dirents
579 * Returns: 0 on success, error code otherwise
582 static int dirent_next(struct gfs2_inode *dip, struct buffer_head *bh,
583 struct gfs2_dirent **dent)
585 struct gfs2_dirent *tmp, *cur;
587 uint16_t cur_rec_len;
590 bh_end = bh->b_data + bh->b_size;
591 cur_rec_len = be16_to_cpu(cur->de_rec_len);
593 if ((char *)cur + cur_rec_len >= bh_end) {
594 if ((char *)cur + cur_rec_len > bh_end) {
595 gfs2_consist_inode(dip);
601 tmp = (struct gfs2_dirent *)((char *)cur + cur_rec_len);
603 if ((char *)tmp + be16_to_cpu(tmp->de_rec_len) > bh_end) {
604 gfs2_consist_inode(dip);
608 if (cur_rec_len == 0) {
609 gfs2_consist_inode(dip);
613 /* Only the first dent could ever have de_inum.no_addr == 0 */
614 if (!tmp->de_inum.no_addr) {
615 gfs2_consist_inode(dip);
625 * dirent_del - Delete a dirent
626 * @dip: The GFS2 inode
628 * @prev: The previous dirent
629 * @cur: The current dirent
633 static void dirent_del(struct gfs2_inode *dip, struct buffer_head *bh,
634 struct gfs2_dirent *prev, struct gfs2_dirent *cur)
636 uint16_t cur_rec_len, prev_rec_len;
638 if (!cur->de_inum.no_addr) {
639 gfs2_consist_inode(dip);
643 gfs2_trans_add_bh(dip->i_gl, bh, 1);
645 /* If there is no prev entry, this is the first entry in the block.
646 The de_rec_len is already as big as it needs to be. Just zero
647 out the inode number and return. */
650 cur->de_inum.no_addr = 0; /* No endianess worries */
654 /* Combine this dentry with the previous one. */
656 prev_rec_len = be16_to_cpu(prev->de_rec_len);
657 cur_rec_len = be16_to_cpu(cur->de_rec_len);
659 if ((char *)prev + prev_rec_len != (char *)cur)
660 gfs2_consist_inode(dip);
661 if ((char *)cur + cur_rec_len > bh->b_data + bh->b_size)
662 gfs2_consist_inode(dip);
664 prev_rec_len += cur_rec_len;
665 prev->de_rec_len = cpu_to_be16(prev_rec_len);
669 * Takes a dent from which to grab space as an argument. Returns the
670 * newly created dent.
672 static struct gfs2_dirent *gfs2_init_dirent(struct inode *inode,
673 struct gfs2_dirent *dent,
674 const struct qstr *name,
675 struct buffer_head *bh)
677 struct gfs2_inode *ip = inode->u.generic_ip;
678 struct gfs2_dirent *ndent;
679 unsigned offset = 0, totlen;
681 if (dent->de_inum.no_addr)
682 offset = GFS2_DIRENT_SIZE(be16_to_cpu(dent->de_name_len));
683 totlen = be16_to_cpu(dent->de_rec_len);
684 BUG_ON(offset + name->len > totlen);
685 gfs2_trans_add_bh(ip->i_gl, bh, 1);
686 ndent = (struct gfs2_dirent *)((char *)dent + offset);
687 dent->de_rec_len = cpu_to_be16(offset);
688 gfs2_qstr2dirent(name, totlen - offset, ndent);
692 static struct gfs2_dirent *gfs2_dirent_alloc(struct inode *inode,
693 struct buffer_head *bh,
694 const struct qstr *name)
696 struct gfs2_dirent *dent;
697 dent = gfs2_dirent_scan(inode, bh->b_data, bh->b_size,
698 gfs2_dirent_find_space, name, NULL);
699 if (!dent || IS_ERR(dent))
701 return gfs2_init_dirent(inode, dent, name, bh);
704 static int get_leaf(struct gfs2_inode *dip, uint64_t leaf_no,
705 struct buffer_head **bhp)
709 error = gfs2_meta_read(dip->i_gl, leaf_no, DIO_START | DIO_WAIT, bhp);
710 if (!error && gfs2_metatype_check(dip->i_sbd, *bhp, GFS2_METATYPE_LF))
717 * get_leaf_nr - Get a leaf number associated with the index
718 * @dip: The GFS2 inode
722 * Returns: 0 on success, error code otherwise
725 static int get_leaf_nr(struct gfs2_inode *dip, uint32_t index,
731 error = gfs2_dir_read_data(dip, (char *)&leaf_no,
732 index * sizeof(uint64_t),
734 if (error != sizeof(uint64_t))
735 return (error < 0) ? error : -EIO;
737 *leaf_out = be64_to_cpu(leaf_no);
742 static int get_first_leaf(struct gfs2_inode *dip, uint32_t index,
743 struct buffer_head **bh_out)
748 error = get_leaf_nr(dip, index, &leaf_no);
750 error = get_leaf(dip, leaf_no, bh_out);
755 static struct gfs2_dirent *gfs2_dirent_search(struct inode *inode,
756 const struct qstr *name,
758 struct buffer_head **pbh)
760 struct buffer_head *bh;
761 struct gfs2_dirent *dent;
762 struct gfs2_inode *ip = inode->u.generic_ip;
765 if (ip->i_di.di_flags & GFS2_DIF_EXHASH) {
766 struct gfs2_leaf *leaf;
767 unsigned hsize = 1 << ip->i_di.di_depth;
770 if (hsize * sizeof(u64) != ip->i_di.di_size) {
771 gfs2_consist_inode(ip);
772 return ERR_PTR(-EIO);
775 index = name->hash >> (32 - ip->i_di.di_depth);
776 error = get_first_leaf(ip, index, &bh);
778 return ERR_PTR(error);
780 dent = gfs2_dirent_scan(inode, bh->b_data, bh->b_size,
784 leaf = (struct gfs2_leaf *)bh->b_data;
785 ln = be64_to_cpu(leaf->lf_next);
789 error = get_leaf(ip, ln, &bh);
792 return error ? ERR_PTR(error) : NULL;
795 error = gfs2_meta_inode_buffer(ip, &bh);
797 return ERR_PTR(error);
798 dent = gfs2_dirent_scan(inode, bh->b_data, bh->b_size, scan, name, NULL);
800 if (unlikely(dent == NULL || IS_ERR(dent))) {
808 static struct gfs2_leaf *new_leaf(struct inode *inode, struct buffer_head **pbh, u16 depth)
810 struct gfs2_inode *ip = inode->u.generic_ip;
811 u64 bn = gfs2_alloc_meta(ip);
812 struct buffer_head *bh = gfs2_meta_new(ip->i_gl, bn);
813 struct gfs2_leaf *leaf;
814 struct gfs2_dirent *dent;
815 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 = inode->u.generic_ip;
842 struct gfs2_sbd *sdp = dip->i_sbd;
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_vnode, 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 = inode->u.generic_ip;
937 struct buffer_head *nbh, *obh, *dibh;
938 struct gfs2_leaf *nleaf, *oleaf;
939 struct gfs2_dirent *dent, *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(dip->i_sbd, !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 = dip->i_sbd;
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 = inode->u.generic_ip;
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 = inode->u.generic_ip;
1352 struct gfs2_sbd *sdp = dip->i_sbd;
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 = inode->u.generic_ip;
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 = inode->u.generic_ip;
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 = inode->u.generic_ip;
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_vnode, 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);
1667 * gfs2_dir_mvino - Change inode number of directory entry
1668 * @dip: The GFS2 inode
1672 * This routine changes the inode number of a directory entry. It's used
1673 * by rename to change ".." when a directory is moved.
1674 * Assumes a glock is held on dvp.
1679 int gfs2_dir_mvino(struct gfs2_inode *dip, const struct qstr *filename,
1680 struct gfs2_inum *inum, unsigned int new_type)
1682 struct buffer_head *bh;
1683 struct gfs2_dirent *dent;
1686 dent = gfs2_dirent_search(dip->i_vnode, filename, gfs2_dirent_find, &bh);
1688 gfs2_consist_inode(dip);
1692 return PTR_ERR(dent);
1694 gfs2_trans_add_bh(dip->i_gl, bh, 1);
1695 gfs2_inum_out(inum, (char *)&dent->de_inum);
1696 dent->de_type = cpu_to_be16(new_type);
1698 if (dip->i_di.di_flags & GFS2_DIF_EXHASH) {
1700 error = gfs2_meta_inode_buffer(dip, &bh);
1703 gfs2_trans_add_bh(dip->i_gl, bh, 1);
1706 dip->i_di.di_mtime = dip->i_di.di_ctime = get_seconds();
1707 gfs2_dinode_out(&dip->i_di, bh->b_data);
1713 * foreach_leaf - call a function for each leaf in a directory
1714 * @dip: the directory
1715 * @lc: the function to call for each each
1716 * @data: private data to pass to it
1721 static int foreach_leaf(struct gfs2_inode *dip, leaf_call_t lc, void *data)
1723 struct gfs2_sbd *sdp = dip->i_sbd;
1724 struct buffer_head *bh;
1725 struct gfs2_leaf *leaf;
1726 uint32_t hsize, len;
1727 uint32_t ht_offset, lp_offset, ht_offset_cur = -1;
1733 hsize = 1 << dip->i_di.di_depth;
1734 if (hsize * sizeof(uint64_t) != dip->i_di.di_size) {
1735 gfs2_consist_inode(dip);
1739 lp = kmalloc(sdp->sd_hash_bsize, GFP_KERNEL);
1743 while (index < hsize) {
1744 lp_offset = index & (sdp->sd_hash_ptrs - 1);
1745 ht_offset = index - lp_offset;
1747 if (ht_offset_cur != ht_offset) {
1748 error = gfs2_dir_read_data(dip, (char *)lp,
1749 ht_offset * sizeof(uint64_t),
1750 sdp->sd_hash_bsize);
1751 if (error != sdp->sd_hash_bsize) {
1756 ht_offset_cur = ht_offset;
1759 leaf_no = be64_to_cpu(lp[lp_offset]);
1761 error = get_leaf(dip, leaf_no, &bh);
1764 leaf = (struct gfs2_leaf *)bh->b_data;
1767 len = 1 << (dip->i_di.di_depth - be16_to_cpu(leaf->lf_depth));
1769 error = lc(dip, index, len, leaf_no, data);
1773 index = (index & ~(len - 1)) + len;
1778 if (index != hsize) {
1779 gfs2_consist_inode(dip);
1790 * leaf_dealloc - Deallocate a directory leaf
1791 * @dip: the directory
1792 * @index: the hash table offset in the directory
1793 * @len: the number of pointers to this leaf
1794 * @leaf_no: the leaf number
1800 static int leaf_dealloc(struct gfs2_inode *dip, uint32_t index, uint32_t len,
1801 uint64_t leaf_no, void *data)
1803 struct gfs2_sbd *sdp = dip->i_sbd;
1804 struct gfs2_leaf *tmp_leaf;
1805 struct gfs2_rgrp_list rlist;
1806 struct buffer_head *bh, *dibh;
1808 unsigned int rg_blocks = 0, l_blocks = 0;
1810 unsigned int x, size = len * sizeof(uint64_t);
1813 memset(&rlist, 0, sizeof(struct gfs2_rgrp_list));
1815 ht = kzalloc(size, GFP_KERNEL);
1819 gfs2_alloc_get(dip);
1821 error = gfs2_quota_hold(dip, NO_QUOTA_CHANGE, NO_QUOTA_CHANGE);
1825 error = gfs2_rindex_hold(sdp, &dip->i_alloc.al_ri_gh);
1829 /* Count the number of leaves */
1831 for (blk = leaf_no; blk; blk = nblk) {
1832 error = get_leaf(dip, blk, &bh);
1835 tmp_leaf = (struct gfs2_leaf *)bh->b_data;
1836 nblk = be64_to_cpu(tmp_leaf->lf_next);
1839 gfs2_rlist_add(sdp, &rlist, blk);
1843 gfs2_rlist_alloc(&rlist, LM_ST_EXCLUSIVE, 0);
1845 for (x = 0; x < rlist.rl_rgrps; x++) {
1846 struct gfs2_rgrpd *rgd;
1847 rgd = rlist.rl_ghs[x].gh_gl->gl_object;
1848 rg_blocks += rgd->rd_ri.ri_length;
1851 error = gfs2_glock_nq_m(rlist.rl_rgrps, rlist.rl_ghs);
1855 error = gfs2_trans_begin(sdp,
1856 rg_blocks + (DIV_ROUND_UP(size, sdp->sd_jbsize) + 1) +
1857 RES_DINODE + RES_STATFS + RES_QUOTA, l_blocks);
1859 goto out_rg_gunlock;
1861 for (blk = leaf_no; blk; blk = nblk) {
1862 error = get_leaf(dip, blk, &bh);
1865 tmp_leaf = (struct gfs2_leaf *)bh->b_data;
1866 nblk = be64_to_cpu(tmp_leaf->lf_next);
1869 gfs2_free_meta(dip, blk, 1);
1871 if (!dip->i_di.di_blocks)
1872 gfs2_consist_inode(dip);
1873 dip->i_di.di_blocks--;
1876 error = gfs2_dir_write_data(dip, ht, index * sizeof(uint64_t), size);
1877 if (error != size) {
1883 error = gfs2_meta_inode_buffer(dip, &dibh);
1887 gfs2_trans_add_bh(dip->i_gl, dibh, 1);
1888 gfs2_dinode_out(&dip->i_di, dibh->b_data);
1892 gfs2_trans_end(sdp);
1895 gfs2_glock_dq_m(rlist.rl_rgrps, rlist.rl_ghs);
1898 gfs2_rlist_free(&rlist);
1899 gfs2_glock_dq_uninit(&dip->i_alloc.al_ri_gh);
1902 gfs2_quota_unhold(dip);
1905 gfs2_alloc_put(dip);
1912 * gfs2_dir_exhash_dealloc - free all the leaf blocks in a directory
1913 * @dip: the directory
1915 * Dealloc all on-disk directory leaves to FREEMETA state
1916 * Change on-disk inode type to "regular file"
1921 int gfs2_dir_exhash_dealloc(struct gfs2_inode *dip)
1923 struct gfs2_sbd *sdp = dip->i_sbd;
1924 struct buffer_head *bh;
1927 /* Dealloc on-disk leaves to FREEMETA state */
1928 error = foreach_leaf(dip, leaf_dealloc, NULL);
1932 /* Make this a regular file in case we crash.
1933 (We don't want to free these blocks a second time.) */
1935 error = gfs2_trans_begin(sdp, RES_DINODE, 0);
1939 error = gfs2_meta_inode_buffer(dip, &bh);
1941 gfs2_trans_add_bh(dip->i_gl, bh, 1);
1942 ((struct gfs2_dinode *)bh->b_data)->di_mode =
1943 cpu_to_be32(S_IFREG);
1947 gfs2_trans_end(sdp);
1953 * gfs2_diradd_alloc_required - find if adding entry will require an allocation
1954 * @ip: the file being written to
1955 * @filname: the filename that's going to be added
1957 * Returns: 1 if alloc required, 0 if not, -ve on error
1960 int gfs2_diradd_alloc_required(struct inode *inode, const struct qstr *name)
1962 struct gfs2_dirent *dent;
1963 struct buffer_head *bh;
1965 dent = gfs2_dirent_search(inode, name, gfs2_dirent_find_space, &bh);
1970 return PTR_ERR(dent);