blob: 9e62da52e0266f1daa77e9bcaee946991f34ebbc [file] [log] [blame]
Argyrios Kyrtzidis981b6fd2010-11-09 01:30:48 +00001// RUN: %clang_cc1 -triple i386-unknown-unknown %s -emit-llvm -o - | FileCheck %s
Eli Friedman8f39f5e2008-12-20 23:11:59 +00002
3int b(char* x);
4
5// Extremely basic VLA test
6void a(int x) {
7 char arry[x];
8 arry[0] = 10;
9 b(arry);
10}
Anders Carlssonb50525b2008-12-21 03:33:21 +000011
Anders Carlsson02697092008-12-21 03:40:32 +000012int c(int n)
Anders Carlssonb50525b2008-12-21 03:33:21 +000013{
Anders Carlsson02697092008-12-21 03:40:32 +000014 return sizeof(int[n]);
Anders Carlssonb50525b2008-12-21 03:33:21 +000015}
Anders Carlssonc756a8e2009-02-09 21:48:07 +000016
17int f0(int x) {
18 int vla[x];
19 return vla[x-1];
20}
Anders Carlsson22ab8d82009-02-10 22:50:24 +000021
22void
23f(int count)
24{
25 int a[count];
26
27 do { } while (0);
28
29 if (a[0] != 3) {
30 }
31}
Eli Friedmanbdad6b62009-05-29 19:23:46 +000032
33void g(int count) {
34 // Make sure we emit sizes correctly in some obscure cases
35 int (*a[5])[count];
36 int (*b)[][count];
37}
Argyrios Kyrtzidis4ada2ca2010-09-14 00:42:34 +000038
39// rdar://8403108
40// CHECK: define void @f_8403108
41void f_8403108(unsigned x) {
42 // CHECK: call i8* @llvm.stacksave()
43 char s1[x];
44 while (1) {
45 // CHECK: call i8* @llvm.stacksave()
46 char s2[x];
47 if (1)
48 break;
49 // CHECK: call void @llvm.stackrestore(i8*
50 }
51 // CHECK: call void @llvm.stackrestore(i8*
52}
Fariborz Jahanianf4435702010-09-21 22:53:33 +000053
54// pr7827
Fariborz Jahanian745da3a2010-09-24 17:30:16 +000055void function(short width, int data[][width]) {} // expected-note {{passing argument to parameter 'data' here}}
Fariborz Jahanianf4435702010-09-21 22:53:33 +000056
57void test() {
Fariborz Jahanian745da3a2010-09-24 17:30:16 +000058 int bork[4][13];
Fariborz Jahanianf4435702010-09-21 22:53:33 +000059 // CHECK: call void @function(i16 signext 1, i32* null)
60 function(1, 0);
Fariborz Jahanian745da3a2010-09-24 17:30:16 +000061 // CHECK: call void @function(i16 signext 1, i32* inttoptr
62 function(1, 0xbadbeef); // expected-warning {{incompatible integer to pointer conversion passing}}
63 // CHECK: call void @function(i16 signext 1, i32* {{.*}})
64 function(1, bork);
65}
66
67void function1(short width, int data[][width][width]) {}
68void test1() {
69 int bork[4][13][15];
70 // CHECK: call void @function1(i16 signext 1, i32* {{.*}})
71 function1(1, bork);
72 // CHECK: call void @function(i16 signext 1, i32* {{.*}})
73 function(1, bork[2]);
Fariborz Jahanianf4435702010-09-21 22:53:33 +000074}
75
Fariborz Jahanianc5be7b02010-09-28 20:42:35 +000076// rdar://8476159
77static int GLOB;
78int test2(int n)
79{
80 GLOB = 0;
81 char b[1][n+3]; /* Variable length array. */
82 // CHECK: [[tmp_1:%.*]] = load i32* @GLOB, align 4
83 // CHECK-NEXT: add nsw i32 [[tmp_1]], 1
84 __typeof__(b[GLOB++]) c;
85 return GLOB;
86}
87
Argyrios Kyrtzidis981b6fd2010-11-09 01:30:48 +000088// http://llvm.org/PR8567
89// CHECK: define double @test_PR8567
90double test_PR8567(int n, double (*p)[n][5]) {
John McCallbc8d40d2011-06-24 21:55:10 +000091 // CHECK: [[NV:%.*]] = alloca i32, align 4
92 // CHECK-NEXT: [[PV:%.*]] = alloca [5 x double]*, align 4
93 // CHECK-NEXT: store
94 // CHECK-NEXT: store
95 // CHECK-NEXT: [[N:%.*]] = load i32* [[NV]], align 4
96 // CHECK-NEXT: [[P:%.*]] = load [5 x double]** [[PV]], align 4
John McCall913dab22011-06-25 01:32:37 +000097 // CHECK-NEXT: [[T0:%.*]] = mul nsw i32 1, [[N]]
John McCallbc8d40d2011-06-24 21:55:10 +000098 // CHECK-NEXT: [[T1:%.*]] = getelementptr inbounds [5 x double]* [[P]], i32 [[T0]]
99 // CHECK-NEXT: [[T2:%.*]] = getelementptr inbounds [5 x double]* [[T1]], i32 2
100 // CHECK-NEXT: [[T3:%.*]] = getelementptr inbounds [5 x double]* [[T2]], i32 0, i32 3
101 // CHECK-NEXT: [[T4:%.*]] = load double* [[T3]]
102 // CHECK-NEXT: ret double [[T4]]
Argyrios Kyrtzidis981b6fd2010-11-09 01:30:48 +0000103 return p[1][2][3];
104}
John McCall913dab22011-06-25 01:32:37 +0000105
106int test4(unsigned n, char (*p)[n][n+1][6]) {
107 // CHECK: define i32 @test4(
108 // CHECK: [[N:%.*]] = alloca i32, align 4
109 // CHECK-NEXT: [[P:%.*]] = alloca [6 x i8]*, align 4
110 // CHECK-NEXT: [[P2:%.*]] = alloca [6 x i8]*, align 4
111 // CHECK-NEXT: store i32
112 // CHECK-NEXT: store [6 x i8]*
113
114 // VLA captures.
115 // CHECK-NEXT: [[DIM0:%.*]] = load i32* [[N]], align 4
116 // CHECK-NEXT: [[T0:%.*]] = load i32* [[N]], align 4
117 // CHECK-NEXT: [[DIM1:%.*]] = add i32 [[T0]], 1
118
John McCall913dab22011-06-25 01:32:37 +0000119 // CHECK-NEXT: [[T0:%.*]] = load [6 x i8]** [[P]], align 4
120 // CHECK-NEXT: [[T1:%.*]] = load i32* [[N]], align 4
121 // CHECK-NEXT: [[T2:%.*]] = udiv i32 [[T1]], 2
122 // CHECK-NEXT: [[T3:%.*]] = mul nuw i32 [[DIM0]], [[DIM1]]
123 // CHECK-NEXT: [[T4:%.*]] = mul nsw i32 [[T2]], [[T3]]
124 // CHECK-NEXT: [[T5:%.*]] = getelementptr inbounds [6 x i8]* [[T0]], i32 [[T4]]
125 // CHECK-NEXT: [[T6:%.*]] = load i32* [[N]], align 4
126 // CHECK-NEXT: [[T7:%.*]] = udiv i32 [[T6]], 4
127 // CHECK-NEXT: [[T8:%.*]] = sub i32 0, [[T7]]
128 // CHECK-NEXT: [[T9:%.*]] = mul nuw i32 [[DIM0]], [[DIM1]]
129 // CHECK-NEXT: [[T10:%.*]] = mul nsw i32 [[T8]], [[T9]]
130 // CHECK-NEXT: [[T11:%.*]] = getelementptr inbounds [6 x i8]* [[T5]], i32 [[T10]]
131 // CHECK-NEXT: store [6 x i8]* [[T11]], [6 x i8]** [[P2]], align 4
132 __typeof(p) p2 = (p + n/2) - n/4;
133
134 // CHECK-NEXT: [[T0:%.*]] = load [6 x i8]** [[P2]], align 4
135 // CHECK-NEXT: [[T1:%.*]] = load [6 x i8]** [[P]], align 4
136 // CHECK-NEXT: [[T2:%.*]] = ptrtoint [6 x i8]* [[T0]] to i32
137 // CHECK-NEXT: [[T3:%.*]] = ptrtoint [6 x i8]* [[T1]] to i32
138 // CHECK-NEXT: [[T4:%.*]] = sub i32 [[T2]], [[T3]]
139 // CHECK-NEXT: [[T5:%.*]] = mul nuw i32 [[DIM0]], [[DIM1]]
140 // CHECK-NEXT: [[T6:%.*]] = mul nuw i32 6, [[T5]]
141 // CHECK-NEXT: [[T7:%.*]] = sdiv exact i32 [[T4]], [[T6]]
142 // CHECK-NEXT: ret i32 [[T7]]
143 return p2 - p;
144}