155682Smarkm/* 2233294Sstas * Copyright (c) 1997 - 1999 Kungliga Tekniska H��gskolan 3233294Sstas * (Royal Institute of Technology, Stockholm, Sweden). 4233294Sstas * All rights reserved. 555682Smarkm * 6233294Sstas * Redistribution and use in source and binary forms, with or without 7233294Sstas * modification, are permitted provided that the following conditions 8233294Sstas * are met: 955682Smarkm * 10233294Sstas * 1. Redistributions of source code must retain the above copyright 11233294Sstas * notice, this list of conditions and the following disclaimer. 1255682Smarkm * 13233294Sstas * 2. Redistributions in binary form must reproduce the above copyright 14233294Sstas * notice, this list of conditions and the following disclaimer in the 15233294Sstas * documentation and/or other materials provided with the distribution. 1655682Smarkm * 17233294Sstas * 3. Neither the name of the Institute nor the names of its contributors 18233294Sstas * may be used to endorse or promote products derived from this software 19233294Sstas * without specific prior written permission. 2055682Smarkm * 21233294Sstas * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND 22233294Sstas * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23233294Sstas * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24233294Sstas * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE 25233294Sstas * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26233294Sstas * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27233294Sstas * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28233294Sstas * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29233294Sstas * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30233294Sstas * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31233294Sstas * SUCH DAMAGE. 3255682Smarkm */ 3355682Smarkm 3455682Smarkm#include "kadm5_locl.h" 3555682Smarkm 36233294SstasRCSID("$Id$"); 3755682Smarkm 38233294Sstasvoid 3955682Smarkmkadm5_free_key_data(void *server_handle, 40233294Sstas int16_t *n_key_data, 4155682Smarkm krb5_key_data *key_data) 4255682Smarkm{ 4355682Smarkm int i; 4455682Smarkm for(i = 0; i < *n_key_data; i++){ 4555682Smarkm if(key_data[i].key_data_contents[0]){ 46233294Sstas memset(key_data[i].key_data_contents[0], 4755682Smarkm 0, 4855682Smarkm key_data[i].key_data_length[0]); 4955682Smarkm free(key_data[i].key_data_contents[0]); 5055682Smarkm } 5155682Smarkm if(key_data[i].key_data_contents[1]) 5255682Smarkm free(key_data[i].key_data_contents[1]); 5355682Smarkm } 5455682Smarkm *n_key_data = 0; 5555682Smarkm} 5655682Smarkm 5755682Smarkm 58233294Sstasvoid 5955682Smarkmkadm5_free_principal_ent(void *server_handle, 6055682Smarkm kadm5_principal_ent_t princ) 6155682Smarkm{ 6255682Smarkm kadm5_server_context *context = server_handle; 6355682Smarkm if(princ->principal) 6455682Smarkm krb5_free_principal(context->context, princ->principal); 6555682Smarkm if(princ->mod_name) 6655682Smarkm krb5_free_principal(context->context, princ->mod_name); 6755682Smarkm kadm5_free_key_data(server_handle, &princ->n_key_data, princ->key_data); 6855682Smarkm while(princ->n_tl_data && princ->tl_data) { 6955682Smarkm krb5_tl_data *tp; 7055682Smarkm tp = princ->tl_data; 7155682Smarkm princ->tl_data = tp->tl_data_next; 7255682Smarkm princ->n_tl_data--; 7355682Smarkm memset(tp->tl_data_contents, 0, tp->tl_data_length); 7455682Smarkm free(tp->tl_data_contents); 7555682Smarkm free(tp); 7655682Smarkm } 7755682Smarkm if (princ->key_data != NULL) 7855682Smarkm free (princ->key_data); 7955682Smarkm} 8055682Smarkm 81233294Sstasvoid 8255682Smarkmkadm5_free_name_list(void *server_handle, 83233294Sstas char **names, 8455682Smarkm int *count) 8555682Smarkm{ 8655682Smarkm int i; 8755682Smarkm for(i = 0; i < *count; i++) 8855682Smarkm free(names[i]); 8955682Smarkm free(names); 9055682Smarkm *count = 0; 9155682Smarkm} 92