diff options
| author | kr.angelov <kr.angelov@gmail.com> | 2014-09-11 15:39:39 +0000 |
|---|---|---|
| committer | kr.angelov <kr.angelov@gmail.com> | 2014-09-11 15:39:39 +0000 |
| commit | 621d748bac0914a93e3d399f81616c70fd083bb5 (patch) | |
| tree | 60f1f5ee5be58c9a26adb24d0a185766d9f1b20b /src/runtime/haskell/PGF/Binary.hs | |
| parent | 18ee232497cea462434359cdd759e20321a2b750 (diff) | |
a major revision of the bytecode generator and JIT compiler. the effect is that now we can compute with lambda functions and with true tail recursion
Diffstat (limited to 'src/runtime/haskell/PGF/Binary.hs')
| -rw-r--r-- | src/runtime/haskell/PGF/Binary.hs | 56 |
1 files changed, 30 insertions, 26 deletions
diff --git a/src/runtime/haskell/PGF/Binary.hs b/src/runtime/haskell/PGF/Binary.hs index 64707f386..ae9a7e358 100644 --- a/src/runtime/haskell/PGF/Binary.hs +++ b/src/runtime/haskell/PGF/Binary.hs @@ -136,32 +136,36 @@ instance Binary Equation where get = liftM2 Equ get get
instance Binary Instr where
- put (ENTER ) = putWord8 0
- put (EVAL_ARG_VAR n) = putWord8 1 >> put n
- put (EVAL_FREE_VAR n)= putWord8 2 >> put n
- put (CASE id l ) = putWord8 3 >> put (id,l)
- put (CASE_INT n l ) = putWord8 4 >> put (n,l)
- put (CASE_STR s l ) = putWord8 5 >> put (s,l)
- put (CASE_FLT d l ) = putWord8 6 >> put (d,l)
- put (ALLOC n) = putWord8 7 >> put n
- put (PUT_CONSTR id) = putWord8 8 >> put id
- put (PUT_FUN id) = putWord8 9 >> put id
- put (PUT_CLOSURE l) = putWord8 10 >> put l
- put (PUT_INT n) = putWord8 11 >> put n
- put (PUT_STR s) = putWord8 12 >> put s
- put (PUT_FLT d) = putWord8 13 >> put d
- put (SET_VALUE n) = putWord8 14 >> put n
- put (SET_ARG_VAR n) = putWord8 15 >> put n
- put (SET_FREE_VAR n) = putWord8 16 >> put n
- put (SET_PAD ) = putWord8 17
- put (PUSH_VALUE n) = putWord8 18 >> put n
- put (PUSH_ARG_VAR n) = putWord8 19 >> put n
- put (PUSH_FREE_VAR n)= putWord8 20 >> put n
- put (TAIL_CALL id) = putWord8 21 >> put id
- put (FAIL ) = putWord8 22
- put (UPDATE ) = putWord8 23
- put (RET n) = putWord8 24 >> put n
-
+ put (ENTER ) = putWord8 0
+ put (CASE id l ) = putWord8 8 >> put (id,l)
+ put (CASE_LIT (LInt n) l) = putWord8 16 >> put (n,l)
+ put (CASE_LIT (LStr s) l) = putWord8 17 >> put (s,l)
+ put (CASE_LIT (LFlt d) l) = putWord8 18 >> put (d,l)
+ put (ALLOC n) = putWord8 24 >> put n
+ put (PUT_CONSTR id) = putWord8 32 >> put id
+ put (PUT_FUN id) = putWord8 40 >> put id
+ put (PUT_CLOSURE l) = putWord8 48 >> put l
+ put (PUT_LIT (LInt n)) = putWord8 56 >> put n
+ put (PUT_LIT (LStr s)) = putWord8 57 >> put s
+ put (PUT_LIT (LFlt d)) = putWord8 58 >> put d
+ put (SET (HEAP n)) = putWord8 64 >> put n
+ put (SET (ARG_VAR n)) = putWord8 65 >> put n
+ put (SET (FREE_VAR n)) = putWord8 66 >> put n
+ put (SET_PAD ) = putWord8 72
+ put (PUSH (HEAP n)) = putWord8 80 >> put n
+ put (PUSH (ARG_VAR n)) = putWord8 81 >> put n
+ put (PUSH (FREE_VAR n)) = putWord8 82 >> put n
+ put (EVAL (HEAP n) RecCall ) = putWord8 88 >> put n
+ put (EVAL (ARG_VAR n) RecCall ) = putWord8 89 >> put n
+ put (EVAL (FREE_VAR n) RecCall ) = putWord8 90 >> put n
+ put (EVAL (HEAP n) (TailCall a b)) = putWord8 92 >> put n >> put a >> put b
+ put (EVAL (ARG_VAR n) (TailCall a b)) = putWord8 93 >> put n >> put a >> put b
+ put (EVAL (FREE_VAR n) (TailCall a b)) = putWord8 94 >> put n >> put a >> put b
+ put (CALL id RecCall ) = putWord8 96 >> put id
+ put (CALL id (TailCall a b)) = putWord8 100 >> put id >> put a >> put b
+ put (FAIL ) = putWord8 104
+ put (UPDATE ) = putWord8 112
+ put (RET n) = putWord8 120 >> put n
instance Binary Type where
put (DTyp hypos cat exps) = put (hypos,cat,exps)
|