1c0b9f4feSDoug Rabson /*-
2*4d846d26SWarner Losh * SPDX-License-Identifier: BSD-2-Clause
35e53a4f9SPedro F. Giffuni *
4c0b9f4feSDoug Rabson * Copyright (c) 2005 Doug Rabson
5c0b9f4feSDoug Rabson * All rights reserved.
6c0b9f4feSDoug Rabson *
7c0b9f4feSDoug Rabson * Redistribution and use in source and binary forms, with or without
8c0b9f4feSDoug Rabson * modification, are permitted provided that the following conditions
9c0b9f4feSDoug Rabson * are met:
10c0b9f4feSDoug Rabson * 1. Redistributions of source code must retain the above copyright
11c0b9f4feSDoug Rabson * notice, this list of conditions and the following disclaimer.
12c0b9f4feSDoug Rabson * 2. Redistributions in binary form must reproduce the above copyright
13c0b9f4feSDoug Rabson * notice, this list of conditions and the following disclaimer in the
14c0b9f4feSDoug Rabson * documentation and/or other materials provided with the distribution.
15c0b9f4feSDoug Rabson *
16c0b9f4feSDoug Rabson * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17c0b9f4feSDoug Rabson * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18c0b9f4feSDoug Rabson * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19c0b9f4feSDoug Rabson * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20c0b9f4feSDoug Rabson * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21c0b9f4feSDoug Rabson * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22c0b9f4feSDoug Rabson * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23c0b9f4feSDoug Rabson * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24c0b9f4feSDoug Rabson * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25c0b9f4feSDoug Rabson * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26c0b9f4feSDoug Rabson * SUCH DAMAGE.
27c0b9f4feSDoug Rabson */
28c0b9f4feSDoug Rabson
29c0b9f4feSDoug Rabson #include <gssapi/gssapi.h>
30c0b9f4feSDoug Rabson #include <stdlib.h>
3184da49ceSAlexander Kabaev #include <string.h>
32c0b9f4feSDoug Rabson #include <errno.h>
33c0b9f4feSDoug Rabson
34c0b9f4feSDoug Rabson #include "utils.h"
35c0b9f4feSDoug Rabson
36c0b9f4feSDoug Rabson int
gss_oid_equal(const gss_OID oid1,const gss_OID oid2)3733f12199SDoug Rabson gss_oid_equal(const gss_OID oid1, const gss_OID oid2)
38c0b9f4feSDoug Rabson {
39733704eaSDoug Rabson
40733704eaSDoug Rabson if (oid1 == oid2)
41733704eaSDoug Rabson return (1);
42733704eaSDoug Rabson if (!oid1 || !oid2)
43733704eaSDoug Rabson return (0);
44c0b9f4feSDoug Rabson if (oid1->length != oid2->length)
45c0b9f4feSDoug Rabson return (0);
46c0b9f4feSDoug Rabson if (memcmp(oid1->elements, oid2->elements, oid1->length))
47c0b9f4feSDoug Rabson return (0);
48c0b9f4feSDoug Rabson return (1);
49c0b9f4feSDoug Rabson }
50c0b9f4feSDoug Rabson
51c0b9f4feSDoug Rabson OM_uint32
_gss_copy_oid(OM_uint32 * minor_status,const gss_OID from_oid,gss_OID to_oid)52c0b9f4feSDoug Rabson _gss_copy_oid(OM_uint32 *minor_status,
53c0b9f4feSDoug Rabson const gss_OID from_oid, gss_OID to_oid)
54c0b9f4feSDoug Rabson {
55c0b9f4feSDoug Rabson size_t len = from_oid->length;
56c0b9f4feSDoug Rabson
57c0b9f4feSDoug Rabson *minor_status = 0;
58c0b9f4feSDoug Rabson to_oid->elements = malloc(len);
59c0b9f4feSDoug Rabson if (!to_oid->elements) {
6033f12199SDoug Rabson to_oid->length = 0;
61c0b9f4feSDoug Rabson *minor_status = ENOMEM;
62c0b9f4feSDoug Rabson return GSS_S_FAILURE;
63c0b9f4feSDoug Rabson }
64c0b9f4feSDoug Rabson to_oid->length = len;
65c0b9f4feSDoug Rabson memcpy(to_oid->elements, from_oid->elements, len);
66c0b9f4feSDoug Rabson return (GSS_S_COMPLETE);
67c0b9f4feSDoug Rabson }
68c0b9f4feSDoug Rabson
698f55a568SDoug Rabson OM_uint32
_gss_free_oid(OM_uint32 * minor_status,gss_OID oid)708f55a568SDoug Rabson _gss_free_oid(OM_uint32 *minor_status, gss_OID oid)
718f55a568SDoug Rabson {
728f55a568SDoug Rabson
738f55a568SDoug Rabson *minor_status = 0;
748f55a568SDoug Rabson if (oid->elements) {
758f55a568SDoug Rabson free(oid->elements);
768f55a568SDoug Rabson oid->elements = NULL;
778f55a568SDoug Rabson oid->length = 0;
788f55a568SDoug Rabson }
798f55a568SDoug Rabson return (GSS_S_COMPLETE);
808f55a568SDoug Rabson }
81c0b9f4feSDoug Rabson
82c0b9f4feSDoug Rabson OM_uint32
_gss_copy_buffer(OM_uint32 * minor_status,const gss_buffer_t from_buf,gss_buffer_t to_buf)83c0b9f4feSDoug Rabson _gss_copy_buffer(OM_uint32 *minor_status,
84c0b9f4feSDoug Rabson const gss_buffer_t from_buf, gss_buffer_t to_buf)
85c0b9f4feSDoug Rabson {
86c0b9f4feSDoug Rabson size_t len = from_buf->length;
87c0b9f4feSDoug Rabson
88c0b9f4feSDoug Rabson *minor_status = 0;
89c0b9f4feSDoug Rabson to_buf->value = malloc(len);
90c0b9f4feSDoug Rabson if (!to_buf->value) {
91c0b9f4feSDoug Rabson *minor_status = ENOMEM;
9233f12199SDoug Rabson to_buf->length = 0;
93c0b9f4feSDoug Rabson return GSS_S_FAILURE;
94c0b9f4feSDoug Rabson }
95c0b9f4feSDoug Rabson to_buf->length = len;
96c0b9f4feSDoug Rabson memcpy(to_buf->value, from_buf->value, len);
97c0b9f4feSDoug Rabson return (GSS_S_COMPLETE);
98c0b9f4feSDoug Rabson }
99c0b9f4feSDoug Rabson
100