1 /*
2 * CDDL HEADER START
3 *
4 * The contents of this file are subject to the terms of the
5 * Common Development and Distribution License (the "License").
6 * You may not use this file except in compliance with the License.
7 *
8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
9 * or http://www.opensolaris.org/os/licensing.
10 * See the License for the specific language governing permissions
11 * and limitations under the License.
12 *
13 * When distributing Covered Code, include this CDDL HEADER in each
14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 * If applicable, add the following below this CDDL HEADER, with the
16 * fields enclosed by brackets "[]" replaced with your own identifying
17 * information: Portions Copyright [yyyy] [name of copyright owner]
18 *
19 * CDDL HEADER END
20 */
21
22 /*
23 * Copyright 2015 Nexenta Systems, Inc. All rights reserved.
24 * Copyright (c) 1990, 2010, Oracle and/or its affiliates. All rights reserved.
25 */
26
27 /*
28 * Copyright 1983, 1984, 1985, 1986, 1987, 1988, 1989 AT&T.
29 * All rights reserved.
30 */
31
32
33 #include <sys/types.h>
34 #include <sys/param.h>
35 #include <sys/time.h>
36 #include <sys/vfs.h>
37 #include <sys/vnode.h>
38 #include <sys/socket.h>
39 #include <sys/errno.h>
40 #include <sys/uio.h>
41 #include <sys/proc.h>
42 #include <sys/user.h>
43 #include <sys/file.h>
44 #include <sys/tiuser.h>
45 #include <sys/kmem.h>
46 #include <sys/pathname.h>
47 #include <sys/debug.h>
48 #include <sys/vtrace.h>
49 #include <sys/cmn_err.h>
50 #include <sys/acl.h>
51 #include <sys/utsname.h>
52 #include <sys/sdt.h>
53 #include <netinet/in.h>
54 #include <sys/avl.h>
55
56 #include <rpc/types.h>
57 #include <rpc/auth.h>
58 #include <rpc/svc.h>
59
60 #include <nfs/nfs.h>
61 #include <nfs/export.h>
62 #include <nfs/nfssys.h>
63 #include <nfs/nfs_clnt.h>
64 #include <nfs/nfs_acl.h>
65 #include <nfs/nfs_log.h>
66 #include <nfs/lm.h>
67 #include <sys/sunddi.h>
68 #include <sys/pkp_hash.h>
69
70 treenode_t *ns_root;
71
72 struct exportinfo *exptable_path_hash[PKP_HASH_SIZE];
73 struct exportinfo *exptable[EXPTABLESIZE];
74
75 static int unexport(exportinfo_t *);
76 static void exportfree(exportinfo_t *);
77 static int loadindex(exportdata_t *);
78
79 extern void nfsauth_cache_free(exportinfo_t *);
80 extern int sec_svc_loadrootnames(int, int, caddr_t **, model_t);
81 extern void sec_svc_freerootnames(int, int, caddr_t *);
82
83 static int build_seclist_nodups(exportdata_t *, secinfo_t *, int);
84 static void srv_secinfo_add(secinfo_t **, int *, secinfo_t *, int, int);
85 static void srv_secinfo_remove(secinfo_t **, int *, secinfo_t *, int);
86 static void srv_secinfo_treeclimb(exportinfo_t *, secinfo_t *, int, int);
87
88 #ifdef VOLATILE_FH_TEST
89 static struct ex_vol_rename *find_volrnm_fh(exportinfo_t *, nfs_fh4 *);
90 static uint32_t find_volrnm_fh_id(exportinfo_t *, nfs_fh4 *);
91 static void free_volrnm_list(exportinfo_t *);
92 #endif /* VOLATILE_FH_TEST */
93
94 /*
95 * exported_lock Read/Write lock that protects the exportinfo list.
96 * This lock must be held when searching or modifiying
97 * the exportinfo list.
98 */
99 krwlock_t exported_lock;
100
101 /*
102 * "public" and default (root) location for public filehandle
103 */
104 struct exportinfo *exi_public, *exi_root;
105
106 fid_t exi_rootfid; /* for checking the default public file handle */
107
108 fhandle_t nullfh2; /* for comparing V2 filehandles */
109
110 /*
111 * macro for static dtrace probes to trace server namespace ref count mods.
112 */
113 #define SECREF_TRACE(seclist, tag, flav, aftcnt) \
114 DTRACE_PROBE4(nfss__i__nmspc__secref, struct secinfo *, (seclist), \
115 char *, (tag), int, (int)(flav), int, (int)(aftcnt))
116
117
118 #define exptablehash(fsid, fid) (nfs_fhhash((fsid), (fid)) & (EXPTABLESIZE - 1))
119
120 static uint8_t
121 xor_hash(uint8_t *data, int len)
122 {
123 uint8_t h = 0;
124
125 while (len--)
126 h ^= *data++;
127
128 return (h);
129 }
130
131 /*
132 * File handle hash function, XOR over all bytes in fsid and fid.
133 */
134 static unsigned
135 nfs_fhhash(fsid_t *fsid, fid_t *fid)
136 {
137 int len;
138 uint8_t h;
139
140 h = xor_hash((uint8_t *)fsid, sizeof (fsid_t));
141
142 /*
143 * Sanity check the length before using it
144 * blindly in case the client trashed it.
145 */
146 len = fid->fid_len > NFS_FH4MAXDATA ? 0 : fid->fid_len;
147 h ^= xor_hash((uint8_t *)fid->fid_data, len);
148
149 return ((unsigned)h);
150 }
151
152 /*
153 * Free the memory allocated within a secinfo entry.
154 */
155 void
156 srv_secinfo_entry_free(struct secinfo *secp)
157 {
158 if (secp->s_rootcnt > 0 && secp->s_rootnames != NULL) {
159 sec_svc_freerootnames(secp->s_secinfo.sc_rpcnum,
160 secp->s_rootcnt, secp->s_rootnames);
161 secp->s_rootcnt = 0;
162 }
163
164 if ((secp->s_secinfo.sc_rpcnum == RPCSEC_GSS) &&
165 (secp->s_secinfo.sc_gss_mech_type)) {
166 kmem_free(secp->s_secinfo.sc_gss_mech_type->elements,
167 secp->s_secinfo.sc_gss_mech_type->length);
168 kmem_free(secp->s_secinfo.sc_gss_mech_type,
169 sizeof (rpc_gss_OID_desc));
170 secp->s_secinfo.sc_gss_mech_type = NULL;
171 }
172 }
173
174 /*
175 * Free a list of secinfo allocated in the exportdata structure.
176 */
177 void
178 srv_secinfo_list_free(struct secinfo *secinfo, int cnt)
179 {
180 int i;
181
182 if (cnt == 0)
183 return;
184
185 for (i = 0; i < cnt; i++)
186 srv_secinfo_entry_free(&secinfo[i]);
187
188 kmem_free(secinfo, cnt * sizeof (struct secinfo));
189 }
190
191 /*
192 * Allocate and copy a secinfo data from "from" to "to".
193 *
194 * This routine is used by srv_secinfo_add() to add a new flavor to an
195 * ancestor's export node. The rootnames are not copied because the
196 * allowable rootname access only applies to the explicit exported node,
197 * not its ancestor's.
198 *
199 * "to" should have already been allocated and zeroed before calling
200 * this routine.
201 *
202 * This routine is used under the protection of exported_lock (RW_WRITER).
203 */
204 void
205 srv_secinfo_copy(struct secinfo *from, struct secinfo *to)
206 {
207 to->s_secinfo.sc_nfsnum = from->s_secinfo.sc_nfsnum;
208 to->s_secinfo.sc_rpcnum = from->s_secinfo.sc_rpcnum;
209
210 if (from->s_secinfo.sc_rpcnum == RPCSEC_GSS) {
211 to->s_secinfo.sc_service = from->s_secinfo.sc_service;
212 bcopy(from->s_secinfo.sc_name, to->s_secinfo.sc_name,
213 strlen(from->s_secinfo.sc_name));
214 bcopy(from->s_secinfo.sc_gss_mech, to->s_secinfo.sc_gss_mech,
215 strlen(from->s_secinfo.sc_gss_mech));
216
217 /* copy mechanism oid */
218 to->s_secinfo.sc_gss_mech_type =
219 kmem_alloc(sizeof (rpc_gss_OID_desc), KM_SLEEP);
220 to->s_secinfo.sc_gss_mech_type->length =
221 from->s_secinfo.sc_gss_mech_type->length;
222 to->s_secinfo.sc_gss_mech_type->elements =
223 kmem_alloc(from->s_secinfo.sc_gss_mech_type->length,
224 KM_SLEEP);
225 bcopy(from->s_secinfo.sc_gss_mech_type->elements,
226 to->s_secinfo.sc_gss_mech_type->elements,
227 from->s_secinfo.sc_gss_mech_type->length);
228 }
229
230 to->s_refcnt = from->s_refcnt;
231 to->s_window = from->s_window;
232 /* no need to copy the mode bits - s_flags */
233 }
234
235 /*
236 * Create a secinfo array without duplicates. The condensed
237 * flavor list is used to propagate flavor ref counts to an
238 * export's ancestor pseudonodes.
239 */
240 static int
241 build_seclist_nodups(exportdata_t *exd, secinfo_t *nodups, int exponly)
242 {
243 int ccnt, c;
244 int ncnt, n;
245 struct secinfo *cursec;
246
247 ncnt = 0;
248 ccnt = exd->ex_seccnt;
249 cursec = exd->ex_secinfo;
250
251 for (c = 0; c < ccnt; c++) {
252
253 if (exponly && ! SEC_REF_EXPORTED(&cursec[c]))
254 continue;
255
256 for (n = 0; n < ncnt; n++) {
257 if (nodups[n].s_secinfo.sc_nfsnum ==
258 cursec[c].s_secinfo.sc_nfsnum)
259 break;
260 }
261
262 /*
263 * The structure copy below also copys ptrs embedded
264 * within struct secinfo. The ptrs are copied but
265 * they are never freed from the nodups array. If
266 * an ancestor's secinfo array doesn't contain one
267 * of the nodups flavors, then the entry is properly
268 * copied into the ancestor's secinfo array.
269 * (see srv_secinfo_copy)
270 */
271 if (n == ncnt) {
272 nodups[n] = cursec[c];
273 ncnt++;
274 }
275 }
276 return (ncnt);
277 }
278
279 /*
280 * Add the new security flavors from newdata to the current list, pcursec.
281 * Upon return, *pcursec has the newly merged secinfo list.
282 *
283 * There should be at least 1 secinfo entry in newsec.
284 *
285 * This routine is used under the protection of exported_lock (RW_WRITER).
286 */
287 static void
288 srv_secinfo_add(secinfo_t **pcursec, int *pcurcnt, secinfo_t *newsec,
289 int newcnt, int is_pseudo)
290 {
291 int ccnt, c; /* sec count in current data - curdata */
292 int n; /* index for newsec - newsecinfo */
293 int tcnt; /* total sec count after merge */
294 int mcnt; /* total sec count after merge */
295 struct secinfo *msec; /* merged secinfo list */
296 struct secinfo *cursec;
297
298 cursec = *pcursec;
299 ccnt = *pcurcnt;
300
301 ASSERT(newcnt > 0);
302 tcnt = ccnt + newcnt;
303
304 for (n = 0; n < newcnt; n++) {
305 for (c = 0; c < ccnt; c++) {
306 if (newsec[n].s_secinfo.sc_nfsnum ==
307 cursec[c].s_secinfo.sc_nfsnum) {
308 cursec[c].s_refcnt += newsec[n].s_refcnt;
309 SECREF_TRACE(cursec, "add_ref",
310 cursec[c].s_secinfo.sc_nfsnum,
311 cursec[c].s_refcnt);
312 tcnt--;
313 break;
314 }
315 }
316 }
317
318 if (tcnt == ccnt)
319 return; /* no change; no new flavors */
320
321 msec = kmem_zalloc(tcnt * sizeof (struct secinfo), KM_SLEEP);
322
323 /* move current secinfo list data to the new list */
324 for (c = 0; c < ccnt; c++)
325 msec[c] = cursec[c];
326
327 /* Add the flavor that's not in the current data */
328 mcnt = ccnt;
329 for (n = 0; n < newcnt; n++) {
330 for (c = 0; c < ccnt; c++) {
331 if (newsec[n].s_secinfo.sc_nfsnum ==
332 cursec[c].s_secinfo.sc_nfsnum)
333 break;
334 }
335
336 /* This is the one. Add it. */
337 if (c == ccnt) {
338 srv_secinfo_copy(&newsec[n], &msec[mcnt]);
339
340 if (is_pseudo)
341 msec[mcnt].s_flags = M_RO;
342
343 SECREF_TRACE(msec, "new_ref",
344 msec[mcnt].s_secinfo.sc_nfsnum,
345 msec[mcnt].s_refcnt);
346 mcnt++;
347 }
348 }
349
350 ASSERT(mcnt == tcnt);
351
352 /*
353 * Done. Update curdata. Free the old secinfo list in
354 * curdata and return the new sec array info
355 */
356 if (ccnt > 0)
357 kmem_free(cursec, ccnt * sizeof (struct secinfo));
358 *pcurcnt = tcnt;
359 *pcursec = msec;
360 }
361
362 /*
363 * For NFS V4.
364 * Remove the security data of the unexported node from its ancestors.
365 * Assume there is at least one flavor entry in the current sec list
366 * (pcursec).
367 *
368 * This routine is used under the protection of exported_lock (RW_WRITER).
369 *
370 * Every element of remsec is an explicitly exported flavor. If
371 * srv_secinfo_remove() is called fom an exportfs error path, then
372 * the flavor list was derived from the user's share cmdline,
373 * and all flavors are explicit. If it was called from the unshare path,
374 * build_seclist_nodups() was called with the exponly flag.
375 */
376 static void
377 srv_secinfo_remove(secinfo_t **pcursec, int *pcurcnt, secinfo_t *remsec,
378 int remcnt)
379 {
380 int ccnt, c; /* sec count in current data - cursec */
381 int r; /* sec count in removal data - remsec */
382 int tcnt, mcnt; /* total sec count after removing */
383 struct secinfo *msec; /* final secinfo list after removing */
384 struct secinfo *cursec;
385
386 cursec = *pcursec;
387 ccnt = *pcurcnt;
388 tcnt = ccnt;
389
390 for (r = 0; r < remcnt; r++) {
391 /*
392 * At unshare/reshare time, only explicitly shared flavor ref
393 * counts are decremented and propagated to ancestors.
394 * Implicit flavor refs came from shared descendants, and
395 * they must be kept.
396 */
397 if (! SEC_REF_EXPORTED(&remsec[r]))
398 continue;
399
400 for (c = 0; c < ccnt; c++) {
401 if (remsec[r].s_secinfo.sc_nfsnum ==
402 cursec[c].s_secinfo.sc_nfsnum) {
403
404 /*
405 * Decrement secinfo reference count by 1.
406 * If this entry is invalid after decrementing
407 * the count (i.e. count < 1), this entry will
408 * be removed.
409 */
410 cursec[c].s_refcnt--;
411
412 SECREF_TRACE(cursec, "del_ref",
413 cursec[c].s_secinfo.sc_nfsnum,
414 cursec[c].s_refcnt);
415
416 ASSERT(cursec[c].s_refcnt >= 0);
417
418 if (SEC_REF_INVALID(&cursec[c]))
419 tcnt--;
420 break;
421 }
422 }
423 }
424
425 ASSERT(tcnt >= 0);
426 if (tcnt == ccnt)
427 return; /* no change; no flavors to remove */
428
429 if (tcnt == 0) {
430 srv_secinfo_list_free(cursec, ccnt);
431 *pcurcnt = 0;
432 *pcursec = NULL;
433 return;
434 }
435
436 msec = kmem_zalloc(tcnt * sizeof (struct secinfo), KM_SLEEP);
437
438 /* walk thru the given secinfo list to remove the flavors */
439 mcnt = 0;
440 for (c = 0; c < ccnt; c++) {
441 if (SEC_REF_INVALID(&cursec[c])) {
442 srv_secinfo_entry_free(&cursec[c]);
443 } else {
444 msec[mcnt] = cursec[c];
445 mcnt++;
446 }
447 }
448
449 ASSERT(mcnt == tcnt);
450 /*
451 * Done. Update curdata.
452 * Free the existing secinfo list in curdata. All pointers
453 * within the list have either been moved to msec or freed
454 * if it's invalid.
455 */
456 kmem_free(*pcursec, ccnt * sizeof (struct secinfo));
457 *pcursec = msec;
458 *pcurcnt = tcnt;
459 }
460
461
462 /*
463 * For the reshare case, sec flavor accounting happens in 3 steps:
464 * 1) propagate addition of new flavor refs up the ancestor tree
465 * 2) transfer flavor refs of descendants to new/reshared exportdata
466 * 3) propagate removal of old flavor refs up the ancestor tree
467 *
468 * srv_secinfo_exp2exp() implements step 2 of a reshare. At this point,
469 * the new flavor list has already been propagated up through the
470 * ancestor tree via srv_secinfo_treeclimb().
471 *
472 * If there is more than 1 export reference to an old flavor (i.e. some
473 * of its children shared with this flavor), this flavor information
474 * needs to be transferred to the new exportdata struct. A flavor in
475 * the old exportdata has descendant refs when its s_refcnt > 1 or it
476 * is implicitly shared (M_SEC4_EXPORTED not set in s_flags).
477 *
478 * SEC_REF_EXPORTED() is only true when M_SEC4_EXPORTED is set
479 * SEC_REF_SELF() is only true when both M_SEC4_EXPORTED is set and s_refcnt==1
480 *
481 * Transferring descendant flavor refcnts happens in 2 passes:
482 * a) flavors used before (oldsecinfo) and after (curdata->ex_secinfo) reshare
483 * b) flavors used before but not after reshare
484 *
485 * This routine is used under the protection of exported_lock (RW_WRITER).
486 */
487 void
488 srv_secinfo_exp2exp(exportdata_t *curdata, secinfo_t *oldsecinfo, int ocnt)
489 {
490 int ccnt, c; /* sec count in current data - curdata */
491 int o; /* sec count in old data - oldsecinfo */
492 int tcnt, mcnt; /* total sec count after the transfer */
493 struct secinfo *msec; /* merged secinfo list */
494
495 ccnt = curdata->ex_seccnt;
496
497 ASSERT(ocnt > 0);
498 ASSERT(!(curdata->ex_flags & EX_PSEUDO));
499
500 /*
501 * If the oldsecinfo has flavors with more than 1 reference count
502 * and the flavor is specified in the reshare, transfer the flavor
503 * refs to the new seclist (curdata.ex_secinfo).
504 */
505 tcnt = ccnt + ocnt;
506
507 for (o = 0; o < ocnt; o++) {
508
509 if (SEC_REF_SELF(&oldsecinfo[o])) {
510 tcnt--;
511 continue;
512 }
513
514 for (c = 0; c < ccnt; c++) {
515 if (oldsecinfo[o].s_secinfo.sc_nfsnum ==
516 curdata->ex_secinfo[c].s_secinfo.sc_nfsnum) {
517
518 /*
519 * add old reference to the current
520 * secinfo count
521 */
522 curdata->ex_secinfo[c].s_refcnt +=
523 oldsecinfo[o].s_refcnt;
524
525 /*
526 * Delete the old export flavor
527 * reference. The initial reference
528 * was created during srv_secinfo_add,
529 * and the count is decremented below
530 * to account for the initial reference.
531 */
532 if (SEC_REF_EXPORTED(&oldsecinfo[o]))
533 curdata->ex_secinfo[c].s_refcnt--;
534
535 SECREF_TRACE(curdata->ex_path,
536 "reshare_xfer_common_child_refs",
537 curdata->ex_secinfo[c].s_secinfo.sc_nfsnum,
538 curdata->ex_secinfo[c].s_refcnt);
539
540 ASSERT(curdata->ex_secinfo[c].s_refcnt >= 0);
541
542 tcnt--;
543 break;
544 }
545 }
546 }
547
548 if (tcnt == ccnt)
549 return; /* no more transfer to do */
550
551 /*
552 * oldsecinfo has flavors referenced by its children that are not
553 * in the current (new) export flavor list. Add these flavors.
554 */
555 msec = kmem_zalloc(tcnt * sizeof (struct secinfo), KM_SLEEP);
556
557 /* move current secinfo list data to the new list */
558 for (c = 0; c < ccnt; c++)
559 msec[c] = curdata->ex_secinfo[c];
560
561 /*
562 * Add the flavor that's not in the new export, but still
563 * referenced by its children.
564 */
565 mcnt = ccnt;
566 for (o = 0; o < ocnt; o++) {
567 if (! SEC_REF_SELF(&oldsecinfo[o])) {
568 for (c = 0; c < ccnt; c++) {
569 if (oldsecinfo[o].s_secinfo.sc_nfsnum ==
570 curdata->ex_secinfo[c].s_secinfo.sc_nfsnum)
571 break;
572 }
573
574 /*
575 * This is the one. Add it. Decrement the ref count
576 * by 1 if the flavor is an explicitly shared flavor
577 * for the oldsecinfo export node.
578 */
579 if (c == ccnt) {
580 srv_secinfo_copy(&oldsecinfo[o], &msec[mcnt]);
581 if (SEC_REF_EXPORTED(&oldsecinfo[o]))
582 msec[mcnt].s_refcnt--;
583
584 SECREF_TRACE(curdata,
585 "reshare_xfer_implicit_child_refs",
586 msec[mcnt].s_secinfo.sc_nfsnum,
587 msec[mcnt].s_refcnt);
588
589 ASSERT(msec[mcnt].s_refcnt >= 0);
590 mcnt++;
591 }
592 }
593 }
594
595 ASSERT(mcnt == tcnt);
596 /*
597 * Done. Update curdata, free the existing secinfo list in
598 * curdata and set the new value.
599 */
600 if (ccnt > 0)
601 kmem_free(curdata->ex_secinfo, ccnt * sizeof (struct secinfo));
602 curdata->ex_seccnt = tcnt;
603 curdata->ex_secinfo = msec;
604 }
605
606 /*
607 * When unsharing an old export node and the old node becomes a pseudo node,
608 * if there is more than 1 export reference to an old flavor (i.e. some of
609 * its children shared with this flavor), this flavor information needs to
610 * be transferred to the new shared node.
611 *
612 * This routine is used under the protection of exported_lock (RW_WRITER).
613 */
614 void
615 srv_secinfo_exp2pseu(exportdata_t *curdata, exportdata_t *olddata)
616 {
617 int ocnt, o; /* sec count in transfer data - trandata */
618 int tcnt, mcnt; /* total sec count after transfer */
619 struct secinfo *msec; /* merged secinfo list */
620
621 ASSERT(curdata->ex_flags & EX_PSEUDO);
622 ASSERT(curdata->ex_seccnt == 0);
623
624 ocnt = olddata->ex_seccnt;
625
626 /*
627 * If the olddata has flavors with more than 1 reference count,
628 * transfer the information to the curdata.
629 */
630 tcnt = ocnt;
631
632 for (o = 0; o < ocnt; o++) {
633 if (SEC_REF_SELF(&olddata->ex_secinfo[o]))
634 tcnt--;
635 }
636
637 if (tcnt == 0)
638 return; /* no transfer to do */
639
640 msec = kmem_zalloc(tcnt * sizeof (struct secinfo), KM_SLEEP);
641
642 mcnt = 0;
643 for (o = 0; o < ocnt; o++) {
644 if (! SEC_REF_SELF(&olddata->ex_secinfo[o])) {
645
646 /*
647 * Decrement the reference count by 1 if the flavor is
648 * an explicitly shared flavor for the olddata export
649 * node.
650 */
651 srv_secinfo_copy(&olddata->ex_secinfo[o], &msec[mcnt]);
652 msec[mcnt].s_flags = M_RO;
653 if (SEC_REF_EXPORTED(&olddata->ex_secinfo[o]))
654 msec[mcnt].s_refcnt--;
655
656 SECREF_TRACE(curdata, "unshare_morph_pseudo",
657 msec[mcnt].s_secinfo.sc_nfsnum,
658 msec[mcnt].s_refcnt);
659
660 ASSERT(msec[mcnt].s_refcnt >= 0);
661 mcnt++;
662 }
663 }
664
665 ASSERT(mcnt == tcnt);
666 /*
667 * Done. Update curdata.
668 * Free up the existing secinfo list in curdata and
669 * set the new value.
670 */
671 curdata->ex_seccnt = tcnt;
672 curdata->ex_secinfo = msec;
673 }
674
675 /*
676 * Find for given treenode the exportinfo which has its
677 * exp_visible linked on its exi_visible list.
678 *
679 * Note: We could add new pointer either to treenode or
680 * to exp_visible, which will point there directly.
681 * This would buy some speed for some memory.
682 */
683 exportinfo_t *
684 vis2exi(treenode_t *tnode)
685 {
686 exportinfo_t *exi_ret = NULL;
687
688 for (;;) {
689 tnode = tnode->tree_parent;
690 if (TREE_ROOT(tnode)) {
691 exi_ret = tnode->tree_exi;
692 break;
693 }
694 }
695
696 ASSERT(exi_ret); /* Every visible should have its home exportinfo */
697 return (exi_ret);
698 }
699
700 /*
701 * For NFS V4.
702 * Add or remove the newly exported or unexported security flavors of the
703 * given exportinfo from its ancestors upto the system root.
704 */
705 void
706 srv_secinfo_treeclimb(exportinfo_t *exip, secinfo_t *sec, int seccnt, int isadd)
707 {
708 treenode_t *tnode = exip->exi_tree;
709
710 ASSERT(RW_WRITE_HELD(&exported_lock));
711 ASSERT(tnode);
712
713 if (seccnt == 0)
714 return;
715
716 /*
717 * If flavors are being added and the new export root isn't
718 * also VROOT, its implicitly allowed flavors are inherited from
719 * from its pseudonode.
720 * Note - for VROOT exports the implicitly allowed flavors were
721 * transferred from the PSEUDO export in exportfs()
722 */
723 if (isadd && !(exip->exi_vp->v_flag & VROOT) &&
724 tnode->tree_vis->vis_seccnt > 0) {
725 srv_secinfo_add(&exip->exi_export.ex_secinfo,
726 &exip->exi_export.ex_seccnt, tnode->tree_vis->vis_secinfo,
727 tnode->tree_vis->vis_seccnt, FALSE);
728 }
729
730 /*
731 * Move to parent node and propagate sec flavor
732 * to exportinfo and to visible structures.
733 */
734 tnode = tnode->tree_parent;
735
736 while (tnode) {
737
738 /* If there is exportinfo, update it */
739 if (tnode->tree_exi) {
740 secinfo_t **pxsec =
741 &tnode->tree_exi->exi_export.ex_secinfo;
742 int *pxcnt = &tnode->tree_exi->exi_export.ex_seccnt;
743 int is_pseudo = PSEUDO(tnode->tree_exi);
744 if (isadd)
745 srv_secinfo_add(pxsec, pxcnt, sec, seccnt,
746 is_pseudo);
747 else
748 srv_secinfo_remove(pxsec, pxcnt, sec, seccnt);
749 }
750
751 /* Update every visible - only root node has no visible */
752 if (tnode->tree_vis) {
753 secinfo_t **pxsec = &tnode->tree_vis->vis_secinfo;
754 int *pxcnt = &tnode->tree_vis->vis_seccnt;
755 if (isadd)
756 srv_secinfo_add(pxsec, pxcnt, sec, seccnt,
757 FALSE);
758 else
759 srv_secinfo_remove(pxsec, pxcnt, sec, seccnt);
760 }
761 tnode = tnode->tree_parent;
762 }
763 }
764
765 /* hash_name is a text substitution for either fid_hash or path_hash */
766 #define exp_hash_unlink(exi, hash_name) \
767 if (*(exi)->hash_name.bckt == (exi)) \
768 *(exi)->hash_name.bckt = (exi)->hash_name.next; \
769 if ((exi)->hash_name.prev) \
770 (exi)->hash_name.prev->hash_name.next = (exi)->hash_name.next; \
771 if ((exi)->hash_name.next) \
772 (exi)->hash_name.next->hash_name.prev = (exi)->hash_name.prev; \
773 (exi)->hash_name.bckt = NULL;
774
775 #define exp_hash_link(exi, hash_name, bucket) \
776 (exi)->hash_name.bckt = (bucket); \
777 (exi)->hash_name.prev = NULL; \
778 (exi)->hash_name.next = *(bucket); \
779 if ((exi)->hash_name.next) \
780 (exi)->hash_name.next->hash_name.prev = (exi); \
781 *(bucket) = (exi);
782
783 void
784 export_link(exportinfo_t *exi)
785 {
786 exportinfo_t **bckt;
787
788 bckt = &exptable[exptablehash(&exi->exi_fsid, &exi->exi_fid)];
789 exp_hash_link(exi, fid_hash, bckt);
790
791 bckt = &exptable_path_hash[pkp_tab_hash(exi->exi_export.ex_path,
792 strlen(exi->exi_export.ex_path))];
793 exp_hash_link(exi, path_hash, bckt);
794 }
795
796 /*
797 * Initialization routine for export routines. Should only be called once.
798 */
799 int
800 nfs_exportinit(void)
801 {
802 int error;
803 int i;
804
805 rw_init(&exported_lock, NULL, RW_DEFAULT, NULL);
806
807 /*
808 * Allocate the place holder for the public file handle, which
809 * is all zeroes. It is initially set to the root filesystem.
810 */
811 exi_root = kmem_zalloc(sizeof (*exi_root), KM_SLEEP);
812 exi_public = exi_root;
813
814 exi_root->exi_export.ex_flags = EX_PUBLIC;
815 exi_root->exi_export.ex_pathlen = 1; /* length of "/" */
816 exi_root->exi_export.ex_path =
817 kmem_alloc(exi_root->exi_export.ex_pathlen + 1, KM_SLEEP);
818 exi_root->exi_export.ex_path[0] = '/';
819 exi_root->exi_export.ex_path[1] = '\0';
820
821 exi_root->exi_count = 1;
822 mutex_init(&exi_root->exi_lock, NULL, MUTEX_DEFAULT, NULL);
823
824 exi_root->exi_vp = rootdir;
825 exi_rootfid.fid_len = MAXFIDSZ;
826 error = vop_fid_pseudo(exi_root->exi_vp, &exi_rootfid);
827 if (error) {
828 mutex_destroy(&exi_root->exi_lock);
829 kmem_free(exi_root, sizeof (*exi_root));
830 return (error);
831 }
832
833 /*
834 * Initialize auth cache and auth cache lock
835 */
836 for (i = 0; i < AUTH_TABLESIZE; i++) {
837 exi_root->exi_cache[i] = kmem_alloc(sizeof (avl_tree_t),
838 KM_SLEEP);
839 avl_create(exi_root->exi_cache[i], nfsauth_cache_clnt_compar,
840 sizeof (struct auth_cache_clnt),
841 offsetof(struct auth_cache_clnt, authc_link));
842 }
843 rw_init(&exi_root->exi_cache_lock, NULL, RW_DEFAULT, NULL);
844
845 /* setup the fhandle template */
846 exi_root->exi_fh.fh_fsid = rootdir->v_vfsp->vfs_fsid;
847 exi_root->exi_fh.fh_xlen = exi_rootfid.fid_len;
848 bcopy(exi_rootfid.fid_data, exi_root->exi_fh.fh_xdata,
849 exi_rootfid.fid_len);
850 exi_root->exi_fh.fh_len = sizeof (exi_root->exi_fh.fh_data);
851
852 /*
853 * Publish the exportinfo in the hash table
854 */
855 export_link(exi_root);
856
857 nfslog_init();
858 ns_root = NULL;
859
860 return (0);
861 }
862
863 /*
864 * Finalization routine for export routines. Called to cleanup previously
865 * initialization work when the NFS server module could not be loaded correctly.
866 */
867 void
868 nfs_exportfini(void)
869 {
870 int i;
871
872 /*
873 * Deallocate the place holder for the public file handle.
874 */
875 srv_secinfo_list_free(exi_root->exi_export.ex_secinfo,
876 exi_root->exi_export.ex_seccnt);
877 mutex_destroy(&exi_root->exi_lock);
878 rw_destroy(&exi_root->exi_cache_lock);
879 for (i = 0; i < AUTH_TABLESIZE; i++) {
880 avl_destroy(exi_root->exi_cache[i]);
881 kmem_free(exi_root->exi_cache[i], sizeof (avl_tree_t));
882 }
883 kmem_free(exi_root, sizeof (*exi_root));
884
885 rw_destroy(&exported_lock);
886 }
887
888 /*
889 * Check if 2 gss mechanism identifiers are the same.
890 *
891 * return FALSE if not the same.
892 * return TRUE if the same.
893 */
894 static bool_t
895 nfs_mech_equal(rpc_gss_OID mech1, rpc_gss_OID mech2)
896 {
897 if ((mech1->length == 0) && (mech2->length == 0))
898 return (TRUE);
899
900 if (mech1->length != mech2->length)
901 return (FALSE);
902
903 return (bcmp(mech1->elements, mech2->elements, mech1->length) == 0);
904 }
905
906 /*
907 * This routine is used by rpc to map rpc security number
908 * to nfs specific security flavor number.
909 *
910 * The gss callback prototype is
911 * callback(struct svc_req *, gss_cred_id_t *, gss_ctx_id_t *,
912 * rpc_gss_lock_t *, void **),
913 * since nfs does not use the gss_cred_id_t/gss_ctx_id_t arguments
914 * we cast them to void.
915 */
916 /*ARGSUSED*/
917 bool_t
918 rfs_gsscallback(struct svc_req *req, gss_cred_id_t deleg, void *gss_context,
919 rpc_gss_lock_t *lock, void **cookie)
920 {
921 int i, j;
922 rpc_gss_rawcred_t *raw_cred;
923 struct exportinfo *exi;
924
925 /*
926 * We don't deal with delegated credentials.
927 */
928 if (deleg != GSS_C_NO_CREDENTIAL)
929 return (FALSE);
930
931 raw_cred = lock->raw_cred;
932 *cookie = NULL;
933
934 rw_enter(&exported_lock, RW_READER);
935 for (i = 0; i < EXPTABLESIZE; i++) {
936 exi = exptable[i];
937 while (exi) {
938 if (exi->exi_export.ex_seccnt > 0) {
939 struct secinfo *secp;
940 seconfig_t *se;
941 int seccnt;
942
943 secp = exi->exi_export.ex_secinfo;
944 seccnt = exi->exi_export.ex_seccnt;
945 for (j = 0; j < seccnt; j++) {
946 /*
947 * If there is a map of the triplet
948 * (mechanism, service, qop) between
949 * raw_cred and the exported flavor,
950 * get the psudo flavor number.
951 * Also qop should not be NULL, it
952 * should be "default" or something
953 * else.
954 */
955 se = &secp[j].s_secinfo;
956 if ((se->sc_rpcnum == RPCSEC_GSS) &&
957
958 (nfs_mech_equal(
959 se->sc_gss_mech_type,
960 raw_cred->mechanism)) &&
961
962 (se->sc_service ==
963 raw_cred->service) &&
964 (raw_cred->qop == se->sc_qop)) {
965
966 *cookie = (void *)(uintptr_t)
967 se->sc_nfsnum;
968 goto done;
969 }
970 }
971 }
972 exi = exi->fid_hash.next;
973 }
974 }
975 done:
976 rw_exit(&exported_lock);
977
978 /*
979 * If no nfs pseudo number mapping can be found in the export
980 * table, assign the nfsflavor to NFS_FLAVOR_NOMAP. In V4, we may
981 * recover the flavor mismatch from NFS layer (NFS4ERR_WRONGSEC).
982 *
983 * For example:
984 * server first shares with krb5i;
985 * client mounts with krb5i;
986 * server re-shares with krb5p;
987 * client tries with krb5i, but no mapping can be found;
988 * rpcsec_gss module calls this routine to do the mapping,
989 * if this routine fails, request is rejected from
990 * the rpc layer.
991 * What we need is to let the nfs layer rejects the request.
992 * For V4, we can reject with NFS4ERR_WRONGSEC and the client
993 * may recover from it by getting the new flavor via SECINFO.
994 *
995 * nfs pseudo number for RPCSEC_GSS mapping (see nfssec.conf)
996 * is owned by IANA (see RFC 2623).
997 *
998 * XXX NFS_FLAVOR_NOMAP is defined in Solaris to work around
999 * the implementation issue. This number should not overlap with
1000 * any new IANA defined pseudo flavor numbers.
1001 */
1002 if (*cookie == NULL)
1003 *cookie = (void *)NFS_FLAVOR_NOMAP;
1004
1005 lock->locked = TRUE;
1006
1007 return (TRUE);
1008 }
1009
1010
1011 /*
1012 * Exportfs system call; credentials should be checked before
1013 * calling this function.
1014 */
1015 int
1016 exportfs(struct exportfs_args *args, model_t model, cred_t *cr)
1017 {
1018 vnode_t *vp;
1019 vnode_t *dvp;
1020 struct exportdata *kex;
1021 struct exportinfo *exi = NULL;
1022 struct exportinfo *ex, *ex1, *ex2;
1023 fid_t fid;
1024 fsid_t fsid;
1025 int error;
1026 size_t allocsize;
1027 struct secinfo *sp;
1028 struct secinfo *exs;
1029 rpc_gss_callback_t cb;
1030 char *pathbuf;
1031 char *log_buffer;
1032 char *tagbuf;
1033 int callback;
1034 int allocd_seccnt;
1035 STRUCT_HANDLE(exportfs_args, uap);
1036 STRUCT_DECL(exportdata, uexi);
1037 struct secinfo newsec[MAX_FLAVORS];
1038 int newcnt;
1039 struct secinfo oldsec[MAX_FLAVORS];
1040 int oldcnt;
1041 int i;
1042 struct pathname lookpn;
1043
1044 STRUCT_SET_HANDLE(uap, model, args);
1045
1046 /* Read in pathname from userspace */
1047 if (error = pn_get(STRUCT_FGETP(uap, dname), UIO_USERSPACE, &lookpn))
1048 return (error);
1049
1050 /* Walk the export list looking for that pathname */
1051 rw_enter(&exported_lock, RW_READER);
1052 DTRACE_PROBE(nfss__i__exported_lock1_start);
1053 for (ex1 = exptable_path_hash[pkp_tab_hash(lookpn.pn_path,
1054 strlen(lookpn.pn_path))]; ex1; ex1 = ex1->path_hash.next) {
1055 if (ex1 != exi_root && 0 ==
1056 strcmp(ex1->exi_export.ex_path, lookpn.pn_path)) {
1057 exi_hold(ex1);
1058 break;
1059 }
1060 }
1061 DTRACE_PROBE(nfss__i__exported_lock1_stop);
1062 rw_exit(&exported_lock);
1063
1064 /* Is this an unshare? */
1065 if (STRUCT_FGETP(uap, uex) == NULL) {
1066 pn_free(&lookpn);
1067 if (ex1 == NULL)
1068 return (EINVAL);
1069 error = unexport(ex1);
1070 exi_rele(ex1);
1071 return (error);
1072 }
1073
1074 /* It is a share or a re-share */
1075 error = lookupname(STRUCT_FGETP(uap, dname), UIO_USERSPACE,
1076 FOLLOW, &dvp, &vp);
1077 if (error == EINVAL) {
1078 /*
1079 * if fname resolves to / we get EINVAL error
1080 * since we wanted the parent vnode. Try again
1081 * with NULL dvp.
1082 */
1083 error = lookupname(STRUCT_FGETP(uap, dname), UIO_USERSPACE,
1084 FOLLOW, NULL, &vp);
1085 dvp = NULL;
1086 }
1087 if (!error && vp == NULL) {
1088 /* Last component of fname not found */
1089 if (dvp != NULL)
1090 VN_RELE(dvp);
1091 error = ENOENT;
1092 }
1093 if (error) {
1094 pn_free(&lookpn);
1095 if (ex1)
1096 exi_rele(ex1);
1097 return (error);
1098 }
1099
1100 /*
1101 * 'vp' may be an AUTOFS node, so we perform a
1102 * VOP_ACCESS() to trigger the mount of the
1103 * intended filesystem, so we can share the intended
1104 * filesystem instead of the AUTOFS filesystem.
1105 */
1106 (void) VOP_ACCESS(vp, 0, 0, cr, NULL);
1107
1108 /*
1109 * We're interested in the top most filesystem.
1110 * This is specially important when uap->dname is a trigger
1111 * AUTOFS node, since we're really interested in sharing the
1112 * filesystem AUTOFS mounted as result of the VOP_ACCESS()
1113 * call not the AUTOFS node itself.
1114 */
1115 if (vn_mountedvfs(vp) != NULL) {
1116 if (error = traverse(&vp)) {
1117 VN_RELE(vp);
1118 if (dvp != NULL)
1119 VN_RELE(dvp);
1120 pn_free(&lookpn);
1121 if (ex1)
1122 exi_rele(ex1);
1123 return (error);
1124 }
1125 }
1126
1127 /* Do not allow sharing another vnode for already shared path */
1128 if (ex1 && !PSEUDO(ex1) && !VN_CMP(ex1->exi_vp, vp)) {
1129 VN_RELE(vp);
1130 if (dvp != NULL)
1131 VN_RELE(dvp);
1132 pn_free(&lookpn);
1133 exi_rele(ex1);
1134 return (EEXIST);
1135 }
1136 if (ex1)
1137 exi_rele(ex1);
1138
1139 /*
1140 * Get the vfs id
1141 */
1142 bzero(&fid, sizeof (fid));
1143 fid.fid_len = MAXFIDSZ;
1144 error = VOP_FID(vp, &fid, NULL);
1145 fsid = vp->v_vfsp->vfs_fsid;
1146
1147 if (error) {
1148 VN_RELE(vp);
1149 if (dvp != NULL)
1150 VN_RELE(dvp);
1151 /*
1152 * If VOP_FID returns ENOSPC then the fid supplied
1153 * is too small. For now we simply return EREMOTE.
1154 */
1155 if (error == ENOSPC)
1156 error = EREMOTE;
1157 pn_free(&lookpn);
1158 return (error);
1159 }
1160
1161 /*
1162 * Do not allow re-sharing a shared vnode under a different path
1163 * PSEUDO export has ex_path fabricated, e.g. "/tmp (pseudo)", skip it.
1164 */
1165 rw_enter(&exported_lock, RW_READER);
1166 DTRACE_PROBE(nfss__i__exported_lock2_start);
1167 for (ex2 = exptable[exptablehash(&fsid, &fid)]; ex2;
1168 ex2 = ex2->fid_hash.next) {
1169 if (ex2 != exi_root && !PSEUDO(ex2) &&
1170 VN_CMP(ex2->exi_vp, vp) &&
1171 strcmp(ex2->exi_export.ex_path, lookpn.pn_path) != 0) {
1172 DTRACE_PROBE(nfss__i__exported_lock2_stop);
1173 rw_exit(&exported_lock);
1174 VN_RELE(vp);
1175 if (dvp != NULL)
1176 VN_RELE(dvp);
1177 pn_free(&lookpn);
1178 return (EEXIST);
1179 }
1180 }
1181 DTRACE_PROBE(nfss__i__exported_lock2_stop);
1182 rw_exit(&exported_lock);
1183 pn_free(&lookpn);
1184
1185 exi = kmem_zalloc(sizeof (*exi), KM_SLEEP);
1186 exi->exi_fsid = fsid;
1187 exi->exi_fid = fid;
1188 exi->exi_vp = vp;
1189 exi->exi_count = 1;
1190 exi->exi_volatile_dev = (vfssw[vp->v_vfsp->vfs_fstype].vsw_flag &
1191 VSW_VOLATILEDEV) ? 1 : 0;
1192 mutex_init(&exi->exi_lock, NULL, MUTEX_DEFAULT, NULL);
1193 exi->exi_dvp = dvp;
1194
1195 /*
1196 * Initialize auth cache and auth cache lock
1197 */
1198 for (i = 0; i < AUTH_TABLESIZE; i++) {
1199 exi->exi_cache[i] = kmem_alloc(sizeof (avl_tree_t), KM_SLEEP);
1200 avl_create(exi->exi_cache[i], nfsauth_cache_clnt_compar,
1201 sizeof (struct auth_cache_clnt),
1202 offsetof(struct auth_cache_clnt, authc_link));
1203 }
1204 rw_init(&exi->exi_cache_lock, NULL, RW_DEFAULT, NULL);
1205
1206 /*
1207 * Build up the template fhandle
1208 */
1209 exi->exi_fh.fh_fsid = fsid;
1210 if (exi->exi_fid.fid_len > sizeof (exi->exi_fh.fh_xdata)) {
1211 error = EREMOTE;
1212 goto out1;
1213 }
1214 exi->exi_fh.fh_xlen = exi->exi_fid.fid_len;
1215 bcopy(exi->exi_fid.fid_data, exi->exi_fh.fh_xdata,
1216 exi->exi_fid.fid_len);
1217
1218 exi->exi_fh.fh_len = sizeof (exi->exi_fh.fh_data);
1219
1220 kex = &exi->exi_export;
1221
1222 /*
1223 * Load in everything, and do sanity checking
1224 */
1225 STRUCT_INIT(uexi, model);
1226 if (copyin(STRUCT_FGETP(uap, uex), STRUCT_BUF(uexi),
1227 STRUCT_SIZE(uexi))) {
1228 error = EFAULT;
1229 goto out1;
1230 }
1231
1232 kex->ex_version = STRUCT_FGET(uexi, ex_version);
1233 if (kex->ex_version != EX_CURRENT_VERSION) {
1234 error = EINVAL;
1235 cmn_err(CE_WARN,
1236 "NFS: exportfs requires export struct version 2 - got %d\n",
1237 kex->ex_version);
1238 goto out1;
1239 }
1240
1241 /*
1242 * Must have at least one security entry
1243 */
1244 kex->ex_seccnt = STRUCT_FGET(uexi, ex_seccnt);
1245 if (kex->ex_seccnt < 1) {
1246 error = EINVAL;
1247 goto out1;
1248 }
1249
1250 kex->ex_path = STRUCT_FGETP(uexi, ex_path);
1251 kex->ex_pathlen = STRUCT_FGET(uexi, ex_pathlen);
1252 kex->ex_flags = STRUCT_FGET(uexi, ex_flags);
1253 kex->ex_anon = STRUCT_FGET(uexi, ex_anon);
1254 kex->ex_secinfo = STRUCT_FGETP(uexi, ex_secinfo);
1255 kex->ex_index = STRUCT_FGETP(uexi, ex_index);
1256 kex->ex_log_buffer = STRUCT_FGETP(uexi, ex_log_buffer);
1257 kex->ex_log_bufferlen = STRUCT_FGET(uexi, ex_log_bufferlen);
1258 kex->ex_tag = STRUCT_FGETP(uexi, ex_tag);
1259 kex->ex_taglen = STRUCT_FGET(uexi, ex_taglen);
1260
1261 /*
1262 * Copy the exported pathname into
1263 * an appropriately sized buffer.
1264 */
1265 pathbuf = kmem_alloc(MAXPATHLEN, KM_SLEEP);
1266 if (copyinstr(kex->ex_path, pathbuf, MAXPATHLEN, &kex->ex_pathlen)) {
1267 kmem_free(pathbuf, MAXPATHLEN);
1268 error = EFAULT;
1269 goto out1;
1270 }
1271 kex->ex_path = kmem_alloc(kex->ex_pathlen + 1, KM_SLEEP);
1272 bcopy(pathbuf, kex->ex_path, kex->ex_pathlen);
1273 kex->ex_path[kex->ex_pathlen] = '\0';
1274 kmem_free(pathbuf, MAXPATHLEN);
1275
1276 /*
1277 * Get the path to the logging buffer and the tag
1278 */
1279 if (kex->ex_flags & EX_LOG) {
1280 log_buffer = kmem_alloc(MAXPATHLEN, KM_SLEEP);
1281 if (copyinstr(kex->ex_log_buffer, log_buffer, MAXPATHLEN,
1282 &kex->ex_log_bufferlen)) {
1283 kmem_free(log_buffer, MAXPATHLEN);
1284 error = EFAULT;
1285 goto out2;
1286 }
1287 kex->ex_log_buffer =
1288 kmem_alloc(kex->ex_log_bufferlen + 1, KM_SLEEP);
1289 bcopy(log_buffer, kex->ex_log_buffer, kex->ex_log_bufferlen);
1290 kex->ex_log_buffer[kex->ex_log_bufferlen] = '\0';
1291 kmem_free(log_buffer, MAXPATHLEN);
1292
1293 tagbuf = kmem_alloc(MAXPATHLEN, KM_SLEEP);
1294 if (copyinstr(kex->ex_tag, tagbuf, MAXPATHLEN,
1295 &kex->ex_taglen)) {
1296 kmem_free(tagbuf, MAXPATHLEN);
1297 error = EFAULT;
1298 goto out3;
1299 }
1300 kex->ex_tag = kmem_alloc(kex->ex_taglen + 1, KM_SLEEP);
1301 bcopy(tagbuf, kex->ex_tag, kex->ex_taglen);
1302 kex->ex_tag[kex->ex_taglen] = '\0';
1303 kmem_free(tagbuf, MAXPATHLEN);
1304 }
1305
1306 /*
1307 * Load the security information for each flavor
1308 */
1309 allocsize = kex->ex_seccnt * SIZEOF_STRUCT(secinfo, model);
1310 sp = kmem_zalloc(allocsize, KM_SLEEP);
1311 if (copyin(kex->ex_secinfo, sp, allocsize)) {
1312 kmem_free(sp, allocsize);
1313 error = EFAULT;
1314 goto out4;
1315 }
1316
1317 /*
1318 * All of these nested structures need to be converted to
1319 * the kernel native format.
1320 */
1321 if (model != DATAMODEL_NATIVE) {
1322 size_t allocsize2;
1323 struct secinfo *sp2;
1324
1325 allocsize2 = kex->ex_seccnt * sizeof (struct secinfo);
1326 sp2 = kmem_zalloc(allocsize2, KM_SLEEP);
1327
1328 for (i = 0; i < kex->ex_seccnt; i++) {
1329 STRUCT_HANDLE(secinfo, usi);
1330
1331 STRUCT_SET_HANDLE(usi, model,
1332 (struct secinfo *)((caddr_t)sp +
1333 (i * SIZEOF_STRUCT(secinfo, model))));
1334 bcopy(STRUCT_FGET(usi, s_secinfo.sc_name),
1335 sp2[i].s_secinfo.sc_name, MAX_NAME_LEN);
1336 sp2[i].s_secinfo.sc_nfsnum =
1337 STRUCT_FGET(usi, s_secinfo.sc_nfsnum);
1338 sp2[i].s_secinfo.sc_rpcnum =
1339 STRUCT_FGET(usi, s_secinfo.sc_rpcnum);
1340 bcopy(STRUCT_FGET(usi, s_secinfo.sc_gss_mech),
1341 sp2[i].s_secinfo.sc_gss_mech, MAX_NAME_LEN);
1342 sp2[i].s_secinfo.sc_gss_mech_type =
1343 STRUCT_FGETP(usi, s_secinfo.sc_gss_mech_type);
1344 sp2[i].s_secinfo.sc_qop =
1345 STRUCT_FGET(usi, s_secinfo.sc_qop);
1346 sp2[i].s_secinfo.sc_service =
1347 STRUCT_FGET(usi, s_secinfo.sc_service);
1348
1349 sp2[i].s_flags = STRUCT_FGET(usi, s_flags);
1350 sp2[i].s_window = STRUCT_FGET(usi, s_window);
1351 sp2[i].s_rootid = STRUCT_FGET(usi, s_rootid);
1352 sp2[i].s_rootcnt = STRUCT_FGET(usi, s_rootcnt);
1353 sp2[i].s_rootnames = STRUCT_FGETP(usi, s_rootnames);
1354 }
1355 kmem_free(sp, allocsize);
1356 sp = sp2;
1357 allocsize = allocsize2;
1358 }
1359
1360 kex->ex_secinfo = sp;
1361
1362 /*
1363 * And now copy rootnames for each individual secinfo.
1364 */
1365 callback = 0;
1366 allocd_seccnt = 0;
1367 while (allocd_seccnt < kex->ex_seccnt) {
1368
1369 exs = &sp[allocd_seccnt];
1370 if (exs->s_rootcnt > 0) {
1371 if (!sec_svc_loadrootnames(exs->s_secinfo.sc_rpcnum,
1372 exs->s_rootcnt, &exs->s_rootnames, model)) {
1373 error = EFAULT;
1374 goto out5;
1375 }
1376 }
1377
1378 if (exs->s_secinfo.sc_rpcnum == RPCSEC_GSS) {
1379 rpc_gss_OID mech_tmp;
1380 STRUCT_DECL(rpc_gss_OID_s, umech_tmp);
1381 caddr_t elements_tmp;
1382
1383 /* Copyin mechanism type */
1384 STRUCT_INIT(umech_tmp, model);
1385 mech_tmp = kmem_alloc(sizeof (*mech_tmp), KM_SLEEP);
1386 if (copyin(exs->s_secinfo.sc_gss_mech_type,
1387 STRUCT_BUF(umech_tmp), STRUCT_SIZE(umech_tmp))) {
1388 kmem_free(mech_tmp, sizeof (*mech_tmp));
1389 error = EFAULT;
1390 goto out5;
1391 }
1392 mech_tmp->length = STRUCT_FGET(umech_tmp, length);
1393 mech_tmp->elements = STRUCT_FGETP(umech_tmp, elements);
1394
1395 elements_tmp = kmem_alloc(mech_tmp->length, KM_SLEEP);
1396 if (copyin(mech_tmp->elements, elements_tmp,
1397 mech_tmp->length)) {
1398 kmem_free(elements_tmp, mech_tmp->length);
1399 kmem_free(mech_tmp, sizeof (*mech_tmp));
1400 error = EFAULT;
1401 goto out5;
1402 }
1403 mech_tmp->elements = elements_tmp;
1404 exs->s_secinfo.sc_gss_mech_type = mech_tmp;
1405 allocd_seccnt++;
1406
1407 callback = 1;
1408 } else
1409 allocd_seccnt++;
1410 }
1411
1412 /*
1413 * Init the secinfo reference count and mark these flavors
1414 * explicitly exported flavors.
1415 */
1416 for (i = 0; i < kex->ex_seccnt; i++) {
1417 kex->ex_secinfo[i].s_flags |= M_4SEC_EXPORTED;
1418 kex->ex_secinfo[i].s_refcnt = 1;
1419 }
1420
1421 /*
1422 * Set up rpcsec_gss callback routine entry if any.
1423 */
1424 if (callback) {
1425 cb.callback = rfs_gsscallback;
1426 cb.program = NFS_ACL_PROGRAM;
1427 for (cb.version = NFS_ACL_VERSMIN;
1428 cb.version <= NFS_ACL_VERSMAX; cb.version++) {
1429 (void) sec_svc_control(RPC_SVC_SET_GSS_CALLBACK,
1430 (void *)&cb);
1431 }
1432
1433 cb.program = NFS_PROGRAM;
1434 for (cb.version = NFS_VERSMIN;
1435 cb.version <= NFS_VERSMAX; cb.version++) {
1436 (void) sec_svc_control(RPC_SVC_SET_GSS_CALLBACK,
1437 (void *)&cb);
1438 }
1439 }
1440
1441 /*
1442 * Check the index flag. Do this here to avoid holding the
1443 * lock while dealing with the index option (as we do with
1444 * the public option).
1445 */
1446 if (kex->ex_flags & EX_INDEX) {
1447 if (!kex->ex_index) { /* sanity check */
1448 error = EINVAL;
1449 goto out5;
1450 }
1451 if (error = loadindex(kex))
1452 goto out5;
1453 }
1454
1455 if (kex->ex_flags & EX_LOG) {
1456 if (error = nfslog_setup(exi))
1457 goto out6;
1458 }
1459
1460 /*
1461 * Insert the new entry at the front of the export list
1462 */
1463 rw_enter(&exported_lock, RW_WRITER);
1464 DTRACE_PROBE(nfss__i__exported_lock3_start);
1465
1466 export_link(exi);
1467
1468 /*
1469 * Check the rest of the list for an old entry for the fs.
1470 * If one is found then unlink it, wait until this is the
1471 * only reference and then free it.
1472 */
1473 for (ex = exi->fid_hash.next; ex != NULL; ex = ex->fid_hash.next) {
1474 if (ex != exi_root && VN_CMP(ex->exi_vp, vp)) {
1475 export_unlink(ex);
1476 break;
1477 }
1478 }
1479
1480 /*
1481 * If the public filehandle is pointing at the
1482 * old entry, then point it back at the root.
1483 */
1484 if (ex != NULL && ex == exi_public)
1485 exi_public = exi_root;
1486
1487 /*
1488 * If the public flag is on, make the global exi_public
1489 * point to this entry and turn off the public bit so that
1490 * we can distinguish it from the place holder export.
1491 */
1492 if (kex->ex_flags & EX_PUBLIC) {
1493 exi_public = exi;
1494 kex->ex_flags &= ~EX_PUBLIC;
1495 }
1496
1497 #ifdef VOLATILE_FH_TEST
1498 /*
1499 * Set up the volatile_id value if volatile on share.
1500 * The list of volatile renamed filehandles is always destroyed,
1501 * if the fs was reshared.
1502 */
1503 if (kex->ex_flags & EX_VOLFH)
1504 exi->exi_volatile_id = gethrestime_sec();
1505
1506 mutex_init(&exi->exi_vol_rename_lock, NULL, MUTEX_DEFAULT, NULL);
1507 #endif /* VOLATILE_FH_TEST */
1508
1509 /*
1510 * If this is a new export, then climb up
1511 * the tree and check if any pseudo exports
1512 * need to be created to provide a path for
1513 * NFS v4 clients.
1514 */
1515 if (ex == NULL) {
1516 error = treeclimb_export(exi);
1517 if (error)
1518 goto out7;
1519 } else {
1520 /* If it's a re-export update namespace tree */
1521 exi->exi_tree = ex->exi_tree;
1522 exi->exi_tree->tree_exi = exi;
1523 }
1524
1525 /*
1526 * build a unique flavor list from the flavors specified
1527 * in the share cmd. unique means that each flavor only
1528 * appears once in the secinfo list -- no duplicates allowed.
1529 */
1530 newcnt = build_seclist_nodups(&exi->exi_export, newsec, FALSE);
1531
1532 srv_secinfo_treeclimb(exi, newsec, newcnt, TRUE);
1533
1534 /*
1535 * If re-sharing an old export entry, update the secinfo data
1536 * depending on if the old entry is a pseudo node or not.
1537 */
1538 if (ex != NULL) {
1539 oldcnt = build_seclist_nodups(&ex->exi_export, oldsec, FALSE);
1540 if (PSEUDO(ex)) {
1541 /*
1542 * The dir being shared is a pseudo export root (which
1543 * will be transformed into a real export root). The
1544 * flavor(s) of the new share were propagated to the
1545 * ancestors by srv_secinfo_treeclimb() above. Now
1546 * transfer the implicit flavor refs from the old
1547 * pseudo exprot root to the new (real) export root.
1548 */
1549 srv_secinfo_add(&exi->exi_export.ex_secinfo,
1550 &exi->exi_export.ex_seccnt, oldsec, oldcnt, TRUE);
1551 } else {
1552 /*
1553 * First transfer implicit flavor refs to new export.
1554 * Remove old flavor refs last.
1555 */
1556 srv_secinfo_exp2exp(&exi->exi_export, oldsec, oldcnt);
1557 srv_secinfo_treeclimb(ex, oldsec, oldcnt, FALSE);
1558 }
1559 }
1560
1561 /*
1562 * If it's a re-export and the old entry has a pseudonode list,
1563 * transfer it to the new export.
1564 */
1565 if (ex != NULL && (ex->exi_visible != NULL)) {
1566 exi->exi_visible = ex->exi_visible;
1567 ex->exi_visible = NULL;
1568 }
1569
1570 DTRACE_PROBE(nfss__i__exported_lock3_stop);
1571 rw_exit(&exported_lock);
1572
1573 if (exi_public == exi || kex->ex_flags & EX_LOG) {
1574 /*
1575 * Log share operation to this buffer only.
1576 */
1577 nfslog_share_record(exi, cr);
1578 }
1579
1580 if (ex != NULL)
1581 exi_rele(ex);
1582
1583 return (0);
1584
1585 out7:
1586 /* Unlink the new export in exptable. */
1587 export_unlink(exi);
1588 DTRACE_PROBE(nfss__i__exported_lock3_stop);
1589 rw_exit(&exported_lock);
1590 out6:
1591 if (kex->ex_flags & EX_INDEX)
1592 kmem_free(kex->ex_index, strlen(kex->ex_index) + 1);
1593 out5:
1594 /* free partially completed allocation */
1595 while (--allocd_seccnt >= 0) {
1596 exs = &kex->ex_secinfo[allocd_seccnt];
1597 srv_secinfo_entry_free(exs);
1598 }
1599
1600 if (kex->ex_secinfo) {
1601 kmem_free(kex->ex_secinfo,
1602 kex->ex_seccnt * sizeof (struct secinfo));
1603 }
1604
1605 out4:
1606 if ((kex->ex_flags & EX_LOG) && kex->ex_tag != NULL)
1607 kmem_free(kex->ex_tag, kex->ex_taglen + 1);
1608 out3:
1609 if ((kex->ex_flags & EX_LOG) && kex->ex_log_buffer != NULL)
1610 kmem_free(kex->ex_log_buffer, kex->ex_log_bufferlen + 1);
1611 out2:
1612 kmem_free(kex->ex_path, kex->ex_pathlen + 1);
1613 out1:
1614 VN_RELE(vp);
1615 if (dvp != NULL)
1616 VN_RELE(dvp);
1617 mutex_destroy(&exi->exi_lock);
1618 rw_destroy(&exi->exi_cache_lock);
1619 for (i = 0; i < AUTH_TABLESIZE; i++) {
1620 avl_destroy(exi->exi_cache[i]);
1621 kmem_free(exi->exi_cache[i], sizeof (avl_tree_t));
1622 }
1623
1624 kmem_free(exi, sizeof (*exi));
1625
1626 return (error);
1627 }
1628
1629 /*
1630 * Remove the exportinfo from the export list
1631 */
1632 void
1633 export_unlink(struct exportinfo *exi)
1634 {
1635 ASSERT(RW_WRITE_HELD(&exported_lock));
1636
1637 exp_hash_unlink(exi, fid_hash);
1638 exp_hash_unlink(exi, path_hash);
1639 }
1640
1641 /*
1642 * Unexport an exported filesystem
1643 */
1644 static int
1645 unexport(struct exportinfo *exi)
1646 {
1647 struct secinfo cursec[MAX_FLAVORS];
1648 int curcnt;
1649
1650 rw_enter(&exported_lock, RW_WRITER);
1651
1652 /* Check if exi is still linked in the export table */
1653 if (!EXP_LINKED(exi) || PSEUDO(exi)) {
1654 rw_exit(&exported_lock);
1655 return (EINVAL);
1656 }
1657
1658 export_unlink(exi);
1659
1660 /*
1661 * Remove security flavors before treeclimb_unexport() is called
1662 * because srv_secinfo_treeclimb needs the namespace tree
1663 */
1664 curcnt = build_seclist_nodups(&exi->exi_export, cursec, TRUE);
1665
1666 srv_secinfo_treeclimb(exi, cursec, curcnt, FALSE);
1667
1668 /*
1669 * If there's a visible list, then need to leave
1670 * a pseudo export here to retain the visible list
1671 * for paths to exports below.
1672 */
1673 if (exi->exi_visible) {
1674 struct exportinfo *newexi;
1675
1676 newexi = pseudo_exportfs(exi->exi_vp, &exi->exi_fid,
1677 exi->exi_visible, &exi->exi_export);
1678 exi->exi_visible = NULL;
1679
1680 /* interconnect the existing treenode with the new exportinfo */
1681 newexi->exi_tree = exi->exi_tree;
1682 newexi->exi_tree->tree_exi = newexi;
1683 } else {
1684 treeclimb_unexport(exi);
1685 }
1686
1687 rw_exit(&exported_lock);
1688
1689 /*
1690 * Need to call into the NFSv4 server and release all data
1691 * held on this particular export. This is important since
1692 * the v4 server may be holding file locks or vnodes under
1693 * this export.
1694 */
1695 rfs4_clean_state_exi(exi);
1696
1697 /*
1698 * Notify the lock manager that the filesystem is being
1699 * unexported.
1700 */
1701 lm_unexport(exi);
1702
1703 /*
1704 * If this was a public export, restore
1705 * the public filehandle to the root.
1706 */
1707 if (exi == exi_public) {
1708 exi_public = exi_root;
1709
1710 nfslog_share_record(exi_public, CRED());
1711 }
1712
1713 if (exi->exi_export.ex_flags & EX_LOG) {
1714 nfslog_unshare_record(exi, CRED());
1715 }
1716
1717 exi_rele(exi);
1718 return (0);
1719 }
1720
1721 /*
1722 * Get file handle system call.
1723 * Takes file name and returns a file handle for it.
1724 * Credentials must be verified before calling.
1725 */
1726 int
1727 nfs_getfh(struct nfs_getfh_args *args, model_t model, cred_t *cr)
1728 {
1729 nfs_fh3 fh;
1730 char buf[NFS3_MAXFHSIZE];
1731 char *logptr, logbuf[NFS3_MAXFHSIZE];
1732 int l = NFS3_MAXFHSIZE;
1733 vnode_t *vp;
1734 vnode_t *dvp;
1735 struct exportinfo *exi;
1736 int error;
1737 int vers;
1738 STRUCT_HANDLE(nfs_getfh_args, uap);
1739
1740 #ifdef lint
1741 model = model; /* STRUCT macros don't always use it */
1742 #endif
1743
1744 STRUCT_SET_HANDLE(uap, model, args);
1745
1746 error = lookupname(STRUCT_FGETP(uap, fname), UIO_USERSPACE,
1747 FOLLOW, &dvp, &vp);
1748 if (error == EINVAL) {
1749 /*
1750 * if fname resolves to / we get EINVAL error
1751 * since we wanted the parent vnode. Try again
1752 * with NULL dvp.
1753 */
1754 error = lookupname(STRUCT_FGETP(uap, fname), UIO_USERSPACE,
1755 FOLLOW, NULL, &vp);
1756 dvp = NULL;
1757 }
1758 if (!error && vp == NULL) {
1759 /*
1760 * Last component of fname not found
1761 */
1762 if (dvp != NULL) {
1763 VN_RELE(dvp);
1764 }
1765 error = ENOENT;
1766 }
1767 if (error)
1768 return (error);
1769
1770 /*
1771 * 'vp' may be an AUTOFS node, so we perform a
1772 * VOP_ACCESS() to trigger the mount of the
1773 * intended filesystem, so we can share the intended
1774 * filesystem instead of the AUTOFS filesystem.
1775 */
1776 (void) VOP_ACCESS(vp, 0, 0, cr, NULL);
1777
1778 /*
1779 * We're interested in the top most filesystem.
1780 * This is specially important when uap->dname is a trigger
1781 * AUTOFS node, since we're really interested in sharing the
1782 * filesystem AUTOFS mounted as result of the VOP_ACCESS()
1783 * call not the AUTOFS node itself.
1784 */
1785 if (vn_mountedvfs(vp) != NULL) {
1786 if (error = traverse(&vp)) {
1787 VN_RELE(vp);
1788 if (dvp != NULL)
1789 VN_RELE(dvp);
1790 return (error);
1791 }
1792 }
1793
1794 vers = STRUCT_FGET(uap, vers);
1795 exi = nfs_vptoexi(dvp, vp, cr, NULL, &error, FALSE);
1796 if (!error) {
1797 if (vers == NFS_VERSION) {
1798 error = makefh((fhandle_t *)buf, vp, exi);
1799 l = NFS_FHSIZE;
1800 logptr = buf;
1801 } else if (vers == NFS_V3) {
1802 int i, sz, pad;
1803
1804 error = makefh3(&fh, vp, exi);
1805 l = RNDUP(fh.fh3_length);
1806 if (!error && (l > sizeof (fhandle3_t)))
1807 error = EREMOTE;
1808 logptr = logbuf;
1809 if (!error) {
1810 i = 0;
1811 sz = sizeof (fsid_t);
1812 bcopy(&fh.fh3_fsid, &buf[i], sz);
1813 i += sz;
1814
1815 /*
1816 * For backwards compatibility, the
1817 * fid length may be less than
1818 * NFS_FHMAXDATA, but it was always
1819 * encoded as NFS_FHMAXDATA bytes.
1820 */
1821
1822 sz = sizeof (ushort_t);
1823 bcopy(&fh.fh3_len, &buf[i], sz);
1824 i += sz;
1825 bcopy(fh.fh3_data, &buf[i], fh.fh3_len);
1826 i += fh.fh3_len;
1827 pad = (NFS_FHMAXDATA - fh.fh3_len);
1828 if (pad > 0) {
1829 bzero(&buf[i], pad);
1830 i += pad;
1831 l += pad;
1832 }
1833
1834 sz = sizeof (ushort_t);
1835 bcopy(&fh.fh3_xlen, &buf[i], sz);
1836 i += sz;
1837 bcopy(fh.fh3_xdata, &buf[i], fh.fh3_xlen);
1838 i += fh.fh3_xlen;
1839 pad = (NFS_FHMAXDATA - fh.fh3_xlen);
1840 if (pad > 0) {
1841 bzero(&buf[i], pad);
1842 i += pad;
1843 l += pad;
1844 }
1845 }
1846 /*
1847 * If we need to do NFS logging, the filehandle
1848 * must be downsized to 32 bytes.
1849 */
1850 if (!error && exi->exi_export.ex_flags & EX_LOG) {
1851 i = 0;
1852 sz = sizeof (fsid_t);
1853 bcopy(&fh.fh3_fsid, &logbuf[i], sz);
1854 i += sz;
1855 sz = sizeof (ushort_t);
1856 bcopy(&fh.fh3_len, &logbuf[i], sz);
1857 i += sz;
1858 sz = NFS_FHMAXDATA;
1859 bcopy(fh.fh3_data, &logbuf[i], sz);
1860 i += sz;
1861 sz = sizeof (ushort_t);
1862 bcopy(&fh.fh3_xlen, &logbuf[i], sz);
1863 i += sz;
1864 sz = NFS_FHMAXDATA;
1865 bcopy(fh.fh3_xdata, &logbuf[i], sz);
1866 i += sz;
1867 }
1868 }
1869 if (!error && exi->exi_export.ex_flags & EX_LOG) {
1870 nfslog_getfh(exi, (fhandle_t *)logptr,
1871 STRUCT_FGETP(uap, fname), UIO_USERSPACE, cr);
1872 }
1873 exi_rele(exi);
1874 if (!error) {
1875 if (copyout(&l, STRUCT_FGETP(uap, lenp), sizeof (int)))
1876 error = EFAULT;
1877 if (copyout(buf, STRUCT_FGETP(uap, fhp), l))
1878 error = EFAULT;
1879 }
1880 }
1881 VN_RELE(vp);
1882 if (dvp != NULL) {
1883 VN_RELE(dvp);
1884 }
1885 return (error);
1886 }
1887
1888 /*
1889 * Strategy: if vp is in the export list, then
1890 * return the associated file handle. Otherwise, ".."
1891 * once up the vp and try again, until the root of the
1892 * filesystem is reached.
1893 */
1894 struct exportinfo *
1895 nfs_vptoexi(vnode_t *dvp, vnode_t *vp, cred_t *cr, int *walk,
1896 int *err, bool_t v4srv)
1897 {
1898 fid_t fid;
1899 int error;
1900 struct exportinfo *exi;
1901
1902 ASSERT(vp);
1903 VN_HOLD(vp);
1904 if (dvp != NULL) {
1905 VN_HOLD(dvp);
1906 }
1907 if (walk != NULL)
1908 *walk = 0;
1909
1910 for (;;) {
1911 bzero(&fid, sizeof (fid));
1912 fid.fid_len = MAXFIDSZ;
1913 error = vop_fid_pseudo(vp, &fid);
1914 if (error) {
1915 /*
1916 * If vop_fid_pseudo returns ENOSPC then the fid
1917 * supplied is too small. For now we simply
1918 * return EREMOTE.
1919 */
1920 if (error == ENOSPC)
1921 error = EREMOTE;
1922 break;
1923 }
1924
1925 exi = checkexport(&vp->v_vfsp->vfs_fsid, &fid,
1926 v4srv ? vp : NULL);
1927 if (exi != NULL) {
1928 /*
1929 * Found the export info
1930 */
1931 break;
1932 }
1933
1934 /*
1935 * We have just failed finding a matching export.
1936 * If we're at the root of this filesystem, then
1937 * it's time to stop (with failure).
1938 */
1939 if (vp->v_flag & VROOT) {
1940 error = EINVAL;
1941 break;
1942 }
1943
1944 if (walk != NULL)
1945 (*walk)++;
1946
1947 /*
1948 * Now, do a ".." up vp. If dvp is supplied, use it,
1949 * otherwise, look it up.
1950 */
1951 if (dvp == NULL) {
1952 error = VOP_LOOKUP(vp, "..", &dvp, NULL, 0, NULL, cr,
1953 NULL, NULL, NULL);
1954 if (error)
1955 break;
1956 }
1957 VN_RELE(vp);
1958 vp = dvp;
1959 dvp = NULL;
1960 }
1961 VN_RELE(vp);
1962 if (dvp != NULL) {
1963 VN_RELE(dvp);
1964 }
1965 if (error != 0) {
1966 if (err != NULL)
1967 *err = error;
1968 return (NULL);
1969 }
1970 return (exi);
1971 }
1972
1973 int
1974 chk_clnt_sec(exportinfo_t *exi, struct svc_req *req)
1975 {
1976 int i, nfsflavor;
1977 struct secinfo *sp;
1978
1979 /*
1980 * Get the nfs flavor number from xprt.
1981 */
1982 nfsflavor = (int)(uintptr_t)req->rq_xprt->xp_cookie;
1983
1984 sp = exi->exi_export.ex_secinfo;
1985 for (i = 0; i < exi->exi_export.ex_seccnt; i++) {
1986 if ((nfsflavor == sp[i].s_secinfo.sc_nfsnum) &&
1987 SEC_REF_EXPORTED(sp + i))
1988 return (TRUE);
1989 }
1990 return (FALSE);
1991 }
1992
1993 /*
1994 * Make an fhandle from a vnode
1995 */
1996 int
1997 makefh(fhandle_t *fh, vnode_t *vp, exportinfo_t *exi)
1998 {
1999 int error;
2000
2001 *fh = exi->exi_fh; /* struct copy */
2002
2003 error = VOP_FID(vp, (fid_t *)&fh->fh_len, NULL);
2004 if (error) {
2005 /*
2006 * Should be something other than EREMOTE
2007 */
2008 return (EREMOTE);
2009 }
2010 return (0);
2011 }
2012
2013 /*
2014 * This routine makes an overloaded V2 fhandle which contains
2015 * sec modes.
2016 *
2017 * Note that the first four octets contain the length octet,
2018 * the status octet, and two padded octets to make them XDR
2019 * four-octet aligned.
2020 *
2021 * 1 2 3 4 32
2022 * +---+---+---+---+---+---+---+---+ +---+---+---+---+ +---+
2023 * | l | s | | | sec_1 |...| sec_n |...| |
2024 * +---+---+---+---+---+---+---+---+ +---+---+---+---+ +---+
2025 *
2026 * where
2027 *
2028 * the status octet s indicates whether there are more security
2029 * flavors (1 means yes, 0 means no) that require the client to
2030 * perform another 0x81 LOOKUP to get them,
2031 *
2032 * the length octet l is the length describing the number of
2033 * valid octets that follow. (l = 4 * n, where n is the number
2034 * of security flavors sent in the current overloaded filehandle.)
2035 *
2036 * sec_index should always be in the inclusive range: [1 - ex_seccnt],
2037 * and it tells server where to start within the secinfo array.
2038 * Usually it will always be 1; however, if more flavors are used
2039 * for the public export than can be encoded in the overloaded FH
2040 * (7 for NFS2), subsequent SNEGO MCLs will have a larger index
2041 * so the server will pick up where it left off from the previous
2042 * MCL reply.
2043 *
2044 * With NFS4 support, implicitly allowed flavors are also in
2045 * the secinfo array; however, they should not be returned in
2046 * SNEGO MCL replies.
2047 */
2048 int
2049 makefh_ol(fhandle_t *fh, exportinfo_t *exi, uint_t sec_index)
2050 {
2051 secinfo_t sec[MAX_FLAVORS];
2052 int totalcnt, i, *ipt, cnt, seccnt, secidx, fh_max_cnt;
2053 char *c;
2054
2055 if (fh == NULL || exi == NULL || sec_index < 1)
2056 return (EREMOTE);
2057
2058 /*
2059 * WebNFS clients need to know the unique set of explicitly
2060 * shared flavors in used for the public export. When
2061 * "TRUE" is passed to build_seclist_nodups(), only explicitly
2062 * shared flavors are included in the list.
2063 */
2064 seccnt = build_seclist_nodups(&exi->exi_export, sec, TRUE);
2065 if (sec_index > seccnt)
2066 return (EREMOTE);
2067
2068 fh_max_cnt = (NFS_FHSIZE / sizeof (int)) - 1;
2069 totalcnt = seccnt - sec_index + 1;
2070 cnt = totalcnt > fh_max_cnt ? fh_max_cnt : totalcnt;
2071
2072 c = (char *)fh;
2073 /*
2074 * Encode the length octet representing the number of
2075 * security flavors (in bytes) in this overloaded fh.
2076 */
2077 *c = cnt * sizeof (int);
2078
2079 /*
2080 * Encode the status octet that indicates whether there
2081 * are more security flavors the client needs to get.
2082 */
2083 *(c + 1) = totalcnt > fh_max_cnt;
2084
2085 /*
2086 * put security flavors in the overloaded fh
2087 */
2088 ipt = (int *)(c + sizeof (int32_t));
2089 secidx = sec_index - 1;
2090 for (i = 0; i < cnt; i++) {
2091 ipt[i] = htonl(sec[i + secidx].s_secinfo.sc_nfsnum);
2092 }
2093 return (0);
2094 }
2095
2096 /*
2097 * Make an nfs_fh3 from a vnode
2098 */
2099 int
2100 makefh3(nfs_fh3 *fh, vnode_t *vp, struct exportinfo *exi)
2101 {
2102 int error;
2103 fid_t fid;
2104
2105 bzero(&fid, sizeof (fid));
2106 fid.fid_len = sizeof (fh->fh3_data);
2107 error = VOP_FID(vp, &fid, NULL);
2108 if (error)
2109 return (EREMOTE);
2110
2111 bzero(fh, sizeof (nfs_fh3));
2112 fh->fh3_fsid = exi->exi_fsid;
2113 fh->fh3_len = fid.fid_len;
2114 bcopy(fid.fid_data, fh->fh3_data, fh->fh3_len);
2115
2116 fh->fh3_xlen = exi->exi_fid.fid_len;
2117 ASSERT(fh->fh3_xlen <= sizeof (fh->fh3_xdata));
2118 bcopy(exi->exi_fid.fid_data, fh->fh3_xdata, fh->fh3_xlen);
2119
2120 fh->fh3_length = sizeof (fh->fh3_fsid)
2121 + sizeof (fh->fh3_len) + fh->fh3_len
2122 + sizeof (fh->fh3_xlen) + fh->fh3_xlen;
2123 fh->fh3_flags = 0;
2124
2125 return (0);
2126 }
2127
2128 /*
2129 * This routine makes an overloaded V3 fhandle which contains
2130 * sec modes.
2131 *
2132 * 1 4
2133 * +--+--+--+--+
2134 * | len |
2135 * +--+--+--+--+
2136 * up to 64
2137 * +--+--+--+--+--+--+--+--+--+--+--+--+ +--+--+--+--+
2138 * |s | | | | sec_1 | sec_2 | ... | sec_n |
2139 * +--+--+--+--+--+--+--+--+--+--+--+--+ +--+--+--+--+
2140 *
2141 * len = 4 * (n+1), where n is the number of security flavors
2142 * sent in the current overloaded filehandle.
2143 *
2144 * the status octet s indicates whether there are more security
2145 * mechanisms (1 means yes, 0 means no) that require the client
2146 * to perform another 0x81 LOOKUP to get them.
2147 *
2148 * Three octets are padded after the status octet.
2149 */
2150 int
2151 makefh3_ol(nfs_fh3 *fh, struct exportinfo *exi, uint_t sec_index)
2152 {
2153 secinfo_t sec[MAX_FLAVORS];
2154 int totalcnt, cnt, *ipt, i, seccnt, fh_max_cnt, secidx;
2155 char *c;
2156
2157 if (fh == NULL || exi == NULL || sec_index < 1)
2158 return (EREMOTE);
2159
2160 /*
2161 * WebNFS clients need to know the unique set of explicitly
2162 * shared flavors in used for the public export. When
2163 * "TRUE" is passed to build_seclist_nodups(), only explicitly
2164 * shared flavors are included in the list.
2165 */
2166 seccnt = build_seclist_nodups(&exi->exi_export, sec, TRUE);
2167
2168 if (sec_index > seccnt)
2169 return (EREMOTE);
2170
2171 fh_max_cnt = (NFS3_FHSIZE / sizeof (int)) - 1;
2172 totalcnt = seccnt - sec_index + 1;
2173 cnt = totalcnt > fh_max_cnt ? fh_max_cnt : totalcnt;
2174
2175 /*
2176 * Place the length in fh3_length representing the number
2177 * of security flavors (in bytes) in this overloaded fh.
2178 */
2179 fh->fh3_flags = FH_WEBNFS;
2180 fh->fh3_length = (cnt+1) * sizeof (int32_t);
2181
2182 c = (char *)&fh->fh3_u.nfs_fh3_i.fh3_i;
2183 /*
2184 * Encode the status octet that indicates whether there
2185 * are more security flavors the client needs to get.
2186 */
2187 *c = totalcnt > fh_max_cnt;
2188
2189 /*
2190 * put security flavors in the overloaded fh
2191 */
2192 secidx = sec_index - 1;
2193 ipt = (int *)(c + sizeof (int32_t));
2194 for (i = 0; i < cnt; i++) {
2195 ipt[i] = htonl(sec[i + secidx].s_secinfo.sc_nfsnum);
2196 }
2197 return (0);
2198 }
2199
2200 /*
2201 * Make an nfs_fh4 from a vnode
2202 */
2203 int
2204 makefh4(nfs_fh4 *fh, vnode_t *vp, struct exportinfo *exi)
2205 {
2206 int error;
2207 nfs_fh4_fmt_t *fh_fmtp = (nfs_fh4_fmt_t *)fh->nfs_fh4_val;
2208 fid_t fid;
2209
2210 bzero(&fid, sizeof (fid));
2211 fid.fid_len = MAXFIDSZ;
2212 /*
2213 * vop_fid_pseudo() is used to set up NFSv4 namespace, so
2214 * use vop_fid_pseudo() here to get the fid instead of VOP_FID.
2215 */
2216 error = vop_fid_pseudo(vp, &fid);
2217 if (error)
2218 return (error);
2219
2220 fh->nfs_fh4_len = NFS_FH4_LEN;
2221
2222 fh_fmtp->fh4_i.fhx_fsid = exi->exi_fh.fh_fsid;
2223 fh_fmtp->fh4_i.fhx_xlen = exi->exi_fh.fh_xlen;
2224
2225 bzero(fh_fmtp->fh4_i.fhx_data, sizeof (fh_fmtp->fh4_i.fhx_data));
2226 bzero(fh_fmtp->fh4_i.fhx_xdata, sizeof (fh_fmtp->fh4_i.fhx_xdata));
2227 ASSERT(exi->exi_fh.fh_xlen <= sizeof (fh_fmtp->fh4_i.fhx_xdata));
2228 bcopy(exi->exi_fh.fh_xdata, fh_fmtp->fh4_i.fhx_xdata,
2229 exi->exi_fh.fh_xlen);
2230
2231 fh_fmtp->fh4_len = fid.fid_len;
2232 ASSERT(fid.fid_len <= sizeof (fh_fmtp->fh4_data));
2233 bcopy(fid.fid_data, fh_fmtp->fh4_data, fid.fid_len);
2234 fh_fmtp->fh4_flag = 0;
2235
2236 #ifdef VOLATILE_FH_TEST
2237 /*
2238 * XXX (temporary?)
2239 * Use the rnode volatile_id value to add volatility to the fh.
2240 *
2241 * For testing purposes there are currently two scenarios, based
2242 * on whether the filesystem was shared with "volatile_fh"
2243 * or "expire_on_rename". In the first case, use the value of
2244 * export struct share_time as the volatile_id. In the second
2245 * case use the vnode volatile_id value (which is set to the
2246 * time in which the file was renamed).
2247 *
2248 * Note that the above are temporary constructs for testing only
2249 * XXX
2250 */
2251 if (exi->exi_export.ex_flags & EX_VOLRNM) {
2252 fh_fmtp->fh4_volatile_id = find_volrnm_fh_id(exi, fh);
2253 } else if (exi->exi_export.ex_flags & EX_VOLFH) {
2254 fh_fmtp->fh4_volatile_id = exi->exi_volatile_id;
2255 } else {
2256 fh_fmtp->fh4_volatile_id = 0;
2257 }
2258 #endif /* VOLATILE_FH_TEST */
2259
2260 return (0);
2261 }
2262
2263 /*
2264 * Convert an fhandle into a vnode.
2265 * Uses the file id (fh_len + fh_data) in the fhandle to get the vnode.
2266 * WARNING: users of this routine must do a VN_RELE on the vnode when they
2267 * are done with it.
2268 */
2269 vnode_t *
2270 nfs_fhtovp(fhandle_t *fh, struct exportinfo *exi)
2271 {
2272 vfs_t *vfsp;
2273 vnode_t *vp;
2274 int error;
2275 fid_t *fidp;
2276
2277 TRACE_0(TR_FAC_NFS, TR_FHTOVP_START,
2278 "fhtovp_start");
2279
2280 if (exi == NULL) {
2281 TRACE_1(TR_FAC_NFS, TR_FHTOVP_END,
2282 "fhtovp_end:(%S)", "exi NULL");
2283 return (NULL); /* not exported */
2284 }
2285
2286 ASSERT(exi->exi_vp != NULL);
2287
2288 if (PUBLIC_FH2(fh)) {
2289 if (exi->exi_export.ex_flags & EX_PUBLIC) {
2290 TRACE_1(TR_FAC_NFS, TR_FHTOVP_END,
2291 "fhtovp_end:(%S)", "root not exported");
2292 return (NULL);
2293 }
2294 vp = exi->exi_vp;
2295 VN_HOLD(vp);
2296 return (vp);
2297 }
2298
2299 vfsp = exi->exi_vp->v_vfsp;
2300 ASSERT(vfsp != NULL);
2301 fidp = (fid_t *)&fh->fh_len;
2302
2303 error = VFS_VGET(vfsp, &vp, fidp);
2304 if (error || vp == NULL) {
2305 TRACE_1(TR_FAC_NFS, TR_FHTOVP_END,
2306 "fhtovp_end:(%S)", "VFS_GET failed or vp NULL");
2307 return (NULL);
2308 }
2309 TRACE_1(TR_FAC_NFS, TR_FHTOVP_END,
2310 "fhtovp_end:(%S)", "end");
2311 return (vp);
2312 }
2313
2314 /*
2315 * Convert an nfs_fh3 into a vnode.
2316 * Uses the file id (fh_len + fh_data) in the file handle to get the vnode.
2317 * WARNING: users of this routine must do a VN_RELE on the vnode when they
2318 * are done with it.
2319 */
2320 vnode_t *
2321 nfs3_fhtovp(nfs_fh3 *fh, struct exportinfo *exi)
2322 {
2323 vfs_t *vfsp;
2324 vnode_t *vp;
2325 int error;
2326 fid_t *fidp;
2327
2328 if (exi == NULL)
2329 return (NULL); /* not exported */
2330
2331 ASSERT(exi->exi_vp != NULL);
2332
2333 if (PUBLIC_FH3(fh)) {
2334 if (exi->exi_export.ex_flags & EX_PUBLIC)
2335 return (NULL);
2336 vp = exi->exi_vp;
2337 VN_HOLD(vp);
2338 return (vp);
2339 }
2340
2341 if (fh->fh3_length < NFS3_OLDFHSIZE ||
2342 fh->fh3_length > NFS3_MAXFHSIZE)
2343 return (NULL);
2344
2345 vfsp = exi->exi_vp->v_vfsp;
2346 ASSERT(vfsp != NULL);
2347 fidp = FH3TOFIDP(fh);
2348
2349 error = VFS_VGET(vfsp, &vp, fidp);
2350 if (error || vp == NULL)
2351 return (NULL);
2352
2353 return (vp);
2354 }
2355
2356 /*
2357 * Convert an nfs_fh4 into a vnode.
2358 * Uses the file id (fh_len + fh_data) in the file handle to get the vnode.
2359 * WARNING: users of this routine must do a VN_RELE on the vnode when they
2360 * are done with it.
2361 */
2362 vnode_t *
2363 nfs4_fhtovp(nfs_fh4 *fh, struct exportinfo *exi, nfsstat4 *statp)
2364 {
2365 vfs_t *vfsp;
2366 vnode_t *vp = NULL;
2367 int error;
2368 fid_t *fidp;
2369 nfs_fh4_fmt_t *fh_fmtp;
2370 #ifdef VOLATILE_FH_TEST
2371 uint32_t volatile_id = 0;
2372 #endif /* VOLATILE_FH_TEST */
2373
2374 if (exi == NULL) {
2375 *statp = NFS4ERR_STALE;
2376 return (NULL); /* not exported */
2377 }
2378 ASSERT(exi->exi_vp != NULL);
2379
2380 /* caller should have checked this */
2381 ASSERT(fh->nfs_fh4_len >= NFS_FH4_LEN);
2382
2383 fh_fmtp = (nfs_fh4_fmt_t *)fh->nfs_fh4_val;
2384 vfsp = exi->exi_vp->v_vfsp;
2385 ASSERT(vfsp != NULL);
2386 fidp = (fid_t *)&fh_fmtp->fh4_len;
2387
2388 #ifdef VOLATILE_FH_TEST
2389 /* XXX check if volatile - should be changed later */
2390 if (exi->exi_export.ex_flags & (EX_VOLRNM | EX_VOLFH)) {
2391 /*
2392 * Filesystem is shared with volatile filehandles
2393 */
2394 if (exi->exi_export.ex_flags & EX_VOLRNM)
2395 volatile_id = find_volrnm_fh_id(exi, fh);
2396 else
2397 volatile_id = exi->exi_volatile_id;
2398
2399 if (fh_fmtp->fh4_volatile_id != volatile_id) {
2400 *statp = NFS4ERR_FHEXPIRED;
2401 return (NULL);
2402 }
2403 }
2404 /*
2405 * XXX even if test_volatile_fh false, the fh may contain a
2406 * volatile id if obtained when the test was set.
2407 */
2408 fh_fmtp->fh4_volatile_id = (uchar_t)0;
2409 #endif /* VOLATILE_FH_TEST */
2410
2411 error = VFS_VGET(vfsp, &vp, fidp);
2412 /*
2413 * If we can not get vp from VFS_VGET, perhaps this is
2414 * an nfs v2/v3/v4 node in an nfsv4 pseudo filesystem.
2415 * Check it out.
2416 */
2417 if (error && PSEUDO(exi))
2418 error = nfs4_vget_pseudo(exi, &vp, fidp);
2419
2420 if (error || vp == NULL) {
2421 *statp = NFS4ERR_STALE;
2422 return (NULL);
2423 }
2424 /* XXX - disgusting hack */
2425 if (vp->v_type == VNON && vp->v_flag & V_XATTRDIR)
2426 vp->v_type = VDIR;
2427 *statp = NFS4_OK;
2428 return (vp);
2429 }
2430
2431 struct exportinfo *
2432 checkexport_nohold(fsid_t *fsid, fid_t *fid, vnode_t *vp)
2433 {
2434 struct exportinfo *exi;
2435
2436 for (exi = exptable[exptablehash(fsid, fid)];
2437 exi != NULL;
2438 exi = exi->fid_hash.next) {
2439 if (exportmatch(exi, fsid, fid)) {
2440 /*
2441 * If this is the place holder for the
2442 * public file handle, then return the
2443 * real export entry for the public file
2444 * handle.
2445 */
2446 if (exi->exi_export.ex_flags & EX_PUBLIC) {
2447 exi = exi_public;
2448 }
2449
2450 /*
2451 * If vp is given, check if vp is the
2452 * same vnode as the exported node.
2453 *
2454 * Since VOP_FID of a lofs node returns the
2455 * fid of its real node (ufs), the exported
2456 * node for lofs and (pseudo) ufs may have
2457 * the same fsid and fid.
2458 */
2459 if (vp == NULL || vp == exi->exi_vp) {
2460 return (exi);
2461 }
2462 }
2463 }
2464 return (NULL);
2465 }
2466
2467 /*
2468 * Find the export structure associated with the given filesystem.
2469 * If found, then increment the ref count (exi_count).
2470 */
2471 struct exportinfo *
2472 checkexport(fsid_t *fsid, fid_t *fid, vnode_t *vp)
2473 {
2474 struct exportinfo *exi;
2475
2476 rw_enter(&exported_lock, RW_READER);
2477 exi = checkexport_nohold(fsid, fid, vp);
2478 if (exi)
2479 exi_hold(exi);
2480 rw_exit(&exported_lock);
2481
2482 return (exi);
2483 }
2484
2485 /*
2486 * Free an entire export list node
2487 */
2488 void
2489 exportfree(struct exportinfo *exi)
2490 {
2491 struct exportdata *ex;
2492 struct charset_cache *cache;
2493 int i;
2494
2495 ex = &exi->exi_export;
2496
2497 ASSERT(exi->exi_vp != NULL && !(exi->exi_export.ex_flags & EX_PUBLIC));
2498 VN_RELE(exi->exi_vp);
2499 if (exi->exi_dvp != NULL)
2500 VN_RELE(exi->exi_dvp);
2501
2502 if (ex->ex_flags & EX_INDEX)
2503 kmem_free(ex->ex_index, strlen(ex->ex_index) + 1);
2504
2505 kmem_free(ex->ex_path, ex->ex_pathlen + 1);
2506 nfsauth_cache_free(exi);
2507
2508 /*
2509 * if there is a character set mapping cached, clean it up.
2510 */
2511 for (cache = exi->exi_charset; cache != NULL;
2512 cache = exi->exi_charset) {
2513 if (cache->inbound != (kiconv_t)-1)
2514 (void) kiconv_close(cache->inbound);
2515 if (cache->outbound != (kiconv_t)-1)
2516 (void) kiconv_close(cache->outbound);
2517 exi->exi_charset = cache->next;
2518 kmem_free(cache, sizeof (struct charset_cache));
2519 }
2520
2521 if (exi->exi_logbuffer != NULL)
2522 nfslog_disable(exi);
2523
2524 if (ex->ex_flags & EX_LOG) {
2525 kmem_free(ex->ex_log_buffer, ex->ex_log_bufferlen + 1);
2526 kmem_free(ex->ex_tag, ex->ex_taglen + 1);
2527 }
2528
2529 if (exi->exi_visible)
2530 free_visible(exi->exi_visible);
2531
2532 srv_secinfo_list_free(ex->ex_secinfo, ex->ex_seccnt);
2533
2534 #ifdef VOLATILE_FH_TEST
2535 free_volrnm_list(exi);
2536 mutex_destroy(&exi->exi_vol_rename_lock);
2537 #endif /* VOLATILE_FH_TEST */
2538
2539 mutex_destroy(&exi->exi_lock);
2540 rw_destroy(&exi->exi_cache_lock);
2541 /*
2542 * All nodes in the exi_cache AVL trees were removed and freed in the
2543 * nfsauth_cache_free() call above. We will just destroy and free the
2544 * empty AVL trees here.
2545 */
2546 for (i = 0; i < AUTH_TABLESIZE; i++) {
2547 avl_destroy(exi->exi_cache[i]);
2548 kmem_free(exi->exi_cache[i], sizeof (avl_tree_t));
2549 }
2550
2551 kmem_free(exi, sizeof (*exi));
2552 }
2553
2554 /*
2555 * load the index file from user space into kernel space.
2556 */
2557 static int
2558 loadindex(struct exportdata *kex)
2559 {
2560 int error;
2561 char index[MAXNAMELEN+1];
2562 size_t len;
2563
2564 /*
2565 * copyinstr copies the complete string including the NULL and
2566 * returns the len with the NULL byte included in the calculation
2567 * as long as the max length is not exceeded.
2568 */
2569 if (error = copyinstr(kex->ex_index, index, sizeof (index), &len))
2570 return (error);
2571
2572 kex->ex_index = kmem_alloc(len, KM_SLEEP);
2573 bcopy(index, kex->ex_index, len);
2574
2575 return (0);
2576 }
2577
2578 void
2579 exi_hold(struct exportinfo *exi)
2580 {
2581 mutex_enter(&exi->exi_lock);
2582 exi->exi_count++;
2583 mutex_exit(&exi->exi_lock);
2584 }
2585
2586 /*
2587 * When a thread completes using exi, it should call exi_rele().
2588 * exi_rele() decrements exi_count. It releases exi if exi_count == 0, i.e.
2589 * if this is the last user of exi and exi is not on exportinfo list anymore
2590 */
2591 void
2592 exi_rele(struct exportinfo *exi)
2593 {
2594 mutex_enter(&exi->exi_lock);
2595 exi->exi_count--;
2596 if (exi->exi_count == 0) {
2597 mutex_exit(&exi->exi_lock);
2598 exportfree(exi);
2599 } else
2600 mutex_exit(&exi->exi_lock);
2601 }
2602
2603 #ifdef VOLATILE_FH_TEST
2604 /*
2605 * Test for volatile fh's - add file handle to list and set its volatile id
2606 * to time it was renamed. If EX_VOLFH is also on and the fs is reshared,
2607 * the vol_rename queue is purged.
2608 *
2609 * XXX This code is for unit testing purposes only... To correctly use it, it
2610 * needs to tie a rename list to the export struct and (more
2611 * important), protect access to the exi rename list using a write lock.
2612 */
2613
2614 /*
2615 * get the fh vol record if it's in the volatile on rename list. Don't check
2616 * volatile_id in the file handle - compare only the file handles.
2617 */
2618 static struct ex_vol_rename *
2619 find_volrnm_fh(struct exportinfo *exi, nfs_fh4 *fh4p)
2620 {
2621 struct ex_vol_rename *p = NULL;
2622 fhandle4_t *fhp;
2623
2624 /* XXX shouldn't we assert &exported_lock held? */
2625 ASSERT(MUTEX_HELD(&exi->exi_vol_rename_lock));
2626
2627 if (fh4p->nfs_fh4_len != NFS_FH4_LEN) {
2628 return (NULL);
2629 }
2630 fhp = &((nfs_fh4_fmt_t *)fh4p->nfs_fh4_val)->fh4_i;
2631 for (p = exi->exi_vol_rename; p != NULL; p = p->vrn_next) {
2632 if (bcmp(fhp, &p->vrn_fh_fmt.fh4_i,
2633 sizeof (fhandle4_t)) == 0)
2634 break;
2635 }
2636 return (p);
2637 }
2638
2639 /*
2640 * get the volatile id for the fh (if there is - else return 0). Ignore the
2641 * volatile_id in the file handle - compare only the file handles.
2642 */
2643 static uint32_t
2644 find_volrnm_fh_id(struct exportinfo *exi, nfs_fh4 *fh4p)
2645 {
2646 struct ex_vol_rename *p;
2647 uint32_t volatile_id;
2648
2649 mutex_enter(&exi->exi_vol_rename_lock);
2650 p = find_volrnm_fh(exi, fh4p);
2651 volatile_id = (p ? p->vrn_fh_fmt.fh4_volatile_id :
2652 exi->exi_volatile_id);
2653 mutex_exit(&exi->exi_vol_rename_lock);
2654 return (volatile_id);
2655 }
2656
2657 /*
2658 * Free the volatile on rename list - will be called if a filesystem is
2659 * unshared or reshared without EX_VOLRNM
2660 */
2661 static void
2662 free_volrnm_list(struct exportinfo *exi)
2663 {
2664 struct ex_vol_rename *p, *pnext;
2665
2666 /* no need to hold mutex lock - this one is called from exportfree */
2667 for (p = exi->exi_vol_rename; p != NULL; p = pnext) {
2668 pnext = p->vrn_next;
2669 kmem_free(p, sizeof (*p));
2670 }
2671 exi->exi_vol_rename = NULL;
2672 }
2673
2674 /*
2675 * Add a file handle to the volatile on rename list.
2676 */
2677 void
2678 add_volrnm_fh(struct exportinfo *exi, vnode_t *vp)
2679 {
2680 struct ex_vol_rename *p;
2681 char fhbuf[NFS4_FHSIZE];
2682 nfs_fh4 fh4;
2683 int error;
2684
2685 fh4.nfs_fh4_val = fhbuf;
2686 error = makefh4(&fh4, vp, exi);
2687 if ((error) || (fh4.nfs_fh4_len != sizeof (p->vrn_fh_fmt))) {
2688 return;
2689 }
2690
2691 mutex_enter(&exi->exi_vol_rename_lock);
2692
2693 p = find_volrnm_fh(exi, &fh4);
2694
2695 if (p == NULL) {
2696 p = kmem_alloc(sizeof (*p), KM_SLEEP);
2697 bcopy(fh4.nfs_fh4_val, &p->vrn_fh_fmt, sizeof (p->vrn_fh_fmt));
2698 p->vrn_next = exi->exi_vol_rename;
2699 exi->exi_vol_rename = p;
2700 }
2701
2702 p->vrn_fh_fmt.fh4_volatile_id = gethrestime_sec();
2703 mutex_exit(&exi->exi_vol_rename_lock);
2704 }
2705
2706 #endif /* VOLATILE_FH_TEST */