2e43fab284
stack-checker: meta-d was a word and symbol, now meta-d word and (meta-d) symbol
...
issuse #358
2012-07-20 12:30:14 -07:00
1a2be52f25
compiler.tree: Renamed high-level IR node constructors to <#foo> from #foo. Moving towards making classes/word names not conflict.
2011-11-06 23:02:45 -08:00
7d792778f5
FFI rewrite part 7: compile callback bodies with the optimizing compiler
2010-07-28 00:49:26 -04:00
1da446d8fc
Code cleanups
2010-01-30 09:28:56 +13:00
e0d3878c00
stack-checker: tighten some screws in error reporting
2009-11-09 00:17:24 -06:00
55d1b76ad7
compiler.tree.escape-analysis: if the output of an #introduce node has an immutable tuple class type declaration, and it is not passed to any subroutine calls, or returned from the word, then unbox it. This speeds up vector arithmetic words on specialized arrays, because the specialized array is unboxed up-front, eliminating an indirection on every loop iteration
2009-08-09 16:29:21 -05:00
1e2561f863
Make walker work better with call( and breakpoints which are nested inside combinators
2009-05-05 09:12:32 -05:00
dac5203e81
compiler.tree.builder: Fix scoping of a variable by hints vocab
2009-04-26 16:04:44 -05:00
5649cc7a0a
Compiler warnings are no more
2009-04-23 22:17:25 -05:00
dea3987ca5
Silly workaround for performance regression
2009-04-22 00:44:06 -05:00
057f75e9a1
Refactor compiler.tree.builder to fix various regressions
2009-04-21 23:02:00 -05:00
469c9ee21d
Debugging stack checking
2009-04-21 16:09:53 -05:00
f38d2f91f6
Words which didn't compile cannot be run at all
2009-04-20 22:05:41 -05:00
8414693142
stack-checker: trust word declarations instead of recursively checking them
2009-04-20 18:44:45 -05:00
0a5b076c11
Make the walker infer
2009-04-16 23:14:11 -05:00
deae1d7bbb
Fix bootstrap
2009-04-10 04:41:26 -05:00
65a53e1fa5
Don't keep compiled-effect around anymore
2009-02-23 23:55:16 -06:00
e304d3c9f8
Local DCE
2008-12-04 06:02:49 -06:00
9e82f1f8dd
Better inference error messages
2008-11-16 19:42:53 -06:00
5bae69426d
Stack checker cleanup and optimization
...
- stack-checker.state vocabulary split up into stack-checker.{state,values,recursive-state}
- code that modifies and searches recursive state factored out into stack-checker.recursive-state
- recursive state is now a set of three binary hash trees instead of an alist, and no longer contains unnecessary data
- binary hash trees are in stack-checker.recursive-state.tree: unbalanced, persistent
- ~8 second speedup on bootstrap, ~20 second speedup in "peg.javascript" require
2008-11-13 00:07:45 -06:00
4a1bcacfd4
Refactoring recursive-state alist; now its a mapping from words to local state triples, reduces searching by a bit
2008-11-12 19:08:40 -06:00
f092622fac
CFG IR is now pure SSA
2008-10-20 01:56:28 -05:00
40e926609a
Fixing unit tests
2008-08-22 22:07:59 -05:00
2440fc1ceb
Fixing remaining issues
2008-08-22 17:38:23 -05:00
0efec0eff1
DCE fixes
2008-08-18 21:30:10 -05:00
e1987d4af9
Debugging new optimizer
2008-08-14 23:35:19 -05:00
f2a5a30c6f
New front-end and high-level optimizer lands
2008-08-12 03:22:45 -05:00
Doug Coleman
Slava Pestov