xref: /minix3/crypto/external/bsd/heimdal/dist/lib/gssapi/mech/gss_duplicate_oid.c (revision ebfedea0ce5bbe81e252ddf32d732e40fb633fae)
1 /*	$NetBSD: gss_duplicate_oid.c,v 1.1.1.1 2011/04/13 18:14:46 elric Exp $	*/
2 
3 /*
4  * Copyright (c) 1997 - 2003 Kungliga Tekniska Högskolan
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
gss_duplicate_oid(OM_uint32 * minor_status,gss_OID src_oid,gss_OID * dest_oid)39 gss_duplicate_oid (
40         OM_uint32 *minor_status,
41 	gss_OID src_oid,
42 	gss_OID *dest_oid
43      )
44 {
45     *minor_status = 0;
46 
47     if (src_oid == GSS_C_NO_OID) {
48 	*dest_oid = GSS_C_NO_OID;
49 	return GSS_S_COMPLETE;
50     }
51 
52     *dest_oid = malloc(sizeof(**dest_oid));
53     if (*dest_oid == GSS_C_NO_OID) {
54 	*minor_status = ENOMEM;
55 	return GSS_S_FAILURE;
56     }
57 
58     (*dest_oid)->elements = malloc(src_oid->length);
59     if ((*dest_oid)->elements == NULL) {
60 	free(*dest_oid);
61 	*dest_oid = GSS_C_NO_OID;
62 	*minor_status = ENOMEM;
63 	return GSS_S_FAILURE;
64     }
65     memcpy((*dest_oid)->elements, src_oid->elements, src_oid->length);
66     (*dest_oid)->length = src_oid->length;
67 
68     *minor_status = 0;
69     return GSS_S_COMPLETE;
70 }
71