2000-01-09 20:58:00 +00:00
|
|
|
/*
|
2011-10-05 07:23:29 +00:00
|
|
|
* Copyright (c) 1997 - 2006 Kungliga Tekniska Högskolan
|
|
|
|
* (Royal Institute of Technology, Stockholm, Sweden).
|
|
|
|
* All rights reserved.
|
2000-01-09 20:58:00 +00:00
|
|
|
*
|
2011-10-05 07:23:29 +00:00
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
2000-01-09 20:58:00 +00:00
|
|
|
*
|
2011-10-05 07:23:29 +00:00
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
2000-01-09 20:58:00 +00:00
|
|
|
*
|
2011-10-05 07:23:29 +00:00
|
|
|
* 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.
|
2000-01-09 20:58:00 +00:00
|
|
|
*
|
2011-10-05 07:23:29 +00:00
|
|
|
* 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.
|
2000-01-09 20:58:00 +00:00
|
|
|
*
|
2011-10-05 07:23:29 +00:00
|
|
|
* 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.
|
2000-01-09 20:58:00 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "kadmin_locl.h"
|
2008-05-07 13:39:42 +00:00
|
|
|
#include "kadmin-commands.h"
|
2000-01-09 20:58:00 +00:00
|
|
|
|
|
|
|
struct ext_keytab_data {
|
|
|
|
krb5_keytab keytab;
|
|
|
|
};
|
|
|
|
|
|
|
|
static int
|
|
|
|
do_ext_keytab(krb5_principal principal, void *data)
|
|
|
|
{
|
|
|
|
krb5_error_code ret;
|
|
|
|
kadm5_principal_ent_rec princ;
|
|
|
|
struct ext_keytab_data *e = data;
|
2008-05-07 13:39:42 +00:00
|
|
|
krb5_keytab_entry *keys = NULL;
|
|
|
|
krb5_keyblock *k = NULL;
|
|
|
|
int i, n_k;
|
2011-10-05 07:23:29 +00:00
|
|
|
|
|
|
|
ret = kadm5_get_principal(kadm_handle, principal, &princ,
|
2000-01-09 20:58:00 +00:00
|
|
|
KADM5_PRINCIPAL|KADM5_KVNO|KADM5_KEY_DATA);
|
|
|
|
if(ret)
|
|
|
|
return ret;
|
2008-05-07 13:39:42 +00:00
|
|
|
|
|
|
|
if (princ.n_key_data) {
|
|
|
|
keys = malloc(sizeof(*keys) * princ.n_key_data);
|
|
|
|
if (keys == NULL) {
|
|
|
|
kadm5_free_principal_ent(kadm_handle, &princ);
|
2011-10-05 07:23:29 +00:00
|
|
|
krb5_clear_error_message(context);
|
2008-05-07 13:39:42 +00:00
|
|
|
return ENOMEM;
|
|
|
|
}
|
|
|
|
for (i = 0; i < princ.n_key_data; i++) {
|
|
|
|
krb5_key_data *kd = &princ.key_data[i];
|
|
|
|
|
|
|
|
keys[i].principal = princ.principal;
|
|
|
|
keys[i].vno = kd->key_data_kvno;
|
|
|
|
keys[i].keyblock.keytype = kd->key_data_type[0];
|
|
|
|
keys[i].keyblock.keyvalue.length = kd->key_data_length[0];
|
|
|
|
keys[i].keyblock.keyvalue.data = kd->key_data_contents[0];
|
|
|
|
keys[i].timestamp = time(NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
n_k = princ.n_key_data;
|
|
|
|
} else {
|
|
|
|
ret = kadm5_randkey_principal(kadm_handle, principal, &k, &n_k);
|
|
|
|
if (ret) {
|
|
|
|
kadm5_free_principal_ent(kadm_handle, &princ);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
keys = malloc(sizeof(*keys) * n_k);
|
|
|
|
if (keys == NULL) {
|
|
|
|
kadm5_free_principal_ent(kadm_handle, &princ);
|
2011-10-05 07:23:29 +00:00
|
|
|
krb5_clear_error_message(context);
|
2008-05-07 13:39:42 +00:00
|
|
|
return ENOMEM;
|
|
|
|
}
|
|
|
|
for (i = 0; i < n_k; i++) {
|
|
|
|
keys[i].principal = principal;
|
|
|
|
keys[i].vno = princ.kvno + 1; /* XXX get entry again */
|
|
|
|
keys[i].keyblock = k[i];
|
|
|
|
keys[i].timestamp = time(NULL);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for(i = 0; i < n_k; i++) {
|
|
|
|
ret = krb5_kt_add_entry(context, e->keytab, &keys[i]);
|
2000-01-09 20:58:00 +00:00
|
|
|
if(ret)
|
2008-05-07 13:39:42 +00:00
|
|
|
krb5_warn(context, ret, "krb5_kt_add_entry(%d)", i);
|
2000-01-09 20:58:00 +00:00
|
|
|
}
|
2008-05-07 13:39:42 +00:00
|
|
|
|
|
|
|
if (k) {
|
|
|
|
memset(k, 0, n_k * sizeof(*k));
|
|
|
|
free(k);
|
|
|
|
}
|
|
|
|
if (keys)
|
|
|
|
free(keys);
|
2000-01-09 20:58:00 +00:00
|
|
|
kadm5_free_principal_ent(kadm_handle, &princ);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2008-05-07 13:39:42 +00:00
|
|
|
ext_keytab(struct ext_keytab_options *opt, int argc, char **argv)
|
2000-01-09 20:58:00 +00:00
|
|
|
{
|
|
|
|
krb5_error_code ret;
|
|
|
|
int i;
|
|
|
|
struct ext_keytab_data data;
|
2008-05-07 13:39:42 +00:00
|
|
|
|
|
|
|
if (opt->keytab_string == NULL)
|
2000-01-09 20:58:00 +00:00
|
|
|
ret = krb5_kt_default(context, &data.keytab);
|
2002-02-19 15:46:56 +00:00
|
|
|
else
|
2008-05-07 13:39:42 +00:00
|
|
|
ret = krb5_kt_resolve(context, opt->keytab_string, &data.keytab);
|
2002-02-19 15:46:56 +00:00
|
|
|
|
2000-01-09 20:58:00 +00:00
|
|
|
if(ret){
|
|
|
|
krb5_warn(context, ret, "krb5_kt_resolve");
|
2008-05-07 13:39:42 +00:00
|
|
|
return 1;
|
2000-01-09 20:58:00 +00:00
|
|
|
}
|
|
|
|
|
2008-05-07 13:39:42 +00:00
|
|
|
for(i = 0; i < argc; i++) {
|
|
|
|
ret = foreach_principal(argv[i], do_ext_keytab, "ext", &data);
|
|
|
|
if (ret)
|
|
|
|
break;
|
|
|
|
}
|
2000-01-09 20:58:00 +00:00
|
|
|
|
|
|
|
krb5_kt_close(context, data.keytab);
|
|
|
|
|
2008-05-07 13:39:42 +00:00
|
|
|
return ret != 0;
|
2000-01-09 20:58:00 +00:00
|
|
|
}
|