1/* $NetBSD: gss_names.c,v 1.2 2017/01/28 21:31:46 christos Exp $ */ 2 3/*- 4 * Copyright (c) 2005 Doug Rabson 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 17 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 19 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 20 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 26 * SUCH DAMAGE. 27 * 28 * $FreeBSD: src/lib/libgssapi/gss_names.c,v 1.1 2005/12/29 14:40:20 dfr Exp $ 29 */ 30 31#include "mech_locl.h" 32 33OM_uint32 34_gss_find_mn(OM_uint32 *minor_status, struct _gss_name *name, gss_OID mech, 35 struct _gss_mechanism_name **output_mn) 36{ 37 OM_uint32 major_status; 38 gssapi_mech_interface m; 39 struct _gss_mechanism_name *mn; 40 41 *output_mn = NULL; 42 43 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 44 if (gss_oid_equal(mech, mn->gmn_mech_oid)) 45 break; 46 } 47 48 if (!mn) { 49 /* 50 * If this name is canonical (i.e. there is only an 51 * MN but it is from a different mech), give up now. 52 */ 53 if (!name->gn_value.value) 54 return GSS_S_BAD_NAME; 55 56 m = __gss_get_mechanism(mech); 57 if (!m) 58 return (GSS_S_BAD_MECH); 59 60 mn = malloc(sizeof(struct _gss_mechanism_name)); 61 if (!mn) 62 return GSS_S_FAILURE; 63 64 major_status = m->gm_import_name(minor_status, 65 &name->gn_value, 66 (name->gn_type.elements 67 ? &name->gn_type : GSS_C_NO_OID), 68 &mn->gmn_name); 69 if (major_status != GSS_S_COMPLETE) { 70 _gss_mg_error(m, major_status, *minor_status); 71 free(mn); 72 return major_status; 73 } 74 75 mn->gmn_mech = m; 76 mn->gmn_mech_oid = &m->gm_mech_oid; 77 HEIM_SLIST_INSERT_HEAD(&name->gn_mn, mn, gmn_link); 78 } 79 *output_mn = mn; 80 return 0; 81} 82 83 84/* 85 * Make a name from an MN. 86 */ 87struct _gss_name * 88_gss_make_name(gssapi_mech_interface m, gss_name_t new_mn) 89{ 90 struct _gss_name *name; 91 struct _gss_mechanism_name *mn; 92 93 name = malloc(sizeof(struct _gss_name)); 94 if (!name) 95 return (0); 96 memset(name, 0, sizeof(struct _gss_name)); 97 98 mn = malloc(sizeof(struct _gss_mechanism_name)); 99 if (!mn) { 100 free(name); 101 return (0); 102 } 103 104 HEIM_SLIST_INIT(&name->gn_mn); 105 mn->gmn_mech = m; 106 mn->gmn_mech_oid = &m->gm_mech_oid; 107 mn->gmn_name = new_mn; 108 HEIM_SLIST_INSERT_HEAD(&name->gn_mn, mn, gmn_link); 109 110 return (name); 111} 112 113