1*1e9ea7e0SNamjae Jeon // SPDX-License-Identifier: GPL-2.0-or-later 2*1e9ea7e0SNamjae Jeon /* 3*1e9ea7e0SNamjae Jeon * dir.c - NTFS kernel directory operations. Part of the Linux-NTFS project. 4*1e9ea7e0SNamjae Jeon * 5*1e9ea7e0SNamjae Jeon * Copyright (c) 2001-2007 Anton Altaparmakov 6*1e9ea7e0SNamjae Jeon * Copyright (c) 2002 Richard Russon 7*1e9ea7e0SNamjae Jeon */ 8*1e9ea7e0SNamjae Jeon 9*1e9ea7e0SNamjae Jeon #include <linux/buffer_head.h> 10*1e9ea7e0SNamjae Jeon #include <linux/slab.h> 11*1e9ea7e0SNamjae Jeon #include <linux/blkdev.h> 12*1e9ea7e0SNamjae Jeon 13*1e9ea7e0SNamjae Jeon #include "dir.h" 14*1e9ea7e0SNamjae Jeon #include "aops.h" 15*1e9ea7e0SNamjae Jeon #include "attrib.h" 16*1e9ea7e0SNamjae Jeon #include "mft.h" 17*1e9ea7e0SNamjae Jeon #include "debug.h" 18*1e9ea7e0SNamjae Jeon #include "ntfs.h" 19*1e9ea7e0SNamjae Jeon 20*1e9ea7e0SNamjae Jeon /* 21*1e9ea7e0SNamjae Jeon * The little endian Unicode string $I30 as a global constant. 22*1e9ea7e0SNamjae Jeon */ 23*1e9ea7e0SNamjae Jeon ntfschar I30[5] = { cpu_to_le16('$'), cpu_to_le16('I'), 24*1e9ea7e0SNamjae Jeon cpu_to_le16('3'), cpu_to_le16('0'), 0 }; 25*1e9ea7e0SNamjae Jeon 26*1e9ea7e0SNamjae Jeon /** 27*1e9ea7e0SNamjae Jeon * ntfs_lookup_inode_by_name - find an inode in a directory given its name 28*1e9ea7e0SNamjae Jeon * @dir_ni: ntfs inode of the directory in which to search for the name 29*1e9ea7e0SNamjae Jeon * @uname: Unicode name for which to search in the directory 30*1e9ea7e0SNamjae Jeon * @uname_len: length of the name @uname in Unicode characters 31*1e9ea7e0SNamjae Jeon * @res: return the found file name if necessary (see below) 32*1e9ea7e0SNamjae Jeon * 33*1e9ea7e0SNamjae Jeon * Look for an inode with name @uname in the directory with inode @dir_ni. 34*1e9ea7e0SNamjae Jeon * ntfs_lookup_inode_by_name() walks the contents of the directory looking for 35*1e9ea7e0SNamjae Jeon * the Unicode name. If the name is found in the directory, the corresponding 36*1e9ea7e0SNamjae Jeon * inode number (>= 0) is returned as a mft reference in cpu format, i.e. it 37*1e9ea7e0SNamjae Jeon * is a 64-bit number containing the sequence number. 38*1e9ea7e0SNamjae Jeon * 39*1e9ea7e0SNamjae Jeon * On error, a negative value is returned corresponding to the error code. In 40*1e9ea7e0SNamjae Jeon * particular if the inode is not found -ENOENT is returned. Note that you 41*1e9ea7e0SNamjae Jeon * can't just check the return value for being negative, you have to check the 42*1e9ea7e0SNamjae Jeon * inode number for being negative which you can extract using MREC(return 43*1e9ea7e0SNamjae Jeon * value). 44*1e9ea7e0SNamjae Jeon * 45*1e9ea7e0SNamjae Jeon * Note, @uname_len does not include the (optional) terminating NULL character. 46*1e9ea7e0SNamjae Jeon * 47*1e9ea7e0SNamjae Jeon * Note, we look for a case sensitive match first but we also look for a case 48*1e9ea7e0SNamjae Jeon * insensitive match at the same time. If we find a case insensitive match, we 49*1e9ea7e0SNamjae Jeon * save that for the case that we don't find an exact match, where we return 50*1e9ea7e0SNamjae Jeon * the case insensitive match and setup @res (which we allocate!) with the mft 51*1e9ea7e0SNamjae Jeon * reference, the file name type, length and with a copy of the little endian 52*1e9ea7e0SNamjae Jeon * Unicode file name itself. If we match a file name which is in the DOS name 53*1e9ea7e0SNamjae Jeon * space, we only return the mft reference and file name type in @res. 54*1e9ea7e0SNamjae Jeon * ntfs_lookup() then uses this to find the long file name in the inode itself. 55*1e9ea7e0SNamjae Jeon * This is to avoid polluting the dcache with short file names. We want them to 56*1e9ea7e0SNamjae Jeon * work but we don't care for how quickly one can access them. This also fixes 57*1e9ea7e0SNamjae Jeon * the dcache aliasing issues. 58*1e9ea7e0SNamjae Jeon * 59*1e9ea7e0SNamjae Jeon * Locking: - Caller must hold i_mutex on the directory. 60*1e9ea7e0SNamjae Jeon * - Each page cache page in the index allocation mapping must be 61*1e9ea7e0SNamjae Jeon * locked whilst being accessed otherwise we may find a corrupt 62*1e9ea7e0SNamjae Jeon * page due to it being under ->writepage at the moment which 63*1e9ea7e0SNamjae Jeon * applies the mst protection fixups before writing out and then 64*1e9ea7e0SNamjae Jeon * removes them again after the write is complete after which it 65*1e9ea7e0SNamjae Jeon * unlocks the page. 66*1e9ea7e0SNamjae Jeon */ 67*1e9ea7e0SNamjae Jeon MFT_REF ntfs_lookup_inode_by_name(ntfs_inode *dir_ni, const ntfschar *uname, 68*1e9ea7e0SNamjae Jeon const int uname_len, ntfs_name **res) 69*1e9ea7e0SNamjae Jeon { 70*1e9ea7e0SNamjae Jeon ntfs_volume *vol = dir_ni->vol; 71*1e9ea7e0SNamjae Jeon struct super_block *sb = vol->sb; 72*1e9ea7e0SNamjae Jeon MFT_RECORD *m; 73*1e9ea7e0SNamjae Jeon INDEX_ROOT *ir; 74*1e9ea7e0SNamjae Jeon INDEX_ENTRY *ie; 75*1e9ea7e0SNamjae Jeon INDEX_ALLOCATION *ia; 76*1e9ea7e0SNamjae Jeon u8 *index_end; 77*1e9ea7e0SNamjae Jeon u64 mref; 78*1e9ea7e0SNamjae Jeon ntfs_attr_search_ctx *ctx; 79*1e9ea7e0SNamjae Jeon int err, rc; 80*1e9ea7e0SNamjae Jeon VCN vcn, old_vcn; 81*1e9ea7e0SNamjae Jeon struct address_space *ia_mapping; 82*1e9ea7e0SNamjae Jeon struct page *page; 83*1e9ea7e0SNamjae Jeon u8 *kaddr; 84*1e9ea7e0SNamjae Jeon ntfs_name *name = NULL; 85*1e9ea7e0SNamjae Jeon 86*1e9ea7e0SNamjae Jeon BUG_ON(!S_ISDIR(VFS_I(dir_ni)->i_mode)); 87*1e9ea7e0SNamjae Jeon BUG_ON(NInoAttr(dir_ni)); 88*1e9ea7e0SNamjae Jeon /* Get hold of the mft record for the directory. */ 89*1e9ea7e0SNamjae Jeon m = map_mft_record(dir_ni); 90*1e9ea7e0SNamjae Jeon if (IS_ERR(m)) { 91*1e9ea7e0SNamjae Jeon ntfs_error(sb, "map_mft_record() failed with error code %ld.", 92*1e9ea7e0SNamjae Jeon -PTR_ERR(m)); 93*1e9ea7e0SNamjae Jeon return ERR_MREF(PTR_ERR(m)); 94*1e9ea7e0SNamjae Jeon } 95*1e9ea7e0SNamjae Jeon ctx = ntfs_attr_get_search_ctx(dir_ni, m); 96*1e9ea7e0SNamjae Jeon if (unlikely(!ctx)) { 97*1e9ea7e0SNamjae Jeon err = -ENOMEM; 98*1e9ea7e0SNamjae Jeon goto err_out; 99*1e9ea7e0SNamjae Jeon } 100*1e9ea7e0SNamjae Jeon /* Find the index root attribute in the mft record. */ 101*1e9ea7e0SNamjae Jeon err = ntfs_attr_lookup(AT_INDEX_ROOT, I30, 4, CASE_SENSITIVE, 0, NULL, 102*1e9ea7e0SNamjae Jeon 0, ctx); 103*1e9ea7e0SNamjae Jeon if (unlikely(err)) { 104*1e9ea7e0SNamjae Jeon if (err == -ENOENT) { 105*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Index root attribute missing in " 106*1e9ea7e0SNamjae Jeon "directory inode 0x%lx.", 107*1e9ea7e0SNamjae Jeon dir_ni->mft_no); 108*1e9ea7e0SNamjae Jeon err = -EIO; 109*1e9ea7e0SNamjae Jeon } 110*1e9ea7e0SNamjae Jeon goto err_out; 111*1e9ea7e0SNamjae Jeon } 112*1e9ea7e0SNamjae Jeon /* Get to the index root value (it's been verified in read_inode). */ 113*1e9ea7e0SNamjae Jeon ir = (INDEX_ROOT*)((u8*)ctx->attr + 114*1e9ea7e0SNamjae Jeon le16_to_cpu(ctx->attr->data.resident.value_offset)); 115*1e9ea7e0SNamjae Jeon index_end = (u8*)&ir->index + le32_to_cpu(ir->index.index_length); 116*1e9ea7e0SNamjae Jeon /* The first index entry. */ 117*1e9ea7e0SNamjae Jeon ie = (INDEX_ENTRY*)((u8*)&ir->index + 118*1e9ea7e0SNamjae Jeon le32_to_cpu(ir->index.entries_offset)); 119*1e9ea7e0SNamjae Jeon /* 120*1e9ea7e0SNamjae Jeon * Loop until we exceed valid memory (corruption case) or until we 121*1e9ea7e0SNamjae Jeon * reach the last entry. 122*1e9ea7e0SNamjae Jeon */ 123*1e9ea7e0SNamjae Jeon for (;; ie = (INDEX_ENTRY*)((u8*)ie + le16_to_cpu(ie->length))) { 124*1e9ea7e0SNamjae Jeon /* Bounds checks. */ 125*1e9ea7e0SNamjae Jeon if ((u8*)ie < (u8*)ctx->mrec || (u8*)ie + 126*1e9ea7e0SNamjae Jeon sizeof(INDEX_ENTRY_HEADER) > index_end || 127*1e9ea7e0SNamjae Jeon (u8*)ie + le16_to_cpu(ie->key_length) > 128*1e9ea7e0SNamjae Jeon index_end) 129*1e9ea7e0SNamjae Jeon goto dir_err_out; 130*1e9ea7e0SNamjae Jeon /* 131*1e9ea7e0SNamjae Jeon * The last entry cannot contain a name. It can however contain 132*1e9ea7e0SNamjae Jeon * a pointer to a child node in the B+tree so we just break out. 133*1e9ea7e0SNamjae Jeon */ 134*1e9ea7e0SNamjae Jeon if (ie->flags & INDEX_ENTRY_END) 135*1e9ea7e0SNamjae Jeon break; 136*1e9ea7e0SNamjae Jeon /* 137*1e9ea7e0SNamjae Jeon * We perform a case sensitive comparison and if that matches 138*1e9ea7e0SNamjae Jeon * we are done and return the mft reference of the inode (i.e. 139*1e9ea7e0SNamjae Jeon * the inode number together with the sequence number for 140*1e9ea7e0SNamjae Jeon * consistency checking). We convert it to cpu format before 141*1e9ea7e0SNamjae Jeon * returning. 142*1e9ea7e0SNamjae Jeon */ 143*1e9ea7e0SNamjae Jeon if (ntfs_are_names_equal(uname, uname_len, 144*1e9ea7e0SNamjae Jeon (ntfschar*)&ie->key.file_name.file_name, 145*1e9ea7e0SNamjae Jeon ie->key.file_name.file_name_length, 146*1e9ea7e0SNamjae Jeon CASE_SENSITIVE, vol->upcase, vol->upcase_len)) { 147*1e9ea7e0SNamjae Jeon found_it: 148*1e9ea7e0SNamjae Jeon /* 149*1e9ea7e0SNamjae Jeon * We have a perfect match, so we don't need to care 150*1e9ea7e0SNamjae Jeon * about having matched imperfectly before, so we can 151*1e9ea7e0SNamjae Jeon * free name and set *res to NULL. 152*1e9ea7e0SNamjae Jeon * However, if the perfect match is a short file name, 153*1e9ea7e0SNamjae Jeon * we need to signal this through *res, so that 154*1e9ea7e0SNamjae Jeon * ntfs_lookup() can fix dcache aliasing issues. 155*1e9ea7e0SNamjae Jeon * As an optimization we just reuse an existing 156*1e9ea7e0SNamjae Jeon * allocation of *res. 157*1e9ea7e0SNamjae Jeon */ 158*1e9ea7e0SNamjae Jeon if (ie->key.file_name.file_name_type == FILE_NAME_DOS) { 159*1e9ea7e0SNamjae Jeon if (!name) { 160*1e9ea7e0SNamjae Jeon name = kmalloc(sizeof(ntfs_name), 161*1e9ea7e0SNamjae Jeon GFP_NOFS); 162*1e9ea7e0SNamjae Jeon if (!name) { 163*1e9ea7e0SNamjae Jeon err = -ENOMEM; 164*1e9ea7e0SNamjae Jeon goto err_out; 165*1e9ea7e0SNamjae Jeon } 166*1e9ea7e0SNamjae Jeon } 167*1e9ea7e0SNamjae Jeon name->mref = le64_to_cpu( 168*1e9ea7e0SNamjae Jeon ie->data.dir.indexed_file); 169*1e9ea7e0SNamjae Jeon name->type = FILE_NAME_DOS; 170*1e9ea7e0SNamjae Jeon name->len = 0; 171*1e9ea7e0SNamjae Jeon *res = name; 172*1e9ea7e0SNamjae Jeon } else { 173*1e9ea7e0SNamjae Jeon kfree(name); 174*1e9ea7e0SNamjae Jeon *res = NULL; 175*1e9ea7e0SNamjae Jeon } 176*1e9ea7e0SNamjae Jeon mref = le64_to_cpu(ie->data.dir.indexed_file); 177*1e9ea7e0SNamjae Jeon ntfs_attr_put_search_ctx(ctx); 178*1e9ea7e0SNamjae Jeon unmap_mft_record(dir_ni); 179*1e9ea7e0SNamjae Jeon return mref; 180*1e9ea7e0SNamjae Jeon } 181*1e9ea7e0SNamjae Jeon /* 182*1e9ea7e0SNamjae Jeon * For a case insensitive mount, we also perform a case 183*1e9ea7e0SNamjae Jeon * insensitive comparison (provided the file name is not in the 184*1e9ea7e0SNamjae Jeon * POSIX namespace). If the comparison matches, and the name is 185*1e9ea7e0SNamjae Jeon * in the WIN32 namespace, we cache the filename in *res so 186*1e9ea7e0SNamjae Jeon * that the caller, ntfs_lookup(), can work on it. If the 187*1e9ea7e0SNamjae Jeon * comparison matches, and the name is in the DOS namespace, we 188*1e9ea7e0SNamjae Jeon * only cache the mft reference and the file name type (we set 189*1e9ea7e0SNamjae Jeon * the name length to zero for simplicity). 190*1e9ea7e0SNamjae Jeon */ 191*1e9ea7e0SNamjae Jeon if (!NVolCaseSensitive(vol) && 192*1e9ea7e0SNamjae Jeon ie->key.file_name.file_name_type && 193*1e9ea7e0SNamjae Jeon ntfs_are_names_equal(uname, uname_len, 194*1e9ea7e0SNamjae Jeon (ntfschar*)&ie->key.file_name.file_name, 195*1e9ea7e0SNamjae Jeon ie->key.file_name.file_name_length, 196*1e9ea7e0SNamjae Jeon IGNORE_CASE, vol->upcase, vol->upcase_len)) { 197*1e9ea7e0SNamjae Jeon int name_size = sizeof(ntfs_name); 198*1e9ea7e0SNamjae Jeon u8 type = ie->key.file_name.file_name_type; 199*1e9ea7e0SNamjae Jeon u8 len = ie->key.file_name.file_name_length; 200*1e9ea7e0SNamjae Jeon 201*1e9ea7e0SNamjae Jeon /* Only one case insensitive matching name allowed. */ 202*1e9ea7e0SNamjae Jeon if (name) { 203*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Found already allocated name " 204*1e9ea7e0SNamjae Jeon "in phase 1. Please run chkdsk " 205*1e9ea7e0SNamjae Jeon "and if that doesn't find any " 206*1e9ea7e0SNamjae Jeon "errors please report you saw " 207*1e9ea7e0SNamjae Jeon "this message to " 208*1e9ea7e0SNamjae Jeon "linux-ntfs-dev@lists." 209*1e9ea7e0SNamjae Jeon "sourceforge.net."); 210*1e9ea7e0SNamjae Jeon goto dir_err_out; 211*1e9ea7e0SNamjae Jeon } 212*1e9ea7e0SNamjae Jeon 213*1e9ea7e0SNamjae Jeon if (type != FILE_NAME_DOS) 214*1e9ea7e0SNamjae Jeon name_size += len * sizeof(ntfschar); 215*1e9ea7e0SNamjae Jeon name = kmalloc(name_size, GFP_NOFS); 216*1e9ea7e0SNamjae Jeon if (!name) { 217*1e9ea7e0SNamjae Jeon err = -ENOMEM; 218*1e9ea7e0SNamjae Jeon goto err_out; 219*1e9ea7e0SNamjae Jeon } 220*1e9ea7e0SNamjae Jeon name->mref = le64_to_cpu(ie->data.dir.indexed_file); 221*1e9ea7e0SNamjae Jeon name->type = type; 222*1e9ea7e0SNamjae Jeon if (type != FILE_NAME_DOS) { 223*1e9ea7e0SNamjae Jeon name->len = len; 224*1e9ea7e0SNamjae Jeon memcpy(name->name, ie->key.file_name.file_name, 225*1e9ea7e0SNamjae Jeon len * sizeof(ntfschar)); 226*1e9ea7e0SNamjae Jeon } else 227*1e9ea7e0SNamjae Jeon name->len = 0; 228*1e9ea7e0SNamjae Jeon *res = name; 229*1e9ea7e0SNamjae Jeon } 230*1e9ea7e0SNamjae Jeon /* 231*1e9ea7e0SNamjae Jeon * Not a perfect match, need to do full blown collation so we 232*1e9ea7e0SNamjae Jeon * know which way in the B+tree we have to go. 233*1e9ea7e0SNamjae Jeon */ 234*1e9ea7e0SNamjae Jeon rc = ntfs_collate_names(uname, uname_len, 235*1e9ea7e0SNamjae Jeon (ntfschar*)&ie->key.file_name.file_name, 236*1e9ea7e0SNamjae Jeon ie->key.file_name.file_name_length, 1, 237*1e9ea7e0SNamjae Jeon IGNORE_CASE, vol->upcase, vol->upcase_len); 238*1e9ea7e0SNamjae Jeon /* 239*1e9ea7e0SNamjae Jeon * If uname collates before the name of the current entry, there 240*1e9ea7e0SNamjae Jeon * is definitely no such name in this index but we might need to 241*1e9ea7e0SNamjae Jeon * descend into the B+tree so we just break out of the loop. 242*1e9ea7e0SNamjae Jeon */ 243*1e9ea7e0SNamjae Jeon if (rc == -1) 244*1e9ea7e0SNamjae Jeon break; 245*1e9ea7e0SNamjae Jeon /* The names are not equal, continue the search. */ 246*1e9ea7e0SNamjae Jeon if (rc) 247*1e9ea7e0SNamjae Jeon continue; 248*1e9ea7e0SNamjae Jeon /* 249*1e9ea7e0SNamjae Jeon * Names match with case insensitive comparison, now try the 250*1e9ea7e0SNamjae Jeon * case sensitive comparison, which is required for proper 251*1e9ea7e0SNamjae Jeon * collation. 252*1e9ea7e0SNamjae Jeon */ 253*1e9ea7e0SNamjae Jeon rc = ntfs_collate_names(uname, uname_len, 254*1e9ea7e0SNamjae Jeon (ntfschar*)&ie->key.file_name.file_name, 255*1e9ea7e0SNamjae Jeon ie->key.file_name.file_name_length, 1, 256*1e9ea7e0SNamjae Jeon CASE_SENSITIVE, vol->upcase, vol->upcase_len); 257*1e9ea7e0SNamjae Jeon if (rc == -1) 258*1e9ea7e0SNamjae Jeon break; 259*1e9ea7e0SNamjae Jeon if (rc) 260*1e9ea7e0SNamjae Jeon continue; 261*1e9ea7e0SNamjae Jeon /* 262*1e9ea7e0SNamjae Jeon * Perfect match, this will never happen as the 263*1e9ea7e0SNamjae Jeon * ntfs_are_names_equal() call will have gotten a match but we 264*1e9ea7e0SNamjae Jeon * still treat it correctly. 265*1e9ea7e0SNamjae Jeon */ 266*1e9ea7e0SNamjae Jeon goto found_it; 267*1e9ea7e0SNamjae Jeon } 268*1e9ea7e0SNamjae Jeon /* 269*1e9ea7e0SNamjae Jeon * We have finished with this index without success. Check for the 270*1e9ea7e0SNamjae Jeon * presence of a child node and if not present return -ENOENT, unless 271*1e9ea7e0SNamjae Jeon * we have got a matching name cached in name in which case return the 272*1e9ea7e0SNamjae Jeon * mft reference associated with it. 273*1e9ea7e0SNamjae Jeon */ 274*1e9ea7e0SNamjae Jeon if (!(ie->flags & INDEX_ENTRY_NODE)) { 275*1e9ea7e0SNamjae Jeon if (name) { 276*1e9ea7e0SNamjae Jeon ntfs_attr_put_search_ctx(ctx); 277*1e9ea7e0SNamjae Jeon unmap_mft_record(dir_ni); 278*1e9ea7e0SNamjae Jeon return name->mref; 279*1e9ea7e0SNamjae Jeon } 280*1e9ea7e0SNamjae Jeon ntfs_debug("Entry not found."); 281*1e9ea7e0SNamjae Jeon err = -ENOENT; 282*1e9ea7e0SNamjae Jeon goto err_out; 283*1e9ea7e0SNamjae Jeon } /* Child node present, descend into it. */ 284*1e9ea7e0SNamjae Jeon /* Consistency check: Verify that an index allocation exists. */ 285*1e9ea7e0SNamjae Jeon if (!NInoIndexAllocPresent(dir_ni)) { 286*1e9ea7e0SNamjae Jeon ntfs_error(sb, "No index allocation attribute but index entry " 287*1e9ea7e0SNamjae Jeon "requires one. Directory inode 0x%lx is " 288*1e9ea7e0SNamjae Jeon "corrupt or driver bug.", dir_ni->mft_no); 289*1e9ea7e0SNamjae Jeon goto err_out; 290*1e9ea7e0SNamjae Jeon } 291*1e9ea7e0SNamjae Jeon /* Get the starting vcn of the index_block holding the child node. */ 292*1e9ea7e0SNamjae Jeon vcn = sle64_to_cpup((sle64*)((u8*)ie + le16_to_cpu(ie->length) - 8)); 293*1e9ea7e0SNamjae Jeon ia_mapping = VFS_I(dir_ni)->i_mapping; 294*1e9ea7e0SNamjae Jeon /* 295*1e9ea7e0SNamjae Jeon * We are done with the index root and the mft record. Release them, 296*1e9ea7e0SNamjae Jeon * otherwise we deadlock with ntfs_map_page(). 297*1e9ea7e0SNamjae Jeon */ 298*1e9ea7e0SNamjae Jeon ntfs_attr_put_search_ctx(ctx); 299*1e9ea7e0SNamjae Jeon unmap_mft_record(dir_ni); 300*1e9ea7e0SNamjae Jeon m = NULL; 301*1e9ea7e0SNamjae Jeon ctx = NULL; 302*1e9ea7e0SNamjae Jeon descend_into_child_node: 303*1e9ea7e0SNamjae Jeon /* 304*1e9ea7e0SNamjae Jeon * Convert vcn to index into the index allocation attribute in units 305*1e9ea7e0SNamjae Jeon * of PAGE_SIZE and map the page cache page, reading it from 306*1e9ea7e0SNamjae Jeon * disk if necessary. 307*1e9ea7e0SNamjae Jeon */ 308*1e9ea7e0SNamjae Jeon page = ntfs_map_page(ia_mapping, vcn << 309*1e9ea7e0SNamjae Jeon dir_ni->itype.index.vcn_size_bits >> PAGE_SHIFT); 310*1e9ea7e0SNamjae Jeon if (IS_ERR(page)) { 311*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Failed to map directory index page, error %ld.", 312*1e9ea7e0SNamjae Jeon -PTR_ERR(page)); 313*1e9ea7e0SNamjae Jeon err = PTR_ERR(page); 314*1e9ea7e0SNamjae Jeon goto err_out; 315*1e9ea7e0SNamjae Jeon } 316*1e9ea7e0SNamjae Jeon lock_page(page); 317*1e9ea7e0SNamjae Jeon kaddr = (u8*)page_address(page); 318*1e9ea7e0SNamjae Jeon fast_descend_into_child_node: 319*1e9ea7e0SNamjae Jeon /* Get to the index allocation block. */ 320*1e9ea7e0SNamjae Jeon ia = (INDEX_ALLOCATION*)(kaddr + ((vcn << 321*1e9ea7e0SNamjae Jeon dir_ni->itype.index.vcn_size_bits) & ~PAGE_MASK)); 322*1e9ea7e0SNamjae Jeon /* Bounds checks. */ 323*1e9ea7e0SNamjae Jeon if ((u8*)ia < kaddr || (u8*)ia > kaddr + PAGE_SIZE) { 324*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Out of bounds check failed. Corrupt directory " 325*1e9ea7e0SNamjae Jeon "inode 0x%lx or driver bug.", dir_ni->mft_no); 326*1e9ea7e0SNamjae Jeon goto unm_err_out; 327*1e9ea7e0SNamjae Jeon } 328*1e9ea7e0SNamjae Jeon /* Catch multi sector transfer fixup errors. */ 329*1e9ea7e0SNamjae Jeon if (unlikely(!ntfs_is_indx_record(ia->magic))) { 330*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Directory index record with vcn 0x%llx is " 331*1e9ea7e0SNamjae Jeon "corrupt. Corrupt inode 0x%lx. Run chkdsk.", 332*1e9ea7e0SNamjae Jeon (unsigned long long)vcn, dir_ni->mft_no); 333*1e9ea7e0SNamjae Jeon goto unm_err_out; 334*1e9ea7e0SNamjae Jeon } 335*1e9ea7e0SNamjae Jeon if (sle64_to_cpu(ia->index_block_vcn) != vcn) { 336*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Actual VCN (0x%llx) of index buffer is " 337*1e9ea7e0SNamjae Jeon "different from expected VCN (0x%llx). " 338*1e9ea7e0SNamjae Jeon "Directory inode 0x%lx is corrupt or driver " 339*1e9ea7e0SNamjae Jeon "bug.", (unsigned long long) 340*1e9ea7e0SNamjae Jeon sle64_to_cpu(ia->index_block_vcn), 341*1e9ea7e0SNamjae Jeon (unsigned long long)vcn, dir_ni->mft_no); 342*1e9ea7e0SNamjae Jeon goto unm_err_out; 343*1e9ea7e0SNamjae Jeon } 344*1e9ea7e0SNamjae Jeon if (le32_to_cpu(ia->index.allocated_size) + 0x18 != 345*1e9ea7e0SNamjae Jeon dir_ni->itype.index.block_size) { 346*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Index buffer (VCN 0x%llx) of directory inode " 347*1e9ea7e0SNamjae Jeon "0x%lx has a size (%u) differing from the " 348*1e9ea7e0SNamjae Jeon "directory specified size (%u). Directory " 349*1e9ea7e0SNamjae Jeon "inode is corrupt or driver bug.", 350*1e9ea7e0SNamjae Jeon (unsigned long long)vcn, dir_ni->mft_no, 351*1e9ea7e0SNamjae Jeon le32_to_cpu(ia->index.allocated_size) + 0x18, 352*1e9ea7e0SNamjae Jeon dir_ni->itype.index.block_size); 353*1e9ea7e0SNamjae Jeon goto unm_err_out; 354*1e9ea7e0SNamjae Jeon } 355*1e9ea7e0SNamjae Jeon index_end = (u8*)ia + dir_ni->itype.index.block_size; 356*1e9ea7e0SNamjae Jeon if (index_end > kaddr + PAGE_SIZE) { 357*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Index buffer (VCN 0x%llx) of directory inode " 358*1e9ea7e0SNamjae Jeon "0x%lx crosses page boundary. Impossible! " 359*1e9ea7e0SNamjae Jeon "Cannot access! This is probably a bug in the " 360*1e9ea7e0SNamjae Jeon "driver.", (unsigned long long)vcn, 361*1e9ea7e0SNamjae Jeon dir_ni->mft_no); 362*1e9ea7e0SNamjae Jeon goto unm_err_out; 363*1e9ea7e0SNamjae Jeon } 364*1e9ea7e0SNamjae Jeon index_end = (u8*)&ia->index + le32_to_cpu(ia->index.index_length); 365*1e9ea7e0SNamjae Jeon if (index_end > (u8*)ia + dir_ni->itype.index.block_size) { 366*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Size of index buffer (VCN 0x%llx) of directory " 367*1e9ea7e0SNamjae Jeon "inode 0x%lx exceeds maximum size.", 368*1e9ea7e0SNamjae Jeon (unsigned long long)vcn, dir_ni->mft_no); 369*1e9ea7e0SNamjae Jeon goto unm_err_out; 370*1e9ea7e0SNamjae Jeon } 371*1e9ea7e0SNamjae Jeon /* The first index entry. */ 372*1e9ea7e0SNamjae Jeon ie = (INDEX_ENTRY*)((u8*)&ia->index + 373*1e9ea7e0SNamjae Jeon le32_to_cpu(ia->index.entries_offset)); 374*1e9ea7e0SNamjae Jeon /* 375*1e9ea7e0SNamjae Jeon * Iterate similar to above big loop but applied to index buffer, thus 376*1e9ea7e0SNamjae Jeon * loop until we exceed valid memory (corruption case) or until we 377*1e9ea7e0SNamjae Jeon * reach the last entry. 378*1e9ea7e0SNamjae Jeon */ 379*1e9ea7e0SNamjae Jeon for (;; ie = (INDEX_ENTRY*)((u8*)ie + le16_to_cpu(ie->length))) { 380*1e9ea7e0SNamjae Jeon /* Bounds check. */ 381*1e9ea7e0SNamjae Jeon if ((u8*)ie < (u8*)ia || (u8*)ie + 382*1e9ea7e0SNamjae Jeon sizeof(INDEX_ENTRY_HEADER) > index_end || 383*1e9ea7e0SNamjae Jeon (u8*)ie + le16_to_cpu(ie->key_length) > 384*1e9ea7e0SNamjae Jeon index_end) { 385*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Index entry out of bounds in " 386*1e9ea7e0SNamjae Jeon "directory inode 0x%lx.", 387*1e9ea7e0SNamjae Jeon dir_ni->mft_no); 388*1e9ea7e0SNamjae Jeon goto unm_err_out; 389*1e9ea7e0SNamjae Jeon } 390*1e9ea7e0SNamjae Jeon /* 391*1e9ea7e0SNamjae Jeon * The last entry cannot contain a name. It can however contain 392*1e9ea7e0SNamjae Jeon * a pointer to a child node in the B+tree so we just break out. 393*1e9ea7e0SNamjae Jeon */ 394*1e9ea7e0SNamjae Jeon if (ie->flags & INDEX_ENTRY_END) 395*1e9ea7e0SNamjae Jeon break; 396*1e9ea7e0SNamjae Jeon /* 397*1e9ea7e0SNamjae Jeon * We perform a case sensitive comparison and if that matches 398*1e9ea7e0SNamjae Jeon * we are done and return the mft reference of the inode (i.e. 399*1e9ea7e0SNamjae Jeon * the inode number together with the sequence number for 400*1e9ea7e0SNamjae Jeon * consistency checking). We convert it to cpu format before 401*1e9ea7e0SNamjae Jeon * returning. 402*1e9ea7e0SNamjae Jeon */ 403*1e9ea7e0SNamjae Jeon if (ntfs_are_names_equal(uname, uname_len, 404*1e9ea7e0SNamjae Jeon (ntfschar*)&ie->key.file_name.file_name, 405*1e9ea7e0SNamjae Jeon ie->key.file_name.file_name_length, 406*1e9ea7e0SNamjae Jeon CASE_SENSITIVE, vol->upcase, vol->upcase_len)) { 407*1e9ea7e0SNamjae Jeon found_it2: 408*1e9ea7e0SNamjae Jeon /* 409*1e9ea7e0SNamjae Jeon * We have a perfect match, so we don't need to care 410*1e9ea7e0SNamjae Jeon * about having matched imperfectly before, so we can 411*1e9ea7e0SNamjae Jeon * free name and set *res to NULL. 412*1e9ea7e0SNamjae Jeon * However, if the perfect match is a short file name, 413*1e9ea7e0SNamjae Jeon * we need to signal this through *res, so that 414*1e9ea7e0SNamjae Jeon * ntfs_lookup() can fix dcache aliasing issues. 415*1e9ea7e0SNamjae Jeon * As an optimization we just reuse an existing 416*1e9ea7e0SNamjae Jeon * allocation of *res. 417*1e9ea7e0SNamjae Jeon */ 418*1e9ea7e0SNamjae Jeon if (ie->key.file_name.file_name_type == FILE_NAME_DOS) { 419*1e9ea7e0SNamjae Jeon if (!name) { 420*1e9ea7e0SNamjae Jeon name = kmalloc(sizeof(ntfs_name), 421*1e9ea7e0SNamjae Jeon GFP_NOFS); 422*1e9ea7e0SNamjae Jeon if (!name) { 423*1e9ea7e0SNamjae Jeon err = -ENOMEM; 424*1e9ea7e0SNamjae Jeon goto unm_err_out; 425*1e9ea7e0SNamjae Jeon } 426*1e9ea7e0SNamjae Jeon } 427*1e9ea7e0SNamjae Jeon name->mref = le64_to_cpu( 428*1e9ea7e0SNamjae Jeon ie->data.dir.indexed_file); 429*1e9ea7e0SNamjae Jeon name->type = FILE_NAME_DOS; 430*1e9ea7e0SNamjae Jeon name->len = 0; 431*1e9ea7e0SNamjae Jeon *res = name; 432*1e9ea7e0SNamjae Jeon } else { 433*1e9ea7e0SNamjae Jeon kfree(name); 434*1e9ea7e0SNamjae Jeon *res = NULL; 435*1e9ea7e0SNamjae Jeon } 436*1e9ea7e0SNamjae Jeon mref = le64_to_cpu(ie->data.dir.indexed_file); 437*1e9ea7e0SNamjae Jeon unlock_page(page); 438*1e9ea7e0SNamjae Jeon ntfs_unmap_page(page); 439*1e9ea7e0SNamjae Jeon return mref; 440*1e9ea7e0SNamjae Jeon } 441*1e9ea7e0SNamjae Jeon /* 442*1e9ea7e0SNamjae Jeon * For a case insensitive mount, we also perform a case 443*1e9ea7e0SNamjae Jeon * insensitive comparison (provided the file name is not in the 444*1e9ea7e0SNamjae Jeon * POSIX namespace). If the comparison matches, and the name is 445*1e9ea7e0SNamjae Jeon * in the WIN32 namespace, we cache the filename in *res so 446*1e9ea7e0SNamjae Jeon * that the caller, ntfs_lookup(), can work on it. If the 447*1e9ea7e0SNamjae Jeon * comparison matches, and the name is in the DOS namespace, we 448*1e9ea7e0SNamjae Jeon * only cache the mft reference and the file name type (we set 449*1e9ea7e0SNamjae Jeon * the name length to zero for simplicity). 450*1e9ea7e0SNamjae Jeon */ 451*1e9ea7e0SNamjae Jeon if (!NVolCaseSensitive(vol) && 452*1e9ea7e0SNamjae Jeon ie->key.file_name.file_name_type && 453*1e9ea7e0SNamjae Jeon ntfs_are_names_equal(uname, uname_len, 454*1e9ea7e0SNamjae Jeon (ntfschar*)&ie->key.file_name.file_name, 455*1e9ea7e0SNamjae Jeon ie->key.file_name.file_name_length, 456*1e9ea7e0SNamjae Jeon IGNORE_CASE, vol->upcase, vol->upcase_len)) { 457*1e9ea7e0SNamjae Jeon int name_size = sizeof(ntfs_name); 458*1e9ea7e0SNamjae Jeon u8 type = ie->key.file_name.file_name_type; 459*1e9ea7e0SNamjae Jeon u8 len = ie->key.file_name.file_name_length; 460*1e9ea7e0SNamjae Jeon 461*1e9ea7e0SNamjae Jeon /* Only one case insensitive matching name allowed. */ 462*1e9ea7e0SNamjae Jeon if (name) { 463*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Found already allocated name " 464*1e9ea7e0SNamjae Jeon "in phase 2. Please run chkdsk " 465*1e9ea7e0SNamjae Jeon "and if that doesn't find any " 466*1e9ea7e0SNamjae Jeon "errors please report you saw " 467*1e9ea7e0SNamjae Jeon "this message to " 468*1e9ea7e0SNamjae Jeon "linux-ntfs-dev@lists." 469*1e9ea7e0SNamjae Jeon "sourceforge.net."); 470*1e9ea7e0SNamjae Jeon unlock_page(page); 471*1e9ea7e0SNamjae Jeon ntfs_unmap_page(page); 472*1e9ea7e0SNamjae Jeon goto dir_err_out; 473*1e9ea7e0SNamjae Jeon } 474*1e9ea7e0SNamjae Jeon 475*1e9ea7e0SNamjae Jeon if (type != FILE_NAME_DOS) 476*1e9ea7e0SNamjae Jeon name_size += len * sizeof(ntfschar); 477*1e9ea7e0SNamjae Jeon name = kmalloc(name_size, GFP_NOFS); 478*1e9ea7e0SNamjae Jeon if (!name) { 479*1e9ea7e0SNamjae Jeon err = -ENOMEM; 480*1e9ea7e0SNamjae Jeon goto unm_err_out; 481*1e9ea7e0SNamjae Jeon } 482*1e9ea7e0SNamjae Jeon name->mref = le64_to_cpu(ie->data.dir.indexed_file); 483*1e9ea7e0SNamjae Jeon name->type = type; 484*1e9ea7e0SNamjae Jeon if (type != FILE_NAME_DOS) { 485*1e9ea7e0SNamjae Jeon name->len = len; 486*1e9ea7e0SNamjae Jeon memcpy(name->name, ie->key.file_name.file_name, 487*1e9ea7e0SNamjae Jeon len * sizeof(ntfschar)); 488*1e9ea7e0SNamjae Jeon } else 489*1e9ea7e0SNamjae Jeon name->len = 0; 490*1e9ea7e0SNamjae Jeon *res = name; 491*1e9ea7e0SNamjae Jeon } 492*1e9ea7e0SNamjae Jeon /* 493*1e9ea7e0SNamjae Jeon * Not a perfect match, need to do full blown collation so we 494*1e9ea7e0SNamjae Jeon * know which way in the B+tree we have to go. 495*1e9ea7e0SNamjae Jeon */ 496*1e9ea7e0SNamjae Jeon rc = ntfs_collate_names(uname, uname_len, 497*1e9ea7e0SNamjae Jeon (ntfschar*)&ie->key.file_name.file_name, 498*1e9ea7e0SNamjae Jeon ie->key.file_name.file_name_length, 1, 499*1e9ea7e0SNamjae Jeon IGNORE_CASE, vol->upcase, vol->upcase_len); 500*1e9ea7e0SNamjae Jeon /* 501*1e9ea7e0SNamjae Jeon * If uname collates before the name of the current entry, there 502*1e9ea7e0SNamjae Jeon * is definitely no such name in this index but we might need to 503*1e9ea7e0SNamjae Jeon * descend into the B+tree so we just break out of the loop. 504*1e9ea7e0SNamjae Jeon */ 505*1e9ea7e0SNamjae Jeon if (rc == -1) 506*1e9ea7e0SNamjae Jeon break; 507*1e9ea7e0SNamjae Jeon /* The names are not equal, continue the search. */ 508*1e9ea7e0SNamjae Jeon if (rc) 509*1e9ea7e0SNamjae Jeon continue; 510*1e9ea7e0SNamjae Jeon /* 511*1e9ea7e0SNamjae Jeon * Names match with case insensitive comparison, now try the 512*1e9ea7e0SNamjae Jeon * case sensitive comparison, which is required for proper 513*1e9ea7e0SNamjae Jeon * collation. 514*1e9ea7e0SNamjae Jeon */ 515*1e9ea7e0SNamjae Jeon rc = ntfs_collate_names(uname, uname_len, 516*1e9ea7e0SNamjae Jeon (ntfschar*)&ie->key.file_name.file_name, 517*1e9ea7e0SNamjae Jeon ie->key.file_name.file_name_length, 1, 518*1e9ea7e0SNamjae Jeon CASE_SENSITIVE, vol->upcase, vol->upcase_len); 519*1e9ea7e0SNamjae Jeon if (rc == -1) 520*1e9ea7e0SNamjae Jeon break; 521*1e9ea7e0SNamjae Jeon if (rc) 522*1e9ea7e0SNamjae Jeon continue; 523*1e9ea7e0SNamjae Jeon /* 524*1e9ea7e0SNamjae Jeon * Perfect match, this will never happen as the 525*1e9ea7e0SNamjae Jeon * ntfs_are_names_equal() call will have gotten a match but we 526*1e9ea7e0SNamjae Jeon * still treat it correctly. 527*1e9ea7e0SNamjae Jeon */ 528*1e9ea7e0SNamjae Jeon goto found_it2; 529*1e9ea7e0SNamjae Jeon } 530*1e9ea7e0SNamjae Jeon /* 531*1e9ea7e0SNamjae Jeon * We have finished with this index buffer without success. Check for 532*1e9ea7e0SNamjae Jeon * the presence of a child node. 533*1e9ea7e0SNamjae Jeon */ 534*1e9ea7e0SNamjae Jeon if (ie->flags & INDEX_ENTRY_NODE) { 535*1e9ea7e0SNamjae Jeon if ((ia->index.flags & NODE_MASK) == LEAF_NODE) { 536*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Index entry with child node found in " 537*1e9ea7e0SNamjae Jeon "a leaf node in directory inode 0x%lx.", 538*1e9ea7e0SNamjae Jeon dir_ni->mft_no); 539*1e9ea7e0SNamjae Jeon goto unm_err_out; 540*1e9ea7e0SNamjae Jeon } 541*1e9ea7e0SNamjae Jeon /* Child node present, descend into it. */ 542*1e9ea7e0SNamjae Jeon old_vcn = vcn; 543*1e9ea7e0SNamjae Jeon vcn = sle64_to_cpup((sle64*)((u8*)ie + 544*1e9ea7e0SNamjae Jeon le16_to_cpu(ie->length) - 8)); 545*1e9ea7e0SNamjae Jeon if (vcn >= 0) { 546*1e9ea7e0SNamjae Jeon /* If vcn is in the same page cache page as old_vcn we 547*1e9ea7e0SNamjae Jeon * recycle the mapped page. */ 548*1e9ea7e0SNamjae Jeon if (old_vcn << vol->cluster_size_bits >> 549*1e9ea7e0SNamjae Jeon PAGE_SHIFT == vcn << 550*1e9ea7e0SNamjae Jeon vol->cluster_size_bits >> 551*1e9ea7e0SNamjae Jeon PAGE_SHIFT) 552*1e9ea7e0SNamjae Jeon goto fast_descend_into_child_node; 553*1e9ea7e0SNamjae Jeon unlock_page(page); 554*1e9ea7e0SNamjae Jeon ntfs_unmap_page(page); 555*1e9ea7e0SNamjae Jeon goto descend_into_child_node; 556*1e9ea7e0SNamjae Jeon } 557*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Negative child node vcn in directory inode " 558*1e9ea7e0SNamjae Jeon "0x%lx.", dir_ni->mft_no); 559*1e9ea7e0SNamjae Jeon goto unm_err_out; 560*1e9ea7e0SNamjae Jeon } 561*1e9ea7e0SNamjae Jeon /* 562*1e9ea7e0SNamjae Jeon * No child node present, return -ENOENT, unless we have got a matching 563*1e9ea7e0SNamjae Jeon * name cached in name in which case return the mft reference 564*1e9ea7e0SNamjae Jeon * associated with it. 565*1e9ea7e0SNamjae Jeon */ 566*1e9ea7e0SNamjae Jeon if (name) { 567*1e9ea7e0SNamjae Jeon unlock_page(page); 568*1e9ea7e0SNamjae Jeon ntfs_unmap_page(page); 569*1e9ea7e0SNamjae Jeon return name->mref; 570*1e9ea7e0SNamjae Jeon } 571*1e9ea7e0SNamjae Jeon ntfs_debug("Entry not found."); 572*1e9ea7e0SNamjae Jeon err = -ENOENT; 573*1e9ea7e0SNamjae Jeon unm_err_out: 574*1e9ea7e0SNamjae Jeon unlock_page(page); 575*1e9ea7e0SNamjae Jeon ntfs_unmap_page(page); 576*1e9ea7e0SNamjae Jeon err_out: 577*1e9ea7e0SNamjae Jeon if (!err) 578*1e9ea7e0SNamjae Jeon err = -EIO; 579*1e9ea7e0SNamjae Jeon if (ctx) 580*1e9ea7e0SNamjae Jeon ntfs_attr_put_search_ctx(ctx); 581*1e9ea7e0SNamjae Jeon if (m) 582*1e9ea7e0SNamjae Jeon unmap_mft_record(dir_ni); 583*1e9ea7e0SNamjae Jeon if (name) { 584*1e9ea7e0SNamjae Jeon kfree(name); 585*1e9ea7e0SNamjae Jeon *res = NULL; 586*1e9ea7e0SNamjae Jeon } 587*1e9ea7e0SNamjae Jeon return ERR_MREF(err); 588*1e9ea7e0SNamjae Jeon dir_err_out: 589*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Corrupt directory. Aborting lookup."); 590*1e9ea7e0SNamjae Jeon goto err_out; 591*1e9ea7e0SNamjae Jeon } 592*1e9ea7e0SNamjae Jeon 593*1e9ea7e0SNamjae Jeon #if 0 594*1e9ea7e0SNamjae Jeon 595*1e9ea7e0SNamjae Jeon // TODO: (AIA) 596*1e9ea7e0SNamjae Jeon // The algorithm embedded in this code will be required for the time when we 597*1e9ea7e0SNamjae Jeon // want to support adding of entries to directories, where we require correct 598*1e9ea7e0SNamjae Jeon // collation of file names in order not to cause corruption of the filesystem. 599*1e9ea7e0SNamjae Jeon 600*1e9ea7e0SNamjae Jeon /** 601*1e9ea7e0SNamjae Jeon * ntfs_lookup_inode_by_name - find an inode in a directory given its name 602*1e9ea7e0SNamjae Jeon * @dir_ni: ntfs inode of the directory in which to search for the name 603*1e9ea7e0SNamjae Jeon * @uname: Unicode name for which to search in the directory 604*1e9ea7e0SNamjae Jeon * @uname_len: length of the name @uname in Unicode characters 605*1e9ea7e0SNamjae Jeon * 606*1e9ea7e0SNamjae Jeon * Look for an inode with name @uname in the directory with inode @dir_ni. 607*1e9ea7e0SNamjae Jeon * ntfs_lookup_inode_by_name() walks the contents of the directory looking for 608*1e9ea7e0SNamjae Jeon * the Unicode name. If the name is found in the directory, the corresponding 609*1e9ea7e0SNamjae Jeon * inode number (>= 0) is returned as a mft reference in cpu format, i.e. it 610*1e9ea7e0SNamjae Jeon * is a 64-bit number containing the sequence number. 611*1e9ea7e0SNamjae Jeon * 612*1e9ea7e0SNamjae Jeon * On error, a negative value is returned corresponding to the error code. In 613*1e9ea7e0SNamjae Jeon * particular if the inode is not found -ENOENT is returned. Note that you 614*1e9ea7e0SNamjae Jeon * can't just check the return value for being negative, you have to check the 615*1e9ea7e0SNamjae Jeon * inode number for being negative which you can extract using MREC(return 616*1e9ea7e0SNamjae Jeon * value). 617*1e9ea7e0SNamjae Jeon * 618*1e9ea7e0SNamjae Jeon * Note, @uname_len does not include the (optional) terminating NULL character. 619*1e9ea7e0SNamjae Jeon */ 620*1e9ea7e0SNamjae Jeon u64 ntfs_lookup_inode_by_name(ntfs_inode *dir_ni, const ntfschar *uname, 621*1e9ea7e0SNamjae Jeon const int uname_len) 622*1e9ea7e0SNamjae Jeon { 623*1e9ea7e0SNamjae Jeon ntfs_volume *vol = dir_ni->vol; 624*1e9ea7e0SNamjae Jeon struct super_block *sb = vol->sb; 625*1e9ea7e0SNamjae Jeon MFT_RECORD *m; 626*1e9ea7e0SNamjae Jeon INDEX_ROOT *ir; 627*1e9ea7e0SNamjae Jeon INDEX_ENTRY *ie; 628*1e9ea7e0SNamjae Jeon INDEX_ALLOCATION *ia; 629*1e9ea7e0SNamjae Jeon u8 *index_end; 630*1e9ea7e0SNamjae Jeon u64 mref; 631*1e9ea7e0SNamjae Jeon ntfs_attr_search_ctx *ctx; 632*1e9ea7e0SNamjae Jeon int err, rc; 633*1e9ea7e0SNamjae Jeon IGNORE_CASE_BOOL ic; 634*1e9ea7e0SNamjae Jeon VCN vcn, old_vcn; 635*1e9ea7e0SNamjae Jeon struct address_space *ia_mapping; 636*1e9ea7e0SNamjae Jeon struct page *page; 637*1e9ea7e0SNamjae Jeon u8 *kaddr; 638*1e9ea7e0SNamjae Jeon 639*1e9ea7e0SNamjae Jeon /* Get hold of the mft record for the directory. */ 640*1e9ea7e0SNamjae Jeon m = map_mft_record(dir_ni); 641*1e9ea7e0SNamjae Jeon if (IS_ERR(m)) { 642*1e9ea7e0SNamjae Jeon ntfs_error(sb, "map_mft_record() failed with error code %ld.", 643*1e9ea7e0SNamjae Jeon -PTR_ERR(m)); 644*1e9ea7e0SNamjae Jeon return ERR_MREF(PTR_ERR(m)); 645*1e9ea7e0SNamjae Jeon } 646*1e9ea7e0SNamjae Jeon ctx = ntfs_attr_get_search_ctx(dir_ni, m); 647*1e9ea7e0SNamjae Jeon if (!ctx) { 648*1e9ea7e0SNamjae Jeon err = -ENOMEM; 649*1e9ea7e0SNamjae Jeon goto err_out; 650*1e9ea7e0SNamjae Jeon } 651*1e9ea7e0SNamjae Jeon /* Find the index root attribute in the mft record. */ 652*1e9ea7e0SNamjae Jeon err = ntfs_attr_lookup(AT_INDEX_ROOT, I30, 4, CASE_SENSITIVE, 0, NULL, 653*1e9ea7e0SNamjae Jeon 0, ctx); 654*1e9ea7e0SNamjae Jeon if (unlikely(err)) { 655*1e9ea7e0SNamjae Jeon if (err == -ENOENT) { 656*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Index root attribute missing in " 657*1e9ea7e0SNamjae Jeon "directory inode 0x%lx.", 658*1e9ea7e0SNamjae Jeon dir_ni->mft_no); 659*1e9ea7e0SNamjae Jeon err = -EIO; 660*1e9ea7e0SNamjae Jeon } 661*1e9ea7e0SNamjae Jeon goto err_out; 662*1e9ea7e0SNamjae Jeon } 663*1e9ea7e0SNamjae Jeon /* Get to the index root value (it's been verified in read_inode). */ 664*1e9ea7e0SNamjae Jeon ir = (INDEX_ROOT*)((u8*)ctx->attr + 665*1e9ea7e0SNamjae Jeon le16_to_cpu(ctx->attr->data.resident.value_offset)); 666*1e9ea7e0SNamjae Jeon index_end = (u8*)&ir->index + le32_to_cpu(ir->index.index_length); 667*1e9ea7e0SNamjae Jeon /* The first index entry. */ 668*1e9ea7e0SNamjae Jeon ie = (INDEX_ENTRY*)((u8*)&ir->index + 669*1e9ea7e0SNamjae Jeon le32_to_cpu(ir->index.entries_offset)); 670*1e9ea7e0SNamjae Jeon /* 671*1e9ea7e0SNamjae Jeon * Loop until we exceed valid memory (corruption case) or until we 672*1e9ea7e0SNamjae Jeon * reach the last entry. 673*1e9ea7e0SNamjae Jeon */ 674*1e9ea7e0SNamjae Jeon for (;; ie = (INDEX_ENTRY*)((u8*)ie + le16_to_cpu(ie->length))) { 675*1e9ea7e0SNamjae Jeon /* Bounds checks. */ 676*1e9ea7e0SNamjae Jeon if ((u8*)ie < (u8*)ctx->mrec || (u8*)ie + 677*1e9ea7e0SNamjae Jeon sizeof(INDEX_ENTRY_HEADER) > index_end || 678*1e9ea7e0SNamjae Jeon (u8*)ie + le16_to_cpu(ie->key_length) > 679*1e9ea7e0SNamjae Jeon index_end) 680*1e9ea7e0SNamjae Jeon goto dir_err_out; 681*1e9ea7e0SNamjae Jeon /* 682*1e9ea7e0SNamjae Jeon * The last entry cannot contain a name. It can however contain 683*1e9ea7e0SNamjae Jeon * a pointer to a child node in the B+tree so we just break out. 684*1e9ea7e0SNamjae Jeon */ 685*1e9ea7e0SNamjae Jeon if (ie->flags & INDEX_ENTRY_END) 686*1e9ea7e0SNamjae Jeon break; 687*1e9ea7e0SNamjae Jeon /* 688*1e9ea7e0SNamjae Jeon * If the current entry has a name type of POSIX, the name is 689*1e9ea7e0SNamjae Jeon * case sensitive and not otherwise. This has the effect of us 690*1e9ea7e0SNamjae Jeon * not being able to access any POSIX file names which collate 691*1e9ea7e0SNamjae Jeon * after the non-POSIX one when they only differ in case, but 692*1e9ea7e0SNamjae Jeon * anyone doing screwy stuff like that deserves to burn in 693*1e9ea7e0SNamjae Jeon * hell... Doing that kind of stuff on NT4 actually causes 694*1e9ea7e0SNamjae Jeon * corruption on the partition even when using SP6a and Linux 695*1e9ea7e0SNamjae Jeon * is not involved at all. 696*1e9ea7e0SNamjae Jeon */ 697*1e9ea7e0SNamjae Jeon ic = ie->key.file_name.file_name_type ? IGNORE_CASE : 698*1e9ea7e0SNamjae Jeon CASE_SENSITIVE; 699*1e9ea7e0SNamjae Jeon /* 700*1e9ea7e0SNamjae Jeon * If the names match perfectly, we are done and return the 701*1e9ea7e0SNamjae Jeon * mft reference of the inode (i.e. the inode number together 702*1e9ea7e0SNamjae Jeon * with the sequence number for consistency checking. We 703*1e9ea7e0SNamjae Jeon * convert it to cpu format before returning. 704*1e9ea7e0SNamjae Jeon */ 705*1e9ea7e0SNamjae Jeon if (ntfs_are_names_equal(uname, uname_len, 706*1e9ea7e0SNamjae Jeon (ntfschar*)&ie->key.file_name.file_name, 707*1e9ea7e0SNamjae Jeon ie->key.file_name.file_name_length, ic, 708*1e9ea7e0SNamjae Jeon vol->upcase, vol->upcase_len)) { 709*1e9ea7e0SNamjae Jeon found_it: 710*1e9ea7e0SNamjae Jeon mref = le64_to_cpu(ie->data.dir.indexed_file); 711*1e9ea7e0SNamjae Jeon ntfs_attr_put_search_ctx(ctx); 712*1e9ea7e0SNamjae Jeon unmap_mft_record(dir_ni); 713*1e9ea7e0SNamjae Jeon return mref; 714*1e9ea7e0SNamjae Jeon } 715*1e9ea7e0SNamjae Jeon /* 716*1e9ea7e0SNamjae Jeon * Not a perfect match, need to do full blown collation so we 717*1e9ea7e0SNamjae Jeon * know which way in the B+tree we have to go. 718*1e9ea7e0SNamjae Jeon */ 719*1e9ea7e0SNamjae Jeon rc = ntfs_collate_names(uname, uname_len, 720*1e9ea7e0SNamjae Jeon (ntfschar*)&ie->key.file_name.file_name, 721*1e9ea7e0SNamjae Jeon ie->key.file_name.file_name_length, 1, 722*1e9ea7e0SNamjae Jeon IGNORE_CASE, vol->upcase, vol->upcase_len); 723*1e9ea7e0SNamjae Jeon /* 724*1e9ea7e0SNamjae Jeon * If uname collates before the name of the current entry, there 725*1e9ea7e0SNamjae Jeon * is definitely no such name in this index but we might need to 726*1e9ea7e0SNamjae Jeon * descend into the B+tree so we just break out of the loop. 727*1e9ea7e0SNamjae Jeon */ 728*1e9ea7e0SNamjae Jeon if (rc == -1) 729*1e9ea7e0SNamjae Jeon break; 730*1e9ea7e0SNamjae Jeon /* The names are not equal, continue the search. */ 731*1e9ea7e0SNamjae Jeon if (rc) 732*1e9ea7e0SNamjae Jeon continue; 733*1e9ea7e0SNamjae Jeon /* 734*1e9ea7e0SNamjae Jeon * Names match with case insensitive comparison, now try the 735*1e9ea7e0SNamjae Jeon * case sensitive comparison, which is required for proper 736*1e9ea7e0SNamjae Jeon * collation. 737*1e9ea7e0SNamjae Jeon */ 738*1e9ea7e0SNamjae Jeon rc = ntfs_collate_names(uname, uname_len, 739*1e9ea7e0SNamjae Jeon (ntfschar*)&ie->key.file_name.file_name, 740*1e9ea7e0SNamjae Jeon ie->key.file_name.file_name_length, 1, 741*1e9ea7e0SNamjae Jeon CASE_SENSITIVE, vol->upcase, vol->upcase_len); 742*1e9ea7e0SNamjae Jeon if (rc == -1) 743*1e9ea7e0SNamjae Jeon break; 744*1e9ea7e0SNamjae Jeon if (rc) 745*1e9ea7e0SNamjae Jeon continue; 746*1e9ea7e0SNamjae Jeon /* 747*1e9ea7e0SNamjae Jeon * Perfect match, this will never happen as the 748*1e9ea7e0SNamjae Jeon * ntfs_are_names_equal() call will have gotten a match but we 749*1e9ea7e0SNamjae Jeon * still treat it correctly. 750*1e9ea7e0SNamjae Jeon */ 751*1e9ea7e0SNamjae Jeon goto found_it; 752*1e9ea7e0SNamjae Jeon } 753*1e9ea7e0SNamjae Jeon /* 754*1e9ea7e0SNamjae Jeon * We have finished with this index without success. Check for the 755*1e9ea7e0SNamjae Jeon * presence of a child node. 756*1e9ea7e0SNamjae Jeon */ 757*1e9ea7e0SNamjae Jeon if (!(ie->flags & INDEX_ENTRY_NODE)) { 758*1e9ea7e0SNamjae Jeon /* No child node, return -ENOENT. */ 759*1e9ea7e0SNamjae Jeon err = -ENOENT; 760*1e9ea7e0SNamjae Jeon goto err_out; 761*1e9ea7e0SNamjae Jeon } /* Child node present, descend into it. */ 762*1e9ea7e0SNamjae Jeon /* Consistency check: Verify that an index allocation exists. */ 763*1e9ea7e0SNamjae Jeon if (!NInoIndexAllocPresent(dir_ni)) { 764*1e9ea7e0SNamjae Jeon ntfs_error(sb, "No index allocation attribute but index entry " 765*1e9ea7e0SNamjae Jeon "requires one. Directory inode 0x%lx is " 766*1e9ea7e0SNamjae Jeon "corrupt or driver bug.", dir_ni->mft_no); 767*1e9ea7e0SNamjae Jeon goto err_out; 768*1e9ea7e0SNamjae Jeon } 769*1e9ea7e0SNamjae Jeon /* Get the starting vcn of the index_block holding the child node. */ 770*1e9ea7e0SNamjae Jeon vcn = sle64_to_cpup((u8*)ie + le16_to_cpu(ie->length) - 8); 771*1e9ea7e0SNamjae Jeon ia_mapping = VFS_I(dir_ni)->i_mapping; 772*1e9ea7e0SNamjae Jeon /* 773*1e9ea7e0SNamjae Jeon * We are done with the index root and the mft record. Release them, 774*1e9ea7e0SNamjae Jeon * otherwise we deadlock with ntfs_map_page(). 775*1e9ea7e0SNamjae Jeon */ 776*1e9ea7e0SNamjae Jeon ntfs_attr_put_search_ctx(ctx); 777*1e9ea7e0SNamjae Jeon unmap_mft_record(dir_ni); 778*1e9ea7e0SNamjae Jeon m = NULL; 779*1e9ea7e0SNamjae Jeon ctx = NULL; 780*1e9ea7e0SNamjae Jeon descend_into_child_node: 781*1e9ea7e0SNamjae Jeon /* 782*1e9ea7e0SNamjae Jeon * Convert vcn to index into the index allocation attribute in units 783*1e9ea7e0SNamjae Jeon * of PAGE_SIZE and map the page cache page, reading it from 784*1e9ea7e0SNamjae Jeon * disk if necessary. 785*1e9ea7e0SNamjae Jeon */ 786*1e9ea7e0SNamjae Jeon page = ntfs_map_page(ia_mapping, vcn << 787*1e9ea7e0SNamjae Jeon dir_ni->itype.index.vcn_size_bits >> PAGE_SHIFT); 788*1e9ea7e0SNamjae Jeon if (IS_ERR(page)) { 789*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Failed to map directory index page, error %ld.", 790*1e9ea7e0SNamjae Jeon -PTR_ERR(page)); 791*1e9ea7e0SNamjae Jeon err = PTR_ERR(page); 792*1e9ea7e0SNamjae Jeon goto err_out; 793*1e9ea7e0SNamjae Jeon } 794*1e9ea7e0SNamjae Jeon lock_page(page); 795*1e9ea7e0SNamjae Jeon kaddr = (u8*)page_address(page); 796*1e9ea7e0SNamjae Jeon fast_descend_into_child_node: 797*1e9ea7e0SNamjae Jeon /* Get to the index allocation block. */ 798*1e9ea7e0SNamjae Jeon ia = (INDEX_ALLOCATION*)(kaddr + ((vcn << 799*1e9ea7e0SNamjae Jeon dir_ni->itype.index.vcn_size_bits) & ~PAGE_MASK)); 800*1e9ea7e0SNamjae Jeon /* Bounds checks. */ 801*1e9ea7e0SNamjae Jeon if ((u8*)ia < kaddr || (u8*)ia > kaddr + PAGE_SIZE) { 802*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Out of bounds check failed. Corrupt directory " 803*1e9ea7e0SNamjae Jeon "inode 0x%lx or driver bug.", dir_ni->mft_no); 804*1e9ea7e0SNamjae Jeon goto unm_err_out; 805*1e9ea7e0SNamjae Jeon } 806*1e9ea7e0SNamjae Jeon /* Catch multi sector transfer fixup errors. */ 807*1e9ea7e0SNamjae Jeon if (unlikely(!ntfs_is_indx_record(ia->magic))) { 808*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Directory index record with vcn 0x%llx is " 809*1e9ea7e0SNamjae Jeon "corrupt. Corrupt inode 0x%lx. Run chkdsk.", 810*1e9ea7e0SNamjae Jeon (unsigned long long)vcn, dir_ni->mft_no); 811*1e9ea7e0SNamjae Jeon goto unm_err_out; 812*1e9ea7e0SNamjae Jeon } 813*1e9ea7e0SNamjae Jeon if (sle64_to_cpu(ia->index_block_vcn) != vcn) { 814*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Actual VCN (0x%llx) of index buffer is " 815*1e9ea7e0SNamjae Jeon "different from expected VCN (0x%llx). " 816*1e9ea7e0SNamjae Jeon "Directory inode 0x%lx is corrupt or driver " 817*1e9ea7e0SNamjae Jeon "bug.", (unsigned long long) 818*1e9ea7e0SNamjae Jeon sle64_to_cpu(ia->index_block_vcn), 819*1e9ea7e0SNamjae Jeon (unsigned long long)vcn, dir_ni->mft_no); 820*1e9ea7e0SNamjae Jeon goto unm_err_out; 821*1e9ea7e0SNamjae Jeon } 822*1e9ea7e0SNamjae Jeon if (le32_to_cpu(ia->index.allocated_size) + 0x18 != 823*1e9ea7e0SNamjae Jeon dir_ni->itype.index.block_size) { 824*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Index buffer (VCN 0x%llx) of directory inode " 825*1e9ea7e0SNamjae Jeon "0x%lx has a size (%u) differing from the " 826*1e9ea7e0SNamjae Jeon "directory specified size (%u). Directory " 827*1e9ea7e0SNamjae Jeon "inode is corrupt or driver bug.", 828*1e9ea7e0SNamjae Jeon (unsigned long long)vcn, dir_ni->mft_no, 829*1e9ea7e0SNamjae Jeon le32_to_cpu(ia->index.allocated_size) + 0x18, 830*1e9ea7e0SNamjae Jeon dir_ni->itype.index.block_size); 831*1e9ea7e0SNamjae Jeon goto unm_err_out; 832*1e9ea7e0SNamjae Jeon } 833*1e9ea7e0SNamjae Jeon index_end = (u8*)ia + dir_ni->itype.index.block_size; 834*1e9ea7e0SNamjae Jeon if (index_end > kaddr + PAGE_SIZE) { 835*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Index buffer (VCN 0x%llx) of directory inode " 836*1e9ea7e0SNamjae Jeon "0x%lx crosses page boundary. Impossible! " 837*1e9ea7e0SNamjae Jeon "Cannot access! This is probably a bug in the " 838*1e9ea7e0SNamjae Jeon "driver.", (unsigned long long)vcn, 839*1e9ea7e0SNamjae Jeon dir_ni->mft_no); 840*1e9ea7e0SNamjae Jeon goto unm_err_out; 841*1e9ea7e0SNamjae Jeon } 842*1e9ea7e0SNamjae Jeon index_end = (u8*)&ia->index + le32_to_cpu(ia->index.index_length); 843*1e9ea7e0SNamjae Jeon if (index_end > (u8*)ia + dir_ni->itype.index.block_size) { 844*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Size of index buffer (VCN 0x%llx) of directory " 845*1e9ea7e0SNamjae Jeon "inode 0x%lx exceeds maximum size.", 846*1e9ea7e0SNamjae Jeon (unsigned long long)vcn, dir_ni->mft_no); 847*1e9ea7e0SNamjae Jeon goto unm_err_out; 848*1e9ea7e0SNamjae Jeon } 849*1e9ea7e0SNamjae Jeon /* The first index entry. */ 850*1e9ea7e0SNamjae Jeon ie = (INDEX_ENTRY*)((u8*)&ia->index + 851*1e9ea7e0SNamjae Jeon le32_to_cpu(ia->index.entries_offset)); 852*1e9ea7e0SNamjae Jeon /* 853*1e9ea7e0SNamjae Jeon * Iterate similar to above big loop but applied to index buffer, thus 854*1e9ea7e0SNamjae Jeon * loop until we exceed valid memory (corruption case) or until we 855*1e9ea7e0SNamjae Jeon * reach the last entry. 856*1e9ea7e0SNamjae Jeon */ 857*1e9ea7e0SNamjae Jeon for (;; ie = (INDEX_ENTRY*)((u8*)ie + le16_to_cpu(ie->length))) { 858*1e9ea7e0SNamjae Jeon /* Bounds check. */ 859*1e9ea7e0SNamjae Jeon if ((u8*)ie < (u8*)ia || (u8*)ie + 860*1e9ea7e0SNamjae Jeon sizeof(INDEX_ENTRY_HEADER) > index_end || 861*1e9ea7e0SNamjae Jeon (u8*)ie + le16_to_cpu(ie->key_length) > 862*1e9ea7e0SNamjae Jeon index_end) { 863*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Index entry out of bounds in " 864*1e9ea7e0SNamjae Jeon "directory inode 0x%lx.", 865*1e9ea7e0SNamjae Jeon dir_ni->mft_no); 866*1e9ea7e0SNamjae Jeon goto unm_err_out; 867*1e9ea7e0SNamjae Jeon } 868*1e9ea7e0SNamjae Jeon /* 869*1e9ea7e0SNamjae Jeon * The last entry cannot contain a name. It can however contain 870*1e9ea7e0SNamjae Jeon * a pointer to a child node in the B+tree so we just break out. 871*1e9ea7e0SNamjae Jeon */ 872*1e9ea7e0SNamjae Jeon if (ie->flags & INDEX_ENTRY_END) 873*1e9ea7e0SNamjae Jeon break; 874*1e9ea7e0SNamjae Jeon /* 875*1e9ea7e0SNamjae Jeon * If the current entry has a name type of POSIX, the name is 876*1e9ea7e0SNamjae Jeon * case sensitive and not otherwise. This has the effect of us 877*1e9ea7e0SNamjae Jeon * not being able to access any POSIX file names which collate 878*1e9ea7e0SNamjae Jeon * after the non-POSIX one when they only differ in case, but 879*1e9ea7e0SNamjae Jeon * anyone doing screwy stuff like that deserves to burn in 880*1e9ea7e0SNamjae Jeon * hell... Doing that kind of stuff on NT4 actually causes 881*1e9ea7e0SNamjae Jeon * corruption on the partition even when using SP6a and Linux 882*1e9ea7e0SNamjae Jeon * is not involved at all. 883*1e9ea7e0SNamjae Jeon */ 884*1e9ea7e0SNamjae Jeon ic = ie->key.file_name.file_name_type ? IGNORE_CASE : 885*1e9ea7e0SNamjae Jeon CASE_SENSITIVE; 886*1e9ea7e0SNamjae Jeon /* 887*1e9ea7e0SNamjae Jeon * If the names match perfectly, we are done and return the 888*1e9ea7e0SNamjae Jeon * mft reference of the inode (i.e. the inode number together 889*1e9ea7e0SNamjae Jeon * with the sequence number for consistency checking. We 890*1e9ea7e0SNamjae Jeon * convert it to cpu format before returning. 891*1e9ea7e0SNamjae Jeon */ 892*1e9ea7e0SNamjae Jeon if (ntfs_are_names_equal(uname, uname_len, 893*1e9ea7e0SNamjae Jeon (ntfschar*)&ie->key.file_name.file_name, 894*1e9ea7e0SNamjae Jeon ie->key.file_name.file_name_length, ic, 895*1e9ea7e0SNamjae Jeon vol->upcase, vol->upcase_len)) { 896*1e9ea7e0SNamjae Jeon found_it2: 897*1e9ea7e0SNamjae Jeon mref = le64_to_cpu(ie->data.dir.indexed_file); 898*1e9ea7e0SNamjae Jeon unlock_page(page); 899*1e9ea7e0SNamjae Jeon ntfs_unmap_page(page); 900*1e9ea7e0SNamjae Jeon return mref; 901*1e9ea7e0SNamjae Jeon } 902*1e9ea7e0SNamjae Jeon /* 903*1e9ea7e0SNamjae Jeon * Not a perfect match, need to do full blown collation so we 904*1e9ea7e0SNamjae Jeon * know which way in the B+tree we have to go. 905*1e9ea7e0SNamjae Jeon */ 906*1e9ea7e0SNamjae Jeon rc = ntfs_collate_names(uname, uname_len, 907*1e9ea7e0SNamjae Jeon (ntfschar*)&ie->key.file_name.file_name, 908*1e9ea7e0SNamjae Jeon ie->key.file_name.file_name_length, 1, 909*1e9ea7e0SNamjae Jeon IGNORE_CASE, vol->upcase, vol->upcase_len); 910*1e9ea7e0SNamjae Jeon /* 911*1e9ea7e0SNamjae Jeon * If uname collates before the name of the current entry, there 912*1e9ea7e0SNamjae Jeon * is definitely no such name in this index but we might need to 913*1e9ea7e0SNamjae Jeon * descend into the B+tree so we just break out of the loop. 914*1e9ea7e0SNamjae Jeon */ 915*1e9ea7e0SNamjae Jeon if (rc == -1) 916*1e9ea7e0SNamjae Jeon break; 917*1e9ea7e0SNamjae Jeon /* The names are not equal, continue the search. */ 918*1e9ea7e0SNamjae Jeon if (rc) 919*1e9ea7e0SNamjae Jeon continue; 920*1e9ea7e0SNamjae Jeon /* 921*1e9ea7e0SNamjae Jeon * Names match with case insensitive comparison, now try the 922*1e9ea7e0SNamjae Jeon * case sensitive comparison, which is required for proper 923*1e9ea7e0SNamjae Jeon * collation. 924*1e9ea7e0SNamjae Jeon */ 925*1e9ea7e0SNamjae Jeon rc = ntfs_collate_names(uname, uname_len, 926*1e9ea7e0SNamjae Jeon (ntfschar*)&ie->key.file_name.file_name, 927*1e9ea7e0SNamjae Jeon ie->key.file_name.file_name_length, 1, 928*1e9ea7e0SNamjae Jeon CASE_SENSITIVE, vol->upcase, vol->upcase_len); 929*1e9ea7e0SNamjae Jeon if (rc == -1) 930*1e9ea7e0SNamjae Jeon break; 931*1e9ea7e0SNamjae Jeon if (rc) 932*1e9ea7e0SNamjae Jeon continue; 933*1e9ea7e0SNamjae Jeon /* 934*1e9ea7e0SNamjae Jeon * Perfect match, this will never happen as the 935*1e9ea7e0SNamjae Jeon * ntfs_are_names_equal() call will have gotten a match but we 936*1e9ea7e0SNamjae Jeon * still treat it correctly. 937*1e9ea7e0SNamjae Jeon */ 938*1e9ea7e0SNamjae Jeon goto found_it2; 939*1e9ea7e0SNamjae Jeon } 940*1e9ea7e0SNamjae Jeon /* 941*1e9ea7e0SNamjae Jeon * We have finished with this index buffer without success. Check for 942*1e9ea7e0SNamjae Jeon * the presence of a child node. 943*1e9ea7e0SNamjae Jeon */ 944*1e9ea7e0SNamjae Jeon if (ie->flags & INDEX_ENTRY_NODE) { 945*1e9ea7e0SNamjae Jeon if ((ia->index.flags & NODE_MASK) == LEAF_NODE) { 946*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Index entry with child node found in " 947*1e9ea7e0SNamjae Jeon "a leaf node in directory inode 0x%lx.", 948*1e9ea7e0SNamjae Jeon dir_ni->mft_no); 949*1e9ea7e0SNamjae Jeon goto unm_err_out; 950*1e9ea7e0SNamjae Jeon } 951*1e9ea7e0SNamjae Jeon /* Child node present, descend into it. */ 952*1e9ea7e0SNamjae Jeon old_vcn = vcn; 953*1e9ea7e0SNamjae Jeon vcn = sle64_to_cpup((u8*)ie + le16_to_cpu(ie->length) - 8); 954*1e9ea7e0SNamjae Jeon if (vcn >= 0) { 955*1e9ea7e0SNamjae Jeon /* If vcn is in the same page cache page as old_vcn we 956*1e9ea7e0SNamjae Jeon * recycle the mapped page. */ 957*1e9ea7e0SNamjae Jeon if (old_vcn << vol->cluster_size_bits >> 958*1e9ea7e0SNamjae Jeon PAGE_SHIFT == vcn << 959*1e9ea7e0SNamjae Jeon vol->cluster_size_bits >> 960*1e9ea7e0SNamjae Jeon PAGE_SHIFT) 961*1e9ea7e0SNamjae Jeon goto fast_descend_into_child_node; 962*1e9ea7e0SNamjae Jeon unlock_page(page); 963*1e9ea7e0SNamjae Jeon ntfs_unmap_page(page); 964*1e9ea7e0SNamjae Jeon goto descend_into_child_node; 965*1e9ea7e0SNamjae Jeon } 966*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Negative child node vcn in directory inode " 967*1e9ea7e0SNamjae Jeon "0x%lx.", dir_ni->mft_no); 968*1e9ea7e0SNamjae Jeon goto unm_err_out; 969*1e9ea7e0SNamjae Jeon } 970*1e9ea7e0SNamjae Jeon /* No child node, return -ENOENT. */ 971*1e9ea7e0SNamjae Jeon ntfs_debug("Entry not found."); 972*1e9ea7e0SNamjae Jeon err = -ENOENT; 973*1e9ea7e0SNamjae Jeon unm_err_out: 974*1e9ea7e0SNamjae Jeon unlock_page(page); 975*1e9ea7e0SNamjae Jeon ntfs_unmap_page(page); 976*1e9ea7e0SNamjae Jeon err_out: 977*1e9ea7e0SNamjae Jeon if (!err) 978*1e9ea7e0SNamjae Jeon err = -EIO; 979*1e9ea7e0SNamjae Jeon if (ctx) 980*1e9ea7e0SNamjae Jeon ntfs_attr_put_search_ctx(ctx); 981*1e9ea7e0SNamjae Jeon if (m) 982*1e9ea7e0SNamjae Jeon unmap_mft_record(dir_ni); 983*1e9ea7e0SNamjae Jeon return ERR_MREF(err); 984*1e9ea7e0SNamjae Jeon dir_err_out: 985*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Corrupt directory. Aborting lookup."); 986*1e9ea7e0SNamjae Jeon goto err_out; 987*1e9ea7e0SNamjae Jeon } 988*1e9ea7e0SNamjae Jeon 989*1e9ea7e0SNamjae Jeon #endif 990*1e9ea7e0SNamjae Jeon 991*1e9ea7e0SNamjae Jeon /** 992*1e9ea7e0SNamjae Jeon * ntfs_filldir - ntfs specific filldir method 993*1e9ea7e0SNamjae Jeon * @vol: current ntfs volume 994*1e9ea7e0SNamjae Jeon * @ndir: ntfs inode of current directory 995*1e9ea7e0SNamjae Jeon * @ia_page: page in which the index allocation buffer @ie is in resides 996*1e9ea7e0SNamjae Jeon * @ie: current index entry 997*1e9ea7e0SNamjae Jeon * @name: buffer to use for the converted name 998*1e9ea7e0SNamjae Jeon * @actor: what to feed the entries to 999*1e9ea7e0SNamjae Jeon * 1000*1e9ea7e0SNamjae Jeon * Convert the Unicode @name to the loaded NLS and pass it to the @filldir 1001*1e9ea7e0SNamjae Jeon * callback. 1002*1e9ea7e0SNamjae Jeon * 1003*1e9ea7e0SNamjae Jeon * If @ia_page is not NULL it is the locked page containing the index 1004*1e9ea7e0SNamjae Jeon * allocation block containing the index entry @ie. 1005*1e9ea7e0SNamjae Jeon * 1006*1e9ea7e0SNamjae Jeon * Note, we drop (and then reacquire) the page lock on @ia_page across the 1007*1e9ea7e0SNamjae Jeon * @filldir() call otherwise we would deadlock with NFSd when it calls ->lookup 1008*1e9ea7e0SNamjae Jeon * since ntfs_lookup() will lock the same page. As an optimization, we do not 1009*1e9ea7e0SNamjae Jeon * retake the lock if we are returning a non-zero value as ntfs_readdir() 1010*1e9ea7e0SNamjae Jeon * would need to drop the lock immediately anyway. 1011*1e9ea7e0SNamjae Jeon */ 1012*1e9ea7e0SNamjae Jeon static inline int ntfs_filldir(ntfs_volume *vol, 1013*1e9ea7e0SNamjae Jeon ntfs_inode *ndir, struct page *ia_page, INDEX_ENTRY *ie, 1014*1e9ea7e0SNamjae Jeon u8 *name, struct dir_context *actor) 1015*1e9ea7e0SNamjae Jeon { 1016*1e9ea7e0SNamjae Jeon unsigned long mref; 1017*1e9ea7e0SNamjae Jeon int name_len; 1018*1e9ea7e0SNamjae Jeon unsigned dt_type; 1019*1e9ea7e0SNamjae Jeon FILE_NAME_TYPE_FLAGS name_type; 1020*1e9ea7e0SNamjae Jeon 1021*1e9ea7e0SNamjae Jeon name_type = ie->key.file_name.file_name_type; 1022*1e9ea7e0SNamjae Jeon if (name_type == FILE_NAME_DOS) { 1023*1e9ea7e0SNamjae Jeon ntfs_debug("Skipping DOS name space entry."); 1024*1e9ea7e0SNamjae Jeon return 0; 1025*1e9ea7e0SNamjae Jeon } 1026*1e9ea7e0SNamjae Jeon if (MREF_LE(ie->data.dir.indexed_file) == FILE_root) { 1027*1e9ea7e0SNamjae Jeon ntfs_debug("Skipping root directory self reference entry."); 1028*1e9ea7e0SNamjae Jeon return 0; 1029*1e9ea7e0SNamjae Jeon } 1030*1e9ea7e0SNamjae Jeon if (MREF_LE(ie->data.dir.indexed_file) < FILE_first_user && 1031*1e9ea7e0SNamjae Jeon !NVolShowSystemFiles(vol)) { 1032*1e9ea7e0SNamjae Jeon ntfs_debug("Skipping system file."); 1033*1e9ea7e0SNamjae Jeon return 0; 1034*1e9ea7e0SNamjae Jeon } 1035*1e9ea7e0SNamjae Jeon name_len = ntfs_ucstonls(vol, (ntfschar*)&ie->key.file_name.file_name, 1036*1e9ea7e0SNamjae Jeon ie->key.file_name.file_name_length, &name, 1037*1e9ea7e0SNamjae Jeon NTFS_MAX_NAME_LEN * NLS_MAX_CHARSET_SIZE + 1); 1038*1e9ea7e0SNamjae Jeon if (name_len <= 0) { 1039*1e9ea7e0SNamjae Jeon ntfs_warning(vol->sb, "Skipping unrepresentable inode 0x%llx.", 1040*1e9ea7e0SNamjae Jeon (long long)MREF_LE(ie->data.dir.indexed_file)); 1041*1e9ea7e0SNamjae Jeon return 0; 1042*1e9ea7e0SNamjae Jeon } 1043*1e9ea7e0SNamjae Jeon if (ie->key.file_name.file_attributes & 1044*1e9ea7e0SNamjae Jeon FILE_ATTR_DUP_FILE_NAME_INDEX_PRESENT) 1045*1e9ea7e0SNamjae Jeon dt_type = DT_DIR; 1046*1e9ea7e0SNamjae Jeon else 1047*1e9ea7e0SNamjae Jeon dt_type = DT_REG; 1048*1e9ea7e0SNamjae Jeon mref = MREF_LE(ie->data.dir.indexed_file); 1049*1e9ea7e0SNamjae Jeon /* 1050*1e9ea7e0SNamjae Jeon * Drop the page lock otherwise we deadlock with NFS when it calls 1051*1e9ea7e0SNamjae Jeon * ->lookup since ntfs_lookup() will lock the same page. 1052*1e9ea7e0SNamjae Jeon */ 1053*1e9ea7e0SNamjae Jeon if (ia_page) 1054*1e9ea7e0SNamjae Jeon unlock_page(ia_page); 1055*1e9ea7e0SNamjae Jeon ntfs_debug("Calling filldir for %s with len %i, fpos 0x%llx, inode " 1056*1e9ea7e0SNamjae Jeon "0x%lx, DT_%s.", name, name_len, actor->pos, mref, 1057*1e9ea7e0SNamjae Jeon dt_type == DT_DIR ? "DIR" : "REG"); 1058*1e9ea7e0SNamjae Jeon if (!dir_emit(actor, name, name_len, mref, dt_type)) 1059*1e9ea7e0SNamjae Jeon return 1; 1060*1e9ea7e0SNamjae Jeon /* Relock the page but not if we are aborting ->readdir. */ 1061*1e9ea7e0SNamjae Jeon if (ia_page) 1062*1e9ea7e0SNamjae Jeon lock_page(ia_page); 1063*1e9ea7e0SNamjae Jeon return 0; 1064*1e9ea7e0SNamjae Jeon } 1065*1e9ea7e0SNamjae Jeon 1066*1e9ea7e0SNamjae Jeon /* 1067*1e9ea7e0SNamjae Jeon * We use the same basic approach as the old NTFS driver, i.e. we parse the 1068*1e9ea7e0SNamjae Jeon * index root entries and then the index allocation entries that are marked 1069*1e9ea7e0SNamjae Jeon * as in use in the index bitmap. 1070*1e9ea7e0SNamjae Jeon * 1071*1e9ea7e0SNamjae Jeon * While this will return the names in random order this doesn't matter for 1072*1e9ea7e0SNamjae Jeon * ->readdir but OTOH results in a faster ->readdir. 1073*1e9ea7e0SNamjae Jeon * 1074*1e9ea7e0SNamjae Jeon * VFS calls ->readdir without BKL but with i_mutex held. This protects the VFS 1075*1e9ea7e0SNamjae Jeon * parts (e.g. ->f_pos and ->i_size, and it also protects against directory 1076*1e9ea7e0SNamjae Jeon * modifications). 1077*1e9ea7e0SNamjae Jeon * 1078*1e9ea7e0SNamjae Jeon * Locking: - Caller must hold i_mutex on the directory. 1079*1e9ea7e0SNamjae Jeon * - Each page cache page in the index allocation mapping must be 1080*1e9ea7e0SNamjae Jeon * locked whilst being accessed otherwise we may find a corrupt 1081*1e9ea7e0SNamjae Jeon * page due to it being under ->writepage at the moment which 1082*1e9ea7e0SNamjae Jeon * applies the mst protection fixups before writing out and then 1083*1e9ea7e0SNamjae Jeon * removes them again after the write is complete after which it 1084*1e9ea7e0SNamjae Jeon * unlocks the page. 1085*1e9ea7e0SNamjae Jeon */ 1086*1e9ea7e0SNamjae Jeon static int ntfs_readdir(struct file *file, struct dir_context *actor) 1087*1e9ea7e0SNamjae Jeon { 1088*1e9ea7e0SNamjae Jeon s64 ia_pos, ia_start, prev_ia_pos, bmp_pos; 1089*1e9ea7e0SNamjae Jeon loff_t i_size; 1090*1e9ea7e0SNamjae Jeon struct inode *bmp_vi, *vdir = file_inode(file); 1091*1e9ea7e0SNamjae Jeon struct super_block *sb = vdir->i_sb; 1092*1e9ea7e0SNamjae Jeon ntfs_inode *ndir = NTFS_I(vdir); 1093*1e9ea7e0SNamjae Jeon ntfs_volume *vol = NTFS_SB(sb); 1094*1e9ea7e0SNamjae Jeon MFT_RECORD *m; 1095*1e9ea7e0SNamjae Jeon INDEX_ROOT *ir = NULL; 1096*1e9ea7e0SNamjae Jeon INDEX_ENTRY *ie; 1097*1e9ea7e0SNamjae Jeon INDEX_ALLOCATION *ia; 1098*1e9ea7e0SNamjae Jeon u8 *name = NULL; 1099*1e9ea7e0SNamjae Jeon int rc, err, ir_pos, cur_bmp_pos; 1100*1e9ea7e0SNamjae Jeon struct address_space *ia_mapping, *bmp_mapping; 1101*1e9ea7e0SNamjae Jeon struct page *bmp_page = NULL, *ia_page = NULL; 1102*1e9ea7e0SNamjae Jeon u8 *kaddr, *bmp, *index_end; 1103*1e9ea7e0SNamjae Jeon ntfs_attr_search_ctx *ctx; 1104*1e9ea7e0SNamjae Jeon 1105*1e9ea7e0SNamjae Jeon ntfs_debug("Entering for inode 0x%lx, fpos 0x%llx.", 1106*1e9ea7e0SNamjae Jeon vdir->i_ino, actor->pos); 1107*1e9ea7e0SNamjae Jeon rc = err = 0; 1108*1e9ea7e0SNamjae Jeon /* Are we at end of dir yet? */ 1109*1e9ea7e0SNamjae Jeon i_size = i_size_read(vdir); 1110*1e9ea7e0SNamjae Jeon if (actor->pos >= i_size + vol->mft_record_size) 1111*1e9ea7e0SNamjae Jeon return 0; 1112*1e9ea7e0SNamjae Jeon /* Emulate . and .. for all directories. */ 1113*1e9ea7e0SNamjae Jeon if (!dir_emit_dots(file, actor)) 1114*1e9ea7e0SNamjae Jeon return 0; 1115*1e9ea7e0SNamjae Jeon m = NULL; 1116*1e9ea7e0SNamjae Jeon ctx = NULL; 1117*1e9ea7e0SNamjae Jeon /* 1118*1e9ea7e0SNamjae Jeon * Allocate a buffer to store the current name being processed 1119*1e9ea7e0SNamjae Jeon * converted to format determined by current NLS. 1120*1e9ea7e0SNamjae Jeon */ 1121*1e9ea7e0SNamjae Jeon name = kmalloc(NTFS_MAX_NAME_LEN * NLS_MAX_CHARSET_SIZE + 1, GFP_NOFS); 1122*1e9ea7e0SNamjae Jeon if (unlikely(!name)) { 1123*1e9ea7e0SNamjae Jeon err = -ENOMEM; 1124*1e9ea7e0SNamjae Jeon goto err_out; 1125*1e9ea7e0SNamjae Jeon } 1126*1e9ea7e0SNamjae Jeon /* Are we jumping straight into the index allocation attribute? */ 1127*1e9ea7e0SNamjae Jeon if (actor->pos >= vol->mft_record_size) 1128*1e9ea7e0SNamjae Jeon goto skip_index_root; 1129*1e9ea7e0SNamjae Jeon /* Get hold of the mft record for the directory. */ 1130*1e9ea7e0SNamjae Jeon m = map_mft_record(ndir); 1131*1e9ea7e0SNamjae Jeon if (IS_ERR(m)) { 1132*1e9ea7e0SNamjae Jeon err = PTR_ERR(m); 1133*1e9ea7e0SNamjae Jeon m = NULL; 1134*1e9ea7e0SNamjae Jeon goto err_out; 1135*1e9ea7e0SNamjae Jeon } 1136*1e9ea7e0SNamjae Jeon ctx = ntfs_attr_get_search_ctx(ndir, m); 1137*1e9ea7e0SNamjae Jeon if (unlikely(!ctx)) { 1138*1e9ea7e0SNamjae Jeon err = -ENOMEM; 1139*1e9ea7e0SNamjae Jeon goto err_out; 1140*1e9ea7e0SNamjae Jeon } 1141*1e9ea7e0SNamjae Jeon /* Get the offset into the index root attribute. */ 1142*1e9ea7e0SNamjae Jeon ir_pos = (s64)actor->pos; 1143*1e9ea7e0SNamjae Jeon /* Find the index root attribute in the mft record. */ 1144*1e9ea7e0SNamjae Jeon err = ntfs_attr_lookup(AT_INDEX_ROOT, I30, 4, CASE_SENSITIVE, 0, NULL, 1145*1e9ea7e0SNamjae Jeon 0, ctx); 1146*1e9ea7e0SNamjae Jeon if (unlikely(err)) { 1147*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Index root attribute missing in directory " 1148*1e9ea7e0SNamjae Jeon "inode 0x%lx.", vdir->i_ino); 1149*1e9ea7e0SNamjae Jeon goto err_out; 1150*1e9ea7e0SNamjae Jeon } 1151*1e9ea7e0SNamjae Jeon /* 1152*1e9ea7e0SNamjae Jeon * Copy the index root attribute value to a buffer so that we can put 1153*1e9ea7e0SNamjae Jeon * the search context and unmap the mft record before calling the 1154*1e9ea7e0SNamjae Jeon * filldir() callback. We need to do this because of NFSd which calls 1155*1e9ea7e0SNamjae Jeon * ->lookup() from its filldir callback() and this causes NTFS to 1156*1e9ea7e0SNamjae Jeon * deadlock as ntfs_lookup() maps the mft record of the directory and 1157*1e9ea7e0SNamjae Jeon * we have got it mapped here already. The only solution is for us to 1158*1e9ea7e0SNamjae Jeon * unmap the mft record here so that a call to ntfs_lookup() is able to 1159*1e9ea7e0SNamjae Jeon * map the mft record without deadlocking. 1160*1e9ea7e0SNamjae Jeon */ 1161*1e9ea7e0SNamjae Jeon rc = le32_to_cpu(ctx->attr->data.resident.value_length); 1162*1e9ea7e0SNamjae Jeon ir = kmalloc(rc, GFP_NOFS); 1163*1e9ea7e0SNamjae Jeon if (unlikely(!ir)) { 1164*1e9ea7e0SNamjae Jeon err = -ENOMEM; 1165*1e9ea7e0SNamjae Jeon goto err_out; 1166*1e9ea7e0SNamjae Jeon } 1167*1e9ea7e0SNamjae Jeon /* Copy the index root value (it has been verified in read_inode). */ 1168*1e9ea7e0SNamjae Jeon memcpy(ir, (u8*)ctx->attr + 1169*1e9ea7e0SNamjae Jeon le16_to_cpu(ctx->attr->data.resident.value_offset), rc); 1170*1e9ea7e0SNamjae Jeon ntfs_attr_put_search_ctx(ctx); 1171*1e9ea7e0SNamjae Jeon unmap_mft_record(ndir); 1172*1e9ea7e0SNamjae Jeon ctx = NULL; 1173*1e9ea7e0SNamjae Jeon m = NULL; 1174*1e9ea7e0SNamjae Jeon index_end = (u8*)&ir->index + le32_to_cpu(ir->index.index_length); 1175*1e9ea7e0SNamjae Jeon /* The first index entry. */ 1176*1e9ea7e0SNamjae Jeon ie = (INDEX_ENTRY*)((u8*)&ir->index + 1177*1e9ea7e0SNamjae Jeon le32_to_cpu(ir->index.entries_offset)); 1178*1e9ea7e0SNamjae Jeon /* 1179*1e9ea7e0SNamjae Jeon * Loop until we exceed valid memory (corruption case) or until we 1180*1e9ea7e0SNamjae Jeon * reach the last entry or until filldir tells us it has had enough 1181*1e9ea7e0SNamjae Jeon * or signals an error (both covered by the rc test). 1182*1e9ea7e0SNamjae Jeon */ 1183*1e9ea7e0SNamjae Jeon for (;; ie = (INDEX_ENTRY*)((u8*)ie + le16_to_cpu(ie->length))) { 1184*1e9ea7e0SNamjae Jeon ntfs_debug("In index root, offset 0x%zx.", (u8*)ie - (u8*)ir); 1185*1e9ea7e0SNamjae Jeon /* Bounds checks. */ 1186*1e9ea7e0SNamjae Jeon if (unlikely((u8*)ie < (u8*)ir || (u8*)ie + 1187*1e9ea7e0SNamjae Jeon sizeof(INDEX_ENTRY_HEADER) > index_end || 1188*1e9ea7e0SNamjae Jeon (u8*)ie + le16_to_cpu(ie->key_length) > 1189*1e9ea7e0SNamjae Jeon index_end)) 1190*1e9ea7e0SNamjae Jeon goto err_out; 1191*1e9ea7e0SNamjae Jeon /* The last entry cannot contain a name. */ 1192*1e9ea7e0SNamjae Jeon if (ie->flags & INDEX_ENTRY_END) 1193*1e9ea7e0SNamjae Jeon break; 1194*1e9ea7e0SNamjae Jeon /* Skip index root entry if continuing previous readdir. */ 1195*1e9ea7e0SNamjae Jeon if (ir_pos > (u8*)ie - (u8*)ir) 1196*1e9ea7e0SNamjae Jeon continue; 1197*1e9ea7e0SNamjae Jeon /* Advance the position even if going to skip the entry. */ 1198*1e9ea7e0SNamjae Jeon actor->pos = (u8*)ie - (u8*)ir; 1199*1e9ea7e0SNamjae Jeon /* Submit the name to the filldir callback. */ 1200*1e9ea7e0SNamjae Jeon rc = ntfs_filldir(vol, ndir, NULL, ie, name, actor); 1201*1e9ea7e0SNamjae Jeon if (rc) { 1202*1e9ea7e0SNamjae Jeon kfree(ir); 1203*1e9ea7e0SNamjae Jeon goto abort; 1204*1e9ea7e0SNamjae Jeon } 1205*1e9ea7e0SNamjae Jeon } 1206*1e9ea7e0SNamjae Jeon /* We are done with the index root and can free the buffer. */ 1207*1e9ea7e0SNamjae Jeon kfree(ir); 1208*1e9ea7e0SNamjae Jeon ir = NULL; 1209*1e9ea7e0SNamjae Jeon /* If there is no index allocation attribute we are finished. */ 1210*1e9ea7e0SNamjae Jeon if (!NInoIndexAllocPresent(ndir)) 1211*1e9ea7e0SNamjae Jeon goto EOD; 1212*1e9ea7e0SNamjae Jeon /* Advance fpos to the beginning of the index allocation. */ 1213*1e9ea7e0SNamjae Jeon actor->pos = vol->mft_record_size; 1214*1e9ea7e0SNamjae Jeon skip_index_root: 1215*1e9ea7e0SNamjae Jeon kaddr = NULL; 1216*1e9ea7e0SNamjae Jeon prev_ia_pos = -1LL; 1217*1e9ea7e0SNamjae Jeon /* Get the offset into the index allocation attribute. */ 1218*1e9ea7e0SNamjae Jeon ia_pos = (s64)actor->pos - vol->mft_record_size; 1219*1e9ea7e0SNamjae Jeon ia_mapping = vdir->i_mapping; 1220*1e9ea7e0SNamjae Jeon ntfs_debug("Inode 0x%lx, getting index bitmap.", vdir->i_ino); 1221*1e9ea7e0SNamjae Jeon bmp_vi = ntfs_attr_iget(vdir, AT_BITMAP, I30, 4); 1222*1e9ea7e0SNamjae Jeon if (IS_ERR(bmp_vi)) { 1223*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Failed to get bitmap attribute."); 1224*1e9ea7e0SNamjae Jeon err = PTR_ERR(bmp_vi); 1225*1e9ea7e0SNamjae Jeon goto err_out; 1226*1e9ea7e0SNamjae Jeon } 1227*1e9ea7e0SNamjae Jeon bmp_mapping = bmp_vi->i_mapping; 1228*1e9ea7e0SNamjae Jeon /* Get the starting bitmap bit position and sanity check it. */ 1229*1e9ea7e0SNamjae Jeon bmp_pos = ia_pos >> ndir->itype.index.block_size_bits; 1230*1e9ea7e0SNamjae Jeon if (unlikely(bmp_pos >> 3 >= i_size_read(bmp_vi))) { 1231*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Current index allocation position exceeds " 1232*1e9ea7e0SNamjae Jeon "index bitmap size."); 1233*1e9ea7e0SNamjae Jeon goto iput_err_out; 1234*1e9ea7e0SNamjae Jeon } 1235*1e9ea7e0SNamjae Jeon /* Get the starting bit position in the current bitmap page. */ 1236*1e9ea7e0SNamjae Jeon cur_bmp_pos = bmp_pos & ((PAGE_SIZE * 8) - 1); 1237*1e9ea7e0SNamjae Jeon bmp_pos &= ~(u64)((PAGE_SIZE * 8) - 1); 1238*1e9ea7e0SNamjae Jeon get_next_bmp_page: 1239*1e9ea7e0SNamjae Jeon ntfs_debug("Reading bitmap with page index 0x%llx, bit ofs 0x%llx", 1240*1e9ea7e0SNamjae Jeon (unsigned long long)bmp_pos >> (3 + PAGE_SHIFT), 1241*1e9ea7e0SNamjae Jeon (unsigned long long)bmp_pos & 1242*1e9ea7e0SNamjae Jeon (unsigned long long)((PAGE_SIZE * 8) - 1)); 1243*1e9ea7e0SNamjae Jeon bmp_page = ntfs_map_page(bmp_mapping, 1244*1e9ea7e0SNamjae Jeon bmp_pos >> (3 + PAGE_SHIFT)); 1245*1e9ea7e0SNamjae Jeon if (IS_ERR(bmp_page)) { 1246*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Reading index bitmap failed."); 1247*1e9ea7e0SNamjae Jeon err = PTR_ERR(bmp_page); 1248*1e9ea7e0SNamjae Jeon bmp_page = NULL; 1249*1e9ea7e0SNamjae Jeon goto iput_err_out; 1250*1e9ea7e0SNamjae Jeon } 1251*1e9ea7e0SNamjae Jeon bmp = (u8*)page_address(bmp_page); 1252*1e9ea7e0SNamjae Jeon /* Find next index block in use. */ 1253*1e9ea7e0SNamjae Jeon while (!(bmp[cur_bmp_pos >> 3] & (1 << (cur_bmp_pos & 7)))) { 1254*1e9ea7e0SNamjae Jeon find_next_index_buffer: 1255*1e9ea7e0SNamjae Jeon cur_bmp_pos++; 1256*1e9ea7e0SNamjae Jeon /* 1257*1e9ea7e0SNamjae Jeon * If we have reached the end of the bitmap page, get the next 1258*1e9ea7e0SNamjae Jeon * page, and put away the old one. 1259*1e9ea7e0SNamjae Jeon */ 1260*1e9ea7e0SNamjae Jeon if (unlikely((cur_bmp_pos >> 3) >= PAGE_SIZE)) { 1261*1e9ea7e0SNamjae Jeon ntfs_unmap_page(bmp_page); 1262*1e9ea7e0SNamjae Jeon bmp_pos += PAGE_SIZE * 8; 1263*1e9ea7e0SNamjae Jeon cur_bmp_pos = 0; 1264*1e9ea7e0SNamjae Jeon goto get_next_bmp_page; 1265*1e9ea7e0SNamjae Jeon } 1266*1e9ea7e0SNamjae Jeon /* If we have reached the end of the bitmap, we are done. */ 1267*1e9ea7e0SNamjae Jeon if (unlikely(((bmp_pos + cur_bmp_pos) >> 3) >= i_size)) 1268*1e9ea7e0SNamjae Jeon goto unm_EOD; 1269*1e9ea7e0SNamjae Jeon ia_pos = (bmp_pos + cur_bmp_pos) << 1270*1e9ea7e0SNamjae Jeon ndir->itype.index.block_size_bits; 1271*1e9ea7e0SNamjae Jeon } 1272*1e9ea7e0SNamjae Jeon ntfs_debug("Handling index buffer 0x%llx.", 1273*1e9ea7e0SNamjae Jeon (unsigned long long)bmp_pos + cur_bmp_pos); 1274*1e9ea7e0SNamjae Jeon /* If the current index buffer is in the same page we reuse the page. */ 1275*1e9ea7e0SNamjae Jeon if ((prev_ia_pos & (s64)PAGE_MASK) != 1276*1e9ea7e0SNamjae Jeon (ia_pos & (s64)PAGE_MASK)) { 1277*1e9ea7e0SNamjae Jeon prev_ia_pos = ia_pos; 1278*1e9ea7e0SNamjae Jeon if (likely(ia_page != NULL)) { 1279*1e9ea7e0SNamjae Jeon unlock_page(ia_page); 1280*1e9ea7e0SNamjae Jeon ntfs_unmap_page(ia_page); 1281*1e9ea7e0SNamjae Jeon } 1282*1e9ea7e0SNamjae Jeon /* 1283*1e9ea7e0SNamjae Jeon * Map the page cache page containing the current ia_pos, 1284*1e9ea7e0SNamjae Jeon * reading it from disk if necessary. 1285*1e9ea7e0SNamjae Jeon */ 1286*1e9ea7e0SNamjae Jeon ia_page = ntfs_map_page(ia_mapping, ia_pos >> PAGE_SHIFT); 1287*1e9ea7e0SNamjae Jeon if (IS_ERR(ia_page)) { 1288*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Reading index allocation data failed."); 1289*1e9ea7e0SNamjae Jeon err = PTR_ERR(ia_page); 1290*1e9ea7e0SNamjae Jeon ia_page = NULL; 1291*1e9ea7e0SNamjae Jeon goto err_out; 1292*1e9ea7e0SNamjae Jeon } 1293*1e9ea7e0SNamjae Jeon lock_page(ia_page); 1294*1e9ea7e0SNamjae Jeon kaddr = (u8*)page_address(ia_page); 1295*1e9ea7e0SNamjae Jeon } 1296*1e9ea7e0SNamjae Jeon /* Get the current index buffer. */ 1297*1e9ea7e0SNamjae Jeon ia = (INDEX_ALLOCATION*)(kaddr + (ia_pos & ~PAGE_MASK & 1298*1e9ea7e0SNamjae Jeon ~(s64)(ndir->itype.index.block_size - 1))); 1299*1e9ea7e0SNamjae Jeon /* Bounds checks. */ 1300*1e9ea7e0SNamjae Jeon if (unlikely((u8*)ia < kaddr || (u8*)ia > kaddr + PAGE_SIZE)) { 1301*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Out of bounds check failed. Corrupt directory " 1302*1e9ea7e0SNamjae Jeon "inode 0x%lx or driver bug.", vdir->i_ino); 1303*1e9ea7e0SNamjae Jeon goto err_out; 1304*1e9ea7e0SNamjae Jeon } 1305*1e9ea7e0SNamjae Jeon /* Catch multi sector transfer fixup errors. */ 1306*1e9ea7e0SNamjae Jeon if (unlikely(!ntfs_is_indx_record(ia->magic))) { 1307*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Directory index record with vcn 0x%llx is " 1308*1e9ea7e0SNamjae Jeon "corrupt. Corrupt inode 0x%lx. Run chkdsk.", 1309*1e9ea7e0SNamjae Jeon (unsigned long long)ia_pos >> 1310*1e9ea7e0SNamjae Jeon ndir->itype.index.vcn_size_bits, vdir->i_ino); 1311*1e9ea7e0SNamjae Jeon goto err_out; 1312*1e9ea7e0SNamjae Jeon } 1313*1e9ea7e0SNamjae Jeon if (unlikely(sle64_to_cpu(ia->index_block_vcn) != (ia_pos & 1314*1e9ea7e0SNamjae Jeon ~(s64)(ndir->itype.index.block_size - 1)) >> 1315*1e9ea7e0SNamjae Jeon ndir->itype.index.vcn_size_bits)) { 1316*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Actual VCN (0x%llx) of index buffer is " 1317*1e9ea7e0SNamjae Jeon "different from expected VCN (0x%llx). " 1318*1e9ea7e0SNamjae Jeon "Directory inode 0x%lx is corrupt or driver " 1319*1e9ea7e0SNamjae Jeon "bug. ", (unsigned long long) 1320*1e9ea7e0SNamjae Jeon sle64_to_cpu(ia->index_block_vcn), 1321*1e9ea7e0SNamjae Jeon (unsigned long long)ia_pos >> 1322*1e9ea7e0SNamjae Jeon ndir->itype.index.vcn_size_bits, vdir->i_ino); 1323*1e9ea7e0SNamjae Jeon goto err_out; 1324*1e9ea7e0SNamjae Jeon } 1325*1e9ea7e0SNamjae Jeon if (unlikely(le32_to_cpu(ia->index.allocated_size) + 0x18 != 1326*1e9ea7e0SNamjae Jeon ndir->itype.index.block_size)) { 1327*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Index buffer (VCN 0x%llx) of directory inode " 1328*1e9ea7e0SNamjae Jeon "0x%lx has a size (%u) differing from the " 1329*1e9ea7e0SNamjae Jeon "directory specified size (%u). Directory " 1330*1e9ea7e0SNamjae Jeon "inode is corrupt or driver bug.", 1331*1e9ea7e0SNamjae Jeon (unsigned long long)ia_pos >> 1332*1e9ea7e0SNamjae Jeon ndir->itype.index.vcn_size_bits, vdir->i_ino, 1333*1e9ea7e0SNamjae Jeon le32_to_cpu(ia->index.allocated_size) + 0x18, 1334*1e9ea7e0SNamjae Jeon ndir->itype.index.block_size); 1335*1e9ea7e0SNamjae Jeon goto err_out; 1336*1e9ea7e0SNamjae Jeon } 1337*1e9ea7e0SNamjae Jeon index_end = (u8*)ia + ndir->itype.index.block_size; 1338*1e9ea7e0SNamjae Jeon if (unlikely(index_end > kaddr + PAGE_SIZE)) { 1339*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Index buffer (VCN 0x%llx) of directory inode " 1340*1e9ea7e0SNamjae Jeon "0x%lx crosses page boundary. Impossible! " 1341*1e9ea7e0SNamjae Jeon "Cannot access! This is probably a bug in the " 1342*1e9ea7e0SNamjae Jeon "driver.", (unsigned long long)ia_pos >> 1343*1e9ea7e0SNamjae Jeon ndir->itype.index.vcn_size_bits, vdir->i_ino); 1344*1e9ea7e0SNamjae Jeon goto err_out; 1345*1e9ea7e0SNamjae Jeon } 1346*1e9ea7e0SNamjae Jeon ia_start = ia_pos & ~(s64)(ndir->itype.index.block_size - 1); 1347*1e9ea7e0SNamjae Jeon index_end = (u8*)&ia->index + le32_to_cpu(ia->index.index_length); 1348*1e9ea7e0SNamjae Jeon if (unlikely(index_end > (u8*)ia + ndir->itype.index.block_size)) { 1349*1e9ea7e0SNamjae Jeon ntfs_error(sb, "Size of index buffer (VCN 0x%llx) of directory " 1350*1e9ea7e0SNamjae Jeon "inode 0x%lx exceeds maximum size.", 1351*1e9ea7e0SNamjae Jeon (unsigned long long)ia_pos >> 1352*1e9ea7e0SNamjae Jeon ndir->itype.index.vcn_size_bits, vdir->i_ino); 1353*1e9ea7e0SNamjae Jeon goto err_out; 1354*1e9ea7e0SNamjae Jeon } 1355*1e9ea7e0SNamjae Jeon /* The first index entry in this index buffer. */ 1356*1e9ea7e0SNamjae Jeon ie = (INDEX_ENTRY*)((u8*)&ia->index + 1357*1e9ea7e0SNamjae Jeon le32_to_cpu(ia->index.entries_offset)); 1358*1e9ea7e0SNamjae Jeon /* 1359*1e9ea7e0SNamjae Jeon * Loop until we exceed valid memory (corruption case) or until we 1360*1e9ea7e0SNamjae Jeon * reach the last entry or until filldir tells us it has had enough 1361*1e9ea7e0SNamjae Jeon * or signals an error (both covered by the rc test). 1362*1e9ea7e0SNamjae Jeon */ 1363*1e9ea7e0SNamjae Jeon for (;; ie = (INDEX_ENTRY*)((u8*)ie + le16_to_cpu(ie->length))) { 1364*1e9ea7e0SNamjae Jeon ntfs_debug("In index allocation, offset 0x%llx.", 1365*1e9ea7e0SNamjae Jeon (unsigned long long)ia_start + 1366*1e9ea7e0SNamjae Jeon (unsigned long long)((u8*)ie - (u8*)ia)); 1367*1e9ea7e0SNamjae Jeon /* Bounds checks. */ 1368*1e9ea7e0SNamjae Jeon if (unlikely((u8*)ie < (u8*)ia || (u8*)ie + 1369*1e9ea7e0SNamjae Jeon sizeof(INDEX_ENTRY_HEADER) > index_end || 1370*1e9ea7e0SNamjae Jeon (u8*)ie + le16_to_cpu(ie->key_length) > 1371*1e9ea7e0SNamjae Jeon index_end)) 1372*1e9ea7e0SNamjae Jeon goto err_out; 1373*1e9ea7e0SNamjae Jeon /* The last entry cannot contain a name. */ 1374*1e9ea7e0SNamjae Jeon if (ie->flags & INDEX_ENTRY_END) 1375*1e9ea7e0SNamjae Jeon break; 1376*1e9ea7e0SNamjae Jeon /* Skip index block entry if continuing previous readdir. */ 1377*1e9ea7e0SNamjae Jeon if (ia_pos - ia_start > (u8*)ie - (u8*)ia) 1378*1e9ea7e0SNamjae Jeon continue; 1379*1e9ea7e0SNamjae Jeon /* Advance the position even if going to skip the entry. */ 1380*1e9ea7e0SNamjae Jeon actor->pos = (u8*)ie - (u8*)ia + 1381*1e9ea7e0SNamjae Jeon (sle64_to_cpu(ia->index_block_vcn) << 1382*1e9ea7e0SNamjae Jeon ndir->itype.index.vcn_size_bits) + 1383*1e9ea7e0SNamjae Jeon vol->mft_record_size; 1384*1e9ea7e0SNamjae Jeon /* 1385*1e9ea7e0SNamjae Jeon * Submit the name to the @filldir callback. Note, 1386*1e9ea7e0SNamjae Jeon * ntfs_filldir() drops the lock on @ia_page but it retakes it 1387*1e9ea7e0SNamjae Jeon * before returning, unless a non-zero value is returned in 1388*1e9ea7e0SNamjae Jeon * which case the page is left unlocked. 1389*1e9ea7e0SNamjae Jeon */ 1390*1e9ea7e0SNamjae Jeon rc = ntfs_filldir(vol, ndir, ia_page, ie, name, actor); 1391*1e9ea7e0SNamjae Jeon if (rc) { 1392*1e9ea7e0SNamjae Jeon /* @ia_page is already unlocked in this case. */ 1393*1e9ea7e0SNamjae Jeon ntfs_unmap_page(ia_page); 1394*1e9ea7e0SNamjae Jeon ntfs_unmap_page(bmp_page); 1395*1e9ea7e0SNamjae Jeon iput(bmp_vi); 1396*1e9ea7e0SNamjae Jeon goto abort; 1397*1e9ea7e0SNamjae Jeon } 1398*1e9ea7e0SNamjae Jeon } 1399*1e9ea7e0SNamjae Jeon goto find_next_index_buffer; 1400*1e9ea7e0SNamjae Jeon unm_EOD: 1401*1e9ea7e0SNamjae Jeon if (ia_page) { 1402*1e9ea7e0SNamjae Jeon unlock_page(ia_page); 1403*1e9ea7e0SNamjae Jeon ntfs_unmap_page(ia_page); 1404*1e9ea7e0SNamjae Jeon } 1405*1e9ea7e0SNamjae Jeon ntfs_unmap_page(bmp_page); 1406*1e9ea7e0SNamjae Jeon iput(bmp_vi); 1407*1e9ea7e0SNamjae Jeon EOD: 1408*1e9ea7e0SNamjae Jeon /* We are finished, set fpos to EOD. */ 1409*1e9ea7e0SNamjae Jeon actor->pos = i_size + vol->mft_record_size; 1410*1e9ea7e0SNamjae Jeon abort: 1411*1e9ea7e0SNamjae Jeon kfree(name); 1412*1e9ea7e0SNamjae Jeon return 0; 1413*1e9ea7e0SNamjae Jeon err_out: 1414*1e9ea7e0SNamjae Jeon if (bmp_page) { 1415*1e9ea7e0SNamjae Jeon ntfs_unmap_page(bmp_page); 1416*1e9ea7e0SNamjae Jeon iput_err_out: 1417*1e9ea7e0SNamjae Jeon iput(bmp_vi); 1418*1e9ea7e0SNamjae Jeon } 1419*1e9ea7e0SNamjae Jeon if (ia_page) { 1420*1e9ea7e0SNamjae Jeon unlock_page(ia_page); 1421*1e9ea7e0SNamjae Jeon ntfs_unmap_page(ia_page); 1422*1e9ea7e0SNamjae Jeon } 1423*1e9ea7e0SNamjae Jeon kfree(ir); 1424*1e9ea7e0SNamjae Jeon kfree(name); 1425*1e9ea7e0SNamjae Jeon if (ctx) 1426*1e9ea7e0SNamjae Jeon ntfs_attr_put_search_ctx(ctx); 1427*1e9ea7e0SNamjae Jeon if (m) 1428*1e9ea7e0SNamjae Jeon unmap_mft_record(ndir); 1429*1e9ea7e0SNamjae Jeon if (!err) 1430*1e9ea7e0SNamjae Jeon err = -EIO; 1431*1e9ea7e0SNamjae Jeon ntfs_debug("Failed. Returning error code %i.", -err); 1432*1e9ea7e0SNamjae Jeon return err; 1433*1e9ea7e0SNamjae Jeon } 1434*1e9ea7e0SNamjae Jeon 1435*1e9ea7e0SNamjae Jeon /** 1436*1e9ea7e0SNamjae Jeon * ntfs_dir_open - called when an inode is about to be opened 1437*1e9ea7e0SNamjae Jeon * @vi: inode to be opened 1438*1e9ea7e0SNamjae Jeon * @filp: file structure describing the inode 1439*1e9ea7e0SNamjae Jeon * 1440*1e9ea7e0SNamjae Jeon * Limit directory size to the page cache limit on architectures where unsigned 1441*1e9ea7e0SNamjae Jeon * long is 32-bits. This is the most we can do for now without overflowing the 1442*1e9ea7e0SNamjae Jeon * page cache page index. Doing it this way means we don't run into problems 1443*1e9ea7e0SNamjae Jeon * because of existing too large directories. It would be better to allow the 1444*1e9ea7e0SNamjae Jeon * user to read the accessible part of the directory but I doubt very much 1445*1e9ea7e0SNamjae Jeon * anyone is going to hit this check on a 32-bit architecture, so there is no 1446*1e9ea7e0SNamjae Jeon * point in adding the extra complexity required to support this. 1447*1e9ea7e0SNamjae Jeon * 1448*1e9ea7e0SNamjae Jeon * On 64-bit architectures, the check is hopefully optimized away by the 1449*1e9ea7e0SNamjae Jeon * compiler. 1450*1e9ea7e0SNamjae Jeon */ 1451*1e9ea7e0SNamjae Jeon static int ntfs_dir_open(struct inode *vi, struct file *filp) 1452*1e9ea7e0SNamjae Jeon { 1453*1e9ea7e0SNamjae Jeon if (sizeof(unsigned long) < 8) { 1454*1e9ea7e0SNamjae Jeon if (i_size_read(vi) > MAX_LFS_FILESIZE) 1455*1e9ea7e0SNamjae Jeon return -EFBIG; 1456*1e9ea7e0SNamjae Jeon } 1457*1e9ea7e0SNamjae Jeon return 0; 1458*1e9ea7e0SNamjae Jeon } 1459*1e9ea7e0SNamjae Jeon 1460*1e9ea7e0SNamjae Jeon #ifdef NTFS_RW 1461*1e9ea7e0SNamjae Jeon 1462*1e9ea7e0SNamjae Jeon /** 1463*1e9ea7e0SNamjae Jeon * ntfs_dir_fsync - sync a directory to disk 1464*1e9ea7e0SNamjae Jeon * @filp: directory to be synced 1465*1e9ea7e0SNamjae Jeon * @start: offset in bytes of the beginning of data range to sync 1466*1e9ea7e0SNamjae Jeon * @end: offset in bytes of the end of data range (inclusive) 1467*1e9ea7e0SNamjae Jeon * @datasync: if non-zero only flush user data and not metadata 1468*1e9ea7e0SNamjae Jeon * 1469*1e9ea7e0SNamjae Jeon * Data integrity sync of a directory to disk. Used for fsync, fdatasync, and 1470*1e9ea7e0SNamjae Jeon * msync system calls. This function is based on file.c::ntfs_file_fsync(). 1471*1e9ea7e0SNamjae Jeon * 1472*1e9ea7e0SNamjae Jeon * Write the mft record and all associated extent mft records as well as the 1473*1e9ea7e0SNamjae Jeon * $INDEX_ALLOCATION and $BITMAP attributes and then sync the block device. 1474*1e9ea7e0SNamjae Jeon * 1475*1e9ea7e0SNamjae Jeon * If @datasync is true, we do not wait on the inode(s) to be written out 1476*1e9ea7e0SNamjae Jeon * but we always wait on the page cache pages to be written out. 1477*1e9ea7e0SNamjae Jeon * 1478*1e9ea7e0SNamjae Jeon * Note: In the past @filp could be NULL so we ignore it as we don't need it 1479*1e9ea7e0SNamjae Jeon * anyway. 1480*1e9ea7e0SNamjae Jeon * 1481*1e9ea7e0SNamjae Jeon * Locking: Caller must hold i_mutex on the inode. 1482*1e9ea7e0SNamjae Jeon * 1483*1e9ea7e0SNamjae Jeon * TODO: We should probably also write all attribute/index inodes associated 1484*1e9ea7e0SNamjae Jeon * with this inode but since we have no simple way of getting to them we ignore 1485*1e9ea7e0SNamjae Jeon * this problem for now. We do write the $BITMAP attribute if it is present 1486*1e9ea7e0SNamjae Jeon * which is the important one for a directory so things are not too bad. 1487*1e9ea7e0SNamjae Jeon */ 1488*1e9ea7e0SNamjae Jeon static int ntfs_dir_fsync(struct file *filp, loff_t start, loff_t end, 1489*1e9ea7e0SNamjae Jeon int datasync) 1490*1e9ea7e0SNamjae Jeon { 1491*1e9ea7e0SNamjae Jeon struct inode *bmp_vi, *vi = filp->f_mapping->host; 1492*1e9ea7e0SNamjae Jeon int err, ret; 1493*1e9ea7e0SNamjae Jeon ntfs_attr na; 1494*1e9ea7e0SNamjae Jeon 1495*1e9ea7e0SNamjae Jeon ntfs_debug("Entering for inode 0x%lx.", vi->i_ino); 1496*1e9ea7e0SNamjae Jeon 1497*1e9ea7e0SNamjae Jeon err = file_write_and_wait_range(filp, start, end); 1498*1e9ea7e0SNamjae Jeon if (err) 1499*1e9ea7e0SNamjae Jeon return err; 1500*1e9ea7e0SNamjae Jeon inode_lock(vi); 1501*1e9ea7e0SNamjae Jeon 1502*1e9ea7e0SNamjae Jeon BUG_ON(!S_ISDIR(vi->i_mode)); 1503*1e9ea7e0SNamjae Jeon /* If the bitmap attribute inode is in memory sync it, too. */ 1504*1e9ea7e0SNamjae Jeon na.mft_no = vi->i_ino; 1505*1e9ea7e0SNamjae Jeon na.type = AT_BITMAP; 1506*1e9ea7e0SNamjae Jeon na.name = I30; 1507*1e9ea7e0SNamjae Jeon na.name_len = 4; 1508*1e9ea7e0SNamjae Jeon bmp_vi = ilookup5(vi->i_sb, vi->i_ino, ntfs_test_inode, &na); 1509*1e9ea7e0SNamjae Jeon if (bmp_vi) { 1510*1e9ea7e0SNamjae Jeon write_inode_now(bmp_vi, !datasync); 1511*1e9ea7e0SNamjae Jeon iput(bmp_vi); 1512*1e9ea7e0SNamjae Jeon } 1513*1e9ea7e0SNamjae Jeon ret = __ntfs_write_inode(vi, 1); 1514*1e9ea7e0SNamjae Jeon write_inode_now(vi, !datasync); 1515*1e9ea7e0SNamjae Jeon err = sync_blockdev(vi->i_sb->s_bdev); 1516*1e9ea7e0SNamjae Jeon if (unlikely(err && !ret)) 1517*1e9ea7e0SNamjae Jeon ret = err; 1518*1e9ea7e0SNamjae Jeon if (likely(!ret)) 1519*1e9ea7e0SNamjae Jeon ntfs_debug("Done."); 1520*1e9ea7e0SNamjae Jeon else 1521*1e9ea7e0SNamjae Jeon ntfs_warning(vi->i_sb, "Failed to f%ssync inode 0x%lx. Error " 1522*1e9ea7e0SNamjae Jeon "%u.", datasync ? "data" : "", vi->i_ino, -ret); 1523*1e9ea7e0SNamjae Jeon inode_unlock(vi); 1524*1e9ea7e0SNamjae Jeon return ret; 1525*1e9ea7e0SNamjae Jeon } 1526*1e9ea7e0SNamjae Jeon 1527*1e9ea7e0SNamjae Jeon #endif /* NTFS_RW */ 1528*1e9ea7e0SNamjae Jeon 1529*1e9ea7e0SNamjae Jeon WRAP_DIR_ITER(ntfs_readdir) // FIXME! 1530*1e9ea7e0SNamjae Jeon const struct file_operations ntfs_dir_ops = { 1531*1e9ea7e0SNamjae Jeon .llseek = generic_file_llseek, /* Seek inside directory. */ 1532*1e9ea7e0SNamjae Jeon .read = generic_read_dir, /* Return -EISDIR. */ 1533*1e9ea7e0SNamjae Jeon .iterate_shared = shared_ntfs_readdir, /* Read directory contents. */ 1534*1e9ea7e0SNamjae Jeon #ifdef NTFS_RW 1535*1e9ea7e0SNamjae Jeon .fsync = ntfs_dir_fsync, /* Sync a directory to disk. */ 1536*1e9ea7e0SNamjae Jeon #endif /* NTFS_RW */ 1537*1e9ea7e0SNamjae Jeon /*.ioctl = ,*/ /* Perform function on the 1538*1e9ea7e0SNamjae Jeon mounted filesystem. */ 1539*1e9ea7e0SNamjae Jeon .open = ntfs_dir_open, /* Open directory. */ 1540*1e9ea7e0SNamjae Jeon }; 1541