Lines Matching refs:MUL
582 if (Shl_0.getOpcode() == ISD::MUL) {
1614 case ISD::MUL:
1703 if (Opcode == ISD::MUL &&
1770 if (Val.getOpcode() != ISD::MUL ||
1798 if (Val.getOpcode() == ISD::MUL) {
1821 if (V.getOpcode() == ISD::MUL) {
1838 if (V.getOpcode() == ISD::MUL) {
1940 // SHL nodes will be converted to MUL nodes
1942 NOpcode = ISD::MUL;
1989 (Child.getOpcode() == ISD::MUL || Child.getOpcode() == ISD::SHL) &&
1991 // Try to identify two factorizable MUL/SHL children greedily. Leave
2025 (NOpcode == ISD::MUL && ChildOpcode == ISD::SHL));
2027 // Convert SHL to MUL
2055 // Transform MUL(x, C * 2^Y) + SHL(z, Y) -> SHL(ADD(MUL(x, C), z), Y)
2059 LLVM_DEBUG(dbgs() << "--> Found common factor for two MUL children!\n");
2150 // See whether we can grab a MUL to form an add(Rx,mpyi(Ry,#u6)),
2185 // Rebuild this node (and restore SHL from MUL if needed)
2186 if (V1C && NOpcode == ISD::MUL && V1C->getAPIntValue().isPowerOf2())
2211 // Restore SHL if we earlier converted it to a MUL
2212 if (NewRoot.getOpcode() == ISD::MUL) {