247   std::vector<WorkingData>().swap(Working);  in clear()
272   BlockNode Resolved = Working[Succ.Index].getResolvedNode();  in addToDist()
293   if (Working[Resolved.Index].getContainingLoop() != OuterLoop) {  in addToDist()
371     if (auto *Loop = Working[M.Index].getPackagedLoop())  in packageLoop()
381   BlockMass Mass = Working[Source.Index].getMass();  in distributeMass()
404       Working[W.TargetNode.Index].getMass() += Taken;  in distributeMass()
477     const auto &Working = BFI.Working[N.Index];  in unwrapLoop()  local
478     Scaled64 &F = Working.isAPackage() ? Working.getPackagedLoop()->Scale  in unwrapLoop()
489   for (size_t Index = 0; Index < Working.size(); ++Index)  in unwrapLoops()
490     Freqs[Index].Scaled = Working[Index].Mass.toScaled();  in unwrapLoops()
501   for (size_t Index = 0; Index < Working.size(); ++Index) {  in finalizeMetrics()
563   for (uint32_t Index = 0; Index < BFI.Working.size(); ++Index)  in addNodesInFunction()
564     if (!BFI.Working[Index].isPackaged())  in addNodesInFunction()
687     if (BFI.Working[N.Index].isLoopHeader())  in createIrreducibleLoop()
688       BFI.Working[N.Index].Loop->Parent = &*Loop;  in createIrreducibleLoop()
690       BFI.Working[N.Index].Loop = &*Loop;  in createIrreducibleLoop()
719     if (!Working[I->Index].isPackaged())  in updateLoopWithIrreducible()