readdir.c 30 KB

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