-
Notifications
You must be signed in to change notification settings - Fork 3
/
proc.c
292 lines (250 loc) · 8.9 KB
/
proc.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
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
/*
Copyright (c) 2015 Forkscan authors
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
#define _GNU_SOURCE // For pthread_yield().
#include "alloc.h"
#include <assert.h>
#include <errno.h>
#include "proc.h"
#include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "util.h"
/****************************************************************************/
/* Structs */
/****************************************************************************/
/**
* A mapline_t corresponds to a line of the maps file: /proc/<pid>/maps. It
* contains data the OS keeps around about mmap()'d ranges of memory.
*/
#define MAPLINE_PATH_SIZE 256
typedef struct mapline_t mapline_t;
struct mapline_t {
unsigned long long range_begin, range_end;
char bits[5];
unsigned long long f1;
unsigned int f2, f3;
unsigned int f4;
char path[MAPLINE_PATH_SIZE];
};
/****************************************************************************/
/* Static utilities */
/****************************************************************************/
/**
* List of threads the system needs to know about for signalling and
* stalling. This list gets updated whenever a new thread is created or
* whenever an old thread exits.
*/
static thread_list_t thread_list = { (thread_data_t*)0x1,
PTHREAD_MUTEX_INITIALIZER };
/**
* Return the list of thread metadata objects for all the threads known to
* Forkscan.
*/
thread_list_t *forkscan_proc_get_thread_list () { return &thread_list; }
/**
* Path to the maps file for this process: /proc/<pid>/maps
*/
static const char procmap[] = "/proc/self/maps";
/**
* Read a mapline_t from the proc map (in the OS pseudofile,
* /proc/<pid>/maps).
*
* @return Nonzero, if a line was read, zero otherwise.
*/
static int read_mapline (FILE *fp, mapline_t *m)
{
int n;
if (feof(fp)) return 0;
n = fscanf(fp, "%llx-%llx %s %llx %x:%x %d",
&m->range_begin, &m->range_end, m->bits, &m->f1,
&m->f2, &m->f3, &m->f4);
m->path[0] = '\0';
if (n != 7) {
if (n == -1) {
// EOF. Don't know why this happens, sometimes...
return 0;
}
forkscan_fatal("forkscan internal error: "
"fscanf returned %d (expected 7)\n", n);
} else {
char c;
while (' ' == (c = fgetc(fp)));
if (c != '\n' && c != EOF) {
m->path[0] = c;
n = fscanf(fp, "%s", &m->path[1]); // FIXME: not safe.
if (n != 1) {
forkscan_fatal("forkscan internal error: "
"fscanf returned %d (expected 1)\n",
n);
}
while ('\n' != (c = fgetc(fp)));
}
}
return 1; // populated a mapline.
}
/****************************************************************************/
/****************************************************************************/
/**
* Given an address, find the bounds of the stack on which it lives. The
* mem_range is populated based on the results.
*/
void forkscan_proc_stack_from_addr (mem_range_t *mem_range, size_t addr)
{
FILE *fp;
mapline_t mapline;
assert(mem_range);
assert(addr > 0);
mem_range->low = mem_range->high = 0;
if (NULL == (fp = fopen(procmap, "r"))) {
forkscan_fatal("unable to open memory map file.\n");
}
while (read_mapline(fp, &mapline)) {
if (addr > mapline.range_begin &&
addr < mapline.range_end) {
mem_range->low = mapline.range_begin;
mem_range->high = mapline.range_end;
break;
}
}
fclose(fp);
}
void forkscan_proc_map_iterate (int (*f) (void *arg,
size_t begin,
size_t end,
const char *bits,
const char *path),
void *user_arg)
{
FILE *fp;
mapline_t mapline;
if (NULL == (fp = fopen(procmap, "r"))) {
forkscan_fatal("unable to open memory map file.\n");
}
while (read_mapline(fp, &mapline)) {
if (0 == f(user_arg,
mapline.range_begin,
mapline.range_end,
mapline.bits,
mapline.path)) {
// User wants to stop.
break;
}
}
//fclose(fp); // FIXME: Need to make this explicit, somehow.
}
/****************************************************************************/
/* Per-thread data */
/****************************************************************************/
/**
* Threads call this to register themselves with Forkscan when they start.
*/
void forkscan_proc_add_thread_data (thread_data_t *td)
{
// The list initialization will only actually happen if this is the
// first time.
forkscan_util_thread_list_init(&thread_list);
forkscan_util_thread_list_add(&thread_list, td);
}
/**
* Threads call this when they are going away. It unregisters them with the
* Forkscan.
*/
void forkscan_proc_remove_thread_data (thread_data_t *td)
{
forkscan_util_thread_list_remove(&thread_list, td);
}
/**
* Send a signal to all threads in the process (except the calling thread)
* using pthread_kill().
*/
int forkscan_proc_signal_all_except (int sig, thread_data_t *except)
{
int signal_count = 0;
thread_data_t *td;
// Yay! C doesn't have lambdas! So this is way uglier and more fragile
// than it needs to be! Thanks, C.
// FIXME: Rewrite with iteration function.
FOREACH_IN_THREAD_LIST(td, &thread_list)
assert(td);
if (td != except && td->is_active) {
int ret = pthread_kill(td->self, sig);
if (EINVAL == ret) {
forkscan_fatal("pthread_kill() returned EINVAL.\n");
} else if (ESRCH == ret) {
forkscan_diagnostic("pthread_kill() returned ESRCH.\n");
} else {
++signal_count;
}
}
ENDFOREACH_IN_THREAD_LIST(td, &thread_list);
return signal_count;
}
/**
* Send a signal to all threads in the process using pthread_kill().
*/
int forkscan_proc_signal (int sig)
{
int signal_count = 0;
thread_data_t *td;
// Yay! C doesn't have lambdas! So this is way uglier and more fragile
// than it needs to be! Thanks, C.
FOREACH_IN_THREAD_LIST(td, &thread_list)
assert(td);
if (td->is_active) {
int ret = pthread_kill(td->self, sig);
if (EINVAL == ret) {
forkscan_fatal("pthread_kill() returned EINVAL.\n");
} else if (ESRCH == ret) {
forkscan_diagnostic("pthread_kill() returned ESRCH.\n");
} else {
++signal_count;
}
}
ENDFOREACH_IN_THREAD_LIST(td, &thread_list);
return signal_count;
}
/**
* Wait for all threads that are trying to help out to discover the
* current timestamp.
*/
void forkscan_proc_wait_for_timestamp (size_t curr)
{
thread_data_t *td;
FOREACH_IN_THREAD_LIST(td, &thread_list)
assert(td);
size_t stamp = td->local_timestamp;
while (TIMESTAMP_IS_ACTIVE(stamp)
&& TIMESTAMP(stamp) != curr) {
// This thread is still helping the previous round.
pthread_yield();
stamp = td->local_timestamp;
}
ENDFOREACH_IN_THREAD_LIST(td, &thread_list);
// After the loop, all threads either know about the current timestamp
// and will not try to do anything crazy with the heap, or they do not
// know about the current timestamp but they will find out about it if
// they try to help.
}
__attribute__((constructor (101)))
static void proc_init ()
{
thread_list.head = NULL;
}