hyung-hwan/moo
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

touched up divide_unsigned_array2()

Browse Source
This commit is contained in:
hyunghwan.chung
2019-04-08 04:00:47 +00:00
parent 55b18c998c
commit 96f3ebae4b
2 changed files with 135 additions and 71 deletions
Download Patch File Download Diff File Expand all files Collapse all files

92
moo/kernel/test-bi.moo Normal file
View File

@ -0,0 +1,92 @@
#include 'Moo.moo'.
#################################################################
## MAIN
#################################################################
class MyObject(Object)
{
var(#class) a := 100.
var(#classinst) K := 200.
method(#class) testBigintDiv
{
| i q r divd divr divd_ubound divr_ubound |
divr_ubound := 16rFFFFFFFFFFFFFFFFFFFFFFFF.
divd_ubound := 16rFFFFFFFFFFFFFFFFFFFFFFFF.
divr := 1.
while (divr <= divr_ubound)
{
('divr => ' & divr asString) dump.
divd := 0.
while (divd <= divd_ubound)
{
q := divd div: divr.
r := divd rem: divr.
if (divd ~= (q * divr + r)) { i dump. divd dump. divr dump. q dump. r dump. (q * divr + r) dump. ^false. }.
divd := divd + 1.
}.
divd := divr + 1.
}.
^true
}
method(#class) testBigintDiv2
{
| ffi i q r divd divr divd_ubound divr_ubound now x |
ffi := FFI new: 'libc.so.6'.
now := ffi call: #time signature: 'l)i' arguments: #(0).
####ffi call: #srand signature: 'i)' arguments: %(now).
ffi call: #srandom signature: 'i)' arguments: %(now).
[
divr_ubound := 16rFFFFFFFFFFFFFFFFFFFFFFFF.
divd_ubound := 16rFFFFFFFFFFFFFFFFFFFFFFFF.
while (true)
{
##x := (ffi call: #rand signature: ')i' arguments: nil) rem: 20.
##divd := (ffi call: #rand signature: ')i' arguments: nil).
x := (ffi call: #random signature: ')l' arguments: nil) rem: 20.
divd := (ffi call: #random signature: ')l' arguments: nil).
while (x > 0)
{
##divd := (divd bitShift: 7) bitOr: (ffi call: #rand signature: ')i' arguments: nil).
divd := (divd bitShift: 7) bitOr: (ffi call: #random signature: ')l' arguments: nil).
x := x - 1.
}.
##x := (ffi call: #rand signature: ')i' arguments: nil) rem: 20.
##divr := (ffi call: #rand signature: ')i' arguments: nil).
x := (ffi call: #random signature: ')l' arguments: nil) rem: 20.
divr := (ffi call: #random signature: ')l' arguments: nil).
while (x > 0)
{
##divr := (divr bitShift: 7) bitOr: (ffi call: #rand signature: ')i' arguments: nil).
divr := (divr bitShift: 7) bitOr: (ffi call: #random signature: ')l' arguments: nil).
x := x - 1.
}.
if (divr = 0) { divr := 1 }.
q := divd div: divr.
r := divd rem: divr.
if (divd ~= (q * divr + r)) { i dump. divd dump. divr dump. q dump. r dump. (q * divr + r) dump. ^false. }.
####((q asString) & ' ' & (r asString)) dump
}.
] ensure: [ ffi close. ].
^true
}
method(#class) main
{
self testBigintDiv2.
}
}