| /src/external/apache2/llvm/dist/llvm/lib/MCA/HardwareUnits/ |
| RetireControlUnit.cpp | 39 Queue.resize(2 * NumROBEntries);
49 Queue[NextAvailableSlotIdx] = {IR, Entries, false};
51 NextAvailableSlotIdx %= Queue.size();
59 const RetireControlUnit::RUToken &Current = Queue[CurrentInstructionSlotIdx];
62 assert(Inst && "Invalid RUToken in the RCU queue.");
70 return NextSlotIdx % Queue.size();
74 return Queue[computeNextSlotIdx()];
78 RetireControlUnit::RUToken &Current = Queue[CurrentInstructionSlotIdx];
81 // Update the slot index to be the next item in the circular queue.
83 CurrentInstructionSlotIdx %= Queue.size()
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| LatencyPriorityQueue.cpp | 1 //===---- LatencyPriorityQueue.cpp - A latency-oriented priority queue ----===//
83 Queue.push_back(SU);
109 // Since it is available, it must be in the priority queue. First remove it.
112 // Reinsert the node into the priority queue, which recomputes its
119 std::vector<SUnit *>::iterator Best = Queue.begin();
120 for (std::vector<SUnit *>::iterator I = std::next(Queue.begin()),
121 E = Queue.end(); I != E; ++I)
125 if (Best != std::prev(Queue.end()))
126 std::swap(*Best, Queue.back());
127 Queue.pop_back()
[all...] |
| RegAllocBasic.cpp | 37 #include <queue>
69 CompSpillWeight> Queue;
92 Queue.push(LI);
96 if (Queue.empty())
98 LiveInterval *LI = Queue.top();
99 Queue.pop();
156 // Unassigned virtreg is probably in the priority queue.
168 // Register is assigned, put it back on the queue for reassignment.
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| OptimizedStructLayout.cpp | 236 /// The minimum size of anything currently in this queue.
239 /// The head of the queue. A singly-linked list. The order here should
243 /// We remove the queue from the array as soon as this is empty.
246 /// The alignment requirement of the queue.
275 for (auto &Queue : FlexibleFieldsByAlignment) {
276 assert((FirstQueue || Queue.Alignment < LastQueueAlignment) &&
278 LastQueueAlignment = Queue.Alignment;
281 assert(Queue.Head && "queue was empty");
283 for (auto I = Queue.Head; I; I = Queue.getNext(I))
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/DirectoryWatcher/mac/ |
| DirectoryWatcher-mac.cpp | 49 dispatch_queue_t Queue, FSEventStreamRef EventStream,
53 : Queue(Queue), EventStream(EventStream), Receiver(Receiver),
59 // also uses Queue to not race with the initial scan.
60 dispatch_sync(Queue, ^{
70 dispatch_release(Queue);
74 dispatch_queue_t Queue;
163 dispatch_queue_t Queue) {
220 dispatch_queue_t Queue =
227 auto EventStream = createFSEventStream(Path, Receiver, Queue);
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| WorkList.cpp | 57 std::deque<WorkListUnit> Queue;
61 return !Queue.empty();
65 Queue.push_back(U);
69 WorkListUnit U = Queue.front();
70 Queue.pop_front();
92 std::deque<WorkListUnit> Queue;
97 return !Queue.empty() || !Stack.empty();
102 Queue.push_front(U);
115 assert(!Queue.empty());
118 WorkListUnit U = Queue.front()
223 queue; member in class:__anon3498::UnexploredFirstPriorityQueue
285 queue; member in class:__anon3499::UnexploredFirstPriorityLocationQueue
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/IPO/ |
| ProfiledCallGraph.h | 18 #include <queue>
57 std::queue<ContextTrieNode *> Queue;
61 Queue.push(Callee);
64 while (!Queue.empty()) {
65 ContextTrieNode *Caller = Queue.front();
66 Queue.pop();
77 Queue.push(Callee);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| LatencyPriorityQueue.h | 1 //===---- LatencyPriorityQueue.h - A latency-oriented priority queue ------===//
24 /// Sorting functions for the Available queue.
37 /// Queue, the number of nodes that the node is the sole unscheduled
42 /// Queue - The queue.
43 std::vector<SUnit*> Queue;
78 bool empty() const override { return Queue.empty(); }
|
| MachineScheduler.h | 465 /// queue comparisons.
534 std::vector<SUnit*> Queue;
543 // SU is in this queue if it's NodeQueueID is a superset of this ID.
546 bool empty() const { return Queue.empty(); }
548 void clear() { Queue.clear(); }
550 unsigned size() const { return Queue.size(); }
554 iterator begin() { return Queue.begin(); }
556 iterator end() { return Queue.end(); }
558 ArrayRef<SUnit*> elements() { return Queue; }
560 iterator find(SUnit *SU) { return llvm::find(Queue, SU);
[all...] |
| ResourcePriorityQueue.h | 1 //===----- ResourcePriorityQueue.h - A DFA-oriented priority queue -------===//
29 /// Sorting functions for the Available queue.
42 /// Queue, the number of nodes that the node is the sole unscheduled
47 /// Queue - The queue.
48 std::vector<SUnit*> Queue;
113 bool empty() const override { return Queue.empty(); }
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/MCA/HardwareUnits/ |
| RetireControlUnit.h | 38 // schedulers. These "tokens" are managed by the RCU in its token Queue.
40 // On every cycle ('cycleEvent'), the RCU iterates through the token queue
63 std::vector<RUToken> Queue;
93 // Return the current token from the RCU's circular token queue.
98 // Advance the pointer to the next token in the circular token queue.
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| RDFDeadCode.cpp | 21 #include <queue>
27 // SetVector as a work queue, and popping the first element from it.
29 SetQueue() : Set(), Queue() {}
32 return Queue.empty();
35 T V = Queue.front();
36 Queue.pop();
43 Queue.push(V);
49 std::queue<T> Queue;
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
| ResourcePriorityQueue.cpp | 1 //===- ResourcePriorityQueue.cpp - A DFA-oriented priority queue -*- C++ -*-==//
238 Queue.push_back(SU);
579 // Since it is available, it must be in the priority queue. First remove it.
582 // Reinsert the node into the priority queue, which recomputes its
594 std::vector<SUnit *>::iterator Best = Queue.begin();
597 for (auto I = std::next(Queue.begin()), E = Queue.end(); I != E; ++I) {
607 for (auto I = std::next(Queue.begin()), E = Queue.end(); I != E; ++I)
613 if (Best != std::prev(Queue.end())
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/llvm-objcopy/MachO/ |
| MachOWriter.cpp | 432 SmallVector<WriteOperation, 7> Queue;
439 Queue.push_back({SymTabCommand.symoff, &MachOWriter::writeSymbolTable});
441 Queue.push_back({SymTabCommand.stroff, &MachOWriter::writeStringTable});
449 Queue.push_back(
452 Queue.push_back({DyLdInfoCommand.bind_off, &MachOWriter::writeBindInfo});
454 Queue.push_back(
457 Queue.push_back(
460 Queue.push_back(
470 Queue.emplace_back(DySymTabCommand.indirectsymoff,
480 Queue.emplace_back(LinkEditDataCommand.dataoff
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/DirectoryWatcher/linux/ |
| DirectoryWatcher-linux.cpp | 21 #include <queue>
82 /// Mutex-protected queue of Events.
86 std::queue<DirectoryWatcher::Event> Events;
104 // have to check the queue first (under lock).
138 EventQueue Queue;
144 // Consumes inotify events and pushes directory watcher events to the Queue.
152 // bypassing the Queue. Both InitialScan and EventReceivingLoop use Receiver
156 // Processing events from the Queue.
161 // Push event of WatcherGotInvalidated kind to the Queue to stop the loop.
168 Queue.push_back(DirectoryWatcher::Event::EventKind::WatcherGotInvalidated
[all...] |
| /src/external/bsd/ntp/dist/include/ |
| ntp_prio_q.h | 6 * priority queue implementation used by the discrete event simulator.
19 /* Structures for storing a priority queue
33 typedef struct Queue {
37 } queue; typedef in typeref:struct:Queue
43 /* Define a function to create a FIFO queue */
46 void destroy_queue(queue *my_queue);
49 int empty(queue *my_queue);
50 void *queue_head(queue *my_queue);
51 queue *enqueue(queue *my_queue, void *my_node)
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Serialization/ |
| ModuleManager.cpp | 366 // encounter a module with no incoming edges, push it into the queue
367 // to seed the queue.
368 SmallVector<ModuleFile *, 4> Queue;
369 Queue.reserve(N);
376 Queue.push_back(&M);
381 while (!Queue.empty()) {
382 ModuleFile *CurrentModule = Queue.pop_back_val();
393 // queue to be visited.
396 Queue.push_back(*M);
|
| /src/external/bsd/wpa/dist/wpa_supplicant/ |
| eapol_test.py | 12 import Queue
144 res[i] = Queue.Queue()
|
| /src/external/apache2/llvm/dist/clang/lib/ASTMatchers/ |
| ASTMatchFinder.cpp | 173 bool TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue = nullptr) {
176 Queue = nullptr;
188 return VisitorBase::TraverseStmt(StmtToTraverse, Queue);
485 bool TraverseStmt(Stmt *StmtNode, DataRecursionQueue *Queue = nullptr);
493 bool dataTraverseNode(Stmt *S, DataRecursionQueue *Queue) {
564 TraverseStmt(NE, Queue);
574 return RecursiveASTVisitor<MatchASTVisitor>::dataTraverseNode(S, Queue);
1008 std::deque<DynTypedNode> Queue(Parents.begin(), Parents.end());
1010 while (!Queue.empty()) {
1012 if (Matcher.matches(Queue.front(), this, &BuilderCopy))
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| GCNILPSched.cpp | 30 typedef simple_ilist<Candidate> Queue;
31 Queue PendingQueue;
32 Queue AvailQueue;
256 // so, add them to the available queue.
327 "Ready queue:";
|
| GCNMinRegStrategy.cpp | 33 using Queue = simple_ilist<Candidate>;
34 Queue RQ; // Ready queue
203 << " priority in ready queue: ");
243 "Ready queue:";
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-diff/ |
| DifferenceEngine.cpp | 34 /// A priority queue, implemented as a heap.
133 /// A type which sorts a priority queue by the number of unprocessed
147 /// A queue of unified blocks to process.
148 PriorityQueue<BlockPair, QueueSorter, 20> Queue;
167 Queue.insert(BlockPair(L, R));
184 while (!Queue.empty()) {
185 BlockPair Pair = Queue.remove_min();
487 Engine(Engine), Queue(QueueSorter(*this_())) {}
688 SmallVector<std::pair<Function*,Function*>, 20> Queue;
704 Queue.push_back(std::make_pair(LFn, RFn))
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Format/ |
| UnwrappedLineFormatter.cpp | 13 #include <queue>
976 /// An item in the prioritized BFS search queue. The \c StateNode's
980 /// The BFS queue type.
999 QueueType Queue;
1001 // Insert start element into queue.
1004 Queue.push(QueueItem(OrderedPenalty(0, Count), Node));
1010 while (!Queue.empty()) {
1011 Penalty = Queue.top().first.first;
1012 StateNode *Node = Queue.top().second;
1018 Queue.pop()
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/AST/ |
| CXXInheritance.cpp | 128 SmallVector<const CXXRecordDecl*, 8> Queue;
145 Queue.push_back(Base);
150 if (Queue.empty())
152 Record = Queue.pop_back_val(); // not actually a queue.
|
| /src/external/apache2/llvm/dist/llvm/lib/Object/ |
| WindowsResource.cpp | 20 #include <queue>
874 std::queue<const WindowsResourceParser::TreeNode *> Queue;
875 Queue.push(&Resources);
883 while (!Queue.empty()) {
884 auto CurrentNode = Queue.front();
885 Queue.pop();
915 Queue.push(Child.second.get());
934 Queue.push(Child.second.get());
|
