readdir.c 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824
  1. /*
  2. * fs/cifs/readdir.c
  3. *
  4. * Directory search handling
  5. *
  6. * Copyright (C) International Business Machines Corp., 2004, 2008
  7. * Copyright (C) Red Hat, Inc., 2011
  8. * Author(s): Steve French (sfrench@us.ibm.com)
  9. *
  10. * This library is free software; you can redistribute it and/or modify
  11. * it under the terms of the GNU Lesser General Public License as published
  12. * by the Free Software Foundation; either version 2.1 of the License, or
  13. * (at your option) any later version.
  14. *
  15. * This library is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See
  18. * the GNU Lesser General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU Lesser General Public License
  21. * along with this library; if not, write to the Free Software
  22. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  23. */
  24. #include <linux/fs.h>
  25. #include <linux/pagemap.h>
  26. #include <linux/slab.h>
  27. #include <linux/stat.h>
  28. #include "cifspdu.h"
  29. #include "cifsglob.h"
  30. #include "cifsproto.h"
  31. #include "cifs_unicode.h"
  32. #include "cifs_debug.h"
  33. #include "cifs_fs_sb.h"
  34. #include "cifsfs.h"
  35. /*
  36. * To be safe - for UCS to UTF-8 with strings loaded with the rare long
  37. * characters alloc more to account for such multibyte target UTF-8
  38. * characters.
  39. */
  40. #define UNICODE_NAME_MAX ((4 * NAME_MAX) + 2)
  41. #ifdef CONFIG_CIFS_DEBUG2
  42. static void dump_cifs_file_struct(struct file *file, char *label)
  43. {
  44. struct cifsFileInfo *cf;
  45. if (file) {
  46. cf = file->private_data;
  47. if (cf == NULL) {
  48. cFYI(1, "empty cifs private file data");
  49. return;
  50. }
  51. if (cf->invalidHandle)
  52. cFYI(1, "invalid handle");
  53. if (cf->srch_inf.endOfSearch)
  54. cFYI(1, "end of search");
  55. if (cf->srch_inf.emptyDir)
  56. cFYI(1, "empty dir");
  57. }
  58. }
  59. #else
  60. static inline void dump_cifs_file_struct(struct file *file, char *label)
  61. {
  62. }
  63. #endif /* DEBUG2 */
  64. /*
  65. * Find the dentry that matches "name". If there isn't one, create one. If it's
  66. * a negative dentry or the uniqueid changed, then drop it and recreate it.
  67. */
  68. static struct dentry *
  69. cifs_readdir_lookup(struct dentry *parent, struct qstr *name,
  70. struct cifs_fattr *fattr)
  71. {
  72. struct dentry *dentry, *alias;
  73. struct inode *inode;
  74. struct super_block *sb = parent->d_inode->i_sb;
  75. cFYI(1, "For %s", name->name);
  76. if (parent->d_op && parent->d_op->d_hash)
  77. parent->d_op->d_hash(parent, parent->d_inode, name);
  78. else
  79. name->hash = full_name_hash(name->name, name->len);
  80. dentry = d_lookup(parent, name);
  81. if (dentry) {
  82. /* FIXME: check for inode number changes? */
  83. if (dentry->d_inode != NULL)
  84. return dentry;
  85. d_drop(dentry);
  86. dput(dentry);
  87. }
  88. dentry = d_alloc(parent, name);
  89. if (dentry == NULL)
  90. return NULL;
  91. inode = cifs_iget(sb, fattr);
  92. if (!inode) {
  93. dput(dentry);
  94. return NULL;
  95. }
  96. alias = d_materialise_unique(dentry, inode);
  97. if (alias != NULL) {
  98. dput(dentry);
  99. if (IS_ERR(alias))
  100. return NULL;
  101. dentry = alias;
  102. }
  103. return dentry;
  104. }
  105. static void
  106. cifs_fill_common_info(struct cifs_fattr *fattr, struct cifs_sb_info *cifs_sb)
  107. {
  108. fattr->cf_uid = cifs_sb->mnt_uid;
  109. fattr->cf_gid = cifs_sb->mnt_gid;
  110. if (fattr->cf_cifsattrs & ATTR_DIRECTORY) {
  111. fattr->cf_mode = S_IFDIR | cifs_sb->mnt_dir_mode;
  112. fattr->cf_dtype = DT_DIR;
  113. } else {
  114. fattr->cf_mode = S_IFREG | cifs_sb->mnt_file_mode;
  115. fattr->cf_dtype = DT_REG;
  116. }
  117. if (fattr->cf_cifsattrs & ATTR_READONLY)
  118. fattr->cf_mode &= ~S_IWUGO;
  119. if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_UNX_EMUL &&
  120. fattr->cf_cifsattrs & ATTR_SYSTEM) {
  121. if (fattr->cf_eof == 0) {
  122. fattr->cf_mode &= ~S_IFMT;
  123. fattr->cf_mode |= S_IFIFO;
  124. fattr->cf_dtype = DT_FIFO;
  125. } else {
  126. /*
  127. * trying to get the type and mode via SFU can be slow,
  128. * so just call those regular files for now, and mark
  129. * for reval
  130. */
  131. fattr->cf_flags |= CIFS_FATTR_NEED_REVAL;
  132. }
  133. }
  134. }
  135. static void
  136. cifs_dir_info_to_fattr(struct cifs_fattr *fattr, FILE_DIRECTORY_INFO *info,
  137. struct cifs_sb_info *cifs_sb)
  138. {
  139. memset(fattr, 0, sizeof(*fattr));
  140. fattr->cf_cifsattrs = le32_to_cpu(info->ExtFileAttributes);
  141. fattr->cf_eof = le64_to_cpu(info->EndOfFile);
  142. fattr->cf_bytes = le64_to_cpu(info->AllocationSize);
  143. fattr->cf_createtime = le64_to_cpu(info->CreationTime);
  144. fattr->cf_atime = cifs_NTtimeToUnix(info->LastAccessTime);
  145. fattr->cf_ctime = cifs_NTtimeToUnix(info->ChangeTime);
  146. fattr->cf_mtime = cifs_NTtimeToUnix(info->LastWriteTime);
  147. cifs_fill_common_info(fattr, cifs_sb);
  148. }
  149. static void
  150. cifs_std_info_to_fattr(struct cifs_fattr *fattr, FIND_FILE_STANDARD_INFO *info,
  151. struct cifs_sb_info *cifs_sb)
  152. {
  153. int offset = cifs_sb_master_tcon(cifs_sb)->ses->server->timeAdj;
  154. memset(fattr, 0, sizeof(*fattr));
  155. fattr->cf_atime = cnvrtDosUnixTm(info->LastAccessDate,
  156. info->LastAccessTime, offset);
  157. fattr->cf_ctime = cnvrtDosUnixTm(info->LastWriteDate,
  158. info->LastWriteTime, offset);
  159. fattr->cf_mtime = cnvrtDosUnixTm(info->LastWriteDate,
  160. info->LastWriteTime, offset);
  161. fattr->cf_cifsattrs = le16_to_cpu(info->Attributes);
  162. fattr->cf_bytes = le32_to_cpu(info->AllocationSize);
  163. fattr->cf_eof = le32_to_cpu(info->DataSize);
  164. cifs_fill_common_info(fattr, cifs_sb);
  165. }
  166. /* BB eventually need to add the following helper function to
  167. resolve NT_STATUS_STOPPED_ON_SYMLINK return code when
  168. we try to do FindFirst on (NTFS) directory symlinks */
  169. /*
  170. int get_symlink_reparse_path(char *full_path, struct cifs_sb_info *cifs_sb,
  171. int xid)
  172. {
  173. __u16 fid;
  174. int len;
  175. int oplock = 0;
  176. int rc;
  177. struct cifs_tcon *ptcon = cifs_sb_tcon(cifs_sb);
  178. char *tmpbuffer;
  179. rc = CIFSSMBOpen(xid, ptcon, full_path, FILE_OPEN, GENERIC_READ,
  180. OPEN_REPARSE_POINT, &fid, &oplock, NULL,
  181. cifs_sb->local_nls,
  182. cifs_sb->mnt_cifs_flags & CIFS_MOUNT_MAP_SPECIAL_CHR);
  183. if (!rc) {
  184. tmpbuffer = kmalloc(maxpath);
  185. rc = CIFSSMBQueryReparseLinkInfo(xid, ptcon, full_path,
  186. tmpbuffer,
  187. maxpath -1,
  188. fid,
  189. cifs_sb->local_nls);
  190. if (CIFSSMBClose(xid, ptcon, fid)) {
  191. cFYI(1, "Error closing temporary reparsepoint open");
  192. }
  193. }
  194. }
  195. */
  196. static int initiate_cifs_search(const int xid, struct file *file)
  197. {
  198. int rc = 0;
  199. char *full_path = NULL;
  200. struct cifsFileInfo *cifsFile;
  201. struct cifs_sb_info *cifs_sb = CIFS_SB(file->f_path.dentry->d_sb);
  202. struct tcon_link *tlink = NULL;
  203. struct cifs_tcon *pTcon;
  204. if (file->private_data == NULL) {
  205. tlink = cifs_sb_tlink(cifs_sb);
  206. if (IS_ERR(tlink))
  207. return PTR_ERR(tlink);
  208. cifsFile = kzalloc(sizeof(struct cifsFileInfo), GFP_KERNEL);
  209. if (cifsFile == NULL) {
  210. rc = -ENOMEM;
  211. goto error_exit;
  212. }
  213. file->private_data = cifsFile;
  214. cifsFile->tlink = cifs_get_tlink(tlink);
  215. pTcon = tlink_tcon(tlink);
  216. } else {
  217. cifsFile = file->private_data;
  218. pTcon = tlink_tcon(cifsFile->tlink);
  219. }
  220. cifsFile->invalidHandle = true;
  221. cifsFile->srch_inf.endOfSearch = false;
  222. full_path = build_path_from_dentry(file->f_path.dentry);
  223. if (full_path == NULL) {
  224. rc = -ENOMEM;
  225. goto error_exit;
  226. }
  227. cFYI(1, "Full path: %s start at: %lld", full_path, file->f_pos);
  228. ffirst_retry:
  229. /* test for Unix extensions */
  230. /* but now check for them on the share/mount not on the SMB session */
  231. /* if (pTcon->ses->capabilities & CAP_UNIX) { */
  232. if (pTcon->unix_ext)
  233. cifsFile->srch_inf.info_level = SMB_FIND_FILE_UNIX;
  234. else if ((pTcon->ses->capabilities &
  235. (CAP_NT_SMBS | CAP_NT_FIND)) == 0) {
  236. cifsFile->srch_inf.info_level = SMB_FIND_FILE_INFO_STANDARD;
  237. } else if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM) {
  238. cifsFile->srch_inf.info_level = SMB_FIND_FILE_ID_FULL_DIR_INFO;
  239. } else /* not srvinos - BB fixme add check for backlevel? */ {
  240. cifsFile->srch_inf.info_level = SMB_FIND_FILE_DIRECTORY_INFO;
  241. }
  242. rc = CIFSFindFirst(xid, pTcon, full_path, cifs_sb->local_nls,
  243. &cifsFile->netfid, &cifsFile->srch_inf,
  244. cifs_sb->mnt_cifs_flags &
  245. CIFS_MOUNT_MAP_SPECIAL_CHR, CIFS_DIR_SEP(cifs_sb));
  246. if (rc == 0)
  247. cifsFile->invalidHandle = false;
  248. /* BB add following call to handle readdir on new NTFS symlink errors
  249. else if STATUS_STOPPED_ON_SYMLINK
  250. call get_symlink_reparse_path and retry with new path */
  251. else if ((rc == -EOPNOTSUPP) &&
  252. (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM)) {
  253. cifs_sb->mnt_cifs_flags &= ~CIFS_MOUNT_SERVER_INUM;
  254. goto ffirst_retry;
  255. }
  256. error_exit:
  257. kfree(full_path);
  258. cifs_put_tlink(tlink);
  259. return rc;
  260. }
  261. /* return length of unicode string in bytes */
  262. static int cifs_unicode_bytelen(const char *str)
  263. {
  264. int len;
  265. const __le16 *ustr = (const __le16 *)str;
  266. for (len = 0; len <= PATH_MAX; len++) {
  267. if (ustr[len] == 0)
  268. return len << 1;
  269. }
  270. cFYI(1, "Unicode string longer than PATH_MAX found");
  271. return len << 1;
  272. }
  273. static char *nxt_dir_entry(char *old_entry, char *end_of_smb, int level)
  274. {
  275. char *new_entry;
  276. FILE_DIRECTORY_INFO *pDirInfo = (FILE_DIRECTORY_INFO *)old_entry;
  277. if (level == SMB_FIND_FILE_INFO_STANDARD) {
  278. FIND_FILE_STANDARD_INFO *pfData;
  279. pfData = (FIND_FILE_STANDARD_INFO *)pDirInfo;
  280. new_entry = old_entry + sizeof(FIND_FILE_STANDARD_INFO) +
  281. pfData->FileNameLength;
  282. } else
  283. new_entry = old_entry + le32_to_cpu(pDirInfo->NextEntryOffset);
  284. cFYI(1, "new entry %p old entry %p", new_entry, old_entry);
  285. /* validate that new_entry is not past end of SMB */
  286. if (new_entry >= end_of_smb) {
  287. cERROR(1, "search entry %p began after end of SMB %p old entry %p",
  288. new_entry, end_of_smb, old_entry);
  289. return NULL;
  290. } else if (((level == SMB_FIND_FILE_INFO_STANDARD) &&
  291. (new_entry + sizeof(FIND_FILE_STANDARD_INFO) > end_of_smb))
  292. || ((level != SMB_FIND_FILE_INFO_STANDARD) &&
  293. (new_entry + sizeof(FILE_DIRECTORY_INFO) > end_of_smb))) {
  294. cERROR(1, "search entry %p extends after end of SMB %p",
  295. new_entry, end_of_smb);
  296. return NULL;
  297. } else
  298. return new_entry;
  299. }
  300. struct cifs_dirent {
  301. const char *name;
  302. size_t namelen;
  303. u32 resume_key;
  304. u64 ino;
  305. };
  306. static void cifs_fill_dirent_unix(struct cifs_dirent *de,
  307. const FILE_UNIX_INFO *info, bool is_unicode)
  308. {
  309. de->name = &info->FileName[0];
  310. if (is_unicode)
  311. de->namelen = cifs_unicode_bytelen(de->name);
  312. else
  313. de->namelen = strnlen(de->name, PATH_MAX);
  314. de->resume_key = info->ResumeKey;
  315. de->ino = le64_to_cpu(info->basic.UniqueId);
  316. }
  317. static void cifs_fill_dirent_dir(struct cifs_dirent *de,
  318. const FILE_DIRECTORY_INFO *info)
  319. {
  320. de->name = &info->FileName[0];
  321. de->namelen = le32_to_cpu(info->FileNameLength);
  322. de->resume_key = info->FileIndex;
  323. }
  324. static void cifs_fill_dirent_full(struct cifs_dirent *de,
  325. const FILE_FULL_DIRECTORY_INFO *info)
  326. {
  327. de->name = &info->FileName[0];
  328. de->namelen = le32_to_cpu(info->FileNameLength);
  329. de->resume_key = info->FileIndex;
  330. }
  331. static void cifs_fill_dirent_search(struct cifs_dirent *de,
  332. const SEARCH_ID_FULL_DIR_INFO *info)
  333. {
  334. de->name = &info->FileName[0];
  335. de->namelen = le32_to_cpu(info->FileNameLength);
  336. de->resume_key = info->FileIndex;
  337. de->ino = le64_to_cpu(info->UniqueId);
  338. }
  339. static void cifs_fill_dirent_both(struct cifs_dirent *de,
  340. const FILE_BOTH_DIRECTORY_INFO *info)
  341. {
  342. de->name = &info->FileName[0];
  343. de->namelen = le32_to_cpu(info->FileNameLength);
  344. de->resume_key = info->FileIndex;
  345. }
  346. static void cifs_fill_dirent_std(struct cifs_dirent *de,
  347. const FIND_FILE_STANDARD_INFO *info)
  348. {
  349. de->name = &info->FileName[0];
  350. /* one byte length, no endianess conversion */
  351. de->namelen = info->FileNameLength;
  352. de->resume_key = info->ResumeKey;
  353. }
  354. static int cifs_fill_dirent(struct cifs_dirent *de, const void *info,
  355. u16 level, bool is_unicode)
  356. {
  357. memset(de, 0, sizeof(*de));
  358. switch (level) {
  359. case SMB_FIND_FILE_UNIX:
  360. cifs_fill_dirent_unix(de, info, is_unicode);
  361. break;
  362. case SMB_FIND_FILE_DIRECTORY_INFO:
  363. cifs_fill_dirent_dir(de, info);
  364. break;
  365. case SMB_FIND_FILE_FULL_DIRECTORY_INFO:
  366. cifs_fill_dirent_full(de, info);
  367. break;
  368. case SMB_FIND_FILE_ID_FULL_DIR_INFO:
  369. cifs_fill_dirent_search(de, info);
  370. break;
  371. case SMB_FIND_FILE_BOTH_DIRECTORY_INFO:
  372. cifs_fill_dirent_both(de, info);
  373. break;
  374. case SMB_FIND_FILE_INFO_STANDARD:
  375. cifs_fill_dirent_std(de, info);
  376. break;
  377. default:
  378. cFYI(1, "Unknown findfirst level %d", level);
  379. return -EINVAL;
  380. }
  381. return 0;
  382. }
  383. #define UNICODE_DOT cpu_to_le16(0x2e)
  384. /* return 0 if no match and 1 for . (current directory) and 2 for .. (parent) */
  385. static int cifs_entry_is_dot(struct cifs_dirent *de, bool is_unicode)
  386. {
  387. int rc = 0;
  388. if (!de->name)
  389. return 0;
  390. if (is_unicode) {
  391. __le16 *ufilename = (__le16 *)de->name;
  392. if (de->namelen == 2) {
  393. /* check for . */
  394. if (ufilename[0] == UNICODE_DOT)
  395. rc = 1;
  396. } else if (de->namelen == 4) {
  397. /* check for .. */
  398. if (ufilename[0] == UNICODE_DOT &&
  399. ufilename[1] == UNICODE_DOT)
  400. rc = 2;
  401. }
  402. } else /* ASCII */ {
  403. if (de->namelen == 1) {
  404. if (de->name[0] == '.')
  405. rc = 1;
  406. } else if (de->namelen == 2) {
  407. if (de->name[0] == '.' && de->name[1] == '.')
  408. rc = 2;
  409. }
  410. }
  411. return rc;
  412. }
  413. /* Check if directory that we are searching has changed so we can decide
  414. whether we can use the cached search results from the previous search */
  415. static int is_dir_changed(struct file *file)
  416. {
  417. struct inode *inode = file->f_path.dentry->d_inode;
  418. struct cifsInodeInfo *cifsInfo = CIFS_I(inode);
  419. if (cifsInfo->time == 0)
  420. return 1; /* directory was changed, perhaps due to unlink */
  421. else
  422. return 0;
  423. }
  424. static int cifs_save_resume_key(const char *current_entry,
  425. struct cifsFileInfo *file_info)
  426. {
  427. struct cifs_dirent de;
  428. int rc;
  429. rc = cifs_fill_dirent(&de, current_entry, file_info->srch_inf.info_level,
  430. file_info->srch_inf.unicode);
  431. if (!rc) {
  432. file_info->srch_inf.presume_name = de.name;
  433. file_info->srch_inf.resume_name_len = de.namelen;
  434. file_info->srch_inf.resume_key = de.resume_key;
  435. }
  436. return rc;
  437. }
  438. /* find the corresponding entry in the search */
  439. /* Note that the SMB server returns search entries for . and .. which
  440. complicates logic here if we choose to parse for them and we do not
  441. assume that they are located in the findfirst return buffer.*/
  442. /* We start counting in the buffer with entry 2 and increment for every
  443. entry (do not increment for . or .. entry) */
  444. static int find_cifs_entry(const int xid, struct cifs_tcon *pTcon,
  445. struct file *file, char **ppCurrentEntry, int *num_to_ret)
  446. {
  447. int rc = 0;
  448. int pos_in_buf = 0;
  449. loff_t first_entry_in_buffer;
  450. loff_t index_to_find = file->f_pos;
  451. struct cifsFileInfo *cifsFile = file->private_data;
  452. /* check if index in the buffer */
  453. if ((cifsFile == NULL) || (ppCurrentEntry == NULL) ||
  454. (num_to_ret == NULL))
  455. return -ENOENT;
  456. *ppCurrentEntry = NULL;
  457. first_entry_in_buffer =
  458. cifsFile->srch_inf.index_of_last_entry -
  459. cifsFile->srch_inf.entries_in_buffer;
  460. /* if first entry in buf is zero then is first buffer
  461. in search response data which means it is likely . and ..
  462. will be in this buffer, although some servers do not return
  463. . and .. for the root of a drive and for those we need
  464. to start two entries earlier */
  465. dump_cifs_file_struct(file, "In fce ");
  466. if (((index_to_find < cifsFile->srch_inf.index_of_last_entry) &&
  467. is_dir_changed(file)) ||
  468. (index_to_find < first_entry_in_buffer)) {
  469. /* close and restart search */
  470. cFYI(1, "search backing up - close and restart search");
  471. spin_lock(&cifs_file_list_lock);
  472. if (!cifsFile->srch_inf.endOfSearch &&
  473. !cifsFile->invalidHandle) {
  474. cifsFile->invalidHandle = true;
  475. spin_unlock(&cifs_file_list_lock);
  476. CIFSFindClose(xid, pTcon, cifsFile->netfid);
  477. } else
  478. spin_unlock(&cifs_file_list_lock);
  479. if (cifsFile->srch_inf.ntwrk_buf_start) {
  480. cFYI(1, "freeing SMB ff cache buf on search rewind");
  481. if (cifsFile->srch_inf.smallBuf)
  482. cifs_small_buf_release(cifsFile->srch_inf.
  483. ntwrk_buf_start);
  484. else
  485. cifs_buf_release(cifsFile->srch_inf.
  486. ntwrk_buf_start);
  487. cifsFile->srch_inf.ntwrk_buf_start = NULL;
  488. }
  489. rc = initiate_cifs_search(xid, file);
  490. if (rc) {
  491. cFYI(1, "error %d reinitiating a search on rewind",
  492. rc);
  493. return rc;
  494. }
  495. cifs_save_resume_key(cifsFile->srch_inf.last_entry, cifsFile);
  496. }
  497. while ((index_to_find >= cifsFile->srch_inf.index_of_last_entry) &&
  498. (rc == 0) && !cifsFile->srch_inf.endOfSearch) {
  499. cFYI(1, "calling findnext2");
  500. rc = CIFSFindNext(xid, pTcon, cifsFile->netfid,
  501. &cifsFile->srch_inf);
  502. cifs_save_resume_key(cifsFile->srch_inf.last_entry, cifsFile);
  503. if (rc)
  504. return -ENOENT;
  505. }
  506. if (index_to_find < cifsFile->srch_inf.index_of_last_entry) {
  507. /* we found the buffer that contains the entry */
  508. /* scan and find it */
  509. int i;
  510. char *current_entry;
  511. char *end_of_smb = cifsFile->srch_inf.ntwrk_buf_start +
  512. smbCalcSize((struct smb_hdr *)
  513. cifsFile->srch_inf.ntwrk_buf_start);
  514. current_entry = cifsFile->srch_inf.srch_entries_start;
  515. first_entry_in_buffer = cifsFile->srch_inf.index_of_last_entry
  516. - cifsFile->srch_inf.entries_in_buffer;
  517. pos_in_buf = index_to_find - first_entry_in_buffer;
  518. cFYI(1, "found entry - pos_in_buf %d", pos_in_buf);
  519. for (i = 0; (i < (pos_in_buf)) && (current_entry != NULL); i++) {
  520. /* go entry by entry figuring out which is first */
  521. current_entry = nxt_dir_entry(current_entry, end_of_smb,
  522. cifsFile->srch_inf.info_level);
  523. }
  524. if ((current_entry == NULL) && (i < pos_in_buf)) {
  525. /* BB fixme - check if we should flag this error */
  526. cERROR(1, "reached end of buf searching for pos in buf"
  527. " %d index to find %lld rc %d",
  528. pos_in_buf, index_to_find, rc);
  529. }
  530. rc = 0;
  531. *ppCurrentEntry = current_entry;
  532. } else {
  533. cFYI(1, "index not in buffer - could not findnext into it");
  534. return 0;
  535. }
  536. if (pos_in_buf >= cifsFile->srch_inf.entries_in_buffer) {
  537. cFYI(1, "can not return entries pos_in_buf beyond last");
  538. *num_to_ret = 0;
  539. } else
  540. *num_to_ret = cifsFile->srch_inf.entries_in_buffer - pos_in_buf;
  541. return rc;
  542. }
  543. static int cifs_filldir(char *find_entry, struct file *file, filldir_t filldir,
  544. void *dirent, char *scratch_buf, unsigned int max_len)
  545. {
  546. struct cifsFileInfo *file_info = file->private_data;
  547. struct super_block *sb = file->f_path.dentry->d_sb;
  548. struct cifs_sb_info *cifs_sb = CIFS_SB(sb);
  549. struct cifs_dirent de = { NULL, };
  550. struct cifs_fattr fattr;
  551. struct dentry *dentry;
  552. struct qstr name;
  553. int rc = 0;
  554. ino_t ino;
  555. rc = cifs_fill_dirent(&de, find_entry, file_info->srch_inf.info_level,
  556. file_info->srch_inf.unicode);
  557. if (rc)
  558. return rc;
  559. if (de.namelen > max_len) {
  560. cERROR(1, "bad search response length %zd past smb end",
  561. de.namelen);
  562. return -EINVAL;
  563. }
  564. /* skip . and .. since we added them first */
  565. if (cifs_entry_is_dot(&de, file_info->srch_inf.unicode))
  566. return 0;
  567. if (file_info->srch_inf.unicode) {
  568. struct nls_table *nlt = cifs_sb->local_nls;
  569. name.name = scratch_buf;
  570. name.len =
  571. cifs_from_ucs2((char *)name.name, (__le16 *)de.name,
  572. UNICODE_NAME_MAX,
  573. min(de.namelen, (size_t)max_len), nlt,
  574. cifs_sb->mnt_cifs_flags &
  575. CIFS_MOUNT_MAP_SPECIAL_CHR);
  576. name.len -= nls_nullsize(nlt);
  577. } else {
  578. name.name = de.name;
  579. name.len = de.namelen;
  580. }
  581. switch (file_info->srch_inf.info_level) {
  582. case SMB_FIND_FILE_UNIX:
  583. cifs_unix_basic_to_fattr(&fattr,
  584. &((FILE_UNIX_INFO *)find_entry)->basic,
  585. cifs_sb);
  586. break;
  587. case SMB_FIND_FILE_INFO_STANDARD:
  588. cifs_std_info_to_fattr(&fattr,
  589. (FIND_FILE_STANDARD_INFO *)find_entry,
  590. cifs_sb);
  591. break;
  592. default:
  593. cifs_dir_info_to_fattr(&fattr,
  594. (FILE_DIRECTORY_INFO *)find_entry,
  595. cifs_sb);
  596. break;
  597. }
  598. if (de.ino && (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM)) {
  599. fattr.cf_uniqueid = de.ino;
  600. } else {
  601. fattr.cf_uniqueid = iunique(sb, ROOT_I);
  602. cifs_autodisable_serverino(cifs_sb);
  603. }
  604. if ((cifs_sb->mnt_cifs_flags & CIFS_MOUNT_MF_SYMLINKS) &&
  605. CIFSCouldBeMFSymlink(&fattr))
  606. /*
  607. * trying to get the type and mode can be slow,
  608. * so just call those regular files for now, and mark
  609. * for reval
  610. */
  611. fattr.cf_flags |= CIFS_FATTR_NEED_REVAL;
  612. ino = cifs_uniqueid_to_ino_t(fattr.cf_uniqueid);
  613. dentry = cifs_readdir_lookup(file->f_dentry, &name, &fattr);
  614. rc = filldir(dirent, name.name, name.len, file->f_pos, ino,
  615. fattr.cf_dtype);
  616. dput(dentry);
  617. return rc;
  618. }
  619. int cifs_readdir(struct file *file, void *direntry, filldir_t filldir)
  620. {
  621. int rc = 0;
  622. int xid, i;
  623. struct cifs_tcon *pTcon;
  624. struct cifsFileInfo *cifsFile = NULL;
  625. char *current_entry;
  626. int num_to_fill = 0;
  627. char *tmp_buf = NULL;
  628. char *end_of_smb;
  629. unsigned int max_len;
  630. xid = GetXid();
  631. /*
  632. * Ensure FindFirst doesn't fail before doing filldir() for '.' and
  633. * '..'. Otherwise we won't be able to notify VFS in case of failure.
  634. */
  635. if (file->private_data == NULL) {
  636. rc = initiate_cifs_search(xid, file);
  637. cFYI(1, "initiate cifs search rc %d", rc);
  638. if (rc)
  639. goto rddir2_exit;
  640. }
  641. switch ((int) file->f_pos) {
  642. case 0:
  643. if (filldir(direntry, ".", 1, file->f_pos,
  644. file->f_path.dentry->d_inode->i_ino, DT_DIR) < 0) {
  645. cERROR(1, "Filldir for current dir failed");
  646. rc = -ENOMEM;
  647. break;
  648. }
  649. file->f_pos++;
  650. case 1:
  651. if (filldir(direntry, "..", 2, file->f_pos,
  652. parent_ino(file->f_path.dentry), DT_DIR) < 0) {
  653. cERROR(1, "Filldir for parent dir failed");
  654. rc = -ENOMEM;
  655. break;
  656. }
  657. file->f_pos++;
  658. default:
  659. /* 1) If search is active,
  660. is in current search buffer?
  661. if it before then restart search
  662. if after then keep searching till find it */
  663. if (file->private_data == NULL) {
  664. rc = -EINVAL;
  665. FreeXid(xid);
  666. return rc;
  667. }
  668. cifsFile = file->private_data;
  669. if (cifsFile->srch_inf.endOfSearch) {
  670. if (cifsFile->srch_inf.emptyDir) {
  671. cFYI(1, "End of search, empty dir");
  672. rc = 0;
  673. break;
  674. }
  675. } /* else {
  676. cifsFile->invalidHandle = true;
  677. CIFSFindClose(xid, pTcon, cifsFile->netfid);
  678. } */
  679. pTcon = tlink_tcon(cifsFile->tlink);
  680. rc = find_cifs_entry(xid, pTcon, file,
  681. &current_entry, &num_to_fill);
  682. if (rc) {
  683. cFYI(1, "fce error %d", rc);
  684. goto rddir2_exit;
  685. } else if (current_entry != NULL) {
  686. cFYI(1, "entry %lld found", file->f_pos);
  687. } else {
  688. cFYI(1, "could not find entry");
  689. goto rddir2_exit;
  690. }
  691. cFYI(1, "loop through %d times filling dir for net buf %p",
  692. num_to_fill, cifsFile->srch_inf.ntwrk_buf_start);
  693. max_len = smbCalcSize((struct smb_hdr *)
  694. cifsFile->srch_inf.ntwrk_buf_start);
  695. end_of_smb = cifsFile->srch_inf.ntwrk_buf_start + max_len;
  696. tmp_buf = kmalloc(UNICODE_NAME_MAX, GFP_KERNEL);
  697. if (tmp_buf == NULL) {
  698. rc = -ENOMEM;
  699. break;
  700. }
  701. for (i = 0; (i < num_to_fill) && (rc == 0); i++) {
  702. if (current_entry == NULL) {
  703. /* evaluate whether this case is an error */
  704. cERROR(1, "past SMB end, num to fill %d i %d",
  705. num_to_fill, i);
  706. break;
  707. }
  708. /* if buggy server returns . and .. late do
  709. we want to check for that here? */
  710. rc = cifs_filldir(current_entry, file,
  711. filldir, direntry, tmp_buf, max_len);
  712. if (rc == -EOVERFLOW) {
  713. rc = 0;
  714. break;
  715. }
  716. file->f_pos++;
  717. if (file->f_pos ==
  718. cifsFile->srch_inf.index_of_last_entry) {
  719. cFYI(1, "last entry in buf at pos %lld %s",
  720. file->f_pos, tmp_buf);
  721. cifs_save_resume_key(current_entry, cifsFile);
  722. break;
  723. } else
  724. current_entry =
  725. nxt_dir_entry(current_entry, end_of_smb,
  726. cifsFile->srch_inf.info_level);
  727. }
  728. kfree(tmp_buf);
  729. break;
  730. } /* end switch */
  731. rddir2_exit:
  732. FreeXid(xid);
  733. return rc;
  734. }