forked from OSchip/llvm-project
bedef00e2c
This allows us to delinearize code such as the one below, where the array
sizes are A[][2 * n] as there are n times two elements in the innermost
dimension. Alternatively, we could try to generate another dimension for the
struct in the innermost dimension, but as the struct has constant size,
recovering this dimension is easy.
struct com {
double Real;
double Img;
};
void foo(long n, struct com A[][n]) {
for (long i = 0; i < 100; i++)
for (long j = 0; j < 1000; j++)
A[i][j].Real += A[i][j].Img;
}
int main() {
struct com A[100][1000];
foo(1000, A);
llvm-svn: 288489
|
||
|---|---|---|
| .. | ||
| CodeGen/OpenMP | ||
| DeLICM | ||
| DeadCodeElimination | ||
| DependenceInfo | ||
| FlattenSchedule | ||
| GPGPU | ||
| Isl | ||
| ScheduleOptimizer | ||
| ScopDetect | ||
| ScopDetectionDiagnostics | ||
| ScopInfo | ||
| Unit | ||
| UnitIsl | ||
| CMakeLists.txt | ||
| README | ||
| create_ll.sh | ||
| lit.cfg | ||
| lit.site.cfg.in | ||
| polly.ll | ||
| update_check.py | ||
README
place tests here