aboutsummaryrefslogtreecommitdiff
Commit message (Collapse)AuthorAgeFilesLines
...
| * | Fix clippy::or_fun_callAlan Du2019-06-0412-26/+29
| | |
| * | Fix clippy::identity_conversionAlan Du2019-06-0416-59/+49
| | |
| * | Fix clippy::single_char_patternAlan Du2019-06-044-9/+6
| | |
| * | Fix clippy::new_without_defaultAlan Du2019-06-041-0/+6
| | |
| * | Fix clippy::assign_op_patternAlan Du2019-06-041-1/+1
| | |
| * | Fix clippy::useless_formatAlan Du2019-06-041-2/+2
| | |
| * | Fix clippy::into_iter_on_refAlan Du2019-06-043-3/+3
| | |
| * | Fix clippy::len_zeroAlan Du2019-06-043-5/+5
| | |
| * | Fix clippy::unused_mutAlan Du2019-06-041-1/+1
| | |
| * | Fix clippy::unnecessary_mut_passedAlan Du2019-06-041-7/+2
| | |
| * | Fix clippy::ptr_argAlan Du2019-06-042-3/+3
| | |
| * | Fix clippy::if_same_then_elseAlan Du2019-06-041-0/+1
| | |
| * | Fix clippy::expect_fun_callAlan Du2019-06-041-1/+1
| | |
| * | Fix clippy::match_ref_patsAlan Du2019-06-042-9/+9
| | |
| * | Fix clippy::needless_returnAlan Du2019-06-041-1/+1
| | |
| * | Fix clippy::single_matchAlan Du2019-06-049-76/+51
| | |
| * | Fix clippy::clone_double_refAlan Du2019-06-041-1/+1
| | |
| * | Fix clippy::match_boolAlan Du2019-06-041-4/+2
| | |
| * | Allow clippy::map_cloneAlan Du2019-06-041-2/+6
| | | | | | | | | | | | We should turn it on after Iterator::copied stabilizes
| * | Allow clippy::needless_pass_by_valueAlan Du2019-06-041-1/+2
| | |
| * | Implement cargo lint to run clippyAlan Du2019-06-043-1/+34
| | |
* | | Merge #1376bors[bot]2019-06-041-4/+4
|\ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 1376: fix debug scopes r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | | fix debug scopesAleksey Kladov2019-06-041-4/+4
|/ / /
* | | Merge #1375bors[bot]2019-06-042-6/+7
|\ \ \ | |/ / |/| | | | | | | | | | | | | | | | | 1375: switch to panic-safe salsa r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | switch to panic-safe salsaAleksey Kladov2019-06-042-6/+7
|/ /
* | Merge #1373bors[bot]2019-06-033-4/+36
|\ \ | |/ |/| | | | | | | | | | | 1373: add couple of debug utils r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * add couple of debug utilsAleksey Kladov2019-06-033-4/+36
|/
* Merge #1369bors[bot]2019-06-025-33/+61
|\ | | | | | | | | | | | | | | 1369: don't cache parses twice r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * don't cache parses twiceAleksey Kladov2019-06-025-33/+61
| | | | | | | | | | | | | | | | | | Before this commit, `Parse`s for original file ended up two times in salsa's db: first, when we parse original file, and second, when we parse macro or a file. Given that parse trees are the worst ofenders in terms of memory, it makes sense to make sure we store them only once.
* | Merge #1368bors[bot]2019-06-023-26/+28
|\ \ | |/ |/| | | | | | | | | | | | | | | 1368: Store referece instead of full token tree in tokenbuffer r=matklad a=edwin0cheng This PR try to minimize the memory allocation in converting `SyntaxNode` to `TokenTree` by using reference isnteead of full token tree in `TokenBuffer`. Note that the final goal is replace `TokenTree` with TokenBuffer such that there is no conversion between them. Co-authored-by: Edwin Cheng <[email protected]>
| * unnecessary paranthesisEdwin Cheng2019-06-021-1/+1
| |
| * Store referece in tokenbufferEdwin Cheng2019-06-023-26/+28
| |
* | Merge #1367bors[bot]2019-06-021-0/+3
|\ \ | | | | | | | | | | | | | | | | | | | | | 1367: collect macro queries r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | collect macro queriesAleksey Kladov2019-06-021-0/+3
|/ /
* | Merge #1362bors[bot]2019-06-0217-98/+186
|\ \ | | | | | | | | | | | | | | | | | | | | | 1362: Introduce AST database r=matklad a=matklad The idea here is to separate fragile bits which look into the syntax directly from robust bits which are safe across reparses. This uses the new `salsa::requires` featue Co-authored-by: Aleksey Kladov <[email protected]>
| * | add AstDatabaseAleksey Kladov2019-06-0217-98/+186
|/ /
* | Merge #1366bors[bot]2019-06-021-0/+4
|\ \ | | | | | | | | | | | | | | | | | | | | | 1366: collect types and bodies r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | collect types and bodiesAleksey Kladov2019-06-011-0/+4
| | |
* | | Merge #1363bors[bot]2019-06-014-19/+11
|\| | | |/ |/| | | | | | | | | | | 1363: some work on memory r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * collect impl source mapsAleksey Kladov2019-06-013-11/+2
| |
| * don't cache ast_id_to_nodeAleksey Kladov2019-06-012-1/+1
| |
| * show macro expanded trees in the stats as wellAleksey Kladov2019-06-011-7/+8
|/
* Merge #1360bors[bot]2019-06-016-9/+55
|\ | | | | | | | | | | | | | | | | | | 1360: Improve goto definition for MBE r=matklad a=edwin0cheng This PR improve the macro resolution for goto definition and expression macro invocation by using proper path resolution for external macros. Co-authored-by: Edwin Cheng <[email protected]>
| * Improve goto definition for MBEEdwin Cheng2019-06-016-9/+55
| |
* | Merge #1359bors[bot]2019-06-012-3/+5
|\ \ | | | | | | | | | | | | | | | | | | | | | 1359: don't poison mutex around chalk r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | don't poison mutex around chalkAleksey Kladov2019-06-012-3/+5
| | | | | | | | | | | | | | | | | | | | | | | | | | | We use panics for cancellation, so we could trigger panic while holding the solver. std::sync::Mutex will be poisoned as a result, which and all further attempts to use solver (from other threads) will panic as well. This commit switches to parking_lot::Mutex which just unlocks on panic.
* | | Merge #1358bors[bot]2019-06-017-91/+94
|\ \ \ | |/ / |/| | | | | | | | | | | | | | | | | 1358: apply profile filter to top-level entries only r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | apply profile filter to top-level entries onlyAleksey Kladov2019-06-011-7/+6
| | |
| * | renameAleksey Kladov2019-06-016-80/+86
| | |
| * | move subs insideAleksey Kladov2019-06-011-4/+2
|/ /