t.Errorf("T16.littleEndianStore got %x want %x\n", got, want)
	}
	t8.bigEndianStore(1<<8 + 2)
	if got, want := t8, (T8{1, 2}); got != want {
		t.Errorf("T8.bigEndianStore got %x want %x\n", got, want)
	}
	t8.littleEndianStore(1<<8 + 2)
	if got, want := t8, (T8{2, 1}); got != want {
		t.Errorf("T8.littleEndianStore got %x want %x\n", got, want)
	}

	Target() Element
}

// Check that accessing an interface method too early doesn't lead
// to follow-on errors due to an incorrectly computed type set.

type T8 interface {
	m() [unsafe.Sizeof(T8.m /* ERROR "undefined" */ )]int
}

	// amd64:`CALL\truntime.interfaceSwitch`,`MOVL\t16\(AX\)`,`MOVQ\t8\(.*\)(.*\*8)`
	// arm64:`CALL\truntime.interfaceSwitch`,`LDAR`,`MOVWU\t16\(R0\)`,`MOVD\t\(R.*\)\(R.*\)`
	switch x.(type) {
	case I:
		return 1
	case J:
		return 2
	default:
		return 3
	}
}

func interfaceSwitch2(x K) int {
	// amd64:`CALL\truntime.interfaceSwitch`,`MOVL\t16\(AX\)`,`MOVQ\t8\(.*\)(.*\*8)`

        T3 interface { T2; T2 }
        T4 interface { T3; T3 }
        T5 interface { T4; T4 }
        T6 interface { T5; T5 }
        T7 interface { T6; T6 }
        T8 interface { T7; T7 }
        T9 interface { T8; T8 }

        // TODO(gri) Enable this longer test once we have found a solution
        //           for the incorrect optimization in the validType check
        //           (see TODO in validtype.go).

        T5 = T
)

func (T4) m4() {}
func _() { (T{}).m4 /* ERROR "cannot call pointer method m4 on T" */ () }
func _() { (&T{}).m4() }

type (
        T6 = (((T7)))
        T7 = (*(T8))
        T8 = T
)

func (T6) m6() {}
func _() { (T{}).m6 /* ERROR "cannot call pointer method m6 on T" */ () }
func _() { (&T{}).m6() }

type (
        T9 = *T10
        T10 = *T11
        T11 = T
)

type T5 struct {
	_ E0[E2[T5]]
}

type T6 struct {
	_ E0[E2[E0[E1[E2[[10]T6]]]]]
}

type T7 struct {
	_ E0[[10]E2[E0[E2[E2[T7]]]]]
}

type T8 struct {
	_ E0[[]E2[E0[E2[E2[T8]]]]]
}

type T9 /* ERROR "invalid recursive type" */ [10]E2[E5[E2[T9]]]

// cycles through method values

type T7 int
func (T7) m() int { _ = x7; return 0 }
var x7 /* ERROR "initialization cycle" */ = T7(0).m

type T8 int
func (T8) m() int { _ = x8; return 0 }
var x8 /* ERROR "initialization cycle" */ = T8(0).m()

type T7p int
func (*T7p) m() int { _ = x7p; return 0 }
var x7p /* ERROR "initialization cycle" */ = new(T7p).m

type T8p int

func NopConvertGeneric[T any](x T) T {
	// amd64:-`.*runtime.convI2I`
	return T(x)
}

var NopConvertGenericIface = NopConvertGeneric[I]

func ConvToM(x any) I {
	// amd64:`CALL\truntime.typeAssert`,`MOVL\t16\(.*\)`,`MOVQ\t8\(.*\)(.*\*1)`
	// arm64:`CALL\truntime.typeAssert`,`LDAR`,`MOVWU`,`MOVD\t\(R.*\)\(R.*\)`
	return x.(I)

package cycles

import "unsafe"

type (
	T0 int
	T1 /* ERROR "invalid recursive type: T1 refers to itself" */ T1
	T2 *T2

	T3 /* ERROR "invalid recursive type" */ T4
	T4 T5
	T5 T3

	T6 T7
	T7 *T8
	T8 T6

	// arrays
	A0 /* ERROR "invalid recursive type" */ [10]A0
	A1 [10]*A1

	A2 /* ERROR "invalid recursive type" */ [10]A3
	A3 [10]A4
	A4 A2

	A5 [10]A6
	A6 *A5

	// slices
	L0 []L0

			Valu("t6", OpMod64, c.config.Types.Int64, 0, nil, "t5", "v2"),
			Valu("t7", OpAnd64, c.config.Types.Int64, 0, nil, "t6", "v2"),
			Valu("t8", OpOr64, c.config.Types.Int64, 0, nil, "t7", "v2"),
			Valu("t9", OpXor64, c.config.Types.Int64, 0, nil, "t8", "v2"),
			Valu("t10", OpNeg64, c.config.Types.Int64, 0, nil, "t9"),
			Valu("t11", OpCom64, c.config.Types.Int64, 0, nil, "t10"),