1 /*-
2 * Copyright (c) 2012 Michihiro NAKAJIMA
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer
10 * in this position and unchanged.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 *
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) ``AS IS'' AND ANY EXPRESS OR
16 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18 * IN NO EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY DIRECT, INDIRECT,
19 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25 */
26
27 #include "test.h"
28
29 static char buff[4096];
30 static struct {
31 const char *path;
32 mode_t mode;
33 int nlink;
34 time_t mtime;
35 uid_t uid;
36 gid_t gid;
37 } entries[] = {
38 { ".", S_IFDIR | 0755, 3, 1231975636, 1001, 1001 },
39 { "./COPYING", S_IFREG | 0644, 1, 1231975636, 1001, 1001 },
40 { "./Makefile", S_IFREG | 0644, 1, 1233041050, 1001, 1001 },
41 { "./NEWS", S_IFREG | 0644, 1, 1231975636, 1001, 1001 },
42 { "./PROJECTS", S_IFREG | 0644, 1, 1231975636, 1001, 1001 },
43 { "./README", S_IFREG | 0644, 1, 1231975636, 1001, 1001 },
44 { "./subdir", S_IFDIR | 0755, 3, 1233504586, 1001, 1001 },
45 { "./subdir/README", S_IFREG | 0664, 1, 1231975636, 1002, 1001 },
46 { "./subdir/config", S_IFREG | 0664, 1, 1232266273, 1003, 1003 },
47 { "./subdir2", S_IFDIR | 0755, 3, 1233504586, 1001, 1001 },
48 { "./subdir3", S_IFDIR | 0755, 3, 1233504586, 1001, 1001 },
49 { "./subdir3/mtree", S_IFREG | 0664, 2, 1232266273, 1003, 1003 },
50 { NULL, 0, 0, 0, 0, 0 }
51 };
52
53 static const char image [] = {
54 "#mtree\n"
55 ". time=1231975636.0 mode=755 gid=1001 uid=1001 type=dir\n"
56 "./COPYING time=1231975636.0 mode=644 gid=1001 uid=1001 type=file size=8\n"
57 "./Makefile time=1233041050.0 mode=644 gid=1001 uid=1001 type=file size=8\n"
58 "./NEWS time=1231975636.0 mode=644 gid=1001 uid=1001 type=file size=8\n"
59 "./PROJECTS time=1231975636.0 mode=644 gid=1001 uid=1001 type=file size=8\n"
60 "./README time=1231975636.0 mode=644 gid=1001 uid=1001 type=file size=8\n"
61 "./subdir time=1233504586.0 mode=755 gid=1001 uid=1001 type=dir\n"
62 "./subdir/README time=1231975636.0 mode=664 gid=1001 uid=1002 type=file size=8\n"
63 "./subdir/config time=1232266273.0 mode=664 gid=1003 uid=1003 type=file size=8\n"
64 "./subdir2 time=1233504586.0 mode=755 gid=1001 uid=1001 type=dir\n"
65 "./subdir3 time=1233504586.0 mode=755 gid=1001 uid=1001 type=dir\n"
66 "./subdir3/mtree nlink=2 time=1232266273.0 mode=664 gid=1003 uid=1003 type=file size=8\n"
67 };
68
DEFINE_TEST(test_write_format_mtree_absolute)69 DEFINE_TEST(test_write_format_mtree_absolute)
70 {
71 struct archive_entry *ae;
72 struct archive* a;
73 size_t used;
74 int i;
75
76 /* Create a mtree format archive. */
77 assert((a = archive_write_new()) != NULL);
78 assertEqualIntA(a, ARCHIVE_OK, archive_write_set_format_mtree(a));
79 assertEqualIntA(a, ARCHIVE_OK,
80 archive_write_open_memory(a, buff, sizeof(buff) - 1, &used));
81
82 /* Write entries */
83 for (i = 0; entries[i].path != NULL; i++) {
84 assert((ae = archive_entry_new()) != NULL);
85 archive_entry_set_nlink(ae, entries[i].nlink);
86 assertEqualInt(entries[i].nlink, archive_entry_nlink(ae));
87 archive_entry_set_mtime(ae, entries[i].mtime, 0);
88 assertEqualInt(entries[i].mtime, archive_entry_mtime(ae));
89 archive_entry_set_mode(ae, entries[i].mode);
90 assertEqualInt(entries[i].mode, archive_entry_mode(ae));
91 archive_entry_set_uid(ae, entries[i].uid);
92 assertEqualInt(entries[i].uid, archive_entry_uid(ae));
93 archive_entry_set_gid(ae, entries[i].gid);
94 assertEqualInt(entries[i].gid, archive_entry_gid(ae));
95 archive_entry_copy_pathname(ae, entries[i].path);
96 if ((entries[i].mode & AE_IFMT) != S_IFDIR)
97 archive_entry_set_size(ae, 8);
98 assertEqualIntA(a, ARCHIVE_OK, archive_write_header(a, ae));
99 if ((entries[i].mode & AE_IFMT) != S_IFDIR)
100 assertEqualIntA(a, 8,
101 archive_write_data(a, "Hello012", 15));
102 archive_entry_free(ae);
103 }
104 assertEqualIntA(a, ARCHIVE_OK, archive_write_close(a));
105 assertEqualInt(ARCHIVE_OK, archive_write_free(a));
106
107 buff[used] = '\0';
108 assertEqualString(buff, image);
109
110 /*
111 * Read the data and check it.
112 */
113 assert((a = archive_read_new()) != NULL);
114 assertEqualIntA(a, ARCHIVE_OK, archive_read_support_format_all(a));
115 assertEqualIntA(a, ARCHIVE_OK, archive_read_support_filter_all(a));
116 assertEqualIntA(a, ARCHIVE_OK, archive_read_open_memory(a, buff, used));
117
118 /* Read entries */
119 for (i = 0; entries[i].path != NULL; i++) {
120 assertEqualIntA(a, ARCHIVE_OK, archive_read_next_header(a, &ae));
121 assertEqualInt(entries[i].mtime, archive_entry_mtime(ae));
122 assertEqualInt(entries[i].mode, archive_entry_mode(ae));
123 assertEqualInt(entries[i].uid, archive_entry_uid(ae));
124 assertEqualInt(entries[i].gid, archive_entry_gid(ae));
125 assertEqualString(entries[i].path,
126 archive_entry_pathname(ae));
127 if ((entries[i].mode & AE_IFMT) != S_IFDIR)
128 assertEqualInt(8, archive_entry_size(ae));
129 }
130 assertEqualIntA(a, ARCHIVE_OK, archive_read_close(a));
131 assertEqualInt(ARCHIVE_OK, archive_read_free(a));
132 }
133