| /netbsd-current/external/apache2/llvm/dist/llvm/tools/llvm-xray/ |
| H A D | trie-node.h | 38 llvm::SmallVector<TrieNode<AssociatedData> *, 4> Callees; member in struct:TrieNode
64 for (auto *Callee : Left.Callees) {
69 // directly adding to the Callees vector. The iteration also removes any
72 for (auto *Callee : Right.Callees) {
75 Node->Callees.push_back(
79 Node->Callees.push_back(Callee);
85 Node->Callees.push_back(MapPairIter.second);
|
| H A D | xray-stacks.cpp | 385 auto I = find_if(Top.first->Callees,
387 if (I == Top.first->Callees.end()) {
391 Top.first->Callees.emplace_back(N);
572 for (const auto *C : Top->Callees)
648 for (const auto *C : Top->Callees)
|
| H A D | xray-converter.cpp | 196 for (auto node_iter : ParentSibling->Callees)
213 Parent == nullptr ? StackRootsByThreadId[TId] : Parent->Callees;
|
| /netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/Transforms/IPO/ |
| H A D | ProfiledCallGraph.h | 38 std::set<ProfiledCallGraphNode *, ProfiledCallGraphNodeComparer> Callees; member in struct:llvm::sampleprof::ProfiledCallGraphNode
83 iterator begin() { return Root.Callees.begin(); }
84 iterator end() { return Root.Callees.end(); }
91 Root.Callees.insert(&ProfiledFunctions[Name]);
101 ProfiledFunctions[CallerName].Callees.insert(&CalleeIt->second);
135 static ChildIteratorType child_begin(NodeRef N) { return N->Callees.begin(); }
136 static ChildIteratorType child_end(NodeRef N) { return N->Callees.end(); }
|
| /netbsd-current/sys/external/bsd/compiler_rt/dist/lib/xray/tests/unit/ |
| H A D | function_call_trie_test.cc | 172 ASSERT_FALSE(F1.Callees.empty());
174 const auto &F2 = *F1.Callees[0].NodePtr;
176 ASSERT_FALSE(F2.Callees.empty());
178 const auto &F3 = *F2.Callees[0].NodePtr;
180 ASSERT_TRUE(F3.Callees.empty());
210 if (F->Callees.empty() && i != 31)
213 F = F->Callees[0].NodePtr;
243 ASSERT_EQ(R0Orig.Callees.size(), 2u);
244 ASSERT_EQ(R0Copy.Callees.size(), 2u);
247 *R0Orig.Callees
[all...] |
| /netbsd-current/sys/external/bsd/compiler_rt/dist/lib/xray/ |
| H A D | xray_function_call_trie.h | 114 NodeIdPairArray Callees; member in struct:__xray::FunctionCallTrie::Node
397 auto* Callee = TopNode->Callees.find_element(
412 TopNode->Callees.AppendEmplace(NewNode, FId);
518 for (const auto Callee : NP.Node->Callees) {
525 if (UNLIKELY(NP.NewNode->Callees.AppendEmplace(NewNode, Callee.FId) ==
579 for (const auto Callee : NT.OrigNode->Callees) {
580 auto TargetCallee = NT.TargetNode->Callees.find_element(
593 NT.TargetNode->Callees.AppendEmplace(NewTargetNode, Callee.FId);
|
| H A D | xray_profile_collector.cc | 192 for (const auto C : Node->Callees)
|
| /netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/XRay/ |
| H A D | Profile.h | 119 std::vector<TrieNode *> Callees{};
|
| /netbsd-current/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| H A D | StackSafetyAnalysis.cpp | 571 SmallVector<const CalleeTy *, 16> Callees; local
573 Callees.clear();
577 Callees.push_back(CS.first.Callee);
579 llvm::sort(Callees);
580 Callees.erase(std::unique(Callees.begin(), Callees.end()), Callees.end());
582 for (auto &Callee : Callees)
|
| H A D | LazyCallGraph.cpp | 82 SmallPtrSet<Function *, 4> Callees; local
106 if (Callees.insert(Callee).second) {
|
| /netbsd-current/external/apache2/llvm/dist/llvm/lib/XRay/ |
| H A D | Profile.cpp | 169 auto CalleeIt = find_if(Node->Callees, [NodeFuncID](TrieNode *N) {
172 if (CalleeIt == Node->Callees.end()) {
177 Node->Callees.push_back(NewNode);
|
| /netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| H A D | MDBuilder.h | 93 // Callees metadata.
98 MDNode *createCallees(ArrayRef<Function *> Callees);
|
| /netbsd-current/external/apache2/llvm/dist/llvm/lib/IR/ |
| H A D | MDBuilder.cpp | 100 MDNode *MDBuilder::createCallees(ArrayRef<Function *> Callees) { argument
102 for (Function *F : Callees)
|
| /netbsd-current/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| H A D | CalledValuePropagation.cpp | 392 MDNode *Callees = MDB.createCallees(LV.getFunctions()); local
393 C->setMetadata(LLVMContext::MD_callees, Callees);
|