2015-01-10 20:44:26 +01:00
|
|
|
package schema
|
|
|
|
|
|
|
|
import (
|
|
|
|
"fmt"
|
|
|
|
"reflect"
|
|
|
|
"strconv"
|
|
|
|
"strings"
|
|
|
|
"sync"
|
|
|
|
|
|
|
|
"github.com/mitchellh/mapstructure"
|
|
|
|
)
|
|
|
|
|
|
|
|
// MapFieldWriter writes data into a single map[string]string structure.
|
|
|
|
type MapFieldWriter struct {
|
|
|
|
Schema map[string]*Schema
|
|
|
|
|
|
|
|
lock sync.Mutex
|
|
|
|
result map[string]string
|
|
|
|
}
|
|
|
|
|
|
|
|
// Map returns the underlying map that is being written to.
|
|
|
|
func (w *MapFieldWriter) Map() map[string]string {
|
|
|
|
w.lock.Lock()
|
|
|
|
defer w.lock.Unlock()
|
|
|
|
if w.result == nil {
|
|
|
|
w.result = make(map[string]string)
|
|
|
|
}
|
|
|
|
|
|
|
|
return w.result
|
|
|
|
}
|
|
|
|
|
core: Allow dynamic attributes in helper/schema
The helper/schema framework for building providers previously validated
in all cases that each field being set in state was in the schema.
However, in order to support remote state in a usable fashion, the need
has arisen for the top level attributes of the resource to be created
dynamically. In order to still be able to use helper/schema, this commit
adds the capability to assign additional fields.
Though I do not forsee this being used by providers other than remote
state (and that eventually may move into Terraform Core rather than
being a provider), the usage and semantics are:
To opt into dynamic attributes, add a schema attribute named
"__has_dynamic_attributes", and make it an optional string with no
default value, in order that it does not appear in diffs:
"__has_dynamic_attributes": {
Type: schema.TypeString
Optional: true
}
In the read callback, use the d.UnsafeSetFieldRaw(key, value) function
to set the dynamic attributes.
Note that other fields in the schema _are_ copied into state, and that
the names of the schema fields cannot currently be used as dynamic
attribute names, as we check to ensure a value is not already set for a
given key.
2016-06-11 12:23:32 +02:00
|
|
|
func (w *MapFieldWriter) unsafeWriteField(addr string, value string) {
|
|
|
|
w.lock.Lock()
|
|
|
|
defer w.lock.Unlock()
|
|
|
|
if w.result == nil {
|
|
|
|
w.result = make(map[string]string)
|
|
|
|
}
|
|
|
|
|
|
|
|
w.result[addr] = value
|
|
|
|
}
|
|
|
|
|
2015-01-10 20:44:26 +01:00
|
|
|
func (w *MapFieldWriter) WriteField(addr []string, value interface{}) error {
|
|
|
|
w.lock.Lock()
|
|
|
|
defer w.lock.Unlock()
|
|
|
|
if w.result == nil {
|
|
|
|
w.result = make(map[string]string)
|
|
|
|
}
|
|
|
|
|
|
|
|
schemaList := addrToSchema(addr, w.Schema)
|
|
|
|
if len(schemaList) == 0 {
|
|
|
|
return fmt.Errorf("Invalid address to set: %#v", addr)
|
|
|
|
}
|
|
|
|
|
|
|
|
// If we're setting anything other than a list root or set root,
|
|
|
|
// then disallow it.
|
|
|
|
for _, schema := range schemaList[:len(schemaList)-1] {
|
|
|
|
if schema.Type == TypeList {
|
|
|
|
return fmt.Errorf(
|
|
|
|
"%s: can only set full list",
|
|
|
|
strings.Join(addr, "."))
|
|
|
|
}
|
|
|
|
|
|
|
|
if schema.Type == TypeMap {
|
|
|
|
return fmt.Errorf(
|
|
|
|
"%s: can only set full map",
|
|
|
|
strings.Join(addr, "."))
|
|
|
|
}
|
|
|
|
|
|
|
|
if schema.Type == TypeSet {
|
|
|
|
return fmt.Errorf(
|
|
|
|
"%s: can only set full set",
|
|
|
|
strings.Join(addr, "."))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return w.set(addr, value)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (w *MapFieldWriter) set(addr []string, value interface{}) error {
|
|
|
|
schemaList := addrToSchema(addr, w.Schema)
|
|
|
|
if len(schemaList) == 0 {
|
|
|
|
return fmt.Errorf("Invalid address to set: %#v", addr)
|
|
|
|
}
|
|
|
|
|
|
|
|
schema := schemaList[len(schemaList)-1]
|
|
|
|
switch schema.Type {
|
2015-05-27 03:52:36 +02:00
|
|
|
case TypeBool, TypeInt, TypeFloat, TypeString:
|
2015-01-10 20:44:26 +01:00
|
|
|
return w.setPrimitive(addr, value, schema)
|
|
|
|
case TypeList:
|
|
|
|
return w.setList(addr, value, schema)
|
|
|
|
case TypeMap:
|
|
|
|
return w.setMap(addr, value, schema)
|
|
|
|
case TypeSet:
|
|
|
|
return w.setSet(addr, value, schema)
|
|
|
|
case typeObject:
|
|
|
|
return w.setObject(addr, value, schema)
|
|
|
|
default:
|
|
|
|
panic(fmt.Sprintf("Unknown type: %#v", schema.Type))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (w *MapFieldWriter) setList(
|
|
|
|
addr []string,
|
|
|
|
v interface{},
|
|
|
|
schema *Schema) error {
|
|
|
|
k := strings.Join(addr, ".")
|
|
|
|
setElement := func(idx string, value interface{}) error {
|
|
|
|
addrCopy := make([]string, len(addr), len(addr)+1)
|
|
|
|
copy(addrCopy, addr)
|
|
|
|
return w.set(append(addrCopy, idx), value)
|
|
|
|
}
|
|
|
|
|
|
|
|
var vs []interface{}
|
|
|
|
if err := mapstructure.Decode(v, &vs); err != nil {
|
|
|
|
return fmt.Errorf("%s: %s", k, err)
|
|
|
|
}
|
|
|
|
|
|
|
|
// Set the entire list.
|
|
|
|
var err error
|
|
|
|
for i, elem := range vs {
|
|
|
|
is := strconv.FormatInt(int64(i), 10)
|
|
|
|
err = setElement(is, elem)
|
|
|
|
if err != nil {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if err != nil {
|
|
|
|
for i, _ := range vs {
|
|
|
|
is := strconv.FormatInt(int64(i), 10)
|
|
|
|
setElement(is, nil)
|
|
|
|
}
|
|
|
|
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
|
|
|
|
w.result[k+".#"] = strconv.FormatInt(int64(len(vs)), 10)
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
func (w *MapFieldWriter) setMap(
|
|
|
|
addr []string,
|
|
|
|
value interface{},
|
|
|
|
schema *Schema) error {
|
|
|
|
k := strings.Join(addr, ".")
|
|
|
|
v := reflect.ValueOf(value)
|
|
|
|
vs := make(map[string]interface{})
|
|
|
|
|
2015-05-06 17:21:22 +02:00
|
|
|
if value == nil {
|
2015-01-10 20:44:26 +01:00
|
|
|
// The empty string here means the map is removed.
|
|
|
|
w.result[k] = ""
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
2015-05-06 17:21:22 +02:00
|
|
|
if v.Kind() != reflect.Map {
|
|
|
|
return fmt.Errorf("%s: must be a map", k)
|
|
|
|
}
|
|
|
|
if v.Type().Key().Kind() != reflect.String {
|
|
|
|
return fmt.Errorf("%s: keys must strings", k)
|
|
|
|
}
|
|
|
|
for _, mk := range v.MapKeys() {
|
|
|
|
mv := v.MapIndex(mk)
|
|
|
|
vs[mk.String()] = mv.Interface()
|
|
|
|
}
|
|
|
|
|
2015-01-10 20:44:26 +01:00
|
|
|
// Remove the pure key since we're setting the full map value
|
|
|
|
delete(w.result, k)
|
|
|
|
|
|
|
|
// Set each subkey
|
|
|
|
addrCopy := make([]string, len(addr), len(addr)+1)
|
|
|
|
copy(addrCopy, addr)
|
|
|
|
for subKey, v := range vs {
|
|
|
|
if err := w.set(append(addrCopy, subKey), v); err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-01-15 23:12:24 +01:00
|
|
|
// Set the count
|
core: Use .% instead of .# for maps in state
The flatmapped representation of state prior to this commit encoded maps
and lists (and therefore by extension, sets) with a key corresponding to
the number of elements, or the unknown variable indicator under a .# key
and then individual items. For example, the list ["a", "b", "c"] would
have been encoded as:
listname.# = 3
listname.0 = "a"
listname.1 = "b"
listname.2 = "c"
And the map {"key1": "value1", "key2", "value2"} would have been encoded
as:
mapname.# = 2
mapname.key1 = "value1"
mapname.key2 = "value2"
Sets use the hash code as the key - for example a set with a (fictional)
hashcode calculation may look like:
setname.# = 2
setname.12312512 = "value1"
setname.56345233 = "value2"
Prior to the work done to extend the type system, this was sufficient
since the internal representation of these was effectively the same.
However, following the separation of maps and lists into distinct
first-class types, this encoding presents a problem: given a state file,
it is impossible to tell the encoding of an empty list and an empty map
apart. This presents problems for the type checker during interpolation,
as many interpolation functions will operate on only one of these two
structures.
This commit therefore changes the representation in state of maps to use
a "%" as the key for the number of elements. Consequently the map above
will now be encoded as:
mapname.% = 2
mapname.key1 = "value1"
mapname.key2 = "value2"
This has the effect of an empty list (or set) now being encoded as:
listname.# = 0
And an empty map now being encoded as:
mapname.% = 0
Therefore we can eliminate some nasty guessing logic from the resource
variable supplier for interpolation, at the cost of having to migrate
state up front (to follow in a subsequent commit).
In order to reduce the number of potential situations in which resources
would be "forced new", we continue to accept "#" as the count key when
reading maps via helper/schema. There is no situation under which we can
allow "#" as an actual map key in any case, as it would not be
distinguishable from a list or set in state.
2016-06-05 10:34:43 +02:00
|
|
|
w.result[k+".%"] = strconv.Itoa(len(vs))
|
2015-01-15 23:12:24 +01:00
|
|
|
|
2015-01-10 20:44:26 +01:00
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
func (w *MapFieldWriter) setObject(
|
|
|
|
addr []string,
|
|
|
|
value interface{},
|
|
|
|
schema *Schema) error {
|
|
|
|
// Set the entire object. First decode into a proper structure
|
|
|
|
var v map[string]interface{}
|
|
|
|
if err := mapstructure.Decode(value, &v); err != nil {
|
|
|
|
return fmt.Errorf("%s: %s", strings.Join(addr, "."), err)
|
|
|
|
}
|
|
|
|
|
|
|
|
// Make space for additional elements in the address
|
|
|
|
addrCopy := make([]string, len(addr), len(addr)+1)
|
|
|
|
copy(addrCopy, addr)
|
|
|
|
|
|
|
|
// Set each element in turn
|
|
|
|
var err error
|
|
|
|
for k1, v1 := range v {
|
|
|
|
if err = w.set(append(addrCopy, k1), v1); err != nil {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if err != nil {
|
|
|
|
for k1, _ := range v {
|
|
|
|
w.set(append(addrCopy, k1), nil)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
|
|
|
|
func (w *MapFieldWriter) setPrimitive(
|
|
|
|
addr []string,
|
|
|
|
v interface{},
|
|
|
|
schema *Schema) error {
|
|
|
|
k := strings.Join(addr, ".")
|
|
|
|
|
|
|
|
if v == nil {
|
2015-09-16 22:26:27 +02:00
|
|
|
// The empty string here means the value is removed.
|
|
|
|
w.result[k] = ""
|
2015-01-10 20:44:26 +01:00
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
var set string
|
|
|
|
switch schema.Type {
|
|
|
|
case TypeBool:
|
|
|
|
var b bool
|
|
|
|
if err := mapstructure.Decode(v, &b); err != nil {
|
|
|
|
return fmt.Errorf("%s: %s", k, err)
|
|
|
|
}
|
|
|
|
|
|
|
|
set = strconv.FormatBool(b)
|
|
|
|
case TypeString:
|
|
|
|
if err := mapstructure.Decode(v, &set); err != nil {
|
|
|
|
return fmt.Errorf("%s: %s", k, err)
|
|
|
|
}
|
|
|
|
case TypeInt:
|
|
|
|
var n int
|
|
|
|
if err := mapstructure.Decode(v, &n); err != nil {
|
|
|
|
return fmt.Errorf("%s: %s", k, err)
|
|
|
|
}
|
2015-01-28 22:20:14 +01:00
|
|
|
set = strconv.FormatInt(int64(n), 10)
|
2015-01-28 18:53:34 +01:00
|
|
|
case TypeFloat:
|
|
|
|
var n float64
|
|
|
|
if err := mapstructure.Decode(v, &n); err != nil {
|
|
|
|
return fmt.Errorf("%s: %s", k, err)
|
|
|
|
}
|
2015-01-28 22:20:14 +01:00
|
|
|
set = strconv.FormatFloat(float64(n), 'G', -1, 64)
|
2015-01-10 20:44:26 +01:00
|
|
|
default:
|
|
|
|
return fmt.Errorf("Unknown type: %#v", schema.Type)
|
|
|
|
}
|
|
|
|
|
|
|
|
w.result[k] = set
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
func (w *MapFieldWriter) setSet(
|
|
|
|
addr []string,
|
|
|
|
value interface{},
|
|
|
|
schema *Schema) error {
|
|
|
|
addrCopy := make([]string, len(addr), len(addr)+1)
|
|
|
|
copy(addrCopy, addr)
|
2015-01-16 13:30:11 +01:00
|
|
|
k := strings.Join(addr, ".")
|
|
|
|
|
|
|
|
if value == nil {
|
|
|
|
w.result[k+".#"] = "0"
|
|
|
|
return nil
|
|
|
|
}
|
2015-01-10 20:44:26 +01:00
|
|
|
|
|
|
|
// If it is a slice, then we have to turn it into a *Set so that
|
|
|
|
// we get the proper order back based on the hash code.
|
|
|
|
if v := reflect.ValueOf(value); v.Kind() == reflect.Slice {
|
|
|
|
// Build a temp *ResourceData to use for the conversion
|
|
|
|
tempSchema := *schema
|
|
|
|
tempSchema.Type = TypeList
|
|
|
|
tempSchemaMap := map[string]*Schema{addr[0]: &tempSchema}
|
|
|
|
tempW := &MapFieldWriter{Schema: tempSchemaMap}
|
|
|
|
|
|
|
|
// Set the entire list, this lets us get sane values out of it
|
|
|
|
if err := tempW.WriteField(addr, value); err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
|
|
|
|
// Build the set by going over the list items in order and
|
|
|
|
// hashing them into the set. The reason we go over the list and
|
|
|
|
// not the `value` directly is because this forces all types
|
|
|
|
// to become []interface{} (generic) instead of []string, which
|
|
|
|
// most hash functions are expecting.
|
2016-01-21 21:54:56 +01:00
|
|
|
s := schema.ZeroValue().(*Set)
|
2015-01-10 20:44:26 +01:00
|
|
|
tempR := &MapFieldReader{
|
|
|
|
Map: BasicMapReader(tempW.Map()),
|
|
|
|
Schema: tempSchemaMap,
|
|
|
|
}
|
|
|
|
for i := 0; i < v.Len(); i++ {
|
|
|
|
is := strconv.FormatInt(int64(i), 10)
|
|
|
|
result, err := tempR.ReadField(append(addrCopy, is))
|
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
if !result.Exists {
|
|
|
|
panic("set item just set doesn't exist")
|
|
|
|
}
|
|
|
|
|
|
|
|
s.Add(result.Value)
|
|
|
|
}
|
|
|
|
|
|
|
|
value = s
|
|
|
|
}
|
|
|
|
|
2015-01-16 12:43:57 +01:00
|
|
|
for code, elem := range value.(*Set).m {
|
2015-11-18 11:24:04 +01:00
|
|
|
if err := w.set(append(addrCopy, code), elem); err != nil {
|
2015-01-16 12:43:57 +01:00
|
|
|
return err
|
2015-01-10 20:44:26 +01:00
|
|
|
}
|
|
|
|
}
|
2015-01-16 12:43:57 +01:00
|
|
|
|
|
|
|
w.result[k+".#"] = strconv.Itoa(value.(*Set).Len())
|
2015-01-10 20:44:26 +01:00
|
|
|
return nil
|
|
|
|
}
|