Lines Matching refs:nodes
156 bool update(const Node nodes[], const BlockFrequency &Threshold) { in update()
161 if (nodes[I->second].Value == -1) in update()
163 else if (nodes[I->second].Value == 1) in update()
186 const Node nodes[]) const { in getDissentingNeighbors()
191 if (Value != nodes[n].Value) in getDissentingNeighbors()
202 assert(!nodes && "Leaking node array"); in runOnMachineFunction()
203 nodes = new Node[bundles->getNumBundles()]; in runOnMachineFunction()
221 delete[] nodes; in releaseMemory()
222 nodes = nullptr; in releaseMemory()
232 nodes[n].clear(Threshold); in activate()
244 nodes[n].BiasP = 0; in activate()
245 nodes[n].BiasN = (MBFI->getEntryFreq() / 16); in activate()
273 nodes[ib].addBias(Freq, I->Entry); in addConstraints()
280 nodes[ob].addBias(Freq, I->Exit); in addConstraints()
296 nodes[ib].addBias(Freq, PrefSpill); in addPrefSpill()
297 nodes[ob].addBias(Freq, PrefSpill); in addPrefSpill()
314 nodes[ib].addLink(ob, Freq); in addLinks()
315 nodes[ob].addLink(ib, Freq); in addLinks()
325 if (nodes[n].mustSpill()) in scanActiveBundles()
327 if (nodes[n].preferReg()) in scanActiveBundles()
334 if (!nodes[n].update(nodes, Threshold)) in update()
336 nodes[n].getDissentingNeighbors(TodoList, nodes); in update()
356 if (nodes[n].preferReg()) in iterate()
377 if (!nodes[n].preferReg()) { in finish()