Lines Matching defs:Queue
233 Queue(scheduler_->graph_->end());
240 Queue(node->InputAt(i));
254 Queue(exit);
275 Queue(node->InputAt(i));
294 void Queue(Node* node) {
569 ZoneQueue<Node*> queue_; // Queue used for breadth-first traversal.
926 void ComputeLoopInfo(ZoneVector<SpecialRPOStackFrame>& queue,
954 // Push the member onto the queue and process its predecessors.
958 queue[queue_length++].block = member;
964 BasicBlock* block = queue[--queue_length].block;
970 queue[queue_length++].block = pred;
1239 // Visits one node from the queue and propagates its current schedule early
1240 // position to all uses. This in turn might push more nodes onto the queue.
1265 // still post-dominates all inputs to {node} when the queue is processed.
1343 ZoneQueue<Node*>* queue = &(scheduler_->schedule_queue_);
1353 queue->push(node);
1355 Node* const node = queue->front();
1356 queue->pop();
1358 } while (!queue->empty());
1362 queue of schedulable nodes and determines its
1415 // Mark {block} and push its non-marked predecessor on the marking queue.
