/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | ModuleInliner.cpp | 141 auto Calls = getInlineOrder(FAM, Params, MAM, M); in run() local 142 assert(Calls != nullptr && "Expected an initialized InlineOrder"); in run() 151 Calls->push({CB, -1}); in run() 165 if (Calls->empty()) in run() 179 while (!Calls->empty()) { in run() 180 auto P = Calls->pop(); in run() 246 Calls->push({ICB, NewHistoryID}); in run() 261 Calls->erase_if([&](const std::pair<CallBase *, int> &Call) { in run()
|
H A D | Inliner.cpp | 251 SmallVector<std::pair<CallBase *, int>, 16> Calls; in run() local 266 Calls.push_back({CB, -1}); in run() 286 if (Calls.empty()) in run() 310 for (int I = 0; I < (int)Calls.size(); ++I) { in run() 315 Function &F = *Calls[I].first->getCaller(); in run() 332 for (; I < (int)Calls.size() && Calls[I].first->getCaller() == &F; ++I) { in run() 333 auto &P = Calls[I]; in run() 421 Calls.push_back({ICB, NewHistoryID}); in run() 453 Calls.erase( in run() 454 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 | 1262 auto &Calls = StackIdToMatchingCalls[Node->OrigStackOrAllocId]; in assignStackNodesPostOrder() local 1266 if (Calls.size() == 1) { in assignStackNodesPostOrder() 1267 auto &[Call, Ids, Func, SavedContextIds] = Calls[0]; in assignStackNodesPostOrder() 1288 for (unsigned I = 0; I < Calls.size(); I++) { in assignStackNodesPostOrder() 1289 auto &[Call, Ids, Func, SavedContextIds] = Calls[I]; in assignStackNodesPostOrder() 1426 auto &Calls = It.getSecond(); in updateStackNodes() local 1428 if (Calls.size() == 1) { in updateStackNodes() 1429 auto &Ids = std::get<1>(Calls[0]); in updateStackNodes() 1439 std::stable_sort(Calls.begin(), Calls.end(), in updateStackNodes() 1463 for (unsigned I = 0; I < Calls.size(); I++) { 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() 91 for (unsigned I = Calls.size(); I != 0;) { in Next() 92 CallInst *CI = cast<CallInst>(Calls[--I]); in Next()
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | PlaceSafepoints.cpp | 475 std::vector<CallInst *> &Calls, in scanOneBB() argument 482 Calls.push_back(CI); in scanOneBB() 502 std::vector<CallInst *> &Calls, in scanInlinedCode() argument 504 Calls.clear(); in scanInlinedCode() 507 scanOneBB(Start, End, Calls, Seen, Worklist); in scanInlinedCode() 511 scanOneBB(&*BB->begin(), End, Calls, Seen, Worklist); in scanInlinedCode() 663 std::vector<CallInst *> Calls; // new calls in InsertSafepointPoll() local 675 scanInlinedCode(&*Start, &*After, Calls, BBs); in InsertSafepointPoll() 676 assert(!Calls.empty() && "slow path not found for safepoint poll"); in InsertSafepointPoll() 683 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 <<() 193 // StackSafetyDataFlowAnalysis. Calls and parameters are irrelevant then. in print() 539 US.Calls.emplace(CallInfo<GlobalValue>(Callee, ArgNo), Offsets); in analyzeAllUses() 645 for (auto &KV : US.Calls) { in updateOneUse() 689 for (auto &CS : KV.second.Calls) in runDataFlow() 807 // Move Use.Calls to a temp storage and repopulate - don't use std::move as it in resolveAllCalls() 808 // leaves Use.Calls in an undefined state. in resolveAllCalls() 810 std::swap(TmpCalls, Use.Calls); in resolveAllCalls() 814 Use.Calls in resolveAllCalls() [all...] |
H A D | CallGraphSCCPass.cpp | 207 DenseMap<Value *, CallGraphNode *> Calls; in RefreshCallGraph() local 271 Calls.count(Call)) { in RefreshCallGraph() 286 assert(!Calls.count(Call) && "Call site occurs in node multiple times"); in RefreshCallGraph() 292 Calls.insert(std::make_pair(Call, I->second)); in RefreshCallGraph() 322 Calls.find(Call); in RefreshCallGraph() 323 if (ExistingIt != Calls.end()) { in RefreshCallGraph() 327 Calls.erase(ExistingIt); in RefreshCallGraph() 402 assert(Calls.empty() && "Dangling pointers found in call sites map"); in RefreshCallGraph() 407 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 185 ++FF[NamedFeatureIndex::Calls]; in getFunctionFeatures()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyAddMissingPrototypes.cpp | 90 SmallVector<CallBase *> Calls; in runOnModule() local 100 Calls.push_back(CB); in runOnModule() 106 for (CallBase *CB : Calls) { in runOnModule()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | RuntimeLibcalls.h | 50 void setLibcallName(ArrayRef<RTLIB::Libcall> Calls, const char *Name) { in setLibcallName() 51 for (auto Call : Calls) in setLibcallName()
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
H A D | PtrState.cpp | 94 Calls.clear(); in clear() 110 Calls.insert(Other.Calls.begin(), Other.Calls.end()); in Merge()
|
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 | ObjCARCOpts.cpp | 1812 for (Instruction *OrigRetain : RetainsToMove.Calls) { in MoveCalls() 1817 for (Instruction *OrigRelease : ReleasesToMove.Calls) { in MoveCalls() 1855 for (Instruction *NewRetainRelease : NewRetainRRI.Calls) { in PairUpRetainsAndReleases() 1866 if (!NewRetainReleaseRRI.Calls.count(NewRetain)) in PairUpRetainsAndReleases() 1869 if (ReleasesToMove.Calls.insert(NewRetainRelease).second) { in PairUpRetainsAndReleases() 1927 for (Instruction *NewReleaseRetain : NewReleaseRRI.Calls) { in PairUpRetainsAndReleases() 1938 if (!NewReleaseRetainRRI.Calls.count(NewRelease)) in PairUpRetainsAndReleases() 1941 if (RetainsToMove.Calls.insert(NewReleaseRetain).second) { in PairUpRetainsAndReleases()
|
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
H A D | MallocSizeofChecker.cpp | 53 CallVec Calls; member in __anon7b2079cb0111::CastedAllocFinder 63 Calls.push_back(CallRecord(Parent, cast<Expr>(S), AllocCall.first, in VisitChild() 186 for (const auto &CallRec : Finder.Calls) { in checkASTCodeBody()
|
/freebsd/contrib/llvm-project/clang/lib/Sema/ |
H A D | SemaCoroutine.cpp | 380 ReadySuspendResumeResult Calls = {{}, Operand, /*IsInvalid=*/false}; in buildCoawaitCalls() local 388 Calls.IsInvalid = true; in buildCoawaitCalls() 391 Calls.Results[CallType] = Result.get(); in buildCoawaitCalls() 398 return Calls; in buildCoawaitCalls() 409 Calls.IsInvalid = true; in buildCoawaitCalls() 411 Calls.Results[ACT::ACT_Ready] = S.MaybeCreateExprWithCleanups(Conv.get()); in buildCoawaitCalls() 417 Calls.IsInvalid = true; in buildCoawaitCalls() 418 return Calls; in buildCoawaitCalls() 424 return Calls; in buildCoawaitCalls() 440 Calls.Results[ACT::ACT_Suspend] = TailCallSuspend; in buildCoawaitCalls() [all …]
|
/freebsd/contrib/mandoc/ |
H A D | msec.in | 26 LINE("2", "FreeBSD System Calls Manual")
|
/freebsd/contrib/llvm-project/llvm/lib/Target/BPF/ |
H A D | BPFPreserveStaticOffset.cpp | 595 std::vector<Instruction *> Calls; in collectPreserveStaticOffsetCalls() local 598 Calls.push_back(&Insn); in collectPreserveStaticOffsetCalls() 599 return Calls; in collectPreserveStaticOffsetCalls()
|
/freebsd/contrib/llvm-project/llvm/tools/llvm-lto/ |
H A D | llvm-lto.cpp | 389 unsigned Calls = 0, Refs = 0, Functions = 0, Alias = 0, Globals = 0; in printIndexStats() local 395 Calls += FuncSummary->calls().size(); in printIndexStats() 405 << " globals) and " << (Calls + Refs) << " edges (" << Refs in printIndexStats() 406 << " refs and " << Calls << " calls)\n"; in printIndexStats()
|
/freebsd/crypto/openssl/doc/man3/ |
H A D | BIO_s_bio.pod | 46 Calls to BIO_read_ex() will read data from the buffer or request a retry if no 49 Calls to BIO_write_ex() will place data in the buffer or request a retry if the
|
/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
|
/freebsd/lib/libc/locale/ |
H A D | DESIGN.xlocale | 61 constraints as with the pre-xlocale libc. Calls to any locale-aware functions 108 Explicit Locale Calls
|
/freebsd/contrib/llvm-project/clang/lib/Analysis/ |
H A D | ExprMutationAnalyzer.cpp | 511 const auto Calls = in findCastMutation() local 517 return findExprMutation(Calls); in findCastMutation()
|
/freebsd/contrib/llvm-project/clang/include/clang/AST/ |
H A D | StmtDataCollectors.td | 41 //--- Calls --------------------------------------------------------------//
|