HomeSort by: relevance | last modified time | path
    Searched defs:Callee (Results 1 - 25 of 143) sorted by relevancy

1 2 3 4 5 6

  /src/external/apache2/llvm/dist/clang/lib/Analysis/plugins/SampleAnalyzer/
MainCallChecker.cpp 20 const Expr *Callee = CE->getCallee();
21 const FunctionDecl *FD = C.getSVal(Callee).getAsFunctionDecl();
26 // Get the name of the callee.
41 report->addRange(Callee->getSourceRange());
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
NoReturnFunctionChecker.cpp 47 const Expr *Callee = CE.getOriginExpr();
48 if (!BuildSinks && Callee)
49 BuildSinks = getFunctionExtInfo(Callee->getType()).getNoReturn();
MallocSizeofChecker.cpp 222 const FunctionDecl *Callee = i->AllocCall->getDirectCallee();
223 if (Callee && Callee->getIdentifier())
224 OS << '\'' << Callee->getIdentifier()->getName() << '\'';
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
FunctionPropertiesAnalysis.cpp 40 const auto *Callee = CS->getCalledFunction();
41 if (Callee && !Callee->isIntrinsic() && !Callee->isDeclaration())
SyntheticCountsUtils.cpp 59 auto Callee = CGT::edge_dest(E.second);
60 AdditionalCounts[Callee] += OptProfCount.getValue();
72 auto Callee = CGT::edge_dest(E.second);
73 AddCount(Callee, OptProfCount.getValue());
ReplayInlineAdvisor.cpp 46 auto Callee = Pair.first.split(" inlined into").first.rsplit(": ").second;
50 if (Callee.empty() || CallSite.empty())
53 std::string Combined = (Callee + CallSite).str();
71 StringRef Callee = CB.getCalledFunction()->getName();
72 std::string Combined = (Callee + CallSiteLoc).str();
AliasAnalysisEvaluator.cpp 119 Value *Callee = Call->getCalledOperand();
121 if (!isa<Function>(Callee) && isInterestingPointer(Callee))
122 Pointers.insert(Callee);
CallGraph.cpp 103 const Function *Callee = Call->getCalledFunction();
104 if (!Callee || !Intrinsic::isLeaf(Callee->getIntrinsicID()))
109 else if (!Callee->isIntrinsic())
110 Node->addCalledFunction(Call, getOrInsertFunction(Callee));
232 // the specified callee function. This takes more time to execute than
234 void CallGraphNode::removeAnyCallEdgeTo(CallGraphNode *Callee) {
236 if (CalledFunctions[i].second == Callee) {
237 Callee->DropRef();
245 /// from this node to the specified callee function
    [all...]
MLInlineAdvisor.cpp 58 if (Function *Callee = CS->getCalledFunction()) {
59 if (!Callee->isDeclaration()) {
91 // In bottom up traversal, an inlinable callee is either in the
134 Function *Callee = Advice.getCallee();
149 // the caller, and maybe the callee (by deleting the latter).
151 // For edges, we 'forget' the edges that the caller and callee used to have
161 FAM.getResult<FunctionPropertiesAnalysis>(*Callee)
177 auto &Callee = *CB.getCalledFunction();
182 auto &TIR = FAM.getResult<TargetIRAnalysis>(Callee);
191 &Caller == &Callee)
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/
CheckerContext.cpp 22 const Expr *Callee = CE->getCallee();
23 SVal L = Pred->getSVal(Callee);
  /src/external/apache2/llvm/dist/llvm/lib/IR/
AbstractCallSite.cpp 31 "Number of invalid abstract call sites created (unknown callee)");
37 const Function *Callee = CB.getCalledFunction();
38 if (!Callee)
41 MDNode *CallbackMD = Callee->getMetadata(LLVMContext::MD_callback);
78 // Then handle direct or indirect calls. Thus, if U is the callee of the
87 Function *Callee = CB->getCalledFunction();
88 if (!Callee) {
94 MDNode *CallbackMD = Callee->getMetadata(LLVMContext::MD_callback);
139 if (!Callee->isVarArg())
152 for (unsigned u = Callee->arg_size(); u < NumCallOperands; u++
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
InlineSimple.cpp 55 Function *Callee = CB.getCalledFunction();
56 TargetTransformInfo &TTI = TTIWP->getTTI(*Callee);
AlwaysInliner.cpp 50 // When callee coroutine function is inlined into caller coroutine function
186 Function *Callee = CB.getCalledFunction();
190 if (!Callee)
193 // When callee coroutine function is inlined into caller coroutine function
197 if (Callee->isPresplitCoroutine())
201 if (Callee->isDeclaration())
207 auto IsViable = isInlineViable(*Callee);
PruneEH.cpp 10 // call-graph, turning invoke instructions into calls, iff the callee cannot
121 if (Function *Callee = CI->getCalledFunction()) {
122 // If the callee is outside our current SCC then we may throw
124 if (Functions.contains(Callee))
241 const Function *Callee = Call->getCalledFunction();
242 if (!Callee || !Intrinsic::isLeaf(Callee->getIntrinsicID()))
244 else if (!Callee->isIntrinsic())
  /src/external/apache2/llvm/dist/clang/examples/CallSuperAttribute/
CallSuperAttrInfo.cpp 51 const CXXMethodDecl *Callee = nullptr;
57 Callee = MustCalled;
60 if (Callee)
61 MustCalledMethods.erase(Callee);
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/WebKit/
UncountedCallArgsChecker.cpp 78 // fewer arguments than the callee has parameters.
133 const auto *Callee = CE->getDirectCallee();
134 if (!Callee)
137 auto overloadedOperatorType = Callee->getOverloadedOperator();
147 if (isCtorOfRefCounted(Callee))
150 auto name = safeGetName(Callee);
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/IPO/
ProfiledCallGraph.h 59 ContextTrieNode *Callee = &Child.second;
60 addProfiledFunction(Callee->getFuncName());
61 Queue.push(Callee);
68 // and callee need to have context profile.
75 ContextTrieNode *Callee = &Child.second;
76 addProfiledFunction(Callee->getFuncName());
77 Queue.push(Callee);
78 addProfiledCall(Caller->getFuncName(), Callee->getFuncName());
  /src/external/apache2/llvm/dist/llvm/lib/Target/NVPTX/
NVVMReflect.cpp 120 Function *Callee = Call->getCalledFunction();
121 if (!Callee || (Callee->getName() != NVVM_REFLECT_FUNCTION &&
122 Callee->getIntrinsicID() != Intrinsic::nvvm_reflect))
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/ObjCARC/
ObjCARC.cpp 51 Value *Callee = Func.getCallee();
62 return CallInst::Create(FTy, Callee, Args, OpBundles, NameStr, InsertBefore);
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
AMDGPUPerfHintAnalysis.cpp 221 Function *Callee = CB->getCalledFunction();
222 if (!Callee || Callee->isDeclaration()) {
226 if (&F == Callee) // Handle immediate recursion
229 auto Loc = FIM.find(Callee);
  /src/sys/external/bsd/compiler_rt/dist/lib/xray/
xray_function_call_trie.h 39 /// ID of the callee, and a pointer to the node.
395 // If we've seen this callee before, then we access that node and place that
397 auto* Callee = TopNode->Callees.find_element(
399 if (Callee != nullptr) {
400 CHECK_NE(Callee->NodePtr, nullptr);
401 if (ShadowStack.AppendEmplace(TSC, Callee->NodePtr, CPU) == nullptr)
518 for (const auto Callee : NP.Node->Callees) {
521 Callee.NodePtr->CallCount, Callee.NodePtr->CumulativeLocalTime,
522 Callee.FId)
    [all...]
  /src/external/apache2/llvm/dist/clang/include/clang/Analysis/
CallGraph.h 70 /// purposes of being a callee. This is similar to includeInGraph except
150 CallGraphNode *Callee;
156 : Callee(Callee_), CallExpr(CallExpr_) {}
160 operator CallGraphNode *() const { return Callee; }
205 // NOTE: we are comparing based on the callee only. So different call records
206 // (with different call expressions) to the same callee will compare equal!
209 return LHS.Callee == RHS.Callee;
231 // NOTE: we are comparing based on the callee only.
232 // Different call records with the same callee will compare equal
    [all...]
  /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter2/
toy.cpp 123 std::string Callee;
127 CallExprAST(const std::string &Callee,
129 : Callee(Callee), Args(std::move(Args)) {}
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
InlineAdvisor.h 68 /// Call after inlining succeeded, and did not result in deleting the callee.
71 /// Call after inlining succeeded, and resulted in deleting the callee.
98 /// Caller and Callee are pre-inlining.
100 Function *const Callee;
269 const BasicBlock *Block, const Function &Callee,
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
FastISel.h 85 const Value *Callee = nullptr;
107 Callee = Target;
130 Callee = Call.getCalledOperand();
153 Callee = Target;
555 const Value *Callee, bool ForceRetVoidTy,

Completed in 48 milliseconds

1 2 3 4 5 6