index
:
rust
this commit
auto
automation/bors/try
automation/bors/try-merge
beta
cargo_update
lcnr/rustc-dev-guide
master
perf-tmp
stable
try
try-perf
https://github.com/rust-lang/rust
about
summary
refs
log
tree
commit
diff
log msg
author
committer
range
path:
root
/
compiler
/
rustc_mir_transform
/
src
/
coverage
/
graph.rs
Age
Commit message (
Expand
)
Author
Lines
2025-02-24
Rollup merge of #136610 - Jarcho:range_idx, r=Noratrieb
Jacob Pratt
-1
/
+1
2025-02-22
Greatly simplify lifetime captures in edition 2024
Michael Goulet
-2
/
+1
2025-02-21
Allow SliceIndex to be indexed by ranges.
Jason Newcomb
-1
/
+1
2025-02-06
coverage: Store BCB node IDs in mappings, and resolve them in codegen
Zalathar
-9
/
+1
2025-01-19
Run `clippy --fix` for `unnecessary_map_or` lint
Yotam Ofek
-1
/
+1
2025-01-16
coverage: Completely overhaul counter assignment, using node-flow graphs
Zalathar
-173
/
+1
2025-01-11
rename `BitSet` to `DenseBitSet`
Rémy Rakic
-3
/
+3
2024-12-07
coverage: Prefer to visit nodes whose predecessors have been visited
Zalathar
-133
/
+123
2024-11-01
coverage: Simplify logic for chaining multiple blocks into one BCB
Zalathar
-26
/
+22
2024-10-31
coverage: Use a standard depth-first search on a custom subgraph
Zalathar
-29
/
+31
2024-10-31
coverage: Make `CoverageSuccessors` a struct
Zalathar
-44
/
+27
2024-10-26
coverage: Don't rely on the custom traversal to find enclosing loops
Zalathar
-45
/
+72
2024-10-22
Move `cmp_in_dominator_order` out of graph dominator computation
Zalathar
-2
/
+23
2024-09-22
Reformat using the new identifier sorting from rustfmt
Michael Goulet
-1
/
+1
2024-09-15
coverage: Replace `bcb_has_multiple_in_edges` with `sole_predecessor`
Zalathar
-15
/
+9
2024-09-15
coverage: Track whether a node's count is the sum of its out-edges
Zalathar
-10
/
+48
2024-09-15
coverage: Tweak comments in `graph`
Zalathar
-4
/
+4
2024-08-30
Remove `#[macro_use] extern crate tracing` from `rustc_mir_transform`.
Nicholas Nethercote
-0
/
+1
2024-08-07
Use more slice patterns inside the compiler
León Orell Valerian Liehr
-2
/
+2
2024-07-29
Reformat `use` declarations.
Nicholas Nethercote
-4
/
+4
2024-07-07
Support tail calls in mir via `TerminatorKind::TailCall`
Maybe Waffle
-3
/
+6
2024-06-16
coverage: Prefer `Iterator::copied`
Zalathar
-1
/
+1
2024-06-16
coverage: Flatten some graph code with let-else
Zalathar
-18
/
+17
2024-06-16
coverage: Reduce/simplify visibility in `coverage::graph`
Zalathar
-24
/
+28
2024-05-13
Remove `extern crate rustc_middle` from `rustc_mir_transform`.
Nicholas Nethercote
-0
/
+1
2024-04-15
Use RPITIT for `Successors` and `Predecessors` traits
Maybe Waffle
-6
/
+2
2024-04-14
Rename `WithNumEdges` => `NumEdges` and `WithStartNode` => `StartNode`
Maybe Waffle
-2
/
+2
2024-04-14
Merge `{With,Graph}{Successors,Predecessors}` into `{Successors,Predecessors}`
Maybe Waffle
-15
/
+7
2024-04-14
Merge `WithNumNodes` into DirectedGraph
Maybe Waffle
-3
/
+1
2024-02-24
Change InlineAsm to allow multiple targets instead
Gary Guo
-5
/
+13
2024-02-23
coverage: Use variable name `this` in `CoverageGraph::from_mir`
Zalathar
-7
/
+6
2024-01-14
coverage: Simplify computing successors in the BCB graph
Zalathar
-14
/
+7
2024-01-14
coverage: Move helper `add_basic_coverage_block` into a local closure
Zalathar
-22
/
+18
2024-01-14
coverage: Simplify the loop that combines blocks into BCBs
Zalathar
-57
/
+33
2024-01-14
coverage: Indicate whether a block's successors allow BCB chaining
Zalathar
-28
/
+62
2024-01-14
coverage: Determine a block's successors from just the terminator
Zalathar
-14
/
+11
2023-11-25
coverage: Assert that bcb0 starts with bb0 and has no in-edges
Zalathar
-0
/
+13
2023-11-25
coverage: Eliminate `BcbBranch`
Zalathar
-39
/
+0
2023-11-25
coverage: Extract `CoverageGraph::bcb_has_multiple_in_edges`
Zalathar
-1
/
+15
2023-11-22
Replace `no_ord_impl` with `orderable`.
Nicholas Nethercote
-0
/
+1
2023-11-21
Fix `clippy::needless_borrow` in the compiler
Nilstrieb
-1
/
+1
2023-10-20
s/Generator/Coroutine/
Oli Scherer
-1
/
+1
2023-10-12
coverage: Simplify adding BCB successors to the traversal worklists
Zalathar
-38
/
+39
2023-10-12
coverage: Don't store loop backedges in the traversal context
Zalathar
-7
/
+10
2023-10-12
coverage: Store a graph reference in the graph traversal struct
Zalathar
-11
/
+10
2023-10-12
coverage: Use a `VecDeque` for loop traversal worklists
Zalathar
-31
/
+18
2023-10-12
coverage: Rename `next_bcb` to just `bcb`
Zalathar
-9
/
+10
2023-10-12
coverage: Simplify the detection of reloop edges to be given expressions
Zalathar
-4
/
+14
2023-10-10
coverage: Unbox and simplify `bcb_filtered_successors`
Zalathar
-27
/
+23
2023-10-10
coverage: Replace `ShortCircuitPreorder` with a single function
Zalathar
-55
/
+17
[next]