132 lines
3.6 KiB
C
132 lines
3.6 KiB
C
/*
|
|
* Copyright (c) 1997, 1998, 1999 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 "test_locl.h"
|
|
#include <gssapi.h>
|
|
#include "nt_gss_common.h"
|
|
|
|
RCSID("$Id: nt_gss_common.c,v 1.3 1999/12/02 17:04:57 joda Exp $");
|
|
|
|
/*
|
|
* These are functions that are needed to interoperate with the
|
|
* `Sample SSPI Code' in Windows 2000 RC1 SDK.
|
|
*/
|
|
|
|
/*
|
|
* Write the `gss_buffer_t' in `buf' onto the fd `sock', but remember that
|
|
* the length is written in little-endian-order.
|
|
*/
|
|
|
|
void
|
|
nt_write_token (int sock, gss_buffer_t buf)
|
|
{
|
|
unsigned char net_len[4];
|
|
u_int32_t len;
|
|
OM_uint32 min_stat;
|
|
|
|
len = buf->length;
|
|
|
|
net_len[0] = (len >> 0) & 0xFF;
|
|
net_len[1] = (len >> 8) & 0xFF;
|
|
net_len[2] = (len >> 16) & 0xFF;
|
|
net_len[3] = (len >> 24) & 0xFF;
|
|
|
|
if (write (sock, net_len, 4) != 4)
|
|
err (1, "write");
|
|
if (write (sock, buf->value, len) != len)
|
|
err (1, "write");
|
|
|
|
gss_release_buffer (&min_stat, buf);
|
|
}
|
|
|
|
/*
|
|
*
|
|
*/
|
|
|
|
void
|
|
nt_read_token (int sock, gss_buffer_t buf)
|
|
{
|
|
unsigned char net_len[4];
|
|
u_int32_t len;
|
|
|
|
if (read(sock, net_len, 4) != 4)
|
|
err (1, "read");
|
|
len = (net_len[0] << 0)
|
|
| (net_len[1] << 8)
|
|
| (net_len[2] << 16)
|
|
| (net_len[3] << 24);
|
|
|
|
buf->length = len;
|
|
buf->value = malloc(len);
|
|
if (read (sock, buf->value, len) != len)
|
|
err (1, "read");
|
|
}
|
|
|
|
void
|
|
gss_print_errors (int min_stat)
|
|
{
|
|
OM_uint32 new_stat;
|
|
OM_uint32 msg_ctx = 0;
|
|
gss_buffer_desc status_string;
|
|
OM_uint32 ret;
|
|
|
|
do {
|
|
ret = gss_display_status (&new_stat,
|
|
min_stat,
|
|
GSS_C_MECH_CODE,
|
|
GSS_C_NO_OID,
|
|
&msg_ctx,
|
|
&status_string);
|
|
fprintf (stderr, "%s\n", (char *)status_string.value);
|
|
gss_release_buffer (&new_stat, &status_string);
|
|
} while (!GSS_ERROR(ret) && msg_ctx != 0);
|
|
}
|
|
|
|
void
|
|
gss_verr(int exitval, int status, const char *fmt, va_list ap)
|
|
{
|
|
vwarnx (fmt, ap);
|
|
gss_print_errors (status);
|
|
exit (exitval);
|
|
}
|
|
|
|
void
|
|
gss_err(int exitval, int status, const char *fmt, ...)
|
|
{
|
|
va_list args;
|
|
|
|
va_start(args, fmt);
|
|
gss_verr (exitval, status, fmt, args);
|
|
va_end(args);
|
|
}
|