142   assert(OtherW.TargetNode.isValid());  in combineWeight()
148   assert(W.TargetNode == OtherW.TargetNode);  in combineWeight()
160     return L.TargetNode < R.TargetNode;  in combineWeightsBySorting()
170     for (++L; L != E && I->TargetNode == L->TargetNode; ++L)  in combineWeightsBySorting()
184     combineWeight(Combined[W.TargetNode.Index], W);  in combineWeightsByHashing()
261     assert(W.TargetNode.isValid());  in normalize()
439       Working[W.TargetNode.Index].getMass() += Taken;  in distributeMass()
440       LLVM_DEBUG(debugAssign(*this, D, W.TargetNode, Taken, nullptr));  in distributeMass()
449       OuterLoop->BackedgeMass[OuterLoop->getHeaderIndex(W.TargetNode)] += Taken;  in distributeMass()
450       LLVM_DEBUG(debugAssign(*this, D, W.TargetNode, Taken, "back"));  in distributeMass()
456     OuterLoop->Exits.push_back(std::make_pair(W.TargetNode, Taken));  in distributeMass()
457     LLVM_DEBUG(debugAssign(*this, D, W.TargetNode, Taken, "exit"));  in distributeMass()
835     Working[W.TargetNode.Index].getMass() = Taken;  in adjustLoopHeaderMass()
836     LLVM_DEBUG(debugAssign(*this, D, W.TargetNode, Taken, nullptr));  in adjustLoopHeaderMass()
846     Working[W.TargetNode.Index].getMass() = Taken;  in distributeIrrLoopHeaderMass()
847     LLVM_DEBUG(debugAssign(*this, D, W.TargetNode, Taken, nullptr));  in distributeIrrLoopHeaderMass()