1/* 2 * Copyright (c) 1997-2003, 2006 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 "kadm5_locl.h" 35 36RCSID("$Id$"); 37 38kadm5_ret_t 39_kadm5_client_send(kadm5_client_context *context, krb5_storage *sp) 40{ 41 krb5_data msg, out; 42 krb5_error_code ret; 43 size_t len; 44 krb5_storage *sock; 45 46 assert(context->sock != -1); 47 48 len = krb5_storage_seek(sp, 0, SEEK_CUR); 49 ret = krb5_data_alloc(&msg, len); 50 if (ret) { 51 krb5_clear_error_message(context->context); 52 return ret; 53 } 54 krb5_storage_seek(sp, 0, SEEK_SET); 55 krb5_storage_read(sp, msg.data, msg.length); 56 57 ret = krb5_mk_priv(context->context, context->ac, &msg, &out, NULL); 58 krb5_data_free(&msg); 59 if(ret) 60 return ret; 61 62 sock = krb5_storage_from_fd(context->sock); 63 if(sock == NULL) { 64 krb5_clear_error_message(context->context); 65 krb5_data_free(&out); 66 return ENOMEM; 67 } 68 69 ret = krb5_store_data(sock, out); 70 if (ret) 71 krb5_clear_error_message(context->context); 72 krb5_storage_free(sock); 73 krb5_data_free(&out); 74 return ret; 75} 76 77kadm5_ret_t 78_kadm5_client_recv(kadm5_client_context *context, krb5_data *reply) 79{ 80 krb5_error_code ret; 81 krb5_data data; 82 krb5_storage *sock; 83 84 sock = krb5_storage_from_fd(context->sock); 85 if(sock == NULL) { 86 krb5_clear_error_message(context->context); 87 return ENOMEM; 88 } 89 ret = krb5_ret_data(sock, &data); 90 krb5_storage_free(sock); 91 krb5_clear_error_message(context->context); 92 if(ret == KRB5_CC_END) 93 return KADM5_RPC_ERROR; 94 else if(ret) 95 return ret; 96 97 ret = krb5_rd_priv(context->context, context->ac, &data, reply, NULL); 98 krb5_data_free(&data); 99 return ret; 100} 101 102krb5_error_code 103_kadm5_store_ks_tuple(krb5_storage *sp, uint32_t n_ks_tuple, krb5_key_salt_tuple *ks_tuple) 104{ 105 krb5_error_code ret; 106 size_t n; 107 108 ret = krb5_store_uint32(sp, n_ks_tuple); 109 if (ret) 110 return ret; 111 112 for (n = 0; n < n_ks_tuple; n++) { 113 ret = krb5_store_int32(sp, 8); /* element size */ 114 if (ret) return ret; 115 ret = krb5_store_int32(sp, ks_tuple[n].ks_enctype); 116 if (ret) return ret; 117 ret = krb5_store_int32(sp, ks_tuple[n].ks_salttype); 118 if (ret) return ret; 119 } 120 return 0; 121} 122 123krb5_error_code 124_kadm5_ret_ks_tuple(krb5_storage *sp, uint32_t *n_ks_tuple, krb5_key_salt_tuple **ks_tuple) 125{ 126 krb5_error_code ret; 127 uint32_t elsize, n; 128 129 *n_ks_tuple = 0; 130 *ks_tuple = NULL; 131 132 ret = krb5_ret_uint32(sp, n_ks_tuple); 133 if (ret == HEIM_ERR_EOF) { 134 return 0; 135 } else if (ret) 136 return ret; 137 138 if (n_ks_tuple < 0 || *n_ks_tuple > 1000) { 139 ret = EOVERFLOW; 140 goto fail; 141 } 142 143 ks_tuple = calloc(*n_ks_tuple, sizeof (*ks_tuple)); 144 if (ks_tuple == NULL) { 145 ret = errno; 146 goto fail; 147 } 148 149 for (n = 0; n < *n_ks_tuple; n++) { 150 ret = krb5_ret_uint32(sp, &elsize); 151 if (ret) 152 goto fail; 153 if (elsize < 8) { 154 ret = EOVERFLOW; 155 goto fail; 156 } 157 158 ret = krb5_ret_int32(sp, &(*ks_tuple)[n].ks_enctype); 159 if (ret != 0) 160 goto fail; 161 162 ret = krb5_ret_int32(sp, &(*ks_tuple)[n].ks_salttype); 163 if (ret != 0) 164 goto fail; 165 166 krb5_storage_seek(sp, elsize - 8, SEEK_CUR); 167 } 168 169 return 0; 170 171 fail: 172 free(*ks_tuple); 173 *ks_tuple = NULL; 174 *n_ks_tuple = 0; 175 176 return ret; 177} 178