Debian Codegraph @

lib/kadm5/randkey_c.c

raw
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
36 RCSID("$Id$");
37
38 kadm5_ret_t
39 kadm5_c_randkey_principal(void *server_handle,
40 krb5_principal princ,
41 krb5_boolean keepold,
42 int n_ks_tuple,
43 krb5_key_salt_tuple *ks_tuple,
44 krb5_keyblock **new_keys,
45 int *n_keys)
46 {
47 kadm5_client_context *context = server_handle;
48 kadm5_ret_t ret;
49 krb5_storage *sp;
50 unsigned char buf[1536];
51 int32_t tmp;
52 size_t i;
53 krb5_data reply;
54
55 ret = _kadm5_connect(server_handle);
56 if(ret)
57 return ret;
58
59 sp = krb5_storage_from_mem(buf, sizeof(buf));
60 if (sp == NULL) {
61 krb5_clear_error_message(context->context);
62 return ENOMEM;
63 }
64
65 /*
66 * NOTE WELL: This message is extensible. It currently consists of:
67 *
68 * - opcode (kadm_randkey)
69 * - principal name (princ)
70 *
71 * followed by optional items, each of which must be present if
72 * there are any items following them that are also present:
73 *
74 * - keepold boolean (whether to delete old kvnos)
75 * - number of key/salt type tuples
76 * - array of {enctype, salttype}
77 *
78 * Eventually we may add:
79 *
80 * - opaque string2key parameters (salt, rounds, ...)
81 */
82 ret = krb5_store_int32(sp, kadm_randkey);
83 if (ret == 0)
84 ret = krb5_store_principal(sp, princ);
85
86 if (ret == 0 && (keepold == TRUE || n_ks_tuple > 0))
87 ret = krb5_store_uint32(sp, keepold);
88 if (ret == 0 && n_ks_tuple > 0)
89 ret = krb5_store_uint32(sp, n_ks_tuple);
90 for (i = 0; ret == 0 && i < n_ks_tuple; i++) {
91 ret = krb5_store_int32(sp, ks_tuple[i].ks_enctype);
92 if (ret == 0)
93 krb5_store_int32(sp, ks_tuple[i].ks_salttype);
94 }
95 if (ret)
96 return ret;
97 /* Future extensions go here */
98
99 ret = _kadm5_client_send(context, sp);
100 krb5_storage_free(sp);
101 if (ret)
102 return ret;
103 ret = _kadm5_client_recv(context, &reply);
104 if(ret)
105 return ret;
106 sp = krb5_storage_from_data(&reply);
107 if (sp == NULL) {
108 krb5_clear_error_message(context->context);
109 krb5_data_free (&reply);
110 return ENOMEM;
111 }
112 krb5_clear_error_message(context->context);
113 ret = krb5_ret_int32(sp, &tmp);
114 if (ret == 0)
115 ret = tmp;
116 if (ret == 0){
117 krb5_keyblock *k;
118
119 ret = krb5_ret_int32(sp, &tmp);
120 if (ret)
121 goto out;
122 if (tmp < 0) {
123 ret = EOVERFLOW;
124 goto out;
125 }
126 k = calloc(tmp, sizeof(*k));
127 if (k == NULL) {
128 ret = ENOMEM;
129 goto out;
130 }
131 for(i = 0; ret == 0 && i < tmp; i++)
132 ret = krb5_ret_keyblock(sp, &k[i]);
133 if (ret == 0 && n_keys && new_keys) {
134 *n_keys = tmp;
135 *new_keys = k;
136 } else {
137 krb5_free_keyblock_contents(context->context, &k[i]);
138 for (; i > 0; i--)
139 krb5_free_keyblock_contents(context->context, &k[i - 1]);
140 free(k);
141 }
142 }
143 out:
144 krb5_storage_free(sp);
145 krb5_data_free (&reply);
146 return ret;
147 }