. . , , , .
, , - , . , , (, - 1000 ) .
, .
.
, .
- , .
() (I/O).
- .
To find them, I think fetching a stopwatch on the stack is the best way. There is no need to be an efficient process for this, and a fairly small number of samples work just as well (or better) than a large number of samples. This must be done many times, because any given program, as written at the beginning, does not contain only one possibility for acceleration. It contains several.
Here is an example.
source
share