1 /* $NetBSD: pmap_prot2.c,v 1.14 2000/07/06 03:10:34 christos Exp $ */ 2 3 /*- 4 * SPDX-License-Identifier: BSD-3-Clause 5 * 6 * Copyright (c) 2009, Sun Microsystems, Inc. 7 * All rights reserved. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions are met: 11 * - Redistributions of source code must retain the above copyright notice, 12 * this list of conditions and the following disclaimer. 13 * - Redistributions in binary form must reproduce the above copyright notice, 14 * this list of conditions and the following disclaimer in the documentation 15 * and/or other materials provided with the distribution. 16 * - Neither the name of Sun Microsystems, Inc. nor the names of its 17 * contributors may be used to endorse or promote products derived 18 * from this software without specific prior written permission. 19 * 20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 21 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE 24 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 25 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 26 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 27 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 28 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 29 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 30 * POSSIBILITY OF SUCH DAMAGE. 31 */ 32 33 #if defined(LIBC_SCCS) && !defined(lint) 34 static char *sccsid2 = "@(#)pmap_prot2.c 1.3 87/08/11 Copyr 1984 Sun Micro"; 35 static char *sccsid = "@(#)pmap_prot2.c 2.1 88/07/29 4.0 RPCSRC"; 36 #endif 37 /* 38 * pmap_prot2.c 39 * Protocol for the local binder service, or pmap. 40 * 41 * Copyright (C) 1984, Sun Microsystems, Inc. 42 */ 43 44 #include "namespace.h" 45 #include <assert.h> 46 47 #include <rpc/types.h> 48 #include <rpc/xdr.h> 49 #include <rpc/pmap_prot.h> 50 #include "un-namespace.h" 51 52 53 /* 54 * What is going on with linked lists? (!) 55 * First recall the link list declaration from pmap_prot.h: 56 * 57 * struct pmaplist { 58 * struct pmap pml_map; 59 * struct pmaplist *pml_map; 60 * }; 61 * 62 * Compare that declaration with a corresponding xdr declaration that 63 * is (a) pointer-less, and (b) recursive: 64 * 65 * typedef union switch (bool_t) { 66 * 67 * case TRUE: struct { 68 * struct pmap; 69 * pmaplist_t foo; 70 * }; 71 * 72 * case FALSE: struct {}; 73 * } pmaplist_t; 74 * 75 * Notice that the xdr declaration has no nxt pointer while 76 * the C declaration has no bool_t variable. The bool_t can be 77 * interpreted as ``more data follows me''; if FALSE then nothing 78 * follows this bool_t; if TRUE then the bool_t is followed by 79 * an actual struct pmap, and then (recursively) by the 80 * xdr union, pamplist_t. 81 * 82 * This could be implemented via the xdr_union primitive, though this 83 * would cause a one recursive call per element in the list. Rather than do 84 * that we can ``unwind'' the recursion 85 * into a while loop and do the union arms in-place. 86 * 87 * The head of the list is what the C programmer wishes to past around 88 * the net, yet is the data that the pointer points to which is interesting; 89 * this sounds like a job for xdr_reference! 90 */ 91 bool_t 92 xdr_pmaplist(XDR *xdrs, struct pmaplist **rp) 93 { 94 /* 95 * more_elements is pre-computed in case the direction is 96 * XDR_ENCODE or XDR_FREE. more_elements is overwritten by 97 * xdr_bool when the direction is XDR_DECODE. 98 */ 99 bool_t more_elements; 100 int freeing; 101 struct pmaplist **next = NULL; /* pacify gcc */ 102 103 assert(xdrs != NULL); 104 assert(rp != NULL); 105 106 freeing = (xdrs->x_op == XDR_FREE); 107 108 for (;;) { 109 more_elements = (bool_t)(*rp != NULL); 110 if (! xdr_bool(xdrs, &more_elements)) 111 return (FALSE); 112 if (! more_elements) 113 return (TRUE); /* we are done */ 114 /* 115 * the unfortunate side effect of non-recursion is that in 116 * the case of freeing we must remember the next object 117 * before we free the current object ... 118 */ 119 if (freeing) 120 next = &((*rp)->pml_next); 121 if (! xdr_reference(xdrs, (caddr_t *)rp, 122 (u_int)sizeof(struct pmaplist), (xdrproc_t)xdr_pmap)) 123 return (FALSE); 124 rp = (freeing) ? next : &((*rp)->pml_next); 125 } 126 } 127 128 129 /* 130 * xdr_pmaplist_ptr() is specified to take a PMAPLIST *, but is identical in 131 * functionality to xdr_pmaplist(). 132 */ 133 bool_t 134 xdr_pmaplist_ptr(XDR *xdrs, struct pmaplist *rp) 135 { 136 return xdr_pmaplist(xdrs, (struct pmaplist **)(void *)rp); 137 } 138