Lines Matching refs:IS
5 // This file is distributed under the University of Illinois Open Source
59 /// the operation). Once the operands become available, the instruction is
134 // If all the node's predecessors are scheduled, this node is ready
153 /// count of its successors. If a successor pending count is zero, add it to
178 // It is available if it has no predecessors.
185 // While AvailableQueue is not empty, grab the node with the highest
186 // priority. If it is not ready put it back. Schedule the node.
227 // Remember if this is a noop hazard.
244 // If this is a pseudo-op node, we don't want to increment the current
257 // that will fault if we don't do this right. This is the case for
278 llvm::createVLIWDAGScheduler(SelectionDAGISel *IS, CodeGenOpt::Level) {
279 return new ScheduleDAGVLIW(*IS->MF, IS->AA, new ResourcePriorityQueue(IS));
