suzanne.soy/tock-mirror
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Defeated the GCC optimiser, to get a decent estimate of how slow multiplication is

Browse Source
This commit is contained in:
Neil Brown 2009-01-22 16:52:00 +00:00
parent 72a8824940
commit e001d9173c
1 changed files with 20 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

29
testcases/time-mul.occ
View File

@ -2,37 +2,48 @@
PROC main(CHAN OF BYTE out)
TIMER t:
INT t0, t1, x:
INT t0, t1, x, y:
SEQ
t ? t0
SEQ i = 0 FOR 100000
x := i * 5
SEQ i = 0 FOR 1000000
SEQ
x := i * 5
y := y PLUS x
t ? t1
t1 := t1 - t0
out.string("Time for low numbers MUL: ", 0, out)
out.int(t1, 0, out)
t ? t0
SEQ i = 0 FOR 100000
x := i TIMES 5
SEQ i = 0 FOR 1000000
SEQ
x := i TIMES 5
y := y PLUS x
t ? t1
t1 := t1 - t0
out.string("Time for low numbers TIMES: ", 0, out)
out.int(t1, 0, out)
t ? t0
SEQ i = 100000000 FOR 100000
x := i * 5
SEQ i = 100000000 FOR 1000000
SEQ
x := i * 5
y := y PLUS x
t ? t1
t1 := t1 - t0
out.string("Time for high numbers MUL: ", 0, out)
out.int(t1, 0, out)
t ? t0
SEQ i = 100000000 FOR 100000
x := i TIMES 5
SEQ i = 100000000 FOR 1000000
SEQ
x := i TIMES 5
y := y PLUS x
t ? t1
t1 := t1 - t0
out.string("Time for high numbers TIMES: ", 0, out)
out.int(t1, 0, out)
out ! '*n'
out.int(y, 0, out)
: