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