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 /* $FreeBSD$ */
35
36 #include <gssapi/gssapi.h>
37 #include <errno.h>
38 #include <stdlib.h>
39 #include <string.h>
40
41 /* RCSID("$Id: gss_buffer_set.c 18885 2006-10-24 21:53:02Z lha $"); */
42
43 OM_uint32
gss_create_empty_buffer_set(OM_uint32 * minor_status,gss_buffer_set_t * buffer_set)44 gss_create_empty_buffer_set(OM_uint32 * minor_status,
45 gss_buffer_set_t *buffer_set)
46 {
47 gss_buffer_set_t set;
48
49 set = (gss_buffer_set_desc *) malloc(sizeof(*set));
50 if (set == GSS_C_NO_BUFFER_SET) {
51 *minor_status = ENOMEM;
52 return (GSS_S_FAILURE);
53 }
54
55 set->count = 0;
56 set->elements = NULL;
57
58 *buffer_set = set;
59
60 *minor_status = 0;
61 return (GSS_S_COMPLETE);
62 }
63
64 OM_uint32
gss_add_buffer_set_member(OM_uint32 * minor_status,const gss_buffer_t member_buffer,gss_buffer_set_t * buffer_set)65 gss_add_buffer_set_member(OM_uint32 * minor_status,
66 const gss_buffer_t member_buffer, gss_buffer_set_t *buffer_set)
67 {
68 gss_buffer_set_t set;
69 gss_buffer_t p;
70 OM_uint32 ret;
71
72 if (*buffer_set == GSS_C_NO_BUFFER_SET) {
73 ret = gss_create_empty_buffer_set(minor_status,
74 buffer_set);
75 if (ret) {
76 return (ret);
77 }
78 }
79
80 set = *buffer_set;
81 set->elements = reallocarray(set->elements, set->count + 1,
82 sizeof(set->elements[0]));
83 if (set->elements == NULL) {
84 *minor_status = ENOMEM;
85 return (GSS_S_FAILURE);
86 }
87
88 p = &set->elements[set->count];
89
90 p->value = malloc(member_buffer->length);
91 if (p->value == NULL) {
92 *minor_status = ENOMEM;
93 return (GSS_S_FAILURE);
94 }
95 memcpy(p->value, member_buffer->value, member_buffer->length);
96 p->length = member_buffer->length;
97
98 set->count++;
99
100 *minor_status = 0;
101 return (GSS_S_COMPLETE);
102 }
103
104 OM_uint32
gss_release_buffer_set(OM_uint32 * minor_status,gss_buffer_set_t * buffer_set)105 gss_release_buffer_set(OM_uint32 * minor_status, gss_buffer_set_t *buffer_set)
106 {
107 size_t i;
108 OM_uint32 minor;
109
110 *minor_status = 0;
111
112 if (*buffer_set == GSS_C_NO_BUFFER_SET)
113 return (GSS_S_COMPLETE);
114
115 for (i = 0; i < (*buffer_set)->count; i++)
116 gss_release_buffer(&minor, &((*buffer_set)->elements[i]));
117
118 free((*buffer_set)->elements);
119
120 (*buffer_set)->elements = NULL;
121 (*buffer_set)->count = 0;
122
123 free(*buffer_set);
124 *buffer_set = GSS_C_NO_BUFFER_SET;
125
126 return (GSS_S_COMPLETE);
127 }
128
129