Lines Matching defs:To

240         DGNode &To = Nodes[ToIID];
245         if (Cost > To.Cost) {
246           To.CriticalPredecessor = DepEdge;
247           To.Cost = Cost;
248           To.Depth = N.Depth + 1;
250         To.NumVisitedPredecessors++;
251         if (To.NumVisitedPredecessors == To.NumPredecessors)
270   // To obtain the sequence of critical edges, we simply follow the chain of
422 void DependencyGraph::addDependency(unsigned From, unsigned To,
425   DGNode &NodeTo = Nodes[To];
428   auto It = find_if(Vec, [To, Dep](DependencyEdge &DE) {
429     return DE.ToIID == To && DE.Dep.ResourceOrRegID == Dep.ResourceOrRegID;
438   DependencyEdge DE = {Dep, From, To, 1};
453 void BottleneckAnalysis::addRegisterDep(unsigned From, unsigned To,
455   bool IsLoopCarried = From >= To;
458     DG.addRegisterDep(From, To + SourceSize, RegID, Cost);
459     DG.addRegisterDep(From + SourceSize, To + (SourceSize * 2), RegID, Cost);
462   DG.addRegisterDep(From + SourceSize, To + SourceSize, RegID, Cost);
465 void BottleneckAnalysis::addMemoryDep(unsigned From, unsigned To,
467   bool IsLoopCarried = From >= To;
470     DG.addMemoryDep(From, To + SourceSize, Cost);
471     DG.addMemoryDep(From + SourceSize, To + (SourceSize * 2), Cost);
474   DG.addMemoryDep(From + SourceSize, To + SourceSize, Cost);
477 void BottleneckAnalysis::addResourceDep(unsigned From, unsigned To,
479   bool IsLoopCarried = From >= To;
482     DG.addResourceDep(From, To + SourceSize, Mask, Cost);
483     DG.addResourceDep(From + SourceSize, To + (SourceSize * 2), Mask, Cost);
486   DG.addResourceDep(From + SourceSize, To + SourceSize, Mask, Cost);
505   unsigned To = IID % Source.size();
514       addResourceDep(U.first % Source.size(), To, Current, U.second + Cycles);
523     addRegisterDep(From, To, RegDep.RegID, Cycles);
530     addMemoryDep(From, To, Cycles);