Lines Matching defs:LL
619 // If this is a trivial offset, then we'll get something like
1769 // Because we'll keep the child with the largest depth, the largest
2176 std::vector<Value *> &LL = CandidatePairs2[S->second];
2177 for (std::vector<Value *>::iterator L = LL.begin(), LE = LL.end();
2287 // from which we'll extract NumElem total elements (where the first NumElemI
2874 // relies on finding the same use dags here as were found earlier, we'll
2934 // could be flipped. So we'll add each pair, flipped, into the ChosenPairs
