Commit | Line | Data |
---|---|---|
1960e228 | 1 | /* -*- c-file-style: "linux" -*- |
0ecfbf27 MP |
2 | * |
3 | * Copyright (C) 1996-2000 by Andrew Tridgell | |
4 | * Copyright (C) Paul Mackerras 1996 | |
5 | * Copyright (C) 2001, 2002 by Martin Pool <mbp@samba.org> | |
6 | * | |
7 | * This program is free software; you can redistribute it and/or modify | |
8 | * it under the terms of the GNU General Public License as published by | |
9 | * the Free Software Foundation; either version 2 of the License, or | |
10 | * (at your option) any later version. | |
11 | * | |
12 | * This program is distributed in the hope that it will be useful, | |
13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | * GNU General Public License for more details. | |
16 | * | |
17 | * You should have received a copy of the GNU General Public License | |
18 | * along with this program; if not, write to the Free Software | |
19 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. | |
20 | */ | |
c627d613 | 21 | |
ac13ad10 | 22 | /** |
0ecfbf27 | 23 | * @file |
ac13ad10 MP |
24 | * |
25 | * Utilities used in rsync | |
26 | **/ | |
c627d613 | 27 | |
c627d613 AT |
28 | #include "rsync.h" |
29 | ||
c7c11a0d DD |
30 | extern int verbose; |
31 | ||
0ecfbf27 MP |
32 | int sanitize_paths = 0; |
33 | ||
34 | ||
f0359dd0 | 35 | |
ac13ad10 | 36 | /** |
0ecfbf27 MP |
37 | * Set a fd into nonblocking mode |
38 | **/ | |
f0359dd0 AT |
39 | void set_nonblocking(int fd) |
40 | { | |
41 | int val; | |
42 | ||
0ecfbf27 | 43 | if ((val = fcntl(fd, F_GETFL, 0)) == -1) |
f0359dd0 AT |
44 | return; |
45 | if (!(val & NONBLOCK_FLAG)) { | |
46 | val |= NONBLOCK_FLAG; | |
47 | fcntl(fd, F_SETFL, val); | |
48 | } | |
49 | } | |
50 | ||
ac13ad10 | 51 | /** |
0ecfbf27 MP |
52 | * Set a fd into blocking mode |
53 | **/ | |
36349ea0 AT |
54 | void set_blocking(int fd) |
55 | { | |
56 | int val; | |
57 | ||
0ecfbf27 | 58 | if ((val = fcntl(fd, F_GETFL, 0)) == -1) |
36349ea0 AT |
59 | return; |
60 | if (val & NONBLOCK_FLAG) { | |
61 | val &= ~NONBLOCK_FLAG; | |
62 | fcntl(fd, F_SETFL, val); | |
63 | } | |
64 | } | |
65 | ||
f0359dd0 | 66 | |
ac13ad10 | 67 | /** |
0ecfbf27 MP |
68 | * Create a file descriptor pair - like pipe() but use socketpair if |
69 | * possible (because of blocking issues on pipes). | |
70 | * | |
71 | * Always set non-blocking. | |
f0359dd0 | 72 | */ |
08f15335 AT |
73 | int fd_pair(int fd[2]) |
74 | { | |
f0359dd0 AT |
75 | int ret; |
76 | ||
08f15335 | 77 | #if HAVE_SOCKETPAIR |
f0359dd0 | 78 | ret = socketpair(AF_UNIX, SOCK_STREAM, 0, fd); |
08f15335 | 79 | #else |
f0359dd0 | 80 | ret = pipe(fd); |
08f15335 | 81 | #endif |
f0359dd0 AT |
82 | |
83 | if (ret == 0) { | |
84 | set_nonblocking(fd[0]); | |
85 | set_nonblocking(fd[1]); | |
86 | } | |
0ecfbf27 | 87 | |
f0359dd0 | 88 | return ret; |
08f15335 AT |
89 | } |
90 | ||
91 | ||
0ecfbf27 | 92 | void print_child_argv(char **cmd) |
5ad0e46f | 93 | { |
1bbd10fe | 94 | rprintf(FINFO, "opening connection using "); |
5ad0e46f MP |
95 | for (; *cmd; cmd++) { |
96 | /* Look for characters that ought to be quoted. This | |
97 | * is not a great quoting algorithm, but it's | |
98 | * sufficient for a log message. */ | |
99 | if (strspn(*cmd, "abcdefghijklmnopqrstuvwxyz" | |
100 | "ABCDEFGHIJKLMNOPQRSTUVWXYZ" | |
101 | "0123456789" | |
102 | ",.-_=+@/") != strlen(*cmd)) { | |
103 | rprintf(FINFO, "\"%s\" ", *cmd); | |
104 | } else { | |
105 | rprintf(FINFO, "%s ", *cmd); | |
106 | } | |
107 | } | |
108 | rprintf(FINFO, "\n"); | |
109 | } | |
110 | ||
111 | ||
c627d613 AT |
112 | void out_of_memory(char *str) |
113 | { | |
9486289c | 114 | rprintf(FERROR,"ERROR: out of memory in %s\n",str); |
65417579 | 115 | exit_cleanup(RERR_MALLOC); |
575f2fca AT |
116 | } |
117 | ||
118 | void overflow(char *str) | |
119 | { | |
9486289c | 120 | rprintf(FERROR,"ERROR: buffer overflow in %s\n",str); |
65417579 | 121 | exit_cleanup(RERR_MALLOC); |
c627d613 AT |
122 | } |
123 | ||
124 | ||
c627d613 | 125 | |
404e813c | 126 | int set_modtime(char *fname, time_t modtime) |
c627d613 | 127 | { |
31e12522 | 128 | extern int dry_run; |
404e813c MP |
129 | if (dry_run) |
130 | return 0; | |
131 | ||
132 | if (verbose > 2) { | |
133 | rprintf(FINFO, "set modtime of %s to (%ld) %s", | |
134 | fname, (long) modtime, | |
135 | asctime(localtime(&modtime))); | |
136 | } | |
137 | ||
31e12522 | 138 | { |
1e9f155a | 139 | #ifdef HAVE_UTIMBUF |
31e12522 AT |
140 | struct utimbuf tbuf; |
141 | tbuf.actime = time(NULL); | |
142 | tbuf.modtime = modtime; | |
143 | return utime(fname,&tbuf); | |
c627d613 | 144 | #elif defined(HAVE_UTIME) |
31e12522 AT |
145 | time_t t[2]; |
146 | t[0] = time(NULL); | |
147 | t[1] = modtime; | |
148 | return utime(fname,t); | |
c627d613 | 149 | #else |
31e12522 AT |
150 | struct timeval t[2]; |
151 | t[0].tv_sec = time(NULL); | |
152 | t[0].tv_usec = 0; | |
153 | t[1].tv_sec = modtime; | |
154 | t[1].tv_usec = 0; | |
155 | return utimes(fname,t); | |
c627d613 | 156 | #endif |
31e12522 | 157 | } |
c627d613 | 158 | } |
94481d91 | 159 | |
720b47f2 | 160 | |
ac13ad10 MP |
161 | /** |
162 | Create any necessary directories in fname. Unfortunately we don't know | |
163 | what perms to give the directory when this is called so we need to rely | |
164 | on the umask | |
165 | **/ | |
0ecfbf27 | 166 | int create_directory_path(char *fname, int base_umask) |
6574b4f7 | 167 | { |
6574b4f7 AT |
168 | char *p; |
169 | ||
170 | while (*fname == '/') fname++; | |
171 | while (strncmp(fname,"./",2)==0) fname += 2; | |
172 | ||
173 | p = fname; | |
174 | while ((p=strchr(p,'/'))) { | |
175 | *p = 0; | |
0ecfbf27 | 176 | do_mkdir(fname, 0777 & ~base_umask); |
6574b4f7 AT |
177 | *p = '/'; |
178 | p++; | |
179 | } | |
180 | return 0; | |
181 | } | |
950ab32d AT |
182 | |
183 | ||
ac13ad10 MP |
184 | /** |
185 | * Write @p len bytes at @p ptr to descriptor @p desc, retrying if | |
186 | * interrupted. | |
187 | * | |
188 | * @retval len upon success | |
189 | * | |
190 | * @retval <0 write's (negative) error code | |
191 | * | |
192 | * Derived from GNU C's cccp.c. | |
193 | */ | |
9dd891bb | 194 | static int full_write(int desc, char *ptr, size_t len) |
950ab32d AT |
195 | { |
196 | int total_written; | |
197 | ||
198 | total_written = 0; | |
199 | while (len > 0) { | |
5c1b7bfd | 200 | int written = write(desc, ptr, len); |
950ab32d | 201 | if (written < 0) { |
950ab32d AT |
202 | if (errno == EINTR) |
203 | continue; | |
950ab32d AT |
204 | return written; |
205 | } | |
206 | total_written += written; | |
207 | ptr += written; | |
208 | len -= written; | |
209 | } | |
210 | return total_written; | |
211 | } | |
212 | ||
950ab32d | 213 | |
ac13ad10 MP |
214 | /** |
215 | * Read @p len bytes at @p ptr from descriptor @p desc, retrying if | |
216 | * interrupted. | |
217 | * | |
218 | * @retval >0 the actual number of bytes read | |
219 | * | |
220 | * @retval 0 for EOF | |
221 | * | |
222 | * @retval <0 for an error. | |
223 | * | |
224 | * Derived from GNU C's cccp.c. */ | |
9dd891bb | 225 | static int safe_read(int desc, char *ptr, size_t len) |
950ab32d AT |
226 | { |
227 | int n_chars; | |
228 | ||
9dd891bb | 229 | if (len == 0) |
950ab32d AT |
230 | return len; |
231 | ||
950ab32d AT |
232 | do { |
233 | n_chars = read(desc, ptr, len); | |
234 | } while (n_chars < 0 && errno == EINTR); | |
950ab32d AT |
235 | |
236 | return n_chars; | |
237 | } | |
238 | ||
239 | ||
ac13ad10 MP |
240 | /** Copy a file. |
241 | * | |
242 | * This is used in conjunction with the --temp-dir option */ | |
950ab32d AT |
243 | int copy_file(char *source, char *dest, mode_t mode) |
244 | { | |
245 | int ifd; | |
246 | int ofd; | |
247 | char buf[1024 * 8]; | |
248 | int len; /* Number of bytes read into `buf'. */ | |
249 | ||
8c9fd200 | 250 | ifd = do_open(source, O_RDONLY, 0); |
950ab32d | 251 | if (ifd == -1) { |
9486289c | 252 | rprintf(FERROR,"open %s: %s\n", |
950ab32d AT |
253 | source,strerror(errno)); |
254 | return -1; | |
255 | } | |
256 | ||
c7c11a0d | 257 | if (robust_unlink(dest) && errno != ENOENT) { |
9486289c | 258 | rprintf(FERROR,"unlink %s: %s\n", |
950ab32d AT |
259 | dest,strerror(errno)); |
260 | return -1; | |
261 | } | |
262 | ||
31e12522 | 263 | ofd = do_open(dest, O_WRONLY | O_CREAT | O_TRUNC | O_EXCL, mode); |
c46ded46 | 264 | if (ofd == -1) { |
9486289c | 265 | rprintf(FERROR,"open %s: %s\n", |
950ab32d AT |
266 | dest,strerror(errno)); |
267 | close(ifd); | |
268 | return -1; | |
269 | } | |
270 | ||
271 | while ((len = safe_read(ifd, buf, sizeof(buf))) > 0) { | |
272 | if (full_write(ofd, buf, len) < 0) { | |
9486289c | 273 | rprintf(FERROR,"write %s: %s\n", |
950ab32d AT |
274 | dest,strerror(errno)); |
275 | close(ifd); | |
276 | close(ofd); | |
277 | return -1; | |
278 | } | |
279 | } | |
280 | ||
281 | close(ifd); | |
282 | close(ofd); | |
283 | ||
284 | if (len < 0) { | |
9486289c | 285 | rprintf(FERROR,"read %s: %s\n", |
950ab32d AT |
286 | source,strerror(errno)); |
287 | return -1; | |
288 | } | |
289 | ||
290 | return 0; | |
291 | } | |
feaa89c4 | 292 | |
c7c11a0d DD |
293 | /* MAX_RENAMES should be 10**MAX_RENAMES_DIGITS */ |
294 | #define MAX_RENAMES_DIGITS 3 | |
295 | #define MAX_RENAMES 1000 | |
296 | ||
ac13ad10 | 297 | /** |
b4235b31 MP |
298 | * Robust unlink: some OS'es (HPUX) refuse to unlink busy files, so |
299 | * rename to <path>/.rsyncNNN instead. | |
300 | * | |
301 | * Note that successive rsync runs will shuffle the filenames around a | |
302 | * bit as long as the file is still busy; this is because this function | |
303 | * does not know if the unlink call is due to a new file coming in, or | |
304 | * --delete trying to remove old .rsyncNNN files, hence it renames it | |
305 | * each time. | |
306 | **/ | |
c7c11a0d DD |
307 | int robust_unlink(char *fname) |
308 | { | |
309 | #ifndef ETXTBSY | |
310 | return do_unlink(fname); | |
311 | #else | |
312 | static int counter = 1; | |
313 | int rc, pos, start; | |
314 | char path[MAXPATHLEN]; | |
315 | ||
316 | rc = do_unlink(fname); | |
317 | if ((rc == 0) || (errno != ETXTBSY)) | |
318 | return rc; | |
319 | ||
320 | strlcpy(path, fname, MAXPATHLEN); | |
321 | ||
322 | pos = strlen(path); | |
323 | while((path[--pos] != '/') && (pos >= 0)) | |
324 | ; | |
325 | ++pos; | |
326 | strlcpy(&path[pos], ".rsync", MAXPATHLEN-pos); | |
327 | pos += sizeof(".rsync")-1; | |
328 | ||
329 | if (pos > (MAXPATHLEN-MAX_RENAMES_DIGITS-1)) { | |
330 | errno = ETXTBSY; | |
331 | return -1; | |
332 | } | |
333 | ||
334 | /* start where the last one left off to reduce chance of clashes */ | |
335 | start = counter; | |
336 | do { | |
337 | sprintf(&path[pos], "%03d", counter); | |
338 | if (++counter >= MAX_RENAMES) | |
339 | counter = 1; | |
340 | } while (((rc = access(path, 0)) == 0) && (counter != start)); | |
341 | ||
4791825d | 342 | if (verbose > 0) { |
c7c11a0d | 343 | rprintf(FINFO,"renaming %s to %s because of text busy\n", |
4791825d WD |
344 | fname, path); |
345 | } | |
c7c11a0d DD |
346 | |
347 | /* maybe we should return rename()'s exit status? Nah. */ | |
348 | if (do_rename(fname, path) != 0) { | |
349 | errno = ETXTBSY; | |
350 | return -1; | |
351 | } | |
352 | return 0; | |
353 | #endif | |
354 | } | |
355 | ||
356 | int robust_rename(char *from, char *to) | |
357 | { | |
358 | #ifndef ETXTBSY | |
359 | return do_rename(from, to); | |
360 | #else | |
361 | int rc = do_rename(from, to); | |
362 | if ((rc == 0) || (errno != ETXTBSY)) | |
363 | return rc; | |
364 | if (robust_unlink(to) != 0) | |
365 | return -1; | |
366 | return do_rename(from, to); | |
367 | #endif | |
feaa89c4 | 368 | } |
3ba62a83 AT |
369 | |
370 | ||
371 | static pid_t all_pids[10]; | |
372 | static int num_pids; | |
373 | ||
4cf64834 | 374 | /** Fork and record the pid of the child. **/ |
3ba62a83 AT |
375 | pid_t do_fork(void) |
376 | { | |
377 | pid_t newpid = fork(); | |
378 | ||
4cf64834 | 379 | if (newpid != 0 && newpid != -1) { |
3ba62a83 AT |
380 | all_pids[num_pids++] = newpid; |
381 | } | |
382 | return newpid; | |
383 | } | |
384 | ||
4cf64834 MP |
385 | /** |
386 | * Kill all children. | |
387 | * | |
388 | * @todo It would be kind of nice to make sure that they are actually | |
389 | * all our children before we kill them, because their pids may have | |
390 | * been recycled by some other process. Perhaps when we wait for a | |
391 | * child, we should remove it from this array. Alternatively we could | |
392 | * perhaps use process groups, but I think that would not work on | |
393 | * ancient Unix versions that don't support them. | |
394 | **/ | |
3ba62a83 AT |
395 | void kill_all(int sig) |
396 | { | |
397 | int i; | |
4cf64834 MP |
398 | |
399 | for (i = 0; i < num_pids; i++) { | |
400 | /* Let's just be a little careful where we | |
401 | * point that gun, hey? See kill(2) for the | |
402 | * magic caused by negative values. */ | |
403 | pid_t p = all_pids[i]; | |
404 | ||
405 | if (p == getpid()) | |
406 | continue; | |
407 | if (p <= 0) | |
408 | continue; | |
409 | ||
410 | kill(p, sig); | |
3ba62a83 AT |
411 | } |
412 | } | |
9486289c | 413 | |
4cf64834 | 414 | |
ac13ad10 | 415 | /** Turn a user name into a uid */ |
8ef4ffd6 AT |
416 | int name_to_uid(char *name, uid_t *uid) |
417 | { | |
418 | struct passwd *pass; | |
419 | if (!name || !*name) return 0; | |
420 | pass = getpwnam(name); | |
421 | if (pass) { | |
422 | *uid = pass->pw_uid; | |
423 | return 1; | |
424 | } | |
425 | return 0; | |
426 | } | |
427 | ||
ac13ad10 | 428 | /** Turn a group name into a gid */ |
8ef4ffd6 AT |
429 | int name_to_gid(char *name, gid_t *gid) |
430 | { | |
431 | struct group *grp; | |
432 | if (!name || !*name) return 0; | |
433 | grp = getgrnam(name); | |
434 | if (grp) { | |
435 | *gid = grp->gr_gid; | |
436 | return 1; | |
437 | } | |
438 | return 0; | |
439 | } | |
440 | ||
ff8b29b8 | 441 | |
ac13ad10 | 442 | /** Lock a byte range in a open file */ |
31593dd6 | 443 | int lock_range(int fd, int offset, int len) |
0c515f17 | 444 | { |
31593dd6 | 445 | struct flock lock; |
0c515f17 | 446 | |
31593dd6 AT |
447 | lock.l_type = F_WRLCK; |
448 | lock.l_whence = SEEK_SET; | |
449 | lock.l_start = offset; | |
450 | lock.l_len = len; | |
451 | lock.l_pid = 0; | |
452 | ||
453 | return fcntl(fd,F_SETLK,&lock) == 0; | |
0c515f17 | 454 | } |
874895d5 | 455 | |
4791825d WD |
456 | static int exclude_server_path(char *arg) |
457 | { | |
458 | char *s; | |
459 | extern struct exclude_struct **server_exclude_list; | |
460 | ||
461 | if (server_exclude_list) { | |
462 | for (s = arg; (s = strchr(s, '/')) != NULL; ) { | |
463 | *s = '\0'; | |
464 | if (check_exclude(server_exclude_list, arg, 1)) { | |
465 | /* We must leave arg truncated! */ | |
466 | return 1; | |
467 | } | |
468 | *s++ = '/'; | |
469 | } | |
470 | } | |
471 | return 0; | |
472 | } | |
874895d5 | 473 | |
cb13abfe | 474 | static void glob_expand_one(char *s, char **argv, int *argc, int maxargs) |
874895d5 | 475 | { |
932be9aa | 476 | #if !(defined(HAVE_GLOB) && defined(HAVE_GLOB_H)) |
e42c9458 | 477 | if (!*s) s = "."; |
4791825d WD |
478 | s = argv[*argc] = strdup(s); |
479 | exclude_server_path(s); | |
874895d5 | 480 | (*argc)++; |
874895d5 | 481 | #else |
cb13abfe | 482 | extern int sanitize_paths; |
874895d5 AT |
483 | glob_t globbuf; |
484 | int i; | |
485 | ||
e42c9458 AT |
486 | if (!*s) s = "."; |
487 | ||
4791825d | 488 | s = argv[*argc] = strdup(s); |
cb13abfe | 489 | if (sanitize_paths) { |
4791825d | 490 | sanitize_path(s, NULL); |
cb13abfe | 491 | } |
087bf010 | 492 | |
874895d5 | 493 | memset(&globbuf, 0, sizeof(globbuf)); |
4791825d WD |
494 | if (!exclude_server_path(s)) |
495 | glob(s, 0, NULL, &globbuf); | |
874895d5 AT |
496 | if (globbuf.gl_pathc == 0) { |
497 | (*argc)++; | |
498 | globfree(&globbuf); | |
499 | return; | |
500 | } | |
a261989c | 501 | for (i=0; i<(maxargs - (*argc)) && i < (int) globbuf.gl_pathc;i++) { |
4791825d | 502 | if (i == 0) free(s); |
874895d5 AT |
503 | argv[(*argc) + i] = strdup(globbuf.gl_pathv[i]); |
504 | if (!argv[(*argc) + i]) out_of_memory("glob_expand"); | |
505 | } | |
506 | globfree(&globbuf); | |
507 | (*argc) += i; | |
508 | #endif | |
509 | } | |
5a96ee05 | 510 | |
4791825d | 511 | /* This routine is only used in daemon mode. */ |
cb13abfe | 512 | void glob_expand(char *base1, char **argv, int *argc, int maxargs) |
087bf010 AT |
513 | { |
514 | char *s = argv[*argc]; | |
515 | char *p, *q; | |
ba5e128d | 516 | char *base = base1; |
4791825d | 517 | int base_len = strlen(base); |
087bf010 AT |
518 | |
519 | if (!s || !*s) return; | |
520 | ||
4791825d WD |
521 | if (strncmp(s, base, base_len) == 0) |
522 | s += base_len; | |
e42c9458 | 523 | |
087bf010 AT |
524 | s = strdup(s); |
525 | if (!s) out_of_memory("glob_expand"); | |
526 | ||
8950ac03 | 527 | if (asprintf(&base," %s/", base1) <= 0) out_of_memory("glob_expand"); |
4791825d | 528 | base_len++; |
ba5e128d | 529 | |
087bf010 AT |
530 | q = s; |
531 | while ((p = strstr(q,base)) && ((*argc) < maxargs)) { | |
ba5e128d AT |
532 | /* split it at this point */ |
533 | *p = 0; | |
cb13abfe | 534 | glob_expand_one(q, argv, argc, maxargs); |
4791825d | 535 | q = p + base_len; |
087bf010 AT |
536 | } |
537 | ||
cb13abfe | 538 | if (*q && (*argc < maxargs)) glob_expand_one(q, argv, argc, maxargs); |
087bf010 AT |
539 | |
540 | free(s); | |
ba5e128d | 541 | free(base); |
087bf010 | 542 | } |
5a96ee05 | 543 | |
ac13ad10 MP |
544 | /** |
545 | * Convert a string to lower case | |
546 | **/ | |
5a96ee05 AT |
547 | void strlower(char *s) |
548 | { | |
549 | while (*s) { | |
32f76175 MP |
550 | if (isupper(* (unsigned char *) s)) |
551 | *s = tolower(* (unsigned char *) s); | |
5a96ee05 AT |
552 | s++; |
553 | } | |
554 | } | |
e42c9458 | 555 | |
368ad70e WD |
556 | /* Join strings p1 & p2 into "dest" with a guaranteed '/' between them. (If |
557 | * p1 ends with a '/', no extra '/' is inserted.) Returns the length of both | |
558 | * strings + 1 (if '/' was inserted), regardless of whether the whole thing | |
559 | * fits into destsize (including the terminating '\0'). */ | |
560 | size_t pathjoin(char *dest, size_t destsize, const char *p1, const char *p2) | |
561 | { | |
562 | size_t len = strlcpy(dest, p1, destsize); | |
563 | if (len < destsize - 1) { | |
564 | if (!len || dest[len-1] != '/') | |
565 | dest[len++] = '/'; | |
566 | if (len < destsize - 1) | |
567 | len += strlcpy(dest + len, p2, destsize - len); | |
568 | else { | |
569 | dest[len] = '\0'; | |
570 | len += strlen(p2); | |
571 | } | |
572 | } | |
573 | else | |
574 | len += strlen(p2) + 1; /* Assume we'd insert a '/'. */ | |
575 | return len; | |
576 | } | |
577 | ||
578 | /* Join any number of strings together, putting them in "dest". The return | |
579 | * value is the length of all the strings, regardless of whether they fit in | |
580 | * destsize (including the terminating '\0'). Your list of string pointers | |
581 | * should end with a NULL to indicate the end of the list. */ | |
582 | size_t stringjoin(char *dest, size_t destsize, ...) | |
583 | { | |
584 | va_list ap; | |
585 | size_t len, ret = 0; | |
586 | const char *src; | |
587 | ||
588 | va_start(ap, destsize); | |
589 | while (1) { | |
590 | if (!(src = va_arg(ap, const char *))) | |
591 | break; | |
592 | len = strlen(src); | |
593 | ret += len; | |
594 | if (destsize > 1) { | |
595 | if (len >= destsize) | |
596 | len = destsize - 1; | |
597 | memcpy(dest, src, len); | |
598 | destsize -= len; | |
599 | dest += len; | |
600 | } | |
601 | } | |
602 | *dest = '\0'; | |
603 | va_end(ap); | |
604 | ||
605 | return ret; | |
606 | } | |
607 | ||
5243c216 AT |
608 | void clean_fname(char *name) |
609 | { | |
610 | char *p; | |
611 | int l; | |
612 | int modified = 1; | |
613 | ||
614 | if (!name) return; | |
615 | ||
616 | while (modified) { | |
617 | modified = 0; | |
618 | ||
619 | if ((p=strstr(name,"/./"))) { | |
620 | modified = 1; | |
621 | while (*p) { | |
622 | p[0] = p[2]; | |
623 | p++; | |
624 | } | |
625 | } | |
626 | ||
627 | if ((p=strstr(name,"//"))) { | |
628 | modified = 1; | |
629 | while (*p) { | |
630 | p[0] = p[1]; | |
631 | p++; | |
632 | } | |
633 | } | |
634 | ||
635 | if (strncmp(p=name,"./",2) == 0) { | |
636 | modified = 1; | |
637 | do { | |
638 | p[0] = p[2]; | |
639 | } while (*p++); | |
640 | } | |
641 | ||
642 | l = strlen(p=name); | |
643 | if (l > 1 && p[l-1] == '/') { | |
644 | modified = 1; | |
645 | p[l-1] = 0; | |
646 | } | |
647 | } | |
648 | } | |
649 | ||
ac13ad10 | 650 | /** |
1b8e662a | 651 | * Make path appear as if a chroot had occurred: |
ac13ad10 | 652 | * |
b4235b31 MP |
653 | * @li 1. remove leading "/" (or replace with "." if at end) |
654 | * | |
655 | * @li 2. remove leading ".." components (except those allowed by @p reldir) | |
656 | * | |
657 | * @li 3. delete any other "<dir>/.." (recursively) | |
ac13ad10 | 658 | * |
79452d46 | 659 | * Can only shrink paths, so sanitizes in place. |
ac13ad10 | 660 | * |
b5f9e67d | 661 | * While we're at it, remove double slashes and "." components like |
b4235b31 | 662 | * clean_fname() does, but DON'T remove a trailing slash because that |
b5f9e67d | 663 | * is sometimes significant on command line arguments. |
ac13ad10 | 664 | * |
b4235b31 | 665 | * If @p reldir is non-null, it is a sanitized directory that the path will be |
79452d46 DD |
666 | * relative to, so allow as many ".." at the beginning of the path as |
667 | * there are components in reldir. This is used for symbolic link targets. | |
668 | * If reldir is non-null and the path began with "/", to be completely like | |
669 | * a chroot we should add in depth levels of ".." at the beginning of the | |
670 | * path, but that would blow the assumption that the path doesn't grow and | |
671 | * it is not likely to end up being a valid symlink anyway, so just do | |
672 | * the normal removal of the leading "/" instead. | |
ac13ad10 | 673 | * |
1b8e662a DD |
674 | * Contributed by Dave Dykstra <dwd@bell-labs.com> |
675 | */ | |
cb13abfe | 676 | void sanitize_path(char *p, char *reldir) |
1b8e662a | 677 | { |
44e2e578 | 678 | char *start, *sanp; |
cb13abfe DD |
679 | int depth = 0; |
680 | int allowdotdot = 0; | |
681 | ||
682 | if (reldir) { | |
683 | depth++; | |
684 | while (*reldir) { | |
685 | if (*reldir++ == '/') { | |
686 | depth++; | |
687 | } | |
688 | } | |
689 | } | |
44e2e578 DD |
690 | start = p; |
691 | sanp = p; | |
b5f9e67d DD |
692 | while (*p == '/') { |
693 | /* remove leading slashes */ | |
694 | p++; | |
695 | } | |
1b8e662a | 696 | while (*p != '\0') { |
b5f9e67d | 697 | /* this loop iterates once per filename component in p. |
44e2e578 | 698 | * both p (and sanp if the original had a slash) should |
b5f9e67d DD |
699 | * always be left pointing after a slash |
700 | */ | |
701 | if ((*p == '.') && ((*(p+1) == '/') || (*(p+1) == '\0'))) { | |
702 | /* skip "." component */ | |
703 | while (*++p == '/') { | |
704 | /* skip following slashes */ | |
705 | ; | |
706 | } | |
cb13abfe DD |
707 | continue; |
708 | } | |
709 | allowdotdot = 0; | |
710 | if ((*p == '.') && (*(p+1) == '.') && | |
4791825d | 711 | ((*(p+2) == '/') || (*(p+2) == '\0'))) { |
cb13abfe DD |
712 | /* ".." component followed by slash or end */ |
713 | if ((depth > 0) && (sanp == start)) { | |
714 | /* allow depth levels of .. at the beginning */ | |
715 | --depth; | |
716 | allowdotdot = 1; | |
717 | } else { | |
718 | p += 2; | |
719 | if (*p == '/') | |
720 | p++; | |
721 | if (sanp != start) { | |
722 | /* back up sanp one level */ | |
723 | --sanp; /* now pointing at slash */ | |
724 | while ((sanp > start) && (*(sanp - 1) != '/')) { | |
725 | /* skip back up to slash */ | |
726 | sanp--; | |
727 | } | |
b5f9e67d | 728 | } |
cb13abfe | 729 | continue; |
1b8e662a | 730 | } |
cb13abfe DD |
731 | } |
732 | while (1) { | |
733 | /* copy one component through next slash */ | |
734 | *sanp++ = *p++; | |
735 | if ((*p == '\0') || (*(p-1) == '/')) { | |
736 | while (*p == '/') { | |
737 | /* skip multiple slashes */ | |
738 | p++; | |
b5f9e67d | 739 | } |
cb13abfe | 740 | break; |
1b8e662a DD |
741 | } |
742 | } | |
cb13abfe DD |
743 | if (allowdotdot) { |
744 | /* move the virtual beginning to leave the .. alone */ | |
745 | start = sanp; | |
746 | } | |
1b8e662a | 747 | } |
cb13abfe | 748 | if ((sanp == start) && !allowdotdot) { |
b5f9e67d | 749 | /* ended up with nothing, so put in "." component */ |
79452d46 DD |
750 | /* |
751 | * note that the !allowdotdot doesn't prevent this from | |
752 | * happening in all allowed ".." situations, but I didn't | |
753 | * think it was worth putting in an extra variable to ensure | |
754 | * it since an extra "." won't hurt in those situations. | |
755 | */ | |
44e2e578 | 756 | *sanp++ = '.'; |
b5f9e67d | 757 | } |
44e2e578 | 758 | *sanp = '\0'; |
1b8e662a DD |
759 | } |
760 | ||
5243c216 | 761 | |
4791825d | 762 | char curr_dir[MAXPATHLEN]; |
4af8fe4e | 763 | unsigned int curr_dir_len; |
5243c216 | 764 | |
4e5db0ad | 765 | /** |
a16d8f2b WD |
766 | * Like chdir(), but it keeps track of the current directory (in the |
767 | * global "curr_dir"), and ensures that the path size doesn't overflow. | |
768 | * Also cleans the path using the clean_fname() function. | |
4e5db0ad | 769 | **/ |
4af8fe4e | 770 | int push_dir(char *dir) |
5243c216 | 771 | { |
5243c216 | 772 | static int initialised; |
4af8fe4e | 773 | unsigned int len; |
5243c216 AT |
774 | |
775 | if (!initialised) { | |
776 | initialised = 1; | |
777 | getcwd(curr_dir, sizeof(curr_dir)-1); | |
4af8fe4e | 778 | curr_dir_len = strlen(curr_dir); |
5243c216 AT |
779 | } |
780 | ||
4af8fe4e WD |
781 | if (!dir) /* this call was probably just to initialize */ |
782 | return 0; | |
c226b7c2 | 783 | |
4af8fe4e WD |
784 | len = strlen(dir); |
785 | if (len == 1 && *dir == '.') | |
786 | return 1; | |
5243c216 | 787 | |
4af8fe4e WD |
788 | if ((*dir == '/' ? len : curr_dir_len + 1 + len) >= sizeof curr_dir) |
789 | return 0; | |
790 | ||
791 | if (chdir(dir)) | |
792 | return 0; | |
5243c216 AT |
793 | |
794 | if (*dir == '/') { | |
4af8fe4e WD |
795 | memcpy(curr_dir, dir, len + 1); |
796 | curr_dir_len = len; | |
797 | } else { | |
798 | curr_dir[curr_dir_len++] = '/'; | |
799 | memcpy(curr_dir + curr_dir_len, dir, len + 1); | |
800 | curr_dir_len += len; | |
5243c216 AT |
801 | } |
802 | ||
803 | clean_fname(curr_dir); | |
804 | ||
4af8fe4e | 805 | return 1; |
5243c216 AT |
806 | } |
807 | ||
a16d8f2b WD |
808 | /** |
809 | * Reverse a push_dir() call. You must pass in an absolute path | |
810 | * that was copied from a prior value of "curr_dir". | |
811 | **/ | |
5243c216 AT |
812 | int pop_dir(char *dir) |
813 | { | |
4af8fe4e WD |
814 | if (chdir(dir)) |
815 | return 0; | |
5243c216 | 816 | |
4af8fe4e WD |
817 | curr_dir_len = strlcpy(curr_dir, dir, sizeof curr_dir); |
818 | if (curr_dir_len >= sizeof curr_dir) | |
819 | curr_dir_len = sizeof curr_dir - 1; | |
5243c216 | 820 | |
4af8fe4e | 821 | return 1; |
5243c216 | 822 | } |
aa9b77a5 | 823 | |
eb61be19 WD |
824 | /** |
825 | * Return a quoted string with the full pathname of the indicated filename. | |
826 | * The string " (in MODNAME)" may also be appended. The returned pointer | |
827 | * remains valid until the next time full_fname() is called. | |
828 | **/ | |
829 | char *full_fname(char *fn) | |
830 | { | |
831 | extern int module_id; | |
832 | static char *result = NULL; | |
833 | char *m1, *m2, *m3; | |
834 | char *p1, *p2; | |
835 | ||
836 | if (result) | |
837 | free(result); | |
838 | ||
839 | if (*fn == '/') | |
840 | p1 = p2 = ""; | |
841 | else { | |
842 | p1 = curr_dir; | |
843 | p2 = "/"; | |
844 | } | |
845 | if (module_id >= 0) { | |
846 | m1 = " (in "; | |
847 | m2 = lp_name(module_id); | |
848 | m3 = ")"; | |
849 | if (*p1) { | |
850 | if (!lp_use_chroot(module_id)) { | |
851 | char *p = lp_path(module_id); | |
852 | if (*p != '/' || p[1]) | |
853 | p1 += strlen(p); | |
854 | } | |
855 | if (!*p1) | |
856 | p2++; | |
857 | else | |
858 | p1++; | |
859 | } | |
860 | else | |
861 | fn++; | |
862 | } else | |
863 | m1 = m2 = m3 = ""; | |
864 | ||
865 | asprintf(&result, "\"%s%s%s\"%s%s%s", p1, p2, fn, m1, m2, m3); | |
866 | ||
867 | return result; | |
868 | } | |
869 | ||
ac13ad10 | 870 | /** We need to supply our own strcmp function for file list comparisons |
aa9b77a5 AT |
871 | to ensure that signed/unsigned usage is consistent between machines. */ |
872 | int u_strcmp(const char *cs1, const char *cs2) | |
873 | { | |
5a788ade AT |
874 | const uchar *s1 = (const uchar *)cs1; |
875 | const uchar *s2 = (const uchar *)cs2; | |
aa9b77a5 AT |
876 | |
877 | while (*s1 && *s2 && (*s1 == *s2)) { | |
878 | s1++; s2++; | |
879 | } | |
880 | ||
881 | return (int)*s1 - (int)*s2; | |
882 | } | |
eb86d661 | 883 | |
4b957c22 | 884 | |
ac13ad10 MP |
885 | |
886 | /** | |
887 | * Determine if a symlink points outside the current directory tree. | |
036e70b0 MP |
888 | * This is considered "unsafe" because e.g. when mirroring somebody |
889 | * else's machine it might allow them to establish a symlink to | |
890 | * /etc/passwd, and then read it through a web server. | |
891 | * | |
4e5db0ad MP |
892 | * Null symlinks and absolute symlinks are always unsafe. |
893 | * | |
894 | * Basically here we are concerned with symlinks whose target contains | |
895 | * "..", because this might cause us to walk back up out of the | |
896 | * transferred directory. We are not allowed to go back up and | |
897 | * reenter. | |
898 | * | |
036e70b0 MP |
899 | * @param dest Target of the symlink in question. |
900 | * | |
25d34a5c | 901 | * @param src Top source directory currently applicable. Basically this |
036e70b0 | 902 | * is the first parameter to rsync in a simple invocation, but it's |
25d34a5c | 903 | * modified by flist.c in slightly complex ways. |
036e70b0 MP |
904 | * |
905 | * @retval True if unsafe | |
906 | * @retval False is unsafe | |
4e5db0ad MP |
907 | * |
908 | * @sa t_unsafe.c | |
ac13ad10 | 909 | **/ |
7afa3a4a | 910 | int unsafe_symlink(const char *dest, const char *src) |
4b957c22 | 911 | { |
7afa3a4a | 912 | const char *name, *slash; |
4b957c22 AT |
913 | int depth = 0; |
914 | ||
915 | /* all absolute and null symlinks are unsafe */ | |
7afa3a4a | 916 | if (!dest || !*dest || *dest == '/') return 1; |
4b957c22 AT |
917 | |
918 | /* find out what our safety margin is */ | |
7afa3a4a WD |
919 | for (name = src; (slash = strchr(name, '/')) != 0; name = slash+1) { |
920 | if (strncmp(name, "../", 3) == 0) { | |
4b957c22 | 921 | depth=0; |
7afa3a4a | 922 | } else if (strncmp(name, "./", 2) == 0) { |
4b957c22 AT |
923 | /* nothing */ |
924 | } else { | |
925 | depth++; | |
926 | } | |
927 | } | |
7afa3a4a WD |
928 | if (strcmp(name, "..") == 0) |
929 | depth = 0; | |
4b957c22 | 930 | |
7afa3a4a WD |
931 | for (name = dest; (slash = strchr(name, '/')) != 0; name = slash+1) { |
932 | if (strncmp(name, "../", 3) == 0) { | |
933 | /* if at any point we go outside the current directory | |
934 | then stop - it is unsafe */ | |
935 | if (--depth < 0) | |
936 | return 1; | |
937 | } else if (strncmp(name, "./", 2) == 0) { | |
4b957c22 AT |
938 | /* nothing */ |
939 | } else { | |
940 | depth++; | |
941 | } | |
4b957c22 | 942 | } |
7afa3a4a WD |
943 | if (strcmp(name, "..") == 0) |
944 | depth--; | |
4b957c22 | 945 | |
4b957c22 AT |
946 | return (depth < 0); |
947 | } | |
375a4556 | 948 | |
f7632fc6 | 949 | |
ac13ad10 | 950 | /** |
b4235b31 MP |
951 | * Return the date and time as a string |
952 | **/ | |
f7632fc6 AT |
953 | char *timestring(time_t t) |
954 | { | |
955 | static char TimeBuf[200]; | |
956 | struct tm *tm = localtime(&t); | |
957 | ||
958 | #ifdef HAVE_STRFTIME | |
959 | strftime(TimeBuf,sizeof(TimeBuf)-1,"%Y/%m/%d %T",tm); | |
960 | #else | |
37f9805d | 961 | strlcpy(TimeBuf, asctime(tm), sizeof(TimeBuf)); |
f7632fc6 AT |
962 | #endif |
963 | ||
964 | if (TimeBuf[strlen(TimeBuf)-1] == '\n') { | |
965 | TimeBuf[strlen(TimeBuf)-1] = 0; | |
966 | } | |
967 | ||
968 | return(TimeBuf); | |
969 | } | |
970 | ||
9ec16c83 | 971 | |
e1bd49d6 MP |
972 | /** |
973 | * Sleep for a specified number of milliseconds. | |
974 | * | |
975 | * Always returns TRUE. (In the future it might return FALSE if | |
976 | * interrupted.) | |
977 | **/ | |
978 | int msleep(int t) | |
9ec16c83 AT |
979 | { |
980 | int tdiff=0; | |
981 | struct timeval tval,t1,t2; | |
982 | ||
983 | gettimeofday(&t1, NULL); | |
984 | gettimeofday(&t2, NULL); | |
985 | ||
986 | while (tdiff < t) { | |
987 | tval.tv_sec = (t-tdiff)/1000; | |
988 | tval.tv_usec = 1000*((t-tdiff)%1000); | |
989 | ||
990 | errno = 0; | |
991 | select(0,NULL,NULL, NULL, &tval); | |
992 | ||
993 | gettimeofday(&t2, NULL); | |
994 | tdiff = (t2.tv_sec - t1.tv_sec)*1000 + | |
995 | (t2.tv_usec - t1.tv_usec)/1000; | |
996 | } | |
e1bd49d6 MP |
997 | |
998 | return True; | |
9ec16c83 AT |
999 | } |
1000 | ||
1001 | ||
ac13ad10 MP |
1002 | /** |
1003 | * Determine if two file modification times are equivalent (either | |
1004 | * exact or in the modification timestamp window established by | |
1005 | * --modify-window). | |
1006 | * | |
1007 | * @retval 0 if the times should be treated as the same | |
1008 | * | |
1009 | * @retval +1 if the first is later | |
1010 | * | |
1011 | * @retval -1 if the 2nd is later | |
1012 | **/ | |
5b56cc19 AT |
1013 | int cmp_modtime(time_t file1, time_t file2) |
1014 | { | |
5b56cc19 AT |
1015 | extern int modify_window; |
1016 | ||
1017 | if (file2 > file1) { | |
1018 | if (file2 - file1 <= modify_window) return 0; | |
1019 | return -1; | |
1020 | } | |
1021 | if (file1 - file2 <= modify_window) return 0; | |
1022 | return 1; | |
1023 | } | |
1024 | ||
1025 | ||
1026 | #ifdef __INSURE__XX | |
0f8f98c8 AT |
1027 | #include <dlfcn.h> |
1028 | ||
ac13ad10 MP |
1029 | /** |
1030 | This routine is a trick to immediately catch errors when debugging | |
1031 | with insure. A xterm with a gdb is popped up when insure catches | |
1032 | a error. It is Linux specific. | |
1033 | **/ | |
0f8f98c8 AT |
1034 | int _Insure_trap_error(int a1, int a2, int a3, int a4, int a5, int a6) |
1035 | { | |
1036 | static int (*fn)(); | |
1037 | int ret; | |
8950ac03 | 1038 | char *cmd; |
0f8f98c8 | 1039 | |
8950ac03 | 1040 | 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 |
1041 | getpid(), getpid(), getpid()); |
1042 | ||
1043 | if (!fn) { | |
1044 | static void *h; | |
1045 | h = dlopen("/usr/local/parasoft/insure++lite/lib.linux2/libinsure.so", RTLD_LAZY); | |
1046 | fn = dlsym(h, "_Insure_trap_error"); | |
1047 | } | |
1048 | ||
1049 | ret = fn(a1, a2, a3, a4, a5, a6); | |
1050 | ||
1051 | system(cmd); | |
1052 | ||
8950ac03 AT |
1053 | free(cmd); |
1054 | ||
0f8f98c8 AT |
1055 | return ret; |
1056 | } | |
1057 | #endif | |
58cadc86 WD |
1058 | |
1059 | ||
1060 | #define MALLOC_MAX 0x40000000 | |
1061 | ||
1062 | void *_new_array(unsigned int size, unsigned long num) | |
1063 | { | |
1064 | if (num >= MALLOC_MAX/size) | |
1065 | return NULL; | |
1066 | return malloc(size * num); | |
1067 | } | |
1068 | ||
1069 | void *_realloc_array(void *ptr, unsigned int size, unsigned long num) | |
1070 | { | |
1071 | if (num >= MALLOC_MAX/size) | |
1072 | return NULL; | |
1073 | /* No realloc should need this, but just in case... */ | |
1074 | if (!ptr) | |
1075 | return malloc(size * num); | |
1076 | return realloc(ptr, size * num); | |
1077 | } |