mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 19:23:23 +01:00
99ee90db82
Currently, this pass only focuses on *trivial* loop unswitching. At that reduced problem it remains significantly better than the current loop unswitch: - Old pass is worse than cubic complexity. New pass is (I think) linear. - New pass is much simpler in its design by focusing on full unswitching. (See below for details on this). - New pass doesn't carry state for thresholds between pass iterations. - New pass doesn't carry state for correctness (both miscompile and infloop) between pass iterations. - New pass produces substantially better code after unswitching. - New pass can handle more trivial unswitch cases. - New pass doesn't recompute the dominator tree for the entire function and instead incrementally updates it. I've ported all of the trivial unswitching test cases from the old pass to the new one to make sure that major functionality isn't lost in the process. For several of the test cases I've worked to improve the precision and rigor of the CHECKs, but for many I've just updated them to handle the new IR produced. My initial motivation was the fact that the old pass carried state in very unreliable ways between pass iterations, and these mechansims were incompatible with the new pass manager. However, I discovered many more improvements to make along the way. This pass makes two very significant assumptions that enable most of these improvements: 1) Focus on *full* unswitching -- that is, completely removing whatever control flow construct is being unswitched from the loop. In the case of trivial unswitching, this means removing the trivial (exiting) edge. In non-trivial unswitching, this means removing the branch or switch itself. This is in opposition to *partial* unswitching where some part of the unswitched control flow remains in the loop. Partial unswitching only really applies to switches and to folded branches. These are very similar to full unrolling and partial unrolling. The full form is an effective canonicalization, the partial form needs a complex cost model, cannot be iterated, isn't canonicalizing, and should be a separate pass that runs very late (much like unrolling). 2) Leverage LLVM's Loop machinery to the fullest. The original unswitch dates from a time when a great deal of LLVM's loop infrastructure was missing, ineffective, and/or unreliable. As a consequence, a lot of complexity was added which we no longer need. With these two overarching principles, I think we can build a fast and effective unswitcher that fits in well in the new PM and in the canonicalization pipeline. Some of the remaining functionality around partial unswitching may not be relevant today (not many test cases or benchmarks I can find) but if they are I'd like to add support for them as a separate layer that runs very late in the pipeline. Purely to make reviewing and introducing this code more manageable, I've split this into first a trivial-unswitch-only pass and in the next patch I'll add support for full non-trivial unswitching against a *fixed* threshold, exactly like full unrolling. I even plan to re-use the unrolling thresholds, as these are incredibly similar cost tradeoffs: we're cloning a loop body in order to end up with simplified control flow. We should only do that when the total growth is reasonably small. One of the biggest changes with this pass compared to the previous one is that previously, each individual trivial exiting edge from a switch was unswitched separately as a branch. Now, we unswitch the entire switch at once, with cases going to the various destinations. This lets us unswitch multiple exiting edges in a single operation and also avoids numerous extremely bad behaviors, where we would introduce 1000s of branches to test for thousands of possible values, all of which would take the exact same exit path bypassing the loop. Now we will use a switch with 1000s of cases that can be efficiently lowered into a jumptable. This avoids relying on somehow forming a switch out of the branches or getting horrible code if that fails for any reason. Another significant change is that this pass actively updates the CFG based on unswitching. For trivial unswitching, this is actually very easy because of the definition of loop simplified form. Doing this makes the code coming out of loop unswitch dramatically more friendly. We still should run loop-simplifycfg (at the least) after this to clean up, but it will have to do a lot less work. Finally, this pass makes much fewer attempts to simplify instructions based on the unswitch. Something like loop-instsimplify, instcombine, or GVN can be used to do increasingly powerful simplifications based on the now dominating predicate. The old simplifications are things that something like loop-instsimplify should get today or a very, very basic loop-instcombine could get. Keeping that logic separate is a big simplifying technique. Most of the code in this pass that isn't in the old one has to do with achieving specific goals: - Updating the dominator tree as we go - Unswitching all cases in a switch in a single step. I think it is still shorter than just the trivial unswitching code in the old pass despite having this functionality. Differential Revision: https://reviews.llvm.org/D32409 llvm-svn: 301576
67 lines
2.4 KiB
LLVM
67 lines
2.4 KiB
LLVM
; RUN: opt < %s -simple-loop-unswitch -disable-output
|
|
|
|
define void @test1(i32* %S2) {
|
|
entry:
|
|
br i1 false, label %list_Length.exit, label %cond_true.i
|
|
cond_true.i: ; preds = %entry
|
|
ret void
|
|
list_Length.exit: ; preds = %entry
|
|
br i1 false, label %list_Length.exit9, label %cond_true.i5
|
|
cond_true.i5: ; preds = %list_Length.exit
|
|
ret void
|
|
list_Length.exit9: ; preds = %list_Length.exit
|
|
br i1 false, label %bb78, label %return
|
|
bb44: ; preds = %bb78, %cond_next68
|
|
br i1 %tmp49.not, label %bb62, label %bb62.loopexit
|
|
bb62.loopexit: ; preds = %bb44
|
|
br label %bb62
|
|
bb62: ; preds = %bb62.loopexit, %bb44
|
|
br i1 false, label %return.loopexit, label %cond_next68
|
|
cond_next68: ; preds = %bb62
|
|
br i1 false, label %return.loopexit, label %bb44
|
|
bb78: ; preds = %list_Length.exit9
|
|
%tmp49.not = icmp eq i32* %S2, null ; <i1> [#uses=1]
|
|
br label %bb44
|
|
return.loopexit: ; preds = %cond_next68, %bb62
|
|
%retval.0.ph = phi i32 [ 1, %cond_next68 ], [ 0, %bb62 ] ; <i32> [#uses=1]
|
|
br label %return
|
|
return: ; preds = %return.loopexit, %list_Length.exit9
|
|
%retval.0 = phi i32 [ 0, %list_Length.exit9 ], [ %retval.0.ph, %return.loopexit ] ; <i32> [#uses=0]
|
|
ret void
|
|
}
|
|
|
|
define void @test2() nounwind {
|
|
entry:
|
|
br label %bb.nph
|
|
|
|
bb.nph: ; preds = %entry
|
|
%and.i13521 = and <4 x i1> undef, undef ; <<4 x i1>> [#uses=1]
|
|
br label %for.body
|
|
|
|
for.body: ; preds = %for.body, %bb.nph
|
|
%or.i = select <4 x i1> %and.i13521, <4 x i32> undef, <4 x i32> undef ; <<4 x i32>> [#uses=0]
|
|
br i1 false, label %for.body, label %for.end
|
|
|
|
for.end: ; preds = %for.body, %entry
|
|
ret void
|
|
}
|
|
|
|
; PR6879
|
|
define i32* @test3(i32** %p_45, i16 zeroext %p_46, i64 %p_47, i64 %p_48, i16 signext %p_49) nounwind {
|
|
entry:
|
|
br label %for.cond
|
|
|
|
for.cond: ; preds = %for.cond4, %entry
|
|
br i1 false, label %for.cond4, label %for.end88
|
|
|
|
for.cond4: ; preds = %for.cond
|
|
%conv46 = trunc i32 0 to i8 ; <i8> [#uses=2]
|
|
%cmp60 = icmp sgt i8 %conv46, 124 ; <i1> [#uses=1]
|
|
%or.cond = and i1 undef, %cmp60 ; <i1> [#uses=1]
|
|
%cond = select i1 %or.cond, i8 %conv46, i8 undef ; <i8> [#uses=0]
|
|
br label %for.cond
|
|
|
|
for.end88: ; preds = %for.cond
|
|
ret i32* undef
|
|
}
|