third_party/heimdal/kadmin/del.c

   1 /*
   2  * Copyright (c) 1997 - 2004 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 static int
  38 do_del_entry(krb5_principal principal, void *data)
  39 {
  40     return kadm5_delete_principal(kadm_handle, principal);
  41 }
  42
  43 int
  44 del_entry(void *opt, int argc, char **argv)
  45 {
  46     int i;
  47     krb5_error_code ret = 0;
  48
  49     for(i = 0; i < argc; i++) {
  50         ret = foreach_principal(argv[i], do_del_entry, "del", NULL);
  51         if (ret)
  52             break;
  53     }
  54     return ret != 0;
  55 }
  56
  57 static int
  58 do_del_ns_entry(krb5_principal nsp, void *data)
  59 {
  60     krb5_error_code ret;
  61     krb5_principal p = NULL;
  62     const char *comp0 = krb5_principal_get_comp_string(context, nsp, 0);
  63     const char *comp1 = krb5_principal_get_comp_string(context, nsp, 1);
  64     char *unsp = NULL;
  65
  66     if (krb5_principal_get_num_comp(context, nsp) != 2) {
  67         (void) krb5_unparse_name(context, nsp, &unsp);
  68         krb5_warn(context, ret = EINVAL, "Not a valid namespace name %s",
  69                    unsp ? unsp : "<Out of memory>");
  70         return EINVAL;
  71     }
  72
  73     ret = krb5_make_principal(context, &p,
  74                               krb5_principal_get_realm(context, nsp),
  75                               "WELLKNOWN", HDB_WK_NAMESPACE, NULL);
  76     if (ret == 0)
  77         ret = krb5_principal_set_comp_string(context, p, 2, comp0);
  78     if (ret == 0)
  79         ret = krb5_principal_set_comp_string(context, p, 3, comp1);
  80     if (ret == 0)
  81         ret = kadm5_delete_principal(kadm_handle, p);
  82     krb5_free_principal(context, p);
  83     free(unsp);
  84     return ret;
  85 }
  86
  87 int
  88 del_namespace(void *opt, int argc, char **argv)
  89 {
  90     int i;
  91     krb5_error_code ret = 0;
  92
  93     for(i = 0; i < argc; i++) {
  94         ret = foreach_principal(argv[i], do_del_ns_entry, "del_ns", NULL);
  95         if (ret)
  96             break;
  97     }
  98     return ret != 0;
  99 }
 100
 101 int
 102 del_alias(void *opt, int argc, char **argv)
 103 {
 104     krb5_error_code ret;
 105     size_t i;
 106
 107
 108     if (argc < 1) {
 109         krb5_warnx(context, "No aliases given");
 110         return 1;
 111     }
 112
 113     for (; argc; argc--, argv++) {
 114         kadm5_principal_ent_rec princ;
 115         krb5_principal p;
 116         HDB_Ext_Aliases *a;
 117         HDB_extension ext;
 118         krb5_tl_data *tl;
 119         krb5_data d;
 120
 121         if ((ret = krb5_parse_name(context, argv[0], &p))) {
 122             krb5_warn(context, ret, "Invalid principal: %s", argv[0]);
 123             return 1;
 124         }
 125
 126         memset(&princ, 0, sizeof(princ));
 127         ret = kadm5_get_principal(kadm_handle, p, &princ,
 128                                   KADM5_PRINCIPAL_NORMAL_MASK | KADM5_TL_DATA);
 129         if (ret) {
 130             krb5_warn(context, ret, "Principal alias not found %s", argv[0]);
 131             continue;
 132         }
 133
 134         if (krb5_principal_compare(context, p, princ.principal)) {
 135             krb5_warn(context, ret, "Not deleting principal %s because it is "
 136                       "not an alias; use 'delete' to delete the principal",
 137                       argv[0]);
 138             continue;
 139         }
 140
 141         a = &ext.data.u.aliases;
 142         a->case_insensitive = 0;
 143         a->aliases.len = 0;
 144         a->aliases.val = 0;
 145         if ((tl = get_tl(&princ, KRB5_TL_ALIASES)) == NULL) {
 146             krb5_warnx(context, "kadm5_get_principal() found principal %s but "
 147                        "not its aliases", argv[0]);
 148             kadm5_free_principal_ent(kadm_handle, &princ);
 149             krb5_free_principal(context, p);
 150             return 1;
 151         }
 152
 153         ret = decode_HDB_Ext_Aliases(tl->tl_data_contents, tl->tl_data_length,
 154                                      a, NULL);
 155         if (ret) {
 156             krb5_warn(context, ret, "Principal alias list could not be decoded");
 157             kadm5_free_principal_ent(kadm_handle, &princ);
 158             krb5_free_principal(context, p);
 159             return 1;
 160         }
 161
 162         /*
 163          * Remove alias, but also, don't assume it appears only once in aliases
 164          * list.
 165          */
 166         i = 0;
 167         while (i < a->aliases.len) {
 168             if (!krb5_principal_compare(context, p, &a->aliases.val[i])) {
 169                 i++;
 170                 continue;
 171             }
 172             free_Principal(&a->aliases.val[i]);
 173             if (i + 1 < a->aliases.len)
 174                 memmove(&a->aliases.val[i],
 175                         &a->aliases.val[i + 1],
 176                         sizeof(a->aliases.val[i]) * (a->aliases.len - (i + 1)));
 177             if (a->aliases.len)
 178                 a->aliases.len--;
 179             continue;
 180         }
 181
 182         krb5_data_zero(&d);
 183         ext.data.element = choice_HDB_extension_data_aliases;
 184         ext.mandatory = 0;
 185         if (ret == 0)
 186             ASN1_MALLOC_ENCODE(HDB_extension, d.data, d.length, &ext, &i, ret);
 187         free_HDB_Ext_Aliases(a);
 188         if (ret == 0) {
 189             int16_t len = d.length;
 190
 191             if (len < 0 || d.length != (size_t)len) {
 192                 krb5_warnx(context, "Too many aliases; does not fit in 32767 bytes");
 193                 ret = EOVERFLOW;
 194             } else  {
 195                 add_tl(&princ, KRB5_TL_EXTENSION, &d);
 196                 krb5_data_zero(&d);
 197             }
 198         }
 199         if (ret == 0) {
 200             ret = kadm5_modify_principal(kadm_handle, &princ,
 201                                          KADM5_PRINCIPAL | KADM5_TL_DATA);
 202             if (ret)
 203                 krb5_warn(context, ret, "kadm5_modify_principal");
 204         }
 205
 206         kadm5_free_principal_ent(kadm_handle, &princ);
 207         krb5_free_principal(context, p);
 208         krb5_data_free(&d);
 209         p = NULL;
 210     }
 211
 212     return ret == 0 ? 0 : 1;
 213 }