Fix JSInliningHeuristic::CandidateCompare predicate.

src/compiler/js-inlining-heuristic.cc

 // 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.
 
 #include "src/compiler/js-inlining-heuristic.h"
 
 #include "src/compiler.h"
 #include "src/compiler/node-matchers.h"
 #include "src/objects-inl.h"
 
@@ skipping 103 matching lines @@
         cumulative_count_ += candidate.function->shared()->ast_node_count();
         return;
       }
     }
   }
 }
 
 
 bool JSInliningHeuristic::CandidateCompare::operator()(
     const Candidate& left, const Candidate& right) const {
-  return left.node != right.node && left.calls >= right.calls;
+  if (left.calls != right.calls) {
+    return left.calls > right.calls;
+  }
+  return left.node < right.node;
 }
 
 
 void JSInliningHeuristic::PrintCandidates() {
   PrintF("Candidates for inlining (size=%zu):\n", candidates_.size());
   for (const Candidate& candidate : candidates_) {
     PrintF("  id:%d, calls:%d, size[source]:%d, size[ast]:%d / %s\n",
            candidate.node->id(), candidate.calls,
            candidate.function->shared()->SourceSize(),
            candidate.function->shared()->ast_node_count(),
            candidate.function->shared()->DebugName()->ToCString().get());
   }
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8