| 1 | /* |
| 2 | * Socket and pipe I/O utilities used in rsync. |
| 3 | * |
| 4 | * Copyright (C) 1996-2001 Andrew Tridgell |
| 5 | * Copyright (C) 1996 Paul Mackerras |
| 6 | * Copyright (C) 2001, 2002 Martin Pool <mbp@samba.org> |
| 7 | * Copyright (C) 2003-2007 Wayne Davison |
| 8 | * |
| 9 | * This program is free software; you can redistribute it and/or modify |
| 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. |
| 13 | * |
| 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. |
| 18 | * |
| 19 | * You should have received a copy of the GNU General Public License along |
| 20 | * with this program; if not, visit the http://fsf.org website. |
| 21 | */ |
| 22 | |
| 23 | /* Rsync provides its own multiplexing system, which is used to send |
| 24 | * stderr and stdout over a single socket. |
| 25 | * |
| 26 | * For historical reasons this is off during the start of the |
| 27 | * connection, but it's switched on quite early using |
| 28 | * io_start_multiplex_out() and io_start_multiplex_in(). */ |
| 29 | |
| 30 | #include "rsync.h" |
| 31 | #include "ifuncs.h" |
| 32 | |
| 33 | /** If no timeout is specified then use a 60 second select timeout */ |
| 34 | #define SELECT_TIMEOUT 60 |
| 35 | |
| 36 | extern int bwlimit; |
| 37 | extern size_t bwlimit_writemax; |
| 38 | extern int io_timeout; |
| 39 | extern int allowed_lull; |
| 40 | extern int am_server; |
| 41 | extern int am_daemon; |
| 42 | extern int am_sender; |
| 43 | extern int am_generator; |
| 44 | extern int inc_recurse; |
| 45 | extern int io_error; |
| 46 | extern int eol_nulls; |
| 47 | extern int flist_eof; |
| 48 | extern int read_batch; |
| 49 | extern int csum_length; |
| 50 | extern int protect_args; |
| 51 | extern int checksum_seed; |
| 52 | extern int protocol_version; |
| 53 | extern int remove_source_files; |
| 54 | extern int preserve_hard_links; |
| 55 | extern struct stats stats; |
| 56 | extern struct file_list *cur_flist; |
| 57 | #ifdef ICONV_OPTION |
| 58 | extern int filesfrom_convert; |
| 59 | extern iconv_t ic_send, ic_recv; |
| 60 | #endif |
| 61 | |
| 62 | const char phase_unknown[] = "unknown"; |
| 63 | int ignore_timeout = 0; |
| 64 | int batch_fd = -1; |
| 65 | int msgdone_cnt = 0; |
| 66 | |
| 67 | /* Ignore an EOF error if non-zero. See whine_about_eof(). */ |
| 68 | int kluge_around_eof = 0; |
| 69 | |
| 70 | int msg_fd_in = -1; |
| 71 | int msg_fd_out = -1; |
| 72 | int sock_f_in = -1; |
| 73 | int sock_f_out = -1; |
| 74 | |
| 75 | static int iobuf_f_in = -1; |
| 76 | static char *iobuf_in; |
| 77 | static size_t iobuf_in_siz; |
| 78 | static size_t iobuf_in_ndx; |
| 79 | static size_t iobuf_in_remaining; |
| 80 | |
| 81 | static int iobuf_f_out = -1; |
| 82 | static char *iobuf_out; |
| 83 | static int iobuf_out_cnt; |
| 84 | |
| 85 | int flist_forward_from = -1; |
| 86 | |
| 87 | static int io_multiplexing_out; |
| 88 | static int io_multiplexing_in; |
| 89 | static time_t last_io_in; |
| 90 | static time_t last_io_out; |
| 91 | static int no_flush; |
| 92 | |
| 93 | static int write_batch_monitor_in = -1; |
| 94 | static int write_batch_monitor_out = -1; |
| 95 | |
| 96 | static int io_filesfrom_f_in = -1; |
| 97 | static int io_filesfrom_f_out = -1; |
| 98 | static xbuf ff_buf = EMPTY_XBUF; |
| 99 | static char ff_lastchar; |
| 100 | #ifdef ICONV_OPTION |
| 101 | static xbuf iconv_buf = EMPTY_XBUF; |
| 102 | #endif |
| 103 | static int defer_forwarding_messages = 0; |
| 104 | static int select_timeout = SELECT_TIMEOUT; |
| 105 | static int active_filecnt = 0; |
| 106 | static OFF_T active_bytecnt = 0; |
| 107 | |
| 108 | static char int_byte_extra[64] = { |
| 109 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* (00 - 3F)/4 */ |
| 110 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* (40 - 7F)/4 */ |
| 111 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* (80 - BF)/4 */ |
| 112 | 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 5, 6, /* (C0 - FF)/4 */ |
| 113 | }; |
| 114 | |
| 115 | enum festatus { FES_SUCCESS, FES_REDO, FES_NO_SEND }; |
| 116 | |
| 117 | static void readfd(int fd, char *buffer, size_t N); |
| 118 | static void writefd(int fd, const char *buf, size_t len); |
| 119 | static void writefd_unbuffered(int fd, const char *buf, size_t len); |
| 120 | static void mplex_write(int fd, enum msgcode code, const char *buf, size_t len, int convert); |
| 121 | |
| 122 | struct flist_ndx_item { |
| 123 | struct flist_ndx_item *next; |
| 124 | int ndx; |
| 125 | }; |
| 126 | |
| 127 | struct flist_ndx_list { |
| 128 | struct flist_ndx_item *head, *tail; |
| 129 | }; |
| 130 | |
| 131 | static struct flist_ndx_list redo_list, hlink_list; |
| 132 | |
| 133 | struct msg_list_item { |
| 134 | struct msg_list_item *next; |
| 135 | char convert; |
| 136 | char buf[1]; |
| 137 | }; |
| 138 | |
| 139 | struct msg_list { |
| 140 | struct msg_list_item *head, *tail; |
| 141 | }; |
| 142 | |
| 143 | static struct msg_list msg_queue; |
| 144 | |
| 145 | static void flist_ndx_push(struct flist_ndx_list *lp, int ndx) |
| 146 | { |
| 147 | struct flist_ndx_item *item; |
| 148 | |
| 149 | if (!(item = new(struct flist_ndx_item))) |
| 150 | out_of_memory("flist_ndx_push"); |
| 151 | item->next = NULL; |
| 152 | item->ndx = ndx; |
| 153 | if (lp->tail) |
| 154 | lp->tail->next = item; |
| 155 | else |
| 156 | lp->head = item; |
| 157 | lp->tail = item; |
| 158 | } |
| 159 | |
| 160 | static int flist_ndx_pop(struct flist_ndx_list *lp) |
| 161 | { |
| 162 | struct flist_ndx_item *next; |
| 163 | int ndx; |
| 164 | |
| 165 | if (!lp->head) |
| 166 | return -1; |
| 167 | |
| 168 | ndx = lp->head->ndx; |
| 169 | next = lp->head->next; |
| 170 | free(lp->head); |
| 171 | lp->head = next; |
| 172 | if (!next) |
| 173 | lp->tail = NULL; |
| 174 | |
| 175 | return ndx; |
| 176 | } |
| 177 | |
| 178 | static void got_flist_entry_status(enum festatus status, const char *buf) |
| 179 | { |
| 180 | int ndx = IVAL(buf, 0); |
| 181 | struct file_list *flist = flist_for_ndx(ndx); |
| 182 | |
| 183 | assert(flist != NULL); |
| 184 | assert(ndx >= flist->ndx_start); |
| 185 | |
| 186 | if (remove_source_files) { |
| 187 | active_filecnt--; |
| 188 | active_bytecnt -= F_LENGTH(flist->files[ndx - flist->ndx_start]); |
| 189 | } |
| 190 | |
| 191 | if (inc_recurse) |
| 192 | flist->in_progress--; |
| 193 | |
| 194 | switch (status) { |
| 195 | case FES_SUCCESS: |
| 196 | if (remove_source_files) |
| 197 | send_msg(MSG_SUCCESS, buf, 4, 0); |
| 198 | if (preserve_hard_links) { |
| 199 | struct file_struct *file = flist->files[ndx - flist->ndx_start]; |
| 200 | if (F_IS_HLINKED(file)) |
| 201 | flist_ndx_push(&hlink_list, ndx); |
| 202 | } |
| 203 | break; |
| 204 | case FES_REDO: |
| 205 | if (inc_recurse) |
| 206 | flist->to_redo++; |
| 207 | flist_ndx_push(&redo_list, ndx); |
| 208 | break; |
| 209 | case FES_NO_SEND: |
| 210 | break; |
| 211 | } |
| 212 | } |
| 213 | |
| 214 | static void check_timeout(void) |
| 215 | { |
| 216 | time_t t; |
| 217 | |
| 218 | if (!io_timeout || ignore_timeout) |
| 219 | return; |
| 220 | |
| 221 | if (!last_io_in) { |
| 222 | last_io_in = time(NULL); |
| 223 | return; |
| 224 | } |
| 225 | |
| 226 | t = time(NULL); |
| 227 | |
| 228 | if (t - last_io_in >= io_timeout) { |
| 229 | if (!am_server && !am_daemon) { |
| 230 | rprintf(FERROR, "io timeout after %d seconds -- exiting\n", |
| 231 | (int)(t-last_io_in)); |
| 232 | } |
| 233 | exit_cleanup(RERR_TIMEOUT); |
| 234 | } |
| 235 | } |
| 236 | |
| 237 | /* Note the fds used for the main socket (which might really be a pipe |
| 238 | * for a local transfer, but we can ignore that). */ |
| 239 | void io_set_sock_fds(int f_in, int f_out) |
| 240 | { |
| 241 | sock_f_in = f_in; |
| 242 | sock_f_out = f_out; |
| 243 | } |
| 244 | |
| 245 | void set_io_timeout(int secs) |
| 246 | { |
| 247 | io_timeout = secs; |
| 248 | |
| 249 | if (!io_timeout || io_timeout > SELECT_TIMEOUT) |
| 250 | select_timeout = SELECT_TIMEOUT; |
| 251 | else |
| 252 | select_timeout = io_timeout; |
| 253 | |
| 254 | allowed_lull = read_batch ? 0 : (io_timeout + 1) / 2; |
| 255 | } |
| 256 | |
| 257 | /* Setup the fd used to receive MSG_* messages. Only needed during the |
| 258 | * early stages of being a local sender (up through the sending of the |
| 259 | * file list) or when we're the generator (to fetch the messages from |
| 260 | * the receiver). */ |
| 261 | void set_msg_fd_in(int fd) |
| 262 | { |
| 263 | msg_fd_in = fd; |
| 264 | } |
| 265 | |
| 266 | /* Setup the fd used to send our MSG_* messages. Only needed when |
| 267 | * we're the receiver (to send our messages to the generator). */ |
| 268 | void set_msg_fd_out(int fd) |
| 269 | { |
| 270 | msg_fd_out = fd; |
| 271 | set_nonblocking(msg_fd_out); |
| 272 | } |
| 273 | |
| 274 | /* Add a message to the pending MSG_* list. */ |
| 275 | static void msg_list_add(struct msg_list *lst, int code, const char *buf, int len, int convert) |
| 276 | { |
| 277 | struct msg_list_item *m; |
| 278 | int sz = len + 4 + sizeof m[0] - 1; |
| 279 | |
| 280 | if (!(m = (struct msg_list_item *)new_array(char, sz))) |
| 281 | out_of_memory("msg_list_add"); |
| 282 | m->next = NULL; |
| 283 | m->convert = convert; |
| 284 | SIVAL(m->buf, 0, ((code+MPLEX_BASE)<<24) | len); |
| 285 | memcpy(m->buf + 4, buf, len); |
| 286 | if (lst->tail) |
| 287 | lst->tail->next = m; |
| 288 | else |
| 289 | lst->head = m; |
| 290 | lst->tail = m; |
| 291 | } |
| 292 | |
| 293 | static void msg_flush(void) |
| 294 | { |
| 295 | if (am_generator) { |
| 296 | while (msg_queue.head && io_multiplexing_out) { |
| 297 | struct msg_list_item *m = msg_queue.head; |
| 298 | int len = IVAL(m->buf, 0) & 0xFFFFFF; |
| 299 | int tag = *((uchar*)m->buf+3) - MPLEX_BASE; |
| 300 | if (!(msg_queue.head = m->next)) |
| 301 | msg_queue.tail = NULL; |
| 302 | stats.total_written += len + 4; |
| 303 | defer_forwarding_messages++; |
| 304 | mplex_write(sock_f_out, tag, m->buf + 4, len, m->convert); |
| 305 | defer_forwarding_messages--; |
| 306 | free(m); |
| 307 | } |
| 308 | } else { |
| 309 | while (msg_queue.head) { |
| 310 | struct msg_list_item *m = msg_queue.head; |
| 311 | int len = IVAL(m->buf, 0) & 0xFFFFFF; |
| 312 | int tag = *((uchar*)m->buf+3) - MPLEX_BASE; |
| 313 | if (!(msg_queue.head = m->next)) |
| 314 | msg_queue.tail = NULL; |
| 315 | defer_forwarding_messages++; |
| 316 | mplex_write(msg_fd_out, tag, m->buf + 4, len, m->convert); |
| 317 | defer_forwarding_messages--; |
| 318 | free(m); |
| 319 | } |
| 320 | } |
| 321 | } |
| 322 | |
| 323 | /* Read a message from the MSG_* fd and handle it. This is called either |
| 324 | * during the early stages of being a local sender (up through the sending |
| 325 | * of the file list) or when we're the generator (to fetch the messages |
| 326 | * from the receiver). */ |
| 327 | static void read_msg_fd(void) |
| 328 | { |
| 329 | char buf[2048]; |
| 330 | size_t n; |
| 331 | struct file_list *flist; |
| 332 | int fd = msg_fd_in; |
| 333 | int tag, len; |
| 334 | |
| 335 | /* Temporarily disable msg_fd_in. This is needed to avoid looping back |
| 336 | * to this routine from writefd_unbuffered(). */ |
| 337 | no_flush++; |
| 338 | msg_fd_in = -1; |
| 339 | defer_forwarding_messages++; |
| 340 | |
| 341 | readfd(fd, buf, 4); |
| 342 | tag = IVAL(buf, 0); |
| 343 | |
| 344 | len = tag & 0xFFFFFF; |
| 345 | tag = (tag >> 24) - MPLEX_BASE; |
| 346 | |
| 347 | switch (tag) { |
| 348 | case MSG_DONE: |
| 349 | if (len < 0 || len > 1 || !am_generator) { |
| 350 | invalid_msg: |
| 351 | rprintf(FERROR, "invalid message %d:%d [%s%s]\n", |
| 352 | tag, len, who_am_i(), |
| 353 | inc_recurse ? "/inc" : ""); |
| 354 | exit_cleanup(RERR_STREAMIO); |
| 355 | } |
| 356 | if (len) { |
| 357 | readfd(fd, buf, len); |
| 358 | stats.total_read = read_varlong(fd, 3); |
| 359 | } |
| 360 | msgdone_cnt++; |
| 361 | break; |
| 362 | case MSG_REDO: |
| 363 | if (len != 4 || !am_generator) |
| 364 | goto invalid_msg; |
| 365 | readfd(fd, buf, 4); |
| 366 | got_flist_entry_status(FES_REDO, buf); |
| 367 | break; |
| 368 | case MSG_FLIST: |
| 369 | if (len != 4 || !am_generator || !inc_recurse) |
| 370 | goto invalid_msg; |
| 371 | readfd(fd, buf, 4); |
| 372 | /* Read extra file list from receiver. */ |
| 373 | assert(iobuf_in != NULL); |
| 374 | assert(iobuf_f_in == fd); |
| 375 | if (verbose > 3) { |
| 376 | rprintf(FINFO, "[%s] receiving flist for dir %d\n", |
| 377 | who_am_i(), IVAL(buf,0)); |
| 378 | } |
| 379 | flist = recv_file_list(fd); |
| 380 | flist->parent_ndx = IVAL(buf,0); |
| 381 | #ifdef SUPPORT_HARD_LINKS |
| 382 | if (preserve_hard_links) |
| 383 | match_hard_links(flist); |
| 384 | #endif |
| 385 | break; |
| 386 | case MSG_FLIST_EOF: |
| 387 | if (len != 0 || !am_generator || !inc_recurse) |
| 388 | goto invalid_msg; |
| 389 | flist_eof = 1; |
| 390 | break; |
| 391 | case MSG_IO_ERROR: |
| 392 | if (len != 4) |
| 393 | goto invalid_msg; |
| 394 | readfd(fd, buf, len); |
| 395 | io_error |= IVAL(buf, 0); |
| 396 | break; |
| 397 | case MSG_DELETED: |
| 398 | if (len >= (int)sizeof buf || !am_generator) |
| 399 | goto invalid_msg; |
| 400 | readfd(fd, buf, len); |
| 401 | send_msg(MSG_DELETED, buf, len, 1); |
| 402 | break; |
| 403 | case MSG_SUCCESS: |
| 404 | if (len != 4 || !am_generator) |
| 405 | goto invalid_msg; |
| 406 | readfd(fd, buf, 4); |
| 407 | got_flist_entry_status(FES_SUCCESS, buf); |
| 408 | break; |
| 409 | case MSG_NO_SEND: |
| 410 | if (len != 4 || !am_generator) |
| 411 | goto invalid_msg; |
| 412 | readfd(fd, buf, 4); |
| 413 | got_flist_entry_status(FES_NO_SEND, buf); |
| 414 | break; |
| 415 | case MSG_SOCKERR: |
| 416 | case MSG_CLIENT: |
| 417 | if (!am_generator) |
| 418 | goto invalid_msg; |
| 419 | if (tag == MSG_SOCKERR) |
| 420 | io_end_multiplex_out(); |
| 421 | /* FALL THROUGH */ |
| 422 | case MSG_INFO: |
| 423 | case MSG_ERROR: |
| 424 | case MSG_LOG: |
| 425 | while (len) { |
| 426 | n = len; |
| 427 | if (n >= sizeof buf) |
| 428 | n = sizeof buf - 1; |
| 429 | readfd(fd, buf, n); |
| 430 | rwrite((enum logcode)tag, buf, n, !am_generator); |
| 431 | len -= n; |
| 432 | } |
| 433 | break; |
| 434 | default: |
| 435 | rprintf(FERROR, "unknown message %d:%d [%s]\n", |
| 436 | tag, len, who_am_i()); |
| 437 | exit_cleanup(RERR_STREAMIO); |
| 438 | } |
| 439 | |
| 440 | no_flush--; |
| 441 | msg_fd_in = fd; |
| 442 | if (!--defer_forwarding_messages) |
| 443 | msg_flush(); |
| 444 | } |
| 445 | |
| 446 | /* This is used by the generator to limit how many file transfers can |
| 447 | * be active at once when --remove-source-files is specified. Without |
| 448 | * this, sender-side deletions were mostly happening at the end. */ |
| 449 | void increment_active_files(int ndx, int itemizing, enum logcode code) |
| 450 | { |
| 451 | /* TODO: tune these limits? */ |
| 452 | while (active_filecnt >= (active_bytecnt >= 128*1024 ? 10 : 50)) { |
| 453 | check_for_finished_files(itemizing, code, 0); |
| 454 | if (iobuf_out_cnt) |
| 455 | io_flush(NORMAL_FLUSH); |
| 456 | else |
| 457 | read_msg_fd(); |
| 458 | } |
| 459 | |
| 460 | active_filecnt++; |
| 461 | active_bytecnt += F_LENGTH(cur_flist->files[ndx - cur_flist->ndx_start]); |
| 462 | } |
| 463 | |
| 464 | /* Write an message to a multiplexed stream. If this fails, rsync exits. */ |
| 465 | static void mplex_write(int fd, enum msgcode code, const char *buf, size_t len, int convert) |
| 466 | { |
| 467 | char buffer[BIGPATHBUFLEN]; /* Oversized for use by iconv code. */ |
| 468 | size_t n = len; |
| 469 | |
| 470 | SIVAL(buffer, 0, ((MPLEX_BASE + (int)code)<<24) + len); |
| 471 | |
| 472 | #ifdef ICONV_OPTION |
| 473 | if (convert && ic_send == (iconv_t)-1) |
| 474 | #endif |
| 475 | convert = 0; |
| 476 | |
| 477 | if (convert || n > 1024 - 4) /* BIGPATHBUFLEN can handle 1024 bytes */ |
| 478 | n = 0; |
| 479 | else |
| 480 | memcpy(buffer + 4, buf, n); |
| 481 | |
| 482 | writefd_unbuffered(fd, buffer, n+4); |
| 483 | |
| 484 | len -= n; |
| 485 | buf += n; |
| 486 | |
| 487 | #ifdef ICONV_OPTION |
| 488 | if (convert) { |
| 489 | xbuf outbuf, inbuf; |
| 490 | |
| 491 | INIT_CONST_XBUF(outbuf, buffer); |
| 492 | INIT_XBUF(inbuf, (char*)buf, len, -1); |
| 493 | |
| 494 | defer_forwarding_messages++; |
| 495 | do { |
| 496 | iconvbufs(ic_send, &inbuf, &outbuf, |
| 497 | ICB_INCLUDE_BAD | ICB_INCLUDE_INCOMPLETE); |
| 498 | writefd_unbuffered(fd, outbuf.buf, outbuf.len); |
| 499 | } while (inbuf.len); |
| 500 | if (!--defer_forwarding_messages) |
| 501 | msg_flush(); |
| 502 | } else |
| 503 | #endif |
| 504 | if (len) { |
| 505 | defer_forwarding_messages++; |
| 506 | writefd_unbuffered(fd, buf, len); |
| 507 | if (!--defer_forwarding_messages) |
| 508 | msg_flush(); |
| 509 | } |
| 510 | } |
| 511 | |
| 512 | int send_msg(enum msgcode code, const char *buf, int len, int convert) |
| 513 | { |
| 514 | if (msg_fd_out < 0) { |
| 515 | if (!defer_forwarding_messages) |
| 516 | return io_multiplex_write(code, buf, len, convert); |
| 517 | if (!io_multiplexing_out) |
| 518 | return 0; |
| 519 | msg_list_add(&msg_queue, code, buf, len, convert); |
| 520 | return 1; |
| 521 | } |
| 522 | if (flist_forward_from >= 0) |
| 523 | msg_list_add(&msg_queue, code, buf, len, convert); |
| 524 | else |
| 525 | mplex_write(msg_fd_out, code, buf, len, convert); |
| 526 | return 1; |
| 527 | } |
| 528 | |
| 529 | void send_msg_int(enum msgcode code, int num) |
| 530 | { |
| 531 | char numbuf[4]; |
| 532 | SIVAL(numbuf, 0, num); |
| 533 | send_msg(code, numbuf, 4, 0); |
| 534 | } |
| 535 | |
| 536 | void wait_for_receiver(void) |
| 537 | { |
| 538 | if (iobuf_out_cnt) |
| 539 | io_flush(NORMAL_FLUSH); |
| 540 | else |
| 541 | read_msg_fd(); |
| 542 | } |
| 543 | |
| 544 | int get_redo_num(void) |
| 545 | { |
| 546 | return flist_ndx_pop(&redo_list); |
| 547 | } |
| 548 | |
| 549 | int get_hlink_num(void) |
| 550 | { |
| 551 | return flist_ndx_pop(&hlink_list); |
| 552 | } |
| 553 | |
| 554 | /** |
| 555 | * When we're the receiver and we have a local --files-from list of names |
| 556 | * that needs to be sent over the socket to the sender, we have to do two |
| 557 | * things at the same time: send the sender a list of what files we're |
| 558 | * processing and read the incoming file+info list from the sender. We do |
| 559 | * this by augmenting the read_timeout() function to copy this data. It |
| 560 | * uses ff_buf to read a block of data from f_in (when it is ready, since |
| 561 | * it might be a pipe) and then blast it out f_out (when it is ready to |
| 562 | * receive more data). |
| 563 | */ |
| 564 | void io_set_filesfrom_fds(int f_in, int f_out) |
| 565 | { |
| 566 | io_filesfrom_f_in = f_in; |
| 567 | io_filesfrom_f_out = f_out; |
| 568 | alloc_xbuf(&ff_buf, 2048); |
| 569 | #ifdef ICONV_OPTION |
| 570 | if (protect_args) |
| 571 | alloc_xbuf(&iconv_buf, 1024); |
| 572 | #endif |
| 573 | } |
| 574 | |
| 575 | /* It's almost always an error to get an EOF when we're trying to read from the |
| 576 | * network, because the protocol is (for the most part) self-terminating. |
| 577 | * |
| 578 | * There is one case for the receiver when it is at the end of the transfer |
| 579 | * (hanging around reading any keep-alive packets that might come its way): if |
| 580 | * the sender dies before the generator's kill-signal comes through, we can end |
| 581 | * up here needing to loop until the kill-signal arrives. In this situation, |
| 582 | * kluge_around_eof will be < 0. |
| 583 | * |
| 584 | * There is another case for older protocol versions (< 24) where the module |
| 585 | * listing was not terminated, so we must ignore an EOF error in that case and |
| 586 | * exit. In this situation, kluge_around_eof will be > 0. */ |
| 587 | static void whine_about_eof(int fd) |
| 588 | { |
| 589 | if (kluge_around_eof && fd == sock_f_in) { |
| 590 | int i; |
| 591 | if (kluge_around_eof > 0) |
| 592 | exit_cleanup(0); |
| 593 | /* If we're still here after 10 seconds, exit with an error. */ |
| 594 | for (i = 10*1000/20; i--; ) |
| 595 | msleep(20); |
| 596 | } |
| 597 | |
| 598 | rprintf(FERROR, RSYNC_NAME ": connection unexpectedly closed " |
| 599 | "(%.0f bytes received so far) [%s]\n", |
| 600 | (double)stats.total_read, who_am_i()); |
| 601 | |
| 602 | exit_cleanup(RERR_STREAMIO); |
| 603 | } |
| 604 | |
| 605 | /** |
| 606 | * Read from a socket with I/O timeout. return the number of bytes |
| 607 | * read. If no bytes can be read then exit, never return a number <= 0. |
| 608 | * |
| 609 | * TODO: If the remote shell connection fails, then current versions |
| 610 | * actually report an "unexpected EOF" error here. Since it's a |
| 611 | * fairly common mistake to try to use rsh when ssh is required, we |
| 612 | * should trap that: if we fail to read any data at all, we should |
| 613 | * give a better explanation. We can tell whether the connection has |
| 614 | * started by looking e.g. at whether the remote version is known yet. |
| 615 | */ |
| 616 | static int read_timeout(int fd, char *buf, size_t len) |
| 617 | { |
| 618 | int n, cnt = 0; |
| 619 | |
| 620 | io_flush(FULL_FLUSH); |
| 621 | |
| 622 | while (cnt == 0) { |
| 623 | /* until we manage to read *something* */ |
| 624 | fd_set r_fds, w_fds; |
| 625 | struct timeval tv; |
| 626 | int maxfd = fd; |
| 627 | int count; |
| 628 | |
| 629 | FD_ZERO(&r_fds); |
| 630 | FD_ZERO(&w_fds); |
| 631 | FD_SET(fd, &r_fds); |
| 632 | if (io_filesfrom_f_out >= 0) { |
| 633 | int new_fd; |
| 634 | if (ff_buf.len == 0) { |
| 635 | if (io_filesfrom_f_in >= 0) { |
| 636 | FD_SET(io_filesfrom_f_in, &r_fds); |
| 637 | new_fd = io_filesfrom_f_in; |
| 638 | } else { |
| 639 | io_filesfrom_f_out = -1; |
| 640 | new_fd = -1; |
| 641 | } |
| 642 | } else { |
| 643 | FD_SET(io_filesfrom_f_out, &w_fds); |
| 644 | new_fd = io_filesfrom_f_out; |
| 645 | } |
| 646 | if (new_fd > maxfd) |
| 647 | maxfd = new_fd; |
| 648 | } |
| 649 | |
| 650 | tv.tv_sec = select_timeout; |
| 651 | tv.tv_usec = 0; |
| 652 | |
| 653 | errno = 0; |
| 654 | |
| 655 | count = select(maxfd + 1, &r_fds, &w_fds, NULL, &tv); |
| 656 | |
| 657 | if (count <= 0) { |
| 658 | if (errno == EBADF) { |
| 659 | defer_forwarding_messages = 0; |
| 660 | exit_cleanup(RERR_SOCKETIO); |
| 661 | } |
| 662 | check_timeout(); |
| 663 | continue; |
| 664 | } |
| 665 | |
| 666 | if (io_filesfrom_f_out >= 0) { |
| 667 | if (ff_buf.len) { |
| 668 | if (FD_ISSET(io_filesfrom_f_out, &w_fds)) { |
| 669 | int l = write(io_filesfrom_f_out, |
| 670 | ff_buf.buf + ff_buf.pos, |
| 671 | ff_buf.len); |
| 672 | if (l > 0) { |
| 673 | if (!(ff_buf.len -= l)) |
| 674 | ff_buf.pos = 0; |
| 675 | else |
| 676 | ff_buf.pos += l; |
| 677 | } else if (errno != EINTR) { |
| 678 | /* XXX should we complain? */ |
| 679 | io_filesfrom_f_out = -1; |
| 680 | } |
| 681 | } |
| 682 | } else if (io_filesfrom_f_in >= 0) { |
| 683 | if (FD_ISSET(io_filesfrom_f_in, &r_fds)) { |
| 684 | #ifdef ICONV_OPTION |
| 685 | xbuf *ibuf = filesfrom_convert ? &iconv_buf : &ff_buf; |
| 686 | #else |
| 687 | xbuf *ibuf = &ff_buf; |
| 688 | #endif |
| 689 | int l = read(io_filesfrom_f_in, ibuf->buf, ibuf->size); |
| 690 | if (l <= 0) { |
| 691 | if (l == 0 || errno != EINTR) { |
| 692 | /* Send end-of-file marker */ |
| 693 | memcpy(ff_buf.buf, "\0\0", 2); |
| 694 | ff_buf.len = ff_lastchar? 2 : 1; |
| 695 | ff_buf.pos = 0; |
| 696 | io_filesfrom_f_in = -1; |
| 697 | } |
| 698 | } else { |
| 699 | #ifdef ICONV_OPTION |
| 700 | if (filesfrom_convert) { |
| 701 | iconv_buf.pos = 0; |
| 702 | iconv_buf.len = l; |
| 703 | iconvbufs(ic_send, &iconv_buf, &ff_buf, |
| 704 | ICB_EXPAND_OUT|ICB_INCLUDE_BAD|ICB_INCLUDE_INCOMPLETE); |
| 705 | l = ff_buf.len; |
| 706 | } |
| 707 | #endif |
| 708 | if (!eol_nulls) { |
| 709 | char *s = ff_buf.buf + l; |
| 710 | /* Transform CR and/or LF into '\0' */ |
| 711 | while (s-- > ff_buf.buf) { |
| 712 | if (*s == '\n' || *s == '\r') |
| 713 | *s = '\0'; |
| 714 | } |
| 715 | } |
| 716 | if (!ff_lastchar) { |
| 717 | /* Last buf ended with a '\0', so don't |
| 718 | * let this buf start with one. */ |
| 719 | while (l && ff_buf.buf[ff_buf.pos] == '\0') |
| 720 | ff_buf.pos++, l--; |
| 721 | } |
| 722 | if (!l) |
| 723 | ff_buf.pos = 0; |
| 724 | else { |
| 725 | char *f = ff_buf.buf + ff_buf.pos; |
| 726 | char *t = f; |
| 727 | char *eob = f + l; |
| 728 | /* Eliminate any multi-'\0' runs. */ |
| 729 | while (f != eob) { |
| 730 | if (!(*t++ = *f++)) { |
| 731 | while (f != eob && !*f) |
| 732 | f++, l--; |
| 733 | } |
| 734 | } |
| 735 | ff_lastchar = f[-1]; |
| 736 | } |
| 737 | ff_buf.len = l; |
| 738 | } |
| 739 | } |
| 740 | } |
| 741 | } |
| 742 | |
| 743 | if (!FD_ISSET(fd, &r_fds)) |
| 744 | continue; |
| 745 | |
| 746 | n = read(fd, buf, len); |
| 747 | |
| 748 | if (n <= 0) { |
| 749 | if (n == 0) |
| 750 | whine_about_eof(fd); /* Doesn't return. */ |
| 751 | if (errno == EINTR || errno == EWOULDBLOCK |
| 752 | || errno == EAGAIN) |
| 753 | continue; |
| 754 | |
| 755 | /* Don't write errors on a dead socket. */ |
| 756 | if (fd == sock_f_in) { |
| 757 | io_end_multiplex_out(); |
| 758 | rsyserr(FSOCKERR, errno, "read error"); |
| 759 | } else |
| 760 | rsyserr(FERROR, errno, "read error"); |
| 761 | exit_cleanup(RERR_STREAMIO); |
| 762 | } |
| 763 | |
| 764 | buf += n; |
| 765 | len -= n; |
| 766 | cnt += n; |
| 767 | |
| 768 | if (fd == sock_f_in && io_timeout) |
| 769 | last_io_in = time(NULL); |
| 770 | } |
| 771 | |
| 772 | return cnt; |
| 773 | } |
| 774 | |
| 775 | /* Read a line into the "buf" buffer. */ |
| 776 | int read_line(int fd, char *buf, size_t bufsiz, int flags) |
| 777 | { |
| 778 | char ch, *s, *eob; |
| 779 | int cnt; |
| 780 | |
| 781 | #ifdef ICONV_OPTION |
| 782 | if (flags & RL_CONVERT && iconv_buf.size < bufsiz) |
| 783 | realloc_xbuf(&iconv_buf, bufsiz + 1024); |
| 784 | #endif |
| 785 | |
| 786 | start: |
| 787 | #ifdef ICONV_OPTION |
| 788 | s = flags & RL_CONVERT ? iconv_buf.buf : buf; |
| 789 | #else |
| 790 | s = buf; |
| 791 | #endif |
| 792 | eob = s + bufsiz - 1; |
| 793 | while (1) { |
| 794 | cnt = read(fd, &ch, 1); |
| 795 | if (cnt < 0 && (errno == EWOULDBLOCK |
| 796 | || errno == EINTR || errno == EAGAIN)) { |
| 797 | struct timeval tv; |
| 798 | fd_set r_fds, e_fds; |
| 799 | FD_ZERO(&r_fds); |
| 800 | FD_SET(fd, &r_fds); |
| 801 | FD_ZERO(&e_fds); |
| 802 | FD_SET(fd, &e_fds); |
| 803 | tv.tv_sec = select_timeout; |
| 804 | tv.tv_usec = 0; |
| 805 | if (!select(fd+1, &r_fds, NULL, &e_fds, &tv)) |
| 806 | check_timeout(); |
| 807 | /*if (FD_ISSET(fd, &e_fds)) |
| 808 | rprintf(FINFO, "select exception on fd %d\n", fd); */ |
| 809 | continue; |
| 810 | } |
| 811 | if (cnt != 1) |
| 812 | break; |
| 813 | if (flags & RL_EOL_NULLS ? ch == '\0' : (ch == '\r' || ch == '\n')) { |
| 814 | /* Skip empty lines if dumping comments. */ |
| 815 | if (flags & RL_DUMP_COMMENTS && s == buf) |
| 816 | continue; |
| 817 | break; |
| 818 | } |
| 819 | if (s < eob) |
| 820 | *s++ = ch; |
| 821 | } |
| 822 | *s = '\0'; |
| 823 | |
| 824 | if (flags & RL_DUMP_COMMENTS && (*buf == '#' || *buf == ';')) |
| 825 | goto start; |
| 826 | |
| 827 | #ifdef ICONV_OPTION |
| 828 | if (flags & RL_CONVERT) { |
| 829 | xbuf outbuf; |
| 830 | INIT_XBUF(outbuf, buf, 0, bufsiz); |
| 831 | iconv_buf.pos = 0; |
| 832 | iconv_buf.len = s - iconv_buf.buf; |
| 833 | iconvbufs(ic_recv, &iconv_buf, &outbuf, |
| 834 | ICB_INCLUDE_BAD | ICB_INCLUDE_INCOMPLETE); |
| 835 | outbuf.buf[outbuf.len] = '\0'; |
| 836 | return outbuf.len; |
| 837 | } |
| 838 | #endif |
| 839 | |
| 840 | return s - buf; |
| 841 | } |
| 842 | |
| 843 | int read_args(int f_in, char *mod_name, char *buf, size_t bufsiz, int rl_nulls, |
| 844 | char ***argv_p, int *argc_p, char **request_p) |
| 845 | { |
| 846 | int maxargs = MAX_ARGS; |
| 847 | int dot_pos = 0; |
| 848 | int argc = 0; |
| 849 | char **argv, *p; |
| 850 | int rl_flags = (rl_nulls ? RL_EOL_NULLS : 0); |
| 851 | |
| 852 | #ifdef ICONV_OPTION |
| 853 | rl_flags |= (protect_args && ic_recv != (iconv_t)-1 ? RL_CONVERT : 0); |
| 854 | #endif |
| 855 | |
| 856 | if (!(argv = new_array(char *, maxargs))) |
| 857 | out_of_memory("read_args"); |
| 858 | if (mod_name) |
| 859 | argv[argc++] = "rsyncd"; |
| 860 | |
| 861 | while (1) { |
| 862 | if (read_line(f_in, buf, bufsiz, rl_flags) == 0) |
| 863 | break; |
| 864 | |
| 865 | if (argc == maxargs) { |
| 866 | maxargs += MAX_ARGS; |
| 867 | if (!(argv = realloc_array(argv, char *, maxargs))) |
| 868 | out_of_memory("read_args"); |
| 869 | } |
| 870 | |
| 871 | if (dot_pos) { |
| 872 | if (request_p) { |
| 873 | *request_p = strdup(buf); |
| 874 | request_p = NULL; |
| 875 | } |
| 876 | if (mod_name) |
| 877 | glob_expand_module(mod_name, buf, &argv, &argc, &maxargs); |
| 878 | else |
| 879 | glob_expand(buf, &argv, &argc, &maxargs); |
| 880 | } else { |
| 881 | if (!(p = strdup(buf))) |
| 882 | out_of_memory("read_args"); |
| 883 | argv[argc++] = p; |
| 884 | if (*p == '.' && p[1] == '\0') |
| 885 | dot_pos = argc; |
| 886 | } |
| 887 | } |
| 888 | |
| 889 | *argc_p = argc; |
| 890 | *argv_p = argv; |
| 891 | |
| 892 | return dot_pos ? dot_pos : argc; |
| 893 | } |
| 894 | |
| 895 | int io_start_buffering_out(int f_out) |
| 896 | { |
| 897 | if (iobuf_out) { |
| 898 | assert(f_out == iobuf_f_out); |
| 899 | return 0; |
| 900 | } |
| 901 | if (!(iobuf_out = new_array(char, IO_BUFFER_SIZE))) |
| 902 | out_of_memory("io_start_buffering_out"); |
| 903 | iobuf_out_cnt = 0; |
| 904 | iobuf_f_out = f_out; |
| 905 | return 1; |
| 906 | } |
| 907 | |
| 908 | int io_start_buffering_in(int f_in) |
| 909 | { |
| 910 | if (iobuf_in) { |
| 911 | assert(f_in == iobuf_f_in); |
| 912 | return 0; |
| 913 | } |
| 914 | iobuf_in_siz = 2 * IO_BUFFER_SIZE; |
| 915 | if (!(iobuf_in = new_array(char, iobuf_in_siz))) |
| 916 | out_of_memory("io_start_buffering_in"); |
| 917 | iobuf_f_in = f_in; |
| 918 | return 1; |
| 919 | } |
| 920 | |
| 921 | void io_end_buffering_in(void) |
| 922 | { |
| 923 | if (!iobuf_in) |
| 924 | return; |
| 925 | free(iobuf_in); |
| 926 | iobuf_in = NULL; |
| 927 | iobuf_in_ndx = 0; |
| 928 | iobuf_in_remaining = 0; |
| 929 | iobuf_f_in = -1; |
| 930 | } |
| 931 | |
| 932 | void io_end_buffering_out(void) |
| 933 | { |
| 934 | if (!iobuf_out) |
| 935 | return; |
| 936 | io_flush(FULL_FLUSH); |
| 937 | free(iobuf_out); |
| 938 | iobuf_out = NULL; |
| 939 | iobuf_f_out = -1; |
| 940 | } |
| 941 | |
| 942 | void maybe_flush_socket(int important) |
| 943 | { |
| 944 | if (iobuf_out && iobuf_out_cnt |
| 945 | && (important || time(NULL) - last_io_out >= 5)) |
| 946 | io_flush(NORMAL_FLUSH); |
| 947 | } |
| 948 | |
| 949 | void maybe_send_keepalive(void) |
| 950 | { |
| 951 | if (time(NULL) - last_io_out >= allowed_lull) { |
| 952 | if (!iobuf_out || !iobuf_out_cnt) { |
| 953 | if (protocol_version < 29) |
| 954 | return; /* there's nothing we can do */ |
| 955 | if (protocol_version >= 30) |
| 956 | send_msg(MSG_NOOP, "", 0, 0); |
| 957 | else { |
| 958 | write_int(sock_f_out, cur_flist->used); |
| 959 | write_shortint(sock_f_out, ITEM_IS_NEW); |
| 960 | } |
| 961 | } |
| 962 | if (iobuf_out) |
| 963 | io_flush(NORMAL_FLUSH); |
| 964 | } |
| 965 | } |
| 966 | |
| 967 | void start_flist_forward(int f_in) |
| 968 | { |
| 969 | assert(iobuf_out != NULL); |
| 970 | assert(iobuf_f_out == msg_fd_out); |
| 971 | flist_forward_from = f_in; |
| 972 | } |
| 973 | |
| 974 | void stop_flist_forward() |
| 975 | { |
| 976 | flist_forward_from = -1; |
| 977 | io_flush(FULL_FLUSH); |
| 978 | } |
| 979 | |
| 980 | /** |
| 981 | * Continue trying to read len bytes - don't return until len has been |
| 982 | * read. |
| 983 | **/ |
| 984 | static void read_loop(int fd, char *buf, size_t len) |
| 985 | { |
| 986 | while (len) { |
| 987 | int n = read_timeout(fd, buf, len); |
| 988 | |
| 989 | buf += n; |
| 990 | len -= n; |
| 991 | } |
| 992 | } |
| 993 | |
| 994 | /** |
| 995 | * Read from the file descriptor handling multiplexing - return number |
| 996 | * of bytes read. |
| 997 | * |
| 998 | * Never returns <= 0. |
| 999 | */ |
| 1000 | static int readfd_unbuffered(int fd, char *buf, size_t len) |
| 1001 | { |
| 1002 | size_t msg_bytes; |
| 1003 | int tag, cnt = 0; |
| 1004 | char line[BIGPATHBUFLEN]; |
| 1005 | |
| 1006 | if (!iobuf_in || fd != iobuf_f_in) |
| 1007 | return read_timeout(fd, buf, len); |
| 1008 | |
| 1009 | if (!io_multiplexing_in && iobuf_in_remaining == 0) { |
| 1010 | iobuf_in_remaining = read_timeout(fd, iobuf_in, iobuf_in_siz); |
| 1011 | iobuf_in_ndx = 0; |
| 1012 | } |
| 1013 | |
| 1014 | while (cnt == 0) { |
| 1015 | if (iobuf_in_remaining) { |
| 1016 | len = MIN(len, iobuf_in_remaining); |
| 1017 | memcpy(buf, iobuf_in + iobuf_in_ndx, len); |
| 1018 | iobuf_in_ndx += len; |
| 1019 | iobuf_in_remaining -= len; |
| 1020 | cnt = len; |
| 1021 | break; |
| 1022 | } |
| 1023 | |
| 1024 | read_loop(fd, line, 4); |
| 1025 | tag = IVAL(line, 0); |
| 1026 | |
| 1027 | msg_bytes = tag & 0xFFFFFF; |
| 1028 | tag = (tag >> 24) - MPLEX_BASE; |
| 1029 | |
| 1030 | switch (tag) { |
| 1031 | case MSG_DATA: |
| 1032 | if (msg_bytes > iobuf_in_siz) { |
| 1033 | if (!(iobuf_in = realloc_array(iobuf_in, char, |
| 1034 | msg_bytes))) |
| 1035 | out_of_memory("readfd_unbuffered"); |
| 1036 | iobuf_in_siz = msg_bytes; |
| 1037 | } |
| 1038 | read_loop(fd, iobuf_in, msg_bytes); |
| 1039 | iobuf_in_remaining = msg_bytes; |
| 1040 | iobuf_in_ndx = 0; |
| 1041 | break; |
| 1042 | case MSG_NOOP: |
| 1043 | if (am_sender) |
| 1044 | maybe_send_keepalive(); |
| 1045 | break; |
| 1046 | case MSG_IO_ERROR: |
| 1047 | if (msg_bytes != 4) |
| 1048 | goto invalid_msg; |
| 1049 | read_loop(fd, line, msg_bytes); |
| 1050 | send_msg_int(MSG_IO_ERROR, IVAL(line, 0)); |
| 1051 | io_error |= IVAL(line, 0); |
| 1052 | break; |
| 1053 | case MSG_DELETED: |
| 1054 | if (msg_bytes >= sizeof line) |
| 1055 | goto overflow; |
| 1056 | #ifdef ICONV_OPTION |
| 1057 | if (ic_recv != (iconv_t)-1) { |
| 1058 | xbuf outbuf, inbuf; |
| 1059 | char ibuf[512]; |
| 1060 | int add_null = 0; |
| 1061 | int pos = 0; |
| 1062 | |
| 1063 | INIT_CONST_XBUF(outbuf, line); |
| 1064 | inbuf.buf = ibuf; |
| 1065 | |
| 1066 | while (msg_bytes) { |
| 1067 | inbuf.len = msg_bytes > sizeof ibuf |
| 1068 | ? sizeof ibuf : msg_bytes; |
| 1069 | read_loop(fd, inbuf.buf, inbuf.len); |
| 1070 | if (!(msg_bytes -= inbuf.len) |
| 1071 | && !ibuf[inbuf.len-1]) |
| 1072 | inbuf.len--, add_null = 1; |
| 1073 | if (iconvbufs(ic_send, &inbuf, &outbuf, |
| 1074 | ICB_INCLUDE_BAD | ICB_INCLUDE_INCOMPLETE) < 0) |
| 1075 | goto overflow; |
| 1076 | pos = -1; |
| 1077 | } |
| 1078 | if (add_null) { |
| 1079 | if (outbuf.len == outbuf.size) |
| 1080 | goto overflow; |
| 1081 | outbuf.buf[outbuf.len++] = '\0'; |
| 1082 | } |
| 1083 | msg_bytes = outbuf.len; |
| 1084 | } else |
| 1085 | #endif |
| 1086 | read_loop(fd, line, msg_bytes); |
| 1087 | /* A directory name was sent with the trailing null */ |
| 1088 | if (msg_bytes > 0 && !line[msg_bytes-1]) |
| 1089 | log_delete(line, S_IFDIR); |
| 1090 | else { |
| 1091 | line[msg_bytes] = '\0'; |
| 1092 | log_delete(line, S_IFREG); |
| 1093 | } |
| 1094 | break; |
| 1095 | case MSG_SUCCESS: |
| 1096 | if (msg_bytes != 4) { |
| 1097 | invalid_msg: |
| 1098 | rprintf(FERROR, "invalid multi-message %d:%ld [%s]\n", |
| 1099 | tag, (long)msg_bytes, who_am_i()); |
| 1100 | exit_cleanup(RERR_STREAMIO); |
| 1101 | } |
| 1102 | read_loop(fd, line, msg_bytes); |
| 1103 | successful_send(IVAL(line, 0)); |
| 1104 | break; |
| 1105 | case MSG_NO_SEND: |
| 1106 | if (msg_bytes != 4) |
| 1107 | goto invalid_msg; |
| 1108 | read_loop(fd, line, msg_bytes); |
| 1109 | send_msg_int(MSG_NO_SEND, IVAL(line, 0)); |
| 1110 | break; |
| 1111 | case MSG_INFO: |
| 1112 | case MSG_ERROR: |
| 1113 | if (msg_bytes >= sizeof line) { |
| 1114 | overflow: |
| 1115 | rprintf(FERROR, |
| 1116 | "multiplexing overflow %d:%ld [%s]\n", |
| 1117 | tag, (long)msg_bytes, who_am_i()); |
| 1118 | exit_cleanup(RERR_STREAMIO); |
| 1119 | } |
| 1120 | read_loop(fd, line, msg_bytes); |
| 1121 | rwrite((enum logcode)tag, line, msg_bytes, 1); |
| 1122 | break; |
| 1123 | default: |
| 1124 | rprintf(FERROR, "unexpected tag %d [%s]\n", |
| 1125 | tag, who_am_i()); |
| 1126 | exit_cleanup(RERR_STREAMIO); |
| 1127 | } |
| 1128 | } |
| 1129 | |
| 1130 | if (iobuf_in_remaining == 0) |
| 1131 | io_flush(NORMAL_FLUSH); |
| 1132 | |
| 1133 | return cnt; |
| 1134 | } |
| 1135 | |
| 1136 | /* Do a buffered read from fd. Don't return until all N bytes have |
| 1137 | * been read. If all N can't be read then exit with an error. */ |
| 1138 | static void readfd(int fd, char *buffer, size_t N) |
| 1139 | { |
| 1140 | int cnt; |
| 1141 | size_t total = 0; |
| 1142 | |
| 1143 | while (total < N) { |
| 1144 | cnt = readfd_unbuffered(fd, buffer + total, N-total); |
| 1145 | total += cnt; |
| 1146 | } |
| 1147 | |
| 1148 | if (fd == write_batch_monitor_in) { |
| 1149 | if ((size_t)write(batch_fd, buffer, total) != total) |
| 1150 | exit_cleanup(RERR_FILEIO); |
| 1151 | } |
| 1152 | |
| 1153 | if (fd == flist_forward_from) |
| 1154 | writefd(iobuf_f_out, buffer, total); |
| 1155 | |
| 1156 | if (fd == sock_f_in) |
| 1157 | stats.total_read += total; |
| 1158 | } |
| 1159 | |
| 1160 | unsigned short read_shortint(int f) |
| 1161 | { |
| 1162 | char b[2]; |
| 1163 | readfd(f, b, 2); |
| 1164 | return (UVAL(b, 1) << 8) + UVAL(b, 0); |
| 1165 | } |
| 1166 | |
| 1167 | int32 read_int(int f) |
| 1168 | { |
| 1169 | char b[4]; |
| 1170 | int32 num; |
| 1171 | |
| 1172 | readfd(f, b, 4); |
| 1173 | num = IVAL(b, 0); |
| 1174 | #if SIZEOF_INT32 > 4 |
| 1175 | if (num & (int32)0x80000000) |
| 1176 | num |= ~(int32)0xffffffff; |
| 1177 | #endif |
| 1178 | return num; |
| 1179 | } |
| 1180 | |
| 1181 | int32 read_varint(int f) |
| 1182 | { |
| 1183 | union { |
| 1184 | char b[5]; |
| 1185 | int32 x; |
| 1186 | } u; |
| 1187 | uchar ch; |
| 1188 | int extra; |
| 1189 | |
| 1190 | u.x = 0; |
| 1191 | readfd(f, (char*)&ch, 1); |
| 1192 | extra = int_byte_extra[ch / 4]; |
| 1193 | if (extra) { |
| 1194 | uchar bit = ((uchar)1<<(8-extra)); |
| 1195 | if (extra >= (int)sizeof u.b) { |
| 1196 | rprintf(FERROR, "Overflow in read_varint()\n"); |
| 1197 | exit_cleanup(RERR_STREAMIO); |
| 1198 | } |
| 1199 | readfd(f, u.b, extra); |
| 1200 | u.b[extra] = ch & (bit-1); |
| 1201 | } else |
| 1202 | u.b[0] = ch; |
| 1203 | #if CAREFUL_ALIGNMENT |
| 1204 | u.x = IVAL(u.b,0); |
| 1205 | #endif |
| 1206 | #if SIZEOF_INT32 > 4 |
| 1207 | if (u.x & (int32)0x80000000) |
| 1208 | u.x |= ~(int32)0xffffffff; |
| 1209 | #endif |
| 1210 | return u.x; |
| 1211 | } |
| 1212 | |
| 1213 | int64 read_varlong(int f, uchar min_bytes) |
| 1214 | { |
| 1215 | union { |
| 1216 | char b[9]; |
| 1217 | int64 x; |
| 1218 | } u; |
| 1219 | char b2[8]; |
| 1220 | int extra; |
| 1221 | |
| 1222 | #if SIZEOF_INT64 < 8 |
| 1223 | memset(u.b, 0, 8); |
| 1224 | #else |
| 1225 | u.x = 0; |
| 1226 | #endif |
| 1227 | readfd(f, b2, min_bytes); |
| 1228 | memcpy(u.b, b2+1, min_bytes-1); |
| 1229 | extra = int_byte_extra[CVAL(b2, 0) / 4]; |
| 1230 | if (extra) { |
| 1231 | uchar bit = ((uchar)1<<(8-extra)); |
| 1232 | if (min_bytes + extra > (int)sizeof u.b) { |
| 1233 | rprintf(FERROR, "Overflow in read_varlong()\n"); |
| 1234 | exit_cleanup(RERR_STREAMIO); |
| 1235 | } |
| 1236 | readfd(f, u.b + min_bytes - 1, extra); |
| 1237 | u.b[min_bytes + extra - 1] = CVAL(b2, 0) & (bit-1); |
| 1238 | #if SIZEOF_INT64 < 8 |
| 1239 | if (min_bytes + extra > 5 || u.b[4] || CVAL(u.b,3) & 0x80) { |
| 1240 | rprintf(FERROR, "Integer overflow: attempted 64-bit offset\n"); |
| 1241 | exit_cleanup(RERR_UNSUPPORTED); |
| 1242 | } |
| 1243 | #endif |
| 1244 | } else |
| 1245 | u.b[min_bytes + extra - 1] = CVAL(b2, 0); |
| 1246 | #if SIZEOF_INT64 < 8 |
| 1247 | u.x = IVAL(u.b,0); |
| 1248 | #elif CAREFUL_ALIGNMENT |
| 1249 | u.x = IVAL(u.b,0) | (((int64)IVAL(u.b,4))<<32); |
| 1250 | #endif |
| 1251 | return u.x; |
| 1252 | } |
| 1253 | |
| 1254 | int64 read_longint(int f) |
| 1255 | { |
| 1256 | #if SIZEOF_INT64 >= 8 |
| 1257 | char b[9]; |
| 1258 | #endif |
| 1259 | int32 num = read_int(f); |
| 1260 | |
| 1261 | if (num != (int32)0xffffffff) |
| 1262 | return num; |
| 1263 | |
| 1264 | #if SIZEOF_INT64 < 8 |
| 1265 | rprintf(FERROR, "Integer overflow: attempted 64-bit offset\n"); |
| 1266 | exit_cleanup(RERR_UNSUPPORTED); |
| 1267 | #else |
| 1268 | readfd(f, b, 8); |
| 1269 | return IVAL(b,0) | (((int64)IVAL(b,4))<<32); |
| 1270 | #endif |
| 1271 | } |
| 1272 | |
| 1273 | void read_buf(int f, char *buf, size_t len) |
| 1274 | { |
| 1275 | readfd(f,buf,len); |
| 1276 | } |
| 1277 | |
| 1278 | void read_sbuf(int f, char *buf, size_t len) |
| 1279 | { |
| 1280 | readfd(f, buf, len); |
| 1281 | buf[len] = '\0'; |
| 1282 | } |
| 1283 | |
| 1284 | uchar read_byte(int f) |
| 1285 | { |
| 1286 | uchar c; |
| 1287 | readfd(f, (char *)&c, 1); |
| 1288 | return c; |
| 1289 | } |
| 1290 | |
| 1291 | int read_vstring(int f, char *buf, int bufsize) |
| 1292 | { |
| 1293 | int len = read_byte(f); |
| 1294 | |
| 1295 | if (len & 0x80) |
| 1296 | len = (len & ~0x80) * 0x100 + read_byte(f); |
| 1297 | |
| 1298 | if (len >= bufsize) { |
| 1299 | rprintf(FERROR, "over-long vstring received (%d > %d)\n", |
| 1300 | len, bufsize - 1); |
| 1301 | return -1; |
| 1302 | } |
| 1303 | |
| 1304 | if (len) |
| 1305 | readfd(f, buf, len); |
| 1306 | buf[len] = '\0'; |
| 1307 | return len; |
| 1308 | } |
| 1309 | |
| 1310 | /* Populate a sum_struct with values from the socket. This is |
| 1311 | * called by both the sender and the receiver. */ |
| 1312 | void read_sum_head(int f, struct sum_struct *sum) |
| 1313 | { |
| 1314 | sum->count = read_int(f); |
| 1315 | if (sum->count < 0) { |
| 1316 | rprintf(FERROR, "Invalid checksum count %ld [%s]\n", |
| 1317 | (long)sum->count, who_am_i()); |
| 1318 | exit_cleanup(RERR_PROTOCOL); |
| 1319 | } |
| 1320 | sum->blength = read_int(f); |
| 1321 | if (sum->blength < 0 || sum->blength > MAX_BLOCK_SIZE) { |
| 1322 | rprintf(FERROR, "Invalid block length %ld [%s]\n", |
| 1323 | (long)sum->blength, who_am_i()); |
| 1324 | exit_cleanup(RERR_PROTOCOL); |
| 1325 | } |
| 1326 | sum->s2length = protocol_version < 27 ? csum_length : (int)read_int(f); |
| 1327 | if (sum->s2length < 0 || sum->s2length > MAX_DIGEST_LEN) { |
| 1328 | rprintf(FERROR, "Invalid checksum length %d [%s]\n", |
| 1329 | sum->s2length, who_am_i()); |
| 1330 | exit_cleanup(RERR_PROTOCOL); |
| 1331 | } |
| 1332 | sum->remainder = read_int(f); |
| 1333 | if (sum->remainder < 0 || sum->remainder > sum->blength) { |
| 1334 | rprintf(FERROR, "Invalid remainder length %ld [%s]\n", |
| 1335 | (long)sum->remainder, who_am_i()); |
| 1336 | exit_cleanup(RERR_PROTOCOL); |
| 1337 | } |
| 1338 | } |
| 1339 | |
| 1340 | /* Send the values from a sum_struct over the socket. Set sum to |
| 1341 | * NULL if there are no checksums to send. This is called by both |
| 1342 | * the generator and the sender. */ |
| 1343 | void write_sum_head(int f, struct sum_struct *sum) |
| 1344 | { |
| 1345 | static struct sum_struct null_sum; |
| 1346 | |
| 1347 | if (sum == NULL) |
| 1348 | sum = &null_sum; |
| 1349 | |
| 1350 | write_int(f, sum->count); |
| 1351 | write_int(f, sum->blength); |
| 1352 | if (protocol_version >= 27) |
| 1353 | write_int(f, sum->s2length); |
| 1354 | write_int(f, sum->remainder); |
| 1355 | } |
| 1356 | |
| 1357 | /** |
| 1358 | * Sleep after writing to limit I/O bandwidth usage. |
| 1359 | * |
| 1360 | * @todo Rather than sleeping after each write, it might be better to |
| 1361 | * use some kind of averaging. The current algorithm seems to always |
| 1362 | * use a bit less bandwidth than specified, because it doesn't make up |
| 1363 | * for slow periods. But arguably this is a feature. In addition, we |
| 1364 | * ought to take the time used to write the data into account. |
| 1365 | * |
| 1366 | * During some phases of big transfers (file FOO is uptodate) this is |
| 1367 | * called with a small bytes_written every time. As the kernel has to |
| 1368 | * round small waits up to guarantee that we actually wait at least the |
| 1369 | * requested number of microseconds, this can become grossly inaccurate. |
| 1370 | * We therefore keep track of the bytes we've written over time and only |
| 1371 | * sleep when the accumulated delay is at least 1 tenth of a second. |
| 1372 | **/ |
| 1373 | static void sleep_for_bwlimit(int bytes_written) |
| 1374 | { |
| 1375 | static struct timeval prior_tv; |
| 1376 | static long total_written = 0; |
| 1377 | struct timeval tv, start_tv; |
| 1378 | long elapsed_usec, sleep_usec; |
| 1379 | |
| 1380 | #define ONE_SEC 1000000L /* # of microseconds in a second */ |
| 1381 | |
| 1382 | if (!bwlimit_writemax) |
| 1383 | return; |
| 1384 | |
| 1385 | total_written += bytes_written; |
| 1386 | |
| 1387 | gettimeofday(&start_tv, NULL); |
| 1388 | if (prior_tv.tv_sec) { |
| 1389 | elapsed_usec = (start_tv.tv_sec - prior_tv.tv_sec) * ONE_SEC |
| 1390 | + (start_tv.tv_usec - prior_tv.tv_usec); |
| 1391 | total_written -= elapsed_usec * bwlimit / (ONE_SEC/1024); |
| 1392 | if (total_written < 0) |
| 1393 | total_written = 0; |
| 1394 | } |
| 1395 | |
| 1396 | sleep_usec = total_written * (ONE_SEC/1024) / bwlimit; |
| 1397 | if (sleep_usec < ONE_SEC / 10) { |
| 1398 | prior_tv = start_tv; |
| 1399 | return; |
| 1400 | } |
| 1401 | |
| 1402 | tv.tv_sec = sleep_usec / ONE_SEC; |
| 1403 | tv.tv_usec = sleep_usec % ONE_SEC; |
| 1404 | select(0, NULL, NULL, NULL, &tv); |
| 1405 | |
| 1406 | gettimeofday(&prior_tv, NULL); |
| 1407 | elapsed_usec = (prior_tv.tv_sec - start_tv.tv_sec) * ONE_SEC |
| 1408 | + (prior_tv.tv_usec - start_tv.tv_usec); |
| 1409 | total_written = (sleep_usec - elapsed_usec) * bwlimit / (ONE_SEC/1024); |
| 1410 | } |
| 1411 | |
| 1412 | /* Write len bytes to the file descriptor fd, looping as necessary to get |
| 1413 | * the job done and also (in certain circumstances) reading any data on |
| 1414 | * msg_fd_in to avoid deadlock. |
| 1415 | * |
| 1416 | * This function underlies the multiplexing system. The body of the |
| 1417 | * application never calls this function directly. */ |
| 1418 | static void writefd_unbuffered(int fd, const char *buf, size_t len) |
| 1419 | { |
| 1420 | size_t n, total = 0; |
| 1421 | fd_set w_fds, r_fds, e_fds; |
| 1422 | int maxfd, count, cnt, using_r_fds; |
| 1423 | int defer_inc = 0; |
| 1424 | struct timeval tv; |
| 1425 | |
| 1426 | if (no_flush++) |
| 1427 | defer_forwarding_messages++, defer_inc++; |
| 1428 | |
| 1429 | while (total < len) { |
| 1430 | FD_ZERO(&w_fds); |
| 1431 | FD_SET(fd, &w_fds); |
| 1432 | FD_ZERO(&e_fds); |
| 1433 | FD_SET(fd, &e_fds); |
| 1434 | maxfd = fd; |
| 1435 | |
| 1436 | if (msg_fd_in >= 0) { |
| 1437 | FD_ZERO(&r_fds); |
| 1438 | FD_SET(msg_fd_in, &r_fds); |
| 1439 | if (msg_fd_in > maxfd) |
| 1440 | maxfd = msg_fd_in; |
| 1441 | using_r_fds = 1; |
| 1442 | } else |
| 1443 | using_r_fds = 0; |
| 1444 | |
| 1445 | tv.tv_sec = select_timeout; |
| 1446 | tv.tv_usec = 0; |
| 1447 | |
| 1448 | errno = 0; |
| 1449 | count = select(maxfd + 1, using_r_fds ? &r_fds : NULL, |
| 1450 | &w_fds, &e_fds, &tv); |
| 1451 | |
| 1452 | if (count <= 0) { |
| 1453 | if (count < 0 && errno == EBADF) |
| 1454 | exit_cleanup(RERR_SOCKETIO); |
| 1455 | check_timeout(); |
| 1456 | continue; |
| 1457 | } |
| 1458 | |
| 1459 | /*if (FD_ISSET(fd, &e_fds)) |
| 1460 | rprintf(FINFO, "select exception on fd %d\n", fd); */ |
| 1461 | |
| 1462 | if (using_r_fds && FD_ISSET(msg_fd_in, &r_fds)) |
| 1463 | read_msg_fd(); |
| 1464 | |
| 1465 | if (!FD_ISSET(fd, &w_fds)) |
| 1466 | continue; |
| 1467 | |
| 1468 | n = len - total; |
| 1469 | if (bwlimit_writemax && n > bwlimit_writemax) |
| 1470 | n = bwlimit_writemax; |
| 1471 | cnt = write(fd, buf + total, n); |
| 1472 | |
| 1473 | if (cnt <= 0) { |
| 1474 | if (cnt < 0) { |
| 1475 | if (errno == EINTR) |
| 1476 | continue; |
| 1477 | if (errno == EWOULDBLOCK || errno == EAGAIN) { |
| 1478 | msleep(1); |
| 1479 | continue; |
| 1480 | } |
| 1481 | } |
| 1482 | |
| 1483 | /* Don't try to write errors back across the stream. */ |
| 1484 | if (fd == sock_f_out) |
| 1485 | io_end_multiplex_out(); |
| 1486 | /* Don't try to write errors down a failing msg pipe. */ |
| 1487 | if (am_server && fd == msg_fd_out) |
| 1488 | exit_cleanup(RERR_STREAMIO); |
| 1489 | rsyserr(FERROR, errno, |
| 1490 | "writefd_unbuffered failed to write %ld bytes [%s]", |
| 1491 | (long)len, who_am_i()); |
| 1492 | /* If the other side is sending us error messages, try |
| 1493 | * to grab any messages they sent before they died. */ |
| 1494 | while (!am_server && fd == sock_f_out && io_multiplexing_in) { |
| 1495 | char buf[1024]; |
| 1496 | set_io_timeout(30); |
| 1497 | ignore_timeout = 0; |
| 1498 | readfd_unbuffered(sock_f_in, buf, sizeof buf); |
| 1499 | } |
| 1500 | exit_cleanup(RERR_STREAMIO); |
| 1501 | } |
| 1502 | |
| 1503 | total += cnt; |
| 1504 | defer_forwarding_messages++, defer_inc++; |
| 1505 | |
| 1506 | if (fd == sock_f_out) { |
| 1507 | if (io_timeout || am_generator) |
| 1508 | last_io_out = time(NULL); |
| 1509 | sleep_for_bwlimit(cnt); |
| 1510 | } |
| 1511 | } |
| 1512 | |
| 1513 | no_flush--; |
| 1514 | if (!(defer_forwarding_messages -= defer_inc)) |
| 1515 | msg_flush(); |
| 1516 | } |
| 1517 | |
| 1518 | void io_flush(int flush_it_all) |
| 1519 | { |
| 1520 | if (!iobuf_out_cnt || no_flush) |
| 1521 | return; |
| 1522 | |
| 1523 | if (io_multiplexing_out) |
| 1524 | mplex_write(sock_f_out, MSG_DATA, iobuf_out, iobuf_out_cnt, 0); |
| 1525 | else |
| 1526 | writefd_unbuffered(iobuf_f_out, iobuf_out, iobuf_out_cnt); |
| 1527 | iobuf_out_cnt = 0; |
| 1528 | |
| 1529 | if (flush_it_all && !defer_forwarding_messages) |
| 1530 | msg_flush(); |
| 1531 | } |
| 1532 | |
| 1533 | static void writefd(int fd, const char *buf, size_t len) |
| 1534 | { |
| 1535 | if (fd == sock_f_out) |
| 1536 | stats.total_written += len; |
| 1537 | |
| 1538 | if (fd == write_batch_monitor_out) { |
| 1539 | if ((size_t)write(batch_fd, buf, len) != len) |
| 1540 | exit_cleanup(RERR_FILEIO); |
| 1541 | } |
| 1542 | |
| 1543 | if (!iobuf_out || fd != iobuf_f_out) { |
| 1544 | writefd_unbuffered(fd, buf, len); |
| 1545 | return; |
| 1546 | } |
| 1547 | |
| 1548 | while (len) { |
| 1549 | int n = MIN((int)len, IO_BUFFER_SIZE - iobuf_out_cnt); |
| 1550 | if (n > 0) { |
| 1551 | memcpy(iobuf_out+iobuf_out_cnt, buf, n); |
| 1552 | buf += n; |
| 1553 | len -= n; |
| 1554 | iobuf_out_cnt += n; |
| 1555 | } |
| 1556 | |
| 1557 | if (iobuf_out_cnt == IO_BUFFER_SIZE) |
| 1558 | io_flush(NORMAL_FLUSH); |
| 1559 | } |
| 1560 | } |
| 1561 | |
| 1562 | void write_shortint(int f, unsigned short x) |
| 1563 | { |
| 1564 | char b[2]; |
| 1565 | b[0] = (char)x; |
| 1566 | b[1] = (char)(x >> 8); |
| 1567 | writefd(f, b, 2); |
| 1568 | } |
| 1569 | |
| 1570 | void write_int(int f, int32 x) |
| 1571 | { |
| 1572 | char b[4]; |
| 1573 | SIVAL(b, 0, x); |
| 1574 | writefd(f, b, 4); |
| 1575 | } |
| 1576 | |
| 1577 | void write_varint(int f, int32 x) |
| 1578 | { |
| 1579 | char b[5]; |
| 1580 | uchar bit; |
| 1581 | int cnt = 4; |
| 1582 | |
| 1583 | SIVAL(b, 1, x); |
| 1584 | |
| 1585 | while (cnt > 1 && b[cnt] == 0) |
| 1586 | cnt--; |
| 1587 | bit = ((uchar)1<<(7-cnt+1)); |
| 1588 | if (CVAL(b, cnt) >= bit) { |
| 1589 | cnt++; |
| 1590 | *b = ~(bit-1); |
| 1591 | } else if (cnt > 1) |
| 1592 | *b = b[cnt] | ~(bit*2-1); |
| 1593 | else |
| 1594 | *b = b[cnt]; |
| 1595 | |
| 1596 | writefd(f, b, cnt); |
| 1597 | } |
| 1598 | |
| 1599 | void write_varlong(int f, int64 x, uchar min_bytes) |
| 1600 | { |
| 1601 | char b[9]; |
| 1602 | uchar bit; |
| 1603 | int cnt = 8; |
| 1604 | |
| 1605 | SIVAL(b, 1, x); |
| 1606 | #if SIZEOF_INT64 >= 8 |
| 1607 | SIVAL(b, 5, x >> 32); |
| 1608 | #else |
| 1609 | if (x <= 0x7FFFFFFF && x >= 0) |
| 1610 | memset(b + 5, 0, 4); |
| 1611 | else { |
| 1612 | rprintf(FERROR, "Integer overflow: attempted 64-bit offset\n"); |
| 1613 | exit_cleanup(RERR_UNSUPPORTED); |
| 1614 | } |
| 1615 | #endif |
| 1616 | |
| 1617 | while (cnt > min_bytes && b[cnt] == 0) |
| 1618 | cnt--; |
| 1619 | bit = ((uchar)1<<(7-cnt+min_bytes)); |
| 1620 | if (CVAL(b, cnt) >= bit) { |
| 1621 | cnt++; |
| 1622 | *b = ~(bit-1); |
| 1623 | } else if (cnt > min_bytes) |
| 1624 | *b = b[cnt] | ~(bit*2-1); |
| 1625 | else |
| 1626 | *b = b[cnt]; |
| 1627 | |
| 1628 | writefd(f, b, cnt); |
| 1629 | } |
| 1630 | |
| 1631 | /* |
| 1632 | * Note: int64 may actually be a 32-bit type if ./configure couldn't find any |
| 1633 | * 64-bit types on this platform. |
| 1634 | */ |
| 1635 | void write_longint(int f, int64 x) |
| 1636 | { |
| 1637 | char b[12], * const s = b+4; |
| 1638 | |
| 1639 | SIVAL(s, 0, x); |
| 1640 | if (x <= 0x7FFFFFFF && x >= 0) { |
| 1641 | writefd(f, s, 4); |
| 1642 | return; |
| 1643 | } |
| 1644 | |
| 1645 | #if SIZEOF_INT64 < 8 |
| 1646 | rprintf(FERROR, "Integer overflow: attempted 64-bit offset\n"); |
| 1647 | exit_cleanup(RERR_UNSUPPORTED); |
| 1648 | #else |
| 1649 | memset(b, 0xFF, 4); |
| 1650 | SIVAL(s, 4, x >> 32); |
| 1651 | writefd(f, b, 12); |
| 1652 | #endif |
| 1653 | } |
| 1654 | |
| 1655 | void write_buf(int f, const char *buf, size_t len) |
| 1656 | { |
| 1657 | writefd(f,buf,len); |
| 1658 | } |
| 1659 | |
| 1660 | /** Write a string to the connection */ |
| 1661 | void write_sbuf(int f, const char *buf) |
| 1662 | { |
| 1663 | writefd(f, buf, strlen(buf)); |
| 1664 | } |
| 1665 | |
| 1666 | void write_byte(int f, uchar c) |
| 1667 | { |
| 1668 | writefd(f, (char *)&c, 1); |
| 1669 | } |
| 1670 | |
| 1671 | void write_vstring(int f, const char *str, int len) |
| 1672 | { |
| 1673 | uchar lenbuf[3], *lb = lenbuf; |
| 1674 | |
| 1675 | if (len > 0x7F) { |
| 1676 | if (len > 0x7FFF) { |
| 1677 | rprintf(FERROR, |
| 1678 | "attempting to send over-long vstring (%d > %d)\n", |
| 1679 | len, 0x7FFF); |
| 1680 | exit_cleanup(RERR_PROTOCOL); |
| 1681 | } |
| 1682 | *lb++ = len / 0x100 + 0x80; |
| 1683 | } |
| 1684 | *lb = len; |
| 1685 | |
| 1686 | writefd(f, (char*)lenbuf, lb - lenbuf + 1); |
| 1687 | if (len) |
| 1688 | writefd(f, str, len); |
| 1689 | } |
| 1690 | |
| 1691 | /* Send a file-list index using a byte-reduction method. */ |
| 1692 | void write_ndx(int f, int32 ndx) |
| 1693 | { |
| 1694 | static int32 prev_positive = -1, prev_negative = 1; |
| 1695 | int32 diff, cnt = 0; |
| 1696 | char b[6]; |
| 1697 | |
| 1698 | if (protocol_version < 30 || read_batch) { |
| 1699 | write_int(f, ndx); |
| 1700 | return; |
| 1701 | } |
| 1702 | |
| 1703 | /* Send NDX_DONE as a single-byte 0 with no side effects. Send |
| 1704 | * negative nums as a positive after sending a leading 0xFF. */ |
| 1705 | if (ndx >= 0) { |
| 1706 | diff = ndx - prev_positive; |
| 1707 | prev_positive = ndx; |
| 1708 | } else if (ndx == NDX_DONE) { |
| 1709 | *b = 0; |
| 1710 | writefd(f, b, 1); |
| 1711 | return; |
| 1712 | } else { |
| 1713 | b[cnt++] = (char)0xFF; |
| 1714 | ndx = -ndx; |
| 1715 | diff = ndx - prev_negative; |
| 1716 | prev_negative = ndx; |
| 1717 | } |
| 1718 | |
| 1719 | /* A diff of 1 - 253 is sent as a one-byte diff; a diff of 254 - 32767 |
| 1720 | * or 0 is sent as a 0xFE + a two-byte diff; otherwise we send 0xFE |
| 1721 | * & all 4 bytes of the (non-negative) num with the high-bit set. */ |
| 1722 | if (diff < 0xFE && diff > 0) |
| 1723 | b[cnt++] = (char)diff; |
| 1724 | else if (diff < 0 || diff > 0x7FFF) { |
| 1725 | b[cnt++] = (char)0xFE; |
| 1726 | b[cnt++] = (char)((ndx >> 24) | 0x80); |
| 1727 | b[cnt++] = (char)ndx; |
| 1728 | b[cnt++] = (char)(ndx >> 8); |
| 1729 | b[cnt++] = (char)(ndx >> 16); |
| 1730 | } else { |
| 1731 | b[cnt++] = (char)0xFE; |
| 1732 | b[cnt++] = (char)(diff >> 8); |
| 1733 | b[cnt++] = (char)diff; |
| 1734 | } |
| 1735 | writefd(f, b, cnt); |
| 1736 | } |
| 1737 | |
| 1738 | /* Receive a file-list index using a byte-reduction method. */ |
| 1739 | int32 read_ndx(int f) |
| 1740 | { |
| 1741 | static int32 prev_positive = -1, prev_negative = 1; |
| 1742 | int32 *prev_ptr, num; |
| 1743 | char b[4]; |
| 1744 | |
| 1745 | if (protocol_version < 30) |
| 1746 | return read_int(f); |
| 1747 | |
| 1748 | readfd(f, b, 1); |
| 1749 | if (CVAL(b, 0) == 0xFF) { |
| 1750 | readfd(f, b, 1); |
| 1751 | prev_ptr = &prev_negative; |
| 1752 | } else if (CVAL(b, 0) == 0) |
| 1753 | return NDX_DONE; |
| 1754 | else |
| 1755 | prev_ptr = &prev_positive; |
| 1756 | if (CVAL(b, 0) == 0xFE) { |
| 1757 | readfd(f, b, 2); |
| 1758 | if (CVAL(b, 0) & 0x80) { |
| 1759 | b[3] = CVAL(b, 0) & ~0x80; |
| 1760 | b[0] = b[1]; |
| 1761 | readfd(f, b+1, 2); |
| 1762 | num = IVAL(b, 0); |
| 1763 | } else |
| 1764 | num = (UVAL(b,0)<<8) + UVAL(b,1) + *prev_ptr; |
| 1765 | } else |
| 1766 | num = UVAL(b, 0) + *prev_ptr; |
| 1767 | *prev_ptr = num; |
| 1768 | if (prev_ptr == &prev_negative) |
| 1769 | num = -num; |
| 1770 | return num; |
| 1771 | } |
| 1772 | |
| 1773 | /* Read a line of up to bufsiz-1 characters into buf. Strips |
| 1774 | * the (required) trailing newline and all carriage returns. |
| 1775 | * Returns 1 for success; 0 for I/O error or truncation. */ |
| 1776 | int read_line_old(int f, char *buf, size_t bufsiz) |
| 1777 | { |
| 1778 | bufsiz--; /* leave room for the null */ |
| 1779 | while (bufsiz > 0) { |
| 1780 | buf[0] = 0; |
| 1781 | read_buf(f, buf, 1); |
| 1782 | if (buf[0] == 0) |
| 1783 | return 0; |
| 1784 | if (buf[0] == '\n') |
| 1785 | break; |
| 1786 | if (buf[0] != '\r') { |
| 1787 | buf++; |
| 1788 | bufsiz--; |
| 1789 | } |
| 1790 | } |
| 1791 | *buf = '\0'; |
| 1792 | return bufsiz > 0; |
| 1793 | } |
| 1794 | |
| 1795 | void io_printf(int fd, const char *format, ...) |
| 1796 | { |
| 1797 | va_list ap; |
| 1798 | char buf[BIGPATHBUFLEN]; |
| 1799 | int len; |
| 1800 | |
| 1801 | va_start(ap, format); |
| 1802 | len = vsnprintf(buf, sizeof buf, format, ap); |
| 1803 | va_end(ap); |
| 1804 | |
| 1805 | if (len < 0) |
| 1806 | exit_cleanup(RERR_STREAMIO); |
| 1807 | |
| 1808 | if (len > (int)sizeof buf) { |
| 1809 | rprintf(FERROR, "io_printf() was too long for the buffer.\n"); |
| 1810 | exit_cleanup(RERR_STREAMIO); |
| 1811 | } |
| 1812 | |
| 1813 | write_sbuf(fd, buf); |
| 1814 | } |
| 1815 | |
| 1816 | /** Setup for multiplexing a MSG_* stream with the data stream. */ |
| 1817 | void io_start_multiplex_out(void) |
| 1818 | { |
| 1819 | io_flush(NORMAL_FLUSH); |
| 1820 | io_start_buffering_out(sock_f_out); |
| 1821 | io_multiplexing_out = 1; |
| 1822 | } |
| 1823 | |
| 1824 | /** Setup for multiplexing a MSG_* stream with the data stream. */ |
| 1825 | void io_start_multiplex_in(void) |
| 1826 | { |
| 1827 | io_flush(NORMAL_FLUSH); |
| 1828 | io_start_buffering_in(sock_f_in); |
| 1829 | io_multiplexing_in = 1; |
| 1830 | } |
| 1831 | |
| 1832 | /** Write an message to the multiplexed data stream. */ |
| 1833 | int io_multiplex_write(enum msgcode code, const char *buf, size_t len, int convert) |
| 1834 | { |
| 1835 | if (!io_multiplexing_out) |
| 1836 | return 0; |
| 1837 | io_flush(NORMAL_FLUSH); |
| 1838 | stats.total_written += (len+4); |
| 1839 | mplex_write(sock_f_out, code, buf, len, convert); |
| 1840 | return 1; |
| 1841 | } |
| 1842 | |
| 1843 | void io_end_multiplex_in(void) |
| 1844 | { |
| 1845 | io_multiplexing_in = 0; |
| 1846 | io_end_buffering_in(); |
| 1847 | } |
| 1848 | |
| 1849 | /** Stop output multiplexing. */ |
| 1850 | void io_end_multiplex_out(void) |
| 1851 | { |
| 1852 | io_multiplexing_out = 0; |
| 1853 | io_end_buffering_out(); |
| 1854 | } |
| 1855 | |
| 1856 | void start_write_batch(int fd) |
| 1857 | { |
| 1858 | /* Some communication has already taken place, but we don't |
| 1859 | * enable batch writing until here so that we can write a |
| 1860 | * canonical record of the communication even though the |
| 1861 | * actual communication so far depends on whether a daemon |
| 1862 | * is involved. */ |
| 1863 | write_int(batch_fd, protocol_version); |
| 1864 | if (protocol_version >= 30) |
| 1865 | write_byte(batch_fd, inc_recurse); |
| 1866 | write_int(batch_fd, checksum_seed); |
| 1867 | |
| 1868 | if (am_sender) |
| 1869 | write_batch_monitor_out = fd; |
| 1870 | else |
| 1871 | write_batch_monitor_in = fd; |
| 1872 | } |
| 1873 | |
| 1874 | void stop_write_batch(void) |
| 1875 | { |
| 1876 | write_batch_monitor_out = -1; |
| 1877 | write_batch_monitor_in = -1; |
| 1878 | } |