readdir.c 25 KB

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