124 lines
3.5 KiB
Go
124 lines
3.5 KiB
Go
package terraform
|
|
|
|
import (
|
|
"log"
|
|
|
|
"github.com/hashicorp/terraform/addrs"
|
|
"github.com/hashicorp/terraform/dag"
|
|
"github.com/hashicorp/terraform/states"
|
|
)
|
|
|
|
// OrphanResourceCountTransformer is a GraphTransformer that adds orphans
|
|
// for an expanded count to the graph. The determination of this depends
|
|
// on the count argument given.
|
|
//
|
|
// Orphans are found by comparing the count to what is found in the state.
|
|
// This transform assumes that if an element in the state is within the count
|
|
// bounds given, that it is not an orphan.
|
|
type OrphanResourceCountTransformer struct {
|
|
Concrete ConcreteResourceInstanceNodeFunc
|
|
|
|
Count int // Actual count of the resource, or -1 if count is not set at all
|
|
Addr addrs.AbsResource // Addr of the resource to look for orphans
|
|
State *states.State // Full global state
|
|
}
|
|
|
|
func (t *OrphanResourceCountTransformer) Transform(g *Graph) error {
|
|
rs := t.State.Resource(t.Addr)
|
|
if rs == nil {
|
|
return nil // Resource doesn't exist in state, so nothing to do!
|
|
}
|
|
|
|
haveKeys := make(map[addrs.InstanceKey]struct{})
|
|
for key := range rs.Instances {
|
|
haveKeys[key] = struct{}{}
|
|
}
|
|
|
|
if t.Count < 0 {
|
|
return t.transformNoCount(haveKeys, g)
|
|
}
|
|
if t.Count == 0 {
|
|
return t.transformZeroCount(haveKeys, g)
|
|
}
|
|
return t.transformCount(haveKeys, g)
|
|
}
|
|
|
|
func (t *OrphanResourceCountTransformer) transformCount(haveKeys map[addrs.InstanceKey]struct{}, g *Graph) error {
|
|
// Due to the logic in Transform, we only get in here if our count is
|
|
// at least one.
|
|
|
|
_, have0Key := haveKeys[addrs.IntKey(0)]
|
|
|
|
for key := range haveKeys {
|
|
if key == addrs.NoKey && !have0Key {
|
|
// If we have no 0-key then we will accept a no-key instance
|
|
// as an alias for it.
|
|
continue
|
|
}
|
|
|
|
i, isInt := key.(addrs.IntKey)
|
|
if isInt && int(i) < t.Count {
|
|
continue
|
|
}
|
|
|
|
abstract := NewNodeAbstractResourceInstance(t.Addr.Instance(key))
|
|
var node dag.Vertex = abstract
|
|
if f := t.Concrete; f != nil {
|
|
node = f(abstract)
|
|
}
|
|
log.Printf("[TRACE] OrphanResourceCount(non-zero): adding %s as %T", t.Addr, node)
|
|
g.Add(node)
|
|
}
|
|
|
|
return nil
|
|
}
|
|
|
|
func (t *OrphanResourceCountTransformer) transformZeroCount(haveKeys map[addrs.InstanceKey]struct{}, g *Graph) error {
|
|
// This case is easy: we need to orphan any keys we have at all.
|
|
|
|
for key := range haveKeys {
|
|
abstract := NewNodeAbstractResourceInstance(t.Addr.Instance(key))
|
|
var node dag.Vertex = abstract
|
|
if f := t.Concrete; f != nil {
|
|
node = f(abstract)
|
|
}
|
|
log.Printf("[TRACE] OrphanResourceCount(zero): adding %s as %T", t.Addr, node)
|
|
g.Add(node)
|
|
}
|
|
|
|
return nil
|
|
}
|
|
|
|
func (t *OrphanResourceCountTransformer) transformNoCount(haveKeys map[addrs.InstanceKey]struct{}, g *Graph) error {
|
|
// Negative count indicates that count is not set at all, in which
|
|
// case we expect to have a single instance with no key set at all.
|
|
// However, we'll also accept an instance with key 0 set as an alias
|
|
// for it, in case the user has just deleted the "count" argument and
|
|
// so wants to keep the first instance in the set.
|
|
|
|
_, haveNoKey := haveKeys[addrs.NoKey]
|
|
_, have0Key := haveKeys[addrs.IntKey(0)]
|
|
keepKey := addrs.NoKey
|
|
if have0Key && !haveNoKey {
|
|
// If we don't have a no-key instance then we can use the 0-key instance
|
|
// instead.
|
|
keepKey = addrs.IntKey(0)
|
|
}
|
|
|
|
for key := range haveKeys {
|
|
if key == keepKey {
|
|
continue
|
|
}
|
|
|
|
abstract := NewNodeAbstractResourceInstance(t.Addr.Instance(key))
|
|
var node dag.Vertex = abstract
|
|
if f := t.Concrete; f != nil {
|
|
node = f(abstract)
|
|
}
|
|
log.Printf("[TRACE] OrphanResourceCount(no-count): adding %s as %T", t.Addr, node)
|
|
g.Add(node)
|
|
}
|
|
|
|
return nil
|
|
}
|