- 15 8月, 2023 19 次提交
-
-
由 Michael Goulet 提交于
-
由 Michael Goulet 提交于
-
由 Michael Goulet 提交于
-
由 Michael Goulet 提交于
Co-authored-by: Nlcnr <rust@lcnr.de>
-
由 Michael Goulet 提交于
-
由 Michael Goulet 提交于
-
由 Michael Goulet 提交于
-
由 Michael Goulet 提交于
-
由 Michael Goulet 提交于
-
由 Michael Goulet 提交于
-
由 Esteban Küber 提交于
-
由 Esteban Küber 提交于
-
由 Esteban Küber 提交于
When encountering code like ```rust fn foo() -> i32 { match 0 { 1 => return 0, 2 => "", _ => 1, } } ``` Point at the return type and not at the prior arm, as that arm has type `!` which isn't influencing the arm corresponding to arm `2`. Fix #78124.
-
由 Dirreck 提交于
Co-authored-by: Nklensy <klensy@users.noreply.github.com>
-
由 nxya 提交于
-
由 ouz-a 提交于
-
由 bjorn3 提交于
-
由 dirreke 提交于
-
由 dirreke 提交于
-
- 14 8月, 2023 14 次提交
-
-
由 dirreke 提交于
-
由 dirreke 提交于
-
由 Dirreke 提交于
-
由 Dirreke 提交于
-
由 Dirreck 提交于
Co-authored-by: Nbjorn3 <17426603+bjorn3@users.noreply.github.com>
-
由 Dirreke 提交于
-
由 lcnr 提交于
-
由 lcnr 提交于
-
由 yukang 提交于
-
由 Nilstrieb 提交于
-
由 Deadbeef 提交于
-
由 Michael Goulet 提交于
-
由 bjorn3 提交于
It is only used by CrateLoader. We can store the metadata loader in CStore instead which CrateLoader has access to.
-
由 bjorn3 提交于
Constructing an FxIndexMap is useless work as the iteration order never matters.
-
- 13 8月, 2023 7 次提交
-
-
由 bjorn3 提交于
All of them are not exported from rustc_interface and used only during global_ctxt(). Inlining them makes it easier to follow the order of queries and slightly reduces line count.
-
由 bjorn3 提交于
It was only ever set in a function which isn't called anywhere.
-
由 Nilstrieb 提交于
This allows for better type safety in the compiler and also improves the documentation for many things, making it clear that they expect modules.
-
由 Zalathar 提交于
Storing coverage counter information in `CoverageCounters` has a few advantages over storing it directly inside BCB graph nodes: - The graph doesn't need to be mutable when making the counters, making it easier to see that the graph itself is not modified during this step. - All of the counter data is clearly visible in one place. - It becomes possible to use a representation that doesn't correspond 1:1 to graph nodes, e.g. storing all the edge counters in a single hashmap instead of several.
-
由 Zalathar 提交于
This avoids the need to pass around a separate vector to accumulate into, and avoids the need to create a fake empty vector when failure occurs.
-
由 Zalathar 提交于
This avoids confusion with data structures that actually hold BCB counter information.
-
由 lcnr 提交于
-