maxmustermann/pulumi
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Eliminate recursive dependency analysis

Browse source
This commit is contained in:
joeduffy 2016-12-01 11:14:05 -08:00
parent e9ca1bf0c0
commit f5c8c926dc
1 changed files with 3 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

9
pkg/compiler/compiler_sema.go
View file

@ -20,15 +20,12 @@ func (c *compiler) buildDocumentSema(w workspace.W, stack *ast.Stack) {
if !c.Diag().Success() {
return
}
// Now ensure that we analyze all dependency ASTs also, which will populate their bound nodes.
for _, ref := range ast.StableBoundDependencies(stack.BoundDependencies) {
c.bindStack(b, w, stack.BoundDependencies[ref].Stack)
}
}
// bindStack performs the two phases of binding plus dependency resolution for the given Stack.
func (c *compiler) bindStack(b Binder, w workspace.W, stack *ast.Stack) {
util.Assert(stack != nil)
// First prepare the AST for binding.
util.Assert(stack.BoundDependencies == nil)
b.PrepareStack(stack)
@ -54,7 +51,7 @@ func (c *compiler) bindStack(b Binder, w workspace.W, stack *ast.Stack) {
return
}
// Finally, actually complete the binding process.
// Complete the binding process.
b.BindStack(stack)
}