1*ae771770SStanislav Sedov /*
2*ae771770SStanislav Sedov * Copyright (c) 2006 Kungliga Tekniska Högskolan
3*ae771770SStanislav Sedov * (Royal Institute of Technology, Stockholm, Sweden).
4*ae771770SStanislav Sedov * All rights reserved.
5*ae771770SStanislav Sedov *
6*ae771770SStanislav Sedov * Redistribution and use in source and binary forms, with or without
7*ae771770SStanislav Sedov * modification, are permitted provided that the following conditions
8*ae771770SStanislav Sedov * are met:
9*ae771770SStanislav Sedov *
10*ae771770SStanislav Sedov * 1. Redistributions of source code must retain the above copyright
11*ae771770SStanislav Sedov * notice, this list of conditions and the following disclaimer.
12*ae771770SStanislav Sedov *
13*ae771770SStanislav Sedov * 2. Redistributions in binary form must reproduce the above copyright
14*ae771770SStanislav Sedov * notice, this list of conditions and the following disclaimer in the
15*ae771770SStanislav Sedov * documentation and/or other materials provided with the distribution.
16*ae771770SStanislav Sedov *
17*ae771770SStanislav Sedov * 3. Neither the name of the Institute nor the names of its contributors
18*ae771770SStanislav Sedov * may be used to endorse or promote products derived from this software
19*ae771770SStanislav Sedov * without specific prior written permission.
20*ae771770SStanislav Sedov *
21*ae771770SStanislav Sedov * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22*ae771770SStanislav Sedov * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23*ae771770SStanislav Sedov * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24*ae771770SStanislav Sedov * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25*ae771770SStanislav Sedov * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26*ae771770SStanislav Sedov * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27*ae771770SStanislav Sedov * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28*ae771770SStanislav Sedov * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29*ae771770SStanislav Sedov * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30*ae771770SStanislav Sedov * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31*ae771770SStanislav Sedov * SUCH DAMAGE.
32*ae771770SStanislav Sedov */
33*ae771770SStanislav Sedov
34*ae771770SStanislav Sedov #include "mech_locl.h"
35*ae771770SStanislav Sedov
36*ae771770SStanislav Sedov /**
37*ae771770SStanislav Sedov * Compare two GSS-API OIDs with each other.
38*ae771770SStanislav Sedov *
39*ae771770SStanislav Sedov * GSS_C_NO_OID matches nothing, not even it-self.
40*ae771770SStanislav Sedov *
41*ae771770SStanislav Sedov * @param a first oid to compare
42*ae771770SStanislav Sedov * @param b second oid to compare
43*ae771770SStanislav Sedov *
44*ae771770SStanislav Sedov * @return non-zero when both oid are the same OID, zero when they are
45*ae771770SStanislav Sedov * not the same.
46*ae771770SStanislav Sedov *
47*ae771770SStanislav Sedov * @ingroup gssapi
48*ae771770SStanislav Sedov */
49*ae771770SStanislav Sedov
50*ae771770SStanislav Sedov GSSAPI_LIB_FUNCTION int GSSAPI_LIB_CALL
gss_oid_equal(gss_const_OID a,gss_const_OID b)51*ae771770SStanislav Sedov gss_oid_equal(gss_const_OID a, gss_const_OID b)
52*ae771770SStanislav Sedov {
53*ae771770SStanislav Sedov if (a == b && a != GSS_C_NO_OID)
54*ae771770SStanislav Sedov return 1;
55*ae771770SStanislav Sedov if (a == GSS_C_NO_OID || b == GSS_C_NO_OID || a->length != b->length)
56*ae771770SStanislav Sedov return 0;
57*ae771770SStanislav Sedov return memcmp(a->elements, b->elements, a->length) == 0;
58*ae771770SStanislav Sedov }
59