140 lines
3.1 KiB
C
140 lines
3.1 KiB
C
#if !defined(lint) && defined(SCCSIDS)
|
|
static char sccsid[] = "@(#)xdr_array.c 1.1 94/10/31 Copyr 1984 Sun Micro";
|
|
#endif
|
|
|
|
/*
|
|
* xdr_array.c, Generic XDR routines impelmentation.
|
|
*
|
|
* Copyright (C) 1984, Sun Microsystems, Inc.
|
|
*
|
|
* These are the "non-trivial" xdr primitives used to serialize and de-serialize
|
|
* arrays. See xdr.h for more info on the interface to xdr.
|
|
*/
|
|
|
|
#ifdef KERNEL
|
|
#include <sys/param.h>
|
|
#include <sys/systm.h>
|
|
#else
|
|
#include <sys/syslog.h>
|
|
#include <stdio.h>
|
|
#endif
|
|
|
|
#include <rpc/types.h>
|
|
#include <rpc/xdr.h>
|
|
|
|
#define LASTUNSIGNED ((u_int)0-1)
|
|
|
|
|
|
/*
|
|
* XDR an array of arbitrary elements
|
|
* *addrp is a pointer to the array, *sizep is the number of elements.
|
|
* If addrp is NULL (*sizep * elsize) bytes are allocated.
|
|
* elsize is the size (in bytes) of each element, and elproc is the
|
|
* xdr procedure to call to handle each element of the array.
|
|
*/
|
|
bool_t
|
|
xdr_array(xdrs, addrp, sizep, maxsize, elsize, elproc)
|
|
register XDR *xdrs;
|
|
caddr_t *addrp; /* array pointer */
|
|
u_int *sizep; /* number of elements */
|
|
u_int maxsize; /* max numberof elements */
|
|
u_int elsize; /* size in bytes of each element */
|
|
xdrproc_t elproc; /* xdr routine to handle each element */
|
|
{
|
|
register u_int i;
|
|
register caddr_t target = *addrp;
|
|
register u_int c; /* the actual element count */
|
|
register bool_t stat = TRUE;
|
|
register u_int nodesize;
|
|
|
|
/* like strings, arrays are really counted arrays */
|
|
if (! xdr_u_int(xdrs, sizep)) {
|
|
#ifdef KERNEL
|
|
printf("xdr_array: size FAILED\n");
|
|
#endif
|
|
return (FALSE);
|
|
}
|
|
c = *sizep;
|
|
if ((c > maxsize) && (xdrs->x_op != XDR_FREE)) {
|
|
#ifdef KERNEL
|
|
printf("xdr_array: bad size FAILED\n");
|
|
#endif
|
|
return (FALSE);
|
|
}
|
|
nodesize = c * elsize;
|
|
|
|
/*
|
|
* if we are deserializing, we may need to allocate an array.
|
|
* We also save time by checking for a null array if we are freeing.
|
|
*/
|
|
if (target == NULL)
|
|
switch (xdrs->x_op) {
|
|
case XDR_DECODE:
|
|
if (c == 0)
|
|
return (TRUE);
|
|
*addrp = target = mem_alloc(nodesize);
|
|
#ifndef KERNEL
|
|
if (target == NULL) {
|
|
(void) syslog(LOG_ERR,
|
|
"xdr_array: out of memory");
|
|
return (FALSE);
|
|
}
|
|
#endif
|
|
bzero(target, nodesize);
|
|
break;
|
|
|
|
case XDR_FREE:
|
|
return (TRUE);
|
|
}
|
|
|
|
/*
|
|
* now we xdr each element of array
|
|
*/
|
|
for (i = 0; (i < c) && stat; i++) {
|
|
stat = (*elproc)(xdrs, target, LASTUNSIGNED);
|
|
target += elsize;
|
|
}
|
|
|
|
/*
|
|
* the array may need freeing
|
|
*/
|
|
if (xdrs->x_op == XDR_FREE) {
|
|
mem_free(*addrp, nodesize);
|
|
*addrp = NULL;
|
|
}
|
|
return (stat);
|
|
}
|
|
|
|
#ifndef KERNEL
|
|
/*
|
|
* xdr_vector():
|
|
*
|
|
* XDR a fixed length array. Unlike variable-length arrays,
|
|
* the storage of fixed length arrays is static and unfreeable.
|
|
* > basep: base of the array
|
|
* > size: size of the array
|
|
* > elemsize: size of each element
|
|
* > xdr_elem: routine to XDR each element
|
|
*/
|
|
bool_t
|
|
xdr_vector(xdrs, basep, nelem, elemsize, xdr_elem)
|
|
register XDR *xdrs;
|
|
register char *basep;
|
|
register u_int nelem;
|
|
register u_int elemsize;
|
|
register xdrproc_t xdr_elem;
|
|
{
|
|
register u_int i;
|
|
register char *elptr;
|
|
|
|
elptr = basep;
|
|
for (i = 0; i < nelem; i++) {
|
|
if (! (*xdr_elem)(xdrs, elptr, LASTUNSIGNED)) {
|
|
return (FALSE);
|
|
}
|
|
elptr += elemsize;
|
|
}
|
|
return (TRUE);
|
|
}
|
|
#endif /* !KERNEL */
|