OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:SUa
(Results
1 - 2
of
2
) sorted by null
/external/llvm/lib/CodeGen/
ScheduleDAGInstrs.cpp
556
/// "latest" node that needs a chain edge to
SUa
.
559
SUnit *
SUa
, SUnit *SUb, SUnit *ExitSU, unsigned *Depth,
561
if (!
SUa
|| !SUb || SUb == ExitSU)
577
if (
SUa
->isSucc(SUb) ||
585
MIsNeedChainEdge(AA, MFI,
SUa
->getInstr(), SUb->getInstr())) {
586
SUb->addPred(SDep(
SUa
, SDep::MayAliasMem));
595
iterateChainSucc (AA, MFI,
SUa
, I->getSUnit(), ExitSU, Depth, Visited);
635
SUnit *
SUa
, SUnit *SUb,
642
MIsNeedChainEdge(AA, MFI,
SUa
->getInstr(), SUb->getInstr())) {
643
SDep Dep(
SUa
, isNormalMemory ? SDep::MayAliasMem : SDep::Barrier)
[
all
...]
MachineScheduler.cpp
806
SUnit *
SUa
= LoadRecords[Idx].SU;
808
if (TII->shouldClusterLoads(
SUa
->getInstr(), SUb->getInstr(), ClusterLength)
809
&& DAG->addEdge(SUb, SDep(
SUa
, SDep::Cluster))) {
811
DEBUG(dbgs() << "Cluster loads SU(" <<
SUa
->NodeNum << ") - SU("
813
// Copy successor edges from
SUa
to SUb. Interleaving computation
814
// dependent on
SUa
can prevent load combining due to register reuse.
815
// Predecessor edges do not need to be copied from SUb to
SUa
since nearby
818
SI =
SUa
->Succs.begin(), SE =
SUa
->Succs.end(); SI != SE; ++SI) {
[
all
...]
Completed in 1005 milliseconds