Source file src/reflect/value.go

     1  // Copyright 2009 The Go Authors. All rights reserved.
     2  // Use of this source code is governed by a BSD-style
     3  // license that can be found in the LICENSE file.
     4  
     5  package reflect
     6  
     7  import (
     8  	"errors"
     9  	"internal/abi"
    10  	"internal/goarch"
    11  	"internal/strconv"
    12  	"internal/unsafeheader"
    13  	"iter"
    14  	"math"
    15  	"runtime"
    16  	"unsafe"
    17  )
    18  
    19  // Value is the reflection interface to a Go value.
    20  //
    21  // Not all methods apply to all kinds of values. Restrictions,
    22  // if any, are noted in the documentation for each method.
    23  // Use the Kind method to find out the kind of value before
    24  // calling kind-specific methods. Calling a method
    25  // inappropriate to the kind of type causes a run time panic.
    26  //
    27  // The zero Value represents no value.
    28  // Its [Value.IsValid] method returns false, its Kind method returns [Invalid],
    29  // its String method returns "<invalid Value>", and all other methods panic.
    30  // Most functions and methods never return an invalid value.
    31  // If one does, its documentation states the conditions explicitly.
    32  //
    33  // A Value can be used concurrently by multiple goroutines provided that
    34  // the underlying Go value can be used concurrently for the equivalent
    35  // direct operations.
    36  //
    37  // To compare two Values, compare the results of the Interface method.
    38  // Using == on two Values does not compare the underlying values
    39  // they represent.
    40  type Value struct {
    41  	// typ_ holds the type of the value represented by a Value.
    42  	// Access using the typ method to avoid escape of v.
    43  	typ_ *abi.Type
    44  
    45  	// Pointer-valued data or, if flagIndir is set, pointer to data.
    46  	// Valid when either flagIndir is set or typ.pointers() is true.
    47  	ptr unsafe.Pointer
    48  
    49  	// flag holds metadata about the value.
    50  	//
    51  	// The lowest five bits give the Kind of the value, mirroring typ.Kind().
    52  	//
    53  	// The next set of bits are flag bits:
    54  	//	- flagStickyRO: obtained via unexported not embedded field, so read-only
    55  	//	- flagEmbedRO: obtained via unexported embedded field, so read-only
    56  	//	- flagIndir: val holds a pointer to the data
    57  	//	- flagAddr: v.CanAddr is true (implies flagIndir and ptr is non-nil)
    58  	//	- flagMethod: v is a method value.
    59  	// If !typ.IsDirectIface(), code can assume that flagIndir is set.
    60  	//
    61  	// The remaining 22+ bits give a method number for method values.
    62  	// If flag.kind() != Func, code can assume that flagMethod is unset.
    63  	flag
    64  
    65  	// A method value represents a curried method invocation
    66  	// like r.Read for some receiver r. The typ+val+flag bits describe
    67  	// the receiver r, but the flag's Kind bits say Func (methods are
    68  	// functions), and the top bits of the flag give the method number
    69  	// in r's type's method table.
    70  }
    71  
    72  type flag uintptr
    73  
    74  const (
    75  	flagKindWidth        = 5 // there are 27 kinds
    76  	flagKindMask    flag = 1<<flagKindWidth - 1
    77  	flagStickyRO    flag = 1 << 5
    78  	flagEmbedRO     flag = 1 << 6
    79  	flagIndir       flag = 1 << 7
    80  	flagAddr        flag = 1 << 8
    81  	flagMethod      flag = 1 << 9
    82  	flagMethodShift      = 10
    83  	flagRO          flag = flagStickyRO | flagEmbedRO
    84  )
    85  
    86  func (f flag) kind() Kind {
    87  	return Kind(f & flagKindMask)
    88  }
    89  
    90  func (f flag) ro() flag {
    91  	if f&flagRO != 0 {
    92  		return flagStickyRO
    93  	}
    94  	return 0
    95  }
    96  
    97  // typ returns the *abi.Type stored in the Value. This method is fast,
    98  // but it doesn't always return the correct type for the Value.
    99  // See abiType and Type, which do return the correct type.
   100  func (v Value) typ() *abi.Type {
   101  	// Types are either static (for compiler-created types) or
   102  	// heap-allocated but always reachable (for reflection-created
   103  	// types, held in the central map). So there is no need to
   104  	// escape types. noescape here help avoid unnecessary escape
   105  	// of v.
   106  	return (*abi.Type)(abi.NoEscape(unsafe.Pointer(v.typ_)))
   107  }
   108  
   109  // pointer returns the underlying pointer represented by v.
   110  // v.Kind() must be Pointer, Map, Chan, Func, or UnsafePointer
   111  // if v.Kind() == Pointer, the base type must not be not-in-heap.
   112  func (v Value) pointer() unsafe.Pointer {
   113  	if v.typ().Size() != goarch.PtrSize || !v.typ().Pointers() {
   114  		panic("can't call pointer on a non-pointer Value")
   115  	}
   116  	if v.flag&flagIndir != 0 {
   117  		return *(*unsafe.Pointer)(v.ptr)
   118  	}
   119  	return v.ptr
   120  }
   121  
   122  // packEface converts v to the empty interface.
   123  func packEface(v Value) any {
   124  	return *(*any)(unsafe.Pointer(&abi.EmptyInterface{
   125  		Type: v.typ(),
   126  		Data: packEfaceData(v),
   127  	}))
   128  }
   129  
   130  // packEfaceData is a helper that packs the Data part of an interface,
   131  // if v were to be stored in an interface.
   132  func packEfaceData(v Value) unsafe.Pointer {
   133  	t := v.typ()
   134  	switch {
   135  	case !t.IsDirectIface():
   136  		if v.flag&flagIndir == 0 {
   137  			panic("bad indir")
   138  		}
   139  		// Value is indirect, and so is the interface we're making.
   140  		ptr := v.ptr
   141  		if v.flag&flagAddr != 0 {
   142  			c := unsafe_New(t)
   143  			typedmemmove(t, c, ptr)
   144  			ptr = c
   145  		}
   146  		return ptr
   147  	case v.flag&flagIndir != 0:
   148  		// Value is indirect, but interface is direct. We need
   149  		// to load the data at v.ptr into the interface data word.
   150  		return *(*unsafe.Pointer)(v.ptr)
   151  	default:
   152  		// Value is direct, and so is the interface.
   153  		return v.ptr
   154  	}
   155  }
   156  
   157  // unpackEface converts the empty interface i to a Value.
   158  func unpackEface(i any) Value {
   159  	e := (*abi.EmptyInterface)(unsafe.Pointer(&i))
   160  	t := e.Type
   161  	if t == nil {
   162  		return Value{}
   163  	}
   164  	f := flag(t.Kind())
   165  	if !t.IsDirectIface() {
   166  		f |= flagIndir
   167  	}
   168  	return Value{t, e.Data, f}
   169  }
   170  
   171  // A ValueError occurs when a Value method is invoked on
   172  // a [Value] that does not support it. Such cases are documented
   173  // in the description of each method.
   174  type ValueError struct {
   175  	Method string
   176  	Kind   Kind
   177  }
   178  
   179  func (e *ValueError) Error() string {
   180  	if e.Kind == 0 {
   181  		return "reflect: call of " + e.Method + " on zero Value"
   182  	}
   183  	return "reflect: call of " + e.Method + " on " + e.Kind.String() + " Value"
   184  }
   185  
   186  // valueMethodName returns the name of the exported calling method on Value.
   187  func valueMethodName() string {
   188  	var pc [5]uintptr
   189  	n := runtime.Callers(1, pc[:])
   190  	frames := runtime.CallersFrames(pc[:n])
   191  	var frame runtime.Frame
   192  	for more := true; more; {
   193  		const prefix = "reflect.Value."
   194  		frame, more = frames.Next()
   195  		name := frame.Function
   196  		if len(name) > len(prefix) && name[:len(prefix)] == prefix {
   197  			methodName := name[len(prefix):]
   198  			if len(methodName) > 0 && 'A' <= methodName[0] && methodName[0] <= 'Z' {
   199  				return name
   200  			}
   201  		}
   202  	}
   203  	return "unknown method"
   204  }
   205  
   206  // nonEmptyInterface is the header for an interface value with methods.
   207  type nonEmptyInterface struct {
   208  	itab *abi.ITab
   209  	word unsafe.Pointer
   210  }
   211  
   212  // mustBe panics if f's kind is not expected.
   213  // Making this a method on flag instead of on Value
   214  // (and embedding flag in Value) means that we can write
   215  // the very clear v.mustBe(Bool) and have it compile into
   216  // v.flag.mustBe(Bool), which will only bother to copy the
   217  // single important word for the receiver.
   218  func (f flag) mustBe(expected Kind) {
   219  	// TODO(mvdan): use f.kind() again once mid-stack inlining gets better
   220  	if Kind(f&flagKindMask) != expected {
   221  		panic(&ValueError{valueMethodName(), f.kind()})
   222  	}
   223  }
   224  
   225  // mustBeExported panics if f records that the value was obtained using
   226  // an unexported field.
   227  func (f flag) mustBeExported() {
   228  	if f == 0 || f&flagRO != 0 {
   229  		f.mustBeExportedSlow()
   230  	}
   231  }
   232  
   233  func (f flag) mustBeExportedSlow() {
   234  	if f == 0 {
   235  		panic(&ValueError{valueMethodName(), Invalid})
   236  	}
   237  	if f&flagRO != 0 {
   238  		panic("reflect: " + valueMethodName() + " using value obtained using unexported field")
   239  	}
   240  }
   241  
   242  // mustBeAssignable panics if f records that the value is not assignable,
   243  // which is to say that either it was obtained using an unexported field
   244  // or it is not addressable.
   245  func (f flag) mustBeAssignable() {
   246  	if f&flagRO != 0 || f&flagAddr == 0 {
   247  		f.mustBeAssignableSlow()
   248  	}
   249  }
   250  
   251  func (f flag) mustBeAssignableSlow() {
   252  	if f == 0 {
   253  		panic(&ValueError{valueMethodName(), Invalid})
   254  	}
   255  	// Assignable if addressable and not read-only.
   256  	if f&flagRO != 0 {
   257  		panic("reflect: " + valueMethodName() + " using value obtained using unexported field")
   258  	}
   259  	if f&flagAddr == 0 {
   260  		panic("reflect: " + valueMethodName() + " using unaddressable value")
   261  	}
   262  }
   263  
   264  // Addr returns a pointer value representing the address of v.
   265  // It panics if [Value.CanAddr] returns false.
   266  // Addr is typically used to obtain a pointer to a struct field
   267  // or slice element in order to call a method that requires a
   268  // pointer receiver.
   269  func (v Value) Addr() Value {
   270  	if v.flag&flagAddr == 0 {
   271  		panic("reflect.Value.Addr of unaddressable value")
   272  	}
   273  	// Preserve flagRO instead of using v.flag.ro() so that
   274  	// v.Addr().Elem() is equivalent to v (#32772)
   275  	fl := v.flag & flagRO
   276  	return Value{ptrTo(v.typ()), v.ptr, fl | flag(Pointer)}
   277  }
   278  
   279  // Bool returns v's underlying value.
   280  // It panics if v's kind is not [Bool].
   281  func (v Value) Bool() bool {
   282  	// panicNotBool is split out to keep Bool inlineable.
   283  	if v.kind() != Bool {
   284  		v.panicNotBool()
   285  	}
   286  	return *(*bool)(v.ptr)
   287  }
   288  
   289  func (v Value) panicNotBool() {
   290  	v.mustBe(Bool)
   291  }
   292  
   293  var bytesType = rtypeOf(([]byte)(nil))
   294  
   295  // Bytes returns v's underlying value.
   296  // It panics if v's underlying value is not a slice of bytes or
   297  // an addressable array of bytes.
   298  func (v Value) Bytes() []byte {
   299  	// bytesSlow is split out to keep Bytes inlineable for unnamed []byte.
   300  	if v.typ_ == bytesType { // ok to use v.typ_ directly as comparison doesn't cause escape
   301  		return *(*[]byte)(v.ptr)
   302  	}
   303  	return v.bytesSlow()
   304  }
   305  
   306  func (v Value) bytesSlow() []byte {
   307  	switch v.kind() {
   308  	case Slice:
   309  		if v.typ().Elem().Kind() != abi.Uint8 {
   310  			panic("reflect.Value.Bytes of non-byte slice")
   311  		}
   312  		// Slice is always bigger than a word; assume flagIndir.
   313  		return *(*[]byte)(v.ptr)
   314  	case Array:
   315  		if v.typ().Elem().Kind() != abi.Uint8 {
   316  			panic("reflect.Value.Bytes of non-byte array")
   317  		}
   318  		if !v.CanAddr() {
   319  			panic("reflect.Value.Bytes of unaddressable byte array")
   320  		}
   321  		p := (*byte)(v.ptr)
   322  		n := int((*arrayType)(unsafe.Pointer(v.typ())).Len)
   323  		return unsafe.Slice(p, n)
   324  	}
   325  	panic(&ValueError{"reflect.Value.Bytes", v.kind()})
   326  }
   327  
   328  // runes returns v's underlying value.
   329  // It panics if v's underlying value is not a slice of runes (int32s).
   330  func (v Value) runes() []rune {
   331  	v.mustBe(Slice)
   332  	if v.typ().Elem().Kind() != abi.Int32 {
   333  		panic("reflect.Value.Bytes of non-rune slice")
   334  	}
   335  	// Slice is always bigger than a word; assume flagIndir.
   336  	return *(*[]rune)(v.ptr)
   337  }
   338  
   339  // CanAddr reports whether the value's address can be obtained with [Value.Addr].
   340  // Such values are called addressable. A value is addressable if it is
   341  // an element of a slice, an element of an addressable array,
   342  // a field of an addressable struct, or the result of dereferencing a pointer.
   343  // If CanAddr returns false, calling [Value.Addr] will panic.
   344  func (v Value) CanAddr() bool {
   345  	return v.flag&flagAddr != 0
   346  }
   347  
   348  // CanSet reports whether the value of v can be changed.
   349  // A [Value] can be changed only if it is addressable and was not
   350  // obtained by the use of unexported struct fields.
   351  // If CanSet returns false, calling [Value.Set] or any type-specific
   352  // setter (e.g., [Value.SetBool], [Value.SetInt]) will panic.
   353  func (v Value) CanSet() bool {
   354  	return v.flag&(flagAddr|flagRO) == flagAddr
   355  }
   356  
   357  // Call calls the function v with the input arguments in.
   358  // For example, if len(in) == 3, v.Call(in) represents the Go call v(in[0], in[1], in[2]).
   359  // Call panics if v's Kind is not [Func].
   360  // It returns the output results as Values.
   361  // As in Go, each input argument must be assignable to the
   362  // type of the function's corresponding input parameter.
   363  // If v is a variadic function, Call creates the variadic slice parameter
   364  // itself, copying in the corresponding values.
   365  // It panics if the Value was obtained by accessing unexported struct fields.
   366  func (v Value) Call(in []Value) []Value {
   367  	v.mustBe(Func)
   368  	v.mustBeExported()
   369  	return v.call("Call", in)
   370  }
   371  
   372  // CallSlice calls the variadic function v with the input arguments in,
   373  // assigning the slice in[len(in)-1] to v's final variadic argument.
   374  // For example, if len(in) == 3, v.CallSlice(in) represents the Go call v(in[0], in[1], in[2]...).
   375  // CallSlice panics if v's Kind is not [Func] or if v is not variadic.
   376  // It returns the output results as Values.
   377  // As in Go, each input argument must be assignable to the
   378  // type of the function's corresponding input parameter.
   379  // It panics if the Value was obtained by accessing unexported struct fields.
   380  func (v Value) CallSlice(in []Value) []Value {
   381  	v.mustBe(Func)
   382  	v.mustBeExported()
   383  	return v.call("CallSlice", in)
   384  }
   385  
   386  var callGC bool // for testing; see TestCallMethodJump and TestCallArgLive
   387  
   388  const debugReflectCall = false
   389  
   390  func (v Value) call(op string, in []Value) []Value {
   391  	// Get function pointer, type.
   392  	t := (*funcType)(unsafe.Pointer(v.typ()))
   393  	var (
   394  		fn       unsafe.Pointer
   395  		rcvr     Value
   396  		rcvrtype *abi.Type
   397  	)
   398  	if v.flag&flagMethod != 0 {
   399  		rcvr = v
   400  		rcvrtype, t, fn = methodReceiver(op, v, int(v.flag)>>flagMethodShift)
   401  	} else if v.flag&flagIndir != 0 {
   402  		fn = *(*unsafe.Pointer)(v.ptr)
   403  	} else {
   404  		fn = v.ptr
   405  	}
   406  
   407  	if fn == nil {
   408  		panic("reflect.Value.Call: call of nil function")
   409  	}
   410  
   411  	isSlice := op == "CallSlice"
   412  	n := t.NumIn()
   413  	isVariadic := t.IsVariadic()
   414  	if isSlice {
   415  		if !isVariadic {
   416  			panic("reflect: CallSlice of non-variadic function")
   417  		}
   418  		if len(in) < n {
   419  			panic("reflect: CallSlice with too few input arguments")
   420  		}
   421  		if len(in) > n {
   422  			panic("reflect: CallSlice with too many input arguments")
   423  		}
   424  	} else {
   425  		if isVariadic {
   426  			n--
   427  		}
   428  		if len(in) < n {
   429  			panic("reflect: Call with too few input arguments")
   430  		}
   431  		if !isVariadic && len(in) > n {
   432  			panic("reflect: Call with too many input arguments")
   433  		}
   434  	}
   435  	for _, x := range in {
   436  		if x.Kind() == Invalid {
   437  			panic("reflect: " + op + " using zero Value argument")
   438  		}
   439  	}
   440  	for i := 0; i < n; i++ {
   441  		if xt, targ := in[i].Type(), t.In(i); !xt.AssignableTo(toRType(targ)) {
   442  			panic("reflect: " + op + " using " + xt.String() + " as type " + stringFor(targ))
   443  		}
   444  	}
   445  	if !isSlice && isVariadic {
   446  		// prepare slice for remaining values
   447  		m := len(in) - n
   448  		slice := MakeSlice(toRType(t.In(n)), m, m)
   449  		elem := toRType(t.In(n)).Elem() // FIXME cast to slice type and Elem()
   450  		for i := 0; i < m; i++ {
   451  			x := in[n+i]
   452  			if xt := x.Type(); !xt.AssignableTo(elem) {
   453  				panic("reflect: cannot use " + xt.String() + " as type " + elem.String() + " in " + op)
   454  			}
   455  			slice.Index(i).Set(x)
   456  		}
   457  		origIn := in
   458  		in = make([]Value, n+1)
   459  		copy(in[:n], origIn)
   460  		in[n] = slice
   461  	}
   462  
   463  	nin := len(in)
   464  	if nin != t.NumIn() {
   465  		panic("reflect.Value.Call: wrong argument count")
   466  	}
   467  	nout := t.NumOut()
   468  
   469  	// Register argument space.
   470  	var regArgs abi.RegArgs
   471  
   472  	// Compute frame type.
   473  	frametype, framePool, abid := funcLayout(t, rcvrtype)
   474  
   475  	// Allocate a chunk of memory for frame if needed.
   476  	var stackArgs unsafe.Pointer
   477  	if frametype.Size() != 0 {
   478  		if nout == 0 {
   479  			stackArgs = framePool.Get().(unsafe.Pointer)
   480  		} else {
   481  			// Can't use pool if the function has return values.
   482  			// We will leak pointer to args in ret, so its lifetime is not scoped.
   483  			stackArgs = unsafe_New(frametype)
   484  		}
   485  	}
   486  	frameSize := frametype.Size()
   487  
   488  	if debugReflectCall {
   489  		println("reflect.call", stringFor(&t.Type))
   490  		abid.dump()
   491  	}
   492  
   493  	// Copy inputs into args.
   494  
   495  	// Handle receiver.
   496  	inStart := 0
   497  	if rcvrtype != nil {
   498  		// Guaranteed to only be one word in size,
   499  		// so it will only take up exactly 1 abiStep (either
   500  		// in a register or on the stack).
   501  		switch st := abid.call.steps[0]; st.kind {
   502  		case abiStepStack:
   503  			storeRcvr(rcvr, stackArgs)
   504  		case abiStepPointer:
   505  			storeRcvr(rcvr, unsafe.Pointer(&regArgs.Ptrs[st.ireg]))
   506  			fallthrough
   507  		case abiStepIntReg:
   508  			storeRcvr(rcvr, unsafe.Pointer(&regArgs.Ints[st.ireg]))
   509  		case abiStepFloatReg:
   510  			storeRcvr(rcvr, unsafe.Pointer(&regArgs.Floats[st.freg]))
   511  		default:
   512  			panic("unknown ABI parameter kind")
   513  		}
   514  		inStart = 1
   515  	}
   516  
   517  	// Handle arguments.
   518  	for i, v := range in {
   519  		v.mustBeExported()
   520  		targ := toRType(t.In(i))
   521  		// TODO(mknyszek): Figure out if it's possible to get some
   522  		// scratch space for this assignment check. Previously, it
   523  		// was possible to use space in the argument frame.
   524  		v = v.assignTo("reflect.Value.Call", &targ.t, nil)
   525  	stepsLoop:
   526  		for _, st := range abid.call.stepsForValue(i + inStart) {
   527  			switch st.kind {
   528  			case abiStepStack:
   529  				// Copy values to the "stack."
   530  				addr := add(stackArgs, st.stkOff, "precomputed stack arg offset")
   531  				if v.flag&flagIndir != 0 {
   532  					typedmemmove(&targ.t, addr, v.ptr)
   533  				} else {
   534  					*(*unsafe.Pointer)(addr) = v.ptr
   535  				}
   536  				// There's only one step for a stack-allocated value.
   537  				break stepsLoop
   538  			case abiStepIntReg, abiStepPointer:
   539  				// Copy values to "integer registers."
   540  				if v.flag&flagIndir != 0 {
   541  					offset := add(v.ptr, st.offset, "precomputed value offset")
   542  					if st.kind == abiStepPointer {
   543  						// Duplicate this pointer in the pointer area of the
   544  						// register space. Otherwise, there's the potential for
   545  						// this to be the last reference to v.ptr.
   546  						regArgs.Ptrs[st.ireg] = *(*unsafe.Pointer)(offset)
   547  					}
   548  					intToReg(&regArgs, st.ireg, st.size, offset)
   549  				} else {
   550  					if st.kind == abiStepPointer {
   551  						// See the comment in abiStepPointer case above.
   552  						regArgs.Ptrs[st.ireg] = v.ptr
   553  					}
   554  					regArgs.Ints[st.ireg] = uintptr(v.ptr)
   555  				}
   556  			case abiStepFloatReg:
   557  				// Copy values to "float registers."
   558  				if v.flag&flagIndir == 0 {
   559  					panic("attempted to copy pointer to FP register")
   560  				}
   561  				offset := add(v.ptr, st.offset, "precomputed value offset")
   562  				floatToReg(&regArgs, st.freg, st.size, offset)
   563  			default:
   564  				panic("unknown ABI part kind")
   565  			}
   566  		}
   567  	}
   568  	// TODO(mknyszek): Remove this when we no longer have
   569  	// caller reserved spill space.
   570  	frameSize = align(frameSize, goarch.PtrSize)
   571  	frameSize += abid.spill
   572  
   573  	// Mark pointers in registers for the return path.
   574  	regArgs.ReturnIsPtr = abid.outRegPtrs
   575  
   576  	if debugReflectCall {
   577  		regArgs.Dump()
   578  	}
   579  
   580  	// For testing; see TestCallArgLive.
   581  	if callGC {
   582  		runtime.GC()
   583  	}
   584  
   585  	// Call.
   586  	call(frametype, fn, stackArgs, uint32(frametype.Size()), uint32(abid.retOffset), uint32(frameSize), &regArgs)
   587  
   588  	// For testing; see TestCallMethodJump.
   589  	if callGC {
   590  		runtime.GC()
   591  	}
   592  
   593  	var ret []Value
   594  	if nout == 0 {
   595  		if stackArgs != nil {
   596  			typedmemclr(frametype, stackArgs)
   597  			framePool.Put(stackArgs)
   598  		}
   599  	} else {
   600  		if stackArgs != nil {
   601  			// Zero the now unused input area of args,
   602  			// because the Values returned by this function contain pointers to the args object,
   603  			// and will thus keep the args object alive indefinitely.
   604  			typedmemclrpartial(frametype, stackArgs, 0, abid.retOffset)
   605  		}
   606  
   607  		// Wrap Values around return values in args.
   608  		ret = make([]Value, nout)
   609  		for i := 0; i < nout; i++ {
   610  			tv := t.Out(i)
   611  			if tv.Size() == 0 {
   612  				// For zero-sized return value, args+off may point to the next object.
   613  				// In this case, return the zero value instead.
   614  				ret[i] = Zero(toRType(tv))
   615  				continue
   616  			}
   617  			steps := abid.ret.stepsForValue(i)
   618  			if st := steps[0]; st.kind == abiStepStack {
   619  				// This value is on the stack. If part of a value is stack
   620  				// allocated, the entire value is according to the ABI. So
   621  				// just make an indirection into the allocated frame.
   622  				fl := flagIndir | flag(tv.Kind())
   623  				ret[i] = Value{tv, add(stackArgs, st.stkOff, "tv.Size() != 0"), fl}
   624  				// Note: this does introduce false sharing between results -
   625  				// if any result is live, they are all live.
   626  				// (And the space for the args is live as well, but as we've
   627  				// cleared that space it isn't as big a deal.)
   628  				continue
   629  			}
   630  
   631  			// Handle pointers passed in registers.
   632  			if tv.IsDirectIface() {
   633  				// Pointer-valued data gets put directly
   634  				// into v.ptr.
   635  				if steps[0].kind != abiStepPointer {
   636  					print("kind=", steps[0].kind, ", type=", stringFor(tv), "\n")
   637  					panic("mismatch between ABI description and types")
   638  				}
   639  				ret[i] = Value{tv, regArgs.Ptrs[steps[0].ireg], flag(tv.Kind())}
   640  				continue
   641  			}
   642  
   643  			// All that's left is values passed in registers that we need to
   644  			// create space for and copy values back into.
   645  			//
   646  			// TODO(mknyszek): We make a new allocation for each register-allocated
   647  			// value, but previously we could always point into the heap-allocated
   648  			// stack frame. This is a regression that could be fixed by adding
   649  			// additional space to the allocated stack frame and storing the
   650  			// register-allocated return values into the allocated stack frame and
   651  			// referring there in the resulting Value.
   652  			s := unsafe_New(tv)
   653  			for _, st := range steps {
   654  				switch st.kind {
   655  				case abiStepIntReg:
   656  					offset := add(s, st.offset, "precomputed value offset")
   657  					intFromReg(&regArgs, st.ireg, st.size, offset)
   658  				case abiStepPointer:
   659  					s := add(s, st.offset, "precomputed value offset")
   660  					*((*unsafe.Pointer)(s)) = regArgs.Ptrs[st.ireg]
   661  				case abiStepFloatReg:
   662  					offset := add(s, st.offset, "precomputed value offset")
   663  					floatFromReg(&regArgs, st.freg, st.size, offset)
   664  				case abiStepStack:
   665  					panic("register-based return value has stack component")
   666  				default:
   667  					panic("unknown ABI part kind")
   668  				}
   669  			}
   670  			ret[i] = Value{tv, s, flagIndir | flag(tv.Kind())}
   671  		}
   672  	}
   673  
   674  	return ret
   675  }
   676  
   677  // callReflect is the call implementation used by a function
   678  // returned by MakeFunc. In many ways it is the opposite of the
   679  // method Value.call above. The method above converts a call using Values
   680  // into a call of a function with a concrete argument frame, while
   681  // callReflect converts a call of a function with a concrete argument
   682  // frame into a call using Values.
   683  // It is in this file so that it can be next to the call method above.
   684  // The remainder of the MakeFunc implementation is in makefunc.go.
   685  //
   686  // NOTE: This function must be marked as a "wrapper" in the generated code,
   687  // so that the linker can make it work correctly for panic and recover.
   688  // The gc compilers know to do that for the name "reflect.callReflect".
   689  //
   690  // ctxt is the "closure" generated by MakeFunc.
   691  // frame is a pointer to the arguments to that closure on the stack.
   692  // retValid points to a boolean which should be set when the results
   693  // section of frame is set.
   694  //
   695  // regs contains the argument values passed in registers and will contain
   696  // the values returned from ctxt.fn in registers.
   697  func callReflect(ctxt *makeFuncImpl, frame unsafe.Pointer, retValid *bool, regs *abi.RegArgs) {
   698  	if callGC {
   699  		// Call GC upon entry during testing.
   700  		// Getting our stack scanned here is the biggest hazard, because
   701  		// our caller (makeFuncStub) could have failed to place the last
   702  		// pointer to a value in regs' pointer space, in which case it
   703  		// won't be visible to the GC.
   704  		runtime.GC()
   705  	}
   706  	ftyp := ctxt.ftyp
   707  	f := ctxt.fn
   708  
   709  	_, _, abid := funcLayout(ftyp, nil)
   710  
   711  	// Copy arguments into Values.
   712  	ptr := frame
   713  	in := make([]Value, 0, int(ftyp.InCount))
   714  	for i, typ := range ftyp.InSlice() {
   715  		if typ.Size() == 0 {
   716  			in = append(in, Zero(toRType(typ)))
   717  			continue
   718  		}
   719  		v := Value{typ, nil, flag(typ.Kind())}
   720  		steps := abid.call.stepsForValue(i)
   721  		if st := steps[0]; st.kind == abiStepStack {
   722  			if !typ.IsDirectIface() {
   723  				// value cannot be inlined in interface data.
   724  				// Must make a copy, because f might keep a reference to it,
   725  				// and we cannot let f keep a reference to the stack frame
   726  				// after this function returns, not even a read-only reference.
   727  				v.ptr = unsafe_New(typ)
   728  				if typ.Size() > 0 {
   729  					typedmemmove(typ, v.ptr, add(ptr, st.stkOff, "typ.size > 0"))
   730  				}
   731  				v.flag |= flagIndir
   732  			} else {
   733  				v.ptr = *(*unsafe.Pointer)(add(ptr, st.stkOff, "1-ptr"))
   734  			}
   735  		} else {
   736  			if !typ.IsDirectIface() {
   737  				// All that's left is values passed in registers that we need to
   738  				// create space for the values.
   739  				v.flag |= flagIndir
   740  				v.ptr = unsafe_New(typ)
   741  				for _, st := range steps {
   742  					switch st.kind {
   743  					case abiStepIntReg:
   744  						offset := add(v.ptr, st.offset, "precomputed value offset")
   745  						intFromReg(regs, st.ireg, st.size, offset)
   746  					case abiStepPointer:
   747  						s := add(v.ptr, st.offset, "precomputed value offset")
   748  						*((*unsafe.Pointer)(s)) = regs.Ptrs[st.ireg]
   749  					case abiStepFloatReg:
   750  						offset := add(v.ptr, st.offset, "precomputed value offset")
   751  						floatFromReg(regs, st.freg, st.size, offset)
   752  					case abiStepStack:
   753  						panic("register-based return value has stack component")
   754  					default:
   755  						panic("unknown ABI part kind")
   756  					}
   757  				}
   758  			} else {
   759  				// Pointer-valued data gets put directly
   760  				// into v.ptr.
   761  				if steps[0].kind != abiStepPointer {
   762  					print("kind=", steps[0].kind, ", type=", stringFor(typ), "\n")
   763  					panic("mismatch between ABI description and types")
   764  				}
   765  				v.ptr = regs.Ptrs[steps[0].ireg]
   766  			}
   767  		}
   768  		in = append(in, v)
   769  	}
   770  
   771  	// Call underlying function.
   772  	out := f(in)
   773  	numOut := ftyp.NumOut()
   774  	if len(out) != numOut {
   775  		panic("reflect: wrong return count from function created by MakeFunc")
   776  	}
   777  
   778  	// Copy results back into argument frame and register space.
   779  	if numOut > 0 {
   780  		for i, typ := range ftyp.OutSlice() {
   781  			v := out[i]
   782  			if v.typ() == nil {
   783  				panic("reflect: function created by MakeFunc using " + funcName(f) +
   784  					" returned zero Value")
   785  			}
   786  			if v.flag&flagRO != 0 {
   787  				panic("reflect: function created by MakeFunc using " + funcName(f) +
   788  					" returned value obtained from unexported field")
   789  			}
   790  			if typ.Size() == 0 {
   791  				continue
   792  			}
   793  
   794  			// Convert v to type typ if v is assignable to a variable
   795  			// of type t in the language spec.
   796  			// See issue 28761.
   797  			//
   798  			//
   799  			// TODO(mknyszek): In the switch to the register ABI we lost
   800  			// the scratch space here for the register cases (and
   801  			// temporarily for all the cases).
   802  			//
   803  			// If/when this happens, take note of the following:
   804  			//
   805  			// We must clear the destination before calling assignTo,
   806  			// in case assignTo writes (with memory barriers) to the
   807  			// target location used as scratch space. See issue 39541.
   808  			v = v.assignTo("reflect.MakeFunc", typ, nil)
   809  		stepsLoop:
   810  			for _, st := range abid.ret.stepsForValue(i) {
   811  				switch st.kind {
   812  				case abiStepStack:
   813  					// Copy values to the "stack."
   814  					addr := add(ptr, st.stkOff, "precomputed stack arg offset")
   815  					// Do not use write barriers. The stack space used
   816  					// for this call is not adequately zeroed, and we
   817  					// are careful to keep the arguments alive until we
   818  					// return to makeFuncStub's caller.
   819  					if v.flag&flagIndir != 0 {
   820  						memmove(addr, v.ptr, st.size)
   821  					} else {
   822  						// This case must be a pointer type.
   823  						*(*uintptr)(addr) = uintptr(v.ptr)
   824  					}
   825  					// There's only one step for a stack-allocated value.
   826  					break stepsLoop
   827  				case abiStepIntReg, abiStepPointer:
   828  					// Copy values to "integer registers."
   829  					if v.flag&flagIndir != 0 {
   830  						offset := add(v.ptr, st.offset, "precomputed value offset")
   831  						intToReg(regs, st.ireg, st.size, offset)
   832  					} else {
   833  						// Only populate the Ints space on the return path.
   834  						// This is safe because out is kept alive until the
   835  						// end of this function, and the return path through
   836  						// makeFuncStub has no preemption, so these pointers
   837  						// are always visible to the GC.
   838  						regs.Ints[st.ireg] = uintptr(v.ptr)
   839  					}
   840  				case abiStepFloatReg:
   841  					// Copy values to "float registers."
   842  					if v.flag&flagIndir == 0 {
   843  						panic("attempted to copy pointer to FP register")
   844  					}
   845  					offset := add(v.ptr, st.offset, "precomputed value offset")
   846  					floatToReg(regs, st.freg, st.size, offset)
   847  				default:
   848  					panic("unknown ABI part kind")
   849  				}
   850  			}
   851  		}
   852  	}
   853  
   854  	// Announce that the return values are valid.
   855  	// After this point the runtime can depend on the return values being valid.
   856  	*retValid = true
   857  
   858  	// We have to make sure that the out slice lives at least until
   859  	// the runtime knows the return values are valid. Otherwise, the
   860  	// return values might not be scanned by anyone during a GC.
   861  	// (out would be dead, and the return slots not yet alive.)
   862  	runtime.KeepAlive(out)
   863  
   864  	// runtime.getArgInfo expects to be able to find ctxt on the
   865  	// stack when it finds our caller, makeFuncStub. Make sure it
   866  	// doesn't get garbage collected.
   867  	runtime.KeepAlive(ctxt)
   868  }
   869  
   870  // methodReceiver returns information about the receiver
   871  // described by v. The Value v may or may not have the
   872  // flagMethod bit set, so the kind cached in v.flag should
   873  // not be used.
   874  // The return value rcvrtype gives the method's actual receiver type.
   875  // The return value t gives the method type signature (without the receiver).
   876  // The return value fn is a pointer to the method code.
   877  func methodReceiver(op string, v Value, methodIndex int) (rcvrtype *abi.Type, t *funcType, fn unsafe.Pointer) {
   878  	i := methodIndex
   879  	if v.typ().Kind() == abi.Interface {
   880  		tt := (*interfaceType)(unsafe.Pointer(v.typ()))
   881  		if uint(i) >= uint(len(tt.Methods)) {
   882  			panic("reflect: internal error: invalid method index")
   883  		}
   884  		m := &tt.Methods[i]
   885  		if !tt.nameOff(m.Name).IsExported() {
   886  			panic("reflect: " + op + " of unexported method")
   887  		}
   888  		iface := (*nonEmptyInterface)(v.ptr)
   889  		if iface.itab == nil {
   890  			panic("reflect: " + op + " of method on nil interface value")
   891  		}
   892  		rcvrtype = iface.itab.Type
   893  		fn = unsafe.Pointer(&unsafe.Slice(&iface.itab.Fun[0], i+1)[i])
   894  		t = (*funcType)(unsafe.Pointer(tt.typeOff(m.Typ)))
   895  	} else {
   896  		rcvrtype = v.typ()
   897  		ms := v.typ().ExportedMethods()
   898  		if uint(i) >= uint(len(ms)) {
   899  			panic("reflect: internal error: invalid method index")
   900  		}
   901  		m := ms[i]
   902  		if !nameOffFor(v.typ(), m.Name).IsExported() {
   903  			panic("reflect: " + op + " of unexported method")
   904  		}
   905  		ifn := textOffFor(v.typ(), m.Ifn)
   906  		fn = unsafe.Pointer(&ifn)
   907  		t = (*funcType)(unsafe.Pointer(typeOffFor(v.typ(), m.Mtyp)))
   908  	}
   909  	return
   910  }
   911  
   912  // v is a method receiver. Store at p the word which is used to
   913  // encode that receiver at the start of the argument list.
   914  // Reflect uses the "interface" calling convention for
   915  // methods, which always uses one word to record the receiver.
   916  func storeRcvr(v Value, p unsafe.Pointer) {
   917  	t := v.typ()
   918  	if t.Kind() == abi.Interface {
   919  		// the interface data word becomes the receiver word
   920  		iface := (*nonEmptyInterface)(v.ptr)
   921  		*(*unsafe.Pointer)(p) = iface.word
   922  	} else if v.flag&flagIndir != 0 && t.IsDirectIface() {
   923  		*(*unsafe.Pointer)(p) = *(*unsafe.Pointer)(v.ptr)
   924  	} else {
   925  		*(*unsafe.Pointer)(p) = v.ptr
   926  	}
   927  }
   928  
   929  // align returns the result of rounding x up to a multiple of n.
   930  // n must be a power of two.
   931  func align(x, n uintptr) uintptr {
   932  	return (x + n - 1) &^ (n - 1)
   933  }
   934  
   935  // callMethod is the call implementation used by a function returned
   936  // by makeMethodValue (used by v.Method(i).Interface()).
   937  // It is a streamlined version of the usual reflect call: the caller has
   938  // already laid out the argument frame for us, so we don't have
   939  // to deal with individual Values for each argument.
   940  // It is in this file so that it can be next to the two similar functions above.
   941  // The remainder of the makeMethodValue implementation is in makefunc.go.
   942  //
   943  // NOTE: This function must be marked as a "wrapper" in the generated code,
   944  // so that the linker can make it work correctly for panic and recover.
   945  // The gc compilers know to do that for the name "reflect.callMethod".
   946  //
   947  // ctxt is the "closure" generated by makeMethodValue.
   948  // frame is a pointer to the arguments to that closure on the stack.
   949  // retValid points to a boolean which should be set when the results
   950  // section of frame is set.
   951  //
   952  // regs contains the argument values passed in registers and will contain
   953  // the values returned from ctxt.fn in registers.
   954  func callMethod(ctxt *methodValue, frame unsafe.Pointer, retValid *bool, regs *abi.RegArgs) {
   955  	rcvr := ctxt.rcvr
   956  	rcvrType, valueFuncType, methodFn := methodReceiver("call", rcvr, ctxt.method)
   957  
   958  	// There are two ABIs at play here.
   959  	//
   960  	// methodValueCall was invoked with the ABI assuming there was no
   961  	// receiver ("value ABI") and that's what frame and regs are holding.
   962  	//
   963  	// Meanwhile, we need to actually call the method with a receiver, which
   964  	// has its own ABI ("method ABI"). Everything that follows is a translation
   965  	// between the two.
   966  	_, _, valueABI := funcLayout(valueFuncType, nil)
   967  	valueFrame, valueRegs := frame, regs
   968  	methodFrameType, methodFramePool, methodABI := funcLayout(valueFuncType, rcvrType)
   969  
   970  	// Make a new frame that is one word bigger so we can store the receiver.
   971  	// This space is used for both arguments and return values.
   972  	methodFrame := methodFramePool.Get().(unsafe.Pointer)
   973  	var methodRegs abi.RegArgs
   974  
   975  	// Deal with the receiver. It's guaranteed to only be one word in size.
   976  	switch st := methodABI.call.steps[0]; st.kind {
   977  	case abiStepStack:
   978  		// Only copy the receiver to the stack if the ABI says so.
   979  		// Otherwise, it'll be in a register already.
   980  		storeRcvr(rcvr, methodFrame)
   981  	case abiStepPointer:
   982  		// Put the receiver in a register.
   983  		storeRcvr(rcvr, unsafe.Pointer(&methodRegs.Ptrs[st.ireg]))
   984  		fallthrough
   985  	case abiStepIntReg:
   986  		storeRcvr(rcvr, unsafe.Pointer(&methodRegs.Ints[st.ireg]))
   987  	case abiStepFloatReg:
   988  		storeRcvr(rcvr, unsafe.Pointer(&methodRegs.Floats[st.freg]))
   989  	default:
   990  		panic("unknown ABI parameter kind")
   991  	}
   992  
   993  	// Translate the rest of the arguments.
   994  	for i, t := range valueFuncType.InSlice() {
   995  		valueSteps := valueABI.call.stepsForValue(i)
   996  		methodSteps := methodABI.call.stepsForValue(i + 1)
   997  
   998  		// Zero-sized types are trivial: nothing to do.
   999  		if len(valueSteps) == 0 {
  1000  			if len(methodSteps) != 0 {
  1001  				panic("method ABI and value ABI do not align")
  1002  			}
  1003  			continue
  1004  		}
  1005  
  1006  		// There are four cases to handle in translating each
  1007  		// argument:
  1008  		// 1. Stack -> stack translation.
  1009  		// 2. Stack -> registers translation.
  1010  		// 3. Registers -> stack translation.
  1011  		// 4. Registers -> registers translation.
  1012  
  1013  		// If the value ABI passes the value on the stack,
  1014  		// then the method ABI does too, because it has strictly
  1015  		// fewer arguments. Simply copy between the two.
  1016  		if vStep := valueSteps[0]; vStep.kind == abiStepStack {
  1017  			mStep := methodSteps[0]
  1018  			// Handle stack -> stack translation.
  1019  			if mStep.kind == abiStepStack {
  1020  				if vStep.size != mStep.size {
  1021  					panic("method ABI and value ABI do not align")
  1022  				}
  1023  				typedmemmove(t,
  1024  					add(methodFrame, mStep.stkOff, "precomputed stack offset"),
  1025  					add(valueFrame, vStep.stkOff, "precomputed stack offset"))
  1026  				continue
  1027  			}
  1028  			// Handle stack -> register translation.
  1029  			for _, mStep := range methodSteps {
  1030  				from := add(valueFrame, vStep.stkOff+mStep.offset, "precomputed stack offset")
  1031  				switch mStep.kind {
  1032  				case abiStepPointer:
  1033  					// Do the pointer copy directly so we get a write barrier.
  1034  					methodRegs.Ptrs[mStep.ireg] = *(*unsafe.Pointer)(from)
  1035  					fallthrough // We need to make sure this ends up in Ints, too.
  1036  				case abiStepIntReg:
  1037  					intToReg(&methodRegs, mStep.ireg, mStep.size, from)
  1038  				case abiStepFloatReg:
  1039  					floatToReg(&methodRegs, mStep.freg, mStep.size, from)
  1040  				default:
  1041  					panic("unexpected method step")
  1042  				}
  1043  			}
  1044  			continue
  1045  		}
  1046  		// Handle register -> stack translation.
  1047  		if mStep := methodSteps[0]; mStep.kind == abiStepStack {
  1048  			for _, vStep := range valueSteps {
  1049  				to := add(methodFrame, mStep.stkOff+vStep.offset, "precomputed stack offset")
  1050  				switch vStep.kind {
  1051  				case abiStepPointer:
  1052  					// Do the pointer copy directly so we get a write barrier.
  1053  					*(*unsafe.Pointer)(to) = valueRegs.Ptrs[vStep.ireg]
  1054  				case abiStepIntReg:
  1055  					intFromReg(valueRegs, vStep.ireg, vStep.size, to)
  1056  				case abiStepFloatReg:
  1057  					floatFromReg(valueRegs, vStep.freg, vStep.size, to)
  1058  				default:
  1059  					panic("unexpected value step")
  1060  				}
  1061  			}
  1062  			continue
  1063  		}
  1064  		// Handle register -> register translation.
  1065  		if len(valueSteps) != len(methodSteps) {
  1066  			// Because it's the same type for the value, and it's assigned
  1067  			// to registers both times, it should always take up the same
  1068  			// number of registers for each ABI.
  1069  			panic("method ABI and value ABI don't align")
  1070  		}
  1071  		for i, vStep := range valueSteps {
  1072  			mStep := methodSteps[i]
  1073  			if mStep.kind != vStep.kind {
  1074  				panic("method ABI and value ABI don't align")
  1075  			}
  1076  			switch vStep.kind {
  1077  			case abiStepPointer:
  1078  				// Copy this too, so we get a write barrier.
  1079  				methodRegs.Ptrs[mStep.ireg] = valueRegs.Ptrs[vStep.ireg]
  1080  				fallthrough
  1081  			case abiStepIntReg:
  1082  				methodRegs.Ints[mStep.ireg] = valueRegs.Ints[vStep.ireg]
  1083  			case abiStepFloatReg:
  1084  				methodRegs.Floats[mStep.freg] = valueRegs.Floats[vStep.freg]
  1085  			default:
  1086  				panic("unexpected value step")
  1087  			}
  1088  		}
  1089  	}
  1090  
  1091  	methodFrameSize := methodFrameType.Size()
  1092  	// TODO(mknyszek): Remove this when we no longer have
  1093  	// caller reserved spill space.
  1094  	methodFrameSize = align(methodFrameSize, goarch.PtrSize)
  1095  	methodFrameSize += methodABI.spill
  1096  
  1097  	// Mark pointers in registers for the return path.
  1098  	methodRegs.ReturnIsPtr = methodABI.outRegPtrs
  1099  
  1100  	// Call.
  1101  	// Call copies the arguments from scratch to the stack, calls fn,
  1102  	// and then copies the results back into scratch.
  1103  	call(methodFrameType, methodFn, methodFrame, uint32(methodFrameType.Size()), uint32(methodABI.retOffset), uint32(methodFrameSize), &methodRegs)
  1104  
  1105  	// Copy return values.
  1106  	//
  1107  	// This is somewhat simpler because both ABIs have an identical
  1108  	// return value ABI (the types are identical). As a result, register
  1109  	// results can simply be copied over. Stack-allocated values are laid
  1110  	// out the same, but are at different offsets from the start of the frame
  1111  	// Ignore any changes to args.
  1112  	// Avoid constructing out-of-bounds pointers if there are no return values.
  1113  	// because the arguments may be laid out differently.
  1114  	if valueRegs != nil {
  1115  		*valueRegs = methodRegs
  1116  	}
  1117  	if retSize := methodFrameType.Size() - methodABI.retOffset; retSize > 0 {
  1118  		valueRet := add(valueFrame, valueABI.retOffset, "valueFrame's size > retOffset")
  1119  		methodRet := add(methodFrame, methodABI.retOffset, "methodFrame's size > retOffset")
  1120  		// This copies to the stack. Write barriers are not needed.
  1121  		memmove(valueRet, methodRet, retSize)
  1122  	}
  1123  
  1124  	// Tell the runtime it can now depend on the return values
  1125  	// being properly initialized.
  1126  	*retValid = true
  1127  
  1128  	// Clear the scratch space and put it back in the pool.
  1129  	// This must happen after the statement above, so that the return
  1130  	// values will always be scanned by someone.
  1131  	typedmemclr(methodFrameType, methodFrame)
  1132  	methodFramePool.Put(methodFrame)
  1133  
  1134  	// See the comment in callReflect.
  1135  	runtime.KeepAlive(ctxt)
  1136  
  1137  	// Keep valueRegs alive because it may hold live pointer results.
  1138  	// The caller (methodValueCall) has it as a stack object, which is only
  1139  	// scanned when there is a reference to it.
  1140  	runtime.KeepAlive(valueRegs)
  1141  }
  1142  
  1143  // funcName returns the name of f, for use in error messages.
  1144  func funcName(f func([]Value) []Value) string {
  1145  	pc := *(*uintptr)(unsafe.Pointer(&f))
  1146  	rf := runtime.FuncForPC(pc)
  1147  	if rf != nil {
  1148  		return rf.Name()
  1149  	}
  1150  	return "closure"
  1151  }
  1152  
  1153  // Cap returns v's capacity.
  1154  // It panics if v's Kind is not [Array], [Chan], [Slice] or pointer to [Array].
  1155  func (v Value) Cap() int {
  1156  	// capNonSlice is split out to keep Cap inlineable for slice kinds.
  1157  	if v.kind() == Slice {
  1158  		return (*unsafeheader.Slice)(v.ptr).Cap
  1159  	}
  1160  	return v.capNonSlice()
  1161  }
  1162  
  1163  func (v Value) capNonSlice() int {
  1164  	k := v.kind()
  1165  	switch k {
  1166  	case Array:
  1167  		return v.typ().Len()
  1168  	case Chan:
  1169  		return chancap(v.pointer())
  1170  	case Ptr:
  1171  		if v.typ().Elem().Kind() == abi.Array {
  1172  			return v.typ().Elem().Len()
  1173  		}
  1174  		panic("reflect: call of reflect.Value.Cap on ptr to non-array Value")
  1175  	}
  1176  	panic(&ValueError{"reflect.Value.Cap", v.kind()})
  1177  }
  1178  
  1179  // Close closes the channel v.
  1180  // It panics if v's Kind is not [Chan] or
  1181  // v is a receive-only channel.
  1182  func (v Value) Close() {
  1183  	v.mustBe(Chan)
  1184  	v.mustBeExported()
  1185  	tt := (*chanType)(unsafe.Pointer(v.typ()))
  1186  	if ChanDir(tt.Dir)&SendDir == 0 {
  1187  		panic("reflect: close of receive-only channel")
  1188  	}
  1189  
  1190  	chanclose(v.pointer())
  1191  }
  1192  
  1193  // CanComplex reports whether [Value.Complex] can be used without panicking.
  1194  func (v Value) CanComplex() bool {
  1195  	switch v.kind() {
  1196  	case Complex64, Complex128:
  1197  		return true
  1198  	default:
  1199  		return false
  1200  	}
  1201  }
  1202  
  1203  // Complex returns v's underlying value, as a complex128.
  1204  // It panics if v's Kind is not [Complex64] or [Complex128]
  1205  func (v Value) Complex() complex128 {
  1206  	k := v.kind()
  1207  	switch k {
  1208  	case Complex64:
  1209  		return complex128(*(*complex64)(v.ptr))
  1210  	case Complex128:
  1211  		return *(*complex128)(v.ptr)
  1212  	}
  1213  	panic(&ValueError{"reflect.Value.Complex", v.kind()})
  1214  }
  1215  
  1216  // Elem returns the value that the interface v contains
  1217  // or that the pointer v points to.
  1218  // It panics if v's Kind is not [Interface] or [Pointer].
  1219  // It returns the zero Value if v is nil.
  1220  func (v Value) Elem() Value {
  1221  	k := v.kind()
  1222  	switch k {
  1223  	case Interface:
  1224  		x := unpackEface(packIfaceValueIntoEmptyIface(v))
  1225  		if x.flag != 0 {
  1226  			x.flag |= v.flag.ro()
  1227  		}
  1228  		return x
  1229  	case Pointer:
  1230  		ptr := v.ptr
  1231  		if v.flag&flagIndir != 0 {
  1232  			if !v.typ().IsDirectIface() {
  1233  				// This is a pointer to a not-in-heap object. ptr points to a uintptr
  1234  				// in the heap. That uintptr is the address of a not-in-heap object.
  1235  				// In general, pointers to not-in-heap objects can be total junk.
  1236  				// But Elem() is asking to dereference it, so the user has asserted
  1237  				// that at least it is a valid pointer (not just an integer stored in
  1238  				// a pointer slot). So let's check, to make sure that it isn't a pointer
  1239  				// that the runtime will crash on if it sees it during GC or write barriers.
  1240  				// Since it is a not-in-heap pointer, all pointers to the heap are
  1241  				// forbidden! That makes the test pretty easy.
  1242  				// See issue 48399.
  1243  				if !verifyNotInHeapPtr(*(*uintptr)(ptr)) {
  1244  					panic("reflect: reflect.Value.Elem on an invalid notinheap pointer")
  1245  				}
  1246  			}
  1247  			ptr = *(*unsafe.Pointer)(ptr)
  1248  		}
  1249  		// The returned value's address is v's value.
  1250  		if ptr == nil {
  1251  			return Value{}
  1252  		}
  1253  		tt := (*ptrType)(unsafe.Pointer(v.typ()))
  1254  		typ := tt.Elem
  1255  		fl := v.flag&flagRO | flagIndir | flagAddr
  1256  		fl |= flag(typ.Kind())
  1257  		return Value{typ, ptr, fl}
  1258  	}
  1259  	panic(&ValueError{"reflect.Value.Elem", v.kind()})
  1260  }
  1261  
  1262  // Field returns the i'th field of the struct v.
  1263  // It panics if v's Kind is not [Struct] or i is out of range.
  1264  func (v Value) Field(i int) Value {
  1265  	if v.kind() != Struct {
  1266  		panic(&ValueError{"reflect.Value.Field", v.kind()})
  1267  	}
  1268  	tt := (*structType)(unsafe.Pointer(v.typ()))
  1269  	if uint(i) >= uint(len(tt.Fields)) {
  1270  		panic("reflect: Field index out of range")
  1271  	}
  1272  	field := &tt.Fields[i]
  1273  	typ := field.Typ
  1274  
  1275  	// Inherit permission bits from v, but clear flagEmbedRO.
  1276  	fl := v.flag&(flagStickyRO|flagIndir|flagAddr) | flag(typ.Kind())
  1277  	// Using an unexported field forces flagRO.
  1278  	if !field.Name.IsExported() {
  1279  		if field.Embedded() {
  1280  			fl |= flagEmbedRO
  1281  		} else {
  1282  			fl |= flagStickyRO
  1283  		}
  1284  	}
  1285  	if fl&flagIndir == 0 && typ.Size() == 0 {
  1286  		// Special case for picking a field out of a direct struct.
  1287  		// A direct struct must have a pointer field and possibly a
  1288  		// bunch of zero-sized fields. We must return the zero-sized
  1289  		// fields indirectly, as only ptr-shaped things can be direct.
  1290  		// See issue 74935.
  1291  		// We use &zeroVal[0] instead of v.ptr as it doesn't matter and
  1292  		// we can avoid pinning a possibly now-unused object.
  1293  		// Don't use nil, see issue 77779.
  1294  		return Value{typ, unsafe.Pointer(&zeroVal[0]), fl | flagIndir}
  1295  	}
  1296  
  1297  	// Either flagIndir is set and v.ptr points at struct,
  1298  	// or flagIndir is not set and v.ptr is the actual struct data.
  1299  	// In the former case, we want v.ptr + offset.
  1300  	// In the latter case, we must have field.offset = 0,
  1301  	// so v.ptr + field.offset is still the correct address.
  1302  	ptr := add(v.ptr, field.Offset, "same as non-reflect &v.field")
  1303  	return Value{typ, ptr, fl}
  1304  }
  1305  
  1306  // FieldByIndex returns the nested field corresponding to index.
  1307  // It panics if evaluation requires stepping through a nil
  1308  // pointer or a field that is not a struct.
  1309  func (v Value) FieldByIndex(index []int) Value {
  1310  	if len(index) == 1 {
  1311  		return v.Field(index[0])
  1312  	}
  1313  	v.mustBe(Struct)
  1314  	for i, x := range index {
  1315  		if i > 0 {
  1316  			if v.Kind() == Pointer && v.typ().Elem().Kind() == abi.Struct {
  1317  				if v.IsNil() {
  1318  					panic("reflect: indirection through nil pointer to embedded struct")
  1319  				}
  1320  				v = v.Elem()
  1321  			}
  1322  		}
  1323  		v = v.Field(x)
  1324  	}
  1325  	return v
  1326  }
  1327  
  1328  // FieldByIndexErr returns the nested field corresponding to index.
  1329  // It returns an error if evaluation requires stepping through a nil
  1330  // pointer, but panics if it must step through a field that
  1331  // is not a struct.
  1332  func (v Value) FieldByIndexErr(index []int) (Value, error) {
  1333  	if len(index) == 1 {
  1334  		return v.Field(index[0]), nil
  1335  	}
  1336  	v.mustBe(Struct)
  1337  	for i, x := range index {
  1338  		if i > 0 {
  1339  			if v.Kind() == Ptr && v.typ().Elem().Kind() == abi.Struct {
  1340  				if v.IsNil() {
  1341  					return Value{}, errors.New("reflect: indirection through nil pointer to embedded struct field " + nameFor(v.typ().Elem()))
  1342  				}
  1343  				v = v.Elem()
  1344  			}
  1345  		}
  1346  		v = v.Field(x)
  1347  	}
  1348  	return v, nil
  1349  }
  1350  
  1351  // FieldByName returns the struct field with the given name.
  1352  // It returns the zero Value if no field was found.
  1353  // It panics if v's Kind is not [Struct].
  1354  func (v Value) FieldByName(name string) Value {
  1355  	v.mustBe(Struct)
  1356  	if f, ok := toRType(v.typ()).FieldByName(name); ok {
  1357  		return v.FieldByIndex(f.Index)
  1358  	}
  1359  	return Value{}
  1360  }
  1361  
  1362  // FieldByNameFunc returns the struct field with a name
  1363  // that satisfies the match function.
  1364  // It panics if v's Kind is not [Struct].
  1365  // It returns the zero Value if no field was found.
  1366  func (v Value) FieldByNameFunc(match func(string) bool) Value {
  1367  	if f, ok := toRType(v.typ()).FieldByNameFunc(match); ok {
  1368  		return v.FieldByIndex(f.Index)
  1369  	}
  1370  	return Value{}
  1371  }
  1372  
  1373  // CanFloat reports whether [Value.Float] can be used without panicking.
  1374  func (v Value) CanFloat() bool {
  1375  	switch v.kind() {
  1376  	case Float32, Float64:
  1377  		return true
  1378  	default:
  1379  		return false
  1380  	}
  1381  }
  1382  
  1383  // Float returns v's underlying value, as a float64.
  1384  // It panics if v's Kind is not [Float32] or [Float64]
  1385  func (v Value) Float() float64 {
  1386  	k := v.kind()
  1387  	switch k {
  1388  	case Float32:
  1389  		return float64(*(*float32)(v.ptr))
  1390  	case Float64:
  1391  		return *(*float64)(v.ptr)
  1392  	}
  1393  	panic(&ValueError{"reflect.Value.Float", v.kind()})
  1394  }
  1395  
  1396  var uint8Type = rtypeOf(uint8(0))
  1397  
  1398  // Index returns v's i'th element.
  1399  // It panics if v's Kind is not [Array], [Slice], or [String] or i is out of range.
  1400  func (v Value) Index(i int) Value {
  1401  	switch v.kind() {
  1402  	case Array:
  1403  		tt := (*arrayType)(unsafe.Pointer(v.typ()))
  1404  		if uint(i) >= uint(tt.Len) {
  1405  			panic("reflect: array index out of range")
  1406  		}
  1407  		typ := tt.Elem
  1408  		offset := uintptr(i) * typ.Size()
  1409  
  1410  		// Either flagIndir is set and v.ptr points at array,
  1411  		// or flagIndir is not set and v.ptr is the actual array data.
  1412  		// In the former case, we want v.ptr + offset.
  1413  		// In the latter case, we must be doing Index(0), so offset = 0,
  1414  		// so v.ptr + offset is still the correct address.
  1415  		val := add(v.ptr, offset, "same as &v[i], i < tt.len")
  1416  		fl := v.flag&(flagIndir|flagAddr) | v.flag.ro() | flag(typ.Kind()) // bits same as overall array
  1417  		return Value{typ, val, fl}
  1418  
  1419  	case Slice:
  1420  		// Element flag same as Elem of Pointer.
  1421  		// Addressable, indirect, possibly read-only.
  1422  		s := (*unsafeheader.Slice)(v.ptr)
  1423  		if uint(i) >= uint(s.Len) {
  1424  			panic("reflect: slice index out of range")
  1425  		}
  1426  		tt := (*sliceType)(unsafe.Pointer(v.typ()))
  1427  		typ := tt.Elem
  1428  		val := arrayAt(s.Data, i, typ.Size(), "i < s.Len")
  1429  		fl := flagAddr | flagIndir | v.flag.ro() | flag(typ.Kind())
  1430  		return Value{typ, val, fl}
  1431  
  1432  	case String:
  1433  		s := (*unsafeheader.String)(v.ptr)
  1434  		if uint(i) >= uint(s.Len) {
  1435  			panic("reflect: string index out of range")
  1436  		}
  1437  		p := arrayAt(s.Data, i, 1, "i < s.Len")
  1438  		fl := v.flag.ro() | flag(Uint8) | flagIndir
  1439  		return Value{uint8Type, p, fl}
  1440  	}
  1441  	panic(&ValueError{"reflect.Value.Index", v.kind()})
  1442  }
  1443  
  1444  // CanInt reports whether Int can be used without panicking.
  1445  func (v Value) CanInt() bool {
  1446  	switch v.kind() {
  1447  	case Int, Int8, Int16, Int32, Int64:
  1448  		return true
  1449  	default:
  1450  		return false
  1451  	}
  1452  }
  1453  
  1454  // Int returns v's underlying value, as an int64.
  1455  // It panics if v's Kind is not [Int], [Int8], [Int16], [Int32], or [Int64].
  1456  func (v Value) Int() int64 {
  1457  	k := v.kind()
  1458  	p := v.ptr
  1459  	switch k {
  1460  	case Int:
  1461  		return int64(*(*int)(p))
  1462  	case Int8:
  1463  		return int64(*(*int8)(p))
  1464  	case Int16:
  1465  		return int64(*(*int16)(p))
  1466  	case Int32:
  1467  		return int64(*(*int32)(p))
  1468  	case Int64:
  1469  		return *(*int64)(p)
  1470  	}
  1471  	panic(&ValueError{"reflect.Value.Int", v.kind()})
  1472  }
  1473  
  1474  // CanInterface reports whether [Value.Interface] can be used without panicking.
  1475  func (v Value) CanInterface() bool {
  1476  	if v.flag == 0 {
  1477  		panic(&ValueError{"reflect.Value.CanInterface", Invalid})
  1478  	}
  1479  	return v.flag&flagRO == 0
  1480  }
  1481  
  1482  // Interface returns v's current value as an interface{}.
  1483  // It is equivalent to:
  1484  //
  1485  //	var i interface{} = (v's underlying value)
  1486  //
  1487  // It panics if the Value was obtained by accessing
  1488  // unexported struct fields.
  1489  func (v Value) Interface() (i any) {
  1490  	return valueInterface(v, true)
  1491  }
  1492  
  1493  func valueInterface(v Value, safe bool) any {
  1494  	if v.flag == 0 {
  1495  		panic(&ValueError{"reflect.Value.Interface", Invalid})
  1496  	}
  1497  	if safe && v.flag&flagRO != 0 {
  1498  		// Do not allow access to unexported values via Interface,
  1499  		// because they might be pointers that should not be
  1500  		// writable or methods or function that should not be callable.
  1501  		panic("reflect.Value.Interface: cannot return value obtained from unexported field or method")
  1502  	}
  1503  	if v.flag&flagMethod != 0 {
  1504  		v = makeMethodValue("Interface", v)
  1505  	}
  1506  
  1507  	if v.kind() == Interface {
  1508  		// Special case: return the element inside the interface.
  1509  		return packIfaceValueIntoEmptyIface(v)
  1510  	}
  1511  
  1512  	return packEface(v)
  1513  }
  1514  
  1515  // TypeAssert is semantically equivalent to:
  1516  //
  1517  //	v2, ok := v.Interface().(T)
  1518  //
  1519  // Note that this function, just as the type assertion above, might return:
  1520  //
  1521  //   - ok == false when v.Type() == reflect.TypeFor[T]()
  1522  //     For example, when both T and v are interface types and v.IsNil() == true.
  1523  //     In that case v.Interface() returns a nil interface value, and the
  1524  //     assertion .(T) fails with ok == false.
  1525  //
  1526  //   - ok == true when v.Type() != reflect.TypeFor[T]().
  1527  //     For example, when T is an interface type and v holds a value whose
  1528  //     concrete type implements T.
  1529  func TypeAssert[T any](v Value) (T, bool) {
  1530  	if v.flag == 0 {
  1531  		panic(&ValueError{"reflect.TypeAssert", Invalid})
  1532  	}
  1533  	if v.flag&flagRO != 0 {
  1534  		// Do not allow access to unexported values via TypeAssert,
  1535  		// because they might be pointers that should not be
  1536  		// writable or methods or function that should not be callable.
  1537  		panic("reflect.TypeAssert: cannot return value obtained from unexported field or method")
  1538  	}
  1539  
  1540  	if v.flag&flagMethod != 0 {
  1541  		v = makeMethodValue("TypeAssert", v)
  1542  	}
  1543  
  1544  	typ := abi.TypeFor[T]()
  1545  
  1546  	// If v is an interface, return the element inside the interface.
  1547  	//
  1548  	// T is a concrete type and v is an interface. For example:
  1549  	//
  1550  	//	var v any = int(1)
  1551  	//	val := ValueOf(&v).Elem()
  1552  	//	TypeAssert[int](val) == val.Interface().(int)
  1553  	//
  1554  	// T is a interface and v is a non-nil interface value. For example:
  1555  	//
  1556  	//	var v any = &someError{}
  1557  	//	val := ValueOf(&v).Elem()
  1558  	//	TypeAssert[error](val) == val.Interface().(error)
  1559  	//
  1560  	// T is a interface and v is a nil interface value. For example:
  1561  	//
  1562  	//	var v error = nil
  1563  	//	val := ValueOf(&v).Elem()
  1564  	//	TypeAssert[error](val) == val.Interface().(error)
  1565  	if v.kind() == Interface {
  1566  		v, ok := packIfaceValueIntoEmptyIface(v).(T)
  1567  		return v, ok
  1568  	}
  1569  
  1570  	// If T is an interface and v is a concrete type. For example:
  1571  	//
  1572  	//	TypeAssert[any](ValueOf(1)) == ValueOf(1).Interface().(any)
  1573  	//	TypeAssert[error](ValueOf(&someError{})) == ValueOf(&someError{}).Interface().(error)
  1574  	if typ.Kind() == abi.Interface {
  1575  		// To avoid allocating memory, in case the type assertion fails,
  1576  		// first do the type assertion with a nil Data pointer.
  1577  		iface := *(*any)(unsafe.Pointer(&abi.EmptyInterface{Type: v.typ(), Data: nil}))
  1578  		if out, ok := iface.(T); ok {
  1579  			// Now populate the Data field properly, we update the Data ptr
  1580  			// directly to avoid an additional type asertion. We can re-use the
  1581  			// itab we already got from the runtime (through the previous type assertion).
  1582  			(*abi.CommonInterface)(unsafe.Pointer(&out)).Data = packEfaceData(v)
  1583  			return out, true
  1584  		}
  1585  		var zero T
  1586  		return zero, false
  1587  	}
  1588  
  1589  	// Both v and T must be concrete types.
  1590  	// The only way for an type-assertion to match is if the types are equal.
  1591  	if typ != v.typ() {
  1592  		var zero T
  1593  		return zero, false
  1594  	}
  1595  	if v.flag&flagIndir == 0 {
  1596  		return *(*T)(unsafe.Pointer(&v.ptr)), true
  1597  	}
  1598  	return *(*T)(v.ptr), true
  1599  }
  1600  
  1601  // packIfaceValueIntoEmptyIface converts an interface Value into an empty interface.
  1602  //
  1603  // Precondition: v.kind() == Interface
  1604  func packIfaceValueIntoEmptyIface(v Value) any {
  1605  	// Empty interface has one layout, all interfaces with
  1606  	// methods have a second layout.
  1607  	if v.NumMethod() == 0 {
  1608  		return *(*any)(v.ptr)
  1609  	}
  1610  	return *(*interface {
  1611  		M()
  1612  	})(v.ptr)
  1613  }
  1614  
  1615  // InterfaceData returns a pair of unspecified uintptr values.
  1616  // It panics if v's Kind is not Interface.
  1617  //
  1618  // In earlier versions of Go, this function returned the interface's
  1619  // value as a uintptr pair. As of Go 1.4, the implementation of
  1620  // interface values precludes any defined use of InterfaceData.
  1621  //
  1622  // Deprecated: The memory representation of interface values is not
  1623  // compatible with InterfaceData.
  1624  func (v Value) InterfaceData() [2]uintptr {
  1625  	v.mustBe(Interface)
  1626  	// The compiler loses track as it converts to uintptr. Force escape.
  1627  	escapes(v.ptr)
  1628  	// We treat this as a read operation, so we allow
  1629  	// it even for unexported data, because the caller
  1630  	// has to import "unsafe" to turn it into something
  1631  	// that can be abused.
  1632  	// Interface value is always bigger than a word; assume flagIndir.
  1633  	return *(*[2]uintptr)(v.ptr)
  1634  }
  1635  
  1636  // IsNil reports whether its argument v is nil. The argument must be
  1637  // a chan, func, interface, map, pointer, or slice value; if it is
  1638  // not, IsNil panics. Note that IsNil is not always equivalent to a
  1639  // regular comparison with nil in Go. For example, if v was created
  1640  // by calling [ValueOf] with an uninitialized interface variable i,
  1641  // i==nil will be true but v.IsNil will panic as v will be the zero
  1642  // Value.
  1643  func (v Value) IsNil() bool {
  1644  	k := v.kind()
  1645  	switch k {
  1646  	case Chan, Func, Map, Pointer, UnsafePointer:
  1647  		if v.flag&flagMethod != 0 {
  1648  			return false
  1649  		}
  1650  		ptr := v.ptr
  1651  		if v.flag&flagIndir != 0 {
  1652  			ptr = *(*unsafe.Pointer)(ptr)
  1653  		}
  1654  		return ptr == nil
  1655  	case Interface, Slice:
  1656  		// Both interface and slice are nil if first word is 0.
  1657  		// Both are always bigger than a word; assume flagIndir.
  1658  		return *(*unsafe.Pointer)(v.ptr) == nil
  1659  	}
  1660  	panic(&ValueError{"reflect.Value.IsNil", v.kind()})
  1661  }
  1662  
  1663  // IsValid reports whether v represents a value.
  1664  // It returns false if v is the zero Value.
  1665  // If [Value.IsValid] returns false, all other methods except String panic.
  1666  // Most functions and methods never return an invalid Value.
  1667  // If one does, its documentation states the conditions explicitly.
  1668  func (v Value) IsValid() bool {
  1669  	return v.flag != 0
  1670  }
  1671  
  1672  // IsZero reports whether v is the zero value for its type.
  1673  // It panics if the argument is invalid.
  1674  func (v Value) IsZero() bool {
  1675  	switch v.kind() {
  1676  	case Bool:
  1677  		return !v.Bool()
  1678  	case Int, Int8, Int16, Int32, Int64:
  1679  		return v.Int() == 0
  1680  	case Uint, Uint8, Uint16, Uint32, Uint64, Uintptr:
  1681  		return v.Uint() == 0
  1682  	case Float32, Float64:
  1683  		return v.Float() == 0
  1684  	case Complex64, Complex128:
  1685  		return v.Complex() == 0
  1686  	case Array:
  1687  		if v.flag&flagIndir == 0 {
  1688  			return v.ptr == nil
  1689  		}
  1690  		if v.ptr == unsafe.Pointer(&zeroVal[0]) {
  1691  			return true
  1692  		}
  1693  		typ := (*abi.ArrayType)(unsafe.Pointer(v.typ()))
  1694  		// If the type is comparable, then compare directly with zero.
  1695  		if typ.Equal != nil && typ.Size() <= abi.ZeroValSize {
  1696  			// v.ptr doesn't escape, as Equal functions are compiler generated
  1697  			// and never escape. The escape analysis doesn't know, as it is a
  1698  			// function pointer call.
  1699  			return typ.Equal(abi.NoEscape(v.ptr), unsafe.Pointer(&zeroVal[0]))
  1700  		}
  1701  		if typ.TFlag&abi.TFlagRegularMemory != 0 {
  1702  			// For some types where the zero value is a value where all bits of this type are 0
  1703  			// optimize it.
  1704  			return isZero(unsafe.Slice(((*byte)(v.ptr)), typ.Size()))
  1705  		}
  1706  		n := int(typ.Len)
  1707  		for i := 0; i < n; i++ {
  1708  			if !v.Index(i).IsZero() {
  1709  				return false
  1710  			}
  1711  		}
  1712  		return true
  1713  	case Chan, Func, Interface, Map, Pointer, Slice, UnsafePointer:
  1714  		return v.IsNil()
  1715  	case String:
  1716  		return v.Len() == 0
  1717  	case Struct:
  1718  		if v.flag&flagIndir == 0 {
  1719  			return v.ptr == nil
  1720  		}
  1721  		if v.ptr == unsafe.Pointer(&zeroVal[0]) {
  1722  			return true
  1723  		}
  1724  		typ := (*abi.StructType)(unsafe.Pointer(v.typ()))
  1725  		// If the type is comparable, then compare directly with zero.
  1726  		if typ.Equal != nil && typ.Size() <= abi.ZeroValSize {
  1727  			// See noescape justification above.
  1728  			return typ.Equal(abi.NoEscape(v.ptr), unsafe.Pointer(&zeroVal[0]))
  1729  		}
  1730  		if typ.TFlag&abi.TFlagRegularMemory != 0 {
  1731  			// For some types where the zero value is a value where all bits of this type are 0
  1732  			// optimize it.
  1733  			return isZero(unsafe.Slice(((*byte)(v.ptr)), typ.Size()))
  1734  		}
  1735  
  1736  		n := v.NumField()
  1737  		for i := 0; i < n; i++ {
  1738  			if !v.Field(i).IsZero() && v.Type().Field(i).Name != "_" {
  1739  				return false
  1740  			}
  1741  		}
  1742  		return true
  1743  	default:
  1744  		// This should never happen, but will act as a safeguard for later,
  1745  		// as a default value doesn't makes sense here.
  1746  		panic(&ValueError{"reflect.Value.IsZero", v.Kind()})
  1747  	}
  1748  }
  1749  
  1750  // isZero For all zeros, performance is not as good as
  1751  // return bytealg.Count(b, byte(0)) == len(b)
  1752  func isZero(b []byte) bool {
  1753  	if len(b) == 0 {
  1754  		return true
  1755  	}
  1756  	const n = 32
  1757  	// Align memory addresses to 8 bytes.
  1758  	for uintptr(unsafe.Pointer(&b[0]))%8 != 0 {
  1759  		if b[0] != 0 {
  1760  			return false
  1761  		}
  1762  		b = b[1:]
  1763  		if len(b) == 0 {
  1764  			return true
  1765  		}
  1766  	}
  1767  	for len(b)%8 != 0 {
  1768  		if b[len(b)-1] != 0 {
  1769  			return false
  1770  		}
  1771  		b = b[:len(b)-1]
  1772  	}
  1773  	if len(b) == 0 {
  1774  		return true
  1775  	}
  1776  	w := unsafe.Slice((*uint64)(unsafe.Pointer(&b[0])), len(b)/8)
  1777  	for len(w)%n != 0 {
  1778  		if w[0] != 0 {
  1779  			return false
  1780  		}
  1781  		w = w[1:]
  1782  	}
  1783  	for len(w) >= n {
  1784  		if w[0] != 0 || w[1] != 0 || w[2] != 0 || w[3] != 0 ||
  1785  			w[4] != 0 || w[5] != 0 || w[6] != 0 || w[7] != 0 ||
  1786  			w[8] != 0 || w[9] != 0 || w[10] != 0 || w[11] != 0 ||
  1787  			w[12] != 0 || w[13] != 0 || w[14] != 0 || w[15] != 0 ||
  1788  			w[16] != 0 || w[17] != 0 || w[18] != 0 || w[19] != 0 ||
  1789  			w[20] != 0 || w[21] != 0 || w[22] != 0 || w[23] != 0 ||
  1790  			w[24] != 0 || w[25] != 0 || w[26] != 0 || w[27] != 0 ||
  1791  			w[28] != 0 || w[29] != 0 || w[30] != 0 || w[31] != 0 {
  1792  			return false
  1793  		}
  1794  		w = w[n:]
  1795  	}
  1796  	return true
  1797  }
  1798  
  1799  // SetZero sets v to be the zero value of v's type.
  1800  // It panics if [Value.CanSet] returns false.
  1801  func (v Value) SetZero() {
  1802  	v.mustBeAssignable()
  1803  	switch v.kind() {
  1804  	case Bool:
  1805  		*(*bool)(v.ptr) = false
  1806  	case Int:
  1807  		*(*int)(v.ptr) = 0
  1808  	case Int8:
  1809  		*(*int8)(v.ptr) = 0
  1810  	case Int16:
  1811  		*(*int16)(v.ptr) = 0
  1812  	case Int32:
  1813  		*(*int32)(v.ptr) = 0
  1814  	case Int64:
  1815  		*(*int64)(v.ptr) = 0
  1816  	case Uint:
  1817  		*(*uint)(v.ptr) = 0
  1818  	case Uint8:
  1819  		*(*uint8)(v.ptr) = 0
  1820  	case Uint16:
  1821  		*(*uint16)(v.ptr) = 0
  1822  	case Uint32:
  1823  		*(*uint32)(v.ptr) = 0
  1824  	case Uint64:
  1825  		*(*uint64)(v.ptr) = 0
  1826  	case Uintptr:
  1827  		*(*uintptr)(v.ptr) = 0
  1828  	case Float32:
  1829  		*(*float32)(v.ptr) = 0
  1830  	case Float64:
  1831  		*(*float64)(v.ptr) = 0
  1832  	case Complex64:
  1833  		*(*complex64)(v.ptr) = 0
  1834  	case Complex128:
  1835  		*(*complex128)(v.ptr) = 0
  1836  	case String:
  1837  		*(*string)(v.ptr) = ""
  1838  	case Slice:
  1839  		*(*unsafeheader.Slice)(v.ptr) = unsafeheader.Slice{}
  1840  	case Interface:
  1841  		*(*abi.EmptyInterface)(v.ptr) = abi.EmptyInterface{}
  1842  	case Chan, Func, Map, Pointer, UnsafePointer:
  1843  		*(*unsafe.Pointer)(v.ptr) = nil
  1844  	case Array, Struct:
  1845  		typedmemclr(v.typ(), v.ptr)
  1846  	default:
  1847  		// This should never happen, but will act as a safeguard for later,
  1848  		// as a default value doesn't makes sense here.
  1849  		panic(&ValueError{"reflect.Value.SetZero", v.Kind()})
  1850  	}
  1851  }
  1852  
  1853  // Kind returns v's Kind.
  1854  // If v is the zero Value ([Value.IsValid] returns false), Kind returns Invalid.
  1855  func (v Value) Kind() Kind {
  1856  	return v.kind()
  1857  }
  1858  
  1859  // Len returns v's length.
  1860  // It panics if v's Kind is not [Array], [Chan], [Map], [Slice], [String], or pointer to [Array].
  1861  func (v Value) Len() int {
  1862  	// lenNonSlice is split out to keep Len inlineable for slice kinds.
  1863  	if v.kind() == Slice {
  1864  		return (*unsafeheader.Slice)(v.ptr).Len
  1865  	}
  1866  	return v.lenNonSlice()
  1867  }
  1868  
  1869  func (v Value) lenNonSlice() int {
  1870  	switch k := v.kind(); k {
  1871  	case Array:
  1872  		tt := (*arrayType)(unsafe.Pointer(v.typ()))
  1873  		return int(tt.Len)
  1874  	case Chan:
  1875  		return chanlen(v.pointer())
  1876  	case Map:
  1877  		return maplen(v.pointer())
  1878  	case String:
  1879  		// String is bigger than a word; assume flagIndir.
  1880  		return (*unsafeheader.String)(v.ptr).Len
  1881  	case Ptr:
  1882  		if v.typ().Elem().Kind() == abi.Array {
  1883  			return v.typ().Elem().Len()
  1884  		}
  1885  		panic("reflect: call of reflect.Value.Len on ptr to non-array Value")
  1886  	}
  1887  	panic(&ValueError{"reflect.Value.Len", v.kind()})
  1888  }
  1889  
  1890  // copyVal returns a Value containing the map key or value at ptr,
  1891  // allocating a new variable as needed.
  1892  func copyVal(typ *abi.Type, fl flag, ptr unsafe.Pointer) Value {
  1893  	if !typ.IsDirectIface() {
  1894  		// Copy result so future changes to the map
  1895  		// won't change the underlying value.
  1896  		c := unsafe_New(typ)
  1897  		typedmemmove(typ, c, ptr)
  1898  		return Value{typ, c, fl | flagIndir}
  1899  	}
  1900  	return Value{typ, *(*unsafe.Pointer)(ptr), fl}
  1901  }
  1902  
  1903  // Method returns a function value corresponding to v's i'th method.
  1904  // The arguments to a Call on the returned function should not include
  1905  // a receiver; the returned function will always use v as the receiver.
  1906  // Method panics if i is out of range or if v is a nil interface value.
  1907  //
  1908  // Calling this method will force the linker to retain all exported methods in all packages.
  1909  // This may make the executable binary larger but will not affect execution time.
  1910  func (v Value) Method(i int) Value {
  1911  	if v.typ() == nil {
  1912  		panic(&ValueError{"reflect.Value.Method", Invalid})
  1913  	}
  1914  	if v.flag&flagMethod != 0 || uint(i) >= uint(toRType(v.typ()).NumMethod()) {
  1915  		panic("reflect: Method index out of range")
  1916  	}
  1917  	if v.typ().Kind() == abi.Interface && v.IsNil() {
  1918  		panic("reflect: Method on nil interface value")
  1919  	}
  1920  	fl := v.flag.ro() | (v.flag & flagIndir)
  1921  	fl |= flag(Func)
  1922  	fl |= flag(i)<<flagMethodShift | flagMethod
  1923  	return Value{v.typ(), v.ptr, fl}
  1924  }
  1925  
  1926  // NumMethod returns the number of methods in the value's method set.
  1927  //
  1928  // For a non-interface type, it returns the number of exported methods.
  1929  //
  1930  // For an interface type, it returns the number of exported and unexported methods.
  1931  func (v Value) NumMethod() int {
  1932  	if v.typ() == nil {
  1933  		panic(&ValueError{"reflect.Value.NumMethod", Invalid})
  1934  	}
  1935  	if v.flag&flagMethod != 0 {
  1936  		return 0
  1937  	}
  1938  	return toRType(v.typ()).NumMethod()
  1939  }
  1940  
  1941  // MethodByName returns a function value corresponding to the method
  1942  // of v with the given name.
  1943  // The arguments to a Call on the returned function should not include
  1944  // a receiver; the returned function will always use v as the receiver.
  1945  // It returns the zero Value if no method was found.
  1946  //
  1947  // Calling this method will cause the linker to retain all methods with this name in all packages.
  1948  // If the linker can't determine the name, it will retain all exported methods.
  1949  // This may make the executable binary larger but will not affect execution time.
  1950  func (v Value) MethodByName(name string) Value {
  1951  	if v.typ() == nil {
  1952  		panic(&ValueError{"reflect.Value.MethodByName", Invalid})
  1953  	}
  1954  	if v.flag&flagMethod != 0 {
  1955  		return Value{}
  1956  	}
  1957  	m, ok := toRType(v.typ()).MethodByName(name)
  1958  	if !ok {
  1959  		return Value{}
  1960  	}
  1961  	return v.Method(m.Index)
  1962  }
  1963  
  1964  // NumField returns the number of fields in the struct v.
  1965  // It panics if v's Kind is not [Struct].
  1966  func (v Value) NumField() int {
  1967  	v.mustBe(Struct)
  1968  	tt := (*structType)(unsafe.Pointer(v.typ()))
  1969  	return len(tt.Fields)
  1970  }
  1971  
  1972  // OverflowComplex reports whether the complex128 x cannot be represented by v's type.
  1973  // It panics if v's Kind is not [Complex64] or [Complex128].
  1974  func (v Value) OverflowComplex(x complex128) bool {
  1975  	k := v.kind()
  1976  	switch k {
  1977  	case Complex64:
  1978  		return overflowFloat32(real(x)) || overflowFloat32(imag(x))
  1979  	case Complex128:
  1980  		return false
  1981  	}
  1982  	panic(&ValueError{"reflect.Value.OverflowComplex", v.kind()})
  1983  }
  1984  
  1985  // OverflowFloat reports whether the float64 x cannot be represented by v's type.
  1986  // It panics if v's Kind is not [Float32] or [Float64].
  1987  func (v Value) OverflowFloat(x float64) bool {
  1988  	k := v.kind()
  1989  	switch k {
  1990  	case Float32:
  1991  		return overflowFloat32(x)
  1992  	case Float64:
  1993  		return false
  1994  	}
  1995  	panic(&ValueError{"reflect.Value.OverflowFloat", v.kind()})
  1996  }
  1997  
  1998  func overflowFloat32(x float64) bool {
  1999  	if x < 0 {
  2000  		x = -x
  2001  	}
  2002  	return math.MaxFloat32 < x && x <= math.MaxFloat64
  2003  }
  2004  
  2005  // OverflowInt reports whether the int64 x cannot be represented by v's type.
  2006  // It panics if v's Kind is not [Int], [Int8], [Int16], [Int32], or [Int64].
  2007  func (v Value) OverflowInt(x int64) bool {
  2008  	k := v.kind()
  2009  	switch k {
  2010  	case Int, Int8, Int16, Int32, Int64:
  2011  		bitSize := v.typ().Size() * 8
  2012  		trunc := (x << (64 - bitSize)) >> (64 - bitSize)
  2013  		return x != trunc
  2014  	}
  2015  	panic(&ValueError{"reflect.Value.OverflowInt", v.kind()})
  2016  }
  2017  
  2018  // OverflowUint reports whether the uint64 x cannot be represented by v's type.
  2019  // It panics if v's Kind is not [Uint], [Uintptr], [Uint8], [Uint16], [Uint32], or [Uint64].
  2020  func (v Value) OverflowUint(x uint64) bool {
  2021  	k := v.kind()
  2022  	switch k {
  2023  	case Uint, Uintptr, Uint8, Uint16, Uint32, Uint64:
  2024  		bitSize := v.typ_.Size() * 8 // ok to use v.typ_ directly as Size doesn't escape
  2025  		trunc := (x << (64 - bitSize)) >> (64 - bitSize)
  2026  		return x != trunc
  2027  	}
  2028  	panic(&ValueError{"reflect.Value.OverflowUint", v.kind()})
  2029  }
  2030  
  2031  //go:nocheckptr
  2032  // This prevents inlining Value.Pointer when -d=checkptr is enabled,
  2033  // which ensures cmd/compile can recognize unsafe.Pointer(v.Pointer())
  2034  // and make an exception.
  2035  
  2036  // Pointer returns v's value as a uintptr.
  2037  // It panics if v's Kind is not [Chan], [Func], [Map], [Pointer], [Slice], [String], or [UnsafePointer].
  2038  //
  2039  // If v's Kind is [Func], the returned pointer is an underlying
  2040  // code pointer, but not necessarily enough to identify a
  2041  // single function uniquely. The only guarantee is that the
  2042  // result is zero if and only if v is a nil func Value.
  2043  //
  2044  // If v's Kind is [Slice], the returned pointer is to the first
  2045  // element of the slice. If the slice is nil the returned value
  2046  // is 0.  If the slice is empty but non-nil the return value is non-zero.
  2047  //
  2048  // If v's Kind is [String], the returned pointer is to the first
  2049  // element of the underlying bytes of string.
  2050  //
  2051  // It's preferred to use uintptr(Value.UnsafePointer()) to get the equivalent result.
  2052  func (v Value) Pointer() uintptr {
  2053  	// The compiler loses track as it converts to uintptr. Force escape.
  2054  	escapes(v.ptr)
  2055  
  2056  	k := v.kind()
  2057  	switch k {
  2058  	case Pointer:
  2059  		if !v.typ().Pointers() {
  2060  			val := *(*uintptr)(v.ptr)
  2061  			// Since it is a not-in-heap pointer, all pointers to the heap are
  2062  			// forbidden! See comment in Value.Elem and issue #48399.
  2063  			if !verifyNotInHeapPtr(val) {
  2064  				panic("reflect: reflect.Value.Pointer on an invalid notinheap pointer")
  2065  			}
  2066  			return val
  2067  		}
  2068  		fallthrough
  2069  	case Chan, Map, UnsafePointer:
  2070  		return uintptr(v.pointer())
  2071  	case Func:
  2072  		if v.flag&flagMethod != 0 {
  2073  			// As the doc comment says, the returned pointer is an
  2074  			// underlying code pointer but not necessarily enough to
  2075  			// identify a single function uniquely. All method expressions
  2076  			// created via reflect have the same underlying code pointer,
  2077  			// so their Pointers are equal. The function used here must
  2078  			// match the one used in makeMethodValue.
  2079  			return methodValueCallCodePtr()
  2080  		}
  2081  		p := v.pointer()
  2082  		// Non-nil func value points at data block.
  2083  		// First word of data block is actual code.
  2084  		if p != nil {
  2085  			p = *(*unsafe.Pointer)(p)
  2086  		}
  2087  		return uintptr(p)
  2088  	case Slice:
  2089  		return uintptr((*unsafeheader.Slice)(v.ptr).Data)
  2090  	case String:
  2091  		return uintptr((*unsafeheader.String)(v.ptr).Data)
  2092  	}
  2093  	panic(&ValueError{"reflect.Value.Pointer", v.kind()})
  2094  }
  2095  
  2096  // Recv receives and returns a value from the channel v.
  2097  // It panics if v's Kind is not [Chan].
  2098  // The receive blocks until a value is ready.
  2099  // The boolean value ok is true if the value x corresponds to a send
  2100  // on the channel, false if it is a zero value received because the channel is closed.
  2101  func (v Value) Recv() (x Value, ok bool) {
  2102  	v.mustBe(Chan)
  2103  	v.mustBeExported()
  2104  	return v.recv(false)
  2105  }
  2106  
  2107  // internal recv, possibly non-blocking (nb).
  2108  // v is known to be a channel.
  2109  func (v Value) recv(nb bool) (val Value, ok bool) {
  2110  	tt := (*chanType)(unsafe.Pointer(v.typ()))
  2111  	if ChanDir(tt.Dir)&RecvDir == 0 {
  2112  		panic("reflect: recv on send-only channel")
  2113  	}
  2114  	t := tt.Elem
  2115  	val = Value{t, nil, flag(t.Kind())}
  2116  	var p unsafe.Pointer
  2117  	if !t.IsDirectIface() {
  2118  		p = unsafe_New(t)
  2119  		val.ptr = p
  2120  		val.flag |= flagIndir
  2121  	} else {
  2122  		p = unsafe.Pointer(&val.ptr)
  2123  	}
  2124  	selected, ok := chanrecv(v.pointer(), nb, p)
  2125  	if !selected {
  2126  		val = Value{}
  2127  	}
  2128  	return
  2129  }
  2130  
  2131  // Send sends x on the channel v.
  2132  // It panics if v's kind is not [Chan] or if x's type is not the same type as v's element type.
  2133  // As in Go, x's value must be assignable to the channel's element type.
  2134  func (v Value) Send(x Value) {
  2135  	v.mustBe(Chan)
  2136  	v.mustBeExported()
  2137  	v.send(x, false)
  2138  }
  2139  
  2140  // internal send, possibly non-blocking.
  2141  // v is known to be a channel.
  2142  func (v Value) send(x Value, nb bool) (selected bool) {
  2143  	tt := (*chanType)(unsafe.Pointer(v.typ()))
  2144  	if ChanDir(tt.Dir)&SendDir == 0 {
  2145  		panic("reflect: send on recv-only channel")
  2146  	}
  2147  	x.mustBeExported()
  2148  	x = x.assignTo("reflect.Value.Send", tt.Elem, nil)
  2149  	var p unsafe.Pointer
  2150  	if x.flag&flagIndir != 0 {
  2151  		p = x.ptr
  2152  	} else {
  2153  		p = unsafe.Pointer(&x.ptr)
  2154  	}
  2155  	return chansend(v.pointer(), p, nb)
  2156  }
  2157  
  2158  // Set assigns x to the value v.
  2159  // It panics if [Value.CanSet] returns false.
  2160  // As in Go, x's value must be assignable to v's type and
  2161  // must not be derived from an unexported field.
  2162  func (v Value) Set(x Value) {
  2163  	v.mustBeAssignable()
  2164  	x.mustBeExported() // do not let unexported x leak
  2165  	var target unsafe.Pointer
  2166  	if v.kind() == Interface {
  2167  		target = v.ptr
  2168  	}
  2169  	x = x.assignTo("reflect.Set", v.typ(), target)
  2170  	if x.flag&flagIndir != 0 {
  2171  		if x.ptr == unsafe.Pointer(&zeroVal[0]) {
  2172  			typedmemclr(v.typ(), v.ptr)
  2173  		} else {
  2174  			typedmemmove(v.typ(), v.ptr, x.ptr)
  2175  		}
  2176  	} else {
  2177  		*(*unsafe.Pointer)(v.ptr) = x.ptr
  2178  	}
  2179  }
  2180  
  2181  // SetBool sets v's underlying value.
  2182  // It panics if v's Kind is not [Bool] or if [Value.CanSet] returns false.
  2183  func (v Value) SetBool(x bool) {
  2184  	v.mustBeAssignable()
  2185  	v.mustBe(Bool)
  2186  	*(*bool)(v.ptr) = x
  2187  }
  2188  
  2189  // SetBytes sets v's underlying value.
  2190  // It panics if v's underlying value is not a slice of bytes
  2191  // or if [Value.CanSet] returns false.
  2192  func (v Value) SetBytes(x []byte) {
  2193  	v.mustBeAssignable()
  2194  	v.mustBe(Slice)
  2195  	if toRType(v.typ()).Elem().Kind() != Uint8 { // TODO add Elem method, fix mustBe(Slice) to return slice.
  2196  		panic("reflect.Value.SetBytes of non-byte slice")
  2197  	}
  2198  	*(*[]byte)(v.ptr) = x
  2199  }
  2200  
  2201  // setRunes sets v's underlying value.
  2202  // It panics if v's underlying value is not a slice of runes (int32s)
  2203  // or if [Value.CanSet] returns false.
  2204  func (v Value) setRunes(x []rune) {
  2205  	v.mustBeAssignable()
  2206  	v.mustBe(Slice)
  2207  	if v.typ().Elem().Kind() != abi.Int32 {
  2208  		panic("reflect.Value.setRunes of non-rune slice")
  2209  	}
  2210  	*(*[]rune)(v.ptr) = x
  2211  }
  2212  
  2213  // SetComplex sets v's underlying value to x.
  2214  // It panics if v's Kind is not [Complex64] or [Complex128],
  2215  // or if [Value.CanSet] returns false.
  2216  func (v Value) SetComplex(x complex128) {
  2217  	v.mustBeAssignable()
  2218  	switch k := v.kind(); k {
  2219  	default:
  2220  		panic(&ValueError{"reflect.Value.SetComplex", v.kind()})
  2221  	case Complex64:
  2222  		*(*complex64)(v.ptr) = complex64(x)
  2223  	case Complex128:
  2224  		*(*complex128)(v.ptr) = x
  2225  	}
  2226  }
  2227  
  2228  // SetFloat sets v's underlying value to x.
  2229  // It panics if v's Kind is not [Float32] or [Float64],
  2230  // or if [Value.CanSet] returns false.
  2231  func (v Value) SetFloat(x float64) {
  2232  	v.mustBeAssignable()
  2233  	switch k := v.kind(); k {
  2234  	default:
  2235  		panic(&ValueError{"reflect.Value.SetFloat", v.kind()})
  2236  	case Float32:
  2237  		*(*float32)(v.ptr) = float32(x)
  2238  	case Float64:
  2239  		*(*float64)(v.ptr) = x
  2240  	}
  2241  }
  2242  
  2243  // SetInt sets v's underlying value to x.
  2244  // It panics if v's Kind is not [Int], [Int8], [Int16], [Int32], or [Int64],
  2245  // or if [Value.CanSet] returns false.
  2246  func (v Value) SetInt(x int64) {
  2247  	v.mustBeAssignable()
  2248  	switch k := v.kind(); k {
  2249  	default:
  2250  		panic(&ValueError{"reflect.Value.SetInt", v.kind()})
  2251  	case Int:
  2252  		*(*int)(v.ptr) = int(x)
  2253  	case Int8:
  2254  		*(*int8)(v.ptr) = int8(x)
  2255  	case Int16:
  2256  		*(*int16)(v.ptr) = int16(x)
  2257  	case Int32:
  2258  		*(*int32)(v.ptr) = int32(x)
  2259  	case Int64:
  2260  		*(*int64)(v.ptr) = x
  2261  	}
  2262  }
  2263  
  2264  // SetLen sets v's length to n.
  2265  // It panics if v's Kind is not [Slice], or if n is negative or
  2266  // greater than the capacity of the slice,
  2267  // or if [Value.CanSet] returns false.
  2268  func (v Value) SetLen(n int) {
  2269  	v.mustBeAssignable()
  2270  	v.mustBe(Slice)
  2271  	s := (*unsafeheader.Slice)(v.ptr)
  2272  	if uint(n) > uint(s.Cap) {
  2273  		panic("reflect: slice length out of range in SetLen")
  2274  	}
  2275  	s.Len = n
  2276  }
  2277  
  2278  // SetCap sets v's capacity to n.
  2279  // It panics if v's Kind is not [Slice], or if n is smaller than the length or
  2280  // greater than the capacity of the slice,
  2281  // or if [Value.CanSet] returns false.
  2282  func (v Value) SetCap(n int) {
  2283  	v.mustBeAssignable()
  2284  	v.mustBe(Slice)
  2285  	s := (*unsafeheader.Slice)(v.ptr)
  2286  	if n < s.Len || n > s.Cap {
  2287  		panic("reflect: slice capacity out of range in SetCap")
  2288  	}
  2289  	s.Cap = n
  2290  }
  2291  
  2292  // SetUint sets v's underlying value to x.
  2293  // It panics if v's Kind is not [Uint], [Uintptr], [Uint8], [Uint16], [Uint32], or [Uint64],
  2294  // or if [Value.CanSet] returns false.
  2295  func (v Value) SetUint(x uint64) {
  2296  	v.mustBeAssignable()
  2297  	switch k := v.kind(); k {
  2298  	default:
  2299  		panic(&ValueError{"reflect.Value.SetUint", v.kind()})
  2300  	case Uint:
  2301  		*(*uint)(v.ptr) = uint(x)
  2302  	case Uint8:
  2303  		*(*uint8)(v.ptr) = uint8(x)
  2304  	case Uint16:
  2305  		*(*uint16)(v.ptr) = uint16(x)
  2306  	case Uint32:
  2307  		*(*uint32)(v.ptr) = uint32(x)
  2308  	case Uint64:
  2309  		*(*uint64)(v.ptr) = x
  2310  	case Uintptr:
  2311  		*(*uintptr)(v.ptr) = uintptr(x)
  2312  	}
  2313  }
  2314  
  2315  // SetPointer sets the [unsafe.Pointer] value v to x.
  2316  // It panics if v's Kind is not [UnsafePointer]
  2317  // or if [Value.CanSet] returns false.
  2318  func (v Value) SetPointer(x unsafe.Pointer) {
  2319  	v.mustBeAssignable()
  2320  	v.mustBe(UnsafePointer)
  2321  	*(*unsafe.Pointer)(v.ptr) = x
  2322  }
  2323  
  2324  // SetString sets v's underlying value to x.
  2325  // It panics if v's Kind is not [String] or if [Value.CanSet] returns false.
  2326  func (v Value) SetString(x string) {
  2327  	v.mustBeAssignable()
  2328  	v.mustBe(String)
  2329  	*(*string)(v.ptr) = x
  2330  }
  2331  
  2332  // Slice returns v[i:j].
  2333  // It panics if v's Kind is not [Array], [Slice] or [String], or if v is an unaddressable array,
  2334  // or if the indexes are out of bounds.
  2335  func (v Value) Slice(i, j int) Value {
  2336  	var (
  2337  		cap  int
  2338  		typ  *sliceType
  2339  		base unsafe.Pointer
  2340  	)
  2341  	switch kind := v.kind(); kind {
  2342  	default:
  2343  		panic(&ValueError{"reflect.Value.Slice", v.kind()})
  2344  
  2345  	case Array:
  2346  		if v.flag&flagAddr == 0 {
  2347  			panic("reflect.Value.Slice: slice of unaddressable array")
  2348  		}
  2349  		tt := (*arrayType)(unsafe.Pointer(v.typ()))
  2350  		cap = int(tt.Len)
  2351  		typ = (*sliceType)(unsafe.Pointer(tt.Slice))
  2352  		base = v.ptr
  2353  
  2354  	case Slice:
  2355  		typ = (*sliceType)(unsafe.Pointer(v.typ()))
  2356  		s := (*unsafeheader.Slice)(v.ptr)
  2357  		base = s.Data
  2358  		cap = s.Cap
  2359  
  2360  	case String:
  2361  		s := (*unsafeheader.String)(v.ptr)
  2362  		if i < 0 || j < i || j > s.Len {
  2363  			panic("reflect.Value.Slice: string slice index out of bounds")
  2364  		}
  2365  		var t unsafeheader.String
  2366  		if i < s.Len {
  2367  			t = unsafeheader.String{Data: arrayAt(s.Data, i, 1, "i < s.Len"), Len: j - i}
  2368  		}
  2369  		return Value{v.typ(), unsafe.Pointer(&t), v.flag}
  2370  	}
  2371  
  2372  	if i < 0 || j < i || j > cap {
  2373  		panic("reflect.Value.Slice: slice index out of bounds")
  2374  	}
  2375  
  2376  	// Declare slice so that gc can see the base pointer in it.
  2377  	var x []unsafe.Pointer
  2378  
  2379  	// Reinterpret as *unsafeheader.Slice to edit.
  2380  	s := (*unsafeheader.Slice)(unsafe.Pointer(&x))
  2381  	s.Len = j - i
  2382  	s.Cap = cap - i
  2383  	if cap-i > 0 {
  2384  		s.Data = arrayAt(base, i, typ.Elem.Size(), "i < cap")
  2385  	} else {
  2386  		// do not advance pointer, to avoid pointing beyond end of slice
  2387  		s.Data = base
  2388  	}
  2389  
  2390  	fl := v.flag.ro() | flagIndir | flag(Slice)
  2391  	return Value{typ.Common(), unsafe.Pointer(&x), fl}
  2392  }
  2393  
  2394  // Slice3 is the 3-index form of the slice operation: it returns v[i:j:k].
  2395  // It panics if v's Kind is not [Array] or [Slice], or if v is an unaddressable array,
  2396  // or if the indexes are out of bounds.
  2397  func (v Value) Slice3(i, j, k int) Value {
  2398  	var (
  2399  		cap  int
  2400  		typ  *sliceType
  2401  		base unsafe.Pointer
  2402  	)
  2403  	switch kind := v.kind(); kind {
  2404  	default:
  2405  		panic(&ValueError{"reflect.Value.Slice3", v.kind()})
  2406  
  2407  	case Array:
  2408  		if v.flag&flagAddr == 0 {
  2409  			panic("reflect.Value.Slice3: slice of unaddressable array")
  2410  		}
  2411  		tt := (*arrayType)(unsafe.Pointer(v.typ()))
  2412  		cap = int(tt.Len)
  2413  		typ = (*sliceType)(unsafe.Pointer(tt.Slice))
  2414  		base = v.ptr
  2415  
  2416  	case Slice:
  2417  		typ = (*sliceType)(unsafe.Pointer(v.typ()))
  2418  		s := (*unsafeheader.Slice)(v.ptr)
  2419  		base = s.Data
  2420  		cap = s.Cap
  2421  	}
  2422  
  2423  	if i < 0 || j < i || k < j || k > cap {
  2424  		panic("reflect.Value.Slice3: slice index out of bounds")
  2425  	}
  2426  
  2427  	// Declare slice so that the garbage collector
  2428  	// can see the base pointer in it.
  2429  	var x []unsafe.Pointer
  2430  
  2431  	// Reinterpret as *unsafeheader.Slice to edit.
  2432  	s := (*unsafeheader.Slice)(unsafe.Pointer(&x))
  2433  	s.Len = j - i
  2434  	s.Cap = k - i
  2435  	if k-i > 0 {
  2436  		s.Data = arrayAt(base, i, typ.Elem.Size(), "i < k <= cap")
  2437  	} else {
  2438  		// do not advance pointer, to avoid pointing beyond end of slice
  2439  		s.Data = base
  2440  	}
  2441  
  2442  	fl := v.flag.ro() | flagIndir | flag(Slice)
  2443  	return Value{typ.Common(), unsafe.Pointer(&x), fl}
  2444  }
  2445  
  2446  // String returns the string v's underlying value, as a string.
  2447  // String is a special case because of Go's String method convention.
  2448  // Unlike the other getters, it does not panic if v's Kind is not [String].
  2449  // Instead, it returns a string of the form "<T value>" where T is v's type.
  2450  // The fmt package treats Values specially. It does not call their String
  2451  // method implicitly but instead prints the concrete values they hold.
  2452  func (v Value) String() string {
  2453  	// stringNonString is split out to keep String inlineable for string kinds.
  2454  	if v.kind() == String {
  2455  		return *(*string)(v.ptr)
  2456  	}
  2457  	return v.stringNonString()
  2458  }
  2459  
  2460  func (v Value) stringNonString() string {
  2461  	if v.kind() == Invalid {
  2462  		return "<invalid Value>"
  2463  	}
  2464  	// If you call String on a reflect.Value of other type, it's better to
  2465  	// print something than to panic. Useful in debugging.
  2466  	return "<" + v.Type().String() + " Value>"
  2467  }
  2468  
  2469  // TryRecv attempts to receive a value from the channel v but will not block.
  2470  // It panics if v's Kind is not [Chan].
  2471  // If the receive delivers a value, x is the transferred value and ok is true.
  2472  // If the receive cannot finish without blocking, x is the zero Value and ok is false.
  2473  // If the channel is closed, x is the zero value for the channel's element type and ok is false.
  2474  func (v Value) TryRecv() (x Value, ok bool) {
  2475  	v.mustBe(Chan)
  2476  	v.mustBeExported()
  2477  	return v.recv(true)
  2478  }
  2479  
  2480  // TrySend attempts to send x on the channel v but will not block.
  2481  // It panics if v's Kind is not [Chan].
  2482  // It reports whether the value was sent.
  2483  // As in Go, x's value must be assignable to the channel's element type.
  2484  func (v Value) TrySend(x Value) bool {
  2485  	v.mustBe(Chan)
  2486  	v.mustBeExported()
  2487  	return v.send(x, true)
  2488  }
  2489  
  2490  // Type returns v's type.
  2491  func (v Value) Type() Type {
  2492  	if v.flag != 0 && v.flag&flagMethod == 0 {
  2493  		return (*rtype)(abi.NoEscape(unsafe.Pointer(v.typ_))) // inline of toRType(v.typ()), for own inlining in inline test
  2494  	}
  2495  	return v.typeSlow()
  2496  }
  2497  
  2498  //go:noinline
  2499  func (v Value) typeSlow() Type {
  2500  	return toRType(v.abiTypeSlow())
  2501  }
  2502  
  2503  func (v Value) abiType() *abi.Type {
  2504  	if v.flag != 0 && v.flag&flagMethod == 0 {
  2505  		return v.typ()
  2506  	}
  2507  	return v.abiTypeSlow()
  2508  }
  2509  
  2510  func (v Value) abiTypeSlow() *abi.Type {
  2511  	if v.flag == 0 {
  2512  		panic(&ValueError{"reflect.Value.Type", Invalid})
  2513  	}
  2514  
  2515  	typ := v.typ()
  2516  	if v.flag&flagMethod == 0 {
  2517  		return v.typ()
  2518  	}
  2519  
  2520  	// Method value.
  2521  	// v.typ describes the receiver, not the method type.
  2522  	i := int(v.flag) >> flagMethodShift
  2523  	if v.typ().Kind() == abi.Interface {
  2524  		// Method on interface.
  2525  		tt := (*interfaceType)(unsafe.Pointer(typ))
  2526  		if uint(i) >= uint(len(tt.Methods)) {
  2527  			panic("reflect: internal error: invalid method index")
  2528  		}
  2529  		m := &tt.Methods[i]
  2530  		return typeOffFor(typ, m.Typ)
  2531  	}
  2532  	// Method on concrete type.
  2533  	ms := typ.ExportedMethods()
  2534  	if uint(i) >= uint(len(ms)) {
  2535  		panic("reflect: internal error: invalid method index")
  2536  	}
  2537  	m := ms[i]
  2538  	return typeOffFor(typ, m.Mtyp)
  2539  }
  2540  
  2541  // CanUint reports whether [Value.Uint] can be used without panicking.
  2542  func (v Value) CanUint() bool {
  2543  	switch v.kind() {
  2544  	case Uint, Uint8, Uint16, Uint32, Uint64, Uintptr:
  2545  		return true
  2546  	default:
  2547  		return false
  2548  	}
  2549  }
  2550  
  2551  // Uint returns v's underlying value, as a uint64.
  2552  // It panics if v's Kind is not [Uint], [Uintptr], [Uint8], [Uint16], [Uint32], or [Uint64].
  2553  func (v Value) Uint() uint64 {
  2554  	k := v.kind()
  2555  	p := v.ptr
  2556  	switch k {
  2557  	case Uint:
  2558  		return uint64(*(*uint)(p))
  2559  	case Uint8:
  2560  		return uint64(*(*uint8)(p))
  2561  	case Uint16:
  2562  		return uint64(*(*uint16)(p))
  2563  	case Uint32:
  2564  		return uint64(*(*uint32)(p))
  2565  	case Uint64:
  2566  		return *(*uint64)(p)
  2567  	case Uintptr:
  2568  		return uint64(*(*uintptr)(p))
  2569  	}
  2570  	panic(&ValueError{"reflect.Value.Uint", v.kind()})
  2571  }
  2572  
  2573  //go:nocheckptr
  2574  // This prevents inlining Value.UnsafeAddr when -d=checkptr is enabled,
  2575  // which ensures cmd/compile can recognize unsafe.Pointer(v.UnsafeAddr())
  2576  // and make an exception.
  2577  
  2578  // UnsafeAddr returns a pointer to v's data, as a uintptr.
  2579  // It panics if v is not addressable.
  2580  //
  2581  // It's preferred to use uintptr(Value.Addr().UnsafePointer()) to get the equivalent result.
  2582  func (v Value) UnsafeAddr() uintptr {
  2583  	if v.typ() == nil {
  2584  		panic(&ValueError{"reflect.Value.UnsafeAddr", Invalid})
  2585  	}
  2586  	if v.flag&flagAddr == 0 {
  2587  		panic("reflect.Value.UnsafeAddr of unaddressable value")
  2588  	}
  2589  	// The compiler loses track as it converts to uintptr. Force escape.
  2590  	escapes(v.ptr)
  2591  	return uintptr(v.ptr)
  2592  }
  2593  
  2594  // UnsafePointer returns v's value as a [unsafe.Pointer].
  2595  // It panics if v's Kind is not [Chan], [Func], [Map], [Pointer], [Slice], [String] or [UnsafePointer].
  2596  //
  2597  // If v's Kind is [Func], the returned pointer is an underlying
  2598  // code pointer, but not necessarily enough to identify a
  2599  // single function uniquely. The only guarantee is that the
  2600  // result is zero if and only if v is a nil func Value.
  2601  //
  2602  // If v's Kind is [Slice], the returned pointer is to the first
  2603  // element of the slice. If the slice is nil the returned value
  2604  // is nil.  If the slice is empty but non-nil the return value is non-nil.
  2605  //
  2606  // If v's Kind is [String], the returned pointer is to the first
  2607  // element of the underlying bytes of string.
  2608  func (v Value) UnsafePointer() unsafe.Pointer {
  2609  	k := v.kind()
  2610  	switch k {
  2611  	case Pointer:
  2612  		if !v.typ().Pointers() {
  2613  			// Since it is a not-in-heap pointer, all pointers to the heap are
  2614  			// forbidden! See comment in Value.Elem and issue #48399.
  2615  			if !verifyNotInHeapPtr(*(*uintptr)(v.ptr)) {
  2616  				panic("reflect: reflect.Value.UnsafePointer on an invalid notinheap pointer")
  2617  			}
  2618  			return *(*unsafe.Pointer)(v.ptr)
  2619  		}
  2620  		fallthrough
  2621  	case Chan, Map, UnsafePointer:
  2622  		return v.pointer()
  2623  	case Func:
  2624  		if v.flag&flagMethod != 0 {
  2625  			// As the doc comment says, the returned pointer is an
  2626  			// underlying code pointer but not necessarily enough to
  2627  			// identify a single function uniquely. All method expressions
  2628  			// created via reflect have the same underlying code pointer,
  2629  			// so their Pointers are equal. The function used here must
  2630  			// match the one used in makeMethodValue.
  2631  			code := methodValueCallCodePtr()
  2632  			return *(*unsafe.Pointer)(unsafe.Pointer(&code))
  2633  		}
  2634  		p := v.pointer()
  2635  		// Non-nil func value points at data block.
  2636  		// First word of data block is actual code.
  2637  		if p != nil {
  2638  			p = *(*unsafe.Pointer)(p)
  2639  		}
  2640  		return p
  2641  	case Slice:
  2642  		return (*unsafeheader.Slice)(v.ptr).Data
  2643  	case String:
  2644  		return (*unsafeheader.String)(v.ptr).Data
  2645  	}
  2646  	panic(&ValueError{"reflect.Value.UnsafePointer", v.kind()})
  2647  }
  2648  
  2649  // Fields returns an iterator over each [StructField] of v along with its [Value].
  2650  //
  2651  // The sequence is equivalent to calling [Value.Field] successively
  2652  // for each index i in the range [0, NumField()).
  2653  //
  2654  // It panics if v's Kind is not Struct.
  2655  func (v Value) Fields() iter.Seq2[StructField, Value] {
  2656  	t := v.Type()
  2657  	if t.Kind() != Struct {
  2658  		panic("reflect: Fields of non-struct type " + t.String())
  2659  	}
  2660  	return func(yield func(StructField, Value) bool) {
  2661  		for i := range v.NumField() {
  2662  			if !yield(t.Field(i), v.Field(i)) {
  2663  				return
  2664  			}
  2665  		}
  2666  	}
  2667  }
  2668  
  2669  // Methods returns an iterator over each [Method] of v along with the corresponding
  2670  // method [Value]; this is a function with v bound as the receiver. As such, the
  2671  // receiver shouldn't be included in the arguments to [Value.Call].
  2672  //
  2673  // The sequence is equivalent to calling [Value.Method] successively
  2674  // for each index i in the range [0, NumMethod()).
  2675  //
  2676  // Methods panics if v is a nil interface value.
  2677  //
  2678  // Calling this method will force the linker to retain all exported methods in all packages.
  2679  // This may make the executable binary larger but will not affect execution time.
  2680  func (v Value) Methods() iter.Seq2[Method, Value] {
  2681  	return func(yield func(Method, Value) bool) {
  2682  		rtype := v.Type()
  2683  		for i := range v.NumMethod() {
  2684  			if !yield(rtype.Method(i), v.Method(i)) {
  2685  				return
  2686  			}
  2687  		}
  2688  	}
  2689  }
  2690  
  2691  // StringHeader is the runtime representation of a string.
  2692  // It cannot be used safely or portably and its representation may
  2693  // change in a later release.
  2694  // Moreover, the Data field is not sufficient to guarantee the data
  2695  // it references will not be garbage collected, so programs must keep
  2696  // a separate, correctly typed pointer to the underlying data.
  2697  //
  2698  // Deprecated: Use unsafe.String or unsafe.StringData instead.
  2699  type StringHeader struct {
  2700  	Data uintptr
  2701  	Len  int
  2702  }
  2703  
  2704  // SliceHeader is the runtime representation of a slice.
  2705  // It cannot be used safely or portably and its representation may
  2706  // change in a later release.
  2707  // Moreover, the Data field is not sufficient to guarantee the data
  2708  // it references will not be garbage collected, so programs must keep
  2709  // a separate, correctly typed pointer to the underlying data.
  2710  //
  2711  // Deprecated: Use unsafe.Slice or unsafe.SliceData instead.
  2712  type SliceHeader struct {
  2713  	Data uintptr
  2714  	Len  int
  2715  	Cap  int
  2716  }
  2717  
  2718  func typesMustMatch(what string, t1, t2 Type) {
  2719  	if t1 != t2 {
  2720  		panic(what + ": " + t1.String() + " != " + t2.String())
  2721  	}
  2722  }
  2723  
  2724  // arrayAt returns the i-th element of p,
  2725  // an array whose elements are eltSize bytes wide.
  2726  // The array pointed at by p must have at least i+1 elements:
  2727  // it is invalid (but impossible to check here) to pass i >= len,
  2728  // because then the result will point outside the array.
  2729  // whySafe must explain why i < len. (Passing "i < len" is fine;
  2730  // the benefit is to surface this assumption at the call site.)
  2731  func arrayAt(p unsafe.Pointer, i int, eltSize uintptr, whySafe string) unsafe.Pointer {
  2732  	return add(p, uintptr(i)*eltSize, "i < len")
  2733  }
  2734  
  2735  // Grow increases the slice's capacity, if necessary, to guarantee space for
  2736  // another n elements. After Grow(n), at least n elements can be appended
  2737  // to the slice without another allocation.
  2738  //
  2739  // It panics if v's Kind is not a [Slice], or if n is negative or too large to
  2740  // allocate the memory, or if [Value.CanSet] returns false.
  2741  func (v Value) Grow(n int) {
  2742  	v.mustBeAssignable()
  2743  	v.mustBe(Slice)
  2744  	v.grow(n)
  2745  }
  2746  
  2747  // grow is identical to Grow but does not check for assignability.
  2748  func (v Value) grow(n int) {
  2749  	p := (*unsafeheader.Slice)(v.ptr)
  2750  	switch {
  2751  	case n < 0:
  2752  		panic("reflect.Value.Grow: negative len")
  2753  	case p.Len+n < 0:
  2754  		panic("reflect.Value.Grow: slice overflow")
  2755  	case p.Len+n > p.Cap:
  2756  		t := v.typ().Elem()
  2757  		*p = growslice(t, *p, n)
  2758  	}
  2759  }
  2760  
  2761  // extendSlice extends a slice by n elements.
  2762  //
  2763  // Unlike Value.grow, which modifies the slice in place and
  2764  // does not change the length of the slice in place,
  2765  // extendSlice returns a new slice value with the length
  2766  // incremented by the number of specified elements.
  2767  func (v Value) extendSlice(n int) Value {
  2768  	v.mustBeExported()
  2769  	v.mustBe(Slice)
  2770  
  2771  	// Shallow copy the slice header to avoid mutating the source slice.
  2772  	sh := *(*unsafeheader.Slice)(v.ptr)
  2773  	s := &sh
  2774  	v.ptr = unsafe.Pointer(s)
  2775  	v.flag = flagIndir | flag(Slice) // equivalent flag to MakeSlice
  2776  
  2777  	v.grow(n) // fine to treat as assignable since we allocate a new slice header
  2778  	s.Len += n
  2779  	return v
  2780  }
  2781  
  2782  // Clear clears the contents of a map or zeros the contents of a slice.
  2783  //
  2784  // It panics if v's Kind is not [Map] or [Slice].
  2785  func (v Value) Clear() {
  2786  	switch v.Kind() {
  2787  	case Slice:
  2788  		sh := *(*unsafeheader.Slice)(v.ptr)
  2789  		st := (*sliceType)(unsafe.Pointer(v.typ()))
  2790  		typedarrayclear(st.Elem, sh.Data, sh.Len)
  2791  	case Map:
  2792  		mapclear(v.typ(), v.pointer())
  2793  	default:
  2794  		panic(&ValueError{"reflect.Value.Clear", v.Kind()})
  2795  	}
  2796  }
  2797  
  2798  // Append appends the values x to a slice s and returns the resulting slice.
  2799  // As in Go, each x's value must be assignable to the slice's element type.
  2800  func Append(s Value, x ...Value) Value {
  2801  	s.mustBe(Slice)
  2802  	n := s.Len()
  2803  	s = s.extendSlice(len(x))
  2804  	for i, v := range x {
  2805  		s.Index(n + i).Set(v)
  2806  	}
  2807  	return s
  2808  }
  2809  
  2810  // AppendSlice appends a slice t to a slice s and returns the resulting slice.
  2811  // The slices s and t must have the same element type.
  2812  func AppendSlice(s, t Value) Value {
  2813  	s.mustBe(Slice)
  2814  	t.mustBe(Slice)
  2815  	typesMustMatch("reflect.AppendSlice", s.Type().Elem(), t.Type().Elem())
  2816  	ns := s.Len()
  2817  	nt := t.Len()
  2818  	s = s.extendSlice(nt)
  2819  	Copy(s.Slice(ns, ns+nt), t)
  2820  	return s
  2821  }
  2822  
  2823  // Copy copies the contents of src into dst until either
  2824  // dst has been filled or src has been exhausted.
  2825  // It returns the number of elements copied.
  2826  // Dst and src each must have kind [Slice] or [Array], and
  2827  // dst and src must have the same element type.
  2828  // It dst is an [Array], it panics if [Value.CanSet] returns false.
  2829  //
  2830  // As a special case, src can have kind [String] if the element type of dst is kind [Uint8].
  2831  func Copy(dst, src Value) int {
  2832  	dk := dst.kind()
  2833  	if dk != Array && dk != Slice {
  2834  		panic(&ValueError{"reflect.Copy", dk})
  2835  	}
  2836  	if dk == Array {
  2837  		dst.mustBeAssignable()
  2838  	}
  2839  	dst.mustBeExported()
  2840  
  2841  	sk := src.kind()
  2842  	var stringCopy bool
  2843  	if sk != Array && sk != Slice {
  2844  		stringCopy = sk == String && dst.typ().Elem().Kind() == abi.Uint8
  2845  		if !stringCopy {
  2846  			panic(&ValueError{"reflect.Copy", sk})
  2847  		}
  2848  	}
  2849  	src.mustBeExported()
  2850  
  2851  	de := dst.typ().Elem()
  2852  	if !stringCopy {
  2853  		se := src.typ().Elem()
  2854  		typesMustMatch("reflect.Copy", toType(de), toType(se))
  2855  	}
  2856  
  2857  	var ds, ss unsafeheader.Slice
  2858  	if dk == Array {
  2859  		ds.Data = dst.ptr
  2860  		ds.Len = dst.Len()
  2861  		ds.Cap = ds.Len
  2862  	} else {
  2863  		ds = *(*unsafeheader.Slice)(dst.ptr)
  2864  	}
  2865  	if sk == Array {
  2866  		ss.Data = src.ptr
  2867  		ss.Len = src.Len()
  2868  		ss.Cap = ss.Len
  2869  	} else if sk == Slice {
  2870  		ss = *(*unsafeheader.Slice)(src.ptr)
  2871  	} else {
  2872  		sh := *(*unsafeheader.String)(src.ptr)
  2873  		ss.Data = sh.Data
  2874  		ss.Len = sh.Len
  2875  		ss.Cap = sh.Len
  2876  	}
  2877  
  2878  	return typedslicecopy(de.Common(), ds, ss)
  2879  }
  2880  
  2881  // A runtimeSelect is a single case passed to rselect.
  2882  // This must match ../runtime/select.go:/runtimeSelect
  2883  type runtimeSelect struct {
  2884  	dir SelectDir      // SelectSend, SelectRecv or SelectDefault
  2885  	typ *rtype         // channel type
  2886  	ch  unsafe.Pointer // channel
  2887  	val unsafe.Pointer // ptr to data (SendDir) or ptr to receive buffer (RecvDir)
  2888  }
  2889  
  2890  // rselect runs a select. It returns the index of the chosen case.
  2891  // If the case was a receive, val is filled in with the received value.
  2892  // The conventional OK bool indicates whether the receive corresponds
  2893  // to a sent value.
  2894  //
  2895  // rselect generally doesn't escape the runtimeSelect slice, except
  2896  // that for the send case the value to send needs to escape. We don't
  2897  // have a way to represent that in the function signature. So we handle
  2898  // that with a forced escape in function Select.
  2899  //
  2900  //go:noescape
  2901  func rselect([]runtimeSelect) (chosen int, recvOK bool)
  2902  
  2903  // A SelectDir describes the communication direction of a select case.
  2904  type SelectDir int
  2905  
  2906  // NOTE: These values must match ../runtime/select.go:/selectDir.
  2907  
  2908  const (
  2909  	_             SelectDir = iota
  2910  	SelectSend              // case Chan <- Send
  2911  	SelectRecv              // case <-Chan:
  2912  	SelectDefault           // default
  2913  )
  2914  
  2915  // A SelectCase describes a single case in a select operation.
  2916  // The kind of case depends on Dir, the communication direction.
  2917  //
  2918  // If Dir is SelectDefault, the case represents a default case.
  2919  // Chan and Send must be zero Values.
  2920  //
  2921  // If Dir is SelectSend, the case represents a send operation.
  2922  // Normally Chan's underlying value must be a channel, and Send's underlying value must be
  2923  // assignable to the channel's element type. As a special case, if Chan is a zero Value,
  2924  // then the case is ignored, and the field Send will also be ignored and may be either zero
  2925  // or non-zero.
  2926  //
  2927  // If Dir is [SelectRecv], the case represents a receive operation.
  2928  // Normally Chan's underlying value must be a channel and Send must be a zero Value.
  2929  // If Chan is a zero Value, then the case is ignored, but Send must still be a zero Value.
  2930  // When a receive operation is selected, the received Value is returned by Select.
  2931  type SelectCase struct {
  2932  	Dir  SelectDir // direction of case
  2933  	Chan Value     // channel to use (for send or receive)
  2934  	Send Value     // value to send (for send)
  2935  }
  2936  
  2937  // stackAllocSelectCases represents the length of a slice that we
  2938  // pre-allocate in [Select] to avoid heap allocations.
  2939  const stackAllocSelectCases = 4
  2940  
  2941  // Select executes a select operation described by the list of cases.
  2942  // Like the Go select statement, it blocks until at least one of the cases
  2943  // can proceed, makes a uniform pseudo-random choice,
  2944  // and then executes that case. It returns the index of the chosen case
  2945  // and, if that case was a receive operation, the value received and a
  2946  // boolean indicating whether the value corresponds to a send on the channel
  2947  // (as opposed to a zero value received because the channel is closed).
  2948  // Select supports a maximum of 65536 cases.
  2949  func Select(cases []SelectCase) (chosen int, recv Value, recvOK bool) {
  2950  	// This function is specially designed to be inlined, such that when called as:
  2951  	//
  2952  	// Select([]SelectCase{})
  2953  	//
  2954  	// With a slice, that has a compile known length, the runcases slice
  2955  	// will end up being stack allocated, since the compiler can infer
  2956  	// the len([]SelectCase{}).
  2957  	//
  2958  	// We additionaly want to optimize Select(cases) for cases where len(cases)
  2959  	// cannot be infered at compile-time, thus in [select0] we allocate a
  2960  	// [stackAllocSelectCases]-length slice, which will avoid memory allocations
  2961  	// when the len(cases) <= stackAllocSelectCases and len(cases) is not compile-known.
  2962  
  2963  	var runcases []runtimeSelect
  2964  	if len(cases) > stackAllocSelectCases {
  2965  		runcases = make([]runtimeSelect, len(cases))
  2966  	}
  2967  	chosen, recv, recvOK = select0(cases, runcases)
  2968  	return
  2969  }
  2970  
  2971  func select0(cases []SelectCase, runcases []runtimeSelect) (chosen int, recv Value, recvOK bool) {
  2972  	if len(cases) > 65536 {
  2973  		panic("reflect.Select: too many cases (max 65536)")
  2974  	}
  2975  
  2976  	// See [Select] for more details on this.
  2977  	if runcases == nil {
  2978  		runcases = make([]runtimeSelect, len(cases), stackAllocSelectCases)
  2979  	}
  2980  
  2981  	haveDefault := false
  2982  
  2983  	// NOTE: Do not trust that caller is not modifying cases data underfoot.
  2984  	// The range is safe because the caller cannot modify our copy of the len
  2985  	// and each iteration makes its own copy of the value c.
  2986  	for i, c := range cases {
  2987  		rc := &runcases[i]
  2988  		rc.dir = c.Dir
  2989  		switch c.Dir {
  2990  		default:
  2991  			panic("reflect.Select: invalid Dir")
  2992  
  2993  		case SelectDefault: // default
  2994  			if haveDefault {
  2995  				panic("reflect.Select: multiple default cases")
  2996  			}
  2997  			haveDefault = true
  2998  			if c.Chan.IsValid() {
  2999  				panic("reflect.Select: default case has Chan value")
  3000  			}
  3001  			if c.Send.IsValid() {
  3002  				panic("reflect.Select: default case has Send value")
  3003  			}
  3004  
  3005  		case SelectSend:
  3006  			ch := c.Chan
  3007  			if !ch.IsValid() {
  3008  				break
  3009  			}
  3010  			ch.mustBe(Chan)
  3011  			ch.mustBeExported()
  3012  			tt := (*chanType)(unsafe.Pointer(ch.typ()))
  3013  			if ChanDir(tt.Dir)&SendDir == 0 {
  3014  				panic("reflect.Select: SendDir case using recv-only channel")
  3015  			}
  3016  			rc.ch = ch.pointer()
  3017  			rc.typ = toRType(&tt.Type)
  3018  			v := c.Send
  3019  			if !v.IsValid() {
  3020  				panic("reflect.Select: SendDir case missing Send value")
  3021  			}
  3022  			v.mustBeExported()
  3023  			v = v.assignTo("reflect.Select", tt.Elem, nil)
  3024  			if v.flag&flagIndir != 0 {
  3025  				rc.val = v.ptr
  3026  			} else {
  3027  				rc.val = unsafe.Pointer(&v.ptr)
  3028  			}
  3029  			// The value to send needs to escape. See the comment at rselect for
  3030  			// why we need forced escape.
  3031  			escapes(rc.val)
  3032  
  3033  		case SelectRecv:
  3034  			if c.Send.IsValid() {
  3035  				panic("reflect.Select: RecvDir case has Send value")
  3036  			}
  3037  			ch := c.Chan
  3038  			if !ch.IsValid() {
  3039  				break
  3040  			}
  3041  			ch.mustBe(Chan)
  3042  			ch.mustBeExported()
  3043  			tt := (*chanType)(unsafe.Pointer(ch.typ()))
  3044  			if ChanDir(tt.Dir)&RecvDir == 0 {
  3045  				panic("reflect.Select: RecvDir case using send-only channel")
  3046  			}
  3047  			rc.ch = ch.pointer()
  3048  			rc.typ = toRType(&tt.Type)
  3049  			rc.val = unsafe_New(tt.Elem)
  3050  		}
  3051  	}
  3052  
  3053  	chosen, recvOK = rselect(runcases)
  3054  	if runcases[chosen].dir == SelectRecv {
  3055  		tt := (*chanType)(unsafe.Pointer(runcases[chosen].typ))
  3056  		t := tt.Elem
  3057  		p := runcases[chosen].val
  3058  		fl := flag(t.Kind())
  3059  		if !t.IsDirectIface() {
  3060  			recv = Value{t, p, fl | flagIndir}
  3061  		} else {
  3062  			recv = Value{t, *(*unsafe.Pointer)(p), fl}
  3063  		}
  3064  	}
  3065  	return chosen, recv, recvOK
  3066  }
  3067  
  3068  /*
  3069   * constructors
  3070   */
  3071  
  3072  // implemented in package runtime
  3073  
  3074  //go:noescape
  3075  func unsafe_New(*abi.Type) unsafe.Pointer
  3076  
  3077  //go:noescape
  3078  func unsafe_NewArray(*abi.Type, int) unsafe.Pointer
  3079  
  3080  // MakeSlice creates a new zero-initialized slice value
  3081  // for the specified slice type, length, and capacity.
  3082  func MakeSlice(typ Type, len, cap int) Value {
  3083  	if typ.Kind() != Slice {
  3084  		panic("reflect.MakeSlice of non-slice type")
  3085  	}
  3086  	if len < 0 {
  3087  		panic("reflect.MakeSlice: negative len")
  3088  	}
  3089  	if cap < 0 {
  3090  		panic("reflect.MakeSlice: negative cap")
  3091  	}
  3092  	if len > cap {
  3093  		panic("reflect.MakeSlice: len > cap")
  3094  	}
  3095  
  3096  	s := unsafeheader.Slice{Data: unsafe_NewArray(&(typ.Elem().(*rtype).t), cap), Len: len, Cap: cap}
  3097  	return Value{&typ.(*rtype).t, unsafe.Pointer(&s), flagIndir | flag(Slice)}
  3098  }
  3099  
  3100  // SliceAt returns a [Value] representing a slice whose underlying
  3101  // data starts at p, with length and capacity equal to n.
  3102  //
  3103  // This is like [unsafe.Slice].
  3104  func SliceAt(typ Type, p unsafe.Pointer, n int) Value {
  3105  	unsafeslice(typ.common(), p, n)
  3106  	s := unsafeheader.Slice{Data: p, Len: n, Cap: n}
  3107  	return Value{SliceOf(typ).common(), unsafe.Pointer(&s), flagIndir | flag(Slice)}
  3108  }
  3109  
  3110  // MakeChan creates a new channel with the specified type and buffer size.
  3111  func MakeChan(typ Type, buffer int) Value {
  3112  	if typ.Kind() != Chan {
  3113  		panic("reflect.MakeChan of non-chan type")
  3114  	}
  3115  	if buffer < 0 {
  3116  		panic("reflect.MakeChan: negative buffer size")
  3117  	}
  3118  	if typ.ChanDir() != BothDir {
  3119  		panic("reflect.MakeChan: unidirectional channel type")
  3120  	}
  3121  	t := typ.common()
  3122  	ch := makechan(t, buffer)
  3123  	return Value{t, ch, flag(Chan)}
  3124  }
  3125  
  3126  // MakeMap creates a new map with the specified type.
  3127  func MakeMap(typ Type) Value {
  3128  	return MakeMapWithSize(typ, 0)
  3129  }
  3130  
  3131  // MakeMapWithSize creates a new map with the specified type
  3132  // and initial space for approximately n elements.
  3133  func MakeMapWithSize(typ Type, n int) Value {
  3134  	if typ.Kind() != Map {
  3135  		panic("reflect.MakeMapWithSize of non-map type")
  3136  	}
  3137  	t := typ.common()
  3138  	m := makemap(t, n)
  3139  	return Value{t, m, flag(Map)}
  3140  }
  3141  
  3142  // Indirect returns the value that v points to.
  3143  // If v is a nil pointer, Indirect returns a zero Value.
  3144  // If v is not a pointer, Indirect returns v.
  3145  func Indirect(v Value) Value {
  3146  	if v.Kind() != Pointer {
  3147  		return v
  3148  	}
  3149  	return v.Elem()
  3150  }
  3151  
  3152  // ValueOf returns a new Value initialized to the concrete value
  3153  // stored in the interface i. ValueOf(nil) returns the zero Value.
  3154  func ValueOf(i any) Value {
  3155  	if i == nil {
  3156  		return Value{}
  3157  	}
  3158  	return unpackEface(i)
  3159  }
  3160  
  3161  // Zero returns a Value representing the zero value for the specified type.
  3162  // The result is different from the zero value of the Value struct,
  3163  // which represents no value at all.
  3164  // For example, Zero(TypeOf(42)) returns a Value with Kind [Int] and value 0.
  3165  // The returned value is neither addressable nor settable.
  3166  func Zero(typ Type) Value {
  3167  	if typ == nil {
  3168  		panic("reflect: Zero(nil)")
  3169  	}
  3170  	t := &typ.(*rtype).t
  3171  	fl := flag(t.Kind())
  3172  	if !t.IsDirectIface() {
  3173  		var p unsafe.Pointer
  3174  		if t.Size() <= abi.ZeroValSize {
  3175  			p = unsafe.Pointer(&zeroVal[0])
  3176  		} else {
  3177  			p = unsafe_New(t)
  3178  		}
  3179  		return Value{t, p, fl | flagIndir}
  3180  	}
  3181  	return Value{t, nil, fl}
  3182  }
  3183  
  3184  //go:linkname zeroVal runtime.zeroVal
  3185  var zeroVal [abi.ZeroValSize]byte
  3186  
  3187  // New returns a Value representing a pointer to a new zero value
  3188  // for the specified type. That is, the returned Value's Type is [PointerTo](typ).
  3189  func New(typ Type) Value {
  3190  	if typ == nil {
  3191  		panic("reflect: New(nil)")
  3192  	}
  3193  	t := &typ.(*rtype).t
  3194  	pt := ptrTo(t)
  3195  	if !pt.IsDirectIface() {
  3196  		// This is a pointer to a not-in-heap type.
  3197  		panic("reflect: New of type that may not be allocated in heap (possibly undefined cgo C type)")
  3198  	}
  3199  	ptr := unsafe_New(t)
  3200  	fl := flag(Pointer)
  3201  	return Value{pt, ptr, fl}
  3202  }
  3203  
  3204  // NewAt returns a Value representing a pointer to a value of the
  3205  // specified type, using p as that pointer.
  3206  func NewAt(typ Type, p unsafe.Pointer) Value {
  3207  	fl := flag(Pointer)
  3208  	t := typ.(*rtype)
  3209  	return Value{t.ptrTo(), p, fl}
  3210  }
  3211  
  3212  // assignTo returns a value v that can be assigned directly to dst.
  3213  // It panics if v is not assignable to dst.
  3214  // For a conversion to an interface type, target, if not nil,
  3215  // is a suggested scratch space to use.
  3216  // target must be initialized memory (or nil).
  3217  func (v Value) assignTo(context string, dst *abi.Type, target unsafe.Pointer) Value {
  3218  	if v.flag&flagMethod != 0 {
  3219  		v = makeMethodValue(context, v)
  3220  	}
  3221  
  3222  	switch {
  3223  	case directlyAssignable(dst, v.typ()):
  3224  		// Overwrite type so that they match.
  3225  		// Same memory layout, so no harm done.
  3226  		fl := v.flag&(flagAddr|flagIndir) | v.flag.ro()
  3227  		fl |= flag(dst.Kind())
  3228  		return Value{dst, v.ptr, fl}
  3229  
  3230  	case implements(dst, v.typ()):
  3231  		if v.Kind() == Interface && v.IsNil() {
  3232  			// A nil ReadWriter passed to nil Reader is OK,
  3233  			// but using ifaceE2I below will panic.
  3234  			// Avoid the panic by returning a nil dst (e.g., Reader) explicitly.
  3235  			return Value{dst, nil, flag(Interface)}
  3236  		}
  3237  		x := valueInterface(v, false)
  3238  		if target == nil {
  3239  			target = unsafe_New(dst)
  3240  		}
  3241  		if dst.NumMethod() == 0 {
  3242  			*(*any)(target) = x
  3243  		} else {
  3244  			ifaceE2I(dst, x, target)
  3245  		}
  3246  		return Value{dst, target, flagIndir | flag(Interface)}
  3247  	}
  3248  
  3249  	// Failed.
  3250  	panic(context + ": value of type " + stringFor(v.typ()) + " is not assignable to type " + stringFor(dst))
  3251  }
  3252  
  3253  // Convert returns the value v converted to type t.
  3254  // If the usual Go conversion rules do not allow conversion
  3255  // of the value v to type t, or if converting v to type t panics, Convert panics.
  3256  func (v Value) Convert(t Type) Value {
  3257  	if v.flag&flagMethod != 0 {
  3258  		v = makeMethodValue("Convert", v)
  3259  	}
  3260  	op := convertOp(t.common(), v.typ())
  3261  	if op == nil {
  3262  		panic("reflect.Value.Convert: value of type " + stringFor(v.typ()) + " cannot be converted to type " + t.String())
  3263  	}
  3264  	return op(v, t)
  3265  }
  3266  
  3267  // CanConvert reports whether the value v can be converted to type t.
  3268  // If v.CanConvert(t) returns true then v.Convert(t) will not panic.
  3269  func (v Value) CanConvert(t Type) bool {
  3270  	vt := v.Type()
  3271  	if !vt.ConvertibleTo(t) {
  3272  		return false
  3273  	}
  3274  	// Converting from slice to array or to pointer-to-array can panic
  3275  	// depending on the value.
  3276  	switch {
  3277  	case vt.Kind() == Slice && t.Kind() == Array:
  3278  		if t.Len() > v.Len() {
  3279  			return false
  3280  		}
  3281  	case vt.Kind() == Slice && t.Kind() == Pointer && t.Elem().Kind() == Array:
  3282  		n := t.Elem().Len()
  3283  		if n > v.Len() {
  3284  			return false
  3285  		}
  3286  	}
  3287  	return true
  3288  }
  3289  
  3290  // Comparable reports whether the value v is comparable.
  3291  // If the type of v is an interface, this checks the dynamic type.
  3292  // If this reports true then v.Interface() == x will not panic for any x,
  3293  // nor will v.Equal(u) for any Value u.
  3294  func (v Value) Comparable() bool {
  3295  	k := v.Kind()
  3296  	switch k {
  3297  	case Invalid:
  3298  		return false
  3299  
  3300  	case Array:
  3301  		switch v.Type().Elem().Kind() {
  3302  		case Interface, Array, Struct:
  3303  			for i := 0; i < v.Type().Len(); i++ {
  3304  				if !v.Index(i).Comparable() {
  3305  					return false
  3306  				}
  3307  			}
  3308  			return true
  3309  		}
  3310  		return v.Type().Comparable()
  3311  
  3312  	case Interface:
  3313  		return v.IsNil() || v.Elem().Comparable()
  3314  
  3315  	case Struct:
  3316  		for _, value := range v.Fields() {
  3317  			if !value.Comparable() {
  3318  				return false
  3319  			}
  3320  		}
  3321  		return true
  3322  
  3323  	default:
  3324  		return v.Type().Comparable()
  3325  	}
  3326  }
  3327  
  3328  // Equal reports true if v is equal to u.
  3329  // For two invalid values, Equal will report true.
  3330  // For an interface value, Equal will compare the value within the interface.
  3331  // Otherwise, If the values have different types, Equal will report false.
  3332  // Otherwise, for arrays and structs Equal will compare each element in order,
  3333  // and report false if it finds non-equal elements.
  3334  // During all comparisons, if values of the same type are compared,
  3335  // and the type is not comparable, Equal will panic.
  3336  func (v Value) Equal(u Value) bool {
  3337  	if v.Kind() == Interface {
  3338  		v = v.Elem()
  3339  	}
  3340  	if u.Kind() == Interface {
  3341  		u = u.Elem()
  3342  	}
  3343  
  3344  	if !v.IsValid() || !u.IsValid() {
  3345  		return v.IsValid() == u.IsValid()
  3346  	}
  3347  
  3348  	if v.Kind() != u.Kind() || v.Type() != u.Type() {
  3349  		return false
  3350  	}
  3351  
  3352  	// Handle each Kind directly rather than calling valueInterface
  3353  	// to avoid allocating.
  3354  	switch v.Kind() {
  3355  	default:
  3356  		panic("reflect.Value.Equal: invalid Kind")
  3357  	case Bool:
  3358  		return v.Bool() == u.Bool()
  3359  	case Int, Int8, Int16, Int32, Int64:
  3360  		return v.Int() == u.Int()
  3361  	case Uint, Uint8, Uint16, Uint32, Uint64, Uintptr:
  3362  		return v.Uint() == u.Uint()
  3363  	case Float32, Float64:
  3364  		return v.Float() == u.Float()
  3365  	case Complex64, Complex128:
  3366  		return v.Complex() == u.Complex()
  3367  	case String:
  3368  		return v.String() == u.String()
  3369  	case Chan, Pointer, UnsafePointer:
  3370  		return v.Pointer() == u.Pointer()
  3371  	case Array:
  3372  		// u and v have the same type so they have the same length
  3373  		vl := v.Len()
  3374  		if vl == 0 {
  3375  			// panic on [0]func()
  3376  			if !v.Type().Elem().Comparable() {
  3377  				break
  3378  			}
  3379  			return true
  3380  		}
  3381  		for i := 0; i < vl; i++ {
  3382  			if !v.Index(i).Equal(u.Index(i)) {
  3383  				return false
  3384  			}
  3385  		}
  3386  		return true
  3387  	case Struct:
  3388  		// u and v have the same type so they have the same fields
  3389  		nf := v.NumField()
  3390  		for i := 0; i < nf; i++ {
  3391  			if !v.Field(i).Equal(u.Field(i)) {
  3392  				return false
  3393  			}
  3394  		}
  3395  		return true
  3396  	case Func, Map, Slice:
  3397  		break
  3398  	}
  3399  	panic("reflect.Value.Equal: values of type " + v.Type().String() + " are not comparable")
  3400  }
  3401  
  3402  // convertOp returns the function to convert a value of type src
  3403  // to a value of type dst. If the conversion is illegal, convertOp returns nil.
  3404  func convertOp(dst, src *abi.Type) func(Value, Type) Value {
  3405  	switch Kind(src.Kind()) {
  3406  	case Int, Int8, Int16, Int32, Int64:
  3407  		switch Kind(dst.Kind()) {
  3408  		case Int, Int8, Int16, Int32, Int64, Uint, Uint8, Uint16, Uint32, Uint64, Uintptr:
  3409  			return cvtInt
  3410  		case Float32, Float64:
  3411  			return cvtIntFloat
  3412  		case String:
  3413  			return cvtIntString
  3414  		}
  3415  
  3416  	case Uint, Uint8, Uint16, Uint32, Uint64, Uintptr:
  3417  		switch Kind(dst.Kind()) {
  3418  		case Int, Int8, Int16, Int32, Int64, Uint, Uint8, Uint16, Uint32, Uint64, Uintptr:
  3419  			return cvtUint
  3420  		case Float32, Float64:
  3421  			return cvtUintFloat
  3422  		case String:
  3423  			return cvtUintString
  3424  		}
  3425  
  3426  	case Float32, Float64:
  3427  		switch Kind(dst.Kind()) {
  3428  		case Int, Int8, Int16, Int32, Int64:
  3429  			return cvtFloatInt
  3430  		case Uint, Uint8, Uint16, Uint32, Uint64, Uintptr:
  3431  			return cvtFloatUint
  3432  		case Float32, Float64:
  3433  			return cvtFloat
  3434  		}
  3435  
  3436  	case Complex64, Complex128:
  3437  		switch Kind(dst.Kind()) {
  3438  		case Complex64, Complex128:
  3439  			return cvtComplex
  3440  		}
  3441  
  3442  	case String:
  3443  		if dst.Kind() == abi.Slice {
  3444  			switch Kind(dst.Elem().Kind()) {
  3445  			case Uint8:
  3446  				return cvtStringBytes
  3447  			case Int32:
  3448  				return cvtStringRunes
  3449  			}
  3450  		}
  3451  
  3452  	case Slice:
  3453  		if dst.Kind() == abi.String {
  3454  			switch Kind(src.Elem().Kind()) {
  3455  			case Uint8:
  3456  				return cvtBytesString
  3457  			case Int32:
  3458  				return cvtRunesString
  3459  			}
  3460  		}
  3461  		// "x is a slice, T is a pointer-to-array type,
  3462  		// and the slice and array types have identical element types."
  3463  		if dst.Kind() == abi.Pointer && dst.Elem().Kind() == abi.Array && src.Elem() == dst.Elem().Elem() {
  3464  			return cvtSliceArrayPtr
  3465  		}
  3466  		// "x is a slice, T is an array type,
  3467  		// and the slice and array types have identical element types."
  3468  		if dst.Kind() == abi.Array && src.Elem() == dst.Elem() {
  3469  			return cvtSliceArray
  3470  		}
  3471  
  3472  	case Chan:
  3473  		if dst.Kind() == abi.Chan && specialChannelAssignability(dst, src) {
  3474  			return cvtDirect
  3475  		}
  3476  	}
  3477  
  3478  	// dst and src have same underlying type.
  3479  	if haveIdenticalUnderlyingType(dst, src, false) {
  3480  		return cvtDirect
  3481  	}
  3482  
  3483  	// dst and src are non-defined pointer types with same underlying base type.
  3484  	if dst.Kind() == abi.Pointer && nameFor(dst) == "" &&
  3485  		src.Kind() == abi.Pointer && nameFor(src) == "" &&
  3486  		haveIdenticalUnderlyingType(elem(dst), elem(src), false) {
  3487  		return cvtDirect
  3488  	}
  3489  
  3490  	if implements(dst, src) {
  3491  		if src.Kind() == abi.Interface {
  3492  			return cvtI2I
  3493  		}
  3494  		return cvtT2I
  3495  	}
  3496  
  3497  	return nil
  3498  }
  3499  
  3500  // makeInt returns a Value of type t equal to bits (possibly truncated),
  3501  // where t is a signed or unsigned int type.
  3502  func makeInt(f flag, bits uint64, t Type) Value {
  3503  	typ := t.common()
  3504  	ptr := unsafe_New(typ)
  3505  	switch typ.Size() {
  3506  	case 1:
  3507  		*(*uint8)(ptr) = uint8(bits)
  3508  	case 2:
  3509  		*(*uint16)(ptr) = uint16(bits)
  3510  	case 4:
  3511  		*(*uint32)(ptr) = uint32(bits)
  3512  	case 8:
  3513  		*(*uint64)(ptr) = bits
  3514  	}
  3515  	return Value{typ, ptr, f | flagIndir | flag(typ.Kind())}
  3516  }
  3517  
  3518  // makeFloat returns a Value of type t equal to v (possibly truncated to float32),
  3519  // where t is a float32 or float64 type.
  3520  func makeFloat(f flag, v float64, t Type) Value {
  3521  	typ := t.common()
  3522  	ptr := unsafe_New(typ)
  3523  	switch typ.Size() {
  3524  	case 4:
  3525  		*(*float32)(ptr) = float32(v)
  3526  	case 8:
  3527  		*(*float64)(ptr) = v
  3528  	}
  3529  	return Value{typ, ptr, f | flagIndir | flag(typ.Kind())}
  3530  }
  3531  
  3532  // makeFloat32 returns a Value of type t equal to v, where t is a float32 type.
  3533  func makeFloat32(f flag, v float32, t Type) Value {
  3534  	typ := t.common()
  3535  	ptr := unsafe_New(typ)
  3536  	*(*float32)(ptr) = v
  3537  	return Value{typ, ptr, f | flagIndir | flag(typ.Kind())}
  3538  }
  3539  
  3540  // makeComplex returns a Value of type t equal to v (possibly truncated to complex64),
  3541  // where t is a complex64 or complex128 type.
  3542  func makeComplex(f flag, v complex128, t Type) Value {
  3543  	typ := t.common()
  3544  	ptr := unsafe_New(typ)
  3545  	switch typ.Size() {
  3546  	case 8:
  3547  		*(*complex64)(ptr) = complex64(v)
  3548  	case 16:
  3549  		*(*complex128)(ptr) = v
  3550  	}
  3551  	return Value{typ, ptr, f | flagIndir | flag(typ.Kind())}
  3552  }
  3553  
  3554  func makeString(f flag, v string, t Type) Value {
  3555  	ret := New(t).Elem()
  3556  	ret.SetString(v)
  3557  	ret.flag = ret.flag&^flagAddr | f
  3558  	return ret
  3559  }
  3560  
  3561  func makeBytes(f flag, v []byte, t Type) Value {
  3562  	ret := New(t).Elem()
  3563  	ret.SetBytes(v)
  3564  	ret.flag = ret.flag&^flagAddr | f
  3565  	return ret
  3566  }
  3567  
  3568  func makeRunes(f flag, v []rune, t Type) Value {
  3569  	ret := New(t).Elem()
  3570  	ret.setRunes(v)
  3571  	ret.flag = ret.flag&^flagAddr | f
  3572  	return ret
  3573  }
  3574  
  3575  // These conversion functions are returned by convertOp
  3576  // for classes of conversions. For example, the first function, cvtInt,
  3577  // takes any value v of signed int type and returns the value converted
  3578  // to type t, where t is any signed or unsigned int type.
  3579  
  3580  // convertOp: intXX -> [u]intXX
  3581  func cvtInt(v Value, t Type) Value {
  3582  	return makeInt(v.flag.ro(), uint64(v.Int()), t)
  3583  }
  3584  
  3585  // convertOp: uintXX -> [u]intXX
  3586  func cvtUint(v Value, t Type) Value {
  3587  	return makeInt(v.flag.ro(), v.Uint(), t)
  3588  }
  3589  
  3590  // convertOp: floatXX -> intXX
  3591  func cvtFloatInt(v Value, t Type) Value {
  3592  	return makeInt(v.flag.ro(), uint64(int64(v.Float())), t)
  3593  }
  3594  
  3595  // convertOp: floatXX -> uintXX
  3596  func cvtFloatUint(v Value, t Type) Value {
  3597  	return makeInt(v.flag.ro(), uint64(v.Float()), t)
  3598  }
  3599  
  3600  // convertOp: intXX -> floatXX
  3601  func cvtIntFloat(v Value, t Type) Value {
  3602  	return makeFloat(v.flag.ro(), float64(v.Int()), t)
  3603  }
  3604  
  3605  // convertOp: uintXX -> floatXX
  3606  func cvtUintFloat(v Value, t Type) Value {
  3607  	return makeFloat(v.flag.ro(), float64(v.Uint()), t)
  3608  }
  3609  
  3610  // convertOp: floatXX -> floatXX
  3611  func cvtFloat(v Value, t Type) Value {
  3612  	if v.Type().Kind() == Float32 && t.Kind() == Float32 {
  3613  		// Don't do any conversion if both types have underlying type float32.
  3614  		// This avoids converting to float64 and back, which will
  3615  		// convert a signaling NaN to a quiet NaN. See issue 36400.
  3616  		return makeFloat32(v.flag.ro(), *(*float32)(v.ptr), t)
  3617  	}
  3618  	return makeFloat(v.flag.ro(), v.Float(), t)
  3619  }
  3620  
  3621  // convertOp: complexXX -> complexXX
  3622  func cvtComplex(v Value, t Type) Value {
  3623  	return makeComplex(v.flag.ro(), v.Complex(), t)
  3624  }
  3625  
  3626  // convertOp: intXX -> string
  3627  func cvtIntString(v Value, t Type) Value {
  3628  	s := "\uFFFD"
  3629  	if x := v.Int(); int64(rune(x)) == x {
  3630  		s = string(rune(x))
  3631  	}
  3632  	return makeString(v.flag.ro(), s, t)
  3633  }
  3634  
  3635  // convertOp: uintXX -> string
  3636  func cvtUintString(v Value, t Type) Value {
  3637  	s := "\uFFFD"
  3638  	if x := v.Uint(); uint64(rune(x)) == x {
  3639  		s = string(rune(x))
  3640  	}
  3641  	return makeString(v.flag.ro(), s, t)
  3642  }
  3643  
  3644  // convertOp: []byte -> string
  3645  func cvtBytesString(v Value, t Type) Value {
  3646  	return makeString(v.flag.ro(), string(v.Bytes()), t)
  3647  }
  3648  
  3649  // convertOp: string -> []byte
  3650  func cvtStringBytes(v Value, t Type) Value {
  3651  	return makeBytes(v.flag.ro(), []byte(v.String()), t)
  3652  }
  3653  
  3654  // convertOp: []rune -> string
  3655  func cvtRunesString(v Value, t Type) Value {
  3656  	return makeString(v.flag.ro(), string(v.runes()), t)
  3657  }
  3658  
  3659  // convertOp: string -> []rune
  3660  func cvtStringRunes(v Value, t Type) Value {
  3661  	return makeRunes(v.flag.ro(), []rune(v.String()), t)
  3662  }
  3663  
  3664  // convertOp: []T -> *[N]T
  3665  func cvtSliceArrayPtr(v Value, t Type) Value {
  3666  	n := t.Elem().Len()
  3667  	if n > v.Len() {
  3668  		panic("reflect: cannot convert slice with length " + strconv.Itoa(v.Len()) + " to pointer to array with length " + strconv.Itoa(n))
  3669  	}
  3670  	h := (*unsafeheader.Slice)(v.ptr)
  3671  	return Value{t.common(), h.Data, v.flag&^(flagIndir|flagAddr|flagKindMask) | flag(Pointer)}
  3672  }
  3673  
  3674  // convertOp: []T -> [N]T
  3675  func cvtSliceArray(v Value, t Type) Value {
  3676  	n := t.Len()
  3677  	if n > v.Len() {
  3678  		panic("reflect: cannot convert slice with length " + strconv.Itoa(v.Len()) + " to array with length " + strconv.Itoa(n))
  3679  	}
  3680  	h := (*unsafeheader.Slice)(v.ptr)
  3681  	typ := t.common()
  3682  	ptr := h.Data
  3683  	c := unsafe_New(typ)
  3684  	typedmemmove(typ, c, ptr)
  3685  	ptr = c
  3686  
  3687  	return Value{typ, ptr, v.flag&^(flagAddr|flagKindMask) | flag(Array)}
  3688  }
  3689  
  3690  // convertOp: direct copy
  3691  func cvtDirect(v Value, typ Type) Value {
  3692  	f := v.flag
  3693  	t := typ.common()
  3694  	ptr := v.ptr
  3695  	if f&flagAddr != 0 {
  3696  		// indirect, mutable word - make a copy
  3697  		c := unsafe_New(t)
  3698  		typedmemmove(t, c, ptr)
  3699  		ptr = c
  3700  		f &^= flagAddr
  3701  	}
  3702  	return Value{t, ptr, v.flag.ro() | f} // v.flag.ro()|f == f?
  3703  }
  3704  
  3705  // convertOp: concrete -> interface
  3706  func cvtT2I(v Value, typ Type) Value {
  3707  	target := unsafe_New(typ.common())
  3708  	x := valueInterface(v, false)
  3709  	if typ.NumMethod() == 0 {
  3710  		*(*any)(target) = x
  3711  	} else {
  3712  		ifaceE2I(typ.common(), x, target)
  3713  	}
  3714  	return Value{typ.common(), target, v.flag.ro() | flagIndir | flag(Interface)}
  3715  }
  3716  
  3717  // convertOp: interface -> interface
  3718  func cvtI2I(v Value, typ Type) Value {
  3719  	if v.IsNil() {
  3720  		ret := Zero(typ)
  3721  		ret.flag |= v.flag.ro()
  3722  		return ret
  3723  	}
  3724  	return cvtT2I(v.Elem(), typ)
  3725  }
  3726  
  3727  // implemented in ../runtime
  3728  //
  3729  //go:noescape
  3730  func chancap(ch unsafe.Pointer) int
  3731  
  3732  //go:noescape
  3733  func chanclose(ch unsafe.Pointer)
  3734  
  3735  //go:noescape
  3736  func chanlen(ch unsafe.Pointer) int
  3737  
  3738  // Note: some of the noescape annotations below are technically a lie,
  3739  // but safe in the context of this package. Functions like chansend0
  3740  // and mapassign0 don't escape the referent, but may escape anything
  3741  // the referent points to (they do shallow copies of the referent).
  3742  // We add a 0 to their names and wrap them in functions with the
  3743  // proper escape behavior.
  3744  
  3745  //go:noescape
  3746  func chanrecv(ch unsafe.Pointer, nb bool, val unsafe.Pointer) (selected, received bool)
  3747  
  3748  //go:noescape
  3749  func chansend0(ch unsafe.Pointer, val unsafe.Pointer, nb bool) bool
  3750  
  3751  func chansend(ch unsafe.Pointer, val unsafe.Pointer, nb bool) bool {
  3752  	contentEscapes(val)
  3753  	return chansend0(ch, val, nb)
  3754  }
  3755  
  3756  func makechan(typ *abi.Type, size int) (ch unsafe.Pointer)
  3757  func makemap(t *abi.Type, cap int) (m unsafe.Pointer)
  3758  
  3759  //go:noescape
  3760  func mapaccess(t *abi.Type, m unsafe.Pointer, key unsafe.Pointer) (val unsafe.Pointer)
  3761  
  3762  //go:noescape
  3763  func mapaccess_faststr(t *abi.Type, m unsafe.Pointer, key string) (val unsafe.Pointer)
  3764  
  3765  //go:noescape
  3766  func mapassign0(t *abi.Type, m unsafe.Pointer, key, val unsafe.Pointer)
  3767  
  3768  // mapassign should be an internal detail,
  3769  // but widely used packages access it using linkname.
  3770  // Notable members of the hall of shame include:
  3771  //   - github.com/modern-go/reflect2
  3772  //   - github.com/goccy/go-json
  3773  //
  3774  // Do not remove or change the type signature.
  3775  // See go.dev/issue/67401.
  3776  //
  3777  //go:linkname mapassign
  3778  func mapassign(t *abi.Type, m unsafe.Pointer, key, val unsafe.Pointer) {
  3779  	contentEscapes(key)
  3780  	contentEscapes(val)
  3781  	mapassign0(t, m, key, val)
  3782  }
  3783  
  3784  //go:noescape
  3785  func mapassign_faststr0(t *abi.Type, m unsafe.Pointer, key string, val unsafe.Pointer)
  3786  
  3787  func mapassign_faststr(t *abi.Type, m unsafe.Pointer, key string, val unsafe.Pointer) {
  3788  	contentEscapes((*unsafeheader.String)(unsafe.Pointer(&key)).Data)
  3789  	contentEscapes(val)
  3790  	mapassign_faststr0(t, m, key, val)
  3791  }
  3792  
  3793  //go:noescape
  3794  func mapdelete(t *abi.Type, m unsafe.Pointer, key unsafe.Pointer)
  3795  
  3796  //go:noescape
  3797  func mapdelete_faststr(t *abi.Type, m unsafe.Pointer, key string)
  3798  
  3799  //go:noescape
  3800  func maplen(m unsafe.Pointer) int
  3801  
  3802  func mapclear(t *abi.Type, m unsafe.Pointer)
  3803  
  3804  // call calls fn with "stackArgsSize" bytes of stack arguments laid out
  3805  // at stackArgs and register arguments laid out in regArgs. frameSize is
  3806  // the total amount of stack space that will be reserved by call, so this
  3807  // should include enough space to spill register arguments to the stack in
  3808  // case of preemption.
  3809  //
  3810  // After fn returns, call copies stackArgsSize-stackRetOffset result bytes
  3811  // back into stackArgs+stackRetOffset before returning, for any return
  3812  // values passed on the stack. Register-based return values will be found
  3813  // in the same regArgs structure.
  3814  //
  3815  // regArgs must also be prepared with an appropriate ReturnIsPtr bitmap
  3816  // indicating which registers will contain pointer-valued return values. The
  3817  // purpose of this bitmap is to keep pointers visible to the GC between
  3818  // returning from reflectcall and actually using them.
  3819  //
  3820  // If copying result bytes back from the stack, the caller must pass the
  3821  // argument frame type as stackArgsType, so that call can execute appropriate
  3822  // write barriers during the copy.
  3823  //
  3824  // Arguments passed through to call do not escape. The type is used only in a
  3825  // very limited callee of call, the stackArgs are copied, and regArgs is only
  3826  // used in the call frame.
  3827  //
  3828  //go:noescape
  3829  //go:linkname call runtime.reflectcall
  3830  func call(stackArgsType *abi.Type, f, stackArgs unsafe.Pointer, stackArgsSize, stackRetOffset, frameSize uint32, regArgs *abi.RegArgs)
  3831  
  3832  func ifaceE2I(t *abi.Type, src any, dst unsafe.Pointer)
  3833  
  3834  // memmove copies size bytes to dst from src. No write barriers are used.
  3835  //
  3836  //go:noescape
  3837  func memmove(dst, src unsafe.Pointer, size uintptr)
  3838  
  3839  // typedmemmove copies a value of type t to dst from src.
  3840  //
  3841  //go:noescape
  3842  func typedmemmove(t *abi.Type, dst, src unsafe.Pointer)
  3843  
  3844  // typedmemclr zeros the value at ptr of type t.
  3845  //
  3846  //go:noescape
  3847  func typedmemclr(t *abi.Type, ptr unsafe.Pointer)
  3848  
  3849  // typedmemclrpartial is like typedmemclr but assumes that
  3850  // dst points off bytes into the value and only clears size bytes.
  3851  //
  3852  //go:noescape
  3853  func typedmemclrpartial(t *abi.Type, ptr unsafe.Pointer, off, size uintptr)
  3854  
  3855  // typedslicecopy copies a slice of elemType values from src to dst,
  3856  // returning the number of elements copied.
  3857  //
  3858  //go:noescape
  3859  func typedslicecopy(t *abi.Type, dst, src unsafeheader.Slice) int
  3860  
  3861  // typedarrayclear zeroes the value at ptr of an array of elemType,
  3862  // only clears len elem.
  3863  //
  3864  //go:noescape
  3865  func typedarrayclear(elemType *abi.Type, ptr unsafe.Pointer, len int)
  3866  
  3867  //go:noescape
  3868  func typehash(t *abi.Type, p unsafe.Pointer, h uintptr) uintptr
  3869  
  3870  func verifyNotInHeapPtr(p uintptr) bool
  3871  
  3872  //go:noescape
  3873  func growslice(t *abi.Type, old unsafeheader.Slice, num int) unsafeheader.Slice
  3874  
  3875  //go:noescape
  3876  func unsafeslice(t *abi.Type, ptr unsafe.Pointer, len int)
  3877  
  3878  // Dummy annotation marking that the value x escapes,
  3879  // for use in cases where the reflect code is so clever that
  3880  // the compiler cannot follow.
  3881  func escapes(x any) {
  3882  	if dummy.b {
  3883  		dummy.x = x
  3884  	}
  3885  }
  3886  
  3887  var dummy struct {
  3888  	b bool
  3889  	x any
  3890  }
  3891  
  3892  // Dummy annotation marking that the content of value x
  3893  // escapes (i.e. modeling roughly heap=*x),
  3894  // for use in cases where the reflect code is so clever that
  3895  // the compiler cannot follow.
  3896  func contentEscapes(x unsafe.Pointer) {
  3897  	if dummy.b {
  3898  		escapes(*(*any)(x)) // the dereference may not always be safe, but never executed
  3899  	}
  3900  }
  3901  

View as plain text