dawids/lang-bootstrap
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

newer version of tcc almost working

Browse source
This commit is contained in:
pommicket 2022-02-18 12:36:57 -05:00
parent c42c5d94b8
commit 826d1afd58
442 changed files with 90400 additions and 24506 deletions
Download patch file Download diff file Expand all files Collapse all files

116
05/tcc-0.9.27/tests/tests2/79_vla_continue.c Normal file
View file

@ -0,0 +1,116 @@
#include <stdio.h>
int f(void)
{
return 5;
}
void test1()
{
int count = 10;
void *addr[10];
for(;count--;) {
int a[f()];
addr[count] = a;
continue;
}
if(addr[9] == addr[0]) {
printf("OK\n");
} else {
printf("NOT OK\n");
}
}
void test2()
{
int count = 10;
void *addr[count];
for(;count--;) {
int a[f()];
addr[count] = a;
continue;
}
if(addr[9] == addr[0]) {
printf("OK\n");
} else {
printf("NOT OK\n");
}
}
void test3()
{
int count = 10;
void *addr[count];
while(count--) {
int a[f()];
addr[count] = a;
continue;
}
if(addr[9] == addr[0]) {
printf("OK\n");
} else {
printf("NOT OK\n");
}
}
void test4()
{
int count = 10;
void *addr[count];
do {
int a[f()];
addr[--count] = a;
continue;
} while (count);
if(addr[9] == addr[0]) {
printf("OK\n");
} else {
printf("NOT OK\n");
}
}
void test5()
{
int count = 10;
int a[f()];
int c[f()];
c[0] = 42;
for(;count--;) {
int b[f()];
int i;
for (i=0; i<f(); i++) {
b[i] = count;
}
}
if (c[0] == 42) {
printf("OK\n");
} else {
printf("NOT OK\n");
}
}
int main(void)
{
test1();
test2();
test3();
test4();
test5();
return 0;
}