| Age | Commit message (Collapse) | Author |
|---|
|
|
|
The IR generated by calls was very bulky because two
instructions were used for marking the live range of
a clobber.
This patch attempts to store the information of what
registers are use/def/clobber in the call instruction
itself, this leads to more compact code (even more
when we'll have SSE registers). However, I find that
the amount of extra code needed is not really
easonable. Fortunately it is not too invasive, thus
if the complexity creeps in, it should be easy to
revert.
|
|
|
|
|
|
|
|
|
|
|
|
I add the dual to dummy uses: dummy defs. They
are compiled to nothing, but help preserving the
invariants I had when writing the register
allocator.
Clearly, there should be a better way.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The parser now has some code to parse the description
of structured types.
I tried to be even less specific than LLVM "type" by
creating just enough abstraction so that I can deal
with both AARCH64 and x64. The base types used in the
definition of an aggregate are really just syntactic sugar
to give a structure a size and an alignment. Only the
location of float components matters for the compilation.
In particular this means that the front-ends have to know
how the ABI works to pass/return small integer types.
This also means that the font-end has to be aware of the
layout of structures.
Chris Lattner has a proposition [1] for LLVM that is still
pending and goes in the direction of giving more control
of the ABI the front-end.
[1]: http://www.nondot.org/sabre/LLVMNotes/ExtendedIntegerResults.txt
|
|
|
|
|
|
|
|
This test also exposes a loose handling of clobbers,
I think it should be possible to compile it without
spilling.
|
|
|
|
|
|
|
|
Before, they designated the width of the comparison
result, but now, it specifies the size of the arguments.
|
|
|
|
|
|
|
|
|
|
It could be that the destination of the copy is
a spill location, so we have to check the type
of i.to first.
|
|
revert commit d0e9e3ada106dfe8dcda7a0099b341000f00afb2.
|
|
|
|
|
|
|
|
|
|
I could never figure out a correct version
without the tests. I'm now fairly confident
dopm() will work as we need it to.
|
|
|
|
|
|
|
|
|
|
The old code was broken for sure, this one might
be. I have to create a test bench for the dopm
function. It would also test the parallel move
lowering (pmgen and folks).
|
|
|
|
The first one was not so bad, when we a parallel move
clobbers one machine register in use, we used to
free the temporary t* using it, mark the register as
unavailable and allocate a new location for the
t*. But this fails when all the registers are in use.
In that case, the destination of the move must be in
a register r1, so I require a swap of the register
to copy (used by t*) with r1 and update the map
accordingly.
I would like to move all the above logic in a function
dealing with clobbers in general.
The second bug is in the parallel move compiler, this
one was a little more nasty and could have caused much
debugging pain. It would be reasonable to test it in
a similar way that I did for the slota() allocator.
|
|
|
|
|
|
|
|
|
|
It would be nicer to have some kind of subtyping where a
l variable can be used in place of a w variable but it is
more complications than a truncation insutruction.
In some cases, it might be less efficient than the above
solution by requiring two registers instead of one.
(I.e when both the truncated variable and the long variable
live together.)
We have to see what are the usage patterns.
|
|
An invariant is that all registers allocated at some point
have a hint. This makes the code removed by this commit
dead because of the if condition testing for empty hints.
|
