1 /*- 2 * Copyright (c) 2005 Doug Rabson 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24 * SUCH DAMAGE. 25 * 26 * $FreeBSD$ 27 */ 28 29 #include <gssapi/gssapi.h> 30 #include <stdlib.h> 31 #include <string.h> 32 #include <errno.h> 33 34 #include "mech_switch.h" 35 #include "name.h" 36 37 OM_uint32 38 gss_canonicalize_name(OM_uint32 *minor_status, 39 const gss_name_t input_name, 40 const gss_OID mech_type, 41 gss_name_t *output_name) 42 { 43 OM_uint32 major_status; 44 struct _gss_name *name = (struct _gss_name *) input_name; 45 struct _gss_mechanism_name *mn; 46 struct _gss_mech_switch *m = _gss_find_mech_switch(mech_type); 47 gss_name_t new_canonical_name; 48 49 *minor_status = 0; 50 *output_name = 0; 51 52 mn = _gss_find_mn(name, mech_type); 53 if (!mn) { 54 return (GSS_S_BAD_MECH); 55 } 56 57 m = mn->gmn_mech; 58 major_status = m->gm_canonicalize_name(minor_status, 59 mn->gmn_name, mech_type, &new_canonical_name); 60 if (major_status) 61 return (major_status); 62 63 /* 64 * Now we make a new name and mark it as an MN. 65 */ 66 *minor_status = 0; 67 name = malloc(sizeof(struct _gss_name)); 68 if (!name) { 69 m->gm_release_name(minor_status, &new_canonical_name); 70 *minor_status = ENOMEM; 71 return (GSS_S_FAILURE); 72 } 73 memset(name, 0, sizeof(struct _gss_name)); 74 75 mn = malloc(sizeof(struct _gss_mechanism_name)); 76 if (!mn) { 77 m->gm_release_name(minor_status, &new_canonical_name); 78 free(name); 79 *minor_status = ENOMEM; 80 return (GSS_S_FAILURE); 81 } 82 83 SLIST_INIT(&name->gn_mn); 84 mn->gmn_mech = m; 85 mn->gmn_mech_oid = &m->gm_mech_oid; 86 mn->gmn_name = new_canonical_name; 87 SLIST_INSERT_HEAD(&name->gn_mn, mn, gmn_link); 88 89 *output_name = (gss_name_t) name; 90 91 return (GSS_S_COMPLETE); 92 } 93