| /src/sys/external/bsd/acpica/dist/include/platform/ |
| accygwin.h | 83 #define ACPI_RELEASE_GLOBAL_LOCK(GLptr, Pending) Pending = 1
|
| acenv.h | 295 #define ACPI_RELEASE_GLOBAL_LOCK(GLptr, Pending) Pending = 0
|
| /src/external/apache2/llvm/dist/llvm/lib/MCA/Stages/ |
| ExecuteStage.cpp | 55 SmallVector<InstRef, 4> Pending;
58 HWS.issueInstruction(IR, Used, Pending, Ready);
72 for (const InstRef &I : Pending)
96 SmallVector<InstRef, 4> Pending;
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));
|
| /src/sys/external/bsd/acpica/dist/events/ |
| evglock.c | 167 * release interrupt occurs. If there is actually a pending
183 * If a request for the global lock is not actually pending,
297 * Did not get the lock. The pending bit was set above, and
341 BOOLEAN Pending = FALSE;
361 ACPI_RELEASE_GLOBAL_LOCK (AcpiGbl_FACS, Pending);
364 * If the pending bit was set, we must write GBL_RLS to the control
367 if (Pending)
|
| /src/external/apache2/llvm/dist/clang/include/clang/AST/ |
| JSONNodeDumper.h | 36 llvm::SmallVector<std::function<void(bool IsLastChild)>, 32> Pending;
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.back()(false)
[all...] |
| TextNodeDumper.h | 36 /// Pending[i] is an action to dump an entity at level i.
37 llvm::SmallVector<std::function<void(bool IsLastChild)>, 32> Pending;
62 while (!Pending.empty()) {
63 Pending.back()(true);
64 Pending.pop_back();
98 unsigned Depth = Pending.size();
104 while (Depth < Pending.size()) {
105 Pending.back()(true);
106 this->Pending.pop_back();
114 Pending.push_back(std::move(DumpWithIndent))
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/MCA/HardwareUnits/ |
| Scheduler.h | 123 // Counts the number of instructions in the pending set that were dispatched
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
223 /// the READY state (going through the PENDING state) within a single cycle.
224 /// That means, instructions may appear in both the Pending and Ready set.
227 SmallVectorImpl<InstRef> &Pending,
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/Sema/ |
| AnalysisBasedWarnings.h | 54 enum VisitFlag { NotVisited = 0, Visited = 1, Pending = 2 };
|
| ExternalSemaSource.h | 175 /// Read the set of pending instantiations known to the external
178 /// The external source should append its own pending instantiations to the
184 SourceLocation> > &Pending) {}
|
| MultiplexExternalSemaSource.h | 313 /// Read the set of pending instantiations known to the external
316 /// The external source should append its own pending instantiations to the
321 SmallVectorImpl<std::pair<ValueDecl*, SourceLocation> >& Pending) override;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| R600MachineScheduler.cpp | 70 (AluInstCount + AvailablesAluCount() + Pending[IDAlu].size()) /
171 MoveUnits(Pending[IDFetch], Available[IDFetch]);
201 Pending[IK].push_back(SU);
332 std::vector<SUnit *> &QSrc = Pending[IDAlu];
402 while (AvailablesAluCount() || !Pending[IDAlu].empty()) {
453 MoveUnits(Pending[QID], AQ);
|
| R600MachineScheduler.h | 53 std::vector<SUnit *> Available[IDLast], Pending[IDLast];
|
| GCNSchedStrategy.cpp | 250 assert(Top.Available.empty() && Top.Pending.empty() &&
251 Bot.Available.empty() && Bot.Pending.empty() && "ReadyQ garbage");
|
| /src/external/apache2/llvm/dist/llvm/lib/MCA/HardwareUnits/ |
| Scheduler.cpp | 155 bool Scheduler::promoteToPendingSet(SmallVectorImpl<InstRef> &Pending) {
157 // pending set if operands are all ready.
178 << " promoted to the PENDING set.\n");
180 Pending.emplace_back(IR);
266 SmallVectorImpl<InstRef> &Pending,
283 promoteToPendingSet(Pending);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 356 Pending.push(SU);
417 /// Release pending ready nodes in to the available queue. This makes them
424 // Check to see if any of the pending instructions are ready to issue. If
426 for (unsigned i = 0, e = Pending.size(); i != e; ++i) {
427 SUnit *SU = *(Pending.begin()+i);
440 Pending.remove(Pending.begin()+i);
451 assert(Pending.isInQueue(SU) && "bad ready count");
452 Pending.remove(Pending.find(SU))
[all...] |
| HexagonMachineScheduler.h | 138 ReadyQueue Pending;
154 /// Pending queues extend the ready queues with the same ID and the
158 Pending(ID << ConvergingVLIWScheduler::LogMaxQID, Name+".P") {}
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/MCA/ |
| HWEventListener.h | 42 Pending,
|
| /src/external/apache2/llvm/dist/clang/lib/Tooling/Syntax/ |
| BuildTree.cpp | 355 /// At each point of the traversal we maintain a list of pending nodes.
356 /// Initially all tokens are added as pending nodes. When processing a clang AST
359 /// - assign roles to all pending child nodes with 'markChild' and
361 /// - replace the child nodes with the new syntax node in the pending list
369 TreeBuilder(syntax::Arena &Arena) : Arena(Arena), Pending(Arena) {
383 Pending.foldChildren(Arena, Range, New);
396 Pending.foldChildren(Arena, Range, New);
406 auto ListRange = Pending.shrinkToFitList(SuperRange);
407 Pending.foldChildren(Arena, ListRange, New);
443 Pending.foldChildren(Arena, Tokens.drop_back()
[all...] |
| /src/sys/arch/prep/include/ |
| nvram.h | 73 Pending = 1,
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/LiveDebugValues/ |
| InstrRefBasedImpl.cpp | 2366 Worklist, Pending;
2368 // We track what is on the current and pending worklist to avoid inserting
2388 while (!Worklist.empty() || !Pending.empty()) {
2406 Pending.push(BBToOrder[MBB]);
2451 // All successors should be visited: put any back-edges on the pending
2463 Pending.push(BBToOrder[s]);
2468 Worklist.swap(Pending);
2471 // At this point, pending must be empty, since it was just the empty
2473 assert(Pending.empty() && "Pending should be empty")
[all...] |
| VarLocBasedImpl.cpp | 1953 VarLocSet &Pending = *Iter.second.get();
1956 collectAllVarLocs(VarLocs, Pending, VarLocIDs);
2096 Pending;
2158 while (!Worklist.empty() || !Pending.empty()) {
2159 // We track what is on the pending worklist to avoid inserting the same
2176 // First load any pending inlocs.
2191 Pending.push(BBToOrder[s]);
2196 Worklist.swap(Pending);
2197 // At this point, pending must be empty, since it was just the empty
2199 assert(Pending.empty() && "Pending should be empty")
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| MultiplexExternalSemaSource.cpp | 302 SourceLocation> > &Pending) {
304 Sources[i]->ReadPendingInstantiations(Pending);
|
| Sema.cpp | 958 // Transfer late parsed template instantiations over to the pending template
973 // might lead to more pending template instantiations, which we then need
987 // Load pending instantiations from the external source.
988 SmallVector<PendingImplicitInstantiation, 4> Pending;
989 ExternalSource->ReadPendingInstantiations(Pending);
990 for (auto PII : Pending)
994 Pending.begin(), Pending.end());
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| MachineScheduler.cpp | 1994 Pending.clear();
2284 Pending.remove(Pending.begin() + Idx);
2289 Pending.push(SU);
2387 // Scheduling an instruction may have made pending instructions available.
2521 /// Release pending ready nodes in to the available queue. This makes them
2528 // Check to see if any of the pending instructions are ready to issue. If
2530 for (unsigned I = 0, E = Pending.size(); I < E; ++I) {
2531 SUnit *SU = *(Pending.begin() + I);
2541 if (E != Pending.size())
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 622 ReadyQueue Pending;
627 /// True if the pending Q should be checked/updated before scheduling another
683 // times we should retry the pending queue because of a hazard.
688 /// Pending queues extend the ready queues with the same ID and the
691 Available(ID, Name+".A"), Pending(ID << LogMaxQID, Name+".P") {
774 /// pending queue (if already in) and push into available queue.
775 /// Otherwise, push the SU into pending queue.
779 /// @param InPQueue Whether SU is already in pending queue.
780 /// @param Idx Position offset in pending queue (if in it).
798 /// Updates the Available/Pending Q's if necessary and returns the singl
[all...] |
