-
Notifications
You must be signed in to change notification settings - Fork 35
/
branch.go
589 lines (515 loc) · 13.3 KB
/
branch.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
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
// Copyright 2017 The go-hep Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package rootio
import (
"fmt"
"reflect"
"strings"
)
type tbranch struct {
named tnamed
attfill attfill
compress int // compression level and algorithm
basketSize int // initial size of Basket buffer
entryOffsetLen int // initial length of entryOffset table in the basket buffers
writeBasket int // last basket number written
entryNumber int64 // current entry number (last one filled in this branch)
offset int // offset of this branch
maxBaskets int // maximum number of baskets so far
splitLevel int // branch split level
entries int64 // number of entries
firstEntry int64 // number of the first entry in this branch
totBytes int64 // total number of bytes in all leaves before compression
zipBytes int64 // total number of bytes in all leaves after compression
branches []Branch // list of branches of this branch
leaves []Leaf // list of leaves of this branch
baskets []Basket // list of baskets of this branch
basketBytes []int32 // length of baskets on file
basketEntry []int64 // table of first entry in each basket
basketSeek []int64 // addresses of baskets on file
fname string // named of file where buffers are stored (empty if in same file as Tree header)
readbasket int // current basket number when reading
readentry int64 // current entry number when reading
firstbasket int64 // first entry in the current basket
nextbasket int64 // next entry that will require us to go to the next basket
basket *Basket // pointer to the current basket
basketBuf []byte // scratch space for the current basket
tree Tree // tree header
btop Branch // top-level parent branch in the tree
bup Branch // parent branch
dir *tdirectory // directory where this branch's buffers are stored
}
func (b *tbranch) Name() string {
return b.named.Name()
}
func (b *tbranch) Title() string {
return b.named.Title()
}
func (b *tbranch) Class() string {
return "TBranch"
}
func (b *tbranch) getTree() Tree {
return b.tree
}
func (b *tbranch) setTree(t Tree) {
b.tree = t
for _, sub := range b.branches {
sub.setTree(t)
}
}
func (b *tbranch) Branches() []Branch {
return b.branches
}
func (b *tbranch) Leaves() []Leaf {
return b.leaves
}
func (b *tbranch) getReadEntry() int64 {
return b.readentry
}
func (b *tbranch) getEntry(i int64) {
err := b.loadEntry(i)
if err != nil {
panic(errorf("rootio: branch [%s] failed to load entry %d: %v", b.Name(), i, err))
}
}
// ROOTUnmarshaler is the interface implemented by an object that can
// unmarshal itself from a ROOT buffer
func (b *tbranch) UnmarshalROOT(r *RBuffer) error {
if r.Err() != nil {
return r.Err()
}
beg := r.Pos()
vers, pos, bcnt := r.ReadVersion()
b.tree = nil
b.basket = nil
b.firstbasket = -1
b.nextbasket = -1
if vers < 11 {
panic(fmt.Errorf("rootio: too old TBanch version (%d<11)", vers))
}
if err := b.named.UnmarshalROOT(r); err != nil {
return err
}
if err := b.attfill.UnmarshalROOT(r); err != nil {
return err
}
b.compress = int(r.ReadI32())
b.basketSize = int(r.ReadI32())
b.entryOffsetLen = int(r.ReadI32())
b.writeBasket = int(r.ReadI32())
b.entryNumber = r.ReadI64()
b.offset = int(r.ReadI32())
b.maxBaskets = int(r.ReadI32())
b.splitLevel = int(r.ReadI32())
b.entries = r.ReadI64()
b.firstEntry = r.ReadI64()
b.totBytes = r.ReadI64()
b.zipBytes = r.ReadI64()
{
var branches objarray
if err := branches.UnmarshalROOT(r); err != nil {
r.err = err
return r.err
}
b.branches = make([]Branch, branches.last+1)
for i := range b.branches {
br := branches.At(i).(Branch)
b.branches[i] = br
}
}
{
var leaves objarray
if err := leaves.UnmarshalROOT(r); err != nil {
r.err = err
return r.err
}
b.leaves = make([]Leaf, leaves.last+1)
for i := range b.leaves {
leaf := leaves.At(i).(Leaf)
leaf.setBranch(b)
b.leaves[i] = leaf
}
}
{
var baskets objarray
if err := baskets.UnmarshalROOT(r); err != nil {
r.err = err
return r.err
}
b.baskets = make([]Basket, 0, baskets.last+1)
for i := 0; i < baskets.last+1; i++ {
bkt := baskets.At(i)
// FIXME(sbinet) check why some are nil
if bkt == nil {
continue
}
bk := bkt.(*Basket)
b.baskets = append(b.baskets, *bk)
}
}
b.basketBytes = nil
b.basketEntry = nil
b.basketSeek = nil
/*isArray*/
_ = r.ReadI8()
b.basketBytes = r.ReadFastArrayI32(b.maxBaskets)[:b.writeBasket:b.writeBasket]
/*isArray*/
_ = r.ReadI8()
b.basketEntry = r.ReadFastArrayI64(b.maxBaskets)[:b.writeBasket+1 : b.writeBasket+1]
/*isArray*/
_ = r.ReadI8()
b.basketSeek = r.ReadFastArrayI64(b.maxBaskets)[:b.writeBasket:b.writeBasket]
b.fname = r.ReadString()
r.CheckByteCount(pos, bcnt, beg, "TBranch")
if b.splitLevel == 0 && len(b.branches) > 0 {
b.splitLevel = 1
}
return r.Err()
}
func (b *tbranch) loadEntry(ientry int64) error {
var err error
if len(b.basketBytes) == 0 {
return nil
}
err = b.loadBasket(ientry)
if err != nil {
return err
}
err = b.basket.loadEntry(ientry - b.firstEntry)
if err != nil {
return err
}
for _, leaf := range b.leaves {
err = b.basket.readLeaf(ientry-b.firstEntry, leaf)
if err != nil {
return err
}
}
return err
}
func (b *tbranch) loadBasket(entry int64) error {
var err error
ib := b.findBasketIndex(entry)
if ib < 0 {
return errorf("rootio: no basket for entry %d", entry)
}
b.readentry = entry
b.readbasket = ib
b.nextbasket = b.basketEntry[ib+1]
b.firstbasket = b.basketEntry[ib]
if ib < len(b.baskets) {
b.basket = &b.baskets[ib]
b.firstEntry = b.basketEntry[ib]
return nil
}
if len(b.basketBuf) < int(b.basketBytes[ib]) {
b.basketBuf = make([]byte, int(b.basketBytes[ib]))
}
buf := b.basketBuf[:int(b.basketBytes[ib])]
f := b.tree.getFile()
_, err = f.ReadAt(buf, b.basketSeek[ib])
if err != nil {
return err
}
b.baskets = append(b.baskets, Basket{})
b.basket = &b.baskets[len(b.baskets)-1]
err = b.basket.UnmarshalROOT(NewRBuffer(buf, nil, 0))
if err != nil {
return err
}
b.basket.key.f = f
b.firstEntry = entry
if len(b.basketBuf) < int(b.basket.key.objlen) {
b.basketBuf = make([]byte, b.basket.key.objlen)
}
buf = b.basketBuf[:int(b.basket.key.objlen)]
_, err = b.basket.key.load(buf)
if err != nil {
return err
}
b.basket.rbuf = NewRBuffer(buf, nil, uint32(b.basket.key.keylen))
for _, leaf := range b.leaves {
err = leaf.readBasket(b.basket.rbuf)
if err != nil {
return err
}
}
if b.entryOffsetLen > 0 {
last := int64(b.basket.last)
err = b.basket.rbuf.setPos(last)
if err != nil {
return err
}
n := b.basket.rbuf.ReadI32()
b.basket.offsets = b.basket.rbuf.ReadFastArrayI32(int(n))
if b.basket.rbuf.err != nil {
return b.basket.rbuf.err
}
}
return err
}
func (b *tbranch) findBasketIndex(entry int64) int {
switch {
case entry == 0:
return 0
case b.firstbasket <= entry && entry < b.nextbasket:
return b.readbasket
}
/*
// binary search is not efficient for small slices (like basketEntry)
// TODO(sbinet): test at which length of basketEntry it starts to be efficient.
entries := b.basketEntry[1:]
i := sort.Search(len(entries), func(i int) bool { return entries[i] >= entry })
if b.basketEntry[i+1] == entry {
return i + 1
}
return i
*/
for i := b.readbasket; i < len(b.basketEntry); i++ {
v := b.basketEntry[i]
if v > entry && v > 0 {
return i - 1
}
}
if entry == b.basketEntry[len(b.basketEntry)-1] {
return -2 // len(b.basketEntry) - 1
}
return -1
}
func (b *tbranch) scan(ptr interface{}) error {
for _, leaf := range b.leaves {
err := leaf.scan(b.basket.rbuf, ptr)
if err != nil {
return err
}
}
return b.basket.rbuf.err
}
func (b *tbranch) setAddress(ptr interface{}) error {
var err error
return err
}
// tbranchElement is a Branch for objects.
type tbranchElement struct {
tbranch
class string // class name of referenced object
parent string // name of parent class
clones string // named of class in TClonesArray (if any)
chksum uint32 // checksum of class
clsver uint16 // version number of class
id int32 // element serial number in fInfo
btype int32 // branch type
stype int32 // branch streamer type
max int32 // maximum entries for a TClonesArray or variable array
stltyp int32 // STL container type
bcount1 *tbranchElement // pointer to primary branchcount branch
bcount2 *tbranchElement // pointer to secondary branchcount branch
streamer StreamerInfo
estreamer StreamerElement
scanfct func(b *tbranchElement, ptr interface{}) error
}
func (b *tbranchElement) Class() string {
return "TBranchElement"
}
// ROOTUnmarshaler is the interface implemented by an object that can
// unmarshal itself from a ROOT buffer
func (b *tbranchElement) UnmarshalROOT(r *RBuffer) error {
if r.err != nil {
return r.err
}
beg := r.Pos()
vers, pos, bcnt := r.ReadVersion()
if vers < 9 {
r.err = fmt.Errorf("rootio: TBranchElement version too old (%d < 9)", vers)
return r.err
}
if err := b.tbranch.UnmarshalROOT(r); err != nil {
r.err = err
return r.err
}
b.class = r.ReadString()
b.parent = r.ReadString()
b.clones = r.ReadString()
b.chksum = r.ReadU32()
if vers >= 10 {
b.clsver = r.ReadU16()
} else {
b.clsver = uint16(r.ReadU32())
}
b.id = r.ReadI32()
b.btype = r.ReadI32()
b.stype = r.ReadI32()
b.max = r.ReadI32()
bcount1 := r.ReadObjectAny()
if bcount1 != nil {
b.bcount1 = bcount1.(*tbranchElement)
}
bcount2 := r.ReadObjectAny()
if bcount2 != nil {
b.bcount2 = bcount2.(*tbranchElement)
}
r.CheckByteCount(pos, bcnt, beg, "TBranchElement")
return r.err
}
func (b *tbranchElement) loadEntry(ientry int64) error {
var err error
if len(b.branches) > 0 {
for _, sub := range b.branches {
err := sub.loadEntry(ientry)
if err != nil {
return err
}
}
}
return b.tbranch.loadEntry(ientry)
if len(b.basketBytes) == 0 {
return nil
}
b.readentry = ientry
err = b.loadBasket(ientry)
if err != nil {
return err
}
err = b.basket.loadEntry(ientry - b.firstEntry)
if err != nil {
return err
}
for _, leaf := range b.leaves {
err = b.basket.readLeaf(ientry-b.firstEntry, leaf)
if err != nil {
return err
}
}
return err
}
func (b *tbranchElement) setAddress(ptr interface{}) error {
var err error
err = b.setupReadStreamer()
if err != nil {
return err
}
b.scanfct = func(b *tbranchElement, ptr interface{}) error {
return b.tbranch.scan(ptr)
}
if len(b.branches) > 0 {
var ids []int
rv := reflect.ValueOf(ptr).Elem()
for _, sub := range b.branches {
i := int(sub.(*tbranchElement).id)
ids = append(ids, i)
fptr := rv.Field(i).Addr().Interface()
err = sub.setAddress(fptr)
if err != nil {
return err
}
}
b.scanfct = func(b *tbranchElement, ptr interface{}) error {
rv := reflect.ValueOf(ptr).Elem()
for i, sub := range b.branches {
id := ids[i]
fptr := rv.Field(id).Addr().Interface()
err := sub.scan(fptr)
if err != nil {
return err
}
}
return nil
}
}
if b.id < 0 {
for _, leaf := range b.tbranch.leaves {
leaf, ok := leaf.(*tleafElement)
if !ok {
continue
}
err = leaf.setAddress(ptr)
if err != nil {
return err
}
}
} else {
elts := b.streamer.Elements()
for _, leaf := range b.tbranch.leaves {
leaf, ok := leaf.(*tleafElement)
if !ok {
continue
}
var elt StreamerElement
leafName := leaf.Name()
if strings.Contains(leafName, ".") {
idx := strings.LastIndex(leafName, ".")
leafName = string(leafName[idx+1:])
}
for _, ee := range elts {
if ee.Name() == leafName {
elt = ee
break
}
}
if elt == nil {
return fmt.Errorf("rootio: failed to find StreamerElement for leaf %q", leaf.Name())
}
leaf.streamers = []StreamerElement{elt}
err = leaf.setAddress(ptr)
if err != nil {
return err
}
}
}
return err
}
func (b *tbranchElement) scan(ptr interface{}) error {
return b.scanfct(b, ptr)
}
func (b *tbranchElement) setupReadStreamer() error {
streamer, ok := streamers.get(b.class, int(b.clsver), int(b.chksum))
if !ok {
return fmt.Errorf("rootio: no StreamerInfo for class=%q version=%d checksum=%d", b.class, b.clsver, b.chksum)
}
b.streamer = streamer
for _, leaf := range b.tbranch.leaves {
leaf, ok := leaf.(*tleafElement)
if !ok {
continue
}
leaf.streamers = b.streamer.Elements()
}
for _, sub := range b.branches {
sub, ok := sub.(*tbranchElement)
if !ok {
continue
}
err := sub.setupReadStreamer()
if err != nil {
return err
}
}
return nil
}
func init() {
{
f := func() reflect.Value {
o := &tbranch{}
return reflect.ValueOf(o)
}
Factory.add("TBranch", f)
Factory.add("*rootio.tbranch", f)
}
{
f := func() reflect.Value {
o := &tbranchElement{}
return reflect.ValueOf(o)
}
Factory.add("TBranchElement", f)
Factory.add("*rootio.tbranchElement", f)
}
}
var _ Object = (*tbranch)(nil)
var _ Named = (*tbranch)(nil)
var _ Branch = (*tbranch)(nil)
var _ ROOTUnmarshaler = (*tbranch)(nil)
var _ Object = (*tbranchElement)(nil)
var _ Named = (*tbranchElement)(nil)
var _ Branch = (*tbranchElement)(nil)
var _ ROOTUnmarshaler = (*tbranchElement)(nil)