mirror of
				https://github.com/c64scene-ar/llvm-6502.git
				synced 2025-10-31 08:16:47 +00:00 
			
		
		
		
	Essentially the same as the GEP change in r230786.
A similar migration script can be used to update test cases, though a few more
test case improvements/changes were required this time around: (r229269-r229278)
import fileinput
import sys
import re
pat = re.compile(r"((?:=|:|^)\s*load (?:atomic )?(?:volatile )?(.*?))(| addrspace\(\d+\) *)\*($| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$)")
for line in sys.stdin:
  sys.stdout.write(re.sub(pat, r"\1, \2\3*\4", line))
Reviewers: rafael, dexonsmith, grosser
Differential Revision: http://reviews.llvm.org/D7649
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@230794 91177308-0d34-0410-b5e6-96231b3b80d8
		
	
		
			
				
	
	
		
			72 lines
		
	
	
		
			2.2 KiB
		
	
	
	
		
			LLVM
		
	
	
	
	
	
			
		
		
	
	
			72 lines
		
	
	
		
			2.2 KiB
		
	
	
	
		
			LLVM
		
	
	
	
	
	
| ; RUN: opt < %s -simplifycfg -phi-node-folding-threshold=2 -S | FileCheck %s
 | |
| 
 | |
| target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128"
 | |
| target triple = "x86_64-unknown-linux-gnu"
 | |
| 
 | |
| define i32 @test1(i32 %a, i32 %b, i32 %c) nounwind  {
 | |
| ; CHECK-LABEL: @test1(
 | |
| entry:
 | |
|         %tmp1 = icmp eq i32 %b, 0
 | |
|         br i1 %tmp1, label %bb1, label %bb3
 | |
| 
 | |
| bb1:            ; preds = %entry
 | |
| 	%tmp2 = icmp sgt i32 %c, 1
 | |
| 	br i1 %tmp2, label %bb2, label %bb3
 | |
| ; CHECK: bb1:
 | |
| ; CHECK-NEXT: icmp sgt i32 %c, 1
 | |
| ; CHECK-NEXT: add i32 %a, 1
 | |
| ; CHECK-NEXT: select i1 %tmp2, i32 %tmp3, i32 %a
 | |
| ; CHECK-NEXT: br label %bb3
 | |
| 
 | |
| bb2:		; preds = bb1
 | |
| 	%tmp3 = add i32 %a, 1
 | |
| 	br label %bb3
 | |
| 
 | |
| bb3:		; preds = %bb2, %entry
 | |
| 	%tmp4 = phi i32 [ %b, %entry ], [ %a, %bb1 ], [ %tmp3, %bb2 ]
 | |
|         %tmp5 = sub i32 %tmp4, 1
 | |
| 	ret i32 %tmp5
 | |
| }
 | |
| 
 | |
| define i8* @test4(i1* %dummy, i8* %a, i8* %b) {
 | |
| ; Test that we don't speculate an arbitrarily large number of unfolded constant
 | |
| ; expressions.
 | |
| ; CHECK-LABEL: @test4(
 | |
| 
 | |
| entry:
 | |
|   %cond1 = load volatile i1, i1* %dummy
 | |
|   br i1 %cond1, label %if, label %end
 | |
| 
 | |
| if:
 | |
|   %cond2 = load volatile i1, i1* %dummy
 | |
|   br i1 %cond2, label %then, label %end
 | |
| 
 | |
| then:
 | |
|   br label %end
 | |
| 
 | |
| end:
 | |
|   %x1 = phi i8* [ %a, %entry ], [ %b, %if ], [ inttoptr (i64 1 to i8*), %then ]
 | |
|   %x2 = phi i8* [ %a, %entry ], [ %b, %if ], [ inttoptr (i64 2 to i8*), %then ]
 | |
|   %x3 = phi i8* [ %a, %entry ], [ %b, %if ], [ inttoptr (i64 3 to i8*), %then ]
 | |
|   %x4 = phi i8* [ %a, %entry ], [ %b, %if ], [ inttoptr (i64 4 to i8*), %then ]
 | |
|   %x5 = phi i8* [ %a, %entry ], [ %b, %if ], [ inttoptr (i64 5 to i8*), %then ]
 | |
|   %x6 = phi i8* [ %a, %entry ], [ %b, %if ], [ inttoptr (i64 6 to i8*), %then ]
 | |
|   %x7 = phi i8* [ %a, %entry ], [ %b, %if ], [ inttoptr (i64 7 to i8*), %then ]
 | |
|   %x8 = phi i8* [ %a, %entry ], [ %b, %if ], [ inttoptr (i64 8 to i8*), %then ]
 | |
|   %x9 = phi i8* [ %a, %entry ], [ %b, %if ], [ inttoptr (i64 9 to i8*), %then ]
 | |
|   %x10 = phi i8* [ %a, %entry ], [ %b, %if ], [ inttoptr (i64 10 to i8*), %then ]
 | |
| ; CHECK-NOT: select
 | |
| ; CHECK: phi i8*
 | |
| ; CHECK: phi i8*
 | |
| ; CHECK: phi i8*
 | |
| ; CHECK: phi i8*
 | |
| ; CHECK: phi i8*
 | |
| ; CHECK: phi i8*
 | |
| ; CHECK: phi i8*
 | |
| ; CHECK: phi i8*
 | |
| ; CHECK: phi i8*
 | |
| ; CHECK: phi i8*
 | |
| 
 | |
|   ret i8* %x10
 | |
| }
 |