Line data Source code
1 : /*
2 : * Copyright (c) 2003 Kungliga Tekniska Högskolan
3 : * (Royal Institute of Technology, Stockholm, Sweden).
4 : * All rights reserved.
5 : *
6 : * Redistribution and use in source and binary forms, with or without
7 : * modification, are permitted provided that the following conditions
8 : * are met:
9 : *
10 : * 1. Redistributions of source code must retain the above copyright
11 : * notice, this list of conditions and the following disclaimer.
12 : *
13 : * 2. Redistributions in binary form must reproduce the above copyright
14 : * notice, this list of conditions and the following disclaimer in the
15 : * documentation and/or other materials provided with the distribution.
16 : *
17 : * 3. Neither the name of the Institute nor the names of its contributors
18 : * may be used to endorse or promote products derived from this software
19 : * without specific prior written permission.
20 : *
21 : * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 : * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 : * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 : * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 : * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 : * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 : * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 : * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 : * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 : * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 : * SUCH DAMAGE.
32 : */
33 :
34 : #include "gsskrb5_locl.h"
35 :
36 : static gss_OID name_list[] = {
37 : GSS_C_NT_HOSTBASED_SERVICE,
38 : GSS_C_NT_USER_NAME,
39 : GSS_KRB5_NT_PRINCIPAL_NAME,
40 : GSS_C_NT_EXPORT_NAME,
41 : NULL
42 : };
43 :
44 11497 : OM_uint32 GSSAPI_CALLCONV _gsskrb5_inquire_names_for_mech (
45 : OM_uint32 * minor_status,
46 : const gss_OID mechanism,
47 : gss_OID_set * name_types
48 : )
49 : {
50 : OM_uint32 ret;
51 : int i;
52 :
53 11497 : *minor_status = 0;
54 :
55 11497 : if (gss_oid_equal(mechanism, GSS_KRB5_MECHANISM) == 0 &&
56 0 : gss_oid_equal(mechanism, GSS_C_NULL_OID) == 0) {
57 0 : *name_types = GSS_C_NO_OID_SET;
58 0 : return GSS_S_BAD_MECH;
59 : }
60 :
61 11497 : ret = gss_create_empty_oid_set(minor_status, name_types);
62 11497 : if (ret != GSS_S_COMPLETE)
63 0 : return ret;
64 :
65 57485 : for (i = 0; name_list[i] != NULL; i++) {
66 45988 : ret = gss_add_oid_set_member(minor_status,
67 : name_list[i],
68 : name_types);
69 45988 : if (ret != GSS_S_COMPLETE)
70 0 : break;
71 : }
72 :
73 11497 : if (ret != GSS_S_COMPLETE)
74 0 : gss_release_oid_set(NULL, name_types);
75 :
76 11497 : return GSS_S_COMPLETE;
77 : }
|