ed0353e251
* Process deletions conservatively in parallel This commit allows the engine to conservatively delete resources in parallel when it is sure that it is legal to do so. In the absence of a true data-flow oriented step scheduler, this approach provides a significant improvement over the existing serial deletion mechanism. Instead of processing deletes serially, this commit will partition the set of condemned resources into sets of resources that are known to be legally deletable in parallel. The step executor will then execute those independent lists of steps one-by-one until all steps are complete. * CR: Make ResourceSet a normal map * Only use the dependency graph if we can trust it * Reverse polarity of pendingDeletesAreReplaces * CR: un-export a few types * CR: simplify control flow in step generator when scheduling * CR: parents are dependencies, fix loop index * CR: Remove ParentOf, add new test for parent dependencies
140 lines
3.1 KiB
Go
140 lines
3.1 KiB
Go
// Copyright 2016-2018, Pulumi Corporation. All rights reserved.
|
|
|
|
package graph
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"github.com/pulumi/pulumi/pkg/resource"
|
|
"github.com/pulumi/pulumi/pkg/resource/deploy/providers"
|
|
"github.com/pulumi/pulumi/pkg/tokens"
|
|
"github.com/stretchr/testify/assert"
|
|
)
|
|
|
|
func NewProviderResource(pkg, name, id string, deps ...resource.URN) *resource.State {
|
|
t := providers.MakeProviderType(tokens.Package(pkg))
|
|
return &resource.State{
|
|
Type: t,
|
|
URN: resource.NewURN("test", "test", "", t, tokens.QName(name)),
|
|
ID: resource.ID(id),
|
|
Inputs: resource.PropertyMap{},
|
|
Outputs: resource.PropertyMap{},
|
|
Dependencies: deps,
|
|
}
|
|
}
|
|
|
|
func NewResource(name string, provider *resource.State, deps ...resource.URN) *resource.State {
|
|
prov := ""
|
|
if provider != nil {
|
|
p, err := providers.NewReference(provider.URN, provider.ID)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
prov = p.String()
|
|
}
|
|
|
|
t := tokens.Type("test:test:test")
|
|
return &resource.State{
|
|
Type: t,
|
|
URN: resource.NewURN("test", "test", "", t, tokens.QName(name)),
|
|
Inputs: resource.PropertyMap{},
|
|
Outputs: resource.PropertyMap{},
|
|
Dependencies: deps,
|
|
Provider: prov,
|
|
}
|
|
}
|
|
|
|
func TestBasicGraph(t *testing.T) {
|
|
pA := NewProviderResource("test", "pA", "0")
|
|
a := NewResource("a", pA)
|
|
b := NewResource("b", pA, a.URN)
|
|
pB := NewProviderResource("test", "pB", "1", a.URN, b.URN)
|
|
c := NewResource("c", pB, a.URN)
|
|
d := NewResource("d", nil, b.URN)
|
|
|
|
dg := NewDependencyGraph([]*resource.State{
|
|
pA,
|
|
a,
|
|
b,
|
|
pB,
|
|
c,
|
|
d,
|
|
})
|
|
|
|
assert.Equal(t, []*resource.State{
|
|
a, b, pB, c, d,
|
|
}, dg.DependingOn(pA))
|
|
|
|
assert.Equal(t, []*resource.State{
|
|
b, pB, c, d,
|
|
}, dg.DependingOn(a))
|
|
|
|
assert.Equal(t, []*resource.State{
|
|
pB, c, d,
|
|
}, dg.DependingOn(b))
|
|
|
|
assert.Equal(t, []*resource.State{
|
|
c,
|
|
}, dg.DependingOn(pB))
|
|
|
|
assert.Nil(t, dg.DependingOn(c))
|
|
assert.Nil(t, dg.DependingOn(d))
|
|
}
|
|
|
|
// Tests that we don't add the same node to the DependingOn set twice.
|
|
func TestGraphNoDuplicates(t *testing.T) {
|
|
a := NewResource("a", nil)
|
|
b := NewResource("b", nil, a.URN)
|
|
c := NewResource("c", nil, a.URN)
|
|
d := NewResource("d", nil, b.URN, c.URN)
|
|
|
|
dg := NewDependencyGraph([]*resource.State{
|
|
a,
|
|
b,
|
|
c,
|
|
d,
|
|
})
|
|
|
|
assert.Equal(t, []*resource.State{
|
|
b, c, d,
|
|
}, dg.DependingOn(a))
|
|
}
|
|
|
|
func TestDependenciesOf(t *testing.T) {
|
|
pA := NewProviderResource("test", "pA", "0")
|
|
a := NewResource("a", pA)
|
|
b := NewResource("b", pA, a.URN)
|
|
c := NewResource("c", pA)
|
|
d := NewResource("d", pA)
|
|
d.Parent = a.URN
|
|
|
|
dg := NewDependencyGraph([]*resource.State{
|
|
pA,
|
|
a,
|
|
b,
|
|
c,
|
|
d,
|
|
})
|
|
|
|
aDepends := dg.DependenciesOf(a)
|
|
assert.True(t, aDepends[pA])
|
|
assert.False(t, aDepends[a])
|
|
assert.False(t, aDepends[b])
|
|
|
|
bDepends := dg.DependenciesOf(b)
|
|
assert.True(t, bDepends[pA])
|
|
assert.True(t, bDepends[a])
|
|
assert.False(t, bDepends[b])
|
|
|
|
cDepends := dg.DependenciesOf(c)
|
|
assert.True(t, cDepends[pA])
|
|
assert.False(t, cDepends[a])
|
|
assert.False(t, cDepends[b])
|
|
|
|
dDepends := dg.DependenciesOf(d)
|
|
assert.True(t, dDepends[pA])
|
|
assert.True(t, dDepends[a]) // due to A being the parent of D
|
|
assert.False(t, dDepends[b])
|
|
assert.False(t, dDepends[c])
|
|
}
|