1226031Sstas/*
2226031Sstas * Copyright (c) 2004, PADL Software Pty Ltd.
3226031Sstas * All rights reserved.
4226031Sstas *
5226031Sstas * Redistribution and use in source and binary forms, with or without
6226031Sstas * modification, are permitted provided that the following conditions
7226031Sstas * are met:
8226031Sstas *
9226031Sstas * 1. Redistributions of source code must retain the above copyright
10226031Sstas *    notice, this list of conditions and the following disclaimer.
11226031Sstas *
12226031Sstas * 2. Redistributions in binary form must reproduce the above copyright
13226031Sstas *    notice, this list of conditions and the following disclaimer in the
14226031Sstas *    documentation and/or other materials provided with the distribution.
15226031Sstas *
16226031Sstas * 3. Neither the name of PADL Software nor the names of its contributors
17226031Sstas *    may be used to endorse or promote products derived from this software
18226031Sstas *    without specific prior written permission.
19226031Sstas *
20226031Sstas * THIS SOFTWARE IS PROVIDED BY PADL SOFTWARE AND CONTRIBUTORS ``AS IS'' AND
21226031Sstas * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22226031Sstas * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23226031Sstas * ARE DISCLAIMED.  IN NO EVENT SHALL PADL SOFTWARE OR CONTRIBUTORS BE LIABLE
24226031Sstas * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25226031Sstas * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26226031Sstas * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27226031Sstas * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28226031Sstas * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29226031Sstas * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30226031Sstas * SUCH DAMAGE.
31226031Sstas */
32226031Sstas
33226031Sstas#include "mech_locl.h"
34226031Sstas
35226031SstasGSSAPI_LIB_FUNCTION OM_uint32 GSSAPI_LIB_CALL
36226031Sstasgss_inquire_cred_by_oid (OM_uint32 *minor_status,
37226031Sstas			 const gss_cred_id_t cred_handle,
38226031Sstas			 const gss_OID desired_object,
39226031Sstas			 gss_buffer_set_t *data_set)
40226031Sstas{
41226031Sstas	struct _gss_cred *cred = (struct _gss_cred *) cred_handle;
42226031Sstas	OM_uint32		status = GSS_S_COMPLETE;
43226031Sstas	struct _gss_mechanism_cred *mc;
44226031Sstas	gssapi_mech_interface	m;
45226031Sstas	gss_buffer_set_t set = GSS_C_NO_BUFFER_SET;
46226031Sstas
47226031Sstas	*minor_status = 0;
48226031Sstas	*data_set = GSS_C_NO_BUFFER_SET;
49226031Sstas
50226031Sstas	if (cred == NULL)
51226031Sstas		return GSS_S_NO_CRED;
52226031Sstas
53226031Sstas	HEIM_SLIST_FOREACH(mc, &cred->gc_mc, gmc_link) {
54226031Sstas		gss_buffer_set_t rset = GSS_C_NO_BUFFER_SET;
55226031Sstas		size_t i;
56226031Sstas
57226031Sstas		m = mc->gmc_mech;
58226031Sstas		if (m == NULL) {
59226031Sstas	       		gss_release_buffer_set(minor_status, &set);
60226031Sstas			*minor_status = 0;
61226031Sstas			return GSS_S_BAD_MECH;
62226031Sstas		}
63226031Sstas
64226031Sstas		if (m->gm_inquire_cred_by_oid == NULL)
65226031Sstas			continue;
66226031Sstas
67226031Sstas		status = m->gm_inquire_cred_by_oid(minor_status,
68226031Sstas		    mc->gmc_cred, desired_object, &rset);
69226031Sstas		if (status != GSS_S_COMPLETE)
70226031Sstas			continue;
71226031Sstas
72226031Sstas		for (i = 0; i < rset->count; i++) {
73226031Sstas			status = gss_add_buffer_set_member(minor_status,
74226031Sstas			     &rset->elements[i], &set);
75226031Sstas			if (status != GSS_S_COMPLETE)
76226031Sstas				break;
77226031Sstas		}
78226031Sstas		gss_release_buffer_set(minor_status, &rset);
79226031Sstas	}
80226031Sstas	if (set == GSS_C_NO_BUFFER_SET)
81226031Sstas		status = GSS_S_FAILURE;
82226031Sstas	*data_set = set;
83226031Sstas	*minor_status = 0;
84226031Sstas	return status;
85226031Sstas}
86226031Sstas
87