mirror of
				https://github.com/c64scene-ar/llvm-6502.git
				synced 2025-10-30 16:17:05 +00:00 
			
		
		
		
	This changes the SelectionDAG scheduling preference to source order. Soon, the SelectionDAG scheduler can be bypassed saving a nice chunk of compile time. Performance differences that result from this change are often a consequence of register coalescing. The register coalescer is far from perfect. Bugs can be filed for deficiencies. On x86 SandyBridge/Haswell, the source order schedule is often preserved, particularly for small blocks. Register pressure is generally improved over the SD scheduler's ILP mode. However, we are still able to handle large blocks that require latency hiding, unlike the SD scheduler's BURR mode. MI scheduler also attempts to discover the critical path in single-block loops and adjust heuristics accordingly. The MI scheduler relies on the new machine model. This is currently unimplemented for AVX, so we may not be generating the best code yet. Unit tests are updated so they don't depend on SD scheduling heuristics. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@192750 91177308-0d34-0410-b5e6-96231b3b80d8
		
			
				
	
	
		
			86 lines
		
	
	
		
			2.8 KiB
		
	
	
	
		
			LLVM
		
	
	
	
	
	
			
		
		
	
	
			86 lines
		
	
	
		
			2.8 KiB
		
	
	
	
		
			LLVM
		
	
	
	
	
	
| ; RUN: llc < %s -mtriple=x86_64-unknown-unknown -mcpu=core-avx-i -mattr=+rdrnd | FileCheck %s
 | |
| declare {i16, i32} @llvm.x86.rdrand.16()
 | |
| declare {i32, i32} @llvm.x86.rdrand.32()
 | |
| declare {i64, i32} @llvm.x86.rdrand.64()
 | |
| 
 | |
| define i32 @_rdrand16_step(i16* %random_val) {
 | |
|   %call = call {i16, i32} @llvm.x86.rdrand.16()
 | |
|   %randval = extractvalue {i16, i32} %call, 0
 | |
|   store i16 %randval, i16* %random_val
 | |
|   %isvalid = extractvalue {i16, i32} %call, 1
 | |
|   ret i32 %isvalid
 | |
| ; CHECK-LABEL: _rdrand16_step:
 | |
| ; CHECK: rdrandw	%ax
 | |
| ; CHECK: movzwl	%ax, %ecx
 | |
| ; CHECK: movl	$1, %eax
 | |
| ; CHECK: cmovael	%ecx, %eax
 | |
| ; CHECK: movw	%cx, (%r[[A0:di|cx]])
 | |
| ; CHECK: ret
 | |
| }
 | |
| 
 | |
| define i32 @_rdrand32_step(i32* %random_val) {
 | |
|   %call = call {i32, i32} @llvm.x86.rdrand.32()
 | |
|   %randval = extractvalue {i32, i32} %call, 0
 | |
|   store i32 %randval, i32* %random_val
 | |
|   %isvalid = extractvalue {i32, i32} %call, 1
 | |
|   ret i32 %isvalid
 | |
| ; CHECK-LABEL: _rdrand32_step:
 | |
| ; CHECK: rdrandl	%e[[T0:[a-z]+]]
 | |
| ; CHECK: movl	$1, %eax
 | |
| ; CHECK: cmovael	%e[[T0]], %eax
 | |
| ; CHECK: movl	%e[[T0]], (%r[[A0]])
 | |
| ; CHECK: ret
 | |
| }
 | |
| 
 | |
| define i32 @_rdrand64_step(i64* %random_val) {
 | |
|   %call = call {i64, i32} @llvm.x86.rdrand.64()
 | |
|   %randval = extractvalue {i64, i32} %call, 0
 | |
|   store i64 %randval, i64* %random_val
 | |
|   %isvalid = extractvalue {i64, i32} %call, 1
 | |
|   ret i32 %isvalid
 | |
| ; CHECK-LABEL: _rdrand64_step:
 | |
| ; CHECK: rdrandq	%r[[T1:[a-z]+]]
 | |
| ; CHECK: movl	$1, %eax
 | |
| ; CHECK: cmovael	%e[[T1]], %eax
 | |
| ; CHECK: movq	%r[[T1]], (%r[[A0]])
 | |
| ; CHECK: ret
 | |
| }
 | |
| 
 | |
| ; Check that MachineCSE doesn't eliminate duplicate rdrand instructions.
 | |
| define i32 @CSE() nounwind {
 | |
|  %rand1 = tail call { i32, i32 } @llvm.x86.rdrand.32() nounwind
 | |
|  %v1 = extractvalue { i32, i32 } %rand1, 0
 | |
|  %rand2 = tail call { i32, i32 } @llvm.x86.rdrand.32() nounwind
 | |
|  %v2 = extractvalue { i32, i32 } %rand2, 0
 | |
|  %add = add i32 %v2, %v1
 | |
|  ret i32 %add
 | |
| ; CHECK-LABEL: CSE:
 | |
| ; CHECK: rdrandl
 | |
| ; CHECK: rdrandl
 | |
| }
 | |
| 
 | |
| ; Check that MachineLICM doesn't hoist rdrand instructions.
 | |
| define void @loop(i32* %p, i32 %n) nounwind {
 | |
| entry:
 | |
|   %tobool1 = icmp eq i32 %n, 0
 | |
|   br i1 %tobool1, label %while.end, label %while.body
 | |
| 
 | |
| while.body:                                       ; preds = %entry, %while.body
 | |
|   %p.addr.03 = phi i32* [ %incdec.ptr, %while.body ], [ %p, %entry ]
 | |
|   %n.addr.02 = phi i32 [ %dec, %while.body ], [ %n, %entry ]
 | |
|   %dec = add nsw i32 %n.addr.02, -1
 | |
|   %incdec.ptr = getelementptr inbounds i32* %p.addr.03, i64 1
 | |
|   %rand = tail call { i32, i32 } @llvm.x86.rdrand.32() nounwind
 | |
|   %v1 = extractvalue { i32, i32 } %rand, 0
 | |
|   store i32 %v1, i32* %p.addr.03, align 4
 | |
|   %tobool = icmp eq i32 %dec, 0
 | |
|   br i1 %tobool, label %while.end, label %while.body
 | |
| 
 | |
| while.end:                                        ; preds = %while.body, %entry
 | |
|   ret void
 | |
| ; CHECK-LABEL: loop:
 | |
| ; CHECK-NOT: rdrandl
 | |
| ; CHECK: This Inner Loop Header: Depth=1
 | |
| ; CHECK: rdrandl
 | |
| }
 |