xref: /freebsd/crypto/heimdal/lib/gssapi/mech/gss_duplicate_oid.c (revision 5ca8e32633c4ffbbcd6762e5888b6a4ba0708c6c)
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 "mech_locl.h"
35 
36 GSSAPI_LIB_FUNCTION OM_uint32 GSSAPI_LIB_CALL
37 gss_duplicate_oid (
38         OM_uint32 *minor_status,
39 	gss_OID src_oid,
40 	gss_OID *dest_oid
41      )
42 {
43     *minor_status = 0;
44 
45     if (src_oid == GSS_C_NO_OID) {
46 	*dest_oid = GSS_C_NO_OID;
47 	return GSS_S_COMPLETE;
48     }
49 
50     *dest_oid = malloc(sizeof(**dest_oid));
51     if (*dest_oid == GSS_C_NO_OID) {
52 	*minor_status = ENOMEM;
53 	return GSS_S_FAILURE;
54     }
55 
56     (*dest_oid)->elements = malloc(src_oid->length);
57     if ((*dest_oid)->elements == NULL) {
58 	free(*dest_oid);
59 	*dest_oid = GSS_C_NO_OID;
60 	*minor_status = ENOMEM;
61 	return GSS_S_FAILURE;
62     }
63     memcpy((*dest_oid)->elements, src_oid->elements, src_oid->length);
64     (*dest_oid)->length = src_oid->length;
65 
66     *minor_status = 0;
67     return GSS_S_COMPLETE;
68 }
69