Home
last modified time | relevance | path

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

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/MCA/Stages/
H A DExecuteStage.cpp55 SmallVector<InstRef, 4> Pending; in issueInstruction() local
58 HWS.issueInstruction(IR, Used, Pending, Ready); in issueInstruction()
72 for (const InstRef &I : Pending) in issueInstruction()
96 SmallVector<InstRef, 4> Pending; in cycleStart() local
99 HWS.cycleEvent(Freed, Executed, Pending, Ready); in cycleStart()
113 for (const InstRef &IR : Pending) in cycleStart()
234 LLVM_DEBUG(dbgs() << "[E] Instruction Pending: #" << IR << '\n'); in notifyInstructionPending()
236 HWInstructionEvent(HWInstructionEvent::Pending, IR)); in notifyInstructionPending()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp356 Pending.push(SU); in releaseNode()
426 for (unsigned i = 0, e = Pending.size(); i != e; ++i) { in releasePending()
427 SUnit *SU = *(Pending.begin()+i); in releasePending()
440 Pending.remove(Pending.begin()+i); in releasePending()
451 assert(Pending.isInQueue(SU) && "bad ready count"); in removeReady()
452 Pending.remove(Pending.find(SU)); in removeReady()
466 if (Available.size() == 1 && Pending.size() > 0) in pickOnlyChoice()
947 assert(Top.Available.empty() && Top.Pending in pickNode()
[all...]
H A DHexagonMachineScheduler.h138 ReadyQueue Pending; member
154 /// Pending queues extend the ready queues with the same ID and the
158 Pending(ID << ConvergingVLIWScheduler::LogMaxQID, Name+".P") {} in VLIWSchedBoundary()
H A DHexagonBitSimplify.cpp1206 std::vector<unsigned> Pending;
1207 Pending.push_back(Reg);
1209 for (unsigned i = 0; i < Pending.size(); ++i) {
1210 unsigned R = Pending[i];
1224 Pending.push_back(DefR);
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/MCA/HardwareUnits/
H A DScheduler.h152 // 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,
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/
H A DR600MachineScheduler.cpp75 (AluInstCount + AvailablesAluCount() + Pending[IDAlu].size()) / in pickNode()
176 MoveUnits(Pending[IDFetch], Available[IDFetch]); in schedNode()
206 Pending[IK].push_back(SU); in releaseBottomNode()
337 std::vector<SUnit *> &QSrc = Pending[IDAlu]; in LoadAlu()
407 while (AvailablesAluCount() || !Pending[IDAlu].empty()) { in pickAlu()
458 MoveUnits(Pending[QID], AQ); in pickOther()
H A DR600MachineScheduler.h53 std::vector<SUnit *> Available[IDLast], Pending[IDLast]; member in llvm::final
H A DGCNSchedStrategy.cpp272 assert(Top.Available.empty() && Top.Pending.empty() && in pickNode()
273 Bot.Available.empty() && Bot.Pending.empty() && "ReadyQ garbage"); in pickNode()
/third_party/node/deps/v8/src/compiler/backend/
H A Dregister-allocator-verifier.h32 // - blocks with more than one predecessor associate to each operand a "Pending"
53 enum AssessmentKind { Final, Pending }; enumerator
78 : Assessment(Pending), in PendingAssessment()
87 CHECK(assessment->kind() == Pending); in cast()
92 CHECK(assessment->kind() == Pending); in cast()
H A Dregister-allocator-verifier.cc504 case Pending: { in ValidatePendingAssessment()
540 case Pending: { in ValidateUse()
619 case Pending: in VerifyGapMoves()
H A Dinstruction.h81 INSTRUCTION_OPERAND_PREDICATE(Pending, PENDING)
115 // Pending operands are only equal if they are the same operand. in Equals()
127 // Pending operands can't be canonicalized, so just compare for equality. in EqualsCanonicalized()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/MCA/HardwareUnits/
H A DScheduler.cpp155 bool Scheduler::promoteToPendingSet(SmallVectorImpl<InstRef> &Pending) { in promoteToPendingSet() argument
180 Pending.emplace_back(IR); in promoteToPendingSet()
266 SmallVectorImpl<InstRef> &Pending, in cycleEvent()
283 promoteToPendingSet(Pending); in cycleEvent()
264 cycleEvent(SmallVectorImpl<ResourceRef> &Freed, SmallVectorImpl<InstRef> &Executed, SmallVectorImpl<InstRef> &Pending, SmallVectorImpl<InstRef> &Ready) cycleEvent() argument
/third_party/skia/third_party/externals/swiftshader/src/Reactor/
H A DLLVMReactorDebugInfo.hpp115 struct Pending struct in rr::DebugInfo
132 Pending pending;
H A DLLVMReactorDebugInfo.cpp296 scope.pending = Pending{}; in EmitVariable()
388 scope.pending = Pending{}; in emitPending()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DLiveDebugValues.cpp1345 VarLocSet &Pending = PendingInLocs[&MBB]; in join() local
1349 // that we need to perform in the Pending set. in join()
1353 Pending.set(ID); in join()
1365 Pending.reset(ID); in join()
1381 VarLocSet &Pending = Iter.second; in flushPendingLocs() local
1383 for (unsigned ID : Pending) { in flushPendingLocs()
1513 Pending; in ExtendRanges() local
1563 while (!Worklist.empty() || !Pending.empty()) { in ExtendRanges()
1596 Pending.push(BBToOrder[s]); in ExtendRanges()
1601 Worklist.swap(Pending); in ExtendRanges()
[all...]
H A DMachineScheduler.cpp1860 Pending.clear(); in reset()
2111 Pending.remove(Pending.begin() + Idx); in releaseNode()
2116 Pending.push(SU); in releaseNode()
2356 for (unsigned I = 0, E = Pending.size(); I < E; ++I) { in releasePending()
2357 SUnit *SU = *(Pending.begin() + I); in releasePending()
2367 if (E != Pending.size()) { in releasePending()
2380 assert(Pending.isInQueue(SU) && "bad ready count"); in removeReady()
2381 Pending.remove(Pending in removeReady()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/
H A DIceGlobalContext.cpp452 // Ensure Pending is large enough that Pending[Index] is valid.
453 void resizePending(std::vector<std::unique_ptr<EmitterWorkItem>> *Pending, in resizePending() argument
455 if (Index >= Pending->size()) in resizePending()
456 Utils::reserveAndResize(*Pending, Index + 1); in resizePending()
518 // Pending is a vector containing the reassembled, ordered list of in emitItems()
520 // whether it's in the Pending list. If not, we take an item from in emitItems()
522 // insert it into Pending and repeat. The work item is deleted in emitItems()
524 std::vector<std::unique_ptr<EmitterWorkItem>> Pending; in emitItems() local
531 resizePending(&Pending, DesiredSequenceNumbe in emitItems()
[all...]
H A DIceCfg.cpp250 BitVector Pending(NumNodes); in computeInOutEdges()
251 Pending.set(getEntryNode()->getIndex()); in computeInOutEdges()
253 int Index = Pending.find_first(); in computeInOutEdges()
256 Pending.reset(Index); in computeInOutEdges()
263 Pending.set(SuccIndex); in computeInOutEdges()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/MCA/
H A DHWEventListener.h42 Pending, enumerator
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h618 ReadyQueue Pending; member in llvm::SchedBoundary
681 /// Pending queues extend the ready queues with the same ID and the
684 Available(ID, Name+".A"), Pending(ID << LogMaxQID, Name+".P") { in SchedBoundary()
784 /// Updates the Available/Pending Q's if necessary and returns the single
/third_party/glfw/src/
H A Dx11_platform.h255 #define XPending _glfw.x11.xlib.Pending
701 PFN_XPending Pending; member
H A Dx11_init.c1428 _glfw.x11.xlib.Pending = (PFN_XPending) in _glfwInitX11()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGBuilder.h157 /// Update root to include all chains from the Pending list.
158 SDValue updateRoot(SmallVectorImpl<SDValue> &Pending);
H A DSelectionDAGBuilder.cpp1040 // Update DAG root to include dependencies on Pending chains.
1041 SDValue SelectionDAGBuilder::updateRoot(SmallVectorImpl<SDValue> &Pending) { in updateRoot() argument
1044 if (Pending.empty()) in updateRoot()
1050 unsigned i = 0, e = Pending.size(); in updateRoot()
1052 assert(Pending[i].getNode()->getNumOperands() > 1); in updateRoot()
1053 if (Pending[i].getNode()->getOperand(0) == Root) in updateRoot()
1058 Pending.push_back(Root); in updateRoot()
1061 if (Pending.size() == 1) in updateRoot()
1062 Root = Pending[0]; in updateRoot()
1064 Root = DAG.getTokenFactor(getCurSDLoc(), Pending); in updateRoot()
[all...]
/third_party/rust/crates/bindgen/bindgen-tests/tests/
H A Dstylo.hpp[all...]

Completed in 66 milliseconds