2014-12-19 18:22:53 +01:00
|
|
|
package schema
|
|
|
|
|
|
|
|
import (
|
|
|
|
"fmt"
|
2015-01-09 03:02:19 +01:00
|
|
|
"strconv"
|
2014-12-19 18:22:53 +01:00
|
|
|
"strings"
|
2015-01-09 03:02:19 +01:00
|
|
|
"sync"
|
2014-12-19 18:22:53 +01:00
|
|
|
|
|
|
|
"github.com/hashicorp/terraform/terraform"
|
|
|
|
"github.com/mitchellh/mapstructure"
|
|
|
|
)
|
|
|
|
|
2015-01-27 21:23:49 +01:00
|
|
|
// ConfigFieldReader reads fields out of an untyped map[string]string to the
|
|
|
|
// best of its ability. It also applies defaults from the Schema. (The other
|
|
|
|
// field readers do not need default handling because they source fully
|
|
|
|
// populated data structures.)
|
2014-12-19 18:22:53 +01:00
|
|
|
type ConfigFieldReader struct {
|
|
|
|
Config *terraform.ResourceConfig
|
2015-01-03 18:13:46 +01:00
|
|
|
Schema map[string]*Schema
|
2015-01-09 03:02:19 +01:00
|
|
|
|
|
|
|
lock sync.Mutex
|
2014-12-19 18:22:53 +01:00
|
|
|
}
|
|
|
|
|
2015-01-03 18:13:46 +01:00
|
|
|
func (r *ConfigFieldReader) ReadField(address []string) (FieldReadResult, error) {
|
2015-01-09 03:02:19 +01:00
|
|
|
return r.readField(address, false)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (r *ConfigFieldReader) readField(
|
|
|
|
address []string, nested bool) (FieldReadResult, error) {
|
|
|
|
schemaList := addrToSchema(address, r.Schema)
|
|
|
|
if len(schemaList) == 0 {
|
2015-01-03 18:13:46 +01:00
|
|
|
return FieldReadResult{}, nil
|
|
|
|
}
|
2014-12-19 18:22:53 +01:00
|
|
|
|
2015-01-09 03:02:19 +01:00
|
|
|
if !nested {
|
|
|
|
// If we have a set anywhere in the address, then we need to
|
|
|
|
// read that set out in order and actually replace that part of
|
|
|
|
// the address with the real list index. i.e. set.50 might actually
|
|
|
|
// map to set.12 in the config, since it is in list order in the
|
|
|
|
// config, not indexed by set value.
|
|
|
|
for i, v := range schemaList {
|
|
|
|
// Sets are the only thing that cause this issue.
|
|
|
|
if v.Type != TypeSet {
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
|
|
|
|
// If we're at the end of the list, then we don't have to worry
|
|
|
|
// about this because we're just requesting the whole set.
|
|
|
|
if i == len(schemaList)-1 {
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
|
|
|
|
// If we're looking for the count, then ignore...
|
|
|
|
if address[i+1] == "#" {
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
|
|
|
|
// Get the code
|
|
|
|
code, err := strconv.ParseInt(address[i+1], 0, 0)
|
|
|
|
if err != nil {
|
|
|
|
return FieldReadResult{}, err
|
|
|
|
}
|
|
|
|
|
|
|
|
// Get the set so we can get the index map that tells us the
|
|
|
|
// mapping of the hash code to the list index
|
|
|
|
_, indexMap, err := r.readSet(address[:i+1], v)
|
|
|
|
if err != nil {
|
|
|
|
return FieldReadResult{}, err
|
|
|
|
}
|
|
|
|
|
|
|
|
index, ok := indexMap[int(code)]
|
|
|
|
if !ok {
|
|
|
|
return FieldReadResult{}, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
address[i+1] = strconv.FormatInt(int64(index), 10)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
k := strings.Join(address, ".")
|
|
|
|
schema := schemaList[len(schemaList)-1]
|
2014-12-19 18:22:53 +01:00
|
|
|
switch schema.Type {
|
|
|
|
case TypeBool:
|
|
|
|
fallthrough
|
2015-01-11 01:04:01 +01:00
|
|
|
case TypeFloat:
|
|
|
|
fallthrough
|
2014-12-19 18:22:53 +01:00
|
|
|
case TypeInt:
|
|
|
|
fallthrough
|
|
|
|
case TypeString:
|
|
|
|
return r.readPrimitive(k, schema)
|
|
|
|
case TypeList:
|
2015-01-09 03:02:19 +01:00
|
|
|
return readListField(&nestedConfigFieldReader{r}, address, schema)
|
2014-12-19 18:22:53 +01:00
|
|
|
case TypeMap:
|
|
|
|
return r.readMap(k)
|
|
|
|
case TypeSet:
|
2015-01-09 03:02:19 +01:00
|
|
|
result, _, err := r.readSet(address, schema)
|
|
|
|
return result, err
|
2014-12-19 18:22:53 +01:00
|
|
|
case typeObject:
|
2015-01-09 03:02:19 +01:00
|
|
|
return readObjectField(
|
|
|
|
&nestedConfigFieldReader{r},
|
|
|
|
address, schema.Elem.(map[string]*Schema))
|
2014-12-19 18:22:53 +01:00
|
|
|
default:
|
2015-01-11 01:04:01 +01:00
|
|
|
panic(fmt.Sprintf("Unknown type: %s", schema.Type))
|
2014-12-19 18:22:53 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-12-19 21:47:35 +01:00
|
|
|
func (r *ConfigFieldReader) readMap(k string) (FieldReadResult, error) {
|
2014-12-19 18:22:53 +01:00
|
|
|
mraw, ok := r.Config.Get(k)
|
|
|
|
if !ok {
|
2014-12-19 21:47:35 +01:00
|
|
|
return FieldReadResult{}, nil
|
2014-12-19 18:22:53 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
result := make(map[string]interface{})
|
|
|
|
switch m := mraw.(type) {
|
|
|
|
case []interface{}:
|
|
|
|
for _, innerRaw := range m {
|
|
|
|
for k, v := range innerRaw.(map[string]interface{}) {
|
|
|
|
result[k] = v
|
|
|
|
}
|
|
|
|
}
|
|
|
|
case []map[string]interface{}:
|
|
|
|
for _, innerRaw := range m {
|
|
|
|
for k, v := range innerRaw {
|
|
|
|
result[k] = v
|
|
|
|
}
|
|
|
|
}
|
|
|
|
case map[string]interface{}:
|
|
|
|
result = m
|
|
|
|
default:
|
|
|
|
panic(fmt.Sprintf("unknown type: %#v", mraw))
|
|
|
|
}
|
|
|
|
|
2014-12-19 21:47:35 +01:00
|
|
|
return FieldReadResult{
|
|
|
|
Value: result,
|
|
|
|
Exists: true,
|
|
|
|
}, nil
|
2014-12-19 18:22:53 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
func (r *ConfigFieldReader) readPrimitive(
|
2014-12-19 21:47:35 +01:00
|
|
|
k string, schema *Schema) (FieldReadResult, error) {
|
2014-12-19 18:22:53 +01:00
|
|
|
raw, ok := r.Config.Get(k)
|
|
|
|
if !ok {
|
2015-01-27 21:23:49 +01:00
|
|
|
// Nothing in config, but we might still have a default from the schema
|
|
|
|
var err error
|
|
|
|
raw, err = schema.DefaultValue()
|
|
|
|
if err != nil {
|
|
|
|
return FieldReadResult{}, fmt.Errorf("%s, error loading default: %s", k, err)
|
|
|
|
}
|
|
|
|
|
|
|
|
if raw == nil {
|
|
|
|
return FieldReadResult{}, nil
|
|
|
|
}
|
2014-12-19 18:22:53 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
var result string
|
|
|
|
if err := mapstructure.WeakDecode(raw, &result); err != nil {
|
2014-12-19 21:47:35 +01:00
|
|
|
return FieldReadResult{}, err
|
2014-12-19 18:22:53 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
computed := r.Config.IsComputed(k)
|
|
|
|
returnVal, err := stringToPrimitive(result, computed, schema)
|
|
|
|
if err != nil {
|
2014-12-19 21:47:35 +01:00
|
|
|
return FieldReadResult{}, err
|
2014-12-19 18:22:53 +01:00
|
|
|
}
|
|
|
|
|
2014-12-19 21:47:35 +01:00
|
|
|
return FieldReadResult{
|
|
|
|
Value: returnVal,
|
|
|
|
Exists: true,
|
|
|
|
Computed: computed,
|
|
|
|
}, nil
|
2014-12-19 18:22:53 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
func (r *ConfigFieldReader) readSet(
|
2015-01-09 03:02:19 +01:00
|
|
|
address []string, schema *Schema) (FieldReadResult, map[int]int, error) {
|
|
|
|
indexMap := make(map[int]int)
|
2015-01-10 21:42:15 +01:00
|
|
|
// Create the set that will be our result
|
|
|
|
set := &Set{F: schema.Set}
|
|
|
|
|
2015-01-09 03:02:19 +01:00
|
|
|
raw, err := readListField(&nestedConfigFieldReader{r}, address, schema)
|
2014-12-19 18:22:53 +01:00
|
|
|
if err != nil {
|
2015-01-09 03:02:19 +01:00
|
|
|
return FieldReadResult{}, indexMap, err
|
2014-12-19 18:22:53 +01:00
|
|
|
}
|
2014-12-19 21:47:35 +01:00
|
|
|
if !raw.Exists {
|
2015-01-10 21:42:15 +01:00
|
|
|
return FieldReadResult{Value: set}, indexMap, nil
|
2014-12-19 18:22:53 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// If the list is computed, the set is necessarilly computed
|
2014-12-19 21:47:35 +01:00
|
|
|
if raw.Computed {
|
|
|
|
return FieldReadResult{
|
|
|
|
Value: set,
|
|
|
|
Exists: true,
|
|
|
|
Computed: raw.Computed,
|
2015-01-09 03:02:19 +01:00
|
|
|
}, indexMap, nil
|
2014-12-19 18:22:53 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// Build up the set from the list elements
|
2015-01-09 03:02:19 +01:00
|
|
|
for i, v := range raw.Value.([]interface{}) {
|
|
|
|
// Check if any of the keys in this item are computed
|
|
|
|
computed := r.hasComputedSubKeys(
|
|
|
|
fmt.Sprintf("%s.%d", strings.Join(address, "."), i), schema)
|
|
|
|
|
|
|
|
code := set.add(v)
|
|
|
|
indexMap[code] = i
|
|
|
|
if computed {
|
|
|
|
set.m[-code] = set.m[code]
|
|
|
|
delete(set.m, code)
|
|
|
|
code = -code
|
|
|
|
}
|
2014-12-19 18:22:53 +01:00
|
|
|
}
|
|
|
|
|
2014-12-19 21:47:35 +01:00
|
|
|
return FieldReadResult{
|
|
|
|
Value: set,
|
|
|
|
Exists: true,
|
2015-01-09 03:02:19 +01:00
|
|
|
}, indexMap, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// hasComputedSubKeys walks through a schema and returns whether or not the
|
|
|
|
// given key contains any subkeys that are computed.
|
|
|
|
func (r *ConfigFieldReader) hasComputedSubKeys(key string, schema *Schema) bool {
|
|
|
|
prefix := key + "."
|
|
|
|
|
|
|
|
switch t := schema.Elem.(type) {
|
|
|
|
case *Resource:
|
|
|
|
for k, schema := range t.Schema {
|
|
|
|
if r.Config.IsComputed(prefix + k) {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
|
|
|
if r.hasComputedSubKeys(prefix+k, schema) {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
|
|
|
// nestedConfigFieldReader is a funny little thing that just wraps a
|
|
|
|
// ConfigFieldReader to call readField when ReadField is called so that
|
|
|
|
// we don't recalculate the set rewrites in the address, which leads to
|
|
|
|
// an infinite loop.
|
|
|
|
type nestedConfigFieldReader struct {
|
|
|
|
Reader *ConfigFieldReader
|
|
|
|
}
|
|
|
|
|
|
|
|
func (r *nestedConfigFieldReader) ReadField(
|
|
|
|
address []string) (FieldReadResult, error) {
|
|
|
|
return r.Reader.readField(address, true)
|
2014-12-19 18:22:53 +01:00
|
|
|
}
|