Two tail merging improvements:
authorDale Johannesen <dalej@apple.com>
Wed, 23 May 2007 21:07:20 +0000 (21:07 +0000)
committerDale Johannesen <dalej@apple.com>
Wed, 23 May 2007 21:07:20 +0000 (21:07 +0000)
commit7aea8320340ce867eb4328aeec52cb02c88ef0b3
tree8115192a52727a06cf8af66e85cdc2b16f58eaa2
parent79b48b8bc07170656e7e2d7500f7fcbf69ccc923
Two tail merging improvements:
When considering blocks with more than 2 predecessors, merge the block with
the largest number of matching insns, rather than the first block found.
Considering that 1 matching insn is enough to show a win for candidates that
already end with a branch.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@37315 91177308-0d34-0410-b5e6-96231b3b80d8
lib/CodeGen/BranchFolding.cpp