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
26 * $FreeBSD: src/lib/libgssapi/gss_compare_name.c,v 1.1 2005/12/29 14:40:20 dfr Exp $
29 #include "mech_locl.h"
31 OM_uint32 GSSAPI_LIB_FUNCTION
32 gss_compare_name(OM_uint32
*minor_status
,
33 const gss_name_t name1_arg
,
34 const gss_name_t name2_arg
,
37 struct _gss_name
*name1
= (struct _gss_name
*) name1_arg
;
38 struct _gss_name
*name2
= (struct _gss_name
*) name2_arg
;
41 * First check the implementation-independant name if both
42 * names have one. Otherwise, try to find common mechanism
43 * names and compare them.
45 if (name1
->gn_value
.value
&& name2
->gn_value
.value
) {
47 if (!gss_oid_equal(&name1
->gn_type
, &name2
->gn_type
)) {
49 } else if (name1
->gn_value
.length
!= name2
->gn_value
.length
||
50 memcmp(name1
->gn_value
.value
, name1
->gn_value
.value
,
51 name1
->gn_value
.length
)) {
55 struct _gss_mechanism_name
*mn1
;
56 struct _gss_mechanism_name
*mn2
;
58 SLIST_FOREACH(mn1
, &name1
->gn_mn
, gmn_link
) {
59 OM_uint32 major_status
;
61 major_status
= _gss_find_mn(minor_status
, name2
,
62 mn1
->gmn_mech_oid
, &mn2
);
63 if (major_status
== GSS_S_COMPLETE
) {
64 return (mn1
->gmn_mech
->gm_compare_name(
75 return (GSS_S_COMPLETE
);