mirror of
https://github.com/Gericom/teak-llvm.git
synced 2025-06-28 07:49:01 -04:00

In C99, an array parameter declarator might have the form: direct-declarator '[' 'static' type-qual-list[opt] assign-expr ']' where the static keyword indicates that the caller will always provide a pointer to the beginning of an array with at least the number of elements specified by the assignment expression. For constant sizes, we can use the new dereferenceable attribute to pass this information to the optimizer. For VLAs, we don't know the size, but (for addrspace(0)) do know that the pointer must be nonnull (and so we can use the nonnull attribute). llvm-svn: 213444
207 lines
6.8 KiB
C
207 lines
6.8 KiB
C
// RUN: %clang_cc1 -triple i386-unknown-unknown %s -emit-llvm -o - | FileCheck %s
|
|
|
|
int b(char* x);
|
|
|
|
// Extremely basic VLA test
|
|
void a(int x) {
|
|
char arry[x];
|
|
arry[0] = 10;
|
|
b(arry);
|
|
}
|
|
|
|
int c(int n)
|
|
{
|
|
return sizeof(int[n]);
|
|
}
|
|
|
|
int f0(int x) {
|
|
int vla[x];
|
|
return vla[x-1];
|
|
}
|
|
|
|
void
|
|
f(int count)
|
|
{
|
|
int a[count];
|
|
|
|
do { } while (0);
|
|
|
|
if (a[0] != 3) {
|
|
}
|
|
}
|
|
|
|
void g(int count) {
|
|
// Make sure we emit sizes correctly in some obscure cases
|
|
int (*a[5])[count];
|
|
int (*b)[][count];
|
|
}
|
|
|
|
// rdar://8403108
|
|
// CHECK-LABEL: define void @f_8403108
|
|
void f_8403108(unsigned x) {
|
|
// CHECK: call i8* @llvm.stacksave()
|
|
char s1[x];
|
|
while (1) {
|
|
// CHECK: call i8* @llvm.stacksave()
|
|
char s2[x];
|
|
if (1)
|
|
break;
|
|
// CHECK: call void @llvm.stackrestore(i8*
|
|
}
|
|
// CHECK: call void @llvm.stackrestore(i8*
|
|
}
|
|
|
|
// pr7827
|
|
void function(short width, int data[][width]) {} // expected-note {{passing argument to parameter 'data' here}}
|
|
|
|
void test() {
|
|
int bork[4][13];
|
|
// CHECK: call void @function(i16 signext 1, i32* null)
|
|
function(1, 0);
|
|
// CHECK: call void @function(i16 signext 1, i32* inttoptr
|
|
function(1, 0xbadbeef); // expected-warning {{incompatible integer to pointer conversion passing}}
|
|
// CHECK: call void @function(i16 signext 1, i32* {{.*}})
|
|
function(1, bork);
|
|
}
|
|
|
|
void function1(short width, int data[][width][width]) {}
|
|
void test1() {
|
|
int bork[4][13][15];
|
|
// CHECK: call void @function1(i16 signext 1, i32* {{.*}})
|
|
function1(1, bork);
|
|
// CHECK: call void @function(i16 signext 1, i32* {{.*}})
|
|
function(1, bork[2]);
|
|
}
|
|
|
|
// rdar://8476159
|
|
static int GLOB;
|
|
int test2(int n)
|
|
{
|
|
GLOB = 0;
|
|
char b[1][n+3]; /* Variable length array. */
|
|
// CHECK: [[tmp_1:%.*]] = load i32* @GLOB, align 4
|
|
// CHECK-NEXT: add nsw i32 [[tmp_1]], 1
|
|
__typeof__(b[GLOB++]) c;
|
|
return GLOB;
|
|
}
|
|
|
|
// http://llvm.org/PR8567
|
|
// CHECK-LABEL: define double @test_PR8567
|
|
double test_PR8567(int n, double (*p)[n][5]) {
|
|
// CHECK: [[NV:%.*]] = alloca i32, align 4
|
|
// CHECK-NEXT: [[PV:%.*]] = alloca [5 x double]*, align 4
|
|
// CHECK-NEXT: store
|
|
// CHECK-NEXT: store
|
|
// CHECK-NEXT: [[N:%.*]] = load i32* [[NV]], align 4
|
|
// CHECK-NEXT: [[P:%.*]] = load [5 x double]** [[PV]], align 4
|
|
// CHECK-NEXT: [[T0:%.*]] = mul nsw i32 1, [[N]]
|
|
// CHECK-NEXT: [[T1:%.*]] = getelementptr inbounds [5 x double]* [[P]], i32 [[T0]]
|
|
// CHECK-NEXT: [[T2:%.*]] = getelementptr inbounds [5 x double]* [[T1]], i32 2
|
|
// CHECK-NEXT: [[T3:%.*]] = getelementptr inbounds [5 x double]* [[T2]], i32 0, i32 3
|
|
// CHECK-NEXT: [[T4:%.*]] = load double* [[T3]]
|
|
// CHECK-NEXT: ret double [[T4]]
|
|
return p[1][2][3];
|
|
}
|
|
|
|
int test4(unsigned n, char (*p)[n][n+1][6]) {
|
|
// CHECK-LABEL: define i32 @test4(
|
|
// CHECK: [[N:%.*]] = alloca i32, align 4
|
|
// CHECK-NEXT: [[P:%.*]] = alloca [6 x i8]*, align 4
|
|
// CHECK-NEXT: [[P2:%.*]] = alloca [6 x i8]*, align 4
|
|
// CHECK-NEXT: store i32
|
|
// CHECK-NEXT: store [6 x i8]*
|
|
|
|
// VLA captures.
|
|
// CHECK-NEXT: [[DIM0:%.*]] = load i32* [[N]], align 4
|
|
// CHECK-NEXT: [[T0:%.*]] = load i32* [[N]], align 4
|
|
// CHECK-NEXT: [[DIM1:%.*]] = add i32 [[T0]], 1
|
|
|
|
// CHECK-NEXT: [[T0:%.*]] = load [6 x i8]** [[P]], align 4
|
|
// CHECK-NEXT: [[T1:%.*]] = load i32* [[N]], align 4
|
|
// CHECK-NEXT: [[T2:%.*]] = udiv i32 [[T1]], 2
|
|
// CHECK-NEXT: [[T3:%.*]] = mul nuw i32 [[DIM0]], [[DIM1]]
|
|
// CHECK-NEXT: [[T4:%.*]] = mul nsw i32 [[T2]], [[T3]]
|
|
// CHECK-NEXT: [[T5:%.*]] = getelementptr inbounds [6 x i8]* [[T0]], i32 [[T4]]
|
|
// CHECK-NEXT: [[T6:%.*]] = load i32* [[N]], align 4
|
|
// CHECK-NEXT: [[T7:%.*]] = udiv i32 [[T6]], 4
|
|
// CHECK-NEXT: [[T8:%.*]] = sub i32 0, [[T7]]
|
|
// CHECK-NEXT: [[T9:%.*]] = mul nuw i32 [[DIM0]], [[DIM1]]
|
|
// CHECK-NEXT: [[T10:%.*]] = mul nsw i32 [[T8]], [[T9]]
|
|
// CHECK-NEXT: [[T11:%.*]] = getelementptr inbounds [6 x i8]* [[T5]], i32 [[T10]]
|
|
// CHECK-NEXT: store [6 x i8]* [[T11]], [6 x i8]** [[P2]], align 4
|
|
__typeof(p) p2 = (p + n/2) - n/4;
|
|
|
|
// CHECK-NEXT: [[T0:%.*]] = load [6 x i8]** [[P2]], align 4
|
|
// CHECK-NEXT: [[T1:%.*]] = load [6 x i8]** [[P]], align 4
|
|
// CHECK-NEXT: [[T2:%.*]] = ptrtoint [6 x i8]* [[T0]] to i32
|
|
// CHECK-NEXT: [[T3:%.*]] = ptrtoint [6 x i8]* [[T1]] to i32
|
|
// CHECK-NEXT: [[T4:%.*]] = sub i32 [[T2]], [[T3]]
|
|
// CHECK-NEXT: [[T5:%.*]] = mul nuw i32 [[DIM0]], [[DIM1]]
|
|
// CHECK-NEXT: [[T6:%.*]] = mul nuw i32 6, [[T5]]
|
|
// CHECK-NEXT: [[T7:%.*]] = sdiv exact i32 [[T4]], [[T6]]
|
|
// CHECK-NEXT: ret i32 [[T7]]
|
|
return p2 - p;
|
|
}
|
|
|
|
// rdar://11485774
|
|
void test5(void)
|
|
{
|
|
// CHECK-LABEL: define void @test5(
|
|
int a[5], i = 0;
|
|
// CHECK: [[A:%.*]] = alloca [5 x i32], align 4
|
|
// CHECK-NEXT: [[I:%.*]] = alloca i32, align 4
|
|
// CHECK-NEXT: [[CL:%.*]] = alloca i32*, align 4
|
|
// CHECK-NEXT: store i32 0, i32* [[I]], align 4
|
|
|
|
(typeof(++i, (int (*)[i])a)){&a} += 0;
|
|
// CHECK-NEXT: [[Z:%.*]] = load i32* [[I]], align 4
|
|
// CHECK-NEXT: [[INC:%.*]] = add nsw i32 [[Z]], 1
|
|
// CHECK-NEXT: store i32 [[INC]], i32* [[I]], align 4
|
|
// CHECK-NEXT: [[O:%.*]] = load i32* [[I]], align 4
|
|
// CHECK-NEXT: [[AR:%.*]] = getelementptr inbounds [5 x i32]* [[A]], i32 0, i32 0
|
|
// CHECK-NEXT: [[T:%.*]] = bitcast [5 x i32]* [[A]] to i32*
|
|
// CHECK-NEXT: store i32* [[T]], i32** [[CL]]
|
|
// CHECK-NEXT: [[TH:%.*]] = load i32** [[CL]]
|
|
// CHECK-NEXT: [[VLAIX:%.*]] = mul nsw i32 0, [[O]]
|
|
// CHECK-NEXT: [[ADDPTR:%.*]] = getelementptr inbounds i32* [[TH]], i32 [[VLAIX]]
|
|
// CHECK-NEXT: store i32* [[ADDPTR]], i32** [[CL]]
|
|
}
|
|
|
|
void test6(void)
|
|
{
|
|
// CHECK-LABEL: define void @test6(
|
|
int n = 20, **a, i=0;
|
|
// CHECK: [[N:%.*]] = alloca i32, align 4
|
|
// CHECK-NEXT: [[A:%.*]] = alloca i32**, align 4
|
|
// CHECK-NEXT: [[I:%.*]] = alloca i32, align 4
|
|
(int (**)[i]){&a}[0][1][5] = 0;
|
|
// CHECK-NEXT: [[CL:%.*]] = alloca i32**, align 4
|
|
// CHECK-NEXT: store i32 20, i32* [[N]], align 4
|
|
// CHECK-NEXT: store i32 0, i32* [[I]], align 4
|
|
// CHECK-NEXT: [[Z:%.*]] = load i32* [[I]], align 4
|
|
// CHECK-NEXT: [[O:%.*]] = bitcast i32*** [[A]] to i32**
|
|
// CHECK-NEXT: store i32** [[O]], i32*** [[CL]]
|
|
// CHECK-NEXT: [[T:%.*]] = load i32*** [[CL]]
|
|
// CHECK-NEXT: [[IX:%.*]] = getelementptr inbounds i32** [[T]], i32 0
|
|
// CHECK-NEXT: [[TH:%.*]] = load i32** [[IX]], align 4
|
|
// CHECK-NEXT: [[F:%.*]] = mul nsw i32 1, [[Z]]
|
|
// CHECK-NEXT: [[IX1:%.*]] = getelementptr inbounds i32* [[TH]], i32 [[F]]
|
|
// CHECK-NEXT: [[IX2:%.*]] = getelementptr inbounds i32* [[IX1]], i32 5
|
|
// CHECK-NEXT: store i32 0, i32* [[IX2]], align 4
|
|
}
|
|
|
|
// Follow gcc's behavior for VLAs in parameter lists. PR9559.
|
|
void test7(int a[b(0)]) {
|
|
// CHECK-LABEL: define void @test7(
|
|
// CHECK: call i32 @b(i8* null)
|
|
}
|
|
|
|
// Make sure we emit dereferenceable or nonnull when the static keyword is
|
|
// provided.
|
|
void test8(int a[static 3]) { }
|
|
// CHECK: define void @test8(i32* dereferenceable(12) %a)
|
|
|
|
void test9(int n, int a[static n]) { }
|
|
// CHECK: define void @test9(i32 %n, i32* nonnull %a)
|
|
|