testing sth

made some improvements
changed stack size
2024-01-25 20:22:33 +00:00 · 2024-01-25 19:51:24 +00:00 · 2024-01-23 22:49:23 +01:00 · 2024-01-23 22:46:55 +01:00 · 2024-01-23 22:45:49 +01:00 · 2024-01-23 22:15:49 +01:00
83 changed files with 4390 additions and 61 deletions
--- a/.gitignore
+++ b/.gitignore
@@ -0,0 +1,7 @@
+.idea
+cmake-build-debug
+njvm
+njvm.dSYM
+njvm.exe
+njvm2
+test
--- a/.idea/.gitignore
+++ b/.idea/.gitignore
@@ -1,8 +0,0 @@
-# Default ignored files
-/shelf/
-/workspace.xml
-# Editor-based HTTP Client requests
-/httpRequests/
-# Datasource local storage ignored files
-/dataSources/
-/dataSources.local.xml
--- a/.idea/modules.xml
+++ b/.idea/modules.xml
@@ -1,8 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<project version="4">
-  <component name="ProjectModuleManager">
-    <modules>
-      <module fileurl="file://$PROJECT_DIR$/.idea/ninja.iml" filepath="$PROJECT_DIR$/.idea/ninja.iml" />
-    </modules>
-  </component>
-</project>
--- a/.idea/ninja.iml
+++ b/.idea/ninja.iml
@@ -1,2 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<module classpath="CMake" type="CPP_MODULE" version="4" />
--- a/.idea/vcs.xml
+++ b/.idea/vcs.xml
@@ -1,6 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<project version="4">
-  <component name="VcsDirectoryMappings">
-    <mapping directory="" vcs="Git" />
-  </component>
-</project>
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -2,11 +2,22 @@ cmake_minimum_required(VERSION 3.0)
 project(ninja LANGUAGES C)

 set(CMAKE_C_STANDARD 99)
