Lines Matching defs:Weights
41 DenseMap<Edge, uint32_t> *Weights;
48 // Weights are for internal use only. They are used by heuristics to help to
51 // Using "Loop Branch Heuristics" we predict weights of edges for the
122 : Weights(W), BP(BP), LI(LI) {
125 // Metadata Weights
157 // Ensure there are weights for all of the successors. Note that the first
162 // Build up the final weights that will be used in a temporary buffer, but
166 SmallVector<uint32_t, 2> Weights;
167 Weights.reserve(TI->getNumSuccessors());
172 Weights.push_back(
175 assert(Weights.size() == TI->getNumSuccessors() && "Checked above");
177 BP->setEdgeWeight(BB, TI->getSuccessor(i), Weights[i]);
182 // Calculate Edge Weights using "Return Heuristics". Predict a successor which
222 // Calculate Edge Weights using "Pointer Heuristics". Predict a comparsion
257 // Calculate Edge Weights using "Loop Branch Heuristics". Predict backedges
415 BranchProbabilityAnalysis BPA(&Weights, this, &LI);
475 DenseMap<Edge, uint32_t>::const_iterator I = Weights.find(E);
477 if (I != Weights.end())
485 Weights[std::make_pair(Src, Dst)] = Weight;
