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.
171 lines
4.5 KiB
Go
171 lines
4.5 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 engine
|
|
|
|
import (
|
|
"fmt"
|
|
|
|
"github.com/purpleidea/mgmt/util/errwrap"
|
|
)
|
|
|
|
// ResCopy copies a resource. This is the main entry point for copying a
|
|
// resource since it does all the common engine-level copying as well.
|
|
func ResCopy(r CopyableRes) (CopyableRes, error) {
|
|
res := r.Copy()
|
|
res.SetKind(r.Kind())
|
|
res.SetName(r.Name())
|
|
|
|
if x, ok := r.(MetaRes); ok {
|
|
dst, ok := res.(MetaRes)
|
|
if !ok {
|
|
// programming error
|
|
panic("meta interfaces are illogical")
|
|
}
|
|
dst.SetMetaParams(x.MetaParams().Copy()) // copy b/c we have it
|
|
}
|
|
|
|
if x, ok := r.(RefreshableRes); ok {
|
|
dst, ok := res.(RefreshableRes)
|
|
if !ok {
|
|
// programming error
|
|
panic("refresh interfaces are illogical")
|
|
}
|
|
dst.SetRefresh(x.Refresh()) // no need to copy atm
|
|
}
|
|
|
|
// copy meta params for resources with auto edges
|
|
if x, ok := r.(EdgeableRes); ok {
|
|
dst, ok := res.(EdgeableRes)
|
|
if !ok {
|
|
// programming error
|
|
panic("autoedge interfaces are illogical")
|
|
}
|
|
dst.SetAutoEdgeMeta(x.AutoEdgeMeta()) // no need to copy atm
|
|
}
|
|
|
|
// copy meta params for resources with auto grouping
|
|
if x, ok := r.(GroupableRes); ok {
|
|
dst, ok := res.(GroupableRes)
|
|
if !ok {
|
|
// programming error
|
|
panic("autogroup interfaces are illogical")
|
|
}
|
|
dst.SetAutoGroupMeta(x.AutoGroupMeta()) // no need to copy atm
|
|
|
|
grouped := []GroupableRes{}
|
|
for _, g := range x.GetGroup() {
|
|
g0, ok := g.(CopyableRes)
|
|
if !ok {
|
|
return nil, fmt.Errorf("resource wasn't copyable")
|
|
}
|
|
g1, err := ResCopy(g0)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
g2, ok := g1.(GroupableRes)
|
|
if !ok {
|
|
return nil, fmt.Errorf("resource wasn't groupable")
|
|
}
|
|
grouped = append(grouped, g2)
|
|
}
|
|
dst.SetGroup(grouped)
|
|
}
|
|
|
|
if x, ok := r.(RecvableRes); ok {
|
|
dst, ok := res.(RecvableRes)
|
|
if !ok {
|
|
// programming error
|
|
panic("recv interfaces are illogical")
|
|
}
|
|
dst.SetRecv(x.Recv()) // no need to copy atm
|
|
}
|
|
|
|
if x, ok := r.(SendableRes); ok {
|
|
dst, ok := res.(SendableRes)
|
|
if !ok {
|
|
// programming error
|
|
panic("send interfaces are illogical")
|
|
}
|
|
if err := dst.Send(x.Sent()); err != nil { // no need to copy atm
|
|
return nil, errwrap.Wrapf(err, "can't copy send")
|
|
}
|
|
}
|
|
|
|
// copy meta params for resources with reversible traits
|
|
if x, ok := r.(ReversibleRes); ok {
|
|
dst, ok := res.(ReversibleRes)
|
|
if !ok {
|
|
// programming error
|
|
panic("reversible interfaces are illogical")
|
|
}
|
|
dst.SetReversibleMeta(x.ReversibleMeta()) // no need to copy atm
|
|
}
|
|
|
|
return res, nil
|
|
}
|
|
|
|
// ResMerge merges a set of resources that are compatible with each other. This
|
|
// is the main entry point for the merging. They must each successfully be able
|
|
// to run AdaptCmp without error.
|
|
func ResMerge(r ...CompatibleRes) (CompatibleRes, error) {
|
|
if len(r) == 0 {
|
|
return nil, fmt.Errorf("zero resources given")
|
|
}
|
|
if len(r) == 1 {
|
|
return r[0], nil
|
|
}
|
|
if len(r) > 2 {
|
|
r0 := r[0]
|
|
r1, err := ResMerge(r[1:]...)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
return ResMerge(r0, r1)
|
|
}
|
|
// now we have r[0] and r[1] to merge here...
|
|
r0 := r[0]
|
|
r1 := r[1]
|
|
if err := AdaptCmp(r0, r1); err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
res, err := r0.Merge(r1) // resource method of this interface
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
// meta should have come over in the copy
|
|
|
|
if x, ok := res.(RefreshableRes); ok {
|
|
x0, ok0 := r0.(RefreshableRes)
|
|
x1, ok1 := r1.(RefreshableRes)
|
|
if !ok0 || !ok1 {
|
|
// programming error
|
|
panic("refresh interfaces are illogical")
|
|
}
|
|
|
|
x.SetRefresh(x0.Refresh() || x1.Refresh()) // true if either is!
|
|
}
|
|
|
|
// the other traits and metaparams can't be merged easily... so we don't
|
|
// merge them, and if they were present and differed, and weren't copied
|
|
// in the ResCopy method, then we should have errored above in AdaptCmp!
|
|
|
|
return res, nil
|
|
}
|