include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit...
[GitHub/mt8127/android_kernel_alcatel_ttab.git] / fs / nfsd / nfs4idmap.c
CommitLineData
1da177e4 1/*
1da177e4
LT
2 * Mapping of UID/GIDs to name and vice versa.
3 *
4 * Copyright (c) 2002, 2003 The Regents of the University of
5 * Michigan. All rights reserved.
6 *
7 * Marius Aamodt Eriksen <marius@umich.edu>
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
12 *
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. Neither the name of the University nor the names of its
19 * contributors may be used to endorse or promote products derived
20 * from this software without specific prior written permission.
21 *
22 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
23 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
24 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
25 * DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
27 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
28 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
29 * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
30 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
31 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
32 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 */
34
1da177e4 35#include <linux/module.h>
1da177e4 36#include <linux/nfsd_idmap.h>
1da177e4 37#include <linux/seq_file.h>
341eb184 38#include <linux/sched.h>
5a0e3ad6 39#include <linux/slab.h>
1da177e4
LT
40
41/*
42 * Cache entry
43 */
44
45/*
46 * XXX we know that IDMAP_NAMESZ < PAGE_SIZE, but it's ugly to rely on
47 * that.
48 */
49
50#define IDMAP_TYPE_USER 0
51#define IDMAP_TYPE_GROUP 1
52
53struct ent {
54 struct cache_head h;
55 int type; /* User / Group */
56 uid_t id;
57 char name[IDMAP_NAMESZ];
58 char authname[IDMAP_NAMESZ];
59};
60
1da177e4
LT
61/* Common entry handling */
62
63#define ENT_HASHBITS 8
64#define ENT_HASHMAX (1 << ENT_HASHBITS)
65#define ENT_HASHMASK (ENT_HASHMAX - 1)
66
f9ecc921
N
67static void
68ent_init(struct cache_head *cnew, struct cache_head *citm)
1da177e4 69{
f9ecc921
N
70 struct ent *new = container_of(cnew, struct ent, h);
71 struct ent *itm = container_of(citm, struct ent, h);
72
1da177e4
LT
73 new->id = itm->id;
74 new->type = itm->type;
75
76 strlcpy(new->name, itm->name, sizeof(new->name));
77 strlcpy(new->authname, itm->authname, sizeof(new->name));
78}
79
fd39ca9a 80static void
baab935f 81ent_put(struct kref *ref)
1da177e4 82{
baab935f
N
83 struct ent *map = container_of(ref, struct ent, h.ref);
84 kfree(map);
1da177e4
LT
85}
86
f9ecc921
N
87static struct cache_head *
88ent_alloc(void)
89{
90 struct ent *e = kmalloc(sizeof(*e), GFP_KERNEL);
91 if (e)
92 return &e->h;
93 else
94 return NULL;
95}
96
1da177e4
LT
97/*
98 * ID -> Name cache
99 */
100
101static struct cache_head *idtoname_table[ENT_HASHMAX];
102
103static uint32_t
104idtoname_hash(struct ent *ent)
105{
106 uint32_t hash;
107
108 hash = hash_str(ent->authname, ENT_HASHBITS);
109 hash = hash_long(hash ^ ent->id, ENT_HASHBITS);
110
111 /* Flip LSB for user/group */
112 if (ent->type == IDMAP_TYPE_GROUP)
113 hash ^= 1;
114
115 return hash;
116}
117
118static void
119idtoname_request(struct cache_detail *cd, struct cache_head *ch, char **bpp,
120 int *blen)
121{
122 struct ent *ent = container_of(ch, struct ent, h);
123 char idstr[11];
124
125 qword_add(bpp, blen, ent->authname);
0a725fc4 126 snprintf(idstr, sizeof(idstr), "%u", ent->id);
1da177e4
LT
127 qword_add(bpp, blen, ent->type == IDMAP_TYPE_GROUP ? "group" : "user");
128 qword_add(bpp, blen, idstr);
129
130 (*bpp)[-1] = '\n';
131}
132
bc74b4f5
TM
133static int
134idtoname_upcall(struct cache_detail *cd, struct cache_head *ch)
135{
136 return sunrpc_cache_pipe_upcall(cd, ch, idtoname_request);
137}
138
f9ecc921
N
139static int
140idtoname_match(struct cache_head *ca, struct cache_head *cb)
1da177e4 141{
f9ecc921
N
142 struct ent *a = container_of(ca, struct ent, h);
143 struct ent *b = container_of(cb, struct ent, h);
144
1da177e4
LT
145 return (a->id == b->id && a->type == b->type &&
146 strcmp(a->authname, b->authname) == 0);
147}
148
149static int
150idtoname_show(struct seq_file *m, struct cache_detail *cd, struct cache_head *h)
151{
152 struct ent *ent;
153
154 if (h == NULL) {
155 seq_puts(m, "#domain type id [name]\n");
156 return 0;
157 }
158 ent = container_of(h, struct ent, h);
0a725fc4 159 seq_printf(m, "%s %s %u", ent->authname,
1da177e4
LT
160 ent->type == IDMAP_TYPE_GROUP ? "group" : "user",
161 ent->id);
162 if (test_bit(CACHE_VALID, &h->flags))
163 seq_printf(m, " %s", ent->name);
164 seq_printf(m, "\n");
165 return 0;
166}
167
168static void
2da8ca26 169warn_no_idmapd(struct cache_detail *detail, int has_died)
1da177e4
LT
170{
171 printk("nfsd: nfsv4 idmapping failing: has idmapd %s?\n",
2da8ca26 172 has_died ? "died" : "not been started");
1da177e4
LT
173}
174
175
176static int idtoname_parse(struct cache_detail *, char *, int);
f9ecc921
N
177static struct ent *idtoname_lookup(struct ent *);
178static struct ent *idtoname_update(struct ent *, struct ent *);
1da177e4 179
fd39ca9a 180static struct cache_detail idtoname_cache = {
f35279d3 181 .owner = THIS_MODULE,
1da177e4
LT
182 .hash_size = ENT_HASHMAX,
183 .hash_table = idtoname_table,
184 .name = "nfs4.idtoname",
185 .cache_put = ent_put,
bc74b4f5 186 .cache_upcall = idtoname_upcall,
1da177e4
LT
187 .cache_parse = idtoname_parse,
188 .cache_show = idtoname_show,
189 .warn_no_listener = warn_no_idmapd,
f9ecc921
N
190 .match = idtoname_match,
191 .init = ent_init,
192 .update = ent_init,
193 .alloc = ent_alloc,
1da177e4
LT
194};
195
a254b246 196static int
1da177e4
LT
197idtoname_parse(struct cache_detail *cd, char *buf, int buflen)
198{
199 struct ent ent, *res;
200 char *buf1, *bp;
c9b6cbe5 201 int len;
1da177e4
LT
202 int error = -EINVAL;
203
204 if (buf[buflen - 1] != '\n')
205 return (-EINVAL);
206 buf[buflen - 1]= '\0';
207
208 buf1 = kmalloc(PAGE_SIZE, GFP_KERNEL);
209 if (buf1 == NULL)
210 return (-ENOMEM);
211
212 memset(&ent, 0, sizeof(ent));
213
214 /* Authentication name */
215 if (qword_get(&buf, buf1, PAGE_SIZE) <= 0)
216 goto out;
217 memcpy(ent.authname, buf1, sizeof(ent.authname));
218
219 /* Type */
220 if (qword_get(&buf, buf1, PAGE_SIZE) <= 0)
221 goto out;
222 ent.type = strcmp(buf1, "user") == 0 ?
223 IDMAP_TYPE_USER : IDMAP_TYPE_GROUP;
224
225 /* ID */
226 if (qword_get(&buf, buf1, PAGE_SIZE) <= 0)
227 goto out;
228 ent.id = simple_strtoul(buf1, &bp, 10);
229 if (bp == buf1)
230 goto out;
231
232 /* expiry */
233 ent.h.expiry_time = get_expiry(&buf);
234 if (ent.h.expiry_time == 0)
235 goto out;
236
f9ecc921
N
237 error = -ENOMEM;
238 res = idtoname_lookup(&ent);
239 if (!res)
240 goto out;
241
1da177e4 242 /* Name */
c9b6cbe5
BF
243 error = -EINVAL;
244 len = qword_get(&buf, buf1, PAGE_SIZE);
245 if (len < 0)
1da177e4 246 goto out;
c9b6cbe5 247 if (len == 0)
1da177e4 248 set_bit(CACHE_NEGATIVE, &ent.h.flags);
d4395e03
BF
249 else if (len >= IDMAP_NAMESZ)
250 goto out;
251 else
1da177e4 252 memcpy(ent.name, buf1, sizeof(ent.name));
1da177e4 253 error = -ENOMEM;
f9ecc921
N
254 res = idtoname_update(&ent, res);
255 if (res == NULL)
1da177e4
LT
256 goto out;
257
baab935f 258 cache_put(&res->h, &idtoname_cache);
1da177e4
LT
259
260 error = 0;
261out:
262 kfree(buf1);
263
264 return error;
265}
266
f9ecc921
N
267
268static struct ent *
269idtoname_lookup(struct ent *item)
270{
271 struct cache_head *ch = sunrpc_cache_lookup(&idtoname_cache,
272 &item->h,
273 idtoname_hash(item));
274 if (ch)
275 return container_of(ch, struct ent, h);
276 else
277 return NULL;
278}
279
280static struct ent *
281idtoname_update(struct ent *new, struct ent *old)
282{
283 struct cache_head *ch = sunrpc_cache_update(&idtoname_cache,
284 &new->h, &old->h,
285 idtoname_hash(new));
286 if (ch)
287 return container_of(ch, struct ent, h);
288 else
289 return NULL;
290}
291
1da177e4
LT
292
293/*
294 * Name -> ID cache
295 */
296
297static struct cache_head *nametoid_table[ENT_HASHMAX];
298
299static inline int
300nametoid_hash(struct ent *ent)
301{
302 return hash_str(ent->name, ENT_HASHBITS);
303}
304
fd39ca9a 305static void
1da177e4
LT
306nametoid_request(struct cache_detail *cd, struct cache_head *ch, char **bpp,
307 int *blen)
308{
309 struct ent *ent = container_of(ch, struct ent, h);
310
311 qword_add(bpp, blen, ent->authname);
312 qword_add(bpp, blen, ent->type == IDMAP_TYPE_GROUP ? "group" : "user");
313 qword_add(bpp, blen, ent->name);
314
315 (*bpp)[-1] = '\n';
316}
317
bc74b4f5
TM
318static int
319nametoid_upcall(struct cache_detail *cd, struct cache_head *ch)
320{
321 return sunrpc_cache_pipe_upcall(cd, ch, nametoid_request);
322}
323
f9ecc921
N
324static int
325nametoid_match(struct cache_head *ca, struct cache_head *cb)
1da177e4 326{
f9ecc921
N
327 struct ent *a = container_of(ca, struct ent, h);
328 struct ent *b = container_of(cb, struct ent, h);
329
1da177e4
LT
330 return (a->type == b->type && strcmp(a->name, b->name) == 0 &&
331 strcmp(a->authname, b->authname) == 0);
332}
333
334static int
335nametoid_show(struct seq_file *m, struct cache_detail *cd, struct cache_head *h)
336{
337 struct ent *ent;
338
339 if (h == NULL) {
340 seq_puts(m, "#domain type name [id]\n");
341 return 0;
342 }
343 ent = container_of(h, struct ent, h);
344 seq_printf(m, "%s %s %s", ent->authname,
345 ent->type == IDMAP_TYPE_GROUP ? "group" : "user",
346 ent->name);
347 if (test_bit(CACHE_VALID, &h->flags))
0a725fc4 348 seq_printf(m, " %u", ent->id);
1da177e4
LT
349 seq_printf(m, "\n");
350 return 0;
351}
352
f9ecc921
N
353static struct ent *nametoid_lookup(struct ent *);
354static struct ent *nametoid_update(struct ent *, struct ent *);
fd39ca9a 355static int nametoid_parse(struct cache_detail *, char *, int);
1da177e4 356
fd39ca9a 357static struct cache_detail nametoid_cache = {
f35279d3 358 .owner = THIS_MODULE,
1da177e4
LT
359 .hash_size = ENT_HASHMAX,
360 .hash_table = nametoid_table,
361 .name = "nfs4.nametoid",
362 .cache_put = ent_put,
bc74b4f5 363 .cache_upcall = nametoid_upcall,
1da177e4
LT
364 .cache_parse = nametoid_parse,
365 .cache_show = nametoid_show,
366 .warn_no_listener = warn_no_idmapd,
f9ecc921
N
367 .match = nametoid_match,
368 .init = ent_init,
369 .update = ent_init,
370 .alloc = ent_alloc,
1da177e4
LT
371};
372
fd39ca9a 373static int
1da177e4
LT
374nametoid_parse(struct cache_detail *cd, char *buf, int buflen)
375{
376 struct ent ent, *res;
377 char *buf1;
378 int error = -EINVAL;
379
380 if (buf[buflen - 1] != '\n')
381 return (-EINVAL);
382 buf[buflen - 1]= '\0';
383
384 buf1 = kmalloc(PAGE_SIZE, GFP_KERNEL);
385 if (buf1 == NULL)
386 return (-ENOMEM);
387
388 memset(&ent, 0, sizeof(ent));
389
390 /* Authentication name */
391 if (qword_get(&buf, buf1, PAGE_SIZE) <= 0)
392 goto out;
393 memcpy(ent.authname, buf1, sizeof(ent.authname));
394
395 /* Type */
396 if (qword_get(&buf, buf1, PAGE_SIZE) <= 0)
397 goto out;
398 ent.type = strcmp(buf1, "user") == 0 ?
399 IDMAP_TYPE_USER : IDMAP_TYPE_GROUP;
400
401 /* Name */
402 error = qword_get(&buf, buf1, PAGE_SIZE);
403 if (error <= 0 || error >= IDMAP_NAMESZ)
404 goto out;
405 memcpy(ent.name, buf1, sizeof(ent.name));
406
407 /* expiry */
408 ent.h.expiry_time = get_expiry(&buf);
409 if (ent.h.expiry_time == 0)
410 goto out;
411
412 /* ID */
413 error = get_int(&buf, &ent.id);
414 if (error == -EINVAL)
415 goto out;
416 if (error == -ENOENT)
417 set_bit(CACHE_NEGATIVE, &ent.h.flags);
418
419 error = -ENOMEM;
f9ecc921
N
420 res = nametoid_lookup(&ent);
421 if (res == NULL)
422 goto out;
423 res = nametoid_update(&ent, res);
424 if (res == NULL)
1da177e4
LT
425 goto out;
426
baab935f 427 cache_put(&res->h, &nametoid_cache);
1da177e4
LT
428 error = 0;
429out:
430 kfree(buf1);
431
432 return (error);
433}
434
f9ecc921
N
435
436static struct ent *
437nametoid_lookup(struct ent *item)
438{
439 struct cache_head *ch = sunrpc_cache_lookup(&nametoid_cache,
440 &item->h,
441 nametoid_hash(item));
442 if (ch)
443 return container_of(ch, struct ent, h);
444 else
445 return NULL;
446}
447
448static struct ent *
449nametoid_update(struct ent *new, struct ent *old)
450{
451 struct cache_head *ch = sunrpc_cache_update(&nametoid_cache,
452 &new->h, &old->h,
453 nametoid_hash(new));
454 if (ch)
455 return container_of(ch, struct ent, h);
456 else
457 return NULL;
458}
1da177e4
LT
459
460/*
461 * Exported API
462 */
463
dbf847ec 464int
1da177e4
LT
465nfsd_idmap_init(void)
466{
dbf847ec
BF
467 int rv;
468
469 rv = cache_register(&idtoname_cache);
470 if (rv)
471 return rv;
472 rv = cache_register(&nametoid_cache);
473 if (rv)
474 cache_unregister(&idtoname_cache);
475 return rv;
1da177e4
LT
476}
477
478void
479nfsd_idmap_shutdown(void)
480{
df95a9d4
BF
481 cache_unregister(&idtoname_cache);
482 cache_unregister(&nametoid_cache);
1da177e4
LT
483}
484
485/*
486 * Deferred request handling
487 */
488
489struct idmap_defer_req {
490 struct cache_req req;
491 struct cache_deferred_req deferred_req;
492 wait_queue_head_t waitq;
493 atomic_t count;
494};
495
496static inline void
497put_mdr(struct idmap_defer_req *mdr)
498{
499 if (atomic_dec_and_test(&mdr->count))
500 kfree(mdr);
501}
502
503static inline void
504get_mdr(struct idmap_defer_req *mdr)
505{
506 atomic_inc(&mdr->count);
507}
508
509static void
510idmap_revisit(struct cache_deferred_req *dreq, int toomany)
511{
512 struct idmap_defer_req *mdr =
513 container_of(dreq, struct idmap_defer_req, deferred_req);
514
515 wake_up(&mdr->waitq);
516 put_mdr(mdr);
517}
518
519static struct cache_deferred_req *
520idmap_defer(struct cache_req *req)
521{
522 struct idmap_defer_req *mdr =
523 container_of(req, struct idmap_defer_req, req);
524
525 mdr->deferred_req.revisit = idmap_revisit;
526 get_mdr(mdr);
527 return (&mdr->deferred_req);
528}
529
530static inline int
f9ecc921 531do_idmap_lookup(struct ent *(*lookup_fn)(struct ent *), struct ent *key,
1da177e4
LT
532 struct cache_detail *detail, struct ent **item,
533 struct idmap_defer_req *mdr)
534{
f9ecc921 535 *item = lookup_fn(key);
1da177e4
LT
536 if (!*item)
537 return -ENOMEM;
538 return cache_check(detail, &(*item)->h, &mdr->req);
539}
540
541static inline int
f9ecc921 542do_idmap_lookup_nowait(struct ent *(*lookup_fn)(struct ent *),
1da177e4
LT
543 struct ent *key, struct cache_detail *detail,
544 struct ent **item)
545{
546 int ret = -ENOMEM;
547
f9ecc921 548 *item = lookup_fn(key);
1da177e4
LT
549 if (!*item)
550 goto out_err;
551 ret = -ETIMEDOUT;
552 if (!test_bit(CACHE_VALID, &(*item)->h.flags)
553 || (*item)->h.expiry_time < get_seconds()
554 || detail->flush_time > (*item)->h.last_refresh)
555 goto out_put;
556 ret = -ENOENT;
557 if (test_bit(CACHE_NEGATIVE, &(*item)->h.flags))
558 goto out_put;
559 return 0;
560out_put:
baab935f 561 cache_put(&(*item)->h, detail);
1da177e4
LT
562out_err:
563 *item = NULL;
564 return ret;
565}
566
567static int
568idmap_lookup(struct svc_rqst *rqstp,
f9ecc921 569 struct ent *(*lookup_fn)(struct ent *), struct ent *key,
1da177e4
LT
570 struct cache_detail *detail, struct ent **item)
571{
572 struct idmap_defer_req *mdr;
573 int ret;
574
f8314dc6 575 mdr = kzalloc(sizeof(*mdr), GFP_KERNEL);
1da177e4
LT
576 if (!mdr)
577 return -ENOMEM;
1da177e4
LT
578 atomic_set(&mdr->count, 1);
579 init_waitqueue_head(&mdr->waitq);
580 mdr->req.defer = idmap_defer;
581 ret = do_idmap_lookup(lookup_fn, key, detail, item, mdr);
582 if (ret == -EAGAIN) {
583 wait_event_interruptible_timeout(mdr->waitq,
584 test_bit(CACHE_VALID, &(*item)->h.flags), 1 * HZ);
585 ret = do_idmap_lookup_nowait(lookup_fn, key, detail, item);
586 }
587 put_mdr(mdr);
588 return ret;
589}
590
3ab4d8b1
BF
591static char *
592rqst_authname(struct svc_rqst *rqstp)
593{
594 struct auth_domain *clp;
595
596 clp = rqstp->rq_gssclient ? rqstp->rq_gssclient : rqstp->rq_client;
597 return clp->name;
598}
599
1da177e4
LT
600static int
601idmap_name_to_id(struct svc_rqst *rqstp, int type, const char *name, u32 namelen,
602 uid_t *id)
603{
604 struct ent *item, key = {
605 .type = type,
606 };
607 int ret;
608
609 if (namelen + 1 > sizeof(key.name))
610 return -EINVAL;
611 memcpy(key.name, name, namelen);
612 key.name[namelen] = '\0';
3ab4d8b1 613 strlcpy(key.authname, rqst_authname(rqstp), sizeof(key.authname));
1da177e4
LT
614 ret = idmap_lookup(rqstp, nametoid_lookup, &key, &nametoid_cache, &item);
615 if (ret == -ENOENT)
616 ret = -ESRCH; /* nfserr_badname */
617 if (ret)
618 return ret;
619 *id = item->id;
baab935f 620 cache_put(&item->h, &nametoid_cache);
1da177e4
LT
621 return 0;
622}
623
624static int
625idmap_id_to_name(struct svc_rqst *rqstp, int type, uid_t id, char *name)
626{
627 struct ent *item, key = {
628 .id = id,
629 .type = type,
630 };
631 int ret;
632
3ab4d8b1 633 strlcpy(key.authname, rqst_authname(rqstp), sizeof(key.authname));
1da177e4
LT
634 ret = idmap_lookup(rqstp, idtoname_lookup, &key, &idtoname_cache, &item);
635 if (ret == -ENOENT)
636 return sprintf(name, "%u", id);
637 if (ret)
638 return ret;
639 ret = strlen(item->name);
640 BUG_ON(ret > IDMAP_NAMESZ);
641 memcpy(name, item->name, ret);
baab935f 642 cache_put(&item->h, &idtoname_cache);
1da177e4
LT
643 return ret;
644}
645
646int
647nfsd_map_name_to_uid(struct svc_rqst *rqstp, const char *name, size_t namelen,
648 __u32 *id)
649{
650 return idmap_name_to_id(rqstp, IDMAP_TYPE_USER, name, namelen, id);
651}
652
653int
654nfsd_map_name_to_gid(struct svc_rqst *rqstp, const char *name, size_t namelen,
655 __u32 *id)
656{
657 return idmap_name_to_id(rqstp, IDMAP_TYPE_GROUP, name, namelen, id);
658}
659
660int
661nfsd_map_uid_to_name(struct svc_rqst *rqstp, __u32 id, char *name)
662{
663 return idmap_id_to_name(rqstp, IDMAP_TYPE_USER, id, name);
664}
665
666int
667nfsd_map_gid_to_name(struct svc_rqst *rqstp, __u32 id, char *name)
668{
669 return idmap_id_to_name(rqstp, IDMAP_TYPE_GROUP, id, name);
670}