2008-05-26 17:00:24 +00:00
|
|
|
/*-
|
|
|
|
* 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 "test.h"
|
|
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
|
|
|
|
static void test_linkify_tar(void)
|
|
|
|
{
|
|
|
|
struct archive_entry *entry, *e2;
|
|
|
|
struct archive_entry_linkresolver *resolver;
|
|
|
|
|
|
|
|
/* Initialize the resolver. */
|
|
|
|
assert(NULL != (resolver = archive_entry_linkresolver_new()));
|
|
|
|
archive_entry_linkresolver_set_strategy(resolver,
|
|
|
|
ARCHIVE_FORMAT_TAR_USTAR);
|
|
|
|
|
|
|
|
/* Create an entry with only 1 link and try to linkify it. */
|
|
|
|
assert(NULL != (entry = archive_entry_new()));
|
|
|
|
archive_entry_set_pathname(entry, "test1");
|
|
|
|
archive_entry_set_ino(entry, 1);
|
|
|
|
archive_entry_set_dev(entry, 2);
|
|
|
|
archive_entry_set_nlink(entry, 1);
|
|
|
|
archive_entry_set_size(entry, 10);
|
|
|
|
archive_entry_linkify(resolver, &entry, &e2);
|
|
|
|
|
|
|
|
/* Shouldn't have been changed. */
|
|
|
|
assert(e2 == NULL);
|
|
|
|
assertEqualInt(10, archive_entry_size(entry));
|
|
|
|
assertEqualString("test1", archive_entry_pathname(entry));
|
|
|
|
|
|
|
|
/* Now, try again with an entry that has 2 links. */
|
|
|
|
archive_entry_set_pathname(entry, "test2");
|
|
|
|
archive_entry_set_nlink(entry, 2);
|
|
|
|
archive_entry_set_ino(entry, 2);
|
|
|
|
archive_entry_linkify(resolver, &entry, &e2);
|
|
|
|
/* Shouldn't be altered, since it wasn't seen before. */
|
|
|
|
assert(e2 == NULL);
|
|
|
|
assertEqualString("test2", archive_entry_pathname(entry));
|
|
|
|
assertEqualString(NULL, archive_entry_hardlink(entry));
|
|
|
|
assertEqualInt(10, archive_entry_size(entry));
|
|
|
|
|
|
|
|
/* Match again and make sure it does get altered. */
|
|
|
|
archive_entry_linkify(resolver, &entry, &e2);
|
|
|
|
assert(e2 == NULL);
|
|
|
|
assertEqualString("test2", archive_entry_pathname(entry));
|
|
|
|
assertEqualString("test2", archive_entry_hardlink(entry));
|
|
|
|
assertEqualInt(0, archive_entry_size(entry));
|
|
|
|
|
|
|
|
|
2008-06-15 04:31:43 +00:00
|
|
|
/* Dirs should never be matched as hardlinks, regardless. */
|
|
|
|
archive_entry_set_pathname(entry, "test3");
|
|
|
|
archive_entry_set_nlink(entry, 2);
|
|
|
|
archive_entry_set_filetype(entry, AE_IFDIR);
|
|
|
|
archive_entry_set_ino(entry, 3);
|
|
|
|
archive_entry_set_hardlink(entry, NULL);
|
|
|
|
archive_entry_linkify(resolver, &entry, &e2);
|
|
|
|
/* Shouldn't be altered, since it wasn't seen before. */
|
|
|
|
assert(e2 == NULL);
|
|
|
|
assertEqualString("test3", archive_entry_pathname(entry));
|
|
|
|
assertEqualString(NULL, archive_entry_hardlink(entry));
|
|
|
|
|
|
|
|
/* Dir, so it shouldn't get matched. */
|
|
|
|
archive_entry_linkify(resolver, &entry, &e2);
|
|
|
|
assert(e2 == NULL);
|
|
|
|
assertEqualString("test3", archive_entry_pathname(entry));
|
|
|
|
assertEqualString(NULL, archive_entry_hardlink(entry));
|
|
|
|
|
2008-05-26 17:00:24 +00:00
|
|
|
archive_entry_free(entry);
|
|
|
|
archive_entry_linkresolver_free(resolver);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_linkify_old_cpio(void)
|
|
|
|
{
|
|
|
|
struct archive_entry *entry, *e2;
|
|
|
|
struct archive_entry_linkresolver *resolver;
|
|
|
|
|
|
|
|
/* Initialize the resolver. */
|
|
|
|
assert(NULL != (resolver = archive_entry_linkresolver_new()));
|
|
|
|
archive_entry_linkresolver_set_strategy(resolver,
|
|
|
|
ARCHIVE_FORMAT_CPIO_POSIX);
|
|
|
|
|
|
|
|
/* Create an entry with 2 link and try to linkify it. */
|
|
|
|
assert(NULL != (entry = archive_entry_new()));
|
|
|
|
archive_entry_set_pathname(entry, "test1");
|
|
|
|
archive_entry_set_ino(entry, 1);
|
|
|
|
archive_entry_set_dev(entry, 2);
|
|
|
|
archive_entry_set_nlink(entry, 2);
|
|
|
|
archive_entry_set_size(entry, 10);
|
|
|
|
archive_entry_linkify(resolver, &entry, &e2);
|
|
|
|
|
|
|
|
/* Shouldn't have been changed. */
|
|
|
|
assert(e2 == NULL);
|
|
|
|
assertEqualInt(10, archive_entry_size(entry));
|
|
|
|
assertEqualString("test1", archive_entry_pathname(entry));
|
|
|
|
|
|
|
|
/* Still shouldn't be matched. */
|
|
|
|
archive_entry_linkify(resolver, &entry, &e2);
|
|
|
|
assert(e2 == NULL);
|
|
|
|
assertEqualString("test1", archive_entry_pathname(entry));
|
|
|
|
assertEqualString(NULL, archive_entry_hardlink(entry));
|
|
|
|
assertEqualInt(10, archive_entry_size(entry));
|
|
|
|
|
|
|
|
archive_entry_free(entry);
|
|
|
|
archive_entry_linkresolver_free(resolver);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void test_linkify_new_cpio(void)
|
|
|
|
{
|
|
|
|
struct archive_entry *entry, *e2;
|
|
|
|
struct archive_entry_linkresolver *resolver;
|
|
|
|
|
|
|
|
/* Initialize the resolver. */
|
|
|
|
assert(NULL != (resolver = archive_entry_linkresolver_new()));
|
|
|
|
archive_entry_linkresolver_set_strategy(resolver,
|
|
|
|
ARCHIVE_FORMAT_CPIO_SVR4_NOCRC);
|
|
|
|
|
|
|
|
/* Create an entry with only 1 link and try to linkify it. */
|
|
|
|
assert(NULL != (entry = archive_entry_new()));
|
|
|
|
archive_entry_set_pathname(entry, "test1");
|
|
|
|
archive_entry_set_ino(entry, 1);
|
|
|
|
archive_entry_set_dev(entry, 2);
|
|
|
|
archive_entry_set_nlink(entry, 1);
|
|
|
|
archive_entry_set_size(entry, 10);
|
|
|
|
archive_entry_linkify(resolver, &entry, &e2);
|
|
|
|
|
|
|
|
/* Shouldn't have been changed. */
|
|
|
|
assert(e2 == NULL);
|
|
|
|
assertEqualInt(10, archive_entry_size(entry));
|
|
|
|
assertEqualString("test1", archive_entry_pathname(entry));
|
|
|
|
|
|
|
|
/* Now, try again with an entry that has 3 links. */
|
|
|
|
archive_entry_set_pathname(entry, "test2");
|
|
|
|
archive_entry_set_nlink(entry, 3);
|
|
|
|
archive_entry_set_ino(entry, 2);
|
|
|
|
archive_entry_linkify(resolver, &entry, &e2);
|
|
|
|
|
|
|
|
/* First time, it just gets swallowed. */
|
|
|
|
assert(entry == NULL);
|
|
|
|
assert(e2 == NULL);
|
|
|
|
|
|
|
|
/* Match again. */
|
|
|
|
assert(NULL != (entry = archive_entry_new()));
|
|
|
|
archive_entry_set_pathname(entry, "test3");
|
|
|
|
archive_entry_set_ino(entry, 2);
|
|
|
|
archive_entry_set_dev(entry, 2);
|
|
|
|
archive_entry_set_nlink(entry, 2);
|
|
|
|
archive_entry_set_size(entry, 10);
|
|
|
|
archive_entry_linkify(resolver, &entry, &e2);
|
|
|
|
|
|
|
|
/* Should get back "test2" and nothing else. */
|
|
|
|
assertEqualString("test2", archive_entry_pathname(entry));
|
|
|
|
assertEqualInt(0, archive_entry_size(entry));
|
|
|
|
archive_entry_free(entry);
|
|
|
|
assert(NULL == e2);
|
|
|
|
archive_entry_free(e2); /* This should be a no-op. */
|
|
|
|
|
|
|
|
/* Match a third time. */
|
|
|
|
assert(NULL != (entry = archive_entry_new()));
|
|
|
|
archive_entry_set_pathname(entry, "test4");
|
|
|
|
archive_entry_set_ino(entry, 2);
|
|
|
|
archive_entry_set_dev(entry, 2);
|
|
|
|
archive_entry_set_nlink(entry, 3);
|
|
|
|
archive_entry_set_size(entry, 10);
|
|
|
|
archive_entry_linkify(resolver, &entry, &e2);
|
|
|
|
|
|
|
|
/* Should get back "test3". */
|
|
|
|
assertEqualString("test3", archive_entry_pathname(entry));
|
|
|
|
assertEqualInt(0, archive_entry_size(entry));
|
|
|
|
|
|
|
|
/* Since "test4" was the last link, should get it back also. */
|
|
|
|
assertEqualString("test4", archive_entry_pathname(e2));
|
|
|
|
assertEqualInt(10, archive_entry_size(e2));
|
|
|
|
|
|
|
|
archive_entry_free(entry);
|
|
|
|
archive_entry_free(e2);
|
|
|
|
archive_entry_linkresolver_free(resolver);
|
|
|
|
}
|
|
|
|
|
|
|
|
DEFINE_TEST(test_link_resolver)
|
|
|
|
{
|
|
|
|
test_linkify_tar();
|
|
|
|
test_linkify_old_cpio();
|
|
|
|
test_linkify_new_cpio();
|
|
|
|
}
|