• Home
  • Raw
  • Download

Lines Matching refs:DAGSize

630   unsigned DAGSize = DAG->SUnits.size();  in colorHighLatenciesAlone()  local
632 for (unsigned i = 0, e = DAGSize; i != e; ++i) { in colorHighLatenciesAlone()
641 unsigned DAGSize = DAG->SUnits.size(); in colorHighLatenciesGroups() local
648 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() local
704 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()
765 if (SuccDep.isWeak() || Succ->NodeNum >= DAGSize) in colorComputeReservedDependencies()
774 if (SUColors.size() == 1 && *SUColors.begin() > DAGSize) in colorComputeReservedDependencies()
792 unsigned DAGSize = DAG->SUnits.size(); in colorAccordingToReservedDependencies() local
798 for (unsigned i = 0, e = DAGSize; i != e; ++i) { in colorAccordingToReservedDependencies()
821 unsigned DAGSize = DAG->SUnits.size(); in colorEndsAccordingToDependencies() local
829 if (CurrentColoring[SU->NodeNum] <= (int)DAGSize) in colorEndsAccordingToDependencies()
838 if (SuccDep.isWeak() || Succ->NodeNum >= DAGSize) in colorEndsAccordingToDependencies()
856 unsigned DAGSize = DAG->SUnits.size(); in colorForceConsecutiveOrderInGroup() local
860 if (DAGSize <= 1) in colorForceConsecutiveOrderInGroup()
865 for (unsigned i = 1, e = DAGSize; i != e; ++i) { in colorForceConsecutiveOrderInGroup()
875 if (CurrentColoring[SU->NodeNum] <= (int)DAGSize) in colorForceConsecutiveOrderInGroup()
889 unsigned DAGSize = DAG->SUnits.size(); in colorMergeConstantLoadsNextGroup() local
895 if (CurrentColoring[SU->NodeNum] <= (int)DAGSize) in colorMergeConstantLoadsNextGroup()
905 if (SuccDep.isWeak() || Succ->NodeNum >= DAGSize) in colorMergeConstantLoadsNextGroup()
915 unsigned DAGSize = DAG->SUnits.size(); in colorMergeIfPossibleNextGroup() local
921 if (CurrentColoring[SU->NodeNum] <= (int)DAGSize) in colorMergeIfPossibleNextGroup()
926 if (SuccDep.isWeak() || Succ->NodeNum >= DAGSize) in colorMergeIfPossibleNextGroup()
936 unsigned DAGSize = DAG->SUnits.size(); in colorMergeIfPossibleNextGroupOnlyForReserved() local
942 if (CurrentColoring[SU->NodeNum] <= (int)DAGSize) in colorMergeIfPossibleNextGroupOnlyForReserved()
947 if (SuccDep.isWeak() || Succ->NodeNum >= DAGSize) in colorMergeIfPossibleNextGroupOnlyForReserved()
951 if (SUColors.size() == 1 && *SUColors.begin() <= DAGSize) in colorMergeIfPossibleNextGroupOnlyForReserved()
957 unsigned DAGSize = DAG->SUnits.size(); in colorMergeIfPossibleSmallGroupsToNextGroup() local
976 if (CurrentColoring[SU->NodeNum] <= (int)DAGSize) in colorMergeIfPossibleSmallGroupsToNextGroup()
984 if (SuccDep.isWeak() || Succ->NodeNum >= DAGSize) in colorMergeIfPossibleSmallGroupsToNextGroup()
1001 unsigned DAGSize = DAG->SUnits.size(); in regroupNoUserInstructions() local
1008 if (CurrentColoring[SU->NodeNum] <= (int)DAGSize) in regroupNoUserInstructions()
1013 if (SuccDep.isWeak() || Succ->NodeNum >= DAGSize) in regroupNoUserInstructions()
1023 unsigned DAGSize = DAG->SUnits.size(); in createBlocksForVariant() local
1028 CurrentColoring.resize(DAGSize, 0); in createBlocksForVariant()
1035 NextNonReservedID = DAGSize + 1; in createBlocksForVariant()
1053 Node2CurrentBlock.resize(DAGSize, -1); in createBlocksForVariant()
1054 for (unsigned i = 0, e = DAGSize; i != e; ++i) { in createBlocksForVariant()
1069 for (unsigned i = 0, e = DAGSize; i != e; ++i) { in createBlocksForVariant()
1074 if (SuccDep.isWeak() || Succ->NodeNum >= DAGSize) in createBlocksForVariant()
1081 if (PredDep.isWeak() || Pred->NodeNum >= DAGSize) in createBlocksForVariant()
1129 unsigned DAGSize = CurrentBlocks.size(); in topologicalSort() local
1134 WorkList.reserve(DAGSize); in topologicalSort()
1135 TopDownIndex2Block.resize(DAGSize); in topologicalSort()
1136 TopDownBlock2Index.resize(DAGSize); in topologicalSort()
1137 BottomUpIndex2Block.resize(DAGSize); in topologicalSort()
1139 for (unsigned i = 0, e = DAGSize; i != e; ++i) { in topologicalSort()
1148 int Id = DAGSize; in topologicalSort()
1163 for (unsigned i = 0, e = DAGSize; i != e; ++i) { in topologicalSort()
1177 unsigned DAGSize = CurrentBlocks.size(); in scheduleInsideBlocks() local
1184 for (unsigned i = 0, e = DAGSize; i != e; ++i) { in scheduleInsideBlocks()
1199 for (unsigned i = 0, e = DAGSize; i != e; ++i) { in scheduleInsideBlocks()
1231 for (unsigned i = 0, e = DAGSize; i != e; ++i) { in scheduleInsideBlocks()
1260 unsigned DAGSize = CurrentBlocks.size(); in fillStats() local
1262 for (unsigned i = 0, e = DAGSize; i != e; ++i) { in fillStats()
1277 for (unsigned i = 0, e = DAGSize; i != e; ++i) { in fillStats()
1686 unsigned DAGSize = SUnits.size(); in moveLowLatencies() local
1700 if (Pred->NodeNum >= DAGSize) in moveLowLatencies()