Lines Matching defs:Weights
35 // Weights are for internal use only. They are used by heuristics to help to
38 // Using "Loop Branch Heuristics" we predict weights of edges for the
93 /// \brief Calculate edge weights for successors lead to unreachable.
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 setEdgeWeight(BB, TI->getSuccessor(i), Weights[i]);
182 // Calculate Edge Weights using "Pointer Heuristics". Predict a comparsion
217 // Calculate Edge Weights using "Loop Branch Heuristics". Predict backedges
473 DenseMap<Edge, uint32_t>::const_iterator I = Weights.find(E);
475 if (I != Weights.end())
483 Weights[std::make_pair(Src, Dst)] = Weight;
