1b528cefcSMark Murray /* 2b528cefcSMark Murray * Copyright (c) 1997, 1998, 1999 Kungliga Tekniska H�gskolan 3b528cefcSMark Murray * (Royal Institute of Technology, Stockholm, Sweden). 4b528cefcSMark Murray * All rights reserved. 5b528cefcSMark Murray * 6b528cefcSMark Murray * Redistribution and use in source and binary forms, with or without 7b528cefcSMark Murray * modification, are permitted provided that the following conditions 8b528cefcSMark Murray * are met: 9b528cefcSMark Murray * 10b528cefcSMark Murray * 1. Redistributions of source code must retain the above copyright 11b528cefcSMark Murray * notice, this list of conditions and the following disclaimer. 12b528cefcSMark Murray * 13b528cefcSMark Murray * 2. Redistributions in binary form must reproduce the above copyright 14b528cefcSMark Murray * notice, this list of conditions and the following disclaimer in the 15b528cefcSMark Murray * documentation and/or other materials provided with the distribution. 16b528cefcSMark Murray * 17b528cefcSMark Murray * 3. Neither the name of the Institute nor the names of its contributors 18b528cefcSMark Murray * may be used to endorse or promote products derived from this software 19b528cefcSMark Murray * without specific prior written permission. 20b528cefcSMark Murray * 21b528cefcSMark Murray * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND 22b528cefcSMark Murray * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23b528cefcSMark Murray * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24b528cefcSMark Murray * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE 25b528cefcSMark Murray * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26b528cefcSMark Murray * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27b528cefcSMark Murray * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28b528cefcSMark Murray * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29b528cefcSMark Murray * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30b528cefcSMark Murray * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31b528cefcSMark Murray * SUCH DAMAGE. 32b528cefcSMark Murray */ 33b528cefcSMark Murray 34b528cefcSMark Murray #include "test_locl.h" 35b528cefcSMark Murray #include <gssapi.h> 36b528cefcSMark Murray #include "gss_common.h" 37b528cefcSMark Murray RCSID("$Id: gss_common.c,v 1.6 1999/12/02 17:04:56 joda Exp $"); 38b528cefcSMark Murray 39b528cefcSMark Murray void 40b528cefcSMark Murray write_token (int sock, gss_buffer_t buf) 41b528cefcSMark Murray { 42b528cefcSMark Murray u_int32_t len, net_len; 43b528cefcSMark Murray OM_uint32 min_stat; 44b528cefcSMark Murray 45b528cefcSMark Murray len = buf->length; 46b528cefcSMark Murray 47b528cefcSMark Murray net_len = htonl(len); 48b528cefcSMark Murray 49b528cefcSMark Murray if (write (sock, &net_len, 4) != 4) 50b528cefcSMark Murray err (1, "write"); 51b528cefcSMark Murray if (write (sock, buf->value, len) != len) 52b528cefcSMark Murray err (1, "write"); 53b528cefcSMark Murray 54b528cefcSMark Murray gss_release_buffer (&min_stat, buf); 55b528cefcSMark Murray } 56b528cefcSMark Murray 57b528cefcSMark Murray void 58b528cefcSMark Murray read_token (int sock, gss_buffer_t buf) 59b528cefcSMark Murray { 60b528cefcSMark Murray u_int32_t len, net_len; 61b528cefcSMark Murray 62b528cefcSMark Murray if (read(sock, &net_len, 4) != 4) 63b528cefcSMark Murray err (1, "read"); 64b528cefcSMark Murray len = ntohl(net_len); 65b528cefcSMark Murray buf->length = len; 66b528cefcSMark Murray buf->value = malloc(len); 67b528cefcSMark Murray if (read (sock, buf->value, len) != len) 68b528cefcSMark Murray err (1, "read"); 69b528cefcSMark Murray } 70b528cefcSMark Murray 71b528cefcSMark Murray void 72b528cefcSMark Murray gss_print_errors (int min_stat) 73b528cefcSMark Murray { 74b528cefcSMark Murray OM_uint32 new_stat; 75b528cefcSMark Murray OM_uint32 msg_ctx = 0; 76b528cefcSMark Murray gss_buffer_desc status_string; 77b528cefcSMark Murray OM_uint32 ret; 78b528cefcSMark Murray 79b528cefcSMark Murray do { 80b528cefcSMark Murray ret = gss_display_status (&new_stat, 81b528cefcSMark Murray min_stat, 82b528cefcSMark Murray GSS_C_MECH_CODE, 83b528cefcSMark Murray GSS_C_NO_OID, 84b528cefcSMark Murray &msg_ctx, 85b528cefcSMark Murray &status_string); 86b528cefcSMark Murray fprintf (stderr, "%s\n", (char *)status_string.value); 87b528cefcSMark Murray gss_release_buffer (&new_stat, &status_string); 88b528cefcSMark Murray } while (!GSS_ERROR(ret) && msg_ctx != 0); 89b528cefcSMark Murray } 90b528cefcSMark Murray 91b528cefcSMark Murray void 92b528cefcSMark Murray gss_verr(int exitval, int status, const char *fmt, va_list ap) 93b528cefcSMark Murray { 94b528cefcSMark Murray vwarnx (fmt, ap); 95b528cefcSMark Murray gss_print_errors (status); 96b528cefcSMark Murray exit (exitval); 97b528cefcSMark Murray } 98b528cefcSMark Murray 99b528cefcSMark Murray void 100b528cefcSMark Murray gss_err(int exitval, int status, const char *fmt, ...) 101b528cefcSMark Murray { 102b528cefcSMark Murray va_list args; 103b528cefcSMark Murray 104b528cefcSMark Murray va_start(args, fmt); 105b528cefcSMark Murray gss_verr (exitval, status, fmt, args); 106b528cefcSMark Murray va_end(args); 107b528cefcSMark Murray } 108b528cefcSMark Murray 109