?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
libc, libutil: remove compat hacks
[minix.git] / lib / libutil / login_cap.c
blob27d07fe503ef36a742351beb1275dacb89ab1c9d
1 /* $NetBSD: login_cap.c,v 1.30 2012/04/07 16:16:34 christos Exp $ */
2
3 /*-
4 * Copyright (c) 1995,1997 Berkeley Software Design, Inc. 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 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * 3. All advertising materials mentioning features or use of this software
15 * must display the following acknowledgement:
16 * This product includes software developed by Berkeley Software Design,
17 * Inc.
18 * 4. The name of Berkeley Software Design, Inc. may not be used to endorse
19 * or promote products derived from this software without specific prior
20 * written permission.
21 *
22 * THIS SOFTWARE IS PROVIDED BY BERKELEY SOFTWARE DESIGN, INC. ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL BERKELEY SOFTWARE DESIGN, INC. BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
33 *
34 * BSDI login_cap.c,v 2.13 1998/02/07 03:17:05 prb Exp
35 */
36
37 #include <sys/cdefs.h>
38 #if defined(LIBC_SCCS) && !defined(lint)
39 __RCSID("$NetBSD: login_cap.c,v 1.30 2012/04/07 16:16:34 christos Exp $");
40 #endif /* LIBC_SCCS and not lint */
41
42 #include <sys/types.h>
43 #include <sys/stat.h>
44 #include <sys/time.h>
45 #include <sys/resource.h>
46 #include <sys/param.h>
47
48 #include <assert.h>
49 #include <ctype.h>
50 #include <err.h>
51 #include <errno.h>
52 #include <fcntl.h>
53 #include <limits.h>
54 #include <login_cap.h>
55 #include <paths.h>
56 #include <pwd.h>
57 #include <stdio.h>
58 #include <stdlib.h>
59 #include <string.h>
60 #include <syslog.h>
61 #include <unistd.h>
62 #include <util.h>
63
64 static u_quad_t multiply(u_quad_t, u_quad_t);
65 static u_quad_t strtolimit(const char *, char **, int);
66 static u_quad_t strtosize(const char *, char **, int);
67 static int gsetrl(login_cap_t *, int, const char *, int type);
68 static int isinfinite(const char *);
69 static int envset(void *, const char *, const char *, int);
70
71 login_cap_t *
72 login_getclass(const char *class)
73 {
74 const char *classfiles[2];
75 login_cap_t *lc;
76 int res;
77
78 /* class may be NULL */
79
80 if (secure_path(_PATH_LOGIN_CONF) == 0) {
81 classfiles[0] = _PATH_LOGIN_CONF;
82 classfiles[1] = NULL;
83 } else {
84 classfiles[0] = NULL;
85 }
86
87 if ((lc = malloc(sizeof(login_cap_t))) == NULL) {
88 syslog(LOG_ERR, "%s:%d malloc: %m", __FILE__, __LINE__);
89 return (0);
90 }
91
92 lc->lc_cap = 0;
93 lc->lc_style = 0;
94
95 if (class == NULL || class[0] == '\0')
96 class = LOGIN_DEFCLASS;
97
98 if ((lc->lc_class = strdup(class)) == NULL) {
99 syslog(LOG_ERR, "%s:%d strdup: %m", __FILE__, __LINE__);
100 free(lc);
101 return (0);
102 }
103
104 /*
105 * Not having a login.conf file is not an error condition.
106 * The individual routines deal reasonably with missing
107 * capabilities and use default values.
108 */
109 if (classfiles[0] == NULL)
110 return(lc);
111
112 if ((res = cgetent(&lc->lc_cap, classfiles, lc->lc_class)) != 0) {
113 lc->lc_cap = 0;
114 switch (res) {
115 case 1:
116 syslog(LOG_ERR, "%s: couldn't resolve 'tc'",
117 lc->lc_class);
118 break;
119 case -1:
120 if (strcmp(lc->lc_class, LOGIN_DEFCLASS) == 0)
121 return (lc);
122 syslog(LOG_ERR, "%s: unknown class", lc->lc_class);
123 break;
124 case -2:
125 syslog(LOG_ERR, "%s: getting class information: %m",
126 lc->lc_class);
127 break;
128 case -3:
129 syslog(LOG_ERR, "%s: 'tc' reference loop",
130 lc->lc_class);
131 break;
132 default:
133 syslog(LOG_ERR, "%s: unexpected cgetent error",
134 lc->lc_class);
135 break;
136 }
137 free(lc->lc_class);
138 free(lc);
139 return (0);
140 }
141 return (lc);
142 }
143
144 login_cap_t *
145 login_getpwclass(const struct passwd *pwd)
146 {
147
148 /* pwd may be NULL */
149
150 return login_getclass(pwd ? pwd->pw_class : NULL);
151 }
152
153 char *
154 login_getcapstr(login_cap_t *lc, const char *cap, char *def, char *e)
155 {
156 char *res = NULL;
157 int status;
158
159 errno = 0;
160
161 _DIAGASSERT(cap != NULL);
162
163 if (!lc || !lc->lc_cap)
164 return (def);
165
166 switch (status = cgetstr(lc->lc_cap, cap, &res)) {
167 case -1:
168 if (res)
169 free(res);
170 return (def);
171 case -2:
172 syslog(LOG_ERR, "%s: getting capability %s: %m",
173 lc->lc_class, cap);
174 if (res)
175 free(res);
176 return (e);
177 default:
178 if (status >= 0)
179 return (res);
180 syslog(LOG_ERR, "%s: unexpected error with capability %s",
181 lc->lc_class, cap);
182 if (res)
183 free(res);
184 return (e);
185 }
186 }
187
188 quad_t
189 login_getcaptime(login_cap_t *lc, const char *cap, quad_t def, quad_t e)
190 {
191 char *ep;
192 char *res = NULL, *sres;
193 int status;
194 quad_t q, r;
195
196 _DIAGASSERT(cap != NULL);
197
198 errno = 0;
199 if (!lc || !lc->lc_cap)
200 return (def);
201
202 switch (status = cgetstr(lc->lc_cap, cap, &res)) {
203 case -1:
204 if (res)
205 free(res);
206 return (def);
207 case -2:
208 syslog(LOG_ERR, "%s: getting capability %s: %m",
209 lc->lc_class, cap);
210 errno = ERANGE;
211 if (res)
212 free(res);
213 return (e);
214 default:
215 if (status >= 0)
216 break;
217 syslog(LOG_ERR, "%s: unexpected error with capability %s",
218 lc->lc_class, cap);
219 errno = ERANGE;
220 if (res)
221 free(res);
222 return (e);
223 }
224
225 if (isinfinite(res))
226 return (RLIM_INFINITY);
227
228 errno = 0;
229
230 q = 0;
231 sres = res;
232 while (*res) {
233 r = strtoq(res, &ep, 0);
234 if (!ep || ep == res ||
235 ((r == QUAD_MIN || r == QUAD_MAX) && errno == ERANGE)) {
236 invalid:
237 syslog(LOG_ERR, "%s:%s=%s: invalid time",
238 lc->lc_class, cap, sres);
239 errno = ERANGE;
240 free(sres);
241 return (e);
242 }
243 switch (*ep++) {
244 case '\0':
245 --ep;
246 break;
247 case 's': case 'S':
248 break;
249 case 'm': case 'M':
250 r *= 60;
251 break;
252 case 'h': case 'H':
253 r *= 60 * 60;
254 break;
255 case 'd': case 'D':
256 r *= 60 * 60 * 24;
257 break;
258 case 'w': case 'W':
259 r *= 60 * 60 * 24 * 7;
260 break;
261 case 'y': case 'Y': /* Pretty absurd */
262 r *= 60 * 60 * 24 * 365;
263 break;
264 default:
265 goto invalid;
266 }
267 res = ep;
268 q += r;
269 }
270 free(sres);
271 return (q);
272 }
273
274 quad_t
275 login_getcapnum(login_cap_t *lc, const char *cap, quad_t def, quad_t e)
276 {
277 char *ep;
278 char *res = NULL;
279 int status;
280 quad_t q;
281
282 _DIAGASSERT(cap != NULL);
283
284 errno = 0;
285 if (!lc || !lc->lc_cap)
286 return (def);
287
288 switch (status = cgetstr(lc->lc_cap, cap, &res)) {
289 case -1:
290 if (res)
291 free(res);
292 return (def);
293 case -2:
294 syslog(LOG_ERR, "%s: getting capability %s: %m",
295 lc->lc_class, cap);
296 errno = ERANGE;
297 if (res)
298 free(res);
299 return (e);
300 default:
301 if (status >= 0)
302 break;
303 syslog(LOG_ERR, "%s: unexpected error with capability %s",
304 lc->lc_class, cap);
305 errno = ERANGE;
306 if (res)
307 free(res);
308 return (e);
309 }
310
311 if (isinfinite(res))
312 return (RLIM_INFINITY);
313
314 errno = 0;
315 q = strtoq(res, &ep, 0);
316 if (!ep || ep == res || ep[0] ||
317 ((q == QUAD_MIN || q == QUAD_MAX) && errno == ERANGE)) {
318 syslog(LOG_ERR, "%s:%s=%s: invalid number",
319 lc->lc_class, cap, res);
320 errno = ERANGE;
321 free(res);
322 return (e);
323 }
324 free(res);
325 return (q);
326 }
327
328 quad_t
329 login_getcapsize(login_cap_t *lc, const char *cap, quad_t def, quad_t e)
330 {
331 char *ep;
332 char *res = NULL;
333 int status;
334 quad_t q;
335
336 _DIAGASSERT(cap != NULL);
337
338 errno = 0;
339
340 if (!lc || !lc->lc_cap)
341 return (def);
342
343 switch (status = cgetstr(lc->lc_cap, cap, &res)) {
344 case -1:
345 if (res)
346 free(res);
347 return (def);
348 case -2:
349 syslog(LOG_ERR, "%s: getting capability %s: %m",
350 lc->lc_class, cap);
351 errno = ERANGE;
352 if (res)
353 free(res);
354 return (e);
355 default:
356 if (status >= 0)
357 break;
358 syslog(LOG_ERR, "%s: unexpected error with capability %s",
359 lc->lc_class, cap);
360 errno = ERANGE;
361 if (res)
362 free(res);
363 return (e);
364 }
365
366 errno = 0;
367 q = strtolimit(res, &ep, 0);
368 if (!ep || ep == res || (ep[0] && ep[1]) ||
369 ((q == QUAD_MIN || q == QUAD_MAX) && errno == ERANGE)) {
370 syslog(LOG_ERR, "%s:%s=%s: invalid size",
371 lc->lc_class, cap, res);
372 errno = ERANGE;
373 free(res);
374 return (e);
375 }
376 free(res);
377 return (q);
378 }
379
380 int
381 login_getcapbool(login_cap_t *lc, const char *cap, u_int def)
382 {
383
384 _DIAGASSERT(cap != NULL);
385
386 if (!lc || !lc->lc_cap)
387 return (def);
388
389 return (cgetcap(lc->lc_cap, cap, ':') != NULL);
390 }
391
392 void
393 login_close(login_cap_t *lc)
394 {
395
396 if (lc) {
397 if (lc->lc_class)
398 free(lc->lc_class);
399 if (lc->lc_cap)
400 free(lc->lc_cap);
401 if (lc->lc_style)
402 free(lc->lc_style);
403 free(lc);
404 }
405 }
406
407 #define R_CTIME 1
408 #define R_CSIZE 2
409 #define R_CNUMB 3
410
411 static struct {
412 int what;
413 int type;
414 const char *name;
415 } r_list[] = {
416 { RLIMIT_CPU, R_CTIME, "cputime", },
417 { RLIMIT_FSIZE, R_CSIZE, "filesize", },
418 { RLIMIT_DATA, R_CSIZE, "datasize", },
419 { RLIMIT_STACK, R_CSIZE, "stacksize", },
420 #ifndef __minix
421 { RLIMIT_RSS, R_CSIZE, "memoryuse", },
422 { RLIMIT_MEMLOCK, R_CSIZE, "memorylocked", },
423 { RLIMIT_NPROC, R_CNUMB, "maxproc", },
424 #endif
425 { RLIMIT_NOFILE, R_CNUMB, "openfiles", },
426 { RLIMIT_CORE, R_CSIZE, "coredumpsize", },
427 #ifdef RLIMIT_SBSIZE
428 { RLIMIT_SBSIZE, R_CSIZE, "sbsize", },
429 #endif
430 { -1, 0, 0 }
431 };
432
433 static int
434 gsetrl(login_cap_t *lc, int what, const char *name, int type)
435 {
436 struct rlimit rl;
437 struct rlimit r;
438 char name_cur[32];
439 char name_max[32];
440
441 _DIAGASSERT(name != NULL);
442
443 (void)snprintf(name_cur, sizeof(name_cur), "%s-cur", name);
444 (void)snprintf(name_max, sizeof(name_max), "%s-max", name);
445
446 if (getrlimit(what, &r)) {
447 syslog(LOG_ERR, "getting resource limit: %m");
448 return (-1);
449 }
450
451 #define RCUR ((quad_t)r.rlim_cur)
452 #define RMAX ((quad_t)r.rlim_max)
453
454 switch (type) {
455 case R_CTIME:
456 r.rlim_cur = login_getcaptime(lc, name, RCUR, RCUR);
457 r.rlim_max = login_getcaptime(lc, name, RMAX, RMAX);
458 rl.rlim_cur = login_getcaptime(lc, name_cur, RCUR, RCUR);
459 rl.rlim_max = login_getcaptime(lc, name_max, RMAX, RMAX);
460 break;
461 case R_CSIZE:
462 r.rlim_cur = login_getcapsize(lc, name, RCUR, RCUR);
463 r.rlim_max = login_getcapsize(lc, name, RMAX, RMAX);
464 rl.rlim_cur = login_getcapsize(lc, name_cur, RCUR, RCUR);
465 rl.rlim_max = login_getcapsize(lc, name_max, RMAX, RMAX);
466 break;
467 case R_CNUMB:
468 r.rlim_cur = login_getcapnum(lc, name, RCUR, RCUR);
469 r.rlim_max = login_getcapnum(lc, name, RMAX, RMAX);
470 rl.rlim_cur = login_getcapnum(lc, name_cur, RCUR, RCUR);
471 rl.rlim_max = login_getcapnum(lc, name_max, RMAX, RMAX);
472 break;
473 default:
474 syslog(LOG_ERR, "%s: invalid type %d setting resource limit %s",
475 lc->lc_class, type, name);
476 return (-1);
477 }
478
479 #ifndef __minix
480 if (setrlimit(what, &rl)) {
481 syslog(LOG_ERR, "%s: setting resource limit %s: %m",
482 lc->lc_class, name);
483 return (-1);
484 }
485 #endif
486 #undef RCUR
487 #undef RMAX
488 return (0);
489 }
490
491 static int
492 /*ARGSUSED*/
493 envset(void *envp __unused, const char *name, const char *value, int overwrite)
494 {
495 return setenv(name, value, overwrite);
496 }
497
498 int
499 setuserenv(login_cap_t *lc, envfunc_t senv, void *envp)
500 {
501 const char *stop = ", \t";
502 size_t i, count;
503 char *ptr;
504 char **res;
505 char *str = login_getcapstr(lc, "setenv", NULL, NULL);
506
507 if (str == NULL || *str == '\0')
508 return 0;
509
510 /*
511 * count the sub-strings, this may over-count since we don't
512 * account for escaped delimiters.
513 */
514 for (i = 1, ptr = str; *ptr; i++) {
515 ptr += strcspn(ptr, stop);
516 if (*ptr)
517 ptr++;
518 }
519
520 /* allocate ptr array and string */
521 count = i;
522 res = malloc(count * sizeof(*res) + strlen(str) + 1);
523
524 if (!res)
525 return -1;
526
527 ptr = (char *)(void *)&res[count];
528 (void)strcpy(ptr, str);
529
530 /* split string */
531 for (i = 0; (res[i] = stresep(&ptr, stop, '\\')) != NULL; )
532 if (*res[i])
533 i++;
534
535 count = i;
536
537 for (i = 0; i < count; i++) {
538 if ((ptr = strchr(res[i], '=')) != NULL)
539 *ptr++ = '\0';
540 else
541 ptr = NULL;
542 (void)(*senv)(envp, res[i], ptr ? ptr : "", 1);
543 }
544
545 free(res);
546 return 0;
547 }
548
549 int
550 setclasscontext(const char *class, u_int flags)
551 {
552 int ret;
553 login_cap_t *lc;
554
555 flags &= LOGIN_SETRESOURCES | LOGIN_SETPRIORITY | LOGIN_SETUMASK |
556 LOGIN_SETPATH;
557
558 lc = login_getclass(class);
559 ret = lc ? setusercontext(lc, NULL, 0, flags) : -1;
560 login_close(lc);
561 return (ret);
562 }
563
564 int
565 setusercontext(login_cap_t *lc, struct passwd *pwd, uid_t uid, u_int flags)
566 {
567 char per_user_tmp[MAXPATHLEN + 1];
568 const char *component_name;
569 login_cap_t *flc;
570 quad_t p;
571 int i;
572 ssize_t len;
573
574 flc = NULL;
575
576 if (!lc)
577 flc = lc = login_getclass(pwd ? pwd->pw_class : NULL);
578 #ifdef __minix
579 #define LOGIN_SETLOGIN 0
580 #endif
581
582 /*
583 * Without the pwd entry being passed we cannot set either
584 * the group or the login. We could complain about it.
585 */
586 if (pwd == NULL)
587 flags &= ~(LOGIN_SETGROUP|LOGIN_SETLOGIN);
588
589 #ifdef LOGIN_OSETGROUP
590 if (pwd == NULL)
591 flags &= ~LOGIN_OSETGROUP;
592 if (flags & LOGIN_OSETGROUP)
593 flags = (flags & ~LOGIN_OSETGROUP) | LOGIN_SETGROUP;
594 #endif
595 if (flags & LOGIN_SETRESOURCES)
596 for (i = 0; r_list[i].name; ++i)
597 (void)gsetrl(lc, r_list[i].what, r_list[i].name,
598 r_list[i].type);
599
600 if (flags & LOGIN_SETPRIORITY) {
601 p = login_getcapnum(lc, "priority", (quad_t)0, (quad_t)0);
602
603 if (setpriority(PRIO_PROCESS, 0, (int)p) == -1)
604 syslog(LOG_ERR, "%s: setpriority: %m", lc->lc_class);
605 }
606
607 if (flags & LOGIN_SETUMASK) {
608 p = login_getcapnum(lc, "umask", (quad_t) LOGIN_DEFUMASK,
609 (quad_t)LOGIN_DEFUMASK);
610 umask((mode_t)p);
611 }
612
613 if (flags & LOGIN_SETGID) {
614 if (setgid(pwd->pw_gid) == -1) {
615 syslog(LOG_ERR, "setgid(%d): %m", pwd->pw_gid);
616 login_close(flc);
617 return (-1);
618 }
619 }
620
621 if (flags & LOGIN_SETGROUPS) {
622 if (initgroups(pwd->pw_name, pwd->pw_gid) == -1) {
623 syslog(LOG_ERR, "initgroups(%s,%d): %m",
624 pwd->pw_name, pwd->pw_gid);
625 login_close(flc);
626 return (-1);
627 }
628 }
629
630 /* Create per-user temporary directories if needed. */
631 if ((len = readlink("/tmp", per_user_tmp,
632 sizeof(per_user_tmp) - 6)) != -1) {
633
634 static const char atuid[] = "/@ruid";
635 char *lp;
636
637 /* readlink does not nul-terminate the string */
638 per_user_tmp[len] = '\0';
639
640 /* Check if it's magic symlink. */
641 lp = strstr(per_user_tmp, atuid);
642 if (lp != NULL && *(lp + (sizeof(atuid) - 1)) == '\0') {
643 lp++;
644
645 if (snprintf(lp, 11, "/%u", pwd->pw_uid) > 10) {
646 syslog(LOG_ERR, "real temporary path too long");
647 login_close(flc);
648 return (-1);
649 }
650 if (mkdir(per_user_tmp, S_IRWXU) != -1) {
651 if (chown(per_user_tmp, pwd->pw_uid,
652 pwd->pw_gid)) {
653 component_name = "chown";
654 goto out;
655 }
656
657 /*
658 * Must set sticky bit for tmp directory, some
659 * programs rely on this.
660 */
661 if(chmod(per_user_tmp, S_IRWXU | S_ISVTX)) {
662 component_name = "chmod";
663 goto out;
664 }
665 } else {
666 if (errno != EEXIST) {
667 component_name = "mkdir";
668 goto out;
669 } else {
670 /*
671 * We must ensure that we own the
672 * directory and that is has the correct
673 * permissions, otherwise a DOS attack
674 * is possible.
675 */
676 struct stat sb;
677 if (stat(per_user_tmp, &sb) == -1) {
678 component_name = "stat";
679 goto out;
680 }
681
682 if (sb.st_uid != pwd->pw_uid) {
683 if (chown(per_user_tmp,
684 pwd->pw_uid, pwd->pw_gid)) {
685 component_name = "chown";
686 goto out;
687 }
688 }
689
690 if (sb.st_mode != (S_IRWXU | S_ISVTX)) {
691 if (chmod(per_user_tmp,
692 S_IRWXU | S_ISVTX)) {
693 component_name = "chmod";
694 goto out;
695 }
696 }
697 }
698 }
699 }
700 }
701 errno = 0;
702
703 if (flags & LOGIN_SETLOGIN)
704 if (setlogin(pwd->pw_name) == -1) {
705 syslog(LOG_ERR, "setlogin(%s) failure: %m",
706 pwd->pw_name);
707 login_close(flc);
708 return (-1);
709 }
710
711 if (flags & LOGIN_SETUSER)
712 if (setuid(uid) == -1) {
713 syslog(LOG_ERR, "setuid(%d): %m", uid);
714 login_close(flc);
715 return (-1);
716 }
717
718 if (flags & LOGIN_SETENV)
719 setuserenv(lc, envset, NULL);
720
721 if (flags & LOGIN_SETPATH)
722 setuserpath(lc, pwd ? pwd->pw_dir : "", envset, NULL);
723
724 login_close(flc);
725 return (0);
726
727 out:
728 if (component_name != NULL) {
729 syslog(LOG_ERR, "%s %s: %m", component_name, per_user_tmp);
730 login_close(flc);
731 return (-1);
732 } else {
733 syslog(LOG_ERR, "%s: %m", per_user_tmp);
734 login_close(flc);
735 return (-1);
736 }
737 }
738
739 void
740 setuserpath(login_cap_t *lc, const char *home, envfunc_t senv, void *envp)
741 {
742 size_t hlen, plen;
743 int cnt = 0;
744 char *path;
745 const char *cpath;
746 char *p, *q;
747
748 _DIAGASSERT(home != NULL);
749
750 hlen = strlen(home);
751
752 p = path = login_getcapstr(lc, "path", NULL, NULL);
753 if (p) {
754 while (*p)
755 if (*p++ == '~')
756 ++cnt;
757 plen = (p - path) + cnt * (hlen + 1) + 1;
758 p = path;
759 q = path = malloc(plen);
760 if (q) {
761 while (*p) {
762 p += strspn(p, " \t");
763 if (*p == '\0')
764 break;
765 plen = strcspn(p, " \t");
766 if (hlen == 0 && *p == '~') {
767 p += plen;
768 continue;
769 }
770 if (q != path)
771 *q++ = ':';
772 if (*p == '~') {
773 strcpy(q, home);
774 q += hlen;
775 ++p;
776 --plen;
777 }
778 memcpy(q, p, plen);
779 p += plen;
780 q += plen;
781 }
782 *q = '\0';
783 cpath = path;
784 } else
785 cpath = _PATH_DEFPATH;
786 } else
787 cpath = _PATH_DEFPATH;
788 if ((*senv)(envp, "PATH", cpath, 1))
789 warn("could not set PATH");
790 }
791
792 /*
793 * Convert an expression of the following forms
794 * 1) A number.
795 * 2) A number followed by a b (mult by 512).
796 * 3) A number followed by a k (mult by 1024).
797 * 5) A number followed by a m (mult by 1024 * 1024).
798 * 6) A number followed by a g (mult by 1024 * 1024 * 1024).
799 * 7) A number followed by a t (mult by 1024 * 1024 * 1024 * 1024).
800 * 8) Two or more numbers (with/without k,b,m,g, or t).
801 * separated by x (also * for backwards compatibility), specifying
802 * the product of the indicated values.
803 */
804 static u_quad_t
805 strtosize(const char *str, char **endptr, int radix)
806 {
807 u_quad_t num, num2;
808 char *expr, *expr2;
809
810 _DIAGASSERT(str != NULL);
811 /* endptr may be NULL */
812
813 errno = 0;
814 num = strtouq(str, &expr, radix);
815 if (errno || expr == str) {
816 if (endptr)
817 *endptr = expr;
818 return (num);
819 }
820
821 switch(*expr) {
822 case 'b': case 'B':
823 num = multiply(num, (u_quad_t)512);
824 ++expr;
825 break;
826 case 'k': case 'K':
827 num = multiply(num, (u_quad_t)1024);
828 ++expr;
829 break;
830 case 'm': case 'M':
831 num = multiply(num, (u_quad_t)1024 * 1024);
832 ++expr;
833 break;
834 case 'g': case 'G':
835 num = multiply(num, (u_quad_t)1024 * 1024 * 1024);
836 ++expr;
837 break;
838 case 't': case 'T':
839 num = multiply(num, (u_quad_t)1024 * 1024);
840 num = multiply(num, (u_quad_t)1024 * 1024);
841 ++expr;
842 break;
843 }
844
845 if (errno)
846 goto erange;
847
848 switch(*expr) {
849 case '*': /* Backward compatible. */
850 case 'x':
851 num2 = strtosize(expr+1, &expr2, radix);
852 if (errno) {
853 expr = expr2;
854 goto erange;
855 }
856
857 if (expr2 == expr + 1) {
858 if (endptr)
859 *endptr = expr;
860 return (num);
861 }
862 expr = expr2;
863 num = multiply(num, num2);
864 if (errno)
865 goto erange;
866 break;
867 }
868 if (endptr)
869 *endptr = expr;
870 return (num);
871 erange:
872 if (endptr)
873 *endptr = expr;
874 errno = ERANGE;
875 return (UQUAD_MAX);
876 }
877
878 static u_quad_t
879 strtolimit(const char *str, char **endptr, int radix)
880 {
881
882 _DIAGASSERT(str != NULL);
883 /* endptr may be NULL */
884
885 if (isinfinite(str)) {
886 if (endptr)
887 *endptr = (char *)__UNCONST(str) + strlen(str);
888 return ((u_quad_t)RLIM_INFINITY);
889 }
890 return (strtosize(str, endptr, radix));
891 }
892
893 static int
894 isinfinite(const char *s)
895 {
896 static const char *infs[] = {
897 "infinity",
898 "inf",
899 "unlimited",
900 "unlimit",
901 NULL
902 };
903 const char **i;
904
905 _DIAGASSERT(s != NULL);
906
907 for (i = infs; *i; i++) {
908 if (!strcasecmp(s, *i))
909 return 1;
910 }
911 return 0;
912 }
913
914 static u_quad_t
915 multiply(u_quad_t n1, u_quad_t n2)
916 {
917 static int bpw = 0;
918 u_quad_t m;
919 u_quad_t r;
920 int b1, b2;
921
922 /*
923 * Get rid of the simple cases
924 */
925 if (n1 == 0 || n2 == 0)
926 return (0);
927 if (n1 == 1)
928 return (n2);
929 if (n2 == 1)
930 return (n1);
931
932 /*
933 * sizeof() returns number of bytes needed for storage.
934 * This may be different from the actual number of useful bits.
935 */
936 if (!bpw) {
937 bpw = sizeof(u_quad_t) * 8;
938 while (((u_quad_t)1 << (bpw-1)) == 0)
939 --bpw;
940 }
941
942 /*
943 * First check the magnitude of each number. If the sum of the
944 * magnatude is way to high, reject the number. (If this test
945 * is not done then the first multiply below may overflow.)
946 */
947 for (b1 = bpw; (((u_quad_t)1 << (b1-1)) & n1) == 0; --b1)
948 ;
949 for (b2 = bpw; (((u_quad_t)1 << (b2-1)) & n2) == 0; --b2)
950 ;
951 if (b1 + b2 - 2 > bpw) {
952 errno = ERANGE;
953 return (UQUAD_MAX);
954 }
955
956 /*
957 * Decompose the multiplication to be:
958 * h1 = n1 & ~1
959 * h2 = n2 & ~1
960 * l1 = n1 & 1
961 * l2 = n2 & 1
962 * (h1 + l1) * (h2 + l2)
963 * (h1 * h2) + (h1 * l2) + (l1 * h2) + (l1 * l2)
964 *
965 * Since h1 && h2 do not have the low bit set, we can then say:
966 *
967 * (h1>>1 * h2>>1 * 4) + ...
968 *
969 * So if (h1>>1 * h2>>1) > (1<<(bpw - 2)) then the result will
970 * overflow.
971 *
972 * Finally, if MAX - ((h1 * l2) + (l1 * h2) + (l1 * l2)) < (h1*h2)
973 * then adding in residual amout will cause an overflow.
974 */
975
976 m = (n1 >> 1) * (n2 >> 1);
977
978 if (m >= ((u_quad_t)1 << (bpw-2))) {
979 errno = ERANGE;
980 return (UQUAD_MAX);
981 }
982
983 m *= 4;
984
985 r = (n1 & n2 & 1)
986 + (n2 & 1) * (n1 & ~(u_quad_t)1)
987 + (n1 & 1) * (n2 & ~(u_quad_t)1);
988
989 if ((u_quad_t)(m + r) < m) {
990 errno = ERANGE;
991 return (UQUAD_MAX);
992 }
993 m += r;
994
995 return (m);
996 }
997
998 __weak_alias(login_getpwclass, __login_getpwclass50)
999 __weak_alias(setusercontext, __setusercontext50)
MINIX 3 (repo.or.cz mirror)