mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-02-27 02:31:09 +00:00
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:
parent
cf54d17f75
commit
5cd8ae9255
18
test/Transforms/ModuloSched/arith-simple.c
Normal file
18
test/Transforms/ModuloSched/arith-simple.c
Normal 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;
|
||||
}
|
Loading…
x
Reference in New Issue
Block a user