Home
last modified time | relevance | path

Searched refs:RootSU (Results 1 – 6 of 6) sorted by relevance

/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/
DScheduleDAGFast.cpp529 SUnit *RootSU = &SUnits[DAG->getRoot().getNode()->getNodeId()]; in ListScheduleBottomUp() local
530 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
531 RootSU->isAvailable = true; in ListScheduleBottomUp()
532 AvailableQueue.push(RootSU); in ListScheduleBottomUp()
DScheduleDAGRRList.cpp1271 SUnit *RootSU = &SUnits[DAG->getRoot().getNode()->getNodeId()]; in ListScheduleBottomUp() local
1272 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
1273 RootSU->isAvailable = true; in ListScheduleBottomUp()
1274 AvailableQueue->push(RootSU); in ListScheduleBottomUp()
/external/llvm/lib/CodeGen/SelectionDAG/
DScheduleDAGFast.cpp540 SUnit *RootSU = &SUnits[DAG->getRoot().getNode()->getNodeId()]; in ListScheduleBottomUp() local
541 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
542 RootSU->isAvailable = true; in ListScheduleBottomUp()
543 AvailableQueue.push(RootSU); in ListScheduleBottomUp()
DScheduleDAGRRList.cpp1493 SUnit *RootSU = &SUnits[DAG->getRoot().getNode()->getNodeId()]; in ListScheduleBottomUp() local
1494 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
1495 RootSU->isAvailable = true; in ListScheduleBottomUp()
1496 AvailableQueue->push(RootSU); in ListScheduleBottomUp()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/SelectionDAG/
DScheduleDAGFast.cpp533 SUnit *RootSU = &SUnits[DAG->getRoot().getNode()->getNodeId()]; in ListScheduleBottomUp() local
534 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
535 RootSU->isAvailable = true; in ListScheduleBottomUp()
536 AvailableQueue.push(RootSU); in ListScheduleBottomUp()
DScheduleDAGRRList.cpp1586 SUnit *RootSU = &SUnits[DAG->getRoot().getNode()->getNodeId()]; in ListScheduleBottomUp() local
1587 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!"); in ListScheduleBottomUp()
1588 RootSU->isAvailable = true; in ListScheduleBottomUp()
1589 AvailableQueue->push(RootSU); in ListScheduleBottomUp()