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.
199 lines
6.1 KiB
199 lines
6.1 KiB
15 years ago
|
/*-
|
||
|
* Copyright (c) 2003-2009 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
|
||
|
* in this position and unchanged.
|
||
|
* 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$");
|
||
|
|
||
|
#include "archive.h"
|
||
|
#include "archive_string.h"
|
||
|
#include "archive_entry.h"
|
||
|
#include "archive_private.h"
|
||
|
#include "archive_read_disk_private.h"
|
||
|
|
||
|
static int _archive_read_finish(struct archive *);
|
||
|
static int _archive_read_close(struct archive *);
|
||
|
static const char *trivial_lookup_gname(void *, gid_t gid);
|
||
|
static const char *trivial_lookup_uname(void *, uid_t uid);
|
||
|
|
||
|
static struct archive_vtable *
|
||
|
archive_read_disk_vtable(void)
|
||
|
{
|
||
|
static struct archive_vtable av;
|
||
|
static int inited = 0;
|
||
|
|
||
|
if (!inited) {
|
||
|
av.archive_finish = _archive_read_finish;
|
||
|
av.archive_close = _archive_read_close;
|
||
|
}
|
||
|
return (&av);
|
||
|
}
|
||
|
|
||
|
const char *
|
||
|
archive_read_disk_gname(struct archive *_a, gid_t gid)
|
||
|
{
|
||
|
struct archive_read_disk *a = (struct archive_read_disk *)_a;
|
||
|
if (a->lookup_gname != NULL)
|
||
|
return ((*a->lookup_gname)(a->lookup_gname_data, gid));
|
||
|
return (NULL);
|
||
|
}
|
||
|
|
||
|
const char *
|
||
|
archive_read_disk_uname(struct archive *_a, uid_t uid)
|
||
|
{
|
||
|
struct archive_read_disk *a = (struct archive_read_disk *)_a;
|
||
|
if (a->lookup_uname != NULL)
|
||
|
return ((*a->lookup_uname)(a->lookup_uname_data, uid));
|
||
|
return (NULL);
|
||
|
}
|
||
|
|
||
|
int
|
||
|
archive_read_disk_set_gname_lookup(struct archive *_a,
|
||
|
void *private_data,
|
||
|
const char * (*lookup_gname)(void *private, gid_t gid),
|
||
|
void (*cleanup_gname)(void *private))
|
||
|
{
|
||
|
struct archive_read_disk *a = (struct archive_read_disk *)_a;
|
||
|
__archive_check_magic(&a->archive, ARCHIVE_READ_DISK_MAGIC,
|
||
|
ARCHIVE_STATE_ANY, "archive_read_disk_set_gname_lookup");
|
||
|
|
||
|
if (a->cleanup_gname != NULL && a->lookup_gname_data != NULL)
|
||
|
(a->cleanup_gname)(a->lookup_gname_data);
|
||
|
|
||
|
a->lookup_gname = lookup_gname;
|
||
|
a->cleanup_gname = cleanup_gname;
|
||
|
a->lookup_gname_data = private_data;
|
||
|
return (ARCHIVE_OK);
|
||
|
}
|
||
|
|
||
|
int
|
||
|
archive_read_disk_set_uname_lookup(struct archive *_a,
|
||
|
void *private_data,
|
||
|
const char * (*lookup_uname)(void *private, uid_t uid),
|
||
|
void (*cleanup_uname)(void *private))
|
||
|
{
|
||
|
struct archive_read_disk *a = (struct archive_read_disk *)_a;
|
||
|
__archive_check_magic(&a->archive, ARCHIVE_READ_DISK_MAGIC,
|
||
|
ARCHIVE_STATE_ANY, "archive_read_disk_set_uname_lookup");
|
||
|
|
||
|
if (a->cleanup_uname != NULL && a->lookup_uname_data != NULL)
|
||
|
(a->cleanup_uname)(a->lookup_uname_data);
|
||
|
|
||
|
a->lookup_uname = lookup_uname;
|
||
|
a->cleanup_uname = cleanup_uname;
|
||
|
a->lookup_uname_data = private_data;
|
||
|
return (ARCHIVE_OK);
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* Create a new archive_read_disk object and initialize it with global state.
|
||
|
*/
|
||
|
struct archive *
|
||
|
archive_read_disk_new(void)
|
||
|
{
|
||
|
struct archive_read_disk *a;
|
||
|
|
||
|
a = (struct archive_read_disk *)malloc(sizeof(*a));
|
||
|
if (a == NULL)
|
||
|
return (NULL);
|
||
|
memset(a, 0, sizeof(*a));
|
||
|
a->archive.magic = ARCHIVE_READ_DISK_MAGIC;
|
||
|
/* We're ready to write a header immediately. */
|
||
|
a->archive.state = ARCHIVE_STATE_HEADER;
|
||
|
a->archive.vtable = archive_read_disk_vtable();
|
||
|
a->lookup_uname = trivial_lookup_uname;
|
||
|
a->lookup_gname = trivial_lookup_gname;
|
||
|
return (&a->archive);
|
||
|
}
|
||
|
|
||
|
static int
|
||
|
_archive_read_finish(struct archive *_a)
|
||
|
{
|
||
|
struct archive_read_disk *a = (struct archive_read_disk *)_a;
|
||
|
|
||
|
if (a->cleanup_gname != NULL && a->lookup_gname_data != NULL)
|
||
|
(a->cleanup_gname)(a->lookup_gname_data);
|
||
|
if (a->cleanup_uname != NULL && a->lookup_uname_data != NULL)
|
||
|
(a->cleanup_uname)(a->lookup_uname_data);
|
||
|
archive_string_free(&a->archive.error_string);
|
||
|
free(a);
|
||
|
return (ARCHIVE_OK);
|
||
|
}
|
||
|
|
||
|
static int
|
||
|
_archive_read_close(struct archive *_a)
|
||
|
{
|
||
|
(void)_a; /* UNUSED */
|
||
|
return (ARCHIVE_OK);
|
||
|
}
|
||
|
|
||
|
int
|
||
|
archive_read_disk_set_symlink_logical(struct archive *_a)
|
||
|
{
|
||
|
struct archive_read_disk *a = (struct archive_read_disk *)_a;
|
||
|
a->symlink_mode = 'L';
|
||
|
a->follow_symlinks = 1;
|
||
|
return (ARCHIVE_OK);
|
||
|
}
|
||
|
|
||
|
int
|
||
|
archive_read_disk_set_symlink_physical(struct archive *_a)
|
||
|
{
|
||
|
struct archive_read_disk *a = (struct archive_read_disk *)_a;
|
||
|
a->symlink_mode = 'P';
|
||
|
a->follow_symlinks = 0;
|
||
|
return (ARCHIVE_OK);
|
||
|
}
|
||
|
|
||
|
int
|
||
|
archive_read_disk_set_symlink_hybrid(struct archive *_a)
|
||
|
{
|
||
|
struct archive_read_disk *a = (struct archive_read_disk *)_a;
|
||
|
a->symlink_mode = 'H';
|
||
|
a->follow_symlinks = 1; /* Follow symlinks initially. */
|
||
|
return (ARCHIVE_OK);
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
* Trivial implementations of gname/uname lookup functions.
|
||
|
* These are normally overridden by the client, but these stub
|
||
|
* versions ensure that we always have something that works.
|
||
|
*/
|
||
|
static const char *
|
||
|
trivial_lookup_gname(void *private_data, gid_t gid)
|
||
|
{
|
||
|
(void)private_data; /* UNUSED */
|
||
|
(void)gid; /* UNUSED */
|
||
|
return (NULL);
|
||
|
}
|
||
|
|
||
|
static const char *
|
||
|
trivial_lookup_uname(void *private_data, uid_t uid)
|
||
|
{
|
||
|
(void)private_data; /* UNUSED */
|
||
|
(void)uid; /* UNUSED */
|
||
|
return (NULL);
|
||
|
}
|