Displaying 6 results from an estimated 6 matches similar to: "[LLVMdev] RegAllocFast assertion in trunk..."
2011 Jul 11
0
[LLVMdev] RegAllocFast uses too much stack
On Jul 11, 2011, at 3:06 PM, Eli Friedman wrote:
> On Mon, Jul 11, 2011 at 2:44 PM, Eric Christopher <echristo at apple.com> wrote:
>>
>> On Jul 11, 2011, at 1:48 PM, Nick Lewycky wrote:
>>
>> This seems odd. I'd think that fast-isel should be able to materialize the constants when we want them rather than at the beginning of the block.
>
> I'm
2011 Jul 11
2
[LLVMdev] RegAllocFast uses too much stack
On Jul 11, 2011, at 3:41 PM, Dan Gohman wrote:
> On Jul 11, 2011, at 3:06 PM, Eli Friedman wrote:
>
>> On Mon, Jul 11, 2011 at 2:44 PM, Eric Christopher <echristo at apple.com> wrote:
>>>
>>> On Jul 11, 2011, at 1:48 PM, Nick Lewycky wrote:
>>>
>>> This seems odd. I'd think that fast-isel should be able to materialize the constants when
2011 Jul 11
0
[LLVMdev] RegAllocFast uses too much stack
On Jul 11, 2011, at 3:43 PM, Eric Christopher wrote:
>
> On Jul 11, 2011, at 3:41 PM, Dan Gohman wrote:
>
>> On Jul 11, 2011, at 3:06 PM, Eli Friedman wrote:
>>
>>> On Mon, Jul 11, 2011 at 2:44 PM, Eric Christopher <echristo at apple.com> wrote:
>>>>
>>>> On Jul 11, 2011, at 1:48 PM, Nick Lewycky wrote:
>>>>
2011 Jul 11
0
[LLVMdev] RegAllocFast uses too much stack
On Jul 11, 2011, at 1:48 PM, Nick Lewycky wrote:
> I discovered recently that RegAllocFast spills all the registers before every function call. This is the root cause of one of our recursive functions that takes about 150 bytes of stack when built with gcc (same at -O0 and -O2, or 120 bytes at llc -O2) taking 960 bytes of stack when built by llc -O0. That's pretty bad for situations where
2011 Jul 11
3
[LLVMdev] RegAllocFast uses too much stack
On Mon, Jul 11, 2011 at 2:44 PM, Eric Christopher <echristo at apple.com> wrote:
>
> On Jul 11, 2011, at 1:48 PM, Nick Lewycky wrote:
>
>> I discovered recently that RegAllocFast spills all the registers before every function call. This is the root cause of one of our recursive functions that takes about 150 bytes of stack when built with gcc (same at -O0 and -O2, or 120 bytes
2011 Jul 11
4
[LLVMdev] RegAllocFast uses too much stack
I discovered recently that RegAllocFast spills all the registers before
every function call. This is the root cause of one of our recursive
functions that takes about 150 bytes of stack when built with gcc (same at
-O0 and -O2, or 120 bytes at llc -O2) taking 960 bytes of stack when built
by llc -O0. That's pretty bad for situations where you have small stacks,
which is not uncommon for