new file mode 100644
@@ -0,0 +1,31 @@
+/* { dg-do run } */
+/* { dg-options "-O2 -msoft-div -msoft-mul" } */
+
+struct testcase {
+ int a;
+ int b;
+ int c;
+ int expected;
+};
+
+struct testcase tests[] = {
+ {2, 200, 3, 133},
+ {3, 300, 3, 300},
+ {2, 500, 3, 333},
+ {4, 250, 3, 333},
+ {0, 0, 0, 0}
+};
+
+int calc (int a, int b, int c) {
+ return a * b / c;
+}
+
+int main () {
+ int fail = 0;
+ struct testcase *tc;
+
+ for (int i = 0; (tc = &tests[i], tc->c); i++)
+ fail |= (calc (tc->a, tc->b, tc->c) != tc->expected);
+
+ return fail;
+}
@@ -68,18 +68,18 @@ __udivmodsi3_internal:
is not clobbered by this routine, and use that as to
save a return address without creating a stack frame. */
- l.sfeqi r4, 0 /* division by zero; return 0. */
+ l.sfeq r4, r0 /* division by zero; return 0. */
l.ori r11, r0, 0 /* initial quotient */
l.bf 9f
l.ori r12, r3, 0 /* initial remainder */
/* Given X/Y, shift Y left until Y >= X. */
l.ori r6, r0, 1 /* mask = 1 */
-1: l.sfltsi r4, 0 /* y has msb set */
+1: l.sflts r4, r0 /* y has msb set */
l.bf 2f
l.sfltu r4, r12 /* y < x */
l.add r4, r4, r4 /* y <<= 1 */
- l.bnf 1b
+ l.bf 1b
l.add r6, r6, r6 /* mask <<= 1 */
/* Shift Y back to the right again, subtracting from X. */