[PATCH] D26154: [Reassociate] Skip analysis of dead code to avoid infinite loop.

[Bjorn Pettersson via llvm-commits]

bjope updated this revision to Diff 76541.
bjope added a comment.

Updated according to comments.

The solution is not based on using the same Reverse Post Order Traversal
both when building the RankMap and when doing optimisations.
This changes the order in which basic blocks are optimised, but as far
as I understand the end result should be the same.


https://reviews.llvm.org/D26154

Files:
  include/llvm/Transforms/Scalar/Reassociate.h
  lib/Transforms/Scalar/Reassociate.cpp
  test/Transforms/Reassociate/deadcode.ll

-------------- next part --------------
A non-text attachment was scrubbed...
Name: D26154.76541.patch
Type: text/x-patch
Size: 3543 bytes
Desc: not available
URL: <http://lists.llvm.org/pipermail/llvm-commits/attachments/20161101/918c6615/attachment.bin>