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
|
package terraform
import (
"fmt"
"log"
"github.com/hashicorp/terraform/config/module"
"github.com/hashicorp/terraform/dag"
)
// DiffTransformer is a GraphTransformer that adds the elements of
// the diff to the graph.
//
// This transform is used for example by the ApplyGraphBuilder to ensure
// that only resources that are being modified are represented in the graph.
//
// Module and State is still required for the DiffTransformer for annotations
// since the Diff doesn't contain all the information required to build the
// complete graph (such as create-before-destroy information). The graph
// is built based on the diff first, though, ensuring that only resources
// that are being modified are present in the graph.
type DiffTransformer struct {
Concrete ConcreteResourceNodeFunc
Diff *Diff
Module *module.Tree
State *State
}
func (t *DiffTransformer) Transform(g *Graph) error {
// If the diff is nil or empty (nil is empty) then do nothing
if t.Diff.Empty() {
return nil
}
// Go through all the modules in the diff.
log.Printf("[TRACE] DiffTransformer: starting")
var nodes []dag.Vertex
for _, m := range t.Diff.Modules {
log.Printf("[TRACE] DiffTransformer: Module: %s", m)
// TODO: If this is a destroy diff then add a module destroy node
// Go through all the resources in this module.
for name, inst := range m.Resources {
log.Printf("[TRACE] DiffTransformer: Resource %q: %#v", name, inst)
// We have changes! This is a create or update operation.
// First grab the address so we have a unique way to
// reference this resource.
addr, err := parseResourceAddressInternal(name)
if err != nil {
panic(fmt.Sprintf(
"Error parsing internal name, this is a bug: %q", name))
}
// Very important: add the module path for this resource to
// the address. Remove "root" from it.
addr.Path = m.Path[1:]
// If we're destroying, add the destroy node
if inst.Destroy || inst.GetDestroyDeposed() {
abstract := &NodeAbstractResource{Addr: addr}
g.Add(&NodeDestroyResource{NodeAbstractResource: abstract})
}
// If we have changes, then add the applyable version
if len(inst.Attributes) > 0 {
// Add the resource to the graph
abstract := &NodeAbstractResource{Addr: addr}
var node dag.Vertex = abstract
if f := t.Concrete; f != nil {
node = f(abstract)
}
nodes = append(nodes, node)
}
}
}
// Add all the nodes to the graph
for _, n := range nodes {
g.Add(n)
}
return nil
}
|
