1*ae771770SStanislav Sedov /*
2*ae771770SStanislav Sedov * Copyright (c) 2009 Kungliga Tekniska H�gskolan
3*ae771770SStanislav Sedov * (Royal Institute of Technology, Stockholm, Sweden).
4*ae771770SStanislav Sedov * All rights reserved.
5*ae771770SStanislav Sedov *
6*ae771770SStanislav Sedov * Redistribution and use in source and binary forms, with or without
7*ae771770SStanislav Sedov * modification, are permitted provided that the following conditions
8*ae771770SStanislav Sedov * are met:
9*ae771770SStanislav Sedov *
10*ae771770SStanislav Sedov * 1. Redistributions of source code must retain the above copyright
11*ae771770SStanislav Sedov * notice, this list of conditions and the following disclaimer.
12*ae771770SStanislav Sedov *
13*ae771770SStanislav Sedov * 2. Redistributions in binary form must reproduce the above copyright
14*ae771770SStanislav Sedov * notice, this list of conditions and the following disclaimer in the
15*ae771770SStanislav Sedov * documentation and/or other materials provided with the distribution.
16*ae771770SStanislav Sedov *
17*ae771770SStanislav Sedov * 3. Neither the name of the Institute nor the names of its contributors
18*ae771770SStanislav Sedov * may be used to endorse or promote products derived from this software
19*ae771770SStanislav Sedov * without specific prior written permission.
20*ae771770SStanislav Sedov *
21*ae771770SStanislav Sedov * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22*ae771770SStanislav Sedov * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23*ae771770SStanislav Sedov * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24*ae771770SStanislav Sedov * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25*ae771770SStanislav Sedov * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26*ae771770SStanislav Sedov * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27*ae771770SStanislav Sedov * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28*ae771770SStanislav Sedov * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29*ae771770SStanislav Sedov * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30*ae771770SStanislav Sedov * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31*ae771770SStanislav Sedov * SUCH DAMAGE.
32*ae771770SStanislav Sedov */
33*ae771770SStanislav Sedov
34*ae771770SStanislav Sedov #include "mech_locl.h"
35*ae771770SStanislav Sedov
36*ae771770SStanislav Sedov GSSAPI_LIB_FUNCTION OM_uint32 GSSAPI_LIB_CALL
gss_store_cred(OM_uint32 * minor_status,gss_cred_id_t input_cred_handle,gss_cred_usage_t cred_usage,const gss_OID desired_mech,OM_uint32 overwrite_cred,OM_uint32 default_cred,gss_OID_set * elements_stored,gss_cred_usage_t * cred_usage_stored)37*ae771770SStanislav Sedov gss_store_cred(OM_uint32 *minor_status,
38*ae771770SStanislav Sedov gss_cred_id_t input_cred_handle,
39*ae771770SStanislav Sedov gss_cred_usage_t cred_usage,
40*ae771770SStanislav Sedov const gss_OID desired_mech,
41*ae771770SStanislav Sedov OM_uint32 overwrite_cred,
42*ae771770SStanislav Sedov OM_uint32 default_cred,
43*ae771770SStanislav Sedov gss_OID_set *elements_stored,
44*ae771770SStanislav Sedov gss_cred_usage_t *cred_usage_stored)
45*ae771770SStanislav Sedov {
46*ae771770SStanislav Sedov struct _gss_cred *cred = (struct _gss_cred *) input_cred_handle;
47*ae771770SStanislav Sedov struct _gss_mechanism_cred *mc;
48*ae771770SStanislav Sedov OM_uint32 maj, junk;
49*ae771770SStanislav Sedov
50*ae771770SStanislav Sedov if (minor_status == NULL)
51*ae771770SStanislav Sedov return GSS_S_FAILURE;
52*ae771770SStanislav Sedov if (elements_stored)
53*ae771770SStanislav Sedov *elements_stored = NULL;
54*ae771770SStanislav Sedov if (cred_usage_stored)
55*ae771770SStanislav Sedov *cred_usage_stored = 0;
56*ae771770SStanislav Sedov
57*ae771770SStanislav Sedov if (cred == NULL)
58*ae771770SStanislav Sedov return GSS_S_NO_CONTEXT;
59*ae771770SStanislav Sedov
60*ae771770SStanislav Sedov if (elements_stored) {
61*ae771770SStanislav Sedov maj = gss_create_empty_oid_set(minor_status, elements_stored);
62*ae771770SStanislav Sedov if (maj != GSS_S_COMPLETE)
63*ae771770SStanislav Sedov return maj;
64*ae771770SStanislav Sedov }
65*ae771770SStanislav Sedov
66*ae771770SStanislav Sedov HEIM_SLIST_FOREACH(mc, &cred->gc_mc, gmc_link) {
67*ae771770SStanislav Sedov gssapi_mech_interface m = mc->gmc_mech;
68*ae771770SStanislav Sedov
69*ae771770SStanislav Sedov if (m == NULL || m->gm_store_cred == NULL)
70*ae771770SStanislav Sedov continue;
71*ae771770SStanislav Sedov
72*ae771770SStanislav Sedov if (desired_mech) {
73*ae771770SStanislav Sedov maj = gss_oid_equal(&m->gm_mech_oid, desired_mech);
74*ae771770SStanislav Sedov if (maj != 0)
75*ae771770SStanislav Sedov continue;
76*ae771770SStanislav Sedov }
77*ae771770SStanislav Sedov
78*ae771770SStanislav Sedov maj = (m->gm_store_cred)(minor_status, mc->gmc_cred,
79*ae771770SStanislav Sedov cred_usage, desired_mech, overwrite_cred,
80*ae771770SStanislav Sedov default_cred, NULL, cred_usage_stored);
81*ae771770SStanislav Sedov if (maj != GSS_S_COMPLETE) {
82*ae771770SStanislav Sedov gss_release_oid_set(&junk, elements_stored);
83*ae771770SStanislav Sedov return maj;
84*ae771770SStanislav Sedov }
85*ae771770SStanislav Sedov
86*ae771770SStanislav Sedov if (elements_stored) {
87*ae771770SStanislav Sedov gss_add_oid_set_member(&junk,
88*ae771770SStanislav Sedov &m->gm_mech_oid,
89*ae771770SStanislav Sedov elements_stored);
90*ae771770SStanislav Sedov }
91*ae771770SStanislav Sedov
92*ae771770SStanislav Sedov }
93*ae771770SStanislav Sedov return GSS_S_COMPLETE;
94*ae771770SStanislav Sedov }
95