forked from kernelslacker/trinity
-
Notifications
You must be signed in to change notification settings - Fork 0
/
pids.c
190 lines (155 loc) · 2.98 KB
/
pids.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
#include <stdlib.h>
#include <stdio.h>
#include <sys/types.h>
#include <signal.h>
#include <unistd.h>
#include "params.h" // dangerous
#include "pids.h"
#include "random.h"
#include "sanitise.h"
#include "shm.h"
#include <debug.h>
pid_t *pids;
bool pid_alive(pid_t pid)
{
if (pid < -1) {
syslogf("kill_pid tried to kill %d!\n", pid);
show_backtrace();
return TRUE;
}
if (pid == -1) {
syslogf("kill_pid tried to kill -1!\n");
show_backtrace();
return TRUE;
}
if (pid == 0) {
syslogf("tried to kill_pid 0!\n");
show_backtrace();
return TRUE;
}
if (kill(pid, 0) == 0)
return TRUE;
return FALSE;
}
struct childdata * this_child(void)
{
pid_t mypid = getpid();
unsigned int i;
for_each_child(i) {
if (pids[i] == mypid)
return shm->children[i];
}
return NULL;
}
int find_childno(pid_t mypid)
{
unsigned int i;
for_each_child(i) {
if (pids[i] == mypid)
return i;
}
return CHILD_NOT_FOUND;
}
bool pidmap_empty(void)
{
unsigned int i;
for_each_child(i) {
if (pids[i] != EMPTY_PIDSLOT)
return FALSE;
}
return TRUE;
}
void dump_childnos(void)
{
unsigned int i, j = 0;
char string[512], *sptr = string;
sptr += sprintf(sptr, "## pids: (%u active)\n", shm->running_childs);
for (i = 0; i < max_children; i += 8) {
sptr += sprintf(sptr, "%u-%u: ", i, i + 7);
for (j = 0; j < 8; j++) {
struct childdata *child;
if (i + j >= max_children)
break;
child = shm->children[i + j];
if (pids[child->num] == EMPTY_PIDSLOT) {
sptr += sprintf(sptr, "[empty] ");
} else {
pid_t pid = pids[child->num];
sptr += sprintf(sptr, "%u ", pid);
}
}
sptr += sprintf(sptr, "\n");
*sptr = '\0';
outputerr("%s", string);
sptr = string;
}
}
static pid_t pidmax;
static int read_pid_max(void)
{
unsigned long result;
char *end, buf[32];
FILE *fp;
int rc;
fp = fopen("/proc/sys/kernel/pid_max", "r");
if (!fp) {
perror("fopen");
return -1;
}
rc = -1;
if (!fgets(buf, sizeof(buf), fp))
goto out;
result = strtoul(buf, &end, 10);
if (end == buf)
goto out;
pidmax = result;
rc = 0;
out:
fclose(fp);
return rc;
}
void pids_init(void)
{
unsigned int i;
if (read_pid_max()) {
#ifdef __x86_64__
pidmax = 4194304;
#else
pidmax = 32768;
#endif
outputerr("Couldn't read pid_max from proc\n");
}
output(0, "Using pid_max = %d\n", pidmax);
pids = alloc_shared(max_children * sizeof(int));
for_each_child(i)
pids[i] = EMPTY_PIDSLOT;
}
int pid_is_valid(pid_t pid)
{
if ((pid > pidmax) || (pid < 1))
return FALSE;
return TRUE;
}
unsigned int get_pid(void)
{
unsigned int i;
pid_t pid = 0;
/* If we get called from the parent, and there are no
* children around yet, we need to not look at the pidmap. */
if (shm->running_childs == 0)
return 0;
switch (rnd() % 3) {
case 0:
retry: i = rnd() % max_children;
pid = pids[i];
if (pid == EMPTY_PIDSLOT)
goto retry;
break;
case 1: pid = 0;
break;
case 2: if (dangerous == FALSE) // We don't want root trying to kill init.
pid = 1;
break;
}
return pid;
}