mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-09-30 04:56:49 +00:00
7c9c6ed761
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
177 lines
3.5 KiB
LLVM
177 lines
3.5 KiB
LLVM
; RUN: opt -disable-output -passes=print-cg %s 2>&1 | FileCheck %s
|
|
;
|
|
; Basic validation of the call graph analysis used in the new pass manager.
|
|
|
|
define void @f() {
|
|
; CHECK-LABEL: Call edges in function: f
|
|
; CHECK-NOT: ->
|
|
|
|
entry:
|
|
ret void
|
|
}
|
|
|
|
; A bunch more functions just to make it easier to test several call edges at once.
|
|
define void @f1() {
|
|
ret void
|
|
}
|
|
define void @f2() {
|
|
ret void
|
|
}
|
|
define void @f3() {
|
|
ret void
|
|
}
|
|
define void @f4() {
|
|
ret void
|
|
}
|
|
define void @f5() {
|
|
ret void
|
|
}
|
|
define void @f6() {
|
|
ret void
|
|
}
|
|
define void @f7() {
|
|
ret void
|
|
}
|
|
define void @f8() {
|
|
ret void
|
|
}
|
|
define void @f9() {
|
|
ret void
|
|
}
|
|
define void @f10() {
|
|
ret void
|
|
}
|
|
define void @f11() {
|
|
ret void
|
|
}
|
|
define void @f12() {
|
|
ret void
|
|
}
|
|
|
|
declare i32 @__gxx_personality_v0(...)
|
|
|
|
define void @test0() {
|
|
; CHECK-LABEL: Call edges in function: test0
|
|
; CHECK-NEXT: -> f
|
|
; CHECK-NOT: ->
|
|
|
|
entry:
|
|
call void @f()
|
|
call void @f()
|
|
call void @f()
|
|
call void @f()
|
|
ret void
|
|
}
|
|
|
|
define void ()* @test1(void ()** %x) {
|
|
; CHECK-LABEL: Call edges in function: test1
|
|
; CHECK-NEXT: -> f12
|
|
; CHECK-NEXT: -> f11
|
|
; CHECK-NEXT: -> f10
|
|
; CHECK-NEXT: -> f7
|
|
; CHECK-NEXT: -> f9
|
|
; CHECK-NEXT: -> f8
|
|
; CHECK-NEXT: -> f6
|
|
; CHECK-NEXT: -> f5
|
|
; CHECK-NEXT: -> f4
|
|
; CHECK-NEXT: -> f3
|
|
; CHECK-NEXT: -> f2
|
|
; CHECK-NEXT: -> f1
|
|
; CHECK-NOT: ->
|
|
|
|
entry:
|
|
br label %next
|
|
|
|
dead:
|
|
br label %next
|
|
|
|
next:
|
|
phi void ()* [ @f1, %entry ], [ @f2, %dead ]
|
|
select i1 true, void ()* @f3, void ()* @f4
|
|
store void ()* @f5, void ()** %x
|
|
call void @f6()
|
|
call void (void ()*, void ()*)* bitcast (void ()* @f7 to void (void ()*, void ()*)*)(void ()* @f8, void ()* @f9)
|
|
invoke void @f10() to label %exit unwind label %unwind
|
|
|
|
exit:
|
|
ret void ()* @f11
|
|
|
|
unwind:
|
|
%res = landingpad { i8*, i32 } personality i32 (...)* @__gxx_personality_v0
|
|
cleanup
|
|
resume { i8*, i32 } { i8* bitcast (void ()* @f12 to i8*), i32 42 }
|
|
}
|
|
|
|
@g = global void ()* @f1
|
|
@g1 = global [4 x void ()*] [void ()* @f2, void ()* @f3, void ()* @f4, void ()* @f5]
|
|
@g2 = global {i8, void ()*, i8} {i8 1, void ()* @f6, i8 2}
|
|
@h = constant void ()* @f7
|
|
|
|
define void @test2() {
|
|
; CHECK-LABEL: Call edges in function: test2
|
|
; CHECK-NEXT: -> f7
|
|
; CHECK-NEXT: -> f6
|
|
; CHECK-NEXT: -> f5
|
|
; CHECK-NEXT: -> f4
|
|
; CHECK-NEXT: -> f3
|
|
; CHECK-NEXT: -> f2
|
|
; CHECK-NEXT: -> f1
|
|
; CHECK-NOT: ->
|
|
|
|
load i8*, i8** bitcast (void ()** @g to i8**)
|
|
load i8*, i8** bitcast (void ()** getelementptr ([4 x void ()*]* @g1, i32 0, i32 2) to i8**)
|
|
load i8*, i8** bitcast (void ()** getelementptr ({i8, void ()*, i8}* @g2, i32 0, i32 1) to i8**)
|
|
load i8*, i8** bitcast (void ()** @h to i8**)
|
|
ret void
|
|
}
|
|
|
|
; Verify the SCCs formed.
|
|
;
|
|
; CHECK-LABEL: SCC with 1 functions:
|
|
; CHECK-NEXT: f7
|
|
;
|
|
; CHECK-LABEL: SCC with 1 functions:
|
|
; CHECK-NEXT: f6
|
|
;
|
|
; CHECK-LABEL: SCC with 1 functions:
|
|
; CHECK-NEXT: f5
|
|
;
|
|
; CHECK-LABEL: SCC with 1 functions:
|
|
; CHECK-NEXT: f4
|
|
;
|
|
; CHECK-LABEL: SCC with 1 functions:
|
|
; CHECK-NEXT: f3
|
|
;
|
|
; CHECK-LABEL: SCC with 1 functions:
|
|
; CHECK-NEXT: f2
|
|
;
|
|
; CHECK-LABEL: SCC with 1 functions:
|
|
; CHECK-NEXT: f1
|
|
;
|
|
; CHECK-LABEL: SCC with 1 functions:
|
|
; CHECK-NEXT: test2
|
|
;
|
|
; CHECK-LABEL: SCC with 1 functions:
|
|
; CHECK-NEXT: f12
|
|
;
|
|
; CHECK-LABEL: SCC with 1 functions:
|
|
; CHECK-NEXT: f11
|
|
;
|
|
; CHECK-LABEL: SCC with 1 functions:
|
|
; CHECK-NEXT: f10
|
|
;
|
|
; CHECK-LABEL: SCC with 1 functions:
|
|
; CHECK-NEXT: f9
|
|
;
|
|
; CHECK-LABEL: SCC with 1 functions:
|
|
; CHECK-NEXT: f8
|
|
;
|
|
; CHECK-LABEL: SCC with 1 functions:
|
|
; CHECK-NEXT: test1
|
|
;
|
|
; CHECK-LABEL: SCC with 1 functions:
|
|
; CHECK-NEXT: f
|
|
;
|
|
; CHECK-LABEL: SCC with 1 functions:
|
|
; CHECK-NEXT: test0
|