xdr_array.c 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180
  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 0
  31. static char sccsid[] = "@(#)xdr_array.c 1.10 87/08/11 Copyr 1984 Sun Micro";
  32. #endif
  33. /*
  34. * xdr_array.c, Generic XDR routines implementation.
  35. *
  36. * Copyright (C) 1984, Sun Microsystems, Inc.
  37. *
  38. * These are the "non-trivial" xdr primitives used to serialize and de-serialize
  39. * arrays. See xdr.h for more info on the interface to xdr.
  40. */
  41. #define __FORCE_GLIBC
  42. #include <features.h>
  43. #include <stdio.h>
  44. #include <string.h>
  45. #include <rpc/types.h>
  46. #include <rpc/xdr.h>
  47. #include <limits.h>
  48. #ifdef USE_IN_LIBIO
  49. # include <wchar.h>
  50. libc_hidden_proto(fwprintf)
  51. #endif
  52. libc_hidden_proto(memset)
  53. libc_hidden_proto(fputs)
  54. libc_hidden_proto(xdr_u_int)
  55. #define LASTUNSIGNED ((u_int)0-1)
  56. /*
  57. * XDR an array of arbitrary elements
  58. * *addrp is a pointer to the array, *sizep is the number of elements.
  59. * If addrp is NULL (*sizep * elsize) bytes are allocated.
  60. * elsize is the size (in bytes) of each element, and elproc is the
  61. * xdr procedure to call to handle each element of the array.
  62. */
  63. libc_hidden_proto(xdr_array)
  64. bool_t
  65. xdr_array (XDR *xdrs, caddr_t *addrp, u_int *sizep, u_int maxsize, u_int elsize, xdrproc_t elproc)
  66. {
  67. u_int i;
  68. caddr_t target = *addrp;
  69. u_int c; /* the actual element count */
  70. bool_t stat = TRUE;
  71. u_int nodesize;
  72. /* like strings, arrays are really counted arrays */
  73. if (!xdr_u_int (xdrs, sizep))
  74. {
  75. return FALSE;
  76. }
  77. c = *sizep;
  78. /*
  79. * XXX: Let the overflow possibly happen with XDR_FREE because mem_free()
  80. * doesn't actually use its second argument anyway.
  81. */
  82. if ((c > maxsize || c > UINT_MAX / elsize) && (xdrs->x_op != XDR_FREE))
  83. {
  84. return FALSE;
  85. }
  86. nodesize = c * elsize;
  87. /*
  88. * if we are deserializing, we may need to allocate an array.
  89. * We also save time by checking for a null array if we are freeing.
  90. */
  91. if (target == NULL)
  92. switch (xdrs->x_op)
  93. {
  94. case XDR_DECODE:
  95. if (c == 0)
  96. return TRUE;
  97. *addrp = target = mem_alloc (nodesize);
  98. if (target == NULL)
  99. {
  100. #ifdef USE_IN_LIBIO
  101. if (_IO_fwide (stderr, 0) > 0)
  102. (void) fwprintf (stderr, L"%s",
  103. _("xdr_array: out of memory\n"));
  104. else
  105. #endif
  106. (void) fputs (_("xdr_array: out of memory\n"), stderr);
  107. return FALSE;
  108. }
  109. memset (target, 0, nodesize);
  110. break;
  111. case XDR_FREE:
  112. return TRUE;
  113. default:
  114. break;
  115. }
  116. /*
  117. * now we xdr each element of array
  118. */
  119. for (i = 0; (i < c) && stat; i++)
  120. {
  121. stat = (*elproc) (xdrs, target, LASTUNSIGNED);
  122. target += elsize;
  123. }
  124. /*
  125. * the array may need freeing
  126. */
  127. if (xdrs->x_op == XDR_FREE)
  128. {
  129. mem_free (*addrp, nodesize);
  130. *addrp = NULL;
  131. }
  132. return stat;
  133. }
  134. libc_hidden_def(xdr_array)
  135. /*
  136. * xdr_vector():
  137. *
  138. * XDR a fixed length array. Unlike variable-length arrays,
  139. * the storage of fixed length arrays is static and unfreeable.
  140. * > basep: base of the array
  141. * > size: size of the array
  142. * > elemsize: size of each element
  143. * > xdr_elem: routine to XDR each element
  144. */
  145. bool_t
  146. xdr_vector (xdrs, basep, nelem, elemsize, xdr_elem)
  147. XDR *xdrs;
  148. char *basep;
  149. u_int nelem;
  150. u_int elemsize;
  151. xdrproc_t xdr_elem;
  152. {
  153. u_int i;
  154. char *elptr;
  155. elptr = basep;
  156. for (i = 0; i < nelem; i++)
  157. {
  158. if (!(*xdr_elem) (xdrs, elptr, LASTUNSIGNED))
  159. {
  160. return FALSE;
  161. }
  162. elptr += elemsize;
  163. }
  164. return TRUE;
  165. }