Merge branch 'for-linus' of git://dev.laptop.org/users/cjb/mmc
[linux/fpc-iii.git] / fs / nfs / idmap.c
blobf20801ae0a16582850f95e03f148d5b704b720aa
1 /*
2 * fs/nfs/idmap.c
4 * UID and GID to name mapping for clients.
6 * Copyright (c) 2002 The Regents of the University of Michigan.
7 * All rights reserved.
9 * Marius Aamodt Eriksen <marius@umich.edu>
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
13 * are met:
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. Neither the name of the University nor the names of its
21 * contributors may be used to endorse or promote products derived
22 * from this software without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
25 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
26 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
27 * DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
31 * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
32 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
33 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
34 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36 #include <linux/types.h>
37 #include <linux/string.h>
38 #include <linux/kernel.h>
39 #include <linux/slab.h>
40 #include <linux/nfs_idmap.h>
42 static int nfs_map_string_to_numeric(const char *name, size_t namelen, __u32 *res)
44 unsigned long val;
45 char buf[16];
47 if (memchr(name, '@', namelen) != NULL || namelen >= sizeof(buf))
48 return 0;
49 memcpy(buf, name, namelen);
50 buf[namelen] = '\0';
51 if (strict_strtoul(buf, 0, &val) != 0)
52 return 0;
53 *res = val;
54 return 1;
57 static int nfs_map_numeric_to_string(__u32 id, char *buf, size_t buflen)
59 return snprintf(buf, buflen, "%u", id);
62 #ifdef CONFIG_NFS_USE_NEW_IDMAPPER
64 #include <linux/cred.h>
65 #include <linux/sunrpc/sched.h>
66 #include <linux/nfs4.h>
67 #include <linux/nfs_fs_sb.h>
68 #include <linux/keyctl.h>
69 #include <linux/key-type.h>
70 #include <linux/rcupdate.h>
71 #include <linux/err.h>
73 #include <keys/user-type.h>
75 #define NFS_UINT_MAXLEN 11
77 const struct cred *id_resolver_cache;
79 struct key_type key_type_id_resolver = {
80 .name = "id_resolver",
81 .instantiate = user_instantiate,
82 .match = user_match,
83 .revoke = user_revoke,
84 .destroy = user_destroy,
85 .describe = user_describe,
86 .read = user_read,
89 int nfs_idmap_init(void)
91 struct cred *cred;
92 struct key *keyring;
93 int ret = 0;
95 printk(KERN_NOTICE "Registering the %s key type\n", key_type_id_resolver.name);
97 cred = prepare_kernel_cred(NULL);
98 if (!cred)
99 return -ENOMEM;
101 keyring = key_alloc(&key_type_keyring, ".id_resolver", 0, 0, cred,
102 (KEY_POS_ALL & ~KEY_POS_SETATTR) |
103 KEY_USR_VIEW | KEY_USR_READ,
104 KEY_ALLOC_NOT_IN_QUOTA);
105 if (IS_ERR(keyring)) {
106 ret = PTR_ERR(keyring);
107 goto failed_put_cred;
110 ret = key_instantiate_and_link(keyring, NULL, 0, NULL, NULL);
111 if (ret < 0)
112 goto failed_put_key;
114 ret = register_key_type(&key_type_id_resolver);
115 if (ret < 0)
116 goto failed_put_key;
118 cred->thread_keyring = keyring;
119 cred->jit_keyring = KEY_REQKEY_DEFL_THREAD_KEYRING;
120 id_resolver_cache = cred;
121 return 0;
123 failed_put_key:
124 key_put(keyring);
125 failed_put_cred:
126 put_cred(cred);
127 return ret;
130 void nfs_idmap_quit(void)
132 key_revoke(id_resolver_cache->thread_keyring);
133 unregister_key_type(&key_type_id_resolver);
134 put_cred(id_resolver_cache);
138 * Assemble the description to pass to request_key()
139 * This function will allocate a new string and update dest to point
140 * at it. The caller is responsible for freeing dest.
142 * On error 0 is returned. Otherwise, the length of dest is returned.
144 static ssize_t nfs_idmap_get_desc(const char *name, size_t namelen,
145 const char *type, size_t typelen, char **desc)
147 char *cp;
148 size_t desclen = typelen + namelen + 2;
150 *desc = kmalloc(desclen, GFP_KERNEL);
151 if (!*desc)
152 return -ENOMEM;
154 cp = *desc;
155 memcpy(cp, type, typelen);
156 cp += typelen;
157 *cp++ = ':';
159 memcpy(cp, name, namelen);
160 cp += namelen;
161 *cp = '\0';
162 return desclen;
165 static ssize_t nfs_idmap_request_key(const char *name, size_t namelen,
166 const char *type, void *data, size_t data_size)
168 const struct cred *saved_cred;
169 struct key *rkey;
170 char *desc;
171 struct user_key_payload *payload;
172 ssize_t ret;
174 ret = nfs_idmap_get_desc(name, namelen, type, strlen(type), &desc);
175 if (ret <= 0)
176 goto out;
178 saved_cred = override_creds(id_resolver_cache);
179 rkey = request_key(&key_type_id_resolver, desc, "");
180 revert_creds(saved_cred);
181 kfree(desc);
182 if (IS_ERR(rkey)) {
183 ret = PTR_ERR(rkey);
184 goto out;
187 rcu_read_lock();
188 rkey->perm |= KEY_USR_VIEW;
190 ret = key_validate(rkey);
191 if (ret < 0)
192 goto out_up;
194 payload = rcu_dereference(rkey->payload.data);
195 if (IS_ERR_OR_NULL(payload)) {
196 ret = PTR_ERR(payload);
197 goto out_up;
200 ret = payload->datalen;
201 if (ret > 0 && ret <= data_size)
202 memcpy(data, payload->data, ret);
203 else
204 ret = -EINVAL;
206 out_up:
207 rcu_read_unlock();
208 key_put(rkey);
209 out:
210 return ret;
214 /* ID -> Name */
215 static ssize_t nfs_idmap_lookup_name(__u32 id, const char *type, char *buf, size_t buflen)
217 char id_str[NFS_UINT_MAXLEN];
218 int id_len;
219 ssize_t ret;
221 id_len = snprintf(id_str, sizeof(id_str), "%u", id);
222 ret = nfs_idmap_request_key(id_str, id_len, type, buf, buflen);
223 if (ret < 0)
224 return -EINVAL;
225 return ret;
228 /* Name -> ID */
229 static int nfs_idmap_lookup_id(const char *name, size_t namelen,
230 const char *type, __u32 *id)
232 char id_str[NFS_UINT_MAXLEN];
233 long id_long;
234 ssize_t data_size;
235 int ret = 0;
237 data_size = nfs_idmap_request_key(name, namelen, type, id_str, NFS_UINT_MAXLEN);
238 if (data_size <= 0) {
239 ret = -EINVAL;
240 } else {
241 ret = strict_strtol(id_str, 10, &id_long);
242 *id = (__u32)id_long;
244 return ret;
247 int nfs_map_name_to_uid(const struct nfs_server *server, const char *name, size_t namelen, __u32 *uid)
249 if (nfs_map_string_to_numeric(name, namelen, uid))
250 return 0;
251 return nfs_idmap_lookup_id(name, namelen, "uid", uid);
254 int nfs_map_group_to_gid(const struct nfs_server *server, const char *name, size_t namelen, __u32 *gid)
256 if (nfs_map_string_to_numeric(name, namelen, gid))
257 return 0;
258 return nfs_idmap_lookup_id(name, namelen, "gid", gid);
261 int nfs_map_uid_to_name(const struct nfs_server *server, __u32 uid, char *buf, size_t buflen)
263 int ret = -EINVAL;
265 if (!(server->caps & NFS_CAP_UIDGID_NOMAP))
266 ret = nfs_idmap_lookup_name(uid, "user", buf, buflen);
267 if (ret < 0)
268 ret = nfs_map_numeric_to_string(uid, buf, buflen);
269 return ret;
271 int nfs_map_gid_to_group(const struct nfs_server *server, __u32 gid, char *buf, size_t buflen)
273 int ret = -EINVAL;
275 if (!(server->caps & NFS_CAP_UIDGID_NOMAP))
276 ret = nfs_idmap_lookup_name(gid, "group", buf, buflen);
277 if (ret < 0)
278 ret = nfs_map_numeric_to_string(gid, buf, buflen);
279 return ret;
282 #else /* CONFIG_NFS_USE_NEW_IDMAPPER not defined */
284 #include <linux/module.h>
285 #include <linux/mutex.h>
286 #include <linux/init.h>
287 #include <linux/socket.h>
288 #include <linux/in.h>
289 #include <linux/sched.h>
290 #include <linux/sunrpc/clnt.h>
291 #include <linux/workqueue.h>
292 #include <linux/sunrpc/rpc_pipe_fs.h>
294 #include <linux/nfs_fs.h>
296 #include "nfs4_fs.h"
298 #define IDMAP_HASH_SZ 128
300 /* Default cache timeout is 10 minutes */
301 unsigned int nfs_idmap_cache_timeout = 600 * HZ;
303 static int param_set_idmap_timeout(const char *val, struct kernel_param *kp)
305 char *endp;
306 int num = simple_strtol(val, &endp, 0);
307 int jif = num * HZ;
308 if (endp == val || *endp || num < 0 || jif < num)
309 return -EINVAL;
310 *((int *)kp->arg) = jif;
311 return 0;
314 module_param_call(idmap_cache_timeout, param_set_idmap_timeout, param_get_int,
315 &nfs_idmap_cache_timeout, 0644);
317 struct idmap_hashent {
318 unsigned long ih_expires;
319 __u32 ih_id;
320 size_t ih_namelen;
321 char ih_name[IDMAP_NAMESZ];
324 struct idmap_hashtable {
325 __u8 h_type;
326 struct idmap_hashent h_entries[IDMAP_HASH_SZ];
329 struct idmap {
330 struct dentry *idmap_dentry;
331 wait_queue_head_t idmap_wq;
332 struct idmap_msg idmap_im;
333 struct mutex idmap_lock; /* Serializes upcalls */
334 struct mutex idmap_im_lock; /* Protects the hashtable */
335 struct idmap_hashtable idmap_user_hash;
336 struct idmap_hashtable idmap_group_hash;
339 static ssize_t idmap_pipe_upcall(struct file *, struct rpc_pipe_msg *,
340 char __user *, size_t);
341 static ssize_t idmap_pipe_downcall(struct file *, const char __user *,
342 size_t);
343 static void idmap_pipe_destroy_msg(struct rpc_pipe_msg *);
345 static unsigned int fnvhash32(const void *, size_t);
347 static const struct rpc_pipe_ops idmap_upcall_ops = {
348 .upcall = idmap_pipe_upcall,
349 .downcall = idmap_pipe_downcall,
350 .destroy_msg = idmap_pipe_destroy_msg,
354 nfs_idmap_new(struct nfs_client *clp)
356 struct idmap *idmap;
357 int error;
359 BUG_ON(clp->cl_idmap != NULL);
361 idmap = kzalloc(sizeof(*idmap), GFP_KERNEL);
362 if (idmap == NULL)
363 return -ENOMEM;
365 idmap->idmap_dentry = rpc_mkpipe(clp->cl_rpcclient->cl_path.dentry,
366 "idmap", idmap, &idmap_upcall_ops, 0);
367 if (IS_ERR(idmap->idmap_dentry)) {
368 error = PTR_ERR(idmap->idmap_dentry);
369 kfree(idmap);
370 return error;
373 mutex_init(&idmap->idmap_lock);
374 mutex_init(&idmap->idmap_im_lock);
375 init_waitqueue_head(&idmap->idmap_wq);
376 idmap->idmap_user_hash.h_type = IDMAP_TYPE_USER;
377 idmap->idmap_group_hash.h_type = IDMAP_TYPE_GROUP;
379 clp->cl_idmap = idmap;
380 return 0;
383 void
384 nfs_idmap_delete(struct nfs_client *clp)
386 struct idmap *idmap = clp->cl_idmap;
388 if (!idmap)
389 return;
390 rpc_unlink(idmap->idmap_dentry);
391 clp->cl_idmap = NULL;
392 kfree(idmap);
396 * Helper routines for manipulating the hashtable
398 static inline struct idmap_hashent *
399 idmap_name_hash(struct idmap_hashtable* h, const char *name, size_t len)
401 return &h->h_entries[fnvhash32(name, len) % IDMAP_HASH_SZ];
404 static struct idmap_hashent *
405 idmap_lookup_name(struct idmap_hashtable *h, const char *name, size_t len)
407 struct idmap_hashent *he = idmap_name_hash(h, name, len);
409 if (he->ih_namelen != len || memcmp(he->ih_name, name, len) != 0)
410 return NULL;
411 if (time_after(jiffies, he->ih_expires))
412 return NULL;
413 return he;
416 static inline struct idmap_hashent *
417 idmap_id_hash(struct idmap_hashtable* h, __u32 id)
419 return &h->h_entries[fnvhash32(&id, sizeof(id)) % IDMAP_HASH_SZ];
422 static struct idmap_hashent *
423 idmap_lookup_id(struct idmap_hashtable *h, __u32 id)
425 struct idmap_hashent *he = idmap_id_hash(h, id);
426 if (he->ih_id != id || he->ih_namelen == 0)
427 return NULL;
428 if (time_after(jiffies, he->ih_expires))
429 return NULL;
430 return he;
434 * Routines for allocating new entries in the hashtable.
435 * For now, we just have 1 entry per bucket, so it's all
436 * pretty trivial.
438 static inline struct idmap_hashent *
439 idmap_alloc_name(struct idmap_hashtable *h, char *name, size_t len)
441 return idmap_name_hash(h, name, len);
444 static inline struct idmap_hashent *
445 idmap_alloc_id(struct idmap_hashtable *h, __u32 id)
447 return idmap_id_hash(h, id);
450 static void
451 idmap_update_entry(struct idmap_hashent *he, const char *name,
452 size_t namelen, __u32 id)
454 he->ih_id = id;
455 memcpy(he->ih_name, name, namelen);
456 he->ih_name[namelen] = '\0';
457 he->ih_namelen = namelen;
458 he->ih_expires = jiffies + nfs_idmap_cache_timeout;
462 * Name -> ID
464 static int
465 nfs_idmap_id(struct idmap *idmap, struct idmap_hashtable *h,
466 const char *name, size_t namelen, __u32 *id)
468 struct rpc_pipe_msg msg;
469 struct idmap_msg *im;
470 struct idmap_hashent *he;
471 DECLARE_WAITQUEUE(wq, current);
472 int ret = -EIO;
474 im = &idmap->idmap_im;
477 * String sanity checks
478 * Note that the userland daemon expects NUL terminated strings
480 for (;;) {
481 if (namelen == 0)
482 return -EINVAL;
483 if (name[namelen-1] != '\0')
484 break;
485 namelen--;
487 if (namelen >= IDMAP_NAMESZ)
488 return -EINVAL;
490 mutex_lock(&idmap->idmap_lock);
491 mutex_lock(&idmap->idmap_im_lock);
493 he = idmap_lookup_name(h, name, namelen);
494 if (he != NULL) {
495 *id = he->ih_id;
496 ret = 0;
497 goto out;
500 memset(im, 0, sizeof(*im));
501 memcpy(im->im_name, name, namelen);
503 im->im_type = h->h_type;
504 im->im_conv = IDMAP_CONV_NAMETOID;
506 memset(&msg, 0, sizeof(msg));
507 msg.data = im;
508 msg.len = sizeof(*im);
510 add_wait_queue(&idmap->idmap_wq, &wq);
511 if (rpc_queue_upcall(idmap->idmap_dentry->d_inode, &msg) < 0) {
512 remove_wait_queue(&idmap->idmap_wq, &wq);
513 goto out;
516 set_current_state(TASK_UNINTERRUPTIBLE);
517 mutex_unlock(&idmap->idmap_im_lock);
518 schedule();
519 __set_current_state(TASK_RUNNING);
520 remove_wait_queue(&idmap->idmap_wq, &wq);
521 mutex_lock(&idmap->idmap_im_lock);
523 if (im->im_status & IDMAP_STATUS_SUCCESS) {
524 *id = im->im_id;
525 ret = 0;
528 out:
529 memset(im, 0, sizeof(*im));
530 mutex_unlock(&idmap->idmap_im_lock);
531 mutex_unlock(&idmap->idmap_lock);
532 return ret;
536 * ID -> Name
538 static int
539 nfs_idmap_name(struct idmap *idmap, struct idmap_hashtable *h,
540 __u32 id, char *name)
542 struct rpc_pipe_msg msg;
543 struct idmap_msg *im;
544 struct idmap_hashent *he;
545 DECLARE_WAITQUEUE(wq, current);
546 int ret = -EIO;
547 unsigned int len;
549 im = &idmap->idmap_im;
551 mutex_lock(&idmap->idmap_lock);
552 mutex_lock(&idmap->idmap_im_lock);
554 he = idmap_lookup_id(h, id);
555 if (he) {
556 memcpy(name, he->ih_name, he->ih_namelen);
557 ret = he->ih_namelen;
558 goto out;
561 memset(im, 0, sizeof(*im));
562 im->im_type = h->h_type;
563 im->im_conv = IDMAP_CONV_IDTONAME;
564 im->im_id = id;
566 memset(&msg, 0, sizeof(msg));
567 msg.data = im;
568 msg.len = sizeof(*im);
570 add_wait_queue(&idmap->idmap_wq, &wq);
572 if (rpc_queue_upcall(idmap->idmap_dentry->d_inode, &msg) < 0) {
573 remove_wait_queue(&idmap->idmap_wq, &wq);
574 goto out;
577 set_current_state(TASK_UNINTERRUPTIBLE);
578 mutex_unlock(&idmap->idmap_im_lock);
579 schedule();
580 __set_current_state(TASK_RUNNING);
581 remove_wait_queue(&idmap->idmap_wq, &wq);
582 mutex_lock(&idmap->idmap_im_lock);
584 if (im->im_status & IDMAP_STATUS_SUCCESS) {
585 if ((len = strnlen(im->im_name, IDMAP_NAMESZ)) == 0)
586 goto out;
587 memcpy(name, im->im_name, len);
588 ret = len;
591 out:
592 memset(im, 0, sizeof(*im));
593 mutex_unlock(&idmap->idmap_im_lock);
594 mutex_unlock(&idmap->idmap_lock);
595 return ret;
598 /* RPC pipefs upcall/downcall routines */
599 static ssize_t
600 idmap_pipe_upcall(struct file *filp, struct rpc_pipe_msg *msg,
601 char __user *dst, size_t buflen)
603 char *data = (char *)msg->data + msg->copied;
604 size_t mlen = min(msg->len, buflen);
605 unsigned long left;
607 left = copy_to_user(dst, data, mlen);
608 if (left == mlen) {
609 msg->errno = -EFAULT;
610 return -EFAULT;
613 mlen -= left;
614 msg->copied += mlen;
615 msg->errno = 0;
616 return mlen;
619 static ssize_t
620 idmap_pipe_downcall(struct file *filp, const char __user *src, size_t mlen)
622 struct rpc_inode *rpci = RPC_I(filp->f_path.dentry->d_inode);
623 struct idmap *idmap = (struct idmap *)rpci->private;
624 struct idmap_msg im_in, *im = &idmap->idmap_im;
625 struct idmap_hashtable *h;
626 struct idmap_hashent *he = NULL;
627 size_t namelen_in;
628 int ret;
630 if (mlen != sizeof(im_in))
631 return -ENOSPC;
633 if (copy_from_user(&im_in, src, mlen) != 0)
634 return -EFAULT;
636 mutex_lock(&idmap->idmap_im_lock);
638 ret = mlen;
639 im->im_status = im_in.im_status;
640 /* If we got an error, terminate now, and wake up pending upcalls */
641 if (!(im_in.im_status & IDMAP_STATUS_SUCCESS)) {
642 wake_up(&idmap->idmap_wq);
643 goto out;
646 /* Sanity checking of strings */
647 ret = -EINVAL;
648 namelen_in = strnlen(im_in.im_name, IDMAP_NAMESZ);
649 if (namelen_in == 0 || namelen_in == IDMAP_NAMESZ)
650 goto out;
652 switch (im_in.im_type) {
653 case IDMAP_TYPE_USER:
654 h = &idmap->idmap_user_hash;
655 break;
656 case IDMAP_TYPE_GROUP:
657 h = &idmap->idmap_group_hash;
658 break;
659 default:
660 goto out;
663 switch (im_in.im_conv) {
664 case IDMAP_CONV_IDTONAME:
665 /* Did we match the current upcall? */
666 if (im->im_conv == IDMAP_CONV_IDTONAME
667 && im->im_type == im_in.im_type
668 && im->im_id == im_in.im_id) {
669 /* Yes: copy string, including the terminating '\0' */
670 memcpy(im->im_name, im_in.im_name, namelen_in);
671 im->im_name[namelen_in] = '\0';
672 wake_up(&idmap->idmap_wq);
674 he = idmap_alloc_id(h, im_in.im_id);
675 break;
676 case IDMAP_CONV_NAMETOID:
677 /* Did we match the current upcall? */
678 if (im->im_conv == IDMAP_CONV_NAMETOID
679 && im->im_type == im_in.im_type
680 && strnlen(im->im_name, IDMAP_NAMESZ) == namelen_in
681 && memcmp(im->im_name, im_in.im_name, namelen_in) == 0) {
682 im->im_id = im_in.im_id;
683 wake_up(&idmap->idmap_wq);
685 he = idmap_alloc_name(h, im_in.im_name, namelen_in);
686 break;
687 default:
688 goto out;
691 /* If the entry is valid, also copy it to the cache */
692 if (he != NULL)
693 idmap_update_entry(he, im_in.im_name, namelen_in, im_in.im_id);
694 ret = mlen;
695 out:
696 mutex_unlock(&idmap->idmap_im_lock);
697 return ret;
700 static void
701 idmap_pipe_destroy_msg(struct rpc_pipe_msg *msg)
703 struct idmap_msg *im = msg->data;
704 struct idmap *idmap = container_of(im, struct idmap, idmap_im);
706 if (msg->errno >= 0)
707 return;
708 mutex_lock(&idmap->idmap_im_lock);
709 im->im_status = IDMAP_STATUS_LOOKUPFAIL;
710 wake_up(&idmap->idmap_wq);
711 mutex_unlock(&idmap->idmap_im_lock);
715 * Fowler/Noll/Vo hash
716 * http://www.isthe.com/chongo/tech/comp/fnv/
719 #define FNV_P_32 ((unsigned int)0x01000193) /* 16777619 */
720 #define FNV_1_32 ((unsigned int)0x811c9dc5) /* 2166136261 */
722 static unsigned int fnvhash32(const void *buf, size_t buflen)
724 const unsigned char *p, *end = (const unsigned char *)buf + buflen;
725 unsigned int hash = FNV_1_32;
727 for (p = buf; p < end; p++) {
728 hash *= FNV_P_32;
729 hash ^= (unsigned int)*p;
732 return hash;
735 int nfs_map_name_to_uid(const struct nfs_server *server, const char *name, size_t namelen, __u32 *uid)
737 struct idmap *idmap = server->nfs_client->cl_idmap;
739 if (nfs_map_string_to_numeric(name, namelen, uid))
740 return 0;
741 return nfs_idmap_id(idmap, &idmap->idmap_user_hash, name, namelen, uid);
744 int nfs_map_group_to_gid(const struct nfs_server *server, const char *name, size_t namelen, __u32 *uid)
746 struct idmap *idmap = server->nfs_client->cl_idmap;
748 if (nfs_map_string_to_numeric(name, namelen, uid))
749 return 0;
750 return nfs_idmap_id(idmap, &idmap->idmap_group_hash, name, namelen, uid);
753 int nfs_map_uid_to_name(const struct nfs_server *server, __u32 uid, char *buf, size_t buflen)
755 struct idmap *idmap = server->nfs_client->cl_idmap;
756 int ret = -EINVAL;
758 if (!(server->caps & NFS_CAP_UIDGID_NOMAP))
759 ret = nfs_idmap_name(idmap, &idmap->idmap_user_hash, uid, buf);
760 if (ret < 0)
761 ret = nfs_map_numeric_to_string(uid, buf, buflen);
762 return ret;
764 int nfs_map_gid_to_group(const struct nfs_server *server, __u32 uid, char *buf, size_t buflen)
766 struct idmap *idmap = server->nfs_client->cl_idmap;
767 int ret = -EINVAL;
769 if (!(server->caps & NFS_CAP_UIDGID_NOMAP))
770 ret = nfs_idmap_name(idmap, &idmap->idmap_group_hash, uid, buf);
771 if (ret < 0)
772 ret = nfs_map_numeric_to_string(uid, buf, buflen);
773 return ret;
776 #endif /* CONFIG_NFS_USE_NEW_IDMAPPER */