This repository has been archived by the owner on Jul 19, 2023. It is now read-only.
/
select_merge.go
514 lines (467 loc) 路 14.4 KB
/
select_merge.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
package querier
import (
"context"
"fmt"
"math"
"sync"
"github.com/google/pprof/profile"
"github.com/grafana/dskit/multierror"
"github.com/opentracing/opentracing-go"
"github.com/prometheus/common/model"
"github.com/samber/lo"
"golang.org/x/sync/errgroup"
otlog "github.com/opentracing/opentracing-go/log"
googlev1 "github.com/grafana/phlare/api/gen/proto/go/google/v1"
ingestv1 "github.com/grafana/phlare/api/gen/proto/go/ingester/v1"
typesv1 "github.com/grafana/phlare/api/gen/proto/go/types/v1"
"github.com/grafana/phlare/pkg/clientpool"
"github.com/grafana/phlare/pkg/iter"
phlaremodel "github.com/grafana/phlare/pkg/model"
"github.com/grafana/phlare/pkg/pprof"
"github.com/grafana/phlare/pkg/util"
"github.com/grafana/phlare/pkg/util/loser"
)
type ProfileWithLabels struct {
Timestamp int64
phlaremodel.Labels
IngesterAddr string
}
type BidiClientMerge[Req any, Res any] interface {
Send(Req) error
Receive() (Res, error)
CloseRequest() error
CloseResponse() error
}
type Request interface {
*ingestv1.MergeProfilesStacktracesRequest | *ingestv1.MergeProfilesLabelsRequest | *ingestv1.MergeProfilesPprofRequest
}
type Response interface {
*ingestv1.MergeProfilesStacktracesResponse | *ingestv1.MergeProfilesLabelsResponse | *ingestv1.MergeProfilesPprofResponse
}
type MergeResult[R any] interface {
Result() (R, error)
}
type MergeIterator interface {
iter.Iterator[*ProfileWithLabels]
Keep()
}
type keepResponse struct {
*ingestv1.MergeProfilesStacktracesRequest
*ingestv1.MergeProfilesLabelsRequest
*ingestv1.MergeProfilesPprofRequest
}
type mergeIterator[R any, Req Request, Res Response] struct {
ctx context.Context
bidi BidiClientMerge[Req, Res]
err error
curr *ingestv1.ProfileSets
currIdx int
keep []bool
keepSent bool // keepSent is true if we have sent the keep request to the ingester.
currentProfile *ProfileWithLabels
response keepResponse
}
// NewMergeIterator return a new iterator that stream profiles and allows to filter them using `Keep` to keep
// only a subset of the profiles for an aggregation result.
// Merging or querying profiles sample values is expensive, we only merge the sample of the profiles that are kept.
// On creating the iterator, we send a request to ingesters to fetch the first batch.
func NewMergeIterator[
R any,
Req Request,
Res Response,
](ctx context.Context, r ResponseFromReplica[BidiClientMerge[Req, Res]],
) *mergeIterator[R, Req, Res] {
it := &mergeIterator[R, Req, Res]{
bidi: r.response,
keepSent: true, // at the start we don't send a keep request.
ctx: ctx,
currentProfile: &ProfileWithLabels{IngesterAddr: r.addr},
currIdx: -1,
response: keepResponse{
MergeProfilesStacktracesRequest: &ingestv1.MergeProfilesStacktracesRequest{},
MergeProfilesLabelsRequest: &ingestv1.MergeProfilesLabelsRequest{},
MergeProfilesPprofRequest: &ingestv1.MergeProfilesPprofRequest{},
},
}
it.fetchBatch()
return it
}
func (s *mergeIterator[R, Req, Res]) Next() bool {
if s.curr == nil || len(s.curr.Profiles) == 0 {
return false
}
if s.currIdx >= len(s.curr.Profiles)-1 {
if !s.keepSent {
var err error
switch bidi := (s.bidi).(type) {
case BidiClientMerge[*ingestv1.MergeProfilesStacktracesRequest, *ingestv1.MergeProfilesStacktracesResponse]:
s.response.MergeProfilesStacktracesRequest.Profiles = s.keep
err = bidi.Send(s.response.MergeProfilesStacktracesRequest)
case BidiClientMerge[*ingestv1.MergeProfilesLabelsRequest, *ingestv1.MergeProfilesLabelsResponse]:
s.response.MergeProfilesLabelsRequest.Profiles = s.keep
err = bidi.Send(s.response.MergeProfilesLabelsRequest)
case BidiClientMerge[*ingestv1.MergeProfilesPprofRequest, *ingestv1.MergeProfilesPprofResponse]:
s.response.MergeProfilesPprofRequest.Profiles = s.keep
err = bidi.Send(s.response.MergeProfilesPprofRequest)
}
if err != nil {
s.err = err
return false
}
}
s.fetchBatch()
if s.curr == nil || len(s.curr.Profiles) == 0 {
return false
}
s.currIdx = 0
s.currentProfile.Timestamp = s.curr.Profiles[s.currIdx].Timestamp
s.currentProfile.Labels = s.curr.LabelsSets[s.curr.Profiles[s.currIdx].LabelIndex].Labels
return true
}
s.currIdx++
s.currentProfile.Timestamp = s.curr.Profiles[s.currIdx].Timestamp
s.currentProfile.Labels = s.curr.LabelsSets[s.curr.Profiles[s.currIdx].LabelIndex].Labels
return true
}
func (s *mergeIterator[R, Req, Res]) fetchBatch() {
var selectedProfiles *ingestv1.ProfileSets
switch bidi := (s.bidi).(type) {
case BidiClientMerge[*ingestv1.MergeProfilesStacktracesRequest, *ingestv1.MergeProfilesStacktracesResponse]:
res, err := bidi.Receive()
if err != nil {
s.err = err
return
}
selectedProfiles = res.SelectedProfiles
case BidiClientMerge[*ingestv1.MergeProfilesLabelsRequest, *ingestv1.MergeProfilesLabelsResponse]:
res, err := bidi.Receive()
if err != nil {
s.err = err
return
}
selectedProfiles = res.SelectedProfiles
case BidiClientMerge[*ingestv1.MergeProfilesPprofRequest, *ingestv1.MergeProfilesPprofResponse]:
res, err := bidi.Receive()
if err != nil {
s.err = err
return
}
selectedProfiles = res.SelectedProfiles
}
s.curr = selectedProfiles
if s.curr == nil {
return
}
if len(s.curr.Profiles) > cap(s.keep) {
s.keep = make([]bool, len(s.curr.Profiles))
}
s.keep = s.keep[:len(s.curr.Profiles)]
// reset selections to none
for i := range s.keep {
s.keep[i] = false
}
s.keepSent = false
}
func (s *mergeIterator[R, Req, Res]) Keep() {
s.keep[s.currIdx] = true
}
func (s *mergeIterator[R, Req, Res]) At() *ProfileWithLabels {
return s.currentProfile
}
func (s *mergeIterator[R, Req, Res]) Result() (R, error) {
var result R
switch bidi := (s.bidi).(type) {
case BidiClientMerge[*ingestv1.MergeProfilesStacktracesRequest, *ingestv1.MergeProfilesStacktracesResponse]:
res, err := bidi.Receive()
if err != nil {
s.err = err
return result, err
}
result = any(res.Result).(R)
case BidiClientMerge[*ingestv1.MergeProfilesLabelsRequest, *ingestv1.MergeProfilesLabelsResponse]:
res, err := bidi.Receive()
if err != nil {
s.err = err
return result, err
}
result = any(res.Series).(R)
case BidiClientMerge[*ingestv1.MergeProfilesPprofRequest, *ingestv1.MergeProfilesPprofResponse]:
res, err := bidi.Receive()
if err != nil {
s.err = err
return result, err
}
result = any(res.Result).(R)
}
if err := s.bidi.CloseResponse(); err != nil {
s.err = err
}
return result, nil
}
func (s *mergeIterator[R, Req, Res]) Err() error {
return s.err
}
func (s *mergeIterator[R, Req, Res]) Close() error {
// Only close the Send side since we need to get the final result.
var errs multierror.MultiError
if err := s.bidi.CloseRequest(); err != nil {
errs = append(errs, err)
}
return errs.Err()
}
// skipDuplicates iterates through the iterator and skip duplicates.
func skipDuplicates(ctx context.Context, its []MergeIterator) error {
span, _ := opentracing.StartSpanFromContext(ctx, "skipDuplicates")
defer span.Finish()
var errors multierror.MultiError
tree := loser.New(its,
&ProfileWithLabels{
Timestamp: math.MaxInt64,
},
func(s MergeIterator) *ProfileWithLabels {
return s.At()
},
func(p1, p2 *ProfileWithLabels) bool {
if p1.Timestamp == p2.Timestamp {
return phlaremodel.CompareLabelPairs(p1.Labels, p2.Labels) < 0
}
return p1.Timestamp < p2.Timestamp
},
func(s MergeIterator) {
if err := s.Close(); err != nil {
errors.Add(err)
}
})
defer tree.Close()
duplicates := 0
total := 0
previousTs := int64(-1)
previousLabels := phlaremodel.Labels{}
for tree.Next() {
next := tree.Winner()
profile := next.At()
total++
if previousTs != profile.Timestamp || phlaremodel.CompareLabelPairs(previousLabels, profile.Labels) != 0 {
previousTs = profile.Timestamp
previousLabels = profile.Labels
next.Keep()
continue
}
duplicates++
}
span.LogFields(otlog.Int("duplicates", duplicates))
span.LogFields(otlog.Int("total", total))
return errors.Err()
}
// selectMergeTree selects the profile from each ingester by deduping them and
// returns merge of stacktrace samples represented as a tree.
func selectMergeTree(ctx context.Context, responses []ResponseFromReplica[clientpool.BidiClientMergeProfilesStacktraces]) (*phlaremodel.Tree, error) {
span, ctx := opentracing.StartSpanFromContext(ctx, "selectMergeTree")
defer span.Finish()
mergeResults := make([]MergeResult[*ingestv1.MergeProfilesStacktracesResult], len(responses))
iters := make([]MergeIterator, len(responses))
var wg sync.WaitGroup
for i, resp := range responses {
wg.Add(1)
go func(i int, resp ResponseFromReplica[clientpool.BidiClientMergeProfilesStacktraces]) {
defer wg.Done()
it := NewMergeIterator[*ingestv1.MergeProfilesStacktracesResult](
ctx, ResponseFromReplica[BidiClientMerge[*ingestv1.MergeProfilesStacktracesRequest, *ingestv1.MergeProfilesStacktracesResponse]]{
addr: resp.addr,
response: resp.response,
})
iters[i] = it
mergeResults[i] = it
}(i, resp)
}
wg.Wait()
if err := skipDuplicates(ctx, iters); err != nil {
return nil, err
}
// Collects the results in parallel.
span.LogFields(otlog.String("msg", "collecting merge results"))
g, _ := errgroup.WithContext(ctx)
m := phlaremodel.NewTreeMerger()
sm := phlaremodel.NewStackTraceMerger()
for _, iter := range mergeResults {
iter := iter
g.Go(util.RecoverPanic(func() error {
result, err := iter.Result()
if err != nil {
return err
}
switch result.Format {
default:
return fmt.Errorf("unknown merge result format")
case ingestv1.StacktracesMergeFormat_MERGE_FORMAT_STACKTRACES:
sm.MergeStackTraces(result.Stacktraces, result.FunctionNames)
case ingestv1.StacktracesMergeFormat_MERGE_FORMAT_TREE:
err = m.MergeTreeBytes(result.TreeBytes)
}
return err
}))
}
if err := g.Wait(); err != nil {
return nil, err
}
if sm.Size() > 0 {
// For backward compatibility: during a rollout, multiple formats
// may coexist for some period of time (efficiency is not a concern).
if err := m.MergeTreeBytes(sm.TreeBytes(-1)); err != nil {
return nil, err
}
}
span.LogFields(otlog.String("msg", "building tree"))
return m.Tree(), nil
}
// selectMergePprofProfile selects the profile from each ingester by deduping them and request merges of stacktraces in the pprof format.
func selectMergePprofProfile(ctx context.Context, ty *typesv1.ProfileType, responses []ResponseFromReplica[clientpool.BidiClientMergeProfilesPprof]) (*googlev1.Profile, error) {
mergeResults := make([]MergeResult[[]byte], len(responses))
iters := make([]MergeIterator, len(responses))
var wg sync.WaitGroup
for i, resp := range responses {
wg.Add(1)
go func(i int, resp ResponseFromReplica[clientpool.BidiClientMergeProfilesPprof]) {
defer wg.Done()
it := NewMergeIterator[[]byte](
ctx, ResponseFromReplica[BidiClientMerge[*ingestv1.MergeProfilesPprofRequest, *ingestv1.MergeProfilesPprofResponse]]{
addr: resp.addr,
response: resp.response,
})
iters[i] = it
mergeResults[i] = it
}(i, resp)
}
wg.Wait()
if err := skipDuplicates(ctx, iters); err != nil {
return nil, err
}
// Collects the results in parallel.
results := make([]*profile.Profile, 0, len(iters))
s := lo.Synchronize()
g, _ := errgroup.WithContext(ctx)
for _, iter := range mergeResults {
iter := iter
g.Go(util.RecoverPanic(func() error {
result, err := iter.Result()
if err != nil {
return err
}
p, err := profile.ParseUncompressed(result)
if err != nil {
return err
}
s.Do(func() {
results = append(results, p)
})
return nil
}))
}
if err := g.Wait(); err != nil {
return nil, err
}
if len(results) == 0 {
empty := &profile.Profile{}
phlaremodel.SetProfileMetadata(empty, ty)
return pprof.FromProfile(empty)
}
p, err := profile.Merge(results)
if err != nil {
return nil, err
}
return pprof.FromProfile(p)
}
type ProfileValue struct {
Ts int64
Lbs []*typesv1.LabelPair
LabelsHash uint64
Value float64
}
func (p ProfileValue) Labels() phlaremodel.Labels {
return p.Lbs
}
func (p ProfileValue) Timestamp() model.Time {
return model.Time(p.Ts)
}
// selectMergeSeries selects the profile from each ingester by deduping them and request merges of total values.
func selectMergeSeries(ctx context.Context, responses []ResponseFromReplica[clientpool.BidiClientMergeProfilesLabels]) (iter.Iterator[ProfileValue], error) {
mergeResults := make([]MergeResult[[]*typesv1.Series], len(responses))
iters := make([]MergeIterator, len(responses))
var wg sync.WaitGroup
for i, resp := range responses {
wg.Add(1)
go func(i int, resp ResponseFromReplica[clientpool.BidiClientMergeProfilesLabels]) {
defer wg.Done()
it := NewMergeIterator[[]*typesv1.Series](
ctx, ResponseFromReplica[BidiClientMerge[*ingestv1.MergeProfilesLabelsRequest, *ingestv1.MergeProfilesLabelsResponse]]{
addr: resp.addr,
response: resp.response,
})
iters[i] = it
mergeResults[i] = it
}(i, resp)
}
wg.Wait()
if err := skipDuplicates(ctx, iters); err != nil {
return nil, err
}
// Collects the results in parallel.
results := make([][]*typesv1.Series, 0, len(iters))
s := lo.Synchronize()
g, _ := errgroup.WithContext(ctx)
for _, iter := range mergeResults {
iter := iter
g.Go(util.RecoverPanic(func() error {
result, err := iter.Result()
if err != nil {
return err
}
s.Do(func() {
results = append(results, result)
})
return nil
}))
}
if err := g.Wait(); err != nil {
return nil, err
}
series := phlaremodel.SumSeries(results...)
seriesIters := make([]iter.Iterator[ProfileValue], 0, len(series))
for _, s := range series {
s := s
seriesIters = append(seriesIters, newSeriesIterator(s.Labels, s.Points))
}
return iter.NewMergeIterator(ProfileValue{Ts: math.MaxInt64}, false, seriesIters...), nil
}
type seriesIterator struct {
point []*typesv1.Point
curr ProfileValue
}
func newSeriesIterator(lbs []*typesv1.LabelPair, points []*typesv1.Point) *seriesIterator {
return &seriesIterator{
point: points,
curr: ProfileValue{
Lbs: lbs,
LabelsHash: phlaremodel.Labels(lbs).Hash(),
},
}
}
func (s *seriesIterator) Next() bool {
if len(s.point) == 0 {
return false
}
p := s.point[0]
s.point = s.point[1:]
s.curr.Ts = p.Timestamp
s.curr.Value = p.Value
return true
}
func (s *seriesIterator) At() ProfileValue {
return s.curr
}
func (s *seriesIterator) Err() error {
return nil
}
func (s *seriesIterator) Close() error {
return nil
}