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