fix error case crasher
[heimdal.git] / lib / gssapi / mech / gss_mech_switch.c
blobd272958c3ef85ef140982bc1e6beeb76f7f85236
1 /*-
2 * Copyright (c) 2005 Doug Rabson
3 * All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24 * SUCH DAMAGE.
26 * $FreeBSD: src/lib/libgssapi/gss_mech_switch.c,v 1.2 2006/02/04 09:40:21 dfr Exp $
29 #include "mech_locl.h"
30 #include <heim_threads.h>
32 #ifndef _PATH_GSS_MECH
33 #define _PATH_GSS_MECH "/etc/gss/mech"
34 #endif
36 struct _gss_mech_switch_list _gss_mechs = { NULL } ;
37 gss_OID_set _gss_mech_oids;
38 static HEIMDAL_MUTEX _gss_mech_mutex = HEIMDAL_MUTEX_INITIALIZER;
41 * Convert a string containing an OID in 'dot' form
42 * (e.g. 1.2.840.113554.1.2.2) to a gss_OID.
44 static int
45 _gss_string_to_oid(const char* s, gss_OID oid)
47 int number_count, i, j;
48 size_t byte_count;
49 const char *p, *q;
50 char *res;
52 oid->length = 0;
53 oid->elements = NULL;
56 * First figure out how many numbers in the oid, then
57 * calculate the compiled oid size.
59 number_count = 0;
60 for (p = s; p; p = q) {
61 q = strchr(p, '.');
62 if (q) q = q + 1;
63 number_count++;
67 * The first two numbers are in the first byte and each
68 * subsequent number is encoded in a variable byte sequence.
70 if (number_count < 2)
71 return (EINVAL);
74 * We do this in two passes. The first pass, we just figure
75 * out the size. Second time around, we actually encode the
76 * number.
78 res = 0;
79 for (i = 0; i < 2; i++) {
80 byte_count = 0;
81 for (p = s, j = 0; p; p = q, j++) {
82 unsigned int number = 0;
85 * Find the end of this number.
87 q = strchr(p, '.');
88 if (q) q = q + 1;
91 * Read the number of of the string. Don't
92 * bother with anything except base ten.
94 while (*p && *p != '.') {
95 number = 10 * number + (*p - '0');
96 p++;
100 * Encode the number. The first two numbers
101 * are packed into the first byte. Subsequent
102 * numbers are encoded in bytes seven bits at
103 * a time with the last byte having the high
104 * bit set.
106 if (j == 0) {
107 if (res)
108 *res = number * 40;
109 } else if (j == 1) {
110 if (res) {
111 *res += number;
112 res++;
114 byte_count++;
115 } else if (j >= 2) {
117 * The number is encoded in seven bit chunks.
119 unsigned int t;
120 unsigned int bytes;
122 bytes = 0;
123 for (t = number; t; t >>= 7)
124 bytes++;
125 if (bytes == 0) bytes = 1;
126 while (bytes) {
127 if (res) {
128 int bit = 7*(bytes-1);
130 *res = (number >> bit) & 0x7f;
131 if (bytes != 1)
132 *res |= 0x80;
133 res++;
135 byte_count++;
136 bytes--;
140 if (!res) {
141 res = malloc(byte_count);
142 if (!res)
143 return (ENOMEM);
144 oid->length = byte_count;
145 oid->elements = res;
149 return (0);
152 #define SYM(name) \
153 do { \
154 m->gm_mech.gm_ ## name = dlsym(so, "gss_" #name); \
155 if (!m->gm_mech.gm_ ## name) { \
156 fprintf(stderr, "can't find symbol gss_" #name "\n"); \
157 goto bad; \
159 } while (0)
161 #define OPTSYM(name) \
162 do { \
163 m->gm_mech.gm_ ## name = dlsym(so, "gss_" #name); \
164 } while (0)
166 #define OPTSPISYM(name) \
167 do { \
168 m->gm_mech.gm_ ## name = dlsym(so, "gssspi_" #name); \
169 } while (0)
171 #define COMPATSYM(name) \
172 do { \
173 m->gm_mech.gm_compat->gmc_ ## name = dlsym(so, "gss_" #name); \
174 } while (0)
179 static int
180 add_builtin(gssapi_mech_interface mech)
182 struct _gss_mech_switch *m;
183 OM_uint32 minor_status;
185 /* not registering any mech is ok */
186 if (mech == NULL)
187 return 0;
189 m = calloc(1, sizeof(*m));
190 if (m == NULL)
191 return ENOMEM;
192 m->gm_so = NULL;
193 m->gm_mech = *mech;
194 m->gm_mech_oid = mech->gm_mech_oid; /* XXX */
195 gss_add_oid_set_member(&minor_status,
196 &m->gm_mech.gm_mech_oid, &_gss_mech_oids);
198 /* pick up the oid sets of names */
200 if (m->gm_mech.gm_inquire_names_for_mech)
201 (*m->gm_mech.gm_inquire_names_for_mech)(&minor_status,
202 &m->gm_mech.gm_mech_oid, &m->gm_name_types);
204 if (m->gm_name_types == NULL)
205 gss_create_empty_oid_set(&minor_status, &m->gm_name_types);
207 HEIM_SLIST_INSERT_HEAD(&_gss_mechs, m, gm_link);
208 return 0;
212 * Load the mechanisms file (/etc/gss/mech).
214 void
215 _gss_load_mech(void)
217 OM_uint32 major_status, minor_status;
218 FILE *fp;
219 char buf[256];
220 char *p;
221 char *name, *oid, *lib, *kobj;
222 struct _gss_mech_switch *m;
223 void *so;
224 gss_OID_desc mech_oid;
225 int found;
228 HEIMDAL_MUTEX_lock(&_gss_mech_mutex);
230 if (HEIM_SLIST_FIRST(&_gss_mechs)) {
231 HEIMDAL_MUTEX_unlock(&_gss_mech_mutex);
232 return;
235 major_status = gss_create_empty_oid_set(&minor_status,
236 &_gss_mech_oids);
237 if (major_status) {
238 HEIMDAL_MUTEX_unlock(&_gss_mech_mutex);
239 return;
242 add_builtin(__gss_krb5_initialize());
243 add_builtin(__gss_spnego_initialize());
244 add_builtin(__gss_ntlm_initialize());
246 #ifdef HAVE_DLOPEN
247 fp = fopen(_PATH_GSS_MECH, "r");
248 if (!fp) {
249 HEIMDAL_MUTEX_unlock(&_gss_mech_mutex);
250 return;
252 rk_cloexec_file(fp);
254 while (fgets(buf, sizeof(buf), fp)) {
255 _gss_mo_init *mi;
257 if (*buf == '#')
258 continue;
259 p = buf;
260 name = strsep(&p, "\t\n ");
261 if (p) while (isspace((unsigned char)*p)) p++;
262 oid = strsep(&p, "\t\n ");
263 if (p) while (isspace((unsigned char)*p)) p++;
264 lib = strsep(&p, "\t\n ");
265 if (p) while (isspace((unsigned char)*p)) p++;
266 kobj = strsep(&p, "\t\n ");
267 if (!name || !oid || !lib || !kobj)
268 continue;
270 if (_gss_string_to_oid(oid, &mech_oid))
271 continue;
274 * Check for duplicates, already loaded mechs.
276 found = 0;
277 HEIM_SLIST_FOREACH(m, &_gss_mechs, gm_link) {
278 if (gss_oid_equal(&m->gm_mech.gm_mech_oid, &mech_oid)) {
279 found = 1;
280 free(mech_oid.elements);
281 break;
284 if (found)
285 continue;
287 #ifndef RTLD_LOCAL
288 #define RTLD_LOCAL 0
289 #endif
291 #ifndef RTLD_GROUP
292 #define RTLD_GROUP 0
293 #endif
295 so = dlopen(lib, RTLD_LAZY | RTLD_LOCAL | RTLD_GROUP);
296 if (so == NULL) {
297 /* fprintf(stderr, "dlopen: %s\n", dlerror()); */
298 goto bad;
301 m = calloc(1, sizeof(*m));
302 if (m == NULL)
303 goto bad;
305 m->gm_so = so;
306 m->gm_mech.gm_mech_oid = mech_oid;
307 m->gm_mech.gm_flags = 0;
308 m->gm_mech.gm_compat = calloc(1, sizeof(struct gss_mech_compat_desc_struct));
309 if (m->gm_mech.gm_compat == NULL)
310 goto bad;
312 major_status = gss_add_oid_set_member(&minor_status,
313 &m->gm_mech.gm_mech_oid, &_gss_mech_oids);
314 if (GSS_ERROR(major_status))
315 goto bad;
317 SYM(acquire_cred);
318 SYM(release_cred);
319 SYM(init_sec_context);
320 SYM(accept_sec_context);
321 SYM(process_context_token);
322 SYM(delete_sec_context);
323 SYM(context_time);
324 SYM(get_mic);
325 SYM(verify_mic);
326 SYM(wrap);
327 SYM(unwrap);
328 SYM(display_status);
329 SYM(indicate_mechs);
330 SYM(compare_name);
331 SYM(display_name);
332 SYM(import_name);
333 SYM(export_name);
334 SYM(release_name);
335 SYM(inquire_cred);
336 SYM(inquire_context);
337 SYM(wrap_size_limit);
338 SYM(add_cred);
339 SYM(inquire_cred_by_mech);
340 SYM(export_sec_context);
341 SYM(import_sec_context);
342 SYM(inquire_names_for_mech);
343 SYM(inquire_mechs_for_name);
344 SYM(canonicalize_name);
345 SYM(duplicate_name);
346 OPTSYM(inquire_cred_by_oid);
347 OPTSYM(inquire_sec_context_by_oid);
348 OPTSYM(set_sec_context_option);
349 OPTSPISYM(set_cred_option);
350 OPTSYM(pseudo_random);
351 OPTSYM(wrap_iov);
352 OPTSYM(unwrap_iov);
353 OPTSYM(wrap_iov_length);
354 OPTSYM(display_name_ext);
355 OPTSYM(inquire_name);
356 OPTSYM(get_name_attribute);
357 OPTSYM(set_name_attribute);
358 OPTSYM(delete_name_attribute);
359 OPTSYM(export_name_composite);
360 OPTSPISYM(acquire_cred_with_password);
361 OPTSYM(add_cred_with_password);
362 OPTSYM(pname_to_uid);
363 OPTSYM(userok);
365 mi = dlsym(so, "gss_mo_init");
366 if (mi != NULL) {
367 major_status = mi(&minor_status, &mech_oid,
368 &m->gm_mech.gm_mo, &m->gm_mech.gm_mo_num);
369 if (GSS_ERROR(major_status))
370 goto bad;
371 } else {
372 /* API-as-SPI compatibility */
373 COMPATSYM(inquire_saslname_for_mech);
374 COMPATSYM(inquire_mech_for_saslname);
375 COMPATSYM(inquire_attrs_for_mech);
378 /* pick up the oid sets of names */
380 if (m->gm_mech.gm_inquire_names_for_mech)
381 (*m->gm_mech.gm_inquire_names_for_mech)(&minor_status,
382 &m->gm_mech.gm_mech_oid, &m->gm_name_types);
384 if (m->gm_name_types == NULL)
385 gss_create_empty_oid_set(&minor_status, &m->gm_name_types);
387 HEIM_SLIST_INSERT_HEAD(&_gss_mechs, m, gm_link);
388 continue;
390 bad:
391 if (m != NULL) {
392 free(m->gm_mech.gm_compat);
393 free(m->gm_mech.gm_mech_oid.elements);
394 free(m);
396 dlclose(so);
397 continue;
399 fclose(fp);
400 #endif
401 HEIMDAL_MUTEX_unlock(&_gss_mech_mutex);
404 gssapi_mech_interface
405 __gss_get_mechanism(gss_const_OID mech)
407 struct _gss_mech_switch *m;
409 _gss_load_mech();
410 HEIM_SLIST_FOREACH(m, &_gss_mechs, gm_link) {
411 if (gss_oid_equal(&m->gm_mech.gm_mech_oid, mech))
412 return &m->gm_mech;
414 return NULL;