gss_get_mic.c 2.7 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788
  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/param.h>
  30. #include <sys/kernel.h>
  31. #include <sys/kobj.h>
  32. #include <sys/malloc.h>
  33. #include <sys/mbuf.h>
  34. #include <kgssapi/gssapi.h>
  35. #include <kgssapi/gssapi_impl.h>
  36. #include "kgss_if.h"
  37. OM_uint32
  38. gss_get_mic(OM_uint32 *minor_status,
  39. const gss_ctx_id_t ctx,
  40. gss_qop_t qop_req,
  41. const gss_buffer_t message_buffer,
  42. gss_buffer_t message_token)
  43. {
  44. OM_uint32 maj_stat;
  45. struct mbuf *m, *mic;
  46. if (!ctx) {
  47. *minor_status = 0;
  48. return (GSS_S_NO_CONTEXT);
  49. }
  50. MGET(m, M_WAITOK, MT_DATA);
  51. if (message_buffer->length > MLEN)
  52. MCLGET(m, M_WAITOK);
  53. m_append(m, message_buffer->length, message_buffer->value);
  54. maj_stat = KGSS_GET_MIC(ctx, minor_status, qop_req, m, &mic);
  55. m_freem(m);
  56. if (maj_stat == GSS_S_COMPLETE) {
  57. message_token->length = m_length(mic, NULL);
  58. message_token->value = malloc(message_token->length,
  59. M_GSSAPI, M_WAITOK);
  60. m_copydata(mic, 0, message_token->length,
  61. message_token->value);
  62. m_freem(mic);
  63. }
  64. return (maj_stat);
  65. }
  66. OM_uint32
  67. gss_get_mic_mbuf(OM_uint32 *minor_status, const gss_ctx_id_t ctx,
  68. gss_qop_t qop_req, struct mbuf *m, struct mbuf **micp)
  69. {
  70. if (!ctx) {
  71. *minor_status = 0;
  72. return (GSS_S_NO_CONTEXT);
  73. }
  74. return (KGSS_GET_MIC(ctx, minor_status, qop_req, m, micp));
  75. }