mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-19 11:02:59 +02:00
502475d4f3
There was an efficiency problem with how we processed @llvm.assume in ValueTracking (and other places). The AssumptionCache tracked all of the assumptions in a given function. In order to find assumptions relevant to computing known bits, etc. we searched every assumption in the function. For ValueTracking, that means that we did O(#assumes * #values) work in InstCombine and other passes (with a constant factor that can be quite large because we'd repeat this search at every level of recursion of the analysis). Several of us discussed this situation at the last developers' meeting, and this implements the discussed solution: Make the values that an assume might affect operands of the assume itself. To avoid exposing this detail to frontends and passes that need not worry about it, I've used the new operand-bundle feature to add these extra call "operands" in a way that does not affect the intrinsic's signature. I think this solution is relatively clean. InstCombine adds these extra operands based on what ValueTracking, LVI, etc. will need and then those passes need only search the users of the values under consideration. This should fix the computational-complexity problem. At this point, no passes depend on the AssumptionCache, and so I'll remove that as a follow-up change. Differential Revision: https://reviews.llvm.org/D27259 llvm-svn: 289755 |
||
|---|---|---|
| .. | ||
| 2010-09-02-Trunc.ll | ||
| 2010-09-26-MergeConstantRange.ll | ||
| add.ll | ||
| alloca.ll | ||
| ashr.ll | ||
| basic.ll | ||
| conflict.ll | ||
| crash.ll | ||
| guards.ll | ||
| icmp.ll | ||
| non-null.ll | ||
| range.ll | ||
| sdiv.ll | ||
| select.ll | ||
| srem.ll | ||