serge-sans-paille
ed98c1b376
Cleanup includes: DebugInfo & CodeGen
...
Discourse thread: https://discourse.llvm.org/t/include-what-you-use-include-cleanup
Differential Revision: https://reviews.llvm.org/D121332
2022-03-12 17:26:40 +01:00
serge-sans-paille
59630917d6
Cleanup includes: Transform/Scalar
...
Estimated impact on preprocessor output line:
before: 1062981579
after: 1062494547
Discourse thread: https://discourse.llvm.org/t/include-what-you-use-include-cleanup
Differential Revision: https://reviews.llvm.org/D120817
2022-03-03 07:56:34 +01:00
Kazu Hirata
0b9a610a75
[Transforms] Use default member initialization in ConditionInfo (NFC)
2022-02-13 10:34:00 -08:00
Jingu Kang
4c98070cce
[LoopBoundSplit] Handle the case in which exiting block is loop header
...
Update the incoming value of phi nodes in header of post-loop correctly.
Differential Revision: https://reviews.llvm.org/D110060
2021-10-08 09:13:41 +01:00
Jingu Kang
4288b6520a
[LoopBoundSplit] Use SCEVAddRecExpr instead of SCEV for AddRecSCEV (NFC)
...
Differential Revision: https://reviews.llvm.org/D109682
2021-10-04 10:17:44 +01:00
Jingu Kang
2a26d47a2d
[LoopBoundSplit] Check the start value of split cond AddRec
...
After transformation, we assume the split condition of the pre-loop is always
true. In order to guarantee it, we need to check the start value of the split
cond AddRec satisfies the split condition.
Differential Revision: https://reviews.llvm.org/D109354
2021-09-13 10:32:35 +01:00
Jingu Kang
562521e2d1
[LoopBoundSplit] Update phi node in exit block
...
It fixes https://bugs.llvm.org/show_bug.cgi?id=51700
Differential Revision:
2021-09-03 09:10:50 +01:00
Jingu Kang
8eee02020b
[LoopBoundSplit] Ignore phi node which is not scevable
...
There was a bug in LoopBoundSplit. The pass should ignore phi node which is not
scevable.
Differential Revision: https://reviews.llvm.org/D103913
2021-06-09 09:44:36 +01:00
Jingu Kang
a2a0ac42ab
[SimpleLoopBoundSplit] Split Bound of Loop which has conditional branch with IV
...
This pass transforms loops that contain a conditional branch with induction
variable. For example, it transforms left code to right code:
newbound = min(n, c)
while (iv < n) { while(iv < newbound) {
A A
if (iv < c) B
B C
C }
} if (iv != n) {
while (iv < n) {
A
C
}
}
Differential Revision: https://reviews.llvm.org/D102234
2021-06-07 10:55:25 +01:00
