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