reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
1441 for (unsigned i = 0, e = Ops.size(); i != e; ++i) { 1442 Value *TheOp = Ops[i].Op; 1446 if (i+1 != Ops.size() && Ops[i+1].Op == TheOp) { 1446 if (i+1 != Ops.size() && Ops[i+1].Op == TheOp) { 1450 Ops.erase(Ops.begin()+i); 1450 Ops.erase(Ops.begin()+i); 1452 } while (i != Ops.size() && Ops[i].Op == TheOp); 1452 } while (i != Ops.size() && Ops[i].Op == TheOp); 1470 if (Ops.empty()) 1476 Ops.insert(Ops.begin(), ValueEntry(getRank(Mul), Mul)); 1476 Ops.insert(Ops.begin(), ValueEntry(getRank(Mul), Mul)); 1479 e = Ops.size(); 1489 unsigned FoundX = FindInOperandList(Ops, i, X); 1494 if (Ops.size() == 2 && 1499 if (Ops.size() == 2 && match(TheOp, m_Not(m_Value()))) 1502 Ops.erase(Ops.begin()+i); 1502 Ops.erase(Ops.begin()+i); 1507 Ops.erase(Ops.begin()+FoundX); 1507 Ops.erase(Ops.begin()+FoundX); 1515 Ops.insert(Ops.end(), ValueEntry(getRank(V), V)); 1515 Ops.insert(Ops.end(), ValueEntry(getRank(V), V)); 1531 for (unsigned i = 0, e = Ops.size(); i != e; ++i) { 1533 isReassociableOp(Ops[i].Op, Instruction::Mul, Instruction::FMul); 1602 for (unsigned i = 0; i != Ops.size(); ++i) { 1605 isReassociableOp(Ops[i].Op, Instruction::Mul, Instruction::FMul); 1609 if (Value *V = RemoveFactorFromExpression(Ops[i].Op, MaxOccVal)) { 1612 for (unsigned j = Ops.size(); j != i;) { 1614 if (Ops[j].Op == Ops[i].Op) { 1614 if (Ops[j].Op == Ops[i].Op) { 1616 Ops.erase(Ops.begin()+j); 1616 Ops.erase(Ops.begin()+j); 1646 if (Ops.empty()) 1652 Ops.insert(Ops.begin(), ValueEntry(getRank(V2), V2)); 1652 Ops.insert(Ops.begin(), ValueEntry(getRank(V2), V2));