57 lines
1.9 KiB
C
57 lines
1.9 KiB
C
|
/*-
|
||
|
|
* Copyright (c) 2005 Doug Rabson
|
||
|
|
* All rights reserved.
|
||
|
|
*
|
||
|
|
* Redistribution and use in source and binary forms, with or without
|
||
|
|
* modification, are permitted provided that the following conditions
|
||
|
|
* are met:
|
||
|
|
* 1. Redistributions of source code must retain the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer.
|
||
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer in the
|
||
|
|
* documentation and/or other materials provided with the distribution.
|
||
|
|
*
|
||
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
||
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
||
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
||
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
||
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||
|
|
* SUCH DAMAGE.
|
||
|
|
*
|
||
|
|
* $FreeBSD$
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include <gssapi/gssapi.h>
|
||
|
|
|
||
|
|
static int
|
||
|
|
_gss_oid_equal(const gss_OID oid1, const gss_OID oid2)
|
||
|
|
{
|
||
|
|
if (oid1->length != oid2->length)
|
||
|
|
return (0);
|
||
|
|
if (memcmp(oid1->elements, oid2->elements, oid1->length))
|
||
|
|
return (0);
|
||
|
|
return (1);
|
||
|
|
}
|
||
|
|
|
||
|
|
OM_uint32
|
||
|
|
gss_test_oid_set_member(OM_uint32 *minor_status,
|
||
|
|
const gss_OID member,
|
||
|
|
const gss_OID_set set,
|
||
|
|
int *present)
|
||
|
|
{
|
||
|
|
int i;
|
||
|
|
|
||
|
|
*present = 0;
|
||
|
|
for (i = 0; i < set->count; i++)
|
||
|
|
if (_gss_oid_equal(member, &set->elements[i]))
|
||
|
|
*present = 1;
|
||
|
|
|
||
|
|
*minor_status = 0;
|
||
|
|
return (GSS_S_COMPLETE);
|
||
|
|
}
|