|
|
|
@ -72,6 +72,17 @@
|
|
|
|
|
// "name": "alice",
|
|
|
|
|
// }
|
|
|
|
|
//
|
|
|
|
|
// When decoding from a struct to a map, the squash tag squashes the struct
|
|
|
|
|
// fields into a single map. Using the example structs from above:
|
|
|
|
|
//
|
|
|
|
|
// Friend{Person: Person{Name: "alice"}}
|
|
|
|
|
//
|
|
|
|
|
// Will be decoded into a map:
|
|
|
|
|
//
|
|
|
|
|
// map[string]interface{}{
|
|
|
|
|
// "name": "alice",
|
|
|
|
|
// }
|
|
|
|
|
//
|
|
|
|
|
// DecoderConfig has a field that changes the behavior of mapstructure
|
|
|
|
|
// to always squash embedded structs.
|
|
|
|
|
//
|
|
|
|
@ -111,7 +122,7 @@
|
|
|
|
|
// field value is zero and a numeric type, the field is empty, and it won't
|
|
|
|
|
// be encoded into the destination type.
|
|
|
|
|
//
|
|
|
|
|
// type Source {
|
|
|
|
|
// type Source struct {
|
|
|
|
|
// Age int `mapstructure:",omitempty"`
|
|
|
|
|
// }
|
|
|
|
|
//
|
|
|
|
@ -161,10 +172,11 @@ import (
|
|
|
|
|
// data transformations. See "DecodeHook" in the DecoderConfig
|
|
|
|
|
// struct.
|
|
|
|
|
//
|
|
|
|
|
// The type should be DecodeHookFuncType or DecodeHookFuncKind.
|
|
|
|
|
// Either is accepted. Types are a superset of Kinds (Types can return
|
|
|
|
|
// Kinds) and are generally a richer thing to use, but Kinds are simpler
|
|
|
|
|
// if you only need those.
|
|
|
|
|
// The type must be one of DecodeHookFuncType, DecodeHookFuncKind, or
|
|
|
|
|
// DecodeHookFuncValue.
|
|
|
|
|
// Values are a superset of Types (Values can return types), and Types are a
|
|
|
|
|
// superset of Kinds (Types can return Kinds) and are generally a richer thing
|
|
|
|
|
// to use, but Kinds are simpler if you only need those.
|
|
|
|
|
//
|
|
|
|
|
// The reason DecodeHookFunc is multi-typed is for backwards compatibility:
|
|
|
|
|
// we started with Kinds and then realized Types were the better solution,
|
|
|
|
@ -180,15 +192,22 @@ type DecodeHookFuncType func(reflect.Type, reflect.Type, interface{}) (interface
|
|
|
|
|
// source and target types.
|
|
|
|
|
type DecodeHookFuncKind func(reflect.Kind, reflect.Kind, interface{}) (interface{}, error)
|
|
|
|
|
|
|
|
|
|
// DecodeHookFuncValue is a DecodeHookFunc which has complete access to both the source and target
|
|
|
|
|
// values.
|
|
|
|
|
type DecodeHookFuncValue func(from reflect.Value, to reflect.Value) (interface{}, error)
|
|
|
|
|
|
|
|
|
|
// DecoderConfig is the configuration that is used to create a new decoder
|
|
|
|
|
// and allows customization of various aspects of decoding.
|
|
|
|
|
type DecoderConfig struct {
|
|
|
|
|
// DecodeHook, if set, will be called before any decoding and any
|
|
|
|
|
// type conversion (if WeaklyTypedInput is on). This lets you modify
|
|
|
|
|
// the values before they're set down onto the resulting struct.
|
|
|
|
|
// the values before they're set down onto the resulting struct. The
|
|
|
|
|
// DecodeHook is called for every map and value in the input. This means
|
|
|
|
|
// that if a struct has embedded fields with squash tags the decode hook
|
|
|
|
|
// is called only once with all of the input data, not once for each
|
|
|
|
|
// embedded struct.
|
|
|
|
|
//
|
|
|
|
|
// If an error is returned, the entire decode will fail with that
|
|
|
|
|
// error.
|
|
|
|
|
// If an error is returned, the entire decode will fail with that error.
|
|
|
|
|
DecodeHook DecodeHookFunc
|
|
|
|
|
|
|
|
|
|
// If ErrorUnused is true, then it is an error for there to exist
|
|
|
|
@ -196,6 +215,12 @@ type DecoderConfig struct {
|
|
|
|
|
// (extra keys).
|
|
|
|
|
ErrorUnused bool
|
|
|
|
|
|
|
|
|
|
// If ErrorUnset is true, then it is an error for there to exist
|
|
|
|
|
// fields in the result that were not set in the decoding process
|
|
|
|
|
// (extra fields). This only applies to decoding to a struct. This
|
|
|
|
|
// will affect all nested structs as well.
|
|
|
|
|
ErrorUnset bool
|
|
|
|
|
|
|
|
|
|
// ZeroFields, if set to true, will zero fields before writing them.
|
|
|
|
|
// For example, a map will be emptied before decoded values are put in
|
|
|
|
|
// it. If this is false, a map will be merged.
|
|
|
|
@ -239,6 +264,15 @@ type DecoderConfig struct {
|
|
|
|
|
// The tag name that mapstructure reads for field names. This
|
|
|
|
|
// defaults to "mapstructure"
|
|
|
|
|
TagName string
|
|
|
|
|
|
|
|
|
|
// IgnoreUntaggedFields ignores all struct fields without explicit
|
|
|
|
|
// TagName, comparable to `mapstructure:"-"` as default behaviour.
|
|
|
|
|
IgnoreUntaggedFields bool
|
|
|
|
|
|
|
|
|
|
// MatchName is the function used to match the map key to the struct
|
|
|
|
|
// field name or tag. Defaults to `strings.EqualFold`. This can be used
|
|
|
|
|
// to implement case-sensitive tag values, support snake casing, etc.
|
|
|
|
|
MatchName func(mapKey, fieldName string) bool
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// A Decoder takes a raw interface value and turns it into structured
|
|
|
|
@ -260,6 +294,11 @@ type Metadata struct {
|
|
|
|
|
// Unused is a slice of keys that were found in the raw value but
|
|
|
|
|
// weren't decoded since there was no matching field in the result interface
|
|
|
|
|
Unused []string
|
|
|
|
|
|
|
|
|
|
// Unset is a slice of field names that were found in the result interface
|
|
|
|
|
// but weren't set in the decoding process since there was no matching value
|
|
|
|
|
// in the input
|
|
|
|
|
Unset []string
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Decode takes an input structure and uses reflection to translate it to
|
|
|
|
@ -351,12 +390,20 @@ func NewDecoder(config *DecoderConfig) (*Decoder, error) {
|
|
|
|
|
if config.Metadata.Unused == nil {
|
|
|
|
|
config.Metadata.Unused = make([]string, 0)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if config.Metadata.Unset == nil {
|
|
|
|
|
config.Metadata.Unset = make([]string, 0)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if config.TagName == "" {
|
|
|
|
|
config.TagName = "mapstructure"
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if config.MatchName == nil {
|
|
|
|
|
config.MatchName = strings.EqualFold
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
result := &Decoder{
|
|
|
|
|
config: config,
|
|
|
|
|
}
|
|
|
|
@ -409,9 +456,7 @@ func (d *Decoder) decode(name string, input interface{}, outVal reflect.Value) e
|
|
|
|
|
if d.config.DecodeHook != nil {
|
|
|
|
|
// We have a DecodeHook, so let's pre-process the input.
|
|
|
|
|
var err error
|
|
|
|
|
input, err = DecodeHookExec(
|
|
|
|
|
d.config.DecodeHook,
|
|
|
|
|
inputVal.Type(), outVal.Type(), input)
|
|
|
|
|
input, err = DecodeHookExec(d.config.DecodeHook, inputVal, outVal)
|
|
|
|
|
if err != nil {
|
|
|
|
|
return fmt.Errorf("error decoding '%s': %s", name, err)
|
|
|
|
|
}
|
|
|
|
@ -562,8 +607,8 @@ func (d *Decoder) decodeString(name string, data interface{}, val reflect.Value)
|
|
|
|
|
|
|
|
|
|
if !converted {
|
|
|
|
|
return fmt.Errorf(
|
|
|
|
|
"'%s' expected type '%s', got unconvertible type '%s'",
|
|
|
|
|
name, val.Type(), dataVal.Type())
|
|
|
|
|
"'%s' expected type '%s', got unconvertible type '%s', value: '%v'",
|
|
|
|
|
name, val.Type(), dataVal.Type(), data)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return nil
|
|
|
|
@ -588,7 +633,12 @@ func (d *Decoder) decodeInt(name string, data interface{}, val reflect.Value) er
|
|
|
|
|
val.SetInt(0)
|
|
|
|
|
}
|
|
|
|
|
case dataKind == reflect.String && d.config.WeaklyTypedInput:
|
|
|
|
|
i, err := strconv.ParseInt(dataVal.String(), 0, val.Type().Bits())
|
|
|
|
|
str := dataVal.String()
|
|
|
|
|
if str == "" {
|
|
|
|
|
str = "0"
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
i, err := strconv.ParseInt(str, 0, val.Type().Bits())
|
|
|
|
|
if err == nil {
|
|
|
|
|
val.SetInt(i)
|
|
|
|
|
} else {
|
|
|
|
@ -604,8 +654,8 @@ func (d *Decoder) decodeInt(name string, data interface{}, val reflect.Value) er
|
|
|
|
|
val.SetInt(i)
|
|
|
|
|
default:
|
|
|
|
|
return fmt.Errorf(
|
|
|
|
|
"'%s' expected type '%s', got unconvertible type '%s'",
|
|
|
|
|
name, val.Type(), dataVal.Type())
|
|
|
|
|
"'%s' expected type '%s', got unconvertible type '%s', value: '%v'",
|
|
|
|
|
name, val.Type(), dataVal.Type(), data)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return nil
|
|
|
|
@ -640,7 +690,12 @@ func (d *Decoder) decodeUint(name string, data interface{}, val reflect.Value) e
|
|
|
|
|
val.SetUint(0)
|
|
|
|
|
}
|
|
|
|
|
case dataKind == reflect.String && d.config.WeaklyTypedInput:
|
|
|
|
|
i, err := strconv.ParseUint(dataVal.String(), 0, val.Type().Bits())
|
|
|
|
|
str := dataVal.String()
|
|
|
|
|
if str == "" {
|
|
|
|
|
str = "0"
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
i, err := strconv.ParseUint(str, 0, val.Type().Bits())
|
|
|
|
|
if err == nil {
|
|
|
|
|
val.SetUint(i)
|
|
|
|
|
} else {
|
|
|
|
@ -648,20 +703,16 @@ func (d *Decoder) decodeUint(name string, data interface{}, val reflect.Value) e
|
|
|
|
|
}
|
|
|
|
|
case dataType.PkgPath() == "encoding/json" && dataType.Name() == "Number":
|
|
|
|
|
jn := data.(json.Number)
|
|
|
|
|
i, err := jn.Int64()
|
|
|
|
|
i, err := strconv.ParseUint(string(jn), 0, 64)
|
|
|
|
|
if err != nil {
|
|
|
|
|
return fmt.Errorf(
|
|
|
|
|
"error decoding json.Number into %s: %s", name, err)
|
|
|
|
|
}
|
|
|
|
|
if i < 0 && !d.config.WeaklyTypedInput {
|
|
|
|
|
return fmt.Errorf("cannot parse '%s', %d overflows uint",
|
|
|
|
|
name, i)
|
|
|
|
|
}
|
|
|
|
|
val.SetUint(uint64(i))
|
|
|
|
|
val.SetUint(i)
|
|
|
|
|
default:
|
|
|
|
|
return fmt.Errorf(
|
|
|
|
|
"'%s' expected type '%s', got unconvertible type '%s'",
|
|
|
|
|
name, val.Type(), dataVal.Type())
|
|
|
|
|
"'%s' expected type '%s', got unconvertible type '%s', value: '%v'",
|
|
|
|
|
name, val.Type(), dataVal.Type(), data)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return nil
|
|
|
|
@ -691,8 +742,8 @@ func (d *Decoder) decodeBool(name string, data interface{}, val reflect.Value) e
|
|
|
|
|
}
|
|
|
|
|
default:
|
|
|
|
|
return fmt.Errorf(
|
|
|
|
|
"'%s' expected type '%s', got unconvertible type '%s'",
|
|
|
|
|
name, val.Type(), dataVal.Type())
|
|
|
|
|
"'%s' expected type '%s', got unconvertible type '%s', value: '%v'",
|
|
|
|
|
name, val.Type(), dataVal.Type(), data)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return nil
|
|
|
|
@ -717,7 +768,12 @@ func (d *Decoder) decodeFloat(name string, data interface{}, val reflect.Value)
|
|
|
|
|
val.SetFloat(0)
|
|
|
|
|
}
|
|
|
|
|
case dataKind == reflect.String && d.config.WeaklyTypedInput:
|
|
|
|
|
f, err := strconv.ParseFloat(dataVal.String(), val.Type().Bits())
|
|
|
|
|
str := dataVal.String()
|
|
|
|
|
if str == "" {
|
|
|
|
|
str = "0"
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
f, err := strconv.ParseFloat(str, val.Type().Bits())
|
|
|
|
|
if err == nil {
|
|
|
|
|
val.SetFloat(f)
|
|
|
|
|
} else {
|
|
|
|
@ -733,8 +789,8 @@ func (d *Decoder) decodeFloat(name string, data interface{}, val reflect.Value)
|
|
|
|
|
val.SetFloat(i)
|
|
|
|
|
default:
|
|
|
|
|
return fmt.Errorf(
|
|
|
|
|
"'%s' expected type '%s', got unconvertible type '%s'",
|
|
|
|
|
name, val.Type(), dataVal.Type())
|
|
|
|
|
"'%s' expected type '%s', got unconvertible type '%s', value: '%v'",
|
|
|
|
|
name, val.Type(), dataVal.Type(), data)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return nil
|
|
|
|
@ -785,7 +841,7 @@ func (d *Decoder) decodeMapFromSlice(name string, dataVal reflect.Value, val ref
|
|
|
|
|
|
|
|
|
|
for i := 0; i < dataVal.Len(); i++ {
|
|
|
|
|
err := d.decode(
|
|
|
|
|
fmt.Sprintf("%s[%d]", name, i),
|
|
|
|
|
name+"["+strconv.Itoa(i)+"]",
|
|
|
|
|
dataVal.Index(i).Interface(), val)
|
|
|
|
|
if err != nil {
|
|
|
|
|
return err
|
|
|
|
@ -818,7 +874,7 @@ func (d *Decoder) decodeMapFromMap(name string, dataVal reflect.Value, val refle
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for _, k := range dataVal.MapKeys() {
|
|
|
|
|
fieldName := fmt.Sprintf("%s[%s]", name, k)
|
|
|
|
|
fieldName := name + "[" + k.String() + "]"
|
|
|
|
|
|
|
|
|
|
// First decode the key into the proper type
|
|
|
|
|
currentKey := reflect.Indirect(reflect.New(valKeyType))
|
|
|
|
@ -869,8 +925,15 @@ func (d *Decoder) decodeMapFromStruct(name string, dataVal reflect.Value, val re
|
|
|
|
|
tagValue := f.Tag.Get(d.config.TagName)
|
|
|
|
|
keyName := f.Name
|
|
|
|
|
|
|
|
|
|
if tagValue == "" && d.config.IgnoreUntaggedFields {
|
|
|
|
|
continue
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// If Squash is set in the config, we squash the field down.
|
|
|
|
|
squash := d.config.Squash && v.Kind() == reflect.Struct && f.Anonymous
|
|
|
|
|
|
|
|
|
|
v = dereferencePtrToStructIfNeeded(v, d.config.TagName)
|
|
|
|
|
|
|
|
|
|
// Determine the name of the key in the map
|
|
|
|
|
if index := strings.Index(tagValue, ","); index != -1 {
|
|
|
|
|
if tagValue[:index] == "-" {
|
|
|
|
@ -882,11 +945,21 @@ func (d *Decoder) decodeMapFromStruct(name string, dataVal reflect.Value, val re
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// If "squash" is specified in the tag, we squash the field down.
|
|
|
|
|
squash = !squash && strings.Index(tagValue[index+1:], "squash") != -1
|
|
|
|
|
if squash && v.Kind() != reflect.Struct {
|
|
|
|
|
squash = squash || strings.Index(tagValue[index+1:], "squash") != -1
|
|
|
|
|
if squash {
|
|
|
|
|
// When squashing, the embedded type can be a pointer to a struct.
|
|
|
|
|
if v.Kind() == reflect.Ptr && v.Elem().Kind() == reflect.Struct {
|
|
|
|
|
v = v.Elem()
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// The final type must be a struct
|
|
|
|
|
if v.Kind() != reflect.Struct {
|
|
|
|
|
return fmt.Errorf("cannot squash non-struct type '%s'", v.Type())
|
|
|
|
|
}
|
|
|
|
|
keyName = tagValue[:index]
|
|
|
|
|
}
|
|
|
|
|
if keyNameTagValue := tagValue[:index]; keyNameTagValue != "" {
|
|
|
|
|
keyName = keyNameTagValue
|
|
|
|
|
}
|
|
|
|
|
} else if len(tagValue) > 0 {
|
|
|
|
|
if tagValue == "-" {
|
|
|
|
|
continue
|
|
|
|
@ -906,11 +979,22 @@ func (d *Decoder) decodeMapFromStruct(name string, dataVal reflect.Value, val re
|
|
|
|
|
mType := reflect.MapOf(vKeyType, vElemType)
|
|
|
|
|
vMap := reflect.MakeMap(mType)
|
|
|
|
|
|
|
|
|
|
err := d.decode(keyName, x.Interface(), vMap)
|
|
|
|
|
// Creating a pointer to a map so that other methods can completely
|
|
|
|
|
// overwrite the map if need be (looking at you decodeMapFromMap). The
|
|
|
|
|
// indirection allows the underlying map to be settable (CanSet() == true)
|
|
|
|
|
// where as reflect.MakeMap returns an unsettable map.
|
|
|
|
|
addrVal := reflect.New(vMap.Type())
|
|
|
|
|
reflect.Indirect(addrVal).Set(vMap)
|
|
|
|
|
|
|
|
|
|
err := d.decode(keyName, x.Interface(), reflect.Indirect(addrVal))
|
|
|
|
|
if err != nil {
|
|
|
|
|
return err
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// the underlying map may have been completely overwritten so pull
|
|
|
|
|
// it indirectly out of the enclosing value.
|
|
|
|
|
vMap = reflect.Indirect(addrVal)
|
|
|
|
|
|
|
|
|
|
if squash {
|
|
|
|
|
for _, k := range vMap.MapKeys() {
|
|
|
|
|
valMap.SetMapIndex(k, vMap.MapIndex(k))
|
|
|
|
@ -984,8 +1068,8 @@ func (d *Decoder) decodeFunc(name string, data interface{}, val reflect.Value) e
|
|
|
|
|
dataVal := reflect.Indirect(reflect.ValueOf(data))
|
|
|
|
|
if val.Type() != dataVal.Type() {
|
|
|
|
|
return fmt.Errorf(
|
|
|
|
|
"'%s' expected type '%s', got unconvertible type '%s'",
|
|
|
|
|
name, val.Type(), dataVal.Type())
|
|
|
|
|
"'%s' expected type '%s', got unconvertible type '%s', value: '%v'",
|
|
|
|
|
name, val.Type(), dataVal.Type(), data)
|
|
|
|
|
}
|
|
|
|
|
val.Set(dataVal)
|
|
|
|
|
return nil
|
|
|
|
@ -1031,7 +1115,7 @@ func (d *Decoder) decodeSlice(name string, data interface{}, val reflect.Value)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// If the input value is nil, then don't allocate since empty != nil
|
|
|
|
|
if dataVal.IsNil() {
|
|
|
|
|
if dataValKind != reflect.Array && dataVal.IsNil() {
|
|
|
|
|
return nil
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
@ -1051,7 +1135,7 @@ func (d *Decoder) decodeSlice(name string, data interface{}, val reflect.Value)
|
|
|
|
|
}
|
|
|
|
|
currentField := valSlice.Index(i)
|
|
|
|
|
|
|
|
|
|
fieldName := fmt.Sprintf("%s[%d]", name, i)
|
|
|
|
|
fieldName := name + "[" + strconv.Itoa(i) + "]"
|
|
|
|
|
if err := d.decode(fieldName, currentData, currentField); err != nil {
|
|
|
|
|
errors = appendErrors(errors, err)
|
|
|
|
|
}
|
|
|
|
@ -1118,7 +1202,7 @@ func (d *Decoder) decodeArray(name string, data interface{}, val reflect.Value)
|
|
|
|
|
currentData := dataVal.Index(i).Interface()
|
|
|
|
|
currentField := valArray.Index(i)
|
|
|
|
|
|
|
|
|
|
fieldName := fmt.Sprintf("%s[%d]", name, i)
|
|
|
|
|
fieldName := name + "[" + strconv.Itoa(i) + "]"
|
|
|
|
|
if err := d.decode(fieldName, currentData, currentField); err != nil {
|
|
|
|
|
errors = appendErrors(errors, err)
|
|
|
|
|
}
|
|
|
|
@ -1154,13 +1238,23 @@ func (d *Decoder) decodeStruct(name string, data interface{}, val reflect.Value)
|
|
|
|
|
// Not the most efficient way to do this but we can optimize later if
|
|
|
|
|
// we want to. To convert from struct to struct we go to map first
|
|
|
|
|
// as an intermediary.
|
|
|
|
|
m := make(map[string]interface{})
|
|
|
|
|
mval := reflect.Indirect(reflect.ValueOf(&m))
|
|
|
|
|
if err := d.decodeMapFromStruct(name, dataVal, mval, mval); err != nil {
|
|
|
|
|
|
|
|
|
|
// Make a new map to hold our result
|
|
|
|
|
mapType := reflect.TypeOf((map[string]interface{})(nil))
|
|
|
|
|
mval := reflect.MakeMap(mapType)
|
|
|
|
|
|
|
|
|
|
// Creating a pointer to a map so that other methods can completely
|
|
|
|
|
// overwrite the map if need be (looking at you decodeMapFromMap). The
|
|
|
|
|
// indirection allows the underlying map to be settable (CanSet() == true)
|
|
|
|
|
// where as reflect.MakeMap returns an unsettable map.
|
|
|
|
|
addrVal := reflect.New(mval.Type())
|
|
|
|
|
|
|
|
|
|
reflect.Indirect(addrVal).Set(mval)
|
|
|
|
|
if err := d.decodeMapFromStruct(name, dataVal, reflect.Indirect(addrVal), mval); err != nil {
|
|
|
|
|
return err
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
result := d.decodeStructFromMap(name, mval, val)
|
|
|
|
|
result := d.decodeStructFromMap(name, reflect.Indirect(addrVal), val)
|
|
|
|
|
return result
|
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
@ -1183,6 +1277,7 @@ func (d *Decoder) decodeStructFromMap(name string, dataVal, val reflect.Value) e
|
|
|
|
|
dataValKeysUnused[dataValKey.Interface()] = struct{}{}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
targetValKeysUnused := make(map[interface{}]struct{})
|
|
|
|
|
errors := make([]string, 0)
|
|
|
|
|
|
|
|
|
|
// This slice will keep track of all the structs we'll be decoding.
|
|
|
|
@ -1211,10 +1306,14 @@ func (d *Decoder) decodeStructFromMap(name string, dataVal, val reflect.Value) e
|
|
|
|
|
|
|
|
|
|
for i := 0; i < structType.NumField(); i++ {
|
|
|
|
|
fieldType := structType.Field(i)
|
|
|
|
|
fieldKind := fieldType.Type.Kind()
|
|
|
|
|
fieldVal := structVal.Field(i)
|
|
|
|
|
if fieldVal.Kind() == reflect.Ptr && fieldVal.Elem().Kind() == reflect.Struct {
|
|
|
|
|
// Handle embedded struct pointers as embedded structs.
|
|
|
|
|
fieldVal = fieldVal.Elem()
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// If "squash" is specified in the tag, we squash the field down.
|
|
|
|
|
squash := d.config.Squash && fieldKind == reflect.Struct && fieldType.Anonymous
|
|
|
|
|
squash := d.config.Squash && fieldVal.Kind() == reflect.Struct && fieldType.Anonymous
|
|
|
|
|
remain := false
|
|
|
|
|
|
|
|
|
|
// We always parse the tags cause we're looking for other tags too
|
|
|
|
@ -1232,21 +1331,21 @@ func (d *Decoder) decodeStructFromMap(name string, dataVal, val reflect.Value) e
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if squash {
|
|
|
|
|
if fieldKind != reflect.Struct {
|
|
|
|
|
if fieldVal.Kind() != reflect.Struct {
|
|
|
|
|
errors = appendErrors(errors,
|
|
|
|
|
fmt.Errorf("%s: unsupported type for squash: %s", fieldType.Name, fieldKind))
|
|
|
|
|
fmt.Errorf("%s: unsupported type for squash: %s", fieldType.Name, fieldVal.Kind()))
|
|
|
|
|
} else {
|
|
|
|
|
structs = append(structs, structVal.FieldByName(fieldType.Name))
|
|
|
|
|
structs = append(structs, fieldVal)
|
|
|
|
|
}
|
|
|
|
|
continue
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Build our field
|
|
|
|
|
if remain {
|
|
|
|
|
remainField = &field{fieldType, structVal.Field(i)}
|
|
|
|
|
remainField = &field{fieldType, fieldVal}
|
|
|
|
|
} else {
|
|
|
|
|
// Normal struct field, store it away
|
|
|
|
|
fields = append(fields, field{fieldType, structVal.Field(i)})
|
|
|
|
|
fields = append(fields, field{fieldType, fieldVal})
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
@ -1274,7 +1373,7 @@ func (d *Decoder) decodeStructFromMap(name string, dataVal, val reflect.Value) e
|
|
|
|
|
continue
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if strings.EqualFold(mK, fieldName) {
|
|
|
|
|
if d.config.MatchName(mK, fieldName) {
|
|
|
|
|
rawMapKey = dataValKey
|
|
|
|
|
rawMapVal = dataVal.MapIndex(dataValKey)
|
|
|
|
|
break
|
|
|
|
@ -1283,7 +1382,8 @@ func (d *Decoder) decodeStructFromMap(name string, dataVal, val reflect.Value) e
|
|
|
|
|
|
|
|
|
|
if !rawMapVal.IsValid() {
|
|
|
|
|
// There was no matching key in the map for the value in
|
|
|
|
|
// the struct. Just ignore.
|
|
|
|
|
// the struct. Remember it for potential errors and metadata.
|
|
|
|
|
targetValKeysUnused[fieldName] = struct{}{}
|
|
|
|
|
continue
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
@ -1305,7 +1405,7 @@ func (d *Decoder) decodeStructFromMap(name string, dataVal, val reflect.Value) e
|
|
|
|
|
// If the name is empty string, then we're at the root, and we
|
|
|
|
|
// don't dot-join the fields.
|
|
|
|
|
if name != "" {
|
|
|
|
|
fieldName = fmt.Sprintf("%s.%s", name, fieldName)
|
|
|
|
|
fieldName = name + "." + fieldName
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if err := d.decode(fieldName, rawMapVal.Interface(), fieldValue); err != nil {
|
|
|
|
@ -1343,6 +1443,17 @@ func (d *Decoder) decodeStructFromMap(name string, dataVal, val reflect.Value) e
|
|
|
|
|
errors = appendErrors(errors, err)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if d.config.ErrorUnset && len(targetValKeysUnused) > 0 {
|
|
|
|
|
keys := make([]string, 0, len(targetValKeysUnused))
|
|
|
|
|
for rawKey := range targetValKeysUnused {
|
|
|
|
|
keys = append(keys, rawKey.(string))
|
|
|
|
|
}
|
|
|
|
|
sort.Strings(keys)
|
|
|
|
|
|
|
|
|
|
err := fmt.Errorf("'%s' has unset fields: %s", name, strings.Join(keys, ", "))
|
|
|
|
|
errors = appendErrors(errors, err)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if len(errors) > 0 {
|
|
|
|
|
return &Error{errors}
|
|
|
|
|
}
|
|
|
|
@ -1352,11 +1463,19 @@ func (d *Decoder) decodeStructFromMap(name string, dataVal, val reflect.Value) e
|
|
|
|
|
for rawKey := range dataValKeysUnused {
|
|
|
|
|
key := rawKey.(string)
|
|
|
|
|
if name != "" {
|
|
|
|
|
key = fmt.Sprintf("%s.%s", name, key)
|
|
|
|
|
key = name + "." + key
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
d.config.Metadata.Unused = append(d.config.Metadata.Unused, key)
|
|
|
|
|
}
|
|
|
|
|
for rawKey := range targetValKeysUnused {
|
|
|
|
|
key := rawKey.(string)
|
|
|
|
|
if name != "" {
|
|
|
|
|
key = name + "." + key
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
d.config.Metadata.Unset = append(d.config.Metadata.Unset, key)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return nil
|
|
|
|
@ -1394,3 +1513,28 @@ func getKind(val reflect.Value) reflect.Kind {
|
|
|
|
|
return kind
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
func isStructTypeConvertibleToMap(typ reflect.Type, checkMapstructureTags bool, tagName string) bool {
|
|
|
|
|
for i := 0; i < typ.NumField(); i++ {
|
|
|
|
|
f := typ.Field(i)
|
|
|
|
|
if f.PkgPath == "" && !checkMapstructureTags { // check for unexported fields
|
|
|
|
|
return true
|
|
|
|
|
}
|
|
|
|
|
if checkMapstructureTags && f.Tag.Get(tagName) != "" { // check for mapstructure tags inside
|
|
|
|
|
return true
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return false
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
func dereferencePtrToStructIfNeeded(v reflect.Value, tagName string) reflect.Value {
|
|
|
|
|
if v.Kind() != reflect.Ptr || v.Elem().Kind() != reflect.Struct {
|
|
|
|
|
return v
|
|
|
|
|
}
|
|
|
|
|
deref := v.Elem()
|
|
|
|
|
derefT := deref.Type()
|
|
|
|
|
if isStructTypeConvertibleToMap(derefT, true, tagName) {
|
|
|
|
|
return deref
|
|
|
|
|
}
|
|
|
|
|
return v
|
|
|
|
|
}
|
|
|
|
|