Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2008 The Android Open Source Project |
| 3 | * |
| 4 | * Licensed under the Apache License, Version 2.0 (the "License"); |
| 5 | * you may not use this file except in compliance with the License. |
| 6 | * You may obtain a copy of the License at |
| 7 | * |
| 8 | * http://www.apache.org/licenses/LICENSE-2.0 |
| 9 | * |
| 10 | * Unless required by applicable law or agreed to in writing, software |
| 11 | * distributed under the License is distributed on an "AS IS" BASIS, |
| 12 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 13 | * See the License for the specific language governing permissions and |
| 14 | * limitations under the License. |
| 15 | */ |
| 16 | |
| 17 | /* |
| 18 | * Read-only access to Zip archives, with minimal heap allocation. |
| 19 | */ |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 20 | |
| 21 | #include <assert.h> |
| 22 | #include <errno.h> |
Mark Salyzyn | 99ef991 | 2014-03-14 14:26:22 -0700 | [diff] [blame] | 23 | #include <fcntl.h> |
| 24 | #include <inttypes.h> |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 25 | #include <limits.h> |
| 26 | #include <log/log.h> |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 27 | #include <stdlib.h> |
| 28 | #include <string.h> |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 29 | #include <unistd.h> |
Mark Salyzyn | 51d562d | 2014-05-05 14:38:05 -0700 | [diff] [blame] | 30 | #include <utils/Compat.h> |
Narayan Kamath | eaf9885 | 2013-12-11 14:51:51 +0000 | [diff] [blame] | 31 | #include <utils/FileMap.h> |
Mark Salyzyn | 99ef991 | 2014-03-14 14:26:22 -0700 | [diff] [blame] | 32 | #include <zlib.h> |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 33 | |
| 34 | #include <JNIHelp.h> // TEMP_FAILURE_RETRY may or may not be in unistd |
| 35 | |
Mark Salyzyn | 99ef991 | 2014-03-14 14:26:22 -0700 | [diff] [blame] | 36 | #include "ziparchive/zip_archive.h" |
| 37 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 38 | // This is for windows. If we don't open a file in binary mode, weird |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 39 | // things will happen. |
| 40 | #ifndef O_BINARY |
| 41 | #define O_BINARY 0 |
| 42 | #endif |
| 43 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 44 | #define DISALLOW_IMPLICIT_CONSTRUCTORS(TypeName) \ |
| 45 | TypeName(); \ |
| 46 | TypeName(const TypeName&); \ |
| 47 | void operator=(const TypeName&) |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 48 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 49 | // The "end of central directory" (EOCD) record. Each archive |
| 50 | // contains exactly once such record which appears at the end of |
| 51 | // the archive. It contains archive wide information like the |
| 52 | // number of entries in the archive and the offset to the central |
| 53 | // directory of the offset. |
| 54 | struct EocdRecord { |
| 55 | static const uint32_t kSignature = 0x06054b50; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 56 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 57 | // End of central directory signature, should always be |
| 58 | // |kSignature|. |
| 59 | uint32_t eocd_signature; |
| 60 | // The number of the current "disk", i.e, the "disk" that this |
| 61 | // central directory is on. |
| 62 | // |
| 63 | // This implementation assumes that each archive spans a single |
| 64 | // disk only. i.e, that disk_num == 1. |
| 65 | uint16_t disk_num; |
| 66 | // The disk where the central directory starts. |
| 67 | // |
| 68 | // This implementation assumes that each archive spans a single |
| 69 | // disk only. i.e, that cd_start_disk == 1. |
| 70 | uint16_t cd_start_disk; |
| 71 | // The number of central directory records on this disk. |
| 72 | // |
| 73 | // This implementation assumes that each archive spans a single |
| 74 | // disk only. i.e, that num_records_on_disk == num_records. |
| 75 | uint16_t num_records_on_disk; |
| 76 | // The total number of central directory records. |
| 77 | uint16_t num_records; |
| 78 | // The size of the central directory (in bytes). |
| 79 | uint32_t cd_size; |
| 80 | // The offset of the start of the central directory, relative |
| 81 | // to the start of the file. |
| 82 | uint32_t cd_start_offset; |
| 83 | // Length of the central directory comment. |
| 84 | uint16_t comment_length; |
| 85 | private: |
| 86 | DISALLOW_IMPLICIT_CONSTRUCTORS(EocdRecord); |
| 87 | } __attribute__((packed)); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 88 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 89 | // A structure representing the fixed length fields for a single |
| 90 | // record in the central directory of the archive. In addition to |
| 91 | // the fixed length fields listed here, each central directory |
| 92 | // record contains a variable length "file_name" and "extra_field" |
| 93 | // whose lengths are given by |file_name_length| and |extra_field_length| |
| 94 | // respectively. |
| 95 | struct CentralDirectoryRecord { |
| 96 | static const uint32_t kSignature = 0x02014b50; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 97 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 98 | // The start of record signature. Must be |kSignature|. |
| 99 | uint32_t record_signature; |
| 100 | // Tool version. Ignored by this implementation. |
| 101 | uint16_t version_made_by; |
| 102 | // Tool version. Ignored by this implementation. |
| 103 | uint16_t version_needed; |
| 104 | // The "general purpose bit flags" for this entry. The only |
| 105 | // flag value that we currently check for is the "data descriptor" |
| 106 | // flag. |
| 107 | uint16_t gpb_flags; |
| 108 | // The compression method for this entry, one of |kCompressStored| |
| 109 | // and |kCompressDeflated|. |
| 110 | uint16_t compression_method; |
| 111 | // The file modification time and date for this entry. |
| 112 | uint16_t last_mod_time; |
| 113 | uint16_t last_mod_date; |
| 114 | // The CRC-32 checksum for this entry. |
| 115 | uint32_t crc32; |
| 116 | // The compressed size (in bytes) of this entry. |
| 117 | uint32_t compressed_size; |
| 118 | // The uncompressed size (in bytes) of this entry. |
| 119 | uint32_t uncompressed_size; |
| 120 | // The length of the entry file name in bytes. The file name |
| 121 | // will appear immediately after this record. |
| 122 | uint16_t file_name_length; |
| 123 | // The length of the extra field info (in bytes). This data |
| 124 | // will appear immediately after the entry file name. |
| 125 | uint16_t extra_field_length; |
| 126 | // The length of the entry comment (in bytes). This data will |
| 127 | // appear immediately after the extra field. |
| 128 | uint16_t comment_length; |
| 129 | // The start disk for this entry. Ignored by this implementation). |
| 130 | uint16_t file_start_disk; |
| 131 | // File attributes. Ignored by this implementation. |
| 132 | uint16_t internal_file_attributes; |
| 133 | // File attributes. Ignored by this implementation. |
| 134 | uint32_t external_file_attributes; |
| 135 | // The offset to the local file header for this entry, from the |
| 136 | // beginning of this archive. |
| 137 | uint32_t local_file_header_offset; |
| 138 | private: |
| 139 | DISALLOW_IMPLICIT_CONSTRUCTORS(CentralDirectoryRecord); |
| 140 | } __attribute__((packed)); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 141 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 142 | // The local file header for a given entry. This duplicates information |
| 143 | // present in the central directory of the archive. It is an error for |
| 144 | // the information here to be different from the central directory |
| 145 | // information for a given entry. |
| 146 | struct LocalFileHeader { |
| 147 | static const uint32_t kSignature = 0x04034b50; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 148 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 149 | // The local file header signature, must be |kSignature|. |
| 150 | uint32_t lfh_signature; |
| 151 | // Tool version. Ignored by this implementation. |
| 152 | uint16_t version_needed; |
| 153 | // The "general purpose bit flags" for this entry. The only |
| 154 | // flag value that we currently check for is the "data descriptor" |
| 155 | // flag. |
| 156 | uint16_t gpb_flags; |
| 157 | // The compression method for this entry, one of |kCompressStored| |
| 158 | // and |kCompressDeflated|. |
| 159 | uint16_t compression_method; |
| 160 | // The file modification time and date for this entry. |
| 161 | uint16_t last_mod_time; |
| 162 | uint16_t last_mod_date; |
| 163 | // The CRC-32 checksum for this entry. |
| 164 | uint32_t crc32; |
| 165 | // The compressed size (in bytes) of this entry. |
| 166 | uint32_t compressed_size; |
| 167 | // The uncompressed size (in bytes) of this entry. |
| 168 | uint32_t uncompressed_size; |
| 169 | // The length of the entry file name in bytes. The file name |
| 170 | // will appear immediately after this record. |
| 171 | uint16_t file_name_length; |
| 172 | // The length of the extra field info (in bytes). This data |
| 173 | // will appear immediately after the entry file name. |
| 174 | uint16_t extra_field_length; |
| 175 | private: |
| 176 | DISALLOW_IMPLICIT_CONSTRUCTORS(LocalFileHeader); |
| 177 | } __attribute__((packed)); |
| 178 | |
| 179 | struct DataDescriptor { |
| 180 | // The *optional* data descriptor start signature. |
| 181 | static const uint32_t kOptSignature = 0x08074b50; |
| 182 | |
| 183 | // CRC-32 checksum of the entry. |
| 184 | uint32_t crc32; |
| 185 | // Compressed size of the entry. |
| 186 | uint32_t compressed_size; |
| 187 | // Uncompressed size of the entry. |
| 188 | uint32_t uncompressed_size; |
| 189 | private: |
| 190 | DISALLOW_IMPLICIT_CONSTRUCTORS(DataDescriptor); |
| 191 | } __attribute__((packed)); |
| 192 | |
| 193 | #undef DISALLOW_IMPLICIT_CONSTRUCTORS |
| 194 | |
| 195 | static const uint32_t kGPBDDFlagMask = 0x0008; // mask value that signifies that the entry has a DD |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 196 | static const uint32_t kMaxErrorLen = 1024; |
| 197 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 198 | // The maximum size of a central directory or a file |
| 199 | // comment in bytes. |
| 200 | static const uint32_t kMaxCommentLen = 65535; |
| 201 | |
| 202 | // The maximum number of bytes to scan backwards for the EOCD start. |
| 203 | static const uint32_t kMaxEOCDSearch = kMaxCommentLen + sizeof(EocdRecord); |
| 204 | |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 205 | static const char* kErrorMessages[] = { |
| 206 | "Unknown return code.", |
Narayan Kamath | eb41ad2 | 2013-12-09 16:26:36 +0000 | [diff] [blame] | 207 | "Iteration ended", |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 208 | "Zlib error", |
| 209 | "Invalid file", |
| 210 | "Invalid handle", |
| 211 | "Duplicate entries in archive", |
| 212 | "Empty archive", |
| 213 | "Entry not found", |
| 214 | "Invalid offset", |
| 215 | "Inconsistent information", |
| 216 | "Invalid entry name", |
Narayan Kamath | eb41ad2 | 2013-12-09 16:26:36 +0000 | [diff] [blame] | 217 | "I/O Error", |
Narayan Kamath | eaf9885 | 2013-12-11 14:51:51 +0000 | [diff] [blame] | 218 | "File mapping failed" |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 219 | }; |
| 220 | |
| 221 | static const int32_t kErrorMessageUpperBound = 0; |
| 222 | |
Narayan Kamath | eb41ad2 | 2013-12-09 16:26:36 +0000 | [diff] [blame] | 223 | static const int32_t kIterationEnd = -1; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 224 | |
| 225 | // We encountered a Zlib error when inflating a stream from this file. |
| 226 | // Usually indicates file corruption. |
| 227 | static const int32_t kZlibError = -2; |
| 228 | |
| 229 | // The input file cannot be processed as a zip archive. Usually because |
| 230 | // it's too small, too large or does not have a valid signature. |
| 231 | static const int32_t kInvalidFile = -3; |
| 232 | |
| 233 | // An invalid iteration / ziparchive handle was passed in as an input |
| 234 | // argument. |
| 235 | static const int32_t kInvalidHandle = -4; |
| 236 | |
| 237 | // The zip archive contained two (or possibly more) entries with the same |
| 238 | // name. |
| 239 | static const int32_t kDuplicateEntry = -5; |
| 240 | |
| 241 | // The zip archive contains no entries. |
| 242 | static const int32_t kEmptyArchive = -6; |
| 243 | |
| 244 | // The specified entry was not found in the archive. |
| 245 | static const int32_t kEntryNotFound = -7; |
| 246 | |
| 247 | // The zip archive contained an invalid local file header pointer. |
| 248 | static const int32_t kInvalidOffset = -8; |
| 249 | |
| 250 | // The zip archive contained inconsistent entry information. This could |
| 251 | // be because the central directory & local file header did not agree, or |
| 252 | // if the actual uncompressed length or crc32 do not match their declared |
| 253 | // values. |
| 254 | static const int32_t kInconsistentInformation = -9; |
| 255 | |
| 256 | // An invalid entry name was encountered. |
| 257 | static const int32_t kInvalidEntryName = -10; |
| 258 | |
Narayan Kamath | eb41ad2 | 2013-12-09 16:26:36 +0000 | [diff] [blame] | 259 | // An I/O related system call (read, lseek, ftruncate, map) failed. |
| 260 | static const int32_t kIoError = -11; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 261 | |
Narayan Kamath | eaf9885 | 2013-12-11 14:51:51 +0000 | [diff] [blame] | 262 | // We were not able to mmap the central directory or entry contents. |
| 263 | static const int32_t kMmapFailed = -12; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 264 | |
Narayan Kamath | eaf9885 | 2013-12-11 14:51:51 +0000 | [diff] [blame] | 265 | static const int32_t kErrorMessageLowerBound = -13; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 266 | |
Narayan Kamath | eaf9885 | 2013-12-11 14:51:51 +0000 | [diff] [blame] | 267 | static const char kTempMappingFileName[] = "zip: ExtractFileToFile"; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 268 | |
| 269 | /* |
| 270 | * A Read-only Zip archive. |
| 271 | * |
| 272 | * We want "open" and "find entry by name" to be fast operations, and |
| 273 | * we want to use as little memory as possible. We memory-map the zip |
| 274 | * central directory, and load a hash table with pointers to the filenames |
| 275 | * (which aren't null-terminated). The other fields are at a fixed offset |
| 276 | * from the filename, so we don't need to extract those (but we do need |
| 277 | * to byte-read and endian-swap them every time we want them). |
| 278 | * |
| 279 | * It's possible that somebody has handed us a massive (~1GB) zip archive, |
| 280 | * so we can't expect to mmap the entire file. |
| 281 | * |
| 282 | * To speed comparisons when doing a lookup by name, we could make the mapping |
| 283 | * "private" (copy-on-write) and null-terminate the filenames after verifying |
| 284 | * the record structure. However, this requires a private mapping of |
| 285 | * every page that the Central Directory touches. Easier to tuck a copy |
| 286 | * of the string length into the hash table entry. |
| 287 | */ |
| 288 | struct ZipArchive { |
| 289 | /* open Zip archive */ |
Neil Fuller | 0047368 | 2014-07-25 14:43:04 +0100 | [diff] [blame] | 290 | const int fd; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 291 | |
| 292 | /* mapped central directory area */ |
| 293 | off64_t directory_offset; |
Narayan Kamath | eaf9885 | 2013-12-11 14:51:51 +0000 | [diff] [blame] | 294 | android::FileMap* directory_map; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 295 | |
| 296 | /* number of entries in the Zip archive */ |
| 297 | uint16_t num_entries; |
| 298 | |
| 299 | /* |
| 300 | * We know how many entries are in the Zip archive, so we can have a |
| 301 | * fixed-size hash table. We define a load factor of 0.75 and overallocat |
| 302 | * so the maximum number entries can never be higher than |
| 303 | * ((4 * UINT16_MAX) / 3 + 1) which can safely fit into a uint32_t. |
| 304 | */ |
| 305 | uint32_t hash_table_size; |
| 306 | ZipEntryName* hash_table; |
Neil Fuller | 0047368 | 2014-07-25 14:43:04 +0100 | [diff] [blame] | 307 | |
| 308 | ZipArchive(const int fd) : |
| 309 | fd(fd), |
| 310 | directory_offset(0), |
| 311 | directory_map(NULL), |
| 312 | num_entries(0), |
| 313 | hash_table_size(0), |
| 314 | hash_table(NULL) {} |
| 315 | |
| 316 | ~ZipArchive() { |
| 317 | if (fd >= 0) { |
| 318 | close(fd); |
| 319 | } |
| 320 | |
| 321 | if (directory_map != NULL) { |
| 322 | directory_map->release(); |
| 323 | } |
| 324 | free(hash_table); |
| 325 | } |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 326 | }; |
| 327 | |
| 328 | // Returns 0 on success and negative values on failure. |
Narayan Kamath | eaf9885 | 2013-12-11 14:51:51 +0000 | [diff] [blame] | 329 | static android::FileMap* MapFileSegment(const int fd, const off64_t start, |
| 330 | const size_t length, const bool read_only, |
| 331 | const char* debug_file_name) { |
| 332 | android::FileMap* file_map = new android::FileMap; |
| 333 | const bool success = file_map->create(debug_file_name, fd, start, length, read_only); |
| 334 | if (!success) { |
| 335 | file_map->release(); |
| 336 | return NULL; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 337 | } |
| 338 | |
Narayan Kamath | eaf9885 | 2013-12-11 14:51:51 +0000 | [diff] [blame] | 339 | return file_map; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 340 | } |
| 341 | |
| 342 | static int32_t CopyFileToFile(int fd, uint8_t* begin, const uint32_t length, uint64_t *crc_out) { |
| 343 | static const uint32_t kBufSize = 32768; |
| 344 | uint8_t buf[kBufSize]; |
| 345 | |
| 346 | uint32_t count = 0; |
| 347 | uint64_t crc = 0; |
Narayan Kamath | 58aaf46 | 2013-12-10 16:47:14 +0000 | [diff] [blame] | 348 | while (count < length) { |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 349 | uint32_t remaining = length - count; |
| 350 | |
| 351 | // Safe conversion because kBufSize is narrow enough for a 32 bit signed |
| 352 | // value. |
| 353 | ssize_t get_size = (remaining > kBufSize) ? kBufSize : remaining; |
| 354 | ssize_t actual = TEMP_FAILURE_RETRY(read(fd, buf, get_size)); |
| 355 | |
| 356 | if (actual != get_size) { |
Mark Salyzyn | 51d562d | 2014-05-05 14:38:05 -0700 | [diff] [blame] | 357 | ALOGW("CopyFileToFile: copy read failed (" ZD " vs " ZD ")", actual, get_size); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 358 | return kIoError; |
| 359 | } |
| 360 | |
| 361 | memcpy(begin + count, buf, get_size); |
| 362 | crc = crc32(crc, buf, get_size); |
| 363 | count += get_size; |
| 364 | } |
| 365 | |
| 366 | *crc_out = crc; |
| 367 | |
| 368 | return 0; |
| 369 | } |
| 370 | |
| 371 | /* |
| 372 | * Round up to the next highest power of 2. |
| 373 | * |
| 374 | * Found on http://graphics.stanford.edu/~seander/bithacks.html. |
| 375 | */ |
| 376 | static uint32_t RoundUpPower2(uint32_t val) { |
| 377 | val--; |
| 378 | val |= val >> 1; |
| 379 | val |= val >> 2; |
| 380 | val |= val >> 4; |
| 381 | val |= val >> 8; |
| 382 | val |= val >> 16; |
| 383 | val++; |
| 384 | |
| 385 | return val; |
| 386 | } |
| 387 | |
| 388 | static uint32_t ComputeHash(const char* str, uint16_t len) { |
| 389 | uint32_t hash = 0; |
| 390 | |
| 391 | while (len--) { |
| 392 | hash = hash * 31 + *str++; |
| 393 | } |
| 394 | |
| 395 | return hash; |
| 396 | } |
| 397 | |
| 398 | /* |
| 399 | * Convert a ZipEntry to a hash table index, verifying that it's in a |
| 400 | * valid range. |
| 401 | */ |
| 402 | static int64_t EntryToIndex(const ZipEntryName* hash_table, |
| 403 | const uint32_t hash_table_size, |
| 404 | const char* name, uint16_t length) { |
| 405 | const uint32_t hash = ComputeHash(name, length); |
| 406 | |
| 407 | // NOTE: (hash_table_size - 1) is guaranteed to be non-negative. |
| 408 | uint32_t ent = hash & (hash_table_size - 1); |
| 409 | while (hash_table[ent].name != NULL) { |
| 410 | if (hash_table[ent].name_length == length && |
| 411 | memcmp(hash_table[ent].name, name, length) == 0) { |
| 412 | return ent; |
| 413 | } |
| 414 | |
| 415 | ent = (ent + 1) & (hash_table_size - 1); |
| 416 | } |
| 417 | |
Colin Cross | f4b0b79 | 2014-02-06 20:07:15 -0800 | [diff] [blame] | 418 | ALOGV("Zip: Unable to find entry %.*s", length, name); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 419 | return kEntryNotFound; |
| 420 | } |
| 421 | |
| 422 | /* |
| 423 | * Add a new entry to the hash table. |
| 424 | */ |
| 425 | static int32_t AddToHash(ZipEntryName *hash_table, const uint64_t hash_table_size, |
| 426 | const char* name, uint16_t length) { |
| 427 | const uint64_t hash = ComputeHash(name, length); |
| 428 | uint32_t ent = hash & (hash_table_size - 1); |
| 429 | |
| 430 | /* |
| 431 | * We over-allocated the table, so we're guaranteed to find an empty slot. |
| 432 | * Further, we guarantee that the hashtable size is not 0. |
| 433 | */ |
| 434 | while (hash_table[ent].name != NULL) { |
| 435 | if (hash_table[ent].name_length == length && |
| 436 | memcmp(hash_table[ent].name, name, length) == 0) { |
| 437 | // We've found a duplicate entry. We don't accept it |
| 438 | ALOGW("Zip: Found duplicate entry %.*s", length, name); |
| 439 | return kDuplicateEntry; |
| 440 | } |
| 441 | ent = (ent + 1) & (hash_table_size - 1); |
| 442 | } |
| 443 | |
| 444 | hash_table[ent].name = name; |
| 445 | hash_table[ent].name_length = length; |
| 446 | return 0; |
| 447 | } |
| 448 | |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 449 | static int32_t MapCentralDirectory0(int fd, const char* debug_file_name, |
| 450 | ZipArchive* archive, off64_t file_length, |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 451 | off64_t read_amount, uint8_t* scan_buffer) { |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 452 | const off64_t search_start = file_length - read_amount; |
| 453 | |
| 454 | if (lseek64(fd, search_start, SEEK_SET) != search_start) { |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 455 | ALOGW("Zip: seek %" PRId64 " failed: %s", static_cast<int64_t>(search_start), |
| 456 | strerror(errno)); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 457 | return kIoError; |
| 458 | } |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 459 | ssize_t actual = TEMP_FAILURE_RETRY( |
| 460 | read(fd, scan_buffer, static_cast<size_t>(read_amount))); |
| 461 | if (actual != static_cast<ssize_t>(read_amount)) { |
| 462 | ALOGW("Zip: read %" PRId64 " failed: %s", static_cast<int64_t>(read_amount), |
| 463 | strerror(errno)); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 464 | return kIoError; |
| 465 | } |
| 466 | |
| 467 | /* |
| 468 | * Scan backward for the EOCD magic. In an archive without a trailing |
| 469 | * comment, we'll find it on the first try. (We may want to consider |
| 470 | * doing an initial minimal read; if we don't find it, retry with a |
| 471 | * second read as above.) |
| 472 | */ |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 473 | int i = read_amount - sizeof(EocdRecord); |
| 474 | for (; i >= 0; i--) { |
| 475 | if (scan_buffer[i] == 0x50 && |
| 476 | ((*reinterpret_cast<uint32_t*>(&scan_buffer[i])) == EocdRecord::kSignature)) { |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 477 | ALOGV("+++ Found EOCD at buf+%d", i); |
| 478 | break; |
| 479 | } |
| 480 | } |
| 481 | if (i < 0) { |
| 482 | ALOGD("Zip: EOCD not found, %s is not zip", debug_file_name); |
| 483 | return kInvalidFile; |
| 484 | } |
| 485 | |
| 486 | const off64_t eocd_offset = search_start + i; |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 487 | const EocdRecord* eocd = reinterpret_cast<const EocdRecord*>(scan_buffer + i); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 488 | /* |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 489 | * Verify that there's no trailing space at the end of the central directory |
| 490 | * and its comment. |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 491 | */ |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 492 | const off64_t calculated_length = eocd_offset + sizeof(EocdRecord) |
| 493 | + eocd->comment_length; |
| 494 | if (calculated_length != file_length) { |
Narayan Kamath | 4f6b499 | 2014-06-03 13:59:23 +0100 | [diff] [blame] | 495 | ALOGW("Zip: %" PRId64 " extraneous bytes at the end of the central directory", |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 496 | static_cast<int64_t>(file_length - calculated_length)); |
Narayan Kamath | 4f6b499 | 2014-06-03 13:59:23 +0100 | [diff] [blame] | 497 | return kInvalidFile; |
| 498 | } |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 499 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 500 | /* |
| 501 | * Grab the CD offset and size, and the number of entries in the |
| 502 | * archive and verify that they look reasonable. |
| 503 | */ |
Tianjie Xu | 1ee4892 | 2016-09-21 14:58:11 -0700 | [diff] [blame^] | 504 | if (static_cast<off64_t>(eocd->cd_start_offset) + eocd->cd_size > eocd_offset) { |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 505 | ALOGW("Zip: bad offsets (dir %" PRIu32 ", size %" PRIu32 ", eocd %" PRId64 ")", |
| 506 | eocd->cd_start_offset, eocd->cd_size, static_cast<int64_t>(eocd_offset)); |
Tianjie Xu | 1ee4892 | 2016-09-21 14:58:11 -0700 | [diff] [blame^] | 507 | #if defined(__ANDROID__) |
| 508 | if (eocd->cd_start_offset + eocd->cd_size <= eocd_offset) { |
| 509 | android_errorWriteLog(0x534e4554, "31251826"); |
| 510 | } |
| 511 | #endif |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 512 | return kInvalidOffset; |
| 513 | } |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 514 | if (eocd->num_records == 0) { |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 515 | ALOGW("Zip: empty archive?"); |
| 516 | return kEmptyArchive; |
| 517 | } |
| 518 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 519 | ALOGV("+++ num_entries=%" PRIu32 "dir_size=%" PRIu32 " dir_offset=%" PRIu32, |
| 520 | eocd->num_records, eocd->cd_size, eocd->cd_start_offset); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 521 | |
| 522 | /* |
| 523 | * It all looks good. Create a mapping for the CD, and set the fields |
| 524 | * in archive. |
| 525 | */ |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 526 | android::FileMap* map = MapFileSegment(fd, |
| 527 | static_cast<off64_t>(eocd->cd_start_offset), |
| 528 | static_cast<size_t>(eocd->cd_size), |
| 529 | true /* read only */, debug_file_name); |
Narayan Kamath | eaf9885 | 2013-12-11 14:51:51 +0000 | [diff] [blame] | 530 | if (map == NULL) { |
| 531 | archive->directory_map = NULL; |
| 532 | return kMmapFailed; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 533 | } |
| 534 | |
Narayan Kamath | eaf9885 | 2013-12-11 14:51:51 +0000 | [diff] [blame] | 535 | archive->directory_map = map; |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 536 | archive->num_entries = eocd->num_records; |
| 537 | archive->directory_offset = eocd->cd_start_offset; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 538 | |
| 539 | return 0; |
| 540 | } |
| 541 | |
| 542 | /* |
| 543 | * Find the zip Central Directory and memory-map it. |
| 544 | * |
| 545 | * On success, returns 0 after populating fields from the EOCD area: |
| 546 | * directory_offset |
| 547 | * directory_map |
| 548 | * num_entries |
| 549 | */ |
| 550 | static int32_t MapCentralDirectory(int fd, const char* debug_file_name, |
| 551 | ZipArchive* archive) { |
| 552 | |
| 553 | // Test file length. We use lseek64 to make sure the file |
| 554 | // is small enough to be a zip file (Its size must be less than |
| 555 | // 0xffffffff bytes). |
| 556 | off64_t file_length = lseek64(fd, 0, SEEK_END); |
| 557 | if (file_length == -1) { |
| 558 | ALOGV("Zip: lseek on fd %d failed", fd); |
| 559 | return kInvalidFile; |
| 560 | } |
| 561 | |
| 562 | if (file_length > (off64_t) 0xffffffff) { |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 563 | ALOGV("Zip: zip file too long %" PRId64, static_cast<int64_t>(file_length)); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 564 | return kInvalidFile; |
| 565 | } |
| 566 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 567 | if (file_length < static_cast<off64_t>(sizeof(EocdRecord))) { |
| 568 | ALOGV("Zip: length %" PRId64 " is too small to be zip", static_cast<int64_t>(file_length)); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 569 | return kInvalidFile; |
| 570 | } |
| 571 | |
| 572 | /* |
| 573 | * Perform the traditional EOCD snipe hunt. |
| 574 | * |
| 575 | * We're searching for the End of Central Directory magic number, |
| 576 | * which appears at the start of the EOCD block. It's followed by |
| 577 | * 18 bytes of EOCD stuff and up to 64KB of archive comment. We |
| 578 | * need to read the last part of the file into a buffer, dig through |
| 579 | * it to find the magic number, parse some values out, and use those |
| 580 | * to determine the extent of the CD. |
| 581 | * |
| 582 | * We start by pulling in the last part of the file. |
| 583 | */ |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 584 | off64_t read_amount = kMaxEOCDSearch; |
| 585 | if (file_length < read_amount) { |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 586 | read_amount = file_length; |
| 587 | } |
| 588 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 589 | uint8_t* scan_buffer = reinterpret_cast<uint8_t*>(malloc(read_amount)); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 590 | int32_t result = MapCentralDirectory0(fd, debug_file_name, archive, |
| 591 | file_length, read_amount, scan_buffer); |
| 592 | |
| 593 | free(scan_buffer); |
| 594 | return result; |
| 595 | } |
| 596 | |
| 597 | /* |
| 598 | * Parses the Zip archive's Central Directory. Allocates and populates the |
| 599 | * hash table. |
| 600 | * |
| 601 | * Returns 0 on success. |
| 602 | */ |
| 603 | static int32_t ParseZipArchive(ZipArchive* archive) { |
| 604 | int32_t result = -1; |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 605 | const uint8_t* const cd_ptr = (const uint8_t*) archive->directory_map->getDataPtr(); |
| 606 | const size_t cd_length = archive->directory_map->getDataLength(); |
| 607 | const uint16_t num_entries = archive->num_entries; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 608 | |
| 609 | /* |
| 610 | * Create hash table. We have a minimum 75% load factor, possibly as |
| 611 | * low as 50% after we round off to a power of 2. There must be at |
| 612 | * least one unused entry to avoid an infinite loop during creation. |
| 613 | */ |
| 614 | archive->hash_table_size = RoundUpPower2(1 + (num_entries * 4) / 3); |
| 615 | archive->hash_table = (ZipEntryName*) calloc(archive->hash_table_size, |
| 616 | sizeof(ZipEntryName)); |
| 617 | |
| 618 | /* |
| 619 | * Walk through the central directory, adding entries to the hash |
| 620 | * table and verifying values. |
| 621 | */ |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 622 | const uint8_t* const cd_end = cd_ptr + cd_length; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 623 | const uint8_t* ptr = cd_ptr; |
| 624 | for (uint16_t i = 0; i < num_entries; i++) { |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 625 | const CentralDirectoryRecord* cdr = |
| 626 | reinterpret_cast<const CentralDirectoryRecord*>(ptr); |
| 627 | if (cdr->record_signature != CentralDirectoryRecord::kSignature) { |
Mark Salyzyn | 088bf90 | 2014-05-08 16:02:20 -0700 | [diff] [blame] | 628 | ALOGW("Zip: missed a central dir sig (at %" PRIu16 ")", i); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 629 | goto bail; |
| 630 | } |
| 631 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 632 | if (ptr + sizeof(CentralDirectoryRecord) > cd_end) { |
Mark Salyzyn | 088bf90 | 2014-05-08 16:02:20 -0700 | [diff] [blame] | 633 | ALOGW("Zip: ran off the end (at %" PRIu16 ")", i); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 634 | goto bail; |
| 635 | } |
| 636 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 637 | const off64_t local_header_offset = cdr->local_file_header_offset; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 638 | if (local_header_offset >= archive->directory_offset) { |
Mark Salyzyn | 56a90a0 | 2014-05-08 17:20:55 -0700 | [diff] [blame] | 639 | ALOGW("Zip: bad LFH offset %" PRId64 " at entry %" PRIu16, (int64_t)local_header_offset, i); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 640 | goto bail; |
| 641 | } |
| 642 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 643 | const uint16_t file_name_length = cdr->file_name_length; |
| 644 | const uint16_t extra_length = cdr->extra_field_length; |
| 645 | const uint16_t comment_length = cdr->comment_length; |
Piotr Jastrzebski | 0c1b894 | 2014-08-15 12:53:00 +0100 | [diff] [blame] | 646 | const char* file_name = reinterpret_cast<const char*>(ptr + sizeof(CentralDirectoryRecord)); |
| 647 | |
| 648 | /* check that file name doesn't contain \0 character */ |
| 649 | if (memchr(file_name, 0, file_name_length) != NULL) { |
| 650 | ALOGW("Zip: entry name can't contain \\0 character"); |
| 651 | goto bail; |
| 652 | } |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 653 | |
| 654 | /* add the CDE filename to the hash table */ |
| 655 | const int add_result = AddToHash(archive->hash_table, |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 656 | archive->hash_table_size, file_name, file_name_length); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 657 | if (add_result) { |
| 658 | ALOGW("Zip: Error adding entry to hash table %d", add_result); |
| 659 | result = add_result; |
| 660 | goto bail; |
| 661 | } |
| 662 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 663 | ptr += sizeof(CentralDirectoryRecord) + file_name_length + extra_length + comment_length; |
| 664 | if ((ptr - cd_ptr) > static_cast<int64_t>(cd_length)) { |
Mark Salyzyn | 088bf90 | 2014-05-08 16:02:20 -0700 | [diff] [blame] | 665 | ALOGW("Zip: bad CD advance (%tu vs %zu) at entry %" PRIu16, |
| 666 | ptr - cd_ptr, cd_length, i); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 667 | goto bail; |
| 668 | } |
| 669 | } |
Mark Salyzyn | 088bf90 | 2014-05-08 16:02:20 -0700 | [diff] [blame] | 670 | ALOGV("+++ zip good scan %" PRIu16 " entries", num_entries); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 671 | |
| 672 | result = 0; |
| 673 | |
| 674 | bail: |
| 675 | return result; |
| 676 | } |
| 677 | |
| 678 | static int32_t OpenArchiveInternal(ZipArchive* archive, |
| 679 | const char* debug_file_name) { |
| 680 | int32_t result = -1; |
| 681 | if ((result = MapCentralDirectory(archive->fd, debug_file_name, archive))) { |
| 682 | return result; |
| 683 | } |
| 684 | |
| 685 | if ((result = ParseZipArchive(archive))) { |
| 686 | return result; |
| 687 | } |
| 688 | |
| 689 | return 0; |
| 690 | } |
| 691 | |
| 692 | int32_t OpenArchiveFd(int fd, const char* debug_file_name, |
| 693 | ZipArchiveHandle* handle) { |
Neil Fuller | 0047368 | 2014-07-25 14:43:04 +0100 | [diff] [blame] | 694 | ZipArchive* archive = new ZipArchive(fd); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 695 | *handle = archive; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 696 | return OpenArchiveInternal(archive, debug_file_name); |
| 697 | } |
| 698 | |
| 699 | int32_t OpenArchive(const char* fileName, ZipArchiveHandle* handle) { |
Neil Fuller | 0047368 | 2014-07-25 14:43:04 +0100 | [diff] [blame] | 700 | const int fd = open(fileName, O_RDONLY | O_BINARY, 0); |
| 701 | ZipArchive* archive = new ZipArchive(fd); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 702 | *handle = archive; |
| 703 | |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 704 | if (fd < 0) { |
| 705 | ALOGW("Unable to open '%s': %s", fileName, strerror(errno)); |
| 706 | return kIoError; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 707 | } |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 708 | return OpenArchiveInternal(archive, fileName); |
| 709 | } |
| 710 | |
| 711 | /* |
| 712 | * Close a ZipArchive, closing the file and freeing the contents. |
| 713 | */ |
| 714 | void CloseArchive(ZipArchiveHandle handle) { |
| 715 | ZipArchive* archive = (ZipArchive*) handle; |
| 716 | ALOGV("Closing archive %p", archive); |
Neil Fuller | 0047368 | 2014-07-25 14:43:04 +0100 | [diff] [blame] | 717 | delete archive; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 718 | } |
| 719 | |
| 720 | static int32_t UpdateEntryFromDataDescriptor(int fd, |
| 721 | ZipEntry *entry) { |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 722 | uint8_t ddBuf[sizeof(DataDescriptor) + sizeof(DataDescriptor::kOptSignature)]; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 723 | ssize_t actual = TEMP_FAILURE_RETRY(read(fd, ddBuf, sizeof(ddBuf))); |
| 724 | if (actual != sizeof(ddBuf)) { |
| 725 | return kIoError; |
| 726 | } |
| 727 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 728 | const uint32_t ddSignature = *(reinterpret_cast<const uint32_t*>(ddBuf)); |
| 729 | const uint16_t offset = (ddSignature == DataDescriptor::kOptSignature) ? 4 : 0; |
| 730 | const DataDescriptor* descriptor = reinterpret_cast<const DataDescriptor*>(ddBuf + offset); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 731 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 732 | entry->crc32 = descriptor->crc32; |
| 733 | entry->compressed_length = descriptor->compressed_size; |
| 734 | entry->uncompressed_length = descriptor->uncompressed_size; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 735 | |
| 736 | return 0; |
| 737 | } |
| 738 | |
| 739 | // Attempts to read |len| bytes into |buf| at offset |off|. |
| 740 | // |
| 741 | // This method uses pread64 on platforms that support it and |
| 742 | // lseek64 + read on platforms that don't. This implies that |
| 743 | // callers should not rely on the |fd| offset being incremented |
| 744 | // as a side effect of this call. |
| 745 | static inline ssize_t ReadAtOffset(int fd, uint8_t* buf, size_t len, |
| 746 | off64_t off) { |
| 747 | #ifdef HAVE_PREAD |
| 748 | return TEMP_FAILURE_RETRY(pread64(fd, buf, len, off)); |
| 749 | #else |
| 750 | // The only supported platform that doesn't support pread at the moment |
| 751 | // is Windows. Only recent versions of windows support unix like forks, |
| 752 | // and even there the semantics are quite different. |
| 753 | if (lseek64(fd, off, SEEK_SET) != off) { |
Mark Salyzyn | 99ef991 | 2014-03-14 14:26:22 -0700 | [diff] [blame] | 754 | ALOGW("Zip: failed seek to offset %" PRId64, off); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 755 | return kIoError; |
| 756 | } |
| 757 | |
| 758 | return TEMP_FAILURE_RETRY(read(fd, buf, len)); |
| 759 | #endif // HAVE_PREAD |
| 760 | } |
| 761 | |
| 762 | static int32_t FindEntry(const ZipArchive* archive, const int ent, |
| 763 | ZipEntry* data) { |
| 764 | const uint16_t nameLen = archive->hash_table[ent].name_length; |
| 765 | const char* name = archive->hash_table[ent].name; |
| 766 | |
| 767 | // Recover the start of the central directory entry from the filename |
| 768 | // pointer. The filename is the first entry past the fixed-size data, |
| 769 | // so we can just subtract back from that. |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 770 | const uint8_t* ptr = reinterpret_cast<const uint8_t*>(name); |
| 771 | ptr -= sizeof(CentralDirectoryRecord); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 772 | |
| 773 | // This is the base of our mmapped region, we have to sanity check that |
| 774 | // the name that's in the hash table is a pointer to a location within |
| 775 | // this mapped region. |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 776 | const uint8_t* base_ptr = reinterpret_cast<const uint8_t*>( |
| 777 | archive->directory_map->getDataPtr()); |
Narayan Kamath | eaf9885 | 2013-12-11 14:51:51 +0000 | [diff] [blame] | 778 | if (ptr < base_ptr || ptr > base_ptr + archive->directory_map->getDataLength()) { |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 779 | ALOGW("Zip: Invalid entry pointer"); |
| 780 | return kInvalidOffset; |
| 781 | } |
| 782 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 783 | const CentralDirectoryRecord *cdr = |
| 784 | reinterpret_cast<const CentralDirectoryRecord*>(ptr); |
| 785 | |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 786 | // The offset of the start of the central directory in the zipfile. |
| 787 | // We keep this lying around so that we can sanity check all our lengths |
| 788 | // and our per-file structures. |
| 789 | const off64_t cd_offset = archive->directory_offset; |
| 790 | |
| 791 | // Fill out the compression method, modification time, crc32 |
| 792 | // and other interesting attributes from the central directory. These |
| 793 | // will later be compared against values from the local file header. |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 794 | data->method = cdr->compression_method; |
| 795 | data->mod_time = cdr->last_mod_time; |
| 796 | data->crc32 = cdr->crc32; |
| 797 | data->compressed_length = cdr->compressed_size; |
| 798 | data->uncompressed_length = cdr->uncompressed_size; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 799 | |
| 800 | // Figure out the local header offset from the central directory. The |
| 801 | // actual file data will begin after the local header and the name / |
| 802 | // extra comments. |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 803 | const off64_t local_header_offset = cdr->local_file_header_offset; |
| 804 | if (local_header_offset + static_cast<off64_t>(sizeof(LocalFileHeader)) >= cd_offset) { |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 805 | ALOGW("Zip: bad local hdr offset in zip"); |
| 806 | return kInvalidOffset; |
| 807 | } |
| 808 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 809 | uint8_t lfh_buf[sizeof(LocalFileHeader)]; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 810 | ssize_t actual = ReadAtOffset(archive->fd, lfh_buf, sizeof(lfh_buf), |
| 811 | local_header_offset); |
| 812 | if (actual != sizeof(lfh_buf)) { |
Mark Salyzyn | 56a90a0 | 2014-05-08 17:20:55 -0700 | [diff] [blame] | 813 | ALOGW("Zip: failed reading lfh name from offset %" PRId64, (int64_t)local_header_offset); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 814 | return kIoError; |
| 815 | } |
| 816 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 817 | const LocalFileHeader *lfh = reinterpret_cast<const LocalFileHeader*>(lfh_buf); |
| 818 | |
| 819 | if (lfh->lfh_signature != LocalFileHeader::kSignature) { |
Mark Salyzyn | 99ef991 | 2014-03-14 14:26:22 -0700 | [diff] [blame] | 820 | ALOGW("Zip: didn't find signature at start of lfh, offset=%" PRId64, |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 821 | static_cast<int64_t>(local_header_offset)); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 822 | return kInvalidOffset; |
| 823 | } |
| 824 | |
| 825 | // Paranoia: Match the values specified in the local file header |
| 826 | // to those specified in the central directory. |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 827 | if ((lfh->gpb_flags & kGPBDDFlagMask) == 0) { |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 828 | data->has_data_descriptor = 0; |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 829 | if (data->compressed_length != lfh->compressed_size |
| 830 | || data->uncompressed_length != lfh->uncompressed_size |
| 831 | || data->crc32 != lfh->crc32) { |
Mark Salyzyn | 088bf90 | 2014-05-08 16:02:20 -0700 | [diff] [blame] | 832 | ALOGW("Zip: size/crc32 mismatch. expected {%" PRIu32 ", %" PRIu32 |
| 833 | ", %" PRIx32 "}, was {%" PRIu32 ", %" PRIu32 ", %" PRIx32 "}", |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 834 | data->compressed_length, data->uncompressed_length, data->crc32, |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 835 | lfh->compressed_size, lfh->uncompressed_size, lfh->crc32); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 836 | return kInconsistentInformation; |
| 837 | } |
| 838 | } else { |
| 839 | data->has_data_descriptor = 1; |
| 840 | } |
| 841 | |
| 842 | // Check that the local file header name matches the declared |
| 843 | // name in the central directory. |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 844 | if (lfh->file_name_length == nameLen) { |
| 845 | const off64_t name_offset = local_header_offset + sizeof(LocalFileHeader); |
| 846 | if (name_offset + lfh->file_name_length >= cd_offset) { |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 847 | ALOGW("Zip: Invalid declared length"); |
| 848 | return kInvalidOffset; |
| 849 | } |
| 850 | |
| 851 | uint8_t* name_buf = (uint8_t*) malloc(nameLen); |
| 852 | ssize_t actual = ReadAtOffset(archive->fd, name_buf, nameLen, |
| 853 | name_offset); |
| 854 | |
| 855 | if (actual != nameLen) { |
Mark Salyzyn | 56a90a0 | 2014-05-08 17:20:55 -0700 | [diff] [blame] | 856 | ALOGW("Zip: failed reading lfh name from offset %" PRId64, (int64_t)name_offset); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 857 | free(name_buf); |
| 858 | return kIoError; |
| 859 | } |
| 860 | |
| 861 | if (memcmp(name, name_buf, nameLen)) { |
| 862 | free(name_buf); |
| 863 | return kInconsistentInformation; |
| 864 | } |
| 865 | |
| 866 | free(name_buf); |
| 867 | } else { |
| 868 | ALOGW("Zip: lfh name did not match central directory."); |
| 869 | return kInconsistentInformation; |
| 870 | } |
| 871 | |
Narayan Kamath | 926973e | 2014-06-09 14:18:14 +0100 | [diff] [blame] | 872 | const off64_t data_offset = local_header_offset + sizeof(LocalFileHeader) |
| 873 | + lfh->file_name_length + lfh->extra_field_length; |
Narayan Kamath | 48953a1 | 2014-01-24 12:32:39 +0000 | [diff] [blame] | 874 | if (data_offset > cd_offset) { |
Mark Salyzyn | 56a90a0 | 2014-05-08 17:20:55 -0700 | [diff] [blame] | 875 | ALOGW("Zip: bad data offset %" PRId64 " in zip", (int64_t)data_offset); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 876 | return kInvalidOffset; |
| 877 | } |
| 878 | |
| 879 | if ((off64_t)(data_offset + data->compressed_length) > cd_offset) { |
Mark Salyzyn | 088bf90 | 2014-05-08 16:02:20 -0700 | [diff] [blame] | 880 | ALOGW("Zip: bad compressed length in zip (%" PRId64 " + %" PRIu32 " > %" PRId64 ")", |
Mark Salyzyn | 56a90a0 | 2014-05-08 17:20:55 -0700 | [diff] [blame] | 881 | (int64_t)data_offset, data->compressed_length, (int64_t)cd_offset); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 882 | return kInvalidOffset; |
| 883 | } |
| 884 | |
| 885 | if (data->method == kCompressStored && |
| 886 | (off64_t)(data_offset + data->uncompressed_length) > cd_offset) { |
Mark Salyzyn | 088bf90 | 2014-05-08 16:02:20 -0700 | [diff] [blame] | 887 | ALOGW("Zip: bad uncompressed length in zip (%" PRId64 " + %" PRIu32 " > %" PRId64 ")", |
Mark Salyzyn | 96c5c99 | 2014-05-08 19:16:40 -0700 | [diff] [blame] | 888 | (int64_t)data_offset, data->uncompressed_length, (int64_t)cd_offset); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 889 | return kInvalidOffset; |
| 890 | } |
| 891 | |
| 892 | data->offset = data_offset; |
| 893 | return 0; |
| 894 | } |
| 895 | |
| 896 | struct IterationHandle { |
| 897 | uint32_t position; |
| 898 | const char* prefix; |
| 899 | uint16_t prefix_len; |
| 900 | ZipArchive* archive; |
| 901 | }; |
| 902 | |
| 903 | int32_t StartIteration(ZipArchiveHandle handle, void** cookie_ptr, const char* prefix) { |
| 904 | ZipArchive* archive = (ZipArchive *) handle; |
| 905 | |
| 906 | if (archive == NULL || archive->hash_table == NULL) { |
| 907 | ALOGW("Zip: Invalid ZipArchiveHandle"); |
| 908 | return kInvalidHandle; |
| 909 | } |
| 910 | |
| 911 | IterationHandle* cookie = (IterationHandle*) malloc(sizeof(IterationHandle)); |
| 912 | cookie->position = 0; |
| 913 | cookie->prefix = prefix; |
| 914 | cookie->archive = archive; |
| 915 | if (prefix != NULL) { |
| 916 | cookie->prefix_len = strlen(prefix); |
| 917 | } |
| 918 | |
| 919 | *cookie_ptr = cookie ; |
| 920 | return 0; |
| 921 | } |
| 922 | |
| 923 | int32_t FindEntry(const ZipArchiveHandle handle, const char* entryName, |
| 924 | ZipEntry* data) { |
| 925 | const ZipArchive* archive = (ZipArchive*) handle; |
| 926 | const int nameLen = strlen(entryName); |
| 927 | if (nameLen == 0 || nameLen > 65535) { |
| 928 | ALOGW("Zip: Invalid filename %s", entryName); |
| 929 | return kInvalidEntryName; |
| 930 | } |
| 931 | |
| 932 | const int64_t ent = EntryToIndex(archive->hash_table, |
| 933 | archive->hash_table_size, entryName, nameLen); |
| 934 | |
| 935 | if (ent < 0) { |
Narayan Kamath | a1ff801 | 2013-12-31 10:27:59 +0000 | [diff] [blame] | 936 | ALOGV("Zip: Could not find entry %.*s", nameLen, entryName); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 937 | return ent; |
| 938 | } |
| 939 | |
| 940 | return FindEntry(archive, ent, data); |
| 941 | } |
| 942 | |
| 943 | int32_t Next(void* cookie, ZipEntry* data, ZipEntryName* name) { |
| 944 | IterationHandle* handle = (IterationHandle *) cookie; |
| 945 | if (handle == NULL) { |
| 946 | return kInvalidHandle; |
| 947 | } |
| 948 | |
| 949 | ZipArchive* archive = handle->archive; |
| 950 | if (archive == NULL || archive->hash_table == NULL) { |
| 951 | ALOGW("Zip: Invalid ZipArchiveHandle"); |
| 952 | return kInvalidHandle; |
| 953 | } |
| 954 | |
| 955 | const uint32_t currentOffset = handle->position; |
| 956 | const uint32_t hash_table_length = archive->hash_table_size; |
| 957 | const ZipEntryName *hash_table = archive->hash_table; |
| 958 | |
| 959 | for (uint32_t i = currentOffset; i < hash_table_length; ++i) { |
| 960 | if (hash_table[i].name != NULL && |
| 961 | (handle->prefix == NULL || |
| 962 | (memcmp(handle->prefix, hash_table[i].name, handle->prefix_len) == 0))) { |
| 963 | handle->position = (i + 1); |
| 964 | const int error = FindEntry(archive, i, data); |
| 965 | if (!error) { |
| 966 | name->name = hash_table[i].name; |
| 967 | name->name_length = hash_table[i].name_length; |
| 968 | } |
| 969 | |
| 970 | return error; |
| 971 | } |
| 972 | } |
| 973 | |
| 974 | handle->position = 0; |
| 975 | return kIterationEnd; |
| 976 | } |
| 977 | |
| 978 | static int32_t InflateToFile(int fd, const ZipEntry* entry, |
| 979 | uint8_t* begin, uint32_t length, |
| 980 | uint64_t* crc_out) { |
| 981 | int32_t result = -1; |
| 982 | const uint32_t kBufSize = 32768; |
| 983 | uint8_t read_buf[kBufSize]; |
| 984 | uint8_t write_buf[kBufSize]; |
| 985 | z_stream zstream; |
| 986 | int zerr; |
| 987 | |
| 988 | /* |
| 989 | * Initialize the zlib stream struct. |
| 990 | */ |
| 991 | memset(&zstream, 0, sizeof(zstream)); |
| 992 | zstream.zalloc = Z_NULL; |
| 993 | zstream.zfree = Z_NULL; |
| 994 | zstream.opaque = Z_NULL; |
| 995 | zstream.next_in = NULL; |
| 996 | zstream.avail_in = 0; |
| 997 | zstream.next_out = (Bytef*) write_buf; |
| 998 | zstream.avail_out = kBufSize; |
| 999 | zstream.data_type = Z_UNKNOWN; |
| 1000 | |
| 1001 | /* |
| 1002 | * Use the undocumented "negative window bits" feature to tell zlib |
| 1003 | * that there's no zlib header waiting for it. |
| 1004 | */ |
| 1005 | zerr = inflateInit2(&zstream, -MAX_WBITS); |
| 1006 | if (zerr != Z_OK) { |
| 1007 | if (zerr == Z_VERSION_ERROR) { |
| 1008 | ALOGE("Installed zlib is not compatible with linked version (%s)", |
| 1009 | ZLIB_VERSION); |
| 1010 | } else { |
| 1011 | ALOGW("Call to inflateInit2 failed (zerr=%d)", zerr); |
| 1012 | } |
| 1013 | |
| 1014 | return kZlibError; |
| 1015 | } |
| 1016 | |
| 1017 | const uint32_t uncompressed_length = entry->uncompressed_length; |
| 1018 | |
| 1019 | uint32_t compressed_length = entry->compressed_length; |
| 1020 | uint32_t write_count = 0; |
| 1021 | do { |
| 1022 | /* read as much as we can */ |
| 1023 | if (zstream.avail_in == 0) { |
Mark Salyzyn | 51d562d | 2014-05-05 14:38:05 -0700 | [diff] [blame] | 1024 | const ZD_TYPE getSize = (compressed_length > kBufSize) ? kBufSize : compressed_length; |
| 1025 | const ZD_TYPE actual = TEMP_FAILURE_RETRY(read(fd, read_buf, getSize)); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 1026 | if (actual != getSize) { |
Mark Salyzyn | 51d562d | 2014-05-05 14:38:05 -0700 | [diff] [blame] | 1027 | ALOGW("Zip: inflate read failed (" ZD " vs " ZD ")", actual, getSize); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 1028 | result = kIoError; |
| 1029 | goto z_bail; |
| 1030 | } |
| 1031 | |
| 1032 | compressed_length -= getSize; |
| 1033 | |
| 1034 | zstream.next_in = read_buf; |
| 1035 | zstream.avail_in = getSize; |
| 1036 | } |
| 1037 | |
| 1038 | /* uncompress the data */ |
| 1039 | zerr = inflate(&zstream, Z_NO_FLUSH); |
| 1040 | if (zerr != Z_OK && zerr != Z_STREAM_END) { |
| 1041 | ALOGW("Zip: inflate zerr=%d (nIn=%p aIn=%u nOut=%p aOut=%u)", |
| 1042 | zerr, zstream.next_in, zstream.avail_in, |
| 1043 | zstream.next_out, zstream.avail_out); |
| 1044 | result = kZlibError; |
| 1045 | goto z_bail; |
| 1046 | } |
| 1047 | |
| 1048 | /* write when we're full or when we're done */ |
| 1049 | if (zstream.avail_out == 0 || |
| 1050 | (zerr == Z_STREAM_END && zstream.avail_out != kBufSize)) { |
| 1051 | const size_t write_size = zstream.next_out - write_buf; |
| 1052 | // The file might have declared a bogus length. |
| 1053 | if (write_size + write_count > length) { |
| 1054 | goto z_bail; |
| 1055 | } |
| 1056 | memcpy(begin + write_count, write_buf, write_size); |
| 1057 | write_count += write_size; |
| 1058 | |
| 1059 | zstream.next_out = write_buf; |
| 1060 | zstream.avail_out = kBufSize; |
| 1061 | } |
| 1062 | } while (zerr == Z_OK); |
| 1063 | |
| 1064 | assert(zerr == Z_STREAM_END); /* other errors should've been caught */ |
| 1065 | |
| 1066 | // stream.adler holds the crc32 value for such streams. |
| 1067 | *crc_out = zstream.adler; |
| 1068 | |
| 1069 | if (zstream.total_out != uncompressed_length || compressed_length != 0) { |
Mark Salyzyn | 088bf90 | 2014-05-08 16:02:20 -0700 | [diff] [blame] | 1070 | ALOGW("Zip: size mismatch on inflated file (%lu vs %" PRIu32 ")", |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 1071 | zstream.total_out, uncompressed_length); |
| 1072 | result = kInconsistentInformation; |
| 1073 | goto z_bail; |
| 1074 | } |
| 1075 | |
| 1076 | result = 0; |
| 1077 | |
| 1078 | z_bail: |
| 1079 | inflateEnd(&zstream); /* free up any allocated structures */ |
| 1080 | |
| 1081 | return result; |
| 1082 | } |
| 1083 | |
| 1084 | int32_t ExtractToMemory(ZipArchiveHandle handle, |
| 1085 | ZipEntry* entry, uint8_t* begin, uint32_t size) { |
| 1086 | ZipArchive* archive = (ZipArchive*) handle; |
| 1087 | const uint16_t method = entry->method; |
| 1088 | off64_t data_offset = entry->offset; |
| 1089 | |
| 1090 | if (lseek64(archive->fd, data_offset, SEEK_SET) != data_offset) { |
Mark Salyzyn | 56a90a0 | 2014-05-08 17:20:55 -0700 | [diff] [blame] | 1091 | ALOGW("Zip: lseek to data at %" PRId64 " failed", (int64_t)data_offset); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 1092 | return kIoError; |
| 1093 | } |
| 1094 | |
| 1095 | // this should default to kUnknownCompressionMethod. |
| 1096 | int32_t return_value = -1; |
| 1097 | uint64_t crc = 0; |
| 1098 | if (method == kCompressStored) { |
| 1099 | return_value = CopyFileToFile(archive->fd, begin, size, &crc); |
| 1100 | } else if (method == kCompressDeflated) { |
| 1101 | return_value = InflateToFile(archive->fd, entry, begin, size, &crc); |
| 1102 | } |
| 1103 | |
| 1104 | if (!return_value && entry->has_data_descriptor) { |
| 1105 | return_value = UpdateEntryFromDataDescriptor(archive->fd, entry); |
| 1106 | if (return_value) { |
| 1107 | return return_value; |
| 1108 | } |
| 1109 | } |
| 1110 | |
| 1111 | // TODO: Fix this check by passing the right flags to inflate2 so that |
| 1112 | // it calculates the CRC for us. |
| 1113 | if (entry->crc32 != crc && false) { |
Mark Salyzyn | 088bf90 | 2014-05-08 16:02:20 -0700 | [diff] [blame] | 1114 | ALOGW("Zip: crc mismatch: expected %" PRIu32 ", was %" PRIu64, entry->crc32, crc); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 1115 | return kInconsistentInformation; |
| 1116 | } |
| 1117 | |
| 1118 | return return_value; |
| 1119 | } |
| 1120 | |
| 1121 | int32_t ExtractEntryToFile(ZipArchiveHandle handle, |
| 1122 | ZipEntry* entry, int fd) { |
| 1123 | const int32_t declared_length = entry->uncompressed_length; |
| 1124 | |
Narayan Kamath | 00a258c | 2013-12-13 16:06:19 +0000 | [diff] [blame] | 1125 | const off64_t current_offset = lseek64(fd, 0, SEEK_CUR); |
| 1126 | if (current_offset == -1) { |
| 1127 | ALOGW("Zip: unable to seek to current location on fd %d: %s", fd, |
| 1128 | strerror(errno)); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 1129 | return kIoError; |
| 1130 | } |
| 1131 | |
Narayan Kamath | 00a258c | 2013-12-13 16:06:19 +0000 | [diff] [blame] | 1132 | int result = TEMP_FAILURE_RETRY(ftruncate(fd, declared_length + current_offset)); |
| 1133 | if (result == -1) { |
Mark Salyzyn | 99ef991 | 2014-03-14 14:26:22 -0700 | [diff] [blame] | 1134 | ALOGW("Zip: unable to truncate file to %" PRId64 ": %s", |
Mark Salyzyn | 56a90a0 | 2014-05-08 17:20:55 -0700 | [diff] [blame] | 1135 | (int64_t)(declared_length + current_offset), strerror(errno)); |
Narayan Kamath | 00a258c | 2013-12-13 16:06:19 +0000 | [diff] [blame] | 1136 | return kIoError; |
| 1137 | } |
| 1138 | |
Narayan Kamath | 48953a1 | 2014-01-24 12:32:39 +0000 | [diff] [blame] | 1139 | // Don't attempt to map a region of length 0. We still need the |
| 1140 | // ftruncate() though, since the API guarantees that we will truncate |
| 1141 | // the file to the end of the uncompressed output. |
| 1142 | if (declared_length == 0) { |
| 1143 | return 0; |
| 1144 | } |
| 1145 | |
Narayan Kamath | 00a258c | 2013-12-13 16:06:19 +0000 | [diff] [blame] | 1146 | android::FileMap* map = MapFileSegment(fd, current_offset, declared_length, |
Narayan Kamath | eaf9885 | 2013-12-11 14:51:51 +0000 | [diff] [blame] | 1147 | false, kTempMappingFileName); |
| 1148 | if (map == NULL) { |
| 1149 | return kMmapFailed; |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 1150 | } |
| 1151 | |
Narayan Kamath | eaf9885 | 2013-12-11 14:51:51 +0000 | [diff] [blame] | 1152 | const int32_t error = ExtractToMemory(handle, entry, |
| 1153 | reinterpret_cast<uint8_t*>(map->getDataPtr()), |
| 1154 | map->getDataLength()); |
| 1155 | map->release(); |
Narayan Kamath | 7462f02 | 2013-11-21 13:05:04 +0000 | [diff] [blame] | 1156 | return error; |
| 1157 | } |
| 1158 | |
| 1159 | const char* ErrorCodeString(int32_t error_code) { |
| 1160 | if (error_code > kErrorMessageLowerBound && error_code < kErrorMessageUpperBound) { |
| 1161 | return kErrorMessages[error_code * -1]; |
| 1162 | } |
| 1163 | |
| 1164 | return kErrorMessages[0]; |
| 1165 | } |
| 1166 | |
| 1167 | int GetFileDescriptor(const ZipArchiveHandle handle) { |
| 1168 | return ((ZipArchive*) handle)->fd; |
| 1169 | } |
| 1170 | |