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_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>
64 #include <linux/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) (((u64)(h)) >> 1)
82 #define gfs2_dir_offset2hash(p) ((u32)(((u64)(p)) << 1))
84 typedef int (*leaf_call_t) (struct gfs2_inode *dip, u32 index, u32 len,
85 u64 leaf_no, void *data);
86 typedef int (*gfs2_dscan_t)(const struct gfs2_dirent *dent,
87 const struct qstr *name, void *opaque);
90 int gfs2_dir_get_new_buffer(struct gfs2_inode *ip, u64 block,
91 struct buffer_head **bhp)
93 struct buffer_head *bh;
95 bh = gfs2_meta_new(ip->i_gl, block);
96 gfs2_trans_add_bh(ip->i_gl, bh, 1);
97 gfs2_metatype_set(bh, GFS2_METATYPE_JD, GFS2_FORMAT_JD);
98 gfs2_buffer_clear_tail(bh, sizeof(struct gfs2_meta_header));
103 static int gfs2_dir_get_existing_buffer(struct gfs2_inode *ip, u64 block,
104 struct buffer_head **bhp)
106 struct buffer_head *bh;
109 error = gfs2_meta_read(ip->i_gl, block, DIO_WAIT, &bh);
112 if (gfs2_metatype_check(GFS2_SB(&ip->i_inode), bh, GFS2_METATYPE_JD)) {
120 static int gfs2_dir_write_stuffed(struct gfs2_inode *ip, const char *buf,
121 unsigned int offset, unsigned int size)
124 struct buffer_head *dibh;
127 error = gfs2_meta_inode_buffer(ip, &dibh);
131 gfs2_trans_add_bh(ip->i_gl, dibh, 1);
132 memcpy(dibh->b_data + offset + sizeof(struct gfs2_dinode), buf, size);
133 if (ip->i_di.di_size < offset + size)
134 ip->i_di.di_size = offset + size;
135 ip->i_di.di_mtime = ip->i_di.di_ctime = get_seconds();
136 gfs2_dinode_out(&ip->i_di, dibh->b_data);
146 * gfs2_dir_write_data - Write directory information to the inode
147 * @ip: The GFS2 inode
148 * @buf: The buffer containing information to be written
149 * @offset: The file offset to start writing at
150 * @size: The amount of data to write
152 * Returns: The number of bytes correctly written or error code
154 static int gfs2_dir_write_data(struct gfs2_inode *ip, const char *buf,
155 u64 offset, unsigned int size)
157 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
158 struct buffer_head *dibh;
168 if (gfs2_is_stuffed(ip) &&
169 offset + size <= sdp->sd_sb.sb_bsize - sizeof(struct gfs2_dinode))
170 return gfs2_dir_write_stuffed(ip, buf, (unsigned int)offset,
173 if (gfs2_assert_warn(sdp, gfs2_is_jdata(ip)))
176 if (gfs2_is_stuffed(ip)) {
177 error = gfs2_unstuff_dinode(ip, NULL);
183 o = do_div(lblock, sdp->sd_jbsize) + sizeof(struct gfs2_meta_header);
185 while (copied < size) {
187 struct buffer_head *bh;
190 amount = size - copied;
191 if (amount > sdp->sd_sb.sb_bsize - o)
192 amount = sdp->sd_sb.sb_bsize - o;
196 error = gfs2_extent_map(&ip->i_inode, lblock, &new,
201 if (gfs2_assert_withdraw(sdp, dblock))
205 if (amount == sdp->sd_jbsize || new)
206 error = gfs2_dir_get_new_buffer(ip, dblock, &bh);
208 error = gfs2_dir_get_existing_buffer(ip, dblock, &bh);
213 gfs2_trans_add_bh(ip->i_gl, bh, 1);
214 memcpy(bh->b_data + o, buf, amount);
225 o = sizeof(struct gfs2_meta_header);
229 error = gfs2_meta_inode_buffer(ip, &dibh);
233 if (ip->i_di.di_size < offset + copied)
234 ip->i_di.di_size = offset + copied;
235 ip->i_di.di_mtime = ip->i_di.di_ctime = get_seconds();
237 gfs2_trans_add_bh(ip->i_gl, dibh, 1);
238 gfs2_dinode_out(&ip->i_di, dibh->b_data);
248 static int gfs2_dir_read_stuffed(struct gfs2_inode *ip, char *buf,
249 u64 offset, unsigned int size)
251 struct buffer_head *dibh;
254 error = gfs2_meta_inode_buffer(ip, &dibh);
256 offset += sizeof(struct gfs2_dinode);
257 memcpy(buf, dibh->b_data + offset, 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 * @offset: File offset to begin jdata_readng from
270 * @size: Amount of data to transfer
272 * Returns: The amount of data actually copied or the error
274 static int gfs2_dir_read_data(struct gfs2_inode *ip, char *buf, u64 offset,
275 unsigned int size, unsigned ra)
277 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
284 if (offset >= ip->i_di.di_size)
287 if (offset + size > ip->i_di.di_size)
288 size = ip->i_di.di_size - offset;
293 if (gfs2_is_stuffed(ip))
294 return gfs2_dir_read_stuffed(ip, buf, offset, size);
296 if (gfs2_assert_warn(sdp, gfs2_is_jdata(ip)))
300 o = do_div(lblock, sdp->sd_jbsize) + sizeof(struct gfs2_meta_header);
302 while (copied < size) {
304 struct buffer_head *bh;
307 amount = size - copied;
308 if (amount > sdp->sd_sb.sb_bsize - o)
309 amount = sdp->sd_sb.sb_bsize - o;
313 error = gfs2_extent_map(&ip->i_inode, lblock, &new,
315 if (error || !dblock)
320 bh = gfs2_meta_ra(ip->i_gl, dblock, extlen);
323 error = gfs2_meta_read(ip->i_gl, dblock, DIO_WAIT, &bh);
327 error = gfs2_metatype_check(sdp, bh, GFS2_METATYPE_JD);
334 memcpy(buf, bh->b_data + o, amount);
340 o = sizeof(struct gfs2_meta_header);
345 return (copied) ? copied : error;
348 static inline int __gfs2_dirent_find(const struct gfs2_dirent *dent,
349 const struct qstr *name, int ret)
351 if (dent->de_inum.no_addr != 0 &&
352 be32_to_cpu(dent->de_hash) == name->hash &&
353 be16_to_cpu(dent->de_name_len) == name->len &&
354 memcmp(dent+1, name->name, name->len) == 0)
359 static int gfs2_dirent_find(const struct gfs2_dirent *dent,
360 const struct qstr *name,
363 return __gfs2_dirent_find(dent, name, 1);
366 static int gfs2_dirent_prev(const struct gfs2_dirent *dent,
367 const struct qstr *name,
370 return __gfs2_dirent_find(dent, name, 2);
374 * name->name holds ptr to start of block.
375 * name->len holds size of block.
377 static int gfs2_dirent_last(const struct gfs2_dirent *dent,
378 const struct qstr *name,
381 const char *start = name->name;
382 const char *end = (const char *)dent + be16_to_cpu(dent->de_rec_len);
383 if (name->len == (end - start))
388 static int gfs2_dirent_find_space(const struct gfs2_dirent *dent,
389 const struct qstr *name,
392 unsigned required = GFS2_DIRENT_SIZE(name->len);
393 unsigned actual = GFS2_DIRENT_SIZE(be16_to_cpu(dent->de_name_len));
394 unsigned totlen = be16_to_cpu(dent->de_rec_len);
396 if (!dent->de_inum.no_addr)
397 actual = GFS2_DIRENT_SIZE(0);
398 if (totlen - actual >= required)
403 struct dirent_gather {
404 const struct gfs2_dirent **pdent;
408 static int gfs2_dirent_gather(const struct gfs2_dirent *dent,
409 const struct qstr *name,
412 struct dirent_gather *g = opaque;
413 if (dent->de_inum.no_addr) {
414 g->pdent[g->offset++] = dent;
420 * Other possible things to check:
421 * - Inode located within filesystem size (and on valid block)
422 * - Valid directory entry type
423 * Not sure how heavy-weight we want to make this... could also check
424 * hash is correct for example, but that would take a lot of extra time.
425 * For now the most important thing is to check that the various sizes
428 static int gfs2_check_dirent(struct gfs2_dirent *dent, unsigned int offset,
429 unsigned int size, unsigned int len, int first)
431 const char *msg = "gfs2_dirent too small";
432 if (unlikely(size < sizeof(struct gfs2_dirent)))
434 msg = "gfs2_dirent misaligned";
435 if (unlikely(offset & 0x7))
437 msg = "gfs2_dirent points beyond end of block";
438 if (unlikely(offset + size > len))
440 msg = "zero inode number";
441 if (unlikely(!first && !dent->de_inum.no_addr))
443 msg = "name length is greater than space in dirent";
444 if (dent->de_inum.no_addr &&
445 unlikely(sizeof(struct gfs2_dirent)+be16_to_cpu(dent->de_name_len) >
450 printk(KERN_WARNING "gfs2_check_dirent: %s (%s)\n", msg,
451 first ? "first in block" : "not first in block");
455 static int gfs2_dirent_offset(const void *buf)
457 const struct gfs2_meta_header *h = buf;
462 switch(be32_to_cpu(h->mh_type)) {
463 case GFS2_METATYPE_LF:
464 offset = sizeof(struct gfs2_leaf);
466 case GFS2_METATYPE_DI:
467 offset = sizeof(struct gfs2_dinode);
474 printk(KERN_WARNING "gfs2_scan_dirent: wrong block type %u\n",
475 be32_to_cpu(h->mh_type));
479 static struct gfs2_dirent *gfs2_dirent_scan(struct inode *inode, void *buf,
480 unsigned int len, gfs2_dscan_t scan,
481 const struct qstr *name,
484 struct gfs2_dirent *dent, *prev;
489 ret = gfs2_dirent_offset(buf);
496 size = be16_to_cpu(dent->de_rec_len);
497 if (gfs2_check_dirent(dent, offset, size, len, 1))
500 ret = scan(dent, name, opaque);
508 size = be16_to_cpu(dent->de_rec_len);
509 if (gfs2_check_dirent(dent, offset, size, len, 0))
519 return prev ? prev : dent;
526 gfs2_consist_inode(GFS2_I(inode));
527 return ERR_PTR(-EIO);
532 * dirent_first - Return the first dirent
533 * @dip: the directory
535 * @dent: Pointer to list of dirents
537 * return first dirent whether bh points to leaf or stuffed dinode
539 * Returns: IS_LEAF, IS_DINODE, or -errno
542 static int dirent_first(struct gfs2_inode *dip, struct buffer_head *bh,
543 struct gfs2_dirent **dent)
545 struct gfs2_meta_header *h = (struct gfs2_meta_header *)bh->b_data;
547 if (be32_to_cpu(h->mh_type) == GFS2_METATYPE_LF) {
548 if (gfs2_meta_check(GFS2_SB(&dip->i_inode), bh))
550 *dent = (struct gfs2_dirent *)(bh->b_data +
551 sizeof(struct gfs2_leaf));
554 if (gfs2_metatype_check(GFS2_SB(&dip->i_inode), bh, GFS2_METATYPE_DI))
556 *dent = (struct gfs2_dirent *)(bh->b_data +
557 sizeof(struct gfs2_dinode));
562 static int dirent_check_reclen(struct gfs2_inode *dip,
563 const struct gfs2_dirent *d, const void *end_p)
566 u16 rec_len = be16_to_cpu(d->de_rec_len);
568 if (unlikely(rec_len < sizeof(struct gfs2_dirent)))
576 gfs2_consist_inode(dip);
581 * dirent_next - Next dirent
582 * @dip: the directory
584 * @dent: Pointer to list of dirents
586 * Returns: 0 on success, error code otherwise
589 static int dirent_next(struct gfs2_inode *dip, struct buffer_head *bh,
590 struct gfs2_dirent **dent)
592 struct gfs2_dirent *cur = *dent, *tmp;
593 char *bh_end = bh->b_data + bh->b_size;
596 ret = dirent_check_reclen(dip, cur, bh_end);
600 tmp = (void *)cur + ret;
601 ret = dirent_check_reclen(dip, tmp, bh_end);
605 /* Only the first dent could ever have de_inum.no_addr == 0 */
606 if (!tmp->de_inum.no_addr) {
607 gfs2_consist_inode(dip);
616 * dirent_del - Delete a dirent
617 * @dip: The GFS2 inode
619 * @prev: The previous dirent
620 * @cur: The current dirent
624 static void dirent_del(struct gfs2_inode *dip, struct buffer_head *bh,
625 struct gfs2_dirent *prev, struct gfs2_dirent *cur)
627 u16 cur_rec_len, prev_rec_len;
629 if (!cur->de_inum.no_addr) {
630 gfs2_consist_inode(dip);
634 gfs2_trans_add_bh(dip->i_gl, bh, 1);
636 /* If there is no prev entry, this is the first entry in the block.
637 The de_rec_len is already as big as it needs to be. Just zero
638 out the inode number and return. */
641 cur->de_inum.no_addr = 0; /* No endianess worries */
645 /* Combine this dentry with the previous one. */
647 prev_rec_len = be16_to_cpu(prev->de_rec_len);
648 cur_rec_len = be16_to_cpu(cur->de_rec_len);
650 if ((char *)prev + prev_rec_len != (char *)cur)
651 gfs2_consist_inode(dip);
652 if ((char *)cur + cur_rec_len > bh->b_data + bh->b_size)
653 gfs2_consist_inode(dip);
655 prev_rec_len += cur_rec_len;
656 prev->de_rec_len = cpu_to_be16(prev_rec_len);
660 * Takes a dent from which to grab space as an argument. Returns the
661 * newly created dent.
663 static struct gfs2_dirent *gfs2_init_dirent(struct inode *inode,
664 struct gfs2_dirent *dent,
665 const struct qstr *name,
666 struct buffer_head *bh)
668 struct gfs2_inode *ip = GFS2_I(inode);
669 struct gfs2_dirent *ndent;
670 unsigned offset = 0, totlen;
672 if (dent->de_inum.no_addr)
673 offset = GFS2_DIRENT_SIZE(be16_to_cpu(dent->de_name_len));
674 totlen = be16_to_cpu(dent->de_rec_len);
675 BUG_ON(offset + name->len > totlen);
676 gfs2_trans_add_bh(ip->i_gl, bh, 1);
677 ndent = (struct gfs2_dirent *)((char *)dent + offset);
678 dent->de_rec_len = cpu_to_be16(offset);
679 gfs2_qstr2dirent(name, totlen - offset, ndent);
683 static struct gfs2_dirent *gfs2_dirent_alloc(struct inode *inode,
684 struct buffer_head *bh,
685 const struct qstr *name)
687 struct gfs2_dirent *dent;
688 dent = gfs2_dirent_scan(inode, bh->b_data, bh->b_size,
689 gfs2_dirent_find_space, name, NULL);
690 if (!dent || IS_ERR(dent))
692 return gfs2_init_dirent(inode, dent, name, bh);
695 static int get_leaf(struct gfs2_inode *dip, u64 leaf_no,
696 struct buffer_head **bhp)
700 error = gfs2_meta_read(dip->i_gl, leaf_no, DIO_WAIT, bhp);
701 if (!error && gfs2_metatype_check(GFS2_SB(&dip->i_inode), *bhp, GFS2_METATYPE_LF)) {
702 /* printk(KERN_INFO "block num=%llu\n", leaf_no); */
710 * get_leaf_nr - Get a leaf number associated with the index
711 * @dip: The GFS2 inode
715 * Returns: 0 on success, error code otherwise
718 static int get_leaf_nr(struct gfs2_inode *dip, u32 index,
724 error = gfs2_dir_read_data(dip, (char *)&leaf_no,
727 if (error != sizeof(u64))
728 return (error < 0) ? error : -EIO;
730 *leaf_out = be64_to_cpu(leaf_no);
735 static int get_first_leaf(struct gfs2_inode *dip, u32 index,
736 struct buffer_head **bh_out)
741 error = get_leaf_nr(dip, index, &leaf_no);
743 error = get_leaf(dip, leaf_no, bh_out);
748 static struct gfs2_dirent *gfs2_dirent_search(struct inode *inode,
749 const struct qstr *name,
751 struct buffer_head **pbh)
753 struct buffer_head *bh;
754 struct gfs2_dirent *dent;
755 struct gfs2_inode *ip = GFS2_I(inode);
758 if (ip->i_di.di_flags & GFS2_DIF_EXHASH) {
759 struct gfs2_leaf *leaf;
760 unsigned hsize = 1 << ip->i_di.di_depth;
763 if (hsize * sizeof(u64) != ip->i_di.di_size) {
764 gfs2_consist_inode(ip);
765 return ERR_PTR(-EIO);
768 index = name->hash >> (32 - ip->i_di.di_depth);
769 error = get_first_leaf(ip, index, &bh);
771 return ERR_PTR(error);
773 dent = gfs2_dirent_scan(inode, bh->b_data, bh->b_size,
777 leaf = (struct gfs2_leaf *)bh->b_data;
778 ln = be64_to_cpu(leaf->lf_next);
783 error = get_leaf(ip, ln, &bh);
786 return error ? ERR_PTR(error) : NULL;
790 error = gfs2_meta_inode_buffer(ip, &bh);
792 return ERR_PTR(error);
793 dent = gfs2_dirent_scan(inode, bh->b_data, bh->b_size, scan, name, NULL);
795 if (unlikely(dent == NULL || IS_ERR(dent))) {
803 static struct gfs2_leaf *new_leaf(struct inode *inode, struct buffer_head **pbh, u16 depth)
805 struct gfs2_inode *ip = GFS2_I(inode);
806 u64 bn = gfs2_alloc_meta(ip);
807 struct buffer_head *bh = gfs2_meta_new(ip->i_gl, bn);
808 struct gfs2_leaf *leaf;
809 struct gfs2_dirent *dent;
810 struct qstr name = { .name = "", .len = 0, .hash = 0 };
814 gfs2_trans_add_bh(ip->i_gl, bh, 1);
815 gfs2_metatype_set(bh, GFS2_METATYPE_LF, GFS2_FORMAT_LF);
816 leaf = (struct gfs2_leaf *)bh->b_data;
817 leaf->lf_depth = cpu_to_be16(depth);
818 leaf->lf_entries = 0;
819 leaf->lf_dirent_format = cpu_to_be16(GFS2_FORMAT_DE);
821 memset(leaf->lf_reserved, 0, sizeof(leaf->lf_reserved));
822 dent = (struct gfs2_dirent *)(leaf+1);
823 gfs2_qstr2dirent(&name, bh->b_size - sizeof(struct gfs2_leaf), dent);
829 * dir_make_exhash - Convert a stuffed directory into an ExHash directory
830 * @dip: The GFS2 inode
832 * Returns: 0 on success, error code otherwise
835 static int dir_make_exhash(struct inode *inode)
837 struct gfs2_inode *dip = GFS2_I(inode);
838 struct gfs2_sbd *sdp = GFS2_SB(inode);
839 struct gfs2_dirent *dent;
841 struct buffer_head *bh, *dibh;
842 struct gfs2_leaf *leaf;
848 error = gfs2_meta_inode_buffer(dip, &dibh);
852 /* Turn over a new leaf */
854 leaf = new_leaf(inode, &bh, 0);
859 gfs2_assert(sdp, dip->i_di.di_entries < (1 << 16));
860 leaf->lf_entries = cpu_to_be16(dip->i_di.di_entries);
864 gfs2_buffer_copy_tail(bh, sizeof(struct gfs2_leaf), dibh,
865 sizeof(struct gfs2_dinode));
867 /* Find last entry */
870 args.len = bh->b_size - sizeof(struct gfs2_dinode) +
871 sizeof(struct gfs2_leaf);
872 args.name = bh->b_data;
873 dent = gfs2_dirent_scan(&dip->i_inode, bh->b_data, bh->b_size,
874 gfs2_dirent_last, &args, NULL);
883 return PTR_ERR(dent);
886 /* Adjust the last dirent's record length
887 (Remember that dent still points to the last entry.) */
889 dent->de_rec_len = cpu_to_be16(be16_to_cpu(dent->de_rec_len) +
890 sizeof(struct gfs2_dinode) -
891 sizeof(struct gfs2_leaf));
895 /* We're done with the new leaf block, now setup the new
898 gfs2_trans_add_bh(dip->i_gl, dibh, 1);
899 gfs2_buffer_clear_tail(dibh, sizeof(struct gfs2_dinode));
901 lp = (u64 *)(dibh->b_data + sizeof(struct gfs2_dinode));
903 for (x = sdp->sd_hash_ptrs; x--; lp++)
904 *lp = cpu_to_be64(bn);
906 dip->i_di.di_size = sdp->sd_sb.sb_bsize / 2;
907 dip->i_di.di_blocks++;
908 dip->i_di.di_flags |= GFS2_DIF_EXHASH;
909 dip->i_di.di_payload_format = 0;
911 for (x = sdp->sd_hash_ptrs, y = -1; x; x >>= 1, y++) ;
912 dip->i_di.di_depth = y;
914 gfs2_dinode_out(&dip->i_di, dibh->b_data);
922 * dir_split_leaf - Split a leaf block into two
923 * @dip: The GFS2 inode
927 * Returns: 0 on success, error code on failure
930 static int dir_split_leaf(struct inode *inode, const struct qstr *name)
932 struct gfs2_inode *dip = GFS2_I(inode);
933 struct buffer_head *nbh, *obh, *dibh;
934 struct gfs2_leaf *nleaf, *oleaf;
935 struct gfs2_dirent *dent = NULL, *prev = NULL, *next = NULL, *new;
936 u32 start, len, half_len, divider;
937 u64 bn, *lp, leaf_no;
942 index = name->hash >> (32 - dip->i_di.di_depth);
943 error = get_leaf_nr(dip, index, &leaf_no);
947 /* Get the old leaf block */
948 error = get_leaf(dip, leaf_no, &obh);
952 oleaf = (struct gfs2_leaf *)obh->b_data;
953 if (dip->i_di.di_depth == be16_to_cpu(oleaf->lf_depth)) {
955 return 1; /* can't split */
958 gfs2_trans_add_bh(dip->i_gl, obh, 1);
960 nleaf = new_leaf(inode, &nbh, be16_to_cpu(oleaf->lf_depth) + 1);
967 /* Compute the start and len of leaf pointers in the hash table. */
968 len = 1 << (dip->i_di.di_depth - be16_to_cpu(oleaf->lf_depth));
971 printk(KERN_WARNING "di_depth %u lf_depth %u index %u\n", dip->i_di.di_depth, be16_to_cpu(oleaf->lf_depth), index);
972 gfs2_consist_inode(dip);
977 start = (index & ~(len - 1));
979 /* Change the pointers.
980 Don't bother distinguishing stuffed from non-stuffed.
981 This code is complicated enough already. */
982 lp = kmalloc(half_len * sizeof(u64), GFP_NOFS | __GFP_NOFAIL);
983 /* Change the pointers */
984 for (x = 0; x < half_len; x++)
985 lp[x] = cpu_to_be64(bn);
987 error = gfs2_dir_write_data(dip, (char *)lp, start * sizeof(u64),
988 half_len * sizeof(u64));
989 if (error != half_len * sizeof(u64)) {
997 /* Compute the divider */
998 divider = (start + half_len) << (32 - dip->i_di.di_depth);
1000 /* Copy the entries */
1001 dirent_first(dip, obh, &dent);
1005 if (dirent_next(dip, obh, &next))
1008 if (dent->de_inum.no_addr &&
1009 be32_to_cpu(dent->de_hash) < divider) {
1011 str.name = (char*)(dent+1);
1012 str.len = be16_to_cpu(dent->de_name_len);
1013 str.hash = be32_to_cpu(dent->de_hash);
1014 new = gfs2_dirent_alloc(inode, nbh, &str);
1016 error = PTR_ERR(new);
1020 new->de_inum = dent->de_inum; /* No endian worries */
1021 new->de_type = dent->de_type; /* No endian worries */
1022 nleaf->lf_entries = cpu_to_be16(be16_to_cpu(nleaf->lf_entries)+1);
1024 dirent_del(dip, obh, prev, dent);
1026 if (!oleaf->lf_entries)
1027 gfs2_consist_inode(dip);
1028 oleaf->lf_entries = cpu_to_be16(be16_to_cpu(oleaf->lf_entries)-1);
1040 oleaf->lf_depth = nleaf->lf_depth;
1042 error = gfs2_meta_inode_buffer(dip, &dibh);
1043 if (!gfs2_assert_withdraw(GFS2_SB(&dip->i_inode), !error)) {
1044 dip->i_di.di_blocks++;
1045 gfs2_dinode_out(&dip->i_di, dibh->b_data);
1064 * dir_double_exhash - Double size of ExHash table
1065 * @dip: The GFS2 dinode
1067 * Returns: 0 on success, error code on failure
1070 static int dir_double_exhash(struct gfs2_inode *dip)
1072 struct gfs2_sbd *sdp = GFS2_SB(&dip->i_inode);
1073 struct buffer_head *dibh;
1081 hsize = 1 << dip->i_di.di_depth;
1082 if (hsize * sizeof(u64) != dip->i_di.di_size) {
1083 gfs2_consist_inode(dip);
1087 /* Allocate both the "from" and "to" buffers in one big chunk */
1089 buf = kcalloc(3, sdp->sd_hash_bsize, GFP_KERNEL | __GFP_NOFAIL);
1091 for (block = dip->i_di.di_size >> sdp->sd_hash_bsize_shift; block--;) {
1092 error = gfs2_dir_read_data(dip, (char *)buf,
1093 block * sdp->sd_hash_bsize,
1094 sdp->sd_hash_bsize, 1);
1095 if (error != sdp->sd_hash_bsize) {
1102 to = (u64 *)((char *)buf + sdp->sd_hash_bsize);
1104 for (x = sdp->sd_hash_ptrs; x--; from++) {
1105 *to++ = *from; /* No endianess worries */
1109 error = gfs2_dir_write_data(dip,
1110 (char *)buf + sdp->sd_hash_bsize,
1111 block * sdp->sd_sb.sb_bsize,
1112 sdp->sd_sb.sb_bsize);
1113 if (error != sdp->sd_sb.sb_bsize) {
1122 error = gfs2_meta_inode_buffer(dip, &dibh);
1123 if (!gfs2_assert_withdraw(sdp, !error)) {
1124 dip->i_di.di_depth++;
1125 gfs2_dinode_out(&dip->i_di, dibh->b_data);
1137 * compare_dents - compare directory entries by hash value
1141 * When comparing the hash entries of @a to @b:
1147 static int compare_dents(const void *a, const void *b)
1149 const struct gfs2_dirent *dent_a, *dent_b;
1153 dent_a = *(const struct gfs2_dirent **)a;
1154 hash_a = be32_to_cpu(dent_a->de_hash);
1156 dent_b = *(const struct gfs2_dirent **)b;
1157 hash_b = be32_to_cpu(dent_b->de_hash);
1159 if (hash_a > hash_b)
1161 else if (hash_a < hash_b)
1164 unsigned int len_a = be16_to_cpu(dent_a->de_name_len);
1165 unsigned int len_b = be16_to_cpu(dent_b->de_name_len);
1169 else if (len_a < len_b)
1172 ret = memcmp(dent_a + 1, dent_b + 1, len_a);
1179 * do_filldir_main - read out directory entries
1180 * @dip: The GFS2 inode
1181 * @offset: The offset in the file to read from
1182 * @opaque: opaque data to pass to filldir
1183 * @filldir: The function to pass entries to
1184 * @darr: an array of struct gfs2_dirent pointers to read
1185 * @entries: the number of entries in darr
1186 * @copied: pointer to int that's non-zero if a entry has been copied out
1188 * Jump through some hoops to make sure that if there are hash collsions,
1189 * they are read out at the beginning of a buffer. We want to minimize
1190 * the possibility that they will fall into different readdir buffers or
1191 * that someone will want to seek to that location.
1193 * Returns: errno, >0 on exception from filldir
1196 static int do_filldir_main(struct gfs2_inode *dip, u64 *offset,
1197 void *opaque, gfs2_filldir_t filldir,
1198 const struct gfs2_dirent **darr, u32 entries,
1201 const struct gfs2_dirent *dent, *dent_next;
1202 struct gfs2_inum inum;
1208 sort(darr, entries, sizeof(struct gfs2_dirent *), compare_dents, NULL);
1210 dent_next = darr[0];
1211 off_next = be32_to_cpu(dent_next->de_hash);
1212 off_next = gfs2_disk_hash2offset(off_next);
1214 for (x = 0, y = 1; x < entries; x++, y++) {
1219 dent_next = darr[y];
1220 off_next = be32_to_cpu(dent_next->de_hash);
1221 off_next = gfs2_disk_hash2offset(off_next);
1227 if (off_next == off) {
1228 if (*copied && !run)
1239 gfs2_inum_in(&inum, (char *)&dent->de_inum);
1241 error = filldir(opaque, (const char *)(dent + 1),
1242 be16_to_cpu(dent->de_name_len),
1244 be16_to_cpu(dent->de_type));
1251 /* Increment the *offset by one, so the next time we come into the
1252 do_filldir fxn, we get the next entry instead of the last one in the
1260 static int gfs2_dir_read_leaf(struct inode *inode, u64 *offset, void *opaque,
1261 gfs2_filldir_t filldir, int *copied,
1262 unsigned *depth, u64 leaf_no)
1264 struct gfs2_inode *ip = GFS2_I(inode);
1265 struct buffer_head *bh;
1266 struct gfs2_leaf *lf;
1267 unsigned entries = 0;
1268 unsigned leaves = 0;
1269 const struct gfs2_dirent **darr, *dent;
1270 struct dirent_gather g;
1271 struct buffer_head **larr;
1277 error = get_leaf(ip, lfn, &bh);
1280 lf = (struct gfs2_leaf *)bh->b_data;
1282 *depth = be16_to_cpu(lf->lf_depth);
1283 entries += be16_to_cpu(lf->lf_entries);
1285 lfn = be64_to_cpu(lf->lf_next);
1293 larr = vmalloc((leaves + entries) * sizeof(void *));
1296 darr = (const struct gfs2_dirent **)(larr + leaves);
1302 error = get_leaf(ip, lfn, &bh);
1305 lf = (struct gfs2_leaf *)bh->b_data;
1306 lfn = be64_to_cpu(lf->lf_next);
1307 if (lf->lf_entries) {
1308 dent = gfs2_dirent_scan(inode, bh->b_data, bh->b_size,
1309 gfs2_dirent_gather, NULL, &g);
1310 error = PTR_ERR(dent);
1321 error = do_filldir_main(ip, offset, opaque, filldir, darr,
1324 for(i = 0; i < leaf; i++)
1332 * dir_e_read - Reads the entries from a directory into a filldir buffer
1333 * @dip: dinode pointer
1334 * @offset: the hash of the last entry read shifted to the right once
1335 * @opaque: buffer for the filldir function to fill
1336 * @filldir: points to the filldir function to use
1341 static int dir_e_read(struct inode *inode, u64 *offset, void *opaque,
1342 gfs2_filldir_t filldir)
1344 struct gfs2_inode *dip = GFS2_I(inode);
1345 struct gfs2_sbd *sdp = GFS2_SB(inode);
1347 u32 ht_offset, lp_offset, ht_offset_cur = -1;
1354 hsize = 1 << dip->i_di.di_depth;
1355 if (hsize * sizeof(u64) != dip->i_di.di_size) {
1356 gfs2_consist_inode(dip);
1360 hash = gfs2_dir_offset2hash(*offset);
1361 index = hash >> (32 - dip->i_di.di_depth);
1363 lp = kmalloc(sdp->sd_hash_bsize, GFP_KERNEL);
1367 while (index < hsize) {
1368 lp_offset = index & (sdp->sd_hash_ptrs - 1);
1369 ht_offset = index - lp_offset;
1371 if (ht_offset_cur != ht_offset) {
1372 error = gfs2_dir_read_data(dip, (char *)lp,
1373 ht_offset * sizeof(u64),
1374 sdp->sd_hash_bsize, 1);
1375 if (error != sdp->sd_hash_bsize) {
1380 ht_offset_cur = ht_offset;
1383 error = gfs2_dir_read_leaf(inode, offset, opaque, filldir,
1385 be64_to_cpu(lp[lp_offset]));
1389 len = 1 << (dip->i_di.di_depth - depth);
1390 index = (index & ~(len - 1)) + len;
1400 int gfs2_dir_read(struct inode *inode, u64 *offset, void *opaque,
1401 gfs2_filldir_t filldir)
1403 struct gfs2_inode *dip = GFS2_I(inode);
1404 struct dirent_gather g;
1405 const struct gfs2_dirent **darr, *dent;
1406 struct buffer_head *dibh;
1410 if (!dip->i_di.di_entries)
1413 if (dip->i_di.di_flags & GFS2_DIF_EXHASH)
1414 return dir_e_read(inode, offset, opaque, filldir);
1416 if (!gfs2_is_stuffed(dip)) {
1417 gfs2_consist_inode(dip);
1421 error = gfs2_meta_inode_buffer(dip, &dibh);
1426 darr = kmalloc(dip->i_di.di_entries * sizeof(struct gfs2_dirent *),
1431 dent = gfs2_dirent_scan(inode, dibh->b_data, dibh->b_size,
1432 gfs2_dirent_gather, NULL, &g);
1434 error = PTR_ERR(dent);
1437 error = do_filldir_main(dip, offset, opaque, filldir, darr,
1438 dip->i_di.di_entries, &copied);
1452 * gfs2_dir_search - Search a directory
1453 * @dip: The GFS2 inode
1457 * This routine searches a directory for a file or another directory.
1458 * Assumes a glock is held on dip.
1463 int gfs2_dir_search(struct inode *dir, const struct qstr *name,
1464 struct gfs2_inum *inum, unsigned int *type)
1466 struct buffer_head *bh;
1467 struct gfs2_dirent *dent;
1469 dent = gfs2_dirent_search(dir, name, gfs2_dirent_find, &bh);
1472 return PTR_ERR(dent);
1474 gfs2_inum_in(inum, (char *)&dent->de_inum);
1476 *type = be16_to_cpu(dent->de_type);
1483 static int dir_new_leaf(struct inode *inode, const struct qstr *name)
1485 struct buffer_head *bh, *obh;
1486 struct gfs2_inode *ip = GFS2_I(inode);
1487 struct gfs2_leaf *leaf, *oleaf;
1492 index = name->hash >> (32 - ip->i_di.di_depth);
1493 error = get_first_leaf(ip, index, &obh);
1497 oleaf = (struct gfs2_leaf *)obh->b_data;
1498 bn = be64_to_cpu(oleaf->lf_next);
1502 error = get_leaf(ip, bn, &obh);
1507 gfs2_trans_add_bh(ip->i_gl, obh, 1);
1509 leaf = new_leaf(inode, &bh, be16_to_cpu(oleaf->lf_depth));
1514 oleaf->lf_next = cpu_to_be64(bh->b_blocknr);
1518 error = gfs2_meta_inode_buffer(ip, &bh);
1521 gfs2_trans_add_bh(ip->i_gl, bh, 1);
1522 ip->i_di.di_blocks++;
1523 gfs2_dinode_out(&ip->i_di, bh->b_data);
1529 * gfs2_dir_add - Add new filename into directory
1530 * @dip: The GFS2 inode
1531 * @filename: The new name
1532 * @inode: The inode number of the entry
1533 * @type: The type of the entry
1535 * Returns: 0 on success, error code on failure
1538 int gfs2_dir_add(struct inode *inode, const struct qstr *name,
1539 const struct gfs2_inum *inum, unsigned type)
1541 struct gfs2_inode *ip = GFS2_I(inode);
1542 struct buffer_head *bh;
1543 struct gfs2_dirent *dent;
1544 struct gfs2_leaf *leaf;
1548 dent = gfs2_dirent_search(inode, name, gfs2_dirent_find_space,
1552 return PTR_ERR(dent);
1553 dent = gfs2_init_dirent(inode, dent, name, bh);
1554 gfs2_inum_out(inum, (char *)&dent->de_inum);
1555 dent->de_type = cpu_to_be16(type);
1556 if (ip->i_di.di_flags & GFS2_DIF_EXHASH) {
1557 leaf = (struct gfs2_leaf *)bh->b_data;
1558 leaf->lf_entries = cpu_to_be16(be16_to_cpu(leaf->lf_entries) + 1);
1561 error = gfs2_meta_inode_buffer(ip, &bh);
1564 gfs2_trans_add_bh(ip->i_gl, bh, 1);
1565 ip->i_di.di_entries++;
1566 ip->i_di.di_mtime = ip->i_di.di_ctime = get_seconds();
1567 gfs2_dinode_out(&ip->i_di, bh->b_data);
1572 if (!(ip->i_di.di_flags & GFS2_DIF_EXHASH)) {
1573 error = dir_make_exhash(inode);
1578 error = dir_split_leaf(inode, name);
1583 if (ip->i_di.di_depth < GFS2_DIR_MAX_DEPTH) {
1584 error = dir_double_exhash(ip);
1587 error = dir_split_leaf(inode, name);
1593 error = dir_new_leaf(inode, name);
1604 * gfs2_dir_del - Delete a directory entry
1605 * @dip: The GFS2 inode
1606 * @filename: The filename
1608 * Returns: 0 on success, error code on failure
1611 int gfs2_dir_del(struct gfs2_inode *dip, const struct qstr *name)
1613 struct gfs2_dirent *dent, *prev = NULL;
1614 struct buffer_head *bh;
1617 /* Returns _either_ the entry (if its first in block) or the
1618 previous entry otherwise */
1619 dent = gfs2_dirent_search(&dip->i_inode, name, gfs2_dirent_prev, &bh);
1621 gfs2_consist_inode(dip);
1625 gfs2_consist_inode(dip);
1626 return PTR_ERR(dent);
1628 /* If not first in block, adjust pointers accordingly */
1629 if (gfs2_dirent_find(dent, name, NULL) == 0) {
1631 dent = (struct gfs2_dirent *)((char *)dent + be16_to_cpu(prev->de_rec_len));
1634 dirent_del(dip, bh, prev, dent);
1635 if (dip->i_di.di_flags & GFS2_DIF_EXHASH) {
1636 struct gfs2_leaf *leaf = (struct gfs2_leaf *)bh->b_data;
1637 u16 entries = be16_to_cpu(leaf->lf_entries);
1639 gfs2_consist_inode(dip);
1640 leaf->lf_entries = cpu_to_be16(--entries);
1644 error = gfs2_meta_inode_buffer(dip, &bh);
1648 if (!dip->i_di.di_entries)
1649 gfs2_consist_inode(dip);
1650 gfs2_trans_add_bh(dip->i_gl, bh, 1);
1651 dip->i_di.di_entries--;
1652 dip->i_di.di_mtime = dip->i_di.di_ctime = get_seconds();
1653 gfs2_dinode_out(&dip->i_di, bh->b_data);
1655 mark_inode_dirty(&dip->i_inode);
1661 * gfs2_dir_mvino - Change inode number of directory entry
1662 * @dip: The GFS2 inode
1666 * This routine changes the inode number of a directory entry. It's used
1667 * by rename to change ".." when a directory is moved.
1668 * Assumes a glock is held on dvp.
1673 int gfs2_dir_mvino(struct gfs2_inode *dip, const struct qstr *filename,
1674 struct gfs2_inum *inum, unsigned int new_type)
1676 struct buffer_head *bh;
1677 struct gfs2_dirent *dent;
1680 dent = gfs2_dirent_search(&dip->i_inode, filename, gfs2_dirent_find, &bh);
1682 gfs2_consist_inode(dip);
1686 return PTR_ERR(dent);
1688 gfs2_trans_add_bh(dip->i_gl, bh, 1);
1689 gfs2_inum_out(inum, (char *)&dent->de_inum);
1690 dent->de_type = cpu_to_be16(new_type);
1692 if (dip->i_di.di_flags & GFS2_DIF_EXHASH) {
1694 error = gfs2_meta_inode_buffer(dip, &bh);
1697 gfs2_trans_add_bh(dip->i_gl, bh, 1);
1700 dip->i_di.di_mtime = dip->i_di.di_ctime = get_seconds();
1701 gfs2_dinode_out(&dip->i_di, bh->b_data);
1707 * foreach_leaf - call a function for each leaf in a directory
1708 * @dip: the directory
1709 * @lc: the function to call for each each
1710 * @data: private data to pass to it
1715 static int foreach_leaf(struct gfs2_inode *dip, leaf_call_t lc, void *data)
1717 struct gfs2_sbd *sdp = GFS2_SB(&dip->i_inode);
1718 struct buffer_head *bh;
1719 struct gfs2_leaf *leaf;
1721 u32 ht_offset, lp_offset, ht_offset_cur = -1;
1727 hsize = 1 << dip->i_di.di_depth;
1728 if (hsize * sizeof(u64) != dip->i_di.di_size) {
1729 gfs2_consist_inode(dip);
1733 lp = kmalloc(sdp->sd_hash_bsize, GFP_KERNEL);
1737 while (index < hsize) {
1738 lp_offset = index & (sdp->sd_hash_ptrs - 1);
1739 ht_offset = index - lp_offset;
1741 if (ht_offset_cur != ht_offset) {
1742 error = gfs2_dir_read_data(dip, (char *)lp,
1743 ht_offset * sizeof(u64),
1744 sdp->sd_hash_bsize, 1);
1745 if (error != sdp->sd_hash_bsize) {
1750 ht_offset_cur = ht_offset;
1753 leaf_no = be64_to_cpu(lp[lp_offset]);
1755 error = get_leaf(dip, leaf_no, &bh);
1758 leaf = (struct gfs2_leaf *)bh->b_data;
1759 len = 1 << (dip->i_di.di_depth - be16_to_cpu(leaf->lf_depth));
1762 error = lc(dip, index, len, leaf_no, data);
1766 index = (index & ~(len - 1)) + len;
1771 if (index != hsize) {
1772 gfs2_consist_inode(dip);
1783 * leaf_dealloc - Deallocate a directory leaf
1784 * @dip: the directory
1785 * @index: the hash table offset in the directory
1786 * @len: the number of pointers to this leaf
1787 * @leaf_no: the leaf number
1793 static int leaf_dealloc(struct gfs2_inode *dip, u32 index, u32 len,
1794 u64 leaf_no, void *data)
1796 struct gfs2_sbd *sdp = GFS2_SB(&dip->i_inode);
1797 struct gfs2_leaf *tmp_leaf;
1798 struct gfs2_rgrp_list rlist;
1799 struct buffer_head *bh, *dibh;
1801 unsigned int rg_blocks = 0, l_blocks = 0;
1803 unsigned int x, size = len * sizeof(u64);
1806 memset(&rlist, 0, sizeof(struct gfs2_rgrp_list));
1808 ht = kzalloc(size, GFP_KERNEL);
1812 gfs2_alloc_get(dip);
1814 error = gfs2_quota_hold(dip, NO_QUOTA_CHANGE, NO_QUOTA_CHANGE);
1818 error = gfs2_rindex_hold(sdp, &dip->i_alloc.al_ri_gh);
1822 /* Count the number of leaves */
1824 for (blk = leaf_no; blk; blk = nblk) {
1825 error = get_leaf(dip, blk, &bh);
1828 tmp_leaf = (struct gfs2_leaf *)bh->b_data;
1829 nblk = be64_to_cpu(tmp_leaf->lf_next);
1832 gfs2_rlist_add(sdp, &rlist, blk);
1836 gfs2_rlist_alloc(&rlist, LM_ST_EXCLUSIVE, 0);
1838 for (x = 0; x < rlist.rl_rgrps; x++) {
1839 struct gfs2_rgrpd *rgd;
1840 rgd = rlist.rl_ghs[x].gh_gl->gl_object;
1841 rg_blocks += rgd->rd_ri.ri_length;
1844 error = gfs2_glock_nq_m(rlist.rl_rgrps, rlist.rl_ghs);
1848 error = gfs2_trans_begin(sdp,
1849 rg_blocks + (DIV_ROUND_UP(size, sdp->sd_jbsize) + 1) +
1850 RES_DINODE + RES_STATFS + RES_QUOTA, l_blocks);
1852 goto out_rg_gunlock;
1854 for (blk = leaf_no; blk; blk = nblk) {
1855 error = get_leaf(dip, blk, &bh);
1858 tmp_leaf = (struct gfs2_leaf *)bh->b_data;
1859 nblk = be64_to_cpu(tmp_leaf->lf_next);
1862 gfs2_free_meta(dip, blk, 1);
1864 if (!dip->i_di.di_blocks)
1865 gfs2_consist_inode(dip);
1866 dip->i_di.di_blocks--;
1869 error = gfs2_dir_write_data(dip, ht, index * sizeof(u64), size);
1870 if (error != size) {
1876 error = gfs2_meta_inode_buffer(dip, &dibh);
1880 gfs2_trans_add_bh(dip->i_gl, dibh, 1);
1881 gfs2_dinode_out(&dip->i_di, dibh->b_data);
1885 gfs2_trans_end(sdp);
1887 gfs2_glock_dq_m(rlist.rl_rgrps, rlist.rl_ghs);
1889 gfs2_rlist_free(&rlist);
1890 gfs2_glock_dq_uninit(&dip->i_alloc.al_ri_gh);
1892 gfs2_quota_unhold(dip);
1894 gfs2_alloc_put(dip);
1900 * gfs2_dir_exhash_dealloc - free all the leaf blocks in a directory
1901 * @dip: the directory
1903 * Dealloc all on-disk directory leaves to FREEMETA state
1904 * Change on-disk inode type to "regular file"
1909 int gfs2_dir_exhash_dealloc(struct gfs2_inode *dip)
1911 struct gfs2_sbd *sdp = GFS2_SB(&dip->i_inode);
1912 struct buffer_head *bh;
1915 /* Dealloc on-disk leaves to FREEMETA state */
1916 error = foreach_leaf(dip, leaf_dealloc, NULL);
1920 /* Make this a regular file in case we crash.
1921 (We don't want to free these blocks a second time.) */
1923 error = gfs2_trans_begin(sdp, RES_DINODE, 0);
1927 error = gfs2_meta_inode_buffer(dip, &bh);
1929 gfs2_trans_add_bh(dip->i_gl, bh, 1);
1930 ((struct gfs2_dinode *)bh->b_data)->di_mode =
1931 cpu_to_be32(S_IFREG);
1935 gfs2_trans_end(sdp);
1941 * gfs2_diradd_alloc_required - find if adding entry will require an allocation
1942 * @ip: the file being written to
1943 * @filname: the filename that's going to be added
1945 * Returns: 1 if alloc required, 0 if not, -ve on error
1948 int gfs2_diradd_alloc_required(struct inode *inode, const struct qstr *name)
1950 struct gfs2_dirent *dent;
1951 struct buffer_head *bh;
1953 dent = gfs2_dirent_search(inode, name, gfs2_dirent_find_space, &bh);
1958 return PTR_ERR(dent);