HomeSort by: relevance | last modified time | path
    Searched defs:Callees (Results 1 - 6 of 6) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/tools/llvm-xray/
trie-node.h 37 /// The callees from this function.
38 llvm::SmallVector<TrieNode<AssociatedData> *, 4> Callees;
62 // Build a map of callees from the left side.
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);
83 // Add any callees that weren't found in the right side.
85 Node->Callees.push_back(MapPairIter.second)
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/IPO/
ProfiledCallGraph.h 38 std::set<ProfiledCallGraphNode *, ProfiledCallGraphNodeComparer> Callees;
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(); }
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
LazyCallGraph.cpp 82 SmallPtrSet<Function *, 4> Callees;
106 if (Callees.insert(Callee).second) {
StackSafetyAnalysis.cpp 571 SmallVector<const CalleeTy *, 16> Callees;
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)
  /src/sys/external/bsd/compiler_rt/dist/lib/xray/
xray_function_call_trie.h 37 /// Each node in the trie will also contain a list of callees, represented using
44 /// [function id node] -> [callees] [cumulative time]
89 /// representation of the various data structures (the list of callees must be
107 // A Node in the FunctionCallTrie gives us a list of callees, the cumulative
114 NodeIdPairArray Callees;
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) ==
540 // data from the original (current) trie, along with all its callees
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
CalledValuePropagation.cpp 9 // This file implements a transformation that attaches !callees metadata to
392 MDNode *Callees = MDB.createCallees(LV.getFunctions());
393 C->setMetadata(LLVMContext::MD_callees, Callees);

Completed in 53 milliseconds