1226031Sstas/*-
2226031Sstas * Copyright (c) 2005 Doug Rabson
3226031Sstas * All rights reserved.
4226031Sstas *
5226031Sstas * Redistribution and use in source and binary forms, with or without
6226031Sstas * modification, are permitted provided that the following conditions
7226031Sstas * are met:
8226031Sstas * 1. Redistributions of source code must retain the above copyright
9226031Sstas *    notice, this list of conditions and the following disclaimer.
10226031Sstas * 2. Redistributions in binary form must reproduce the above copyright
11226031Sstas *    notice, this list of conditions and the following disclaimer in the
12226031Sstas *    documentation and/or other materials provided with the distribution.
13226031Sstas *
14226031Sstas * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15226031Sstas * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16226031Sstas * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17226031Sstas * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18226031Sstas * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19226031Sstas * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20226031Sstas * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21226031Sstas * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22226031Sstas * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23226031Sstas * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24226031Sstas * SUCH DAMAGE.
25226031Sstas *
26226031Sstas *	$FreeBSD: src/lib/libgssapi/gss_compare_name.c,v 1.1 2005/12/29 14:40:20 dfr Exp $
27226031Sstas */
28226031Sstas
29226031Sstas#include "mech_locl.h"
30226031Sstas
31226031SstasGSSAPI_LIB_FUNCTION OM_uint32 GSSAPI_LIB_CALL
32226031Sstasgss_compare_name(OM_uint32 *minor_status,
33226031Sstas    const gss_name_t name1_arg,
34226031Sstas    const gss_name_t name2_arg,
35226031Sstas    int *name_equal)
36226031Sstas{
37226031Sstas	struct _gss_name *name1 = (struct _gss_name *) name1_arg;
38226031Sstas	struct _gss_name *name2 = (struct _gss_name *) name2_arg;
39226031Sstas
40226031Sstas	/*
41226031Sstas	 * First check the implementation-independant name if both
42226031Sstas	 * names have one. Otherwise, try to find common mechanism
43226031Sstas	 * names and compare them.
44226031Sstas	 */
45226031Sstas	if (name1->gn_value.value && name2->gn_value.value) {
46226031Sstas		*name_equal = 1;
47226031Sstas		if (!gss_oid_equal(&name1->gn_type, &name2->gn_type)) {
48226031Sstas			*name_equal = 0;
49226031Sstas		} else if (name1->gn_value.length != name2->gn_value.length ||
50226031Sstas		    memcmp(name1->gn_value.value, name1->gn_value.value,
51226031Sstas			name1->gn_value.length)) {
52226031Sstas			*name_equal = 0;
53226031Sstas		}
54226031Sstas	} else {
55226031Sstas		struct _gss_mechanism_name *mn1;
56226031Sstas		struct _gss_mechanism_name *mn2;
57226031Sstas
58226031Sstas		HEIM_SLIST_FOREACH(mn1, &name1->gn_mn, gmn_link) {
59226031Sstas			OM_uint32 major_status;
60226031Sstas
61226031Sstas			major_status = _gss_find_mn(minor_status, name2,
62226031Sstas						    mn1->gmn_mech_oid, &mn2);
63226031Sstas			if (major_status == GSS_S_COMPLETE) {
64226031Sstas				return (mn1->gmn_mech->gm_compare_name(
65226031Sstas						minor_status,
66226031Sstas						mn1->gmn_name,
67226031Sstas						mn2->gmn_name,
68226031Sstas						name_equal));
69226031Sstas			}
70226031Sstas		}
71226031Sstas		*name_equal = 0;
72226031Sstas	}
73226031Sstas
74226031Sstas	*minor_status = 0;
75226031Sstas	return (GSS_S_COMPLETE);
76226031Sstas}
77