1178825Sdfr/* 2233294Sstas * Copyright (c) 1997, 1999, 2003 Kungliga Tekniska H��gskolan 3233294Sstas * (Royal Institute of Technology, Stockholm, Sweden). 4233294Sstas * All rights reserved. 5178825Sdfr * 6233294Sstas * Redistribution and use in source and binary forms, with or without 7233294Sstas * modification, are permitted provided that the following conditions 8233294Sstas * are met: 9178825Sdfr * 10233294Sstas * 1. Redistributions of source code must retain the above copyright 11233294Sstas * notice, this list of conditions and the following disclaimer. 12178825Sdfr * 13233294Sstas * 2. Redistributions in binary form must reproduce the above copyright 14233294Sstas * notice, this list of conditions and the following disclaimer in the 15233294Sstas * documentation and/or other materials provided with the distribution. 16178825Sdfr * 17233294Sstas * 3. Neither the name of the Institute nor the names of its contributors 18233294Sstas * may be used to endorse or promote products derived from this software 19233294Sstas * without specific prior written permission. 20178825Sdfr * 21233294Sstas * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND 22233294Sstas * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23233294Sstas * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24233294Sstas * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE 25233294Sstas * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26233294Sstas * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27233294Sstas * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28233294Sstas * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29233294Sstas * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30233294Sstas * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31233294Sstas * SUCH DAMAGE. 32178825Sdfr */ 33178825Sdfr 34233294Sstas#include "gsskrb5_locl.h" 35178825Sdfr 36233294SstasOM_uint32 GSSAPI_CALLCONV _gsskrb5_export_name 37178825Sdfr (OM_uint32 * minor_status, 38178825Sdfr const gss_name_t input_name, 39178825Sdfr gss_buffer_t exported_name 40178825Sdfr ) 41178825Sdfr{ 42178825Sdfr krb5_context context; 43178825Sdfr krb5_const_principal princ = (krb5_const_principal)input_name; 44178825Sdfr krb5_error_code kret; 45178825Sdfr char *buf, *name; 46178825Sdfr size_t len; 47178825Sdfr 48178825Sdfr GSSAPI_KRB5_INIT (&context); 49178825Sdfr 50178825Sdfr kret = krb5_unparse_name (context, princ, &name); 51178825Sdfr if (kret) { 52178825Sdfr *minor_status = kret; 53178825Sdfr return GSS_S_FAILURE; 54178825Sdfr } 55178825Sdfr len = strlen (name); 56178825Sdfr 57178825Sdfr exported_name->length = 10 + len + GSS_KRB5_MECHANISM->length; 58178825Sdfr exported_name->value = malloc(exported_name->length); 59178825Sdfr if (exported_name->value == NULL) { 60178825Sdfr free (name); 61178825Sdfr *minor_status = ENOMEM; 62178825Sdfr return GSS_S_FAILURE; 63178825Sdfr } 64178825Sdfr 65178825Sdfr /* TOK, MECH_OID_LEN, DER(MECH_OID), NAME_LEN, NAME */ 66178825Sdfr 67178825Sdfr buf = exported_name->value; 68178825Sdfr memcpy(buf, "\x04\x01", 2); 69178825Sdfr buf += 2; 70178825Sdfr buf[0] = ((GSS_KRB5_MECHANISM->length + 2) >> 8) & 0xff; 71178825Sdfr buf[1] = (GSS_KRB5_MECHANISM->length + 2) & 0xff; 72178825Sdfr buf+= 2; 73178825Sdfr buf[0] = 0x06; 74178825Sdfr buf[1] = (GSS_KRB5_MECHANISM->length) & 0xFF; 75178825Sdfr buf+= 2; 76178825Sdfr 77178825Sdfr memcpy(buf, GSS_KRB5_MECHANISM->elements, GSS_KRB5_MECHANISM->length); 78178825Sdfr buf += GSS_KRB5_MECHANISM->length; 79178825Sdfr 80178825Sdfr buf[0] = (len >> 24) & 0xff; 81178825Sdfr buf[1] = (len >> 16) & 0xff; 82178825Sdfr buf[2] = (len >> 8) & 0xff; 83178825Sdfr buf[3] = (len) & 0xff; 84178825Sdfr buf += 4; 85178825Sdfr 86178825Sdfr memcpy (buf, name, len); 87178825Sdfr 88178825Sdfr free (name); 89178825Sdfr 90178825Sdfr *minor_status = 0; 91178825Sdfr return GSS_S_COMPLETE; 92178825Sdfr} 93