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>
34 #include "mech_switch.h"
39 gss_inquire_cred(OM_uint32 *minor_status,
40 const gss_cred_id_t cred_handle,
43 gss_cred_usage_t *cred_usage,
44 gss_OID_set *mechanisms)
46 OM_uint32 major_status;
47 struct _gss_mech_switch *m;
48 struct _gss_cred *cred = (struct _gss_cred *) cred_handle;
49 struct _gss_mechanism_cred *mc;
50 struct _gss_name *name;
51 struct _gss_mechanism_name *mn;
52 OM_uint32 min_lifetime;
63 name = malloc(sizeof(struct _gss_name));
65 *minor_status = ENOMEM;
66 return (GSS_S_FAILURE);
68 memset(name, 0, sizeof(struct _gss_name));
69 SLIST_INIT(&name->gn_mn);
75 major_status = gss_create_empty_oid_set(minor_status,
79 return (major_status);
83 min_lifetime = GSS_C_INDEFINITE;
85 SLIST_FOREACH(mc, &cred->gc_mc, gmc_link) {
87 OM_uint32 mc_lifetime;
89 major_status = mc->gmc_mech->gm_inquire_cred(minor_status,
90 mc->gmc_cred, &mc_name, &mc_lifetime, NULL, NULL);
95 mn = malloc(sizeof(struct _gss_mechanism_name));
97 mc->gmc_mech->gm_release_name(minor_status,
101 mn->gmn_mech = mc->gmc_mech;
102 mn->gmn_mech_oid = mc->gmc_mech_oid;
103 mn->gmn_name = mc_name;
104 SLIST_INSERT_HEAD(&name->gn_mn, mn, gmn_link);
106 mc->gmc_mech->gm_release_name(minor_status,
110 if (mc_lifetime < min_lifetime)
111 min_lifetime = mc_lifetime;
114 gss_add_oid_set_member(minor_status,
115 mc->gmc_mech_oid, mechanisms);
118 SLIST_FOREACH(m, &_gss_mechs, gm_link) {
120 OM_uint32 mc_lifetime;
122 major_status = m->gm_inquire_cred(minor_status,
123 GSS_C_NO_CREDENTIAL, &mc_name, &mc_lifetime,
128 if (name && mc_name) {
130 sizeof(struct _gss_mechanism_name));
132 mc->gmc_mech->gm_release_name(
133 minor_status, &mc_name);
136 mn->gmn_mech = mc->gmc_mech;
137 mn->gmn_mech_oid = mc->gmc_mech_oid;
138 mn->gmn_name = mc_name;
139 SLIST_INSERT_HEAD(&name->gn_mn, mn, gmn_link);
140 } else if (mc_name) {
141 mc->gmc_mech->gm_release_name(minor_status,
145 if (mc_lifetime < min_lifetime)
146 min_lifetime = mc_lifetime;
149 gss_add_oid_set_member(minor_status,
150 &m->gm_mech_oid, mechanisms);
153 if ((*mechanisms)->count == 0) {
154 gss_release_oid_set(minor_status, mechanisms);
156 return (GSS_S_NO_CRED);
162 *name_ret = (gss_name_t) name;
164 *lifetime = min_lifetime;
165 if (cred && cred_usage)
166 *cred_usage = cred->gc_usage;
167 return (GSS_S_COMPLETE);