146   bool update(const Node nodes[]) {  in update()
150       Sum += I->first * nodes[I->second].Value;  in update()
175   assert(!nodes && "Leaking node array");  in runOnMachineFunction()
176   nodes = new Node[bundles->getNumBundles()];  in runOnMachineFunction()
185     nodes[bundles->getBundle(Num, 1)].Scale[0] += Freq;  in runOnMachineFunction()
186     nodes[bundles->getBundle(Num, 0)].Scale[1] += Freq;  in runOnMachineFunction()
192       if (nodes[i].Scale[d] > 0)  in runOnMachineFunction()
193         nodes[i].Scale[d] = 1 / nodes[i].Scale[d];  in runOnMachineFunction()
200   delete[] nodes;  in releaseMemory()
201   nodes = 0;  in releaseMemory()
209   nodes[n].clear();  in activate()
231       nodes[ib].addBias(Freq * Bias[I->Entry], 1);  in addConstraints()
238       nodes[ob].addBias(Freq * Bias[I->Exit], 0);  in addConstraints()
254     nodes[ib].addBias(-Freq, 1);  in addPrefSpill()
255     nodes[ob].addBias(-Freq, 0);  in addPrefSpill()
271     if (nodes[ib].Links.empty() && !nodes[ib].mustSpill())  in addLinks()
273     if (nodes[ob].Links.empty() && !nodes[ob].mustSpill())  in addLinks()
276     nodes[ib].addLink(ob, Freq, 1);  in addLinks()
277     nodes[ob].addLink(ib, Freq, 0);  in addLinks()
285     nodes[n].update(nodes);  in scanActiveBundles()
288     if (nodes[n].mustSpill())  in scanActiveBundles()
290     if (!nodes[n].Links.empty())  in scanActiveBundles()
292     if (nodes[n].preferReg())  in scanActiveBundles()
305     nodes[RecentPositive.pop_back_val()].update(nodes);  in iterate()
322       if (nodes[n].update(nodes)) {  in iterate()
324         if (nodes[n].preferReg())  in iterate()
336       if (nodes[n].update(nodes)) {  in iterate()
338         if (nodes[n].preferReg())  in iterate()
363     if (!nodes[n].preferReg()) {  in finish()