Slava Pestov
|
79a3f6b0d5
|
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
|
b3693e3c3b
|
compiler.tree.propagation: remove method inlining heuristic
|
2009-08-17 22:29:05 -05:00 |
|
Slava Pestov
|
a742145fd9
|
compiler.tree.modular-arithmetic: >fixnum elimination and value info annotations were too aggressive
|
2009-08-17 01:20:25 -05:00 |
|
Slava Pestov
|
aeb33f5f15
|
compiler.tree.modular-arithmetic: stronger optimization handles > 1 usages case as well as values defined and used in loops. Eliminates 5 out of 8 >fixnum calls in benchmark.yuv-to-rgb
|
2009-08-15 18:42:41 -05:00 |
Doug Coleman
|
7c3824639e
|
move if-zero etc to math, remove 1-/1+ from math
|
2009-08-14 14:27:23 -05:00 |
|
Doug Coleman
|
d1ce837569
|
Delete empty unit tests files, remove 1- and 1+, reorder IN: lines in a lot of places, minor refactoring
|
2009-08-13 19:21:44 -05:00 |
|
Slava Pestov
|
6f2170eb02
|
More accurate wrap-interval in compiler.tree.propagation.info fixes test regression; constructing an interval with endpoints at infinity now outputs full-interval
|
2009-08-12 03:25:53 -05:00 |
|
Slava Pestov
|
5f0390d83b
|
alien.complex: fix tests
|
2009-08-11 14:07:33 -05:00 |
Philipp Brüschweiler
|
3dc33b67a9
|
various doc fixes
|
2009-08-11 16:58:47 +02:00 |
|
Slava Pestov
|
7956e63fc2
|
compiler.tree.propagation: be more careful with intervals, ensuring that the inferred interval of a value is a subset of the value class's interval. This improves accuracy, for example [ >fixnum 1 + >fixnum most-positive-fixnum <= ] constant-folds to true
|
2009-08-10 01:16:49 -05:00 |
|
Slava Pestov
|
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 |
|
Slava Pestov
|
638f5b6579
|
More accurate interval inference for mod, rem, and propagation can now infer intervals in the case where a value might be f. so, [ [ 127 bitand ] [ drop f ] if dup [ 0 >= ] [ not ] if ] now constant-folds down to 't'!
|
2009-08-08 23:03:45 -05:00 |
|
Slava Pestov
|
26531ddf8b
|
More accurate interval-mod and interval-rem
|
2009-08-08 22:01:12 -05:00 |
|
Slava Pestov
|
6ce9bcc658
|
compiler.graphviz: add high-level IR call graph rendering
|
2009-08-05 03:33:06 -05:00 |
|
Slava Pestov
|
b22a530511
|
compiler.tree.recursive: have to check tail call flag of call tree edges too
|
2009-08-05 02:14:49 -05:00 |
|
Slava Pestov
|
a2f52c1e41
|
compiler.tree.recursive: more accurate loop detection
|
2009-08-04 19:18:40 -05:00 |
Slava Pestov
|
4b87ee4ebd
|
compiler.tree.recursive: add some more more loop detection tests
|
2009-08-04 16:23:14 -05:00 |
|
Slava Pestov
|
00254d1bde
|
compiler.cfg.ssa.destruction: new implementation: simpler and more correct
|
2009-08-02 10:26:52 -05:00 |
|
Slava Pestov
|
49ac00097e
|
compiler.tree.propagation.call-effect: fix case where quotation inlining could enter an infinite loop: [ dup call( quot -- ) ] dup call( quot -- ) etc
|
2009-08-01 23:34:14 -05:00 |
|
Slava Pestov
|
420e28b8bd
|
compiler.tree.propagation.info: fix load error
|
2009-07-27 00:30:24 -05:00 |
|
Slava Pestov
|
99601d34fa
|
compiler.cfg.utilities: move value-info utilities to compiler.tree.propagation.info
|
2009-07-26 21:10:33 -05:00 |
|
Slava Pestov
|
df874c3b50
|
compiler.tree.finalization: undo a change that resulted in a compile time regression
|
2009-07-18 03:33:24 -05:00 |
|
Slava Pestov
|
9e6e61edfa
|
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
|
d053f88431
|
compiler.tree.propagation.transforms: fix shift transform
|
2009-07-17 00:02:57 -05:00 |
|
Slava Pestov
|
39a70db831
|
Improve code generation for shift word: add intrinsics for fixnum-shift-fast in the case where the shift count is not constant, transform 1 swap shift into a more overflow check with open-coded fast case, transform bitand into fixnum-bitand in more cases
|
2009-07-16 23:50:48 -05:00 |
|
Slava Pestov
|
99faf3c79f
|
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 |
Daniel Ehrenberg
|
5a5a6a34b9
|
fixing stupid bug in propagation
|
2009-07-16 00:43:54 -05:00 |
|
Daniel Ehrenberg
|
a295b28652
|
define-partial-eval framework in propagation pass makes it easy to add transforms; moving some transforms from stack checker to propagation, making them stronger
|
2009-07-16 00:34:50 -05:00 |
|
Daniel Ehrenberg
|
ad301b07ae
|
new is inlined in the propagation pass when the class is known
|
2009-07-14 14:16:39 -05:00 |
|
Daniel Ehrenberg
|
c6c5be4eb0
|
call( and execute( inline known quotations/words in the propagation pass
|
2009-07-14 01:12:45 -05:00 |
|
Daniel Ehrenberg
|
55e5d60b23
|
Adding authors to compiler.tree.modular-arithmetic
|
2009-07-09 23:09:49 -05:00 |
|
Daniel Ehrenberg
|
bf706063e2
|
Improving modular arithmetic optimization to be aware of words like set-alien-unsigned-2
|
2009-07-09 23:07:38 -05:00 |
|
Slava Pestov
|
511ca9dea0
|
compiler.tree.propagation: better length propagation
|
2009-07-09 02:28:30 -05:00 |
|
Slava Pestov
|
e21cf72927
|
compiler.tree.dead-code: methods on flushable generics should be flushable
|
2009-07-03 21:31:26 -05:00 |
|
Slava Pestov
|
2b5df8c298
|
compiler.tree.optimizer: Remove redundant call to compute-def-use
|
2009-07-01 17:41:20 -05:00 |
|
Slava Pestov
|
9eec019e9b
|
Remove initial-quot feature
|
2009-06-15 13:07:15 -05:00 |
|
Slava Pestov
|
48c31d441c
|
Add some failing unit tests exposing bugs in initial-quot: implementation
|
2009-06-13 18:34:27 -05:00 |
|
Slava Pestov
|
3de85158de
|
Merge branch 'master' into global_optimization
|
2009-06-01 03:12:32 -05:00 |
|
Slava Pestov
|
1fc830a99e
|
Add a with-scope so that optimize-tree doesn't pollute namespace
|
2009-05-27 18:58:54 -05:00 |
Doug Coleman
|
8da9d0f203
|
rename peek -> last and update all usages
|
2009-05-25 16:38:33 -05:00 |
|
Doug Coleman
|
34e1d60578
|
add a clamp word to math.order, use clamp word throughout libraries
|
2009-05-24 21:35:50 -05:00 |
|
Slava Pestov
|
c2499cdd55
|
stack-checker: fix case where invalid code could infer
|
2009-05-23 15:50:35 -05:00 |
Joe Groff
|
483c936eb3
|
get rid of useless test
|
2009-05-21 20:56:57 -05:00 |
|
Slava Pestov
|
ba04d5af1e
|
Update documentation for stricter vocabulary search path semantics
|
2009-05-16 00:29:21 -05:00 |
|
Slava Pestov
|
344f3668e4
|
Fix escape analysis bug reported by Doug
|
2009-05-15 17:18:38 -05:00 |
|
Slava Pestov
|
d7db5edadc
|
Cleaning up USING: lists for new strict semantics
|
2009-05-14 16:54:16 -05:00 |
|
Slava Pestov
|
302d829ea9
|
Fix compiler breakage if a GENERIC# has an incorrect stack effect declaration
|
2009-05-12 21:23:52 -05:00 |
Slava Pestov
|
70deacb900
|
Fix unit tests and load errors for slip removal
|
2009-05-10 17:03:41 -05:00 |
|
Slava Pestov
|
e55f0d17e5
|
compiler.tree.modular-arithmetic: convert >integer >fixnum into >fixnum
|
2009-05-07 12:54:23 -05:00 |
|
Slava Pestov
|
3c19ec1cbb
|
Fix overly-eager strength reduction for mod, and add a type function for >integer (reported by Joe Groff)
|
2009-05-07 12:32:06 -05:00 |