18360efbdSAlfred Perlstein /* $NetBSD: xdr_array.c,v 1.12 2000/01/22 22:19:18 mycroft Exp $ */ 28360efbdSAlfred Perlstein 3a204967aSHiroki Sato /*- 4a204967aSHiroki Sato * Copyright (c) 2010, Oracle America, Inc. 5eae561b3SGarrett Wollman * 6a204967aSHiroki Sato * Redistribution and use in source and binary forms, with or without 7a204967aSHiroki Sato * modification, are permitted provided that the following conditions are 8a204967aSHiroki Sato * met: 9eae561b3SGarrett Wollman * 10a204967aSHiroki Sato * * Redistributions of source code must retain the above copyright 11a204967aSHiroki Sato * notice, this list of conditions and the following disclaimer. 12a204967aSHiroki Sato * * Redistributions in binary form must reproduce the above 13a204967aSHiroki Sato * copyright notice, this list of conditions and the following 14a204967aSHiroki Sato * disclaimer in the documentation and/or other materials 15a204967aSHiroki Sato * provided with the distribution. 16a204967aSHiroki Sato * * Neither the name of the "Oracle America, Inc." nor the names of its 17a204967aSHiroki Sato * contributors may be used to endorse or promote products derived 18a204967aSHiroki Sato * from this software without specific prior written permission. 19eae561b3SGarrett Wollman * 20a204967aSHiroki Sato * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 21a204967aSHiroki Sato * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 22a204967aSHiroki Sato * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 23a204967aSHiroki Sato * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 24a204967aSHiroki Sato * COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, 25a204967aSHiroki Sato * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26a204967aSHiroki Sato * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE 27a204967aSHiroki Sato * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 28a204967aSHiroki Sato * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, 29a204967aSHiroki Sato * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 30a204967aSHiroki Sato * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 31a204967aSHiroki Sato * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 32eae561b3SGarrett Wollman */ 33eae561b3SGarrett Wollman 34eae561b3SGarrett Wollman #if defined(LIBC_SCCS) && !defined(lint) 35a9bdcd37SDavid E. O'Brien static char *sccsid2 = "@(#)xdr_array.c 1.10 87/08/11 Copyr 1984 Sun Micro"; 36333fc21eSDavid E. O'Brien static char *sccsid = "@(#)xdr_array.c 2.1 88/07/29 4.0 RPCSRC"; 37eae561b3SGarrett Wollman #endif 38333fc21eSDavid E. O'Brien #include <sys/cdefs.h> 39333fc21eSDavid E. O'Brien __FBSDID("$FreeBSD$"); 40eae561b3SGarrett Wollman 41eae561b3SGarrett Wollman /* 42eae561b3SGarrett Wollman * xdr_array.c, Generic XDR routines impelmentation. 43eae561b3SGarrett Wollman * 44eae561b3SGarrett Wollman * These are the "non-trivial" xdr primitives used to serialize and de-serialize 45eae561b3SGarrett Wollman * arrays. See xdr.h for more info on the interface to xdr. 46eae561b3SGarrett Wollman */ 47eae561b3SGarrett Wollman 488360efbdSAlfred Perlstein #include "namespace.h" 498360efbdSAlfred Perlstein #include <err.h> 50b113cd80SJacques Vidrine #include <limits.h> 51eae561b3SGarrett Wollman #include <stdio.h> 52eae561b3SGarrett Wollman #include <stdlib.h> 5329285d6cSPoul-Henning Kamp #include <string.h> 548360efbdSAlfred Perlstein 55eae561b3SGarrett Wollman #include <rpc/types.h> 56eae561b3SGarrett Wollman #include <rpc/xdr.h> 578360efbdSAlfred Perlstein #include "un-namespace.h" 58eae561b3SGarrett Wollman 59eae561b3SGarrett Wollman /* 60eae561b3SGarrett Wollman * XDR an array of arbitrary elements 61eae561b3SGarrett Wollman * *addrp is a pointer to the array, *sizep is the number of elements. 62eae561b3SGarrett Wollman * If addrp is NULL (*sizep * elsize) bytes are allocated. 63eae561b3SGarrett Wollman * elsize is the size (in bytes) of each element, and elproc is the 64eae561b3SGarrett Wollman * xdr procedure to call to handle each element of the array. 65eae561b3SGarrett Wollman */ 66eae561b3SGarrett Wollman bool_t 67*d660d38dSCraig Rodrigues xdr_array(XDR *xdrs, caddr_t *addrp, u_int *sizep, u_int maxsize, u_int elsize, xdrproc_t elproc) 68*d660d38dSCraig Rodrigues /* 69*d660d38dSCraig Rodrigues * XDR *xdrs; 70*d660d38dSCraig Rodrigues * caddr_t *addrp; // array pointer 71*d660d38dSCraig Rodrigues * u_int *sizep; // number of elements 72*d660d38dSCraig Rodrigues * u_int maxsize; // max numberof elements 73*d660d38dSCraig Rodrigues * u_int elsize; // size in bytes of each element 74*d660d38dSCraig Rodrigues * xdrproc_t elproc; // xdr routine to handle each element 75*d660d38dSCraig Rodrigues */ 76eae561b3SGarrett Wollman { 778360efbdSAlfred Perlstein u_int i; 788360efbdSAlfred Perlstein caddr_t target = *addrp; 798360efbdSAlfred Perlstein u_int c; /* the actual element count */ 808360efbdSAlfred Perlstein bool_t stat = TRUE; 818360efbdSAlfred Perlstein u_int nodesize; 82eae561b3SGarrett Wollman 83eae561b3SGarrett Wollman /* like strings, arrays are really counted arrays */ 84eae561b3SGarrett Wollman if (!xdr_u_int(xdrs, sizep)) { 85eae561b3SGarrett Wollman return (FALSE); 86eae561b3SGarrett Wollman } 87eae561b3SGarrett Wollman c = *sizep; 888f3e3652SJacques Vidrine if ((c > maxsize || UINT_MAX/elsize < c) && 897fc37b7cSDarren Reed (xdrs->x_op != XDR_FREE)) { 90eae561b3SGarrett Wollman return (FALSE); 91eae561b3SGarrett Wollman } 92eae561b3SGarrett Wollman nodesize = c * elsize; 93eae561b3SGarrett Wollman 94eae561b3SGarrett Wollman /* 95eae561b3SGarrett Wollman * if we are deserializing, we may need to allocate an array. 96eae561b3SGarrett Wollman * We also save time by checking for a null array if we are freeing. 97eae561b3SGarrett Wollman */ 98eae561b3SGarrett Wollman if (target == NULL) 99eae561b3SGarrett Wollman switch (xdrs->x_op) { 100eae561b3SGarrett Wollman case XDR_DECODE: 101eae561b3SGarrett Wollman if (c == 0) 102eae561b3SGarrett Wollman return (TRUE); 103eae561b3SGarrett Wollman *addrp = target = mem_alloc(nodesize); 104eae561b3SGarrett Wollman if (target == NULL) { 1058360efbdSAlfred Perlstein warnx("xdr_array: out of memory"); 106eae561b3SGarrett Wollman return (FALSE); 107eae561b3SGarrett Wollman } 1081ad08a09SPeter Wemm memset(target, 0, nodesize); 109eae561b3SGarrett Wollman break; 110eae561b3SGarrett Wollman 111eae561b3SGarrett Wollman case XDR_FREE: 112eae561b3SGarrett Wollman return (TRUE); 1138360efbdSAlfred Perlstein 1148360efbdSAlfred Perlstein case XDR_ENCODE: 1158360efbdSAlfred Perlstein break; 116eae561b3SGarrett Wollman } 117eae561b3SGarrett Wollman 118eae561b3SGarrett Wollman /* 119eae561b3SGarrett Wollman * now we xdr each element of array 120eae561b3SGarrett Wollman */ 121eae561b3SGarrett Wollman for (i = 0; (i < c) && stat; i++) { 1228360efbdSAlfred Perlstein stat = (*elproc)(xdrs, target); 123eae561b3SGarrett Wollman target += elsize; 124eae561b3SGarrett Wollman } 125eae561b3SGarrett Wollman 126eae561b3SGarrett Wollman /* 127eae561b3SGarrett Wollman * the array may need freeing 128eae561b3SGarrett Wollman */ 129eae561b3SGarrett Wollman if (xdrs->x_op == XDR_FREE) { 130eae561b3SGarrett Wollman mem_free(*addrp, nodesize); 131eae561b3SGarrett Wollman *addrp = NULL; 132eae561b3SGarrett Wollman } 133eae561b3SGarrett Wollman return (stat); 134eae561b3SGarrett Wollman } 135eae561b3SGarrett Wollman 136eae561b3SGarrett Wollman /* 137eae561b3SGarrett Wollman * xdr_vector(): 138eae561b3SGarrett Wollman * 139eae561b3SGarrett Wollman * XDR a fixed length array. Unlike variable-length arrays, 140eae561b3SGarrett Wollman * the storage of fixed length arrays is static and unfreeable. 141eae561b3SGarrett Wollman * > basep: base of the array 142eae561b3SGarrett Wollman * > size: size of the array 143eae561b3SGarrett Wollman * > elemsize: size of each element 144eae561b3SGarrett Wollman * > xdr_elem: routine to XDR each element 145eae561b3SGarrett Wollman */ 146eae561b3SGarrett Wollman bool_t 147*d660d38dSCraig Rodrigues xdr_vector(XDR *xdrs, char *basep, u_int nelem, u_int elemsize, xdrproc_t xdr_elem) 148eae561b3SGarrett Wollman { 1498360efbdSAlfred Perlstein u_int i; 1508360efbdSAlfred Perlstein char *elptr; 151eae561b3SGarrett Wollman 152eae561b3SGarrett Wollman elptr = basep; 153eae561b3SGarrett Wollman for (i = 0; i < nelem; i++) { 1548360efbdSAlfred Perlstein if (!(*xdr_elem)(xdrs, elptr)) { 155eae561b3SGarrett Wollman return(FALSE); 156eae561b3SGarrett Wollman } 157eae561b3SGarrett Wollman elptr += elemsize; 158eae561b3SGarrett Wollman } 159eae561b3SGarrett Wollman return(TRUE); 160eae561b3SGarrett Wollman } 161