archive_read_open_fd.c 5.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210
  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. #include "archive_platform.h"
  26. #ifdef HAVE_SYS_STAT_H
  27. #include <sys/stat.h>
  28. #endif
  29. #ifdef HAVE_ERRNO_H
  30. #include <errno.h>
  31. #endif
  32. #ifdef HAVE_FCNTL_H
  33. #include <fcntl.h>
  34. #endif
  35. #ifdef HAVE_IO_H
  36. #include <io.h>
  37. #endif
  38. #ifdef HAVE_STDLIB_H
  39. #include <stdlib.h>
  40. #endif
  41. #ifdef HAVE_STRING_H
  42. #include <string.h>
  43. #endif
  44. #ifdef HAVE_UNISTD_H
  45. #include <unistd.h>
  46. #endif
  47. #include "archive.h"
  48. struct read_fd_data {
  49. int fd;
  50. size_t block_size;
  51. char use_lseek;
  52. void *buffer;
  53. };
  54. static int file_close(struct archive *, void *);
  55. static ssize_t file_read(struct archive *, void *, const void **buff);
  56. static int64_t file_seek(struct archive *, void *, int64_t request, int);
  57. static int64_t file_skip(struct archive *, void *, int64_t request);
  58. int
  59. archive_read_open_fd(struct archive *a, int fd, size_t block_size)
  60. {
  61. struct stat st;
  62. struct read_fd_data *mine;
  63. void *b;
  64. archive_clear_error(a);
  65. if (fstat(fd, &st) != 0) {
  66. archive_set_error(a, errno, "Can't stat fd %d", fd);
  67. return (ARCHIVE_FATAL);
  68. }
  69. mine = (struct read_fd_data *)calloc(1, sizeof(*mine));
  70. b = malloc(block_size);
  71. if (mine == NULL || b == NULL) {
  72. archive_set_error(a, ENOMEM, "No memory");
  73. free(mine);
  74. free(b);
  75. return (ARCHIVE_FATAL);
  76. }
  77. mine->block_size = block_size;
  78. mine->buffer = b;
  79. mine->fd = fd;
  80. /*
  81. * Skip support is a performance optimization for anything
  82. * that supports lseek(). On FreeBSD, only regular files and
  83. * raw disk devices support lseek() and there's no portable
  84. * way to determine if a device is a raw disk device, so we
  85. * only enable this optimization for regular files.
  86. */
  87. if (S_ISREG(st.st_mode)) {
  88. archive_read_extract_set_skip_file(a, st.st_dev, st.st_ino);
  89. mine->use_lseek = 1;
  90. }
  91. #if defined(__CYGWIN__) || defined(_WIN32)
  92. setmode(mine->fd, O_BINARY);
  93. #endif
  94. archive_read_set_read_callback(a, file_read);
  95. archive_read_set_skip_callback(a, file_skip);
  96. archive_read_set_seek_callback(a, file_seek);
  97. archive_read_set_close_callback(a, file_close);
  98. archive_read_set_callback_data(a, mine);
  99. return (archive_read_open1(a));
  100. }
  101. static ssize_t
  102. file_read(struct archive *a, void *client_data, const void **buff)
  103. {
  104. struct read_fd_data *mine = (struct read_fd_data *)client_data;
  105. ssize_t bytes_read;
  106. *buff = mine->buffer;
  107. for (;;) {
  108. bytes_read = read(mine->fd, mine->buffer, mine->block_size);
  109. if (bytes_read < 0) {
  110. if (errno == EINTR)
  111. continue;
  112. archive_set_error(a, errno, "Error reading fd %d",
  113. mine->fd);
  114. }
  115. return (bytes_read);
  116. }
  117. }
  118. static int64_t
  119. file_skip(struct archive *a, void *client_data, int64_t request)
  120. {
  121. struct read_fd_data *mine = (struct read_fd_data *)client_data;
  122. int64_t skip = request;
  123. int64_t old_offset, new_offset;
  124. int skip_bits = sizeof(skip) * 8 - 1; /* off_t is a signed type. */
  125. if (!mine->use_lseek)
  126. return (0);
  127. /* Reduce a request that would overflow the 'skip' variable. */
  128. if (sizeof(request) > sizeof(skip)) {
  129. int64_t max_skip =
  130. (((int64_t)1 << (skip_bits - 1)) - 1) * 2 + 1;
  131. if (request > max_skip)
  132. skip = max_skip;
  133. }
  134. /* Reduce request to the next smallest multiple of block_size */
  135. request = (request / mine->block_size) * mine->block_size;
  136. if (request == 0)
  137. return (0);
  138. if (((old_offset = lseek(mine->fd, 0, SEEK_CUR)) >= 0) &&
  139. ((new_offset = lseek(mine->fd, skip, SEEK_CUR)) >= 0))
  140. return (new_offset - old_offset);
  141. /* If seek failed once, it will probably fail again. */
  142. mine->use_lseek = 0;
  143. /* Let libarchive recover with read+discard. */
  144. if (errno == ESPIPE)
  145. return (0);
  146. /*
  147. * There's been an error other than ESPIPE. This is most
  148. * likely caused by a programmer error (too large request)
  149. * or a corrupted archive file.
  150. */
  151. archive_set_error(a, errno, "Error seeking");
  152. return (-1);
  153. }
  154. /*
  155. * TODO: Store the offset and use it in the read callback.
  156. */
  157. static int64_t
  158. file_seek(struct archive *a, void *client_data, int64_t request, int whence)
  159. {
  160. struct read_fd_data *mine = (struct read_fd_data *)client_data;
  161. int64_t r;
  162. /* We use off_t here because lseek() is declared that way. */
  163. /* See above for notes about when off_t is less than 64 bits. */
  164. r = lseek(mine->fd, request, whence);
  165. if (r >= 0)
  166. return r;
  167. if (errno == ESPIPE) {
  168. archive_set_error(a, errno,
  169. "A file descriptor(%d) is not seekable(PIPE)", mine->fd);
  170. return (ARCHIVE_FAILED);
  171. } else {
  172. /* If the input is corrupted or truncated, fail. */
  173. archive_set_error(a, errno,
  174. "Error seeking in a file descriptor(%d)", mine->fd);
  175. return (ARCHIVE_FATAL);
  176. }
  177. }
  178. static int
  179. file_close(struct archive *a, void *client_data)
  180. {
  181. struct read_fd_data *mine = (struct read_fd_data *)client_data;
  182. (void)a; /* UNUSED */
  183. free(mine->buffer);
  184. free(mine);
  185. return (ARCHIVE_OK);
  186. }