4 * UID and GID to name mapping for clients.
6 * Copyright (c) 2002 The Regents of the University of Michigan.
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
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.
37 #include <linux/module.h>
38 #include <linux/mutex.h>
39 #include <linux/init.h>
40 #include <linux/types.h>
41 #include <linux/slab.h>
42 #include <linux/socket.h>
44 #include <linux/sched.h>
46 #include <linux/sunrpc/clnt.h>
47 #include <linux/workqueue.h>
48 #include <linux/sunrpc/rpc_pipe_fs.h>
50 #include <linux/nfs_fs.h>
52 #include <linux/nfs_idmap.h>
55 #define IDMAP_HASH_SZ 128
57 /* Default cache timeout is 10 minutes */
58 unsigned int nfs_idmap_cache_timeout
= 600 * HZ
;
60 struct idmap_hashent
{
61 unsigned long ih_expires
;
64 char ih_name
[IDMAP_NAMESZ
];
67 struct idmap_hashtable
{
69 struct idmap_hashent h_entries
[IDMAP_HASH_SZ
];
74 struct dentry
*idmap_dentry
;
75 wait_queue_head_t idmap_wq
;
76 struct idmap_msg idmap_im
;
77 struct mutex idmap_lock
; /* Serializes upcalls */
78 struct mutex idmap_im_lock
; /* Protects the hashtable */
79 struct idmap_hashtable idmap_user_hash
;
80 struct idmap_hashtable idmap_group_hash
;
83 static ssize_t
idmap_pipe_upcall(struct file
*, struct rpc_pipe_msg
*,
84 char __user
*, size_t);
85 static ssize_t
idmap_pipe_downcall(struct file
*, const char __user
*,
87 static void idmap_pipe_destroy_msg(struct rpc_pipe_msg
*);
89 static unsigned int fnvhash32(const void *, size_t);
91 static struct rpc_pipe_ops idmap_upcall_ops
= {
92 .upcall
= idmap_pipe_upcall
,
93 .downcall
= idmap_pipe_downcall
,
94 .destroy_msg
= idmap_pipe_destroy_msg
,
98 nfs_idmap_new(struct nfs4_client
*clp
)
102 if (clp
->cl_idmap
!= NULL
)
104 if ((idmap
= kzalloc(sizeof(*idmap
), GFP_KERNEL
)) == NULL
)
107 snprintf(idmap
->idmap_path
, sizeof(idmap
->idmap_path
),
108 "%s/idmap", clp
->cl_rpcclient
->cl_pathname
);
110 idmap
->idmap_dentry
= rpc_mkpipe(idmap
->idmap_path
,
111 idmap
, &idmap_upcall_ops
, 0);
112 if (IS_ERR(idmap
->idmap_dentry
)) {
117 mutex_init(&idmap
->idmap_lock
);
118 mutex_init(&idmap
->idmap_im_lock
);
119 init_waitqueue_head(&idmap
->idmap_wq
);
120 idmap
->idmap_user_hash
.h_type
= IDMAP_TYPE_USER
;
121 idmap
->idmap_group_hash
.h_type
= IDMAP_TYPE_GROUP
;
123 clp
->cl_idmap
= idmap
;
127 nfs_idmap_delete(struct nfs4_client
*clp
)
129 struct idmap
*idmap
= clp
->cl_idmap
;
133 dput(idmap
->idmap_dentry
);
134 idmap
->idmap_dentry
= NULL
;
135 rpc_unlink(idmap
->idmap_path
);
136 clp
->cl_idmap
= NULL
;
141 * Helper routines for manipulating the hashtable
143 static inline struct idmap_hashent
*
144 idmap_name_hash(struct idmap_hashtable
* h
, const char *name
, size_t len
)
146 return &h
->h_entries
[fnvhash32(name
, len
) % IDMAP_HASH_SZ
];
149 static struct idmap_hashent
*
150 idmap_lookup_name(struct idmap_hashtable
*h
, const char *name
, size_t len
)
152 struct idmap_hashent
*he
= idmap_name_hash(h
, name
, len
);
154 if (he
->ih_namelen
!= len
|| memcmp(he
->ih_name
, name
, len
) != 0)
156 if (time_after(jiffies
, he
->ih_expires
))
161 static inline struct idmap_hashent
*
162 idmap_id_hash(struct idmap_hashtable
* h
, __u32 id
)
164 return &h
->h_entries
[fnvhash32(&id
, sizeof(id
)) % IDMAP_HASH_SZ
];
167 static struct idmap_hashent
*
168 idmap_lookup_id(struct idmap_hashtable
*h
, __u32 id
)
170 struct idmap_hashent
*he
= idmap_id_hash(h
, id
);
171 if (he
->ih_id
!= id
|| he
->ih_namelen
== 0)
173 if (time_after(jiffies
, he
->ih_expires
))
179 * Routines for allocating new entries in the hashtable.
180 * For now, we just have 1 entry per bucket, so it's all
183 static inline struct idmap_hashent
*
184 idmap_alloc_name(struct idmap_hashtable
*h
, char *name
, unsigned len
)
186 return idmap_name_hash(h
, name
, len
);
189 static inline struct idmap_hashent
*
190 idmap_alloc_id(struct idmap_hashtable
*h
, __u32 id
)
192 return idmap_id_hash(h
, id
);
196 idmap_update_entry(struct idmap_hashent
*he
, const char *name
,
197 size_t namelen
, __u32 id
)
200 memcpy(he
->ih_name
, name
, namelen
);
201 he
->ih_name
[namelen
] = '\0';
202 he
->ih_namelen
= namelen
;
203 he
->ih_expires
= jiffies
+ nfs_idmap_cache_timeout
;
210 nfs_idmap_id(struct idmap
*idmap
, struct idmap_hashtable
*h
,
211 const char *name
, size_t namelen
, __u32
*id
)
213 struct rpc_pipe_msg msg
;
214 struct idmap_msg
*im
;
215 struct idmap_hashent
*he
;
216 DECLARE_WAITQUEUE(wq
, current
);
219 im
= &idmap
->idmap_im
;
222 * String sanity checks
223 * Note that the userland daemon expects NUL terminated strings
228 if (name
[namelen
-1] != '\0')
232 if (namelen
>= IDMAP_NAMESZ
)
235 mutex_lock(&idmap
->idmap_lock
);
236 mutex_lock(&idmap
->idmap_im_lock
);
238 he
= idmap_lookup_name(h
, name
, namelen
);
245 memset(im
, 0, sizeof(*im
));
246 memcpy(im
->im_name
, name
, namelen
);
248 im
->im_type
= h
->h_type
;
249 im
->im_conv
= IDMAP_CONV_NAMETOID
;
251 memset(&msg
, 0, sizeof(msg
));
253 msg
.len
= sizeof(*im
);
255 add_wait_queue(&idmap
->idmap_wq
, &wq
);
256 if (rpc_queue_upcall(idmap
->idmap_dentry
->d_inode
, &msg
) < 0) {
257 remove_wait_queue(&idmap
->idmap_wq
, &wq
);
261 set_current_state(TASK_UNINTERRUPTIBLE
);
262 mutex_unlock(&idmap
->idmap_im_lock
);
264 current
->state
= TASK_RUNNING
;
265 remove_wait_queue(&idmap
->idmap_wq
, &wq
);
266 mutex_lock(&idmap
->idmap_im_lock
);
268 if (im
->im_status
& IDMAP_STATUS_SUCCESS
) {
274 memset(im
, 0, sizeof(*im
));
275 mutex_unlock(&idmap
->idmap_im_lock
);
276 mutex_unlock(&idmap
->idmap_lock
);
284 nfs_idmap_name(struct idmap
*idmap
, struct idmap_hashtable
*h
,
285 __u32 id
, char *name
)
287 struct rpc_pipe_msg msg
;
288 struct idmap_msg
*im
;
289 struct idmap_hashent
*he
;
290 DECLARE_WAITQUEUE(wq
, current
);
294 im
= &idmap
->idmap_im
;
296 mutex_lock(&idmap
->idmap_lock
);
297 mutex_lock(&idmap
->idmap_im_lock
);
299 he
= idmap_lookup_id(h
, id
);
301 memcpy(name
, he
->ih_name
, he
->ih_namelen
);
302 ret
= he
->ih_namelen
;
306 memset(im
, 0, sizeof(*im
));
307 im
->im_type
= h
->h_type
;
308 im
->im_conv
= IDMAP_CONV_IDTONAME
;
311 memset(&msg
, 0, sizeof(msg
));
313 msg
.len
= sizeof(*im
);
315 add_wait_queue(&idmap
->idmap_wq
, &wq
);
317 if (rpc_queue_upcall(idmap
->idmap_dentry
->d_inode
, &msg
) < 0) {
318 remove_wait_queue(&idmap
->idmap_wq
, &wq
);
322 set_current_state(TASK_UNINTERRUPTIBLE
);
323 mutex_unlock(&idmap
->idmap_im_lock
);
325 current
->state
= TASK_RUNNING
;
326 remove_wait_queue(&idmap
->idmap_wq
, &wq
);
327 mutex_lock(&idmap
->idmap_im_lock
);
329 if (im
->im_status
& IDMAP_STATUS_SUCCESS
) {
330 if ((len
= strnlen(im
->im_name
, IDMAP_NAMESZ
)) == 0)
332 memcpy(name
, im
->im_name
, len
);
337 memset(im
, 0, sizeof(*im
));
338 mutex_unlock(&idmap
->idmap_im_lock
);
339 mutex_unlock(&idmap
->idmap_lock
);
343 /* RPC pipefs upcall/downcall routines */
345 idmap_pipe_upcall(struct file
*filp
, struct rpc_pipe_msg
*msg
,
346 char __user
*dst
, size_t buflen
)
348 char *data
= (char *)msg
->data
+ msg
->copied
;
349 ssize_t mlen
= msg
->len
- msg
->copied
;
355 left
= copy_to_user(dst
, data
, mlen
);
367 idmap_pipe_downcall(struct file
*filp
, const char __user
*src
, size_t mlen
)
369 struct rpc_inode
*rpci
= RPC_I(filp
->f_dentry
->d_inode
);
370 struct idmap
*idmap
= (struct idmap
*)rpci
->private;
371 struct idmap_msg im_in
, *im
= &idmap
->idmap_im
;
372 struct idmap_hashtable
*h
;
373 struct idmap_hashent
*he
= NULL
;
377 if (mlen
!= sizeof(im_in
))
380 if (copy_from_user(&im_in
, src
, mlen
) != 0)
383 mutex_lock(&idmap
->idmap_im_lock
);
386 im
->im_status
= im_in
.im_status
;
387 /* If we got an error, terminate now, and wake up pending upcalls */
388 if (!(im_in
.im_status
& IDMAP_STATUS_SUCCESS
)) {
389 wake_up(&idmap
->idmap_wq
);
393 /* Sanity checking of strings */
395 namelen_in
= strnlen(im_in
.im_name
, IDMAP_NAMESZ
);
396 if (namelen_in
== 0 || namelen_in
== IDMAP_NAMESZ
)
399 switch (im_in
.im_type
) {
400 case IDMAP_TYPE_USER
:
401 h
= &idmap
->idmap_user_hash
;
403 case IDMAP_TYPE_GROUP
:
404 h
= &idmap
->idmap_group_hash
;
410 switch (im_in
.im_conv
) {
411 case IDMAP_CONV_IDTONAME
:
412 /* Did we match the current upcall? */
413 if (im
->im_conv
== IDMAP_CONV_IDTONAME
414 && im
->im_type
== im_in
.im_type
415 && im
->im_id
== im_in
.im_id
) {
416 /* Yes: copy string, including the terminating '\0' */
417 memcpy(im
->im_name
, im_in
.im_name
, namelen_in
);
418 im
->im_name
[namelen_in
] = '\0';
419 wake_up(&idmap
->idmap_wq
);
421 he
= idmap_alloc_id(h
, im_in
.im_id
);
423 case IDMAP_CONV_NAMETOID
:
424 /* Did we match the current upcall? */
425 if (im
->im_conv
== IDMAP_CONV_NAMETOID
426 && im
->im_type
== im_in
.im_type
427 && strnlen(im
->im_name
, IDMAP_NAMESZ
) == namelen_in
428 && memcmp(im
->im_name
, im_in
.im_name
, namelen_in
) == 0) {
429 im
->im_id
= im_in
.im_id
;
430 wake_up(&idmap
->idmap_wq
);
432 he
= idmap_alloc_name(h
, im_in
.im_name
, namelen_in
);
438 /* If the entry is valid, also copy it to the cache */
440 idmap_update_entry(he
, im_in
.im_name
, namelen_in
, im_in
.im_id
);
443 mutex_unlock(&idmap
->idmap_im_lock
);
448 idmap_pipe_destroy_msg(struct rpc_pipe_msg
*msg
)
450 struct idmap_msg
*im
= msg
->data
;
451 struct idmap
*idmap
= container_of(im
, struct idmap
, idmap_im
);
455 mutex_lock(&idmap
->idmap_im_lock
);
456 im
->im_status
= IDMAP_STATUS_LOOKUPFAIL
;
457 wake_up(&idmap
->idmap_wq
);
458 mutex_unlock(&idmap
->idmap_im_lock
);
462 * Fowler/Noll/Vo hash
463 * http://www.isthe.com/chongo/tech/comp/fnv/
466 #define FNV_P_32 ((unsigned int)0x01000193) /* 16777619 */
467 #define FNV_1_32 ((unsigned int)0x811c9dc5) /* 2166136261 */
469 static unsigned int fnvhash32(const void *buf
, size_t buflen
)
471 const unsigned char *p
, *end
= (const unsigned char *)buf
+ buflen
;
472 unsigned int hash
= FNV_1_32
;
474 for (p
= buf
; p
< end
; p
++) {
476 hash
^= (unsigned int)*p
;
482 int nfs_map_name_to_uid(struct nfs4_client
*clp
, const char *name
, size_t namelen
, __u32
*uid
)
484 struct idmap
*idmap
= clp
->cl_idmap
;
486 return nfs_idmap_id(idmap
, &idmap
->idmap_user_hash
, name
, namelen
, uid
);
489 int nfs_map_group_to_gid(struct nfs4_client
*clp
, const char *name
, size_t namelen
, __u32
*uid
)
491 struct idmap
*idmap
= clp
->cl_idmap
;
493 return nfs_idmap_id(idmap
, &idmap
->idmap_group_hash
, name
, namelen
, uid
);
496 int nfs_map_uid_to_name(struct nfs4_client
*clp
, __u32 uid
, char *buf
)
498 struct idmap
*idmap
= clp
->cl_idmap
;
500 return nfs_idmap_name(idmap
, &idmap
->idmap_user_hash
, uid
, buf
);
502 int nfs_map_gid_to_group(struct nfs4_client
*clp
, __u32 uid
, char *buf
)
504 struct idmap
*idmap
= clp
->cl_idmap
;
506 return nfs_idmap_name(idmap
, &idmap
->idmap_group_hash
, uid
, buf
);