Deleted Added
full compact
defs.c (36453) defs.c (36465)
1/*-
2 * Copyright (c) 1997 Brian Somers <brian@Awfulhak.org>
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 *
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24 * SUCH DAMAGE.
25 *
1/*-
2 * Copyright (c) 1997 Brian Somers <brian@Awfulhak.org>
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 *
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24 * SUCH DAMAGE.
25 *
26 * $Id: defs.c,v 1.13 1998/05/21 21:45:03 brian Exp $
26 * $Id: defs.c,v 1.14 1998/05/29 00:03:00 brian Exp $
27 */
28
29
30#include <stdlib.h>
31#include <string.h>
32#include <sys/errno.h>
33#include <time.h>
34#include <unistd.h>
35
36#include "defs.h"
37
38void
39randinit()
40{
41#if __FreeBSD__ >= 3
42 static int initdone;
43
44 if (!initdone) {
45 initdone = 1;
46 srandomdev();
47 }
48#else
49 srandom((time(NULL)^getpid())+random());
50#endif
51}
52
53ssize_t
54fullread(int fd, void *v, size_t n)
55{
56 size_t got, total;
57
58 for (total = 0; total < n; total += got)
59 switch ((got = read(fd, (char *)v + total, n - total))) {
60 case 0:
61 return total;
62 case -1:
63 if (errno == EINTR)
64 got = 0;
65 else
66 return -1;
67 }
68 return total;
69}
70
71static struct {
72 int mode;
73 const char *name;
74} modes[] = {
27 */
28
29
30#include <stdlib.h>
31#include <string.h>
32#include <sys/errno.h>
33#include <time.h>
34#include <unistd.h>
35
36#include "defs.h"
37
38void
39randinit()
40{
41#if __FreeBSD__ >= 3
42 static int initdone;
43
44 if (!initdone) {
45 initdone = 1;
46 srandomdev();
47 }
48#else
49 srandom((time(NULL)^getpid())+random());
50#endif
51}
52
53ssize_t
54fullread(int fd, void *v, size_t n)
55{
56 size_t got, total;
57
58 for (total = 0; total < n; total += got)
59 switch ((got = read(fd, (char *)v + total, n - total))) {
60 case 0:
61 return total;
62 case -1:
63 if (errno == EINTR)
64 got = 0;
65 else
66 return -1;
67 }
68 return total;
69}
70
71static struct {
72 int mode;
73 const char *name;
74} modes[] = {
75 { PHYS_MANUAL, "interactive" },
76 { PHYS_DEMAND, "auto" },
75 { PHYS_INTERACTIVE, "interactive" },
76 { PHYS_AUTO, "auto" },
77 { PHYS_DIRECT, "direct" },
78 { PHYS_DEDICATED, "dedicated" },
77 { PHYS_DIRECT, "direct" },
78 { PHYS_DEDICATED, "dedicated" },
79 { PHYS_PERM, "ddial" },
80 { PHYS_1OFF, "background" },
79 { PHYS_DDIAL, "ddial" },
80 { PHYS_BACKGROUND, "background" },
81 { PHYS_ALL, "*" },
82 { 0, 0 }
83};
84
85const char *
86mode2Nam(int mode)
87{
88 int m;
89
90 for (m = 0; modes[m].mode; m++)
91 if (modes[m].mode == mode)
92 return modes[m].name;
93
94 return "unknown";
95}
96
97int
98Nam2mode(const char *name)
99{
100 int m, got, len;
101
102 len = strlen(name);
103 got = -1;
104 for (m = 0; modes[m].mode; m++)
105 if (!strncasecmp(name, modes[m].name, len)) {
106 if (modes[m].name[len] == '\0')
107 return modes[m].mode;
108 if (got != -1)
109 return 0;
110 got = m;
111 }
112
113 return got == -1 ? 0 : modes[got].mode;
114}
81 { PHYS_ALL, "*" },
82 { 0, 0 }
83};
84
85const char *
86mode2Nam(int mode)
87{
88 int m;
89
90 for (m = 0; modes[m].mode; m++)
91 if (modes[m].mode == mode)
92 return modes[m].name;
93
94 return "unknown";
95}
96
97int
98Nam2mode(const char *name)
99{
100 int m, got, len;
101
102 len = strlen(name);
103 got = -1;
104 for (m = 0; modes[m].mode; m++)
105 if (!strncasecmp(name, modes[m].name, len)) {
106 if (modes[m].name[len] == '\0')
107 return modes[m].mode;
108 if (got != -1)
109 return 0;
110 got = m;
111 }
112
113 return got == -1 ? 0 : modes[got].mode;
114}