aboutsummaryrefslogtreecommitdiff
path: root/crates/ra_prof
Commit message (Collapse)AuthorAgeFilesLines
* Update versionsKirill Bulatov2020-02-181-4/+4
|
* Run cargo +nightly fix --clippy -Z unstable-optionsKirill Bulatov2020-02-181-1/+1
|
* Rename the binary to rust-analyzerAleksey Kladov2020-02-181-2/+2
|
* Replace ra_cli mentionsLaurențiu Nicola2020-02-171-2/+2
|
* Enable profiling for benchAleksey Kladov2020-02-161-0/+7
|
* Avoid premature pessimizationAleksey Kladov2020-02-021-32/+32
| | | | | | The extra allocation for message should not matter here at all, but using a static string is just as ergonomic, if not more, and there's no reason to write deliberately slow code
* Merge #2895bors[bot]2020-01-291-46/+71
|\ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 2895: Rewrite ra_prof's profile printing r=michalt a=michalt This changes the way we print things to first construct a mapping from events to the children and uses that mapping to actually print things. It should not change the actual output that we produce. The new approach two benefits: * It avoids a potential quadratic behavior of the previous approach. For instance, for a vector of N elements: ``` [Message{level: (N - 1)}, ..., Message{level: 1}, Message{level: 0}] ``` we would first do a linear scan to find entry with level 0, then another scan to find one with level 1, etc. * It makes it much easier to improve the output in the future, because we now pre-compute the children for each entry and can easily take that into account when printing. Signed-off-by: Michal Terepeta <[email protected]> Co-authored-by: Michal Terepeta <[email protected]>
| * A couple of small improvements to ra_prof printingMichal Terepeta2020-01-291-3/+3
| | | | | | | | | | | | Based on suggestions from @matklad. Signed-off-by: Michal Terepeta <[email protected]>
| * Rewrite ra_prof's profile printingMichal Terepeta2020-01-221-46/+71
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | This changes the way we print things to first construct a mapping from events to the children and uses that mapping to actually print things. It should not change the actual output that we produce. The new approach two benefits: * It avoids a potential quadratic behavior of the previous approach. For instance, for a vector of N elements: ``` [Message{level: (N - 1)}, ..., Message{level: 1}, Message{level: 0}] ``` we would first do a linear scan to find entry with level 0, then another scan to find one with level 1, etc. * It makes it much easier to improve the output in the future, because we now pre-compute the children for each entry and can easily take that into account when printing. Signed-off-by: Michal Terepeta <[email protected]>
* | Add print_time helperAleksey Kladov2020-01-251-0/+15
|/
* Fix a corner case when printing unaccounted timeMichal Terepeta2020-01-191-4/+52
| | | | | | | | | | | | | | | | | | | | | | Previously `ra_prof` wouldn't actually print the unaccounted time in some cases. We would print, for instance, this: ``` 5ms - foo 2ms - bar ``` instead of: ``` 5ms - foo 2ms - bar 3ms - ??? ``` The fix is to properly handle the case when an entry has 0 children instead of using the `last` variable. Signed-off-by: Michal Terepeta <[email protected]>
* Improve profiling output when duration filter is specifiedMichal Terepeta2020-01-021-4/+25
| | | | | | | | | | | | | | | In particular: - Use strict inequality for comparisons, since that's what the filter syntax supports. - Convert to millis for comparisons, since that's the unit used both for the filter and when printing. Now something like `RA_PROFILE='*>0'` will only print things that took at least 1ms (when rounded to millis). Signed-off-by: Michal Terepeta <[email protected]>
* More compact profiling displayAleksey Kladov2019-12-221-4/+4
|
* Disable doctestsAleksey Kladov2019-11-171-0/+3
|
* Renormalize line endingskjeremy2019-11-151-19/+19
|
* Even if jemalloc feature is used do not use it on msvckjeremy2019-11-143-20/+22
| | | | Fixes #2233
* show unaccounted for time in profilingAleksey Kladov2019-10-241-3/+20
|
* Added test for check doc strings in crates.Alexander Andreev2019-09-302-0/+4
| | | | #1856
* :arrow_up: once_cellAleksey Kladov2019-09-011-1/+1
|
* Remove cpuprofile dependenciesAleksey Kladov2019-08-173-12/+62
|
* jemallocator 0.3Jeremy A. Kolb2019-07-172-5/+5
|
* Added extract path attribute for current moduleAlexander Andreev2019-07-061-1/+1
| | | | #1211
* allow rustfmt to reorder importsAleksey Kladov2019-07-041-6/+9
| | | | | | This wasn't a right decision in the first place, the feature flag was broken in the last rustfmt release, and syntax highlighting of imports is more important anyway
* print memory usage for queriesAleksey Kladov2019-06-301-9/+18
|
* Move memory usage statistics to ra_profAleksey Kladov2019-06-303-0/+72
|
* add cpuprofile to ra_profAleksey Kladov2019-06-262-0/+34
| | | | | | | | | Now, one can use `let _p = ra_prof::cpu_profiler()` to capture profile of a block of code. This is not an out of the box experience, as that relies on gperfools See the docs on https://github.com/AtheMathmo/cpuprofiler for more!
* fix debug scopesAleksey Kladov2019-06-041-4/+4
|
* add couple of debug utilsAleksey Kladov2019-06-032-0/+31
|
* apply profile filter to top-level entries onlyAleksey Kladov2019-06-011-7/+6
|
* better profiligAleksey Kladov2019-05-212-8/+28
|
* profile type inferenceAleksey Kladov2019-05-211-0/+1
|
* switch to once_cell from lazy_staticAleksey Kladov2019-05-072-15/+14
|
* Simplifykjeremy2019-04-261-7/+4
|
* Pass in char instead of single-char stringkjeremy2019-04-261-3/+3
|
* fix testAleksey Kladov2019-04-141-17/+6
|
* more intuitive nameAleksey Kladov2019-04-141-11/+15
|
* filter by timeAleksey Kladov2019-04-141-5/+35
|
* cleanup syntaxAleksey Kladov2019-04-141-0/+4
|
* fast path for disabled profilerAleksey Kladov2019-04-141-8/+16
|
* added some docs to public functionsSergey Parilin2019-04-031-1/+46
|
* PR issuse resolvedSergey Parilin2019-04-021-0/+6
|
* some PR issues fixedSergey Parilin2019-03-291-82/+68
|
* profiling crate first draftSergey Parilin2019-03-272-0/+170