Searched refs:DAGSize (Results 1 – 10 of 10) sorted by relevance
630 unsigned DAGSize = DAG->SUnits.size(); in colorHighLatenciesAlone() local632 for (unsigned i = 0, e = DAGSize; i != e; ++i) { in colorHighLatenciesAlone()641 unsigned DAGSize = DAG->SUnits.size(); in colorHighLatenciesGroups() local648 for (unsigned i = 0, e = DAGSize; i != e; ++i) { in colorHighLatenciesGroups()664 for (unsigned i = 0, e = DAGSize; i != e; ++i) { in colorHighLatenciesGroups()698 unsigned DAGSize = DAG->SUnits.size(); in colorComputeReservedDependencies() local704 CurrentTopDownReservedDependencyColoring.resize(DAGSize, 0); in colorComputeReservedDependencies()705 CurrentBottomUpReservedDependencyColoring.resize(DAGSize, 0); in colorComputeReservedDependencies()723 if (PredDep.isWeak() || Pred->NodeNum >= DAGSize) in colorComputeReservedDependencies()732 if (SUColors.size() == 1 && *SUColors.begin() > DAGSize) in colorComputeReservedDependencies()[all …]
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()
435 unsigned DAGSize = SUnits.size(); in InitDAGTopologicalSorting() local437 WorkList.reserve(DAGSize); in InitDAGTopologicalSorting()439 Index2Node.resize(DAGSize); in InitDAGTopologicalSorting()440 Node2Index.resize(DAGSize); in InitDAGTopologicalSorting()443 for (unsigned i = 0, e = DAGSize; i != e; ++i) { in InitDAGTopologicalSorting()458 int Id = DAGSize; in InitDAGTopologicalSorting()473 Visited.resize(DAGSize); in InitDAGTopologicalSorting()477 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()
6559 unsigned DAGSize = 0; in AssignTopologicalOrder() local6579 N->setNodeId(DAGSize++); in AssignTopologicalOrder()6606 P->setNodeId(DAGSize++); in AssignTopologicalOrder()6637 assert(AllNodes.back().getNodeId() == (int)DAGSize-1 && in AssignTopologicalOrder()6641 assert(DAGSize == allnodes_size() && "Node count mismatch!"); in AssignTopologicalOrder()6642 return DAGSize; in AssignTopologicalOrder()
362 DAGSize(0) { in SelectionDAGISel()927 DAGSize = CurDAG->AssignTopologicalOrder(); in DoInstructionSelection()
185 unsigned DAGSize;
171 unsigned DAGSize;
5515 unsigned DAGSize = 0; in AssignTopologicalOrder() local5535 N->setNodeId(DAGSize++); in AssignTopologicalOrder()5562 P->setNodeId(DAGSize++); in AssignTopologicalOrder()5590 assert(AllNodes.back().getNodeId() == (int)DAGSize-1 && in AssignTopologicalOrder()5594 assert(DAGSize == allnodes_size() && "Node count mismatch!"); in AssignTopologicalOrder()5595 return DAGSize; in AssignTopologicalOrder()
199 DAGSize(0) { in SelectionDAGISel()636 DAGSize = CurDAG->AssignTopologicalOrder(); in DoInstructionSelection()