Lines Matching refs:From
421 void DependencyGraph::addDependency(unsigned From, unsigned To, in addDependency() argument
423 DGNode &NodeFrom = Nodes[From]; in addDependency()
437 DependencyEdge DE = {Dep, From, To, 1}; in addDependency()
452 void BottleneckAnalysis::addRegisterDep(unsigned From, unsigned To, in addRegisterDep() argument
454 bool IsLoopCarried = From >= To; in addRegisterDep()
457 DG.addRegisterDep(From, To + SourceSize, RegID, Cost); in addRegisterDep()
458 DG.addRegisterDep(From + SourceSize, To + (SourceSize * 2), RegID, Cost); in addRegisterDep()
461 DG.addRegisterDep(From + SourceSize, To + SourceSize, RegID, Cost); in addRegisterDep()
464 void BottleneckAnalysis::addMemoryDep(unsigned From, unsigned To, in addMemoryDep() argument
466 bool IsLoopCarried = From >= To; in addMemoryDep()
469 DG.addMemoryDep(From, To + SourceSize, Cost); in addMemoryDep()
470 DG.addMemoryDep(From + SourceSize, To + (SourceSize * 2), Cost); in addMemoryDep()
473 DG.addMemoryDep(From + SourceSize, To + SourceSize, Cost); in addMemoryDep()
476 void BottleneckAnalysis::addResourceDep(unsigned From, unsigned To, in addResourceDep() argument
478 bool IsLoopCarried = From >= To; in addResourceDep()
481 DG.addResourceDep(From, To + SourceSize, Mask, Cost); in addResourceDep()
482 DG.addResourceDep(From + SourceSize, To + (SourceSize * 2), Mask, Cost); in addResourceDep()
485 DG.addResourceDep(From + SourceSize, To + SourceSize, Mask, Cost); in addResourceDep()
521 unsigned From = RegDep.IID % Source.size(); in onEvent() local
522 addRegisterDep(From, To, RegDep.RegID, Cycles); in onEvent()
528 unsigned From = MemDep.IID % Source.size(); in onEvent() local
529 addMemoryDep(From, To, Cycles); in onEvent()