2 * linux/net/sunrpc/svcauth.c
4 * The generic interface for RPC authentication on the server side.
6 * Copyright (C) 1995, 1996 Olaf Kirch <okir@monad.swb.de>
9 * 19-Apr-2000 Chris Evans - Security fix
12 #include <linux/types.h>
13 #include <linux/module.h>
14 #include <linux/sunrpc/types.h>
15 #include <linux/sunrpc/xdr.h>
16 #include <linux/sunrpc/svcsock.h>
17 #include <linux/sunrpc/svcauth.h>
18 #include <linux/err.h>
19 #include <linux/hash.h>
21 #define RPCDBG_FACILITY RPCDBG_AUTH
25 * Table of authenticators
27 extern struct auth_ops svcauth_null;
28 extern struct auth_ops svcauth_unix;
30 static DEFINE_SPINLOCK(authtab_lock);
31 static struct auth_ops *authtab[RPC_AUTH_MAXFLAVOR] = {
37 svc_authenticate(struct svc_rqst *rqstp, __be32 *authp)
39 rpc_authflavor_t flavor;
40 struct auth_ops *aops;
44 flavor = svc_getnl(&rqstp->rq_arg.head[0]);
46 dprintk("svc: svc_authenticate (%d)\n", flavor);
48 spin_lock(&authtab_lock);
49 if (flavor >= RPC_AUTH_MAXFLAVOR || !(aops = authtab[flavor])
50 || !try_module_get(aops->owner)) {
51 spin_unlock(&authtab_lock);
52 *authp = rpc_autherr_badcred;
55 spin_unlock(&authtab_lock);
57 rqstp->rq_authop = aops;
58 return aops->accept(rqstp, authp);
61 int svc_set_client(struct svc_rqst *rqstp)
63 return rqstp->rq_authop->set_client(rqstp);
66 /* A request, which was authenticated, has now executed.
67 * Time to finalise the credentials and verifier
68 * and release and resources
70 int svc_authorise(struct svc_rqst *rqstp)
72 struct auth_ops *aops = rqstp->rq_authop;
75 rqstp->rq_authop = NULL;
78 rv = aops->release(rqstp);
79 module_put(aops->owner);
85 svc_auth_register(rpc_authflavor_t flavor, struct auth_ops *aops)
88 spin_lock(&authtab_lock);
89 if (flavor < RPC_AUTH_MAXFLAVOR && authtab[flavor] == NULL) {
90 authtab[flavor] = aops;
93 spin_unlock(&authtab_lock);
98 svc_auth_unregister(rpc_authflavor_t flavor)
100 spin_lock(&authtab_lock);
101 if (flavor < RPC_AUTH_MAXFLAVOR)
102 authtab[flavor] = NULL;
103 spin_unlock(&authtab_lock);
105 EXPORT_SYMBOL(svc_auth_unregister);
107 /**************************************************
108 * 'auth_domains' are stored in a hash table indexed by name.
109 * When the last reference to an 'auth_domain' is dropped,
110 * the object is unhashed and freed.
111 * If auth_domain_lookup fails to find an entry, it will return
112 * it's second argument 'new'. If this is non-null, it will
113 * have been atomically linked into the table.
116 #define DN_HASHBITS 6
117 #define DN_HASHMAX (1<<DN_HASHBITS)
118 #define DN_HASHMASK (DN_HASHMAX-1)
120 static struct hlist_head auth_domain_table[DN_HASHMAX];
121 static spinlock_t auth_domain_lock =
122 __SPIN_LOCK_UNLOCKED(auth_domain_lock);
124 void auth_domain_put(struct auth_domain *dom)
126 if (atomic_dec_and_lock(&dom->ref.refcount, &auth_domain_lock)) {
127 hlist_del(&dom->hash);
128 dom->flavour->domain_release(dom);
129 spin_unlock(&auth_domain_lock);
134 auth_domain_lookup(char *name, struct auth_domain *new)
136 struct auth_domain *hp;
137 struct hlist_head *head;
138 struct hlist_node *np;
140 head = &auth_domain_table[hash_str(name, DN_HASHBITS)];
142 spin_lock(&auth_domain_lock);
144 hlist_for_each_entry(hp, np, head, hash) {
145 if (strcmp(hp->name, name)==0) {
147 spin_unlock(&auth_domain_lock);
152 hlist_add_head(&new->hash, head);
153 spin_unlock(&auth_domain_lock);
157 struct auth_domain *auth_domain_find(char *name)
159 return auth_domain_lookup(name, NULL);