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

  /external/llvm/lib/CodeGen/
ScheduleDAGInstrs.cpp 279 UseSU->addPred(Dep);
310 DefSU->addPred(SDep(SU, Kind, /*Reg=*/*Alias));
315 DefSU->addPred(Dep);
392 DefSU->addPred(Dep);
430 SU->addPred(dep);
437 DefI->SU->addPred(SDep(SU, SDep::Anti, Reg));
583 SUb->addPred(SDep(SUa, SDep::MayAliasMem));
616 (*I)->addPred(Dep);
642 SUb->addPred(Dep);
782 ExitSU.addPred(Dep)
    [all...]
ScheduleDAG.cpp 62 /// addPred - This adds the specified edge as a pred of the current node if
65 bool SUnit::addPred(const SDep &D, bool Required) {
74 // Extend the latency if needed. Equivalent to removePred(I) + addPred(D).
517 /// AddPred - Updates the topological ordering to accommodate an edge
519 void ScheduleDAGTopologicalSort::AddPred(SUnit *Y, SUnit *X) {
601 /// create a cycle. If so, it is not safe to call AddPred(TargetSU, SU).
MachineScheduler.cpp 337 Topo.AddPred(SuccSU, PredDep.getSUnit());
339 SuccSU->addPred(PredDep, /*Required=*/!PredDep.isArtificial());
    [all...]
  /external/llvm/include/llvm/CodeGen/
ScheduleDAG.h 391 /// addPred - This adds the specified edge as a pred of the current node if
394 bool addPred(const SDep &D, bool Required = true);
711 /// WillCreateCycle - Return true if addPred(TargetSU, SU) creates a cycle.
714 /// AddPred - Updates the topological ordering to accommodate an edge
716 void AddPred(SUnit *Y, SUnit *X);
  /external/llvm/lib/Target/Hexagon/
HexagonMachineScheduler.cpp 34 SUnits[su].addPred(SDep(LastSequentialCall, SDep::Barrier));
  /external/llvm/lib/Transforms/ObjCARC/
ObjCARCOpts.cpp 765 void addPred(BasicBlock *Pred) { Preds.push_back(Pred); }
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGFast.cpp 85 /// AddPred - adds a predecessor edge to SUnit SU.
87 void AddPred(SUnit *SU, const SDep &D) {
88 SU->addPred(D);
306 AddPred(LoadSU, ChainPred);
312 AddPred(LoadSU, Pred);
318 AddPred(NewSU, Pred);
326 AddPred(SuccDep, D);
335 AddPred(SuccDep, D);
341 AddPred(NewSU, D);
360 AddPred(NewSU, *I)
    [all...]
ScheduleDAGSDNodes.cpp 496 if (!SU->addPred(Dep) && !Dep.isCtrl() && OpSU->NumRegDefsLeft > 1) {
    [all...]
ScheduleDAGRRList.cpp 195 /// AddPred - adds a predecessor edge to SUnit SU.
198 void AddPred(SUnit *SU, const SDep &D) {
199 Topo.AddPred(SU, D.getSUnit());
200 SU->addPred(D);
    [all...]

Completed in 201 milliseconds