No empty .Rs/.Re
[netbsd-mini2440.git] / crypto / dist / heimdal / lib / kadm5 / keys.c
blob7c5bbacdcfd6849653c1c7fefcf1cabd079fb7e5
1 /*
2 * Copyright (c) 1997 - 2000 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
4 * All rights reserved.
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
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
31 * SUCH DAMAGE.
34 #include "kadm5_locl.h"
36 __RCSID("$Heimdal: keys.c 14297 2004-10-11 23:50:25Z lha $"
37 "$NetBSD$");
40 * free all the memory used by (len, keys)
43 void
44 _kadm5_free_keys (krb5_context context,
45 int len, Key *keys)
47 hdb_free_keys(context, len, keys);
51 * null-ify `len', `keys'
54 void
55 _kadm5_init_keys (Key *keys, int len)
57 int i;
59 for (i = 0; i < len; ++i) {
60 keys[i].mkvno = NULL;
61 keys[i].salt = NULL;
62 keys[i].key.keyvalue.length = 0;
63 keys[i].key.keyvalue.data = NULL;
68 * return 0 iff `keys1, len1' and `keys2, len2' are identical
71 int
72 _kadm5_cmp_keys(Key *keys1, int len1, Key *keys2, int len2)
74 int i;
76 if (len1 != len2)
77 return 1;
79 for (i = 0; i < len1; ++i) {
80 if ((keys1[i].salt != NULL && keys2[i].salt == NULL)
81 || (keys1[i].salt == NULL && keys2[i].salt != NULL))
82 return 1;
83 if (keys1[i].salt != NULL) {
84 if (keys1[i].salt->type != keys2[i].salt->type)
85 return 1;
86 if (keys1[i].salt->salt.length != keys2[i].salt->salt.length)
87 return 1;
88 if (memcmp (keys1[i].salt->salt.data, keys2[i].salt->salt.data,
89 keys1[i].salt->salt.length) != 0)
90 return 1;
92 if (keys1[i].key.keytype != keys2[i].key.keytype)
93 return 1;
94 if (keys1[i].key.keyvalue.length != keys2[i].key.keyvalue.length)
95 return 1;
96 if (memcmp (keys1[i].key.keyvalue.data, keys2[i].key.keyvalue.data,
97 keys1[i].key.keyvalue.length) != 0)
98 return 1;
100 return 0;