[PATCH] D19350: MachineScheduler: Remember top/bottom choice in bidirectional scheduling

[Matthias Braun via llvm-commits]

MatzeB created this revision.
MatzeB added a reviewer: atrick.
MatzeB added a subscriber: llvm-commits.
MatzeB set the repository for this revision to rL LLVM.
Herald added subscribers: mcrosier, MatzeB.

Remember the last choice for the top/bottom scheduling boundary in
bidirectional scheduling mode. The top choice should not change if we
schedule at the bottom and vice versa.

In practice however it may change, since we can get slightly weaker
"reasons" out of tryCand when rerunning a pickNode() with less nodes in
the queue because some have been scheduled in the other boundary.
This can lead to slightly different choices but the new choice should be
better since the cached values is from a time when more nodes were in
the queue so we should have an exacter reason.

Repository:
  rL LLVM

http://reviews.llvm.org/D19350

Files:
  include/llvm/CodeGen/MachineScheduler.h
  lib/CodeGen/MachineScheduler.cpp
  test/CodeGen/AArch64/vector-fcopysign.ll

-------------- next part --------------
A non-text attachment was scrubbed...
Name: D19350.54450.patch
Type: text/x-patch
Size: 7045 bytes
Desc: not available
URL: <http://lists.llvm.org/pipermail/llvm-commits/attachments/20160421/23fbc177/attachment.bin>