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>
33 #include "mech_switch.h"
38 gss_inquire_cred(OM_uint32 *minor_status,
39 const gss_cred_id_t cred_handle,
42 gss_cred_usage_t *cred_usage,
43 gss_OID_set *mechanisms)
45 OM_uint32 major_status;
46 struct _gss_mech_switch *m;
47 struct _gss_cred *cred = (struct _gss_cred *) cred_handle;
48 struct _gss_mechanism_cred *mc;
49 struct _gss_name *name;
50 struct _gss_mechanism_name *mn;
51 OM_uint32 min_lifetime;
62 name = malloc(sizeof(struct _gss_name));
64 *minor_status = ENOMEM;
65 return (GSS_S_FAILURE);
67 memset(name, 0, sizeof(struct _gss_name));
68 SLIST_INIT(&name->gn_mn);
74 major_status = gss_create_empty_oid_set(minor_status,
78 return (major_status);
82 min_lifetime = GSS_C_INDEFINITE;
84 SLIST_FOREACH(mc, &cred->gc_mc, gmc_link) {
86 OM_uint32 mc_lifetime;
88 major_status = mc->gmc_mech->gm_inquire_cred(minor_status,
89 mc->gmc_cred, &mc_name, &mc_lifetime, NULL, NULL);
94 mn = malloc(sizeof(struct _gss_mechanism_name));
96 mc->gmc_mech->gm_release_name(minor_status,
100 mn->gmn_mech = mc->gmc_mech;
101 mn->gmn_mech_oid = mc->gmc_mech_oid;
102 mn->gmn_name = mc_name;
103 SLIST_INSERT_HEAD(&name->gn_mn, mn, gmn_link);
105 mc->gmc_mech->gm_release_name(minor_status,
109 if (mc_lifetime < min_lifetime)
110 min_lifetime = mc_lifetime;
113 gss_add_oid_set_member(minor_status,
114 mc->gmc_mech_oid, mechanisms);
117 SLIST_FOREACH(m, &_gss_mechs, gm_link) {
119 OM_uint32 mc_lifetime;
121 major_status = m->gm_inquire_cred(minor_status,
122 GSS_C_NO_CREDENTIAL, &mc_name, &mc_lifetime,
127 if (name && mc_name) {
129 sizeof(struct _gss_mechanism_name));
131 mc->gmc_mech->gm_release_name(
132 minor_status, &mc_name);
135 mn->gmn_mech = mc->gmc_mech;
136 mn->gmn_mech_oid = mc->gmc_mech_oid;
137 mn->gmn_name = mc_name;
138 SLIST_INSERT_HEAD(&name->gn_mn, mn, gmn_link);
139 } else if (mc_name) {
140 mc->gmc_mech->gm_release_name(minor_status,
144 if (mc_lifetime < min_lifetime)
145 min_lifetime = mc_lifetime;
148 gss_add_oid_set_member(minor_status,
149 &m->gm_mech_oid, mechanisms);
152 if ((*mechanisms)->count == 0) {
153 gss_release_oid_set(minor_status, mechanisms);
155 return (GSS_S_NO_CRED);
161 *name_ret = (gss_name_t) name;
163 *lifetime = min_lifetime;
164 if (cred && cred_usage)
165 *cred_usage = cred->gc_usage;
166 return (GSS_S_COMPLETE);