@@ -74,9 +74,9 @@ static BigInt * getbig(VM * vm, VAL x) {
75 switch(GETTY(x)) {
75 switch(GETTY(x)) {
76 case CT_FWD:
76 case CT_FWD:
77− return getbig(vm, ((Fwd*)x)->fwd);
77+ return getbig(vm, ((Fwd*)x)->fwd);
79− return (BigInt*)x;
79+ return (BigInt*)x;
@@ -169,7 +169,7 @@ VAL idris_bigPlus(VM* vm, VAL x, VAL y) {
170 i_int res = vx + vy;
170 i_int res = vx + vy;
171 if (res >= 1<<30 || res <= -(1 << 30)) {
171 if (res >= 1<<30 || res <= -(1 << 30)) {
172− return bigAdd(vm, (VAL)GETBIG(vm, x), (VAL)GETBIG(vm, y));
172+ return bigAdd(vm, (VAL)GETBIG(vm, x), (VAL)GETBIG(vm, y));
174 return MKINT(res);
174 return MKINT(res);
@@ -200,15 +200,15 @@ VAL idris_bigTimes(VM* vm, VAL x, VAL y) {
200 if (ISINT(x) && ISINT(y)) {
200 if (ISINT(x) && ISINT(y)) {
201 i_int vx = GETINT(x);
201 i_int vx = GETINT(x);
202 i_int vy = GETINT(y);
202 i_int vy = GETINT(y);
203− // we could work out likelihood of overflow by checking the number
203+ // we could work out likelihood of overflow by checking the number
204− // of necessary bits. Here's a quick conservative hack instead.
204+ // of necessary bits. Here's a quick conservative hack instead.
205− if ((vx < (1<<15) && vy < (1<16)) ||
205+ if ((vx < (1<<15) && vy < (1<16)) ||
206− (vx < (1<<16) && vy < (1<15)) ||
206+ (vx < (1<<16) && vy < (1<15)) ||
207− (vx < (1<<20) && vy < (1<11)) ||
207+ (vx < (1<<20) && vy < (1<11)) ||
208− (vx < (1<<11) && vy < (1<20)) ||
208+ (vx < (1<<11) && vy < (1<20)) ||
209− (vx < (1<<23) && vy < (1<<8)) ||
209+ (vx < (1<<23) && vy < (1<<8)) ||
210− (vx < (1<<8) && vy < (1<<23))) { // ultra-conservative!
210+ (vx < (1<<8) && vy < (1<<23))) { // ultra-conservative!
211− return INTOP(*,x,y);
211+ return INTOP(*,x,y);
213 return bigMul(vm, GETBIG(vm, x), GETBIG(vm, y));
213 return bigMul(vm, GETBIG(vm, x), GETBIG(vm, y));