1c0b9f4feSDoug Rabson /*- 2c0b9f4feSDoug Rabson * Copyright (c) 2005 Doug Rabson 3c0b9f4feSDoug Rabson * All rights reserved. 4c0b9f4feSDoug Rabson * 5c0b9f4feSDoug Rabson * Redistribution and use in source and binary forms, with or without 6c0b9f4feSDoug Rabson * modification, are permitted provided that the following conditions 7c0b9f4feSDoug Rabson * are met: 8c0b9f4feSDoug Rabson * 1. Redistributions of source code must retain the above copyright 9c0b9f4feSDoug Rabson * notice, this list of conditions and the following disclaimer. 10c0b9f4feSDoug Rabson * 2. Redistributions in binary form must reproduce the above copyright 11c0b9f4feSDoug Rabson * notice, this list of conditions and the following disclaimer in the 12c0b9f4feSDoug Rabson * documentation and/or other materials provided with the distribution. 13c0b9f4feSDoug Rabson * 14c0b9f4feSDoug Rabson * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 15c0b9f4feSDoug Rabson * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 16c0b9f4feSDoug Rabson * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 17c0b9f4feSDoug Rabson * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 18c0b9f4feSDoug Rabson * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19c0b9f4feSDoug Rabson * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20c0b9f4feSDoug Rabson * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21c0b9f4feSDoug Rabson * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22c0b9f4feSDoug Rabson * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23c0b9f4feSDoug Rabson * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24c0b9f4feSDoug Rabson * SUCH DAMAGE. 25c0b9f4feSDoug Rabson * 26c0b9f4feSDoug Rabson * $FreeBSD$ 27c0b9f4feSDoug Rabson */ 28c0b9f4feSDoug Rabson 29c0b9f4feSDoug Rabson #include <gssapi/gssapi.h> 30c0b9f4feSDoug Rabson 31c0b9f4feSDoug Rabson static int 32c0b9f4feSDoug Rabson _gss_oid_equal(const gss_OID oid1, const gss_OID oid2) 33c0b9f4feSDoug Rabson { 34c0b9f4feSDoug Rabson if (oid1->length != oid2->length) 35c0b9f4feSDoug Rabson return (0); 36c0b9f4feSDoug Rabson if (memcmp(oid1->elements, oid2->elements, oid1->length)) 37c0b9f4feSDoug Rabson return (0); 38c0b9f4feSDoug Rabson return (1); 39c0b9f4feSDoug Rabson } 40c0b9f4feSDoug Rabson 41c0b9f4feSDoug Rabson OM_uint32 42c0b9f4feSDoug Rabson gss_test_oid_set_member(OM_uint32 *minor_status, 43c0b9f4feSDoug Rabson const gss_OID member, 44c0b9f4feSDoug Rabson const gss_OID_set set, 45c0b9f4feSDoug Rabson int *present) 46c0b9f4feSDoug Rabson { 47c0b9f4feSDoug Rabson int i; 48c0b9f4feSDoug Rabson 49c0b9f4feSDoug Rabson *present = 0; 50c0b9f4feSDoug Rabson for (i = 0; i < set->count; i++) 51c0b9f4feSDoug Rabson if (_gss_oid_equal(member, &set->elements[i])) 52c0b9f4feSDoug Rabson *present = 1; 53c0b9f4feSDoug Rabson 54c0b9f4feSDoug Rabson *minor_status = 0; 55c0b9f4feSDoug Rabson return (GSS_S_COMPLETE); 56c0b9f4feSDoug Rabson } 57