I have been experimenting with -fsplit-stack, in particular related to
performance issues I have read about in rust and go relative to a "hot
split" where a function call in a tight loop continuously crosses a
split. Originally I was interested as an analogy to approximate
performance issues with o
f you test a
> code change and get a 4% improvement, is your code really better code,
> or did you just get lucky? Maybe your code change slows things down
> by 1% but happens to avoid a hot split.
>
> On Sat, Sep 12, 2015 at 11:38 PM, Anders Oleson wrote:
>> I have been
ty impossible to do for C/C++. Presumably Go doesn't have these
constructs.
-- Anders
On Sun, Sep 13, 2015 at 11:49 AM, Ian Lance Taylor wrote:
> On Sat, Sep 12, 2015 at 11:38 PM, Anders Oleson wrote:
>>
>> From examining the __morestack code, I found that the sigprocmask
>> s
...
>> Summary:
>> prolog overhead, no call to __morestack : < 1 clock
>> stock call to __morestack (hot): > 4000 clocks
>> without signal blocking: < 60 clocks
>> potential best case: < 6 clocks
>
> This sounds great.
The data structure I was experimenting with ended up to be not very
dif
