lang: Add an Apply iterator to the Stmt and Expr API

This adds a new interface Node which must implement the Apply method.
This method traverse the entire AST and applies a function to each node.
Both Stmt and Expr must implement this.
This commit is contained in:
James Shubin
2018-07-03 20:35:35 -04:00
parent 3f42e5f702
commit 158bc1eb2a
2 changed files with 292 additions and 0 deletions

View File

@@ -23,10 +23,18 @@ import (
"github.com/purpleidea/mgmt/pgraph" "github.com/purpleidea/mgmt/pgraph"
) )
// Node represents either a Stmt or an Expr. It contains the minimum set of
// methods that they must both implement. In practice it is not used especially
// often since we usually know which kind of node we want.
type Node interface {
Apply(fn func(Node) error) error
}
// Stmt represents a statement node in the language. A stmt could be a resource, // Stmt represents a statement node in the language. A stmt could be a resource,
// a `bind` statement, or even an `if` statement. (Different from an `if` // a `bind` statement, or even an `if` statement. (Different from an `if`
// expression.) // expression.)
type Stmt interface { type Stmt interface {
Node
Init(*Data) error // initialize the populated node and validate Init(*Data) error // initialize the populated node and validate
Interpolate() (Stmt, error) // return expanded form of AST as a new AST Interpolate() (Stmt, error) // return expanded form of AST as a new AST
SetScope(*Scope) error // set the scope here and propagate it downwards SetScope(*Scope) error // set the scope here and propagate it downwards
@@ -40,6 +48,7 @@ type Stmt interface {
// easily copied and moved around. Expr also implements pgraph.Vertex so that // easily copied and moved around. Expr also implements pgraph.Vertex so that
// these can be stored as pointers in our graph data structure. // these can be stored as pointers in our graph data structure.
type Expr interface { type Expr interface {
Node
pgraph.Vertex // must implement this since we store these in our graphs pgraph.Vertex // must implement this since we store these in our graphs
Init(*Data) error // initialize the populated node and validate Init(*Data) error // initialize the populated node and validate
Interpolate() (Expr, error) // return expanded form of AST as a new AST Interpolate() (Expr, error) // return expanded form of AST as a new AST

View File

@@ -60,6 +60,18 @@ type StmtBind struct {
Value interfaces.Expr Value interfaces.Expr
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *StmtBind) Apply(fn func(interfaces.Node) error) error {
if err := obj.Value.Apply(fn); err != nil {
return err
}
return fn(obj)
}
// Init initializes this branch of the AST, and returns an error if it fails to // Init initializes this branch of the AST, and returns an error if it fails to
// validate. // validate.
func (obj *StmtBind) Init(data *interfaces.Data) error { func (obj *StmtBind) Init(data *interfaces.Data) error {
@@ -132,6 +144,23 @@ type StmtRes struct {
Contents []StmtResContents // list of fields/edges in parsed order Contents []StmtResContents // list of fields/edges in parsed order
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *StmtRes) Apply(fn func(interfaces.Node) error) error {
if err := obj.Name.Apply(fn); err != nil {
return err
}
for _, x := range obj.Contents {
if err := x.Apply(fn); err != nil {
return err
}
}
return fn(obj)
}
// Init initializes this branch of the AST, and returns an error if it fails to // Init initializes this branch of the AST, and returns an error if it fails to
// validate. // validate.
func (obj *StmtRes) Init(data *interfaces.Data) error { func (obj *StmtRes) Init(data *interfaces.Data) error {
@@ -521,6 +550,7 @@ func (obj *StmtRes) edges() ([]*interfaces.Edge, error) {
// StmtResContents is the interface that is met by the resource contents. Look // StmtResContents is the interface that is met by the resource contents. Look
// closely for while it is similar to the Stmt interface, it is quite different. // closely for while it is similar to the Stmt interface, it is quite different.
type StmtResContents interface { type StmtResContents interface {
interfaces.Node
Init(*interfaces.Data) error Init(*interfaces.Data) error
Interpolate() (StmtResContents, error) // different! Interpolate() (StmtResContents, error) // different!
SetScope(*interfaces.Scope) error SetScope(*interfaces.Scope) error
@@ -536,6 +566,23 @@ type StmtResField struct {
Condition interfaces.Expr // the value will be used if nil or true Condition interfaces.Expr // the value will be used if nil or true
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *StmtResField) Apply(fn func(interfaces.Node) error) error {
if obj.Condition != nil {
if err := obj.Condition.Apply(fn); err != nil {
return err
}
}
if err := obj.Value.Apply(fn); err != nil {
return err
}
return fn(obj)
}
// Init initializes this branch of the AST, and returns an error if it fails to // Init initializes this branch of the AST, and returns an error if it fails to
// validate. // validate.
func (obj *StmtResField) Init(data *interfaces.Data) error { func (obj *StmtResField) Init(data *interfaces.Data) error {
@@ -682,6 +729,23 @@ type StmtResEdge struct {
Condition interfaces.Expr // the value will be used if nil or true Condition interfaces.Expr // the value will be used if nil or true
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *StmtResEdge) Apply(fn func(interfaces.Node) error) error {
if obj.Condition != nil {
if err := obj.Condition.Apply(fn); err != nil {
return err
}
}
if err := obj.EdgeHalf.Apply(fn); err != nil {
return err
}
return fn(obj)
}
// Init initializes this branch of the AST, and returns an error if it fails to // Init initializes this branch of the AST, and returns an error if it fails to
// validate. // validate.
func (obj *StmtResEdge) Init(data *interfaces.Data) error { func (obj *StmtResEdge) Init(data *interfaces.Data) error {
@@ -810,6 +874,20 @@ type StmtEdge struct {
Notify bool // specifies that this edge sends a notification as well Notify bool // specifies that this edge sends a notification as well
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *StmtEdge) Apply(fn func(interfaces.Node) error) error {
for _, x := range obj.EdgeHalfList {
if err := x.Apply(fn); err != nil {
return err
}
}
return fn(obj)
}
// Init initializes this branch of the AST, and returns an error if it fails to // Init initializes this branch of the AST, and returns an error if it fails to
// validate. // validate.
func (obj *StmtEdge) Init(data *interfaces.Data) error { func (obj *StmtEdge) Init(data *interfaces.Data) error {
@@ -965,6 +1043,18 @@ type StmtEdgeHalf struct {
SendRecv string // name of field to send/recv from, empty to ignore SendRecv string // name of field to send/recv from, empty to ignore
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *StmtEdgeHalf) Apply(fn func(interfaces.Node) error) error {
if err := obj.Name.Apply(fn); err != nil {
return err
}
return fn(obj)
}
// Init initializes this branch of the AST, and returns an error if it fails to // Init initializes this branch of the AST, and returns an error if it fails to
// validate. // validate.
func (obj *StmtEdgeHalf) Init(data *interfaces.Data) error { func (obj *StmtEdgeHalf) Init(data *interfaces.Data) error {
@@ -1046,6 +1136,28 @@ type StmtIf struct {
ElseBranch interfaces.Stmt // optional ElseBranch interfaces.Stmt // optional
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *StmtIf) Apply(fn func(interfaces.Node) error) error {
if err := obj.Condition.Apply(fn); err != nil {
return err
}
if obj.ThenBranch != nil {
if err := obj.ThenBranch.Apply(fn); err != nil {
return err
}
}
if obj.ElseBranch != nil {
if err := obj.ElseBranch.Apply(fn); err != nil {
return err
}
}
return fn(obj)
}
// Init initializes this branch of the AST, and returns an error if it fails to // Init initializes this branch of the AST, and returns an error if it fails to
// validate. // validate.
func (obj *StmtIf) Init(data *interfaces.Data) error { func (obj *StmtIf) Init(data *interfaces.Data) error {
@@ -1236,6 +1348,20 @@ type StmtProg struct {
Prog []interfaces.Stmt Prog []interfaces.Stmt
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *StmtProg) Apply(fn func(interfaces.Node) error) error {
for _, x := range obj.Prog {
if err := x.Apply(fn); err != nil {
return err
}
}
return fn(obj)
}
// Init initializes this branch of the AST, and returns an error if it fails to // Init initializes this branch of the AST, and returns an error if it fails to
// validate. // validate.
func (obj *StmtProg) Init(data *interfaces.Data) error { func (obj *StmtProg) Init(data *interfaces.Data) error {
@@ -1418,6 +1544,18 @@ type StmtClass struct {
Body interfaces.Stmt // probably a *StmtProg Body interfaces.Stmt // probably a *StmtProg
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *StmtClass) Apply(fn func(interfaces.Node) error) error {
if err := obj.Body.Apply(fn); err != nil {
return err
}
return fn(obj)
}
// Init initializes this branch of the AST, and returns an error if it fails to // Init initializes this branch of the AST, and returns an error if it fails to
// validate. // validate.
func (obj *StmtClass) Init(data *interfaces.Data) error { func (obj *StmtClass) Init(data *interfaces.Data) error {
@@ -1494,6 +1632,22 @@ type StmtInclude struct {
Args []interfaces.Expr Args []interfaces.Expr
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *StmtInclude) Apply(fn func(interfaces.Node) error) error {
if obj.Args != nil {
for _, x := range obj.Args {
if err := x.Apply(fn); err != nil {
return err
}
}
}
return fn(obj)
}
// Init initializes this branch of the AST, and returns an error if it fails to // Init initializes this branch of the AST, and returns an error if it fails to
// validate. // validate.
func (obj *StmtInclude) Init(data *interfaces.Data) error { func (obj *StmtInclude) Init(data *interfaces.Data) error {
@@ -1696,6 +1850,13 @@ type StmtComment struct {
Value string Value string
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *StmtComment) Apply(fn func(interfaces.Node) error) error { return fn(obj) }
// Init initializes this branch of the AST, and returns an error if it fails to // Init initializes this branch of the AST, and returns an error if it fails to
// validate. // validate.
func (obj *StmtComment) Init(*interfaces.Data) error { func (obj *StmtComment) Init(*interfaces.Data) error {
@@ -1747,6 +1908,13 @@ type ExprBool struct {
V bool V bool
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *ExprBool) Apply(fn func(interfaces.Node) error) error { return fn(obj) }
// String returns a short representation of this expression. // String returns a short representation of this expression.
func (obj *ExprBool) String() string { return fmt.Sprintf("bool(%t)", obj.V) } func (obj *ExprBool) String() string { return fmt.Sprintf("bool(%t)", obj.V) }
@@ -1838,6 +2006,13 @@ type ExprStr struct {
V string // value of this string V string // value of this string
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *ExprStr) Apply(fn func(interfaces.Node) error) error { return fn(obj) }
// String returns a short representation of this expression. // String returns a short representation of this expression.
func (obj *ExprStr) String() string { return fmt.Sprintf("str(%s)", obj.V) } func (obj *ExprStr) String() string { return fmt.Sprintf("str(%s)", obj.V) }
@@ -1954,6 +2129,13 @@ type ExprInt struct {
V int64 V int64
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *ExprInt) Apply(fn func(interfaces.Node) error) error { return fn(obj) }
// String returns a short representation of this expression. // String returns a short representation of this expression.
func (obj *ExprInt) String() string { return fmt.Sprintf("int(%d)", obj.V) } func (obj *ExprInt) String() string { return fmt.Sprintf("int(%d)", obj.V) }
@@ -2043,6 +2225,13 @@ type ExprFloat struct {
V float64 V float64
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *ExprFloat) Apply(fn func(interfaces.Node) error) error { return fn(obj) }
// String returns a short representation of this expression. // String returns a short representation of this expression.
func (obj *ExprFloat) String() string { func (obj *ExprFloat) String() string {
return fmt.Sprintf("float(%g)", obj.V) // TODO: %f instead? return fmt.Sprintf("float(%g)", obj.V) // TODO: %f instead?
@@ -2137,6 +2326,20 @@ type ExprList struct {
Elements []interfaces.Expr Elements []interfaces.Expr
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *ExprList) Apply(fn func(interfaces.Node) error) error {
for _, x := range obj.Elements {
if err := x.Apply(fn); err != nil {
return err
}
}
return fn(obj)
}
// String returns a short representation of this expression. // String returns a short representation of this expression.
func (obj *ExprList) String() string { func (obj *ExprList) String() string {
var s []string var s []string
@@ -2393,6 +2596,23 @@ type ExprMap struct {
KVs []*ExprMapKV KVs []*ExprMapKV
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *ExprMap) Apply(fn func(interfaces.Node) error) error {
for _, x := range obj.KVs {
if err := x.Key.Apply(fn); err != nil {
return err
}
if err := x.Val.Apply(fn); err != nil {
return err
}
}
return fn(obj)
}
// String returns a short representation of this expression. // String returns a short representation of this expression.
func (obj *ExprMap) String() string { func (obj *ExprMap) String() string {
var s []string var s []string
@@ -2747,6 +2967,20 @@ type ExprStruct struct {
Fields []*ExprStructField // the list (fields) are intentionally ordered! Fields []*ExprStructField // the list (fields) are intentionally ordered!
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *ExprStruct) Apply(fn func(interfaces.Node) error) error {
for _, x := range obj.Fields {
if err := x.Value.Apply(fn); err != nil {
return err
}
}
return fn(obj)
}
// String returns a short representation of this expression. // String returns a short representation of this expression.
func (obj *ExprStruct) String() string { func (obj *ExprStruct) String() string {
var s []string var s []string
@@ -3020,6 +3254,16 @@ type ExprFunc struct {
V func([]types.Value) (types.Value, error) V func([]types.Value) (types.Value, error)
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *ExprFunc) Apply(fn func(interfaces.Node) error) error {
// TODO: is there anything to iterate in here?
return fn(obj)
}
// String returns a short representation of this expression. // String returns a short representation of this expression.
// FIXME: fmt.Sprintf("func(%+v)", obj.V) fails `go vet` (bug?), so wait until // FIXME: fmt.Sprintf("func(%+v)", obj.V) fails `go vet` (bug?), so wait until
// we have a better printable function value and put that here instead. // we have a better printable function value and put that here instead.
@@ -3119,6 +3363,20 @@ type ExprCall struct {
Args []interfaces.Expr // list of args in parsed order Args []interfaces.Expr // list of args in parsed order
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *ExprCall) Apply(fn func(interfaces.Node) error) error {
for _, x := range obj.Args {
if err := x.Apply(fn); err != nil {
return err
}
}
return fn(obj)
}
// String returns a short representation of this expression. // String returns a short representation of this expression.
func (obj *ExprCall) String() string { func (obj *ExprCall) String() string {
var s []string var s []string
@@ -3572,6 +3830,13 @@ type ExprVar struct {
Name string // name of the variable Name string // name of the variable
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *ExprVar) Apply(fn func(interfaces.Node) error) error { return fn(obj) }
// String returns a short representation of this expression. // String returns a short representation of this expression.
func (obj *ExprVar) String() string { return fmt.Sprintf("var(%s)", obj.Name) } func (obj *ExprVar) String() string { return fmt.Sprintf("var(%s)", obj.Name) }
@@ -3798,6 +4063,24 @@ type ExprIf struct {
ElseBranch interfaces.Expr // could be an ExprBranch ElseBranch interfaces.Expr // could be an ExprBranch
} }
// Apply is a general purpose iterator method that operates on any AST node. It
// is not used as the primary AST traversal function because it is less readable
// and easy to reason about than manually implementing traversal for each node.
// Nevertheless, it is a useful facility for operations that might only apply to
// a select number of node types, since they won't need extra noop iterators...
func (obj *ExprIf) Apply(fn func(interfaces.Node) error) error {
if err := obj.Condition.Apply(fn); err != nil {
return err
}
if err := obj.ThenBranch.Apply(fn); err != nil {
return err
}
if err := obj.ElseBranch.Apply(fn); err != nil {
return err
}
return fn(obj)
}
// String returns a short representation of this expression. // String returns a short representation of this expression.
func (obj *ExprIf) String() string { func (obj *ExprIf) String() string {
return fmt.Sprintf("if(%s)", obj.Condition.String()) // TODO: improve this return fmt.Sprintf("if(%s)", obj.Condition.String()) // TODO: improve this