forked from BenLubar/vpk
-
Notifications
You must be signed in to change notification settings - Fork 0
/
vpk.go
541 lines (467 loc) · 9.87 KB
/
vpk.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
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
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
// Package vpk implements file operations on Valve Software's VPK format.
package vpk
import (
"bufio"
"bytes"
"encoding/binary"
"hash/crc32"
"io"
"os"
"path/filepath"
"sort"
"strings"
"time"
)
const HeaderSize = 28
type entrysort []entrypath
func (s entrysort) Len() int { return len(s) }
func (s entrysort) Swap(i, j int) { s[i], s[j] = s[j], s[i] }
func (s entrysort) Less(i, j int) bool {
return s.less(s[i], s[j])
}
func (s entrysort) less(x, y entrypath) bool {
// radix sort on ext > dir > base
if x.ext < y.ext {
return true
}
if x.ext > y.ext {
return false
}
if x.dir < y.dir {
return true
}
if x.dir > y.dir {
return false
}
return x.base < y.base
}
func (s entrysort) find(dir, base, ext string) *entrypath {
e := entrypath{dir: dir, base: base, ext: ext}
if i := sort.Search(len(s), func(i int) bool {
return !s.less(s[i], e)
}); i < len(s) && strings.EqualFold(s[i].dir, dir) && strings.EqualFold(s[i].base, base) && strings.EqualFold(s[i].ext, ext) {
return &s[i]
}
return nil
}
func splitPath(rel string) (dir, base, ext string) {
rel = strings.ToLower(rel)
dir = filepath.ToSlash(filepath.Dir(rel))
base = filepath.Base(rel)
ext = filepath.Ext(rel)
base = base[:len(base)-len(ext)]
if ext != "" {
ext = ext[1:]
}
if dir == "" || dir == "." {
dir = " "
}
if base == "" {
base = " "
}
if ext == "" {
ext = " "
}
return
}
type entrypath struct {
// The filename is of the format dir/base.ext. If any component is empty
// in the actual filename, it is represented by a single space here.
dir string
base string
ext string
vpk *vpkentry
pre []byte
ent Entry
}
type vpkentry struct {
// An IEEE 32-bit CRC checksum of the entire file.
CRC uint32
// The number of bytes of data from the file that are included directly
// after this structure in the directory tree.
PreloadBytes uint16
// The index of the archive this file is stored in. 0x7fff is this file,
// negative numbers are not allowed.
ArchiveIndex int16
// Offset is either relative to the end of the directory tree
// (ArchiveIndex == 0x7fff) or the beginning of a data-only archive
// (ArchiveIndex != 0x7fff).
Offset uint32
// Length is the amount of data starting from Offset. It does not
// include preloaded data, which is part of the directory tree.
Length uint32
// Terminator is always 0xffff.
Terminator uint16
}
type VPK struct {
opener Opener
version uint32
treeLength uint32
fileDataSectionSize uint32
archiveMD5SectionSize uint32
otherMD5SectionSize uint32
signatureSectionSize uint32
entries entrysort
modtime time.Time
}
type vpkFileEntry struct {
o Opener
l uint32
r string
e vpkentry
p []byte
}
func (e *vpkFileEntry) Rel() string {
return e.r
}
func (e *vpkFileEntry) Open() (io.ReadCloser, error) {
if e.e.Length == 0 {
return crcReader(bytes.NewReader(e.p), func() error { return nil }, e.e.CRC), nil
}
var f File
var err error
if e.e.ArchiveIndex == 0x7fff {
f, err = e.o.Main()
if err != nil {
if f != nil {
f.Close()
}
return nil, err
}
_, err = f.Seek(HeaderSize+int64(e.l), os.SEEK_CUR)
} else {
f, err = e.o.Archive(e.e.ArchiveIndex)
}
if err != nil {
if f != nil {
f.Close()
}
return nil, err
}
_, err = f.Seek(int64(e.e.Offset), os.SEEK_CUR)
return crcReader(io.MultiReader(bytes.NewReader(e.p), io.LimitReader(f, int64(e.e.Length))), f.Close, e.e.CRC), nil
}
// Entry returns the file with the given relative path, or nil if no such file
// exists. The Close method of the io.ReadCloser returned by Entry.Open verifies
// the CRC of the file.
func (v *VPK) Entry(rel string) Entry {
e := v.entries.find(splitPath(rel))
if e == nil {
return nil
}
return &vpkFileEntry{v.opener, v.treeLength, rel, *e.vpk, e.pre}
}
// Paths returns a slice containing the relative paths of all files in the VPK.
func (v *VPK) Paths() []string {
paths := make([]string, len(v.entries))
for i, e := range v.entries {
if e.dir != " " {
paths[i] += e.dir + "/"
}
if e.base != " " {
paths[i] += e.base
}
if e.ext != " " {
paths[i] += "." + e.ext
}
}
return paths
}
type Entry interface {
// The relative path to this file.
Rel() string
// Open the file for reading. Exactly one of the return values must be
// non-nil. The contents of the io.ReadCloser should be the same each
// time Open is called.
Open() (io.ReadCloser, error)
}
type File interface {
io.Reader
io.Seeker
io.Closer
Stat() (os.FileInfo, error)
}
func Open(o Opener) (*VPK, error) {
var vpk VPK
vpk.opener = o
r, err := o.Main()
if err != nil {
return nil, err
}
defer r.Close()
fi, err := r.Stat()
if err != nil {
return nil, err
}
vpk.modtime = fi.ModTime()
br := bufio.NewReader(r)
var magic uint32
err = binary.Read(br, binary.LittleEndian, &magic)
if err != nil {
return nil, err
}
if magic != 0x55aa1234 {
return nil, ErrInvalidMagic
}
err = binary.Read(br, binary.LittleEndian, &vpk.version)
if err != nil {
return nil, err
}
if vpk.version != 2 {
return nil, ErrUnsupportedVersion(vpk.version)
}
// TODO: verify treeLength
err = binary.Read(br, binary.LittleEndian, &vpk.treeLength)
if err != nil {
return nil, err
}
err = binary.Read(br, binary.LittleEndian, &vpk.fileDataSectionSize)
if err != nil {
return nil, err
}
err = binary.Read(br, binary.LittleEndian, &vpk.archiveMD5SectionSize)
if err != nil {
return nil, err
}
err = binary.Read(br, binary.LittleEndian, &vpk.otherMD5SectionSize)
if err != nil {
return nil, err
}
err = binary.Read(br, binary.LittleEndian, &vpk.signatureSectionSize)
if err != nil {
return nil, err
}
for {
ext, err := br.ReadString(0)
if err != nil {
return nil, err
}
ext = ext[:len(ext)-1]
if ext == "" {
break
}
for {
dir, err := br.ReadString(0)
if err != nil {
return nil, err
}
dir = dir[:len(dir)-1]
if dir == "" {
break
}
for {
base, err := br.ReadString(0)
if err != nil {
return nil, err
}
base = base[:len(base)-1]
if base == "" {
break
}
var e vpkentry
err = binary.Read(br, binary.LittleEndian, &e)
if err != nil {
return nil, err
}
if e.ArchiveIndex < 0 || e.Terminator != 0xffff {
return nil, ErrInvalidEntry{
Dir: dir,
Base: base,
Ext: ext,
}
}
var pre []byte
if e.PreloadBytes != 0 {
pre = make([]byte, e.PreloadBytes)
_, err = io.ReadFull(br, pre)
if err != nil {
return nil, err
}
}
vpk.entries = append(vpk.entries, entrypath{
dir: dir,
base: base,
ext: ext,
vpk: &e,
pre: pre,
})
}
}
}
sort.Sort(vpk.entries)
return &vpk, nil
}
func Create(c Creator, contents []Entry, maxSize int64) (err error) {
var entries []entrypath
hash := crc32.NewIEEE()
var archive int16
var offset uint32
if maxSize < 0 {
archive = 0x7fff
}
for _, c := range contents {
var e vpkentry
e.ArchiveIndex = archive
e.Offset = offset
e.Terminator = 0xffff
r, err := c.Open()
if err != nil {
return err
}
hash.Reset()
length, err := io.Copy(hash, r)
if err != nil {
r.Close()
return err
}
err = r.Close()
if err != nil {
return err
}
if length != int64(uint32(length)) {
return ErrFileTooBig
}
e.CRC = hash.Sum32()
e.Length = uint32(length)
if offset+uint32(length) < offset {
return ErrFileTooBig
}
offset += uint32(length)
if maxSize >= 0 && int64(offset) >= maxSize {
offset = 0
archive++
}
dir, base, ext := splitPath(c.Rel())
entries = append(entries, entrypath{
dir: dir,
base: base,
ext: ext,
ent: c,
vpk: &e,
})
}
sorted := make(entrysort, len(entries))
copy(sorted, entries)
sort.Sort(sorted)
sorted = append(sorted, entrypath{})
var buf bytes.Buffer
writeString := func(s string) {
if err != nil {
return
}
_, err = buf.WriteString(s)
if err != nil {
return
}
err = buf.WriteByte(0)
}
writeString(sorted[0].ext)
writeString(sorted[0].dir)
writeString(sorted[0].base)
if err != nil {
return
}
for i, e := range sorted[:len(entries)] {
err = binary.Write(&buf, binary.LittleEndian, e.vpk)
if err != nil {
return
}
next := sorted[i+1]
if e.dir != next.dir || e.ext != next.ext {
writeString("")
if e.ext != next.ext {
writeString("")
writeString(next.ext)
if next.ext == "" {
break
}
}
writeString(next.dir)
}
writeString(next.base)
}
if err != nil {
return
}
if int64(uint32(buf.Len())) != int64(buf.Len()) {
return ErrFileTooBig
}
f, err := c.Main()
if err != nil {
return
}
defer func() {
if e := f.Close(); err == nil {
err = e
}
}()
w := bufio.NewWriter(f)
defer func() {
if e := w.Flush(); err == nil {
err = e
}
}()
err = binary.Write(w, binary.LittleEndian, uint32(0x55aa1234)) // magic
if err != nil {
return
}
err = binary.Write(w, binary.LittleEndian, uint32(0x1)) // version
if err != nil {
return
}
err = binary.Write(w, binary.LittleEndian, uint32(buf.Len()))
if err != nil {
return
}
_, err = buf.WriteTo(w)
if err != nil {
return
}
copyFile := func(w io.Writer, e entrypath) error {
r, err := e.ent.Open()
if err != nil {
return err
}
r = crcReader(r, r.Close, e.vpk.CRC)
length, err := io.Copy(w, r)
if err != nil {
r.Close()
return err
}
if length != int64(e.vpk.Length) {
r.Close()
return io.ErrUnexpectedEOF
}
return r.Close()
}
if maxSize < 0 {
for _, e := range entries {
if err = copyFile(w, e); err != nil {
return
}
}
} else {
var a io.WriteCloser
var i int16
for _, e := range entries {
if i != e.vpk.ArchiveIndex {
if a != nil {
if err = a.Close(); err != nil {
return
}
a = nil
}
i = e.vpk.ArchiveIndex
}
if a == nil {
if a, err = c.Archive(i); err != nil {
return
}
}
if err = copyFile(a, e); err != nil {
return
}
}
}
return
}