xref: /freebsd/lib/libgssapi/gss_buffer_set.c (revision 783d3ff6d7fae619db8a7990b8a6387de0c677b5)
1 /*-
2  * SPDX-License-Identifier: BSD-3-Clause
3  *
4  * Copyright (c) 2004, PADL Software Pty Ltd.
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  *
11  * 1. Redistributions of source code must retain the above copyright
12  *    notice, this list of conditions and the following disclaimer.
13  *
14  * 2. Redistributions in binary form must reproduce the above copyright
15  *    notice, this list of conditions and the following disclaimer in the
16  *    documentation and/or other materials provided with the distribution.
17  *
18  * 3. Neither the name of PADL Software nor the names of its contributors
19  *    may be used to endorse or promote products derived from this software
20  *    without specific prior written permission.
21  *
22  * THIS SOFTWARE IS PROVIDED BY PADL SOFTWARE AND CONTRIBUTORS ``AS IS'' AND
23  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25  * ARE DISCLAIMED.  IN NO EVENT SHALL PADL SOFTWARE OR CONTRIBUTORS BE LIABLE
26  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32  * SUCH DAMAGE.
33  */
34 
35 #include <gssapi/gssapi.h>
36 #include <errno.h>
37 #include <stdlib.h>
38 #include <string.h>
39 
40 /* RCSID("$Id: gss_buffer_set.c 18885 2006-10-24 21:53:02Z lha $"); */
41 
42 OM_uint32
43 gss_create_empty_buffer_set(OM_uint32 * minor_status,
44     gss_buffer_set_t *buffer_set)
45 {
46 	gss_buffer_set_t set;
47 
48 	set = (gss_buffer_set_desc *) malloc(sizeof(*set));
49 	if (set == GSS_C_NO_BUFFER_SET) {
50 		*minor_status = ENOMEM;
51 		return (GSS_S_FAILURE);
52 	}
53 
54 	set->count = 0;
55 	set->elements = NULL;
56 
57 	*buffer_set = set;
58 
59 	*minor_status = 0;
60 	return (GSS_S_COMPLETE);
61 }
62 
63 OM_uint32
64 gss_add_buffer_set_member(OM_uint32 * minor_status,
65     const gss_buffer_t member_buffer, gss_buffer_set_t *buffer_set)
66 {
67 	gss_buffer_set_t set;
68 	gss_buffer_t p;
69 	OM_uint32 ret;
70 
71 	if (*buffer_set == GSS_C_NO_BUFFER_SET) {
72 		ret = gss_create_empty_buffer_set(minor_status,
73 		    buffer_set);
74 		if (ret) {
75 			return (ret);
76 		}
77 	}
78 
79 	set = *buffer_set;
80 	set->elements = reallocarray(set->elements, set->count + 1,
81 	    sizeof(set->elements[0]));
82 	if (set->elements == NULL) {
83 		*minor_status = ENOMEM;
84 		return (GSS_S_FAILURE);
85 	}
86 
87 	p = &set->elements[set->count];
88 
89 	p->value = malloc(member_buffer->length);
90 	if (p->value == NULL) {
91 		*minor_status = ENOMEM;
92 		return (GSS_S_FAILURE);
93 	}
94 	memcpy(p->value, member_buffer->value, member_buffer->length);
95 	p->length = member_buffer->length;
96 
97 	set->count++;
98 
99 	*minor_status = 0;
100 	return (GSS_S_COMPLETE);
101 }
102 
103 OM_uint32
104 gss_release_buffer_set(OM_uint32 * minor_status, gss_buffer_set_t *buffer_set)
105 {
106 	size_t i;
107 	OM_uint32 minor;
108 
109 	*minor_status = 0;
110 
111 	if (*buffer_set == GSS_C_NO_BUFFER_SET)
112 		return (GSS_S_COMPLETE);
113 
114 	for (i = 0; i < (*buffer_set)->count; i++)
115 		gss_release_buffer(&minor, &((*buffer_set)->elements[i]));
116 
117 	free((*buffer_set)->elements);
118 
119 	(*buffer_set)->elements = NULL;
120 	(*buffer_set)->count = 0;
121 
122 	free(*buffer_set);
123 	*buffer_set = GSS_C_NO_BUFFER_SET;
124 
125 	return (GSS_S_COMPLETE);
126 }
127 
128