On 12/12/19 11:38 AM, Segher Boessenkool wrote:
On Thu, Dec 12, 2019 at 10:21:03AM -0500, Nicholas Krause wrote:
On 12/12/19 4:11 AM, Segher Boessenkool wrote:
On Sun, Dec 08, 2019 at 03:03:56PM -0500, Nicholas Krause wrote:
The first questions are:
1. What current heuristics do we have as
On Thu, Dec 12, 2019 at 10:21:03AM -0500, Nicholas Krause wrote:
> On 12/12/19 4:11 AM, Segher Boessenkool wrote:
> >On Sun, Dec 08, 2019 at 03:03:56PM -0500, Nicholas Krause wrote:
> >>The first questions are:
> >>1. What current heuristics do we have as it seems none for figuring out
> >>what sta
On 12/12/19 4:11 AM, Segher Boessenkool wrote:
Hi Nick,
On Sun, Dec 08, 2019 at 03:03:56PM -0500, Nicholas Krause wrote:
The first questions are:
1. What current heuristics do we have as it seems none for figuring out
what state is shared
as it seems none? If I correct the first thing to do
Hi Nick,
On Sun, Dec 08, 2019 at 03:03:56PM -0500, Nicholas Krause wrote:
> The first questions are:
> 1. What current heuristics do we have as it seems none for figuring out
> what state is shared
> as it seems none? If I correct the first thing to do is discuss what
> bits/bitmasks we want
> f
Greetings Segher and Peter,
After looking through the code and thinking about it seems that the best
way forward
is to rewrite most of the passes in GIMPLE or RTL to hook into a async
work queue
framework to launch it if the state is not shared. This will scale much
better than
the current ver
