Lines Matching refs:UDIV
1116 case ISD::UDIV: return visitUDIV(N);
1928 // udiv instead. Handles (X&15) /s 4 -> X&15 >> 2
1931 return DAG.getNode(ISD::UDIV, SDLoc(N), N1.getValueType(),
2001 // fold (udiv c1, c2) -> c1/c2
2003 return DAG.FoldConstantArithmetic(ISD::UDIV, VT, N0C, N1C);
2004 // fold (udiv x, (1 << c)) -> x >>u c
2009 // fold (udiv x, (shl c, y)) -> x >>u (log2(c)+y) iff c is power of 2
2024 // fold (udiv x, c) -> alternate
2113 SDValue Div = DAG.getNode(ISD::UDIV, SDLoc(N), VT, N0, N1);
2353 SDValue Res = SimplifyNodeWithTwoResults(N, ISD::UDIV, ISD::UREM);
9552 if (N->getOpcode() == ISD::SDIV || N->getOpcode() == ISD::UDIV ||
10081 /// BuildUDIVSequence - Given an ISD::UDIV node expressing a divide by constant,
