205     combineWeight(Combined[W.TargetNode.Index], W);  in combineWeightsByHashing()
324   BlockNode Resolved = Working[Succ.Index].getResolvedNode();  in addToDist()
345   if (Working[Resolved.Index].getContainingLoop() != OuterLoop) {  in addToDist()
427     if (auto *Loop = Working[M.Index].getPackagedLoop())  in packageLoop()
429     LLVM_DEBUG(dbgs() << " - node: " << getBlockName(M.Index) << "\n");  in packageLoop()
450   BlockMass Mass = Working[Source.Index].getMass();  in distributeMass()
460       Working[W.TargetNode.Index].getMass() += Taken;  in distributeMass()
502   for (size_t Index = 0; Index < BFI.Freqs.size(); ++Index) {  in convertFloatingToInteger()  local
503     Scaled64 Scaled = BFI.Freqs[Index].Scaled * ScalingFactor;  in convertFloatingToInteger()
504     BFI.Freqs[Index].Integer = std::max(UINT64_C(1), Scaled.toInt<uint64_t>());  in convertFloatingToInteger()
505     LLVM_DEBUG(dbgs() << " - " << BFI.getBlockName(Index) << ": float = "  in convertFloatingToInteger()
506                       << BFI.Freqs[Index].Scaled << ", scaled = " << Scaled  in convertFloatingToInteger()
507                       << ", int = " << BFI.Freqs[Index].Integer << "\n");  in convertFloatingToInteger()
527     const auto &Working = BFI.Working[N.Index];  in unwrapLoop()
529                                        : BFI.Freqs[N.Index].Scaled;  in unwrapLoop()
539   for (size_t Index = 0; Index < Working.size(); ++Index)  in unwrapLoops()  local
540     Freqs[Index].Scaled = Working[Index].Mass.toScaled();  in unwrapLoops()
551   for (size_t Index = 0; Index < Working.size(); ++Index) {  in finalizeMetrics()  local
553     Min = std::min(Min, Freqs[Index].Scaled);  in finalizeMetrics()
554     Max = std::max(Max, Freqs[Index].Scaled);  in finalizeMetrics()
580   return BlockFrequency(Freqs[Node.Index].Integer);  in getBlockFreq()
610   return IsIrrLoopHeader.test(Node.Index);  in isIrrLoopHeader()
617   return Freqs[Node.Index].Scaled;  in getFloatingBlockFreq()
623   assert(Node.Index < Freqs.size() && "Expected legal index");  in setBlockFreq()
624   Freqs[Node.Index].Integer = Freq.getFrequency();  in setBlockFreq()
647   for (uint32_t Index = 0; Index < BFI.Working.size(); ++Index)  in addNodesInFunction()  local
648     if (!BFI.Working[Index].isPackaged())  in addNodesInFunction()
649       addNode(Index);  in addNodesInFunction()
655     Lookup[I.Node.Index] = &I;  in indexNodes()
662   auto L = Lookup.find(Succ.Index);  in addEdge()
774     if (BFI.Working[N.Index].isLoopHeader())  in createIrreducibleLoop()
775       BFI.Working[N.Index].Loop->Parent = &*Loop;  in createIrreducibleLoop()
777       BFI.Working[N.Index].Loop = &*Loop;  in createIrreducibleLoop()
807     if (!Working[I->Index].isPackaged())  in updateLoopWithIrreducible()
844     Working[W.TargetNode.Index].getMass() = Taken;  in adjustLoopHeaderMass()
855     Working[W.TargetNode.Index].getMass() = Taken;  in distributeIrrLoopHeaderMass()