readdir.c 34 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110
  1. /*
  2. * fs/cifs/readdir.c
  3. *
  4. * Directory search handling
  5. *
  6. * Copyright (C) International Business Machines Corp., 2004, 2008
  7. * Author(s): Steve French (sfrench@us.ibm.com)
  8. *
  9. * This library is free software; you can redistribute it and/or modify
  10. * it under the terms of the GNU Lesser General Public License as published
  11. * by the Free Software Foundation; either version 2.1 of the License, or
  12. * (at your option) any later version.
  13. *
  14. * This library is distributed in the hope that it will be useful,
  15. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  16. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See
  17. * the GNU Lesser General Public License for more details.
  18. *
  19. * You should have received a copy of the GNU Lesser General Public License
  20. * along with this library; if not, write to the Free Software
  21. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  22. */
  23. #include <linux/fs.h>
  24. #include <linux/pagemap.h>
  25. #include <linux/stat.h>
  26. #include "cifspdu.h"
  27. #include "cifsglob.h"
  28. #include "cifsproto.h"
  29. #include "cifs_unicode.h"
  30. #include "cifs_debug.h"
  31. #include "cifs_fs_sb.h"
  32. #include "cifsfs.h"
  33. #ifdef CONFIG_CIFS_DEBUG2
  34. static void dump_cifs_file_struct(struct file *file, char *label)
  35. {
  36. struct cifsFileInfo *cf;
  37. if (file) {
  38. cf = file->private_data;
  39. if (cf == NULL) {
  40. cFYI(1, ("empty cifs private file data"));
  41. return;
  42. }
  43. if (cf->invalidHandle)
  44. cFYI(1, ("invalid handle"));
  45. if (cf->srch_inf.endOfSearch)
  46. cFYI(1, ("end of search"));
  47. if (cf->srch_inf.emptyDir)
  48. cFYI(1, ("empty dir"));
  49. }
  50. }
  51. #else
  52. static inline void dump_cifs_file_struct(struct file *file, char *label)
  53. {
  54. }
  55. #endif /* DEBUG2 */
  56. /* Returns one if new inode created (which therefore needs to be hashed) */
  57. /* Might check in the future if inode number changed so we can rehash inode */
  58. static int construct_dentry(struct qstr *qstring, struct file *file,
  59. struct inode **ptmp_inode, struct dentry **pnew_dentry)
  60. {
  61. struct dentry *tmp_dentry;
  62. struct cifs_sb_info *cifs_sb;
  63. struct cifsTconInfo *pTcon;
  64. int rc = 0;
  65. cFYI(1, ("For %s", qstring->name));
  66. cifs_sb = CIFS_SB(file->f_path.dentry->d_sb);
  67. pTcon = cifs_sb->tcon;
  68. qstring->hash = full_name_hash(qstring->name, qstring->len);
  69. tmp_dentry = d_lookup(file->f_path.dentry, qstring);
  70. if (tmp_dentry) {
  71. cFYI(0, ("existing dentry with inode 0x%p",
  72. tmp_dentry->d_inode));
  73. *ptmp_inode = tmp_dentry->d_inode;
  74. /* BB overwrite old name? i.e. tmp_dentry->d_name and tmp_dentry->d_name.len??*/
  75. if (*ptmp_inode == NULL) {
  76. *ptmp_inode = new_inode(file->f_path.dentry->d_sb);
  77. if (*ptmp_inode == NULL)
  78. return rc;
  79. rc = 1;
  80. }
  81. if (file->f_path.dentry->d_sb->s_flags & MS_NOATIME)
  82. (*ptmp_inode)->i_flags |= S_NOATIME | S_NOCMTIME;
  83. } else {
  84. tmp_dentry = d_alloc(file->f_path.dentry, qstring);
  85. if (tmp_dentry == NULL) {
  86. cERROR(1, ("Failed allocating dentry"));
  87. *ptmp_inode = NULL;
  88. return rc;
  89. }
  90. *ptmp_inode = new_inode(file->f_path.dentry->d_sb);
  91. if (pTcon->nocase)
  92. tmp_dentry->d_op = &cifs_ci_dentry_ops;
  93. else
  94. tmp_dentry->d_op = &cifs_dentry_ops;
  95. if (*ptmp_inode == NULL)
  96. return rc;
  97. if (file->f_path.dentry->d_sb->s_flags & MS_NOATIME)
  98. (*ptmp_inode)->i_flags |= S_NOATIME | S_NOCMTIME;
  99. rc = 2;
  100. }
  101. tmp_dentry->d_time = jiffies;
  102. *pnew_dentry = tmp_dentry;
  103. return rc;
  104. }
  105. static void AdjustForTZ(struct cifsTconInfo *tcon, struct inode *inode)
  106. {
  107. if ((tcon) && (tcon->ses) && (tcon->ses->server)) {
  108. inode->i_ctime.tv_sec += tcon->ses->server->timeAdj;
  109. inode->i_mtime.tv_sec += tcon->ses->server->timeAdj;
  110. inode->i_atime.tv_sec += tcon->ses->server->timeAdj;
  111. }
  112. return;
  113. }
  114. static void fill_in_inode(struct inode *tmp_inode, int new_buf_type,
  115. char *buf, unsigned int *pobject_type, int isNewInode)
  116. {
  117. loff_t local_size;
  118. struct timespec local_mtime;
  119. struct cifsInodeInfo *cifsInfo = CIFS_I(tmp_inode);
  120. struct cifs_sb_info *cifs_sb = CIFS_SB(tmp_inode->i_sb);
  121. __u32 attr;
  122. __u64 allocation_size;
  123. __u64 end_of_file;
  124. umode_t default_mode;
  125. /* save mtime and size */
  126. local_mtime = tmp_inode->i_mtime;
  127. local_size = tmp_inode->i_size;
  128. if (new_buf_type) {
  129. FILE_DIRECTORY_INFO *pfindData = (FILE_DIRECTORY_INFO *)buf;
  130. attr = le32_to_cpu(pfindData->ExtFileAttributes);
  131. allocation_size = le64_to_cpu(pfindData->AllocationSize);
  132. end_of_file = le64_to_cpu(pfindData->EndOfFile);
  133. tmp_inode->i_atime =
  134. cifs_NTtimeToUnix(le64_to_cpu(pfindData->LastAccessTime));
  135. tmp_inode->i_mtime =
  136. cifs_NTtimeToUnix(le64_to_cpu(pfindData->LastWriteTime));
  137. tmp_inode->i_ctime =
  138. cifs_NTtimeToUnix(le64_to_cpu(pfindData->ChangeTime));
  139. } else { /* legacy, OS2 and DOS style */
  140. /* struct timespec ts;*/
  141. FIND_FILE_STANDARD_INFO *pfindData =
  142. (FIND_FILE_STANDARD_INFO *)buf;
  143. tmp_inode->i_mtime = cnvrtDosUnixTm(
  144. le16_to_cpu(pfindData->LastWriteDate),
  145. le16_to_cpu(pfindData->LastWriteTime));
  146. tmp_inode->i_atime = cnvrtDosUnixTm(
  147. le16_to_cpu(pfindData->LastAccessDate),
  148. le16_to_cpu(pfindData->LastAccessTime));
  149. tmp_inode->i_ctime = cnvrtDosUnixTm(
  150. le16_to_cpu(pfindData->LastWriteDate),
  151. le16_to_cpu(pfindData->LastWriteTime));
  152. AdjustForTZ(cifs_sb->tcon, tmp_inode);
  153. attr = le16_to_cpu(pfindData->Attributes);
  154. allocation_size = le32_to_cpu(pfindData->AllocationSize);
  155. end_of_file = le32_to_cpu(pfindData->DataSize);
  156. }
  157. /* Linux can not store file creation time unfortunately so ignore it */
  158. cifsInfo->cifsAttrs = attr;
  159. #ifdef CONFIG_CIFS_EXPERIMENTAL
  160. if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_CIFS_ACL) {
  161. /* get more accurate mode via ACL - so force inode refresh */
  162. cifsInfo->time = 0;
  163. } else
  164. #endif /* CONFIG_CIFS_EXPERIMENTAL */
  165. cifsInfo->time = jiffies;
  166. /* treat dos attribute of read-only as read-only mode bit e.g. 555? */
  167. /* 2767 perms - indicate mandatory locking */
  168. /* BB fill in uid and gid here? with help from winbind?
  169. or retrieve from NTFS stream extended attribute */
  170. if (atomic_read(&cifsInfo->inUse) == 0) {
  171. tmp_inode->i_uid = cifs_sb->mnt_uid;
  172. tmp_inode->i_gid = cifs_sb->mnt_gid;
  173. }
  174. if (attr & ATTR_DIRECTORY)
  175. default_mode = cifs_sb->mnt_dir_mode;
  176. else
  177. default_mode = cifs_sb->mnt_file_mode;
  178. /* set initial permissions */
  179. if ((atomic_read(&cifsInfo->inUse) == 0) ||
  180. (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_DYNPERM) == 0)
  181. tmp_inode->i_mode = default_mode;
  182. else {
  183. /* just reenable write bits if !ATTR_READONLY */
  184. if ((tmp_inode->i_mode & S_IWUGO) == 0 &&
  185. (attr & ATTR_READONLY) == 0)
  186. tmp_inode->i_mode |= (S_IWUGO & default_mode);
  187. tmp_inode->i_mode &= ~S_IFMT;
  188. }
  189. /* clear write bits if ATTR_READONLY is set */
  190. if (attr & ATTR_READONLY)
  191. tmp_inode->i_mode &= ~S_IWUGO;
  192. /* set inode type */
  193. if ((attr & ATTR_SYSTEM) &&
  194. (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_UNX_EMUL)) {
  195. if (end_of_file == 0) {
  196. tmp_inode->i_mode |= S_IFIFO;
  197. *pobject_type = DT_FIFO;
  198. } else {
  199. /*
  200. * trying to get the type can be slow, so just call
  201. * this a regular file for now, and mark for reval
  202. */
  203. tmp_inode->i_mode |= S_IFREG;
  204. *pobject_type = DT_REG;
  205. cifsInfo->time = 0;
  206. }
  207. } else {
  208. if (attr & ATTR_DIRECTORY) {
  209. tmp_inode->i_mode |= S_IFDIR;
  210. *pobject_type = DT_DIR;
  211. } else {
  212. tmp_inode->i_mode |= S_IFREG;
  213. *pobject_type = DT_REG;
  214. }
  215. }
  216. /* can not fill in nlink here as in qpathinfo version and Unx search */
  217. if (atomic_read(&cifsInfo->inUse) == 0)
  218. atomic_set(&cifsInfo->inUse, 1);
  219. spin_lock(&tmp_inode->i_lock);
  220. if (is_size_safe_to_change(cifsInfo, end_of_file)) {
  221. /* can not safely change the file size here if the
  222. client is writing to it due to potential races */
  223. i_size_write(tmp_inode, end_of_file);
  224. /* 512 bytes (2**9) is the fake blocksize that must be used */
  225. /* for this calculation, even though the reported blocksize is larger */
  226. tmp_inode->i_blocks = (512 - 1 + allocation_size) >> 9;
  227. }
  228. spin_unlock(&tmp_inode->i_lock);
  229. if (allocation_size < end_of_file)
  230. cFYI(1, ("May be sparse file, allocation less than file size"));
  231. cFYI(1, ("File Size %ld and blocks %llu",
  232. (unsigned long)tmp_inode->i_size,
  233. (unsigned long long)tmp_inode->i_blocks));
  234. if (S_ISREG(tmp_inode->i_mode)) {
  235. cFYI(1, ("File inode"));
  236. tmp_inode->i_op = &cifs_file_inode_ops;
  237. if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_DIRECT_IO) {
  238. if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_NO_BRL)
  239. tmp_inode->i_fop = &cifs_file_direct_nobrl_ops;
  240. else
  241. tmp_inode->i_fop = &cifs_file_direct_ops;
  242. } else if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_NO_BRL)
  243. tmp_inode->i_fop = &cifs_file_nobrl_ops;
  244. else
  245. tmp_inode->i_fop = &cifs_file_ops;
  246. if ((cifs_sb->tcon) && (cifs_sb->tcon->ses) &&
  247. (cifs_sb->tcon->ses->server->maxBuf <
  248. PAGE_CACHE_SIZE + MAX_CIFS_HDR_SIZE))
  249. tmp_inode->i_data.a_ops = &cifs_addr_ops_smallbuf;
  250. else
  251. tmp_inode->i_data.a_ops = &cifs_addr_ops;
  252. if (isNewInode)
  253. return; /* No sense invalidating pages for new inode
  254. since have not started caching readahead file
  255. data yet */
  256. if (timespec_equal(&tmp_inode->i_mtime, &local_mtime) &&
  257. (local_size == tmp_inode->i_size)) {
  258. cFYI(1, ("inode exists but unchanged"));
  259. } else {
  260. /* file may have changed on server */
  261. cFYI(1, ("invalidate inode, readdir detected change"));
  262. invalidate_remote_inode(tmp_inode);
  263. }
  264. } else if (S_ISDIR(tmp_inode->i_mode)) {
  265. cFYI(1, ("Directory inode"));
  266. tmp_inode->i_op = &cifs_dir_inode_ops;
  267. tmp_inode->i_fop = &cifs_dir_ops;
  268. } else if (S_ISLNK(tmp_inode->i_mode)) {
  269. cFYI(1, ("Symbolic Link inode"));
  270. tmp_inode->i_op = &cifs_symlink_inode_ops;
  271. } else {
  272. cFYI(1, ("Init special inode"));
  273. init_special_inode(tmp_inode, tmp_inode->i_mode,
  274. tmp_inode->i_rdev);
  275. }
  276. }
  277. static void unix_fill_in_inode(struct inode *tmp_inode,
  278. FILE_UNIX_INFO *pfindData, unsigned int *pobject_type, int isNewInode)
  279. {
  280. loff_t local_size;
  281. struct timespec local_mtime;
  282. struct cifsInodeInfo *cifsInfo = CIFS_I(tmp_inode);
  283. struct cifs_sb_info *cifs_sb = CIFS_SB(tmp_inode->i_sb);
  284. __u32 type = le32_to_cpu(pfindData->Type);
  285. __u64 num_of_bytes = le64_to_cpu(pfindData->NumOfBytes);
  286. __u64 end_of_file = le64_to_cpu(pfindData->EndOfFile);
  287. cifsInfo->time = jiffies;
  288. atomic_inc(&cifsInfo->inUse);
  289. /* save mtime and size */
  290. local_mtime = tmp_inode->i_mtime;
  291. local_size = tmp_inode->i_size;
  292. tmp_inode->i_atime =
  293. cifs_NTtimeToUnix(le64_to_cpu(pfindData->LastAccessTime));
  294. tmp_inode->i_mtime =
  295. cifs_NTtimeToUnix(le64_to_cpu(pfindData->LastModificationTime));
  296. tmp_inode->i_ctime =
  297. cifs_NTtimeToUnix(le64_to_cpu(pfindData->LastStatusChange));
  298. tmp_inode->i_mode = le64_to_cpu(pfindData->Permissions);
  299. /* since we set the inode type below we need to mask off type
  300. to avoid strange results if bits above were corrupt */
  301. tmp_inode->i_mode &= ~S_IFMT;
  302. if (type == UNIX_FILE) {
  303. *pobject_type = DT_REG;
  304. tmp_inode->i_mode |= S_IFREG;
  305. } else if (type == UNIX_SYMLINK) {
  306. *pobject_type = DT_LNK;
  307. tmp_inode->i_mode |= S_IFLNK;
  308. } else if (type == UNIX_DIR) {
  309. *pobject_type = DT_DIR;
  310. tmp_inode->i_mode |= S_IFDIR;
  311. } else if (type == UNIX_CHARDEV) {
  312. *pobject_type = DT_CHR;
  313. tmp_inode->i_mode |= S_IFCHR;
  314. tmp_inode->i_rdev = MKDEV(le64_to_cpu(pfindData->DevMajor),
  315. le64_to_cpu(pfindData->DevMinor) & MINORMASK);
  316. } else if (type == UNIX_BLOCKDEV) {
  317. *pobject_type = DT_BLK;
  318. tmp_inode->i_mode |= S_IFBLK;
  319. tmp_inode->i_rdev = MKDEV(le64_to_cpu(pfindData->DevMajor),
  320. le64_to_cpu(pfindData->DevMinor) & MINORMASK);
  321. } else if (type == UNIX_FIFO) {
  322. *pobject_type = DT_FIFO;
  323. tmp_inode->i_mode |= S_IFIFO;
  324. } else if (type == UNIX_SOCKET) {
  325. *pobject_type = DT_SOCK;
  326. tmp_inode->i_mode |= S_IFSOCK;
  327. } else {
  328. /* safest to just call it a file */
  329. *pobject_type = DT_REG;
  330. tmp_inode->i_mode |= S_IFREG;
  331. cFYI(1, ("unknown inode type %d", type));
  332. }
  333. if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_OVERR_UID)
  334. tmp_inode->i_uid = cifs_sb->mnt_uid;
  335. else
  336. tmp_inode->i_uid = le64_to_cpu(pfindData->Uid);
  337. if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_OVERR_GID)
  338. tmp_inode->i_gid = cifs_sb->mnt_gid;
  339. else
  340. tmp_inode->i_gid = le64_to_cpu(pfindData->Gid);
  341. tmp_inode->i_nlink = le64_to_cpu(pfindData->Nlinks);
  342. spin_lock(&tmp_inode->i_lock);
  343. if (is_size_safe_to_change(cifsInfo, end_of_file)) {
  344. /* can not safely change the file size here if the
  345. client is writing to it due to potential races */
  346. i_size_write(tmp_inode, end_of_file);
  347. /* 512 bytes (2**9) is the fake blocksize that must be used */
  348. /* for this calculation, not the real blocksize */
  349. tmp_inode->i_blocks = (512 - 1 + num_of_bytes) >> 9;
  350. }
  351. spin_unlock(&tmp_inode->i_lock);
  352. if (S_ISREG(tmp_inode->i_mode)) {
  353. cFYI(1, ("File inode"));
  354. tmp_inode->i_op = &cifs_file_inode_ops;
  355. if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_DIRECT_IO) {
  356. if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_NO_BRL)
  357. tmp_inode->i_fop = &cifs_file_direct_nobrl_ops;
  358. else
  359. tmp_inode->i_fop = &cifs_file_direct_ops;
  360. } else if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_NO_BRL)
  361. tmp_inode->i_fop = &cifs_file_nobrl_ops;
  362. else
  363. tmp_inode->i_fop = &cifs_file_ops;
  364. if ((cifs_sb->tcon) && (cifs_sb->tcon->ses) &&
  365. (cifs_sb->tcon->ses->server->maxBuf <
  366. PAGE_CACHE_SIZE + MAX_CIFS_HDR_SIZE))
  367. tmp_inode->i_data.a_ops = &cifs_addr_ops_smallbuf;
  368. else
  369. tmp_inode->i_data.a_ops = &cifs_addr_ops;
  370. if (isNewInode)
  371. return; /* No sense invalidating pages for new inode
  372. since we have not started caching readahead
  373. file data for it yet */
  374. if (timespec_equal(&tmp_inode->i_mtime, &local_mtime) &&
  375. (local_size == tmp_inode->i_size)) {
  376. cFYI(1, ("inode exists but unchanged"));
  377. } else {
  378. /* file may have changed on server */
  379. cFYI(1, ("invalidate inode, readdir detected change"));
  380. invalidate_remote_inode(tmp_inode);
  381. }
  382. } else if (S_ISDIR(tmp_inode->i_mode)) {
  383. cFYI(1, ("Directory inode"));
  384. tmp_inode->i_op = &cifs_dir_inode_ops;
  385. tmp_inode->i_fop = &cifs_dir_ops;
  386. } else if (S_ISLNK(tmp_inode->i_mode)) {
  387. cFYI(1, ("Symbolic Link inode"));
  388. tmp_inode->i_op = &cifs_symlink_inode_ops;
  389. /* tmp_inode->i_fop = *//* do not need to set to anything */
  390. } else {
  391. cFYI(1, ("Special inode"));
  392. init_special_inode(tmp_inode, tmp_inode->i_mode,
  393. tmp_inode->i_rdev);
  394. }
  395. }
  396. static int initiate_cifs_search(const int xid, struct file *file)
  397. {
  398. int rc = 0;
  399. char *full_path;
  400. struct cifsFileInfo *cifsFile;
  401. struct cifs_sb_info *cifs_sb;
  402. struct cifsTconInfo *pTcon;
  403. if (file->private_data == NULL) {
  404. file->private_data =
  405. kzalloc(sizeof(struct cifsFileInfo), GFP_KERNEL);
  406. }
  407. if (file->private_data == NULL)
  408. return -ENOMEM;
  409. cifsFile = file->private_data;
  410. cifsFile->invalidHandle = true;
  411. cifsFile->srch_inf.endOfSearch = false;
  412. cifs_sb = CIFS_SB(file->f_path.dentry->d_sb);
  413. if (cifs_sb == NULL)
  414. return -EINVAL;
  415. pTcon = cifs_sb->tcon;
  416. if (pTcon == NULL)
  417. return -EINVAL;
  418. full_path = build_path_from_dentry(file->f_path.dentry);
  419. if (full_path == NULL)
  420. return -ENOMEM;
  421. cFYI(1, ("Full path: %s start at: %lld", full_path, file->f_pos));
  422. ffirst_retry:
  423. /* test for Unix extensions */
  424. /* but now check for them on the share/mount not on the SMB session */
  425. /* if (pTcon->ses->capabilities & CAP_UNIX) { */
  426. if (pTcon->unix_ext)
  427. cifsFile->srch_inf.info_level = SMB_FIND_FILE_UNIX;
  428. else if ((pTcon->ses->capabilities &
  429. (CAP_NT_SMBS | CAP_NT_FIND)) == 0) {
  430. cifsFile->srch_inf.info_level = SMB_FIND_FILE_INFO_STANDARD;
  431. } else if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM) {
  432. cifsFile->srch_inf.info_level = SMB_FIND_FILE_ID_FULL_DIR_INFO;
  433. } else /* not srvinos - BB fixme add check for backlevel? */ {
  434. cifsFile->srch_inf.info_level = SMB_FIND_FILE_DIRECTORY_INFO;
  435. }
  436. rc = CIFSFindFirst(xid, pTcon, full_path, cifs_sb->local_nls,
  437. &cifsFile->netfid, &cifsFile->srch_inf,
  438. cifs_sb->mnt_cifs_flags &
  439. CIFS_MOUNT_MAP_SPECIAL_CHR, CIFS_DIR_SEP(cifs_sb));
  440. if (rc == 0)
  441. cifsFile->invalidHandle = false;
  442. if ((rc == -EOPNOTSUPP) &&
  443. (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM)) {
  444. cifs_sb->mnt_cifs_flags &= ~CIFS_MOUNT_SERVER_INUM;
  445. goto ffirst_retry;
  446. }
  447. kfree(full_path);
  448. return rc;
  449. }
  450. /* return length of unicode string in bytes */
  451. static int cifs_unicode_bytelen(char *str)
  452. {
  453. int len;
  454. __le16 *ustr = (__le16 *)str;
  455. for (len = 0; len <= PATH_MAX; len++) {
  456. if (ustr[len] == 0)
  457. return len << 1;
  458. }
  459. cFYI(1, ("Unicode string longer than PATH_MAX found"));
  460. return len << 1;
  461. }
  462. static char *nxt_dir_entry(char *old_entry, char *end_of_smb, int level)
  463. {
  464. char *new_entry;
  465. FILE_DIRECTORY_INFO *pDirInfo = (FILE_DIRECTORY_INFO *)old_entry;
  466. if (level == SMB_FIND_FILE_INFO_STANDARD) {
  467. FIND_FILE_STANDARD_INFO *pfData;
  468. pfData = (FIND_FILE_STANDARD_INFO *)pDirInfo;
  469. new_entry = old_entry + sizeof(FIND_FILE_STANDARD_INFO) +
  470. pfData->FileNameLength;
  471. } else
  472. new_entry = old_entry + le32_to_cpu(pDirInfo->NextEntryOffset);
  473. cFYI(1, ("new entry %p old entry %p", new_entry, old_entry));
  474. /* validate that new_entry is not past end of SMB */
  475. if (new_entry >= end_of_smb) {
  476. cERROR(1,
  477. ("search entry %p began after end of SMB %p old entry %p",
  478. new_entry, end_of_smb, old_entry));
  479. return NULL;
  480. } else if (((level == SMB_FIND_FILE_INFO_STANDARD) &&
  481. (new_entry + sizeof(FIND_FILE_STANDARD_INFO) > end_of_smb))
  482. || ((level != SMB_FIND_FILE_INFO_STANDARD) &&
  483. (new_entry + sizeof(FILE_DIRECTORY_INFO) > end_of_smb))) {
  484. cERROR(1, ("search entry %p extends after end of SMB %p",
  485. new_entry, end_of_smb));
  486. return NULL;
  487. } else
  488. return new_entry;
  489. }
  490. #define UNICODE_DOT cpu_to_le16(0x2e)
  491. /* return 0 if no match and 1 for . (current directory) and 2 for .. (parent) */
  492. static int cifs_entry_is_dot(char *current_entry, struct cifsFileInfo *cfile)
  493. {
  494. int rc = 0;
  495. char *filename = NULL;
  496. int len = 0;
  497. if (cfile->srch_inf.info_level == SMB_FIND_FILE_UNIX) {
  498. FILE_UNIX_INFO *pFindData = (FILE_UNIX_INFO *)current_entry;
  499. filename = &pFindData->FileName[0];
  500. if (cfile->srch_inf.unicode) {
  501. len = cifs_unicode_bytelen(filename);
  502. } else {
  503. /* BB should we make this strnlen of PATH_MAX? */
  504. len = strnlen(filename, 5);
  505. }
  506. } else if (cfile->srch_inf.info_level == SMB_FIND_FILE_DIRECTORY_INFO) {
  507. FILE_DIRECTORY_INFO *pFindData =
  508. (FILE_DIRECTORY_INFO *)current_entry;
  509. filename = &pFindData->FileName[0];
  510. len = le32_to_cpu(pFindData->FileNameLength);
  511. } else if (cfile->srch_inf.info_level ==
  512. SMB_FIND_FILE_FULL_DIRECTORY_INFO) {
  513. FILE_FULL_DIRECTORY_INFO *pFindData =
  514. (FILE_FULL_DIRECTORY_INFO *)current_entry;
  515. filename = &pFindData->FileName[0];
  516. len = le32_to_cpu(pFindData->FileNameLength);
  517. } else if (cfile->srch_inf.info_level ==
  518. SMB_FIND_FILE_ID_FULL_DIR_INFO) {
  519. SEARCH_ID_FULL_DIR_INFO *pFindData =
  520. (SEARCH_ID_FULL_DIR_INFO *)current_entry;
  521. filename = &pFindData->FileName[0];
  522. len = le32_to_cpu(pFindData->FileNameLength);
  523. } else if (cfile->srch_inf.info_level ==
  524. SMB_FIND_FILE_BOTH_DIRECTORY_INFO) {
  525. FILE_BOTH_DIRECTORY_INFO *pFindData =
  526. (FILE_BOTH_DIRECTORY_INFO *)current_entry;
  527. filename = &pFindData->FileName[0];
  528. len = le32_to_cpu(pFindData->FileNameLength);
  529. } else if (cfile->srch_inf.info_level == SMB_FIND_FILE_INFO_STANDARD) {
  530. FIND_FILE_STANDARD_INFO *pFindData =
  531. (FIND_FILE_STANDARD_INFO *)current_entry;
  532. filename = &pFindData->FileName[0];
  533. len = pFindData->FileNameLength;
  534. } else {
  535. cFYI(1, ("Unknown findfirst level %d",
  536. cfile->srch_inf.info_level));
  537. }
  538. if (filename) {
  539. if (cfile->srch_inf.unicode) {
  540. __le16 *ufilename = (__le16 *)filename;
  541. if (len == 2) {
  542. /* check for . */
  543. if (ufilename[0] == UNICODE_DOT)
  544. rc = 1;
  545. } else if (len == 4) {
  546. /* check for .. */
  547. if ((ufilename[0] == UNICODE_DOT)
  548. && (ufilename[1] == UNICODE_DOT))
  549. rc = 2;
  550. }
  551. } else /* ASCII */ {
  552. if (len == 1) {
  553. if (filename[0] == '.')
  554. rc = 1;
  555. } else if (len == 2) {
  556. if ((filename[0] == '.') && (filename[1] == '.'))
  557. rc = 2;
  558. }
  559. }
  560. }
  561. return rc;
  562. }
  563. /* Check if directory that we are searching has changed so we can decide
  564. whether we can use the cached search results from the previous search */
  565. static int is_dir_changed(struct file *file)
  566. {
  567. struct inode *inode = file->f_path.dentry->d_inode;
  568. struct cifsInodeInfo *cifsInfo = CIFS_I(inode);
  569. if (cifsInfo->time == 0)
  570. return 1; /* directory was changed, perhaps due to unlink */
  571. else
  572. return 0;
  573. }
  574. /* find the corresponding entry in the search */
  575. /* Note that the SMB server returns search entries for . and .. which
  576. complicates logic here if we choose to parse for them and we do not
  577. assume that they are located in the findfirst return buffer.*/
  578. /* We start counting in the buffer with entry 2 and increment for every
  579. entry (do not increment for . or .. entry) */
  580. static int find_cifs_entry(const int xid, struct cifsTconInfo *pTcon,
  581. struct file *file, char **ppCurrentEntry, int *num_to_ret)
  582. {
  583. int rc = 0;
  584. int pos_in_buf = 0;
  585. loff_t first_entry_in_buffer;
  586. loff_t index_to_find = file->f_pos;
  587. struct cifsFileInfo *cifsFile = file->private_data;
  588. /* check if index in the buffer */
  589. if ((cifsFile == NULL) || (ppCurrentEntry == NULL) ||
  590. (num_to_ret == NULL))
  591. return -ENOENT;
  592. *ppCurrentEntry = NULL;
  593. first_entry_in_buffer =
  594. cifsFile->srch_inf.index_of_last_entry -
  595. cifsFile->srch_inf.entries_in_buffer;
  596. /* if first entry in buf is zero then is first buffer
  597. in search response data which means it is likely . and ..
  598. will be in this buffer, although some servers do not return
  599. . and .. for the root of a drive and for those we need
  600. to start two entries earlier */
  601. dump_cifs_file_struct(file, "In fce ");
  602. if (((index_to_find < cifsFile->srch_inf.index_of_last_entry) &&
  603. is_dir_changed(file)) ||
  604. (index_to_find < first_entry_in_buffer)) {
  605. /* close and restart search */
  606. cFYI(1, ("search backing up - close and restart search"));
  607. if (!cifsFile->srch_inf.endOfSearch &&
  608. !cifsFile->invalidHandle) {
  609. cifsFile->invalidHandle = true;
  610. CIFSFindClose(xid, pTcon, cifsFile->netfid);
  611. }
  612. if (cifsFile->srch_inf.ntwrk_buf_start) {
  613. cFYI(1, ("freeing SMB ff cache buf on search rewind"));
  614. if (cifsFile->srch_inf.smallBuf)
  615. cifs_small_buf_release(cifsFile->srch_inf.
  616. ntwrk_buf_start);
  617. else
  618. cifs_buf_release(cifsFile->srch_inf.
  619. ntwrk_buf_start);
  620. }
  621. rc = initiate_cifs_search(xid, file);
  622. if (rc) {
  623. cFYI(1, ("error %d reinitiating a search on rewind",
  624. rc));
  625. return rc;
  626. }
  627. }
  628. while ((index_to_find >= cifsFile->srch_inf.index_of_last_entry) &&
  629. (rc == 0) && !cifsFile->srch_inf.endOfSearch) {
  630. cFYI(1, ("calling findnext2"));
  631. rc = CIFSFindNext(xid, pTcon, cifsFile->netfid,
  632. &cifsFile->srch_inf);
  633. if (rc)
  634. return -ENOENT;
  635. }
  636. if (index_to_find < cifsFile->srch_inf.index_of_last_entry) {
  637. /* we found the buffer that contains the entry */
  638. /* scan and find it */
  639. int i;
  640. char *current_entry;
  641. char *end_of_smb = cifsFile->srch_inf.ntwrk_buf_start +
  642. smbCalcSize((struct smb_hdr *)
  643. cifsFile->srch_inf.ntwrk_buf_start);
  644. current_entry = cifsFile->srch_inf.srch_entries_start;
  645. first_entry_in_buffer = cifsFile->srch_inf.index_of_last_entry
  646. - cifsFile->srch_inf.entries_in_buffer;
  647. pos_in_buf = index_to_find - first_entry_in_buffer;
  648. cFYI(1, ("found entry - pos_in_buf %d", pos_in_buf));
  649. for (i = 0; (i < (pos_in_buf)) && (current_entry != NULL); i++) {
  650. /* go entry by entry figuring out which is first */
  651. current_entry = nxt_dir_entry(current_entry, end_of_smb,
  652. cifsFile->srch_inf.info_level);
  653. }
  654. if ((current_entry == NULL) && (i < pos_in_buf)) {
  655. /* BB fixme - check if we should flag this error */
  656. cERROR(1, ("reached end of buf searching for pos in buf"
  657. " %d index to find %lld rc %d",
  658. pos_in_buf, index_to_find, rc));
  659. }
  660. rc = 0;
  661. *ppCurrentEntry = current_entry;
  662. } else {
  663. cFYI(1, ("index not in buffer - could not findnext into it"));
  664. return 0;
  665. }
  666. if (pos_in_buf >= cifsFile->srch_inf.entries_in_buffer) {
  667. cFYI(1, ("can not return entries pos_in_buf beyond last"));
  668. *num_to_ret = 0;
  669. } else
  670. *num_to_ret = cifsFile->srch_inf.entries_in_buffer - pos_in_buf;
  671. return rc;
  672. }
  673. /* inode num, inode type and filename returned */
  674. static int cifs_get_name_from_search_buf(struct qstr *pqst,
  675. char *current_entry, __u16 level, unsigned int unicode,
  676. struct cifs_sb_info *cifs_sb, int max_len, ino_t *pinum)
  677. {
  678. int rc = 0;
  679. unsigned int len = 0;
  680. char *filename;
  681. struct nls_table *nlt = cifs_sb->local_nls;
  682. *pinum = 0;
  683. if (level == SMB_FIND_FILE_UNIX) {
  684. FILE_UNIX_INFO *pFindData = (FILE_UNIX_INFO *)current_entry;
  685. filename = &pFindData->FileName[0];
  686. if (unicode) {
  687. len = cifs_unicode_bytelen(filename);
  688. } else {
  689. /* BB should we make this strnlen of PATH_MAX? */
  690. len = strnlen(filename, PATH_MAX);
  691. }
  692. /* BB fixme - hash low and high 32 bits if not 64 bit arch BB */
  693. if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM)
  694. *pinum = pFindData->UniqueId;
  695. } else if (level == SMB_FIND_FILE_DIRECTORY_INFO) {
  696. FILE_DIRECTORY_INFO *pFindData =
  697. (FILE_DIRECTORY_INFO *)current_entry;
  698. filename = &pFindData->FileName[0];
  699. len = le32_to_cpu(pFindData->FileNameLength);
  700. } else if (level == SMB_FIND_FILE_FULL_DIRECTORY_INFO) {
  701. FILE_FULL_DIRECTORY_INFO *pFindData =
  702. (FILE_FULL_DIRECTORY_INFO *)current_entry;
  703. filename = &pFindData->FileName[0];
  704. len = le32_to_cpu(pFindData->FileNameLength);
  705. } else if (level == SMB_FIND_FILE_ID_FULL_DIR_INFO) {
  706. SEARCH_ID_FULL_DIR_INFO *pFindData =
  707. (SEARCH_ID_FULL_DIR_INFO *)current_entry;
  708. filename = &pFindData->FileName[0];
  709. len = le32_to_cpu(pFindData->FileNameLength);
  710. *pinum = pFindData->UniqueId;
  711. } else if (level == SMB_FIND_FILE_BOTH_DIRECTORY_INFO) {
  712. FILE_BOTH_DIRECTORY_INFO *pFindData =
  713. (FILE_BOTH_DIRECTORY_INFO *)current_entry;
  714. filename = &pFindData->FileName[0];
  715. len = le32_to_cpu(pFindData->FileNameLength);
  716. } else if (level == SMB_FIND_FILE_INFO_STANDARD) {
  717. FIND_FILE_STANDARD_INFO *pFindData =
  718. (FIND_FILE_STANDARD_INFO *)current_entry;
  719. filename = &pFindData->FileName[0];
  720. /* one byte length, no name conversion */
  721. len = (unsigned int)pFindData->FileNameLength;
  722. } else {
  723. cFYI(1, ("Unknown findfirst level %d", level));
  724. return -EINVAL;
  725. }
  726. if (len > max_len) {
  727. cERROR(1, ("bad search response length %d past smb end", len));
  728. return -EINVAL;
  729. }
  730. if (unicode) {
  731. /* BB fixme - test with long names */
  732. /* Note converted filename can be longer than in unicode */
  733. if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_MAP_SPECIAL_CHR)
  734. pqst->len = cifs_convertUCSpath((char *)pqst->name,
  735. (__le16 *)filename, len/2, nlt);
  736. else
  737. pqst->len = cifs_strfromUCS_le((char *)pqst->name,
  738. (__le16 *)filename, len/2, nlt);
  739. } else {
  740. pqst->name = filename;
  741. pqst->len = len;
  742. }
  743. pqst->hash = full_name_hash(pqst->name, pqst->len);
  744. /* cFYI(1, ("filldir on %s",pqst->name)); */
  745. return rc;
  746. }
  747. static int cifs_filldir(char *pfindEntry, struct file *file,
  748. filldir_t filldir, void *direntry, char *scratch_buf, int max_len)
  749. {
  750. int rc = 0;
  751. struct qstr qstring;
  752. struct cifsFileInfo *pCifsF;
  753. unsigned int obj_type;
  754. ino_t inum;
  755. struct cifs_sb_info *cifs_sb;
  756. struct inode *tmp_inode;
  757. struct dentry *tmp_dentry;
  758. /* get filename and len into qstring */
  759. /* get dentry */
  760. /* decide whether to create and populate ionde */
  761. if ((direntry == NULL) || (file == NULL))
  762. return -EINVAL;
  763. pCifsF = file->private_data;
  764. if ((scratch_buf == NULL) || (pfindEntry == NULL) || (pCifsF == NULL))
  765. return -ENOENT;
  766. rc = cifs_entry_is_dot(pfindEntry, pCifsF);
  767. /* skip . and .. since we added them first */
  768. if (rc != 0)
  769. return 0;
  770. cifs_sb = CIFS_SB(file->f_path.dentry->d_sb);
  771. qstring.name = scratch_buf;
  772. rc = cifs_get_name_from_search_buf(&qstring, pfindEntry,
  773. pCifsF->srch_inf.info_level,
  774. pCifsF->srch_inf.unicode, cifs_sb,
  775. max_len,
  776. &inum /* returned */);
  777. if (rc)
  778. return rc;
  779. rc = construct_dentry(&qstring, file, &tmp_inode, &tmp_dentry);
  780. if ((tmp_inode == NULL) || (tmp_dentry == NULL))
  781. return -ENOMEM;
  782. if (rc) {
  783. /* inode created, we need to hash it with right inode number */
  784. if (inum != 0) {
  785. /* BB fixme - hash the 2 32 quantities bits together if
  786. * necessary BB */
  787. tmp_inode->i_ino = inum;
  788. }
  789. insert_inode_hash(tmp_inode);
  790. }
  791. /* we pass in rc below, indicating whether it is a new inode,
  792. so we can figure out whether to invalidate the inode cached
  793. data if the file has changed */
  794. if (pCifsF->srch_inf.info_level == SMB_FIND_FILE_UNIX)
  795. unix_fill_in_inode(tmp_inode,
  796. (FILE_UNIX_INFO *)pfindEntry,
  797. &obj_type, rc);
  798. else if (pCifsF->srch_inf.info_level == SMB_FIND_FILE_INFO_STANDARD)
  799. fill_in_inode(tmp_inode, 0 /* old level 1 buffer type */,
  800. pfindEntry, &obj_type, rc);
  801. else
  802. fill_in_inode(tmp_inode, 1 /* NT */, pfindEntry, &obj_type, rc);
  803. if (rc) /* new inode - needs to be tied to dentry */ {
  804. d_instantiate(tmp_dentry, tmp_inode);
  805. if (rc == 2)
  806. d_rehash(tmp_dentry);
  807. }
  808. rc = filldir(direntry, qstring.name, qstring.len, file->f_pos,
  809. tmp_inode->i_ino, obj_type);
  810. if (rc) {
  811. cFYI(1, ("filldir rc = %d", rc));
  812. /* we can not return filldir errors to the caller
  813. since they are "normal" when the stat blocksize
  814. is too small - we return remapped error instead */
  815. rc = -EOVERFLOW;
  816. }
  817. dput(tmp_dentry);
  818. return rc;
  819. }
  820. static int cifs_save_resume_key(const char *current_entry,
  821. struct cifsFileInfo *cifsFile)
  822. {
  823. int rc = 0;
  824. unsigned int len = 0;
  825. __u16 level;
  826. char *filename;
  827. if ((cifsFile == NULL) || (current_entry == NULL))
  828. return -EINVAL;
  829. level = cifsFile->srch_inf.info_level;
  830. if (level == SMB_FIND_FILE_UNIX) {
  831. FILE_UNIX_INFO *pFindData = (FILE_UNIX_INFO *)current_entry;
  832. filename = &pFindData->FileName[0];
  833. if (cifsFile->srch_inf.unicode) {
  834. len = cifs_unicode_bytelen(filename);
  835. } else {
  836. /* BB should we make this strnlen of PATH_MAX? */
  837. len = strnlen(filename, PATH_MAX);
  838. }
  839. cifsFile->srch_inf.resume_key = pFindData->ResumeKey;
  840. } else if (level == SMB_FIND_FILE_DIRECTORY_INFO) {
  841. FILE_DIRECTORY_INFO *pFindData =
  842. (FILE_DIRECTORY_INFO *)current_entry;
  843. filename = &pFindData->FileName[0];
  844. len = le32_to_cpu(pFindData->FileNameLength);
  845. cifsFile->srch_inf.resume_key = pFindData->FileIndex;
  846. } else if (level == SMB_FIND_FILE_FULL_DIRECTORY_INFO) {
  847. FILE_FULL_DIRECTORY_INFO *pFindData =
  848. (FILE_FULL_DIRECTORY_INFO *)current_entry;
  849. filename = &pFindData->FileName[0];
  850. len = le32_to_cpu(pFindData->FileNameLength);
  851. cifsFile->srch_inf.resume_key = pFindData->FileIndex;
  852. } else if (level == SMB_FIND_FILE_ID_FULL_DIR_INFO) {
  853. SEARCH_ID_FULL_DIR_INFO *pFindData =
  854. (SEARCH_ID_FULL_DIR_INFO *)current_entry;
  855. filename = &pFindData->FileName[0];
  856. len = le32_to_cpu(pFindData->FileNameLength);
  857. cifsFile->srch_inf.resume_key = pFindData->FileIndex;
  858. } else if (level == SMB_FIND_FILE_BOTH_DIRECTORY_INFO) {
  859. FILE_BOTH_DIRECTORY_INFO *pFindData =
  860. (FILE_BOTH_DIRECTORY_INFO *)current_entry;
  861. filename = &pFindData->FileName[0];
  862. len = le32_to_cpu(pFindData->FileNameLength);
  863. cifsFile->srch_inf.resume_key = pFindData->FileIndex;
  864. } else if (level == SMB_FIND_FILE_INFO_STANDARD) {
  865. FIND_FILE_STANDARD_INFO *pFindData =
  866. (FIND_FILE_STANDARD_INFO *)current_entry;
  867. filename = &pFindData->FileName[0];
  868. /* one byte length, no name conversion */
  869. len = (unsigned int)pFindData->FileNameLength;
  870. cifsFile->srch_inf.resume_key = pFindData->ResumeKey;
  871. } else {
  872. cFYI(1, ("Unknown findfirst level %d", level));
  873. return -EINVAL;
  874. }
  875. cifsFile->srch_inf.resume_name_len = len;
  876. cifsFile->srch_inf.presume_name = filename;
  877. return rc;
  878. }
  879. int cifs_readdir(struct file *file, void *direntry, filldir_t filldir)
  880. {
  881. int rc = 0;
  882. int xid, i;
  883. struct cifs_sb_info *cifs_sb;
  884. struct cifsTconInfo *pTcon;
  885. struct cifsFileInfo *cifsFile = NULL;
  886. char *current_entry;
  887. int num_to_fill = 0;
  888. char *tmp_buf = NULL;
  889. char *end_of_smb;
  890. int max_len;
  891. xid = GetXid();
  892. cifs_sb = CIFS_SB(file->f_path.dentry->d_sb);
  893. pTcon = cifs_sb->tcon;
  894. if (pTcon == NULL)
  895. return -EINVAL;
  896. switch ((int) file->f_pos) {
  897. case 0:
  898. if (filldir(direntry, ".", 1, file->f_pos,
  899. file->f_path.dentry->d_inode->i_ino, DT_DIR) < 0) {
  900. cERROR(1, ("Filldir for current dir failed"));
  901. rc = -ENOMEM;
  902. break;
  903. }
  904. file->f_pos++;
  905. case 1:
  906. if (filldir(direntry, "..", 2, file->f_pos,
  907. file->f_path.dentry->d_parent->d_inode->i_ino, DT_DIR) < 0) {
  908. cERROR(1, ("Filldir for parent dir failed"));
  909. rc = -ENOMEM;
  910. break;
  911. }
  912. file->f_pos++;
  913. default:
  914. /* 1) If search is active,
  915. is in current search buffer?
  916. if it before then restart search
  917. if after then keep searching till find it */
  918. if (file->private_data == NULL) {
  919. rc = initiate_cifs_search(xid, file);
  920. cFYI(1, ("initiate cifs search rc %d", rc));
  921. if (rc) {
  922. FreeXid(xid);
  923. return rc;
  924. }
  925. }
  926. if (file->private_data == NULL) {
  927. rc = -EINVAL;
  928. FreeXid(xid);
  929. return rc;
  930. }
  931. cifsFile = file->private_data;
  932. if (cifsFile->srch_inf.endOfSearch) {
  933. if (cifsFile->srch_inf.emptyDir) {
  934. cFYI(1, ("End of search, empty dir"));
  935. rc = 0;
  936. break;
  937. }
  938. } /* else {
  939. cifsFile->invalidHandle = true;
  940. CIFSFindClose(xid, pTcon, cifsFile->netfid);
  941. } */
  942. rc = find_cifs_entry(xid, pTcon, file,
  943. &current_entry, &num_to_fill);
  944. if (rc) {
  945. cFYI(1, ("fce error %d", rc));
  946. goto rddir2_exit;
  947. } else if (current_entry != NULL) {
  948. cFYI(1, ("entry %lld found", file->f_pos));
  949. } else {
  950. cFYI(1, ("could not find entry"));
  951. goto rddir2_exit;
  952. }
  953. cFYI(1, ("loop through %d times filling dir for net buf %p",
  954. num_to_fill, cifsFile->srch_inf.ntwrk_buf_start));
  955. max_len = smbCalcSize((struct smb_hdr *)
  956. cifsFile->srch_inf.ntwrk_buf_start);
  957. end_of_smb = cifsFile->srch_inf.ntwrk_buf_start + max_len;
  958. /* To be safe - for UCS to UTF-8 with strings loaded
  959. with the rare long characters alloc more to account for
  960. such multibyte target UTF-8 characters. cifs_unicode.c,
  961. which actually does the conversion, has the same limit */
  962. tmp_buf = kmalloc((2 * NAME_MAX) + 4, GFP_KERNEL);
  963. for (i = 0; (i < num_to_fill) && (rc == 0); i++) {
  964. if (current_entry == NULL) {
  965. /* evaluate whether this case is an error */
  966. cERROR(1, ("past SMB end, num to fill %d i %d",
  967. num_to_fill, i));
  968. break;
  969. }
  970. /* if buggy server returns . and .. late do
  971. we want to check for that here? */
  972. rc = cifs_filldir(current_entry, file,
  973. filldir, direntry, tmp_buf, max_len);
  974. if (rc == -EOVERFLOW) {
  975. rc = 0;
  976. break;
  977. }
  978. file->f_pos++;
  979. if (file->f_pos ==
  980. cifsFile->srch_inf.index_of_last_entry) {
  981. cFYI(1, ("last entry in buf at pos %lld %s",
  982. file->f_pos, tmp_buf));
  983. cifs_save_resume_key(current_entry, cifsFile);
  984. break;
  985. } else
  986. current_entry =
  987. nxt_dir_entry(current_entry, end_of_smb,
  988. cifsFile->srch_inf.info_level);
  989. }
  990. kfree(tmp_buf);
  991. break;
  992. } /* end switch */
  993. rddir2_exit:
  994. FreeXid(xid);
  995. return rc;
  996. }