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