diff options
author | Jatin Bhateja <jatin.bhateja@gmail.com> | 2017-10-04 09:02:10 +0000 |
---|---|---|
committer | Jatin Bhateja <jatin.bhateja@gmail.com> | 2017-10-04 09:02:10 +0000 |
commit | 3c29bacd43ffd9bb15eebcf1afc12106806030bd (patch) | |
tree | 10750a4a1a3e12086479b7b0022ca840f332e4ce /llvm/lib/CodeGen/CodeGen.cpp | |
parent | ea9dceed777adc46556192a7adc4ae48be1c2113 (diff) | |
download | bcm5719-llvm-3c29bacd43ffd9bb15eebcf1afc12106806030bd.tar.gz bcm5719-llvm-3c29bacd43ffd9bb15eebcf1afc12106806030bd.zip |
[X86] Improvement in CodeGen instruction selection for LEAs (re-applying post required revision changes.)
Summary:
1/ Operand folding during complex pattern matching for LEAs has been
extended, such that it promotes Scale to accommodate similar operand
appearing in the DAG.
e.g.
T1 = A + B
T2 = T1 + 10
T3 = T2 + A
For above DAG rooted at T3, X86AddressMode will no look like
Base = B , Index = A , Scale = 2 , Disp = 10
2/ During OptimizeLEAPass down the pipeline factorization is now performed over LEAs
so that if there is an opportunity then complex LEAs (having 3 operands)
could be factored out.
e.g.
leal 1(%rax,%rcx,1), %rdx
leal 1(%rax,%rcx,2), %rcx
will be factored as following
leal 1(%rax,%rcx,1), %rdx
leal (%rdx,%rcx) , %edx
3/ Aggressive operand folding for AM based selection for LEAs is sensitive to loops,
thus avoiding creation of any complex LEAs within a loop.
Reviewers: lsaba, RKSimon, craig.topper, qcolombet, jmolloy
Reviewed By: lsaba
Subscribers: jmolloy, spatel, igorb, llvm-commits
Differential Revision: https://reviews.llvm.org/D35014
llvm-svn: 314886
Diffstat (limited to 'llvm/lib/CodeGen/CodeGen.cpp')
0 files changed, 0 insertions, 0 deletions