mirror of
https://github.com/kubernetes-sigs/descheduler.git
synced 2026-01-26 13:29:11 +01:00
384 lines
10 KiB
Go
384 lines
10 KiB
Go
// Copyright 2014 Google Inc. All Rights Reserved.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
package datastore
|
|
|
|
import (
|
|
"fmt"
|
|
"reflect"
|
|
"strings"
|
|
"time"
|
|
|
|
pb "google.golang.org/genproto/googleapis/datastore/v1"
|
|
)
|
|
|
|
var (
|
|
typeOfByteSlice = reflect.TypeOf([]byte(nil))
|
|
typeOfTime = reflect.TypeOf(time.Time{})
|
|
typeOfGeoPoint = reflect.TypeOf(GeoPoint{})
|
|
typeOfKeyPtr = reflect.TypeOf(&Key{})
|
|
typeOfEntityPtr = reflect.TypeOf(&Entity{})
|
|
)
|
|
|
|
// typeMismatchReason returns a string explaining why the property p could not
|
|
// be stored in an entity field of type v.Type().
|
|
func typeMismatchReason(p Property, v reflect.Value) string {
|
|
entityType := "empty"
|
|
switch p.Value.(type) {
|
|
case int64:
|
|
entityType = "int"
|
|
case bool:
|
|
entityType = "bool"
|
|
case string:
|
|
entityType = "string"
|
|
case float64:
|
|
entityType = "float"
|
|
case *Key:
|
|
entityType = "*datastore.Key"
|
|
case GeoPoint:
|
|
entityType = "GeoPoint"
|
|
case time.Time:
|
|
entityType = "time.Time"
|
|
case []byte:
|
|
entityType = "[]byte"
|
|
}
|
|
|
|
return fmt.Sprintf("type mismatch: %s versus %v", entityType, v.Type())
|
|
}
|
|
|
|
type propertyLoader struct {
|
|
// m holds the number of times a substruct field like "Foo.Bar.Baz" has
|
|
// been seen so far. The map is constructed lazily.
|
|
m map[string]int
|
|
}
|
|
|
|
func (l *propertyLoader) load(codec *structCodec, structValue reflect.Value, p Property, prev map[string]struct{}) string {
|
|
sl, ok := p.Value.([]interface{})
|
|
if !ok {
|
|
return l.loadOneElement(codec, structValue, p, prev)
|
|
}
|
|
for _, val := range sl {
|
|
p.Value = val
|
|
if errStr := l.loadOneElement(codec, structValue, p, prev); errStr != "" {
|
|
return errStr
|
|
}
|
|
}
|
|
return ""
|
|
}
|
|
|
|
// loadOneElement loads the value of Property p into structValue based on the provided
|
|
// codec. codec is used to find the field in structValue into which p should be loaded.
|
|
// prev is the set of property names already seen for structValue.
|
|
func (l *propertyLoader) loadOneElement(codec *structCodec, structValue reflect.Value, p Property, prev map[string]struct{}) string {
|
|
var sliceOk bool
|
|
var sliceIndex int
|
|
var v reflect.Value
|
|
|
|
name := p.Name
|
|
for name != "" {
|
|
// First we try to find a field with name matching
|
|
// the value of 'name' exactly.
|
|
decoder, ok := codec.fields[name]
|
|
if ok {
|
|
name = ""
|
|
} else {
|
|
// Now try for legacy flattened nested field (named eg. "A.B.C.D").
|
|
|
|
parent := name
|
|
child := ""
|
|
|
|
// Cut off the last field (delimited by ".") and find its parent
|
|
// in the codec.
|
|
// eg. for name "A.B.C.D", split off "A.B.C" and try to
|
|
// find a field in the codec with this name.
|
|
// Loop again with "A.B", etc.
|
|
for !ok {
|
|
i := strings.LastIndex(parent, ".")
|
|
if i < 0 {
|
|
return "no such struct field"
|
|
}
|
|
if i == len(name)-1 {
|
|
return "field name cannot end with '.'"
|
|
}
|
|
parent, child = name[:i], name[i+1:]
|
|
decoder, ok = codec.fields[parent]
|
|
}
|
|
|
|
name = child
|
|
}
|
|
|
|
v = initField(structValue, decoder.path)
|
|
if !v.IsValid() {
|
|
return "no such struct field"
|
|
}
|
|
if !v.CanSet() {
|
|
return "cannot set struct field"
|
|
}
|
|
|
|
if decoder.structCodec != nil {
|
|
codec = decoder.structCodec
|
|
structValue = v
|
|
}
|
|
|
|
// If the element is a slice, we need to accommodate it.
|
|
if v.Kind() == reflect.Slice {
|
|
if l.m == nil {
|
|
l.m = make(map[string]int)
|
|
}
|
|
sliceIndex = l.m[p.Name]
|
|
l.m[p.Name] = sliceIndex + 1
|
|
for v.Len() <= sliceIndex {
|
|
v.Set(reflect.Append(v, reflect.New(v.Type().Elem()).Elem()))
|
|
}
|
|
structValue = v.Index(sliceIndex)
|
|
sliceOk = true
|
|
}
|
|
}
|
|
|
|
var slice reflect.Value
|
|
if v.Kind() == reflect.Slice && v.Type().Elem().Kind() != reflect.Uint8 {
|
|
slice = v
|
|
v = reflect.New(v.Type().Elem()).Elem()
|
|
} else if _, ok := prev[p.Name]; ok && !sliceOk {
|
|
// Zero the field back out that was set previously, turns out
|
|
// it's a slice and we don't know what to do with it
|
|
v.Set(reflect.Zero(v.Type()))
|
|
return "multiple-valued property requires a slice field type"
|
|
}
|
|
|
|
prev[p.Name] = struct{}{}
|
|
|
|
if errReason := setVal(v, p); errReason != "" {
|
|
// Set the slice back to its zero value.
|
|
if slice.IsValid() {
|
|
slice.Set(reflect.Zero(slice.Type()))
|
|
}
|
|
return errReason
|
|
}
|
|
|
|
if slice.IsValid() {
|
|
slice.Index(sliceIndex).Set(v)
|
|
}
|
|
|
|
return ""
|
|
}
|
|
|
|
// setVal sets 'v' to the value of the Property 'p'.
|
|
func setVal(v reflect.Value, p Property) string {
|
|
pValue := p.Value
|
|
switch v.Kind() {
|
|
case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:
|
|
x, ok := pValue.(int64)
|
|
if !ok && pValue != nil {
|
|
return typeMismatchReason(p, v)
|
|
}
|
|
if v.OverflowInt(x) {
|
|
return fmt.Sprintf("value %v overflows struct field of type %v", x, v.Type())
|
|
}
|
|
v.SetInt(x)
|
|
case reflect.Bool:
|
|
x, ok := pValue.(bool)
|
|
if !ok && pValue != nil {
|
|
return typeMismatchReason(p, v)
|
|
}
|
|
v.SetBool(x)
|
|
case reflect.String:
|
|
x, ok := pValue.(string)
|
|
if !ok && pValue != nil {
|
|
return typeMismatchReason(p, v)
|
|
}
|
|
v.SetString(x)
|
|
case reflect.Float32, reflect.Float64:
|
|
x, ok := pValue.(float64)
|
|
if !ok && pValue != nil {
|
|
return typeMismatchReason(p, v)
|
|
}
|
|
if v.OverflowFloat(x) {
|
|
return fmt.Sprintf("value %v overflows struct field of type %v", x, v.Type())
|
|
}
|
|
v.SetFloat(x)
|
|
case reflect.Ptr:
|
|
x, ok := pValue.(*Key)
|
|
if !ok && pValue != nil {
|
|
return typeMismatchReason(p, v)
|
|
}
|
|
if _, ok := v.Interface().(*Key); !ok {
|
|
return typeMismatchReason(p, v)
|
|
}
|
|
v.Set(reflect.ValueOf(x))
|
|
case reflect.Struct:
|
|
switch v.Type() {
|
|
case typeOfTime:
|
|
x, ok := pValue.(time.Time)
|
|
if !ok && pValue != nil {
|
|
return typeMismatchReason(p, v)
|
|
}
|
|
v.Set(reflect.ValueOf(x))
|
|
case typeOfGeoPoint:
|
|
x, ok := pValue.(GeoPoint)
|
|
if !ok && pValue != nil {
|
|
return typeMismatchReason(p, v)
|
|
}
|
|
v.Set(reflect.ValueOf(x))
|
|
default:
|
|
ent, ok := pValue.(*Entity)
|
|
if !ok {
|
|
return typeMismatchReason(p, v)
|
|
}
|
|
|
|
// Recursively load nested struct
|
|
pls, err := newStructPLS(v.Addr().Interface())
|
|
if err != nil {
|
|
return err.Error()
|
|
}
|
|
|
|
// if ent has a Key value and our struct has a Key field,
|
|
// load the Entity's Key value into the Key field on the struct.
|
|
if ent.Key != nil && pls.codec.keyField != -1 {
|
|
pls.v.Field(pls.codec.keyField).Set(reflect.ValueOf(ent.Key))
|
|
}
|
|
|
|
err = pls.Load(ent.Properties)
|
|
if err != nil {
|
|
return err.Error()
|
|
}
|
|
}
|
|
case reflect.Slice:
|
|
x, ok := pValue.([]byte)
|
|
if !ok && pValue != nil {
|
|
return typeMismatchReason(p, v)
|
|
}
|
|
if v.Type().Elem().Kind() != reflect.Uint8 {
|
|
return typeMismatchReason(p, v)
|
|
}
|
|
v.SetBytes(x)
|
|
default:
|
|
return typeMismatchReason(p, v)
|
|
}
|
|
return ""
|
|
}
|
|
|
|
// initField is similar to reflect's Value.FieldByIndex, in that it
|
|
// returns the nested struct field corresponding to index, but it
|
|
// initialises any nil pointers encountered when traversing the structure.
|
|
func initField(val reflect.Value, index []int) reflect.Value {
|
|
for _, i := range index[:len(index)-1] {
|
|
val = val.Field(i)
|
|
if val.Kind() == reflect.Ptr {
|
|
if val.IsNil() {
|
|
val.Set(reflect.New(val.Type().Elem()))
|
|
}
|
|
val = val.Elem()
|
|
}
|
|
}
|
|
return val.Field(index[len(index)-1])
|
|
}
|
|
|
|
// loadEntity loads an EntityProto into PropertyLoadSaver or struct pointer.
|
|
func loadEntity(dst interface{}, src *pb.Entity) (err error) {
|
|
ent, err := protoToEntity(src)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
if e, ok := dst.(PropertyLoadSaver); ok {
|
|
return e.Load(ent.Properties)
|
|
}
|
|
return LoadStruct(dst, ent.Properties)
|
|
}
|
|
|
|
func (s structPLS) Load(props []Property) error {
|
|
var fieldName, errReason string
|
|
var l propertyLoader
|
|
|
|
prev := make(map[string]struct{})
|
|
for _, p := range props {
|
|
if errStr := l.load(s.codec, s.v, p, prev); errStr != "" {
|
|
// We don't return early, as we try to load as many properties as possible.
|
|
// It is valid to load an entity into a struct that cannot fully represent it.
|
|
// That case returns an error, but the caller is free to ignore it.
|
|
fieldName, errReason = p.Name, errStr
|
|
}
|
|
}
|
|
if errReason != "" {
|
|
return &ErrFieldMismatch{
|
|
StructType: s.v.Type(),
|
|
FieldName: fieldName,
|
|
Reason: errReason,
|
|
}
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func protoToEntity(src *pb.Entity) (*Entity, error) {
|
|
props := make([]Property, 0, len(src.Properties))
|
|
for name, val := range src.Properties {
|
|
v, err := propToValue(val)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
props = append(props, Property{
|
|
Name: name,
|
|
Value: v,
|
|
NoIndex: val.ExcludeFromIndexes,
|
|
})
|
|
}
|
|
var key *Key
|
|
if src.Key != nil {
|
|
// Ignore any error, since nested entity values
|
|
// are allowed to have an invalid key.
|
|
key, _ = protoToKey(src.Key)
|
|
}
|
|
|
|
return &Entity{key, props}, nil
|
|
}
|
|
|
|
// propToValue returns a Go value that represents the PropertyValue. For
|
|
// example, a TimestampValue becomes a time.Time.
|
|
func propToValue(v *pb.Value) (interface{}, error) {
|
|
switch v := v.ValueType.(type) {
|
|
case *pb.Value_NullValue:
|
|
return nil, nil
|
|
case *pb.Value_BooleanValue:
|
|
return v.BooleanValue, nil
|
|
case *pb.Value_IntegerValue:
|
|
return v.IntegerValue, nil
|
|
case *pb.Value_DoubleValue:
|
|
return v.DoubleValue, nil
|
|
case *pb.Value_TimestampValue:
|
|
return time.Unix(v.TimestampValue.Seconds, int64(v.TimestampValue.Nanos)), nil
|
|
case *pb.Value_KeyValue:
|
|
return protoToKey(v.KeyValue)
|
|
case *pb.Value_StringValue:
|
|
return v.StringValue, nil
|
|
case *pb.Value_BlobValue:
|
|
return []byte(v.BlobValue), nil
|
|
case *pb.Value_GeoPointValue:
|
|
return GeoPoint{Lat: v.GeoPointValue.Latitude, Lng: v.GeoPointValue.Longitude}, nil
|
|
case *pb.Value_EntityValue:
|
|
return protoToEntity(v.EntityValue)
|
|
case *pb.Value_ArrayValue:
|
|
arr := make([]interface{}, 0, len(v.ArrayValue.Values))
|
|
for _, v := range v.ArrayValue.Values {
|
|
vv, err := propToValue(v)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
arr = append(arr, vv)
|
|
}
|
|
return arr, nil
|
|
default:
|
|
return nil, nil
|
|
}
|
|
}
|