[turbofan] Greedy: faster compile time.

src/compiler/greedy-allocator.h

 // Copyright 2015 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #ifndef V8_GREEDY_ALLOCATOR_H_
 #define V8_GREEDY_ALLOCATOR_H_
 
 #include "src/compiler/coalesced-live-ranges.h"
 #include "src/compiler/register-allocator.h"
 #include "src/zone-containers.h"
@@ skipping 130 matching lines @@
   }
 
   // Calculate the weight of a candidate for allocation.
   void EnsureValidRangeWeight(LiveRange* range);
 
   // Calculate the new weight of a range that is about to be allocated.
   float GetAllocatedRangeWeight(float candidate_weight);
 
   // Returns kInvalidWeight if there are no conflicts, or the largest weight of
   // a range conflicting with the given range, at the given register.
-  float GetMaximumConflictingWeight(unsigned reg_id,
-                                    const LiveRange* range) const;
+  float GetMaximumConflictingWeight(unsigned reg_id, const LiveRange* range,
+                                    float competing_weight) const;
 
   // Returns kInvalidWeight if there are no conflicts, or the largest weight of
   // a range conflicting with the given range, at the given register.
   float GetMaximumConflictingWeight(unsigned reg_id,
                                     const LiveRangeGroup* group,
                                     float group_weight) const;
 
   // This is the extension point for splitting heuristics.
   void SplitOrSpillBlockedRange(LiveRange* range);
 
@@ skipping 25 matching lines @@
   ZoneVector<CoalescedLiveRanges*> allocations_;
   AllocationScheduler scheduler_;
   ZoneVector<LiveRangeGroup*> groups_;
 
   DISALLOW_COPY_AND_ASSIGN(GreedyAllocator);
 };
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
 #endif  // V8_GREEDY_ALLOCATOR_H_