Lines Matching full:nodes

70 /// value can change when linked nodes change, but convergence is very fast
95     // Undecided nodes (Value==0) go on the stack.
151   bool update(const Node nodes[], BlockFrequency Threshold) {
156       if (nodes[L.second].Value == -1)
158       else if (nodes[L.second].Value == 1)
181                               const Node nodes[]) const {
186       if (Value != nodes[n].Value)
196   assert(!nodes && "Leaking node array");
197   nodes = new Node[bundles->getNumBundles()];
215   delete[] nodes;
216   nodes = nullptr;
226   nodes[n].clear(Threshold);
238     nodes[n].BiasP = BlockFrequency(0);
241     nodes[n].BiasN = BiasN;
268       nodes[ib].addBias(Freq, LB.Entry);
275       nodes[ob].addBias(Freq, LB.Exit);
290     nodes[ib].addBias(Freq, PrefSpill);
291     nodes[ob].addBias(Freq, PrefSpill);
306     nodes[ib].addLink(ob, Freq);
307     nodes[ob].addLink(ib, Freq);
317     if (nodes[n].mustSpill())
319     if (nodes[n].preferReg())
326   if (!nodes[n].update(nodes, Threshold))
328   nodes[n].getDissentingNeighbors(TodoList, nodes);
332 /// iterate - Repeatedly update the Hopfield nodes until stability or the
342   // The call to ::update will add the nodes that changed into the todolist.
348     if (nodes[n].preferReg())
369     if (!nodes[n].preferReg()) {