1 /* $NetBSD: load.c,v 1.2 2017/01/28 21:31:44 christos Exp $ */ 2 3 /* 4 * Copyright (c) 1997-2005 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 #include <kadm5/private.h> 39 40 struct entry { 41 char *principal; 42 char *key; 43 char *max_life; 44 char *max_renew; 45 char *created; 46 char *modified; 47 char *valid_start; 48 char *valid_end; 49 char *pw_end; 50 char *flags; 51 char *generation; 52 char *extensions; 53 }; 54 55 static char * 56 skip_next(char *p) 57 { 58 while(*p && !isspace((unsigned char)*p)) 59 p++; 60 *p++ = 0; 61 while(*p && isspace((unsigned char)*p)) 62 p++; 63 return p; 64 } 65 66 /* 67 * Parse the time in `s', returning: 68 * -1 if error parsing 69 * 0 if none present 70 * 1 if parsed ok 71 */ 72 73 static int 74 parse_time_string(time_t *t, const char *s) 75 { 76 int year, month, date, hour, minute, second; 77 struct tm tm; 78 79 if(strcmp(s, "-") == 0) 80 return 0; 81 if(sscanf(s, "%04d%02d%02d%02d%02d%02d", 82 &year, &month, &date, &hour, &minute, &second) != 6) 83 return -1; 84 tm.tm_year = year - 1900; 85 tm.tm_mon = month - 1; 86 tm.tm_mday = date; 87 tm.tm_hour = hour; 88 tm.tm_min = minute; 89 tm.tm_sec = second; 90 tm.tm_isdst = 0; 91 *t = timegm(&tm); 92 return 1; 93 } 94 95 /* 96 * parse time, allocating space in *t if it's there 97 */ 98 99 static int 100 parse_time_string_alloc (time_t **t, const char *s) 101 { 102 time_t tmp; 103 int ret; 104 105 *t = NULL; 106 ret = parse_time_string (&tmp, s); 107 if (ret == 1) { 108 *t = malloc (sizeof (**t)); 109 if (*t == NULL) 110 krb5_errx (context, 1, "malloc: out of memory"); 111 **t = tmp; 112 } 113 return ret; 114 } 115 116 /* 117 * see parse_time_string for calling convention 118 */ 119 120 static int 121 parse_integer(unsigned int *u, const char *s) 122 { 123 if(strcmp(s, "-") == 0) 124 return 0; 125 if (sscanf(s, "%u", u) != 1) 126 return -1; 127 return 1; 128 } 129 130 static int 131 parse_integer_alloc (unsigned int **u, const char *s) 132 { 133 unsigned int tmp; 134 int ret; 135 136 *u = NULL; 137 ret = parse_integer (&tmp, s); 138 if (ret == 1) { 139 *u = malloc (sizeof (**u)); 140 if (*u == NULL) 141 krb5_errx (context, 1, "malloc: out of memory"); 142 **u = tmp; 143 } 144 return ret; 145 } 146 147 /* 148 * Parse dumped keys in `str' and store them in `ent' 149 * return -1 if parsing failed 150 */ 151 152 static int 153 parse_keys(hdb_entry *ent, char *str) 154 { 155 krb5_error_code ret; 156 int tmp; 157 char *p; 158 size_t i; 159 160 p = strsep(&str, ":"); 161 if (sscanf(p, "%d", &tmp) != 1) 162 return 1; 163 ent->kvno = tmp; 164 p = strsep(&str, ":"); 165 while(p){ 166 Key *key; 167 key = realloc(ent->keys.val, 168 (ent->keys.len + 1) * sizeof(*ent->keys.val)); 169 if(key == NULL) 170 krb5_errx (context, 1, "realloc: out of memory"); 171 ent->keys.val = key; 172 key = ent->keys.val + ent->keys.len; 173 ent->keys.len++; 174 memset(key, 0, sizeof(*key)); 175 if(sscanf(p, "%d", &tmp) == 1) { 176 key->mkvno = malloc(sizeof(*key->mkvno)); 177 *key->mkvno = tmp; 178 } else 179 key->mkvno = NULL; 180 p = strsep(&str, ":"); 181 if (sscanf(p, "%d", &tmp) != 1) 182 return 1; 183 key->key.keytype = tmp; 184 p = strsep(&str, ":"); 185 ret = krb5_data_alloc(&key->key.keyvalue, (strlen(p) - 1) / 2 + 1); 186 if (ret) 187 krb5_err (context, 1, ret, "krb5_data_alloc"); 188 for(i = 0; i < strlen(p); i += 2) { 189 if(sscanf(p + i, "%02x", &tmp) != 1) 190 return 1; 191 ((u_char*)key->key.keyvalue.data)[i / 2] = tmp; 192 } 193 p = strsep(&str, ":"); 194 if(strcmp(p, "-") != 0){ 195 unsigned type; 196 size_t p_len; 197 198 if(sscanf(p, "%u/", &type) != 1) 199 return 1; 200 p = strchr(p, '/'); 201 if(p == NULL) 202 return 1; 203 p++; 204 p_len = strlen(p); 205 206 key->salt = calloc(1, sizeof(*key->salt)); 207 if (key->salt == NULL) 208 krb5_errx (context, 1, "malloc: out of memory"); 209 key->salt->type = type; 210 211 if (p_len) { 212 if(*p == '\"') { 213 ret = krb5_data_copy(&key->salt->salt, p + 1, p_len - 2); 214 if (ret) 215 krb5_err (context, 1, ret, "krb5_data_copy"); 216 } else { 217 ret = krb5_data_alloc(&key->salt->salt, 218 (p_len - 1) / 2 + 1); 219 if (ret) 220 krb5_err (context, 1, ret, "krb5_data_alloc"); 221 for(i = 0; i < p_len; i += 2){ 222 if (sscanf(p + i, "%02x", &tmp) != 1) 223 return 1; 224 ((u_char*)key->salt->salt.data)[i / 2] = tmp; 225 } 226 } 227 } else 228 krb5_data_zero (&key->salt->salt); 229 } 230 p = strsep(&str, ":"); 231 } 232 return 0; 233 } 234 235 /* 236 * see parse_time_string for calling convention 237 */ 238 239 static int 240 parse_event(Event *ev, char *s) 241 { 242 krb5_error_code ret; 243 char *p; 244 245 if(strcmp(s, "-") == 0) 246 return 0; 247 memset(ev, 0, sizeof(*ev)); 248 p = strsep(&s, ":"); 249 if(parse_time_string(&ev->time, p) != 1) 250 return -1; 251 p = strsep(&s, ":"); 252 ret = krb5_parse_name(context, p, &ev->principal); 253 if (ret) 254 return -1; 255 return 1; 256 } 257 258 static int 259 parse_event_alloc (Event **ev, char *s) 260 { 261 Event tmp; 262 int ret; 263 264 *ev = NULL; 265 ret = parse_event (&tmp, s); 266 if (ret == 1) { 267 *ev = malloc (sizeof (**ev)); 268 if (*ev == NULL) 269 krb5_errx (context, 1, "malloc: out of memory"); 270 **ev = tmp; 271 } 272 return ret; 273 } 274 275 static int 276 parse_hdbflags2int(HDBFlags *f, const char *s) 277 { 278 int ret; 279 unsigned int tmp; 280 281 ret = parse_integer (&tmp, s); 282 if (ret == 1) 283 *f = int2HDBFlags (tmp); 284 return ret; 285 } 286 287 static int 288 parse_generation(char *str, GENERATION **gen) 289 { 290 char *p; 291 int v; 292 293 if(strcmp(str, "-") == 0 || *str == '\0') { 294 *gen = NULL; 295 return 0; 296 } 297 *gen = calloc(1, sizeof(**gen)); 298 299 p = strsep(&str, ":"); 300 if(parse_time_string(&(*gen)->time, p) != 1) 301 return -1; 302 p = strsep(&str, ":"); 303 if(sscanf(p, "%d", &v) != 1) 304 return -1; 305 (*gen)->usec = v; 306 p = strsep(&str, ":"); 307 if(sscanf(p, "%d", &v) != 1) 308 return -1; 309 (*gen)->gen = v - 1; /* XXX gets bumped in _hdb_store */ 310 return 0; 311 } 312 313 static int 314 parse_extensions(char *str, HDB_extensions **e) 315 { 316 char *p; 317 int ret; 318 319 if(strcmp(str, "-") == 0 || *str == '\0') { 320 *e = NULL; 321 return 0; 322 } 323 *e = calloc(1, sizeof(**e)); 324 325 p = strsep(&str, ":"); 326 327 while (p) { 328 HDB_extension ext; 329 ssize_t len; 330 void *d; 331 332 len = strlen(p); 333 d = malloc(len); 334 335 len = hex_decode(p, d, len); 336 if (len < 0) { 337 free(d); 338 return -1; 339 } 340 341 ret = decode_HDB_extension(d, len, &ext, NULL); 342 free(d); 343 if (ret) 344 return -1; 345 d = realloc((*e)->val, ((*e)->len + 1) * sizeof((*e)->val[0])); 346 if (d == NULL) 347 abort(); 348 (*e)->val = d; 349 (*e)->val[(*e)->len] = ext; 350 (*e)->len++; 351 352 p = strsep(&str, ":"); 353 } 354 355 return 0; 356 } 357 358 359 /* 360 * Parse the dump file in `filename' and create the database (merging 361 * iff merge) 362 */ 363 364 static int 365 doit(const char *filename, int mergep) 366 { 367 krb5_error_code ret = 0; 368 FILE *f; 369 char s[8192]; /* XXX should fix this properly */ 370 char *p; 371 int line; 372 int flags = O_RDWR; 373 struct entry e; 374 hdb_entry_ex ent; 375 HDB *db = _kadm5_s_get_db(kadm_handle); 376 377 f = fopen(filename, "r"); 378 if(f == NULL){ 379 krb5_warn(context, errno, "fopen(%s)", filename); 380 return 1; 381 } 382 /* 383 * We don't have a version number in the dump, so we don't know which iprop 384 * log entries to keep, if any. We throw the log away. 385 * 386 * We could merge the ipropd-master/slave dump/load here as an option, in 387 * which case we would first load the dump. 388 * 389 * If we're merging, first recover unconfirmed records in the existing log. 390 */ 391 if (mergep) 392 ret = kadm5_log_init(kadm_handle); 393 if (ret == 0) 394 ret = kadm5_log_reinit(kadm_handle, 0); 395 if (ret) { 396 fclose (f); 397 krb5_warn(context, ret, "kadm5_log_reinit"); 398 return 1; 399 } 400 401 if(!mergep) 402 flags |= O_CREAT | O_TRUNC; 403 ret = db->hdb_open(context, db, flags, 0600); 404 if(ret){ 405 krb5_warn(context, ret, "hdb_open"); 406 fclose(f); 407 return 1; 408 } 409 line = 0; 410 ret = 0; 411 while(fgets(s, sizeof(s), f) != NULL) { 412 line++; 413 414 p = s; 415 while (isspace((unsigned char)*p)) 416 p++; 417 418 e.principal = p; 419 for(p = s; *p; p++){ 420 if(*p == '\\') 421 p++; 422 else if(isspace((unsigned char)*p)) { 423 *p = 0; 424 break; 425 } 426 } 427 p = skip_next(p); 428 429 e.key = p; 430 p = skip_next(p); 431 432 e.created = p; 433 p = skip_next(p); 434 435 e.modified = p; 436 p = skip_next(p); 437 438 e.valid_start = p; 439 p = skip_next(p); 440 441 e.valid_end = p; 442 p = skip_next(p); 443 444 e.pw_end = p; 445 p = skip_next(p); 446 447 e.max_life = p; 448 p = skip_next(p); 449 450 e.max_renew = p; 451 p = skip_next(p); 452 453 e.flags = p; 454 p = skip_next(p); 455 456 e.generation = p; 457 p = skip_next(p); 458 459 e.extensions = p; 460 skip_next(p); 461 462 memset(&ent, 0, sizeof(ent)); 463 ret = krb5_parse_name(context, e.principal, &ent.entry.principal); 464 if(ret) { 465 const char *msg = krb5_get_error_message(context, ret); 466 fprintf(stderr, "%s:%d:%s (%s)\n", 467 filename, line, msg, e.principal); 468 krb5_free_error_message(context, msg); 469 continue; 470 } 471 472 if (parse_keys(&ent.entry, e.key)) { 473 fprintf (stderr, "%s:%d:error parsing keys (%s)\n", 474 filename, line, e.key); 475 hdb_free_entry (context, &ent); 476 continue; 477 } 478 479 if (parse_event(&ent.entry.created_by, e.created) == -1) { 480 fprintf (stderr, "%s:%d:error parsing created event (%s)\n", 481 filename, line, e.created); 482 hdb_free_entry (context, &ent); 483 continue; 484 } 485 if (parse_event_alloc (&ent.entry.modified_by, e.modified) == -1) { 486 fprintf (stderr, "%s:%d:error parsing event (%s)\n", 487 filename, line, e.modified); 488 hdb_free_entry (context, &ent); 489 continue; 490 } 491 if (parse_time_string_alloc (&ent.entry.valid_start, e.valid_start) == -1) { 492 fprintf (stderr, "%s:%d:error parsing time (%s)\n", 493 filename, line, e.valid_start); 494 hdb_free_entry (context, &ent); 495 continue; 496 } 497 if (parse_time_string_alloc (&ent.entry.valid_end, e.valid_end) == -1) { 498 fprintf (stderr, "%s:%d:error parsing time (%s)\n", 499 filename, line, e.valid_end); 500 hdb_free_entry (context, &ent); 501 continue; 502 } 503 if (parse_time_string_alloc (&ent.entry.pw_end, e.pw_end) == -1) { 504 fprintf (stderr, "%s:%d:error parsing time (%s)\n", 505 filename, line, e.pw_end); 506 hdb_free_entry (context, &ent); 507 continue; 508 } 509 510 if (parse_integer_alloc (&ent.entry.max_life, e.max_life) == -1) { 511 fprintf (stderr, "%s:%d:error parsing lifetime (%s)\n", 512 filename, line, e.max_life); 513 hdb_free_entry (context, &ent); 514 continue; 515 516 } 517 if (parse_integer_alloc (&ent.entry.max_renew, e.max_renew) == -1) { 518 fprintf (stderr, "%s:%d:error parsing lifetime (%s)\n", 519 filename, line, e.max_renew); 520 hdb_free_entry (context, &ent); 521 continue; 522 } 523 524 if (parse_hdbflags2int (&ent.entry.flags, e.flags) != 1) { 525 fprintf (stderr, "%s:%d:error parsing flags (%s)\n", 526 filename, line, e.flags); 527 hdb_free_entry (context, &ent); 528 continue; 529 } 530 531 if(parse_generation(e.generation, &ent.entry.generation) == -1) { 532 fprintf (stderr, "%s:%d:error parsing generation (%s)\n", 533 filename, line, e.generation); 534 hdb_free_entry (context, &ent); 535 continue; 536 } 537 538 if(parse_extensions(e.extensions, &ent.entry.extensions) == -1) { 539 fprintf (stderr, "%s:%d:error parsing extension (%s)\n", 540 filename, line, e.extensions); 541 hdb_free_entry (context, &ent); 542 continue; 543 } 544 545 ret = db->hdb_store(context, db, HDB_F_REPLACE, &ent); 546 hdb_free_entry (context, &ent); 547 if (ret) { 548 krb5_warn(context, ret, "db_store"); 549 break; 550 } 551 } 552 (void) kadm5_log_end(kadm_handle); 553 db->hdb_close(context, db); 554 fclose(f); 555 return ret != 0; 556 } 557 558 559 extern int local_flag; 560 561 static int 562 loadit(int mergep, const char *name, int argc, char **argv) 563 { 564 if(!local_flag) { 565 krb5_warnx(context, "%s is only available in local (-l) mode", name); 566 return 0; 567 } 568 569 return doit(argv[0], mergep); 570 } 571 572 int 573 load(void *opt, int argc, char **argv) 574 { 575 return loadit(0, "load", argc, argv); 576 } 577 578 int 579 merge(void *opt, int argc, char **argv) 580 { 581 return loadit(1, "merge", argc, argv); 582 } 583