On Sat, 20 Oct 2018, Richard Sandiford wrote:
> Richard Biener writes:
> > On Fri, 19 Oct 2018, Richard Sandiford wrote:
> >
> >> Richard Biener writes:
> >> > On October 18, 2018 11:05:32 PM GMT+02:00, Richard Sandiford
> >> > wrote:
> >> >>During recent stage3s I've tried to look at profiles
Richard Biener writes:
> On Fri, 19 Oct 2018, Richard Sandiford wrote:
>
>> Richard Biener writes:
>> > On October 18, 2018 11:05:32 PM GMT+02:00, Richard Sandiford
>> > wrote:
>> >>During recent stage3s I've tried to look at profiles of cc1plus
>> >>to see whether there was something easy we co
On Fri, 19 Oct 2018, Richard Biener wrote:
> On Fri, 19 Oct 2018, Richard Sandiford wrote:
>
> > Richard Biener writes:
> > > On October 18, 2018 11:05:32 PM GMT+02:00, Richard Sandiford
> > > wrote:
> > >>Richard Biener writes:
> > >>> On Thu, 18 Oct 2018, Richard Sandiford wrote:
> > Wh
On Thu, 18 Oct 2018, David Malcolm wrote:
> On Thu, 2018-10-18 at 15:09 +0200, Richard Biener wrote:
> > PR63155 made me pick up this old work from Steven, it turns our
> > linked-list implementation to a two-mode one with one being a
> > splay tree featuring O(log N) complexity for find/remove.
>
On Fri, 19 Oct 2018, Richard Sandiford wrote:
> Richard Biener writes:
> > On October 18, 2018 11:05:32 PM GMT+02:00, Richard Sandiford
> > wrote:
> >>Richard Biener writes:
> >>> On Thu, 18 Oct 2018, Richard Sandiford wrote:
> >>>
> Richard Biener writes:
> > PR63155 made me pick up
On Fri, 19 Oct 2018, Steven Bosscher wrote:
> On Fri, Oct 19, 2018 at 8:46 AM Richard Biener <> wrote:
> > Yeah. I also noticed some 'obvious' shortcomings in the heuristics...
> > I guess in the end well predicted branches in the out of line code are
> > important...
I specifically meant the fa
On Fri, Oct 19, 2018 at 8:46 AM Richard Biener <> wrote:
> Yeah. I also noticed some 'obvious' shortcomings in the heuristics...
> I guess in the end well predicted branches in the out of line code are
> important...
What also would help is to put bitmaps on their own obstack to improve
cache loc
Richard Biener writes:
> On October 18, 2018 11:05:32 PM GMT+02:00, Richard Sandiford
> wrote:
>>Richard Biener writes:
>>> On Thu, 18 Oct 2018, Richard Sandiford wrote:
>>>
Richard Biener writes:
> PR63155 made me pick up this old work from Steven, it turns our
> linked-list imp
On October 18, 2018 11:05:32 PM GMT+02:00, Richard Sandiford
wrote:
>Richard Biener writes:
>> On Thu, 18 Oct 2018, Richard Sandiford wrote:
>>
>>> Richard Biener writes:
>>> > PR63155 made me pick up this old work from Steven, it turns our
>>> > linked-list implementation to a two-mode one wit
Richard Biener writes:
> On Thu, 18 Oct 2018, Richard Sandiford wrote:
>
>> Richard Biener writes:
>> > PR63155 made me pick up this old work from Steven, it turns our
>> > linked-list implementation to a two-mode one with one being a
>> > splay tree featuring O(log N) complexity for find/remove.
On 10/18/18 7:09 AM, Richard Biener wrote:
>
> PR63155 made me pick up this old work from Steven, it turns our
> linked-list implementation to a two-mode one with one being a
> splay tree featuring O(log N) complexity for find/remove.
>
> Over Stevens original patch I added a bitmap_tree_to_vec h
On Thu, 2018-10-18 at 15:09 +0200, Richard Biener wrote:
> PR63155 made me pick up this old work from Steven, it turns our
> linked-list implementation to a two-mode one with one being a
> splay tree featuring O(log N) complexity for find/remove.
>
> Over Stevens original patch I added a bitmap_tr
On Thu, 18 Oct 2018, Richard Sandiford wrote:
> Richard Biener writes:
> > PR63155 made me pick up this old work from Steven, it turns our
> > linked-list implementation to a two-mode one with one being a
> > splay tree featuring O(log N) complexity for find/remove.
> >
> > Over Stevens original
Richard Biener writes:
> PR63155 made me pick up this old work from Steven, it turns our
> linked-list implementation to a two-mode one with one being a
> splay tree featuring O(log N) complexity for find/remove.
>
> Over Stevens original patch I added a bitmap_tree_to_vec helper
> that I use from
PR63155 made me pick up this old work from Steven, it turns our
linked-list implementation to a two-mode one with one being a
splay tree featuring O(log N) complexity for find/remove.
Over Stevens original patch I added a bitmap_tree_to_vec helper
that I use from the debug/print methods to avoid
15 matches
Mail list logo