readdir.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894
  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 ([email protected])
  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_sb;
  78. struct cifs_sb_info *cifs_sb = CIFS_SB(sb);
  79. DECLARE_WAIT_QUEUE_HEAD_ONSTACK(wq);
  80. cifs_dbg(FYI, "%s: for %s\n", __func__, name->name);
  81. dentry = d_hash_and_lookup(parent, name);
  82. if (!dentry) {
  83. /*
  84. * If we know that the inode will need to be revalidated
  85. * immediately, then don't create a new dentry for it.
  86. * We'll end up doing an on the wire call either way and
  87. * this spares us an invalidation.
  88. */
  89. if (fattr->cf_flags & CIFS_FATTR_NEED_REVAL)
  90. return;
  91. retry:
  92. dentry = d_alloc_parallel(parent, name, &wq);
  93. }
  94. if (IS_ERR(dentry))
  95. return;
  96. if (!d_in_lookup(dentry)) {
  97. inode = d_inode(dentry);
  98. if (inode) {
  99. if (d_mountpoint(dentry)) {
  100. dput(dentry);
  101. return;
  102. }
  103. /*
  104. * If we're generating inode numbers, then we don't
  105. * want to clobber the existing one with the one that
  106. * the readdir code created.
  107. */
  108. if (!(cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM))
  109. fattr->cf_uniqueid = CIFS_I(inode)->uniqueid;
  110. /* update inode in place
  111. * if both i_ino and i_mode didn't change */
  112. if (CIFS_I(inode)->uniqueid == fattr->cf_uniqueid &&
  113. (inode->i_mode & S_IFMT) ==
  114. (fattr->cf_mode & S_IFMT)) {
  115. cifs_fattr_to_inode(inode, fattr);
  116. dput(dentry);
  117. return;
  118. }
  119. }
  120. d_invalidate(dentry);
  121. dput(dentry);
  122. goto retry;
  123. } else {
  124. inode = cifs_iget(sb, fattr);
  125. if (!inode)
  126. inode = ERR_PTR(-ENOMEM);
  127. alias = d_splice_alias(inode, dentry);
  128. d_lookup_done(dentry);
  129. if (alias && !IS_ERR(alias))
  130. dput(alias);
  131. }
  132. dput(dentry);
  133. }
  134. static void
  135. cifs_fill_common_info(struct cifs_fattr *fattr, struct cifs_sb_info *cifs_sb)
  136. {
  137. fattr->cf_uid = cifs_sb->mnt_uid;
  138. fattr->cf_gid = cifs_sb->mnt_gid;
  139. if (fattr->cf_cifsattrs & ATTR_DIRECTORY) {
  140. fattr->cf_mode = S_IFDIR | cifs_sb->mnt_dir_mode;
  141. fattr->cf_dtype = DT_DIR;
  142. } else {
  143. fattr->cf_mode = S_IFREG | cifs_sb->mnt_file_mode;
  144. fattr->cf_dtype = DT_REG;
  145. }
  146. /*
  147. * We need to revalidate it further to make a decision about whether it
  148. * is a symbolic link, DFS referral or a reparse point with a direct
  149. * access like junctions, deduplicated files, NFS symlinks.
  150. */
  151. if (fattr->cf_cifsattrs & ATTR_REPARSE)
  152. fattr->cf_flags |= CIFS_FATTR_NEED_REVAL;
  153. /* non-unix readdir doesn't provide nlink */
  154. fattr->cf_flags |= CIFS_FATTR_UNKNOWN_NLINK;
  155. if (fattr->cf_cifsattrs & ATTR_READONLY)
  156. fattr->cf_mode &= ~S_IWUGO;
  157. /*
  158. * We of course don't get ACL info in FIND_FIRST/NEXT results, so
  159. * mark it for revalidation so that "ls -l" will look right. It might
  160. * be super-slow, but if we don't do this then the ownership of files
  161. * may look wrong since the inodes may not have timed out by the time
  162. * "ls" does a stat() call on them.
  163. */
  164. if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_CIFS_ACL)
  165. fattr->cf_flags |= CIFS_FATTR_NEED_REVAL;
  166. if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_UNX_EMUL &&
  167. fattr->cf_cifsattrs & ATTR_SYSTEM) {
  168. if (fattr->cf_eof == 0) {
  169. fattr->cf_mode &= ~S_IFMT;
  170. fattr->cf_mode |= S_IFIFO;
  171. fattr->cf_dtype = DT_FIFO;
  172. } else {
  173. /*
  174. * trying to get the type and mode via SFU can be slow,
  175. * so just call those regular files for now, and mark
  176. * for reval
  177. */
  178. fattr->cf_flags |= CIFS_FATTR_NEED_REVAL;
  179. }
  180. }
  181. }
  182. void
  183. cifs_dir_info_to_fattr(struct cifs_fattr *fattr, FILE_DIRECTORY_INFO *info,
  184. struct cifs_sb_info *cifs_sb)
  185. {
  186. memset(fattr, 0, sizeof(*fattr));
  187. fattr->cf_cifsattrs = le32_to_cpu(info->ExtFileAttributes);
  188. fattr->cf_eof = le64_to_cpu(info->EndOfFile);
  189. fattr->cf_bytes = le64_to_cpu(info->AllocationSize);
  190. fattr->cf_createtime = le64_to_cpu(info->CreationTime);
  191. fattr->cf_atime = cifs_NTtimeToUnix(info->LastAccessTime);
  192. fattr->cf_ctime = cifs_NTtimeToUnix(info->ChangeTime);
  193. fattr->cf_mtime = cifs_NTtimeToUnix(info->LastWriteTime);
  194. cifs_fill_common_info(fattr, cifs_sb);
  195. }
  196. static void
  197. cifs_std_info_to_fattr(struct cifs_fattr *fattr, FIND_FILE_STANDARD_INFO *info,
  198. struct cifs_sb_info *cifs_sb)
  199. {
  200. int offset = cifs_sb_master_tcon(cifs_sb)->ses->server->timeAdj;
  201. memset(fattr, 0, sizeof(*fattr));
  202. fattr->cf_atime = cnvrtDosUnixTm(info->LastAccessDate,
  203. info->LastAccessTime, offset);
  204. fattr->cf_ctime = cnvrtDosUnixTm(info->LastWriteDate,
  205. info->LastWriteTime, offset);
  206. fattr->cf_mtime = cnvrtDosUnixTm(info->LastWriteDate,
  207. info->LastWriteTime, offset);
  208. fattr->cf_cifsattrs = le16_to_cpu(info->Attributes);
  209. fattr->cf_bytes = le32_to_cpu(info->AllocationSize);
  210. fattr->cf_eof = le32_to_cpu(info->DataSize);
  211. cifs_fill_common_info(fattr, cifs_sb);
  212. }
  213. /* BB eventually need to add the following helper function to
  214. resolve NT_STATUS_STOPPED_ON_SYMLINK return code when
  215. we try to do FindFirst on (NTFS) directory symlinks */
  216. /*
  217. int get_symlink_reparse_path(char *full_path, struct cifs_sb_info *cifs_sb,
  218. unsigned int xid)
  219. {
  220. __u16 fid;
  221. int len;
  222. int oplock = 0;
  223. int rc;
  224. struct cifs_tcon *ptcon = cifs_sb_tcon(cifs_sb);
  225. char *tmpbuffer;
  226. rc = CIFSSMBOpen(xid, ptcon, full_path, FILE_OPEN, GENERIC_READ,
  227. OPEN_REPARSE_POINT, &fid, &oplock, NULL,
  228. cifs_sb->local_nls,
  229. cifs_remap(cifs_sb);
  230. if (!rc) {
  231. tmpbuffer = kmalloc(maxpath);
  232. rc = CIFSSMBQueryReparseLinkInfo(xid, ptcon, full_path,
  233. tmpbuffer,
  234. maxpath -1,
  235. fid,
  236. cifs_sb->local_nls);
  237. if (CIFSSMBClose(xid, ptcon, fid)) {
  238. cifs_dbg(FYI, "Error closing temporary reparsepoint open\n");
  239. }
  240. }
  241. }
  242. */
  243. static int
  244. initiate_cifs_search(const unsigned int xid, struct file *file)
  245. {
  246. __u16 search_flags;
  247. int rc = 0;
  248. char *full_path = NULL;
  249. struct cifsFileInfo *cifsFile;
  250. struct cifs_sb_info *cifs_sb = CIFS_FILE_SB(file);
  251. struct tcon_link *tlink = NULL;
  252. struct cifs_tcon *tcon;
  253. struct TCP_Server_Info *server;
  254. if (file->private_data == NULL) {
  255. tlink = cifs_sb_tlink(cifs_sb);
  256. if (IS_ERR(tlink))
  257. return PTR_ERR(tlink);
  258. cifsFile = kzalloc(sizeof(struct cifsFileInfo), GFP_KERNEL);
  259. if (cifsFile == NULL) {
  260. rc = -ENOMEM;
  261. goto error_exit;
  262. }
  263. spin_lock_init(&cifsFile->file_info_lock);
  264. file->private_data = cifsFile;
  265. cifsFile->tlink = cifs_get_tlink(tlink);
  266. tcon = tlink_tcon(tlink);
  267. } else {
  268. cifsFile = file->private_data;
  269. tcon = tlink_tcon(cifsFile->tlink);
  270. }
  271. server = tcon->ses->server;
  272. if (!server->ops->query_dir_first) {
  273. rc = -ENOSYS;
  274. goto error_exit;
  275. }
  276. cifsFile->invalidHandle = true;
  277. cifsFile->srch_inf.endOfSearch = false;
  278. full_path = build_path_from_dentry(file_dentry(file));
  279. if (full_path == NULL) {
  280. rc = -ENOMEM;
  281. goto error_exit;
  282. }
  283. cifs_dbg(FYI, "Full path: %s start at: %lld\n", full_path, file->f_pos);
  284. ffirst_retry:
  285. /* test for Unix extensions */
  286. /* but now check for them on the share/mount not on the SMB session */
  287. /* if (cap_unix(tcon->ses) { */
  288. if (tcon->unix_ext)
  289. cifsFile->srch_inf.info_level = SMB_FIND_FILE_UNIX;
  290. else if ((tcon->ses->capabilities &
  291. tcon->ses->server->vals->cap_nt_find) == 0) {
  292. cifsFile->srch_inf.info_level = SMB_FIND_FILE_INFO_STANDARD;
  293. } else if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM) {
  294. cifsFile->srch_inf.info_level = SMB_FIND_FILE_ID_FULL_DIR_INFO;
  295. } else /* not srvinos - BB fixme add check for backlevel? */ {
  296. cifsFile->srch_inf.info_level = SMB_FIND_FILE_DIRECTORY_INFO;
  297. }
  298. search_flags = CIFS_SEARCH_CLOSE_AT_END | CIFS_SEARCH_RETURN_RESUME;
  299. if (backup_cred(cifs_sb))
  300. search_flags |= CIFS_SEARCH_BACKUP_SEARCH;
  301. rc = server->ops->query_dir_first(xid, tcon, full_path, cifs_sb,
  302. &cifsFile->fid, search_flags,
  303. &cifsFile->srch_inf);
  304. if (rc == 0)
  305. cifsFile->invalidHandle = false;
  306. /* BB add following call to handle readdir on new NTFS symlink errors
  307. else if STATUS_STOPPED_ON_SYMLINK
  308. call get_symlink_reparse_path and retry with new path */
  309. else if ((rc == -EOPNOTSUPP) &&
  310. (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM)) {
  311. cifs_sb->mnt_cifs_flags &= ~CIFS_MOUNT_SERVER_INUM;
  312. goto ffirst_retry;
  313. }
  314. error_exit:
  315. kfree(full_path);
  316. cifs_put_tlink(tlink);
  317. return rc;
  318. }
  319. /* return length of unicode string in bytes */
  320. static int cifs_unicode_bytelen(const char *str)
  321. {
  322. int len;
  323. const __le16 *ustr = (const __le16 *)str;
  324. for (len = 0; len <= PATH_MAX; len++) {
  325. if (ustr[len] == 0)
  326. return len << 1;
  327. }
  328. cifs_dbg(FYI, "Unicode string longer than PATH_MAX found\n");
  329. return len << 1;
  330. }
  331. static char *nxt_dir_entry(char *old_entry, char *end_of_smb, int level)
  332. {
  333. char *new_entry;
  334. FILE_DIRECTORY_INFO *pDirInfo = (FILE_DIRECTORY_INFO *)old_entry;
  335. if (level == SMB_FIND_FILE_INFO_STANDARD) {
  336. FIND_FILE_STANDARD_INFO *pfData;
  337. pfData = (FIND_FILE_STANDARD_INFO *)pDirInfo;
  338. new_entry = old_entry + sizeof(FIND_FILE_STANDARD_INFO) +
  339. pfData->FileNameLength;
  340. } else {
  341. u32 next_offset = le32_to_cpu(pDirInfo->NextEntryOffset);
  342. if (old_entry + next_offset < old_entry) {
  343. cifs_dbg(VFS, "invalid offset %u\n", next_offset);
  344. return NULL;
  345. }
  346. new_entry = old_entry + next_offset;
  347. }
  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_FILE_SB(file);
  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(&cfile->file_info_lock);
  542. if (server->ops->dir_needs_close(cfile)) {
  543. cfile->invalidHandle = true;
  544. spin_unlock(&cfile->file_info_lock);
  545. if (server->ops->close_dir)
  546. server->ops->close_dir(xid, tcon, &cfile->fid);
  547. } else
  548. spin_unlock(&cfile->file_info_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;
  590. if (cfile->srch_inf.ntwrk_buf_start == NULL) {
  591. cifs_dbg(VFS, "ntwrk_buf_start is NULL during readdir\n");
  592. return -EIO;
  593. }
  594. 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_inode(file)->i_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. int map_type;
  652. map_type = cifs_remap(cifs_sb);
  653. name.name = scratch_buf;
  654. name.len =
  655. cifs_from_utf16((char *)name.name, (__le16 *)de.name,
  656. UNICODE_NAME_MAX,
  657. min_t(size_t, de.namelen,
  658. (size_t)max_len), nlt, map_type);
  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. couldbe_mf_symlink(&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_dentry(file), &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. cifsFile = file->private_data;
  729. if (cifsFile->srch_inf.endOfSearch) {
  730. if (cifsFile->srch_inf.emptyDir) {
  731. cifs_dbg(FYI, "End of search, empty dir\n");
  732. rc = 0;
  733. goto rddir2_exit;
  734. }
  735. } /* else {
  736. cifsFile->invalidHandle = true;
  737. tcon->ses->server->close(xid, tcon, &cifsFile->fid);
  738. } */
  739. tcon = tlink_tcon(cifsFile->tlink);
  740. rc = find_cifs_entry(xid, tcon, ctx->pos, file, &current_entry,
  741. &num_to_fill);
  742. if (rc) {
  743. cifs_dbg(FYI, "fce error %d\n", rc);
  744. goto rddir2_exit;
  745. } else if (current_entry != NULL) {
  746. cifs_dbg(FYI, "entry %lld found\n", ctx->pos);
  747. } else {
  748. cifs_dbg(FYI, "could not find entry\n");
  749. goto rddir2_exit;
  750. }
  751. cifs_dbg(FYI, "loop through %d times filling dir for net buf %p\n",
  752. num_to_fill, cifsFile->srch_inf.ntwrk_buf_start);
  753. max_len = tcon->ses->server->ops->calc_smb_size(
  754. cifsFile->srch_inf.ntwrk_buf_start);
  755. end_of_smb = cifsFile->srch_inf.ntwrk_buf_start + max_len;
  756. tmp_buf = kmalloc(UNICODE_NAME_MAX, GFP_KERNEL);
  757. if (tmp_buf == NULL) {
  758. rc = -ENOMEM;
  759. goto rddir2_exit;
  760. }
  761. for (i = 0; i < num_to_fill; i++) {
  762. if (current_entry == NULL) {
  763. /* evaluate whether this case is an error */
  764. cifs_dbg(VFS, "past SMB end, num to fill %d i %d\n",
  765. num_to_fill, i);
  766. break;
  767. }
  768. /*
  769. * if buggy server returns . and .. late do we want to
  770. * check for that here?
  771. */
  772. *tmp_buf = 0;
  773. rc = cifs_filldir(current_entry, file, ctx,
  774. tmp_buf, max_len);
  775. if (rc) {
  776. if (rc > 0)
  777. rc = 0;
  778. break;
  779. }
  780. ctx->pos++;
  781. if (ctx->pos ==
  782. cifsFile->srch_inf.index_of_last_entry) {
  783. cifs_dbg(FYI, "last entry in buf at pos %lld %s\n",
  784. ctx->pos, tmp_buf);
  785. cifs_save_resume_key(current_entry, cifsFile);
  786. break;
  787. } else
  788. current_entry =
  789. nxt_dir_entry(current_entry, end_of_smb,
  790. cifsFile->srch_inf.info_level);
  791. }
  792. kfree(tmp_buf);
  793. rddir2_exit:
  794. free_xid(xid);
  795. return rc;
  796. }