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 64617ba13bSMingming Cao int ext4_check_dir_entry (const char * function, struct inode * dir, 65617ba13bSMingming Cao struct ext4_dir_entry_2 * de, 66ac27a0ecSDave Kleikamp struct buffer_head * bh, 67ac27a0ecSDave Kleikamp unsigned long offset) 68ac27a0ecSDave Kleikamp { 69ac27a0ecSDave Kleikamp const char * error_msg = NULL; 70a72d7f83SJan Kara const int rlen = ext4_rec_len_from_disk(de->rec_len); 71ac27a0ecSDave Kleikamp 72617ba13bSMingming Cao if (rlen < EXT4_DIR_REC_LEN(1)) 73ac27a0ecSDave Kleikamp error_msg = "rec_len is smaller than minimal"; 74ac27a0ecSDave Kleikamp else if (rlen % 4 != 0) 75ac27a0ecSDave Kleikamp error_msg = "rec_len % 4 != 0"; 76617ba13bSMingming Cao else if (rlen < EXT4_DIR_REC_LEN(de->name_len)) 77ac27a0ecSDave Kleikamp error_msg = "rec_len is too small for name_len"; 78ac27a0ecSDave Kleikamp else if (((char *) de - bh->b_data) + rlen > dir->i_sb->s_blocksize) 79ac27a0ecSDave Kleikamp error_msg = "directory entry across blocks"; 80ac27a0ecSDave Kleikamp else if (le32_to_cpu(de->inode) > 81617ba13bSMingming Cao le32_to_cpu(EXT4_SB(dir->i_sb)->s_es->s_inodes_count)) 82ac27a0ecSDave Kleikamp error_msg = "inode out of bounds"; 83ac27a0ecSDave Kleikamp 84ac27a0ecSDave Kleikamp if (error_msg != NULL) 85617ba13bSMingming Cao ext4_error (dir->i_sb, function, 86ac27a0ecSDave Kleikamp "bad entry in directory #%lu: %s - " 87ac27a0ecSDave Kleikamp "offset=%lu, inode=%lu, rec_len=%d, name_len=%d", 88ac27a0ecSDave Kleikamp dir->i_ino, error_msg, offset, 89ac27a0ecSDave Kleikamp (unsigned long) le32_to_cpu(de->inode), 90ac27a0ecSDave Kleikamp rlen, de->name_len); 91ac27a0ecSDave Kleikamp return error_msg == NULL ? 1 : 0; 92ac27a0ecSDave Kleikamp } 93ac27a0ecSDave Kleikamp 94617ba13bSMingming Cao static int ext4_readdir(struct file * filp, 95ac27a0ecSDave Kleikamp void * dirent, filldir_t filldir) 96ac27a0ecSDave Kleikamp { 97ac27a0ecSDave Kleikamp int error = 0; 98ac27a0ecSDave Kleikamp unsigned long offset; 99ac27a0ecSDave Kleikamp int i, stored; 100617ba13bSMingming Cao struct ext4_dir_entry_2 *de; 101ac27a0ecSDave Kleikamp struct super_block *sb; 102ac27a0ecSDave Kleikamp int err; 1039d549890SJosef "Jeff" Sipek struct inode *inode = filp->f_path.dentry->d_inode; 104ac27a0ecSDave Kleikamp int ret = 0; 105ac27a0ecSDave Kleikamp 106ac27a0ecSDave Kleikamp sb = inode->i_sb; 107ac27a0ecSDave Kleikamp 108617ba13bSMingming Cao if (EXT4_HAS_COMPAT_FEATURE(inode->i_sb, 109617ba13bSMingming Cao EXT4_FEATURE_COMPAT_DIR_INDEX) && 110617ba13bSMingming Cao ((EXT4_I(inode)->i_flags & EXT4_INDEX_FL) || 111ac27a0ecSDave Kleikamp ((inode->i_size >> sb->s_blocksize_bits) == 1))) { 112617ba13bSMingming Cao err = ext4_dx_readdir(filp, dirent, filldir); 113ac27a0ecSDave Kleikamp if (err != ERR_BAD_DX_DIR) { 114ac27a0ecSDave Kleikamp ret = err; 115ac27a0ecSDave Kleikamp goto out; 116ac27a0ecSDave Kleikamp } 117ac27a0ecSDave Kleikamp /* 118ac27a0ecSDave Kleikamp * We don't set the inode dirty flag since it's not 119ac27a0ecSDave Kleikamp * critical that it get flushed back to the disk. 120ac27a0ecSDave Kleikamp */ 1219d549890SJosef "Jeff" Sipek EXT4_I(filp->f_path.dentry->d_inode)->i_flags &= ~EXT4_INDEX_FL; 122ac27a0ecSDave Kleikamp } 123ac27a0ecSDave Kleikamp stored = 0; 124ac27a0ecSDave Kleikamp offset = filp->f_pos & (sb->s_blocksize - 1); 125ac27a0ecSDave Kleikamp 126ac27a0ecSDave Kleikamp while (!error && !stored && filp->f_pos < inode->i_size) { 127725d26d3SAneesh Kumar K.V ext4_lblk_t blk = filp->f_pos >> EXT4_BLOCK_SIZE_BITS(sb); 128ac27a0ecSDave Kleikamp struct buffer_head map_bh; 129ac27a0ecSDave Kleikamp struct buffer_head *bh = NULL; 130ac27a0ecSDave Kleikamp 131ac27a0ecSDave Kleikamp map_bh.b_state = 0; 132a86c6181SAlex Tomas err = ext4_get_blocks_wrap(NULL, inode, blk, 1, &map_bh, 0, 0); 133ac27a0ecSDave Kleikamp if (err > 0) { 134dc7868fcSFengguang Wu pgoff_t index = map_bh.b_blocknr >> 135dc7868fcSFengguang Wu (PAGE_CACHE_SHIFT - inode->i_blkbits); 136dc7868fcSFengguang Wu if (!ra_has_index(&filp->f_ra, index)) 137cf914a7dSRusty Russell page_cache_sync_readahead( 138dc7868fcSFengguang Wu sb->s_bdev->bd_inode->i_mapping, 139dc7868fcSFengguang Wu &filp->f_ra, filp, 140cf914a7dSRusty Russell index, 1); 141f4e6b498SFengguang Wu filp->f_ra.prev_pos = (loff_t)index << PAGE_CACHE_SHIFT; 142617ba13bSMingming Cao bh = ext4_bread(NULL, inode, blk, 0, &err); 143ac27a0ecSDave Kleikamp } 144ac27a0ecSDave Kleikamp 145ac27a0ecSDave Kleikamp /* 146ac27a0ecSDave Kleikamp * We ignore I/O errors on directories so users have a chance 147ac27a0ecSDave Kleikamp * of recovering data when there's a bad sector 148ac27a0ecSDave Kleikamp */ 149ac27a0ecSDave Kleikamp if (!bh) { 150617ba13bSMingming Cao ext4_error (sb, "ext4_readdir", 151ac27a0ecSDave Kleikamp "directory #%lu contains a hole at offset %lu", 152ac27a0ecSDave Kleikamp inode->i_ino, (unsigned long)filp->f_pos); 153e6c40211SEric Sandeen /* corrupt size? Maybe no more blocks to read */ 154e6c40211SEric Sandeen if (filp->f_pos > inode->i_blocks << 9) 155e6c40211SEric Sandeen break; 156ac27a0ecSDave Kleikamp filp->f_pos += sb->s_blocksize - offset; 157ac27a0ecSDave Kleikamp continue; 158ac27a0ecSDave Kleikamp } 159ac27a0ecSDave Kleikamp 160ac27a0ecSDave Kleikamp revalidate: 161ac27a0ecSDave Kleikamp /* If the dir block has changed since the last call to 162ac27a0ecSDave Kleikamp * readdir(2), then we might be pointing to an invalid 163ac27a0ecSDave Kleikamp * dirent right now. Scan from the start of the block 164ac27a0ecSDave Kleikamp * to make sure. */ 165ac27a0ecSDave Kleikamp if (filp->f_version != inode->i_version) { 166ac27a0ecSDave Kleikamp for (i = 0; i < sb->s_blocksize && i < offset; ) { 167617ba13bSMingming Cao de = (struct ext4_dir_entry_2 *) 168ac27a0ecSDave Kleikamp (bh->b_data + i); 169ac27a0ecSDave Kleikamp /* It's too expensive to do a full 170ac27a0ecSDave Kleikamp * dirent test each time round this 171ac27a0ecSDave Kleikamp * loop, but we do have to test at 172ac27a0ecSDave Kleikamp * least that it is non-zero. A 173ac27a0ecSDave Kleikamp * failure will be detected in the 174ac27a0ecSDave Kleikamp * dirent test below. */ 175a72d7f83SJan Kara if (ext4_rec_len_from_disk(de->rec_len) 176a72d7f83SJan Kara < EXT4_DIR_REC_LEN(1)) 177ac27a0ecSDave Kleikamp break; 178a72d7f83SJan Kara i += ext4_rec_len_from_disk(de->rec_len); 179ac27a0ecSDave Kleikamp } 180ac27a0ecSDave Kleikamp offset = i; 181ac27a0ecSDave Kleikamp filp->f_pos = (filp->f_pos & ~(sb->s_blocksize - 1)) 182ac27a0ecSDave Kleikamp | offset; 183ac27a0ecSDave Kleikamp filp->f_version = inode->i_version; 184ac27a0ecSDave Kleikamp } 185ac27a0ecSDave Kleikamp 186ac27a0ecSDave Kleikamp while (!error && filp->f_pos < inode->i_size 187ac27a0ecSDave Kleikamp && offset < sb->s_blocksize) { 188617ba13bSMingming Cao de = (struct ext4_dir_entry_2 *) (bh->b_data + offset); 189617ba13bSMingming Cao if (!ext4_check_dir_entry ("ext4_readdir", inode, de, 190ac27a0ecSDave Kleikamp bh, offset)) { 19163f57933SAndrew Morton /* 19263f57933SAndrew Morton * On error, skip the f_pos to the next block 19363f57933SAndrew Morton */ 194ac27a0ecSDave Kleikamp filp->f_pos = (filp->f_pos | 195ac27a0ecSDave Kleikamp (sb->s_blocksize - 1)) + 1; 196ac27a0ecSDave Kleikamp brelse (bh); 197ac27a0ecSDave Kleikamp ret = stored; 198ac27a0ecSDave Kleikamp goto out; 199ac27a0ecSDave Kleikamp } 200a72d7f83SJan Kara offset += ext4_rec_len_from_disk(de->rec_len); 201ac27a0ecSDave Kleikamp if (le32_to_cpu(de->inode)) { 202ac27a0ecSDave Kleikamp /* We might block in the next section 203ac27a0ecSDave Kleikamp * if the data destination is 204ac27a0ecSDave Kleikamp * currently swapped out. So, use a 205ac27a0ecSDave Kleikamp * version stamp to detect whether or 206ac27a0ecSDave Kleikamp * not the directory has been modified 207ac27a0ecSDave Kleikamp * during the copy operation. 208ac27a0ecSDave Kleikamp */ 2092b47c361SMathieu Desnoyers u64 version = filp->f_version; 210ac27a0ecSDave Kleikamp 211ac27a0ecSDave Kleikamp error = filldir(dirent, de->name, 212ac27a0ecSDave Kleikamp de->name_len, 213ac27a0ecSDave Kleikamp filp->f_pos, 214ac27a0ecSDave Kleikamp le32_to_cpu(de->inode), 215ac27a0ecSDave Kleikamp get_dtype(sb, de->file_type)); 216ac27a0ecSDave Kleikamp if (error) 217ac27a0ecSDave Kleikamp break; 218ac27a0ecSDave Kleikamp if (version != filp->f_version) 219ac27a0ecSDave Kleikamp goto revalidate; 220ac27a0ecSDave Kleikamp stored ++; 221ac27a0ecSDave Kleikamp } 222a72d7f83SJan Kara filp->f_pos += ext4_rec_len_from_disk(de->rec_len); 223ac27a0ecSDave Kleikamp } 224ac27a0ecSDave Kleikamp offset = 0; 225ac27a0ecSDave Kleikamp brelse (bh); 226ac27a0ecSDave Kleikamp } 227ac27a0ecSDave Kleikamp out: 228ac27a0ecSDave Kleikamp return ret; 229ac27a0ecSDave Kleikamp } 230ac27a0ecSDave Kleikamp 231ac27a0ecSDave Kleikamp /* 232ac27a0ecSDave Kleikamp * These functions convert from the major/minor hash to an f_pos 233ac27a0ecSDave Kleikamp * value. 234ac27a0ecSDave Kleikamp * 235ac27a0ecSDave Kleikamp * Currently we only use major hash numer. This is unfortunate, but 236ac27a0ecSDave Kleikamp * on 32-bit machines, the same VFS interface is used for lseek and 237ac27a0ecSDave Kleikamp * llseek, so if we use the 64 bit offset, then the 32-bit versions of 238ac27a0ecSDave Kleikamp * lseek/telldir/seekdir will blow out spectacularly, and from within 239ac27a0ecSDave Kleikamp * the ext2 low-level routine, we don't know if we're being called by 240ac27a0ecSDave Kleikamp * a 64-bit version of the system call or the 32-bit version of the 241ac27a0ecSDave Kleikamp * system call. Worse yet, NFSv2 only allows for a 32-bit readdir 242ac27a0ecSDave Kleikamp * cookie. Sigh. 243ac27a0ecSDave Kleikamp */ 244ac27a0ecSDave Kleikamp #define hash2pos(major, minor) (major >> 1) 245ac27a0ecSDave Kleikamp #define pos2maj_hash(pos) ((pos << 1) & 0xffffffff) 246ac27a0ecSDave Kleikamp #define pos2min_hash(pos) (0) 247ac27a0ecSDave Kleikamp 248ac27a0ecSDave Kleikamp /* 249ac27a0ecSDave Kleikamp * This structure holds the nodes of the red-black tree used to store 250ac27a0ecSDave Kleikamp * the directory entry in hash order. 251ac27a0ecSDave Kleikamp */ 252ac27a0ecSDave Kleikamp struct fname { 253ac27a0ecSDave Kleikamp __u32 hash; 254ac27a0ecSDave Kleikamp __u32 minor_hash; 255ac27a0ecSDave Kleikamp struct rb_node rb_hash; 256ac27a0ecSDave Kleikamp struct fname *next; 257ac27a0ecSDave Kleikamp __u32 inode; 258ac27a0ecSDave Kleikamp __u8 name_len; 259ac27a0ecSDave Kleikamp __u8 file_type; 260ac27a0ecSDave Kleikamp char name[0]; 261ac27a0ecSDave Kleikamp }; 262ac27a0ecSDave Kleikamp 263ac27a0ecSDave Kleikamp /* 264ac27a0ecSDave Kleikamp * This functoin implements a non-recursive way of freeing all of the 265ac27a0ecSDave Kleikamp * nodes in the red-black tree. 266ac27a0ecSDave Kleikamp */ 267ac27a0ecSDave Kleikamp static void free_rb_tree_fname(struct rb_root *root) 268ac27a0ecSDave Kleikamp { 269ac27a0ecSDave Kleikamp struct rb_node *n = root->rb_node; 270ac27a0ecSDave Kleikamp struct rb_node *parent; 271ac27a0ecSDave Kleikamp struct fname *fname; 272ac27a0ecSDave Kleikamp 273ac27a0ecSDave Kleikamp while (n) { 274ac27a0ecSDave Kleikamp /* Do the node's children first */ 275ac27a0ecSDave Kleikamp if ((n)->rb_left) { 276ac27a0ecSDave Kleikamp n = n->rb_left; 277ac27a0ecSDave Kleikamp continue; 278ac27a0ecSDave Kleikamp } 279ac27a0ecSDave Kleikamp if (n->rb_right) { 280ac27a0ecSDave Kleikamp n = n->rb_right; 281ac27a0ecSDave Kleikamp continue; 282ac27a0ecSDave Kleikamp } 283ac27a0ecSDave Kleikamp /* 284ac27a0ecSDave Kleikamp * The node has no children; free it, and then zero 285ac27a0ecSDave Kleikamp * out parent's link to it. Finally go to the 286ac27a0ecSDave Kleikamp * beginning of the loop and try to free the parent 287ac27a0ecSDave Kleikamp * node. 288ac27a0ecSDave Kleikamp */ 289ac27a0ecSDave Kleikamp parent = rb_parent(n); 290ac27a0ecSDave Kleikamp fname = rb_entry(n, struct fname, rb_hash); 291ac27a0ecSDave Kleikamp while (fname) { 292ac27a0ecSDave Kleikamp struct fname * old = fname; 293ac27a0ecSDave Kleikamp fname = fname->next; 294ac27a0ecSDave Kleikamp kfree (old); 295ac27a0ecSDave Kleikamp } 296ac27a0ecSDave Kleikamp if (!parent) 297ac27a0ecSDave Kleikamp root->rb_node = NULL; 298ac27a0ecSDave Kleikamp else if (parent->rb_left == n) 299ac27a0ecSDave Kleikamp parent->rb_left = NULL; 300ac27a0ecSDave Kleikamp else if (parent->rb_right == n) 301ac27a0ecSDave Kleikamp parent->rb_right = NULL; 302ac27a0ecSDave Kleikamp n = parent; 303ac27a0ecSDave Kleikamp } 304ac27a0ecSDave Kleikamp root->rb_node = NULL; 305ac27a0ecSDave Kleikamp } 306ac27a0ecSDave Kleikamp 307ac27a0ecSDave Kleikamp 308ac27a0ecSDave Kleikamp static struct dir_private_info *create_dir_info(loff_t pos) 309ac27a0ecSDave Kleikamp { 310ac27a0ecSDave Kleikamp struct dir_private_info *p; 311ac27a0ecSDave Kleikamp 312ac27a0ecSDave Kleikamp p = kmalloc(sizeof(struct dir_private_info), GFP_KERNEL); 313ac27a0ecSDave Kleikamp if (!p) 314ac27a0ecSDave Kleikamp return NULL; 315ac27a0ecSDave Kleikamp p->root.rb_node = NULL; 316ac27a0ecSDave Kleikamp p->curr_node = NULL; 317ac27a0ecSDave Kleikamp p->extra_fname = NULL; 318ac27a0ecSDave Kleikamp p->last_pos = 0; 319ac27a0ecSDave Kleikamp p->curr_hash = pos2maj_hash(pos); 320ac27a0ecSDave Kleikamp p->curr_minor_hash = pos2min_hash(pos); 321ac27a0ecSDave Kleikamp p->next_hash = 0; 322ac27a0ecSDave Kleikamp return p; 323ac27a0ecSDave Kleikamp } 324ac27a0ecSDave Kleikamp 325617ba13bSMingming Cao void ext4_htree_free_dir_info(struct dir_private_info *p) 326ac27a0ecSDave Kleikamp { 327ac27a0ecSDave Kleikamp free_rb_tree_fname(&p->root); 328ac27a0ecSDave Kleikamp kfree(p); 329ac27a0ecSDave Kleikamp } 330ac27a0ecSDave Kleikamp 331ac27a0ecSDave Kleikamp /* 332ac27a0ecSDave Kleikamp * Given a directory entry, enter it into the fname rb tree. 333ac27a0ecSDave Kleikamp */ 334617ba13bSMingming Cao int ext4_htree_store_dirent(struct file *dir_file, __u32 hash, 335ac27a0ecSDave Kleikamp __u32 minor_hash, 336617ba13bSMingming Cao struct ext4_dir_entry_2 *dirent) 337ac27a0ecSDave Kleikamp { 338ac27a0ecSDave Kleikamp struct rb_node **p, *parent = NULL; 339ac27a0ecSDave Kleikamp struct fname * fname, *new_fn; 340ac27a0ecSDave Kleikamp struct dir_private_info *info; 341ac27a0ecSDave Kleikamp int len; 342ac27a0ecSDave Kleikamp 343ac27a0ecSDave Kleikamp info = (struct dir_private_info *) dir_file->private_data; 344ac27a0ecSDave Kleikamp p = &info->root.rb_node; 345ac27a0ecSDave Kleikamp 346ac27a0ecSDave Kleikamp /* Create and allocate the fname structure */ 347ac27a0ecSDave Kleikamp len = sizeof(struct fname) + dirent->name_len + 1; 348ac27a0ecSDave Kleikamp new_fn = kzalloc(len, GFP_KERNEL); 349ac27a0ecSDave Kleikamp if (!new_fn) 350ac27a0ecSDave Kleikamp return -ENOMEM; 351ac27a0ecSDave Kleikamp new_fn->hash = hash; 352ac27a0ecSDave Kleikamp new_fn->minor_hash = minor_hash; 353ac27a0ecSDave Kleikamp new_fn->inode = le32_to_cpu(dirent->inode); 354ac27a0ecSDave Kleikamp new_fn->name_len = dirent->name_len; 355ac27a0ecSDave Kleikamp new_fn->file_type = dirent->file_type; 356ac27a0ecSDave Kleikamp memcpy(new_fn->name, dirent->name, dirent->name_len); 357ac27a0ecSDave Kleikamp new_fn->name[dirent->name_len] = 0; 358ac27a0ecSDave Kleikamp 359ac27a0ecSDave Kleikamp while (*p) { 360ac27a0ecSDave Kleikamp parent = *p; 361ac27a0ecSDave Kleikamp fname = rb_entry(parent, struct fname, rb_hash); 362ac27a0ecSDave Kleikamp 363ac27a0ecSDave Kleikamp /* 364ac27a0ecSDave Kleikamp * If the hash and minor hash match up, then we put 365ac27a0ecSDave Kleikamp * them on a linked list. This rarely happens... 366ac27a0ecSDave Kleikamp */ 367ac27a0ecSDave Kleikamp if ((new_fn->hash == fname->hash) && 368ac27a0ecSDave Kleikamp (new_fn->minor_hash == fname->minor_hash)) { 369ac27a0ecSDave Kleikamp new_fn->next = fname->next; 370ac27a0ecSDave Kleikamp fname->next = new_fn; 371ac27a0ecSDave Kleikamp return 0; 372ac27a0ecSDave Kleikamp } 373ac27a0ecSDave Kleikamp 374ac27a0ecSDave Kleikamp if (new_fn->hash < fname->hash) 375ac27a0ecSDave Kleikamp p = &(*p)->rb_left; 376ac27a0ecSDave Kleikamp else if (new_fn->hash > fname->hash) 377ac27a0ecSDave Kleikamp p = &(*p)->rb_right; 378ac27a0ecSDave Kleikamp else if (new_fn->minor_hash < fname->minor_hash) 379ac27a0ecSDave Kleikamp p = &(*p)->rb_left; 380ac27a0ecSDave Kleikamp else /* if (new_fn->minor_hash > fname->minor_hash) */ 381ac27a0ecSDave Kleikamp p = &(*p)->rb_right; 382ac27a0ecSDave Kleikamp } 383ac27a0ecSDave Kleikamp 384ac27a0ecSDave Kleikamp rb_link_node(&new_fn->rb_hash, parent, p); 385ac27a0ecSDave Kleikamp rb_insert_color(&new_fn->rb_hash, &info->root); 386ac27a0ecSDave Kleikamp return 0; 387ac27a0ecSDave Kleikamp } 388ac27a0ecSDave Kleikamp 389ac27a0ecSDave Kleikamp 390ac27a0ecSDave Kleikamp 391ac27a0ecSDave Kleikamp /* 392617ba13bSMingming Cao * This is a helper function for ext4_dx_readdir. It calls filldir 393ac27a0ecSDave Kleikamp * for all entres on the fname linked list. (Normally there is only 394ac27a0ecSDave Kleikamp * one entry on the linked list, unless there are 62 bit hash collisions.) 395ac27a0ecSDave Kleikamp */ 396ac27a0ecSDave Kleikamp static int call_filldir(struct file * filp, void * dirent, 397ac27a0ecSDave Kleikamp filldir_t filldir, struct fname *fname) 398ac27a0ecSDave Kleikamp { 399ac27a0ecSDave Kleikamp struct dir_private_info *info = filp->private_data; 400ac27a0ecSDave Kleikamp loff_t curr_pos; 4019d549890SJosef "Jeff" Sipek struct inode *inode = filp->f_path.dentry->d_inode; 402ac27a0ecSDave Kleikamp struct super_block * sb; 403ac27a0ecSDave Kleikamp int error; 404ac27a0ecSDave Kleikamp 405ac27a0ecSDave Kleikamp sb = inode->i_sb; 406ac27a0ecSDave Kleikamp 407ac27a0ecSDave Kleikamp if (!fname) { 408ac27a0ecSDave Kleikamp printk("call_filldir: called with null fname?!?\n"); 409ac27a0ecSDave Kleikamp return 0; 410ac27a0ecSDave Kleikamp } 411ac27a0ecSDave Kleikamp curr_pos = hash2pos(fname->hash, fname->minor_hash); 412ac27a0ecSDave Kleikamp while (fname) { 413ac27a0ecSDave Kleikamp error = filldir(dirent, fname->name, 414ac27a0ecSDave Kleikamp fname->name_len, curr_pos, 415ac27a0ecSDave Kleikamp fname->inode, 416ac27a0ecSDave Kleikamp get_dtype(sb, fname->file_type)); 417ac27a0ecSDave Kleikamp if (error) { 418ac27a0ecSDave Kleikamp filp->f_pos = curr_pos; 419ac27a0ecSDave Kleikamp info->extra_fname = fname->next; 420ac27a0ecSDave Kleikamp return error; 421ac27a0ecSDave Kleikamp } 422ac27a0ecSDave Kleikamp fname = fname->next; 423ac27a0ecSDave Kleikamp } 424ac27a0ecSDave Kleikamp return 0; 425ac27a0ecSDave Kleikamp } 426ac27a0ecSDave Kleikamp 427617ba13bSMingming Cao static int ext4_dx_readdir(struct file * filp, 428ac27a0ecSDave Kleikamp void * dirent, filldir_t filldir) 429ac27a0ecSDave Kleikamp { 430ac27a0ecSDave Kleikamp struct dir_private_info *info = filp->private_data; 4319d549890SJosef "Jeff" Sipek struct inode *inode = filp->f_path.dentry->d_inode; 432ac27a0ecSDave Kleikamp struct fname *fname; 433ac27a0ecSDave Kleikamp int ret; 434ac27a0ecSDave Kleikamp 435ac27a0ecSDave Kleikamp if (!info) { 436ac27a0ecSDave Kleikamp info = create_dir_info(filp->f_pos); 437ac27a0ecSDave Kleikamp if (!info) 438ac27a0ecSDave Kleikamp return -ENOMEM; 439ac27a0ecSDave Kleikamp filp->private_data = info; 440ac27a0ecSDave Kleikamp } 441ac27a0ecSDave Kleikamp 442617ba13bSMingming Cao if (filp->f_pos == EXT4_HTREE_EOF) 443ac27a0ecSDave Kleikamp return 0; /* EOF */ 444ac27a0ecSDave Kleikamp 445ac27a0ecSDave Kleikamp /* Some one has messed with f_pos; reset the world */ 446ac27a0ecSDave Kleikamp if (info->last_pos != filp->f_pos) { 447ac27a0ecSDave Kleikamp free_rb_tree_fname(&info->root); 448ac27a0ecSDave Kleikamp info->curr_node = NULL; 449ac27a0ecSDave Kleikamp info->extra_fname = NULL; 450ac27a0ecSDave Kleikamp info->curr_hash = pos2maj_hash(filp->f_pos); 451ac27a0ecSDave Kleikamp info->curr_minor_hash = pos2min_hash(filp->f_pos); 452ac27a0ecSDave Kleikamp } 453ac27a0ecSDave Kleikamp 454ac27a0ecSDave Kleikamp /* 455ac27a0ecSDave Kleikamp * If there are any leftover names on the hash collision 456ac27a0ecSDave Kleikamp * chain, return them first. 457ac27a0ecSDave Kleikamp */ 458ac27a0ecSDave Kleikamp if (info->extra_fname && 459ac27a0ecSDave Kleikamp call_filldir(filp, dirent, filldir, info->extra_fname)) 460ac27a0ecSDave Kleikamp goto finished; 461ac27a0ecSDave Kleikamp 462ac27a0ecSDave Kleikamp if (!info->curr_node) 463ac27a0ecSDave Kleikamp info->curr_node = rb_first(&info->root); 464ac27a0ecSDave Kleikamp 465ac27a0ecSDave Kleikamp while (1) { 466ac27a0ecSDave Kleikamp /* 467ac27a0ecSDave Kleikamp * Fill the rbtree if we have no more entries, 468ac27a0ecSDave Kleikamp * or the inode has changed since we last read in the 469ac27a0ecSDave Kleikamp * cached entries. 470ac27a0ecSDave Kleikamp */ 471ac27a0ecSDave Kleikamp if ((!info->curr_node) || 472ac27a0ecSDave Kleikamp (filp->f_version != inode->i_version)) { 473ac27a0ecSDave Kleikamp info->curr_node = NULL; 474ac27a0ecSDave Kleikamp free_rb_tree_fname(&info->root); 475ac27a0ecSDave Kleikamp filp->f_version = inode->i_version; 476617ba13bSMingming Cao ret = ext4_htree_fill_tree(filp, info->curr_hash, 477ac27a0ecSDave Kleikamp info->curr_minor_hash, 478ac27a0ecSDave Kleikamp &info->next_hash); 479ac27a0ecSDave Kleikamp if (ret < 0) 480ac27a0ecSDave Kleikamp return ret; 481ac27a0ecSDave Kleikamp if (ret == 0) { 482617ba13bSMingming Cao filp->f_pos = EXT4_HTREE_EOF; 483ac27a0ecSDave Kleikamp break; 484ac27a0ecSDave Kleikamp } 485ac27a0ecSDave Kleikamp info->curr_node = rb_first(&info->root); 486ac27a0ecSDave Kleikamp } 487ac27a0ecSDave Kleikamp 488ac27a0ecSDave Kleikamp fname = rb_entry(info->curr_node, struct fname, rb_hash); 489ac27a0ecSDave Kleikamp info->curr_hash = fname->hash; 490ac27a0ecSDave Kleikamp info->curr_minor_hash = fname->minor_hash; 491ac27a0ecSDave Kleikamp if (call_filldir(filp, dirent, filldir, fname)) 492ac27a0ecSDave Kleikamp break; 493ac27a0ecSDave Kleikamp 494ac27a0ecSDave Kleikamp info->curr_node = rb_next(info->curr_node); 495ac27a0ecSDave Kleikamp if (!info->curr_node) { 496ac27a0ecSDave Kleikamp if (info->next_hash == ~0) { 497617ba13bSMingming Cao filp->f_pos = EXT4_HTREE_EOF; 498ac27a0ecSDave Kleikamp break; 499ac27a0ecSDave Kleikamp } 500ac27a0ecSDave Kleikamp info->curr_hash = info->next_hash; 501ac27a0ecSDave Kleikamp info->curr_minor_hash = 0; 502ac27a0ecSDave Kleikamp } 503ac27a0ecSDave Kleikamp } 504ac27a0ecSDave Kleikamp finished: 505ac27a0ecSDave Kleikamp info->last_pos = filp->f_pos; 506ac27a0ecSDave Kleikamp return 0; 507ac27a0ecSDave Kleikamp } 508ac27a0ecSDave Kleikamp 509617ba13bSMingming Cao static int ext4_release_dir (struct inode * inode, struct file * filp) 510ac27a0ecSDave Kleikamp { 511ac27a0ecSDave Kleikamp if (filp->private_data) 512617ba13bSMingming Cao ext4_htree_free_dir_info(filp->private_data); 513ac27a0ecSDave Kleikamp 514ac27a0ecSDave Kleikamp return 0; 515ac27a0ecSDave Kleikamp } 516