1/* $NetBSD: inquire_names_for_mech.c,v 1.1.1.1 2011/04/13 18:14:45 elric Exp $ */ 2 3/* 4 * Copyright (c) 2003 Kungliga Tekniska Högskolan 5 * (Royal Institute of Technology, Stockholm, Sweden). 6 * All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 19 * 3. Neither the name of the Institute nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 */ 35 36#include "gsskrb5_locl.h" 37 38static gss_OID name_list[] = { 39 GSS_C_NT_HOSTBASED_SERVICE, 40 GSS_C_NT_USER_NAME, 41 GSS_KRB5_NT_PRINCIPAL_NAME, 42 GSS_C_NT_EXPORT_NAME, 43 NULL 44}; 45 46OM_uint32 GSSAPI_CALLCONV _gsskrb5_inquire_names_for_mech ( 47 OM_uint32 * minor_status, 48 const gss_OID mechanism, 49 gss_OID_set * name_types 50 ) 51{ 52 OM_uint32 ret; 53 int i; 54 55 *minor_status = 0; 56 57 if (gss_oid_equal(mechanism, GSS_KRB5_MECHANISM) == 0 && 58 gss_oid_equal(mechanism, GSS_C_NULL_OID) == 0) { 59 *name_types = GSS_C_NO_OID_SET; 60 return GSS_S_BAD_MECH; 61 } 62 63 ret = gss_create_empty_oid_set(minor_status, name_types); 64 if (ret != GSS_S_COMPLETE) 65 return ret; 66 67 for (i = 0; name_list[i] != NULL; i++) { 68 ret = gss_add_oid_set_member(minor_status, 69 name_list[i], 70 name_types); 71 if (ret != GSS_S_COMPLETE) 72 break; 73 } 74 75 if (ret != GSS_S_COMPLETE) 76 gss_release_oid_set(NULL, name_types); 77 78 return GSS_S_COMPLETE; 79} 80