_ __ __
___ _ __ (_)/ _|/ _| _ _
/ __| '_ \| | |_| |_ _| |_ _| |_
\__ \ |_) | | _| _|_ _|_ _|
|___/ .__/|_|_| |_| |_| |_|
|_|
NOTE: Active development on spiff is currently paused and does not accept feature pull requests anymore. spiff++
is a fork of spiff that provides a compatible extension to spiff based on the latest version offering a rich set of new features not yet available in spiff. All fixes provided by the original spiff project will be incorporated into spiff++, also. If development is opened again the new features will be proposed for the original project
spiff is a command line tool and declarative YAML templating system, specially designed for generating BOSH deployment manifests.
Contents:
- Installation
- Usage
- dynaml Templating Language
- (( foo ))
- (( foo.bar.[1].baz ))
- (( "foo" ))
- (( [ 1, 2, 3 ] ))
- (( { "alice" = 25 } ))
- (( foo bar ))
- (( auto ))
- (( merge ))
- (( a || b ))
- (( 1 + 2 * foo ))
- (( "10.10.10.10" - 11 ))
- (( a > 1 ? foo :bar ))
- (( 5 -or 6 ))
- Functions
- (( format( "%s %d", alice, 25) ))
- (( join( ", ", list) ))
- (( split( ",", string) ))
- (( trim(string) ))
- (( uniq(list) ))
- (( contains(list, "foobar") ))
- (( index(list, "foobar") ))
- (( lastindex(list, "foobar") ))
- (( replace(string, "foo", "bar") ))
- (( match("(f.)(b.)", "xxxfoobar") ))
- (( length(list) ))
- (( defined(foobar) ))
- (( valid(foobar) ))
- (( require(foobar) ))
- (( exec( "command", arg1, arg2) ))
- (( eval( foo "." bar ) ))
- (( env( "HOME" ) ))
- (( read("file.yml") ))
- (( static_ips(0, 1, 3) ))
- (( list_to_map(list, "key") ))
- (( makemap(fieldlist) ))
- (( makemap(key, value) ))
- (( lambda |x|->x ":" port ))
- (( &temporary ))
- Mappings
- Aggregations
- Templates
- Special Literals
- Access to evaluation context
- Operation Priorities
- Structural Auto-Merge
- Bringing it all together
- Useful to Know
- Error Reporting
Official release executable binaries can be downloaded via Github releases for Darwin and Linux machines (and virtual machines).
Some of spiff's dependencies have changed since the last official release, and spiff will not be updated to keep up with these dependencies. Working dependencies are vendored in the Godeps
directory (more information on the godep
tool is available here). As such, trying to go get
spiff will likely fail; the only supported way to use spiff is to use an official binary release.
Merge a bunch of template files into one manifest, printing it out.
See 'dynaml templating language' for details of the template file, or examples/ subdir for more complicated examples.
Example:
spiff merge cf-release/templates/cf-deployment.yml my-cloud-stub.yml
The merge
command offers the option --partial
. If this option is given spiff handles incomplete expression evaluation. All errors are ignored and the unresolvable parts of the yaml document are returned as strings.
It is possible to read one file from standard input by using the file name -
. It may be used only once. This allows using spiff as part of a pipeline to just process a single stream or to process a stream based on several templates/stubs.
Show structural differences between two deployment manifests.
Unlike 'bosh diff', this command has semantic knowledge of a deployment manifest, and is not just text-based. It also doesn't modify either file.
It's tailed for checking differences between one deployment and the next.
Typical flow:
$ spiff merge template.yml [templates...] > deployment.yml
$ bosh download manifest [deployment] current.yml
$ spiff diff deployment.yml current.yml
$ bosh deployment deployment.yml
$ bosh deploy
Spiff uses a declarative, logic-free templating language called 'dynaml' (dynamic yaml).
Every dynaml node is guaranteed to resolve to a YAML node. It is not string interpolation. This keeps developers from having to think about how a value will render in the resulting template.
A dynaml node appears in the .yml file as an expression surrounded by two parentheses. They can be used as the value of a map or an entry in a list.
The following is a complete list of dynaml expressions:
Look for the nearest 'foo' key (i.e. lexical scoping) in the current template and bring it in.
e.g.:
fizz:
buzz:
foo: 1
bar: (( foo ))
bar: (( foo ))
foo: 3
bar: (( foo ))
This example will resolve to:
fizz:
buzz:
foo: 1
bar: 1
bar: 3
foo: 3
bar: 3
The following will not resolve because the key name is the same as the value to be merged in:
foo: 1
hi:
foo: (( foo ))
Look for the nearest 'foo' key, and from there follow through to .bar.baz.
A path is a sequence of steps separated by dots. A step is either a word for maps, or digits surrounded by brackets for list indexing.
If the path cannot be resolved, this evaluates to nil. A reference node at the top level cannot evaluate to nil; the template will be considered not fully resolved. If a reference is expected to sometimes not be provided, it should be used in combination with '||' (see below) to guarantee resolution.
Note that references are always within the template, and order does not matter. You can refer to another dynamic node and presume it's resolved, and the reference node will just eventually resolve once the dependent node resolves.
e.g.:
properties:
foo: (( something.from.the.stub ))
something: (( merge ))
This will resolve as long as 'something' is resolveable, and as long as it brings in something like this:
from:
the:
stub: foo
If the path starts with a dot (.
) the path is always evaluated from the root
of the document.
List entries consisting of a map with name
field can directly be addressed
by their name value.
e.g.:
The age of alice in
list:
- name: alice
age: 25
can be referenced by using the path list.alice.age
, instead of list[0].age
.
String literal. The only escape character handled currently is '"'.
List literal. The list elements might again be expressions. There is a special list literal [1 .. -1]
, that can be used to resolve an increasing or descreasing number range to a list.
e.g.:
list: (( [ 1 .. -1 ] ))
yields
list:
- 1
- 0
- -1
The map literal can be used to describe maps as part of a dynaml expression. Both,
the key and the value, might again be expressions, whereby the key expression must
evaluate to a string. This way it is possible to create maps with non-static keys.
The assignment operator =
has been chosen instead of the regular colon :
character used in yaml, because this would result in conflicts with the yaml
syntax.
A map literal might consist of any number of field assignments separated by a
comma ,
.
e.g.:
name: peter
age: 23
map: (( { "alice" = {}, name = age } ))
yields
name: peter
age: 23
map:
alice: {}
peter: 23
Another way to compose lists based on expressions are the functions
makemap
and list_to_map
.
Concatenation expression used to concatenate a sequence of dynaml expressions.
Concatenation (where bar is another dynaml expr). Any sequences of simple values (string, integer and boolean) can be concatenated, given by any dynaml expression.
e.g.:
domain: example.com
uri: (( "https://" domain ))
In this example uri
will resolve to the value "https://example.com"
.
Concatenation of lists as expression (where bar is another dynaml expr). Any sequences of lists can be concatenated, given by any dynaml expression.
e.g.:
other_ips: [ 10.0.0.2, 10.0.0.3 ]
static_ips: (( ["10.0.1.2","10.0.1.3"] other_ips ))
In this example static_ips
will resolve to the value [ 10.0.1.2, 10.0.1.3, 10.0.0.2, 10.0.0.3 ]
.
If the second expression evaluates to a value other than a list (integer, boolean, string or map), the value is appended to the first list.
e.g.:
foo: 3
bar: (( [1] 2 foo "alice" ))
yields the list [ 1, 2, 3, "alice" ]
for bar
.
Concatenation of maps as expression. Any sequences of maps can be concatenated, given by any dynaml expression. Thereby entries will be merged. Entries with the same key are overwritten from left to right.
e.g.:
foo:
alice: 24
bob: 25
bar:
bob: 26
paul: 27
concat: (( foo bar ))
yields
foo:
alice: 24
bob: 25
bar:
bob: 26
paul: 27
concat:
alice: 24
bob: 26
paul: 27
Context-sensitive automatic value calculation.
In a resource pool's 'size' attribute, this means calculate based on the total instances of all jobs that declare themselves to be in the current resource pool.
e.g.:
resource_pools:
- name: mypool
size: (( auto ))
jobs:
- name: myjob
resource_pool: mypool
instances: 2
- name: myotherjob
resource_pool: mypool
instances: 3
- name: yetanotherjob
resource_pool: otherpool
instances: 3
In this case the resource pool size will resolve to '5'.
Bring the current path in from the stub files that are being merged in.
e.g.:
foo:
bar:
baz: (( merge ))
Will try to bring in foo.bar.baz
from the first stub, or the second, etc.,
returning the value from the first stub that provides it.
If the corresponding value is not defined, it will return nil. This then has the
same semantics as reference expressions; a nil merge is an unresolved template.
See ||
.
Merging of maps or lists with the content of the same element found in some stub.
** Attention **
This form of merge
has a compatibility propblem. In versions before 1.0.8, this expression
was never parsed, only the existence of the key <<:
was relevant. Therefore there are often
usages of <<: (( merge ))
where <<: (( merge || nil ))
is meant. The first variant would
require content in at least one stub (as always for the merge operator). Now this expression
is evaluated correctly, but this would break existing manifest template sets, which use the
first variant, but mean the second. Therfore this case is explicitly handled to describe an
optional merge. If really a required merge is meant an additional explicit qualifier has to
be used ((( merge required ))
).
values.yml
foo:
a: 1
b: 2
template.yml
foo:
<<: (( merge ))
b: 3
c: 4
spiff merge template.yml values.yml
yields:
foo:
a: 1
b: 2
c: 4
values.yml
foo:
- 1
- 2
template.yml
foo:
- 3
- <<: (( merge ))
- 4
spiff merge template.yml values.yml
yields:
foo:
- 3
- 1
- 2
- 4
spiff
is able to merge lists of maps with a key field. Those lists are handled like maps with the value of the key field as key. By default the key name
is used. But with the selector on
an arbitrary key name can be specified for a list-merge expression.
e.g.:
list:
- <<: (( merge on key ))
- key: alice
age: 25
- key: bob
age: 24
merged with
list:
- key: alice
age: 20
- key: peter
age: 13
yields
list:
- key: peter
age: 13
- key: alice
age: 20
- key: bob
age: 24
If no insertion of new entries is desired (as requested by the insertion merge expression), but only overriding of existent entries, one existing key field can be prefixed with the tag key:
to indicate a non-standard key name, for example - key:key: alice
.
Replaces the complete content of an element by the content found in some stub instead of doing a deep merge for the existing content.
values.yml
foo:
a: 1
b: 2
template.yml
foo:
<<: (( merge replace ))
b: 3
c: 4
spiff merge template.yml values.yml
yields:
foo:
a: 1
b: 2
values.yml
foo:
- 1
- 2
template.yml
foo:
- <<: (( merge replace ))
- 3
- 4
spiff merge template.yml values.yml
yields:
foo:
- 1
- 2
Merging of maps and lists found in the same template or stub.
foo:
a: 1
b: 2
bar:
<<: (( foo )) # any dynaml expression
b: 3
yields:
foo:
a: 1
b: 2
bar:
a: 1
b: 3
This expression just adds new entries to the actual list. It does not merge existing entries with the content described by the merge expression.
bar:
- 1
- 2
foo:
- 3
- <<: (( bar ))
- 4
yields:
bar:
- 1
- 2
foo:
- 3
- 1
- 2
- 4
A common use-case for this is merging lists of static ips or ranges into a list of ips. Another possibility is to use a single concatenation expression.
Merging of maps or lists with the content of an arbitrary element found in some stub (Redirecting merge). There will be no further (deep) merge with the element of the same name found in some stub. (Deep merge of lists requires maps with field name
)
Redirecting merges can be used as direct field value, also. They can be combined with replacing merges like (( merge replace foo ))
.
values.yml
foo:
a: 10
b: 20
bar:
a: 1
b: 2
template.yml
foo:
<<: (( merge bar))
b: 3
c: 4
spiff merge template.yml values.yml
yields:
foo:
a: 1
b: 2
c: 4
Another way doing a merge with another element in some stub could also be done the traditional way:
values.yml
foo:
a: 10
b: 20
bar:
a: 1
b: 2
template.yml
bar:
<<: (( merge ))
b: 3
c: 4
foo: (( bar ))
But in this scenario the merge still performs the deep merge with the original element name. Therefore
spiff merge template.yml values.yml
yields:
bar:
a: 1
b: 2
c: 4
foo:
a: 10
b: 20
c: 4
values.yml
foo:
- 10
- 20
bar:
- 1
- 2
template.yml
foo:
- 3
- <<: (( merge bar ))
- 4
spiff merge template.yml values.yml
yields:
foo:
- 3
- 1
- 2
- 4
Uses a, or b if a cannot be resolved.
e.g.:
foo:
bar:
- name: some
- name: complicated
- name: structure
mything:
complicated_structure: (( merge || foo.bar ))
This will try to merge in mything.complicated_structure
, or, if it cannot be
merged in, use the default specified in foo.bar
.
Dynaml expressions can be used to execute arithmetic integer calculations. Supported operations are +, -, *, / and %.
e.g.:
values.yml
foo: 3
bar: (( 1 + 2 * foo ))
spiff merge values.yml
yields 7
for bar
. This can be combined with concatentions (calculation has higher priority than concatenation in dynaml expressions):
foo: 3
bar: (( foo " times 2 yields " 2 * foo ))
The result is the string 3 times 2 yields 6
.
Besides arithmetic on integers it is also possible to use addition and subtraction on ip addresses.
e.g.:
ip: 10.10.10.10
range: (( ip "-" ip + 247 + 256 * 256 ))
yields
ip: 10.10.10.10
range: 10.10.10.10-10.11.11.1
Additionally there are functions working on IPv4 CIDRs:
cidr: 192.168.0.1/24
range: (( min_ip(cidr) "-" max_ip(cidr) ))
next: (( max_ip(cidr) + 1 ))
num: (( min_ip(cidr) "+" num_ip(cidr) "=" min_ip(cidr) + num_ip(cidr) ))
yields
cidr: 192.168.0.1/24
range: 192.168.0.0-192.168.0.255
next: 192.168.1.0
num: 192.168.0.0+256=192.168.1.0
Dynaml supports the comparison operators <
, <=
, ==
, !=
, >=
and >
. The comparison operators work on
integer values. The checks for equality also work on lists and maps. The result is always a boolean value. To negate a condition the unary not opertor (!
) can be used.
Additionally there is the ternary conditional operator ?:
, that can be used to evaluate expressions depending on a condition. The first operand is used as condition. The expression is evaluated to the second operand, if the condition is true, and to the third one, otherwise.
e.g.:
foo: alice
bar: bob
age: 24
name: (( age > 24 ? foo :bar ))
yields the value bob
for the property name
.
Remark
The use of the symbol :
may collide with the yaml syntax, if the complete expression is not a quoted string value.
The operators -or
and -and
can be used to combine comparison operators to compose more complex conditions.
Remark:
The more traditional operator symbol ||
(and &&
) cannot be used here, because the operator ||
already exists in dynaml with a different semantic, that does not hold for logical operations. The expression false || true
evaluates to false
, because it yields the first operand, if it is defined, regardless of its value. To be as compatible as possible this cannot be changed and the bare symbols or
and and
cannot be be used, because this would invalidate the concatenation of references with such names.
If both sides of an -or
or -and
operator evaluate to integer values, a bit-wise operation is executed and the result is again an integer. Therefore the expression 5 -or 6
evaluates to 7
.
Dynaml supports a set of predefined functions. A function is generally called like
result: (( functionname(arg, arg, ...) ))
Additional functions may be defined as part of the yaml document using lambda expressions. The function name then is either a grouped expression or the path to the node hosting the lambda expression.
Format a string based on arguments given by dynaml expressions. There is a second flavor of this function: error
formats an error message and sets the evaluation to failed.
Join entries of lists or direct values to a single string value using a given separator string. The arguments to join can be dynaml expressions evaluating to lists, whose values again are strings or integers, or string or integer values.
e.g.:
alice: alice
list:
- foo
- bar
join: (( join(", ", "bob", list, alice, 10) ))
yields the string value bob, foo, bar, alice, 10
for join
.
Split a string for a dedicated separator. The result is a list.
e.g.:
list: (( split("," "alice, bob") ))
yields:
list:
- alice
- ' bob'
Trim a string or all elements of a list of strings. There is an optional second string argument. It can be used to specify a set of characters that will be cut. The default cut set consists of a space and a tab character.
e.g.:
list: (( trim(split("," "alice, bob")) ))
yields:
list:
- alice
- bob
Uniq provides a list without dupliates.
e.g.:
list:
- a
- b
- a
- c
- a
- b
- 0
- "0"
uniq: (( uniq(list) ))
yields for field uniq
:
uniq:
- a
- b
- c
- 0
Checks whether a list contains a dedicated value. Values might also be lists or maps.
e.g.:
list:
- foo
- bar
- foobar
contains: (( contains(list, "foobar") ))
yields:
list:
- foo
- bar
- foobar
contains: true
The function contains
also works on strings to look for sub strings.
e.g.:
contains: (( contains("foobar", "bar") ))
yields true
.
Checks whether a list contains a dedicated value and returns the index of the first match.
Values might also be lists or maps. If no entry could be found -1
is returned.
e.g.:
list:
- foo
- bar
- foobar
index: (( index(list, "foobar") ))
yields:
list:
- foo
- bar
- foobar
index: 2
The function index
also works on strings to look for sub strings.
e.g.:
index: (( index("foobar", "bar") ))
yields 3
.
The function lastindex
works like index
but the index of the last occurence is returned.
Replace all occurences of a sub string in a string by a replacement string. With an optional fourth integer argument the number of substitutions can be limited (-1 mean unlimited).
e.g.:
string: (( replace("foobar", "o", "u") ))
yields fuubar
.
Returns the match of a regular expression for a given string value. The match is a list of the matched values for the sub expressions contained in the regular expression. Index 0 refers to the match of the complete regular expression. If the string value does not match an empty list is returned.
e.g.:
matches: (( match("(f.*)*(b.*)", "xxxfoobar") ))
yields:
matches:
- foobar
- foo
- bar
Determine the length of a list, a map or a string value.
e.g.:
list:
- alice
- bob
length: (( length(list) ))
yields:
list:
- alice
- bob
length: 2
The function defined
checks whether an expression can successfully be evaluated. It yields the boolean value true
, if the expression can be evaluated, and false
otherwise.
e.g.:
zero: 0
div_ok: (( defined(1 / zero ) ))
zero_def: (( defined( zero ) ))
null_def: (( defined( null ) ))
evaluates to
zero: 0
div_ok: false
zero_def: true
null_def: false
This function can be used in combination of the conditional operator to evaluate expressions depending on the resolvability of another expression.
The function valid
checks whether an expression can successfully be evaluated and evaluates to a defined value not equals to nil
. It yields the boolean value true
, if the expression can be evaluated, and false
otherwise.
e.g.:
zero: 0
empty:
map: {}
list: []
div_ok: (( valid(1 / zero ) ))
zero_def: (( valid( zero ) ))
null_def: (( valid( ~ ) ))
empty_def: (( valid( empty ) ))
map_def: (( valid( map ) ))
list_def: (( valid( list ) ))
evaluates to
zero: 0
empty: null
map: {}
list: []
div_ok: false
zero_def: true
null_def: false
empty_def: false
map_def: true
list_def: true
The function require
yields an error if the given argument is undefined or nil
, otherwise it yields the given value.
e.g.:
foo: ~
bob: (( foo || "default" ))
alice: (( require(foo) || "default" ))
evaluates to
foo: ~
bob: ~
alice: default
Execute a command. Arguments can be any dynaml expressions including reference expressions evaluated to lists or maps. Lists or maps are passed as single arguments containing a yaml document with the given fragment.
The result is determined by parsing the standard output of the command. It might be a yaml document or a single multi-line string or integer value. A yaml document must start with the document prefix ---
. If the command fails the expression is handled as undefined.
e.g.
arg:
- a
- b
list: (( exec( "echo", arg ) ))
string: (( exec( "echo", arg.[0] ) ))
yields
arg:
- a
- b
list:
- a
- b
string: a
Alternatively exec
can be called with a single list argument completely describing the command line.
The same command will be executed once, only, even if it is used in multiple expressions.
Evaluate the evaluation result of a string expression again as dynaml expression. This can, for example, be used to realize indirections.
e.g.: the expression in
alice:
bob: married
foo: alice
bar: bob
status: (( eval( foo "." bar ) ))
calculates the path to a field, which is then evaluated again to yield the value of this composed field:
alice:
bob: married
foo: alice
bar: bob
status: married
Read the value of an environment variable whose name is given as dynaml expression. If the environment variable is not set the evaluation fails.
In a second flavor the function env
accepts multiple arguments and/or list arguments, which are joined to a single list. Every entry in this list is used as name of an environment variable and the result of the function is a map of the given given variables as yaml element. Hereby non-existent environment variables are omitted.
Read a file and return its content. There is support for two content types: yaml
files and text
files.
If the file suffix is .yml
, by default the yaml type is used. An optional second parameter can be used
to explicitly specifiy the desired return type: yaml
or text
.
A yaml document will be parsed and the tree is returned. The elements of the tree can be accessed by regular dynaml expressions.
Additionally the yaml file may again contain dynaml expressions. All included dynaml expressions will be evaluated in the context of the reading expression. This means that the same file included at different places in a yaml document may result in different sub trees, depending on the used dynaml expressions.
A text document will be returned as single string.
Generate a list of static IPs for a job.
e.g.:
jobs:
- name: myjob
instances: 2
networks:
- name: mynetwork
static_ips: (( static_ips(0, 3, 4) ))
This will create 3 IPs from mynetwork
s subnet, and return two entries, as
there are only two instances. The two entries will be the 0th and 3rd offsets
from the static IP ranges defined by the network.
For example, given the file bye.yml:
networks: (( merge ))
jobs:
- name: myjob
instances: 3
networks:
- name: cf1
static_ips: (( static_ips(0,3,60) ))
and file hi.yml:
networks:
- name: cf1
subnets:
- cloud_properties:
security_groups:
- cf-0-vpc-c461c7a1
subnet: subnet-e845bab1
dns:
- 10.60.3.2
gateway: 10.60.3.1
name: default_unused
range: 10.60.3.0/24
reserved:
- 10.60.3.2 - 10.60.3.9
static:
- 10.60.3.10 - 10.60.3.70
type: manual
spiff merge bye.yml hi.yml
returns
jobs:
- instances: 3
name: myjob
networks:
- name: cf1
static_ips:
- 10.60.3.10
- 10.60.3.13
- 10.60.3.70
networks:
- name: cf1
subnets:
- cloud_properties:
security_groups:
- cf-0-vpc-c461c7a1
subnet: subnet-e845bab1
dns:
- 10.60.3.2
gateway: 10.60.3.1
name: default_unused
range: 10.60.3.0/24
reserved:
- 10.60.3.2 - 10.60.3.9
static:
- 10.60.3.10 - 10.60.3.70
type: manual
.
If bye.yml was instead
networks: (( merge ))
jobs:
- name: myjob
instances: 2
networks:
- name: cf1
static_ips: (( static_ips(0,3,60) ))
spiff merge bye.yml hi.yml
instead returns
jobs:
- instances: 2
name: myjob
networks:
- name: cf1
static_ips:
- 10.60.3.10
- 10.60.3.13
networks:
- name: cf1
subnets:
- cloud_properties:
security_groups:
- cf-0-vpc-c461c7a1
subnet: subnet-e845bab1
dns:
- 10.60.3.2
gateway: 10.60.3.1
name: default_unused
range: 10.60.3.0/24
reserved:
- 10.60.3.2 - 10.60.3.9
static:
- 10.60.3.10 - 10.60.3.70
type: manual
static_ips
also accepts list arguments, as long as all transitivly contained elements are either again lists or integer values. This allows to abbreviate the list of IPs as follows:
static_ips: (( static_ips([1..5]) ))
A list of map entries with explicit name/key fields will be mapped to a map with the dedicated keys. By default the key field name
is used, which can changed by the optional second argument. An explicitly denoted key field in the list will also be taken into account.
e.g.:
list:
- key:foo: alice
age: 24
- foo: bob
age: 30
map: (( list_to_map(list) ))
will be mapped to
list:
- foo: alice
age: 24
- foo: bob
age: 30
map:
alice:
age: 24
bob:
age: 30
In combination with templates and lambda expressions this can be used to generate maps with arbitrarily named key values, although dynaml expressions are not allowed for key values.
In this flavor makemap
creates a map with entries described by the given field list.
The list is expected to contain maps with the entries key
and value
, describing
dedicated map entries.
e.g.:
list:
- key: alice
value: 24
- key: bob
value: 25
- key: 5
value: 25
map: (( makemap(list) ))
yields
list:
- key: alice
value: 24
- key: bob
value: 25
- key: 5
value: 25
map:
"5": 25
alice: 24
bob: 25
If the key value is a boolean or an integer it will be mapped to a string.
In this flavor makemap
creates a map with entries described by the given argument
pairs. The arguments may be a sequence of key/values pairs (given by separate arguments).
e.g.:
map: (( makemap("peter", 23, "paul", 22) ))
yields
map:
paul: 22
peter: 23
In contrast to the previous makemap
flavor, this one could also be handled by
map literals.
Lambda expressions can be used to define additional anonymous functions. They can be assigned to yaml nodes as values and referenced with path expressions to call the function with approriate arguments in other dynaml expressions. For the final document they are mapped to string values.
There are two forms of lambda expressions. While
lvalue: (( lambda |x|->x ":" port ))
yields a function taking one argument by directly taking the elements from the dynaml expression,
string: "|x|->x \":\" port"
lvalue: (( lambda string ))
evaluates the result of an expression to a function. The expression must evaluate to a function or string. If the expression is evaluated to a string it parses the function from the string.
Since the evaluation result of a lambda expression is a regular value, it can also be passed as argument to function calls and merged as value along stub processing.
A complete example could look like this:
lvalue: (( lambda |x,y|->x + y ))
mod: (( lambda|x,y,m|->(lambda m)(x, y) + 3 ))
value: (( .mod(1,2, lvalue) ))
yields
lvalue: lambda |x,y|->x + y
mod: lambda|x,y,m|->(lambda m)(x, y) + 3
value: 6
A lambda expression might refer to absolute or relative nodes of the actual template. Relative references are evaluated in the context of the function call. Therefore
lvalue: (( lambda |x,y|->x + y + offset ))
offset: 0
values:
offset: 3
value: (( .lvalue(1,2) ))
yields 6
for values.value
.
Besides the specified parameters, there is an implicit name (_
), that can be used to refer to the function itself. It can be used to define self recursive function. Together with the logical and conditional operators a fibunacci function can be defined:
fibonacci: (( lambda |x|-> x <= 0 ? 0 :x == 1 ? 1 :_(x - 2) + _( x - 1 ) ))
value: (( .fibonacci(5) ))
yields the value 8
for the value
property.
Inner lambda expressions remember the local binding of outer lambda expressions. This can be used to return functions based an arguments of the outer function.
e.g.:
mult: (( lambda |x|-> lambda |y|-> x * y ))
mult2: (( .mult(2) ))
value: (( .mult2(3) ))
yields 6
for property value
.
If a lambda function is called with less arguments than expected, the result is a new function taking the missing arguments (currying).
e.g.:
mult: (( lambda |x,y|-> x * y ))
mult2: (( .mult(2) ))
value: (( .mult2(3) ))
If a complete expression is a lambda expression the keyword lambda
can be omitted.
Maps, lists or simple value nodes can be marked as temporary. Temporary nodes are removed from the final output document, but are available during merging and dynaml evaluation.
e.g.:
temp:
<<: (( &temporary ))
foo: bar
value: (( temp.foo ))
yields:
value: bar
Adding - <<: (( &temporary ))
to a list can be used to mark a list as temporary.
The temporary marker can be combined with regular dynaml expressions to tag plain fields. Hereby the parenthesised expression is just appended to the marker
e.g.:
data:
alice: (( &temporary ( "bar" ) ))
foo: (( alice ))
yields:
data:
foo: bar
The temporary marker can be combined with the template marker to omit templates from the final output.
Mappings are used to produce a new list from the entries of a list or map containing the entries processed by a dynaml expression. The expression is given by a lambda function. There are two basic forms of the mapping function: It can be inlined as in (( map[list|x|->x ":" port] ))
, or it can be determined by a regular dynaml expression evaluating to a lambda function as in (( map[list|mapping.expression))
(here the mapping is taken from the property mapping.expression
, which should hold an approriate lambda function).
Execute a mapping expression on members of a list to produce a new (mapped) list. The first expression (list
) must resolve to a list. The last expression (x ":" port
) defines the mapping expression used to map all members of the given list. Inside this expression an arbitrarily declared simple reference name (here x
) can be used to access the actually processed list element.
e.g.
port: 4711
hosts:
- alice
- bob
mapped: (( map[hosts|x|->x ":" port] ))
yields
port: 4711
hosts:
- alice
- bob
mapped:
- alice:4711
- bob:4711
This expression can be combined with others, for example:
port: 4711
list:
- alice
- bob
joined: (( join( ", ", map[list|x|->x ":" port] ) ))
which magically provides a comma separated list of ported hosts:
port: 4711
list:
- alice
- bob
joined: alice:4711, bob:4711
In this variant, the first argument idx
is provided with the index and the
second elem
with the value for the index.
e.g.
list:
- name: alice
age: 25
- name: bob
age: 24
ages: (( map[list|i,p|->i + 1 ". " p.name " is " p.age ] ))
yields
list:
- name: alice
age: 25
- name: bob
age: 24
ages:
- 1. alice is 25
- 2. bob is 24
Mapping of a map to a list using a mapping expression. The expression may have access to the key and/or the value. If two references are declared, both values are passed to the expression, the first one is provided with the key and the second one with the value for the key. If one reference is declared, only the value is provided.
e.g.
ages:
alice: 25
bob: 24
keys: (( map[ages|k,v|->k] ))
yields
ages:
alice: 25
bob: 24
keys:
- alice
- bob
Aggregations are used to produce a single result from the entries of a list or map aggregating the entries by a dynaml expression. The expression is given by a lambda function. There are two basic forms of the aggregation function: It can be inlined as in (( sum[list|0|s,x|->s + x] ))
, or it can be determined by a regular dynaml expression evaluating to a lambda function as in (( sum[list|0|aggregation.expression))
(here the aggregation function is taken from the property aggregation.expression
, which should hold an approriate lambda function).
Execute an aggregation expression on members of a list to produce an aggregation result. The first expression (list
) must resolve to a list. The second expression is used as initial value for the aggregation. The last expression (s + x
) defines the aggregation expression used to aggregate all members of the given list. Inside this expression an arbitrarily declared simple reference name (here s
) can be used to access the intermediate aggregation result and a second reference name (here x
) can be used to access the actually processed list element.
e.g.
list:
- 1
- 2
sum: (( sum[list|0|s,x|->s + x] ))
yields
list:
- 1
- 2
sum: 3
In this variant, the second argument idx
is provided with the index and the
third elem
with the value for the index.
e.g.
list:
- 1
- 2
- 3
prod: (( sum[list|0|s,i,x|->s + i * x ] ))
yields
list:
- 1
- 2
- 3
prod: 8
Aggregation of the elements of a map to a single result using an aggregation expression. The expression may have access to the key and/or the value. The first argument is always the intermediate aggregation result. If three references are declared, both values are passed to the expression, the second one is provided with the key and the third one with the value for the key. If two references are declared, only the second one is provided with the value of the map entry.
e.g.
ages:
alice: 25
bob: 24
sum: (( map[ages|0|s,k,v|->s + v] ))
yields
ages:
alice: 25
bob: 24
sum: 49
A map can be tagged by a dynaml expression to be used as template. Dynaml expressions in a template are not evaluated at its definition location in the document, but can be inserted at other locations using dynaml. At every usage location it is evaluated separately.
The dynaml expression &template
can be used to tag a map node as template:
i.g.:
foo:
bar:
<<: (( &template ))
alice: alice
bob: (( verb " " alice ))
The template will be the value of the node foo.bar
. As such it can be overwritten as a whole by settings in a stub during the merge process. Dynaml expressions in the template are not evaluated. A map can have only a single <<
field. Therefore it is possible to combine the template marker with an expression just by adding the expression in parenthesis.
Adding - <<: (( &template ))
to a list it is also possible to define list templates.
It is also possible to convert a single expression value into a simple template by adding the template
marker to the expression, for example foo: (( &template (expression) ))
The template marker can be combined with the temporary marker to omit templates from the final output.
The dynaml expression *<refernce expression>
can be used to evaluate a template somewhere in the yaml document.
Dynaml expressions in the template are evaluated in the context of this expression.
e.g.:
foo:
bar:
<<: (( &template ))
alice: alice
bob: (( verb " " alice ))
use:
subst: (( *foo.bar ))
verb: loves
verb: hates
evaluates to
foo:
bar:
<<: (( &template ))
alice: alice
bob: (( verb " " alice ))
use:
subst:
alice: alice
bob: loves alice
verb: loves
verb: hates
Provides an empty map.
Provides an empty list. Basically this is not a dedicated literal, but just a regular list expression without a value.
Provides the null value.
This literal evaluates to an undefined expression. The element (list entry or map field) carrying this value, although defined, will be removed from the document and handled as undefined for further merges and the evaluation of referential expressions.
e.g.:
foo: (( ~~ ))
bob: (( foo || ~~ ))
alice: (( bob || "default"))
evaluates to
alice: default
Inside every dynaml expression a virtual field __ctx
is available. It allows access to information about the actual evaluation context. It can be accessed by a relative reference expression.
The following fields are supported:
Field Name | Type | Meaning |
---|---|---|
FILE |
string | name of actually processed template file |
DIR |
string | name of directory of actually processed template file |
RESOLVED_FILE |
string | name of actually processed template file with resolved symbolic links |
RESOLVED_DIR |
string | name of directory of actually processed template file with resolved symbolic links |
PATHNAME |
string | path name of actually processed field |
PATH |
list[string] | path name as component list |
e.g.:
template.yml
foo:
bar:
path: (( __ctx.PATH ))
str: (( __ctx.PATHNAME ))
file: (( __ctx.FILE ))
dir: (( __ctx.DIR ))
evaluates to
e.g.:
foo:
bar:
dir: .
file: template.yml
path:
- foo
- bar
- path
str: foo.bar.str
Dynaml expressions are evaluated obeying certain priority levels. This means operations with a higher priority are evaluated first. For example the expression 1 + 2 * 3
is evaluated in the order 1 + ( 2 * 3 )
. Operations with the same priority are evaluated from left to right (in contrast to version 1.0.7). This means the expression 6 - 3 - 2
is evaluated as ( 6 - 3 ) - 2
.
The following levels are supported (from low priority to high priority)
||
- White-space separated sequence as concatenation operation (
foo bar
) -or
,-and
==
,!=
,<=
,<
,>
,>=
+
,-
*
,/
,%
- Grouping
( )
,!
, constants, references (foo.bar
),merge
,auto
,lambda
,map[]
, and functions
The complete grammar can be found in dynaml.peg.
By default spiff
performs a deep structural merge of its first argument, the template file, with the given stub files. The merge is processed from right to left, providing an intermediate merged stub for every step. This means, that for every step all expressions must be locally resolvable.
Structural merge means, that besides explicit dynaml merge
expressions, values will be overridden by values of equivalent nodes found in right-most stub files. In general, flat value lists are not merged. Only lists of maps can be merged by entries in a stub with a matching index.
There is a special support for the auto-merge of lists containing maps, if the
maps contain a name
field. Hereby the list is handled like a map with
entries according to the value of the list entries' name
field. If another
key field than name
should be used, the key field of one list entry can be
tagged with the prefix key:
to indicate the indended key name. Such tags
will be removed for the processed output.
In general the resolution of matching nodes in stubs is done using the same rules that apply for the reference expressions (( foo.bar.[1].baz )).
For example, given the file template.yml:
foo:
- name: alice
bar: template
- name: bob
bar: template
plip:
- id: 1
plop: template
- id: 2
plop: template
bar:
- foo: template
list:
- a
- b
and file stub.yml:
foo:
- name: bob
bar: stub
plip:
- key:id: 1
plop: stub
bar:
- foo: stub
list:
- c
- d
spiff merge template.yml stub.yml
returns
foo:
- bar: template
name: alice
- bar: stub
name: bob
plip:
- id: 1
plop: stub
- id: 2
plop: template
bar:
- foo: stub
list:
- a
- b
Be careful that any name:
key in the template for the first element of the
plip
list will defeat the key:id: 1
selector from the stub. When a name
field exist in a list element, then this element can only be targeted by this
name. When the selector is defeated, the resulting value is the one provided
by the template.
Merging the following files in the given order
deployment.yml
networks: (( merge ))
cf.yml
utils: (( merge ))
network: (( merge ))
meta: (( merge ))
networks:
- name: cf1
<<: (( utils.defNet(network.base.z1,meta.deployment_no,30) ))
- name: cf2
<<: (( utils.defNet(network.base.z2,meta.deployment_no,30) ))
infrastructure.yml
network:
size: 16
block_size: 256
base:
z1: 10.0.0.0
z2: 10.1.0.0
rules.yml
utils:
defNet: (( |b,n,s|->(*.utils.network).net ))
network:
<<: (( &template ))
start: (( b + n * .network.block_size ))
first: (( start + ( n == 0 ? 2 :0 ) ))
lower: (( n == 0 ? [] :b " - " start - 1 ))
upper: (( start + .network.block_size " - " max_ip(net.subnets.[0].range) ))
net:
subnets:
- range: (( b "/" .network.size ))
reserved: (( [] lower upper ))
static:
- (( first " - " first + s - 1 ))
instance.yml
meta:
deployment_no: 1
will yield a network setting for a dedicated deployment
networks:
- name: cf1
subnets:
- range: 10.0.0.0/16
reserved:
- 10.0.0.0 - 10.0.0.255
- 10.0.2.0 - 10.0.255.255
static:
- 10.0.1.0 - 10.0.1.29
- name: cf2
subnets:
- range: 10.1.0.0/16
reserved:
- 10.1.0.0 - 10.1.0.255
- 10.1.2.0 - 10.1.255.255
static:
- 10.1.1.0 - 10.1.1.29
Using the same config for another deployment of the same type just requires the replacement of the instance.yml
.
Using a different instance.yml
meta:
deployment_no: 0
will yield a network setting for a second deployment providing the appropriate settings for a unique other IP block.
networks:
- name: cf1
subnets:
- range: 10.0.0.0/16
reserved:
- 10.0.1.0 - 10.0.255.255
static:
- 10.0.0.2 - 10.0.0.31
- name: cf2
subnets:
- range: 10.1.0.0/16
reserved:
- 10.1.1.0 - 10.1.255.255
static:
- 10.1.0.2 - 10.1.0.31
If you move to another infrastructure you might want to change the basic IP layout. You can do it just by adapting the infrastructure.yml
network:
size: 17
block_size: 128
base:
z1: 10.0.0.0
z2: 10.0.128.0
Without any change to your other settings you'll get
networks:
- name: cf1
subnets:
- range: 10.0.0.0/17
reserved:
- 10.0.0.128 - 10.0.127.255
static:
- 10.0.0.2 - 10.0.0.31
- name: cf2
subnets:
- range: 10.0.128.0/17
reserved:
- 10.0.128.128 - 10.0.255.255
static:
- 10.0.128.2 - 10.0.128.31
There are several scenarios yielding results that do not seem to be obvious. Here are some typical pitfalls.
-
The auto merge never adds nodes to existing structures
For example, merging
template.yml
foo: alice: 25
with
stub.yml
foo: alice: 24 bob: 26
yields
foo: alice: 24
Use <<: (( merge )) to change this behaviour, or explicitly add desired nodes to be merged:
template.yml
foo: alice: 25 bob: (( merge ))
-
Simple node values are replaced by values or complete structures coming from stubs, structures are deep merged.
For example, merging
template.yml
foo: (( ["alice"] ))
with
stub.yml
foo: - peter - paul
yields
foo: - peter - paul
But the template
foo: [ (( "alice" )) ]
is merged without any change.
-
Expressions are subject to be overridden as a whole
A consequence of the behaviour described above is that nodes described by an expession are basically overridden by a complete merged structure, instead of doing a deep merge with the structues resulting from the expression evaluation.
For example, merging
template.yml
men: - bob: 24 women: - alice: 25 people: (( women men ))
with
stub.yml
people: - alice: 13
yields
men: - bob: 24 women: - alice: 25 people: - alice: 13
To request an auto-merge of the structure resulting from the expression evaluation, the expression has to be preceeded with the modifier
prefer
((( prefer women men ))
). This would yield the desired result:men: - bob: 24 women: - alice: 25 people: - alice: 13 - bob: 24
-
Nested merge expressions use implied redirections
merge
expressions implicity use a redirection implied by an outer redirecting merge. In the following examplemeta: <<: (( merge deployments.cf )) properties: <<: (( merge )) alice: 42
the merge expression in
meta.properties
is implicity redirected to the pathdeployments.cf.properties
implied by the outer redirectingmerge
. Therefore merging withdeployments: cf: properties: alice: 24 bob: 42
yields
meta: properties: alice: 24 bob: 42
-
Functions and mappings can freely be nested
e.g.:
pot: (( lambda |x,y|-> y == 0 ? 1 :(|m|->m * m)(_(x, y / 2)) * ( 1 + ( y % 2 ) * ( x - 1 ) ) )) seq: (( lambda |b,l|->map[l|x|-> .pot(b,x)] )) values: (( .seq(2,[ 0..4 ]) ))
yields the list
[ 1,2,4,8,16 ]
for the propertyvalues
. -
Functions can be used to parameterize templates
The combination of functions with templates can be use to provide functions yielding complex structures. The parameters of a function are part of the scope used to resolve reference expressions in a template used in the function body.
e.g.:
relation: template: <<: (( &template )) bob: (( x " " y )) relate: (( |x,y|->*relation.template )) banda: (( relation.relate("loves","alice") ))
evaluates to
relation: relate: lambda|x,y|->*(relation.template) template: <<: (( &template )) bob: (( x " " y )) banda: bob: loves alice
-
Aggregations may yield complex values by using templates
The expression of an aggregation may return complex values by returning inline lists or instantiated templates. The binding of the function will be available (as usual) for the evaluation of the template. In the example below the aggregation provides a map with both the sum and the product of the list entries containing the integers from 1 to 4.
e.g.:
sum: (( sum[[1..4]|init|s,e|->*temp] )) temp: <<: (( &template )) sum: (( s.sum + e )) prd: (( s.prd * e )) init: sum: 0 prd: 1
yields for
sum
the valuesum: prd: 24 sum: 10
-
Taking advantage of the undefined value
At first glance it might look strange to introduce a value for undefined. But it can be really useful as will become apparent with the following examples.
-
Whenever a stub syntactically defines a field it overwrites the default in the template during merging. Therefore it would not be possible to define some expression for that field that eventually keeps the default value. Here the undefined value can help:
e.g.: merging
template.yml
alice: 24 bob: 25
with
stub.yml
alice: (( config.alice * 2 || ~ )) bob: (( config.bob * 3 || ~~ ))
yields
alice: ~ bob: 25
-
There is a problem accessing upstream values. This is only possible if the local stub contains the definition of the field to use. But then there will always be a value for this field, even if the upstream does not overwrite it.
Here the undefined value can help by providing optional access to upstream values. Optional means, that the field is only defined, if there is an upstream value. Otherwise it is undefined for the expressions in the local stub and potential downstream templates. This is possible because the field is formally defined, and will therefore be merged, only after evaluating the expression if it is not merged it will be removed again.
e.g.: merging
template.yml
alice: 24 bob: 25 peter: 26
with
mapping.yml
config: alice: (( ~~ )) bob: (( ~~ )) alice: (( config.alice || ~~ )) bob: (( config.bob || ~~ )) peter: (( config.peter || ~~ ))
and
config.yml
config: alice: 4711 peter: 0815
yields
alice: 4711 # transferred from config's config value bob: 25 # kept default value, because not set in config.yml peter: 26 # kept, because mapping source not available in mapping.yml
This can be used to add an intermediate stub, that offers a dedicated configuration interface and contains logic to map this interface to a manifest structure already defining default values.
-
-
Templates versus map literals
As described earlier templates can be used inside functions and mappings to easily describe complex data structures based on expressions refering to parameters. Before the introduction of map literals this was the only way to achieve such behaviour. The advantage is the possibility to describe the complex structure as regular part of a yaml document, which allows using the regular yaml formatting facilitating readability.
e.g.:
scaling: runner_z1: 10 router_z1: 4 jobs: (( sum[scaling|[]|s,k,v|->s [ *templates.job ] ] )) templates: job: <<: (( &template )) name: (( k )) instances: (( v ))
evaluates to
scaling: runner_z1: 10 router_z1: 4 jobs: - instances: 4 name: router_z1 - instances: 10 name: runner_z1 ...
With map literals this construct can significantly be simplified
scaling: runner_z1: 10 router_z1: 4 jobs: (( sum[scaling|[]|s,k,v|->s [ {"name"=k, "value"=v} ] ] ))
Nevertheless the first, template based version might still be useful, if the data structures are more complex, deeper or with complex value expressions. For such a scenario the description of the data structure as template should be preferred. It provides a much better readability, because every field, list entry and value expression can be put into dedicated lines.
But there is still a qualitative difference. While map literals are part of a single expression always evaluated as a whole before map fields are available for referencing, templates are evaluated as regular yaml documents that might contain multiple fields with separate expressions referencing each other.
e.g.:
range: (( (|cidr,first,size|->(*templates.addr).range)("10.0.0.0/16",10,255) )) templates: addr: <<: (( &template )) base: (( min_ip(cidr) )) start: (( base + first )) end: (( start + size - 1 )) range: (( start " - " end ))
evaluates
range
torange: 10.0.0.10 - 10.0.1.8 ...
The evaluation of dynaml expressions may fail because of several reasons:
- it is not parseable
- involved references cannot be satisfied
- arguments to operations are of the wrong type
- operations fail
- there are cyclic dependencies among expressions
If a dynaml expression cannot be resolved to a value, it is reported by the
spiff merge
operation using the following layout:
(( <failed expression> )) in <file> <path to node> (<referred path>) <tag><issue>
e.g.:
(( min_ip("10") )) in source.yml node.a.[0] () *CIDR argument required
Cyclic dependencies are detected by iterative evaluation until the document is unchanged after a step. Nodes involved in a cycle are therefore typically reported just as unresolved node without a specific issue.
The order of the reported unresolved nodes depends on a classification of the problem, denoted by a dedicated tag. The following tags are used (in reporting order):
Tag | Meaning |
---|---|
* |
error in local dynaml expression |
@ |
dependent or involved in cyclic dependencies |
- |
subsequent error because of refering to a yaml node with an error |
Problems occuring during inline template processing are reported as nested problems. The classification is propagated to the outer node.