Lines Matching defs:Factor
1138 /// and if this sequence contains a multiply by Factor,
1139 /// remove Factor from the tree and return the new tree.
1140 Value *ReassociatePass::RemoveFactorFromExpression(Value *V, Value *Factor) {
1158 if (Factors[i].Op == Factor) {
1165 if (ConstantInt *FC1 = dyn_cast<ConstantInt>(Factor)) {
1172 } else if (ConstantFP *FC1 = dyn_cast<ConstantFP>(Factor)) {
1644 Value *Factor = Factors[i];
1645 if (!Duplicates.insert(Factor).second)
1648 unsigned Occ = ++FactorOccurrences[Factor];
1651 MaxOccVal = Factor;
1654 // If Factor is a negative constant, add the negated value as a factor
1657 if (ConstantInt *CI = dyn_cast<ConstantInt>(Factor)) {
1659 Factor = ConstantInt::get(CI->getContext(), -CI->getValue());
1660 if (!Duplicates.insert(Factor).second)
1662 unsigned Occ = ++FactorOccurrences[Factor];
1665 MaxOccVal = Factor;
1668 } else if (ConstantFP *CF = dyn_cast<ConstantFP>(Factor)) {
1672 Factor = ConstantFP::get(CF->getContext(), F);
1673 if (!Duplicates.insert(Factor).second)
1675 unsigned Occ = ++FactorOccurrences[Factor];
1678 MaxOccVal = Factor;
1769 SmallVectorImpl<Factor> &Factors) {
1807 Factors.push_back(Factor(Op, Count));
1815 llvm::stable_sort(Factors, [](const Factor &LHS, const Factor &RHS) {
1846 SmallVectorImpl<Factor> &Factors) {
1877 [](const Factor &LHS, const Factor &RHS) {
1912 SmallVector<Factor, 4> Factors;