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