readdir.c 29 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965
  1. /*
  2. * fs/cifs/readdir.c
  3. *
  4. * Directory search handling
  5. *
  6. * Copyright (C) International Business Machines Corp., 2004, 2005
  7. * Author(s): Steve French (sfrench@us.ibm.com)
  8. *
  9. * This library is free software; you can redistribute it and/or modify
  10. * it under the terms of the GNU Lesser General Public License as published
  11. * by the Free Software Foundation; either version 2.1 of the License, or
  12. * (at your option) any later version.
  13. *
  14. * This library is distributed in the hope that it will be useful,
  15. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  16. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See
  17. * the GNU Lesser General Public License for more details.
  18. *
  19. * You should have received a copy of the GNU Lesser General Public License
  20. * along with this library; if not, write to the Free Software
  21. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  22. */
  23. #include <linux/fs.h>
  24. #include <linux/stat.h>
  25. #include <linux/smp_lock.h>
  26. #include "cifspdu.h"
  27. #include "cifsglob.h"
  28. #include "cifsproto.h"
  29. #include "cifs_unicode.h"
  30. #include "cifs_debug.h"
  31. #include "cifs_fs_sb.h"
  32. #include "cifsfs.h"
  33. /* BB fixme - add debug wrappers around this function to disable it fixme BB */
  34. /* static void dump_cifs_file_struct(struct file *file, char *label)
  35. {
  36. struct cifsFileInfo * cf;
  37. if(file) {
  38. cf = file->private_data;
  39. if(cf == NULL) {
  40. cFYI(1,("empty cifs private file data"));
  41. return;
  42. }
  43. if(cf->invalidHandle) {
  44. cFYI(1,("invalid handle"));
  45. }
  46. if(cf->srch_inf.endOfSearch) {
  47. cFYI(1,("end of search"));
  48. }
  49. if(cf->srch_inf.emptyDir) {
  50. cFYI(1,("empty dir"));
  51. }
  52. }
  53. } */
  54. /* Returns one if new inode created (which therefore needs to be hashed) */
  55. /* Might check in the future if inode number changed so we can rehash inode */
  56. static int construct_dentry(struct qstr *qstring, struct file *file,
  57. struct inode **ptmp_inode, struct dentry **pnew_dentry)
  58. {
  59. struct dentry *tmp_dentry;
  60. struct cifs_sb_info *cifs_sb;
  61. struct cifsTconInfo *pTcon;
  62. int rc = 0;
  63. cFYI(1, ("For %s", qstring->name));
  64. cifs_sb = CIFS_SB(file->f_dentry->d_sb);
  65. pTcon = cifs_sb->tcon;
  66. qstring->hash = full_name_hash(qstring->name, qstring->len);
  67. tmp_dentry = d_lookup(file->f_dentry, qstring);
  68. if (tmp_dentry) {
  69. cFYI(0, ("existing dentry with inode 0x%p", tmp_dentry->d_inode));
  70. *ptmp_inode = tmp_dentry->d_inode;
  71. /* BB overwrite old name? i.e. tmp_dentry->d_name and tmp_dentry->d_name.len??*/
  72. if(*ptmp_inode == NULL) {
  73. *ptmp_inode = new_inode(file->f_dentry->d_sb);
  74. if(*ptmp_inode == NULL)
  75. return rc;
  76. rc = 1;
  77. d_instantiate(tmp_dentry, *ptmp_inode);
  78. }
  79. } else {
  80. tmp_dentry = d_alloc(file->f_dentry, qstring);
  81. if(tmp_dentry == NULL) {
  82. cERROR(1,("Failed allocating dentry"));
  83. *ptmp_inode = NULL;
  84. return rc;
  85. }
  86. *ptmp_inode = new_inode(file->f_dentry->d_sb);
  87. if (pTcon->nocase)
  88. tmp_dentry->d_op = &cifs_ci_dentry_ops;
  89. else
  90. tmp_dentry->d_op = &cifs_dentry_ops;
  91. if(*ptmp_inode == NULL)
  92. return rc;
  93. rc = 1;
  94. d_instantiate(tmp_dentry, *ptmp_inode);
  95. d_rehash(tmp_dentry);
  96. }
  97. tmp_dentry->d_time = jiffies;
  98. *pnew_dentry = tmp_dentry;
  99. return rc;
  100. }
  101. static void fill_in_inode(struct inode *tmp_inode,
  102. FILE_DIRECTORY_INFO *pfindData, int *pobject_type, int isNewInode)
  103. {
  104. loff_t local_size;
  105. struct timespec local_mtime;
  106. struct cifsInodeInfo *cifsInfo = CIFS_I(tmp_inode);
  107. struct cifs_sb_info *cifs_sb = CIFS_SB(tmp_inode->i_sb);
  108. __u32 attr = le32_to_cpu(pfindData->ExtFileAttributes);
  109. __u64 allocation_size = le64_to_cpu(pfindData->AllocationSize);
  110. __u64 end_of_file = le64_to_cpu(pfindData->EndOfFile);
  111. cifsInfo->cifsAttrs = attr;
  112. cifsInfo->time = jiffies;
  113. /* save mtime and size */
  114. local_mtime = tmp_inode->i_mtime;
  115. local_size = tmp_inode->i_size;
  116. /* Linux can not store file creation time unfortunately so ignore it */
  117. tmp_inode->i_atime =
  118. cifs_NTtimeToUnix(le64_to_cpu(pfindData->LastAccessTime));
  119. tmp_inode->i_mtime =
  120. cifs_NTtimeToUnix(le64_to_cpu(pfindData->LastWriteTime));
  121. tmp_inode->i_ctime =
  122. cifs_NTtimeToUnix(le64_to_cpu(pfindData->ChangeTime));
  123. /* treat dos attribute of read-only as read-only mode bit e.g. 555? */
  124. /* 2767 perms - indicate mandatory locking */
  125. /* BB fill in uid and gid here? with help from winbind?
  126. or retrieve from NTFS stream extended attribute */
  127. if (atomic_read(&cifsInfo->inUse) == 0) {
  128. tmp_inode->i_uid = cifs_sb->mnt_uid;
  129. tmp_inode->i_gid = cifs_sb->mnt_gid;
  130. /* set default mode. will override for dirs below */
  131. tmp_inode->i_mode = cifs_sb->mnt_file_mode;
  132. }
  133. if (attr & ATTR_DIRECTORY) {
  134. *pobject_type = DT_DIR;
  135. /* override default perms since we do not lock dirs */
  136. if(atomic_read(&cifsInfo->inUse) == 0) {
  137. tmp_inode->i_mode = cifs_sb->mnt_dir_mode;
  138. }
  139. tmp_inode->i_mode |= S_IFDIR;
  140. } else if ((cifs_sb->mnt_cifs_flags & CIFS_MOUNT_UNX_EMUL) &&
  141. (attr & ATTR_SYSTEM) && (end_of_file == 0)) {
  142. *pobject_type = DT_FIFO;
  143. tmp_inode->i_mode |= S_IFIFO;
  144. /* BB Finish for SFU style symlinks and devies */
  145. /* } else if ((cifs_sb->mnt_cifs_flags & CIFS_MOUNT_UNX_EMUL) &&
  146. (attr & ATTR_SYSTEM) && ) { */
  147. /* we no longer mark these because we could not follow them */
  148. /* } else if (attr & ATTR_REPARSE) {
  149. *pobject_type = DT_LNK;
  150. tmp_inode->i_mode |= S_IFLNK; */
  151. } else {
  152. *pobject_type = DT_REG;
  153. tmp_inode->i_mode |= S_IFREG;
  154. if (attr & ATTR_READONLY)
  155. tmp_inode->i_mode &= ~(S_IWUGO);
  156. } /* could add code here - to validate if device or weird share type? */
  157. /* can not fill in nlink here as in qpathinfo version and Unx search */
  158. if (atomic_read(&cifsInfo->inUse) == 0) {
  159. atomic_set(&cifsInfo->inUse, 1);
  160. }
  161. if (is_size_safe_to_change(cifsInfo)) {
  162. /* can not safely change the file size here if the
  163. client is writing to it due to potential races */
  164. i_size_write(tmp_inode, end_of_file);
  165. /* 512 bytes (2**9) is the fake blocksize that must be used */
  166. /* for this calculation, even though the reported blocksize is larger */
  167. tmp_inode->i_blocks = (512 - 1 + allocation_size) >> 9;
  168. }
  169. if (allocation_size < end_of_file)
  170. cFYI(1, ("May be sparse file, allocation less than file size"));
  171. cFYI(1,
  172. ("File Size %ld and blocks %ld and blocksize %ld",
  173. (unsigned long)tmp_inode->i_size, tmp_inode->i_blocks,
  174. tmp_inode->i_blksize));
  175. if (S_ISREG(tmp_inode->i_mode)) {
  176. cFYI(1, ("File inode"));
  177. tmp_inode->i_op = &cifs_file_inode_ops;
  178. if(cifs_sb->mnt_cifs_flags & CIFS_MOUNT_DIRECT_IO)
  179. tmp_inode->i_fop = &cifs_file_direct_ops;
  180. else
  181. tmp_inode->i_fop = &cifs_file_ops;
  182. if(cifs_sb->mnt_cifs_flags & CIFS_MOUNT_NO_BRL)
  183. tmp_inode->i_fop->lock = NULL;
  184. tmp_inode->i_data.a_ops = &cifs_addr_ops;
  185. if((cifs_sb->tcon) && (cifs_sb->tcon->ses) &&
  186. (cifs_sb->tcon->ses->server->maxBuf <
  187. 4096 + MAX_CIFS_HDR_SIZE))
  188. tmp_inode->i_data.a_ops->readpages = NULL;
  189. if(isNewInode)
  190. return; /* No sense invalidating pages for new inode
  191. since have not started caching readahead file
  192. data yet */
  193. if (timespec_equal(&tmp_inode->i_mtime, &local_mtime) &&
  194. (local_size == tmp_inode->i_size)) {
  195. cFYI(1, ("inode exists but unchanged"));
  196. } else {
  197. /* file may have changed on server */
  198. cFYI(1, ("invalidate inode, readdir detected change"));
  199. invalidate_remote_inode(tmp_inode);
  200. }
  201. } else if (S_ISDIR(tmp_inode->i_mode)) {
  202. cFYI(1, ("Directory inode"));
  203. tmp_inode->i_op = &cifs_dir_inode_ops;
  204. tmp_inode->i_fop = &cifs_dir_ops;
  205. } else if (S_ISLNK(tmp_inode->i_mode)) {
  206. cFYI(1, ("Symbolic Link inode"));
  207. tmp_inode->i_op = &cifs_symlink_inode_ops;
  208. } else {
  209. cFYI(1, ("Init special inode"));
  210. init_special_inode(tmp_inode, tmp_inode->i_mode,
  211. tmp_inode->i_rdev);
  212. }
  213. }
  214. static void unix_fill_in_inode(struct inode *tmp_inode,
  215. FILE_UNIX_INFO *pfindData, int *pobject_type, int isNewInode)
  216. {
  217. loff_t local_size;
  218. struct timespec local_mtime;
  219. struct cifsInodeInfo *cifsInfo = CIFS_I(tmp_inode);
  220. struct cifs_sb_info *cifs_sb = CIFS_SB(tmp_inode->i_sb);
  221. __u32 type = le32_to_cpu(pfindData->Type);
  222. __u64 num_of_bytes = le64_to_cpu(pfindData->NumOfBytes);
  223. __u64 end_of_file = le64_to_cpu(pfindData->EndOfFile);
  224. cifsInfo->time = jiffies;
  225. atomic_inc(&cifsInfo->inUse);
  226. /* save mtime and size */
  227. local_mtime = tmp_inode->i_mtime;
  228. local_size = tmp_inode->i_size;
  229. tmp_inode->i_atime =
  230. cifs_NTtimeToUnix(le64_to_cpu(pfindData->LastAccessTime));
  231. tmp_inode->i_mtime =
  232. cifs_NTtimeToUnix(le64_to_cpu(pfindData->LastModificationTime));
  233. tmp_inode->i_ctime =
  234. cifs_NTtimeToUnix(le64_to_cpu(pfindData->LastStatusChange));
  235. tmp_inode->i_mode = le64_to_cpu(pfindData->Permissions);
  236. if (type == UNIX_FILE) {
  237. *pobject_type = DT_REG;
  238. tmp_inode->i_mode |= S_IFREG;
  239. } else if (type == UNIX_SYMLINK) {
  240. *pobject_type = DT_LNK;
  241. tmp_inode->i_mode |= S_IFLNK;
  242. } else if (type == UNIX_DIR) {
  243. *pobject_type = DT_DIR;
  244. tmp_inode->i_mode |= S_IFDIR;
  245. } else if (type == UNIX_CHARDEV) {
  246. *pobject_type = DT_CHR;
  247. tmp_inode->i_mode |= S_IFCHR;
  248. tmp_inode->i_rdev = MKDEV(le64_to_cpu(pfindData->DevMajor),
  249. le64_to_cpu(pfindData->DevMinor) & MINORMASK);
  250. } else if (type == UNIX_BLOCKDEV) {
  251. *pobject_type = DT_BLK;
  252. tmp_inode->i_mode |= S_IFBLK;
  253. tmp_inode->i_rdev = MKDEV(le64_to_cpu(pfindData->DevMajor),
  254. le64_to_cpu(pfindData->DevMinor) & MINORMASK);
  255. } else if (type == UNIX_FIFO) {
  256. *pobject_type = DT_FIFO;
  257. tmp_inode->i_mode |= S_IFIFO;
  258. } else if (type == UNIX_SOCKET) {
  259. *pobject_type = DT_SOCK;
  260. tmp_inode->i_mode |= S_IFSOCK;
  261. }
  262. tmp_inode->i_uid = le64_to_cpu(pfindData->Uid);
  263. tmp_inode->i_gid = le64_to_cpu(pfindData->Gid);
  264. tmp_inode->i_nlink = le64_to_cpu(pfindData->Nlinks);
  265. if (is_size_safe_to_change(cifsInfo)) {
  266. /* can not safely change the file size here if the
  267. client is writing to it due to potential races */
  268. i_size_write(tmp_inode,end_of_file);
  269. /* 512 bytes (2**9) is the fake blocksize that must be used */
  270. /* for this calculation, not the real blocksize */
  271. tmp_inode->i_blocks = (512 - 1 + num_of_bytes) >> 9;
  272. }
  273. if (S_ISREG(tmp_inode->i_mode)) {
  274. cFYI(1, ("File inode"));
  275. tmp_inode->i_op = &cifs_file_inode_ops;
  276. if(cifs_sb->mnt_cifs_flags & CIFS_MOUNT_DIRECT_IO)
  277. tmp_inode->i_fop = &cifs_file_direct_ops;
  278. else
  279. tmp_inode->i_fop = &cifs_file_ops;
  280. if(cifs_sb->mnt_cifs_flags & CIFS_MOUNT_NO_BRL)
  281. tmp_inode->i_fop->lock = NULL;
  282. tmp_inode->i_data.a_ops = &cifs_addr_ops;
  283. if((cifs_sb->tcon) && (cifs_sb->tcon->ses) &&
  284. (cifs_sb->tcon->ses->server->maxBuf <
  285. 4096 + MAX_CIFS_HDR_SIZE))
  286. tmp_inode->i_data.a_ops->readpages = NULL;
  287. if(isNewInode)
  288. return; /* No sense invalidating pages for new inode since we
  289. have not started caching readahead file data yet */
  290. if (timespec_equal(&tmp_inode->i_mtime, &local_mtime) &&
  291. (local_size == tmp_inode->i_size)) {
  292. cFYI(1, ("inode exists but unchanged"));
  293. } else {
  294. /* file may have changed on server */
  295. cFYI(1, ("invalidate inode, readdir detected change"));
  296. invalidate_remote_inode(tmp_inode);
  297. }
  298. } else if (S_ISDIR(tmp_inode->i_mode)) {
  299. cFYI(1, ("Directory inode"));
  300. tmp_inode->i_op = &cifs_dir_inode_ops;
  301. tmp_inode->i_fop = &cifs_dir_ops;
  302. } else if (S_ISLNK(tmp_inode->i_mode)) {
  303. cFYI(1, ("Symbolic Link inode"));
  304. tmp_inode->i_op = &cifs_symlink_inode_ops;
  305. /* tmp_inode->i_fop = *//* do not need to set to anything */
  306. } else {
  307. cFYI(1, ("Special inode"));
  308. init_special_inode(tmp_inode, tmp_inode->i_mode,
  309. tmp_inode->i_rdev);
  310. }
  311. }
  312. static int initiate_cifs_search(const int xid, struct file *file)
  313. {
  314. int rc = 0;
  315. char * full_path;
  316. struct cifsFileInfo * cifsFile;
  317. struct cifs_sb_info *cifs_sb;
  318. struct cifsTconInfo *pTcon;
  319. if(file->private_data == NULL) {
  320. file->private_data =
  321. kmalloc(sizeof(struct cifsFileInfo),GFP_KERNEL);
  322. }
  323. if(file->private_data == NULL) {
  324. return -ENOMEM;
  325. } else {
  326. memset(file->private_data,0,sizeof(struct cifsFileInfo));
  327. }
  328. cifsFile = file->private_data;
  329. cifsFile->invalidHandle = TRUE;
  330. cifsFile->srch_inf.endOfSearch = FALSE;
  331. if(file->f_dentry == NULL)
  332. return -ENOENT;
  333. cifs_sb = CIFS_SB(file->f_dentry->d_sb);
  334. if(cifs_sb == NULL)
  335. return -EINVAL;
  336. pTcon = cifs_sb->tcon;
  337. if(pTcon == NULL)
  338. return -EINVAL;
  339. down(&file->f_dentry->d_sb->s_vfs_rename_sem);
  340. full_path = build_path_from_dentry(file->f_dentry);
  341. up(&file->f_dentry->d_sb->s_vfs_rename_sem);
  342. if(full_path == NULL) {
  343. return -ENOMEM;
  344. }
  345. cFYI(1, ("Full path: %s start at: %lld", full_path, file->f_pos));
  346. ffirst_retry:
  347. /* test for Unix extensions */
  348. if (pTcon->ses->capabilities & CAP_UNIX) {
  349. cifsFile->srch_inf.info_level = SMB_FIND_FILE_UNIX;
  350. } else if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM) {
  351. cifsFile->srch_inf.info_level = SMB_FIND_FILE_ID_FULL_DIR_INFO;
  352. } else /* not srvinos - BB fixme add check for backlevel? */ {
  353. cifsFile->srch_inf.info_level = SMB_FIND_FILE_DIRECTORY_INFO;
  354. }
  355. rc = CIFSFindFirst(xid, pTcon,full_path,cifs_sb->local_nls,
  356. &cifsFile->netfid, &cifsFile->srch_inf,
  357. cifs_sb->mnt_cifs_flags &
  358. CIFS_MOUNT_MAP_SPECIAL_CHR, CIFS_DIR_SEP(cifs_sb));
  359. if(rc == 0)
  360. cifsFile->invalidHandle = FALSE;
  361. if((rc == -EOPNOTSUPP) &&
  362. (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM)) {
  363. cifs_sb->mnt_cifs_flags &= ~CIFS_MOUNT_SERVER_INUM;
  364. goto ffirst_retry;
  365. }
  366. kfree(full_path);
  367. return rc;
  368. }
  369. /* return length of unicode string in bytes */
  370. static int cifs_unicode_bytelen(char *str)
  371. {
  372. int len;
  373. __le16 * ustr = (__le16 *)str;
  374. for(len=0;len <= PATH_MAX;len++) {
  375. if(ustr[len] == 0)
  376. return len << 1;
  377. }
  378. cFYI(1,("Unicode string longer than PATH_MAX found"));
  379. return len << 1;
  380. }
  381. static char *nxt_dir_entry(char *old_entry, char *end_of_smb)
  382. {
  383. char * new_entry;
  384. FILE_DIRECTORY_INFO * pDirInfo = (FILE_DIRECTORY_INFO *)old_entry;
  385. new_entry = old_entry + le32_to_cpu(pDirInfo->NextEntryOffset);
  386. cFYI(1,("new entry %p old entry %p",new_entry,old_entry));
  387. /* validate that new_entry is not past end of SMB */
  388. if(new_entry >= end_of_smb) {
  389. cERROR(1,
  390. ("search entry %p began after end of SMB %p old entry %p",
  391. new_entry, end_of_smb, old_entry));
  392. return NULL;
  393. } else if (new_entry + sizeof(FILE_DIRECTORY_INFO) > end_of_smb) {
  394. cERROR(1,("search entry %p extends after end of SMB %p",
  395. new_entry, end_of_smb));
  396. return NULL;
  397. } else
  398. return new_entry;
  399. }
  400. #define UNICODE_DOT cpu_to_le16(0x2e)
  401. /* return 0 if no match and 1 for . (current directory) and 2 for .. (parent) */
  402. static int cifs_entry_is_dot(char *current_entry, struct cifsFileInfo *cfile)
  403. {
  404. int rc = 0;
  405. char * filename = NULL;
  406. int len = 0;
  407. if(cfile->srch_inf.info_level == 0x202) {
  408. FILE_UNIX_INFO * pFindData = (FILE_UNIX_INFO *)current_entry;
  409. filename = &pFindData->FileName[0];
  410. if(cfile->srch_inf.unicode) {
  411. len = cifs_unicode_bytelen(filename);
  412. } else {
  413. /* BB should we make this strnlen of PATH_MAX? */
  414. len = strnlen(filename, 5);
  415. }
  416. } else if(cfile->srch_inf.info_level == 0x101) {
  417. FILE_DIRECTORY_INFO * pFindData =
  418. (FILE_DIRECTORY_INFO *)current_entry;
  419. filename = &pFindData->FileName[0];
  420. len = le32_to_cpu(pFindData->FileNameLength);
  421. } else if(cfile->srch_inf.info_level == 0x102) {
  422. FILE_FULL_DIRECTORY_INFO * pFindData =
  423. (FILE_FULL_DIRECTORY_INFO *)current_entry;
  424. filename = &pFindData->FileName[0];
  425. len = le32_to_cpu(pFindData->FileNameLength);
  426. } else if(cfile->srch_inf.info_level == 0x105) {
  427. SEARCH_ID_FULL_DIR_INFO * pFindData =
  428. (SEARCH_ID_FULL_DIR_INFO *)current_entry;
  429. filename = &pFindData->FileName[0];
  430. len = le32_to_cpu(pFindData->FileNameLength);
  431. } else if(cfile->srch_inf.info_level == 0x104) {
  432. FILE_BOTH_DIRECTORY_INFO * pFindData =
  433. (FILE_BOTH_DIRECTORY_INFO *)current_entry;
  434. filename = &pFindData->FileName[0];
  435. len = le32_to_cpu(pFindData->FileNameLength);
  436. } else {
  437. cFYI(1,("Unknown findfirst level %d",cfile->srch_inf.info_level));
  438. }
  439. if(filename) {
  440. if(cfile->srch_inf.unicode) {
  441. __le16 *ufilename = (__le16 *)filename;
  442. if(len == 2) {
  443. /* check for . */
  444. if(ufilename[0] == UNICODE_DOT)
  445. rc = 1;
  446. } else if(len == 4) {
  447. /* check for .. */
  448. if((ufilename[0] == UNICODE_DOT)
  449. &&(ufilename[1] == UNICODE_DOT))
  450. rc = 2;
  451. }
  452. } else /* ASCII */ {
  453. if(len == 1) {
  454. if(filename[0] == '.')
  455. rc = 1;
  456. } else if(len == 2) {
  457. if((filename[0] == '.') && (filename[1] == '.'))
  458. rc = 2;
  459. }
  460. }
  461. }
  462. return rc;
  463. }
  464. /* Check if directory that we are searching has changed so we can decide
  465. whether we can use the cached search results from the previous search */
  466. static int is_dir_changed(struct file * file)
  467. {
  468. struct inode * inode;
  469. struct cifsInodeInfo *cifsInfo;
  470. if(file->f_dentry == NULL)
  471. return 0;
  472. inode = file->f_dentry->d_inode;
  473. if(inode == NULL)
  474. return 0;
  475. cifsInfo = CIFS_I(inode);
  476. if(cifsInfo->time == 0)
  477. return 1; /* directory was changed, perhaps due to unlink */
  478. else
  479. return 0;
  480. }
  481. /* find the corresponding entry in the search */
  482. /* Note that the SMB server returns search entries for . and .. which
  483. complicates logic here if we choose to parse for them and we do not
  484. assume that they are located in the findfirst return buffer.*/
  485. /* We start counting in the buffer with entry 2 and increment for every
  486. entry (do not increment for . or .. entry) */
  487. static int find_cifs_entry(const int xid, struct cifsTconInfo *pTcon,
  488. struct file *file, char **ppCurrentEntry, int *num_to_ret)
  489. {
  490. int rc = 0;
  491. int pos_in_buf = 0;
  492. loff_t first_entry_in_buffer;
  493. loff_t index_to_find = file->f_pos;
  494. struct cifsFileInfo * cifsFile = file->private_data;
  495. /* check if index in the buffer */
  496. if((cifsFile == NULL) || (ppCurrentEntry == NULL) ||
  497. (num_to_ret == NULL))
  498. return -ENOENT;
  499. *ppCurrentEntry = NULL;
  500. first_entry_in_buffer =
  501. cifsFile->srch_inf.index_of_last_entry -
  502. cifsFile->srch_inf.entries_in_buffer;
  503. /* dump_cifs_file_struct(file, "In fce ");*/
  504. if(((index_to_find < cifsFile->srch_inf.index_of_last_entry) &&
  505. is_dir_changed(file)) ||
  506. (index_to_find < first_entry_in_buffer)) {
  507. /* close and restart search */
  508. cFYI(1,("search backing up - close and restart search"));
  509. cifsFile->invalidHandle = TRUE;
  510. CIFSFindClose(xid, pTcon, cifsFile->netfid);
  511. kfree(cifsFile->search_resume_name);
  512. cifsFile->search_resume_name = NULL;
  513. if(cifsFile->srch_inf.ntwrk_buf_start) {
  514. cFYI(1,("freeing SMB ff cache buf on search rewind"));
  515. cifs_buf_release(cifsFile->srch_inf.ntwrk_buf_start);
  516. }
  517. rc = initiate_cifs_search(xid,file);
  518. if(rc) {
  519. cFYI(1,("error %d reinitiating a search on rewind",rc));
  520. return rc;
  521. }
  522. }
  523. while((index_to_find >= cifsFile->srch_inf.index_of_last_entry) &&
  524. (rc == 0) && (cifsFile->srch_inf.endOfSearch == FALSE)){
  525. cFYI(1,("calling findnext2"));
  526. rc = CIFSFindNext(xid,pTcon,cifsFile->netfid,
  527. &cifsFile->srch_inf);
  528. if(rc)
  529. return -ENOENT;
  530. }
  531. if(index_to_find < cifsFile->srch_inf.index_of_last_entry) {
  532. /* we found the buffer that contains the entry */
  533. /* scan and find it */
  534. int i;
  535. char * current_entry;
  536. char * end_of_smb = cifsFile->srch_inf.ntwrk_buf_start +
  537. smbCalcSize((struct smb_hdr *)
  538. cifsFile->srch_inf.ntwrk_buf_start);
  539. first_entry_in_buffer = cifsFile->srch_inf.index_of_last_entry
  540. - cifsFile->srch_inf.entries_in_buffer;
  541. pos_in_buf = index_to_find - first_entry_in_buffer;
  542. cFYI(1,("found entry - pos_in_buf %d",pos_in_buf));
  543. current_entry = cifsFile->srch_inf.srch_entries_start;
  544. for(i=0;(i<(pos_in_buf)) && (current_entry != NULL);i++) {
  545. /* go entry by entry figuring out which is first */
  546. /* if( . or ..)
  547. skip */
  548. rc = cifs_entry_is_dot(current_entry,cifsFile);
  549. if(rc == 1) /* is . or .. so skip */ {
  550. cFYI(1,("Entry is .")); /* BB removeme BB */
  551. /* continue; */
  552. } else if (rc == 2 ) {
  553. cFYI(1,("Entry is ..")); /* BB removeme BB */
  554. /* continue; */
  555. }
  556. current_entry = nxt_dir_entry(current_entry,end_of_smb);
  557. }
  558. if((current_entry == NULL) && (i < pos_in_buf)) {
  559. /* BB fixme - check if we should flag this error */
  560. cERROR(1,("reached end of buf searching for pos in buf"
  561. " %d index to find %lld rc %d",
  562. pos_in_buf,index_to_find,rc));
  563. }
  564. rc = 0;
  565. *ppCurrentEntry = current_entry;
  566. } else {
  567. cFYI(1,("index not in buffer - could not findnext into it"));
  568. return 0;
  569. }
  570. if(pos_in_buf >= cifsFile->srch_inf.entries_in_buffer) {
  571. cFYI(1,("can not return entries pos_in_buf beyond last entry"));
  572. *num_to_ret = 0;
  573. } else
  574. *num_to_ret = cifsFile->srch_inf.entries_in_buffer - pos_in_buf;
  575. return rc;
  576. }
  577. /* inode num, inode type and filename returned */
  578. static int cifs_get_name_from_search_buf(struct qstr *pqst,
  579. char *current_entry, __u16 level, unsigned int unicode,
  580. struct cifs_sb_info * cifs_sb, ino_t *pinum)
  581. {
  582. int rc = 0;
  583. unsigned int len = 0;
  584. char * filename;
  585. struct nls_table * nlt = cifs_sb->local_nls;
  586. *pinum = 0;
  587. if(level == SMB_FIND_FILE_UNIX) {
  588. FILE_UNIX_INFO * pFindData = (FILE_UNIX_INFO *)current_entry;
  589. filename = &pFindData->FileName[0];
  590. if(unicode) {
  591. len = cifs_unicode_bytelen(filename);
  592. } else {
  593. /* BB should we make this strnlen of PATH_MAX? */
  594. len = strnlen(filename, PATH_MAX);
  595. }
  596. /* BB fixme - hash low and high 32 bits if not 64 bit arch BB fixme */
  597. if(cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM)
  598. *pinum = pFindData->UniqueId;
  599. } else if(level == SMB_FIND_FILE_DIRECTORY_INFO) {
  600. FILE_DIRECTORY_INFO * pFindData =
  601. (FILE_DIRECTORY_INFO *)current_entry;
  602. filename = &pFindData->FileName[0];
  603. len = le32_to_cpu(pFindData->FileNameLength);
  604. } else if(level == SMB_FIND_FILE_FULL_DIRECTORY_INFO) {
  605. FILE_FULL_DIRECTORY_INFO * pFindData =
  606. (FILE_FULL_DIRECTORY_INFO *)current_entry;
  607. filename = &pFindData->FileName[0];
  608. len = le32_to_cpu(pFindData->FileNameLength);
  609. } else if(level == SMB_FIND_FILE_ID_FULL_DIR_INFO) {
  610. SEARCH_ID_FULL_DIR_INFO * pFindData =
  611. (SEARCH_ID_FULL_DIR_INFO *)current_entry;
  612. filename = &pFindData->FileName[0];
  613. len = le32_to_cpu(pFindData->FileNameLength);
  614. *pinum = pFindData->UniqueId;
  615. } else if(level == SMB_FIND_FILE_BOTH_DIRECTORY_INFO) {
  616. FILE_BOTH_DIRECTORY_INFO * pFindData =
  617. (FILE_BOTH_DIRECTORY_INFO *)current_entry;
  618. filename = &pFindData->FileName[0];
  619. len = le32_to_cpu(pFindData->FileNameLength);
  620. } else {
  621. cFYI(1,("Unknown findfirst level %d",level));
  622. return -EINVAL;
  623. }
  624. if(unicode) {
  625. /* BB fixme - test with long names */
  626. /* Note converted filename can be longer than in unicode */
  627. if(cifs_sb->mnt_cifs_flags & CIFS_MOUNT_MAP_SPECIAL_CHR)
  628. pqst->len = cifs_convertUCSpath((char *)pqst->name,
  629. (__le16 *)filename, len/2, nlt);
  630. else
  631. pqst->len = cifs_strfromUCS_le((char *)pqst->name,
  632. (wchar_t *)filename,len/2,nlt);
  633. } else {
  634. pqst->name = filename;
  635. pqst->len = len;
  636. }
  637. pqst->hash = full_name_hash(pqst->name,pqst->len);
  638. /* cFYI(1,("filldir on %s",pqst->name)); */
  639. return rc;
  640. }
  641. static int cifs_filldir(char *pfindEntry, struct file *file,
  642. filldir_t filldir, void *direntry, char *scratch_buf)
  643. {
  644. int rc = 0;
  645. struct qstr qstring;
  646. struct cifsFileInfo * pCifsF;
  647. unsigned obj_type;
  648. ino_t inum;
  649. struct cifs_sb_info * cifs_sb;
  650. struct inode *tmp_inode;
  651. struct dentry *tmp_dentry;
  652. /* get filename and len into qstring */
  653. /* get dentry */
  654. /* decide whether to create and populate ionde */
  655. if((direntry == NULL) || (file == NULL))
  656. return -EINVAL;
  657. pCifsF = file->private_data;
  658. if((scratch_buf == NULL) || (pfindEntry == NULL) || (pCifsF == NULL))
  659. return -ENOENT;
  660. if(file->f_dentry == NULL)
  661. return -ENOENT;
  662. cifs_sb = CIFS_SB(file->f_dentry->d_sb);
  663. qstring.name = scratch_buf;
  664. rc = cifs_get_name_from_search_buf(&qstring,pfindEntry,
  665. pCifsF->srch_inf.info_level,
  666. pCifsF->srch_inf.unicode,cifs_sb,
  667. &inum /* returned */);
  668. if(rc)
  669. return rc;
  670. rc = construct_dentry(&qstring,file,&tmp_inode, &tmp_dentry);
  671. if((tmp_inode == NULL) || (tmp_dentry == NULL))
  672. return -ENOMEM;
  673. if(rc) {
  674. /* inode created, we need to hash it with right inode number */
  675. if(inum != 0) {
  676. /* BB fixme - hash the 2 32 quantities bits together if necessary BB */
  677. tmp_inode->i_ino = inum;
  678. }
  679. insert_inode_hash(tmp_inode);
  680. }
  681. /* we pass in rc below, indicating whether it is a new inode,
  682. so we can figure out whether to invalidate the inode cached
  683. data if the file has changed */
  684. if(pCifsF->srch_inf.info_level == SMB_FIND_FILE_UNIX) {
  685. unix_fill_in_inode(tmp_inode,
  686. (FILE_UNIX_INFO *)pfindEntry,&obj_type, rc);
  687. } else {
  688. fill_in_inode(tmp_inode,
  689. (FILE_DIRECTORY_INFO *)pfindEntry,&obj_type, rc);
  690. }
  691. rc = filldir(direntry,qstring.name,qstring.len,file->f_pos,
  692. tmp_inode->i_ino,obj_type);
  693. if(rc) {
  694. cFYI(1,("filldir rc = %d",rc));
  695. }
  696. dput(tmp_dentry);
  697. return rc;
  698. }
  699. static int cifs_save_resume_key(const char *current_entry,
  700. struct cifsFileInfo *cifsFile)
  701. {
  702. int rc = 0;
  703. unsigned int len = 0;
  704. __u16 level;
  705. char * filename;
  706. if((cifsFile == NULL) || (current_entry == NULL))
  707. return -EINVAL;
  708. level = cifsFile->srch_inf.info_level;
  709. if(level == SMB_FIND_FILE_UNIX) {
  710. FILE_UNIX_INFO * pFindData = (FILE_UNIX_INFO *)current_entry;
  711. filename = &pFindData->FileName[0];
  712. if(cifsFile->srch_inf.unicode) {
  713. len = cifs_unicode_bytelen(filename);
  714. } else {
  715. /* BB should we make this strnlen of PATH_MAX? */
  716. len = strnlen(filename, PATH_MAX);
  717. }
  718. cifsFile->srch_inf.resume_key = pFindData->ResumeKey;
  719. } else if(level == SMB_FIND_FILE_DIRECTORY_INFO) {
  720. FILE_DIRECTORY_INFO * pFindData =
  721. (FILE_DIRECTORY_INFO *)current_entry;
  722. filename = &pFindData->FileName[0];
  723. len = le32_to_cpu(pFindData->FileNameLength);
  724. cifsFile->srch_inf.resume_key = pFindData->FileIndex;
  725. } else if(level == SMB_FIND_FILE_FULL_DIRECTORY_INFO) {
  726. FILE_FULL_DIRECTORY_INFO * pFindData =
  727. (FILE_FULL_DIRECTORY_INFO *)current_entry;
  728. filename = &pFindData->FileName[0];
  729. len = le32_to_cpu(pFindData->FileNameLength);
  730. cifsFile->srch_inf.resume_key = pFindData->FileIndex;
  731. } else if(level == SMB_FIND_FILE_ID_FULL_DIR_INFO) {
  732. SEARCH_ID_FULL_DIR_INFO * pFindData =
  733. (SEARCH_ID_FULL_DIR_INFO *)current_entry;
  734. filename = &pFindData->FileName[0];
  735. len = le32_to_cpu(pFindData->FileNameLength);
  736. cifsFile->srch_inf.resume_key = pFindData->FileIndex;
  737. } else if(level == SMB_FIND_FILE_BOTH_DIRECTORY_INFO) {
  738. FILE_BOTH_DIRECTORY_INFO * pFindData =
  739. (FILE_BOTH_DIRECTORY_INFO *)current_entry;
  740. filename = &pFindData->FileName[0];
  741. len = le32_to_cpu(pFindData->FileNameLength);
  742. cifsFile->srch_inf.resume_key = pFindData->FileIndex;
  743. } else {
  744. cFYI(1,("Unknown findfirst level %d",level));
  745. return -EINVAL;
  746. }
  747. cifsFile->srch_inf.resume_name_len = len;
  748. cifsFile->srch_inf.presume_name = filename;
  749. return rc;
  750. }
  751. int cifs_readdir(struct file *file, void *direntry, filldir_t filldir)
  752. {
  753. int rc = 0;
  754. int xid,i;
  755. struct cifs_sb_info *cifs_sb;
  756. struct cifsTconInfo *pTcon;
  757. struct cifsFileInfo *cifsFile = NULL;
  758. char * current_entry;
  759. int num_to_fill = 0;
  760. char * tmp_buf = NULL;
  761. char * end_of_smb;
  762. xid = GetXid();
  763. if(file->f_dentry == NULL) {
  764. FreeXid(xid);
  765. return -EIO;
  766. }
  767. cifs_sb = CIFS_SB(file->f_dentry->d_sb);
  768. pTcon = cifs_sb->tcon;
  769. if(pTcon == NULL)
  770. return -EINVAL;
  771. switch ((int) file->f_pos) {
  772. case 0:
  773. /*if (filldir(direntry, ".", 1, file->f_pos,
  774. file->f_dentry->d_inode->i_ino, DT_DIR) < 0) {
  775. cERROR(1, ("Filldir for current dir failed "));
  776. rc = -ENOMEM;
  777. break;
  778. }
  779. file->f_pos++; */
  780. case 1:
  781. /* if (filldir(direntry, "..", 2, file->f_pos,
  782. file->f_dentry->d_parent->d_inode->i_ino, DT_DIR) < 0) {
  783. cERROR(1, ("Filldir for parent dir failed "));
  784. rc = -ENOMEM;
  785. break;
  786. }
  787. file->f_pos++; */
  788. case 2:
  789. /* 1) If search is active,
  790. is in current search buffer?
  791. if it before then restart search
  792. if after then keep searching till find it */
  793. if(file->private_data == NULL) {
  794. rc = initiate_cifs_search(xid,file);
  795. cFYI(1,("initiate cifs search rc %d",rc));
  796. if(rc) {
  797. FreeXid(xid);
  798. return rc;
  799. }
  800. }
  801. default:
  802. if(file->private_data == NULL) {
  803. rc = -EINVAL;
  804. FreeXid(xid);
  805. return rc;
  806. }
  807. cifsFile = file->private_data;
  808. if (cifsFile->srch_inf.endOfSearch) {
  809. if(cifsFile->srch_inf.emptyDir) {
  810. cFYI(1, ("End of search, empty dir"));
  811. rc = 0;
  812. break;
  813. }
  814. } /* else {
  815. cifsFile->invalidHandle = TRUE;
  816. CIFSFindClose(xid, pTcon, cifsFile->netfid);
  817. }
  818. kfree(cifsFile->search_resume_name);
  819. cifsFile->search_resume_name = NULL; */
  820. /* BB account for . and .. in f_pos as special case */
  821. rc = find_cifs_entry(xid,pTcon, file,
  822. &current_entry,&num_to_fill);
  823. if(rc) {
  824. cFYI(1,("fce error %d",rc));
  825. goto rddir2_exit;
  826. } else if (current_entry != NULL) {
  827. cFYI(1,("entry %lld found",file->f_pos));
  828. } else {
  829. cFYI(1,("could not find entry"));
  830. goto rddir2_exit;
  831. }
  832. cFYI(1,("loop through %d times filling dir for net buf %p",
  833. num_to_fill,cifsFile->srch_inf.ntwrk_buf_start));
  834. end_of_smb = cifsFile->srch_inf.ntwrk_buf_start +
  835. smbCalcSize((struct smb_hdr *)
  836. cifsFile->srch_inf.ntwrk_buf_start);
  837. /* To be safe - for UCS to UTF-8 with strings loaded
  838. with the rare long characters alloc more to account for
  839. such multibyte target UTF-8 characters. cifs_unicode.c,
  840. which actually does the conversion, has the same limit */
  841. tmp_buf = kmalloc((2 * NAME_MAX) + 4, GFP_KERNEL);
  842. for(i=0;(i<num_to_fill) && (rc == 0);i++) {
  843. if(current_entry == NULL) {
  844. /* evaluate whether this case is an error */
  845. cERROR(1,("past end of SMB num to fill %d i %d",
  846. num_to_fill, i));
  847. break;
  848. }
  849. rc = cifs_filldir(current_entry, file,
  850. filldir, direntry,tmp_buf);
  851. file->f_pos++;
  852. if(file->f_pos == cifsFile->srch_inf.index_of_last_entry) {
  853. cFYI(1,("last entry in buf at pos %lld %s",
  854. file->f_pos,tmp_buf)); /* BB removeme BB */
  855. cifs_save_resume_key(current_entry,cifsFile);
  856. break;
  857. } else
  858. current_entry = nxt_dir_entry(current_entry,
  859. end_of_smb);
  860. }
  861. kfree(tmp_buf);
  862. break;
  863. } /* end switch */
  864. rddir2_exit:
  865. FreeXid(xid);
  866. return rc;
  867. }