2 * Copyright (c) 1997 - 2000 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
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.
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.
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
34 #include "kadm5_locl.h"
39 * free all the memory used by (len, keys)
43 _kadm5_free_keys (krb5_context context,
46 hdb_free_keys(context, len, keys);
50 * null-ify `len', `keys'
54 _kadm5_init_keys (Key *keys, int len)
58 for (i = 0; i < len; ++i) {
61 keys[i].key.keyvalue.length = 0;
62 keys[i].key.keyvalue.data = NULL;
68 * return 1 if any key in `keys1, len1' exists in `keys2, len2'
71 _kadm5_exists_keys(Key *keys1, int len1, Key *keys2, int len2)
76 for (i = 0; i < len1; ++i) {
78 for (j = 0; j < len2; j++) {
79 if ((keys1[i].salt != NULL && keys2[j].salt == NULL)
80 || (keys1[i].salt == NULL && keys2[j].salt != NULL))
83 if (keys1[i].salt != NULL) {
84 if (keys1[i].salt->type != keys2[j].salt->type)
86 if (keys1[i].salt->salt.length != keys2[j].salt->salt.length)
88 if (memcmp (keys1[i].salt->salt.data, keys2[j].salt->salt.data,
89 keys1[i].salt->salt.length) != 0)
92 if (keys1[i].key.keytype != keys2[j].key.keytype)
95 if (keys1[i].key.keyvalue.length != keys2[j].key.keyvalue.length)
97 if (memcmp (keys1[i].key.keyvalue.data, keys2[j].key.keyvalue.data,
98 keys1[i].key.keyvalue.length) != 0)
105 * Optimization: no need to check all of keys1[] if one there
106 * was one key in keys2[] with matching enctype and salt but not
107 * matching key. Assumption: all keys in keys1[] and keys2[]
108 * are output by string2key.
117 * return 1 if any key in `keys1, len1' exists in hist_keys
120 _kadm5_exists_keys_hist(Key *keys1, int len1, HDB_Ext_KeySet *hist_keys)
124 for (i = 0; i < hist_keys->len; i++) {
125 if (_kadm5_exists_keys(keys1, len1,
126 hist_keys->val[i].keys.val,
127 hist_keys->val[i].keys.len))