mirror of
https://github.com/opentofu/opentofu.git
synced 2024-12-30 10:47:14 -06:00
198c632e04
The recursive call should only return immediately on error. The switch statement to find the current path should not use ReferenceOutside, as we are getting the path for configuration, not for references. This case would not have been taken currently, since all GraphNodeReferenceOutside are also GraphNodeModulePath.
142 lines
4.0 KiB
Go
142 lines
4.0 KiB
Go
package terraform
|
|
|
|
import (
|
|
"log"
|
|
|
|
"github.com/hashicorp/terraform/addrs"
|
|
"github.com/hashicorp/terraform/configs"
|
|
"github.com/hashicorp/terraform/dag"
|
|
)
|
|
|
|
// ModuleExpansionTransformer is a GraphTransformer that adds graph nodes
|
|
// representing the possible expansion of each module call in the configuration,
|
|
// and ensures that any nodes representing objects declared within a module
|
|
// are dependent on the expansion node so that they will be visited only
|
|
// after the module expansion has been decided.
|
|
//
|
|
// This transform must be applied only after all nodes representing objects
|
|
// that can be contained within modules have already been added.
|
|
type ModuleExpansionTransformer struct {
|
|
Config *configs.Config
|
|
|
|
// Concrete allows injection of a wrapped module node by the graph builder
|
|
// to alter the evaluation behavior.
|
|
Concrete ConcreteModuleNodeFunc
|
|
|
|
closers map[string]*nodeCloseModule
|
|
}
|
|
|
|
func (t *ModuleExpansionTransformer) Transform(g *Graph) error {
|
|
t.closers = make(map[string]*nodeCloseModule)
|
|
// The root module is always a singleton and so does not need expansion
|
|
// processing, but any descendent modules do. We'll process them
|
|
// recursively using t.transform.
|
|
for _, cfg := range t.Config.Children {
|
|
err := t.transform(g, cfg, nil)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
}
|
|
|
|
// Now go through and connect all nodes to their respective module closers.
|
|
// This is done all at once here, because orphaned modules were already
|
|
// handled by the RemovedModuleTransformer, and those module closers are in
|
|
// the graph already, and need to be connected to their parent closers.
|
|
for _, v := range g.Vertices() {
|
|
// skip closers so they don't attach to themselves
|
|
if _, ok := v.(*nodeCloseModule); ok {
|
|
continue
|
|
}
|
|
|
|
// any node that executes within the scope of a module should be a
|
|
// GraphNodeModulePath
|
|
pather, ok := v.(GraphNodeModulePath)
|
|
if !ok {
|
|
continue
|
|
}
|
|
if closer, ok := t.closers[pather.ModulePath().String()]; ok {
|
|
// The module closer depends on each child resource instance, since
|
|
// during apply the module expansion will complete before the
|
|
// individual instances are applied.
|
|
g.Connect(dag.BasicEdge(closer, v))
|
|
}
|
|
}
|
|
|
|
// Modules implicitly depend on their child modules, so connect closers to
|
|
// other which contain their path.
|
|
for _, c := range t.closers {
|
|
for _, d := range t.closers {
|
|
if len(d.Addr) > len(c.Addr) && c.Addr.Equal(d.Addr[:len(c.Addr)]) {
|
|
g.Connect(dag.BasicEdge(c, d))
|
|
}
|
|
}
|
|
}
|
|
|
|
return nil
|
|
}
|
|
|
|
func (t *ModuleExpansionTransformer) transform(g *Graph, c *configs.Config, parentNode dag.Vertex) error {
|
|
_, call := c.Path.Call()
|
|
modCall := c.Parent.Module.ModuleCalls[call.Name]
|
|
|
|
n := &nodeExpandModule{
|
|
Addr: c.Path,
|
|
Config: c.Module,
|
|
ModuleCall: modCall,
|
|
}
|
|
var v dag.Vertex = n
|
|
if t.Concrete != nil {
|
|
v = t.Concrete(n)
|
|
}
|
|
|
|
g.Add(v)
|
|
log.Printf("[TRACE] ModuleExpansionTransformer: Added %s as %T", c.Path, v)
|
|
|
|
if parentNode != nil {
|
|
log.Printf("[TRACE] ModuleExpansionTransformer: %s must wait for expansion of %s", dag.VertexName(v), dag.VertexName(parentNode))
|
|
g.Connect(dag.BasicEdge(v, parentNode))
|
|
}
|
|
|
|
// Add the closer (which acts as the root module node) to provide a
|
|
// single exit point for the expanded module.
|
|
closer := &nodeCloseModule{
|
|
Addr: c.Path,
|
|
}
|
|
g.Add(closer)
|
|
g.Connect(dag.BasicEdge(closer, v))
|
|
t.closers[c.Path.String()] = closer
|
|
|
|
for _, childV := range g.Vertices() {
|
|
// don't connect a node to itself
|
|
if childV == v {
|
|
continue
|
|
}
|
|
|
|
var path addrs.Module
|
|
switch t := childV.(type) {
|
|
case GraphNodeDestroyer:
|
|
// skip destroyers, as they can only depend on other resources.
|
|
continue
|
|
|
|
case GraphNodeModulePath:
|
|
path = t.ModulePath()
|
|
default:
|
|
continue
|
|
}
|
|
|
|
if path.Equal(c.Path) {
|
|
log.Printf("[TRACE] ModuleExpansionTransformer: %s must wait for expansion of %s", dag.VertexName(childV), c.Path)
|
|
g.Connect(dag.BasicEdge(childV, v))
|
|
}
|
|
}
|
|
|
|
// Also visit child modules, recursively.
|
|
for _, cc := range c.Children {
|
|
if err := t.transform(g, cc, v); err != nil {
|
|
return err
|
|
}
|
|
}
|
|
|
|
return nil
|
|
}
|