Displaying 6 results from an estimated 6 matches for "availin".
Did you mean:
avail_in
2009 Mar 12
4
[LLVMdev] Shrink Wrapping - RFC and initial implementation
...o_iterator<MachineBasicBlock*>
+ MBBI = po_begin(Fn.getBlockNumbered(0)),
+ MBBE = po_end(Fn.getBlockNumbered(0)); MBBI != MBBE; +
+MBBI) {
This seem to be doing traversal at least one too many times? Can this
be improved?
11. Can you explain a bit more about AnticIn, AvailIn, etc.?
12.
Let's worry about edge splitting for a later time. :-)
13. After the code is cleaned up, we should consider checking it in
and try it out as llcbeta. Do you have any idea of its compile time
impact?
Thanks,
Evan
On Mar 4, 2009, at 7:57 PM, John Mosby wrote:
> Here is an...
2009 Mar 13
0
[LLVMdev] Shrink Wrapping - RFC and initial implementation
...to finish shrink wrapping.
I will return to that work and see if I can reduce the traversals, which for
this approach (computing Antic, Avail) will decrease the constant factor in
the runtime bound, which is linear in the size of the Machine IR.
> 11. Can you explain a bit more about AnticIn, AvailIn, etc.?
>
I am working on a document, currently hosted at github, which will present
the details of the implementation, examples, etc.
I looked at two approaches to determine spill/restore placements:
1. Try to use live intervals of CSRs that might be available when PEI runs.
The idea here...
2009 Mar 05
0
[LLVMdev] Shrink Wrapping - RFC and initial implementation
Here is an updated patch for shrink wrapping with:
- spills/restores done with stack slot stores/loads
- stack adjustment removed
- refactoring (but still in need of more)
- spill/restore insertion code unified with spill/restore placement code
Documentation available
here<http://wiki.github.com/jdmdj/llvm-work/shrink-wrapping-work>
illustrates shrink
wrapping with loops and discusses a
2009 Mar 03
2
[LLVMdev] Shrink Wrapping - RFC and initial implementation
On Mon, Mar 2, 2009 at 10:35 AM, Evan Cheng <echeng at apple.com> wrote:
>
> On Mar 1, 2009, at 2:57 PM, John Mosby wrote:
>
> Obviously, all of this applies only when spills are done with push/pop,
> which is the case on x86. I used this issue to start looking at generalizing
> how spills and restores are handled, before looking too closely at other
> targets, and
2009 Mar 18
1
[LLVMdev] Shrink Wrapping - RFC and initial implementation
...gt; I will return to that work and see if I can reduce the traversals,
> which for this approach (computing Antic, Avail) will decrease the
> constant factor in the runtime bound, which is linear in the size of
> the Machine IR.
>
> 11. Can you explain a bit more about AnticIn, AvailIn, etc.?
>
> I am working on a document, currently hosted at github, which will
> present the details of the implementation, examples, etc.
>
> I looked at two approaches to determine spill/restore placements:
>
> 1. Try to use live intervals of CSRs that might be available whe...
2009 Mar 18
1
[LLVMdev] Shrink Wrapping - RFC and initial implementation
...; I will return to that work and see if I can reduce the traversals, which for
> this approach (computing Antic, Avail) will decrease the constant factor in
> the runtime bound, which is linear in the size of the Machine IR.
>
>>
>> 11. Can you explain a bit more about AnticIn, AvailIn, etc.?
>
> I am working on a document, currently hosted at github, which will present
> the details of the implementation, examples, etc.
> I looked at two approaches to determine spill/restore placements:
> 1. Try to use live intervals of CSRs that might be available when PEI runs....