2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* linux/net/sunrpc/svcauth.c
|
|
|
|
*
|
|
|
|
* The generic interface for RPC authentication on the server side.
|
2007-02-09 23:38:13 +00:00
|
|
|
*
|
2005-04-16 22:20:36 +00:00
|
|
|
* Copyright (C) 1995, 1996 Olaf Kirch <okir@monad.swb.de>
|
|
|
|
*
|
|
|
|
* CHANGES
|
|
|
|
* 19-Apr-2000 Chris Evans - Security fix
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/sunrpc/types.h>
|
|
|
|
#include <linux/sunrpc/xdr.h>
|
|
|
|
#include <linux/sunrpc/svcsock.h>
|
|
|
|
#include <linux/sunrpc/svcauth.h>
|
|
|
|
#include <linux/err.h>
|
|
|
|
#include <linux/hash.h>
|
|
|
|
|
|
|
|
#define RPCDBG_FACILITY RPCDBG_AUTH
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Table of authenticators
|
|
|
|
*/
|
|
|
|
extern struct auth_ops svcauth_null;
|
|
|
|
extern struct auth_ops svcauth_unix;
|
|
|
|
|
|
|
|
static DEFINE_SPINLOCK(authtab_lock);
|
|
|
|
static struct auth_ops *authtab[RPC_AUTH_MAXFLAVOR] = {
|
|
|
|
[0] = &svcauth_null,
|
|
|
|
[1] = &svcauth_unix,
|
|
|
|
};
|
|
|
|
|
|
|
|
int
|
2006-09-27 05:29:38 +00:00
|
|
|
svc_authenticate(struct svc_rqst *rqstp, __be32 *authp)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
rpc_authflavor_t flavor;
|
|
|
|
struct auth_ops *aops;
|
|
|
|
|
|
|
|
*authp = rpc_auth_ok;
|
|
|
|
|
2006-09-27 05:28:46 +00:00
|
|
|
flavor = svc_getnl(&rqstp->rq_arg.head[0]);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
dprintk("svc: svc_authenticate (%d)\n", flavor);
|
|
|
|
|
|
|
|
spin_lock(&authtab_lock);
|
2009-11-30 00:55:45 +00:00
|
|
|
if (flavor >= RPC_AUTH_MAXFLAVOR || !(aops = authtab[flavor]) ||
|
|
|
|
!try_module_get(aops->owner)) {
|
2005-04-16 22:20:36 +00:00
|
|
|
spin_unlock(&authtab_lock);
|
|
|
|
*authp = rpc_autherr_badcred;
|
|
|
|
return SVC_DENIED;
|
|
|
|
}
|
|
|
|
spin_unlock(&authtab_lock);
|
|
|
|
|
2014-05-12 22:10:58 +00:00
|
|
|
rqstp->rq_auth_slack = 0;
|
2015-11-20 20:45:35 +00:00
|
|
|
init_svc_cred(&rqstp->rq_cred);
|
2014-05-12 22:10:58 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
rqstp->rq_authop = aops;
|
|
|
|
return aops->accept(rqstp, authp);
|
|
|
|
}
|
2008-12-23 21:30:12 +00:00
|
|
|
EXPORT_SYMBOL_GPL(svc_authenticate);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
int svc_set_client(struct svc_rqst *rqstp)
|
|
|
|
{
|
2015-11-20 20:45:35 +00:00
|
|
|
rqstp->rq_client = NULL;
|
2005-04-16 22:20:36 +00:00
|
|
|
return rqstp->rq_authop->set_client(rqstp);
|
|
|
|
}
|
2008-12-23 21:30:12 +00:00
|
|
|
EXPORT_SYMBOL_GPL(svc_set_client);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
/* A request, which was authenticated, has now executed.
|
2007-05-09 06:57:56 +00:00
|
|
|
* Time to finalise the credentials and verifier
|
2005-04-16 22:20:36 +00:00
|
|
|
* and release and resources
|
|
|
|
*/
|
|
|
|
int svc_authorise(struct svc_rqst *rqstp)
|
|
|
|
{
|
|
|
|
struct auth_ops *aops = rqstp->rq_authop;
|
|
|
|
int rv = 0;
|
|
|
|
|
|
|
|
rqstp->rq_authop = NULL;
|
2007-02-09 23:38:13 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
if (aops) {
|
|
|
|
rv = aops->release(rqstp);
|
|
|
|
module_put(aops->owner);
|
|
|
|
}
|
|
|
|
return rv;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
svc_auth_register(rpc_authflavor_t flavor, struct auth_ops *aops)
|
|
|
|
{
|
|
|
|
int rv = -EINVAL;
|
|
|
|
spin_lock(&authtab_lock);
|
|
|
|
if (flavor < RPC_AUTH_MAXFLAVOR && authtab[flavor] == NULL) {
|
|
|
|
authtab[flavor] = aops;
|
|
|
|
rv = 0;
|
|
|
|
}
|
|
|
|
spin_unlock(&authtab_lock);
|
|
|
|
return rv;
|
|
|
|
}
|
2008-12-23 21:30:12 +00:00
|
|
|
EXPORT_SYMBOL_GPL(svc_auth_register);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
void
|
|
|
|
svc_auth_unregister(rpc_authflavor_t flavor)
|
|
|
|
{
|
|
|
|
spin_lock(&authtab_lock);
|
|
|
|
if (flavor < RPC_AUTH_MAXFLAVOR)
|
|
|
|
authtab[flavor] = NULL;
|
|
|
|
spin_unlock(&authtab_lock);
|
|
|
|
}
|
2008-12-23 21:30:12 +00:00
|
|
|
EXPORT_SYMBOL_GPL(svc_auth_unregister);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
/**************************************************
|
2006-03-27 09:14:59 +00:00
|
|
|
* 'auth_domains' are stored in a hash table indexed by name.
|
|
|
|
* When the last reference to an 'auth_domain' is dropped,
|
|
|
|
* the object is unhashed and freed.
|
|
|
|
* If auth_domain_lookup fails to find an entry, it will return
|
|
|
|
* it's second argument 'new'. If this is non-null, it will
|
|
|
|
* have been atomically linked into the table.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#define DN_HASHBITS 6
|
|
|
|
#define DN_HASHMAX (1<<DN_HASHBITS)
|
|
|
|
|
2006-03-27 09:14:59 +00:00
|
|
|
static struct hlist_head auth_domain_table[DN_HASHMAX];
|
2016-12-04 12:45:28 +00:00
|
|
|
static DEFINE_SPINLOCK(auth_domain_lock);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
void auth_domain_put(struct auth_domain *dom)
|
|
|
|
{
|
2006-03-27 09:14:59 +00:00
|
|
|
if (atomic_dec_and_lock(&dom->ref.refcount, &auth_domain_lock)) {
|
|
|
|
hlist_del(&dom->hash);
|
|
|
|
dom->flavour->domain_release(dom);
|
2006-11-06 07:52:13 +00:00
|
|
|
spin_unlock(&auth_domain_lock);
|
2006-03-27 09:14:59 +00:00
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2008-12-23 21:30:12 +00:00
|
|
|
EXPORT_SYMBOL_GPL(auth_domain_put);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
struct auth_domain *
|
2006-03-27 09:14:59 +00:00
|
|
|
auth_domain_lookup(char *name, struct auth_domain *new)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2006-03-27 09:14:59 +00:00
|
|
|
struct auth_domain *hp;
|
|
|
|
struct hlist_head *head;
|
|
|
|
|
|
|
|
head = &auth_domain_table[hash_str(name, DN_HASHBITS)];
|
|
|
|
|
|
|
|
spin_lock(&auth_domain_lock);
|
|
|
|
|
hlist: drop the node parameter from iterators
I'm not sure why, but the hlist for each entry iterators were conceived
list_for_each_entry(pos, head, member)
The hlist ones were greedy and wanted an extra parameter:
hlist_for_each_entry(tpos, pos, head, member)
Why did they need an extra pos parameter? I'm not quite sure. Not only
they don't really need it, it also prevents the iterator from looking
exactly like the list iterator, which is unfortunate.
Besides the semantic patch, there was some manual work required:
- Fix up the actual hlist iterators in linux/list.h
- Fix up the declaration of other iterators based on the hlist ones.
- A very small amount of places were using the 'node' parameter, this
was modified to use 'obj->member' instead.
- Coccinelle didn't handle the hlist_for_each_entry_safe iterator
properly, so those had to be fixed up manually.
The semantic patch which is mostly the work of Peter Senna Tschudin is here:
@@
iterator name hlist_for_each_entry, hlist_for_each_entry_continue, hlist_for_each_entry_from, hlist_for_each_entry_rcu, hlist_for_each_entry_rcu_bh, hlist_for_each_entry_continue_rcu_bh, for_each_busy_worker, ax25_uid_for_each, ax25_for_each, inet_bind_bucket_for_each, sctp_for_each_hentry, sk_for_each, sk_for_each_rcu, sk_for_each_from, sk_for_each_safe, sk_for_each_bound, hlist_for_each_entry_safe, hlist_for_each_entry_continue_rcu, nr_neigh_for_each, nr_neigh_for_each_safe, nr_node_for_each, nr_node_for_each_safe, for_each_gfn_indirect_valid_sp, for_each_gfn_sp, for_each_host;
type T;
expression a,c,d,e;
identifier b;
statement S;
@@
-T b;
<+... when != b
(
hlist_for_each_entry(a,
- b,
c, d) S
|
hlist_for_each_entry_continue(a,
- b,
c) S
|
hlist_for_each_entry_from(a,
- b,
c) S
|
hlist_for_each_entry_rcu(a,
- b,
c, d) S
|
hlist_for_each_entry_rcu_bh(a,
- b,
c, d) S
|
hlist_for_each_entry_continue_rcu_bh(a,
- b,
c) S
|
for_each_busy_worker(a, c,
- b,
d) S
|
ax25_uid_for_each(a,
- b,
c) S
|
ax25_for_each(a,
- b,
c) S
|
inet_bind_bucket_for_each(a,
- b,
c) S
|
sctp_for_each_hentry(a,
- b,
c) S
|
sk_for_each(a,
- b,
c) S
|
sk_for_each_rcu(a,
- b,
c) S
|
sk_for_each_from
-(a, b)
+(a)
S
+ sk_for_each_from(a) S
|
sk_for_each_safe(a,
- b,
c, d) S
|
sk_for_each_bound(a,
- b,
c) S
|
hlist_for_each_entry_safe(a,
- b,
c, d, e) S
|
hlist_for_each_entry_continue_rcu(a,
- b,
c) S
|
nr_neigh_for_each(a,
- b,
c) S
|
nr_neigh_for_each_safe(a,
- b,
c, d) S
|
nr_node_for_each(a,
- b,
c) S
|
nr_node_for_each_safe(a,
- b,
c, d) S
|
- for_each_gfn_sp(a, c, d, b) S
+ for_each_gfn_sp(a, c, d) S
|
- for_each_gfn_indirect_valid_sp(a, c, d, b) S
+ for_each_gfn_indirect_valid_sp(a, c, d) S
|
for_each_host(a,
- b,
c) S
|
for_each_host_safe(a,
- b,
c, d) S
|
for_each_mesh_entry(a,
- b,
c, d) S
)
...+>
[akpm@linux-foundation.org: drop bogus change from net/ipv4/raw.c]
[akpm@linux-foundation.org: drop bogus hunk from net/ipv6/raw.c]
[akpm@linux-foundation.org: checkpatch fixes]
[akpm@linux-foundation.org: fix warnings]
[akpm@linux-foudnation.org: redo intrusive kvm changes]
Tested-by: Peter Senna Tschudin <peter.senna@gmail.com>
Acked-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Signed-off-by: Sasha Levin <sasha.levin@oracle.com>
Cc: Wu Fengguang <fengguang.wu@intel.com>
Cc: Marcelo Tosatti <mtosatti@redhat.com>
Cc: Gleb Natapov <gleb@redhat.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-02-28 01:06:00 +00:00
|
|
|
hlist_for_each_entry(hp, head, hash) {
|
2006-03-27 09:14:59 +00:00
|
|
|
if (strcmp(hp->name, name)==0) {
|
|
|
|
kref_get(&hp->ref);
|
|
|
|
spin_unlock(&auth_domain_lock);
|
|
|
|
return hp;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
}
|
2006-10-30 06:46:45 +00:00
|
|
|
if (new)
|
2006-03-27 09:14:59 +00:00
|
|
|
hlist_add_head(&new->hash, head);
|
|
|
|
spin_unlock(&auth_domain_lock);
|
|
|
|
return new;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2008-12-23 21:30:12 +00:00
|
|
|
EXPORT_SYMBOL_GPL(auth_domain_lookup);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
struct auth_domain *auth_domain_find(char *name)
|
|
|
|
{
|
2006-03-27 09:14:59 +00:00
|
|
|
return auth_domain_lookup(name, NULL);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2008-12-23 21:30:12 +00:00
|
|
|
EXPORT_SYMBOL_GPL(auth_domain_find);
|