HomeSort by relevance Sort by last modified time
    Searched refs:SUb (Results 1 - 2 of 2) sorted by null

  /external/llvm/lib/CodeGen/
ScheduleDAGInstrs.cpp 552 /// This recursive function iterates over chain deps of SUb looking for
556 SUnit *SUa, SUnit *SUb, SUnit *ExitSU, unsigned *Depth,
558 if (!SUa || !SUb || SUb == ExitSU)
562 if (!Visited.insert(SUb))
574 if (SUa->isSucc(SUb) ||
575 isGlobalMemoryObject(AA, SUb->getInstr()))
579 // add that edge to the predecessors chain of SUb,
582 MIsNeedChainEdge(AA, MFI, SUa->getInstr(), SUb->getInstr())) {
583 SUb->addPred(SDep(SUa, SDep::MayAliasMem))
    [all...]
MachineScheduler.cpp 831 SUnit *SUb = LoadRecords[Idx+1].SU;
832 if (TII->shouldClusterLoads(SUa->getInstr(), SUb->getInstr(), ClusterLength)
833 && DAG->addEdge(SUb, SDep(SUa, SDep::Cluster))) {
836 << SUb->NodeNum << ")\n");
837 // Copy successor edges from SUa to SUb. Interleaving computation
839 // Predecessor edges do not need to be copied from SUb to SUa since nearby
843 if (SI->getSUnit() == SUb)
846 DAG->addEdge(SI->getSUnit(), SDep(SUb, SDep::Artificial));
    [all...]

Completed in 190 milliseconds