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