113 lines
3.3 KiB
C
113 lines
3.3 KiB
C
/*
|
|
* Copyright (c) 1997 - 2000 Kungliga Tekniska Högskolan
|
|
* (Royal Institute of Technology, Stockholm, Sweden).
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* 3. Neither the name of the Institute nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#include "kadm5_locl.h"
|
|
|
|
RCSID("$Id: keys.c,v 1.1 2000/07/22 05:53:02 assar Exp $");
|
|
|
|
/*
|
|
* free all the memory used by (len, keys)
|
|
*/
|
|
|
|
void
|
|
_kadm5_free_keys (kadm5_server_context *context,
|
|
int len, Key *keys)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < len; ++i) {
|
|
free (keys[i].mkvno);
|
|
keys[i].mkvno = NULL;
|
|
if (keys[i].salt != NULL) {
|
|
free_Salt(keys[i].salt);
|
|
free(keys[i].salt);
|
|
keys[i].salt = NULL;
|
|
}
|
|
krb5_free_keyblock_contents(context->context, &keys[i].key);
|
|
}
|
|
free (keys);
|
|
}
|
|
|
|
/*
|
|
* null-ify `len', `keys'
|
|
*/
|
|
|
|
void
|
|
_kadm5_init_keys (Key *keys, int len)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < len; ++i) {
|
|
keys[i].mkvno = NULL;
|
|
keys[i].salt = NULL;
|
|
keys[i].key.keyvalue.length = 0;
|
|
keys[i].key.keyvalue.data = NULL;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* return 0 iff `keys1, len1' and `keys2, len2' are identical
|
|
*/
|
|
|
|
int
|
|
_kadm5_cmp_keys(Key *keys1, int len1, Key *keys2, int len2)
|
|
{
|
|
int i;
|
|
|
|
if (len1 != len2)
|
|
return 1;
|
|
|
|
for (i = 0; i < len1; ++i) {
|
|
if ((keys1[i].salt != NULL && keys2[i].salt == NULL)
|
|
|| (keys1[i].salt == NULL && keys2[i].salt != NULL))
|
|
return 1;
|
|
if (keys1[i].salt != NULL) {
|
|
if (keys1[i].salt->type != keys2[i].salt->type)
|
|
return 1;
|
|
if (keys1[i].salt->salt.length != keys2[i].salt->salt.length)
|
|
return 1;
|
|
if (memcmp (keys1[i].salt->salt.data, keys2[i].salt->salt.data,
|
|
keys1[i].salt->salt.length) != 0)
|
|
return 1;
|
|
}
|
|
if (keys1[i].key.keytype != keys2[i].key.keytype)
|
|
return 1;
|
|
if (keys1[i].key.keyvalue.length != keys2[i].key.keyvalue.length)
|
|
return 1;
|
|
if (memcmp (keys1[i].key.keyvalue.data, keys2[i].key.keyvalue.data,
|
|
keys1[i].key.keyvalue.length) != 0)
|
|
return 1;
|
|
}
|
|
return 0;
|
|
}
|