xref: /dragonfly/lib/libc/rpc/rpcb_prot.c (revision 2038fb68)
1 /*
2  * Sun RPC is a product of Sun Microsystems, Inc. and is provided for
3  * unrestricted use provided that this legend is included on all tape
4  * media and as a part of the software program in whole or part.  Users
5  * may copy or modify Sun RPC without charge, but are not authorized
6  * to license or distribute it to anyone else except as part of a product or
7  * program developed by the user.
8  *
9  * SUN RPC IS PROVIDED AS IS WITH NO WARRANTIES OF ANY KIND INCLUDING THE
10  * WARRANTIES OF DESIGN, MERCHANTIBILITY AND FITNESS FOR A PARTICULAR
11  * PURPOSE, OR ARISING FROM A COURSE OF DEALING, USAGE OR TRADE PRACTICE.
12  *
13  * Sun RPC is provided with no support and without any obligation on the
14  * part of Sun Microsystems, Inc. to assist in its use, correction,
15  * modification or enhancement.
16  *
17  * SUN MICROSYSTEMS, INC. SHALL HAVE NO LIABILITY WITH RESPECT TO THE
18  * INFRINGEMENT OF COPYRIGHTS, TRADE SECRETS OR ANY PATENTS BY SUN RPC
19  * OR ANY PART THEREOF.
20  *
21  * In no event will Sun Microsystems, Inc. be liable for any lost revenue
22  * or profits or other special, indirect and consequential damages, even if
23  * Sun has been advised of the possibility of such damages.
24  *
25  * Sun Microsystems, Inc.
26  * 2550 Garcia Avenue
27  * Mountain View, California  94043
28  *
29  * @(#)rpcb_prot.c	1.13	94/04/24 SMI; 1.9 89/04/21 Copyr 1984 Sun Micro
30  * $NetBSD: rpcb_prot.c,v 1.3 2000/07/14 08:40:42 fvdl Exp $
31  * $FreeBSD: src/lib/libc/rpc/rpcb_prot.c,v 1.7 2007/11/20 01:51:20 jb Exp $
32  */
33 /*
34  * Copyright (c) 1986-1991 by Sun Microsystems Inc.
35  */
36 
37 /*
38  * rpcb_prot.c
39  * XDR routines for the rpcbinder version 3.
40  *
41  * Copyright (C) 1984, 1988, Sun Microsystems, Inc.
42  */
43 
44 #include "namespace.h"
45 #include <rpc/rpc.h>
46 #include <rpc/types.h>
47 #include <rpc/xdr.h>
48 #include <rpc/rpcb_prot.h>
49 #include "un-namespace.h"
50 
51 bool_t
52 xdr_rpcb(XDR *xdrs, RPCB *objp)
53 {
54 	if (!xdr_u_int32_t(xdrs, &objp->r_prog)) {
55 		return (FALSE);
56 	}
57 	if (!xdr_u_int32_t(xdrs, &objp->r_vers)) {
58 		return (FALSE);
59 	}
60 	if (!xdr_string(xdrs, &objp->r_netid, (u_int)~0)) {
61 		return (FALSE);
62 	}
63 	if (!xdr_string(xdrs, &objp->r_addr, (u_int)~0)) {
64 		return (FALSE);
65 	}
66 	if (!xdr_string(xdrs, &objp->r_owner, (u_int)~0)) {
67 		return (FALSE);
68 	}
69 	return (TRUE);
70 }
71 
72 /*
73  * rpcblist_ptr implements a linked list.  The RPCL definition from
74  * rpcb_prot.x is:
75  *
76  * struct rpcblist {
77  * 	rpcb		rpcb_map;
78  *	struct rpcblist *rpcb_next;
79  * };
80  * typedef rpcblist *rpcblist_ptr;
81  *
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
87  * rpcblist *").
88  *
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.
93  */
94 
95 bool_t
96 xdr_rpcblist_ptr(XDR *xdrs, rpcblist_ptr *rp)
97 {
98 	/*
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.
102 	 */
103 	bool_t more_elements;
104 	int freeing = (xdrs->x_op == XDR_FREE);
105 	rpcblist_ptr next;
106 	rpcblist_ptr next_copy;
107 
108 	next = NULL;
109 	for (;;) {
110 		more_elements = (bool_t)(*rp != NULL);
111 		if (! xdr_bool(xdrs, &more_elements)) {
112 			return (FALSE);
113 		}
114 		if (! more_elements) {
115 			return (TRUE);  /* we are done */
116 		}
117 		/*
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 ...
121 		 */
122 		if (freeing && *rp)
123 			next = (*rp)->rpcb_next;
124 		if (! xdr_reference(xdrs, (caddr_t *)rp,
125 		    (u_int)sizeof (rpcblist), (xdrproc_t)xdr_rpcb)) {
126 			return (FALSE);
127 		}
128 		if (freeing) {
129 			next_copy = next;
130 			rp = &next_copy;
131 			/*
132 			 * Note that in the subsequent iteration, next_copy
133 			 * gets nulled out by the xdr_reference
134 			 * but next itself survives.
135 			 */
136 		} else if (*rp) {
137 			rp = &((*rp)->rpcb_next);
138 		}
139 	}
140 	/*NOTREACHED*/
141 }
142 
143 /*
144  * xdr_rpcblist() is specified to take a RPCBLIST **, but is identical in
145  * functionality to xdr_rpcblist_ptr().
146  */
147 bool_t
148 xdr_rpcblist(XDR *xdrs, RPCBLIST **rp)
149 {
150 	bool_t	dummy;
151 
152 	dummy = xdr_rpcblist_ptr(xdrs, (rpcblist_ptr *)rp);
153 	return (dummy);
154 }
155 
156 
157 bool_t
158 xdr_rpcb_entry(XDR *xdrs, rpcb_entry *objp)
159 {
160 	if (!xdr_string(xdrs, &objp->r_maddr, (u_int)~0)) {
161 		return (FALSE);
162 	}
163 	if (!xdr_string(xdrs, &objp->r_nc_netid, (u_int)~0)) {
164 		return (FALSE);
165 	}
166 	if (!xdr_u_int32_t(xdrs, &objp->r_nc_semantics)) {
167 		return (FALSE);
168 	}
169 	if (!xdr_string(xdrs, &objp->r_nc_protofmly, (u_int)~0)) {
170 		return (FALSE);
171 	}
172 	if (!xdr_string(xdrs, &objp->r_nc_proto, (u_int)~0)) {
173 		return (FALSE);
174 	}
175 	return (TRUE);
176 }
177 
178 bool_t
179 xdr_rpcb_entry_list_ptr(XDR *xdrs, rpcb_entry_list_ptr *rp)
180 {
181 	/*
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.
185 	 */
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;
190 
191 	next = NULL;
192 	for (;;) {
193 		more_elements = (bool_t)(*rp != NULL);
194 		if (! xdr_bool(xdrs, &more_elements)) {
195 			return (FALSE);
196 		}
197 		if (! more_elements) {
198 			return (TRUE);  /* we are done */
199 		}
200 		/*
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 ...
204 		 */
205 		if (freeing)
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)) {
210 			return (FALSE);
211 		}
212 		if (freeing && *rp) {
213 			next_copy = next;
214 			rp = &next_copy;
215 			/*
216 			 * Note that in the subsequent iteration, next_copy
217 			 * gets nulled out by the xdr_reference
218 			 * but next itself survives.
219 			 */
220 		} else if (*rp) {
221 			rp = &((*rp)->rpcb_entry_next);
222 		}
223 	}
224 	/*NOTREACHED*/
225 }
226 
227 /*
228  * XDR remote call arguments
229  * written for XDR_ENCODE direction only
230  */
231 bool_t
232 xdr_rpcb_rmtcallargs(XDR *xdrs, struct rpcb_rmtcallargs *p)
233 {
234 	struct r_rpcb_rmtcallargs *objp =
235 	    (struct r_rpcb_rmtcallargs *)(void *)p;
236 	u_int lenposition, argposition, position;
237 	int32_t *buf;
238 
239 	buf = XDR_INLINE(xdrs, 3 * BYTES_PER_XDR_UNIT);
240 	if (buf == NULL) {
241 		if (!xdr_u_int32_t(xdrs, &objp->prog)) {
242 			return (FALSE);
243 		}
244 		if (!xdr_u_int32_t(xdrs, &objp->vers)) {
245 			return (FALSE);
246 		}
247 		if (!xdr_u_int32_t(xdrs, &objp->proc)) {
248 			return (FALSE);
249 		}
250 	} else {
251 		IXDR_PUT_U_INT32(buf, objp->prog);
252 		IXDR_PUT_U_INT32(buf, objp->vers);
253 		IXDR_PUT_U_INT32(buf, objp->proc);
254 	}
255 
256 	/*
257 	 * All the jugglery for just getting the size of the arguments
258 	 */
259 	lenposition = XDR_GETPOS(xdrs);
260 	if (! xdr_u_int(xdrs, &(objp->args.args_len))) {
261 		return (FALSE);
262 	}
263 	argposition = XDR_GETPOS(xdrs);
264 	if (! (*objp->xdr_args)(xdrs, objp->args.args_val)) {
265 		return (FALSE);
266 	}
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))) {
271 		return (FALSE);
272 	}
273 	XDR_SETPOS(xdrs, position);
274 	return (TRUE);
275 }
276 
277 /*
278  * XDR remote call results
279  * written for XDR_DECODE direction only
280  */
281 bool_t
282 xdr_rpcb_rmtcallres(XDR *xdrs, struct rpcb_rmtcallres *p)
283 {
284 	bool_t dummy;
285 	struct r_rpcb_rmtcallres *objp = (struct r_rpcb_rmtcallres *)(void *)p;
286 
287 	if (!xdr_string(xdrs, &objp->addr, (u_int)~0)) {
288 		return (FALSE);
289 	}
290 	if (!xdr_u_int(xdrs, &objp->results.results_len)) {
291 		return (FALSE);
292 	}
293 	dummy = (*(objp->xdr_res))(xdrs, objp->results.results_val);
294 	return (dummy);
295 }
296 
297 bool_t
298 xdr_netbuf(XDR *xdrs, struct netbuf *objp)
299 {
300 	bool_t dummy;
301 	void **pp;
302 
303 	if (!xdr_u_int32_t(xdrs, (u_int32_t *) &objp->maxlen)) {
304 		return (FALSE);
305 	}
306 	pp = &objp->buf;
307 	dummy = xdr_bytes(xdrs, (char **) pp,
308 			(u_int *)&(objp->len), objp->maxlen);
309 	return (dummy);
310 }
311