3aebdb89ad
prototypess of memset, memcpy and malloc respectively.
180 lines
5.1 KiB
C
180 lines
5.1 KiB
C
/*-
|
|
* Copyright (c) 2005 Doug Rabson
|
|
* 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.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 THE AUTHOR 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.
|
|
*
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
#include <gssapi/gssapi.h>
|
|
#include <stdlib.h>
|
|
#include <errno.h>
|
|
|
|
#include "mech_switch.h"
|
|
#include "cred.h"
|
|
#include "name.h"
|
|
|
|
static struct _gss_mechanism_cred *
|
|
_gss_copy_cred(struct _gss_mechanism_cred *mc)
|
|
{
|
|
struct _gss_mechanism_cred *new_mc;
|
|
struct _gss_mech_switch *m = mc->gmc_mech;
|
|
OM_uint32 major_status, minor_status;
|
|
gss_name_t name;
|
|
gss_cred_id_t cred;
|
|
OM_uint32 initiator_lifetime, acceptor_lifetime;
|
|
gss_cred_usage_t cred_usage;
|
|
|
|
major_status = m->gm_inquire_cred_by_mech(&minor_status,
|
|
mc->gmc_cred, mc->gmc_mech_oid,
|
|
&name, &initiator_lifetime, &acceptor_lifetime, &cred_usage);
|
|
if (major_status)
|
|
return (0);
|
|
|
|
major_status = m->gm_add_cred(&minor_status,
|
|
GSS_C_NO_CREDENTIAL, name, mc->gmc_mech_oid,
|
|
cred_usage, initiator_lifetime, acceptor_lifetime,
|
|
&cred, 0, 0, 0);
|
|
m->gm_release_name(&minor_status, &name);
|
|
|
|
if (major_status)
|
|
return (0);
|
|
|
|
new_mc = malloc(sizeof(struct _gss_mechanism_cred));
|
|
if (!new_mc) {
|
|
m->gm_release_cred(&minor_status, &cred);
|
|
return (0);
|
|
}
|
|
new_mc->gmc_mech = m;
|
|
new_mc->gmc_mech_oid = &m->gm_mech_oid;
|
|
new_mc->gmc_cred = cred;
|
|
|
|
return (new_mc);
|
|
}
|
|
|
|
OM_uint32
|
|
gss_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)
|
|
{
|
|
OM_uint32 major_status;
|
|
struct _gss_mech_switch *m;
|
|
gss_OID_set_desc set;
|
|
struct _gss_name *name = (struct _gss_name *) desired_name;
|
|
struct _gss_cred *cred = (struct _gss_cred *) input_cred_handle;
|
|
struct _gss_cred *new_cred;
|
|
struct _gss_mechanism_cred *mc, *target_mc, *copy_mc;
|
|
struct _gss_mechanism_name *mn;
|
|
OM_uint32 min_time, time, junk;
|
|
int i;
|
|
|
|
*output_cred_handle = 0;
|
|
*minor_status = 0;
|
|
|
|
new_cred = malloc(sizeof(struct _gss_cred));
|
|
if (!new_cred) {
|
|
*minor_status = ENOMEM;
|
|
return (GSS_S_FAILURE);
|
|
}
|
|
new_cred->gc_usage = cred_usage;
|
|
SLIST_INIT(&new_cred->gc_mc);
|
|
|
|
/*
|
|
* We go through all the mc attached to the input_cred_handle
|
|
* and check the mechanism. If it matches, we call
|
|
* gss_add_cred for that mechanism, otherwise we copy the mc
|
|
* to new_cred.
|
|
*/
|
|
target_mc = 0;
|
|
if (cred) {
|
|
SLIST_FOREACH(mc, &cred->gc_mc, gmc_link) {
|
|
if (_gss_oid_equal(mc->gmc_mech, desired_mech)) {
|
|
target_mc = mc;
|
|
}
|
|
copy_mc = _gss_copy_cred(mc);
|
|
if (!copy_mc) {
|
|
gss_release_cred(&junk, (gss_cred_id_t*) &new_cred);
|
|
*minor_status = ENOMEM;
|
|
return (GSS_S_FAILURE);
|
|
}
|
|
SLIST_INSERT_HEAD(&new_cred->gc_mc, copy_mc, gmc_link);
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Figure out a suitable mn, if any.
|
|
*/
|
|
if (desired_name) {
|
|
mn = _gss_find_mn((struct _gss_name *) desired_name,
|
|
desired_mech);
|
|
if (!mn) {
|
|
free(new_cred);
|
|
return (GSS_S_BAD_NAME);
|
|
}
|
|
} else {
|
|
mn = 0;
|
|
}
|
|
|
|
m = _gss_find_mech_switch(desired_mech);
|
|
|
|
mc = malloc(sizeof(struct _gss_mechanism_cred));
|
|
if (!mc) {
|
|
gss_release_cred(&junk, (gss_cred_id_t*) &new_cred);
|
|
*minor_status = ENOMEM;
|
|
return (GSS_S_FAILURE);
|
|
}
|
|
mc->gmc_mech = m;
|
|
mc->gmc_mech_oid = &m->gm_mech_oid;
|
|
|
|
major_status = m->gm_add_cred(minor_status,
|
|
target_mc ? target_mc->gmc_cred : GSS_C_NO_CREDENTIAL,
|
|
desired_name ? mn->gmn_name : GSS_C_NO_NAME,
|
|
desired_mech,
|
|
cred_usage,
|
|
initiator_time_req,
|
|
acceptor_time_req,
|
|
&mc->gmc_cred,
|
|
actual_mechs,
|
|
initiator_time_rec,
|
|
acceptor_time_rec);
|
|
|
|
if (major_status) {
|
|
gss_release_cred(&junk, (gss_cred_id_t*) &new_cred);
|
|
free(mc);
|
|
return (major_status);
|
|
}
|
|
SLIST_INSERT_HEAD(&new_cred->gc_mc, mc, gmc_link);
|
|
*output_cred_handle = (gss_cred_id_t) new_cred;
|
|
|
|
return (GSS_S_COMPLETE);
|
|
}
|
|
|