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