1 /*- 2 * Copyright (c) 2003-2009 Tim Kientzle 3 * Copyright (c) 2010-2012 Michihiro NAKAJIMA 4 * All rights reserved. 5 * 6 * Redistribution and use in source and binary forms, with or without 7 * modification, are permitted provided that the following conditions 8 * are met: 9 * 1. Redistributions of source code must retain the above copyright 10 * notice, this list of conditions and the following disclaimer 11 * in this position and unchanged. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) ``AS IS'' AND ANY EXPRESS OR 17 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 18 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 19 * IN NO EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY DIRECT, INDIRECT, 20 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 21 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 22 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 23 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 24 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 25 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 26 */ 27 28 /* This is the tree-walking code for POSIX systems. */ 29 #if !defined(_WIN32) || defined(__CYGWIN__) 30 31 #include "archive_platform.h" 32 __FBSDID("$FreeBSD$"); 33 34 #ifdef HAVE_SYS_PARAM_H 35 #include <sys/param.h> 36 #endif 37 #ifdef HAVE_SYS_MOUNT_H 38 #include <sys/mount.h> 39 #endif 40 #ifdef HAVE_SYS_STAT_H 41 #include <sys/stat.h> 42 #endif 43 #ifdef HAVE_SYS_STATFS_H 44 #include <sys/statfs.h> 45 #endif 46 #ifdef HAVE_SYS_STATVFS_H 47 #include <sys/statvfs.h> 48 #endif 49 #ifdef HAVE_SYS_TIME_H 50 #include <sys/time.h> 51 #endif 52 #ifdef HAVE_LINUX_MAGIC_H 53 #include <linux/magic.h> 54 #endif 55 #ifdef HAVE_LINUX_FS_H 56 #include <linux/fs.h> 57 #endif 58 /* 59 * Some Linux distributions have both linux/ext2_fs.h and ext2fs/ext2_fs.h. 60 * As the include guards don't agree, the order of include is important. 61 */ 62 #ifdef HAVE_LINUX_EXT2_FS_H 63 #include <linux/ext2_fs.h> /* for Linux file flags */ 64 #endif 65 #if defined(HAVE_EXT2FS_EXT2_FS_H) && !defined(__CYGWIN__) 66 #include <ext2fs/ext2_fs.h> /* Linux file flags, broken on Cygwin */ 67 #endif 68 #ifdef HAVE_DIRECT_H 69 #include <direct.h> 70 #endif 71 #ifdef HAVE_DIRENT_H 72 #include <dirent.h> 73 #endif 74 #ifdef HAVE_ERRNO_H 75 #include <errno.h> 76 #endif 77 #ifdef HAVE_FCNTL_H 78 #include <fcntl.h> 79 #endif 80 #ifdef HAVE_LIMITS_H 81 #include <limits.h> 82 #endif 83 #ifdef HAVE_STDLIB_H 84 #include <stdlib.h> 85 #endif 86 #ifdef HAVE_STRING_H 87 #include <string.h> 88 #endif 89 #ifdef HAVE_UNISTD_H 90 #include <unistd.h> 91 #endif 92 #ifdef HAVE_SYS_IOCTL_H 93 #include <sys/ioctl.h> 94 #endif 95 96 #include "archive.h" 97 #include "archive_string.h" 98 #include "archive_entry.h" 99 #include "archive_private.h" 100 #include "archive_read_disk_private.h" 101 102 #ifndef HAVE_FCHDIR 103 #error fchdir function required. 104 #endif 105 #ifndef O_BINARY 106 #define O_BINARY 0 107 #endif 108 #ifndef O_CLOEXEC 109 #define O_CLOEXEC 0 110 #endif 111 112 /*- 113 * This is a new directory-walking system that addresses a number 114 * of problems I've had with fts(3). In particular, it has no 115 * pathname-length limits (other than the size of 'int'), handles 116 * deep logical traversals, uses considerably less memory, and has 117 * an opaque interface (easier to modify in the future). 118 * 119 * Internally, it keeps a single list of "tree_entry" items that 120 * represent filesystem objects that require further attention. 121 * Non-directories are not kept in memory: they are pulled from 122 * readdir(), returned to the client, then freed as soon as possible. 123 * Any directory entry to be traversed gets pushed onto the stack. 124 * 125 * There is surprisingly little information that needs to be kept for 126 * each item on the stack. Just the name, depth (represented here as the 127 * string length of the parent directory's pathname), and some markers 128 * indicating how to get back to the parent (via chdir("..") for a 129 * regular dir or via fchdir(2) for a symlink). 130 */ 131 /* 132 * TODO: 133 * 1) Loop checking. 134 * 3) Arbitrary logical traversals by closing/reopening intermediate fds. 135 */ 136 137 struct restore_time { 138 const char *name; 139 time_t mtime; 140 long mtime_nsec; 141 time_t atime; 142 long atime_nsec; 143 mode_t filetype; 144 int noatime; 145 }; 146 147 struct tree_entry { 148 int depth; 149 struct tree_entry *next; 150 struct tree_entry *parent; 151 struct archive_string name; 152 size_t dirname_length; 153 int64_t dev; 154 int64_t ino; 155 int flags; 156 int filesystem_id; 157 /* How to return back to the parent of a symlink. */ 158 int symlink_parent_fd; 159 /* How to restore time of a directory. */ 160 struct restore_time restore_time; 161 }; 162 163 struct filesystem { 164 int64_t dev; 165 int synthetic; 166 int remote; 167 int noatime; 168 #if defined(HAVE_READDIR_R) 169 size_t name_max; 170 #endif 171 long incr_xfer_size; 172 long max_xfer_size; 173 long min_xfer_size; 174 long xfer_align; 175 176 /* 177 * Buffer used for reading file contents. 178 */ 179 /* Exactly allocated memory pointer. */ 180 unsigned char *allocation_ptr; 181 /* Pointer adjusted to the filesystem alignment . */ 182 unsigned char *buff; 183 size_t buff_size; 184 }; 185 186 /* Definitions for tree_entry.flags bitmap. */ 187 #define isDir 1 /* This entry is a regular directory. */ 188 #define isDirLink 2 /* This entry is a symbolic link to a directory. */ 189 #define needsFirstVisit 4 /* This is an initial entry. */ 190 #define needsDescent 8 /* This entry needs to be previsited. */ 191 #define needsOpen 16 /* This is a directory that needs to be opened. */ 192 #define needsAscent 32 /* This entry needs to be postvisited. */ 193 194 /* 195 * Local data for this package. 196 */ 197 struct tree { 198 struct tree_entry *stack; 199 struct tree_entry *current; 200 DIR *d; 201 #define INVALID_DIR_HANDLE NULL 202 struct dirent *de; 203 #if defined(HAVE_READDIR_R) 204 struct dirent *dirent; 205 size_t dirent_allocated; 206 #endif 207 int flags; 208 int visit_type; 209 /* Error code from last failed operation. */ 210 int tree_errno; 211 212 /* Dynamically-sized buffer for holding path */ 213 struct archive_string path; 214 215 /* Last path element */ 216 const char *basename; 217 /* Leading dir length */ 218 size_t dirname_length; 219 220 int depth; 221 int openCount; 222 int maxOpenCount; 223 int initial_dir_fd; 224 int working_dir_fd; 225 226 struct stat lst; 227 struct stat st; 228 int descend; 229 int nlink; 230 /* How to restore time of a file. */ 231 struct restore_time restore_time; 232 233 struct entry_sparse { 234 int64_t length; 235 int64_t offset; 236 } *sparse_list, *current_sparse; 237 int sparse_count; 238 int sparse_list_size; 239 240 char initial_symlink_mode; 241 char symlink_mode; 242 struct filesystem *current_filesystem; 243 struct filesystem *filesystem_table; 244 int initial_filesystem_id; 245 int current_filesystem_id; 246 int max_filesystem_id; 247 int allocated_filesytem; 248 249 int entry_fd; 250 int entry_eof; 251 int64_t entry_remaining_bytes; 252 int64_t entry_total; 253 unsigned char *entry_buff; 254 size_t entry_buff_size; 255 }; 256 257 /* Definitions for tree.flags bitmap. */ 258 #define hasStat 16 /* The st entry is valid. */ 259 #define hasLstat 32 /* The lst entry is valid. */ 260 #define onWorkingDir 64 /* We are on the working dir where we are 261 * reading directory entry at this time. */ 262 #define needsRestoreTimes 128 263 #define onInitialDir 256 /* We are on the initial dir. */ 264 265 static int 266 tree_dir_next_posix(struct tree *t); 267 268 #ifdef HAVE_DIRENT_D_NAMLEN 269 /* BSD extension; avoids need for a strlen() call. */ 270 #define D_NAMELEN(dp) (dp)->d_namlen 271 #else 272 #define D_NAMELEN(dp) (strlen((dp)->d_name)) 273 #endif 274 275 /* Initiate/terminate a tree traversal. */ 276 static struct tree *tree_open(const char *, int, int); 277 static struct tree *tree_reopen(struct tree *, const char *, int); 278 static void tree_close(struct tree *); 279 static void tree_free(struct tree *); 280 static void tree_push(struct tree *, const char *, int, int64_t, int64_t, 281 struct restore_time *); 282 static int tree_enter_initial_dir(struct tree *); 283 static int tree_enter_working_dir(struct tree *); 284 static int tree_current_dir_fd(struct tree *); 285 286 /* 287 * tree_next() returns Zero if there is no next entry, non-zero if 288 * there is. Note that directories are visited three times. 289 * Directories are always visited first as part of enumerating their 290 * parent; that is a "regular" visit. If tree_descend() is invoked at 291 * that time, the directory is added to a work list and will 292 * subsequently be visited two more times: once just after descending 293 * into the directory ("postdescent") and again just after ascending 294 * back to the parent ("postascent"). 295 * 296 * TREE_ERROR_DIR is returned if the descent failed (because the 297 * directory couldn't be opened, for instance). This is returned 298 * instead of TREE_POSTDESCENT/TREE_POSTASCENT. TREE_ERROR_DIR is not a 299 * fatal error, but it does imply that the relevant subtree won't be 300 * visited. TREE_ERROR_FATAL is returned for an error that left the 301 * traversal completely hosed. Right now, this is only returned for 302 * chdir() failures during ascent. 303 */ 304 #define TREE_REGULAR 1 305 #define TREE_POSTDESCENT 2 306 #define TREE_POSTASCENT 3 307 #define TREE_ERROR_DIR -1 308 #define TREE_ERROR_FATAL -2 309 310 static int tree_next(struct tree *); 311 312 /* 313 * Return information about the current entry. 314 */ 315 316 /* 317 * The current full pathname, length of the full pathname, and a name 318 * that can be used to access the file. Because tree does use chdir 319 * extensively, the access path is almost never the same as the full 320 * current path. 321 * 322 * TODO: On platforms that support it, use openat()-style operations 323 * to eliminate the chdir() operations entirely while still supporting 324 * arbitrarily deep traversals. This makes access_path troublesome to 325 * support, of course, which means we'll need a rich enough interface 326 * that clients can function without it. (In particular, we'll need 327 * tree_current_open() that returns an open file descriptor.) 328 * 329 */ 330 static const char *tree_current_path(struct tree *); 331 static const char *tree_current_access_path(struct tree *); 332 333 /* 334 * Request the lstat() or stat() data for the current path. Since the 335 * tree package needs to do some of this anyway, and caches the 336 * results, you should take advantage of it here if you need it rather 337 * than make a redundant stat() or lstat() call of your own. 338 */ 339 static const struct stat *tree_current_stat(struct tree *); 340 static const struct stat *tree_current_lstat(struct tree *); 341 static int tree_current_is_symblic_link_target(struct tree *); 342 343 /* The following functions use tricks to avoid a certain number of 344 * stat()/lstat() calls. */ 345 /* "is_physical_dir" is equivalent to S_ISDIR(tree_current_lstat()->st_mode) */ 346 static int tree_current_is_physical_dir(struct tree *); 347 /* "is_dir" is equivalent to S_ISDIR(tree_current_stat()->st_mode) */ 348 static int tree_current_is_dir(struct tree *); 349 static int update_current_filesystem(struct archive_read_disk *a, 350 int64_t dev); 351 static int setup_current_filesystem(struct archive_read_disk *); 352 static int tree_target_is_same_as_parent(struct tree *, const struct stat *); 353 354 static int _archive_read_disk_open(struct archive *, const char *); 355 static int _archive_read_free(struct archive *); 356 static int _archive_read_close(struct archive *); 357 static int _archive_read_data_block(struct archive *, 358 const void **, size_t *, int64_t *); 359 static int _archive_read_next_header(struct archive *, 360 struct archive_entry **); 361 static int _archive_read_next_header2(struct archive *, 362 struct archive_entry *); 363 static const char *trivial_lookup_gname(void *, int64_t gid); 364 static const char *trivial_lookup_uname(void *, int64_t uid); 365 static int setup_sparse(struct archive_read_disk *, struct archive_entry *); 366 static int close_and_restore_time(int fd, struct tree *, 367 struct restore_time *); 368 static int open_on_current_dir(struct tree *, const char *, int); 369 static int tree_dup(int); 370 371 372 static struct archive_vtable * 373 archive_read_disk_vtable(void) 374 { 375 static struct archive_vtable av; 376 static int inited = 0; 377 378 if (!inited) { 379 av.archive_free = _archive_read_free; 380 av.archive_close = _archive_read_close; 381 av.archive_read_data_block = _archive_read_data_block; 382 av.archive_read_next_header = _archive_read_next_header; 383 av.archive_read_next_header2 = _archive_read_next_header2; 384 inited = 1; 385 } 386 return (&av); 387 } 388 389 const char * 390 archive_read_disk_gname(struct archive *_a, int64_t gid) 391 { 392 struct archive_read_disk *a = (struct archive_read_disk *)_a; 393 if (ARCHIVE_OK != __archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 394 ARCHIVE_STATE_ANY, "archive_read_disk_gname")) 395 return (NULL); 396 if (a->lookup_gname == NULL) 397 return (NULL); 398 return ((*a->lookup_gname)(a->lookup_gname_data, gid)); 399 } 400 401 const char * 402 archive_read_disk_uname(struct archive *_a, int64_t uid) 403 { 404 struct archive_read_disk *a = (struct archive_read_disk *)_a; 405 if (ARCHIVE_OK != __archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 406 ARCHIVE_STATE_ANY, "archive_read_disk_uname")) 407 return (NULL); 408 if (a->lookup_uname == NULL) 409 return (NULL); 410 return ((*a->lookup_uname)(a->lookup_uname_data, uid)); 411 } 412 413 int 414 archive_read_disk_set_gname_lookup(struct archive *_a, 415 void *private_data, 416 const char * (*lookup_gname)(void *private, int64_t gid), 417 void (*cleanup_gname)(void *private)) 418 { 419 struct archive_read_disk *a = (struct archive_read_disk *)_a; 420 archive_check_magic(&a->archive, ARCHIVE_READ_DISK_MAGIC, 421 ARCHIVE_STATE_ANY, "archive_read_disk_set_gname_lookup"); 422 423 if (a->cleanup_gname != NULL && a->lookup_gname_data != NULL) 424 (a->cleanup_gname)(a->lookup_gname_data); 425 426 a->lookup_gname = lookup_gname; 427 a->cleanup_gname = cleanup_gname; 428 a->lookup_gname_data = private_data; 429 return (ARCHIVE_OK); 430 } 431 432 int 433 archive_read_disk_set_uname_lookup(struct archive *_a, 434 void *private_data, 435 const char * (*lookup_uname)(void *private, int64_t uid), 436 void (*cleanup_uname)(void *private)) 437 { 438 struct archive_read_disk *a = (struct archive_read_disk *)_a; 439 archive_check_magic(&a->archive, ARCHIVE_READ_DISK_MAGIC, 440 ARCHIVE_STATE_ANY, "archive_read_disk_set_uname_lookup"); 441 442 if (a->cleanup_uname != NULL && a->lookup_uname_data != NULL) 443 (a->cleanup_uname)(a->lookup_uname_data); 444 445 a->lookup_uname = lookup_uname; 446 a->cleanup_uname = cleanup_uname; 447 a->lookup_uname_data = private_data; 448 return (ARCHIVE_OK); 449 } 450 451 /* 452 * Create a new archive_read_disk object and initialize it with global state. 453 */ 454 struct archive * 455 archive_read_disk_new(void) 456 { 457 struct archive_read_disk *a; 458 459 a = (struct archive_read_disk *)calloc(1, sizeof(*a)); 460 if (a == NULL) 461 return (NULL); 462 a->archive.magic = ARCHIVE_READ_DISK_MAGIC; 463 a->archive.state = ARCHIVE_STATE_NEW; 464 a->archive.vtable = archive_read_disk_vtable(); 465 a->entry = archive_entry_new2(&a->archive); 466 a->lookup_uname = trivial_lookup_uname; 467 a->lookup_gname = trivial_lookup_gname; 468 a->enable_copyfile = 1; 469 a->traverse_mount_points = 1; 470 a->open_on_current_dir = open_on_current_dir; 471 a->tree_current_dir_fd = tree_current_dir_fd; 472 a->tree_enter_working_dir = tree_enter_working_dir; 473 return (&a->archive); 474 } 475 476 static int 477 _archive_read_free(struct archive *_a) 478 { 479 struct archive_read_disk *a = (struct archive_read_disk *)_a; 480 int r; 481 482 if (_a == NULL) 483 return (ARCHIVE_OK); 484 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 485 ARCHIVE_STATE_ANY | ARCHIVE_STATE_FATAL, "archive_read_free"); 486 487 if (a->archive.state != ARCHIVE_STATE_CLOSED) 488 r = _archive_read_close(&a->archive); 489 else 490 r = ARCHIVE_OK; 491 492 tree_free(a->tree); 493 if (a->cleanup_gname != NULL && a->lookup_gname_data != NULL) 494 (a->cleanup_gname)(a->lookup_gname_data); 495 if (a->cleanup_uname != NULL && a->lookup_uname_data != NULL) 496 (a->cleanup_uname)(a->lookup_uname_data); 497 archive_string_free(&a->archive.error_string); 498 archive_entry_free(a->entry); 499 a->archive.magic = 0; 500 __archive_clean(&a->archive); 501 free(a); 502 return (r); 503 } 504 505 static int 506 _archive_read_close(struct archive *_a) 507 { 508 struct archive_read_disk *a = (struct archive_read_disk *)_a; 509 510 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 511 ARCHIVE_STATE_ANY | ARCHIVE_STATE_FATAL, "archive_read_close"); 512 513 if (a->archive.state != ARCHIVE_STATE_FATAL) 514 a->archive.state = ARCHIVE_STATE_CLOSED; 515 516 tree_close(a->tree); 517 518 return (ARCHIVE_OK); 519 } 520 521 static void 522 setup_symlink_mode(struct archive_read_disk *a, char symlink_mode, 523 int follow_symlinks) 524 { 525 a->symlink_mode = symlink_mode; 526 a->follow_symlinks = follow_symlinks; 527 if (a->tree != NULL) { 528 a->tree->initial_symlink_mode = a->symlink_mode; 529 a->tree->symlink_mode = a->symlink_mode; 530 } 531 } 532 533 int 534 archive_read_disk_set_symlink_logical(struct archive *_a) 535 { 536 struct archive_read_disk *a = (struct archive_read_disk *)_a; 537 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 538 ARCHIVE_STATE_ANY, "archive_read_disk_set_symlink_logical"); 539 setup_symlink_mode(a, 'L', 1); 540 return (ARCHIVE_OK); 541 } 542 543 int 544 archive_read_disk_set_symlink_physical(struct archive *_a) 545 { 546 struct archive_read_disk *a = (struct archive_read_disk *)_a; 547 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 548 ARCHIVE_STATE_ANY, "archive_read_disk_set_symlink_physical"); 549 setup_symlink_mode(a, 'P', 0); 550 return (ARCHIVE_OK); 551 } 552 553 int 554 archive_read_disk_set_symlink_hybrid(struct archive *_a) 555 { 556 struct archive_read_disk *a = (struct archive_read_disk *)_a; 557 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 558 ARCHIVE_STATE_ANY, "archive_read_disk_set_symlink_hybrid"); 559 setup_symlink_mode(a, 'H', 1);/* Follow symlinks initially. */ 560 return (ARCHIVE_OK); 561 } 562 563 int 564 archive_read_disk_set_atime_restored(struct archive *_a) 565 { 566 #ifndef HAVE_UTIMES 567 static int warning_done = 0; 568 #endif 569 struct archive_read_disk *a = (struct archive_read_disk *)_a; 570 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 571 ARCHIVE_STATE_ANY, "archive_read_disk_restore_atime"); 572 #ifdef HAVE_UTIMES 573 a->restore_time = 1; 574 if (a->tree != NULL) 575 a->tree->flags |= needsRestoreTimes; 576 return (ARCHIVE_OK); 577 #else 578 if (warning_done) 579 /* Warning was already emitted; suppress further warnings. */ 580 return (ARCHIVE_OK); 581 582 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 583 "Cannot restore access time on this system"); 584 warning_done = 1; 585 return (ARCHIVE_WARN); 586 #endif 587 } 588 589 int 590 archive_read_disk_set_behavior(struct archive *_a, int flags) 591 { 592 struct archive_read_disk *a = (struct archive_read_disk *)_a; 593 int r = ARCHIVE_OK; 594 595 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 596 ARCHIVE_STATE_ANY, "archive_read_disk_honor_nodump"); 597 598 if (flags & ARCHIVE_READDISK_RESTORE_ATIME) 599 r = archive_read_disk_set_atime_restored(_a); 600 else { 601 a->restore_time = 0; 602 if (a->tree != NULL) 603 a->tree->flags &= ~needsRestoreTimes; 604 } 605 if (flags & ARCHIVE_READDISK_HONOR_NODUMP) 606 a->honor_nodump = 1; 607 else 608 a->honor_nodump = 0; 609 if (flags & ARCHIVE_READDISK_MAC_COPYFILE) 610 a->enable_copyfile = 1; 611 else 612 a->enable_copyfile = 0; 613 if (flags & ARCHIVE_READDISK_NO_TRAVERSE_MOUNTS) 614 a->traverse_mount_points = 0; 615 else 616 a->traverse_mount_points = 1; 617 if (flags & ARCHIVE_READDISK_NO_XATTR) 618 a->suppress_xattr = 1; 619 else 620 a->suppress_xattr = 0; 621 return (r); 622 } 623 624 /* 625 * Trivial implementations of gname/uname lookup functions. 626 * These are normally overridden by the client, but these stub 627 * versions ensure that we always have something that works. 628 */ 629 static const char * 630 trivial_lookup_gname(void *private_data, int64_t gid) 631 { 632 (void)private_data; /* UNUSED */ 633 (void)gid; /* UNUSED */ 634 return (NULL); 635 } 636 637 static const char * 638 trivial_lookup_uname(void *private_data, int64_t uid) 639 { 640 (void)private_data; /* UNUSED */ 641 (void)uid; /* UNUSED */ 642 return (NULL); 643 } 644 645 /* 646 * Allocate memory for the reading buffer adjusted to the filesystem 647 * alignment. 648 */ 649 static int 650 setup_suitable_read_buffer(struct archive_read_disk *a) 651 { 652 struct tree *t = a->tree; 653 struct filesystem *cf = t->current_filesystem; 654 size_t asize; 655 size_t s; 656 657 if (cf->allocation_ptr == NULL) { 658 /* If we couldn't get a filesystem alignment, 659 * we use 4096 as default value but we won't use 660 * O_DIRECT to open() and openat() operations. */ 661 long xfer_align = (cf->xfer_align == -1)?4096:cf->xfer_align; 662 663 if (cf->max_xfer_size != -1) 664 asize = cf->max_xfer_size + xfer_align; 665 else { 666 long incr = cf->incr_xfer_size; 667 /* Some platform does not set a proper value to 668 * incr_xfer_size.*/ 669 if (incr < 0) 670 incr = cf->min_xfer_size; 671 if (cf->min_xfer_size < 0) { 672 incr = xfer_align; 673 asize = xfer_align; 674 } else 675 asize = cf->min_xfer_size; 676 677 /* Increase a buffer size up to 64K bytes in 678 * a proper incremant size. */ 679 while (asize < 1024*64) 680 asize += incr; 681 /* Take a margin to adjust to the filesystem 682 * alignment. */ 683 asize += xfer_align; 684 } 685 cf->allocation_ptr = malloc(asize); 686 if (cf->allocation_ptr == NULL) { 687 archive_set_error(&a->archive, ENOMEM, 688 "Couldn't allocate memory"); 689 a->archive.state = ARCHIVE_STATE_FATAL; 690 return (ARCHIVE_FATAL); 691 } 692 693 /* 694 * Calculate proper address for the filesystem. 695 */ 696 s = (uintptr_t)cf->allocation_ptr; 697 s %= xfer_align; 698 if (s > 0) 699 s = xfer_align - s; 700 701 /* 702 * Set a read buffer pointer in the proper alignment of 703 * the current filesystem. 704 */ 705 cf->buff = cf->allocation_ptr + s; 706 cf->buff_size = asize - xfer_align; 707 } 708 return (ARCHIVE_OK); 709 } 710 711 static int 712 _archive_read_data_block(struct archive *_a, const void **buff, 713 size_t *size, int64_t *offset) 714 { 715 struct archive_read_disk *a = (struct archive_read_disk *)_a; 716 struct tree *t = a->tree; 717 int r; 718 ssize_t bytes; 719 size_t buffbytes; 720 int empty_sparse_region = 0; 721 722 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, ARCHIVE_STATE_DATA, 723 "archive_read_data_block"); 724 725 if (t->entry_eof || t->entry_remaining_bytes <= 0) { 726 r = ARCHIVE_EOF; 727 goto abort_read_data; 728 } 729 730 /* 731 * Open the current file. 732 */ 733 if (t->entry_fd < 0) { 734 int flags = O_RDONLY | O_BINARY | O_CLOEXEC; 735 736 /* 737 * Eliminate or reduce cache effects if we can. 738 * 739 * Carefully consider this to be enabled. 740 */ 741 #if defined(O_DIRECT) && 0/* Disabled for now */ 742 if (t->current_filesystem->xfer_align != -1 && 743 t->nlink == 1) 744 flags |= O_DIRECT; 745 #endif 746 #if defined(O_NOATIME) 747 /* 748 * Linux has O_NOATIME flag; use it if we need. 749 */ 750 if ((t->flags & needsRestoreTimes) != 0 && 751 t->restore_time.noatime == 0) 752 flags |= O_NOATIME; 753 do { 754 #endif 755 t->entry_fd = open_on_current_dir(t, 756 tree_current_access_path(t), flags); 757 __archive_ensure_cloexec_flag(t->entry_fd); 758 #if defined(O_NOATIME) 759 /* 760 * When we did open the file with O_NOATIME flag, 761 * if successful, set 1 to t->restore_time.noatime 762 * not to restore an atime of the file later. 763 * if failed by EPERM, retry it without O_NOATIME flag. 764 */ 765 if (flags & O_NOATIME) { 766 if (t->entry_fd >= 0) 767 t->restore_time.noatime = 1; 768 else if (errno == EPERM) { 769 flags &= ~O_NOATIME; 770 continue; 771 } 772 } 773 } while (0); 774 #endif 775 if (t->entry_fd < 0) { 776 archive_set_error(&a->archive, errno, 777 "Couldn't open %s", tree_current_path(t)); 778 r = ARCHIVE_FAILED; 779 tree_enter_initial_dir(t); 780 goto abort_read_data; 781 } 782 tree_enter_initial_dir(t); 783 } 784 785 /* 786 * Allocate read buffer if not allocated. 787 */ 788 if (t->current_filesystem->allocation_ptr == NULL) { 789 r = setup_suitable_read_buffer(a); 790 if (r != ARCHIVE_OK) { 791 a->archive.state = ARCHIVE_STATE_FATAL; 792 goto abort_read_data; 793 } 794 } 795 t->entry_buff = t->current_filesystem->buff; 796 t->entry_buff_size = t->current_filesystem->buff_size; 797 798 buffbytes = t->entry_buff_size; 799 if ((int64_t)buffbytes > t->current_sparse->length) 800 buffbytes = t->current_sparse->length; 801 802 if (t->current_sparse->length == 0) 803 empty_sparse_region = 1; 804 805 /* 806 * Skip hole. 807 * TODO: Should we consider t->current_filesystem->xfer_align? 808 */ 809 if (t->current_sparse->offset > t->entry_total) { 810 if (lseek(t->entry_fd, 811 (off_t)t->current_sparse->offset, SEEK_SET) < 0) { 812 archive_set_error(&a->archive, errno, "Seek error"); 813 r = ARCHIVE_FATAL; 814 a->archive.state = ARCHIVE_STATE_FATAL; 815 goto abort_read_data; 816 } 817 bytes = t->current_sparse->offset - t->entry_total; 818 t->entry_remaining_bytes -= bytes; 819 t->entry_total += bytes; 820 } 821 822 /* 823 * Read file contents. 824 */ 825 if (buffbytes > 0) { 826 bytes = read(t->entry_fd, t->entry_buff, buffbytes); 827 if (bytes < 0) { 828 archive_set_error(&a->archive, errno, "Read error"); 829 r = ARCHIVE_FATAL; 830 a->archive.state = ARCHIVE_STATE_FATAL; 831 goto abort_read_data; 832 } 833 } else 834 bytes = 0; 835 /* 836 * Return an EOF unless we've read a leading empty sparse region, which 837 * is used to represent fully-sparse files. 838 */ 839 if (bytes == 0 && !empty_sparse_region) { 840 /* Get EOF */ 841 t->entry_eof = 1; 842 r = ARCHIVE_EOF; 843 goto abort_read_data; 844 } 845 *buff = t->entry_buff; 846 *size = bytes; 847 *offset = t->entry_total; 848 t->entry_total += bytes; 849 t->entry_remaining_bytes -= bytes; 850 if (t->entry_remaining_bytes == 0) { 851 /* Close the current file descriptor */ 852 close_and_restore_time(t->entry_fd, t, &t->restore_time); 853 t->entry_fd = -1; 854 t->entry_eof = 1; 855 } 856 t->current_sparse->offset += bytes; 857 t->current_sparse->length -= bytes; 858 if (t->current_sparse->length == 0 && !t->entry_eof) 859 t->current_sparse++; 860 return (ARCHIVE_OK); 861 862 abort_read_data: 863 *buff = NULL; 864 *size = 0; 865 *offset = t->entry_total; 866 if (t->entry_fd >= 0) { 867 /* Close the current file descriptor */ 868 close_and_restore_time(t->entry_fd, t, &t->restore_time); 869 t->entry_fd = -1; 870 } 871 return (r); 872 } 873 874 static int 875 next_entry(struct archive_read_disk *a, struct tree *t, 876 struct archive_entry *entry) 877 { 878 const struct stat *st; /* info to use for this entry */ 879 const struct stat *lst;/* lstat() information */ 880 const char *name; 881 int descend, r; 882 883 st = NULL; 884 lst = NULL; 885 t->descend = 0; 886 do { 887 switch (tree_next(t)) { 888 case TREE_ERROR_FATAL: 889 archive_set_error(&a->archive, t->tree_errno, 890 "%s: Unable to continue traversing directory tree", 891 tree_current_path(t)); 892 a->archive.state = ARCHIVE_STATE_FATAL; 893 tree_enter_initial_dir(t); 894 return (ARCHIVE_FATAL); 895 case TREE_ERROR_DIR: 896 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 897 "%s: Couldn't visit directory", 898 tree_current_path(t)); 899 tree_enter_initial_dir(t); 900 return (ARCHIVE_FAILED); 901 case 0: 902 tree_enter_initial_dir(t); 903 return (ARCHIVE_EOF); 904 case TREE_POSTDESCENT: 905 case TREE_POSTASCENT: 906 break; 907 case TREE_REGULAR: 908 lst = tree_current_lstat(t); 909 if (lst == NULL) { 910 archive_set_error(&a->archive, errno, 911 "%s: Cannot stat", 912 tree_current_path(t)); 913 tree_enter_initial_dir(t); 914 return (ARCHIVE_FAILED); 915 } 916 break; 917 } 918 } while (lst == NULL); 919 920 #ifdef __APPLE__ 921 if (a->enable_copyfile) { 922 /* If we're using copyfile(), ignore "._XXX" files. */ 923 const char *bname = strrchr(tree_current_path(t), '/'); 924 if (bname == NULL) 925 bname = tree_current_path(t); 926 else 927 ++bname; 928 if (bname[0] == '.' && bname[1] == '_') 929 return (ARCHIVE_RETRY); 930 } 931 #endif 932 933 archive_entry_copy_pathname(entry, tree_current_path(t)); 934 /* 935 * Perform path matching. 936 */ 937 if (a->matching) { 938 r = archive_match_path_excluded(a->matching, entry); 939 if (r < 0) { 940 archive_set_error(&(a->archive), errno, 941 "Faild : %s", archive_error_string(a->matching)); 942 return (r); 943 } 944 if (r) { 945 if (a->excluded_cb_func) 946 a->excluded_cb_func(&(a->archive), 947 a->excluded_cb_data, entry); 948 return (ARCHIVE_RETRY); 949 } 950 } 951 952 /* 953 * Distinguish 'L'/'P'/'H' symlink following. 954 */ 955 switch(t->symlink_mode) { 956 case 'H': 957 /* 'H': After the first item, rest like 'P'. */ 958 t->symlink_mode = 'P'; 959 /* 'H': First item (from command line) like 'L'. */ 960 /* FALLTHROUGH */ 961 case 'L': 962 /* 'L': Do descend through a symlink to dir. */ 963 descend = tree_current_is_dir(t); 964 /* 'L': Follow symlinks to files. */ 965 a->symlink_mode = 'L'; 966 a->follow_symlinks = 1; 967 /* 'L': Archive symlinks as targets, if we can. */ 968 st = tree_current_stat(t); 969 if (st != NULL && !tree_target_is_same_as_parent(t, st)) 970 break; 971 /* If stat fails, we have a broken symlink; 972 * in that case, don't follow the link. */ 973 /* FALLTHROUGH */ 974 default: 975 /* 'P': Don't descend through a symlink to dir. */ 976 descend = tree_current_is_physical_dir(t); 977 /* 'P': Don't follow symlinks to files. */ 978 a->symlink_mode = 'P'; 979 a->follow_symlinks = 0; 980 /* 'P': Archive symlinks as symlinks. */ 981 st = lst; 982 break; 983 } 984 985 if (update_current_filesystem(a, st->st_dev) != ARCHIVE_OK) { 986 a->archive.state = ARCHIVE_STATE_FATAL; 987 tree_enter_initial_dir(t); 988 return (ARCHIVE_FATAL); 989 } 990 if (t->initial_filesystem_id == -1) 991 t->initial_filesystem_id = t->current_filesystem_id; 992 if (!a->traverse_mount_points) { 993 if (t->initial_filesystem_id != t->current_filesystem_id) 994 descend = 0; 995 } 996 t->descend = descend; 997 998 /* 999 * Honor nodump flag. 1000 * If the file is marked with nodump flag, do not return this entry. 1001 */ 1002 if (a->honor_nodump) { 1003 #if defined(HAVE_STRUCT_STAT_ST_FLAGS) && defined(UF_NODUMP) 1004 if (st->st_flags & UF_NODUMP) 1005 return (ARCHIVE_RETRY); 1006 #elif defined(EXT2_IOC_GETFLAGS) && defined(EXT2_NODUMP_FL) &&\ 1007 defined(HAVE_WORKING_EXT2_IOC_GETFLAGS) 1008 if (S_ISREG(st->st_mode) || S_ISDIR(st->st_mode)) { 1009 int stflags; 1010 1011 t->entry_fd = open_on_current_dir(t, 1012 tree_current_access_path(t), 1013 O_RDONLY | O_NONBLOCK | O_CLOEXEC); 1014 __archive_ensure_cloexec_flag(t->entry_fd); 1015 if (t->entry_fd >= 0) { 1016 r = ioctl(t->entry_fd, EXT2_IOC_GETFLAGS, 1017 &stflags); 1018 if (r == 0 && (stflags & EXT2_NODUMP_FL) != 0) 1019 return (ARCHIVE_RETRY); 1020 } 1021 } 1022 #endif 1023 } 1024 1025 archive_entry_copy_stat(entry, st); 1026 1027 /* Save the times to be restored. This must be in before 1028 * calling archive_read_disk_descend() or any chance of it, 1029 * especially, invokng a callback. */ 1030 t->restore_time.mtime = archive_entry_mtime(entry); 1031 t->restore_time.mtime_nsec = archive_entry_mtime_nsec(entry); 1032 t->restore_time.atime = archive_entry_atime(entry); 1033 t->restore_time.atime_nsec = archive_entry_atime_nsec(entry); 1034 t->restore_time.filetype = archive_entry_filetype(entry); 1035 t->restore_time.noatime = t->current_filesystem->noatime; 1036 1037 /* 1038 * Perform time matching. 1039 */ 1040 if (a->matching) { 1041 r = archive_match_time_excluded(a->matching, entry); 1042 if (r < 0) { 1043 archive_set_error(&(a->archive), errno, 1044 "Faild : %s", archive_error_string(a->matching)); 1045 return (r); 1046 } 1047 if (r) { 1048 if (a->excluded_cb_func) 1049 a->excluded_cb_func(&(a->archive), 1050 a->excluded_cb_data, entry); 1051 return (ARCHIVE_RETRY); 1052 } 1053 } 1054 1055 /* Lookup uname/gname */ 1056 name = archive_read_disk_uname(&(a->archive), archive_entry_uid(entry)); 1057 if (name != NULL) 1058 archive_entry_copy_uname(entry, name); 1059 name = archive_read_disk_gname(&(a->archive), archive_entry_gid(entry)); 1060 if (name != NULL) 1061 archive_entry_copy_gname(entry, name); 1062 1063 /* 1064 * Perform owner matching. 1065 */ 1066 if (a->matching) { 1067 r = archive_match_owner_excluded(a->matching, entry); 1068 if (r < 0) { 1069 archive_set_error(&(a->archive), errno, 1070 "Faild : %s", archive_error_string(a->matching)); 1071 return (r); 1072 } 1073 if (r) { 1074 if (a->excluded_cb_func) 1075 a->excluded_cb_func(&(a->archive), 1076 a->excluded_cb_data, entry); 1077 return (ARCHIVE_RETRY); 1078 } 1079 } 1080 1081 /* 1082 * Invoke a meta data filter callback. 1083 */ 1084 if (a->metadata_filter_func) { 1085 if (!a->metadata_filter_func(&(a->archive), 1086 a->metadata_filter_data, entry)) 1087 return (ARCHIVE_RETRY); 1088 } 1089 1090 /* 1091 * Populate the archive_entry with metadata from the disk. 1092 */ 1093 archive_entry_copy_sourcepath(entry, tree_current_access_path(t)); 1094 r = archive_read_disk_entry_from_file(&(a->archive), entry, 1095 t->entry_fd, st); 1096 1097 return (r); 1098 } 1099 1100 static int 1101 _archive_read_next_header(struct archive *_a, struct archive_entry **entryp) 1102 { 1103 int ret; 1104 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1105 *entryp = NULL; 1106 ret = _archive_read_next_header2(_a, a->entry); 1107 *entryp = a->entry; 1108 return ret; 1109 } 1110 1111 static int 1112 _archive_read_next_header2(struct archive *_a, struct archive_entry *entry) 1113 { 1114 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1115 struct tree *t; 1116 int r; 1117 1118 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 1119 ARCHIVE_STATE_HEADER | ARCHIVE_STATE_DATA, 1120 "archive_read_next_header2"); 1121 1122 t = a->tree; 1123 if (t->entry_fd >= 0) { 1124 close_and_restore_time(t->entry_fd, t, &t->restore_time); 1125 t->entry_fd = -1; 1126 } 1127 1128 for (;;) { 1129 r = next_entry(a, t, entry); 1130 if (t->entry_fd >= 0) { 1131 close(t->entry_fd); 1132 t->entry_fd = -1; 1133 } 1134 1135 if (r == ARCHIVE_RETRY) { 1136 archive_entry_clear(entry); 1137 continue; 1138 } 1139 break; 1140 } 1141 1142 /* Return to the initial directory. */ 1143 tree_enter_initial_dir(t); 1144 1145 /* 1146 * EOF and FATAL are persistent at this layer. By 1147 * modifying the state, we guarantee that future calls to 1148 * read a header or read data will fail. 1149 */ 1150 switch (r) { 1151 case ARCHIVE_EOF: 1152 a->archive.state = ARCHIVE_STATE_EOF; 1153 break; 1154 case ARCHIVE_OK: 1155 case ARCHIVE_WARN: 1156 /* Overwrite the sourcepath based on the initial directory. */ 1157 archive_entry_copy_sourcepath(entry, tree_current_path(t)); 1158 t->entry_total = 0; 1159 if (archive_entry_filetype(entry) == AE_IFREG) { 1160 t->nlink = archive_entry_nlink(entry); 1161 t->entry_remaining_bytes = archive_entry_size(entry); 1162 t->entry_eof = (t->entry_remaining_bytes == 0)? 1: 0; 1163 if (!t->entry_eof && 1164 setup_sparse(a, entry) != ARCHIVE_OK) 1165 return (ARCHIVE_FATAL); 1166 } else { 1167 t->entry_remaining_bytes = 0; 1168 t->entry_eof = 1; 1169 } 1170 a->archive.state = ARCHIVE_STATE_DATA; 1171 break; 1172 case ARCHIVE_RETRY: 1173 break; 1174 case ARCHIVE_FATAL: 1175 a->archive.state = ARCHIVE_STATE_FATAL; 1176 break; 1177 } 1178 1179 __archive_reset_read_data(&a->archive); 1180 return (r); 1181 } 1182 1183 static int 1184 setup_sparse(struct archive_read_disk *a, struct archive_entry *entry) 1185 { 1186 struct tree *t = a->tree; 1187 int64_t length, offset; 1188 int i; 1189 1190 t->sparse_count = archive_entry_sparse_reset(entry); 1191 if (t->sparse_count+1 > t->sparse_list_size) { 1192 free(t->sparse_list); 1193 t->sparse_list_size = t->sparse_count + 1; 1194 t->sparse_list = malloc(sizeof(t->sparse_list[0]) * 1195 t->sparse_list_size); 1196 if (t->sparse_list == NULL) { 1197 t->sparse_list_size = 0; 1198 archive_set_error(&a->archive, ENOMEM, 1199 "Can't allocate data"); 1200 a->archive.state = ARCHIVE_STATE_FATAL; 1201 return (ARCHIVE_FATAL); 1202 } 1203 } 1204 for (i = 0; i < t->sparse_count; i++) { 1205 archive_entry_sparse_next(entry, &offset, &length); 1206 t->sparse_list[i].offset = offset; 1207 t->sparse_list[i].length = length; 1208 } 1209 if (i == 0) { 1210 t->sparse_list[i].offset = 0; 1211 t->sparse_list[i].length = archive_entry_size(entry); 1212 } else { 1213 t->sparse_list[i].offset = archive_entry_size(entry); 1214 t->sparse_list[i].length = 0; 1215 } 1216 t->current_sparse = t->sparse_list; 1217 1218 return (ARCHIVE_OK); 1219 } 1220 1221 int 1222 archive_read_disk_set_matching(struct archive *_a, struct archive *_ma, 1223 void (*_excluded_func)(struct archive *, void *, struct archive_entry *), 1224 void *_client_data) 1225 { 1226 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1227 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 1228 ARCHIVE_STATE_ANY, "archive_read_disk_set_matching"); 1229 a->matching = _ma; 1230 a->excluded_cb_func = _excluded_func; 1231 a->excluded_cb_data = _client_data; 1232 return (ARCHIVE_OK); 1233 } 1234 1235 int 1236 archive_read_disk_set_metadata_filter_callback(struct archive *_a, 1237 int (*_metadata_filter_func)(struct archive *, void *, 1238 struct archive_entry *), void *_client_data) 1239 { 1240 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1241 1242 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, ARCHIVE_STATE_ANY, 1243 "archive_read_disk_set_metadata_filter_callback"); 1244 1245 a->metadata_filter_func = _metadata_filter_func; 1246 a->metadata_filter_data = _client_data; 1247 return (ARCHIVE_OK); 1248 } 1249 1250 int 1251 archive_read_disk_can_descend(struct archive *_a) 1252 { 1253 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1254 struct tree *t = a->tree; 1255 1256 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 1257 ARCHIVE_STATE_HEADER | ARCHIVE_STATE_DATA, 1258 "archive_read_disk_can_descend"); 1259 1260 return (t->visit_type == TREE_REGULAR && t->descend); 1261 } 1262 1263 /* 1264 * Called by the client to mark the directory just returned from 1265 * tree_next() as needing to be visited. 1266 */ 1267 int 1268 archive_read_disk_descend(struct archive *_a) 1269 { 1270 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1271 struct tree *t = a->tree; 1272 1273 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 1274 ARCHIVE_STATE_HEADER | ARCHIVE_STATE_DATA, 1275 "archive_read_disk_descend"); 1276 1277 if (t->visit_type != TREE_REGULAR || !t->descend) 1278 return (ARCHIVE_OK); 1279 1280 if (tree_current_is_physical_dir(t)) { 1281 tree_push(t, t->basename, t->current_filesystem_id, 1282 t->lst.st_dev, t->lst.st_ino, &t->restore_time); 1283 t->stack->flags |= isDir; 1284 } else if (tree_current_is_dir(t)) { 1285 tree_push(t, t->basename, t->current_filesystem_id, 1286 t->st.st_dev, t->st.st_ino, &t->restore_time); 1287 t->stack->flags |= isDirLink; 1288 } 1289 t->descend = 0; 1290 return (ARCHIVE_OK); 1291 } 1292 1293 int 1294 archive_read_disk_open(struct archive *_a, const char *pathname) 1295 { 1296 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1297 1298 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 1299 ARCHIVE_STATE_NEW | ARCHIVE_STATE_CLOSED, 1300 "archive_read_disk_open"); 1301 archive_clear_error(&a->archive); 1302 1303 return (_archive_read_disk_open(_a, pathname)); 1304 } 1305 1306 int 1307 archive_read_disk_open_w(struct archive *_a, const wchar_t *pathname) 1308 { 1309 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1310 struct archive_string path; 1311 int ret; 1312 1313 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 1314 ARCHIVE_STATE_NEW | ARCHIVE_STATE_CLOSED, 1315 "archive_read_disk_open_w"); 1316 archive_clear_error(&a->archive); 1317 1318 /* Make a char string from a wchar_t string. */ 1319 archive_string_init(&path); 1320 if (archive_string_append_from_wcs(&path, pathname, 1321 wcslen(pathname)) != 0) { 1322 if (errno == ENOMEM) 1323 archive_set_error(&a->archive, ENOMEM, 1324 "Can't allocate memory"); 1325 else 1326 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 1327 "Can't convert a path to a char string"); 1328 a->archive.state = ARCHIVE_STATE_FATAL; 1329 ret = ARCHIVE_FATAL; 1330 } else 1331 ret = _archive_read_disk_open(_a, path.s); 1332 1333 archive_string_free(&path); 1334 return (ret); 1335 } 1336 1337 static int 1338 _archive_read_disk_open(struct archive *_a, const char *pathname) 1339 { 1340 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1341 1342 if (a->tree != NULL) 1343 a->tree = tree_reopen(a->tree, pathname, a->restore_time); 1344 else 1345 a->tree = tree_open(pathname, a->symlink_mode, 1346 a->restore_time); 1347 if (a->tree == NULL) { 1348 archive_set_error(&a->archive, ENOMEM, 1349 "Can't allocate tar data"); 1350 a->archive.state = ARCHIVE_STATE_FATAL; 1351 return (ARCHIVE_FATAL); 1352 } 1353 a->archive.state = ARCHIVE_STATE_HEADER; 1354 1355 return (ARCHIVE_OK); 1356 } 1357 1358 /* 1359 * Return a current filesystem ID which is index of the filesystem entry 1360 * you've visited through archive_read_disk. 1361 */ 1362 int 1363 archive_read_disk_current_filesystem(struct archive *_a) 1364 { 1365 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1366 1367 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, ARCHIVE_STATE_DATA, 1368 "archive_read_disk_current_filesystem"); 1369 1370 return (a->tree->current_filesystem_id); 1371 } 1372 1373 static int 1374 update_current_filesystem(struct archive_read_disk *a, int64_t dev) 1375 { 1376 struct tree *t = a->tree; 1377 int i, fid; 1378 1379 if (t->current_filesystem != NULL && 1380 t->current_filesystem->dev == dev) 1381 return (ARCHIVE_OK); 1382 1383 for (i = 0; i < t->max_filesystem_id; i++) { 1384 if (t->filesystem_table[i].dev == dev) { 1385 /* There is the filesytem ID we've already generated. */ 1386 t->current_filesystem_id = i; 1387 t->current_filesystem = &(t->filesystem_table[i]); 1388 return (ARCHIVE_OK); 1389 } 1390 } 1391 1392 /* 1393 * This is the new filesytem which we have to generate a new ID for. 1394 */ 1395 fid = t->max_filesystem_id++; 1396 if (t->max_filesystem_id > t->allocated_filesytem) { 1397 size_t s; 1398 void *p; 1399 1400 s = t->max_filesystem_id * 2; 1401 p = realloc(t->filesystem_table, 1402 s * sizeof(*t->filesystem_table)); 1403 if (p == NULL) { 1404 archive_set_error(&a->archive, ENOMEM, 1405 "Can't allocate tar data"); 1406 return (ARCHIVE_FATAL); 1407 } 1408 t->filesystem_table = (struct filesystem *)p; 1409 t->allocated_filesytem = s; 1410 } 1411 t->current_filesystem_id = fid; 1412 t->current_filesystem = &(t->filesystem_table[fid]); 1413 t->current_filesystem->dev = dev; 1414 t->current_filesystem->allocation_ptr = NULL; 1415 t->current_filesystem->buff = NULL; 1416 1417 /* Setup the current filesystem properties which depend on 1418 * platform specific. */ 1419 return (setup_current_filesystem(a)); 1420 } 1421 1422 /* 1423 * Returns 1 if current filesystem is generated filesystem, 0 if it is not 1424 * or -1 if it is unknown. 1425 */ 1426 int 1427 archive_read_disk_current_filesystem_is_synthetic(struct archive *_a) 1428 { 1429 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1430 1431 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, ARCHIVE_STATE_DATA, 1432 "archive_read_disk_current_filesystem"); 1433 1434 return (a->tree->current_filesystem->synthetic); 1435 } 1436 1437 /* 1438 * Returns 1 if current filesystem is remote filesystem, 0 if it is not 1439 * or -1 if it is unknown. 1440 */ 1441 int 1442 archive_read_disk_current_filesystem_is_remote(struct archive *_a) 1443 { 1444 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1445 1446 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, ARCHIVE_STATE_DATA, 1447 "archive_read_disk_current_filesystem"); 1448 1449 return (a->tree->current_filesystem->remote); 1450 } 1451 1452 #if defined(_PC_REC_INCR_XFER_SIZE) && defined(_PC_REC_MAX_XFER_SIZE) &&\ 1453 defined(_PC_REC_MIN_XFER_SIZE) && defined(_PC_REC_XFER_ALIGN) 1454 static int 1455 get_xfer_size(struct tree *t, int fd, const char *path) 1456 { 1457 t->current_filesystem->xfer_align = -1; 1458 errno = 0; 1459 if (fd >= 0) { 1460 t->current_filesystem->incr_xfer_size = 1461 fpathconf(fd, _PC_REC_INCR_XFER_SIZE); 1462 t->current_filesystem->max_xfer_size = 1463 fpathconf(fd, _PC_REC_MAX_XFER_SIZE); 1464 t->current_filesystem->min_xfer_size = 1465 fpathconf(fd, _PC_REC_MIN_XFER_SIZE); 1466 t->current_filesystem->xfer_align = 1467 fpathconf(fd, _PC_REC_XFER_ALIGN); 1468 } else if (path != NULL) { 1469 t->current_filesystem->incr_xfer_size = 1470 pathconf(path, _PC_REC_INCR_XFER_SIZE); 1471 t->current_filesystem->max_xfer_size = 1472 pathconf(path, _PC_REC_MAX_XFER_SIZE); 1473 t->current_filesystem->min_xfer_size = 1474 pathconf(path, _PC_REC_MIN_XFER_SIZE); 1475 t->current_filesystem->xfer_align = 1476 pathconf(path, _PC_REC_XFER_ALIGN); 1477 } 1478 /* At least we need an alignment size. */ 1479 if (t->current_filesystem->xfer_align == -1) 1480 return ((errno == EINVAL)?1:-1); 1481 else 1482 return (0); 1483 } 1484 #else 1485 static int 1486 get_xfer_size(struct tree *t, int fd, const char *path) 1487 { 1488 (void)t; /* UNUSED */ 1489 (void)fd; /* UNUSED */ 1490 (void)path; /* UNUSED */ 1491 return (1);/* Not supported */ 1492 } 1493 #endif 1494 1495 #if defined(HAVE_STATFS) && defined(HAVE_FSTATFS) && defined(MNT_LOCAL) \ 1496 && !defined(ST_LOCAL) 1497 1498 /* 1499 * Gather current filesystem properties on FreeBSD, OpenBSD and Mac OS X. 1500 */ 1501 static int 1502 setup_current_filesystem(struct archive_read_disk *a) 1503 { 1504 struct tree *t = a->tree; 1505 struct statfs sfs; 1506 #if defined(HAVE_GETVFSBYNAME) && defined(VFCF_SYNTHETIC) 1507 struct vfsconf vfc; 1508 #endif 1509 int r, xr = 0; 1510 #if !defined(HAVE_STRUCT_STATFS_F_NAMEMAX) 1511 long nm; 1512 #endif 1513 1514 t->current_filesystem->synthetic = -1; 1515 t->current_filesystem->remote = -1; 1516 if (tree_current_is_symblic_link_target(t)) { 1517 #if defined(HAVE_OPENAT) 1518 /* 1519 * Get file system statistics on any directory 1520 * where current is. 1521 */ 1522 int fd = openat(tree_current_dir_fd(t), 1523 tree_current_access_path(t), O_RDONLY | O_CLOEXEC); 1524 __archive_ensure_cloexec_flag(fd); 1525 if (fd < 0) { 1526 archive_set_error(&a->archive, errno, 1527 "openat failed"); 1528 return (ARCHIVE_FAILED); 1529 } 1530 r = fstatfs(fd, &sfs); 1531 if (r == 0) 1532 xr = get_xfer_size(t, fd, NULL); 1533 close(fd); 1534 #else 1535 if (tree_enter_working_dir(t) != 0) { 1536 archive_set_error(&a->archive, errno, "fchdir failed"); 1537 return (ARCHIVE_FAILED); 1538 } 1539 r = statfs(tree_current_access_path(t), &sfs); 1540 if (r == 0) 1541 xr = get_xfer_size(t, -1, tree_current_access_path(t)); 1542 #endif 1543 } else { 1544 r = fstatfs(tree_current_dir_fd(t), &sfs); 1545 if (r == 0) 1546 xr = get_xfer_size(t, tree_current_dir_fd(t), NULL); 1547 } 1548 if (r == -1 || xr == -1) { 1549 archive_set_error(&a->archive, errno, "statfs failed"); 1550 return (ARCHIVE_FAILED); 1551 } else if (xr == 1) { 1552 /* pathconf(_PC_REX_*) operations are not supported. */ 1553 t->current_filesystem->xfer_align = sfs.f_bsize; 1554 t->current_filesystem->max_xfer_size = -1; 1555 t->current_filesystem->min_xfer_size = sfs.f_iosize; 1556 t->current_filesystem->incr_xfer_size = sfs.f_iosize; 1557 } 1558 if (sfs.f_flags & MNT_LOCAL) 1559 t->current_filesystem->remote = 0; 1560 else 1561 t->current_filesystem->remote = 1; 1562 1563 #if defined(HAVE_GETVFSBYNAME) && defined(VFCF_SYNTHETIC) 1564 r = getvfsbyname(sfs.f_fstypename, &vfc); 1565 if (r == -1) { 1566 archive_set_error(&a->archive, errno, "getvfsbyname failed"); 1567 return (ARCHIVE_FAILED); 1568 } 1569 if (vfc.vfc_flags & VFCF_SYNTHETIC) 1570 t->current_filesystem->synthetic = 1; 1571 else 1572 t->current_filesystem->synthetic = 0; 1573 #endif 1574 1575 #if defined(MNT_NOATIME) 1576 if (sfs.f_flags & MNT_NOATIME) 1577 t->current_filesystem->noatime = 1; 1578 else 1579 #endif 1580 t->current_filesystem->noatime = 0; 1581 1582 #if defined(HAVE_READDIR_R) 1583 /* Set maximum filename length. */ 1584 #if defined(HAVE_STRUCT_STATFS_F_NAMEMAX) 1585 t->current_filesystem->name_max = sfs.f_namemax; 1586 #else 1587 # if defined(_PC_NAME_MAX) 1588 /* Mac OS X does not have f_namemax in struct statfs. */ 1589 if (tree_current_is_symblic_link_target(t)) { 1590 if (tree_enter_working_dir(t) != 0) { 1591 archive_set_error(&a->archive, errno, "fchdir failed"); 1592 return (ARCHIVE_FAILED); 1593 } 1594 nm = pathconf(tree_current_access_path(t), _PC_NAME_MAX); 1595 } else 1596 nm = fpathconf(tree_current_dir_fd(t), _PC_NAME_MAX); 1597 # else 1598 nm = -1; 1599 # endif 1600 if (nm == -1) 1601 t->current_filesystem->name_max = NAME_MAX; 1602 else 1603 t->current_filesystem->name_max = nm; 1604 #endif 1605 #endif /* HAVE_READDIR_R */ 1606 return (ARCHIVE_OK); 1607 } 1608 1609 #elif (defined(HAVE_STATVFS) || defined(HAVE_FSTATVFS)) && defined(ST_LOCAL) 1610 1611 /* 1612 * Gather current filesystem properties on NetBSD 1613 */ 1614 static int 1615 setup_current_filesystem(struct archive_read_disk *a) 1616 { 1617 struct tree *t = a->tree; 1618 struct statvfs sfs; 1619 int r, xr = 0; 1620 1621 t->current_filesystem->synthetic = -1; 1622 if (tree_enter_working_dir(t) != 0) { 1623 archive_set_error(&a->archive, errno, "fchdir failed"); 1624 return (ARCHIVE_FAILED); 1625 } 1626 if (tree_current_is_symblic_link_target(t)) { 1627 r = statvfs(tree_current_access_path(t), &sfs); 1628 if (r == 0) 1629 xr = get_xfer_size(t, -1, tree_current_access_path(t)); 1630 } else { 1631 #ifdef HAVE_FSTATVFS 1632 r = fstatvfs(tree_current_dir_fd(t), &sfs); 1633 if (r == 0) 1634 xr = get_xfer_size(t, tree_current_dir_fd(t), NULL); 1635 #else 1636 r = statvfs(".", &sfs); 1637 if (r == 0) 1638 xr = get_xfer_size(t, -1, "."); 1639 #endif 1640 } 1641 if (r == -1 || xr == -1) { 1642 t->current_filesystem->remote = -1; 1643 archive_set_error(&a->archive, errno, "statvfs failed"); 1644 return (ARCHIVE_FAILED); 1645 } else if (xr == 1) { 1646 /* Usuall come here unless NetBSD supports _PC_REC_XFER_ALIGN 1647 * for pathconf() function. */ 1648 t->current_filesystem->xfer_align = sfs.f_frsize; 1649 t->current_filesystem->max_xfer_size = -1; 1650 #if defined(HAVE_STRUCT_STATVFS_F_IOSIZE) 1651 t->current_filesystem->min_xfer_size = sfs.f_iosize; 1652 t->current_filesystem->incr_xfer_size = sfs.f_iosize; 1653 #else 1654 t->current_filesystem->min_xfer_size = sfs.f_bsize; 1655 t->current_filesystem->incr_xfer_size = sfs.f_bsize; 1656 #endif 1657 } 1658 if (sfs.f_flag & ST_LOCAL) 1659 t->current_filesystem->remote = 0; 1660 else 1661 t->current_filesystem->remote = 1; 1662 1663 #if defined(ST_NOATIME) 1664 if (sfs.f_flag & ST_NOATIME) 1665 t->current_filesystem->noatime = 1; 1666 else 1667 #endif 1668 t->current_filesystem->noatime = 0; 1669 1670 /* Set maximum filename length. */ 1671 t->current_filesystem->name_max = sfs.f_namemax; 1672 return (ARCHIVE_OK); 1673 } 1674 1675 #elif defined(HAVE_SYS_STATFS_H) && defined(HAVE_LINUX_MAGIC_H) &&\ 1676 defined(HAVE_STATFS) && defined(HAVE_FSTATFS) 1677 /* 1678 * Note: statfs is deprecated since LSB 3.2 1679 */ 1680 1681 #ifndef CIFS_SUPER_MAGIC 1682 #define CIFS_SUPER_MAGIC 0xFF534D42 1683 #endif 1684 #ifndef DEVFS_SUPER_MAGIC 1685 #define DEVFS_SUPER_MAGIC 0x1373 1686 #endif 1687 1688 /* 1689 * Gather current filesystem properties on Linux 1690 */ 1691 static int 1692 setup_current_filesystem(struct archive_read_disk *a) 1693 { 1694 struct tree *t = a->tree; 1695 struct statfs sfs; 1696 #if defined(HAVE_STATVFS) 1697 struct statvfs svfs; 1698 #endif 1699 int r, vr = 0, xr = 0; 1700 1701 if (tree_current_is_symblic_link_target(t)) { 1702 #if defined(HAVE_OPENAT) 1703 /* 1704 * Get file system statistics on any directory 1705 * where current is. 1706 */ 1707 int fd = openat(tree_current_dir_fd(t), 1708 tree_current_access_path(t), O_RDONLY | O_CLOEXEC); 1709 __archive_ensure_cloexec_flag(fd); 1710 if (fd < 0) { 1711 archive_set_error(&a->archive, errno, 1712 "openat failed"); 1713 return (ARCHIVE_FAILED); 1714 } 1715 #if defined(HAVE_FSTATVFS) 1716 vr = fstatvfs(fd, &svfs);/* for f_flag, mount flags */ 1717 #endif 1718 r = fstatfs(fd, &sfs); 1719 if (r == 0) 1720 xr = get_xfer_size(t, fd, NULL); 1721 close(fd); 1722 #else 1723 if (tree_enter_working_dir(t) != 0) { 1724 archive_set_error(&a->archive, errno, "fchdir failed"); 1725 return (ARCHIVE_FAILED); 1726 } 1727 #if defined(HAVE_STATVFS) 1728 vr = statvfs(tree_current_access_path(t), &svfs); 1729 #endif 1730 r = statfs(tree_current_access_path(t), &sfs); 1731 if (r == 0) 1732 xr = get_xfer_size(t, -1, tree_current_access_path(t)); 1733 #endif 1734 } else { 1735 #ifdef HAVE_FSTATFS 1736 #if defined(HAVE_FSTATVFS) 1737 vr = fstatvfs(tree_current_dir_fd(t), &svfs); 1738 #endif 1739 r = fstatfs(tree_current_dir_fd(t), &sfs); 1740 if (r == 0) 1741 xr = get_xfer_size(t, tree_current_dir_fd(t), NULL); 1742 #else 1743 if (tree_enter_working_dir(t) != 0) { 1744 archive_set_error(&a->archive, errno, "fchdir failed"); 1745 return (ARCHIVE_FAILED); 1746 } 1747 #if defined(HAVE_STATVFS) 1748 vr = statvfs(".", &svfs); 1749 #endif 1750 r = statfs(".", &sfs); 1751 if (r == 0) 1752 xr = get_xfer_size(t, -1, "."); 1753 #endif 1754 } 1755 if (r == -1 || xr == -1 || vr == -1) { 1756 t->current_filesystem->synthetic = -1; 1757 t->current_filesystem->remote = -1; 1758 archive_set_error(&a->archive, errno, "statfs failed"); 1759 return (ARCHIVE_FAILED); 1760 } else if (xr == 1) { 1761 /* pathconf(_PC_REX_*) operations are not supported. */ 1762 #if defined(HAVE_STATVFS) 1763 t->current_filesystem->xfer_align = svfs.f_frsize; 1764 t->current_filesystem->max_xfer_size = -1; 1765 t->current_filesystem->min_xfer_size = svfs.f_bsize; 1766 t->current_filesystem->incr_xfer_size = svfs.f_bsize; 1767 #else 1768 t->current_filesystem->xfer_align = sfs.f_frsize; 1769 t->current_filesystem->max_xfer_size = -1; 1770 t->current_filesystem->min_xfer_size = sfs.f_bsize; 1771 t->current_filesystem->incr_xfer_size = sfs.f_bsize; 1772 #endif 1773 } 1774 switch (sfs.f_type) { 1775 case AFS_SUPER_MAGIC: 1776 case CIFS_SUPER_MAGIC: 1777 case CODA_SUPER_MAGIC: 1778 case NCP_SUPER_MAGIC:/* NetWare */ 1779 case NFS_SUPER_MAGIC: 1780 case SMB_SUPER_MAGIC: 1781 t->current_filesystem->remote = 1; 1782 t->current_filesystem->synthetic = 0; 1783 break; 1784 case DEVFS_SUPER_MAGIC: 1785 case PROC_SUPER_MAGIC: 1786 case USBDEVICE_SUPER_MAGIC: 1787 t->current_filesystem->remote = 0; 1788 t->current_filesystem->synthetic = 1; 1789 break; 1790 default: 1791 t->current_filesystem->remote = 0; 1792 t->current_filesystem->synthetic = 0; 1793 break; 1794 } 1795 1796 #if defined(ST_NOATIME) 1797 #if defined(HAVE_STATVFS) 1798 if (svfs.f_flag & ST_NOATIME) 1799 #else 1800 if (sfs.f_flag & ST_NOATIME) 1801 #endif 1802 t->current_filesystem->noatime = 1; 1803 else 1804 #endif 1805 t->current_filesystem->noatime = 0; 1806 1807 #if defined(HAVE_READDIR_R) 1808 /* Set maximum filename length. */ 1809 t->current_filesystem->name_max = sfs.f_namelen; 1810 #endif 1811 return (ARCHIVE_OK); 1812 } 1813 1814 #elif defined(HAVE_SYS_STATVFS_H) &&\ 1815 (defined(HAVE_STATVFS) || defined(HAVE_FSTATVFS)) 1816 1817 /* 1818 * Gather current filesystem properties on other posix platform. 1819 */ 1820 static int 1821 setup_current_filesystem(struct archive_read_disk *a) 1822 { 1823 struct tree *t = a->tree; 1824 struct statvfs sfs; 1825 int r, xr = 0; 1826 1827 t->current_filesystem->synthetic = -1;/* Not supported */ 1828 t->current_filesystem->remote = -1;/* Not supported */ 1829 if (tree_current_is_symblic_link_target(t)) { 1830 #if defined(HAVE_OPENAT) 1831 /* 1832 * Get file system statistics on any directory 1833 * where current is. 1834 */ 1835 int fd = openat(tree_current_dir_fd(t), 1836 tree_current_access_path(t), O_RDONLY | O_CLOEXEC); 1837 __archive_ensure_cloexec_flag(fd); 1838 if (fd < 0) { 1839 archive_set_error(&a->archive, errno, 1840 "openat failed"); 1841 return (ARCHIVE_FAILED); 1842 } 1843 r = fstatvfs(fd, &sfs); 1844 if (r == 0) 1845 xr = get_xfer_size(t, fd, NULL); 1846 close(fd); 1847 #else 1848 if (tree_enter_working_dir(t) != 0) { 1849 archive_set_error(&a->archive, errno, "fchdir failed"); 1850 return (ARCHIVE_FAILED); 1851 } 1852 r = statvfs(tree_current_access_path(t), &sfs); 1853 if (r == 0) 1854 xr = get_xfer_size(t, -1, tree_current_access_path(t)); 1855 #endif 1856 } else { 1857 #ifdef HAVE_FSTATVFS 1858 r = fstatvfs(tree_current_dir_fd(t), &sfs); 1859 if (r == 0) 1860 xr = get_xfer_size(t, tree_current_dir_fd(t), NULL); 1861 #else 1862 if (tree_enter_working_dir(t) != 0) { 1863 archive_set_error(&a->archive, errno, "fchdir failed"); 1864 return (ARCHIVE_FAILED); 1865 } 1866 r = statvfs(".", &sfs); 1867 if (r == 0) 1868 xr = get_xfer_size(t, -1, "."); 1869 #endif 1870 } 1871 if (r == -1 || xr == -1) { 1872 t->current_filesystem->synthetic = -1; 1873 t->current_filesystem->remote = -1; 1874 archive_set_error(&a->archive, errno, "statvfs failed"); 1875 return (ARCHIVE_FAILED); 1876 } else if (xr == 1) { 1877 /* pathconf(_PC_REX_*) operations are not supported. */ 1878 t->current_filesystem->xfer_align = sfs.f_frsize; 1879 t->current_filesystem->max_xfer_size = -1; 1880 t->current_filesystem->min_xfer_size = sfs.f_bsize; 1881 t->current_filesystem->incr_xfer_size = sfs.f_bsize; 1882 } 1883 1884 #if defined(ST_NOATIME) 1885 if (sfs.f_flag & ST_NOATIME) 1886 t->current_filesystem->noatime = 1; 1887 else 1888 #endif 1889 t->current_filesystem->noatime = 0; 1890 1891 #if defined(HAVE_READDIR_R) 1892 /* Set maximum filename length. */ 1893 t->current_filesystem->name_max = sfs.f_namemax; 1894 #endif 1895 return (ARCHIVE_OK); 1896 } 1897 1898 #else 1899 1900 /* 1901 * Generic: Gather current filesystem properties. 1902 * TODO: Is this generic function really needed? 1903 */ 1904 static int 1905 setup_current_filesystem(struct archive_read_disk *a) 1906 { 1907 struct tree *t = a->tree; 1908 #if defined(_PC_NAME_MAX) && defined(HAVE_READDIR_R) 1909 long nm; 1910 #endif 1911 t->current_filesystem->synthetic = -1;/* Not supported */ 1912 t->current_filesystem->remote = -1;/* Not supported */ 1913 t->current_filesystem->noatime = 0; 1914 (void)get_xfer_size(t, -1, ".");/* Dummy call to avoid build error. */ 1915 t->current_filesystem->xfer_align = -1;/* Unknown */ 1916 t->current_filesystem->max_xfer_size = -1; 1917 t->current_filesystem->min_xfer_size = -1; 1918 t->current_filesystem->incr_xfer_size = -1; 1919 1920 #if defined(HAVE_READDIR_R) 1921 /* Set maximum filename length. */ 1922 # if defined(_PC_NAME_MAX) 1923 if (tree_current_is_symblic_link_target(t)) { 1924 if (tree_enter_working_dir(t) != 0) { 1925 archive_set_error(&a->archive, errno, "fchdir failed"); 1926 return (ARCHIVE_FAILED); 1927 } 1928 nm = pathconf(tree_current_access_path(t), _PC_NAME_MAX); 1929 } else 1930 nm = fpathconf(tree_current_dir_fd(t), _PC_NAME_MAX); 1931 if (nm == -1) 1932 # endif /* _PC_NAME_MAX */ 1933 /* 1934 * Some sysmtes (HP-UX or others?) incorrectly defined 1935 * NAME_MAX macro to be a smaller value. 1936 */ 1937 # if defined(NAME_MAX) && NAME_MAX >= 255 1938 t->current_filesystem->name_max = NAME_MAX; 1939 # else 1940 /* No way to get a trusted value of maximum filename 1941 * length. */ 1942 t->current_filesystem->name_max = PATH_MAX; 1943 # endif /* NAME_MAX */ 1944 # if defined(_PC_NAME_MAX) 1945 else 1946 t->current_filesystem->name_max = nm; 1947 # endif /* _PC_NAME_MAX */ 1948 #endif /* HAVE_READDIR_R */ 1949 return (ARCHIVE_OK); 1950 } 1951 1952 #endif 1953 1954 static int 1955 close_and_restore_time(int fd, struct tree *t, struct restore_time *rt) 1956 { 1957 #ifndef HAVE_UTIMES 1958 (void)t; /* UNUSED */ 1959 (void)rt; /* UNUSED */ 1960 return (close(fd)); 1961 #else 1962 #if defined(HAVE_FUTIMENS) && !defined(__CYGWIN__) 1963 struct timespec timespecs[2]; 1964 #endif 1965 struct timeval times[2]; 1966 1967 if ((t->flags & needsRestoreTimes) == 0 || rt->noatime) { 1968 if (fd >= 0) 1969 return (close(fd)); 1970 else 1971 return (0); 1972 } 1973 1974 #if defined(HAVE_FUTIMENS) && !defined(__CYGWIN__) 1975 if (rt->mtime == (time_t)-1) { 1976 timespecs[1].tv_sec = 0; 1977 timespecs[1].tv_nsec = UTIME_OMIT; 1978 } else { 1979 timespecs[1].tv_sec = rt->mtime; 1980 timespecs[1].tv_nsec = rt->mtime_nsec; 1981 } 1982 1983 if (rt->atime == (time_t)-1) { 1984 timespecs[0].tv_sec = 0; 1985 timespecs[0].tv_nsec = UTIME_OMIT; 1986 } else { 1987 timespecs[0].tv_sec = rt->atime; 1988 timespecs[0].tv_nsec = rt->atime_nsec; 1989 } 1990 /* futimens() is defined in POSIX.1-2008. */ 1991 if (futimens(fd, timespecs) == 0) 1992 return (close(fd)); 1993 #endif 1994 1995 times[1].tv_sec = rt->mtime; 1996 times[1].tv_usec = rt->mtime_nsec / 1000; 1997 1998 times[0].tv_sec = rt->atime; 1999 times[0].tv_usec = rt->atime_nsec / 1000; 2000 2001 #if !defined(HAVE_FUTIMENS) && defined(HAVE_FUTIMES) && !defined(__CYGWIN__) 2002 if (futimes(fd, times) == 0) 2003 return (close(fd)); 2004 #endif 2005 close(fd); 2006 #if defined(HAVE_FUTIMESAT) 2007 if (futimesat(tree_current_dir_fd(t), rt->name, times) == 0) 2008 return (0); 2009 #endif 2010 #ifdef HAVE_LUTIMES 2011 if (lutimes(rt->name, times) != 0) 2012 #else 2013 if (AE_IFLNK != rt->filetype && utimes(rt->name, times) != 0) 2014 #endif 2015 return (-1); 2016 #endif 2017 return (0); 2018 } 2019 2020 static int 2021 open_on_current_dir(struct tree *t, const char *path, int flags) 2022 { 2023 #ifdef HAVE_OPENAT 2024 return (openat(tree_current_dir_fd(t), path, flags)); 2025 #else 2026 if (tree_enter_working_dir(t) != 0) 2027 return (-1); 2028 return (open(path, flags)); 2029 #endif 2030 } 2031 2032 static int 2033 tree_dup(int fd) 2034 { 2035 int new_fd; 2036 #ifdef F_DUPFD_CLOEXEC 2037 static volatile int can_dupfd_cloexec = 1; 2038 2039 if (can_dupfd_cloexec) { 2040 new_fd = fcntl(fd, F_DUPFD_CLOEXEC, 0); 2041 if (new_fd != -1) 2042 return (new_fd); 2043 /* Linux 2.6.18 - 2.6.23 declare F_DUPFD_CLOEXEC, 2044 * but it cannot be used. So we have to try dup(). */ 2045 /* We won't try F_DUPFD_CLOEXEC. */ 2046 can_dupfd_cloexec = 0; 2047 } 2048 #endif /* F_DUPFD_CLOEXEC */ 2049 new_fd = dup(fd); 2050 __archive_ensure_cloexec_flag(new_fd); 2051 return (new_fd); 2052 } 2053 2054 /* 2055 * Add a directory path to the current stack. 2056 */ 2057 static void 2058 tree_push(struct tree *t, const char *path, int filesystem_id, 2059 int64_t dev, int64_t ino, struct restore_time *rt) 2060 { 2061 struct tree_entry *te; 2062 2063 te = malloc(sizeof(*te)); 2064 memset(te, 0, sizeof(*te)); 2065 te->next = t->stack; 2066 te->parent = t->current; 2067 if (te->parent) 2068 te->depth = te->parent->depth + 1; 2069 t->stack = te; 2070 archive_string_init(&te->name); 2071 te->symlink_parent_fd = -1; 2072 archive_strcpy(&te->name, path); 2073 te->flags = needsDescent | needsOpen | needsAscent; 2074 te->filesystem_id = filesystem_id; 2075 te->dev = dev; 2076 te->ino = ino; 2077 te->dirname_length = t->dirname_length; 2078 te->restore_time.name = te->name.s; 2079 if (rt != NULL) { 2080 te->restore_time.mtime = rt->mtime; 2081 te->restore_time.mtime_nsec = rt->mtime_nsec; 2082 te->restore_time.atime = rt->atime; 2083 te->restore_time.atime_nsec = rt->atime_nsec; 2084 te->restore_time.filetype = rt->filetype; 2085 te->restore_time.noatime = rt->noatime; 2086 } 2087 } 2088 2089 /* 2090 * Append a name to the current dir path. 2091 */ 2092 static void 2093 tree_append(struct tree *t, const char *name, size_t name_length) 2094 { 2095 size_t size_needed; 2096 2097 t->path.s[t->dirname_length] = '\0'; 2098 t->path.length = t->dirname_length; 2099 /* Strip trailing '/' from name, unless entire name is "/". */ 2100 while (name_length > 1 && name[name_length - 1] == '/') 2101 name_length--; 2102 2103 /* Resize pathname buffer as needed. */ 2104 size_needed = name_length + t->dirname_length + 2; 2105 archive_string_ensure(&t->path, size_needed); 2106 /* Add a separating '/' if it's needed. */ 2107 if (t->dirname_length > 0 && t->path.s[archive_strlen(&t->path)-1] != '/') 2108 archive_strappend_char(&t->path, '/'); 2109 t->basename = t->path.s + archive_strlen(&t->path); 2110 archive_strncat(&t->path, name, name_length); 2111 t->restore_time.name = t->basename; 2112 } 2113 2114 /* 2115 * Open a directory tree for traversal. 2116 */ 2117 static struct tree * 2118 tree_open(const char *path, int symlink_mode, int restore_time) 2119 { 2120 struct tree *t; 2121 2122 if ((t = malloc(sizeof(*t))) == NULL) 2123 return (NULL); 2124 memset(t, 0, sizeof(*t)); 2125 archive_string_init(&t->path); 2126 archive_string_ensure(&t->path, 31); 2127 t->initial_symlink_mode = symlink_mode; 2128 return (tree_reopen(t, path, restore_time)); 2129 } 2130 2131 static struct tree * 2132 tree_reopen(struct tree *t, const char *path, int restore_time) 2133 { 2134 t->flags = (restore_time)?needsRestoreTimes:0; 2135 t->flags |= onInitialDir; 2136 t->visit_type = 0; 2137 t->tree_errno = 0; 2138 t->dirname_length = 0; 2139 t->depth = 0; 2140 t->descend = 0; 2141 t->current = NULL; 2142 t->d = INVALID_DIR_HANDLE; 2143 t->symlink_mode = t->initial_symlink_mode; 2144 archive_string_empty(&t->path); 2145 t->entry_fd = -1; 2146 t->entry_eof = 0; 2147 t->entry_remaining_bytes = 0; 2148 t->initial_filesystem_id = -1; 2149 2150 /* First item is set up a lot like a symlink traversal. */ 2151 tree_push(t, path, 0, 0, 0, NULL); 2152 t->stack->flags = needsFirstVisit; 2153 t->maxOpenCount = t->openCount = 1; 2154 t->initial_dir_fd = open(".", O_RDONLY | O_CLOEXEC); 2155 __archive_ensure_cloexec_flag(t->initial_dir_fd); 2156 t->working_dir_fd = tree_dup(t->initial_dir_fd); 2157 return (t); 2158 } 2159 2160 static int 2161 tree_descent(struct tree *t) 2162 { 2163 int flag, new_fd, r = 0; 2164 2165 t->dirname_length = archive_strlen(&t->path); 2166 flag = O_RDONLY | O_CLOEXEC; 2167 #if defined(O_DIRECTORY) 2168 flag |= O_DIRECTORY; 2169 #endif 2170 new_fd = open_on_current_dir(t, t->stack->name.s, flag); 2171 __archive_ensure_cloexec_flag(new_fd); 2172 if (new_fd < 0) { 2173 t->tree_errno = errno; 2174 r = TREE_ERROR_DIR; 2175 } else { 2176 t->depth++; 2177 /* If it is a link, set up fd for the ascent. */ 2178 if (t->stack->flags & isDirLink) { 2179 t->stack->symlink_parent_fd = t->working_dir_fd; 2180 t->openCount++; 2181 if (t->openCount > t->maxOpenCount) 2182 t->maxOpenCount = t->openCount; 2183 } else 2184 close(t->working_dir_fd); 2185 /* Renew the current working directory. */ 2186 t->working_dir_fd = new_fd; 2187 t->flags &= ~onWorkingDir; 2188 } 2189 return (r); 2190 } 2191 2192 /* 2193 * We've finished a directory; ascend back to the parent. 2194 */ 2195 static int 2196 tree_ascend(struct tree *t) 2197 { 2198 struct tree_entry *te; 2199 int new_fd, r = 0, prev_dir_fd; 2200 2201 te = t->stack; 2202 prev_dir_fd = t->working_dir_fd; 2203 if (te->flags & isDirLink) 2204 new_fd = te->symlink_parent_fd; 2205 else { 2206 new_fd = open_on_current_dir(t, "..", O_RDONLY | O_CLOEXEC); 2207 __archive_ensure_cloexec_flag(new_fd); 2208 } 2209 if (new_fd < 0) { 2210 t->tree_errno = errno; 2211 r = TREE_ERROR_FATAL; 2212 } else { 2213 /* Renew the current working directory. */ 2214 t->working_dir_fd = new_fd; 2215 t->flags &= ~onWorkingDir; 2216 /* Current directory has been changed, we should 2217 * close an fd of previous working directory. */ 2218 close_and_restore_time(prev_dir_fd, t, &te->restore_time); 2219 if (te->flags & isDirLink) { 2220 t->openCount--; 2221 te->symlink_parent_fd = -1; 2222 } 2223 t->depth--; 2224 } 2225 return (r); 2226 } 2227 2228 /* 2229 * Return to the initial directory where tree_open() was performed. 2230 */ 2231 static int 2232 tree_enter_initial_dir(struct tree *t) 2233 { 2234 int r = 0; 2235 2236 if ((t->flags & onInitialDir) == 0) { 2237 r = fchdir(t->initial_dir_fd); 2238 if (r == 0) { 2239 t->flags &= ~onWorkingDir; 2240 t->flags |= onInitialDir; 2241 } 2242 } 2243 return (r); 2244 } 2245 2246 /* 2247 * Restore working directory of directory traversals. 2248 */ 2249 static int 2250 tree_enter_working_dir(struct tree *t) 2251 { 2252 int r = 0; 2253 2254 /* 2255 * Change the current directory if really needed. 2256 * Sometimes this is unneeded when we did not do 2257 * descent. 2258 */ 2259 if (t->depth > 0 && (t->flags & onWorkingDir) == 0) { 2260 r = fchdir(t->working_dir_fd); 2261 if (r == 0) { 2262 t->flags &= ~onInitialDir; 2263 t->flags |= onWorkingDir; 2264 } 2265 } 2266 return (r); 2267 } 2268 2269 static int 2270 tree_current_dir_fd(struct tree *t) 2271 { 2272 return (t->working_dir_fd); 2273 } 2274 2275 /* 2276 * Pop the working stack. 2277 */ 2278 static void 2279 tree_pop(struct tree *t) 2280 { 2281 struct tree_entry *te; 2282 2283 t->path.s[t->dirname_length] = '\0'; 2284 t->path.length = t->dirname_length; 2285 if (t->stack == t->current && t->current != NULL) 2286 t->current = t->current->parent; 2287 te = t->stack; 2288 t->stack = te->next; 2289 t->dirname_length = te->dirname_length; 2290 t->basename = t->path.s + t->dirname_length; 2291 while (t->basename[0] == '/') 2292 t->basename++; 2293 archive_string_free(&te->name); 2294 free(te); 2295 } 2296 2297 /* 2298 * Get the next item in the tree traversal. 2299 */ 2300 static int 2301 tree_next(struct tree *t) 2302 { 2303 int r; 2304 2305 while (t->stack != NULL) { 2306 /* If there's an open dir, get the next entry from there. */ 2307 if (t->d != INVALID_DIR_HANDLE) { 2308 r = tree_dir_next_posix(t); 2309 if (r == 0) 2310 continue; 2311 return (r); 2312 } 2313 2314 if (t->stack->flags & needsFirstVisit) { 2315 /* Top stack item needs a regular visit. */ 2316 t->current = t->stack; 2317 tree_append(t, t->stack->name.s, 2318 archive_strlen(&(t->stack->name))); 2319 /* t->dirname_length = t->path_length; */ 2320 /* tree_pop(t); */ 2321 t->stack->flags &= ~needsFirstVisit; 2322 return (t->visit_type = TREE_REGULAR); 2323 } else if (t->stack->flags & needsDescent) { 2324 /* Top stack item is dir to descend into. */ 2325 t->current = t->stack; 2326 tree_append(t, t->stack->name.s, 2327 archive_strlen(&(t->stack->name))); 2328 t->stack->flags &= ~needsDescent; 2329 r = tree_descent(t); 2330 if (r != 0) { 2331 tree_pop(t); 2332 t->visit_type = r; 2333 } else 2334 t->visit_type = TREE_POSTDESCENT; 2335 return (t->visit_type); 2336 } else if (t->stack->flags & needsOpen) { 2337 t->stack->flags &= ~needsOpen; 2338 r = tree_dir_next_posix(t); 2339 if (r == 0) 2340 continue; 2341 return (r); 2342 } else if (t->stack->flags & needsAscent) { 2343 /* Top stack item is dir and we're done with it. */ 2344 r = tree_ascend(t); 2345 tree_pop(t); 2346 t->visit_type = r != 0 ? r : TREE_POSTASCENT; 2347 return (t->visit_type); 2348 } else { 2349 /* Top item on stack is dead. */ 2350 tree_pop(t); 2351 t->flags &= ~hasLstat; 2352 t->flags &= ~hasStat; 2353 } 2354 } 2355 return (t->visit_type = 0); 2356 } 2357 2358 static int 2359 tree_dir_next_posix(struct tree *t) 2360 { 2361 int r; 2362 const char *name; 2363 size_t namelen; 2364 2365 if (t->d == NULL) { 2366 #if defined(HAVE_READDIR_R) 2367 size_t dirent_size; 2368 #endif 2369 2370 #if defined(HAVE_FDOPENDIR) 2371 t->d = fdopendir(tree_dup(t->working_dir_fd)); 2372 #else /* HAVE_FDOPENDIR */ 2373 if (tree_enter_working_dir(t) == 0) { 2374 t->d = opendir("."); 2375 #if HAVE_DIRFD || defined(dirfd) 2376 __archive_ensure_cloexec_flag(dirfd(t->d)); 2377 #endif 2378 } 2379 #endif /* HAVE_FDOPENDIR */ 2380 if (t->d == NULL) { 2381 r = tree_ascend(t); /* Undo "chdir" */ 2382 tree_pop(t); 2383 t->tree_errno = errno; 2384 t->visit_type = r != 0 ? r : TREE_ERROR_DIR; 2385 return (t->visit_type); 2386 } 2387 #if defined(HAVE_READDIR_R) 2388 dirent_size = offsetof(struct dirent, d_name) + 2389 t->filesystem_table[t->current->filesystem_id].name_max + 1; 2390 if (t->dirent == NULL || t->dirent_allocated < dirent_size) { 2391 free(t->dirent); 2392 t->dirent = malloc(dirent_size); 2393 if (t->dirent == NULL) { 2394 closedir(t->d); 2395 t->d = INVALID_DIR_HANDLE; 2396 (void)tree_ascend(t); 2397 tree_pop(t); 2398 t->tree_errno = ENOMEM; 2399 t->visit_type = TREE_ERROR_DIR; 2400 return (t->visit_type); 2401 } 2402 t->dirent_allocated = dirent_size; 2403 } 2404 #endif /* HAVE_READDIR_R */ 2405 } 2406 for (;;) { 2407 errno = 0; 2408 #if defined(HAVE_READDIR_R) 2409 r = readdir_r(t->d, t->dirent, &t->de); 2410 #ifdef _AIX 2411 /* Note: According to the man page, return value 9 indicates 2412 * that the readdir_r was not successful and the error code 2413 * is set to the global errno variable. And then if the end 2414 * of directory entries was reached, the return value is 9 2415 * and the third parameter is set to NULL and errno is 2416 * unchanged. */ 2417 if (r == 9) 2418 r = errno; 2419 #endif /* _AIX */ 2420 if (r != 0 || t->de == NULL) { 2421 #else 2422 t->de = readdir(t->d); 2423 if (t->de == NULL) { 2424 r = errno; 2425 #endif 2426 closedir(t->d); 2427 t->d = INVALID_DIR_HANDLE; 2428 if (r != 0) { 2429 t->tree_errno = r; 2430 t->visit_type = TREE_ERROR_DIR; 2431 return (t->visit_type); 2432 } else 2433 return (0); 2434 } 2435 name = t->de->d_name; 2436 namelen = D_NAMELEN(t->de); 2437 t->flags &= ~hasLstat; 2438 t->flags &= ~hasStat; 2439 if (name[0] == '.' && name[1] == '\0') 2440 continue; 2441 if (name[0] == '.' && name[1] == '.' && name[2] == '\0') 2442 continue; 2443 tree_append(t, name, namelen); 2444 return (t->visit_type = TREE_REGULAR); 2445 } 2446 } 2447 2448 2449 /* 2450 * Get the stat() data for the entry just returned from tree_next(). 2451 */ 2452 static const struct stat * 2453 tree_current_stat(struct tree *t) 2454 { 2455 if (!(t->flags & hasStat)) { 2456 #ifdef HAVE_FSTATAT 2457 if (fstatat(tree_current_dir_fd(t), 2458 tree_current_access_path(t), &t->st, 0) != 0) 2459 #else 2460 if (tree_enter_working_dir(t) != 0) 2461 return NULL; 2462 if (stat(tree_current_access_path(t), &t->st) != 0) 2463 #endif 2464 return NULL; 2465 t->flags |= hasStat; 2466 } 2467 return (&t->st); 2468 } 2469 2470 /* 2471 * Get the lstat() data for the entry just returned from tree_next(). 2472 */ 2473 static const struct stat * 2474 tree_current_lstat(struct tree *t) 2475 { 2476 if (!(t->flags & hasLstat)) { 2477 #ifdef HAVE_FSTATAT 2478 if (fstatat(tree_current_dir_fd(t), 2479 tree_current_access_path(t), &t->lst, 2480 AT_SYMLINK_NOFOLLOW) != 0) 2481 #else 2482 if (tree_enter_working_dir(t) != 0) 2483 return NULL; 2484 if (lstat(tree_current_access_path(t), &t->lst) != 0) 2485 #endif 2486 return NULL; 2487 t->flags |= hasLstat; 2488 } 2489 return (&t->lst); 2490 } 2491 2492 /* 2493 * Test whether current entry is a dir or link to a dir. 2494 */ 2495 static int 2496 tree_current_is_dir(struct tree *t) 2497 { 2498 const struct stat *st; 2499 /* 2500 * If we already have lstat() info, then try some 2501 * cheap tests to determine if this is a dir. 2502 */ 2503 if (t->flags & hasLstat) { 2504 /* If lstat() says it's a dir, it must be a dir. */ 2505 st = tree_current_lstat(t); 2506 if (st == NULL) 2507 return 0; 2508 if (S_ISDIR(st->st_mode)) 2509 return 1; 2510 /* Not a dir; might be a link to a dir. */ 2511 /* If it's not a link, then it's not a link to a dir. */ 2512 if (!S_ISLNK(st->st_mode)) 2513 return 0; 2514 /* 2515 * It's a link, but we don't know what it's a link to, 2516 * so we'll have to use stat(). 2517 */ 2518 } 2519 2520 st = tree_current_stat(t); 2521 /* If we can't stat it, it's not a dir. */ 2522 if (st == NULL) 2523 return 0; 2524 /* Use the definitive test. Hopefully this is cached. */ 2525 return (S_ISDIR(st->st_mode)); 2526 } 2527 2528 /* 2529 * Test whether current entry is a physical directory. Usually, we 2530 * already have at least one of stat() or lstat() in memory, so we 2531 * use tricks to try to avoid an extra trip to the disk. 2532 */ 2533 static int 2534 tree_current_is_physical_dir(struct tree *t) 2535 { 2536 const struct stat *st; 2537 2538 /* 2539 * If stat() says it isn't a dir, then it's not a dir. 2540 * If stat() data is cached, this check is free, so do it first. 2541 */ 2542 if (t->flags & hasStat) { 2543 st = tree_current_stat(t); 2544 if (st == NULL) 2545 return (0); 2546 if (!S_ISDIR(st->st_mode)) 2547 return (0); 2548 } 2549 2550 /* 2551 * Either stat() said it was a dir (in which case, we have 2552 * to determine whether it's really a link to a dir) or 2553 * stat() info wasn't available. So we use lstat(), which 2554 * hopefully is already cached. 2555 */ 2556 2557 st = tree_current_lstat(t); 2558 /* If we can't stat it, it's not a dir. */ 2559 if (st == NULL) 2560 return 0; 2561 /* Use the definitive test. Hopefully this is cached. */ 2562 return (S_ISDIR(st->st_mode)); 2563 } 2564 2565 /* 2566 * Test whether the same file has been in the tree as its parent. 2567 */ 2568 static int 2569 tree_target_is_same_as_parent(struct tree *t, const struct stat *st) 2570 { 2571 struct tree_entry *te; 2572 2573 for (te = t->current->parent; te != NULL; te = te->parent) { 2574 if (te->dev == (int64_t)st->st_dev && 2575 te->ino == (int64_t)st->st_ino) 2576 return (1); 2577 } 2578 return (0); 2579 } 2580 2581 /* 2582 * Test whether the current file is symbolic link target and 2583 * on the other filesystem. 2584 */ 2585 static int 2586 tree_current_is_symblic_link_target(struct tree *t) 2587 { 2588 static const struct stat *lst, *st; 2589 2590 lst = tree_current_lstat(t); 2591 st = tree_current_stat(t); 2592 return (st != NULL && lst != NULL && 2593 (int64_t)st->st_dev == t->current_filesystem->dev && 2594 st->st_dev != lst->st_dev); 2595 } 2596 2597 /* 2598 * Return the access path for the entry just returned from tree_next(). 2599 */ 2600 static const char * 2601 tree_current_access_path(struct tree *t) 2602 { 2603 return (t->basename); 2604 } 2605 2606 /* 2607 * Return the full path for the entry just returned from tree_next(). 2608 */ 2609 static const char * 2610 tree_current_path(struct tree *t) 2611 { 2612 return (t->path.s); 2613 } 2614 2615 /* 2616 * Terminate the traversal. 2617 */ 2618 static void 2619 tree_close(struct tree *t) 2620 { 2621 2622 if (t == NULL) 2623 return; 2624 if (t->entry_fd >= 0) { 2625 close_and_restore_time(t->entry_fd, t, &t->restore_time); 2626 t->entry_fd = -1; 2627 } 2628 /* Close the handle of readdir(). */ 2629 if (t->d != INVALID_DIR_HANDLE) { 2630 closedir(t->d); 2631 t->d = INVALID_DIR_HANDLE; 2632 } 2633 /* Release anything remaining in the stack. */ 2634 while (t->stack != NULL) { 2635 if (t->stack->flags & isDirLink) 2636 close(t->stack->symlink_parent_fd); 2637 tree_pop(t); 2638 } 2639 if (t->working_dir_fd >= 0) { 2640 close(t->working_dir_fd); 2641 t->working_dir_fd = -1; 2642 } 2643 if (t->initial_dir_fd >= 0) { 2644 close(t->initial_dir_fd); 2645 t->initial_dir_fd = -1; 2646 } 2647 } 2648 2649 /* 2650 * Release any resources. 2651 */ 2652 static void 2653 tree_free(struct tree *t) 2654 { 2655 int i; 2656 2657 if (t == NULL) 2658 return; 2659 archive_string_free(&t->path); 2660 #if defined(HAVE_READDIR_R) 2661 free(t->dirent); 2662 #endif 2663 free(t->sparse_list); 2664 for (i = 0; i < t->max_filesystem_id; i++) 2665 free(t->filesystem_table[i].allocation_ptr); 2666 free(t->filesystem_table); 2667 free(t); 2668 } 2669 2670 #endif 2671