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