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

test/mjsunit/es6/tail-call-megatest.js

 // Copyright 2016 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.
 
 // Flags: --allow-natives-syntax --harmony-tailcalls
 
 
 Error.prepareStackTrace = (error,stack) => {
   error.strace = stack;
   return error.message + "\n    at " + stack.join("\n    at ");
 }
 
 var verbose = typeof(arguments) !== "undefined" && arguments.indexOf("-v") >= 0;
 
 function checkStackTrace(expected) {
   var e = new Error();
   e.stack;  // prepare stack trace
   var stack = e.strace;
   assertEquals("checkStackTrace", stack[0].getFunctionName());
   for (var i = 0; i < expected.length; i++) {
     assertEquals(expected[i].name, stack[i + 1].getFunctionName());
   }
 }
 
 
 var CAN_INLINE_COMMENT  = "// Let it be inlined.";
 var DONT_INLINE_COMMENT = (function() {
-  var line = "1";
-  for (var i = 0; i < 200; ++i) {
-    line += "," + i;
+  var line = "// Don't inline. Don't inline. Don't inline. Don't inline.";
+  for (var i = 0; i < 4; i++) {
+    line += "\n  " + line;
   }
-  line += ";\n";
   return line;
 })();
 
 
 function ident_source(source, ident) {
   ident = " ".repeat(ident);
   return ident + source.replace(/\n/gi, "\n" + ident);
 }
 
 var SHARDS_COUNT = 10;
@@ skipping 371 matching lines @@
       });
     });
   });
   if (verbose) {
     print("Number of tests executed: " + tests_executed);
   }
 }
 
 // Uncomment to run all the tests at once or use shard runners.
 //run_tests();