crypto/dist/heimdal/kadmin/ext.c

   1 /*
   2  * Copyright (c) 1997 - 2006 Kungliga Tekniska Högskolan
   3  * (Royal Institute of Technology, Stockholm, Sweden).
   4  * All rights reserved.
   5  *
   6  * Redistribution and use in source and binary forms, with or without
   7  * modification, are permitted provided that the following conditions
   8  * are met:
   9  *
  10  * 1. Redistributions of source code must retain the above copyright
  11  *    notice, this list of conditions and the following disclaimer.
  12  *
  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.
  16  *
  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.
  20  *
  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.
  32  */
  33
  34 #include "kadmin_locl.h"
  35 #include "kadmin-commands.h"
  36
  37 __RCSID("$Heimdal: ext.c 16658 2006-01-25 12:29:46Z lha $"
  38         "$NetBSD$");
  39
  40 struct ext_keytab_data {
  41     krb5_keytab keytab;
  42 };
  43
  44 static int
  45 do_ext_keytab(krb5_principal principal, void *data)
  46 {
  47     krb5_error_code ret;
  48     kadm5_principal_ent_rec princ;
  49     struct ext_keytab_data *e = data;
  50     krb5_keytab_entry *keys = NULL;
  51     krb5_keyblock *k = NULL;
  52     int i, n_k;
  53
  54     ret = kadm5_get_principal(kadm_handle, principal, &princ,
  55                               KADM5_PRINCIPAL|KADM5_KVNO|KADM5_KEY_DATA);
  56     if(ret)
  57         return ret;
  58
  59     if (princ.n_key_data) {
  60         keys = malloc(sizeof(*keys) * princ.n_key_data);
  61         if (keys == NULL) {
  62             kadm5_free_principal_ent(kadm_handle, &princ);
  63             krb5_clear_error_string(context);
  64             return ENOMEM;
  65         }
  66         for (i = 0; i < princ.n_key_data; i++) {
  67             krb5_key_data *kd = &princ.key_data[i];
  68
  69             keys[i].principal = princ.principal;
  70             keys[i].vno = kd->key_data_kvno;
  71             keys[i].keyblock.keytype = kd->key_data_type[0];
  72             keys[i].keyblock.keyvalue.length = kd->key_data_length[0];
  73             keys[i].keyblock.keyvalue.data = kd->key_data_contents[0];
  74             keys[i].timestamp = time(NULL);
  75         }
  76
  77         n_k = princ.n_key_data;
  78     } else {
  79         ret = kadm5_randkey_principal(kadm_handle, principal, &k, &n_k);
  80         if (ret) {
  81             kadm5_free_principal_ent(kadm_handle, &princ);
  82             return ret;
  83         }
  84         keys = malloc(sizeof(*keys) * n_k);
  85         if (keys == NULL) {
  86             kadm5_free_principal_ent(kadm_handle, &princ);
  87             krb5_clear_error_string(context);
  88             return ENOMEM;
  89         }
  90         for (i = 0; i < n_k; i++) {
  91             keys[i].principal = principal;
  92             keys[i].vno = princ.kvno + 1; /* XXX get entry again */
  93             keys[i].keyblock = k[i];
  94             keys[i].timestamp = time(NULL);
  95         }
  96     }
  97
  98     for(i = 0; i < n_k; i++) {
  99         ret = krb5_kt_add_entry(context, e->keytab, &keys[i]);
 100         if(ret)
 101             krb5_warn(context, ret, "krb5_kt_add_entry(%d)", i);
 102     }
 103
 104     if (k) {
 105         memset(k, 0, n_k * sizeof(*k));
 106         free(k);
 107     }
 108     if (keys)
 109         free(keys);
 110     kadm5_free_principal_ent(kadm_handle, &princ);
 111     return 0;
 112 }
 113
 114 int
 115 ext_keytab(struct ext_keytab_options *opt, int argc, char **argv)
 116 {
 117     krb5_error_code ret;
 118     int i;
 119     struct ext_keytab_data data;
 120
 121     if (opt->keytab_string == NULL)
 122         ret = krb5_kt_default(context, &data.keytab);
 123     else
 124         ret = krb5_kt_resolve(context, opt->keytab_string, &data.keytab);
 125
 126     if(ret){
 127         krb5_warn(context, ret, "krb5_kt_resolve");
 128         return 1;
 129     }
 130
 131     for(i = 0; i < argc; i++) {
 132         ret = foreach_principal(argv[i], do_ext_keytab, "ext", &data);
 133         if (ret)
 134             break;
 135     }
 136
 137     krb5_kt_close(context, data.keytab);
 138
 139     return ret != 0;
 140 }