2 * Copyright (c) 2012 Michihiro NAKAJIMA
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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.
28 __FBSDID("$FreeBSD$");
30 static char buff[4096];
39 { ".", S_IFDIR | 0755, 3, 1231975636, 1001, 1001 },
40 { "./COPYING", S_IFREG | 0644, 1, 1231975636, 1001, 1001 },
41 { "./Makefile", S_IFREG | 0644, 1, 1233041050, 1001, 1001 },
42 { "./NEWS", S_IFREG | 0644, 1, 1231975636, 1001, 1001 },
43 { "./PROJECTS", S_IFREG | 0644, 1, 1231975636, 1001, 1001 },
44 { "./README", S_IFREG | 0644, 1, 1231975636, 1001, 1001 },
45 { "./subdir", S_IFDIR | 0755, 3, 1233504586, 1001, 1001 },
46 { "./subdir/README", S_IFREG | 0664, 1, 1231975636, 1002, 1001 },
47 { "./subdir/config", S_IFREG | 0664, 1, 1232266273, 1003, 1003 },
48 { "./subdir2", S_IFDIR | 0755, 3, 1233504586, 1001, 1001 },
49 { "./subdir3", S_IFDIR | 0755, 3, 1233504586, 1001, 1001 },
50 { "./subdir3/mtree", S_IFREG | 0664, 2, 1232266273, 1003, 1003 },
51 { NULL, 0, 0, 0, 0, 0 }
54 static const char image [] = {
58 "/set type=file uid=1001 gid=1001 mode=644\n"
59 ". time=1231975636.0 mode=755 type=dir\n"
60 " COPYING time=1231975636.0 size=8\n"
61 " Makefile time=1233041050.0 size=8\n"
62 " NEWS time=1231975636.0 size=8\n"
63 " PROJECTS time=1231975636.0 size=8\n"
64 " README time=1231975636.0 size=8\n"
68 " subdir time=1233504586.0 mode=755 type=dir\n"
69 " README time=1231975636.0 uid=1002 size=8\n"
70 " config time=1232266273.0 gid=1003 uid=1003 size=8\n"
76 " subdir2 time=1233504586.0 mode=755 type=dir\n"
82 " subdir3 time=1233504586.0 mode=755 type=dir\n"
83 " mtree nlink=2 time=1232266273.0 gid=1003 uid=1003 size=8\n"
90 static const char image_dironly [] = {
93 "/set type=dir uid=1001 gid=1001 mode=755\n"
94 ". time=1231975636.0\n"
96 " subdir time=1233504586.0\n"
100 " subdir2 time=1233504586.0\n"
104 " subdir3 time=1233504586.0\n"
111 test_write_format_mtree_sub(int dironly)
113 struct archive_entry *ae;
118 /* Create a mtree format archive. */
119 assert((a = archive_write_new()) != NULL);
120 assertEqualIntA(a, ARCHIVE_OK, archive_write_set_format_mtree_classic(a));
121 assertEqualIntA(a, ARCHIVE_OK,
122 archive_write_set_format_option(a, NULL, "indent", "1"));
124 assertEqualIntA(a, ARCHIVE_OK,
125 archive_write_set_format_option(a, NULL, "dironly", "1"));
126 assertEqualIntA(a, ARCHIVE_OK,
127 archive_write_open_memory(a, buff, sizeof(buff)-1, &used));
130 for (i = 0; entries[i].path != NULL; i++) {
131 assert((ae = archive_entry_new()) != NULL);
132 archive_entry_set_nlink(ae, entries[i].nlink);
133 assertEqualInt(entries[i].nlink, archive_entry_nlink(ae));
134 archive_entry_set_mtime(ae, entries[i].mtime, 0);
135 assertEqualInt(entries[i].mtime, archive_entry_mtime(ae));
136 archive_entry_set_mode(ae, entries[i].mode);
137 assertEqualInt(entries[i].mode, archive_entry_mode(ae));
138 archive_entry_set_uid(ae, entries[i].uid);
139 assertEqualInt(entries[i].uid, archive_entry_uid(ae));
140 archive_entry_set_gid(ae, entries[i].gid);
141 assertEqualInt(entries[i].gid, archive_entry_gid(ae));
142 archive_entry_copy_pathname(ae, entries[i].path);
143 if ((entries[i].mode & AE_IFMT) != S_IFDIR)
144 archive_entry_set_size(ae, 8);
145 assertEqualIntA(a, ARCHIVE_OK, archive_write_header(a, ae));
146 if ((entries[i].mode & AE_IFMT) != S_IFDIR)
147 assertEqualIntA(a, 8,
148 archive_write_data(a, "Hello012", 15));
149 archive_entry_free(ae);
151 assertEqualIntA(a, ARCHIVE_OK, archive_write_close(a));
152 assertEqualInt(ARCHIVE_OK, archive_write_free(a));
156 assertEqualString(buff, image_dironly);
158 assertEqualString(buff, image);
161 * Read the data and check it.
163 assert((a = archive_read_new()) != NULL);
164 assertEqualIntA(a, ARCHIVE_OK, archive_read_support_format_all(a));
165 assertEqualIntA(a, ARCHIVE_OK, archive_read_support_filter_all(a));
166 assertEqualIntA(a, ARCHIVE_OK, archive_read_open_memory(a, buff, used));
169 for (i = 0; entries[i].path != NULL; i++) {
170 if (dironly && (entries[i].mode & AE_IFMT) != S_IFDIR)
172 assertEqualIntA(a, ARCHIVE_OK, archive_read_next_header(a, &ae));
173 assertEqualInt(entries[i].mtime, archive_entry_mtime(ae));
174 assertEqualInt(entries[i].mode, archive_entry_mode(ae));
175 assertEqualInt(entries[i].uid, archive_entry_uid(ae));
176 assertEqualInt(entries[i].gid, archive_entry_gid(ae));
178 assertEqualString(entries[i].path + 2,
179 archive_entry_pathname(ae));
181 assertEqualString(entries[i].path,
182 archive_entry_pathname(ae));
183 if ((entries[i].mode & AE_IFMT) != S_IFDIR)
184 assertEqualInt(8, archive_entry_size(ae));
186 assertEqualIntA(a, ARCHIVE_OK, archive_read_close(a));
187 assertEqualInt(ARCHIVE_OK, archive_read_free(a));
190 DEFINE_TEST(test_write_format_mtree_classic_indent)
192 /* Generate classic format. */
193 test_write_format_mtree_sub(0);
194 /* Generate classic format and Write directory only. */
195 test_write_format_mtree_sub(1);