/* [<][>][^][v][top][bottom][index][help] */
DEFINITIONS
This source file includes following definitions.
- gss_compare_name
1 /*-
2 * Copyright (c) 2005 Doug Rabson
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
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.
13 *
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
24 * SUCH DAMAGE.
25 *
26 * $FreeBSD: src/lib/libgssapi/gss_compare_name.c,v 1.1 2005/12/29 14:40:20 dfr Exp $
27 */
28
29 #include "mech_locl.h"
30 RCSID("$Id$");
31
32 OM_uint32 GSSAPI_LIB_FUNCTION
33 gss_compare_name(OM_uint32 *minor_status,
/* [<][>][^][v][top][bottom][index][help] */
34 const gss_name_t name1_arg,
35 const gss_name_t name2_arg,
36 int *name_equal)
37 {
38 struct _gss_name *name1 = (struct _gss_name *) name1_arg;
39 struct _gss_name *name2 = (struct _gss_name *) name2_arg;
40
41 /*
42 * First check the implementation-independant name if both
43 * names have one. Otherwise, try to find common mechanism
44 * names and compare them.
45 */
46 if (name1->gn_value.value && name2->gn_value.value) {
47 *name_equal = 1;
48 if (!gss_oid_equal(&name1->gn_type, &name2->gn_type)) {
49 *name_equal = 0;
50 } else if (name1->gn_value.length != name2->gn_value.length ||
51 memcmp(name1->gn_value.value, name1->gn_value.value,
52 name1->gn_value.length)) {
53 *name_equal = 0;
54 }
55 } else {
56 struct _gss_mechanism_name *mn1;
57 struct _gss_mechanism_name *mn2;
58
59 SLIST_FOREACH(mn1, &name1->gn_mn, gmn_link) {
60 OM_uint32 major_status;
61
62 major_status = _gss_find_mn(minor_status, name2,
63 mn1->gmn_mech_oid, &mn2);
64 if (major_status == GSS_S_COMPLETE) {
65 return (mn1->gmn_mech->gm_compare_name(
66 minor_status,
67 mn1->gmn_name,
68 mn2->gmn_name,
69 name_equal));
70 }
71 }
72 *name_equal = 0;
73 }
74
75 *minor_status = 0;
76 return (GSS_S_COMPLETE);
77 }