readdir.c 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870
  1. /*
  2. * fs/cifs/readdir.c
  3. *
  4. * Directory search handling
  5. *
  6. * Copyright (C) International Business Machines Corp., 2004
  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. tmp_dentry->d_op = &cifs_dentry_ops;
  88. if(*ptmp_inode == NULL)
  89. return rc;
  90. rc = 1;
  91. d_instantiate(tmp_dentry, *ptmp_inode);
  92. d_rehash(tmp_dentry);
  93. }
  94. tmp_dentry->d_time = jiffies;
  95. *pnew_dentry = tmp_dentry;
  96. return rc;
  97. }
  98. static void fill_in_inode(struct inode *tmp_inode,
  99. FILE_DIRECTORY_INFO *pfindData, int *pobject_type)
  100. {
  101. struct cifsInodeInfo *cifsInfo = CIFS_I(tmp_inode);
  102. struct cifs_sb_info *cifs_sb = CIFS_SB(tmp_inode->i_sb);
  103. __u32 attr = le32_to_cpu(pfindData->ExtFileAttributes);
  104. __u64 allocation_size = le64_to_cpu(pfindData->AllocationSize);
  105. __u64 end_of_file = le64_to_cpu(pfindData->EndOfFile);
  106. cifsInfo->cifsAttrs = attr;
  107. cifsInfo->time = jiffies;
  108. /* Linux can not store file creation time unfortunately so ignore it */
  109. tmp_inode->i_atime =
  110. cifs_NTtimeToUnix(le64_to_cpu(pfindData->LastAccessTime));
  111. tmp_inode->i_mtime =
  112. cifs_NTtimeToUnix(le64_to_cpu(pfindData->LastWriteTime));
  113. tmp_inode->i_ctime =
  114. cifs_NTtimeToUnix(le64_to_cpu(pfindData->ChangeTime));
  115. /* treat dos attribute of read-only as read-only mode bit e.g. 555? */
  116. /* 2767 perms - indicate mandatory locking */
  117. /* BB fill in uid and gid here? with help from winbind?
  118. or retrieve from NTFS stream extended attribute */
  119. if (atomic_read(&cifsInfo->inUse) == 0) {
  120. tmp_inode->i_uid = cifs_sb->mnt_uid;
  121. tmp_inode->i_gid = cifs_sb->mnt_gid;
  122. /* set default mode. will override for dirs below */
  123. tmp_inode->i_mode = cifs_sb->mnt_file_mode;
  124. }
  125. cFYI(0,("CIFS FFIRST: Attributes came in as 0x%x",attr));
  126. if (attr & ATTR_DIRECTORY) {
  127. *pobject_type = DT_DIR;
  128. /* override default perms since we do not lock dirs */
  129. if(atomic_read(&cifsInfo->inUse) == 0) {
  130. tmp_inode->i_mode = cifs_sb->mnt_dir_mode;
  131. }
  132. tmp_inode->i_mode |= S_IFDIR;
  133. /* we no longer mark these because we could not follow them */
  134. /* } else if (attr & ATTR_REPARSE) {
  135. *pobject_type = DT_LNK;
  136. tmp_inode->i_mode |= S_IFLNK; */
  137. } else {
  138. *pobject_type = DT_REG;
  139. tmp_inode->i_mode |= S_IFREG;
  140. if (attr & ATTR_READONLY)
  141. tmp_inode->i_mode &= ~(S_IWUGO);
  142. } /* could add code here - to validate if device or weird share type? */
  143. /* can not fill in nlink here as in qpathinfo version and Unx search */
  144. if (atomic_read(&cifsInfo->inUse) == 0) {
  145. atomic_set(&cifsInfo->inUse, 1);
  146. }
  147. if (is_size_safe_to_change(cifsInfo)) {
  148. /* can not safely change the file size here if the
  149. client is writing to it due to potential races */
  150. i_size_write(tmp_inode, end_of_file);
  151. /* 512 bytes (2**9) is the fake blocksize that must be used */
  152. /* for this calculation, even though the reported blocksize is larger */
  153. tmp_inode->i_blocks = (512 - 1 + allocation_size) >> 9;
  154. }
  155. if (allocation_size < end_of_file)
  156. cFYI(1, ("May be sparse file, allocation less than file size"));
  157. cFYI(1,
  158. ("File Size %ld and blocks %ld and blocksize %ld",
  159. (unsigned long)tmp_inode->i_size, tmp_inode->i_blocks,
  160. tmp_inode->i_blksize));
  161. if (S_ISREG(tmp_inode->i_mode)) {
  162. cFYI(1, (" File inode "));
  163. tmp_inode->i_op = &cifs_file_inode_ops;
  164. if(cifs_sb->mnt_cifs_flags & CIFS_MOUNT_DIRECT_IO)
  165. tmp_inode->i_fop = &cifs_file_direct_ops;
  166. else
  167. tmp_inode->i_fop = &cifs_file_ops;
  168. tmp_inode->i_data.a_ops = &cifs_addr_ops;
  169. } else if (S_ISDIR(tmp_inode->i_mode)) {
  170. cFYI(1, (" Directory inode"));
  171. tmp_inode->i_op = &cifs_dir_inode_ops;
  172. tmp_inode->i_fop = &cifs_dir_ops;
  173. } else if (S_ISLNK(tmp_inode->i_mode)) {
  174. cFYI(1, (" Symbolic Link inode "));
  175. tmp_inode->i_op = &cifs_symlink_inode_ops;
  176. } else {
  177. cFYI(1, (" Init special inode "));
  178. init_special_inode(tmp_inode, tmp_inode->i_mode,
  179. tmp_inode->i_rdev);
  180. }
  181. }
  182. static void unix_fill_in_inode(struct inode *tmp_inode,
  183. FILE_UNIX_INFO *pfindData, int *pobject_type)
  184. {
  185. struct cifsInodeInfo *cifsInfo = CIFS_I(tmp_inode);
  186. struct cifs_sb_info *cifs_sb = CIFS_SB(tmp_inode->i_sb);
  187. __u32 type = le32_to_cpu(pfindData->Type);
  188. __u64 num_of_bytes = le64_to_cpu(pfindData->NumOfBytes);
  189. __u64 end_of_file = le64_to_cpu(pfindData->EndOfFile);
  190. cifsInfo->time = jiffies;
  191. atomic_inc(&cifsInfo->inUse);
  192. tmp_inode->i_atime =
  193. cifs_NTtimeToUnix(le64_to_cpu(pfindData->LastAccessTime));
  194. tmp_inode->i_mtime =
  195. cifs_NTtimeToUnix(le64_to_cpu(pfindData->LastModificationTime));
  196. tmp_inode->i_ctime =
  197. cifs_NTtimeToUnix(le64_to_cpu(pfindData->LastStatusChange));
  198. tmp_inode->i_mode = le64_to_cpu(pfindData->Permissions);
  199. if (type == UNIX_FILE) {
  200. *pobject_type = DT_REG;
  201. tmp_inode->i_mode |= S_IFREG;
  202. } else if (type == UNIX_SYMLINK) {
  203. *pobject_type = DT_LNK;
  204. tmp_inode->i_mode |= S_IFLNK;
  205. } else if (type == UNIX_DIR) {
  206. *pobject_type = DT_DIR;
  207. tmp_inode->i_mode |= S_IFDIR;
  208. } else if (type == UNIX_CHARDEV) {
  209. *pobject_type = DT_CHR;
  210. tmp_inode->i_mode |= S_IFCHR;
  211. tmp_inode->i_rdev = MKDEV(le64_to_cpu(pfindData->DevMajor),
  212. le64_to_cpu(pfindData->DevMinor) & MINORMASK);
  213. } else if (type == UNIX_BLOCKDEV) {
  214. *pobject_type = DT_BLK;
  215. tmp_inode->i_mode |= S_IFBLK;
  216. tmp_inode->i_rdev = MKDEV(le64_to_cpu(pfindData->DevMajor),
  217. le64_to_cpu(pfindData->DevMinor) & MINORMASK);
  218. } else if (type == UNIX_FIFO) {
  219. *pobject_type = DT_FIFO;
  220. tmp_inode->i_mode |= S_IFIFO;
  221. } else if (type == UNIX_SOCKET) {
  222. *pobject_type = DT_SOCK;
  223. tmp_inode->i_mode |= S_IFSOCK;
  224. }
  225. tmp_inode->i_uid = le64_to_cpu(pfindData->Uid);
  226. tmp_inode->i_gid = le64_to_cpu(pfindData->Gid);
  227. tmp_inode->i_nlink = le64_to_cpu(pfindData->Nlinks);
  228. if (is_size_safe_to_change(cifsInfo)) {
  229. /* can not safely change the file size here if the
  230. client is writing to it due to potential races */
  231. i_size_write(tmp_inode,end_of_file);
  232. /* 512 bytes (2**9) is the fake blocksize that must be used */
  233. /* for this calculation, not the real blocksize */
  234. tmp_inode->i_blocks = (512 - 1 + num_of_bytes) >> 9;
  235. }
  236. if (S_ISREG(tmp_inode->i_mode)) {
  237. cFYI(1, ("File inode"));
  238. tmp_inode->i_op = &cifs_file_inode_ops;
  239. if(cifs_sb->mnt_cifs_flags & CIFS_MOUNT_DIRECT_IO)
  240. tmp_inode->i_fop = &cifs_file_direct_ops;
  241. else
  242. tmp_inode->i_fop = &cifs_file_ops;
  243. tmp_inode->i_data.a_ops = &cifs_addr_ops;
  244. } else if (S_ISDIR(tmp_inode->i_mode)) {
  245. cFYI(1, ("Directory inode"));
  246. tmp_inode->i_op = &cifs_dir_inode_ops;
  247. tmp_inode->i_fop = &cifs_dir_ops;
  248. } else if (S_ISLNK(tmp_inode->i_mode)) {
  249. cFYI(1, ("Symbolic Link inode"));
  250. tmp_inode->i_op = &cifs_symlink_inode_ops;
  251. /* tmp_inode->i_fop = *//* do not need to set to anything */
  252. } else {
  253. cFYI(1, ("Special inode"));
  254. init_special_inode(tmp_inode, tmp_inode->i_mode,
  255. tmp_inode->i_rdev);
  256. }
  257. }
  258. static int initiate_cifs_search(const int xid, struct file *file)
  259. {
  260. int rc = 0;
  261. char * full_path;
  262. struct cifsFileInfo * cifsFile;
  263. struct cifs_sb_info *cifs_sb;
  264. struct cifsTconInfo *pTcon;
  265. if(file->private_data == NULL) {
  266. file->private_data =
  267. kmalloc(sizeof(struct cifsFileInfo),GFP_KERNEL);
  268. }
  269. if(file->private_data == NULL) {
  270. return -ENOMEM;
  271. } else {
  272. memset(file->private_data,0,sizeof(struct cifsFileInfo));
  273. }
  274. cifsFile = file->private_data;
  275. cifsFile->invalidHandle = TRUE;
  276. cifsFile->srch_inf.endOfSearch = FALSE;
  277. if(file->f_dentry == NULL)
  278. return -ENOENT;
  279. cifs_sb = CIFS_SB(file->f_dentry->d_sb);
  280. if(cifs_sb == NULL)
  281. return -EINVAL;
  282. pTcon = cifs_sb->tcon;
  283. if(pTcon == NULL)
  284. return -EINVAL;
  285. down(&file->f_dentry->d_sb->s_vfs_rename_sem);
  286. full_path = build_path_from_dentry(file->f_dentry);
  287. up(&file->f_dentry->d_sb->s_vfs_rename_sem);
  288. if(full_path == NULL) {
  289. return -ENOMEM;
  290. }
  291. cFYI(1, ("Full path: %s start at: %lld ", full_path, file->f_pos));
  292. ffirst_retry:
  293. /* test for Unix extensions */
  294. if (pTcon->ses->capabilities & CAP_UNIX) {
  295. cifsFile->srch_inf.info_level = SMB_FIND_FILE_UNIX;
  296. } else if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM) {
  297. cifsFile->srch_inf.info_level = SMB_FIND_FILE_ID_FULL_DIR_INFO;
  298. } else /* not srvinos - BB fixme add check for backlevel? */ {
  299. cifsFile->srch_inf.info_level = SMB_FIND_FILE_DIRECTORY_INFO;
  300. }
  301. rc = CIFSFindFirst(xid, pTcon,full_path,cifs_sb->local_nls,
  302. &cifsFile->netfid, &cifsFile->srch_inf,
  303. cifs_sb->mnt_cifs_flags & CIFS_MOUNT_MAP_SPECIAL_CHR);
  304. if(rc == 0)
  305. cifsFile->invalidHandle = FALSE;
  306. if((rc == -EOPNOTSUPP) &&
  307. (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM)) {
  308. cifs_sb->mnt_cifs_flags &= ~CIFS_MOUNT_SERVER_INUM;
  309. goto ffirst_retry;
  310. }
  311. kfree(full_path);
  312. return rc;
  313. }
  314. /* return length of unicode string in bytes */
  315. static int cifs_unicode_bytelen(char *str)
  316. {
  317. int len;
  318. __le16 * ustr = (__le16 *)str;
  319. for(len=0;len <= PATH_MAX;len++) {
  320. if(ustr[len] == 0)
  321. return len << 1;
  322. }
  323. cFYI(1,("Unicode string longer than PATH_MAX found"));
  324. return len << 1;
  325. }
  326. static char *nxt_dir_entry(char *old_entry, char *end_of_smb)
  327. {
  328. char * new_entry;
  329. FILE_DIRECTORY_INFO * pDirInfo = (FILE_DIRECTORY_INFO *)old_entry;
  330. new_entry = old_entry + le32_to_cpu(pDirInfo->NextEntryOffset);
  331. cFYI(1,("new entry %p old entry %p",new_entry,old_entry));
  332. /* validate that new_entry is not past end of SMB */
  333. if(new_entry >= end_of_smb) {
  334. cFYI(1,("search entry %p began after end of SMB %p old entry %p",
  335. new_entry,end_of_smb,old_entry));
  336. return NULL;
  337. } else
  338. return new_entry;
  339. }
  340. #define UNICODE_DOT cpu_to_le16(0x2e)
  341. /* return 0 if no match and 1 for . (current directory) and 2 for .. (parent) */
  342. static int cifs_entry_is_dot(char *current_entry, struct cifsFileInfo *cfile)
  343. {
  344. int rc = 0;
  345. char * filename = NULL;
  346. int len = 0;
  347. if(cfile->srch_inf.info_level == 0x202) {
  348. FILE_UNIX_INFO * pFindData = (FILE_UNIX_INFO *)current_entry;
  349. filename = &pFindData->FileName[0];
  350. if(cfile->srch_inf.unicode) {
  351. len = cifs_unicode_bytelen(filename);
  352. } else {
  353. /* BB should we make this strnlen of PATH_MAX? */
  354. len = strnlen(filename, 5);
  355. }
  356. } else if(cfile->srch_inf.info_level == 0x101) {
  357. FILE_DIRECTORY_INFO * pFindData =
  358. (FILE_DIRECTORY_INFO *)current_entry;
  359. filename = &pFindData->FileName[0];
  360. len = le32_to_cpu(pFindData->FileNameLength);
  361. } else if(cfile->srch_inf.info_level == 0x102) {
  362. FILE_FULL_DIRECTORY_INFO * pFindData =
  363. (FILE_FULL_DIRECTORY_INFO *)current_entry;
  364. filename = &pFindData->FileName[0];
  365. len = le32_to_cpu(pFindData->FileNameLength);
  366. } else if(cfile->srch_inf.info_level == 0x105) {
  367. SEARCH_ID_FULL_DIR_INFO * pFindData =
  368. (SEARCH_ID_FULL_DIR_INFO *)current_entry;
  369. filename = &pFindData->FileName[0];
  370. len = le32_to_cpu(pFindData->FileNameLength);
  371. } else if(cfile->srch_inf.info_level == 0x104) {
  372. FILE_BOTH_DIRECTORY_INFO * pFindData =
  373. (FILE_BOTH_DIRECTORY_INFO *)current_entry;
  374. filename = &pFindData->FileName[0];
  375. len = le32_to_cpu(pFindData->FileNameLength);
  376. } else {
  377. cFYI(1,("Unknown findfirst level %d",cfile->srch_inf.info_level));
  378. }
  379. if(filename) {
  380. if(cfile->srch_inf.unicode) {
  381. __le16 *ufilename = (__le16 *)filename;
  382. if(len == 2) {
  383. /* check for . */
  384. if(ufilename[0] == UNICODE_DOT)
  385. rc = 1;
  386. } else if(len == 4) {
  387. /* check for .. */
  388. if((ufilename[0] == UNICODE_DOT)
  389. &&(ufilename[1] == UNICODE_DOT))
  390. rc = 2;
  391. }
  392. } else /* ASCII */ {
  393. if(len == 1) {
  394. if(filename[0] == '.')
  395. rc = 1;
  396. } else if(len == 2) {
  397. if((filename[0] == '.') && (filename[1] == '.'))
  398. rc = 2;
  399. }
  400. }
  401. }
  402. return rc;
  403. }
  404. /* find the corresponding entry in the search */
  405. /* Note that the SMB server returns search entries for . and .. which
  406. complicates logic here if we choose to parse for them and we do not
  407. assume that they are located in the findfirst return buffer.*/
  408. /* We start counting in the buffer with entry 2 and increment for every
  409. entry (do not increment for . or .. entry) */
  410. static int find_cifs_entry(const int xid, struct cifsTconInfo *pTcon,
  411. struct file *file, char **ppCurrentEntry, int *num_to_ret)
  412. {
  413. int rc = 0;
  414. int pos_in_buf = 0;
  415. loff_t first_entry_in_buffer;
  416. loff_t index_to_find = file->f_pos;
  417. struct cifsFileInfo * cifsFile = file->private_data;
  418. /* check if index in the buffer */
  419. if((cifsFile == NULL) || (ppCurrentEntry == NULL) || (num_to_ret == NULL))
  420. return -ENOENT;
  421. *ppCurrentEntry = NULL;
  422. first_entry_in_buffer =
  423. cifsFile->srch_inf.index_of_last_entry -
  424. cifsFile->srch_inf.entries_in_buffer;
  425. /* dump_cifs_file_struct(file, "In fce ");*/
  426. if(index_to_find < first_entry_in_buffer) {
  427. /* close and restart search */
  428. cFYI(1,("search backing up - close and restart search"));
  429. cifsFile->invalidHandle = TRUE;
  430. CIFSFindClose(xid, pTcon, cifsFile->netfid);
  431. kfree(cifsFile->search_resume_name);
  432. cifsFile->search_resume_name = NULL;
  433. if(cifsFile->srch_inf.ntwrk_buf_start) {
  434. cFYI(1,("freeing SMB ff cache buf on search rewind"));
  435. cifs_buf_release(cifsFile->srch_inf.ntwrk_buf_start);
  436. }
  437. rc = initiate_cifs_search(xid,file);
  438. if(rc) {
  439. cFYI(1,("error %d reinitiating a search on rewind",rc));
  440. return rc;
  441. }
  442. }
  443. while((index_to_find >= cifsFile->srch_inf.index_of_last_entry) &&
  444. (rc == 0) && (cifsFile->srch_inf.endOfSearch == FALSE)){
  445. cFYI(1,("calling findnext2"));
  446. rc = CIFSFindNext(xid,pTcon,cifsFile->netfid, &cifsFile->srch_inf);
  447. if(rc)
  448. return -ENOENT;
  449. }
  450. if(index_to_find < cifsFile->srch_inf.index_of_last_entry) {
  451. /* we found the buffer that contains the entry */
  452. /* scan and find it */
  453. int i;
  454. char * current_entry;
  455. char * end_of_smb = cifsFile->srch_inf.ntwrk_buf_start +
  456. smbCalcSize((struct smb_hdr *)
  457. cifsFile->srch_inf.ntwrk_buf_start);
  458. /* dump_cifs_file_struct(file,"found entry in fce "); */
  459. first_entry_in_buffer = cifsFile->srch_inf.index_of_last_entry
  460. - cifsFile->srch_inf.entries_in_buffer;
  461. pos_in_buf = index_to_find - first_entry_in_buffer;
  462. cFYI(1,("found entry - pos_in_buf %d",pos_in_buf));
  463. current_entry = cifsFile->srch_inf.srch_entries_start;
  464. for(i=0;(i<(pos_in_buf)) && (current_entry != NULL);i++) {
  465. /* go entry to next entry figuring out which we need to start with */
  466. /* if( . or ..)
  467. skip */
  468. rc = cifs_entry_is_dot(current_entry,cifsFile);
  469. if(rc == 1) /* is . or .. so skip */ {
  470. cFYI(1,("Entry is .")); /* BB removeme BB */
  471. /* continue; */
  472. } else if (rc == 2 ) {
  473. cFYI(1,("Entry is ..")); /* BB removeme BB */
  474. /* continue; */
  475. }
  476. current_entry = nxt_dir_entry(current_entry,end_of_smb);
  477. }
  478. if((current_entry == NULL) && (i < pos_in_buf)) {
  479. /* BB fixme - check if we should flag this error */
  480. cERROR(1,("reached end of buf searching for pos in buf"
  481. " %d index to find %lld rc %d",
  482. pos_in_buf,index_to_find,rc));
  483. }
  484. rc = 0;
  485. *ppCurrentEntry = current_entry;
  486. } else {
  487. cFYI(1,("index not in buffer - could not findnext into it"));
  488. return 0;
  489. }
  490. if(pos_in_buf >= cifsFile->srch_inf.entries_in_buffer) {
  491. cFYI(1,("can not return entries when pos_in_buf beyond last entry"));
  492. *num_to_ret = 0;
  493. } else
  494. *num_to_ret = cifsFile->srch_inf.entries_in_buffer - pos_in_buf;
  495. /* dump_cifs_file_struct(file, "end fce ");*/
  496. return rc;
  497. }
  498. /* inode num, inode type and filename returned */
  499. static int cifs_get_name_from_search_buf(struct qstr *pqst,
  500. char *current_entry, __u16 level, unsigned int unicode,
  501. struct cifs_sb_info * cifs_sb, ino_t *pinum)
  502. {
  503. int rc = 0;
  504. unsigned int len = 0;
  505. char * filename;
  506. struct nls_table * nlt = cifs_sb->local_nls;
  507. *pinum = 0;
  508. if(level == SMB_FIND_FILE_UNIX) {
  509. FILE_UNIX_INFO * pFindData = (FILE_UNIX_INFO *)current_entry;
  510. filename = &pFindData->FileName[0];
  511. if(unicode) {
  512. len = cifs_unicode_bytelen(filename);
  513. } else {
  514. /* BB should we make this strnlen of PATH_MAX? */
  515. len = strnlen(filename, PATH_MAX);
  516. }
  517. /* BB fixme - hash low and high 32 bits if not 64 bit arch BB fixme */
  518. if(cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM)
  519. *pinum = pFindData->UniqueId;
  520. } else if(level == SMB_FIND_FILE_DIRECTORY_INFO) {
  521. FILE_DIRECTORY_INFO * pFindData =
  522. (FILE_DIRECTORY_INFO *)current_entry;
  523. filename = &pFindData->FileName[0];
  524. len = le32_to_cpu(pFindData->FileNameLength);
  525. } else if(level == SMB_FIND_FILE_FULL_DIRECTORY_INFO) {
  526. FILE_FULL_DIRECTORY_INFO * pFindData =
  527. (FILE_FULL_DIRECTORY_INFO *)current_entry;
  528. filename = &pFindData->FileName[0];
  529. len = le32_to_cpu(pFindData->FileNameLength);
  530. } else if(level == SMB_FIND_FILE_ID_FULL_DIR_INFO) {
  531. SEARCH_ID_FULL_DIR_INFO * pFindData =
  532. (SEARCH_ID_FULL_DIR_INFO *)current_entry;
  533. filename = &pFindData->FileName[0];
  534. len = le32_to_cpu(pFindData->FileNameLength);
  535. *pinum = pFindData->UniqueId;
  536. } else if(level == SMB_FIND_FILE_BOTH_DIRECTORY_INFO) {
  537. FILE_BOTH_DIRECTORY_INFO * pFindData =
  538. (FILE_BOTH_DIRECTORY_INFO *)current_entry;
  539. filename = &pFindData->FileName[0];
  540. len = le32_to_cpu(pFindData->FileNameLength);
  541. } else {
  542. cFYI(1,("Unknown findfirst level %d",level));
  543. return -EINVAL;
  544. }
  545. if(unicode) {
  546. /* BB fixme - test with long names */
  547. /* Note converted filename can be longer than in unicode */
  548. if(cifs_sb->mnt_cifs_flags & CIFS_MOUNT_MAP_SPECIAL_CHR)
  549. pqst->len = cifs_convertUCSpath((char *)pqst->name,
  550. (__le16 *)filename, len/2, nlt);
  551. else
  552. pqst->len = cifs_strfromUCS_le((char *)pqst->name,
  553. (wchar_t *)filename,len/2,nlt);
  554. } else {
  555. pqst->name = filename;
  556. pqst->len = len;
  557. }
  558. pqst->hash = full_name_hash(pqst->name,pqst->len);
  559. /* cFYI(1,("filldir on %s",pqst->name)); */
  560. return rc;
  561. }
  562. static int cifs_filldir(char *pfindEntry, struct file *file,
  563. filldir_t filldir, void *direntry, char *scratch_buf)
  564. {
  565. int rc = 0;
  566. struct qstr qstring;
  567. struct cifsFileInfo * pCifsF;
  568. unsigned obj_type;
  569. ino_t inum;
  570. struct cifs_sb_info * cifs_sb;
  571. struct inode *tmp_inode;
  572. struct dentry *tmp_dentry;
  573. /* get filename and len into qstring */
  574. /* get dentry */
  575. /* decide whether to create and populate ionde */
  576. if((direntry == NULL) || (file == NULL))
  577. return -EINVAL;
  578. pCifsF = file->private_data;
  579. if((scratch_buf == NULL) || (pfindEntry == NULL) || (pCifsF == NULL))
  580. return -ENOENT;
  581. if(file->f_dentry == NULL)
  582. return -ENOENT;
  583. cifs_sb = CIFS_SB(file->f_dentry->d_sb);
  584. qstring.name = scratch_buf;
  585. rc = cifs_get_name_from_search_buf(&qstring,pfindEntry,
  586. pCifsF->srch_inf.info_level,
  587. pCifsF->srch_inf.unicode,cifs_sb,
  588. &inum /* returned */);
  589. if(rc)
  590. return rc;
  591. rc = construct_dentry(&qstring,file,&tmp_inode, &tmp_dentry);
  592. if((tmp_inode == NULL) || (tmp_dentry == NULL))
  593. return -ENOMEM;
  594. if(rc) {
  595. /* inode created, we need to hash it with right inode number */
  596. if(inum != 0) {
  597. /* BB fixme - hash the 2 32 quantities bits together if necessary BB */
  598. tmp_inode->i_ino = inum;
  599. }
  600. insert_inode_hash(tmp_inode);
  601. }
  602. if(pCifsF->srch_inf.info_level == SMB_FIND_FILE_UNIX) {
  603. unix_fill_in_inode(tmp_inode,(FILE_UNIX_INFO *)pfindEntry,&obj_type);
  604. } else {
  605. fill_in_inode(tmp_inode,(FILE_DIRECTORY_INFO *)pfindEntry,&obj_type);
  606. }
  607. rc = filldir(direntry,qstring.name,qstring.len,file->f_pos,tmp_inode->i_ino,obj_type);
  608. if(rc) {
  609. cFYI(1,("filldir rc = %d",rc));
  610. }
  611. dput(tmp_dentry);
  612. return rc;
  613. }
  614. static int cifs_save_resume_key(const char *current_entry,
  615. struct cifsFileInfo *cifsFile)
  616. {
  617. int rc = 0;
  618. unsigned int len = 0;
  619. __u16 level;
  620. char * filename;
  621. if((cifsFile == NULL) || (current_entry == NULL))
  622. return -EINVAL;
  623. level = cifsFile->srch_inf.info_level;
  624. if(level == SMB_FIND_FILE_UNIX) {
  625. FILE_UNIX_INFO * pFindData = (FILE_UNIX_INFO *)current_entry;
  626. filename = &pFindData->FileName[0];
  627. if(cifsFile->srch_inf.unicode) {
  628. len = cifs_unicode_bytelen(filename);
  629. } else {
  630. /* BB should we make this strnlen of PATH_MAX? */
  631. len = strnlen(filename, PATH_MAX);
  632. }
  633. cifsFile->srch_inf.resume_key = pFindData->ResumeKey;
  634. } else if(level == SMB_FIND_FILE_DIRECTORY_INFO) {
  635. FILE_DIRECTORY_INFO * pFindData =
  636. (FILE_DIRECTORY_INFO *)current_entry;
  637. filename = &pFindData->FileName[0];
  638. len = le32_to_cpu(pFindData->FileNameLength);
  639. cifsFile->srch_inf.resume_key = pFindData->FileIndex;
  640. } else if(level == SMB_FIND_FILE_FULL_DIRECTORY_INFO) {
  641. FILE_FULL_DIRECTORY_INFO * pFindData =
  642. (FILE_FULL_DIRECTORY_INFO *)current_entry;
  643. filename = &pFindData->FileName[0];
  644. len = le32_to_cpu(pFindData->FileNameLength);
  645. cifsFile->srch_inf.resume_key = pFindData->FileIndex;
  646. } else if(level == SMB_FIND_FILE_ID_FULL_DIR_INFO) {
  647. SEARCH_ID_FULL_DIR_INFO * pFindData =
  648. (SEARCH_ID_FULL_DIR_INFO *)current_entry;
  649. filename = &pFindData->FileName[0];
  650. len = le32_to_cpu(pFindData->FileNameLength);
  651. cifsFile->srch_inf.resume_key = pFindData->FileIndex;
  652. } else if(level == SMB_FIND_FILE_BOTH_DIRECTORY_INFO) {
  653. FILE_BOTH_DIRECTORY_INFO * pFindData =
  654. (FILE_BOTH_DIRECTORY_INFO *)current_entry;
  655. filename = &pFindData->FileName[0];
  656. len = le32_to_cpu(pFindData->FileNameLength);
  657. cifsFile->srch_inf.resume_key = pFindData->FileIndex;
  658. } else {
  659. cFYI(1,("Unknown findfirst level %d",level));
  660. return -EINVAL;
  661. }
  662. cifsFile->srch_inf.resume_name_len = len;
  663. cifsFile->srch_inf.presume_name = filename;
  664. return rc;
  665. }
  666. int cifs_readdir(struct file *file, void *direntry, filldir_t filldir)
  667. {
  668. int rc = 0;
  669. int xid,i;
  670. struct cifs_sb_info *cifs_sb;
  671. struct cifsTconInfo *pTcon;
  672. struct cifsFileInfo *cifsFile = NULL;
  673. char * current_entry;
  674. int num_to_fill = 0;
  675. char * tmp_buf = NULL;
  676. char * end_of_smb;
  677. xid = GetXid();
  678. if(file->f_dentry == NULL) {
  679. FreeXid(xid);
  680. return -EIO;
  681. }
  682. /* dump_cifs_file_struct(file, "Begin rdir "); */
  683. cifs_sb = CIFS_SB(file->f_dentry->d_sb);
  684. pTcon = cifs_sb->tcon;
  685. if(pTcon == NULL)
  686. return -EINVAL;
  687. /* cFYI(1,("readdir2 pos: %lld",file->f_pos)); */
  688. switch ((int) file->f_pos) {
  689. case 0:
  690. /*if (filldir(direntry, ".", 1, file->f_pos,
  691. file->f_dentry->d_inode->i_ino, DT_DIR) < 0) {
  692. cERROR(1, ("Filldir for current dir failed "));
  693. rc = -ENOMEM;
  694. break;
  695. }
  696. file->f_pos++; */
  697. case 1:
  698. /* if (filldir(direntry, "..", 2, file->f_pos,
  699. file->f_dentry->d_parent->d_inode->i_ino, DT_DIR) < 0) {
  700. cERROR(1, ("Filldir for parent dir failed "));
  701. rc = -ENOMEM;
  702. break;
  703. }
  704. file->f_pos++; */
  705. case 2:
  706. /* 1) If search is active,
  707. is in current search buffer?
  708. if it before then restart search
  709. if after then keep searching till find it */
  710. if(file->private_data == NULL) {
  711. rc = initiate_cifs_search(xid,file);
  712. cFYI(1,("initiate cifs search rc %d",rc));
  713. if(rc) {
  714. FreeXid(xid);
  715. return rc;
  716. }
  717. }
  718. default:
  719. if(file->private_data == NULL) {
  720. rc = -EINVAL;
  721. FreeXid(xid);
  722. return rc;
  723. }
  724. cifsFile = file->private_data;
  725. if (cifsFile->srch_inf.endOfSearch) {
  726. if(cifsFile->srch_inf.emptyDir) {
  727. cFYI(1, ("End of search, empty dir"));
  728. rc = 0;
  729. break;
  730. }
  731. } /* else {
  732. cifsFile->invalidHandle = TRUE;
  733. CIFSFindClose(xid, pTcon, cifsFile->netfid);
  734. }
  735. kfree(cifsFile->search_resume_name);
  736. cifsFile->search_resume_name = NULL; */
  737. /* BB account for . and .. in f_pos as special case */
  738. /* dump_cifs_file_struct(file, "rdir after default ");*/
  739. rc = find_cifs_entry(xid,pTcon, file,
  740. &current_entry,&num_to_fill);
  741. if(rc) {
  742. cFYI(1,("fce error %d",rc));
  743. goto rddir2_exit;
  744. } else if (current_entry != NULL) {
  745. cFYI(1,("entry %lld found",file->f_pos));
  746. } else {
  747. cFYI(1,("could not find entry"));
  748. goto rddir2_exit;
  749. }
  750. cFYI(1,("loop through %d times filling dir for net buf %p",
  751. num_to_fill,cifsFile->srch_inf.ntwrk_buf_start));
  752. end_of_smb = cifsFile->srch_inf.ntwrk_buf_start +
  753. smbCalcSize((struct smb_hdr *)
  754. cifsFile->srch_inf.ntwrk_buf_start);
  755. /* To be safe - for UCS to UTF-8 with strings loaded
  756. with the rare long characters alloc more to account for
  757. such multibyte target UTF-8 characters. cifs_unicode.c,
  758. which actually does the conversion, has the same limit */
  759. tmp_buf = kmalloc((2 * NAME_MAX) + 4, GFP_KERNEL);
  760. for(i=0;(i<num_to_fill) && (rc == 0);i++) {
  761. if(current_entry == NULL) {
  762. /* evaluate whether this case is an error */
  763. cERROR(1,("past end of SMB num to fill %d i %d",
  764. num_to_fill, i));
  765. break;
  766. }
  767. rc = cifs_filldir(current_entry, file,
  768. filldir, direntry,tmp_buf);
  769. file->f_pos++;
  770. if(file->f_pos == cifsFile->srch_inf.index_of_last_entry) {
  771. cFYI(1,("last entry in buf at pos %lld %s",
  772. file->f_pos,tmp_buf)); /* BB removeme BB */
  773. cifs_save_resume_key(current_entry,cifsFile);
  774. break;
  775. } else
  776. current_entry = nxt_dir_entry(current_entry,end_of_smb);
  777. }
  778. kfree(tmp_buf);
  779. break;
  780. } /* end switch */
  781. rddir2_exit:
  782. /* dump_cifs_file_struct(file, "end rdir "); */
  783. FreeXid(xid);
  784. return rc;
  785. }