1/*- 2 * Copyright (c) 2009 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__FBSDID("$FreeBSD$"); 29 30static char buff[4096]; 31static struct { 32 const char *path; 33 mode_t mode; 34 time_t mtime; 35 uid_t uid; 36 gid_t gid; 37} entries[] = { 38 { "./COPYING", S_IFREG | 0644, 1231975636, 1001, 1001 }, 39 { "./Makefile", S_IFREG | 0644, 1233041050, 1001, 1001 }, 40 { "./NEWS", S_IFREG | 0644, 1231975636, 1001, 1001 }, 41 { "./PROJECTS", S_IFREG | 0644, 1231975636, 1001, 1001 }, 42 { "./README", S_IFREG | 0644, 1231975636, 1001, 1001 }, 43 { "./subdir", S_IFDIR | 0755, 1233504586, 1001, 1001 }, 44 { "./subdir/README", S_IFREG | 0664, 1231975636, 1002, 1001 }, 45 { "./subdir/config", S_IFREG | 0664, 1232266273, 1003, 1003 }, 46 { "./subdir2", S_IFDIR | 0755, 1233504586, 1001, 1001 }, 47 { "./subdir3", S_IFDIR | 0755, 1233504586, 1001, 1001 }, 48 { "./subdir3/mtree", S_IFREG | 0664, 1232266273, 1003, 1003 }, 49 { NULL, 0, 0, 0, 0 } 50}; 51 52static void 53test_write_format_mtree_sub(int use_set, int dironly) 54{ 55 struct archive_entry *ae; 56 struct archive* a; 57 size_t used; 58 int i; 59 60 /* Create a mtree format archive. */ 61 assert((a = archive_write_new()) != NULL); 62 assertEqualIntA(a, ARCHIVE_OK, archive_write_set_format_mtree(a)); 63 if (use_set) 64 assertEqualIntA(a, ARCHIVE_OK, archive_write_set_format_option(a, NULL, "use-set", "1")); 65 if (dironly) 66 assertEqualIntA(a, ARCHIVE_OK, archive_write_set_format_option(a, NULL, "dironly", "1")); 67 assertEqualIntA(a, ARCHIVE_OK, archive_write_open_memory(a, buff, sizeof(buff)-1, &used)); 68 69 /* Write entries */ 70 for (i = 0; entries[i].path != NULL; i++) { 71 assert((ae = archive_entry_new()) != NULL); 72 archive_entry_set_mtime(ae, entries[i].mtime, 0); 73 assert(entries[i].mtime == archive_entry_mtime(ae)); 74 archive_entry_set_mode(ae, entries[i].mode); 75 assert(entries[i].mode == archive_entry_mode(ae)); 76 archive_entry_set_uid(ae, entries[i].uid); 77 assert(entries[i].uid == archive_entry_uid(ae)); 78 archive_entry_set_gid(ae, entries[i].gid); 79 assert(entries[i].gid == archive_entry_gid(ae)); 80 archive_entry_copy_pathname(ae, entries[i].path); 81 if ((entries[i].mode & AE_IFMT) != S_IFDIR) 82 archive_entry_set_size(ae, 8); 83 assertEqualIntA(a, ARCHIVE_OK, archive_write_header(a, ae)); 84 if ((entries[i].mode & AE_IFMT) != S_IFDIR) 85 assertEqualIntA(a, 8, 86 archive_write_data(a, "Hello012", 15)); 87 archive_entry_free(ae); 88 } 89 assertEqualIntA(a, ARCHIVE_OK, archive_write_close(a)); 90 assertEqualInt(ARCHIVE_OK, archive_write_free(a)); 91 92 if (use_set) { 93 const char *p; 94 95 buff[used] = '\0'; 96 assert(NULL != (p = strstr(buff, "\n/set "))); 97 if (p != NULL) { 98 char *r; 99 const char *o; 100 p++; 101 r = strchr(p, '\n'); 102 if (r != NULL) 103 *r = '\0'; 104 if (dironly) 105 o = "/set type=dir uid=1001 gid=1001 mode=755"; 106 else 107 o = "/set type=file uid=1001 gid=1001 mode=644"; 108 assertEqualString(o, p); 109 if (r != NULL) 110 *r = '\n'; 111 } 112 } 113 114 /* 115 * Read the data and check it. 116 */ 117 assert((a = archive_read_new()) != NULL); 118 assertEqualIntA(a, ARCHIVE_OK, archive_read_support_format_all(a)); 119 assertEqualIntA(a, ARCHIVE_OK, archive_read_support_filter_all(a)); 120 assertEqualIntA(a, ARCHIVE_OK, archive_read_open_memory(a, buff, used)); 121 122 /* Read entries */ 123 for (i = 0; entries[i].path != NULL; i++) { 124 if (dironly && (entries[i].mode & AE_IFMT) != S_IFDIR) 125 continue; 126 assertEqualIntA(a, ARCHIVE_OK, archive_read_next_header(a, &ae)); 127 assertEqualInt(entries[i].mtime, archive_entry_mtime(ae)); 128 assertEqualInt(entries[i].mode, archive_entry_mode(ae)); 129 assertEqualInt(entries[i].uid, archive_entry_uid(ae)); 130 assertEqualInt(entries[i].gid, archive_entry_gid(ae)); 131 assertEqualString(entries[i].path, archive_entry_pathname(ae)); 132 if ((entries[i].mode & AE_IFMT) != S_IFDIR) 133 assertEqualInt(8, archive_entry_size(ae)); 134 } 135 assertEqualIntA(a, ARCHIVE_OK, archive_read_close(a)); 136 assertEqualInt(ARCHIVE_OK, archive_read_free(a)); 137} 138 139DEFINE_TEST(test_write_format_mtree) 140{ 141 /* Default setting */ 142 test_write_format_mtree_sub(0, 0); 143 /* Directory only */ 144 test_write_format_mtree_sub(0, 1); 145 /* Use /set keyword */ 146 test_write_format_mtree_sub(1, 0); 147 /* Use /set keyword with directory only */ 148 test_write_format_mtree_sub(1, 1); 149} 150