1/*
2 * Copyright (c) 1997 - 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 "kadm5_locl.h"
35
36RCSID("$Id$");
37
38void
39kadm5_free_key_data(void *server_handle,
40		    int16_t *n_key_data,
41		    krb5_key_data *key_data)
42{
43    int i;
44    for(i = 0; i < *n_key_data; i++){
45	if(key_data[i].key_data_contents[0]){
46	    memset(key_data[i].key_data_contents[0],
47		   0,
48		   key_data[i].key_data_length[0]);
49	    free(key_data[i].key_data_contents[0]);
50	}
51	if(key_data[i].key_data_contents[1])
52	    free(key_data[i].key_data_contents[1]);
53    }
54    *n_key_data = 0;
55}
56
57
58void
59kadm5_free_principal_ent(void *server_handle,
60			 kadm5_principal_ent_t princ)
61{
62    kadm5_server_context *context = server_handle;
63    if(princ->principal)
64	krb5_free_principal(context->context, princ->principal);
65    if(princ->mod_name)
66	krb5_free_principal(context->context, princ->mod_name);
67    kadm5_free_key_data(server_handle, &princ->n_key_data, princ->key_data);
68    while(princ->n_tl_data && princ->tl_data) {
69	krb5_tl_data *tp;
70	tp = princ->tl_data;
71	princ->tl_data = tp->tl_data_next;
72	princ->n_tl_data--;
73	memset(tp->tl_data_contents, 0, tp->tl_data_length);
74	free(tp->tl_data_contents);
75	free(tp);
76    }
77    if (princ->key_data != NULL)
78	free (princ->key_data);
79}
80
81void
82kadm5_free_name_list(void *server_handle,
83		     char **names,
84		     int *count)
85{
86    int i;
87    for(i = 0; i < *count; i++)
88	free(names[i]);
89    free(names);
90    *count = 0;
91}
92