87004a124e
This changes the resource model to persist input and output properties distinctly, so that when we diff changes, we only do so on the programmer- specified input properties. This eliminates problems when the outputs differ slightly; e.g., when the provider normalizes inputs, adds its own values, or fails to produce new values that match the inputs. This change simultaneously makes progress on pulumi/lumi#90, by beginning tracking the resource objects implicated in a computed property's value. I believe this fixes both #189 and #198.
129 lines
4.4 KiB
Go
129 lines
4.4 KiB
Go
// Licensed to Pulumi Corporation ("Pulumi") under one or more
|
|
// contributor license agreements. See the NOTICE file distributed with
|
|
// this work for additional information regarding copyright ownership.
|
|
// Pulumi licenses this file to You under the Apache License, Version 2.0
|
|
// (the "License"); you may not use this file except in compliance with
|
|
// the License. You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
package resource
|
|
|
|
import (
|
|
"github.com/pulumi/lumi/pkg/graph"
|
|
"github.com/pulumi/lumi/pkg/util/contract"
|
|
)
|
|
|
|
type resourceGraph struct {
|
|
objs []*resourceEdge
|
|
roots []graph.Edge
|
|
}
|
|
|
|
var _ graph.Graph = (*resourceGraph)(nil)
|
|
|
|
// newResourceGraph produces a DAG using the resources' properties embedded URN information.
|
|
func newResourceGraph(resources []Resource) *resourceGraph {
|
|
// First make two maps: one with URNs to resources, the other with resources to vertices.
|
|
urns := make(map[URN]Resource)
|
|
verts := make(map[Resource]*resourceVertex)
|
|
for _, res := range resources {
|
|
contract.Assert(res != nil)
|
|
urn := res.URN()
|
|
contract.Assertf(urns[urn] == nil, "Unexpected duplicate entry '%v' in resource list", urn)
|
|
urns[urn] = res
|
|
verts[res] = newResourceVertex(res)
|
|
}
|
|
|
|
// Now walk the list of resources and connect them to their dependencies.
|
|
for _, res := range resources {
|
|
urn := res.URN()
|
|
fromv := verts[res]
|
|
for dep := range res.Inputs().AllResources() {
|
|
to := urns[dep]
|
|
contract.Assertf(to != nil, "Missing resource for target; from=%v to=%v", urn, dep)
|
|
tov := verts[to]
|
|
contract.Assertf(tov != nil, "Missing vertex entry for target; from=%v to=%v", urn, dep)
|
|
fromv.connectTo(tov)
|
|
}
|
|
}
|
|
|
|
// For all vertices with no ins, make them root nodes.
|
|
var objs []*resourceEdge
|
|
for _, v := range verts {
|
|
if len(v.Ins()) == 0 {
|
|
objs = append(objs, &resourceEdge{to: v})
|
|
}
|
|
}
|
|
|
|
roots := make([]graph.Edge, len(objs))
|
|
for i, root := range objs {
|
|
roots[i] = root
|
|
}
|
|
return &resourceGraph{
|
|
objs: objs,
|
|
roots: roots,
|
|
}
|
|
}
|
|
|
|
func (v *resourceGraph) Objs() []*resourceEdge { return v.objs }
|
|
func (v *resourceGraph) Roots() []graph.Edge { return v.roots }
|
|
|
|
type resourceVertex struct {
|
|
res Resource // this vertex's resource.
|
|
ins []graph.Edge // edges connecting from other vertices into this vertex.
|
|
inres []*resourceEdge
|
|
outs []graph.Edge // edges connecting this vertex to other vertices.
|
|
outres []*resourceEdge
|
|
}
|
|
|
|
var _ graph.Vertex = (*resourceVertex)(nil)
|
|
|
|
func newResourceVertex(res Resource) *resourceVertex {
|
|
return &resourceVertex{res: res}
|
|
}
|
|
|
|
func (v *resourceVertex) Resource() Resource { return v.res }
|
|
func (v *resourceVertex) Data() interface{} { return v.res }
|
|
func (v *resourceVertex) Label() string { return "" }
|
|
func (v *resourceVertex) Ins() []graph.Edge { return v.ins }
|
|
func (v *resourceVertex) InRes() []*resourceEdge { return v.inres }
|
|
func (v *resourceVertex) Outs() []graph.Edge { return v.outs }
|
|
func (v *resourceVertex) OutRes() []*resourceEdge { return v.outres }
|
|
|
|
// connectTo creates an edge connecting the receiver vertex to the argument vertex.
|
|
func (v *resourceVertex) connectTo(to *resourceVertex) {
|
|
e := newResourceEdge(v, to)
|
|
v.outs = append(v.outs, e) // outgoing from this vertex to the other.
|
|
v.outres = append(v.outres, e)
|
|
to.ins = append(to.ins, e) // incoming from this vertex to the other.
|
|
to.inres = append(to.inres, e)
|
|
}
|
|
|
|
type resourceEdge struct {
|
|
to *resourceVertex // the vertex this edge connects to.
|
|
from *resourceVertex // the vertex this edge connects from.
|
|
}
|
|
|
|
var _ graph.Edge = (*resourceEdge)(nil)
|
|
|
|
func newResourceEdge(from *resourceVertex, to *resourceVertex) *resourceEdge {
|
|
return &resourceEdge{from: from, to: to}
|
|
}
|
|
|
|
func (e *resourceEdge) Data() interface{} { return nil }
|
|
func (e *resourceEdge) Label() string { return "" }
|
|
func (e *resourceEdge) To() graph.Vertex { return e.to }
|
|
func (e *resourceEdge) ToStep() *resourceVertex { return e.to }
|
|
func (e *resourceEdge) From() graph.Vertex {
|
|
if e.from == nil {
|
|
return nil
|
|
}
|
|
return e.from
|
|
}
|
|
func (e *resourceEdge) FromObj() *resourceVertex { return e.from }
|