You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
119 lines
4.5 KiB
119 lines
4.5 KiB
15 years ago
|
/*-
|
||
|
* Copyright (c) 2003-2007 Tim Kientzle
|
||
|
* All rights reserved.
|
||
|
*
|
||
|
* Redistribution and use in source and binary forms, with or without
|
||
|
* modification, are permitted provided that the following conditions
|
||
|
* are met:
|
||
|
* 1. Redistributions of source code must retain the above copyright
|
||
|
* notice, this list of conditions and the following disclaimer.
|
||
|
* 2. Redistributions in binary form must reproduce the above copyright
|
||
|
* notice, this list of conditions and the following disclaimer in the
|
||
|
* documentation and/or other materials provided with the distribution.
|
||
|
*
|
||
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) ``AS IS'' AND ANY EXPRESS OR
|
||
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
||
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
||
|
* IN NO EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
||
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
||
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
*/
|
||
|
|
||
|
#include "archive_platform.h"
|
||
|
__FBSDID("$FreeBSD: src/lib/libarchive/archive_entry_stat.c,v 1.2 2008/09/30 03:53:03 kientzle Exp $");
|
||
|
|
||
|
#ifdef HAVE_SYS_STAT_H
|
||
|
#include <sys/stat.h>
|
||
|
#endif
|
||
|
#ifdef HAVE_STDLIB_H
|
||
|
#include <stdlib.h>
|
||
|
#endif
|
||
|
|
||
|
#include "archive_entry.h"
|
||
|
#include "archive_entry_private.h"
|
||
|
|
||
|
const struct stat *
|
||
|
archive_entry_stat(struct archive_entry *entry)
|
||
|
{
|
||
|
struct stat *st;
|
||
|
if (entry->stat == NULL) {
|
||
|
entry->stat = malloc(sizeof(*st));
|
||
|
if (entry->stat == NULL)
|
||
|
return (NULL);
|
||
|
entry->stat_valid = 0;
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* If none of the underlying fields have been changed, we
|
||
|
* don't need to regenerate. In theory, we could use a bitmap
|
||
|
* here to flag only those items that have changed, but the
|
||
|
* extra complexity probably isn't worth it. It will be very
|
||
|
* rare for anyone to change just one field then request a new
|
||
|
* stat structure.
|
||
|
*/
|
||
|
if (entry->stat_valid)
|
||
|
return (entry->stat);
|
||
|
|
||
|
st = entry->stat;
|
||
|
/*
|
||
|
* Use the public interfaces to extract items, so that
|
||
|
* the appropriate conversions get invoked.
|
||
|
*/
|
||
|
st->st_atime = archive_entry_atime(entry);
|
||
|
#if HAVE_STRUCT_STAT_ST_BIRTHTIME
|
||
|
st->st_birthtime = archive_entry_birthtime(entry);
|
||
|
#endif
|
||
|
st->st_ctime = archive_entry_ctime(entry);
|
||
|
st->st_mtime = archive_entry_mtime(entry);
|
||
|
st->st_dev = archive_entry_dev(entry);
|
||
|
st->st_gid = archive_entry_gid(entry);
|
||
|
st->st_uid = archive_entry_uid(entry);
|
||
|
st->st_ino = archive_entry_ino64(entry);
|
||
|
st->st_nlink = archive_entry_nlink(entry);
|
||
|
st->st_rdev = archive_entry_rdev(entry);
|
||
|
st->st_size = archive_entry_size(entry);
|
||
|
st->st_mode = archive_entry_mode(entry);
|
||
|
|
||
|
/*
|
||
|
* On systems that support high-res timestamps, copy that
|
||
|
* information into struct stat.
|
||
|
*/
|
||
|
#if HAVE_STRUCT_STAT_ST_MTIMESPEC_TV_NSEC
|
||
|
st->st_atimespec.tv_nsec = archive_entry_atime_nsec(entry);
|
||
|
st->st_ctimespec.tv_nsec = archive_entry_ctime_nsec(entry);
|
||
|
st->st_mtimespec.tv_nsec = archive_entry_mtime_nsec(entry);
|
||
|
#elif HAVE_STRUCT_STAT_ST_MTIM_TV_NSEC
|
||
|
st->st_atim.tv_nsec = archive_entry_atime_nsec(entry);
|
||
|
st->st_ctim.tv_nsec = archive_entry_ctime_nsec(entry);
|
||
|
st->st_mtim.tv_nsec = archive_entry_mtime_nsec(entry);
|
||
|
#elif HAVE_STRUCT_STAT_ST_MTIME_N
|
||
|
st->st_atime_n = archive_entry_atime_nsec(entry);
|
||
|
st->st_ctime_n = archive_entry_ctime_nsec(entry);
|
||
|
st->st_mtime_n = archive_entry_mtime_nsec(entry);
|
||
|
#elif HAVE_STRUCT_STAT_ST_UMTIME
|
||
|
st->st_uatime = archive_entry_atime_nsec(entry) / 1000;
|
||
|
st->st_uctime = archive_entry_ctime_nsec(entry) / 1000;
|
||
|
st->st_umtime = archive_entry_mtime_nsec(entry) / 1000;
|
||
|
#elif HAVE_STRUCT_STAT_ST_MTIME_USEC
|
||
|
st->st_atime_usec = archive_entry_atime_nsec(entry) / 1000;
|
||
|
st->st_ctime_usec = archive_entry_ctime_nsec(entry) / 1000;
|
||
|
st->st_mtime_usec = archive_entry_mtime_nsec(entry) / 1000;
|
||
|
#endif
|
||
|
#if HAVE_STRUCT_STAT_ST_BIRTHTIMESPEC_TV_NSEC
|
||
|
st->st_birthtimespec.tv_nsec = archive_entry_birthtime_nsec(entry);
|
||
|
#endif
|
||
|
|
||
|
/*
|
||
|
* TODO: On Linux, store 32 or 64 here depending on whether
|
||
|
* the cached stat structure is a stat32 or a stat64. This
|
||
|
* will allow us to support both variants interchangably.
|
||
|
*/
|
||
|
entry->stat_valid = 1;
|
||
|
|
||
|
return (st);
|
||
|
}
|