1 /*- 2 * SPDX-License-Identifier: BSD-2-Clause 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 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 #include "utils.h" 37 38 OM_uint32 39 gss_display_name(OM_uint32 *minor_status, 40 const gss_name_t input_name, 41 gss_buffer_t output_name_buffer, 42 gss_OID *output_name_type) 43 { 44 OM_uint32 major_status; 45 struct _gss_name *name = (struct _gss_name *) input_name; 46 struct _gss_mechanism_name *mn; 47 48 _gss_buffer_zero(output_name_buffer); 49 if (output_name_type) 50 *output_name_type = GSS_C_NO_OID; 51 52 if (name == NULL) { 53 *minor_status = 0; 54 return (GSS_S_BAD_NAME); 55 } 56 57 /* 58 * If we know it, copy the buffer used to import the name in 59 * the first place. Otherwise, ask all the MNs in turn if 60 * they can display the thing. 61 */ 62 if (name->gn_value.value) { 63 output_name_buffer->value = malloc(name->gn_value.length); 64 if (!output_name_buffer->value) { 65 *minor_status = ENOMEM; 66 return (GSS_S_FAILURE); 67 } 68 output_name_buffer->length = name->gn_value.length; 69 memcpy(output_name_buffer->value, name->gn_value.value, 70 output_name_buffer->length); 71 if (output_name_type) 72 *output_name_type = &name->gn_type; 73 74 *minor_status = 0; 75 return (GSS_S_COMPLETE); 76 } else { 77 SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 78 major_status = mn->gmn_mech->gm_display_name( 79 minor_status, mn->gmn_name, 80 output_name_buffer, 81 output_name_type); 82 if (major_status == GSS_S_COMPLETE) 83 return (GSS_S_COMPLETE); 84 } 85 } 86 87 *minor_status = 0; 88 return (GSS_S_FAILURE); 89 } 90