Commit Graph

11 Commits

Author SHA1 Message Date
Neil Brown
72a8824940 Had a go at implementing multiply overflow checking (with a single division, and pre-checks)
I also added an occam testcase to help time the different between * and TIMES.  But gcc optimises out the loop with TIMES under -O2, and with -O0 there is a factor of four difference.
2009-01-22 16:51:54 +00:00
Neil Brown
c9fa0f774c Added all the multiplication tests like the others (currently failing) 2009-01-22 13:18:58 +00:00
Neil Brown
e690f1c36d Added shift tests and simplified calling the ranged tests a little 2009-01-22 13:07:16 +00:00
Neil Brown
b08d48bd43 Added more remainder tests, and fixed our implementation of remainder to pass the tests 2009-01-22 12:58:53 +00:00
Neil Brown
226f8b4ac4 Added checks for division and remainder, and discovered some failing remainder tests 2009-01-22 12:49:47 +00:00
Neil Brown
98136367e0 Added tests for the occam support negation functions 2009-01-22 12:28:00 +00:00
Neil Brown
ef387ec748 Simplified the range test code 2009-01-22 11:59:40 +00:00
Neil Brown
5d404478f2 Added tests for occam's subtraction 2009-01-22 11:57:11 +00:00
Neil Brown
890b922f2b Combined the tests for addition in occam into a macro 2009-01-22 11:46:54 +00:00
Neil Brown
0d2ea4c920 Updated the code in light of the feedback from the GCC bug 2009-01-22 11:41:43 +00:00
Neil Brown
1b51eb5d63 Added a C file of tests ready for the occam overflow checking 2009-01-22 11:25:50 +00:00