Searched refs:Calls (Results 1 - 25 of 42) sorted by relevance

12

/openbsd-current/gnu/llvm/llvm/lib/Transforms/Utils/
H A DEscapeEnumerator.cpp60 SmallVector<Instruction *, 16> Calls;
65 Calls.push_back(CI);
67 if (Calls.empty())
91 for (unsigned I = Calls.size(); I != 0;) {
92 CallInst *CI = cast<CallInst>(Calls[--I]);
/openbsd-current/gnu/llvm/llvm/lib/Transforms/IPO/
H A DModuleInliner.cpp141 auto Calls = getInlineOrder(FAM, Params); local
142 assert(Calls != nullptr && "Expected an initialized InlineOrder");
156 Calls->push({CB, -1});
170 if (Calls->empty())
184 while (!Calls->empty()) {
185 auto P = Calls->pop();
251 Calls->push({ICB, NewHistoryID});
266 Calls->erase_if([&](const std::pair<CallBase *, int> &Call) {
H A DAlwaysInliner.cpp41 SmallSetVector<CallBase *, 16> Calls; local
53 Calls.clear();
60 Calls.insert(CB);
62 for (CallBase *CB : Calls) {
H A DInliner.cpp788 SmallVector<std::pair<CallBase *, int>, 16> Calls;
803 Calls.push_back({CB, -1});
817 if (Calls.empty())
844 for (int I = 0; I < (int)Calls.size(); ++I) {
849 Function &F = *Calls[I].first->getCaller();
866 for (; I < (int)Calls.size() && Calls[I].first->getCaller() == &F; ++I) {
867 auto &P = Calls[I];
952 Calls.push_back({ICB, NewHistoryID});
984 Calls
[all...]
/openbsd-current/gnu/llvm/llvm/lib/Target/WebAssembly/
H A DWebAssemblyAddMissingPrototypes.cpp90 SmallVector<CallBase *> Calls; local
100 Calls.push_back(CB);
106 for (CallBase *CB : Calls) {
/openbsd-current/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DPlaceSafepoints.cpp269 std::vector<CallInst *> &Calls,
276 Calls.push_back(CI);
296 std::vector<CallInst *> &Calls,
298 Calls.clear();
301 scanOneBB(Start, End, Calls, Seen, Worklist);
305 scanOneBB(&*BB->begin(), End, Calls, Seen, Worklist);
661 std::vector<CallInst *> Calls; // new calls local
673 scanInlinedCode(&*Start, &*After, Calls, BBs);
674 assert(!Calls.empty() && "slow path not found for safepoint poll");
681 for (auto *CI : Calls) {
268 scanOneBB(Instruction *Start, Instruction *End, std::vector<CallInst *> &Calls, DenseSet<BasicBlock *> &Seen, std::vector<BasicBlock *> &Worklist) argument
295 scanInlinedCode(Instruction *Start, Instruction *End, std::vector<CallInst *> &Calls, DenseSet<BasicBlock *> &Seen) argument
[all...]
H A DMemCpyOptimizer.cpp426 // Calls that only access inaccessible memory do not block merging
582 SmallVector<const CallBase *, 8> Calls;
605 NeedLift = llvm::any_of(Calls, [C, this](const CallBase *Call) {
623 Calls.push_back(Call);
/openbsd-current/gnu/llvm/llvm/lib/Transforms/ObjCARC/
H A DPtrState.h74 /// If the Calls are objc_release calls and they all have a
80 SmallPtrSet<Instruction *, 2> Calls; member in struct:llvm::objcarc::RRInfo
157 void InsertCall(Instruction *I) { RRI.Calls.insert(I); }
H A DPtrState.cpp94 Calls.clear();
110 Calls.insert(Other.Calls.begin(), Other.Calls.end());
H A DObjCARCOpts.cpp1804 for (Instruction *OrigRetain : RetainsToMove.Calls) {
1809 for (Instruction *OrigRelease : ReleasesToMove.Calls) {
1847 for (Instruction *NewRetainRelease : NewRetainRRI.Calls) {
1858 if (!NewRetainReleaseRRI.Calls.count(NewRetain))
1861 if (ReleasesToMove.Calls.insert(NewRetainRelease).second) {
1919 for (Instruction *NewReleaseRetain : NewReleaseRRI.Calls) {
1930 if (!NewReleaseRetainRRI.Calls.count(NewRelease))
1933 if (RetainsToMove.Calls.insert(NewReleaseRetain).second) {
/openbsd-current/gnu/llvm/llvm/lib/Analysis/
H A DStackSafetyAnalysis.cpp130 CallsTy Calls;
145 for (auto &Call : U.Calls)
193 // StackSafetyDataFlowAnalysis. Calls and parameters are irrelevant then.
507 US.Calls.emplace(CallInfo<GlobalValue>(Callee, ArgNo), Offsets);
613 for (auto &KV : US.Calls) {
657 for (auto &CS : KV.second.Calls)
775 // Move Use.Calls to a temp storage and repopulate - don't use std::move as it
776 // leaves Use.Calls in an undefined state.
778 std::swap(TmpCalls, Use.Calls);
782 Use.Calls
[all...]
H A DCallGraphSCCPass.cpp206 DenseMap<Value *, CallGraphNode *> Calls; local
270 Calls.count(Call)) {
285 assert(!Calls.count(Call) && "Call site occurs in node multiple times");
291 Calls.insert(std::make_pair(Call, I->second));
319 // matches up to expectations and remove it from Calls.
321 Calls.find(Call);
322 if (ExistingIt != Calls.end()) {
325 // Remove from Calls since we have now seen it.
326 Calls.erase(ExistingIt);
401 assert(Calls
[all...]
H A DAliasAnalysisEvaluator.cpp109 SmallSetVector<CallBase *, 16> Calls; local
122 Calls.insert(CB);
128 << " pointers, " << Calls.size() << " call sites\n";
214 for (CallBase *Call : Calls) {
242 for (CallBase *CallA : Calls) {
243 for (CallBase *CallB : Calls) {
H A DInlineSizeEstimatorAnalysis.cpp56 Calls, member in class:__anon1962::IRToNativeSizeLearning::NamedFeatureIndex
186 ++FF[NamedFeatureIndex::Calls];
/openbsd-current/gnu/llvm/clang/lib/StaticAnalyzer/Checkers/
H A DMallocSizeofChecker.cpp52 CallVec Calls; member in class:__anon989::CastedAllocFinder
62 Calls.push_back(CallRecord(Parent, cast<Expr>(S), AllocCall.first,
185 for (CastedAllocFinder::CallVec::iterator i = Finder.Calls.begin(),
186 e = Finder.Calls.end(); i != e; ++i) {
/openbsd-current/gnu/llvm/clang/lib/Sema/
H A DSemaCoroutine.cpp383 ReadySuspendResumeResult Calls = {{}, Operand, /*IsInvalid=*/false}; local
391 Calls.IsInvalid = true;
394 Calls.Results[CallType] = Result.get();
401 return Calls;
412 Calls.IsInvalid = true;
414 Calls.Results[ACT::ACT_Ready] = S.MaybeCreateExprWithCleanups(Conv.get());
420 Calls.IsInvalid = true;
421 return Calls;
427 return Calls;
443 Calls
[all...]
/openbsd-current/gnu/llvm/llvm/examples/Kaleidoscope/MCJIT/cached/
H A Dsplit-lib.py17 self.shfile.write("echo \"%s: Calls %s\" >> %s\n" % (callname, irname, self.timeFile))
H A Dgenk-timing.py20 self.shfile.write("echo \"%s: Calls %d of %d functions, %d total\" >> %s\n" % (filename, funcsCalled, numFuncs, totalCalls, self.timeFile))
/openbsd-current/gnu/llvm/llvm/examples/Kaleidoscope/MCJIT/complete/
H A Dsplit-lib.py17 self.shfile.write("echo \"%s: Calls %s\" >> %s\n" % (callname, irname, self.timeFile))
H A Dgenk-timing.py20 self.shfile.write("echo \"%s: Calls %d of %d functions, %d total\" >> %s\n" % (filename, funcsCalled, numFuncs, totalCalls, self.timeFile))
/openbsd-current/gnu/llvm/llvm/tools/llvm-lto/
H A Dllvm-lto.cpp381 unsigned Calls = 0, Refs = 0, Functions = 0, Alias = 0, Globals = 0; local
387 Calls += FuncSummary->calls().size();
397 << " globals) and " << (Calls + Refs) << " edges (" << Refs
398 << " refs and " << Calls << " calls)\n"; local
/openbsd-current/gnu/llvm/clang/lib/Analysis/
H A DExprMutationAnalyzer.cpp440 const auto Calls = local
446 return findExprMutation(Calls);
/openbsd-current/gnu/llvm/llvm/examples/Kaleidoscope/MCJIT/lazy/
H A Dgenk-timing.py20 self.shfile.write("echo \"%s: Calls %d of %d functions, %d total\" >> %s\n" % (filename, funcsCalled, numFuncs, totalCalls, self.timeFile))
/openbsd-current/gnu/llvm/llvm/utils/TableGen/
H A DCodeGenDAGPatterns.h754 void setPredicateCalls(const std::vector<TreePredicateCall> &Calls) { argument
756 PredicateCalls = Calls;
/openbsd-current/gnu/llvm/llvm/lib/AsmParser/
H A DLLParser.cpp8768 std::vector<FunctionSummary::EdgeTy> Calls;
8793 if (parseOptionalCalls(Calls))
8826 std::move(Calls), std::move(TypeIdInfo.TypeTests),
9056 bool LLParser::parseOptionalCalls(std::vector<FunctionSummary::EdgeTy> &Calls) {
9095 IdToIndexMap[GVId].push_back(std::make_pair(Calls.size(), Loc));
9096 Calls.push_back(FunctionSummary::EdgeTy{VI, CalleeInfo(Hotness, RelBF)});
9102 // Now that the Calls vector is finalized, it is safe to save the locations
9107 assert(Calls[P.first].first.getRef() == FwdVIRef &&
9109 Infos.emplace_back(&Calls[P.first].first, P.second);
9291 Param.Calls
[all...]

Completed in 400 milliseconds

12