at v2.6.39 779 lines 19 kB view raw
1/* 2 * fs/nfs/idmap.c 3 * 4 * UID and GID to name mapping for clients. 5 * 6 * Copyright (c) 2002 The Regents of the University of Michigan. 7 * All rights reserved. 8 * 9 * Marius Aamodt Eriksen <marius@umich.edu> 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 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. 23 * 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. 35 */ 36#include <linux/types.h> 37#include <linux/string.h> 38#include <linux/kernel.h> 39 40static int nfs_map_string_to_numeric(const char *name, size_t namelen, __u32 *res) 41{ 42 unsigned long val; 43 char buf[16]; 44 45 if (memchr(name, '@', namelen) != NULL || namelen >= sizeof(buf)) 46 return 0; 47 memcpy(buf, name, namelen); 48 buf[namelen] = '\0'; 49 if (strict_strtoul(buf, 0, &val) != 0) 50 return 0; 51 *res = val; 52 return 1; 53} 54 55static int nfs_map_numeric_to_string(__u32 id, char *buf, size_t buflen) 56{ 57 return snprintf(buf, buflen, "%u", id); 58} 59 60#ifdef CONFIG_NFS_USE_NEW_IDMAPPER 61 62#include <linux/slab.h> 63#include <linux/cred.h> 64#include <linux/sunrpc/sched.h> 65#include <linux/nfs4.h> 66#include <linux/nfs_fs_sb.h> 67#include <linux/nfs_idmap.h> 68#include <linux/keyctl.h> 69#include <linux/key-type.h> 70#include <linux/rcupdate.h> 71#include <linux/err.h> 72 73#include <keys/user-type.h> 74 75#define NFS_UINT_MAXLEN 11 76 77const struct cred *id_resolver_cache; 78 79struct 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, 87}; 88 89int nfs_idmap_init(void) 90{ 91 struct cred *cred; 92 struct key *keyring; 93 int ret = 0; 94 95 printk(KERN_NOTICE "Registering the %s key type\n", key_type_id_resolver.name); 96 97 cred = prepare_kernel_cred(NULL); 98 if (!cred) 99 return -ENOMEM; 100 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; 108 } 109 110 ret = key_instantiate_and_link(keyring, NULL, 0, NULL, NULL); 111 if (ret < 0) 112 goto failed_put_key; 113 114 ret = register_key_type(&key_type_id_resolver); 115 if (ret < 0) 116 goto failed_put_key; 117 118 cred->thread_keyring = keyring; 119 cred->jit_keyring = KEY_REQKEY_DEFL_THREAD_KEYRING; 120 id_resolver_cache = cred; 121 return 0; 122 123failed_put_key: 124 key_put(keyring); 125failed_put_cred: 126 put_cred(cred); 127 return ret; 128} 129 130void nfs_idmap_quit(void) 131{ 132 key_revoke(id_resolver_cache->thread_keyring); 133 unregister_key_type(&key_type_id_resolver); 134 put_cred(id_resolver_cache); 135} 136 137/* 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. 141 * 142 * On error 0 is returned. Otherwise, the length of dest is returned. 143 */ 144static ssize_t nfs_idmap_get_desc(const char *name, size_t namelen, 145 const char *type, size_t typelen, char **desc) 146{ 147 char *cp; 148 size_t desclen = typelen + namelen + 2; 149 150 *desc = kmalloc(desclen, GFP_KERNEL); 151 if (!*desc) 152 return -ENOMEM; 153 154 cp = *desc; 155 memcpy(cp, type, typelen); 156 cp += typelen; 157 *cp++ = ':'; 158 159 memcpy(cp, name, namelen); 160 cp += namelen; 161 *cp = '\0'; 162 return desclen; 163} 164 165static ssize_t nfs_idmap_request_key(const char *name, size_t namelen, 166 const char *type, void *data, size_t data_size) 167{ 168 const struct cred *saved_cred; 169 struct key *rkey; 170 char *desc; 171 struct user_key_payload *payload; 172 ssize_t ret; 173 174 ret = nfs_idmap_get_desc(name, namelen, type, strlen(type), &desc); 175 if (ret <= 0) 176 goto out; 177 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; 185 } 186 187 rcu_read_lock(); 188 rkey->perm |= KEY_USR_VIEW; 189 190 ret = key_validate(rkey); 191 if (ret < 0) 192 goto out_up; 193 194 payload = rcu_dereference(rkey->payload.data); 195 if (IS_ERR_OR_NULL(payload)) { 196 ret = PTR_ERR(payload); 197 goto out_up; 198 } 199 200 ret = payload->datalen; 201 if (ret > 0 && ret <= data_size) 202 memcpy(data, payload->data, ret); 203 else 204 ret = -EINVAL; 205 206out_up: 207 rcu_read_unlock(); 208 key_put(rkey); 209out: 210 return ret; 211} 212 213 214/* ID -> Name */ 215static ssize_t nfs_idmap_lookup_name(__u32 id, const char *type, char *buf, size_t buflen) 216{ 217 char id_str[NFS_UINT_MAXLEN]; 218 int id_len; 219 ssize_t ret; 220 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; 226} 227 228/* Name -> ID */ 229static int nfs_idmap_lookup_id(const char *name, size_t namelen, 230 const char *type, __u32 *id) 231{ 232 char id_str[NFS_UINT_MAXLEN]; 233 long id_long; 234 ssize_t data_size; 235 int ret = 0; 236 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; 243 } 244 return ret; 245} 246 247int nfs_map_name_to_uid(const struct nfs_server *server, const char *name, size_t namelen, __u32 *uid) 248{ 249 if (nfs_map_string_to_numeric(name, namelen, uid)) 250 return 0; 251 return nfs_idmap_lookup_id(name, namelen, "uid", uid); 252} 253 254int nfs_map_group_to_gid(const struct nfs_server *server, const char *name, size_t namelen, __u32 *gid) 255{ 256 if (nfs_map_string_to_numeric(name, namelen, gid)) 257 return 0; 258 return nfs_idmap_lookup_id(name, namelen, "gid", gid); 259} 260 261int nfs_map_uid_to_name(const struct nfs_server *server, __u32 uid, char *buf, size_t buflen) 262{ 263 int ret = -EINVAL; 264 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; 270} 271int nfs_map_gid_to_group(const struct nfs_server *server, __u32 gid, char *buf, size_t buflen) 272{ 273 int ret = -EINVAL; 274 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; 280} 281 282#else /* CONFIG_NFS_USE_NEW_IDMAPPER not defined */ 283 284#include <linux/module.h> 285#include <linux/mutex.h> 286#include <linux/init.h> 287#include <linux/slab.h> 288#include <linux/socket.h> 289#include <linux/in.h> 290#include <linux/sched.h> 291 292#include <linux/sunrpc/clnt.h> 293#include <linux/workqueue.h> 294#include <linux/sunrpc/rpc_pipe_fs.h> 295 296#include <linux/nfs_fs.h> 297 298#include <linux/nfs_idmap.h> 299#include "nfs4_fs.h" 300 301#define IDMAP_HASH_SZ 128 302 303/* Default cache timeout is 10 minutes */ 304unsigned int nfs_idmap_cache_timeout = 600 * HZ; 305 306static int param_set_idmap_timeout(const char *val, struct kernel_param *kp) 307{ 308 char *endp; 309 int num = simple_strtol(val, &endp, 0); 310 int jif = num * HZ; 311 if (endp == val || *endp || num < 0 || jif < num) 312 return -EINVAL; 313 *((int *)kp->arg) = jif; 314 return 0; 315} 316 317module_param_call(idmap_cache_timeout, param_set_idmap_timeout, param_get_int, 318 &nfs_idmap_cache_timeout, 0644); 319 320struct idmap_hashent { 321 unsigned long ih_expires; 322 __u32 ih_id; 323 size_t ih_namelen; 324 char ih_name[IDMAP_NAMESZ]; 325}; 326 327struct idmap_hashtable { 328 __u8 h_type; 329 struct idmap_hashent h_entries[IDMAP_HASH_SZ]; 330}; 331 332struct idmap { 333 struct dentry *idmap_dentry; 334 wait_queue_head_t idmap_wq; 335 struct idmap_msg idmap_im; 336 struct mutex idmap_lock; /* Serializes upcalls */ 337 struct mutex idmap_im_lock; /* Protects the hashtable */ 338 struct idmap_hashtable idmap_user_hash; 339 struct idmap_hashtable idmap_group_hash; 340}; 341 342static ssize_t idmap_pipe_upcall(struct file *, struct rpc_pipe_msg *, 343 char __user *, size_t); 344static ssize_t idmap_pipe_downcall(struct file *, const char __user *, 345 size_t); 346static void idmap_pipe_destroy_msg(struct rpc_pipe_msg *); 347 348static unsigned int fnvhash32(const void *, size_t); 349 350static const struct rpc_pipe_ops idmap_upcall_ops = { 351 .upcall = idmap_pipe_upcall, 352 .downcall = idmap_pipe_downcall, 353 .destroy_msg = idmap_pipe_destroy_msg, 354}; 355 356int 357nfs_idmap_new(struct nfs_client *clp) 358{ 359 struct idmap *idmap; 360 int error; 361 362 BUG_ON(clp->cl_idmap != NULL); 363 364 idmap = kzalloc(sizeof(*idmap), GFP_KERNEL); 365 if (idmap == NULL) 366 return -ENOMEM; 367 368 idmap->idmap_dentry = rpc_mkpipe(clp->cl_rpcclient->cl_path.dentry, 369 "idmap", idmap, &idmap_upcall_ops, 0); 370 if (IS_ERR(idmap->idmap_dentry)) { 371 error = PTR_ERR(idmap->idmap_dentry); 372 kfree(idmap); 373 return error; 374 } 375 376 mutex_init(&idmap->idmap_lock); 377 mutex_init(&idmap->idmap_im_lock); 378 init_waitqueue_head(&idmap->idmap_wq); 379 idmap->idmap_user_hash.h_type = IDMAP_TYPE_USER; 380 idmap->idmap_group_hash.h_type = IDMAP_TYPE_GROUP; 381 382 clp->cl_idmap = idmap; 383 return 0; 384} 385 386void 387nfs_idmap_delete(struct nfs_client *clp) 388{ 389 struct idmap *idmap = clp->cl_idmap; 390 391 if (!idmap) 392 return; 393 rpc_unlink(idmap->idmap_dentry); 394 clp->cl_idmap = NULL; 395 kfree(idmap); 396} 397 398/* 399 * Helper routines for manipulating the hashtable 400 */ 401static inline struct idmap_hashent * 402idmap_name_hash(struct idmap_hashtable* h, const char *name, size_t len) 403{ 404 return &h->h_entries[fnvhash32(name, len) % IDMAP_HASH_SZ]; 405} 406 407static struct idmap_hashent * 408idmap_lookup_name(struct idmap_hashtable *h, const char *name, size_t len) 409{ 410 struct idmap_hashent *he = idmap_name_hash(h, name, len); 411 412 if (he->ih_namelen != len || memcmp(he->ih_name, name, len) != 0) 413 return NULL; 414 if (time_after(jiffies, he->ih_expires)) 415 return NULL; 416 return he; 417} 418 419static inline struct idmap_hashent * 420idmap_id_hash(struct idmap_hashtable* h, __u32 id) 421{ 422 return &h->h_entries[fnvhash32(&id, sizeof(id)) % IDMAP_HASH_SZ]; 423} 424 425static struct idmap_hashent * 426idmap_lookup_id(struct idmap_hashtable *h, __u32 id) 427{ 428 struct idmap_hashent *he = idmap_id_hash(h, id); 429 if (he->ih_id != id || he->ih_namelen == 0) 430 return NULL; 431 if (time_after(jiffies, he->ih_expires)) 432 return NULL; 433 return he; 434} 435 436/* 437 * Routines for allocating new entries in the hashtable. 438 * For now, we just have 1 entry per bucket, so it's all 439 * pretty trivial. 440 */ 441static inline struct idmap_hashent * 442idmap_alloc_name(struct idmap_hashtable *h, char *name, size_t len) 443{ 444 return idmap_name_hash(h, name, len); 445} 446 447static inline struct idmap_hashent * 448idmap_alloc_id(struct idmap_hashtable *h, __u32 id) 449{ 450 return idmap_id_hash(h, id); 451} 452 453static void 454idmap_update_entry(struct idmap_hashent *he, const char *name, 455 size_t namelen, __u32 id) 456{ 457 he->ih_id = id; 458 memcpy(he->ih_name, name, namelen); 459 he->ih_name[namelen] = '\0'; 460 he->ih_namelen = namelen; 461 he->ih_expires = jiffies + nfs_idmap_cache_timeout; 462} 463 464/* 465 * Name -> ID 466 */ 467static int 468nfs_idmap_id(struct idmap *idmap, struct idmap_hashtable *h, 469 const char *name, size_t namelen, __u32 *id) 470{ 471 struct rpc_pipe_msg msg; 472 struct idmap_msg *im; 473 struct idmap_hashent *he; 474 DECLARE_WAITQUEUE(wq, current); 475 int ret = -EIO; 476 477 im = &idmap->idmap_im; 478 479 /* 480 * String sanity checks 481 * Note that the userland daemon expects NUL terminated strings 482 */ 483 for (;;) { 484 if (namelen == 0) 485 return -EINVAL; 486 if (name[namelen-1] != '\0') 487 break; 488 namelen--; 489 } 490 if (namelen >= IDMAP_NAMESZ) 491 return -EINVAL; 492 493 mutex_lock(&idmap->idmap_lock); 494 mutex_lock(&idmap->idmap_im_lock); 495 496 he = idmap_lookup_name(h, name, namelen); 497 if (he != NULL) { 498 *id = he->ih_id; 499 ret = 0; 500 goto out; 501 } 502 503 memset(im, 0, sizeof(*im)); 504 memcpy(im->im_name, name, namelen); 505 506 im->im_type = h->h_type; 507 im->im_conv = IDMAP_CONV_NAMETOID; 508 509 memset(&msg, 0, sizeof(msg)); 510 msg.data = im; 511 msg.len = sizeof(*im); 512 513 add_wait_queue(&idmap->idmap_wq, &wq); 514 if (rpc_queue_upcall(idmap->idmap_dentry->d_inode, &msg) < 0) { 515 remove_wait_queue(&idmap->idmap_wq, &wq); 516 goto out; 517 } 518 519 set_current_state(TASK_UNINTERRUPTIBLE); 520 mutex_unlock(&idmap->idmap_im_lock); 521 schedule(); 522 __set_current_state(TASK_RUNNING); 523 remove_wait_queue(&idmap->idmap_wq, &wq); 524 mutex_lock(&idmap->idmap_im_lock); 525 526 if (im->im_status & IDMAP_STATUS_SUCCESS) { 527 *id = im->im_id; 528 ret = 0; 529 } 530 531 out: 532 memset(im, 0, sizeof(*im)); 533 mutex_unlock(&idmap->idmap_im_lock); 534 mutex_unlock(&idmap->idmap_lock); 535 return ret; 536} 537 538/* 539 * ID -> Name 540 */ 541static int 542nfs_idmap_name(struct idmap *idmap, struct idmap_hashtable *h, 543 __u32 id, char *name) 544{ 545 struct rpc_pipe_msg msg; 546 struct idmap_msg *im; 547 struct idmap_hashent *he; 548 DECLARE_WAITQUEUE(wq, current); 549 int ret = -EIO; 550 unsigned int len; 551 552 im = &idmap->idmap_im; 553 554 mutex_lock(&idmap->idmap_lock); 555 mutex_lock(&idmap->idmap_im_lock); 556 557 he = idmap_lookup_id(h, id); 558 if (he) { 559 memcpy(name, he->ih_name, he->ih_namelen); 560 ret = he->ih_namelen; 561 goto out; 562 } 563 564 memset(im, 0, sizeof(*im)); 565 im->im_type = h->h_type; 566 im->im_conv = IDMAP_CONV_IDTONAME; 567 im->im_id = id; 568 569 memset(&msg, 0, sizeof(msg)); 570 msg.data = im; 571 msg.len = sizeof(*im); 572 573 add_wait_queue(&idmap->idmap_wq, &wq); 574 575 if (rpc_queue_upcall(idmap->idmap_dentry->d_inode, &msg) < 0) { 576 remove_wait_queue(&idmap->idmap_wq, &wq); 577 goto out; 578 } 579 580 set_current_state(TASK_UNINTERRUPTIBLE); 581 mutex_unlock(&idmap->idmap_im_lock); 582 schedule(); 583 __set_current_state(TASK_RUNNING); 584 remove_wait_queue(&idmap->idmap_wq, &wq); 585 mutex_lock(&idmap->idmap_im_lock); 586 587 if (im->im_status & IDMAP_STATUS_SUCCESS) { 588 if ((len = strnlen(im->im_name, IDMAP_NAMESZ)) == 0) 589 goto out; 590 memcpy(name, im->im_name, len); 591 ret = len; 592 } 593 594 out: 595 memset(im, 0, sizeof(*im)); 596 mutex_unlock(&idmap->idmap_im_lock); 597 mutex_unlock(&idmap->idmap_lock); 598 return ret; 599} 600 601/* RPC pipefs upcall/downcall routines */ 602static ssize_t 603idmap_pipe_upcall(struct file *filp, struct rpc_pipe_msg *msg, 604 char __user *dst, size_t buflen) 605{ 606 char *data = (char *)msg->data + msg->copied; 607 size_t mlen = min(msg->len, buflen); 608 unsigned long left; 609 610 left = copy_to_user(dst, data, mlen); 611 if (left == mlen) { 612 msg->errno = -EFAULT; 613 return -EFAULT; 614 } 615 616 mlen -= left; 617 msg->copied += mlen; 618 msg->errno = 0; 619 return mlen; 620} 621 622static ssize_t 623idmap_pipe_downcall(struct file *filp, const char __user *src, size_t mlen) 624{ 625 struct rpc_inode *rpci = RPC_I(filp->f_path.dentry->d_inode); 626 struct idmap *idmap = (struct idmap *)rpci->private; 627 struct idmap_msg im_in, *im = &idmap->idmap_im; 628 struct idmap_hashtable *h; 629 struct idmap_hashent *he = NULL; 630 size_t namelen_in; 631 int ret; 632 633 if (mlen != sizeof(im_in)) 634 return -ENOSPC; 635 636 if (copy_from_user(&im_in, src, mlen) != 0) 637 return -EFAULT; 638 639 mutex_lock(&idmap->idmap_im_lock); 640 641 ret = mlen; 642 im->im_status = im_in.im_status; 643 /* If we got an error, terminate now, and wake up pending upcalls */ 644 if (!(im_in.im_status & IDMAP_STATUS_SUCCESS)) { 645 wake_up(&idmap->idmap_wq); 646 goto out; 647 } 648 649 /* Sanity checking of strings */ 650 ret = -EINVAL; 651 namelen_in = strnlen(im_in.im_name, IDMAP_NAMESZ); 652 if (namelen_in == 0 || namelen_in == IDMAP_NAMESZ) 653 goto out; 654 655 switch (im_in.im_type) { 656 case IDMAP_TYPE_USER: 657 h = &idmap->idmap_user_hash; 658 break; 659 case IDMAP_TYPE_GROUP: 660 h = &idmap->idmap_group_hash; 661 break; 662 default: 663 goto out; 664 } 665 666 switch (im_in.im_conv) { 667 case IDMAP_CONV_IDTONAME: 668 /* Did we match the current upcall? */ 669 if (im->im_conv == IDMAP_CONV_IDTONAME 670 && im->im_type == im_in.im_type 671 && im->im_id == im_in.im_id) { 672 /* Yes: copy string, including the terminating '\0' */ 673 memcpy(im->im_name, im_in.im_name, namelen_in); 674 im->im_name[namelen_in] = '\0'; 675 wake_up(&idmap->idmap_wq); 676 } 677 he = idmap_alloc_id(h, im_in.im_id); 678 break; 679 case IDMAP_CONV_NAMETOID: 680 /* Did we match the current upcall? */ 681 if (im->im_conv == IDMAP_CONV_NAMETOID 682 && im->im_type == im_in.im_type 683 && strnlen(im->im_name, IDMAP_NAMESZ) == namelen_in 684 && memcmp(im->im_name, im_in.im_name, namelen_in) == 0) { 685 im->im_id = im_in.im_id; 686 wake_up(&idmap->idmap_wq); 687 } 688 he = idmap_alloc_name(h, im_in.im_name, namelen_in); 689 break; 690 default: 691 goto out; 692 } 693 694 /* If the entry is valid, also copy it to the cache */ 695 if (he != NULL) 696 idmap_update_entry(he, im_in.im_name, namelen_in, im_in.im_id); 697 ret = mlen; 698out: 699 mutex_unlock(&idmap->idmap_im_lock); 700 return ret; 701} 702 703static void 704idmap_pipe_destroy_msg(struct rpc_pipe_msg *msg) 705{ 706 struct idmap_msg *im = msg->data; 707 struct idmap *idmap = container_of(im, struct idmap, idmap_im); 708 709 if (msg->errno >= 0) 710 return; 711 mutex_lock(&idmap->idmap_im_lock); 712 im->im_status = IDMAP_STATUS_LOOKUPFAIL; 713 wake_up(&idmap->idmap_wq); 714 mutex_unlock(&idmap->idmap_im_lock); 715} 716 717/* 718 * Fowler/Noll/Vo hash 719 * http://www.isthe.com/chongo/tech/comp/fnv/ 720 */ 721 722#define FNV_P_32 ((unsigned int)0x01000193) /* 16777619 */ 723#define FNV_1_32 ((unsigned int)0x811c9dc5) /* 2166136261 */ 724 725static unsigned int fnvhash32(const void *buf, size_t buflen) 726{ 727 const unsigned char *p, *end = (const unsigned char *)buf + buflen; 728 unsigned int hash = FNV_1_32; 729 730 for (p = buf; p < end; p++) { 731 hash *= FNV_P_32; 732 hash ^= (unsigned int)*p; 733 } 734 735 return hash; 736} 737 738int nfs_map_name_to_uid(const struct nfs_server *server, const char *name, size_t namelen, __u32 *uid) 739{ 740 struct idmap *idmap = server->nfs_client->cl_idmap; 741 742 if (nfs_map_string_to_numeric(name, namelen, uid)) 743 return 0; 744 return nfs_idmap_id(idmap, &idmap->idmap_user_hash, name, namelen, uid); 745} 746 747int nfs_map_group_to_gid(const struct nfs_server *server, const char *name, size_t namelen, __u32 *uid) 748{ 749 struct idmap *idmap = server->nfs_client->cl_idmap; 750 751 if (nfs_map_string_to_numeric(name, namelen, uid)) 752 return 0; 753 return nfs_idmap_id(idmap, &idmap->idmap_group_hash, name, namelen, uid); 754} 755 756int nfs_map_uid_to_name(const struct nfs_server *server, __u32 uid, char *buf, size_t buflen) 757{ 758 struct idmap *idmap = server->nfs_client->cl_idmap; 759 int ret = -EINVAL; 760 761 if (!(server->caps & NFS_CAP_UIDGID_NOMAP)) 762 ret = nfs_idmap_name(idmap, &idmap->idmap_user_hash, uid, buf); 763 if (ret < 0) 764 ret = nfs_map_numeric_to_string(uid, buf, buflen); 765 return ret; 766} 767int nfs_map_gid_to_group(const struct nfs_server *server, __u32 uid, char *buf, size_t buflen) 768{ 769 struct idmap *idmap = server->nfs_client->cl_idmap; 770 int ret = -EINVAL; 771 772 if (!(server->caps & NFS_CAP_UIDGID_NOMAP)) 773 ret = nfs_idmap_name(idmap, &idmap->idmap_group_hash, uid, buf); 774 if (ret < 0) 775 ret = nfs_map_numeric_to_string(uid, buf, buflen); 776 return ret; 777} 778 779#endif /* CONFIG_NFS_USE_NEW_IDMAPPER */