1 /* $NetBSD: free.c,v 1.1.1.2 2014/04/24 12:45:48 pettai Exp $ */ 2 3 /* 4 * Copyright (c) 1997 - 1999 Kungliga Tekniska Högskolan 5 * (Royal Institute of Technology, Stockholm, Sweden). 6 * All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 19 * 3. Neither the name of the Institute nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 */ 35 36 #include "kadm5_locl.h" 37 38 __RCSID("NetBSD"); 39 40 void 41 kadm5_free_key_data(void *server_handle, 42 int16_t *n_key_data, 43 krb5_key_data *key_data) 44 { 45 int i; 46 for(i = 0; i < *n_key_data; i++){ 47 if(key_data[i].key_data_contents[0]){ 48 memset(key_data[i].key_data_contents[0], 49 0, 50 key_data[i].key_data_length[0]); 51 free(key_data[i].key_data_contents[0]); 52 } 53 if(key_data[i].key_data_contents[1]) 54 free(key_data[i].key_data_contents[1]); 55 } 56 *n_key_data = 0; 57 } 58 59 60 void 61 kadm5_free_principal_ent(void *server_handle, 62 kadm5_principal_ent_t princ) 63 { 64 kadm5_server_context *context = server_handle; 65 if(princ->principal) 66 krb5_free_principal(context->context, princ->principal); 67 if(princ->mod_name) 68 krb5_free_principal(context->context, princ->mod_name); 69 kadm5_free_key_data(server_handle, &princ->n_key_data, princ->key_data); 70 while(princ->n_tl_data && princ->tl_data) { 71 krb5_tl_data *tp; 72 tp = princ->tl_data; 73 princ->tl_data = tp->tl_data_next; 74 princ->n_tl_data--; 75 memset(tp->tl_data_contents, 0, tp->tl_data_length); 76 free(tp->tl_data_contents); 77 free(tp); 78 } 79 if (princ->key_data != NULL) 80 free (princ->key_data); 81 } 82 83 void 84 kadm5_free_name_list(void *server_handle, 85 char **names, 86 int *count) 87 { 88 int i; 89 for(i = 0; i < *count; i++) 90 free(names[i]); 91 free(names); 92 *count = 0; 93 } 94