Simple arithmetic loop-based test case for modulo scheduling.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@5774 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Misha Brukman 2003-04-10 22:01:15 +00:00
parent cf54d17f75
commit 5cd8ae9255

View File

@ -0,0 +1,18 @@
#include <stdio.h>
int main (int argc, char** argv) {
int a, b, c, d, i;
a = b = c = d = 1;
for (i=0; i < 15; i++) {
a = b + c;
c = d - b;
d = a + b;
b = c + i;
}
printf("a = %d, b = %d, c = %d, d = %d\n", a, b, c, d);
return 0;
}