Slava Pestov
|
0612bc6177
|
Factor source files should not be executable
|
2009-11-21 17:50:43 -06:00 |
Slava Pestov
|
d7594c3381
|
compiler: inline singleton predicates, and optimize predicate engines, reduces terrain demo deployed size by ~20kb
|
2009-08-17 23:59:24 -05:00 |
|
Slava Pestov
|
343151fd62
|
compiler.tree.finalization: undo a change that resulted in a compile time regression
|
2009-07-18 03:33:24 -05:00 |
|
Slava Pestov
|
5061db2a48
|
compiler.cfg: Move tail call optimization to the end, compiler.tree: simplify finalization pass because of this
|
2009-07-17 22:57:28 -05:00 |
Slava Pestov
|
e76dce8aff
|
Overflowing fixnum intrinsics now expand into several CFG nodes. This speeds up the common case since only the uncommon case is now a stack syncpoint
|
2009-07-16 18:29:40 -05:00 |
|
Slava Pestov
|
80e719ba5b
|
Remove stupid commented out code
|
2009-03-12 17:30:33 -05:00 |
|
Slava Pestov
|
6b25e99470
|
Add summary for heaps more vocabs
|
2009-02-16 21:05:13 -06:00 |
|
Slava Pestov
|
a56d480aa6
|
Various optimizations leading to a 10% speedup on compiling empty EBNF parser:
- open-code getenv primitive
- inline tuple predicates in finalization
- faster partial dispatch
- faster built-in type predicates
- faster tuple predicates
- faster lo-tag dispatch
- compile V{ } clone and H{ } clone more efficiently
- add fixnum fast-path to =; avoid indirect branch if two fixnums not eq
- faster >alist on hashtables
|
2008-12-06 09:16:29 -06:00 |
|
Slava Pestov
|
26f309d2ae
|
Trying to make PEGs compile faster by reducing the number of low level IR nodes: merge functionality of #>r and #r> into #shuffle, and generate 1 node instead of 3 for calls to get-local
|
2008-11-11 18:46:31 -06:00 |
|
Slava Pestov
|
1912c57bb5
|
Fix comment
|
2008-10-23 05:55:50 -05:00 |
|
Slava Pestov
|
e92f795a76
|
More work on intrinsics; memory allocation and slot access now expands correctly
|
2008-10-20 20:40:15 -05:00 |
|
Slava Pestov
|
d8d3645d72
|
Fixing more codegen bugs
|
2008-10-13 12:49:20 -05:00 |
|
Slava Pestov
|
f979ae5b82
|
Expand slot accessors further to avoid having to use complex template decision
|
2008-10-11 14:05:15 -05:00 |
|
Slava Pestov
|
0e4e05d5cd
|
Debugging new codegen
|
2008-10-08 03:51:44 -05:00 |
|
Slava Pestov
|
10c68ebb21
|
New modular arithmetic optimization pass
|
2008-09-12 18:08:38 -05:00 |
|
Slava Pestov
|
40da49bef5
|
Perform loop detection before normalization, clean up normalization pass, more aggressive recursive return value propagation. Fixes regression on nsieve benchmark
|
2008-09-12 05:17:27 -05:00 |
|
Slava Pestov
|
cf80dd122a
|
Updating code for make and fry changes
|
2008-09-10 22:11:40 -05:00 |
|
Slava Pestov
|
44f53de164
|
Move make to its own vocabulary, remove fry _ feature
|
2008-09-10 20:07:00 -05:00 |
|
Slava Pestov
|
6b07c85fec
|
Minor fixes here and there for delegation slot removal
|
2008-09-03 06:05:50 -05:00 |
|
Slava Pestov
|
e1716d92b3
|
Remove delegation slot
|
2008-09-03 03:46:56 -05:00 |
|
Slava Pestov
|
a4a00f6e40
|
Adding missing optimizations to finalization pass
|
2008-09-02 22:59:49 -05:00 |
|
Slava Pestov
|
110a5e5162
|
Change equality semantics
|
2008-09-02 02:02:05 -05:00 |
|
Slava Pestov
|
dd45c26234
|
Oops, we weren't doing TCO in some cases
|
2008-08-31 05:40:29 -05:00 |