#include "llvm/ADT/ArrayRef.h"
#include "llvm/ADT/BitmaskEnum.h"
#include "llvm/ADT/None.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/ADT/StringRef.h"
#include "llvm/IR/Metadata.h"
#include "llvm/Support/Casting.h"
#include "llvm/Support/Dwarf.h"
#include <cassert>
#include <climits>
#include <cstddef>
#include <cstdint>
#include <iterator>
#include <type_traits>
#include <vector>
#include "llvm/IR/DebugInfoFlags.def"
Go to the source code of this file.
|
| | llvm |
| | Compute iterated dominance frontiers using a linear time algorithm.
|
| |
| #define DEFINE_MDNODE_GET |
( |
|
CLASS, |
|
|
|
FORMAL, |
|
|
|
ARGS |
|
) |
| |
Value:
} \
static CLASS *getIfExists(LLVMContext &
Context, \
false); \
static LazyValueInfoImpl & getImpl(void *&PImpl, AssumptionCache *AC, const DataLayout *DL, DominatorTree *DT=nullptr)
This lazily constructs the LazyValueInfoImpl.
Definition at line 46 of file DebugInfoMetadata.h.
| #define DEFINE_MDNODE_GET_DISTINCT_TEMPORARY |
( |
|
CLASS, |
|
|
|
FORMAL, |
|
|
|
ARGS |
|
) |
| |
Value:static CLASS *getDistinct(LLVMContext &
Context, \
} \
static Temp##CLASS getTemporary(LLVMContext &Context, \
return Temp##CLASS( \
}
static LazyValueInfoImpl & getImpl(void *&PImpl, AssumptionCache *AC, const DataLayout *DL, DominatorTree *DT=nullptr)
This lazily constructs the LazyValueInfoImpl.
Definition at line 36 of file DebugInfoMetadata.h.
| #define DEFINE_MDNODE_GET_UNPACK_IMPL |
( |
|
... | ) |
__VA_ARGS__ |
| #define DI_FLAG_LARGEST_NEEDED |
| #define HANDLE_DI_FLAG |
( |
|
ID, |
|
|
|
NAME |
|
) |
| Flag##NAME = ID, |