1 /* $NetBSD: xdr_array.c,v 1.19 2013/03/11 20:19:29 tron Exp $ */
2
3 /*
4 * Copyright (c) 2010, Oracle America, Inc.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions are
8 * met:
9 *
10 * * Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * * Redistributions in binary form must reproduce the above
13 * copyright notice, this list of conditions and the following
14 * disclaimer in the documentation and/or other materials
15 * provided with the distribution.
16 * * Neither the name of the "Oracle America, 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
21 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
23 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
24 * COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
25 * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
27 * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
28 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
29 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
30 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
31 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 */
33
34 #include <sys/cdefs.h>
35 #if defined(LIBC_SCCS) && !defined(lint)
36 #if 0
37 static char *sccsid = "@(#)xdr_array.c 1.10 87/08/11 Copyr 1984 Sun Micro";
38 static char *sccsid = "@(#)xdr_array.c 2.1 88/07/29 4.0 RPCSRC";
39 #else
40 __RCSID("$NetBSD: xdr_array.c,v 1.19 2013/03/11 20:19:29 tron Exp $");
41 #endif
42 #endif
43
44 /*
45 * xdr_array.c, Generic XDR routines implementation.
46 *
47 * Copyright (C) 1984, Sun Microsystems, Inc.
48 *
49 * These are the "non-trivial" xdr primitives used to serialize and de-serialize
50 * arrays. See xdr.h for more info on the interface to xdr.
51 */
52
53 #include "namespace.h"
54
55 #include <err.h>
56 #include <stdio.h>
57 #include <stdlib.h>
58 #include <string.h>
59 #include <limits.h>
60
61 #include <rpc/types.h>
62 #include <rpc/xdr.h>
63
64 #ifdef __weak_alias
__weak_alias(xdr_array,_xdr_array)65 __weak_alias(xdr_array,_xdr_array)
66 __weak_alias(xdr_vector,_xdr_vector)
67 #endif
68
69 /*
70 * XDR an array of arbitrary elements
71 * *addrp is a pointer to the array, *sizep is the number of elements.
72 * If addrp is NULL (*sizep * elsize) bytes are allocated.
73 * elsize is the size (in bytes) of each element, and elproc is the
74 * xdr procedure to call to handle each element of the array.
75 */
76 bool_t
77 xdr_array(XDR *xdrs, caddr_t *addrp, u_int *sizep, u_int maxsize, u_int elsize,
78 xdrproc_t elproc)
79 {
80 u_int i;
81 caddr_t target = *addrp;
82 u_int c; /* the actual element count */
83 bool_t stat = TRUE;
84 u_int nodesize;
85
86 /* like strings, arrays are really counted arrays */
87 if (!xdr_u_int(xdrs, sizep))
88 return (FALSE);
89
90 c = *sizep;
91 if ((c > maxsize || UINT_MAX/elsize < c) &&
92 (xdrs->x_op != XDR_FREE))
93 return (FALSE);
94 nodesize = c * elsize;
95
96 /*
97 * if we are deserializing, we may need to allocate an array.
98 * We also save time by checking for a null array if we are freeing.
99 */
100 if (target == NULL)
101 switch (xdrs->x_op) {
102 case XDR_DECODE:
103 if (c == 0)
104 return (TRUE);
105 *addrp = target = mem_alloc(nodesize);
106 if (target == NULL) {
107 warn("%s: out of memory", __func__);
108 return (FALSE);
109 }
110 memset(target, 0, nodesize);
111 break;
112
113 case XDR_FREE:
114 return (TRUE);
115
116 case XDR_ENCODE:
117 break;
118 }
119
120 /*
121 * now we xdr each element of array
122 */
123 for (i = 0; (i < c) && stat; i++) {
124 stat = (*elproc)(xdrs, target);
125 target += elsize;
126 }
127
128 /*
129 * the array may need freeing
130 */
131 if (xdrs->x_op == XDR_FREE) {
132 mem_free(*addrp, nodesize);
133 *addrp = NULL;
134 }
135 return (stat);
136 }
137
138 /*
139 * xdr_vector():
140 *
141 * XDR a fixed length array. Unlike variable-length arrays,
142 * the storage of fixed length arrays is static and unfreeable.
143 * > basep: base of the array
144 * > size: size of the array
145 * > elemsize: size of each element
146 * > xdr_elem: routine to XDR each element
147 */
148 bool_t
xdr_vector(XDR * xdrs,char * basep,u_int nelem,u_int elemsize,xdrproc_t xdr_elem)149 xdr_vector(XDR *xdrs, char *basep, u_int nelem, u_int elemsize,
150 xdrproc_t xdr_elem)
151 {
152 u_int i;
153 char *elptr;
154
155 elptr = basep;
156 for (i = 0; i < nelem; i++) {
157 if (!(*xdr_elem)(xdrs, elptr)) {
158 return(FALSE);
159 }
160 elptr += elemsize;
161 }
162 return(TRUE);
163 }
164