X-Git-Url: http://git.subgeniuskitty.com/vvhitespace/.git/blobdiff_plain/439d5659b816a9de7e9077a34b661e44adfa440a..07331ceeb01f6045ddf02e0aba05752ef1ea8838:/vv_interpreter.c

diff --git a/vv_interpreter.c b/vv_interpreter.c
index 6dde3e8..cf5cdef 100644
--- a/vv_interpreter.c
+++ b/vv_interpreter.c
@@ -15,9 +15,9 @@
 
 #define VERSION 1
 
-#define HEAPSIZE        1024    /* Size of heap in words        */
-#define DATASTACKSIZE   1024    /* Size of stack in words       */
-#define RETURNSTACKSIZE 1024    /* Max subroutine call depth    */
+#define HEAPSIZE        65536   /* Size of heap in words        */
+#define DATASTACKSIZE   65536   /* Size of stack in words       */
+#define RETURNSTACKSIZE 65536   /* Max subroutine call depth    */
 
 void
 print_usage(char ** argv)
@@ -162,14 +162,26 @@ process_imp_stack(uint8_t * code, size_t * pc, int64_t ** sp)
 
                 /* Now, construct the number and push to TOS. */
                 /* I'm assuming the numbers are read MSb first. */
-                int64_t number = 0;
+                uint64_t number = 0; /* Unsigned to accomodate magnitude of most negative number. */
                 uint8_t temp;
                 while ((temp = next_code_byte(code,pc)) != '\n') {
                     if (temp == '\v') ws_die(pc, "non-binary digit in number");
                     number <<= 1;
                     if (temp == '\t') number++;
                 }
-                stack_push(sp, number*sign);
+                /* Without temporarily casting to something >64-bit, the most negative */
+                /* number will overflow when performing 'number*sign'. Instead, we     */
+                /* pick off the most negative number as a special case.                */
+                if (number == (1ULL << 63) && sign == -1) {
+                    /* C parses negative integer literals first as signed positive */
+                    /* integer literals, then applying a unary negation operator.  */
+                    /* Thus, the most negative value is unreachable directly.      */
+                    int64_t number_temp = -9223372036854775807LL; /* First store -((2^63)-1)  */
+                    number_temp--;                                /* Now turn it into -(2^63) */
+                    stack_push(sp, number_temp);
+                } else {
+                    stack_push(sp, number*sign);
+                }
             }
             break;
         case '\n':
@@ -241,7 +253,7 @@ process_imp_arithmetic(uint8_t * code, size_t * pc, int64_t ** sp)
                     case '\t':
                         /* Modulo */
                         temp = stack_pop(sp);
-                        stack_push(sp, stack_pop(sp)%temp);
+                        stack_push(sp, llabs(stack_pop(sp) % llabs(temp)));
                         break;
                     default: ws_die(pc, "malformed arithmetic IMP"); break;
                 }
@@ -443,8 +455,8 @@ main(int argc, char ** argv)
         if (pc >= ws_code_size) {
             fprintf(stderr, "SIM_ERROR: PC Overrun\n    Requested PC: %lu\n    Max Address: %lu\n",
                 pc, ws_code_size-1);
-            exit(EXIT_FAILURE);
             unset_terminal_mode();
+            exit(EXIT_FAILURE);
         }
 
         /* Decode the IMPs */