5 ms·
Catching the runtime of a function that's executed very infrequently for example and has execution time extremely dependent on the context. (Which makes an isol
by viraptor 9y ago
Catching the runtime of a function that's executed very infrequently for example and has execution time extremely dependent on the context. (Which makes an isolated reproducer hard to achieve)
Or finding out about a tiny function which is called thousands of times and adds up over time, but each execution is so fast you rarely ever see it on a sample profile.
- sciurus 9y agoIf that fast function is called enough to "add up", it should show up in the statistical profiler's samples. The likelihood of a function being sampled is influenced by the cumulative run time of all its calls, not the run time of an individual call.
- MaulingMonkey 9y ago> If that fast function is called enough to "add up", it should show up in the statistical profiler's samples. This can be messed with in a bunch of ways - aggressive inlining, being further subdivided because it's a template...
- sciurus 9y agoOh, sure, you may be right about that for other languages. I was thinking in the context of the post, which discusses Ruby and Python.