4 ms·
Even with a simple heuristic, wouldn't you try to pick this magic number 600 so that it's about as likely to be too big as too small? Or is the problem very as
by improbable22 8y ago
Even with a simple heuristic, wouldn't you try to pick this magic number 600 so that it's about as likely to be too big as too small?
Or is the problem very asymmetric, that inlining too-large pieces has dramatic downsides that failing to inline small pieces does not? Or is it just that the magic number was chosen decades ago, and the tradeoffs (perhaps re memory) are different now?
- chrisseaton 8y ago> wouldn't you try to pick this magic number 600... I guess ideally you'd run a sophisticated machine learning algorithm across a huge corpus of real-world code, on real-world devices to discover the right number... but in reality people just don't have time for that so they pick a number and move on. Can't really blame them.
- improbable22 8y agoI had a binary search in mind, if that counts as sophisticated :) Just surprised by orig GGP's assertion that more inlining would automatically be faster.