This adds the first reversible resource (file) and the necessary engine API hooks to make it all work. This allows a special "reversed" resource to be added to the subsequent graph in the stream when an earlier version "disappears". This disappearance can happen if it was previously in an if statement that then becomes false. It might be wise to combine the use of this meta parameter with the use of the `realize` meta parameter to ensure that your reversed resource actually runs at least once, if there's a chance that it might be gone for a while. This patch also adds a new test harness for testing resources. It doesn't test the "live" aspect of resources, as it doesn't run Watch, but it was designed to ensure CheckApply works as intended, and it runs very quickly with a simplified timeline of happenings.
74 lines
2.4 KiB
Go
74 lines
2.4 KiB
Go
// Mgmt
|
|
// Copyright (C) 2013-2019+ James Shubin and the project contributors
|
|
// Written by James Shubin <james@shubin.ca> and the project contributors
|
|
//
|
|
// This program is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// This program is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
package autogroup
|
|
|
|
import (
|
|
"fmt"
|
|
|
|
"github.com/purpleidea/mgmt/engine"
|
|
"github.com/purpleidea/mgmt/pgraph"
|
|
"github.com/purpleidea/mgmt/util/errwrap"
|
|
)
|
|
|
|
// AutoGroup is the mechanical auto group "runner" that runs the interface spec.
|
|
// TODO: this algorithm may not be correct in all cases. replace if needed!
|
|
func AutoGroup(ag engine.AutoGrouper, g *pgraph.Graph, debug bool, logf func(format string, v ...interface{})) error {
|
|
logf("algorithm: %s...", ag.Name())
|
|
if err := ag.Init(g); err != nil {
|
|
return errwrap.Wrapf(err, "error running autoGroup(init)")
|
|
}
|
|
|
|
for {
|
|
var v, w pgraph.Vertex
|
|
v, w, err := ag.VertexNext() // get pair to compare
|
|
if err != nil {
|
|
return errwrap.Wrapf(err, "error running autoGroup(vertexNext)")
|
|
}
|
|
merged := false
|
|
// save names since they change during the runs
|
|
vStr := fmt.Sprintf("%v", v) // valid even if it is nil
|
|
wStr := fmt.Sprintf("%v", w)
|
|
|
|
if err := ag.VertexCmp(v, w); err != nil { // cmp ?
|
|
if debug {
|
|
logf("!GroupCmp for: %s into: %s", wStr, vStr)
|
|
}
|
|
|
|
// remove grouped vertex and merge edges (res is safe)
|
|
} else if err := VertexMerge(g, v, w, ag.VertexMerge, ag.EdgeMerge); err != nil { // merge...
|
|
logf("!VertexMerge for: %s into: %s", wStr, vStr)
|
|
|
|
} else { // success!
|
|
logf("success for: %s into: %s", wStr, vStr)
|
|
merged = true // woo
|
|
}
|
|
|
|
// did these get used?
|
|
if ok, err := ag.VertexTest(merged); err != nil {
|
|
return errwrap.Wrapf(err, "error running autoGroup(vertexTest)")
|
|
} else if !ok {
|
|
break // done!
|
|
}
|
|
}
|
|
|
|
// It would be great to ensure we didn't add any loops here, but instead
|
|
// of checking now, we'll move the check into the main loop.
|
|
|
|
return nil
|
|
}
|