1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242
// bindet - Fast binary file type detection
//
// The MIT License (MIT)
//
// Copyright (c) Obliter Software (https://github.com/oblitersoftware/)
// Copyright (c) contributors
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
//! Description module
use crate::matcher::RelativePosition;
use crate::types::FileType;
/// Trait implemented for [FileType] to describe the marker characteristics.
///
/// ## Block-size
///
/// Describes how much of data must be buffered in order to try an initial detection
/// of the file type.
///
/// **bindet** defines two kinds of block-size: **small** and **large**
///
/// ### Small block-size
///
/// Small block sizes are buffered directly into memory and should reach 1MB in size,
/// this allows a fast-path for detecting file types without the cost of doing “larger read requests”
/// to the [`Reader`][std::io::Read].
///
/// ### Large block-size
///
/// Larger block-sizes may or may not be buffered directly into memory, they can exceed the 1MB rule
/// and are used as a secondary way to try to detect a file type, when the fast-path does not yield
/// any perfect match.
///
/// Those blocks can be buffered into memory if they are not huge, since file types markers does not
/// exceed this size as well, but sometimes they can appear anywhere between the start of the buffer
/// and a fixed size range, so instead of doing an entire file-scan, we take the `largest block size`
/// and buffer it into an array, which can be scanned to find the file type.
///
/// This is not done in the first try because we want to pay only for what we use, if we are detecting
/// file types that have small markers, that appear at the start of the file, we do not need to buffer
/// larger data into memory just to throw 90% of the data.
pub trait FileTypeDescription {
/// Smallest block size to start with and try to detect this file
///
/// When this function returns [Option::None], it does mean that there is no detection
/// strategy for the provided `relative_position`
///
/// It is important to note that, when [`largest_block_size`](FileTypeDescription::largest_block_size)
/// do return a value but this function
/// don't, it does mean that the strategy is based only on `largest block size`, the inverse
/// applies as well.
///
/// File types that does not support or does not need the detection starting from the end must
/// return [Option::None] when `relative_position` is [RelativePosition::End].
fn smallest_block_size(&self, relative_position: &RelativePosition) -> Option<usize>;
/// Returns the ideal block size to start with and the [`filetypes`](FileType::variants) that has
/// an starting block size.
///
/// The ideal initial block size is the max of [`smallest block size`](FileTypeDescription::smallest_block_size)
/// of all [FileType] variants.
///
/// In other words, returns the largest block size from all smallest ones of [`filetypes`](FileType::variants).
fn ideal_block_size(relative_position: &RelativePosition) -> Option<(usize, Vec<FileType>)>;
/// Returns the ideal block size to start with and the [`filetypes`](FileType::variants) that has
/// an starting block size.
///
/// The ideal initial block size is the max of [`smallest block size`](FileTypeDescription::smallest_block_size)
/// of all [FileType] variants.
///
/// In other words, returns the largest block size from all smallest ones of [`filetypes`](FileType::variants).
fn ideal_block_size_of_variants(
relative_position: &RelativePosition,
variants: &[FileType],
) -> Option<(usize, Vec<FileType>)>;
/// Returns the maximum block size to try when [`ideal block size`](FileTypeDescription::ideal_block_size)
/// is not enough, along with the [`filetypes`](FileType::variants) that has large block sizes.
///
/// In other words, returns the largest block size from all largest ones of [`filetypes`](FileType::variants).
fn maximum_block_size(relative_position: &RelativePosition) -> Option<(usize, Vec<FileType>)>;
/// Returns the maximum block size to try when [`ideal block size`](FileTypeDescription::ideal_block_size)
/// is not enough, along with the [`filetypes`](FileType::variants) that has large block sizes.
///
/// In other words, returns the largest block size from all largest ones of [`filetypes`](FileType::variants).
fn maximum_block_size_of_variants(
relative_position: &RelativePosition,
variants: &[FileType],
) -> Option<(usize, Vec<FileType>)>;
/// Largest block size to start with and try to detect this file
///
/// When this function returns [Option::None], it does mean that there is no detection
/// strategy for the provided `relative_position`.
///
/// It is important to note that, when [`smallest_block_size`](FileTypeDescription::smallest_block_size)
/// do return a value but this function
/// don't, it does mean that the strategy is based only on `smallest block size`, the inverse
/// applies as well.
///
/// File types that does not support or does not need the detection starting from the end must
/// return [Option::None] when `relative_position` is [RelativePosition::End].
fn largest_block_size(&self, relative_position: &RelativePosition) -> Option<usize>;
}
const MEGABYTE: usize = 1 * 1024 * 1024;
impl FileTypeDescription for FileType {
fn smallest_block_size(&self, relative_position: &RelativePosition) -> Option<usize> {
if (*relative_position) == RelativePosition::Start {
match self {
// https://en.wikipedia.org/wiki/ZIP_(file_format)#Local_file_header
FileType::Zip => Some(4),
// https://www.rarlab.com/technote.htm
FileType::Rar => Some(7),
// https://www.rarlab.com/technote.htm
FileType::Rar5 => Some(8),
// https://www.gnu.org/software/tar/manual/html_node/Standard.html
FileType::Tar => Some(257 + 8),
// https://www.w3.org/TR/PNG-Rationale.html#R.PNG-file-signature
FileType::Png => Some(8),
// https://en.wikipedia.org/wiki/JPEG#Syntax_and_structure
FileType::Jpg => Some(2),
// https://metacpan.org/release/BJOERN/Compress-Deflate7-1.0/source/7zip/DOC/7zFormat.txt#L171
FileType::_7z => Some(6),
// https://datatracker.ietf.org/doc/html/rfc7845
FileType::Opus => Some(36),
// http://web.mit.edu/cfox/share/doc/libvorbis-1.0/vorbis-spec-ref.html
FileType::Vorbis => Some(35),
FileType::Mp3 => Some(2),
FileType::Webp => Some(12),
FileType::Flac => Some(4),
FileType::Matroska => Some(4),
FileType::Wasm => Some(4),
FileType::Class => Some(4),
FileType::Elf => Some(4),
FileType::Wav => Some(12),
FileType::Avi => Some(12),
FileType::Aiff => Some(12),
FileType::Tiff => Some(4),
FileType::Sqlite3 => Some(16),
FileType::Ico => Some(4),
}
} else {
match self {
// https://en.wikipedia.org/wiki/ZIP_(file_format)#End_of_central_directory_record_(EOCD)
FileType::Zip => Some(22),
// For those files, we do not need to read the end
_ => None,
}
}
}
fn ideal_block_size(relative_position: &RelativePosition) -> Option<(usize, Vec<FileType>)> {
coerce_file_types_at_least(
|variant| variant.smallest_block_size(relative_position),
&FileType::variants(),
)
}
fn ideal_block_size_of_variants(
relative_position: &RelativePosition,
variants: &[FileType],
) -> Option<(usize, Vec<FileType>)> {
coerce_file_types_at_least(
|variant| variant.smallest_block_size(relative_position),
variants,
)
}
fn maximum_block_size(relative_position: &RelativePosition) -> Option<(usize, Vec<FileType>)> {
coerce_file_types_at_least(
|variant| variant.largest_block_size(relative_position),
&FileType::variants(),
)
}
fn maximum_block_size_of_variants(
relative_position: &RelativePosition,
variants: &[FileType],
) -> Option<(usize, Vec<FileType>)> {
coerce_file_types_at_least(
|variant| variant.largest_block_size(relative_position),
variants,
)
}
fn largest_block_size(&self, relative_position: &RelativePosition) -> Option<usize> {
if *relative_position == RelativePosition::Start {
match self {
// https://www.rarlab.com/technote.htm
FileType::Rar => Some(MEGABYTE),
// https://www.rarlab.com/technote.htm
FileType::Rar5 => Some(MEGABYTE),
_ => None,
}
} else {
None
}
}
}
/// Coerce to the maximum value of all [filetypes](FileType::variants) using [`f`][F] to compute
/// the values to compare between.
fn coerce_file_types_at_least<F>(f: F, variants: &[FileType]) -> Option<(usize, Vec<FileType>)>
where
F: Fn(&FileType) -> Option<usize>,
{
let matches: Vec<(FileType, usize)> = variants
.iter()
.map(|variant| f(variant).map(|block_size| (*variant, block_size)))
.filter(|f| f.is_some())
.map(|f| f.unwrap())
.collect();
let size = matches.iter().max_by(|l, r| l.1.cmp(&r.1));
let types: Vec<FileType> = matches.iter().map(|f| f.0).collect();
return if let Some(size_type_pair) = size {
Some((size_type_pair.1, types))
} else {
None
};
}