1*0Sstevel@tonic-gate /* 2*0Sstevel@tonic-gate * CDDL HEADER START 3*0Sstevel@tonic-gate * 4*0Sstevel@tonic-gate * The contents of this file are subject to the terms of the 5*0Sstevel@tonic-gate * Common Development and Distribution License, Version 1.0 only 6*0Sstevel@tonic-gate * (the "License"). You may not use this file except in compliance 7*0Sstevel@tonic-gate * with the License. 8*0Sstevel@tonic-gate * 9*0Sstevel@tonic-gate * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE 10*0Sstevel@tonic-gate * or http://www.opensolaris.org/os/licensing. 11*0Sstevel@tonic-gate * See the License for the specific language governing permissions 12*0Sstevel@tonic-gate * and limitations under the License. 13*0Sstevel@tonic-gate * 14*0Sstevel@tonic-gate * When distributing Covered Code, include this CDDL HEADER in each 15*0Sstevel@tonic-gate * file and include the License file at usr/src/OPENSOLARIS.LICENSE. 16*0Sstevel@tonic-gate * If applicable, add the following below this CDDL HEADER, with the 17*0Sstevel@tonic-gate * fields enclosed by brackets "[]" replaced with your own identifying 18*0Sstevel@tonic-gate * information: Portions Copyright [yyyy] [name of copyright owner] 19*0Sstevel@tonic-gate * 20*0Sstevel@tonic-gate * CDDL HEADER END 21*0Sstevel@tonic-gate */ 22*0Sstevel@tonic-gate /* 23*0Sstevel@tonic-gate * Copyright 2004 Sun Microsystems, Inc. All rights reserved. 24*0Sstevel@tonic-gate * Use is subject to license terms. 25*0Sstevel@tonic-gate */ 26*0Sstevel@tonic-gate 27*0Sstevel@tonic-gate /* Copyright (c) 1983, 1984, 1985, 1986, 1987, 1988, 1989 AT&T */ 28*0Sstevel@tonic-gate /* All Rights Reserved */ 29*0Sstevel@tonic-gate 30*0Sstevel@tonic-gate /* 31*0Sstevel@tonic-gate * Portions of this source code were derived from Berkeley 4.3 BSD 32*0Sstevel@tonic-gate * under license from the Regents of the University of California. 33*0Sstevel@tonic-gate */ 34*0Sstevel@tonic-gate 35*0Sstevel@tonic-gate #pragma ident "%Z%%M% %I% %E% SMI" 36*0Sstevel@tonic-gate 37*0Sstevel@tonic-gate /* 38*0Sstevel@tonic-gate * xdr_array.c, Generic XDR routines impelmentation. 39*0Sstevel@tonic-gate * These are the "non-trivial" xdr primitives used to serialize and de-serialize 40*0Sstevel@tonic-gate * arrays. See xdr.h for more info on the interface to xdr. 41*0Sstevel@tonic-gate */ 42*0Sstevel@tonic-gate 43*0Sstevel@tonic-gate #include <sys/param.h> 44*0Sstevel@tonic-gate #include <sys/cmn_err.h> 45*0Sstevel@tonic-gate #include <sys/types.h> 46*0Sstevel@tonic-gate #include <sys/systm.h> 47*0Sstevel@tonic-gate 48*0Sstevel@tonic-gate #include <rpc/types.h> 49*0Sstevel@tonic-gate #include <rpc/xdr.h> 50*0Sstevel@tonic-gate 51*0Sstevel@tonic-gate #define LASTUNSIGNED ((uint_t)0-1) 52*0Sstevel@tonic-gate 53*0Sstevel@tonic-gate /* 54*0Sstevel@tonic-gate * XDR an array of arbitrary elements 55*0Sstevel@tonic-gate * *addrp is a pointer to the array, *sizep is the number of elements. 56*0Sstevel@tonic-gate * If addrp is NULL (*sizep * elsize) bytes are allocated. 57*0Sstevel@tonic-gate * elsize is the size (in bytes) of each element, and elproc is the 58*0Sstevel@tonic-gate * xdr procedure to call to handle each element of the array. 59*0Sstevel@tonic-gate */ 60*0Sstevel@tonic-gate bool_t 61*0Sstevel@tonic-gate xdr_array(XDR *xdrs, caddr_t *addrp, uint_t *sizep, const uint_t maxsize, 62*0Sstevel@tonic-gate const uint_t elsize, const xdrproc_t elproc) 63*0Sstevel@tonic-gate { 64*0Sstevel@tonic-gate uint_t i; 65*0Sstevel@tonic-gate caddr_t target = *addrp; 66*0Sstevel@tonic-gate uint_t c; /* the actual element count */ 67*0Sstevel@tonic-gate bool_t stat = TRUE; 68*0Sstevel@tonic-gate uint_t nodesize; 69*0Sstevel@tonic-gate 70*0Sstevel@tonic-gate /* like strings, arrays are really counted arrays */ 71*0Sstevel@tonic-gate if (!xdr_u_int(xdrs, sizep)) { 72*0Sstevel@tonic-gate #ifdef DEBUG 73*0Sstevel@tonic-gate printf("xdr_array: size FAILED\n"); 74*0Sstevel@tonic-gate #endif 75*0Sstevel@tonic-gate return (FALSE); 76*0Sstevel@tonic-gate } 77*0Sstevel@tonic-gate c = *sizep; 78*0Sstevel@tonic-gate if ((c > maxsize || LASTUNSIGNED / elsize < c) && 79*0Sstevel@tonic-gate xdrs->x_op != XDR_FREE) { 80*0Sstevel@tonic-gate #ifdef DEBUG 81*0Sstevel@tonic-gate printf("xdr_array: bad size FAILED\n"); 82*0Sstevel@tonic-gate #endif 83*0Sstevel@tonic-gate return (FALSE); 84*0Sstevel@tonic-gate } 85*0Sstevel@tonic-gate nodesize = c * elsize; 86*0Sstevel@tonic-gate 87*0Sstevel@tonic-gate /* 88*0Sstevel@tonic-gate * if we are deserializing, we may need to allocate an array. 89*0Sstevel@tonic-gate * We also save time by checking for a null array if we are freeing. 90*0Sstevel@tonic-gate */ 91*0Sstevel@tonic-gate if (target == NULL) 92*0Sstevel@tonic-gate switch (xdrs->x_op) { 93*0Sstevel@tonic-gate case XDR_DECODE: 94*0Sstevel@tonic-gate if (c == 0) 95*0Sstevel@tonic-gate return (TRUE); 96*0Sstevel@tonic-gate *addrp = target = (char *)mem_alloc(nodesize); 97*0Sstevel@tonic-gate bzero(target, nodesize); 98*0Sstevel@tonic-gate break; 99*0Sstevel@tonic-gate 100*0Sstevel@tonic-gate case XDR_FREE: 101*0Sstevel@tonic-gate return (TRUE); 102*0Sstevel@tonic-gate 103*0Sstevel@tonic-gate case XDR_ENCODE: 104*0Sstevel@tonic-gate break; 105*0Sstevel@tonic-gate } 106*0Sstevel@tonic-gate 107*0Sstevel@tonic-gate /* 108*0Sstevel@tonic-gate * now we xdr each element of array 109*0Sstevel@tonic-gate */ 110*0Sstevel@tonic-gate for (i = 0; (i < c) && stat; i++) { 111*0Sstevel@tonic-gate stat = (*elproc)(xdrs, target, LASTUNSIGNED); 112*0Sstevel@tonic-gate target += elsize; 113*0Sstevel@tonic-gate } 114*0Sstevel@tonic-gate 115*0Sstevel@tonic-gate /* 116*0Sstevel@tonic-gate * the array may need freeing 117*0Sstevel@tonic-gate */ 118*0Sstevel@tonic-gate if (xdrs->x_op == XDR_FREE) { 119*0Sstevel@tonic-gate mem_free(*addrp, nodesize); 120*0Sstevel@tonic-gate *addrp = NULL; 121*0Sstevel@tonic-gate } 122*0Sstevel@tonic-gate return (stat); 123*0Sstevel@tonic-gate } 124