Doug Coleman
|
e189954ecc
|
core: Rename iota to <iota> so we can have TUPLE: iota ... ; instead of TUPLE: iota-tuple ... ;
|
2017-06-02 11:57:05 -05:00 |
Björn Lindqvist
|
c640e3b8c1
|
compiler.cfg.*: changing height-state from a 2-el array to a tuple
This way, it is a little easier to see what is going on in the local
analysis phase.
|
2016-09-08 04:01:25 +02:00 |
|
Björn Lindqvist
|
2edda80b5e
|
compiler.cfg.*: removing the adjust-d word
inc-stack can be used in emit-call-block if we check if the block is a
kill block in end-local-analysis
|
2016-09-05 12:12:01 +02:00 |
|
Björn Lindqvist
|
ee5c28f470
|
compiler.cfg.stacks.*: removing the adjust word which wasn't useful
|
2016-09-05 10:37:29 +02:00 |
|
Björn Lindqvist
|
6c88577ee7
|
compiler.cfg.*: replacing the peek/replace/kill-sets with slots
So instead of storing the info in variables, it is stored in slots on
the basic-block tuple which is much nicer.
|
2016-08-29 12:07:47 +02:00 |
|
Björn Lindqvist
|
e8e1811542
|
compiler.cfg.stacks.height: removing vocab
It was so small so better to put the words it contained in the vocabs
where they are used.
|
2016-08-26 11:06:17 +02:00 |
|
Björn Lindqvist
|
30451ebf5a
|
compiler.cfg.*: new slots ds-height and rs-height
They are used when recording the blocks stacks height instead of the
ds-heights and rs-heights variables. It makes the code a bit simpler.
|
2016-05-03 01:16:50 +02:00 |
|
Björn Lindqvist
|
3a9b297b3b
|
compiler.cfg.*: better stack effect for end-stack-analysis
|
2016-03-16 10:53:33 +01:00 |
|
Doug Coleman
|
ce046b77c8
|
compiler: rename D to D: because it wants a token. Same for R -> R:
|
2015-08-13 15:23:10 -07:00 |
|
Björn Lindqvist
|
a195e361df
|
compiler.cfg.stacks.*: create-locs, word for creating stack locations
from a sequence
|
2015-05-09 20:04:21 -07:00 |
|
Björn Lindqvist
|
6559382028
|
compiler.cfg.*: ds-load removed
|
2015-04-29 09:31:55 -07:00 |
|
Björn Lindqvist
|
cc1903bec1
|
compiler.cfg.*: some refactoring in the stack tracking for #shuffle nodes
instead of having separate words for the stacks like inc-d/r and ds/rs-store use generic words that work on either stack
|
2015-04-29 09:31:55 -07:00 |
|
Björn Lindqvist
|
ba4736ff75
|
compiler.cfg.stacks.local: change current-height to a two-tuple { { d emit-d } { r emit-r } } it makes the code a bit simpler
|
2015-04-29 09:31:54 -07:00 |
|
Björn Lindqvist
|
c360f0123b
|
compiler.cfg.stacks: a few unused words removed
|
2015-04-29 09:31:54 -07:00 |
|
Björn Lindqvist
|
0432b17409
|
compiler.cfg.*: refactoring away the compute-global-sets word
|
2014-12-31 03:37:16 +01:00 |
John Benediktsson
|
c65877104e
|
compiler: cleanup usings.
|
2014-12-13 16:10:21 -08:00 |
|
John Benediktsson
|
068ddd6c7b
|
compiler: cleanup cfg passes to have stack effect ( cfg -- )
|
2014-12-11 12:48:43 -08:00 |
Slava Pestov
|
82fb1879af
|
Debugging untagged fixnums
|
2010-05-03 17:34:02 -04:00 |
|
Slava Pestov
|
df4fb4a3ee
|
Removing integers-as-sequences
|
2010-01-15 07:15:33 +13:00 |
|
Slava Pestov
|
0612bc6177
|
Factor source files should not be executable
|
2009-11-21 17:50:43 -06:00 |
|
Slava Pestov
|
d0c393aa60
|
compiler.cfg: new system to track when results of analyses need to be recomputed (reverse post order, linear order, predecessors, dominance, loops). Passes can now call needs-predecessors, needs-dominance, needs-loops at the beginning, and cfg-changed, predecessors-changd at the end. Linearization order now takes loop nesting into account, and linear scan now uses linearization order instead of RPO.
|
2009-08-08 20:02:56 -05:00 |
|
Slava Pestov
|
2d719534cf
|
compiler.cfg.stacks: kill set now includes all locations eliminated as a result of stack height decrease; reduces number of ##replace instructions generated by 2%
|
2009-08-01 06:12:43 -05:00 |
Slava Pestov
|
7590ad3574
|
compiler.cfg: introduce less temporaries when building CFG
|
2009-07-24 03:37:18 -05:00 |
|
Slava Pestov
|
d947c61bd7
|
compiler.cfg.stacks: now performs online local DCN
|
2009-07-23 20:54:38 -05:00 |
|
Slava Pestov
|
26f309d2ae
|
Trying to make PEGs compile faster by reducing the number of low level IR nodes: merge functionality of #>r and #r> into #shuffle, and generate 1 node instead of 3 for calls to get-local
|
2008-11-11 18:46:31 -06:00 |
|
Slava Pestov
|
94a2bfa2ea
|
Working on comparison operations, clearing out remaining dead wood
|
2008-10-21 03:20:48 -05:00 |
|
Slava Pestov
|
e92f795a76
|
More work on intrinsics; memory allocation and slot access now expands correctly
|
2008-10-20 20:40:15 -05:00 |
|
Slava Pestov
|
f092622fac
|
CFG IR is now pure SSA
|
2008-10-20 01:56:28 -05:00 |
|
Slava Pestov
|
239578353f
|
Simplifying vregs work in progress
|
2008-10-17 15:35:04 -05:00 |
|
Slava Pestov
|
68c9b22cef
|
Don't need known-tag templates any more
|
2008-10-11 14:08:00 -05:00 |
|
Slava Pestov
|
f979ae5b82
|
Expand slot accessors further to avoid having to use complex template decision
|
2008-10-11 14:05:15 -05:00 |
|
Slava Pestov
|
cf46a832e7
|
Debugging register allocator and inline allocation
|
2008-10-08 23:42:53 -05:00 |
|
Slava Pestov
|
0e4e05d5cd
|
Debugging new codegen
|
2008-10-08 03:51:44 -05:00 |
|
Slava Pestov
|
7b6d9c4c4f
|
Debugging new codegen
|
2008-10-07 20:00:38 -05:00 |
|
Slava Pestov
|
f436fd0c0f
|
Merging in new codegen
|
2008-10-07 16:16:50 -05:00 |