forked from OSchip/llvm-project
Simple arithmetic loop-based test case for modulo scheduling.
llvm-svn: 5774
This commit is contained in:
parent
dbea9cd4be
commit
f0971994ca
|
@ -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;
|
||||
}
|
Loading…
Reference in New Issue