1 /* 2 * Copyright (c) 1997, 1998, 1999 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 "test_locl.h" 35 #include <gssapi.h> 36 #include "nt_gss_common.h" 37 38 RCSID("$Id: nt_gss_common.c,v 1.3 1999/12/02 17:04:57 joda Exp $"); 39 40 /* 41 * These are functions that are needed to interoperate with the 42 * `Sample SSPI Code' in Windows 2000 RC1 SDK. 43 */ 44 45 /* 46 * Write the `gss_buffer_t' in `buf' onto the fd `sock', but remember that 47 * the length is written in little-endian-order. 48 */ 49 50 void 51 nt_write_token (int sock, gss_buffer_t buf) 52 { 53 unsigned char net_len[4]; 54 u_int32_t len; 55 OM_uint32 min_stat; 56 57 len = buf->length; 58 59 net_len[0] = (len >> 0) & 0xFF; 60 net_len[1] = (len >> 8) & 0xFF; 61 net_len[2] = (len >> 16) & 0xFF; 62 net_len[3] = (len >> 24) & 0xFF; 63 64 if (write (sock, net_len, 4) != 4) 65 err (1, "write"); 66 if (write (sock, buf->value, len) != len) 67 err (1, "write"); 68 69 gss_release_buffer (&min_stat, buf); 70 } 71 72 /* 73 * 74 */ 75 76 void 77 nt_read_token (int sock, gss_buffer_t buf) 78 { 79 unsigned char net_len[4]; 80 u_int32_t len; 81 82 if (read(sock, net_len, 4) != 4) 83 err (1, "read"); 84 len = (net_len[0] << 0) 85 | (net_len[1] << 8) 86 | (net_len[2] << 16) 87 | (net_len[3] << 24); 88 89 buf->length = len; 90 buf->value = malloc(len); 91 if (read (sock, buf->value, len) != len) 92 err (1, "read"); 93 } 94 95 void 96 gss_print_errors (int min_stat) 97 { 98 OM_uint32 new_stat; 99 OM_uint32 msg_ctx = 0; 100 gss_buffer_desc status_string; 101 OM_uint32 ret; 102 103 do { 104 ret = gss_display_status (&new_stat, 105 min_stat, 106 GSS_C_MECH_CODE, 107 GSS_C_NO_OID, 108 &msg_ctx, 109 &status_string); 110 fprintf (stderr, "%s\n", (char *)status_string.value); 111 gss_release_buffer (&new_stat, &status_string); 112 } while (!GSS_ERROR(ret) && msg_ctx != 0); 113 } 114 115 void 116 gss_verr(int exitval, int status, const char *fmt, va_list ap) 117 { 118 vwarnx (fmt, ap); 119 gss_print_errors (status); 120 exit (exitval); 121 } 122 123 void 124 gss_err(int exitval, int status, const char *fmt, ...) 125 { 126 va_list args; 127 128 va_start(args, fmt); 129 gss_verr (exitval, status, fmt, args); 130 va_end(args); 131 } 132