Lines Matching full:links
69 /// but Bias and Links are computed each time placeSpills is called.
81 /// Value - Output value of this node computed from the Bias and links.
88 /// Links - (Weight, BundleNo) for all transparent blocks connecting to other
90 LinkVector Links;
92 /// SumLinkWeights - Cached sum of the weights of all links + ThresHold.
114 Links.clear();
122 // There can be multiple links to the same bundle, add them up.
123 for (LinkVector::iterator I = Links.begin(), E = Links.end(); I != E; ++I)
129 Links.push_back(std::make_pair(w, b));
149 /// update - Recompute Value from Bias and Links. Return true when node
155 for (LinkVector::iterator I = Links.begin(), E = Links.end(); I != E; ++I) {
166 // 1. It avoids arbitrary bias when all links are 0 as is possible during
168 // 2. It helps tame rounding errors when the links nominally sum to 0.
220 // limiting the number of blocks visited and the number of links in the
268 void SpillPlacement::addLinks(ArrayRef<unsigned> Links) {
269 for (ArrayRef<unsigned>::iterator I = Links.begin(), E = Links.end(); I != E;
280 if (nodes[ib].Links.empty() && !nodes[ib].mustSpill())
282 if (nodes[ob].Links.empty() && !nodes[ob].mustSpill())
295 // A node that must spill, or a node without any links is not going to
299 if (!nodes[n].Links.empty())
