1 /*-
2  * Copyright (c) 2003-2011 Tim Kientzle
3  * All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions
7  * are met:
8  * 1. Redistributions of source code must retain the above copyright
9  *    notice, this list of conditions and the following disclaimer.
10  * 2. Redistributions in binary form must reproduce the above copyright
11  *    notice, this list of conditions and the following disclaimer in the
12  *    documentation and/or other materials provided with the distribution.
13  *
14  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) ``AS IS'' AND ANY EXPRESS OR
15  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
16  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
17  * IN NO EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY DIRECT, INDIRECT,
18  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
19  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
20  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
21  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
23  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
24  */
25 
26 #include "archive_platform.h"
27 __FBSDID("$FreeBSD: head/lib/libarchive/archive_read_support_format_all.c 174991 2007-12-30 04:58:22Z kientzle $");
28 
29 #include "archive.h"
30 #include "archive_private.h"
31 
32 int
33 archive_read_support_format_all(struct archive *a)
34 {
35 	archive_check_magic(a, ARCHIVE_READ_MAGIC,
36 	    ARCHIVE_STATE_NEW, "archive_read_support_format_all");
37 
38 	/* TODO: It would be nice to compute the ordering
39 	 * here automatically so that people who enable just
40 	 * a few formats can still get the benefits.  That
41 	 * may just require the format registration to include
42 	 * a "maximum read-ahead" value (anything that uses seek
43 	 * would be essentially infinite read-ahead).  The core
44 	 * bid management can then sort the bidders before calling
45 	 * them.
46 	 *
47 	 * If you implement the above, please return the list below
48 	 * to alphabetic order.
49 	 */
50 
51 	/*
52 	 * These bidders are all pretty cheap; they just examine a
53 	 * small initial part of the archive.  If one of these bids
54 	 * high, we can maybe avoid running any of the more expensive
55 	 * bidders below.
56 	 */
57 	archive_read_support_format_ar(a);
58 	archive_read_support_format_cpio(a);
59 	archive_read_support_format_empty(a);
60 	archive_read_support_format_lha(a);
61 	archive_read_support_format_mtree(a);
62 	archive_read_support_format_tar(a);
63 	archive_read_support_format_xar(a);
64 
65 	/*
66 	 * Install expensive bidders last.  By doing them last, we
67 	 * increase the chance that a high bid from someone else will
68 	 * make it unnecessary for these to do anything at all.
69 	 */
70 	/* These three have potentially large look-ahead. */
71 	archive_read_support_format_7zip(a);
72 	archive_read_support_format_cab(a);
73 	archive_read_support_format_rar(a);
74 	archive_read_support_format_iso9660(a);
75 	/* Seek is really bad, since it forces the read-ahead
76 	 * logic to discard buffered data. */
77 	archive_read_support_format_zip(a);
78 
79 	/* Note: We always return ARCHIVE_OK here, even if some of the
80 	 * above return ARCHIVE_WARN.  The intent here is to enable
81 	 * "as much as possible."  Clients who need specific
82 	 * compression should enable those individually so they can
83 	 * verify the level of support. */
84 	/* Clear any warning messages set by the above functions. */
85 	archive_clear_error(a);
86 	return (ARCHIVE_OK);
87 }
88