2baa7e7d61
git-svn-id: svn://svn.h5l.se/heimdal/trunk/heimdal@17692 ec53bebd-3082-4978-b11e-865c3cabbd6b
278 lines
7.5 KiB
C
278 lines
7.5 KiB
C
/*
|
|
* Copyright (c) 2004, PADL Software Pty Ltd.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* 3. Neither the name of PADL Software nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY PADL SOFTWARE AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL PADL SOFTWARE OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#include "spnego_locl.h"
|
|
|
|
RCSID("$Id$");
|
|
|
|
OM_uint32
|
|
_gss_spnego_release_cred(OM_uint32 *minor_status, gss_cred_id_t *cred_handle)
|
|
{
|
|
OM_uint32 ret;
|
|
|
|
*minor_status = 0;
|
|
|
|
if (*cred_handle == GSS_C_NO_CREDENTIAL) {
|
|
return GSS_S_COMPLETE;
|
|
}
|
|
|
|
ret = gss_release_cred(minor_status, &(*cred_handle)->negotiated_cred_id);
|
|
|
|
free(*cred_handle);
|
|
*cred_handle = GSS_C_NO_CREDENTIAL;
|
|
|
|
return ret;
|
|
}
|
|
|
|
OM_uint32
|
|
_gss_spnego_alloc_cred(OM_uint32 *minor_status,
|
|
gss_cred_id_t mech_cred_handle,
|
|
gss_cred_id_t *cred_handle)
|
|
{
|
|
if (*cred_handle != GSS_C_NO_CREDENTIAL) {
|
|
*minor_status = EINVAL;
|
|
return GSS_S_FAILURE;
|
|
}
|
|
|
|
*cred_handle = (gss_cred_id_t)malloc(sizeof(*cred_handle));
|
|
if (*cred_handle == GSS_C_NO_CREDENTIAL) {
|
|
*minor_status = ENOMEM;
|
|
return GSS_S_FAILURE;
|
|
}
|
|
|
|
(*cred_handle)->negotiated_cred_id = mech_cred_handle;
|
|
|
|
return GSS_S_COMPLETE;
|
|
}
|
|
|
|
/*
|
|
* For now, just a simple wrapper that avoids recursion. When
|
|
* we support gss_{get,set}_neg_mechs() we will need to expose
|
|
* more functionality.
|
|
*/
|
|
OM_uint32 gss_spnego_acquire_cred
|
|
(OM_uint32 *minor_status,
|
|
const gss_name_t desired_name,
|
|
OM_uint32 time_req,
|
|
const gss_OID_set desired_mechs,
|
|
gss_cred_usage_t cred_usage,
|
|
gss_cred_id_t * output_cred_handle,
|
|
gss_OID_set * actual_mechs,
|
|
OM_uint32 * time_rec
|
|
)
|
|
{
|
|
OM_uint32 ret, tmp;
|
|
gss_OID_set_desc actual_desired_mechs;
|
|
int i, j;
|
|
gss_cred_id_t cred_handle = GSS_C_NO_CREDENTIAL;
|
|
|
|
*output_cred_handle = GSS_C_NO_CREDENTIAL;
|
|
|
|
/* Remove ourselves from this list */
|
|
actual_desired_mechs.count = desired_mechs->count;
|
|
actual_desired_mechs.elements = malloc(actual_desired_mechs.count *
|
|
sizeof(gss_OID_desc));
|
|
if (actual_desired_mechs.elements == NULL) {
|
|
*minor_status = ENOMEM;
|
|
ret = GSS_S_FAILURE;
|
|
goto out;
|
|
}
|
|
|
|
for (i = 0, j = 0; i < desired_mechs->count; i++) {
|
|
if (gss_oid_equal(&desired_mechs->elements[i],
|
|
GSS_SPNEGO_MECHANISM))
|
|
continue;
|
|
|
|
actual_desired_mechs.elements[j].length =
|
|
desired_mechs->elements[i].length;
|
|
actual_desired_mechs.elements[j].elements =
|
|
desired_mechs->elements[i].elements;
|
|
j++;
|
|
}
|
|
|
|
actual_desired_mechs.count = j;
|
|
|
|
ret = _gss_spnego_alloc_cred(minor_status, GSS_C_NO_CREDENTIAL,
|
|
&cred_handle);
|
|
if (ret != GSS_S_COMPLETE)
|
|
goto out;
|
|
|
|
ret = gss_acquire_cred(minor_status, desired_name,
|
|
time_req, &actual_desired_mechs,
|
|
cred_usage,
|
|
&cred_handle->negotiated_cred_id,
|
|
actual_mechs, time_rec);
|
|
if (ret != GSS_S_COMPLETE)
|
|
goto out;
|
|
|
|
*output_cred_handle = (gss_cred_id_t)cred_handle;
|
|
|
|
out:
|
|
if (actual_desired_mechs.elements != NULL) {
|
|
free(actual_desired_mechs.elements);
|
|
}
|
|
if (ret != GSS_S_COMPLETE) {
|
|
_gss_spnego_release_cred(&tmp, &cred_handle);
|
|
}
|
|
|
|
return ret;
|
|
}
|
|
|
|
OM_uint32 gss_spnego_release_cred
|
|
(OM_uint32 *minor_status,
|
|
gss_cred_id_t *cred_handle
|
|
)
|
|
{
|
|
return _gss_spnego_release_cred(minor_status, cred_handle);
|
|
}
|
|
|
|
OM_uint32 gss_spnego_inquire_cred
|
|
(OM_uint32 * minor_status,
|
|
const gss_cred_id_t cred_handle,
|
|
gss_name_t * name,
|
|
OM_uint32 * lifetime,
|
|
gss_cred_usage_t * cred_usage,
|
|
gss_OID_set * mechanisms
|
|
)
|
|
{
|
|
OM_uint32 ret;
|
|
|
|
if (cred_handle == GSS_C_NO_CREDENTIAL) {
|
|
*minor_status = 0;
|
|
return GSS_S_NO_CRED;
|
|
}
|
|
|
|
ret = gss_inquire_cred(minor_status,
|
|
cred_handle->negotiated_cred_id,
|
|
name,
|
|
lifetime,
|
|
cred_usage,
|
|
mechanisms);
|
|
|
|
return ret;
|
|
}
|
|
|
|
OM_uint32 gss_spnego_add_cred (
|
|
OM_uint32 * minor_status,
|
|
const gss_cred_id_t input_cred_handle,
|
|
const gss_name_t desired_name,
|
|
const gss_OID desired_mech,
|
|
gss_cred_usage_t cred_usage,
|
|
OM_uint32 initiator_time_req,
|
|
OM_uint32 acceptor_time_req,
|
|
gss_cred_id_t * output_cred_handle,
|
|
gss_OID_set * actual_mechs,
|
|
OM_uint32 * initiator_time_rec,
|
|
OM_uint32 * acceptor_time_rec
|
|
)
|
|
{
|
|
gss_cred_id_t spnego_output_cred_handle = GSS_C_NO_CREDENTIAL;
|
|
OM_uint32 ret, tmp;
|
|
|
|
*output_cred_handle = GSS_C_NO_CREDENTIAL;
|
|
|
|
ret = _gss_spnego_alloc_cred(minor_status, GSS_C_NO_CREDENTIAL,
|
|
&spnego_output_cred_handle);
|
|
if (ret)
|
|
return ret;
|
|
|
|
ret = gss_add_cred(minor_status,
|
|
input_cred_handle->negotiated_cred_id,
|
|
desired_name,
|
|
desired_mech,
|
|
cred_usage,
|
|
initiator_time_req,
|
|
acceptor_time_req,
|
|
&spnego_output_cred_handle->negotiated_cred_id,
|
|
actual_mechs,
|
|
initiator_time_rec,
|
|
acceptor_time_rec);
|
|
if (ret) {
|
|
_gss_spnego_release_cred(&tmp, &spnego_output_cred_handle);
|
|
return ret;
|
|
}
|
|
|
|
*output_cred_handle = spnego_output_cred_handle;
|
|
|
|
return GSS_S_COMPLETE;
|
|
}
|
|
|
|
OM_uint32 gss_spnego_inquire_cred_by_mech (
|
|
OM_uint32 * minor_status,
|
|
const gss_cred_id_t cred_handle,
|
|
const gss_OID mech_type,
|
|
gss_name_t * name,
|
|
OM_uint32 * initiator_lifetime,
|
|
OM_uint32 * acceptor_lifetime,
|
|
gss_cred_usage_t * cred_usage
|
|
)
|
|
{
|
|
OM_uint32 ret;
|
|
|
|
if (cred_handle == GSS_C_NO_CREDENTIAL) {
|
|
*minor_status = 0;
|
|
return GSS_S_NO_CRED;
|
|
}
|
|
|
|
ret = gss_inquire_cred_by_mech(minor_status,
|
|
cred_handle->negotiated_cred_id,
|
|
mech_type,
|
|
name,
|
|
initiator_lifetime,
|
|
acceptor_lifetime,
|
|
cred_usage);
|
|
|
|
return ret;
|
|
}
|
|
|
|
OM_uint32 gss_spnego_inquire_cred_by_oid
|
|
(OM_uint32 * minor_status,
|
|
const gss_cred_id_t cred_handle,
|
|
const gss_OID desired_object,
|
|
gss_buffer_set_t *data_set)
|
|
{
|
|
OM_uint32 ret;
|
|
|
|
if (cred_handle == GSS_C_NO_CREDENTIAL) {
|
|
*minor_status = 0;
|
|
return GSS_S_NO_CRED;
|
|
}
|
|
|
|
ret = gss_inquire_cred_by_oid(minor_status,
|
|
cred_handle->negotiated_cred_id,
|
|
desired_object,
|
|
data_set);
|
|
|
|
return ret;
|
|
}
|
|
|