RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-01 00:12:50 +01:00
Code Issues Projects Releases Wiki Activity
3eb650542a
llvm-mirror/test/CodeGen/X86/remat-mov-0.ll

35 lines
687 B
LLVM
Raw Normal View History

Relax expressions and add explicit triplets -linux and -win32. llvm-svn: 126212
2011-02-22 08:21:25 +01:00
; RUN: llc < %s -mtriple=x86_64-linux | FileCheck %s
; RUN: llc < %s -mtriple=x86_64-win32 | FileCheck %s
Re-instate MOV64r0 and MOV16r0, with adjustments to work with the new AsmPrinter. This is perhaps less elegant than describing them in terms of MOV32r0 and subreg operations, but it allows the current register to rematerialize them. llvm-svn: 93158
2010-01-11 18:37:57 +01:00
; CodeGen should remat the zero instead of spilling it.
declare void @foo(i64 %p)
Re-implement the main strength-reduction portion of LoopStrengthReduction. This new version is much more aggressive about doing "full" reduction in cases where it reduces register pressure, and also more aggressive about rewriting induction variables to count down (or up) to zero when doing so reduces register pressure. It currently uses fairly simplistic algorithms for finding reuse opportunities, but it introduces a new framework allows it to combine multiple strategies at once to form hybrid solutions, instead of doing all full-reduction or all base+index. llvm-svn: 94061
2010-01-21 03:09:26 +01:00
; CHECK: bar:
Relax expressions and add explicit triplets -linux and -win32. llvm-svn: 126212
2011-02-22 08:21:25 +01:00
; CHECK: xorl %e[[A0:di|cx]], %e
; CHECK: xorl %e[[A0]], %e[[A0]]
Re-instate MOV64r0 and MOV16r0, with adjustments to work with the new AsmPrinter. This is perhaps less elegant than describing them in terms of MOV32r0 and subreg operations, but it allows the current register to rematerialize them. llvm-svn: 93158
2010-01-11 18:37:57 +01:00
define void @bar() nounwind {
call void @foo(i64 0)
call void @foo(i64 0)
ret void
}
Re-implement the main strength-reduction portion of LoopStrengthReduction. This new version is much more aggressive about doing "full" reduction in cases where it reduces register pressure, and also more aggressive about rewriting induction variables to count down (or up) to zero when doing so reduces register pressure. It currently uses fairly simplistic algorithms for finding reuse opportunities, but it introduces a new framework allows it to combine multiple strategies at once to form hybrid solutions, instead of doing all full-reduction or all base+index. llvm-svn: 94061
2010-01-21 03:09:26 +01:00
; CHECK: bat:
Relax expressions and add explicit triplets -linux and -win32. llvm-svn: 126212
2011-02-22 08:21:25 +01:00
; CHECK: movq $-1, %r[[A0]]
; CHECK: movq $-1, %r[[A0]]
Re-implement the main strength-reduction portion of LoopStrengthReduction. This new version is much more aggressive about doing "full" reduction in cases where it reduces register pressure, and also more aggressive about rewriting induction variables to count down (or up) to zero when doing so reduces register pressure. It currently uses fairly simplistic algorithms for finding reuse opportunities, but it introduces a new framework allows it to combine multiple strategies at once to form hybrid solutions, instead of doing all full-reduction or all base+index. llvm-svn: 94061
2010-01-21 03:09:26 +01:00
define void @bat() nounwind {
call void @foo(i64 -1)
call void @foo(i64 -1)
ret void
}
; CHECK: bau:
Relax expressions and add explicit triplets -linux and -win32. llvm-svn: 126212
2011-02-22 08:21:25 +01:00
; CHECK: movl $1, %e[[A0]]
; CHECK: movl $1, %e[[A0]]
Re-implement the main strength-reduction portion of LoopStrengthReduction. This new version is much more aggressive about doing "full" reduction in cases where it reduces register pressure, and also more aggressive about rewriting induction variables to count down (or up) to zero when doing so reduces register pressure. It currently uses fairly simplistic algorithms for finding reuse opportunities, but it introduces a new framework allows it to combine multiple strategies at once to form hybrid solutions, instead of doing all full-reduction or all base+index. llvm-svn: 94061
2010-01-21 03:09:26 +01:00
define void @bau() nounwind {
call void @foo(i64 1)
call void @foo(i64 1)
ret void
}
Reference in New Issue Copy Permalink