test_parsedoffset.cc
5.08 KB
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
#include <qpdf/QPDF.hh>
#include <qpdf/QPDFObjectHandle.hh>
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <cstdlib>
void usage()
{
std::cerr
<< "Usage: test_parsedoffset INPUT.pdf"
<< std::endl;
}
std::string make_objdesc(qpdf_offset_t offset, QPDFObjectHandle obj)
{
std::stringstream ss;
ss << "offset = "
<< offset
<< " (0x"
<< std::hex << offset << std::dec
<< "), ";
if (obj.isIndirect())
{
ss << "indirect "
<< obj.getObjectID()
<< "/"
<< obj.getGeneration()
<< ", ";
}
else
{
ss << "direct, ";
}
ss << obj.getTypeName();
return ss.str();
}
void walk(size_t stream_number, QPDFObjectHandle obj,
std::vector<
std::vector<
std::pair<qpdf_offset_t, std::string>
>
>
&result)
{
qpdf_offset_t offset = obj.getParsedOffset();
std::pair<qpdf_offset_t, std::string> p =
std::make_pair(offset, make_objdesc(offset, obj));
if (result.size() < stream_number + 1)
{
result.resize(stream_number + 1);
}
result[stream_number].push_back(p);
if (obj.isArray())
{
std::vector<QPDFObjectHandle> array = obj.getArrayAsVector();
for(std::vector<QPDFObjectHandle>::iterator iter = array.begin();
iter != array.end(); ++iter)
{
if (!iter->isIndirect())
{
// QPDF::GetAllObjects() enumerates all indirect objects.
// So only the direct objects are recursed here.
walk(stream_number, *iter, result);
}
}
}
else if(obj.isDictionary())
{
std::set<std::string> keys = obj.getKeys();
for(std::set<std::string>::iterator iter = keys.begin();
iter != keys.end(); ++iter)
{
QPDFObjectHandle item = obj.getKey(*iter);
if (!item.isIndirect())
{
// QPDF::GetAllObjects() enumerates all indirect objects.
// So only the direct objects are recursed here.
walk(stream_number, item, result);
}
}
}
else if(obj.isStream())
{
walk(stream_number, obj.getDict(), result);
}
}
void process(std::string fn,
std::vector<
std::vector<
std::pair<qpdf_offset_t, std::string>
>
> &result)
{
QPDF qpdf;
qpdf.processFile(fn.c_str());
std::vector<QPDFObjectHandle> objs = qpdf.getAllObjects();
std::map<QPDFObjGen, QPDFXRefEntry> xrefs = qpdf.getXRefTable();
for (std::vector<QPDFObjectHandle>::iterator iter = objs.begin();
iter != objs.end(); ++iter)
{
if (xrefs.count(iter->getObjGen()) == 0)
{
std::cerr
<< iter->getObjectID()
<< "/"
<< iter->getGeneration()
<< " is not found in xref table"
<< std::endl;
std::exit(2);
}
QPDFXRefEntry xref = xrefs[iter->getObjGen()];
size_t stream_number;
switch (xref.getType())
{
case 0:
std::cerr
<< iter->getObjectID()
<< "/"
<< iter->getGeneration()
<< " xref entry is free"
<< std::endl;
std::exit(2);
case 1:
stream_number = 0;
break;
case 2:
stream_number = static_cast<size_t>(xref.getObjStreamNumber());
break;
default:
std::cerr << "unknown xref entry type" << std::endl;
std::exit(2);
}
walk(stream_number, *iter, result);
}
}
int main(int argc, char *argv[])
{
if (argc != 2)
{
usage();
std::exit(2);
}
try
{
std::vector<
std::vector<
std::pair<qpdf_offset_t, std::string>
>
> table;
process(argv[1], table);
for (size_t i = 0; i < table.size(); ++i)
{
if (table[i].size() == 0)
{
continue;
}
std::sort(table[i].begin(), table[i].end());
if (i == 0)
{
std::cout << "--- objects not in streams ---" << std::endl;
}
else
{
std::cout
<< "--- objects in stream " << i << " ---" << std::endl;
}
for (std::vector<
std::pair<qpdf_offset_t, std::string>
>::iterator
iter = table[i].begin();
iter != table[i].end(); ++iter)
{
std::cout
<< iter->second
<< std::endl;
}
}
std::cout << "succeeded" << std::endl;
}
catch (std::exception& e)
{
std::cerr << e.what() << std::endl;
std::exit(2);
}
return 0;
}