1178825Sdfr/* 2233294Sstas * Copyright (c) 1997 - 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 "ntlm.h" 35178825Sdfr 36233294SstasOM_uint32 GSSAPI_CALLCONV 37233294Sstas_gss_ntlm_display_name 38178825Sdfr (OM_uint32 * minor_status, 39178825Sdfr const gss_name_t input_name, 40178825Sdfr gss_buffer_t output_name_buffer, 41178825Sdfr gss_OID * output_name_type 42178825Sdfr ) 43178825Sdfr{ 44178825Sdfr *minor_status = 0; 45178825Sdfr 46178825Sdfr if (output_name_type) 47178825Sdfr *output_name_type = GSS_NTLM_MECHANISM; 48178825Sdfr 49178825Sdfr if (output_name_buffer) { 50178825Sdfr ntlm_name n = (ntlm_name)input_name; 51233294Sstas char *str = NULL; 52178825Sdfr int len; 53233294Sstas 54178825Sdfr output_name_buffer->length = 0; 55178825Sdfr output_name_buffer->value = NULL; 56178825Sdfr 57178825Sdfr if (n == NULL) { 58178825Sdfr *minor_status = 0; 59178825Sdfr return GSS_S_BAD_NAME; 60178825Sdfr } 61178825Sdfr 62178825Sdfr len = asprintf(&str, "%s@%s", n->user, n->domain); 63233294Sstas if (len < 0 || str == NULL) { 64178825Sdfr *minor_status = ENOMEM; 65178825Sdfr return GSS_S_FAILURE; 66178825Sdfr } 67178825Sdfr output_name_buffer->length = len; 68178825Sdfr output_name_buffer->value = str; 69178825Sdfr } 70178825Sdfr return GSS_S_COMPLETE; 71178825Sdfr} 72