1c0b9f4feSDoug Rabson /*- 2c0b9f4feSDoug Rabson * Copyright (c) 2005 Doug Rabson 3c0b9f4feSDoug Rabson * All rights reserved. 4c0b9f4feSDoug Rabson * 5c0b9f4feSDoug Rabson * Redistribution and use in source and binary forms, with or without 6c0b9f4feSDoug Rabson * modification, are permitted provided that the following conditions 7c0b9f4feSDoug Rabson * are met: 8c0b9f4feSDoug Rabson * 1. Redistributions of source code must retain the above copyright 9c0b9f4feSDoug Rabson * notice, this list of conditions and the following disclaimer. 10c0b9f4feSDoug Rabson * 2. Redistributions in binary form must reproduce the above copyright 11c0b9f4feSDoug Rabson * notice, this list of conditions and the following disclaimer in the 12c0b9f4feSDoug Rabson * documentation and/or other materials provided with the distribution. 13c0b9f4feSDoug Rabson * 14c0b9f4feSDoug Rabson * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 15c0b9f4feSDoug Rabson * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 16c0b9f4feSDoug Rabson * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 17c0b9f4feSDoug Rabson * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 18c0b9f4feSDoug Rabson * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19c0b9f4feSDoug Rabson * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20c0b9f4feSDoug Rabson * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21c0b9f4feSDoug Rabson * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22c0b9f4feSDoug Rabson * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23c0b9f4feSDoug Rabson * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24c0b9f4feSDoug Rabson * SUCH DAMAGE. 25c0b9f4feSDoug Rabson * 26c0b9f4feSDoug Rabson * $FreeBSD$ 27c0b9f4feSDoug Rabson */ 28c0b9f4feSDoug Rabson 29c0b9f4feSDoug Rabson #include <gssapi/gssapi.h> 30c0b9f4feSDoug Rabson #include <dlfcn.h> 31c0b9f4feSDoug Rabson #include <errno.h> 32c0b9f4feSDoug Rabson #include <stdio.h> 33c0b9f4feSDoug Rabson #include <stdlib.h> 34c0b9f4feSDoug Rabson #include <string.h> 35c0b9f4feSDoug Rabson 36c0b9f4feSDoug Rabson #include "mech_switch.h" 37c0b9f4feSDoug Rabson #include "utils.h" 38c0b9f4feSDoug Rabson 39c0b9f4feSDoug Rabson #ifndef _PATH_GSS_MECH 40c0b9f4feSDoug Rabson #define _PATH_GSS_MECH "/etc/gss/mech" 41c0b9f4feSDoug Rabson #endif 42c0b9f4feSDoug Rabson 43c0b9f4feSDoug Rabson struct _gss_mech_switch_list _gss_mechs = 44c0b9f4feSDoug Rabson SLIST_HEAD_INITIALIZER(&_gss_mechs); 45c0b9f4feSDoug Rabson gss_OID_set _gss_mech_oids; 46c0b9f4feSDoug Rabson 47c0b9f4feSDoug Rabson /* 48c0b9f4feSDoug Rabson * Convert a string containing an OID in 'dot' form 49c0b9f4feSDoug Rabson * (e.g. 1.2.840.113554.1.2.2) to a gss_OID. 50c0b9f4feSDoug Rabson */ 51c0b9f4feSDoug Rabson static int 52c0b9f4feSDoug Rabson _gss_string_to_oid(const char* s, gss_OID oid) 53c0b9f4feSDoug Rabson { 54c0b9f4feSDoug Rabson int number_count, i, j; 55c0b9f4feSDoug Rabson int byte_count; 56c0b9f4feSDoug Rabson const char *p, *q; 57c0b9f4feSDoug Rabson char *res; 58c0b9f4feSDoug Rabson 59c0b9f4feSDoug Rabson /* 60c0b9f4feSDoug Rabson * First figure out how many numbers in the oid, then 61c0b9f4feSDoug Rabson * calculate the compiled oid size. 62c0b9f4feSDoug Rabson */ 63c0b9f4feSDoug Rabson number_count = 0; 64c0b9f4feSDoug Rabson for (p = s; p; p = q) { 65c0b9f4feSDoug Rabson q = strchr(p, '.'); 66c0b9f4feSDoug Rabson if (q) q = q + 1; 67c0b9f4feSDoug Rabson number_count++; 68c0b9f4feSDoug Rabson } 69c0b9f4feSDoug Rabson 70c0b9f4feSDoug Rabson /* 71c0b9f4feSDoug Rabson * The first two numbers are in the first byte and each 72c0b9f4feSDoug Rabson * subsequent number is encoded in a variable byte sequence. 73c0b9f4feSDoug Rabson */ 74c0b9f4feSDoug Rabson if (number_count < 2) 75c0b9f4feSDoug Rabson return (EINVAL); 76c0b9f4feSDoug Rabson 77c0b9f4feSDoug Rabson /* 78c0b9f4feSDoug Rabson * We do this in two passes. The first pass, we just figure 79c0b9f4feSDoug Rabson * out the size. Second time around, we actually encode the 80c0b9f4feSDoug Rabson * number. 81c0b9f4feSDoug Rabson */ 82c0b9f4feSDoug Rabson res = 0; 83c0b9f4feSDoug Rabson for (i = 0; i < 2; i++) { 84c0b9f4feSDoug Rabson byte_count = 0; 85c0b9f4feSDoug Rabson for (p = s, j = 0; p; p = q, j++) { 86c0b9f4feSDoug Rabson unsigned int number = 0; 87c0b9f4feSDoug Rabson 88c0b9f4feSDoug Rabson /* 89c0b9f4feSDoug Rabson * Find the end of this number. 90c0b9f4feSDoug Rabson */ 91c0b9f4feSDoug Rabson q = strchr(p, '.'); 92c0b9f4feSDoug Rabson if (q) q = q + 1; 93c0b9f4feSDoug Rabson 94c0b9f4feSDoug Rabson /* 95c0b9f4feSDoug Rabson * Read the number of of the string. Don't 96c0b9f4feSDoug Rabson * bother with anything except base ten. 97c0b9f4feSDoug Rabson */ 98c0b9f4feSDoug Rabson while (*p && *p != '.') { 99c0b9f4feSDoug Rabson number = 10 * number + (*p - '0'); 100c0b9f4feSDoug Rabson p++; 101c0b9f4feSDoug Rabson } 102c0b9f4feSDoug Rabson 103c0b9f4feSDoug Rabson /* 104c0b9f4feSDoug Rabson * Encode the number. The first two numbers 105c0b9f4feSDoug Rabson * are packed into the first byte. Subsequent 106c0b9f4feSDoug Rabson * numbers are encoded in bytes seven bits at 107c0b9f4feSDoug Rabson * a time with the last byte having the high 108c0b9f4feSDoug Rabson * bit set. 109c0b9f4feSDoug Rabson */ 110c0b9f4feSDoug Rabson if (j == 0) { 111c0b9f4feSDoug Rabson if (res) 112c0b9f4feSDoug Rabson *res = number * 40; 113c0b9f4feSDoug Rabson } else if (j == 1) { 114c0b9f4feSDoug Rabson if (res) { 115c0b9f4feSDoug Rabson *res += number; 116c0b9f4feSDoug Rabson res++; 117c0b9f4feSDoug Rabson } 118c0b9f4feSDoug Rabson byte_count++; 119c0b9f4feSDoug Rabson } else if (j >= 2) { 120c0b9f4feSDoug Rabson /* 121c0b9f4feSDoug Rabson * The number is encoded in seven bit chunks. 122c0b9f4feSDoug Rabson */ 123c0b9f4feSDoug Rabson unsigned int t; 124c0b9f4feSDoug Rabson int bytes; 125c0b9f4feSDoug Rabson 126c0b9f4feSDoug Rabson bytes = 0; 127c0b9f4feSDoug Rabson for (t = number; t; t >>= 7) 128c0b9f4feSDoug Rabson bytes++; 129c0b9f4feSDoug Rabson if (bytes == 0) bytes = 1; 130c0b9f4feSDoug Rabson while (bytes) { 131c0b9f4feSDoug Rabson if (res) { 132c0b9f4feSDoug Rabson int bit = 7*(bytes-1); 133c0b9f4feSDoug Rabson 134c0b9f4feSDoug Rabson *res = (number >> bit) & 0x7f; 135c0b9f4feSDoug Rabson if (bytes != 1) 136c0b9f4feSDoug Rabson *res |= 0x80; 137c0b9f4feSDoug Rabson res++; 138c0b9f4feSDoug Rabson } 139c0b9f4feSDoug Rabson byte_count++; 140c0b9f4feSDoug Rabson bytes--; 141c0b9f4feSDoug Rabson } 142c0b9f4feSDoug Rabson } 143c0b9f4feSDoug Rabson } 144c0b9f4feSDoug Rabson if (!res) { 145c0b9f4feSDoug Rabson res = malloc(byte_count); 146c0b9f4feSDoug Rabson if (!res) 147c0b9f4feSDoug Rabson return (ENOMEM); 148c0b9f4feSDoug Rabson oid->length = byte_count; 149c0b9f4feSDoug Rabson oid->elements = res; 150c0b9f4feSDoug Rabson } 151c0b9f4feSDoug Rabson } 152c0b9f4feSDoug Rabson 153c0b9f4feSDoug Rabson return (0); 154c0b9f4feSDoug Rabson } 155c0b9f4feSDoug Rabson 156c0b9f4feSDoug Rabson #define SYM(name) \ 157c0b9f4feSDoug Rabson do { \ 158c0b9f4feSDoug Rabson m->gm_ ## name = dlsym(so, "gss_" #name); \ 159c0b9f4feSDoug Rabson if (!m->gm_ ## name) { \ 160c0b9f4feSDoug Rabson fprintf(stderr, "can't find symbol gss_" #name "\n"); \ 161c0b9f4feSDoug Rabson goto bad; \ 162c0b9f4feSDoug Rabson } \ 163c0b9f4feSDoug Rabson } while (0) 164c0b9f4feSDoug Rabson 165c0b9f4feSDoug Rabson #define OPTSYM(name) \ 166c0b9f4feSDoug Rabson do { \ 167c0b9f4feSDoug Rabson m->gm_ ## name = dlsym(so, "gss_" #name); \ 168c0b9f4feSDoug Rabson } while (0) 169c0b9f4feSDoug Rabson 170c0b9f4feSDoug Rabson #define OPTSYM2(symname, ourname) \ 171c0b9f4feSDoug Rabson do { \ 172c0b9f4feSDoug Rabson m->ourname = dlsym(so, #symname); \ 173c0b9f4feSDoug Rabson } while (0) 174c0b9f4feSDoug Rabson 175c0b9f4feSDoug Rabson /* 176c0b9f4feSDoug Rabson * Load the mechanisms file (/etc/gss/mech). 177c0b9f4feSDoug Rabson */ 178c0b9f4feSDoug Rabson void 179c0b9f4feSDoug Rabson _gss_load_mech(void) 180c0b9f4feSDoug Rabson { 181c0b9f4feSDoug Rabson OM_uint32 major_status, minor_status; 182c0b9f4feSDoug Rabson FILE *fp; 183c0b9f4feSDoug Rabson char buf[256]; 184c0b9f4feSDoug Rabson char *p; 185c0b9f4feSDoug Rabson char *name, *oid, *lib, *kobj; 186c0b9f4feSDoug Rabson struct _gss_mech_switch *m; 187c0b9f4feSDoug Rabson int count; 188c0b9f4feSDoug Rabson char **pp; 189c0b9f4feSDoug Rabson void *so; 190c0b9f4feSDoug Rabson 191c0b9f4feSDoug Rabson if (SLIST_FIRST(&_gss_mechs)) 192c0b9f4feSDoug Rabson return; 193c0b9f4feSDoug Rabson 194c0b9f4feSDoug Rabson major_status = gss_create_empty_oid_set(&minor_status, 195c0b9f4feSDoug Rabson &_gss_mech_oids); 196c0b9f4feSDoug Rabson if (major_status) 197c0b9f4feSDoug Rabson return; 198c0b9f4feSDoug Rabson 199c0b9f4feSDoug Rabson fp = fopen(_PATH_GSS_MECH, "r"); 200c0b9f4feSDoug Rabson if (!fp) { 201c0b9f4feSDoug Rabson perror(_PATH_GSS_MECH); 202c0b9f4feSDoug Rabson return; 203c0b9f4feSDoug Rabson } 204c0b9f4feSDoug Rabson 205c0b9f4feSDoug Rabson count = 0; 206c0b9f4feSDoug Rabson while (fgets(buf, sizeof(buf), fp)) { 207c0b9f4feSDoug Rabson if (*buf == '#') 208c0b9f4feSDoug Rabson continue; 209c0b9f4feSDoug Rabson p = buf; 210c0b9f4feSDoug Rabson name = strsep(&p, "\t\n "); 211c0b9f4feSDoug Rabson if (p) while (isspace(p)) p++; 212c0b9f4feSDoug Rabson oid = strsep(&p, "\t\n "); 213c0b9f4feSDoug Rabson if (p) while (isspace(p)) p++; 214c0b9f4feSDoug Rabson lib = strsep(&p, "\t\n "); 215c0b9f4feSDoug Rabson if (p) while (isspace(p)) p++; 216c0b9f4feSDoug Rabson kobj = strsep(&p, "\t\n "); 217c0b9f4feSDoug Rabson if (!name || !oid || !lib || !kobj) 218c0b9f4feSDoug Rabson continue; 219c0b9f4feSDoug Rabson 220c0b9f4feSDoug Rabson so = dlopen(lib, RTLD_LOCAL); 221c0b9f4feSDoug Rabson if (!so) { 222c0b9f4feSDoug Rabson fprintf(stderr, "dlopen: %s\n", dlerror()); 223c0b9f4feSDoug Rabson continue; 224c0b9f4feSDoug Rabson } 225c0b9f4feSDoug Rabson 226c0b9f4feSDoug Rabson m = malloc(sizeof(struct _gss_mech_switch)); 227c0b9f4feSDoug Rabson if (!m) 228c0b9f4feSDoug Rabson break; 229c0b9f4feSDoug Rabson m->gm_so = so; 230c0b9f4feSDoug Rabson if (_gss_string_to_oid(oid, &m->gm_mech_oid)) { 231c0b9f4feSDoug Rabson free(m); 232c0b9f4feSDoug Rabson continue; 233c0b9f4feSDoug Rabson } 234c0b9f4feSDoug Rabson 235c0b9f4feSDoug Rabson major_status = gss_add_oid_set_member(&minor_status, 236c0b9f4feSDoug Rabson &m->gm_mech_oid, &_gss_mech_oids); 237c0b9f4feSDoug Rabson if (major_status) { 238c0b9f4feSDoug Rabson free(m->gm_mech_oid.elements); 239c0b9f4feSDoug Rabson free(m); 240c0b9f4feSDoug Rabson continue; 241c0b9f4feSDoug Rabson } 242c0b9f4feSDoug Rabson 243c0b9f4feSDoug Rabson SYM(acquire_cred); 244c0b9f4feSDoug Rabson SYM(release_cred); 245c0b9f4feSDoug Rabson SYM(init_sec_context); 246c0b9f4feSDoug Rabson SYM(accept_sec_context); 247c0b9f4feSDoug Rabson SYM(process_context_token); 248c0b9f4feSDoug Rabson SYM(delete_sec_context); 249c0b9f4feSDoug Rabson SYM(context_time); 250c0b9f4feSDoug Rabson SYM(get_mic); 251c0b9f4feSDoug Rabson SYM(verify_mic); 252c0b9f4feSDoug Rabson SYM(wrap); 253c0b9f4feSDoug Rabson SYM(unwrap); 254c0b9f4feSDoug Rabson SYM(display_status); 255c0b9f4feSDoug Rabson SYM(indicate_mechs); 256c0b9f4feSDoug Rabson SYM(compare_name); 257c0b9f4feSDoug Rabson SYM(display_name); 258c0b9f4feSDoug Rabson SYM(import_name); 259c0b9f4feSDoug Rabson SYM(export_name); 260c0b9f4feSDoug Rabson SYM(release_name); 261c0b9f4feSDoug Rabson SYM(inquire_cred); 262c0b9f4feSDoug Rabson SYM(inquire_context); 263c0b9f4feSDoug Rabson SYM(wrap_size_limit); 264c0b9f4feSDoug Rabson SYM(add_cred); 265c0b9f4feSDoug Rabson SYM(inquire_cred_by_mech); 266c0b9f4feSDoug Rabson SYM(export_sec_context); 267c0b9f4feSDoug Rabson SYM(import_sec_context); 268c0b9f4feSDoug Rabson SYM(inquire_names_for_mech); 269c0b9f4feSDoug Rabson SYM(inquire_mechs_for_name); 270c0b9f4feSDoug Rabson SYM(canonicalize_name); 271c0b9f4feSDoug Rabson SYM(duplicate_name); 272c0b9f4feSDoug Rabson OPTSYM2(gsskrb5_register_acceptor_identity, 273c0b9f4feSDoug Rabson gm_krb5_register_acceptor_identity); 274c0b9f4feSDoug Rabson OPTSYM(krb5_copy_ccache); 275c0b9f4feSDoug Rabson OPTSYM(krb5_compat_des3_mic); 276c0b9f4feSDoug Rabson 277c0b9f4feSDoug Rabson SLIST_INSERT_HEAD(&_gss_mechs, m, gm_link); 278c0b9f4feSDoug Rabson count++; 279c0b9f4feSDoug Rabson continue; 280c0b9f4feSDoug Rabson 281c0b9f4feSDoug Rabson bad: 282c0b9f4feSDoug Rabson free(m->gm_mech_oid.elements); 283c0b9f4feSDoug Rabson free(m); 284c0b9f4feSDoug Rabson dlclose(so); 285c0b9f4feSDoug Rabson continue; 286c0b9f4feSDoug Rabson } 287c0b9f4feSDoug Rabson fclose(fp); 288c0b9f4feSDoug Rabson } 289c0b9f4feSDoug Rabson 290c0b9f4feSDoug Rabson struct _gss_mech_switch * 291c0b9f4feSDoug Rabson _gss_find_mech_switch(gss_OID mech) 292c0b9f4feSDoug Rabson { 293c0b9f4feSDoug Rabson struct _gss_mech_switch *m; 294c0b9f4feSDoug Rabson 295c0b9f4feSDoug Rabson _gss_load_mech(); 296c0b9f4feSDoug Rabson SLIST_FOREACH(m, &_gss_mechs, gm_link) { 297c0b9f4feSDoug Rabson if (_gss_oid_equal(&m->gm_mech_oid, mech)) 298c0b9f4feSDoug Rabson return m; 299c0b9f4feSDoug Rabson } 300c0b9f4feSDoug Rabson return (0); 301c0b9f4feSDoug Rabson } 302