[turbofan] Don't take into account source size for inlining heuristics.

src/compiler/js-inlining-heuristic.cc

Index: src/compiler/js-inlining-heuristic.cc
diff --git a/src/compiler/js-inlining-heuristic.cc b/src/compiler/js-inlining-heuristic.cc
index e237af3e9f0db1c8f6f2bd95ee4878e3baae5f23..5c626d15c6efcb3f87baaa53bbcd258474385274 100644
--- a/src/compiler/js-inlining-heuristic.cc
+++ b/src/compiler/js-inlining-heuristic.cc
@@ -49,11 +49,6 @@ bool CanInlineFunction(Handle<JSFunction> function) {
   // Don't inline builtins.
   if (function->shared()->IsBuiltin()) return false;
 
-  // Quick check on source code length to avoid parsing large candidate.
-  if (function->shared()->SourceSize() > FLAG_max_inlined_source_size) {
-    return false;
-  }
-
   // Quick check on the size of the AST to avoid parsing large candidate.
   if (function->shared()->ast_node_count() > FLAG_max_inlined_nodes) {
     return false;
@@ -287,9 +282,7 @@ void JSInliningHeuristic::PrintCandidates() {
            candidate.node->op()->mnemonic(), candidate.frequency);
     for (int i = 0; i < candidate.num_functions; ++i) {
       Handle<JSFunction> function = candidate.functions[i];
-      PrintF("  - size[source]:%d, size[ast]:%d, name: %s\n",
-             function->shared()->SourceSize(),
-             function->shared()->ast_node_count(),
+      PrintF("  - size:%d, name: %s\n", function->shared()->ast_node_count(),
              function->shared()->DebugName()->ToCString().get());
     }
   }