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(USE_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(USE_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_filesystem; 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, la_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, la_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, la_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, la_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->flags = ARCHIVE_READDISK_MAC_COPYFILE; 469 a->open_on_current_dir = open_on_current_dir; 470 a->tree_current_dir_fd = tree_current_dir_fd; 471 a->tree_enter_working_dir = tree_enter_working_dir; 472 return (&a->archive); 473 } 474 475 static int 476 _archive_read_free(struct archive *_a) 477 { 478 struct archive_read_disk *a = (struct archive_read_disk *)_a; 479 int r; 480 481 if (_a == NULL) 482 return (ARCHIVE_OK); 483 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 484 ARCHIVE_STATE_ANY | ARCHIVE_STATE_FATAL, "archive_read_free"); 485 486 if (a->archive.state != ARCHIVE_STATE_CLOSED) 487 r = _archive_read_close(&a->archive); 488 else 489 r = ARCHIVE_OK; 490 491 tree_free(a->tree); 492 if (a->cleanup_gname != NULL && a->lookup_gname_data != NULL) 493 (a->cleanup_gname)(a->lookup_gname_data); 494 if (a->cleanup_uname != NULL && a->lookup_uname_data != NULL) 495 (a->cleanup_uname)(a->lookup_uname_data); 496 archive_string_free(&a->archive.error_string); 497 archive_entry_free(a->entry); 498 a->archive.magic = 0; 499 __archive_clean(&a->archive); 500 free(a); 501 return (r); 502 } 503 504 static int 505 _archive_read_close(struct archive *_a) 506 { 507 struct archive_read_disk *a = (struct archive_read_disk *)_a; 508 509 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 510 ARCHIVE_STATE_ANY | ARCHIVE_STATE_FATAL, "archive_read_close"); 511 512 if (a->archive.state != ARCHIVE_STATE_FATAL) 513 a->archive.state = ARCHIVE_STATE_CLOSED; 514 515 tree_close(a->tree); 516 517 return (ARCHIVE_OK); 518 } 519 520 static void 521 setup_symlink_mode(struct archive_read_disk *a, char symlink_mode, 522 int follow_symlinks) 523 { 524 a->symlink_mode = symlink_mode; 525 a->follow_symlinks = follow_symlinks; 526 if (a->tree != NULL) { 527 a->tree->initial_symlink_mode = a->symlink_mode; 528 a->tree->symlink_mode = a->symlink_mode; 529 } 530 } 531 532 int 533 archive_read_disk_set_symlink_logical(struct archive *_a) 534 { 535 struct archive_read_disk *a = (struct archive_read_disk *)_a; 536 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 537 ARCHIVE_STATE_ANY, "archive_read_disk_set_symlink_logical"); 538 setup_symlink_mode(a, 'L', 1); 539 return (ARCHIVE_OK); 540 } 541 542 int 543 archive_read_disk_set_symlink_physical(struct archive *_a) 544 { 545 struct archive_read_disk *a = (struct archive_read_disk *)_a; 546 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 547 ARCHIVE_STATE_ANY, "archive_read_disk_set_symlink_physical"); 548 setup_symlink_mode(a, 'P', 0); 549 return (ARCHIVE_OK); 550 } 551 552 int 553 archive_read_disk_set_symlink_hybrid(struct archive *_a) 554 { 555 struct archive_read_disk *a = (struct archive_read_disk *)_a; 556 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 557 ARCHIVE_STATE_ANY, "archive_read_disk_set_symlink_hybrid"); 558 setup_symlink_mode(a, 'H', 1);/* Follow symlinks initially. */ 559 return (ARCHIVE_OK); 560 } 561 562 int 563 archive_read_disk_set_atime_restored(struct archive *_a) 564 { 565 struct archive_read_disk *a = (struct archive_read_disk *)_a; 566 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 567 ARCHIVE_STATE_ANY, "archive_read_disk_restore_atime"); 568 #ifdef HAVE_UTIMES 569 a->flags |= ARCHIVE_READDISK_RESTORE_ATIME; 570 if (a->tree != NULL) 571 a->tree->flags |= needsRestoreTimes; 572 return (ARCHIVE_OK); 573 #else 574 /* Display warning and unset flag */ 575 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 576 "Cannot restore access time on this system"); 577 a->flags &= ~ARCHIVE_READDISK_RESTORE_ATIME; 578 return (ARCHIVE_WARN); 579 #endif 580 } 581 582 int 583 archive_read_disk_set_behavior(struct archive *_a, int flags) 584 { 585 struct archive_read_disk *a = (struct archive_read_disk *)_a; 586 int r = ARCHIVE_OK; 587 588 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 589 ARCHIVE_STATE_ANY, "archive_read_disk_honor_nodump"); 590 591 a->flags = flags; 592 593 if (flags & ARCHIVE_READDISK_RESTORE_ATIME) 594 r = archive_read_disk_set_atime_restored(_a); 595 else { 596 if (a->tree != NULL) 597 a->tree->flags &= ~needsRestoreTimes; 598 } 599 return (r); 600 } 601 602 /* 603 * Trivial implementations of gname/uname lookup functions. 604 * These are normally overridden by the client, but these stub 605 * versions ensure that we always have something that works. 606 */ 607 static const char * 608 trivial_lookup_gname(void *private_data, int64_t gid) 609 { 610 (void)private_data; /* UNUSED */ 611 (void)gid; /* UNUSED */ 612 return (NULL); 613 } 614 615 static const char * 616 trivial_lookup_uname(void *private_data, int64_t uid) 617 { 618 (void)private_data; /* UNUSED */ 619 (void)uid; /* UNUSED */ 620 return (NULL); 621 } 622 623 /* 624 * Allocate memory for the reading buffer adjusted to the filesystem 625 * alignment. 626 */ 627 static int 628 setup_suitable_read_buffer(struct archive_read_disk *a) 629 { 630 struct tree *t = a->tree; 631 struct filesystem *cf = t->current_filesystem; 632 size_t asize; 633 size_t s; 634 635 if (cf->allocation_ptr == NULL) { 636 /* If we couldn't get a filesystem alignment, 637 * we use 4096 as default value but we won't use 638 * O_DIRECT to open() and openat() operations. */ 639 long xfer_align = (cf->xfer_align == -1)?4096:cf->xfer_align; 640 641 if (cf->max_xfer_size != -1) 642 asize = cf->max_xfer_size + xfer_align; 643 else { 644 long incr = cf->incr_xfer_size; 645 /* Some platform does not set a proper value to 646 * incr_xfer_size.*/ 647 if (incr < 0) 648 incr = cf->min_xfer_size; 649 if (cf->min_xfer_size < 0) { 650 incr = xfer_align; 651 asize = xfer_align; 652 } else 653 asize = cf->min_xfer_size; 654 655 /* Increase a buffer size up to 64K bytes in 656 * a proper increment size. */ 657 while (asize < 1024*64) 658 asize += incr; 659 /* Take a margin to adjust to the filesystem 660 * alignment. */ 661 asize += xfer_align; 662 } 663 cf->allocation_ptr = malloc(asize); 664 if (cf->allocation_ptr == NULL) { 665 archive_set_error(&a->archive, ENOMEM, 666 "Couldn't allocate memory"); 667 a->archive.state = ARCHIVE_STATE_FATAL; 668 return (ARCHIVE_FATAL); 669 } 670 671 /* 672 * Calculate proper address for the filesystem. 673 */ 674 s = (uintptr_t)cf->allocation_ptr; 675 s %= xfer_align; 676 if (s > 0) 677 s = xfer_align - s; 678 679 /* 680 * Set a read buffer pointer in the proper alignment of 681 * the current filesystem. 682 */ 683 cf->buff = cf->allocation_ptr + s; 684 cf->buff_size = asize - xfer_align; 685 } 686 return (ARCHIVE_OK); 687 } 688 689 static int 690 _archive_read_data_block(struct archive *_a, const void **buff, 691 size_t *size, int64_t *offset) 692 { 693 struct archive_read_disk *a = (struct archive_read_disk *)_a; 694 struct tree *t = a->tree; 695 int r; 696 ssize_t bytes; 697 size_t buffbytes; 698 int empty_sparse_region = 0; 699 700 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, ARCHIVE_STATE_DATA, 701 "archive_read_data_block"); 702 703 if (t->entry_eof || t->entry_remaining_bytes <= 0) { 704 r = ARCHIVE_EOF; 705 goto abort_read_data; 706 } 707 708 /* 709 * Open the current file. 710 */ 711 if (t->entry_fd < 0) { 712 int flags = O_RDONLY | O_BINARY | O_CLOEXEC; 713 714 /* 715 * Eliminate or reduce cache effects if we can. 716 * 717 * Carefully consider this to be enabled. 718 */ 719 #if defined(O_DIRECT) && 0/* Disabled for now */ 720 if (t->current_filesystem->xfer_align != -1 && 721 t->nlink == 1) 722 flags |= O_DIRECT; 723 #endif 724 #if defined(O_NOATIME) 725 /* 726 * Linux has O_NOATIME flag; use it if we need. 727 */ 728 if ((t->flags & needsRestoreTimes) != 0 && 729 t->restore_time.noatime == 0) 730 flags |= O_NOATIME; 731 do { 732 #endif 733 t->entry_fd = open_on_current_dir(t, 734 tree_current_access_path(t), flags); 735 __archive_ensure_cloexec_flag(t->entry_fd); 736 #if defined(O_NOATIME) 737 /* 738 * When we did open the file with O_NOATIME flag, 739 * if successful, set 1 to t->restore_time.noatime 740 * not to restore an atime of the file later. 741 * if failed by EPERM, retry it without O_NOATIME flag. 742 */ 743 if (flags & O_NOATIME) { 744 if (t->entry_fd >= 0) 745 t->restore_time.noatime = 1; 746 else if (errno == EPERM) { 747 flags &= ~O_NOATIME; 748 continue; 749 } 750 } 751 } while (0); 752 #endif 753 if (t->entry_fd < 0) { 754 archive_set_error(&a->archive, errno, 755 "Couldn't open %s", tree_current_path(t)); 756 r = ARCHIVE_FAILED; 757 tree_enter_initial_dir(t); 758 goto abort_read_data; 759 } 760 tree_enter_initial_dir(t); 761 } 762 763 /* 764 * Allocate read buffer if not allocated. 765 */ 766 if (t->current_filesystem->allocation_ptr == NULL) { 767 r = setup_suitable_read_buffer(a); 768 if (r != ARCHIVE_OK) { 769 a->archive.state = ARCHIVE_STATE_FATAL; 770 goto abort_read_data; 771 } 772 } 773 t->entry_buff = t->current_filesystem->buff; 774 t->entry_buff_size = t->current_filesystem->buff_size; 775 776 buffbytes = t->entry_buff_size; 777 if ((int64_t)buffbytes > t->current_sparse->length) 778 buffbytes = t->current_sparse->length; 779 780 if (t->current_sparse->length == 0) 781 empty_sparse_region = 1; 782 783 /* 784 * Skip hole. 785 * TODO: Should we consider t->current_filesystem->xfer_align? 786 */ 787 if (t->current_sparse->offset > t->entry_total) { 788 if (lseek(t->entry_fd, 789 (off_t)t->current_sparse->offset, SEEK_SET) < 0) { 790 archive_set_error(&a->archive, errno, "Seek error"); 791 r = ARCHIVE_FATAL; 792 a->archive.state = ARCHIVE_STATE_FATAL; 793 goto abort_read_data; 794 } 795 bytes = t->current_sparse->offset - t->entry_total; 796 t->entry_remaining_bytes -= bytes; 797 t->entry_total += bytes; 798 } 799 800 /* 801 * Read file contents. 802 */ 803 if (buffbytes > 0) { 804 bytes = read(t->entry_fd, t->entry_buff, buffbytes); 805 if (bytes < 0) { 806 archive_set_error(&a->archive, errno, "Read error"); 807 r = ARCHIVE_FATAL; 808 a->archive.state = ARCHIVE_STATE_FATAL; 809 goto abort_read_data; 810 } 811 } else 812 bytes = 0; 813 /* 814 * Return an EOF unless we've read a leading empty sparse region, which 815 * is used to represent fully-sparse files. 816 */ 817 if (bytes == 0 && !empty_sparse_region) { 818 /* Get EOF */ 819 t->entry_eof = 1; 820 r = ARCHIVE_EOF; 821 goto abort_read_data; 822 } 823 *buff = t->entry_buff; 824 *size = bytes; 825 *offset = t->entry_total; 826 t->entry_total += bytes; 827 t->entry_remaining_bytes -= bytes; 828 if (t->entry_remaining_bytes == 0) { 829 /* Close the current file descriptor */ 830 close_and_restore_time(t->entry_fd, t, &t->restore_time); 831 t->entry_fd = -1; 832 t->entry_eof = 1; 833 } 834 t->current_sparse->offset += bytes; 835 t->current_sparse->length -= bytes; 836 if (t->current_sparse->length == 0 && !t->entry_eof) 837 t->current_sparse++; 838 return (ARCHIVE_OK); 839 840 abort_read_data: 841 *buff = NULL; 842 *size = 0; 843 *offset = t->entry_total; 844 if (t->entry_fd >= 0) { 845 /* Close the current file descriptor */ 846 close_and_restore_time(t->entry_fd, t, &t->restore_time); 847 t->entry_fd = -1; 848 } 849 return (r); 850 } 851 852 static int 853 next_entry(struct archive_read_disk *a, struct tree *t, 854 struct archive_entry *entry) 855 { 856 const struct stat *st; /* info to use for this entry */ 857 const struct stat *lst;/* lstat() information */ 858 const char *name; 859 int descend, r; 860 861 st = NULL; 862 lst = NULL; 863 t->descend = 0; 864 do { 865 switch (tree_next(t)) { 866 case TREE_ERROR_FATAL: 867 archive_set_error(&a->archive, t->tree_errno, 868 "%s: Unable to continue traversing directory tree", 869 tree_current_path(t)); 870 a->archive.state = ARCHIVE_STATE_FATAL; 871 tree_enter_initial_dir(t); 872 return (ARCHIVE_FATAL); 873 case TREE_ERROR_DIR: 874 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 875 "%s: Couldn't visit directory", 876 tree_current_path(t)); 877 tree_enter_initial_dir(t); 878 return (ARCHIVE_FAILED); 879 case 0: 880 tree_enter_initial_dir(t); 881 return (ARCHIVE_EOF); 882 case TREE_POSTDESCENT: 883 case TREE_POSTASCENT: 884 break; 885 case TREE_REGULAR: 886 lst = tree_current_lstat(t); 887 if (lst == NULL) { 888 archive_set_error(&a->archive, errno, 889 "%s: Cannot stat", 890 tree_current_path(t)); 891 tree_enter_initial_dir(t); 892 return (ARCHIVE_FAILED); 893 } 894 break; 895 } 896 } while (lst == NULL); 897 898 #ifdef __APPLE__ 899 if (a->flags & ARCHIVE_READDISK_MAC_COPYFILE) { 900 /* If we're using copyfile(), ignore "._XXX" files. */ 901 const char *bname = strrchr(tree_current_path(t), '/'); 902 if (bname == NULL) 903 bname = tree_current_path(t); 904 else 905 ++bname; 906 if (bname[0] == '.' && bname[1] == '_') 907 return (ARCHIVE_RETRY); 908 } 909 #endif 910 911 archive_entry_copy_pathname(entry, tree_current_path(t)); 912 /* 913 * Perform path matching. 914 */ 915 if (a->matching) { 916 r = archive_match_path_excluded(a->matching, entry); 917 if (r < 0) { 918 archive_set_error(&(a->archive), errno, 919 "Failed : %s", archive_error_string(a->matching)); 920 return (r); 921 } 922 if (r) { 923 if (a->excluded_cb_func) 924 a->excluded_cb_func(&(a->archive), 925 a->excluded_cb_data, entry); 926 return (ARCHIVE_RETRY); 927 } 928 } 929 930 /* 931 * Distinguish 'L'/'P'/'H' symlink following. 932 */ 933 switch(t->symlink_mode) { 934 case 'H': 935 /* 'H': After the first item, rest like 'P'. */ 936 t->symlink_mode = 'P'; 937 /* 'H': First item (from command line) like 'L'. */ 938 /* FALLTHROUGH */ 939 case 'L': 940 /* 'L': Do descend through a symlink to dir. */ 941 descend = tree_current_is_dir(t); 942 /* 'L': Follow symlinks to files. */ 943 a->symlink_mode = 'L'; 944 a->follow_symlinks = 1; 945 /* 'L': Archive symlinks as targets, if we can. */ 946 st = tree_current_stat(t); 947 if (st != NULL && !tree_target_is_same_as_parent(t, st)) 948 break; 949 /* If stat fails, we have a broken symlink; 950 * in that case, don't follow the link. */ 951 /* FALLTHROUGH */ 952 default: 953 /* 'P': Don't descend through a symlink to dir. */ 954 descend = tree_current_is_physical_dir(t); 955 /* 'P': Don't follow symlinks to files. */ 956 a->symlink_mode = 'P'; 957 a->follow_symlinks = 0; 958 /* 'P': Archive symlinks as symlinks. */ 959 st = lst; 960 break; 961 } 962 963 if (update_current_filesystem(a, st->st_dev) != ARCHIVE_OK) { 964 a->archive.state = ARCHIVE_STATE_FATAL; 965 tree_enter_initial_dir(t); 966 return (ARCHIVE_FATAL); 967 } 968 if (t->initial_filesystem_id == -1) 969 t->initial_filesystem_id = t->current_filesystem_id; 970 if (a->flags & ARCHIVE_READDISK_NO_TRAVERSE_MOUNTS) { 971 if (t->initial_filesystem_id != t->current_filesystem_id) 972 descend = 0; 973 } 974 t->descend = descend; 975 976 /* 977 * Honor nodump flag. 978 * If the file is marked with nodump flag, do not return this entry. 979 */ 980 if (a->flags & ARCHIVE_READDISK_HONOR_NODUMP) { 981 #if defined(HAVE_STRUCT_STAT_ST_FLAGS) && defined(UF_NODUMP) 982 if (st->st_flags & UF_NODUMP) 983 return (ARCHIVE_RETRY); 984 #elif (defined(FS_IOC_GETFLAGS) && defined(FS_NODUMP_FL) && \ 985 defined(HAVE_WORKING_FS_IOC_GETFLAGS)) || \ 986 (defined(EXT2_IOC_GETFLAGS) && defined(EXT2_NODUMP_FL) && \ 987 defined(HAVE_WORKING_EXT2_IOC_GETFLAGS)) 988 if (S_ISREG(st->st_mode) || S_ISDIR(st->st_mode)) { 989 int stflags; 990 991 t->entry_fd = open_on_current_dir(t, 992 tree_current_access_path(t), 993 O_RDONLY | O_NONBLOCK | O_CLOEXEC); 994 __archive_ensure_cloexec_flag(t->entry_fd); 995 if (t->entry_fd >= 0) { 996 r = ioctl(t->entry_fd, 997 #ifdef FS_IOC_GETFLAGS 998 FS_IOC_GETFLAGS, 999 #else 1000 EXT2_IOC_GETFLAGS, 1001 #endif 1002 &stflags); 1003 #ifdef FS_NODUMP_FL 1004 if (r == 0 && (stflags & FS_NODUMP_FL) != 0) 1005 #else 1006 if (r == 0 && (stflags & EXT2_NODUMP_FL) != 0) 1007 #endif 1008 return (ARCHIVE_RETRY); 1009 } 1010 } 1011 #endif 1012 } 1013 1014 archive_entry_copy_stat(entry, st); 1015 1016 /* Save the times to be restored. This must be in before 1017 * calling archive_read_disk_descend() or any chance of it, 1018 * especially, invoking a callback. */ 1019 t->restore_time.mtime = archive_entry_mtime(entry); 1020 t->restore_time.mtime_nsec = archive_entry_mtime_nsec(entry); 1021 t->restore_time.atime = archive_entry_atime(entry); 1022 t->restore_time.atime_nsec = archive_entry_atime_nsec(entry); 1023 t->restore_time.filetype = archive_entry_filetype(entry); 1024 t->restore_time.noatime = t->current_filesystem->noatime; 1025 1026 /* 1027 * Perform time matching. 1028 */ 1029 if (a->matching) { 1030 r = archive_match_time_excluded(a->matching, entry); 1031 if (r < 0) { 1032 archive_set_error(&(a->archive), errno, 1033 "Failed : %s", archive_error_string(a->matching)); 1034 return (r); 1035 } 1036 if (r) { 1037 if (a->excluded_cb_func) 1038 a->excluded_cb_func(&(a->archive), 1039 a->excluded_cb_data, entry); 1040 return (ARCHIVE_RETRY); 1041 } 1042 } 1043 1044 /* Lookup uname/gname */ 1045 name = archive_read_disk_uname(&(a->archive), archive_entry_uid(entry)); 1046 if (name != NULL) 1047 archive_entry_copy_uname(entry, name); 1048 name = archive_read_disk_gname(&(a->archive), archive_entry_gid(entry)); 1049 if (name != NULL) 1050 archive_entry_copy_gname(entry, name); 1051 1052 /* 1053 * Perform owner matching. 1054 */ 1055 if (a->matching) { 1056 r = archive_match_owner_excluded(a->matching, entry); 1057 if (r < 0) { 1058 archive_set_error(&(a->archive), errno, 1059 "Failed : %s", archive_error_string(a->matching)); 1060 return (r); 1061 } 1062 if (r) { 1063 if (a->excluded_cb_func) 1064 a->excluded_cb_func(&(a->archive), 1065 a->excluded_cb_data, entry); 1066 return (ARCHIVE_RETRY); 1067 } 1068 } 1069 1070 /* 1071 * Invoke a meta data filter callback. 1072 */ 1073 if (a->metadata_filter_func) { 1074 if (!a->metadata_filter_func(&(a->archive), 1075 a->metadata_filter_data, entry)) 1076 return (ARCHIVE_RETRY); 1077 } 1078 1079 /* 1080 * Populate the archive_entry with metadata from the disk. 1081 */ 1082 archive_entry_copy_sourcepath(entry, tree_current_access_path(t)); 1083 r = archive_read_disk_entry_from_file(&(a->archive), entry, 1084 t->entry_fd, st); 1085 1086 return (r); 1087 } 1088 1089 static int 1090 _archive_read_next_header(struct archive *_a, struct archive_entry **entryp) 1091 { 1092 int ret; 1093 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1094 *entryp = NULL; 1095 ret = _archive_read_next_header2(_a, a->entry); 1096 *entryp = a->entry; 1097 return ret; 1098 } 1099 1100 static int 1101 _archive_read_next_header2(struct archive *_a, struct archive_entry *entry) 1102 { 1103 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1104 struct tree *t; 1105 int r; 1106 1107 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 1108 ARCHIVE_STATE_HEADER | ARCHIVE_STATE_DATA, 1109 "archive_read_next_header2"); 1110 1111 t = a->tree; 1112 if (t->entry_fd >= 0) { 1113 close_and_restore_time(t->entry_fd, t, &t->restore_time); 1114 t->entry_fd = -1; 1115 } 1116 1117 for (;;) { 1118 r = next_entry(a, t, entry); 1119 if (t->entry_fd >= 0) { 1120 close(t->entry_fd); 1121 t->entry_fd = -1; 1122 } 1123 1124 if (r == ARCHIVE_RETRY) { 1125 archive_entry_clear(entry); 1126 continue; 1127 } 1128 break; 1129 } 1130 1131 /* Return to the initial directory. */ 1132 tree_enter_initial_dir(t); 1133 1134 /* 1135 * EOF and FATAL are persistent at this layer. By 1136 * modifying the state, we guarantee that future calls to 1137 * read a header or read data will fail. 1138 */ 1139 switch (r) { 1140 case ARCHIVE_EOF: 1141 a->archive.state = ARCHIVE_STATE_EOF; 1142 break; 1143 case ARCHIVE_OK: 1144 case ARCHIVE_WARN: 1145 /* Overwrite the sourcepath based on the initial directory. */ 1146 archive_entry_copy_sourcepath(entry, tree_current_path(t)); 1147 t->entry_total = 0; 1148 if (archive_entry_filetype(entry) == AE_IFREG) { 1149 t->nlink = archive_entry_nlink(entry); 1150 t->entry_remaining_bytes = archive_entry_size(entry); 1151 t->entry_eof = (t->entry_remaining_bytes == 0)? 1: 0; 1152 if (!t->entry_eof && 1153 setup_sparse(a, entry) != ARCHIVE_OK) 1154 return (ARCHIVE_FATAL); 1155 } else { 1156 t->entry_remaining_bytes = 0; 1157 t->entry_eof = 1; 1158 } 1159 a->archive.state = ARCHIVE_STATE_DATA; 1160 break; 1161 case ARCHIVE_RETRY: 1162 break; 1163 case ARCHIVE_FATAL: 1164 a->archive.state = ARCHIVE_STATE_FATAL; 1165 break; 1166 } 1167 1168 __archive_reset_read_data(&a->archive); 1169 return (r); 1170 } 1171 1172 static int 1173 setup_sparse(struct archive_read_disk *a, struct archive_entry *entry) 1174 { 1175 struct tree *t = a->tree; 1176 int64_t length, offset; 1177 int i; 1178 1179 t->sparse_count = archive_entry_sparse_reset(entry); 1180 if (t->sparse_count+1 > t->sparse_list_size) { 1181 free(t->sparse_list); 1182 t->sparse_list_size = t->sparse_count + 1; 1183 t->sparse_list = malloc(sizeof(t->sparse_list[0]) * 1184 t->sparse_list_size); 1185 if (t->sparse_list == NULL) { 1186 t->sparse_list_size = 0; 1187 archive_set_error(&a->archive, ENOMEM, 1188 "Can't allocate data"); 1189 a->archive.state = ARCHIVE_STATE_FATAL; 1190 return (ARCHIVE_FATAL); 1191 } 1192 } 1193 for (i = 0; i < t->sparse_count; i++) { 1194 archive_entry_sparse_next(entry, &offset, &length); 1195 t->sparse_list[i].offset = offset; 1196 t->sparse_list[i].length = length; 1197 } 1198 if (i == 0) { 1199 t->sparse_list[i].offset = 0; 1200 t->sparse_list[i].length = archive_entry_size(entry); 1201 } else { 1202 t->sparse_list[i].offset = archive_entry_size(entry); 1203 t->sparse_list[i].length = 0; 1204 } 1205 t->current_sparse = t->sparse_list; 1206 1207 return (ARCHIVE_OK); 1208 } 1209 1210 int 1211 archive_read_disk_set_matching(struct archive *_a, struct archive *_ma, 1212 void (*_excluded_func)(struct archive *, void *, struct archive_entry *), 1213 void *_client_data) 1214 { 1215 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1216 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 1217 ARCHIVE_STATE_ANY, "archive_read_disk_set_matching"); 1218 a->matching = _ma; 1219 a->excluded_cb_func = _excluded_func; 1220 a->excluded_cb_data = _client_data; 1221 return (ARCHIVE_OK); 1222 } 1223 1224 int 1225 archive_read_disk_set_metadata_filter_callback(struct archive *_a, 1226 int (*_metadata_filter_func)(struct archive *, void *, 1227 struct archive_entry *), void *_client_data) 1228 { 1229 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1230 1231 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, ARCHIVE_STATE_ANY, 1232 "archive_read_disk_set_metadata_filter_callback"); 1233 1234 a->metadata_filter_func = _metadata_filter_func; 1235 a->metadata_filter_data = _client_data; 1236 return (ARCHIVE_OK); 1237 } 1238 1239 int 1240 archive_read_disk_can_descend(struct archive *_a) 1241 { 1242 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1243 struct tree *t = a->tree; 1244 1245 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 1246 ARCHIVE_STATE_HEADER | ARCHIVE_STATE_DATA, 1247 "archive_read_disk_can_descend"); 1248 1249 return (t->visit_type == TREE_REGULAR && t->descend); 1250 } 1251 1252 /* 1253 * Called by the client to mark the directory just returned from 1254 * tree_next() as needing to be visited. 1255 */ 1256 int 1257 archive_read_disk_descend(struct archive *_a) 1258 { 1259 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1260 struct tree *t = a->tree; 1261 1262 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 1263 ARCHIVE_STATE_HEADER | ARCHIVE_STATE_DATA, 1264 "archive_read_disk_descend"); 1265 1266 if (t->visit_type != TREE_REGULAR || !t->descend) 1267 return (ARCHIVE_OK); 1268 1269 if (tree_current_is_physical_dir(t)) { 1270 tree_push(t, t->basename, t->current_filesystem_id, 1271 t->lst.st_dev, t->lst.st_ino, &t->restore_time); 1272 t->stack->flags |= isDir; 1273 } else if (tree_current_is_dir(t)) { 1274 tree_push(t, t->basename, t->current_filesystem_id, 1275 t->st.st_dev, t->st.st_ino, &t->restore_time); 1276 t->stack->flags |= isDirLink; 1277 } 1278 t->descend = 0; 1279 return (ARCHIVE_OK); 1280 } 1281 1282 int 1283 archive_read_disk_open(struct archive *_a, const char *pathname) 1284 { 1285 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1286 1287 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 1288 ARCHIVE_STATE_NEW | ARCHIVE_STATE_CLOSED, 1289 "archive_read_disk_open"); 1290 archive_clear_error(&a->archive); 1291 1292 return (_archive_read_disk_open(_a, pathname)); 1293 } 1294 1295 int 1296 archive_read_disk_open_w(struct archive *_a, const wchar_t *pathname) 1297 { 1298 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1299 struct archive_string path; 1300 int ret; 1301 1302 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, 1303 ARCHIVE_STATE_NEW | ARCHIVE_STATE_CLOSED, 1304 "archive_read_disk_open_w"); 1305 archive_clear_error(&a->archive); 1306 1307 /* Make a char string from a wchar_t string. */ 1308 archive_string_init(&path); 1309 if (archive_string_append_from_wcs(&path, pathname, 1310 wcslen(pathname)) != 0) { 1311 if (errno == ENOMEM) 1312 archive_set_error(&a->archive, ENOMEM, 1313 "Can't allocate memory"); 1314 else 1315 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 1316 "Can't convert a path to a char string"); 1317 a->archive.state = ARCHIVE_STATE_FATAL; 1318 ret = ARCHIVE_FATAL; 1319 } else 1320 ret = _archive_read_disk_open(_a, path.s); 1321 1322 archive_string_free(&path); 1323 return (ret); 1324 } 1325 1326 static int 1327 _archive_read_disk_open(struct archive *_a, const char *pathname) 1328 { 1329 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1330 1331 if (a->tree != NULL) 1332 a->tree = tree_reopen(a->tree, pathname, 1333 a->flags & ARCHIVE_READDISK_RESTORE_ATIME); 1334 else 1335 a->tree = tree_open(pathname, a->symlink_mode, 1336 a->flags & ARCHIVE_READDISK_RESTORE_ATIME); 1337 if (a->tree == NULL) { 1338 archive_set_error(&a->archive, ENOMEM, 1339 "Can't allocate tar data"); 1340 a->archive.state = ARCHIVE_STATE_FATAL; 1341 return (ARCHIVE_FATAL); 1342 } 1343 a->archive.state = ARCHIVE_STATE_HEADER; 1344 1345 return (ARCHIVE_OK); 1346 } 1347 1348 /* 1349 * Return a current filesystem ID which is index of the filesystem entry 1350 * you've visited through archive_read_disk. 1351 */ 1352 int 1353 archive_read_disk_current_filesystem(struct archive *_a) 1354 { 1355 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1356 1357 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, ARCHIVE_STATE_DATA, 1358 "archive_read_disk_current_filesystem"); 1359 1360 return (a->tree->current_filesystem_id); 1361 } 1362 1363 static int 1364 update_current_filesystem(struct archive_read_disk *a, int64_t dev) 1365 { 1366 struct tree *t = a->tree; 1367 int i, fid; 1368 1369 if (t->current_filesystem != NULL && 1370 t->current_filesystem->dev == dev) 1371 return (ARCHIVE_OK); 1372 1373 for (i = 0; i < t->max_filesystem_id; i++) { 1374 if (t->filesystem_table[i].dev == dev) { 1375 /* There is the filesystem ID we've already generated. */ 1376 t->current_filesystem_id = i; 1377 t->current_filesystem = &(t->filesystem_table[i]); 1378 return (ARCHIVE_OK); 1379 } 1380 } 1381 1382 /* 1383 * This is the new filesystem which we have to generate a new ID for. 1384 */ 1385 fid = t->max_filesystem_id++; 1386 if (t->max_filesystem_id > t->allocated_filesystem) { 1387 size_t s; 1388 void *p; 1389 1390 s = t->max_filesystem_id * 2; 1391 p = realloc(t->filesystem_table, 1392 s * sizeof(*t->filesystem_table)); 1393 if (p == NULL) { 1394 archive_set_error(&a->archive, ENOMEM, 1395 "Can't allocate tar data"); 1396 return (ARCHIVE_FATAL); 1397 } 1398 t->filesystem_table = (struct filesystem *)p; 1399 t->allocated_filesystem = s; 1400 } 1401 t->current_filesystem_id = fid; 1402 t->current_filesystem = &(t->filesystem_table[fid]); 1403 t->current_filesystem->dev = dev; 1404 t->current_filesystem->allocation_ptr = NULL; 1405 t->current_filesystem->buff = NULL; 1406 1407 /* Setup the current filesystem properties which depend on 1408 * platform specific. */ 1409 return (setup_current_filesystem(a)); 1410 } 1411 1412 /* 1413 * Returns 1 if current filesystem is generated filesystem, 0 if it is not 1414 * or -1 if it is unknown. 1415 */ 1416 int 1417 archive_read_disk_current_filesystem_is_synthetic(struct archive *_a) 1418 { 1419 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1420 1421 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, ARCHIVE_STATE_DATA, 1422 "archive_read_disk_current_filesystem"); 1423 1424 return (a->tree->current_filesystem->synthetic); 1425 } 1426 1427 /* 1428 * Returns 1 if current filesystem is remote filesystem, 0 if it is not 1429 * or -1 if it is unknown. 1430 */ 1431 int 1432 archive_read_disk_current_filesystem_is_remote(struct archive *_a) 1433 { 1434 struct archive_read_disk *a = (struct archive_read_disk *)_a; 1435 1436 archive_check_magic(_a, ARCHIVE_READ_DISK_MAGIC, ARCHIVE_STATE_DATA, 1437 "archive_read_disk_current_filesystem"); 1438 1439 return (a->tree->current_filesystem->remote); 1440 } 1441 1442 #if defined(_PC_REC_INCR_XFER_SIZE) && defined(_PC_REC_MAX_XFER_SIZE) &&\ 1443 defined(_PC_REC_MIN_XFER_SIZE) && defined(_PC_REC_XFER_ALIGN) 1444 static int 1445 get_xfer_size(struct tree *t, int fd, const char *path) 1446 { 1447 t->current_filesystem->xfer_align = -1; 1448 errno = 0; 1449 if (fd >= 0) { 1450 t->current_filesystem->incr_xfer_size = 1451 fpathconf(fd, _PC_REC_INCR_XFER_SIZE); 1452 t->current_filesystem->max_xfer_size = 1453 fpathconf(fd, _PC_REC_MAX_XFER_SIZE); 1454 t->current_filesystem->min_xfer_size = 1455 fpathconf(fd, _PC_REC_MIN_XFER_SIZE); 1456 t->current_filesystem->xfer_align = 1457 fpathconf(fd, _PC_REC_XFER_ALIGN); 1458 } else if (path != NULL) { 1459 t->current_filesystem->incr_xfer_size = 1460 pathconf(path, _PC_REC_INCR_XFER_SIZE); 1461 t->current_filesystem->max_xfer_size = 1462 pathconf(path, _PC_REC_MAX_XFER_SIZE); 1463 t->current_filesystem->min_xfer_size = 1464 pathconf(path, _PC_REC_MIN_XFER_SIZE); 1465 t->current_filesystem->xfer_align = 1466 pathconf(path, _PC_REC_XFER_ALIGN); 1467 } 1468 /* At least we need an alignment size. */ 1469 if (t->current_filesystem->xfer_align == -1) 1470 return ((errno == EINVAL)?1:-1); 1471 else 1472 return (0); 1473 } 1474 #else 1475 static int 1476 get_xfer_size(struct tree *t, int fd, const char *path) 1477 { 1478 (void)t; /* UNUSED */ 1479 (void)fd; /* UNUSED */ 1480 (void)path; /* UNUSED */ 1481 return (1);/* Not supported */ 1482 } 1483 #endif 1484 1485 #if defined(HAVE_STATFS) && defined(HAVE_FSTATFS) && defined(MNT_LOCAL) \ 1486 && !defined(ST_LOCAL) 1487 1488 /* 1489 * Gather current filesystem properties on FreeBSD, OpenBSD and Mac OS X. 1490 */ 1491 static int 1492 setup_current_filesystem(struct archive_read_disk *a) 1493 { 1494 struct tree *t = a->tree; 1495 struct statfs sfs; 1496 #if defined(HAVE_GETVFSBYNAME) && defined(VFCF_SYNTHETIC) 1497 /* TODO: configure should set GETVFSBYNAME_ARG_TYPE to make 1498 * this accurate; some platforms have both and we need the one that's 1499 * used by getvfsbyname() 1500 * 1501 * Then the following would become: 1502 * #if defined(GETVFSBYNAME_ARG_TYPE) 1503 * GETVFSBYNAME_ARG_TYPE vfc; 1504 * #endif 1505 */ 1506 # if defined(HAVE_STRUCT_XVFSCONF) 1507 struct xvfsconf vfc; 1508 # else 1509 struct vfsconf vfc; 1510 # endif 1511 #endif 1512 int r, xr = 0; 1513 #if !defined(HAVE_STRUCT_STATFS_F_NAMEMAX) 1514 long nm; 1515 #endif 1516 1517 t->current_filesystem->synthetic = -1; 1518 t->current_filesystem->remote = -1; 1519 if (tree_current_is_symblic_link_target(t)) { 1520 #if defined(HAVE_OPENAT) 1521 /* 1522 * Get file system statistics on any directory 1523 * where current is. 1524 */ 1525 int fd = openat(tree_current_dir_fd(t), 1526 tree_current_access_path(t), O_RDONLY | O_CLOEXEC); 1527 __archive_ensure_cloexec_flag(fd); 1528 if (fd < 0) { 1529 archive_set_error(&a->archive, errno, 1530 "openat failed"); 1531 return (ARCHIVE_FAILED); 1532 } 1533 r = fstatfs(fd, &sfs); 1534 if (r == 0) 1535 xr = get_xfer_size(t, fd, NULL); 1536 close(fd); 1537 #else 1538 if (tree_enter_working_dir(t) != 0) { 1539 archive_set_error(&a->archive, errno, "fchdir failed"); 1540 return (ARCHIVE_FAILED); 1541 } 1542 r = statfs(tree_current_access_path(t), &sfs); 1543 if (r == 0) 1544 xr = get_xfer_size(t, -1, tree_current_access_path(t)); 1545 #endif 1546 } else { 1547 r = fstatfs(tree_current_dir_fd(t), &sfs); 1548 if (r == 0) 1549 xr = get_xfer_size(t, tree_current_dir_fd(t), NULL); 1550 } 1551 if (r == -1 || xr == -1) { 1552 archive_set_error(&a->archive, errno, "statfs failed"); 1553 return (ARCHIVE_FAILED); 1554 } else if (xr == 1) { 1555 /* pathconf(_PC_REX_*) operations are not supported. */ 1556 t->current_filesystem->xfer_align = sfs.f_bsize; 1557 t->current_filesystem->max_xfer_size = -1; 1558 t->current_filesystem->min_xfer_size = sfs.f_iosize; 1559 t->current_filesystem->incr_xfer_size = sfs.f_iosize; 1560 } 1561 if (sfs.f_flags & MNT_LOCAL) 1562 t->current_filesystem->remote = 0; 1563 else 1564 t->current_filesystem->remote = 1; 1565 1566 #if defined(HAVE_GETVFSBYNAME) && defined(VFCF_SYNTHETIC) 1567 r = getvfsbyname(sfs.f_fstypename, &vfc); 1568 if (r == -1) { 1569 archive_set_error(&a->archive, errno, "getvfsbyname failed"); 1570 return (ARCHIVE_FAILED); 1571 } 1572 if (vfc.vfc_flags & VFCF_SYNTHETIC) 1573 t->current_filesystem->synthetic = 1; 1574 else 1575 t->current_filesystem->synthetic = 0; 1576 #endif 1577 1578 #if defined(MNT_NOATIME) 1579 if (sfs.f_flags & MNT_NOATIME) 1580 t->current_filesystem->noatime = 1; 1581 else 1582 #endif 1583 t->current_filesystem->noatime = 0; 1584 1585 #if defined(USE_READDIR_R) 1586 /* Set maximum filename length. */ 1587 #if defined(HAVE_STRUCT_STATFS_F_NAMEMAX) 1588 t->current_filesystem->name_max = sfs.f_namemax; 1589 #else 1590 # if defined(_PC_NAME_MAX) 1591 /* Mac OS X does not have f_namemax in struct statfs. */ 1592 if (tree_current_is_symblic_link_target(t)) { 1593 if (tree_enter_working_dir(t) != 0) { 1594 archive_set_error(&a->archive, errno, "fchdir failed"); 1595 return (ARCHIVE_FAILED); 1596 } 1597 nm = pathconf(tree_current_access_path(t), _PC_NAME_MAX); 1598 } else 1599 nm = fpathconf(tree_current_dir_fd(t), _PC_NAME_MAX); 1600 # else 1601 nm = -1; 1602 # endif 1603 if (nm == -1) 1604 t->current_filesystem->name_max = NAME_MAX; 1605 else 1606 t->current_filesystem->name_max = nm; 1607 #endif 1608 #endif /* USE_READDIR_R */ 1609 return (ARCHIVE_OK); 1610 } 1611 1612 #elif (defined(HAVE_STATVFS) || defined(HAVE_FSTATVFS)) && defined(ST_LOCAL) 1613 1614 /* 1615 * Gather current filesystem properties on NetBSD 1616 */ 1617 static int 1618 setup_current_filesystem(struct archive_read_disk *a) 1619 { 1620 struct tree *t = a->tree; 1621 struct statvfs sfs; 1622 int r, xr = 0; 1623 1624 t->current_filesystem->synthetic = -1; 1625 if (tree_enter_working_dir(t) != 0) { 1626 archive_set_error(&a->archive, errno, "fchdir failed"); 1627 return (ARCHIVE_FAILED); 1628 } 1629 if (tree_current_is_symblic_link_target(t)) { 1630 r = statvfs(tree_current_access_path(t), &sfs); 1631 if (r == 0) 1632 xr = get_xfer_size(t, -1, tree_current_access_path(t)); 1633 } else { 1634 #ifdef HAVE_FSTATVFS 1635 r = fstatvfs(tree_current_dir_fd(t), &sfs); 1636 if (r == 0) 1637 xr = get_xfer_size(t, tree_current_dir_fd(t), NULL); 1638 #else 1639 r = statvfs(".", &sfs); 1640 if (r == 0) 1641 xr = get_xfer_size(t, -1, "."); 1642 #endif 1643 } 1644 if (r == -1 || xr == -1) { 1645 t->current_filesystem->remote = -1; 1646 archive_set_error(&a->archive, errno, "statvfs failed"); 1647 return (ARCHIVE_FAILED); 1648 } else if (xr == 1) { 1649 /* Usually come here unless NetBSD supports _PC_REC_XFER_ALIGN 1650 * for pathconf() function. */ 1651 t->current_filesystem->xfer_align = sfs.f_frsize; 1652 t->current_filesystem->max_xfer_size = -1; 1653 #if defined(HAVE_STRUCT_STATVFS_F_IOSIZE) 1654 t->current_filesystem->min_xfer_size = sfs.f_iosize; 1655 t->current_filesystem->incr_xfer_size = sfs.f_iosize; 1656 #else 1657 t->current_filesystem->min_xfer_size = sfs.f_bsize; 1658 t->current_filesystem->incr_xfer_size = sfs.f_bsize; 1659 #endif 1660 } 1661 if (sfs.f_flag & ST_LOCAL) 1662 t->current_filesystem->remote = 0; 1663 else 1664 t->current_filesystem->remote = 1; 1665 1666 #if defined(ST_NOATIME) 1667 if (sfs.f_flag & ST_NOATIME) 1668 t->current_filesystem->noatime = 1; 1669 else 1670 #endif 1671 t->current_filesystem->noatime = 0; 1672 1673 /* Set maximum filename length. */ 1674 t->current_filesystem->name_max = sfs.f_namemax; 1675 return (ARCHIVE_OK); 1676 } 1677 1678 #elif defined(HAVE_SYS_STATFS_H) && defined(HAVE_LINUX_MAGIC_H) &&\ 1679 defined(HAVE_STATFS) && defined(HAVE_FSTATFS) 1680 /* 1681 * Note: statfs is deprecated since LSB 3.2 1682 */ 1683 1684 #ifndef CIFS_SUPER_MAGIC 1685 #define CIFS_SUPER_MAGIC 0xFF534D42 1686 #endif 1687 #ifndef DEVFS_SUPER_MAGIC 1688 #define DEVFS_SUPER_MAGIC 0x1373 1689 #endif 1690 1691 /* 1692 * Gather current filesystem properties on Linux 1693 */ 1694 static int 1695 setup_current_filesystem(struct archive_read_disk *a) 1696 { 1697 struct tree *t = a->tree; 1698 struct statfs sfs; 1699 #if defined(HAVE_STATVFS) 1700 struct statvfs svfs; 1701 #endif 1702 int r, vr = 0, xr = 0; 1703 1704 if (tree_current_is_symblic_link_target(t)) { 1705 #if defined(HAVE_OPENAT) 1706 /* 1707 * Get file system statistics on any directory 1708 * where current is. 1709 */ 1710 int fd = openat(tree_current_dir_fd(t), 1711 tree_current_access_path(t), O_RDONLY | O_CLOEXEC); 1712 __archive_ensure_cloexec_flag(fd); 1713 if (fd < 0) { 1714 archive_set_error(&a->archive, errno, 1715 "openat failed"); 1716 return (ARCHIVE_FAILED); 1717 } 1718 #if defined(HAVE_FSTATVFS) 1719 vr = fstatvfs(fd, &svfs);/* for f_flag, mount flags */ 1720 #endif 1721 r = fstatfs(fd, &sfs); 1722 if (r == 0) 1723 xr = get_xfer_size(t, fd, NULL); 1724 close(fd); 1725 #else 1726 if (tree_enter_working_dir(t) != 0) { 1727 archive_set_error(&a->archive, errno, "fchdir failed"); 1728 return (ARCHIVE_FAILED); 1729 } 1730 #if defined(HAVE_STATVFS) 1731 vr = statvfs(tree_current_access_path(t), &svfs); 1732 #endif 1733 r = statfs(tree_current_access_path(t), &sfs); 1734 if (r == 0) 1735 xr = get_xfer_size(t, -1, tree_current_access_path(t)); 1736 #endif 1737 } else { 1738 #ifdef HAVE_FSTATFS 1739 #if defined(HAVE_FSTATVFS) 1740 vr = fstatvfs(tree_current_dir_fd(t), &svfs); 1741 #endif 1742 r = fstatfs(tree_current_dir_fd(t), &sfs); 1743 if (r == 0) 1744 xr = get_xfer_size(t, tree_current_dir_fd(t), NULL); 1745 #else 1746 if (tree_enter_working_dir(t) != 0) { 1747 archive_set_error(&a->archive, errno, "fchdir failed"); 1748 return (ARCHIVE_FAILED); 1749 } 1750 #if defined(HAVE_STATVFS) 1751 vr = statvfs(".", &svfs); 1752 #endif 1753 r = statfs(".", &sfs); 1754 if (r == 0) 1755 xr = get_xfer_size(t, -1, "."); 1756 #endif 1757 } 1758 if (r == -1 || xr == -1 || vr == -1) { 1759 t->current_filesystem->synthetic = -1; 1760 t->current_filesystem->remote = -1; 1761 archive_set_error(&a->archive, errno, "statfs failed"); 1762 return (ARCHIVE_FAILED); 1763 } else if (xr == 1) { 1764 /* pathconf(_PC_REX_*) operations are not supported. */ 1765 #if defined(HAVE_STATVFS) 1766 t->current_filesystem->xfer_align = svfs.f_frsize; 1767 t->current_filesystem->max_xfer_size = -1; 1768 t->current_filesystem->min_xfer_size = svfs.f_bsize; 1769 t->current_filesystem->incr_xfer_size = svfs.f_bsize; 1770 #else 1771 t->current_filesystem->xfer_align = sfs.f_frsize; 1772 t->current_filesystem->max_xfer_size = -1; 1773 t->current_filesystem->min_xfer_size = sfs.f_bsize; 1774 t->current_filesystem->incr_xfer_size = sfs.f_bsize; 1775 #endif 1776 } 1777 switch (sfs.f_type) { 1778 case AFS_SUPER_MAGIC: 1779 case CIFS_SUPER_MAGIC: 1780 case CODA_SUPER_MAGIC: 1781 case NCP_SUPER_MAGIC:/* NetWare */ 1782 case NFS_SUPER_MAGIC: 1783 case SMB_SUPER_MAGIC: 1784 t->current_filesystem->remote = 1; 1785 t->current_filesystem->synthetic = 0; 1786 break; 1787 case DEVFS_SUPER_MAGIC: 1788 case PROC_SUPER_MAGIC: 1789 case USBDEVICE_SUPER_MAGIC: 1790 t->current_filesystem->remote = 0; 1791 t->current_filesystem->synthetic = 1; 1792 break; 1793 default: 1794 t->current_filesystem->remote = 0; 1795 t->current_filesystem->synthetic = 0; 1796 break; 1797 } 1798 1799 #if defined(ST_NOATIME) 1800 #if defined(HAVE_STATVFS) 1801 if (svfs.f_flag & ST_NOATIME) 1802 #else 1803 if (sfs.f_flag & ST_NOATIME) 1804 #endif 1805 t->current_filesystem->noatime = 1; 1806 else 1807 #endif 1808 t->current_filesystem->noatime = 0; 1809 1810 #if defined(USE_READDIR_R) 1811 /* Set maximum filename length. */ 1812 t->current_filesystem->name_max = sfs.f_namelen; 1813 #endif 1814 return (ARCHIVE_OK); 1815 } 1816 1817 #elif defined(HAVE_SYS_STATVFS_H) &&\ 1818 (defined(HAVE_STATVFS) || defined(HAVE_FSTATVFS)) 1819 1820 /* 1821 * Gather current filesystem properties on other posix platform. 1822 */ 1823 static int 1824 setup_current_filesystem(struct archive_read_disk *a) 1825 { 1826 struct tree *t = a->tree; 1827 struct statvfs sfs; 1828 int r, xr = 0; 1829 1830 t->current_filesystem->synthetic = -1;/* Not supported */ 1831 t->current_filesystem->remote = -1;/* Not supported */ 1832 if (tree_current_is_symblic_link_target(t)) { 1833 #if defined(HAVE_OPENAT) 1834 /* 1835 * Get file system statistics on any directory 1836 * where current is. 1837 */ 1838 int fd = openat(tree_current_dir_fd(t), 1839 tree_current_access_path(t), O_RDONLY | O_CLOEXEC); 1840 __archive_ensure_cloexec_flag(fd); 1841 if (fd < 0) { 1842 archive_set_error(&a->archive, errno, 1843 "openat failed"); 1844 return (ARCHIVE_FAILED); 1845 } 1846 r = fstatvfs(fd, &sfs); 1847 if (r == 0) 1848 xr = get_xfer_size(t, fd, NULL); 1849 close(fd); 1850 #else 1851 if (tree_enter_working_dir(t) != 0) { 1852 archive_set_error(&a->archive, errno, "fchdir failed"); 1853 return (ARCHIVE_FAILED); 1854 } 1855 r = statvfs(tree_current_access_path(t), &sfs); 1856 if (r == 0) 1857 xr = get_xfer_size(t, -1, tree_current_access_path(t)); 1858 #endif 1859 } else { 1860 #ifdef HAVE_FSTATVFS 1861 r = fstatvfs(tree_current_dir_fd(t), &sfs); 1862 if (r == 0) 1863 xr = get_xfer_size(t, tree_current_dir_fd(t), NULL); 1864 #else 1865 if (tree_enter_working_dir(t) != 0) { 1866 archive_set_error(&a->archive, errno, "fchdir failed"); 1867 return (ARCHIVE_FAILED); 1868 } 1869 r = statvfs(".", &sfs); 1870 if (r == 0) 1871 xr = get_xfer_size(t, -1, "."); 1872 #endif 1873 } 1874 if (r == -1 || xr == -1) { 1875 t->current_filesystem->synthetic = -1; 1876 t->current_filesystem->remote = -1; 1877 archive_set_error(&a->archive, errno, "statvfs failed"); 1878 return (ARCHIVE_FAILED); 1879 } else if (xr == 1) { 1880 /* pathconf(_PC_REX_*) operations are not supported. */ 1881 t->current_filesystem->xfer_align = sfs.f_frsize; 1882 t->current_filesystem->max_xfer_size = -1; 1883 t->current_filesystem->min_xfer_size = sfs.f_bsize; 1884 t->current_filesystem->incr_xfer_size = sfs.f_bsize; 1885 } 1886 1887 #if defined(ST_NOATIME) 1888 if (sfs.f_flag & ST_NOATIME) 1889 t->current_filesystem->noatime = 1; 1890 else 1891 #endif 1892 t->current_filesystem->noatime = 0; 1893 1894 #if defined(USE_READDIR_R) 1895 /* Set maximum filename length. */ 1896 t->current_filesystem->name_max = sfs.f_namemax; 1897 #endif 1898 return (ARCHIVE_OK); 1899 } 1900 1901 #else 1902 1903 /* 1904 * Generic: Gather current filesystem properties. 1905 * TODO: Is this generic function really needed? 1906 */ 1907 static int 1908 setup_current_filesystem(struct archive_read_disk *a) 1909 { 1910 struct tree *t = a->tree; 1911 #if defined(_PC_NAME_MAX) && defined(USE_READDIR_R) 1912 long nm; 1913 #endif 1914 t->current_filesystem->synthetic = -1;/* Not supported */ 1915 t->current_filesystem->remote = -1;/* Not supported */ 1916 t->current_filesystem->noatime = 0; 1917 (void)get_xfer_size(t, -1, ".");/* Dummy call to avoid build error. */ 1918 t->current_filesystem->xfer_align = -1;/* Unknown */ 1919 t->current_filesystem->max_xfer_size = -1; 1920 t->current_filesystem->min_xfer_size = -1; 1921 t->current_filesystem->incr_xfer_size = -1; 1922 1923 #if defined(USE_READDIR_R) 1924 /* Set maximum filename length. */ 1925 # if defined(_PC_NAME_MAX) 1926 if (tree_current_is_symblic_link_target(t)) { 1927 if (tree_enter_working_dir(t) != 0) { 1928 archive_set_error(&a->archive, errno, "fchdir failed"); 1929 return (ARCHIVE_FAILED); 1930 } 1931 nm = pathconf(tree_current_access_path(t), _PC_NAME_MAX); 1932 } else 1933 nm = fpathconf(tree_current_dir_fd(t), _PC_NAME_MAX); 1934 if (nm == -1) 1935 # endif /* _PC_NAME_MAX */ 1936 /* 1937 * Some systems (HP-UX or others?) incorrectly defined 1938 * NAME_MAX macro to be a smaller value. 1939 */ 1940 # if defined(NAME_MAX) && NAME_MAX >= 255 1941 t->current_filesystem->name_max = NAME_MAX; 1942 # else 1943 /* No way to get a trusted value of maximum filename 1944 * length. */ 1945 t->current_filesystem->name_max = PATH_MAX; 1946 # endif /* NAME_MAX */ 1947 # if defined(_PC_NAME_MAX) 1948 else 1949 t->current_filesystem->name_max = nm; 1950 # endif /* _PC_NAME_MAX */ 1951 #endif /* USE_READDIR_R */ 1952 return (ARCHIVE_OK); 1953 } 1954 1955 #endif 1956 1957 static int 1958 close_and_restore_time(int fd, struct tree *t, struct restore_time *rt) 1959 { 1960 #ifndef HAVE_UTIMES 1961 (void)t; /* UNUSED */ 1962 (void)rt; /* UNUSED */ 1963 return (close(fd)); 1964 #else 1965 #if defined(HAVE_FUTIMENS) && !defined(__CYGWIN__) 1966 struct timespec timespecs[2]; 1967 #endif 1968 struct timeval times[2]; 1969 1970 if ((t->flags & needsRestoreTimes) == 0 || rt->noatime) { 1971 if (fd >= 0) 1972 return (close(fd)); 1973 else 1974 return (0); 1975 } 1976 1977 #if defined(HAVE_FUTIMENS) && !defined(__CYGWIN__) 1978 if (rt->mtime == (time_t)-1) { 1979 timespecs[1].tv_sec = 0; 1980 timespecs[1].tv_nsec = UTIME_OMIT; 1981 } else { 1982 timespecs[1].tv_sec = rt->mtime; 1983 timespecs[1].tv_nsec = rt->mtime_nsec; 1984 } 1985 1986 if (rt->atime == (time_t)-1) { 1987 timespecs[0].tv_sec = 0; 1988 timespecs[0].tv_nsec = UTIME_OMIT; 1989 } else { 1990 timespecs[0].tv_sec = rt->atime; 1991 timespecs[0].tv_nsec = rt->atime_nsec; 1992 } 1993 /* futimens() is defined in POSIX.1-2008. */ 1994 if (futimens(fd, timespecs) == 0) 1995 return (close(fd)); 1996 #endif 1997 1998 times[1].tv_sec = rt->mtime; 1999 times[1].tv_usec = rt->mtime_nsec / 1000; 2000 2001 times[0].tv_sec = rt->atime; 2002 times[0].tv_usec = rt->atime_nsec / 1000; 2003 2004 #if !defined(HAVE_FUTIMENS) && defined(HAVE_FUTIMES) && !defined(__CYGWIN__) 2005 if (futimes(fd, times) == 0) 2006 return (close(fd)); 2007 #endif 2008 close(fd); 2009 #if defined(HAVE_FUTIMESAT) 2010 if (futimesat(tree_current_dir_fd(t), rt->name, times) == 0) 2011 return (0); 2012 #endif 2013 #ifdef HAVE_LUTIMES 2014 if (lutimes(rt->name, times) != 0) 2015 #else 2016 if (AE_IFLNK != rt->filetype && utimes(rt->name, times) != 0) 2017 #endif 2018 return (-1); 2019 #endif 2020 return (0); 2021 } 2022 2023 static int 2024 open_on_current_dir(struct tree *t, const char *path, int flags) 2025 { 2026 #ifdef HAVE_OPENAT 2027 return (openat(tree_current_dir_fd(t), path, flags)); 2028 #else 2029 if (tree_enter_working_dir(t) != 0) 2030 return (-1); 2031 return (open(path, flags)); 2032 #endif 2033 } 2034 2035 static int 2036 tree_dup(int fd) 2037 { 2038 int new_fd; 2039 #ifdef F_DUPFD_CLOEXEC 2040 static volatile int can_dupfd_cloexec = 1; 2041 2042 if (can_dupfd_cloexec) { 2043 new_fd = fcntl(fd, F_DUPFD_CLOEXEC, 0); 2044 if (new_fd != -1) 2045 return (new_fd); 2046 /* Linux 2.6.18 - 2.6.23 declare F_DUPFD_CLOEXEC, 2047 * but it cannot be used. So we have to try dup(). */ 2048 /* We won't try F_DUPFD_CLOEXEC. */ 2049 can_dupfd_cloexec = 0; 2050 } 2051 #endif /* F_DUPFD_CLOEXEC */ 2052 new_fd = dup(fd); 2053 __archive_ensure_cloexec_flag(new_fd); 2054 return (new_fd); 2055 } 2056 2057 /* 2058 * Add a directory path to the current stack. 2059 */ 2060 static void 2061 tree_push(struct tree *t, const char *path, int filesystem_id, 2062 int64_t dev, int64_t ino, struct restore_time *rt) 2063 { 2064 struct tree_entry *te; 2065 2066 te = calloc(1, sizeof(*te)); 2067 te->next = t->stack; 2068 te->parent = t->current; 2069 if (te->parent) 2070 te->depth = te->parent->depth + 1; 2071 t->stack = te; 2072 archive_string_init(&te->name); 2073 te->symlink_parent_fd = -1; 2074 archive_strcpy(&te->name, path); 2075 te->flags = needsDescent | needsOpen | needsAscent; 2076 te->filesystem_id = filesystem_id; 2077 te->dev = dev; 2078 te->ino = ino; 2079 te->dirname_length = t->dirname_length; 2080 te->restore_time.name = te->name.s; 2081 if (rt != NULL) { 2082 te->restore_time.mtime = rt->mtime; 2083 te->restore_time.mtime_nsec = rt->mtime_nsec; 2084 te->restore_time.atime = rt->atime; 2085 te->restore_time.atime_nsec = rt->atime_nsec; 2086 te->restore_time.filetype = rt->filetype; 2087 te->restore_time.noatime = rt->noatime; 2088 } 2089 } 2090 2091 /* 2092 * Append a name to the current dir path. 2093 */ 2094 static void 2095 tree_append(struct tree *t, const char *name, size_t name_length) 2096 { 2097 size_t size_needed; 2098 2099 t->path.s[t->dirname_length] = '\0'; 2100 t->path.length = t->dirname_length; 2101 /* Strip trailing '/' from name, unless entire name is "/". */ 2102 while (name_length > 1 && name[name_length - 1] == '/') 2103 name_length--; 2104 2105 /* Resize pathname buffer as needed. */ 2106 size_needed = name_length + t->dirname_length + 2; 2107 archive_string_ensure(&t->path, size_needed); 2108 /* Add a separating '/' if it's needed. */ 2109 if (t->dirname_length > 0 && t->path.s[archive_strlen(&t->path)-1] != '/') 2110 archive_strappend_char(&t->path, '/'); 2111 t->basename = t->path.s + archive_strlen(&t->path); 2112 archive_strncat(&t->path, name, name_length); 2113 t->restore_time.name = t->basename; 2114 } 2115 2116 /* 2117 * Open a directory tree for traversal. 2118 */ 2119 static struct tree * 2120 tree_open(const char *path, int symlink_mode, int restore_time) 2121 { 2122 struct tree *t; 2123 2124 if ((t = calloc(1, sizeof(*t))) == NULL) 2125 return (NULL); 2126 archive_string_init(&t->path); 2127 archive_string_ensure(&t->path, 31); 2128 t->initial_symlink_mode = symlink_mode; 2129 return (tree_reopen(t, path, restore_time)); 2130 } 2131 2132 static struct tree * 2133 tree_reopen(struct tree *t, const char *path, int restore_time) 2134 { 2135 t->flags = (restore_time != 0)?needsRestoreTimes:0; 2136 t->flags |= onInitialDir; 2137 t->visit_type = 0; 2138 t->tree_errno = 0; 2139 t->dirname_length = 0; 2140 t->depth = 0; 2141 t->descend = 0; 2142 t->current = NULL; 2143 t->d = INVALID_DIR_HANDLE; 2144 t->symlink_mode = t->initial_symlink_mode; 2145 archive_string_empty(&t->path); 2146 t->entry_fd = -1; 2147 t->entry_eof = 0; 2148 t->entry_remaining_bytes = 0; 2149 t->initial_filesystem_id = -1; 2150 2151 /* First item is set up a lot like a symlink traversal. */ 2152 tree_push(t, path, 0, 0, 0, NULL); 2153 t->stack->flags = needsFirstVisit; 2154 t->maxOpenCount = t->openCount = 1; 2155 t->initial_dir_fd = open(".", O_RDONLY | O_CLOEXEC); 2156 __archive_ensure_cloexec_flag(t->initial_dir_fd); 2157 t->working_dir_fd = tree_dup(t->initial_dir_fd); 2158 return (t); 2159 } 2160 2161 static int 2162 tree_descent(struct tree *t) 2163 { 2164 int flag, new_fd, r = 0; 2165 2166 t->dirname_length = archive_strlen(&t->path); 2167 flag = O_RDONLY | O_CLOEXEC; 2168 #if defined(O_DIRECTORY) 2169 flag |= O_DIRECTORY; 2170 #endif 2171 new_fd = open_on_current_dir(t, t->stack->name.s, flag); 2172 __archive_ensure_cloexec_flag(new_fd); 2173 if (new_fd < 0) { 2174 t->tree_errno = errno; 2175 r = TREE_ERROR_DIR; 2176 } else { 2177 t->depth++; 2178 /* If it is a link, set up fd for the ascent. */ 2179 if (t->stack->flags & isDirLink) { 2180 t->stack->symlink_parent_fd = t->working_dir_fd; 2181 t->openCount++; 2182 if (t->openCount > t->maxOpenCount) 2183 t->maxOpenCount = t->openCount; 2184 } else 2185 close(t->working_dir_fd); 2186 /* Renew the current working directory. */ 2187 t->working_dir_fd = new_fd; 2188 t->flags &= ~onWorkingDir; 2189 } 2190 return (r); 2191 } 2192 2193 /* 2194 * We've finished a directory; ascend back to the parent. 2195 */ 2196 static int 2197 tree_ascend(struct tree *t) 2198 { 2199 struct tree_entry *te; 2200 int new_fd, r = 0, prev_dir_fd; 2201 2202 te = t->stack; 2203 prev_dir_fd = t->working_dir_fd; 2204 if (te->flags & isDirLink) 2205 new_fd = te->symlink_parent_fd; 2206 else { 2207 new_fd = open_on_current_dir(t, "..", O_RDONLY | O_CLOEXEC); 2208 __archive_ensure_cloexec_flag(new_fd); 2209 } 2210 if (new_fd < 0) { 2211 t->tree_errno = errno; 2212 r = TREE_ERROR_FATAL; 2213 } else { 2214 /* Renew the current working directory. */ 2215 t->working_dir_fd = new_fd; 2216 t->flags &= ~onWorkingDir; 2217 /* Current directory has been changed, we should 2218 * close an fd of previous working directory. */ 2219 close_and_restore_time(prev_dir_fd, t, &te->restore_time); 2220 if (te->flags & isDirLink) { 2221 t->openCount--; 2222 te->symlink_parent_fd = -1; 2223 } 2224 t->depth--; 2225 } 2226 return (r); 2227 } 2228 2229 /* 2230 * Return to the initial directory where tree_open() was performed. 2231 */ 2232 static int 2233 tree_enter_initial_dir(struct tree *t) 2234 { 2235 int r = 0; 2236 2237 if ((t->flags & onInitialDir) == 0) { 2238 r = fchdir(t->initial_dir_fd); 2239 if (r == 0) { 2240 t->flags &= ~onWorkingDir; 2241 t->flags |= onInitialDir; 2242 } 2243 } 2244 return (r); 2245 } 2246 2247 /* 2248 * Restore working directory of directory traversals. 2249 */ 2250 static int 2251 tree_enter_working_dir(struct tree *t) 2252 { 2253 int r = 0; 2254 2255 /* 2256 * Change the current directory if really needed. 2257 * Sometimes this is unneeded when we did not do 2258 * descent. 2259 */ 2260 if (t->depth > 0 && (t->flags & onWorkingDir) == 0) { 2261 r = fchdir(t->working_dir_fd); 2262 if (r == 0) { 2263 t->flags &= ~onInitialDir; 2264 t->flags |= onWorkingDir; 2265 } 2266 } 2267 return (r); 2268 } 2269 2270 static int 2271 tree_current_dir_fd(struct tree *t) 2272 { 2273 return (t->working_dir_fd); 2274 } 2275 2276 /* 2277 * Pop the working stack. 2278 */ 2279 static void 2280 tree_pop(struct tree *t) 2281 { 2282 struct tree_entry *te; 2283 2284 t->path.s[t->dirname_length] = '\0'; 2285 t->path.length = t->dirname_length; 2286 if (t->stack == t->current && t->current != NULL) 2287 t->current = t->current->parent; 2288 te = t->stack; 2289 t->stack = te->next; 2290 t->dirname_length = te->dirname_length; 2291 t->basename = t->path.s + t->dirname_length; 2292 while (t->basename[0] == '/') 2293 t->basename++; 2294 archive_string_free(&te->name); 2295 free(te); 2296 } 2297 2298 /* 2299 * Get the next item in the tree traversal. 2300 */ 2301 static int 2302 tree_next(struct tree *t) 2303 { 2304 int r; 2305 2306 while (t->stack != NULL) { 2307 /* If there's an open dir, get the next entry from there. */ 2308 if (t->d != INVALID_DIR_HANDLE) { 2309 r = tree_dir_next_posix(t); 2310 if (r == 0) 2311 continue; 2312 return (r); 2313 } 2314 2315 if (t->stack->flags & needsFirstVisit) { 2316 /* Top stack item needs a regular visit. */ 2317 t->current = t->stack; 2318 tree_append(t, t->stack->name.s, 2319 archive_strlen(&(t->stack->name))); 2320 /* t->dirname_length = t->path_length; */ 2321 /* tree_pop(t); */ 2322 t->stack->flags &= ~needsFirstVisit; 2323 return (t->visit_type = TREE_REGULAR); 2324 } else if (t->stack->flags & needsDescent) { 2325 /* Top stack item is dir to descend into. */ 2326 t->current = t->stack; 2327 tree_append(t, t->stack->name.s, 2328 archive_strlen(&(t->stack->name))); 2329 t->stack->flags &= ~needsDescent; 2330 r = tree_descent(t); 2331 if (r != 0) { 2332 tree_pop(t); 2333 t->visit_type = r; 2334 } else 2335 t->visit_type = TREE_POSTDESCENT; 2336 return (t->visit_type); 2337 } else if (t->stack->flags & needsOpen) { 2338 t->stack->flags &= ~needsOpen; 2339 r = tree_dir_next_posix(t); 2340 if (r == 0) 2341 continue; 2342 return (r); 2343 } else if (t->stack->flags & needsAscent) { 2344 /* Top stack item is dir and we're done with it. */ 2345 r = tree_ascend(t); 2346 tree_pop(t); 2347 t->visit_type = r != 0 ? r : TREE_POSTASCENT; 2348 return (t->visit_type); 2349 } else { 2350 /* Top item on stack is dead. */ 2351 tree_pop(t); 2352 t->flags &= ~hasLstat; 2353 t->flags &= ~hasStat; 2354 } 2355 } 2356 return (t->visit_type = 0); 2357 } 2358 2359 static int 2360 tree_dir_next_posix(struct tree *t) 2361 { 2362 int r; 2363 const char *name; 2364 size_t namelen; 2365 2366 if (t->d == NULL) { 2367 #if defined(USE_READDIR_R) 2368 size_t dirent_size; 2369 #endif 2370 2371 #if defined(HAVE_FDOPENDIR) 2372 t->d = fdopendir(tree_dup(t->working_dir_fd)); 2373 #else /* HAVE_FDOPENDIR */ 2374 if (tree_enter_working_dir(t) == 0) { 2375 t->d = opendir("."); 2376 #if HAVE_DIRFD || defined(dirfd) 2377 __archive_ensure_cloexec_flag(dirfd(t->d)); 2378 #endif 2379 } 2380 #endif /* HAVE_FDOPENDIR */ 2381 if (t->d == NULL) { 2382 r = tree_ascend(t); /* Undo "chdir" */ 2383 tree_pop(t); 2384 t->tree_errno = errno; 2385 t->visit_type = r != 0 ? r : TREE_ERROR_DIR; 2386 return (t->visit_type); 2387 } 2388 #if defined(USE_READDIR_R) 2389 dirent_size = offsetof(struct dirent, d_name) + 2390 t->filesystem_table[t->current->filesystem_id].name_max + 1; 2391 if (t->dirent == NULL || t->dirent_allocated < dirent_size) { 2392 free(t->dirent); 2393 t->dirent = malloc(dirent_size); 2394 if (t->dirent == NULL) { 2395 closedir(t->d); 2396 t->d = INVALID_DIR_HANDLE; 2397 (void)tree_ascend(t); 2398 tree_pop(t); 2399 t->tree_errno = ENOMEM; 2400 t->visit_type = TREE_ERROR_DIR; 2401 return (t->visit_type); 2402 } 2403 t->dirent_allocated = dirent_size; 2404 } 2405 #endif /* USE_READDIR_R */ 2406 } 2407 for (;;) { 2408 errno = 0; 2409 #if defined(USE_READDIR_R) 2410 r = readdir_r(t->d, t->dirent, &t->de); 2411 #ifdef _AIX 2412 /* Note: According to the man page, return value 9 indicates 2413 * that the readdir_r was not successful and the error code 2414 * is set to the global errno variable. And then if the end 2415 * of directory entries was reached, the return value is 9 2416 * and the third parameter is set to NULL and errno is 2417 * unchanged. */ 2418 if (r == 9) 2419 r = errno; 2420 #endif /* _AIX */ 2421 if (r != 0 || t->de == NULL) { 2422 #else 2423 t->de = readdir(t->d); 2424 if (t->de == NULL) { 2425 r = errno; 2426 #endif 2427 closedir(t->d); 2428 t->d = INVALID_DIR_HANDLE; 2429 if (r != 0) { 2430 t->tree_errno = r; 2431 t->visit_type = TREE_ERROR_DIR; 2432 return (t->visit_type); 2433 } else 2434 return (0); 2435 } 2436 name = t->de->d_name; 2437 namelen = D_NAMELEN(t->de); 2438 t->flags &= ~hasLstat; 2439 t->flags &= ~hasStat; 2440 if (name[0] == '.' && name[1] == '\0') 2441 continue; 2442 if (name[0] == '.' && name[1] == '.' && name[2] == '\0') 2443 continue; 2444 tree_append(t, name, namelen); 2445 return (t->visit_type = TREE_REGULAR); 2446 } 2447 } 2448 2449 2450 /* 2451 * Get the stat() data for the entry just returned from tree_next(). 2452 */ 2453 static const struct stat * 2454 tree_current_stat(struct tree *t) 2455 { 2456 if (!(t->flags & hasStat)) { 2457 #ifdef HAVE_FSTATAT 2458 if (fstatat(tree_current_dir_fd(t), 2459 tree_current_access_path(t), &t->st, 0) != 0) 2460 #else 2461 if (tree_enter_working_dir(t) != 0) 2462 return NULL; 2463 if (stat(tree_current_access_path(t), &t->st) != 0) 2464 #endif 2465 return NULL; 2466 t->flags |= hasStat; 2467 } 2468 return (&t->st); 2469 } 2470 2471 /* 2472 * Get the lstat() data for the entry just returned from tree_next(). 2473 */ 2474 static const struct stat * 2475 tree_current_lstat(struct tree *t) 2476 { 2477 if (!(t->flags & hasLstat)) { 2478 #ifdef HAVE_FSTATAT 2479 if (fstatat(tree_current_dir_fd(t), 2480 tree_current_access_path(t), &t->lst, 2481 AT_SYMLINK_NOFOLLOW) != 0) 2482 #else 2483 if (tree_enter_working_dir(t) != 0) 2484 return NULL; 2485 if (lstat(tree_current_access_path(t), &t->lst) != 0) 2486 #endif 2487 return NULL; 2488 t->flags |= hasLstat; 2489 } 2490 return (&t->lst); 2491 } 2492 2493 /* 2494 * Test whether current entry is a dir or link to a dir. 2495 */ 2496 static int 2497 tree_current_is_dir(struct tree *t) 2498 { 2499 const struct stat *st; 2500 /* 2501 * If we already have lstat() info, then try some 2502 * cheap tests to determine if this is a dir. 2503 */ 2504 if (t->flags & hasLstat) { 2505 /* If lstat() says it's a dir, it must be a dir. */ 2506 st = tree_current_lstat(t); 2507 if (st == NULL) 2508 return 0; 2509 if (S_ISDIR(st->st_mode)) 2510 return 1; 2511 /* Not a dir; might be a link to a dir. */ 2512 /* If it's not a link, then it's not a link to a dir. */ 2513 if (!S_ISLNK(st->st_mode)) 2514 return 0; 2515 /* 2516 * It's a link, but we don't know what it's a link to, 2517 * so we'll have to use stat(). 2518 */ 2519 } 2520 2521 st = tree_current_stat(t); 2522 /* If we can't stat it, it's not a dir. */ 2523 if (st == NULL) 2524 return 0; 2525 /* Use the definitive test. Hopefully this is cached. */ 2526 return (S_ISDIR(st->st_mode)); 2527 } 2528 2529 /* 2530 * Test whether current entry is a physical directory. Usually, we 2531 * already have at least one of stat() or lstat() in memory, so we 2532 * use tricks to try to avoid an extra trip to the disk. 2533 */ 2534 static int 2535 tree_current_is_physical_dir(struct tree *t) 2536 { 2537 const struct stat *st; 2538 2539 /* 2540 * If stat() says it isn't a dir, then it's not a dir. 2541 * If stat() data is cached, this check is free, so do it first. 2542 */ 2543 if (t->flags & hasStat) { 2544 st = tree_current_stat(t); 2545 if (st == NULL) 2546 return (0); 2547 if (!S_ISDIR(st->st_mode)) 2548 return (0); 2549 } 2550 2551 /* 2552 * Either stat() said it was a dir (in which case, we have 2553 * to determine whether it's really a link to a dir) or 2554 * stat() info wasn't available. So we use lstat(), which 2555 * hopefully is already cached. 2556 */ 2557 2558 st = tree_current_lstat(t); 2559 /* If we can't stat it, it's not a dir. */ 2560 if (st == NULL) 2561 return 0; 2562 /* Use the definitive test. Hopefully this is cached. */ 2563 return (S_ISDIR(st->st_mode)); 2564 } 2565 2566 /* 2567 * Test whether the same file has been in the tree as its parent. 2568 */ 2569 static int 2570 tree_target_is_same_as_parent(struct tree *t, const struct stat *st) 2571 { 2572 struct tree_entry *te; 2573 2574 for (te = t->current->parent; te != NULL; te = te->parent) { 2575 if (te->dev == (int64_t)st->st_dev && 2576 te->ino == (int64_t)st->st_ino) 2577 return (1); 2578 } 2579 return (0); 2580 } 2581 2582 /* 2583 * Test whether the current file is symbolic link target and 2584 * on the other filesystem. 2585 */ 2586 static int 2587 tree_current_is_symblic_link_target(struct tree *t) 2588 { 2589 static const struct stat *lst, *st; 2590 2591 lst = tree_current_lstat(t); 2592 st = tree_current_stat(t); 2593 return (st != NULL && lst != NULL && 2594 (int64_t)st->st_dev == t->current_filesystem->dev && 2595 st->st_dev != lst->st_dev); 2596 } 2597 2598 /* 2599 * Return the access path for the entry just returned from tree_next(). 2600 */ 2601 static const char * 2602 tree_current_access_path(struct tree *t) 2603 { 2604 return (t->basename); 2605 } 2606 2607 /* 2608 * Return the full path for the entry just returned from tree_next(). 2609 */ 2610 static const char * 2611 tree_current_path(struct tree *t) 2612 { 2613 return (t->path.s); 2614 } 2615 2616 /* 2617 * Terminate the traversal. 2618 */ 2619 static void 2620 tree_close(struct tree *t) 2621 { 2622 2623 if (t == NULL) 2624 return; 2625 if (t->entry_fd >= 0) { 2626 close_and_restore_time(t->entry_fd, t, &t->restore_time); 2627 t->entry_fd = -1; 2628 } 2629 /* Close the handle of readdir(). */ 2630 if (t->d != INVALID_DIR_HANDLE) { 2631 closedir(t->d); 2632 t->d = INVALID_DIR_HANDLE; 2633 } 2634 /* Release anything remaining in the stack. */ 2635 while (t->stack != NULL) { 2636 if (t->stack->flags & isDirLink) 2637 close(t->stack->symlink_parent_fd); 2638 tree_pop(t); 2639 } 2640 if (t->working_dir_fd >= 0) { 2641 close(t->working_dir_fd); 2642 t->working_dir_fd = -1; 2643 } 2644 if (t->initial_dir_fd >= 0) { 2645 close(t->initial_dir_fd); 2646 t->initial_dir_fd = -1; 2647 } 2648 } 2649 2650 /* 2651 * Release any resources. 2652 */ 2653 static void 2654 tree_free(struct tree *t) 2655 { 2656 int i; 2657 2658 if (t == NULL) 2659 return; 2660 archive_string_free(&t->path); 2661 #if defined(USE_READDIR_R) 2662 free(t->dirent); 2663 #endif 2664 free(t->sparse_list); 2665 for (i = 0; i < t->max_filesystem_id; i++) 2666 free(t->filesystem_table[i].allocation_ptr); 2667 free(t->filesystem_table); 2668 free(t); 2669 } 2670 2671 #endif 2672