-
Notifications
You must be signed in to change notification settings - Fork 1.3k
/
sets_bench_test.go
132 lines (99 loc) · 2.93 KB
/
sets_bench_test.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
// Copyright 2022 The OPA Authors. All rights reserved.
// Use of this source code is governed by an Apache2
// license that can be found in the LICENSE file.
package topdown
import (
"context"
"fmt"
"testing"
"github.com/open-policy-agent/opa/ast"
"github.com/open-policy-agent/opa/storage"
"github.com/open-policy-agent/opa/storage/inmem"
)
func BenchmarkSetUnion(b *testing.B) {
ctx := context.Background()
sizes := []int{10, 100, 250}
for _, n := range sizes {
for _, m := range sizes {
b.Run(fmt.Sprintf("%dx%d", n, m), func(b *testing.B) {
store := inmem.NewFromObject(map[string]interface{}{"nsets": n, "nsize": m})
// Code is lifted from here:
// https://github.com/open-policy-agent/opa/issues/4979#issue-1332019382
module := `package test
nums := numbers.range(0, data.nsets)
sizes := numbers.range(0, data.nsize)
sets[n] = x {
nums[n]
x := {sprintf("%d,%d", [n, i]) | sizes[i]}
}
combined := union({s | s := sets[_]})`
query := ast.MustParseBody("data.test.combined")
compiler := ast.MustCompileModules(map[string]string{
"test.rego": module,
})
b.ResetTimer()
for i := 0; i < b.N; i++ {
err := storage.Txn(ctx, store, storage.TransactionParams{}, func(txn storage.Transaction) error {
q := NewQuery(query).
WithCompiler(compiler).
WithStore(store).
WithTransaction(txn)
_, err := q.Run(ctx)
if err != nil {
return err
}
return nil
})
if err != nil {
b.Fatal(err)
}
}
})
}
}
}
func BenchmarkSetUnionSlow(b *testing.B) {
// This benchmarks the suggested means to implement union
// without using the builtin, to give us an idea of whether or not
// the builtin is actually making things any faster.
ctx := context.Background()
sizes := []int{10, 100, 250}
for _, n := range sizes {
for _, m := range sizes {
b.Run(fmt.Sprintf("%dx%d", n, m), func(b *testing.B) {
store := inmem.NewFromObject(map[string]interface{}{"nsets": n, "nsize": m})
// Code is lifted from here:
// https://github.com/open-policy-agent/opa/issues/4979#issue-1332019382
module := `package test
nums := numbers.range(0, data.nsets)
sizes := numbers.range(0, data.nsize)
sets[n] = x {
nums[n]
x := {sprintf("%d,%d", [n, i]) | sizes[i]}
}
combined := {t | s := sets[_]; s[t]}`
query := ast.MustParseBody("data.test.combined")
compiler := ast.MustCompileModules(map[string]string{
"test.rego": module,
})
b.ResetTimer()
for i := 0; i < b.N; i++ {
err := storage.Txn(ctx, store, storage.TransactionParams{}, func(txn storage.Transaction) error {
q := NewQuery(query).
WithCompiler(compiler).
WithStore(store).
WithTransaction(txn)
_, err := q.Run(ctx)
if err != nil {
return err
}
return nil
})
if err != nil {
b.Fatal(err)
}
}
})
}
}
}