78 lines
2.6 KiB
C
78 lines
2.6 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 "mech_switch.h"
|
||
|
|
#include "name.h"
|
||
|
|
|
||
|
|
OM_uint32
|
||
|
|
gss_inquire_mechs_for_name(OM_uint32 *minor_status,
|
||
|
|
const gss_name_t input_name,
|
||
|
|
gss_OID_set *mech_types)
|
||
|
|
{
|
||
|
|
OM_uint32 major_status;
|
||
|
|
struct _gss_name *name = (struct _gss_name *) input_name;
|
||
|
|
struct _gss_mech_switch *m;
|
||
|
|
gss_OID_set name_types;
|
||
|
|
int present;
|
||
|
|
|
||
|
|
*minor_status = 0;
|
||
|
|
|
||
|
|
major_status = gss_create_empty_oid_set(minor_status, mech_types);
|
||
|
|
if (major_status)
|
||
|
|
return (major_status);
|
||
|
|
|
||
|
|
/*
|
||
|
|
* We go through all the loaded mechanisms and see if this
|
||
|
|
* name's type is supported by the mechanism. If it is, add
|
||
|
|
* the mechanism to the set.
|
||
|
|
*/
|
||
|
|
SLIST_FOREACH(m, &_gss_mechs, gm_link) {
|
||
|
|
major_status = gss_inquire_names_for_mech(minor_status,
|
||
|
|
&m->gm_mech_oid, &name_types);
|
||
|
|
if (major_status) {
|
||
|
|
gss_release_oid_set(minor_status, mech_types);
|
||
|
|
return (major_status);
|
||
|
|
}
|
||
|
|
gss_test_oid_set_member(minor_status,
|
||
|
|
&name->gn_type, name_types, &present);
|
||
|
|
gss_release_oid_set(minor_status, &name_types);
|
||
|
|
if (present) {
|
||
|
|
major_status = gss_add_oid_set_member(minor_status,
|
||
|
|
&m->gm_mech_oid, mech_types);
|
||
|
|
if (major_status) {
|
||
|
|
gss_release_oid_set(minor_status, mech_types);
|
||
|
|
return (major_status);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
return (GSS_S_COMPLETE);
|
||
|
|
}
|