Print this page
Send zone's rootvp to untraverse()
| Split |
Close |
| Expand all |
| Collapse all |
--- old/usr/src/uts/common/fs/nfs/nfs4_srv_ns.c
+++ new/usr/src/uts/common/fs/nfs/nfs4_srv_ns.c
1 1 /*
2 2 * CDDL HEADER START
3 3 *
4 4 * The contents of this file are subject to the terms of the
5 5 * Common Development and Distribution License (the "License").
6 6 * You may not use this file except in compliance with the License.
7 7 *
8 8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
9 9 * or http://www.opensolaris.org/os/licensing.
10 10 * See the License for the specific language governing permissions
11 11 * and limitations under the License.
12 12 *
13 13 * When distributing Covered Code, include this CDDL HEADER in each
14 14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 15 * If applicable, add the following below this CDDL HEADER, with the
16 16 * fields enclosed by brackets "[]" replaced with your own identifying
17 17 * information: Portions Copyright [yyyy] [name of copyright owner]
18 18 *
19 19 * CDDL HEADER END
20 20 */
21 21
22 22 /*
23 23 * Copyright (c) 2003, 2010, Oracle and/or its affiliates. All rights reserved.
24 24 */
25 25
26 26 /*
27 27 * Copyright 2018 Nexenta Systems, Inc.
28 28 * Copyright (c) 2015, Joyent, Inc.
29 29 */
30 30
31 31 #include <sys/systm.h>
32 32
33 33 #include <nfs/nfs.h>
34 34 #include <nfs/export.h>
35 35 #include <sys/cmn_err.h>
36 36 #include <sys/avl.h>
37 37
38 38 #define PSEUDOFS_SUFFIX " (pseudo)"
39 39
40 40 /*
41 41 * A version of VOP_FID that deals with a remote VOP_FID for nfs.
42 42 * If vp is an nfs node, nfs4_fid() returns EREMOTE, nfs3_fid() and nfs_fid()
43 43 * returns the filehandle of vp as its fid. When nfs uses fid to set the
44 44 * exportinfo filehandle template, a remote nfs filehandle would be too big for
45 45 * the fid of the exported directory. This routine remaps the value of the
46 46 * attribute va_nodeid of vp to be the fid of vp, so that the fid can fit.
47 47 *
48 48 * We need this fid mainly for setting up NFSv4 server namespace where an
49 49 * nfs filesystem is also part of it. Thus, need to be able to setup a pseudo
50 50 * exportinfo for an nfs node.
51 51 *
52 52 * e.g. mount a filesystem on top of a nfs dir, and then share the new mount
53 53 * (like exporting a local disk from a "diskless" client)
54 54 */
55 55 int
56 56 vop_fid_pseudo(vnode_t *vp, fid_t *fidp)
57 57 {
58 58 struct vattr va;
59 59 int error;
60 60
61 61 error = VOP_FID(vp, fidp, NULL);
62 62
63 63 /*
64 64 * XXX nfs4_fid() does nothing and returns EREMOTE.
65 65 * XXX nfs3_fid()/nfs_fid() returns nfs filehandle as its fid
66 66 * which has a bigger length than local fid.
67 67 * NFS_FH4MAXDATA is the size of
68 68 * fhandle4_t.fh_xdata[NFS_FH4MAXDATA].
69 69 *
70 70 * Note: nfs[2,3,4]_fid() only gets called for diskless clients.
71 71 */
72 72 if (error == EREMOTE ||
73 73 (error == 0 && fidp->fid_len > NFS_FH4MAXDATA)) {
74 74
75 75 va.va_mask = AT_NODEID;
76 76 error = VOP_GETATTR(vp, &va, 0, CRED(), NULL);
77 77 if (error)
78 78 return (error);
79 79
80 80 fidp->fid_len = sizeof (va.va_nodeid);
81 81 bcopy(&va.va_nodeid, fidp->fid_data, fidp->fid_len);
82 82 return (0);
83 83 }
84 84
85 85 return (error);
86 86 }
87 87
88 88 /*
89 89 * Get an nfsv4 vnode of the given fid from the visible list of an
90 90 * nfs filesystem or get the exi_vp if it is the root node.
91 91 */
92 92 int
93 93 nfs4_vget_pseudo(struct exportinfo *exi, vnode_t **vpp, fid_t *fidp)
94 94 {
95 95 fid_t exp_fid;
96 96 struct exp_visible *visp;
97 97 int error;
98 98
99 99 /* check if the given fid is in the visible list */
100 100
101 101 for (visp = exi->exi_visible; visp; visp = visp->vis_next) {
102 102 if (EQFID(fidp, &visp->vis_fid)) {
103 103 VN_HOLD(visp->vis_vp);
104 104 *vpp = visp->vis_vp;
105 105 return (0);
106 106 }
107 107 }
108 108
109 109 /* check if the given fid is the same as the exported node */
110 110
111 111 bzero(&exp_fid, sizeof (exp_fid));
112 112 exp_fid.fid_len = MAXFIDSZ;
113 113 error = vop_fid_pseudo(exi->exi_vp, &exp_fid);
114 114 if (error)
115 115 return (error);
116 116
117 117 if (EQFID(fidp, &exp_fid)) {
118 118 VN_HOLD(exi->exi_vp);
119 119 *vpp = exi->exi_vp;
120 120 return (0);
121 121 }
122 122
123 123 return (ENOENT);
124 124 }
125 125
126 126 /*
127 127 * Create a pseudo export entry
128 128 *
129 129 * This is an export entry that's created as the
130 130 * side-effect of a "real" export. As a part of
131 131 * a real export, the pathname to the export is
132 132 * checked to see if all the directory components
133 133 * are accessible via an NFSv4 client, i.e. are
134 134 * exported. If treeclimb_export() finds an unexported
135 135 * mountpoint along the path, then it calls this
136 136 * function to export it.
137 137 *
138 138 * This pseudo export differs from a real export in that
139 139 * it only allows read-only access. A "visible" list of
140 140 * directories is added to filter lookup and readdir results
141 141 * to only contain dirnames which lead to descendant shares.
142 142 *
143 143 * A visible list has a per-file-system scope. Any exportinfo
144 144 * struct (real or pseudo) can have a visible list as long as
145 145 * a) its export root is VROOT, or is the zone's root for in-zone NFS service
146 146 * b) a descendant of the export root is shared
147 147 */
148 148 struct exportinfo *
149 149 pseudo_exportfs(nfs_export_t *ne, vnode_t *vp, fid_t *fid,
150 150 struct exp_visible *vis_head, struct exportdata *exdata)
151 151 {
152 152 struct exportinfo *exi;
153 153 struct exportdata *kex;
154 154 fsid_t fsid;
155 155 int vpathlen;
156 156 int i;
157 157
158 158 ASSERT(RW_WRITE_HELD(&ne->exported_lock));
159 159
160 160 fsid = vp->v_vfsp->vfs_fsid;
161 161 exi = kmem_zalloc(sizeof (*exi), KM_SLEEP);
162 162 exi->exi_fsid = fsid;
163 163 exi->exi_fid = *fid;
164 164 exi->exi_vp = vp;
165 165 VN_HOLD(exi->exi_vp);
166 166 exi->exi_visible = vis_head;
167 167 exi->exi_count = 1;
168 168 exi->exi_zoneid = ne->ne_globals->nfs_zoneid;
169 169 exi->exi_volatile_dev = (vfssw[vp->v_vfsp->vfs_fstype].vsw_flag &
170 170 VSW_VOLATILEDEV) ? 1 : 0;
171 171 mutex_init(&exi->exi_lock, NULL, MUTEX_DEFAULT, NULL);
172 172
173 173 /*
174 174 * Build up the template fhandle
175 175 */
176 176 exi->exi_fh.fh_fsid = fsid;
177 177 ASSERT(exi->exi_fid.fid_len <= sizeof (exi->exi_fh.fh_xdata));
178 178 exi->exi_fh.fh_xlen = exi->exi_fid.fid_len;
179 179 bcopy(exi->exi_fid.fid_data, exi->exi_fh.fh_xdata,
180 180 exi->exi_fid.fid_len);
181 181 exi->exi_fh.fh_len = sizeof (exi->exi_fh.fh_data);
182 182
183 183 kex = &exi->exi_export;
184 184 kex->ex_flags = EX_PSEUDO;
185 185
186 186 vpathlen = strlen(vp->v_path);
187 187 kex->ex_pathlen = vpathlen + strlen(PSEUDOFS_SUFFIX);
188 188 kex->ex_path = kmem_alloc(kex->ex_pathlen + 1, KM_SLEEP);
189 189
190 190 if (vpathlen)
191 191 (void) strncpy(kex->ex_path, vp->v_path, vpathlen);
192 192 (void) strcpy(kex->ex_path + vpathlen, PSEUDOFS_SUFFIX);
193 193
194 194 /* Transfer the secinfo data from exdata to this new pseudo node */
195 195 if (exdata)
196 196 srv_secinfo_exp2pseu(&exi->exi_export, exdata);
197 197
198 198 /*
199 199 * Initialize auth cache and auth cache lock
200 200 */
201 201 for (i = 0; i < AUTH_TABLESIZE; i++) {
202 202 exi->exi_cache[i] = kmem_alloc(sizeof (avl_tree_t), KM_SLEEP);
203 203 avl_create(exi->exi_cache[i], nfsauth_cache_clnt_compar,
204 204 sizeof (struct auth_cache_clnt),
205 205 offsetof(struct auth_cache_clnt, authc_link));
206 206 }
207 207 rw_init(&exi->exi_cache_lock, NULL, RW_DEFAULT, NULL);
208 208
209 209 /*
210 210 * Insert the new entry at the front of the export list
211 211 */
212 212 export_link(ne, exi);
213 213
214 214 /*
215 215 * Initialize exi_id and exi_kstats
216 216 */
217 217 mutex_enter(&nfs_exi_id_lock);
218 218 exi->exi_id = exi_id_get_next();
219 219 avl_add(&exi_id_tree, exi);
220 220 mutex_exit(&nfs_exi_id_lock);
221 221
222 222 return (exi);
223 223 }
224 224
225 225 /*
226 226 * Free a list of visible directories
227 227 */
228 228 void
229 229 free_visible(struct exp_visible *head)
230 230 {
231 231 struct exp_visible *visp, *next;
232 232
233 233 for (visp = head; visp; visp = next) {
234 234 if (visp->vis_vp != NULL)
235 235 VN_RELE(visp->vis_vp);
236 236
237 237 next = visp->vis_next;
238 238 srv_secinfo_list_free(visp->vis_secinfo, visp->vis_seccnt);
239 239 kmem_free(visp, sizeof (*visp));
240 240 }
241 241 }
242 242
243 243 /*
244 244 * Connects newchild (or subtree with newchild in head)
245 245 * to the parent node. We always add it to the beginning
246 246 * of sibling list.
247 247 */
248 248 static void
249 249 tree_add_child(treenode_t *parent, treenode_t *newchild)
250 250 {
251 251 newchild->tree_parent = parent;
252 252 newchild->tree_sibling = parent->tree_child_first;
253 253 parent->tree_child_first = newchild;
254 254 }
255 255
256 256 /* Look up among direct children a node with the exact tree_vis pointer */
257 257 static treenode_t *
258 258 tree_find_child_by_vis(treenode_t *t, exp_visible_t *vis)
259 259 {
260 260 for (t = t->tree_child_first; t; t = t->tree_sibling)
261 261 if (t->tree_vis == vis)
262 262 return (t);
263 263 return (NULL);
264 264 }
265 265
266 266 /*
267 267 * Add new node to the head of subtree pointed by 'n'. n can be NULL.
268 268 * Interconnects the new treenode with exp_visible and exportinfo
269 269 * if needed.
270 270 */
271 271 static treenode_t *
272 272 tree_prepend_node(treenode_t *n, exp_visible_t *v, exportinfo_t *e)
273 273 {
274 274 treenode_t *tnode = kmem_zalloc(sizeof (*tnode), KM_SLEEP);
275 275
276 276 if (n) {
277 277 tnode->tree_child_first = n;
278 278 n->tree_parent = tnode;
279 279 }
280 280 if (v) {
281 281 tnode->tree_vis = v;
282 282 }
283 283 if (e) {
284 284 tnode->tree_exi = e;
285 285 e->exi_tree = tnode;
286 286 }
287 287 return (tnode);
288 288 }
289 289
290 290 /*
291 291 * Removes node from the tree and frees the treenode struct.
292 292 * Does not free structures pointed by tree_exi and tree_vis,
293 293 * they should be already freed.
294 294 */
295 295 static void
296 296 tree_remove_node(nfs_export_t *ne, treenode_t *node)
297 297 {
298 298 treenode_t *parent = node->tree_parent;
299 299 treenode_t *s; /* s for sibling */
300 300
301 301 if (parent == NULL) {
302 302 kmem_free(node, sizeof (*node));
303 303 ne->ns_root = NULL;
304 304 return;
305 305 }
306 306 /* This node is first child */
307 307 if (parent->tree_child_first == node) {
308 308 parent->tree_child_first = node->tree_sibling;
309 309 /* This node is not first child */
310 310 } else {
311 311 s = parent->tree_child_first;
312 312 while (s->tree_sibling != node)
313 313 s = s->tree_sibling;
314 314 s->tree_sibling = s->tree_sibling->tree_sibling;
315 315 }
316 316 kmem_free(node, sizeof (*node));
317 317 }
318 318
319 319 /*
320 320 * When we export a new directory we need to add a new
321 321 * path segment through the pseudofs to reach the new
322 322 * directory. This new path is reflected in a list of
323 323 * directories added to the "visible" list.
324 324 *
325 325 * Here there are two lists of visible fids: one hanging off the
326 326 * pseudo exportinfo, and the one we want to add. It's possible
327 327 * that the two lists share a common path segment
328 328 * and have some common directories. We need to combine
329 329 * the lists so there's no duplicate entries. Where a common
330 330 * path component is found, the vis_count field is bumped.
331 331 *
332 332 * This example shows that the treenode chain (tree_head) and
333 333 * exp_visible chain (vis_head) can differ in length. The latter
334 334 * can be shorter. The outer loop must loop over the vis_head chain.
335 335 *
336 336 * share /x/a
337 337 * mount -F ufs /dev/dsk/... /x/y
338 338 * mkdir -p /x/y/a/b
339 339 * share /x/y/a/b
340 340 *
341 341 * When more_visible() is called during the second share,
342 342 * the existing namespace is following:
343 343 * exp_visible_t
344 344 * treenode_t exportinfo_t v0 v1
345 345 * ns_root+---+ +------------+ +---+ +---+
346 346 * t0| / |........| E0 pseudo |->| x |->| a |
347 347 * +---+ +------------+ +---+ +---+
348 348 * | / /
349 349 * +---+ / /
350 350 * t1| x |------------------------ /
351 351 * +---+ /
352 352 * | /
353 353 * +---+ /
354 354 * t2| a |-------------------------
355 355 * +---+........+------------+
356 356 * | E1 real |
357 357 * +------------+
358 358 *
359 359 * This is being added:
360 360 *
361 361 * tree_head vis_head
362 362 * +---+ +---+
363 363 * t3| x |->| x |v2
364 364 * +---+ +---+
365 365 * | |
366 366 * +---+ +---+ v4 v5
367 367 * t4| y |->| y |v3 +------------+ +---+ +---+
368 368 * +---+\ +---+ | E2 pseudo |->| a |->| b |
369 369 * | \....... >+------------+ +---+ +---+
370 370 * +---+ / /
371 371 * t5| a |--------------------------- /
372 372 * +---+ /
373 373 * | /
374 374 * +---+-------------------------------
375 375 * t6| b | +------------+
376 376 * +---+..........>| E3 real |
377 377 * +------------+
378 378 *
379 379 * more_visible() will:
380 380 * - kmem_free() t3 and v2
381 381 * - add t4, t5, t6 as a child of t1 (t4 will become sibling of t2)
382 382 * - add v3 to the end of E0->exi_visible
383 383 *
384 384 * Note that v4 and v5 were already processed in pseudo_exportfs() and
385 385 * added to E2. The outer loop of more_visible() will loop only over v2
386 386 * and v3. The inner loop of more_visible() always loops over v0 and v1.
387 387 *
388 388 * Illustration for this scenario:
389 389 *
390 390 * mkdir -p /v/a/b/c
391 391 * share /v/a/b/c
392 392 * mkdir /v/a/b/c1
393 393 * mkdir -p /v/a1
394 394 * mv /v/a/b /v/a1
395 395 * share /v/a1/b/c1
396 396 *
397 397 * EXISTING
398 398 * treenode
399 399 * namespace: +-----------+ visibles
400 400 * |exportinfo |-->v->a->b->c
401 401 * connect_point->+---+--->+-----------+
402 402 * | / |T0
403 403 * +---+
404 404 * | NEW treenode chain:
405 405 * child->+---+
406 406 * | v |T1 +---+<-curr
407 407 * +---+ N1| v |
408 408 * | +---+
409 409 * +---+ |
410 410 * | a |T2 +---+<-tree_head
411 411 * +---+ N2| a1|
412 412 * | +---+
413 413 * +---+ |
414 414 * | b |T3 +---+
415 415 * +---+ N3| b |
416 416 * | +---+
417 417 * +---+ |
418 418 * | c |T4 +---+
419 419 * +---+ N4| c1|
420 420 * +---+
421 421 *
422 422 * The picture above illustrates the position of following pointers after line
423 423 * 'child = tree_find_child_by_vis(connect_point, curr->tree_vis);'
424 424 * was executed for the first time in the outer 'for' loop:
425 425 *
426 426 * connect_point..parent treenode in the EXISTING namespace to which the 'curr'
427 427 * should be connected. If 'connect_point' already has a child
428 428 * with the same value of tree_vis as the curr->tree_vis is,
429 429 * the 'curr' will not be added, but kmem_free()d.
430 430 * child..........the result of tree_find_child_by_vis()
431 431 * curr...........currently processed treenode from the NEW treenode chain
432 432 * tree_head......current head of the NEW treenode chain, in this case it was
433 433 * already moved down to its child - preparation for another loop
434 434 *
435 435 * What will happen to NEW treenodes N1, N2, N3, N4 in more_visible() later:
436 436 *
437 437 * N1: is merged - i.e. N1 is kmem_free()d. T0 has a child T1 with the same
438 438 * tree_vis as N1
439 439 * N2: is added as a new child of T1
440 440 * Note: not just N2, but the whole chain N2->N3->N4 is added
441 441 * N3: not processed separately (it was added together with N2)
442 442 * Even that N3 and T3 have same tree_vis, they are NOT merged, but will
443 443 * become duplicates.
444 444 * N4: not processed separately
445 445 */
446 446 static void
447 447 more_visible(struct exportinfo *exi, treenode_t *tree_head)
448 448 {
449 449 struct exp_visible *vp1, *vp2, *vis_head, *tail, *next;
450 450 int found;
451 451 treenode_t *child, *curr, *connect_point;
452 452 nfs_export_t *ne = nfs_get_export();
453 453
454 454 vis_head = tree_head->tree_vis;
455 455 connect_point = exi->exi_tree;
456 456
457 457 /*
458 458 * If exportinfo doesn't already have a visible
459 459 * list just assign the entire supplied list.
460 460 */
461 461 if (exi->exi_visible == NULL) {
462 462 tree_add_child(connect_point, tree_head);
463 463 exi->exi_visible = vis_head;
464 464
465 465 /* Update the change timestamp */
466 466 tree_update_change(ne, connect_point, &vis_head->vis_change);
467 467
468 468 return;
469 469 }
470 470
471 471 /* The outer loop traverses the supplied list. */
472 472 for (vp1 = vis_head; vp1; vp1 = next) {
473 473 found = 0;
474 474 next = vp1->vis_next;
475 475
476 476 /* The inner loop searches the exportinfo visible list. */
477 477 for (vp2 = exi->exi_visible; vp2; vp2 = vp2->vis_next) {
478 478 tail = vp2;
479 479 if (EQFID(&vp1->vis_fid, &vp2->vis_fid)) {
480 480 found = 1;
481 481 vp2->vis_count++;
482 482 VN_RELE(vp1->vis_vp);
483 483 /* Transfer vis_exported from vp1 to vp2. */
484 484 if (vp1->vis_exported && !vp2->vis_exported)
485 485 vp2->vis_exported = 1;
486 486 kmem_free(vp1, sizeof (*vp1));
487 487 tree_head->tree_vis = vp2;
488 488 break;
489 489 }
490 490 }
491 491
492 492 /* If not found - add to the end of the list */
493 493 if (! found) {
494 494 tail->vis_next = vp1;
495 495 vp1->vis_next = NULL;
496 496 }
497 497
498 498 curr = tree_head;
499 499 tree_head = tree_head->tree_child_first;
500 500
501 501 if (! connect_point) /* No longer merging */
502 502 continue;
503 503 /*
504 504 * The inner loop could set curr->tree_vis to the EXISTING
505 505 * exp_visible vp2, so we can search among the children of
506 506 * connect_point for the curr->tree_vis. No need for EQFID.
507 507 */
508 508 child = tree_find_child_by_vis(connect_point, curr->tree_vis);
509 509
510 510 /*
511 511 * Merging cannot be done if a valid child->tree_exi would
512 512 * be overwritten by a new curr->tree_exi.
513 513 */
514 514 if (child &&
515 515 (child->tree_exi == NULL || curr->tree_exi == NULL)) {
516 516 if (curr->tree_exi) { /* Transfer the exportinfo */
517 517 child->tree_exi = curr->tree_exi;
518 518 child->tree_exi->exi_tree = child;
519 519 }
520 520 kmem_free(curr, sizeof (treenode_t));
521 521 connect_point = child;
522 522 } else { /* Branching */
523 523 tree_add_child(connect_point, curr);
524 524
525 525 /* Update the change timestamp */
526 526 tree_update_change(ne, connect_point,
527 527 &curr->tree_vis->vis_change);
528 528
529 529 connect_point = NULL;
530 530 }
531 531 }
532 532 }
533 533
534 534 /*
535 535 * Remove one visible entry from the pseudo exportfs.
536 536 *
537 537 * When we unexport a directory, we have to remove path
538 538 * components from the visible list in the pseudo exportfs
539 539 * entry. The supplied visible contains one fid of one path
540 540 * component. The visible list of the export
541 541 * is checked against provided visible, matching fid has its
542 542 * reference count decremented. If a reference count drops to
543 543 * zero, then it means no paths now use this directory, so its
544 544 * fid can be removed from the visible list.
545 545 *
546 546 * When the last path is removed, the visible list will be null.
547 547 */
548 548 static void
549 549 less_visible(struct exportinfo *exi, struct exp_visible *vp1)
550 550 {
551 551 struct exp_visible *vp2;
552 552 struct exp_visible *prev, *next;
553 553
554 554 for (vp2 = exi->exi_visible, prev = NULL; vp2; vp2 = next) {
555 555
556 556 next = vp2->vis_next;
557 557
558 558 if (vp1 == vp2) {
559 559 /*
560 560 * Decrement the ref count.
561 561 * Remove the entry if it's zero.
562 562 */
563 563 if (--vp2->vis_count <= 0) {
564 564 if (prev == NULL)
565 565 exi->exi_visible = next;
566 566 else
567 567 prev->vis_next = next;
568 568 VN_RELE(vp2->vis_vp);
569 569 srv_secinfo_list_free(vp2->vis_secinfo,
570 570 vp2->vis_seccnt);
571 571 kmem_free(vp2, sizeof (*vp1));
572 572 }
573 573 break;
574 574 }
575 575 prev = vp2;
576 576 }
577 577 }
578 578
579 579 /*
580 580 * This function checks the path to a new export to
581 581 * check whether all the pathname components are
582 582 * exported. It works by climbing the file tree one
583 583 * component at a time via "..", crossing mountpoints
584 584 * if necessary until an export entry is found, or the
585 585 * system root is reached.
586 586 *
587 587 * If an unexported mountpoint is found, then
588 588 * a new pseudo export is added and the pathname from
589 589 * the mountpoint down to the export is added to the
590 590 * visible list for the new pseudo export. If an existing
591 591 * pseudo export is found, then the pathname is added
592 592 * to its visible list.
593 593 *
594 594 * Note that there's some tests for exportdir.
595 595 * The exportinfo entry that's passed as a parameter
596 596 * is that of the real export and exportdir is set
597 597 * for this case.
598 598 *
599 599 * Here is an example of a possible setup:
600 600 *
601 601 * () - a new fs; fs mount point
602 602 * EXPORT - a real exported node
603 603 * PSEUDO - a pseudo node
604 604 * vis - visible list
605 605 * f# - security flavor#
606 606 * (f#) - security flavor# propagated from its descendents
607 607 * "" - covered vnode
608 608 *
609 609 *
610 610 * /
611 611 * |
612 612 * (a) PSEUDO (f1,f2)
613 613 * | vis: b,b,"c","n"
614 614 * |
615 615 * b
616 616 * ---------|------------------
617 617 * | |
618 618 * (c) EXPORT,f1(f2) (n) PSEUDO (f1,f2)
619 619 * | vis: "e","d" | vis: m,m,,p,q,"o"
620 620 * | |
621 621 * ------------------ -------------------
622 622 * | | | | |
623 623 * (d) (e) f m EXPORT,f1(f2) p
624 624 * EXPORT EXPORT | |
625 625 * f1 f2 | |
626 626 * | | |
627 627 * j (o) EXPORT,f2 q EXPORT f2
628 628 *
629 629 */
630 630 int
631 631 treeclimb_export(struct exportinfo *exip)
632 632 {
633 633 vnode_t *dvp, *vp;
634 634 fid_t fid;
635 635 int error;
636 636 int exportdir;
637 637 struct exportinfo *new_exi = exip;
638 638 struct exp_visible *visp;
639 639 struct exp_visible *vis_head = NULL;
640 640 struct vattr va;
641 641 treenode_t *tree_head = NULL;
642 642 timespec_t now;
643 643 nfs_export_t *ne;
644 644
645 645 ne = exip->exi_ne;
646 646 ASSERT3P(ne, ==, nfs_get_export()); /* curzone reality check */
647 647 ASSERT(RW_WRITE_HELD(&ne->exported_lock));
648 648
649 649 gethrestime(&now);
650 650
651 651 vp = exip->exi_vp;
652 652 VN_HOLD(vp);
653 653 exportdir = 1;
654 654
655 655 for (;;) {
656 656
657 657 bzero(&fid, sizeof (fid));
658 658 fid.fid_len = MAXFIDSZ;
659 659 error = vop_fid_pseudo(vp, &fid);
660 660 if (error)
661 661 break;
662 662
663 663 /* XXX KEBE ASKS DO WE NEED THIS?!? */
664 664 ASSERT3U(exip->exi_zoneid, ==, curzone->zone_id);
665 665 /*
666 666 * The root of the file system, or the zone's root for
667 667 * in-zone NFS service needs special handling
668 668 */
669 669 if (vp->v_flag & VROOT || vp == EXI_TO_ZONEROOTVP(exip)) {
670 670 if (!exportdir) {
671 671 struct exportinfo *exi;
672 672
673 673 /*
674 674 * Check if this VROOT dir is already exported.
675 675 * If so, then attach the pseudonodes. If not,
676 676 * then continue .. traversal until we hit a
677 677 * VROOT export (pseudo or real).
678 678 */
679 679 exi = checkexport4(&vp->v_vfsp->vfs_fsid, &fid,
680 680 vp);
681 681 if (exi != NULL) {
682 682 /*
683 683 * Found an export info
684 684 *
685 685 * Extend the list of visible
686 686 * directories whether it's a pseudo
687 687 * or a real export.
688 688 */
689 689 more_visible(exi, tree_head);
690 690 break; /* and climb no further */
691 691 }
692 692
693 693 /*
694 694 * Found the root directory of a filesystem
695 695 * that isn't exported. Need to export
696 696 * this as a pseudo export so that an NFS v4
697 697 * client can do lookups in it.
698 698 */
699 699 new_exi = pseudo_exportfs(ne, vp, &fid,
700 700 vis_head, NULL);
701 701 vis_head = NULL;
702 702 }
703 703
704 704 if (VN_IS_CURZONEROOT(vp)) {
705 705 /* at system root */
706 706 /*
707 707 * If sharing "/", new_exi is shared exportinfo
708 708 * (exip). Otherwise, new_exi is exportinfo
709 709 * created by pseudo_exportfs() above.
710 710 */
711 711 ne->ns_root = tree_prepend_node(tree_head, NULL,
712 712 new_exi);
713 713
|
↓ open down ↓ |
713 lines elided |
↑ open up ↑ |
714 714 /* Update the change timestamp */
715 715 tree_update_change(ne, ne->ns_root, &now);
716 716
717 717 break;
718 718 }
719 719
720 720 /*
721 721 * Traverse across the mountpoint and continue the
722 722 * climb on the mounted-on filesystem.
723 723 */
724 - vp = untraverse(vp);
724 + vp = untraverse(vp, ne->exi_root->exi_vp);
725 725 exportdir = 0;
726 726 continue;
727 727 }
728 728
729 729 /*
730 730 * Do a getattr to obtain the nodeid (inode num)
731 731 * for this vnode.
732 732 */
733 733 va.va_mask = AT_NODEID;
734 734 error = VOP_GETATTR(vp, &va, 0, CRED(), NULL);
735 735 if (error)
736 736 break;
737 737
738 738 /*
739 739 * Add this directory fid to visible list
740 740 */
741 741 visp = kmem_alloc(sizeof (*visp), KM_SLEEP);
742 742 VN_HOLD(vp);
743 743 visp->vis_vp = vp;
744 744 visp->vis_fid = fid; /* structure copy */
745 745 visp->vis_ino = va.va_nodeid;
746 746 visp->vis_count = 1;
747 747 visp->vis_exported = exportdir;
748 748 visp->vis_secinfo = NULL;
749 749 visp->vis_seccnt = 0;
750 750 visp->vis_change = now; /* structure copy */
751 751 visp->vis_next = vis_head;
752 752 vis_head = visp;
753 753
754 754 /*
755 755 * Will set treenode's pointer to exportinfo to
756 756 * 1. shared exportinfo (exip) - if first visit here
757 757 * 2. freshly allocated pseudo export (if any)
758 758 * 3. null otherwise
759 759 */
760 760 tree_head = tree_prepend_node(tree_head, visp, new_exi);
761 761 new_exi = NULL;
762 762
763 763 /*
764 764 * Now, do a ".." to find parent dir of vp.
765 765 */
766 766 error = VOP_LOOKUP(vp, "..", &dvp, NULL, 0, NULL, CRED(),
767 767 NULL, NULL, NULL);
768 768
769 769 if (error == ENOTDIR && exportdir) {
770 770 dvp = exip->exi_dvp;
771 771 ASSERT(dvp != NULL);
772 772 VN_HOLD(dvp);
773 773 error = 0;
774 774 }
775 775
776 776 if (error)
777 777 break;
778 778
779 779 exportdir = 0;
780 780 VN_RELE(vp);
781 781 vp = dvp;
782 782 }
783 783
784 784 VN_RELE(vp);
785 785
786 786 /*
787 787 * We can have set error due to error in:
788 788 * 1. vop_fid_pseudo()
789 789 * 2. VOP_GETATTR()
790 790 * 3. VOP_LOOKUP()
791 791 * We must free pseudo exportinfos, visibles and treenodes.
792 792 * Visibles are referenced from treenode_t::tree_vis and
793 793 * exportinfo_t::exi_visible. To avoid double freeing, only
794 794 * exi_visible pointer is used, via exi_rele(), for the clean-up.
795 795 */
796 796 if (error) {
797 797 /* Free unconnected visibles, if there are any. */
798 798 if (vis_head)
799 799 free_visible(vis_head);
800 800
801 801 /* Connect unconnected exportinfo, if there is any. */
802 802 if (new_exi && new_exi != exip)
803 803 tree_head = tree_prepend_node(tree_head, NULL, new_exi);
804 804
805 805 while (tree_head) {
806 806 treenode_t *t2 = tree_head;
807 807 exportinfo_t *e = tree_head->tree_exi;
808 808 /* exip will be freed in exportfs() */
809 809 if (e && e != exip) {
810 810 mutex_enter(&nfs_exi_id_lock);
811 811 avl_remove(&exi_id_tree, e);
812 812 mutex_exit(&nfs_exi_id_lock);
813 813 export_unlink(ne, e);
814 814 exi_rele(e);
815 815 }
816 816 tree_head = tree_head->tree_child_first;
817 817 kmem_free(t2, sizeof (*t2));
818 818 }
819 819 }
820 820
821 821 return (error);
822 822 }
823 823
824 824 /*
825 825 * Walk up the tree and:
826 826 * 1. release pseudo exportinfo if it has no child
827 827 * 2. release visible in parent's exportinfo
828 828 * 3. delete non-exported leaf nodes from tree
829 829 *
830 830 * Deleting of nodes will start only if the unshared
831 831 * node was a leaf node.
832 832 * Deleting of nodes will finish when we reach a node which
833 833 * has children or is a real export, then we might still need
834 834 * to continue releasing visibles, until we reach VROOT or zone's root node.
835 835 */
836 836 void
837 837 treeclimb_unexport(nfs_export_t *ne, struct exportinfo *exip)
838 838 {
839 839 treenode_t *tnode, *old_nd;
840 840 treenode_t *connect_point = NULL;
841 841
842 842 ASSERT(RW_WRITE_HELD(&ne->exported_lock));
843 843 ASSERT(curzone->zone_id == exip->exi_zoneid ||
844 844 curzone->zone_id == global_zone->zone_id);
845 845
846 846 /*
847 847 * exi_tree can be null for the zone root
848 848 * which means we're already at the "top"
849 849 * and there's nothing more to "climb".
850 850 */
851 851 tnode = exip->exi_tree;
852 852 if (tnode == NULL) {
853 853 /* Should only happen for... */
854 854 ASSERT(exip == ne->exi_root);
855 855 return;
856 856 }
857 857
858 858 /*
859 859 * The unshared exportinfo was unlinked in unexport().
860 860 * Zeroing tree_exi ensures that we will skip it.
861 861 */
862 862 tnode->tree_exi = NULL;
863 863
864 864 if (tnode->tree_vis != NULL) /* system root has tree_vis == NULL */
865 865 tnode->tree_vis->vis_exported = 0;
866 866
867 867 while (tnode != NULL) {
868 868
869 869 /*
870 870 * Stop at VROOT (or zone root) node which is exported or has
871 871 * child.
872 872 */
873 873 if (TREE_ROOT(tnode) &&
874 874 (TREE_EXPORTED(tnode) || tnode->tree_child_first != NULL))
875 875 break;
876 876
877 877 /* Release pseudo export if it has no child */
878 878 if (TREE_ROOT(tnode) && !TREE_EXPORTED(tnode) &&
879 879 tnode->tree_child_first == NULL) {
880 880 mutex_enter(&nfs_exi_id_lock);
881 881 avl_remove(&exi_id_tree, tnode->tree_exi);
882 882 mutex_exit(&nfs_exi_id_lock);
883 883 export_unlink(ne, tnode->tree_exi);
884 884 exi_rele(tnode->tree_exi);
885 885 tnode->tree_exi = NULL;
886 886 }
887 887
888 888 /* Release visible in parent's exportinfo */
889 889 if (tnode->tree_vis != NULL)
890 890 less_visible(vis2exi(tnode), tnode->tree_vis);
891 891
892 892 /* Continue with parent */
893 893 old_nd = tnode;
894 894 tnode = tnode->tree_parent;
895 895
896 896 /* Remove itself, if this is a leaf and non-exported node */
897 897 if (old_nd->tree_child_first == NULL &&
898 898 !TREE_EXPORTED(old_nd)) {
899 899 tree_remove_node(ne, old_nd);
900 900 connect_point = tnode;
901 901 }
902 902 }
|
↓ open down ↓ |
168 lines elided |
↑ open up ↑ |
903 903
904 904 /* Update the change timestamp */
905 905 if (connect_point != NULL)
906 906 tree_update_change(ne, connect_point, NULL);
907 907 }
908 908
909 909 /*
910 910 * Traverse backward across mountpoint from the
911 911 * root vnode of a filesystem to its mounted-on
912 912 * vnode.
913 - *
914 - * Callers to this function have confirmed the use of curzone is safe here.
915 913 */
916 914 vnode_t *
917 -untraverse(vnode_t *vp)
915 +untraverse(vnode_t *vp, vnode_t *zone_rootvp)
918 916 {
919 917 vnode_t *tvp, *nextvp;
920 918
921 919 tvp = vp;
922 920 for (;;) {
923 - if (!(tvp->v_flag & VROOT) && !VN_IS_CURZONEROOT(tvp))
921 + if (!(tvp->v_flag & VROOT) && !VN_CMP(tvp, zone_rootvp))
924 922 break;
925 923
926 924 /* lock vfs to prevent unmount of this vfs */
927 925 vfs_lock_wait(tvp->v_vfsp);
928 926
929 927 if ((nextvp = tvp->v_vfsp->vfs_vnodecovered) == NULL) {
930 928 vfs_unlock(tvp->v_vfsp);
931 929 break;
932 930 }
933 931
934 932 /*
935 933 * Hold nextvp to prevent unmount. After unlock vfs and
936 934 * rele tvp, any number of overlays could be unmounted.
937 935 * Putting a hold on vfs_vnodecovered will only allow
938 936 * tvp's vfs to be unmounted. Of course if caller placed
939 937 * extra hold on vp before calling untraverse, the following
940 938 * hold would not be needed. Since prev actions of caller
941 939 * are unknown, we need to hold here just to be safe.
942 940 */
943 941 VN_HOLD(nextvp);
944 942 vfs_unlock(tvp->v_vfsp);
945 943 VN_RELE(tvp);
946 944 tvp = nextvp;
947 945 }
948 946
949 947 return (tvp);
950 948 }
951 949
952 950 /*
953 951 * Given an exportinfo, climb up to find the exportinfo for the VROOT
954 952 * (or zone root) of the filesystem.
955 953 *
956 954 * e.g. /
957 955 * |
958 956 * a (VROOT) pseudo-exportinfo
959 957 * |
960 958 * b
961 959 * |
962 960 * c #share /a/b/c
963 961 * |
964 962 * d
965 963 *
966 964 * where c is in the same filesystem as a.
967 965 * So, get_root_export(*exportinfo_for_c) returns exportinfo_for_a
968 966 *
969 967 * If d is shared, then c will be put into a's visible list.
970 968 * Note: visible list is per filesystem and is attached to the
971 969 * VROOT exportinfo. Returned exi does NOT have a new hold.
972 970 */
973 971 struct exportinfo *
974 972 get_root_export(struct exportinfo *exip)
975 973 {
976 974 treenode_t *tnode = exip->exi_tree;
977 975 exportinfo_t *exi = NULL;
978 976
979 977 while (tnode) {
980 978 if (TREE_ROOT(tnode)) {
981 979 exi = tnode->tree_exi;
982 980 break;
983 981 }
984 982 tnode = tnode->tree_parent;
985 983 }
986 984 ASSERT(exi);
987 985 return (exi);
988 986 }
989 987
990 988 /*
991 989 * Return true if the supplied vnode has a sub-directory exported.
992 990 */
993 991 int
994 992 has_visible(struct exportinfo *exi, vnode_t *vp)
995 993 {
996 994 struct exp_visible *visp;
997 995 fid_t fid;
998 996 bool_t vp_is_exported;
999 997
1000 998 vp_is_exported = VN_CMP(vp, exi->exi_vp);
1001 999
1002 1000 /*
1003 1001 * An exported root vnode has a sub-dir shared if it has a visible
1004 1002 * list. i.e. if it does not have a visible list, then there is no
1005 1003 * node in this filesystem leads to any other shared node.
1006 1004 */
1007 1005 ASSERT3P(curzone->zone_id, ==, exi->exi_zoneid);
1008 1006 if (vp_is_exported &&
1009 1007 ((vp->v_flag & VROOT) || VN_IS_CURZONEROOT(vp))) {
1010 1008 return (exi->exi_visible ? 1 : 0);
1011 1009 }
1012 1010
1013 1011 /*
1014 1012 * Only the exportinfo of a fs root node may have a visible list.
1015 1013 * Either it is a pseudo root node, or a real exported root node.
1016 1014 */
1017 1015 exi = get_root_export(exi);
1018 1016
1019 1017 if (!exi->exi_visible)
1020 1018 return (0);
1021 1019
1022 1020 /* Get the fid of the vnode */
1023 1021 bzero(&fid, sizeof (fid));
1024 1022 fid.fid_len = MAXFIDSZ;
1025 1023 if (vop_fid_pseudo(vp, &fid) != 0) {
1026 1024 return (0);
1027 1025 }
1028 1026
1029 1027 /*
1030 1028 * See if vp is in the visible list of the root node exportinfo.
1031 1029 */
1032 1030 for (visp = exi->exi_visible; visp; visp = visp->vis_next) {
1033 1031 if (EQFID(&fid, &visp->vis_fid)) {
1034 1032 /*
1035 1033 * If vp is an exported non-root node with only 1 path
1036 1034 * count (for itself), it indicates no sub-dir shared
1037 1035 * using this vp as a path.
1038 1036 */
1039 1037 if (vp_is_exported && visp->vis_count < 2)
1040 1038 break;
1041 1039
1042 1040 return (1);
1043 1041 }
1044 1042 }
1045 1043
1046 1044 return (0);
1047 1045 }
1048 1046
1049 1047 /*
1050 1048 * Returns true if the supplied vnode is visible
1051 1049 * in this export. If vnode is visible, return
1052 1050 * vis_exported in expseudo.
1053 1051 */
1054 1052 int
1055 1053 nfs_visible(struct exportinfo *exi, vnode_t *vp, int *expseudo)
1056 1054 {
1057 1055 struct exp_visible *visp;
1058 1056 fid_t fid;
1059 1057
1060 1058 /*
1061 1059 * First check to see if vp is export root.
1062 1060 *
1063 1061 * A pseudo export root can never be exported
1064 1062 * (it would be a real export then); however,
1065 1063 * it is always visible. If a pseudo root object
1066 1064 * was exported by server admin, then the entire
1067 1065 * pseudo exportinfo (and all visible entries) would
1068 1066 * be destroyed. A pseudo exportinfo only exists
1069 1067 * to provide access to real (descendant) export(s).
1070 1068 *
1071 1069 * Previously, rootdir was special cased here; however,
1072 1070 * the export root special case handles the rootdir
1073 1071 * case also.
1074 1072 */
1075 1073 if (VN_CMP(vp, exi->exi_vp)) {
1076 1074 *expseudo = 0;
1077 1075 return (1);
1078 1076 }
1079 1077
1080 1078 /*
1081 1079 * Only a PSEUDO node has a visible list or an exported VROOT
1082 1080 * node may have a visible list.
1083 1081 */
1084 1082 if (!PSEUDO(exi))
1085 1083 exi = get_root_export(exi);
1086 1084
1087 1085 /* Get the fid of the vnode */
1088 1086
1089 1087 bzero(&fid, sizeof (fid));
1090 1088 fid.fid_len = MAXFIDSZ;
1091 1089 if (vop_fid_pseudo(vp, &fid) != 0) {
1092 1090 *expseudo = 0;
1093 1091 return (0);
1094 1092 }
1095 1093
1096 1094 /*
1097 1095 * We can't trust VN_CMP() above because of LOFS.
1098 1096 * Even though VOP_CMP will do the right thing for LOFS
1099 1097 * objects, VN_CMP will short circuit out early when the
1100 1098 * vnode ops ptrs are different. Just in case we're dealing
1101 1099 * with LOFS, compare exi_fid/fsid here.
1102 1100 *
1103 1101 * expseudo is not set because this is not an export
1104 1102 */
1105 1103 if (EQFID(&exi->exi_fid, &fid) &&
1106 1104 EQFSID(&exi->exi_fsid, &vp->v_vfsp->vfs_fsid)) {
1107 1105 *expseudo = 0;
1108 1106 return (1);
1109 1107 }
1110 1108
1111 1109
1112 1110 /* See if it matches any fid in the visible list */
1113 1111
1114 1112 for (visp = exi->exi_visible; visp; visp = visp->vis_next) {
1115 1113 if (EQFID(&fid, &visp->vis_fid)) {
1116 1114 *expseudo = visp->vis_exported;
1117 1115 return (1);
1118 1116 }
1119 1117 }
1120 1118
1121 1119 *expseudo = 0;
1122 1120
1123 1121 return (0);
1124 1122 }
1125 1123
1126 1124 /*
1127 1125 * Returns true if the supplied vnode is the
1128 1126 * directory of an export point.
1129 1127 */
1130 1128 int
1131 1129 nfs_exported(struct exportinfo *exi, vnode_t *vp)
1132 1130 {
1133 1131 struct exp_visible *visp;
1134 1132 fid_t fid;
1135 1133
1136 1134 /*
1137 1135 * First check to see if vp is the export root
1138 1136 * This check required for the case of lookup ..
1139 1137 * where .. is a V_ROOT vnode and a pseudo exportroot.
1140 1138 * Pseudo export root objects do not have an entry
1141 1139 * in the visible list even though every V_ROOT
1142 1140 * pseudonode is visible. It is safe to compare
1143 1141 * vp here because pseudo_exportfs put a hold on
1144 1142 * it when exi_vp was initialized.
1145 1143 *
1146 1144 * Note: VN_CMP() won't match for LOFS shares, but they're
1147 1145 * handled below w/EQFID/EQFSID.
1148 1146 */
1149 1147 if (VN_CMP(vp, exi->exi_vp))
1150 1148 return (1);
1151 1149
1152 1150 /* Get the fid of the vnode */
1153 1151
1154 1152 bzero(&fid, sizeof (fid));
1155 1153 fid.fid_len = MAXFIDSZ;
1156 1154 if (vop_fid_pseudo(vp, &fid) != 0)
1157 1155 return (0);
1158 1156
1159 1157 if (EQFID(&fid, &exi->exi_fid) &&
1160 1158 EQFSID(&vp->v_vfsp->vfs_fsid, &exi->exi_fsid)) {
1161 1159 return (1);
1162 1160 }
1163 1161
1164 1162 /* See if it matches any fid in the visible list */
1165 1163
1166 1164 for (visp = exi->exi_visible; visp; visp = visp->vis_next) {
1167 1165 if (EQFID(&fid, &visp->vis_fid))
1168 1166 return (visp->vis_exported);
1169 1167 }
1170 1168
1171 1169 return (0);
1172 1170 }
1173 1171
1174 1172 /*
1175 1173 * Returns true if the supplied inode is visible
1176 1174 * in this export. This function is used by
1177 1175 * readdir which uses inode numbers from the
1178 1176 * directory.
1179 1177 *
1180 1178 * NOTE: this code does not match inode number for ".",
1181 1179 * but it isn't required because NFS4 server rddir
1182 1180 * skips . and .. entries.
1183 1181 */
1184 1182 int
1185 1183 nfs_visible_inode(struct exportinfo *exi, ino64_t ino,
1186 1184 struct exp_visible **visp)
1187 1185 {
1188 1186 /*
1189 1187 * Only a PSEUDO node has a visible list or an exported VROOT
1190 1188 * node may have a visible list.
1191 1189 */
1192 1190 if (!PSEUDO(exi))
1193 1191 exi = get_root_export(exi);
1194 1192
1195 1193 for (*visp = exi->exi_visible; *visp != NULL; *visp = (*visp)->vis_next)
1196 1194 if ((u_longlong_t)ino == (*visp)->vis_ino) {
1197 1195 return (1);
1198 1196 }
1199 1197
1200 1198 return (0);
1201 1199 }
1202 1200
1203 1201 /*
1204 1202 * Get the change attribute from visible and returns TRUE.
1205 1203 * If the change value is not available returns FALSE.
1206 1204 */
1207 1205 bool_t
1208 1206 nfs_visible_change(struct exportinfo *exi, vnode_t *vp, timespec_t *change)
1209 1207 {
1210 1208 struct exp_visible *visp;
1211 1209 fid_t fid;
1212 1210 treenode_t *node;
1213 1211 nfs_export_t *ne = nfs_get_export();
1214 1212
1215 1213 /*
1216 1214 * First check to see if vp is export root.
1217 1215 */
1218 1216 if (VN_CMP(vp, exi->exi_vp))
1219 1217 goto exproot;
1220 1218
1221 1219 /*
1222 1220 * Only a PSEUDO node has a visible list or an exported VROOT
1223 1221 * node may have a visible list.
1224 1222 */
1225 1223 if (!PSEUDO(exi))
1226 1224 exi = get_root_export(exi);
1227 1225
1228 1226 /* Get the fid of the vnode */
1229 1227 bzero(&fid, sizeof (fid));
1230 1228 fid.fid_len = MAXFIDSZ;
1231 1229 if (vop_fid_pseudo(vp, &fid) != 0)
1232 1230 return (FALSE);
1233 1231
1234 1232 /*
1235 1233 * We can't trust VN_CMP() above because of LOFS.
1236 1234 * Even though VOP_CMP will do the right thing for LOFS
1237 1235 * objects, VN_CMP will short circuit out early when the
1238 1236 * vnode ops ptrs are different. Just in case we're dealing
1239 1237 * with LOFS, compare exi_fid/fsid here.
1240 1238 */
1241 1239 if (EQFID(&exi->exi_fid, &fid) &&
1242 1240 EQFSID(&exi->exi_fsid, &vp->v_vfsp->vfs_fsid))
1243 1241 goto exproot;
1244 1242
1245 1243 /* See if it matches any fid in the visible list */
1246 1244 for (visp = exi->exi_visible; visp; visp = visp->vis_next) {
1247 1245 if (EQFID(&fid, &visp->vis_fid)) {
1248 1246 *change = visp->vis_change;
1249 1247 return (TRUE);
1250 1248 }
1251 1249 }
1252 1250
1253 1251 return (FALSE);
1254 1252
1255 1253 exproot:
1256 1254 /* The VROOT export have its visible available through treenode */
1257 1255 node = exi->exi_tree;
1258 1256 if (node != ne->ns_root) {
1259 1257 ASSERT(node->tree_vis != NULL);
1260 1258 *change = node->tree_vis->vis_change;
1261 1259 } else {
1262 1260 ASSERT(node->tree_vis == NULL);
1263 1261 *change = ne->ns_root_change;
1264 1262 }
1265 1263 return (TRUE);
1266 1264 }
1267 1265
1268 1266 /*
1269 1267 * Update the change attribute value for a particular treenode. The change
1270 1268 * attribute value is stored in the visible attached to the treenode, or in the
1271 1269 * ns_root_change.
1272 1270 *
1273 1271 * If the change value is not supplied, the current time is used.
1274 1272 */
1275 1273 void
1276 1274 tree_update_change(nfs_export_t *ne, treenode_t *tnode, timespec_t *change)
1277 1275 {
1278 1276 timespec_t *vis_change;
1279 1277
1280 1278 ASSERT(tnode != NULL);
1281 1279 ASSERT((tnode != ne->ns_root && tnode->tree_vis != NULL) ||
1282 1280 (tnode == ne->ns_root && tnode->tree_vis == NULL));
1283 1281
1284 1282 vis_change = tnode == ne->ns_root ? &ne->ns_root_change
1285 1283 : &tnode->tree_vis->vis_change;
1286 1284
1287 1285 if (change != NULL)
1288 1286 *vis_change = *change;
1289 1287 else
1290 1288 gethrestime(vis_change);
1291 1289 }
|
↓ open down ↓ |
358 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX