Lines Matching defs:attempt
34 // every graph coloring attempt so that eventually the interference graph will be sparse enough
414 // A ColoringIteration holds the many data structures needed for a single graph coloring attempt,
415 // and provides methods for each phase of the attempt.
453 // split, and the interference graph should be rebuilt for another attempt.
506 // An arena allocator used for a single graph coloring attempt.
611 size_t attempt = 0;
613 ++attempt;
614 DCHECK(attempt <= kMaxGraphColoringAttemptsDebug)
621 // total memory usage by using a new arena allocator for each attempt.
640 if (iterative_move_coalescing_ && attempt <= kMaxGraphColoringAttemptsDebug) {
