Lines Matching refs:Links
87 /// but Bias and Links are computed each time placeSpills is called.
99 /// Value - Output value of this node computed from the Bias and links.
106 /// Links - (Weight, BundleNo) for all transparent blocks connecting to other
108 LinkVector Links;
110 /// SumLinkWeights - Cached sum of the weights of all links + ThresHold.
132 Links.clear();
140 // There can be multiple links to the same bundle, add them up.
141 for (LinkVector::iterator I = Links.begin(), E = Links.end(); I != E; ++I)
147 Links.push_back(std::make_pair(w, b));
167 /// update - Recompute Value from Bias and Links. Return true when node
173 for (LinkVector::iterator I = Links.begin(), E = Links.end(); I != E; ++I) {
184 // 1. It avoids arbitrary bias when all links are 0 as is possible during
186 // 2. It helps tame rounding errors when the links nominally sum to 0.
239 // limiting the number of blocks visited and the number of links in the
287 void SpillPlacement::addLinks(ArrayRef<unsigned> Links) {
288 for (ArrayRef<unsigned>::iterator I = Links.begin(), E = Links.end(); I != E;
299 if (nodes[ib].Links.empty() && !nodes[ib].mustSpill())
301 if (nodes[ob].Links.empty() && !nodes[ob].mustSpill())
314 // A node that must spill, or a node without any links is not going to
318 if (!nodes[n].Links.empty())