-set(PROJECT_VERSION 0)
-configure_file(
-        ${CMAKE_SOURCE_DIR}/config.h.in
-        ${CMAKE_BINARY_DIR}/config.h
-)
-include_directories(${CMAKE_BINARY_DIR})
-add_executable(ninja
-        njvm.c config.h.in)
+
+add_compile_options(-g -Wall -pedantic)
+
+add_executable(njvm njvm.c)
+
+# Include directories for njvm executable
+target_include_directories(njvm PRIVATE ${CMAKE_CURRENT_SOURCE_DIR}/bigint/build/include)
+
+# Add the library
+add_library(bigint STATIC ${CMAKE_SOURCE_DIR}/bigint/src/bigint.c
+        support.c
+        heap.c)
+
+# Include directories for the bigint library
+target_include_directories(bigint PUBLIC ${CMAKE_CURRENT_SOURCE_DIR}/bigint/build/include)
+
+# Link the executable with the library
+target_link_libraries(njvm PRIVATE bigint)
+
--- a/12
+++ b/12
@@ -0,0 +1,12 @@
+# Makefile for a simple C program
+build:
+	cd ./bigint; make; cd ..
+	gcc -g -Wall -Ibigint/build/include -o support.o -c support.c
+	gcc -g -Wall -Ibigint/build/include -o njvm.o -c njvm.c
+	gcc -g -Wall -Lbigint/build/lib -o njvm njvm.o support.o -lbigint
+
+run: build
+	./njvm prog.bin
+
+debug: build
+	./njvm --debug prog.bin
--- a/43
+++ b/43
@@ -0,0 +1,43 @@
+# Makefile for a simple C program
+
+# Compiler
+CC = gcc
+
+# program to Run
+F = prog.bin
+
+# Compiler flags
+CFLAGS = -g -Wall -Ibigint/build/include
+
+LDFLAGS = -g -Wall -Lbigint/build/lib
+
+# Source file
+SRC = njvm.c 
+
+# Executable name
+TARGET = njvm
+
+njvm.o: 
+	$(CC) $(CFLAGS) -o njvm.o -c njvm.c
+
+support.o:
+	$(CC) $(CFLAGS) -o support.o -c support.c
+
+# Default target
+all: njvm.o support.o
+	$(CC) $(LDFLAGS) -o $(TARGET) njvm.o support.o -lbigint
+# Clean up
+clean:
+	rm -f $(OBJ) $(TARGET)
+
+debug: all
+	./$(TARGET) --debug $(F) 
+
+run: all
+	./$(TARGET) $(F)
+
+nja:	./nja/nja$(V)
+	./nja/nja$(V) $(IN) $(OUT)
+
+njc: ./njc/njc$(V)
+	./njc/njc$(V) $(IN) $(OUT)
--- a/SDA.c
+++ b/SDA.c
@@ -0,0 +1,27 @@
+//
+// Created by Nils on 03.12.2023
+//
+#ifndef SDA
+#define SDA
+#include <stdio.h>
+#include "stackslot.c"
+struct sda {
+    int *size;
+    ObjRef *sda;
+};
+
+ObjRef getSDA(int i, struct sda s) {
+    return s.sda[i];
+}
+
+void setSDA(int point, ObjRef val, struct sda s) {
+    s.sda[point] = val;
+}
+
+void printSDA(struct sda s) {
+    for (int i = 0; i < *s.size; i++) {
+        printf("%i\n", *(int *)getSDA(i, s)->data);
+    }
+}
+
+#endif
--- a/a.out
+++ b/a.out
--- a/bigint/Makefile
+++ b/bigint/Makefile
@@ -0,0 +1,22 @@
+#
+# Makefile for big integer library and test
+#
+
+DIRS = src tst
+
+all: clean
+		for i in $(DIRS) ; do \
+		  $(MAKE) -C $$i install ; \
+		done
+
+clean:
+		for i in $(DIRS) ; do \
+		  $(MAKE) -C $$i clean ; \
+		done
+		rm -rf ./build
+		rm -f *~
+
+dist:		clean
+		(cd .. ; \
+		 tar -cvf bigint.tar bigint ; \
+		 gzip -f bigint.tar)
--- a/bigint/README
+++ b/bigint/README
@@ -0,0 +1,92 @@
+The "bigint" Package
+====================
+
+1. What is it?
+--------------
+
+This package implements a multiple-precision integer arithmetic package,
+i.e., a collection of functions which can calculate with integers having
+arbitrarily many digits. The algorithms are taken from [D. Knuth: The
+Art of Computer Programming, Vol. 2, Seminumerical Algorithms], the
+implementation language is C.
+
+
+2. "Multiple Precision" - how does it work?
+-------------------------------------------
+
+Each integer number is represented as an array of digits. The array
+is large enough to hold the number of digits necessary to represent
+the number. Each digit occupies a single byte, so the number base of
+this representation is 256. Addition, subtraction, and multiplication
+work as we all have learned it: perform the desired operation digit
+by digit, starting from the least significant digit, and observing
+any "carries" from one place to the next higher one. Division is a
+little bit more complicated because there is a certain amount of
+guesswork involved. Knuth gives a formal treatment of this guesswork.
+
+
+3. How do I use it?
+-------------------
+
+Because every big integer may have a differently sized array to hold
+its digits, these structures are dynamically allocated on the heap of
+the C runtime system, and accessed by pointers. If you want to perform
+an arithmetic operation on one or two big integers, you have to load
+the corresponding pointers into a structure called BIP ("Big Integer
+Processor"), and call the arithmetic function. When the function has
+returned, the pointer to the result of the operation can be found in
+another component of the BIP. The following functions are available:
+
+    int bigSgn(void);                        /* sign */
+    int bigCmp(void);                        /* comparison */
+    void bigNeg(void);                       /* negation */
+    void bigAdd(void);                       /* addition */
+    void bigSub(void);                       /* subtraction */
+    void bigMul(void);                       /* multiplication */
+    void bigDiv(void);                       /* division */
+    void bigFromInt(int n);                  /* conversion int --> big */
+    int bigToInt(void);                      /* conversion big --> int */
+    void bigRead(FILE *in);                  /* read a big integer */
+    void bigPrint(FILE *out);                /* print a big integer */
+    void bigDump(FILE *out, BigObjRef bigObjRef);  /* dump a big integer */
+
+Some of these functions accept or return ordinary integers. For the
+exact definition of each function's interface, please see the comments
+in the function's source.
+
+
+4. What else is needed?
+-----------------------
+
+The library tries to detect fatal errors in using its functions (e.g.,
+null pointers to operands) as well as internal errors (which "cannot
+happen"). In either case a user-supplied error routine is called, which
+is supposed to print an error message and then to terminate the program.
+
+The library does not attempt to manage memory. For this purpose, it
+relies on a user-supplied function "void* newPrimObject(int dataSize)",
+which should allocate sufficiently many bytes and return a pointer to
+a created object. In addition, the library needs to access a data field
+- that implements the size-as-needed cocept - within the created object, 
+to actualy manage the data structures that represent the values of the 
+integer number. For this, the following function can be used:
+
+void * getPrimObjectDataPointer(void * obj){
+  ObjRef oo = ((ObjRef)  (obj));
+  return oo->data;
+}
+
+This function must also be a user-supplied function that must be 
+implemented by the program that wants to use this library.
+
+For details about these three user-supplied functions take a look in 
+the file "support.c" in the directory "tst".
+
+
+5. What is in the directory "tst"?
+----------------------------------
+
+Well, you may have guessed it already: these are test cases for the
+library. You can learn how to link against the library by inspecting
+the "Makefile" for the tests, and you can find a simple implementation
+of the support library.
--- a/bigint/build/bin/testbip
+++ b/bigint/build/bin/testbip
--- a/bigint/build/include/bigint.h
+++ b/bigint/build/include/bigint.h
@@ -0,0 +1,60 @@
+/*
+ * bigint.h -- big integer library
+ */
+
+
+#ifndef _BIGINT_H_
+#define _BIGINT_H_
+
+
+/* object representation */
+typedef void* BigObjRef;
+
+
+#include <stdio.h>
+
+
+typedef struct {
+  int nd;			/* number of digits; array may be bigger */
+				/* nd = 0 exactly when number = 0 */
+  unsigned char sign;		/* one of BIG_NEGATIVE or BIG_POSITIVE */
+				/* zero always has BIG_POSITIVE here */
+  unsigned char digits[1];	/* the digits proper; number base is 256 */
+				/* LS digit first; MS digit is not zero */
+} Big;
+
+#include "support.h"
+
+
+/* big integer processor registers */
+
+typedef struct {
+  BigObjRef op1;			/* first (or single) operand */
+  BigObjRef op2;			/* second operand (if present) */
+  BigObjRef res;			/* result of operation */
+  BigObjRef rem;			/* remainder in case of division */
+} BIP;
+
+extern BIP bip;			/* registers of the processor */
+
+
+/* big integer processor functions */
+
+int bigSgn(void);			/* sign */
+int bigCmp(void);			/* comparison */
+void bigNeg(void);			/* negation */
+void bigAdd(void);			/* addition */
+void bigSub(void);			/* subtraction */
+void bigMul(void);			/* multiplication */
+void bigDiv(void);			/* division */
+
+void bigFromInt(int n);			/* conversion int --> big */
+int bigToInt(void);			/* conversion big --> int */
+
+void bigRead(FILE *in);			/* read a big integer */
+void bigPrint(FILE *out);		/* print a big integer */
+
+void bigDump(FILE *out, BigObjRef bigObjRef);	/* dump a big integer object */
+
+
+#endif /* _BIGINT_H_ */
--- a/bigint/build/include/support.h
+++ b/bigint/build/include/support.h
@@ -0,0 +1,15 @@
+/*
+ * support.h -- object representation and support functions
+ */
+
+
+#ifndef _SUPPORT_H_
+#define _SUPPORT_H_
+
+/* support functions */
+
+void fatalError(char *msg);		/* print a message and exit */
+void * newPrimObject(int dataSize);	/* create a new primitive object */
+void * getPrimObjectDataPointer(void * primObject);
+
+#endif /* _SUPPORT_H_ */
--- a/bigint/build/lib/libbigint.a
+++ b/bigint/build/lib/libbigint.a
--- a/bigint/src/Makefile
+++ b/bigint/src/Makefile
@@ -0,0 +1,26 @@
+#
+# Makefile for big integer library
+#
+
+BUILD = ../build
+
+CC = gcc
+CFLAGS = -g -Wall
+
+all:		support.h bigint.h libbigint.a
+
+install:	all
+		mkdir -p $(BUILD)/include
+		cp support.h $(BUILD)/include
+		cp bigint.h $(BUILD)/include
+		mkdir -p $(BUILD)/lib
+		cp libbigint.a $(BUILD)/lib
+
+libbigint.a:	bigint.o
+		ar -crs libbigint.a bigint.o
+
+bigint.o:	bigint.c bigint.h support.h
+		$(CC) $(CFLAGS) -o bigint.o -c bigint.c
+
+clean:
+		rm -f *~ bigint.o libbigint.a
--- a/bigint/src/bigint.c
+++ b/bigint/src/bigint.c
@@ -0,0 +1,987 @@
+/*
+ * bigint.c -- big integer library
+ */
+
+
+#include <stdio.h>
+#include <ctype.h>
+
+#include "bigint.h"
+
+/**************************************************************/
+
+/* debugging */
+
+
+#define DIV_CHK_01	0
+#define DIV_CHK_02	0
+#define DIV_CHK_03	0
+#define DIV_CHK_04	0
+#define DIV_CHK_05	0
+#define DIV_CHK_06	0
+#define DIV_CHK_07	0
+#define DIV_CHK_08	0
+#define DIV_CHK_09	0
+#define DIV_CHK_10	0
+#define DIV_CHK_11	0
+
+
+/**************************************************************/
+
+/* big integer representation */
+
+
+#define BIG_NEGATIVE		((unsigned char) 0)
+#define BIG_POSITIVE		((unsigned char) 1)
+
+
+#define BIG_PTR(bigObjRef)			((Big *) (getPrimObjectDataPointer(bigObjRef)))
+#define GET_ND(bigObjRef)			(BIG_PTR(bigObjRef)->nd)
+#define SET_ND(bigObjRef, val)		(BIG_PTR(bigObjRef)->nd = (val))
+#define GET_SIGN(bigObjRef)		(BIG_PTR(bigObjRef)->sign)
+#define SET_SIGN(bigObjRef, val)		(BIG_PTR(bigObjRef)->sign = (val))
+#define GET_DIGIT(bigObjRef, i)		(BIG_PTR(bigObjRef)->digits[i])
+#define SET_DIGIT(bigObjRef, i, val)	(BIG_PTR(bigObjRef)->digits[i] = (val))
+
+
+/**************************************************************/
+
+/* global data */
+
+
+/*
+ * registers of the big integer processor
+ */
+BIP bip = {
+  NULL,		/* op1 */
+  NULL,		/* op2 */
+  NULL,		/* res */
+  NULL,		/* rem */
+};
+
+
+/**************************************************************/
+
+
+/*
+ * construct a new big integer object
+ *
+ * number of digits is given by parameter
+ * a reference to a proper object is returned
+ * but no component of the big integer is set
+ *
+ * ATTENTION: All object references stored in
+ * places other than the bip registers may become
+ * invalid as soon as this function is called!
+ */
+static BigObjRef newBig(int nd) {
+  int dataSize;
+  BigObjRef bigObjRef;
+
+  dataSize = sizeof(int) + 1 + nd;
+  bigObjRef = newPrimObject(dataSize);
+  return bigObjRef;
+}
+
+
+/**************************************************************/
+
+/* big integer unsigned arithmetic */
+
+
+/*
+ * exchange bip.op1 and bip.op2
+ */
+static void bigXchg(void) {
+  BigObjRef tmp;
+
+  tmp = bip.op1;
+  bip.op1 = bip.op2;
+  bip.op2 = tmp;
+}
+
+
+/*
+ * big integer unsigned comparison
+ *
+ * operands in bip.op1 and bip.op2
+ * result is < 0, = 0, or > 0 if and only if the
+ * same relation holds for bip.op1 and bip.op2
+ */
+static int bigUcmp(void) {
+  int nd1;
+  int nd2;
+  int diff;
+
+  /* compare sizes */
+  nd1 = GET_ND(bip.op1);
+  nd2 = GET_ND(bip.op2);
+  if (nd1 != nd2) {
+    /* sizes are different: we know the bigger number */
+    return nd1 - nd2;
+  }
+  /* sizes are equal: we must look at the digits */
+  while (nd1--) {
+    diff = (int) GET_DIGIT(bip.op1, nd1) -
+           (int) GET_DIGIT(bip.op2, nd1);
+    if (diff != 0) {
+      return diff;
+    }
+  }
+  /* the numbers are equal */
+  return 0;
+}
+
+
+/*
+ * big integer unsigned addition
+ *
+ * operands in bip.op1 and bip.op2
+ * result in bip.res
+ */
+static void bigUadd(void) {
+  int nd1;
+  int nd2;
+  int i;
+  unsigned short carry;
+  unsigned short aux;
+  int xchgFlag;
+
+  /* make sure op1 has at least as many digits as op2 */
+  nd1 = GET_ND(bip.op1);
+  nd2 = GET_ND(bip.op2);
+  if (nd1 < nd2) {
+    /* exchange operands */
+    bigXchg();
+    i = nd1;
+    nd1 = nd2;
+    nd2 = i;
+    xchgFlag = 1;
+  } else {
+    /* don't exchange operands */
+    xchgFlag = 0;
+  }
+  /* allocate result */
+  bip.res = newBig(nd1 + 1);
+  /* copy op2 to result */
+  for (i = 0; i < nd2; i++) {
+    SET_DIGIT(bip.res, i, GET_DIGIT(bip.op2, i));
+  }
+  /* fill result with 0 up to size of op1 */
+  for (; i < nd1; i++) {
+    SET_DIGIT(bip.res, i, 0);
+  }
+  /* res = op1 + res */
+  carry = 0x00;
+  for (i = 0; i < nd1; i++) {
+    aux = (unsigned short) GET_DIGIT(bip.op1, i) +
+          (unsigned short) GET_DIGIT(bip.res, i) +
+          carry;
+    SET_DIGIT(bip.res, i, aux & 0xFF);
+    carry = aux >> 8;
+  }
+  SET_DIGIT(bip.res, i, carry);
+  /* determine actual size of result */
+  i = nd1 + 1;
+  while (--i >= 0 && GET_DIGIT(bip.res, i) == 0) ;
+  SET_ND(bip.res, i + 1);
+  /* restore operands */
+  if (xchgFlag) {
+    bigXchg();
+  }
+}
+
+
+/*
+ * big integer unsigned subtraction
+ *
+ * operands in bip.op1 and bip.op2
+ * result in bip.res, must not be negative
+ */
+static void bigUsub(void) {
+  int nd1;
+  int nd2;
+  int i;
+  unsigned short carry;
+  unsigned short aux;
+
+  /* op1 must have at least as many digits as op2 */
+  nd1 = GET_ND(bip.op1);
+  nd2 = GET_ND(bip.op2);
+  if (nd1 < nd2) {
+    /* unsigned subtraction would yield negative result */
+    fatalError("internal library error #1 - THIS SHOULD NEVER HAPPEN!");
+  }
+  /* allocate result */
+  bip.res = newBig(nd1);
+  /* copy op2 to result */
+  for (i = 0; i < nd2; i++) {
+    SET_DIGIT(bip.res, i, GET_DIGIT(bip.op2, i));
+  }
+  /* fill result with 0 up to size of op1 */
+  for (; i < nd1; i++) {
+    SET_DIGIT(bip.res, i, 0);
+  }
+  /* res = op1 - res */
+  carry = 0x01;
+  for (i = 0; i < nd1; i++) {
+    aux = (unsigned short) GET_DIGIT(bip.op1, i) -
+          (unsigned short) GET_DIGIT(bip.res, i) +
+          carry + 0xFF;
+    SET_DIGIT(bip.res, i, aux & 0xFF);
+    carry = aux >> 8;
+  }
+  if (carry != 0x01) {
+    /* unsigned subtraction would yield negative result */
+    fatalError("internal library error #2 - THIS SHOULD NEVER HAPPEN!");
+  }
+  /* determine actual size of result */
+  i = nd1;
+  while (--i >= 0 && GET_DIGIT(bip.res, i) == 0) ;
+  SET_ND(bip.res, i + 1);
+}
+
+
+/*
+ * big integer unsigned multiplication
+ *
+ * operands in bip.op1 and bip.op2
+ * result in bip.res
+ */
+static void bigUmul(void) {
+  int nd1;
+  int nd2;
+  int i, j, k;
+  unsigned short carry;
+  unsigned short aux;
+
+  /* get sizes of operands */
+  nd1 = GET_ND(bip.op1);
+  nd2 = GET_ND(bip.op2);
+  /* allocate result */
+  bip.res = newBig(nd1 + nd2);
+  /* reset lower nd1 digits of result */
+  for (i = 0; i < nd1; i++) {
+    SET_DIGIT(bip.res, i, 0);
+  }
+  /* res = op1 * op2 */
+  for (j = 0; j < nd2; j++) {
+    carry = 0x00;
+    for (k = j, i = 0; i < nd1; k++, i++) {
+      aux = (unsigned short) GET_DIGIT(bip.op1, i) *
+            (unsigned short) GET_DIGIT(bip.op2, j) +
+            (unsigned short) GET_DIGIT(bip.res, k) +
+            carry;
+      SET_DIGIT(bip.res, k, aux & 0xFF);
+      carry = aux >> 8;
+    }
+    SET_DIGIT(bip.res, k, carry);
+  }
+  /* determine actual size of result */
+  i = nd1 + nd2;
+  while (--i >= 0 && GET_DIGIT(bip.res, i) == 0) ;
+  SET_ND(bip.res, i + 1);
+}
+
+
+/*
+ * big integer unsigned division by single digit divisor
+ *
+ * dividend in bip.rem, divisor in parameter
+ * quotient in bip.rem, remainder is returned
+ */
+static unsigned char bigUdiv1(unsigned char divisor) {
+  BigObjRef tmp;
+  int nd;
+  int i;
+  unsigned short d, r;
+  unsigned short aux;
+
+  /* get size of dividend */
+  nd = GET_ND(bip.rem);
+  /* check for division by zero */
+  d = (unsigned short) divisor;
+  if (d == 0) {
+    fatalError("internal library error #3 - THIS SHOULD NEVER HAPPEN!");
+  }
+  /* allocate result */
+  tmp = newBig(nd);
+  /* tmp = dividend / divisor, r = dividend % divisor */
+  r = 0;
+  for (i = nd - 1; i >= 0; i--) {
+    aux = (r << 8) | (unsigned short) GET_DIGIT(bip.rem, i);
+    SET_DIGIT(tmp, i, aux / d);
+    r = aux % d;
+  }
+  /* determine actual size of quotient */
+  i = nd;
+  while (--i >= 0 && GET_DIGIT(tmp, i) == 0) ;
+  SET_ND(tmp, i + 1);
+  /* store quotient */
+  bip.rem = tmp;
+  /* return remainder */
+  return (unsigned char) r;
+}
+
+
+/*
+ * big integer unsigned division
+ *
+ * dividend in bip.op1, divisor in bip.op2
+ * quotient in bip.res, remainder in bip.rem
+ */
+static void bigUdiv(void) {
+  BigObjRef tmp;
+  int nd1;
+  int nd2;
+  int nd3;
+  int i, j, k, l;
+  unsigned char r;
+  unsigned short scale;
+  unsigned short carry;
+  unsigned short aux;
+  unsigned short qhat;
+  unsigned short v1, v2;
+  unsigned short uj0, uj1, uj2, two;
+
+  /* get sizes of operands */
+  nd1 = GET_ND(bip.op1);
+  nd2 = GET_ND(bip.op2);
+  /* check for division by zero */
+  if (nd2 == 0) {
+    fatalError("division by zero");
+  }
+  /* check for small dividend */
+  if (bigUcmp() < 0) {
+    /* res = 0 */
+    bip.res = newBig(0);
+    SET_ND(bip.res, 0);
+    /* rem = op1; BUT THIS HAS TO BE A COPY! */
+    bip.rem = newBig(nd1);
+    for (i = 0; i < nd1; i++) {
+      SET_DIGIT(bip.rem, i, GET_DIGIT(bip.op1, i));
+    }
+    SET_ND(bip.rem, nd1);
+    return;
+  }
+  /* check for single digit divisor */
+  if (nd2 == 1) {
+    /* yes - use simple division by single digit divisor */
+    bip.rem = bip.op1;
+    r = bigUdiv1(GET_DIGIT(bip.op2, 0));
+    bip.res = bip.rem;
+    if (r == 0) {
+      bip.rem = newBig(0);
+      SET_ND(bip.rem, 0);
+    } else {
+      bip.rem = newBig(1);
+      SET_ND(bip.rem, 1);
+      SET_DIGIT(bip.rem, 0, r);
+    }
+    return;
+  }
+  /*
+   * now for the general case
+   */
+#if DIV_CHK_01
+  printf("div_chk #01: division, general case\n");
+  printf("             dividend = ");
+  bigDump(stdout, bip.op1);
+  printf("\n");
+  printf("             divisor  = ");
+  bigDump(stdout, bip.op2);
+  printf("\n");
+#endif
+  /* determine scale factor for normalization */
+  scale = (unsigned short) 256 /
+          ((unsigned short) GET_DIGIT(bip.op2, nd2 - 1) + 1);
+#if DIV_CHK_02
+  printf("div_chk #02: scale factor = %02X\n", scale);
+#endif
+  /* normalize dividend, result is in bip.rem */
+  bip.rem = newBig(nd1 + 1);
+  carry = 0x00;
+  for (i = 0; i < nd1; i++) {
+    aux = (unsigned short) GET_DIGIT(bip.op1, i) * scale +
+          carry;
+    SET_DIGIT(bip.rem, i, aux & 0xFF);
+    carry = aux >> 8;
+  }
+  SET_DIGIT(bip.rem, i, carry);
+  SET_ND(bip.rem, nd1 + 1);
+#if DIV_CHK_03
+  printf("div_chk #03: normalized dividend = ");
+  bigDump(stdout, bip.rem);
+  printf("\n");
+#endif
+  /* normalize divisor, result is in bip.res */
+  bip.res = newBig(nd2);
+  carry = 0x00;
+  for (i = 0; i < nd2; i++) {
+    aux = (unsigned short) GET_DIGIT(bip.op2, i) * scale +
+          carry;
+    SET_DIGIT(bip.res, i, aux & 0xFF);
+    carry = aux >> 8;
+  }
+  if (carry != 0x00) {
+    /* overflow in divisor normalization */
+    fatalError("internal library error #4 - THIS SHOULD NEVER HAPPEN!");
+  }
+  SET_ND(bip.res, nd2);
+#if DIV_CHK_04
+  printf("div_chk #04: normalized divisor  = ");
+  bigDump(stdout, bip.res);
+  printf("\n");
+#endif
+  /* allocate quotient */
+  nd3 = nd1 - nd2 + 1;
+  tmp = newBig(nd3);
+  /* extract the two most significand digits of divisor */
+  v1 = (unsigned short) GET_DIGIT(bip.res, nd2 - 1);
+  v2 = (unsigned short) GET_DIGIT(bip.res, nd2 - 2);
+  /* loop on digits of dividend and compute digits of quotient */
+  /* j is index into dividend, k is index into quotient */
+  for (j = nd1, k = nd3 - 1; k >= 0; j--, k--) {
+#if DIV_CHK_05
+    printf("div_chk #05: j = %d, k = %d\n", j, k);
+#endif
+    /* calculate qhat */
+    uj0 = (unsigned short) GET_DIGIT(bip.rem, j);
+    uj1 = (unsigned short) GET_DIGIT(bip.rem, j - 1);
+    uj2 = (unsigned short) GET_DIGIT(bip.rem, j - 2);
+    two = (uj0 << 8) | uj1;
+    if (uj0 == v1) {
+      qhat = (unsigned short) 255;
+#if DIV_CHK_06
+      printf("div_chk #06a: qhat = %02X\n", qhat);
+#endif
+    } else {
+      qhat = two / v1;
+#if DIV_CHK_06
+      printf("div_chk #06b: qhat = %02X\n", qhat);
+#endif
+    }
+    while (qhat * v2 > (((two - qhat * v1) << 8) | uj2)) {
+      qhat--;
+#if DIV_CHK_07
+      printf("div_chk #07: qhat decremented, is now %02X\n", qhat);
+#endif
+    }
+    /* multiply and subtract */
+    /* l is index into dividend, i is index into divisor */
+    carry = 0xFF;
+    for (l = j - nd2, i = 0; i < nd2; l++, i++) {
+      aux = (unsigned short) GET_DIGIT(bip.rem, l) -
+            (unsigned short) GET_DIGIT(bip.res, i) * qhat +
+            carry + 0xFE01;
+      SET_DIGIT(bip.rem, l, aux & 0xFF);
+      carry = aux >> 8;
+    }
+    aux = (unsigned short) GET_DIGIT(bip.rem, l) +
+          carry + 0xFE01;
+    SET_DIGIT(bip.rem, l, aux & 0xFF);
+    carry = aux >> 8;
+#if DIV_CHK_08
+    printf("div_chk #08: remainder = ");
+    bigDump(stdout, bip.rem);
+    printf("\n");
+#endif
+    /* test remainder and possibly add back */
+    if (carry != 0xFF) {
+      /* qhat is one too large */
+      qhat--;
+#if DIV_CHK_09
+      printf("div_chk #09: qhat final correction, is now %02X\n", qhat);
+#endif
+      /* add back */
+      /* l is index into dividend, i is index into divisor */
+      carry = 0x00;
+      for (l = j - nd2, i = 0; i < nd2; l++, i++) {
+        aux = (unsigned short) GET_DIGIT(bip.rem, l) +
+              (unsigned short) GET_DIGIT(bip.res, i) +
+              carry;
+        SET_DIGIT(bip.rem, l, aux & 0xFF);
+        carry = aux >> 8;
+      }
+      aux = (unsigned short) GET_DIGIT(bip.rem, l) +
+            carry;
+      SET_DIGIT(bip.rem, l, aux & 0xFF);
+      carry = aux >> 8;
+      if (carry != 0x01) {
+        /* missing carry in add-back sum */
+        fatalError("internal library error #5 - THIS SHOULD NEVER HAPPEN!");
+      }
+#if DIV_CHK_10
+      printf("div_chk #10: remainder = ");
+      bigDump(stdout, bip.rem);
+      printf("\n");
+#endif
+    }
+    /* store quotient digit */
+    SET_DIGIT(tmp, k, qhat);
+#if DIV_CHK_11
+    printf("div_chk #11: quotient digit = %02X\n", qhat);
+#endif
+  }
+  /* finish quotient */
+  i = nd3;
+  while (--i >= 0 && GET_DIGIT(tmp, i) == 0) ;
+  SET_ND(tmp, i + 1);
+  bip.res = tmp;
+  /* finish and unnormalize remainder */
+  i = nd1 + 1;
+  while (--i >= 0 && GET_DIGIT(bip.rem, i) == 0) ;
+  SET_ND(bip.rem, i + 1);
+  r = bigUdiv1(scale);
+  if (r != 0) {
+    /* non-zero remainder in unnormalization */
+    fatalError("internal library error #6 - THIS SHOULD NEVER HAPPEN!");
+  }
+}
+
+
+/**************************************************************/
+
+/* nil reference exception */
+
+
+static void nilRefException(void) {
+  fatalError("big integer library detected illegal nil reference");
+}
+
+
+/**************************************************************/
+
+/* big integer arithmetic */
+
+
+/*
+ * big integer sign
+ *
+ * operand in bip.op1
+ * result is < 0, = 0, or > 0 if and only if
+ * the same relation holds for bip.op1
+ */
+int bigSgn(void) {
+  if (bip.op1 == NULL) {
+    nilRefException();
+  }
+  if (GET_ND(bip.op1) == 0) {
+    return 0;
+  }
+  if (GET_SIGN(bip.op1) == BIG_POSITIVE) {
+    return 1;
+  } else {
+    return -1;
+  }
+}
+
+
+/*
+ * big integer comparison
+ *
+ * operands in bip.op1 and bip.op2
+ * result is < 0, = 0, or > 0 if and only if the
+ * same relation holds for bip.op1 and bip.op2
+ */
+int bigCmp(void) {
+  if (bip.op1 == NULL ||
+      bip.op2 == NULL) {
+    nilRefException();
+  }
+  if (GET_SIGN(bip.op1) == BIG_POSITIVE) {
+    if (GET_SIGN(bip.op2) == BIG_POSITIVE) {
+      /* op1 >= 0 and op2 >= 0 */
+      return bigUcmp();
+    } else {
+      /* op1 >= 0 and op2 < 0 */
+      return 1;
+    }
+  } else {
+    if (GET_SIGN(bip.op2) == BIG_POSITIVE) {
+      /* op1 < 0 and op2 >= 0 */
+      return -1;
+    } else {
+      /* op1 < 0 and op2 < 0 */
+      return -bigUcmp();
+    }
+  }
+}
+
+
+/*
+ * big integer negation
+ *
+ * operand in bip.op1
+ * result in bip.res
+ */
+void bigNeg(void) {
+  int nd;
+  int i;
+
+  if (bip.op1 == NULL) {
+    nilRefException();
+  }
+  /* make copy of operand */
+  nd = GET_ND(bip.op1);
+  bip.res = newBig(nd);
+  for (i = 0; i < nd; i++) {
+    SET_DIGIT(bip.res, i, GET_DIGIT(bip.op1, i));
+  }
+  SET_ND(bip.res, nd);
+  /* store inverted sign */
+  if (GET_SIGN(bip.op1) == BIG_NEGATIVE || nd == 0) {
+    SET_SIGN(bip.res, BIG_POSITIVE);
+  } else {
+    SET_SIGN(bip.res, BIG_NEGATIVE);
+  }
+}
+
+
+/*
+ * big integer addition
+ *
+ * operands in bip.op1 and bip.op2
+ * result in bip.res
+ */
+void bigAdd(void) {
+  if (bip.op1 == NULL ||
+      bip.op2 == NULL) {
+    nilRefException();
+  }
+  if (GET_SIGN(bip.op1) == BIG_POSITIVE) {
+    if (GET_SIGN(bip.op2) == BIG_POSITIVE) {
+      /* op1 >= 0 and op2 >= 0 */
+      bigUadd();
+      SET_SIGN(bip.res, BIG_POSITIVE);
+    } else {
+      /* op1 >= 0 and op2 < 0 */
+      if (bigUcmp() >= 0) {
+        /* |op1| >= |op2| */
+        bigUsub();
+        SET_SIGN(bip.res, BIG_POSITIVE);
+      } else {
+        /* |op1| < |op2| */
+        bigXchg();
+        bigUsub();
+        SET_SIGN(bip.res, BIG_NEGATIVE);
+        bigXchg();
+      }
+    }
+  } else {
+    if (GET_SIGN(bip.op2) == BIG_POSITIVE) {
+      /* op1 < 0 and op2 >= 0 */
+      if (bigUcmp() <= 0) {
+        /* |op1| <= |op2| */
+        bigXchg();
+        bigUsub();
+        SET_SIGN(bip.res, BIG_POSITIVE);
+        bigXchg();
+      } else {
+        /* |op1| > |op2| */
+        bigUsub();
+        SET_SIGN(bip.res, BIG_NEGATIVE);
+      }
+    } else {
+      /* op1 < 0 and op2 < 0 */
+      bigUadd();
+      SET_SIGN(bip.res, BIG_NEGATIVE);
+    }
+  }
+}
+
+
+/*
+ * big integer subtraction
+ *
+ * operands in bip.op1 and bip.op2
+ * result in bip.res
+ */
+void bigSub(void) {
+  if (bip.op1 == NULL ||
+      bip.op2 == NULL) {
+    nilRefException();
+  }
+  if (GET_SIGN(bip.op1) == BIG_POSITIVE) {
+    if (GET_SIGN(bip.op2) == BIG_POSITIVE) {
+      /* op1 >= 0 and op2 >= 0 */
+      if (bigUcmp() >= 0) {
+        /* |op1| >= |op2| */
+        bigUsub();
+        SET_SIGN(bip.res, BIG_POSITIVE);
+      } else {
+        /* |op1| < |op2| */
+        bigXchg();
+        bigUsub();
+        SET_SIGN(bip.res, BIG_NEGATIVE);
+        bigXchg();
+      }
+    } else {
+      /* op1 >= 0 and op2 < 0 */
+      bigUadd();
+      SET_SIGN(bip.res, BIG_POSITIVE);
+    }
+  } else {
+    if (GET_SIGN(bip.op2) == BIG_POSITIVE) {
+      /* op1 < 0 and op2 >= 0 */
+      bigUadd();
+      SET_SIGN(bip.res, BIG_NEGATIVE);
+    } else {
+      /* op1 < 0 and op2 < 0 */
+      if (bigUcmp() <= 0) {
+        /* |op1| <= |op2| */
+        bigXchg();
+        bigUsub();
+        SET_SIGN(bip.res, BIG_POSITIVE);
+        bigXchg();
+      } else {
+        /* |op1| > |op2| */
+        bigUsub();
+        SET_SIGN(bip.res, BIG_NEGATIVE);
+      }
+    }
+  }
+}
+
+
+/*
+ * big integer multiplication
+ *
+ * operands in bip.op1 and bip.op2
+ * result in bip.res
+ */
+void bigMul(void) {
+  if (bip.op1 == NULL ||
+      bip.op2 == NULL) {
+    nilRefException();
+  }
+  bigUmul();
+  if (GET_SIGN(bip.op1) == GET_SIGN(bip.op2) || GET_ND(bip.res) == 0) {
+    SET_SIGN(bip.res, BIG_POSITIVE);
+  } else {
+    SET_SIGN(bip.res, BIG_NEGATIVE);
+  }
+}
+
+
+/*
+ * big integer division, truncating towards zero
+ *
+ * dividend in bip.op1, divisor in bip.op2
+ * quotient in bip.res, remainder in bip.rem
+ */
+void bigDiv(void) {
+  if (bip.op1 == NULL ||
+      bip.op2 == NULL) {
+    nilRefException();
+  }
+  bigUdiv();
+  if (GET_SIGN(bip.op1) == GET_SIGN(bip.op2) || GET_ND(bip.res) == 0) {
+    SET_SIGN(bip.res, BIG_POSITIVE);
+  } else {
+    SET_SIGN(bip.res, BIG_NEGATIVE);
+  }
+  if (GET_SIGN(bip.op1) == BIG_POSITIVE || GET_ND(bip.rem) == 0) {
+    SET_SIGN(bip.rem, BIG_POSITIVE);
+  } else {
+    SET_SIGN(bip.rem, BIG_NEGATIVE);
+  }
+}
+
+
+/**************************************************************/
+
+/* big integer conversions */
+
+
+/*
+ * conversion int --> big
+ *
+ * operand in parameter
+ * result in bip.res
+ */
+void bigFromInt(int n) {
+  int i;
+
+  bip.res = newBig(sizeof(int));
+  if (n < 0) {
+    n = -n;
+    SET_SIGN(bip.res, BIG_NEGATIVE);
+  } else {
+    SET_SIGN(bip.res, BIG_POSITIVE);
+  }
+  for (i = 0; i < sizeof(int); i++) {
+    SET_DIGIT(bip.res, i, n & 0xFF);
+    n >>= 8;
+  }
+  while (--i >= 0 && GET_DIGIT(bip.res, i) == 0) ;
+  SET_ND(bip.res, i + 1);
+}
+
+
+/*
+ * conversion big --> int
+ *
+ * operand in bip.op1
+ * result is returned
+ */
+int bigToInt(void) {
+  int nd;
+  int i;
+  int res;
+
+  if (bip.op1 == NULL) {
+    nilRefException();
+  }
+  nd = GET_ND(bip.op1);
+  if (nd > 4 ||
+      (nd == 4 && GET_DIGIT(bip.op1, 3) >= 0x80)) {
+    fatalError("big integer too big for conversion to int");
+  }
+  res = 0;
+  for (i = nd - 1; i >= 0; i--) {
+    res <<= 8;
+    res |= (unsigned int) GET_DIGIT(bip.op1, i);
+  }
+  if (GET_SIGN(bip.op1) == BIG_NEGATIVE) {
+    res = -res;
+  }
+  return res;
+}
+
+
+/**************************************************************/
+
+/* big integer I/O */
+
+
+/*
+ * read a big integer
+ *
+ * stream to read from in parameter
+ * result in bip.res
+ */
+void bigRead(FILE *in) {
+  int c;
+  int positive;
+
+  c = fgetc(in);
+  while (isspace(c)) {
+    c = fgetc(in);
+  }
+  if (c == '-') {
+    positive = 0;
+    c = fgetc(in);
+  } else {
+    positive = 1;
+    if (c == '+') {
+      c = fgetc(in);
+    }
+  }
+  if (!isdigit(c)) {
+    fatalError("no digits in input");
+  }
+  bigFromInt(10);
+  bip.rem = bip.res;
+  bigFromInt(0);
+  while (isdigit(c)) {
+    bip.op1 = bip.res;
+    bip.op2 = bip.rem;
+    bigUmul();
+    bip.op1 = bip.res;
+    bigFromInt(c - '0');
+    bip.op2 = bip.res;
+    bigUadd();
+    c = fgetc(in);
+  }
+  ungetc(c, in);
+  if (positive || GET_ND(bip.res) == 0) {
+    SET_SIGN(bip.res, BIG_POSITIVE);
+  } else {
+    SET_SIGN(bip.res, BIG_NEGATIVE);
+  }
+}
+
+
+/*
+ * print a big integer
+ *
+ * stream to write to in parameter
+ * number to print in bip.op1
+ */
+void bigPrint(FILE *out) {
+  int nd;
+  unsigned char r;
+  int skipZero;
+
+  if (bip.op1 == NULL) {
+    nilRefException();
+  }
+  nd = GET_ND(bip.op1);
+  if (nd == 0) {
+    fprintf(out, "0");
+    return;
+  }
+  if (GET_SIGN(bip.op1) == BIG_NEGATIVE) {
+    fprintf(out, "-");
+  }
+  /* number of digits in base 10 = number of digits
+     in base 256 * log10(256), and log10(256) < 2.5  */
+  nd = 2 * nd + nd / 2;
+  bip.rem = bip.op1;
+  bigFromInt(10);
+  bip.op2 = bip.res;
+  bigFromInt(1);
+  while (nd != 0) {
+    bip.op1 = bip.res;
+    bigUmul();
+    nd--;
+  }
+  bip.op1 = bip.rem;
+  bip.op2 = bip.res;
+  skipZero = 1;
+  do {
+    bigUdiv();
+    if (GET_ND(bip.res) == 0) {
+      if (!skipZero) {
+        fprintf(out, "0");
+      }
+    } else {
+      if (GET_ND(bip.res) != 1) {
+        fatalError("internal library error #7 - THIS SHOULD NEVER HAPPEN!");
+      }
+      fprintf(out, "%c", GET_DIGIT(bip.res, 0) + '0');
+      skipZero = 0;
+    }
+    bip.op1 = bip.rem;
+    bip.rem = bip.op2;
+    r = bigUdiv1(10);
+    bip.op2 = bip.rem;
+  } while (r == 0);
+}
+
+
+/**************************************************************/
+
+/* debugging */
+
+
+/*
+ * dump a big integer object
+ */
+void bigDump(FILE *out, BigObjRef bigObjRef) {
+  int nd;
+  unsigned char sign;
+  int i;
+
+  if (bigObjRef == NULL) {
+    nilRefException();
+  }
+  nd = GET_ND(bigObjRef);
+  sign = GET_SIGN(bigObjRef);
+  fprintf(out, "[%d %c", nd, sign == BIG_POSITIVE ? '+' : '-');
+  for (i = 0; i < nd; i++) {
+    fprintf(out, " %02X", GET_DIGIT(bigObjRef, i));
+  }
+  fprintf(out, "]");
+}
--- a/bigint/src/bigint.h
+++ b/bigint/src/bigint.h
@@ -0,0 +1,60 @@
+/*
+ * bigint.h -- big integer library
+ */
+
+
+#ifndef _BIGINT_H_
+#define _BIGINT_H_
+
+
+/* object representation */
+typedef void* BigObjRef;
+
+
+#include <stdio.h>
+
+
+typedef struct {
+  int nd;			/* number of digits; array may be bigger */
+				/* nd = 0 exactly when number = 0 */
+  unsigned char sign;		/* one of BIG_NEGATIVE or BIG_POSITIVE */
+				/* zero always has BIG_POSITIVE here */
+  unsigned char digits[1];	/* the digits proper; number base is 256 */
+				/* LS digit first; MS digit is not zero */
+} Big;
+
+#include "support.h"
+
+
+/* big integer processor registers */
+
+typedef struct {
+  BigObjRef op1;			/* first (or single) operand */
+  BigObjRef op2;			/* second operand (if present) */
+  BigObjRef res;			/* result of operation */
+  BigObjRef rem;			/* remainder in case of division */
+} BIP;
+
+extern BIP bip;			/* registers of the processor */
+
+
+/* big integer processor functions */
+
+int bigSgn(void);			/* sign */
+int bigCmp(void);			/* comparison */
+void bigNeg(void);			/* negation */
+void bigAdd(void);			/* addition */
+void bigSub(void);			/* subtraction */
+void bigMul(void);			/* multiplication */
+void bigDiv(void);			/* division */
+
+void bigFromInt(int n);			/* conversion int --> big */
+int bigToInt(void);			/* conversion big --> int */
+
+void bigRead(FILE *in);			/* read a big integer */
+void bigPrint(FILE *out);		/* print a big integer */
+
+void bigDump(FILE *out, BigObjRef bigObjRef);	/* dump a big integer object */
+
+
+#endif /* _BIGINT_H_ */
--- a/bigint/src/bigint.o
+++ b/bigint/src/bigint.o
--- a/bigint/src/libbigint.a
+++ b/bigint/src/libbigint.a
--- a/bigint/src/support.h
+++ b/bigint/src/support.h
@@ -0,0 +1,15 @@
+/*
+ * support.h -- object representation and support functions
+ */
+
+
+#ifndef _SUPPORT_H_
+#define _SUPPORT_H_
+
+/* support functions */
+
+void fatalError(char *msg);		/* print a message and exit */
+void * newPrimObject(int dataSize);	/* create a new primitive object */
+void * getPrimObjectDataPointer(void * primObject);
+
+#endif /* _SUPPORT_H_ */
--- a/bigint/tst/Makefile
+++ b/bigint/tst/Makefile
@@ -0,0 +1,28 @@
+#
+# Makefile for big integer test
+#
+
+BUILD = ../build
+
+CC = gcc
+CFLAGS = -g -Wall -I$(BUILD)/include
+LDFLAGS = -g -Wall -L$(BUILD)/lib
+LDLIBS = -lbigint
+
+all:		testbip
+
+install:	all
+		mkdir -p $(BUILD)/bin
+		cp testbip $(BUILD)/bin
+
+testbip:	testbip.o support.o
+		$(CC) $(LDFLAGS) -o testbip testbip.o support.o $(LDLIBS)
+
+testbip.o:	testbip.c
+		$(CC) $(CFLAGS) -o testbip.o -c testbip.c
+
+support.o:	support.c
+		$(CC) $(CFLAGS) -o support.o -c support.c
+
+clean:
+		rm -f *~ testbip.o support.o testbip
--- a/bigint/tst/support.c
+++ b/bigint/tst/support.c
@@ -0,0 +1,55 @@
+/*
+ * support.c -- support functions for big integer library
+ */
+
+
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "support.h"
+
+typedef struct {
+      unsigned int size;                /* byte count of payload data */
+        unsigned char data[1];  /* payload data, size as needed */
+} *ObjRef;
+
+
+/*
+ * This routine is called in case a fatal error has occurred.
+ * It should print the error message and terminate the program.
+ */
+void fatalError(char *msg) {
+  printf("Fatal error: %s\n", msg);
+  exit(1);
+}
+
+
+/*
+ * This function is called whenever a new primitive object with
+ * a certain amount of internal memory is needed. It should return
+ * an object reference to a regular object, which contains a freely
+ * usable memory area of at least the requested size (measured in
+ * bytes). The memory area need not be initialized in any way.
+ *
+ * Note that this function may move all objects in memory at will
+ * (due to, e.g., garbage collection), as long as the pointers in
+ * the global "bip" structure point to the correct objects when
+ * the function returns.
+ */
+void * newPrimObject(int dataSize) {
+  ObjRef bigObjRef;
+
+  bigObjRef = malloc(sizeof(unsigned int) +
+                  dataSize * sizeof(unsigned char));
+  if (bigObjRef == NULL) {
+    fatalError("newPrimObject() got no memory");
+  }
+  bigObjRef->size = dataSize;
+  return bigObjRef;
+}
+
+void * getPrimObjectDataPointer(void * obj){
+    ObjRef oo = ((ObjRef)  (obj));
+    return oo->data;
+}
+
--- a/bigint/tst/support.o
+++ b/bigint/tst/support.o
--- a/bigint/tst/testbip
+++ b/bigint/tst/testbip
--- a/bigint/tst/testbip.c
+++ b/bigint/tst/testbip.c
--- a/bigint/tst/testbip.o
+++ b/bigint/tst/testbip.o
--- a/code.c
+++ b/code.c
@@ -0,0 +1,38 @@
+#ifndef CODE
+
+#define CODE
+
+#include "instruktion.c"
+
+unsigned int code1[] = {
+  (PUSHC << 24) | IMMEDIATE(3),
+  (PUSHC << 24) | IMMEDIATE(4),
+  (ADD << 24),
+  (PUSHC << 24) | IMMEDIATE(10),
+  (PUSHC << 24) | IMMEDIATE(6),
+  (SUB << 24),
+  (MUL << 24),
+  (WRINT << 24),
+  (PUSHC << 24) | IMMEDIATE(10),
+  (WRCHR << 24),
+  (HALT)
+};
+unsigned int code2[] = {
+  (PUSHC << 24) | IMMEDIATE(SIGN_EXTEND(-2)),
+  (RDINT << 24),
+  (MUL << 24),
+  (PUSHC << 24) | IMMEDIATE(3),
+  (ADD << 24),
+  (WRINT << 24),
+  (PUSHC << 24) | IMMEDIATE('\n'),
+  (WRCHR << 24),
+  (HALT << 24)
+};
+unsigned int code3[] = {
+  (RDCHR << 24),
+  (WRINT << 24),
+  (PUSHC << 24) | IMMEDIATE('\n'),
+  (WRCHR << 24),
+  (HALT << 24)
+};
+#endif
--- a/codeReader.c
+++ b/codeReader.c
@@ -0,0 +1,37 @@
+#ifndef CODEREADER
+#define CODEREADER
+
+#include "consts.c"
+#include <stdio.h>
+#include <stdlib.h>
+#include "program.c"
+
+unsigned int fromFile(char *path, struct program program) {
+    unsigned int countInstructions;
+    unsigned int staticVars;
+    FILE *fptr;
+    fptr = fopen(path, "r");
+    if (fptr == NULL) {
+        printf("Error: cannot open code file %s", path);
+        exit(EXIT_FAILURE);
+    }
+    unsigned int buffer[4];
+    fread(buffer, 4, 4, fptr);
+    // Check file type
+    if (buffer[0] != 0x46424A4E) {
+        printf("Error: wrong file type");
+        exit(EXIT_FAILURE);
+    }
+    if (buffer[1] != VERSION) {
+        printf("Error: wrong version");
+        exit(EXIT_FAILURE);
+    }
+    countInstructions = buffer[2];
+    staticVars = buffer[3];
+    unsigned int instBuffer[countInstructions];
+    fread(instBuffer, 4, countInstructions, fptr);
+    copyToProgram(instBuffer, countInstructions, program);
+    return staticVars;
+}
+
+#endif /* ifdef CODEREADER */
--- a/compile_flags.txt
+++ b/compile_flags.txt
@@ -0,0 +1,3 @@
+-Ibigint/build/include
+-Lbigint/build/lib
+-lbigint
--- a/config.h.in
+++ b/config.h.in
@@ -1 +0,0 @@
-#define PROJECT_VERSION @PROJECT_VERSION@
--- a/consts.c
+++ b/consts.c
@@ -0,0 +1,7 @@
+#ifndef CONSTS
+#define CONSTS
+#define VERSION 7
+
+#endif /* ifndef CONSTS
+#define CONSTS
+#define VERSION 2; */
--- a/debugMenu.c
+++ b/debugMenu.c
@@ -0,0 +1,53 @@
+#ifndef DEBUGMENU
+#define DEBUGMENU
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "stack.c"
+#include "stack.c"
+
+void inspect(struct stack s, int fp){
+  //todo Does not work dont know why
+  char input[20];
+  char ref[20];
+  char refStr[20];
+  printf("DEBUG [inspect]: stack, datam object?");
+  fgets(input,20,stdin);
+  if (input[0] == 's') printStack(s, fp);
+  if (input[0] == 'd'){/* todo */ }
+  if (input[0] == 'o'){
+    scanf("%19s",ref);
+    ObjRefContainer container;
+    container = getRefs(s);
+    for (int i = 0; i<= container.size; i++) {
+      sprintf(refStr, "%p", (void *)&container.refs[i]);
+      if(strcmp(ref, refStr) == 0) printf("Adress exists\n");
+      else printf("Adress doeas not exist\n");
+      printf("%s",refStr);
+    }
+  }
+}
+void list(void){
+  //todo
+}
+void breakpoint(void){
+  //todo
+}
+
+void debugMenu(int fp, struct stack stack, int* debug, int point){
+  char input[20];
+  while (true) {
+    printf("DEBUG(%i): inspect, list, breakpoint, run, step, quit?",point);
+    fgets(input, 20, stdin);
+    printf("%s",input);
+    if(input[0] == 'i') {inspect(stack,fp);}
+    if(input[0] == 'l') list();
+    if(input[0] == 'b') breakpoint();
+    if(input[0] == 's') break;
+    if(input[0] == 'r') {*debug = 0; break;};
+    if(input[0] == 'q') exit(0);
+    strcpy(input, "");
+  }
+}
+
+#endif /* ifndef DEBUGMENU */
--- a/heap.c
+++ b/heap.c
@@ -0,0 +1,11 @@
+//
+// Created by Nils Polek on 23.01.24.
+//
+typedef struct {
+    int size;
+    int hcurrent;
+}heap;
+
+//void* alloc(int size){
+//    return {}
+//}
--- a/instruktion.c
+++ b/instruktion.c
@@ -0,0 +1,54 @@
+#ifndef INSREUKTION
+#define INSREUKTION
+
+#define IMMEDIATE(x) ((x) & 0x00FFFFFF)
+#define MSB (1 << (8 * sizeof(unsigned int) - 1))
+#define IS_PRIMITIVE(objRef) (((objRef)->size & MSB) == 0)
+#define SIGN_EXTEND(i) ((i) & 0x00800000 ? (i) | 0xFF000000 : (i))
+#define GET_ELEMENT_COUNT(objRef) ((objRef)->size & ~MSB)
+#define GET_REFS_PTR(objRef) ((ObjRef *) (objRef)-> data)
+
+#define HALT 0
+#define PUSHC 1
+#define ADD 2
+#define SUB 3
+#define MUL 4
+#define DIV 5
+#define MOD 6
+#define RDINT 7
+#define WRINT 8
+#define RDCHR 9
+#define WRCHR 10
+#define PUSHG 11
+#define POPG 12
+#define ASF 13
+#define RSF 14
+#define PUSHL 15
+#define POPL 16
+#define EQ 17
+#define NE 18
+#define LT 19
+#define LE 20
+#define GT 21
+#define GE 22
+#define JMP 23
+#define BRF 24
+#define BRT 25
+#define CALL 26
+#define RET 27
+#define DROP 28
+#define PUSHR 29
+#define POPR 30
+#define DUP 31
+#define NEW 32
+#define GETF 33
+#define PUTF 34
+#define NEWA 35
+#define GETFA 36
+#define PUTFA 37
+#define GETSZ 38
+#define PUSHN 39
+#define REFEQ 40
+#define REFNE 41
+
+#endif /* ifndef INSREUKTION */
--- a/nja/nja2
+++ b/nja/nja2
--- a/nja/nja3
+++ b/nja/nja3
--- a/nja/nja4
+++ b/nja/nja4
--- a/nja/nja5
+++ b/nja/nja5
--- a/nja/nja6
+++ b/nja/nja6
--- a/nja/nja7
+++ b/nja/nja7
--- a/nja/nja8
+++ b/nja/nja8
--- a/nja/nja?inline=false
+++ b/nja/nja?inline=false
--- a/njc/njc4
+++ b/njc/njc4
@@ -0,0 +1,14 @@
+--2024-01-14 15:07:13--  https://git.thm.de/arin07/KSP_public/-/raw/master/aufgaben/a4/njc?inline=false
+Loaded CA certificate '/etc/ssl/certs/ca-certificates.crt'
+Resolving git.thm.de (git.thm.de)... 212.201.6.138
+Connecting to git.thm.de (git.thm.de)|212.201.6.138|:443... connected.
+HTTP request sent, awaiting response... 200 OK
+Length: 137095 (134K) [application/octet-stream]
+Saving to: ‘njc?inline=false’
+
+     0K .......... .......... .......... .......... .......... 37% 1.23M 0s
+    50K .......... .......... .......... .......... .......... 74% 2.63M 0s
+   100K .......... .......... .......... ...                  100% 9.98M=0.06s
+
+2024-01-14 15:07:14 (2.13 MB/s) - ‘njc?inline=false’ saved [137095/137095]
+
--- a/njc/njc5
+++ b/njc/njc5
@@ -0,0 +1,14 @@
+--2024-01-14 15:07:20--  https://git.thm.de/arin07/KSP_public/-/raw/master/aufgaben/a5/njc?inline=false
+Loaded CA certificate '/etc/ssl/certs/ca-certificates.crt'
+Resolving git.thm.de (git.thm.de)... 212.201.6.138
+Connecting to git.thm.de (git.thm.de)|212.201.6.138|:443... connected.
+HTTP request sent, awaiting response... 200 OK
+Length: 137095 (134K) [application/octet-stream]
+Saving to: ‘njc?inline=false.1’
+
+     0K .......... .......... .......... .......... .......... 37% 1.21M 0s
+    50K .......... .......... .......... .......... .......... 74% 2.51M 0s
+   100K .......... .......... .......... ...                  100% 11.2M=0.06s
+
+2024-01-14 15:07:21 (2.08 MB/s) - ‘njc?inline=false.1’ saved [137095/137095]
+
--- a/njc/njc6
+++ b/njc/njc6
@@ -0,0 +1,14 @@
+--2024-01-14 15:07:28--  https://git.thm.de/arin07/KSP_public/-/raw/master/aufgaben/a6/njc?inline=false
+Loaded CA certificate '/etc/ssl/certs/ca-certificates.crt'
+Resolving git.thm.de (git.thm.de)... 212.201.6.138
+Connecting to git.thm.de (git.thm.de)|212.201.6.138|:443... connected.
+HTTP request sent, awaiting response... 200 OK
+Length: 137095 (134K) [application/octet-stream]
+Saving to: ‘njc?inline=false.2’
+
+     0K .......... .......... .......... .......... .......... 37% 1.02M 0s
+    50K .......... .......... .......... .......... .......... 74% 2.03M 0s
+   100K .......... .......... .......... ...                  100% 11.4M=0.07s
+
+2024-01-14 15:07:28 (1.74 MB/s) - ‘njc?inline=false.2’ saved [137095/137095]
+
--- a/njc/njc7
+++ b/njc/njc7
--- a/njc/njc8
+++ b/njc/njc8
@@ -0,0 +1,15 @@
+--2024-01-14 15:07:46--  https://git.thm.de/arin07/KSP_public/-/raw/master/aufgaben/a8/njc?inline=false
+Loaded CA certificate '/etc/ssl/certs/ca-certificates.crt'
+Resolving git.thm.de (git.thm.de)... 212.201.6.138
+Connecting to git.thm.de (git.thm.de)|212.201.6.138|:443... connected.
+HTTP request sent, awaiting response... 200 OK
+Length: 166681 (163K) [application/octet-stream]
+Saving to: ‘njc?inline=false.5’
+
+     0K .......... .......... .......... .......... .......... 30% 1.20M 0s
+    50K .......... .......... .......... .......... .......... 61% 2.53M 0s
+   100K .......... .......... .......... .......... .......... 92% 6.70M 0s
+   150K .......... ..                                         100% 8.97M=0.07s
+
+2024-01-14 15:07:47 (2.31 MB/s) - ‘njc?inline=false.5’ saved [166681/166681]
+
--- a/njvm.c
+++ b/njvm.c
@@ -1,43 +1,385 @@
 #include <stdio.h>
+#include <stdlib.h>
 #include <string.h>
-#include "config.h"
+#include "instruktion.c"
+#include "stack.c"
+#include "program.c"
+#include "codeReader.c"
+#include "SDA.c"
+#include "debugMenu.c"
+#include "bigint.h"
+#include "record.c"

-void version() {
-    printf("Ninja Virtual Machine version %i (compiled %s, %s)\n", PROJECT_VERSION, __DATE__, __TIME__);
+// Debug
+int debug = 0;
+
+// Stack
+struct stack stack;
+#define SIZE 64
+
+//Register
+struct stack reg;
+
+// Program
+struct program program;
+
+// SDA
+struct sda sda;
+unsigned fp;
+
+void version(void) {
+    printf("Ninja Virtual Machine version %i (compiled %s, %s)\n", 0, __DATE__, __TIME__);
 }

-void help() {
-    printf("usage: ./njvm [option] [option] ...\n\t--version\tshow version and exit\n\t--help\t\tshow this help and exit");
+void help(void) {
+    printf("Usage: ./njvm [options] <code file>\n\t--debug\tstart virtual machine in debug mode\n\t--version\tshow version and exit\n\t--help\t\tshow this help and exit\n");
 }
-void printArgs(int argc, char *argv[]){
-    for (int i = 0; i < argc; ++i) {
-        printf("%s\n", argv[i]);
-    }
-}
-void useption(int argc, char *argv[]){
-    if (argc > 1) {
-        if (strcmp(argv[1], "--version") == 0) {
-            version();
-        } else if (strcmp(argv[1], "--help") == 0) {
-            help();
-        } else if (argc != 0) {
-            printf("unknown command line argument '%s', try './njvm --help'", argv[1]);
+
+void execute(struct program program) {
+    int i;
+    char charInput;
+    StackSlot tempSlot;
+    ObjRef tempObj;
+    ObjRef tempObj2;
+    int tempInt;
+    for (i = 0; i < *program.size; ++i) {
+        if (debug == 1) debugMenu(fp, stack, &debug, i);
+        switch (program.program[i] >> 24) {
+            case HALT:
+                if (debug == 1) printf("halt\n");
+                goto end;
+            case PUSHC:
+                if (debug == 1) printf("pushc: %i\n", IMMEDIATE(program.program[i]));
+                bigFromInt(SIGN_EXTEND(IMMEDIATE(program.program[i])));
+                push(stack, stackSlotWithObjRef(bip.res));
+                break;
+            case ADD:
+                if (debug == 1) printf("add: %i + %i\n", peek(stack, 2), peek(stack, 1));
+                bip.op2 = pop(stack).u.objRef;
+                bip.op1 = pop(stack).u.objRef;
+                bigAdd();
+                push(stack, stackSlotWithObjRef(bip.res));
+                break;
+            case SUB:
+                if (debug == 1) printf("sub: %i - %i\n", peek(stack, 2), peek(stack, 1));
+                bip.op2 = pop(stack).u.objRef;
+                bip.op1 = pop(stack).u.objRef;
+                bigSub();
+                push(stack, stackSlotWithObjRef(bip.res));
+                break;
+            case MUL:
+                if (debug == 1) printf("mul: %i * %i\n", peek(stack, 2), peek(stack, 1));
+                bip.op2 = pop(stack).u.objRef;
+                bip.op1 = pop(stack).u.objRef;
+                bigMul();
+                push(stack, stackSlotWithObjRef(bip.res));
+                break;
+            case DIV:
+                if (debug == 1) printf("div: %i / %i\n", peek(stack, 2), peek(stack, 1));
+                bip.op2 = pop(stack).u.objRef;
+                bip.op1 = pop(stack).u.objRef;
+                bigDiv();
+                push(stack, stackSlotWithObjRef(bip.res));
+                break;
+            case MOD:
+                if (debug == 1) printf("mod: %i %% %i\n", peek(stack, 2), peek(stack, 1));
+                bip.op2 = pop(stack).u.objRef;
+                bip.op1 = pop(stack).u.objRef;
+                bigDiv();
+                push(stack, stackSlotWithObjRef(bip.rem));
+                break;
+            case RDINT:
+                if (debug == 1) printf("rdint\n");
+                bigRead(stdin);
+                push(stack, stackSlotWithObjRef(bip.res));
+                if (debug == 1) printf("pushed %i\n", peek(stack, 1));
+                break;
+            case WRINT:
+                if (debug == 1) printf("wrint: %i\n", peek(stack, 1));
+                bip.op1 = pop(stack).u.objRef;
+                bigPrint(stdout);
+                break;
+            case RDCHR:
+                if (debug == 1) printf("rdchr\n");
+                scanf("%c", &charInput);
+                bigFromInt(charInput);
+                push(stack, stackSlotWithObjRef(bip.res));
+                if (debug == 1) printf("pushed %c\n", charInput);
+                break;
+            case WRCHR:
+                if (debug == 1) printf("wrchr: %c\n", peek(stack, 1));
+                bip.op1 = pop(stack).u.objRef;
+                printf("%c", bigToInt());
+                break;
+            case PUSHG:
+                if (debug == 1) printf("pushg: %i\n", SIGN_EXTEND(IMMEDIATE(program.program[i])));
+                push(stack, stackSlotWithObjRef(getSDA(SIGN_EXTEND(IMMEDIATE(program.program[i])), sda)));
+                break;
+            case POPG:
+                if (debug == 1) printf("popg: %i\n", SIGN_EXTEND(IMMEDIATE(program.program[i])));
+                setSDA(SIGN_EXTEND(IMMEDIATE(program.program[i])), pop(stack).u.objRef, sda);
+                break;
+            case ASF:
+                if (debug == 1) printf("asf: %i\n", SIGN_EXTEND(IMMEDIATE(program.program[i])));
+                push(stack, stackSlotWitchNumber(fp));
+                fp = *stack.current;
+                *stack.current = *stack.current + SIGN_EXTEND(IMMEDIATE(program.program[i]));
+                break;
+            case RSF:
+                if (debug == 1) printf("rsf: %i\n", SIGN_EXTEND(IMMEDIATE(program.program[i])));
+                *stack.current = fp;
+                if (debug == 1) printf("pop: %i\n", peek(stack, 1));
+                tempSlot = pop(stack);
+                fp = tempSlot.u.number;
+                break;
+            case POPL:
+                if (debug == 1) printf("popl: %i\n", SIGN_EXTEND(IMMEDIATE(program.program[i])));
+                stack.stack[fp + SIGN_EXTEND(IMMEDIATE(program.program[i]))] = pop(stack);
+                break;
+            case PUSHL:
+                if (debug == 1) printf("pushl: %i\n", SIGN_EXTEND(IMMEDIATE(program.program[i])));
+                push(stack, stack.stack[fp + SIGN_EXTEND(IMMEDIATE(program.program[i]))]);
+                break;
+            case NE:
+                if (debug == 1) printf("ne: %i != %i\n", peek(stack, 2), peek(stack, 1));
+                bip.op2 = pop(stack).u.objRef;
+                bip.op1 = pop(stack).u.objRef;
+                bigFromInt(bigCmp() != 0);
+                push(stack, stackSlotWithObjRef(bip.res));
+                break;
+            case EQ:
+                if (debug == 1) printf("eq: %i == %i\n", peek(stack, 2), peek(stack, 1));
+                bip.op2 = pop(stack).u.objRef;
+                bip.op1 = pop(stack).u.objRef;
+                bigFromInt(bigCmp() == 0);
+                push(stack, stackSlotWithObjRef(bip.res));
+                break;
+            case LT:
+                if (debug == 1) printf("lt: %i < %i\n", peek(stack, 2), peek(stack, 1));
+                bip.op2 = pop(stack).u.objRef;
+                bip.op1 = pop(stack).u.objRef;
+                bigFromInt(bigCmp() < 0);
+                push(stack, stackSlotWithObjRef(bip.res));
+                break;
+            case LE:
+                if (debug == 1) printf("le: %i <= %i\n", peek(stack, 2), peek(stack, 1));
+                bip.op2 = pop(stack).u.objRef;
+                bip.op1 = pop(stack).u.objRef;
+                bigFromInt(bigCmp() <= 0);
+                push(stack, stackSlotWithObjRef(bip.res));
+                break;
+            case GT:
+                if (debug == 1) printf("gt: %i > %i\n", peek(stack, 2), peek(stack, 1));
+                bip.op2 = pop(stack).u.objRef;
+                bip.op1 = pop(stack).u.objRef;
+                bigFromInt(bigCmp() > 0);
+                push(stack, stackSlotWithObjRef(bip.res));
+                break;
+            case GE:
+                if (debug == 1) printf("ge: %i >= %i\n", peek(stack, 2), peek(stack, 1));
+                bip.op2 = pop(stack).u.objRef;
+                bip.op1 = pop(stack).u.objRef;
+                bigFromInt(bigCmp() >= 0);
+                push(stack, stackSlotWithObjRef(bip.res));
+                break;
+            case BRF:
+                if (debug == 1) printf("brf: %i\n", SIGN_EXTEND(IMMEDIATE(program.program[i])));
+                if (debug == 1) printf("pop: %i\n", peek(stack, 1));
+                bip.op1 = pop(stack).u.objRef;
+                int b = bigToInt();
+                if (b == false) {
+                    i = SIGN_EXTEND(IMMEDIATE(program.program[i])) - 1;
+                    if (debug == 1) printf("new i: %i\n", i);
+                } else if (b != true) {
+                    printf("Error: brf: %i\n", b);
+                    exit(EXIT_FAILURE);
+                }
+                break;
+            case BRT:
+                if (debug == 1) printf("brt: %i\n", SIGN_EXTEND(IMMEDIATE(program.program[i])));
+                if (debug == 1) printf("pop: %i\n", peek(stack, 1));
+                bip.op1 = pop(stack).u.objRef;
+                b = bigToInt();
+                if (b == true) {
+                    i = SIGN_EXTEND(IMMEDIATE(program.program[i])) - 1;
+                    if (debug == 1) printf("new i: %i\n", i);
+                } else if (b != false) {
+                    printf("Error: brt: %i\n", b);
+                    exit(EXIT_FAILURE);
+                }
+                break;
+            case JMP:
+                if (debug == 1) printf("jmp: %i\n", SIGN_EXTEND(IMMEDIATE(program.program[i])));
+                i = SIGN_EXTEND(IMMEDIATE(program.program[i])) - 1;
+                if (debug == 1) printf("new i: %i\n", i);
+                break;
+            case CALL:
+                if (debug == 1) printf("call: %i\n", SIGN_EXTEND(IMMEDIATE(program.program[i])));
+                push(stack, stackSlotWitchNumber(i));
+                if (debug == 1) printf("push: %i\n", i + 1);
+                i = SIGN_EXTEND(IMMEDIATE(program.program[i])) - 1;
+                if (debug == 1) printf("new i: %i\n", i);
+                break;
+            case RET:
+                if (debug == 1) printf("ret\n");
+                if (debug == 1) printf("pop: %i\n", peek(stack, 1));
+                i = getIntValfromStackSlot(pop(stack));
+                if (debug == 1) printf("new i: %i\n", i);
+                break;
+            case DROP:
+                if (debug == 1) printf("drop\n");
+                *stack.current = *stack.current - SIGN_EXTEND(IMMEDIATE(program.program[i]));
+                break;
+            case DUP:
+                if (debug == 1) printf("dup\n");
+                tempObj = pop(stack).u.objRef;
+                push(stack, stackSlotWithObjRef(tempObj));
+                push(stack, stackSlotWithObjRef(tempObj));
+                break;
+            case POPR:
+                if (debug == 1) printf("popr");
+                push(reg, pop(stack));
+                break;
+            case PUSHR:
+                if (debug == 1) printf("pushr");
+                push(stack, pop(reg));
+                break;
+            case NEW:
+                if (debug == 1) printf("new");
+                push(stack, stackSlotWithObjRef(newRecord(SIGN_EXTEND(IMMEDIATE(program.program[i])))));
+                break;
+            case GETF:
+                if (debug == 1) printf("getf");
+                tempObj = pop(stack).u.objRef;
+                push(stack, stackSlotWithObjRef(getField(tempObj,SIGN_EXTEND(IMMEDIATE(program.program[i])))));
+                break;
+            case PUTF:
+                if (debug == 1) printf("putf");
+                tempObj = pop(stack).u.objRef;
+                tempObj2 = pop(stack).u.objRef;
+                setField(tempObj2, SIGN_EXTEND(IMMEDIATE(program.program[i])),tempObj);
+                break;
+            case NEWA:
+                if(debug == 1) printf("newa");
+                bip.op1 = pop(stack).u.objRef;
+                push(stack, stackSlotWithObjRef(newRecord(bigToInt())));
+                break;
+            case GETFA:
+                if(debug == 1) printf("getfa");
+                bip.op1 = pop(stack).u.objRef;
+                tempInt = bigToInt();
+                tempObj = pop(stack).u.objRef;
+                push(stack, stackSlotWithObjRef(getField(tempObj,bigToInt())));
+                break;
+            case PUTFA:
+                if (debug == 1) printf("putfa");
+                tempObj = pop(stack).u.objRef; // Value
+                tempObj2 = pop(stack).u.objRef; // Index
+                bip.op1 = tempObj2;
+                tempInt = bigToInt();
+                setField(pop(stack).u.objRef, tempInt,tempObj);
+                break;
+            case GETSZ:
+                if (debug == 1) printf("getsz");
+                tempObj = pop(stack).u.objRef;
+                if(IS_PRIMITIVE(tempObj))  bigFromInt(-1);
+                else bigFromInt(GET_ELEMENT_COUNT(tempObj));
+                push(stack, stackSlotWithObjRef(bip.res));
+                break;
+            case PUSHN:
+                if (debug == 1) printf("pushn");
+                push(stack, stackSlotWithObjRef(NULL));
+                break;
+            case REFEQ:
+                if (debug == 1) printf("refeq");
+                if(pop(stack).u.objRef == pop(stack).u.objRef) bigFromInt(true);
+                else bigFromInt(false);
+                push(stack, stackSlotWithObjRef(bip.res));
+                break;
+            case REFNE:
+                if (debug == 1) printf("refeq");
+                if(pop(stack).u.objRef != pop(stack).u.objRef) bigFromInt(true);
+                else bigFromInt(false);
+                push(stack, stackSlotWithObjRef(bip.res));
+                break;
        }
    }
+    end:
+    return;
+}
+
+void tests(void) {
 }

 int main(int argc, char *argv[]) {
-    printArgs(argc,argv);
-    if (argc > 1)   useption(argc,argv);
-    else {
-
-//    Started
-        printf("Ninja Virtual Machine started\n");


+    // Initialize the Stack
+    int size = SIZE;
+    int current = 0;
+    stack.size = &size;
+    stack.current = &current;
+    stack.stack = malloc(SIZE * 10024);

-//    Stopped
-        printf("Ninja Virtual Machine stopped\n");
-        return 0;
+    // Initialize the registery
+    int rSize = 1000;
+    int rCurrent = 0;
+    StackSlot r[1000];
+    reg.size = &rSize;
+    reg.current = &rCurrent;
+    reg.stack = r;
+
+    // Initialize ProgrammSpeicher
+    int psize = 1000;
+    int saveProgram = 0;
+    unsigned int p[1000];
+    program.size = &psize;
+    program.program = p;
+    program.saveProgram = &saveProgram;
+
+    int run = 0;
+    int sizeSDA;
+
+    if (argc > 1) {
+        for (int i = 1; i < argc; ++i) {
+            if (strcmp(argv[i], "--debug") == 0) {
+                debug = 1;
+            } else if (strcmp(argv[i], "--version") == 0) {
+                version();
+                return 0;
+            } else if (strcmp(argv[i], "--help") == 0) {
+                help();
+                return 0;
+            } else if (strcmp(argv[i], "--stack") == 0) {
+                i++;
+                // TODO: implement stack size
+            } else if (strcmp(argv[i], "--heap") == 0) {
+                i++;
+                // TODO: implement heap size
+            } else if (strcmp(argv[i], "--gcpurge") == 0) {
+                i++;
+                // TODO: implement gcpurge
+            } else {
+                sizeSDA = fromFile(argv[i], program);
+                run = 1;
+            }
+        }
    }
-}
+
+    if (debug) {
+        tests();
+    }
+
+    if (run) {
+        printf("Ninja Virtual Machine started\n");
+        ObjRef s[sizeSDA];
+        sda.size = &sizeSDA;
+        sda.sda = s;
+        if (debug == 1) printProgram(program);
+        execute(program);
+        printf("Ninja Virtual Machine stopped\n");
+    } else {
+        printf("Error: no code file specified\n");
+        return 1;
+    }
+}
--- a/njvm.o
+++ b/njvm.o
--- a/BIN
+++ b/BIN
--- a/BIN
+++ b/BIN
--- a/njvm?inline=false.2
+++ b/njvm?inline=false.2
--- a/objref.c
+++ b/objref.c
@@ -0,0 +1,10 @@
+#ifndef OBJREF
+#define OBJREF
+
+typedef struct {
+  unsigned int size;
+  unsigned char data[1];
+} *ObjRef;
+
+#endif /* ifndef OBJREF
+#define OBJREF */
--- a/prog.bin
+++ b/prog.bin
--- a/program.c
+++ b/program.c
@@ -0,0 +1,134 @@
+/*
+ * Created by Nils on 30.10.2023.
+ */
+#ifndef PROGRAM
+#define PROGRAM
+
+#include <string.h>
+#include "instruktion.c"
+#include <stdio.h>
+
+struct program {
+    int *size;
+    unsigned int *program;
+    int *saveProgram;
+};
+
+void copyToProgram(const unsigned int codeToCopy[], int size, struct program program) {
+    for (int i = 0; i < size; ++i) {
+        program.program[i] = codeToCopy[i];
+    }
+    *program.size = size;
+    *program.saveProgram = 1;
+}
+
+void printProgram(struct program program) {
+    char c[10];
+    for (int i = 0; i < *program.size; i++) {
+        switch (program.program[i] >> 24) {
+            case PUSHC:
+                strcpy(c, "pushc");
+                break;
+            case ADD:
+                strcpy(c, "add");
+                break;
+            case SUB:
+                strcpy(c, "sub");
+                break;
+            case MUL:
+                strcpy(c, "mul");
+                break;
+            case DIV:
+                strcpy(c, "div");
+                break;
+            case MOD:
+                strcpy(c, "mod");
+                break;
+            case RDINT:
+                strcpy(c, "rdint");
+                break;
+            case WRINT:
+                strcpy(c, "wrint");
+                break;
+            case RDCHR:
+                strcpy(c, "rdchr");
+                break;
+            case WRCHR:
+                strcpy(c, "wrchr");
+                break;
+            case HALT:
+                strcpy(c, "halt");
+                break;
+            case PUSHG :
+                strcpy(c, "pushg");
+                break;
+            case POPG:
+                strcpy(c, "popg");
+                break;
+            case ASF:
+                strcpy(c, "asf");
+                break;
+            case RSF:
+                strcpy(c, "rsf");
+                break;
+            case PUSHL:
+                strcpy(c, "pushl");
+                break;
+            case POPL:
+                strcpy(c, "popl");
+                break;
+            case EQ:
+                strcpy(c, "eq");
+                break;
+            case NE:
+                strcpy(c, "ne");
+                break;
+            case LT:
+                strcpy(c, "lt");
+                break;
+            case LE:
+                strcpy(c, "le");
+                break;
+            case GT:
+                strcpy(c, "gt");
+                break;
+            case GE:
+                strcpy(c, "ge");
+                break;
+            case JMP:
+                strcpy(c, "jmp");
+                break;
+            case BRF:
+                strcpy(c, "brf");
+                break;
+            case BRT:
+                strcpy(c, "brt");
+                break;
+            case CALL:
+                strcpy(c, "call");
+                break;
+            case RET:
+                strcpy(c, "ret");
+                break;
+            case DROP:
+                strcpy(c, "drop");
+                break;
+            case PUSHR:
+                strcpy(c, "pushr");
+                break;
+            case POPR:
+                strcpy(c, "popr");
+                break;
+            case DUP:
+                strcpy(c, "dup");
+                break;
+            default:
+                strcpy(c, "ERROR");
+                break;
+        }
+        IMMEDIATE(program.program[i]) ? printf("%03i:\t%s\t%i\n", i, c, SIGN_EXTEND(IMMEDIATE(program.program[i]))) : printf(
+                "%03i:\t%s\n", i, c);
+    }
+}
+
+#endif /* ifndef PROGRAMM */
--- a/programs/matrix.nj
+++ b/programs/matrix.nj
@@ -0,0 +1,146 @@
+//
+// matinv.nj -- invert 2x2 matrices of fractions
+//
+
+//--------------------------------------------------------------
+
+// greatest common divisor
+
+Integer gcd(Integer a, Integer b) {
+  local Integer h;
+  while (b != 0) {
+    h = a % b;
+    a = b;
+    b = h;
+  }
+  return a;
+}
+
+//--------------------------------------------------------------
+
+// fractions
+
+type Fraction = record {
+  Integer num;
+  Integer den;
+};
+
+Fraction newFraction(Integer num, Integer den) {
+  local Integer n;
+  local Integer d;
+  local Integer g;
+  local Fraction r;
+  if (num < 0) {
+    n = -num;
+  } else {
+    n = num;
+  }
+  if (den < 0) {
+    d = -den;
+  } else {
+    d = den;
+  }
+  g = gcd(n, d);
+  r = new(Fraction);
+  if ((num < 0) != (den < 0)) {
+    r.num = -n / g;
+  } else {
+    r.num = n / g;
+  }
+  r.den = d / g;
+  return r;
+}
+
+void writeFraction(Fraction f) {
+  writeInteger(f.num);
+  writeString("/");
+  writeInteger(f.den);
+}
+
+Fraction negFraction(Fraction f) {
+  return newFraction(-f.num, f.den);
+}
+
+Fraction addFraction(Fraction f1, Fraction f2) {
+  return newFraction(f1.num * f2.den + f2.num * f1.den, f1.den * f2.den);
+}
+
+Fraction subFraction(Fraction f1, Fraction f2) {
+  return newFraction(f1.num * f2.den - f2.num * f1.den, f1.den * f2.den);
+}
+
+Fraction mulFraction(Fraction f1, Fraction f2) {
+  return newFraction(f1.num * f2.num, f1.den * f2.den);
+}
+
+Fraction divFraction(Fraction f1, Fraction f2) {
+  return newFraction(f1.num * f2.den, f1.den * f2.num);
+}
+
+//--------------------------------------------------------------
+
+// 2x2 matrices of fractions
+
+type Matrix = Fraction[][];
+
+Matrix newMatrix(Fraction a00, Fraction a01,
+                 Fraction a10, Fraction a11) {
+  local Matrix m;
+  m = new(Fraction[2][]);
+  m[0] = new(Fraction[2]);
+  m[1] = new(Fraction[2]);
+  m[0][0] = a00;
+  m[0][1] = a01;
+  m[1][0] = a10;
+  m[1][1] = a11;
+  return m;
+}
+
+void writeMatrix(Matrix m) {
+  local Integer i;
+  local Integer j;
+  i = 0;
+  while (i < sizeof(m)) {
+    j = 0;
+    while (j < sizeof(m[i])) {
+      writeFraction(m[i][j]);
+      writeString("  ");
+      j = j + 1;
+    }
+    writeString("\n");
+    i = i + 1;
+  }
+  writeString("\n");
+}
+
+Matrix invertMatrix(Matrix m) {
+  local Fraction det;
+  det = subFraction(mulFraction(m[0][0], m[1][1]),
+                    mulFraction(m[0][1], m[1][0]));
+  if (det.num == 0) {
+    writeString("error: matrix cannot be inverted\n");
+    exit();
+  }
+  return newMatrix(
+    divFraction(m[1][1], det), divFraction(negFraction(m[0][1]), det),
+    divFraction(negFraction(m[1][0]), det), divFraction(m[0][0], det)
+  );
+}
+
+//--------------------------------------------------------------
+
+void main() {
+  local Matrix matrix;
+  local Matrix result1;
+  local Matrix result2;
+  writeString("\n");
+  matrix = newMatrix(
+    newFraction(7, 1), newFraction(4, 1),
+    newFraction(6, 1), newFraction(5, 1)
+  );
+  writeMatrix(matrix);
+  result1 = invertMatrix(matrix);
+  writeMatrix(result1);
+  result2 = invertMatrix(result1);
+  writeMatrix(result2);
+}
--- a/programs/newFraction.asm
+++ b/programs/newFraction.asm
@@ -0,0 +1,26 @@
+_subFraction:
+	asf	0
+	pushl	-4
+	getf	0
+	pushl	-3
+	getf	1
+	mul
+	pushl	-3
+	getf	0
+	pushl	-4
+	getf	1
+	mul
+	sub
+	pushl	-4
+	getf	1
+	pushl	-3
+	getf	1
+	mul
+	call	_newFraction
+	drop	2
+	pushr
+	popr
+	jmp	__14
+__14:
+	rsf
+	ret
--- a/programs/nja
+++ b/programs/nja
--- a/programs/prog02.asm
+++ b/programs/prog02.asm
@@ -0,0 +1,28 @@
+//
+// prog02.asm -- call/ret with args, but without ret value
+//
+
+	asf	3
+	pushc	11
+	pushc	33
+	call	proc
+	drop	2
+	rsf
+	halt
+
+proc:
+	asf	2
+	pushl	-4
+	wrint
+	pushc	'\n'
+	wrchr
+	pushc	22
+	wrint
+	pushc	'\n'
+	wrchr
+	pushl	-3
+	wrint
+	pushc	'\n'
+	wrchr
+	rsf
+	ret
--- a/programs/prog02.bin
+++ b/programs/prog02.bin
--- a/programs/prog04.asm
+++ b/programs/prog04.asm
@@ -0,0 +1,32 @@
+//
+// prog04.asm -- call/ret with args, and with ret value
+//
+
+	asf	3
+	pushc	11
+	wrint
+	pushc	'\n'
+	wrchr
+	pushc	11
+	pushc	33
+	call	proc
+	drop	2
+	pushr
+	wrint
+	pushc	'\n'
+	wrchr
+	pushc	33
+	wrint
+	pushc	'\n'
+	wrchr
+	rsf
+	halt
+
+proc:
+	asf	2
+	pushl	-3
+	pushl	-4
+	sub
+	popr
+	rsf
+	ret
--- a/programs/prog1.asm
+++ b/programs/prog1.asm
@@ -0,0 +1,31 @@
+//
+// prog1.asm -- an assembler example with global variables
+//
+
+// global Integer x;
+// global Integer y;
+// x = 2;
+// y = x + 3;
+// x = 7 * y + x;
+// writeInteger(x + -33);
+// writeCharacter('\n');
+
+	pushc	2
+	popg	0
+	pushg	0
+	pushc	3
+	add
+	popg	1
+	pushc	7
+	pushg	1
+	mul
+	pushg	0
+	add
+	popg	0
+	pushg	0
+	pushc	-33
+	add
+	wrint
+	pushc	'\n'
+	wrchr
+	halt
--- a/programs/prog1.asm?inline=false
+++ b/programs/prog1.asm?inline=false
@@ -0,0 +1,31 @@
+//
+// prog1.asm -- an assembler example with global variables
+//
+
+// global Integer x;
+// global Integer y;
+// x = 2;
+// y = x + 3;
+// x = 7 * y + x;
+// writeInteger(x + -33);
+// writeCharacter('\n');
+
+	pushc	2
+	popg	0
+	pushg	0
+	pushc	3
+	add
+	popg	1
+	pushc	7
+	pushg	1
+	mul
+	pushg	0
+	add
+	popg	0
+	pushg	0
+	pushc	-33
+	add
+	wrint
+	pushc	'\n'
+	wrchr
+	halt
--- a/programs/prog1.bin
+++ b/programs/prog1.bin
--- a/programs/prog2.asm
+++ b/programs/prog2.asm
@@ -0,0 +1,33 @@
+//
+// prog2.asm -- an assembler example with local variables
+//
+
+// local Integer x;
+// local Integer y;
+// x = 2;
+// y = x + 3;
+// x = 7 * y + x;
+// writeInteger(x + -33);
+// writeCharacter('\n');
+
+	asf	2
+	pushc	2
+	popl	0
+	pushl	0
+	pushc	3
+	add
+	popl	1
+	pushc	7
+	pushl	1
+	mul
+	pushl	0
+	add
+	popl	0
+	pushl	0
+	pushc	-33
+	add
+	wrint
+	pushc	'\n'
+	wrchr
+	rsf
+	halt
--- a/programs/prog2.bin
+++ b/programs/prog2.bin
--- a/programs/prog3.asm
+++ b/programs/prog3.asm
@@ -0,0 +1,9 @@
+	pushc 1
+  asf	2
+  asf 4
+  pushc 23
+  asf 3
+  rsf
+  rsf
+  rsf
+	halt
--- a/programs/prog3.bin
+++ b/programs/prog3.bin
--- a/programs/prog4.asm
+++ b/programs/prog4.asm
@@ -0,0 +1,61 @@
+//
+// prog1.asm -- an assembler example with global variables
+//
+
+//
+// compute the gcd of two positive numbers
+//
+// global Integer x;
+// global Integer y;
+// x = readInteger();
+// y = readInteger();
+// while (x != y) {
+//   if (x > y) {
+//     x = x - y;
+//   } else {
+//     y = y - x;
+//   }
+// }
+// writeInteger(x);
+// writeCharacter('\n');
+
+	// x = readInteger();
+	rdint
+	popg	0
+	// y = readInteger();
+	rdint
+	popg	1
+	// while ...
+L1:
+	// x != y
+	pushg	0
+	pushg	1
+	ne
+	brf	L2
+	// if ...
+	pushg	0
+	pushg	1
+	gt
+	brf	L3
+	// x = x - y
+	pushg	0
+	pushg	1
+	sub
+	popg	0
+	jmp	L4
+L3:
+	// y = y - x
+	pushg	1
+	pushg	0
+	sub
+	popg	1
+L4:
+	jmp	L1
+L2:
+	// writeInteger(x);
+	pushg	0
+	wrint
+	// writeCharacter('\n');
+	pushc	'\n'
+	wrchr
+	halt
--- a/programs/prog4.bin
+++ b/programs/prog4.bin
--- a/programs/prog5.asm
+++ b/programs/prog5.asm
@@ -0,0 +1,63 @@
+//
+// prog2.asm -- an assembler example with local variables
+//
+
+//
+// compute the gcd of two positive numbers
+//
+// local Integer x;
+// local Integer y;
+// x = readInteger();
+// y = readInteger();
+// while (x != y) {
+//   if (x > y) {
+//     x = x - y;
+//   } else {
+//     y = y - x;
+//   }
+// }
+// writeInteger(x);
+// writeCharacter('\n');
+
+	asf	2
+	// x = readInteger();
+	rdint
+	popl	0
+	// y = readInteger();
+	rdint
+	popl	1
+	// while ...
+L1:
+	// x != y
+	pushl	0
+	pushl	1
+	ne
+	brf	L2
+	// if ...
+	pushl	0
+	pushl	1
+	gt
+	brf	L3
+	// x = x - y
+	pushl	0
+	pushl	1
+	sub
+	popl	0
+	jmp	L4
+L3:
+	// y = y - x
+	pushl	1
+	pushl	0
+	sub
+	popl	1
+L4:
+	jmp	L1
+L2:
+	// writeInteger(x);
+	pushl	0
+	wrint
+	// writeCharacter('\n');
+	pushc	'\n'
+	wrchr
+	rsf
+	halt
--- a/programs/prog5.bin
+++ b/programs/prog5.bin
--- a/programs/prog6.asm
+++ b/programs/prog6.asm
@@ -0,0 +1,61 @@
+//
+// prog1.asm -- an assembler example with global variables
+//
+
+//
+// compute the gcd of two positive numbers
+//
+// global Integer x;
+// global Integer y;
+// x = readInteger();
+// y = readInteger();
+// while (x != y) {
+//   if (x > y) {
+//     x = x - y;
+//   } else {
+//     y = y - x;
+//   }
+// }
+// writeInteger(x);
+// writeCharacter('\n');
+
+	// x = readInteger();
+	rdint
+	popg	0
+	// y = readInteger();
+	rdint
+	popg	1
+	// while ...
+L1:
+	// x != y
+	pushg	0
+	pushg	1
+	ne
+	brf	L2
+	// if ...
+	pushg	0
+	pushg	1
+	gt
+	brf	L3
+	// x = x - y
+	pushg	0
+	pushg	1
+	sub
+	popg	0
+	jmp	L4
+L3:
+	// y = y - x
+	pushg	1
+	pushg	0
+	sub
+	popg	1
+L4:
+	jmp	L1
+L2:
+	// writeInteger(x);
+	pushg	0
+	wrint
+	// writeCharacter('\n');
+	pushc	'\n'
+	wrchr
+	halt
--- a/programs/prog7.asm
+++ b/programs/prog7.asm
@@ -0,0 +1,17 @@
+//
+// prog04.asm -- call/ret with args, and with ret value
+//
+
+	pushc 12
+  rdint
+  mul
+  wrint
+  call proc
+  halt
+
+proc:
+	asf 1
+  pushc '\n'
+  wrchr
+  rsf
+  ret
--- a/programs/prog7.bin
+++ b/programs/prog7.bin
--- a/record.c
+++ b/record.c
@@ -0,0 +1,39 @@
+//
+// Created by Nils Polek on 23.01.24.
+//
+#ifndef RECORD
+#define RECORD
+#include "stackslot.c"
+#include "instruktion.c"
+ObjRef newRecord(int size){
+    ObjRef record;
+    unsigned int objSize;
+    objSize = sizeof(*record) + (size * sizeof(void *));
+    if((record = malloc(objSize)) == NULL){
+        perror("malloc");
+    }
+    record->size = (1 << ((sizeof(int) * 8) - 1));
+    record->size = record->size + size;
+    for(int i = 0; i < size; i++) {
+        GET_REFS_PTR(record)[i] = NULL;
+    }
+    return record;
+}
+int getSize(ObjRef arr){
+    return GET_ELEMENT_COUNT(arr);
+}
+ObjRef getField(ObjRef arr, int point){
+    if(0 > point || point > getSize(arr)){
+        printf("Index %i out of bounds for length %i\n",point, getSize(arr));
+    }
+    return *(ObjRef *)GET_REFS_PTR(arr)[point]->data;
+}
+void setField(ObjRef arr, int point, ObjRef value){
+    if(0 > point || point > getSize(arr)){
+        printf("Index %i out of bounds for length %i\n",point, getSize(arr));
+    }
+    GET_REFS_PTR(arr)[point] = malloc(8);
+    * (ObjRef *)GET_REFS_PTR(arr)[point]->data = value;
+}
+
+#endif
--- a/stack.c
+++ b/stack.c
@@ -0,0 +1,79 @@
+//
+// Created by Nils on 29.10.2023.
+//
+#ifndef STACK
+#define STACK
+
+#include <stdio.h>
+#include <stdlib.h>
+#include "stackslot.c"
+
+struct stack {
+    int* size;
+    int* current;
+    StackSlot *stack;
+};
+
+typedef struct {
+    unsigned int size;
+    ObjRef *refs;
+}ObjRefContainer; 
+
+void printStack(struct stack stack, int fp) {
+    printf("Stack\nSize:\t\t%i\nCurrent:\t%i\n", *stack.size, *stack.current);
+    for (int i = *stack.current -1; i >= 0; --i) {
+        printf("%i\t",i);
+        if(stack.stack[i].isObjRef){
+          printf("|%p|", (void *)stack.stack[i].u.objRef);
+          if(stack.stack[i].u.objRef->size == sizeof(int))
+            printf("(%i)",*(int *)stack.stack[i].u.objRef->data);
+        }else { 
+        printf("|%i|", getIntValfromStackSlot(stack.stack[i]));
+      }
+      if(fp == i) printf("<-\tFP\n");
+      else if(*stack.current == i) printf("<-\tSP\n");
+      else printf("\n");
+    }
+}
+
+ObjRefContainer getRefs(struct stack stack){
+  ObjRefContainer continer;
+  int counter = 0;
+  for (int i = 0; i <= *stack.current; i++) {
+    if(stack.stack[i].isObjRef == true) counter++;
+  }
+  continer.size = counter;
+  ObjRef *list = (ObjRef *)malloc(counter * sizeof(ObjRef));
+  for (int i = 0; i<= *stack.current; i++)
+    if(stack.stack[i].isObjRef == true)
+      list[counter--] = stack.stack[i].u.objRef;
+  continer.refs = list; 
+  return continer;
+}
+
+void push(struct stack s, StackSlot value) {
+    if (*s.current >= *s.size) {
+        printf("Stack Overflow\n");
+        exit(EXIT_FAILURE);
+    }
+    s.stack[*s.current] = value;
+    *s.current=*s.current + 1;
+}
+
+StackSlot pop(struct stack s) {
+    if (*s.current == 0) {
+        printf("Stack Underflow\n");
+        exit(EXIT_FAILURE);
+    }
+    *s.current = *s.current -1;
+    return s.stack[*s.current];
+}
+
+int peek(struct stack s, int steps) {
+    if (*s.current - steps < 0) {
+        printf("Stack Underflow\n");
+        exit(EXIT_FAILURE);
+    }
+    return getIntValfromStackSlot(s.stack[*s.current - steps]);
+}
+#endif
--- a/stackslot.c
+++ b/stackslot.c
@@ -0,0 +1,57 @@
+#include <stdbool.h>
+#include <stdio.h>
+#include <stdlib.h>
+#ifndef STACKSLOT
+#define STACKSLOT
+typedef int Object;
+typedef struct {
+  unsigned int size;
+  unsigned char data[1];
+} *ObjRef;
+
+typedef struct{
+  bool isObjRef;
+  union {
+    ObjRef objRef;
+    int number;
+  } u;
+} StackSlot;
+
+ObjRef getIntObj(int val){
+  ObjRef intObject;
+  unsigned int objSize = sizeof(unsigned int) + sizeof(int);
+  if ((intObject = malloc(objSize)) == NULL) {
+    perror("malloc");
+  }
+  *(int *)intObject->data=val;
+  intObject->size=sizeof(int);
+  return intObject;
+}
+int getValFromIntObj(ObjRef iref){
+  return *(int *)iref->data;
+}
+int getIntValfromStackSlot(StackSlot s){
+  if(s.isObjRef){
+    return *(int *)s.u.objRef->data;
+  }
+  return s.u.number;
+}
+void setValIntObj(ObjRef iref, int val){
+  iref->size=sizeof(int);
+  *(int *)iref->data=val;
+}
+StackSlot stackSlotWithObjRef(ObjRef val){
+  StackSlot *stackSlot;
+  stackSlot=malloc(sizeof(StackSlot));
+  stackSlot->isObjRef=true;
+  stackSlot->u.objRef=val;
+  return *stackSlot;
+}
+StackSlot stackSlotWitchNumber(int val){
+  StackSlot *stackSlot;
+  stackSlot= malloc(sizeof(StackSlot));
+  stackSlot->isObjRef=false;
+  stackSlot->u.number=val;
+  return *stackSlot;
+}
+#endif
--- a/support.c
+++ b/support.c
@@ -0,0 +1,27 @@
+#include "support.h"
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "objref.c"
+
+void fatalError(char *msg){
+  printf("Fatal error: %s\n", msg);
+  exit(1);
+}
+
+void * newPrimObject(int dataSize) {
+  ObjRef bigObjRef;
+
+  bigObjRef = malloc(sizeof(unsigned int) +
+                  dataSize * sizeof(unsigned char));
+  if (bigObjRef == NULL) {
+    fatalError("newPrimObject() got no memory");
+  }
+  bigObjRef->size = dataSize;
+  return bigObjRef;
+}
+
+void * getPrimObjectDataPointer(void * obj){
+    ObjRef oo = ((ObjRef)  (obj));
+    return oo->data;
+}
--- a/support.o
+++ b/support.o
--- a/test.asm
+++ b/test.asm
@@ -0,0 +1,155 @@
+//
+// version
+//
+	.vers	7
+
+//
+// execution framework
+//
+__start:
+	call	_main
+	call	_exit
+__stop:
+	jmp	__stop
+
+//
+// Integer readInteger()
+//
+_readInteger:
+	asf	0
+	rdint
+	popr
+	rsf
+	ret
+
+//
+// void writeInteger(Integer)
+//
+_writeInteger:
+	asf	0
+	pushl	-3
+	wrint
+	rsf
+	ret
+
+//
+// Character readCharacter()
+//
+_readCharacter:
+	asf	0
+	rdchr
+	popr
+	rsf
+	ret
+
+//
+// void writeCharacter(Character)
+//
+_writeCharacter:
+	asf	0
+	pushl	-3
+	wrchr
+	rsf
+	ret
+
+//
+// Integer char2int(Character)
+//
+_char2int:
+	asf	0
+	pushl	-3
+	popr
+	rsf
+	ret
+
+//
+// Character int2char(Integer)
+//
+_int2char:
+	asf	0
+	pushl	-3
+	popr
+	rsf
+	ret
+
+//
+// void exit()
+//
+_exit:
+	asf	0
+	halt
+	rsf
+	ret
+
+//
+// void writeString(String)
+//
+_writeString:
+	asf	1
+	pushc	0
+	popl	0
+	jmp	_writeString_L2
+_writeString_L1:
+	pushl	-3
+	pushl	0
+	getfa
+	call	_writeCharacter
+	drop	1
+	pushl	0
+	pushc	1
+	add
+	popl	0
+_writeString_L2:
+	pushl	0
+	pushl	-3
+	getsz
+	lt
+	brt	_writeString_L1
+	rsf
+	ret
+
+//
+// void main()
+//
+_main:
+	asf	2
+	new	2
+	popl	1
+	pushl	1
+	pushc	5
+	putf	0
+	pushl	1
+	getf	0
+	popl	0
+	pushl	1
+	pushc	2
+	pushl	0
+	mul
+	putf	1
+	pushl	1
+	getf	0
+	call	_writeInteger
+	drop	1
+	pushc	1
+	newa
+	dup
+	pushc	0
+	pushc	10
+	putfa
+	call	_writeString
+	drop	1
+	pushl	1
+	getf	1
+	call	_writeInteger
+	drop	1
+	pushc	1
+	newa
+	dup
+	pushc	0
+	pushc	10
+	putfa
+	call	_writeString
+	drop	1
+__0:
+	rsf
+	ret
Author	SHA1	Message	Date
nils	084b715729	testing sth	2024-01-25 20:22:33 +00:00
nils	7d2e5ad1cd	made some improvements	2024-01-25 19:51:24 +00:00
nilspolek	08109a4f16	changed stack size	2024-01-23 22:49:23 +01:00
nilspolek	ade4f8e18d	changed version	2024-01-23 22:46:55 +01:00
nilspolek	9f7cd4aefc	forgot what ive done	2024-01-23 22:45:49 +01:00
nilspolek	82704187f9	Arrays work now	2024-01-23 22:15:49 +01:00
nilspolek	4f0fc8a364	Arrays work now	2024-01-23 22:05:23 +01:00
nilspolek	797bfa45eb	corrected CMakeLists.txt	2024-01-23 21:44:03 +01:00
nilspolek	1c0d85b5c9	added sth	2024-01-23 21:10:06 +01:00
nilspolek	dc5a98c401	added sth	2024-01-23 20:04:06 +01:00
nilspolek	c174108e09	fixed some mistakes	2024-01-23 17:18:54 +01:00
nilspolek	e8b4062331	added some sht	2024-01-23 16:58:57 +01:00
nilspolek	f0d74a7e17	forgotten to add new in instructions.c	2024-01-23 16:03:04 +01:00
nilspolek	1ea539ddea	removed the fib program	2024-01-23 15:49:05 +01:00
nilspolek	69b4a1afb4	Added some instructions for cmp	2024-01-23 15:47:43 +01:00
nilspolek	3a046d6f89	Added some instructions for cmp	2024-01-23 15:41:31 +01:00
Elias Bennour	eba9656631	sjkbdsfjk	2024-01-18 21:07:59 +01:00
nils polek	f60e82b46b	Chanded versin	2024-01-18 19:56:11 +00:00
Elias Bennour	1f02f49cdf	fix comparisons	2024-01-18 20:18:21 +01:00
nils polek	6319ddcad9	some shit	2024-01-18 19:15:56 +00:00
Elias Bennour	9b4a9faa8d	update version to 6	2024-01-18 18:54:53 +01:00
Elias Bennour	4d24ab038c	remove unused tmp variable	2024-01-18 18:54:20 +01:00
Elias Bennour	82d3201374	add bigint to execute	2024-01-18 18:53:46 +01:00
Elias Bennour	e5f2858a5c	update	2024-01-18 18:25:16 +01:00
Elias Bennour	906ea30be2	update	2024-01-18 18:25:00 +01:00
nils polek	70dbd0253b	Big int works	2024-01-18 17:17:07 +00:00
Elias Bennour	5039f95153	Revert "update" This reverts commit `dbafdbeea5`.	2024-01-18 17:24:01 +01:00
Elias Bennour	dbafdbeea5	update	2024-01-18 16:21:34 +01:00
nils polek	ac57431ac4	added big int lib	2024-01-15 16:28:41 +00:00
nils polek	3935d2778b	alle rechenobjekte im stack sind jetzt pointer	2024-01-15 15:32:02 +00:00
nils polek	37843d9356	Added a debug menue	2024-01-15 12:43:49 +00:00
nils polek	6cc2ff87ca	Stack uses only references and equation objects	2024-01-15 11:48:21 +00:00
nils polek	f29f500d0c	added some shit	2024-01-14 20:09:51 +00:00
nils polek	23e787eb5e	added pushr popr	2024-01-14 17:39:11 +00:00
nils polek	94fb404c71	Added nja njc and Makefile	2024-01-14 17:11:09 +00:00
Elias Bennour	847f68bb29	fix error	2023-12-28 22:29:30 +01:00
Elias Bennour	da06afd43b	update version to 8	2023-12-28 22:28:35 +01:00
Elias Bennour	9421d34756	add heap and stack args (not yet implemented)	2023-12-28 22:25:40 +01:00
Nils Polek	60bdfd7843	Added DUB	2023-12-10 00:24:17 +01:00
Elias Bennour	bdb0ce63b8	fix dfbnjkhghjdfsbg	2023-12-10 00:18:20 +01:00
Elias Bennour	dcb665f5a6	update debug	2023-12-10 00:00:59 +01:00
Nils Polek	82dc5f28cc	abc	2023-12-09 23:43:33 +01:00
Elias Bennour	8be99c5244	update debug	2023-12-09 23:15:11 +01:00
Elias Bennour	742f050b24	update debug	2023-12-09 23:14:19 +01:00
Elias Bennour	14025d3b08	update debug	2023-12-09 23:12:33 +01:00
Elias Bennour	3f12378110	update debug	2023-12-09 23:11:42 +01:00
Elias Bennour	2cb94eaf76	update debug	2023-12-09 23:10:31 +01:00
Elias Bennour	9d64b87a09	update debug	2023-12-09 23:10:23 +01:00
Elias Bennour	b87ebbe841	update debug	2023-12-09 23:03:32 +01:00
Elias Bennour	829735eb8c	update debug	2023-12-09 22:57:26 +01:00
Elias Bennour	44f70a1777	update debug	2023-12-09 22:51:27 +01:00
Elias Bennour	5a7338f91c	update debug	2023-12-09 22:49:44 +01:00
Elias Bennour	a8999f4ec2	update debug	2023-12-09 22:43:53 +01:00
Elias Bennour	c0a5e694c0	update debug fix call not jumping	2023-12-09 22:42:46 +01:00
Nils Polek	61a138fdee	versin v	2023-12-09 22:40:18 +01:00
Elias Bennour	55af679c39	fix jump not working right	2023-12-09 22:10:02 +01:00
Elias Bennour	27400289f5	update debug	2023-12-09 22:00:13 +01:00
Elias Bennour	c0d25212af	fix printProgram	2023-12-09 21:56:17 +01:00
Elias Bennour	10a6883750	update debug mode	2023-12-09 21:55:12 +01:00
Nils Polek	33a2994c29	Commit with mistake	2023-12-09 21:40:42 +01:00
Nils Polek	7390df9ee0	Aufgabe 2 Fertig	2023-12-09 20:35:15 +01:00
Nils Polek	83dae77e31	aufgabe 2 stack overflow	2023-12-09 19:45:15 +01:00
nils polek	fb8497fbee	changed path	2023-12-03 19:39:50 +01:00
Nils	dc16504cd7	Aufgabe 2 fertig	2023-12-03 19:30:38 +01:00
Nils	2a427a2563	Aufgabe 2 fertig	2023-12-03 18:19:39 +01:00
Nils	0e52973475	Aufgabe 2 fertig	2023-12-03 18:14:27 +01:00
nils polek	8b3770df80	added codeReader and consts.c	2023-12-03 16:10:33 +01:00
Elias Bennour	dc33e46e24	update help	2023-12-03 14:59:02 +01:00
Elias Bennour	c900a0444f	fix printing negative numbers	2023-12-03 14:29:07 +01:00
Elias Bennour	c16fe6349b	add error message if no program selected fix error with negative numbers	2023-12-03 14:24:22 +01:00
nilsplk	1363db7c11	Finished cleaning up the code	2023-10-30 12:51:42 +01:00
nilsplk	dfedf2e717	test	2023-10-30 11:59:56 +01:00
nilsplk	4d547cca6a	#include <stdio.h> #include <string.h> #include <stdlib.h> #include "instruktion.c" #include "code.c" #include "stack.c" //Comment to disable debug // #define DEBUG // Stack struct stack stack; #define SIZE 1000 unsigned int* programmSpeicher; void copyToProgramm(unsigned int codeToCopy[]){ programmSpeicher = codeToCopy; } void version(void) { printf("Ninja Virtual Machine version %i (compiled %s, %s)\n", 0, __DATE__, __TIME__); } void help(void) { printf("usage: ./njvm [option] [option] ...\n\t--version\tshow version and exit\n\t--help\t\tshow this help and exit\n"); } void printProgramm(){ int i = 0; char c[10]; while (programmSpeicher[i] != 0) { switch (programmSpeicher[i] >> 24) { case PUSHC: strcpy(c,"pushc"); break; case ADD: strcpy(c,"add"); break; case SUB: strcpy(c,"sub"); break; case MUL: strcpy(c,"mul"); break; case DIV: strcpy(c,"div"); break; case MOD: strcpy(c,"mod"); break; case RDINT: strcpy(c,"rdint"); break; case WRINT: strcpy(c,"wrint"); break; case RDCHR: strcpy(c,"rdchr"); break; case WRCHR: strcpy(c,"wrchr"); break; default: strcpy(c,"halt"); break; } IMMEDIATE(programmSpeicher[i])? printf("%03i:\t%s\t%i\n",i,c,IMMEDIATE(programmSpeicher[i])) : printf("%03i:\t%s\n",i,c); i++; } printf("%03i:\thalt\n",i); } void execute(void) { int i = 0; int intInput; int temp; char charInput; while (1) { switch (programmSpeicher[i] >> 24) { case HALT: goto end; break; case PUSHC: push(stack,IMMEDIATE(programmSpeicher[i])); break; case ADD: push(stack,pop(stack)+pop(stack)); break; case SUB: temp = pop(stack); push(stack,pop(stack) - temp); break; case MUL: push(stack,pop(stack)pop(stack)); break; case DIV: temp = pop(stack); push(stack,pop(stack)/temp); break; case MOD: temp = pop(stack); push(stack,pop(stack)%temp); break; case RDINT: scanf("%i",&intInput); push(stack,intInput); break; case WRINT: printf("%i",pop(stack)); break; case RDCHR: scanf("%c",&charInput); push(stack,charInput); break; case WRCHR: printf("%c",pop(stack)); break; } i++; } end: return; } #ifdef DEBUG void tests(void){ printf("Runnig debug mode\n"); copyToProgramm(code1); printProgramm(); execute(); } #endif / ifdef DEBUG / int main(int argc, char argv[]) { int size = SIZE; int current = 0; unsigned int s[SIZE]; stack.size = &size; stack.current = &current; stack.stack = s; #ifdef DEBUG tests(); #endif /* ifdef DEBUG */ if (argc > 1) { if (strcmp(argv[1], "--version") == 0) { version(); } else if (strcmp(argv[1], "--help") == 0) { help(); } else if (strcmp(argv[1], "--prog1") == 0) { copyToProgramm(code1); goto run; } else if (strcmp(argv[1],"--prog2") == 0) { copyToProgramm(code2); goto run; }else if (strcmp(argv[1],"--prog3") == 0) { copyToProgramm(code3); goto run; }else { printf("unknown command line argument '%s', try './njvm --help'", argv[1]); } } else { run: // Started printf("Ninja Virtual Machine started\n"); printProgramm(); execute(); // Stopped printf("Ninja Virtual Machine stopped\n"); return 0; } }	2023-10-30 00:24:55 +01:00
nilsplk	6740f41edc	stack organized	2023-10-30 00:17:17 +01:00
nilsplk	9890324ea5	Structurized the code	2023-10-26 22:36:54 +02:00
nilsplk	efe7663637	Print program	2023-10-26 17:26:59 +02:00
nilsplk	4e629a6ca7	orginized projekt	2023-10-26 14:49:57 +02:00
nilsplk	d947afdf03	Test	2023-10-26 14:03:31 +02:00
nilsplk	d05c415295	Now HALT works correctly	2023-10-22 13:51:32 +02:00
nilsplk	d23727f6da	Added the 3 progamms	2023-10-21 21:31:04 +02:00
nilsplk	62ede37645	Operations now work	2023-10-21 21:09:01 +02:00
nilsplk	9f7b69e5f7	Added the option to test and basic math to execute()	2023-10-21 19:14:48 +02:00
nplk84	7d7b67f7f2	Stack overflow errors get detected correctly	2023-10-16 11:56:38 +02:00
nplk84	655da552de	Added Keys	2023-10-15 19:08:12 +02:00
Elias Bennour	4f23944408	fix some warnings	2023-10-15 19:05:43 +02:00
Elias Bennour	19de6c2dbc	remove config.h.in	2023-10-15 19:01:28 +02:00
Elias Bennour	49b064d74d	remove config file update CMakeLists.txt update gitignore file	2023-10-15 19:00:46 +02:00
nplk84	119b5be760	deleated some shit	2023-10-15 18:50:37 +02:00
nplk84	23690576ea	Added Keys	2023-10-15 18:23:32 +02:00
nplk84	8a7d900d9a	Added the Stack	2023-10-12 14:42:31 +02:00
nplk84	1b742e0007	Added the Stack	2023-10-12 12:57:51 +02:00