readdir.c 28 KB

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