remove gcc34
[dragonfly.git] / crypto / heimdal-0.6.3 / lib / kadm5 / keys.c
blob3ae21abb47618965a93c946872351ddf8882ca5b
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("$Id: keys.c,v 1.1 2000/07/22 05:53:02 assar Exp $");
39 * free all the memory used by (len, keys)
42 void
43 _kadm5_free_keys (kadm5_server_context *context,
44 int len, Key *keys)
46 int i;
48 for (i = 0; i < len; ++i) {
49 free (keys[i].mkvno);
50 keys[i].mkvno = NULL;
51 if (keys[i].salt != NULL) {
52 free_Salt(keys[i].salt);
53 free(keys[i].salt);
54 keys[i].salt = NULL;
56 krb5_free_keyblock_contents(context->context, &keys[i].key);
58 free (keys);
62 * null-ify `len', `keys'
65 void
66 _kadm5_init_keys (Key *keys, int len)
68 int i;
70 for (i = 0; i < len; ++i) {
71 keys[i].mkvno = NULL;
72 keys[i].salt = NULL;
73 keys[i].key.keyvalue.length = 0;
74 keys[i].key.keyvalue.data = NULL;
79 * return 0 iff `keys1, len1' and `keys2, len2' are identical
82 int
83 _kadm5_cmp_keys(Key *keys1, int len1, Key *keys2, int len2)
85 int i;
87 if (len1 != len2)
88 return 1;
90 for (i = 0; i < len1; ++i) {
91 if ((keys1[i].salt != NULL && keys2[i].salt == NULL)
92 || (keys1[i].salt == NULL && keys2[i].salt != NULL))
93 return 1;
94 if (keys1[i].salt != NULL) {
95 if (keys1[i].salt->type != keys2[i].salt->type)
96 return 1;
97 if (keys1[i].salt->salt.length != keys2[i].salt->salt.length)
98 return 1;
99 if (memcmp (keys1[i].salt->salt.data, keys2[i].salt->salt.data,
100 keys1[i].salt->salt.length) != 0)
101 return 1;
103 if (keys1[i].key.keytype != keys2[i].key.keytype)
104 return 1;
105 if (keys1[i].key.keyvalue.length != keys2[i].key.keyvalue.length)
106 return 1;
107 if (memcmp (keys1[i].key.keyvalue.data, keys2[i].key.keyvalue.data,
108 keys1[i].key.keyvalue.length) != 0)
109 return 1;
111 return 0;