1dfdcada3SDoug Rabson /* $NetBSD: xdr_array.c,v 1.12 2000/01/22 22:19:18 mycroft Exp $ */
2dfdcada3SDoug Rabson
3dfdcada3SDoug Rabson /*
4dfdcada3SDoug Rabson * Sun RPC is a product of Sun Microsystems, Inc. and is provided for
5dfdcada3SDoug Rabson * unrestricted use provided that this legend is included on all tape
6dfdcada3SDoug Rabson * media and as a part of the software program in whole or part. Users
7dfdcada3SDoug Rabson * may copy or modify Sun RPC without charge, but are not authorized
8dfdcada3SDoug Rabson * to license or distribute it to anyone else except as part of a product or
9dfdcada3SDoug Rabson * program developed by the user.
10dfdcada3SDoug Rabson *
11dfdcada3SDoug Rabson * SUN RPC IS PROVIDED AS IS WITH NO WARRANTIES OF ANY KIND INCLUDING THE
12dfdcada3SDoug Rabson * WARRANTIES OF DESIGN, MERCHANTIBILITY AND FITNESS FOR A PARTICULAR
13dfdcada3SDoug Rabson * PURPOSE, OR ARISING FROM A COURSE OF DEALING, USAGE OR TRADE PRACTICE.
14dfdcada3SDoug Rabson *
15dfdcada3SDoug Rabson * Sun RPC is provided with no support and without any obligation on the
16dfdcada3SDoug Rabson * part of Sun Microsystems, Inc. to assist in its use, correction,
17dfdcada3SDoug Rabson * modification or enhancement.
18dfdcada3SDoug Rabson *
19dfdcada3SDoug Rabson * SUN MICROSYSTEMS, INC. SHALL HAVE NO LIABILITY WITH RESPECT TO THE
20dfdcada3SDoug Rabson * INFRINGEMENT OF COPYRIGHTS, TRADE SECRETS OR ANY PATENTS BY SUN RPC
21dfdcada3SDoug Rabson * OR ANY PART THEREOF.
22dfdcada3SDoug Rabson *
23dfdcada3SDoug Rabson * In no event will Sun Microsystems, Inc. be liable for any lost revenue
24dfdcada3SDoug Rabson * or profits or other special, indirect and consequential damages, even if
25dfdcada3SDoug Rabson * Sun has been advised of the possibility of such damages.
26dfdcada3SDoug Rabson *
27dfdcada3SDoug Rabson * Sun Microsystems, Inc.
28dfdcada3SDoug Rabson * 2550 Garcia Avenue
29dfdcada3SDoug Rabson * Mountain View, California 94043
30dfdcada3SDoug Rabson */
31dfdcada3SDoug Rabson
32dfdcada3SDoug Rabson #include <sys/cdefs.h>
33dfdcada3SDoug Rabson /*
34*25126300SPedro F. Giffuni * xdr_array.c, Generic XDR routines implementation.
35dfdcada3SDoug Rabson *
36dfdcada3SDoug Rabson * Copyright (C) 1984, Sun Microsystems, Inc.
37dfdcada3SDoug Rabson *
38dfdcada3SDoug Rabson * These are the "non-trivial" xdr primitives used to serialize and de-serialize
39dfdcada3SDoug Rabson * arrays. See xdr.h for more info on the interface to xdr.
40dfdcada3SDoug Rabson */
41dfdcada3SDoug Rabson
42dfdcada3SDoug Rabson #include <sys/param.h>
43dfdcada3SDoug Rabson #include <sys/systm.h>
44dfdcada3SDoug Rabson #include <sys/limits.h>
45dfdcada3SDoug Rabson #include <sys/malloc.h>
46dfdcada3SDoug Rabson
47dfdcada3SDoug Rabson #include <rpc/types.h>
48dfdcada3SDoug Rabson #include <rpc/xdr.h>
49dfdcada3SDoug Rabson
50dfdcada3SDoug Rabson /*
51dfdcada3SDoug Rabson * XDR an array of arbitrary elements
52dfdcada3SDoug Rabson * *addrp is a pointer to the array, *sizep is the number of elements.
53dfdcada3SDoug Rabson * If addrp is NULL (*sizep * elsize) bytes are allocated.
54dfdcada3SDoug Rabson * elsize is the size (in bytes) of each element, and elproc is the
55dfdcada3SDoug Rabson * xdr procedure to call to handle each element of the array.
56dfdcada3SDoug Rabson */
57dfdcada3SDoug Rabson bool_t
xdr_array(XDR * xdrs,caddr_t * addrp,u_int * sizep,u_int maxsize,u_int elsize,xdrproc_t elproc)58dfdcada3SDoug Rabson xdr_array(XDR *xdrs,
59dfdcada3SDoug Rabson caddr_t *addrp, /* array pointer */
60dfdcada3SDoug Rabson u_int *sizep, /* number of elements */
61dfdcada3SDoug Rabson u_int maxsize, /* max numberof elements */
62dfdcada3SDoug Rabson u_int elsize, /* size in bytes of each element */
63dfdcada3SDoug Rabson xdrproc_t elproc) /* xdr routine to handle each element */
64dfdcada3SDoug Rabson {
65dfdcada3SDoug Rabson u_int i;
66dfdcada3SDoug Rabson caddr_t target = *addrp;
67dfdcada3SDoug Rabson u_int c; /* the actual element count */
68dfdcada3SDoug Rabson bool_t stat = TRUE;
69dfdcada3SDoug Rabson u_int nodesize;
70dfdcada3SDoug Rabson
71dfdcada3SDoug Rabson /* like strings, arrays are really counted arrays */
72dfdcada3SDoug Rabson if (!xdr_u_int(xdrs, sizep)) {
73dfdcada3SDoug Rabson return (FALSE);
74dfdcada3SDoug Rabson }
75dfdcada3SDoug Rabson c = *sizep;
76dfdcada3SDoug Rabson if ((c > maxsize || UINT_MAX/elsize < c) &&
77dfdcada3SDoug Rabson (xdrs->x_op != XDR_FREE)) {
78dfdcada3SDoug Rabson return (FALSE);
79dfdcada3SDoug Rabson }
80dfdcada3SDoug Rabson nodesize = c * elsize;
81dfdcada3SDoug Rabson
82dfdcada3SDoug Rabson /*
83dfdcada3SDoug Rabson * if we are deserializing, we may need to allocate an array.
84dfdcada3SDoug Rabson * We also save time by checking for a null array if we are freeing.
85dfdcada3SDoug Rabson */
86dfdcada3SDoug Rabson if (target == NULL)
87dfdcada3SDoug Rabson switch (xdrs->x_op) {
88dfdcada3SDoug Rabson case XDR_DECODE:
89dfdcada3SDoug Rabson if (c == 0)
90dfdcada3SDoug Rabson return (TRUE);
91dfdcada3SDoug Rabson *addrp = target = mem_alloc(nodesize);
92dfdcada3SDoug Rabson if (target == NULL) {
93dfdcada3SDoug Rabson printf("xdr_array: out of memory");
94dfdcada3SDoug Rabson return (FALSE);
95dfdcada3SDoug Rabson }
96dfdcada3SDoug Rabson memset(target, 0, nodesize);
97dfdcada3SDoug Rabson break;
98dfdcada3SDoug Rabson
99dfdcada3SDoug Rabson case XDR_FREE:
100dfdcada3SDoug Rabson return (TRUE);
101dfdcada3SDoug Rabson
102dfdcada3SDoug Rabson case XDR_ENCODE:
103dfdcada3SDoug Rabson break;
104dfdcada3SDoug Rabson }
105dfdcada3SDoug Rabson
106dfdcada3SDoug Rabson /*
107dfdcada3SDoug Rabson * now we xdr each element of array
108dfdcada3SDoug Rabson */
109dfdcada3SDoug Rabson for (i = 0; (i < c) && stat; i++) {
110dfdcada3SDoug Rabson stat = (*elproc)(xdrs, target);
111dfdcada3SDoug Rabson target += elsize;
112dfdcada3SDoug Rabson }
113dfdcada3SDoug Rabson
114dfdcada3SDoug Rabson /*
115dfdcada3SDoug Rabson * the array may need freeing
116dfdcada3SDoug Rabson */
117dfdcada3SDoug Rabson if (xdrs->x_op == XDR_FREE) {
118dfdcada3SDoug Rabson mem_free(*addrp, nodesize);
119dfdcada3SDoug Rabson *addrp = NULL;
120dfdcada3SDoug Rabson }
121dfdcada3SDoug Rabson return (stat);
122dfdcada3SDoug Rabson }
123dfdcada3SDoug Rabson
124dfdcada3SDoug Rabson /*
125dfdcada3SDoug Rabson * xdr_vector():
126dfdcada3SDoug Rabson *
127dfdcada3SDoug Rabson * XDR a fixed length array. Unlike variable-length arrays,
128dfdcada3SDoug Rabson * the storage of fixed length arrays is static and unfreeable.
129dfdcada3SDoug Rabson * > basep: base of the array
130dfdcada3SDoug Rabson * > size: size of the array
131dfdcada3SDoug Rabson * > elemsize: size of each element
132dfdcada3SDoug Rabson * > xdr_elem: routine to XDR each element
133dfdcada3SDoug Rabson */
134dfdcada3SDoug Rabson bool_t
xdr_vector(XDR * xdrs,char * basep,u_int nelem,u_int elemsize,xdrproc_t xdr_elem)135dfdcada3SDoug Rabson xdr_vector(XDR *xdrs, char *basep, u_int nelem, u_int elemsize,
136dfdcada3SDoug Rabson xdrproc_t xdr_elem)
137dfdcada3SDoug Rabson {
138dfdcada3SDoug Rabson u_int i;
139dfdcada3SDoug Rabson char *elptr;
140dfdcada3SDoug Rabson
141dfdcada3SDoug Rabson elptr = basep;
142dfdcada3SDoug Rabson for (i = 0; i < nelem; i++) {
143dfdcada3SDoug Rabson if (!(*xdr_elem)(xdrs, elptr)) {
144dfdcada3SDoug Rabson return(FALSE);
145dfdcada3SDoug Rabson }
146dfdcada3SDoug Rabson elptr += elemsize;
147dfdcada3SDoug Rabson }
148dfdcada3SDoug Rabson return(TRUE);
149dfdcada3SDoug Rabson }
150