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
26 * $FreeBSD: src/lib/libgssapi/gss_acquire_cred.c,v 1.1 2005/12/29 14:40:20 dfr Exp $
29 #include "mech_locl.h"
33 gss_acquire_cred(OM_uint32
*minor_status
,
34 const gss_name_t desired_name
,
36 const gss_OID_set desired_mechs
,
37 gss_cred_usage_t cred_usage
,
38 gss_cred_id_t
*output_cred_handle
,
39 gss_OID_set
*actual_mechs
,
42 OM_uint32 major_status
;
43 gss_OID_set mechs
= desired_mechs
;
45 struct _gss_name
*name
= (struct _gss_name
*) desired_name
;
46 gssapi_mech_interface m
;
47 struct _gss_cred
*cred
;
48 struct _gss_mechanism_cred
*mc
;
49 OM_uint32 min_time
, cred_time
;
53 if (output_cred_handle
)
54 *output_cred_handle
= GSS_C_NO_CREDENTIAL
;
56 *actual_mechs
= GSS_C_NO_OID_SET
;
63 * First make sure that at least one of the requested
64 * mechanisms is one that we support.
67 for (i
= 0; i
< mechs
->count
; i
++) {
69 gss_test_oid_set_member(minor_status
,
70 &mechs
->elements
[i
], _gss_mech_oids
, &t
);
74 if (i
== mechs
->count
) {
76 return (GSS_S_BAD_MECH
);
81 major_status
= gss_create_empty_oid_set(minor_status
,
84 return (major_status
);
87 cred
= malloc(sizeof(struct _gss_cred
));
90 gss_release_oid_set(minor_status
, actual_mechs
);
91 *minor_status
= ENOMEM
;
92 return (GSS_S_FAILURE
);
94 SLIST_INIT(&cred
->gc_mc
);
96 if (mechs
== GSS_C_NO_OID_SET
)
97 mechs
= _gss_mech_oids
;
100 min_time
= GSS_C_INDEFINITE
;
101 for (i
= 0; i
< mechs
->count
; i
++) {
102 struct _gss_mechanism_name
*mn
= NULL
;
104 m
= __gss_get_mechanism(&mechs
->elements
[i
]);
108 if (desired_name
!= GSS_C_NO_NAME
) {
109 major_status
= _gss_find_mn(minor_status
, name
,
110 &mechs
->elements
[i
], &mn
);
111 if (major_status
!= GSS_S_COMPLETE
)
115 mc
= malloc(sizeof(struct _gss_mechanism_cred
));
120 mc
->gmc_mech_oid
= &m
->gm_mech_oid
;
123 * XXX Probably need to do something with actual_mechs.
125 set
.elements
= &mechs
->elements
[i
];
126 major_status
= m
->gm_acquire_cred(minor_status
,
127 (desired_name
!= GSS_C_NO_NAME
128 ? mn
->gmn_name
: GSS_C_NO_NAME
),
129 time_req
, &set
, cred_usage
,
130 &mc
->gmc_cred
, NULL
, &cred_time
);
135 if (cred_time
< min_time
)
136 min_time
= cred_time
;
139 major_status
= gss_add_oid_set_member(minor_status
,
140 mc
->gmc_mech_oid
, actual_mechs
);
142 m
->gm_release_cred(minor_status
,
149 SLIST_INSERT_HEAD(&cred
->gc_mc
, mc
, gmc_link
);
153 * If we didn't manage to create a single credential, return
156 if (!SLIST_FIRST(&cred
->gc_mc
)) {
159 gss_release_oid_set(minor_status
, actual_mechs
);
161 return (GSS_S_NO_CRED
);
165 *time_rec
= min_time
;
166 *output_cred_handle
= (gss_cred_id_t
) cred
;
168 return (GSS_S_COMPLETE
);