about summary refs log tree commit diff
path: root/src/test/rustdoc-ui/coverage/basic.rs
diff options
context:
space:
mode:
authorMazdak Farrokhzad <twingoow@gmail.com>2019-06-30 21:57:24 +0200
committerGitHub <noreply@github.com>2019-06-30 21:57:24 +0200
commit70ea57bcb37bb57444fafbb80be8f6d1846090f3 (patch)
tree0908476f929ea46ea1fc0e6583013de8281ddabc /src/test/rustdoc-ui/coverage/basic.rs
parent543c4648bd2028672d091cec378a50034c8709a0 (diff)
parente2479e263ef1135dcd1318cce51ee8fafeae62ae (diff)
downloadrust-70ea57bcb37bb57444fafbb80be8f6d1846090f3.tar.gz
rust-70ea57bcb37bb57444fafbb80be8f6d1846090f3.zip
Rollup merge of #62063 - ecstatic-morse:dataflow-backward-order, r=nagisa
Use a more efficient iteration order for backward dataflow

This applies the same basic principle as #62062 to the reverse dataflow analysis used to compute liveness information. It is functionally equivalent, except that post-order is used instead of reverse post-order.

In the long-term, `BitDenotation` should probably be extended to support both forward and backward dataflow, but there's some more work needed to get to that point.
Diffstat (limited to 'src/test/rustdoc-ui/coverage/basic.rs')
0 files changed, 0 insertions, 0 deletions