Add benchmark test for fast sorted merge iterator

influxdata · Apr 20, 2020 · 1cd5a47 · 1cd5a47
1 parent c7d360d
commit 1cd5a47
Showing 1 changed file with 153 additions and 0 deletions.
diff --git a/query/iterator.gen_test.go b/query/iterator.gen_test.go
@@ -151,3 +151,156 @@ func createFloatSortedMergeHeap(inputs []FloatIterator, opt IteratorOptions) *fl
 	}
 	return h
 }
+
+// a simple iterator that has only a single series
+type simpleFloatIterator struct {
+	point     FloatPoint
+	size      int
+	populated int
+	stats     IteratorStats
+}
+
+func (itr *simpleFloatIterator) Stats() IteratorStats {
+	return itr.stats
+}
+
+func (itr *simpleFloatIterator) Close() error { itr.populated = itr.size; return nil }
+func (itr *simpleFloatIterator) Next() (*FloatPoint, error) {
+	if itr.populated >= itr.size {
+		return nil, nil
+	}
+	p := itr.point.Clone()
+	p.Time += int64(itr.populated * 1000)
+	itr.populated++
+	return p, nil
+}
+
+func BenchmarkSortedMergeIterator_Fast(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		sortedMergeIterFast()
+	}
+}
+
+func BenchmarkSortedMergeIterator_NotFast(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		sortedMergeIterNotFast()
+	}
+}
+
+func sortedMergeIterFast() {
+	inputs := []Iterator{}
+	inputs = append(inputs,
+		&simpleFloatIterator{
+			point: FloatPoint{Name: "cpu", Tags: NewTags(map[string]string{"taga": "aaaaaaaaaa", "tagb": "bbbbbbbbbb", "tagc": "cccccccccc", "tagd": "dddddddddd", "tage": "eeeeeeeeee", "tagf": "one"}), Time: 10, Value: 2},
+			size:  10000,
+			stats: IteratorStats{SeriesN: 1},
+		})
+	inputs = append(inputs,
+		&simpleFloatIterator{
+			point: FloatPoint{Name: "cpu", Tags: NewTags(map[string]string{"taga": "aaaaaaaaaa", "tagb": "bbbbbbbbbb", "tagc": "cccccccccc", "tagd": "dddddddddd", "tage": "eeeeeeeeee", "tagf": "two"}), Time: 10, Value: 2},
+			size:  10000,
+			stats: IteratorStats{SeriesN: 1},
+		})
+	inputs = append(inputs,
+		&simpleFloatIterator{
+			point: FloatPoint{Name: "cpu", Tags: NewTags(map[string]string{"taga": "aaaaaaaaaa", "tagb": "bbbbbbbbbb", "tagc": "cccccccccc", "tagd": "dddddddddd", "tage": "eeeeeeeeee", "tagf": "three"}), Time: 10, Value: 2},
+			size:  10000,
+			stats: IteratorStats{SeriesN: 1},
+		})
+
+	itr := NewSortedMergeIterator(inputs, IteratorOptions{}).(*floatSortedMergeIterator)
+	p, _ := itr.Next()
+	for p != nil {
+		p, _ = itr.Next()
+	}
+}
+
+func sortedMergeIterNotFast() {
+	inputs := []Iterator{}
+	inputs = append(inputs,
+		&simpleFloatIterator{
+			point: FloatPoint{Name: "cpu", Tags: NewTags(map[string]string{"taga": "aaaaaaaaaa", "tagb": "bbbbbbbbbb", "tagc": "cccccccccc", "tagd": "dddddddddd", "tage": "eeeeeeeeee", "tagf": "four"}), Time: 10, Value: 2},
+			size:  10000,
+			stats: IteratorStats{SeriesN: 2},
+		})
+	inputs = append(inputs,
+		&simpleFloatIterator{
+			point: FloatPoint{Name: "cpu", Tags: NewTags(map[string]string{"taga": "aaaaaaaaaa", "tagb": "bbbbbbbbbb", "tagc": "cccccccccc", "tagd": "dddddddddd", "tage": "eeeeeeeeee", "tagf": "five"}), Time: 10, Value: 2},
+			size:  10000,
+			stats: IteratorStats{SeriesN: 2},
+		})
+	inputs = append(inputs,
+		&simpleFloatIterator{
+			point: FloatPoint{Name: "cpu", Tags: NewTags(map[string]string{"taga": "aaaaaaaaaa", "tagb": "bbbbbbbbbb", "tagc": "cccccccccc", "tagd": "dddddddddd", "tage": "eeeeeeeeee", "tagf": "fix"}), Time: 10, Value: 2},
+			size:  10000,
+			stats: IteratorStats{SeriesN: 2},
+		})
+
+	opt := IteratorOptions{
+		Dimensions: []string{"taga", "tagb", "tagc"},
+	}
+	itr := NewSortedMergeIterator(inputs, opt).(*floatSortedMergeIterator)
+	p, _ := itr.Next()
+	for p != nil {
+		p, _ = itr.Next()
+	}
+}
+
+func BenchmarkSortedMergeIterator_FastCheckOverhead(b *testing.B) {
+	inputs := []FloatIterator{}
+	inputs = append(inputs,
+		&simpleFloatIterator{
+			point: FloatPoint{Name: "cpu", Tags: NewTags(map[string]string{"taga": "aaaaaaaaaa", "tagb": "bbbbbbbbbb", "tagc": "cccccccccc", "tagd": "dddddddddd", "tage": "eeeeeeeeee", "tagf": "one"}), Time: 10, Value: 2},
+			size:  10000,
+			stats: IteratorStats{SeriesN: 1},
+		})
+	inputs = append(inputs,
+		&simpleFloatIterator{
+			point: FloatPoint{Name: "cpu", Tags: NewTags(map[string]string{"taga": "aaaaaaaaaa", "tagb": "bbbbbbbbbb", "tagc": "cccccccccc", "tagd": "dddddddddd", "tage": "eeeeeeeeee", "tagf": "two"}), Time: 10, Value: 2},
+			size:  10000,
+			stats: IteratorStats{SeriesN: 1},
+		})
+	inputs = append(inputs,
+		&simpleFloatIterator{
+			point: FloatPoint{Name: "cpu", Tags: NewTags(map[string]string{"taga": "aaaaaaaaaa", "tagb": "bbbbbbbbbb", "tagc": "cccccccccc", "tagd": "dddddddddd", "tage": "eeeeeeeeee", "tagf": "three"}), Time: 10, Value: 2},
+			size:  10000,
+			stats: IteratorStats{SeriesN: 1},
+		})
+	inputs = append(inputs,
+		&simpleFloatIterator{
+			point: FloatPoint{Name: "cpu", Tags: NewTags(map[string]string{"taga": "aaaaaaaaaa", "tagb": "bbbbbbbbbb", "tagc": "cccccccccc", "tagd": "dddddddddd", "tage": "eeeeeeeeee", "tagf": "four"}), Time: 10, Value: 2},
+			size:  1000000,
+			stats: IteratorStats{SeriesN: 1},
+		})
+	inputs = append(inputs,
+		&simpleFloatIterator{
+			point: FloatPoint{Name: "cpu", Tags: NewTags(map[string]string{"taga": "aaaaaaaaaa", "tagb": "bbbbbbbbbb", "tagc": "cccccccccc", "tagd": "dddddddddd", "tage": "eeeeeeeeee", "tagf": "five"}), Time: 10, Value: 2},
+			size:  1000000,
+			stats: IteratorStats{SeriesN: 1},
+		})
+	inputs = append(inputs,
+		&simpleFloatIterator{
+			point: FloatPoint{Name: "cpu", Tags: NewTags(map[string]string{"taga": "aaaaaaaaaa", "tagb": "bbbbbbbbbb", "tagc": "cccccccccc", "tagd": "dddddddddd", "tage": "eeeeeeeeee", "tagf": "fix"}), Time: 10, Value: 2},
+			size:  1000000,
+			stats: IteratorStats{SeriesN: 1},
+		})
+	inputs = append(inputs,
+		&simpleFloatIterator{
+			point: FloatPoint{Name: "cpu", Tags: NewTags(map[string]string{"taga": "aaaaaaaaaa", "tagb": "bbbbbbbbbb", "tagc": "cccccccccc", "tagd": "dddddddddd", "tage": "eeeeeeeeee", "tagf": "one"}), Time: 10, Value: 2},
+			size:  10000,
+			stats: IteratorStats{SeriesN: 1},
+		})
+	h := createFloatSortedMergeHeap(
+		inputs,
+		IteratorOptions{
+			StartTime: influxql.MinTime,
+			EndTime:   influxql.MaxTime,
+		})
+	b.ResetTimer()
+	for i := 0; i < b.N; i++ {
+		h.detectFast()
+		if h.fast {
+			panic("unexpected shortcut")
+		}
+	}
+}