2 * Copyright (c) 2005 Doug Rabson
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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
29 #include <gssapi/gssapi.h>
37 #include "mech_switch.h"
40 #ifndef _PATH_GSS_MECH
41 #define _PATH_GSS_MECH "/etc/gss/mech"
44 struct _gss_mech_switch_list _gss_mechs =
45 SLIST_HEAD_INITIALIZER(_gss_mechs);
46 gss_OID_set _gss_mech_oids;
49 * Convert a string containing an OID in 'dot' form
50 * (e.g. 1.2.840.113554.1.2.2) to a gss_OID.
53 _gss_string_to_oid(const char* s, gss_OID oid)
55 int number_count, i, j;
64 * First figure out how many numbers in the oid, then
65 * calculate the compiled oid size.
68 for (p = s; p; p = q) {
75 * The first two numbers are in the first byte and each
76 * subsequent number is encoded in a variable byte sequence.
82 * We do this in two passes. The first pass, we just figure
83 * out the size. Second time around, we actually encode the
87 for (i = 0; i < 2; i++) {
89 for (p = s, j = 0; p; p = q, j++) {
90 unsigned int number = 0;
93 * Find the end of this number.
99 * Read the number of of the string. Don't
100 * bother with anything except base ten.
102 while (*p && *p != '.') {
103 number = 10 * number + (*p - '0');
108 * Encode the number. The first two numbers
109 * are packed into the first byte. Subsequent
110 * numbers are encoded in bytes seven bits at
111 * a time with the last byte having the high
125 * The number is encoded in seven bit chunks.
131 for (t = number; t; t >>= 7)
133 if (bytes == 0) bytes = 1;
136 int bit = 7*(bytes-1);
138 *res = (number >> bit) & 0x7f;
149 res = malloc(byte_count);
152 oid->length = byte_count;
163 snprintf(buf, sizeof(buf), "%s_%s", \
164 m->gm_name_prefix, #name); \
165 m->gm_ ## name = dlsym(so, buf); \
166 if (!m->gm_ ## name) { \
167 fprintf(stderr, "can't find symbol %s\n", buf); \
172 #define OPTSYM(name) \
174 snprintf(buf, sizeof(buf), "%s_%s", \
175 m->gm_name_prefix, #name); \
176 m->gm_ ## name = dlsym(so, buf); \
180 * Load the mechanisms file (/etc/gss/mech).
185 OM_uint32 major_status, minor_status;
189 char *name, *oid, *lib, *kobj;
190 struct _gss_mech_switch *m;
193 const char *(*prefix_fn)(void);
195 if (SLIST_FIRST(&_gss_mechs))
198 major_status = gss_create_empty_oid_set(&minor_status,
203 fp = fopen(_PATH_GSS_MECH, "r");
205 perror(_PATH_GSS_MECH);
210 while (fgets(buf, sizeof(buf), fp)) {
214 name = strsep(&p, "\t\n ");
215 if (p) while (isspace(*p)) p++;
216 oid = strsep(&p, "\t\n ");
217 if (p) while (isspace(*p)) p++;
218 lib = strsep(&p, "\t\n ");
219 if (p) while (isspace(*p)) p++;
220 kobj = strsep(&p, "\t\n ");
221 if (!name || !oid || !lib || !kobj)
224 so = dlopen(lib, RTLD_LOCAL);
226 fprintf(stderr, "dlopen: %s\n", dlerror());
230 m = malloc(sizeof(struct _gss_mech_switch));
234 if (_gss_string_to_oid(oid, &m->gm_mech_oid)) {
239 prefix_fn = (const char *(*)(void))
240 dlsym(so, "_gss_name_prefix");
242 m->gm_name_prefix = prefix_fn();
244 m->gm_name_prefix = "gss";
246 major_status = gss_add_oid_set_member(&minor_status,
247 &m->gm_mech_oid, &_gss_mech_oids);
249 free(m->gm_mech_oid.elements);
256 SYM(init_sec_context);
257 SYM(accept_sec_context);
258 SYM(process_context_token);
259 SYM(delete_sec_context);
266 OPTSYM(indicate_mechs);
273 SYM(inquire_context);
274 SYM(wrap_size_limit);
276 SYM(inquire_cred_by_mech);
277 SYM(export_sec_context);
278 SYM(import_sec_context);
279 SYM(inquire_names_for_mech);
280 SYM(inquire_mechs_for_name);
281 SYM(canonicalize_name);
283 OPTSYM(inquire_sec_context_by_oid);
284 OPTSYM(inquire_cred_by_oid);
285 OPTSYM(set_sec_context_option);
286 OPTSYM(set_cred_option);
287 OPTSYM(pseudo_random);
288 OPTSYM(pname_to_uid);
290 SLIST_INSERT_HEAD(&_gss_mechs, m, gm_link);
295 free(m->gm_mech_oid.elements);
303 struct _gss_mech_switch *
304 _gss_find_mech_switch(gss_OID mech)
306 struct _gss_mech_switch *m;
309 SLIST_FOREACH(m, &_gss_mechs, gm_link) {
310 if (gss_oid_equal(&m->gm_mech_oid, mech))