1/*
2 * Copyright (c) 1999-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 "kadmin_locl.h"
35#include "kadmin-commands.h"
36
37/*
38 * del_enctype principal enctypes...
39 */
40
41int
42del_enctype(void *opt, int argc, char **argv)
43{
44    kadm5_principal_ent_rec princ;
45    krb5_principal princ_ent = NULL;
46    krb5_error_code ret;
47    const char *princ_name;
48    int i, j, k;
49    krb5_key_data *new_key_data;
50    int n_etypes;
51    krb5_enctype *etypes;
52
53    memset (&princ, 0, sizeof(princ));
54    princ_name = argv[0];
55    n_etypes   = argc - 1;
56    etypes     = malloc (n_etypes * sizeof(*etypes));
57    if (etypes == NULL) {
58	krb5_warnx (context, "out of memory");
59	return 0;
60    }
61    argv++;
62    for (i = 0; i < n_etypes; ++i) {
63	ret = krb5_string_to_enctype (context, argv[i], &etypes[i]);
64	if (ret) {
65	    krb5_warnx (context, "bad enctype \"%s\"", argv[i]);
66	    goto out2;
67	}
68    }
69
70    ret = krb5_parse_name(context, princ_name, &princ_ent);
71    if (ret) {
72	krb5_warn (context, ret, "krb5_parse_name %s", princ_name);
73	goto out2;
74    }
75
76    ret = kadm5_get_principal(kadm_handle, princ_ent, &princ,
77			      KADM5_PRINCIPAL | KADM5_KEY_DATA);
78    if (ret) {
79	krb5_free_principal (context, princ_ent);
80	krb5_warnx (context, "no such principal: %s", princ_name);
81	goto out2;
82    }
83
84    new_key_data   = malloc(princ.n_key_data * sizeof(*new_key_data));
85    if (new_key_data == NULL && princ.n_key_data != 0) {
86	krb5_warnx (context, "out of memory");
87	goto out;
88    }
89
90    for (i = 0, j = 0; i < princ.n_key_data; ++i) {
91	krb5_key_data *key = &princ.key_data[i];
92	int docopy = 1;
93
94	for (k = 0; k < n_etypes; ++k)
95	    if (etypes[k] == key->key_data_type[0]) {
96		docopy = 0;
97		break;
98	    }
99	if (docopy) {
100	    new_key_data[j++] = *key;
101	} else {
102	    int16_t ignore = 1;
103
104	    kadm5_free_key_data (kadm_handle, &ignore, key);
105	}
106    }
107
108    free (princ.key_data);
109    if (j == 0) {
110	free(new_key_data);
111	new_key_data = NULL;
112    }
113    princ.n_key_data = j;
114    princ.key_data   = new_key_data;
115
116    ret = kadm5_modify_principal (kadm_handle, &princ, KADM5_KEY_DATA);
117    if (ret)
118	krb5_warn(context, ret, "kadm5_modify_principal");
119out:
120    krb5_free_principal (context, princ_ent);
121    kadm5_free_principal_ent(kadm_handle, &princ);
122out2:
123    free (etypes);
124    return ret != 0;
125}
126