1 /*- 2 * Copyright (c) 2003-2007 Tim Kientzle 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 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) ``AS IS'' AND ANY EXPRESS OR 15 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 16 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 17 * IN NO EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY DIRECT, INDIRECT, 18 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 19 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 20 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 21 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 23 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 24 */ 25 26 #include "archive_platform.h" 27 __FBSDID("$FreeBSD: src/lib/libarchive/archive_write_open_fd.c,v 1.9 2007/01/09 08:05:56 kientzle Exp $"); 28 29 #ifdef HAVE_SYS_STAT_H 30 #include <sys/stat.h> 31 #endif 32 #ifdef HAVE_ERRNO_H 33 #include <errno.h> 34 #endif 35 #ifdef HAVE_STDLIB_H 36 #include <stdlib.h> 37 #endif 38 #ifdef HAVE_STRING_H 39 #include <string.h> 40 #endif 41 #ifdef HAVE_UNISTD_H 42 #include <unistd.h> 43 #endif 44 45 #include "archive.h" 46 47 struct write_fd_data { 48 off_t offset; 49 int fd; 50 }; 51 52 static int file_close(struct archive *, void *); 53 static int file_open(struct archive *, void *); 54 static ssize_t file_write(struct archive *, void *, const void *buff, size_t); 55 56 int 57 archive_write_open_fd(struct archive *a, int fd) 58 { 59 struct write_fd_data *mine; 60 61 mine = (struct write_fd_data *)malloc(sizeof(*mine)); 62 if (mine == NULL) { 63 archive_set_error(a, ENOMEM, "No memory"); 64 return (ARCHIVE_FATAL); 65 } 66 mine->fd = fd; 67 return (archive_write_open(a, mine, 68 file_open, file_write, file_close)); 69 } 70 71 static int 72 file_open(struct archive *a, void *client_data) 73 { 74 struct write_fd_data *mine; 75 struct stat st; 76 77 mine = (struct write_fd_data *)client_data; 78 79 if (fstat(mine->fd, &st) != 0) { 80 archive_set_error(a, errno, "Couldn't stat fd %d", mine->fd); 81 return (ARCHIVE_FATAL); 82 } 83 84 /* 85 * If this is a regular file, don't add it to itself. 86 */ 87 if (S_ISREG(st.st_mode)) 88 archive_write_set_skip_file(a, st.st_dev, st.st_ino); 89 90 /* 91 * If client hasn't explicitly set the last block handling, 92 * then set it here. 93 */ 94 if (archive_write_get_bytes_in_last_block(a) < 0) { 95 /* If the output is a block or character device, fifo, 96 * or stdout, pad the last block, otherwise leave it 97 * unpadded. */ 98 if (S_ISCHR(st.st_mode) || S_ISBLK(st.st_mode) || 99 S_ISFIFO(st.st_mode) || (mine->fd == 1)) 100 /* Last block will be fully padded. */ 101 archive_write_set_bytes_in_last_block(a, 0); 102 else 103 archive_write_set_bytes_in_last_block(a, 1); 104 } 105 106 return (ARCHIVE_OK); 107 } 108 109 static ssize_t 110 file_write(struct archive *a, void *client_data, const void *buff, size_t length) 111 { 112 struct write_fd_data *mine; 113 ssize_t bytesWritten; 114 115 mine = (struct write_fd_data *)client_data; 116 bytesWritten = write(mine->fd, buff, length); 117 if (bytesWritten <= 0) { 118 archive_set_error(a, errno, "Write error"); 119 return (-1); 120 } 121 return (bytesWritten); 122 } 123 124 static int 125 file_close(struct archive *a, void *client_data) 126 { 127 struct write_fd_data *mine = (struct write_fd_data *)client_data; 128 129 (void)a; /* UNUSED */ 130 free(mine); 131 return (ARCHIVE_OK); 132 } 133