forked from pdfcpu/pdfcpu
-
Notifications
You must be signed in to change notification settings - Fork 0
/
numberTree.go
207 lines (157 loc) · 5.04 KB
/
numberTree.go
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
/*
Copyright 2018 The pdfcpu Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
package validate
import (
pdf "github.com/hhrutter/pdfcpu/pkg/pdfcpu"
"github.com/pkg/errors"
)
func validatePageLabelDict(xRefTable *pdf.XRefTable, o pdf.Object) error {
// see 12.4.2 Page Labels
d, err := xRefTable.DereferenceDict(o)
if err != nil || d == nil {
return err
}
dictName := "pageLabelDict"
// Type, optional, name
_, err = validateNameEntry(xRefTable, d, dictName, "Type", OPTIONAL, pdf.V10, func(s string) bool { return s == "PageLabel" })
if err != nil {
return err
}
// Optional name entry S
// The numbering style that shall be used for the numeric portion of each page label.
validate := func(s string) bool { return pdf.MemberOf(s, []string{"D", "R", "r", "A", "a"}) }
_, err = validateNameEntry(xRefTable, d, dictName, "S", OPTIONAL, pdf.V10, validate)
if err != nil {
return err
}
// Optional string entry P
// Label prefix for page labels in this range.
_, err = validateStringEntry(xRefTable, d, dictName, "P", OPTIONAL, pdf.V10, nil)
if err != nil {
return err
}
// Optional integer entry St
// The value of the numeric portion for the first page label in the range.
_, err = validateIntegerEntry(xRefTable, d, dictName, "St", OPTIONAL, pdf.V10, func(i int) bool { return i >= 1 })
return err
}
func validateNumberTreeDictNumsEntry(xRefTable *pdf.XRefTable, d pdf.Dict, name string) (firstKey, lastKey int, err error) {
// Nums: array of the form [key1 value1 key2 value2 ... key n value n]
o, found := d.Find("Nums")
if !found {
return 0, 0, errors.New("writeNumberTreeDictNumsEntry: missing \"Kids\" or \"Nums\" entry")
}
a, err := xRefTable.DereferenceArray(o)
if err != nil {
return 0, 0, err
}
if a == nil {
return 0, 0, errors.New("validateNumberTreeDictNumsEntry: missing \"Nums\" array")
}
// arr length needs to be even because of contained key value pairs.
if len(a)%2 == 1 {
return 0, 0, errors.Errorf("validateNumberTreeDictNumsEntry: Nums array entry length needs to be even, length=%d\n", len(a))
}
// every other entry is a value
// value = indRef to an array of indRefs of structElemDicts
// or
// value = indRef of structElementDict.
for i, o := range a {
if i%2 == 0 {
o, err = xRefTable.Dereference(o)
if err != nil {
return 0, 0, err
}
i, ok := o.(pdf.Integer)
if !ok {
return 0, 0, errors.Errorf("validateNumberTreeDictNumsEntry: corrupt key <%v>\n", o)
}
if firstKey == 0 {
firstKey = i.Value()
}
lastKey = i.Value()
continue
}
switch name {
case "PageLabel":
err = validatePageLabelDict(xRefTable, o)
if err != nil {
return 0, 0, err
}
case "StructTree":
err = validateStructTreeRootDictEntryK(xRefTable, o)
if err != nil {
return 0, 0, err
}
}
}
return firstKey, lastKey, nil
}
func validateNumberTreeDictLimitsEntry(xRefTable *pdf.XRefTable, d pdf.Dict, firstKey, lastKey int) error {
a, err := validateIntegerArrayEntry(xRefTable, d, "numberTreeDict", "Limits", REQUIRED, pdf.V10, func(a pdf.Array) bool { return len(a) == 2 })
if err != nil {
return err
}
fk, _ := a[0].(pdf.Integer)
lk, _ := a[1].(pdf.Integer)
if firstKey != fk.Value() || lastKey != lk.Value() {
return errors.Errorf("validateNumberTreeDictLimitsEntry: leaf node corrupted\n")
}
return nil
}
func validateNumberTree(xRefTable *pdf.XRefTable, name string, ir pdf.IndirectRef, root bool) (firstKey, lastKey int, err error) {
// A node has "Kids" or "Nums" entry.
d, err := xRefTable.DereferenceDict(ir)
if err != nil || d == nil {
return 0, 0, err
}
// Kids: array of indirect references to the immediate children of this node.
// if Kids present then recurse
if o, found := d.Find("Kids"); found {
a, err := xRefTable.DereferenceArray(o)
if err != nil {
return 0, 0, err
}
if a == nil {
return 0, 0, errors.New("validateNumberTree: missing \"Kids\" array")
}
for _, o := range a {
kid, ok := o.(pdf.IndirectRef)
if !ok {
return 0, 0, errors.New("validateNumberTree: corrupt kid, should be indirect reference")
}
var fk int
fk, lastKey, err = validateNumberTree(xRefTable, name, kid, false)
if err != nil {
return 0, 0, err
}
if firstKey == 0 {
firstKey = fk
}
}
} else {
// Leaf node
firstKey, lastKey, err = validateNumberTreeDictNumsEntry(xRefTable, d, name)
if err != nil {
return 0, 0, err
}
}
if !root {
// Verify calculated key range.
err = validateNumberTreeDictLimitsEntry(xRefTable, d, firstKey, lastKey)
if err != nil {
return 0, 0, err
}
}
return firstKey, lastKey, nil
}