func main() {
// Test Bswap first because the other test relies on it
// working correctly (to implement bit reversal).
for i := range A {
x := A[i]
y := B[i]
X := T.Bswap64(x) // ERROR "intrinsic substitution for Bswap64"
Y := T.Bswap64(y) // ERROR "intrinsic substitution for Bswap64"
if y != X {
logf("Bswap64(0x%08x) expected 0x%08x but got 0x%08x\n", x, y, X)
}
if x != Y {
logf("Bswap64(0x%08x) expected 0x%08x but got 0x%08x\n", y, x, Y)
}
x32 := uint32(X)
y32 := uint32(Y >> 32)
X32 := T.Bswap32(x32) // ERROR "intrinsic substitution for Bswap32"
Y32 := T.Bswap32(y32) // ERROR "intrinsic substitution for Bswap32"
if y32 != X32 {
logf("Bswap32(0x%08x) expected 0x%08x but got 0x%08x\n", x32, y32, X32)
}
if x32 != Y32 {
logf("Bswap32(0x%08x) expected 0x%08x but got 0x%08x\n", y32, x32, Y32)
}
}
// Zero is a special case, be sure it is done right.
if T.Ctz16(0) != 16 { // ERROR "intrinsic substitution for Ctz16"
logf("ctz16(0) != 16")
}
if T.Ctz32(0) != 32 { // ERROR "intrinsic substitution for Ctz32"
logf("ctz32(0) != 32")
}
if T.Ctz64(0) != 64 { // ERROR "intrinsic substitution for Ctz64"
logf("ctz64(0) != 64")
}
for i := uint64(0); i <= 64; i++ {
for j := uint64(1); j <= 255; j += 2 {
for k := uint64(1); k <= 65537; k += 128 {
x := (j * k) << i
test(i, x)
}
}
}
}
func TestBswap64(t *testing.T) {
x := uint64(0x1122334455667788)
y := sys.Bswap64(x)
if y != 0x8877665544332211 {
t.Errorf("Bswap(%x)=%x, want 0x8877665544332211", x, y)
}
}