]> git.saurik.com Git - apple/libinfo.git/blob - rpc.subproj/xdr_array.c
Libinfo-129.1.tar.gz
[apple/libinfo.git] / rpc.subproj / xdr_array.c
1 /*
2 * Copyright (c) 1999 Apple Computer, 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 * Sun RPC is a product of Sun Microsystems, Inc. and is provided for
26 * unrestricted use provided that this legend is included on all tape
27 * media and as a part of the software program in whole or part. Users
28 * may copy or modify Sun RPC without charge, but are not authorized
29 * to license or distribute it to anyone else except as part of a product or
30 * program developed by the user.
31 *
32 * SUN RPC IS PROVIDED AS IS WITH NO WARRANTIES OF ANY KIND INCLUDING THE
33 * WARRANTIES OF DESIGN, MERCHANTIBILITY AND FITNESS FOR A PARTICULAR
34 * PURPOSE, OR ARISING FROM A COURSE OF DEALING, USAGE OR TRADE PRACTICE.
35 *
36 * Sun RPC is provided with no support and without any obligation on the
37 * part of Sun Microsystems, Inc. to assist in its use, correction,
38 * modification or enhancement.
39 *
40 * SUN MICROSYSTEMS, INC. SHALL HAVE NO LIABILITY WITH RESPECT TO THE
41 * INFRINGEMENT OF COPYRIGHTS, TRADE SECRETS OR ANY PATENTS BY SUN RPC
42 * OR ANY PART THEREOF.
43 *
44 * In no event will Sun Microsystems, Inc. be liable for any lost revenue
45 * or profits or other special, indirect and consequential damages, even if
46 * Sun has been advised of the possibility of such damages.
47 *
48 * Sun Microsystems, Inc.
49 * 2550 Garcia Avenue
50 * Mountain View, California 94043
51 */
52
53 #if defined(LIBC_SCCS) && !defined(lint)
54 /*static char *sccsid = "from: @(#)xdr_array.c 1.10 87/08/11 Copyr 1984 Sun Micro";*/
55 /*static char *sccsid = "from: @(#)xdr_array.c 2.1 88/07/29 4.0 RPCSRC";*/
56 static char *rcsid = "$Id: xdr_array.c,v 1.3.84.1 2002/08/06 19:46:15 bbraun Exp $";
57 #endif
58
59 /*
60 * xdr_array.c, Generic XDR routines impelmentation.
61 *
62 * Copyright (C) 1984, Sun Microsystems, Inc.
63 *
64 * These are the "non-trivial" xdr primitives used to serialize and de-serialize
65 * arrays. See xdr.h for more info on the interface to xdr.
66 */
67
68 #include <stdio.h>
69 #include <stdlib.h>
70 #include <string.h>
71 #include <rpc/types.h>
72 #include <rpc/xdr.h>
73 #include <limits.h>
74
75 #define LASTUNSIGNED ((u_int)0-1)
76
77
78 /*
79 * XDR an array of arbitrary elements
80 * *addrp is a pointer to the array, *sizep is the number of elements.
81 * If addrp is NULL (*sizep * elsize) bytes are allocated.
82 * elsize is the size (in bytes) of each element, and elproc is the
83 * xdr procedure to call to handle each element of the array.
84 */
85 bool_t
86 xdr_array(xdrs, addrp, sizep, maxsize, elsize, elproc)
87 register XDR *xdrs;
88 caddr_t *addrp; /* array pointer */
89 u_int *sizep; /* number of elements */
90 u_int maxsize; /* max numberof elements */
91 u_int elsize; /* size in bytes of each element */
92 xdrproc_t elproc; /* xdr routine to handle each element */
93 {
94 register u_int i;
95 register caddr_t target = *addrp;
96 register u_int c; /* the actual element count */
97 register bool_t stat = TRUE;
98 register u_int nodesize;
99
100 /* like strings, arrays are really counted arrays */
101 if (! xdr_u_int(xdrs, sizep)) {
102 return (FALSE);
103 }
104 c = *sizep;
105 if ((c > maxsize || UINT_MAX/elsize < c) &&
106 (xdrs->x_op != XDR_FREE)) {
107 return (FALSE);
108 }
109 nodesize = c * elsize;
110
111 /*
112 * if we are deserializing, we may need to allocate an array.
113 * We also save time by checking for a null array if we are freeing.
114 */
115 if (target == NULL)
116 switch (xdrs->x_op) {
117 case XDR_DECODE:
118 if (c == 0)
119 return (TRUE);
120 *addrp = target = mem_alloc(nodesize);
121 if (target == NULL) {
122 (void) fprintf(stderr,
123 "xdr_array: out of memory\n");
124 return (FALSE);
125 }
126 bzero(target, nodesize);
127 break;
128
129 case XDR_FREE:
130 return (TRUE);
131 }
132
133 /*
134 * now we xdr each element of array
135 */
136 for (i = 0; (i < c) && stat; i++) {
137 stat = (*elproc)(xdrs, target, LASTUNSIGNED);
138 target += elsize;
139 }
140
141 /*
142 * the array may need freeing
143 */
144 if (xdrs->x_op == XDR_FREE) {
145 mem_free(*addrp, nodesize);
146 *addrp = NULL;
147 }
148 return (stat);
149 }
150
151 /*
152 * xdr_vector():
153 *
154 * XDR a fixed length array. Unlike variable-length arrays,
155 * the storage of fixed length arrays is static and unfreeable.
156 * > basep: base of the array
157 * > size: size of the array
158 * > elemsize: size of each element
159 * > xdr_elem: routine to XDR each element
160 */
161 bool_t
162 xdr_vector(xdrs, basep, nelem, elemsize, xdr_elem)
163 register XDR *xdrs;
164 register char *basep;
165 register u_int nelem;
166 register u_int elemsize;
167 register xdrproc_t xdr_elem;
168 {
169 register u_int i;
170 register char *elptr;
171
172 elptr = basep;
173 for (i = 0; i < nelem; i++) {
174 if (! (*xdr_elem)(xdrs, elptr, LASTUNSIGNED)) {
175 return(FALSE);
176 }
177 elptr += elemsize;
178 }
179 return(TRUE);
180 }
181