Lines Matching refs:TargetNode
163 assert(OtherW.TargetNode.isValid()); in combineWeight()
169 assert(W.TargetNode == OtherW.TargetNode); in combineWeight()
181 return L.TargetNode < R.TargetNode; in combineWeightsBySorting()
191 for (++L; L != E && I->TargetNode == L->TargetNode; ++L) in combineWeightsBySorting()
205 combineWeight(Combined[W.TargetNode.Index], W); in combineWeightsByHashing()
282 assert(W.TargetNode.isValid()); in normalize()
460 Working[W.TargetNode.Index].getMass() += Taken; in distributeMass()
461 LLVM_DEBUG(debugAssign(*this, D, W.TargetNode, Taken, nullptr)); in distributeMass()
470 OuterLoop->BackedgeMass[OuterLoop->getHeaderIndex(W.TargetNode)] += Taken; in distributeMass()
471 LLVM_DEBUG(debugAssign(*this, D, W.TargetNode, Taken, "back")); in distributeMass()
477 OuterLoop->Exits.push_back(std::make_pair(W.TargetNode, Taken)); in distributeMass()
478 LLVM_DEBUG(debugAssign(*this, D, W.TargetNode, Taken, "exit")); in distributeMass()
844 Working[W.TargetNode.Index].getMass() = Taken; in adjustLoopHeaderMass()
845 LLVM_DEBUG(debugAssign(*this, D, W.TargetNode, Taken, nullptr)); in adjustLoopHeaderMass()
855 Working[W.TargetNode.Index].getMass() = Taken; in distributeIrrLoopHeaderMass()
856 LLVM_DEBUG(debugAssign(*this, D, W.TargetNode, Taken, nullptr)); in distributeIrrLoopHeaderMass()