Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Use a more efficient iteration order for backward dataflow #62063

Merged
merged 1 commit into from
Jul 1, 2019
Merged

Use a more efficient iteration order for backward dataflow #62063

merged 1 commit into from
Jul 1, 2019

Commits on Jun 27, 2019

  1. Use more efficient iteration order for backward dataflow 

    This applies the same basic principle as rust-lang#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.

Some `mir::Body`s contain basic blocks which are not reachable from the
`START_BLOCK`. We need to add them to the work queue as well to preserve
the original semantics.
    @ecstatic-morse
    ecstatic-morse committed Jun 27, 2019
    Configuration menu
    Copy the full SHA
    e2479e2 View commit details
    Browse the repository at this point in the history