Lines Matching full:divisor
39 const int32_t divisor) {
41 base::SignedDivisionByConstant(bit_cast<uint32_t>(divisor));
46 if (divisor > 0 && multiplier < 0) {
48 } else if (divisor < 0 && multiplier > 0) {
1012 TRACED_FOREACH(int32_t, divisor, kInt32Values) {
1013 if (divisor < 0) {
1014 if (base::bits::IsPowerOfTwo32(-divisor)) continue;
1016 machine()->Int32Div(), p0, Int32Constant(divisor), graph()->start()));
1019 IsTruncatingDiv(p0, -divisor)));
1020 } else if (divisor > 0) {
1021 if (base::bits::IsPowerOfTwo32(divisor)) continue;
1023 machine()->Int32Div(), p0, Int32Constant(divisor), graph()->start()));
1025 EXPECT_THAT(r.replacement(), IsTruncatingDiv(p0, divisor));
1067 TRACED_FOREACH(uint32_t, divisor, kUint32Values) {
1070 Uint32Constant(divisor), graph()->start()));
1074 base::bits::UnsignedDiv32(dividend, divisor))));
1130 TRACED_FOREACH(int32_t, divisor, kInt32Values) {
1133 Int32Constant(divisor), graph()->start()));
1136 IsInt32Constant(base::bits::SignedMod32(dividend, divisor)));
1170 TRACED_FOREACH(int32_t, divisor, kInt32Values) {
1171 if (divisor == 0 || base::bits::IsPowerOfTwo32(Abs(divisor))) continue;
1173 machine()->Int32Mod(), p0, Int32Constant(divisor), graph()->start()));
1176 IsInt32Sub(p0, IsInt32Mul(IsTruncatingDiv(p0, Abs(divisor)),
1177 IsInt32Constant(Abs(divisor)))));
1216 TRACED_FOREACH(uint32_t, divisor, kUint32Values) {
1219 Uint32Constant(divisor), graph()->start()));
1223 base::bits::UnsignedMod32(dividend, divisor))));
