about summary refs log tree commit diff
path: root/src/liballoc/alloc
diff options
context:
space:
mode:
authorNicholas Nethercote <nnethercote@mozilla.com>2019-11-14 17:21:39 +1100
committerNicholas Nethercote <nnethercote@mozilla.com>2019-11-15 08:33:39 +1100
commit05f13a843370995181904ec961a7920eea9ae7bb (patch)
tree76bc314763b39257a9b3bb97f601136925044a7b /src/liballoc/alloc
parentcaf018714189db0b15f9f803adfcb4572ab7a988 (diff)
downloadrust-05f13a843370995181904ec961a7920eea9ae7bb.tar.gz
rust-05f13a843370995181904ec961a7920eea9ae7bb.zip
Make `process_obligations()` greedier.
`process_obligations()` adds new nodes, but it does not process these
new nodes until the next time it is called.

This commit changes it so that it does process these new nodes within
the same call. This change reduces the number of calls to
`process_obligations()` required to complete processing, sometimes
giving significant speed-ups.

The change required some changes to tests.
- The output of `cycle-cache-err-60010.rs` is slightly different.
- The unit tests required extra cases to handle the earlier processing
  of the added nodes. I mostly did these in the simplest possible way,
  by making the added nodes be ignored, thus giving outcomes the same as
  with the old behaviour. But I changed `success_in_grandchildren()`
  more extensively so that some obligations are completed earlier than
  they used to be.
Diffstat (limited to 'src/liballoc/alloc')
0 files changed, 0 insertions, 0 deletions