crypto/external/bsd/heimdal/dist/kadmin/ext.c

   1 /*      $NetBSD: ext.c,v 1.1.1.1 2011/04/13 18:14:35 elric Exp $        */
   2
   3 /*
   4  * Copyright (c) 1997 - 2006 Kungliga Tekniska Högskolan
   5  * (Royal Institute of Technology, Stockholm, Sweden).
   6  * All rights reserved.
   7  *
   8  * Redistribution and use in source and binary forms, with or without
   9  * modification, are permitted provided that the following conditions
  10  * are met:
  11  *
  12  * 1. Redistributions of source code must retain the above copyright
  13  *    notice, this list of conditions and the following disclaimer.
  14  *
  15  * 2. Redistributions in binary form must reproduce the above copyright
  16  *    notice, this list of conditions and the following disclaimer in the
  17  *    documentation and/or other materials provided with the distribution.
  18  *
  19  * 3. Neither the name of the Institute nor the names of its contributors
  20  *    may be used to endorse or promote products derived from this software
  21  *    without specific prior written permission.
  22  *
  23  * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
  24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
  27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  33  * SUCH DAMAGE.
  34  */
  35
  36 #include "kadmin_locl.h"
  37 #include "kadmin-commands.h"
  38
  39 struct ext_keytab_data {
  40     krb5_keytab keytab;
  41 };
  42
  43 static int
  44 do_ext_keytab(krb5_principal principal, void *data)
  45 {
  46     krb5_error_code ret;
  47     kadm5_principal_ent_rec princ;
  48     struct ext_keytab_data *e = data;
  49     krb5_keytab_entry *keys = NULL;
  50     krb5_keyblock *k = NULL;
  51     int i, n_k;
  52
  53     ret = kadm5_get_principal(kadm_handle, principal, &princ,
  54                               KADM5_PRINCIPAL|KADM5_KVNO|KADM5_KEY_DATA);
  55     if(ret)
  56         return ret;
  57
  58     if (princ.n_key_data) {
  59         keys = malloc(sizeof(*keys) * princ.n_key_data);
  60         if (keys == NULL) {
  61             kadm5_free_principal_ent(kadm_handle, &princ);
  62             krb5_clear_error_message(context);
  63             return ENOMEM;
  64         }
  65         for (i = 0; i < princ.n_key_data; i++) {
  66             krb5_key_data *kd = &princ.key_data[i];
  67
  68             keys[i].principal = princ.principal;
  69             keys[i].vno = kd->key_data_kvno;
  70             keys[i].keyblock.keytype = kd->key_data_type[0];
  71             keys[i].keyblock.keyvalue.length = kd->key_data_length[0];
  72             keys[i].keyblock.keyvalue.data = kd->key_data_contents[0];
  73             keys[i].timestamp = time(NULL);
  74         }
  75
  76         n_k = princ.n_key_data;
  77     } else {
  78         ret = kadm5_randkey_principal(kadm_handle, principal, &k, &n_k);
  79         if (ret) {
  80             kadm5_free_principal_ent(kadm_handle, &princ);
  81             return ret;
  82         }
  83         keys = malloc(sizeof(*keys) * n_k);
  84         if (keys == NULL) {
  85             kadm5_free_principal_ent(kadm_handle, &princ);
  86             krb5_clear_error_message(context);
  87             return ENOMEM;
  88         }
  89         for (i = 0; i < n_k; i++) {
  90             keys[i].principal = principal;
  91             keys[i].vno = princ.kvno + 1; /* XXX get entry again */
  92             keys[i].keyblock = k[i];
  93             keys[i].timestamp = time(NULL);
  94         }
  95     }
  96
  97     for(i = 0; i < n_k; i++) {
  98         ret = krb5_kt_add_entry(context, e->keytab, &keys[i]);
  99         if(ret)
 100             krb5_warn(context, ret, "krb5_kt_add_entry(%d)", i);
 101     }
 102
 103     if (k) {
 104         memset(k, 0, n_k * sizeof(*k));
 105         free(k);
 106     }
 107     if (keys)
 108         free(keys);
 109     kadm5_free_principal_ent(kadm_handle, &princ);
 110     return 0;
 111 }
 112
 113 int
 114 ext_keytab(struct ext_keytab_options *opt, int argc, char **argv)
 115 {
 116     krb5_error_code ret;
 117     int i;
 118     struct ext_keytab_data data;
 119
 120     if (opt->keytab_string == NULL)
 121         ret = krb5_kt_default(context, &data.keytab);
 122     else
 123         ret = krb5_kt_resolve(context, opt->keytab_string, &data.keytab);
 124
 125     if(ret){
 126         krb5_warn(context, ret, "krb5_kt_resolve");
 127         return 1;
 128     }
 129
 130     for(i = 0; i < argc; i++) {
 131         ret = foreach_principal(argv[i], do_ext_keytab, "ext", &data);
 132         if (ret)
 133             break;
 134     }
 135
 136     krb5_kt_close(context, data.keytab);
 137
 138     return ret != 0;
 139 }