Projects

projects@lrde.epita.fr

1049 discussions

havm: branch master updated: havm-0.26-5-gd977ce7

by git＠lrde.epita.fr

This is an automated email from the git hooks/post-receive script. It was generated because a ref change was pushed to the repository containing the project "HAVM, a Tree intermediate language interpreter". The branch master has been updated via d977ce7d257059323763675b1142eb50f8bb46a8 (commit) via 839a47d52a9ec4d173d7009b034616667b2f89b1 (commit) via afe414e232fade40f3af0cd008ad9f2c026d2657 (commit) from 845a43229bcd8f77b48d781b3a583d02272e5328 (commit) Those revisions listed above that are new to this repository have not appeared on any other notification email; so we list those revisions in full, below. - Log ----------------------------------------------------------------- d977ce7 Typo in documentation. 839a47d Fix and update URLs in the documentation. afe414e Adjust the documentation regarding operators. ----------------------------------------------------------------------- Summary of changes: doc/havm.texi | 29 +++++++++++++++-------------- 1 file changed, 15 insertions(+), 14 deletions(-) hooks/post-receive -- HAVM, a Tree intermediate language interpreter

10 years, 7 months

havm: havm-0.26-5-gd977ce7 Typo in documentation.

by Roland Levillain

* doc/havm.texi (Top): Here. --- doc/havm.texi | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/doc/havm.texi b/doc/havm.texi index 9e738fd..71cd66f 100644 --- a/doc/havm.texi +++ b/doc/havm.texi @@ -122,7 +122,7 @@ and feedback can be sent to @href{projects@@lrde.epita.fr, @acronym{lrde}'s Projects Address}. @acronym{LRDE} stands for @href{http://www.lrde.epita.fr, Laboratoire de Recherche et Dévelopment de l'@acronym{EPITA}}, i.e., the Research and -Development Labof @acronym{EPITA}, the @href{http://www.epita.fr, École +Development Lab of @acronym{EPITA}, the @href{http://www.epita.fr, École Pour l'Informatique et les Techniques Avancées}. @href{http://www.cs.princeton.edu/~appel/, Andrew Appel's home page} -- 1.7.10.4

10 years, 7 months

havm: havm-0.26-4-g839a47d Fix and update URLs in the documentation.

by Roland Levillain

* doc/havm.texi (Top): Here. (wiki): Remove macro. --- doc/havm.texi | 21 ++++++++++----------- 1 file changed, 10 insertions(+), 11 deletions(-) diff --git a/doc/havm.texi b/doc/havm.texi index c2afb57..9e738fd 100644 --- a/doc/havm.texi +++ b/doc/havm.texi @@ -23,10 +23,6 @@ @end macro @end ifnothtml -@macro wiki -http://www.lrde.epita.fr/cgi-bin/twiki/view -@end macro - @macro havm @acronym{HAVM} @end macro @@ -120,22 +116,25 @@ non strict functional language very well suited for this kind of symbolic processing. @havm{} was coined on both Haskell, and @acronym{vm} standing for Virtual Machine. -Information about @havm{} can be found on @href{@wiki{}/Projects/Havm, -@havm{} Home Page}, and feedback can be sent to +Information about @havm{} can be found on +@href{http://www.lrde.epita.fr/wiki/Havm, @havm{} Home Page}, +and feedback can be sent to @href{projects@@lrde.epita.fr, @acronym{lrde}'s Projects Address}. @acronym{LRDE} stands for @href{http://www.lrde.epita.fr, Laboratoire de Recherche et Dévelopment de l'@acronym{EPITA}}, i.e., the Research and -Development Labof @acronym{EPITA}, the @href{http://www.epita.fr, Ecole +Development Labof @acronym{EPITA}, the @href{http://www.epita.fr, École Pour l'Informatique et les Techniques Avancées}. -@href{FIXME:, Andrew Appel's home page} includes links to material +@href{http://www.cs.princeton.edu/~appel/, Andrew Appel's home page} +includes links to material related to compilers theory, and some information about the -@href{FIXME:, Modern Compiler Implementation} book series. +@href{http://www.cs.princeton.edu/~appel/modern/, Modern Compiler +Implementation} book series. More information on Haskell can be found on @href{http://www.haskell.org, Haskell Home Page}. @havm{} requires a -specific Haskell compiler, @acronym{GHC}, the @href{FIXME: , Glasgow -Haskell Compiler}. +specific Haskell compiler, @acronym{GHC}, the +@href{http://www.haskell.org/ghc/, Glasgow Haskell Compiler}. @menu * Invoking havm:: Command Line Interface -- 1.7.10.4

10 years, 7 months

havm: havm-0.26-3-gafe414e Adjust the documentation regarding operators.

by Roland Levillain

* doc/havm.texi (HIR): Here. --- doc/havm.texi | 8 +++++--- 1 file changed, 5 insertions(+), 3 deletions(-) diff --git a/doc/havm.texi b/doc/havm.texi index 837c7c5..c2afb57 100644 --- a/doc/havm.texi +++ b/doc/havm.texi @@ -42,7 +42,7 @@ This manual is for @acronym{HAVM} (version @value{VERSION}, Copyright @copyright{} 2003 Robert Anisko. -Copyright @copyright{} 2003-2006 EPITA Research and Development +Copyright @copyright{} 2003-2006, 2014 EPITA Research and Development Laboratory (LRDE) @quotation @@ -251,8 +251,10 @@ Stm ::= "move" Exp Exp | "label" Label Literal . -Oper ::= "add" | "sub" | "mul" | "div" | "mod" +Oper ::= "add" | "sub" | "mul" | "div" + | "and" | "or" | "lshift" | "rshift" | "arshift" | "xor" Relop ::= "eq" | "ne" | "lt" | "gt" | "le" | "ge" + | "ult" | "ule" | "ugt" | "uge" Label ::= Ident Temp ::= fp | rv | sp | Ident fp ::= "fp" | "$fp" @@ -266,7 +268,7 @@ In addition, the following alternative syntax for operators is supported, but deprecated. @example -Oper ::= "(+)" | "(-)" | "(*)" | "(/)" | "(%)" +Oper ::= "(+)" | "(-)" | "(*)" | "(/)" Relop ::= "(=)" | "(<>)" | "(<)" | "(>)" | "(<=)" | "(>=)" @end example -- 1.7.10.4

10 years, 7 months

havm: branch master updated: havm-0.26-2-g845a432

by git＠lrde.epita.fr

This is an automated email from the git hooks/post-receive script. It was generated because a ref change was pushed to the repository containing the project "HAVM, a Tree intermediate language interpreter". The branch master has been updated via 845a43229bcd8f77b48d781b3a583d02272e5328 (commit) via 7400269cdd9b2d865f24acdec17875bb81e4c21f (commit) from ac93a91b0d3537621a4d64619e217ab27ee47025 (commit) Those revisions listed above that are new to this repository have not appeared on any other notification email; so we list those revisions in full, below. - Log ----------------------------------------------------------------- 845a432 Have binary and relational operators follow Appel's specifications. 7400269 Version 0.26a. ----------------------------------------------------------------------- Summary of changes: NEWS | 10 ++++++++++ configure.ac | 2 +- src/Ir.hs | 46 ++++++++++++++++++++++++++++++---------------- src/Scan.hs | 17 +++++++++++------ src/StdBinop.hs | 24 ++++++++++++++++++------ src/StdRelop.hs | 10 +++++++++- 6 files changed, 79 insertions(+), 30 deletions(-) hooks/post-receive -- HAVM, a Tree intermediate language interpreter

10 years, 7 months

havm: havm-0.26-2-g845a432 Have binary and relational operators follow Appel's specifications.

by Roland Levillain

* src/Ir.hs (Op): Add binary operators And, Or, Lshift, Rshift, Arshift and Xor. Remove operator Mod. Add relational operators Ult, Ule, Ugt and Uge. * src/StdBinop.hs (binop): Implement operators And, Or, Lshift, Rshift, Arshift and Xor. Remove operator Mod. (unsigned): New helper routine. * src/StdRelop.hs (relop): Implement operators Ult, Ule, Ugt and Uge. (unsigned): New helper routine. * src/Scan.hs (scanTokKeyword): Adjust. * NEWS: Update. --- NEWS | 6 ++++++ src/Ir.hs | 46 ++++++++++++++++++++++++++++++---------------- src/Scan.hs | 17 +++++++++++------ src/StdBinop.hs | 24 ++++++++++++++++++------ src/StdRelop.hs | 10 +++++++++- 5 files changed, 74 insertions(+), 29 deletions(-) diff --git a/NEWS b/NEWS index d251097..9b79c56 100644 --- a/NEWS +++ b/NEWS @@ -1,5 +1,11 @@ New in 0.26a: +* Binary and relational operators implementation + + All binary (arithmetic/logic) and relational operators now follow + the specification of the Tree language defined by Andrew Appel in + his ``Modern Compiler Implementation'' books. + New in 0.26, 2014-05-06: diff --git a/src/Ir.hs b/src/Ir.hs index 2dda499..e3ee0a4 100644 --- a/src/Ir.hs +++ b/src/Ir.hs @@ -1,7 +1,7 @@ module Ir (Exp (Const, Name, Temp, Binop, Mem, Call, ESeq), Stm (Move, Sxp, Jump, CJump, Seq, Label, LabelEnd, Literal), - Op (Add, Sub, Mul, Div, Mod, And, Or), - Relop (Eq, Ne, Lt, Gt, Le, Ge)) + Op (Add, Sub, Mul, Div, And, Or, Lshift, Rshift, Arshift, Xor), + Relop (Eq, Ne, Lt, Gt, Le, Ge, Ult, Ule, Ugt, Uge)) where data Exp a = Const a Int @@ -42,9 +42,12 @@ data Op = Add | Sub | Mul | Div - | Mod | And | Or + | Lshift + | Rshift + | Arshift + | Xor data Relop = Eq | Ne @@ -52,20 +55,31 @@ data Relop = Eq | Gt | Le | Ge + | Ult + | Ule + | Ugt + | Uge instance Show Op where - show Add = "add" - show Sub = "sub" - show Mul = "mul" - show Div = "div" - show Mod = "mod" - show And = "and" - show Or = "or" + show Add = "add" + show Sub = "sub" + show Mul = "mul" + show Div = "div" + show And = "and" + show Or = "or" + show Lshift = "lshift" + show Rshift = "rshift" + show Arshift = "arshift" + show Xor = "xor" instance Show Relop where - show Eq = "eq" - show Ne = "ne" - show Lt = "lt" - show Gt = "gt" - show Le = "le" - show Ge = "ge" + show Eq = "eq" + show Ne = "ne" + show Lt = "lt" + show Gt = "gt" + show Le = "le" + show Ge = "ge" + show Ult = "ult" + show Ule = "ule" + show Ugt = "ugt" + show Uge = "uge" diff --git a/src/Scan.hs b/src/Scan.hs index 2023545..e88c19b 100644 --- a/src/Scan.hs +++ b/src/Scan.hs @@ -146,17 +146,18 @@ scanTokKeyword "name" loc = TokName loc scanTokKeyword "seq" loc = TokSeq loc scanTokKeyword "temp" loc = TokTemp loc -scanTokKeyword "add" loc = TokOp (Add, loc) -scanTokKeyword "mul" loc = TokOp (Mul, loc) -scanTokKeyword "sub" loc = TokOp (Sub, loc) -scanTokKeyword "div" loc = TokOp (Div, loc) -scanTokKeyword "mod" loc = TokOp (Mod, loc) +scanTokKeyword "add" loc = TokOp (Add, loc) +scanTokKeyword "mul" loc = TokOp (Mul, loc) +scanTokKeyword "sub" loc = TokOp (Sub, loc) +scanTokKeyword "div" loc = TokOp (Div, loc) +scanTokKeyword "lshift" loc = TokOp (Lshift, loc) +scanTokKeyword "rshift" loc = TokOp (Rshift, loc) +scanTokKeyword "arshift" loc = TokOp (Arshift, loc) scanTokKeyword "(+)" loc = TokOp (Add, loc) scanTokKeyword "(*)" loc = TokOp (Mul, loc) scanTokKeyword "(-)" loc = TokOp (Sub, loc) scanTokKeyword "(/)" loc = TokOp (Div, loc) -scanTokKeyword "(%)" loc = TokOp (Mod, loc) scanTokKeyword "eq" loc = TokRelop (Eq, loc) scanTokKeyword "ne" loc = TokRelop (Ne, loc) @@ -164,6 +165,10 @@ scanTokKeyword "lt" loc = TokRelop (Lt, loc) scanTokKeyword "gt" loc = TokRelop (Gt, loc) scanTokKeyword "le" loc = TokRelop (Le, loc) scanTokKeyword "ge" loc = TokRelop (Ge, loc) +scanTokKeyword "ult" loc = TokRelop (Ult, loc) +scanTokKeyword "ule" loc = TokRelop (Ule, loc) +scanTokKeyword "ugt" loc = TokRelop (Ugt, loc) +scanTokKeyword "uge" loc = TokRelop (Uge, loc) scanTokKeyword "(=)" loc = TokRelop (Eq, loc) scanTokKeyword "(<>)" loc = TokRelop (Ne, loc) diff --git a/src/StdBinop.hs b/src/StdBinop.hs index 673f26a..a15eb68 100644 --- a/src/StdBinop.hs +++ b/src/StdBinop.hs @@ -2,16 +2,28 @@ module StdBinop (binop) where import Data.Int +import Data.Word +import Data.Bits import Ir modulo32 op a b = fromIntegral((fromIntegral a :: Int32) `op` (fromIntegral b :: Int32)) --- FIXME: Add all binary operators. +unsigned op a b = fromIntegral((fromIntegral a :: Word) `op` b) + binop :: Op -> Int -> Int -> Int -binop Add = modulo32 (+) -binop Sub = modulo32 (-) -binop Mul = modulo32 (*) -binop Div = modulo32 quot -binop Mod = modulo32 rem +binop Add = modulo32 (+) +binop Sub = modulo32 (-) +binop Mul = modulo32 (*) +binop Div = modulo32 quot +binop And = modulo32 (.&.) +binop Or = modulo32 (.|.) +-- Logical shifts. When shifting Words (unsigned integers) instead of +-- Ints (signed integers), the shifts become logical shifts (see +-- http://rosettacode.org/wiki/Bitwise_operations#Haskell). +binop Lshift = unsigned shiftL +binop Rshift = unsigned shiftR +-- Arithmetic right shift. +binop Arshift = shiftR +binop Xor = xor diff --git a/src/StdRelop.hs b/src/StdRelop.hs index bd94ea6..183fef2 100644 --- a/src/StdRelop.hs +++ b/src/StdRelop.hs @@ -1,9 +1,12 @@ module StdRelop (relop) where +import Data.Word + import Ir --- FIXME: Add all relational operators. +unsigned op a b = (fromIntegral a :: Word) `op` (fromIntegral b :: Word) + relop :: Relop -> Int -> Int -> Bool relop Eq = (==) relop Ne = (/=) @@ -11,3 +14,8 @@ relop Lt = (<) relop Gt = (>) relop Le = (<=) relop Ge = (>=) +-- Unsigned integer inequalities. +relop Ult = unsigned (<) +relop Ule = unsigned (<=) +relop Ugt = unsigned (>) +relop Uge = unsigned (>=) -- 1.7.10.4

10 years, 7 months

Re: [Projects] HAVM-like ...

by Roland Levillain

On 08/04/2014 15:12, Pablo Oliveira wrote: > Chers collègues, Bonjour Pablo, > Comme certains d'entre vous le savent, j'organise depuis deux ans > maintenant, un projet Tiger à l'ISTY (l'école d'ingénieurs rattachée à > l'Université de Versailles). > Je me suis fortement inspiré du projet Tiger de l'Epita (merci encore > pour la superbe documentation !). > > Mes étudiants utilisent HAVM pour tester les programmes IR et en sont > contents. Néanmoins, le bug lié à la mauvaise execution d'un jump > pendant l'évaluation d'une expression agace souvent les étudiants (même > si avec un brin de persévérance on peut le contourner). > > Toujours est-il que j'ai essayé de fixer ce bug dans HAVM, mais n'étant > pas un expert Haskell, cela était difficile. Finalement, je me suis dit > que ce serait plus rapide pour moi de ré-implémenter la VM dans un > langage que je maîtrise mieux. Je vous présente donc IRVM: > > https://github.com/pablooliveira/irvm > > Si vous souhaitez l'utiliser ou si vous avez des retours, n'hésitez pas > à m'en faire part. La stratégie pour résoudre le problème de > l'évaluation/jump est finalement assez simple, et je pense pourrait être > portée dans HAVM par quelqu'un de doué en Haskell (si vous souhaitez > échanger la dessus, n'hésitez pas également). Merci pour ce message et félicitations pour ce travail ! Je vais jeter un œil à IRVM. Amicalement, Roland -- Roland Levillain EPITA Research and Development Laboratory (LRDE) 14-16, rue Voltaire - FR-94276 Le Kremlin-Bicêtre Cedex - France Phone: +33 1 53 14 59 45 - Fax: +33 1 53 14 59 22 - www.lrde.epita.fr

10 years, 7 months

havm: havm-0.26-1-g7400269 Version 0.26a.

by Roland Levillain

* configure.ac, NEWS: Here. --- NEWS | 4 ++++ configure.ac | 2 +- 2 files changed, 5 insertions(+), 1 deletion(-) diff --git a/NEWS b/NEWS index 36a136f..d251097 100644 --- a/NEWS +++ b/NEWS @@ -1,3 +1,7 @@ +New in 0.26a: + + + New in 0.26, 2014-05-06: * GHC 7.4 diff --git a/configure.ac b/configure.ac index 60536ee..702544a 100644 --- a/configure.ac +++ b/configure.ac @@ -20,7 +20,7 @@ # Catch "HAVM_*" macros that are not expanded. m4_pattern_forbid([^HAVM_]) AC_PREREQ([2.59]) -AC_INIT([HAVM], [0.26], [projects(a)lrde.epita.fr]) +AC_INIT([HAVM], [0.26a], [projects(a)lrde.epita.fr]) AC_CONFIG_AUX_DIR([build-aux]) AM_INIT_AUTOMAKE([1.9.6 dist-bzip2]) -- 1.7.10.4

10 years, 7 months

havm: havm-0.25-12-gd3b5c93 Arithmetic overflow should wrap around.

by Pablo de Oliveira

Tiger specifications do not define the expected behavior of an integer overflow. Yet, to be consistent with Nolimips, Spim, and most current architectures, we ensure that arithmetic operations in HAVM wrap around. * src/StdBinop.hs (modulo32): New function. Use it... (binop): ...here. * tests/overflow.lir, * tests/overflow.out, * tests/overflow.test: New test. * tests/Makefile.am (TESTS): Add overflow.test. (EXTRA_DIST): Add overflow.lir and overflow.out. Signed-off-by: Roland Levillain <roland(a)lrde.epita.fr> --- src/StdBinop.hs | 15 ++++++++++----- tests/Makefile.am | 5 +++-- tests/overflow.lir | 14 ++++++++++++++ tests/overflow.out | 1 + tests/{cmp.test => overflow.test} | 11 +++++------ 5 files changed, 33 insertions(+), 13 deletions(-) create mode 100644 tests/overflow.lir create mode 100644 tests/overflow.out copy tests/{cmp.test => overflow.test} (79%) diff --git a/src/StdBinop.hs b/src/StdBinop.hs index 67a177c..673f26a 100644 --- a/src/StdBinop.hs +++ b/src/StdBinop.hs @@ -1,12 +1,17 @@ module StdBinop (binop) where +import Data.Int + import Ir +modulo32 op a b = + fromIntegral((fromIntegral a :: Int32) `op` (fromIntegral b :: Int32)) + -- FIXME: Add all binary operators. binop :: Op -> Int -> Int -> Int -binop Add = (+) -binop Sub = (-) -binop Mul = (*) -binop Div = quot -binop Mod = rem +binop Add = modulo32 (+) +binop Sub = modulo32 (-) +binop Mul = modulo32 (*) +binop Div = modulo32 quot +binop Mod = modulo32 rem diff --git a/tests/Makefile.am b/tests/Makefile.am index 5849e8a..c7a59a0 100644 --- a/tests/Makefile.am +++ b/tests/Makefile.am @@ -5,9 +5,10 @@ XFAIL_TESTS = TESTS = \ -cmp.test trace.test +cmp.test overflow.test trace.test -EXTRA_DIST = cmp.lir cmp.out fact.lir fact.out $(TESTS) +EXTRA_DIST = cmp.lir cmp.out fact.lir fact.out overflow.lir overflow.out \ + $(TESTS) # Each test case depends on defs. check_SCRIPTS = defs diff --git a/tests/overflow.lir b/tests/overflow.lir new file mode 100644 index 0000000..08781f1 --- /dev/null +++ b/tests/overflow.lir @@ -0,0 +1,14 @@ +seq + label main + sxp + call + name print_int + binop (*) + const 56182 + const 56182 + call end + move + temp rv + const 0 + label end +seq end diff --git a/tests/overflow.out b/tests/overflow.out new file mode 100644 index 0000000..a34546e --- /dev/null +++ b/tests/overflow.out @@ -0,0 +1 @@ +-1138550172 \ No newline at end of file diff --git a/tests/cmp.test b/tests/overflow.test similarity index 79% copy from tests/cmp.test copy to tests/overflow.test index 55d1015..9904ac7 100755 --- a/tests/cmp.test +++ b/tests/overflow.test @@ -1,5 +1,5 @@ #! /bin/sh -# Copyright (C) 2012 EPITA Research and Development Laboratory (LRDE) +# Copyright (C) 2014 EPITA Research and Development Laboratory (LRDE) # # This file is part of HAVM. # @@ -22,12 +22,11 @@ set -e -HAVM_pass --trace $srcdir/cmp.lir -cmp stdout $srcdir/cmp.out +HAVM_pass --trace $srcdir/overflow.lir +cmp stdout $srcdir/overflow.out test -s stderr -HAVM_pass --trace=3 $srcdir/cmp.lir 3>stdtrc -cmp stdout $srcdir/cmp.out +HAVM_pass --trace=3 $srcdir/overflow.lir 3>stdtrc +cmp stdout $srcdir/overflow.out test ! -s stderr test -s stdtrc - -- 1.7.10.4

10 years, 7 months

havm: havm-0.25-13-gcbc954b checkLow should occur before plaining.

by Pablo de Oliveira

* src/Main.hs (evalM): Here. In some cases, plaining removes nested seqs in the original program. If plaining happens first, checkLow may accept a program as valid LIR when in fact the original program contained nested seqs. * tests/nestedseq.hir, * tests/nestedseq.test: New test. * tests/Makefile.am (TESTS): Add nestedseq.test. (EXTRA_DIST): Add nestedseq.hir. Signed-off-by: Roland Levillain <roland(a)lrde.epita.fr> --- src/Main.hs | 4 ++-- tests/Makefile.am | 10 +++++++--- tests/nestedseq.hir | 8 ++++++++ tests/{overflow.test => nestedseq.test} | 9 +-------- 4 files changed, 18 insertions(+), 13 deletions(-) create mode 100644 tests/nestedseq.hir copy tests/{overflow.test => nestedseq.test} (80%) diff --git a/src/Main.hs b/src/Main.hs index 652c2c3..46b84d4 100644 --- a/src/Main.hs +++ b/src/Main.hs @@ -116,14 +116,14 @@ evalM fm stms = setHandle setProfileHandle fm "profile" setHandle setDisplayHandle fm "display" setHandle setTraceHandle fm "trace" + trace ["checkingLow"] + checkLowM stms trace ["plaining"] stms <- plainStms stms trace ["unparsing"] unparseM stms trace ["checking"] checkHighM stms - trace ["checkingLow"] - checkLowM stms preloadStms 0 stms rstore "i0" 0 trace ["evaling"] diff --git a/tests/Makefile.am b/tests/Makefile.am index c7a59a0..6bbce72 100644 --- a/tests/Makefile.am +++ b/tests/Makefile.am @@ -4,10 +4,14 @@ XFAIL_TESTS = -TESTS = \ -cmp.test overflow.test trace.test +TESTS = \ + cmp.test nestedseq.test overflow.test trace.test -EXTRA_DIST = cmp.lir cmp.out fact.lir fact.out overflow.lir overflow.out \ +EXTRA_DIST = \ + cmp.lir cmp.out \ + fact.lir fact.out \ + nestedseq.hir \ + overflow.lir overflow.out \ $(TESTS) # Each test case depends on defs. diff --git a/tests/nestedseq.hir b/tests/nestedseq.hir new file mode 100644 index 0000000..6d5a5fb --- /dev/null +++ b/tests/nestedseq.hir @@ -0,0 +1,8 @@ +label main +seq + seq + sxp + const 0 + seq end +seq end +label end diff --git a/tests/overflow.test b/tests/nestedseq.test similarity index 80% copy from tests/overflow.test copy to tests/nestedseq.test index 9904ac7..ba105b8 100755 --- a/tests/overflow.test +++ b/tests/nestedseq.test @@ -22,11 +22,4 @@ set -e -HAVM_pass --trace $srcdir/overflow.lir -cmp stdout $srcdir/overflow.out -test -s stderr - -HAVM_pass --trace=3 $srcdir/overflow.lir 3>stdtrc -cmp stdout $srcdir/overflow.out -test ! -s stderr -test -s stdtrc +HAVM_run 129 --low $srcdir/nestedseq.hir -- 1.7.10.4

10 years, 7 months

Jump to page:

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

Projects