| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Normalize waiting queries names | Aleksey Kladov | 2020-03-06 | 1 | -6/+6 |
| | | |||||
| * | Less confusing profile names | Aleksey Kladov | 2020-03-06 | 1 | -1/+1 |
| | | |||||
| * | Add `_query` suffix to `compute_crate_def_map` for consistency | Michal Terepeta | 2020-01-03 | 1 | -1/+1 |
| | | | | | Signed-off-by: Michal Terepeta <[email protected]> | ||||
| * | Split `crate_def_map` into two methods | Michal Terepeta | 2020-01-03 | 1 | -1/+10 |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | This change: - introduces `compute_crate_def_map` query and renames `CrateDefMap::crate_def_map_query` for consistency, - annotates `crate_def_map` as `salsa::transparent` and adds a top-level `crate_def_map` wrapper function around that starts the profiler and immediately calls into `compute_crate_def_map` query. This allows us to better understand where we spent the time, in particular, how much is spent in the recomputaiton and how much in salsa. Example output (where we don't actually re-compute anything, but the query still takes a non-trivial amount of time): ``` 211ms - handle_inlay_hints 150ms - get_inlay_hints 150ms - SourceAnalyzer::new 65ms - def_with_body_from_child_node 65ms - analyze_container 65ms - analyze_container 65ms - Module::from_definition 65ms - Module::from_file 65ms - crate_def_map 1ms - parse_macro_query (6 calls) 0ms - raw_items_query (1 calls) 64ms - ??? ``` Signed-off-by: Michal Terepeta <[email protected]> | ||||
| * | Remove import source map | Aleksey Kladov | 2019-12-21 | 1 | -10/+1 |
| | | |||||
| * | Revert "Merge #2629" | Aleksey Kladov | 2019-12-21 | 1 | -1/+10 |
| | | | | | | This reverts commit cdc9d682b066b110e0a44e5f8f1c574b38c16ba9, reversing changes made to 90ef070db3dce0a7acb9cd11d0b0d72de13c9d79. | ||||
| * | Remove import source map | Aleksey Kladov | 2019-12-21 | 1 | -10/+1 |
| | | |||||
| * | Move enum&union to new loc | Aleksey Kladov | 2019-12-12 | 1 | -6/+6 |
| | | |||||
| * | Move structs to new loc | Aleksey Kladov | 2019-12-12 | 1 | -3/+3 |
| | | |||||
| * | Move traits to the new loc | Aleksey Kladov | 2019-12-12 | 1 | -3/+3 |
| | | |||||
| * | Switch to the new location for impls | Aleksey Kladov | 2019-12-12 | 1 | -3/+3 |
| | | |||||
| * | Fix hir for ast::UnionDef | Aleksey Kladov | 2019-11-25 | 1 | -4/+8 |
| | | |||||
| * | Switch to StaticLoc for statics | Aleksey Kladov | 2019-11-24 | 1 | -2/+3 |
| | | |||||
| * | Cleanup imports | Aleksey Kladov | 2019-11-23 | 1 | -10/+10 |
| | | |||||
| * | Get rid of DefDatabase2 | Aleksey Kladov | 2019-11-23 | 1 | -2/+2 |
| | | |||||
| * | Move docs to hir_def | Aleksey Kladov | 2019-11-23 | 1 | -0/+6 |
| | | |||||
| * | Move lang_items to hir_def | Aleksey Kladov | 2019-11-23 | 1 | -3/+13 |
| | | |||||
| * | Move attrs query to hir_def | Aleksey Kladov | 2019-11-23 | 1 | -1/+5 |
| | | |||||
| * | Move const&static date to hir_def | Aleksey Kladov | 2019-11-22 | 1 | -3/+9 |
| | | |||||
| * | Move data to a single file | Aleksey Kladov | 2019-11-22 | 1 | -4/+1 |
| | | |||||
| * | Move FunctionData to hir_def | Aleksey Kladov | 2019-11-22 | 1 | -1/+6 |
| | | |||||
| * | Move TypeAlias to hir_def | Aleksey Kladov | 2019-11-22 | 1 | -1/+5 |
| | | |||||
| * | Move generic_params query to HIR | Aleksey Kladov | 2019-11-20 | 1 | -1/+5 |
| | | |||||
| * | Move constants to new ID | Aleksey Kladov | 2019-11-20 | 1 | -6/+3 |
| | | | | | This allows us to get rid of trait item index | ||||
| * | Switch type aliases to new sources | Aleksey Kladov | 2019-11-20 | 1 | -3/+3 |
| | | |||||
| * | Next gen IDs for functions | Aleksey Kladov | 2019-11-20 | 1 | -2/+2 |
| | | | | | | | | | | | | | | | | | | The current system with AstIds has two primaraly drawbacks: * It is possible to manufacture IDs out of thin air. For example, it's possible to create IDs for items which are not considered in CrateDefMap due to cfg. Or it is possible to mixup structs and unions, because they share ID space. * Getting the ID of a parent requires a secondary index. Instead, the plan is to pursue the more traditional approach, where each items stores the id of the parent declaration. This makes `FromSource` more awkward, but also more correct: now, to get from an AST to HIR, we first do this recursively for the parent item, and the just search the children of the parent for the matching def | ||||
| * | Move traits to hir_def | Aleksey Kladov | 2019-11-20 | 1 | -2/+9 |
| | | |||||
| * | Remove old impls infrastructure | Aleksey Kladov | 2019-11-15 | 1 | -1/+5 |
| | | |||||
| * | Add ImplId | Aleksey Kladov | 2019-11-15 | 1 | -9/+10 |
| | | |||||
| * | Move body queries to hir_def | Aleksey Kladov | 2019-11-14 | 1 | -1/+11 |
| | | |||||
| * | Unfork struct and union ids | Aleksey Kladov | 2019-11-09 | 1 | -8/+4 |
| | | |||||
| * | Move CrateDefMap to hir_def | Aleksey Kladov | 2019-11-03 | 1 | -3/+12 |
| | | |||||
| * | move struct & enum data to hir_def | Aleksey Kladov | 2019-10-31 | 1 | -1/+11 |
| | | |||||
| * | move raw_items to hir_def | Aleksey Kladov | 2019-10-30 | 1 | -0/+18 |
| | | |||||
| * | Move ids to hir_def crate | Aleksey Kladov | 2019-10-30 | 1 | -0/+22 |
 |
index : rust-analyzer | |
| [FORK] modified to work on wasm targets |
| aboutsummaryrefslogtreecommitdiff |