// Keep this code in sync with cmd/compile/internal/walk/builtin.go:walkUnsafeSlice
func unsafeslice64(et *_type, ptr unsafe.Pointer, len64 int64) {
	len := int(len64)
	if int64(len) != len64 {
		panicunsafeslicelen1(getcallerpc())
	}
	unsafeslice(et, ptr, len)
}

func unsafeslicecheckptr(et *_type, ptr unsafe.Pointer, len64 int64) {
	unsafeslice64(et, ptr, len64)

	// Check that underlying array doesn't straddle multiple heap objects.

	println(ints())
}

func Complex() {
	_ = complex(float64s())
}

func Copy() {
	copy(slices())
}

func UnsafeAdd() {
	_ = unsafe.Add(unsafeAdd())
}

func UnsafeSlice() {
	_ = unsafe.Slice(unsafeSlice())
}

func appendArgs() ([]int, int) {
	return []int{}, 0
}

func deleteArgs() (map[int]int, int) {
	return map[int]int{}, 0
}

func ints() (int, int) {
	return 1, 1
}

// license that can be found in the LICENSE file.

package b

import "./a"

func f() {
	a.Append()
	a.Delete()
	a.Print()
	a.Println()
	a.Complex()
	a.Copy()
	a.UnsafeAdd()
	a.UnsafeSlice()

	// Type checking guarantees that TIDEAL len/cap are positive and fit in an int.
	// The case of len or cap overflow when converting TUINT or TUINTPTR to TINT
	// will be handled by the negative range checks in unsafeslice during runtime.
	if ir.ShouldCheckPtr(ir.CurFunc, 1) {
		fnname := "unsafeslicecheckptr"
		fn := typecheck.LookupRuntime(fnname)

// data starts at p, with length and capacity equal to n.
//
// This is like [unsafe.Slice].
func SliceAt(typ Type, p unsafe.Pointer, n int) Value {
	unsafeslice(typ.common(), p, n)
	s := unsafeheader.Slice{Data: p, Len: n, Cap: n}
	return Value{SliceOf(typ).common(), unsafe.Pointer(&s), flagIndir | flag(Slice)}
}