-
Notifications
You must be signed in to change notification settings - Fork 533
/
control_flow_bench_test.go
277 lines (241 loc) · 6.88 KB
/
control_flow_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
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
// Copyright ©2017 The Gonum Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package flow
import (
"flag"
"fmt"
"math"
"os"
"path/filepath"
"strings"
"testing"
"golang.org/x/exp/rand"
"gonum.org/v1/gonum/graph"
"gonum.org/v1/gonum/graph/encoding"
"gonum.org/v1/gonum/graph/encoding/dot"
"gonum.org/v1/gonum/graph/graphs/gen"
"gonum.org/v1/gonum/graph/iterator"
"gonum.org/v1/gonum/graph/simple"
"gonum.org/v1/gonum/graph/topo"
)
var slta = flag.Bool("slta", false, "specify DominatorsSLT benchmark")
func BenchmarkDominators(b *testing.B) {
testdata := filepath.FromSlash("./testdata/flow")
fis, err := os.ReadDir(testdata)
if err != nil {
if os.IsNotExist(err) {
b.Skipf("no control flow testdata: %v", err)
}
b.Fatalf("failed to open control flow testdata: %v", err)
}
for _, fi := range fis {
name := fi.Name()
ext := filepath.Ext(name)
if ext != ".dot" {
continue
}
test := name[:len(name)-len(ext)]
data, err := os.ReadFile(filepath.Join(testdata, name))
if err != nil {
b.Errorf("failed to open control flow case: %v", err)
continue
}
g := &labeled{DirectedGraph: simple.NewDirectedGraph()}
err = dot.Unmarshal(data, g)
if err != nil {
b.Errorf("failed to unmarshal graph data: %v", err)
continue
}
want := g.root
if want == nil {
b.Error("no entry node label for graph")
continue
}
if *slta {
b.Run(test, func(b *testing.B) {
for i := 0; i < b.N; i++ {
d := DominatorsSLT(g.root, g)
if got := d.Root(); got.ID() != want.ID() {
b.Fatalf("unexpected root node: got:%d want:%d", got.ID(), want.ID())
}
}
})
} else {
b.Run(test, func(b *testing.B) {
for i := 0; i < b.N; i++ {
d := Dominators(g.root, g)
if got := d.Root(); got.ID() != want.ID() {
b.Fatalf("unexpected root node: got:%d want:%d", got.ID(), want.ID())
}
}
})
}
}
}
type labeled struct {
*simple.DirectedGraph
root *node
}
func (g *labeled) NewNode() graph.Node {
return &node{Node: g.DirectedGraph.NewNode(), g: g}
}
func (g *labeled) SetEdge(e graph.Edge) {
if e.To().ID() == e.From().ID() {
// Do not attempt to add self edges.
return
}
g.DirectedGraph.SetEdge(e)
}
type node struct {
graph.Node
name string
g *labeled
}
func (n *node) SetDOTID(id string) {
n.name = id
}
func (n *node) SetAttribute(attr encoding.Attribute) error {
if attr.Key != "label" {
return nil
}
switch attr.Value {
default:
if attr.Value != `"{%0}"` && !strings.HasPrefix(attr.Value, `"{%0|`) {
return nil
}
fallthrough
case "entry", "root":
if n.g.root != nil {
return fmt.Errorf("set root for graph with existing root: old=%q new=%q", n.g.root.name, n.name)
}
n.g.root = n
}
return nil
}
func BenchmarkRandomGraphDominators(b *testing.B) {
tests := []struct {
name string
g func() *simple.DirectedGraph
}{
{name: "gnm-n=1e3-m=1e3", g: gnm(1e3, 1e3)},
{name: "gnm-n=1e3-m=3e3", g: gnm(1e3, 3e3)},
{name: "gnm-n=1e3-m=1e4", g: gnm(1e3, 1e4)},
{name: "gnm-n=1e3-m=3e4", g: gnm(1e3, 3e4)},
{name: "gnm-n=1e4-m=1e4", g: gnm(1e4, 1e4)},
{name: "gnm-n=1e4-m=3e4", g: gnm(1e4, 3e4)},
{name: "gnm-n=1e4-m=1e5", g: gnm(1e4, 1e5)},
{name: "gnm-n=1e4-m=3e5", g: gnm(1e4, 3e5)},
{name: "gnm-n=1e5-m=1e5", g: gnm(1e5, 1e5)},
{name: "gnm-n=1e5-m=3e5", g: gnm(1e5, 3e5)},
{name: "gnm-n=1e5-m=1e6", g: gnm(1e5, 1e6)},
{name: "gnm-n=1e5-m=3e6", g: gnm(1e5, 3e6)},
{name: "gnm-n=1e6-m=1e6", g: gnm(1e6, 1e6)},
{name: "gnm-n=1e6-m=3e6", g: gnm(1e6, 3e6)},
{name: "gnm-n=1e6-m=1e7", g: gnm(1e6, 1e7)},
{name: "gnm-n=1e6-m=3e7", g: gnm(1e6, 3e7)},
{name: "dup-n=1e3-d=0.8-a=0.1", g: duplication(1e3, 0.8, 0.1, math.NaN())},
{name: "dup-n=1e3-d=0.5-a=0.2", g: duplication(1e3, 0.5, 0.2, math.NaN())},
{name: "dup-n=1e4-d=0.8-a=0.1", g: duplication(1e4, 0.8, 0.1, math.NaN())},
{name: "dup-n=1e4-d=0.5-a=0.2", g: duplication(1e4, 0.5, 0.2, math.NaN())},
{name: "dup-n=1e5-d=0.8-a=0.1", g: duplication(1e5, 0.8, 0.1, math.NaN())},
{name: "dup-n=1e5-d=0.5-a=0.2", g: duplication(1e5, 0.5, 0.2, math.NaN())},
}
for _, test := range tests {
rnd := rand.New(rand.NewSource(1))
g := test.g()
// Guess a maximally expensive entry to the graph.
sort, err := topo.Sort(g)
root := sort[0]
if root == nil {
// If we did not get a node in the first position
// then there must be an unorderable set of nodes
// in the first position of the error. Pick one
// of the nodes at random.
unordered := err.(topo.Unorderable)
root = unordered[0][rnd.Intn(len(unordered[0]))]
}
if root == nil {
b.Error("no entry node label for graph")
continue
}
if len(sort) > 1 {
// Ensure that the graph has a complete path
// through the sorted nodes.
// unordered will only be accessed if there is
// a sort element that is nil, in which case
// unordered will contain a set of nodes from
// an SCC.
unordered, _ := err.(topo.Unorderable)
var ui int
for i, v := range sort[1:] {
u := sort[i]
if u == nil {
u = unordered[ui][rnd.Intn(len(unordered[ui]))]
ui++
}
if v == nil {
v = unordered[ui][rnd.Intn(len(unordered[ui]))]
}
if !g.HasEdgeFromTo(u.ID(), v.ID()) {
g.SetEdge(g.NewEdge(u, v))
}
}
}
b.Run(test.name, func(b *testing.B) {
for i := 0; i < b.N; i++ {
d := Dominators(root, g)
if got := d.Root(); got.ID() != root.ID() {
b.Fatalf("unexpected root node: got:%d want:%d", got.ID(), root.ID())
}
}
})
}
}
// gnm returns a directed G(n,m) Erdõs-Rényi graph.
func gnm(n, m int) func() *simple.DirectedGraph {
return func() *simple.DirectedGraph {
dg := simple.NewDirectedGraph()
err := gen.Gnm(dg, n, m, rand.New(rand.NewSource(1)))
if err != nil {
panic(err)
}
return dg
}
}
// duplication returns an edge-induced directed subgraph of a
// duplication graph.
func duplication(n int, delta, alpha, sigma float64) func() *simple.DirectedGraph {
return func() *simple.DirectedGraph {
g := undirected{simple.NewDirectedGraph()}
rnd := rand.New(rand.NewSource(1))
err := gen.Duplication(g, n, delta, alpha, sigma, rnd)
if err != nil {
panic(err)
}
for _, e := range graph.EdgesOf(g.Edges()) {
if rnd.Intn(2) == 0 {
g.RemoveEdge(e.From().ID(), e.To().ID())
}
}
return g.DirectedGraph
}
}
type undirected struct {
*simple.DirectedGraph
}
func (g undirected) From(id int64) graph.Nodes {
return iterator.NewOrderedNodes(append(
graph.NodesOf(g.DirectedGraph.From(id)),
graph.NodesOf(g.DirectedGraph.To(id))...))
}
func (g undirected) HasEdgeBetween(xid, yid int64) bool {
return g.DirectedGraph.HasEdgeFromTo(xid, yid)
}
func (g undirected) EdgeBetween(xid, yid int64) graph.Edge {
return g.DirectedGraph.Edge(xid, yid)
}
func (g undirected) SetEdge(e graph.Edge) {
g.DirectedGraph.SetEdge(e)
g.DirectedGraph.SetEdge(g.DirectedGraph.NewEdge(e.To(), e.From()))
}