1/*-
2 * Copyright (c) 2005 Doug Rabson
3 * All rights reserved.
4 *
5 * Portions Copyright (c) 2009 Apple Inc. 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 *	$FreeBSD: src/lib/libgssapi/gss_compare_name.c,v 1.1 2005/12/29 14:40:20 dfr Exp $
29 */
30
31#include "mech_locl.h"
32
33GSSAPI_LIB_FUNCTION OM_uint32 GSSAPI_LIB_CALL
34gss_compare_name(OM_uint32 *minor_status,
35    const gss_name_t name1_arg,
36    const gss_name_t name2_arg,
37    int *name_equal)
38{
39	struct _gss_name *name1 = (struct _gss_name *) name1_arg;
40	struct _gss_name *name2 = (struct _gss_name *) name2_arg;
41
42	/*
43	 * First check the implementation-independant name if both
44	 * names have one. Otherwise, try to find common mechanism
45	 * names and compare them.
46	 */
47	if (name1->gn_value.value && name2->gn_value.value) {
48		*name_equal = 1;
49		if (!gss_oid_equal(&name1->gn_type, &name2->gn_type)) {
50			*name_equal = 0;
51		} else if (name1->gn_value.length != name2->gn_value.length ||
52		    memcmp(name1->gn_value.value, name1->gn_value.value,
53			name1->gn_value.length)) {
54			*name_equal = 0;
55		}
56	} else {
57		struct _gss_mechanism_name *mn1;
58		struct _gss_mechanism_name *mn2;
59
60		HEIM_SLIST_FOREACH(mn1, &name1->gn_mn, gmn_link) {
61			OM_uint32 major_status;
62
63			major_status = _gss_find_mn(minor_status, name2,
64						    mn1->gmn_mech_oid, &mn2);
65			if (major_status == GSS_S_COMPLETE && mn2) {
66				return (mn1->gmn_mech->gm_compare_name(
67						minor_status,
68						mn1->gmn_name,
69						mn2->gmn_name,
70						name_equal));
71			}
72		}
73		*name_equal = 0;
74	}
75
76	*minor_status = 0;
77	return (GSS_S_COMPLETE);
78}
79