readdir.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895
  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. cifs_dbg(FYI, "empty cifs private file data\n");
  49. return;
  50. }
  51. if (cf->invalidHandle)
  52. cifs_dbg(FYI, "invalid handle\n");
  53. if (cf->srch_inf.endOfSearch)
  54. cifs_dbg(FYI, "end of search\n");
  55. if (cf->srch_inf.emptyDir)
  56. cifs_dbg(FYI, "empty dir\n");
  57. }
  58. }
  59. #else
  60. static inline void dump_cifs_file_struct(struct file *file, char *label)
  61. {
  62. }
  63. #endif /* DEBUG2 */
  64. /*
  65. * Attempt to preload the dcache with the results from the FIND_FIRST/NEXT
  66. *
  67. * Find the dentry that matches "name". If there isn't one, create one. If it's
  68. * a negative dentry or the uniqueid changed, then drop it and recreate it.
  69. */
  70. static void
  71. cifs_prime_dcache(struct dentry *parent, struct qstr *name,
  72. struct cifs_fattr *fattr)
  73. {
  74. struct dentry *dentry, *alias;
  75. struct inode *inode;
  76. struct super_block *sb = parent->d_inode->i_sb;
  77. struct cifs_sb_info *cifs_sb = CIFS_SB(sb);
  78. cifs_dbg(FYI, "%s: for %s\n", __func__, name->name);
  79. dentry = d_hash_and_lookup(parent, name);
  80. if (unlikely(IS_ERR(dentry)))
  81. return;
  82. if (dentry) {
  83. int err;
  84. inode = dentry->d_inode;
  85. if (inode) {
  86. /*
  87. * If we're generating inode numbers, then we don't
  88. * want to clobber the existing one with the one that
  89. * the readdir code created.
  90. */
  91. if (!(cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM))
  92. fattr->cf_uniqueid = CIFS_I(inode)->uniqueid;
  93. /* update inode in place if i_ino didn't change */
  94. if (CIFS_I(inode)->uniqueid == fattr->cf_uniqueid) {
  95. cifs_fattr_to_inode(inode, fattr);
  96. goto out;
  97. }
  98. }
  99. err = d_invalidate(dentry);
  100. dput(dentry);
  101. if (err)
  102. return;
  103. }
  104. /*
  105. * If we know that the inode will need to be revalidated immediately,
  106. * then don't create a new dentry for it. We'll end up doing an on
  107. * the wire call either way and this spares us an invalidation.
  108. */
  109. if (fattr->cf_flags & CIFS_FATTR_NEED_REVAL)
  110. return;
  111. dentry = d_alloc(parent, name);
  112. if (!dentry)
  113. return;
  114. inode = cifs_iget(sb, fattr);
  115. if (!inode)
  116. goto out;
  117. alias = d_materialise_unique(dentry, inode);
  118. if (alias && !IS_ERR(alias))
  119. dput(alias);
  120. out:
  121. dput(dentry);
  122. }
  123. /*
  124. * Is it possible that this directory might turn out to be a DFS referral
  125. * once we go to try and use it?
  126. */
  127. static bool
  128. cifs_dfs_is_possible(struct cifs_sb_info *cifs_sb)
  129. {
  130. #ifdef CONFIG_CIFS_DFS_UPCALL
  131. struct cifs_tcon *tcon = cifs_sb_master_tcon(cifs_sb);
  132. if (tcon->Flags & SMB_SHARE_IS_IN_DFS)
  133. return true;
  134. #endif
  135. return false;
  136. }
  137. static void
  138. cifs_fill_common_info(struct cifs_fattr *fattr, struct cifs_sb_info *cifs_sb)
  139. {
  140. fattr->cf_uid = cifs_sb->mnt_uid;
  141. fattr->cf_gid = cifs_sb->mnt_gid;
  142. if (fattr->cf_cifsattrs & ATTR_DIRECTORY) {
  143. fattr->cf_mode = S_IFDIR | cifs_sb->mnt_dir_mode;
  144. fattr->cf_dtype = DT_DIR;
  145. /*
  146. * Windows CIFS servers generally make DFS referrals look
  147. * like directories in FIND_* responses with the reparse
  148. * attribute flag also set (since DFS junctions are
  149. * reparse points). We must revalidate at least these
  150. * directory inodes before trying to use them (if
  151. * they are DFS we will get PATH_NOT_COVERED back
  152. * when queried directly and can then try to connect
  153. * to the DFS target)
  154. */
  155. if (cifs_dfs_is_possible(cifs_sb) &&
  156. (fattr->cf_cifsattrs & ATTR_REPARSE))
  157. fattr->cf_flags |= CIFS_FATTR_NEED_REVAL;
  158. } else {
  159. fattr->cf_mode = S_IFREG | cifs_sb->mnt_file_mode;
  160. fattr->cf_dtype = DT_REG;
  161. }
  162. if (fattr->cf_cifsattrs & ATTR_READONLY)
  163. fattr->cf_mode &= ~S_IWUGO;
  164. /*
  165. * We of course don't get ACL info in FIND_FIRST/NEXT results, so
  166. * mark it for revalidation so that "ls -l" will look right. It might
  167. * be super-slow, but if we don't do this then the ownership of files
  168. * may look wrong since the inodes may not have timed out by the time
  169. * "ls" does a stat() call on them.
  170. */
  171. if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_CIFS_ACL)
  172. fattr->cf_flags |= CIFS_FATTR_NEED_REVAL;
  173. if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_UNX_EMUL &&
  174. fattr->cf_cifsattrs & ATTR_SYSTEM) {
  175. if (fattr->cf_eof == 0) {
  176. fattr->cf_mode &= ~S_IFMT;
  177. fattr->cf_mode |= S_IFIFO;
  178. fattr->cf_dtype = DT_FIFO;
  179. } else {
  180. /*
  181. * trying to get the type and mode via SFU can be slow,
  182. * so just call those regular files for now, and mark
  183. * for reval
  184. */
  185. fattr->cf_flags |= CIFS_FATTR_NEED_REVAL;
  186. }
  187. }
  188. }
  189. void
  190. cifs_dir_info_to_fattr(struct cifs_fattr *fattr, FILE_DIRECTORY_INFO *info,
  191. struct cifs_sb_info *cifs_sb)
  192. {
  193. memset(fattr, 0, sizeof(*fattr));
  194. fattr->cf_cifsattrs = le32_to_cpu(info->ExtFileAttributes);
  195. fattr->cf_eof = le64_to_cpu(info->EndOfFile);
  196. fattr->cf_bytes = le64_to_cpu(info->AllocationSize);
  197. fattr->cf_createtime = le64_to_cpu(info->CreationTime);
  198. fattr->cf_atime = cifs_NTtimeToUnix(info->LastAccessTime);
  199. fattr->cf_ctime = cifs_NTtimeToUnix(info->ChangeTime);
  200. fattr->cf_mtime = cifs_NTtimeToUnix(info->LastWriteTime);
  201. cifs_fill_common_info(fattr, cifs_sb);
  202. }
  203. static void
  204. cifs_std_info_to_fattr(struct cifs_fattr *fattr, FIND_FILE_STANDARD_INFO *info,
  205. struct cifs_sb_info *cifs_sb)
  206. {
  207. int offset = cifs_sb_master_tcon(cifs_sb)->ses->server->timeAdj;
  208. memset(fattr, 0, sizeof(*fattr));
  209. fattr->cf_atime = cnvrtDosUnixTm(info->LastAccessDate,
  210. info->LastAccessTime, offset);
  211. fattr->cf_ctime = cnvrtDosUnixTm(info->LastWriteDate,
  212. info->LastWriteTime, offset);
  213. fattr->cf_mtime = cnvrtDosUnixTm(info->LastWriteDate,
  214. info->LastWriteTime, offset);
  215. fattr->cf_cifsattrs = le16_to_cpu(info->Attributes);
  216. fattr->cf_bytes = le32_to_cpu(info->AllocationSize);
  217. fattr->cf_eof = le32_to_cpu(info->DataSize);
  218. cifs_fill_common_info(fattr, cifs_sb);
  219. }
  220. /* BB eventually need to add the following helper function to
  221. resolve NT_STATUS_STOPPED_ON_SYMLINK return code when
  222. we try to do FindFirst on (NTFS) directory symlinks */
  223. /*
  224. int get_symlink_reparse_path(char *full_path, struct cifs_sb_info *cifs_sb,
  225. unsigned int xid)
  226. {
  227. __u16 fid;
  228. int len;
  229. int oplock = 0;
  230. int rc;
  231. struct cifs_tcon *ptcon = cifs_sb_tcon(cifs_sb);
  232. char *tmpbuffer;
  233. rc = CIFSSMBOpen(xid, ptcon, full_path, FILE_OPEN, GENERIC_READ,
  234. OPEN_REPARSE_POINT, &fid, &oplock, NULL,
  235. cifs_sb->local_nls,
  236. cifs_sb->mnt_cifs_flags & CIFS_MOUNT_MAP_SPECIAL_CHR);
  237. if (!rc) {
  238. tmpbuffer = kmalloc(maxpath);
  239. rc = CIFSSMBQueryReparseLinkInfo(xid, ptcon, full_path,
  240. tmpbuffer,
  241. maxpath -1,
  242. fid,
  243. cifs_sb->local_nls);
  244. if (CIFSSMBClose(xid, ptcon, fid)) {
  245. cifs_dbg(FYI, "Error closing temporary reparsepoint open\n");
  246. }
  247. }
  248. }
  249. */
  250. static int
  251. initiate_cifs_search(const unsigned int xid, struct file *file)
  252. {
  253. __u16 search_flags;
  254. int rc = 0;
  255. char *full_path = NULL;
  256. struct cifsFileInfo *cifsFile;
  257. struct cifs_sb_info *cifs_sb = CIFS_SB(file->f_path.dentry->d_sb);
  258. struct tcon_link *tlink = NULL;
  259. struct cifs_tcon *tcon;
  260. struct TCP_Server_Info *server;
  261. if (file->private_data == NULL) {
  262. tlink = cifs_sb_tlink(cifs_sb);
  263. if (IS_ERR(tlink))
  264. return PTR_ERR(tlink);
  265. cifsFile = kzalloc(sizeof(struct cifsFileInfo), GFP_KERNEL);
  266. if (cifsFile == NULL) {
  267. rc = -ENOMEM;
  268. goto error_exit;
  269. }
  270. file->private_data = cifsFile;
  271. cifsFile->tlink = cifs_get_tlink(tlink);
  272. tcon = tlink_tcon(tlink);
  273. } else {
  274. cifsFile = file->private_data;
  275. tcon = tlink_tcon(cifsFile->tlink);
  276. }
  277. server = tcon->ses->server;
  278. if (!server->ops->query_dir_first) {
  279. rc = -ENOSYS;
  280. goto error_exit;
  281. }
  282. cifsFile->invalidHandle = true;
  283. cifsFile->srch_inf.endOfSearch = false;
  284. full_path = build_path_from_dentry(file->f_path.dentry);
  285. if (full_path == NULL) {
  286. rc = -ENOMEM;
  287. goto error_exit;
  288. }
  289. cifs_dbg(FYI, "Full path: %s start at: %lld\n", full_path, file->f_pos);
  290. ffirst_retry:
  291. /* test for Unix extensions */
  292. /* but now check for them on the share/mount not on the SMB session */
  293. /* if (cap_unix(tcon->ses) { */
  294. if (tcon->unix_ext)
  295. cifsFile->srch_inf.info_level = SMB_FIND_FILE_UNIX;
  296. else if ((tcon->ses->capabilities &
  297. tcon->ses->server->vals->cap_nt_find) == 0) {
  298. cifsFile->srch_inf.info_level = SMB_FIND_FILE_INFO_STANDARD;
  299. } else if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM) {
  300. cifsFile->srch_inf.info_level = SMB_FIND_FILE_ID_FULL_DIR_INFO;
  301. } else /* not srvinos - BB fixme add check for backlevel? */ {
  302. cifsFile->srch_inf.info_level = SMB_FIND_FILE_DIRECTORY_INFO;
  303. }
  304. search_flags = CIFS_SEARCH_CLOSE_AT_END | CIFS_SEARCH_RETURN_RESUME;
  305. if (backup_cred(cifs_sb))
  306. search_flags |= CIFS_SEARCH_BACKUP_SEARCH;
  307. rc = server->ops->query_dir_first(xid, tcon, full_path, cifs_sb,
  308. &cifsFile->fid, search_flags,
  309. &cifsFile->srch_inf);
  310. if (rc == 0)
  311. cifsFile->invalidHandle = false;
  312. /* BB add following call to handle readdir on new NTFS symlink errors
  313. else if STATUS_STOPPED_ON_SYMLINK
  314. call get_symlink_reparse_path and retry with new path */
  315. else if ((rc == -EOPNOTSUPP) &&
  316. (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM)) {
  317. cifs_sb->mnt_cifs_flags &= ~CIFS_MOUNT_SERVER_INUM;
  318. goto ffirst_retry;
  319. }
  320. error_exit:
  321. kfree(full_path);
  322. cifs_put_tlink(tlink);
  323. return rc;
  324. }
  325. /* return length of unicode string in bytes */
  326. static int cifs_unicode_bytelen(const char *str)
  327. {
  328. int len;
  329. const __le16 *ustr = (const __le16 *)str;
  330. for (len = 0; len <= PATH_MAX; len++) {
  331. if (ustr[len] == 0)
  332. return len << 1;
  333. }
  334. cifs_dbg(FYI, "Unicode string longer than PATH_MAX found\n");
  335. return len << 1;
  336. }
  337. static char *nxt_dir_entry(char *old_entry, char *end_of_smb, int level)
  338. {
  339. char *new_entry;
  340. FILE_DIRECTORY_INFO *pDirInfo = (FILE_DIRECTORY_INFO *)old_entry;
  341. if (level == SMB_FIND_FILE_INFO_STANDARD) {
  342. FIND_FILE_STANDARD_INFO *pfData;
  343. pfData = (FIND_FILE_STANDARD_INFO *)pDirInfo;
  344. new_entry = old_entry + sizeof(FIND_FILE_STANDARD_INFO) +
  345. pfData->FileNameLength;
  346. } else
  347. new_entry = old_entry + le32_to_cpu(pDirInfo->NextEntryOffset);
  348. cifs_dbg(FYI, "new entry %p old entry %p\n", new_entry, old_entry);
  349. /* validate that new_entry is not past end of SMB */
  350. if (new_entry >= end_of_smb) {
  351. cifs_dbg(VFS, "search entry %p began after end of SMB %p old entry %p\n",
  352. new_entry, end_of_smb, old_entry);
  353. return NULL;
  354. } else if (((level == SMB_FIND_FILE_INFO_STANDARD) &&
  355. (new_entry + sizeof(FIND_FILE_STANDARD_INFO) > end_of_smb))
  356. || ((level != SMB_FIND_FILE_INFO_STANDARD) &&
  357. (new_entry + sizeof(FILE_DIRECTORY_INFO) > end_of_smb))) {
  358. cifs_dbg(VFS, "search entry %p extends after end of SMB %p\n",
  359. new_entry, end_of_smb);
  360. return NULL;
  361. } else
  362. return new_entry;
  363. }
  364. struct cifs_dirent {
  365. const char *name;
  366. size_t namelen;
  367. u32 resume_key;
  368. u64 ino;
  369. };
  370. static void cifs_fill_dirent_unix(struct cifs_dirent *de,
  371. const FILE_UNIX_INFO *info, bool is_unicode)
  372. {
  373. de->name = &info->FileName[0];
  374. if (is_unicode)
  375. de->namelen = cifs_unicode_bytelen(de->name);
  376. else
  377. de->namelen = strnlen(de->name, PATH_MAX);
  378. de->resume_key = info->ResumeKey;
  379. de->ino = le64_to_cpu(info->basic.UniqueId);
  380. }
  381. static void cifs_fill_dirent_dir(struct cifs_dirent *de,
  382. const FILE_DIRECTORY_INFO *info)
  383. {
  384. de->name = &info->FileName[0];
  385. de->namelen = le32_to_cpu(info->FileNameLength);
  386. de->resume_key = info->FileIndex;
  387. }
  388. static void cifs_fill_dirent_full(struct cifs_dirent *de,
  389. const FILE_FULL_DIRECTORY_INFO *info)
  390. {
  391. de->name = &info->FileName[0];
  392. de->namelen = le32_to_cpu(info->FileNameLength);
  393. de->resume_key = info->FileIndex;
  394. }
  395. static void cifs_fill_dirent_search(struct cifs_dirent *de,
  396. const SEARCH_ID_FULL_DIR_INFO *info)
  397. {
  398. de->name = &info->FileName[0];
  399. de->namelen = le32_to_cpu(info->FileNameLength);
  400. de->resume_key = info->FileIndex;
  401. de->ino = le64_to_cpu(info->UniqueId);
  402. }
  403. static void cifs_fill_dirent_both(struct cifs_dirent *de,
  404. const FILE_BOTH_DIRECTORY_INFO *info)
  405. {
  406. de->name = &info->FileName[0];
  407. de->namelen = le32_to_cpu(info->FileNameLength);
  408. de->resume_key = info->FileIndex;
  409. }
  410. static void cifs_fill_dirent_std(struct cifs_dirent *de,
  411. const FIND_FILE_STANDARD_INFO *info)
  412. {
  413. de->name = &info->FileName[0];
  414. /* one byte length, no endianess conversion */
  415. de->namelen = info->FileNameLength;
  416. de->resume_key = info->ResumeKey;
  417. }
  418. static int cifs_fill_dirent(struct cifs_dirent *de, const void *info,
  419. u16 level, bool is_unicode)
  420. {
  421. memset(de, 0, sizeof(*de));
  422. switch (level) {
  423. case SMB_FIND_FILE_UNIX:
  424. cifs_fill_dirent_unix(de, info, is_unicode);
  425. break;
  426. case SMB_FIND_FILE_DIRECTORY_INFO:
  427. cifs_fill_dirent_dir(de, info);
  428. break;
  429. case SMB_FIND_FILE_FULL_DIRECTORY_INFO:
  430. cifs_fill_dirent_full(de, info);
  431. break;
  432. case SMB_FIND_FILE_ID_FULL_DIR_INFO:
  433. cifs_fill_dirent_search(de, info);
  434. break;
  435. case SMB_FIND_FILE_BOTH_DIRECTORY_INFO:
  436. cifs_fill_dirent_both(de, info);
  437. break;
  438. case SMB_FIND_FILE_INFO_STANDARD:
  439. cifs_fill_dirent_std(de, info);
  440. break;
  441. default:
  442. cifs_dbg(FYI, "Unknown findfirst level %d\n", level);
  443. return -EINVAL;
  444. }
  445. return 0;
  446. }
  447. #define UNICODE_DOT cpu_to_le16(0x2e)
  448. /* return 0 if no match and 1 for . (current directory) and 2 for .. (parent) */
  449. static int cifs_entry_is_dot(struct cifs_dirent *de, bool is_unicode)
  450. {
  451. int rc = 0;
  452. if (!de->name)
  453. return 0;
  454. if (is_unicode) {
  455. __le16 *ufilename = (__le16 *)de->name;
  456. if (de->namelen == 2) {
  457. /* check for . */
  458. if (ufilename[0] == UNICODE_DOT)
  459. rc = 1;
  460. } else if (de->namelen == 4) {
  461. /* check for .. */
  462. if (ufilename[0] == UNICODE_DOT &&
  463. ufilename[1] == UNICODE_DOT)
  464. rc = 2;
  465. }
  466. } else /* ASCII */ {
  467. if (de->namelen == 1) {
  468. if (de->name[0] == '.')
  469. rc = 1;
  470. } else if (de->namelen == 2) {
  471. if (de->name[0] == '.' && de->name[1] == '.')
  472. rc = 2;
  473. }
  474. }
  475. return rc;
  476. }
  477. /* Check if directory that we are searching has changed so we can decide
  478. whether we can use the cached search results from the previous search */
  479. static int is_dir_changed(struct file *file)
  480. {
  481. struct inode *inode = file_inode(file);
  482. struct cifsInodeInfo *cifsInfo = CIFS_I(inode);
  483. if (cifsInfo->time == 0)
  484. return 1; /* directory was changed, perhaps due to unlink */
  485. else
  486. return 0;
  487. }
  488. static int cifs_save_resume_key(const char *current_entry,
  489. struct cifsFileInfo *file_info)
  490. {
  491. struct cifs_dirent de;
  492. int rc;
  493. rc = cifs_fill_dirent(&de, current_entry, file_info->srch_inf.info_level,
  494. file_info->srch_inf.unicode);
  495. if (!rc) {
  496. file_info->srch_inf.presume_name = de.name;
  497. file_info->srch_inf.resume_name_len = de.namelen;
  498. file_info->srch_inf.resume_key = de.resume_key;
  499. }
  500. return rc;
  501. }
  502. /*
  503. * Find the corresponding entry in the search. Note that the SMB server returns
  504. * search entries for . and .. which complicates logic here if we choose to
  505. * parse for them and we do not assume that they are located in the findfirst
  506. * return buffer. We start counting in the buffer with entry 2 and increment for
  507. * every entry (do not increment for . or .. entry).
  508. */
  509. static int
  510. find_cifs_entry(const unsigned int xid, struct cifs_tcon *tcon, loff_t pos,
  511. struct file *file, char **current_entry, int *num_to_ret)
  512. {
  513. __u16 search_flags;
  514. int rc = 0;
  515. int pos_in_buf = 0;
  516. loff_t first_entry_in_buffer;
  517. loff_t index_to_find = pos;
  518. struct cifsFileInfo *cfile = file->private_data;
  519. struct cifs_sb_info *cifs_sb = CIFS_SB(file->f_path.dentry->d_sb);
  520. struct TCP_Server_Info *server = tcon->ses->server;
  521. /* check if index in the buffer */
  522. if (!server->ops->query_dir_first || !server->ops->query_dir_next)
  523. return -ENOSYS;
  524. if ((cfile == NULL) || (current_entry == NULL) || (num_to_ret == NULL))
  525. return -ENOENT;
  526. *current_entry = NULL;
  527. first_entry_in_buffer = cfile->srch_inf.index_of_last_entry -
  528. cfile->srch_inf.entries_in_buffer;
  529. /*
  530. * If first entry in buf is zero then is first buffer
  531. * in search response data which means it is likely . and ..
  532. * will be in this buffer, although some servers do not return
  533. * . and .. for the root of a drive and for those we need
  534. * to start two entries earlier.
  535. */
  536. dump_cifs_file_struct(file, "In fce ");
  537. if (((index_to_find < cfile->srch_inf.index_of_last_entry) &&
  538. is_dir_changed(file)) || (index_to_find < first_entry_in_buffer)) {
  539. /* close and restart search */
  540. cifs_dbg(FYI, "search backing up - close and restart search\n");
  541. spin_lock(&cifs_file_list_lock);
  542. if (!cfile->srch_inf.endOfSearch && !cfile->invalidHandle) {
  543. cfile->invalidHandle = true;
  544. spin_unlock(&cifs_file_list_lock);
  545. if (server->ops->close)
  546. server->ops->close(xid, tcon, &cfile->fid);
  547. } else
  548. spin_unlock(&cifs_file_list_lock);
  549. if (cfile->srch_inf.ntwrk_buf_start) {
  550. cifs_dbg(FYI, "freeing SMB ff cache buf on search rewind\n");
  551. if (cfile->srch_inf.smallBuf)
  552. cifs_small_buf_release(cfile->srch_inf.
  553. ntwrk_buf_start);
  554. else
  555. cifs_buf_release(cfile->srch_inf.
  556. ntwrk_buf_start);
  557. cfile->srch_inf.ntwrk_buf_start = NULL;
  558. }
  559. rc = initiate_cifs_search(xid, file);
  560. if (rc) {
  561. cifs_dbg(FYI, "error %d reinitiating a search on rewind\n",
  562. rc);
  563. return rc;
  564. }
  565. /* FindFirst/Next set last_entry to NULL on malformed reply */
  566. if (cfile->srch_inf.last_entry)
  567. cifs_save_resume_key(cfile->srch_inf.last_entry, cfile);
  568. }
  569. search_flags = CIFS_SEARCH_CLOSE_AT_END | CIFS_SEARCH_RETURN_RESUME;
  570. if (backup_cred(cifs_sb))
  571. search_flags |= CIFS_SEARCH_BACKUP_SEARCH;
  572. while ((index_to_find >= cfile->srch_inf.index_of_last_entry) &&
  573. (rc == 0) && !cfile->srch_inf.endOfSearch) {
  574. cifs_dbg(FYI, "calling findnext2\n");
  575. rc = server->ops->query_dir_next(xid, tcon, &cfile->fid,
  576. search_flags,
  577. &cfile->srch_inf);
  578. /* FindFirst/Next set last_entry to NULL on malformed reply */
  579. if (cfile->srch_inf.last_entry)
  580. cifs_save_resume_key(cfile->srch_inf.last_entry, cfile);
  581. if (rc)
  582. return -ENOENT;
  583. }
  584. if (index_to_find < cfile->srch_inf.index_of_last_entry) {
  585. /* we found the buffer that contains the entry */
  586. /* scan and find it */
  587. int i;
  588. char *cur_ent;
  589. char *end_of_smb = cfile->srch_inf.ntwrk_buf_start +
  590. server->ops->calc_smb_size(
  591. cfile->srch_inf.ntwrk_buf_start);
  592. cur_ent = cfile->srch_inf.srch_entries_start;
  593. first_entry_in_buffer = cfile->srch_inf.index_of_last_entry
  594. - cfile->srch_inf.entries_in_buffer;
  595. pos_in_buf = index_to_find - first_entry_in_buffer;
  596. cifs_dbg(FYI, "found entry - pos_in_buf %d\n", pos_in_buf);
  597. for (i = 0; (i < (pos_in_buf)) && (cur_ent != NULL); i++) {
  598. /* go entry by entry figuring out which is first */
  599. cur_ent = nxt_dir_entry(cur_ent, end_of_smb,
  600. cfile->srch_inf.info_level);
  601. }
  602. if ((cur_ent == NULL) && (i < pos_in_buf)) {
  603. /* BB fixme - check if we should flag this error */
  604. cifs_dbg(VFS, "reached end of buf searching for pos in buf %d index to find %lld rc %d\n",
  605. pos_in_buf, index_to_find, rc);
  606. }
  607. rc = 0;
  608. *current_entry = cur_ent;
  609. } else {
  610. cifs_dbg(FYI, "index not in buffer - could not findnext into it\n");
  611. return 0;
  612. }
  613. if (pos_in_buf >= cfile->srch_inf.entries_in_buffer) {
  614. cifs_dbg(FYI, "can not return entries pos_in_buf beyond last\n");
  615. *num_to_ret = 0;
  616. } else
  617. *num_to_ret = cfile->srch_inf.entries_in_buffer - pos_in_buf;
  618. return rc;
  619. }
  620. static int cifs_filldir(char *find_entry, struct file *file,
  621. struct dir_context *ctx,
  622. char *scratch_buf, unsigned int max_len)
  623. {
  624. struct cifsFileInfo *file_info = file->private_data;
  625. struct super_block *sb = file->f_path.dentry->d_sb;
  626. struct cifs_sb_info *cifs_sb = CIFS_SB(sb);
  627. struct cifs_dirent de = { NULL, };
  628. struct cifs_fattr fattr;
  629. struct qstr name;
  630. int rc = 0;
  631. ino_t ino;
  632. rc = cifs_fill_dirent(&de, find_entry, file_info->srch_inf.info_level,
  633. file_info->srch_inf.unicode);
  634. if (rc)
  635. return rc;
  636. if (de.namelen > max_len) {
  637. cifs_dbg(VFS, "bad search response length %zd past smb end\n",
  638. de.namelen);
  639. return -EINVAL;
  640. }
  641. /* skip . and .. since we added them first */
  642. if (cifs_entry_is_dot(&de, file_info->srch_inf.unicode))
  643. return 0;
  644. if (file_info->srch_inf.unicode) {
  645. struct nls_table *nlt = cifs_sb->local_nls;
  646. name.name = scratch_buf;
  647. name.len =
  648. cifs_from_utf16((char *)name.name, (__le16 *)de.name,
  649. UNICODE_NAME_MAX,
  650. min_t(size_t, de.namelen,
  651. (size_t)max_len), nlt,
  652. cifs_sb->mnt_cifs_flags &
  653. CIFS_MOUNT_MAP_SPECIAL_CHR);
  654. name.len -= nls_nullsize(nlt);
  655. } else {
  656. name.name = de.name;
  657. name.len = de.namelen;
  658. }
  659. switch (file_info->srch_inf.info_level) {
  660. case SMB_FIND_FILE_UNIX:
  661. cifs_unix_basic_to_fattr(&fattr,
  662. &((FILE_UNIX_INFO *)find_entry)->basic,
  663. cifs_sb);
  664. break;
  665. case SMB_FIND_FILE_INFO_STANDARD:
  666. cifs_std_info_to_fattr(&fattr,
  667. (FIND_FILE_STANDARD_INFO *)find_entry,
  668. cifs_sb);
  669. break;
  670. default:
  671. cifs_dir_info_to_fattr(&fattr,
  672. (FILE_DIRECTORY_INFO *)find_entry,
  673. cifs_sb);
  674. break;
  675. }
  676. if (de.ino && (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM)) {
  677. fattr.cf_uniqueid = de.ino;
  678. } else {
  679. fattr.cf_uniqueid = iunique(sb, ROOT_I);
  680. cifs_autodisable_serverino(cifs_sb);
  681. }
  682. if ((cifs_sb->mnt_cifs_flags & CIFS_MOUNT_MF_SYMLINKS) &&
  683. CIFSCouldBeMFSymlink(&fattr))
  684. /*
  685. * trying to get the type and mode can be slow,
  686. * so just call those regular files for now, and mark
  687. * for reval
  688. */
  689. fattr.cf_flags |= CIFS_FATTR_NEED_REVAL;
  690. cifs_prime_dcache(file->f_dentry, &name, &fattr);
  691. ino = cifs_uniqueid_to_ino_t(fattr.cf_uniqueid);
  692. return !dir_emit(ctx, name.name, name.len, ino, fattr.cf_dtype);
  693. }
  694. int cifs_readdir(struct file *file, struct dir_context *ctx)
  695. {
  696. int rc = 0;
  697. unsigned int xid;
  698. int i;
  699. struct cifs_tcon *tcon;
  700. struct cifsFileInfo *cifsFile = NULL;
  701. char *current_entry;
  702. int num_to_fill = 0;
  703. char *tmp_buf = NULL;
  704. char *end_of_smb;
  705. unsigned int max_len;
  706. xid = get_xid();
  707. /*
  708. * Ensure FindFirst doesn't fail before doing filldir() for '.' and
  709. * '..'. Otherwise we won't be able to notify VFS in case of failure.
  710. */
  711. if (file->private_data == NULL) {
  712. rc = initiate_cifs_search(xid, file);
  713. cifs_dbg(FYI, "initiate cifs search rc %d\n", rc);
  714. if (rc)
  715. goto rddir2_exit;
  716. }
  717. if (!dir_emit_dots(file, ctx))
  718. goto rddir2_exit;
  719. /* 1) If search is active,
  720. is in current search buffer?
  721. if it before then restart search
  722. if after then keep searching till find it */
  723. if (file->private_data == NULL) {
  724. rc = -EINVAL;
  725. goto rddir2_exit;
  726. }
  727. cifsFile = file->private_data;
  728. if (cifsFile->srch_inf.endOfSearch) {
  729. if (cifsFile->srch_inf.emptyDir) {
  730. cifs_dbg(FYI, "End of search, empty dir\n");
  731. rc = 0;
  732. goto rddir2_exit;
  733. }
  734. } /* else {
  735. cifsFile->invalidHandle = true;
  736. tcon->ses->server->close(xid, tcon, &cifsFile->fid);
  737. } */
  738. tcon = tlink_tcon(cifsFile->tlink);
  739. rc = find_cifs_entry(xid, tcon, ctx->pos, file, &current_entry,
  740. &num_to_fill);
  741. if (rc) {
  742. cifs_dbg(FYI, "fce error %d\n", rc);
  743. goto rddir2_exit;
  744. } else if (current_entry != NULL) {
  745. cifs_dbg(FYI, "entry %lld found\n", ctx->pos);
  746. } else {
  747. cifs_dbg(FYI, "could not find entry\n");
  748. goto rddir2_exit;
  749. }
  750. cifs_dbg(FYI, "loop through %d times filling dir for net buf %p\n",
  751. num_to_fill, cifsFile->srch_inf.ntwrk_buf_start);
  752. max_len = tcon->ses->server->ops->calc_smb_size(
  753. cifsFile->srch_inf.ntwrk_buf_start);
  754. end_of_smb = cifsFile->srch_inf.ntwrk_buf_start + max_len;
  755. tmp_buf = kmalloc(UNICODE_NAME_MAX, GFP_KERNEL);
  756. if (tmp_buf == NULL) {
  757. rc = -ENOMEM;
  758. goto rddir2_exit;
  759. }
  760. for (i = 0; i < num_to_fill; i++) {
  761. if (current_entry == NULL) {
  762. /* evaluate whether this case is an error */
  763. cifs_dbg(VFS, "past SMB end, num to fill %d i %d\n",
  764. num_to_fill, i);
  765. break;
  766. }
  767. /*
  768. * if buggy server returns . and .. late do we want to
  769. * check for that here?
  770. */
  771. rc = cifs_filldir(current_entry, file, ctx,
  772. tmp_buf, max_len);
  773. if (rc) {
  774. if (rc > 0)
  775. rc = 0;
  776. break;
  777. }
  778. ctx->pos++;
  779. if (ctx->pos ==
  780. cifsFile->srch_inf.index_of_last_entry) {
  781. cifs_dbg(FYI, "last entry in buf at pos %lld %s\n",
  782. ctx->pos, tmp_buf);
  783. cifs_save_resume_key(current_entry, cifsFile);
  784. break;
  785. } else
  786. current_entry =
  787. nxt_dir_entry(current_entry, end_of_smb,
  788. cifsFile->srch_inf.info_level);
  789. }
  790. kfree(tmp_buf);
  791. rddir2_exit:
  792. free_xid(xid);
  793. return rc;
  794. }