1*ae771770SStanislav Sedov /*
2*ae771770SStanislav Sedov * Copyright (c) 2004, PADL Software Pty Ltd.
3*ae771770SStanislav Sedov * All rights reserved.
4*ae771770SStanislav Sedov *
5*ae771770SStanislav Sedov * Redistribution and use in source and binary forms, with or without
6*ae771770SStanislav Sedov * modification, are permitted provided that the following conditions
7*ae771770SStanislav Sedov * are met:
8*ae771770SStanislav Sedov *
9*ae771770SStanislav Sedov * 1. Redistributions of source code must retain the above copyright
10*ae771770SStanislav Sedov * notice, this list of conditions and the following disclaimer.
11*ae771770SStanislav Sedov *
12*ae771770SStanislav Sedov * 2. Redistributions in binary form must reproduce the above copyright
13*ae771770SStanislav Sedov * notice, this list of conditions and the following disclaimer in the
14*ae771770SStanislav Sedov * documentation and/or other materials provided with the distribution.
15*ae771770SStanislav Sedov *
16*ae771770SStanislav Sedov * 3. Neither the name of PADL Software nor the names of its contributors
17*ae771770SStanislav Sedov * may be used to endorse or promote products derived from this software
18*ae771770SStanislav Sedov * without specific prior written permission.
19*ae771770SStanislav Sedov *
20*ae771770SStanislav Sedov * THIS SOFTWARE IS PROVIDED BY PADL SOFTWARE AND CONTRIBUTORS ``AS IS'' AND
21*ae771770SStanislav Sedov * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22*ae771770SStanislav Sedov * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23*ae771770SStanislav Sedov * ARE DISCLAIMED. IN NO EVENT SHALL PADL SOFTWARE OR CONTRIBUTORS BE LIABLE
24*ae771770SStanislav Sedov * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25*ae771770SStanislav Sedov * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26*ae771770SStanislav Sedov * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27*ae771770SStanislav Sedov * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28*ae771770SStanislav Sedov * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29*ae771770SStanislav Sedov * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30*ae771770SStanislav Sedov * SUCH DAMAGE.
31*ae771770SStanislav Sedov */
32*ae771770SStanislav Sedov
33*ae771770SStanislav Sedov #include "mech_locl.h"
34*ae771770SStanislav Sedov
35*ae771770SStanislav Sedov GSSAPI_LIB_FUNCTION OM_uint32 GSSAPI_LIB_CALL
gss_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)36*ae771770SStanislav Sedov gss_inquire_cred_by_oid (OM_uint32 *minor_status,
37*ae771770SStanislav Sedov const gss_cred_id_t cred_handle,
38*ae771770SStanislav Sedov const gss_OID desired_object,
39*ae771770SStanislav Sedov gss_buffer_set_t *data_set)
40*ae771770SStanislav Sedov {
41*ae771770SStanislav Sedov struct _gss_cred *cred = (struct _gss_cred *) cred_handle;
42*ae771770SStanislav Sedov OM_uint32 status = GSS_S_COMPLETE;
43*ae771770SStanislav Sedov struct _gss_mechanism_cred *mc;
44*ae771770SStanislav Sedov gssapi_mech_interface m;
45*ae771770SStanislav Sedov gss_buffer_set_t set = GSS_C_NO_BUFFER_SET;
46*ae771770SStanislav Sedov
47*ae771770SStanislav Sedov *minor_status = 0;
48*ae771770SStanislav Sedov *data_set = GSS_C_NO_BUFFER_SET;
49*ae771770SStanislav Sedov
50*ae771770SStanislav Sedov if (cred == NULL)
51*ae771770SStanislav Sedov return GSS_S_NO_CRED;
52*ae771770SStanislav Sedov
53*ae771770SStanislav Sedov HEIM_SLIST_FOREACH(mc, &cred->gc_mc, gmc_link) {
54*ae771770SStanislav Sedov gss_buffer_set_t rset = GSS_C_NO_BUFFER_SET;
55*ae771770SStanislav Sedov size_t i;
56*ae771770SStanislav Sedov
57*ae771770SStanislav Sedov m = mc->gmc_mech;
58*ae771770SStanislav Sedov if (m == NULL) {
59*ae771770SStanislav Sedov gss_release_buffer_set(minor_status, &set);
60*ae771770SStanislav Sedov *minor_status = 0;
61*ae771770SStanislav Sedov return GSS_S_BAD_MECH;
62*ae771770SStanislav Sedov }
63*ae771770SStanislav Sedov
64*ae771770SStanislav Sedov if (m->gm_inquire_cred_by_oid == NULL)
65*ae771770SStanislav Sedov continue;
66*ae771770SStanislav Sedov
67*ae771770SStanislav Sedov status = m->gm_inquire_cred_by_oid(minor_status,
68*ae771770SStanislav Sedov mc->gmc_cred, desired_object, &rset);
69*ae771770SStanislav Sedov if (status != GSS_S_COMPLETE)
70*ae771770SStanislav Sedov continue;
71*ae771770SStanislav Sedov
72*ae771770SStanislav Sedov for (i = 0; i < rset->count; i++) {
73*ae771770SStanislav Sedov status = gss_add_buffer_set_member(minor_status,
74*ae771770SStanislav Sedov &rset->elements[i], &set);
75*ae771770SStanislav Sedov if (status != GSS_S_COMPLETE)
76*ae771770SStanislav Sedov break;
77*ae771770SStanislav Sedov }
78*ae771770SStanislav Sedov gss_release_buffer_set(minor_status, &rset);
79*ae771770SStanislav Sedov }
80*ae771770SStanislav Sedov if (set == GSS_C_NO_BUFFER_SET)
81*ae771770SStanislav Sedov status = GSS_S_FAILURE;
82*ae771770SStanislav Sedov *data_set = set;
83*ae771770SStanislav Sedov *minor_status = 0;
84*ae771770SStanislav Sedov return status;
85*ae771770SStanislav Sedov }
86*ae771770SStanislav Sedov
87