John Benediktsson
|
f419934d6a
|
Cleanup lint warnings.
|
2011-10-14 11:47:24 -07:00 |
Slava Pestov
|
1898d0e26e
|
compiler.tree.identities: the identity on mod was useless too, because we already have a rewrite rule which handles this case in compiler.tree.propagation
|
2011-10-10 12:34:21 -07:00 |
Doug Coleman
|
7d8817583a
|
compiler.tree.modular-arithmetic needs shallow-spread>quot
|
2011-10-02 22:21:11 -07:00 |
Joe Groff
|
571ef865e6
|
slots: pre-create the "at", "nth", and "global" slots to make deterministic the currently nondeterministic ambiguity between accessors:change-* and assocs:change-at, sequences:change-nth, and namespaces:change-global
|
2011-09-19 10:03:43 -07:00 |
Daniel Ehrenberg
|
ac15409baa
|
Fixing typo in modular arithmetic unit test (should use iota, not integer sequences, and just happened to work still)
|
2010-06-15 16:15:49 -04:00 |
|
Daniel Ehrenberg
|
0f0571e48a
|
Moving new-sets to sets
|
2010-02-26 16:01:01 -05:00 |
Slava Pestov
|
880fb747fc
|
Removing integers-as-sequences
|
2010-01-15 07:15:33 +13: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 |
|
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
|
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
|
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
|
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
|
6b25e99470
|
Add summary for heaps more vocabs
|
2009-02-16 21:05:13 -06:00 |
|
Slava Pestov
|
5fdb474c76
|
Fixing various test failures and updating some more vocabs for >r/r> removal
|
2008-12-17 22:29:32 -06:00 |
|
Slava Pestov
|
34792a9f23
|
Remove >r/r>
|
2008-12-17 19:17:37 -06: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 |