mirror of
				https://github.com/c64scene-ar/llvm-6502.git
				synced 2025-11-01 00:17:01 +00:00 
			
		
		
		
	instead of to have a chained series of scope nodes. This makes the generated table smaller, improves the efficiency of the interpreter, and make the factoring optimization much more reasonable to implement. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@97160 91177308-0d34-0410-b5e6-96231b3b80d8
		
			
				
	
	
		
			16 lines
		
	
	
		
			608 B
		
	
	
	
		
			LLVM
		
	
	
	
	
	
			
		
		
	
	
			16 lines
		
	
	
		
			608 B
		
	
	
	
		
			LLVM
		
	
	
	
	
	
| ; RUN: llc < %s -march=x86 -mattr=sse | grep movaps
 | |
| ; Test that the load is NOT folded into the intrinsic, which would zero the top
 | |
| ; elts of the loaded vector.
 | |
| 
 | |
| target datalayout = "e-p:32:32"
 | |
| target triple = "i686-apple-darwin8.7.2"
 | |
| 
 | |
| define <4 x float> @test(<4 x float> %A, <4 x float>* %B) nounwind {
 | |
|         %BV = load <4 x float>* %B              ; <<4 x float>> [#uses=1]
 | |
|         %tmp28 = tail call <4 x float> @llvm.x86.sse.sub.ss( <4 x float> %A, <4 x float> %BV )       ; <<4 x float>> [#uses=1]
 | |
|         ret <4 x float> %tmp28
 | |
| }
 | |
| 
 | |
| declare <4 x float> @llvm.x86.sse.sub.ss(<4 x float>, <4 x float>)
 | |
| 
 |