/openbsd/gnu/llvm/compiler-rt/lib/xray/tests/unit/ |
H A D | function_call_trie_test.cpp | 171 ASSERT_FALSE(F1.Callees.empty()); in TEST() 175 ASSERT_FALSE(F2.Callees.empty()); in TEST() 179 ASSERT_TRUE(F3.Callees.empty()); in TEST() 209 if (F->Callees.empty() && i != 31) in TEST() 212 F = F->Callees[0].NodePtr; in TEST() 242 ASSERT_EQ(R0Orig.Callees.size(), 2u); in TEST() 246 *R0Orig.Callees in TEST() 251 *R0Copy.Callees in TEST() 296 EXPECT_EQ(R0.Callees.size(), 1u); in TEST() 302 EXPECT_EQ(F1.Callees.size(), 1u); in TEST() [all …]
|
/openbsd/gnu/llvm/llvm/tools/llvm-xray/ |
H A D | trie-node.h | 38 llvm::SmallVector<TrieNode<AssociatedData> *, 4> Callees; member 64 for (auto *Callee : Left.Callees) { in mergeTrieNodes() 72 for (auto *Callee : Right.Callees) { in mergeTrieNodes() 75 Node->Callees.push_back( in mergeTrieNodes() 79 Node->Callees.push_back(Callee); in mergeTrieNodes() 85 Node->Callees.push_back(MapPairIter.second); in mergeTrieNodes()
|
H A D | xray-stacks.cpp | 385 auto I = find_if(Top.first->Callees, in accountRecord() 387 if (I == Top.first->Callees.end()) { in accountRecord() 391 Top.first->Callees.emplace_back(N); in accountRecord() 572 for (const auto *C : Top->Callees) in printAll() 648 for (const auto *C : Top->Callees) in print()
|
H A D | xray-converter.cpp | 205 for (auto node_iter : ParentSibling->Callees) in findSiblings() 222 Parent == nullptr ? StackRootsByThreadId[TId] : Parent->Callees; in findOrCreateStackNode()
|
/openbsd/gnu/llvm/compiler-rt/lib/xray/ |
H A D | xray_function_call_trie.h | 113 NodeIdPairArray Callees; member 396 auto* Callee = TopNode->Callees.find_element( in enterFunction() 411 TopNode->Callees.AppendEmplace(NewNode, FId); in enterFunction() 517 for (const auto Callee : NP.Node->Callees) { in deepCopyInto() 524 if (UNLIKELY(NP.NewNode->Callees.AppendEmplace(NewNode, Callee.FId) == in deepCopyInto() 578 for (const auto Callee : NT.OrigNode->Callees) { in mergeInto() 579 auto TargetCallee = NT.TargetNode->Callees.find_element( in mergeInto() 592 NT.TargetNode->Callees.AppendEmplace(NewTargetNode, Callee.FId); in mergeInto()
|
H A D | xray_profile_collector.cpp | 191 for (const auto C : Node->Callees) in populateRecords()
|
/openbsd/gnu/llvm/llvm/lib/Analysis/ |
H A D | StackSafetyAnalysis.cpp | 652 SmallVector<const CalleeTy *, 16> Callees; in runDataFlow() local 654 Callees.clear(); in runDataFlow() 658 Callees.push_back(CS.first.Callee); in runDataFlow() 660 llvm::sort(Callees); in runDataFlow() 661 Callees.erase(std::unique(Callees.begin(), Callees.end()), Callees.end()); in runDataFlow() 663 for (auto &Callee : Callees) in runDataFlow()
|
H A D | LazyCallGraph.cpp | 79 SmallPtrSet<Function *, 4> Callees; in populateSlow() local 103 if (Callees.insert(Callee).second) { in populateSlow()
|
/openbsd/gnu/llvm/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUReplaceLDSUseWithPointer.cpp | 359 SmallPtrSet<Function *, 8> Callees = KernelToCallee.second; in replaceLDSUse() local 362 set_intersect(Callees, LDSAccessors); in replaceLDSUse() 366 if (Callees.empty()) in replaceLDSUse()
|
/openbsd/gnu/llvm/llvm/lib/XRay/ |
H A D | Profile.cpp | 169 auto CalleeIt = find_if(Node->Callees, [NodeFuncID](TrieNode *N) { in internPath() 172 if (CalleeIt == Node->Callees.end()) { in internPath() 177 Node->Callees.push_back(NewNode); in internPath()
|
/openbsd/gnu/llvm/llvm/lib/Transforms/IPO/ |
H A D | CalledValuePropagation.cpp | 395 MDNode *Callees = MDB.createCallees(LV.getFunctions()); in runCVP() local 396 C->setMetadata(LLVMContext::MD_callees, Callees); in runCVP()
|
/openbsd/gnu/llvm/llvm/include/llvm/XRay/ |
H A D | Profile.h | 119 std::vector<TrieNode *> Callees{};
|
/openbsd/gnu/llvm/llvm/include/llvm/IR/ |
H A D | MDBuilder.h | 103 MDNode *createCallees(ArrayRef<Function *> Callees);
|
/openbsd/gnu/llvm/llvm/lib/IR/ |
H A D | MDBuilder.cpp | 100 MDNode *MDBuilder::createCallees(ArrayRef<Function *> Callees) { in createCallees() argument 102 for (Function *F : Callees) in createCallees()
|
/openbsd/gnu/llvm/llvm/lib/Target/X86/ |
H A D | README-X86-64.txt | 60 which would often require a callee-saved register. Callees usually
|