| /*- |
| * Copyright (c) 2009,2011 Michihiro NAKAJIMA |
| * Copyright (c) 2008 Joerg Sonnenberger |
| * 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 "archive_platform.h" |
| __FBSDID("$FreeBSD: head/lib/libarchive/archive_write_set_format_mtree.c 201171 2009-12-29 06:39:07Z kientzle $"); |
| |
| #ifdef HAVE_SYS_TYPES_H |
| #include <sys/types.h> |
| #endif |
| #include <errno.h> |
| #include <stdlib.h> |
| #include <string.h> |
| |
| #include "archive.h" |
| #include "archive_crypto_private.h" |
| #include "archive_entry.h" |
| #include "archive_private.h" |
| #include "archive_write_private.h" |
| |
| #define INDENTNAMELEN 15 |
| #define MAXLINELEN 80 |
| #define SET_KEYS \ |
| (F_FLAGS | F_GID | F_GNAME | F_MODE | F_TYPE | F_UID | F_UNAME) |
| |
| struct mtree_entry { |
| struct mtree_entry *next; |
| |
| char *pathname; |
| char *symlink; |
| unsigned int nlink; |
| mode_t filetype; |
| mode_t mode; |
| int64_t uid; |
| int64_t gid; |
| char *uname; |
| char *gname; |
| char *fflags_text; |
| unsigned long fflags_set; |
| unsigned long fflags_clear; |
| time_t mtime; |
| long mtime_nsec; |
| dev_t rdevmajor; |
| dev_t rdevminor; |
| int64_t size; |
| |
| int compute_sum; |
| uint32_t crc; |
| #ifdef ARCHIVE_HAS_MD5 |
| unsigned char buf_md5[16]; |
| #endif |
| #ifdef ARCHIVE_HAS_RMD160 |
| unsigned char buf_rmd160[20]; |
| #endif |
| #ifdef ARCHIVE_HAS_SHA1 |
| unsigned char buf_sha1[20]; |
| #endif |
| #ifdef ARCHIVE_HAS_SHA256 |
| unsigned char buf_sha256[32]; |
| #endif |
| #ifdef ARCHIVE_HAS_SHA384 |
| unsigned char buf_sha384[48]; |
| #endif |
| #ifdef ARCHIVE_HAS_SHA512 |
| unsigned char buf_sha512[64]; |
| #endif |
| }; |
| |
| struct attr_counter { |
| struct attr_counter *prev; |
| struct attr_counter *next; |
| int count; |
| struct mtree_entry *m_entry; |
| }; |
| |
| struct mtree_writer { |
| struct mtree_entry *mtree_entry; |
| struct archive_string ebuf; |
| struct archive_string buf; |
| int first; |
| uint64_t entry_bytes_remaining; |
| struct { |
| int output; |
| int processed; |
| struct archive_string parent; |
| mode_t type; |
| int keys; |
| int64_t uid; |
| int64_t gid; |
| mode_t mode; |
| unsigned long fflags_set; |
| unsigned long fflags_clear; |
| |
| struct attr_counter *uid_list; |
| struct attr_counter *gid_list; |
| struct attr_counter *mode_list; |
| struct attr_counter *flags_list; |
| struct mtree_entry *me_first; |
| struct mtree_entry **me_last; |
| } set; |
| /* check sum */ |
| int compute_sum; |
| uint32_t crc; |
| uint64_t crc_len; |
| #ifdef ARCHIVE_HAS_MD5 |
| archive_md5_ctx md5ctx; |
| #endif |
| #ifdef ARCHIVE_HAS_RMD160 |
| archive_rmd160_ctx rmd160ctx; |
| #endif |
| #ifdef ARCHIVE_HAS_SHA1 |
| archive_sha1_ctx sha1ctx; |
| #endif |
| #ifdef ARCHIVE_HAS_SHA256 |
| archive_sha256_ctx sha256ctx; |
| #endif |
| #ifdef ARCHIVE_HAS_SHA384 |
| archive_sha384_ctx sha384ctx; |
| #endif |
| #ifdef ARCHIVE_HAS_SHA512 |
| archive_sha512_ctx sha512ctx; |
| #endif |
| /* Keyword options */ |
| int keys; |
| #define F_CKSUM 0x00000001 /* check sum */ |
| #define F_DEV 0x00000002 /* device type */ |
| #define F_DONE 0x00000004 /* directory done */ |
| #define F_FLAGS 0x00000008 /* file flags */ |
| #define F_GID 0x00000010 /* gid */ |
| #define F_GNAME 0x00000020 /* group name */ |
| #define F_IGN 0x00000040 /* ignore */ |
| #define F_MAGIC 0x00000080 /* name has magic chars */ |
| #define F_MD5 0x00000100 /* MD5 digest */ |
| #define F_MODE 0x00000200 /* mode */ |
| #define F_NLINK 0x00000400 /* number of links */ |
| #define F_NOCHANGE 0x00000800 /* If owner/mode "wrong", do |
| * not change */ |
| #define F_OPT 0x00001000 /* existence optional */ |
| #define F_RMD160 0x00002000 /* RIPEMD160 digest */ |
| #define F_SHA1 0x00004000 /* SHA-1 digest */ |
| #define F_SIZE 0x00008000 /* size */ |
| #define F_SLINK 0x00010000 /* symbolic link */ |
| #define F_TAGS 0x00020000 /* tags */ |
| #define F_TIME 0x00040000 /* modification time */ |
| #define F_TYPE 0x00080000 /* file type */ |
| #define F_UID 0x00100000 /* uid */ |
| #define F_UNAME 0x00200000 /* user name */ |
| #define F_VISIT 0x00400000 /* file visited */ |
| #define F_SHA256 0x00800000 /* SHA-256 digest */ |
| #define F_SHA384 0x01000000 /* SHA-384 digest */ |
| #define F_SHA512 0x02000000 /* SHA-512 digest */ |
| |
| /* Options */ |
| int dironly; /* if the dironly is 1, ignore everything except |
| * directory type files. like mtree(8) -d option. |
| */ |
| int indent; /* if the indent is 1, indent writing data. */ |
| }; |
| |
| #define DEFAULT_KEYS (F_DEV | F_FLAGS | F_GID | F_GNAME | F_SLINK | F_MODE\ |
| | F_NLINK | F_SIZE | F_TIME | F_TYPE | F_UID\ |
| | F_UNAME) |
| |
| static struct attr_counter * new_attr_count(struct mtree_entry *, |
| struct attr_counter *); |
| static void free_attr_count(struct attr_counter **); |
| static int inc_attr_count(struct attr_counter **, struct attr_counter *, |
| struct attr_counter *, struct mtree_entry *); |
| static int collect_set_values(struct mtree_writer *, struct mtree_entry *); |
| static int get_keys(struct mtree_writer *, struct mtree_entry *); |
| static void sum_init(struct mtree_writer *); |
| static void sum_update(struct mtree_writer *, const void *, size_t); |
| static void sum_final(struct mtree_writer *, struct mtree_entry *); |
| static void sum_write(struct archive_string *, struct mtree_entry *); |
| |
| #define COMPUTE_CRC(var, ch) (var) = (var) << 8 ^ crctab[(var) >> 24 ^ (ch)] |
| static const uint32_t crctab[] = { |
| 0x0, |
| 0x04c11db7, 0x09823b6e, 0x0d4326d9, 0x130476dc, 0x17c56b6b, |
| 0x1a864db2, 0x1e475005, 0x2608edb8, 0x22c9f00f, 0x2f8ad6d6, |
| 0x2b4bcb61, 0x350c9b64, 0x31cd86d3, 0x3c8ea00a, 0x384fbdbd, |
| 0x4c11db70, 0x48d0c6c7, 0x4593e01e, 0x4152fda9, 0x5f15adac, |
| 0x5bd4b01b, 0x569796c2, 0x52568b75, 0x6a1936c8, 0x6ed82b7f, |
| 0x639b0da6, 0x675a1011, 0x791d4014, 0x7ddc5da3, 0x709f7b7a, |
| 0x745e66cd, 0x9823b6e0, 0x9ce2ab57, 0x91a18d8e, 0x95609039, |
| 0x8b27c03c, 0x8fe6dd8b, 0x82a5fb52, 0x8664e6e5, 0xbe2b5b58, |
| 0xbaea46ef, 0xb7a96036, 0xb3687d81, 0xad2f2d84, 0xa9ee3033, |
| 0xa4ad16ea, 0xa06c0b5d, 0xd4326d90, 0xd0f37027, 0xddb056fe, |
| 0xd9714b49, 0xc7361b4c, 0xc3f706fb, 0xceb42022, 0xca753d95, |
| 0xf23a8028, 0xf6fb9d9f, 0xfbb8bb46, 0xff79a6f1, 0xe13ef6f4, |
| 0xe5ffeb43, 0xe8bccd9a, 0xec7dd02d, 0x34867077, 0x30476dc0, |
| 0x3d044b19, 0x39c556ae, 0x278206ab, 0x23431b1c, 0x2e003dc5, |
| 0x2ac12072, 0x128e9dcf, 0x164f8078, 0x1b0ca6a1, 0x1fcdbb16, |
| 0x018aeb13, 0x054bf6a4, 0x0808d07d, 0x0cc9cdca, 0x7897ab07, |
| 0x7c56b6b0, 0x71159069, 0x75d48dde, 0x6b93dddb, 0x6f52c06c, |
| 0x6211e6b5, 0x66d0fb02, 0x5e9f46bf, 0x5a5e5b08, 0x571d7dd1, |
| 0x53dc6066, 0x4d9b3063, 0x495a2dd4, 0x44190b0d, 0x40d816ba, |
| 0xaca5c697, 0xa864db20, 0xa527fdf9, 0xa1e6e04e, 0xbfa1b04b, |
| 0xbb60adfc, 0xb6238b25, 0xb2e29692, 0x8aad2b2f, 0x8e6c3698, |
| 0x832f1041, 0x87ee0df6, 0x99a95df3, 0x9d684044, 0x902b669d, |
| 0x94ea7b2a, 0xe0b41de7, 0xe4750050, 0xe9362689, 0xedf73b3e, |
| 0xf3b06b3b, 0xf771768c, 0xfa325055, 0xfef34de2, 0xc6bcf05f, |
| 0xc27dede8, 0xcf3ecb31, 0xcbffd686, 0xd5b88683, 0xd1799b34, |
| 0xdc3abded, 0xd8fba05a, 0x690ce0ee, 0x6dcdfd59, 0x608edb80, |
| 0x644fc637, 0x7a089632, 0x7ec98b85, 0x738aad5c, 0x774bb0eb, |
| 0x4f040d56, 0x4bc510e1, 0x46863638, 0x42472b8f, 0x5c007b8a, |
| 0x58c1663d, 0x558240e4, 0x51435d53, 0x251d3b9e, 0x21dc2629, |
| 0x2c9f00f0, 0x285e1d47, 0x36194d42, 0x32d850f5, 0x3f9b762c, |
| 0x3b5a6b9b, 0x0315d626, 0x07d4cb91, 0x0a97ed48, 0x0e56f0ff, |
| 0x1011a0fa, 0x14d0bd4d, 0x19939b94, 0x1d528623, 0xf12f560e, |
| 0xf5ee4bb9, 0xf8ad6d60, 0xfc6c70d7, 0xe22b20d2, 0xe6ea3d65, |
| 0xeba91bbc, 0xef68060b, 0xd727bbb6, 0xd3e6a601, 0xdea580d8, |
| 0xda649d6f, 0xc423cd6a, 0xc0e2d0dd, 0xcda1f604, 0xc960ebb3, |
| 0xbd3e8d7e, 0xb9ff90c9, 0xb4bcb610, 0xb07daba7, 0xae3afba2, |
| 0xaafbe615, 0xa7b8c0cc, 0xa379dd7b, 0x9b3660c6, 0x9ff77d71, |
| 0x92b45ba8, 0x9675461f, 0x8832161a, 0x8cf30bad, 0x81b02d74, |
| 0x857130c3, 0x5d8a9099, 0x594b8d2e, 0x5408abf7, 0x50c9b640, |
| 0x4e8ee645, 0x4a4ffbf2, 0x470cdd2b, 0x43cdc09c, 0x7b827d21, |
| 0x7f436096, 0x7200464f, 0x76c15bf8, 0x68860bfd, 0x6c47164a, |
| 0x61043093, 0x65c52d24, 0x119b4be9, 0x155a565e, 0x18197087, |
| 0x1cd86d30, 0x029f3d35, 0x065e2082, 0x0b1d065b, 0x0fdc1bec, |
| 0x3793a651, 0x3352bbe6, 0x3e119d3f, 0x3ad08088, 0x2497d08d, |
| 0x2056cd3a, 0x2d15ebe3, 0x29d4f654, 0xc5a92679, 0xc1683bce, |
| 0xcc2b1d17, 0xc8ea00a0, 0xd6ad50a5, 0xd26c4d12, 0xdf2f6bcb, |
| 0xdbee767c, 0xe3a1cbc1, 0xe760d676, 0xea23f0af, 0xeee2ed18, |
| 0xf0a5bd1d, 0xf464a0aa, 0xf9278673, 0xfde69bc4, 0x89b8fd09, |
| 0x8d79e0be, 0x803ac667, 0x84fbdbd0, 0x9abc8bd5, 0x9e7d9662, |
| 0x933eb0bb, 0x97ffad0c, 0xafb010b1, 0xab710d06, 0xa6322bdf, |
| 0xa2f33668, 0xbcb4666d, 0xb8757bda, 0xb5365d03, 0xb1f740b4 |
| }; |
| |
| static int |
| mtree_safe_char(char c) |
| { |
| if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')) |
| return 1; |
| if (c >= '0' && c <= '9') |
| return 1; |
| if (c == 35 || c == 61 || c == 92) |
| return 0; /* #, = and \ are always quoted */ |
| |
| if (c >= 33 && c <= 47) /* !"$%&'()*+,-./ */ |
| return 1; |
| if (c >= 58 && c <= 64) /* :;<>?@ */ |
| return 1; |
| if (c >= 91 && c <= 96) /* []^_` */ |
| return 1; |
| if (c >= 123 && c <= 126) /* {|}~ */ |
| return 1; |
| return 0; |
| } |
| |
| static void |
| mtree_quote(struct archive_string *s, const char *str) |
| { |
| const char *start; |
| char buf[4]; |
| unsigned char c; |
| |
| for (start = str; *str != '\0'; ++str) { |
| if (mtree_safe_char(*str)) |
| continue; |
| if (start != str) |
| archive_strncat(s, start, str - start); |
| c = (unsigned char)*str; |
| buf[0] = '\\'; |
| buf[1] = (c / 64) + '0'; |
| buf[2] = (c / 8 % 8) + '0'; |
| buf[3] = (c % 8) + '0'; |
| archive_strncat(s, buf, 4); |
| start = str + 1; |
| } |
| |
| if (start != str) |
| archive_strncat(s, start, str - start); |
| } |
| |
| /* |
| * Indent a line as mtree utility to be readable for people. |
| */ |
| static void |
| mtree_indent(struct mtree_writer *mtree) |
| { |
| int i, fn; |
| const char *r, *s, *x; |
| |
| fn = 1; |
| s = r = mtree->ebuf.s; |
| x = NULL; |
| while (*r == ' ') |
| r++; |
| while ((r = strchr(r, ' ')) != NULL) { |
| if (fn) { |
| fn = 0; |
| archive_strncat(&mtree->buf, s, r - s); |
| if (r -s > INDENTNAMELEN) { |
| archive_strncat(&mtree->buf, " \\\n", 3); |
| for (i = 0; i < (INDENTNAMELEN + 1); i++) |
| archive_strappend_char(&mtree->buf, ' '); |
| } else { |
| for (i = r -s; i < (INDENTNAMELEN + 1); i++) |
| archive_strappend_char(&mtree->buf, ' '); |
| } |
| s = ++r; |
| x = NULL; |
| continue; |
| } |
| if (r - s <= MAXLINELEN - 3 - INDENTNAMELEN) |
| x = r++; |
| else { |
| if (x == NULL) |
| x = r; |
| archive_strncat(&mtree->buf, s, x - s); |
| archive_strncat(&mtree->buf, " \\\n", 3); |
| for (i = 0; i < (INDENTNAMELEN + 1); i++) |
| archive_strappend_char(&mtree->buf, ' '); |
| s = r = ++x; |
| x = NULL; |
| } |
| } |
| if (x != NULL && strlen(s) > MAXLINELEN - 3 - INDENTNAMELEN) { |
| /* Last keyword is longer. */ |
| archive_strncat(&mtree->buf, s, x - s); |
| archive_strncat(&mtree->buf, " \\\n", 3); |
| for (i = 0; i < (INDENTNAMELEN + 1); i++) |
| archive_strappend_char(&mtree->buf, ' '); |
| s = ++x; |
| } |
| archive_strcat(&mtree->buf, s); |
| archive_string_empty(&mtree->ebuf); |
| } |
| |
| #if !defined(_WIN32) || defined(__CYGWIN__) |
| static size_t |
| dir_len(struct mtree_entry *me) |
| { |
| const char *path, *r; |
| |
| path = me->pathname; |
| r = strrchr(path, '/'); |
| if (r == NULL) |
| return (0); |
| /* Include a separator size */ |
| return (r - path + 1); |
| } |
| |
| #else /* _WIN32 && !__CYGWIN__ */ |
| /* |
| * Note: We should use wide-character for findng '\' character, |
| * a directory separator on Windows, because some character-set have |
| * been using the '\' character for a part of its multibyte character |
| * code. |
| */ |
| static size_t |
| dir_len(struct mtree_entry *me) |
| { |
| wchar_t wc; |
| const char *path; |
| const char *p, *rp; |
| size_t al, l, size; |
| |
| path = me->pathname; |
| al = l = -1; |
| for (p = path; *p != '\0'; ++p) { |
| if (*p == '\\') |
| al = l = p - path; |
| else if (*p == '/') |
| al = p - path; |
| } |
| if (l == -1) |
| goto alen; |
| size = p - path; |
| rp = p = path; |
| while (*p != '\0') { |
| l = mbtowc(&wc, p, size); |
| if (l == -1) |
| goto alen; |
| if (l == 1 && (wc == L'/' || wc == L'\\')) |
| rp = p; |
| p += l; |
| size -= l; |
| } |
| return (rp - path + 1); |
| alen: |
| if (al == -1) |
| return (0); |
| return (al + 1); |
| } |
| #endif /* _WIN32 && !__CYGWIN__ */ |
| |
| /* |
| * Test if a parent directory of the current entry is changed. |
| */ |
| static int |
| parent_dir_changed(struct archive_string *dir, struct mtree_entry *me) |
| { |
| const char *path; |
| size_t l; |
| |
| l = dir_len(me); |
| path = me->pathname; |
| if (archive_strlen(dir) > 0) { |
| if (l == 0) { |
| archive_string_empty(dir); |
| return (1); |
| } |
| if (strncmp(dir->s, path, l) == 0) |
| return (0); /* The parent directory is the same. */ |
| } else if (l == 0) |
| return (0); /* The parent directory is the same. */ |
| archive_strncpy(dir, path, l); |
| return (1); |
| } |
| |
| /* |
| * Write /set keyword. |
| * Set most used value of uid,gid,mode and fflags, which are |
| * collected by collect_set_values() function. |
| */ |
| static void |
| write_global(struct mtree_writer *mtree) |
| { |
| struct archive_string setstr; |
| struct archive_string unsetstr; |
| const char *name; |
| int keys, oldkeys, effkeys; |
| struct attr_counter *ac; |
| |
| archive_string_init(&setstr); |
| archive_string_init(&unsetstr); |
| keys = mtree->keys & SET_KEYS; |
| oldkeys = mtree->set.keys; |
| effkeys = keys; |
| if (mtree->set.processed) { |
| /* |
| * Check if the global data needs updating. |
| */ |
| effkeys &= ~F_TYPE; |
| if (oldkeys & (F_UNAME | F_UID)) { |
| ac = mtree->set.uid_list; |
| do { |
| if (mtree->set.uid == ac->m_entry->uid) { |
| effkeys &= ~(F_UNAME | F_UID); |
| break; |
| } |
| if (ac->next != NULL && |
| ac->next->count == ac->count) |
| continue; |
| } while (0); |
| } |
| if (oldkeys & (F_GNAME | F_GID)) { |
| ac = mtree->set.gid_list; |
| do { |
| if (mtree->set.gid == ac->m_entry->gid) { |
| effkeys &= ~(F_GNAME | F_GID); |
| break; |
| } |
| if (ac->next != NULL && |
| ac->next->count == ac->count) |
| continue; |
| } while (0); |
| } |
| if (oldkeys & F_MODE) { |
| ac = mtree->set.mode_list; |
| do { |
| if (mtree->set.mode == ac->m_entry->mode) { |
| effkeys &= ~F_MODE; |
| break; |
| } |
| if (ac->next != NULL && |
| ac->next->count == ac->count) |
| continue; |
| } while (0); |
| } |
| if ((oldkeys & F_FLAGS) != 0) { |
| ac = mtree->set.flags_list; |
| do { |
| if (ac->m_entry->fflags_set == |
| mtree->set.fflags_set && |
| ac->m_entry->fflags_clear == |
| mtree->set.fflags_clear) { |
| effkeys &= ~F_FLAGS; |
| break; |
| } |
| if (ac->next != NULL && |
| ac->next->count == ac->count) |
| continue; |
| } while (0); |
| } |
| } |
| if ((keys & effkeys & F_TYPE) != 0) { |
| if (mtree->dironly) { |
| archive_strcat(&setstr, " type=dir"); |
| mtree->set.type = AE_IFDIR; |
| } else { |
| archive_strcat(&setstr, " type=file"); |
| mtree->set.type = AE_IFREG; |
| } |
| } |
| if ((keys & effkeys & F_UNAME) != 0) { |
| name = mtree->set.uid_list->m_entry->uname; |
| if (name != NULL) { |
| archive_strcat(&setstr, " uname="); |
| mtree_quote(&setstr, name); |
| } else { |
| keys &= ~F_UNAME; |
| if ((oldkeys & F_UNAME) != 0) |
| archive_strcat(&unsetstr, " uname"); |
| } |
| } |
| if ((keys & effkeys & F_UID) != 0) { |
| mtree->set.uid = mtree->set.uid_list->m_entry->uid; |
| archive_string_sprintf(&setstr, " uid=%jd", |
| (intmax_t)mtree->set.uid); |
| } |
| if ((keys & effkeys & F_GNAME) != 0) { |
| name = mtree->set.gid_list->m_entry->gname; |
| if (name != NULL) { |
| archive_strcat(&setstr, " gname="); |
| mtree_quote(&setstr, name); |
| } else { |
| keys &= ~F_GNAME; |
| if ((oldkeys & F_GNAME) != 0) |
| archive_strcat(&unsetstr, " gname"); |
| } |
| } |
| if ((keys & effkeys & F_GID) != 0) { |
| mtree->set.gid = mtree->set.gid_list->m_entry->gid; |
| archive_string_sprintf(&setstr, " gid=%jd", |
| (intmax_t)mtree->set.gid); |
| } |
| if ((keys & effkeys & F_MODE) != 0) { |
| mtree->set.mode = mtree->set.mode_list->m_entry->mode; |
| archive_string_sprintf(&setstr, " mode=%o", mtree->set.mode); |
| } |
| if ((keys & effkeys & F_FLAGS) != 0) { |
| name = mtree->set.flags_list->m_entry->fflags_text; |
| if (name != NULL) { |
| archive_strcat(&setstr, " flags="); |
| mtree_quote(&setstr, name); |
| mtree->set.fflags_set = |
| mtree->set.flags_list->m_entry->fflags_set; |
| mtree->set.fflags_clear = |
| mtree->set.flags_list->m_entry->fflags_clear; |
| } else { |
| keys &= ~F_FLAGS; |
| if ((oldkeys & F_FLAGS) != 0) |
| archive_strcat(&unsetstr, " flags"); |
| } |
| } |
| if (unsetstr.length > 0) |
| archive_string_sprintf(&mtree->buf, "/unset%s\n", unsetstr.s); |
| archive_string_free(&unsetstr); |
| if (setstr.length > 0) |
| archive_string_sprintf(&mtree->buf, "/set%s\n", setstr.s); |
| archive_string_free(&setstr); |
| mtree->set.keys = keys; |
| mtree->set.processed = 1; |
| |
| free_attr_count(&mtree->set.uid_list); |
| free_attr_count(&mtree->set.gid_list); |
| free_attr_count(&mtree->set.mode_list); |
| free_attr_count(&mtree->set.flags_list); |
| } |
| |
| static struct attr_counter * |
| new_attr_count(struct mtree_entry *me, struct attr_counter *prev) |
| { |
| struct attr_counter *ac; |
| |
| ac = malloc(sizeof(*ac)); |
| if (ac != NULL) { |
| ac->prev = prev; |
| ac->next = NULL; |
| ac->count = 1; |
| ac->m_entry = me; |
| } |
| return (ac); |
| } |
| |
| static void |
| free_attr_count(struct attr_counter **top) |
| { |
| struct attr_counter *ac, *tac; |
| |
| if (*top == NULL) |
| return; |
| ac = *top; |
| while (ac != NULL) { |
| tac = ac->next; |
| free(ac); |
| ac = tac; |
| } |
| *top = NULL; |
| } |
| |
| static int |
| inc_attr_count(struct attr_counter **top, struct attr_counter *ac, |
| struct attr_counter *last, struct mtree_entry *me) |
| { |
| struct attr_counter *pac; |
| |
| if (ac != NULL) { |
| ac->count++; |
| if (*top == ac || ac->prev->count >= ac->count) |
| return (0); |
| for (pac = ac->prev; pac; pac = pac->prev) { |
| if (pac->count >= ac->count) |
| break; |
| } |
| ac->prev->next = ac->next; |
| if (ac->next != NULL) |
| ac->next->prev = ac->prev; |
| if (pac != NULL) { |
| ac->prev = pac; |
| ac->next = pac->next; |
| pac->next = ac; |
| if (ac->next != NULL) |
| ac->next->prev = ac; |
| } else { |
| ac->prev = NULL; |
| ac->next = *top; |
| *top = ac; |
| ac->next->prev = ac; |
| } |
| } else { |
| ac = new_attr_count(me, last); |
| if (ac == NULL) |
| return (-1); |
| last->next = ac; |
| } |
| return (0); |
| } |
| |
| static int |
| collect_set_values(struct mtree_writer *mtree, struct mtree_entry *me) |
| { |
| int keys = mtree->keys; |
| struct attr_counter *ac, *last; |
| |
| if (keys & (F_UNAME | F_UID)) { |
| if (mtree->set.uid_list == NULL) { |
| mtree->set.uid_list = new_attr_count(me, NULL); |
| if (mtree->set.uid_list == NULL) |
| return (-1); |
| } else { |
| last = NULL; |
| for (ac = mtree->set.uid_list; ac; ac = ac->next) { |
| if (ac->m_entry->uid == me->uid) |
| break; |
| last = ac; |
| } |
| if (inc_attr_count( |
| &mtree->set.uid_list, ac, last, me) < 0) |
| return (-1); |
| } |
| } |
| if (keys & (F_GNAME | F_GID)) { |
| if (mtree->set.gid_list == NULL) { |
| mtree->set.gid_list = new_attr_count(me, NULL); |
| if (mtree->set.gid_list == NULL) |
| return (-1); |
| } else { |
| last = NULL; |
| for (ac = mtree->set.gid_list; ac; ac = ac->next) { |
| if (ac->m_entry->gid == me->gid) |
| break; |
| last = ac; |
| } |
| if (inc_attr_count( |
| &mtree->set.gid_list, ac, last, me) < 0) |
| return (-1); |
| } |
| } |
| if (keys & F_MODE) { |
| if (mtree->set.mode_list == NULL) { |
| mtree->set.mode_list = new_attr_count(me, NULL); |
| if (mtree->set.mode_list == NULL) |
| return (-1); |
| } else { |
| last = NULL; |
| for (ac = mtree->set.mode_list; ac; ac = ac->next) { |
| if (ac->m_entry->mode == me->mode) |
| break; |
| last = ac; |
| } |
| if (inc_attr_count( |
| &mtree->set.mode_list, ac, last, me) < 0) |
| return (-1); |
| } |
| } |
| if (keys & F_FLAGS) { |
| if (mtree->set.flags_list == NULL) { |
| mtree->set.flags_list = new_attr_count(me, NULL); |
| if (mtree->set.flags_list == NULL) |
| return (-1); |
| } else { |
| last = NULL; |
| for (ac = mtree->set.flags_list; ac; ac = ac->next) { |
| if (ac->m_entry->fflags_set == me->fflags_set && |
| ac->m_entry->fflags_clear == me->fflags_clear) |
| break; |
| last = ac; |
| } |
| if (inc_attr_count( |
| &mtree->set.flags_list, ac, last, me) < 0) |
| return (-1); |
| } |
| } |
| |
| /* |
| * Save a entry. |
| */ |
| me->next = NULL; |
| *mtree->set.me_last = me; |
| mtree->set.me_last = &me->next; |
| return (0); |
| } |
| |
| static int |
| get_keys(struct mtree_writer *mtree, struct mtree_entry *me) |
| { |
| int keys; |
| |
| keys = mtree->keys; |
| |
| /* |
| * If a keyword has been set by /set, we do not need to |
| * output it. |
| */ |
| if (mtree->set.keys == 0) |
| return (keys);/* /set is not used. */ |
| |
| if ((mtree->set.keys & (F_GNAME | F_GID)) != 0 && |
| mtree->set.gid == me->gid) |
| keys &= ~(F_GNAME | F_GID); |
| if ((mtree->set.keys & (F_UNAME | F_UID)) != 0 && |
| mtree->set.uid == me->uid) |
| keys &= ~(F_UNAME | F_UID); |
| if (mtree->set.keys & F_FLAGS) { |
| if (mtree->set.fflags_set == me->fflags_set && |
| mtree->set.fflags_clear == me->fflags_clear) |
| keys &= ~F_FLAGS; |
| } |
| if ((mtree->set.keys & F_MODE) != 0 && mtree->set.mode == me->mode) |
| keys &= ~F_MODE; |
| |
| switch (me->filetype) { |
| case AE_IFLNK: case AE_IFSOCK: case AE_IFCHR: |
| case AE_IFBLK: case AE_IFIFO: |
| break; |
| case AE_IFDIR: |
| if ((mtree->set.keys & F_TYPE) != 0 && |
| mtree->set.type == AE_IFDIR) |
| keys &= ~F_TYPE; |
| break; |
| case AE_IFREG: |
| default: /* Handle unknown file types as regular files. */ |
| if ((mtree->set.keys & F_TYPE) != 0 && |
| mtree->set.type == AE_IFREG) |
| keys &= ~F_TYPE; |
| break; |
| } |
| |
| return (keys); |
| } |
| |
| static struct mtree_entry * |
| new_mtree_entry(struct archive_entry *entry) |
| { |
| struct mtree_entry *me; |
| const char *s; |
| |
| me = calloc(1, sizeof(*me)); |
| if (me == NULL) |
| return (NULL); |
| me->pathname = strdup(archive_entry_pathname(entry)); |
| if ((s = archive_entry_symlink(entry)) != NULL) |
| me->symlink = strdup(s); |
| else |
| me->symlink = NULL; |
| me->nlink = archive_entry_nlink(entry); |
| me->filetype = archive_entry_filetype(entry); |
| me->mode = archive_entry_mode(entry) & 07777; |
| me->uid = archive_entry_uid(entry); |
| me->gid = archive_entry_gid(entry); |
| if ((s = archive_entry_uname(entry)) != NULL) |
| me->uname = strdup(s); |
| else |
| me->uname = NULL; |
| if ((s = archive_entry_gname(entry)) != NULL) |
| me->gname = strdup(s); |
| else |
| me->gname = NULL; |
| if ((s = archive_entry_fflags_text(entry)) != NULL) |
| me->fflags_text = strdup(s); |
| else |
| me->fflags_text = NULL; |
| archive_entry_fflags(entry, &me->fflags_set, &me->fflags_clear); |
| me->mtime = archive_entry_mtime(entry); |
| me->mtime_nsec = archive_entry_mtime_nsec(entry); |
| me->rdevmajor = archive_entry_rdevmajor(entry); |
| me->rdevminor = archive_entry_rdevminor(entry); |
| me->size = archive_entry_size(entry); |
| me->compute_sum = 0; |
| |
| return (me); |
| } |
| |
| static void |
| free_mtree_entry(struct mtree_entry *me) |
| { |
| free(me->pathname); |
| free(me->symlink); |
| free(me->uname); |
| free(me->gname); |
| free(me->fflags_text); |
| free(me); |
| } |
| |
| static int |
| archive_write_mtree_header(struct archive_write *a, |
| struct archive_entry *entry) |
| { |
| struct mtree_writer *mtree= a->format_data; |
| |
| if (mtree->first) { |
| mtree->first = 0; |
| archive_strcat(&mtree->buf, "#mtree\n"); |
| if ((mtree->keys & SET_KEYS) == 0) |
| mtree->set.output = 0;/* Disalbed. */ |
| } |
| |
| mtree->entry_bytes_remaining = archive_entry_size(entry); |
| if (mtree->dironly && archive_entry_filetype(entry) != AE_IFDIR) |
| return (ARCHIVE_OK); |
| |
| mtree->mtree_entry = new_mtree_entry(entry); |
| if (mtree->mtree_entry == NULL) { |
| archive_set_error(&a->archive, ENOMEM, |
| "Can't allocate mtree entry"); |
| return (ARCHIVE_FATAL); |
| } |
| |
| mtree->compute_sum = 0; |
| |
| /* If current file is not a regular file, we do not have to |
| * compute the sum of its content. */ |
| if (archive_entry_filetype(entry) != AE_IFREG) |
| return (ARCHIVE_OK); |
| |
| /* Initialize a bunch of sum check context. */ |
| sum_init(mtree); |
| |
| return (ARCHIVE_OK); |
| } |
| |
| static int |
| write_entry(struct archive_write *a, struct mtree_entry *me) |
| { |
| struct mtree_writer *mtree = a->format_data; |
| struct archive_string *str; |
| int keys, ret; |
| |
| archive_string_empty(&mtree->ebuf); |
| str = (mtree->indent)? &mtree->ebuf : &mtree->buf; |
| mtree_quote(str, me->pathname); |
| keys = get_keys(mtree, me); |
| if ((keys & F_NLINK) != 0 && |
| me->nlink != 1 && me->filetype != AE_IFDIR) |
| archive_string_sprintf(str, " nlink=%u", me->nlink); |
| |
| if ((keys & F_GNAME) != 0 && me->gname != NULL) { |
| archive_strcat(str, " gname="); |
| mtree_quote(str, me->gname); |
| } |
| if ((keys & F_UNAME) != 0 && me->uname != NULL) { |
| archive_strcat(str, " uname="); |
| mtree_quote(str, me->uname); |
| } |
| if ((keys & F_FLAGS) != 0) { |
| if (me->fflags_text != NULL) { |
| archive_strcat(str, " flags="); |
| mtree_quote(str, me->fflags_text); |
| } else if (mtree->set.processed && |
| (mtree->set.keys & F_FLAGS) != 0) |
| /* Overwrite the global parameter. */ |
| archive_strcat(str, " flags=none"); |
| } |
| if ((keys & F_TIME) != 0) |
| archive_string_sprintf(str, " time=%jd.%jd", |
| (intmax_t)me->mtime, (intmax_t)me->mtime_nsec); |
| if ((keys & F_MODE) != 0) |
| archive_string_sprintf(str, " mode=%o", me->mode); |
| if ((keys & F_GID) != 0) |
| archive_string_sprintf(str, " gid=%jd", (intmax_t)me->gid); |
| if ((keys & F_UID) != 0) |
| archive_string_sprintf(str, " uid=%jd", (intmax_t)me->uid); |
| |
| switch (me->filetype) { |
| case AE_IFLNK: |
| if ((keys & F_TYPE) != 0) |
| archive_strcat(str, " type=link"); |
| if ((keys & F_SLINK) != 0) { |
| archive_strcat(str, " link="); |
| mtree_quote(str, me->symlink); |
| } |
| break; |
| case AE_IFSOCK: |
| if ((keys & F_TYPE) != 0) |
| archive_strcat(str, " type=socket"); |
| break; |
| case AE_IFCHR: |
| if ((keys & F_TYPE) != 0) |
| archive_strcat(str, " type=char"); |
| if ((keys & F_DEV) != 0) { |
| archive_string_sprintf(str, |
| " device=native,%ju,%ju", |
| (uintmax_t)me->rdevmajor, |
| (uintmax_t)me->rdevminor); |
| } |
| break; |
| case AE_IFBLK: |
| if ((keys & F_TYPE) != 0) |
| archive_strcat(str, " type=block"); |
| if ((keys & F_DEV) != 0) { |
| archive_string_sprintf(str, |
| " device=native,%ju,%ju", |
| (uintmax_t)me->rdevmajor, |
| (uintmax_t)me->rdevminor); |
| } |
| break; |
| case AE_IFDIR: |
| if ((keys & F_TYPE) != 0) |
| archive_strcat(str, " type=dir"); |
| break; |
| case AE_IFIFO: |
| if ((keys & F_TYPE) != 0) |
| archive_strcat(str, " type=fifo"); |
| break; |
| case AE_IFREG: |
| default: /* Handle unknown file types as regular files. */ |
| if ((keys & F_TYPE) != 0) |
| archive_strcat(str, " type=file"); |
| if ((keys & F_SIZE) != 0) |
| archive_string_sprintf(str, " size=%jd", |
| (intmax_t)me->size); |
| break; |
| } |
| |
| /* Write a bunch of sum. */ |
| if (me->filetype == AE_IFREG) |
| sum_write(str, me); |
| |
| archive_strcat(str, "\n"); |
| if (mtree->indent) |
| mtree_indent(mtree); |
| |
| if (mtree->buf.length > 32768) { |
| ret = __archive_write_output(a, mtree->buf.s, mtree->buf.length); |
| archive_string_empty(&mtree->buf); |
| } else |
| ret = ARCHIVE_OK; |
| return (ret); |
| } |
| |
| /* |
| * Write mtree entries saved at collect_set_values() function. |
| */ |
| static int |
| write_mtree_entries(struct archive_write *a) |
| { |
| struct mtree_writer *mtree = a->format_data; |
| struct mtree_entry *me, *tme; |
| int ret; |
| |
| for (me = mtree->set.me_first; me; me = me->next) { |
| ret = write_entry(a, me); |
| if (ret != ARCHIVE_OK) |
| return (ARCHIVE_FATAL); |
| } |
| |
| me = mtree->set.me_first; |
| while (me != NULL) { |
| tme = me->next; |
| free_mtree_entry(me); |
| me = tme; |
| } |
| mtree->set.me_first = NULL; |
| mtree->set.me_last = &mtree->set.me_first; |
| return (ARCHIVE_OK); |
| } |
| |
| static int |
| archive_write_mtree_finish_entry(struct archive_write *a) |
| { |
| struct mtree_writer *mtree = a->format_data; |
| struct mtree_entry *me; |
| int ret; |
| |
| if ((me = mtree->mtree_entry) == NULL) |
| return (ARCHIVE_OK); |
| mtree->mtree_entry = NULL; |
| |
| if (me->filetype == AE_IFREG) |
| sum_final(mtree, me); |
| |
| if (mtree->set.output) { |
| if (!mtree->dironly) { |
| if (archive_strlen(&mtree->set.parent) == 0) |
| parent_dir_changed(&mtree->set.parent, me); |
| if (parent_dir_changed(&mtree->set.parent, me)) { |
| /* Write /set keyword */ |
| write_global(mtree); |
| /* Write entries saved by |
| * collect_set_values() function. */ |
| ret = write_mtree_entries(a); |
| if (ret != ARCHIVE_OK) |
| return (ARCHIVE_FATAL); |
| } |
| } |
| /* Tabulate uid,gid,mode and fflags of a entry |
| * in order to be used for /set. and, at this time |
| * we do not write a entry. */ |
| collect_set_values(mtree, me); |
| return (ARCHIVE_OK); |
| } else { |
| /* Write the current entry and free it. */ |
| ret = write_entry(a, me); |
| free_mtree_entry(me); |
| } |
| return (ret == ARCHIVE_OK ? ret : ARCHIVE_FATAL); |
| } |
| |
| static int |
| archive_write_mtree_close(struct archive_write *a) |
| { |
| struct mtree_writer *mtree= a->format_data; |
| int ret; |
| |
| if (mtree->set.output && mtree->set.me_first != NULL) { |
| write_global(mtree); |
| ret = write_mtree_entries(a); |
| if (ret != ARCHIVE_OK) |
| return (ARCHIVE_FATAL); |
| } |
| |
| archive_write_set_bytes_in_last_block(&a->archive, 1); |
| |
| return __archive_write_output(a, mtree->buf.s, mtree->buf.length); |
| } |
| |
| static ssize_t |
| archive_write_mtree_data(struct archive_write *a, const void *buff, size_t n) |
| { |
| struct mtree_writer *mtree= a->format_data; |
| |
| if (n > mtree->entry_bytes_remaining) |
| n = mtree->entry_bytes_remaining; |
| mtree->entry_bytes_remaining -= n; |
| |
| /* We don't need to compute a regular file sum */ |
| if (mtree->mtree_entry == NULL) |
| return (n); |
| |
| if (mtree->mtree_entry->filetype == AE_IFREG) |
| sum_update(mtree, buff, n); |
| |
| return (n); |
| } |
| |
| static int |
| archive_write_mtree_free(struct archive_write *a) |
| { |
| struct mtree_writer *mtree= a->format_data; |
| struct mtree_entry *me, *tme; |
| |
| if (mtree == NULL) |
| return (ARCHIVE_OK); |
| |
| /* Make sure we dot not leave any entries. */ |
| me = mtree->set.me_first; |
| while (me != NULL) { |
| tme = me->next; |
| free_mtree_entry(me); |
| me = tme; |
| } |
| archive_string_free(&mtree->ebuf); |
| archive_string_free(&mtree->buf); |
| archive_string_free(&mtree->set.parent); |
| free_attr_count(&mtree->set.uid_list); |
| free_attr_count(&mtree->set.gid_list); |
| free_attr_count(&mtree->set.mode_list); |
| free_attr_count(&mtree->set.flags_list); |
| free(mtree); |
| a->format_data = NULL; |
| return (ARCHIVE_OK); |
| } |
| |
| static int |
| archive_write_mtree_options(struct archive_write *a, const char *key, |
| const char *value) |
| { |
| struct mtree_writer *mtree= a->format_data; |
| int keybit = 0; |
| |
| switch (key[0]) { |
| case 'a': |
| if (strcmp(key, "all") == 0) |
| keybit = ~0; |
| break; |
| case 'c': |
| if (strcmp(key, "cksum") == 0) |
| keybit = F_CKSUM; |
| break; |
| case 'd': |
| if (strcmp(key, "device") == 0) |
| keybit = F_DEV; |
| else if (strcmp(key, "dironly") == 0) { |
| mtree->dironly = (value != NULL)? 1: 0; |
| return (ARCHIVE_OK); |
| } |
| break; |
| case 'f': |
| if (strcmp(key, "flags") == 0) |
| keybit = F_FLAGS; |
| break; |
| case 'g': |
| if (strcmp(key, "gid") == 0) |
| keybit = F_GID; |
| else if (strcmp(key, "gname") == 0) |
| keybit = F_GNAME; |
| break; |
| case 'i': |
| if (strcmp(key, "indent") == 0) { |
| mtree->indent = (value != NULL)? 1: 0; |
| return (ARCHIVE_OK); |
| } |
| break; |
| case 'l': |
| if (strcmp(key, "link") == 0) |
| keybit = F_SLINK; |
| break; |
| case 'm': |
| if (strcmp(key, "md5") == 0 || |
| strcmp(key, "md5digest") == 0) |
| keybit = F_MD5; |
| if (strcmp(key, "mode") == 0) |
| keybit = F_MODE; |
| break; |
| case 'n': |
| if (strcmp(key, "nlink") == 0) |
| keybit = F_NLINK; |
| break; |
| case 'r': |
| if (strcmp(key, "ripemd160digest") == 0 || |
| strcmp(key, "rmd160") == 0 || |
| strcmp(key, "rmd160digest") == 0) |
| keybit = F_RMD160; |
| break; |
| case 's': |
| if (strcmp(key, "sha1") == 0 || |
| strcmp(key, "sha1digest") == 0) |
| keybit = F_SHA1; |
| if (strcmp(key, "sha256") == 0 || |
| strcmp(key, "sha256digest") == 0) |
| keybit = F_SHA256; |
| if (strcmp(key, "sha384") == 0 || |
| strcmp(key, "sha384digest") == 0) |
| keybit = F_SHA384; |
| if (strcmp(key, "sha512") == 0 || |
| strcmp(key, "sha512digest") == 0) |
| keybit = F_SHA512; |
| if (strcmp(key, "size") == 0) |
| keybit = F_SIZE; |
| break; |
| case 't': |
| if (strcmp(key, "time") == 0) |
| keybit = F_TIME; |
| else if (strcmp(key, "type") == 0) |
| keybit = F_TYPE; |
| break; |
| case 'u': |
| if (strcmp(key, "uid") == 0) |
| keybit = F_UID; |
| else if (strcmp(key, "uname") == 0) |
| keybit = F_UNAME; |
| else if (strcmp(key, "use-set") == 0) { |
| mtree->set.output = (value != NULL)? 1: 0; |
| return (ARCHIVE_OK); |
| } |
| break; |
| } |
| if (keybit != 0) { |
| if (value != NULL) |
| mtree->keys |= keybit; |
| else |
| mtree->keys &= ~keybit; |
| return (ARCHIVE_OK); |
| } |
| |
| return (ARCHIVE_FAILED); |
| } |
| |
| int |
| archive_write_set_format_mtree(struct archive *_a) |
| { |
| struct archive_write *a = (struct archive_write *)_a; |
| struct mtree_writer *mtree; |
| |
| archive_check_magic(_a, ARCHIVE_WRITE_MAGIC, |
| ARCHIVE_STATE_NEW, "archive_write_set_format_mtree"); |
| |
| if (a->format_free != NULL) |
| (a->format_free)(a); |
| |
| if ((mtree = calloc(1, sizeof(*mtree))) == NULL) { |
| archive_set_error(&a->archive, ENOMEM, |
| "Can't allocate mtree data"); |
| return (ARCHIVE_FATAL); |
| } |
| |
| mtree->mtree_entry = NULL; |
| mtree->first = 1; |
| memset(&(mtree->set), 0, sizeof(mtree->set)); |
| archive_string_init(&mtree->set.parent); |
| mtree->keys = DEFAULT_KEYS; |
| mtree->dironly = 0; |
| mtree->indent = 0; |
| archive_string_init(&mtree->ebuf); |
| archive_string_init(&mtree->buf); |
| mtree->set.me_first = NULL; |
| mtree->set.me_last = &mtree->set.me_first; |
| a->format_data = mtree; |
| a->format_free = archive_write_mtree_free; |
| a->format_name = "mtree"; |
| a->format_options = archive_write_mtree_options; |
| a->format_write_header = archive_write_mtree_header; |
| a->format_close = archive_write_mtree_close; |
| a->format_write_data = archive_write_mtree_data; |
| a->format_finish_entry = archive_write_mtree_finish_entry; |
| a->archive.archive_format = ARCHIVE_FORMAT_MTREE; |
| a->archive.archive_format_name = "mtree"; |
| |
| return (ARCHIVE_OK); |
| } |
| |
| static void |
| sum_init(struct mtree_writer *mtree) |
| { |
| if (mtree->keys & F_CKSUM) { |
| mtree->compute_sum |= F_CKSUM; |
| mtree->crc = 0; |
| mtree->crc_len = 0; |
| } |
| #ifdef ARCHIVE_HAS_MD5 |
| if (mtree->keys & F_MD5) { |
| if (archive_md5_init(&mtree->md5ctx) == ARCHIVE_OK) |
| mtree->compute_sum |= F_MD5; |
| else |
| mtree->keys &= ~F_MD5;/* Not supported. */ |
| } |
| #endif |
| #ifdef ARCHIVE_HAS_RMD160 |
| if (mtree->keys & F_RMD160) { |
| if (archive_rmd160_init(&mtree->rmd160ctx) == ARCHIVE_OK) |
| mtree->compute_sum |= F_RMD160; |
| else |
| mtree->keys &= ~F_RMD160;/* Not supported. */ |
| } |
| #endif |
| #ifdef ARCHIVE_HAS_SHA1 |
| if (mtree->keys & F_SHA1) { |
| if (archive_sha1_init(&mtree->sha1ctx) == ARCHIVE_OK) |
| mtree->compute_sum |= F_SHA1; |
| else |
| mtree->keys &= ~F_SHA1;/* Not supported. */ |
| } |
| #endif |
| #ifdef ARCHIVE_HAS_SHA256 |
| if (mtree->keys & F_SHA256) { |
| if (archive_sha256_init(&mtree->sha256ctx) == ARCHIVE_OK) |
| mtree->compute_sum |= F_SHA256; |
| else |
| mtree->keys &= ~F_SHA256;/* Not supported. */ |
| } |
| #endif |
| #ifdef ARCHIVE_HAS_SHA384 |
| if (mtree->keys & F_SHA384) { |
| if (archive_sha384_init(&mtree->sha384ctx) == ARCHIVE_OK) |
| mtree->compute_sum |= F_SHA384; |
| else |
| mtree->keys &= ~F_SHA384;/* Not supported. */ |
| } |
| #endif |
| #ifdef ARCHIVE_HAS_SHA512 |
| if (mtree->keys & F_SHA512) { |
| if (archive_sha512_init(&mtree->sha512ctx) == ARCHIVE_OK) |
| mtree->compute_sum |= F_SHA512; |
| else |
| mtree->keys &= ~F_SHA512;/* Not supported. */ |
| } |
| #endif |
| } |
| |
| static void |
| sum_update(struct mtree_writer *mtree, const void *buff, size_t n) |
| { |
| if (mtree->compute_sum & F_CKSUM) { |
| /* |
| * Compute a POSIX 1003.2 checksum |
| */ |
| const unsigned char *p; |
| size_t nn; |
| |
| for (nn = n, p = buff; nn--; ++p) |
| COMPUTE_CRC(mtree->crc, *p); |
| mtree->crc_len += n; |
| } |
| #ifdef ARCHIVE_HAS_MD5 |
| if (mtree->compute_sum & F_MD5) |
| archive_md5_update(&mtree->md5ctx, buff, n); |
| #endif |
| #ifdef ARCHIVE_HAS_RMD160 |
| if (mtree->compute_sum & F_RMD160) |
| archive_rmd160_update(&mtree->rmd160ctx, buff, n); |
| #endif |
| #ifdef ARCHIVE_HAS_SHA1 |
| if (mtree->compute_sum & F_SHA1) |
| archive_sha1_update(&mtree->sha1ctx, buff, n); |
| #endif |
| #ifdef ARCHIVE_HAS_SHA256 |
| if (mtree->compute_sum & F_SHA256) |
| archive_sha256_update(&mtree->sha256ctx, buff, n); |
| #endif |
| #ifdef ARCHIVE_HAS_SHA384 |
| if (mtree->compute_sum & F_SHA384) |
| archive_sha384_update(&mtree->sha384ctx, buff, n); |
| #endif |
| #ifdef ARCHIVE_HAS_SHA512 |
| if (mtree->compute_sum & F_SHA512) |
| archive_sha512_update(&mtree->sha512ctx, buff, n); |
| #endif |
| } |
| |
| static void |
| sum_final(struct mtree_writer *mtree, struct mtree_entry *me) |
| { |
| |
| if (mtree->compute_sum & F_CKSUM) { |
| uint64_t len; |
| /* Include the length of the file. */ |
| for (len = mtree->crc_len; len != 0; len >>= 8) |
| COMPUTE_CRC(mtree->crc, len & 0xff); |
| me->crc = ~mtree->crc; |
| } |
| #ifdef ARCHIVE_HAS_MD5 |
| if (mtree->compute_sum & F_MD5) |
| archive_md5_final(&mtree->md5ctx, me->buf_md5); |
| #endif |
| #ifdef ARCHIVE_HAS_RMD160 |
| if (mtree->compute_sum & F_RMD160) |
| archive_rmd160_final(&mtree->rmd160ctx, me->buf_rmd160); |
| #endif |
| #ifdef ARCHIVE_HAS_SHA1 |
| if (mtree->compute_sum & F_SHA1) |
| archive_sha1_final(&mtree->sha1ctx, me->buf_sha1); |
| #endif |
| #ifdef ARCHIVE_HAS_SHA256 |
| if (mtree->compute_sum & F_SHA256) |
| archive_sha256_final(&mtree->sha256ctx, me->buf_sha256); |
| #endif |
| #ifdef ARCHIVE_HAS_SHA384 |
| if (mtree->compute_sum & F_SHA384) |
| archive_sha384_final(&mtree->sha384ctx, me->buf_sha384); |
| #endif |
| #ifdef ARCHIVE_HAS_SHA512 |
| if (mtree->compute_sum & F_SHA512) |
| archive_sha512_final(&mtree->sha512ctx, me->buf_sha512); |
| #endif |
| /* Save what types of sum are computed. */ |
| me->compute_sum = mtree->compute_sum; |
| } |
| |
| #if defined(ARCHIVE_HAS_MD5) || defined(ARCHIVE_HAS_RMD160) || \ |
| defined(ARCHIVE_HAS_SHA1) || defined(ARCHIVE_HAS_SHA256) || \ |
| defined(ARCHIVE_HAS_SHA384) || defined(ARCHIVE_HAS_SHA512) |
| static void |
| strappend_bin(struct archive_string *s, const unsigned char *bin, int n) |
| { |
| static const char hex[] = "0123456789abcdef"; |
| int i; |
| |
| for (i = 0; i < n; i++) { |
| archive_strappend_char(s, hex[bin[i] >> 4]); |
| archive_strappend_char(s, hex[bin[i] & 0x0f]); |
| } |
| } |
| #endif |
| |
| static void |
| sum_write(struct archive_string *str, struct mtree_entry *me) |
| { |
| |
| if (me->compute_sum & F_CKSUM) { |
| archive_string_sprintf(str, " cksum=%ju", |
| (uintmax_t)me->crc); |
| } |
| #ifdef ARCHIVE_HAS_MD5 |
| if (me->compute_sum & F_MD5) { |
| archive_strcat(str, " md5digest="); |
| strappend_bin(str, me->buf_md5, sizeof(me->buf_md5)); |
| } |
| #endif |
| #ifdef ARCHIVE_HAS_RMD160 |
| if (me->compute_sum & F_RMD160) { |
| archive_strcat(str, " rmd160digest="); |
| strappend_bin(str, me->buf_rmd160, sizeof(me->buf_rmd160)); |
| } |
| #endif |
| #ifdef ARCHIVE_HAS_SHA1 |
| if (me->compute_sum & F_SHA1) { |
| archive_strcat(str, " sha1digest="); |
| strappend_bin(str, me->buf_sha1, sizeof(me->buf_sha1)); |
| } |
| #endif |
| #ifdef ARCHIVE_HAS_SHA256 |
| if (me->compute_sum & F_SHA256) { |
| archive_strcat(str, " sha256digest="); |
| strappend_bin(str, me->buf_sha256, sizeof(me->buf_sha256)); |
| } |
| #endif |
| #ifdef ARCHIVE_HAS_SHA384 |
| if (me->compute_sum & F_SHA384) { |
| archive_strcat(str, " sha384digest="); |
| strappend_bin(str, me->buf_sha384, sizeof(me->buf_sha384)); |
| } |
| #endif |
| #ifdef ARCHIVE_HAS_SHA512 |
| if (me->compute_sum & F_SHA512) { |
| archive_strcat(str, " sha512digest="); |
| strappend_bin(str, me->buf_sha512, sizeof(me->buf_sha512)); |
| } |
| #endif |
| } |