| 1 | /*
|
|---|
| 2 | * Copyright (c) 1997 - 2004 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 "ntlm.h"
|
|---|
| 35 |
|
|---|
| 36 | OM_uint32 GSSAPI_CALLCONV _gss_ntlm_acquire_cred
|
|---|
| 37 | (OM_uint32 * min_stat,
|
|---|
| 38 | const gss_name_t desired_name,
|
|---|
| 39 | OM_uint32 time_req,
|
|---|
| 40 | const gss_OID_set desired_mechs,
|
|---|
| 41 | gss_cred_usage_t cred_usage,
|
|---|
| 42 | gss_cred_id_t * output_cred_handle,
|
|---|
| 43 | gss_OID_set * actual_mechs,
|
|---|
| 44 | OM_uint32 * time_rec
|
|---|
| 45 | )
|
|---|
| 46 | {
|
|---|
| 47 | ntlm_name name = (ntlm_name) desired_name;
|
|---|
| 48 | OM_uint32 maj_stat;
|
|---|
| 49 | ntlm_ctx ctx;
|
|---|
| 50 |
|
|---|
| 51 | *min_stat = 0;
|
|---|
| 52 | *output_cred_handle = GSS_C_NO_CREDENTIAL;
|
|---|
| 53 | if (actual_mechs)
|
|---|
| 54 | *actual_mechs = GSS_C_NO_OID_SET;
|
|---|
| 55 | if (time_rec)
|
|---|
| 56 | *time_rec = GSS_C_INDEFINITE;
|
|---|
| 57 |
|
|---|
| 58 | if (desired_name == NULL)
|
|---|
| 59 | return GSS_S_NO_CRED;
|
|---|
| 60 |
|
|---|
| 61 | if (cred_usage == GSS_C_BOTH || cred_usage == GSS_C_ACCEPT) {
|
|---|
| 62 |
|
|---|
| 63 | maj_stat = _gss_ntlm_allocate_ctx(min_stat, &ctx);
|
|---|
| 64 | if (maj_stat != GSS_S_COMPLETE)
|
|---|
| 65 | return maj_stat;
|
|---|
| 66 |
|
|---|
| 67 | maj_stat = (*ctx->server->nsi_probe)(min_stat, ctx->ictx,
|
|---|
| 68 | name->domain);
|
|---|
| 69 | {
|
|---|
| 70 | gss_ctx_id_t context = (gss_ctx_id_t)ctx;
|
|---|
| 71 | OM_uint32 junk;
|
|---|
| 72 | _gss_ntlm_delete_sec_context(&junk, &context, NULL);
|
|---|
| 73 | }
|
|---|
| 74 | if (maj_stat)
|
|---|
| 75 | return maj_stat;
|
|---|
| 76 | }
|
|---|
| 77 | if (cred_usage == GSS_C_BOTH || cred_usage == GSS_C_INITIATE) {
|
|---|
| 78 | ntlm_cred cred;
|
|---|
| 79 |
|
|---|
| 80 | *min_stat = _gss_ntlm_get_user_cred(name, &cred);
|
|---|
| 81 | if (*min_stat)
|
|---|
| 82 | return GSS_S_FAILURE;
|
|---|
| 83 | cred->usage = cred_usage;
|
|---|
| 84 |
|
|---|
| 85 | *output_cred_handle = (gss_cred_id_t)cred;
|
|---|
| 86 | }
|
|---|
| 87 |
|
|---|
| 88 | return (GSS_S_COMPLETE);
|
|---|
| 89 | }
|
|---|
