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