Lines Matching defs:SHL
603 if (C1->getSExtValue() != 0 || Sub_1.getOpcode() != ISD::SHL)
892 case ISD::SHL: return SelectSHL(N);
1054 if (T1.getOpcode() != ISD::SHL)
1079 SDValue NewShl = DAG.getNode(ISD::SHL, DL, VT, NewAdd, C);
1155 SDValue NewShl = DAG.getNode(ISD::SHL, dl, VT, NewSrl, DC);
1623 case ISD::SHL:
1732 /// Search for a SHL(x, [<=MaxAmount]) subtree in the queue, return the one of
1750 if (Val.getOpcode() != ISD::SHL ||
1817 if (Val.getOpcode() == ISD::SHL) {
1836 } else if (V.getOpcode() == ISD::SHL) {
1857 } else if (V.getOpcode() == ISD::SHL) {
1947 // SHL nodes will be converted to MUL nodes
1948 if (NOpcode == ISD::SHL)
1960 ((isOpcodeHandled(Op0.getNode()) && Op0.getOpcode() == ISD::SHL &&
1962 (isOpcodeHandled(Op1.getNode()) && Op1.getOpcode() == ISD::SHL &&
1996 (Child.getOpcode() == ISD::MUL || Child.getOpcode() == ISD::SHL) &&
1998 // Try to identify two factorizable MUL/SHL children greedily. Leave
2032 (NOpcode == ISD::MUL && ChildOpcode == ISD::SHL));
2034 // Convert SHL to MUL
2036 if (ChildOpcode == ISD::SHL)
2062 // Transform MUL(x, C * 2^Y) + SHL(z, Y) -> SHL(ADD(MUL(x, C), z), Y)
2075 SDValue New = CurDAG->getNode(ISD::SHL, SDLoc(N), Mul1.Value.getValueType(),
2127 // Combine GA + SHL(x, C<=31) so we will match Rx=add(#u8,asl(Rx,#U5))
2129 WeightedLeaf SHL = Leaves.findSHL(31);
2130 if (SHL.Value.getNode()) {
2131 int Height = std::max(NodeHeights[GA.Value], NodeHeights[SHL.Value]) + 1;
2134 GA.Value, SHL.Value);
2135 GA.Weight = SHL.Weight; // Specifically ignore the GA weight here
2192 // Rebuild this node (and restore SHL from MUL if needed)
2195 ISD::SHL, SDLoc(V0), VT, V0,
2218 // Restore SHL if we earlier converted it to a MUL
2225 ISD::SHL, SDLoc(NewRoot), VT, V0,