Lines Matching refs:From
430 void DependencyGraph::addDependency(unsigned From, unsigned To,
432 DGNode &NodeFrom = Nodes[From];
446 DependencyEdge DE = {Dep, From, To, 1};
461 void BottleneckAnalysis::addRegisterDep(unsigned From, unsigned To,
463 bool IsLoopCarried = From >= To;
466 DG.addRegisterDep(From, To + SourceSize, RegID, Cost);
467 DG.addRegisterDep(From + SourceSize, To + (SourceSize * 2), RegID, Cost);
470 DG.addRegisterDep(From + SourceSize, To + SourceSize, RegID, Cost);
473 void BottleneckAnalysis::addMemoryDep(unsigned From, unsigned To,
475 bool IsLoopCarried = From >= To;
478 DG.addMemoryDep(From, To + SourceSize, Cost);
479 DG.addMemoryDep(From + SourceSize, To + (SourceSize * 2), Cost);
482 DG.addMemoryDep(From + SourceSize, To + SourceSize, Cost);
485 void BottleneckAnalysis::addResourceDep(unsigned From, unsigned To,
487 bool IsLoopCarried = From >= To;
490 DG.addResourceDep(From, To + SourceSize, Mask, Cost);
491 DG.addResourceDep(From + SourceSize, To + (SourceSize * 2), Mask, Cost);
494 DG.addResourceDep(From + SourceSize, To + SourceSize, Mask, Cost);
529 unsigned From = RegDep.IID % Source.size();
530 addRegisterDep(From, To, RegDep.RegID, Cycles);
536 unsigned From = MemDep.IID % Source.size();
537 addMemoryDep(From, To, Cycles);