2005-04-16 22:20:36 +00:00
|
|
|
/* -*- c -*- --------------------------------------------------------------- *
|
|
|
|
*
|
|
|
|
* linux/fs/autofs/inode.c
|
|
|
|
*
|
|
|
|
* Copyright 1997-1998 Transmeta Corporation -- All Rights Reserved
|
|
|
|
*
|
|
|
|
* This file is part of the Linux kernel and is made available under
|
|
|
|
* the terms of the GNU General Public License, version 2, or at your
|
|
|
|
* option, any later version, incorporated herein by reference.
|
|
|
|
*
|
|
|
|
* ------------------------------------------------------------------------- */
|
|
|
|
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/slab.h>
|
|
|
|
#include <linux/file.h>
|
|
|
|
#include <linux/pagemap.h>
|
|
|
|
#include <linux/parser.h>
|
|
|
|
#include <linux/bitops.h>
|
2005-07-27 18:43:45 +00:00
|
|
|
#include <linux/smp_lock.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include "autofs_i.h"
|
|
|
|
#include <linux/module.h>
|
|
|
|
|
|
|
|
static void ino_lnkfree(struct autofs_info *ino)
|
|
|
|
{
|
2005-11-07 09:01:34 +00:00
|
|
|
kfree(ino->u.symlink);
|
|
|
|
ino->u.symlink = NULL;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
struct autofs_info *autofs4_init_ino(struct autofs_info *ino,
|
|
|
|
struct autofs_sb_info *sbi, mode_t mode)
|
|
|
|
{
|
|
|
|
int reinit = 1;
|
|
|
|
|
|
|
|
if (ino == NULL) {
|
|
|
|
reinit = 0;
|
|
|
|
ino = kmalloc(sizeof(*ino), GFP_KERNEL);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ino == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
ino->flags = 0;
|
|
|
|
ino->mode = mode;
|
|
|
|
ino->inode = NULL;
|
|
|
|
ino->dentry = NULL;
|
|
|
|
ino->size = 0;
|
|
|
|
|
|
|
|
ino->last_used = jiffies;
|
2006-03-27 09:14:46 +00:00
|
|
|
atomic_set(&ino->count, 0);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
ino->sbi = sbi;
|
|
|
|
|
|
|
|
if (reinit && ino->free)
|
|
|
|
(ino->free)(ino);
|
|
|
|
|
|
|
|
memset(&ino->u, 0, sizeof(ino->u));
|
|
|
|
|
|
|
|
ino->free = NULL;
|
|
|
|
|
|
|
|
if (S_ISLNK(mode))
|
|
|
|
ino->free = ino_lnkfree;
|
|
|
|
|
|
|
|
return ino;
|
|
|
|
}
|
|
|
|
|
|
|
|
void autofs4_free_ino(struct autofs_info *ino)
|
|
|
|
{
|
2006-03-27 09:14:46 +00:00
|
|
|
struct autofs_info *p_ino;
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
if (ino->dentry) {
|
|
|
|
ino->dentry->d_fsdata = NULL;
|
2006-03-27 09:14:46 +00:00
|
|
|
if (ino->dentry->d_inode) {
|
|
|
|
struct dentry *parent = ino->dentry->d_parent;
|
|
|
|
if (atomic_dec_and_test(&ino->count)) {
|
|
|
|
p_ino = autofs4_dentry_ino(parent);
|
|
|
|
if (p_ino && parent != ino->dentry)
|
|
|
|
atomic_dec(&p_ino->count);
|
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
dput(ino->dentry);
|
2006-03-27 09:14:46 +00:00
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
ino->dentry = NULL;
|
|
|
|
}
|
|
|
|
if (ino->free)
|
|
|
|
(ino->free)(ino);
|
|
|
|
kfree(ino);
|
|
|
|
}
|
|
|
|
|
2005-07-27 18:43:45 +00:00
|
|
|
/*
|
|
|
|
* Deal with the infamous "Busy inodes after umount ..." message.
|
|
|
|
*
|
|
|
|
* Clean up the dentry tree. This happens with autofs if the user
|
|
|
|
* space program goes away due to a SIGKILL, SIGSEGV etc.
|
|
|
|
*/
|
|
|
|
static void autofs4_force_release(struct autofs_sb_info *sbi)
|
|
|
|
{
|
|
|
|
struct dentry *this_parent = sbi->root;
|
|
|
|
struct list_head *next;
|
|
|
|
|
|
|
|
spin_lock(&dcache_lock);
|
|
|
|
repeat:
|
|
|
|
next = this_parent->d_subdirs.next;
|
|
|
|
resume:
|
|
|
|
while (next != &this_parent->d_subdirs) {
|
[PATCH] shrink dentry struct
Some long time ago, dentry struct was carefully tuned so that on 32 bits
UP, sizeof(struct dentry) was exactly 128, ie a power of 2, and a multiple
of memory cache lines.
Then RCU was added and dentry struct enlarged by two pointers, with nice
results for SMP, but not so good on UP, because breaking the above tuning
(128 + 8 = 136 bytes)
This patch reverts this unwanted side effect, by using an union (d_u),
where d_rcu and d_child are placed so that these two fields can share their
memory needs.
At the time d_free() is called (and d_rcu is really used), d_child is known
to be empty and not touched by the dentry freeing.
Lockless lookups only access d_name, d_parent, d_lock, d_op, d_flags (so
the previous content of d_child is not needed if said dentry was unhashed
but still accessed by a CPU because of RCU constraints)
As dentry cache easily contains millions of entries, a size reduction is
worth the extra complexity of the ugly C union.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Cc: Dipankar Sarma <dipankar@in.ibm.com>
Cc: Maneesh Soni <maneesh@in.ibm.com>
Cc: Miklos Szeredi <miklos@szeredi.hu>
Cc: "Paul E. McKenney" <paulmck@us.ibm.com>
Cc: Ian Kent <raven@themaw.net>
Cc: Paul Jackson <pj@sgi.com>
Cc: Al Viro <viro@ftp.linux.org.uk>
Cc: Christoph Hellwig <hch@lst.de>
Cc: Trond Myklebust <trond.myklebust@fys.uio.no>
Cc: Neil Brown <neilb@cse.unsw.edu.au>
Cc: James Morris <jmorris@namei.org>
Cc: Stephen Smalley <sds@epoch.ncsc.mil>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-01-08 09:03:32 +00:00
|
|
|
struct dentry *dentry = list_entry(next, struct dentry, d_u.d_child);
|
2005-07-27 18:43:45 +00:00
|
|
|
|
|
|
|
/* Negative dentry - don`t care */
|
|
|
|
if (!simple_positive(dentry)) {
|
|
|
|
next = next->next;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!list_empty(&dentry->d_subdirs)) {
|
|
|
|
this_parent = dentry;
|
|
|
|
goto repeat;
|
|
|
|
}
|
|
|
|
|
|
|
|
next = next->next;
|
|
|
|
spin_unlock(&dcache_lock);
|
|
|
|
|
|
|
|
DPRINTK("dentry %p %.*s",
|
|
|
|
dentry, (int)dentry->d_name.len, dentry->d_name.name);
|
|
|
|
|
|
|
|
dput(dentry);
|
|
|
|
spin_lock(&dcache_lock);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (this_parent != sbi->root) {
|
|
|
|
struct dentry *dentry = this_parent;
|
|
|
|
|
[PATCH] shrink dentry struct
Some long time ago, dentry struct was carefully tuned so that on 32 bits
UP, sizeof(struct dentry) was exactly 128, ie a power of 2, and a multiple
of memory cache lines.
Then RCU was added and dentry struct enlarged by two pointers, with nice
results for SMP, but not so good on UP, because breaking the above tuning
(128 + 8 = 136 bytes)
This patch reverts this unwanted side effect, by using an union (d_u),
where d_rcu and d_child are placed so that these two fields can share their
memory needs.
At the time d_free() is called (and d_rcu is really used), d_child is known
to be empty and not touched by the dentry freeing.
Lockless lookups only access d_name, d_parent, d_lock, d_op, d_flags (so
the previous content of d_child is not needed if said dentry was unhashed
but still accessed by a CPU because of RCU constraints)
As dentry cache easily contains millions of entries, a size reduction is
worth the extra complexity of the ugly C union.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Cc: Dipankar Sarma <dipankar@in.ibm.com>
Cc: Maneesh Soni <maneesh@in.ibm.com>
Cc: Miklos Szeredi <miklos@szeredi.hu>
Cc: "Paul E. McKenney" <paulmck@us.ibm.com>
Cc: Ian Kent <raven@themaw.net>
Cc: Paul Jackson <pj@sgi.com>
Cc: Al Viro <viro@ftp.linux.org.uk>
Cc: Christoph Hellwig <hch@lst.de>
Cc: Trond Myklebust <trond.myklebust@fys.uio.no>
Cc: Neil Brown <neilb@cse.unsw.edu.au>
Cc: James Morris <jmorris@namei.org>
Cc: Stephen Smalley <sds@epoch.ncsc.mil>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-01-08 09:03:32 +00:00
|
|
|
next = this_parent->d_u.d_child.next;
|
2005-07-27 18:43:45 +00:00
|
|
|
this_parent = this_parent->d_parent;
|
|
|
|
spin_unlock(&dcache_lock);
|
|
|
|
DPRINTK("parent dentry %p %.*s",
|
|
|
|
dentry, (int)dentry->d_name.len, dentry->d_name.name);
|
|
|
|
dput(dentry);
|
|
|
|
spin_lock(&dcache_lock);
|
|
|
|
goto resume;
|
|
|
|
}
|
|
|
|
spin_unlock(&dcache_lock);
|
|
|
|
|
|
|
|
dput(sbi->root);
|
|
|
|
sbi->root = NULL;
|
|
|
|
shrink_dcache_sb(sbi->sb);
|
|
|
|
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
static void autofs4_put_super(struct super_block *sb)
|
|
|
|
{
|
|
|
|
struct autofs_sb_info *sbi = autofs4_sbi(sb);
|
|
|
|
|
|
|
|
sb->s_fs_info = NULL;
|
|
|
|
|
|
|
|
if ( !sbi->catatonic )
|
|
|
|
autofs4_catatonic_mode(sbi); /* Free wait queues, close pipe */
|
|
|
|
|
2005-07-27 18:43:45 +00:00
|
|
|
/* Clean up and release dangling references */
|
|
|
|
if (sbi)
|
|
|
|
autofs4_force_release(sbi);
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
kfree(sbi);
|
|
|
|
|
|
|
|
DPRINTK("shutting down");
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct super_operations autofs4_sops = {
|
|
|
|
.put_super = autofs4_put_super,
|
|
|
|
.statfs = simple_statfs,
|
|
|
|
};
|
|
|
|
|
|
|
|
enum {Opt_err, Opt_fd, Opt_uid, Opt_gid, Opt_pgrp, Opt_minproto, Opt_maxproto};
|
|
|
|
|
|
|
|
static match_table_t tokens = {
|
|
|
|
{Opt_fd, "fd=%u"},
|
|
|
|
{Opt_uid, "uid=%u"},
|
|
|
|
{Opt_gid, "gid=%u"},
|
|
|
|
{Opt_pgrp, "pgrp=%u"},
|
|
|
|
{Opt_minproto, "minproto=%u"},
|
|
|
|
{Opt_maxproto, "maxproto=%u"},
|
|
|
|
{Opt_err, NULL}
|
|
|
|
};
|
|
|
|
|
|
|
|
static int parse_options(char *options, int *pipefd, uid_t *uid, gid_t *gid,
|
|
|
|
pid_t *pgrp, int *minproto, int *maxproto)
|
|
|
|
{
|
|
|
|
char *p;
|
|
|
|
substring_t args[MAX_OPT_ARGS];
|
|
|
|
int option;
|
|
|
|
|
|
|
|
*uid = current->uid;
|
|
|
|
*gid = current->gid;
|
|
|
|
*pgrp = process_group(current);
|
|
|
|
|
|
|
|
*minproto = AUTOFS_MIN_PROTO_VERSION;
|
|
|
|
*maxproto = AUTOFS_MAX_PROTO_VERSION;
|
|
|
|
|
|
|
|
*pipefd = -1;
|
|
|
|
|
|
|
|
if (!options)
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
while ((p = strsep(&options, ",")) != NULL) {
|
|
|
|
int token;
|
|
|
|
if (!*p)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
token = match_token(p, tokens, args);
|
|
|
|
switch (token) {
|
|
|
|
case Opt_fd:
|
|
|
|
if (match_int(args, pipefd))
|
|
|
|
return 1;
|
|
|
|
break;
|
|
|
|
case Opt_uid:
|
|
|
|
if (match_int(args, &option))
|
|
|
|
return 1;
|
|
|
|
*uid = option;
|
|
|
|
break;
|
|
|
|
case Opt_gid:
|
|
|
|
if (match_int(args, &option))
|
|
|
|
return 1;
|
|
|
|
*gid = option;
|
|
|
|
break;
|
|
|
|
case Opt_pgrp:
|
|
|
|
if (match_int(args, &option))
|
|
|
|
return 1;
|
|
|
|
*pgrp = option;
|
|
|
|
break;
|
|
|
|
case Opt_minproto:
|
|
|
|
if (match_int(args, &option))
|
|
|
|
return 1;
|
|
|
|
*minproto = option;
|
|
|
|
break;
|
|
|
|
case Opt_maxproto:
|
|
|
|
if (match_int(args, &option))
|
|
|
|
return 1;
|
|
|
|
*maxproto = option;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return (*pipefd < 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct autofs_info *autofs4_mkroot(struct autofs_sb_info *sbi)
|
|
|
|
{
|
|
|
|
struct autofs_info *ino;
|
|
|
|
|
|
|
|
ino = autofs4_init_ino(NULL, sbi, S_IFDIR | 0755);
|
|
|
|
if (!ino)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
return ino;
|
|
|
|
}
|
|
|
|
|
|
|
|
int autofs4_fill_super(struct super_block *s, void *data, int silent)
|
|
|
|
{
|
|
|
|
struct inode * root_inode;
|
|
|
|
struct dentry * root;
|
|
|
|
struct file * pipe;
|
|
|
|
int pipefd;
|
|
|
|
struct autofs_sb_info *sbi;
|
|
|
|
struct autofs_info *ino;
|
|
|
|
int minproto, maxproto;
|
|
|
|
|
|
|
|
sbi = (struct autofs_sb_info *) kmalloc(sizeof(*sbi), GFP_KERNEL);
|
|
|
|
if ( !sbi )
|
|
|
|
goto fail_unlock;
|
|
|
|
DPRINTK("starting up, sbi = %p",sbi);
|
|
|
|
|
|
|
|
memset(sbi, 0, sizeof(*sbi));
|
|
|
|
|
|
|
|
s->s_fs_info = sbi;
|
|
|
|
sbi->magic = AUTOFS_SBI_MAGIC;
|
2005-07-27 18:43:45 +00:00
|
|
|
sbi->root = NULL;
|
2005-04-16 22:20:36 +00:00
|
|
|
sbi->catatonic = 0;
|
|
|
|
sbi->exp_timeout = 0;
|
|
|
|
sbi->oz_pgrp = process_group(current);
|
|
|
|
sbi->sb = s;
|
|
|
|
sbi->version = 0;
|
|
|
|
sbi->sub_version = 0;
|
2006-03-23 11:00:41 +00:00
|
|
|
mutex_init(&sbi->wq_mutex);
|
2005-05-01 15:59:17 +00:00
|
|
|
spin_lock_init(&sbi->fs_lock);
|
2005-04-16 22:20:36 +00:00
|
|
|
sbi->queues = NULL;
|
|
|
|
s->s_blocksize = 1024;
|
|
|
|
s->s_blocksize_bits = 10;
|
|
|
|
s->s_magic = AUTOFS_SUPER_MAGIC;
|
|
|
|
s->s_op = &autofs4_sops;
|
|
|
|
s->s_time_gran = 1;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get the root inode and dentry, but defer checking for errors.
|
|
|
|
*/
|
|
|
|
ino = autofs4_mkroot(sbi);
|
|
|
|
if (!ino)
|
|
|
|
goto fail_free;
|
|
|
|
root_inode = autofs4_get_inode(s, ino);
|
|
|
|
kfree(ino);
|
|
|
|
if (!root_inode)
|
|
|
|
goto fail_free;
|
|
|
|
|
|
|
|
root_inode->i_op = &autofs4_root_inode_operations;
|
|
|
|
root_inode->i_fop = &autofs4_root_operations;
|
|
|
|
root = d_alloc_root(root_inode);
|
|
|
|
pipe = NULL;
|
|
|
|
|
|
|
|
if (!root)
|
|
|
|
goto fail_iput;
|
|
|
|
|
|
|
|
/* Can this call block? */
|
|
|
|
if (parse_options(data, &pipefd,
|
|
|
|
&root_inode->i_uid, &root_inode->i_gid,
|
|
|
|
&sbi->oz_pgrp,
|
|
|
|
&minproto, &maxproto)) {
|
|
|
|
printk("autofs: called with bogus options\n");
|
|
|
|
goto fail_dput;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Couldn't this be tested earlier? */
|
|
|
|
if (maxproto < AUTOFS_MIN_PROTO_VERSION ||
|
|
|
|
minproto > AUTOFS_MAX_PROTO_VERSION) {
|
|
|
|
printk("autofs: kernel does not match daemon version "
|
|
|
|
"daemon (%d, %d) kernel (%d, %d)\n",
|
|
|
|
minproto, maxproto,
|
|
|
|
AUTOFS_MIN_PROTO_VERSION, AUTOFS_MAX_PROTO_VERSION);
|
|
|
|
goto fail_dput;
|
|
|
|
}
|
|
|
|
|
|
|
|
sbi->version = maxproto > AUTOFS_MAX_PROTO_VERSION ? AUTOFS_MAX_PROTO_VERSION : maxproto;
|
|
|
|
sbi->sub_version = AUTOFS_PROTO_SUBVERSION;
|
|
|
|
|
|
|
|
DPRINTK("pipe fd = %d, pgrp = %u", pipefd, sbi->oz_pgrp);
|
|
|
|
pipe = fget(pipefd);
|
|
|
|
|
|
|
|
if ( !pipe ) {
|
|
|
|
printk("autofs: could not open pipe file descriptor\n");
|
|
|
|
goto fail_dput;
|
|
|
|
}
|
|
|
|
if ( !pipe->f_op || !pipe->f_op->write )
|
|
|
|
goto fail_fput;
|
|
|
|
sbi->pipe = pipe;
|
|
|
|
|
2005-07-27 18:43:45 +00:00
|
|
|
/*
|
|
|
|
* Take a reference to the root dentry so we get a chance to
|
|
|
|
* clean up the dentry tree on umount.
|
|
|
|
* See autofs4_force_release.
|
|
|
|
*/
|
|
|
|
sbi->root = dget(root);
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* Success! Install the root dentry now to indicate completion.
|
|
|
|
*/
|
|
|
|
s->s_root = root;
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Failure ... clean up.
|
|
|
|
*/
|
|
|
|
fail_fput:
|
|
|
|
printk("autofs: pipe file descriptor does not contain proper ops\n");
|
|
|
|
fput(pipe);
|
|
|
|
/* fall through */
|
|
|
|
fail_dput:
|
|
|
|
dput(root);
|
|
|
|
goto fail_free;
|
|
|
|
fail_iput:
|
|
|
|
printk("autofs: get root dentry failed\n");
|
|
|
|
iput(root_inode);
|
|
|
|
fail_free:
|
|
|
|
kfree(sbi);
|
|
|
|
fail_unlock:
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct inode *autofs4_get_inode(struct super_block *sb,
|
|
|
|
struct autofs_info *inf)
|
|
|
|
{
|
|
|
|
struct inode *inode = new_inode(sb);
|
|
|
|
|
|
|
|
if (inode == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
inf->inode = inode;
|
|
|
|
inode->i_mode = inf->mode;
|
|
|
|
if (sb->s_root) {
|
|
|
|
inode->i_uid = sb->s_root->d_inode->i_uid;
|
|
|
|
inode->i_gid = sb->s_root->d_inode->i_gid;
|
|
|
|
} else {
|
|
|
|
inode->i_uid = 0;
|
|
|
|
inode->i_gid = 0;
|
|
|
|
}
|
|
|
|
inode->i_blksize = PAGE_CACHE_SIZE;
|
|
|
|
inode->i_blocks = 0;
|
|
|
|
inode->i_atime = inode->i_mtime = inode->i_ctime = CURRENT_TIME;
|
|
|
|
|
|
|
|
if (S_ISDIR(inf->mode)) {
|
|
|
|
inode->i_nlink = 2;
|
|
|
|
inode->i_op = &autofs4_dir_inode_operations;
|
|
|
|
inode->i_fop = &autofs4_dir_operations;
|
|
|
|
} else if (S_ISLNK(inf->mode)) {
|
|
|
|
inode->i_size = inf->size;
|
|
|
|
inode->i_op = &autofs4_symlink_inode_operations;
|
|
|
|
}
|
|
|
|
|
|
|
|
return inode;
|
|
|
|
}
|