/freebsd-current/contrib/llvm-project/llvm/lib/MCA/Stages/ |
H A D | ExecuteStage.cpp | 55 SmallVector<InstRef, 4> Pending; local 58 HWS.issueInstruction(IR, Used, Pending, Ready); 72 for (const InstRef &I : Pending) 96 SmallVector<InstRef, 4> Pending; local 99 HWS.cycleEvent(Freed, Executed, Pending, Ready); 113 for (const InstRef &IR : Pending) 234 LLVM_DEBUG(dbgs() << "[E] Instruction Pending: #" << IR << '\n'); 236 HWInstructionEvent(HWInstructionEvent::Pending, IR));
|
/freebsd-current/sys/contrib/dev/acpica/components/events/ |
H A D | evglock.c | 444 BOOLEAN Pending = FALSE; local 464 ACPI_RELEASE_GLOBAL_LOCK (AcpiGbl_FACS, Pending); 470 if (Pending)
|
/freebsd-current/contrib/llvm-project/clang/include/clang/AST/ |
H A D | TextNodeDumper.h | 37 /// Pending[i] is an action to dump an entity at level i. 38 llvm::SmallVector<std::function<void(bool IsLastChild)>, 32> Pending; member in class:clang::TextTreeStructure 63 while (!Pending.empty()) { 64 Pending.back()(true); 65 Pending.pop_back(); 99 unsigned Depth = Pending.size(); 105 while (Depth < Pending.size()) { 106 Pending.back()(true); 107 this->Pending.pop_back(); 115 Pending [all...] |
H A D | JSONNodeDumper.h | 36 llvm::SmallVector<std::function<void(bool IsLastChild)>, 32> Pending; member in class:clang::NodeStreamer 58 while (!Pending.empty()) { 59 Pending.back()(true); 60 Pending.pop_back(); 79 unsigned Depth = Pending.size(); 86 while (Depth < Pending.size()) { 87 Pending.back()(true); 88 this->Pending.pop_back(); 100 Pending.push_back(std::move(DumpWithIndent)); 102 Pending [all...] |
/freebsd-current/contrib/llvm-project/llvm/include/llvm/MCA/HardwareUnits/ |
H A D | Scheduler.h | 152 // Add promoted instructions to the 'Pending' vector in input. 154 bool promoteToPendingSet(SmallVectorImpl<InstRef> &Pending); 206 SmallVectorImpl<InstRef> &Pending, 220 /// Vector Pending is popluated by instructions that have transitioned through 221 /// the pending stat during this cycle. The Pending and Ready sets may not be 224 /// That means, instructions may appear in both the Pending and Ready set. 227 SmallVectorImpl<InstRef> &Pending,
|
/freebsd-current/sys/contrib/dev/acpica/include/platform/ |
H A D | acenv.h | 403 #define ACPI_RELEASE_GLOBAL_LOCK(GLptr, Pending) Pending = 0
|
/freebsd-current/contrib/llvm-project/clang/include/clang/Sema/ |
H A D | AnalysisBasedWarnings.h | 53 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 }; enumerator in enum:clang::sema::AnalysisBasedWarnings::VisitFlag
|
H A D | ExternalSemaSource.h | 182 SourceLocation> > &Pending) {} 180 ReadPendingInstantiations( SmallVectorImpl<std::pair<ValueDecl *, SourceLocation> > &Pending) argument
|
H A D | MultiplexExternalSemaSource.h | 320 SmallVectorImpl<std::pair<ValueDecl*, SourceLocation> >& Pending) override;
|
/freebsd-current/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | R600MachineScheduler.cpp | 70 (AluInstCount + AvailablesAluCount() + Pending[IDAlu].size()) / 169 MoveUnits(Pending[IDFetch], Available[IDFetch]); 199 Pending[IK].push_back(SU); 330 std::vector<SUnit *> &QSrc = Pending[IDAlu]; 400 while (AvailablesAluCount() || !Pending[IDAlu].empty()) { 451 MoveUnits(Pending[QID], AQ);
|
H A D | R600MachineScheduler.h | 53 std::vector<SUnit *> Available[IDLast], Pending[IDLast]; member in class:llvm::final
|
/freebsd-current/contrib/llvm-project/llvm/lib/MCA/HardwareUnits/ |
H A D | Scheduler.cpp | 155 bool Scheduler::promoteToPendingSet(SmallVectorImpl<InstRef> &Pending) { argument 180 Pending.emplace_back(IR); 266 SmallVectorImpl<InstRef> &Pending, 283 promoteToPendingSet(Pending); 264 cycleEvent(SmallVectorImpl<ResourceRef> &Freed, SmallVectorImpl<InstRef> &Executed, SmallVectorImpl<InstRef> &Pending, SmallVectorImpl<InstRef> &Ready) argument
|
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | VLIWMachineScheduler.cpp | 381 Pending.push(SU); 450 for (unsigned i = 0, e = Pending.size(); i != e; ++i) { 451 SUnit *SU = *(Pending.begin() + i); 464 Pending.remove(Pending.begin() + i); 476 assert(Pending.isInQueue(SU) && "bad ready count"); 477 Pending.remove(Pending.find(SU)); 491 if (Available.size() == 1 && Pending.size() > 0) 952 assert(Top.Available.empty() && Top.Pending [all...] |
H A D | MachineScheduler.cpp | 2214 Pending.clear(); 2537 Pending.remove(Pending.begin() + Idx); 2542 Pending.push(SU); 2809 for (unsigned I = 0, E = Pending.size(); I < E; ++I) { 2810 SUnit *SU = *(Pending.begin() + I); 2820 if (E != Pending.size()) { 2833 assert(Pending.isInQueue(SU) && "bad ready count"); 2834 Pending.remove(Pending [all...] |
H A D | AssignmentTrackingAnalysis.cpp | 888 Pending; 913 while (!Worklist.empty() || !Pending.empty()) { 945 Pending.push(BBToOrder[*I]); 952 Worklist.swap(Pending); 955 assert(Pending.empty() && "Pending should be empty"); 2303 Pending; 2358 Pending.push(BBToOrder[*I]); 2365 Worklist.swap(Pending); 2368 assert(Pending [all...] |
/freebsd-current/contrib/llvm-project/llvm/include/llvm/MCA/ |
H A D | HWEventListener.h | 42 Pending, enumerator in enum:llvm::mca::HWInstructionEvent::GenericEventType
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | VLIWMachineScheduler.h | 132 ReadyQueue Pending; member in struct:llvm::ConvergingVLIWScheduler::VLIWSchedBoundary 148 /// Pending queues extend the ready queues with the same ID and the 152 Pending(ID << ConvergingVLIWScheduler::LogMaxQID, Name + ".P") {}
|
H A D | MachineScheduler.h | 846 ReadyQueue Pending; member in class:llvm::SchedBoundary 941 /// Pending queues extend the ready queues with the same ID and the 944 Available(ID, Name+".A"), Pending(ID << LogMaxQID, Name+".P") { 1055 /// Updates the Available/Pending Q's if necessary and returns the single
|
/freebsd-current/contrib/llvm-project/clang/lib/Tooling/Syntax/ |
H A D | BuildTree.cpp | 372 Pending(Arena, TBTM.tokenBuffer()) { 386 Pending.foldChildren(TBTM.tokenBuffer(), Range, New); 399 Pending.foldChildren(TBTM.tokenBuffer(), Range, New); 409 auto ListRange = Pending.shrinkToFitList(SuperRange); 410 Pending.foldChildren(TBTM.tokenBuffer(), ListRange, New); 446 Pending.foldChildren(TBTM.tokenBuffer(), Tokens.drop_back(), 449 auto *TU = cast<syntax::TranslationUnit>(std::move(Pending).finalize()); 692 std::string str() { return Pending.str(TBTM); } 698 Forest Pending; member in class:syntax::TreeBuilder 1691 Pending [all...] |
/freebsd-current/contrib/llvm-project/clang/lib/Sema/ |
H A D | MultiplexExternalSemaSource.cpp | 308 SourceLocation> > &Pending) { 310 Sources[i]->ReadPendingInstantiations(Pending); 306 ReadPendingInstantiations( SmallVectorImpl<std::pair<ValueDecl*, SourceLocation> > &Pending) argument
|
H A D | Sema.cpp | 1077 SmallVector<PendingImplicitInstantiation, 4> Pending; local 1078 ExternalSource->ReadPendingInstantiations(Pending); 1079 for (auto PII : Pending) 1083 Pending.begin(), Pending.end());
|
/freebsd-current/contrib/llvm-project/lldb/source/Plugins/ExpressionParser/Clang/ |
H A D | ASTUtils.h | 531 std::pair<clang::ValueDecl *, clang::SourceLocation>> &Pending) 534 Source->ReadPendingInstantiations(Pending);
|
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/LiveDebugValues/ |
H A D | VarLocBasedImpl.cpp | 2104 VarLocSet &Pending = *Iter.second; 2107 collectAllVarLocs(VarLocs, Pending, VarLocIDs); 2260 Pending; 2322 while (!Worklist.empty() || !Pending.empty()) { 2358 Pending.push(BBToOrder[s]); 2363 Worklist.swap(Pending); 2366 assert(Pending.empty() && "Pending should be empty");
|
H A D | InstrRefBasedImpl.cpp | 2626 Worklist, Pending; 2663 while (!Worklist.empty() || !Pending.empty()) { 2732 Pending.push(BBToOrder[s]); 2737 Worklist.swap(Pending); 2742 assert(Pending.empty() && "Pending should be empty"); 3104 Worklist, Pending; 3220 while (!Worklist.empty() || !Pending.empty()) { 3306 Pending.push(BBToOrder[s]); 3310 Worklist.swap(Pending); [all...] |
/freebsd-current/sys/contrib/edk2/Include/Uefi/ |
H A D | UefiSpec.h | 825 @param[out] Pending Indicates if the alarm signal is pending and requires acknowledgement. 830 @retval EFI_INVALID_PARAMETER Pending is NULL. 840 OUT BOOLEAN *Pending,
|