2 * Copyright (c) 2005 Doug Rabson
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 #include <gssapi/gssapi.h>
31 #include "mech_switch.h"
35 gss_compare_name(OM_uint32 *minor_status,
36 const gss_name_t name1_arg,
37 const gss_name_t name2_arg,
40 struct _gss_name *name1 = (struct _gss_name *) name1_arg;
41 struct _gss_name *name2 = (struct _gss_name *) name2_arg;
44 * First check the implementation-independant name if both
45 * names have one. Otherwise, try to find common mechanism
46 * names and compare them.
48 if (name1->gn_value.value && name2->gn_value.value) {
50 if (!_gss_oid_equal(name1->gn_type, name2->gn_type)) {
52 } else if (name1->gn_value.length != name2->gn_value.length ||
53 memcmp(name1->gn_value.value, name1->gn_value.value,
54 name1->gn_value.length)) {
58 struct _gss_mechanism_name *mn1;
59 struct _gss_mechanism_name *mn2;
61 SLIST_FOREACH(mn1, &name1->gn_mn, gmn_link) {
62 mn2 = _gss_find_mn(name2, mn1->gmn_mech_oid);
64 return (mn1->gmn_mech->gm_compare_name(
75 return (GSS_S_COMPLETE);