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 28 #include "archive.h" 29 #include "archive_private.h" 30 31 int 32 archive_read_support_format_all(struct archive *a) 33 { 34 archive_check_magic(a, ARCHIVE_READ_MAGIC, 35 ARCHIVE_STATE_NEW, "archive_read_support_format_all"); 36 37 /* TODO: It would be nice to compute the ordering 38 * here automatically so that people who enable just 39 * a few formats can still get the benefits. That 40 * may just require the format registration to include 41 * a "maximum read-ahead" value (anything that uses seek 42 * would be essentially infinite read-ahead). The core 43 * bid management can then sort the bidders before calling 44 * them. 45 * 46 * If you implement the above, please return the list below 47 * to alphabetic order. 48 */ 49 50 /* 51 * These bidders are all pretty cheap; they just examine a 52 * small initial part of the archive. If one of these bids 53 * high, we can maybe avoid running any of the more expensive 54 * bidders below. 55 */ 56 archive_read_support_format_ar(a); 57 archive_read_support_format_cpio(a); 58 archive_read_support_format_empty(a); 59 archive_read_support_format_lha(a); 60 archive_read_support_format_mtree(a); 61 archive_read_support_format_tar(a); 62 archive_read_support_format_xar(a); 63 archive_read_support_format_warc(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 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_rar5(a); 75 archive_read_support_format_iso9660(a); 76 /* Seek is really bad, since it forces the read-ahead 77 * logic to discard buffered data. */ 78 archive_read_support_format_zip(a); 79 80 /* Note: We always return ARCHIVE_OK here, even if some of the 81 * above return ARCHIVE_WARN. The intent here is to enable 82 * "as much as possible." Clients who need specific 83 * compression should enable those individually so they can 84 * verify the level of support. */ 85 /* Clear any warning messages set by the above functions. */ 86 archive_clear_error(a); 87 return (ARCHIVE_OK); 88 } 89