| 1 |
/* |
| 2 |
* Copyright (c) 2006 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 "mech_locl.h" |
| 35 |
|
| 36 |
GSSAPI_LIB_FUNCTION OM_uint32 GSSAPI_LIB_CALL |
| 37 |
gss_oid_to_str(OM_uint32 *minor_status, gss_OID oid, gss_buffer_t oid_str) |
| 38 |
{ |
| 39 |
int ret; |
| 40 |
size_t size; |
| 41 |
heim_oid o; |
| 42 |
char *p; |
| 43 |
|
| 44 |
_mg_buffer_zero(oid_str); |
| 45 |
|
| 46 |
if (oid == GSS_C_NULL_OID) |
| 47 |
return GSS_S_FAILURE; |
| 48 |
|
| 49 |
ret = der_get_oid (oid->elements, oid->length, &o, &size); |
| 50 |
if (ret) { |
| 51 |
*minor_status = ret; |
| 52 |
return GSS_S_FAILURE; |
| 53 |
} |
| 54 |
|
| 55 |
ret = der_print_heim_oid(&o, ' ', &p); |
| 56 |
der_free_oid(&o); |
| 57 |
if (ret) { |
| 58 |
*minor_status = ret; |
| 59 |
return GSS_S_FAILURE; |
| 60 |
} |
| 61 |
|
| 62 |
oid_str->value = p; |
| 63 |
oid_str->length = strlen(p); |
| 64 |
|
| 65 |
*minor_status = 0; |
| 66 |
return GSS_S_COMPLETE; |
| 67 |
} |
| 68 |
|
| 69 |
GSSAPI_LIB_FUNCTION const char * GSSAPI_LIB_CALL |
| 70 |
gss_oid_to_name(gss_const_OID oid) |
| 71 |
{ |
| 72 |
size_t i; |
| 73 |
|
| 74 |
for (i = 0; _gss_ont_mech[i].oid; i++) { |
| 75 |
if (gss_oid_equal(oid, _gss_ont_mech[i].oid)) |
| 76 |
return _gss_ont_mech[i].name; |
| 77 |
} |
| 78 |
return NULL; |
| 79 |
} |
| 80 |
|
| 81 |
GSSAPI_LIB_FUNCTION gss_OID GSSAPI_LIB_CALL |
| 82 |
gss_name_to_oid(const char *name) |
| 83 |
{ |
| 84 |
size_t i, partial = (size_t)-1; |
| 85 |
|
| 86 |
for (i = 0; _gss_ont_mech[i].oid; i++) { |
| 87 |
if (strcasecmp(name, _gss_ont_mech[i].short_desc) == 0) |
| 88 |
return _gss_ont_mech[i].oid; |
| 89 |
if (strncasecmp(name, _gss_ont_mech[i].short_desc, strlen(name)) == 0) { |
| 90 |
if (partial != (size_t)-1) |
| 91 |
return NULL; |
| 92 |
partial = i; |
| 93 |
} |
| 94 |
} |
| 95 |
if (partial != (size_t)-1) |
| 96 |
return _gss_ont_mech[partial].oid; |
| 97 |
return NULL; |
| 98 |
} |