Go to the source code of this file.
|
| | llvm |
| | Compute iterated dominance frontiers using a linear time algorithm.
|
| |
| #define HANDLE_MDNODE_LEAF_UNIQUABLE |
( |
|
CLASS | ) |
|
Value:for (
auto *
I : CLASS##s)
\
| #define HANDLE_MDNODE_LEAF_UNIQUABLE |
( |
|
CLASS | ) |
|
Value:for (CLASS *
I : CLASS##s) \
Singleton instance of the OptBisect class.
This singleton is accessed via the LLVMContext::getOptBisect() function. It provides a mechanism to disable passes and individual optimizations at compile time based on a command line option (-opt-bisect-limit) in order to perform a bisecting search for optimization-related problems.
Even if multiple LLVMContext objects are created, they will all return the same instance of OptBisect in order to provide a single bisect count. Any code that uses the OptBisect object should be serialized when bisection is enabled in order to enable a consistent bisect count.
Definition at line 249 of file LLVMContextImpl.cpp.
Referenced by llvm::LLVMContextImpl::getOptBisect().