]> git.saurik.com Git - apple/libinfo.git/blame - rpc.subproj/xdr_array.c
Libinfo-89.1.tar.gz
[apple/libinfo.git] / rpc.subproj / xdr_array.c
CommitLineData
03fb6eb0
A
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";*/
56static char *rcsid = "$Id: xdr_array.c,v 1.2 1999/10/14 21:56:55 wsanchez 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 <rpc/types.h>
71#include <rpc/xdr.h>
72
73#define LASTUNSIGNED ((u_int)0-1)
74
75
76/*
77 * XDR an array of arbitrary elements
78 * *addrp is a pointer to the array, *sizep is the number of elements.
79 * If addrp is NULL (*sizep * elsize) bytes are allocated.
80 * elsize is the size (in bytes) of each element, and elproc is the
81 * xdr procedure to call to handle each element of the array.
82 */
83bool_t
84xdr_array(xdrs, addrp, sizep, maxsize, elsize, elproc)
85 register XDR *xdrs;
86 caddr_t *addrp; /* array pointer */
87 u_int *sizep; /* number of elements */
88 u_int maxsize; /* max numberof elements */
89 u_int elsize; /* size in bytes of each element */
90 xdrproc_t elproc; /* xdr routine to handle each element */
91{
92 register u_int i;
93 register caddr_t target = *addrp;
94 register u_int c; /* the actual element count */
95 register bool_t stat = TRUE;
96 register u_int nodesize;
97
98 /* like strings, arrays are really counted arrays */
99 if (! xdr_u_int(xdrs, sizep)) {
100 return (FALSE);
101 }
102 c = *sizep;
103 if ((c > maxsize) && (xdrs->x_op != XDR_FREE)) {
104 return (FALSE);
105 }
106 nodesize = c * elsize;
107
108 /*
109 * if we are deserializing, we may need to allocate an array.
110 * We also save time by checking for a null array if we are freeing.
111 */
112 if (target == NULL)
113 switch (xdrs->x_op) {
114 case XDR_DECODE:
115 if (c == 0)
116 return (TRUE);
117 *addrp = target = mem_alloc(nodesize);
118 if (target == NULL) {
119 (void) fprintf(stderr,
120 "xdr_array: out of memory\n");
121 return (FALSE);
122 }
123 bzero(target, nodesize);
124 break;
125
126 case XDR_FREE:
127 return (TRUE);
128 }
129
130 /*
131 * now we xdr each element of array
132 */
133 for (i = 0; (i < c) && stat; i++) {
134 stat = (*elproc)(xdrs, target, LASTUNSIGNED);
135 target += elsize;
136 }
137
138 /*
139 * the array may need freeing
140 */
141 if (xdrs->x_op == XDR_FREE) {
142 mem_free(*addrp, nodesize);
143 *addrp = NULL;
144 }
145 return (stat);
146}
147
148/*
149 * xdr_vector():
150 *
151 * XDR a fixed length array. Unlike variable-length arrays,
152 * the storage of fixed length arrays is static and unfreeable.
153 * > basep: base of the array
154 * > size: size of the array
155 * > elemsize: size of each element
156 * > xdr_elem: routine to XDR each element
157 */
158bool_t
159xdr_vector(xdrs, basep, nelem, elemsize, xdr_elem)
160 register XDR *xdrs;
161 register char *basep;
162 register u_int nelem;
163 register u_int elemsize;
164 register xdrproc_t xdr_elem;
165{
166 register u_int i;
167 register char *elptr;
168
169 elptr = basep;
170 for (i = 0; i < nelem; i++) {
171 if (! (*xdr_elem)(xdrs, elptr, LASTUNSIGNED)) {
172 return(FALSE);
173 }
174 elptr += elemsize;
175 }
176 return(TRUE);
177}
178