| 1 |
/* |
| 2 |
* Copyright (c) 1997 - 2003 Kungliga Tekniska Högskolan |
| 3 |
* (Royal Institute of Technology, Stockholm, Sweden). |
| 4 |
* All rights reserved. |
| 5 |
* |
| 6 |
* Redistribution and use in source and binary forms, with or without |
| 7 |
* modification, are permitted provided that the following conditions |
| 8 |
* are met: |
| 9 |
* |
| 10 |
* 1. Redistributions of source code must retain the above copyright |
| 11 |
* notice, this list of conditions and the following disclaimer. |
| 12 |
* |
| 13 |
* 2. Redistributions in binary form must reproduce the above copyright |
| 14 |
* notice, this list of conditions and the following disclaimer in the |
| 15 |
* documentation and/or other materials provided with the distribution. |
| 16 |
* |
| 17 |
* 3. Neither the name of the Institute nor the names of its contributors |
| 18 |
* may be used to endorse or promote products derived from this software |
| 19 |
* without specific prior written permission. |
| 20 |
* |
| 21 |
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND |
| 22 |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 23 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 24 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE |
| 25 |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 26 |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 27 |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 28 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 29 |
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 30 |
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 31 |
* SUCH DAMAGE. |
| 32 |
*/ |
| 33 |
|
| 34 |
#include "ntlm.h" |
| 35 |
|
| 36 |
OM_uint32 GSSAPI_CALLCONV |
| 37 |
_gss_ntlm_import_name |
| 38 |
(OM_uint32 * minor_status, |
| 39 |
const gss_buffer_t input_name_buffer, |
| 40 |
const gss_OID input_name_type, |
| 41 |
gss_name_t * output_name |
| 42 |
) |
| 43 |
{ |
| 44 |
char *name, *p, *p2; |
| 45 |
int is_hostnamed; |
| 46 |
int is_username; |
| 47 |
ntlm_name n; |
| 48 |
|
| 49 |
*minor_status = 0; |
| 50 |
|
| 51 |
if (output_name == NULL) |
| 52 |
return GSS_S_CALL_INACCESSIBLE_WRITE; |
| 53 |
|
| 54 |
*output_name = GSS_C_NO_NAME; |
| 55 |
|
| 56 |
is_hostnamed = gss_oid_equal(input_name_type, GSS_C_NT_HOSTBASED_SERVICE); |
| 57 |
is_username = gss_oid_equal(input_name_type, GSS_C_NT_USER_NAME); |
| 58 |
|
| 59 |
if (!is_hostnamed && !is_username) |
| 60 |
return GSS_S_BAD_NAMETYPE; |
| 61 |
|
| 62 |
name = malloc(input_name_buffer->length + 1); |
| 63 |
if (name == NULL) { |
| 64 |
*minor_status = ENOMEM; |
| 65 |
return GSS_S_FAILURE; |
| 66 |
} |
| 67 |
memcpy(name, input_name_buffer->value, input_name_buffer->length); |
| 68 |
name[input_name_buffer->length] = '\0'; |
| 69 |
|
| 70 |
/* find "domain" part of the name and uppercase it */ |
| 71 |
p = strchr(name, '@'); |
| 72 |
if (p == NULL) { |
| 73 |
free(name); |
| 74 |
return GSS_S_BAD_NAME; |
| 75 |
} |
| 76 |
p[0] = '\0'; |
| 77 |
p++; |
| 78 |
p2 = strchr(p, '.'); |
| 79 |
if (p2 && p2[1] != '\0') { |
| 80 |
if (is_hostnamed) { |
| 81 |
p = p2 + 1; |
| 82 |
p2 = strchr(p, '.'); |
| 83 |
} |
| 84 |
if (p2) |
| 85 |
*p2 = '\0'; |
| 86 |
} |
| 87 |
strupr(p); |
| 88 |
|
| 89 |
n = calloc(1, sizeof(*n)); |
| 90 |
if (n == NULL) { |
| 91 |
free(name); |
| 92 |
*minor_status = ENOMEM; |
| 93 |
return GSS_S_FAILURE; |
| 94 |
} |
| 95 |
|
| 96 |
n->user = strdup(name); |
| 97 |
n->domain = strdup(p); |
| 98 |
|
| 99 |
free(name); |
| 100 |
|
| 101 |
if (n->user == NULL || n->domain == NULL) { |
| 102 |
free(n->user); |
| 103 |
free(n->domain); |
| 104 |
free(n); |
| 105 |
*minor_status = ENOMEM; |
| 106 |
return GSS_S_FAILURE; |
| 107 |
} |
| 108 |
|
| 109 |
*output_name = (gss_name_t)n; |
| 110 |
|
| 111 |
return GSS_S_COMPLETE; |
| 112 |
} |