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
|
// Copyright 2023 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// Code generated by "gen.bash" from internal/trace; DO NOT EDIT.
//go:build go1.23
package trace
import (
"cmp"
"encoding/binary"
"fmt"
"golang.org/x/exp/trace/internal/tracev2"
)
type batchCursor struct {
m ThreadID
lastTs Time
idx int // next index into []batch
dataOff int // next index into batch.data
ev baseEvent // last read event
}
func (b *batchCursor) nextEvent(batches []batch, freq frequency) (ok bool, err error) {
// Batches should generally always have at least one event,
// but let's be defensive about that and accept empty batches.
for b.idx < len(batches) && len(batches[b.idx].data) == b.dataOff {
b.idx++
b.dataOff = 0
b.lastTs = 0
}
// Have we reached the end of the batches?
if b.idx == len(batches) {
return false, nil
}
// Initialize lastTs if it hasn't been yet.
if b.lastTs == 0 {
b.lastTs = freq.mul(batches[b.idx].time)
}
// Read an event out.
n, tsdiff, err := readTimedBaseEvent(batches[b.idx].data[b.dataOff:], &b.ev)
if err != nil {
return false, err
}
// Complete the timestamp from the cursor's last timestamp.
b.ev.time = freq.mul(tsdiff) + b.lastTs
// Move the cursor's timestamp forward.
b.lastTs = b.ev.time
// Move the cursor forward.
b.dataOff += n
return true, nil
}
func (b *batchCursor) compare(a *batchCursor) int {
return cmp.Compare(b.ev.time, a.ev.time)
}
// readTimedBaseEvent reads out the raw event data from b
// into e. It does not try to interpret the arguments
// but it does validate that the event is a regular
// event with a timestamp (vs. a structural event).
//
// It requires that the event its reading be timed, which must
// be the case for every event in a plain EventBatch.
func readTimedBaseEvent(b []byte, e *baseEvent) (int, timestamp, error) {
// Get the event type.
typ := tracev2.EventType(b[0])
specs := tracev2.Specs()
if int(typ) >= len(specs) {
return 0, 0, fmt.Errorf("found invalid event type: %v", typ)
}
e.typ = typ
// Get spec.
spec := &specs[typ]
if len(spec.Args) == 0 || !spec.IsTimedEvent {
return 0, 0, fmt.Errorf("found event without a timestamp: type=%v", typ)
}
n := 1
// Read timestamp diff.
ts, nb := binary.Uvarint(b[n:])
if nb <= 0 {
return 0, 0, fmt.Errorf("found invalid uvarint for timestamp")
}
n += nb
// Read the rest of the arguments.
for i := 0; i < len(spec.Args)-1; i++ {
arg, nb := binary.Uvarint(b[n:])
if nb <= 0 {
return 0, 0, fmt.Errorf("found invalid uvarint")
}
e.args[i] = arg
n += nb
}
return n, timestamp(ts), nil
}
func heapInsert(heap []*batchCursor, bc *batchCursor) []*batchCursor {
// Add the cursor to the end of the heap.
heap = append(heap, bc)
// Sift the new entry up to the right place.
heapSiftUp(heap, len(heap)-1)
return heap
}
func heapUpdate(heap []*batchCursor, i int) {
// Try to sift up.
if heapSiftUp(heap, i) != i {
return
}
// Try to sift down, if sifting up failed.
heapSiftDown(heap, i)
}
func heapRemove(heap []*batchCursor, i int) []*batchCursor {
// Sift index i up to the root, ignoring actual values.
for i > 0 {
heap[(i-1)/2], heap[i] = heap[i], heap[(i-1)/2]
i = (i - 1) / 2
}
// Swap the root with the last element, then remove it.
heap[0], heap[len(heap)-1] = heap[len(heap)-1], heap[0]
heap = heap[:len(heap)-1]
// Sift the root down.
heapSiftDown(heap, 0)
return heap
}
func heapSiftUp(heap []*batchCursor, i int) int {
for i > 0 && heap[(i-1)/2].ev.time > heap[i].ev.time {
heap[(i-1)/2], heap[i] = heap[i], heap[(i-1)/2]
i = (i - 1) / 2
}
return i
}
func heapSiftDown(heap []*batchCursor, i int) int {
for {
m := min3(heap, i, 2*i+1, 2*i+2)
if m == i {
// Heap invariant already applies.
break
}
heap[i], heap[m] = heap[m], heap[i]
i = m
}
return i
}
func min3(b []*batchCursor, i0, i1, i2 int) int {
minIdx := i0
minT := maxTime
if i0 < len(b) {
minT = b[i0].ev.time
}
if i1 < len(b) {
if t := b[i1].ev.time; t < minT {
minT = t
minIdx = i1
}
}
if i2 < len(b) {
if t := b[i2].ev.time; t < minT {
minT = t
minIdx = i2
}
}
return minIdx
}
|
