2 * Copyright (c) 2009, Sun Microsystems, Inc.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are met:
7 * - Redistributions of source code must retain the above copyright notice,
8 * this list of conditions and the following disclaimer.
9 * - Redistributions in binary form must reproduce the above copyright notice,
10 * this list of conditions and the following disclaimer in the documentation
11 * and/or other materials provided with the distribution.
12 * - Neither the name of Sun Microsystems, Inc. nor the names of its
13 * contributors may be used to endorse or promote products derived
14 * from this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
17 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
20 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
24 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
26 * POSSIBILITY OF SUCH DAMAGE.
28 * @(#)rpcb_prot.c 1.13 94/04/24 SMI; 1.9 89/04/21 Copyr 1984 Sun Micro
29 * $NetBSD: rpcb_prot.c,v 1.3 2000/07/14 08:40:42 fvdl Exp $
30 * $FreeBSD: src/lib/libc/rpc/rpcb_prot.c,v 1.7 2007/11/20 01:51:20 jb Exp $
33 * Copyright (c) 1986-1991 by Sun Microsystems Inc.
38 * XDR routines for the rpcbinder version 3.
40 * Copyright (C) 1984, 1988, Sun Microsystems, Inc.
43 #include "namespace.h"
45 #include <rpc/types.h>
47 #include <rpc/rpcb_prot.h>
48 #include <rpc/rpc_com.h>
49 #include "un-namespace.h"
52 xdr_rpcb(XDR *xdrs, RPCB *objp)
54 if (!xdr_rpcprog(xdrs, &objp->r_prog)) {
57 if (!xdr_rpcvers(xdrs, &objp->r_vers)) {
60 if (!xdr_string(xdrs, &objp->r_netid, RPC_MAXDATASIZE)) {
63 if (!xdr_string(xdrs, &objp->r_addr, RPC_MAXDATASIZE)) {
66 if (!xdr_string(xdrs, &objp->r_owner, RPC_MAXDATASIZE)) {
73 * rpcblist_ptr implements a linked list. The RPCL definition from
78 * struct rpcblist *rpcb_next;
80 * typedef rpcblist *rpcblist_ptr;
82 * Recall that "pointers" in XDR are encoded as a boolean, indicating whether
83 * there's any data behind the pointer, followed by the data (if any exists).
84 * The boolean can be interpreted as ``more data follows me''; if FALSE then
85 * nothing follows the boolean; if TRUE then the boolean is followed by an
86 * actual struct rpcb, and another rpcblist_ptr (declared in RPCL as "struct
89 * This could be implemented via the xdr_pointer type, though this would
90 * result in one recursive call per element in the list. Rather than do that
91 * we can ``unwind'' the recursion into a while loop and use xdr_reference to
92 * serialize the rpcb elements.
96 xdr_rpcblist_ptr(XDR *xdrs, rpcblist_ptr *rp)
99 * more_elements is pre-computed in case the direction is
100 * XDR_ENCODE or XDR_FREE. more_elements is overwritten by
101 * xdr_bool when the direction is XDR_DECODE.
103 bool_t more_elements;
104 int freeing = (xdrs->x_op == XDR_FREE);
106 rpcblist_ptr next_copy;
110 more_elements = (bool_t)(*rp != NULL);
111 if (! xdr_bool(xdrs, &more_elements)) {
114 if (! more_elements) {
115 return (TRUE); /* we are done */
118 * the unfortunate side effect of non-recursion is that in
119 * the case of freeing we must remember the next object
120 * before we free the current object ...
123 next = (*rp)->rpcb_next;
124 if (! xdr_reference(xdrs, (caddr_t *)rp,
125 (u_int)sizeof (rpcblist), (xdrproc_t)xdr_rpcb)) {
132 * Note that in the subsequent iteration, next_copy
133 * gets nulled out by the xdr_reference
134 * but next itself survives.
137 rp = &((*rp)->rpcb_next);
144 * xdr_rpcblist() is specified to take a RPCBLIST **, but is identical in
145 * functionality to xdr_rpcblist_ptr().
148 xdr_rpcblist(XDR *xdrs, RPCBLIST **rp)
152 dummy = xdr_rpcblist_ptr(xdrs, (rpcblist_ptr *)rp);
158 xdr_rpcb_entry(XDR *xdrs, rpcb_entry *objp)
160 if (!xdr_string(xdrs, &objp->r_maddr, RPC_MAXDATASIZE)) {
163 if (!xdr_string(xdrs, &objp->r_nc_netid, RPC_MAXDATASIZE)) {
166 if (!xdr_u_int32_t(xdrs, &objp->r_nc_semantics)) {
169 if (!xdr_string(xdrs, &objp->r_nc_protofmly, RPC_MAXDATASIZE)) {
172 if (!xdr_string(xdrs, &objp->r_nc_proto, RPC_MAXDATASIZE)) {
179 xdr_rpcb_entry_list_ptr(XDR *xdrs, rpcb_entry_list_ptr *rp)
182 * more_elements is pre-computed in case the direction is
183 * XDR_ENCODE or XDR_FREE. more_elements is overwritten by
184 * xdr_bool when the direction is XDR_DECODE.
186 bool_t more_elements;
187 int freeing = (xdrs->x_op == XDR_FREE);
188 rpcb_entry_list_ptr next;
189 rpcb_entry_list_ptr next_copy;
193 more_elements = (bool_t)(*rp != NULL);
194 if (! xdr_bool(xdrs, &more_elements)) {
197 if (! more_elements) {
198 return (TRUE); /* we are done */
201 * the unfortunate side effect of non-recursion is that in
202 * the case of freeing we must remember the next object
203 * before we free the current object ...
206 next = (*rp)->rpcb_entry_next;
207 if (! xdr_reference(xdrs, (caddr_t *)rp,
208 (u_int)sizeof (rpcb_entry_list),
209 (xdrproc_t)xdr_rpcb_entry)) {
216 * Note that in the subsequent iteration, next_copy
217 * gets nulled out by the xdr_reference
218 * but next itself survives.
221 rp = &((*rp)->rpcb_entry_next);
228 * XDR remote call arguments
229 * written for XDR_ENCODE direction only
232 xdr_rpcb_rmtcallargs(XDR *xdrs, struct rpcb_rmtcallargs *p)
234 struct r_rpcb_rmtcallargs *objp =
235 (struct r_rpcb_rmtcallargs *)(void *)p;
236 u_int lenposition, argposition, position;
239 buf = XDR_INLINE(xdrs, 3 * BYTES_PER_XDR_UNIT);
241 if (!xdr_rpcprog(xdrs, &objp->prog)) {
244 if (!xdr_rpcvers(xdrs, &objp->vers)) {
247 if (!xdr_rpcproc(xdrs, &objp->proc)) {
251 IXDR_PUT_U_INT32(buf, objp->prog);
252 IXDR_PUT_U_INT32(buf, objp->vers);
253 IXDR_PUT_U_INT32(buf, objp->proc);
257 * All the jugglery for just getting the size of the arguments
259 lenposition = XDR_GETPOS(xdrs);
260 if (! xdr_u_int(xdrs, &(objp->args.args_len))) {
263 argposition = XDR_GETPOS(xdrs);
264 if (! (*objp->xdr_args)(xdrs, objp->args.args_val)) {
267 position = XDR_GETPOS(xdrs);
268 objp->args.args_len = (u_int)((u_long)position - (u_long)argposition);
269 XDR_SETPOS(xdrs, lenposition);
270 if (! xdr_u_int(xdrs, &(objp->args.args_len))) {
273 XDR_SETPOS(xdrs, position);
278 * XDR remote call results
279 * written for XDR_DECODE direction only
282 xdr_rpcb_rmtcallres(XDR *xdrs, struct rpcb_rmtcallres *p)
285 struct r_rpcb_rmtcallres *objp = (struct r_rpcb_rmtcallres *)(void *)p;
287 if (!xdr_string(xdrs, &objp->addr, RPC_MAXDATASIZE)) {
290 if (!xdr_u_int(xdrs, &objp->results.results_len)) {
293 dummy = (*(objp->xdr_res))(xdrs, objp->results.results_val);
298 xdr_netbuf(XDR *xdrs, struct netbuf *objp)
303 if (!xdr_u_int32_t(xdrs, (u_int32_t *) &objp->maxlen)) {
307 dummy = xdr_bytes(xdrs, (char **) pp,
308 (u_int *)&(objp->len), objp->maxlen);