]> git.saurik.com Git - apple/libinfo.git/blob - rpc.subproj/xdr_array.c
Libinfo-517.200.9.tar.gz
[apple/libinfo.git] / rpc.subproj / xdr_array.c
1 /*
2 * Copyright (c) 1999-2018 Apple Inc. All rights reserved.
3 *
4 * @APPLE_LICENSE_HEADER_START@
5 *
6 * Portions Copyright (c) 1999 Apple Computer, Inc. All Rights
7 * Reserved. This file contains Original Code and/or Modifications of
8 * Original Code as defined in and that are subject to the Apple Public
9 * Source License Version 1.1 (the "License"). You may not use this file
10 * except in compliance with the License. Please obtain a copy of the
11 * License at http://www.apple.com/publicsource and read it before using
12 * this file.
13 *
14 * The Original Code and all software distributed under the License are
15 * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
16 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
17 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE OR NON- INFRINGEMENT. Please see the
19 * License for the specific language governing rights and limitations
20 * under the License.
21 *
22 * @APPLE_LICENSE_HEADER_END@
23 */
24
25 /* $NetBSD: xdr_array.c,v 1.12 2000/01/22 22:19:18 mycroft Exp $ */
26
27 /*
28 * Sun RPC is a product of Sun Microsystems, Inc. and is provided for
29 * unrestricted use provided that this legend is included on all tape
30 * media and as a part of the software program in whole or part. Users
31 * may copy or modify Sun RPC without charge, but are not authorized
32 * to license or distribute it to anyone else except as part of a product or
33 * program developed by the user.
34 *
35 * SUN RPC IS PROVIDED AS IS WITH NO WARRANTIES OF ANY KIND INCLUDING THE
36 * WARRANTIES OF DESIGN, MERCHANTIBILITY AND FITNESS FOR A PARTICULAR
37 * PURPOSE, OR ARISING FROM A COURSE OF DEALING, USAGE OR TRADE PRACTICE.
38 *
39 * Sun RPC is provided with no support and without any obligation on the
40 * part of Sun Microsystems, Inc. to assist in its use, correction,
41 * modification or enhancement.
42 *
43 * SUN MICROSYSTEMS, INC. SHALL HAVE NO LIABILITY WITH RESPECT TO THE
44 * INFRINGEMENT OF COPYRIGHTS, TRADE SECRETS OR ANY PATENTS BY SUN RPC
45 * OR ANY PART THEREOF.
46 *
47 * In no event will Sun Microsystems, Inc. be liable for any lost revenue
48 * or profits or other special, indirect and consequential damages, even if
49 * Sun has been advised of the possibility of such damages.
50 *
51 * Sun Microsystems, Inc.
52 * 2550 Garcia Avenue
53 * Mountain View, California 94043
54 */
55
56 #if defined(LIBC_SCCS) && !defined(lint)
57 static char *sccsid = "@(#)xdr_array.c 1.10 87/08/11 Copyr 1984 Sun Micro";
58 static char *sccsid = "@(#)xdr_array.c 2.1 88/07/29 4.0 RPCSRC";
59 #endif
60 #include <sys/cdefs.h>
61
62 /*
63 * xdr_array.c, Generic XDR routines impelmentation.
64 *
65 * Copyright (C) 1984, Sun Microsystems, Inc.
66 *
67 * These are the "non-trivial" xdr primitives used to serialize and de-serialize
68 * arrays. See xdr.h for more info on the interface to xdr.
69 */
70
71 #include "libinfo_common.h"
72
73 #include <err.h>
74 #include <limits.h>
75 #include <stdio.h>
76 #include <stdlib.h>
77 #include <string.h>
78
79 #include <rpc/types.h>
80 #include <rpc/xdr.h>
81
82 /*
83 * XDR an array of arbitrary elements
84 * *addrp is a pointer to the array, *sizep is the number of elements.
85 * If addrp is NULL (*sizep * elsize) bytes are allocated.
86 * elsize is the size (in bytes) of each element, and elproc is the
87 * xdr procedure to call to handle each element of the array.
88 */
89 LIBINFO_EXPORT
90 bool_t
91 xdr_array(xdrs, addrp, sizep, maxsize, elsize, elproc)
92 XDR *xdrs;
93 caddr_t *addrp; /* array pointer */
94 u_int *sizep; /* number of elements */
95 u_int maxsize; /* max numberof elements */
96 u_int elsize; /* size in bytes of each element */
97 xdrproc_t elproc; /* xdr routine to handle each element */
98 {
99 u_int i;
100 caddr_t target = *addrp;
101 u_int c; /* the actual element count */
102 bool_t stat = TRUE;
103 u_int nodesize;
104
105 /* like strings, arrays are really counted arrays */
106 if (!xdr_u_int(xdrs, sizep)) {
107 return (FALSE);
108 }
109 c = *sizep;
110 if ((c > maxsize || UINT_MAX/elsize < c) &&
111 (xdrs->x_op != XDR_FREE)) {
112 return (FALSE);
113 }
114 nodesize = c * elsize;
115
116 /*
117 * if we are deserializing, we may need to allocate an array.
118 * We also save time by checking for a null array if we are freeing.
119 */
120 if (target == NULL)
121 switch (xdrs->x_op) {
122 case XDR_DECODE:
123 if (c == 0)
124 return (TRUE);
125 *addrp = target = mem_alloc(nodesize);
126 if (target == NULL) {
127 warnx("xdr_array: out of memory");
128 return (FALSE);
129 }
130 memset(target, 0, nodesize);
131 break;
132
133 case XDR_FREE:
134 return (TRUE);
135
136 case XDR_ENCODE:
137 break;
138 }
139
140 /*
141 * now we xdr each element of array
142 */
143 for (i = 0; (i < c) && stat; i++) {
144 stat = (*elproc)(xdrs, target, 0);
145 target += elsize;
146 }
147
148 /*
149 * the array may need freeing
150 */
151 if (xdrs->x_op == XDR_FREE) {
152 mem_free(*addrp, nodesize);
153 *addrp = NULL;
154 }
155 return (stat);
156 }
157
158 /*
159 * xdr_vector():
160 *
161 * XDR a fixed length array. Unlike variable-length arrays,
162 * the storage of fixed length arrays is static and unfreeable.
163 * > basep: base of the array
164 * > size: size of the array
165 * > elemsize: size of each element
166 * > xdr_elem: routine to XDR each element
167 */
168 LIBINFO_EXPORT
169 bool_t
170 xdr_vector(xdrs, basep, nelem, elemsize, xdr_elem)
171 XDR *xdrs;
172 char *basep;
173 u_int nelem;
174 u_int elemsize;
175 xdrproc_t xdr_elem;
176 {
177 u_int i;
178 char *elptr;
179
180 elptr = basep;
181 for (i = 0; i < nelem; i++) {
182 if (!(*xdr_elem)(xdrs, elptr, 0)) {
183 return(FALSE);
184 }
185 elptr += elemsize;
186 }
187 return(TRUE);
188 }