-
Notifications
You must be signed in to change notification settings - Fork 1.1k
/
dependency_graph_rapid_test.go
398 lines (352 loc) 路 10.8 KB
/
dependency_graph_rapid_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
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
// Copyright 2016-2021, Pulumi Corporation.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// Model-checks dependency_graph functionality against simple models
// using property-based testing.
//
// Currently this assumes a simplified model of `resource.State`
// relevant to dependency calculations; `dependency_graph` only
// accesses these fields:
//
// type State struct {
// Dependencies []resource.URN
// URN resource.URN
// Parent resource.URN
// Provider string
// Custom bool
// }
//
// At the moment only `Custom=true` (Custom, not Component) resources
// are tested.
package graph
import (
"bytes"
"fmt"
"io"
"testing"
"pgregory.net/rapid"
"github.com/pulumi/pulumi/sdk/v3/go/common/resource"
"github.com/stretchr/testify/assert"
"github.com/stretchr/testify/require"
)
// Models ------------------------------------------------------------------------------------------
var isParent R = func(child, parent *resource.State) bool {
return child.Parent == parent.URN
}
var hasProvider R = func(res, provider *resource.State) bool {
return resource.URN(res.Provider) == provider.URN
}
var hasDependency R = func(res, dependency *resource.State) bool {
for _, dep := range res.Dependencies {
if dependency.URN == dep {
return true
}
}
return false
}
var expectedDependenciesOf R = union(isParent, hasProvider, hasDependency)
// Verify `DependneciesOf` against `expectedDependenciesOf`.
func TestRapidDependenciesOf(t *testing.T) {
t.Parallel()
graphCheck(t, func(t *rapid.T, universe []*resource.State) {
dg := NewDependencyGraph(universe)
for _, a := range universe {
aD := dg.DependenciesOf(a)
for _, b := range universe {
if isParent(a, b) {
assert.Truef(t, aD[b],
"DependenciesOf(%v) is missing a parent %v",
a.URN, b.URN)
}
if hasProvider(a, b) {
assert.Truef(t, aD[b],
"DependenciesOf(%v) is missing a provider %v",
a.URN, b.URN)
}
if hasDependency(a, b) {
assert.Truef(t, aD[b],
"DependenciesOf(%v) is missing a dependecy %v",
a.URN, b.URN)
}
if aD[b] {
assert.True(t, expectedDependenciesOf(a, b),
"DependenciesOf(%v) includes an unexpected %v",
a.URN, b.URN)
}
}
}
})
}
// Additionally verify no immediate loops in `DependenciesOf`, no `B
// in DependenciesOf(A) && A in DependenciesOf(B)`.
func TestRapidDependenciesOfAntisymmetric(t *testing.T) {
t.Parallel()
graphCheck(t, func(t *rapid.T, universe []*resource.State) {
dg := NewDependencyGraph(universe)
for _, a := range universe {
aD := dg.DependenciesOf(a)
for _, b := range universe {
bD := dg.DependenciesOf(b)
assert.Falsef(t, aD[b] && bD[a],
"DependenciesOf symmetric over (%v, %v)", a.URN, b.URN)
}
}
})
}
// Model `DependingOn`.
func expectedDependingOn(universe []*resource.State, includeChildren bool) R {
if !includeChildren {
// TODO currently DependingOn is not the inverse transitive
// closure of `dependenciesOf`. Should this be
// `expectedDependenciesOf`?
restrictedDependenciesOf := union(hasProvider, hasDependency)
return inverse(transitively(universe)(restrictedDependenciesOf))
}
dependingOn := expectedDependingOn(universe, false)
return transitively(universe)(func(a, b *resource.State) bool {
if dependingOn(a, b) || isParent(b, a) {
return true
}
for _, x := range universe {
if dependingOn(x, b) && isParent(x, a) {
return true
}
}
return false
})
}
// Verify `DependingOn` against `expectedDependingOn`. Note that
// `DependingOn` is specialised with an empty ignore map, the ignore
// map is not tested yet.
func TestRapidDependingOn(t *testing.T) {
t.Parallel()
test := func(t *rapid.T, universe []*resource.State, includingChildren bool) {
expected := expectedDependingOn(universe, includingChildren)
dg := NewDependencyGraph(universe)
dependingOn := func(a, b *resource.State) bool {
for _, x := range dg.DependingOn(a, nil, includingChildren) {
if b.URN == x.URN {
return true
}
}
return false
}
for _, a := range universe {
for _, b := range universe {
actual := dependingOn(a, b)
assert.Equalf(t, expected(a, b), actual,
"Unexpected %v in dg.DependingOn(%v) = %v",
b.URN, a.URN, actual)
}
}
}
//nolint:paralleltest // false positive because range var isn't used directly in t.Run(name) arg
for _, includingChildren := range []bool{false, true} {
includingChildren := includingChildren
t.Run(fmt.Sprintf("includingChildren=%v", includingChildren), func(t *testing.T) {
t.Parallel()
graphCheck(t, func(t *rapid.T, universe []*resource.State) {
test(t, universe, includingChildren)
})
})
}
}
// Verify `DependingOn` results are ordered, if `D1` in
// `DependingOn(D2)` then `D1` appears before `D2`.
func TestRapidDependingOnOrdered(t *testing.T) {
t.Parallel()
test := func(t *rapid.T, universe []*resource.State, includingChildren bool) {
expectedDependingOn := expectedDependingOn(universe, includingChildren)
dg := NewDependencyGraph(universe)
for _, a := range universe {
depOnA := dg.DependingOn(a, nil, includingChildren)
for d1i, d1 := range depOnA {
for d2i, d2 := range depOnA {
if expectedDependingOn(d2, d1) {
require.Truef(t, d2i < d1i,
"%v should appear before %v",
d2.URN, d1.URN)
}
}
}
}
}
//nolint:paralleltest // false positive because range var isn't used directly in t.Run(name) arg
for _, includingChildren := range []bool{false, true} {
includingChildren := includingChildren
t.Run(fmt.Sprintf("includingChildren=%v", includingChildren), func(t *testing.T) {
t.Parallel()
graphCheck(t, func(t *rapid.T, universe []*resource.State) {
test(t, universe, includingChildren)
})
})
}
}
func TestRapidTransitiveDependenciesOf(t *testing.T) {
t.Parallel()
graphCheck(t, func(t *rapid.T, universe []*resource.State) {
expectedInTDepsOf := transitively(universe)(expectedDependenciesOf)
dg := NewDependencyGraph(universe)
for _, a := range universe {
tda := dg.TransitiveDependenciesOf(a)
for _, b := range universe {
assert.Equalf(t,
expectedInTDepsOf(a, b),
tda[b],
"Mismatch on a=%v, b=%b",
a.URN,
b.URN)
}
}
})
}
// Generators --------------------------------------------------------------------------------------
// Generates ordered values of type `[]ResourceState` that:
//
// - Have unique URNs
// - May reference preceding resouces in the slice as r.Parent
// - May reference preceding resouces in the slice in r.Dependencies
//
// In other words these slices conform with `NewDependencyGraph`
// ordering assumptions. There is a tradedoff: generated values will
// not test any error-checking code in `NewDependencyGraph`, but will
// more efficiently explore more complicated properties on the valid
// subspace of inputs.
//
// What is not currently done but may need to be extended:
//
// - Support Component resources
// - Support non-nil r.Provider references
func resourceStateSliceGenerator() *rapid.Generator {
urnGen := rapid.StringMatching(`urn:pulumi:a::b::c:d:e::[abcd][123]`)
stateGen := rapid.Custom(func(t *rapid.T) *resource.State {
urn := urnGen.Draw(t, "URN").(string)
return &resource.State{
Custom: true,
URN: resource.URN(urn),
}
})
getUrn := func(st *resource.State) resource.URN { return st.URN }
statesGen := rapid.SliceOfDistinct(stateGen, getUrn)
return rapid.Custom(func(t *rapid.T) []*resource.State {
states := statesGen.Draw(t, "states").([]*resource.State)
randInt := rapid.IntRange(-len(states), len(states))
for i, r := range states {
// Any resource at index `i` may want to declare `j < i` as parent.
// Sample negative `j` to means "no parent".
j := randInt.Draw(t, fmt.Sprintf("j%d", i)).(int)
if j >= 0 && j < i {
r.Parent = states[j].URN
}
// Similarly we can depend on resources defined prior.
deps := rapid.SliceOfDistinct(
randInt,
func(i int) int { return i },
).Draw(t, fmt.Sprintf("deps%d", i)).([]int)
for _, dep := range deps {
if dep >= 0 && dep < i {
r.Dependencies = append(r.Dependencies, states[dep].URN)
}
}
}
return states
})
}
// Helper code: relations --------------------------------------------------------------------------
// Shorthand for relations over `*resource.State`
type R = func(a, b *resource.State) bool
// Union of one or more relations.
func union(rs ...R) R {
return func(a, b *resource.State) bool {
for _, r := range rs {
if r(a, b) {
return true
}
}
return false
}
}
// Flips the relation, `inverse(R)(a,b) = R(b,a)`.
func inverse(r R) R {
return func(a, b *resource.State) bool {
return r(b, a)
}
}
// Memoized transitive closure of a relation.
func transitively(universe []*resource.State) func(R) R {
return func(rel R) R {
trel := make(map[*resource.State]map[*resource.State]bool)
for _, a := range universe {
trel[a] = make(map[*resource.State]bool)
for _, b := range universe {
if rel(a, b) {
trel[a][b] = true
}
}
}
extend := func() bool {
more := false
for _, a := range universe {
for _, b := range universe {
if !trel[a][b] {
for _, x := range universe {
if trel[x][b] && rel(a, x) {
trel[a][b] = true
more = true
}
}
}
}
}
return more
}
for extend() {
}
return func(a, b *resource.State) bool {
return trel[a][b]
}
}
}
// Helper code: misc -------------------------------------------------------------------------------
func printState(w io.Writer, st *resource.State) {
fmt.Fprintf(w, "%s", st.URN)
if st.Parent != "" {
fmt.Fprintf(w, " parent=%s", st.Parent)
}
if len(st.Dependencies) > 0 {
fmt.Fprintf(w, " deps=[")
for _, d := range st.Dependencies {
fmt.Fprintf(w, "%s, ", d)
}
fmt.Fprintf(w, "]")
}
fmt.Fprintf(w, "\n")
}
func showStates(sts []*resource.State) string {
buf := &bytes.Buffer{}
fmt.Fprintf(buf, "[\n\n")
for _, st := range sts {
printState(buf, st)
fmt.Fprintf(buf, "\n\n")
}
fmt.Fprintf(buf, "]")
return buf.String()
}
func graphCheck(t *testing.T, check func(*rapid.T, []*resource.State)) {
rss := resourceStateSliceGenerator()
rapid.Check(t, func(t *rapid.T) {
universe := rss.Draw(t, "universe").([]*resource.State)
t.Logf("Checking universe: %s", showStates(universe))
check(t, universe)
})
}