ucan/pkg/policy/literal/literal.go

// Package literal holds a collection of functions to create IPLD types to use in policies, selector and args.
package literal

import (
	"fmt"
	"reflect"
	"sort"

	"github.com/ipfs/go-cid"
	"github.com/ipld/go-ipld-prime"
	"github.com/ipld/go-ipld-prime/datamodel"
	"github.com/ipld/go-ipld-prime/fluent/qp"
	cidlink "github.com/ipld/go-ipld-prime/linking/cid"
	"github.com/ipld/go-ipld-prime/node/basicnode"

	"github.com/ucan-wg/go-ucan/pkg/policy/limits"
)

var Bool = basicnode.NewBool
var Int = basicnode.NewInt
var Float = basicnode.NewFloat
var String = basicnode.NewString
var Bytes = basicnode.NewBytes
var Link = basicnode.NewLink

func LinkCid(cid cid.Cid) ipld.Node {
	return Link(cidlink.Link{Cid: cid})
}

func Null() ipld.Node {
	nb := basicnode.Prototype.Any.NewBuilder()
	nb.AssignNull()
	return nb.Build()
}

// Map creates an IPLD node from a map[string]any
func Map[T any](m map[string]T) (ipld.Node, error) {
	return qp.BuildMap(basicnode.Prototype.Any, int64(len(m)), func(ma datamodel.MapAssembler) {
		// deterministic iteration
		keys := make([]string, 0, len(m))
		for key := range m {
			keys = append(keys, key)
		}
		sort.Strings(keys)
		for _, key := range keys {
			qp.MapEntry(ma, key, anyAssemble(m[key]))
		}
	})
}

// List creates an IPLD node from a []any
func List[T any](l []T) (ipld.Node, error) {
	return qp.BuildList(basicnode.Prototype.Any, int64(len(l)), func(la datamodel.ListAssembler) {
		for _, val := range l {
			qp.ListEntry(la, anyAssemble(val))
		}
	})
}

// Any creates an IPLD node from any value
// If possible, use another dedicated function for your type for performance.
func Any(v any) (res ipld.Node, err error) {
	// some fast path
	switch val := v.(type) {
	case bool:
		return basicnode.NewBool(val), nil
	case string:
		return basicnode.NewString(val), nil
	case int:
		i := int64(val)
		if i > limits.MaxInt53 || i < limits.MinInt53 {
			return nil, fmt.Errorf("integer value %d exceeds safe integer bounds", i)
		}
		return basicnode.NewInt(i), nil
	case int8:
		return basicnode.NewInt(int64(val)), nil
	case int16:
		return basicnode.NewInt(int64(val)), nil
	case int32:
		return basicnode.NewInt(int64(val)), nil
	case int64:
		if val > limits.MaxInt53 || val < limits.MinInt53 {
			return nil, fmt.Errorf("integer value %d exceeds safe integer bounds", val)
		}
		return basicnode.NewInt(val), nil
	case uint:
		return basicnode.NewInt(int64(val)), nil
	case uint8:
		return basicnode.NewInt(int64(val)), nil
	case uint16:
		return basicnode.NewInt(int64(val)), nil
	case uint32:
		return basicnode.NewInt(int64(val)), nil
	case uint64:
		if val > uint64(limits.MaxInt53) {
			return nil, fmt.Errorf("unsigned integer value %d exceeds safe integer bounds", val)
		}
		return basicnode.NewInt(int64(val)), nil
	case float32:
		return basicnode.NewFloat(float64(val)), nil
	case float64:
		return basicnode.NewFloat(val), nil
	case []byte:
		return basicnode.NewBytes(val), nil
	case datamodel.Node:
		return val, nil
	case cid.Cid:
		return LinkCid(val), nil
	default:
	}

	builder := basicnode.Prototype__Any{}.NewBuilder()

	defer func() {
		if r := recover(); r != nil {
			err = fmt.Errorf("%v", r)
			res = nil
		}
	}()

	anyAssemble(v)(builder)

	return builder.Build(), nil
}

func anyAssemble(val any) qp.Assemble {
	var rt reflect.Type
	var rv reflect.Value

	// support for recursive calls, staying in reflection land
	if cast, ok := val.(reflect.Value); ok {
		rt = cast.Type()
		rv = cast
	} else {
		rt = reflect.TypeOf(val)
		rv = reflect.ValueOf(val)
	}

	// we need to dereference in some cases, to get the real value type
	if rt.Kind() == reflect.Ptr || rt.Kind() == reflect.Interface {
		rv = rv.Elem()
		rt = rv.Type()
	}

	switch rt.Kind() {
	case reflect.Array:
		if rt.Elem().Kind() == reflect.Uint8 {
			panic("bytes array are not supported yet")
		}
		return qp.List(int64(rv.Len()), func(la datamodel.ListAssembler) {
			for i := range rv.Len() {
				qp.ListEntry(la, anyAssemble(rv.Index(i)))
			}
		})
	case reflect.Slice:
		if rt.Elem().Kind() == reflect.Uint8 {
			return qp.Bytes(val.([]byte))
		}
		return qp.List(int64(rv.Len()), func(la datamodel.ListAssembler) {
			for i := range rv.Len() {
				qp.ListEntry(la, anyAssemble(rv.Index(i)))
			}
		})
	case reflect.Map:
		if rt.Key().Kind() != reflect.String {
			break
		}
		// deterministic iteration
		keys := rv.MapKeys()
		sort.Slice(keys, func(i, j int) bool {
			return keys[i].String() < keys[j].String()
		})
		return qp.Map(int64(rv.Len()), func(ma datamodel.MapAssembler) {
			for _, key := range keys {
				qp.MapEntry(ma, key.String(), anyAssemble(rv.MapIndex(key)))
			}
		})
	case reflect.Bool:
		return qp.Bool(rv.Bool())
	case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:
		i := rv.Int()
		if i > limits.MaxInt53 || i < limits.MinInt53 {
			panic(fmt.Sprintf("integer %d exceeds safe bounds", i))
		}
		return qp.Int(i)
	case reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64:
		u := rv.Uint()
		if u > limits.MaxInt53 {
			panic(fmt.Sprintf("unsigned integer %d exceeds safe bounds", u))
		}
		return qp.Int(int64(u))
	case reflect.Float32, reflect.Float64:
		return qp.Float(rv.Float())
	case reflect.String:
		return qp.String(rv.String())
	case reflect.Struct:
		if rt == reflect.TypeOf(cid.Cid{}) {
			c := rv.Interface().(cid.Cid)
			return qp.Link(cidlink.Link{Cid: c})
		}
	default:
	}

	panic(fmt.Sprintf("unsupported type %T", val))
}