contrib/libarchive/libarchive/archive_read_disk_posix.c

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