name string | code string | asm string | file string |
|---|---|---|---|
llvm::GraphWriter<llvm::AttributorCallGraph*>::emitEdge(void const*, int, void const*, int, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const&) | void emitEdge(const void *SrcNodeID, int SrcNodePort,
const void *DestNodeID, int DestNodePort,
const std::string &Attrs) {
if (SrcNodePort > 64) return; // Eminating from truncated part?
if (DestNodePort > 64) DestNodePort = 64; // Targeting the truncated part?
... | subq $0x38, %rsp
movq %rdi, 0x30(%rsp)
movq %rsi, 0x28(%rsp)
movl %edx, 0x24(%rsp)
movq %rcx, 0x18(%rsp)
movl %r8d, 0x14(%rsp)
movq %r9, 0x8(%rsp)
movq 0x30(%rsp), %rax
movq %rax, (%rsp)
cmpl $0x40, 0x24(%rsp)
jle 0x46b4626
jmp 0x46b471c
cmpl $0x40, 0x14(%rsp)
jle 0x46b4635
movl $0x40, 0x14(%rsp)
movq (%rsp), %rax
movq... | /llvm/Support/GraphWriter.h |
llvm::DenseMapIterator<llvm::PointerIntPair<llvm::Value*, 2u, (anonymous namespace)::IPOGrouping, llvm::PointerLikeTypeTraits<llvm::Value*>, llvm::PointerIntPairInfo<llvm::Value*, 2u, llvm::PointerLikeTypeTraits<llvm::Value*>>>, (anonymous namespace)::CVPLatticeVal, llvm::DenseMapInfo<llvm::PointerIntPair<llvm::Value*,... | void AdvancePastEmptyBuckets() {
assert(Ptr <= End);
const KeyT Empty = KeyInfoT::getEmptyKey();
const KeyT Tombstone = KeyInfoT::getTombstoneKey();
while (Ptr != End && (KeyInfoT::isEqual(Ptr->getFirst(), Empty) ||
KeyInfoT::isEqual(Ptr->getFirst(), Tombstone)))
++Ptr;
... | subq $0x28, %rsp
movq %rdi, 0x20(%rsp)
movq 0x20(%rsp), %rax
movq %rax, 0x8(%rsp)
callq 0x46bcd60
movq %rax, 0x18(%rsp)
callq 0x46bce20
movq %rax, 0x10(%rsp)
movq 0x8(%rsp), %rdx
movq (%rdx), %rcx
xorl %eax, %eax
cmpq 0x8(%rdx), %rcx
movb %al, 0x7(%rsp)
je 0x46c0868
movq 0x8(%rsp), %rax
movq (%rax), %rdi
callq 0x46bcd3... | /llvm/ADT/DenseMap.h |
llvm::DenseMap<llvm::Constant*, llvm::GlobalVariable*, llvm::DenseMapInfo<llvm::Constant*, void>, llvm::detail::DenseMapPair<llvm::Constant*, llvm::GlobalVariable*>>::shrink_and_clear() | void shrink_and_clear() {
unsigned OldNumBuckets = NumBuckets;
unsigned OldNumEntries = NumEntries;
this->destroyAll();
// Reduce the number of buckets.
unsigned NewNumBuckets = 0;
if (OldNumEntries)
NewNumBuckets = std::max(64, 1 << (Log2_32_Ceil(OldNumEntries) + 1));
if (NewNumBucke... | subq $0x28, %rsp
movq %rdi, 0x20(%rsp)
movq 0x20(%rsp), %rdi
movq %rdi, (%rsp)
movl 0x10(%rdi), %eax
movl %eax, 0x1c(%rsp)
movl 0x8(%rdi), %eax
movl %eax, 0x18(%rsp)
callq 0x46c2d60
movl $0x0, 0x14(%rsp)
cmpl $0x0, 0x18(%rsp)
je 0x46c2d1a
movl $0x40, 0x10(%rsp)
movl 0x18(%rsp), %edi
callq 0x91b7e0
movl %eax, %ecx
addl ... | /llvm/ADT/DenseMap.h |
llvm::DenseMapBase<llvm::DenseMap<llvm::Constant*, llvm::GlobalVariable*, llvm::DenseMapInfo<llvm::Constant*, void>, llvm::detail::DenseMapPair<llvm::Constant*, llvm::GlobalVariable*>>, llvm::Constant*, llvm::GlobalVariable*, llvm::DenseMapInfo<llvm::Constant*, void>, llvm::detail::DenseMapPair<llvm::Constant*, llvm::G... | void destroyAll() {
if (getNumBuckets() == 0) // Nothing to do.
return;
const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey();
for (BucketT *P = getBuckets(), *E = getBucketsEnd(); P != E; ++P) {
if (!KeyInfoT::isEqual(P->getFirst(), EmptyKey) &&
!KeyInfoT::isEqual(P->... | subq $0x38, %rsp
movq %rdi, 0x30(%rsp)
movq 0x30(%rsp), %rdi
movq %rdi, 0x8(%rsp)
callq 0x46c1cf0
cmpl $0x0, %eax
jne 0x46c2d82
jmp 0x46c2e1a
callq 0x46c1c30
movq %rax, 0x28(%rsp)
callq 0x46c20f0
movq 0x8(%rsp), %rdi
movq %rax, 0x20(%rsp)
callq 0x46c1c40
movq 0x8(%rsp), %rdi
movq %rax, 0x18(%rsp)
callq 0x46c1c50
movq %... | /llvm/ADT/DenseMap.h |
llvm::cl::opt<llvm::ExpandVariadicsMode, false, llvm::cl::parser<llvm::ExpandVariadicsMode>>::printOptionValue(unsigned long, bool) const | void printOptionValue(size_t GlobalWidth, bool Force) const override {
if (Force || !this->getDefault().compare(this->getValue())) {
cl::printOptionDiff<ParserClass>(*this, Parser, this->getValue(),
this->getDefault(), GlobalWidth);
}
} | subq $0x38, %rsp
movb %dl, %al
movq %rdi, 0x30(%rsp)
movq %rsi, 0x28(%rsp)
andb $0x1, %al
movb %al, 0x27(%rsp)
movq 0x30(%rsp), %rax
movq %rax, 0x10(%rsp)
movb $0x1, %al
testb $0x1, 0x27(%rsp)
movb %al, 0x1b(%rsp)
jne 0x46cf76d
movq 0x10(%rsp), %rdi
addq $0x80, %rdi
callq 0x46cfe20
movq 0x10(%rsp), %rdi
movq %rax, 0x8(... | /llvm/Support/CommandLine.h |
(anonymous namespace)::ExpandVariadics::ExpandedCallFrame::initializeStructAlloca(llvm::DataLayout const&, llvm::IRBuilder<llvm::ConstantFolder, llvm::IRBuilderDefaultInserter>&, llvm::AllocaInst*) | void initializeStructAlloca(const DataLayout &DL, IRBuilder<> &Builder,
AllocaInst *Alloced) {
StructType *VarargsTy = cast<StructType>(Alloced->getAllocatedType());
for (size_t I = 0; I < size(); I++) {
auto [V, bytes, tag] = Source[I];
if (tag == Padding... | subq $0x108, %rsp # imm = 0x108
movq %rdi, 0x100(%rsp)
movq %rsi, 0xf8(%rsp)
movq %rdx, 0xf0(%rsp)
movq %rcx, 0xe8(%rsp)
movq 0x100(%rsp), %rax
movq %rax, 0x68(%rsp)
movq 0xe8(%rsp), %rdi
callq 0xa80da0
movq %rax, %rdi
callq 0x7840d0
movq %rax, 0xe0(%rsp)
movq $0x0, 0xd8(%rsp)
movq 0x68(%rsp), %rdi
movq 0xd8... | /Transforms/IPO/ExpandVariadics.cpp |
llvm::DenseMapBase<llvm::DenseMap<llvm::ValueInfo, llvm::FunctionSummary*, llvm::DenseMapInfo<llvm::ValueInfo, void>, llvm::detail::DenseMapPair<llvm::ValueInfo, llvm::FunctionSummary*>>, llvm::ValueInfo, llvm::FunctionSummary*, llvm::DenseMapInfo<llvm::ValueInfo, void>, llvm::detail::DenseMapPair<llvm::ValueInfo, llvm... | void initEmpty() {
setNumEntries(0);
setNumTombstones(0);
assert((getNumBuckets() & (getNumBuckets()-1)) == 0 &&
"# initial buckets must be a power of two!");
const KeyT EmptyKey = getEmptyKey();
for (BucketT *B = getBuckets(), *E = getBucketsEnd(); B != E; ++B)
::new (&B->getFirst... | subq $0x28, %rsp
movq %rdi, 0x20(%rsp)
movq 0x20(%rsp), %rdi
movq %rdi, (%rsp)
xorl %esi, %esi
callq 0x46da9e0
movq (%rsp), %rdi
xorl %esi, %esi
callq 0x46daa00
callq 0x46da320
movq (%rsp), %rdi
movq %rax, 0x18(%rsp)
callq 0x46daa20
movq (%rsp), %rdi
movq %rax, 0x10(%rsp)
callq 0x46daa30
movq %rax, 0x8(%rsp)
movq 0x10(... | /llvm/ADT/DenseMap.h |
llvm::DenseMapBase<llvm::DenseMap<llvm::ValueInfo, llvm::FunctionSummary*, llvm::DenseMapInfo<llvm::ValueInfo, void>, llvm::detail::DenseMapPair<llvm::ValueInfo, llvm::FunctionSummary*>>, llvm::ValueInfo, llvm::FunctionSummary*, llvm::DenseMapInfo<llvm::ValueInfo, void>, llvm::detail::DenseMapPair<llvm::ValueInfo, llvm... | void moveFromOldBuckets(BucketT *OldBucketsBegin, BucketT *OldBucketsEnd) {
initEmpty();
// Insert all the old elements.
const KeyT EmptyKey = getEmptyKey();
const KeyT TombstoneKey = getTombstoneKey();
for (BucketT *B = OldBucketsBegin, *E = OldBucketsEnd; B != E; ++B) {
if (!KeyInfoT::isEqu... | subq $0x88, %rsp
movq %rdi, 0x80(%rsp)
movq %rsi, 0x78(%rsp)
movq %rdx, 0x70(%rsp)
movq 0x80(%rsp), %rdi
movq %rdi, 0x18(%rsp)
callq 0x46da7f0
callq 0x46da320
movq %rax, 0x68(%rsp)
callq 0x46da330
movq %rax, 0x60(%rsp)
movq 0x78(%rsp), %rax
movq %rax, 0x58(%rsp)
movq 0x70(%rsp), %rax
movq %rax, 0x50(%rsp)
movq 0x58(%rs... | /llvm/ADT/DenseMap.h |
llvm::DenseMapBase<llvm::DenseMap<llvm::LazyCallGraph::RefSCC*, int, llvm::DenseMapInfo<llvm::LazyCallGraph::RefSCC*, void>, llvm::detail::DenseMapPair<llvm::LazyCallGraph::RefSCC*, int>>, llvm::LazyCallGraph::RefSCC*, int, llvm::DenseMapInfo<llvm::LazyCallGraph::RefSCC*, void>, llvm::detail::DenseMapPair<llvm::LazyCal... | iterator find(const_arg_type_t<KeyT> Val) {
BucketT *TheBucket;
if (LookupBucketFor(Val, TheBucket))
return makeIterator(TheBucket,
shouldReverseIterate<KeyT>() ? getBuckets()
: getBucketsEnd(),
*thi... | subq $0x48, %rsp
movq %rdi, 0x30(%rsp)
movq %rsi, 0x28(%rsp)
movq 0x30(%rsp), %rdi
movq %rdi, 0x18(%rsp)
leaq 0x28(%rsp), %rsi
leaq 0x20(%rsp), %rdx
callq 0x46dbc00
testb $0x1, %al
jne 0x46dbb2d
jmp 0x46dbb8b
movq 0x20(%rsp), %rax
movq %rax, 0x10(%rsp)
callq 0x46dbd30
testb $0x1, %al
jne 0x46dbb42
jmp 0x46dbb53
movq 0x... | /llvm/ADT/DenseMap.h |
bool llvm::DenseMapBase<llvm::DenseMap<llvm::LazyCallGraph::RefSCC*, int, llvm::DenseMapInfo<llvm::LazyCallGraph::RefSCC*, void>, llvm::detail::DenseMapPair<llvm::LazyCallGraph::RefSCC*, int>>, llvm::LazyCallGraph::RefSCC*, int, llvm::DenseMapInfo<llvm::LazyCallGraph::RefSCC*, void>, llvm::detail::DenseMapPair<llvm::La... | bool LookupBucketFor(const LookupKeyT &Val,
const BucketT *&FoundBucket) const {
const BucketT *BucketsPtr = getBuckets();
const unsigned NumBuckets = getNumBuckets();
if (NumBuckets == 0) {
FoundBucket = nullptr;
return false;
}
// FoundTombstone - Keep track of... | subq $0x78, %rsp
movq %rdi, 0x68(%rsp)
movq %rsi, 0x60(%rsp)
movq %rdx, 0x58(%rsp)
movq 0x68(%rsp), %rdi
movq %rdi, 0x18(%rsp)
callq 0x46dbf40
movq 0x18(%rsp), %rdi
movq %rax, 0x50(%rsp)
callq 0x4470d00
movl %eax, 0x4c(%rsp)
cmpl $0x0, 0x4c(%rsp)
jne 0x46dbdf2
movq 0x58(%rsp), %rax
movq $0x0, (%rax)
movb $0x0, 0x77(%rs... | /llvm/ADT/DenseMap.h |
createSCCNodeSet(llvm::ArrayRef<llvm::Function*>) | static SCCNodesResult createSCCNodeSet(ArrayRef<Function *> Functions) {
SCCNodesResult Res;
Res.HasUnknownCall = false;
for (Function *F : Functions) {
if (!F || F->hasOptNone() || F->hasFnAttribute(Attribute::Naked) ||
F->isPresplitCoroutine()) {
// Treat any function we're trying not to optim... | subq $0xe8, %rsp
movq %rdi, 0x8(%rsp)
movq %rdi, %rax
movq %rax, (%rsp)
movq %rdi, 0xe0(%rsp)
movq %rsi, 0xd0(%rsp)
movq %rdx, 0xd8(%rsp)
movb $0x0, 0xcf(%rsp)
callq 0x46de840
movq 0x8(%rsp), %rdi
movb $0x0, 0x68(%rdi)
leaq 0xd0(%rsp), %rax
movq %rax, 0xc0(%rsp)
movq 0xc0(%rsp), %rdi
callq 0x30dc050
movq %rax, 0xb8(%rs... | /Transforms/IPO/FunctionAttrs.cpp |
addWillReturn(llvm::SmallSetVector<llvm::Function*, 8u> const&, llvm::SmallSet<llvm::Function*, 8u, std::less<llvm::Function*>>&) | static void addWillReturn(const SCCNodeSet &SCCNodes,
SmallSet<Function *, 8> &Changed) {
for (Function *F : SCCNodes) {
if (!F || F->willReturn() || !functionWillReturn(*F))
continue;
F->setWillReturn();
NumWillReturn++;
Changed.insert(F);
}
} | subq $0x48, %rsp
movq %rdi, 0x40(%rsp)
movq %rsi, 0x38(%rsp)
movq 0x40(%rsp), %rax
movq %rax, 0x30(%rsp)
movq 0x30(%rsp), %rdi
callq 0x4601630
movq %rax, 0x28(%rsp)
movq 0x30(%rsp), %rdi
callq 0x4601650
movq %rax, 0x20(%rsp)
movq 0x28(%rsp), %rax
cmpq 0x20(%rsp), %rax
je 0x46dddef
movq 0x28(%rsp), %rax
movq (%rax), %ra... | /Transforms/IPO/FunctionAttrs.cpp |
llvm::scc_iterator<(anonymous namespace)::ArgumentGraph*, llvm::GraphTraits<(anonymous namespace)::ArgumentGraph*>>::GetNextSCC() | void scc_iterator<GraphT, GT>::GetNextSCC() {
CurrentSCC.clear(); // Prepare to compute the next SCC
while (!VisitStack.empty()) {
DFSVisitChildren();
// Pop the leaf on top of the VisitStack.
NodeRef visitingN = VisitStack.back().Node;
unsigned minVisitNum = VisitStack.back().MinVisited;
asser... | subq $0x38, %rsp
movq %rdi, 0x30(%rsp)
movq 0x30(%rsp), %rdi
movq %rdi, 0x18(%rsp)
addq $0x38, %rdi
callq 0x46e33a0
movq 0x18(%rsp), %rdi
addq $0x50, %rdi
callq 0x46e33c0
xorb $-0x1, %al
testb $0x1, %al
jne 0x46e1535
jmp 0x46e1665
movq 0x18(%rsp), %rdi
callq 0x46e3410
movq 0x18(%rsp), %rdi
addq $0x50, %rdi
callq 0x46e2... | /llvm/ADT/SCCIterator.h |
llvm::DenseMapBase<llvm::DenseMap<unsigned long, std::tuple<unsigned int, llvm::GlobalValueSummary const*, std::unique_ptr<llvm::FunctionImporter::ImportFailureInfo, std::default_delete<llvm::FunctionImporter::ImportFailureInfo>>>, llvm::DenseMapInfo<unsigned long, void>, llvm::detail::DenseMapPair<unsigned long, std::... | iterator makeIterator(BucketT *P, BucketT *E,
DebugEpochBase &Epoch,
bool NoAdvance=false) {
if (shouldReverseIterate<KeyT>()) {
BucketT *B = P == getBucketsEnd() ? getBuckets() : P + 1;
return iterator(B, E, Epoch, NoAdvance);
}
return iterator(P,... | subq $0x58, %rsp
movb %r8b, %al
movq %rdi, 0x40(%rsp)
movq %rsi, 0x38(%rsp)
movq %rdx, 0x30(%rsp)
movq %rcx, 0x28(%rsp)
andb $0x1, %al
movb %al, 0x27(%rsp)
movq 0x40(%rsp), %rax
movq %rax, 0x10(%rsp)
callq 0x903c70
testb $0x1, %al
jne 0x46f4426
jmp 0x46f4492
movq 0x10(%rsp), %rdi
movq 0x38(%rsp), %rax
movq %rax, 0x8(%r... | /llvm/ADT/DenseMap.h |
llvm::DenseMap<unsigned long, std::tuple<unsigned int, llvm::GlobalValueSummary const*, std::unique_ptr<llvm::FunctionImporter::ImportFailureInfo, std::default_delete<llvm::FunctionImporter::ImportFailureInfo>>>, llvm::DenseMapInfo<unsigned long, void>, llvm::detail::DenseMapPair<unsigned long, std::tuple<unsigned int,... | bool allocateBuckets(unsigned Num) {
NumBuckets = Num;
if (NumBuckets == 0) {
Buckets = nullptr;
return false;
}
Buckets = static_cast<BucketT *>(
allocate_buffer(sizeof(BucketT) * NumBuckets, alignof(BucketT)));
return true;
} | subq $0x28, %rsp
movq %rdi, 0x18(%rsp)
movl %esi, 0x14(%rsp)
movq 0x18(%rsp), %rax
movq %rax, 0x8(%rsp)
movl 0x14(%rsp), %ecx
movl %ecx, 0x10(%rax)
cmpl $0x0, 0x10(%rax)
jne 0x46f4d07
movq 0x8(%rsp), %rax
movq $0x0, (%rax)
movb $0x0, 0x27(%rsp)
jmp 0x46f4d2f
movq 0x8(%rsp), %rax
movl 0x10(%rax), %eax
movl %eax, %edi
sh... | /llvm/ADT/DenseMap.h |
OptimizeAwayTrappingUsesOfLoads(llvm::GlobalVariable*, llvm::Constant*, llvm::DataLayout const&, llvm::function_ref<llvm::TargetLibraryInfo& (llvm::Function&)>) | static bool OptimizeAwayTrappingUsesOfLoads(
GlobalVariable *GV, Constant *LV, const DataLayout &DL,
function_ref<TargetLibraryInfo &(Function &)> GetTLI) {
bool Changed = false;
// Keep track of whether we are able to remove all the uses of the global
// other than the store that defines it.
bool AllN... | subq $0x98, %rsp
movq %rcx, 0x88(%rsp)
movq %r8, 0x90(%rsp)
movq %rdi, 0x80(%rsp)
movq %rsi, 0x78(%rsp)
movq %rdx, 0x70(%rsp)
movb $0x0, 0x6f(%rsp)
movb $0x1, 0x6e(%rsp)
movq 0x80(%rsp), %rdi
callq 0x7ba270
movq %rax, 0x40(%rsp)
movq %rdx, 0x48(%rsp)
leaq 0x40(%rsp), %rdi
callq 0x1f7f5f0
movq %rax, 0x50(%rsp)
movq %rdx... | /Transforms/IPO/GlobalOpt.cpp |
llvm::DenseMapBase<llvm::SmallDenseMap<llvm::Function*, bool, 8u, llvm::DenseMapInfo<llvm::Function*, void>, llvm::detail::DenseMapPair<llvm::Function*, bool>>, llvm::Function*, bool, llvm::DenseMapInfo<llvm::Function*, void>, llvm::detail::DenseMapPair<llvm::Function*, bool>>::destroyAll() | void destroyAll() {
if (getNumBuckets() == 0) // Nothing to do.
return;
const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey();
for (BucketT *P = getBuckets(), *E = getBucketsEnd(); P != E; ++P) {
if (!KeyInfoT::isEqual(P->getFirst(), EmptyKey) &&
!KeyInfoT::isEqual(P->... | subq $0x38, %rsp
movq %rdi, 0x30(%rsp)
movq 0x30(%rsp), %rdi
movq %rdi, 0x8(%rsp)
callq 0x470ea50
cmpl $0x0, %eax
jne 0x471cef2
jmp 0x471cf8a
callq 0x470e920
movq %rax, 0x28(%rsp)
callq 0x471c110
movq 0x8(%rsp), %rdi
movq %rax, 0x20(%rsp)
callq 0x470e930
movq 0x8(%rsp), %rdi
movq %rax, 0x18(%rsp)
callq 0x470e940
movq %... | /llvm/ADT/DenseMap.h |
llvm::SmallDenseMap<llvm::Function*, bool, 8u, llvm::DenseMapInfo<llvm::Function*, void>, llvm::detail::DenseMapPair<llvm::Function*, bool>>::deallocateBuckets() | void deallocateBuckets() {
if (Small)
return;
deallocate_buffer(getLargeRep()->Buckets,
sizeof(BucketT) * getLargeRep()->NumBuckets,
alignof(BucketT));
getLargeRep()->~LargeRep();
} | subq $0x18, %rsp
movq %rdi, 0x10(%rsp)
movq 0x10(%rsp), %rax
movq %rax, 0x8(%rsp)
movl (%rax), %eax
andl $0x1, %eax
cmpl $0x0, %eax
je 0x471cfaf
jmp 0x471cfeb
movq 0x8(%rsp), %rdi
callq 0x470e800
movq 0x8(%rsp), %rdi
movq (%rax), %rax
movq %rax, (%rsp)
callq 0x470e800
movq (%rsp), %rdi
movl 0x8(%rax), %eax
movl %eax, %... | /llvm/ADT/DenseMap.h |
llvm::DenseMapIterator<llvm::GlobalVariable*, llvm::Constant*, llvm::DenseMapInfo<llvm::GlobalVariable*, void>, llvm::detail::DenseMapPair<llvm::GlobalVariable*, llvm::Constant*>, false>::RetreatPastEmptyBuckets() | void RetreatPastEmptyBuckets() {
assert(Ptr >= End);
const KeyT Empty = KeyInfoT::getEmptyKey();
const KeyT Tombstone = KeyInfoT::getTombstoneKey();
while (Ptr != End && (KeyInfoT::isEqual(Ptr[-1].getFirst(), Empty) ||
KeyInfoT::isEqual(Ptr[-1].getFirst(), Tombstone)))
-... | subq $0x28, %rsp
movq %rdi, 0x20(%rsp)
movq 0x20(%rsp), %rax
movq %rax, 0x8(%rsp)
callq 0xc35f50
movq %rax, 0x18(%rsp)
callq 0xc3ad20
movq %rax, 0x10(%rsp)
movq 0x8(%rsp), %rdx
movq (%rdx), %rcx
xorl %eax, %eax
cmpq 0x8(%rdx), %rcx
movb %al, 0x7(%rsp)
je 0x471fba0
movq 0x8(%rsp), %rax
movq (%rax), %rdi
addq $-0x10, %rd... | /llvm/ADT/DenseMap.h |
splitGlobal(llvm::GlobalVariable&) | static bool splitGlobal(GlobalVariable &GV) {
// If the address of the global is taken outside of the module, we cannot
// apply this transformation.
if (!GV.hasLocalLinkage())
return false;
// We currently only know how to split ConstantStructs.
auto *Init = dyn_cast_or_null<ConstantStruct>(GV.getInitia... | subq $0x518, %rsp # imm = 0x518
movq %rdi, 0x508(%rsp)
movq 0x508(%rsp), %rdi
callq 0x7278a0
testb $0x1, %al
jne 0x47227ad
movb $0x0, 0x517(%rsp)
jmp 0x47235c7
movq 0x508(%rsp), %rdi
callq 0x950810
movq %rax, %rdi
callq 0x47235e0
movq %rax, 0x500(%rsp)
cmpq $0x0, 0x500(%rsp)
jne 0x47227e2
movb $0x0, 0x517(%r... | /Transforms/IPO/GlobalSplit.cpp |
llvm::HotColdSplitting::isSplittingBeneficial(llvm::CodeExtractor&, llvm::SmallVector<llvm::BasicBlock*, 0u> const&, llvm::TargetTransformInfo&) | bool HotColdSplitting::isSplittingBeneficial(CodeExtractor &CE,
const BlockSequence &Region,
TargetTransformInfo &TTI) {
assert(!Region.empty());
// Perform a simple cost/benefit analysis to decide whether or not to permit
... | subq $0x108, %rsp # imm = 0x108
movq %rdi, 0xf8(%rsp)
movq %rsi, 0xf0(%rsp)
movq %rdx, 0xe8(%rsp)
movq %rcx, 0xe0(%rsp)
leaq 0xb8(%rsp), %rdi
movq %rdi, (%rsp)
callq 0x170e0e0
leaq 0x90(%rsp), %rdi
movq %rdi, 0x8(%rsp)
callq 0x170e0e0
leaq 0x68(%rsp), %rdi
movq %rdi, 0x10(%rsp)
callq 0x170e0e0
movq (%rsp), %... | /Transforms/IPO/HotColdSplitting.cpp |
(anonymous namespace)::OutliningRegion::takeSingleEntrySubRegion(llvm::DominatorTree&) | BlockSequence takeSingleEntrySubRegion(DominatorTree &DT) {
assert(!empty() && !isEntireFunctionCold() && "Nothing to extract");
// Remove blocks dominated by the suggested entry point from this region.
// During the removal, identify the next best entry point into the region.
// Ensure that the first ... | subq $0xc8, %rsp
movq %rdi, 0x38(%rsp)
movq %rdi, %rax
movq %rax, 0x30(%rsp)
movq %rdi, 0xc0(%rsp)
movq %rsi, 0xb8(%rsp)
movq %rdx, 0xb0(%rsp)
movq 0xb8(%rsp), %rax
movq %rax, 0x40(%rsp)
movb $0x0, 0xaf(%rsp)
movq 0x10(%rax), %rax
movq %rax, 0x90(%rsp)
leaq 0x90(%rsp), %rax
movq %rax, 0x98(%rsp)
movq $0x1, 0xa0(%rsp)
m... | /Transforms/IPO/HotColdSplitting.cpp |
llvm::DenseMap<llvm::Value*, llvm::detail::DenseSetEmpty, llvm::DenseMapInfo<llvm::Value*, void>, llvm::detail::DenseSetPair<llvm::Value*>>::swap(llvm::DenseMap<llvm::Value*, llvm::detail::DenseSetEmpty, llvm::DenseMapInfo<llvm::Value*, void>, llvm::detail::DenseSetPair<llvm::Value*>>&) | void swap(DenseMap& RHS) {
this->incrementEpoch();
RHS.incrementEpoch();
std::swap(Buckets, RHS.Buckets);
std::swap(NumEntries, RHS.NumEntries);
std::swap(NumTombstones, RHS.NumTombstones);
std::swap(NumBuckets, RHS.NumBuckets);
} | subq $0x18, %rsp
movq %rdi, 0x10(%rsp)
movq %rsi, 0x8(%rsp)
movq 0x10(%rsp), %rdi
movq %rdi, (%rsp)
callq 0x548460
movq 0x8(%rsp), %rdi
callq 0x548460
movq (%rsp), %rdi
movq 0x8(%rsp), %rsi
callq 0x4729a50
movq (%rsp), %rdi
addq $0x8, %rdi
movq 0x8(%rsp), %rsi
addq $0x8, %rsi
callq 0x582e30
movq (%rsp), %rdi
addq $0xc,... | /llvm/ADT/DenseMap.h |
llvm::IROutlinerPass::run(llvm::Module&, llvm::AnalysisManager<llvm::Module>&) | PreservedAnalyses IROutlinerPass::run(Module &M, ModuleAnalysisManager &AM) {
auto &FAM = AM.getResult<FunctionAnalysisManagerModuleProxy>(M).getManager();
std::function<TargetTransformInfo &(Function &)> GTTI =
[&FAM](Function &F) -> TargetTransformInfo & {
return FAM.getResult<TargetIRAnalysis>(F);
}... | subq $0x298, %rsp # imm = 0x298
movq %rdi, 0x18(%rsp)
movq %rdi, %rax
movq %rax, 0x20(%rsp)
movq %rdi, 0x290(%rsp)
movq %rsi, 0x288(%rsp)
movq %rdx, 0x280(%rsp)
movq %rcx, 0x278(%rsp)
movq 0x278(%rsp), %rdi
movq 0x280(%rsp), %rsi
callq 0xefc2b0
movq %rax, %rdi
callq 0x3135990
movq %rax, 0x270(%rsp)
movq 0x27... | /Transforms/IPO/IROutliner.cpp |
getSortedConstantKeys(std::vector<llvm::Value*, std::allocator<llvm::Value*>>&, llvm::DenseMap<llvm::Value*, llvm::BasicBlock*, llvm::DenseMapInfo<llvm::Value*, void>, llvm::detail::DenseMapPair<llvm::Value*, llvm::BasicBlock*>>&) | static void getSortedConstantKeys(std::vector<Value *> &SortedKeys,
DenseMap<Value *, BasicBlock *> &Map) {
for (auto &VtoBB : Map)
SortedKeys.push_back(VtoBB.first);
// Here we expect to have either 1 value that is void (nullptr) or multiple
// values that are all constant ... | subq $0x48, %rsp
movq %rdi, 0x40(%rsp)
movq %rsi, 0x38(%rsp)
movq 0x38(%rsp), %rax
movq %rax, 0x30(%rsp)
movq 0x30(%rsp), %rdi
callq 0x472f190
movq %rax, 0x20(%rsp)
movq %rdx, 0x28(%rsp)
movq 0x30(%rsp), %rdi
callq 0x472f260
movq %rax, 0x10(%rsp)
movq %rdx, 0x18(%rsp)
leaq 0x20(%rsp), %rdi
leaq 0x10(%rsp), %rsi
callq 0... | /Transforms/IPO/IROutliner.cpp |
llvm::DenseMapIterator<llvm::PHINode*, llvm::detail::DenseSetEmpty, llvm::DenseMapInfo<llvm::PHINode*, void>, llvm::detail::DenseSetPair<llvm::PHINode*>, true>::AdvancePastEmptyBuckets() | void AdvancePastEmptyBuckets() {
assert(Ptr <= End);
const KeyT Empty = KeyInfoT::getEmptyKey();
const KeyT Tombstone = KeyInfoT::getTombstoneKey();
while (Ptr != End && (KeyInfoT::isEqual(Ptr->getFirst(), Empty) ||
KeyInfoT::isEqual(Ptr->getFirst(), Tombstone)))
++Ptr;
... | subq $0x28, %rsp
movq %rdi, 0x20(%rsp)
movq 0x20(%rsp), %rax
movq %rax, 0x8(%rsp)
callq 0x124a850
movq %rax, 0x18(%rsp)
callq 0x124b2a0
movq %rax, 0x10(%rsp)
movq 0x8(%rsp), %rdx
movq (%rdx), %rcx
xorl %eax, %eax
cmpq 0x8(%rdx), %rcx
movb %al, 0x7(%rsp)
je 0x4746ea8
movq 0x8(%rsp), %rax
movq (%rax), %rdi
callq 0x20595f... | /llvm/ADT/DenseMap.h |
llvm::SpecificBumpPtrAllocator<llvm::OutlinableRegion>::DestroyAll()::'lambda'(char*, char*)::operator()(char*, char*) const | void DestroyAll() {
auto DestroyElements = [](char *Begin, char *End) {
assert(Begin == (char *)alignAddr(Begin, Align::Of<T>()));
for (char *Ptr = Begin; Ptr + sizeof(T) <= End; Ptr += sizeof(T))
reinterpret_cast<T *>(Ptr)->~T();
};
for (auto I = Allocator.Slabs.begin(), E = Allocator.... | subq $0x28, %rsp
movq %rdi, 0x20(%rsp)
movq %rsi, 0x18(%rsp)
movq %rdx, 0x10(%rsp)
movq 0x18(%rsp), %rax
movq %rax, 0x8(%rsp)
movq 0x8(%rsp), %rax
addq $0x108, %rax # imm = 0x108
cmpq 0x10(%rsp), %rax
ja 0x47482fb
movq 0x8(%rsp), %rdi
callq 0x4748300
movq 0x8(%rsp), %rax
addq $0x108, %rax # imm = ... | /llvm/Support/Allocator.h |
llvm::ilist_base<true, void>::removeRangeImpl(llvm::ilist_node_base<true, void>&, llvm::ilist_node_base<true, void>&) | static void removeRangeImpl(node_base_type &First, node_base_type &Last) {
node_base_type *Prev = First.getPrev();
node_base_type *Final = Last.getPrev();
Last.setPrev(Prev);
Prev->setNext(&Last);
// Not strictly necessary, but helps catch a class of bugs.
First.setPrev(nullptr);
Final->set... | subq $0x28, %rsp
movq %rdi, 0x20(%rsp)
movq %rsi, 0x18(%rsp)
movq 0x20(%rsp), %rdi
callq 0x734600
movq %rax, 0x10(%rsp)
movq 0x18(%rsp), %rdi
callq 0x734600
movq %rax, 0x8(%rsp)
movq 0x18(%rsp), %rdi
movq 0x10(%rsp), %rsi
callq 0x744210
movq 0x10(%rsp), %rdi
movq 0x18(%rsp), %rsi
callq 0x7441f0
movq 0x20(%rsp), %rdi
xo... | /llvm/ADT/ilist_base.h |
inferAllPrototypeAttributes(llvm::Module&, llvm::function_ref<llvm::TargetLibraryInfo& (llvm::Function&)>) | static bool inferAllPrototypeAttributes(
Module &M, function_ref<TargetLibraryInfo &(Function &)> GetTLI) {
bool Changed = false;
for (Function &F : M.functions())
// We only infer things using the prototype and the name; we don't need
// definitions. This ensures libfuncs are annotated and also allow... | subq $0x58, %rsp
movq %rsi, 0x48(%rsp)
movq %rdx, 0x50(%rsp)
movq %rdi, 0x40(%rsp)
movb $0x0, 0x3f(%rsp)
movq 0x40(%rsp), %rdi
callq 0x10647d0
movq %rax, 0x20(%rsp)
movq %rdx, 0x28(%rsp)
leaq 0x20(%rsp), %rax
movq %rax, 0x30(%rsp)
movq 0x30(%rsp), %rdi
callq 0x1064830
movq %rax, 0x18(%rsp)
movq 0x30(%rsp), %rdi
callq 0... | /Transforms/IPO/InferFunctionAttrs.cpp |
llvm::InlinerPass::run(llvm::LazyCallGraph::SCC&, llvm::AnalysisManager<llvm::LazyCallGraph::SCC, llvm::LazyCallGraph&>&, llvm::LazyCallGraph&, llvm::CGSCCUpdateResult&) | PreservedAnalyses InlinerPass::run(LazyCallGraph::SCC &InitialC,
CGSCCAnalysisManager &AM, LazyCallGraph &CG,
CGSCCUpdateResult &UR) {
const auto &MAMProxy =
AM.getResult<ModuleAnalysisManagerCGSCCProxy>(InitialC, CG);
bool Changed = false;... | subq $0xa08, %rsp # imm = 0xA08
movq %rdi, 0x108(%rsp)
movq %rdi, %rax
movq %rax, 0x110(%rsp)
movq %rdi, 0xa00(%rsp)
movq %rsi, 0x9f8(%rsp)
movq %rdx, 0x9f0(%rsp)
movq %rcx, 0x9e8(%rsp)
movq %r8, 0x9e0(%rsp)
movq %r9, 0x9d8(%rsp)
movq 0x9f8(%rsp), %rax
movq %rax, 0x118(%rsp)
movq 0x9e8(%rsp), %rdi
movq 0x9f0... | /Transforms/IPO/Inliner.cpp |
inlineHistoryIncludes(llvm::Function*, int, llvm::SmallVectorImpl<std::pair<llvm::Function*, int>> const&) | static bool inlineHistoryIncludes(
Function *F, int InlineHistoryID,
const SmallVectorImpl<std::pair<Function *, int>> &InlineHistory) {
while (InlineHistoryID != -1) {
assert(unsigned(InlineHistoryID) < InlineHistory.size() &&
"Invalid inline history ID");
if (InlineHistory[InlineHistoryID... | subq $0x28, %rsp
movq %rdi, 0x18(%rsp)
movl %esi, 0x14(%rsp)
movq %rdx, 0x8(%rsp)
cmpl $-0x1, 0x14(%rsp)
je 0x475caa1
movq 0x8(%rsp), %rdi
movslq 0x14(%rsp), %rsi
callq 0x475ff70
movq (%rax), %rax
cmpq 0x18(%rsp), %rax
jne 0x475ca89
movb $0x1, 0x27(%rsp)
jmp 0x475caa6
movq 0x8(%rsp), %rdi
movslq 0x14(%rsp), %rsi
callq ... | /Transforms/IPO/Inliner.cpp |
llvm::ModuleInlinerWrapperPass::run(llvm::Module&, llvm::AnalysisManager<llvm::Module>&) | PreservedAnalyses ModuleInlinerWrapperPass::run(Module &M,
ModuleAnalysisManager &MAM) {
auto &IAA = MAM.getResult<InlineAdvisorAnalysis>(M);
if (!IAA.tryCreate(Params, Mode,
{CGSCCInlineReplayFile,
CGSCCInlineReplayScope,
... | subq $0x1d8, %rsp # imm = 0x1D8
movq %rdi, 0x68(%rsp)
movq %rdi, %rax
movq %rax, 0x70(%rsp)
movq %rdi, 0x1d0(%rsp)
movq %rsi, 0x1c8(%rsp)
movq %rdx, 0x1c0(%rsp)
movq %rcx, 0x1b8(%rsp)
movq 0x1c8(%rsp), %rax
movq %rax, 0x88(%rsp)
movq 0x1b8(%rsp), %rdi
movq 0x1c0(%rsp), %rsi
callq 0x449b5e0
movq 0x88(%rsp), %... | /Transforms/IPO/Inliner.cpp |
void llvm::cl::parser<llvm::ReplayInlinerSettings::Scope>::addLiteralOption<int>(llvm::StringRef, int const&, llvm::StringRef) | void addLiteralOption(StringRef Name, const DT &V, StringRef HelpStr) {
#ifndef NDEBUG
if (findOption(Name) != Values.size())
report_fatal_error("Option '" + Name + "' already exists!");
#endif
OptionInfo X(Name, static_cast<DataType>(V), HelpStr);
Values.push_back(X);
AddLiteralOption(Owner, Name... | subq $0x98, %rsp
movq %rsi, 0x88(%rsp)
movq %rdx, 0x90(%rsp)
movq %r8, 0x78(%rsp)
movq %r9, 0x80(%rsp)
movq %rdi, 0x70(%rsp)
movq %rcx, 0x68(%rsp)
movq 0x70(%rsp), %rax
movq %rax, (%rsp)
movq 0x88(%rsp), %rax
movq %rax, 0x28(%rsp)
movq 0x90(%rsp), %rax
movq %rax, 0x30(%rsp)
movq 0x68(%rsp), %rax
movl (%rax), %ecx
movq ... | /llvm/Support/CommandLine.h |
void llvm::cl::parser<llvm::CallSiteFormat::Format>::addLiteralOption<int>(llvm::StringRef, int const&, llvm::StringRef) | void addLiteralOption(StringRef Name, const DT &V, StringRef HelpStr) {
#ifndef NDEBUG
if (findOption(Name) != Values.size())
report_fatal_error("Option '" + Name + "' already exists!");
#endif
OptionInfo X(Name, static_cast<DataType>(V), HelpStr);
Values.push_back(X);
AddLiteralOption(Owner, Name... | subq $0x98, %rsp
movq %rsi, 0x88(%rsp)
movq %rdx, 0x90(%rsp)
movq %r8, 0x78(%rsp)
movq %r9, 0x80(%rsp)
movq %rdi, 0x70(%rsp)
movq %rcx, 0x68(%rsp)
movq 0x70(%rsp), %rax
movq %rax, (%rsp)
movq 0x88(%rsp), %rax
movq %rax, 0x28(%rsp)
movq 0x90(%rsp), %rax
movq %rax, 0x30(%rsp)
movq 0x68(%rsp), %rax
movl (%rax), %ecx
movq ... | /llvm/Support/CommandLine.h |
std::pair<llvm::CallBase*, int> const* llvm::SmallVectorTemplateCommon<std::pair<llvm::CallBase*, int>, void>::reserveForParamAndGetAddressImpl<llvm::SmallVectorTemplateBase<std::pair<llvm::CallBase*, int>, true>>(llvm::SmallVectorTemplateBase<std::pair<llvm::CallBase*, int>, true>*, std::pair<llvm::CallBase*, int> con... | static const T *reserveForParamAndGetAddressImpl(U *This, const T &Elt,
size_t N) {
size_t NewSize = This->size() + N;
if (LLVM_LIKELY(NewSize <= This->capacity()))
return &Elt;
bool ReferencesStorage = false;
int64_t Index = -1;
if (!U::Take... | subq $0x48, %rsp
movq %rdi, 0x38(%rsp)
movq %rsi, 0x30(%rsp)
movq %rdx, 0x28(%rsp)
movq 0x38(%rsp), %rdi
callq 0x3a8dca0
addq 0x28(%rsp), %rax
movq %rax, 0x20(%rsp)
movq 0x20(%rsp), %rax
movq %rax, 0x8(%rsp)
movq 0x38(%rsp), %rdi
callq 0x3a8dab0
movq %rax, %rcx
movq 0x8(%rsp), %rax
cmpq %rcx, %rax
ja 0x4764184
movq 0x3... | /llvm/ADT/SmallVector.h |
llvm::DenseMap<llvm::Function*, llvm::detail::DenseSetEmpty, llvm::DenseMapInfo<llvm::Function*, void>, llvm::detail::DenseSetPair<llvm::Function*>>::shrink_and_clear() | void shrink_and_clear() {
unsigned OldNumBuckets = NumBuckets;
unsigned OldNumEntries = NumEntries;
this->destroyAll();
// Reduce the number of buckets.
unsigned NewNumBuckets = 0;
if (OldNumEntries)
NewNumBuckets = std::max(64, 1 << (Log2_32_Ceil(OldNumEntries) + 1));
if (NewNumBucke... | subq $0x28, %rsp
movq %rdi, 0x20(%rsp)
movq 0x20(%rsp), %rdi
movq %rdi, (%rsp)
movl 0x10(%rdi), %eax
movl %eax, 0x1c(%rsp)
movl 0x8(%rdi), %eax
movl %eax, 0x18(%rsp)
callq 0x7eb590
movl $0x0, 0x14(%rsp)
cmpl $0x0, 0x18(%rsp)
je 0x4766ada
movl $0x40, 0x10(%rsp)
movl 0x18(%rsp), %edi
callq 0x91b7e0
movl %eax, %ecx
addl $... | /llvm/ADT/DenseMap.h |
(anonymous namespace)::PreserveAPIList::LoadFile(llvm::StringRef) | void LoadFile(StringRef Filename) {
// Load the APIFile...
ErrorOr<std::unique_ptr<MemoryBuffer>> BufOrErr =
MemoryBuffer::getFile(Filename);
if (!BufOrErr) {
errs() << "WARNING: Internalize couldn't load file '" << Filename
<< "'! Continuing as if it's empty.\n";
return; //... | subq $0x118, %rsp # imm = 0x118
movq %rsi, 0x108(%rsp)
movq %rdx, 0x110(%rsp)
movq %rdi, 0x100(%rsp)
movq 0x100(%rsp), %rax
movq %rax, 0x8(%rsp)
leaq 0xc0(%rsp), %rdi
leaq 0x108(%rsp), %rsi
callq 0x40a3f0
leaq 0xbe(%rsp), %rdi
callq 0x3eee90
leaq 0xe8(%rsp), %rdi
leaq 0xc0(%rsp), %rsi
xorl %r8d, %r8d
movl $0... | /Transforms/IPO/Internalize.cpp |
llvm::DenseMap<llvm::Comdat const*, llvm::InternalizePass::ComdatInfo, llvm::DenseMapInfo<llvm::Comdat const*, void>, llvm::detail::DenseMapPair<llvm::Comdat const*, llvm::InternalizePass::ComdatInfo>>::grow(unsigned int) | void grow(unsigned AtLeast) {
unsigned OldNumBuckets = NumBuckets;
BucketT *OldBuckets = Buckets;
allocateBuckets(std::max<unsigned>(64, static_cast<unsigned>(NextPowerOf2(AtLeast-1))));
assert(Buckets);
if (!OldBuckets) {
this->BaseT::initEmpty();
return;
}
this->moveFromOldBu... | subq $0x28, %rsp
movq %rdi, 0x20(%rsp)
movl %esi, 0x1c(%rsp)
movq 0x20(%rsp), %rax
movq %rax, (%rsp)
movl 0x10(%rax), %ecx
movl %ecx, 0x18(%rsp)
movq (%rax), %rax
movq %rax, 0x10(%rsp)
movl $0x40, 0xc(%rsp)
movl 0x1c(%rsp), %eax
subl $0x1, %eax
movl %eax, %eax
movl %eax, %edi
callq 0x5487c0
movl %eax, 0x8(%rsp)
leaq 0x... | /llvm/ADT/DenseMap.h |
(anonymous namespace)::LowerTypeTestsModule::LowerTypeTestsModule(llvm::Module&, llvm::AnalysisManager<llvm::Module>&, llvm::ModuleSummaryIndex*, llvm::ModuleSummaryIndex const*, bool) | LowerTypeTestsModule::LowerTypeTestsModule(
Module &M, ModuleAnalysisManager &AM, ModuleSummaryIndex *ExportSummary,
const ModuleSummaryIndex *ImportSummary, bool DropTypeTests)
: M(M), ExportSummary(ExportSummary), ImportSummary(ImportSummary),
DropTypeTests(DropTypeTests || ClDropTypeTests) {
asse... | subq $0x148, %rsp # imm = 0x148
movb %r9b, %al
movq %rdi, 0x140(%rsp)
movq %rsi, 0x138(%rsp)
movq %rdx, 0x130(%rsp)
movq %rcx, 0x128(%rsp)
movq %r8, 0x120(%rsp)
andb $0x1, %al
movb %al, 0x11f(%rsp)
movq 0x140(%rsp), %rax
movq %rax, 0x10(%rsp)
movq 0x138(%rsp), %rcx
movq %rcx, (%rax)
movq 0x128(%rsp), %rcx
mo... | /Transforms/IPO/LowerTypeTests.cpp |
std::enable_if<unvalidatedMappingTraits<llvm::ModuleSummaryIndex, llvm::yaml::EmptyContext>::value, void>::type llvm::yaml::yamlize<llvm::ModuleSummaryIndex, llvm::yaml::EmptyContext>(llvm::yaml::IO&, llvm::ModuleSummaryIndex&, bool, llvm::yaml::EmptyContext&) | std::enable_if_t<unvalidatedMappingTraits<T, Context>::value, void>
yamlize(IO &io, T &Val, bool, Context &Ctx) {
if (yamlizeMappingEnumInput<T, Context>(io, Val))
return;
if (has_FlowTraits<MappingTraits<T>>::value) {
io.beginFlowMapping();
detail::doMapping(io, Val, Ctx);
io.endFlowMapping();
} ... | subq $0x28, %rsp
movb %dl, %al
movq %rdi, 0x20(%rsp)
movq %rsi, 0x18(%rsp)
andb $0x1, %al
movb %al, 0x17(%rsp)
movq %rcx, 0x8(%rsp)
movq 0x20(%rsp), %rdi
movq 0x18(%rsp), %rsi
callq 0x4773e40
testb $0x1, %al
jne 0x4773e00
jmp 0x4773e02
jmp 0x4773e2c
movq 0x20(%rsp), %rdi
movq (%rdi), %rax
callq *0x68(%rax)
movq 0x20(%r... | /llvm/Support/YAMLTraits.h |
std::enable_if<has_SequenceTraits<std::vector<llvm::FunctionSummary::VFuncId, std::allocator<llvm::FunctionSummary::VFuncId>>>::value, void>::type llvm::yaml::yamlize<std::vector<llvm::FunctionSummary::VFuncId, std::allocator<llvm::FunctionSummary::VFuncId>>, llvm::yaml::EmptyContext>(llvm::yaml::IO&, std::vector<llvm:... | std::enable_if_t<has_SequenceTraits<T>::value, void>
yamlize(IO &io, T &Seq, bool, Context &Ctx) {
if ( has_FlowTraits< SequenceTraits<T>>::value ) {
unsigned incnt = io.beginFlowSequence();
unsigned count = io.outputting() ? SequenceTraits<T>::size(io, Seq) : incnt;
for(unsigned i=0; i < count; ++i) {
... | subq $0x48, %rsp
movb %dl, %al
movq %rdi, 0x40(%rsp)
movq %rsi, 0x38(%rsp)
andb $0x1, %al
movb %al, 0x37(%rsp)
movq %rcx, 0x28(%rsp)
movq 0x40(%rsp), %rdi
movq (%rdi), %rax
callq *0x18(%rax)
movl %eax, 0x24(%rsp)
movq 0x40(%rsp), %rdi
movq (%rdi), %rax
callq *0x10(%rax)
testb $0x1, %al
jne 0x47773fb
jmp 0x4777411
movq ... | /llvm/Support/YAMLTraits.h |
std::enable_if<has_SequenceTraits<std::vector<llvm::FunctionSummary::ConstVCall, std::allocator<llvm::FunctionSummary::ConstVCall>>>::value, void>::type llvm::yaml::yamlize<std::vector<llvm::FunctionSummary::ConstVCall, std::allocator<llvm::FunctionSummary::ConstVCall>>, llvm::yaml::EmptyContext>(llvm::yaml::IO&, std::... | std::enable_if_t<has_SequenceTraits<T>::value, void>
yamlize(IO &io, T &Seq, bool, Context &Ctx) {
if ( has_FlowTraits< SequenceTraits<T>>::value ) {
unsigned incnt = io.beginFlowSequence();
unsigned count = io.outputting() ? SequenceTraits<T>::size(io, Seq) : incnt;
for(unsigned i=0; i < count; ++i) {
... | subq $0x48, %rsp
movb %dl, %al
movq %rdi, 0x40(%rsp)
movq %rsi, 0x38(%rsp)
andb $0x1, %al
movb %al, 0x37(%rsp)
movq %rcx, 0x28(%rsp)
movq 0x40(%rsp), %rdi
movq (%rdi), %rax
callq *0x18(%rax)
movl %eax, 0x24(%rsp)
movq 0x40(%rsp), %rdi
movq (%rdi), %rax
callq *0x10(%rax)
testb $0x1, %al
jne 0x4777deb
jmp 0x4777e01
movq ... | /llvm/Support/YAMLTraits.h |
std::enable_if<unvalidatedMappingTraits<llvm::WholeProgramDevirtResolution, llvm::yaml::EmptyContext>::value, void>::type llvm::yaml::yamlize<llvm::WholeProgramDevirtResolution, llvm::yaml::EmptyContext>(llvm::yaml::IO&, llvm::WholeProgramDevirtResolution&, bool, llvm::yaml::EmptyContext&) | std::enable_if_t<unvalidatedMappingTraits<T, Context>::value, void>
yamlize(IO &io, T &Val, bool, Context &Ctx) {
if (yamlizeMappingEnumInput<T, Context>(io, Val))
return;
if (has_FlowTraits<MappingTraits<T>>::value) {
io.beginFlowMapping();
detail::doMapping(io, Val, Ctx);
io.endFlowMapping();
} ... | subq $0x28, %rsp
movb %dl, %al
movq %rdi, 0x20(%rsp)
movq %rsi, 0x18(%rsp)
andb $0x1, %al
movb %al, 0x17(%rsp)
movq %rcx, 0x8(%rsp)
movq 0x20(%rsp), %rdi
movq 0x18(%rsp), %rsi
callq 0x477b3d0
testb $0x1, %al
jne 0x477b390
jmp 0x477b392
jmp 0x477b3bc
movq 0x20(%rsp), %rdi
movq (%rdi), %rax
callq *0x68(%rax)
movq 0x20(%r... | /llvm/Support/YAMLTraits.h |
llvm::DenseMapBase<llvm::DenseMap<llvm::Metadata*, (anonymous namespace)::LowerTypeTestsModule::lower()::TIInfo, llvm::DenseMapInfo<llvm::Metadata*, void>, llvm::detail::DenseMapPair<llvm::Metadata*, (anonymous namespace)::LowerTypeTestsModule::lower()::TIInfo>>, llvm::Metadata*, (anonymous namespace)::LowerTypeTestsMo... | inline iterator begin() {
// When the map is empty, avoid the overhead of advancing/retreating past
// empty buckets.
if (empty())
return end();
if (shouldReverseIterate<KeyT>())
return makeIterator(getBucketsEnd() - 1, getBuckets(), *this);
return makeIterator(getBuckets(), getBucketsEn... | subq $0x38, %rsp
movq %rdi, 0x20(%rsp)
movq 0x20(%rsp), %rdi
movq %rdi, 0x18(%rsp)
callq 0x478b4f0
testb $0x1, %al
jne 0x477ec1e
jmp 0x477ec37
movq 0x18(%rsp), %rdi
callq 0x477ecd0
movq %rax, 0x28(%rsp)
movq %rdx, 0x30(%rsp)
jmp 0x477ecbe
callq 0x2e9d520
testb $0x1, %al
jne 0x477ec42
jmp 0x477ec83
movq 0x18(%rsp), %rdi... | /llvm/ADT/DenseMap.h |
llvm::DenseMap<llvm::Metadata*, (anonymous namespace)::LowerTypeTestsModule::lower()::TIInfo, llvm::DenseMapInfo<llvm::Metadata*, void>, llvm::detail::DenseMapPair<llvm::Metadata*, (anonymous namespace)::LowerTypeTestsModule::lower()::TIInfo>>::init(unsigned int) | void init(unsigned InitNumEntries) {
auto InitBuckets = BaseT::getMinBucketToReserveForEntries(InitNumEntries);
if (allocateBuckets(InitBuckets)) {
this->BaseT::initEmpty();
} else {
NumEntries = 0;
NumTombstones = 0;
}
} | subq $0x18, %rsp
movq %rdi, 0x10(%rsp)
movl %esi, 0xc(%rsp)
movq 0x10(%rsp), %rdi
movq %rdi, (%rsp)
movl 0xc(%rsp), %esi
callq 0x4785990
movq (%rsp), %rdi
movl %eax, 0x8(%rsp)
movl 0x8(%rsp), %esi
callq 0x47859e0
testb $0x1, %al
jne 0x4785966
jmp 0x4785971
movq (%rsp), %rdi
callq 0x4785a50
jmp 0x4785983
movq (%rsp), %r... | /llvm/ADT/DenseMap.h |
llvm::DenseMap<llvm::Metadata*, (anonymous namespace)::LowerTypeTestsModule::lower()::TIInfo, llvm::DenseMapInfo<llvm::Metadata*, void>, llvm::detail::DenseMapPair<llvm::Metadata*, (anonymous namespace)::LowerTypeTestsModule::lower()::TIInfo>>::allocateBuckets(unsigned int) | bool allocateBuckets(unsigned Num) {
NumBuckets = Num;
if (NumBuckets == 0) {
Buckets = nullptr;
return false;
}
Buckets = static_cast<BucketT *>(
allocate_buffer(sizeof(BucketT) * NumBuckets, alignof(BucketT)));
return true;
} | subq $0x28, %rsp
movq %rdi, 0x18(%rsp)
movl %esi, 0x14(%rsp)
movq 0x18(%rsp), %rax
movq %rax, 0x8(%rsp)
movl 0x14(%rsp), %ecx
movl %ecx, 0x10(%rax)
cmpl $0x0, 0x10(%rax)
jne 0x4785a17
movq 0x8(%rsp), %rax
movq $0x0, (%rax)
movb $0x0, 0x27(%rsp)
jmp 0x4785a3d
movq 0x8(%rsp), %rax
movl 0x10(%rax), %eax
imulq $0x28, %rax,... | /llvm/ADT/DenseMap.h |
llvm::DenseMapBase<llvm::DenseMap<llvm::GlobalObject*, (anonymous namespace)::GlobalTypeMember*, llvm::DenseMapInfo<llvm::GlobalObject*, void>, llvm::detail::DenseMapPair<llvm::GlobalObject*, (anonymous namespace)::GlobalTypeMember*>>, llvm::GlobalObject*, (anonymous namespace)::GlobalTypeMember*, llvm::DenseMapInfo<ll... | unsigned getMinBucketToReserveForEntries(unsigned NumEntries) {
// Ensure that "NumEntries * 4 < NumBuckets * 3"
if (NumEntries == 0)
return 0;
// +1 is required because of the strict equality.
// For example if NumEntries is 48, we need to return 401.
return NextPowerOf2(NumEntries * 4 / 3 + ... | subq $0x18, %rsp
movq %rdi, 0x8(%rsp)
movl %esi, 0x4(%rsp)
cmpl $0x0, 0x4(%rsp)
jne 0x478673e
movl $0x0, 0x14(%rsp)
jmp 0x478675e
movl 0x4(%rsp), %eax
shll $0x2, %eax
movl $0x3, %ecx
xorl %edx, %edx
divl %ecx
addl $0x1, %eax
movl %eax, %eax
movl %eax, %edi
callq 0x5487c0
movl %eax, 0x14(%rsp)
movl 0x14(%rsp), %eax
addq... | /llvm/ADT/DenseMap.h |
llvm::DenseMap<unsigned long, llvm::TinyPtrVector<llvm::Metadata*>, llvm::DenseMapInfo<unsigned long, void>, llvm::detail::DenseMapPair<unsigned long, llvm::TinyPtrVector<llvm::Metadata*>>>::grow(unsigned int) | void grow(unsigned AtLeast) {
unsigned OldNumBuckets = NumBuckets;
BucketT *OldBuckets = Buckets;
allocateBuckets(std::max<unsigned>(64, static_cast<unsigned>(NextPowerOf2(AtLeast-1))));
assert(Buckets);
if (!OldBuckets) {
this->BaseT::initEmpty();
return;
}
this->moveFromOldBu... | subq $0x28, %rsp
movq %rdi, 0x20(%rsp)
movl %esi, 0x1c(%rsp)
movq 0x20(%rsp), %rax
movq %rax, (%rsp)
movl 0x10(%rax), %ecx
movl %ecx, 0x18(%rsp)
movq (%rax), %rax
movq %rax, 0x10(%rsp)
movl $0x40, 0xc(%rsp)
movl 0x1c(%rsp), %eax
subl $0x1, %eax
movl %eax, %eax
movl %eax, %edi
callq 0x5487c0
movl %eax, 0x8(%rsp)
leaq 0x... | /llvm/ADT/DenseMap.h |
llvm::DenseMap<llvm::Metadata*, unsigned long, llvm::DenseMapInfo<llvm::Metadata*, void>, llvm::detail::DenseMapPair<llvm::Metadata*, unsigned long>>::allocateBuckets(unsigned int) | bool allocateBuckets(unsigned Num) {
NumBuckets = Num;
if (NumBuckets == 0) {
Buckets = nullptr;
return false;
}
Buckets = static_cast<BucketT *>(
allocate_buffer(sizeof(BucketT) * NumBuckets, alignof(BucketT)));
return true;
} | subq $0x28, %rsp
movq %rdi, 0x18(%rsp)
movl %esi, 0x14(%rsp)
movq 0x18(%rsp), %rax
movq %rax, 0x8(%rsp)
movl 0x14(%rsp), %ecx
movl %ecx, 0x10(%rax)
cmpl $0x0, 0x10(%rax)
jne 0x4793c77
movq 0x8(%rsp), %rax
movq $0x0, (%rax)
movb $0x0, 0x27(%rsp)
jmp 0x4793c9f
movq 0x8(%rsp), %rax
movl 0x10(%rax), %eax
movl %eax, %edi
sh... | /llvm/ADT/DenseMap.h |
llvm::DenseMap<(anonymous namespace)::GlobalTypeMember*, unsigned long, llvm::DenseMapInfo<(anonymous namespace)::GlobalTypeMember*, void>, llvm::detail::DenseMapPair<(anonymous namespace)::GlobalTypeMember*, unsigned long>>::allocateBuckets(unsigned int) | bool allocateBuckets(unsigned Num) {
NumBuckets = Num;
if (NumBuckets == 0) {
Buckets = nullptr;
return false;
}
Buckets = static_cast<BucketT *>(
allocate_buffer(sizeof(BucketT) * NumBuckets, alignof(BucketT)));
return true;
} | subq $0x28, %rsp
movq %rdi, 0x18(%rsp)
movl %esi, 0x14(%rsp)
movq 0x18(%rsp), %rax
movq %rax, 0x8(%rsp)
movl 0x14(%rsp), %ecx
movl %ecx, 0x10(%rax)
cmpl $0x0, 0x10(%rax)
jne 0x4794a87
movq 0x8(%rsp), %rax
movq $0x0, (%rax)
movb $0x0, 0x27(%rsp)
jmp 0x4794aaf
movq 0x8(%rsp), %rax
movl 0x10(%rax), %eax
movl %eax, %edi
sh... | /llvm/ADT/DenseMap.h |
llvm::DenseMapBase<llvm::DenseMap<llvm::Metadata*, unsigned long, llvm::DenseMapInfo<llvm::Metadata*, void>, llvm::detail::DenseMapPair<llvm::Metadata*, unsigned long>>, llvm::Metadata*, unsigned long, llvm::DenseMapInfo<llvm::Metadata*, void>, llvm::detail::DenseMapPair<llvm::Metadata*, unsigned long>>::makeIterator(l... | iterator makeIterator(BucketT *P, BucketT *E,
DebugEpochBase &Epoch,
bool NoAdvance=false) {
if (shouldReverseIterate<KeyT>()) {
BucketT *B = P == getBucketsEnd() ? getBuckets() : P + 1;
return iterator(B, E, Epoch, NoAdvance);
}
return iterator(P,... | subq $0x58, %rsp
movb %r8b, %al
movq %rdi, 0x40(%rsp)
movq %rsi, 0x38(%rsp)
movq %rdx, 0x30(%rsp)
movq %rcx, 0x28(%rsp)
andb $0x1, %al
movb %al, 0x27(%rsp)
movq 0x40(%rsp), %rax
movq %rax, 0x10(%rsp)
callq 0x2e9d520
testb $0x1, %al
jne 0x4794db6
jmp 0x4794e22
movq 0x10(%rsp), %rdi
movq 0x38(%rsp), %rax
movq %rax, 0x8(%... | /llvm/ADT/DenseMap.h |
llvm::DenseMapIterator<(anonymous namespace)::GlobalTypeMember*, unsigned long, llvm::DenseMapInfo<(anonymous namespace)::GlobalTypeMember*, void>, llvm::detail::DenseMapPair<(anonymous namespace)::GlobalTypeMember*, unsigned long>, true>::DenseMapIterator(llvm::detail::DenseMapPair<(anonymous namespace)::GlobalTypeMem... | DenseMapIterator(pointer Pos, pointer E, const DebugEpochBase &Epoch,
bool NoAdvance = false)
: DebugEpochBase::HandleBase(&Epoch), Ptr(Pos), End(E) {
assert(isHandleInSync() && "invalid construction!");
if (NoAdvance) return;
if (shouldReverseIterate<KeyT>()) {
RetreatPastEm... | subq $0x38, %rsp
movb %r8b, %al
movq %rdi, 0x30(%rsp)
movq %rsi, 0x28(%rsp)
movq %rdx, 0x20(%rsp)
movq %rcx, 0x18(%rsp)
andb $0x1, %al
movb %al, 0x17(%rsp)
movq 0x30(%rsp), %rdi
movq %rdi, 0x8(%rsp)
movq 0x18(%rsp), %rsi
callq 0x5481a0
movq 0x8(%rsp), %rax
movq 0x28(%rsp), %rcx
movq %rcx, (%rax)
movq 0x20(%rsp), %rcx
m... | /llvm/ADT/DenseMap.h |
llvm::DenseMapIterator<(anonymous namespace)::GlobalTypeMember*, unsigned long, llvm::DenseMapInfo<(anonymous namespace)::GlobalTypeMember*, void>, llvm::detail::DenseMapPair<(anonymous namespace)::GlobalTypeMember*, unsigned long>, true>::RetreatPastEmptyBuckets() | void RetreatPastEmptyBuckets() {
assert(Ptr >= End);
const KeyT Empty = KeyInfoT::getEmptyKey();
const KeyT Tombstone = KeyInfoT::getTombstoneKey();
while (Ptr != End && (KeyInfoT::isEqual(Ptr[-1].getFirst(), Empty) ||
KeyInfoT::isEqual(Ptr[-1].getFirst(), Tombstone)))
-... | subq $0x28, %rsp
movq %rdi, 0x20(%rsp)
movq 0x20(%rsp), %rax
movq %rax, 0x8(%rsp)
callq 0x4794c30
movq %rax, 0x18(%rsp)
callq 0x4795560
movq %rax, 0x10(%rsp)
movq 0x8(%rsp), %rdx
movq (%rdx), %rcx
xorl %eax, %eax
cmpq 0x8(%rdx), %rcx
movb %al, 0x7(%rsp)
je 0x479afa0
movq 0x8(%rsp), %rax
movq (%rax), %rdi
addq $-0x10, %... | /llvm/ADT/DenseMap.h |
(anonymous namespace)::LowerTypeTestsModule::createJumpTableEntry(llvm::raw_ostream&, llvm::raw_ostream&, llvm::Triple::ArchType, llvm::SmallVectorImpl<llvm::Value*>&, llvm::Function*) | void LowerTypeTestsModule::createJumpTableEntry(
raw_ostream &AsmOS, raw_ostream &ConstraintOS,
Triple::ArchType JumpTableArch, SmallVectorImpl<Value *> &AsmArgs,
Function *Dest) {
unsigned ArgIndex = AsmArgs.size();
if (JumpTableArch == Triple::x86 || JumpTableArch == Triple::x86_64) {
bool Endbr ... | subq $0x78, %rsp
movq %rdi, 0x70(%rsp)
movq %rsi, 0x68(%rsp)
movq %rdx, 0x60(%rsp)
movl %ecx, 0x5c(%rsp)
movq %r8, 0x50(%rsp)
movq %r9, 0x48(%rsp)
movq 0x70(%rsp), %rax
movq %rax, 0x18(%rsp)
movq 0x50(%rsp), %rdi
callq 0x3a8dca0
movl %eax, 0x44(%rsp)
cmpl $0x25, 0x5c(%rsp)
je 0x479dd5b
cmpl $0x26, 0x5c(%rsp)
jne 0x479d... | /Transforms/IPO/LowerTypeTests.cpp |
llvm::DenseMapBase<llvm::DenseMap<(anonymous namespace)::GlobalTypeMember*, unsigned long, llvm::DenseMapInfo<(anonymous namespace)::GlobalTypeMember*, void>, llvm::detail::DenseMapPair<(anonymous namespace)::GlobalTypeMember*, unsigned long>>, (anonymous namespace)::GlobalTypeMember*, unsigned long, llvm::DenseMapInfo... | void destroyAll() {
if (getNumBuckets() == 0) // Nothing to do.
return;
const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey();
for (BucketT *P = getBuckets(), *E = getBucketsEnd(); P != E; ++P) {
if (!KeyInfoT::isEqual(P->getFirst(), EmptyKey) &&
!KeyInfoT::isEqual(P->... | subq $0x38, %rsp
movq %rdi, 0x30(%rsp)
movq 0x30(%rsp), %rdi
movq %rdi, 0x8(%rsp)
callq 0x4794c60
cmpl $0x0, %eax
jne 0x479e0f2
jmp 0x479e18a
callq 0x4794b80
movq %rax, 0x28(%rsp)
callq 0x4795500
movq 0x8(%rsp), %rdi
movq %rax, 0x20(%rsp)
callq 0x4794b90
movq 0x8(%rsp), %rdi
movq %rax, 0x18(%rsp)
callq 0x4794ba0
movq %... | /llvm/ADT/DenseMap.h |
llvm::DenseMapBase<llvm::DenseMap<llvm::Metadata*, (anonymous namespace)::LowerTypeTestsModule::lower()::TIInfo, llvm::DenseMapInfo<llvm::Metadata*, void>, llvm::detail::DenseMapPair<llvm::Metadata*, (anonymous namespace)::LowerTypeTestsModule::lower()::TIInfo>>, llvm::Metadata*, (anonymous namespace)::LowerTypeTestsMo... | void destroyAll() {
if (getNumBuckets() == 0) // Nothing to do.
return;
const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey();
for (BucketT *P = getBuckets(), *E = getBucketsEnd(); P != E; ++P) {
if (!KeyInfoT::isEqual(P->getFirst(), EmptyKey) &&
!KeyInfoT::isEqual(P->... | subq $0x38, %rsp
movq %rdi, 0x30(%rsp)
movq 0x30(%rsp), %rdi
movq %rdi, 0x8(%rsp)
callq 0x4785bd0
cmpl $0x0, %eax
jne 0x47a1be2
jmp 0x47a1c82
callq 0x4785b10
movq %rax, 0x28(%rsp)
callq 0x4787de0
movq 0x8(%rsp), %rdi
movq %rax, 0x20(%rsp)
callq 0x4785b20
movq 0x8(%rsp), %rdi
movq %rax, 0x18(%rsp)
callq 0x4785b30
movq %... | /llvm/ADT/DenseMap.h |
llvm::cl::opt<bool, false, llvm::cl::parser<bool>>::opt<char [38], llvm::cl::initializer<bool>, llvm::cl::OptionHidden, llvm::cl::NumOccurrencesFlag, llvm::cl::desc>(char const (&) [38], llvm::cl::initializer<bool> const&, llvm::cl::OptionHidden const&, llvm::cl::NumOccurrencesFlag const&, llvm::cl::desc const&) | explicit opt(const Mods &... Ms)
: Option(llvm::cl::Optional, NotHidden), Parser(*this) {
apply(this, Ms...);
done();
} | subq $0x48, %rsp
movq %rdi, 0x40(%rsp)
movq %rsi, 0x38(%rsp)
movq %rdx, 0x30(%rsp)
movq %rcx, 0x28(%rsp)
movq %r8, 0x20(%rsp)
movq %r9, 0x18(%rsp)
movq 0x40(%rsp), %rdi
movq %rdi, 0x8(%rsp)
xorl %edx, %edx
movl %edx, %esi
callq 0x3f6a60
movq 0x8(%rsp), %rdi
addq $0x80, %rdi
callq 0x3f7700
movq 0x8(%rsp), %rsi
leaq 0x4f... | /llvm/Support/CommandLine.h |
llvm::MemProfContextDisambiguation::MemProfContextDisambiguation(llvm::ModuleSummaryIndex const*) | MemProfContextDisambiguation::MemProfContextDisambiguation(
const ModuleSummaryIndex *Summary)
: ImportSummary(Summary) {
if (ImportSummary) {
// The MemProfImportSummary should only be used for testing ThinLTO
// distributed backend handling via opt, in which case we don't have a
// summary from ... | subq $0x1c8, %rsp # imm = 0x1C8
movq %rdi, 0x1c0(%rsp)
movq %rsi, 0x1b8(%rsp)
movq 0x1c0(%rsp), %rdi
movq %rdi, 0x40(%rsp)
movq 0x1b8(%rsp), %rax
movq %rax, (%rdi)
addq $0x8, %rdi
callq 0x47a7560
movq 0x40(%rsp), %rax
cmpq $0x0, (%rax)
je 0x47a7238
jmp 0x47a7558
leaq 0x50091f1(%rip), %rdi # 0x97b0430
addq ... | /Transforms/IPO/MemProfContextDisambiguation.cpp |
llvm::DenseMapIterator<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Function, llvm::Instruction*>::CallInfo, unsigned int, llvm::DenseMapInfo<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Function, llvm::Instr... | void AdvancePastEmptyBuckets() {
assert(Ptr <= End);
const KeyT Empty = KeyInfoT::getEmptyKey();
const KeyT Tombstone = KeyInfoT::getTombstoneKey();
while (Ptr != End && (KeyInfoT::isEqual(Ptr->getFirst(), Empty) ||
KeyInfoT::isEqual(Ptr->getFirst(), Tombstone)))
++Ptr;
... | subq $0x78, %rsp
movq %rdi, 0x70(%rsp)
movq 0x70(%rsp), %rax
movq %rax, 0x8(%rsp)
callq 0x47acaf0
movl %edx, 0x48(%rsp)
movq %rax, 0x40(%rsp)
movl 0x48(%rsp), %eax
movl %eax, 0x58(%rsp)
movq 0x40(%rsp), %rax
movq %rax, 0x50(%rsp)
leaq 0x60(%rsp), %rdi
leaq 0x50(%rsp), %rsi
callq 0x47acb40
callq 0x47af4f0
movl %edx, 0x1... | /llvm/ADT/DenseMap.h |
llvm::detail::DenseMapPair<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Function, llvm::Instruction*>::CallInfo, unsigned int>* llvm::DenseMapBase<llvm::DenseMap<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::F... | BucketT *InsertIntoBucketImpl(const KeyT &Key, const LookupKeyT &Lookup,
BucketT *TheBucket) {
incrementEpoch();
// If the load of the hash table is more than 3/4, or if fewer than 1/8 of
// the buckets are empty (meaning that many are filled with tombstones),
// grow th... | subq $0x58, %rsp
movq %rdi, 0x50(%rsp)
movq %rsi, 0x48(%rsp)
movq %rdx, 0x40(%rsp)
movq %rcx, 0x38(%rsp)
movq 0x50(%rsp), %rdi
movq %rdi, 0x8(%rsp)
callq 0x548460
movq 0x8(%rsp), %rdi
callq 0x47af9c0
movq 0x8(%rsp), %rdi
addl $0x1, %eax
movl %eax, 0x34(%rsp)
callq 0x47acbe0
movl %eax, 0x30(%rsp)
movl 0x34(%rsp), %eax
s... | /llvm/ADT/DenseMap.h |
std::pair<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Function, llvm::Instruction*>::CallInfo, (anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Function, llvm::Instruction*>::ContextNode*> const* llvm::SmallVect... | static const T *reserveForParamAndGetAddressImpl(U *This, const T &Elt,
size_t N) {
size_t NewSize = This->size() + N;
if (LLVM_LIKELY(NewSize <= This->capacity()))
return &Elt;
bool ReferencesStorage = false;
int64_t Index = -1;
if (!U::Take... | subq $0x58, %rsp
movq %rdi, 0x48(%rsp)
movq %rsi, 0x40(%rsp)
movq %rdx, 0x38(%rsp)
movq 0x48(%rsp), %rdi
callq 0x3a8dca0
addq 0x38(%rsp), %rax
movq %rax, 0x30(%rsp)
movq 0x30(%rsp), %rax
movq %rax, 0x18(%rsp)
movq 0x48(%rsp), %rdi
callq 0x3a8dab0
movq %rax, %rcx
movq 0x18(%rsp), %rax
cmpq %rcx, %rax
ja 0x47afdd7
movq 0... | /llvm/ADT/SmallVector.h |
(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Function, llvm::Instruction*>::ContextNode::addOrUpdateCallerEdge((anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Function, llvm::Instruction*>::ContextNode*, llvm::A... | void CallsiteContextGraph<DerivedCCG, FuncTy, CallTy>::ContextNode::
addOrUpdateCallerEdge(ContextNode *Caller, AllocationType AllocType,
unsigned int ContextId) {
for (auto &Edge : CallerEdges) {
if (Edge->Caller == Caller) {
Edge->AllocTypes |= (uint8_t)AllocType;
Edge-... | subq $0xb8, %rsp
movb %dl, %al
movq %rdi, 0xb0(%rsp)
movq %rsi, 0xa8(%rsp)
movb %al, 0xa7(%rsp)
movl %ecx, 0xa0(%rsp)
movq 0xb0(%rsp), %rax
movq %rax, 0x10(%rsp)
addq $0x40, %rax
movq %rax, 0x98(%rsp)
movq 0x98(%rsp), %rdi
callq 0x47b27d0
movq %rax, 0x90(%rsp)
movq 0x98(%rsp), %rdi
callq 0x47b2800
movq %rax, 0x88(%rsp)... | /Transforms/IPO/MemProfContextDisambiguation.cpp |
llvm::DenseMapIterator<unsigned long, std::vector<std::tuple<llvm::Instruction*, std::vector<unsigned long, std::allocator<unsigned long>>, llvm::Function const*, llvm::DenseSet<unsigned int, llvm::DenseMapInfo<unsigned int, void>>>, std::allocator<std::tuple<llvm::Instruction*, std::vector<unsigned long, std::allocato... | inline DenseMapIterator& operator++() { // Preincrement
assert(isHandleInSync() && "invalid iterator access!");
assert(Ptr != End && "incrementing end() iterator");
if (shouldReverseIterate<KeyT>()) {
--Ptr;
RetreatPastEmptyBuckets();
return *this;
}
++Ptr;
AdvancePastEmptyBuc... | subq $0x18, %rsp
movq %rdi, 0x8(%rsp)
movq 0x8(%rsp), %rax
movq %rax, (%rsp)
callq 0x903c70
testb $0x1, %al
jne 0x47bb97d
jmp 0x47bb99b
movq (%rsp), %rdi
movq (%rdi), %rax
addq $-0x20, %rax
movq %rax, (%rdi)
callq 0x47bed20
movq (%rsp), %rax
movq %rax, 0x10(%rsp)
jmp 0x47bb9b7
movq (%rsp), %rdi
movq (%rdi), %rax
addq $... | /llvm/ADT/DenseMap.h |
llvm::DenseMapIterator<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Function, llvm::Instruction*>::CallInfo, unsigned int, llvm::DenseMapInfo<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Function, llvm::Instr... | void AdvancePastEmptyBuckets() {
assert(Ptr <= End);
const KeyT Empty = KeyInfoT::getEmptyKey();
const KeyT Tombstone = KeyInfoT::getTombstoneKey();
while (Ptr != End && (KeyInfoT::isEqual(Ptr->getFirst(), Empty) ||
KeyInfoT::isEqual(Ptr->getFirst(), Tombstone)))
++Ptr;
... | subq $0x78, %rsp
movq %rdi, 0x70(%rsp)
movq 0x70(%rsp), %rax
movq %rax, 0x8(%rsp)
callq 0x47acaf0
movl %edx, 0x48(%rsp)
movq %rax, 0x40(%rsp)
movl 0x48(%rsp), %eax
movl %eax, 0x58(%rsp)
movq 0x40(%rsp), %rax
movq %rax, 0x50(%rsp)
leaq 0x60(%rsp), %rdi
leaq 0x50(%rsp), %rsi
callq 0x47acb40
callq 0x47af4f0
movl %edx, 0x1... | /llvm/ADT/DenseMap.h |
llvm::DenseMapBase<llvm::DenseMap<unsigned long, std::vector<std::tuple<llvm::Instruction*, std::vector<unsigned long, std::allocator<unsigned long>>, llvm::Function const*, llvm::DenseSet<unsigned int, llvm::DenseMapInfo<unsigned int, void>>>, std::allocator<std::tuple<llvm::Instruction*, std::vector<unsigned long, st... | iterator makeIterator(BucketT *P, BucketT *E,
DebugEpochBase &Epoch,
bool NoAdvance=false) {
if (shouldReverseIterate<KeyT>()) {
BucketT *B = P == getBucketsEnd() ? getBuckets() : P + 1;
return iterator(B, E, Epoch, NoAdvance);
}
return iterator(P,... | subq $0x58, %rsp
movb %r8b, %al
movq %rdi, 0x40(%rsp)
movq %rsi, 0x38(%rsp)
movq %rdx, 0x30(%rsp)
movq %rcx, 0x28(%rsp)
andb $0x1, %al
movb %al, 0x27(%rsp)
movq 0x40(%rsp), %rax
movq %rax, 0x10(%rsp)
callq 0x903c70
testb $0x1, %al
jne 0x47bebf6
jmp 0x47bec62
movq 0x10(%rsp), %rdi
movq 0x38(%rsp), %rax
movq %rax, 0x8(%r... | /llvm/ADT/DenseMap.h |
llvm::DenseMapIterator<unsigned long, std::vector<std::tuple<llvm::Instruction*, std::vector<unsigned long, std::allocator<unsigned long>>, llvm::Function const*, llvm::DenseSet<unsigned int, llvm::DenseMapInfo<unsigned int, void>>>, std::allocator<std::tuple<llvm::Instruction*, std::vector<unsigned long, std::allocato... | DenseMapIterator(pointer Pos, pointer E, const DebugEpochBase &Epoch,
bool NoAdvance = false)
: DebugEpochBase::HandleBase(&Epoch), Ptr(Pos), End(E) {
assert(isHandleInSync() && "invalid construction!");
if (NoAdvance) return;
if (shouldReverseIterate<KeyT>()) {
RetreatPastEm... | subq $0x38, %rsp
movb %r8b, %al
movq %rdi, 0x30(%rsp)
movq %rsi, 0x28(%rsp)
movq %rdx, 0x20(%rsp)
movq %rcx, 0x18(%rsp)
andb $0x1, %al
movb %al, 0x17(%rsp)
movq 0x30(%rsp), %rdi
movq %rdi, 0x8(%rsp)
movq 0x18(%rsp), %rsi
callq 0x5481a0
movq 0x8(%rsp), %rax
movq 0x28(%rsp), %rcx
movq %rcx, (%rax)
movq 0x20(%rsp), %rcx
m... | /llvm/ADT/DenseMap.h |
llvm::DenseMapIterator<unsigned long, std::vector<std::tuple<llvm::Instruction*, std::vector<unsigned long, std::allocator<unsigned long>>, llvm::Function const*, llvm::DenseSet<unsigned int, llvm::DenseMapInfo<unsigned int, void>>>, std::allocator<std::tuple<llvm::Instruction*, std::vector<unsigned long, std::allocato... | void AdvancePastEmptyBuckets() {
assert(Ptr <= End);
const KeyT Empty = KeyInfoT::getEmptyKey();
const KeyT Tombstone = KeyInfoT::getTombstoneKey();
while (Ptr != End && (KeyInfoT::isEqual(Ptr->getFirst(), Empty) ||
KeyInfoT::isEqual(Ptr->getFirst(), Tombstone)))
++Ptr;
... | subq $0x28, %rsp
movq %rdi, 0x20(%rsp)
movq 0x20(%rsp), %rax
movq %rax, 0x8(%rsp)
callq 0x9034f0
movq %rax, 0x18(%rsp)
callq 0x903850
movq %rax, 0x10(%rsp)
movq 0x8(%rsp), %rdx
movq (%rdx), %rcx
xorl %eax, %eax
cmpq 0x8(%rdx), %rcx
movb %al, 0x7(%rsp)
je 0x47bee68
movq 0x8(%rsp), %rax
movq (%rax), %rdi
callq 0x47bb0d0
... | /llvm/ADT/DenseMap.h |
llvm::DenseMapBase<llvm::DenseMap<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Function, llvm::Instruction*>::ContextEdge const*, llvm::detail::DenseSetEmpty, llvm::DenseMapInfo<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteConte... | unsigned getMinBucketToReserveForEntries(unsigned NumEntries) {
// Ensure that "NumEntries * 4 < NumBuckets * 3"
if (NumEntries == 0)
return 0;
// +1 is required because of the strict equality.
// For example if NumEntries is 48, we need to return 401.
return NextPowerOf2(NumEntries * 4 / 3 + ... | subq $0x18, %rsp
movq %rdi, 0x8(%rsp)
movl %esi, 0x4(%rsp)
cmpl $0x0, 0x4(%rsp)
jne 0x47c354e
movl $0x0, 0x14(%rsp)
jmp 0x47c356e
movl 0x4(%rsp), %eax
shll $0x2, %eax
movl $0x3, %ecx
xorl %edx, %edx
divl %ecx
addl $0x1, %eax
movl %eax, %eax
movl %eax, %edi
callq 0x5487c0
movl %eax, 0x14(%rsp)
movl 0x14(%rsp), %eax
addq... | /llvm/ADT/DenseMap.h |
bool llvm::DenseMapBase<llvm::DenseMap<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Function, llvm::Instruction*>::ContextEdge const*, llvm::detail::DenseSetEmpty, llvm::DenseMapInfo<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsite... | bool LookupBucketFor(const LookupKeyT &Val,
const BucketT *&FoundBucket) const {
const BucketT *BucketsPtr = getBuckets();
const unsigned NumBuckets = getNumBuckets();
if (NumBuckets == 0) {
FoundBucket = nullptr;
return false;
}
// FoundTombstone - Keep track of... | subq $0x78, %rsp
movq %rdi, 0x68(%rsp)
movq %rsi, 0x60(%rsp)
movq %rdx, 0x58(%rsp)
movq 0x68(%rsp), %rdi
movq %rdi, 0x18(%rsp)
callq 0x47c3ec0
movq 0x18(%rsp), %rdi
movq %rax, 0x50(%rsp)
callq 0x47c3790
movl %eax, 0x4c(%rsp)
cmpl $0x0, 0x4c(%rsp)
jne 0x47c3d72
movq 0x58(%rsp), %rax
movq $0x0, (%rax)
movb $0x0, 0x77(%rs... | /llvm/ADT/DenseMap.h |
llvm::DenseMapIterator<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Function, llvm::Instruction*>::ContextEdge const*, llvm::detail::DenseSetEmpty, llvm::DenseMapInfo<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, ll... | void RetreatPastEmptyBuckets() {
assert(Ptr >= End);
const KeyT Empty = KeyInfoT::getEmptyKey();
const KeyT Tombstone = KeyInfoT::getTombstoneKey();
while (Ptr != End && (KeyInfoT::isEqual(Ptr[-1].getFirst(), Empty) ||
KeyInfoT::isEqual(Ptr[-1].getFirst(), Tombstone)))
-... | subq $0x28, %rsp
movq %rdi, 0x20(%rsp)
movq 0x20(%rsp), %rax
movq %rax, 0x8(%rsp)
callq 0x47c3760
movq %rax, 0x18(%rsp)
callq 0x47c3f30
movq %rax, 0x10(%rsp)
movq 0x8(%rsp), %rdx
movq (%rdx), %rcx
xorl %eax, %eax
cmpq 0x8(%rdx), %rcx
movb %al, 0x7(%rsp)
je 0x47c40c0
movq 0x8(%rsp), %rax
movq (%rax), %rdi
addq $-0x8, %r... | /llvm/ADT/DenseMap.h |
llvm::DenseMapBase<llvm::DenseMap<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Function, llvm::Instruction*>::ContextEdge const*, llvm::detail::DenseSetEmpty, llvm::DenseMapInfo<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteConte... | void destroyAll() {
if (getNumBuckets() == 0) // Nothing to do.
return;
const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey();
for (BucketT *P = getBuckets(), *E = getBucketsEnd(); P != E; ++P) {
if (!KeyInfoT::isEqual(P->getFirst(), EmptyKey) &&
!KeyInfoT::isEqual(P->... | subq $0x38, %rsp
movq %rdi, 0x30(%rsp)
movq 0x30(%rsp), %rdi
movq %rdi, 0x8(%rsp)
callq 0x47c3790
cmpl $0x0, %eax
jne 0x47c4b52
jmp 0x47c4bea
callq 0x47c36b0
movq %rax, 0x28(%rsp)
callq 0x47c3ed0
movq 0x8(%rsp), %rdi
movq %rax, 0x20(%rsp)
callq 0x47c36c0
movq 0x8(%rsp), %rdi
movq %rax, 0x18(%rsp)
callq 0x47c36d0
movq %... | /llvm/ADT/DenseMap.h |
llvm::DenseMap<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Function, llvm::Instruction*>::ContextNode const*, llvm::detail::DenseSetEmpty, llvm::DenseMapInfo<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Func... | void init(unsigned InitNumEntries) {
auto InitBuckets = BaseT::getMinBucketToReserveForEntries(InitNumEntries);
if (allocateBuckets(InitBuckets)) {
this->BaseT::initEmpty();
} else {
NumEntries = 0;
NumTombstones = 0;
}
} | subq $0x18, %rsp
movq %rdi, 0x10(%rsp)
movl %esi, 0xc(%rsp)
movq 0x10(%rsp), %rdi
movq %rdi, (%rsp)
movl 0xc(%rsp), %esi
callq 0x47c52f0
movq (%rsp), %rdi
movl %eax, 0x8(%rsp)
movl 0x8(%rsp), %esi
callq 0x47c5340
testb $0x1, %al
jne 0x47c52c6
jmp 0x47c52d1
movq (%rsp), %rdi
callq 0x47c53b0
jmp 0x47c52e3
movq (%rsp), %r... | /llvm/ADT/DenseMap.h |
llvm::DenseMap<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Function, llvm::Instruction*>::ContextNode const*, llvm::detail::DenseSetEmpty, llvm::DenseMapInfo<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Func... | bool allocateBuckets(unsigned Num) {
NumBuckets = Num;
if (NumBuckets == 0) {
Buckets = nullptr;
return false;
}
Buckets = static_cast<BucketT *>(
allocate_buffer(sizeof(BucketT) * NumBuckets, alignof(BucketT)));
return true;
} | subq $0x28, %rsp
movq %rdi, 0x18(%rsp)
movl %esi, 0x14(%rsp)
movq 0x18(%rsp), %rax
movq %rax, 0x8(%rsp)
movl 0x14(%rsp), %ecx
movl %ecx, 0x10(%rax)
cmpl $0x0, 0x10(%rax)
jne 0x47c5377
movq 0x8(%rsp), %rax
movq $0x0, (%rax)
movb $0x0, 0x27(%rsp)
jmp 0x47c539f
movq 0x8(%rsp), %rax
movl 0x10(%rax), %eax
movl %eax, %edi
sh... | /llvm/ADT/DenseMap.h |
llvm::DenseMapBase<llvm::DenseMap<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Function, llvm::Instruction*>::ContextNode const*, llvm::detail::DenseSetEmpty, llvm::DenseMapInfo<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteConte... | void initEmpty() {
setNumEntries(0);
setNumTombstones(0);
assert((getNumBuckets() & (getNumBuckets()-1)) == 0 &&
"# initial buckets must be a power of two!");
const KeyT EmptyKey = getEmptyKey();
for (BucketT *B = getBuckets(), *E = getBucketsEnd(); B != E; ++B)
::new (&B->getFirst... | subq $0x28, %rsp
movq %rdi, 0x20(%rsp)
movq 0x20(%rsp), %rdi
movq %rdi, (%rsp)
xorl %esi, %esi
callq 0x47c5430
movq (%rsp), %rdi
xorl %esi, %esi
callq 0x47c5450
callq 0x47c5470
movq (%rsp), %rdi
movq %rax, 0x18(%rsp)
callq 0x47c5480
movq (%rsp), %rdi
movq %rax, 0x10(%rsp)
callq 0x47c5490
movq %rax, 0x8(%rsp)
movq 0x10(... | /llvm/ADT/DenseMap.h |
llvm::DenseMap<llvm::ValueInfo, llvm::CallsiteInfo, llvm::DenseMapInfo<llvm::ValueInfo, void>, llvm::detail::DenseMapPair<llvm::ValueInfo, llvm::CallsiteInfo>>::grow(unsigned int) | void grow(unsigned AtLeast) {
unsigned OldNumBuckets = NumBuckets;
BucketT *OldBuckets = Buckets;
allocateBuckets(std::max<unsigned>(64, static_cast<unsigned>(NextPowerOf2(AtLeast-1))));
assert(Buckets);
if (!OldBuckets) {
this->BaseT::initEmpty();
return;
}
this->moveFromOldBu... | subq $0x28, %rsp
movq %rdi, 0x20(%rsp)
movl %esi, 0x1c(%rsp)
movq 0x20(%rsp), %rax
movq %rax, (%rsp)
movl 0x10(%rax), %ecx
movl %ecx, 0x18(%rsp)
movq (%rax), %rax
movq %rax, 0x10(%rsp)
movl $0x40, 0xc(%rsp)
movl 0x1c(%rsp), %eax
subl $0x1, %eax
movl %eax, %eax
movl %eax, %edi
callq 0x5487c0
movl %eax, 0x8(%rsp)
leaq 0x... | /llvm/ADT/DenseMap.h |
llvm::DenseMap<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Function, llvm::Instruction*>::ContextNode const*, llvm::detail::DenseSetEmpty, llvm::DenseMapInfo<(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Func... | void shrink_and_clear() {
unsigned OldNumBuckets = NumBuckets;
unsigned OldNumEntries = NumEntries;
this->destroyAll();
// Reduce the number of buckets.
unsigned NewNumBuckets = 0;
if (OldNumEntries)
NewNumBuckets = std::max(64, 1 << (Log2_32_Ceil(OldNumEntries) + 1));
if (NewNumBucke... | subq $0x28, %rsp
movq %rdi, 0x20(%rsp)
movq 0x20(%rsp), %rdi
movq %rdi, (%rsp)
movl 0x10(%rdi), %eax
movl %eax, 0x1c(%rsp)
movl 0x8(%rdi), %eax
movl %eax, 0x18(%rsp)
callq 0x47c82e0
movl $0x0, 0x14(%rsp)
cmpl $0x0, 0x18(%rsp)
je 0x47cf57a
movl $0x40, 0x10(%rsp)
movl 0x18(%rsp), %edi
callq 0x91b7e0
movl %eax, %ecx
addl ... | /llvm/ADT/DenseMap.h |
llvm::DenseSet<unsigned int, llvm::DenseMapInfo<unsigned int, void>> llvm::set_intersection_impl<llvm::DenseSet<unsigned int, llvm::DenseMapInfo<unsigned int, void>>, llvm::DenseSet<unsigned int, llvm::DenseMapInfo<unsigned int, void>>>(llvm::DenseSet<unsigned int, llvm::DenseMapInfo<unsigned int, void>> const&, llvm::... | S1Ty set_intersection_impl(const S1Ty &S1, const S2Ty &S2) {
S1Ty Result;
for (const auto &E : S1)
if (S2.count(E))
Result.insert(E);
return Result;
} | subq $0x78, %rsp
movq %rdi, (%rsp)
movq %rdi, %rax
movq %rax, 0x8(%rsp)
movq %rdi, 0x70(%rsp)
movq %rsi, 0x68(%rsp)
movq %rdx, 0x60(%rsp)
movb $0x0, 0x5f(%rsp)
callq 0x770d70
movq 0x68(%rsp), %rax
movq %rax, 0x50(%rsp)
movq 0x50(%rsp), %rdi
callq 0x47b72f0
movq %rax, 0x40(%rsp)
movq %rdx, 0x48(%rsp)
movq 0x50(%rsp), %r... | /llvm/ADT/SetOperations.h |
(anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Function, llvm::Instruction*>::removeNoneTypeCalleeEdges((anonymous namespace)::CallsiteContextGraph<(anonymous namespace)::ModuleCallsiteContextGraph, llvm::Function, llvm::Instruction*>::ContextNode*) | void CallsiteContextGraph<
DerivedCCG, FuncTy, CallTy>::removeNoneTypeCalleeEdges(ContextNode *Node) {
for (auto EI = Node->CalleeEdges.begin(); EI != Node->CalleeEdges.end();) {
auto Edge = *EI;
if (Edge->AllocTypes == (uint8_t)AllocationType::None) {
assert(Edge->ContextIds.empty());
Edge->C... | subq $0x58, %rsp
movq %rdi, 0x50(%rsp)
movq %rsi, 0x48(%rsp)
movq 0x48(%rsp), %rdi
addq $0x28, %rdi
callq 0x47b27d0
movq %rax, 0x40(%rsp)
movq 0x48(%rsp), %rdi
addq $0x28, %rdi
callq 0x47b2800
movq %rax, 0x38(%rsp)
leaq 0x40(%rsp), %rdi
leaq 0x38(%rsp), %rsi
callq 0x47b2830
testb $0x1, %al
jne 0x47d453c
jmp 0x47d45e5
l... | /Transforms/IPO/MemProfContextDisambiguation.cpp |
llvm::DenseMapIterator<unsigned int, unsigned long, llvm::DenseMapInfo<unsigned int, void>, llvm::detail::DenseMapPair<unsigned int, unsigned long>, true>::RetreatPastEmptyBuckets() | void RetreatPastEmptyBuckets() {
assert(Ptr >= End);
const KeyT Empty = KeyInfoT::getEmptyKey();
const KeyT Tombstone = KeyInfoT::getTombstoneKey();
while (Ptr != End && (KeyInfoT::isEqual(Ptr[-1].getFirst(), Empty) ||
KeyInfoT::isEqual(Ptr[-1].getFirst(), Tombstone)))
-... | subq $0x28, %rsp
movq %rdi, 0x20(%rsp)
movq 0x20(%rsp), %rax
movq %rax, 0x10(%rsp)
callq 0x5479c0
movl %eax, 0x1c(%rsp)
callq 0x5480c0
movl %eax, 0x18(%rsp)
movq 0x10(%rsp), %rdx
movq (%rdx), %rcx
xorl %eax, %eax
cmpq 0x8(%rdx), %rcx
movb %al, 0xf(%rsp)
je 0x47df3ae
movq 0x10(%rsp), %rax
movq (%rax), %rdi
addq $-0x10, ... | /llvm/ADT/DenseMap.h |
llvm::DenseMapIterator<unsigned int, unsigned long, llvm::DenseMapInfo<unsigned int, void>, llvm::detail::DenseMapPair<unsigned int, unsigned long>, true>::AdvancePastEmptyBuckets() | void AdvancePastEmptyBuckets() {
assert(Ptr <= End);
const KeyT Empty = KeyInfoT::getEmptyKey();
const KeyT Tombstone = KeyInfoT::getTombstoneKey();
while (Ptr != End && (KeyInfoT::isEqual(Ptr->getFirst(), Empty) ||
KeyInfoT::isEqual(Ptr->getFirst(), Tombstone)))
++Ptr;
... | subq $0x28, %rsp
movq %rdi, 0x20(%rsp)
movq 0x20(%rsp), %rax
movq %rax, 0x10(%rsp)
callq 0x5479c0
movl %eax, 0x1c(%rsp)
callq 0x5480c0
movl %eax, 0x18(%rsp)
movq 0x10(%rsp), %rdx
movq (%rdx), %rcx
xorl %eax, %eax
cmpq 0x8(%rdx), %rcx
movb %al, 0xf(%rsp)
je 0x47df466
movq 0x10(%rsp), %rax
movq (%rax), %rdi
callq 0x15674... | /llvm/ADT/DenseMap.h |
llvm::DenseMap<llvm::AssertingVH<llvm::Function>, std::_Rb_tree_const_iterator<(anonymous namespace)::FunctionNode>, llvm::DenseMapInfo<llvm::AssertingVH<llvm::Function>, void>, llvm::detail::DenseMapPair<llvm::AssertingVH<llvm::Function>, std::_Rb_tree_const_iterator<(anonymous namespace)::FunctionNode>>>::allocateBuc... | bool allocateBuckets(unsigned Num) {
NumBuckets = Num;
if (NumBuckets == 0) {
Buckets = nullptr;
return false;
}
Buckets = static_cast<BucketT *>(
allocate_buffer(sizeof(BucketT) * NumBuckets, alignof(BucketT)));
return true;
} | subq $0x28, %rsp
movq %rdi, 0x18(%rsp)
movl %esi, 0x14(%rsp)
movq 0x18(%rsp), %rax
movq %rax, 0x8(%rsp)
movl 0x14(%rsp), %ecx
movl %ecx, 0x10(%rax)
cmpl $0x0, 0x10(%rax)
jne 0x47e0dd7
movq 0x8(%rsp), %rax
movq $0x0, (%rax)
movb $0x0, 0x27(%rsp)
jmp 0x47e0dff
movq 0x8(%rsp), %rax
movl 0x10(%rax), %eax
movl %eax, %edi
sh... | /llvm/ADT/DenseMap.h |
llvm::DenseMapBase<llvm::DenseMap<llvm::ValueMapCallbackVH<llvm::GlobalValue*, unsigned long, llvm::GlobalNumberState::Config>, unsigned long, llvm::DenseMapInfo<llvm::ValueMapCallbackVH<llvm::GlobalValue*, unsigned long, llvm::GlobalNumberState::Config>, void>, llvm::detail::DenseMapPair<llvm::ValueMapCallbackVH<llvm:... | void destroyAll() {
if (getNumBuckets() == 0) // Nothing to do.
return;
const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey();
for (BucketT *P = getBuckets(), *E = getBucketsEnd(); P != E; ++P) {
if (!KeyInfoT::isEqual(P->getFirst(), EmptyKey) &&
!KeyInfoT::isEqual(P->... | subq $0x78, %rsp
movq %rdi, 0x70(%rsp)
movq 0x70(%rsp), %rdi
movq %rdi, 0x8(%rsp)
callq 0x47e09a0
cmpl $0x0, %eax
jne 0x47e16b2
jmp 0x47e1766
leaq 0x48(%rsp), %rdi
callq 0x47e0280
leaq 0x20(%rsp), %rdi
callq 0x47e06c0
movq 0x8(%rsp), %rdi
callq 0x47e02a0
movq 0x8(%rsp), %rdi
movq %rax, 0x18(%rsp)
callq 0x47e02b0
movq %... | /llvm/ADT/DenseMap.h |
(anonymous namespace)::MergeFunctions::insert(llvm::Function*) | bool MergeFunctions::insert(Function *NewFunction) {
std::pair<FnTreeType::iterator, bool> Result =
FnTree.insert(FunctionNode(NewFunction));
if (Result.second) {
assert(FNodesInTree.count(NewFunction) == 0);
FNodesInTree.insert({NewFunction, Result.first});
LLVM_DEBUG(dbgs() << "Inserting as uni... | subq $0xa8, %rsp
movq %rdi, 0x98(%rsp)
movq %rsi, 0x90(%rsp)
movq 0x98(%rsp), %rax
movq %rax, 0x8(%rsp)
addq $0xa0, %rax
movq %rax, 0x10(%rsp)
movq 0x90(%rsp), %rsi
leaq 0x70(%rsp), %rdi
movq %rdi, 0x18(%rsp)
callq 0x47e6700
movq 0x10(%rsp), %rdi
movq 0x18(%rsp), %rsi
callq 0x47e66a0
movb %dl, 0x68(%rsp)
movq %rax, 0x6... | /Transforms/IPO/MergeFunctions.cpp |
llvm::DenseMapBase<llvm::DenseMap<llvm::Value const*, int, llvm::DenseMapInfo<llvm::Value const*, void>, llvm::detail::DenseMapPair<llvm::Value const*, int>>, llvm::Value const*, int, llvm::DenseMapInfo<llvm::Value const*, void>, llvm::detail::DenseMapPair<llvm::Value const*, int>>::getMinBucketToReserveForEntries(unsi... | unsigned getMinBucketToReserveForEntries(unsigned NumEntries) {
// Ensure that "NumEntries * 4 < NumBuckets * 3"
if (NumEntries == 0)
return 0;
// +1 is required because of the strict equality.
// For example if NumEntries is 48, we need to return 401.
return NextPowerOf2(NumEntries * 4 / 3 + ... | subq $0x18, %rsp
movq %rdi, 0x8(%rsp)
movl %esi, 0x4(%rsp)
cmpl $0x0, 0x4(%rsp)
jne 0x47e756e
movl $0x0, 0x14(%rsp)
jmp 0x47e758e
movl 0x4(%rsp), %eax
shll $0x2, %eax
movl $0x3, %ecx
xorl %edx, %edx
divl %ecx
addl $0x1, %eax
movl %eax, %eax
movl %eax, %edi
callq 0x5487c0
movl %eax, 0x14(%rsp)
movl 0x14(%rsp), %eax
addq... | /llvm/ADT/DenseMap.h |
llvm::cl::opt<bool, false, llvm::cl::parser<bool>>::opt<char [30], llvm::cl::desc, llvm::cl::OptionHidden, llvm::cl::initializer<bool>>(char const (&) [30], llvm::cl::desc const&, llvm::cl::OptionHidden const&, llvm::cl::initializer<bool> const&) | explicit opt(const Mods &... Ms)
: Option(llvm::cl::Optional, NotHidden), Parser(*this) {
apply(this, Ms...);
done();
} | subq $0x38, %rsp
movq %rdi, 0x30(%rsp)
movq %rsi, 0x28(%rsp)
movq %rdx, 0x20(%rsp)
movq %rcx, 0x18(%rsp)
movq %r8, 0x10(%rsp)
movq 0x30(%rsp), %rdi
movq %rdi, (%rsp)
xorl %edx, %edx
movl %edx, %esi
callq 0x3f6a60
movq (%rsp), %rdi
addq $0x80, %rdi
callq 0x3f7700
movq (%rsp), %rsi
leaq 0x4eef686(%rip), %rax # 0x96df18... | /llvm/Support/CommandLine.h |
(anonymous namespace)::OpenMPOpt::registerAAsForFunction(llvm::Attributor&, llvm::Function const&) | void OpenMPOpt::registerAAsForFunction(Attributor &A, const Function &F) {
if (!DisableOpenMPOptDeglobalization)
A.getOrCreateAAFor<AAHeapToShared>(IRPosition::function(F));
A.getOrCreateAAFor<AAExecutionDomain>(IRPosition::function(F));
if (!DisableOpenMPOptDeglobalization)
A.getOrCreateAAFor<AAHeapToSta... | subq $0x1b8, %rsp # imm = 0x1B8
movq %rdi, 0x1b0(%rsp)
movq %rsi, 0x1a8(%rsp)
leaq 0x4fc00da(%rip), %rdi # 0x97b0f18
addq $0x80, %rdi
callq 0x3f1b60
testb $0x1, %al
jne 0x47f0e8e
movq 0x1b0(%rsp), %rax
movq %rax, 0x40(%rsp)
movq 0x1a8(%rsp), %rdi
xorl %eax, %eax
movl %eax, %esi
callq 0xefcc60
movq 0x40(%rs... | /Transforms/IPO/OpenMPOpt.cpp |
(anonymous namespace)::AAExecutionDomainFunction::isInitialThreadOnlyEdge(llvm::Attributor&, llvm::BranchInst*, llvm::BasicBlock&) | static bool isInitialThreadOnlyEdge(Attributor &A, BranchInst *Edge,
BasicBlock &SuccessorBB) {
if (!Edge || !Edge->isConditional())
return false;
if (Edge->getSuccessor(0) != &SuccessorBB)
return false;
auto *Cmp = dyn_cast<CmpInst>(Edge->getCondition());
... | subq $0x78, %rsp
movq %rdi, 0x68(%rsp)
movq %rsi, 0x60(%rsp)
movq %rdx, 0x58(%rsp)
cmpq $0x0, 0x60(%rsp)
je 0x47f75d9
movq 0x60(%rsp), %rdi
callq 0xc70fb0
testb $0x1, %al
jne 0x47f75e3
movb $0x0, 0x77(%rsp)
jmp 0x47f77d9
movq 0x60(%rsp), %rdi
xorl %esi, %esi
callq 0xb89d10
cmpq 0x58(%rsp), %rax
je 0x47f7600
movb $0x0, ... | /Transforms/IPO/OpenMPOpt.cpp |
(anonymous namespace)::OMPInformationCache::collectUses((anonymous namespace)::OMPInformationCache::RuntimeFunctionInfo&, bool) | unsigned collectUses(RuntimeFunctionInfo &RFI, bool CollectStats = true) {
unsigned NumUses = 0;
if (!RFI.Declaration)
return NumUses;
OMPBuilder.addAttributes(RFI.Kind, *RFI.Declaration);
if (CollectStats) {
NumOpenMPRuntimeFunctionsIdentified += 1;
NumOpenMPRuntimeFunctionUsesIdenti... | subq $0x98, %rsp
movb %dl, %al
movq %rdi, 0x88(%rsp)
movq %rsi, 0x80(%rsp)
andb $0x1, %al
movb %al, 0x7f(%rsp)
movq 0x88(%rsp), %rax
movq %rax, 0x20(%rsp)
movl $0x0, 0x78(%rsp)
movq 0x80(%rsp), %rax
cmpq $0x0, 0x78(%rax)
jne 0x4816513
movl 0x78(%rsp), %eax
movl %eax, 0x94(%rsp)
jmp 0x48166f8
movq 0x20(%rsp), %rdi
addq ... | /Transforms/IPO/OpenMPOpt.cpp |
llvm::DenseMapBase<llvm::DenseMap<llvm::Function*, std::shared_ptr<llvm::SmallVector<llvm::Use*, 16u>>, llvm::DenseMapInfo<llvm::Function*, void>, llvm::detail::DenseMapPair<llvm::Function*, std::shared_ptr<llvm::SmallVector<llvm::Use*, 16u>>>>, llvm::Function*, std::shared_ptr<llvm::SmallVector<llvm::Use*, 16u>>, llvm... | void moveFromOldBuckets(BucketT *OldBucketsBegin, BucketT *OldBucketsEnd) {
initEmpty();
// Insert all the old elements.
const KeyT EmptyKey = getEmptyKey();
const KeyT TombstoneKey = getTombstoneKey();
for (BucketT *B = OldBucketsBegin, *E = OldBucketsEnd; B != E; ++B) {
if (!KeyInfoT::isEqu... | subq $0x68, %rsp
movq %rdi, 0x60(%rsp)
movq %rsi, 0x58(%rsp)
movq %rdx, 0x50(%rsp)
movq 0x60(%rsp), %rdi
movq %rdi, 0x18(%rsp)
callq 0x4815e50
callq 0x4815f10
movq %rax, 0x48(%rsp)
callq 0x4817280
movq %rax, 0x40(%rsp)
movq 0x58(%rsp), %rax
movq %rax, 0x38(%rsp)
movq 0x50(%rsp), %rax
movq %rax, 0x30(%rsp)
movq 0x38(%rs... | /llvm/ADT/DenseMap.h |
(anonymous namespace)::AAHeapToShared* llvm::Attributor::lookupAAFor<(anonymous namespace)::AAHeapToShared>(llvm::IRPosition const&, llvm::AbstractAttribute const*, llvm::DepClassTy, bool) | AAType *lookupAAFor(const IRPosition &IRP,
const AbstractAttribute *QueryingAA = nullptr,
DepClassTy DepClass = DepClassTy::OPTIONAL,
bool AllowInvalidState = false) {
static_assert(std::is_base_of<AbstractAttribute, AAType>::value,
... | subq $0x68, %rsp
movb %r8b, %al
movq %rdi, 0x58(%rsp)
movq %rsi, 0x50(%rsp)
movq %rdx, 0x48(%rsp)
movl %ecx, 0x44(%rsp)
andb $0x1, %al
movb %al, 0x43(%rsp)
movq 0x58(%rsp), %rax
movq %rax, (%rsp)
addq $0x68, %rax
movq %rax, 0x8(%rsp)
leaq 0x3c47117(%rip), %rax # 0x845f670
movq %rax, 0x18(%rsp)
movq 0x50(%rsp), %rdx
l... | /llvm/Transforms/IPO/Attributor.h |
void llvm::Attributor::emitRemark<llvm::OptimizationRemark, (anonymous namespace)::AAHeapToSharedFunction::manifest(llvm::Attributor&)::'lambda'(llvm::OptimizationRemark)&>(llvm::Instruction*, llvm::StringRef, (anonymous namespace)::AAHeapToSharedFunction::manifest(llvm::Attributor&)::'lambda'(llvm::OptimizationRemark)... | void emitRemark(Instruction *I, StringRef RemarkName,
RemarkCallBack &&RemarkCB) const {
if (!Configuration.OREGetter)
return;
Function *F = I->getFunction();
auto &ORE = Configuration.OREGetter(F);
if (RemarkName.starts_with("OMP"))
ORE.emit([&]() {
return Remark... | subq $0xb8, %rsp
movq %rdx, 0xa8(%rsp)
movq %rcx, 0xb0(%rsp)
movq %rdi, 0xa0(%rsp)
movq %rsi, 0x98(%rsp)
movq %r8, 0x90(%rsp)
movq 0xa0(%rsp), %rdi
movq %rdi, 0x28(%rsp)
addq $0x1040, %rdi # imm = 0x1040
addq $0x60, %rdi
callq 0x4612c60
testb $0x1, %al
jne 0x481a385
jmp 0x481a4c1
movq 0x98(%rsp), %rdi
callq 0... | /llvm/Transforms/IPO/Attributor.h |
void llvm::OptimizationRemarkEmitter::emit<void llvm::Attributor::emitRemark<llvm::OptimizationRemark, (anonymous namespace)::AAHeapToSharedFunction::manifest(llvm::Attributor&)::'lambda'(llvm::OptimizationRemark)&>(llvm::Instruction*, llvm::StringRef, (anonymous namespace)::AAHeapToSharedFunction::manifest(llvm::Attri... | void emit(T RemarkBuilder, decltype(RemarkBuilder()) * = nullptr) {
// Avoid building the remark unless we know there are at least *some*
// remarks enabled. We can't currently check whether remarks are requested
// for the calling pass since that requires actually building the remark.
if (enabled()) {... | subq $0x1d8, %rsp # imm = 0x1D8
leaq 0x1e0(%rsp), %rax
movq %rax, 0x8(%rsp)
movq %rdi, 0x1d0(%rsp)
movq %rsi, 0x1c8(%rsp)
movq 0x1d0(%rsp), %rdi
movq %rdi, 0x10(%rsp)
callq 0x7d9bc0
testb $0x1, %al
jne 0x481a57c
jmp 0x481a5a4
movq 0x8(%rsp), %rsi
leaq 0x18(%rsp), %rdi
callq 0x481a850
movq 0x10(%rsp), %rdi
le... | /llvm/Analysis/OptimizationRemarkEmitter.h |
(anonymous namespace)::OpenMPOpt::printKernels() const | void printKernels() const {
for (Function *F : SCC) {
if (!omp::isOpenMPKernel(*F))
continue;
auto Remark = [&](OptimizationRemarkAnalysis ORA) {
return ORA << "OpenMP GPU kernel "
<< ore::NV("OpenMPGPUKernel", F->getName()) << "\n";
};
emitRemark<Optimiz... | subq $0x58, %rsp
movq %rdi, 0x50(%rsp)
movq 0x50(%rsp), %rax
movq %rax, 0x10(%rsp)
movq 0x20(%rax), %rax
movq %rax, 0x48(%rsp)
movq 0x48(%rsp), %rdi
callq 0x7e1af0
movq %rax, 0x40(%rsp)
movq 0x48(%rsp), %rdi
callq 0x7e1b20
movq %rax, 0x38(%rsp)
movq 0x40(%rsp), %rax
cmpq 0x38(%rsp), %rax
je 0x481bb36
movq 0x40(%rsp), %... | /Transforms/IPO/OpenMPOpt.cpp |
llvm::SetVector<llvm::CallBase*, llvm::SmallVector<llvm::CallBase*, 0u>, llvm::DenseSet<llvm::CallBase*, llvm::DenseMapInfo<llvm::CallBase*, void>>, 0u>::insert(llvm::CallBase* const&) | bool insert(const value_type &X) {
if constexpr (canBeSmall())
if (isSmall()) {
if (!llvm::is_contained(vector_, X)) {
vector_.push_back(X);
if (vector_.size() > N)
makeBig();
return true;
}
return false;
}
bool result = set_.insert(... | subq $0x38, %rsp
movq %rdi, 0x30(%rsp)
movq %rsi, 0x28(%rsp)
movq 0x30(%rsp), %rsi
movq %rsi, (%rsp)
movq 0x28(%rsp), %rdx
leaq 0x8(%rsp), %rdi
callq 0x45d02e0
movb 0x18(%rsp), %al
andb $0x1, %al
movb %al, 0x27(%rsp)
testb $0x1, 0x27(%rsp)
je 0x481ff6c
movq (%rsp), %rdi
addq $0x18, %rdi
movq 0x28(%rsp), %rax
movq (%rax... | /llvm/ADT/SetVector.h |
void llvm::OptimizationRemarkEmitter::emit<void llvm::Attributor::emitRemark<llvm::OptimizationRemarkAnalysis, (anonymous namespace)::AAKernelInfoFunction::buildCustomStateMachine(llvm::Attributor&, llvm::ChangeStatus&)::'lambda'(llvm::OptimizationRemarkAnalysis)&>(llvm::Instruction*, llvm::StringRef, (anonymous namesp... | void emit(T RemarkBuilder, decltype(RemarkBuilder()) * = nullptr) {
// Avoid building the remark unless we know there are at least *some*
// remarks enabled. We can't currently check whether remarks are requested
// for the calling pass since that requires actually building the remark.
if (enabled()) {... | subq $0x1d8, %rsp # imm = 0x1D8
leaq 0x1e0(%rsp), %rax
movq %rax, 0x8(%rsp)
movq %rdi, 0x1d0(%rsp)
movq %rsi, 0x1c8(%rsp)
movq 0x1d0(%rsp), %rdi
movq %rdi, 0x10(%rsp)
callq 0x7d9bc0
testb $0x1, %al
jne 0x482cffc
jmp 0x482d024
movq 0x8(%rsp), %rsi
leaq 0x18(%rsp), %rdi
callq 0x482d1e0
movq 0x10(%rsp), %rdi
le... | /llvm/Analysis/OptimizationRemarkEmitter.h |
(anonymous namespace)::AAFoldRuntimeCallCallSiteReturned::updateImpl(llvm::Attributor&) | ChangeStatus updateImpl(Attributor &A) override {
ChangeStatus Changed = ChangeStatus::UNCHANGED;
switch (RFKind) {
case OMPRTL___kmpc_is_spmd_exec_mode:
Changed |= foldIsSPMDExecMode(A);
break;
case OMPRTL___kmpc_parallel_level:
Changed |= foldParallelLevel(A);
break;
case O... | subq $0x68, %rsp
movq %rdi, 0x60(%rsp)
movq %rsi, 0x58(%rsp)
movq 0x60(%rsp), %rax
movq %rax, 0x20(%rsp)
movl $0x1, 0x54(%rsp)
movl 0x70(%rax), %eax
movl %eax, 0x2c(%rsp)
subl $0xe, %eax
je 0x48305e7
jmp 0x4830542
movl 0x2c(%rsp), %eax
subl $0xf, %eax
je 0x483059a
jmp 0x483054d
movl 0x2c(%rsp), %eax
subl $0xb8, %eax
je... | /Transforms/IPO/OpenMPOpt.cpp |
(anonymous namespace)::AAFoldRuntimeCallCallSiteReturned::foldKernelFnAttribute(llvm::Attributor&, llvm::StringRef) | ChangeStatus foldKernelFnAttribute(Attributor &A, llvm::StringRef Attr) {
// Specialize only if all the calls agree with the attribute constant value
int32_t CurrentAttrValue = -1;
std::optional<Value *> SimplifiedValueBefore = SimplifiedValue;
auto *CallerKernelInfoAA = A.getAAFor<AAKernelInfo>(
... | subq $0xb8, %rsp
movq %rdx, 0xa0(%rsp)
movq %rcx, 0xa8(%rsp)
movq %rdi, 0x98(%rsp)
movq %rsi, 0x90(%rsp)
movq 0x98(%rsp), %rdi
movq %rdi, 0x10(%rsp)
movl $0xffffffff, 0x8c(%rsp) # imm = 0xFFFFFFFF
movq 0x60(%rdi), %rax
movq %rax, 0x78(%rsp)
movq 0x68(%rdi), %rax
movq %rax, 0x80(%rsp)
movq 0x90(%rsp), %rax
movq %rax, 0x... | /Transforms/IPO/OpenMPOpt.cpp |
void llvm::OptimizationRemarkEmitter::emit<void (anonymous namespace)::OpenMPOpt::emitRemark<llvm::OptimizationRemarkAnalysis, (anonymous namespace)::OpenMPOpt::rewriteDeviceCodeStateMachine()::$_2&>(llvm::Function*, llvm::StringRef, (anonymous namespace)::OpenMPOpt::rewriteDeviceCodeStateMachine()::$_2&) const::'lambd... | void emit(T RemarkBuilder, decltype(RemarkBuilder()) * = nullptr) {
// Avoid building the remark unless we know there are at least *some*
// remarks enabled. We can't currently check whether remarks are requested
// for the calling pass since that requires actually building the remark.
if (enabled()) {... | subq $0x1d8, %rsp # imm = 0x1D8
leaq 0x1e0(%rsp), %rax
movq %rax, 0x8(%rsp)
movq %rdi, 0x1d0(%rsp)
movq %rsi, 0x1c8(%rsp)
movq 0x1d0(%rsp), %rdi
movq %rdi, 0x10(%rsp)
callq 0x7d9bc0
testb $0x1, %al
jne 0x483808c
jmp 0x48380b4
movq 0x8(%rsp), %rsi
leaq 0x18(%rsp), %rdi
callq 0x4838130
movq 0x10(%rsp), %rdi
le... | /llvm/Analysis/OptimizationRemarkEmitter.h |
bool llvm::DenseMapBase<llvm::DenseMap<llvm::Function*, std::shared_ptr<llvm::SmallVector<llvm::Use*, 16u>>, llvm::DenseMapInfo<llvm::Function*, void>, llvm::detail::DenseMapPair<llvm::Function*, std::shared_ptr<llvm::SmallVector<llvm::Use*, 16u>>>>, llvm::Function*, std::shared_ptr<llvm::SmallVector<llvm::Use*, 16u>>,... | bool LookupBucketFor(const LookupKeyT &Val,
const BucketT *&FoundBucket) const {
const BucketT *BucketsPtr = getBuckets();
const unsigned NumBuckets = getNumBuckets();
if (NumBuckets == 0) {
FoundBucket = nullptr;
return false;
}
// FoundTombstone - Keep track of... | subq $0x78, %rsp
movq %rdi, 0x68(%rsp)
movq %rsi, 0x60(%rsp)
movq %rdx, 0x58(%rsp)
movq 0x68(%rsp), %rdi
movq %rdi, 0x18(%rsp)
callq 0x4817270
movq 0x18(%rsp), %rdi
movq %rax, 0x50(%rsp)
callq 0x4815fd0
movl %eax, 0x4c(%rsp)
cmpl $0x0, 0x4c(%rsp)
jne 0x483bae2
movq 0x58(%rsp), %rax
movq $0x0, (%rax)
movb $0x0, 0x77(%rs... | /llvm/ADT/DenseMap.h |
void llvm::OptimizationRemarkEmitter::emit<void (anonymous namespace)::OpenMPOpt::emitRemark<llvm::OptimizationRemark, (anonymous namespace)::OpenMPOpt::deduplicateRuntimeCalls(llvm::Function&, (anonymous namespace)::OMPInformationCache::RuntimeFunctionInfo&, llvm::Value*)::'lambda'(llvm::Use&, llvm::Function&)::operat... | void emit(T RemarkBuilder, decltype(RemarkBuilder()) * = nullptr) {
// Avoid building the remark unless we know there are at least *some*
// remarks enabled. We can't currently check whether remarks are requested
// for the calling pass since that requires actually building the remark.
if (enabled()) {... | subq $0x1d8, %rsp # imm = 0x1D8
leaq 0x1e0(%rsp), %rax
movq %rax, 0x8(%rsp)
movq %rdi, 0x1d0(%rsp)
movq %rsi, 0x1c8(%rsp)
movq 0x1d0(%rsp), %rdi
movq %rdi, 0x10(%rsp)
callq 0x7d9bc0
testb $0x1, %al
jne 0x483c64c
jmp 0x483c674
movq 0x8(%rsp), %rsi
leaq 0x18(%rsp), %rdi
callq 0x483c8e0
movq 0x10(%rsp), %rdi
le... | /llvm/Analysis/OptimizationRemarkEmitter.h |
Subsets and Splits
SQL Console for LLM4Binary/decompile-bench
Filters out entries with file names ending in .cpp, providing a basic subset of the dataset that excludes C++ files.