Lines Matching defs:From

422 void DependencyGraph::addDependency(unsigned From, unsigned To,
424   DGNode &NodeFrom = Nodes[From];
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);
522     unsigned From = RegDep.IID % Source.size();
523     addRegisterDep(From, To, RegDep.RegID, Cycles);
529     unsigned From = MemDep.IID % Source.size();
530     addMemoryDep(From, To, Cycles);