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
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
|
/****************************************************************************
* bfs *
* Copyright (C) 2018-2022 Tavian Barnes <tavianator@tavianator.com> *
* *
* Permission to use, copy, modify, and/or distribute this software for any *
* purpose with or without fee is hereby granted. *
* *
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES *
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF *
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR *
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES *
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN *
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF *
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. *
****************************************************************************/
#include "xspawn.h"
#include "util.h"
#include <errno.h>
#include <fcntl.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <unistd.h>
/**
* Types of spawn actions.
*/
enum bfs_spawn_op {
BFS_SPAWN_CLOSE,
BFS_SPAWN_DUP2,
BFS_SPAWN_FCHDIR,
BFS_SPAWN_SETRLIMIT,
};
/**
* A spawn action.
*/
struct bfs_spawn_action {
struct bfs_spawn_action *next;
enum bfs_spawn_op op;
int in_fd;
int out_fd;
int resource;
struct rlimit rlimit;
};
int bfs_spawn_init(struct bfs_spawn *ctx) {
ctx->flags = 0;
ctx->actions = NULL;
ctx->tail = &ctx->actions;
return 0;
}
int bfs_spawn_destroy(struct bfs_spawn *ctx) {
struct bfs_spawn_action *action = ctx->actions;
while (action) {
struct bfs_spawn_action *next = action->next;
free(action);
action = next;
}
return 0;
}
int bfs_spawn_setflags(struct bfs_spawn *ctx, enum bfs_spawn_flags flags) {
ctx->flags = flags;
return 0;
}
/** Add a spawn action to the chain. */
static struct bfs_spawn_action *bfs_spawn_add(struct bfs_spawn *ctx, enum bfs_spawn_op op) {
struct bfs_spawn_action *action = malloc(sizeof(*action));
if (action) {
action->next = NULL;
action->op = op;
action->in_fd = -1;
action->out_fd = -1;
*ctx->tail = action;
ctx->tail = &action->next;
}
return action;
}
int bfs_spawn_addclose(struct bfs_spawn *ctx, int fd) {
if (fd < 0) {
errno = EBADF;
return -1;
}
struct bfs_spawn_action *action = bfs_spawn_add(ctx, BFS_SPAWN_CLOSE);
if (action) {
action->out_fd = fd;
return 0;
} else {
return -1;
}
}
int bfs_spawn_adddup2(struct bfs_spawn *ctx, int oldfd, int newfd) {
if (oldfd < 0 || newfd < 0) {
errno = EBADF;
return -1;
}
struct bfs_spawn_action *action = bfs_spawn_add(ctx, BFS_SPAWN_DUP2);
if (action) {
action->in_fd = oldfd;
action->out_fd = newfd;
return 0;
} else {
return -1;
}
}
int bfs_spawn_addfchdir(struct bfs_spawn *ctx, int fd) {
if (fd < 0) {
errno = EBADF;
return -1;
}
struct bfs_spawn_action *action = bfs_spawn_add(ctx, BFS_SPAWN_FCHDIR);
if (action) {
action->in_fd = fd;
return 0;
} else {
return -1;
}
}
int bfs_spawn_addsetrlimit(struct bfs_spawn *ctx, int resource, const struct rlimit *rl) {
struct bfs_spawn_action *action = bfs_spawn_add(ctx, BFS_SPAWN_SETRLIMIT);
if (action) {
action->resource = resource;
action->rlimit = *rl;
return 0;
} else {
return -1;
}
}
/** Actually exec() the new process. */
static void bfs_spawn_exec(const char *exe, const struct bfs_spawn *ctx, char **argv, char **envp, int pipefd[2]) {
int error;
const struct bfs_spawn_action *actions = ctx ? ctx->actions : NULL;
xclose(pipefd[0]);
for (const struct bfs_spawn_action *action = actions; action; action = action->next) {
// Move the error-reporting pipe out of the way if necessary...
if (action->out_fd == pipefd[1]) {
int fd = dup_cloexec(pipefd[1]);
if (fd < 0) {
goto fail;
}
xclose(pipefd[1]);
pipefd[1] = fd;
}
// ... and pretend the pipe doesn't exist
if (action->in_fd == pipefd[1]) {
errno = EBADF;
goto fail;
}
switch (action->op) {
case BFS_SPAWN_CLOSE:
if (close(action->out_fd) != 0) {
goto fail;
}
break;
case BFS_SPAWN_DUP2:
if (dup2(action->in_fd, action->out_fd) < 0) {
goto fail;
}
break;
case BFS_SPAWN_FCHDIR:
if (fchdir(action->in_fd) != 0) {
goto fail;
}
break;
case BFS_SPAWN_SETRLIMIT:
if (setrlimit(action->resource, &action->rlimit) != 0) {
goto fail;
}
break;
}
}
execve(exe, argv, envp);
fail:
error = errno;
// In case of a write error, the parent will still see that we exited
// unsuccessfully, but won't know why
(void) xwrite(pipefd[1], &error, sizeof(error));
xclose(pipefd[1]);
_Exit(127);
}
pid_t bfs_spawn(const char *exe, const struct bfs_spawn *ctx, char **argv, char **envp) {
extern char **environ;
if (!envp) {
envp = environ;
}
enum bfs_spawn_flags flags = ctx ? ctx->flags : 0;
char *resolved = NULL;
if (flags & BFS_SPAWN_USEPATH) {
exe = resolved = bfs_spawn_resolve(exe);
if (!resolved) {
return -1;
}
}
// Use a pipe to report errors from the child
int pipefd[2];
if (pipe_cloexec(pipefd) != 0) {
free(resolved);
return -1;
}
pid_t pid = fork();
if (pid < 0) {
close_quietly(pipefd[1]);
close_quietly(pipefd[0]);
free(resolved);
return -1;
} else if (pid == 0) {
// Child
bfs_spawn_exec(exe, ctx, argv, envp, pipefd);
}
// Parent
xclose(pipefd[1]);
free(resolved);
int error;
ssize_t nbytes = xread(pipefd[0], &error, sizeof(error));
xclose(pipefd[0]);
if (nbytes == sizeof(error)) {
int wstatus;
waitpid(pid, &wstatus, 0);
errno = error;
return -1;
}
return pid;
}
char *bfs_spawn_resolve(const char *exe) {
if (strchr(exe, '/')) {
return strdup(exe);
}
const char *path = getenv("PATH");
char *confpath = NULL;
if (!path) {
path = confpath = xconfstr(_CS_PATH);
if (!path) {
return NULL;
}
}
size_t cap = 0;
char *ret = NULL;
while (true) {
const char *end = strchr(path, ':');
size_t len = end ? (size_t)(end -
|