kadmin/add-random-users.c

   1 /*
   2  * Copyright (c) 2000 - 2001 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
  36 #define WORDS_FILENAME "/usr/share/dict/words"
  37
  38 #define NUSERS 1000
  39
  40 #define WORDBUF_SIZE 65535
  41
  42 static unsigned
  43 read_words (const char *filename, char ***ret_w)
  44 {
  45     unsigned n, alloc;
  46     FILE *f;
  47     char buf[256];
  48     char **w = NULL;
  49     char *wbuf = NULL, *wptr = NULL, *wend = NULL;
  50
  51     f = fopen (filename, "r");
  52     if (f == NULL)
  53         err (1, "cannot open %s", filename);
  54     alloc = n = 0;
  55     while (fgets (buf, sizeof(buf), f) != NULL) {
  56         size_t len;
  57
  58         buf[strcspn(buf, "\r\n")] = '\0';
  59         if (n >= alloc) {
  60             alloc = max(alloc + 16, alloc * 2);
  61             w = erealloc (w, alloc * sizeof(char **));
  62         }
  63         len = strlen(buf);
  64         if (wptr + len + 1 >= wend) {
  65             wptr = wbuf = emalloc (WORDBUF_SIZE);
  66             wend = wbuf + WORDBUF_SIZE;
  67         }
  68         memmove (wptr, buf, len + 1);
  69         w[n++] = wptr;
  70         wptr += len + 1;
  71     }
  72     if (n == 0)
  73         errx(1, "%s is an empty file, no words to try", filename);
  74     *ret_w = w;
  75     fclose(f);
  76     return n;
  77 }
  78
  79 static void
  80 add_user (krb5_context ctx, void *hndl, unsigned nwords, char **words)
  81 {
  82     kadm5_principal_ent_rec princ;
  83     char name[64];
  84     int r1, r2;
  85     krb5_error_code ret;
  86     int mask;
  87
  88     r1 = rand();
  89     r2 = rand();
  90
  91     snprintf (name, sizeof(name), "%s%d", words[r1 % nwords], r2 % 1000);
  92
  93     mask = KADM5_PRINCIPAL;
  94
  95     memset(&princ, 0, sizeof(princ));
  96     ret = krb5_parse_name(ctx, name, &princ.principal);
  97     if (ret)
  98         krb5_err(ctx, 1, ret, "krb5_parse_name");
  99
 100     ret = kadm5_create_principal (hndl, &princ, mask, name);
 101     if (ret)
 102         krb5_err (ctx, 1, ret, "kadm5_create_principal");
 103     kadm5_free_principal_ent(hndl, &princ);
 104     printf ("%s\n", name);
 105 }
 106
 107 static void
 108 add_users (const char *filename, unsigned n)
 109 {
 110     krb5_error_code ret;
 111     int i;
 112     void *hndl;
 113     krb5_context ctx;
 114     unsigned nwords;
 115     char **words;
 116
 117     ret = krb5_init_context(&ctx);
 118     if (ret)
 119         errx (1, "krb5_init_context failed: %d", ret);
 120     ret = kadm5_s_init_with_password_ctx(ctx,
 121                                          KADM5_ADMIN_SERVICE,
 122                                          NULL,
 123                                          KADM5_ADMIN_SERVICE,
 124                                          NULL, 0, 0,
 125                                          &hndl);
 126     if(ret)
 127         krb5_err(ctx, 1, ret, "kadm5_init_with_password");
 128
 129     nwords = read_words (filename, &words);
 130
 131     for (i = 0; i < n; ++i)
 132         add_user (ctx, hndl, nwords, words);
 133     kadm5_destroy(hndl);
 134     krb5_free_context(ctx);
 135     free(words);
 136 }
 137
 138 static int version_flag = 0;
 139 static int help_flag    = 0;
 140
 141 static struct getargs args[] = {
 142     { "version",        0,   arg_flag, &version_flag, NULL, NULL },
 143     { "help",           0,   arg_flag, &help_flag,    NULL, NULL }
 144 };
 145
 146 static void
 147 usage (int ret)
 148 {
 149     arg_printusage (args,
 150                     sizeof(args)/sizeof(*args),
 151                     NULL,
 152                     "[filename [n]]");
 153     exit (ret);
 154 }
 155
 156 int
 157 main(int argc, char **argv)
 158 {
 159     int optidx = 0;
 160     int n = NUSERS;
 161     const char *filename = WORDS_FILENAME;
 162
 163     setprogname(argv[0]);
 164     if(getarg(args, sizeof(args) / sizeof(args[0]), argc, argv, &optidx))
 165         usage(1);
 166     if (help_flag)
 167         usage (0);
 168     if (version_flag) {
 169         print_version(NULL);
 170         return 0;
 171     }
 172     srand (0);
 173     argc -= optidx;
 174     argv += optidx;
 175
 176     if (argc > 0) {
 177         if (argc > 1)
 178             n = atoi(argv[1]);
 179         filename = argv[0];
 180     }
 181
 182     add_users (filename, n);
 183     return 0;
 184 }