search for: unroll_dim

I've got an example where I think that there should be some loop-invariant optimization happening, but it's not. Here's the C code: #define DIM 8 #define UNROLL_DIM DIM typedef double InArray[DIM][DIM]; __declspec(noalias) void f1( InArray c, const InArray a, const InArray b ) { #pragma clang loop unroll_count(UNROLL_DIM) for( int i=0;i<DIM;i++) #pragma clang loop unroll_count(UNROLL_DIM) for( int j=0;j<DIM;j++) #pragma clang loop unroll_c...

...llvm-dev at lists.llvm.org> > *Subject:* [llvm-dev] Loop invariant not being optimized > > > > I've got an example where I think that there should be some loop-invariant > optimization happening, but it's not. Here's the C code: > > #define DIM 8 > #define UNROLL_DIM DIM > typedef double InArray[DIM][DIM]; > > __declspec(noalias) void f1( InArray c, const InArray a, const InArray b ) > { > > #pragma clang loop unroll_count(UNROLL_DIM) > for( int i=0;i<DIM;i++) > #pragma clang loop unroll_count(UNROLL_DIM) > for( int j=0...

I was looking at the code generated from the following c code and noticed extra loads in the inner-loop of these nested for-loops: #define DIM 8 #define UNROLL_DIM DIM typedef double InArray[DIM][DIM]; void f1( InArray c, InArray a, InArray b ) { #pragma clang loop unroll_count(UNROLL_DIM) for( int i=0;i<DIM;i++) #pragma clang loop unroll_count(UNROLL_DIM) for( int j=0;j<DIM;j++) #pragma clang loop unroll_count(UNROLL_DIM) for(...