void
f3()
{
void* lab;
l1: f9();
l2: __attribute__ ((unused)) ; f9();
lab = i ? &&l1 : &&l2;
goto *lab;
}
void
f1()
{
if (i)
return;
l1: f9(); // { dg-warning "not used" }
l3: ; f9(); // { dg-warning "not used" }
l4: __attribute__ ((unused)) ; f9();
}
void f9(H h) {
// CHECK: call void @_ZN1HC1Ev
// CHECK: call void @_Z2f91H
// CHECK: call void @_ZN1HD1Ev
f9(H());
// CHECK: call void @_ZN1HC1ERKS_
// CHECK: call void @_Z2f91H
// CHECK: call void @_ZN1HD1Ev
f9(h);
}
int main()
{
int xx = 6;
int aa[5] = {1, 2, 3, 4, 5};
int a = 0x0101;
int b = 0x0202;
int c;
int *p = (int *)(&aa+1);
c = a&(~b);
c = c|b;
char s[10] = "abcd";
char * B = "154546748764";
xx += (xx++);
printf("%d\n", xx);
xx = 6;
xx += (++xx);
printf("%d\n", xx);
xx = 6;
// (xx++) += xx;
// printf("%d\n", xx);
//printf("%d\n", xx);
printf("%d\n", sizeof(B));
printf("%d\n", sizeof(s));
printf("%x, %d\n", c,c);
printf("%d\n", Z*Z*Z);
printf("%d,%d\n", *(aa+1), *(p-1));
f9();
f10();
f14();
//f14ex();
f17();
return 0;
}
int main(void) {
f0();
f1();
f2();
f3();
f4();
f5();
f6();
f7();
f8();
f9();
f10();
f11();
f12();
f13();
f14();
f15();
f16();
f17();
f18();
f19();
f20();
f21();
f22();
f23();
f24();
f25();
f26();
f27();
f28();
f29();
return 0;
}
int main(void){
node n;
n.i = 'r';
f1();
f2();
f3();
f4();
f5();
f6();
f7();
f8();
f9();
f10();
f11();
f12();
f13();
f14();
f15();
putchar(f16());
f17('g');
putchar(f18(&n)->i);
putchar(f19(en1) + 'a');
putchar(f20(en4) + 'a');
putchar(f21(en4) + 'a');
return 0;
}
static void
avx512f_test (void)
{
int i;
for (i = 0; i < N; i++)
{
asm ("");
f[i] = -256.0f + i;
d[i] = -258.0 + i;
k[i] = (i * 731) & (N - 1);
q[i] = (i * 657) & (N - 1);
t[i] = (i * 657) & (N - 1);
l[i] = &f[(i * 239) & (N - 1)];
n[i] = &d[(i * 271) & (N - 1)];
r[i] = &t[(i * 323) & (N - 1)];
s[i] = &k[(i * 565) & (N - 1)];
m[i] = &s[(i * 13) & (N - 1)];
o[i] = &r[(i * 19) & (N - 1)];
}
if (f1 () != 136448.0f || f2 (f) != 136448.0f || f3 () != 130304.0)
abort ();
if (f4 () != 261376 || f5 () != 135424.0 || f6 (d) != 135424.0)
abort ();
if (f7 () != 129280.0 || f8 () != 259840L || f9 () != 130816.0f)
abort ();
if (f10 (f) != 130816.0f || f11 () != 129792.0 || f12 (d) != 129792.0)
abort ();
}
void cs()
{
int ch;
int f1();
int f2();
int f3();
int f4();
int f5();
int f6();
int f7();
int f8();
int f9();
swindex2:printf("-------------------\n");
printf("--which function?--\n");
printf("-------------------\nf");
scanf_s("%d", &ch);
system("CLS");
printf("-----------------------------------------------\n");
//ch = ch - 48;
switch (ch)
{
case 1:f1(); break;
case 2:f2(); break;
case 3:f3(); break;
case 4:f4(); break;
case 5:f5(); break;
case 6:f6(); break;
case 7:f7(); break;
case 8:f8(); break;
case 9:f9(); break;
default:system("CLS"); printf("error\n"); goto swindex2;
}
printf("-----------------------------------------------\nf%dÔËÐнáÊø\n1 for again,2 for exit\n", ch);
}
int main(void) {
f0();
f1();
f2();
f3();
f4();
f5();
f6();
f7();
f8();
f9();
f10();
f11();
f12();
f13();
f14();
f15();
f16();
f17();
f18();
f19();
return 0;
}
int main(void) {
f0();
f1();
f2();
f3();
f4();
f5();
f6();
f7();
f8();
f9();
f10();
f11();
f12();
f13();
f14();
f15();
f16();
f17();
f18();
f19();
f20();
f21();
f22();
f23();
f24();
f25();
f26();
f27();
f28();
f29();
f30();
f31();
f32();
f33();
f34();
f35();
f36();
f37();
f38();
f39();
f40();
f41();
f42();
f43();
f44();
f45();
f46();
f47();
f48();
f49();
f50();
f51();
f52();
return 0;
}
void show_count( unsigned num )
{
float wait;
fputs( "\r\t\t\t\t\t\t\twait ", stdout );
printf( "%4.1f seconds \r ", (float)(num * 15.0) );
num *= 5;
num %= 20;
++num;
while( num-- ) {
printf( "\r ^^^^ \r" );
for( wait = SIZE; wait > 0.0; wait = wait - 10 ) {
f0(); f1(); f2(); f3(); f4(); f5(); f6(); f7(); f8(); f9();
f0(); f1(); f2(); f3(); f4(); f5(); f6(); f7(); f8(); f9();
f0(); f1(); f2(); f3(); f4(); f5(); f6(); f7(); f8(); f9();
continue;
}
printf( "\r vvvv \r" );
}
}
void ControlPresencial::MonitorizaFicheros(QString str)
{
// ControlPresencial* mc = new ControlPresencial;
qDebug() << "Monitoriza ficheros " << str;
QFileSystemWatcher *watcher = new QFileSystemWatcher(this);
if(str.contains("inicio")){
QFile f("/home/pi/Desktop/RFID-US/errorconexion.log");
f.open(QIODevice::ReadWrite);
QFile f2("/home/pi/Desktop/RFID-US/erroraulas.log");
f2.open(QIODevice::ReadWrite);
QFile f3("/home/pi/Desktop/RFID-US/errorlector.log");
f3.open(QIODevice::ReadWrite);
QFile f4("/home/pi/Desktop/RFID-US/usuarioregistrado.log");
f4.open(QIODevice::ReadWrite);
QFile f5("/home/pi/Desktop/RFID-US/registro.xml");
f5.open(QIODevice::ReadWrite);
QFile f6("/home/pi/Desktop/RFID-US/oklector.log");
f6.open(QIODevice::ReadWrite);
QFile f7("/home/pi/Desktop/RFID-US/okconexion.log");
f7.open(QIODevice::ReadWrite);
QFile f8("/home/pi/Desktop/RFID-US/errorconexionregistro.log");
f8.open(QIODevice::ReadWrite);
QFile f9("/home/pi/Desktop/RFID-US/errorrecibido.log");
f9.open(QIODevice::ReadWrite);
QFile f10("/home/pi/Desktop/RFID-US/errordom2.log");
f10.open(QIODevice::ReadWrite);
QFile f11("/home/pi/Desktop/RFID-US/erroreneldom.log");
f11.open(QIODevice::ReadWrite);
QFile f12("/home/pi/Desktop/RFID-US/errorbbdd.log");
f12.open(QIODevice::ReadWrite);
QFile f13("/home/pi/Desktop/RFID-US/reintentarlector.log");
f13.open(QIODevice::ReadWrite);
QObject::connect(watcher, SIGNAL(fileChanged(QString)),this, SLOT(showModified(QString)));
watcher->addPath("/home/pi/Desktop/RFID-US/errorconexion.log");
watcher->addPath("/home/pi/Desktop/RFID-US/erroraulas.log");
watcher->addPath("/home/pi/Desktop/RFID-US/errorlector.log");
watcher->addPath("/home/pi/Desktop/RFID-US/usuarioregistrado.log");
watcher->addPath("/home/pi/Desktop/RFID-US/registro.xml");
watcher->addPath("/home/pi/Desktop/RFID-US/oklector.log");
watcher->addPath("/home/pi/Desktop/RFID-US/okconexion.log");
watcher->addPath("/home/pi/Desktop/RFID-US/errorconexionregistro.log");
watcher->addPath("/home/pi/Desktop/RFID-US/errorrecibido.log");
watcher->addPath("/home/pi/Desktop/RFID-US/errordom2.log");
watcher->addPath("/home/pi/Desktop/RFID-US/erroreneldom.log");
watcher->addPath("/home/pi/Desktop/RFID-US/errorbbdd.log");
watcher->addPath("/home/pi/Desktop/RFID-US/reintentarlector.log");
} else {
QFile f(str);
f.open(QIODevice::ReadWrite);
qDebug() << "Creamos el fichero " << str;
watcher->addPath(str);
}
}
int main()
{
f1();
f2();
f3();
f4();
f5();
f6();
f7();
f8();
f9();
return 0;
}
double benchmarkEvaluation(double *x) {
evaluations++;
switch (instance) {
case 1:
return f1(x);
case 2:
return f2(x);
case 3:
return f3(x);
case 4:
return f4(x);
case 5:
return f5(x);
case 6:
return f6(x);
case 7:
return f7(x);
case 8:
return f8(x);
case 9:
return f9(x);
case 10:
return f10(x);
case 11:
return f11(x);
case 12:
return f12(x);
case 13:
return f13(x);
case 14:
return f14(x);
case 15:
return f15(x);
case 16:
return f16(x);
case 17:
return f17(x);
case 18:
return f18(x);
case 19:
return f19(x);
case 20:
return f20(x);
default:
printf("Benchmark instance %d not found.\n", instance);
exit(EXIT_FAILURE);
}
}
int main(void) {
f0();
f1();
f2();
f3();
f4();
f5();
f6();
f7();
f8();
f9();
f10();
return 0;
}
int
main ()
{
if (__SCHAR_MAX__ != 127 || sizeof (int) != 4)
return 0;
if (f0 (0xff, 0xff) != 0xfe
|| f1 (0, 1) != 0x2ff
|| f2 (-2, 1) != -4
|| f3 (-2, 1) != 0xf8
|| f4 (-2, 1) != 0x78
|| f5 (0xff, 0xff) != 0xfe
|| f6 (0, 1) != 0x2ff
|| f7 (-2, 1) != -4
|| f8 (-2, 1) != 0xf8
|| f9 (-2, 1) != 0x78)
__builtin_abort ();
return 0;
}
int main(void) {
f0();
f1();
f2();
f3();
f4();
f5();
f6();
f7();
f8();
f9();
f10();
f11();
f12();
f13();
f14();
f15();
f16();
f17();
f18();
f19();
f20();
f21();
f22();
f23();
f24();
f25();
f26();
f27();
f28();
f29();
f30();
f31();
f32();
f33();
f34();
f35();
f36();
f37();
f38();
f39();
f40();
f41();
f42();
f43();
f44();
f45();
f46();
f47();
f48();
f49();
f50();
f51();
f52();
f53();
f54();
f55();
f56();
f57();
f58();
f59();
f60();
f61();
f62();
f63();
f64();
f65();
f66();
f67();
f68();
f69();
f70();
f71();
f72();
f73();
f74();
f75();
f76();
f77();
f78();
f79();
f80();
f81();
f82();
f83();
f84();
f85();
f86();
f87();
f88();
f89();
f90();
f91();
f92();
f93();
f94();
f95();
f96();
f97();
f98();
f99();
f100();
f101();
f102();
f103();
f104();
f105();
f106();
f107();
f108();
f109();
f110();
f111();
f112();
f113();
f114();
f115();
f116();
f117();
f118();
f119();
f120();
f121();
f122();
f123();
f124();
f125();
f126();
f127();
f128();
f129();
f130();
f131();
f132();
f133();
f134();
f135();
f136();
f137();
f138();
f139();
f140();
f141();
f142();
f143();
f144();
f145();
f146();
f147();
f148();
f149();
f150();
f151();
f152();
f153();
f154();
f155();
f156();
f157();
f158();
f159();
f160();
f161();
f162();
f163();
f164();
f165();
f166();
f167();
f168();
f169();
f170();
f171();
f172();
f173();
f174();
f175();
f176();
f177();
f178();
f179();
f180();
f181();
f182();
f183();
f184();
f185();
f186();
f187();
f188();
f189();
f190();
f191();
f192();
f193();
f194();
f195();
f196();
f197();
f198();
f199();
return 0;
}
double calculo(GtkButton *button, gpointer data)
{
GtkBuilder *builder = (GtkBuilder*) data;
GtkEntry *entry1 = (GtkEntry*)gtk_builder_get_object(builder, "txtColiformes");
GtkEntry *entry2 = (GtkEntry*)gtk_builder_get_object(builder, "txtPh");
GtkEntry *entry3 = (GtkEntry*)gtk_builder_get_object(builder, "txtDbo");
GtkEntry *entry4 = (GtkEntry*)gtk_builder_get_object(builder, "txtNitrogenio");
GtkEntry *entry5 = (GtkEntry*)gtk_builder_get_object(builder, "txtFOsforo");
GtkEntry *entry6 = (GtkEntry*)gtk_builder_get_object(builder, "txtTemperatura");
GtkEntry *entry7 = (GtkEntry*)gtk_builder_get_object(builder, "txtTurbidez");
GtkEntry *entry8 = (GtkEntry*)gtk_builder_get_object(builder, "txtOxigenio");
GtkEntry *entry9 = (GtkEntry*)gtk_builder_get_object(builder, "txtSolidos");
GtkEntry *entry10 = (GtkEntry*)gtk_builder_get_object(builder, "txtIqa");
const char* valor_da_entry1 = gtk_entry_get_text(entry1);
const char* valor_da_entry2 = gtk_entry_get_text(entry2);
const char* valor_da_entry3 = gtk_entry_get_text(entry3);
const char* valor_da_entry4 = gtk_entry_get_text(entry4);
const char* valor_da_entry5 = gtk_entry_get_text(entry5);
const char* valor_da_entry6 = gtk_entry_get_text(entry6);
const char* valor_da_entry7 = gtk_entry_get_text(entry7);
const char* valor_da_entry8 = gtk_entry_get_text(entry8);
const char* valor_da_entry9 = gtk_entry_get_text(entry9);
// Entry do resultado
cf = atof(valor_da_entry1);
ph = atof(valor_da_entry2);
dbo = atof(valor_da_entry3);
nt = atof(valor_da_entry4);
ft = atof(valor_da_entry5);
temp = atof(valor_da_entry6);
tu = atof(valor_da_entry7);
st = atof(valor_da_entry8);
ox = atof(valor_da_entry9);
fun[0] = f1(ox);
fun[1] = f2(cf);
fun[2] = f3(ph);
fun[3] = f4(dbo);
fun[4] = f5(temp);
fun[5] = f6(nt);
fun[6] = f7(ft);
fun[7] = f8(tu);
fun[8] = f9(st);
res[0] = pow(fun[0], 0.17);
res[1] = pow(fun[1], 0.15);
res[2] = pow(fun[2], 0.12);
res[3] = pow(fun[3], 0.10);
res[4] = pow(fun[4], 0.10);
res[5] = pow(fun[5], 0.10);
res[6] = pow(fun[6], 0.10);
res[7] = pow(fun[7], 0.08);
res[8] = pow(fun[8], 0.08);
total = res[0] * res[1] * res[2] * res[3] * res[4] * res[5] * res[6] * res[7] * res[8];
char resultado[10];
sprintf(resultado, "%.0lf", total);
GtkLabel *label15 = (GtkLabel*)gtk_builder_get_object(builder, "label15");
GtkLabel *label3 = (GtkLabel*)gtk_builder_get_object(builder, "label3");
gtk_label_set_text(label3, resultado);
//char O[6] = "Otima", B[4] = "Boa", A[10] ="Aceitavel", R[5] ="Ruim", P[8]="Pessima";
if(total > 80 && total <= 100){
printf("KG1\n");
gtk_label_set_text(label15, "Otima");
}
else if(total >50 && total <= 80){
printf("KG2\n");
gtk_label_set_text(label15, "Boa");
}
else if(total > 36 && total <= 50){
printf("KG3\n");
gtk_label_set_text(label15, "Aceitavel");
}
else if(total > 20 && total <= 36){
printf("KG4\n");
gtk_label_set_text(label15, "Razoalvel");
}
else if(total <= 20){
printf("KG5\n");
gtk_label_set_text(label15, "Pessima");
}
}
/* Call functions through pointers and and check against expected results. */
void
test (void)
{
CHECK_VOID_RESULT (v0 (), 1.0);
CHECK_VOID_RESULT (v1 (1.0), 2.0);
CHECK_VOID_RESULT (v5 (5.0, 6.0), 12.0);
CHECK_VOID_RESULT (v9 (9.0, 10.0), 20.0);
CHECK_VOID_RESULT (v2 (2.0), 3.0);
CHECK_VOID_RESULT (v6 (6.0, 7.0), 14.0);
CHECK_VOID_RESULT (v10 (10.0, 11.0), 22.0);
CHECK_RESULT (f0 (), 1.0);
CHECK_RESULT (f1 (1.0), 2.0);
CHECK_RESULT (f5 (5.0, 6.0), 12.0);
CHECK_RESULT (f9 (9.0, 10.0), 20.0);
CHECK_RESULT (f2 (2.0), 3.0);
CHECK_RESULT (f6 (6.0, 7.0), 14.0);
CHECK_RESULT (f10 (10.0, 11.0), 22.0);
CHECK_RESULT (d0 (), 1.0);
CHECK_RESULT (d1 (1.0), 2.0);
CHECK_RESULT (d5 (5.0, 6.0), 12.0);
CHECK_RESULT (d9 (9.0, 10.0), 20.0);
CHECK_RESULT (d2 (2.0), 3.0);
CHECK_RESULT (d6 (6.0, 7.0), 14.0);
CHECK_RESULT (d10 (10.0, 11.0), 22.0);
CHECK_RESULT (cf0 (), 1.0 + 0.0i);
CHECK_RESULT (cf1 (1.0), 2.0 + 1.0i);
CHECK_RESULT (cf5 (5.0, 6.0), 12.0 + 5.0i);
CHECK_RESULT (cf9 (9.0, 10.0), 20.0 + 9.0i);
CHECK_RESULT (cf2 (2.0), 3.0 + 2.0i);
CHECK_RESULT (cf6 (6.0, 7.0), 14.0 + 6.0i);
CHECK_RESULT (cf10 (10.0, 11.0), 22.0 + 10.0i);
CHECK_RESULT (cd0 (), 1.0 + 0.0i);
CHECK_RESULT (cd1 (1.0), 2.0 + 1.0i);
CHECK_RESULT (cd5 (5.0, 6.0), 12.0 + 5.0i);
CHECK_RESULT (cd9 (9.0, 10.0), 20.0 + 9.0i);
CHECK_RESULT (cd2 (2.0), 3.0 + 2.0i);
CHECK_RESULT (cd6 (6.0, 7.0), 14.0 + 6.0i);
CHECK_RESULT (cd10 (10.0, 11.0), 22.0 + 10.0i);
CHECK_VOID_RESULT ((*pv0) (), 1.0);
CHECK_VOID_RESULT ((*pv1) (1.0), 2.0);
CHECK_VOID_RESULT ((*pv5) (5.0, 6.0), 12.0);
CHECK_VOID_RESULT ((*pv9) (9.0, 10.0), 20.0);
CHECK_VOID_RESULT ((*pv2) (2.0), 3.0);
CHECK_VOID_RESULT ((*pv6) (6.0, 7.0), 14.0);
CHECK_VOID_RESULT ((*pv10) (10.0, 11.0), 22.0);
CHECK_RESULT ((*pf0) (), 1.0);
CHECK_RESULT ((*pf1) (1.0), 2.0);
CHECK_RESULT ((*pf5) (5.0, 6.0), 12.0);
CHECK_RESULT ((*pf9) (9.0, 10.0), 20.0);
CHECK_RESULT ((*pf2) (2.0), 3.0);
CHECK_RESULT ((*pf6) (6.0, 7.0), 14.0);
CHECK_RESULT ((*pf10) (10.0, 11.0), 22.0);
CHECK_RESULT ((*pd0) (), 1.0);
CHECK_RESULT ((*pd1) (1.0), 2.0);
CHECK_RESULT ((*pd5) (5.0, 6.0), 12.0);
CHECK_RESULT ((*pd9) (9.0, 10.0), 20.0);
CHECK_RESULT ((*pd2) (2.0), 3.0);
CHECK_RESULT ((*pd6) (6.0, 7.0), 14.0);
CHECK_RESULT ((*pd10) (10.0, 11.0), 22.0);
CHECK_RESULT ((*pcf0) (), 1.0 + 0.0i);
CHECK_RESULT ((*pcf1) (1.0), 2.0 + 1.0i);
CHECK_RESULT ((*pcf5) (5.0, 6.0), 12.0 + 5.0i);
CHECK_RESULT ((*pcf9) (9.0, 10.0), 20.0 + 9.0i);
CHECK_RESULT ((*pcf2) (2.0), 3.0 + 2.0i);
CHECK_RESULT ((*pcf6) (6.0, 7.0), 14.0 + 6.0i);
CHECK_RESULT ((*pcf10) (10.0, 11.0), 22.0 + 10.0i);
CHECK_RESULT ((*pcd0) (), 1.0 + 0.0i);
CHECK_RESULT ((*pcd1) (1.0), 2.0 + 1.0i);
CHECK_RESULT ((*pcd5) (5.0, 6.0), 12.0 + 5.0i);
CHECK_RESULT ((*pcd9) (9.0, 10.0), 20.0 + 9.0i);
CHECK_RESULT ((*pcd2) (2.0), 3.0 + 2.0i);
CHECK_RESULT ((*pcd6) (6.0, 7.0), 14.0 + 6.0i);
CHECK_RESULT ((*pcd10) (10.0, 11.0), 22.0 + 10.0i);
}
int f8 (void)
{
return f9 () - 1;
}
void test_finite_product_relation(smt_params fparams, params_ref& params) {
ast_manager m;
register_engine re;
context ctx(m, re, fparams);
ctx.updt_params(params);
dl_decl_util dl_util(m);
relation_manager & rmgr = ctx.get_rel_context()->get_rmanager();
relation_plugin & rel_plugin = *rmgr.get_relation_plugin(params.get_sym("default_relation", symbol("sparse")));
ENSURE(&rel_plugin);
finite_product_relation_plugin plg(rel_plugin, rmgr);
sort_ref byte_srt_ref(dl_util.mk_sort(symbol("BYTE"), 256), m);
relation_sort byte_srt = byte_srt_ref;
relation_signature sig2;
sig2.push_back(byte_srt);
sig2.push_back(byte_srt);
relation_signature sig3(sig2);
sig3.push_back(byte_srt);
relation_signature sig4(sig3);
sig4.push_back(byte_srt);
app_ref seven_ref(dl_util.mk_numeral(7, byte_srt), m);
app_ref nine_ref(dl_util.mk_numeral(9, byte_srt), m);
relation_element seven = seven_ref;
relation_element nine = nine_ref;
relation_fact f7(m);
f7.push_back(seven);
relation_fact f9(m);
f9.push_back(nine);
relation_fact f77(f7);
f77.push_back(seven);
relation_fact f79(f7);
f79.push_back(nine);
relation_fact f97(f9);
f97.push_back(seven);
relation_fact f99(f9);
f99.push_back(nine);
relation_fact f779(f77);
f779.push_back(nine);
relation_fact f799(f79);
f799.push_back(nine);
relation_fact f977(f97);
f977.push_back(seven);
relation_fact f7797(f779);
f7797.push_back(seven);
relation_fact f7997(f799);
f7997.push_back(seven);
bool table_cols2[] = { true, false };
bool table_cols3[] = { true, false, false };
bool table_cols4[] = { true, true, false, false };
scoped_rel<relation_base> r1 = plg.mk_empty(sig2, table_cols2);
scoped_rel<relation_base> r2 = r1->clone();
scoped_rel<relation_base> r3 = r2->clone();
ENSURE(!r1->contains_fact(f77));
r1->add_fact(f77);
ENSURE(r1->contains_fact(f77));
r2->add_fact(f79);
r3->add_fact(f99);
r2->display( std::cout << "r2 0\n");
scoped_rel<relation_base> r4 = r2->clone();
r2->display( std::cout << "r2 1\n");
r4->display( std::cout << "r4 0\n");
ENSURE(!r4->contains_fact(f77));
ENSURE(r4->contains_fact(f79));
r4->add_fact(f77);
r4->display( std::cout << "r4 1\n");
ENSURE(r4->contains_fact(f77));
ENSURE(r4->contains_fact(f79));
r4->add_fact(f99);
r4->display( std::cout << "r4 2\n");
ENSURE(r4->contains_fact(f99));
std::cout << "------ testing union ------\n";
r2->display( std::cout << "r2\n");
scoped_ptr<relation_union_fn> union_op = rmgr.mk_union_fn(*r1, *r2, r3.get());
ENSURE(union_op);
(*union_op)(*r1, *r2, r3.get());
r1->display( std::cout << "r1\n");
r2->display( std::cout << "r2\n");
r3->display( std::cout << "r3\n");
ENSURE(r1->contains_fact(f77));
ENSURE(r1->contains_fact(f79));
ENSURE(!r1->contains_fact(f99));
ENSURE(!r3->contains_fact(f77));
ENSURE(r3->contains_fact(f79));
ENSURE(r3->contains_fact(f99));
std::cout << "------ testing join ------\n";
r1->reset();
r1->add_fact(f77);
r1->add_fact(f79);
r1->add_fact(f97);
r2->reset();
r2->add_fact(f97);
r2->add_fact(f99);
unsigned col0[] = { 0 };
unsigned col1[] = { 1 };
scoped_ptr<relation_join_fn> join_tt = rmgr.mk_join_fn(*r1, *r2, 1, col0, col0);
scoped_ptr<relation_join_fn> join_tr = rmgr.mk_join_fn(*r1, *r2, 1, col0, col1);
scoped_ptr<relation_join_fn> join_rr = rmgr.mk_join_fn(*r1, *r2, 1, col1, col1);
r1->display( std::cout << "r1\n");
r2->display( std::cout << "r2\n");
scoped_rel<relation_base> jr_tt = (*join_tt)(*r1, *r2);
scoped_rel<relation_base> jr_tr = (*join_tr)(*r1, *r2);
scoped_rel<relation_base> jr_rr = (*join_rr)(*r1, *r2);
jr_tt->display( std::cout << "tt\n");
jr_tr->display( std::cout << "tr\n");
jr_rr->display( std::cout << "rr\n");
ENSURE(!jr_tt->contains_fact(f7797));
ENSURE(jr_tr->contains_fact(f7797));
ENSURE(jr_rr->contains_fact(f7797));
std::cout << "------ testing project ------\n";
scoped_rel<relation_base> r31 = plg.mk_empty(sig3, table_cols3);
r31->add_fact(f779);
r31->add_fact(f977);
r31->add_fact(f799);
unsigned rem_1_rel[] = { 1 };
unsigned rem_2_rel[] = { 1, 2 };
unsigned rem_1_table[] = { 0 };
scoped_ptr<relation_transformer_fn> proj_1r = rmgr.mk_project_fn(*r31, 1, rem_1_rel);
scoped_ptr<relation_transformer_fn> proj_2r = rmgr.mk_project_fn(*r31, 2, rem_2_rel);
scoped_ptr<relation_transformer_fn> proj_1t = rmgr.mk_project_fn(*r31, 1, rem_1_table);
scoped_rel<relation_base> sr_1r = (*proj_1r)(*r31);
scoped_rel<relation_base> sr_2r = (*proj_2r)(*r31);
scoped_rel<relation_base> sr_1t = (*proj_1t)(*r31);
ENSURE(sr_1r->contains_fact(f79));
ENSURE(sr_1r->contains_fact(f97));
ENSURE(!sr_1r->contains_fact(f77));
ENSURE(sr_2r->contains_fact(f7));
ENSURE(sr_2r->contains_fact(f9));
ENSURE(sr_1t->contains_fact(f79));
ENSURE(!sr_1t->contains_fact(f97));
ENSURE(sr_1t->contains_fact(f77));
ENSURE(sr_1t->contains_fact(f99));
std::cout << "------ testing filter_interpreted ------\n";
scoped_rel<relation_base> r41 = plg.mk_empty(sig4, table_cols4);
r41->add_fact(f7797);
r41->add_fact(f7997);
app_ref cond(m.mk_and(
m.mk_not(m.mk_eq(m.mk_var(1,byte_srt), m.mk_var(2,byte_srt))), //#1!=#2
m.mk_not(m.mk_eq(m.mk_var(3,byte_srt), m.mk_var(2,byte_srt))) //#3!=#2
), m);
scoped_ptr<relation_mutator_fn> i_filter = rmgr.mk_filter_interpreted_fn(*r41, cond);
(*i_filter)(*r41);
ENSURE(r41->contains_fact(f7797));
ENSURE(!r41->contains_fact(f7997));
std::cout << "------ testing filter_by_negation ------\n";
r31->reset();
r31->add_fact(f779);
r31->add_fact(f977);
r31->add_fact(f799);
r1->reset();
r1->add_fact(f77);
r1->add_fact(f79);
unsigned nf_r31_cols[] = {1, 0, 1};
unsigned nf_r1_cols[] = {0, 0, 1};
scoped_ptr<relation_intersection_filter_fn> neg_filter = rmgr.mk_filter_by_negation_fn(*r31, *r1, 3,
nf_r31_cols, nf_r1_cols);
(*neg_filter)(*r31, *r1);
ENSURE(!r31->contains_fact(f779));
ENSURE(r31->contains_fact(f977));
ENSURE(r31->contains_fact(f799));
}
int
main ()
{
int i;
check_vect ();
for (i = 0; i < N; i++)
{
switch (i % 9)
{
case 0: asm (""); a[i] = - i - 1; b[i] = i + 1; break;
case 1: a[i] = 0; b[i] = 0; break;
case 2: a[i] = i + 1; b[i] = - i - 1; break;
case 3: a[i] = i; b[i] = i + 7; break;
case 4: a[i] = i; b[i] = i; break;
case 5: a[i] = i + 16; b[i] = i + 3; break;
case 6: a[i] = - i - 5; b[i] = - i; break;
case 7: a[i] = - i; b[i] = - i; break;
case 8: a[i] = - i; b[i] = - i - 7; break;
}
}
for (i = 0; i < N; i++)
{
switch ((i / 9) % 3)
{
case 0: c[i] = a[i / 9]; d[i] = b[i / 9]; break;
case 1: c[i] = a[i / 9 + 3]; d[i] = b[i / 9 + 3]; break;
case 2: c[i] = a[i / 9 + 6]; d[i] = b[i / 9 + 6]; break;
}
}
f1 ();
for (i = 0; i < N; i++)
if (j[i] != ((i % 3) == 0 && ((i / 9) % 3) == 0))
abort ();
__builtin_memset (j, -6, sizeof (j));
f2 ();
for (i = 0; i < N; i++)
if (j[i] != ((i % 3) == 0 && ((i / 9) % 3) == 0))
abort ();
__builtin_memset (j, -6, sizeof (j));
f3 ();
for (i = 0; i < N; i++)
if (j[i] != ((i % 3) == 0 && ((i / 9) % 3) == 0))
abort ();
__builtin_memset (j, -6, sizeof (j));
f4 ();
for (i = 0; i < N; i++)
if (k[i] != ((i % 3) == 0 && ((i / 9) % 3) == 0))
abort ();
__builtin_memset (k, -6, sizeof (k));
f5 ();
for (i = 0; i < N; i++)
if (k[i] != ((i % 3) == 0 && ((i / 9) % 3) == 0))
abort ();
__builtin_memset (k, -6, sizeof (k));
f6 ();
for (i = 0; i < N; i++)
if (j[i] != ((i % 3) == 0 || ((i / 9) % 3) == 0))
abort ();
__builtin_memset (j, -6, sizeof (j));
f7 ();
for (i = 0; i < N; i++)
if (j[i] != ((i % 3) == 0 || ((i / 9) % 3) == 0))
abort ();
__builtin_memset (j, -6, sizeof (j));
f8 ();
for (i = 0; i < N; i++)
if (j[i] != ((i % 3) == 0 || ((i / 9) % 3) == 0))
abort ();
__builtin_memset (j, -6, sizeof (j));
f9 ();
for (i = 0; i < N; i++)
if (k[i] != ((i % 3) == 0 || ((i / 9) % 3) == 0))
abort ();
__builtin_memset (k, -6, sizeof (k));
f10 ();
for (i = 0; i < N; i++)
if (k[i] != ((i % 3) == 0 || ((i / 9) % 3) == 0))
abort ();
__builtin_memset (k, -6, sizeof (k));
return 0;
}
static inline void kcall(forth_context_type *fc) // arg1, arg2, arg3...argN, N, adr -- retval
{
size_t N;
size_t adr;
size_t args[KARGS];
size_t ret=0;
int i;
kall0 f0;
kall1 f1;
kall2 f2;
kall3 f3;
kall4 f4;
kall5 f5;
kall6 f6;
kall7 f7;
kall8 f8;
kall9 f9;
kall10 f10;
kall11 f11;
kall12 f12;
kall13 f13;
kall14 f14;
kall15 f15;
kall16 f16;
adr=pop(fc);
N=pop(fc);
for(i=1;i<=N;i++)
{
args[N-i]=pop(fc);
}
switch(N)
{
case 0: f0=(kall0)adr;
ret=f0();
break;
case 1: f1=(kall1)adr;
ret=f1(args[0]);
break;
case 2: f2=(kall2)adr;
ret=f2(args[0],args[1]);
break;
case 3: f3=(kall3)adr;
ret=f3(args[0],args[1],args[2]);
break;
case 4: f4=(kall4)adr;
ret=f4(args[0],args[1],args[2],args[3]);
break;
case 5: f5=(kall5)adr;
ret=f5(args[0],args[1],args[2],args[3],args[4]);
break;
case 6: f6=(kall6)adr;
ret=f6(args[0],args[1],args[2],args[3],args[4],args[5]);
break;
case 7: f7=(kall7)adr;
ret=f7(args[0],args[1],args[2],args[3],args[4],args[5],args[6]);
break;
case 8: f8=(kall8)adr;
ret=f8(args[0],args[1],args[2],args[3],args[4],args[5],args[6],args[7]);
break;
case 9: f9=(kall9)adr;
ret=f9(args[0],args[1],args[2],args[3],args[4],args[5],args[6],args[7],args[8]);
break;
case 10: f10=(kall10)adr;
ret=f10(args[0],args[1],args[2],args[3],args[4],args[5],args[6],args[7],args[8],args[9]);
break;
case 11: f11=(kall11)adr;
ret=f11(args[0],args[1],args[2],args[3],args[4],args[5],args[6],args[7],args[8],args[9],args[10]);
break;
case 12: f12=(kall12)adr;
ret=f12(args[0],args[1],args[2],args[3],args[4],args[5],args[6],args[7],args[8],args[9],args[10],args[11]);
break;
case 13: f13=(kall13)adr;
ret=f13(args[0],args[1],args[2],args[3],args[4],args[5],args[6],args[7],args[8],args[9],args[10],args[11],args[12]);
break;
case 14: f14=(kall14)adr;
ret=f14(args[0],args[1],args[2],args[3],args[4],args[5],args[6],args[7],args[8],args[9],args[10],args[11],args[12],args[13]);
break;
case 15: f15=(kall15)adr;
ret=f15(args[0],args[1],args[2],args[3],args[4],args[5],args[6],args[7],args[8],args[9],args[10],args[11],args[12],args[13],args[14]);
break;
case 16: f16=(kall16)adr;
ret=f16(args[0],args[1],args[2],args[3],args[4],args[5],args[6],args[7],args[8],args[9],args[10],args[11],args[12],args[13],args[14],args[15]);
break;
}
push(fc,ret);
}
void
f5 (void)
{
f9 (f5);
}
int main(void) {
f0();
f1();
f2();
f3();
f4();
f5();
f6();
f7();
f8();
f9();
f10();
f11();
f12();
f13();
f14();
f15();
f16();
f17();
f18();
f19();
f20();
f21();
f22();
f23();
f24();
f25();
f26();
f27();
f28();
f29();
f30();
f31();
f32();
f33();
f34();
f35();
f36();
f37();
f38();
f39();
f40();
f41();
f42();
f43();
f44();
f45();
f46();
f47();
f48();
f49();
f50();
f51();
f52();
f53();
f54();
f55();
f56();
f57();
f58();
f59();
f60();
f61();
f62();
f63();
f64();
f65();
f66();
f67();
f68();
f69();
f70();
f71();
f72();
f73();
f74();
f75();
f76();
f77();
f78();
f79();
f80();
f81();
f82();
f83();
f84();
f85();
f86();
f87();
f88();
f89();
f90();
f91();
f92();
f93();
f94();
f95();
f96();
f97();
f98();
f99();
f100();
f101();
f102();
f103();
f104();
f105();
f106();
f107();
f108();
f109();
f110();
f111();
f112();
f113();
f114();
f115();
f116();
f117();
f118();
f119();
f120();
f121();
f122();
f123();
return 0;
}
int f8(){
totalSum += 8;
return f9() + 8;
}
void test_transcribed_availability() {
f9(0);
}
// CHECK: declare void @f9(float, i32 inreg)
void g9(void) {
struct s5 x = {41};
f9(x, 42);
}
static void
avx2_test (void)
{
int i;
for (i = 0; i < N + 16; i++)
{
asm ("");
vf1[i] = 17.0f + i;
vd1[i] = 19.0 + i;
}
for (i = 0; i < N; i++)
{
asm ("");
k[i] = (i * 731) & (N - 1);
l[i] = (i * 657) & (N - 1);
}
f1 ();
f2 ();
for (i = 0; i < N; i++)
if (vf2[i] != ((i * 731) & (N - 1)) + 17
|| n[i] != ((i * 731) & (N - 1)) + 17)
abort ();
f3 (12);
f4 (14);
for (i = 0; i < N; i++)
if (vf2[i] != ((i * 731) & (N - 1)) + 17 + 12
|| n[i] != ((i * 731) & (N - 1)) + 17 + 14)
abort ();
f5 ();
f6 ();
for (i = 0; i < N; i++)
if (vd2[i] != ((i * 731) & (N - 1)) + 19
|| n[i] != ((i * 731) & (N - 1)) + 19)
abort ();
f7 (7);
f8 (9);
for (i = 0; i < N; i++)
if (vd2[i] != ((i * 731) & (N - 1)) + 19 + 7
|| n[i] != ((i * 731) & (N - 1)) + 19 + 9)
abort ();
f9 ();
f10 ();
for (i = 0; i < N; i++)
if (vf2[i] != ((i * 657) & (N - 1)) + 17
|| n[i] != ((i * 657) & (N - 1)) + 17)
abort ();
f11 (2);
f12 (4);
for (i = 0; i < N; i++)
if (vf2[i] != ((i * 657) & (N - 1)) + 17 + 2
|| n[i] != ((i * 657) & (N - 1)) + 17 + 4)
abort ();
f13 ();
f14 ();
for (i = 0; i < N; i++)
if (vd2[i] != ((i * 657) & (N - 1)) + 19
|| n[i] != ((i * 657) & (N - 1)) + 19)
abort ();
f15 (13);
f16 (15);
for (i = 0; i < N; i++)
if (vd2[i] != ((i * 657) & (N - 1)) + 19 + 13
|| n[i] != ((i * 657) & (N - 1)) + 19 + 15)
abort ();
}
