mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-24 03:33:20 +01:00
d0707ed2ba
LazyCallGraph. This is the start of the whole point of this different abstraction, but it is just the initial bits. Here is a run-down of what's going on here. I'm planning to incorporate some (or all) of this into comments going forward, hopefully with better editing and wording. =] The crux of the problem with the traditional way of building SCCs is that they are ephemeral. The new pass manager however really needs the ability to associate analysis passes and results of analysis passes with SCCs in order to expose these analysis passes to the SCC passes. Making this work is kind-of the whole point of the new pass manager. =] So, when we're building SCCs for the call graph, we actually want to build persistent nodes that stick around and can be reasoned about later. We'd also like the ability to walk the SCC graph in more complex ways than just the traditional postorder traversal of the current CGSCC walk. That means that in addition to being persistent, the SCCs need to be connected into a useful graph structure. However, we still want the SCCs to be formed lazily where possible. These constraints are quite hard to satisfy with the SCC iterator. Also, using that would bypass our ability to actually add data to the nodes of the call graph to facilite implementing the Tarjan walk. So I've re-implemented things in a more direct and embedded way. This immediately makes it easy to get the persistence and connectivity correct, and it also allows leveraging the existing nodes to simplify the algorithm. I've worked somewhat to make this implementation more closely follow the traditional paper's nomenclature and strategy, although it is still a bit obtuse because it isn't recursive, using an explicit stack and a tail call instead, and it is interruptable, resuming each time we need another SCC. The other tricky bit here, and what actually took almost all the time and trials and errors I spent building this, is exactly *what* graph structure to build for the SCCs. The naive thing to build is the call graph in its newly acyclic form. I wrote about 4 versions of this which did precisely this. Inevitably, when I experimented with them across various use cases, they became incredibly awkward. It was all implementable, but it felt like a complete wrong fit. Square peg, round hole. There were two overriding aspects that pushed me in a different direction: 1) We want to discover the SCC graph in a postorder fashion. That means the root node will be the *last* node we find. Using the call-SCC DAG as the graph structure of the SCCs results in an orphaned graph until we discover a root. 2) We will eventually want to walk the SCC graph in parallel, exploring distinct sub-graphs independently, and synchronizing at merge points. This again is not helped by the call-SCC DAG structure. The structure which, quite surprisingly, ended up being completely natural to use is the *inverse* of the call-SCC DAG. We add the leaf SCCs to the graph as "roots", and have edges to the caller SCCs. Once I switched to building this structure, everything just fell into place elegantly. Aside from general cleanups (there are FIXMEs and too few comments overall) that are still needed, the other missing piece of this is support for iterating across levels of the SCC graph. These will become useful for implementing #2, but they aren't an immediate priority. Once SCCs are in good shape, I'll be working on adding mutation support for incremental updates and adding the pass manager that this analysis enables. llvm-svn: 206581
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** bitcast (void ()** @g to i8**)
|
|
load i8** bitcast (void ()** getelementptr ([4 x void ()*]* @g1, i32 0, i32 2) to i8**)
|
|
load i8** bitcast (void ()** getelementptr ({i8, void ()*, i8}* @g2, i32 0, i32 1) to i8**)
|
|
load 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
|