Searched refs:DAGSize (Results 1 – 5 of 5) sorted by relevance
460 unsigned DAGSize = SUnits.size(); in InitDAGTopologicalSorting() local462 WorkList.reserve(DAGSize); in InitDAGTopologicalSorting()464 Index2Node.resize(DAGSize); in InitDAGTopologicalSorting()465 Node2Index.resize(DAGSize); in InitDAGTopologicalSorting()470 for (unsigned i = 0, e = DAGSize; i != e; ++i) { in InitDAGTopologicalSorting()485 int Id = DAGSize; in InitDAGTopologicalSorting()489 if (SU->NodeNum < DAGSize) in InitDAGTopologicalSorting()494 if (SU->NodeNum < DAGSize && !--Node2Index[SU->NodeNum]) in InitDAGTopologicalSorting()501 Visited.resize(DAGSize); in InitDAGTopologicalSorting()505 for (unsigned i = 0, e = DAGSize; i != e; ++i) { in InitDAGTopologicalSorting()
727 unsigned DAGSize = 0; in Schedule() local746 ++DAGSize; in Schedule()766 Sequence.reserve(DAGSize); in Schedule()
6572 unsigned DAGSize = 0; in AssignTopologicalOrder() local6592 N->setNodeId(DAGSize++); in AssignTopologicalOrder()6619 P->setNodeId(DAGSize++); in AssignTopologicalOrder()6650 assert(AllNodes.back().getNodeId() == (int)DAGSize-1 && in AssignTopologicalOrder()6654 assert(DAGSize == allnodes_size() && "Node count mismatch!"); in AssignTopologicalOrder()6655 return DAGSize; in AssignTopologicalOrder()
361 DAGSize(0) { in SelectionDAGISel()912 DAGSize = CurDAG->AssignTopologicalOrder(); in DoInstructionSelection()
179 unsigned DAGSize;