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