422 void DependencyGraph::addDependency(unsigned From, unsigned To,  in addDependency()  argument
424   DGNode &NodeFrom = Nodes[From];  in addDependency()
438   DependencyEdge DE = {Dep, From, To, 1};  in addDependency()
453 void BottleneckAnalysis::addRegisterDep(unsigned From, unsigned To,  in addRegisterDep()  argument
455   bool IsLoopCarried = From >= To;  in addRegisterDep()
458     DG.addRegisterDep(From, To + SourceSize, RegID, Cost);  in addRegisterDep()
459     DG.addRegisterDep(From + SourceSize, To + (SourceSize * 2), RegID, Cost);  in addRegisterDep()
462   DG.addRegisterDep(From + SourceSize, To + SourceSize, RegID, Cost);  in addRegisterDep()
465 void BottleneckAnalysis::addMemoryDep(unsigned From, unsigned To,  in addMemoryDep()  argument
467   bool IsLoopCarried = From >= To;  in addMemoryDep()
470     DG.addMemoryDep(From, To + SourceSize, Cost);  in addMemoryDep()
471     DG.addMemoryDep(From + SourceSize, To + (SourceSize * 2), Cost);  in addMemoryDep()
474   DG.addMemoryDep(From + SourceSize, To + SourceSize, Cost);  in addMemoryDep()
477 void BottleneckAnalysis::addResourceDep(unsigned From, unsigned To,  in addResourceDep()  argument
479   bool IsLoopCarried = From >= To;  in addResourceDep()
482     DG.addResourceDep(From, To + SourceSize, Mask, Cost);  in addResourceDep()
483     DG.addResourceDep(From + SourceSize, To + (SourceSize * 2), Mask, Cost);  in addResourceDep()
486   DG.addResourceDep(From + SourceSize, To + SourceSize, Mask, Cost);  in addResourceDep()
522     unsigned From = RegDep.IID % Source.size();  in onEvent()  local
523     addRegisterDep(From, To, RegDep.RegID, Cycles);  in onEvent()
529     unsigned From = MemDep.IID % Source.size();  in onEvent()  local
530     addMemoryDep(From, To, Cycles);  in onEvent()