mirror of
https://github.com/storytold/pdfcraft.git
synced 2026-11-03 06:51:50 -06:00
1155 lines
37 KiB
Rust
1155 lines
37 KiB
Rust
//! Reading and querying the xref table of a PDF file.
|
|
|
|
use crate::crypto::{DecryptionError, DecryptionTarget, Decryptor, get};
|
|
use crate::data::Data;
|
|
use crate::metadata::Metadata;
|
|
use crate::object::Name;
|
|
use crate::object::ObjectIdentifier;
|
|
use crate::object::Stream;
|
|
use crate::object::dict::keys::{
|
|
AUTHOR, CREATION_DATE, CREATOR, ENCRYPT, FIRST, ID, INDEX, INFO, KEYWORDS, MOD_DATE, N,
|
|
OCPROPERTIES, PAGES, PREV, PRODUCER, ROOT, SIZE, SUBJECT, TITLE, TYPE, VERSION, W, XREF_STM,
|
|
};
|
|
use crate::object::dict::probe_dict;
|
|
use crate::object::indirect::IndirectObject;
|
|
use crate::object::{Array, MaybeRef};
|
|
use crate::object::{DateTime, Dict};
|
|
use crate::object::{Object, ObjectLike};
|
|
use crate::pdf::PdfVersion;
|
|
use crate::reader::Reader;
|
|
use crate::reader::{Readable, ReaderContext, ReaderExt};
|
|
use crate::sync::{Arc, FxHashMap, RwLock, RwLockExt};
|
|
use crate::trivia::is_white_space_character;
|
|
use crate::util::findr_needle;
|
|
use crate::{PdfData, object};
|
|
use alloc::collections::BTreeSet;
|
|
use alloc::vec;
|
|
use alloc::vec::Vec;
|
|
use core::cmp::max;
|
|
use core::iter;
|
|
use core::ops::Deref;
|
|
|
|
pub(crate) const XREF_ENTRY_LEN: usize = 20;
|
|
|
|
#[derive(Debug, Copy, Clone)]
|
|
pub(crate) enum XRefError {
|
|
Unknown,
|
|
Encryption(DecryptionError),
|
|
}
|
|
|
|
/// Parse the "root" xref from the PDF.
|
|
pub(crate) fn root_xref(data: PdfData, password: &[u8]) -> Result<XRef, XRefError> {
|
|
let mut xref_map = FxHashMap::default();
|
|
let xref_pos = find_last_xref_pos(data.as_ref()).ok_or(XRefError::Unknown)?;
|
|
let trailer =
|
|
populate_xref_impl(data.as_ref(), xref_pos, &mut xref_map).ok_or(XRefError::Unknown)?;
|
|
|
|
XRef::new(
|
|
data.clone(),
|
|
xref_map,
|
|
XRefInput::TrailerDictData(trailer),
|
|
false,
|
|
password,
|
|
)
|
|
}
|
|
|
|
/// Try to manually parse the PDF to build an xref table and trailer dictionary.
|
|
pub(crate) fn fallback(data: PdfData, password: &[u8]) -> Option<XRef> {
|
|
warn!("xref table was invalid, trying to manually build xref table");
|
|
let (xref_map, xref_input) = fallback_xref_map(&data, password);
|
|
|
|
if let Some(xref_input) = xref_input {
|
|
warn!("rebuild xref table with {} entries", xref_map.len());
|
|
|
|
XRef::new(data.clone(), xref_map, xref_input, true, password).ok()
|
|
} else {
|
|
warn!("couldn't find trailer dictionary, failed to rebuild xref table");
|
|
|
|
None
|
|
}
|
|
}
|
|
|
|
fn fallback_xref_map<'a>(data: &'a PdfData, password: &[u8]) -> (XrefMap, Option<XRefInput<'a>>) {
|
|
fallback_xref_map_inner(data, ReaderContext::dummy(), true, password)
|
|
}
|
|
|
|
fn fallback_xref_map_inner<'a>(
|
|
data: &'a PdfData,
|
|
mut dummy_ctx: ReaderContext<'a>,
|
|
recurse: bool,
|
|
password: &[u8],
|
|
) -> (XrefMap, Option<XRefInput<'a>>) {
|
|
let mut xref_map = FxHashMap::default();
|
|
let mut trailer_dicts = vec![];
|
|
let mut root_ref = None;
|
|
|
|
let mut r = Reader::new(data.as_ref());
|
|
|
|
let mut last_obj_num = None;
|
|
|
|
loop {
|
|
let cur_pos = r.offset();
|
|
|
|
let mut old_r = r.clone();
|
|
|
|
// First try to check if we have an object identifier.
|
|
if r.peek_byte().is_some_and(|b: u8| b.is_ascii_digit()) {
|
|
if let Some(obj_id) = r.read::<ObjectIdentifier>(&dummy_ctx) {
|
|
let mut cloned = r.clone();
|
|
// Check that the object following it is actually valid before inserting it.
|
|
cloned.skip_white_spaces_and_comments();
|
|
if cloned.skip::<Object<'_>>(false).is_some() {
|
|
xref_map.insert(obj_id, EntryType::Normal(cur_pos));
|
|
last_obj_num = Some(obj_id);
|
|
dummy_ctx.set_obj_number(obj_id);
|
|
}
|
|
} else {
|
|
// There must be a white space before the next object number.
|
|
r.forward_while(|b| !is_white_space_character(b));
|
|
}
|
|
} else {
|
|
// Then, try to check whether we have a dictionary, in particular a trailer
|
|
// dictionary.
|
|
let mut probe_reader = r.clone();
|
|
if r.peek_bytes(2).is_some_and(|b| b == b"<<")
|
|
&& let Some(probe) =
|
|
{ probe_dict(&mut probe_reader, &dummy_ctx, Some(b"<<"), b">>") }
|
|
{
|
|
r = probe_reader;
|
|
if probe.has_root || probe.has_type {
|
|
let mut dict_reader = Reader::new(probe.data);
|
|
if let Some(dict) = dict_reader.read_with_context::<Dict<'_>>(&dummy_ctx) {
|
|
if probe.has_root && dict.contains_key(ROOT) {
|
|
trailer_dicts.push(dict.clone());
|
|
}
|
|
|
|
if dict
|
|
.get::<Name<'_>>(TYPE)
|
|
.is_some_and(|n| n.as_str() == "Catalog")
|
|
{
|
|
root_ref = last_obj_num;
|
|
}
|
|
|
|
if let Some(stream) = old_r.read::<Stream<'_>>(&dummy_ctx)
|
|
&& dict.get::<Name<'_>>(TYPE).as_deref() == Some(b"ObjStm")
|
|
&& let Some(data) = stream.decoded().ok()
|
|
&& let Some(last_obj_num) = last_obj_num
|
|
&& let Some(obj_stream) = ObjectStream::new(stream, &data, &dummy_ctx)
|
|
{
|
|
for (idx, (obj_num, _)) in obj_stream.offsets.iter().enumerate() {
|
|
let id = ObjectIdentifier::new(*obj_num as i32, 0);
|
|
// If we already found an entry for that object number that was not
|
|
// inside an object stream. Somewhat arbitrary and maybe
|
|
// we can do better, but that seems to work for the current
|
|
// set of tests.
|
|
if xref_map
|
|
.get(&id)
|
|
.is_none_or(|e| !matches!(e, &EntryType::Normal(_)))
|
|
{
|
|
xref_map.insert(
|
|
id,
|
|
EntryType::ObjStream(
|
|
last_obj_num.obj_number as u32,
|
|
idx as u32,
|
|
),
|
|
);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
} else {
|
|
// We can skip everything until the next white space character,
|
|
// as there cannot possibly be any new dictionary/object identifier
|
|
// until then.
|
|
let old_pos = r.offset;
|
|
r.forward_while(|b| !is_white_space_character(b));
|
|
if r.offset == old_pos {
|
|
r.read_byte();
|
|
}
|
|
}
|
|
}
|
|
|
|
if r.at_end() {
|
|
break;
|
|
}
|
|
}
|
|
|
|
// Try to choose the right trailer dict by doing basic validation.
|
|
let mut trailer_dict = None;
|
|
|
|
for dict in trailer_dicts {
|
|
if let Some(root_id) = dict.get_raw::<Dict<'_>>(ROOT) {
|
|
let check = |dict: &Dict<'_>| -> bool { dict.contains_key(PAGES) };
|
|
|
|
match root_id {
|
|
MaybeRef::Ref(r) => match xref_map.get(&r.into()) {
|
|
Some(EntryType::Normal(offset)) => {
|
|
let mut reader = Reader::new(&data.as_ref()[*offset..]);
|
|
|
|
if let Some(obj) =
|
|
reader.read_with_context::<IndirectObject<Dict<'_>>>(&dummy_ctx)
|
|
&& {
|
|
let obj = obj.get();
|
|
check(&obj)
|
|
}
|
|
{
|
|
trailer_dict = Some(dict);
|
|
}
|
|
}
|
|
Some(EntryType::ObjStream(obj_num, idx)) => {
|
|
if let Some(EntryType::Normal(offset)) =
|
|
xref_map.get(&ObjectIdentifier::new(*obj_num as i32, 0))
|
|
{
|
|
let mut reader = Reader::new(&data.as_ref()[*offset..]);
|
|
|
|
if let Some(stream) =
|
|
reader.read_with_context::<IndirectObject<Stream<'_>>>(&dummy_ctx)
|
|
&& {
|
|
let stream = stream.get();
|
|
if let Some(data) = stream.decoded().ok()
|
|
&& let Some(object_stream) =
|
|
ObjectStream::new(stream, &data, &dummy_ctx)
|
|
&& let Some(obj) = object_stream.get::<Dict<'_>>(*idx)
|
|
{
|
|
check(&obj)
|
|
} else {
|
|
false
|
|
}
|
|
}
|
|
{
|
|
trailer_dict = Some(dict);
|
|
}
|
|
}
|
|
}
|
|
_ => {}
|
|
},
|
|
MaybeRef::NotRef(d) => {
|
|
if check(&d) {
|
|
trailer_dict = Some(dict);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
let has_encryption = trailer_dict
|
|
.as_ref()
|
|
.is_some_and(|t| t.contains_key(ENCRYPT));
|
|
|
|
if has_encryption && recurse {
|
|
// The problem is that in this case, we have used a dummy reader context which does not have
|
|
// a decryptor. Therefore, we were unable to decrypt any of the object streams and missed
|
|
// all objects that are inside of such a stream. Therefore, we need to redo the process
|
|
// using a `ReaderContext` that does have the ability to decrypt.
|
|
if let Ok(xref) = XRef::new(
|
|
data.clone(),
|
|
xref_map.clone(),
|
|
XRefInput::TrailerDictData(trailer_dict.as_ref().map(|d| d.data()).unwrap()),
|
|
true,
|
|
password,
|
|
) {
|
|
let ctx = ReaderContext::new(&xref, false);
|
|
let (patched_map, _) = fallback_xref_map_inner(data, ctx, false, password);
|
|
xref_map = patched_map;
|
|
}
|
|
}
|
|
|
|
if let Some(trailer_dict_data) = trailer_dict.map(|d| d.data()) {
|
|
(
|
|
xref_map,
|
|
Some(XRefInput::TrailerDictData(trailer_dict_data)),
|
|
)
|
|
} else if let Some(root_ref) = root_ref {
|
|
(xref_map, Some(XRefInput::RootRef(root_ref)))
|
|
} else {
|
|
(xref_map, None)
|
|
}
|
|
}
|
|
|
|
const DUMMY_XREF: XRef = XRef(Inner::Dummy);
|
|
|
|
/// An xref table.
|
|
#[derive(Debug, Clone)]
|
|
pub struct XRef(Inner);
|
|
|
|
impl XRef {
|
|
fn new(
|
|
data: PdfData,
|
|
xref_map: XrefMap,
|
|
input: XRefInput<'_>,
|
|
repaired: bool,
|
|
password: &[u8],
|
|
) -> Result<Self, XRefError> {
|
|
// This is a bit hacky, but the problem is we can't read the resolved trailer dictionary
|
|
// before we actually created the xref struct. So we first create it using dummy data
|
|
// and then populate the data.
|
|
let trailer_data = TrailerData::dummy();
|
|
|
|
let mut xref = Self(Inner::Some(Arc::new(SomeRepr {
|
|
data: Arc::new(Data::new(data)),
|
|
map: Arc::new(RwLock::new(MapRepr { xref_map, repaired })),
|
|
decryptor: Arc::new(Decryptor::None),
|
|
has_ocgs: false,
|
|
metadata: Arc::new(Metadata::default()),
|
|
trailer_data,
|
|
password: password.to_vec(),
|
|
})));
|
|
|
|
// We read the trailer twice, once to determine the encryption used and then a second
|
|
// time to resolve the catalog dictionary, etc. This allows us to support catalog dictionaries
|
|
// that are stored in an encrypted object stream.
|
|
|
|
let decryptor = {
|
|
match input {
|
|
XRefInput::TrailerDictData(trailer_dict_data) => {
|
|
let mut r = Reader::new(trailer_dict_data);
|
|
|
|
let trailer_dict = r
|
|
.read_with_context::<Dict<'_>>(&ReaderContext::new(&xref, false))
|
|
.ok_or(XRefError::Unknown)?;
|
|
|
|
get_decryptor(&trailer_dict, password)?
|
|
}
|
|
XRefInput::RootRef(_) => Decryptor::None,
|
|
}
|
|
};
|
|
|
|
match &mut xref.0 {
|
|
Inner::Dummy => unreachable!(),
|
|
Inner::Some(r) => {
|
|
let mutable = Arc::make_mut(r);
|
|
mutable.decryptor = Arc::new(decryptor.clone());
|
|
}
|
|
}
|
|
|
|
let (trailer_data, has_ocgs, metadata) = match input {
|
|
XRefInput::TrailerDictData(trailer_dict_data) => {
|
|
let mut r = Reader::new(trailer_dict_data);
|
|
|
|
let trailer_dict = r
|
|
.read_with_context::<Dict<'_>>(&ReaderContext::new(&xref, false))
|
|
.ok_or(XRefError::Unknown)?;
|
|
|
|
let root_ref = trailer_dict.get_ref(ROOT).ok_or(XRefError::Unknown)?;
|
|
let root = trailer_dict
|
|
.get::<Dict<'_>>(ROOT)
|
|
.ok_or(XRefError::Unknown)?;
|
|
let metadata = trailer_dict
|
|
.get::<Dict<'_>>(INFO)
|
|
.map(|d| parse_metadata(&d))
|
|
.unwrap_or_default();
|
|
let pages_ref = root.get_ref(PAGES).ok_or(XRefError::Unknown)?;
|
|
let has_ocgs = root.get::<Dict<'_>>(OCPROPERTIES).is_some();
|
|
let version = root
|
|
.get::<Name<'_>>(VERSION)
|
|
.and_then(|v| PdfVersion::from_bytes(v.deref()));
|
|
|
|
let td = TrailerData {
|
|
pages_ref: pages_ref.into(),
|
|
root_ref: root_ref.into(),
|
|
version,
|
|
};
|
|
|
|
(td, has_ocgs, metadata)
|
|
}
|
|
XRefInput::RootRef(root_ref) => {
|
|
let root = xref.get::<Dict<'_>>(root_ref).ok_or(XRefError::Unknown)?;
|
|
let pages_ref = root.get_ref(PAGES).ok_or(XRefError::Unknown)?;
|
|
|
|
let td = TrailerData {
|
|
pages_ref: pages_ref.into(),
|
|
root_ref,
|
|
version: None,
|
|
};
|
|
|
|
(td, false, Metadata::default())
|
|
}
|
|
};
|
|
|
|
match &mut xref.0 {
|
|
Inner::Dummy => unreachable!(),
|
|
Inner::Some(r) => {
|
|
let mutable = Arc::make_mut(r);
|
|
mutable.trailer_data = trailer_data;
|
|
mutable.decryptor = Arc::new(decryptor);
|
|
mutable.has_ocgs = has_ocgs;
|
|
mutable.metadata = Arc::new(metadata);
|
|
}
|
|
}
|
|
|
|
Ok(xref)
|
|
}
|
|
|
|
fn is_repaired(&self) -> bool {
|
|
match &self.0 {
|
|
Inner::Dummy => false,
|
|
Inner::Some(r) => {
|
|
let locked = r.map.get();
|
|
locked.repaired
|
|
}
|
|
}
|
|
}
|
|
|
|
pub(crate) fn dummy() -> &'static Self {
|
|
&DUMMY_XREF
|
|
}
|
|
|
|
pub(crate) fn len(&self) -> usize {
|
|
match &self.0 {
|
|
Inner::Dummy => 0,
|
|
Inner::Some(r) => r.map.get().xref_map.len(),
|
|
}
|
|
}
|
|
|
|
pub(crate) fn trailer_data(&self) -> &TrailerData {
|
|
match &self.0 {
|
|
Inner::Dummy => unreachable!(),
|
|
Inner::Some(r) => &r.trailer_data,
|
|
}
|
|
}
|
|
|
|
pub(crate) fn metadata(&self) -> &Metadata {
|
|
match &self.0 {
|
|
Inner::Dummy => unreachable!(),
|
|
Inner::Some(r) => &r.metadata,
|
|
}
|
|
}
|
|
|
|
/// Return the object ID of the root dictionary.
|
|
pub fn root_id(&self) -> ObjectIdentifier {
|
|
self.trailer_data().root_ref
|
|
}
|
|
|
|
/// Whether the PDF has optional content groups.
|
|
pub fn has_optional_content_groups(&self) -> bool {
|
|
match &self.0 {
|
|
Inner::Dummy => false,
|
|
Inner::Some(r) => r.has_ocgs,
|
|
}
|
|
}
|
|
|
|
pub(crate) fn objects(&self) -> impl IntoIterator<Item = Object<'_>> + '_ {
|
|
match &self.0 {
|
|
Inner::Dummy => unimplemented!(),
|
|
Inner::Some(r) => {
|
|
let locked = r.map.get();
|
|
let mut elements = locked
|
|
.xref_map
|
|
.iter()
|
|
.map(|(id, e)| {
|
|
let offset = match e {
|
|
EntryType::Normal(o) => (*o, 0),
|
|
EntryType::ObjStream(id, index) => {
|
|
if let Some(EntryType::Normal(offset)) =
|
|
locked.xref_map.get(&ObjectIdentifier::new(*id as i32, 0))
|
|
{
|
|
(*offset, *index)
|
|
} else {
|
|
(usize::MAX, 0)
|
|
}
|
|
}
|
|
};
|
|
|
|
(*id, offset)
|
|
})
|
|
.collect::<Vec<_>>();
|
|
|
|
// Try to yield in the order the objects appeared in the
|
|
// PDF.
|
|
elements.sort_by(|e1, e2| e1.1.cmp(&e2.1));
|
|
|
|
let mut iter = elements.into_iter();
|
|
|
|
iter::from_fn(move || {
|
|
for next in iter.by_ref() {
|
|
if let Some(obj) = self.get_with(next.0, &ReaderContext::new(self, false)) {
|
|
return Some(obj);
|
|
} else {
|
|
// Skip invalid objects.
|
|
continue;
|
|
}
|
|
}
|
|
|
|
None
|
|
})
|
|
}
|
|
}
|
|
}
|
|
|
|
pub(crate) fn repair(&self) {
|
|
let Inner::Some(r) = &self.0 else {
|
|
unreachable!();
|
|
};
|
|
|
|
let mut locked = r.map.try_put().unwrap();
|
|
assert!(!locked.repaired);
|
|
|
|
let (xref_map, _) = fallback_xref_map(r.data.get(), &r.password);
|
|
locked.xref_map = xref_map;
|
|
locked.repaired = true;
|
|
}
|
|
|
|
#[inline]
|
|
pub(crate) fn needs_decryption(&self, ctx: &ReaderContext<'_>) -> bool {
|
|
match &self.0 {
|
|
Inner::Dummy => false,
|
|
Inner::Some(r) => {
|
|
if matches!(r.decryptor.as_ref(), Decryptor::None) {
|
|
false
|
|
} else {
|
|
!ctx.in_content_stream() && !ctx.in_object_stream()
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
#[inline]
|
|
pub(crate) fn decrypt(
|
|
&self,
|
|
id: ObjectIdentifier,
|
|
data: &[u8],
|
|
target: DecryptionTarget,
|
|
) -> Option<Vec<u8>> {
|
|
match &self.0 {
|
|
Inner::Dummy => Some(data.to_vec()),
|
|
Inner::Some(r) => r.decryptor.decrypt(id, data, target),
|
|
}
|
|
}
|
|
|
|
/// Return the object with the given identifier.
|
|
#[allow(private_bounds)]
|
|
pub fn get<'a, T>(&'a self, id: ObjectIdentifier) -> Option<T>
|
|
where
|
|
T: ObjectLike<'a>,
|
|
{
|
|
let ctx = ReaderContext::new(self, false);
|
|
self.get_with(id, &ctx)
|
|
}
|
|
|
|
/// Return the object with the given identifier.
|
|
#[allow(private_bounds)]
|
|
pub(crate) fn get_with<'a, T>(
|
|
&'a self,
|
|
id: ObjectIdentifier,
|
|
ctx: &ReaderContext<'a>,
|
|
) -> Option<T>
|
|
where
|
|
T: ObjectLike<'a>,
|
|
{
|
|
let Inner::Some(repr) = &self.0 else {
|
|
return None;
|
|
};
|
|
|
|
let locked = repr.map.try_get().unwrap();
|
|
|
|
let mut r = Reader::new(repr.data.get().as_ref());
|
|
|
|
let entry = *locked.xref_map.get(&id).or({
|
|
// An indirect reference to an undefined object shall not be considered an error by a PDF processor; it
|
|
// shall be treated as a reference to the null object.
|
|
None
|
|
})?;
|
|
drop(locked);
|
|
|
|
let mut ctx = ctx.clone();
|
|
ctx.set_obj_number(id);
|
|
ctx.set_in_content_stream(false);
|
|
|
|
match entry {
|
|
EntryType::Normal(offset) => {
|
|
ctx.set_in_object_stream(false);
|
|
r.jump(offset);
|
|
|
|
if let Some(object) = r.read_with_context::<IndirectObject<T>>(&ctx) {
|
|
if object.id() == &id {
|
|
return Some(object.get());
|
|
}
|
|
} else {
|
|
// There is a valid object at the offset, it's just not of the type the caller
|
|
// expected, which is fine.
|
|
if r.skip::<IndirectObject<Object<'_>>>(false).is_some() {
|
|
return None;
|
|
}
|
|
};
|
|
|
|
// The xref table is broken, try to repair if not already repaired.
|
|
if self.is_repaired() {
|
|
error!(
|
|
"attempt was made at repairing xref, but object {id:?} still couldn't be read"
|
|
);
|
|
|
|
None
|
|
} else {
|
|
warn!("broken xref, attempting to repair");
|
|
|
|
self.repair();
|
|
|
|
// Now try reading again.
|
|
self.get_with::<T>(id, &ctx)
|
|
}
|
|
}
|
|
EntryType::ObjStream(obj_stram_gen_num, index) => {
|
|
// Generation number is implicitly 0.
|
|
let obj_stream_id = ObjectIdentifier::new(obj_stram_gen_num as i32, 0);
|
|
|
|
if obj_stream_id == id {
|
|
warn!("cycle detected in object stream");
|
|
|
|
return None;
|
|
}
|
|
|
|
let stream = self.get_with::<Stream<'_>>(obj_stream_id, &ctx)?;
|
|
let data = repr.data.get_with(obj_stream_id, &ctx)?;
|
|
let object_stream = ObjectStream::new(stream, data, &ctx)?;
|
|
object_stream.get(index)
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
/// An input that is passed to the xref constructor so that we can fully resolve
|
|
/// the PDF.
|
|
#[derive(Debug, Copy, Clone)]
|
|
pub(crate) enum XRefInput<'a> {
|
|
/// This option is going to be uesd in 99.999% of the case. It contains the
|
|
/// raw data of the trailer dictionary which is then going to be processed.
|
|
TrailerDictData(&'a [u8]),
|
|
/// In case the trailer dictionary could not be read (for example because
|
|
/// it is cut-off), we just pass the object ID of the root dictionary
|
|
/// in case we have found one, and try our best to build the PDF just
|
|
/// with the information we have there.
|
|
///
|
|
/// Note that this won't work if the document is encrypted, as we
|
|
/// can't access the crypto dictionary.
|
|
RootRef(ObjectIdentifier),
|
|
}
|
|
|
|
pub(crate) fn find_last_xref_pos(data: &[u8]) -> Option<usize> {
|
|
let needle = b"startxref";
|
|
let pos = findr_needle(data, needle)?;
|
|
let mut finder = Reader::new(data);
|
|
finder.jump(pos);
|
|
finder.forward_tag(needle)?;
|
|
finder.skip_white_spaces_and_comments();
|
|
finder.read_without_context::<i32>()?.try_into().ok()
|
|
}
|
|
|
|
/// A type of xref entry.
|
|
#[derive(Debug, PartialEq, Eq, Clone, Copy)]
|
|
enum EntryType {
|
|
/// An indirect object that is at a specific offset in the original data.
|
|
Normal(usize),
|
|
/// An indirect object that is part of an object stream. First number indicates the object
|
|
/// number of the _object stream_ (the generation number is always 0), the second number indicates
|
|
/// the index in the object stream.
|
|
ObjStream(u32, u32),
|
|
}
|
|
|
|
type XrefMap = FxHashMap<ObjectIdentifier, EntryType>;
|
|
|
|
/// Representation of a proper xref table.
|
|
#[derive(Debug)]
|
|
struct MapRepr {
|
|
xref_map: XrefMap,
|
|
repaired: bool,
|
|
}
|
|
|
|
#[derive(Debug, Copy, Clone)]
|
|
pub(crate) struct TrailerData {
|
|
pub(crate) pages_ref: ObjectIdentifier,
|
|
pub(crate) root_ref: ObjectIdentifier,
|
|
pub(crate) version: Option<PdfVersion>,
|
|
}
|
|
|
|
impl TrailerData {
|
|
pub(crate) fn dummy() -> Self {
|
|
Self {
|
|
pages_ref: ObjectIdentifier::new(0, 0),
|
|
root_ref: ObjectIdentifier::new(0, 0),
|
|
version: None,
|
|
}
|
|
}
|
|
}
|
|
|
|
#[derive(Debug, Clone)]
|
|
struct SomeRepr {
|
|
data: Arc<Data>,
|
|
map: Arc<RwLock<MapRepr>>,
|
|
metadata: Arc<Metadata>,
|
|
decryptor: Arc<Decryptor>,
|
|
has_ocgs: bool,
|
|
password: Vec<u8>,
|
|
trailer_data: TrailerData,
|
|
}
|
|
|
|
#[derive(Debug, Clone)]
|
|
enum Inner {
|
|
/// A dummy xref table that doesn't have any entries.
|
|
Dummy,
|
|
/// A proper xref table.
|
|
Some(Arc<SomeRepr>),
|
|
}
|
|
|
|
#[derive(Debug)]
|
|
struct XRefEntry {
|
|
offset: usize,
|
|
gen_number: i32,
|
|
used: bool,
|
|
}
|
|
|
|
impl XRefEntry {
|
|
pub(crate) fn read(data: &[u8]) -> Option<Self> {
|
|
#[inline(always)]
|
|
fn parse_u32(data: &[u8]) -> Option<u32> {
|
|
let mut accum = 0_u32;
|
|
|
|
for byte in data {
|
|
accum = accum.checked_mul(10)?;
|
|
|
|
match *byte {
|
|
b'0'..=b'9' => accum = accum.checked_add((*byte - b'0') as u32)?,
|
|
_ => return None,
|
|
}
|
|
}
|
|
|
|
Some(accum)
|
|
}
|
|
|
|
let offset = parse_u32(&data[0..10])? as usize;
|
|
let gen_number = i32::try_from(parse_u32(&data[11..16])?).ok()?;
|
|
|
|
let used = data[17] == b'n';
|
|
|
|
Some(Self {
|
|
offset,
|
|
gen_number,
|
|
used,
|
|
})
|
|
}
|
|
}
|
|
|
|
fn populate_xref_impl<'a>(data: &'a [u8], pos: usize, xref_map: &mut XrefMap) -> Option<&'a [u8]> {
|
|
let mut visited = BTreeSet::new();
|
|
populate_xref_impl_inner(data, pos, xref_map, &mut visited)
|
|
}
|
|
|
|
/// Maximum number of allowed xref `Prev` pointers before we abort.
|
|
const MAX_XREF_CHAIN_DEPTH: usize = 256;
|
|
|
|
fn populate_xref_impl_inner<'a>(
|
|
data: &'a [u8],
|
|
pos: usize,
|
|
xref_map: &mut XrefMap,
|
|
visited: &mut BTreeSet<usize>,
|
|
) -> Option<&'a [u8]> {
|
|
if !visited.insert(pos) {
|
|
warn!("circular xref PREV chain detected at offset {}", pos);
|
|
|
|
return None;
|
|
}
|
|
|
|
if visited.len() > MAX_XREF_CHAIN_DEPTH {
|
|
warn!(
|
|
"xref PREV chain exceeds maximum depth of {}",
|
|
MAX_XREF_CHAIN_DEPTH
|
|
);
|
|
|
|
return None;
|
|
}
|
|
|
|
let mut reader = Reader::new(data);
|
|
reader.jump(pos);
|
|
// In case the position points to before the object number of a xref stream.
|
|
reader.skip_white_spaces_and_comments();
|
|
|
|
let mut r2 = reader.clone();
|
|
if reader
|
|
.clone()
|
|
.read_without_context::<ObjectIdentifier>()
|
|
.is_some()
|
|
{
|
|
populate_from_xref_stream(data, &mut r2, xref_map, visited)
|
|
} else {
|
|
populate_from_xref_table(data, &mut r2, xref_map, visited)
|
|
}
|
|
}
|
|
|
|
pub(super) struct SubsectionHeader {
|
|
pub(super) start: u32,
|
|
pub(super) num_entries: u32,
|
|
}
|
|
|
|
impl Readable<'_> for SubsectionHeader {
|
|
fn read(r: &mut Reader<'_>, _: &ReaderContext<'_>) -> Option<Self> {
|
|
r.skip_white_spaces();
|
|
let start = r.read_without_context::<u32>()?;
|
|
r.skip_white_spaces();
|
|
let num_entries = r.read_without_context::<u32>()?;
|
|
r.skip_white_spaces();
|
|
|
|
Some(Self { start, num_entries })
|
|
}
|
|
}
|
|
|
|
/// Populate the xref table, and return the trailer dict.
|
|
fn populate_from_xref_table<'a>(
|
|
data: &'a [u8],
|
|
reader: &mut Reader<'a>,
|
|
insert_map: &mut XrefMap,
|
|
visited: &mut BTreeSet<usize>,
|
|
) -> Option<&'a [u8]> {
|
|
let trailer = {
|
|
let mut reader = reader.clone();
|
|
read_xref_table_trailer(&mut reader, &ReaderContext::dummy())?
|
|
};
|
|
|
|
reader.skip_white_spaces();
|
|
reader.forward_tag(b"xref")?;
|
|
reader.skip_white_spaces();
|
|
|
|
let mut max_obj = 0;
|
|
|
|
if let Some(prev) = trailer.get::<i32>(PREV) {
|
|
// First insert the entries from any previous xref tables.
|
|
populate_xref_impl_inner(data, prev as usize, insert_map, visited)?;
|
|
}
|
|
|
|
// In hybrid files, entries in `XRefStm` should have higher priority, therefore we insert them
|
|
// after looking at `PREV`.
|
|
if let Some(xref_stm) = trailer.get::<i32>(XREF_STM) {
|
|
populate_xref_impl_inner(data, xref_stm as usize, insert_map, visited)?;
|
|
}
|
|
|
|
while let Some(header) = reader.read_without_context::<SubsectionHeader>() {
|
|
reader.skip_white_spaces();
|
|
|
|
let start = header.start;
|
|
let end = start.checked_add(header.num_entries)?;
|
|
|
|
for obj_number in start..end {
|
|
max_obj = max(max_obj, obj_number);
|
|
let bytes = reader.read_bytes(XREF_ENTRY_LEN)?;
|
|
let entry = XRefEntry::read(bytes)?;
|
|
|
|
// Specification says we should ignore any object number > SIZE, but probably
|
|
// not important?
|
|
if entry.used {
|
|
insert_map.insert(
|
|
ObjectIdentifier::new(obj_number as i32, entry.gen_number),
|
|
EntryType::Normal(entry.offset),
|
|
);
|
|
}
|
|
}
|
|
}
|
|
|
|
Some(trailer.data())
|
|
}
|
|
|
|
fn populate_from_xref_stream<'a>(
|
|
data: &'a [u8],
|
|
reader: &mut Reader<'a>,
|
|
insert_map: &mut XrefMap,
|
|
visited: &mut BTreeSet<usize>,
|
|
) -> Option<&'a [u8]> {
|
|
let stream = reader
|
|
.read_with_context::<IndirectObject<Stream<'_>>>(&ReaderContext::dummy())?
|
|
.get();
|
|
|
|
if let Some(prev) = stream.dict().get::<i32>(PREV) {
|
|
// First insert the entries from any previous xref tables.
|
|
let _ = populate_xref_impl_inner(data, prev as usize, insert_map, visited)?;
|
|
}
|
|
|
|
let size = stream.dict().get::<u32>(SIZE)?;
|
|
|
|
let [f1_len, f2_len, f3_len] = stream.dict().get::<[u8; 3]>(W)?;
|
|
|
|
if f2_len > size_of::<u64>() as u8 {
|
|
error!("xref offset length is larger than the allowed limit");
|
|
|
|
return None;
|
|
}
|
|
|
|
// Do such files exist?
|
|
if f1_len != 1 {
|
|
warn!("first field in xref stream was longer than 1");
|
|
}
|
|
|
|
let xref_data = stream.decoded().ok()?;
|
|
let mut xref_reader = Reader::new(xref_data.as_ref());
|
|
|
|
if let Some(arr) = stream.dict().get::<Array<'_>>(INDEX) {
|
|
let iter = arr.iter::<(u32, u32)>();
|
|
|
|
for (start, num_elements) in iter {
|
|
xref_stream_subsection(
|
|
&mut xref_reader,
|
|
start,
|
|
num_elements,
|
|
f1_len,
|
|
f2_len,
|
|
f3_len,
|
|
insert_map,
|
|
)?;
|
|
}
|
|
} else {
|
|
xref_stream_subsection(
|
|
&mut xref_reader,
|
|
0,
|
|
size,
|
|
f1_len,
|
|
f2_len,
|
|
f3_len,
|
|
insert_map,
|
|
)?;
|
|
}
|
|
|
|
Some(stream.dict().data())
|
|
}
|
|
|
|
fn xref_stream_num(data: &[u8]) -> Option<u32> {
|
|
Some(match data.len() {
|
|
0 => return None,
|
|
1 => u8::from_be(data[0]) as u32,
|
|
2 => u16::from_be_bytes(data[0..2].try_into().ok()?) as u32,
|
|
3 => u32::from_be_bytes([0, data[0], data[1], data[2]]),
|
|
4 => u32::from_be_bytes(data[0..4].try_into().ok()?),
|
|
8 => {
|
|
if let Ok(num) = u32::try_from(u64::from_be_bytes(data[0..8].try_into().ok()?)) {
|
|
return Some(num);
|
|
} else {
|
|
warn!("xref stream number is too large");
|
|
|
|
return None;
|
|
}
|
|
}
|
|
_n => {
|
|
warn!("invalid xref stream number {_n}");
|
|
|
|
return None;
|
|
}
|
|
})
|
|
}
|
|
|
|
fn xref_stream_subsection<'a>(
|
|
xref_reader: &mut Reader<'a>,
|
|
start: u32,
|
|
num_elements: u32,
|
|
f1_len: u8,
|
|
f2_len: u8,
|
|
f3_len: u8,
|
|
insert_map: &mut XrefMap,
|
|
) -> Option<()> {
|
|
for i in 0..num_elements {
|
|
let f_type = if f1_len == 0 {
|
|
1
|
|
} else {
|
|
// We assume a length of 1.
|
|
xref_reader.read_bytes(1)?[0]
|
|
};
|
|
|
|
let obj_number = start + i;
|
|
|
|
match f_type {
|
|
// We don't care about free objects.
|
|
0 => {
|
|
xref_reader.skip_bytes(f2_len as usize + f3_len as usize)?;
|
|
}
|
|
1 => {
|
|
let offset = if f2_len > 0 {
|
|
let data = xref_reader.read_bytes(f2_len as usize)?;
|
|
xref_stream_num(data)?
|
|
} else {
|
|
0
|
|
};
|
|
|
|
let gen_number = if f3_len > 0 {
|
|
let data = xref_reader.read_bytes(f3_len as usize)?;
|
|
xref_stream_num(data)?
|
|
} else {
|
|
0
|
|
};
|
|
|
|
insert_map.insert(
|
|
ObjectIdentifier::new(obj_number as i32, gen_number as i32),
|
|
EntryType::Normal(offset as usize),
|
|
);
|
|
}
|
|
2 => {
|
|
let obj_stream_number = {
|
|
let data = xref_reader.read_bytes(f2_len as usize)?;
|
|
xref_stream_num(data)?
|
|
};
|
|
let gen_number = 0;
|
|
let index = if f3_len > 0 {
|
|
let data = xref_reader.read_bytes(f3_len as usize)?;
|
|
xref_stream_num(data)?
|
|
} else {
|
|
0
|
|
};
|
|
|
|
insert_map.insert(
|
|
ObjectIdentifier::new(obj_number as i32, gen_number),
|
|
EntryType::ObjStream(obj_stream_number, index),
|
|
);
|
|
}
|
|
_ => {
|
|
warn!("xref has unknown field type {f_type}");
|
|
|
|
return None;
|
|
}
|
|
}
|
|
}
|
|
|
|
Some(())
|
|
}
|
|
|
|
fn read_xref_table_trailer<'a>(
|
|
reader: &mut Reader<'a>,
|
|
ctx: &ReaderContext<'a>,
|
|
) -> Option<Dict<'a>> {
|
|
reader.skip_white_spaces();
|
|
reader.forward_tag(b"xref")?;
|
|
reader.skip_white_spaces();
|
|
|
|
while let Some(header) = reader.read_without_context::<SubsectionHeader>() {
|
|
let len = XREF_ENTRY_LEN.checked_mul(header.num_entries as usize)?;
|
|
reader.jump(reader.offset().checked_add(len)?);
|
|
}
|
|
|
|
reader.skip_white_spaces();
|
|
reader.forward_tag(b"trailer")?;
|
|
reader.skip_white_spaces();
|
|
|
|
reader.read_with_context::<Dict<'_>>(ctx)
|
|
}
|
|
|
|
fn get_decryptor(trailer_dict: &Dict<'_>, password: &[u8]) -> Result<Decryptor, XRefError> {
|
|
if let Some(encryption_dict) = trailer_dict.get::<Dict<'_>>(ENCRYPT) {
|
|
let id = if let Some(id) = trailer_dict
|
|
.get::<Array<'_>>(ID)
|
|
.and_then(|a| a.flex_iter().next::<object::String<'_>>())
|
|
{
|
|
id.to_vec()
|
|
} else {
|
|
// Assume an empty ID entry.
|
|
vec![]
|
|
};
|
|
|
|
get(&encryption_dict, &id, password).map_err(XRefError::Encryption)
|
|
} else {
|
|
Ok(Decryptor::None)
|
|
}
|
|
}
|
|
|
|
struct ObjectStream<'a> {
|
|
data: &'a [u8],
|
|
ctx: ReaderContext<'a>,
|
|
offsets: Vec<(u32, usize)>,
|
|
}
|
|
|
|
impl<'a> ObjectStream<'a> {
|
|
fn new(inner: Stream<'_>, data: &'a [u8], ctx: &ReaderContext<'a>) -> Option<Self> {
|
|
let num_objects = inner.dict().get::<usize>(N)?;
|
|
let first_offset = inner.dict().get::<usize>(FIRST)?;
|
|
|
|
let mut r = Reader::new(data);
|
|
|
|
let mut offsets = vec![];
|
|
|
|
for _ in 0..num_objects {
|
|
r.skip_white_spaces_and_comments();
|
|
// Skip object number
|
|
let obj_num = r.read_without_context::<u32>()?;
|
|
r.skip_white_spaces_and_comments();
|
|
let relative_offset = r.read_without_context::<usize>()?;
|
|
offsets.push((obj_num, first_offset + relative_offset));
|
|
}
|
|
|
|
let mut ctx = ctx.clone();
|
|
ctx.set_in_object_stream(true);
|
|
|
|
Some(Self { data, ctx, offsets })
|
|
}
|
|
|
|
fn get<T>(&self, index: u32) -> Option<T>
|
|
where
|
|
T: ObjectLike<'a>,
|
|
{
|
|
let offset = self.offsets.get(index as usize)?.1;
|
|
let mut r = Reader::new(self.data);
|
|
r.jump(offset);
|
|
r.skip_white_spaces_and_comments();
|
|
|
|
r.read_with_context::<T>(&self.ctx)
|
|
}
|
|
}
|
|
|
|
fn parse_metadata(info_dict: &Dict<'_>) -> Metadata {
|
|
Metadata {
|
|
creation_date: info_dict
|
|
.get::<object::String<'_>>(CREATION_DATE)
|
|
.and_then(|c| DateTime::from_bytes(&c)),
|
|
modification_date: info_dict
|
|
.get::<object::String<'_>>(MOD_DATE)
|
|
.and_then(|c| DateTime::from_bytes(&c)),
|
|
title: info_dict
|
|
.get::<object::String<'_>>(TITLE)
|
|
.map(|t| t.to_vec()),
|
|
author: info_dict
|
|
.get::<object::String<'_>>(AUTHOR)
|
|
.map(|t| t.to_vec()),
|
|
subject: info_dict
|
|
.get::<object::String<'_>>(SUBJECT)
|
|
.map(|t| t.to_vec()),
|
|
keywords: info_dict
|
|
.get::<object::String<'_>>(KEYWORDS)
|
|
.map(|t| t.to_vec()),
|
|
creator: info_dict
|
|
.get::<object::String<'_>>(CREATOR)
|
|
.map(|t| t.to_vec()),
|
|
producer: info_dict
|
|
.get::<object::String<'_>>(PRODUCER)
|
|
.map(|t| t.to_vec()),
|
|
}
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod tests {
|
|
use super::*;
|
|
|
|
#[test]
|
|
fn circular_prev_chain() {
|
|
let mut pdf = b"%PDF-1.0\n1 0 obj\n<< /Type /Catalog /Pages 2 0 R >>\nendobj\n".to_vec();
|
|
let expected_xref_pos = pdf.len();
|
|
pdf.extend_from_slice(
|
|
format!(
|
|
"xref\n\
|
|
0 1\n\
|
|
0000000000 65535 f \r\n\
|
|
trailer\n<< /Size 1 /Root 1 0 R /Prev {expected_xref_pos} >>\n\
|
|
startxref\n{expected_xref_pos}\n%%EOF"
|
|
)
|
|
.as_bytes(),
|
|
);
|
|
|
|
let mut xref_map = FxHashMap::default();
|
|
let xref_pos = find_last_xref_pos(pdf.as_ref()).unwrap();
|
|
let _result = populate_xref_impl(pdf.as_ref(), xref_pos, &mut xref_map);
|
|
}
|
|
|
|
#[test]
|
|
fn find_last_xref_uses_last_startxref() {
|
|
let pdf = b"%PDF-1.0\nstartxref\n5\n%%EOF\nstartxref\n42\n%%EOF";
|
|
assert_eq!(find_last_xref_pos(pdf), Some(42));
|
|
}
|
|
|
|
#[test]
|
|
fn xref_table_trailer_rejects_overflowing_entry_skip() {
|
|
let data = b"xref\n0 999999999999999999999\ntrailer\n<<>>";
|
|
let mut reader = Reader::new(data);
|
|
assert!(read_xref_table_trailer(&mut reader, &ReaderContext::dummy()).is_none());
|
|
}
|
|
}
|