archive_read_support_format_iso9660.c revision 228753
1/*- 2 * Copyright (c) 2003-2007 Tim Kientzle 3 * Copyright (c) 2009 Andreas Henriksson <andreas@fatal.se> 4 * Copyright (c) 2009-2011 Michihiro NAKAJIMA 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) ``AS IS'' AND ANY EXPRESS OR 17 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 18 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 19 * IN NO EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY DIRECT, INDIRECT, 20 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 21 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 22 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 23 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 24 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 25 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 26 */ 27 28#include "archive_platform.h" 29__FBSDID("$FreeBSD: head/lib/libarchive/archive_read_support_format_iso9660.c 201246 2009-12-30 05:30:35Z kientzle $"); 30 31#ifdef HAVE_ERRNO_H 32#include <errno.h> 33#endif 34/* #include <stdint.h> */ /* See archive_platform.h */ 35#include <stdio.h> 36#ifdef HAVE_STDLIB_H 37#include <stdlib.h> 38#endif 39#ifdef HAVE_STRING_H 40#include <string.h> 41#endif 42#include <time.h> 43#ifdef HAVE_ZLIB_H 44#include <zlib.h> 45#endif 46 47#include "archive.h" 48#include "archive_endian.h" 49#include "archive_entry.h" 50#include "archive_private.h" 51#include "archive_read_private.h" 52#include "archive_string.h" 53 54/* 55 * An overview of ISO 9660 format: 56 * 57 * Each disk is laid out as follows: 58 * * 32k reserved for private use 59 * * Volume descriptor table. Each volume descriptor 60 * is 2k and specifies basic format information. 61 * The "Primary Volume Descriptor" (PVD) is defined by the 62 * standard and should always be present; other volume 63 * descriptors include various vendor-specific extensions. 64 * * Files and directories. Each file/dir is specified by 65 * an "extent" (starting sector and length in bytes). 66 * Dirs are just files with directory records packed one 67 * after another. The PVD contains a single dir entry 68 * specifying the location of the root directory. Everything 69 * else follows from there. 70 * 71 * This module works by first reading the volume descriptors, then 72 * building a list of directory entries, sorted by starting 73 * sector. At each step, I look for the earliest dir entry that 74 * hasn't yet been read, seek forward to that location and read 75 * that entry. If it's a dir, I slurp in the new dir entries and 76 * add them to the heap; if it's a regular file, I return the 77 * corresponding archive_entry and wait for the client to request 78 * the file body. This strategy allows us to read most compliant 79 * CDs with a single pass through the data, as required by libarchive. 80 */ 81#define LOGICAL_BLOCK_SIZE 2048 82#define SYSTEM_AREA_BLOCK 16 83 84/* Structure of on-disk primary volume descriptor. */ 85#define PVD_type_offset 0 86#define PVD_type_size 1 87#define PVD_id_offset (PVD_type_offset + PVD_type_size) 88#define PVD_id_size 5 89#define PVD_version_offset (PVD_id_offset + PVD_id_size) 90#define PVD_version_size 1 91#define PVD_reserved1_offset (PVD_version_offset + PVD_version_size) 92#define PVD_reserved1_size 1 93#define PVD_system_id_offset (PVD_reserved1_offset + PVD_reserved1_size) 94#define PVD_system_id_size 32 95#define PVD_volume_id_offset (PVD_system_id_offset + PVD_system_id_size) 96#define PVD_volume_id_size 32 97#define PVD_reserved2_offset (PVD_volume_id_offset + PVD_volume_id_size) 98#define PVD_reserved2_size 8 99#define PVD_volume_space_size_offset (PVD_reserved2_offset + PVD_reserved2_size) 100#define PVD_volume_space_size_size 8 101#define PVD_reserved3_offset (PVD_volume_space_size_offset + PVD_volume_space_size_size) 102#define PVD_reserved3_size 32 103#define PVD_volume_set_size_offset (PVD_reserved3_offset + PVD_reserved3_size) 104#define PVD_volume_set_size_size 4 105#define PVD_volume_sequence_number_offset (PVD_volume_set_size_offset + PVD_volume_set_size_size) 106#define PVD_volume_sequence_number_size 4 107#define PVD_logical_block_size_offset (PVD_volume_sequence_number_offset + PVD_volume_sequence_number_size) 108#define PVD_logical_block_size_size 4 109#define PVD_path_table_size_offset (PVD_logical_block_size_offset + PVD_logical_block_size_size) 110#define PVD_path_table_size_size 8 111#define PVD_type_1_path_table_offset (PVD_path_table_size_offset + PVD_path_table_size_size) 112#define PVD_type_1_path_table_size 4 113#define PVD_opt_type_1_path_table_offset (PVD_type_1_path_table_offset + PVD_type_1_path_table_size) 114#define PVD_opt_type_1_path_table_size 4 115#define PVD_type_m_path_table_offset (PVD_opt_type_1_path_table_offset + PVD_opt_type_1_path_table_size) 116#define PVD_type_m_path_table_size 4 117#define PVD_opt_type_m_path_table_offset (PVD_type_m_path_table_offset + PVD_type_m_path_table_size) 118#define PVD_opt_type_m_path_table_size 4 119#define PVD_root_directory_record_offset (PVD_opt_type_m_path_table_offset + PVD_opt_type_m_path_table_size) 120#define PVD_root_directory_record_size 34 121#define PVD_volume_set_id_offset (PVD_root_directory_record_offset + PVD_root_directory_record_size) 122#define PVD_volume_set_id_size 128 123#define PVD_publisher_id_offset (PVD_volume_set_id_offset + PVD_volume_set_id_size) 124#define PVD_publisher_id_size 128 125#define PVD_preparer_id_offset (PVD_publisher_id_offset + PVD_publisher_id_size) 126#define PVD_preparer_id_size 128 127#define PVD_application_id_offset (PVD_preparer_id_offset + PVD_preparer_id_size) 128#define PVD_application_id_size 128 129#define PVD_copyright_file_id_offset (PVD_application_id_offset + PVD_application_id_size) 130#define PVD_copyright_file_id_size 37 131#define PVD_abstract_file_id_offset (PVD_copyright_file_id_offset + PVD_copyright_file_id_size) 132#define PVD_abstract_file_id_size 37 133#define PVD_bibliographic_file_id_offset (PVD_abstract_file_id_offset + PVD_abstract_file_id_size) 134#define PVD_bibliographic_file_id_size 37 135#define PVD_creation_date_offset (PVD_bibliographic_file_id_offset + PVD_bibliographic_file_id_size) 136#define PVD_creation_date_size 17 137#define PVD_modification_date_offset (PVD_creation_date_offset + PVD_creation_date_size) 138#define PVD_modification_date_size 17 139#define PVD_expiration_date_offset (PVD_modification_date_offset + PVD_modification_date_size) 140#define PVD_expiration_date_size 17 141#define PVD_effective_date_offset (PVD_expiration_date_offset + PVD_expiration_date_size) 142#define PVD_effective_date_size 17 143#define PVD_file_structure_version_offset (PVD_effective_date_offset + PVD_effective_date_size) 144#define PVD_file_structure_version_size 1 145#define PVD_reserved4_offset (PVD_file_structure_version_offset + PVD_file_structure_version_size) 146#define PVD_reserved4_size 1 147#define PVD_application_data_offset (PVD_reserved4_offset + PVD_reserved4_size) 148#define PVD_application_data_size 512 149#define PVD_reserved5_offset (PVD_application_data_offset + PVD_application_data_size) 150#define PVD_reserved5_size (2048 - PVD_reserved5_offset) 151 152/* TODO: It would make future maintenance easier to just hardcode the 153 * above values. In particular, ECMA119 states the offsets as part of 154 * the standard. That would eliminate the need for the following check.*/ 155#if PVD_reserved5_offset != 1395 156#error PVD offset and size definitions are wrong. 157#endif 158 159 160/* Structure of optional on-disk supplementary volume descriptor. */ 161#define SVD_type_offset 0 162#define SVD_type_size 1 163#define SVD_id_offset (SVD_type_offset + SVD_type_size) 164#define SVD_id_size 5 165#define SVD_version_offset (SVD_id_offset + SVD_id_size) 166#define SVD_version_size 1 167/* ... */ 168#define SVD_reserved1_offset 72 169#define SVD_reserved1_size 8 170#define SVD_volume_space_size_offset 80 171#define SVD_volume_space_size_size 8 172#define SVD_escape_sequences_offset (SVD_volume_space_size_offset + SVD_volume_space_size_size) 173#define SVD_escape_sequences_size 32 174/* ... */ 175#define SVD_logical_block_size_offset 128 176#define SVD_logical_block_size_size 4 177#define SVD_type_L_path_table_offset 140 178#define SVD_type_M_path_table_offset 148 179/* ... */ 180#define SVD_root_directory_record_offset 156 181#define SVD_root_directory_record_size 34 182#define SVD_file_structure_version_offset 881 183#define SVD_reserved2_offset 882 184#define SVD_reserved2_size 1 185#define SVD_reserved3_offset 1395 186#define SVD_reserved3_size 653 187/* ... */ 188/* FIXME: validate correctness of last SVD entry offset. */ 189 190/* Structure of an on-disk directory record. */ 191/* Note: ISO9660 stores each multi-byte integer twice, once in 192 * each byte order. The sizes here are the size of just one 193 * of the two integers. (This is why the offset of a field isn't 194 * the same as the offset+size of the previous field.) */ 195#define DR_length_offset 0 196#define DR_length_size 1 197#define DR_ext_attr_length_offset 1 198#define DR_ext_attr_length_size 1 199#define DR_extent_offset 2 200#define DR_extent_size 4 201#define DR_size_offset 10 202#define DR_size_size 4 203#define DR_date_offset 18 204#define DR_date_size 7 205#define DR_flags_offset 25 206#define DR_flags_size 1 207#define DR_file_unit_size_offset 26 208#define DR_file_unit_size_size 1 209#define DR_interleave_offset 27 210#define DR_interleave_size 1 211#define DR_volume_sequence_number_offset 28 212#define DR_volume_sequence_number_size 2 213#define DR_name_len_offset 32 214#define DR_name_len_size 1 215#define DR_name_offset 33 216 217#ifdef HAVE_ZLIB_H 218static const unsigned char zisofs_magic[8] = { 219 0x37, 0xE4, 0x53, 0x96, 0xC9, 0xDB, 0xD6, 0x07 220}; 221 222struct zisofs { 223 /* Set 1 if this file compressed by paged zlib */ 224 int pz; 225 int pz_log2_bs; /* Log2 of block size */ 226 uint64_t pz_uncompressed_size; 227 228 int initialized; 229 unsigned char *uncompressed_buffer; 230 size_t uncompressed_buffer_size; 231 232 uint32_t pz_offset; 233 unsigned char header[16]; 234 size_t header_avail; 235 int header_passed; 236 unsigned char *block_pointers; 237 size_t block_pointers_alloc; 238 size_t block_pointers_size; 239 size_t block_pointers_avail; 240 size_t block_off; 241 uint32_t block_avail; 242 243 z_stream stream; 244 int stream_valid; 245}; 246#else 247struct zisofs { 248 /* Set 1 if this file compressed by paged zlib */ 249 int pz; 250}; 251#endif 252 253struct content { 254 uint64_t offset;/* Offset on disk. */ 255 uint64_t size; /* File size in bytes. */ 256 struct content *next; 257}; 258 259/* In-memory storage for a directory record. */ 260struct file_info { 261 struct file_info *use_next; 262 struct file_info *parent; 263 struct file_info *next; 264 struct file_info *re_next; 265 int subdirs; 266 uint64_t key; /* Heap Key. */ 267 uint64_t offset; /* Offset on disk. */ 268 uint64_t size; /* File size in bytes. */ 269 uint32_t ce_offset; /* Offset of CE. */ 270 uint32_t ce_size; /* Size of CE. */ 271 char rr_moved; /* Flag to rr_moved. */ 272 char rr_moved_has_re_only; 273 char re; /* Having RRIP "RE" extension. */ 274 char re_descendant; 275 uint64_t cl_offset; /* Having RRIP "CL" extension. */ 276 int birthtime_is_set; 277 time_t birthtime; /* File created time. */ 278 time_t mtime; /* File last modified time. */ 279 time_t atime; /* File last accessed time. */ 280 time_t ctime; /* File attribute change time. */ 281 uint64_t rdev; /* Device number. */ 282 mode_t mode; 283 uid_t uid; 284 gid_t gid; 285 int64_t number; 286 int nlinks; 287 struct archive_string name; /* Pathname */ 288 char name_continues; /* Non-zero if name continues */ 289 struct archive_string symlink; 290 char symlink_continues; /* Non-zero if link continues */ 291 /* Set 1 if this file compressed by paged zlib(zisofs) */ 292 int pz; 293 int pz_log2_bs; /* Log2 of block size */ 294 uint64_t pz_uncompressed_size; 295 /* Set 1 if this file is multi extent. */ 296 int multi_extent; 297 struct { 298 struct content *first; 299 struct content **last; 300 } contents; 301 struct { 302 struct file_info *first; 303 struct file_info **last; 304 } rede_files; 305 /* To check a ininity loop. */ 306 struct file_info *loop_by; 307}; 308 309struct heap_queue { 310 struct file_info **files; 311 int allocated; 312 int used; 313}; 314 315struct iso9660 { 316 int magic; 317#define ISO9660_MAGIC 0x96609660 318 319 int opt_support_joliet; 320 int opt_support_rockridge; 321 322 struct archive_string pathname; 323 char seenRockridge; /* Set true if RR extensions are used. */ 324 char seenSUSP; /* Set true if SUSP is beging used. */ 325 char seenJoliet; 326 327 unsigned char suspOffset; 328 struct file_info *rr_moved; 329 struct read_ce_queue { 330 struct read_ce_req { 331 uint64_t offset;/* Offset of CE on disk. */ 332 struct file_info *file; 333 } *reqs; 334 int cnt; 335 int allocated; 336 } read_ce_req; 337 338 int64_t previous_number; 339 struct archive_string previous_pathname; 340 341 struct file_info *use_files; 342 struct heap_queue pending_files; 343 struct { 344 struct file_info *first; 345 struct file_info **last; 346 } cache_files; 347 struct { 348 struct file_info *first; 349 struct file_info **last; 350 } re_files; 351 352 uint64_t current_position; 353 ssize_t logical_block_size; 354 uint64_t volume_size; /* Total size of volume in bytes. */ 355 int32_t volume_block;/* Total size of volume in logical blocks. */ 356 357 struct vd { 358 int location; /* Location of Extent. */ 359 uint32_t size; 360 } primary, joliet; 361 362 off_t entry_sparse_offset; 363 int64_t entry_bytes_remaining; 364 struct zisofs entry_zisofs; 365 struct content *entry_content; 366}; 367 368static int archive_read_format_iso9660_bid(struct archive_read *); 369static int archive_read_format_iso9660_options(struct archive_read *, 370 const char *, const char *); 371static int archive_read_format_iso9660_cleanup(struct archive_read *); 372static int archive_read_format_iso9660_read_data(struct archive_read *, 373 const void **, size_t *, off_t *); 374static int archive_read_format_iso9660_read_data_skip(struct archive_read *); 375static int archive_read_format_iso9660_read_header(struct archive_read *, 376 struct archive_entry *); 377static const char *build_pathname(struct archive_string *, struct file_info *); 378#if DEBUG 379static void dump_isodirrec(FILE *, const unsigned char *isodirrec); 380#endif 381static time_t time_from_tm(struct tm *); 382static time_t isodate17(const unsigned char *); 383static time_t isodate7(const unsigned char *); 384static int isBootRecord(struct iso9660 *, const unsigned char *); 385static int isVolumePartition(struct iso9660 *, const unsigned char *); 386static int isVDSetTerminator(struct iso9660 *, const unsigned char *); 387static int isJolietSVD(struct iso9660 *, const unsigned char *); 388static int isSVD(struct iso9660 *, const unsigned char *); 389static int isEVD(struct iso9660 *, const unsigned char *); 390static int isPVD(struct iso9660 *, const unsigned char *); 391static int next_cache_entry(struct archive_read *, struct iso9660 *, 392 struct file_info **); 393static int next_entry_seek(struct archive_read *a, struct iso9660 *iso9660, 394 struct file_info **pfile); 395static struct file_info * 396 parse_file_info(struct archive_read *a, 397 struct file_info *parent, const unsigned char *isodirrec); 398static int parse_rockridge(struct archive_read *a, 399 struct file_info *file, const unsigned char *start, 400 const unsigned char *end); 401static int register_CE(struct archive_read *a, int32_t location, 402 struct file_info *file); 403static int read_CE(struct archive_read *a, struct iso9660 *iso9660); 404static void parse_rockridge_NM1(struct file_info *, 405 const unsigned char *, int); 406static void parse_rockridge_SL1(struct file_info *, 407 const unsigned char *, int); 408static void parse_rockridge_TF1(struct file_info *, 409 const unsigned char *, int); 410static void parse_rockridge_ZF1(struct file_info *, 411 const unsigned char *, int); 412static void register_file(struct iso9660 *, struct file_info *); 413static void release_files(struct iso9660 *); 414static unsigned toi(const void *p, int n); 415static inline void re_add_entry(struct iso9660 *, struct file_info *); 416static inline struct file_info * re_get_entry(struct iso9660 *); 417static inline int rede_add_entry(struct file_info *); 418static inline struct file_info * rede_get_entry(struct file_info *); 419static inline void cache_add_entry(struct iso9660 *iso9660, 420 struct file_info *file); 421static inline struct file_info *cache_get_entry(struct iso9660 *iso9660); 422static void heap_add_entry(struct heap_queue *heap, 423 struct file_info *file, uint64_t key); 424static struct file_info *heap_get_entry(struct heap_queue *heap); 425 426#define add_entry(iso9660, file) \ 427 heap_add_entry(&((iso9660)->pending_files), file, file->offset) 428#define next_entry(iso9660) \ 429 heap_get_entry(&((iso9660)->pending_files)) 430 431int 432archive_read_support_format_iso9660(struct archive *_a) 433{ 434 struct archive_read *a = (struct archive_read *)_a; 435 struct iso9660 *iso9660; 436 int r; 437 438 iso9660 = (struct iso9660 *)malloc(sizeof(*iso9660)); 439 if (iso9660 == NULL) { 440 archive_set_error(&a->archive, ENOMEM, "Can't allocate iso9660 data"); 441 return (ARCHIVE_FATAL); 442 } 443 memset(iso9660, 0, sizeof(*iso9660)); 444 iso9660->magic = ISO9660_MAGIC; 445 iso9660->cache_files.first = NULL; 446 iso9660->cache_files.last = &(iso9660->cache_files.first); 447 iso9660->re_files.first = NULL; 448 iso9660->re_files.last = &(iso9660->re_files.first); 449 /* Enable to support Joliet extensions by default. */ 450 iso9660->opt_support_joliet = 1; 451 /* Enable to support Rock Ridge extensions by default. */ 452 iso9660->opt_support_rockridge = 1; 453 454 r = __archive_read_register_format(a, 455 iso9660, 456 "iso9660", 457 archive_read_format_iso9660_bid, 458 archive_read_format_iso9660_options, 459 archive_read_format_iso9660_read_header, 460 archive_read_format_iso9660_read_data, 461 archive_read_format_iso9660_read_data_skip, 462 archive_read_format_iso9660_cleanup); 463 464 if (r != ARCHIVE_OK) { 465 free(iso9660); 466 return (r); 467 } 468 return (ARCHIVE_OK); 469} 470 471 472static int 473archive_read_format_iso9660_bid(struct archive_read *a) 474{ 475 struct iso9660 *iso9660; 476 ssize_t bytes_read; 477 const void *h; 478 const unsigned char *p; 479 int seenTerminator; 480 481 iso9660 = (struct iso9660 *)(a->format->data); 482 483 /* 484 * Skip the first 32k (reserved area) and get the first 485 * 8 sectors of the volume descriptor table. Of course, 486 * if the I/O layer gives us more, we'll take it. 487 */ 488#define RESERVED_AREA (SYSTEM_AREA_BLOCK * LOGICAL_BLOCK_SIZE) 489 h = __archive_read_ahead(a, 490 RESERVED_AREA + 8 * LOGICAL_BLOCK_SIZE, 491 &bytes_read); 492 if (h == NULL) 493 return (-1); 494 p = (const unsigned char *)h; 495 496 /* Skip the reserved area. */ 497 bytes_read -= RESERVED_AREA; 498 p += RESERVED_AREA; 499 500 /* Check each volume descriptor. */ 501 seenTerminator = 0; 502 for (; bytes_read > LOGICAL_BLOCK_SIZE; 503 bytes_read -= LOGICAL_BLOCK_SIZE, p += LOGICAL_BLOCK_SIZE) { 504 /* Do not handle undefined Volume Descriptor Type. */ 505 if (p[0] >= 4 && p[0] <= 254) 506 return (0); 507 /* Standard Identifier must be "CD001" */ 508 if (memcmp(p + 1, "CD001", 5) != 0) 509 return (0); 510 if (!iso9660->primary.location) { 511 if (isPVD(iso9660, p)) 512 continue; 513 } 514 if (!iso9660->joliet.location) { 515 if (isJolietSVD(iso9660, p)) 516 continue; 517 } 518 if (isBootRecord(iso9660, p)) 519 continue; 520 if (isEVD(iso9660, p)) 521 continue; 522 if (isSVD(iso9660, p)) 523 continue; 524 if (isVolumePartition(iso9660, p)) 525 continue; 526 if (isVDSetTerminator(iso9660, p)) { 527 seenTerminator = 1; 528 break; 529 } 530 return (0); 531 } 532 /* 533 * ISO 9660 format must have Primary Volume Descriptor and 534 * Volume Descriptor Set Terminator. 535 */ 536 if (seenTerminator && iso9660->primary.location > 16) 537 return (48); 538 539 /* We didn't find a valid PVD; return a bid of zero. */ 540 return (0); 541} 542 543static int 544archive_read_format_iso9660_options(struct archive_read *a, 545 const char *key, const char *val) 546{ 547 struct iso9660 *iso9660; 548 549 iso9660 = (struct iso9660 *)(a->format->data); 550 551 if (strcmp(key, "joliet") == 0) { 552 if (val == NULL || strcmp(val, "off") == 0 || 553 strcmp(val, "ignore") == 0 || 554 strcmp(val, "disable") == 0 || 555 strcmp(val, "0") == 0) 556 iso9660->opt_support_joliet = 0; 557 else 558 iso9660->opt_support_joliet = 1; 559 return (ARCHIVE_OK); 560 } 561 if (strcmp(key, "rockridge") == 0 || 562 strcmp(key, "Rockridge") == 0) { 563 iso9660->opt_support_rockridge = val != NULL; 564 return (ARCHIVE_OK); 565 } 566 567 /* Note: The "warn" return is just to inform the options 568 * supervisor that we didn't handle it. It will generate 569 * a suitable error if noone used this option. */ 570 return (ARCHIVE_WARN); 571} 572 573static int 574isBootRecord(struct iso9660 *iso9660, const unsigned char *h) 575{ 576 (void)iso9660; /* UNUSED */ 577 578 /* Type of the Volume Descriptor Boot Record must be 0. */ 579 if (h[0] != 0) 580 return (0); 581 582 /* Volume Descriptor Version must be 1. */ 583 if (h[6] != 1) 584 return (0); 585 586 return (1); 587} 588 589static int 590isVolumePartition(struct iso9660 *iso9660, const unsigned char *h) 591{ 592 int32_t location; 593 594 /* Type of the Volume Partition Descriptor must be 3. */ 595 if (h[0] != 3) 596 return (0); 597 598 /* Volume Descriptor Version must be 1. */ 599 if (h[6] != 1) 600 return (0); 601 /* Unused Field */ 602 if (h[7] != 0) 603 return (0); 604 605 location = archive_le32dec(h + 72); 606 if (location <= SYSTEM_AREA_BLOCK || 607 location >= iso9660->volume_block) 608 return (0); 609 if ((uint32_t)location != archive_be32dec(h + 76)) 610 return (0); 611 612 return (1); 613} 614 615static int 616isVDSetTerminator(struct iso9660 *iso9660, const unsigned char *h) 617{ 618 int i; 619 620 (void)iso9660; /* UNUSED */ 621 622 /* Type of the Volume Descriptor Set Terminator must be 255. */ 623 if (h[0] != 255) 624 return (0); 625 626 /* Volume Descriptor Version must be 1. */ 627 if (h[6] != 1) 628 return (0); 629 630 /* Reserved field must be 0. */ 631 for (i = 7; i < 2048; ++i) 632 if (h[i] != 0) 633 return (0); 634 635 return (1); 636} 637 638static int 639isJolietSVD(struct iso9660 *iso9660, const unsigned char *h) 640{ 641 const unsigned char *p; 642 ssize_t logical_block_size; 643 int32_t volume_block; 644 645 /* Check if current sector is a kind of Supplementary Volume 646 * Descriptor. */ 647 if (!isSVD(iso9660, h)) 648 return (0); 649 650 /* FIXME: do more validations according to joliet spec. */ 651 652 /* check if this SVD contains joliet extension! */ 653 p = h + SVD_escape_sequences_offset; 654 /* N.B. Joliet spec says p[1] == '\\', but.... */ 655 if (p[0] == '%' && p[1] == '/') { 656 int level = 0; 657 658 if (p[2] == '@') 659 level = 1; 660 else if (p[2] == 'C') 661 level = 2; 662 else if (p[2] == 'E') 663 level = 3; 664 else /* not joliet */ 665 return (0); 666 667 iso9660->seenJoliet = level; 668 669 } else /* not joliet */ 670 return (0); 671 672 logical_block_size = 673 archive_le16dec(h + SVD_logical_block_size_offset); 674 volume_block = archive_le32dec(h + SVD_volume_space_size_offset); 675 676 iso9660->logical_block_size = logical_block_size; 677 iso9660->volume_block = volume_block; 678 iso9660->volume_size = logical_block_size * (uint64_t)volume_block; 679 /* Read Root Directory Record in Volume Descriptor. */ 680 p = h + SVD_root_directory_record_offset; 681 iso9660->joliet.location = archive_le32dec(p + DR_extent_offset); 682 iso9660->joliet.size = archive_le32dec(p + DR_size_offset); 683 684 return (48); 685} 686 687static int 688isSVD(struct iso9660 *iso9660, const unsigned char *h) 689{ 690 const unsigned char *p; 691 ssize_t logical_block_size; 692 int32_t volume_block; 693 int32_t location; 694 int i; 695 696 (void)iso9660; /* UNUSED */ 697 698 /* Type 2 means it's a SVD. */ 699 if (h[SVD_type_offset] != 2) 700 return (0); 701 702 /* Reserved field must be 0. */ 703 for (i = 0; i < SVD_reserved1_size; ++i) 704 if (h[SVD_reserved1_offset + i] != 0) 705 return (0); 706 for (i = 0; i < SVD_reserved2_size; ++i) 707 if (h[SVD_reserved2_offset + i] != 0) 708 return (0); 709 for (i = 0; i < SVD_reserved3_size; ++i) 710 if (h[SVD_reserved3_offset + i] != 0) 711 return (0); 712 713 /* File structure version must be 1 for ISO9660/ECMA119. */ 714 if (h[SVD_file_structure_version_offset] != 1) 715 return (0); 716 717 logical_block_size = 718 archive_le16dec(h + SVD_logical_block_size_offset); 719 if (logical_block_size <= 0) 720 return (0); 721 722 volume_block = archive_le32dec(h + SVD_volume_space_size_offset); 723 if (volume_block <= SYSTEM_AREA_BLOCK+4) 724 return (0); 725 726 /* Location of Occurrence of Type L Path Table must be 727 * available location, 728 * >= SYSTEM_AREA_BLOCK(16) + 2 and < Volume Space Size. */ 729 location = archive_le32dec(h+SVD_type_L_path_table_offset); 730 if (location < SYSTEM_AREA_BLOCK+2 || location >= volume_block) 731 return (0); 732 733 /* The Type M Path Table must be at a valid location (WinISO 734 * and probably other programs omit this, so we allow zero) 735 * 736 * >= SYSTEM_AREA_BLOCK(16) + 2 and < Volume Space Size. */ 737 location = archive_be32dec(h+SVD_type_M_path_table_offset); 738 if ((location > 0 && location < SYSTEM_AREA_BLOCK+2) 739 || location >= volume_block) 740 return (0); 741 742 /* Read Root Directory Record in Volume Descriptor. */ 743 p = h + SVD_root_directory_record_offset; 744 if (p[DR_length_offset] != 34) 745 return (0); 746 747 return (48); 748} 749 750static int 751isEVD(struct iso9660 *iso9660, const unsigned char *h) 752{ 753 const unsigned char *p; 754 ssize_t logical_block_size; 755 int32_t volume_block; 756 int32_t location; 757 int i; 758 759 (void)iso9660; /* UNUSED */ 760 761 /* Type of the Enhanced Volume Descriptor must be 2. */ 762 if (h[PVD_type_offset] != 2) 763 return (0); 764 765 /* EVD version must be 2. */ 766 if (h[PVD_version_offset] != 2) 767 return (0); 768 769 /* Reserved field must be 0. */ 770 if (h[PVD_reserved1_offset] != 0) 771 return (0); 772 773 /* Reserved field must be 0. */ 774 for (i = 0; i < PVD_reserved2_size; ++i) 775 if (h[PVD_reserved2_offset + i] != 0) 776 return (0); 777 778 /* Reserved field must be 0. */ 779 for (i = 0; i < PVD_reserved3_size; ++i) 780 if (h[PVD_reserved3_offset + i] != 0) 781 return (0); 782 783 /* Logical block size must be > 0. */ 784 /* I've looked at Ecma 119 and can't find any stronger 785 * restriction on this field. */ 786 logical_block_size = 787 archive_le16dec(h + PVD_logical_block_size_offset); 788 if (logical_block_size <= 0) 789 return (0); 790 791 volume_block = 792 archive_le32dec(h + PVD_volume_space_size_offset); 793 if (volume_block <= SYSTEM_AREA_BLOCK+4) 794 return (0); 795 796 /* File structure version must be 2 for ISO9660:1999. */ 797 if (h[PVD_file_structure_version_offset] != 2) 798 return (0); 799 800 /* Location of Occurrence of Type L Path Table must be 801 * available location, 802 * >= SYSTEM_AREA_BLOCK(16) + 2 and < Volume Space Size. */ 803 location = archive_le32dec(h+PVD_type_1_path_table_offset); 804 if (location < SYSTEM_AREA_BLOCK+2 || location >= volume_block) 805 return (0); 806 807 /* Location of Occurrence of Type M Path Table must be 808 * available location, 809 * >= SYSTEM_AREA_BLOCK(16) + 2 and < Volume Space Size. */ 810 location = archive_be32dec(h+PVD_type_m_path_table_offset); 811 if ((location > 0 && location < SYSTEM_AREA_BLOCK+2) 812 || location >= volume_block) 813 return (0); 814 815 /* Reserved field must be 0. */ 816 for (i = 0; i < PVD_reserved4_size; ++i) 817 if (h[PVD_reserved4_offset + i] != 0) 818 return (0); 819 820 /* Reserved field must be 0. */ 821 for (i = 0; i < PVD_reserved5_size; ++i) 822 if (h[PVD_reserved5_offset + i] != 0) 823 return (0); 824 825 /* Read Root Directory Record in Volume Descriptor. */ 826 p = h + PVD_root_directory_record_offset; 827 if (p[DR_length_offset] != 34) 828 return (0); 829 830 return (48); 831} 832 833static int 834isPVD(struct iso9660 *iso9660, const unsigned char *h) 835{ 836 const unsigned char *p; 837 ssize_t logical_block_size; 838 int32_t volume_block; 839 int32_t location; 840 int i; 841 842 /* Type of the Primary Volume Descriptor must be 1. */ 843 if (h[PVD_type_offset] != 1) 844 return (0); 845 846 /* PVD version must be 1. */ 847 if (h[PVD_version_offset] != 1) 848 return (0); 849 850 /* Reserved field must be 0. */ 851 if (h[PVD_reserved1_offset] != 0) 852 return (0); 853 854 /* Reserved field must be 0. */ 855 for (i = 0; i < PVD_reserved2_size; ++i) 856 if (h[PVD_reserved2_offset + i] != 0) 857 return (0); 858 859 /* Reserved field must be 0. */ 860 for (i = 0; i < PVD_reserved3_size; ++i) 861 if (h[PVD_reserved3_offset + i] != 0) 862 return (0); 863 864 /* Logical block size must be > 0. */ 865 /* I've looked at Ecma 119 and can't find any stronger 866 * restriction on this field. */ 867 logical_block_size = 868 archive_le16dec(h + PVD_logical_block_size_offset); 869 if (logical_block_size <= 0) 870 return (0); 871 872 volume_block = archive_le32dec(h + PVD_volume_space_size_offset); 873 if (volume_block <= SYSTEM_AREA_BLOCK+4) 874 return (0); 875 876 /* File structure version must be 1 for ISO9660/ECMA119. */ 877 if (h[PVD_file_structure_version_offset] != 1) 878 return (0); 879 880 /* Location of Occurrence of Type L Path Table must be 881 * available location, 882 * > SYSTEM_AREA_BLOCK(16) + 2 and < Volume Space Size. */ 883 location = archive_le32dec(h+PVD_type_1_path_table_offset); 884 if (location < SYSTEM_AREA_BLOCK+2 || location >= volume_block) 885 return (0); 886 887 /* The Type M Path Table must also be at a valid location 888 * (although ECMA 119 requires a Type M Path Table, WinISO and 889 * probably other programs omit it, so we permit a zero here) 890 * 891 * >= SYSTEM_AREA_BLOCK(16) + 2 and < Volume Space Size. */ 892 location = archive_be32dec(h+PVD_type_m_path_table_offset); 893 if ((location > 0 && location < SYSTEM_AREA_BLOCK+2) 894 || location >= volume_block) 895 return (0); 896 897 /* Reserved field must be 0. */ 898 for (i = 0; i < PVD_reserved4_size; ++i) 899 if (h[PVD_reserved4_offset + i] != 0) 900 return (0); 901 902 /* Reserved field must be 0. */ 903 for (i = 0; i < PVD_reserved5_size; ++i) 904 if (h[PVD_reserved5_offset + i] != 0) 905 return (0); 906 907 /* XXX TODO: Check other values for sanity; reject more 908 * malformed PVDs. XXX */ 909 910 /* Read Root Directory Record in Volume Descriptor. */ 911 p = h + PVD_root_directory_record_offset; 912 if (p[DR_length_offset] != 34) 913 return (0); 914 915 iso9660->logical_block_size = logical_block_size; 916 iso9660->volume_block = volume_block; 917 iso9660->volume_size = logical_block_size * (uint64_t)volume_block; 918 iso9660->primary.location = archive_le32dec(p + DR_extent_offset); 919 iso9660->primary.size = archive_le32dec(p + DR_size_offset); 920 921 return (48); 922} 923 924static int 925read_children(struct archive_read *a, struct file_info *parent) 926{ 927 struct iso9660 *iso9660; 928 const unsigned char *b, *p; 929 struct file_info *multi; 930 size_t step; 931 932 iso9660 = (struct iso9660 *)(a->format->data); 933 if (iso9660->current_position > parent->offset) { 934 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 935 "Ignoring out-of-order directory (%s) %jd > %jd", 936 parent->name.s, 937 (intmax_t)iso9660->current_position, 938 (intmax_t)parent->offset); 939 return (ARCHIVE_WARN); 940 } 941 if (parent->offset + parent->size > iso9660->volume_size) { 942 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 943 "Directory is beyond end-of-media: %s", 944 parent->name.s); 945 return (ARCHIVE_WARN); 946 } 947 if (iso9660->current_position < parent->offset) { 948 int64_t skipsize; 949 950 skipsize = parent->offset - iso9660->current_position; 951 skipsize = __archive_read_skip(a, skipsize); 952 if (skipsize < 0) 953 return ((int)skipsize); 954 iso9660->current_position = parent->offset; 955 } 956 957 step = ((parent->size + iso9660->logical_block_size -1) / 958 iso9660->logical_block_size) * iso9660->logical_block_size; 959 b = __archive_read_ahead(a, step, NULL); 960 if (b == NULL) { 961 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 962 "Failed to read full block when scanning " 963 "ISO9660 directory list"); 964 return (ARCHIVE_FATAL); 965 } 966 __archive_read_consume(a, step); 967 iso9660->current_position += step; 968 multi = NULL; 969 while (step) { 970 p = b; 971 b += iso9660->logical_block_size; 972 step -= iso9660->logical_block_size; 973 for (; *p != 0 && p < b && p + *p <= b; p += *p) { 974 struct file_info *child; 975 976 /* N.B.: these special directory identifiers 977 * are 8 bit "values" even on a 978 * Joliet CD with UCS-2 (16bit) encoding. 979 */ 980 981 /* Skip '.' entry. */ 982 if (*(p + DR_name_len_offset) == 1 983 && *(p + DR_name_offset) == '\0') 984 continue; 985 /* Skip '..' entry. */ 986 if (*(p + DR_name_len_offset) == 1 987 && *(p + DR_name_offset) == '\001') 988 continue; 989 child = parse_file_info(a, parent, p); 990 if (child == NULL) 991 return (ARCHIVE_FATAL); 992 if (child->cl_offset == 0 && 993 (child->multi_extent || multi != NULL)) { 994 struct content *con; 995 996 if (multi == NULL) { 997 multi = child; 998 multi->contents.first = NULL; 999 multi->contents.last = 1000 &(multi->contents.first); 1001 } 1002 con = malloc(sizeof(struct content)); 1003 if (con == NULL) { 1004 archive_set_error( 1005 &a->archive, ENOMEM, 1006 "No memory for " 1007 "multi extent"); 1008 return (ARCHIVE_FATAL); 1009 } 1010 con->offset = child->offset; 1011 con->size = child->size; 1012 con->next = NULL; 1013 *multi->contents.last = con; 1014 multi->contents.last = &(con->next); 1015 if (multi == child) 1016 add_entry(iso9660, child); 1017 else { 1018 multi->size += child->size; 1019 if (!child->multi_extent) 1020 multi = NULL; 1021 } 1022 } else 1023 add_entry(iso9660, child); 1024 } 1025 } 1026 1027 /* Read data which recorded by RRIP "CE" extension. */ 1028 if (read_CE(a, iso9660) != ARCHIVE_OK) 1029 return (ARCHIVE_FATAL); 1030 1031 return (ARCHIVE_OK); 1032} 1033 1034static int 1035archive_read_format_iso9660_read_header(struct archive_read *a, 1036 struct archive_entry *entry) 1037{ 1038 struct iso9660 *iso9660; 1039 struct file_info *file; 1040 int r, rd_r = ARCHIVE_OK; 1041 1042 iso9660 = (struct iso9660 *)(a->format->data); 1043 1044 if (!a->archive.archive_format) { 1045 a->archive.archive_format = ARCHIVE_FORMAT_ISO9660; 1046 a->archive.archive_format_name = "ISO9660"; 1047 } 1048 1049 if (iso9660->current_position == 0) { 1050 int64_t skipsize; 1051 struct vd *vd; 1052 const void *block; 1053 char seenJoliet; 1054 1055 vd = &(iso9660->primary); 1056 if (!iso9660->opt_support_joliet) 1057 iso9660->seenJoliet = 0; 1058 if (iso9660->seenJoliet && 1059 vd->location > iso9660->joliet.location) 1060 /* This condition is unlikely; by way of caution. */ 1061 vd = &(iso9660->joliet); 1062 1063 skipsize = LOGICAL_BLOCK_SIZE * vd->location; 1064 skipsize = __archive_read_skip(a, skipsize); 1065 if (skipsize < 0) 1066 return ((int)skipsize); 1067 iso9660->current_position = skipsize; 1068 1069 block = __archive_read_ahead(a, vd->size, NULL); 1070 if (block == NULL) { 1071 archive_set_error(&a->archive, 1072 ARCHIVE_ERRNO_MISC, 1073 "Failed to read full block when scanning " 1074 "ISO9660 directory list"); 1075 return (ARCHIVE_FATAL); 1076 } 1077 1078 /* 1079 * While reading Root Directory, flag seenJoliet 1080 * must be zero to avoid converting special name 1081 * 0x00(Current Directory) and next byte to UCS2. 1082 */ 1083 seenJoliet = iso9660->seenJoliet;/* Save flag. */ 1084 iso9660->seenJoliet = 0; 1085 file = parse_file_info(a, NULL, block); 1086 if (file == NULL) 1087 return (ARCHIVE_FATAL); 1088 iso9660->seenJoliet = seenJoliet; 1089 if (vd == &(iso9660->primary) && iso9660->seenRockridge 1090 && iso9660->seenJoliet) 1091 /* 1092 * If iso image has RockRidge and Joliet, 1093 * we use RockRidge Extensions. 1094 */ 1095 iso9660->seenJoliet = 0; 1096 if (vd == &(iso9660->primary) && !iso9660->seenRockridge 1097 && iso9660->seenJoliet) { 1098 /* Switch reading data from primary to joliet. */ 1099 vd = &(iso9660->joliet); 1100 skipsize = LOGICAL_BLOCK_SIZE * vd->location; 1101 skipsize -= iso9660->current_position; 1102 skipsize = __archive_read_skip(a, skipsize); 1103 if (skipsize < 0) 1104 return ((int)skipsize); 1105 iso9660->current_position += skipsize; 1106 1107 block = __archive_read_ahead(a, vd->size, NULL); 1108 if (block == NULL) { 1109 archive_set_error(&a->archive, 1110 ARCHIVE_ERRNO_MISC, 1111 "Failed to read full block when scanning " 1112 "ISO9660 directory list"); 1113 return (ARCHIVE_FATAL); 1114 } 1115 seenJoliet = iso9660->seenJoliet;/* Save flag. */ 1116 iso9660->seenJoliet = 0; 1117 file = parse_file_info(a, NULL, block); 1118 if (file == NULL) 1119 return (ARCHIVE_FATAL); 1120 iso9660->seenJoliet = seenJoliet; 1121 } 1122 /* Store the root directory in the pending list. */ 1123 add_entry(iso9660, file); 1124 if (iso9660->seenRockridge) { 1125 a->archive.archive_format = 1126 ARCHIVE_FORMAT_ISO9660_ROCKRIDGE; 1127 a->archive.archive_format_name = 1128 "ISO9660 with Rockridge extensions"; 1129 } 1130 } 1131 1132 /* Get the next entry that appears after the current offset. */ 1133 r = next_entry_seek(a, iso9660, &file); 1134 if (r != ARCHIVE_OK) 1135 return (r); 1136 1137 iso9660->entry_bytes_remaining = file->size; 1138 iso9660->entry_sparse_offset = 0; /* Offset for sparse-file-aware clients. */ 1139 1140 if (file->offset + file->size > iso9660->volume_size) { 1141 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 1142 "File is beyond end-of-media: %s", file->name.s); 1143 iso9660->entry_bytes_remaining = 0; 1144 iso9660->entry_sparse_offset = 0; 1145 return (ARCHIVE_WARN); 1146 } 1147 1148 /* Set up the entry structure with information about this entry. */ 1149 archive_entry_set_mode(entry, file->mode); 1150 archive_entry_set_uid(entry, file->uid); 1151 archive_entry_set_gid(entry, file->gid); 1152 archive_entry_set_nlink(entry, file->nlinks); 1153 if (file->birthtime_is_set) 1154 archive_entry_set_birthtime(entry, file->birthtime, 0); 1155 else 1156 archive_entry_unset_birthtime(entry); 1157 archive_entry_set_mtime(entry, file->mtime, 0); 1158 archive_entry_set_ctime(entry, file->ctime, 0); 1159 archive_entry_set_atime(entry, file->atime, 0); 1160 /* N.B.: Rock Ridge supports 64-bit device numbers. */ 1161 archive_entry_set_rdev(entry, (dev_t)file->rdev); 1162 archive_entry_set_size(entry, iso9660->entry_bytes_remaining); 1163 archive_string_empty(&iso9660->pathname); 1164 archive_entry_set_pathname(entry, 1165 build_pathname(&iso9660->pathname, file)); 1166 if (file->symlink.s != NULL) 1167 archive_entry_copy_symlink(entry, file->symlink.s); 1168 1169 /* Note: If the input isn't seekable, we can't rewind to 1170 * return the same body again, so if the next entry refers to 1171 * the same data, we have to return it as a hardlink to the 1172 * original entry. */ 1173 if (file->number != -1 && 1174 file->number == iso9660->previous_number) { 1175 archive_entry_set_hardlink(entry, 1176 iso9660->previous_pathname.s); 1177 archive_entry_unset_size(entry); 1178 iso9660->entry_bytes_remaining = 0; 1179 iso9660->entry_sparse_offset = 0; 1180 return (ARCHIVE_OK); 1181 } 1182 1183 /* Except for the hardlink case above, if the offset of the 1184 * next entry is before our current position, we can't seek 1185 * backwards to extract it, so issue a warning. Note that 1186 * this can only happen if this entry was added to the heap 1187 * after we passed this offset, that is, only if the directory 1188 * mentioning this entry is later than the body of the entry. 1189 * Such layouts are very unusual; most ISO9660 writers lay out 1190 * and record all directory information first, then store 1191 * all file bodies. */ 1192 /* TODO: Someday, libarchive's I/O core will support optional 1193 * seeking. When that day comes, this code should attempt to 1194 * seek and only return the error if the seek fails. That 1195 * will give us support for whacky ISO images that require 1196 * seeking while retaining the ability to read almost all ISO 1197 * images in a streaming fashion. */ 1198 if ((file->mode & AE_IFMT) != AE_IFDIR && 1199 file->offset < iso9660->current_position) { 1200 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 1201 "Ignoring out-of-order file (%s) %jd < %jd", 1202 iso9660->pathname.s, 1203 (intmax_t)file->offset, 1204 (intmax_t)iso9660->current_position); 1205 iso9660->entry_bytes_remaining = 0; 1206 iso9660->entry_sparse_offset = 0; 1207 return (ARCHIVE_WARN); 1208 } 1209 1210 /* Initialize zisofs variables. */ 1211 iso9660->entry_zisofs.pz = file->pz; 1212 if (file->pz) { 1213#ifdef HAVE_ZLIB_H 1214 struct zisofs *zisofs; 1215 1216 zisofs = &iso9660->entry_zisofs; 1217 zisofs->initialized = 0; 1218 zisofs->pz_log2_bs = file->pz_log2_bs; 1219 zisofs->pz_uncompressed_size = file->pz_uncompressed_size; 1220 zisofs->pz_offset = 0; 1221 zisofs->header_avail = 0; 1222 zisofs->header_passed = 0; 1223 zisofs->block_pointers_avail = 0; 1224#endif 1225 archive_entry_set_size(entry, file->pz_uncompressed_size); 1226 } 1227 1228 iso9660->previous_number = file->number; 1229 archive_strcpy(&iso9660->previous_pathname, iso9660->pathname.s); 1230 1231 /* Reset entry_bytes_remaining if the file is multi extent. */ 1232 iso9660->entry_content = file->contents.first; 1233 if (iso9660->entry_content != NULL) 1234 iso9660->entry_bytes_remaining = iso9660->entry_content->size; 1235 1236 if (archive_entry_filetype(entry) == AE_IFDIR) { 1237 /* Overwrite nlinks by proper link number which is 1238 * calculated from number of sub directories. */ 1239 archive_entry_set_nlink(entry, 2 + file->subdirs); 1240 /* Directory data has been read completely. */ 1241 iso9660->entry_bytes_remaining = 0; 1242 iso9660->entry_sparse_offset = 0; 1243 } 1244 1245 if (rd_r != ARCHIVE_OK) 1246 return (rd_r); 1247 return (ARCHIVE_OK); 1248} 1249 1250static int 1251archive_read_format_iso9660_read_data_skip(struct archive_read *a) 1252{ 1253 /* Because read_next_header always does an explicit skip 1254 * to the next entry, we don't need to do anything here. */ 1255 (void)a; /* UNUSED */ 1256 return (ARCHIVE_OK); 1257} 1258 1259#ifdef HAVE_ZLIB_H 1260 1261static int 1262zisofs_read_data(struct archive_read *a, 1263 const void **buff, size_t *size, off_t *offset) 1264{ 1265 struct iso9660 *iso9660; 1266 struct zisofs *zisofs; 1267 const unsigned char *p; 1268 size_t avail; 1269 ssize_t bytes_read; 1270 size_t uncompressed_size; 1271 int r; 1272 1273 iso9660 = (struct iso9660 *)(a->format->data); 1274 zisofs = &iso9660->entry_zisofs; 1275 1276 p = __archive_read_ahead(a, 1, &bytes_read); 1277 if (bytes_read <= 0) { 1278 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT, 1279 "Truncated zisofs file body"); 1280 return (ARCHIVE_FATAL); 1281 } 1282 if (bytes_read > iso9660->entry_bytes_remaining) 1283 bytes_read = iso9660->entry_bytes_remaining; 1284 avail = bytes_read; 1285 uncompressed_size = 0; 1286 1287 if (!zisofs->initialized) { 1288 size_t ceil, xsize; 1289 1290 /* Allocate block pointers buffer. */ 1291 ceil = (zisofs->pz_uncompressed_size + 1292 (1LL << zisofs->pz_log2_bs) - 1) 1293 >> zisofs->pz_log2_bs; 1294 xsize = (ceil + 1) * 4; 1295 if (zisofs->block_pointers_alloc < xsize) { 1296 size_t alloc; 1297 1298 if (zisofs->block_pointers != NULL) 1299 free(zisofs->block_pointers); 1300 alloc = ((xsize >> 10) + 1) << 10; 1301 zisofs->block_pointers = malloc(alloc); 1302 if (zisofs->block_pointers == NULL) { 1303 archive_set_error(&a->archive, ENOMEM, 1304 "No memory for zisofs decompression"); 1305 return (ARCHIVE_FATAL); 1306 } 1307 zisofs->block_pointers_alloc = alloc; 1308 } 1309 zisofs->block_pointers_size = xsize; 1310 1311 /* Allocate uncompressed data buffer. */ 1312 xsize = 1UL << zisofs->pz_log2_bs; 1313 if (zisofs->uncompressed_buffer_size < xsize) { 1314 if (zisofs->uncompressed_buffer != NULL) 1315 free(zisofs->uncompressed_buffer); 1316 zisofs->uncompressed_buffer = malloc(xsize); 1317 if (zisofs->uncompressed_buffer == NULL) { 1318 archive_set_error(&a->archive, ENOMEM, 1319 "No memory for zisofs decompression"); 1320 return (ARCHIVE_FATAL); 1321 } 1322 } 1323 zisofs->uncompressed_buffer_size = xsize; 1324 1325 /* 1326 * Read the file header, and check the magic code of zisofs. 1327 */ 1328 if (zisofs->header_avail < sizeof(zisofs->header)) { 1329 xsize = sizeof(zisofs->header) - zisofs->header_avail; 1330 if (avail < xsize) 1331 xsize = avail; 1332 memcpy(zisofs->header + zisofs->header_avail, p, xsize); 1333 zisofs->header_avail += xsize; 1334 avail -= xsize; 1335 p += xsize; 1336 } 1337 if (!zisofs->header_passed && 1338 zisofs->header_avail == sizeof(zisofs->header)) { 1339 int err = 0; 1340 1341 if (memcmp(zisofs->header, zisofs_magic, 1342 sizeof(zisofs_magic)) != 0) 1343 err = 1; 1344 if (archive_le32dec(zisofs->header + 8) 1345 != zisofs->pz_uncompressed_size) 1346 err = 1; 1347 if (zisofs->header[12] != 4) 1348 err = 1; 1349 if (zisofs->header[13] != zisofs->pz_log2_bs) 1350 err = 1; 1351 if (err) { 1352 archive_set_error(&a->archive, 1353 ARCHIVE_ERRNO_FILE_FORMAT, 1354 "Illegal zisofs file body"); 1355 return (ARCHIVE_FATAL); 1356 } 1357 zisofs->header_passed = 1; 1358 } 1359 /* 1360 * Read block pointers. 1361 */ 1362 if (zisofs->header_passed && 1363 zisofs->block_pointers_avail < zisofs->block_pointers_size) { 1364 xsize = zisofs->block_pointers_size 1365 - zisofs->block_pointers_avail; 1366 if (avail < xsize) 1367 xsize = avail; 1368 memcpy(zisofs->block_pointers 1369 + zisofs->block_pointers_avail, p, xsize); 1370 zisofs->block_pointers_avail += xsize; 1371 avail -= xsize; 1372 p += xsize; 1373 if (zisofs->block_pointers_avail 1374 == zisofs->block_pointers_size) { 1375 /* We've got all block pointers and initialize 1376 * related variables. */ 1377 zisofs->block_off = 0; 1378 zisofs->block_avail = 0; 1379 /* Complete a initialization */ 1380 zisofs->initialized = 1; 1381 } 1382 } 1383 1384 if (!zisofs->initialized) 1385 goto next_data; /* We need more datas. */ 1386 } 1387 1388 /* 1389 * Get block offsets from block pointers. 1390 */ 1391 if (zisofs->block_avail == 0) { 1392 uint32_t bst, bed; 1393 1394 if (zisofs->block_off + 4 >= zisofs->block_pointers_size) { 1395 /* There isn't a pair of offsets. */ 1396 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT, 1397 "Illegal zisofs block pointers"); 1398 return (ARCHIVE_FATAL); 1399 } 1400 bst = archive_le32dec(zisofs->block_pointers + zisofs->block_off); 1401 if (bst != zisofs->pz_offset + (bytes_read - avail)) { 1402 /* TODO: Should we seek offset of current file by bst ? */ 1403 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT, 1404 "Illegal zisofs block pointers(cannot seek)"); 1405 return (ARCHIVE_FATAL); 1406 } 1407 bed = archive_le32dec( 1408 zisofs->block_pointers + zisofs->block_off + 4); 1409 if (bed < bst) { 1410 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT, 1411 "Illegal zisofs block pointers"); 1412 return (ARCHIVE_FATAL); 1413 } 1414 zisofs->block_avail = bed - bst; 1415 zisofs->block_off += 4; 1416 1417 /* Initialize compression library for new block. */ 1418 if (zisofs->stream_valid) 1419 r = inflateReset(&zisofs->stream); 1420 else 1421 r = inflateInit(&zisofs->stream); 1422 if (r != Z_OK) { 1423 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 1424 "Can't initialize zisofs decompression."); 1425 return (ARCHIVE_FATAL); 1426 } 1427 zisofs->stream_valid = 1; 1428 zisofs->stream.total_in = 0; 1429 zisofs->stream.total_out = 0; 1430 } 1431 1432 /* 1433 * Make uncompressed datas. 1434 */ 1435 if (zisofs->block_avail == 0) { 1436 memset(zisofs->uncompressed_buffer, 0, 1437 zisofs->uncompressed_buffer_size); 1438 uncompressed_size = zisofs->uncompressed_buffer_size; 1439 } else { 1440 zisofs->stream.next_in = (Bytef *)(uintptr_t)(const void *)p; 1441 if (avail > zisofs->block_avail) 1442 zisofs->stream.avail_in = zisofs->block_avail; 1443 else 1444 zisofs->stream.avail_in = avail; 1445 zisofs->stream.next_out = zisofs->uncompressed_buffer; 1446 zisofs->stream.avail_out = zisofs->uncompressed_buffer_size; 1447 1448 r = inflate(&zisofs->stream, 0); 1449 switch (r) { 1450 case Z_OK: /* Decompressor made some progress.*/ 1451 case Z_STREAM_END: /* Found end of stream. */ 1452 break; 1453 default: 1454 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 1455 "zisofs decompression failed (%d)", r); 1456 return (ARCHIVE_FATAL); 1457 } 1458 uncompressed_size = 1459 zisofs->uncompressed_buffer_size - zisofs->stream.avail_out; 1460 avail -= zisofs->stream.next_in - p; 1461 zisofs->block_avail -= zisofs->stream.next_in - p; 1462 } 1463next_data: 1464 bytes_read -= avail; 1465 *buff = zisofs->uncompressed_buffer; 1466 *size = uncompressed_size; 1467 *offset = iso9660->entry_sparse_offset; 1468 iso9660->entry_sparse_offset += uncompressed_size; 1469 iso9660->entry_bytes_remaining -= bytes_read; 1470 iso9660->current_position += bytes_read; 1471 zisofs->pz_offset += bytes_read; 1472 __archive_read_consume(a, bytes_read); 1473 1474 return (ARCHIVE_OK); 1475} 1476 1477#else /* HAVE_ZLIB_H */ 1478 1479static int 1480zisofs_read_data(struct archive_read *a, 1481 const void **buff, size_t *size, off_t *offset) 1482{ 1483 1484 (void)buff;/* UNUSED */ 1485 (void)size;/* UNUSED */ 1486 (void)offset;/* UNUSED */ 1487 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT, 1488 "zisofs is not supported on this platform."); 1489 return (ARCHIVE_FAILED); 1490} 1491 1492#endif /* HAVE_ZLIB_H */ 1493 1494static int 1495archive_read_format_iso9660_read_data(struct archive_read *a, 1496 const void **buff, size_t *size, off_t *offset) 1497{ 1498 ssize_t bytes_read; 1499 struct iso9660 *iso9660; 1500 1501 iso9660 = (struct iso9660 *)(a->format->data); 1502 if (iso9660->entry_bytes_remaining <= 0) { 1503 if (iso9660->entry_content != NULL) 1504 iso9660->entry_content = iso9660->entry_content->next; 1505 if (iso9660->entry_content == NULL) { 1506 *buff = NULL; 1507 *size = 0; 1508 *offset = iso9660->entry_sparse_offset; 1509 return (ARCHIVE_EOF); 1510 } 1511 /* Seek forward to the start of the entry. */ 1512 if (iso9660->current_position < iso9660->entry_content->offset) { 1513 int64_t step; 1514 1515 step = iso9660->entry_content->offset - 1516 iso9660->current_position; 1517 step = __archive_read_skip(a, step); 1518 if (step < 0) 1519 return ((int)step); 1520 iso9660->current_position = 1521 iso9660->entry_content->offset; 1522 } 1523 if (iso9660->entry_content->offset < iso9660->current_position) { 1524 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 1525 "Ignoring out-of-order file (%s) %jd < %jd", 1526 iso9660->pathname.s, 1527 (intmax_t)iso9660->entry_content->offset, 1528 (intmax_t)iso9660->current_position); 1529 *buff = NULL; 1530 *size = 0; 1531 *offset = iso9660->entry_sparse_offset; 1532 return (ARCHIVE_WARN); 1533 } 1534 iso9660->entry_bytes_remaining = iso9660->entry_content->size; 1535 } 1536 if (iso9660->entry_zisofs.pz) 1537 return (zisofs_read_data(a, buff, size, offset)); 1538 1539 *buff = __archive_read_ahead(a, 1, &bytes_read); 1540 if (bytes_read == 0) 1541 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 1542 "Truncated input file"); 1543 if (*buff == NULL) 1544 return (ARCHIVE_FATAL); 1545 if (bytes_read > iso9660->entry_bytes_remaining) 1546 bytes_read = iso9660->entry_bytes_remaining; 1547 *size = bytes_read; 1548 *offset = iso9660->entry_sparse_offset; 1549 iso9660->entry_sparse_offset += bytes_read; 1550 iso9660->entry_bytes_remaining -= bytes_read; 1551 iso9660->current_position += bytes_read; 1552 __archive_read_consume(a, bytes_read); 1553 return (ARCHIVE_OK); 1554} 1555 1556static int 1557archive_read_format_iso9660_cleanup(struct archive_read *a) 1558{ 1559 struct iso9660 *iso9660; 1560 int r = ARCHIVE_OK; 1561 1562 iso9660 = (struct iso9660 *)(a->format->data); 1563 release_files(iso9660); 1564 free(iso9660->read_ce_req.reqs); 1565 archive_string_free(&iso9660->pathname); 1566 archive_string_free(&iso9660->previous_pathname); 1567 if (iso9660->pending_files.files) 1568 free(iso9660->pending_files.files); 1569#ifdef HAVE_ZLIB_H 1570 free(iso9660->entry_zisofs.uncompressed_buffer); 1571 free(iso9660->entry_zisofs.block_pointers); 1572 if (iso9660->entry_zisofs.stream_valid) { 1573 if (inflateEnd(&iso9660->entry_zisofs.stream) != Z_OK) { 1574 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 1575 "Failed to clean up zlib decompressor"); 1576 r = ARCHIVE_FATAL; 1577 } 1578 } 1579#endif 1580 free(iso9660); 1581 (a->format->data) = NULL; 1582 return (r); 1583} 1584 1585/* 1586 * This routine parses a single ISO directory record, makes sense 1587 * of any extensions, and stores the result in memory. 1588 */ 1589static struct file_info * 1590parse_file_info(struct archive_read *a, struct file_info *parent, 1591 const unsigned char *isodirrec) 1592{ 1593 struct iso9660 *iso9660; 1594 struct file_info *file; 1595 size_t name_len; 1596 const unsigned char *rr_start, *rr_end; 1597 const unsigned char *p; 1598 size_t dr_len; 1599 uint64_t fsize; 1600 int32_t location; 1601 int flags; 1602 1603 iso9660 = (struct iso9660 *)(a->format->data); 1604 1605 dr_len = (size_t)isodirrec[DR_length_offset]; 1606 name_len = (size_t)isodirrec[DR_name_len_offset]; 1607 location = archive_le32dec(isodirrec + DR_extent_offset); 1608 fsize = toi(isodirrec + DR_size_offset, DR_size_size); 1609 /* Sanity check that dr_len needs at least 34. */ 1610 if (dr_len < 34) { 1611 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 1612 "Invalid length of directory record"); 1613 return (NULL); 1614 } 1615 /* Sanity check that name_len doesn't exceed dr_len. */ 1616 if (dr_len - 33 < name_len || name_len == 0) { 1617 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 1618 "Invalid length of file identifier"); 1619 return (NULL); 1620 } 1621 /* Sanity check that location doesn't exceed volume block. 1622 * Don't check lower limit of location; it's possibility 1623 * the location has negative value when file type is symbolic 1624 * link or file size is zero. As far as I know latest mkisofs 1625 * do that. 1626 */ 1627 if (location > 0 && 1628 (location + ((fsize + iso9660->logical_block_size -1) 1629 / iso9660->logical_block_size)) > iso9660->volume_block) { 1630 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 1631 "Invalid location of extent of file"); 1632 return (NULL); 1633 } 1634 1635 /* Create a new file entry and copy data from the ISO dir record. */ 1636 file = (struct file_info *)malloc(sizeof(*file)); 1637 if (file == NULL) { 1638 archive_set_error(&a->archive, ENOMEM, 1639 "No memory for file entry"); 1640 return (NULL); 1641 } 1642 memset(file, 0, sizeof(*file)); 1643 file->parent = parent; 1644 file->offset = iso9660->logical_block_size * (uint64_t)location; 1645 file->size = fsize; 1646 file->mtime = isodate7(isodirrec + DR_date_offset); 1647 file->ctime = file->atime = file->mtime; 1648 file->rede_files.first = NULL; 1649 file->rede_files.last = &(file->rede_files.first); 1650 1651 p = isodirrec + DR_name_offset; 1652 /* Rockridge extensions (if any) follow name. Compute this 1653 * before fidgeting the name_len below. */ 1654 rr_start = p + name_len + (name_len & 1 ? 0 : 1); 1655 rr_end = isodirrec + dr_len; 1656 1657 if (iso9660->seenJoliet) { 1658 /* Joliet names are max 64 chars (128 bytes) according to spec, 1659 * but genisoimage/mkisofs allows recording longer Joliet 1660 * names which are 103 UCS2 characters(206 bytes) by their 1661 * option '-joliet-long'. 1662 */ 1663 wchar_t wbuff[103+1], *wp; 1664 const unsigned char *c; 1665 1666 if (name_len > 206) 1667 name_len = 206; 1668 /* convert BE UTF-16 to wchar_t */ 1669 for (c = p, wp = wbuff; 1670 c < (p + name_len) && 1671 wp < (wbuff + sizeof(wbuff)/sizeof(*wbuff) - 1); 1672 c += 2) { 1673 *wp++ = (((255 & (int)c[0]) << 8) | (255 & (int)c[1])); 1674 } 1675 *wp = L'\0'; 1676 1677#if 0 /* untested code, is it at all useful on Joliet? */ 1678 /* trim trailing first version and dot from filename. 1679 * 1680 * Remember we where in UTF-16BE land! 1681 * SEPARATOR 1 (.) and SEPARATOR 2 (;) are both 1682 * 16 bits big endian characters on Joliet. 1683 * 1684 * TODO: sanitize filename? 1685 * Joliet allows any UCS-2 char except: 1686 * *, /, :, ;, ? and \. 1687 */ 1688 /* Chop off trailing ';1' from files. */ 1689 if (*(wp-2) == ';' && *(wp-1) == '1') { 1690 wp-=2; 1691 *wp = L'\0'; 1692 } 1693 1694 /* Chop off trailing '.' from filenames. */ 1695 if (*(wp-1) == '.') 1696 *(--wp) = L'\0'; 1697#endif 1698 1699 /* store the result in the file name field. */ 1700 archive_strappend_w_utf8(&file->name, wbuff); 1701 } else { 1702 /* Chop off trailing ';1' from files. */ 1703 if (name_len > 2 && p[name_len - 2] == ';' && 1704 p[name_len - 1] == '1') 1705 name_len -= 2; 1706 /* Chop off trailing '.' from filenames. */ 1707 if (name_len > 1 && p[name_len - 1] == '.') 1708 --name_len; 1709 1710 archive_strncpy(&file->name, (const char *)p, name_len); 1711 } 1712 1713 flags = isodirrec[DR_flags_offset]; 1714 if (flags & 0x02) 1715 file->mode = AE_IFDIR | 0700; 1716 else 1717 file->mode = AE_IFREG | 0400; 1718 if (flags & 0x80) 1719 file->multi_extent = 1; 1720 else 1721 file->multi_extent = 0; 1722 /* 1723 * Use location for file number. 1724 * File number is treated as inode number to find out harlink 1725 * target. If Rockridge extensions is being used, file number 1726 * will be overwritten by FILE SERIAL NUMBER of RRIP "PX" 1727 * extension. 1728 * NOTE: Old mkisofs did not record that FILE SERIAL NUMBER 1729 * in ISO images. 1730 */ 1731 if (file->size == 0 && location >= 0) 1732 /* If file->size is zero, its location points wrong place. 1733 * Dot not use it for file number. 1734 * When location has negative value, it can be used 1735 * for file number. 1736 */ 1737 file->number = -1; 1738 else 1739 file->number = (int64_t)(uint32_t)location; 1740 1741 /* Rockridge extensions overwrite information from above. */ 1742 if (iso9660->opt_support_rockridge) { 1743 if (parent == NULL && rr_end - rr_start >= 7) { 1744 p = rr_start; 1745 if (p[0] == 'S' && p[1] == 'P' 1746 && p[2] == 7 && p[3] == 1 1747 && p[4] == 0xBE && p[5] == 0xEF) { 1748 /* 1749 * SP extension stores the suspOffset 1750 * (Number of bytes to skip between 1751 * filename and SUSP records.) 1752 * It is mandatory by the SUSP standard 1753 * (IEEE 1281). 1754 * 1755 * It allows SUSP to coexist with 1756 * non-SUSP uses of the System 1757 * Use Area by placing non-SUSP data 1758 * before SUSP data. 1759 * 1760 * SP extension must be in the root 1761 * directory entry, disable all SUSP 1762 * processing if not found. 1763 */ 1764 iso9660->suspOffset = p[6]; 1765 iso9660->seenSUSP = 1; 1766 rr_start += 7; 1767 } 1768 } 1769 if (iso9660->seenSUSP) { 1770 int r; 1771 1772 file->name_continues = 0; 1773 file->symlink_continues = 0; 1774 rr_start += iso9660->suspOffset; 1775 r = parse_rockridge(a, file, rr_start, rr_end); 1776 if (r != ARCHIVE_OK) { 1777 free(file); 1778 return (NULL); 1779 } 1780 } else 1781 /* If there isn't SUSP, disable parsing 1782 * rock ridge extensions. */ 1783 iso9660->opt_support_rockridge = 0; 1784 } 1785 1786 file->nlinks = 1;/* Reset nlink. we'll calculate it later. */ 1787 /* Tell file's parent how many children that parent has. */ 1788 if (parent != NULL && (flags & 0x02)) 1789 parent->subdirs++; 1790 1791 if (iso9660->seenRockridge) { 1792 if (parent != NULL && parent->parent == NULL && 1793 (flags & 0x02) && iso9660->rr_moved == NULL && 1794 (strcmp(file->name.s, "rr_moved") == 0 || 1795 strcmp(file->name.s, ".rr_moved") == 0)) { 1796 iso9660->rr_moved = file; 1797 file->rr_moved = 1; 1798 file->rr_moved_has_re_only = 1; 1799 file->re = 0; 1800 parent->subdirs--; 1801 } else if (file->re) { 1802 /* This file's parent is not rr_moved, clear invalid 1803 * "RE" mark. */ 1804 if (parent == NULL || parent->rr_moved == 0) 1805 file->re = 0; 1806 else if ((flags & 0x02) == 0) { 1807 file->rr_moved_has_re_only = 0; 1808 file->re = 0; 1809 } 1810 } else if (parent != NULL && parent->rr_moved) 1811 file->rr_moved_has_re_only = 0; 1812 else if (parent != NULL && (flags & 0x02) && 1813 (parent->re || parent->re_descendant)) 1814 file->re_descendant = 1; 1815 if (file->cl_offset != 0) { 1816 parent->subdirs++; 1817 /* Overwrite an offset and a number of this "CL" entry 1818 * to appear before other dirs. "+1" to those is to 1819 * make sure to appear after "RE" entry which this 1820 * "CL" entry should be connected with. */ 1821 file->offset = file->number = file->cl_offset + 1; 1822 } 1823 } 1824 1825#if DEBUG 1826 /* DEBUGGING: Warn about attributes I don't yet fully support. */ 1827 if ((flags & ~0x02) != 0) { 1828 fprintf(stderr, "\n ** Unrecognized flag: "); 1829 dump_isodirrec(stderr, isodirrec); 1830 fprintf(stderr, "\n"); 1831 } else if (toi(isodirrec + DR_volume_sequence_number_offset, 2) != 1) { 1832 fprintf(stderr, "\n ** Unrecognized sequence number: "); 1833 dump_isodirrec(stderr, isodirrec); 1834 fprintf(stderr, "\n"); 1835 } else if (*(isodirrec + DR_file_unit_size_offset) != 0) { 1836 fprintf(stderr, "\n ** Unexpected file unit size: "); 1837 dump_isodirrec(stderr, isodirrec); 1838 fprintf(stderr, "\n"); 1839 } else if (*(isodirrec + DR_interleave_offset) != 0) { 1840 fprintf(stderr, "\n ** Unexpected interleave: "); 1841 dump_isodirrec(stderr, isodirrec); 1842 fprintf(stderr, "\n"); 1843 } else if (*(isodirrec + DR_ext_attr_length_offset) != 0) { 1844 fprintf(stderr, "\n ** Unexpected extended attribute length: "); 1845 dump_isodirrec(stderr, isodirrec); 1846 fprintf(stderr, "\n"); 1847 } 1848#endif 1849 register_file(iso9660, file); 1850 return (file); 1851} 1852 1853static int 1854parse_rockridge(struct archive_read *a, struct file_info *file, 1855 const unsigned char *p, const unsigned char *end) 1856{ 1857 struct iso9660 *iso9660; 1858 1859 iso9660 = (struct iso9660 *)(a->format->data); 1860 1861 while (p + 4 <= end /* Enough space for another entry. */ 1862 && p[0] >= 'A' && p[0] <= 'Z' /* Sanity-check 1st char of name. */ 1863 && p[1] >= 'A' && p[1] <= 'Z' /* Sanity-check 2nd char of name. */ 1864 && p[2] >= 4 /* Sanity-check length. */ 1865 && p + p[2] <= end) { /* Sanity-check length. */ 1866 const unsigned char *data = p + 4; 1867 int data_length = p[2] - 4; 1868 int version = p[3]; 1869 1870 /* 1871 * Yes, each 'if' here does test p[0] again. 1872 * Otherwise, the fall-through handling to catch 1873 * unsupported extensions doesn't work. 1874 */ 1875 switch(p[0]) { 1876 case 'C': 1877 if (p[0] == 'C' && p[1] == 'E') { 1878 if (version == 1 && data_length == 24) { 1879 /* 1880 * CE extension comprises: 1881 * 8 byte sector containing extension 1882 * 8 byte offset w/in above sector 1883 * 8 byte length of continuation 1884 */ 1885 int32_t location = 1886 archive_le32dec(data); 1887 file->ce_offset = 1888 archive_le32dec(data+8); 1889 file->ce_size = 1890 archive_le32dec(data+16); 1891 if (register_CE(a, location, file) 1892 != ARCHIVE_OK) 1893 return (ARCHIVE_FATAL); 1894 } 1895 break; 1896 } 1897 if (p[0] == 'C' && p[1] == 'L') { 1898 if (version == 1 && data_length == 8) { 1899 file->cl_offset = (uint64_t) 1900 iso9660->logical_block_size * 1901 (uint64_t)archive_le32dec(data); 1902 iso9660->seenRockridge = 1; 1903 } 1904 break; 1905 } 1906 /* FALLTHROUGH */ 1907 case 'N': 1908 if (p[0] == 'N' && p[1] == 'M') { 1909 if (version == 1) { 1910 parse_rockridge_NM1(file, 1911 data, data_length); 1912 iso9660->seenRockridge = 1; 1913 } 1914 break; 1915 } 1916 /* FALLTHROUGH */ 1917 case 'P': 1918 if (p[0] == 'P' && p[1] == 'D') { 1919 /* 1920 * PD extension is padding; 1921 * contents are always ignored. 1922 */ 1923 break; 1924 } 1925 if (p[0] == 'P' && p[1] == 'N') { 1926 if (version == 1 && data_length == 16) { 1927 file->rdev = toi(data,4); 1928 file->rdev <<= 32; 1929 file->rdev |= toi(data + 8, 4); 1930 iso9660->seenRockridge = 1; 1931 } 1932 break; 1933 } 1934 if (p[0] == 'P' && p[1] == 'X') { 1935 /* 1936 * PX extension comprises: 1937 * 8 bytes for mode, 1938 * 8 bytes for nlinks, 1939 * 8 bytes for uid, 1940 * 8 bytes for gid, 1941 * 8 bytes for inode. 1942 */ 1943 if (version == 1) { 1944 if (data_length >= 8) 1945 file->mode 1946 = toi(data, 4); 1947 if (data_length >= 16) 1948 file->nlinks 1949 = toi(data + 8, 4); 1950 if (data_length >= 24) 1951 file->uid 1952 = toi(data + 16, 4); 1953 if (data_length >= 32) 1954 file->gid 1955 = toi(data + 24, 4); 1956 if (data_length >= 40) 1957 file->number 1958 = toi(data + 32, 4); 1959 iso9660->seenRockridge = 1; 1960 } 1961 break; 1962 } 1963 /* FALLTHROUGH */ 1964 case 'R': 1965 if (p[0] == 'R' && p[1] == 'E' && version == 1) { 1966 file->re = 1; 1967 iso9660->seenRockridge = 1; 1968 break; 1969 } 1970 if (p[0] == 'R' && p[1] == 'R' && version == 1) { 1971 /* 1972 * RR extension comprises: 1973 * one byte flag value 1974 * This extension is obsolete, 1975 * so contents are always ignored. 1976 */ 1977 break; 1978 } 1979 /* FALLTHROUGH */ 1980 case 'S': 1981 if (p[0] == 'S' && p[1] == 'L') { 1982 if (version == 1) { 1983 parse_rockridge_SL1(file, 1984 data, data_length); 1985 iso9660->seenRockridge = 1; 1986 } 1987 break; 1988 } 1989 if (p[0] == 'S' && p[1] == 'T' 1990 && data_length == 0 && version == 1) { 1991 /* 1992 * ST extension marks end of this 1993 * block of SUSP entries. 1994 * 1995 * It allows SUSP to coexist with 1996 * non-SUSP uses of the System 1997 * Use Area by placing non-SUSP data 1998 * after SUSP data. 1999 */ 2000 iso9660->seenSUSP = 0; 2001 iso9660->seenRockridge = 0; 2002 return (ARCHIVE_OK); 2003 } 2004 case 'T': 2005 if (p[0] == 'T' && p[1] == 'F') { 2006 if (version == 1) { 2007 parse_rockridge_TF1(file, 2008 data, data_length); 2009 iso9660->seenRockridge = 1; 2010 } 2011 break; 2012 } 2013 /* FALLTHROUGH */ 2014 case 'Z': 2015 if (p[0] == 'Z' && p[1] == 'F') { 2016 if (version == 1) 2017 parse_rockridge_ZF1(file, 2018 data, data_length); 2019 break; 2020 } 2021 /* FALLTHROUGH */ 2022 default: 2023 /* The FALLTHROUGHs above leave us here for 2024 * any unsupported extension. */ 2025 break; 2026 } 2027 2028 2029 2030 p += p[2]; 2031 } 2032 return (ARCHIVE_OK); 2033} 2034 2035static int 2036register_CE(struct archive_read *a, int32_t location, 2037 struct file_info *file) 2038{ 2039 struct iso9660 *iso9660; 2040 struct read_ce_queue *heap; 2041 struct read_ce_req *p; 2042 uint64_t offset, parent_offset; 2043 int hole, parent; 2044 2045 iso9660 = (struct iso9660 *)(a->format->data); 2046 offset = ((uint64_t)location) * (uint64_t)iso9660->logical_block_size; 2047 if (((file->mode & AE_IFMT) == AE_IFREG && 2048 offset >= file->offset) || 2049 offset < iso9660->current_position) { 2050 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 2051 "Invalid location in SUSP \"CE\" extension"); 2052 return (ARCHIVE_FATAL); 2053 } 2054 2055 /* Expand our CE list as necessary. */ 2056 heap = &(iso9660->read_ce_req); 2057 if (heap->cnt >= heap->allocated) { 2058 int new_size; 2059 2060 if (heap->allocated < 16) 2061 new_size = 16; 2062 else 2063 new_size = heap->allocated * 2; 2064 /* Overflow might keep us from growing the list. */ 2065 if (new_size <= heap->allocated) 2066 __archive_errx(1, "Out of memory"); 2067 p = malloc(new_size * sizeof(p[0])); 2068 if (p == NULL) 2069 __archive_errx(1, "Out of memory"); 2070 if (heap->reqs != NULL) { 2071 memcpy(p, heap->reqs, heap->cnt * sizeof(*p)); 2072 free(heap->reqs); 2073 } 2074 heap->reqs = p; 2075 heap->allocated = new_size; 2076 } 2077 2078 /* 2079 * Start with hole at end, walk it up tree to find insertion point. 2080 */ 2081 hole = heap->cnt++; 2082 while (hole > 0) { 2083 parent = (hole - 1)/2; 2084 parent_offset = heap->reqs[parent].offset; 2085 if (offset >= parent_offset) { 2086 heap->reqs[hole].offset = offset; 2087 heap->reqs[hole].file = file; 2088 return (ARCHIVE_OK); 2089 } 2090 // Move parent into hole <==> move hole up tree. 2091 heap->reqs[hole] = heap->reqs[parent]; 2092 hole = parent; 2093 } 2094 heap->reqs[0].offset = offset; 2095 heap->reqs[0].file = file; 2096 return (ARCHIVE_OK); 2097} 2098 2099static void 2100next_CE(struct read_ce_queue *heap) 2101{ 2102 uint64_t a_offset, b_offset, c_offset; 2103 int a, b, c; 2104 struct read_ce_req tmp; 2105 2106 if (heap->cnt < 1) 2107 return; 2108 2109 /* 2110 * Move the last item in the heap to the root of the tree 2111 */ 2112 heap->reqs[0] = heap->reqs[--(heap->cnt)]; 2113 2114 /* 2115 * Rebalance the heap. 2116 */ 2117 a = 0; // Starting element and its offset 2118 a_offset = heap->reqs[a].offset; 2119 for (;;) { 2120 b = a + a + 1; // First child 2121 if (b >= heap->cnt) 2122 return; 2123 b_offset = heap->reqs[b].offset; 2124 c = b + 1; // Use second child if it is smaller. 2125 if (c < heap->cnt) { 2126 c_offset = heap->reqs[c].offset; 2127 if (c_offset < b_offset) { 2128 b = c; 2129 b_offset = c_offset; 2130 } 2131 } 2132 if (a_offset <= b_offset) 2133 return; 2134 tmp = heap->reqs[a]; 2135 heap->reqs[a] = heap->reqs[b]; 2136 heap->reqs[b] = tmp; 2137 a = b; 2138 } 2139} 2140 2141 2142static int 2143read_CE(struct archive_read *a, struct iso9660 *iso9660) 2144{ 2145 struct read_ce_queue *heap; 2146 const unsigned char *b, *p, *end; 2147 struct file_info *file; 2148 size_t step; 2149 int r; 2150 2151 /* Read data which RRIP "CE" extension points. */ 2152 heap = &(iso9660->read_ce_req); 2153 step = iso9660->logical_block_size; 2154 while (heap->cnt && 2155 heap->reqs[0].offset == iso9660->current_position) { 2156 b = __archive_read_ahead(a, step, NULL); 2157 if (b == NULL) { 2158 archive_set_error(&a->archive, 2159 ARCHIVE_ERRNO_MISC, 2160 "Failed to read full block when scanning " 2161 "ISO9660 directory list"); 2162 return (ARCHIVE_FATAL); 2163 } 2164 do { 2165 file = heap->reqs[0].file; 2166 p = b + file->ce_offset; 2167 end = p + file->ce_size; 2168 next_CE(heap); 2169 r = parse_rockridge(a, file, p, end); 2170 if (r != ARCHIVE_OK) 2171 return (ARCHIVE_FATAL); 2172 } while (heap->cnt && 2173 heap->reqs[0].offset == iso9660->current_position); 2174 /* NOTE: Do not move this consume's code to fron of 2175 * do-while loop. Registration of nested CE extension 2176 * might cause error because of current position. */ 2177 __archive_read_consume(a, step); 2178 iso9660->current_position += step; 2179 } 2180 return (ARCHIVE_OK); 2181} 2182 2183static void 2184parse_rockridge_NM1(struct file_info *file, 2185 const unsigned char *data, int data_length) 2186{ 2187 if (!file->name_continues) 2188 archive_string_empty(&file->name); 2189 file->name_continues = 0; 2190 if (data_length < 1) 2191 return; 2192 /* 2193 * NM version 1 extension comprises: 2194 * 1 byte flag, value is one of: 2195 * = 0: remainder is name 2196 * = 1: remainder is name, next NM entry continues name 2197 * = 2: "." 2198 * = 4: ".." 2199 * = 32: Implementation specific 2200 * All other values are reserved. 2201 */ 2202 switch(data[0]) { 2203 case 0: 2204 if (data_length < 2) 2205 return; 2206 archive_strncat(&file->name, (const char *)data + 1, data_length - 1); 2207 break; 2208 case 1: 2209 if (data_length < 2) 2210 return; 2211 archive_strncat(&file->name, (const char *)data + 1, data_length - 1); 2212 file->name_continues = 1; 2213 break; 2214 case 2: 2215 archive_strcat(&file->name, "."); 2216 break; 2217 case 4: 2218 archive_strcat(&file->name, ".."); 2219 break; 2220 default: 2221 return; 2222 } 2223 2224} 2225 2226static void 2227parse_rockridge_TF1(struct file_info *file, const unsigned char *data, 2228 int data_length) 2229{ 2230 char flag; 2231 /* 2232 * TF extension comprises: 2233 * one byte flag 2234 * create time (optional) 2235 * modify time (optional) 2236 * access time (optional) 2237 * attribute time (optional) 2238 * Time format and presence of fields 2239 * is controlled by flag bits. 2240 */ 2241 if (data_length < 1) 2242 return; 2243 flag = data[0]; 2244 ++data; 2245 --data_length; 2246 if (flag & 0x80) { 2247 /* Use 17-byte time format. */ 2248 if ((flag & 1) && data_length >= 17) { 2249 /* Create time. */ 2250 file->birthtime_is_set = 1; 2251 file->birthtime = isodate17(data); 2252 data += 17; 2253 data_length -= 17; 2254 } 2255 if ((flag & 2) && data_length >= 17) { 2256 /* Modify time. */ 2257 file->mtime = isodate17(data); 2258 data += 17; 2259 data_length -= 17; 2260 } 2261 if ((flag & 4) && data_length >= 17) { 2262 /* Access time. */ 2263 file->atime = isodate17(data); 2264 data += 17; 2265 data_length -= 17; 2266 } 2267 if ((flag & 8) && data_length >= 17) { 2268 /* Attribute change time. */ 2269 file->ctime = isodate17(data); 2270 } 2271 } else { 2272 /* Use 7-byte time format. */ 2273 if ((flag & 1) && data_length >= 7) { 2274 /* Create time. */ 2275 file->birthtime_is_set = 1; 2276 file->birthtime = isodate7(data); 2277 data += 7; 2278 data_length -= 7; 2279 } 2280 if ((flag & 2) && data_length >= 7) { 2281 /* Modify time. */ 2282 file->mtime = isodate7(data); 2283 data += 7; 2284 data_length -= 7; 2285 } 2286 if ((flag & 4) && data_length >= 7) { 2287 /* Access time. */ 2288 file->atime = isodate7(data); 2289 data += 7; 2290 data_length -= 7; 2291 } 2292 if ((flag & 8) && data_length >= 7) { 2293 /* Attribute change time. */ 2294 file->ctime = isodate7(data); 2295 } 2296 } 2297} 2298 2299static void 2300parse_rockridge_SL1(struct file_info *file, const unsigned char *data, 2301 int data_length) 2302{ 2303 const char *separator = ""; 2304 2305 if (!file->symlink_continues || file->symlink.length < 1) 2306 archive_string_empty(&file->symlink); 2307 else if (!file->symlink_continues && 2308 file->symlink.s[file->symlink.length - 1] != '/') 2309 separator = "/"; 2310 file->symlink_continues = 0; 2311 2312 /* 2313 * Defined flag values: 2314 * 0: This is the last SL record for this symbolic link 2315 * 1: this symbolic link field continues in next SL entry 2316 * All other values are reserved. 2317 */ 2318 if (data_length < 1) 2319 return; 2320 switch(*data) { 2321 case 0: 2322 break; 2323 case 1: 2324 file->symlink_continues = 1; 2325 break; 2326 default: 2327 return; 2328 } 2329 ++data; /* Skip flag byte. */ 2330 --data_length; 2331 2332 /* 2333 * SL extension body stores "components". 2334 * Basically, this is a complicated way of storing 2335 * a POSIX path. It also interferes with using 2336 * symlinks for storing non-path data. <sigh> 2337 * 2338 * Each component is 2 bytes (flag and length) 2339 * possibly followed by name data. 2340 */ 2341 while (data_length >= 2) { 2342 unsigned char flag = *data++; 2343 unsigned char nlen = *data++; 2344 data_length -= 2; 2345 2346 archive_strcat(&file->symlink, separator); 2347 separator = "/"; 2348 2349 switch(flag) { 2350 case 0: /* Usual case, this is text. */ 2351 if (data_length < nlen) 2352 return; 2353 archive_strncat(&file->symlink, 2354 (const char *)data, nlen); 2355 break; 2356 case 0x01: /* Text continues in next component. */ 2357 if (data_length < nlen) 2358 return; 2359 archive_strncat(&file->symlink, 2360 (const char *)data, nlen); 2361 separator = ""; 2362 break; 2363 case 0x02: /* Current dir. */ 2364 archive_strcat(&file->symlink, "."); 2365 break; 2366 case 0x04: /* Parent dir. */ 2367 archive_strcat(&file->symlink, ".."); 2368 break; 2369 case 0x08: /* Root of filesystem. */ 2370 archive_strcat(&file->symlink, "/"); 2371 separator = ""; 2372 break; 2373 case 0x10: /* Undefined (historically "volume root" */ 2374 archive_string_empty(&file->symlink); 2375 archive_strcat(&file->symlink, "ROOT"); 2376 break; 2377 case 0x20: /* Undefined (historically "hostname") */ 2378 archive_strcat(&file->symlink, "hostname"); 2379 break; 2380 default: 2381 /* TODO: issue a warning ? */ 2382 return; 2383 } 2384 data += nlen; 2385 data_length -= nlen; 2386 } 2387} 2388 2389static void 2390parse_rockridge_ZF1(struct file_info *file, const unsigned char *data, 2391 int data_length) 2392{ 2393 2394 if (data[0] == 0x70 && data[1] == 0x7a && data_length == 12) { 2395 /* paged zlib */ 2396 file->pz = 1; 2397 file->pz_log2_bs = data[3]; 2398 file->pz_uncompressed_size = archive_le32dec(&data[4]); 2399 } 2400} 2401 2402static void 2403register_file(struct iso9660 *iso9660, struct file_info *file) 2404{ 2405 2406 file->use_next = iso9660->use_files; 2407 iso9660->use_files = file; 2408} 2409 2410static void 2411release_files(struct iso9660 *iso9660) 2412{ 2413 struct content *con, *connext; 2414 struct file_info *file; 2415 2416 file = iso9660->use_files; 2417 while (file != NULL) { 2418 struct file_info *next = file->use_next; 2419 2420 archive_string_free(&file->name); 2421 archive_string_free(&file->symlink); 2422 con = file->contents.first; 2423 while (con != NULL) { 2424 connext = con->next; 2425 free(con); 2426 con = connext; 2427 } 2428 free(file); 2429 file = next; 2430 } 2431} 2432 2433static int 2434next_entry_seek(struct archive_read *a, struct iso9660 *iso9660, 2435 struct file_info **pfile) 2436{ 2437 struct file_info *file; 2438 int r; 2439 2440 r = next_cache_entry(a, iso9660, pfile); 2441 if (r != ARCHIVE_OK) 2442 return (r); 2443 file = *pfile; 2444 2445 /* Don't waste time seeking for zero-length bodies. */ 2446 if (file->size == 0) 2447 file->offset = iso9660->current_position; 2448 2449 /* Seek forward to the start of the entry. */ 2450 if (iso9660->current_position < file->offset) { 2451 int64_t step; 2452 2453 step = file->offset - iso9660->current_position; 2454 step = __archive_read_skip(a, step); 2455 if (step < 0) 2456 return ((int)step); 2457 iso9660->current_position = file->offset; 2458 } 2459 2460 /* We found body of file; handle it now. */ 2461 return (ARCHIVE_OK); 2462} 2463 2464static int 2465next_cache_entry(struct archive_read *a, struct iso9660 *iso9660, 2466 struct file_info **pfile) 2467{ 2468 struct file_info *file; 2469 struct { 2470 struct file_info *first; 2471 struct file_info **last; 2472 } empty_files; 2473 int64_t number; 2474 int count; 2475 2476 file = cache_get_entry(iso9660); 2477 if (file != NULL) { 2478 *pfile = file; 2479 return (ARCHIVE_OK); 2480 } 2481 2482 for (;;) { 2483 struct file_info *re, *d; 2484 2485 *pfile = file = next_entry(iso9660); 2486 if (file == NULL) { 2487 /* 2488 * If directory entries all which are descendant of 2489 * rr_moved are stil remaning, expose their. 2490 */ 2491 if (iso9660->re_files.first != NULL && 2492 iso9660->rr_moved != NULL && 2493 iso9660->rr_moved->rr_moved_has_re_only) 2494 /* Expose "rr_moved" entry. */ 2495 cache_add_entry(iso9660, iso9660->rr_moved); 2496 while ((re = re_get_entry(iso9660)) != NULL) { 2497 /* Expose its descendant dirs. */ 2498 while ((d = rede_get_entry(re)) != NULL) 2499 cache_add_entry(iso9660, d); 2500 } 2501 if (iso9660->cache_files.first != NULL) 2502 return (next_cache_entry(a, iso9660, pfile)); 2503 return (ARCHIVE_EOF); 2504 } 2505 2506 if (file->cl_offset) { 2507 struct file_info *first_re = NULL; 2508 int nexted_re = 0; 2509 2510 /* 2511 * Find "RE" dir for the current file, which 2512 * has "CL" flag. 2513 */ 2514 while ((re = re_get_entry(iso9660)) 2515 != first_re) { 2516 if (first_re == NULL) 2517 first_re = re; 2518 if (re->offset == file->cl_offset) { 2519 re->parent->subdirs--; 2520 re->parent = file->parent; 2521 re->re = 0; 2522 if (re->parent->re_descendant) { 2523 nexted_re = 1; 2524 re->re_descendant = 1; 2525 if (rede_add_entry(re) < 0) 2526 goto fatal_rr; 2527 /* Move a list of descendants 2528 * to a new ancestor. */ 2529 while ((d = rede_get_entry( 2530 re)) != NULL) 2531 if (rede_add_entry(d) 2532 < 0) 2533 goto fatal_rr; 2534 break; 2535 } 2536 /* Replace the current file 2537 * with "RE" dir */ 2538 *pfile = file = re; 2539 /* Expose its descendant */ 2540 while ((d = rede_get_entry( 2541 file)) != NULL) 2542 cache_add_entry( 2543 iso9660, d); 2544 break; 2545 } else 2546 re_add_entry(iso9660, re); 2547 } 2548 if (nexted_re) { 2549 /* 2550 * Do not expose this at this time 2551 * because we have not gotten its full-path 2552 * name yet. 2553 */ 2554 continue; 2555 } 2556 } else if ((file->mode & AE_IFMT) == AE_IFDIR) { 2557 int r; 2558 2559 /* Read file entries in this dir. */ 2560 r = read_children(a, file); 2561 if (r != ARCHIVE_OK) 2562 return (r); 2563 2564 /* 2565 * Handle a special dir of Rockridge extensions, 2566 * "rr_moved". 2567 */ 2568 if (file->rr_moved) { 2569 /* 2570 * If this has only the subdirectories which 2571 * have "RE" flags, do not expose at this time. 2572 */ 2573 if (file->rr_moved_has_re_only) 2574 continue; 2575 /* Otherwise expose "rr_moved" entry. */ 2576 } else if (file->re) { 2577 /* 2578 * Do not expose this at this time 2579 * because we have not gotten its full-path 2580 * name yet. 2581 */ 2582 re_add_entry(iso9660, file); 2583 continue; 2584 } else if (file->re_descendant) { 2585 /* 2586 * If the top level "RE" entry of this entry 2587 * is not exposed, we, accordingly, should not 2588 * expose this entry at this time because 2589 * we cannot make its proper full-path name. 2590 */ 2591 if (rede_add_entry(file) == 0) 2592 continue; 2593 /* Otherwise we can expose this entry because 2594 * it seems its top level "RE" has already been 2595 * exposed. */ 2596 } 2597 } 2598 break; 2599 } 2600 2601 if ((file->mode & AE_IFMT) != AE_IFREG || file->number == -1) 2602 return (ARCHIVE_OK); 2603 2604 count = 0; 2605 number = file->number; 2606 iso9660->cache_files.first = NULL; 2607 iso9660->cache_files.last = &(iso9660->cache_files.first); 2608 empty_files.first = NULL; 2609 empty_files.last = &empty_files.first; 2610 /* Collect files which has the same file serial number. 2611 * Peek pending_files so that file which number is different 2612 * is not put bak. */ 2613 while (iso9660->pending_files.used > 0 && 2614 (iso9660->pending_files.files[0]->number == -1 || 2615 iso9660->pending_files.files[0]->number == number)) { 2616 if (file->number == -1) { 2617 /* This file has the same offset 2618 * but it's wrong offset which empty files 2619 * and symlink files have. 2620 * NOTE: This wrong offse was recorded by 2621 * old mkisofs utility. If ISO images is 2622 * created by latest mkisofs, this does not 2623 * happen. 2624 */ 2625 file->next = NULL; 2626 *empty_files.last = file; 2627 empty_files.last = &(file->next); 2628 } else { 2629 count++; 2630 cache_add_entry(iso9660, file); 2631 } 2632 file = next_entry(iso9660); 2633 } 2634 2635 if (count == 0) { 2636 *pfile = file; 2637 return ((file == NULL)?ARCHIVE_EOF:ARCHIVE_OK); 2638 } 2639 if (file->number == -1) { 2640 file->next = NULL; 2641 *empty_files.last = file; 2642 empty_files.last = &(file->next); 2643 } else { 2644 count++; 2645 cache_add_entry(iso9660, file); 2646 } 2647 2648 if (count > 1) { 2649 /* The count is the same as number of hardlink, 2650 * so much so that each nlinks of files in cache_file 2651 * is overwritten by value of the count. 2652 */ 2653 for (file = iso9660->cache_files.first; 2654 file != NULL; file = file->next) 2655 file->nlinks = count; 2656 } 2657 /* If there are empty files, that files are added 2658 * to the tail of the cache_files. */ 2659 if (empty_files.first != NULL) { 2660 *iso9660->cache_files.last = empty_files.first; 2661 iso9660->cache_files.last = empty_files.last; 2662 } 2663 *pfile = cache_get_entry(iso9660); 2664 return ((*pfile == NULL)?ARCHIVE_EOF:ARCHIVE_OK); 2665 2666fatal_rr: 2667 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC, 2668 "Failed to connect 'CL' pointer to 'RE' rr_moved pointer of" 2669 "Rockridge extensions"); 2670 return (ARCHIVE_FATAL); 2671} 2672 2673static inline void 2674re_add_entry(struct iso9660 *iso9660, struct file_info *file) 2675{ 2676 file->re_next = NULL; 2677 *iso9660->re_files.last = file; 2678 iso9660->re_files.last = &(file->re_next); 2679} 2680 2681static inline struct file_info * 2682re_get_entry(struct iso9660 *iso9660) 2683{ 2684 struct file_info *file; 2685 2686 if ((file = iso9660->re_files.first) != NULL) { 2687 iso9660->re_files.first = file->re_next; 2688 if (iso9660->re_files.first == NULL) 2689 iso9660->re_files.last = 2690 &(iso9660->re_files.first); 2691 } 2692 return (file); 2693} 2694 2695static inline int 2696rede_add_entry(struct file_info *file) 2697{ 2698 struct file_info *re; 2699 2700 re = file->parent; 2701 while (re != NULL && !re->re) { 2702 /* Sanity check to prevent a infinity loop 2703 * cause by a currupted iso file. */ 2704 if (re->loop_by == file) 2705 return (-1); 2706 re->loop_by = file; 2707 re = re->parent; 2708 } 2709 if (re == NULL) 2710 return (-1); 2711 2712 file->re_next = NULL; 2713 *re->rede_files.last = file; 2714 re->rede_files.last = &(file->re_next); 2715 return (0); 2716} 2717 2718static inline struct file_info * 2719rede_get_entry(struct file_info *re) 2720{ 2721 struct file_info *file; 2722 2723 if ((file = re->rede_files.first) != NULL) { 2724 re->rede_files.first = file->re_next; 2725 if (re->rede_files.first == NULL) 2726 re->rede_files.last = 2727 &(re->rede_files.first); 2728 } 2729 return (file); 2730} 2731 2732static inline void 2733cache_add_entry(struct iso9660 *iso9660, struct file_info *file) 2734{ 2735 file->next = NULL; 2736 *iso9660->cache_files.last = file; 2737 iso9660->cache_files.last = &(file->next); 2738} 2739 2740static inline struct file_info * 2741cache_get_entry(struct iso9660 *iso9660) 2742{ 2743 struct file_info *file; 2744 2745 if ((file = iso9660->cache_files.first) != NULL) { 2746 iso9660->cache_files.first = file->next; 2747 if (iso9660->cache_files.first == NULL) 2748 iso9660->cache_files.last = &(iso9660->cache_files.first); 2749 } 2750 return (file); 2751} 2752 2753static void 2754heap_add_entry(struct heap_queue *heap, struct file_info *file, uint64_t key) 2755{ 2756 uint64_t file_key, parent_key; 2757 int hole, parent; 2758 2759 /* Expand our pending files list as necessary. */ 2760 if (heap->used >= heap->allocated) { 2761 struct file_info **new_pending_files; 2762 int new_size = heap->allocated * 2; 2763 2764 if (heap->allocated < 1024) 2765 new_size = 1024; 2766 /* Overflow might keep us from growing the list. */ 2767 if (new_size <= heap->allocated) 2768 __archive_errx(1, "Out of memory"); 2769 new_pending_files = (struct file_info **) 2770 malloc(new_size * sizeof(new_pending_files[0])); 2771 if (new_pending_files == NULL) 2772 __archive_errx(1, "Out of memory"); 2773 memcpy(new_pending_files, heap->files, 2774 heap->allocated * sizeof(new_pending_files[0])); 2775 if (heap->files != NULL) 2776 free(heap->files); 2777 heap->files = new_pending_files; 2778 heap->allocated = new_size; 2779 } 2780 2781 file_key = file->key = key; 2782 2783 /* 2784 * Start with hole at end, walk it up tree to find insertion point. 2785 */ 2786 hole = heap->used++; 2787 while (hole > 0) { 2788 parent = (hole - 1)/2; 2789 parent_key = heap->files[parent]->key; 2790 if (file_key >= parent_key) { 2791 heap->files[hole] = file; 2792 return; 2793 } 2794 // Move parent into hole <==> move hole up tree. 2795 heap->files[hole] = heap->files[parent]; 2796 hole = parent; 2797 } 2798 heap->files[0] = file; 2799} 2800 2801static struct file_info * 2802heap_get_entry(struct heap_queue *heap) 2803{ 2804 uint64_t a_key, b_key, c_key; 2805 int a, b, c; 2806 struct file_info *r, *tmp; 2807 2808 if (heap->used < 1) 2809 return (NULL); 2810 2811 /* 2812 * The first file in the list is the earliest; we'll return this. 2813 */ 2814 r = heap->files[0]; 2815 2816 /* 2817 * Move the last item in the heap to the root of the tree 2818 */ 2819 heap->files[0] = heap->files[--(heap->used)]; 2820 2821 /* 2822 * Rebalance the heap. 2823 */ 2824 a = 0; // Starting element and its heap key 2825 a_key = heap->files[a]->key; 2826 for (;;) { 2827 b = a + a + 1; // First child 2828 if (b >= heap->used) 2829 return (r); 2830 b_key = heap->files[b]->key; 2831 c = b + 1; // Use second child if it is smaller. 2832 if (c < heap->used) { 2833 c_key = heap->files[c]->key; 2834 if (c_key < b_key) { 2835 b = c; 2836 b_key = c_key; 2837 } 2838 } 2839 if (a_key <= b_key) 2840 return (r); 2841 tmp = heap->files[a]; 2842 heap->files[a] = heap->files[b]; 2843 heap->files[b] = tmp; 2844 a = b; 2845 } 2846} 2847 2848static unsigned int 2849toi(const void *p, int n) 2850{ 2851 const unsigned char *v = (const unsigned char *)p; 2852 if (n > 1) 2853 return v[0] + 256 * toi(v + 1, n - 1); 2854 if (n == 1) 2855 return v[0]; 2856 return (0); 2857} 2858 2859static time_t 2860isodate7(const unsigned char *v) 2861{ 2862 struct tm tm; 2863 int offset; 2864 memset(&tm, 0, sizeof(tm)); 2865 tm.tm_year = v[0]; 2866 tm.tm_mon = v[1] - 1; 2867 tm.tm_mday = v[2]; 2868 tm.tm_hour = v[3]; 2869 tm.tm_min = v[4]; 2870 tm.tm_sec = v[5]; 2871 /* v[6] is the signed timezone offset, in 1/4-hour increments. */ 2872 offset = ((const signed char *)v)[6]; 2873 if (offset > -48 && offset < 52) { 2874 tm.tm_hour -= offset / 4; 2875 tm.tm_min -= (offset % 4) * 15; 2876 } 2877 return (time_from_tm(&tm)); 2878} 2879 2880static time_t 2881isodate17(const unsigned char *v) 2882{ 2883 struct tm tm; 2884 int offset; 2885 memset(&tm, 0, sizeof(tm)); 2886 tm.tm_year = (v[0] - '0') * 1000 + (v[1] - '0') * 100 2887 + (v[2] - '0') * 10 + (v[3] - '0') 2888 - 1900; 2889 tm.tm_mon = (v[4] - '0') * 10 + (v[5] - '0'); 2890 tm.tm_mday = (v[6] - '0') * 10 + (v[7] - '0'); 2891 tm.tm_hour = (v[8] - '0') * 10 + (v[9] - '0'); 2892 tm.tm_min = (v[10] - '0') * 10 + (v[11] - '0'); 2893 tm.tm_sec = (v[12] - '0') * 10 + (v[13] - '0'); 2894 /* v[16] is the signed timezone offset, in 1/4-hour increments. */ 2895 offset = ((const signed char *)v)[16]; 2896 if (offset > -48 && offset < 52) { 2897 tm.tm_hour -= offset / 4; 2898 tm.tm_min -= (offset % 4) * 15; 2899 } 2900 return (time_from_tm(&tm)); 2901} 2902 2903static time_t 2904time_from_tm(struct tm *t) 2905{ 2906#if HAVE_TIMEGM 2907 /* Use platform timegm() if available. */ 2908 return (timegm(t)); 2909#else 2910 /* Else use direct calculation using POSIX assumptions. */ 2911 /* First, fix up tm_yday based on the year/month/day. */ 2912 mktime(t); 2913 /* Then we can compute timegm() from first principles. */ 2914 return (t->tm_sec + t->tm_min * 60 + t->tm_hour * 3600 2915 + t->tm_yday * 86400 + (t->tm_year - 70) * 31536000 2916 + ((t->tm_year - 69) / 4) * 86400 - 2917 ((t->tm_year - 1) / 100) * 86400 2918 + ((t->tm_year + 299) / 400) * 86400); 2919#endif 2920} 2921 2922static const char * 2923build_pathname(struct archive_string *as, struct file_info *file) 2924{ 2925 if (file->parent != NULL && archive_strlen(&file->parent->name) > 0) { 2926 build_pathname(as, file->parent); 2927 archive_strcat(as, "/"); 2928 } 2929 if (archive_strlen(&file->name) == 0) 2930 archive_strcat(as, "."); 2931 else 2932 archive_string_concat(as, &file->name); 2933 return (as->s); 2934} 2935 2936#if DEBUG 2937static void 2938dump_isodirrec(FILE *out, const unsigned char *isodirrec) 2939{ 2940 fprintf(out, " l %d,", 2941 toi(isodirrec + DR_length_offset, DR_length_size)); 2942 fprintf(out, " a %d,", 2943 toi(isodirrec + DR_ext_attr_length_offset, DR_ext_attr_length_size)); 2944 fprintf(out, " ext 0x%x,", 2945 toi(isodirrec + DR_extent_offset, DR_extent_size)); 2946 fprintf(out, " s %d,", 2947 toi(isodirrec + DR_size_offset, DR_extent_size)); 2948 fprintf(out, " f 0x%02x,", 2949 toi(isodirrec + DR_flags_offset, DR_flags_size)); 2950 fprintf(out, " u %d,", 2951 toi(isodirrec + DR_file_unit_size_offset, DR_file_unit_size_size)); 2952 fprintf(out, " ilv %d,", 2953 toi(isodirrec + DR_interleave_offset, DR_interleave_size)); 2954 fprintf(out, " seq %d,", 2955 toi(isodirrec + DR_volume_sequence_number_offset, DR_volume_sequence_number_size)); 2956 fprintf(out, " nl %d:", 2957 toi(isodirrec + DR_name_len_offset, DR_name_len_size)); 2958 fprintf(out, " `%.*s'", 2959 toi(isodirrec + DR_name_len_offset, DR_name_len_size), isodirrec + DR_name_offset); 2960} 2961#endif 2962