| /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| AlwaysInliner.cpp | 46 SmallSetVector<CallBase *, 16> Calls;
59 Calls.clear();
64 Calls.insert(CB);
66 for (CallBase *CB : Calls) {
188 // Only inline direct calls to functions with always-inline attributes
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| AliasAnalysisEvaluator.cpp | 103 SmallSetVector<CallBase *, 16> Calls;
120 // Skip actual functions for direct function calls.
127 Calls.insert(Call);
139 << " pointers, " << Calls.size() << " call sites\n";
232 // Mod/ref alias analysis: compare all pairs of calls and values
233 for (CallBase *Call : Calls) {
282 // Mod/ref alias analysis: compare all pairs of calls
283 for (CallBase *CallA : Calls) {
284 for (CallBase *CallB : Calls) {
|
| InlineSizeEstimatorAnalysis.cpp | 57 Calls,
176 // We don't want debug calls, because they'd just add noise.
187 ++FF[NamedFeatureIndex::Calls];
|
| CallGraphSCCPass.cpp | 207 DenseMap<Value *, CallGraphNode *> Calls;
228 // Keep track of the number of direct and indirect calls that were
271 Calls.count(Call) ||
294 assert(!Calls.count(Call) && "Call site occurs in node multiple times");
298 // Ignore intrinsics because they're not really function calls.
300 Calls.insert(std::make_pair(Call, I->second));
306 // Keep track of the number of direct/indirect calls added.
318 // If we are not in checking mode, insert potential callback calls as
328 // matches up to expectations and remove it from Calls.
330 Calls.find(Call)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/ObjCARC/ |
| PtrState.h | 71 /// True of the objc_release calls are all marked with the "tail" keyword.
74 /// If the Calls are objc_release calls and they all have a
80 SmallPtrSet<Instruction *, 2> Calls;
82 /// The set of optimal insert positions for moving calls in the opposite
107 /// pushing calls into a CFG triangle or into one side of a CFG diamond.
157 void InsertCall(Instruction *I) { RRI.Calls.insert(I); }
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| MallocSizeofChecker.cpp | 52 CallVec Calls;
62 Calls.push_back(CallRecord(Parent, cast<Expr>(S), AllocCall.first,
181 for (CastedAllocFinder::CallVec::iterator i = Finder.Calls.begin(),
182 e = Finder.Calls.end(); i != e; ++i) {
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| PlaceSafepoints.cpp | 75 "Number of loops without safepoints due to calls in loop");
109 /// True unless we're running spp-no-calls in which case we need to disable
268 std::vector<CallInst *> &Calls,
275 Calls.push_back(CI);
295 std::vector<CallInst *> &Calls,
297 Calls.clear();
300 scanOneBB(Start, End, Calls, Seen, Worklist);
304 scanOneBB(&*BB->begin(), End, Calls, Seen, Worklist);
372 // Most LLVM intrinsics are things which do not expand to actual calls, or
390 // can place it as late as we want as long as it dominates all calls
[all...] |
| MemCpyOptimizer.cpp | 10 // calls, or transforming sets of stores into memset's.
402 // Calls that only access inaccessible memory do not block merging
544 // Lifted calls.
545 SmallVector<const CallBase *, 8> Calls;
568 NeedLift = llvm::any_of(Calls, [C, this](const CallBase *Call) {
586 Calls.push_back(Call);
655 // memset calls. However, that change would force the backend to
656 // conservatively expand !nontemporal memset calls back to sequences of
1538 /// Transforms memmove calls to memcpy calls when the src/dst are guarantee
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Analysis/ |
| ExprMutationAnalyzer.cpp | 430 const auto Calls =
436 return findExprMutation(Calls);
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-lto/ |
| llvm-lto.cpp | 343 unsigned Calls = 0, Refs = 0, Functions = 0, Alias = 0, Globals = 0;
349 Calls += FuncSummary->calls().size();
359 << " globals) and " << (Calls + Refs) << " edges (" << Refs
360 << " refs and " << Calls << " calls)\n";
|
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| SemaCoroutine.cpp | 411 /// Build calls to await_ready, await_suspend, and await_resume for a co_await
430 ReadySuspendResumeResult Calls = {{}, Operand, /*IsInvalid=*/false};
438 Calls.IsInvalid = true;
441 Calls.Results[CallType] = Result.get();
448 return Calls;
459 Calls.IsInvalid = true;
461 Calls.Results[ACT::ACT_Ready] = S.MaybeCreateExprWithCleanups(Conv.get());
467 Calls.IsInvalid = true;
468 return Calls;
474 return Calls;
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| ModuleSummaryIndex.h | 548 /// List of virtual calls made by this function using (respectively)
553 /// List of virtual calls made by this function using (respectively)
596 /// also includes accesses by nested function calls.
602 std::vector<Call> Calls;
699 ArrayRef<EdgeTy> calls() const { return CallGraphEdgeList; } function in class:llvm::CalleeInfo::FunctionSummary
712 /// Returns the list of virtual calls made by this function using
721 /// Returns the list of virtual calls made by this function using
730 /// Returns the list of virtual calls made by this function using
739 /// Returns the list of virtual calls made by this function using
967 /// Resolutions for calls with all constant integer arguments (excluding th
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Bitcode/Reader/ |
| BitcodeReader.cpp | 3705 // materialization calls will resume it when necessary. If the bitcode
5575 // Upgrade any old intrinsic calls in the function.
5586 // Update calls to the remangled intrinsics
5637 // Remove incompatible attributes on function calls.
5684 // Upgrade any intrinsic calls that slipped through (should not happen!) and
5687 // with calls to the old function.
6102 ParamAccess.Calls.resize(Record.front());
6104 for (auto &Call : ParamAccess.Calls) {
6281 std::vector<FunctionSummary::EdgeTy> Calls = makeCallList(
6287 std::move(Refs), std::move(Calls), std::move(PendingTypeTests)
[all...] |
