mirror of
https://github.com/vlang/v.git
synced 2025-09-13 22:42:26 +03:00
math.bits: added missing functions and test
This commit is contained in:
penguindark
GitHub
parent
d9cf98f772
commit
67e7ad13de
2 changed files with 365 additions and 19 deletions
|
|
@ -1,8 +1,12 @@
|
|||
//
|
||||
// test suite for bits and bits math functions
|
||||
//
|
||||
module bits
|
||||
|
||||
fn test_bits(){
|
||||
mut i := 0
|
||||
mut i1:= u64(0)
|
||||
|
||||
//
|
||||
// --- LeadingZeros ---
|
||||
//
|
||||
|
|
@ -10,26 +14,29 @@ fn test_bits(){
|
|||
// 8 bit
|
||||
i = 1
|
||||
for x in 0..8 {
|
||||
//C.printf("x:%02x lz: %d cmp: %d\n",i<<x,leading_zeros_8(i<<x), 7-x)
|
||||
assert leading_zeros_8(byte(i<<x)) == 7 - x
|
||||
//C.printf("x:%02x lz: %d cmp: %d\n", i << x, leading_zeros_8(i << x), 7-x)
|
||||
assert leading_zeros_8(byte(i << x)) == 7 - x
|
||||
}
|
||||
|
||||
// 16 bit
|
||||
i = 1
|
||||
for x in 0..16 {
|
||||
//C.printf("x:%04x lz: %d cmp: %d\n",u16(i)<<x,leading_zeros_16(u16(i)<<x), 15-x)
|
||||
assert leading_zeros_16(u16(i)<<x) == 15 - x
|
||||
//C.printf("x:%04x lz: %d cmp: %d\n", u16(i) << x, leading_zeros_16(u16(i) << x), 15-x)
|
||||
assert leading_zeros_16(u16(i) << x) == 15 - x
|
||||
}
|
||||
|
||||
// 32 bit
|
||||
i = 1
|
||||
for x in 0..32 {
|
||||
//C.printf("x:%08x lz: %d cmp: %d\n",u32(i)<<x,leading_zeros_32(u32(i)<<x), 31-x)
|
||||
assert leading_zeros_32(u32(i)<<x) == 31 - x
|
||||
//C.printf("x:%08x lz: %d cmp: %d\n", u32(i) << x, leading_zeros_32(u32(i) << x), 31-x)
|
||||
assert leading_zeros_32(u32(i) << x) == 31 - x
|
||||
}
|
||||
|
||||
// 64 bit
|
||||
i = 1
|
||||
for x in 0..64 {
|
||||
//C.printf("x:%016llx lz: %llu cmp: %d\n",u64(i)<<x,leading_zeros_64(u64(i)<<x), 63-x)
|
||||
assert leading_zeros_64(u64(i)<<x) == 63 - x
|
||||
//C.printf("x:%016llx lz: %llu cmp: %d\n", u64(i) << x, leading_zeros_64(u64(i) << x), 63-x)
|
||||
assert leading_zeros_64(u64(i) << x) == 63 - x
|
||||
}
|
||||
|
||||
//
|
||||
|
|
@ -39,29 +46,32 @@ fn test_bits(){
|
|||
// 8 bit
|
||||
i = 0
|
||||
for x in 0..9 {
|
||||
//C.printf("x:%02x lz: %llu cmp: %d\n",byte(i),ones_count_8(byte(i)), x)
|
||||
//C.printf("x:%02x lz: %llu cmp: %d\n", byte(i), ones_count_8(byte(i)), x)
|
||||
assert ones_count_8(byte(i)) == x
|
||||
i = (i << 1) + 1
|
||||
}
|
||||
|
||||
// 16 bit
|
||||
i = 0
|
||||
for x in 0..17 {
|
||||
//C.printf("x:%04x lz: %llu cmp: %d\n",u16(i),ones_count_16(u16(i)), x)
|
||||
//C.printf("x:%04x lz: %llu cmp: %d\n", u16(i), ones_count_16(u16(i)), x)
|
||||
assert ones_count_16(u16(i)) == x
|
||||
i = (i << 1) + 1
|
||||
}
|
||||
|
||||
// 32 bit
|
||||
i = 0
|
||||
for x in 0..33 {
|
||||
//C.printf("x:%08x lz: %llu cmp: %d\n",u32(i),ones_count_32(u32(i)), x)
|
||||
//C.printf("x:%08x lz: %llu cmp: %d\n", u32(i), ones_count_32(u32(i)), x)
|
||||
assert ones_count_32(u32(i)) == x
|
||||
i = (i << 1) + 1
|
||||
}
|
||||
|
||||
// 64 bit
|
||||
i1 = 0
|
||||
for x in 0..65 {
|
||||
//C.printf("x:%016llx lz: %llu cmp: %d\n",u64(i1),ones_count_64(u64(i1)), x)
|
||||
assert ones_count_64(u64(i1)) == x
|
||||
//C.printf("x:%016llx lz: %llu cmp: %d\n", u64(i1), ones_count_64(u64(i1)), x)
|
||||
assert ones_count_64(i1) == x
|
||||
i1 = (i1 << 1) + 1
|
||||
}
|
||||
|
||||
|
|
@ -88,10 +98,11 @@ fn test_bits(){
|
|||
bc++
|
||||
n = n >> 1
|
||||
}
|
||||
//C.printf("x:%02x lz: %llu cmp: %d\n",byte(i),reverse_8(byte(i)), rv)
|
||||
//C.printf("x:%02x lz: %llu cmp: %d\n", byte(i), reverse_8(byte(i)), rv)
|
||||
assert reverse_8(byte(i)) == rv
|
||||
i = (i << 1) + 1
|
||||
}
|
||||
|
||||
// 16 bit
|
||||
i = 0
|
||||
for x in 0..17 {
|
||||
|
|
@ -103,10 +114,11 @@ fn test_bits(){
|
|||
bc++
|
||||
n = n >> 1
|
||||
}
|
||||
//C.printf("x:%04x lz: %llu cmp: %d\n",u16(i),reverse_16(u16(i)), rv)
|
||||
//C.printf("x:%04x lz: %llu cmp: %d\n", u16(i), reverse_16(u16(i)), rv)
|
||||
assert reverse_16(u16(i)) == rv
|
||||
i = (i << 1) + 1
|
||||
}
|
||||
|
||||
// 32 bit
|
||||
i = 0
|
||||
for x in 0..33 {
|
||||
|
|
@ -118,10 +130,11 @@ fn test_bits(){
|
|||
bc++
|
||||
n = n >> 1
|
||||
}
|
||||
//C.printf("x:%08x lz: %llu cmp: %d\n",u32(i),reverse_32(u32(i)), rv)
|
||||
//C.printf("x:%08x lz: %llu cmp: %d\n", u32(i), reverse_32(u32(i)), rv)
|
||||
assert reverse_32(u32(i)) == rv
|
||||
i = (i << 1) + 1
|
||||
}
|
||||
|
||||
// 64 bit
|
||||
i1 = 0
|
||||
for x in 0..64 {
|
||||
|
|
@ -133,8 +146,144 @@ fn test_bits(){
|
|||
bc++
|
||||
n = n >> 1
|
||||
}
|
||||
//C.printf("x:%016llx lz: %016llx cmp: %016llx\n",u64(i1),reverse_64(u64(i1)), rv)
|
||||
assert reverse_64(u64(i1)) == rv
|
||||
//C.printf("x:%016llx lz: %016llx cmp: %016llx\n", u64(i1), reverse_64(u64(i1)), rv)
|
||||
assert reverse_64(i1) == rv
|
||||
i1 = (i1 << 1) + 1
|
||||
}
|
||||
}
|
||||
|
||||
//
|
||||
// --- add ---
|
||||
//
|
||||
|
||||
// 32 bit
|
||||
i = 1
|
||||
for x in 0..32 {
|
||||
v := u32(i) << x
|
||||
sum,carry := add_32(v, v, u32(0))
|
||||
//C.printf("x:%08x [%llu,%llu] %llu\n", u32(i) << x, sum, carry, u64(v) + u64(v))
|
||||
assert ((u64(carry) << 32) | u64(sum)) == u64(v) + u64(v)
|
||||
}
|
||||
mut sum_32t, mut carry_32t := add_32(0x8000_0000, 0x8000_0000, u32(0))
|
||||
assert sum_32t == u32(0)
|
||||
assert carry_32t == u32(1)
|
||||
|
||||
sum_32t, carry_32t = add_32(0xFFFF_FFFF, 0xFFFF_FFFF, u32(1))
|
||||
assert sum_32t == 0xFFFF_FFFF
|
||||
assert carry_32t == u32(1)
|
||||
|
||||
// 64 bit
|
||||
i = 1
|
||||
for x in 0..63 {
|
||||
v := u64(i) << x
|
||||
sum,carry := add_64(v, v, u64(0))
|
||||
//C.printf("x:%16x [%llu,%llu] %llu\n", u64(i) << x, sum, carry, u64(v >> 32) + u64(v >> 32))
|
||||
assert ((carry << 32) | sum) == v + v
|
||||
}
|
||||
mut sum_64t, mut carry_64t := add_64(0x8000_0000_0000_0000, 0x8000_0000_0000_0000, u64(0))
|
||||
assert sum_64t == u64(0)
|
||||
assert carry_64t == u64(1)
|
||||
|
||||
sum_64t, carry_64t = add_64(0xFFFF_FFFF_FFFF_FFFF, 0xFFFF_FFFF_FFFF_FFFF, u64(1))
|
||||
assert sum_64t == 0xFFFF_FFFF_FFFF_FFFF
|
||||
assert carry_64t == u64(1)
|
||||
|
||||
//
|
||||
// --- sub ---
|
||||
//
|
||||
|
||||
// 32 bit
|
||||
i = 1
|
||||
for x in 1..32 {
|
||||
v0 := u32(i) << x
|
||||
v1 := v0 >> 1
|
||||
mut diff, mut borrow_out := sub_32(v0, v1, u32(0))
|
||||
//C.printf("x:%08x [%llu,%llu] %08x\n", u32(i) << x, diff, borrow_out, v0 - v1)
|
||||
assert diff == v1
|
||||
|
||||
diff, borrow_out = sub_32(v0, v1, u32(1))
|
||||
//C.printf("x:%08x [%llu,%llu] %08x\n", u32(i) << x, diff, borrow_out, v0 - v1)
|
||||
assert diff == (v1 - 1)
|
||||
assert borrow_out == u32(0)
|
||||
|
||||
diff, borrow_out = sub_32(v1, v0, u32(1))
|
||||
//C.printf("x:%08x [%llu,%llu] %08x\n", u32(i) << x, diff, borrow_out, v1 - v0)
|
||||
assert borrow_out == u32(1)
|
||||
}
|
||||
|
||||
// 64 bit
|
||||
i = 1
|
||||
for x in 1..64 {
|
||||
v0 := u64(i) << x
|
||||
v1 := v0 >> 1
|
||||
mut diff, mut borrow_out := sub_64(v0, v1, u64(0))
|
||||
//C.printf("x:%08x [%llu,%llu] %08x\n", u64(i) << x, diff, borrow_out, v0 - v1)
|
||||
assert diff == v1
|
||||
|
||||
diff, borrow_out = sub_64(v0, v1, u64(1))
|
||||
//C.printf("x:%08x [%llu,%llu] %08x\n", u64(i) << x, diff, borrow_out, v0 - v1)
|
||||
assert diff == (v1 - 1)
|
||||
assert borrow_out == u64(0)
|
||||
|
||||
diff, borrow_out = sub_64(v1, v0, u64(1))
|
||||
//C.printf("x:%08x [%llu,%llu] %08x\n",u64(i) << x, diff, borrow_out, v1 - v0)
|
||||
assert borrow_out == u64(1)
|
||||
}
|
||||
|
||||
//
|
||||
// --- mul ---
|
||||
//
|
||||
|
||||
// 32 bit
|
||||
i = 1
|
||||
for x in 0..32 {
|
||||
v0 := u32(i) << x
|
||||
v1 := v0 - 1
|
||||
hi, lo := mul_32(v0, v1)
|
||||
//C.printf("x:%08x [%llu,%llu] %llu\n", v0, hi, lo, u64(v0 * v1))
|
||||
assert (u64(hi) << 32) | (u64(lo)) == u64(v0 * v1)
|
||||
}
|
||||
|
||||
// 64 bit
|
||||
i = 1
|
||||
for x in 0..64 {
|
||||
v0 := u64(i) << x
|
||||
v1 := v0 - 1
|
||||
hi, lo := mul_64(v0, v1)
|
||||
//C.printf("v0: %llu v1: %llu [%llu,%llu] tt: %llu\n", v0, v1, hi, lo, (v0 >> 32) * (v1 >> 32))
|
||||
assert (hi & 0xFFFF_FFFF_0000_0000) == (((v0 >> 32)*(v1 >> 32)) & 0xFFFF_FFFF_0000_0000)
|
||||
assert (lo & 0x0000_0000_FFFF_FFFF) == (((v0 & 0x0000_0000_FFFF_FFFF) * (v1 & 0x0000_0000_FFFF_FFFF)) & 0x0000_0000_FFFF_FFFF)
|
||||
}
|
||||
|
||||
//
|
||||
// --- div ---
|
||||
//
|
||||
|
||||
// 32 bit
|
||||
i = 1
|
||||
for x in 0..31 {
|
||||
hi := u32(i) << x
|
||||
lo := hi - 1
|
||||
y := u32(3) << x
|
||||
quo, rem := div_32(hi, lo, y)
|
||||
//C.printf("[%08x_%08x] %08x (%08x,%08x)\n", hi, lo, y, quo, rem)
|
||||
tst := ((u64(hi) << 32) | u64(lo))
|
||||
assert quo == (tst / u64(y))
|
||||
assert rem == (tst % u64(y))
|
||||
assert rem == rem_32(hi, lo, y)
|
||||
}
|
||||
|
||||
// 64 bit
|
||||
i = 1
|
||||
for x in 0..62 {
|
||||
hi := u64(i) << x
|
||||
lo := u64(2) //hi - 1
|
||||
y := 0x4000_0000_0000_0000
|
||||
quo, rem := div_64(hi, lo, y)
|
||||
//C.printf("[%016llx_%016llx] %016llx (%016llx,%016llx)\n", hi, lo, y, quo, rem)
|
||||
assert quo == u64(2)<<(x+1)
|
||||
_, rem1 := div_64(hi%y, lo, y)
|
||||
assert rem == rem1
|
||||
assert rem == rem_64(hi, lo, y)
|
||||
}
|
||||
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue