RFR: Traveral GC heuristics

[Christine Flood]

Can we at least include a number of comments that we are using SATB
queues for convenience but this isn't using an SATB algorithm.
Otherwise future developers will curse us for misleading them.

Is there some way to come up with a common abstraction for partial gc
and traversal gc so we don't have to have all those duplicate timings?

You have the MWF flag, but I don't see the implementation.  You need
something in ShenandoahBarrierSet to see if the object being written
to was allocated after TAMS and if so, both the object and the field
need to be marked.

Christine



On Thu, Jan 18, 2018 at 8:20 AM, Roland Westrelin <rwestrel at redhat.com> wrote:
>
>>> Other C2:
>>>
>>>   *) Roland should take a look, but I find it uncomfortable to change do_unswitching,
>>> find_unswitching_candidate with new arguements...
>>
>> This was actually done by Roland to get the new barriers to work and
>> optimize well enough.
>
> C2 stuff is ok.
>
> Roland.