}
		if got, want := dest.int64s, tc.int64s; !reflect.DeepEqual(got, want) {
			t.Errorf("failed decode int64s %d, got %v, want %v", i, got, want)
		}
	}
}

type packedInts struct {
	uint64s []uint64
	int64s  []int64
}

func (u *packedInts) decoder() []decoder {
	return []decoder{
		nil,
		func(b *buffer, m message) error { return decodeUint64s(b, &m.(*packedInts).uint64s) },

		return "arm64"
	case macho.CpuPpc64:
		return "ppc64"
	}
	return ""
}

type uint64s []uint64

func (x uint64s) Len() int           { return len(x) }
func (x uint64s) Swap(i, j int)      { x[i], x[j] = x[j], x[i] }
func (x uint64s) Less(i, j int) bool { return x[i] < x[j] }

func (f *machoFile) loadAddress() (uint64, error) {
	if seg := f.macho.Segment("__TEXT"); seg != nil {
		return seg.Addr, nil
	}

	uint64(12210202232702069999), // Uint64()
	uint64(8204908297817606218),  // Uint64()
	uint64(17358349022401942459), // Uint64()
	uint64(2240328155279531677),  // Uint64()
	uint64(7311121042813227358),  // Uint64()
	uint64(14454429957748299131), // Uint64()
	uint64(13481244625344276711), // Uint64()
	uint64(9381769212557126946),  // Uint64()
	uint64(1350674201389090105),  // Uint64()

// uint128 represents a uint128 using two uint64s.
//
// When the methods below mention a bit number, bit 0 is the most
// significant bit (in hi) and bit 127 is the lowest (lo&1).
type uint128 struct {
	hi uint64
	lo uint64
}

// mask6 returns a uint128 bitmask with the topmost n bits of a
// 128-bit number.
func mask6(n int) uint128 {
	return uint128{^(^uint64(0) >> n), ^uint64(0) << (128 - n)}
}

package runtime_test

import (
	"testing"
)

func TestIssue48807(t *testing.T) {
	for _, i := range []uint64{
		0x8234508000000001, // from issue48807
		1<<56 + 1<<32 + 1,
	} {
		got := float32(i)
		dontwant := float32(float64(i))
		if got == dontwant {
			// The test cases above should be uint64s such that
			// this equality doesn't hold. These examples trigger

func xorIn(d *state, buf []byte) {
	if cpu.IsBigEndian {
		for i := 0; len(buf) >= 8; i++ {
			a := binary.LittleEndian.Uint64(buf)
			d.a[i] ^= a
			buf = buf[8:]
		}
	} else {
		ab := (*[25 * 64 / 8]byte)(unsafe.Pointer(&d.a))
		subtle.XORBytes(ab[:], ab[:], buf)
	}
}

// copyOut copies uint64s to a byte buffer.
func copyOut(d *state, b []byte) {
	if cpu.IsBigEndian {
		for i := 0; len(b) >= 8; i++ {

	ctrInc = 4  // increment counter by 4 between block calls
	ctrMax = 16 // reseed when counter reaches 16
	chunk  = 32 // each chunk produced by block is 32 uint64s
	reseed = 4  // reseed with 4 words
)

// block is the chacha8rand block function.
func block(seed *[4]uint64, blocks *[32]uint64, counter uint32)

// A State holds the state for a single random generator.
// It must be used from one goroutine at a time.

		return
	}
	b.uint64(tag, x)
}

func (b *protobuf) int64(tag int, x int64) {
	u := uint64(x)
	b.uint64(tag, u)
}

func (b *protobuf) int64Opt(tag int, x int64) {
	if x == 0 {
		return
	}
	b.int64(tag, x)
}

func (b *protobuf) int64s(tag int, x []int64) {
	if len(x) > 2 {
		// Use packed encoding
		n1 := len(b.data)
		for _, u := range x {
			b.varint(uint64(u))
		}
		n2 := len(b.data)

	}

	// Build sorted list of addresses of all symbols.
	// We infer the size of a symbol by looking at where the next symbol begins.
	var addrs []uint64
	for _, s := range plan9Syms {
		if !validSymType[s.Type] {
			continue
		}
		addrs = append(addrs, s.Value)
	}
	sort.Sort(uint64s(addrs))

	var syms []Sym

	for _, s := range plan9Syms {
		if !validSymType[s.Type] {
			continue
		}

		return "arm64"
	default:
		return ""
	}
}

func (f *peFile) loadAddress() (uint64, error) {
	return f.imageBase()
}

func (f *peFile) imageBase() (uint64, error) {
	switch oh := f.pe.OptionalHeader.(type) {
	case *pe.OptionalHeader32:
		return uint64(oh.ImageBase), nil
	case *pe.OptionalHeader64:
		return oh.ImageBase, nil
	default: