readdir.c 24 KB

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