This website requires JavaScript.
Explore
Help
Sign In
steve
/
factor
Watch
1
Star
0
Fork
You've already forked factor
0
Code
Issues
Pull Requests
Releases
Wiki
Activity
f8405e9c55
factor
/
basis
/
compiler
/
tree
/
cleanup
History
Slava Pestov
8a9c15ab0b
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
..
cleanup-tests.factor
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
cleanup.factor
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
summary.txt
Add summary for heaps more vocabs
2009-02-16 21:05:13 -06:00