| /freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | ModuleInliner.cpp | 151 auto Calls = getInlineOrder(FAM, Params, MAM, M); in run() local
152 assert(Calls != nullptr && "Expected an initialized InlineOrder"); in run()
162 Calls->push({CB, -1}); in run()
184 Calls->push({DirectCB, -1}); in run()
186 if (Calls->empty()) in run()
200 while (!Calls->empty()) { in run()
201 auto P = Calls->pop(); in run()
269 Calls->push({ICB, NewHistoryID}); in run()
284 Calls->erase_if([&](const std::pair<CallBase *, int> &Call) { in run()
|
| H A D | Inliner.cpp | 249 SmallVector<std::pair<CallBase *, int>, 16> Calls; in run() local
264 Calls.push_back({CB, -1}); in run()
284 if (Calls.empty()) in run()
308 for (int I = 0; I < (int)Calls.size(); ++I) { in run()
313 Function &F = *Calls[I].first->getCaller(); in run()
330 for (; I < (int)Calls.size() && Calls[I].first->getCaller() == &F; ++I) { in run()
331 auto &P = Calls[I]; in run()
423 Calls.push_back({ICB, NewHistoryID}); in run()
455 Calls.erase( in run()
456 std::remove_if(Calls.begin() + I + 1, Calls.end(), in run()
[all …]
|
| H A D | AlwaysInliner.cpp | 38 SmallSetVector<CallBase *, 16> Calls; in AlwaysInlineImpl() local
49 Calls.clear(); in AlwaysInlineImpl()
56 Calls.insert(CB); in AlwaysInlineImpl()
58 for (CallBase *CB : Calls) { in AlwaysInlineImpl()
|
| H A D | MemProfContextDisambiguation.cpp | 1618 auto &Calls = StackIdToMatchingCalls[Node->OrigStackOrAllocId]; in assignStackNodesPostOrder() local
1622 if (Calls.size() == 1) { in assignStackNodesPostOrder()
1623 auto &[Call, Ids, Func, SavedContextIds] = Calls[0]; in assignStackNodesPostOrder()
1655 for (unsigned I = 0; I < Calls.size(); in assignStackNodesPostOrder()
1658 auto &[Call, Ids, Func, SavedContextIds] = Calls[I]; in assignStackNodesPostOrder()
1823 auto &Calls = It.getSecond(); in updateStackNodes() local
1825 if (Calls.size() == 1) { in updateStackNodes()
1826 auto &Ids = Calls[0].StackIds; in updateStackNodes()
1841 for (const auto &[Idx, CallCtxInfo] : enumerate(Calls)) in updateStackNodes()
1844 Calls, in updateStackNodes()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | EscapeEnumerator.cpp | 60 SmallVector<Instruction *, 16> Calls; in Next() local
65 Calls.push_back(CI); in Next()
67 if (Calls.empty()) in Next()
90 for (unsigned I = Calls.size(); I != 0;) { in Next()
91 CallInst *CI = cast<CallInst>(Calls[--I]); in Next()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | PlaceSafepoints.cpp | 471 std::vector<CallInst *> &Calls, in scanOneBB() argument
478 Calls.push_back(CI); in scanOneBB()
498 std::vector<CallInst *> &Calls, in scanInlinedCode() argument
500 Calls.clear(); in scanInlinedCode()
503 scanOneBB(Start, End, Calls, Seen, Worklist); in scanInlinedCode()
507 scanOneBB(&*BB->begin(), End, Calls, Seen, Worklist); in scanInlinedCode()
659 std::vector<CallInst *> Calls; // new calls in InsertSafepointPoll() local
671 scanInlinedCode(&*Start, &*After, Calls, BBs); in InsertSafepointPoll()
672 assert(!Calls.empty() && "slow path not found for safepoint poll"); in InsertSafepointPoll()
679 for (auto *CI : Calls) { in InsertSafepointPoll()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | StackSafetyAnalysis.cpp | 130 CallsTy Calls; member
145 for (auto &Call : U.Calls) in operator <<()
539 US.Calls.emplace(CallInfo<GlobalValue>(Callee, ArgNo), Offsets); in analyzeAllUses()
645 for (auto &KV : US.Calls) { in updateOneUse()
688 for (auto &CS : KV.second.Calls) in runDataFlow()
809 std::swap(TmpCalls, Use.Calls); in resolveAllCalls()
813 Use.Calls.emplace(CallInfo<GlobalValue>(F, C.first.ParamNo), C.second); in resolveAllCalls()
850 KV.second.Calls.clear(); in createGlobalStackSafetyInfo()
863 for (auto &C : A.Calls) { in createGlobalStackSafetyInfo()
868 A.Calls = SrcF.Allocas.find(KV.first)->second.Calls; in createGlobalStackSafetyInfo()
[all …]
|
| H A D | CallGraphSCCPass.cpp | 206 DenseMap<Value *, CallGraphNode *> Calls; in RefreshCallGraph() local
270 Calls.count(Call)) { in RefreshCallGraph()
285 assert(!Calls.count(Call) && "Call site occurs in node multiple times"); in RefreshCallGraph()
291 Calls.insert(std::make_pair(Call, I->second)); in RefreshCallGraph()
321 Calls.find(Call); in RefreshCallGraph()
322 if (ExistingIt != Calls.end()) { in RefreshCallGraph()
326 Calls.erase(ExistingIt); in RefreshCallGraph()
401 assert(Calls.empty() && "Dangling pointers found in call sites map"); in RefreshCallGraph()
406 Calls.clear(); in RefreshCallGraph()
|
| H A D | AliasAnalysisEvaluator.cpp | 107 SmallSetVector<CallBase *, 16> Calls; in runInternal() local
120 Calls.insert(CB); in runInternal()
126 << " pointers, " << Calls.size() << " call sites\n"; in runInternal()
212 for (CallBase *Call : Calls) { in runInternal()
240 for (CallBase *CallA : Calls) { in runInternal()
241 for (CallBase *CallB : Calls) { in runInternal()
|
| H A D | InlineSizeEstimatorAnalysis.cpp | 55 Calls, enumerator
186 ++FF[NamedFeatureIndex::Calls]; in getFunctionFeatures()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/DirectX/ |
| H A D | DXILResourceImplicitBinding.cpp | 50 SmallVector<ImplicitBindingCall> Calls; in assignBindings() local
64 Calls.emplace_back(OrderID, CI); in assignBindings()
72 Calls, [](auto &LHS, auto &RHS) { return LHS.OrderID < RHS.OrderID; }); in assignBindings()
82 for (ImplicitBindingCall &IB : Calls) { in assignBindings()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyAddMissingPrototypes.cpp | 89 SmallVector<CallBase *> Calls; in runOnModule() local
99 Calls.push_back(CB); in runOnModule()
105 for (CallBase *CB : Calls) { in runOnModule()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/BPF/ |
| H A D | BPFMIPeephole.cpp | 614 SmallVectorImpl<BPFFastCall> &Calls) { in collectBPFFastCalls() argument
617 Calls.clear(); in collectBPFFastCalls()
630 Calls.push_back({&MI, LiveCallerSavedRegs}); in collectBPFFastCalls()
652 SmallVector<BPFFastCall, 8> Calls; in insertMissingCallerSavedSpills() local
658 collectBPFFastCalls(TRI, LiveRegs, BB, Calls); in insertMissingCallerSavedSpills()
659 Changed |= !Calls.empty(); in insertMissingCallerSavedSpills()
660 for (BPFFastCall &Call : Calls) { in insertMissingCallerSavedSpills()
|
| H A D | BPFPreserveStaticOffset.cpp | 590 std::vector<Instruction *> Calls; in collectPreserveStaticOffsetCalls() local
593 Calls.push_back(&Insn); in collectPreserveStaticOffsetCalls()
594 return Calls; in collectPreserveStaticOffsetCalls()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
| H A D | PtrState.h | 80 SmallPtrSet<Instruction *, 2> Calls; member
157 void InsertCall(Instruction *I) { RRI.Calls.insert(I); } in InsertCall()
|
| H A D | PtrState.cpp | 94 Calls.clear(); in clear()
110 Calls.insert_range(Other.Calls); in Merge()
|
| H A D | ObjCARCOpts.cpp | 1803 for (Instruction *OrigRetain : RetainsToMove.Calls) { in MoveCalls()
1808 for (Instruction *OrigRelease : ReleasesToMove.Calls) { in MoveCalls()
1846 for (Instruction *NewRetainRelease : NewRetainRRI.Calls) { in PairUpRetainsAndReleases()
1857 if (!NewRetainReleaseRRI.Calls.count(NewRetain)) in PairUpRetainsAndReleases()
1860 if (ReleasesToMove.Calls.insert(NewRetainRelease).second) { in PairUpRetainsAndReleases()
1918 for (Instruction *NewReleaseRetain : NewReleaseRRI.Calls) { in PairUpRetainsAndReleases()
1929 if (!NewReleaseRetainRRI.Calls.count(NewRelease)) in PairUpRetainsAndReleases()
1932 if (RetainsToMove.Calls.insert(NewReleaseRetain).second) { in PairUpRetainsAndReleases()
|
| /freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | MallocSizeofChecker.cpp | 51 CallVec Calls; member in __anon7b2079cb0111::CastedAllocFinder
61 Calls.push_back(CallRecord(Parent, cast<Expr>(S), AllocCall.first, in VisitChild()
184 for (const auto &CallRec : Finder.Calls) { in checkASTCodeBody()
|
| /freebsd/contrib/llvm-project/clang/lib/Sema/ |
| H A D | SemaCoroutine.cpp | 368 ReadySuspendResumeResult Calls = {{}, Operand, /*IsInvalid=*/false}; in buildCoawaitCalls() local
376 Calls.IsInvalid = true; in buildCoawaitCalls()
379 Calls.Results[CallType] = Result.get(); in buildCoawaitCalls()
386 return Calls; in buildCoawaitCalls()
397 Calls.IsInvalid = true; in buildCoawaitCalls()
399 Calls.Results[ACT::ACT_Ready] = S.MaybeCreateExprWithCleanups(Conv.get()); in buildCoawaitCalls()
405 Calls.IsInvalid = true; in buildCoawaitCalls()
406 return Calls; in buildCoawaitCalls()
412 return Calls; in buildCoawaitCalls()
428 Calls.Results[ACT::ACT_Suspend] = TailCallSuspend; in buildCoawaitCalls()
[all …]
|
| /freebsd/crypto/openssl/doc/man3/ |
| H A D | SSL_get_stream_read_state.pod | 80 using L<SSL_free(3)>. Calls to L<SSL_write(3)> will fail.
98 Calls to L<SSL_write(3)> will fail.
109 read via L<SSL_read(3)> when this state is returned. Calls to L<SSL_write(3)>
|
| H A D | BIO_s_bio.pod | 52 Calls to BIO_read_ex() will read data from the buffer or request a retry if no
55 Calls to BIO_write_ex() will place data in the buffer or request a retry if the
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
| H A D | MemProfUse.cpp | 192 DenseMap<uint64_t, SmallVector<CallEdgeTy, 0>> Calls; in extractCallsFromIR() local
247 Calls[CallerGUID].emplace_back(Loc, CalleeGUID); in extractCallsFromIR()
256 for (auto &[CallerGUID, CallList] : Calls) { in extractCallsFromIR()
261 return Calls; in extractCallsFromIR()
|
| /freebsd/contrib/mandoc/ |
| H A D | msec.in | 26 LINE("2", "FreeBSD System Calls Manual")
|
| /freebsd/contrib/llvm-project/llvm/tools/llvm-lto/ |
| H A D | llvm-lto.cpp | 380 unsigned Calls = 0, Refs = 0, Functions = 0, Alias = 0, Globals = 0; in printIndexStats() local
386 Calls += FuncSummary->calls().size(); in printIndexStats()
396 << " globals) and " << (Calls + Refs) << " edges (" << Refs in printIndexStats()
397 << " refs and " << Calls << " calls)\n"; in printIndexStats()
|
| /freebsd/lib/libc/rpc/ |
| H A D | README | 91 4. The Remote Asynchronous Calls (RAC) library is now included. RAC was
119 lib/librac The Remote Asynchronous Calls (RAC) library
|