1*ae771770SStanislav Sedov /*
2*ae771770SStanislav Sedov * Copyright (c) 2006 Kungliga Tekniska Högskolan
3*ae771770SStanislav Sedov * (Royal Institute of Technology, Stockholm, Sweden).
4*ae771770SStanislav Sedov * All rights reserved.
5*ae771770SStanislav Sedov *
6*ae771770SStanislav Sedov * Redistribution and use in source and binary forms, with or without
7*ae771770SStanislav Sedov * modification, are permitted provided that the following conditions
8*ae771770SStanislav Sedov * are met:
9*ae771770SStanislav Sedov *
10*ae771770SStanislav Sedov * 1. Redistributions of source code must retain the above copyright
11*ae771770SStanislav Sedov * notice, this list of conditions and the following disclaimer.
12*ae771770SStanislav Sedov *
13*ae771770SStanislav Sedov * 2. Redistributions in binary form must reproduce the above copyright
14*ae771770SStanislav Sedov * notice, this list of conditions and the following disclaimer in the
15*ae771770SStanislav Sedov * documentation and/or other materials provided with the distribution.
16*ae771770SStanislav Sedov *
17*ae771770SStanislav Sedov * 3. Neither the name of the Institute nor the names of its contributors
18*ae771770SStanislav Sedov * may be used to endorse or promote products derived from this software
19*ae771770SStanislav Sedov * without specific prior written permission.
20*ae771770SStanislav Sedov *
21*ae771770SStanislav Sedov * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22*ae771770SStanislav Sedov * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23*ae771770SStanislav Sedov * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24*ae771770SStanislav Sedov * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25*ae771770SStanislav Sedov * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26*ae771770SStanislav Sedov * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27*ae771770SStanislav Sedov * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28*ae771770SStanislav Sedov * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29*ae771770SStanislav Sedov * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30*ae771770SStanislav Sedov * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31*ae771770SStanislav Sedov * SUCH DAMAGE.
32*ae771770SStanislav Sedov */
33*ae771770SStanislav Sedov
34*ae771770SStanislav Sedov #include "mech_locl.h"
35*ae771770SStanislav Sedov
36*ae771770SStanislav Sedov GSSAPI_LIB_FUNCTION OM_uint32 GSSAPI_LIB_CALL
gss_oid_to_str(OM_uint32 * minor_status,gss_OID oid,gss_buffer_t oid_str)37*ae771770SStanislav Sedov gss_oid_to_str(OM_uint32 *minor_status, gss_OID oid, gss_buffer_t oid_str)
38*ae771770SStanislav Sedov {
39*ae771770SStanislav Sedov int ret;
40*ae771770SStanislav Sedov size_t size;
41*ae771770SStanislav Sedov heim_oid o;
42*ae771770SStanislav Sedov char *p;
43*ae771770SStanislav Sedov
44*ae771770SStanislav Sedov _mg_buffer_zero(oid_str);
45*ae771770SStanislav Sedov
46*ae771770SStanislav Sedov if (oid == GSS_C_NULL_OID)
47*ae771770SStanislav Sedov return GSS_S_FAILURE;
48*ae771770SStanislav Sedov
49*ae771770SStanislav Sedov ret = der_get_oid (oid->elements, oid->length, &o, &size);
50*ae771770SStanislav Sedov if (ret) {
51*ae771770SStanislav Sedov *minor_status = ret;
52*ae771770SStanislav Sedov return GSS_S_FAILURE;
53*ae771770SStanislav Sedov }
54*ae771770SStanislav Sedov
55*ae771770SStanislav Sedov ret = der_print_heim_oid(&o, ' ', &p);
56*ae771770SStanislav Sedov der_free_oid(&o);
57*ae771770SStanislav Sedov if (ret) {
58*ae771770SStanislav Sedov *minor_status = ret;
59*ae771770SStanislav Sedov return GSS_S_FAILURE;
60*ae771770SStanislav Sedov }
61*ae771770SStanislav Sedov
62*ae771770SStanislav Sedov oid_str->value = p;
63*ae771770SStanislav Sedov oid_str->length = strlen(p);
64*ae771770SStanislav Sedov
65*ae771770SStanislav Sedov *minor_status = 0;
66*ae771770SStanislav Sedov return GSS_S_COMPLETE;
67*ae771770SStanislav Sedov }
68*ae771770SStanislav Sedov
69*ae771770SStanislav Sedov GSSAPI_LIB_FUNCTION const char * GSSAPI_LIB_CALL
gss_oid_to_name(gss_const_OID oid)70*ae771770SStanislav Sedov gss_oid_to_name(gss_const_OID oid)
71*ae771770SStanislav Sedov {
72*ae771770SStanislav Sedov size_t i;
73*ae771770SStanislav Sedov
74*ae771770SStanislav Sedov for (i = 0; _gss_ont_mech[i].oid; i++) {
75*ae771770SStanislav Sedov if (gss_oid_equal(oid, _gss_ont_mech[i].oid))
76*ae771770SStanislav Sedov return _gss_ont_mech[i].name;
77*ae771770SStanislav Sedov }
78*ae771770SStanislav Sedov return NULL;
79*ae771770SStanislav Sedov }
80*ae771770SStanislav Sedov
81*ae771770SStanislav Sedov GSSAPI_LIB_FUNCTION gss_OID GSSAPI_LIB_CALL
gss_name_to_oid(const char * name)82*ae771770SStanislav Sedov gss_name_to_oid(const char *name)
83*ae771770SStanislav Sedov {
84*ae771770SStanislav Sedov size_t i, partial = (size_t)-1;
85*ae771770SStanislav Sedov
86*ae771770SStanislav Sedov for (i = 0; _gss_ont_mech[i].oid; i++) {
87*ae771770SStanislav Sedov if (strcasecmp(name, _gss_ont_mech[i].short_desc) == 0)
88*ae771770SStanislav Sedov return _gss_ont_mech[i].oid;
89*ae771770SStanislav Sedov if (strncasecmp(name, _gss_ont_mech[i].short_desc, strlen(name)) == 0) {
90*ae771770SStanislav Sedov if (partial != (size_t)-1)
91*ae771770SStanislav Sedov return NULL;
92*ae771770SStanislav Sedov partial = i;
93*ae771770SStanislav Sedov }
94*ae771770SStanislav Sedov }
95*ae771770SStanislav Sedov if (partial != (size_t)-1)
96*ae771770SStanislav Sedov return _gss_ont_mech[partial].oid;
97*ae771770SStanislav Sedov return NULL;
98*ae771770SStanislav Sedov }
99