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