1ac27a0ecSDave Kleikamp /* 2617ba13bSMingming Cao * linux/fs/ext4/dir.c 3ac27a0ecSDave Kleikamp * 4ac27a0ecSDave Kleikamp * Copyright (C) 1992, 1993, 1994, 1995 5ac27a0ecSDave Kleikamp * Remy Card (card@masi.ibp.fr) 6ac27a0ecSDave Kleikamp * Laboratoire MASI - Institut Blaise Pascal 7ac27a0ecSDave Kleikamp * Universite Pierre et Marie Curie (Paris VI) 8ac27a0ecSDave Kleikamp * 9ac27a0ecSDave Kleikamp * from 10ac27a0ecSDave Kleikamp * 11ac27a0ecSDave Kleikamp * linux/fs/minix/dir.c 12ac27a0ecSDave Kleikamp * 13ac27a0ecSDave Kleikamp * Copyright (C) 1991, 1992 Linus Torvalds 14ac27a0ecSDave Kleikamp * 15617ba13bSMingming Cao * ext4 directory handling functions 16ac27a0ecSDave Kleikamp * 17ac27a0ecSDave Kleikamp * Big-endian to little-endian byte-swapping/bitmaps by 18ac27a0ecSDave Kleikamp * David S. Miller (davem@caip.rutgers.edu), 1995 19ac27a0ecSDave Kleikamp * 20ac27a0ecSDave Kleikamp * Hash Tree Directory indexing (c) 2001 Daniel Phillips 21ac27a0ecSDave Kleikamp * 22ac27a0ecSDave Kleikamp */ 23ac27a0ecSDave Kleikamp 24ac27a0ecSDave Kleikamp #include <linux/fs.h> 25dab291afSMingming Cao #include <linux/jbd2.h> 26ac27a0ecSDave Kleikamp #include <linux/buffer_head.h> 27ac27a0ecSDave Kleikamp #include <linux/slab.h> 28ac27a0ecSDave Kleikamp #include <linux/rbtree.h> 293dcf5451SChristoph Hellwig #include "ext4.h" 30ac27a0ecSDave Kleikamp 31617ba13bSMingming Cao static unsigned char ext4_filetype_table[] = { 32ac27a0ecSDave Kleikamp DT_UNKNOWN, DT_REG, DT_DIR, DT_CHR, DT_BLK, DT_FIFO, DT_SOCK, DT_LNK 33ac27a0ecSDave Kleikamp }; 34ac27a0ecSDave Kleikamp 35617ba13bSMingming Cao static int ext4_readdir(struct file *, void *, filldir_t); 36617ba13bSMingming Cao static int ext4_dx_readdir(struct file *filp, 37ac27a0ecSDave Kleikamp void *dirent, filldir_t filldir); 38617ba13bSMingming Cao static int ext4_release_dir(struct inode *inode, 39ac27a0ecSDave Kleikamp struct file *filp); 40ac27a0ecSDave Kleikamp 41617ba13bSMingming Cao const struct file_operations ext4_dir_operations = { 42ac27a0ecSDave Kleikamp .llseek = generic_file_llseek, 43ac27a0ecSDave Kleikamp .read = generic_read_dir, 44617ba13bSMingming Cao .readdir = ext4_readdir, /* we take BKL. needed?*/ 455cdd7b2dSAndi Kleen .unlocked_ioctl = ext4_ioctl, 46ac27a0ecSDave Kleikamp #ifdef CONFIG_COMPAT 47617ba13bSMingming Cao .compat_ioctl = ext4_compat_ioctl, 48ac27a0ecSDave Kleikamp #endif 49642be6ecSAndi Kleen .fsync = ext4_sync_file, 50617ba13bSMingming Cao .release = ext4_release_dir, 51ac27a0ecSDave Kleikamp }; 52ac27a0ecSDave Kleikamp 53ac27a0ecSDave Kleikamp 54ac27a0ecSDave Kleikamp static unsigned char get_dtype(struct super_block *sb, int filetype) 55ac27a0ecSDave Kleikamp { 56617ba13bSMingming Cao if (!EXT4_HAS_INCOMPAT_FEATURE(sb, EXT4_FEATURE_INCOMPAT_FILETYPE) || 57617ba13bSMingming Cao (filetype >= EXT4_FT_MAX)) 58ac27a0ecSDave Kleikamp return DT_UNKNOWN; 59ac27a0ecSDave Kleikamp 60617ba13bSMingming Cao return (ext4_filetype_table[filetype]); 61ac27a0ecSDave Kleikamp } 62ac27a0ecSDave Kleikamp 63ac27a0ecSDave Kleikamp 6460fd4da3STheodore Ts'o int __ext4_check_dir_entry(const char *function, unsigned int line, 6560fd4da3STheodore Ts'o struct inode *dir, 66617ba13bSMingming Cao struct ext4_dir_entry_2 *de, 67ac27a0ecSDave Kleikamp struct buffer_head *bh, 68498e5f24STheodore Ts'o unsigned int offset) 69ac27a0ecSDave Kleikamp { 70ac27a0ecSDave Kleikamp const char *error_msg = NULL; 713d0518f4SWei Yongjun const int rlen = ext4_rec_len_from_disk(de->rec_len, 723d0518f4SWei Yongjun dir->i_sb->s_blocksize); 73ac27a0ecSDave Kleikamp 74617ba13bSMingming Cao if (rlen < EXT4_DIR_REC_LEN(1)) 75ac27a0ecSDave Kleikamp error_msg = "rec_len is smaller than minimal"; 76ac27a0ecSDave Kleikamp else if (rlen % 4 != 0) 77ac27a0ecSDave Kleikamp error_msg = "rec_len % 4 != 0"; 78617ba13bSMingming Cao else if (rlen < EXT4_DIR_REC_LEN(de->name_len)) 79ac27a0ecSDave Kleikamp error_msg = "rec_len is too small for name_len"; 80ac27a0ecSDave Kleikamp else if (((char *) de - bh->b_data) + rlen > dir->i_sb->s_blocksize) 81ac27a0ecSDave Kleikamp error_msg = "directory entry across blocks"; 82ac27a0ecSDave Kleikamp else if (le32_to_cpu(de->inode) > 83617ba13bSMingming Cao le32_to_cpu(EXT4_SB(dir->i_sb)->s_es->s_inodes_count)) 84ac27a0ecSDave Kleikamp error_msg = "inode out of bounds"; 85ac27a0ecSDave Kleikamp 86ac27a0ecSDave Kleikamp if (error_msg != NULL) 87c398eda0STheodore Ts'o ext4_error_inode(dir, function, line, bh->b_blocknr, 88c398eda0STheodore Ts'o "bad entry in directory: %s - " 89b8b8afe2SToshiyuki Okajima "offset=%u(%u), inode=%u, rec_len=%d, name_len=%d", 90c398eda0STheodore Ts'o error_msg, (unsigned) (offset%bh->b_size), offset, 91498e5f24STheodore Ts'o le32_to_cpu(de->inode), 92ac27a0ecSDave Kleikamp rlen, de->name_len); 93ac27a0ecSDave Kleikamp return error_msg == NULL ? 1 : 0; 94ac27a0ecSDave Kleikamp } 95ac27a0ecSDave Kleikamp 96617ba13bSMingming Cao static int ext4_readdir(struct file *filp, 97ac27a0ecSDave Kleikamp void *dirent, filldir_t filldir) 98ac27a0ecSDave Kleikamp { 99ac27a0ecSDave Kleikamp int error = 0; 100498e5f24STheodore Ts'o unsigned int offset; 101ac27a0ecSDave Kleikamp int i, stored; 102617ba13bSMingming Cao struct ext4_dir_entry_2 *de; 103ac27a0ecSDave Kleikamp struct super_block *sb; 104ac27a0ecSDave Kleikamp int err; 1059d549890SJosef "Jeff" Sipek struct inode *inode = filp->f_path.dentry->d_inode; 106ac27a0ecSDave Kleikamp int ret = 0; 1079d9f1775SEric Sandeen int dir_has_error = 0; 108ac27a0ecSDave Kleikamp 109ac27a0ecSDave Kleikamp sb = inode->i_sb; 110ac27a0ecSDave Kleikamp 111617ba13bSMingming Cao if (EXT4_HAS_COMPAT_FEATURE(inode->i_sb, 112617ba13bSMingming Cao EXT4_FEATURE_COMPAT_DIR_INDEX) && 11312e9b892SDmitry Monakhov ((ext4_test_inode_flag(inode, EXT4_INODE_INDEX)) || 114ac27a0ecSDave Kleikamp ((inode->i_size >> sb->s_blocksize_bits) == 1))) { 115617ba13bSMingming Cao err = ext4_dx_readdir(filp, dirent, filldir); 116ac27a0ecSDave Kleikamp if (err != ERR_BAD_DX_DIR) { 117ac27a0ecSDave Kleikamp ret = err; 118ac27a0ecSDave Kleikamp goto out; 119ac27a0ecSDave Kleikamp } 120ac27a0ecSDave Kleikamp /* 121ac27a0ecSDave Kleikamp * We don't set the inode dirty flag since it's not 122ac27a0ecSDave Kleikamp * critical that it get flushed back to the disk. 123ac27a0ecSDave Kleikamp */ 12407a03824STheodore Ts'o ext4_clear_inode_flag(filp->f_path.dentry->d_inode, 12507a03824STheodore Ts'o EXT4_INODE_INDEX); 126ac27a0ecSDave Kleikamp } 127ac27a0ecSDave Kleikamp stored = 0; 128ac27a0ecSDave Kleikamp offset = filp->f_pos & (sb->s_blocksize - 1); 129ac27a0ecSDave Kleikamp 130ac27a0ecSDave Kleikamp while (!error && !stored && filp->f_pos < inode->i_size) { 1312ed88685STheodore Ts'o struct ext4_map_blocks map; 132ac27a0ecSDave Kleikamp struct buffer_head *bh = NULL; 133ac27a0ecSDave Kleikamp 1342ed88685STheodore Ts'o map.m_lblk = filp->f_pos >> EXT4_BLOCK_SIZE_BITS(sb); 1352ed88685STheodore Ts'o map.m_len = 1; 1362ed88685STheodore Ts'o err = ext4_map_blocks(NULL, inode, &map, 0); 137ac27a0ecSDave Kleikamp if (err > 0) { 1382ed88685STheodore Ts'o pgoff_t index = map.m_pblk >> 139dc7868fcSFengguang Wu (PAGE_CACHE_SHIFT - inode->i_blkbits); 140dc7868fcSFengguang Wu if (!ra_has_index(&filp->f_ra, index)) 141cf914a7dSRusty Russell page_cache_sync_readahead( 142dc7868fcSFengguang Wu sb->s_bdev->bd_inode->i_mapping, 143dc7868fcSFengguang Wu &filp->f_ra, filp, 144cf914a7dSRusty Russell index, 1); 145f4e6b498SFengguang Wu filp->f_ra.prev_pos = (loff_t)index << PAGE_CACHE_SHIFT; 1462ed88685STheodore Ts'o bh = ext4_bread(NULL, inode, map.m_lblk, 0, &err); 147ac27a0ecSDave Kleikamp } 148ac27a0ecSDave Kleikamp 149ac27a0ecSDave Kleikamp /* 150ac27a0ecSDave Kleikamp * We ignore I/O errors on directories so users have a chance 151ac27a0ecSDave Kleikamp * of recovering data when there's a bad sector 152ac27a0ecSDave Kleikamp */ 153ac27a0ecSDave Kleikamp if (!bh) { 1549d9f1775SEric Sandeen if (!dir_has_error) { 15524676da4STheodore Ts'o EXT4_ERROR_INODE(inode, "directory " 1569d9f1775SEric Sandeen "contains a hole at offset %Lu", 1579d9f1775SEric Sandeen (unsigned long long) filp->f_pos); 1589d9f1775SEric Sandeen dir_has_error = 1; 1599d9f1775SEric Sandeen } 160e6c40211SEric Sandeen /* corrupt size? Maybe no more blocks to read */ 161e6c40211SEric Sandeen if (filp->f_pos > inode->i_blocks << 9) 162e6c40211SEric Sandeen break; 163ac27a0ecSDave Kleikamp filp->f_pos += sb->s_blocksize - offset; 164ac27a0ecSDave Kleikamp continue; 165ac27a0ecSDave Kleikamp } 166ac27a0ecSDave Kleikamp 167ac27a0ecSDave Kleikamp revalidate: 168ac27a0ecSDave Kleikamp /* If the dir block has changed since the last call to 169ac27a0ecSDave Kleikamp * readdir(2), then we might be pointing to an invalid 170ac27a0ecSDave Kleikamp * dirent right now. Scan from the start of the block 171ac27a0ecSDave Kleikamp * to make sure. */ 172ac27a0ecSDave Kleikamp if (filp->f_version != inode->i_version) { 173ac27a0ecSDave Kleikamp for (i = 0; i < sb->s_blocksize && i < offset; ) { 174617ba13bSMingming Cao de = (struct ext4_dir_entry_2 *) 175ac27a0ecSDave Kleikamp (bh->b_data + i); 176ac27a0ecSDave Kleikamp /* It's too expensive to do a full 177ac27a0ecSDave Kleikamp * dirent test each time round this 178ac27a0ecSDave Kleikamp * loop, but we do have to test at 179ac27a0ecSDave Kleikamp * least that it is non-zero. A 180ac27a0ecSDave Kleikamp * failure will be detected in the 181ac27a0ecSDave Kleikamp * dirent test below. */ 1823d0518f4SWei Yongjun if (ext4_rec_len_from_disk(de->rec_len, 1833d0518f4SWei Yongjun sb->s_blocksize) < EXT4_DIR_REC_LEN(1)) 184ac27a0ecSDave Kleikamp break; 1853d0518f4SWei Yongjun i += ext4_rec_len_from_disk(de->rec_len, 1863d0518f4SWei Yongjun sb->s_blocksize); 187ac27a0ecSDave Kleikamp } 188ac27a0ecSDave Kleikamp offset = i; 189ac27a0ecSDave Kleikamp filp->f_pos = (filp->f_pos & ~(sb->s_blocksize - 1)) 190ac27a0ecSDave Kleikamp | offset; 191ac27a0ecSDave Kleikamp filp->f_version = inode->i_version; 192ac27a0ecSDave Kleikamp } 193ac27a0ecSDave Kleikamp 194ac27a0ecSDave Kleikamp while (!error && filp->f_pos < inode->i_size 195ac27a0ecSDave Kleikamp && offset < sb->s_blocksize) { 196617ba13bSMingming Cao de = (struct ext4_dir_entry_2 *) (bh->b_data + offset); 19760fd4da3STheodore Ts'o if (!ext4_check_dir_entry(inode, de, 198ac27a0ecSDave Kleikamp bh, offset)) { 19963f57933SAndrew Morton /* 20063f57933SAndrew Morton * On error, skip the f_pos to the next block 20163f57933SAndrew Morton */ 202ac27a0ecSDave Kleikamp filp->f_pos = (filp->f_pos | 203ac27a0ecSDave Kleikamp (sb->s_blocksize - 1)) + 1; 204ac27a0ecSDave Kleikamp brelse(bh); 205ac27a0ecSDave Kleikamp ret = stored; 206ac27a0ecSDave Kleikamp goto out; 207ac27a0ecSDave Kleikamp } 2083d0518f4SWei Yongjun offset += ext4_rec_len_from_disk(de->rec_len, 2093d0518f4SWei Yongjun sb->s_blocksize); 210ac27a0ecSDave Kleikamp if (le32_to_cpu(de->inode)) { 211ac27a0ecSDave Kleikamp /* We might block in the next section 212ac27a0ecSDave Kleikamp * if the data destination is 213ac27a0ecSDave Kleikamp * currently swapped out. So, use a 214ac27a0ecSDave Kleikamp * version stamp to detect whether or 215ac27a0ecSDave Kleikamp * not the directory has been modified 216ac27a0ecSDave Kleikamp * during the copy operation. 217ac27a0ecSDave Kleikamp */ 2182b47c361SMathieu Desnoyers u64 version = filp->f_version; 219ac27a0ecSDave Kleikamp 220ac27a0ecSDave Kleikamp error = filldir(dirent, de->name, 221ac27a0ecSDave Kleikamp de->name_len, 222ac27a0ecSDave Kleikamp filp->f_pos, 223ac27a0ecSDave Kleikamp le32_to_cpu(de->inode), 224ac27a0ecSDave Kleikamp get_dtype(sb, de->file_type)); 225ac27a0ecSDave Kleikamp if (error) 226ac27a0ecSDave Kleikamp break; 227ac27a0ecSDave Kleikamp if (version != filp->f_version) 228ac27a0ecSDave Kleikamp goto revalidate; 229ac27a0ecSDave Kleikamp stored++; 230ac27a0ecSDave Kleikamp } 2313d0518f4SWei Yongjun filp->f_pos += ext4_rec_len_from_disk(de->rec_len, 2323d0518f4SWei Yongjun sb->s_blocksize); 233ac27a0ecSDave Kleikamp } 234ac27a0ecSDave Kleikamp offset = 0; 235ac27a0ecSDave Kleikamp brelse(bh); 236ac27a0ecSDave Kleikamp } 237ac27a0ecSDave Kleikamp out: 238ac27a0ecSDave Kleikamp return ret; 239ac27a0ecSDave Kleikamp } 240ac27a0ecSDave Kleikamp 241ac27a0ecSDave Kleikamp /* 242ac27a0ecSDave Kleikamp * These functions convert from the major/minor hash to an f_pos 243ac27a0ecSDave Kleikamp * value. 244ac27a0ecSDave Kleikamp * 245ac27a0ecSDave Kleikamp * Currently we only use major hash numer. This is unfortunate, but 246ac27a0ecSDave Kleikamp * on 32-bit machines, the same VFS interface is used for lseek and 247ac27a0ecSDave Kleikamp * llseek, so if we use the 64 bit offset, then the 32-bit versions of 248ac27a0ecSDave Kleikamp * lseek/telldir/seekdir will blow out spectacularly, and from within 249ac27a0ecSDave Kleikamp * the ext2 low-level routine, we don't know if we're being called by 250ac27a0ecSDave Kleikamp * a 64-bit version of the system call or the 32-bit version of the 251ac27a0ecSDave Kleikamp * system call. Worse yet, NFSv2 only allows for a 32-bit readdir 252ac27a0ecSDave Kleikamp * cookie. Sigh. 253ac27a0ecSDave Kleikamp */ 254ac27a0ecSDave Kleikamp #define hash2pos(major, minor) (major >> 1) 255ac27a0ecSDave Kleikamp #define pos2maj_hash(pos) ((pos << 1) & 0xffffffff) 256ac27a0ecSDave Kleikamp #define pos2min_hash(pos) (0) 257ac27a0ecSDave Kleikamp 258ac27a0ecSDave Kleikamp /* 259ac27a0ecSDave Kleikamp * This structure holds the nodes of the red-black tree used to store 260ac27a0ecSDave Kleikamp * the directory entry in hash order. 261ac27a0ecSDave Kleikamp */ 262ac27a0ecSDave Kleikamp struct fname { 263ac27a0ecSDave Kleikamp __u32 hash; 264ac27a0ecSDave Kleikamp __u32 minor_hash; 265ac27a0ecSDave Kleikamp struct rb_node rb_hash; 266ac27a0ecSDave Kleikamp struct fname *next; 267ac27a0ecSDave Kleikamp __u32 inode; 268ac27a0ecSDave Kleikamp __u8 name_len; 269ac27a0ecSDave Kleikamp __u8 file_type; 270ac27a0ecSDave Kleikamp char name[0]; 271ac27a0ecSDave Kleikamp }; 272ac27a0ecSDave Kleikamp 273ac27a0ecSDave Kleikamp /* 274ac27a0ecSDave Kleikamp * This functoin implements a non-recursive way of freeing all of the 275ac27a0ecSDave Kleikamp * nodes in the red-black tree. 276ac27a0ecSDave Kleikamp */ 277ac27a0ecSDave Kleikamp static void free_rb_tree_fname(struct rb_root *root) 278ac27a0ecSDave Kleikamp { 279ac27a0ecSDave Kleikamp struct rb_node *n = root->rb_node; 280ac27a0ecSDave Kleikamp struct rb_node *parent; 281ac27a0ecSDave Kleikamp struct fname *fname; 282ac27a0ecSDave Kleikamp 283ac27a0ecSDave Kleikamp while (n) { 284ac27a0ecSDave Kleikamp /* Do the node's children first */ 28569baee06SShen Feng if (n->rb_left) { 286ac27a0ecSDave Kleikamp n = n->rb_left; 287ac27a0ecSDave Kleikamp continue; 288ac27a0ecSDave Kleikamp } 289ac27a0ecSDave Kleikamp if (n->rb_right) { 290ac27a0ecSDave Kleikamp n = n->rb_right; 291ac27a0ecSDave Kleikamp continue; 292ac27a0ecSDave Kleikamp } 293ac27a0ecSDave Kleikamp /* 294ac27a0ecSDave Kleikamp * The node has no children; free it, and then zero 295ac27a0ecSDave Kleikamp * out parent's link to it. Finally go to the 296ac27a0ecSDave Kleikamp * beginning of the loop and try to free the parent 297ac27a0ecSDave Kleikamp * node. 298ac27a0ecSDave Kleikamp */ 299ac27a0ecSDave Kleikamp parent = rb_parent(n); 300ac27a0ecSDave Kleikamp fname = rb_entry(n, struct fname, rb_hash); 301ac27a0ecSDave Kleikamp while (fname) { 302ac27a0ecSDave Kleikamp struct fname *old = fname; 303ac27a0ecSDave Kleikamp fname = fname->next; 304ac27a0ecSDave Kleikamp kfree(old); 305ac27a0ecSDave Kleikamp } 306ac27a0ecSDave Kleikamp if (!parent) 30764e290ecSVenkatesh Pallipadi *root = RB_ROOT; 308ac27a0ecSDave Kleikamp else if (parent->rb_left == n) 309ac27a0ecSDave Kleikamp parent->rb_left = NULL; 310ac27a0ecSDave Kleikamp else if (parent->rb_right == n) 311ac27a0ecSDave Kleikamp parent->rb_right = NULL; 312ac27a0ecSDave Kleikamp n = parent; 313ac27a0ecSDave Kleikamp } 314ac27a0ecSDave Kleikamp } 315ac27a0ecSDave Kleikamp 316ac27a0ecSDave Kleikamp 31769baee06SShen Feng static struct dir_private_info *ext4_htree_create_dir_info(loff_t pos) 318ac27a0ecSDave Kleikamp { 319ac27a0ecSDave Kleikamp struct dir_private_info *p; 320ac27a0ecSDave Kleikamp 32169baee06SShen Feng p = kzalloc(sizeof(struct dir_private_info), GFP_KERNEL); 322ac27a0ecSDave Kleikamp if (!p) 323ac27a0ecSDave Kleikamp return NULL; 324ac27a0ecSDave Kleikamp p->curr_hash = pos2maj_hash(pos); 325ac27a0ecSDave Kleikamp p->curr_minor_hash = pos2min_hash(pos); 326ac27a0ecSDave Kleikamp return p; 327ac27a0ecSDave Kleikamp } 328ac27a0ecSDave Kleikamp 329617ba13bSMingming Cao void ext4_htree_free_dir_info(struct dir_private_info *p) 330ac27a0ecSDave Kleikamp { 331ac27a0ecSDave Kleikamp free_rb_tree_fname(&p->root); 332ac27a0ecSDave Kleikamp kfree(p); 333ac27a0ecSDave Kleikamp } 334ac27a0ecSDave Kleikamp 335ac27a0ecSDave Kleikamp /* 336ac27a0ecSDave Kleikamp * Given a directory entry, enter it into the fname rb tree. 337ac27a0ecSDave Kleikamp */ 338617ba13bSMingming Cao int ext4_htree_store_dirent(struct file *dir_file, __u32 hash, 339ac27a0ecSDave Kleikamp __u32 minor_hash, 340617ba13bSMingming Cao struct ext4_dir_entry_2 *dirent) 341ac27a0ecSDave Kleikamp { 342ac27a0ecSDave Kleikamp struct rb_node **p, *parent = NULL; 343ac27a0ecSDave Kleikamp struct fname *fname, *new_fn; 344ac27a0ecSDave Kleikamp struct dir_private_info *info; 345ac27a0ecSDave Kleikamp int len; 346ac27a0ecSDave Kleikamp 347a271fe85SJoe Perches info = dir_file->private_data; 348ac27a0ecSDave Kleikamp p = &info->root.rb_node; 349ac27a0ecSDave Kleikamp 350ac27a0ecSDave Kleikamp /* Create and allocate the fname structure */ 351ac27a0ecSDave Kleikamp len = sizeof(struct fname) + dirent->name_len + 1; 352ac27a0ecSDave Kleikamp new_fn = kzalloc(len, GFP_KERNEL); 353ac27a0ecSDave Kleikamp if (!new_fn) 354ac27a0ecSDave Kleikamp return -ENOMEM; 355ac27a0ecSDave Kleikamp new_fn->hash = hash; 356ac27a0ecSDave Kleikamp new_fn->minor_hash = minor_hash; 357ac27a0ecSDave Kleikamp new_fn->inode = le32_to_cpu(dirent->inode); 358ac27a0ecSDave Kleikamp new_fn->name_len = dirent->name_len; 359ac27a0ecSDave Kleikamp new_fn->file_type = dirent->file_type; 360ac27a0ecSDave Kleikamp memcpy(new_fn->name, dirent->name, dirent->name_len); 361ac27a0ecSDave Kleikamp new_fn->name[dirent->name_len] = 0; 362ac27a0ecSDave Kleikamp 363ac27a0ecSDave Kleikamp while (*p) { 364ac27a0ecSDave Kleikamp parent = *p; 365ac27a0ecSDave Kleikamp fname = rb_entry(parent, struct fname, rb_hash); 366ac27a0ecSDave Kleikamp 367ac27a0ecSDave Kleikamp /* 368ac27a0ecSDave Kleikamp * If the hash and minor hash match up, then we put 369ac27a0ecSDave Kleikamp * them on a linked list. This rarely happens... 370ac27a0ecSDave Kleikamp */ 371ac27a0ecSDave Kleikamp if ((new_fn->hash == fname->hash) && 372ac27a0ecSDave Kleikamp (new_fn->minor_hash == fname->minor_hash)) { 373ac27a0ecSDave Kleikamp new_fn->next = fname->next; 374ac27a0ecSDave Kleikamp fname->next = new_fn; 375ac27a0ecSDave Kleikamp return 0; 376ac27a0ecSDave Kleikamp } 377ac27a0ecSDave Kleikamp 378ac27a0ecSDave Kleikamp if (new_fn->hash < fname->hash) 379ac27a0ecSDave Kleikamp p = &(*p)->rb_left; 380ac27a0ecSDave Kleikamp else if (new_fn->hash > fname->hash) 381ac27a0ecSDave Kleikamp p = &(*p)->rb_right; 382ac27a0ecSDave Kleikamp else if (new_fn->minor_hash < fname->minor_hash) 383ac27a0ecSDave Kleikamp p = &(*p)->rb_left; 384ac27a0ecSDave Kleikamp else /* if (new_fn->minor_hash > fname->minor_hash) */ 385ac27a0ecSDave Kleikamp p = &(*p)->rb_right; 386ac27a0ecSDave Kleikamp } 387ac27a0ecSDave Kleikamp 388ac27a0ecSDave Kleikamp rb_link_node(&new_fn->rb_hash, parent, p); 389ac27a0ecSDave Kleikamp rb_insert_color(&new_fn->rb_hash, &info->root); 390ac27a0ecSDave Kleikamp return 0; 391ac27a0ecSDave Kleikamp } 392ac27a0ecSDave Kleikamp 393ac27a0ecSDave Kleikamp 394ac27a0ecSDave Kleikamp 395ac27a0ecSDave Kleikamp /* 396617ba13bSMingming Cao * This is a helper function for ext4_dx_readdir. It calls filldir 397ac27a0ecSDave Kleikamp * for all entres on the fname linked list. (Normally there is only 398ac27a0ecSDave Kleikamp * one entry on the linked list, unless there are 62 bit hash collisions.) 399ac27a0ecSDave Kleikamp */ 400ac27a0ecSDave Kleikamp static int call_filldir(struct file *filp, void *dirent, 401ac27a0ecSDave Kleikamp filldir_t filldir, struct fname *fname) 402ac27a0ecSDave Kleikamp { 403ac27a0ecSDave Kleikamp struct dir_private_info *info = filp->private_data; 404ac27a0ecSDave Kleikamp loff_t curr_pos; 4059d549890SJosef "Jeff" Sipek struct inode *inode = filp->f_path.dentry->d_inode; 406ac27a0ecSDave Kleikamp struct super_block *sb; 407ac27a0ecSDave Kleikamp int error; 408ac27a0ecSDave Kleikamp 409ac27a0ecSDave Kleikamp sb = inode->i_sb; 410ac27a0ecSDave Kleikamp 411ac27a0ecSDave Kleikamp if (!fname) { 412abda1418STheodore Ts'o printk(KERN_ERR "EXT4-fs: call_filldir: called with " 4134776004fSTheodore Ts'o "null fname?!?\n"); 414ac27a0ecSDave Kleikamp return 0; 415ac27a0ecSDave Kleikamp } 416ac27a0ecSDave Kleikamp curr_pos = hash2pos(fname->hash, fname->minor_hash); 417ac27a0ecSDave Kleikamp while (fname) { 418ac27a0ecSDave Kleikamp error = filldir(dirent, fname->name, 419ac27a0ecSDave Kleikamp fname->name_len, curr_pos, 420ac27a0ecSDave Kleikamp fname->inode, 421ac27a0ecSDave Kleikamp get_dtype(sb, fname->file_type)); 422ac27a0ecSDave Kleikamp if (error) { 423ac27a0ecSDave Kleikamp filp->f_pos = curr_pos; 424d0156417STheodore Ts'o info->extra_fname = fname; 425ac27a0ecSDave Kleikamp return error; 426ac27a0ecSDave Kleikamp } 427ac27a0ecSDave Kleikamp fname = fname->next; 428ac27a0ecSDave Kleikamp } 429ac27a0ecSDave Kleikamp return 0; 430ac27a0ecSDave Kleikamp } 431ac27a0ecSDave Kleikamp 432617ba13bSMingming Cao static int ext4_dx_readdir(struct file *filp, 433ac27a0ecSDave Kleikamp void *dirent, filldir_t filldir) 434ac27a0ecSDave Kleikamp { 435ac27a0ecSDave Kleikamp struct dir_private_info *info = filp->private_data; 4369d549890SJosef "Jeff" Sipek struct inode *inode = filp->f_path.dentry->d_inode; 437ac27a0ecSDave Kleikamp struct fname *fname; 438ac27a0ecSDave Kleikamp int ret; 439ac27a0ecSDave Kleikamp 440ac27a0ecSDave Kleikamp if (!info) { 44169baee06SShen Feng info = ext4_htree_create_dir_info(filp->f_pos); 442ac27a0ecSDave Kleikamp if (!info) 443ac27a0ecSDave Kleikamp return -ENOMEM; 444ac27a0ecSDave Kleikamp filp->private_data = info; 445ac27a0ecSDave Kleikamp } 446ac27a0ecSDave Kleikamp 447617ba13bSMingming Cao if (filp->f_pos == EXT4_HTREE_EOF) 448ac27a0ecSDave Kleikamp return 0; /* EOF */ 449ac27a0ecSDave Kleikamp 450ac27a0ecSDave Kleikamp /* Some one has messed with f_pos; reset the world */ 451ac27a0ecSDave Kleikamp if (info->last_pos != filp->f_pos) { 452ac27a0ecSDave Kleikamp free_rb_tree_fname(&info->root); 453ac27a0ecSDave Kleikamp info->curr_node = NULL; 454ac27a0ecSDave Kleikamp info->extra_fname = NULL; 455ac27a0ecSDave Kleikamp info->curr_hash = pos2maj_hash(filp->f_pos); 456ac27a0ecSDave Kleikamp info->curr_minor_hash = pos2min_hash(filp->f_pos); 457ac27a0ecSDave Kleikamp } 458ac27a0ecSDave Kleikamp 459ac27a0ecSDave Kleikamp /* 460ac27a0ecSDave Kleikamp * If there are any leftover names on the hash collision 461ac27a0ecSDave Kleikamp * chain, return them first. 462ac27a0ecSDave Kleikamp */ 463d0156417STheodore Ts'o if (info->extra_fname) { 464d0156417STheodore Ts'o if (call_filldir(filp, dirent, filldir, info->extra_fname)) 465ac27a0ecSDave Kleikamp goto finished; 466d0156417STheodore Ts'o info->extra_fname = NULL; 4673c37fc86STheodore Ts'o goto next_node; 468d0156417STheodore Ts'o } else if (!info->curr_node) 469ac27a0ecSDave Kleikamp info->curr_node = rb_first(&info->root); 470ac27a0ecSDave Kleikamp 471ac27a0ecSDave Kleikamp while (1) { 472ac27a0ecSDave Kleikamp /* 473ac27a0ecSDave Kleikamp * Fill the rbtree if we have no more entries, 474ac27a0ecSDave Kleikamp * or the inode has changed since we last read in the 475ac27a0ecSDave Kleikamp * cached entries. 476ac27a0ecSDave Kleikamp */ 477ac27a0ecSDave Kleikamp if ((!info->curr_node) || 478ac27a0ecSDave Kleikamp (filp->f_version != inode->i_version)) { 479ac27a0ecSDave Kleikamp info->curr_node = NULL; 480ac27a0ecSDave Kleikamp free_rb_tree_fname(&info->root); 481ac27a0ecSDave Kleikamp filp->f_version = inode->i_version; 482617ba13bSMingming Cao ret = ext4_htree_fill_tree(filp, info->curr_hash, 483ac27a0ecSDave Kleikamp info->curr_minor_hash, 484ac27a0ecSDave Kleikamp &info->next_hash); 485ac27a0ecSDave Kleikamp if (ret < 0) 486ac27a0ecSDave Kleikamp return ret; 487ac27a0ecSDave Kleikamp if (ret == 0) { 488617ba13bSMingming Cao filp->f_pos = EXT4_HTREE_EOF; 489ac27a0ecSDave Kleikamp break; 490ac27a0ecSDave Kleikamp } 491ac27a0ecSDave Kleikamp info->curr_node = rb_first(&info->root); 492ac27a0ecSDave Kleikamp } 493ac27a0ecSDave Kleikamp 494ac27a0ecSDave Kleikamp fname = rb_entry(info->curr_node, struct fname, rb_hash); 495ac27a0ecSDave Kleikamp info->curr_hash = fname->hash; 496ac27a0ecSDave Kleikamp info->curr_minor_hash = fname->minor_hash; 497ac27a0ecSDave Kleikamp if (call_filldir(filp, dirent, filldir, fname)) 498ac27a0ecSDave Kleikamp break; 4993c37fc86STheodore Ts'o next_node: 500ac27a0ecSDave Kleikamp info->curr_node = rb_next(info->curr_node); 5013c37fc86STheodore Ts'o if (info->curr_node) { 5023c37fc86STheodore Ts'o fname = rb_entry(info->curr_node, struct fname, 5033c37fc86STheodore Ts'o rb_hash); 5043c37fc86STheodore Ts'o info->curr_hash = fname->hash; 5053c37fc86STheodore Ts'o info->curr_minor_hash = fname->minor_hash; 5063c37fc86STheodore Ts'o } else { 507ac27a0ecSDave Kleikamp if (info->next_hash == ~0) { 508617ba13bSMingming Cao filp->f_pos = EXT4_HTREE_EOF; 509ac27a0ecSDave Kleikamp break; 510ac27a0ecSDave Kleikamp } 511ac27a0ecSDave Kleikamp info->curr_hash = info->next_hash; 512ac27a0ecSDave Kleikamp info->curr_minor_hash = 0; 513ac27a0ecSDave Kleikamp } 514ac27a0ecSDave Kleikamp } 515ac27a0ecSDave Kleikamp finished: 516ac27a0ecSDave Kleikamp info->last_pos = filp->f_pos; 517ac27a0ecSDave Kleikamp return 0; 518ac27a0ecSDave Kleikamp } 519ac27a0ecSDave Kleikamp 520617ba13bSMingming Cao static int ext4_release_dir(struct inode *inode, struct file *filp) 521ac27a0ecSDave Kleikamp { 522ac27a0ecSDave Kleikamp if (filp->private_data) 523617ba13bSMingming Cao ext4_htree_free_dir_info(filp->private_data); 524ac27a0ecSDave Kleikamp 525ac27a0ecSDave Kleikamp return 0; 526ac27a0ecSDave Kleikamp } 527