1/*-
2 * SPDX-License-Identifier: BSD-2-Clause
3 *
4 * Copyright (c) 2005 Doug Rabson
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 *    notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 *    notice, this list of conditions and the following disclaimer in the
14 *    documentation and/or other materials provided with the distribution.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26 * SUCH DAMAGE.
27 */
28
29#include <gssapi/gssapi.h>
30#include <string.h>
31
32#include "mech_switch.h"
33#include "name.h"
34#include "utils.h"
35
36OM_uint32
37gss_compare_name(OM_uint32 *minor_status,
38    const gss_name_t name1_arg,
39    const gss_name_t name2_arg,
40    int *name_equal)
41{
42	struct _gss_name *name1 = (struct _gss_name *) name1_arg;
43	struct _gss_name *name2 = (struct _gss_name *) name2_arg;
44
45	/*
46	 * First check the implementation-independent name if both
47	 * names have one. Otherwise, try to find common mechanism
48	 * names and compare them.
49	 */
50	if (name1->gn_value.value && name2->gn_value.value) {
51		*name_equal = 1;
52		if (!gss_oid_equal(&name1->gn_type, &name2->gn_type)) {
53			*name_equal = 0;
54		} else if (name1->gn_value.length != name2->gn_value.length ||
55		    memcmp(name1->gn_value.value, name1->gn_value.value,
56			name1->gn_value.length)) {
57			*name_equal = 0;
58		}
59	} else {
60		struct _gss_mechanism_name *mn1;
61		struct _gss_mechanism_name *mn2;
62
63		SLIST_FOREACH(mn1, &name1->gn_mn, gmn_link) {
64			OM_uint32 major_status;
65
66			major_status = _gss_find_mn(minor_status, name2,
67						    mn1->gmn_mech_oid, &mn2);
68			if (major_status == GSS_S_COMPLETE) {
69				return (mn1->gmn_mech->gm_compare_name(
70						minor_status,
71						mn1->gmn_name,
72						mn2->gmn_name,
73						name_equal));
74			}
75		}
76		*name_equal = 0;
77	}
78
79	*minor_status = 0;
80	return (GSS_S_COMPLETE);
81}
82