Daniel Ehrenberg
|
0f0571e48a
|
Moving new-sets to sets
|
2010-02-26 16:01:01 -05:00 |
Doug Coleman
|
b5fd809209
|
memq? -> member-eq?, sorted-memq? -> sorted-member-eq?
|
2009-10-28 15:02:00 -05:00 |
Slava Pestov
|
0bfbcd2108
|
compiler.tree.modular-arithmetic: fix regression; set-alien-*-1 was not always open-coded
|
2009-08-20 17:56:49 -05:00 |
Slava Pestov
|
78f8d02ed4
|
compiler.tree.modular-arithmetic: eliminate >bignum calls where possible, convert fixnum-shift to fixnum-shift-fast if shift count is positive, don't run if there are no modular values
|
2009-08-20 03:47:45 -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 |
|
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
|
e55f0d17e5
|
compiler.tree.modular-arithmetic: convert >integer >fixnum into >fixnum
|
2009-05-07 12:54:23 -05:00 |
|
Slava Pestov
|
1aefde994f
|
Cleanup
|
2008-11-03 00:03:22 -06:00 |
|
Slava Pestov
|
10c68ebb21
|
New modular arithmetic optimization pass
|
2008-09-12 18:08:38 -05:00 |