1 /*- 2 * Copyright (c) 1996 by 3 * Sean Eric Fagan <sef@kithrup.com> 4 * David Nugent <davidn@blaze.net.au> 5 * All rights reserved. 6 * 7 * Portions copyright (c) 1995,1997 8 * Berkeley Software Design, Inc. 9 * All rights reserved. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, is permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice immediately at the beginning of the file, without modification, 16 * this list of conditions, and the following disclaimer. 17 * 2. Redistributions in binary form must reproduce the above copyright 18 * notice, this list of conditions and the following disclaimer in the 19 * documentation and/or other materials provided with the distribution. 20 * 3. This work was done expressly for inclusion into FreeBSD. Other use 21 * is permitted provided this notation is included. 22 * 4. Absolutely no warranty of function or purpose is made by the authors. 23 * 5. Modifications may be freely made to this file providing the above 24 * conditions are met. 25 * 26 * Low-level routines relating to the user capabilities database 27 */ 28 29 #include <sys/cdefs.h> 30 __FBSDID("$FreeBSD$"); 31 32 #include <sys/types.h> 33 #include <sys/time.h> 34 #include <sys/resource.h> 35 #include <sys/param.h> 36 #include <errno.h> 37 #include <fcntl.h> 38 #include <libutil.h> 39 #include <login_cap.h> 40 #include <pwd.h> 41 #include <stdio.h> 42 #include <stdlib.h> 43 #include <string.h> 44 #include <syslog.h> 45 #include <unistd.h> 46 47 /* 48 * allocstr() 49 * Manage a single static pointer for handling a local char* buffer, 50 * resizing as necessary to contain the string. 51 * 52 * allocarray() 53 * Manage a static array for handling a group of strings, resizing 54 * when necessary. 55 */ 56 57 static int lc_object_count = 0; 58 59 static size_t internal_stringsz = 0; 60 static char * internal_string = NULL; 61 static size_t internal_arraysz = 0; 62 static const char ** internal_array = NULL; 63 64 static char path_login_conf[] = _PATH_LOGIN_CONF; 65 66 static char * 67 allocstr(const char *str) 68 { 69 char *p; 70 71 size_t sz = strlen(str) + 1; /* realloc() only if necessary */ 72 if (sz <= internal_stringsz) 73 p = strcpy(internal_string, str); 74 else if ((p = realloc(internal_string, sz)) != NULL) { 75 internal_stringsz = sz; 76 internal_string = strcpy(p, str); 77 } 78 return p; 79 } 80 81 82 static const char ** 83 allocarray(size_t sz) 84 { 85 static const char **p; 86 87 if (sz <= internal_arraysz) 88 p = internal_array; 89 else if ((p = reallocarray(internal_array, sz, sizeof(char*))) != NULL) { 90 internal_arraysz = sz; 91 internal_array = p; 92 } 93 return p; 94 } 95 96 97 /* 98 * This is a variant of strcspn, which checks for quoted 99 * strings. That is,: 100 * strcspn_quote("how 'now, brown' cow", ",", NULL); 101 * will return the index for the nul, rather than the comma, because 102 * the string is quoted. It does not handle escaped characters 103 * at this time. 104 */ 105 static size_t 106 strcspn_quote(const char *str, const char *exclude, int *is_quoted) 107 { 108 size_t indx = 0; 109 char quote = 0; 110 111 if (str == NULL) 112 return 0; 113 114 if (is_quoted) 115 *is_quoted = 0; 116 117 for (indx = 0; str[indx] != 0; indx++) { 118 if (quote && str[indx] == quote) { 119 if (is_quoted) 120 *is_quoted = 1; 121 quote = 0; 122 continue; 123 } 124 if (quote == 0 && 125 (str[indx] == '\'' || str[indx] == '"')) { 126 quote = str[indx]; 127 continue; 128 } 129 if (quote == 0 && 130 strchr(exclude, str[indx]) != NULL) 131 return indx; 132 } 133 return indx; 134 } 135 136 /* 137 * Remove quotes from the given string. 138 * It's a very simplistic approach: the first 139 * single or double quote it finds, it looks for 140 * the next one, and if it finds it, moves the 141 * entire string backwards in two chunks 142 * (first quote + 1 to first quote, length 143 * rest of string, and then second quote + 1 144 * to second quote, length rest of the string). 145 */ 146 static void 147 remove_quotes(char *str) 148 { 149 static const char *quote_chars = "'\""; 150 char qc = 0; 151 int found = 0; 152 153 do { 154 char *loc = NULL; 155 156 found = 0; 157 /* 158 * If qc is 0, then we haven't found 159 * a quote yet, so do a strcspn search. 160 */ 161 if (qc == 0) { 162 size_t indx; 163 indx = strcspn(str, quote_chars); 164 if (str[indx] == '\0') 165 return; /* We're done */ 166 loc = str + indx; 167 qc = str[indx]; 168 } else { 169 /* 170 * We've found a quote character, 171 * so use strchr to find the next one. 172 */ 173 loc = strchr(str, qc); 174 if (loc == NULL) 175 return; 176 qc = 0; 177 } 178 if (loc) { 179 /* 180 * This gives us the location of the 181 * quoted character. We need to move 182 * the entire string down, from loc+1 183 * to loc. 184 */ 185 size_t len = strlen(loc + 1) + 1; 186 memmove(loc, loc + 1, len); 187 found = 1; 188 } 189 } while (found != 0); 190 } 191 192 /* 193 * arrayize() 194 * Turn a simple string <str> separated by any of 195 * the set of <chars> into an array. The last element 196 * of the array will be NULL, as is proper. 197 * Free using freearraystr() 198 */ 199 200 static const char ** 201 arrayize(const char *str, const char *chars, int *size) 202 { 203 int i; 204 char *ptr; 205 const char *cptr; 206 const char **res = NULL; 207 208 /* count the sub-strings */ 209 for (i = 0, cptr = str; *cptr; i++) { 210 int count = strcspn_quote(cptr, chars, NULL); 211 cptr += count; 212 if (*cptr) 213 ++cptr; 214 } 215 216 /* alloc the array */ 217 if ((ptr = allocstr(str)) != NULL) { 218 if ((res = allocarray(++i)) == NULL) 219 free((void *)(uintptr_t)(const void *)str); 220 else { 221 /* now split the string */ 222 i = 0; 223 while (*ptr) { 224 int quoted = 0; 225 int count = strcspn_quote(ptr, chars, "ed); 226 char *base = ptr; 227 res[i++] = ptr; 228 ptr += count; 229 if (*ptr) 230 *ptr++ = '\0'; 231 /* 232 * If the string contains a quoted element, we 233 * need to remove the quotes. 234 */ 235 if (quoted) { 236 remove_quotes(base); 237 } 238 239 } 240 res[i] = NULL; 241 } 242 } 243 244 if (size) 245 *size = i; 246 247 return res; 248 } 249 250 251 /* 252 * login_close() 253 * Frees up all resources relating to a login class 254 * 255 */ 256 257 void 258 login_close(login_cap_t * lc) 259 { 260 if (lc) { 261 free(lc->lc_style); 262 free(lc->lc_class); 263 free(lc->lc_cap); 264 free(lc); 265 if (--lc_object_count == 0) { 266 free(internal_string); 267 free(internal_array); 268 internal_array = NULL; 269 internal_arraysz = 0; 270 internal_string = NULL; 271 internal_stringsz = 0; 272 cgetclose(); 273 } 274 } 275 } 276 277 278 /* 279 * login_getclassbyname() 280 * Get the login class by its name. 281 * If the name given is NULL or empty, the default class 282 * LOGIN_DEFCLASS (i.e., "default") is fetched. 283 * If the name given is LOGIN_MECLASS and 284 * 'pwd' argument is non-NULL and contains an non-NULL 285 * dir entry, then the file _FILE_LOGIN_CONF is picked 286 * up from that directory and used before the system 287 * login database. In that case the system login database 288 * is looked up using LOGIN_MECLASS, too, which is a bug. 289 * Return a filled-out login_cap_t structure, including 290 * class name, and the capability record buffer. 291 */ 292 293 login_cap_t * 294 login_getclassbyname(char const *name, const struct passwd *pwd) 295 { 296 login_cap_t *lc; 297 298 if ((lc = calloc(1, sizeof(login_cap_t))) != NULL) { 299 int r, me, i = 0; 300 uid_t euid = 0; 301 gid_t egid = 0; 302 const char *msg = NULL; 303 const char *dir; 304 char userpath[MAXPATHLEN]; 305 306 static char *login_dbarray[] = { NULL, NULL, NULL }; 307 308 me = (name != NULL && strcmp(name, LOGIN_MECLASS) == 0); 309 dir = (!me || pwd == NULL) ? NULL : pwd->pw_dir; 310 /* 311 * Switch to user mode before checking/reading its ~/.login_conf 312 * - some NFSes have root read access disabled. 313 * 314 * XXX: This fails to configure additional groups. 315 */ 316 if (dir) { 317 euid = geteuid(); 318 egid = getegid(); 319 (void)setegid(pwd->pw_gid); 320 (void)seteuid(pwd->pw_uid); 321 } 322 323 if (dir && snprintf(userpath, MAXPATHLEN, "%s/%s", dir, 324 _FILE_LOGIN_CONF) < MAXPATHLEN) { 325 if (_secure_path(userpath, pwd->pw_uid, pwd->pw_gid) != -1) 326 login_dbarray[i++] = userpath; 327 } 328 /* 329 * XXX: Why to add the system database if the class is `me'? 330 */ 331 if (_secure_path(path_login_conf, 0, 0) != -1) 332 login_dbarray[i++] = path_login_conf; 333 login_dbarray[i] = NULL; 334 335 if (name == NULL || *name == '\0') 336 name = LOGIN_DEFCLASS; 337 338 switch (cgetent(&lc->lc_cap, login_dbarray, name)) { 339 case -1: /* Failed, entry does not exist */ 340 if (me) 341 break; /* Don't retry default on 'me' */ 342 if (i == 0) 343 r = -1; 344 else if ((r = open(login_dbarray[0], O_RDONLY | O_CLOEXEC)) >= 0) 345 close(r); 346 /* 347 * If there's at least one login class database, 348 * and we aren't searching for a default class 349 * then complain about a non-existent class. 350 */ 351 if (r >= 0 || strcmp(name, LOGIN_DEFCLASS) != 0) 352 syslog(LOG_ERR, "login_getclass: unknown class '%s'", name); 353 /* fall-back to default class */ 354 name = LOGIN_DEFCLASS; 355 msg = "%s: no default/fallback class '%s'"; 356 if (cgetent(&lc->lc_cap, login_dbarray, name) != 0 && r >= 0) 357 break; 358 /* FALLTHROUGH - just return system defaults */ 359 case 0: /* success! */ 360 if ((lc->lc_class = strdup(name)) != NULL) { 361 if (dir) { 362 (void)seteuid(euid); 363 (void)setegid(egid); 364 } 365 ++lc_object_count; 366 return lc; 367 } 368 msg = "%s: strdup: %m"; 369 break; 370 case -2: 371 msg = "%s: retrieving class information: %m"; 372 break; 373 case -3: 374 msg = "%s: 'tc=' reference loop '%s'"; 375 break; 376 case 1: 377 msg = "couldn't resolve 'tc=' reference in '%s'"; 378 break; 379 default: 380 msg = "%s: unexpected cgetent() error '%s': %m"; 381 break; 382 } 383 if (dir) { 384 (void)seteuid(euid); 385 (void)setegid(egid); 386 } 387 if (msg != NULL) 388 syslog(LOG_ERR, msg, "login_getclass", name); 389 free(lc); 390 } 391 392 return NULL; 393 } 394 395 396 397 /* 398 * login_getclass() 399 * Get the login class for the system (only) login class database. 400 * Return a filled-out login_cap_t structure, including 401 * class name, and the capability record buffer. 402 */ 403 404 login_cap_t * 405 login_getclass(const char *cls) 406 { 407 return login_getclassbyname(cls, NULL); 408 } 409 410 411 /* 412 * login_getpwclass() 413 * Get the login class for a given password entry from 414 * the system (only) login class database. 415 * If the password entry's class field is not set, or 416 * the class specified does not exist, then use the 417 * default of LOGIN_DEFCLASS (i.e., "default") for an unprivileged 418 * user or that of LOGIN_DEFROOTCLASS (i.e., "root") for a super-user. 419 * Return a filled-out login_cap_t structure, including 420 * class name, and the capability record buffer. 421 */ 422 423 login_cap_t * 424 login_getpwclass(const struct passwd *pwd) 425 { 426 const char *cls = NULL; 427 428 if (pwd != NULL) { 429 cls = pwd->pw_class; 430 if (cls == NULL || *cls == '\0') 431 cls = (pwd->pw_uid == 0) ? LOGIN_DEFROOTCLASS : LOGIN_DEFCLASS; 432 } 433 /* 434 * XXX: pwd should be unused by login_getclassbyname() unless cls is `me', 435 * so NULL can be passed instead of pwd for more safety. 436 */ 437 return login_getclassbyname(cls, pwd); 438 } 439 440 441 /* 442 * login_getuserclass() 443 * Get the `me' login class, allowing user overrides via ~/.login_conf. 444 * Note that user overrides are allowed only in the `me' class. 445 */ 446 447 login_cap_t * 448 login_getuserclass(const struct passwd *pwd) 449 { 450 return login_getclassbyname(LOGIN_MECLASS, pwd); 451 } 452 453 454 /* 455 * login_getcapstr() 456 * Given a login_cap entry, and a capability name, return the 457 * value defined for that capability, a default if not found, or 458 * an error string on error. 459 */ 460 461 const char * 462 login_getcapstr(login_cap_t *lc, const char *cap, const char *def, const char *error) 463 { 464 char *res; 465 int ret; 466 467 if (lc == NULL || cap == NULL || lc->lc_cap == NULL || *cap == '\0') 468 return def; 469 470 if ((ret = cgetstr(lc->lc_cap, cap, &res)) == -1) 471 return def; 472 return (ret >= 0) ? res : error; 473 } 474 475 476 /* 477 * login_getcaplist() 478 * Given a login_cap entry, and a capability name, return the 479 * value defined for that capability split into an array of 480 * strings. 481 */ 482 483 const char ** 484 login_getcaplist(login_cap_t *lc, const char *cap, const char *chars) 485 { 486 const char *lstring; 487 488 if (chars == NULL) 489 chars = ", \t"; 490 if ((lstring = login_getcapstr(lc, cap, NULL, NULL)) != NULL) 491 return arrayize(lstring, chars, NULL); 492 return NULL; 493 } 494 495 496 /* 497 * login_getpath() 498 * From the login_cap_t <lc>, get the capability <cap> which is 499 * formatted as either a space or comma delimited list of paths 500 * and append them all into a string and separate by semicolons. 501 * If there is an error of any kind, return <error>. 502 */ 503 504 const char * 505 login_getpath(login_cap_t *lc, const char *cap, const char *error) 506 { 507 const char *str; 508 char *ptr; 509 int count; 510 511 str = login_getcapstr(lc, cap, NULL, NULL); 512 if (str == NULL) 513 return error; 514 ptr = __DECONST(char *, str); /* XXXX Yes, very dodgy */ 515 while (*ptr) { 516 count = strcspn(ptr, ", \t"); 517 ptr += count; 518 if (*ptr) 519 *ptr++ = ':'; 520 } 521 return str; 522 } 523 524 525 static int 526 isinfinite(const char *s) 527 { 528 static const char *infs[] = { 529 "infinity", 530 "inf", 531 "unlimited", 532 "unlimit", 533 "-1", 534 NULL 535 }; 536 const char **i = &infs[0]; 537 538 while (*i != NULL) { 539 if (strcasecmp(s, *i) == 0) 540 return 1; 541 ++i; 542 } 543 return 0; 544 } 545 546 547 static u_quad_t 548 rmultiply(u_quad_t n1, u_quad_t n2) 549 { 550 u_quad_t m, r; 551 int b1, b2; 552 553 static int bpw = 0; 554 555 /* Handle simple cases */ 556 if (n1 == 0 || n2 == 0) 557 return 0; 558 if (n1 == 1) 559 return n2; 560 if (n2 == 1) 561 return n1; 562 563 /* 564 * sizeof() returns number of bytes needed for storage. 565 * This may be different from the actual number of useful bits. 566 */ 567 if (!bpw) { 568 bpw = sizeof(u_quad_t) * 8; 569 while (((u_quad_t)1 << (bpw-1)) == 0) 570 --bpw; 571 } 572 573 /* 574 * First check the magnitude of each number. If the sum of the 575 * magnatude is way to high, reject the number. (If this test 576 * is not done then the first multiply below may overflow.) 577 */ 578 for (b1 = bpw; (((u_quad_t)1 << (b1-1)) & n1) == 0; --b1) 579 ; 580 for (b2 = bpw; (((u_quad_t)1 << (b2-1)) & n2) == 0; --b2) 581 ; 582 if (b1 + b2 - 2 > bpw) { 583 errno = ERANGE; 584 return (UQUAD_MAX); 585 } 586 587 /* 588 * Decompose the multiplication to be: 589 * h1 = n1 & ~1 590 * h2 = n2 & ~1 591 * l1 = n1 & 1 592 * l2 = n2 & 1 593 * (h1 + l1) * (h2 + l2) 594 * (h1 * h2) + (h1 * l2) + (l1 * h2) + (l1 * l2) 595 * 596 * Since h1 && h2 do not have the low bit set, we can then say: 597 * 598 * (h1>>1 * h2>>1 * 4) + ... 599 * 600 * So if (h1>>1 * h2>>1) > (1<<(bpw - 2)) then the result will 601 * overflow. 602 * 603 * Finally, if MAX - ((h1 * l2) + (l1 * h2) + (l1 * l2)) < (h1*h2) 604 * then adding in residual amout will cause an overflow. 605 */ 606 607 m = (n1 >> 1) * (n2 >> 1); 608 if (m >= ((u_quad_t)1 << (bpw-2))) { 609 errno = ERANGE; 610 return (UQUAD_MAX); 611 } 612 m *= 4; 613 614 r = (n1 & n2 & 1) 615 + (n2 & 1) * (n1 & ~(u_quad_t)1) 616 + (n1 & 1) * (n2 & ~(u_quad_t)1); 617 618 if ((u_quad_t)(m + r) < m) { 619 errno = ERANGE; 620 return (UQUAD_MAX); 621 } 622 m += r; 623 624 return (m); 625 } 626 627 628 /* 629 * login_getcaptime() 630 * From the login_cap_t <lc>, get the capability <cap>, which is 631 * formatted as a time (e.g., "<cap>=10h3m2s"). If <cap> is not 632 * present in <lc>, return <def>; if there is an error of some kind, 633 * return <error>. 634 */ 635 636 rlim_t 637 login_getcaptime(login_cap_t *lc, const char *cap, rlim_t def, rlim_t error) 638 { 639 char *res, *ep, *oval; 640 int r; 641 rlim_t tot; 642 643 errno = 0; 644 if (lc == NULL || lc->lc_cap == NULL) 645 return def; 646 647 /* 648 * Look for <cap> in lc_cap. 649 * If it's not there (-1), return <def>. 650 * If there's an error, return <error>. 651 */ 652 653 if ((r = cgetstr(lc->lc_cap, cap, &res)) == -1) 654 return def; 655 else if (r < 0) { 656 errno = ERANGE; 657 return error; 658 } 659 660 /* "inf" and "infinity" are special cases */ 661 if (isinfinite(res)) 662 return RLIM_INFINITY; 663 664 /* 665 * Now go through the string, turning something like 1h2m3s into 666 * an integral value. Whee. 667 */ 668 669 errno = 0; 670 tot = 0; 671 oval = res; 672 while (*res) { 673 rlim_t tim = strtoq(res, &ep, 0); 674 rlim_t mult = 1; 675 676 if (ep == NULL || ep == res || errno != 0) { 677 invalid: 678 syslog(LOG_WARNING, "login_getcaptime: class '%s' bad value %s=%s", 679 lc->lc_class, cap, oval); 680 errno = ERANGE; 681 return error; 682 } 683 /* Look for suffixes */ 684 switch (*ep++) { 685 case 0: 686 ep--; 687 break; /* end of string */ 688 case 's': case 'S': /* seconds */ 689 break; 690 case 'm': case 'M': /* minutes */ 691 mult = 60; 692 break; 693 case 'h': case 'H': /* hours */ 694 mult = 60L * 60L; 695 break; 696 case 'd': case 'D': /* days */ 697 mult = 60L * 60L * 24L; 698 break; 699 case 'w': case 'W': /* weeks */ 700 mult = 60L * 60L * 24L * 7L; 701 break; 702 case 'y': case 'Y': /* 365-day years */ 703 mult = 60L * 60L * 24L * 365L; 704 break; 705 default: 706 goto invalid; 707 } 708 res = ep; 709 tot += rmultiply(tim, mult); 710 if (errno) 711 goto invalid; 712 } 713 714 return tot; 715 } 716 717 718 /* 719 * login_getcapnum() 720 * From the login_cap_t <lc>, extract the numerical value <cap>. 721 * If it is not present, return <def> for a default, and return 722 * <error> if there is an error. 723 * Like login_getcaptime(), only it only converts to a number, not 724 * to a time; "infinity" and "inf" are 'special.' 725 */ 726 727 rlim_t 728 login_getcapnum(login_cap_t *lc, const char *cap, rlim_t def, rlim_t error) 729 { 730 char *ep, *res; 731 int r; 732 rlim_t val; 733 734 if (lc == NULL || lc->lc_cap == NULL) 735 return def; 736 737 /* 738 * For BSDI compatibility, try for the tag=<val> first 739 */ 740 if ((r = cgetstr(lc->lc_cap, cap, &res)) == -1) { 741 long lval; 742 /* string capability not present, so try for tag#<val> as numeric */ 743 if ((r = cgetnum(lc->lc_cap, cap, &lval)) == -1) 744 return def; /* Not there, so return default */ 745 else if (r >= 0) 746 return (rlim_t)lval; 747 } 748 749 if (r < 0) { 750 errno = ERANGE; 751 return error; 752 } 753 754 if (isinfinite(res)) 755 return RLIM_INFINITY; 756 757 errno = 0; 758 val = strtoq(res, &ep, 0); 759 if (ep == NULL || ep == res || errno != 0) { 760 syslog(LOG_WARNING, "login_getcapnum: class '%s' bad value %s=%s", 761 lc->lc_class, cap, res); 762 errno = ERANGE; 763 return error; 764 } 765 766 return val; 767 } 768 769 770 771 /* 772 * login_getcapsize() 773 * From the login_cap_t <lc>, extract the capability <cap>, which is 774 * formatted as a size (e.g., "<cap>=10M"); it can also be "infinity". 775 * If not present, return <def>, or <error> if there is an error of 776 * some sort. 777 */ 778 779 rlim_t 780 login_getcapsize(login_cap_t *lc, const char *cap, rlim_t def, rlim_t error) 781 { 782 char *ep, *res, *oval; 783 int r; 784 rlim_t tot; 785 786 if (lc == NULL || lc->lc_cap == NULL) 787 return def; 788 789 if ((r = cgetstr(lc->lc_cap, cap, &res)) == -1) 790 return def; 791 else if (r < 0) { 792 errno = ERANGE; 793 return error; 794 } 795 796 if (isinfinite(res)) 797 return RLIM_INFINITY; 798 799 errno = 0; 800 tot = 0; 801 oval = res; 802 while (*res) { 803 rlim_t siz = strtoq(res, &ep, 0); 804 rlim_t mult = 1; 805 806 if (ep == NULL || ep == res || errno != 0) { 807 invalid: 808 syslog(LOG_WARNING, "login_getcapsize: class '%s' bad value %s=%s", 809 lc->lc_class, cap, oval); 810 errno = ERANGE; 811 return error; 812 } 813 switch (*ep++) { 814 case 0: /* end of string */ 815 ep--; 816 break; 817 case 'b': case 'B': /* 512-byte blocks */ 818 mult = 512; 819 break; 820 case 'k': case 'K': /* 1024-byte Kilobytes */ 821 mult = 1024; 822 break; 823 case 'm': case 'M': /* 1024-k kbytes */ 824 mult = 1024 * 1024; 825 break; 826 case 'g': case 'G': /* 1Gbyte */ 827 mult = 1024 * 1024 * 1024; 828 break; 829 case 't': case 'T': /* 1TBte */ 830 mult = 1024LL * 1024LL * 1024LL * 1024LL; 831 break; 832 default: 833 goto invalid; 834 } 835 res = ep; 836 tot += rmultiply(siz, mult); 837 if (errno) 838 goto invalid; 839 } 840 841 return tot; 842 } 843 844 845 /* 846 * login_getcapbool() 847 * From the login_cap_t <lc>, check for the existence of the capability 848 * of <cap>. Return <def> if <lc>->lc_cap is NULL, otherwise return 849 * the whether or not <cap> exists there. 850 */ 851 852 int 853 login_getcapbool(login_cap_t *lc, const char *cap, int def) 854 { 855 if (lc == NULL || lc->lc_cap == NULL) 856 return def; 857 return (cgetcap(lc->lc_cap, cap, ':') != NULL); 858 } 859 860 861 /* 862 * login_getstyle() 863 * Given a login_cap entry <lc>, and optionally a type of auth <auth>, 864 * and optionally a style <style>, find the style that best suits these 865 * rules: 866 * 1. If <auth> is non-null, look for an "auth-<auth>=" string 867 * in the capability; if not present, default to "auth=". 868 * 2. If there is no auth list found from (1), default to 869 * "passwd" as an authorization list. 870 * 3. If <style> is non-null, look for <style> in the list of 871 * authorization methods found from (2); if <style> is NULL, default 872 * to LOGIN_DEFSTYLE ("passwd"). 873 * 4. If the chosen style is found in the chosen list of authorization 874 * methods, return that; otherwise, return NULL. 875 * E.g.: 876 * login_getstyle(lc, NULL, "ftp"); 877 * login_getstyle(lc, "login", NULL); 878 * login_getstyle(lc, "skey", "network"); 879 */ 880 881 const char * 882 login_getstyle(login_cap_t *lc, const char *style, const char *auth) 883 { 884 int i; 885 const char **authtypes = NULL; 886 char *auths= NULL; 887 char realauth[64]; 888 889 static const char *defauthtypes[] = { LOGIN_DEFSTYLE, NULL }; 890 891 if (auth != NULL && *auth != '\0') { 892 if (snprintf(realauth, sizeof realauth, "auth-%s", auth) < (int)sizeof(realauth)) 893 authtypes = login_getcaplist(lc, realauth, NULL); 894 } 895 896 if (authtypes == NULL) 897 authtypes = login_getcaplist(lc, "auth", NULL); 898 899 if (authtypes == NULL) 900 authtypes = defauthtypes; 901 902 /* 903 * We have at least one authtype now; auths is a comma-separated 904 * (or space-separated) list of authentication types. We have to 905 * convert from this to an array of char*'s; authtypes then gets this. 906 */ 907 i = 0; 908 if (style != NULL && *style != '\0') { 909 while (authtypes[i] != NULL && strcmp(style, authtypes[i]) != 0) 910 i++; 911 } 912 913 lc->lc_style = NULL; 914 if (authtypes[i] != NULL && (auths = strdup(authtypes[i])) != NULL) 915 lc->lc_style = auths; 916 917 if (lc->lc_style != NULL) 918 lc->lc_style = strdup(lc->lc_style); 919 920 return lc->lc_style; 921 } 922