Lines Matching full:candidate
1194 // the loop breaks once the function is enqueued as a candidate.
1202 // the function is enqueued as a candidate.
1207 // Simulate one final GC to make sure the candidate queue is sane.
1276 // Simulate one final GC to make sure the candidate queue is sane.
1325 // code flushing candidate.
1343 // Simulate one final GC to make sure the candidate queue is sane.
2032 // Make sure next prototype is placed on an old-space evacuation candidate.
2041 // Add a prototype on an evacuation candidate and verify that transition
3052 // that will later be selected as an evacuation candidate.
3072 // chosen as an evacuation candidate.
3254 // represent the dangling tail of the candidate list.
3390 // Ensure the code ends up on an evacuation candidate.
3417 // candidate for code flushing. The shared function info however will not be
3421 // Now optimize the function so that it is taken off the candidate list.
3446 // Ensure the code ends up on an evacuation candidate.
3473 // candidate for code flushing. The shared function info however will not be
