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