Searched refs:SUb (Results 1 - 4 of 4) sorted by relevance

/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DScheduleDAGInstrs.h204 /// Adds a chain edge between SUa and SUb, but only if both
206 void addChainDependency(SUnit *SUa, SUnit *SUb,
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DScheduleDAGInstrs.cpp544 void ScheduleDAGInstrs::addChainDependency (SUnit *SUa, SUnit *SUb, argument
546 if (SUa->getInstr()->mayAlias(AAForDep, *SUb->getInstr(), UseTBAA)) {
549 SUb->addPred(Dep);
H A DMachineScheduler.cpp1575 SUnit *SUb = MemOpRecords[Idx+1].SU; local
1576 if (SUa->NodeNum > SUb->NodeNum)
1577 std::swap(SUa, SUb);
1581 DAG->addEdge(SUb, SDep(SUa, SDep::Cluster))) {
1583 << SUb->NodeNum << ")\n");
1584 // Copy successor edges from SUa to SUb. Interleaving computation
1586 // Predecessor edges do not need to be copied from SUb to SUa since nearby
1589 if (Succ.getSUnit() == SUb)
1593 DAG->addEdge(Succ.getSUnit(), SDep(SUb, SDep::Artificial));
H A DMachinePipeliner.cpp604 /// Return true if SUb can be reached from SUa following the chain edges.
605 static bool isSuccOrder(SUnit *SUa, SUnit *SUb) { argument
616 if (SuccSU == SUb)

Completed in 172 milliseconds