| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2014-09-29 | enlarge the code window in pgf_jit_gates to ensure enough space on 64-bit ↵ | kr.angelov | |
| machines | |||
| 2014-09-25 | switch off the debugging of the JIT compiler which I had turned on ↵ | kr.angelov | |
| accidentally. silence two harmless warnings | |||
| 2014-09-25 | now a complete JIT compiler and ByteCode compiler for the def rules in the ↵ | kr.angelov | |
| abstract syntax. there might be some bugs yet to be found, meta variables and computation under lambda is only partially supported | |||
| 2014-09-11 | a major revision of the bytecode generator and JIT compiler. the effect is ↵ | kr.angelov | |
| that now we can compute with lambda functions and with true tail recursion | |||
| 2014-09-05 | the code for def rules now uses proper graph update to preserve lazyness | kr.angelov | |
| 2014-09-05 | full support for recursive def rules in the C runtime | kr.angelov | |
| 2014-09-01 | partial implementation for recursive def rules | kr.angelov | |
| 2014-09-01 | bug fixes in the JIT compiler | kr.angelov | |
| 2014-08-11 | pattern matching in def rules is now supported | kr.angelov | |
| 2014-08-11 | a partial support for def rules in the C runtime | kr.angelov | |
| The def rules are now compiled to byte code by the compiler and then to native code by the JIT compiler in the runtime. Not all constructions are implemented yet. The partial implementation is now in the repository but it is not activated by default since this requires changes in the PGF format. I will enable it only after it is complete. | |||
| 2013-11-07 | fix for the memory allocation in the jitter which should work for Windows. | kr.angelov | |
| 2013-11-04 | fix the debug mode of the JIT compiler after the refactoring in libgu | kr.angelov | |
| 2013-11-01 | remove the include to mman.h in jit.c since it doesn't seem to be used | kr.angelov | |
| 2013-10-04 | GuString is now an ordinary C string - it makes live easier. In addition ↵ | kr.angelov | |
| PgfSymbolKS, PgfExprFun and PgfLiteralStr now keep their strings as embedded flexible arrays. The latest change gives us the same compactness as the old representation but it is a lot easier to use. | |||
| 2013-09-25 | added assertion in the JIT compiler which checks that we are not going ↵ | kr.angelov | |
| outside of the compilation window | |||
| 2013-09-12 | enable the PGF JIT compiler for Android | kr.angelov | |
| 2013-08-16 | fixes in the C and Python API to make them closer to the Haskell API | kr.angelov | |
| 2013-06-26 | we no longer maintain an explicit list of functions per category since now ↵ | kr.angelov | |
| it is implicitly kept in the JIT compiled code | |||
| 2013-06-26 | an optimization in the jitter for generating more compact code | kr.angelov | |
| 2013-06-26 | compatibility issue for MacOS X | kr.angelov | |
| 2013-06-26 | fix for x86_64 | kr.angelov | |
| 2013-06-25 | Now there is a just-in-time compiler which generates native code for proof ↵ | kr.angelov | |
| search. This is already used by the exhaustive generator. The time to generate 10000 abstract trees with ParseEng went down from 4.43 sec to 0.29 sec. | |||
