readdir.c 34 KB

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