mirror of
https://mirrors.bfsu.edu.cn/git/linux.git
synced 2024-12-15 15:04:27 +08:00
b24413180f
Many source files in the tree are missing licensing information, which makes it harder for compliance tools to determine the correct license. By default all files without license information are under the default license of the kernel, which is GPL version 2. Update the files which contain no license information with the 'GPL-2.0' SPDX license identifier. The SPDX identifier is a legally binding shorthand, which can be used instead of the full boiler plate text. This patch is based on work done by Thomas Gleixner and Kate Stewart and Philippe Ombredanne. How this work was done: Patches were generated and checked against linux-4.14-rc6 for a subset of the use cases: - file had no licensing information it it. - file was a */uapi/* one with no licensing information in it, - file was a */uapi/* one with existing licensing information, Further patches will be generated in subsequent months to fix up cases where non-standard license headers were used, and references to license had to be inferred by heuristics based on keywords. The analysis to determine which SPDX License Identifier to be applied to a file was done in a spreadsheet of side by side results from of the output of two independent scanners (ScanCode & Windriver) producing SPDX tag:value files created by Philippe Ombredanne. Philippe prepared the base worksheet, and did an initial spot review of a few 1000 files. The 4.13 kernel was the starting point of the analysis with 60,537 files assessed. Kate Stewart did a file by file comparison of the scanner results in the spreadsheet to determine which SPDX license identifier(s) to be applied to the file. She confirmed any determination that was not immediately clear with lawyers working with the Linux Foundation. Criteria used to select files for SPDX license identifier tagging was: - Files considered eligible had to be source code files. - Make and config files were included as candidates if they contained >5 lines of source - File already had some variant of a license header in it (even if <5 lines). All documentation files were explicitly excluded. The following heuristics were used to determine which SPDX license identifiers to apply. - when both scanners couldn't find any license traces, file was considered to have no license information in it, and the top level COPYING file license applied. For non */uapi/* files that summary was: SPDX license identifier # files ---------------------------------------------------|------- GPL-2.0 11139 and resulted in the first patch in this series. If that file was a */uapi/* path one, it was "GPL-2.0 WITH Linux-syscall-note" otherwise it was "GPL-2.0". Results of that was: SPDX license identifier # files ---------------------------------------------------|------- GPL-2.0 WITH Linux-syscall-note 930 and resulted in the second patch in this series. - if a file had some form of licensing information in it, and was one of the */uapi/* ones, it was denoted with the Linux-syscall-note if any GPL family license was found in the file or had no licensing in it (per prior point). Results summary: SPDX license identifier # files ---------------------------------------------------|------ GPL-2.0 WITH Linux-syscall-note 270 GPL-2.0+ WITH Linux-syscall-note 169 ((GPL-2.0 WITH Linux-syscall-note) OR BSD-2-Clause) 21 ((GPL-2.0 WITH Linux-syscall-note) OR BSD-3-Clause) 17 LGPL-2.1+ WITH Linux-syscall-note 15 GPL-1.0+ WITH Linux-syscall-note 14 ((GPL-2.0+ WITH Linux-syscall-note) OR BSD-3-Clause) 5 LGPL-2.0+ WITH Linux-syscall-note 4 LGPL-2.1 WITH Linux-syscall-note 3 ((GPL-2.0 WITH Linux-syscall-note) OR MIT) 3 ((GPL-2.0 WITH Linux-syscall-note) AND MIT) 1 and that resulted in the third patch in this series. - when the two scanners agreed on the detected license(s), that became the concluded license(s). - when there was disagreement between the two scanners (one detected a license but the other didn't, or they both detected different licenses) a manual inspection of the file occurred. - In most cases a manual inspection of the information in the file resulted in a clear resolution of the license that should apply (and which scanner probably needed to revisit its heuristics). - When it was not immediately clear, the license identifier was confirmed with lawyers working with the Linux Foundation. - If there was any question as to the appropriate license identifier, the file was flagged for further research and to be revisited later in time. In total, over 70 hours of logged manual review was done on the spreadsheet to determine the SPDX license identifiers to apply to the source files by Kate, Philippe, Thomas and, in some cases, confirmation by lawyers working with the Linux Foundation. Kate also obtained a third independent scan of the 4.13 code base from FOSSology, and compared selected files where the other two scanners disagreed against that SPDX file, to see if there was new insights. The Windriver scanner is based on an older version of FOSSology in part, so they are related. Thomas did random spot checks in about 500 files from the spreadsheets for the uapi headers and agreed with SPDX license identifier in the files he inspected. For the non-uapi files Thomas did random spot checks in about 15000 files. In initial set of patches against 4.14-rc6, 3 files were found to have copy/paste license identifier errors, and have been fixed to reflect the correct identifier. Additionally Philippe spent 10 hours this week doing a detailed manual inspection and review of the 12,461 patched files from the initial patch version early this week with: - a full scancode scan run, collecting the matched texts, detected license ids and scores - reviewing anything where there was a license detected (about 500+ files) to ensure that the applied SPDX license was correct - reviewing anything where there was no detection but the patch license was not GPL-2.0 WITH Linux-syscall-note to ensure that the applied SPDX license was correct This produced a worksheet with 20 files needing minor correction. This worksheet was then exported into 3 different .csv files for the different types of files to be modified. These .csv files were then reviewed by Greg. Thomas wrote a script to parse the csv files and add the proper SPDX tag to the file, in the format that the file expected. This script was further refined by Greg based on the output to detect more types of files automatically and to distinguish between header and source .c files (which need different comment types.) Finally Greg ran the script using the .csv files to generate the patches. Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org> Reviewed-by: Philippe Ombredanne <pombredanne@nexb.com> Reviewed-by: Thomas Gleixner <tglx@linutronix.de> Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
592 lines
14 KiB
C
592 lines
14 KiB
C
// SPDX-License-Identifier: GPL-2.0
|
|
|
|
/*
|
|
* Directory operations for Coda filesystem
|
|
* Original version: (C) 1996 P. Braam and M. Callahan
|
|
* Rewritten for Linux 2.1. (C) 1997 Carnegie Mellon University
|
|
*
|
|
* Carnegie Mellon encourages users to contribute improvements to
|
|
* the Coda project. Contact Peter Braam (coda@cs.cmu.edu).
|
|
*/
|
|
|
|
#include <linux/types.h>
|
|
#include <linux/kernel.h>
|
|
#include <linux/time.h>
|
|
#include <linux/fs.h>
|
|
#include <linux/slab.h>
|
|
#include <linux/file.h>
|
|
#include <linux/stat.h>
|
|
#include <linux/errno.h>
|
|
#include <linux/string.h>
|
|
#include <linux/spinlock.h>
|
|
#include <linux/namei.h>
|
|
#include <linux/uaccess.h>
|
|
|
|
#include <linux/coda.h>
|
|
#include <linux/coda_psdev.h>
|
|
#include "coda_linux.h"
|
|
#include "coda_cache.h"
|
|
|
|
#include "coda_int.h"
|
|
|
|
/* same as fs/bad_inode.c */
|
|
static int coda_return_EIO(void)
|
|
{
|
|
return -EIO;
|
|
}
|
|
#define CODA_EIO_ERROR ((void *) (coda_return_EIO))
|
|
|
|
/* inode operations for directories */
|
|
/* access routines: lookup, readlink, permission */
|
|
static struct dentry *coda_lookup(struct inode *dir, struct dentry *entry, unsigned int flags)
|
|
{
|
|
struct super_block *sb = dir->i_sb;
|
|
const char *name = entry->d_name.name;
|
|
size_t length = entry->d_name.len;
|
|
struct inode *inode;
|
|
int type = 0;
|
|
|
|
if (length > CODA_MAXNAMLEN) {
|
|
pr_err("name too long: lookup, %s (%*s)\n",
|
|
coda_i2s(dir), (int)length, name);
|
|
return ERR_PTR(-ENAMETOOLONG);
|
|
}
|
|
|
|
/* control object, create inode on the fly */
|
|
if (is_root_inode(dir) && coda_iscontrol(name, length)) {
|
|
inode = coda_cnode_makectl(sb);
|
|
type = CODA_NOCACHE;
|
|
} else {
|
|
struct CodaFid fid = { { 0, } };
|
|
int error = venus_lookup(sb, coda_i2f(dir), name, length,
|
|
&type, &fid);
|
|
inode = !error ? coda_cnode_make(&fid, sb) : ERR_PTR(error);
|
|
}
|
|
|
|
if (!IS_ERR(inode) && (type & CODA_NOCACHE))
|
|
coda_flag_inode(inode, C_VATTR | C_PURGE);
|
|
|
|
if (inode == ERR_PTR(-ENOENT))
|
|
inode = NULL;
|
|
|
|
return d_splice_alias(inode, entry);
|
|
}
|
|
|
|
|
|
int coda_permission(struct inode *inode, int mask)
|
|
{
|
|
int error;
|
|
|
|
if (mask & MAY_NOT_BLOCK)
|
|
return -ECHILD;
|
|
|
|
mask &= MAY_READ | MAY_WRITE | MAY_EXEC;
|
|
|
|
if (!mask)
|
|
return 0;
|
|
|
|
if ((mask & MAY_EXEC) && !execute_ok(inode))
|
|
return -EACCES;
|
|
|
|
if (coda_cache_check(inode, mask))
|
|
return 0;
|
|
|
|
error = venus_access(inode->i_sb, coda_i2f(inode), mask);
|
|
|
|
if (!error)
|
|
coda_cache_enter(inode, mask);
|
|
|
|
return error;
|
|
}
|
|
|
|
|
|
static inline void coda_dir_update_mtime(struct inode *dir)
|
|
{
|
|
#ifdef REQUERY_VENUS_FOR_MTIME
|
|
/* invalidate the directory cnode's attributes so we refetch the
|
|
* attributes from venus next time the inode is referenced */
|
|
coda_flag_inode(dir, C_VATTR);
|
|
#else
|
|
/* optimistically we can also act as if our nose bleeds. The
|
|
* granularity of the mtime is coarse anyways so we might actually be
|
|
* right most of the time. Note: we only do this for directories. */
|
|
dir->i_mtime = dir->i_ctime = current_time(dir);
|
|
#endif
|
|
}
|
|
|
|
/* we have to wrap inc_nlink/drop_nlink because sometimes userspace uses a
|
|
* trick to fool GNU find's optimizations. If we can't be sure of the link
|
|
* (because of volume mount points) we set i_nlink to 1 which forces find
|
|
* to consider every child as a possible directory. We should also never
|
|
* see an increment or decrement for deleted directories where i_nlink == 0 */
|
|
static inline void coda_dir_inc_nlink(struct inode *dir)
|
|
{
|
|
if (dir->i_nlink >= 2)
|
|
inc_nlink(dir);
|
|
}
|
|
|
|
static inline void coda_dir_drop_nlink(struct inode *dir)
|
|
{
|
|
if (dir->i_nlink > 2)
|
|
drop_nlink(dir);
|
|
}
|
|
|
|
/* creation routines: create, mknod, mkdir, link, symlink */
|
|
static int coda_create(struct inode *dir, struct dentry *de, umode_t mode, bool excl)
|
|
{
|
|
int error;
|
|
const char *name=de->d_name.name;
|
|
int length=de->d_name.len;
|
|
struct inode *inode;
|
|
struct CodaFid newfid;
|
|
struct coda_vattr attrs;
|
|
|
|
if (is_root_inode(dir) && coda_iscontrol(name, length))
|
|
return -EPERM;
|
|
|
|
error = venus_create(dir->i_sb, coda_i2f(dir), name, length,
|
|
0, mode, &newfid, &attrs);
|
|
if (error)
|
|
goto err_out;
|
|
|
|
inode = coda_iget(dir->i_sb, &newfid, &attrs);
|
|
if (IS_ERR(inode)) {
|
|
error = PTR_ERR(inode);
|
|
goto err_out;
|
|
}
|
|
|
|
/* invalidate the directory cnode's attributes */
|
|
coda_dir_update_mtime(dir);
|
|
d_instantiate(de, inode);
|
|
return 0;
|
|
err_out:
|
|
d_drop(de);
|
|
return error;
|
|
}
|
|
|
|
static int coda_mkdir(struct inode *dir, struct dentry *de, umode_t mode)
|
|
{
|
|
struct inode *inode;
|
|
struct coda_vattr attrs;
|
|
const char *name = de->d_name.name;
|
|
int len = de->d_name.len;
|
|
int error;
|
|
struct CodaFid newfid;
|
|
|
|
if (is_root_inode(dir) && coda_iscontrol(name, len))
|
|
return -EPERM;
|
|
|
|
attrs.va_mode = mode;
|
|
error = venus_mkdir(dir->i_sb, coda_i2f(dir),
|
|
name, len, &newfid, &attrs);
|
|
if (error)
|
|
goto err_out;
|
|
|
|
inode = coda_iget(dir->i_sb, &newfid, &attrs);
|
|
if (IS_ERR(inode)) {
|
|
error = PTR_ERR(inode);
|
|
goto err_out;
|
|
}
|
|
|
|
/* invalidate the directory cnode's attributes */
|
|
coda_dir_inc_nlink(dir);
|
|
coda_dir_update_mtime(dir);
|
|
d_instantiate(de, inode);
|
|
return 0;
|
|
err_out:
|
|
d_drop(de);
|
|
return error;
|
|
}
|
|
|
|
/* try to make de an entry in dir_inodde linked to source_de */
|
|
static int coda_link(struct dentry *source_de, struct inode *dir_inode,
|
|
struct dentry *de)
|
|
{
|
|
struct inode *inode = d_inode(source_de);
|
|
const char * name = de->d_name.name;
|
|
int len = de->d_name.len;
|
|
int error;
|
|
|
|
if (is_root_inode(dir_inode) && coda_iscontrol(name, len))
|
|
return -EPERM;
|
|
|
|
error = venus_link(dir_inode->i_sb, coda_i2f(inode),
|
|
coda_i2f(dir_inode), (const char *)name, len);
|
|
if (error) {
|
|
d_drop(de);
|
|
return error;
|
|
}
|
|
|
|
coda_dir_update_mtime(dir_inode);
|
|
ihold(inode);
|
|
d_instantiate(de, inode);
|
|
inc_nlink(inode);
|
|
return 0;
|
|
}
|
|
|
|
|
|
static int coda_symlink(struct inode *dir_inode, struct dentry *de,
|
|
const char *symname)
|
|
{
|
|
const char *name = de->d_name.name;
|
|
int len = de->d_name.len;
|
|
int symlen;
|
|
int error;
|
|
|
|
if (is_root_inode(dir_inode) && coda_iscontrol(name, len))
|
|
return -EPERM;
|
|
|
|
symlen = strlen(symname);
|
|
if (symlen > CODA_MAXPATHLEN)
|
|
return -ENAMETOOLONG;
|
|
|
|
/*
|
|
* This entry is now negative. Since we do not create
|
|
* an inode for the entry we have to drop it.
|
|
*/
|
|
d_drop(de);
|
|
error = venus_symlink(dir_inode->i_sb, coda_i2f(dir_inode), name, len,
|
|
symname, symlen);
|
|
|
|
/* mtime is no good anymore */
|
|
if (!error)
|
|
coda_dir_update_mtime(dir_inode);
|
|
|
|
return error;
|
|
}
|
|
|
|
/* destruction routines: unlink, rmdir */
|
|
static int coda_unlink(struct inode *dir, struct dentry *de)
|
|
{
|
|
int error;
|
|
const char *name = de->d_name.name;
|
|
int len = de->d_name.len;
|
|
|
|
error = venus_remove(dir->i_sb, coda_i2f(dir), name, len);
|
|
if (error)
|
|
return error;
|
|
|
|
coda_dir_update_mtime(dir);
|
|
drop_nlink(d_inode(de));
|
|
return 0;
|
|
}
|
|
|
|
static int coda_rmdir(struct inode *dir, struct dentry *de)
|
|
{
|
|
const char *name = de->d_name.name;
|
|
int len = de->d_name.len;
|
|
int error;
|
|
|
|
error = venus_rmdir(dir->i_sb, coda_i2f(dir), name, len);
|
|
if (!error) {
|
|
/* VFS may delete the child */
|
|
if (d_really_is_positive(de))
|
|
clear_nlink(d_inode(de));
|
|
|
|
/* fix the link count of the parent */
|
|
coda_dir_drop_nlink(dir);
|
|
coda_dir_update_mtime(dir);
|
|
}
|
|
return error;
|
|
}
|
|
|
|
/* rename */
|
|
static int coda_rename(struct inode *old_dir, struct dentry *old_dentry,
|
|
struct inode *new_dir, struct dentry *new_dentry,
|
|
unsigned int flags)
|
|
{
|
|
const char *old_name = old_dentry->d_name.name;
|
|
const char *new_name = new_dentry->d_name.name;
|
|
int old_length = old_dentry->d_name.len;
|
|
int new_length = new_dentry->d_name.len;
|
|
int error;
|
|
|
|
if (flags)
|
|
return -EINVAL;
|
|
|
|
error = venus_rename(old_dir->i_sb, coda_i2f(old_dir),
|
|
coda_i2f(new_dir), old_length, new_length,
|
|
(const char *) old_name, (const char *)new_name);
|
|
if (!error) {
|
|
if (d_really_is_positive(new_dentry)) {
|
|
if (d_is_dir(new_dentry)) {
|
|
coda_dir_drop_nlink(old_dir);
|
|
coda_dir_inc_nlink(new_dir);
|
|
}
|
|
coda_dir_update_mtime(old_dir);
|
|
coda_dir_update_mtime(new_dir);
|
|
coda_flag_inode(d_inode(new_dentry), C_VATTR);
|
|
} else {
|
|
coda_flag_inode(old_dir, C_VATTR);
|
|
coda_flag_inode(new_dir, C_VATTR);
|
|
}
|
|
}
|
|
return error;
|
|
}
|
|
|
|
static inline unsigned int CDT2DT(unsigned char cdt)
|
|
{
|
|
unsigned int dt;
|
|
|
|
switch(cdt) {
|
|
case CDT_UNKNOWN: dt = DT_UNKNOWN; break;
|
|
case CDT_FIFO: dt = DT_FIFO; break;
|
|
case CDT_CHR: dt = DT_CHR; break;
|
|
case CDT_DIR: dt = DT_DIR; break;
|
|
case CDT_BLK: dt = DT_BLK; break;
|
|
case CDT_REG: dt = DT_REG; break;
|
|
case CDT_LNK: dt = DT_LNK; break;
|
|
case CDT_SOCK: dt = DT_SOCK; break;
|
|
case CDT_WHT: dt = DT_WHT; break;
|
|
default: dt = DT_UNKNOWN; break;
|
|
}
|
|
return dt;
|
|
}
|
|
|
|
/* support routines */
|
|
static int coda_venus_readdir(struct file *coda_file, struct dir_context *ctx)
|
|
{
|
|
struct coda_file_info *cfi;
|
|
struct coda_inode_info *cii;
|
|
struct file *host_file;
|
|
struct venus_dirent *vdir;
|
|
unsigned long vdir_size = offsetof(struct venus_dirent, d_name);
|
|
unsigned int type;
|
|
struct qstr name;
|
|
ino_t ino;
|
|
int ret;
|
|
|
|
cfi = CODA_FTOC(coda_file);
|
|
BUG_ON(!cfi || cfi->cfi_magic != CODA_MAGIC);
|
|
host_file = cfi->cfi_container;
|
|
|
|
cii = ITOC(file_inode(coda_file));
|
|
|
|
vdir = kmalloc(sizeof(*vdir), GFP_KERNEL);
|
|
if (!vdir) return -ENOMEM;
|
|
|
|
if (!dir_emit_dots(coda_file, ctx))
|
|
goto out;
|
|
|
|
while (1) {
|
|
loff_t pos = ctx->pos - 2;
|
|
|
|
/* read entries from the directory file */
|
|
ret = kernel_read(host_file, vdir, sizeof(*vdir), &pos);
|
|
if (ret < 0) {
|
|
pr_err("%s: read dir %s failed %d\n",
|
|
__func__, coda_f2s(&cii->c_fid), ret);
|
|
break;
|
|
}
|
|
if (ret == 0) break; /* end of directory file reached */
|
|
|
|
/* catch truncated reads */
|
|
if (ret < vdir_size || ret < vdir_size + vdir->d_namlen) {
|
|
pr_err("%s: short read on %s\n",
|
|
__func__, coda_f2s(&cii->c_fid));
|
|
ret = -EBADF;
|
|
break;
|
|
}
|
|
/* validate whether the directory file actually makes sense */
|
|
if (vdir->d_reclen < vdir_size + vdir->d_namlen) {
|
|
pr_err("%s: invalid dir %s\n",
|
|
__func__, coda_f2s(&cii->c_fid));
|
|
ret = -EBADF;
|
|
break;
|
|
}
|
|
|
|
name.len = vdir->d_namlen;
|
|
name.name = vdir->d_name;
|
|
|
|
/* Make sure we skip '.' and '..', we already got those */
|
|
if (name.name[0] == '.' && (name.len == 1 ||
|
|
(name.name[1] == '.' && name.len == 2)))
|
|
vdir->d_fileno = name.len = 0;
|
|
|
|
/* skip null entries */
|
|
if (vdir->d_fileno && name.len) {
|
|
ino = vdir->d_fileno;
|
|
type = CDT2DT(vdir->d_type);
|
|
if (!dir_emit(ctx, name.name, name.len, ino, type))
|
|
break;
|
|
}
|
|
/* we'll always have progress because d_reclen is unsigned and
|
|
* we've already established it is non-zero. */
|
|
ctx->pos += vdir->d_reclen;
|
|
}
|
|
out:
|
|
kfree(vdir);
|
|
return 0;
|
|
}
|
|
|
|
/* file operations for directories */
|
|
static int coda_readdir(struct file *coda_file, struct dir_context *ctx)
|
|
{
|
|
struct coda_file_info *cfi;
|
|
struct file *host_file;
|
|
int ret;
|
|
|
|
cfi = CODA_FTOC(coda_file);
|
|
BUG_ON(!cfi || cfi->cfi_magic != CODA_MAGIC);
|
|
host_file = cfi->cfi_container;
|
|
|
|
if (host_file->f_op->iterate || host_file->f_op->iterate_shared) {
|
|
struct inode *host_inode = file_inode(host_file);
|
|
ret = -ENOENT;
|
|
if (!IS_DEADDIR(host_inode)) {
|
|
if (host_file->f_op->iterate_shared) {
|
|
inode_lock_shared(host_inode);
|
|
ret = host_file->f_op->iterate_shared(host_file, ctx);
|
|
file_accessed(host_file);
|
|
inode_unlock_shared(host_inode);
|
|
} else {
|
|
inode_lock(host_inode);
|
|
ret = host_file->f_op->iterate(host_file, ctx);
|
|
file_accessed(host_file);
|
|
inode_unlock(host_inode);
|
|
}
|
|
}
|
|
return ret;
|
|
}
|
|
/* Venus: we must read Venus dirents from a file */
|
|
return coda_venus_readdir(coda_file, ctx);
|
|
}
|
|
|
|
/* called when a cache lookup succeeds */
|
|
static int coda_dentry_revalidate(struct dentry *de, unsigned int flags)
|
|
{
|
|
struct inode *inode;
|
|
struct coda_inode_info *cii;
|
|
|
|
if (flags & LOOKUP_RCU)
|
|
return -ECHILD;
|
|
|
|
inode = d_inode(de);
|
|
if (!inode || is_root_inode(inode))
|
|
goto out;
|
|
if (is_bad_inode(inode))
|
|
goto bad;
|
|
|
|
cii = ITOC(d_inode(de));
|
|
if (!(cii->c_flags & (C_PURGE | C_FLUSH)))
|
|
goto out;
|
|
|
|
shrink_dcache_parent(de);
|
|
|
|
/* propagate for a flush */
|
|
if (cii->c_flags & C_FLUSH)
|
|
coda_flag_inode_children(inode, C_FLUSH);
|
|
|
|
if (d_count(de) > 1)
|
|
/* pretend it's valid, but don't change the flags */
|
|
goto out;
|
|
|
|
/* clear the flags. */
|
|
spin_lock(&cii->c_lock);
|
|
cii->c_flags &= ~(C_VATTR | C_PURGE | C_FLUSH);
|
|
spin_unlock(&cii->c_lock);
|
|
bad:
|
|
return 0;
|
|
out:
|
|
return 1;
|
|
}
|
|
|
|
/*
|
|
* This is the callback from dput() when d_count is going to 0.
|
|
* We use this to unhash dentries with bad inodes.
|
|
*/
|
|
static int coda_dentry_delete(const struct dentry * dentry)
|
|
{
|
|
int flags;
|
|
|
|
if (d_really_is_negative(dentry))
|
|
return 0;
|
|
|
|
flags = (ITOC(d_inode(dentry))->c_flags) & C_PURGE;
|
|
if (is_bad_inode(d_inode(dentry)) || flags) {
|
|
return 1;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
* This is called when we want to check if the inode has
|
|
* changed on the server. Coda makes this easy since the
|
|
* cache manager Venus issues a downcall to the kernel when this
|
|
* happens
|
|
*/
|
|
int coda_revalidate_inode(struct inode *inode)
|
|
{
|
|
struct coda_vattr attr;
|
|
int error;
|
|
int old_mode;
|
|
ino_t old_ino;
|
|
struct coda_inode_info *cii = ITOC(inode);
|
|
|
|
if (!cii->c_flags)
|
|
return 0;
|
|
|
|
if (cii->c_flags & (C_VATTR | C_PURGE | C_FLUSH)) {
|
|
error = venus_getattr(inode->i_sb, &(cii->c_fid), &attr);
|
|
if (error)
|
|
return -EIO;
|
|
|
|
/* this inode may be lost if:
|
|
- it's ino changed
|
|
- type changes must be permitted for repair and
|
|
missing mount points.
|
|
*/
|
|
old_mode = inode->i_mode;
|
|
old_ino = inode->i_ino;
|
|
coda_vattr_to_iattr(inode, &attr);
|
|
|
|
if ((old_mode & S_IFMT) != (inode->i_mode & S_IFMT)) {
|
|
pr_warn("inode %ld, fid %s changed type!\n",
|
|
inode->i_ino, coda_f2s(&(cii->c_fid)));
|
|
}
|
|
|
|
/* the following can happen when a local fid is replaced
|
|
with a global one, here we lose and declare the inode bad */
|
|
if (inode->i_ino != old_ino)
|
|
return -EIO;
|
|
|
|
coda_flag_inode_children(inode, C_FLUSH);
|
|
|
|
spin_lock(&cii->c_lock);
|
|
cii->c_flags &= ~(C_VATTR | C_PURGE | C_FLUSH);
|
|
spin_unlock(&cii->c_lock);
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
const struct dentry_operations coda_dentry_operations = {
|
|
.d_revalidate = coda_dentry_revalidate,
|
|
.d_delete = coda_dentry_delete,
|
|
};
|
|
|
|
const struct inode_operations coda_dir_inode_operations = {
|
|
.create = coda_create,
|
|
.lookup = coda_lookup,
|
|
.link = coda_link,
|
|
.unlink = coda_unlink,
|
|
.symlink = coda_symlink,
|
|
.mkdir = coda_mkdir,
|
|
.rmdir = coda_rmdir,
|
|
.mknod = CODA_EIO_ERROR,
|
|
.rename = coda_rename,
|
|
.permission = coda_permission,
|
|
.getattr = coda_getattr,
|
|
.setattr = coda_setattr,
|
|
};
|
|
|
|
const struct file_operations coda_dir_operations = {
|
|
.llseek = generic_file_llseek,
|
|
.read = generic_read_dir,
|
|
.iterate = coda_readdir,
|
|
.open = coda_open,
|
|
.release = coda_release,
|
|
.fsync = coda_fsync,
|
|
};
|