1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
|
/* #pragma ident "@(#)g_inquire_cred.c 1.16 04/02/23 SMI" */
/*
* Copyright 1996 by Sun Microsystems, Inc.
*
* Permission to use, copy, modify, distribute, and sell this software
* and its documentation for any purpose is hereby granted without fee,
* provided that the above copyright notice appears in all copies and
* that both that copyright notice and this permission notice appear in
* supporting documentation, and that the name of Sun Microsystems not be used
* in advertising or publicity pertaining to distribution of the software
* without specific, written prior permission. Sun Microsystems makes no
* representations about the suitability of this software for any
* purpose. It is provided "as is" without express or implied warranty.
*
* SUN MICROSYSTEMS DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
* INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
* EVENT SHALL SUN MICROSYSTEMS BE LIABLE FOR ANY SPECIAL, INDIRECT OR
* CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
* USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
* OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
* PERFORMANCE OF THIS SOFTWARE.
*/
/*
* glue routine for gss_inquire_cred
*/
#include "mglueP.h"
#include <stdio.h>
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#include <string.h>
#include <time.h>
OM_uint32 KRB5_CALLCONV
gss_inquire_cred(minor_status,
cred_handle,
name,
lifetime,
cred_usage,
mechanisms)
OM_uint32 * minor_status;
gss_cred_id_t cred_handle;
gss_name_t * name;
OM_uint32 * lifetime;
int * cred_usage;
gss_OID_set * mechanisms;
{
OM_uint32 status, elapsed_time, temp_minor_status;
gss_union_cred_t union_cred;
gss_mechanism mech;
gss_name_t internal_name;
int i;
/* Initialize outputs. */
if (minor_status != NULL)
*minor_status = 0;
if (name != NULL)
*name = GSS_C_NO_NAME;
if (mechanisms != NULL)
*mechanisms = GSS_C_NO_OID_SET;
/* Validate arguments. */
if (minor_status == NULL)
return (GSS_S_CALL_INACCESSIBLE_WRITE);
if (cred_handle == GSS_C_NO_CREDENTIAL) {
/*
* No credential was supplied. This means we can't get a mechanism
* pointer to call the mechanism specific gss_inquire_cred.
* So, call get_mechanism with an arguement of GSS_C_NULL_OID.
* get_mechanism will return the first mechanism in the mech
* array, which becomes the default mechanism.
*/
if ((mech = gssint_get_mechanism(GSS_C_NULL_OID)) == NULL)
return (GSS_S_DEFECTIVE_CREDENTIAL);
if (!mech->gss_inquire_cred)
return (GSS_S_UNAVAILABLE);
status = mech->gss_inquire_cred(minor_status,
GSS_C_NO_CREDENTIAL,
name ? &internal_name : NULL,
lifetime, cred_usage, mechanisms);
if (status != GSS_S_COMPLETE) {
map_error(minor_status, mech);
return(status);
}
if (name) {
/*
* Convert internal_name into a union_name equivalent.
*/
status = gssint_convert_name_to_union_name(&temp_minor_status,
mech, internal_name,
name);
if (status != GSS_S_COMPLETE) {
*minor_status = temp_minor_status;
map_error(minor_status, mech);
if (mechanisms && *mechanisms) {
(void) gss_release_oid_set(
&temp_minor_status,
mechanisms);
}
return (status);
}
}
return(GSS_S_COMPLETE);
}
/* get the cred_handle cast as a union_credentials structure */
union_cred = (gss_union_cred_t) cred_handle;
/*
* get the information out of the union_cred structure that was
* placed there during gss_acquire_cred.
*/
if(cred_usage != NULL)
*cred_usage = union_cred->auxinfo.cred_usage;
if(lifetime != NULL) {
elapsed_time = time(0) - union_cred->auxinfo.creation_time;
*lifetime = union_cred->auxinfo.time_rec < elapsed_time ? 0 :
union_cred->auxinfo.time_rec - elapsed_time;
}
/*
* if name is non_null,
* call gss_import_name(), giving it the printable name held within
* union_cred in order to get an internal name to pass back to the
* caller. If this call fails, return failure to our caller.
*/
if(name != NULL) {
if (union_cred->auxinfo.name.length == 0) {
*name = GSS_C_NO_NAME;
} else if ((gss_import_name(&temp_minor_status,
&union_cred->auxinfo.name,
union_cred->auxinfo.name_type,
name) != GSS_S_COMPLETE) ||
(gss_canonicalize_name(minor_status, *name,
&union_cred->mechs_array[0],
NULL) != GSS_S_COMPLETE)) {
status = GSS_S_DEFECTIVE_CREDENTIAL;
goto error;
}
}
/*
* copy the mechanism set in union_cred into an OID set and return in
* the mechanisms parameter.
*/
if(mechanisms != NULL) {
status = GSS_S_FAILURE;
*mechanisms = (gss_OID_set) malloc(sizeof(gss_OID_set_desc));
if (*mechanisms == NULL)
goto error;
(*mechanisms)->count = 0;
(*mechanisms)->elements =
(gss_OID) malloc(sizeof(gss_OID_desc) *
union_cred->count);
if ((*mechanisms)->elements == NULL) {
free(*mechanisms);
*mechanisms = NULL;
goto error;
}
for(i=0; i < union_cred->count; i++) {
(*mechanisms)->elements[i].elements = (void *)
malloc(union_cred->mechs_array[i].length);
if ((*mechanisms)->elements[i].elements == NULL)
goto error;
g_OID_copy(&(*mechanisms)->elements[i],
&union_cred->mechs_array[i]);
(*mechanisms)->count++;
}
}
return(GSS_S_COMPLETE);
error:
/*
* cleanup any allocated memory - we can just call
* gss_release_oid_set, because the set is constructed so that
* count always references the currently copied number of
* elements.
*/
if (mechanisms && *mechanisms != NULL)
(void) gss_release_oid_set(&temp_minor_status, mechanisms);
if (name && *name != NULL)
(void) gss_release_name(&temp_minor_status, name);
return (status);
}
OM_uint32 KRB5_CALLCONV
gss_inquire_cred_by_mech(minor_status, cred_handle, mech_type, name,
initiator_lifetime, acceptor_lifetime, cred_usage)
OM_uint32 *minor_status;
gss_cred_id_t cred_handle;
gss_OID mech_type;
gss_name_t *name;
OM_uint32 *initiator_lifetime;
OM_uint32 *acceptor_lifetime;
gss_cred_usage_t *cred_usage;
{
gss_union_cred_t union_cred;
gss_cred_id_t mech_cred;
gss_mechanism mech;
OM_uint32 status, temp_minor_status;
gss_name_t internal_name;
if (minor_status != NULL)
*minor_status = 0;
if (name != NULL)
*name = GSS_C_NO_NAME;
if (minor_status == NULL)
return (GSS_S_CALL_INACCESSIBLE_WRITE);
mech = gssint_get_mechanism (mech_type);
if (!mech)
return (GSS_S_BAD_MECH);
if (!mech->gss_inquire_cred_by_mech)
return (GSS_S_BAD_BINDINGS);
union_cred = (gss_union_cred_t) cred_handle;
mech_cred = gssint_get_mechanism_cred(union_cred, mech_type);
#if 0
if (mech_cred == NULL)
return (GSS_S_DEFECTIVE_CREDENTIAL);
#endif
status = mech->gss_inquire_cred_by_mech(minor_status,
mech_cred, mech_type,
name ? &internal_name : NULL,
initiator_lifetime,
acceptor_lifetime, cred_usage);
if (status != GSS_S_COMPLETE) {
map_error(minor_status, mech);
return (status);
}
if (name) {
/*
* Convert internal_name into a union_name equivalent.
*/
status = gssint_convert_name_to_union_name(
&temp_minor_status, mech,
internal_name, name);
if (status != GSS_S_COMPLETE) {
*minor_status = temp_minor_status;
map_error(minor_status, mech);
return (status);
}
}
return (GSS_S_COMPLETE);
}
|
