gssd_prot.c 5.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251
  1. /*-
  2. * SPDX-License-Identifier: BSD-2-Clause
  3. *
  4. * Copyright (c) 2008 Isilon Inc http://www.isilon.com/
  5. * Authors: Doug Rabson <dfr@rabson.org>
  6. * Developed with Red Inc: Alfred Perlstein <alfred@freebsd.org>
  7. *
  8. * Redistribution and use in source and binary forms, with or without
  9. * modification, are permitted provided that the following conditions
  10. * are met:
  11. * 1. Redistributions of source code must retain the above copyright
  12. * notice, this list of conditions and the following disclaimer.
  13. * 2. Redistributions in binary form must reproduce the above copyright
  14. * notice, this list of conditions and the following disclaimer in the
  15. * documentation and/or other materials provided with the distribution.
  16. *
  17. * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
  18. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  19. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  20. * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  21. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  22. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  23. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  24. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  25. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  26. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  27. * SUCH DAMAGE.
  28. */
  29. #include <sys/cdefs.h>
  30. #ifdef _KERNEL
  31. #include <sys/malloc.h>
  32. #else
  33. #include <stdlib.h>
  34. #include <string.h>
  35. #endif
  36. #include <rpc/rpc.h>
  37. #include <rpc/rpc_com.h>
  38. #include "gssd.h"
  39. bool_t
  40. xdr_gss_buffer_desc(XDR *xdrs, gss_buffer_desc *buf)
  41. {
  42. char *val;
  43. u_int len;
  44. len = buf->length;
  45. val = buf->value;
  46. if (!xdr_bytes(xdrs, &val, &len, ~0))
  47. return (FALSE);
  48. buf->length = len;
  49. buf->value = val;
  50. return (TRUE);
  51. }
  52. bool_t
  53. xdr_gss_OID_desc(XDR *xdrs, gss_OID_desc *oid)
  54. {
  55. char *val;
  56. u_int len;
  57. len = oid->length;
  58. val = oid->elements;
  59. if (!xdr_bytes(xdrs, &val, &len, ~0))
  60. return (FALSE);
  61. oid->length = len;
  62. oid->elements = val;
  63. return (TRUE);
  64. }
  65. bool_t
  66. xdr_gss_OID(XDR *xdrs, gss_OID *oidp)
  67. {
  68. gss_OID oid;
  69. bool_t is_null;
  70. switch (xdrs->x_op) {
  71. case XDR_ENCODE:
  72. oid = *oidp;
  73. if (oid) {
  74. is_null = FALSE;
  75. if (!xdr_bool(xdrs, &is_null)
  76. || !xdr_gss_OID_desc(xdrs, oid))
  77. return (FALSE);
  78. } else {
  79. is_null = TRUE;
  80. if (!xdr_bool(xdrs, &is_null))
  81. return (FALSE);
  82. }
  83. break;
  84. case XDR_DECODE:
  85. if (!xdr_bool(xdrs, &is_null))
  86. return (FALSE);
  87. if (is_null) {
  88. *oidp = GSS_C_NO_OID;
  89. } else {
  90. oid = mem_alloc(sizeof(gss_OID_desc));
  91. memset(oid, 0, sizeof(*oid));
  92. if (!xdr_gss_OID_desc(xdrs, oid)) {
  93. mem_free(oid, sizeof(gss_OID_desc));
  94. return (FALSE);
  95. }
  96. *oidp = oid;
  97. }
  98. break;
  99. case XDR_FREE:
  100. oid = *oidp;
  101. if (oid) {
  102. xdr_gss_OID_desc(xdrs, oid);
  103. mem_free(oid, sizeof(gss_OID_desc));
  104. }
  105. }
  106. return (TRUE);
  107. }
  108. bool_t
  109. xdr_gss_OID_set_desc(XDR *xdrs, gss_OID_set_desc *set)
  110. {
  111. caddr_t addr;
  112. u_int len;
  113. len = set->count;
  114. addr = (caddr_t) set->elements;
  115. if (!xdr_array(xdrs, &addr, &len, ~0, sizeof(gss_OID_desc),
  116. (xdrproc_t) xdr_gss_OID_desc))
  117. return (FALSE);
  118. set->count = len;
  119. set->elements = (gss_OID) addr;
  120. return (TRUE);
  121. }
  122. bool_t
  123. xdr_gss_OID_set(XDR *xdrs, gss_OID_set *setp)
  124. {
  125. gss_OID_set set;
  126. bool_t is_null;
  127. switch (xdrs->x_op) {
  128. case XDR_ENCODE:
  129. set = *setp;
  130. if (set) {
  131. is_null = FALSE;
  132. if (!xdr_bool(xdrs, &is_null)
  133. || !xdr_gss_OID_set_desc(xdrs, set))
  134. return (FALSE);
  135. } else {
  136. is_null = TRUE;
  137. if (!xdr_bool(xdrs, &is_null))
  138. return (FALSE);
  139. }
  140. break;
  141. case XDR_DECODE:
  142. if (!xdr_bool(xdrs, &is_null))
  143. return (FALSE);
  144. if (is_null) {
  145. *setp = GSS_C_NO_OID_SET;
  146. } else {
  147. set = mem_alloc(sizeof(gss_OID_set_desc));
  148. memset(set, 0, sizeof(*set));
  149. if (!xdr_gss_OID_set_desc(xdrs, set)) {
  150. mem_free(set, sizeof(gss_OID_set_desc));
  151. return (FALSE);
  152. }
  153. *setp = set;
  154. }
  155. break;
  156. case XDR_FREE:
  157. set = *setp;
  158. if (set) {
  159. xdr_gss_OID_set_desc(xdrs, set);
  160. mem_free(set, sizeof(gss_OID_set_desc));
  161. }
  162. }
  163. return (TRUE);
  164. }
  165. bool_t
  166. xdr_gss_channel_bindings_t(XDR *xdrs, gss_channel_bindings_t *chp)
  167. {
  168. gss_channel_bindings_t ch;
  169. bool_t is_null;
  170. switch (xdrs->x_op) {
  171. case XDR_ENCODE:
  172. ch = *chp;
  173. if (ch) {
  174. is_null = FALSE;
  175. if (!xdr_bool(xdrs, &is_null)
  176. || !xdr_uint32_t(xdrs, &ch->initiator_addrtype)
  177. || !xdr_gss_buffer_desc(xdrs,
  178. &ch->initiator_address)
  179. || !xdr_uint32_t(xdrs, &ch->acceptor_addrtype)
  180. || !xdr_gss_buffer_desc(xdrs,
  181. &ch->acceptor_address)
  182. || !xdr_gss_buffer_desc(xdrs,
  183. &ch->application_data))
  184. return (FALSE);
  185. } else {
  186. is_null = TRUE;
  187. if (!xdr_bool(xdrs, &is_null))
  188. return (FALSE);
  189. }
  190. break;
  191. case XDR_DECODE:
  192. if (!xdr_bool(xdrs, &is_null))
  193. return (FALSE);
  194. if (is_null) {
  195. *chp = GSS_C_NO_CHANNEL_BINDINGS;
  196. } else {
  197. ch = mem_alloc(sizeof(*ch));
  198. memset(ch, 0, sizeof(*ch));
  199. if (!xdr_uint32_t(xdrs, &ch->initiator_addrtype)
  200. || !xdr_gss_buffer_desc(xdrs,
  201. &ch->initiator_address)
  202. || !xdr_uint32_t(xdrs, &ch->acceptor_addrtype)
  203. || !xdr_gss_buffer_desc(xdrs,
  204. &ch->acceptor_address)
  205. || !xdr_gss_buffer_desc(xdrs,
  206. &ch->application_data)) {
  207. mem_free(ch, sizeof(*ch));
  208. return (FALSE);
  209. }
  210. *chp = ch;
  211. }
  212. break;
  213. case XDR_FREE:
  214. ch = *chp;
  215. if (ch) {
  216. xdr_gss_buffer_desc(xdrs, &ch->initiator_address);
  217. xdr_gss_buffer_desc(xdrs, &ch->acceptor_address);
  218. xdr_gss_buffer_desc(xdrs, &ch->application_data);
  219. mem_free(ch, sizeof(*ch));
  220. }
  221. }
  222. return (TRUE);
  223. }