|
| 1 | +// Copyright The OpenTelemetry Authors |
| 2 | +// |
| 3 | +// Licensed under the Apache License, Version 2.0 (the "License"); |
| 4 | +// you may not use this file except in compliance with the License. |
| 5 | +// You may obtain a copy of the License at |
| 6 | +// |
| 7 | +// http://www.apache.org/licenses/LICENSE-2.0 |
| 8 | +// |
| 9 | +// Unless required by applicable law or agreed to in writing, software |
| 10 | +// distributed under the License is distributed on an "AS IS" BASIS, |
| 11 | +// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 12 | +// See the License for the specific language governing permissions and |
| 13 | +// limitations under the License. |
| 14 | + |
| 15 | +package cascadingfilterprocessor |
| 16 | + |
| 17 | +import ( |
| 18 | + "sync" |
| 19 | + "testing" |
| 20 | + "time" |
| 21 | + |
| 22 | + "github.com/stretchr/testify/assert" |
| 23 | + "github.com/stretchr/testify/require" |
| 24 | + "go.opentelemetry.io/collector/config/configmodels" |
| 25 | + "go.opentelemetry.io/collector/consumer/pdata" |
| 26 | + "go.uber.org/zap" |
| 27 | + |
| 28 | + tsconfig "github.com/open-telemetry/opentelemetry-collector-contrib/processor/cascadingfilterprocessor/config" |
| 29 | + "github.com/open-telemetry/opentelemetry-collector-contrib/processor/cascadingfilterprocessor/sampling" |
| 30 | +) |
| 31 | + |
| 32 | +var testValue = 10 * time.Millisecond |
| 33 | +var cfg = tsconfig.Config{ |
| 34 | + ProcessorSettings: configmodels.ProcessorSettings{}, |
| 35 | + DecisionWait: 2 * time.Second, |
| 36 | + NumTraces: 100, |
| 37 | + ExpectedNewTracesPerSec: 100, |
| 38 | + SpansPerSecond: 1000, |
| 39 | + PolicyCfgs: []tsconfig.PolicyCfg{ |
| 40 | + { |
| 41 | + Name: "duration", |
| 42 | + SpansPerSecond: 10, |
| 43 | + PropertiesCfg: tsconfig.PropertiesCfg{ |
| 44 | + MinDuration: &testValue, |
| 45 | + }, |
| 46 | + }, |
| 47 | + { |
| 48 | + Name: "everything else", |
| 49 | + SpansPerSecond: -1, |
| 50 | + }, |
| 51 | + }, |
| 52 | +} |
| 53 | + |
| 54 | +func fillSpan(span *pdata.Span, durationMicros int64) { |
| 55 | + nowTs := time.Now().UnixNano() |
| 56 | + startTime := nowTs - durationMicros*1000 |
| 57 | + |
| 58 | + span.Attributes().InsertInt("foo", 55) |
| 59 | + span.SetStartTime(pdata.TimestampUnixNano(startTime)) |
| 60 | + span.SetEndTime(pdata.TimestampUnixNano(nowTs)) |
| 61 | +} |
| 62 | + |
| 63 | +func createTrace(fsp *cascadingFilterSpanProcessor, numSpans int, durationMicros int64) *sampling.TraceData { |
| 64 | + var traceBatches []pdata.Traces |
| 65 | + |
| 66 | + traces := pdata.NewTraces() |
| 67 | + traces.ResourceSpans().Resize(1) |
| 68 | + rs := traces.ResourceSpans().At(0) |
| 69 | + rs.InstrumentationLibrarySpans().Resize(1) |
| 70 | + ils := rs.InstrumentationLibrarySpans().At(0) |
| 71 | + |
| 72 | + ils.Spans().Resize(numSpans) |
| 73 | + |
| 74 | + for i := 0; i < numSpans; i++ { |
| 75 | + span := ils.Spans().At(i) |
| 76 | + |
| 77 | + fillSpan(&span, durationMicros) |
| 78 | + } |
| 79 | + |
| 80 | + traceBatches = append(traceBatches, traces) |
| 81 | + |
| 82 | + return &sampling.TraceData{ |
| 83 | + Mutex: sync.Mutex{}, |
| 84 | + Decisions: make([]sampling.Decision, len(fsp.policies)), |
| 85 | + ArrivalTime: time.Time{}, |
| 86 | + DecisionTime: time.Time{}, |
| 87 | + SpanCount: int64(numSpans), |
| 88 | + ReceivedBatches: traceBatches, |
| 89 | + } |
| 90 | +} |
| 91 | + |
| 92 | +func createCascadingEvaluator(t *testing.T) *cascadingFilterSpanProcessor { |
| 93 | + cascading, err := newCascadingFilterSpanProcessor(zap.NewNop(), nil, cfg) |
| 94 | + assert.NoError(t, err) |
| 95 | + return cascading |
| 96 | +} |
| 97 | + |
| 98 | +var ( |
| 99 | + metrics = &policyMetrics{} |
| 100 | +) |
| 101 | + |
| 102 | +func TestSampling(t *testing.T) { |
| 103 | + cascading := createCascadingEvaluator(t) |
| 104 | + |
| 105 | + decision, _ := cascading.makeProvisionalDecision(pdata.NewTraceID([16]byte{0}), createTrace(cascading, 8, 1000000), metrics) |
| 106 | + require.Equal(t, sampling.Sampled, decision) |
| 107 | + |
| 108 | + decision, _ = cascading.makeProvisionalDecision(pdata.NewTraceID([16]byte{1}), createTrace(cascading, 1000, 1000), metrics) |
| 109 | + require.Equal(t, sampling.SecondChance, decision) |
| 110 | +} |
| 111 | + |
| 112 | +func TestSecondChanceEvaluation(t *testing.T) { |
| 113 | + cascading := createCascadingEvaluator(t) |
| 114 | + |
| 115 | + decision, _ := cascading.makeProvisionalDecision(pdata.NewTraceID([16]byte{0}), createTrace(cascading, 8, 1000), metrics) |
| 116 | + require.Equal(t, sampling.SecondChance, decision) |
| 117 | + |
| 118 | + decision, _ = cascading.makeProvisionalDecision(pdata.NewTraceID([16]byte{1}), createTrace(cascading, 8, 1000), metrics) |
| 119 | + require.Equal(t, sampling.SecondChance, decision) |
| 120 | + |
| 121 | + // TODO: This could me optimized to make a decision within cascadingfilter processor, as such span would never fit anyway |
| 122 | + //decision, _ = cascading.makeProvisionalDecision(pdata.NewTraceID([16]byte{1}), createTrace(8000, 1000), metrics) |
| 123 | + //require.Equal(t, sampling.NotSampled, decision) |
| 124 | +} |
| 125 | + |
| 126 | +func TestProbabilisticFilter(t *testing.T) { |
| 127 | + ratio := float32(0.5) |
| 128 | + cfg.ProbabilisticFilteringRatio = &ratio |
| 129 | + cascading := createCascadingEvaluator(t) |
| 130 | + |
| 131 | + trace1 := createTrace(cascading, 8, 1000000) |
| 132 | + decision, _ := cascading.makeProvisionalDecision(pdata.NewTraceID([16]byte{0}), trace1, metrics) |
| 133 | + require.Equal(t, sampling.Sampled, decision) |
| 134 | + require.True(t, trace1.SelectedByProbabilisticFilter) |
| 135 | + |
| 136 | + trace2 := createTrace(cascading, 800, 1000000) |
| 137 | + decision, _ = cascading.makeProvisionalDecision(pdata.NewTraceID([16]byte{1}), trace2, metrics) |
| 138 | + require.Equal(t, sampling.SecondChance, decision) |
| 139 | + require.False(t, trace2.SelectedByProbabilisticFilter) |
| 140 | + |
| 141 | + ratio = float32(0.0) |
| 142 | + cfg.ProbabilisticFilteringRatio = &ratio |
| 143 | +} |
| 144 | + |
| 145 | +//func TestSecondChanceReevaluation(t *testing.T) { |
| 146 | +// cascading := createCascadingEvaluator() |
| 147 | +// |
| 148 | +// decision, _ := cascading.makeProvisionalDecision(pdata.NewTraceID([16]byte{1}), createTrace(100, 1000), metrics) |
| 149 | +// require.Equal(t, sampling.Sampled, decision) |
| 150 | +// |
| 151 | +// // Too much |
| 152 | +// decision, _ = cascading.makeProvisionalDecision(pdata.NewTraceID([16]byte{1}), createTrace(1000, 1000), metrics) |
| 153 | +// require.Equal(t, sampling.NotSampled, decision) |
| 154 | +// |
| 155 | +// // Just right |
| 156 | +// decision, _ = cascading.makeProvisionalDecision(pdata.NewTraceID([16]byte{1}), createTrace(900, 1000), metrics) |
| 157 | +// require.Equal(t, sampling.Sampled, decision) |
| 158 | +//} |
0 commit comments