6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-11-03 14:21:30 +00:00
Code Issues Projects Releases Wiki Activity

Fancier algorithm in tail-merge comment implemented, so remove comment.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@37393 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Dale Johannesen
2007-06-01 23:04:28 +00:00
parent a5a2117a46
commit b468163869
1 changed files with 0 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
lib/CodeGen/README.txt
View File

@@ -143,21 +143,3 @@ load [T + 7]
... ...
load [T + 15] load [T + 15]
//===---------------------------------------------------------------------===// //===---------------------------------------------------------------------===//
Tail merging issue:
When we're trying to merge the tails of predecessors of a block I, and there
are more than 2 predecessors, we don't do it optimally. Suppose predecessors
are A,B,C where B and C have 5 instructions in common, and A has 2 in common
with B or C. We want to get:
A:
jmp C3
B:
jmp C2
C:
C2: 3 common to B and C but not A
C3: 2 common to all 3
You get this if B and C are merged first, but currently it might randomly decide
to merge A and B first, which results in not sharing the C2 instructions. We
could look at all N*(N-1) combinations of predecessors and merge the ones with
the most instructions in common first. Usually that will be fast, but it
could get slow on big graphs (e.g. large switches tend to have blocks with many
predecessors).