Commit | Line | Data |
---|---|---|
0f78b815 WD |
1 | /* |
2 | * Utility routines used in rsync. | |
5cb37436 | 3 | * |
0f78b815 WD |
4 | * Copyright (C) 1996-2000 Andrew Tridgell |
5 | * Copyright (C) 1996 Paul Mackerras | |
6 | * Copyright (C) 2001, 2002 Martin Pool <mbp@samba.org> | |
b3bf9b9d | 7 | * Copyright (C) 2003-2009 Wayne Davison |
5cb37436 | 8 | * |
0ecfbf27 | 9 | * This program is free software; you can redistribute it and/or modify |
8e41b68e WD |
10 | * it under the terms of the GNU General Public License as published by |
11 | * the Free Software Foundation; either version 3 of the License, or | |
12 | * (at your option) any later version. | |
5cb37436 | 13 | * |
0ecfbf27 MP |
14 | * This program is distributed in the hope that it will be useful, |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | * GNU General Public License for more details. | |
5cb37436 | 18 | * |
e7c67065 | 19 | * You should have received a copy of the GNU General Public License along |
4fd842f9 | 20 | * with this program; if not, visit the http://fsf.org website. |
0ecfbf27 | 21 | */ |
c627d613 | 22 | |
c627d613 | 23 | #include "rsync.h" |
1b42f628 | 24 | #include "ifuncs.h" |
5dd14f0c WD |
25 | #include "itypes.h" |
26 | #include "inums.h" | |
c627d613 | 27 | |
bc6ebcd2 WD |
28 | extern int dry_run; |
29 | extern int module_id; | |
30 | extern int modify_window; | |
7e43da81 | 31 | extern int relative_paths; |
e9489cd6 | 32 | extern int preserve_xattrs; |
7c73536c | 33 | extern char *module_dir; |
a8167c66 | 34 | extern unsigned int module_dirlen; |
e9357a2d | 35 | extern mode_t orig_umask; |
a7260c40 | 36 | extern char *partial_dir; |
819bfe45 | 37 | extern struct filter_list_struct daemon_filter_list; |
c7c11a0d | 38 | |
0ecfbf27 MP |
39 | int sanitize_paths = 0; |
40 | ||
a8167c66 WD |
41 | char curr_dir[MAXPATHLEN]; |
42 | unsigned int curr_dir_len; | |
43 | int curr_dir_depth; /* This is only set for a sanitizing daemon. */ | |
44 | ||
0f78b815 | 45 | /* Set a fd into nonblocking mode. */ |
f0359dd0 AT |
46 | void set_nonblocking(int fd) |
47 | { | |
48 | int val; | |
49 | ||
ff530f04 | 50 | if ((val = fcntl(fd, F_GETFL)) == -1) |
f0359dd0 AT |
51 | return; |
52 | if (!(val & NONBLOCK_FLAG)) { | |
53 | val |= NONBLOCK_FLAG; | |
54 | fcntl(fd, F_SETFL, val); | |
55 | } | |
56 | } | |
57 | ||
0f78b815 | 58 | /* Set a fd into blocking mode. */ |
36349ea0 AT |
59 | void set_blocking(int fd) |
60 | { | |
61 | int val; | |
62 | ||
ff530f04 | 63 | if ((val = fcntl(fd, F_GETFL)) == -1) |
36349ea0 AT |
64 | return; |
65 | if (val & NONBLOCK_FLAG) { | |
66 | val &= ~NONBLOCK_FLAG; | |
67 | fcntl(fd, F_SETFL, val); | |
68 | } | |
69 | } | |
70 | ||
ac13ad10 | 71 | /** |
0ecfbf27 MP |
72 | * Create a file descriptor pair - like pipe() but use socketpair if |
73 | * possible (because of blocking issues on pipes). | |
5cb37436 | 74 | * |
0ecfbf27 | 75 | * Always set non-blocking. |
f0359dd0 | 76 | */ |
08f15335 AT |
77 | int fd_pair(int fd[2]) |
78 | { | |
f0359dd0 AT |
79 | int ret; |
80 | ||
4f5b0756 | 81 | #ifdef HAVE_SOCKETPAIR |
f0359dd0 | 82 | ret = socketpair(AF_UNIX, SOCK_STREAM, 0, fd); |
08f15335 | 83 | #else |
f0359dd0 | 84 | ret = pipe(fd); |
08f15335 | 85 | #endif |
f0359dd0 AT |
86 | |
87 | if (ret == 0) { | |
88 | set_nonblocking(fd[0]); | |
89 | set_nonblocking(fd[1]); | |
90 | } | |
0ecfbf27 | 91 | |
f0359dd0 | 92 | return ret; |
08f15335 AT |
93 | } |
94 | ||
0b515981 | 95 | void print_child_argv(const char *prefix, char **cmd) |
5ad0e46f | 96 | { |
0b515981 | 97 | rprintf(FCLIENT, "%s ", prefix); |
5ad0e46f MP |
98 | for (; *cmd; cmd++) { |
99 | /* Look for characters that ought to be quoted. This | |
100 | * is not a great quoting algorithm, but it's | |
101 | * sufficient for a log message. */ | |
102 | if (strspn(*cmd, "abcdefghijklmnopqrstuvwxyz" | |
103 | "ABCDEFGHIJKLMNOPQRSTUVWXYZ" | |
104 | "0123456789" | |
105 | ",.-_=+@/") != strlen(*cmd)) { | |
a3f6dbdf | 106 | rprintf(FCLIENT, "\"%s\" ", *cmd); |
5ad0e46f | 107 | } else { |
a3f6dbdf | 108 | rprintf(FCLIENT, "%s ", *cmd); |
5ad0e46f MP |
109 | } |
110 | } | |
a3f6dbdf | 111 | rprintf(FCLIENT, "\n"); |
5ad0e46f MP |
112 | } |
113 | ||
4a19c3b2 | 114 | NORETURN void out_of_memory(const char *str) |
c627d613 | 115 | { |
2cd421d8 | 116 | rprintf(FERROR, "ERROR: out of memory in %s [%s]\n", str, who_am_i()); |
c284f34a | 117 | exit_cleanup(RERR_MALLOC); |
575f2fca AT |
118 | } |
119 | ||
4a19c3b2 | 120 | NORETURN void overflow_exit(const char *str) |
575f2fca | 121 | { |
2cd421d8 | 122 | rprintf(FERROR, "ERROR: buffer overflow in %s [%s]\n", str, who_am_i()); |
c284f34a | 123 | exit_cleanup(RERR_MALLOC); |
c627d613 AT |
124 | } |
125 | ||
4a19c3b2 | 126 | int set_modtime(const char *fname, time_t modtime, mode_t mode) |
c627d613 | 127 | { |
25007999 WD |
128 | #if !defined HAVE_LUTIMES || !defined HAVE_UTIMES |
129 | if (S_ISLNK(mode)) | |
130 | return 1; | |
131 | #endif | |
132 | ||
951e826b | 133 | if (DEBUG_GTE(TIME, 1)) { |
404e813c | 134 | rprintf(FINFO, "set modtime of %s to (%ld) %s", |
785abd48 | 135 | fname, (long)modtime, |
404e813c MP |
136 | asctime(localtime(&modtime))); |
137 | } | |
5cb37436 | 138 | |
15778afb WD |
139 | if (dry_run) |
140 | return 0; | |
141 | ||
31e12522 | 142 | { |
25007999 WD |
143 | #ifdef HAVE_UTIMES |
144 | struct timeval t[2]; | |
145 | t[0].tv_sec = time(NULL); | |
146 | t[0].tv_usec = 0; | |
147 | t[1].tv_sec = modtime; | |
148 | t[1].tv_usec = 0; | |
149 | # ifdef HAVE_LUTIMES | |
149a78e3 | 150 | if (S_ISLNK(mode)) { |
a5bb0902 WD |
151 | if (lutimes(fname, t) < 0) |
152 | return errno == ENOSYS ? 1 : -1; | |
77d4c400 | 153 | return 0; |
149a78e3 | 154 | } |
25007999 WD |
155 | # endif |
156 | return utimes(fname, t); | |
4f9b139a | 157 | #elif defined HAVE_STRUCT_UTIMBUF |
5cb37436 | 158 | struct utimbuf tbuf; |
31e12522 AT |
159 | tbuf.actime = time(NULL); |
160 | tbuf.modtime = modtime; | |
161 | return utime(fname,&tbuf); | |
4f5b0756 | 162 | #elif defined HAVE_UTIME |
31e12522 AT |
163 | time_t t[2]; |
164 | t[0] = time(NULL); | |
165 | t[1] = modtime; | |
166 | return utime(fname,t); | |
c627d613 | 167 | #else |
25007999 | 168 | #error No file-time-modification routine found! |
c627d613 | 169 | #endif |
31e12522 | 170 | } |
c627d613 | 171 | } |
94481d91 | 172 | |
e9357a2d WD |
173 | /* This creates a new directory with default permissions. Since there |
174 | * might be some directory-default permissions affecting this, we can't | |
175 | * force the permissions directly using the original umask and mkdir(). */ | |
176 | int mkdir_defmode(char *fname) | |
177 | { | |
178 | int ret; | |
179 | ||
180 | umask(orig_umask); | |
181 | ret = do_mkdir(fname, ACCESSPERMS); | |
182 | umask(0); | |
183 | ||
184 | return ret; | |
185 | } | |
186 | ||
85c41757 | 187 | /* Create any necessary directories in fname. Any missing directories are |
3696674b WD |
188 | * created with default permissions. Returns < 0 on error, or the number |
189 | * of directories created. */ | |
190 | int make_path(char *fname, int flags) | |
6574b4f7 | 191 | { |
3696674b | 192 | char *end, *p; |
85c41757 | 193 | int ret = 0; |
6574b4f7 | 194 | |
3696674b WD |
195 | if (flags & MKP_SKIP_SLASH) { |
196 | while (*fname == '/') | |
197 | fname++; | |
198 | } | |
199 | ||
200 | while (*fname == '.' && fname[1] == '/') | |
c284f34a | 201 | fname += 2; |
6574b4f7 | 202 | |
3696674b WD |
203 | if (flags & MKP_DROP_NAME) { |
204 | end = strrchr(fname, '/'); | |
205 | if (!end) | |
206 | return 0; | |
207 | *end = '\0'; | |
208 | } else | |
209 | end = fname + strlen(fname); | |
210 | ||
211 | umask(orig_umask); /* NOTE: don't return before setting this back to 0! */ | |
212 | ||
213 | /* Try to find an existing dir, starting from the deepest dir. */ | |
214 | for (p = end; ; ) { | |
215 | if (do_mkdir(fname, ACCESSPERMS) == 0) { | |
216 | ret++; | |
217 | break; | |
218 | } | |
219 | if (errno != ENOENT) { | |
220 | if (errno != EEXIST) | |
221 | ret = -ret - 1; | |
222 | break; | |
223 | } | |
224 | while (1) { | |
225 | if (p == fname) { | |
226 | ret = -ret - 1; | |
227 | goto double_break; | |
228 | } | |
229 | if (*--p == '/') { | |
230 | if (p == fname) { | |
231 | ret = -ret - 1; /* impossible... */ | |
232 | goto double_break; | |
233 | } | |
234 | *p = '\0'; | |
235 | break; | |
236 | } | |
237 | } | |
238 | } | |
239 | double_break: | |
240 | ||
241 | /* Make all the dirs that we didn't find on the way here. */ | |
242 | while (p != end) { | |
243 | *p = '/'; | |
244 | p += strlen(p); | |
245 | if (ret < 0) /* Skip mkdir on error, but keep restoring the path. */ | |
246 | continue; | |
247 | if (do_mkdir(fname, ACCESSPERMS) < 0) | |
248 | ret = -ret - 1; | |
249 | else | |
250 | ret++; | |
6574b4f7 | 251 | } |
3696674b | 252 | |
85c41757 WD |
253 | umask(0); |
254 | ||
3696674b WD |
255 | if (flags & MKP_DROP_NAME) |
256 | *end = '/'; | |
257 | ||
85c41757 | 258 | return ret; |
6574b4f7 | 259 | } |
950ab32d | 260 | |
ac13ad10 MP |
261 | /** |
262 | * Write @p len bytes at @p ptr to descriptor @p desc, retrying if | |
263 | * interrupted. | |
264 | * | |
265 | * @retval len upon success | |
266 | * | |
267 | * @retval <0 write's (negative) error code | |
268 | * | |
269 | * Derived from GNU C's cccp.c. | |
270 | */ | |
4a19c3b2 | 271 | int full_write(int desc, const char *ptr, size_t len) |
950ab32d AT |
272 | { |
273 | int total_written; | |
5cb37436 | 274 | |
950ab32d AT |
275 | total_written = 0; |
276 | while (len > 0) { | |
5c1b7bfd | 277 | int written = write(desc, ptr, len); |
950ab32d | 278 | if (written < 0) { |
950ab32d AT |
279 | if (errno == EINTR) |
280 | continue; | |
950ab32d AT |
281 | return written; |
282 | } | |
283 | total_written += written; | |
284 | ptr += written; | |
285 | len -= written; | |
286 | } | |
287 | return total_written; | |
288 | } | |
289 | ||
ac13ad10 MP |
290 | /** |
291 | * Read @p len bytes at @p ptr from descriptor @p desc, retrying if | |
292 | * interrupted. | |
293 | * | |
294 | * @retval >0 the actual number of bytes read | |
295 | * | |
296 | * @retval 0 for EOF | |
297 | * | |
298 | * @retval <0 for an error. | |
299 | * | |
300 | * Derived from GNU C's cccp.c. */ | |
9dd891bb | 301 | static int safe_read(int desc, char *ptr, size_t len) |
950ab32d AT |
302 | { |
303 | int n_chars; | |
5cb37436 | 304 | |
9dd891bb | 305 | if (len == 0) |
950ab32d | 306 | return len; |
5cb37436 | 307 | |
950ab32d AT |
308 | do { |
309 | n_chars = read(desc, ptr, len); | |
310 | } while (n_chars < 0 && errno == EINTR); | |
5cb37436 | 311 | |
950ab32d AT |
312 | return n_chars; |
313 | } | |
314 | ||
2cce7545 WD |
315 | /* Copy a file. If ofd < 0, copy_file unlinks and opens the "dest" file. |
316 | * Otherwise, it just writes to and closes the provided file descriptor. | |
e9489cd6 WD |
317 | * In either case, if --xattrs are being preserved, the dest file will |
318 | * have its xattrs set from the source file. | |
ac13ad10 | 319 | * |
3e13004b WD |
320 | * This is used in conjunction with the --temp-dir, --backup, and |
321 | * --copy-dest options. */ | |
3696674b | 322 | int copy_file(const char *source, const char *dest, int ofd, mode_t mode) |
950ab32d AT |
323 | { |
324 | int ifd; | |
950ab32d AT |
325 | char buf[1024 * 8]; |
326 | int len; /* Number of bytes read into `buf'. */ | |
327 | ||
f5b532b1 | 328 | if ((ifd = do_open(source, O_RDONLY, 0)) < 0) { |
f1ca7c44 | 329 | int save_errno = errno; |
3f0211b6 | 330 | rsyserr(FERROR_XFER, errno, "open %s", full_fname(source)); |
f1ca7c44 | 331 | errno = save_errno; |
950ab32d AT |
332 | return -1; |
333 | } | |
334 | ||
2cce7545 WD |
335 | if (ofd < 0) { |
336 | if (robust_unlink(dest) && errno != ENOENT) { | |
f1ca7c44 | 337 | int save_errno = errno; |
3f0211b6 | 338 | rsyserr(FERROR_XFER, errno, "unlink %s", full_fname(dest)); |
f1ca7c44 | 339 | errno = save_errno; |
2cce7545 WD |
340 | return -1; |
341 | } | |
950ab32d | 342 | |
f1ca7c44 | 343 | if ((ofd = do_open(dest, O_WRONLY | O_CREAT | O_TRUNC | O_EXCL, mode)) < 0) { |
3696674b WD |
344 | int save_errno = errno; |
345 | rsyserr(FERROR_XFER, save_errno, "open %s", full_fname(dest)); | |
346 | close(ifd); | |
347 | errno = save_errno; | |
348 | return -1; | |
2cce7545 | 349 | } |
950ab32d AT |
350 | } |
351 | ||
5cb37436 | 352 | while ((len = safe_read(ifd, buf, sizeof buf)) > 0) { |
950ab32d | 353 | if (full_write(ofd, buf, len) < 0) { |
f1ca7c44 | 354 | int save_errno = errno; |
3f0211b6 | 355 | rsyserr(FERROR_XFER, errno, "write %s", full_fname(dest)); |
950ab32d AT |
356 | close(ifd); |
357 | close(ofd); | |
f1ca7c44 | 358 | errno = save_errno; |
950ab32d AT |
359 | return -1; |
360 | } | |
361 | } | |
362 | ||
8b602edd | 363 | if (len < 0) { |
f1ca7c44 | 364 | int save_errno = errno; |
3f0211b6 | 365 | rsyserr(FERROR_XFER, errno, "read %s", full_fname(source)); |
8b602edd WD |
366 | close(ifd); |
367 | close(ofd); | |
f1ca7c44 | 368 | errno = save_errno; |
8b602edd WD |
369 | return -1; |
370 | } | |
371 | ||
9f27cd8c | 372 | if (close(ifd) < 0) { |
3f0211b6 | 373 | rsyserr(FWARNING, errno, "close failed on %s", |
d62bcc17 | 374 | full_fname(source)); |
9f27cd8c WD |
375 | } |
376 | ||
377 | if (close(ofd) < 0) { | |
f1ca7c44 | 378 | int save_errno = errno; |
3f0211b6 | 379 | rsyserr(FERROR_XFER, errno, "close failed on %s", |
d62bcc17 | 380 | full_fname(dest)); |
f1ca7c44 | 381 | errno = save_errno; |
9f27cd8c WD |
382 | return -1; |
383 | } | |
950ab32d | 384 | |
e9489cd6 WD |
385 | #ifdef SUPPORT_XATTRS |
386 | if (preserve_xattrs) | |
387 | copy_xattrs(source, dest); | |
388 | #endif | |
389 | ||
950ab32d AT |
390 | return 0; |
391 | } | |
feaa89c4 | 392 | |
c7c11a0d DD |
393 | /* MAX_RENAMES should be 10**MAX_RENAMES_DIGITS */ |
394 | #define MAX_RENAMES_DIGITS 3 | |
395 | #define MAX_RENAMES 1000 | |
396 | ||
ac13ad10 | 397 | /** |
b4235b31 MP |
398 | * Robust unlink: some OS'es (HPUX) refuse to unlink busy files, so |
399 | * rename to <path>/.rsyncNNN instead. | |
400 | * | |
401 | * Note that successive rsync runs will shuffle the filenames around a | |
402 | * bit as long as the file is still busy; this is because this function | |
403 | * does not know if the unlink call is due to a new file coming in, or | |
404 | * --delete trying to remove old .rsyncNNN files, hence it renames it | |
405 | * each time. | |
406 | **/ | |
63cf5ae7 | 407 | int robust_unlink(const char *fname) |
c7c11a0d DD |
408 | { |
409 | #ifndef ETXTBSY | |
410 | return do_unlink(fname); | |
411 | #else | |
412 | static int counter = 1; | |
413 | int rc, pos, start; | |
414 | char path[MAXPATHLEN]; | |
415 | ||
416 | rc = do_unlink(fname); | |
c284f34a | 417 | if (rc == 0 || errno != ETXTBSY) |
c7c11a0d DD |
418 | return rc; |
419 | ||
c284f34a WD |
420 | if ((pos = strlcpy(path, fname, MAXPATHLEN)) >= MAXPATHLEN) |
421 | pos = MAXPATHLEN - 1; | |
c7c11a0d | 422 | |
c284f34a WD |
423 | while (pos > 0 && path[pos-1] != '/') |
424 | pos--; | |
5cb37436 | 425 | pos += strlcpy(path+pos, ".rsync", MAXPATHLEN-pos); |
c7c11a0d DD |
426 | |
427 | if (pos > (MAXPATHLEN-MAX_RENAMES_DIGITS-1)) { | |
428 | errno = ETXTBSY; | |
429 | return -1; | |
430 | } | |
431 | ||
432 | /* start where the last one left off to reduce chance of clashes */ | |
433 | start = counter; | |
434 | do { | |
434c4098 | 435 | snprintf(&path[pos], MAX_RENAMES_DIGITS+1, "%03d", counter); |
c7c11a0d DD |
436 | if (++counter >= MAX_RENAMES) |
437 | counter = 1; | |
c284f34a | 438 | } while ((rc = access(path, 0)) == 0 && counter != start); |
c7c11a0d | 439 | |
951e826b | 440 | if (INFO_GTE(MISC, 1)) { |
3f0211b6 | 441 | rprintf(FWARNING, "renaming %s to %s because of text busy\n", |
785abd48 | 442 | fname, path); |
4791825d | 443 | } |
c7c11a0d DD |
444 | |
445 | /* maybe we should return rename()'s exit status? Nah. */ | |
446 | if (do_rename(fname, path) != 0) { | |
447 | errno = ETXTBSY; | |
448 | return -1; | |
449 | } | |
450 | return 0; | |
451 | #endif | |
452 | } | |
453 | ||
630f548f | 454 | /* Returns 0 on successful rename, 1 if we successfully copied the file |
3ed8eafc WD |
455 | * across filesystems, -2 if copy_file() failed, and -1 on other errors. |
456 | * If partialptr is not NULL and we need to do a copy, copy the file into | |
457 | * the active partial-dir instead of over the destination file. */ | |
4a19c3b2 | 458 | int robust_rename(const char *from, const char *to, const char *partialptr, |
3ed8eafc | 459 | int mode) |
c7c11a0d | 460 | { |
62c9e6b3 WD |
461 | int tries = 4; |
462 | ||
463 | while (tries--) { | |
464 | if (do_rename(from, to) == 0) | |
465 | return 0; | |
466 | ||
467 | switch (errno) { | |
468 | #ifdef ETXTBSY | |
469 | case ETXTBSY: | |
f1ca7c44 WD |
470 | if (robust_unlink(to) != 0) { |
471 | errno = ETXTBSY; | |
62c9e6b3 | 472 | return -1; |
f1ca7c44 WD |
473 | } |
474 | errno = ETXTBSY; | |
62c9e6b3 | 475 | break; |
c7c11a0d | 476 | #endif |
62c9e6b3 | 477 | case EXDEV: |
3ed8eafc WD |
478 | if (partialptr) { |
479 | if (!handle_partial_dir(partialptr,PDIR_CREATE)) | |
0479eb76 | 480 | return -2; |
3ed8eafc WD |
481 | to = partialptr; |
482 | } | |
3696674b | 483 | if (copy_file(from, to, -1, mode) != 0) |
62c9e6b3 WD |
484 | return -2; |
485 | do_unlink(from); | |
630f548f | 486 | return 1; |
62c9e6b3 WD |
487 | default: |
488 | return -1; | |
489 | } | |
490 | } | |
491 | return -1; | |
feaa89c4 | 492 | } |
3ba62a83 | 493 | |
3ba62a83 AT |
494 | static pid_t all_pids[10]; |
495 | static int num_pids; | |
496 | ||
4cf64834 | 497 | /** Fork and record the pid of the child. **/ |
3ba62a83 AT |
498 | pid_t do_fork(void) |
499 | { | |
500 | pid_t newpid = fork(); | |
5cb37436 | 501 | |
4cf64834 | 502 | if (newpid != 0 && newpid != -1) { |
3ba62a83 AT |
503 | all_pids[num_pids++] = newpid; |
504 | } | |
505 | return newpid; | |
506 | } | |
507 | ||
4cf64834 MP |
508 | /** |
509 | * Kill all children. | |
510 | * | |
511 | * @todo It would be kind of nice to make sure that they are actually | |
512 | * all our children before we kill them, because their pids may have | |
513 | * been recycled by some other process. Perhaps when we wait for a | |
514 | * child, we should remove it from this array. Alternatively we could | |
515 | * perhaps use process groups, but I think that would not work on | |
516 | * ancient Unix versions that don't support them. | |
517 | **/ | |
3ba62a83 AT |
518 | void kill_all(int sig) |
519 | { | |
520 | int i; | |
4cf64834 MP |
521 | |
522 | for (i = 0; i < num_pids; i++) { | |
523 | /* Let's just be a little careful where we | |
524 | * point that gun, hey? See kill(2) for the | |
525 | * magic caused by negative values. */ | |
526 | pid_t p = all_pids[i]; | |
527 | ||
528 | if (p == getpid()) | |
529 | continue; | |
530 | if (p <= 0) | |
531 | continue; | |
532 | ||
533 | kill(p, sig); | |
3ba62a83 AT |
534 | } |
535 | } | |
9486289c | 536 | |
56017d31 WD |
537 | /* Parse a user name or (optionally) a number into a uid */ |
538 | int user_to_uid(const char *name, uid_t *uid_p, BOOL num_ok) | |
8ef4ffd6 AT |
539 | { |
540 | struct passwd *pass; | |
b5bd5542 WD |
541 | if (!name || !*name) |
542 | return 0; | |
56017d31 WD |
543 | if (num_ok && name[strspn(name, "0123456789")] == '\0') { |
544 | *uid_p = atol(name); | |
545 | return 1; | |
546 | } | |
7210dbfd WD |
547 | if (!(pass = getpwnam(name))) |
548 | return 0; | |
549 | *uid_p = pass->pw_uid; | |
550 | return 1; | |
8ef4ffd6 AT |
551 | } |
552 | ||
56017d31 WD |
553 | /* Parse a group name or (optionally) a number into a gid */ |
554 | int group_to_gid(const char *name, gid_t *gid_p, BOOL num_ok) | |
8ef4ffd6 AT |
555 | { |
556 | struct group *grp; | |
b5bd5542 WD |
557 | if (!name || !*name) |
558 | return 0; | |
56017d31 WD |
559 | if (num_ok && name[strspn(name, "0123456789")] == '\0') { |
560 | *gid_p = atol(name); | |
561 | return 1; | |
562 | } | |
7210dbfd WD |
563 | if (!(grp = getgrnam(name))) |
564 | return 0; | |
565 | *gid_p = grp->gr_gid; | |
566 | return 1; | |
8ef4ffd6 AT |
567 | } |
568 | ||
ac13ad10 | 569 | /** Lock a byte range in a open file */ |
31593dd6 | 570 | int lock_range(int fd, int offset, int len) |
0c515f17 | 571 | { |
31593dd6 | 572 | struct flock lock; |
0c515f17 | 573 | |
31593dd6 AT |
574 | lock.l_type = F_WRLCK; |
575 | lock.l_whence = SEEK_SET; | |
576 | lock.l_start = offset; | |
577 | lock.l_len = len; | |
578 | lock.l_pid = 0; | |
5cb37436 | 579 | |
31593dd6 | 580 | return fcntl(fd,F_SETLK,&lock) == 0; |
0c515f17 | 581 | } |
874895d5 | 582 | |
4d30f176 | 583 | #define ENSURE_MEMSPACE(buf, type, sz, req) \ |
bc267e0f WD |
584 | if ((req) > sz && !(buf = realloc_array(buf, type, sz = MAX(sz * 2, req)))) \ |
585 | out_of_memory("glob_expand") | |
4d30f176 WD |
586 | |
587 | static inline void call_glob_match(const char *name, int len, int from_glob, | |
588 | char *arg, int abpos, int fbpos); | |
589 | ||
987a5467 WD |
590 | static struct glob_data { |
591 | char *arg_buf, *filt_buf, **argv; | |
592 | int absize, fbsize, maxargs, argc; | |
593 | } glob; | |
4d30f176 WD |
594 | |
595 | static void glob_match(char *arg, int abpos, int fbpos) | |
4791825d | 596 | { |
4d30f176 WD |
597 | int len; |
598 | char *slash; | |
599 | ||
600 | while (*arg == '.' && arg[1] == '/') { | |
601 | if (fbpos < 0) { | |
bc267e0f | 602 | ENSURE_MEMSPACE(glob.filt_buf, char, glob.fbsize, glob.absize); |
987a5467 | 603 | memcpy(glob.filt_buf, glob.arg_buf, abpos + 1); |
4d30f176 | 604 | fbpos = abpos; |
4791825d | 605 | } |
bc267e0f | 606 | ENSURE_MEMSPACE(glob.arg_buf, char, glob.absize, abpos + 3); |
987a5467 WD |
607 | glob.arg_buf[abpos++] = *arg++; |
608 | glob.arg_buf[abpos++] = *arg++; | |
609 | glob.arg_buf[abpos] = '\0'; | |
4791825d | 610 | } |
4d30f176 WD |
611 | if ((slash = strchr(arg, '/')) != NULL) { |
612 | *slash = '\0'; | |
613 | len = slash - arg; | |
614 | } else | |
615 | len = strlen(arg); | |
616 | if (strpbrk(arg, "*?[")) { | |
617 | struct dirent *di; | |
618 | DIR *d; | |
619 | ||
987a5467 | 620 | if (!(d = opendir(abpos ? glob.arg_buf : "."))) |
4d30f176 WD |
621 | return; |
622 | while ((di = readdir(d)) != NULL) { | |
623 | char *dname = d_name(di); | |
624 | if (dname[0] == '.' && (dname[1] == '\0' | |
625 | || (dname[1] == '.' && dname[2] == '\0'))) | |
626 | continue; | |
627 | if (!wildmatch(arg, dname)) | |
628 | continue; | |
629 | call_glob_match(dname, strlen(dname), 1, | |
630 | slash ? arg + len + 1 : NULL, | |
631 | abpos, fbpos); | |
632 | } | |
633 | closedir(d); | |
634 | } else { | |
635 | call_glob_match(arg, len, 0, | |
636 | slash ? arg + len + 1 : NULL, | |
637 | abpos, fbpos); | |
638 | } | |
639 | if (slash) | |
640 | *slash = '/'; | |
4791825d | 641 | } |
874895d5 | 642 | |
4d30f176 WD |
643 | static inline void call_glob_match(const char *name, int len, int from_glob, |
644 | char *arg, int abpos, int fbpos) | |
874895d5 | 645 | { |
4d30f176 WD |
646 | char *use_buf; |
647 | ||
987a5467 WD |
648 | ENSURE_MEMSPACE(glob.arg_buf, char, glob.absize, abpos + len + 2); |
649 | memcpy(glob.arg_buf + abpos, name, len); | |
4d30f176 | 650 | abpos += len; |
987a5467 | 651 | glob.arg_buf[abpos] = '\0'; |
4d30f176 WD |
652 | |
653 | if (fbpos >= 0) { | |
987a5467 WD |
654 | ENSURE_MEMSPACE(glob.filt_buf, char, glob.fbsize, fbpos + len + 2); |
655 | memcpy(glob.filt_buf + fbpos, name, len); | |
4d30f176 | 656 | fbpos += len; |
987a5467 WD |
657 | glob.filt_buf[fbpos] = '\0'; |
658 | use_buf = glob.filt_buf; | |
4d30f176 | 659 | } else |
987a5467 | 660 | use_buf = glob.arg_buf; |
4d30f176 | 661 | |
6db1db54 | 662 | if (from_glob || (arg && len)) { |
4d30f176 WD |
663 | STRUCT_STAT st; |
664 | int is_dir; | |
665 | ||
b5daf530 WD |
666 | if (do_stat(glob.arg_buf, &st) != 0) |
667 | return; | |
668 | is_dir = S_ISDIR(st.st_mode) != 0; | |
669 | if (arg && !is_dir) | |
670 | return; | |
4d30f176 WD |
671 | |
672 | if (daemon_filter_list.head | |
1df02d13 | 673 | && check_filter(&daemon_filter_list, FLOG, use_buf, is_dir) < 0) |
b5daf530 | 674 | return; |
b7061c82 | 675 | } |
874895d5 | 676 | |
4d30f176 | 677 | if (arg) { |
987a5467 WD |
678 | glob.arg_buf[abpos++] = '/'; |
679 | glob.arg_buf[abpos] = '\0'; | |
4d30f176 | 680 | if (fbpos >= 0) { |
987a5467 WD |
681 | glob.filt_buf[fbpos++] = '/'; |
682 | glob.filt_buf[fbpos] = '\0'; | |
4d30f176 WD |
683 | } |
684 | glob_match(arg, abpos, fbpos); | |
685 | } else { | |
987a5467 WD |
686 | ENSURE_MEMSPACE(glob.argv, char *, glob.maxargs, glob.argc + 1); |
687 | if (!(glob.argv[glob.argc++] = strdup(glob.arg_buf))) | |
4d30f176 WD |
688 | out_of_memory("glob_match"); |
689 | } | |
690 | } | |
691 | ||
692 | /* This routine performs wild-card expansion of the pathname in "arg". Any | |
91f625ce WD |
693 | * daemon-excluded files/dirs will not be matched by the wildcards. Returns 0 |
694 | * if a wild-card string is the only returned item (due to matching nothing). */ | |
695 | int glob_expand(const char *arg, char ***argv_p, int *argc_p, int *maxargs_p) | |
4d30f176 | 696 | { |
91f625ce | 697 | int ret, save_argc; |
4d30f176 | 698 | char *s; |
987a5467 WD |
699 | |
700 | if (!arg) { | |
701 | if (glob.filt_buf) | |
702 | free(glob.filt_buf); | |
703 | free(glob.arg_buf); | |
704 | memset(&glob, 0, sizeof glob); | |
91f625ce | 705 | return -1; |
987a5467 | 706 | } |
e42c9458 | 707 | |
4135d091 | 708 | if (sanitize_paths) |
4d30f176 | 709 | s = sanitize_path(NULL, arg, "", 0, SP_KEEP_DOT_DIRS); |
d48810ba | 710 | else { |
4d30f176 | 711 | s = strdup(arg); |
d48810ba WD |
712 | if (!s) |
713 | out_of_memory("glob_expand"); | |
714 | clean_fname(s, CFN_KEEP_DOT_DIRS | |
715 | | CFN_KEEP_TRAILING_SLASH | |
716 | | CFN_COLLAPSE_DOT_DOT_DIRS); | |
717 | } | |
087bf010 | 718 | |
bc267e0f | 719 | ENSURE_MEMSPACE(glob.arg_buf, char, glob.absize, MAXPATHLEN); |
987a5467 | 720 | *glob.arg_buf = '\0'; |
4d30f176 | 721 | |
987a5467 WD |
722 | glob.argc = save_argc = *argc_p; |
723 | glob.argv = *argv_p; | |
724 | glob.maxargs = *maxargs_p; | |
4d30f176 | 725 | |
bc267e0f | 726 | ENSURE_MEMSPACE(glob.argv, char *, glob.maxargs, 100); |
4d30f176 WD |
727 | |
728 | glob_match(s, 0, -1); | |
729 | ||
730 | /* The arg didn't match anything, so add the failed arg to the list. */ | |
987a5467 WD |
731 | if (glob.argc == save_argc) { |
732 | ENSURE_MEMSPACE(glob.argv, char *, glob.maxargs, glob.argc + 1); | |
733 | glob.argv[glob.argc++] = s; | |
91f625ce WD |
734 | ret = 0; |
735 | } else { | |
4d30f176 | 736 | free(s); |
91f625ce WD |
737 | ret = 1; |
738 | } | |
4d30f176 | 739 | |
987a5467 WD |
740 | *maxargs_p = glob.maxargs; |
741 | *argv_p = glob.argv; | |
742 | *argc_p = glob.argc; | |
91f625ce WD |
743 | |
744 | return ret; | |
874895d5 | 745 | } |
5a96ee05 | 746 | |
4791825d | 747 | /* This routine is only used in daemon mode. */ |
4d30f176 | 748 | void glob_expand_module(char *base1, char *arg, char ***argv_p, int *argc_p, int *maxargs_p) |
087bf010 | 749 | { |
044dc293 | 750 | char *p, *s; |
ba5e128d | 751 | char *base = base1; |
4791825d | 752 | int base_len = strlen(base); |
087bf010 | 753 | |
044dc293 | 754 | if (!arg || !*arg) |
b5bd5542 | 755 | return; |
087bf010 | 756 | |
044dc293 WD |
757 | if (strncmp(arg, base, base_len) == 0) |
758 | arg += base_len; | |
e42c9458 | 759 | |
044dc293 WD |
760 | if (!(arg = strdup(arg))) |
761 | out_of_memory("glob_expand_module"); | |
087bf010 | 762 | |
b5bd5542 | 763 | if (asprintf(&base," %s/", base1) <= 0) |
044dc293 | 764 | out_of_memory("glob_expand_module"); |
4791825d | 765 | base_len++; |
ba5e128d | 766 | |
044dc293 WD |
767 | for (s = arg; *s; s = p + base_len) { |
768 | if ((p = strstr(s, base)) != NULL) | |
b5bd5542 | 769 | *p = '\0'; /* split it at this point */ |
4d30f176 | 770 | glob_expand(s, argv_p, argc_p, maxargs_p); |
b5bd5542 WD |
771 | if (!p) |
772 | break; | |
087bf010 AT |
773 | } |
774 | ||
044dc293 | 775 | free(arg); |
ba5e128d | 776 | free(base); |
087bf010 | 777 | } |
5a96ee05 | 778 | |
ac13ad10 MP |
779 | /** |
780 | * Convert a string to lower case | |
781 | **/ | |
5a96ee05 AT |
782 | void strlower(char *s) |
783 | { | |
784 | while (*s) { | |
2dc7b8bd WD |
785 | if (isUpper(s)) |
786 | *s = toLower(s); | |
5a96ee05 AT |
787 | s++; |
788 | } | |
789 | } | |
e42c9458 | 790 | |
368ad70e WD |
791 | /* Join strings p1 & p2 into "dest" with a guaranteed '/' between them. (If |
792 | * p1 ends with a '/', no extra '/' is inserted.) Returns the length of both | |
a8f7e4b8 WD |
793 | * strings + 1 (if '/' was inserted), regardless of whether the null-terminated |
794 | * string fits into destsize. */ | |
368ad70e WD |
795 | size_t pathjoin(char *dest, size_t destsize, const char *p1, const char *p2) |
796 | { | |
797 | size_t len = strlcpy(dest, p1, destsize); | |
798 | if (len < destsize - 1) { | |
799 | if (!len || dest[len-1] != '/') | |
800 | dest[len++] = '/'; | |
801 | if (len < destsize - 1) | |
802 | len += strlcpy(dest + len, p2, destsize - len); | |
803 | else { | |
804 | dest[len] = '\0'; | |
805 | len += strlen(p2); | |
806 | } | |
807 | } | |
808 | else | |
809 | len += strlen(p2) + 1; /* Assume we'd insert a '/'. */ | |
810 | return len; | |
811 | } | |
812 | ||
813 | /* Join any number of strings together, putting them in "dest". The return | |
a8f7e4b8 WD |
814 | * value is the length of all the strings, regardless of whether the null- |
815 | * terminated whole fits in destsize. Your list of string pointers must end | |
816 | * with a NULL to indicate the end of the list. */ | |
368ad70e WD |
817 | size_t stringjoin(char *dest, size_t destsize, ...) |
818 | { | |
5cb37436 | 819 | va_list ap; |
368ad70e WD |
820 | size_t len, ret = 0; |
821 | const char *src; | |
822 | ||
823 | va_start(ap, destsize); | |
824 | while (1) { | |
825 | if (!(src = va_arg(ap, const char *))) | |
826 | break; | |
827 | len = strlen(src); | |
828 | ret += len; | |
829 | if (destsize > 1) { | |
830 | if (len >= destsize) | |
831 | len = destsize - 1; | |
832 | memcpy(dest, src, len); | |
833 | destsize -= len; | |
834 | dest += len; | |
835 | } | |
836 | } | |
837 | *dest = '\0'; | |
838 | va_end(ap); | |
839 | ||
840 | return ret; | |
841 | } | |
842 | ||
1d6b8f9a WD |
843 | int count_dir_elements(const char *p) |
844 | { | |
845 | int cnt = 0, new_component = 1; | |
846 | while (*p) { | |
847 | if (*p++ == '/') | |
a8167c66 | 848 | new_component = (*p != '.' || (p[1] != '/' && p[1] != '\0')); |
1d6b8f9a WD |
849 | else if (new_component) { |
850 | new_component = 0; | |
851 | cnt++; | |
852 | } | |
853 | } | |
854 | return cnt; | |
855 | } | |
856 | ||
3795dafd WD |
857 | /* Turns multiple adjacent slashes into a single slash (possible exception: |
858 | * the preserving of two leading slashes at the start), drops all leading or | |
d48810ba WD |
859 | * interior "." elements unless CFN_KEEP_DOT_DIRS is flagged. Will also drop |
860 | * a trailing '.' after a '/' if CFN_DROP_TRAILING_DOT_DIR is flagged, removes | |
861 | * a trailing slash (perhaps after removing the aforementioned dot) unless | |
862 | * CFN_KEEP_TRAILING_SLASH is flagged, and will also collapse ".." elements | |
863 | * (except at the start) if CFN_COLLAPSE_DOT_DOT_DIRS is flagged. If the | |
864 | * resulting name would be empty, returns ".". */ | |
6bb82fe0 | 865 | unsigned int clean_fname(char *name, int flags) |
5243c216 | 866 | { |
e012b94f | 867 | char *limit = name - 1, *t = name, *f = name; |
ebdd24d6 | 868 | int anchored; |
5243c216 | 869 | |
b5bd5542 | 870 | if (!name) |
3104620c | 871 | return 0; |
5243c216 | 872 | |
3795dafd | 873 | if ((anchored = *f == '/') != 0) { |
ebdd24d6 | 874 | *t++ = *f++; |
3795dafd WD |
875 | #ifdef __CYGWIN__ |
876 | /* If there are exactly 2 slashes at the start, preserve | |
877 | * them. Would break daemon excludes unless the paths are | |
878 | * really treated differently, so used this sparingly. */ | |
879 | if (*f == '/' && f[1] != '/') | |
880 | *t++ = *f++; | |
881 | #endif | |
882 | } else if (flags & CFN_KEEP_DOT_DIRS && *f == '.' && f[1] == '/') { | |
6bb82fe0 WD |
883 | *t++ = *f++; |
884 | *t++ = *f++; | |
885 | } | |
ebdd24d6 WD |
886 | while (*f) { |
887 | /* discard extra slashes */ | |
888 | if (*f == '/') { | |
889 | f++; | |
890 | continue; | |
5243c216 | 891 | } |
ebdd24d6 | 892 | if (*f == '.') { |
6bb82fe0 | 893 | /* discard interior "." dirs */ |
d48810ba | 894 | if (f[1] == '/' && !(flags & CFN_KEEP_DOT_DIRS)) { |
e012b94f | 895 | f += 2; |
ebdd24d6 WD |
896 | continue; |
897 | } | |
6bb82fe0 WD |
898 | if (f[1] == '\0' && flags & CFN_DROP_TRAILING_DOT_DIR) |
899 | break; | |
ebdd24d6 | 900 | /* collapse ".." dirs */ |
6bb82fe0 WD |
901 | if (flags & CFN_COLLAPSE_DOT_DOT_DIRS |
902 | && f[1] == '.' && (f[2] == '/' || !f[2])) { | |
ebdd24d6 WD |
903 | char *s = t - 1; |
904 | if (s == name && anchored) { | |
905 | f += 2; | |
906 | continue; | |
907 | } | |
908 | while (s > limit && *--s != '/') {} | |
e012b94f | 909 | if (s != t - 1 && (s < name || *s == '/')) { |
ebdd24d6 WD |
910 | t = s + 1; |
911 | f += 2; | |
912 | continue; | |
913 | } | |
f55c2dfc | 914 | limit = t + 2; |
5243c216 AT |
915 | } |
916 | } | |
ebdd24d6 | 917 | while (*f && (*t++ = *f++) != '/') {} |
5243c216 | 918 | } |
ebdd24d6 | 919 | |
6bb82fe0 | 920 | if (t > name+anchored && t[-1] == '/' && !(flags & CFN_KEEP_TRAILING_SLASH)) |
ebdd24d6 WD |
921 | t--; |
922 | if (t == name) | |
923 | *t++ = '.'; | |
924 | *t = '\0'; | |
3104620c WD |
925 | |
926 | return t - name; | |
5243c216 AT |
927 | } |
928 | ||
84a63795 WD |
929 | /* Make path appear as if a chroot had occurred. This handles a leading |
930 | * "/" (either removing it or expanding it) and any leading or embedded | |
931 | * ".." components that attempt to escape past the module's top dir. | |
b4235b31 | 932 | * |
1d6b8f9a WD |
933 | * If dest is NULL, a buffer is allocated to hold the result. It is legal |
934 | * to call with the dest and the path (p) pointing to the same buffer, but | |
935 | * rootdir will be ignored to avoid expansion of the string. | |
b4235b31 | 936 | * |
1d6b8f9a | 937 | * The rootdir string contains a value to use in place of a leading slash. |
7c73536c | 938 | * Specify NULL to get the default of "module_dir". |
ac13ad10 | 939 | * |
a8167c66 | 940 | * The depth var is a count of how many '..'s to allow at the start of the |
29bca53f | 941 | * path. |
ac13ad10 | 942 | * |
b92693da | 943 | * We also clean the path in a manner similar to clean_fname() but with a |
0f78b815 | 944 | * few differences: |
b92693da WD |
945 | * |
946 | * Turns multiple adjacent slashes into a single slash, gets rid of "." dir | |
947 | * elements (INCLUDING a trailing dot dir), PRESERVES a trailing slash, and | |
948 | * ALWAYS collapses ".." elements (except for those at the start of the | |
949 | * string up to "depth" deep). If the resulting name would be empty, | |
950 | * change it into a ".". */ | |
d48810ba WD |
951 | char *sanitize_path(char *dest, const char *p, const char *rootdir, int depth, |
952 | int flags) | |
1b8e662a | 953 | { |
29bca53f | 954 | char *start, *sanp; |
d48810ba | 955 | int rlen = 0, drop_dot_dirs = !relative_paths || !(flags & SP_KEEP_DOT_DIRS); |
84a63795 WD |
956 | |
957 | if (dest != p) { | |
958 | int plen = strlen(p); | |
1d6b8f9a WD |
959 | if (*p == '/') { |
960 | if (!rootdir) | |
7c73536c | 961 | rootdir = module_dir; |
1d6b8f9a WD |
962 | rlen = strlen(rootdir); |
963 | depth = 0; | |
84a63795 WD |
964 | p++; |
965 | } | |
966 | if (dest) { | |
967 | if (rlen + plen + 1 >= MAXPATHLEN) | |
968 | return NULL; | |
969 | } else if (!(dest = new_array(char, rlen + plen + 1))) | |
970 | out_of_memory("sanitize_path"); | |
971 | if (rlen) { | |
1d6b8f9a | 972 | memcpy(dest, rootdir, rlen); |
84a63795 WD |
973 | if (rlen > 1) |
974 | dest[rlen++] = '/'; | |
975 | } | |
976 | } | |
cb13abfe | 977 | |
d48810ba WD |
978 | if (drop_dot_dirs) { |
979 | while (*p == '.' && p[1] == '/') | |
980 | p += 2; | |
981 | } | |
982 | ||
84a63795 | 983 | start = sanp = dest + rlen; |
d2f6e192 WD |
984 | /* This loop iterates once per filename component in p, pointing at |
985 | * the start of the name (past any prior slash) for each iteration. */ | |
29bca53f | 986 | while (*p) { |
2d41264e WD |
987 | /* discard leading or extra slashes */ |
988 | if (*p == '/') { | |
989 | p++; | |
990 | continue; | |
991 | } | |
d48810ba WD |
992 | if (drop_dot_dirs) { |
993 | if (*p == '.' && (p[1] == '/' || p[1] == '\0')) { | |
7e43da81 WD |
994 | /* skip "." component */ |
995 | p++; | |
996 | continue; | |
997 | } | |
cb13abfe | 998 | } |
c284f34a | 999 | if (*p == '.' && p[1] == '.' && (p[2] == '/' || p[2] == '\0')) { |
cb13abfe | 1000 | /* ".." component followed by slash or end */ |
8e5f029e WD |
1001 | if (depth <= 0 || sanp != start) { |
1002 | p += 2; | |
1003 | if (sanp != start) { | |
1004 | /* back up sanp one level */ | |
1005 | --sanp; /* now pointing at slash */ | |
d48810ba | 1006 | while (sanp > start && sanp[-1] != '/') |
8e5f029e | 1007 | sanp--; |
b5f9e67d | 1008 | } |
8e5f029e | 1009 | continue; |
1b8e662a | 1010 | } |
8e5f029e WD |
1011 | /* allow depth levels of .. at the beginning */ |
1012 | depth--; | |
1013 | /* move the virtual beginning to leave the .. alone */ | |
1014 | start = sanp + 3; | |
1b8e662a | 1015 | } |
2d41264e WD |
1016 | /* copy one component through next slash */ |
1017 | while (*p && (*sanp++ = *p++) != '/') {} | |
1b8e662a | 1018 | } |
84a63795 | 1019 | if (sanp == dest) { |
b5f9e67d | 1020 | /* ended up with nothing, so put in "." component */ |
44e2e578 | 1021 | *sanp++ = '.'; |
b5f9e67d | 1022 | } |
44e2e578 | 1023 | *sanp = '\0'; |
1b8e662a | 1024 | |
84a63795 | 1025 | return dest; |
14b61c63 | 1026 | } |
5243c216 | 1027 | |
a8167c66 | 1028 | /* Like chdir(), but it keeps track of the current directory (in the |
a16d8f2b | 1029 | * global "curr_dir"), and ensures that the path size doesn't overflow. |
a8167c66 | 1030 | * Also cleans the path using the clean_fname() function. */ |
29a89172 | 1031 | int change_dir(const char *dir, int set_path_only) |
5243c216 | 1032 | { |
5243c216 | 1033 | static int initialised; |
4af8fe4e | 1034 | unsigned int len; |
5243c216 AT |
1035 | |
1036 | if (!initialised) { | |
1037 | initialised = 1; | |
94112924 WD |
1038 | if (getcwd(curr_dir, sizeof curr_dir - 1) == NULL) { |
1039 | rsyserr(FERROR, errno, "getcwd()"); | |
1040 | exit_cleanup(RERR_FILESELECT); | |
1041 | } | |
4af8fe4e | 1042 | curr_dir_len = strlen(curr_dir); |
5243c216 AT |
1043 | } |
1044 | ||
4af8fe4e WD |
1045 | if (!dir) /* this call was probably just to initialize */ |
1046 | return 0; | |
c226b7c2 | 1047 | |
4af8fe4e WD |
1048 | len = strlen(dir); |
1049 | if (len == 1 && *dir == '.') | |
1050 | return 1; | |
5243c216 | 1051 | |
5243c216 | 1052 | if (*dir == '/') { |
29a89172 WD |
1053 | if (len >= sizeof curr_dir) { |
1054 | errno = ENAMETOOLONG; | |
1055 | return 0; | |
1056 | } | |
1057 | if (!set_path_only && chdir(dir)) | |
1058 | return 0; | |
4af8fe4e | 1059 | memcpy(curr_dir, dir, len + 1); |
4af8fe4e | 1060 | } else { |
29a89172 WD |
1061 | if (curr_dir_len + 1 + len >= sizeof curr_dir) { |
1062 | errno = ENAMETOOLONG; | |
1063 | return 0; | |
1064 | } | |
1065 | curr_dir[curr_dir_len] = '/'; | |
1066 | memcpy(curr_dir + curr_dir_len + 1, dir, len + 1); | |
1067 | ||
1068 | if (!set_path_only && chdir(curr_dir)) { | |
1069 | curr_dir[curr_dir_len] = '\0'; | |
1070 | return 0; | |
1071 | } | |
5243c216 AT |
1072 | } |
1073 | ||
6bb82fe0 | 1074 | curr_dir_len = clean_fname(curr_dir, CFN_COLLAPSE_DOT_DOT_DIRS); |
a8167c66 WD |
1075 | if (sanitize_paths) { |
1076 | if (module_dirlen > curr_dir_len) | |
1077 | module_dirlen = curr_dir_len; | |
1078 | curr_dir_depth = count_dir_elements(curr_dir + module_dirlen); | |
1079 | } | |
5243c216 | 1080 | |
951e826b | 1081 | if (DEBUG_GTE(CHDIR, 1) && !set_path_only) |
29a89172 | 1082 | rprintf(FINFO, "[%s] change_dir(%s)\n", who_am_i(), curr_dir); |
beef86d0 | 1083 | |
4af8fe4e | 1084 | return 1; |
5243c216 | 1085 | } |
aa9b77a5 | 1086 | |
26e21efc WD |
1087 | /* This will make a relative path absolute and clean it up via clean_fname(). |
1088 | * Returns the string, which might be newly allocated, or NULL on error. */ | |
1089 | char *normalize_path(char *path, BOOL force_newbuf, unsigned int *len_ptr) | |
1090 | { | |
1091 | unsigned int len; | |
1092 | ||
1093 | if (*path != '/') { /* Make path absolute. */ | |
1094 | int len = strlen(path); | |
1095 | if (curr_dir_len + 1 + len >= sizeof curr_dir) | |
1096 | return NULL; | |
1097 | curr_dir[curr_dir_len] = '/'; | |
1098 | memcpy(curr_dir + curr_dir_len + 1, path, len + 1); | |
1099 | if (!(path = strdup(curr_dir))) | |
1100 | out_of_memory("normalize_path"); | |
1101 | curr_dir[curr_dir_len] = '\0'; | |
1102 | } else if (force_newbuf) { | |
1103 | if (!(path = strdup(path))) | |
1104 | out_of_memory("normalize_path"); | |
1105 | } | |
1106 | ||
1107 | len = clean_fname(path, CFN_COLLAPSE_DOT_DOT_DIRS | CFN_DROP_TRAILING_DOT_DIR); | |
1108 | ||
1109 | if (len_ptr) | |
1110 | *len_ptr = len; | |
1111 | ||
1112 | return path; | |
1113 | } | |
1114 | ||
eb61be19 WD |
1115 | /** |
1116 | * Return a quoted string with the full pathname of the indicated filename. | |
1117 | * The string " (in MODNAME)" may also be appended. The returned pointer | |
1118 | * remains valid until the next time full_fname() is called. | |
1119 | **/ | |
9a5ade18 | 1120 | char *full_fname(const char *fn) |
eb61be19 | 1121 | { |
eb61be19 WD |
1122 | static char *result = NULL; |
1123 | char *m1, *m2, *m3; | |
1124 | char *p1, *p2; | |
1125 | ||
1126 | if (result) | |
1127 | free(result); | |
1128 | ||
1129 | if (*fn == '/') | |
1130 | p1 = p2 = ""; | |
1131 | else { | |
4cff5fa4 | 1132 | p1 = curr_dir + module_dirlen; |
bc83274a WD |
1133 | for (p2 = p1; *p2 == '/'; p2++) {} |
1134 | if (*p2) | |
1135 | p2 = "/"; | |
eb61be19 WD |
1136 | } |
1137 | if (module_id >= 0) { | |
1138 | m1 = " (in "; | |
1139 | m2 = lp_name(module_id); | |
1140 | m3 = ")"; | |
eb61be19 WD |
1141 | } else |
1142 | m1 = m2 = m3 = ""; | |
1143 | ||
c98ad3df WD |
1144 | if (asprintf(&result, "\"%s%s%s\"%s%s%s", p1, p2, fn, m1, m2, m3) <= 0) |
1145 | out_of_memory("full_fname"); | |
eb61be19 WD |
1146 | |
1147 | return result; | |
1148 | } | |
1149 | ||
a7260c40 WD |
1150 | static char partial_fname[MAXPATHLEN]; |
1151 | ||
1152 | char *partial_dir_fname(const char *fname) | |
1153 | { | |
1154 | char *t = partial_fname; | |
1155 | int sz = sizeof partial_fname; | |
1156 | const char *fn; | |
1157 | ||
1158 | if ((fn = strrchr(fname, '/')) != NULL) { | |
1159 | fn++; | |
1160 | if (*partial_dir != '/') { | |
1161 | int len = fn - fname; | |
1162 | strncpy(t, fname, len); /* safe */ | |
1163 | t += len; | |
1164 | sz -= len; | |
1165 | } | |
1166 | } else | |
1167 | fn = fname; | |
1168 | if ((int)pathjoin(t, sz, partial_dir, fn) >= sz) | |
1169 | return NULL; | |
819bfe45 | 1170 | if (daemon_filter_list.head) { |
89363676 WD |
1171 | t = strrchr(partial_fname, '/'); |
1172 | *t = '\0'; | |
1df02d13 | 1173 | if (check_filter(&daemon_filter_list, FLOG, partial_fname, 1) < 0) |
5aa7b20a | 1174 | return NULL; |
89363676 | 1175 | *t = '/'; |
1df02d13 | 1176 | if (check_filter(&daemon_filter_list, FLOG, partial_fname, 0) < 0) |
5aa7b20a WD |
1177 | return NULL; |
1178 | } | |
a7260c40 WD |
1179 | |
1180 | return partial_fname; | |
1181 | } | |
1182 | ||
1183 | /* If no --partial-dir option was specified, we don't need to do anything | |
1184 | * (the partial-dir is essentially '.'), so just return success. */ | |
1185 | int handle_partial_dir(const char *fname, int create) | |
1186 | { | |
1187 | char *fn, *dir; | |
1188 | ||
1189 | if (fname != partial_fname) | |
1190 | return 1; | |
1191 | if (!create && *partial_dir == '/') | |
1192 | return 1; | |
1193 | if (!(fn = strrchr(partial_fname, '/'))) | |
1194 | return 1; | |
1195 | ||
1196 | *fn = '\0'; | |
1197 | dir = partial_fname; | |
1198 | if (create) { | |
1199 | STRUCT_STAT st; | |
a7260c40 | 1200 | int statret = do_lstat(dir, &st); |
a7260c40 | 1201 | if (statret == 0 && !S_ISDIR(st.st_mode)) { |
0479eb76 WD |
1202 | if (do_unlink(dir) < 0) { |
1203 | *fn = '/'; | |
a7260c40 | 1204 | return 0; |
0479eb76 | 1205 | } |
a7260c40 WD |
1206 | statret = -1; |
1207 | } | |
0479eb76 WD |
1208 | if (statret < 0 && do_mkdir(dir, 0700) < 0) { |
1209 | *fn = '/'; | |
a7260c40 | 1210 | return 0; |
0479eb76 | 1211 | } |
a7260c40 WD |
1212 | } else |
1213 | do_rmdir(dir); | |
1214 | *fn = '/'; | |
1215 | ||
1216 | return 1; | |
1217 | } | |
1218 | ||
b4d30300 | 1219 | /* Determine if a symlink points outside the current directory tree. |
036e70b0 MP |
1220 | * This is considered "unsafe" because e.g. when mirroring somebody |
1221 | * else's machine it might allow them to establish a symlink to | |
1222 | * /etc/passwd, and then read it through a web server. | |
1223 | * | |
b4d30300 WD |
1224 | * Returns 1 if unsafe, 0 if safe. |
1225 | * | |
4e5db0ad MP |
1226 | * Null symlinks and absolute symlinks are always unsafe. |
1227 | * | |
1228 | * Basically here we are concerned with symlinks whose target contains | |
1229 | * "..", because this might cause us to walk back up out of the | |
1230 | * transferred directory. We are not allowed to go back up and | |
1231 | * reenter. | |
1232 | * | |
b4d30300 | 1233 | * "dest" is the target of the symlink in question. |
036e70b0 | 1234 | * |
b4d30300 WD |
1235 | * "src" is the top source directory currently applicable at the level |
1236 | * of the referenced symlink. This is usually the symlink's full path | |
1237 | * (including its name), as referenced from the root of the transfer. */ | |
7afa3a4a | 1238 | int unsafe_symlink(const char *dest, const char *src) |
4b957c22 | 1239 | { |
7afa3a4a | 1240 | const char *name, *slash; |
4b957c22 AT |
1241 | int depth = 0; |
1242 | ||
1243 | /* all absolute and null symlinks are unsafe */ | |
b5bd5542 WD |
1244 | if (!dest || !*dest || *dest == '/') |
1245 | return 1; | |
4b957c22 AT |
1246 | |
1247 | /* find out what our safety margin is */ | |
7afa3a4a | 1248 | for (name = src; (slash = strchr(name, '/')) != 0; name = slash+1) { |
b4d30300 WD |
1249 | /* ".." segment starts the count over. "." segment is ignored. */ |
1250 | if (*name == '.' && (name[1] == '/' || (name[1] == '.' && name[2] == '/'))) { | |
1251 | if (name[1] == '.') | |
1252 | depth = 0; | |
1253 | } else | |
4b957c22 | 1254 | depth++; |
b4d30300 | 1255 | while (slash[1] == '/') slash++; /* just in case src isn't clean */ |
4b957c22 | 1256 | } |
b4d30300 | 1257 | if (*name == '.' && name[1] == '.' && name[2] == '\0') |
7afa3a4a | 1258 | depth = 0; |
4b957c22 | 1259 | |
7afa3a4a | 1260 | for (name = dest; (slash = strchr(name, '/')) != 0; name = slash+1) { |
b4d30300 WD |
1261 | if (*name == '.' && (name[1] == '/' || (name[1] == '.' && name[2] == '/'))) { |
1262 | if (name[1] == '.') { | |
1263 | /* if at any point we go outside the current directory | |
1264 | then stop - it is unsafe */ | |
1265 | if (--depth < 0) | |
1266 | return 1; | |
1267 | } | |
1268 | } else | |
4b957c22 | 1269 | depth++; |
b4d30300 | 1270 | while (slash[1] == '/') slash++; |
4b957c22 | 1271 | } |
b4d30300 | 1272 | if (*name == '.' && name[1] == '.' && name[2] == '\0') |
7afa3a4a | 1273 | depth--; |
4b957c22 | 1274 | |
b4d30300 | 1275 | return depth < 0; |
4b957c22 | 1276 | } |
375a4556 | 1277 | |
4a19c3b2 | 1278 | /* Return the date and time as a string. Some callers tweak returned buf. */ |
f7632fc6 AT |
1279 | char *timestring(time_t t) |
1280 | { | |
1281 | static char TimeBuf[200]; | |
1282 | struct tm *tm = localtime(&t); | |
afa73c75 | 1283 | char *p; |
f7632fc6 | 1284 | |
4f5b0756 | 1285 | #ifdef HAVE_STRFTIME |
5cb37436 | 1286 | strftime(TimeBuf, sizeof TimeBuf - 1, "%Y/%m/%d %H:%M:%S", tm); |
f7632fc6 | 1287 | #else |
5cb37436 | 1288 | strlcpy(TimeBuf, asctime(tm), sizeof TimeBuf); |
f7632fc6 AT |
1289 | #endif |
1290 | ||
afa73c75 WD |
1291 | if ((p = strchr(TimeBuf, '\n')) != NULL) |
1292 | *p = '\0'; | |
f7632fc6 | 1293 | |
afa73c75 | 1294 | return TimeBuf; |
f7632fc6 AT |
1295 | } |
1296 | ||
e1bd49d6 MP |
1297 | /** |
1298 | * Sleep for a specified number of milliseconds. | |
1299 | * | |
1300 | * Always returns TRUE. (In the future it might return FALSE if | |
1301 | * interrupted.) | |
1302 | **/ | |
1303 | int msleep(int t) | |
9ec16c83 | 1304 | { |
c284f34a WD |
1305 | int tdiff = 0; |
1306 | struct timeval tval, t1, t2; | |
9ec16c83 AT |
1307 | |
1308 | gettimeofday(&t1, NULL); | |
5cb37436 | 1309 | |
9ec16c83 AT |
1310 | while (tdiff < t) { |
1311 | tval.tv_sec = (t-tdiff)/1000; | |
1312 | tval.tv_usec = 1000*((t-tdiff)%1000); | |
5cb37436 | 1313 | |
9ec16c83 AT |
1314 | errno = 0; |
1315 | select(0,NULL,NULL, NULL, &tval); | |
1316 | ||
1317 | gettimeofday(&t2, NULL); | |
5cb37436 | 1318 | tdiff = (t2.tv_sec - t1.tv_sec)*1000 + |
9ec16c83 AT |
1319 | (t2.tv_usec - t1.tv_usec)/1000; |
1320 | } | |
e1bd49d6 MP |
1321 | |
1322 | return True; | |
9ec16c83 AT |
1323 | } |
1324 | ||
c2b54076 WD |
1325 | /* Determine if two time_t values are equivalent (either exact, or in |
1326 | * the modification timestamp window established by --modify-window). | |
ac13ad10 MP |
1327 | * |
1328 | * @retval 0 if the times should be treated as the same | |
1329 | * | |
1330 | * @retval +1 if the first is later | |
1331 | * | |
1332 | * @retval -1 if the 2nd is later | |
1333 | **/ | |
c2b54076 | 1334 | int cmp_time(time_t file1, time_t file2) |
5b56cc19 | 1335 | { |
5b56cc19 | 1336 | if (file2 > file1) { |
bc6ebcd2 WD |
1337 | if (file2 - file1 <= modify_window) |
1338 | return 0; | |
5b56cc19 AT |
1339 | return -1; |
1340 | } | |
bc6ebcd2 WD |
1341 | if (file1 - file2 <= modify_window) |
1342 | return 0; | |
5b56cc19 AT |
1343 | return 1; |
1344 | } | |
1345 | ||
1346 | ||
1347 | #ifdef __INSURE__XX | |
0f8f98c8 AT |
1348 | #include <dlfcn.h> |
1349 | ||
ac13ad10 MP |
1350 | /** |
1351 | This routine is a trick to immediately catch errors when debugging | |
1352 | with insure. A xterm with a gdb is popped up when insure catches | |
1353 | a error. It is Linux specific. | |
1354 | **/ | |
0f8f98c8 AT |
1355 | int _Insure_trap_error(int a1, int a2, int a3, int a4, int a5, int a6) |
1356 | { | |
1357 | static int (*fn)(); | |
1358 | int ret; | |
8950ac03 | 1359 | char *cmd; |
0f8f98c8 | 1360 | |
5cb37436 | 1361 | asprintf(&cmd, "/usr/X11R6/bin/xterm -display :0 -T Panic -n Panic -e /bin/sh -c 'cat /tmp/ierrs.*.%d ; gdb /proc/%d/exe %d'", |
0f8f98c8 AT |
1362 | getpid(), getpid(), getpid()); |
1363 | ||
1364 | if (!fn) { | |
1365 | static void *h; | |
1366 | h = dlopen("/usr/local/parasoft/insure++lite/lib.linux2/libinsure.so", RTLD_LAZY); | |
1367 | fn = dlsym(h, "_Insure_trap_error"); | |
1368 | } | |
1369 | ||
1370 | ret = fn(a1, a2, a3, a4, a5, a6); | |
1371 | ||
1372 | system(cmd); | |
1373 | ||
8950ac03 AT |
1374 | free(cmd); |
1375 | ||
0f8f98c8 AT |
1376 | return ret; |
1377 | } | |
1378 | #endif | |
58cadc86 | 1379 | |
58cadc86 WD |
1380 | #define MALLOC_MAX 0x40000000 |
1381 | ||
a2dc4d68 | 1382 | void *_new_array(unsigned long num, unsigned int size, int use_calloc) |
58cadc86 WD |
1383 | { |
1384 | if (num >= MALLOC_MAX/size) | |
1385 | return NULL; | |
a2dc4d68 | 1386 | return use_calloc ? calloc(num, size) : malloc(num * size); |
58cadc86 WD |
1387 | } |
1388 | ||
1fe2a353 | 1389 | void *_realloc_array(void *ptr, unsigned int size, size_t num) |
58cadc86 WD |
1390 | { |
1391 | if (num >= MALLOC_MAX/size) | |
1392 | return NULL; | |
58cadc86 WD |
1393 | if (!ptr) |
1394 | return malloc(size * num); | |
1395 | return realloc(ptr, size * num); | |
1396 | } | |
e64ae6d7 WD |
1397 | |
1398 | /* Take a filename and filename length and return the most significant | |
1399 | * filename suffix we can find. This ignores suffixes such as "~", | |
1400 | * ".bak", ".orig", ".~1~", etc. */ | |
1401 | const char *find_filename_suffix(const char *fn, int fn_len, int *len_ptr) | |
1402 | { | |
1403 | const char *suf, *s; | |
1404 | BOOL had_tilde; | |
1405 | int s_len; | |
1406 | ||
1407 | /* One or more dots at the start aren't a suffix. */ | |
1408 | while (fn_len && *fn == '.') fn++, fn_len--; | |
1409 | ||
1410 | /* Ignore the ~ in a "foo~" filename. */ | |
1411 | if (fn_len > 1 && fn[fn_len-1] == '~') | |
1412 | fn_len--, had_tilde = True; | |
1413 | else | |
1414 | had_tilde = False; | |
1415 | ||
1416 | /* Assume we don't find an suffix. */ | |
1417 | suf = ""; | |
1418 | *len_ptr = 0; | |
1419 | ||
1420 | /* Find the last significant suffix. */ | |
1421 | for (s = fn + fn_len; fn_len > 1; ) { | |
1422 | while (*--s != '.' && s != fn) {} | |
1423 | if (s == fn) | |
1424 | break; | |
1425 | s_len = fn_len - (s - fn); | |
1426 | fn_len = s - fn; | |
6012eaa1 | 1427 | if (s_len == 4) { |
e64ae6d7 WD |
1428 | if (strcmp(s+1, "bak") == 0 |
1429 | || strcmp(s+1, "old") == 0) | |
1430 | continue; | |
6012eaa1 | 1431 | } else if (s_len == 5) { |
e64ae6d7 WD |
1432 | if (strcmp(s+1, "orig") == 0) |
1433 | continue; | |
1434 | } else if (s_len > 2 && had_tilde | |
2dc7b8bd | 1435 | && s[1] == '~' && isDigit(s + 2)) |
e64ae6d7 WD |
1436 | continue; |
1437 | *len_ptr = s_len; | |
1438 | suf = s; | |
1439 | if (s_len == 1) | |
1440 | break; | |
1441 | /* Determine if the suffix is all digits. */ | |
1442 | for (s++, s_len--; s_len > 0; s++, s_len--) { | |
2dc7b8bd | 1443 | if (!isDigit(s)) |
e64ae6d7 WD |
1444 | return suf; |
1445 | } | |
1446 | /* An all-digit suffix may not be that signficant. */ | |
1447 | s = suf; | |
1448 | } | |
1449 | ||
1450 | return suf; | |
1451 | } | |
1452 | ||
1453 | /* This is an implementation of the Levenshtein distance algorithm. It | |
1454 | * was implemented to avoid needing a two-dimensional matrix (to save | |
1455 | * memory). It was also tweaked to try to factor in the ASCII distance | |
1456 | * between changed characters as a minor distance quantity. The normal | |
1457 | * Levenshtein units of distance (each signifying a single change between | |
1458 | * the two strings) are defined as a "UNIT". */ | |
1459 | ||
1460 | #define UNIT (1 << 16) | |
1461 | ||
1462 | uint32 fuzzy_distance(const char *s1, int len1, const char *s2, int len2) | |
1463 | { | |
1464 | uint32 a[MAXPATHLEN], diag, above, left, diag_inc, above_inc, left_inc; | |
1465 | int32 cost; | |
1466 | int i1, i2; | |
1467 | ||
1468 | if (!len1 || !len2) { | |
1469 | if (!len1) { | |
1470 | s1 = s2; | |
1471 | len1 = len2; | |
1472 | } | |
1473 | for (i1 = 0, cost = 0; i1 < len1; i1++) | |
1474 | cost += s1[i1]; | |
1475 | return (int32)len1 * UNIT + cost; | |
1476 | } | |
1477 | ||
1478 | for (i2 = 0; i2 < len2; i2++) | |
1479 | a[i2] = (i2+1) * UNIT; | |
1480 | ||
1481 | for (i1 = 0; i1 < len1; i1++) { | |
1482 | diag = i1 * UNIT; | |
1483 | above = (i1+1) * UNIT; | |
1484 | for (i2 = 0; i2 < len2; i2++) { | |
1485 | left = a[i2]; | |
1486 | if ((cost = *((uchar*)s1+i1) - *((uchar*)s2+i2)) != 0) { | |
1487 | if (cost < 0) | |
1488 | cost = UNIT - cost; | |
1489 | else | |
1490 | cost = UNIT + cost; | |
1491 | } | |
1492 | diag_inc = diag + cost; | |
1493 | left_inc = left + UNIT + *((uchar*)s1+i1); | |
1494 | above_inc = above + UNIT + *((uchar*)s2+i2); | |
1495 | a[i2] = above = left < above | |
1496 | ? (left_inc < diag_inc ? left_inc : diag_inc) | |
1497 | : (above_inc < diag_inc ? above_inc : diag_inc); | |
1498 | diag = left; | |
1499 | } | |
1500 | } | |
1501 | ||
1502 | return a[len2-1]; | |
1503 | } | |
c2b54076 WD |
1504 | |
1505 | #define BB_SLOT_SIZE (16*1024) /* Desired size in bytes */ | |
1506 | #define BB_PER_SLOT_BITS (BB_SLOT_SIZE * 8) /* Number of bits per slot */ | |
1507 | #define BB_PER_SLOT_INTS (BB_SLOT_SIZE / 4) /* Number of int32s per slot */ | |
1508 | ||
1509 | struct bitbag { | |
1510 | uint32 **bits; | |
1511 | int slot_cnt; | |
1512 | }; | |
1513 | ||
1514 | struct bitbag *bitbag_create(int max_ndx) | |
1515 | { | |
1516 | struct bitbag *bb = new(struct bitbag); | |
1517 | bb->slot_cnt = (max_ndx + BB_PER_SLOT_BITS - 1) / BB_PER_SLOT_BITS; | |
1518 | ||
1519 | if (!(bb->bits = (uint32**)calloc(bb->slot_cnt, sizeof (uint32*)))) | |
1520 | out_of_memory("bitbag_create"); | |
1521 | ||
1522 | return bb; | |
1523 | } | |
1524 | ||
1525 | void bitbag_set_bit(struct bitbag *bb, int ndx) | |
1526 | { | |
1527 | int slot = ndx / BB_PER_SLOT_BITS; | |
1528 | ndx %= BB_PER_SLOT_BITS; | |
1529 | ||
1530 | if (!bb->bits[slot]) { | |
1531 | if (!(bb->bits[slot] = (uint32*)calloc(BB_PER_SLOT_INTS, 4))) | |
1532 | out_of_memory("bitbag_set_bit"); | |
1533 | } | |
1534 | ||
1535 | bb->bits[slot][ndx/32] |= 1u << (ndx % 32); | |
1536 | } | |
1537 | ||
1538 | #if 0 /* not needed yet */ | |
1539 | void bitbag_clear_bit(struct bitbag *bb, int ndx) | |
1540 | { | |
1541 | int slot = ndx / BB_PER_SLOT_BITS; | |
1542 | ndx %= BB_PER_SLOT_BITS; | |
1543 | ||
1544 | if (!bb->bits[slot]) | |
1545 | return; | |
1546 | ||
1547 | bb->bits[slot][ndx/32] &= ~(1u << (ndx % 32)); | |
1548 | } | |
1549 | ||
1550 | int bitbag_check_bit(struct bitbag *bb, int ndx) | |
1551 | { | |
1552 | int slot = ndx / BB_PER_SLOT_BITS; | |
1553 | ndx %= BB_PER_SLOT_BITS; | |
1554 | ||
1555 | if (!bb->bits[slot]) | |
1556 | return 0; | |
1557 | ||
1558 | return bb->bits[slot][ndx/32] & (1u << (ndx % 32)) ? 1 : 0; | |
1559 | } | |
1560 | #endif | |
1561 | ||
1562 | /* Call this with -1 to start checking from 0. Returns -1 at the end. */ | |
1563 | int bitbag_next_bit(struct bitbag *bb, int after) | |
1564 | { | |
1565 | uint32 bits, mask; | |
1566 | int i, ndx = after + 1; | |
1567 | int slot = ndx / BB_PER_SLOT_BITS; | |
1568 | ndx %= BB_PER_SLOT_BITS; | |
1569 | ||
1570 | mask = (1u << (ndx % 32)) - 1; | |
1571 | for (i = ndx / 32; slot < bb->slot_cnt; slot++, i = mask = 0) { | |
1572 | if (!bb->bits[slot]) | |
1573 | continue; | |
1574 | for ( ; i < BB_PER_SLOT_INTS; i++, mask = 0) { | |
1575 | if (!(bits = bb->bits[slot][i] & ~mask)) | |
1576 | continue; | |
1577 | /* The xor magic figures out the lowest enabled bit in | |
1578 | * bits, and the switch quickly computes log2(bit). */ | |
1579 | switch (bits ^ (bits & (bits-1))) { | |
1580 | #define LOG2(n) case 1u << n: return slot*BB_PER_SLOT_BITS + i*32 + n | |
1581 | LOG2(0); LOG2(1); LOG2(2); LOG2(3); | |
1582 | LOG2(4); LOG2(5); LOG2(6); LOG2(7); | |
1583 | LOG2(8); LOG2(9); LOG2(10); LOG2(11); | |
1584 | LOG2(12); LOG2(13); LOG2(14); LOG2(15); | |
1585 | LOG2(16); LOG2(17); LOG2(18); LOG2(19); | |
1586 | LOG2(20); LOG2(21); LOG2(22); LOG2(23); | |
1587 | LOG2(24); LOG2(25); LOG2(26); LOG2(27); | |
1588 | LOG2(28); LOG2(29); LOG2(30); LOG2(31); | |
1589 | } | |
1590 | return -1; /* impossible... */ | |
1591 | } | |
1592 | } | |
1593 | ||
1594 | return -1; | |
1595 | } | |
1c3344a1 | 1596 | |
e0c572c5 WD |
1597 | void flist_ndx_push(flist_ndx_list *lp, int ndx) |
1598 | { | |
1599 | struct flist_ndx_item *item; | |
1600 | ||
1601 | if (!(item = new(struct flist_ndx_item))) | |
1602 | out_of_memory("flist_ndx_push"); | |
1603 | item->next = NULL; | |
1604 | item->ndx = ndx; | |
1605 | if (lp->tail) | |
1606 | lp->tail->next = item; | |
1607 | else | |
1608 | lp->head = item; | |
1609 | lp->tail = item; | |
1610 | } | |
1611 | ||
1612 | int flist_ndx_pop(flist_ndx_list *lp) | |
1613 | { | |
1614 | struct flist_ndx_item *next; | |
1615 | int ndx; | |
1616 | ||
1617 | if (!lp->head) | |
1618 | return -1; | |
1619 | ||
1620 | ndx = lp->head->ndx; | |
1621 | next = lp->head->next; | |
1622 | free(lp->head); | |
1623 | lp->head = next; | |
1624 | if (!next) | |
1625 | lp->tail = NULL; | |
1626 | ||
1627 | return ndx; | |
1628 | } | |
1629 | ||
1c3344a1 WD |
1630 | void *expand_item_list(item_list *lp, size_t item_size, |
1631 | const char *desc, int incr) | |
1632 | { | |
1633 | /* First time through, 0 <= 0, so list is expanded. */ | |
1634 | if (lp->malloced <= lp->count) { | |
1635 | void *new_ptr; | |
1636 | size_t new_size = lp->malloced; | |
1637 | if (incr < 0) | |
0b515981 | 1638 | new_size += -incr; /* increase slowly */ |
1c3344a1 WD |
1639 | else if (new_size < (size_t)incr) |
1640 | new_size += incr; | |
1641 | else | |
1642 | new_size *= 2; | |
1fe2a353 WD |
1643 | if (new_size < lp->malloced) |
1644 | overflow_exit("expand_item_list"); | |
1645 | /* Using _realloc_array() lets us pass the size, not a type. */ | |
1646 | new_ptr = _realloc_array(lp->items, item_size, new_size); | |
951e826b | 1647 | if (DEBUG_GTE(FLIST, 3)) { |
6d56efa6 | 1648 | rprintf(FINFO, "[%s] expand %s to %s bytes, did%s move\n", |
adc2476f | 1649 | who_am_i(), desc, big_num(new_size * item_size), |
1c3344a1 WD |
1650 | new_ptr == lp->items ? " not" : ""); |
1651 | } | |
1652 | if (!new_ptr) | |
1653 | out_of_memory("expand_item_list"); | |
1654 | ||
1655 | lp->items = new_ptr; | |
1656 | lp->malloced = new_size; | |
1657 | } | |
1658 | return (char*)lp->items + (lp->count++ * item_size); | |
1659 | } |