summaryrefslogtreecommitdiff
path: root/third_party/heimdal/lib/gssapi/mech/gss_names.c
blob: 729e7f2ad7dbaacbfd02fa5bad95bf10407f672e (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
/*-
 * Copyright (c) 2005 Doug Rabson
 * All rights reserved.
 *
 * Portions Copyright (c) 2009 Apple Inc. All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 *	$FreeBSD: src/lib/libgssapi/gss_names.c,v 1.1 2005/12/29 14:40:20 dfr Exp $
 */

#include "mech_locl.h"

gss_name_t
_gss_mg_get_underlying_mech_name(gss_name_t name,
				 gss_const_OID mech)
{
	struct _gss_name *n = (struct _gss_name *)name;
	struct _gss_mechanism_name *mn;

	HEIM_TAILQ_FOREACH(mn, &n->gn_mn, gmn_link) {
		if (gss_oid_equal(mech, mn->gmn_mech_oid))
			return mn->gmn_name;
	}
	return GSS_C_NO_NAME;
}

OM_uint32
_gss_find_mn(OM_uint32 *minor_status,
	     struct _gss_name *name,
	     gss_const_OID mech,
	     struct _gss_mechanism_name ** output_mn)
{
	OM_uint32 major_status;
	gssapi_mech_interface m;
	struct _gss_mechanism_name *mn;

	*output_mn = NULL;

	/* null names are ok, some mechs might not have names */
	if (name == NULL)
	    return GSS_S_COMPLETE;

	HEIM_TAILQ_FOREACH(mn, &name->gn_mn, gmn_link) {
		if (gss_oid_equal(mech, mn->gmn_mech_oid))
			break;
	}

	if (!mn) {
		/*
		 * If this name is canonical (i.e. there is only an
		 * MN but it is from a different mech), give up now.
		 */
		if (!name->gn_value.value)
			return GSS_S_BAD_NAME;

		m = __gss_get_mechanism(mech);
		if (!m || !m->gm_import_name)
			return (GSS_S_BAD_MECH);

		mn = malloc(sizeof(struct _gss_mechanism_name));
		if (!mn)
			return GSS_S_FAILURE;

		major_status = m->gm_import_name(minor_status,
		    &name->gn_value,
		    name->gn_type,
		    &mn->gmn_name);
		if (major_status != GSS_S_COMPLETE) {
			_gss_mg_error(m, *minor_status);
			free(mn);
			return major_status;
		}

		mn->gmn_mech = m;
		mn->gmn_mech_oid = &m->gm_mech_oid;
		HEIM_TAILQ_INSERT_TAIL(&name->gn_mn, mn, gmn_link);
	}
	*output_mn = mn;
	return 0;
}


/*
 * Make a name from an MN.
 */
struct _gss_name *
_gss_create_name(gss_name_t new_mn,
		 struct gssapi_mech_interface_desc *m)
{
	struct _gss_name *name;
	struct _gss_mechanism_name *mn;

	name = calloc(1, sizeof(struct _gss_name));
	if (!name)
		return (0);

	HEIM_TAILQ_INIT(&name->gn_mn);

	if (new_mn) {
		mn = malloc(sizeof(struct _gss_mechanism_name));
		if (!mn) {
			free(name);
			return (0);
		}

		mn->gmn_mech = m;
		mn->gmn_mech_oid = &m->gm_mech_oid;
		mn->gmn_name = new_mn;
		HEIM_TAILQ_INSERT_TAIL(&name->gn_mn, mn, gmn_link);
	}

	return (name);
}

/*
 *
 */

void
_gss_mg_release_name(struct _gss_name *name)
{
	OM_uint32 junk;
	struct _gss_mechanism_name *mn, *next;

	gss_release_oid(&junk, &name->gn_type);

	HEIM_TAILQ_FOREACH_SAFE(mn, &name->gn_mn, gmn_link, next) {
		HEIM_TAILQ_REMOVE(&name->gn_mn, mn, gmn_link);
		mn->gmn_mech->gm_release_name(&junk, &mn->gmn_name);
		free(mn);
	}
	gss_release_buffer(&junk, &name->gn_value);
	free(name);
}

void
_gss_mg_check_name(gss_const_name_t name)
{
	if (name == NULL) return;
}

/*
 *
 */

OM_uint32
_gss_mech_import_name(OM_uint32 * minor_status,
		      gss_const_OID mech,
		      struct _gss_name_type *names,
		      const gss_buffer_t input_name_buffer,
		      gss_const_OID input_name_type,
		      gss_name_t *output_name)
{
    struct _gss_name_type *name;
    gss_buffer_t name_buffer = input_name_buffer;
    gss_buffer_desc export_name;

    *minor_status = 0;

    if (output_name == NULL)
	return GSS_S_CALL_INACCESSIBLE_WRITE;

    *output_name = GSS_C_NO_NAME;

    /*
     * If its a exported name, strip of the mech glue.
     */

    if (gss_oid_equal(input_name_type, GSS_C_NT_EXPORT_NAME)) {
	unsigned char *p;
	uint32_t length;

	if (name_buffer->length < 10 + mech->length)
	    return GSS_S_BAD_NAME;

	/* TOK, MECH_OID_LEN, DER(MECH_OID), NAME_LEN, NAME */

	p = name_buffer->value;

	if (memcmp(&p[0], "\x04\x01\x00", 3) != 0 ||
	    p[3] != mech->length + 2 ||
	    p[4] != 0x06 ||
	    p[5] != mech->length ||
	    memcmp(&p[6], mech->elements, mech->length) != 0)
	    return GSS_S_BAD_NAME;

	p += 6 + mech->length;

	length = p[0] << 24 | p[1] << 16 | p[2] << 8 | p[3];
	p += 4;

	if (length > name_buffer->length - 10 - mech->length)
	    return GSS_S_BAD_NAME;

	/*
	 * Point this to the mech specific name part, don't modifity
	 * orignal input_name_buffer.
	 */

	export_name.length = length;
	export_name.value = p;

	name_buffer = &export_name;
    }

    for (name = names; name->gnt_parse != NULL; name++) {
	if (gss_oid_equal(input_name_type, name->gnt_name_type)
	    || (name->gnt_name_type == GSS_C_NO_OID && input_name_type == GSS_C_NO_OID))
	    return name->gnt_parse(minor_status, mech, name_buffer,
				   input_name_type, output_name);
    }

    return GSS_S_BAD_NAMETYPE;
}

OM_uint32
_gss_mech_inquire_names_for_mech(OM_uint32 * minor_status,
				 struct _gss_name_type *names,
				 gss_OID_set *name_types)
{
    struct _gss_name_type *name;
    OM_uint32 ret, junk;

    ret = gss_create_empty_oid_set(minor_status, name_types);
    if (ret != GSS_S_COMPLETE)
	return ret;

    for (name = names; name->gnt_parse != NULL; name++) {
	if (name->gnt_name_type == GSS_C_NO_OID)
	    continue;
	ret = gss_add_oid_set_member(minor_status,
				     name->gnt_name_type,
				     name_types);
	if (ret != GSS_S_COMPLETE)
	    break;
    }

    if (ret != GSS_S_COMPLETE)
	gss_release_oid_set(&junk, name_types);
	
    return GSS_S_COMPLETE;
}