2005-04-17 00:20:36 +02:00
|
|
|
/*
|
|
|
|
* fs/cifs/readdir.c
|
|
|
|
*
|
|
|
|
* Directory search handling
|
2007-07-07 01:13:06 +02:00
|
|
|
*
|
2008-02-08 00:25:02 +01:00
|
|
|
* Copyright (C) International Business Machines Corp., 2004, 2008
|
2011-07-16 21:24:05 +02:00
|
|
|
* Copyright (C) Red Hat, Inc., 2011
|
2005-04-17 00:20:36 +02:00
|
|
|
* Author(s): Steve French (sfrench@us.ibm.com)
|
|
|
|
*
|
|
|
|
* This library is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU Lesser General Public License as published
|
|
|
|
* by the Free Software Foundation; either version 2.1 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This library is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See
|
|
|
|
* the GNU Lesser General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Lesser General Public License
|
|
|
|
* along with this library; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
*/
|
|
|
|
#include <linux/fs.h>
|
2006-06-01 21:41:23 +02:00
|
|
|
#include <linux/pagemap.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 09:04:11 +01:00
|
|
|
#include <linux/slab.h>
|
2005-04-17 00:20:36 +02:00
|
|
|
#include <linux/stat.h>
|
|
|
|
#include "cifspdu.h"
|
|
|
|
#include "cifsglob.h"
|
|
|
|
#include "cifsproto.h"
|
|
|
|
#include "cifs_unicode.h"
|
|
|
|
#include "cifs_debug.h"
|
|
|
|
#include "cifs_fs_sb.h"
|
|
|
|
#include "cifsfs.h"
|
|
|
|
|
2009-04-30 13:18:00 +02:00
|
|
|
/*
|
|
|
|
* To be safe - for UCS to UTF-8 with strings loaded with the rare long
|
|
|
|
* characters alloc more to account for such multibyte target UTF-8
|
|
|
|
* characters.
|
|
|
|
*/
|
|
|
|
#define UNICODE_NAME_MAX ((4 * NAME_MAX) + 2)
|
|
|
|
|
2006-06-01 00:40:51 +02:00
|
|
|
#ifdef CONFIG_CIFS_DEBUG2
|
|
|
|
static void dump_cifs_file_struct(struct file *file, char *label)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2007-07-07 01:13:06 +02:00
|
|
|
struct cifsFileInfo *cf;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2007-04-30 22:13:06 +02:00
|
|
|
if (file) {
|
2005-04-17 00:20:36 +02:00
|
|
|
cf = file->private_data;
|
2007-04-30 22:13:06 +02:00
|
|
|
if (cf == NULL) {
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(FYI, "empty cifs private file data\n");
|
2005-04-17 00:20:36 +02:00
|
|
|
return;
|
|
|
|
}
|
2008-02-08 00:25:02 +01:00
|
|
|
if (cf->invalidHandle)
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(FYI, "invalid handle\n");
|
2008-02-08 00:25:02 +01:00
|
|
|
if (cf->srch_inf.endOfSearch)
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(FYI, "end of search\n");
|
2008-02-08 00:25:02 +01:00
|
|
|
if (cf->srch_inf.emptyDir)
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(FYI, "empty dir\n");
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2006-06-01 00:40:51 +02:00
|
|
|
}
|
2008-02-12 21:32:36 +01:00
|
|
|
#else
|
|
|
|
static inline void dump_cifs_file_struct(struct file *file, char *label)
|
|
|
|
{
|
|
|
|
}
|
2006-06-01 00:40:51 +02:00
|
|
|
#endif /* DEBUG2 */
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2009-06-25 06:56:52 +02:00
|
|
|
/*
|
2012-12-03 12:05:37 +01:00
|
|
|
* Attempt to preload the dcache with the results from the FIND_FIRST/NEXT
|
|
|
|
*
|
2009-06-25 06:56:52 +02:00
|
|
|
* Find the dentry that matches "name". If there isn't one, create one. If it's
|
2014-12-19 07:38:14 +01:00
|
|
|
* a negative dentry or the uniqueid or filetype(mode) changed,
|
|
|
|
* then drop it and recreate it.
|
2009-06-25 06:56:52 +02:00
|
|
|
*/
|
2012-12-03 12:05:37 +01:00
|
|
|
static void
|
|
|
|
cifs_prime_dcache(struct dentry *parent, struct qstr *name,
|
2009-06-25 06:56:52 +02:00
|
|
|
struct cifs_fattr *fattr)
|
|
|
|
{
|
|
|
|
struct dentry *dentry, *alias;
|
|
|
|
struct inode *inode;
|
2015-03-17 23:25:59 +01:00
|
|
|
struct super_block *sb = d_inode(parent)->i_sb;
|
2012-12-18 12:35:10 +01:00
|
|
|
struct cifs_sb_info *cifs_sb = CIFS_SB(sb);
|
2009-06-25 06:56:52 +02:00
|
|
|
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(FYI, "%s: for %s\n", __func__, name->name);
|
2009-06-25 06:56:52 +02:00
|
|
|
|
2013-02-12 05:20:37 +01:00
|
|
|
dentry = d_hash_and_lookup(parent, name);
|
2015-08-12 12:29:44 +02:00
|
|
|
if (IS_ERR(dentry))
|
2013-02-12 05:20:37 +01:00
|
|
|
return;
|
2010-02-05 19:30:36 +01:00
|
|
|
|
2009-06-25 06:56:52 +02:00
|
|
|
if (dentry) {
|
2015-03-17 23:25:59 +01:00
|
|
|
inode = d_inode(dentry);
|
2012-12-18 12:35:10 +01:00
|
|
|
if (inode) {
|
2015-04-02 15:51:35 +02:00
|
|
|
if (d_mountpoint(dentry))
|
|
|
|
goto out;
|
2012-12-18 12:35:10 +01:00
|
|
|
/*
|
|
|
|
* If we're generating inode numbers, then we don't
|
|
|
|
* want to clobber the existing one with the one that
|
|
|
|
* the readdir code created.
|
|
|
|
*/
|
|
|
|
if (!(cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM))
|
|
|
|
fattr->cf_uniqueid = CIFS_I(inode)->uniqueid;
|
|
|
|
|
2014-12-19 07:38:14 +01:00
|
|
|
/* update inode in place
|
|
|
|
* if both i_ino and i_mode didn't change */
|
|
|
|
if (CIFS_I(inode)->uniqueid == fattr->cf_uniqueid &&
|
|
|
|
(inode->i_mode & S_IFMT) ==
|
|
|
|
(fattr->cf_mode & S_IFMT)) {
|
2012-12-18 12:35:10 +01:00
|
|
|
cifs_fattr_to_inode(inode, fattr);
|
|
|
|
goto out;
|
|
|
|
}
|
2012-07-06 13:09:42 +02:00
|
|
|
}
|
2014-02-13 18:46:25 +01:00
|
|
|
d_invalidate(dentry);
|
2009-06-25 06:56:52 +02:00
|
|
|
dput(dentry);
|
|
|
|
}
|
|
|
|
|
2013-08-07 16:29:08 +02:00
|
|
|
/*
|
|
|
|
* If we know that the inode will need to be revalidated immediately,
|
|
|
|
* then don't create a new dentry for it. We'll end up doing an on
|
|
|
|
* the wire call either way and this spares us an invalidation.
|
|
|
|
*/
|
|
|
|
if (fattr->cf_flags & CIFS_FATTR_NEED_REVAL)
|
|
|
|
return;
|
|
|
|
|
2009-06-25 06:56:52 +02:00
|
|
|
dentry = d_alloc(parent, name);
|
2012-12-03 12:05:37 +01:00
|
|
|
if (!dentry)
|
|
|
|
return;
|
2009-06-25 06:56:52 +02:00
|
|
|
|
|
|
|
inode = cifs_iget(sb, fattr);
|
2012-12-03 12:05:37 +01:00
|
|
|
if (!inode)
|
|
|
|
goto out;
|
2009-06-25 06:56:52 +02:00
|
|
|
|
2014-10-13 04:24:21 +02:00
|
|
|
alias = d_splice_alias(inode, dentry);
|
2012-12-03 12:05:37 +01:00
|
|
|
if (alias && !IS_ERR(alias))
|
|
|
|
dput(alias);
|
|
|
|
out:
|
|
|
|
dput(dentry);
|
2009-06-25 06:56:52 +02:00
|
|
|
}
|
|
|
|
|
2009-07-09 07:46:37 +02:00
|
|
|
static void
|
|
|
|
cifs_fill_common_info(struct cifs_fattr *fattr, struct cifs_sb_info *cifs_sb)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2009-07-09 07:46:37 +02:00
|
|
|
fattr->cf_uid = cifs_sb->mnt_uid;
|
|
|
|
fattr->cf_gid = cifs_sb->mnt_gid;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2009-07-09 07:46:37 +02:00
|
|
|
if (fattr->cf_cifsattrs & ATTR_DIRECTORY) {
|
|
|
|
fattr->cf_mode = S_IFDIR | cifs_sb->mnt_dir_mode;
|
|
|
|
fattr->cf_dtype = DT_DIR;
|
2005-04-17 00:20:36 +02:00
|
|
|
} else {
|
2009-07-09 07:46:37 +02:00
|
|
|
fattr->cf_mode = S_IFREG | cifs_sb->mnt_file_mode;
|
|
|
|
fattr->cf_dtype = DT_REG;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2013-10-23 15:49:47 +02:00
|
|
|
/*
|
|
|
|
* We need to revalidate it further to make a decision about whether it
|
|
|
|
* is a symbolic link, DFS referral or a reparse point with a direct
|
|
|
|
* access like junctions, deduplicated files, NFS symlinks.
|
|
|
|
*/
|
|
|
|
if (fattr->cf_cifsattrs & ATTR_REPARSE)
|
|
|
|
fattr->cf_flags |= CIFS_FATTR_NEED_REVAL;
|
|
|
|
|
2013-09-21 17:36:10 +02:00
|
|
|
/* non-unix readdir doesn't provide nlink */
|
|
|
|
fattr->cf_flags |= CIFS_FATTR_UNKNOWN_NLINK;
|
|
|
|
|
2009-07-09 07:46:37 +02:00
|
|
|
if (fattr->cf_cifsattrs & ATTR_READONLY)
|
|
|
|
fattr->cf_mode &= ~S_IWUGO;
|
2006-06-07 02:18:43 +02:00
|
|
|
|
2012-11-25 14:00:40 +01:00
|
|
|
/*
|
|
|
|
* We of course don't get ACL info in FIND_FIRST/NEXT results, so
|
|
|
|
* mark it for revalidation so that "ls -l" will look right. It might
|
|
|
|
* be super-slow, but if we don't do this then the ownership of files
|
|
|
|
* may look wrong since the inodes may not have timed out by the time
|
|
|
|
* "ls" does a stat() call on them.
|
|
|
|
*/
|
|
|
|
if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_CIFS_ACL)
|
|
|
|
fattr->cf_flags |= CIFS_FATTR_NEED_REVAL;
|
|
|
|
|
2009-07-09 07:46:37 +02:00
|
|
|
if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_UNX_EMUL &&
|
|
|
|
fattr->cf_cifsattrs & ATTR_SYSTEM) {
|
|
|
|
if (fattr->cf_eof == 0) {
|
|
|
|
fattr->cf_mode &= ~S_IFMT;
|
|
|
|
fattr->cf_mode |= S_IFIFO;
|
|
|
|
fattr->cf_dtype = DT_FIFO;
|
2005-11-18 20:31:10 +01:00
|
|
|
} else {
|
2008-05-22 15:31:40 +02:00
|
|
|
/*
|
2009-07-09 07:46:37 +02:00
|
|
|
* trying to get the type and mode via SFU can be slow,
|
|
|
|
* so just call those regular files for now, and mark
|
|
|
|
* for reval
|
2008-05-22 15:31:40 +02:00
|
|
|
*/
|
2009-07-09 07:46:37 +02:00
|
|
|
fattr->cf_flags |= CIFS_FATTR_NEED_REVAL;
|
2008-05-22 15:31:40 +02:00
|
|
|
}
|
|
|
|
}
|
2009-07-09 07:46:37 +02:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2012-09-28 19:21:14 +02:00
|
|
|
void
|
2009-07-09 07:46:37 +02:00
|
|
|
cifs_dir_info_to_fattr(struct cifs_fattr *fattr, FILE_DIRECTORY_INFO *info,
|
|
|
|
struct cifs_sb_info *cifs_sb)
|
|
|
|
{
|
|
|
|
memset(fattr, 0, sizeof(*fattr));
|
|
|
|
fattr->cf_cifsattrs = le32_to_cpu(info->ExtFileAttributes);
|
|
|
|
fattr->cf_eof = le64_to_cpu(info->EndOfFile);
|
|
|
|
fattr->cf_bytes = le64_to_cpu(info->AllocationSize);
|
2011-01-07 17:30:27 +01:00
|
|
|
fattr->cf_createtime = le64_to_cpu(info->CreationTime);
|
2009-07-09 07:46:37 +02:00
|
|
|
fattr->cf_atime = cifs_NTtimeToUnix(info->LastAccessTime);
|
|
|
|
fattr->cf_ctime = cifs_NTtimeToUnix(info->ChangeTime);
|
|
|
|
fattr->cf_mtime = cifs_NTtimeToUnix(info->LastWriteTime);
|
|
|
|
|
|
|
|
cifs_fill_common_info(fattr, cifs_sb);
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2009-09-25 04:24:45 +02:00
|
|
|
static void
|
2009-07-09 07:46:37 +02:00
|
|
|
cifs_std_info_to_fattr(struct cifs_fattr *fattr, FIND_FILE_STANDARD_INFO *info,
|
|
|
|
struct cifs_sb_info *cifs_sb)
|
|
|
|
{
|
2010-09-21 01:01:35 +02:00
|
|
|
int offset = cifs_sb_master_tcon(cifs_sb)->ses->server->timeAdj;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2009-07-09 07:46:37 +02:00
|
|
|
memset(fattr, 0, sizeof(*fattr));
|
|
|
|
fattr->cf_atime = cnvrtDosUnixTm(info->LastAccessDate,
|
|
|
|
info->LastAccessTime, offset);
|
|
|
|
fattr->cf_ctime = cnvrtDosUnixTm(info->LastWriteDate,
|
|
|
|
info->LastWriteTime, offset);
|
|
|
|
fattr->cf_mtime = cnvrtDosUnixTm(info->LastWriteDate,
|
|
|
|
info->LastWriteTime, offset);
|
|
|
|
|
|
|
|
fattr->cf_cifsattrs = le16_to_cpu(info->Attributes);
|
|
|
|
fattr->cf_bytes = le32_to_cpu(info->AllocationSize);
|
|
|
|
fattr->cf_eof = le32_to_cpu(info->DataSize);
|
|
|
|
|
|
|
|
cifs_fill_common_info(fattr, cifs_sb);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2009-05-01 07:27:32 +02:00
|
|
|
/* BB eventually need to add the following helper function to
|
|
|
|
resolve NT_STATUS_STOPPED_ON_SYMLINK return code when
|
|
|
|
we try to do FindFirst on (NTFS) directory symlinks */
|
|
|
|
/*
|
|
|
|
int get_symlink_reparse_path(char *full_path, struct cifs_sb_info *cifs_sb,
|
2012-06-20 09:21:16 +02:00
|
|
|
unsigned int xid)
|
2009-05-01 07:27:32 +02:00
|
|
|
{
|
|
|
|
__u16 fid;
|
|
|
|
int len;
|
|
|
|
int oplock = 0;
|
|
|
|
int rc;
|
2011-05-27 06:34:02 +02:00
|
|
|
struct cifs_tcon *ptcon = cifs_sb_tcon(cifs_sb);
|
2009-05-01 07:27:32 +02:00
|
|
|
char *tmpbuffer;
|
|
|
|
|
|
|
|
rc = CIFSSMBOpen(xid, ptcon, full_path, FILE_OPEN, GENERIC_READ,
|
|
|
|
OPEN_REPARSE_POINT, &fid, &oplock, NULL,
|
|
|
|
cifs_sb->local_nls,
|
2014-09-27 09:19:01 +02:00
|
|
|
cifs_remap(cifs_sb);
|
2009-05-01 07:27:32 +02:00
|
|
|
if (!rc) {
|
|
|
|
tmpbuffer = kmalloc(maxpath);
|
|
|
|
rc = CIFSSMBQueryReparseLinkInfo(xid, ptcon, full_path,
|
|
|
|
tmpbuffer,
|
|
|
|
maxpath -1,
|
|
|
|
fid,
|
|
|
|
cifs_sb->local_nls);
|
|
|
|
if (CIFSSMBClose(xid, ptcon, fid)) {
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(FYI, "Error closing temporary reparsepoint open\n");
|
2009-05-01 07:27:32 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
*/
|
|
|
|
|
2012-09-19 01:20:32 +02:00
|
|
|
static int
|
|
|
|
initiate_cifs_search(const unsigned int xid, struct file *file)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2012-05-15 17:19:16 +02:00
|
|
|
__u16 search_flags;
|
2005-04-17 00:20:36 +02:00
|
|
|
int rc = 0;
|
2010-09-30 01:51:11 +02:00
|
|
|
char *full_path = NULL;
|
2007-07-08 17:40:40 +02:00
|
|
|
struct cifsFileInfo *cifsFile;
|
2014-10-22 06:25:12 +02:00
|
|
|
struct cifs_sb_info *cifs_sb = CIFS_FILE_SB(file);
|
2010-11-12 12:30:29 +01:00
|
|
|
struct tcon_link *tlink = NULL;
|
2012-07-13 11:58:14 +02:00
|
|
|
struct cifs_tcon *tcon;
|
2012-09-19 01:20:32 +02:00
|
|
|
struct TCP_Server_Info *server;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-09-30 01:51:11 +02:00
|
|
|
if (file->private_data == NULL) {
|
2010-11-12 12:30:29 +01:00
|
|
|
tlink = cifs_sb_tlink(cifs_sb);
|
|
|
|
if (IS_ERR(tlink))
|
|
|
|
return PTR_ERR(tlink);
|
|
|
|
|
|
|
|
cifsFile = kzalloc(sizeof(struct cifsFileInfo), GFP_KERNEL);
|
|
|
|
if (cifsFile == NULL) {
|
|
|
|
rc = -ENOMEM;
|
|
|
|
goto error_exit;
|
|
|
|
}
|
|
|
|
file->private_data = cifsFile;
|
|
|
|
cifsFile->tlink = cifs_get_tlink(tlink);
|
2012-07-13 11:58:14 +02:00
|
|
|
tcon = tlink_tcon(tlink);
|
2010-11-12 12:30:29 +01:00
|
|
|
} else {
|
|
|
|
cifsFile = file->private_data;
|
2012-07-13 11:58:14 +02:00
|
|
|
tcon = tlink_tcon(cifsFile->tlink);
|
2010-09-30 01:51:11 +02:00
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2012-09-19 01:20:32 +02:00
|
|
|
server = tcon->ses->server;
|
|
|
|
|
|
|
|
if (!server->ops->query_dir_first) {
|
|
|
|
rc = -ENOSYS;
|
|
|
|
goto error_exit;
|
|
|
|
}
|
|
|
|
|
2008-04-29 02:06:05 +02:00
|
|
|
cifsFile->invalidHandle = true;
|
|
|
|
cifsFile->srch_inf.endOfSearch = false;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2006-12-08 11:36:48 +01:00
|
|
|
full_path = build_path_from_dentry(file->f_path.dentry);
|
2010-09-30 01:51:11 +02:00
|
|
|
if (full_path == NULL) {
|
|
|
|
rc = -ENOMEM;
|
|
|
|
goto error_exit;
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(FYI, "Full path: %s start at: %lld\n", full_path, file->f_pos);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2005-04-29 07:41:04 +02:00
|
|
|
ffirst_retry:
|
2005-04-17 00:20:36 +02:00
|
|
|
/* test for Unix extensions */
|
2007-07-19 01:21:09 +02:00
|
|
|
/* but now check for them on the share/mount not on the SMB session */
|
2012-07-13 11:58:14 +02:00
|
|
|
/* if (cap_unix(tcon->ses) { */
|
|
|
|
if (tcon->unix_ext)
|
2006-06-07 02:18:43 +02:00
|
|
|
cifsFile->srch_inf.info_level = SMB_FIND_FILE_UNIX;
|
2012-07-13 11:58:14 +02:00
|
|
|
else if ((tcon->ses->capabilities &
|
|
|
|
tcon->ses->server->vals->cap_nt_find) == 0) {
|
2006-06-07 02:18:43 +02:00
|
|
|
cifsFile->srch_inf.info_level = SMB_FIND_FILE_INFO_STANDARD;
|
2005-04-17 00:20:36 +02:00
|
|
|
} else if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM) {
|
|
|
|
cifsFile->srch_inf.info_level = SMB_FIND_FILE_ID_FULL_DIR_INFO;
|
|
|
|
} else /* not srvinos - BB fixme add check for backlevel? */ {
|
|
|
|
cifsFile->srch_inf.info_level = SMB_FIND_FILE_DIRECTORY_INFO;
|
|
|
|
}
|
|
|
|
|
2012-05-15 17:19:16 +02:00
|
|
|
search_flags = CIFS_SEARCH_CLOSE_AT_END | CIFS_SEARCH_RETURN_RESUME;
|
|
|
|
if (backup_cred(cifs_sb))
|
|
|
|
search_flags |= CIFS_SEARCH_BACKUP_SEARCH;
|
|
|
|
|
2012-09-19 01:20:32 +02:00
|
|
|
rc = server->ops->query_dir_first(xid, tcon, full_path, cifs_sb,
|
|
|
|
&cifsFile->fid, search_flags,
|
|
|
|
&cifsFile->srch_inf);
|
|
|
|
|
2007-04-30 22:13:06 +02:00
|
|
|
if (rc == 0)
|
2008-04-29 02:06:05 +02:00
|
|
|
cifsFile->invalidHandle = false;
|
2009-05-01 18:20:35 +02:00
|
|
|
/* BB add following call to handle readdir on new NTFS symlink errors
|
2009-05-01 07:27:32 +02:00
|
|
|
else if STATUS_STOPPED_ON_SYMLINK
|
|
|
|
call get_symlink_reparse_path and retry with new path */
|
|
|
|
else if ((rc == -EOPNOTSUPP) &&
|
2005-04-29 07:41:04 +02:00
|
|
|
(cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM)) {
|
|
|
|
cifs_sb->mnt_cifs_flags &= ~CIFS_MOUNT_SERVER_INUM;
|
|
|
|
goto ffirst_retry;
|
|
|
|
}
|
2010-09-30 01:51:11 +02:00
|
|
|
error_exit:
|
2005-04-17 00:20:36 +02:00
|
|
|
kfree(full_path);
|
2010-09-30 01:51:11 +02:00
|
|
|
cifs_put_tlink(tlink);
|
2005-04-17 00:20:36 +02:00
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* return length of unicode string in bytes */
|
2011-07-16 21:24:05 +02:00
|
|
|
static int cifs_unicode_bytelen(const char *str)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
int len;
|
2011-07-16 21:24:05 +02:00
|
|
|
const __le16 *ustr = (const __le16 *)str;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2007-07-08 17:40:40 +02:00
|
|
|
for (len = 0; len <= PATH_MAX; len++) {
|
2007-04-30 22:13:06 +02:00
|
|
|
if (ustr[len] == 0)
|
2005-04-17 00:20:36 +02:00
|
|
|
return len << 1;
|
|
|
|
}
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(FYI, "Unicode string longer than PATH_MAX found\n");
|
2005-04-17 00:20:36 +02:00
|
|
|
return len << 1;
|
|
|
|
}
|
|
|
|
|
2006-06-07 02:18:43 +02:00
|
|
|
static char *nxt_dir_entry(char *old_entry, char *end_of_smb, int level)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2007-07-08 17:40:40 +02:00
|
|
|
char *new_entry;
|
2008-02-08 00:25:02 +01:00
|
|
|
FILE_DIRECTORY_INFO *pDirInfo = (FILE_DIRECTORY_INFO *)old_entry;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2007-04-30 22:13:06 +02:00
|
|
|
if (level == SMB_FIND_FILE_INFO_STANDARD) {
|
2008-02-08 00:25:02 +01:00
|
|
|
FIND_FILE_STANDARD_INFO *pfData;
|
2006-06-07 02:18:43 +02:00
|
|
|
pfData = (FIND_FILE_STANDARD_INFO *)pDirInfo;
|
|
|
|
|
|
|
|
new_entry = old_entry + sizeof(FIND_FILE_STANDARD_INFO) +
|
|
|
|
pfData->FileNameLength;
|
|
|
|
} else
|
|
|
|
new_entry = old_entry + le32_to_cpu(pDirInfo->NextEntryOffset);
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(FYI, "new entry %p old entry %p\n", new_entry, old_entry);
|
2005-04-17 00:20:36 +02:00
|
|
|
/* validate that new_entry is not past end of SMB */
|
2007-04-30 22:13:06 +02:00
|
|
|
if (new_entry >= end_of_smb) {
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(VFS, "search entry %p began after end of SMB %p old entry %p\n",
|
|
|
|
new_entry, end_of_smb, old_entry);
|
2005-04-17 00:20:36 +02:00
|
|
|
return NULL;
|
2007-04-30 22:13:06 +02:00
|
|
|
} else if (((level == SMB_FIND_FILE_INFO_STANDARD) &&
|
2007-07-08 17:40:40 +02:00
|
|
|
(new_entry + sizeof(FIND_FILE_STANDARD_INFO) > end_of_smb))
|
|
|
|
|| ((level != SMB_FIND_FILE_INFO_STANDARD) &&
|
2006-06-07 02:18:43 +02:00
|
|
|
(new_entry + sizeof(FILE_DIRECTORY_INFO) > end_of_smb))) {
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(VFS, "search entry %p extends after end of SMB %p\n",
|
|
|
|
new_entry, end_of_smb);
|
2005-04-29 07:41:08 +02:00
|
|
|
return NULL;
|
2007-07-08 17:40:40 +02:00
|
|
|
} else
|
2005-04-17 00:20:36 +02:00
|
|
|
return new_entry;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2011-07-16 21:24:05 +02:00
|
|
|
struct cifs_dirent {
|
|
|
|
const char *name;
|
|
|
|
size_t namelen;
|
|
|
|
u32 resume_key;
|
|
|
|
u64 ino;
|
|
|
|
};
|
|
|
|
|
|
|
|
static void cifs_fill_dirent_unix(struct cifs_dirent *de,
|
|
|
|
const FILE_UNIX_INFO *info, bool is_unicode)
|
|
|
|
{
|
|
|
|
de->name = &info->FileName[0];
|
|
|
|
if (is_unicode)
|
|
|
|
de->namelen = cifs_unicode_bytelen(de->name);
|
|
|
|
else
|
|
|
|
de->namelen = strnlen(de->name, PATH_MAX);
|
|
|
|
de->resume_key = info->ResumeKey;
|
|
|
|
de->ino = le64_to_cpu(info->basic.UniqueId);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void cifs_fill_dirent_dir(struct cifs_dirent *de,
|
|
|
|
const FILE_DIRECTORY_INFO *info)
|
|
|
|
{
|
|
|
|
de->name = &info->FileName[0];
|
|
|
|
de->namelen = le32_to_cpu(info->FileNameLength);
|
|
|
|
de->resume_key = info->FileIndex;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void cifs_fill_dirent_full(struct cifs_dirent *de,
|
|
|
|
const FILE_FULL_DIRECTORY_INFO *info)
|
|
|
|
{
|
|
|
|
de->name = &info->FileName[0];
|
|
|
|
de->namelen = le32_to_cpu(info->FileNameLength);
|
|
|
|
de->resume_key = info->FileIndex;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void cifs_fill_dirent_search(struct cifs_dirent *de,
|
|
|
|
const SEARCH_ID_FULL_DIR_INFO *info)
|
|
|
|
{
|
|
|
|
de->name = &info->FileName[0];
|
|
|
|
de->namelen = le32_to_cpu(info->FileNameLength);
|
|
|
|
de->resume_key = info->FileIndex;
|
|
|
|
de->ino = le64_to_cpu(info->UniqueId);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void cifs_fill_dirent_both(struct cifs_dirent *de,
|
|
|
|
const FILE_BOTH_DIRECTORY_INFO *info)
|
|
|
|
{
|
|
|
|
de->name = &info->FileName[0];
|
|
|
|
de->namelen = le32_to_cpu(info->FileNameLength);
|
|
|
|
de->resume_key = info->FileIndex;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void cifs_fill_dirent_std(struct cifs_dirent *de,
|
|
|
|
const FIND_FILE_STANDARD_INFO *info)
|
|
|
|
{
|
|
|
|
de->name = &info->FileName[0];
|
|
|
|
/* one byte length, no endianess conversion */
|
|
|
|
de->namelen = info->FileNameLength;
|
|
|
|
de->resume_key = info->ResumeKey;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int cifs_fill_dirent(struct cifs_dirent *de, const void *info,
|
|
|
|
u16 level, bool is_unicode)
|
|
|
|
{
|
|
|
|
memset(de, 0, sizeof(*de));
|
|
|
|
|
|
|
|
switch (level) {
|
|
|
|
case SMB_FIND_FILE_UNIX:
|
|
|
|
cifs_fill_dirent_unix(de, info, is_unicode);
|
|
|
|
break;
|
|
|
|
case SMB_FIND_FILE_DIRECTORY_INFO:
|
|
|
|
cifs_fill_dirent_dir(de, info);
|
|
|
|
break;
|
|
|
|
case SMB_FIND_FILE_FULL_DIRECTORY_INFO:
|
|
|
|
cifs_fill_dirent_full(de, info);
|
|
|
|
break;
|
|
|
|
case SMB_FIND_FILE_ID_FULL_DIR_INFO:
|
|
|
|
cifs_fill_dirent_search(de, info);
|
|
|
|
break;
|
|
|
|
case SMB_FIND_FILE_BOTH_DIRECTORY_INFO:
|
|
|
|
cifs_fill_dirent_both(de, info);
|
|
|
|
break;
|
|
|
|
case SMB_FIND_FILE_INFO_STANDARD:
|
|
|
|
cifs_fill_dirent_std(de, info);
|
|
|
|
break;
|
|
|
|
default:
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(FYI, "Unknown findfirst level %d\n", level);
|
2011-07-16 21:24:05 +02:00
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2005-04-17 00:20:36 +02:00
|
|
|
#define UNICODE_DOT cpu_to_le16(0x2e)
|
|
|
|
|
|
|
|
/* return 0 if no match and 1 for . (current directory) and 2 for .. (parent) */
|
2011-07-16 21:24:05 +02:00
|
|
|
static int cifs_entry_is_dot(struct cifs_dirent *de, bool is_unicode)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
int rc = 0;
|
|
|
|
|
2011-07-16 21:24:05 +02:00
|
|
|
if (!de->name)
|
|
|
|
return 0;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-07-16 21:24:05 +02:00
|
|
|
if (is_unicode) {
|
|
|
|
__le16 *ufilename = (__le16 *)de->name;
|
|
|
|
if (de->namelen == 2) {
|
|
|
|
/* check for . */
|
|
|
|
if (ufilename[0] == UNICODE_DOT)
|
|
|
|
rc = 1;
|
|
|
|
} else if (de->namelen == 4) {
|
|
|
|
/* check for .. */
|
|
|
|
if (ufilename[0] == UNICODE_DOT &&
|
|
|
|
ufilename[1] == UNICODE_DOT)
|
|
|
|
rc = 2;
|
|
|
|
}
|
|
|
|
} else /* ASCII */ {
|
|
|
|
if (de->namelen == 1) {
|
|
|
|
if (de->name[0] == '.')
|
|
|
|
rc = 1;
|
|
|
|
} else if (de->namelen == 2) {
|
|
|
|
if (de->name[0] == '.' && de->name[1] == '.')
|
|
|
|
rc = 2;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
2005-09-16 06:47:30 +02:00
|
|
|
/* Check if directory that we are searching has changed so we can decide
|
|
|
|
whether we can use the cached search results from the previous search */
|
2007-07-08 17:40:40 +02:00
|
|
|
static int is_dir_changed(struct file *file)
|
2005-09-16 06:47:30 +02:00
|
|
|
{
|
2013-01-23 23:07:38 +01:00
|
|
|
struct inode *inode = file_inode(file);
|
2007-04-02 20:47:20 +02:00
|
|
|
struct cifsInodeInfo *cifsInfo = CIFS_I(inode);
|
2005-09-16 06:47:30 +02:00
|
|
|
|
2007-04-02 20:47:20 +02:00
|
|
|
if (cifsInfo->time == 0)
|
2005-09-16 06:47:30 +02:00
|
|
|
return 1; /* directory was changed, perhaps due to unlink */
|
|
|
|
else
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2008-10-07 22:03:33 +02:00
|
|
|
static int cifs_save_resume_key(const char *current_entry,
|
2011-07-16 21:24:37 +02:00
|
|
|
struct cifsFileInfo *file_info)
|
2008-10-07 22:03:33 +02:00
|
|
|
{
|
2011-07-16 21:24:37 +02:00
|
|
|
struct cifs_dirent de;
|
|
|
|
int rc;
|
2008-10-07 22:03:33 +02:00
|
|
|
|
2011-07-16 21:24:37 +02:00
|
|
|
rc = cifs_fill_dirent(&de, current_entry, file_info->srch_inf.info_level,
|
|
|
|
file_info->srch_inf.unicode);
|
|
|
|
if (!rc) {
|
|
|
|
file_info->srch_inf.presume_name = de.name;
|
|
|
|
file_info->srch_inf.resume_name_len = de.namelen;
|
|
|
|
file_info->srch_inf.resume_key = de.resume_key;
|
2008-10-07 22:03:33 +02:00
|
|
|
}
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
2012-09-19 01:20:32 +02:00
|
|
|
/*
|
|
|
|
* Find the corresponding entry in the search. Note that the SMB server returns
|
|
|
|
* search entries for . and .. which complicates logic here if we choose to
|
|
|
|
* parse for them and we do not assume that they are located in the findfirst
|
|
|
|
* return buffer. We start counting in the buffer with entry 2 and increment for
|
|
|
|
* every entry (do not increment for . or .. entry).
|
|
|
|
*/
|
|
|
|
static int
|
2013-05-22 22:17:25 +02:00
|
|
|
find_cifs_entry(const unsigned int xid, struct cifs_tcon *tcon, loff_t pos,
|
2012-09-19 01:20:32 +02:00
|
|
|
struct file *file, char **current_entry, int *num_to_ret)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2012-05-15 17:19:16 +02:00
|
|
|
__u16 search_flags;
|
2005-04-17 00:20:36 +02:00
|
|
|
int rc = 0;
|
|
|
|
int pos_in_buf = 0;
|
|
|
|
loff_t first_entry_in_buffer;
|
2013-05-22 22:17:25 +02:00
|
|
|
loff_t index_to_find = pos;
|
2012-09-19 01:20:32 +02:00
|
|
|
struct cifsFileInfo *cfile = file->private_data;
|
2014-10-22 06:25:12 +02:00
|
|
|
struct cifs_sb_info *cifs_sb = CIFS_FILE_SB(file);
|
2012-09-19 01:20:32 +02:00
|
|
|
struct TCP_Server_Info *server = tcon->ses->server;
|
2005-04-17 00:20:36 +02:00
|
|
|
/* check if index in the buffer */
|
2007-07-13 02:33:32 +02:00
|
|
|
|
2012-09-19 01:20:32 +02:00
|
|
|
if (!server->ops->query_dir_first || !server->ops->query_dir_next)
|
|
|
|
return -ENOSYS;
|
|
|
|
|
|
|
|
if ((cfile == NULL) || (current_entry == NULL) || (num_to_ret == NULL))
|
2005-04-17 00:20:36 +02:00
|
|
|
return -ENOENT;
|
2007-07-13 02:33:32 +02:00
|
|
|
|
2012-09-19 01:20:32 +02:00
|
|
|
*current_entry = NULL;
|
|
|
|
first_entry_in_buffer = cfile->srch_inf.index_of_last_entry -
|
|
|
|
cfile->srch_inf.entries_in_buffer;
|
2006-04-22 17:53:05 +02:00
|
|
|
|
2012-09-19 01:20:32 +02:00
|
|
|
/*
|
|
|
|
* If first entry in buf is zero then is first buffer
|
|
|
|
* in search response data which means it is likely . and ..
|
|
|
|
* will be in this buffer, although some servers do not return
|
|
|
|
* . and .. for the root of a drive and for those we need
|
|
|
|
* to start two entries earlier.
|
|
|
|
*/
|
2006-04-22 17:53:05 +02:00
|
|
|
|
2006-06-01 00:40:51 +02:00
|
|
|
dump_cifs_file_struct(file, "In fce ");
|
2012-09-19 01:20:32 +02:00
|
|
|
if (((index_to_find < cfile->srch_inf.index_of_last_entry) &&
|
|
|
|
is_dir_changed(file)) || (index_to_find < first_entry_in_buffer)) {
|
2005-04-17 00:20:36 +02:00
|
|
|
/* close and restart search */
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(FYI, "search backing up - close and restart search\n");
|
2010-10-15 21:34:03 +02:00
|
|
|
spin_lock(&cifs_file_list_lock);
|
2014-08-18 18:49:57 +02:00
|
|
|
if (server->ops->dir_needs_close(cfile)) {
|
2012-09-19 01:20:32 +02:00
|
|
|
cfile->invalidHandle = true;
|
2010-10-15 21:34:03 +02:00
|
|
|
spin_unlock(&cifs_file_list_lock);
|
2014-08-26 17:04:44 +02:00
|
|
|
if (server->ops->close_dir)
|
|
|
|
server->ops->close_dir(xid, tcon, &cfile->fid);
|
2008-11-20 21:00:44 +01:00
|
|
|
} else
|
2010-10-15 21:34:03 +02:00
|
|
|
spin_unlock(&cifs_file_list_lock);
|
2012-09-19 01:20:32 +02:00
|
|
|
if (cfile->srch_inf.ntwrk_buf_start) {
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(FYI, "freeing SMB ff cache buf on search rewind\n");
|
2012-09-19 01:20:32 +02:00
|
|
|
if (cfile->srch_inf.smallBuf)
|
|
|
|
cifs_small_buf_release(cfile->srch_inf.
|
2006-02-28 04:45:48 +01:00
|
|
|
ntwrk_buf_start);
|
|
|
|
else
|
2012-09-19 01:20:32 +02:00
|
|
|
cifs_buf_release(cfile->srch_inf.
|
2006-02-28 04:45:48 +01:00
|
|
|
ntwrk_buf_start);
|
2012-09-19 01:20:32 +02:00
|
|
|
cfile->srch_inf.ntwrk_buf_start = NULL;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2007-07-08 17:40:40 +02:00
|
|
|
rc = initiate_cifs_search(xid, file);
|
2007-04-30 22:13:06 +02:00
|
|
|
if (rc) {
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(FYI, "error %d reinitiating a search on rewind\n",
|
2010-04-21 05:50:45 +02:00
|
|
|
rc);
|
2005-04-17 00:20:36 +02:00
|
|
|
return rc;
|
|
|
|
}
|
2011-12-02 02:23:34 +01:00
|
|
|
/* FindFirst/Next set last_entry to NULL on malformed reply */
|
2012-09-19 01:20:32 +02:00
|
|
|
if (cfile->srch_inf.last_entry)
|
|
|
|
cifs_save_resume_key(cfile->srch_inf.last_entry, cfile);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
2012-05-15 17:19:16 +02:00
|
|
|
search_flags = CIFS_SEARCH_CLOSE_AT_END | CIFS_SEARCH_RETURN_RESUME;
|
|
|
|
if (backup_cred(cifs_sb))
|
|
|
|
search_flags |= CIFS_SEARCH_BACKUP_SEARCH;
|
|
|
|
|
2012-09-19 01:20:32 +02:00
|
|
|
while ((index_to_find >= cfile->srch_inf.index_of_last_entry) &&
|
|
|
|
(rc == 0) && !cfile->srch_inf.endOfSearch) {
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(FYI, "calling findnext2\n");
|
2012-09-19 01:20:32 +02:00
|
|
|
rc = server->ops->query_dir_next(xid, tcon, &cfile->fid,
|
|
|
|
search_flags,
|
|
|
|
&cfile->srch_inf);
|
2011-12-02 02:23:34 +01:00
|
|
|
/* FindFirst/Next set last_entry to NULL on malformed reply */
|
2012-09-19 01:20:32 +02:00
|
|
|
if (cfile->srch_inf.last_entry)
|
|
|
|
cifs_save_resume_key(cfile->srch_inf.last_entry, cfile);
|
2007-04-30 22:13:06 +02:00
|
|
|
if (rc)
|
2005-04-17 00:20:36 +02:00
|
|
|
return -ENOENT;
|
|
|
|
}
|
2012-09-19 01:20:32 +02:00
|
|
|
if (index_to_find < cfile->srch_inf.index_of_last_entry) {
|
2005-04-17 00:20:36 +02:00
|
|
|
/* we found the buffer that contains the entry */
|
|
|
|
/* scan and find it */
|
|
|
|
int i;
|
2012-09-19 01:20:32 +02:00
|
|
|
char *cur_ent;
|
|
|
|
char *end_of_smb = cfile->srch_inf.ntwrk_buf_start +
|
|
|
|
server->ops->calc_smb_size(
|
|
|
|
cfile->srch_inf.ntwrk_buf_start);
|
|
|
|
|
|
|
|
cur_ent = cfile->srch_inf.srch_entries_start;
|
|
|
|
first_entry_in_buffer = cfile->srch_inf.index_of_last_entry
|
|
|
|
- cfile->srch_inf.entries_in_buffer;
|
2005-04-17 00:20:36 +02:00
|
|
|
pos_in_buf = index_to_find - first_entry_in_buffer;
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(FYI, "found entry - pos_in_buf %d\n", pos_in_buf);
|
2006-06-07 02:18:43 +02:00
|
|
|
|
2012-09-19 01:20:32 +02:00
|
|
|
for (i = 0; (i < (pos_in_buf)) && (cur_ent != NULL); i++) {
|
2005-06-23 02:13:47 +02:00
|
|
|
/* go entry by entry figuring out which is first */
|
2012-09-19 01:20:32 +02:00
|
|
|
cur_ent = nxt_dir_entry(cur_ent, end_of_smb,
|
|
|
|
cfile->srch_inf.info_level);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2012-09-19 01:20:32 +02:00
|
|
|
if ((cur_ent == NULL) && (i < pos_in_buf)) {
|
2005-04-17 00:20:36 +02:00
|
|
|
/* BB fixme - check if we should flag this error */
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(VFS, "reached end of buf searching for pos in buf %d index to find %lld rc %d\n",
|
|
|
|
pos_in_buf, index_to_find, rc);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
rc = 0;
|
2012-09-19 01:20:32 +02:00
|
|
|
*current_entry = cur_ent;
|
2005-04-17 00:20:36 +02:00
|
|
|
} else {
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(FYI, "index not in buffer - could not findnext into it\n");
|
2005-04-17 00:20:36 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-09-19 01:20:32 +02:00
|
|
|
if (pos_in_buf >= cfile->srch_inf.entries_in_buffer) {
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(FYI, "can not return entries pos_in_buf beyond last\n");
|
2005-04-17 00:20:36 +02:00
|
|
|
*num_to_ret = 0;
|
|
|
|
} else
|
2012-09-19 01:20:32 +02:00
|
|
|
*num_to_ret = cfile->srch_inf.entries_in_buffer - pos_in_buf;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
2013-05-22 22:17:25 +02:00
|
|
|
static int cifs_filldir(char *find_entry, struct file *file,
|
|
|
|
struct dir_context *ctx,
|
|
|
|
char *scratch_buf, unsigned int max_len)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
2011-07-16 21:23:49 +02:00
|
|
|
struct cifsFileInfo *file_info = file->private_data;
|
2014-10-22 06:25:12 +02:00
|
|
|
struct super_block *sb = file_inode(file)->i_sb;
|
2011-07-16 21:23:49 +02:00
|
|
|
struct cifs_sb_info *cifs_sb = CIFS_SB(sb);
|
2011-07-16 21:24:05 +02:00
|
|
|
struct cifs_dirent de = { NULL, };
|
2009-06-25 06:56:52 +02:00
|
|
|
struct cifs_fattr fattr;
|
2011-07-16 21:23:49 +02:00
|
|
|
struct qstr name;
|
2005-04-17 00:20:36 +02:00
|
|
|
int rc = 0;
|
2011-07-16 21:23:49 +02:00
|
|
|
ino_t ino;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-07-16 21:24:05 +02:00
|
|
|
rc = cifs_fill_dirent(&de, find_entry, file_info->srch_inf.info_level,
|
|
|
|
file_info->srch_inf.unicode);
|
|
|
|
if (rc)
|
|
|
|
return rc;
|
2006-06-07 02:18:43 +02:00
|
|
|
|
2011-07-16 21:24:22 +02:00
|
|
|
if (de.namelen > max_len) {
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(VFS, "bad search response length %zd past smb end\n",
|
|
|
|
de.namelen);
|
2006-06-07 02:18:43 +02:00
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
2006-04-22 17:53:05 +02:00
|
|
|
/* skip . and .. since we added them first */
|
2011-07-16 21:24:05 +02:00
|
|
|
if (cifs_entry_is_dot(&de, file_info->srch_inf.unicode))
|
2006-04-22 17:53:05 +02:00
|
|
|
return 0;
|
|
|
|
|
2011-07-16 21:24:22 +02:00
|
|
|
if (file_info->srch_inf.unicode) {
|
|
|
|
struct nls_table *nlt = cifs_sb->local_nls;
|
2014-09-25 20:20:05 +02:00
|
|
|
int map_type;
|
|
|
|
|
2014-09-27 09:19:01 +02:00
|
|
|
map_type = cifs_remap(cifs_sb);
|
2011-07-16 21:24:22 +02:00
|
|
|
name.name = scratch_buf;
|
|
|
|
name.len =
|
2012-01-19 05:32:33 +01:00
|
|
|
cifs_from_utf16((char *)name.name, (__le16 *)de.name,
|
|
|
|
UNICODE_NAME_MAX,
|
|
|
|
min_t(size_t, de.namelen,
|
2014-09-25 20:20:05 +02:00
|
|
|
(size_t)max_len), nlt, map_type);
|
2011-07-16 21:24:22 +02:00
|
|
|
name.len -= nls_nullsize(nlt);
|
|
|
|
} else {
|
|
|
|
name.name = de.name;
|
|
|
|
name.len = de.namelen;
|
|
|
|
}
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2011-07-16 21:23:49 +02:00
|
|
|
switch (file_info->srch_inf.info_level) {
|
|
|
|
case SMB_FIND_FILE_UNIX:
|
2009-06-25 06:56:52 +02:00
|
|
|
cifs_unix_basic_to_fattr(&fattr,
|
2011-07-16 21:23:49 +02:00
|
|
|
&((FILE_UNIX_INFO *)find_entry)->basic,
|
|
|
|
cifs_sb);
|
|
|
|
break;
|
|
|
|
case SMB_FIND_FILE_INFO_STANDARD:
|
|
|
|
cifs_std_info_to_fattr(&fattr,
|
|
|
|
(FIND_FILE_STANDARD_INFO *)find_entry,
|
|
|
|
cifs_sb);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
cifs_dir_info_to_fattr(&fattr,
|
|
|
|
(FILE_DIRECTORY_INFO *)find_entry,
|
|
|
|
cifs_sb);
|
|
|
|
break;
|
|
|
|
}
|
2006-09-07 00:02:22 +02:00
|
|
|
|
2011-07-16 21:24:22 +02:00
|
|
|
if (de.ino && (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_SERVER_INUM)) {
|
|
|
|
fattr.cf_uniqueid = de.ino;
|
2009-11-06 20:18:29 +01:00
|
|
|
} else {
|
2009-07-09 07:46:37 +02:00
|
|
|
fattr.cf_uniqueid = iunique(sb, ROOT_I);
|
2009-11-06 20:18:29 +01:00
|
|
|
cifs_autodisable_serverino(cifs_sb);
|
|
|
|
}
|
2007-07-13 02:33:32 +02:00
|
|
|
|
2010-08-05 21:19:56 +02:00
|
|
|
if ((cifs_sb->mnt_cifs_flags & CIFS_MOUNT_MF_SYMLINKS) &&
|
2013-11-25 18:09:50 +01:00
|
|
|
couldbe_mf_symlink(&fattr))
|
2010-08-05 21:19:56 +02:00
|
|
|
/*
|
|
|
|
* trying to get the type and mode can be slow,
|
|
|
|
* so just call those regular files for now, and mark
|
|
|
|
* for reval
|
|
|
|
*/
|
|
|
|
fattr.cf_flags |= CIFS_FATTR_NEED_REVAL;
|
|
|
|
|
2014-10-31 06:22:04 +01:00
|
|
|
cifs_prime_dcache(file->f_path.dentry, &name, &fattr);
|
2007-07-08 17:40:40 +02:00
|
|
|
|
2012-12-03 12:05:37 +01:00
|
|
|
ino = cifs_uniqueid_to_ino_t(fattr.cf_uniqueid);
|
2013-05-22 22:17:25 +02:00
|
|
|
return !dir_emit(ctx, name.name, name.len, ino, fattr.cf_dtype);
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-05-22 22:17:25 +02:00
|
|
|
int cifs_readdir(struct file *file, struct dir_context *ctx)
|
2005-04-17 00:20:36 +02:00
|
|
|
{
|
|
|
|
int rc = 0;
|
2012-06-20 09:21:16 +02:00
|
|
|
unsigned int xid;
|
|
|
|
int i;
|
2012-09-19 01:20:32 +02:00
|
|
|
struct cifs_tcon *tcon;
|
2005-04-17 00:20:36 +02:00
|
|
|
struct cifsFileInfo *cifsFile = NULL;
|
2007-07-08 17:40:40 +02:00
|
|
|
char *current_entry;
|
2005-04-17 00:20:36 +02:00
|
|
|
int num_to_fill = 0;
|
2007-07-08 17:40:40 +02:00
|
|
|
char *tmp_buf = NULL;
|
2007-07-13 02:33:32 +02:00
|
|
|
char *end_of_smb;
|
2009-05-01 02:45:45 +02:00
|
|
|
unsigned int max_len;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2012-06-20 09:21:16 +02:00
|
|
|
xid = get_xid();
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2010-10-01 17:53:33 +02:00
|
|
|
/*
|
|
|
|
* Ensure FindFirst doesn't fail before doing filldir() for '.' and
|
|
|
|
* '..'. Otherwise we won't be able to notify VFS in case of failure.
|
|
|
|
*/
|
|
|
|
if (file->private_data == NULL) {
|
|
|
|
rc = initiate_cifs_search(xid, file);
|
2013-05-05 05:12:25 +02:00
|
|
|
cifs_dbg(FYI, "initiate cifs search rc %d\n", rc);
|
2010-10-01 17:53:33 +02:00
|
|
|
if (rc)
|
|
|
|
goto rddir2_exit;
|
|
|
|
}
|
|
|
|
|
2013-05-22 22:17:25 +02:00
|
|
|
if (!dir_emit_dots(file, ctx))
|
|
|
|
goto rddir2_exit;
|
2005-04-17 00:20:36 +02:00
|
|
|
|
2013-05-22 22:17:25 +02:00
|
|
|
/* 1) If search is active,
|
|
|
|
is in current search buffer?
|
|
|
|
if it before then restart search
|
|
|
|
if after then keep searching till find it */
|
|
|
|
|
|
|
|
cifsFile = file->private_data;
|
|
|
|
if (cifsFile->srch_inf.endOfSearch) {
|
|
|
|
if (cifsFile->srch_inf.emptyDir) {
|
|
|
|
cifs_dbg(FYI, "End of search, empty dir\n");
|
|
|
|
rc = 0;
|
2005-04-17 00:20:36 +02:00
|
|
|
goto rddir2_exit;
|
|
|
|
}
|
2013-05-22 22:17:25 +02:00
|
|
|
} /* else {
|
|
|
|
cifsFile->invalidHandle = true;
|
|
|
|
tcon->ses->server->close(xid, tcon, &cifsFile->fid);
|
|
|
|
} */
|
|
|
|
|
|
|
|
tcon = tlink_tcon(cifsFile->tlink);
|
|
|
|
rc = find_cifs_entry(xid, tcon, ctx->pos, file, ¤t_entry,
|
|
|
|
&num_to_fill);
|
|
|
|
if (rc) {
|
|
|
|
cifs_dbg(FYI, "fce error %d\n", rc);
|
|
|
|
goto rddir2_exit;
|
|
|
|
} else if (current_entry != NULL) {
|
|
|
|
cifs_dbg(FYI, "entry %lld found\n", ctx->pos);
|
|
|
|
} else {
|
|
|
|
cifs_dbg(FYI, "could not find entry\n");
|
|
|
|
goto rddir2_exit;
|
|
|
|
}
|
|
|
|
cifs_dbg(FYI, "loop through %d times filling dir for net buf %p\n",
|
|
|
|
num_to_fill, cifsFile->srch_inf.ntwrk_buf_start);
|
|
|
|
max_len = tcon->ses->server->ops->calc_smb_size(
|
|
|
|
cifsFile->srch_inf.ntwrk_buf_start);
|
|
|
|
end_of_smb = cifsFile->srch_inf.ntwrk_buf_start + max_len;
|
|
|
|
|
|
|
|
tmp_buf = kmalloc(UNICODE_NAME_MAX, GFP_KERNEL);
|
|
|
|
if (tmp_buf == NULL) {
|
|
|
|
rc = -ENOMEM;
|
|
|
|
goto rddir2_exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < num_to_fill; i++) {
|
|
|
|
if (current_entry == NULL) {
|
|
|
|
/* evaluate whether this case is an error */
|
|
|
|
cifs_dbg(VFS, "past SMB end, num to fill %d i %d\n",
|
|
|
|
num_to_fill, i);
|
2010-07-16 18:15:25 +02:00
|
|
|
break;
|
|
|
|
}
|
2013-05-22 22:17:25 +02:00
|
|
|
/*
|
|
|
|
* if buggy server returns . and .. late do we want to
|
|
|
|
* check for that here?
|
|
|
|
*/
|
2016-01-14 11:41:14 +01:00
|
|
|
*tmp_buf = 0;
|
2013-05-22 22:17:25 +02:00
|
|
|
rc = cifs_filldir(current_entry, file, ctx,
|
|
|
|
tmp_buf, max_len);
|
|
|
|
if (rc) {
|
|
|
|
if (rc > 0)
|
2006-10-30 22:42:57 +01:00
|
|
|
rc = 0;
|
2013-05-22 22:17:25 +02:00
|
|
|
break;
|
2005-04-17 00:20:36 +02:00
|
|
|
}
|
2013-05-22 22:17:25 +02:00
|
|
|
|
|
|
|
ctx->pos++;
|
|
|
|
if (ctx->pos ==
|
|
|
|
cifsFile->srch_inf.index_of_last_entry) {
|
|
|
|
cifs_dbg(FYI, "last entry in buf at pos %lld %s\n",
|
|
|
|
ctx->pos, tmp_buf);
|
|
|
|
cifs_save_resume_key(current_entry, cifsFile);
|
|
|
|
break;
|
|
|
|
} else
|
|
|
|
current_entry =
|
|
|
|
nxt_dir_entry(current_entry, end_of_smb,
|
|
|
|
cifsFile->srch_inf.info_level);
|
|
|
|
}
|
|
|
|
kfree(tmp_buf);
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
rddir2_exit:
|
2012-06-20 09:21:16 +02:00
|
|
|
free_xid(xid);
|
2005-04-17 00:20:36 +02:00
|
|
|
return rc;
|
|
|
|
}
|