Lines Matching refs:nodes
66 /// value can change when linked nodes change, but convergence is very fast
90 /// from ingoing and outgoing nodes separately add up to a most 1. The weight
97 // Undecided nodes (Value==0) go on the stack.
146 bool update(const Node nodes[]) {
150 Sum += I->first * nodes[I->second].Value;
175 assert(!nodes && "Leaking node array");
176 nodes = new Node[bundles->getNumBundles()];
185 nodes[bundles->getBundle(Num, 1)].Scale[0] += Freq;
186 nodes[bundles->getBundle(Num, 0)].Scale[1] += Freq;
192 if (nodes[i].Scale[d] > 0)
193 nodes[i].Scale[d] = 1 / nodes[i].Scale[d];
200 delete[] nodes;
201 nodes = 0;
209 nodes[n].clear();
220 nodes[n].Bias = -0.0625f;
242 nodes[ib].addBias(Freq * Bias[I->Entry], 1);
249 nodes[ob].addBias(Freq * Bias[I->Exit], 0);
265 nodes[ib].addBias(-Freq, 1);
266 nodes[ob].addBias(-Freq, 0);
282 if (nodes[ib].Links.empty() && !nodes[ib].mustSpill())
284 if (nodes[ob].Links.empty() && !nodes[ob].mustSpill())
287 nodes[ib].addLink(ob, Freq, 1);
288 nodes[ob].addLink(ib, Freq, 0);
296 nodes[n].update(nodes);
299 if (nodes[n].mustSpill())
301 if (!nodes[n].Links.empty())
303 if (nodes[n].preferReg())
309 /// iterate - Repeatedly update the Hopfield nodes until stability or the
311 /// @param Linked - Numbers of linked nodes that need updating.
313 // First update the recently positive nodes. They have likely received new
316 nodes[RecentPositive.pop_back_val()].update(nodes);
323 // linked nodes with sequential numbers. By scanning the linked nodes
333 if (nodes[n].update(nodes)) {
335 if (nodes[n].preferReg())
347 if (nodes[n].update(nodes)) {
349 if (nodes[n].preferReg())
374 if (!nodes[n].preferReg()) {
