1 /*- 2 * SPDX-License-Identifier: BSD-2-Clause 3 * 4 * Copyright (c) 2005 Doug Rabson 5 * 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$ 29 */ 30 31 #include <gssapi/gssapi.h> 32 #include <string.h> 33 34 #include "mech_switch.h" 35 #include "name.h" 36 #include "utils.h" 37 38 OM_uint32 39 gss_compare_name(OM_uint32 *minor_status, 40 const gss_name_t name1_arg, 41 const gss_name_t name2_arg, 42 int *name_equal) 43 { 44 struct _gss_name *name1 = (struct _gss_name *) name1_arg; 45 struct _gss_name *name2 = (struct _gss_name *) name2_arg; 46 47 /* 48 * First check the implementation-independent name if both 49 * names have one. Otherwise, try to find common mechanism 50 * names and compare them. 51 */ 52 if (name1->gn_value.value && name2->gn_value.value) { 53 *name_equal = 1; 54 if (!gss_oid_equal(&name1->gn_type, &name2->gn_type)) { 55 *name_equal = 0; 56 } else if (name1->gn_value.length != name2->gn_value.length || 57 memcmp(name1->gn_value.value, name1->gn_value.value, 58 name1->gn_value.length)) { 59 *name_equal = 0; 60 } 61 } else { 62 struct _gss_mechanism_name *mn1; 63 struct _gss_mechanism_name *mn2; 64 65 SLIST_FOREACH(mn1, &name1->gn_mn, gmn_link) { 66 OM_uint32 major_status; 67 68 major_status = _gss_find_mn(minor_status, name2, 69 mn1->gmn_mech_oid, &mn2); 70 if (major_status == GSS_S_COMPLETE) { 71 return (mn1->gmn_mech->gm_compare_name( 72 minor_status, 73 mn1->gmn_name, 74 mn2->gmn_name, 75 name_equal)); 76 } 77 } 78 *name_equal = 0; 79 } 80 81 *minor_status = 0; 82 return (GSS_S_COMPLETE); 83 } 84