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