xref: /freebsd/lib/libgssapi/gss_add_oid_set_member.c (revision d0b2dbfa0ecf2bbc9709efc5e20baf8e4b44bbbf)
1 /*-
2  * SPDX-License-Identifier: BSD-2-Clause
3  *
4  * Copyright (c) 2005 Doug Rabson
5  * All rights reserved.
6  *
7  * Redistribution and use in source and binary forms, with or without
8  * modification, are permitted provided that the following conditions
9  * are met:
10  * 1. Redistributions of source code must retain the above copyright
11  *    notice, this list of conditions and the following disclaimer.
12  * 2. Redistributions in binary form must reproduce the above copyright
13  *    notice, this list of conditions and the following disclaimer in the
14  *    documentation and/or other materials provided with the distribution.
15  *
16  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26  * SUCH DAMAGE.
27  */
28 
29 #include <gssapi/gssapi.h>
30 #include <stdlib.h>
31 #include <string.h>
32 #include <errno.h>
33 
34 OM_uint32
35 gss_add_oid_set_member(OM_uint32 *minor_status,
36     const gss_OID member_oid,
37     gss_OID_set *oid_set)
38 {
39 	OM_uint32 major_status;
40 	gss_OID_set set = *oid_set;
41 	gss_OID new_elements;
42 	gss_OID new_oid;
43 	int t;
44 
45 	*minor_status = 0;
46 
47 	major_status = gss_test_oid_set_member(minor_status,
48 	    member_oid, *oid_set, &t);
49 	if (major_status)
50 		return (major_status);
51 	if (t)
52 		return (GSS_S_COMPLETE);
53 
54 	new_elements = malloc((set->count + 1) * sizeof(gss_OID_desc));
55 	if (!new_elements) {
56 		*minor_status = ENOMEM;
57 		return (GSS_S_FAILURE);
58 	}
59 
60 	new_oid = &new_elements[set->count];
61 	new_oid->elements = malloc(member_oid->length);
62 	if (!new_oid->elements) {
63 		free(new_elements);
64 		return (GSS_S_FAILURE);
65 	}
66 	new_oid->length = member_oid->length;
67 	memcpy(new_oid->elements, member_oid->elements, member_oid->length);
68 
69 	if (set->elements) {
70 		memcpy(new_elements, set->elements,
71 		    set->count * sizeof(gss_OID_desc));
72 		free(set->elements);
73 	}
74 	set->elements = new_elements;
75 	set->count++;
76 
77 	return (GSS_S_COMPLETE);
78 }
79