readdir.c 28 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919
  1. /*
  2. * fs/cifs/readdir.c
  3. *
  4. * Directory search handling
  5. *
  6. * Copyright (C) International Business Machines Corp., 2004, 2005
  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/stat.h>
  25. #include <linux/smp_lock.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. /* BB fixme - add debug wrappers around this function to disable it fixme BB */
  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. }
  46. if(cf->srch_inf.endOfSearch) {
  47. cFYI(1,("end of search"));
  48. }
  49. if(cf->srch_inf.emptyDir) {
  50. cFYI(1,("empty dir"));
  51. }
  52. }
  53. } */
  54. /* Returns one if new inode created (which therefore needs to be hashed) */
  55. /* Might check in the future if inode number changed so we can rehash inode */
  56. static int construct_dentry(struct qstr *qstring, struct file *file,
  57. struct inode **ptmp_inode, struct dentry **pnew_dentry)
  58. {
  59. struct dentry *tmp_dentry;
  60. struct cifs_sb_info *cifs_sb;
  61. struct cifsTconInfo *pTcon;
  62. int rc = 0;
  63. cFYI(1, ("For %s", qstring->name));
  64. cifs_sb = CIFS_SB(file->f_dentry->d_sb);
  65. pTcon = cifs_sb->tcon;
  66. qstring->hash = full_name_hash(qstring->name, qstring->len);
  67. tmp_dentry = d_lookup(file->f_dentry, qstring);
  68. if (tmp_dentry) {
  69. cFYI(0, ("existing dentry with inode 0x%p", tmp_dentry->d_inode));
  70. *ptmp_inode = tmp_dentry->d_inode;
  71. /* BB overwrite old name? i.e. tmp_dentry->d_name and tmp_dentry->d_name.len??*/
  72. if(*ptmp_inode == NULL) {
  73. *ptmp_inode = new_inode(file->f_dentry->d_sb);
  74. if(*ptmp_inode == NULL)
  75. return rc;
  76. rc = 1;
  77. d_instantiate(tmp_dentry, *ptmp_inode);
  78. }
  79. } else {
  80. tmp_dentry = d_alloc(file->f_dentry, qstring);
  81. if(tmp_dentry == NULL) {
  82. cERROR(1,("Failed allocating dentry"));
  83. *ptmp_inode = NULL;
  84. return rc;
  85. }
  86. *ptmp_inode = new_inode(file->f_dentry->d_sb);
  87. tmp_dentry->d_op = &cifs_dentry_ops;
  88. if(*ptmp_inode == NULL)
  89. return rc;
  90. rc = 1;
  91. d_instantiate(tmp_dentry, *ptmp_inode);
  92. d_rehash(tmp_dentry);
  93. }
  94. tmp_dentry->d_time = jiffies;
  95. *pnew_dentry = tmp_dentry;
  96. return rc;
  97. }
  98. static void fill_in_inode(struct inode *tmp_inode,
  99. FILE_DIRECTORY_INFO *pfindData, int *pobject_type, int isNewInode)
  100. {
  101. loff_t local_size;
  102. struct timespec local_mtime;
  103. struct cifsInodeInfo *cifsInfo = CIFS_I(tmp_inode);
  104. struct cifs_sb_info *cifs_sb = CIFS_SB(tmp_inode->i_sb);
  105. __u32 attr = le32_to_cpu(pfindData->ExtFileAttributes);
  106. __u64 allocation_size = le64_to_cpu(pfindData->AllocationSize);
  107. __u64 end_of_file = le64_to_cpu(pfindData->EndOfFile);
  108. cifsInfo->cifsAttrs = attr;
  109. cifsInfo->time = jiffies;
  110. /* save mtime and size */
  111. local_mtime = tmp_inode->i_mtime;
  112. local_size = tmp_inode->i_size;
  113. /* Linux can not store file creation time unfortunately so ignore it */
  114. tmp_inode->i_atime =
  115. cifs_NTtimeToUnix(le64_to_cpu(pfindData->LastAccessTime));
  116. tmp_inode->i_mtime =
  117. cifs_NTtimeToUnix(le64_to_cpu(pfindData->LastWriteTime));
  118. tmp_inode->i_ctime =
  119. cifs_NTtimeToUnix(le64_to_cpu(pfindData->ChangeTime));
  120. /* treat dos attribute of read-only as read-only mode bit e.g. 555? */
  121. /* 2767 perms - indicate mandatory locking */
  122. /* BB fill in uid and gid here? with help from winbind?
  123. or retrieve from NTFS stream extended attribute */
  124. if (atomic_read(&cifsInfo->inUse) == 0) {
  125. tmp_inode->i_uid = cifs_sb->mnt_uid;
  126. tmp_inode->i_gid = cifs_sb->mnt_gid;
  127. /* set default mode. will override for dirs below */
  128. tmp_inode->i_mode = cifs_sb->mnt_file_mode;
  129. }
  130. if (attr & ATTR_DIRECTORY) {
  131. *pobject_type = DT_DIR;
  132. /* override default perms since we do not lock dirs */
  133. if(atomic_read(&cifsInfo->inUse) == 0) {
  134. tmp_inode->i_mode = cifs_sb->mnt_dir_mode;
  135. }
  136. tmp_inode->i_mode |= S_IFDIR;
  137. /* we no longer mark these because we could not follow them */
  138. /* } else if (attr & ATTR_REPARSE) {
  139. *pobject_type = DT_LNK;
  140. tmp_inode->i_mode |= S_IFLNK; */
  141. } else {
  142. *pobject_type = DT_REG;
  143. tmp_inode->i_mode |= S_IFREG;
  144. if (attr & ATTR_READONLY)
  145. tmp_inode->i_mode &= ~(S_IWUGO);
  146. } /* could add code here - to validate if device or weird share type? */
  147. /* can not fill in nlink here as in qpathinfo version and Unx search */
  148. if (atomic_read(&cifsInfo->inUse) == 0) {
  149. atomic_set(&cifsInfo->inUse, 1);
  150. }
  151. if (is_size_safe_to_change(cifsInfo)) {
  152. /* can not safely change the file size here if the
  153. client is writing to it due to potential races */
  154. i_size_write(tmp_inode, end_of_file);
  155. /* 512 bytes (2**9) is the fake blocksize that must be used */
  156. /* for this calculation, even though the reported blocksize is larger */
  157. tmp_inode->i_blocks = (512 - 1 + allocation_size) >> 9;
  158. }
  159. if (allocation_size < end_of_file)
  160. cFYI(1, ("May be sparse file, allocation less than file size"));
  161. cFYI(1,
  162. ("File Size %ld and blocks %ld and blocksize %ld",
  163. (unsigned long)tmp_inode->i_size, tmp_inode->i_blocks,
  164. tmp_inode->i_blksize));
  165. if (S_ISREG(tmp_inode->i_mode)) {
  166. cFYI(1, ("File inode"));
  167. tmp_inode->i_op = &cifs_file_inode_ops;
  168. if(cifs_sb->mnt_cifs_flags & CIFS_MOUNT_DIRECT_IO)
  169. tmp_inode->i_fop = &cifs_file_direct_ops;
  170. else
  171. tmp_inode->i_fop = &cifs_file_ops;
  172. tmp_inode->i_data.a_ops = &cifs_addr_ops;
  173. if(isNewInode)
  174. return; /* No sense invalidating pages for new inode since we
  175. have not started caching readahead file data yet */
  176. if (timespec_equal(&tmp_inode->i_mtime, &local_mtime) &&
  177. (local_size == tmp_inode->i_size)) {
  178. cFYI(1, ("inode exists but unchanged"));
  179. } else {
  180. /* file may have changed on server */
  181. cFYI(1, ("invalidate inode, readdir detected change"));
  182. invalidate_remote_inode(tmp_inode);
  183. }
  184. } else if (S_ISDIR(tmp_inode->i_mode)) {
  185. cFYI(1, ("Directory inode"));
  186. tmp_inode->i_op = &cifs_dir_inode_ops;
  187. tmp_inode->i_fop = &cifs_dir_ops;
  188. } else if (S_ISLNK(tmp_inode->i_mode)) {
  189. cFYI(1, ("Symbolic Link inode"));
  190. tmp_inode->i_op = &cifs_symlink_inode_ops;
  191. } else {
  192. cFYI(1, ("Init special inode"));
  193. init_special_inode(tmp_inode, tmp_inode->i_mode,
  194. tmp_inode->i_rdev);
  195. }
  196. }
  197. static void unix_fill_in_inode(struct inode *tmp_inode,
  198. FILE_UNIX_INFO *pfindData, int *pobject_type, int isNewInode)
  199. {
  200. loff_t local_size;
  201. struct timespec local_mtime;
  202. struct cifsInodeInfo *cifsInfo = CIFS_I(tmp_inode);
  203. struct cifs_sb_info *cifs_sb = CIFS_SB(tmp_inode->i_sb);
  204. __u32 type = le32_to_cpu(pfindData->Type);
  205. __u64 num_of_bytes = le64_to_cpu(pfindData->NumOfBytes);
  206. __u64 end_of_file = le64_to_cpu(pfindData->EndOfFile);
  207. cifsInfo->time = jiffies;
  208. atomic_inc(&cifsInfo->inUse);
  209. /* save mtime and size */
  210. local_mtime = tmp_inode->i_mtime;
  211. local_size = tmp_inode->i_size;
  212. tmp_inode->i_atime =
  213. cifs_NTtimeToUnix(le64_to_cpu(pfindData->LastAccessTime));
  214. tmp_inode->i_mtime =
  215. cifs_NTtimeToUnix(le64_to_cpu(pfindData->LastModificationTime));
  216. tmp_inode->i_ctime =
  217. cifs_NTtimeToUnix(le64_to_cpu(pfindData->LastStatusChange));
  218. tmp_inode->i_mode = le64_to_cpu(pfindData->Permissions);
  219. if (type == UNIX_FILE) {
  220. *pobject_type = DT_REG;
  221. tmp_inode->i_mode |= S_IFREG;
  222. } else if (type == UNIX_SYMLINK) {
  223. *pobject_type = DT_LNK;
  224. tmp_inode->i_mode |= S_IFLNK;
  225. } else if (type == UNIX_DIR) {
  226. *pobject_type = DT_DIR;
  227. tmp_inode->i_mode |= S_IFDIR;
  228. } else if (type == UNIX_CHARDEV) {
  229. *pobject_type = DT_CHR;
  230. tmp_inode->i_mode |= S_IFCHR;
  231. tmp_inode->i_rdev = MKDEV(le64_to_cpu(pfindData->DevMajor),
  232. le64_to_cpu(pfindData->DevMinor) & MINORMASK);
  233. } else if (type == UNIX_BLOCKDEV) {
  234. *pobject_type = DT_BLK;
  235. tmp_inode->i_mode |= S_IFBLK;
  236. tmp_inode->i_rdev = MKDEV(le64_to_cpu(pfindData->DevMajor),
  237. le64_to_cpu(pfindData->DevMinor) & MINORMASK);
  238. } else if (type == UNIX_FIFO) {
  239. *pobject_type = DT_FIFO;
  240. tmp_inode->i_mode |= S_IFIFO;
  241. } else if (type == UNIX_SOCKET) {
  242. *pobject_type = DT_SOCK;
  243. tmp_inode->i_mode |= S_IFSOCK;
  244. }
  245. tmp_inode->i_uid = le64_to_cpu(pfindData->Uid);
  246. tmp_inode->i_gid = le64_to_cpu(pfindData->Gid);
  247. tmp_inode->i_nlink = le64_to_cpu(pfindData->Nlinks);
  248. if (is_size_safe_to_change(cifsInfo)) {
  249. /* can not safely change the file size here if the
  250. client is writing to it due to potential races */
  251. i_size_write(tmp_inode,end_of_file);
  252. /* 512 bytes (2**9) is the fake blocksize that must be used */
  253. /* for this calculation, not the real blocksize */
  254. tmp_inode->i_blocks = (512 - 1 + num_of_bytes) >> 9;
  255. }
  256. if (S_ISREG(tmp_inode->i_mode)) {
  257. cFYI(1, ("File inode"));
  258. tmp_inode->i_op = &cifs_file_inode_ops;
  259. if(cifs_sb->mnt_cifs_flags & CIFS_MOUNT_DIRECT_IO)
  260. tmp_inode->i_fop = &cifs_file_direct_ops;
  261. else
  262. tmp_inode->i_fop = &cifs_file_ops;
  263. tmp_inode->i_data.a_ops = &cifs_addr_ops;
  264. if(isNewInode)
  265. return; /* No sense invalidating pages for new inode since we
  266. have not started caching readahead file data yet */
  267. if (timespec_equal(&tmp_inode->i_mtime, &local_mtime) &&
  268. (local_size == tmp_inode->i_size)) {
  269. cFYI(1, ("inode exists but unchanged"));
  270. } else {
  271. /* file may have changed on server */
  272. cFYI(1, ("invalidate inode, readdir detected change"));
  273. invalidate_remote_inode(tmp_inode);
  274. }
  275. } else if (S_ISDIR(tmp_inode->i_mode)) {
  276. cFYI(1, ("Directory inode"));
  277. tmp_inode->i_op = &cifs_dir_inode_ops;
  278. tmp_inode->i_fop = &cifs_dir_ops;
  279. } else if (S_ISLNK(tmp_inode->i_mode)) {
  280. cFYI(1, ("Symbolic Link inode"));
  281. tmp_inode->i_op = &cifs_symlink_inode_ops;
  282. /* tmp_inode->i_fop = *//* do not need to set to anything */
  283. } else {
  284. cFYI(1, ("Special inode"));
  285. init_special_inode(tmp_inode, tmp_inode->i_mode,
  286. tmp_inode->i_rdev);
  287. }
  288. }
  289. static int initiate_cifs_search(const int xid, struct file *file)
  290. {
  291. int rc = 0;
  292. char * full_path;
  293. struct cifsFileInfo * cifsFile;
  294. struct cifs_sb_info *cifs_sb;
  295. struct cifsTconInfo *pTcon;
  296. if(file->private_data == NULL) {
  297. file->private_data =
  298. kmalloc(sizeof(struct cifsFileInfo),GFP_KERNEL);
  299. }
  300. if(file->private_data == NULL) {
  301. return -ENOMEM;
  302. } else {
  303. memset(file->private_data,0,sizeof(struct cifsFileInfo));
  304. }
  305. cifsFile = file->private_data;
  306. cifsFile->invalidHandle = TRUE;
  307. cifsFile->srch_inf.endOfSearch = FALSE;
  308. if(file->f_dentry == NULL)
  309. return -ENOENT;
  310. cifs_sb = CIFS_SB(file->f_dentry->d_sb);
  311. if(cifs_sb == NULL)
  312. return -EINVAL;
  313. pTcon = cifs_sb->tcon;
  314. if(pTcon == NULL)
  315. return -EINVAL;
  316. down(&file->f_dentry->d_sb->s_vfs_rename_sem);
  317. full_path = build_path_from_dentry(file->f_dentry);
  318. up(&file->f_dentry->d_sb->s_vfs_rename_sem);
  319. if(full_path == NULL) {
  320. return -ENOMEM;
  321. }
  322. cFYI(1, ("Full path: %s start at: %lld", full_path, file->f_pos));
  323. ffirst_retry:
  324. /* test for Unix extensions */
  325. if (pTcon->ses->capabilities & CAP_UNIX) {
  326. cifsFile->srch_inf.info_level = SMB_FIND_FILE_UNIX;
  327. } else if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM) {
  328. cifsFile->srch_inf.info_level = SMB_FIND_FILE_ID_FULL_DIR_INFO;
  329. } else /* not srvinos - BB fixme add check for backlevel? */ {
  330. cifsFile->srch_inf.info_level = SMB_FIND_FILE_DIRECTORY_INFO;
  331. }
  332. rc = CIFSFindFirst(xid, pTcon,full_path,cifs_sb->local_nls,
  333. &cifsFile->netfid, &cifsFile->srch_inf,
  334. cifs_sb->mnt_cifs_flags & CIFS_MOUNT_MAP_SPECIAL_CHR);
  335. if(rc == 0)
  336. cifsFile->invalidHandle = FALSE;
  337. if((rc == -EOPNOTSUPP) &&
  338. (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM)) {
  339. cifs_sb->mnt_cifs_flags &= ~CIFS_MOUNT_SERVER_INUM;
  340. goto ffirst_retry;
  341. }
  342. kfree(full_path);
  343. return rc;
  344. }
  345. /* return length of unicode string in bytes */
  346. static int cifs_unicode_bytelen(char *str)
  347. {
  348. int len;
  349. __le16 * ustr = (__le16 *)str;
  350. for(len=0;len <= PATH_MAX;len++) {
  351. if(ustr[len] == 0)
  352. return len << 1;
  353. }
  354. cFYI(1,("Unicode string longer than PATH_MAX found"));
  355. return len << 1;
  356. }
  357. static char *nxt_dir_entry(char *old_entry, char *end_of_smb)
  358. {
  359. char * new_entry;
  360. FILE_DIRECTORY_INFO * pDirInfo = (FILE_DIRECTORY_INFO *)old_entry;
  361. new_entry = old_entry + le32_to_cpu(pDirInfo->NextEntryOffset);
  362. cFYI(1,("new entry %p old entry %p",new_entry,old_entry));
  363. /* validate that new_entry is not past end of SMB */
  364. if(new_entry >= end_of_smb) {
  365. cERROR(1,
  366. ("search entry %p began after end of SMB %p old entry %p",
  367. new_entry, end_of_smb, old_entry));
  368. return NULL;
  369. } else if (new_entry + sizeof(FILE_DIRECTORY_INFO) > end_of_smb) {
  370. cERROR(1,("search entry %p extends after end of SMB %p",
  371. new_entry, end_of_smb));
  372. return NULL;
  373. } else
  374. return new_entry;
  375. }
  376. #define UNICODE_DOT cpu_to_le16(0x2e)
  377. /* return 0 if no match and 1 for . (current directory) and 2 for .. (parent) */
  378. static int cifs_entry_is_dot(char *current_entry, struct cifsFileInfo *cfile)
  379. {
  380. int rc = 0;
  381. char * filename = NULL;
  382. int len = 0;
  383. if(cfile->srch_inf.info_level == 0x202) {
  384. FILE_UNIX_INFO * pFindData = (FILE_UNIX_INFO *)current_entry;
  385. filename = &pFindData->FileName[0];
  386. if(cfile->srch_inf.unicode) {
  387. len = cifs_unicode_bytelen(filename);
  388. } else {
  389. /* BB should we make this strnlen of PATH_MAX? */
  390. len = strnlen(filename, 5);
  391. }
  392. } else if(cfile->srch_inf.info_level == 0x101) {
  393. FILE_DIRECTORY_INFO * pFindData =
  394. (FILE_DIRECTORY_INFO *)current_entry;
  395. filename = &pFindData->FileName[0];
  396. len = le32_to_cpu(pFindData->FileNameLength);
  397. } else if(cfile->srch_inf.info_level == 0x102) {
  398. FILE_FULL_DIRECTORY_INFO * pFindData =
  399. (FILE_FULL_DIRECTORY_INFO *)current_entry;
  400. filename = &pFindData->FileName[0];
  401. len = le32_to_cpu(pFindData->FileNameLength);
  402. } else if(cfile->srch_inf.info_level == 0x105) {
  403. SEARCH_ID_FULL_DIR_INFO * pFindData =
  404. (SEARCH_ID_FULL_DIR_INFO *)current_entry;
  405. filename = &pFindData->FileName[0];
  406. len = le32_to_cpu(pFindData->FileNameLength);
  407. } else if(cfile->srch_inf.info_level == 0x104) {
  408. FILE_BOTH_DIRECTORY_INFO * pFindData =
  409. (FILE_BOTH_DIRECTORY_INFO *)current_entry;
  410. filename = &pFindData->FileName[0];
  411. len = le32_to_cpu(pFindData->FileNameLength);
  412. } else {
  413. cFYI(1,("Unknown findfirst level %d",cfile->srch_inf.info_level));
  414. }
  415. if(filename) {
  416. if(cfile->srch_inf.unicode) {
  417. __le16 *ufilename = (__le16 *)filename;
  418. if(len == 2) {
  419. /* check for . */
  420. if(ufilename[0] == UNICODE_DOT)
  421. rc = 1;
  422. } else if(len == 4) {
  423. /* check for .. */
  424. if((ufilename[0] == UNICODE_DOT)
  425. &&(ufilename[1] == UNICODE_DOT))
  426. rc = 2;
  427. }
  428. } else /* ASCII */ {
  429. if(len == 1) {
  430. if(filename[0] == '.')
  431. rc = 1;
  432. } else if(len == 2) {
  433. if((filename[0] == '.') && (filename[1] == '.'))
  434. rc = 2;
  435. }
  436. }
  437. }
  438. return rc;
  439. }
  440. /* find the corresponding entry in the search */
  441. /* Note that the SMB server returns search entries for . and .. which
  442. complicates logic here if we choose to parse for them and we do not
  443. assume that they are located in the findfirst return buffer.*/
  444. /* We start counting in the buffer with entry 2 and increment for every
  445. entry (do not increment for . or .. entry) */
  446. static int find_cifs_entry(const int xid, struct cifsTconInfo *pTcon,
  447. struct file *file, char **ppCurrentEntry, int *num_to_ret)
  448. {
  449. int rc = 0;
  450. int pos_in_buf = 0;
  451. loff_t first_entry_in_buffer;
  452. loff_t index_to_find = file->f_pos;
  453. struct cifsFileInfo * cifsFile = file->private_data;
  454. /* check if index in the buffer */
  455. if((cifsFile == NULL) || (ppCurrentEntry == NULL) || (num_to_ret == NULL))
  456. return -ENOENT;
  457. *ppCurrentEntry = NULL;
  458. first_entry_in_buffer =
  459. cifsFile->srch_inf.index_of_last_entry -
  460. cifsFile->srch_inf.entries_in_buffer;
  461. /* dump_cifs_file_struct(file, "In fce ");*/
  462. if(index_to_find < first_entry_in_buffer) {
  463. /* close and restart search */
  464. cFYI(1,("search backing up - close and restart search"));
  465. cifsFile->invalidHandle = TRUE;
  466. CIFSFindClose(xid, pTcon, cifsFile->netfid);
  467. kfree(cifsFile->search_resume_name);
  468. cifsFile->search_resume_name = NULL;
  469. if(cifsFile->srch_inf.ntwrk_buf_start) {
  470. cFYI(1,("freeing SMB ff cache buf on search rewind"));
  471. cifs_buf_release(cifsFile->srch_inf.ntwrk_buf_start);
  472. }
  473. rc = initiate_cifs_search(xid,file);
  474. if(rc) {
  475. cFYI(1,("error %d reinitiating a search on rewind",rc));
  476. return rc;
  477. }
  478. }
  479. while((index_to_find >= cifsFile->srch_inf.index_of_last_entry) &&
  480. (rc == 0) && (cifsFile->srch_inf.endOfSearch == FALSE)){
  481. cFYI(1,("calling findnext2"));
  482. rc = CIFSFindNext(xid,pTcon,cifsFile->netfid, &cifsFile->srch_inf);
  483. if(rc)
  484. return -ENOENT;
  485. }
  486. if(index_to_find < cifsFile->srch_inf.index_of_last_entry) {
  487. /* we found the buffer that contains the entry */
  488. /* scan and find it */
  489. int i;
  490. char * current_entry;
  491. char * end_of_smb = cifsFile->srch_inf.ntwrk_buf_start +
  492. smbCalcSize((struct smb_hdr *)
  493. cifsFile->srch_inf.ntwrk_buf_start);
  494. /* dump_cifs_file_struct(file,"found entry in fce "); */
  495. first_entry_in_buffer = cifsFile->srch_inf.index_of_last_entry
  496. - cifsFile->srch_inf.entries_in_buffer;
  497. pos_in_buf = index_to_find - first_entry_in_buffer;
  498. cFYI(1,("found entry - pos_in_buf %d",pos_in_buf));
  499. current_entry = cifsFile->srch_inf.srch_entries_start;
  500. for(i=0;(i<(pos_in_buf)) && (current_entry != NULL);i++) {
  501. /* go entry to next entry figuring out which we need to start with */
  502. /* if( . or ..)
  503. skip */
  504. rc = cifs_entry_is_dot(current_entry,cifsFile);
  505. if(rc == 1) /* is . or .. so skip */ {
  506. cFYI(1,("Entry is .")); /* BB removeme BB */
  507. /* continue; */
  508. } else if (rc == 2 ) {
  509. cFYI(1,("Entry is ..")); /* BB removeme BB */
  510. /* continue; */
  511. }
  512. current_entry = nxt_dir_entry(current_entry,end_of_smb);
  513. }
  514. if((current_entry == NULL) && (i < pos_in_buf)) {
  515. /* BB fixme - check if we should flag this error */
  516. cERROR(1,("reached end of buf searching for pos in buf"
  517. " %d index to find %lld rc %d",
  518. pos_in_buf,index_to_find,rc));
  519. }
  520. rc = 0;
  521. *ppCurrentEntry = current_entry;
  522. } else {
  523. cFYI(1,("index not in buffer - could not findnext into it"));
  524. return 0;
  525. }
  526. if(pos_in_buf >= cifsFile->srch_inf.entries_in_buffer) {
  527. cFYI(1,("can not return entries when pos_in_buf beyond last entry"));
  528. *num_to_ret = 0;
  529. } else
  530. *num_to_ret = cifsFile->srch_inf.entries_in_buffer - pos_in_buf;
  531. /* dump_cifs_file_struct(file, "end fce ");*/
  532. return rc;
  533. }
  534. /* inode num, inode type and filename returned */
  535. static int cifs_get_name_from_search_buf(struct qstr *pqst,
  536. char *current_entry, __u16 level, unsigned int unicode,
  537. struct cifs_sb_info * cifs_sb, ino_t *pinum)
  538. {
  539. int rc = 0;
  540. unsigned int len = 0;
  541. char * filename;
  542. struct nls_table * nlt = cifs_sb->local_nls;
  543. *pinum = 0;
  544. if(level == SMB_FIND_FILE_UNIX) {
  545. FILE_UNIX_INFO * pFindData = (FILE_UNIX_INFO *)current_entry;
  546. filename = &pFindData->FileName[0];
  547. if(unicode) {
  548. len = cifs_unicode_bytelen(filename);
  549. } else {
  550. /* BB should we make this strnlen of PATH_MAX? */
  551. len = strnlen(filename, PATH_MAX);
  552. }
  553. /* BB fixme - hash low and high 32 bits if not 64 bit arch BB fixme */
  554. if(cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM)
  555. *pinum = pFindData->UniqueId;
  556. } else if(level == SMB_FIND_FILE_DIRECTORY_INFO) {
  557. FILE_DIRECTORY_INFO * pFindData =
  558. (FILE_DIRECTORY_INFO *)current_entry;
  559. filename = &pFindData->FileName[0];
  560. len = le32_to_cpu(pFindData->FileNameLength);
  561. } else if(level == SMB_FIND_FILE_FULL_DIRECTORY_INFO) {
  562. FILE_FULL_DIRECTORY_INFO * pFindData =
  563. (FILE_FULL_DIRECTORY_INFO *)current_entry;
  564. filename = &pFindData->FileName[0];
  565. len = le32_to_cpu(pFindData->FileNameLength);
  566. } else if(level == SMB_FIND_FILE_ID_FULL_DIR_INFO) {
  567. SEARCH_ID_FULL_DIR_INFO * pFindData =
  568. (SEARCH_ID_FULL_DIR_INFO *)current_entry;
  569. filename = &pFindData->FileName[0];
  570. len = le32_to_cpu(pFindData->FileNameLength);
  571. *pinum = pFindData->UniqueId;
  572. } else if(level == SMB_FIND_FILE_BOTH_DIRECTORY_INFO) {
  573. FILE_BOTH_DIRECTORY_INFO * pFindData =
  574. (FILE_BOTH_DIRECTORY_INFO *)current_entry;
  575. filename = &pFindData->FileName[0];
  576. len = le32_to_cpu(pFindData->FileNameLength);
  577. } else {
  578. cFYI(1,("Unknown findfirst level %d",level));
  579. return -EINVAL;
  580. }
  581. if(unicode) {
  582. /* BB fixme - test with long names */
  583. /* Note converted filename can be longer than in unicode */
  584. if(cifs_sb->mnt_cifs_flags & CIFS_MOUNT_MAP_SPECIAL_CHR)
  585. pqst->len = cifs_convertUCSpath((char *)pqst->name,
  586. (__le16 *)filename, len/2, nlt);
  587. else
  588. pqst->len = cifs_strfromUCS_le((char *)pqst->name,
  589. (wchar_t *)filename,len/2,nlt);
  590. } else {
  591. pqst->name = filename;
  592. pqst->len = len;
  593. }
  594. pqst->hash = full_name_hash(pqst->name,pqst->len);
  595. /* cFYI(1,("filldir on %s",pqst->name)); */
  596. return rc;
  597. }
  598. static int cifs_filldir(char *pfindEntry, struct file *file,
  599. filldir_t filldir, void *direntry, char *scratch_buf)
  600. {
  601. int rc = 0;
  602. struct qstr qstring;
  603. struct cifsFileInfo * pCifsF;
  604. unsigned obj_type;
  605. ino_t inum;
  606. struct cifs_sb_info * cifs_sb;
  607. struct inode *tmp_inode;
  608. struct dentry *tmp_dentry;
  609. /* get filename and len into qstring */
  610. /* get dentry */
  611. /* decide whether to create and populate ionde */
  612. if((direntry == NULL) || (file == NULL))
  613. return -EINVAL;
  614. pCifsF = file->private_data;
  615. if((scratch_buf == NULL) || (pfindEntry == NULL) || (pCifsF == NULL))
  616. return -ENOENT;
  617. if(file->f_dentry == NULL)
  618. return -ENOENT;
  619. cifs_sb = CIFS_SB(file->f_dentry->d_sb);
  620. qstring.name = scratch_buf;
  621. rc = cifs_get_name_from_search_buf(&qstring,pfindEntry,
  622. pCifsF->srch_inf.info_level,
  623. pCifsF->srch_inf.unicode,cifs_sb,
  624. &inum /* returned */);
  625. if(rc)
  626. return rc;
  627. rc = construct_dentry(&qstring,file,&tmp_inode, &tmp_dentry);
  628. if((tmp_inode == NULL) || (tmp_dentry == NULL))
  629. return -ENOMEM;
  630. if(rc) {
  631. /* inode created, we need to hash it with right inode number */
  632. if(inum != 0) {
  633. /* BB fixme - hash the 2 32 quantities bits together if necessary BB */
  634. tmp_inode->i_ino = inum;
  635. }
  636. insert_inode_hash(tmp_inode);
  637. }
  638. /* we pass in rc below, indicating whether it is a new inode,
  639. so we can figure out whether to invalidate the inode cached
  640. data if the file has changed */
  641. if(pCifsF->srch_inf.info_level == SMB_FIND_FILE_UNIX) {
  642. unix_fill_in_inode(tmp_inode,
  643. (FILE_UNIX_INFO *)pfindEntry,&obj_type, rc);
  644. } else {
  645. fill_in_inode(tmp_inode,
  646. (FILE_DIRECTORY_INFO *)pfindEntry,&obj_type, rc);
  647. }
  648. rc = filldir(direntry,qstring.name,qstring.len,file->f_pos,tmp_inode->i_ino,obj_type);
  649. if(rc) {
  650. cFYI(1,("filldir rc = %d",rc));
  651. }
  652. dput(tmp_dentry);
  653. return rc;
  654. }
  655. static int cifs_save_resume_key(const char *current_entry,
  656. struct cifsFileInfo *cifsFile)
  657. {
  658. int rc = 0;
  659. unsigned int len = 0;
  660. __u16 level;
  661. char * filename;
  662. if((cifsFile == NULL) || (current_entry == NULL))
  663. return -EINVAL;
  664. level = cifsFile->srch_inf.info_level;
  665. if(level == SMB_FIND_FILE_UNIX) {
  666. FILE_UNIX_INFO * pFindData = (FILE_UNIX_INFO *)current_entry;
  667. filename = &pFindData->FileName[0];
  668. if(cifsFile->srch_inf.unicode) {
  669. len = cifs_unicode_bytelen(filename);
  670. } else {
  671. /* BB should we make this strnlen of PATH_MAX? */
  672. len = strnlen(filename, PATH_MAX);
  673. }
  674. cifsFile->srch_inf.resume_key = pFindData->ResumeKey;
  675. } else if(level == SMB_FIND_FILE_DIRECTORY_INFO) {
  676. FILE_DIRECTORY_INFO * pFindData =
  677. (FILE_DIRECTORY_INFO *)current_entry;
  678. filename = &pFindData->FileName[0];
  679. len = le32_to_cpu(pFindData->FileNameLength);
  680. cifsFile->srch_inf.resume_key = pFindData->FileIndex;
  681. } else if(level == SMB_FIND_FILE_FULL_DIRECTORY_INFO) {
  682. FILE_FULL_DIRECTORY_INFO * pFindData =
  683. (FILE_FULL_DIRECTORY_INFO *)current_entry;
  684. filename = &pFindData->FileName[0];
  685. len = le32_to_cpu(pFindData->FileNameLength);
  686. cifsFile->srch_inf.resume_key = pFindData->FileIndex;
  687. } else if(level == SMB_FIND_FILE_ID_FULL_DIR_INFO) {
  688. SEARCH_ID_FULL_DIR_INFO * pFindData =
  689. (SEARCH_ID_FULL_DIR_INFO *)current_entry;
  690. filename = &pFindData->FileName[0];
  691. len = le32_to_cpu(pFindData->FileNameLength);
  692. cifsFile->srch_inf.resume_key = pFindData->FileIndex;
  693. } else if(level == SMB_FIND_FILE_BOTH_DIRECTORY_INFO) {
  694. FILE_BOTH_DIRECTORY_INFO * pFindData =
  695. (FILE_BOTH_DIRECTORY_INFO *)current_entry;
  696. filename = &pFindData->FileName[0];
  697. len = le32_to_cpu(pFindData->FileNameLength);
  698. cifsFile->srch_inf.resume_key = pFindData->FileIndex;
  699. } else {
  700. cFYI(1,("Unknown findfirst level %d",level));
  701. return -EINVAL;
  702. }
  703. cifsFile->srch_inf.resume_name_len = len;
  704. cifsFile->srch_inf.presume_name = filename;
  705. return rc;
  706. }
  707. int cifs_readdir(struct file *file, void *direntry, filldir_t filldir)
  708. {
  709. int rc = 0;
  710. int xid,i;
  711. struct cifs_sb_info *cifs_sb;
  712. struct cifsTconInfo *pTcon;
  713. struct cifsFileInfo *cifsFile = NULL;
  714. char * current_entry;
  715. int num_to_fill = 0;
  716. char * tmp_buf = NULL;
  717. char * end_of_smb;
  718. xid = GetXid();
  719. if(file->f_dentry == NULL) {
  720. FreeXid(xid);
  721. return -EIO;
  722. }
  723. /* dump_cifs_file_struct(file, "Begin rdir "); */
  724. cifs_sb = CIFS_SB(file->f_dentry->d_sb);
  725. pTcon = cifs_sb->tcon;
  726. if(pTcon == NULL)
  727. return -EINVAL;
  728. /* cFYI(1,("readdir2 pos: %lld",file->f_pos)); */
  729. switch ((int) file->f_pos) {
  730. case 0:
  731. /*if (filldir(direntry, ".", 1, file->f_pos,
  732. file->f_dentry->d_inode->i_ino, DT_DIR) < 0) {
  733. cERROR(1, ("Filldir for current dir failed "));
  734. rc = -ENOMEM;
  735. break;
  736. }
  737. file->f_pos++; */
  738. case 1:
  739. /* if (filldir(direntry, "..", 2, file->f_pos,
  740. file->f_dentry->d_parent->d_inode->i_ino, DT_DIR) < 0) {
  741. cERROR(1, ("Filldir for parent dir failed "));
  742. rc = -ENOMEM;
  743. break;
  744. }
  745. file->f_pos++; */
  746. case 2:
  747. /* 1) If search is active,
  748. is in current search buffer?
  749. if it before then restart search
  750. if after then keep searching till find it */
  751. if(file->private_data == NULL) {
  752. rc = initiate_cifs_search(xid,file);
  753. cFYI(1,("initiate cifs search rc %d",rc));
  754. if(rc) {
  755. FreeXid(xid);
  756. return rc;
  757. }
  758. }
  759. default:
  760. if(file->private_data == NULL) {
  761. rc = -EINVAL;
  762. FreeXid(xid);
  763. return rc;
  764. }
  765. cifsFile = file->private_data;
  766. if (cifsFile->srch_inf.endOfSearch) {
  767. if(cifsFile->srch_inf.emptyDir) {
  768. cFYI(1, ("End of search, empty dir"));
  769. rc = 0;
  770. break;
  771. }
  772. } /* else {
  773. cifsFile->invalidHandle = TRUE;
  774. CIFSFindClose(xid, pTcon, cifsFile->netfid);
  775. }
  776. kfree(cifsFile->search_resume_name);
  777. cifsFile->search_resume_name = NULL; */
  778. /* BB account for . and .. in f_pos as special case */
  779. /* dump_cifs_file_struct(file, "rdir after default ");*/
  780. rc = find_cifs_entry(xid,pTcon, file,
  781. &current_entry,&num_to_fill);
  782. if(rc) {
  783. cFYI(1,("fce error %d",rc));
  784. goto rddir2_exit;
  785. } else if (current_entry != NULL) {
  786. cFYI(1,("entry %lld found",file->f_pos));
  787. } else {
  788. cFYI(1,("could not find entry"));
  789. goto rddir2_exit;
  790. }
  791. cFYI(1,("loop through %d times filling dir for net buf %p",
  792. num_to_fill,cifsFile->srch_inf.ntwrk_buf_start));
  793. end_of_smb = cifsFile->srch_inf.ntwrk_buf_start +
  794. smbCalcSize((struct smb_hdr *)
  795. cifsFile->srch_inf.ntwrk_buf_start);
  796. /* To be safe - for UCS to UTF-8 with strings loaded
  797. with the rare long characters alloc more to account for
  798. such multibyte target UTF-8 characters. cifs_unicode.c,
  799. which actually does the conversion, has the same limit */
  800. tmp_buf = kmalloc((2 * NAME_MAX) + 4, GFP_KERNEL);
  801. for(i=0;(i<num_to_fill) && (rc == 0);i++) {
  802. if(current_entry == NULL) {
  803. /* evaluate whether this case is an error */
  804. cERROR(1,("past end of SMB num to fill %d i %d",
  805. num_to_fill, i));
  806. break;
  807. }
  808. rc = cifs_filldir(current_entry, file,
  809. filldir, direntry,tmp_buf);
  810. file->f_pos++;
  811. if(file->f_pos == cifsFile->srch_inf.index_of_last_entry) {
  812. cFYI(1,("last entry in buf at pos %lld %s",
  813. file->f_pos,tmp_buf)); /* BB removeme BB */
  814. cifs_save_resume_key(current_entry,cifsFile);
  815. break;
  816. } else
  817. current_entry = nxt_dir_entry(current_entry,end_of_smb);
  818. }
  819. kfree(tmp_buf);
  820. break;
  821. } /* end switch */
  822. rddir2_exit:
  823. /* dump_cifs_file_struct(file, "end rdir "); */
  824. FreeXid(xid);
  825. return rc;
  826. }