file
stringlengths 18
26
| data
stringlengths 3
1.04M
|
|---|---|
the_stack_data/152108.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define ISF_VECT_SCL 1.960985419 /* Factor used to calculate length of <11-2> inverse azimuth */
#define TIMEERROR 0.44995
int main ( int argc, char *argv[] )
{
int i,j,linecount=0,dim;
double vect_len,result[4],error_fract;
char inname[20], outname[20], *buffer, *p;
FILE *in, *out;
sprintf(inname,"%s.prm",argv[1]);
sprintf(outname,"%s.csv",argv[1]);
dim=atoi(argv[2]);
vect_len=ISF_VECT_SCL*(1.-(2./dim));
in=fopen(inname,"r");
out=fopen(outname,"w");
for(i=0;i<dim/2;i++) {
fprintf(out, "%d\t%.5f", i, i*vect_len/((dim/2.)-1.) );
for(j=0;j<4;j++){
if(j==2) {
error_fract = (result[0]!=0.) ? (result[1]/result[0])+TIMEERROR : 0.;
fprintf(out, "\t%.7f", result[0]*error_fract);
}
buffer=(char *)malloc(50*sizeof(char));
fgets(buffer, 49, in);
linecount++;
p=buffer;
while (*p!='=')
p++;
p++;
result[j]=strtod(p,NULL);
fprintf(out, "\t%.7f", result[j]);
free(buffer);
}
fprintf(out, "\n");
}
fclose(in);
fclose(out);
return 0;
}
|
the_stack_data/70450196.c | #include <stdio.h>
#include <stdlib.h>
#include <locale.h>
#include <math.h>
#include <string.h>
int main()
{
setlocale(LC_ALL, "");
int h1, m1, h2, m2, resto;
while (scanf("%d %d %d %d", &h1, &m1, &h2, &m2))
{
if ((h1 + h2 + m1 + m2) == 0)
{
return 0;
}
h1 = h1 * 60;
h2 = h2 * 60;
h1 = h1 + m1;
h2 = h2 + m2;
if (h1 > h2)
{
h1 = h1 - 24 * 60;
resto = h1 + h2;
}
if (h2 > h1)
{
resto = h2 - h1;
}
printf("%d\n", resto);
}
return 0;
} |
the_stack_data/12639001.c | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
void print_monkey(void)
{
system("cat /home/ctf/graph");
fflush(stdout);
}
void menu(void)
{
printf("1 : change name\n");
printf("2 : program\n");
printf("3 : flag\n");
printf("4 : monkey\n");
printf("5 : exit\n");
printf("Please enter your choice!\n");
fflush(stdout);
};
void change_name(char* name)
{
printf("Your name is %s now.\n",name);
printf("Please enter your new name\n");
printf("Please less than 20 characters\n");
fgets(name,28,stdin);
if(strlen(name)>=20)
{
printf("Sorry maybe next time.\n");
exit(-1);
}
printf("Change name succeed\n");
printf("You are %s now.\n",name);
fflush(stdout);
}
void program(void)
{
char temp[1024];
memset(temp,0,sizeof(temp));
printf("Enter your code.\n");
printf("I will print it out.\n");
fflush(stdout);
fgets(temp,1024,stdin);
printf(temp);
printf("\n");
fflush(stdout);
}
void flag(int banana)
{
if(banana==0x3132000a)
{
char flag[100];
FILE * fp=fopen("/home/ctf/flag","r");
fscanf(fp,"%s",flag);
printf("%s",flag);
fflush(stdout);
}
else
{
printf("Wrong banana %d\n",banana);
fflush(stdout);
}
}
int main(void)
{
print_monkey();
printf("****************************************************\n");
printf("* Hello monkey programmer!!! *\n");
printf("* Welcome to monkey programmer system!!! *\n");
printf("* This system will guide you how to hire a trained *\n");
printf("* monkey to do your job!!! *\n");
printf("****************************************************\n");
int banana=1;
char name[20]="Bamboofox";
int choice;
while(1)
{
menu();
scanf("%d",&choice);
getchar();
switch(choice)
{
case 1:
change_name(name);
break;
case 2:
program();
break;
case 3:
flag(banana);
break;
case 4:
print_monkey();
break;
case 5:
printf("Bye.\n");
fflush(stdout);
return 0;
default:
break;
}
}
}
|
the_stack_data/57950491.c | #include <stdio.h>
int fact(int n)
{
if (n == 0) return 1;
else return n * fact(n-1);
}
int main()
{
printf("%u\n", fact(30));
return 0;
}
|
the_stack_data/54824269.c |
void parallel_0(short x[1344], short y[1344], int sum_array[21]) {
// Step 2: Initialize local variables
int sum_w1;
int sum_w10;
int sum_w11;
int sum_w12;
int sum_w13;
int sum_w14;
int sum_w15;
int sum_w16;
int sum_w17;
int sum_w18;
int sum_w19;
int sum_w2;
int sum_w20;
int sum_w21;
int sum_w22;
int sum_w23;
int sum_w24;
int sum_w25;
int sum_w26;
int sum_w27;
int sum_w28;
int sum_w29;
int sum_w3;
int sum_w30;
int sum_w31;
int sum_w32;
int sum_w33;
int sum_w34;
int sum_w35;
int sum_w36;
int sum_w37;
int sum_w38;
int sum_w39;
int sum_w4;
int sum_w40;
int sum_w41;
int sum_w42;
int sum_w43;
int sum_w44;
int sum_w45;
int sum_w46;
int sum_w47;
int sum_w48;
int sum_w49;
int sum_w5;
int sum_w50;
int sum_w51;
int sum_w52;
int sum_w53;
int sum_w54;
int sum_w55;
int sum_w56;
int sum_w57;
int sum_w58;
int sum_w59;
int sum_w6;
int sum_w60;
int sum_w61;
int sum_w62;
int sum_w7;
int sum_w8;
int sum_w9;
int temp_l83_i100_w1;
int temp_l83_i101_w1;
int temp_l83_i102_w1;
int temp_l83_i103_w1;
int temp_l83_i104_w1;
int temp_l83_i105_w1;
int temp_l83_i106_w1;
int temp_l83_i107_w1;
int temp_l83_i108_w1;
int temp_l83_i109_w1;
int temp_l83_i46_w1;
int temp_l83_i47_w1;
int temp_l83_i48_w1;
int temp_l83_i49_w1;
int temp_l83_i50_w1;
int temp_l83_i51_w1;
int temp_l83_i52_w1;
int temp_l83_i53_w1;
int temp_l83_i54_w1;
int temp_l83_i55_w1;
int temp_l83_i56_w1;
int temp_l83_i57_w1;
int temp_l83_i58_w1;
int temp_l83_i59_w1;
int temp_l83_i60_w1;
int temp_l83_i61_w1;
int temp_l83_i62_w1;
int temp_l83_i63_w1;
int temp_l83_i64_w1;
int temp_l83_i65_w1;
int temp_l83_i66_w1;
int temp_l83_i67_w1;
int temp_l83_i68_w1;
int temp_l83_i69_w1;
int temp_l83_i70_w1;
int temp_l83_i71_w1;
int temp_l83_i72_w1;
int temp_l83_i73_w1;
int temp_l83_i74_w1;
int temp_l83_i75_w1;
int temp_l83_i76_w1;
int temp_l83_i77_w1;
int temp_l83_i78_w1;
int temp_l83_i79_w1;
int temp_l83_i80_w1;
int temp_l83_i81_w1;
int temp_l83_i82_w1;
int temp_l83_i83_w1;
int temp_l83_i84_w1;
int temp_l83_i85_w1;
int temp_l83_i86_w1;
int temp_l83_i87_w1;
int temp_l83_i88_w1;
int temp_l83_i89_w1;
int temp_l83_i90_w1;
int temp_l83_i91_w1;
int temp_l83_i92_w1;
int temp_l83_i93_w1;
int temp_l83_i94_w1;
int temp_l83_i95_w1;
int temp_l83_i96_w1;
int temp_l83_i97_w1;
int temp_l83_i98_w1;
int temp_l83_i99_w1;
// Initialization done
// starting Loop
for( int i = 0; i < 21;i=i+1){
#pragma HLS pipeline
temp_l83_i46_w1 = x[(64)*i] * y[(64)*i];
temp_l83_i47_w1 = x[(64)*i+1] * y[(64)*i+1];
temp_l83_i48_w1 = x[(64)*i+2] * y[(64)*i+2];
temp_l83_i49_w1 = x[(64)*i+3] * y[(64)*i+3];
temp_l83_i50_w1 = x[(64)*i+4] * y[(64)*i+4];
temp_l83_i51_w1 = x[(64)*i+5] * y[(64)*i+5];
temp_l83_i52_w1 = x[(64)*i+6] * y[(64)*i+6];
temp_l83_i53_w1 = x[(64)*i+7] * y[(64)*i+7];
temp_l83_i54_w1 = x[(64)*i+8] * y[(64)*i+8];
temp_l83_i55_w1 = x[(64)*i+9] * y[(64)*i+9];
temp_l83_i56_w1 = x[(64)*i+10] * y[(64)*i+10];
temp_l83_i57_w1 = x[(64)*i+11] * y[(64)*i+11];
temp_l83_i58_w1 = x[(64)*i+12] * y[(64)*i+12];
temp_l83_i59_w1 = x[(64)*i+13] * y[(64)*i+13];
temp_l83_i60_w1 = x[(64)*i+14] * y[(64)*i+14];
temp_l83_i61_w1 = x[(64)*i+15] * y[(64)*i+15];
temp_l83_i62_w1 = x[(64)*i+16] * y[(64)*i+16];
temp_l83_i63_w1 = x[(64)*i+17] * y[(64)*i+17];
temp_l83_i64_w1 = x[(64)*i+18] * y[(64)*i+18];
temp_l83_i65_w1 = x[(64)*i+19] * y[(64)*i+19];
temp_l83_i66_w1 = x[(64)*i+20] * y[(64)*i+20];
temp_l83_i67_w1 = x[(64)*i+21] * y[(64)*i+21];
temp_l83_i68_w1 = x[(64)*i+22] * y[(64)*i+22];
temp_l83_i69_w1 = x[(64)*i+23] * y[(64)*i+23];
temp_l83_i70_w1 = x[(64)*i+24] * y[(64)*i+24];
temp_l83_i71_w1 = x[(64)*i+25] * y[(64)*i+25];
temp_l83_i72_w1 = x[(64)*i+26] * y[(64)*i+26];
temp_l83_i73_w1 = x[(64)*i+27] * y[(64)*i+27];
temp_l83_i74_w1 = x[(64)*i+28] * y[(64)*i+28];
temp_l83_i75_w1 = x[(64)*i+29] * y[(64)*i+29];
temp_l83_i76_w1 = x[(64)*i+30] * y[(64)*i+30];
temp_l83_i77_w1 = x[(64)*i+31] * y[(64)*i+31];
temp_l83_i78_w1 = x[(64)*i+32] * y[(64)*i+32];
temp_l83_i79_w1 = x[(64)*i+33] * y[(64)*i+33];
temp_l83_i80_w1 = x[(64)*i+34] * y[(64)*i+34];
temp_l83_i81_w1 = x[(64)*i+35] * y[(64)*i+35];
temp_l83_i82_w1 = x[(64)*i+36] * y[(64)*i+36];
temp_l83_i83_w1 = x[(64)*i+37] * y[(64)*i+37];
temp_l83_i84_w1 = x[(64)*i+38] * y[(64)*i+38];
temp_l83_i85_w1 = x[(64)*i+39] * y[(64)*i+39];
temp_l83_i86_w1 = x[(64)*i+40] * y[(64)*i+40];
temp_l83_i87_w1 = x[(64)*i+41] * y[(64)*i+41];
temp_l83_i88_w1 = x[(64)*i+42] * y[(64)*i+42];
temp_l83_i89_w1 = x[(64)*i+43] * y[(64)*i+43];
temp_l83_i90_w1 = x[(64)*i+44] * y[(64)*i+44];
temp_l83_i91_w1 = x[(64)*i+45] * y[(64)*i+45];
temp_l83_i92_w1 = x[(64)*i+46] * y[(64)*i+46];
temp_l83_i93_w1 = x[(64)*i+47] * y[(64)*i+47];
temp_l83_i94_w1 = x[(64)*i+48] * y[(64)*i+48];
temp_l83_i95_w1 = x[(64)*i+49] * y[(64)*i+49];
temp_l83_i96_w1 = x[(64)*i+50] * y[(64)*i+50];
temp_l83_i97_w1 = x[(64)*i+51] * y[(64)*i+51];
temp_l83_i98_w1 = x[(64)*i+52] * y[(64)*i+52];
temp_l83_i99_w1 = x[(64)*i+53] * y[(64)*i+53];
temp_l83_i100_w1 = x[(64)*i+54] * y[(64)*i+54];
temp_l83_i101_w1 = x[(64)*i+55] * y[(64)*i+55];
temp_l83_i102_w1 = x[(64)*i+56] * y[(64)*i+56];
temp_l83_i103_w1 = x[(64)*i+57] * y[(64)*i+57];
temp_l83_i104_w1 = x[(64)*i+58] * y[(64)*i+58];
temp_l83_i105_w1 = x[(64)*i+59] * y[(64)*i+59];
temp_l83_i106_w1 = x[(64)*i+60] * y[(64)*i+60];
temp_l83_i107_w1 = x[(64)*i+61] * y[(64)*i+61];
temp_l83_i108_w1 = x[(64)*i+62] * y[(64)*i+62];
temp_l83_i109_w1 = x[(64)*i+63] * y[(64)*i+63];
sum_w26 = temp_l83_i100_w1 + temp_l83_i101_w1;
sum_w49 = temp_l83_i102_w1 + temp_l83_i103_w1;
sum_w50 = temp_l83_i104_w1 + temp_l83_i105_w1;
sum_w21 = temp_l83_i106_w1 + temp_l83_i107_w1;
sum_w22 = temp_l83_i108_w1 + temp_l83_i109_w1;
sum_w57 = temp_l83_i46_w1 + temp_l83_i47_w1;
sum_w58 = temp_l83_i48_w1 + temp_l83_i49_w1;
sum_w19 = temp_l83_i50_w1 + temp_l83_i51_w1;
sum_w20 = temp_l83_i52_w1 + temp_l83_i53_w1;
sum_w37 = temp_l83_i54_w1 + temp_l83_i55_w1;
sum_w38 = temp_l83_i56_w1 + temp_l83_i57_w1;
sum_w31 = temp_l83_i58_w1 + temp_l83_i59_w1;
sum_w32 = temp_l83_i60_w1 + temp_l83_i61_w1;
sum_w47 = temp_l83_i62_w1 + temp_l83_i63_w1;
sum_w48 = temp_l83_i64_w1 + temp_l83_i65_w1;
sum_w9 = temp_l83_i66_w1 + temp_l83_i67_w1;
sum_w10 = temp_l83_i68_w1 + temp_l83_i69_w1;
sum_w7 = temp_l83_i70_w1 + temp_l83_i71_w1;
sum_w8 = temp_l83_i72_w1 + temp_l83_i73_w1;
sum_w13 = temp_l83_i74_w1 + temp_l83_i75_w1;
sum_w14 = temp_l83_i76_w1 + temp_l83_i77_w1;
sum_w35 = temp_l83_i78_w1 + temp_l83_i79_w1;
sum_w36 = temp_l83_i80_w1 + temp_l83_i81_w1;
sum_w41 = temp_l83_i82_w1 + temp_l83_i83_w1;
sum_w42 = temp_l83_i84_w1 + temp_l83_i85_w1;
sum_w27 = temp_l83_i86_w1 + temp_l83_i87_w1;
sum_w28 = temp_l83_i88_w1 + temp_l83_i89_w1;
sum_w33 = temp_l83_i90_w1 + temp_l83_i91_w1;
sum_w34 = temp_l83_i92_w1 + temp_l83_i93_w1;
sum_w23 = temp_l83_i94_w1 + temp_l83_i95_w1;
sum_w24 = temp_l83_i96_w1 + temp_l83_i97_w1;
sum_w25 = temp_l83_i98_w1 + temp_l83_i99_w1;
sum_w40 = sum_w13 + sum_w14;
sum_w46 = sum_w19 + sum_w20;
sum_w44 = sum_w21 + sum_w22;
sum_w61 = sum_w23 + sum_w24;
sum_w62 = sum_w25 + sum_w26;
sum_w3 = sum_w27 + sum_w28;
sum_w60 = sum_w31 + sum_w32;
sum_w4 = sum_w33 + sum_w34;
sum_w11 = sum_w35 + sum_w36;
sum_w59 = sum_w37 + sum_w38;
sum_w12 = sum_w41 + sum_w42;
sum_w15 = sum_w47 + sum_w48;
sum_w43 = sum_w49 + sum_w50;
sum_w45 = sum_w57 + sum_w58;
sum_w39 = sum_w7 + sum_w8;
sum_w16 = sum_w9 + sum_w10;
sum_w55 = sum_w11 + sum_w12;
sum_w53 = sum_w15 + sum_w16;
sum_w56 = sum_w3 + sum_w4;
sum_w54 = sum_w39 + sum_w40;
sum_w30 = sum_w43 + sum_w44;
sum_w17 = sum_w45 + sum_w46;
sum_w18 = sum_w59 + sum_w60;
sum_w29 = sum_w61 + sum_w62;
sum_w1 = sum_w17 + sum_w18;
sum_w6 = sum_w29 + sum_w30;
sum_w2 = sum_w53 + sum_w54;
sum_w5 = sum_w55 + sum_w56;
sum_w51 = sum_w1 + sum_w2;
sum_w52 = sum_w5 + sum_w6;
sum_array[i] = sum_w51 + sum_w52;
}
}
void parallel_1(short x[1216], short y[1216], int sum_array[19]) {
// Step 2: Initialize local variables
int sum_w1;
int sum_w10;
int sum_w11;
int sum_w12;
int sum_w13;
int sum_w14;
int sum_w15;
int sum_w16;
int sum_w17;
int sum_w18;
int sum_w19;
int sum_w2;
int sum_w20;
int sum_w21;
int sum_w22;
int sum_w23;
int sum_w24;
int sum_w25;
int sum_w26;
int sum_w27;
int sum_w28;
int sum_w29;
int sum_w3;
int sum_w30;
int sum_w31;
int sum_w32;
int sum_w33;
int sum_w34;
int sum_w35;
int sum_w36;
int sum_w37;
int sum_w38;
int sum_w39;
int sum_w4;
int sum_w40;
int sum_w41;
int sum_w42;
int sum_w43;
int sum_w44;
int sum_w45;
int sum_w46;
int sum_w47;
int sum_w48;
int sum_w49;
int sum_w5;
int sum_w50;
int sum_w51;
int sum_w52;
int sum_w53;
int sum_w54;
int sum_w55;
int sum_w56;
int sum_w57;
int sum_w58;
int sum_w59;
int sum_w6;
int sum_w60;
int sum_w61;
int sum_w62;
int sum_w7;
int sum_w8;
int sum_w9;
int temp_l83_i2734_w1;
int temp_l83_i2735_w1;
int temp_l83_i2736_w1;
int temp_l83_i2737_w1;
int temp_l83_i2738_w1;
int temp_l83_i2739_w1;
int temp_l83_i2740_w1;
int temp_l83_i2741_w1;
int temp_l83_i2742_w1;
int temp_l83_i2743_w1;
int temp_l83_i2744_w1;
int temp_l83_i2745_w1;
int temp_l83_i2746_w1;
int temp_l83_i2747_w1;
int temp_l83_i2748_w1;
int temp_l83_i2749_w1;
int temp_l83_i2750_w1;
int temp_l83_i2751_w1;
int temp_l83_i2752_w1;
int temp_l83_i2753_w1;
int temp_l83_i2754_w1;
int temp_l83_i2755_w1;
int temp_l83_i2756_w1;
int temp_l83_i2757_w1;
int temp_l83_i2758_w1;
int temp_l83_i2759_w1;
int temp_l83_i2760_w1;
int temp_l83_i2761_w1;
int temp_l83_i2762_w1;
int temp_l83_i2763_w1;
int temp_l83_i2764_w1;
int temp_l83_i2765_w1;
int temp_l83_i2766_w1;
int temp_l83_i2767_w1;
int temp_l83_i2768_w1;
int temp_l83_i2769_w1;
int temp_l83_i2770_w1;
int temp_l83_i2771_w1;
int temp_l83_i2772_w1;
int temp_l83_i2773_w1;
int temp_l83_i2774_w1;
int temp_l83_i2775_w1;
int temp_l83_i2776_w1;
int temp_l83_i2777_w1;
int temp_l83_i2778_w1;
int temp_l83_i2779_w1;
int temp_l83_i2780_w1;
int temp_l83_i2781_w1;
int temp_l83_i2782_w1;
int temp_l83_i2783_w1;
int temp_l83_i2784_w1;
int temp_l83_i2785_w1;
int temp_l83_i2786_w1;
int temp_l83_i2787_w1;
int temp_l83_i2788_w1;
int temp_l83_i2789_w1;
int temp_l83_i2790_w1;
int temp_l83_i2791_w1;
int temp_l83_i2792_w1;
int temp_l83_i2793_w1;
int temp_l83_i2794_w1;
int temp_l83_i2795_w1;
int temp_l83_i2796_w1;
int temp_l83_i2797_w1;
// Initialization done
// starting Loop
for( int i = 0; i < 19;i=i+1){
#pragma HLS pipeline
temp_l83_i2734_w1 = x[(64)*i] * y[(64)*i];
temp_l83_i2735_w1 = x[(64)*i+1] * y[(64)*i+1];
temp_l83_i2736_w1 = x[(64)*i+2] * y[(64)*i+2];
temp_l83_i2737_w1 = x[(64)*i+3] * y[(64)*i+3];
temp_l83_i2738_w1 = x[(64)*i+4] * y[(64)*i+4];
temp_l83_i2739_w1 = x[(64)*i+5] * y[(64)*i+5];
temp_l83_i2740_w1 = x[(64)*i+6] * y[(64)*i+6];
temp_l83_i2741_w1 = x[(64)*i+7] * y[(64)*i+7];
temp_l83_i2742_w1 = x[(64)*i+8] * y[(64)*i+8];
temp_l83_i2743_w1 = x[(64)*i+9] * y[(64)*i+9];
temp_l83_i2744_w1 = x[(64)*i+10] * y[(64)*i+10];
temp_l83_i2745_w1 = x[(64)*i+11] * y[(64)*i+11];
temp_l83_i2746_w1 = x[(64)*i+12] * y[(64)*i+12];
temp_l83_i2747_w1 = x[(64)*i+13] * y[(64)*i+13];
temp_l83_i2748_w1 = x[(64)*i+14] * y[(64)*i+14];
temp_l83_i2749_w1 = x[(64)*i+15] * y[(64)*i+15];
temp_l83_i2750_w1 = x[(64)*i+16] * y[(64)*i+16];
temp_l83_i2751_w1 = x[(64)*i+17] * y[(64)*i+17];
temp_l83_i2752_w1 = x[(64)*i+18] * y[(64)*i+18];
temp_l83_i2753_w1 = x[(64)*i+19] * y[(64)*i+19];
temp_l83_i2754_w1 = x[(64)*i+20] * y[(64)*i+20];
temp_l83_i2755_w1 = x[(64)*i+21] * y[(64)*i+21];
temp_l83_i2756_w1 = x[(64)*i+22] * y[(64)*i+22];
temp_l83_i2757_w1 = x[(64)*i+23] * y[(64)*i+23];
temp_l83_i2758_w1 = x[(64)*i+24] * y[(64)*i+24];
temp_l83_i2759_w1 = x[(64)*i+25] * y[(64)*i+25];
temp_l83_i2760_w1 = x[(64)*i+26] * y[(64)*i+26];
temp_l83_i2761_w1 = x[(64)*i+27] * y[(64)*i+27];
temp_l83_i2762_w1 = x[(64)*i+28] * y[(64)*i+28];
temp_l83_i2763_w1 = x[(64)*i+29] * y[(64)*i+29];
temp_l83_i2764_w1 = x[(64)*i+30] * y[(64)*i+30];
temp_l83_i2765_w1 = x[(64)*i+31] * y[(64)*i+31];
temp_l83_i2766_w1 = x[(64)*i+32] * y[(64)*i+32];
temp_l83_i2767_w1 = x[(64)*i+33] * y[(64)*i+33];
temp_l83_i2768_w1 = x[(64)*i+34] * y[(64)*i+34];
temp_l83_i2769_w1 = x[(64)*i+35] * y[(64)*i+35];
temp_l83_i2770_w1 = x[(64)*i+36] * y[(64)*i+36];
temp_l83_i2771_w1 = x[(64)*i+37] * y[(64)*i+37];
temp_l83_i2772_w1 = x[(64)*i+38] * y[(64)*i+38];
temp_l83_i2773_w1 = x[(64)*i+39] * y[(64)*i+39];
temp_l83_i2774_w1 = x[(64)*i+40] * y[(64)*i+40];
temp_l83_i2775_w1 = x[(64)*i+41] * y[(64)*i+41];
temp_l83_i2776_w1 = x[(64)*i+42] * y[(64)*i+42];
temp_l83_i2777_w1 = x[(64)*i+43] * y[(64)*i+43];
temp_l83_i2778_w1 = x[(64)*i+44] * y[(64)*i+44];
temp_l83_i2779_w1 = x[(64)*i+45] * y[(64)*i+45];
temp_l83_i2780_w1 = x[(64)*i+46] * y[(64)*i+46];
temp_l83_i2781_w1 = x[(64)*i+47] * y[(64)*i+47];
temp_l83_i2782_w1 = x[(64)*i+48] * y[(64)*i+48];
temp_l83_i2783_w1 = x[(64)*i+49] * y[(64)*i+49];
temp_l83_i2784_w1 = x[(64)*i+50] * y[(64)*i+50];
temp_l83_i2785_w1 = x[(64)*i+51] * y[(64)*i+51];
temp_l83_i2786_w1 = x[(64)*i+52] * y[(64)*i+52];
temp_l83_i2787_w1 = x[(64)*i+53] * y[(64)*i+53];
temp_l83_i2788_w1 = x[(64)*i+54] * y[(64)*i+54];
temp_l83_i2789_w1 = x[(64)*i+55] * y[(64)*i+55];
temp_l83_i2790_w1 = x[(64)*i+56] * y[(64)*i+56];
temp_l83_i2791_w1 = x[(64)*i+57] * y[(64)*i+57];
temp_l83_i2792_w1 = x[(64)*i+58] * y[(64)*i+58];
temp_l83_i2793_w1 = x[(64)*i+59] * y[(64)*i+59];
temp_l83_i2794_w1 = x[(64)*i+60] * y[(64)*i+60];
temp_l83_i2795_w1 = x[(64)*i+61] * y[(64)*i+61];
temp_l83_i2796_w1 = x[(64)*i+62] * y[(64)*i+62];
temp_l83_i2797_w1 = x[(64)*i+63] * y[(64)*i+63];
sum_w43 = temp_l83_i2734_w1 + temp_l83_i2735_w1;
sum_w44 = temp_l83_i2736_w1 + temp_l83_i2737_w1;
sum_w1 = temp_l83_i2738_w1 + temp_l83_i2739_w1;
sum_w2 = temp_l83_i2740_w1 + temp_l83_i2741_w1;
sum_w31 = temp_l83_i2742_w1 + temp_l83_i2743_w1;
sum_w32 = temp_l83_i2744_w1 + temp_l83_i2745_w1;
sum_w33 = temp_l83_i2746_w1 + temp_l83_i2747_w1;
sum_w34 = temp_l83_i2748_w1 + temp_l83_i2749_w1;
sum_w15 = temp_l83_i2750_w1 + temp_l83_i2751_w1;
sum_w16 = temp_l83_i2752_w1 + temp_l83_i2753_w1;
sum_w37 = temp_l83_i2754_w1 + temp_l83_i2755_w1;
sum_w38 = temp_l83_i2756_w1 + temp_l83_i2757_w1;
sum_w7 = temp_l83_i2758_w1 + temp_l83_i2759_w1;
sum_w8 = temp_l83_i2760_w1 + temp_l83_i2761_w1;
sum_w39 = temp_l83_i2762_w1 + temp_l83_i2763_w1;
sum_w40 = temp_l83_i2764_w1 + temp_l83_i2765_w1;
sum_w9 = temp_l83_i2766_w1 + temp_l83_i2767_w1;
sum_w10 = temp_l83_i2768_w1 + temp_l83_i2769_w1;
sum_w59 = temp_l83_i2770_w1 + temp_l83_i2771_w1;
sum_w60 = temp_l83_i2772_w1 + temp_l83_i2773_w1;
sum_w21 = temp_l83_i2774_w1 + temp_l83_i2775_w1;
sum_w22 = temp_l83_i2776_w1 + temp_l83_i2777_w1;
sum_w19 = temp_l83_i2778_w1 + temp_l83_i2779_w1;
sum_w20 = temp_l83_i2780_w1 + temp_l83_i2781_w1;
sum_w55 = temp_l83_i2782_w1 + temp_l83_i2783_w1;
sum_w56 = temp_l83_i2784_w1 + temp_l83_i2785_w1;
sum_w47 = temp_l83_i2786_w1 + temp_l83_i2787_w1;
sum_w48 = temp_l83_i2788_w1 + temp_l83_i2789_w1;
sum_w53 = temp_l83_i2790_w1 + temp_l83_i2791_w1;
sum_w54 = temp_l83_i2792_w1 + temp_l83_i2793_w1;
sum_w29 = temp_l83_i2794_w1 + temp_l83_i2795_w1;
sum_w30 = temp_l83_i2796_w1 + temp_l83_i2797_w1;
sum_w26 = sum_w1 + sum_w2;
sum_w11 = sum_w15 + sum_w16;
sum_w52 = sum_w19 + sum_w20;
sum_w51 = sum_w21 + sum_w22;
sum_w6 = sum_w29 + sum_w30;
sum_w45 = sum_w31 + sum_w32;
sum_w46 = sum_w33 + sum_w34;
sum_w12 = sum_w37 + sum_w38;
sum_w42 = sum_w39 + sum_w40;
sum_w25 = sum_w43 + sum_w44;
sum_w62 = sum_w47 + sum_w48;
sum_w5 = sum_w53 + sum_w54;
sum_w61 = sum_w55 + sum_w56;
sum_w36 = sum_w59 + sum_w60;
sum_w41 = sum_w7 + sum_w8;
sum_w35 = sum_w9 + sum_w10;
sum_w13 = sum_w11 + sum_w12;
sum_w3 = sum_w25 + sum_w26;
sum_w17 = sum_w35 + sum_w36;
sum_w14 = sum_w41 + sum_w42;
sum_w4 = sum_w45 + sum_w46;
sum_w24 = sum_w5 + sum_w6;
sum_w18 = sum_w51 + sum_w52;
sum_w23 = sum_w61 + sum_w62;
sum_w50 = sum_w13 + sum_w14;
sum_w27 = sum_w17 + sum_w18;
sum_w28 = sum_w23 + sum_w24;
sum_w49 = sum_w3 + sum_w4;
sum_w58 = sum_w27 + sum_w28;
sum_w57 = sum_w49 + sum_w50;
sum_array[i] = sum_w57 + sum_w58;
}
}
void epilogue(int sum_array_2[19], short x_0[45], short y_0[45], short x_4[51], int sum_array_1[21], short y_4[51], int sum_array_0[21], int *out) {
// Step 2: Initialize local variables
int sum_w1;
int sum_w10;
int sum_w100;
int sum_w101;
int sum_w102;
int sum_w103;
int sum_w104;
int sum_w105;
int sum_w106;
int sum_w107;
int sum_w108;
int sum_w109;
int sum_w11;
int sum_w110;
int sum_w111;
int sum_w112;
int sum_w113;
int sum_w114;
int sum_w115;
int sum_w116;
int sum_w117;
int sum_w118;
int sum_w119;
int sum_w12;
int sum_w120;
int sum_w121;
int sum_w122;
int sum_w123;
int sum_w124;
int sum_w125;
int sum_w126;
int sum_w127;
int sum_w128;
int sum_w129;
int sum_w13;
int sum_w130;
int sum_w131;
int sum_w132;
int sum_w133;
int sum_w134;
int sum_w135;
int sum_w136;
int sum_w137;
int sum_w138;
int sum_w139;
int sum_w14;
int sum_w140;
int sum_w141;
int sum_w142;
int sum_w143;
int sum_w144;
int sum_w145;
int sum_w146;
int sum_w147;
int sum_w148;
int sum_w149;
int sum_w15;
int sum_w150;
int sum_w151;
int sum_w152;
int sum_w153;
int sum_w154;
int sum_w155;
int sum_w156;
int sum_w16;
int sum_w17;
int sum_w18;
int sum_w19;
int sum_w2;
int sum_w20;
int sum_w21;
int sum_w22;
int sum_w23;
int sum_w24;
int sum_w25;
int sum_w26;
int sum_w27;
int sum_w28;
int sum_w29;
int sum_w3;
int sum_w30;
int sum_w31;
int sum_w32;
int sum_w33;
int sum_w34;
int sum_w35;
int sum_w36;
int sum_w37;
int sum_w38;
int sum_w39;
int sum_w4;
int sum_w40;
int sum_w41;
int sum_w42;
int sum_w43;
int sum_w44;
int sum_w45;
int sum_w46;
int sum_w47;
int sum_w48;
int sum_w49;
int sum_w5;
int sum_w50;
int sum_w51;
int sum_w52;
int sum_w53;
int sum_w54;
int sum_w55;
int sum_w56;
int sum_w57;
int sum_w58;
int sum_w59;
int sum_w6;
int sum_w60;
int sum_w61;
int sum_w62;
int sum_w63;
int sum_w64;
int sum_w65;
int sum_w66;
int sum_w67;
int sum_w68;
int sum_w69;
int sum_w7;
int sum_w70;
int sum_w71;
int sum_w72;
int sum_w73;
int sum_w74;
int sum_w75;
int sum_w76;
int sum_w77;
int sum_w78;
int sum_w79;
int sum_w8;
int sum_w80;
int sum_w81;
int sum_w82;
int sum_w83;
int sum_w84;
int sum_w85;
int sum_w86;
int sum_w87;
int sum_w88;
int sum_w89;
int sum_w9;
int sum_w90;
int sum_w91;
int sum_w92;
int sum_w93;
int sum_w94;
int sum_w95;
int sum_w96;
int sum_w97;
int sum_w98;
int sum_w99;
int temp_l83_i10_w1;
int temp_l83_i11_w1;
int temp_l83_i12_w1;
int temp_l83_i13_w1;
int temp_l83_i14_w1;
int temp_l83_i15_w1;
int temp_l83_i16_w1;
int temp_l83_i17_w1;
int temp_l83_i18_w1;
int temp_l83_i19_w1;
int temp_l83_i1_w1;
int temp_l83_i20_w1;
int temp_l83_i21_w1;
int temp_l83_i22_w1;
int temp_l83_i23_w1;
int temp_l83_i24_w1;
int temp_l83_i25_w1;
int temp_l83_i26_w1;
int temp_l83_i27_w1;
int temp_l83_i28_w1;
int temp_l83_i29_w1;
int temp_l83_i2_w1;
int temp_l83_i30_w1;
int temp_l83_i31_w1;
int temp_l83_i32_w1;
int temp_l83_i33_w1;
int temp_l83_i34_w1;
int temp_l83_i35_w1;
int temp_l83_i36_w1;
int temp_l83_i37_w1;
int temp_l83_i38_w1;
int temp_l83_i3950_w1;
int temp_l83_i3951_w1;
int temp_l83_i3952_w1;
int temp_l83_i3953_w1;
int temp_l83_i3954_w1;
int temp_l83_i3955_w1;
int temp_l83_i3956_w1;
int temp_l83_i3957_w1;
int temp_l83_i3958_w1;
int temp_l83_i3959_w1;
int temp_l83_i3960_w1;
int temp_l83_i3961_w1;
int temp_l83_i3962_w1;
int temp_l83_i3963_w1;
int temp_l83_i3964_w1;
int temp_l83_i3965_w1;
int temp_l83_i3966_w1;
int temp_l83_i3967_w1;
int temp_l83_i3968_w1;
int temp_l83_i3969_w1;
int temp_l83_i3970_w1;
int temp_l83_i3971_w1;
int temp_l83_i3972_w1;
int temp_l83_i3973_w1;
int temp_l83_i3974_w1;
int temp_l83_i3975_w1;
int temp_l83_i3976_w1;
int temp_l83_i3977_w1;
int temp_l83_i3978_w1;
int temp_l83_i3979_w1;
int temp_l83_i3980_w1;
int temp_l83_i3981_w1;
int temp_l83_i3982_w1;
int temp_l83_i3983_w1;
int temp_l83_i3984_w1;
int temp_l83_i3985_w1;
int temp_l83_i3986_w1;
int temp_l83_i3987_w1;
int temp_l83_i3988_w1;
int temp_l83_i3989_w1;
int temp_l83_i3990_w1;
int temp_l83_i3991_w1;
int temp_l83_i3992_w1;
int temp_l83_i3993_w1;
int temp_l83_i3994_w1;
int temp_l83_i3995_w1;
int temp_l83_i3996_w1;
int temp_l83_i3997_w1;
int temp_l83_i3998_w1;
int temp_l83_i3999_w1;
int temp_l83_i39_w1;
int temp_l83_i3_w1;
int temp_l83_i4000_w1;
int temp_l83_i40_w1;
int temp_l83_i41_w1;
int temp_l83_i42_w1;
int temp_l83_i43_w1;
int temp_l83_i44_w1;
int temp_l83_i45_w1;
int temp_l83_i4_w1;
int temp_l83_i5_w1;
int temp_l83_i6_w1;
int temp_l83_i7_w1;
int temp_l83_i8_w1;
int temp_l83_i9_w1;
// Initialization done
sum_w64 = sum_array_0[0] + sum_array_0[1];
sum_w65 = sum_array_0[2] + sum_array_0[3];
sum_w127 = sum_array_0[4] + sum_array_0[5];
sum_w128 = sum_array_0[6] + sum_array_0[7];
sum_w35 = sum_array_0[8] + sum_array_0[9];
sum_w36 = sum_array_0[10] + sum_array_0[11];
sum_w106 = sum_array_0[12] + sum_array_0[13];
sum_w107 = sum_array_0[14] + sum_array_0[15];
sum_w80 = sum_array_0[16] + sum_array_0[17];
sum_w81 = sum_array_0[18] + sum_array_0[19];
sum_w43 = sum_array_0[20] + sum_array_1[0];
sum_w44 = sum_array_1[1] + sum_array_1[2];
sum_w15 = sum_array_1[3] + sum_array_1[4];
sum_w16 = sum_array_1[5] + sum_array_1[6];
sum_w82 = sum_array_1[7] + sum_array_1[8];
sum_w83 = sum_array_1[9] + sum_array_1[10];
sum_w41 = sum_array_1[11] + sum_array_1[12];
sum_w42 = sum_array_1[13] + sum_array_1[14];
sum_w31 = sum_array_1[15] + sum_array_1[16];
sum_w32 = sum_array_1[17] + sum_array_1[18];
sum_w115 = sum_array_1[19] + sum_array_1[20];
sum_w116 = sum_array_2[0] + sum_array_2[1];
sum_w113 = sum_array_2[2] + sum_array_2[3];
sum_w114 = sum_array_2[4] + sum_array_2[5];
sum_w125 = sum_array_2[6] + sum_array_2[7];
sum_w126 = sum_array_2[8] + sum_array_2[9];
sum_w104 = sum_array_2[10] + sum_array_2[11];
sum_w105 = sum_array_2[12] + sum_array_2[13];
sum_w29 = sum_array_2[14] + sum_array_2[15];
sum_w30 = sum_array_2[16] + sum_array_2[17];
temp_l83_i1_w1 = x_0[0] * y_0[0];
temp_l83_i2_w1 = x_0[1] * y_0[1];
temp_l83_i3_w1 = x_0[2] * y_0[2];
temp_l83_i4_w1 = x_0[3] * y_0[3];
temp_l83_i5_w1 = x_0[4] * y_0[4];
temp_l83_i6_w1 = x_0[5] * y_0[5];
temp_l83_i7_w1 = x_0[6] * y_0[6];
temp_l83_i8_w1 = x_0[7] * y_0[7];
temp_l83_i9_w1 = x_0[8] * y_0[8];
temp_l83_i10_w1 = x_0[9] * y_0[9];
temp_l83_i11_w1 = x_0[10] * y_0[10];
temp_l83_i12_w1 = x_0[11] * y_0[11];
temp_l83_i13_w1 = x_0[12] * y_0[12];
temp_l83_i14_w1 = x_0[13] * y_0[13];
temp_l83_i15_w1 = x_0[14] * y_0[14];
temp_l83_i16_w1 = x_0[15] * y_0[15];
temp_l83_i17_w1 = x_0[16] * y_0[16];
temp_l83_i18_w1 = x_0[17] * y_0[17];
temp_l83_i19_w1 = x_0[18] * y_0[18];
temp_l83_i20_w1 = x_0[19] * y_0[19];
temp_l83_i21_w1 = x_0[20] * y_0[20];
temp_l83_i22_w1 = x_0[21] * y_0[21];
temp_l83_i23_w1 = x_0[22] * y_0[22];
temp_l83_i24_w1 = x_0[23] * y_0[23];
temp_l83_i25_w1 = x_0[24] * y_0[24];
temp_l83_i26_w1 = x_0[25] * y_0[25];
temp_l83_i27_w1 = x_0[26] * y_0[26];
temp_l83_i28_w1 = x_0[27] * y_0[27];
temp_l83_i29_w1 = x_0[28] * y_0[28];
temp_l83_i30_w1 = x_0[29] * y_0[29];
temp_l83_i31_w1 = x_0[30] * y_0[30];
temp_l83_i32_w1 = x_0[31] * y_0[31];
temp_l83_i33_w1 = x_0[32] * y_0[32];
temp_l83_i34_w1 = x_0[33] * y_0[33];
temp_l83_i35_w1 = x_0[34] * y_0[34];
temp_l83_i36_w1 = x_0[35] * y_0[35];
temp_l83_i37_w1 = x_0[36] * y_0[36];
temp_l83_i38_w1 = x_0[37] * y_0[37];
temp_l83_i39_w1 = x_0[38] * y_0[38];
temp_l83_i40_w1 = x_0[39] * y_0[39];
temp_l83_i41_w1 = x_0[40] * y_0[40];
temp_l83_i42_w1 = x_0[41] * y_0[41];
temp_l83_i43_w1 = x_0[42] * y_0[42];
temp_l83_i44_w1 = x_0[43] * y_0[43];
temp_l83_i45_w1 = x_0[44] * y_0[44];
temp_l83_i3950_w1 = x_4[0] * y_4[0];
temp_l83_i3951_w1 = x_4[1] * y_4[1];
temp_l83_i3952_w1 = x_4[2] * y_4[2];
temp_l83_i3953_w1 = x_4[3] * y_4[3];
temp_l83_i3954_w1 = x_4[4] * y_4[4];
temp_l83_i3955_w1 = x_4[5] * y_4[5];
temp_l83_i3956_w1 = x_4[6] * y_4[6];
temp_l83_i3957_w1 = x_4[7] * y_4[7];
temp_l83_i3958_w1 = x_4[8] * y_4[8];
temp_l83_i3959_w1 = x_4[9] * y_4[9];
temp_l83_i3960_w1 = x_4[10] * y_4[10];
temp_l83_i3961_w1 = x_4[11] * y_4[11];
temp_l83_i3962_w1 = x_4[12] * y_4[12];
temp_l83_i3963_w1 = x_4[13] * y_4[13];
temp_l83_i3964_w1 = x_4[14] * y_4[14];
temp_l83_i3965_w1 = x_4[15] * y_4[15];
temp_l83_i3966_w1 = x_4[16] * y_4[16];
temp_l83_i3967_w1 = x_4[17] * y_4[17];
temp_l83_i3968_w1 = x_4[18] * y_4[18];
temp_l83_i3969_w1 = x_4[19] * y_4[19];
temp_l83_i3970_w1 = x_4[20] * y_4[20];
temp_l83_i3971_w1 = x_4[21] * y_4[21];
temp_l83_i3972_w1 = x_4[22] * y_4[22];
temp_l83_i3973_w1 = x_4[23] * y_4[23];
temp_l83_i3974_w1 = x_4[24] * y_4[24];
temp_l83_i3975_w1 = x_4[25] * y_4[25];
temp_l83_i3976_w1 = x_4[26] * y_4[26];
temp_l83_i3977_w1 = x_4[27] * y_4[27];
temp_l83_i3978_w1 = x_4[28] * y_4[28];
temp_l83_i3979_w1 = x_4[29] * y_4[29];
temp_l83_i3980_w1 = x_4[30] * y_4[30];
temp_l83_i3981_w1 = x_4[31] * y_4[31];
temp_l83_i3982_w1 = x_4[32] * y_4[32];
temp_l83_i3983_w1 = x_4[33] * y_4[33];
temp_l83_i3984_w1 = x_4[34] * y_4[34];
temp_l83_i3985_w1 = x_4[35] * y_4[35];
temp_l83_i3986_w1 = x_4[36] * y_4[36];
temp_l83_i3987_w1 = x_4[37] * y_4[37];
temp_l83_i3988_w1 = x_4[38] * y_4[38];
temp_l83_i3989_w1 = x_4[39] * y_4[39];
temp_l83_i3990_w1 = x_4[40] * y_4[40];
temp_l83_i3991_w1 = x_4[41] * y_4[41];
temp_l83_i3992_w1 = x_4[42] * y_4[42];
temp_l83_i3993_w1 = x_4[43] * y_4[43];
temp_l83_i3994_w1 = x_4[44] * y_4[44];
temp_l83_i3995_w1 = x_4[45] * y_4[45];
temp_l83_i3996_w1 = x_4[46] * y_4[46];
temp_l83_i3997_w1 = x_4[47] * y_4[47];
temp_l83_i3998_w1 = x_4[48] * y_4[48];
temp_l83_i3999_w1 = x_4[49] * y_4[49];
temp_l83_i4000_w1 = x_4[50] * y_4[50];
sum_w95 = sum_w104 + sum_w105;
sum_w154 = sum_w106 + sum_w107;
sum_w67 = sum_w113 + sum_w114;
sum_w66 = sum_w115 + sum_w116;
sum_w94 = sum_w125 + sum_w126;
sum_w103 = sum_w127 + sum_w128;
sum_w108 = sum_w15 + sum_w16;
sum_w69 = sum_w29 + sum_w30;
sum_w138 = sum_w31 + sum_w32;
sum_w153 = sum_w35 + sum_w36;
sum_w137 = sum_w41 + sum_w42;
sum_w87 = sum_w43 + sum_w44;
sum_w102 = sum_w64 + sum_w65;
sum_w86 = sum_w80 + sum_w81;
sum_w109 = sum_w82 + sum_w83;
sum_w155 = temp_l83_i10_w1 + temp_l83_i11_w1;
sum_w156 = temp_l83_i12_w1 + temp_l83_i13_w1;
sum_w62 = temp_l83_i14_w1 + temp_l83_i15_w1;
sum_w63 = temp_l83_i16_w1 + temp_l83_i17_w1;
sum_w149 = temp_l83_i18_w1 + temp_l83_i19_w1;
sum_w117 = 0 + temp_l83_i1_w1;
sum_w150 = temp_l83_i20_w1 + temp_l83_i21_w1;
sum_w78 = temp_l83_i22_w1 + temp_l83_i23_w1;
sum_w79 = temp_l83_i24_w1 + temp_l83_i25_w1;
sum_w121 = temp_l83_i26_w1 + temp_l83_i27_w1;
sum_w122 = temp_l83_i28_w1 + temp_l83_i29_w1;
sum_w17 = temp_l83_i30_w1 + temp_l83_i31_w1;
sum_w18 = temp_l83_i32_w1 + temp_l83_i33_w1;
sum_w76 = temp_l83_i34_w1 + temp_l83_i35_w1;
sum_w77 = temp_l83_i36_w1 + temp_l83_i37_w1;
sum_w131 = temp_l83_i3950_w1 + temp_l83_i3951_w1;
sum_w132 = temp_l83_i3952_w1 + temp_l83_i3953_w1;
sum_w37 = temp_l83_i3954_w1 + temp_l83_i3955_w1;
sum_w38 = temp_l83_i3956_w1 + temp_l83_i3957_w1;
sum_w139 = temp_l83_i3958_w1 + temp_l83_i3959_w1;
sum_w140 = temp_l83_i3960_w1 + temp_l83_i3961_w1;
sum_w13 = temp_l83_i3962_w1 + temp_l83_i3963_w1;
sum_w14 = temp_l83_i3964_w1 + temp_l83_i3965_w1;
sum_w96 = temp_l83_i3966_w1 + temp_l83_i3967_w1;
sum_w97 = temp_l83_i3968_w1 + temp_l83_i3969_w1;
sum_w90 = temp_l83_i3970_w1 + temp_l83_i3971_w1;
sum_w91 = temp_l83_i3972_w1 + temp_l83_i3973_w1;
sum_w84 = temp_l83_i3974_w1 + temp_l83_i3975_w1;
sum_w85 = temp_l83_i3976_w1 + temp_l83_i3977_w1;
sum_w56 = temp_l83_i3978_w1 + temp_l83_i3979_w1;
sum_w57 = temp_l83_i3980_w1 + temp_l83_i3981_w1;
sum_w21 = temp_l83_i3982_w1 + temp_l83_i3983_w1;
sum_w22 = temp_l83_i3984_w1 + temp_l83_i3985_w1;
sum_w92 = temp_l83_i3986_w1 + temp_l83_i3987_w1;
sum_w93 = temp_l83_i3988_w1 + temp_l83_i3989_w1;
sum_w47 = temp_l83_i3990_w1 + temp_l83_i3991_w1;
sum_w48 = temp_l83_i3992_w1 + temp_l83_i3993_w1;
sum_w51 = temp_l83_i3994_w1 + temp_l83_i3995_w1;
sum_w52 = temp_l83_i3996_w1 + temp_l83_i3997_w1;
sum_w129 = temp_l83_i3998_w1 + temp_l83_i3999_w1;
sum_w7 = temp_l83_i38_w1 + temp_l83_i39_w1;
sum_w72 = temp_l83_i2_w1 + temp_l83_i3_w1;
sum_w8 = temp_l83_i40_w1 + temp_l83_i41_w1;
sum_w70 = temp_l83_i42_w1 + temp_l83_i43_w1;
sum_w71 = temp_l83_i44_w1 + temp_l83_i45_w1;
sum_w73 = temp_l83_i4_w1 + temp_l83_i5_w1;
sum_w111 = temp_l83_i6_w1 + temp_l83_i7_w1;
sum_w112 = temp_l83_i8_w1 + temp_l83_i9_w1;
sum_w147 = sum_w102 + sum_w103;
sum_w34 = sum_w108 + sum_w109;
sum_w123 = sum_w111 + sum_w112;
sum_w136 = sum_w121 + sum_w122;
sum_w28 = sum_w13 + sum_w14;
sum_w3 = sum_w131 + sum_w132;
sum_w5 = sum_w137 + sum_w138;
sum_w27 = sum_w139 + sum_w140;
sum_w10 = sum_w149 + sum_w150;
sum_w148 = sum_w153 + sum_w154;
sum_w124 = sum_w155 + sum_w156;
sum_w11 = sum_w17 + sum_w18;
sum_w58 = sum_w21 + sum_w22;
sum_w4 = sum_w37 + sum_w38;
sum_w151 = sum_w47 + sum_w48;
sum_w152 = sum_w51 + sum_w52;
sum_w134 = sum_w56 + sum_w57;
sum_w9 = sum_w62 + sum_w63;
sum_w6 = sum_w66 + sum_w67;
sum_w39 = sum_w7 + sum_w8;
sum_w40 = sum_w70 + sum_w71;
sum_w118 = sum_w72 + sum_w73;
sum_w12 = sum_w76 + sum_w77;
sum_w135 = sum_w78 + sum_w79;
sum_w133 = sum_w84 + sum_w85;
sum_w33 = sum_w86 + sum_w87;
sum_w54 = sum_w90 + sum_w91;
sum_w59 = sum_w92 + sum_w93;
sum_w23 = sum_w94 + sum_w95;
sum_w53 = sum_w96 + sum_w97;
sum_w98 = sum_w11 + sum_w12;
sum_w100 = sum_w117 + sum_w118;
sum_w101 = sum_w123 + sum_w124;
sum_w120 = sum_w133 + sum_w134;
sum_w144 = sum_w135 + sum_w136;
sum_w88 = sum_w147 + sum_w148;
sum_w20 = sum_w151 + sum_w152;
sum_w146 = sum_w27 + sum_w28;
sum_w145 = sum_w3 + sum_w4;
sum_w89 = sum_w33 + sum_w34;
sum_w99 = sum_w39 + sum_w40;
sum_w45 = sum_w5 + sum_w6;
sum_w119 = sum_w53 + sum_w54;
sum_w19 = sum_w58 + sum_w59;
sum_w143 = sum_w9 + sum_w10;
sum_w74 = sum_w100 + sum_w101;
sum_w2 = sum_w119 + sum_w120;
sum_w60 = sum_w143 + sum_w144;
sum_w1 = sum_w145 + sum_w146;
sum_w130 = sum_w19 + sum_w20;
sum_w25 = sum_w88 + sum_w89;
sum_w61 = sum_w98 + sum_w99;
sum_w141 = sum_w1 + sum_w2;
sum_w142 = sum_w130 + sum_w129;
sum_w75 = sum_w60 + sum_w61;
sum_w55 = sum_w141 + sum_w142;
sum_w49 = sum_w74 + sum_w75;
sum_w68 = sum_array_2[18] + sum_w55;
sum_w24 = sum_w69 + sum_w68;
sum_w46 = sum_w23 + sum_w24;
sum_w26 = sum_w45 + sum_w46;
sum_w50 = sum_w25 + sum_w26;
sum_w110 = sum_w49 + sum_w50;
*out = sum_w110 + temp_l83_i4000_w1;
}
void n4000_dotprod_parallel3(short x_0[45], short x_1[1344], short x_2[1344], short x_3[1216], short x_4[51], short y_0[45], short y_1[1344], short y_2[1344], short y_3[1216], short y_4[51], int *out) {
// Step 2: Initialize local variables
int sum_array_0[21];
int sum_array_1[21];
int sum_array_2[19];
#pragma HLS ARRAY_PARTITION variable=x_0 cyclic factor=45 dim=0
#pragma HLS ARRAY_PARTITION variable=x_1 cyclic factor=64 dim=0
#pragma HLS ARRAY_PARTITION variable=x_2 cyclic factor=64 dim=0
#pragma HLS ARRAY_PARTITION variable=x_3 cyclic factor=64 dim=0
#pragma HLS ARRAY_PARTITION variable=x_4 cyclic factor=51 dim=0
#pragma HLS ARRAY_PARTITION variable=y_0 cyclic factor=45 dim=0
#pragma HLS ARRAY_PARTITION variable=y_1 cyclic factor=64 dim=0
#pragma HLS ARRAY_PARTITION variable=y_2 cyclic factor=64 dim=0
#pragma HLS ARRAY_PARTITION variable=y_3 cyclic factor=64 dim=0
#pragma HLS ARRAY_PARTITION variable=y_4 cyclic factor=51 dim=0
#pragma HLS ARRAY_PARTITION variable=sum_array_0 cyclic factor=2 dim=0
#pragma HLS ARRAY_PARTITION variable=sum_array_1 cyclic factor=2 dim=0
#pragma HLS ARRAY_PARTITION variable=sum_array_2 cyclic factor=2 dim=0
// Initialization done
#pragma HLS dataflow
parallel_0(x_1,y_1,sum_array_0);
parallel_0(x_2,y_2,sum_array_1);
parallel_1(x_3,y_3,sum_array_2);
epilogue(sum_array_2,x_0,y_0,x_4,sum_array_1,y_4,sum_array_0,out);
}
|
the_stack_data/514424.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX_ANZAHL_TOUREN 100
struct datum {
int tag;
int monat;
int jahr;
};
struct daten{
char name[50];
int laenge;
int anzahl;
int hoehe;
};
struct radtour {
struct daten datentour;
struct datum datumtour;
};
struct radtour2 {
struct daten datentour;
struct datum datumtour;
};
int eingabeZahl(char* txt, int ug, int og, int *zahl) {
int ok = 0;
char s[100];
do{
if(ok){
printf(" Bitte geben sie eine zahl zwischen %d und %d ein", ug, og);
}
printf("%s", txt);
fgets(s, sizeof(s), stdin);
fflush(stdin);
if(s[0] == '<'){
return 0;
}
ok = sscanf(s, "%d", zahl);
ok &=(*zahl >= ug) && (*zahl <= og);
} while(!ok);
return 1;
}
int eingabeString(char *txt, char *texteingabe, int len) {
int ok = 1;
char s[100];
do{
if(!ok){
printf(" Ihre Eingabe ist zu lang. Bitte geben Sie einen Text mit maximal %d Zeichen ein \n", len);
}
printf("%s", txt);
fgets(s, len, stdin);
fflush(stdin);
if( s[0] == '<'){
return 0;
}
ok = (strlen(s) > 0) && (strlen(s) < (len-1));
}while(!ok);
strcpy(texteingabe, s);
texteingabe[strlen(s)-1] = '\0';
return 1;
}
int eingabedatum(struct datum *datumtour) {
int tag = 0;
int monat = 0;
int jahr = 0;
printf("\n\n\tBitte geben Sie das Datum der Tour ein: \n");
if(eingabeZahl("\nTag: ", 1, 31, &tag)){
if(eingabeZahl("\nMonat: ", 1, 12, &monat)){
if(eingabeZahl("\nJahr: ", 1, 2021, &jahr)){
datumtour->tag = tag;
datumtour->monat = monat;
datumtour->jahr = jahr;
return 1;
}
}
}
return 0;
}
int eingabedaten(struct daten *datentour, int anzahl) {
char nt[100];
int l = 0;
int f = 0;
int hm = 0;
printf("\n\n\tBitte tragen Sie nun die Daten Ihrer Tour ein: \n");
if(eingabeString("\nName der Tour: ", nt, 100)){
if(eingabeZahl("\nLänge in km: ", 0, 9999, &l)){
if(eingabeZahl("\nAnzahl der Fahrten: ", 0, 9999, &f)){
if(eingabeZahl("\nHöhenmeter der Strecke: ", 0, 9999, &hm)){
strcpy(datentour->name, nt);
datentour->laenge = l;
datentour->anzahl = f;
datentour->hoehe = hm;
return 1;
}
}
}
}
return 0;
}
int neuetour(struct radtour *tour, int *anzahl, int anzahl2) {
if(eingabedaten(&tour[*anzahl].datentour, anzahl2)){
if(eingabedatum(&tour[*anzahl].datumtour)){
*anzahl = *anzahl + 1;
return 1;
}
}
return 0;
}
void ausgabeTour(struct radtour tour[], int anzahl) {
printf("\nIhre Radtouren\n");
printf("============================================================================");
for(int i = 0; i < anzahl; i++){
printf("\n%d. \t%s %d %d %d | %d.%d.%d", i+1,
tour[i].datentour.name,
tour[i].datentour.laenge,
tour[i].datentour.anzahl,
tour[i].datentour.hoehe,
tour[i].datumtour.tag,
tour[i].datumtour.monat,
tour[i].datumtour.jahr);
}
}
void sortieren(struct radtour *radtouren, struct radtour *radtouren2, int anzahl) {
for(int i = 0; i < anzahl -1; i++){
for(int j = 0; j < anzahl -1 -i; j++){
if(strcmp(radtouren[j].datentour.name, radtouren[j + 1].datentour.name) > 0){
radtouren2[0] = radtouren[j];
radtouren[j] = radtouren[j + 1];
radtouren[j + 1] = radtouren2[0];
}
}
}
}
int suchen(struct radtour *tour, int anzahl) {
char tmp[100];
char tmp2[100];
char tmp3[5];
int merker = 0;
int merker2 = 0;
int i = 0;
eingabeString("\nSuche: ", tmp, 100);
do{
strncpy(tmp2, tour[i].datentour.name, strlen(tmp));
if(strcmp(tmp, tmp2) == 0){
printf("\nErgebnis: %s", tour[i].datentour.name);
merker ++;
i++;
merker2 = i;
} else {
i++;
}
} while(i != anzahl);
if(merker > 1){
printf("\nMehrere Ergebnisse, bitte genauer!\n");
return -1;
}
else if(merker == 0){
printf("\nKein Ergebniss, bitte wiederholen!\n");
return -1;
}
else if(merker == 1){
printf("\n\nBitte wählen Sie: ");
printf("\n====================");
printf("\nJ für bestätigen ");
printf("\nN für abbrechen ");
eingabeString("\n\nWahl:", tmp3, 5);
if (strcmp(tmp3, "J") == 0){
return merker2;
}
else if (strcmp(tmp3, "N") == 0){
return 0;
}
}
}
void durchschnitt(struct radtour *tour, int anzahl, double *durchschnitt) {
int ergebnis = 0;
for(int i = 0; i < anzahl; i++){
ergebnis = ergebnis + tour[i].datentour.laenge;
}
*durchschnitt = ergebnis/anzahl;
}
int main() {
struct radtour radtouren[MAX_ANZAHL_TOUREN]= {
{{"Radtour 1", 1000, 6, 350}, {11, 11, 2003}} ,
{{"Aadtour 2", 1500, 5, 567}, {24, 04, 2020}} ,
{{"Uadtour 3", 1000, 4, 350}, {1, 11, 2003}} ,
{{"Oadtour 4", 1600, 3, 567}, {23, 04, 2020}} ,
{{"Eadtour 5", 1500, 2, 567}, {23, 04, 2020}} ,
{{"Iadtour 6", 1500, 1, 567}, {23, 04, 2020}} ,
};
struct radtour radtouren2[MAX_ANZAHL_TOUREN]= {
};
int tourenanzahl = 6;
int n = 0;
int a = 0;
double durchsch = 0;
char tmp[100];
int tmp2 = 0;
int merker = 0;
do{
printf("\n\nMenue: ");
printf("\n1.........Tour hinzufügen:");
printf("\n2.........Touren ausgeben:");
printf("\n3............Tour löschen:");
printf("\n4.................Beenden:");
eingabeZahl("\n\nMenue-Auswahl: ", 1, 4, &a);
switch(a) {
case 1:
neuetour(radtouren, &tourenanzahl, tourenanzahl);
ausgabeTour(radtouren, tourenanzahl);
break;
case 2:
sortieren(radtouren, radtouren2, tourenanzahl);
durchschnitt(radtouren, tourenanzahl, &durchsch);
ausgabeTour(radtouren, tourenanzahl);
printf("\n\n Durchschnittliche Länge Ihrer Touren: %.3lf", durchsch);
break;
case 3:
do{
n = suchen(radtouren, tourenanzahl);
} while(n == (-1));
if(n == 0){
break;
}
for(int i = 0; i < tourenanzahl; i++, n++){
radtouren[n - 1] = radtouren[n];
}
tourenanzahl = tourenanzahl - 1;
ausgabeTour(radtouren, tourenanzahl);
break;
}
} while(a != 4);
printf("Programm beendet!");
return 0;
}
|
the_stack_data/12638389.c | #ifdef _WIN32
#define ENV_VAR "USERNAME"
#else
#define ENV_VAR "USER"
#endif
#include <stdlib.h>
#include <stdio.h>
#include <time.h>
char *feelings[] = {
"happy",
"sad",
"bored",
"angry",
"animosity",
"defensive",
"defiant",
"disturbed",
"exasperated",
"exploited",
"frustrated",
"hateful",
"hostile",
"intolerant",
"irrational",
"irritated",
"mad",
"provoked",
"reluctant",
"revengeful",
"stubborn",
"superior",
"uncomfortable",
"comfortable",
"apprehensive",
"bewildered",
"cautious",
"confused",
"discontent",
"distracted",
"hesitant",
"impatient",
"obligated",
"overwhelmed",
"surprised",
"suspicious",
"unsafe",
"safe",
"uneasy",
"unsure",
"sure",
"worried",
"apethic",
"ashamed",
"defeated",
"depressed",
"desperate",
"despondent",
"discouraged",
"forlorn",
"hopeless",
"hurt",
"inferior",
"insecure",
"lonely",
"misunderstood",
"afraid",
"anxious",
"fearful",
"helpless",
"hesitant",
"powerless",
"resentful",
"annoyed",
"agitated",
"disgusted",
"outraged",
"furious",
"seething",
"livid",
"bitter",
"timid",
"tense",
"threatened",
"frightened",
"intimidated",
"horrified",
"terrified",
"troubled",
"perplexed",
"disoriented",
"stunned",
"shocked",
"trapped",
"frozen",
"hysterical",
"paralyzed",
"down",
"gloomy",
"unhappy",
"awful",
"distressed",
"miserable",
"heartbroken",
"terrible",
"crushed",
"devestated",
"thirsty",
"hungry",
"tired",
"sore",
"shaky",
"sick",
"ill",
"impotent",
"frail",
"exhausted",
"stressed",
"fragile",
"vulnerable",
"defenseless",
"curious",
"clever",
"inquisitive",
"motivated",
"stimulated",
"active",
"energetic",
"intrigued",
"engaged",
"constructive",
"productive",
"creative",
"eager",
"bold",
"artistic",
"fascinated",
"confident",
"focused",
"determined",
"inspired",
"inventive",
"ambitious",
"absorbed",
"obsessed",
"helpful",
"attentive",
"considerate",
"loving",
"relaxed",
"glad",
"amused",
"cheerful",
"comical",
"silly",
"optimistic",
"alive",
"delighted",
"giggly",
"spontaneous",
"imaginative",
"whimsical",
"joyful",
"spirited",
"energized",
"excited",
"bouncy",
"lively",
"animated",
"elated",
"ecstatic",
"flirtatious",
"affectionate",
"tender",
"cuddly",
"frisky",
"romantic",
"amorous",
"aroused",
"desirous",
"stimulated",
"passionate",
"flustered",
"pleased",
"glad",
"grateful",
"content",
"enthusiastic",
"charmed",
"jealous",
"betrayed",
"blissful",
"fit",
"lustful",
"refreshed"
};
static unsigned int get_user_hash() {
char *user = getenv(ENV_VAR);
unsigned int result = 0;
for (int i = 0; user[i] != '\0'; i++) {
result += i * user[i];
}
return result;
}
static unsigned int get_day() {
unsigned long epoch = time(NULL);
unsigned int days = epoch / 86400;
return days;
}
static unsigned int get_seed() {
unsigned int user_hash = get_user_hash();
unsigned int day = get_day();
return user_hash * day;
}
int main(int argc, char *argv[]) {
unsigned int seed = get_seed();
srand(seed);
int count = sizeof(feelings) / sizeof(char *);
char *feeling = feelings[rand() % count];
printf("%s\n", feeling);
return 0;
} |
the_stack_data/153280.c |
/*
* SPDX-License-Identifier: MIT
* MIT License
*
* Copyright (c) 2019 Western Digital Corporation or its affiliates.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice (including the next paragraph) shall be included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
/* Defines */
#define D_MAX (2)
#define TEST_DATA_BASE_ADDR (0xC00A8000)
/* typedef */
typedef unsigned char U_08 ;
typedef unsigned short U_16 ;
typedef unsigned int U_32 ;
typedef struct
{
U_32 one : 1;
U_32 two : 1;
U_32 res : 30;
} S_FLAGS;
typedef struct
{
S_FLAGS flag;
U_32 res;
}S_FIRST, *S_FIRST_P;
typedef struct
{
S_FIRST Array[4];
S_FIRST_P Array_p[4];
U_32 var1;
U_08 var2;
U_08 var3;
} S_ENTRY;
typedef struct
{
S_ENTRY entries[0xff];
U_32 res;
}S_SECOND;
/* Globals */
S_SECOND G_For_test;
void *G_headerBuffers = (void*)TEST_DATA_BASE_ADDR;
static void * f_TestUnroll(unsigned outer, unsigned inner);
//Main
void main(int argc, char** argv)
{
void * ptr;
ptr = f_TestUnroll(2, 4);
ptr = f_TestUnroll(3, 4);
// checkpoint 1
// checkpoint 2
// checkpoint 3
}
__attribute__((noinline))
static void * f_TestUnroll(unsigned outer, unsigned inner)
{
U_32 index = 7;
U_32 i;
S_ENTRY *entry_p;
U_08 *headers_p;
U_32 k;
void *returnPtr;
headers_p = (U_08*)&G_headerBuffers;
for(i=0;i<outer;i++)
{
entry_p = &G_For_test.entries[index+i];
entry_p->var1 = 4;
entry_p->var2 = 0;
entry_p->var3 = 0x10;
for(k=0;k<inner;k++)
{
entry_p->Array_p[k] = (S_FIRST_P)(headers_p + sizeof(int)*(i*4+k));
entry_p->Array_p[k]->flag.one = 0;
}
}
return returnPtr;
}
|
the_stack_data/3636.c | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void fprocess(const char * pread, const char * pwrite) {
int status = 1; //so much wow, amazing var
char *wordToWrite = (char*) calloc(40, sizeof(char));
FILE *file;
file = fopen(pread, "r");
char *sentence = (char*) malloc(100 * sizeof(char));
while (fgets(sentence, 100, file) != NULL && status <= 4) {
char *word, *maxWord;
int maxLength = 0;
maxWord = (char*) calloc(40, sizeof(char));
word = (char*) calloc(40, sizeof(char));
word = strtok(sentence, " ");
while (word != NULL) {
if ((int) strlen(word) > maxLength) {
maxLength = strlen(word);
strcpy(maxWord, word);
}
word = strtok(NULL, " ");
}
if (status == 4) {
printf("%s\n", maxWord);
wordToWrite = maxWord;
}
maxLength = 0;
status++;
}
fclose(file);
file = fopen(pwrite, "w+");
fprintf(file, wordToWrite);
fclose(file);
}
int main(void) {
fprocess("temp.txt", "answer.txt");
return 0;
}
|
the_stack_data/29824363.c | /*BEGIN_LEGAL
Intel Open Source License
Copyright (c) 2002-2013 Intel Corporation. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer. Redistributions
in binary form must reproduce the above copyright notice, this list of
conditions and the following disclaimer in the documentation and/or
other materials provided with the distribution. Neither the name of
the Intel Corporation nor the names of its contributors may be used to
endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE INTEL OR
ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
END_LEGAL */
/*
* This test verifies that Pin can emulate a weird signal.
* The application sends itself an asynchronous signal, but
* uses a signal number that is normally a synchronous signal.
*/
#include <stdio.h>
#include <stdlib.h>
#include <signal.h>
#include <unistd.h>
static void Handle(int, siginfo_t *, void *);
int main()
{
struct sigaction act;
act.sa_sigaction = Handle;
act.sa_flags = SA_SIGINFO;
sigemptyset(&act.sa_mask);
if (sigaction(SIGFPE, &act, 0) != 0)
{
printf("Unable to set up FPE handler\n");
return 1;
}
kill(getpid(), SIGFPE);
/* should not return */
printf("Should not return from signal handler\n");
return 1;
}
static void Handle(int sig, siginfo_t *info, void *ctxt)
{
if (sig != SIGFPE)
{
printf("Got unexpected signal %d\n", sig);
exit(1);
}
if (info->si_code != 0)
{
printf("Expected si_code to be zero, but got %d\n", (int)info->si_code);
exit(1);
}
exit(0);
}
|
the_stack_data/57951719.c | /*
american fuzzy lop++ - a trivial program to test the build
--------------------------------------------------------
Originally written by Michal Zalewski
Copyright 2014 Google Inc. All rights reserved.
Copyright 2019-2020 AFLplusplus Project. All rights reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at:
http://www.apache.org/licenses/LICENSE-2.0
*/
#include <fcntl.h>
#include <stdarg.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#define IGNORED_RETURN(x) (void)!(x)
const uint32_t crc32_tab[] = {
0x00000000, 0x77073096, 0xee0e612c, 0x990951ba, 0x076dc419, 0x706af48f,
0xe963a535, 0x9e6495a3, 0x0edb8832, 0x79dcb8a4, 0xe0d5e91e, 0x97d2d988,
0x09b64c2b, 0x7eb17cbd, 0xe7b82d07, 0x90bf1d91, 0x1db71064, 0x6ab020f2,
0xf3b97148, 0x84be41de, 0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7,
0x136c9856, 0x646ba8c0, 0xfd62f97a, 0x8a65c9ec, 0x14015c4f, 0x63066cd9,
0xfa0f3d63, 0x8d080df5, 0x3b6e20c8, 0x4c69105e, 0xd56041e4, 0xa2677172,
0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b, 0x35b5a8fa, 0x42b2986c,
0xdbbbc9d6, 0xacbcf940, 0x32d86ce3, 0x45df5c75, 0xdcd60dcf, 0xabd13d59,
0x26d930ac, 0x51de003a, 0xc8d75180, 0xbfd06116, 0x21b4f4b5, 0x56b3c423,
0xcfba9599, 0xb8bda50f, 0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924,
0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d, 0x76dc4190, 0x01db7106,
0x98d220bc, 0xefd5102a, 0x71b18589, 0x06b6b51f, 0x9fbfe4a5, 0xe8b8d433,
0x7807c9a2, 0x0f00f934, 0x9609a88e, 0xe10e9818, 0x7f6a0dbb, 0x086d3d2d,
0x91646c97, 0xe6635c01, 0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e,
0x6c0695ed, 0x1b01a57b, 0x8208f4c1, 0xf50fc457, 0x65b0d9c6, 0x12b7e950,
0x8bbeb8ea, 0xfcb9887c, 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3, 0xfbd44c65,
0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2, 0x4adfa541, 0x3dd895d7,
0xa4d1c46d, 0xd3d6f4fb, 0x4369e96a, 0x346ed9fc, 0xad678846, 0xda60b8d0,
0x44042d73, 0x33031de5, 0xaa0a4c5f, 0xdd0d7cc9, 0x5005713c, 0x270241aa,
0xbe0b1010, 0xc90c2086, 0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f,
0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4, 0x59b33d17, 0x2eb40d81,
0xb7bd5c3b, 0xc0ba6cad, 0xedb88320, 0x9abfb3b6, 0x03b6e20c, 0x74b1d29a,
0xead54739, 0x9dd277af, 0x04db2615, 0x73dc1683, 0xe3630b12, 0x94643b84,
0x0d6d6a3e, 0x7a6a5aa8, 0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1,
0xf00f9344, 0x8708a3d2, 0x1e01f268, 0x6906c2fe, 0xf762575d, 0x806567cb,
0x196c3671, 0x6e6b06e7, 0xfed41b76, 0x89d32be0, 0x10da7a5a, 0x67dd4acc,
0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5, 0xd6d6a3e8, 0xa1d1937e,
0x38d8c2c4, 0x4fdff252, 0xd1bb67f1, 0xa6bc5767, 0x3fb506dd, 0x48b2364b,
0xd80d2bda, 0xaf0a1b4c, 0x36034af6, 0x41047a60, 0xdf60efc3, 0xa867df55,
0x316e8eef, 0x4669be79, 0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236,
0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f, 0xc5ba3bbe, 0xb2bd0b28,
0x2bb45a92, 0x5cb36a04, 0xc2d7ffa7, 0xb5d0cf31, 0x2cd99e8b, 0x5bdeae1d,
0x9b64c2b0, 0xec63f226, 0x756aa39c, 0x026d930a, 0x9c0906a9, 0xeb0e363f,
0x72076785, 0x05005713, 0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38,
0x92d28e9b, 0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21, 0x86d3d2d4, 0xf1d4e242,
0x68ddb3f8, 0x1fda836e, 0x81be16cd, 0xf6b9265b, 0x6fb077e1, 0x18b74777,
0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c, 0x8f659eff, 0xf862ae69,
0x616bffd3, 0x166ccf45, 0xa00ae278, 0xd70dd2ee, 0x4e048354, 0x3903b3c2,
0xa7672661, 0xd06016f7, 0x4969474d, 0x3e6e77db, 0xaed16a4a, 0xd9d65adc,
0x40df0b66, 0x37d83bf0, 0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9,
0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6, 0xbad03605, 0xcdd70693,
0x54de5729, 0x23d967bf, 0xb3667a2e, 0xc4614ab8, 0x5d681b02, 0x2a6f2b94,
0xb40bbe37, 0xc30c8ea1, 0x5a05df1b, 0x2d02ef8d
};
uint32_t
crc32(const void *buf, size_t size)
{
const uint8_t *p = buf;
uint32_t crc;
crc = ~0U;
while (size--)
crc = crc32_tab[(crc ^ *p++) & 0xFF] ^ (crc >> 8);
return crc ^ ~0U;
}
/*
* Don't you hate those contrived examples which CRC their data. We can use
* FRIDA to patch this function out and always return success. Otherwise, we
* could change it to actually correct the checksum.
*/
int crc32_check (char * buf, int len) {
if (len < sizeof(uint32_t)) { return 0; }
uint32_t expected = *(uint32_t *)&buf[len - sizeof(uint32_t)];
uint32_t calculated = crc32(buf, len - sizeof(uint32_t));
return expected == calculated;
}
/*
* So you've found a really boring bug in an earlier campaign which results in
* a NULL dereference or something like that. That bug can get in the way,
* causing the persistent loop to exit whenever it is triggered, and can also
* cloud your output unnecessarily. Again, we can use FRIDA to patch it out.
*/
void some_boring_bug(char c) {
switch (c) {
case 'A'...'Z':
case 'a'...'z':
__builtin_trap();
break;
}
}
extern void some_boring_bug2(char c);
__asm__ (
".text \n"
"some_boring_bug2: \n"
".global some_boring_bug2 \n"
".type some_boring_bug2, @function \n"
"mov %edi, %eax \n"
"cmp $0xb4, %al \n"
"jne ok \n"
"ud2 \n"
"ok: \n"
"ret \n");
void LLVMFuzzerTestOneInput(char *buf, int len) {
if (!crc32_check(buf, len)) return;
some_boring_bug(buf[0]);
some_boring_bug2(buf[0]);
if (buf[0] == '0') {
printf("Looks like a zero to me!\n");
}
else if (buf[0] == '1') {
printf("Pretty sure that is a one!\n");
}
else if (buf[0] == '2') {
printf("Oh we, weren't expecting that!");
__builtin_trap();
}
else
printf("Neither one or zero? How quaint!\n");
}
int main(int argc, char **argv) {
int fd = -1;
off_t len;
char * buf = NULL;
size_t n_read;
int result = -1;
if (argc != 2) { return 1; }
printf("Running: %s\n", argv[1]);
fd = open(argv[1], O_RDONLY);
if (fd < 0) { return 1; }
len = lseek(fd, 0, SEEK_END);
if (len < 0) { return 1; }
if (lseek(fd, 0, SEEK_SET) != 0) { return 1; }
buf = malloc(len);
if (buf == NULL) { return 1; }
n_read = read(fd, buf, len);
if (n_read != len) { return 1; }
printf("Running: %s: (%zd bytes)\n", argv[1], n_read);
LLVMFuzzerTestOneInput(buf, len);
printf("Done: %s: (%zd bytes)\n", argv[1], n_read);
return 0;
}
|
the_stack_data/104827174.c | /* Not needed, it's the same as wcstoul. */
|
the_stack_data/977423.c | /*-
* COPYRIGHT (C) 1986 Gary S. Brown. You may use this program, or
* code or tables extracted from it, as desired without restriction.
*/
/*
* First, the polynomial itself and its table of feedback terms. The
* polynomial is
* X^32+X^26+X^23+X^22+X^16+X^12+X^11+X^10+X^8+X^7+X^5+X^4+X^2+X^1+X^0
*
* Note that we take it "backwards" and put the highest-order term in
* the lowest-order bit. The X^32 term is "implied"; the LSB is the
* X^31 term, etc. The X^0 term (usually shown as "+1") results in
* the MSB being 1
*
* Note that the usual hardware shift register implementation, which
* is what we're using (we're merely optimizing it by doing eight-bit
* chunks at a time) shifts bits into the lowest-order term. In our
* implementation, that means shifting towards the right. Why do we
* do it this way? Because the calculated CRC must be transmitted in
* order from highest-order term to lowest-order term. UARTs transmit
* characters in order from LSB to MSB. By storing the CRC this way
* we hand it to the UART in the order low-byte to high-byte; the UART
* sends each low-bit to hight-bit; and the result is transmission bit
* by bit from highest- to lowest-order term without requiring any bit
* shuffling on our part. Reception works similarly
*
* The feedback terms table consists of 256, 32-bit entries. Notes
*
* The table can be generated at runtime if desired; code to do so
* is shown later. It might not be obvious, but the feedback
* terms simply represent the results of eight shift/xor opera
* tions for all combinations of data and CRC register values
*
* The values must be right-shifted by eight bits by the "updcrc
* logic; the shift must be unsigned (bring in zeroes). On some
* hardware you could probably optimize the shift in assembler by
* using byte-swap instructions
* polynomial $edb88320
*
*
* CRC32 code derived from work by Gary S. Brown.
*/
/* Code taken from FreeBSD 8 */
#include <stdint.h>
static uint32_t crc32_tab[] = {
0x00000000, 0x77073096, 0xee0e612c, 0x990951ba, 0x076dc419, 0x706af48f,
0xe963a535, 0x9e6495a3, 0x0edb8832, 0x79dcb8a4, 0xe0d5e91e, 0x97d2d988,
0x09b64c2b, 0x7eb17cbd, 0xe7b82d07, 0x90bf1d91, 0x1db71064, 0x6ab020f2,
0xf3b97148, 0x84be41de, 0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7,
0x136c9856, 0x646ba8c0, 0xfd62f97a, 0x8a65c9ec, 0x14015c4f, 0x63066cd9,
0xfa0f3d63, 0x8d080df5, 0x3b6e20c8, 0x4c69105e, 0xd56041e4, 0xa2677172,
0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b, 0x35b5a8fa, 0x42b2986c,
0xdbbbc9d6, 0xacbcf940, 0x32d86ce3, 0x45df5c75, 0xdcd60dcf, 0xabd13d59,
0x26d930ac, 0x51de003a, 0xc8d75180, 0xbfd06116, 0x21b4f4b5, 0x56b3c423,
0xcfba9599, 0xb8bda50f, 0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924,
0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d, 0x76dc4190, 0x01db7106,
0x98d220bc, 0xefd5102a, 0x71b18589, 0x06b6b51f, 0x9fbfe4a5, 0xe8b8d433,
0x7807c9a2, 0x0f00f934, 0x9609a88e, 0xe10e9818, 0x7f6a0dbb, 0x086d3d2d,
0x91646c97, 0xe6635c01, 0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e,
0x6c0695ed, 0x1b01a57b, 0x8208f4c1, 0xf50fc457, 0x65b0d9c6, 0x12b7e950,
0x8bbeb8ea, 0xfcb9887c, 0x62dd1ddf, 0x15da2d49, 0x8cd37cf3, 0xfbd44c65,
0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2, 0x4adfa541, 0x3dd895d7,
0xa4d1c46d, 0xd3d6f4fb, 0x4369e96a, 0x346ed9fc, 0xad678846, 0xda60b8d0,
0x44042d73, 0x33031de5, 0xaa0a4c5f, 0xdd0d7cc9, 0x5005713c, 0x270241aa,
0xbe0b1010, 0xc90c2086, 0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f,
0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4, 0x59b33d17, 0x2eb40d81,
0xb7bd5c3b, 0xc0ba6cad, 0xedb88320, 0x9abfb3b6, 0x03b6e20c, 0x74b1d29a,
0xead54739, 0x9dd277af, 0x04db2615, 0x73dc1683, 0xe3630b12, 0x94643b84,
0x0d6d6a3e, 0x7a6a5aa8, 0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1,
0xf00f9344, 0x8708a3d2, 0x1e01f268, 0x6906c2fe, 0xf762575d, 0x806567cb,
0x196c3671, 0x6e6b06e7, 0xfed41b76, 0x89d32be0, 0x10da7a5a, 0x67dd4acc,
0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5, 0xd6d6a3e8, 0xa1d1937e,
0x38d8c2c4, 0x4fdff252, 0xd1bb67f1, 0xa6bc5767, 0x3fb506dd, 0x48b2364b,
0xd80d2bda, 0xaf0a1b4c, 0x36034af6, 0x41047a60, 0xdf60efc3, 0xa867df55,
0x316e8eef, 0x4669be79, 0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236,
0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f, 0xc5ba3bbe, 0xb2bd0b28,
0x2bb45a92, 0x5cb36a04, 0xc2d7ffa7, 0xb5d0cf31, 0x2cd99e8b, 0x5bdeae1d,
0x9b64c2b0, 0xec63f226, 0x756aa39c, 0x026d930a, 0x9c0906a9, 0xeb0e363f,
0x72076785, 0x05005713, 0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38,
0x92d28e9b, 0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21, 0x86d3d2d4, 0xf1d4e242,
0x68ddb3f8, 0x1fda836e, 0x81be16cd, 0xf6b9265b, 0x6fb077e1, 0x18b74777,
0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c, 0x8f659eff, 0xf862ae69,
0x616bffd3, 0x166ccf45, 0xa00ae278, 0xd70dd2ee, 0x4e048354, 0x3903b3c2,
0xa7672661, 0xd06016f7, 0x4969474d, 0x3e6e77db, 0xaed16a4a, 0xd9d65adc,
0x40df0b66, 0x37d83bf0, 0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9,
0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6, 0xbad03605, 0xcdd70693,
0x54de5729, 0x23d967bf, 0xb3667a2e, 0xc4614ab8, 0x5d681b02, 0x2a6f2b94,
0xb40bbe37, 0xc30c8ea1, 0x5a05df1b, 0x2d02ef8d};
/*
* A function that calculates the CRC-32 based on the table above is
* given below for documentation purposes. An equivalent implementation
* of this function that's actually used in the kernel can be found
* in sys/libkern.h, where it can be inlined.
*/
uint32_t sparse_crc32(uint32_t crc_in, const void* buf, int size) {
const uint8_t* p = buf;
uint32_t crc;
crc = crc_in ^ ~0U;
while (size--) crc = crc32_tab[(crc ^ *p++) & 0xFF] ^ (crc >> 8);
return crc ^ ~0U;
}
|
the_stack_data/107952404.c | /*-
* Copyright (c) 1991, 1993, 1994
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* @(#) Copyright (c) 1991, 1993, 1994 The Regents of the University of California. All rights reserved.
* @(#)logname.c 8.2 (Berkeley) 4/3/94
*
* $DragonFly: src/usr.bin/logname/logname.c,v 1.5 2004/12/13 14:08:44 liamfoy Exp $
*/
#include <err.h>
#include <locale.h>
#include <unistd.h>
#include <stdio.h>
#include <stdlib.h>
static void usage(void);
int
main(int argc, char **argv)
{
int ch;
char *p;
setlocale(LC_ALL, "");
while ((ch = getopt(argc, argv, "")) != -1)
switch (ch) {
case '?':
default:
usage();
}
argc -= optind;
argv += optind;
if ((p = getlogin()) == NULL)
err(1, "getlogin failed");
printf("%s\n", p);
exit(0);
}
static void
usage(void)
{
fprintf(stderr, "usage: logname\n");
exit(1);
}
|
the_stack_data/1133395.c | // A basic clang -cc1 command-line. WebAssembly is somewhat special in
// enabling -fvisibility=hidden by default.
// RUN: %clang %s -### -no-canonical-prefixes -target wasm32-unknown-unknown 2>&1 \
// RUN: | FileCheck -check-prefix=CC1 %s
// CC1: clang{{.*}} "-cc1" "-triple" "wasm32-unknown-unknown" {{.*}} "-fvisibility" "hidden" {{.*}}
// Ditto, but ensure that a user -fvisibility=default disables the default
// -fvisibility=hidden.
// RUN: %clang %s -### -target wasm32-unknown-unknown -fvisibility=default 2>&1 \
// RUN: | FileCheck -check-prefix=FVISIBILITY_DEFAULT %s
// FVISIBILITY_DEFAULT-NOT: hidden
// A basic C link command-line with unknown OS.
// RUN: %clang -### -no-canonical-prefixes -target wasm32-unknown-unknown --sysroot=/foo %s 2>&1 \
// RUN: | FileCheck -check-prefix=LINK %s
// LINK: clang{{.*}}" "-cc1" {{.*}} "-o" "[[temp:[^"]*]]"
// LINK: wasm-ld{{.*}}" "-L/foo/lib" "crt1.o" "[[temp]]" "-lc" "{{.*[/\\]}}libclang_rt.builtins-wasm32.a" "-o" "a.out"
// A basic C link command-line with optimization with unknown OS.
// RUN: %clang -### -O2 -no-canonical-prefixes -target wasm32-unknown-unknown --sysroot=/foo %s 2>&1 \
// RUN: | FileCheck -check-prefix=LINK_OPT %s
// LINK_OPT: clang{{.*}}" "-cc1" {{.*}} "-o" "[[temp:[^"]*]]"
// LINK_OPT: wasm-ld{{.*}}" "-L/foo/lib" "crt1.o" "[[temp]]" "-lc" "{{.*[/\\]}}libclang_rt.builtins-wasm32.a" "-o" "a.out"
// A basic C link command-line with known OS.
// RUN: %clang -### -no-canonical-prefixes -target wasm32-wasi --sysroot=/foo %s 2>&1 \
// RUN: | FileCheck -check-prefix=LINK_KNOWN %s
// LINK_KNOWN: clang{{.*}}" "-cc1" {{.*}} "-o" "[[temp:[^"]*]]"
// LINK_KNOWN: wasm-ld{{.*}}" "-L/foo/lib/wasm32-wasi" "crt1.o" "[[temp]]" "-lc" "{{.*[/\\]}}libclang_rt.builtins-wasm32.a" "-o" "a.out"
// A basic C link command-line with optimization with known OS.
// RUN: %clang -### -O2 -no-canonical-prefixes -target wasm32-wasi --sysroot=/foo %s 2>&1 \
// RUN: | FileCheck -check-prefix=LINK_OPT_KNOWN %s
// LINK_OPT_KNOWN: clang{{.*}}" "-cc1" {{.*}} "-o" "[[temp:[^"]*]]"
// LINK_OPT_KNOWN: wasm-ld{{.*}}" "-L/foo/lib/wasm32-wasi" "crt1.o" "[[temp]]" "-lc" "{{.*[/\\]}}libclang_rt.builtins-wasm32.a" "-o" "a.out"
// A basic C compile command-line with known OS.
// RUN: %clang -### -no-canonical-prefixes -target wasm32-wasi --sysroot=/foo %s 2>&1 \
// RUN: | FileCheck -check-prefix=COMPILE %s
// COMPILE: clang{{.*}}" "-cc1" {{.*}} "-internal-isystem" "/foo/include/wasm32-wasi" "-internal-isystem" "/foo/include"
// Thread-related command line tests.
// '-pthread' sets +atomics, +bulk-memory, +mutable-globals, +sign-ext, and --shared-memory
// RUN: %clang -### -no-canonical-prefixes -target wasm32-unknown-unknown \
// RUN: --sysroot=/foo %s -fuse-ld=wasm-ld -pthread 2>&1 \
// RUN: | FileCheck -check-prefix=PTHREAD %s
// PTHREAD: clang{{.*}}" "-cc1" {{.*}} "-target-feature" "+atomics" "-target-feature" "+bulk-memory" "-target-feature" "+mutable-globals" "-target-feature" "+sign-ext"
// PTHREAD: wasm-ld{{.*}}" "-lpthread" "--shared-memory"
// '-pthread' not allowed with '-mno-atomics'
// RUN: %clang -### -no-canonical-prefixes -target wasm32-unknown-unknown \
// RUN: --sysroot=/foo %s -pthread -mno-atomics 2>&1 \
// RUN: | FileCheck -check-prefix=PTHREAD_NO_ATOMICS %s
// PTHREAD_NO_ATOMICS: invalid argument '-pthread' not allowed with '-mno-atomics'
// '-pthread' not allowed with '-mno-bulk-memory'
// RUN: %clang -### -no-canonical-prefixes -target wasm32-unknown-unknown \
// RUN: --sysroot=/foo %s -pthread -mno-bulk-memory 2>&1 \
// RUN: | FileCheck -check-prefix=PTHREAD_NO_BULK_MEM %s
// PTHREAD_NO_BULK_MEM: invalid argument '-pthread' not allowed with '-mno-bulk-memory'
// '-pthread' not allowed with '-mno-mutable-globals'
// RUN: %clang -### -no-canonical-prefixes -target wasm32-unknown-unknown \
// RUN: --sysroot=/foo %s -pthread -mno-mutable-globals 2>&1 \
// RUN: | FileCheck -check-prefix=PTHREAD_NO_MUT_GLOBALS %s
// PTHREAD_NO_MUT_GLOBALS: invalid argument '-pthread' not allowed with '-mno-mutable-globals'
// '-pthread' not allowed with '-mno-sign-ext'
// RUN: %clang -### -no-canonical-prefixes -target wasm32-unknown-unknown \
// RUN: --sysroot=/foo %s -pthread -mno-sign-ext 2>&1 \
// RUN: | FileCheck -check-prefix=PTHREAD_NO_SIGN_EXT %s
// PTHREAD_NO_SIGN_EXT: invalid argument '-pthread' not allowed with '-mno-sign-ext'
// '-mllvm -emscripten-cxx-exceptions-allowed=foo,bar' sets
// '-mllvm --force-attribute=foo:noinline -mllvm --force-attribute=bar:noinline'
// RUN: %clang -### -no-canonical-prefixes -target wasm32-unknown-unknown \
// RUN: --sysroot=/foo %s -mllvm -enable-emscripten-cxx-exceptions \
// RUN: -mllvm -emscripten-cxx-exceptions-allowed=foo,bar 2>&1 \
// RUN: | FileCheck -check-prefix=EMSCRIPTEN_EH_ALLOWED_NOINLINE %s
// EMSCRIPTEN_EH_ALLOWED_NOINLINE: clang{{.*}}" "-cc1" {{.*}} "-mllvm" "--force-attribute=foo:noinline" "-mllvm" "--force-attribute=bar:noinline"
// '-mllvm -emscripten-cxx-exceptions-allowed' only allowed with
// '-mllvm -enable-emscripten-cxx-exceptions'
// RUN: %clang -### -no-canonical-prefixes -target wasm32-unknown-unknown \
// RUN: --sysroot=/foo %s -mllvm -emscripten-cxx-exceptions-allowed 2>&1 \
// RUN: | FileCheck -check-prefix=EMSCRIPTEN_EH_ALLOWED_WO_ENABLE %s
// EMSCRIPTEN_EH_ALLOWED_WO_ENABLE: invalid argument '-mllvm -emscripten-cxx-exceptions-allowed' only allowed with '-mllvm -enable-emscripten-cxx-exceptions'
// '-fwasm-exceptions' sets +exception-handling and '-mllvm -wasm-enable-eh'
// RUN: %clang -### -no-canonical-prefixes -target wasm32-unknown-unknown \
// RUN: --sysroot=/foo %s -fwasm-exceptions 2>&1 \
// RUN: | FileCheck -check-prefix=WASM_EXCEPTIONS %s
// WASM_EXCEPTIONS: clang{{.*}}" "-cc1" {{.*}} "-target-feature" "+exception-handling" "-mllvm" "-wasm-enable-eh"
// '-fwasm-exceptions' not allowed with '-mno-exception-handling'
// RUN: %clang -### -no-canonical-prefixes -target wasm32-unknown-unknown \
// RUN: --sysroot=/foo %s -fwasm-exceptions -mno-exception-handling 2>&1 \
// RUN: | FileCheck -check-prefix=WASM_EXCEPTIONS_NO_EH %s
// WASM_EXCEPTIONS_NO_EH: invalid argument '-fwasm-exceptions' not allowed with '-mno-exception-handling'
// '-fwasm-exceptions' not allowed with '-mllvm -enable-emscripten-cxx-exceptions'
// RUN: %clang -### -no-canonical-prefixes -target wasm32-unknown-unknown \
// RUN: --sysroot=/foo %s -fwasm-exceptions \
// RUN: -mllvm -enable-emscripten-cxx-exceptions 2>&1 \
// RUN: | FileCheck -check-prefix=WASM_EXCEPTIONS_EMSCRIPTEN_EH %s
// WASM_EXCEPTIONS_EMSCRIPTEN_EH: invalid argument '-fwasm-exceptions' not allowed with '-mllvm -enable-emscripten-cxx-exceptions'
// '-mllvm -wasm-enable-sjlj' sets +exception-handling and
// '-exception-model=wasm'
// RUN: %clang -### -no-canonical-prefixes -target wasm32-unknown-unknown \
// RUN: --sysroot=/foo %s -mllvm -wasm-enable-sjlj 2>&1 \
// RUN: | FileCheck -check-prefix=WASM_SJLJ %s
// WASM_SJLJ: clang{{.*}}" "-cc1" {{.*}} "-target-feature" "+exception-handling" "-exception-model=wasm"
// '-mllvm -wasm-enable-sjlj' not allowed with '-mno-exception-handling'
// RUN: %clang -### -no-canonical-prefixes -target wasm32-unknown-unknown \
// RUN: --sysroot=/foo %s -mllvm -wasm-enable-sjlj -mno-exception-handling \
// RUN: 2>&1 \
// RUN: | FileCheck -check-prefix=WASM_SJLJ_NO_EH %s
// WASM_SJLJ_NO_EH: invalid argument '-mllvm -wasm-enable-sjlj' not allowed with '-mno-exception-handling'
// '-mllvm -wasm-enable-sjlj' not allowed with
// '-mllvm -enable-emscripten-cxx-exceptions'
// RUN: %clang -### -no-canonical-prefixes -target wasm32-unknown-unknown \
// RUN: --sysroot=/foo %s -mllvm -wasm-enable-sjlj \
// RUN: -mllvm -enable-emscripten-cxx-exceptions 2>&1 \
// RUN: | FileCheck -check-prefix=WASM_SJLJ_EMSCRIPTEN_EH %s
// WASM_SJLJ_EMSCRIPTEN_EH: invalid argument '-mllvm -wasm-enable-sjlj' not allowed with '-mllvm -enable-emscripten-cxx-exceptions'
// '-mllvm -wasm-enable-sjlj' not allowed with '-mllvm -enable-emscripten-sjlj'
// RUN: %clang -### -no-canonical-prefixes -target wasm32-unknown-unknown \
// RUN: --sysroot=/foo %s -mllvm -wasm-enable-sjlj \
// RUN: -mllvm -enable-emscripten-sjlj 2>&1 \
// RUN: | FileCheck -check-prefix=WASM_SJLJ_EMSCRIPTEN_SJLJ %s
// WASM_SJLJ_EMSCRIPTEN_SJLJ: invalid argument '-mllvm -wasm-enable-sjlj' not allowed with '-mllvm -enable-emscripten-sjlj'
// RUN: %clang %s -### -fsanitize=address -target wasm32-unknown-emscripten 2>&1 | FileCheck -check-prefix=CHECK-ASAN-EMSCRIPTEN %s
// CHECK-ASAN-EMSCRIPTEN: "-fsanitize=address"
// CHECK-ASAN-EMSCRIPTEN: "-fsanitize-address-globals-dead-stripping"
// Basic exec-model tests.
// RUN: %clang %s -### -no-canonical-prefixes -target wasm32-unknown-unknown --sysroot=%s/no-sysroot-there -mexec-model=command 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK-COMMAND %s
// CHECK-COMMAND: clang{{.*}}" "-cc1" {{.*}} "-o" "[[temp:[^"]*]]"
// CHECK-COMMAND: wasm-ld{{.*}}" "crt1.o" "[[temp]]" "-lc" "{{.*[/\\]}}libclang_rt.builtins-wasm32.a" "-o" "a.out"
// RUN: %clang %s -### -no-canonical-prefixes -target wasm32-unknown-unknown --sysroot=%s/no-sysroot-there -mexec-model=reactor 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK-REACTOR %s
// CHECK-REACTOR: clang{{.*}}" "-cc1" {{.*}} "-o" "[[temp:[^"]*]]"
// CHECK-REACTOR: wasm-ld{{.*}}" "crt1-reactor.o" "--entry" "_initialize" "[[temp]]" "-lc" "{{.*[/\\]}}libclang_rt.builtins-wasm32.a" "-o" "a.out"
// -fPIC implies +mutable-globals
// RUN: %clang %s -### -no-canonical-prefixes -target wasm32-unknown-unknown --sysroot=%s/no-sysroot-there -fPIC 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK-PIC %s
// CHECK-PIC: clang{{.*}}" "-cc1" {{.*}} "-target-feature" "+mutable-globals"
// '-mno-mutable-globals' is not allowed with '-fPIC'
// RUN: %clang %s -### -no-canonical-prefixes -target wasm32-unknown-unknown --sysroot=%s/no-sysroot-there -fPIC -mno-mutable-globals %s 2>&1 \
// RUN: | FileCheck -check-prefix=PIC_NO_MUTABLE_GLOBALS %s
// PIC_NO_MUTABLE_GLOBALS: error: invalid argument '-fPIC' not allowed with '-mno-mutable-globals'
|
the_stack_data/50137215.c | #include <math.h>
/* uses isin.as */
/* medium fast, interpolated routines */
/* This is faster than the Hi-Tech C trig functions
and for most values it is more accurate. However,
it is also bigger */
#define M_2_PI 6.2831853
#define M_PI_2 1.5707963
#define M_RECIP_16384 0.000061035156
int isin(unsigned degrees);
int icos(unsigned degrees);
double fpsin(double x)
{
static double z,t,flz;
static unsigned n;
z=x/M_2_PI;
z=360.*(z-floor(z));
t=z-(flz=floor(z));
n=(unsigned int)flz;
return M_RECIP_16384*((1-t)*isin(n)+t*isin(n+1));
}
double fpcos(double x)
{
return fpsin(M_PI_2-x);
}
double fptan(double x)
{
return fpsin(x)/fpsin(M_PI_2-x);
}
|
the_stack_data/11074466.c | // use-def elimination should have no effects
// same than use_def_elim12b but with cumulated effects
#include <stdlib.h>
int use_def_elim12c()
{
int r=0;
if (rand())
r = 1;
else
r = 0;
return r;
}
|
the_stack_data/303188.c | /**
******************************************************************************
* @file stm32l0xx_hal_cryp_ex.c
* @author MCD Application Team
* @brief CRYPEx HAL module driver.
*
* This file provides firmware functions to manage the following
* functionalities of the Cryptography (CRYP) extension peripheral:
* + Computation completed callback.
*
******************************************************************************
* @attention
*
* <h2><center>© Copyright(c) 2016 STMicroelectronics.
* All rights reserved.</center></h2>
*
* This software component is licensed by ST under BSD 3-Clause license,
* the "License"; You may not use this file except in compliance with the
* License. You may obtain a copy of the License at:
* opensource.org/licenses/BSD-3-Clause
*
******************************************************************************
*/
#if defined (STM32L021xx) || defined (STM32L041xx) || defined (STM32L061xx) || defined (STM32L062xx) || defined (STM32L063xx) || defined (STM32L081xx) || defined (STM32L082xx) || defined (STM32L083xx)
/* Includes ------------------------------------------------------------------*/
#include "stm32l0xx_hal.h"
/** @addtogroup STM32L0xx_HAL_Driver
* @{
*/
#ifdef HAL_CRYP_MODULE_ENABLED
/** @addtogroup CRYPEx
* @brief CRYP HAL Extended module driver.
* @{
*/
/* Private typedef -----------------------------------------------------------*/
/* Private define ------------------------------------------------------------*/
/* Private macro -------------------------------------------------------------*/
/* Private variables ---------------------------------------------------------*/
/* Private function prototypes -----------------------------------------------*/
/* Private functions ---------------------------------------------------------*/
/** @addtogroup CRYPEx_Exported_Functions
* @{
*/
/** @addtogroup CRYPEx_Exported_Functions_Group1
* @brief Extended features functions.
*
@verbatim
===============================================================================
##### Extended features functions #####
===============================================================================
[..] This section provides callback functions:
(+) Computation completed.
@endverbatim
* @{
*/
/**
* @brief Computation completed callbacks.
* @param hcryp pointer to a CRYP_HandleTypeDef structure that contains
* the configuration information for CRYP module
* @retval None
*/
__weak void HAL_CRYPEx_ComputationCpltCallback(CRYP_HandleTypeDef *hcryp)
{
/* Prevent unused argument(s) compilation warning */
UNUSED(hcryp);
/* NOTE : This function Should not be modified, when the callback is needed,
the HAL_CRYP_ComputationCpltCallback could be implemented in the user file
*/
}
/**
* @}
*/
/**
* @}
*/
/**
* @}
*/
#endif /* HAL_CRYP_MODULE_ENABLED */
/**
* @}
*/
#endif /* STM32L021xx || STM32L041xx || STM32L061xx || STM32L062xx || STM32L063xx || STM32L081xx || STM32L082xx || STM32L083xx */
/************************ (C) COPYRIGHT STMicroelectronics *****END OF FILE****/
|
the_stack_data/50138203.c | /* { dg-do compile } */
/* { dg-options "-O2 -fno-tree-dominator-opts -fdump-tree-store_copyprop-details" } */
/* LLVM LOCAL test not applicable */
/* { dg-require-fdump "" } */
typedef struct { int i; int j; } A;
int foo(A *a, int i)
{
a->i = i;
return a->i;
}
/* { dg-final { scan-tree-dump "return i" "store_copyprop" } } */
/* { dg-final { cleanup-tree-dump "store_copyprop" } } */
|
the_stack_data/15763109.c | #include <stdio.h>
#include <stdlib.h>
typedef struct pilha {
int *dados;
int N, p, u;
} fila;
int enfileira (fila *p, int x){
if (p->u <= p->N ){
if (p->u == p->N ){
p->dados = realloc(p->dados, 2*p->N*sizeof(int));
if (p->dados == NULL) exit(EXIT_FAILURE);
p->N*=2;
}
p->dados[p->u] = x;
p->u ++;
return 1;
}
else return 0;
}
|
the_stack_data/104828162.c | #include <stdio.h>
#include <string.h>
int main() {
int a = 0, e = 0, i = 0, o = 0, u = 0;
char str[666];
scanf("%s", str);
for (int j = 0; j < strlen(str); j++) {
if (str[j] == 'a')
a += 1;
if (str[j] == 'e')
e += 1;
if (str[j] == 'i')
i += 1;
if (str[j] == 'o')
o += 1;
if (str[j] == 'u')
u += 1;
}
printf("a:%d\ne:%d\ni:%d\no:%d\nu:%d", a, e, i, o, u);
return 0;
}
|
the_stack_data/142052.c | #include <alloca.h>
#include <stdio.h>
int main(void)
{
int* tab = alloca(3 * sizeof(int));
printf("tab[3] allocated on stack with alloca():\n");
for (int i = 0; i != 3; ++i) {
tab[i] = i;
printf("tab[%d] = %d\n", i, tab[i]);
}
return 0;
}
|
the_stack_data/1192849.c | #include <stdio.h>
int main()
{
int i,a,n,t,sum=0;
printf("input a and n:");
scanf("%d%d",&a,&n);
for(t=0,i=1;i<=n;i++)
{
t=t*10+a;
if(i==1)
printf("Sn=%d ",t);
else
printf("+ %d",t);
sum+=t;
}
printf(" = %d\n",sum);
return 0;
} |
the_stack_data/15762281.c | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdint.h>
#include <stdbool.h>
#include <ctype.h>
typedef struct {
char name[40];
int cnt;
int linkAl;
int al[32]; // count of allergian
} ingredient_t;
typedef struct {
char name[40];
int ingr[512];
} allergen_t;
ingredient_t ingredient[512];
int ingredientCount = 0;
allergen_t allergen[32];
int allergenCount = 0;
int findIngredient(char *ingr) {
for (int i = 0; i < ingredientCount; i++) {
if (strcmp(ingredient[i].name, ingr) == 0) {
ingredient[i].cnt++;
return i;
}
}
ingredient[ingredientCount].cnt = 1;
return ingredientCount++;
}
int findAllergen(char *allerg) {
for (int i = 0; i < allergenCount; i++) {
if (strcmp(allergen[i].name, allerg) == 0) {
return i;
}
}
return allergenCount++;
}
void read(char *buf) {
if (*buf != 0 && *buf != 10) {
char *b = buf;
b = strstr(b, "(contains ");
*b = 0;
b += 10;
int al[32];
int alCount = 0;
uint32_t mask = 0;
char *token = strtok(b, " ,)");
while (token != 0 && *token != 10) {
int id = findAllergen(token);
if (id >= 32) printf("32 are not enough"), exit(1);
al[alCount++] = id;
strncpy(allergen[id].name, token, sizeof allergen[0].name);
token = strtok(NULL, " ,)");
}
b = buf;
token = strtok(b, " ");
while (token != 0) {
int ingrIdx = findIngredient(token);
ingredient_t *ingr = &ingredient[ingrIdx];
strcpy(ingr->name, token);
for (int i = 0; i < alCount; i++) {
ingr->al[al[i]]++;
allergen[al[i]].ingr[ingrIdx]++;
}
token = strtok(NULL, " ");
}
}
}
int countAllerg(allergen_t *alerg, int comp) {
int result = 0;
for (int i = 0; i < ingredientCount; i++) {
if (alerg->ingr[i] >= comp) {
result++;
}
}
return result;
}
int countIngr(ingredient_t *ingr, int comp) {
int result = 0;
for (int i = 0; i < allergenCount; i++) {
if (ingr->al[i] >= comp) {
result++;
}
}
return result;
}
int compAl(const void *p1, const void *p2) {
int i = *(int*) p1, j = *(int*) p2;
return strcmp(allergen[ingredient[i].linkAl].name, allergen[ingredient[j].linkAl].name);
}
int main(void) {
FILE* f = fopen("input21.txt", "r");
if (f != NULL) {
char buf[1024];
int part = 0;
//memset(ingredient, 0xff, sizeof ingredient);
while (fgets(buf, sizeof buf, f) != NULL) {
read(buf);
}
fclose(f);
for (int times = 0; times < allergenCount; times++) {
for (int a = 0; a < allergenCount; a++) {
int max = 0;
int maxId = 0;
allergen_t *alerg = &allergen[a];
for (int i = 0; i < ingredientCount; i++) {
if (alerg->ingr[i] > max) {
max = alerg->ingr[i];
maxId = i;
}
}
if (max > 0 && countAllerg(alerg, alerg->ingr[maxId]) == 1) {
for (int i = 0; i < ingredientCount; i++) {
ingredient_t *ingr = &ingredient[i];
if (i != maxId) {
ingr->al[a] = 0;
alerg->ingr[i] = 0;
}
}
ingredient[maxId].linkAl = a;
for (int i = 0; i < allergenCount; i++) {
if (i != a) {
ingredient[maxId].al[i] = 0;
allergen[i].ingr[maxId] = 0;
}
}
}
}
}
int sum = 0;
int result[allergenCount];
int resultCount = 0;
for (int i = 0; i < ingredientCount; i++) {
ingredient_t *ingr = &ingredient[i];
int cnt = countIngr(ingr, 1);
if (cnt == 0) {
sum += ingr->cnt;
} else {
result[resultCount++] = i;
}
}
qsort(result, resultCount, sizeof result[0], compAl);
printf("part 1: sum of ingreediant counts without allergens %d\n", sum);
printf("part 2: ");
for (int i = 0; i < resultCount; i++) {
printf("%s,", ingredient[result[i]].name);
}
printf("\b \n");
}
return 0;
}
|
the_stack_data/225143764.c | #include <assert.h>
#include <string.h>
int balanced(const char *str) {
size_t length = strlen(str);
if (length % 2 == 1) return 0;
int index = -1;
for(int i=0; i < length; i++) {
if (str[i] == '(') {
index += 1;
continue;
}
if (index < 0 || str[index] != '(')
return 0;
index--;
}
return 1;
}
int main() {
assert(balanced("()()()") == 1);
assert(balanced("(())") == 1);
assert(balanced("(()") == 0);
assert(balanced("(())()") == 1);
assert(balanced("(") == 0);
assert(balanced("())(") == 0);
return 0;
}
|
the_stack_data/73061.c | /*
* $Id: patest_sine.c 1097 2006-08-26 08:27:53Z rossb $
*
* This program uses the PortAudio Portable Audio Library.
* For more information see: http://www.portaudio.com/
* Copyright (c) 1999-2000 Ross Bencina and Phil Burk
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files
* (the "Software"), to deal in the Software without restriction,
* including without limitation the rights to use, copy, modify, merge,
* publish, distribute, sublicense, and/or sell copies of the Software,
* and to permit persons to whom the Software is furnished to do so,
* subject to the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR
* ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
* CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
/*
* The text above constitutes the entire PortAudio license; however,
* the PortAudio community also makes the following non-binding requests:
*
* Any person wishing to distribute modifications to the Software is
* requested to send the modifications to the original developer so that
* they can be incorporated into the canonical version. It is also
* requested that these non-binding requests be included along with the
* license above.
*/
/** @file patest_sine_srate_mac.c
@ingroup test_src
@brief Plays sine waves at 44100 and 48000,
and forces the hardware to change if this is a mac.
Designed for use with CoreAudio.
@author Bjorn Roche <[email protected]>
@author Ross Bencina <[email protected]>
@author Phil Burk <[email protected]>
*/
#include <stdio.h>
#include <math.h>
#include "portaudio.h"
#ifdef __APPLE__
#include "pa_mac_core.h"
#endif
#define NUM_SECONDS (5)
#define SAMPLE_RATE1 (44100)
#define SAMPLE_RATE2 (48000)
#define FRAMES_PER_BUFFER (64)
#ifndef M_PI
#define M_PI (3.14159265)
#endif
#define TABLE_SIZE (200)
typedef struct
{
float sine[TABLE_SIZE];
int left_phase;
int right_phase;
}
paTestData;
/* This routine will be called by the PortAudio engine when audio is needed.
** It may called at interrupt level on some machines so don't do anything
** that could mess up the system like calling malloc() or free().
*/
static int patestCallback( const void *inputBuffer, void *outputBuffer,
unsigned long framesPerBuffer,
const PaStreamCallbackTimeInfo* timeInfo,
PaStreamCallbackFlags statusFlags,
void *userData )
{
paTestData *data = (paTestData*)userData;
float *out = (float*)outputBuffer;
unsigned long i;
(void) timeInfo; /* Prevent unused variable warnings. */
(void) statusFlags;
(void) inputBuffer;
for( i=0; i<framesPerBuffer; i++ )
{
*out++ = data->sine[data->left_phase]; /* left */
*out++ = data->sine[data->right_phase]; /* right */
data->left_phase += 1;
if( data->left_phase >= TABLE_SIZE ) data->left_phase -= TABLE_SIZE;
data->right_phase += 3; /* higher pitch so we can distinguish left and right. */
if( data->right_phase >= TABLE_SIZE ) data->right_phase -= TABLE_SIZE;
}
return paContinue;
}
/*******************************************************************/
int main(void);
int main(void)
{
PaStreamParameters outputParameters;
PaStream *stream;
PaError err;
paTestData data;
#ifdef __APPLE__
PaMacCoreStreamInfo macInfo;
#endif
int i;
/* initialise sinusoidal wavetable */
for( i=0; i<TABLE_SIZE; i++ )
{
data.sine[i] = (float) sin( ((double)i/(double)TABLE_SIZE) * M_PI * 2. );
}
data.left_phase = data.right_phase = 0;
err = Pa_Initialize();
if( err != paNoError ) goto error;
for( i=0; i<2; ++i ) {
const float sr = i ? SAMPLE_RATE2 : SAMPLE_RATE1;
printf("PortAudio Test: output sine wave. SR = %g, BufSize = %d\n", sr, FRAMES_PER_BUFFER);
outputParameters.device = Pa_GetDefaultOutputDevice(); /* default output device */
if (outputParameters.device == paNoDevice) {
fprintf(stderr,"Error: No default output device.\n");
goto error;
}
outputParameters.channelCount = 2; /* stereo output */
outputParameters.sampleFormat = paFloat32; /* 32 bit floating point output */
outputParameters.suggestedLatency = Pa_GetDeviceInfo( outputParameters.device )->defaultLowOutputLatency;
/** setup host specific info */
#ifdef __APPLE__
PaMacCore_SetupStreamInfo( &macInfo, paMacCorePro );
outputParameters.hostApiSpecificStreamInfo = &macInfo;
#else
printf( "Hardware SR changing not being tested on this platform.\n" );
outputParameters.hostApiSpecificStreamInfo = NULL;
#endif
err = Pa_OpenStream(
&stream,
NULL, /* no input */
&outputParameters,
sr,
FRAMES_PER_BUFFER,
paClipOff, /* we won't output out of range samples so don't bother clipping them */
patestCallback,
&data );
if( err != paNoError ) goto error;
err = Pa_StartStream( stream );
if( err != paNoError ) goto error;
printf("Play for %d seconds.\n", NUM_SECONDS );
Pa_Sleep( NUM_SECONDS * 1000 );
err = Pa_StopStream( stream );
if( err != paNoError ) goto error;
err = Pa_CloseStream( stream );
if( err != paNoError ) goto error;
}
Pa_Terminate();
printf("Test finished.\n");
return err;
error:
Pa_Terminate();
fprintf( stderr, "An error occurred while using the portaudio stream\n" );
fprintf( stderr, "Error number: %d\n", err );
fprintf( stderr, "Error message: %s\n", Pa_GetErrorText( err ) );
return err;
}
|
the_stack_data/218892275.c | #include <stdio.h>
long fibonacciRecursive(int n);
long fibonacciIterative(int n);
int main(void)
{
printf("%ld", fibonacciIterative(8));
// printf("%ld", fibonacciRecursive(8));
return 0;
}
long fibonacciRecursive(int n)
{
if (n == 0)
return 0;
if (n == 1)
return 1;
return fibonacciRecursive(n - 1) + fibonacciRecursive(n - 2);
}
long fibonacciIterative(int n)
{
long first = 0, second = 1;
long third;
if (n == 0)
return first;
int i = 2;
while (i <= n)
{
third = first + second;
first = second;
second = third;
i++;
}
return third;
}
|
the_stack_data/54727.c | /* Copyright (C) 2000 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
The GNU C Library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with the GNU C Library; if not, see
<http://www.gnu.org/licenses/>. */
#include <dlfcn.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int
main (void)
{
void *h;
const char *s;
/* Test that dlerror works initially. */
s = dlerror ();
printf ("dlerror() without prior dl*() call returned: %s\n", s);
if (s != NULL)
return 1;
h = dlopen ("errmsg1mod.so", RTLD_NOW);
if (h != NULL)
{
dlclose (h);
puts ("errmsg1mod.so could be loaded !?");
exit (1);
}
s = dlerror ();
puts (s);
return strstr (s, "errmsg1mod.so") == NULL;
}
|
the_stack_data/176704359.c | #include <stdio.h>
/**
* @brief Schreiben Sie ein Programm, das
* zwei ganze Zahlen von der Tastatur einliest
* und anschließend deren Summe, Differenz,
* Produkt, den Quotienten und den
* Divisionsrest auf dem Bildschirm ausgibt!
* Bedenken Sie dabei mögliche Sonderfälle!
*
* Die Eingabe beginnt immer wieder von vorne und bricht das
* Programm ab,sobald der Benutzer die Ziffer 0 als erste
* Zahl eingibt.
*
* @return int
*/
int main () {
int zahl1, zahl2;
for (;;) {
printf("Bitte geben Sie die erste Zahl ein (ganze Zahl):");
scanf("%d", &zahl1);
if(zahl1 == 0) {
break;
}
printf("Bitte geben Sie die zweite Zahl ein (ganze Zahl):");
scanf("%d", &zahl2);
if(zahl2 == 0) {
printf("/!\\ Eine Division durch 0 ist nicht moeglich.\nBitte versuchen Sie es erneut.\n\n");
continue;
}
printf("Die Summe von %d und %d ist: %d\n", zahl1, zahl2, zahl1 + zahl2);
printf("Die Differenz von %d und %d ist: %d\n", zahl1, zahl2, zahl1 - zahl2);
printf("Das Produkt von %d und %d ist: %d\n", zahl1, zahl2, zahl1 * zahl2);
printf("Der Quotient von %d und %d ist: %f\n", zahl1, zahl2, (float)zahl1 / zahl2);
// Achtung Falle:
// Sollte die Eingabe ein negatives Vorzeichen haben, würde eine einfache
// Modulo-Funktion einen falschen Wert liefern. Um korrekte Ergebnisse zu
// erzielen, muss der Modulo-Operand noch einmal addiert und anschließend
// durch erneute Modulo-Operation berechnet werden.
printf("Der Divisionsrest von %d und %d ist: %f\n\n", zahl1, zahl2, (float)(((zahl1 % zahl2) + zahl2) % zahl2));
}
return 0;
} |
the_stack_data/200142803.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/wait.h>
#define MAXSIZE 128
int main(void) {
int fd[2];
pid_t pid;
if (pipe(fd) != 0) {
printf("创建无名管道失败\n");
perror("pipe");
}
if ((pid = fork()) == -1) {
printf("创建子进程失败\n");
perror("fork");
} else if (pid == 0) { // 子进程发送数据
char msg[MAXSIZE];
printf("send msg: ");
fgets(msg, MAXSIZE, stdin);
close(fd[0]);
write(fd[1], msg, strlen(msg));
} else { // 父进程接收数据
char rec[MAXSIZE];
wait(NULL);
close(fd[1]);
read(fd[0], rec, sizeof(rec));
printf("receive msg: %s", rec);
}
return 0;
}
|
the_stack_data/93527.c | /*
* POJ 2413
* Sep 4, 2016
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
// #define DEBUG
#define N 102
char* add(char* a, char* b) {
char* temp = (char*)malloc(N * sizeof(char));
memset(temp, '0', N);
int i;
for(i = 0; i < N; i++) {
int _a = *(a + i) - '0';
int _b = *(b + i) - '0';
int _c = *(temp + i) - '0';
*(temp + i) = (_a + _b + _c) % 10 + '0';
*(temp + i + 1) = (_a + _b + _c) / 10 + '0';
}
return temp;
};
/*
* int compare(char* a, char* b)
*
* compare two positive numbers
* if(a>b) return 1;
* if(a<b) return -1;
* if(a==b) return 0;
*/
int compare(char* a, char* b) {
int i = 0;
for(i = N - 1; i >= 0; i--) {
if(a[i] > b[i]) {
return 1;
}
if(a[i] < b[i]) {
return -1;
}
}
return 0;
}
void print_num(char* a) {
int i = N - 1;
while(a[i] == '0') i--;
for(; i >=0; i--) {
printf("%c", a[i]);
}
printf("\n");
return;
}
int main() {
char** fibs = (char**)malloc(2 * sizeof(char*));
char* pivot = (char*)malloc(N * sizeof(char));
memset(pivot, '0', N);
pivot[N - 1] = '1';
#ifdef DEBUG
print_num(pivot);
#endif
*(fibs + 0) = (char*)malloc(N * sizeof(char));
*(fibs + 1) = (char*)malloc(N * sizeof(char));
memset(*(fibs + 0), '0', N);
memset(*(fibs + 1), '0', N);
**(fibs + 0) = '1';
**(fibs + 1) = '1';
int i = 1;
while(compare(pivot, *(fibs + i)) == 1) {
fibs = (char**)realloc(fibs, (i + 2) * sizeof(char*));
*(fibs + i + 1) = (char*)add(*(fibs + i), *(fibs + i - 1));
i++;
#ifdef DEBUG
print_num(*(fibs + i));
#endif
}
int fibs_length = i;
char input_a[N], input_b[N];
char* num_a = (char*)malloc(N * sizeof(char));
char* num_b = (char*)malloc(N * sizeof(char));
while(1) {
scanf("%s%s", input_a, input_b);
if(!(strcmp(input_a, "0") || strcmp(input_b, "0"))) {
break;
}
memset(num_a, '0', N);
memset(num_b, '0', N);
int len = strlen(input_a);
for(i = len - 1; i >= 0; i--) {
num_a[len - i - 1] = input_a[i];
}
len = strlen(input_b);
for(i = len - 1; i >= 0; i--) {
num_b[len - i - 1] = input_b[i];
}
#ifdef DEBUG
printf("input a: ");
print_num(num_a);
printf("input b: ");
print_num(num_b);
#endif
int pivot_a = 0;
int pivot_b = 0;
while(compare(num_a, *(fibs + pivot_a)) == 1 && pivot_a < fibs_length - 1) {
pivot_a++;
}
pivot_b = pivot_a;
while(compare(num_b, *(fibs + pivot_b)) != -1 && pivot_b < fibs_length - 1) {
pivot_b++;
}
#ifdef DEBUG
printf("pivot_a [%d], pivot_b [%d]\n", pivot_a, pivot_b);
#endif
// if(compare(num_b, *(fibs + pivot_b - 1)) == 0) {
// pivot_b++;
// #ifdef DEBUG
// printf("num_b equal\n");
// #endif
// }
if(pivot_a > 0 && compare(num_a, *(fibs + pivot_a - 1)) == 0) {
pivot_b++;
#ifdef DEBUG
printf("num_a equal\n");
#endif
}
if(pivot_b == 0) {
pivot_b = 2;
}
if(pivot_a == 0) {
pivot_a = 1;
}
printf("%d\n", pivot_b - pivot_a);
}
// for(i = 0; i < fibs_length; i++) {
// free(fibs[i]);
// }
// free(fibs);
// free(num_a);
// free(num_b);
// free(pivot);
return 0;
}
|
the_stack_data/28263042.c | #include <stdio.h>
#include <math.h>
#define RAD_TO_DEG (180/(4*atan(1)))
typedef struct polar_v
{
double magitude;
double angle;
} Polar_V;
typedef struct rect_v
{
double x;
double y;
} Rect_V;
Polar_V rect_to_polar(Rect_V);
int main(void){
Rect_V input;
Polar_V result;
puts("Enter x and y coordiantes; enter q to quit");
while (scanf("%lf %lf", &input.x, &input.y)){
result = rect_to_polar(input);
printf("magnitude = %0.2f, angle = %0.2f \n", result.magitude, result.angle);
}
puts("Bye.\n");
return 0;
}
Polar_V rect_to_polar(Rect_V rv){
Polar_V pv;
pv.magitude = sqrt(rv.x*rv.x + rv.y*rv.y);
if (pv.magitude == 0)
pv.angle = 0.0;
else
pv.angle = RAD_TO_DEG * atan2(rv.y, rv.x);
return pv;
} |
the_stack_data/98575075.c | // SPDX-License-Identifier: GPL-2.0
// Copyright (C) 2018 Hangzhou C-SKY Microsystems co.,ltd.
#include <linux/module.h>
EXPORT_SYMBOL(memcpy);
EXPORT_SYMBOL(memset);
EXPORT_SYMBOL(memcmp);
EXPORT_SYMBOL(memmove);
EXPORT_SYMBOL(strcmp);
EXPORT_SYMBOL(strcpy);
EXPORT_SYMBOL(strlen);
|
the_stack_data/36074602.c | /* John Carroll
COMP-1200
Spring 2012
Assignment 1a
program: hello
--------------------------------------------------------
This a simple program which prints a message to
welcome you to COMP-1200.
--------------------------------------------------------
*/
#include <stdio.h>
#include <math.h>
int main(void)
{
printf("Welcome to COMP %d \n", 60 * (int)(sqrt(400.0)) );
printf("\"War Eagle\"\n");
return 0;
} |
the_stack_data/556465.c | /* testinggit.c
*
* Copyright 2018 KiIIaWatt
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE X CONSORTIUM BE LIABLE FOR ANY
* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
* Except as contained in this notice, the name(s) of the above copyright
* holders shall not be used in advertising or otherwise to promote the sale,
* use or other dealings in this Software without prior written
* authorization.
*/
#include <stdio.h>
#include <stdlib.h>
int main(int argc, char *argv[])
{
printf ("Hello, World!\n");
return EXIT_SUCCESS;
}
|
the_stack_data/14200396.c |
/* Avoid warning about empty compilation unit. */
void oskeyring_macos_dummy() { }
#ifdef __APPLE__
#include <CoreFoundation/CoreFoundation.h>
#include <Security/Security.h>
#define R_NO_REMAP 1
#include "oskeyring.h"
#include "cleancall.h"
#include <R_ext/Rdynload.h>
#include <Rinternals.h>
#include <sys/param.h>
#include <string.h>
// ------------------------------------------------------------------------
// Conversion from SEXP to CF
// ------------------------------------------------------------------------
#define XDATESXP 1001
#define XPROTSXP 1002
CFStringRef cf_chr1(SEXP x) {
const char *cx = CHAR(STRING_ELT(x, 0));
CFStringRef cs = CFStringCreateWithCString(NULL, cx, kCFStringEncodingUTF8);
r_call_on_exit((finalizer_t) CFRelease, (void*) cs);
return cs;
}
CFBooleanRef cf_lgl1(SEXP x) {
if (LOGICAL(x)[0]) {
return kCFBooleanTrue;
} else {
return kCFBooleanFalse;
}
}
CFNumberRef cf_int1(SEXP x) {
CFNumberRef cn = CFNumberCreate(NULL, kCFNumberIntType, INTEGER(x));
r_call_on_exit((finalizer_t) CFRelease, (void*) cn);
return cn;
}
CFDataRef cf_raw(SEXP x) {
CFDataRef cd = CFDataCreate(NULL, RAW(x), LENGTH(x));
r_call_on_exit((finalizer_t) CFRelease, (void*) cd);
return cd;
}
// This is the number of seconds between the CFDate reference
// (2001-01-01) and the Unix reference (1970-01-01).
#define CF_DATE_OFFSET 978307200
CFDateRef cf_date(SEXP x) {
double t = REAL(x)[0];
CFAbsoluteTime cft = t - CF_DATE_OFFSET;
CFDateRef cd = CFDateCreate(NULL, cft);
r_call_on_exit((finalizer_t) CFRelease, (void*) cd);
return cd;
}
struct macos_attr_protocol_t {
CFStringRef cf_label;
const char *r_name;
};
#define MACOS_ATTR_PROTOCOL_NUM 32
static struct macos_attr_protocol_t protocols[MACOS_ATTR_PROTOCOL_NUM];
#define X(b,c) do { \
if (idx >= MACOS_ATTR_PROTOCOL_NUM) Rf_error("too many protocols"); \
protocols[idx].cf_label = (void*) kSecAttrProtocol ## b; \
protocols[idx++].r_name = c; \
} while (0) \
static void macos_init_protocol_list() {
if (protocols[0].cf_label != NULL) return;
int idx = 0;
X(FTP, "ftp");
X(FTPAccount, "ftp_account");
X(HTTP, "http");
X(IRC, "irc");
X(NNTP, "nntp");
X(POP3, "pop3");
X(SMTP, "smtp");
X(SOCKS, "socks");
X(IMAP, "imap");
X(LDAP, "ldap");
X(AppleTalk, "apple_talk");
X(AFP, "afp");
X(Telnet, "telnet");
X(SSH, "ssh");
X(FTPS, "ftps");
X(HTTPS, "https");
X(HTTPProxy, "http_proxy");
X(HTTPSProxy, "https_proxy");
X(FTPProxy, "ftp_proxy");
X(SMB, "smb");
X(RTSP, "rtsp");
X(RTSPProxy, "rtsp_proxy");
X(DAAP, "daap");
X(EPPC, "eppc");
X(IPP, "ipp");
X(NNTPS, "nntps");
X(LDAPS, "ldaps");
X(TelnetS, "telnets");
X(IMAPS, "imaps");
X(IRCS, "ircs");
X(POP3S, "pop3s");
protocols[idx++].cf_label = NULL;
}
#undef X
struct macos_attr_protocol_t *oskeyring_find_protocol(const char *name) {
int i, num = sizeof(protocols) / sizeof(struct macos_attr_protocol_t);
for (i = 0; i < num; i++) {
if (protocols[i].cf_label == NULL) break;
if (!strcasecmp(name, protocols[i].r_name)) return &protocols[i];
}
Rf_error("Unknown Keychain API Protocol attribute: `%s`", name);
}
struct macos_attr_protocol_t
*oskeyring_find_protocol_by_cf_label(CFStringRef label) {
int i, num = sizeof(protocols) / sizeof(struct macos_attr_protocol_t);
for (i = 0; i < num; i++) {
if (protocols[i].cf_label == NULL) break;
if (protocols[i].cf_label == label) return &protocols[i];
}
return NULL;
}
CFStringRef cf_prot(SEXP x) {
const char *chr = CHAR(STRING_ELT(x, 0));
struct macos_attr_protocol_t *rec = oskeyring_find_protocol(chr);
return rec->cf_label;
}
const void *cf_value(SEXPTYPE type, SEXP x) {
switch(type) {
case CHARSXP:
return cf_chr1(x);
break;
case INTSXP:
return cf_int1(x);
break;
case LGLSXP:
return cf_lgl1(x);
break;
case RAWSXP:
return cf_raw(x);
break;
case XDATESXP:
return cf_date(x);
break;
case XPROTSXP:
return cf_prot(x);
break;
default:
Rf_error("Unsupported attribute type in oskeyring");
break;
}
}
// ------------------------------------------------------------------------
// Conversion from CF to SEXP
// ------------------------------------------------------------------------
SEXP as_chr1(CFStringRef cs) {
if (cs == NULL) return(R_NilValue);
const char *cstr = CFStringGetCStringPtr(cs, kCFStringEncodingUTF8);
if (cstr != NULL) return Rf_ScalarString(Rf_mkCharCE(cstr, CE_UTF8));
CFIndex length = CFStringGetLength(cs);
CFIndex maxSize =
CFStringGetMaximumSizeForEncoding(length, kCFStringEncodingUTF8) + 1;
char *buffer = (char *) malloc(maxSize);
if (CFStringGetCString(cs, buffer, maxSize, kCFStringEncodingUTF8)) {
SEXP ret = Rf_ScalarString(Rf_mkCharCE(buffer, CE_UTF8));
free(buffer);
return ret;
} else {
free(buffer);
Rf_error("Failed to retrieve Keychain item attribute in UTF-8");
return R_NilValue;
}
}
SEXP as_lgl1(CFBooleanRef cb) {
return Rf_ScalarLogical(cb == kCFBooleanTrue);
}
SEXP as_int1(CFNumberRef cn) {
// Seems silly, but CF warns against integers stored as doubles...
double ret;
Boolean st = CFNumberGetValue(cn, kCFNumberDoubleType, &ret);
if (!st) Rf_warning("Lossy conversion of number in Keychain attribute");
return Rf_ScalarInteger((int) ret);
}
SEXP as_raw(CFDataRef cd) {
size_t len = CFDataGetLength(cd);
SEXP ret = PROTECT(Rf_allocVector(RAWSXP, len));
CFDataGetBytes(cd, CFRangeMake(0, len), RAW(ret));
UNPROTECT(1);
return ret;
}
SEXP as_date(CFDateRef cd) {
CFAbsoluteTime cft = CFDateGetAbsoluteTime(cd);
double t = cft + CF_DATE_OFFSET;
SEXP d = PROTECT(Rf_ScalarReal(t));
SEXP class = PROTECT(Rf_allocVector(STRSXP, 2));
SET_STRING_ELT(class, 0, Rf_mkCharCE("POSIXct", CE_UTF8));
SET_STRING_ELT(class, 1, Rf_mkCharCE("POSIXt", CE_UTF8));
Rf_setAttrib(d, R_ClassSymbol, class);
UNPROTECT(2);
return d;
}
SEXP as_prot(CFStringRef cs) {
struct macos_attr_protocol_t *rec =
oskeyring_find_protocol_by_cf_label(cs);
if (rec) {
return Rf_ScalarString(Rf_mkCharCE(rec->r_name, CE_UTF8));
} else {
return Rf_ScalarString(R_NaString);
}
}
SEXP as_sexp(SEXPTYPE type, const void *x) {
switch (type) {
case CHARSXP:
return as_chr1(x);
break;
case INTSXP:
return as_int1(x);
break;
case LGLSXP:
return as_lgl1(x);
break;
case RAWSXP:
return as_raw(x);
break;
case XDATESXP:
return as_date(x);
break;
case XPROTSXP:
return as_prot(x);
break;
default:
Rf_error("Internal oskeyring error, unsupported SEXPTYPE for attribute");
break;
}
}
// ------------------------------------------------------------------------
// Keychain item attributes
// ------------------------------------------------------------------------
#define S__GENERIC_PASSWORD "generic_password"
#define S__INTERNET_PASSWORD "internet_password"
struct macos_attr {
CFStringRef cf_label;
const char *r_name;
CFTypeID cf_type;
SEXPTYPE r_type;
};
#define OSKEYRING_MACOS_ATTR_NUM 20
static struct macos_attr macos_attr_list[OSKEYRING_MACOS_ATTR_NUM];
#define X(b,c,d,e) do { \
if (idx >= OSKEYRING_MACOS_ATTR_NUM) Rf_error("too many attr types"); \
macos_attr_list[idx].cf_label = (void*) kSecAttr ## b; \
macos_attr_list[idx].r_name = c; \
macos_attr_list[idx].cf_type = d; \
macos_attr_list[idx++].r_type = e; \
} while (0)
static void macos_init_attr_list() {
/* already initialized? */
if (macos_attr_list[0].cf_label != NULL) return;
int idx = 0;
X(Account, "account", CFStringGetTypeID(), CHARSXP);
X(AuthenticationType, "authentication_type", CFNumberGetTypeID(), INTSXP);
X(Comment, "comment", CFStringGetTypeID(), CHARSXP);
X(CreationDate, "creation_date", CFDateGetTypeID(), XDATESXP);
X(Description, "description", CFStringGetTypeID(), CHARSXP);
X(Generic, "generic", CFDataGetTypeID(), RAWSXP);
X(IsInvisible, "is_invisible", CFBooleanGetTypeID(), LGLSXP);
X(IsNegative, "is_negative", CFBooleanGetTypeID(), LGLSXP);
X(Label, "label", CFStringGetTypeID(), CHARSXP);
X(ModificationDate, "modification_date", CFDateGetTypeID(), XDATESXP);
X(Path, "path", CFStringGetTypeID(), CHARSXP);
X(Port, "port", CFNumberGetTypeID(), INTSXP);
X(Protocol, "protocol", CFStringGetTypeID(), XPROTSXP);
X(Service, "service", CFStringGetTypeID(), CHARSXP);
X(SecurityDomain, "security_domain", CFStringGetTypeID(), CHARSXP);
X(Server, "server", CFStringGetTypeID(), CHARSXP);
X(Synchronizable, "synchronizable", CFBooleanGetTypeID(), LGLSXP);
macos_attr_list[idx++].cf_label = NULL;
}
#undef X
struct macos_attr *oskeyring_find_attr(const char *name) {
int i, num = sizeof(macos_attr_list) / sizeof(struct macos_attr);
for (i = 0; i < num; i++) {
if (macos_attr_list[i].cf_label == NULL) break;
if (!strcmp(name, macos_attr_list[i].r_name)) return &macos_attr_list[i];
}
Rf_error("Unknown Keychain item attribute: `%s`", name);
}
struct macos_attr *oskeyring_find_attr_by_cf_label(CFStringRef label) {
int i, num = sizeof(macos_attr_list) / sizeof(struct macos_attr);
for (i = 0; i < num; i++) {
if (macos_attr_list[i].cf_label == NULL) break;
if (macos_attr_list[i].cf_label == label) return &macos_attr_list[i];
}
return NULL;
}
void oskeyring__add_class(CFMutableDictionaryRef query, SEXP class) {
const char *cclass = CHAR(STRING_ELT(class, 0));
if (!strcmp(S__GENERIC_PASSWORD, cclass)) {
CFDictionarySetValue(query, kSecClass, kSecClassGenericPassword);
} else if (!strcmp(S__INTERNET_PASSWORD, cclass)) {
CFDictionarySetValue(query, kSecClass, kSecClassInternetPassword);
} else {
Rf_error("Unknown Keychain item class: `%s`", cclass);
}
}
void oskeyring__add_attributes(CFMutableDictionaryRef query, SEXP attr) {
size_t i, n = LENGTH(attr);
SEXP nms = Rf_getAttrib(attr, R_NamesSymbol);
for (i = 0; i < n; i++) {
const char *name = CHAR(STRING_ELT(nms, i));
SEXP elt = VECTOR_ELT(attr, i);
struct macos_attr *rec = oskeyring_find_attr(name);
CFDictionarySetValue(query, rec->cf_label, cf_value(rec->r_type, elt));
}
}
void oskeyring__add_match_params(CFMutableDictionaryRef query, SEXP attr) {
size_t i, n = LENGTH(attr);
SEXP nms = Rf_getAttrib(attr, R_NamesSymbol);
// Default is all matching records
CFDictionarySetValue(query, kSecMatchLimit, kSecMatchLimitAll);
for (i = 0; i < n; i++) {
const char *name = CHAR(STRING_ELT(nms, i));
SEXP elt = VECTOR_ELT(attr, i);
if (!strcmp(name, "case_insensitive")) {
CFDictionarySetValue(query, kSecMatchCaseInsensitive, cf_value(LGLSXP, elt));
} else if (!strcmp(name, "diacritic_insensitive")) {
CFDictionarySetValue(query, kSecMatchDiacriticInsensitive, cf_value(LGLSXP, elt));
} else if (!strcmp(name, "width_insensitive")) {
CFDictionarySetValue(query, kSecMatchWidthInsensitive, cf_value(LGLSXP, elt));
} else if (!strcmp(name, "limit")) {
double val = -1;
if (Rf_isInteger(elt)) val = INTEGER(elt)[0];
if (Rf_isReal(elt)) val = REAL(elt)[0];
if (val <= 0) Rf_error("Invalid `limit` for Keychain search");
if (!R_FINITE(val)) {
CFDictionarySetValue(query, kSecMatchLimit, kSecMatchLimitAll);
} else {
CFDictionarySetValue(query, kSecMatchLimit,
cf_int1(Rf_coerceVector(elt, INTSXP)));
}
} else {
Rf_warning("Unknown keychain match parameter: `%s`", name);
}
}
}
// ------------------------------------------------------------------------
// Internal helpers
// ------------------------------------------------------------------------
const char *cf_string_to_char(CFStringRef cs) {
CFIndex length = CFStringGetLength(cs);
CFIndex maxSize =
CFStringGetMaximumSizeForEncoding(length, kCFStringEncodingUTF8) + 1;
char *buffer = R_alloc(maxSize, 1);
buffer[0] = '\0';
CFStringGetCString(cs, buffer, maxSize, kCFStringEncodingUTF8);
return buffer;
}
void oskeyring_macos_error(const char *func, OSStatus status) {
CFStringRef str = SecCopyErrorMessageString(status, NULL);
const char *buffer = cf_string_to_char(str);
if (buffer) {
Rf_error("oskeyring error (macOS Keychain), %s: %s", func, buffer);
} else {
Rf_error("oskeyring error (macOS Keychain), %s", func);
}
}
void oskeyring_macos_handle_status(const char *func, OSStatus status) {
if (status != errSecSuccess) oskeyring_macos_error(func, status);
}
SEXP oskeyring_as_item(SecKeychainItemRef item) {
CFDictionaryRef dict = (CFDictionaryRef) item;
CFStringRef cfclass = CFDictionaryGetValue(dict, kSecClass);
CFDataRef data = CFDictionaryGetValue(dict, kSecValueData);
char *class = 0;
const char *inms[] = { "class", "value", "attributes", "" };
SEXP ret = PROTECT(Rf_mkNamed(VECSXP, inms));
Rf_setAttrib(
ret,
R_ClassSymbol,
Rf_ScalarString(Rf_mkCharCE("oskeyring_macos_item", CE_UTF8))
);
if (cfclass == kSecClassGenericPassword) {
class = S__GENERIC_PASSWORD;
} else if (cfclass == kSecClassInternetPassword) {
class = S__INTERNET_PASSWORD;
} else {
Rf_error("Unknown Keychain item class");
}
SET_VECTOR_ELT(ret, 0, Rf_ScalarString(Rf_mkCharCE(class, CE_UTF8)));
if (data == NULL) {
SET_VECTOR_ELT(ret, 1, R_NilValue);
} else {
size_t len = CFDataGetLength(data);
SEXP rdata = PROTECT(Rf_allocVector(RAWSXP, len));
CFDataGetBytes(data, CFRangeMake(0, len), RAW(rdata));
SET_VECTOR_ELT(ret, 1, rdata);
UNPROTECT(1);
}
CFIndex i, rn = 0, n = CFDictionaryGetCount(dict);
CFTypeRef *keys = (CFTypeRef *) R_alloc(sizeof(CFTypeRef), n);
CFDictionaryGetKeysAndValues(dict, (const void **) keys, NULL);
for (i = 0; i < n; i++) {
struct macos_attr *rec = oskeyring_find_attr_by_cf_label(keys[i]);
rn += (rec != NULL);
}
SEXP attr = PROTECT(Rf_allocVector(VECSXP, rn));
SEXP attrnms = PROTECT(Rf_allocVector(STRSXP, rn));
Rf_setAttrib(attr, R_NamesSymbol, attrnms);
SET_VECTOR_ELT(ret, 2, attr);
UNPROTECT(2);
for (i = 0, rn = 0; i < n; i++) {
const CFStringRef key = keys[i];
if (key == kSecClass) continue;
struct macos_attr *rec = oskeyring_find_attr_by_cf_label(key);
if (rec == NULL) continue;
SET_STRING_ELT(attrnms, rn, Rf_mkCharCE(rec->r_name, CE_UTF8));
SET_VECTOR_ELT(attr, rn, as_sexp(rec->r_type, CFDictionaryGetValue(dict, key)));
rn++;
}
UNPROTECT(1);
return ret;
}
SEXP oskeyring_as_item_list(CFArrayRef arr) {
CFIndex i, num = CFArrayGetCount(arr);
SEXP result = PROTECT(Rf_allocVector(VECSXP, num));
for (i = 0; i < num; i++) {
SecKeychainItemRef item =
(SecKeychainItemRef) CFArrayGetValueAtIndex(arr, i);
SET_VECTOR_ELT(result, i, oskeyring_as_item(item));
}
UNPROTECT(1);
return result;
}
SecKeychainRef oskeyring_macos_open_keychain(const char *pathName, int fin) {
SecKeychainRef keychain;
# pragma GCC diagnostic push
# pragma GCC diagnostic ignored "-Wdeprecated-declarations"
OSStatus status = SecKeychainOpen(pathName, &keychain);
# pragma GCC diagnostic pop
oskeyring_macos_handle_status("cannot open keychain", status);
if (fin) r_call_on_exit((finalizer_t) CFRelease, (void*) keychain);
/* We need to query the status, because SecKeychainOpen succeeds,
even if the keychain file does not exists. (!) */
SecKeychainStatus keychainStatus = 0;
status = SecKeychainGetStatus(keychain, &keychainStatus);
oskeyring_macos_handle_status("cannot open keychain", status);
return keychain;
}
void oskeyring__add_keychain(CFMutableDictionaryRef query, SEXP keychain) {
if (!Rf_isNull(keychain)) {
const char *path = CHAR(STRING_ELT(keychain, 0));
SecKeychainRef chain = oskeyring_macos_open_keychain(path, 1);
CFDictionarySetValue(query, kSecUseKeychain, chain);
}
}
void oskeyring__add_keychain_list(CFMutableDictionaryRef query, SEXP keychain) {
if (!Rf_isNull(keychain)) {
const char *path = CHAR(STRING_ELT(keychain, 0));
SecKeychainRef chain = oskeyring_macos_open_keychain(path, 0);
const void *vals[1] = { chain };
CFArrayRef arr = CFArrayCreate(NULL, vals, 1, NULL);
r_call_on_exit((finalizer_t) CFRelease, (void*) arr);
CFDictionarySetValue(query, kSecMatchSearchList, arr);
}
}
// ------------------------------------------------------------------------
// API
// ------------------------------------------------------------------------
SEXP oskeyring_macos_add(SEXP item, SEXP keychain) {
CFMutableDictionaryRef query = CFDictionaryCreateMutable(
kCFAllocatorDefault, 0,
&kCFTypeDictionaryKeyCallBacks,
&kCFTypeDictionaryValueCallBacks);
r_call_on_exit((finalizer_t) CFRelease, (void*) query);
oskeyring__add_class(query, list_elt(item, "class"));
CFDictionarySetValue(query, kSecValueData, cf_raw(list_elt(item, "value")));
oskeyring__add_attributes(query, list_elt(item, "attributes"));
oskeyring__add_keychain(query, keychain);
OSStatus status = SecItemAdd(query, NULL);
oskeyring_macos_handle_status("cannot add keychain item", status);
return R_NilValue;
}
SEXP oskeyring_macos_search(SEXP class, SEXP attributes,
SEXP match, SEXP return_data,
SEXP keychain) {
CFMutableDictionaryRef query = CFDictionaryCreateMutable(
kCFAllocatorDefault, 0,
&kCFTypeDictionaryKeyCallBacks,
&kCFTypeDictionaryValueCallBacks);
r_call_on_exit((finalizer_t) CFRelease, (void*) query);
oskeyring__add_class(query, class);
oskeyring__add_attributes(query, attributes);
oskeyring__add_match_params(query, match);
oskeyring__add_keychain_list(query, keychain);
CFDictionarySetValue(query, kSecReturnData, kCFBooleanFalse);
CFDictionarySetValue(query, kSecReturnRef, kCFBooleanFalse);
CFDictionarySetValue(query, kSecReturnAttributes, kCFBooleanTrue);
if (LOGICAL(return_data)[0]) {
CFDictionarySetValue(query, kSecReturnData, kCFBooleanTrue);
}
CFArrayRef resArray = NULL;
OSStatus status = SecItemCopyMatching(query, (CFTypeRef*) &resArray);
/* If there are no matching elements, then SecItemCopyMatching
returns with an error, so we need work around that and return an
empty list instead. */
if (status == errSecItemNotFound) {
resArray = CFArrayCreate(NULL, NULL, 0, NULL);
} else if (status != errSecSuccess) {
if (resArray != NULL) CFRelease(resArray);
oskeyring_macos_handle_status("cannot list keychain items", status);
return NULL;
}
r_call_on_exit((finalizer_t) CFRelease, (void*) resArray);
if (CFGetTypeID(resArray) == CFArrayGetTypeID()) {
return oskeyring_as_item_list(resArray);
} else {
return oskeyring_as_item((SecKeychainItemRef) resArray);
}
}
SEXP oskeyring_macos_update(SEXP class, SEXP attributes,
SEXP match, SEXP update, SEXP keychain) {
CFMutableDictionaryRef query = CFDictionaryCreateMutable(
kCFAllocatorDefault, 0,
&kCFTypeDictionaryKeyCallBacks,
&kCFTypeDictionaryValueCallBacks);
r_call_on_exit((finalizer_t) CFRelease, (void*) query);
CFMutableDictionaryRef query_upd = CFDictionaryCreateMutable(
kCFAllocatorDefault, 0,
&kCFTypeDictionaryKeyCallBacks,
&kCFTypeDictionaryValueCallBacks);
r_call_on_exit((finalizer_t) CFRelease, (void*) query_upd);
oskeyring__add_class(query, class);
oskeyring__add_attributes(query, attributes);
oskeyring__add_match_params(query, match);
oskeyring__add_keychain(query, keychain);
oskeyring__add_attributes(query_upd, update);
OSStatus status = SecItemUpdate(query, query_upd);
oskeyring_macos_handle_status("cannot update keychain items", status);
return R_NilValue;
}
SEXP oskeyring_macos_delete(SEXP class, SEXP attributes,
SEXP match, SEXP keychain) {
CFMutableDictionaryRef query = CFDictionaryCreateMutable(
kCFAllocatorDefault, 0,
&kCFTypeDictionaryKeyCallBacks,
&kCFTypeDictionaryValueCallBacks);
r_call_on_exit((finalizer_t) CFRelease, (void*) query);
oskeyring__add_class(query, class);
oskeyring__add_attributes(query, attributes);
oskeyring__add_match_params(query, match);
oskeyring__add_keychain_list(query, keychain);
OSStatus status = SecItemDelete(query);
oskeyring_macos_handle_status("cannot delete keychain items", status);
return R_NilValue;
}
SEXP oskeyring_macos_keychain_create(SEXP keyring, SEXP password) {
const char *ckeyring = CHAR(STRING_ELT(keyring, 0));
const char *cpassword = CHAR(STRING_ELT(password, 0));
SecKeychainRef result = NULL;
# pragma GCC diagnostic push
# pragma GCC diagnostic ignored "-Wdeprecated-declarations"
OSStatus status = SecKeychainCreate(
ckeyring,
/* passwordLength = */ (UInt32) strlen(cpassword),
(const void*) cpassword,
/* promptUser = */ 0, /* initialAccess = */ NULL,
&result);
# pragma GCC diagnostic pop
oskeyring_macos_handle_status("cannot create keychain", status);
CFArrayRef keyrings = NULL;
status = SecKeychainCopyDomainSearchList(
kSecPreferencesDomainUser,
&keyrings);
if (status) {
# pragma GCC diagnostic push
# pragma GCC diagnostic ignored "-Wdeprecated-declarations"
SecKeychainDelete(result);
# pragma GCC diagnostic pop
if (result != NULL) CFRelease(result);
oskeyring_macos_handle_status("cannot create keychain", status);
}
/* We need to add the new keychain to the keychain search list,
otherwise applications like Keychain Access will not see it.
There is no API to append it, we need to query the current
search list, add it, and then set the whole new search list.
This is of course a race condition. :/ */
CFIndex count = CFArrayGetCount(keyrings);
CFMutableArrayRef newkeyrings =
CFArrayCreateMutableCopy(NULL, count + 1, keyrings);
CFArrayAppendValue(newkeyrings, result);
status = SecKeychainSetDomainSearchList(
kSecPreferencesDomainUser,
newkeyrings);
if (status) {
# pragma GCC diagnostic push
# pragma GCC diagnostic ignored "-Wdeprecated-declarations"
SecKeychainDelete(result);
# pragma GCC diagnostic pop
if (result) CFRelease(result);
if (keyrings) CFRelease(keyrings);
if (newkeyrings) CFRelease(newkeyrings);
oskeyring_macos_handle_status("cannot create keychain", status);
}
CFRelease(result);
CFRelease(keyrings);
CFRelease(newkeyrings);
return R_NilValue;
}
SEXP oskeyring_macos_keychain_list(SEXP domain) {
const char *cdomain = CHAR(STRING_ELT(domain, 0));
CFArrayRef chains = NULL;
OSStatus status;
if (!strcmp(cdomain, "all")) {
status = SecKeychainCopySearchList(&chains);
oskeyring_macos_handle_status("Cannot get keychain list", status);
} else {
SecPreferencesDomain mdomain;
if (!strcmp(cdomain, "user")) {
mdomain = kSecPreferencesDomainUser;
} else if (!strcmp(cdomain, "system")) {
mdomain = kSecPreferencesDomainSystem;
} else if (!strcmp(cdomain, "common")) {
mdomain = kSecPreferencesDomainCommon;
} else if (!strcmp(cdomain, "dynamic")) {
mdomain = kSecPreferencesDomainDynamic;
} else {
Rf_error("Unknown keychain domain: `%s`.", cdomain);
}
status = SecKeychainCopyDomainSearchList(mdomain, &chains);
oskeyring_macos_handle_status("Cannot get keychain list", status);
}
r_call_on_exit((finalizer_t) CFRelease, (void*) chains);
CFIndex i, n = CFArrayGetCount(chains);
SEXP result = PROTECT(Rf_allocVector(VECSXP, 4));
SET_VECTOR_ELT(result, 0, Rf_allocVector(STRSXP, n));
SET_VECTOR_ELT(result, 1, Rf_allocVector(LGLSXP, n));
SET_VECTOR_ELT(result, 2, Rf_allocVector(LGLSXP, n));
SET_VECTOR_ELT(result, 3, Rf_allocVector(LGLSXP, n));
for (i = 0; i < n; i++) {
SecKeychainRef chain = (SecKeychainRef) CFArrayGetValueAtIndex(chains, i);
UInt32 pathLength = MAXPATHLEN;
char pathName[MAXPATHLEN + 1];
# pragma GCC diagnostic push
# pragma GCC diagnostic ignored "-Wdeprecated-declarations"
status = SecKeychainGetPath(chain, &pathLength, pathName);
# pragma GCC diagnostic pop
oskeyring_macos_handle_status("Cannot get keychain path", status);
pathName[pathLength] = '\0';
SET_STRING_ELT(
VECTOR_ELT(result, 0), i,
Rf_mkCharLen(pathName, pathLength));
SecKeychainStatus cstat = 0;
status = SecKeychainGetStatus(chain, &cstat);
oskeyring_macos_handle_status("Cannot query keychain status", status);
LOGICAL(VECTOR_ELT(result, 1))[i] = cstat & kSecUnlockStateStatus;
LOGICAL(VECTOR_ELT(result, 2))[i] = cstat & kSecReadPermStatus;
LOGICAL(VECTOR_ELT(result, 3))[i] = cstat & kSecWritePermStatus;
}
UNPROTECT(1);
return result;
}
SEXP oskeyring_macos_keychain_delete(SEXP keyring) {
const char *ckeyring = CHAR(STRING_ELT(keyring, 0));
/* Need to remove it from the search list as well */
CFArrayRef keyrings = NULL;
OSStatus status = SecKeychainCopyDomainSearchList(
kSecPreferencesDomainUser,
&keyrings);
oskeyring_macos_handle_status("cannot delete keyring", status);
CFIndex i, count = CFArrayGetCount(keyrings);
CFMutableArrayRef newkeyrings =
CFArrayCreateMutableCopy(NULL, count, keyrings);
for (i = 0; i < count; i++) {
SecKeychainRef item =
(SecKeychainRef) CFArrayGetValueAtIndex(keyrings, i);
UInt32 pathLength = MAXPATHLEN;
char pathName[MAXPATHLEN + 1];
# pragma GCC diagnostic push
# pragma GCC diagnostic ignored "-Wdeprecated-declarations"
status = SecKeychainGetPath(item, &pathLength, pathName);
# pragma GCC diagnostic pop
pathName[pathLength] = '\0';
if (status) {
CFRelease(keyrings);
CFRelease(newkeyrings);
oskeyring_macos_handle_status("cannot delete keyring", status);
}
if (!strcmp(pathName, ckeyring)) {
CFArrayRemoveValueAtIndex(newkeyrings, (CFIndex) i);
status = SecKeychainSetDomainSearchList(
kSecPreferencesDomainUser,
newkeyrings);
if (status) {
CFRelease(keyrings);
CFRelease(newkeyrings);
oskeyring_macos_handle_status("cannot delete keyring", status);
}
}
}
/* If we haven't found it on the search list,
then we just keep silent about it ... */
CFRelease(keyrings);
CFRelease(newkeyrings);
/* And now remove the file as well... */
SecKeychainRef keychain = oskeyring_macos_open_keychain(ckeyring, 1);
# pragma GCC diagnostic push
# pragma GCC diagnostic ignored "-Wdeprecated-declarations"
status = SecKeychainDelete(keychain);
# pragma GCC diagnostic pop
oskeyring_macos_handle_status("cannot delete keyring", status);
return R_NilValue;
}
SEXP oskeyring_macos_keychain_lock(SEXP keyring) {
SecKeychainRef keychain =
Rf_isNull(keyring) ? NULL :
oskeyring_macos_open_keychain(CHAR(STRING_ELT(keyring, 0)), 1);
# pragma GCC diagnostic push
# pragma GCC diagnostic ignored "-Wdeprecated-declarations"
OSStatus status = SecKeychainLock(keychain);
# pragma GCC diagnostic pop
oskeyring_macos_handle_status("cannot lock keychain", status);
return R_NilValue;
}
SEXP oskeyring_macos_keychain_unlock(SEXP keyring, SEXP password) {
const char *cpassword = CHAR(STRING_ELT(password, 0));
SecKeychainRef keychain =
Rf_isNull(keyring) ? NULL :
oskeyring_macos_open_keychain(CHAR(STRING_ELT(keyring, 0)), 1);
# pragma GCC diagnostic push
# pragma GCC diagnostic ignored "-Wdeprecated-declarations"
OSStatus status = SecKeychainUnlock(
keychain,
(UInt32) strlen(cpassword),
(const void*) cpassword,
/* usePassword = */ TRUE);
# pragma GCC diagnostic pop
oskeyring_macos_handle_status("cannot unlock keychain", status);
return R_NilValue;
}
SEXP oskeyring_macos_keychain_is_locked(SEXP keyring) {
SecKeychainRef keychain =
Rf_isNull(keyring) ? NULL :
oskeyring_macos_open_keychain(CHAR(STRING_ELT(keyring, 0)), 1);
SecKeychainStatus kstatus;
OSStatus status = SecKeychainGetStatus(keychain, &kstatus);
if (status) oskeyring_macos_error("cannot get lock information", status);
return Rf_ScalarLogical(! (kstatus & kSecUnlockStateStatus));
}
#define REGISTER(method, args) \
{ #method, (DL_FUNC) &method, args }
static const R_CallMethodDef callMethods[] = {
REGISTER(oskeyring_macos_add, 2),
REGISTER(oskeyring_macos_search, 5),
REGISTER(oskeyring_macos_update, 5),
REGISTER(oskeyring_macos_delete, 4),
REGISTER(oskeyring_macos_keychain_create, 2),
REGISTER(oskeyring_macos_keychain_list, 1),
REGISTER(oskeyring_macos_keychain_delete, 1),
REGISTER(oskeyring_macos_keychain_lock, 1),
REGISTER(oskeyring_macos_keychain_unlock, 2),
REGISTER(oskeyring_macos_keychain_is_locked, 1),
CLEANCALL_METHOD_RECORD,
{ NULL, NULL, 0 }
};
void R_init_oskeyring(DllInfo *dll) {
R_registerRoutines(dll, NULL, callMethods, NULL, NULL);
R_useDynamicSymbols(dll, FALSE);
R_forceSymbols(dll, TRUE);
cleancall_init();
macos_init_attr_list();
macos_init_protocol_list();
}
#endif // __APPLE__
|
the_stack_data/1148656.c | #include <stdio.h>
#include <math.h>
int main(int argc, char const *argv[])
{
long long isbn;
do {
printf("Enter ISBN Number: ");
scanf("%lld", &isbn);
} while (isbn < 0);
int sum = 0;
for (int i = 10; i > 0; i--) {
sum += (isbn % 10) * i;
isbn /= 10;
}
(sum % 11 == 0) ? printf("Valid ISBN!\n") : printf("Invalid ISBN!!\n");
return 0;
}
|
the_stack_data/478356.c | #include <stdio.h>
#include <errno.h>
#include <string.h>
#include <ctype.h>
#include <math.h>
#define VERSION "1.2"
extern int adpcm_encode(FILE* fp, FILE* sad, int offset, int sample_len, int flag_loop);
enum{ monoF = (1 << 0), stereo = (1 << 1), loopF = (1 << 2) } sad_flag;
struct AdpcmHeader{
char id[4]; //"APCM"
unsigned char version;
unsigned char channels;
unsigned char loop;
unsigned char reserved;
unsigned int pitch;
unsigned int samples;
};
static int ConvertFile(const char *InputFile, const char *OutputFile, int flag_loop){
FILE *fp, *sad;
int sample_freq, sample_len, result;
char s[4];
int chunk_data;
short e;
char channels;
struct AdpcmHeader AdpcmHeader;
result=0;
if ( (fp = fopen(InputFile, "rb" )) != NULL )
{
if (fread( s, 1, 4, fp )!=4 || strncmp( s, "RIFF", 4 ) )
{
printf( "Error: Not a WAVE-file (\"RIFF\" identifier not found)\n" );
result=-3;
goto InputFileIOEnd;
}
fseek( fp, 8, SEEK_SET );
if (fread( s, 1, 4, fp )!=4 || strncmp( s, "WAVE", 4 ) )
{
printf( "Error: Not a WAVE-file (\"WAVE\" identifier not found)\n" );
result=-3;
goto InputFileIOEnd;
}
fseek( fp, 8 + 4, SEEK_SET );
if (fread( s, 1, 4, fp )!=4 || strncmp( s, "fmt", 3 ) )
{
printf( "Error: Not a WAVE-file (\"fmt\" chunk not found)\n" );
result=-3;
goto InputFileIOEnd;
}
if(fread( &chunk_data, 4, 1, fp )==1){
chunk_data += ftell( fp );
if (fread( &e, 2, 1, fp )!=1 || e != 1 )
{
printf( "Error: No PCM data in WAVE-file\n" );
result=-4;
goto InputFileIOEnd;
}
}
else{
printf( "Error: can't read CHUNK DATA in WAVE-file\n" );
result=-4;
goto InputFileIOEnd;
}
if (fread( &e, 2, 1, fp )!=1 || ((e != 1) && (e != 2)))
{
printf( "Error: WAVE file must be MONO or STEREO (max 2 channels)\n" );
result=-5;
goto InputFileIOEnd;
}
channels = e;
if(fread( &sample_freq, 4, 1, fp )==1){
fseek( fp, 4 + 2, SEEK_CUR );
if (fread( &e, 2, 1, fp )!=1 || e != 16 )
{
printf( "Error: WAVE-file must 16 bit\n" );
result=-6;
goto InputFileIOEnd;
}
}
else{
printf("Error: Can't read SAMPLE FREQUENCY in WAVE-file\n");
result=-6;
goto InputFileIOEnd;
}
fseek( fp, chunk_data, SEEK_SET );
if(fread( s, 1, 4, fp )==4){
// Skip 'fact' and possibly other chunks
while(strncmp( s, "data", 4 ))
{
if(fread( &chunk_data, 4, 1, fp )==1){
chunk_data += ftell( fp );
fseek( fp, chunk_data, SEEK_SET );
if(fread( s, 1, 4, fp )!=4){
printf("Error: Read error in WAVE-file\n");
result=-6;
goto InputFileIOEnd;
}
}
else{
printf("Error: Read error in WAVE-file\n");
result=-6;
goto InputFileIOEnd;
}
}
}
else{
printf("Error: Read error in WAVE-file\n");
result=-6;
goto InputFileIOEnd;
}
if(fread( &sample_len, 4, 1, fp )==1){
sample_len /= (channels*2);
}
else{
printf("Error: Can't read SAMPLE LENGTH in WAVE-file\n");
result=-6;
goto InputFileIOEnd;
}
if ( (sad = fopen(OutputFile, "wb" )) != NULL )
{
strncpy(AdpcmHeader.id, "APCM", 4);
AdpcmHeader.version=1;
AdpcmHeader.channels=channels;
AdpcmHeader.loop=flag_loop;
AdpcmHeader.reserved=0;
AdpcmHeader.pitch=(sample_freq*4096)/48000; // pitch, to encode for PS1 change 48000 to 44100
AdpcmHeader.samples=sample_len;
fwrite(&AdpcmHeader, sizeof(AdpcmHeader), 1, sad);
if(channels == 1)
{
result=adpcm_encode(fp, sad, 0, sample_len, flag_loop);
}
else
{
int data_offset = ftell(fp);
// Encode left
if((result=adpcm_encode(fp, sad, 2, sample_len, flag_loop))==0){
fseek(fp, data_offset+2, SEEK_SET);
// Encode right
result=adpcm_encode(fp, sad, 2, sample_len, flag_loop);
}
}
fclose(sad);
}
else
{
printf( "Error: Can't write output file %s\n", OutputFile);
result=EIO;
}
InputFileIOEnd:
fclose(fp);
}
else
{
printf( "Error: Can't open %s\n", InputFile);
result=ENOENT;
}
return result;
}
int main( int argc, char *argv[] )
{
int result;
if( argc == 4)
{
if( strncmp( argv[1], "-L", 2 ) )
{
printf("Error: Option '%s' not recognized\n", argv[1]);
result=EINVAL;
}
else
{
result=ConvertFile(argv[2], argv[3], 1);
}
}
else if(argc == 3)
{
result=ConvertFile(argv[1], argv[2], 0);
}
else
{
printf( "ADPCM Encoder %s\n"
"Usage: sadenc [-L] <input wave> <output sad>\n"
"Options:\n"
" -L Loop\n", VERSION);
result=EINVAL;
}
return result;
}
|
the_stack_data/697946.c | #include <ctype.h>
#include <stdio.h>
#include <string.h>
#define FLT_UNDEF -12345.0
int g56_dist(char *line, float *delta)
{
int i, j;
char sdist[10];
int idelta;
*delta = FLT_UNDEF;
i = 0; /* index for line */
/* if first character of string is not a digit [0-9] exit function */
if (! isdigit(line[i])) {
fprintf(stderr, "g56_dist error: ");
fprintf(stderr, "first character of distance must be a number:\n%s", line);
return -1;
}
/* Distance:
value from 0 to 180 degrees; precision - 1/10 of a degree */
/* Common errors: S instead of 5 (or 8) and i instead of 1 */
j = i;
while (! isspace(line[j])) {
if (line[j] == 'i') line[j] = '1';
if (line[j] == 'S') line[j] = '5';
j++;
}
/* Find first non-digit character of epicentral distance */
j = 0; /* index for sdist */
while (isdigit(line[i])) {
sdist[j++] = line[i++];
}
if (j > 4) {
fprintf(stderr, "g56_dist error: ");
fprintf(stderr, "wrong epicentral distance:\n%s", line);
return -1;
}
/* Find decimal point (or common OCR errors) and ignore */
if (line[i] == '.' || line[i] == '-' || line[i] == ':' || line[i] == '\'') {
i++;
if (isdigit(line[i]) && isspace(line[i+1])) {
sdist[j++] = line[i++];
sdist[j] = '\0';
} else if (line[i] == 'i' && isspace(line[i+1])) {
sdist[j++] = '1';
i++;
sdist[j] = '\0';
} else {
fprintf(stderr, "g56_dist error: ");
fprintf(stderr, "wrong format for epicentral distance:\n%s", line);
return -1;
}
} else if (isspace(line[i])) {
sdist[j] = '\0';
} else {
fprintf(stderr, "g56_dist error: ");
fprintf(stderr, "invalid character in epicentral distance:\n%s", line);
return -1;
}
sscanf(sdist, "%d", &idelta);
if (idelta > 1800 || idelta < 0) {
fprintf(stderr, "g56_dist error: ");
fprintf(stderr, "epicentral distance out of range:\n%s", line);
return -1;
}
*delta = (float)idelta/10.0;
/* now i indicates position of tab between delta and azimuth
or first blank space between delta and azimuth */
while(isspace(line[i]))
i++;
if (! isdigit(line[i]) && line[i] != 'S') {
fprintf(stderr, "g56_dist error: ");
fprintf(stderr, "first character of azimuth must be a number:\n%s", line);
return -1;
}
return i;
}
|
the_stack_data/110149.c | /* { dg-do run } */
/* { dg-options "-O2 -fno-reorder-blocks" } */
void abort ();
__attribute__((noinline, noclone)) int
restore (int a, int b)
{
return a * b;
}
__attribute__((noinline, noclone)) void
do_nothing (int *input)
{
*input = restore (*input, 1);
return;
}
#define CASE_ENTRY(n) \
case n: \
sum = sum / (n + 1); \
sum = restore (sum, n + 1); \
if (sum == (n + addend)) \
break;\
sum = sum / (n + 2); \
sum = restore (sum, n + 2); \
sum = sum / (n + 3); \
sum = restore (sum, n + 3); \
sum = sum / (n + 4); \
sum = restore (sum, n + 4); \
sum = sum / (n + 5); \
sum = restore (sum, n + 5); \
sum = sum / (n + 6); \
sum = restore (sum, n + 6); \
sum = sum / (n + 7); \
sum = restore (sum, n + 7); \
sum = sum / (n + 8); \
sum = restore (sum, n + 8); \
sum = sum / (n + 9); \
sum = restore (sum, n + 9); \
sum = sum / (n + 10); \
sum = restore (sum, n + 10); \
sum = sum / (n + 11); \
sum = restore (sum, n + 11); \
sum = sum / (n + 12); \
sum = restore (sum, n + 12); \
sum = sum / (n + 13); \
sum = restore (sum, n + 13); \
sum = sum / (n + 14); \
sum = restore (sum, n + 14); \
sum = sum / (n + 15); \
sum = restore (sum, n + 15); \
sum = sum / (n + 16); \
sum = restore (sum, n + 16); \
sum = sum / (n + 17); \
sum = restore (sum, n + 17); \
sum = sum / (n + 18); \
sum = restore (sum, n + 18); \
sum = sum / (n + 19); \
sum = restore (sum, n + 19); \
sum = sum / (n + 20); \
sum = restore (sum, n + 20); \
sum = sum / (n + 21); \
sum = restore (sum, n + 21); \
sum = sum / (n + 22); \
sum = restore (sum, n + 22); \
sum = sum / (n + 23); \
sum = restore (sum, n + 23); \
sum = sum / (n + 24); \
sum = restore (sum, n + 24); \
sum = sum / (n + 25); \
sum = restore (sum, n + 25); \
sum = sum / (n + 26); \
sum = restore (sum, n + 26); \
sum = sum / (n + 27); \
sum = restore (sum, n + 27); \
sum = sum / (n + 28); \
sum = restore (sum, n + 28); \
sum = sum / (n + 29); \
sum = restore (sum, n + 29); \
sum = sum / (n + 30); \
sum = restore (sum, n + 30); \
sum = sum / (n + 31); \
sum = restore (sum, n + 31); \
sum = sum / (n + 32); \
sum = restore (sum, n + 32); \
sum = sum / (n + 33); \
sum = restore (sum, n + 33); \
sum = sum / (n + 34); \
sum = restore (sum, n + 34); \
sum = sum / (n + 35); \
sum = restore (sum, n + 35); \
sum = sum / (n + 36); \
sum = restore (sum, n + 36); \
break;
__attribute__((noinline, noclone)) long long
test_and_branch (int selector, int addend)
{
long long sum = selector + 1;
if (selector > 64)
{
start:
return sum - 1;
}
else
{
switch (selector)
{
CASE_ENTRY (1)
CASE_ENTRY (2)
CASE_ENTRY (3)
CASE_ENTRY (4)
CASE_ENTRY (5)
CASE_ENTRY (6)
CASE_ENTRY (7)
CASE_ENTRY (8)
CASE_ENTRY (9)
CASE_ENTRY (10)
CASE_ENTRY (11)
CASE_ENTRY (12)
CASE_ENTRY (13)
CASE_ENTRY (14)
CASE_ENTRY (15)
CASE_ENTRY (16)
CASE_ENTRY (17)
CASE_ENTRY (18)
CASE_ENTRY (19)
CASE_ENTRY (20)
CASE_ENTRY (21)
CASE_ENTRY (22)
CASE_ENTRY (23)
CASE_ENTRY (24)
CASE_ENTRY (25)
CASE_ENTRY (26)
CASE_ENTRY (27)
CASE_ENTRY (28)
CASE_ENTRY (29)
CASE_ENTRY (30)
CASE_ENTRY (31)
CASE_ENTRY (32)
CASE_ENTRY (33)
CASE_ENTRY (34)
CASE_ENTRY (35)
CASE_ENTRY (36)
CASE_ENTRY (37)
CASE_ENTRY (38)
CASE_ENTRY (39)
CASE_ENTRY (40)
CASE_ENTRY (41)
CASE_ENTRY (42)
CASE_ENTRY (43)
CASE_ENTRY (44)
CASE_ENTRY (45)
CASE_ENTRY (46)
CASE_ENTRY (47)
CASE_ENTRY (48)
CASE_ENTRY (49)
CASE_ENTRY (50)
CASE_ENTRY (51)
CASE_ENTRY (52)
CASE_ENTRY (53)
CASE_ENTRY (54)
CASE_ENTRY (55)
CASE_ENTRY (56)
CASE_ENTRY (57)
CASE_ENTRY (58)
CASE_ENTRY (59)
CASE_ENTRY (60)
CASE_ENTRY (61)
CASE_ENTRY (62)
CASE_ENTRY (63)
CASE_ENTRY (64)
}
do_nothing ((int *)&sum);
if (sum & 0x40)
goto start;
}
return -1;
}
int
main (int argc, char **argv)
{
long long ret = test_and_branch (64, 1);
if (ret != 64)
abort ();
ret = test_and_branch (7, 1);
if (ret != -1)
abort ();
return 0;
}
|
the_stack_data/91874.c |
int main(void)
{
int a;
int b;
a = 22419;
b = 33319;
return 0;
}
|
the_stack_data/19770.c | // Note: modified from MachSuite: https://breagen.github.io/MachSuite/
// > Brandon Reagen, Robert Adolf, Sophia Yakun Shao, Gu-Yeon Wei, and David Brooks.
// > *"MachSuite: Benchmarks for Accelerator Design and Customized Architectures."*
// 2014 IEEE International Symposium on Workload Characterization.
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define SIZE 256
#define TYPE int
#define TYPE_MAX INT32_MAX
int a[SIZE] = {8630, 2371, 2106, 7047, 9475, 9554, 7281, 6704, 1253, 2157, 2702, 5221, 549, 5266, 7151, 8215, 8118, 7034, 2088, 9135, 3332, 6269, 5470, 1887, 9323, 8378, 8971, 7937, 9515, 3476, 1646, 3823, 555, 2036, 5010, 2633, 6890, 6000, 3503, 4297, 8403, 1966, 4584, 296, 322, 5328, 9540, 4442, 8455, 1645, 918, 2763, 4392, 6305, 3658, 8480, 8317, 6815, 5122, 5437, 2203, 511, 5744, 7766, 2356, 2207, 9796, 3578, 7374, 2888, 9291, 7479, 5700, 1726, 1181, 4994, 9697, 5623, 9487, 8533, 5359, 5216, 1, 6160, 8711, 8220, 6721, 4251, 288, 1950, 4118, 8633, 7052, 5668, 9958, 9749, 3057, 163, 5420, 7122, 3599, 2192, 5139, 4181, 6943, 16, 2609, 144, 3845, 5201, 8248, 5315, 4539, 8064, 671, 7867, 3556, 6717, 5041, 7526, 2624, 2612, 1269, 6184, 5584, 4656, 4378, 1243, 7797, 9670, 3304, 5750, 3355, 8214, 2352, 5843, 770, 7960, 3927, 9337, 6192, 4939, 4203, 9404, 3437, 4012, 8768, 6298, 9854, 7487, 537, 6765, 8956, 292, 6868, 8865, 2349, 1272, 2426, 5098, 1587, 7189, 7336, 2419, 3763, 5662, 9479, 3154, 33, 4661, 4990, 7170, 6230, 5919, 2969, 1882, 4291, 6145, 9519, 2130, 3981, 6171, 7298, 8669, 1915, 1826, 520, 2619, 2685, 9032, 7117, 7485, 3923, 4877, 6452, 1773, 2854, 3782, 448, 6425, 1996, 1688, 7995, 8573, 7790, 4629, 3495, 3746, 8733, 7781, 8415, 526, 6759, 9079, 8943, 3982, 6409, 8583, 3020, 4513, 5015, 7657, 6111, 3815, 9629, 1856, 1560, 8332, 5885, 9471, 1330, 7337, 7486, 9288, 7380, 524, 4007, 9589, 9680, 4558, 3996, 9331, 2769, 4166, 1952, 8244, 434, 5746, 7112, 7613, 2348, 4351, 393, 4421, 6386, 8158};
void merge(int start, int m, int stop){
TYPE temp[SIZE];
int i, j, k;
for(i=start; i<=m; i++){
temp[i] = a[i];
}
for(j=m+1; j<=stop; j++){
temp[m+1+stop-j] = a[j];
}
i = start;
j = stop;
for(k=start; k<=stop; k++){
TYPE tmp_j = temp[j];
TYPE tmp_i = temp[i];
if(tmp_j < tmp_i) {
a[k] = tmp_j;
j--;
} else {
a[k] = tmp_i;
i++;
}
}
}
void msort() {
int start, stop;
int i, m, from, mid, to;
start = 0;
stop = SIZE;
for (m=1; m<stop-start; m+=m) {
for (i=start; i<stop; i+=m+m) {
from = i;
mid = i+m-1;
to = i+m+m-1;
if(to < stop){
merge(from, mid, to);
}
else{
merge(from, mid, stop);
}
}
}
}
int main(int argc, char const *argv[]) {
msort();
for (int i = 0; i < SIZE; i++) {
printf("%d\n", a[i]);
}
return 0;
}
|
the_stack_data/136587.c | # 1 "benchmarks/ds-01-impl2.c"
# 1 "<built-in>"
# 1 "<command-line>"
# 1 "/usr/include/stdc-predef.h" 1 3 4
# 1 "<command-line>" 2
# 1 "benchmarks/ds-01-impl2.c"
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 1
# 20 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h"
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/definitions.h" 1
# 132 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/definitions.h"
int X_SIZE_VALUE = 0;
int overflow_mode = 1;
int rounding_mode = 0;
# 155 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/definitions.h"
typedef struct {
double a[100];
int a_size;
double b[100];
int b_size;
double sample_time;
double a_uncertainty[100];
double b_uncertainty[100];
} digital_system;
typedef struct {
double A[4][4];
double B[4][4];
double C[4][4];
double D[4][4];
double states[4][4];
double outputs[4][4];
double inputs[4][4];
double K[4][4];
unsigned int nStates;
unsigned int nInputs;
unsigned int nOutputs;
} digital_system_state_space;
typedef struct {
int int_bits;
int frac_bits;
double max;
double min;
int default_realization;
double delta;
int scale;
double max_error;
} implementation;
typedef struct {
int push;
int in;
int sbiw;
int cli;
int out;
int std;
int ldd;
int subi;
int sbci;
int lsl;
int rol;
int add;
int adc;
int adiw;
int rjmp;
int mov;
int sbc;
int ld;
int rcall;
int cp;
int cpc;
int ldi;
int brge;
int pop;
int ret;
int st;
int brlt;
int cpi;
} instructions;
typedef struct {
long clock;
int device;
double cycle;
instructions assembly;
} hardware;
typedef struct{
float Ap, Ar, Ac;
float wp, wc, wr;
int type;
}filter_parameters;
# 21 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 1
# 17 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
# 1 "/usr/include/stdlib.h" 1 3 4
# 25 "/usr/include/stdlib.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/libc-header-start.h" 1 3 4
# 33 "/usr/include/x86_64-linux-gnu/bits/libc-header-start.h" 3 4
# 1 "/usr/include/features.h" 1 3 4
# 461 "/usr/include/features.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/sys/cdefs.h" 1 3 4
# 452 "/usr/include/x86_64-linux-gnu/sys/cdefs.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/wordsize.h" 1 3 4
# 453 "/usr/include/x86_64-linux-gnu/sys/cdefs.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/long-double.h" 1 3 4
# 454 "/usr/include/x86_64-linux-gnu/sys/cdefs.h" 2 3 4
# 462 "/usr/include/features.h" 2 3 4
# 485 "/usr/include/features.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/gnu/stubs.h" 1 3 4
# 10 "/usr/include/x86_64-linux-gnu/gnu/stubs.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/gnu/stubs-64.h" 1 3 4
# 11 "/usr/include/x86_64-linux-gnu/gnu/stubs.h" 2 3 4
# 486 "/usr/include/features.h" 2 3 4
# 34 "/usr/include/x86_64-linux-gnu/bits/libc-header-start.h" 2 3 4
# 26 "/usr/include/stdlib.h" 2 3 4
# 1 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stddef.h" 1 3 4
# 209 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stddef.h" 3 4
# 209 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stddef.h" 3 4
typedef long unsigned int size_t;
# 321 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stddef.h" 3 4
typedef int wchar_t;
# 32 "/usr/include/stdlib.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/waitflags.h" 1 3 4
# 52 "/usr/include/x86_64-linux-gnu/bits/waitflags.h" 3 4
typedef enum
{
P_ALL,
P_PID,
P_PGID
} idtype_t;
# 40 "/usr/include/stdlib.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/waitstatus.h" 1 3 4
# 41 "/usr/include/stdlib.h" 2 3 4
# 55 "/usr/include/stdlib.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/floatn.h" 1 3 4
# 120 "/usr/include/x86_64-linux-gnu/bits/floatn.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/floatn-common.h" 1 3 4
# 24 "/usr/include/x86_64-linux-gnu/bits/floatn-common.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/long-double.h" 1 3 4
# 25 "/usr/include/x86_64-linux-gnu/bits/floatn-common.h" 2 3 4
# 121 "/usr/include/x86_64-linux-gnu/bits/floatn.h" 2 3 4
# 56 "/usr/include/stdlib.h" 2 3 4
typedef struct
{
int quot;
int rem;
} div_t;
typedef struct
{
long int quot;
long int rem;
} ldiv_t;
__extension__ typedef struct
{
long long int quot;
long long int rem;
} lldiv_t;
# 97 "/usr/include/stdlib.h" 3 4
extern size_t __ctype_get_mb_cur_max (void) __attribute__ ((__nothrow__ , __leaf__)) ;
extern double atof (const char *__nptr)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
extern int atoi (const char *__nptr)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
extern long int atol (const char *__nptr)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
__extension__ extern long long int atoll (const char *__nptr)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
extern double strtod (const char *__restrict __nptr,
char **__restrict __endptr)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern float strtof (const char *__restrict __nptr,
char **__restrict __endptr) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern long double strtold (const char *__restrict __nptr,
char **__restrict __endptr)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
# 176 "/usr/include/stdlib.h" 3 4
extern long int strtol (const char *__restrict __nptr,
char **__restrict __endptr, int __base)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern unsigned long int strtoul (const char *__restrict __nptr,
char **__restrict __endptr, int __base)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
__extension__
extern long long int strtoq (const char *__restrict __nptr,
char **__restrict __endptr, int __base)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
__extension__
extern unsigned long long int strtouq (const char *__restrict __nptr,
char **__restrict __endptr, int __base)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
__extension__
extern long long int strtoll (const char *__restrict __nptr,
char **__restrict __endptr, int __base)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
__extension__
extern unsigned long long int strtoull (const char *__restrict __nptr,
char **__restrict __endptr, int __base)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
# 385 "/usr/include/stdlib.h" 3 4
extern char *l64a (long int __n) __attribute__ ((__nothrow__ , __leaf__)) ;
extern long int a64l (const char *__s)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
# 1 "/usr/include/x86_64-linux-gnu/sys/types.h" 1 3 4
# 27 "/usr/include/x86_64-linux-gnu/sys/types.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types.h" 1 3 4
# 27 "/usr/include/x86_64-linux-gnu/bits/types.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/wordsize.h" 1 3 4
# 28 "/usr/include/x86_64-linux-gnu/bits/types.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/timesize.h" 1 3 4
# 29 "/usr/include/x86_64-linux-gnu/bits/types.h" 2 3 4
typedef unsigned char __u_char;
typedef unsigned short int __u_short;
typedef unsigned int __u_int;
typedef unsigned long int __u_long;
typedef signed char __int8_t;
typedef unsigned char __uint8_t;
typedef signed short int __int16_t;
typedef unsigned short int __uint16_t;
typedef signed int __int32_t;
typedef unsigned int __uint32_t;
typedef signed long int __int64_t;
typedef unsigned long int __uint64_t;
typedef __int8_t __int_least8_t;
typedef __uint8_t __uint_least8_t;
typedef __int16_t __int_least16_t;
typedef __uint16_t __uint_least16_t;
typedef __int32_t __int_least32_t;
typedef __uint32_t __uint_least32_t;
typedef __int64_t __int_least64_t;
typedef __uint64_t __uint_least64_t;
typedef long int __quad_t;
typedef unsigned long int __u_quad_t;
typedef long int __intmax_t;
typedef unsigned long int __uintmax_t;
# 141 "/usr/include/x86_64-linux-gnu/bits/types.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/typesizes.h" 1 3 4
# 142 "/usr/include/x86_64-linux-gnu/bits/types.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/time64.h" 1 3 4
# 143 "/usr/include/x86_64-linux-gnu/bits/types.h" 2 3 4
typedef unsigned long int __dev_t;
typedef unsigned int __uid_t;
typedef unsigned int __gid_t;
typedef unsigned long int __ino_t;
typedef unsigned long int __ino64_t;
typedef unsigned int __mode_t;
typedef unsigned long int __nlink_t;
typedef long int __off_t;
typedef long int __off64_t;
typedef int __pid_t;
typedef struct { int __val[2]; } __fsid_t;
typedef long int __clock_t;
typedef unsigned long int __rlim_t;
typedef unsigned long int __rlim64_t;
typedef unsigned int __id_t;
typedef long int __time_t;
typedef unsigned int __useconds_t;
typedef long int __suseconds_t;
typedef int __daddr_t;
typedef int __key_t;
typedef int __clockid_t;
typedef void * __timer_t;
typedef long int __blksize_t;
typedef long int __blkcnt_t;
typedef long int __blkcnt64_t;
typedef unsigned long int __fsblkcnt_t;
typedef unsigned long int __fsblkcnt64_t;
typedef unsigned long int __fsfilcnt_t;
typedef unsigned long int __fsfilcnt64_t;
typedef long int __fsword_t;
typedef long int __ssize_t;
typedef long int __syscall_slong_t;
typedef unsigned long int __syscall_ulong_t;
typedef __off64_t __loff_t;
typedef char *__caddr_t;
typedef long int __intptr_t;
typedef unsigned int __socklen_t;
typedef int __sig_atomic_t;
# 30 "/usr/include/x86_64-linux-gnu/sys/types.h" 2 3 4
typedef __u_char u_char;
typedef __u_short u_short;
typedef __u_int u_int;
typedef __u_long u_long;
typedef __quad_t quad_t;
typedef __u_quad_t u_quad_t;
typedef __fsid_t fsid_t;
typedef __loff_t loff_t;
typedef __ino_t ino_t;
# 59 "/usr/include/x86_64-linux-gnu/sys/types.h" 3 4
typedef __dev_t dev_t;
typedef __gid_t gid_t;
typedef __mode_t mode_t;
typedef __nlink_t nlink_t;
typedef __uid_t uid_t;
typedef __off_t off_t;
# 97 "/usr/include/x86_64-linux-gnu/sys/types.h" 3 4
typedef __pid_t pid_t;
typedef __id_t id_t;
typedef __ssize_t ssize_t;
typedef __daddr_t daddr_t;
typedef __caddr_t caddr_t;
typedef __key_t key_t;
# 1 "/usr/include/x86_64-linux-gnu/bits/types/clock_t.h" 1 3 4
typedef __clock_t clock_t;
# 127 "/usr/include/x86_64-linux-gnu/sys/types.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/clockid_t.h" 1 3 4
typedef __clockid_t clockid_t;
# 129 "/usr/include/x86_64-linux-gnu/sys/types.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/time_t.h" 1 3 4
typedef __time_t time_t;
# 130 "/usr/include/x86_64-linux-gnu/sys/types.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/timer_t.h" 1 3 4
typedef __timer_t timer_t;
# 131 "/usr/include/x86_64-linux-gnu/sys/types.h" 2 3 4
# 144 "/usr/include/x86_64-linux-gnu/sys/types.h" 3 4
# 1 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stddef.h" 1 3 4
# 145 "/usr/include/x86_64-linux-gnu/sys/types.h" 2 3 4
typedef unsigned long int ulong;
typedef unsigned short int ushort;
typedef unsigned int uint;
# 1 "/usr/include/x86_64-linux-gnu/bits/stdint-intn.h" 1 3 4
# 24 "/usr/include/x86_64-linux-gnu/bits/stdint-intn.h" 3 4
typedef __int8_t int8_t;
typedef __int16_t int16_t;
typedef __int32_t int32_t;
typedef __int64_t int64_t;
# 156 "/usr/include/x86_64-linux-gnu/sys/types.h" 2 3 4
typedef __uint8_t u_int8_t;
typedef __uint16_t u_int16_t;
typedef __uint32_t u_int32_t;
typedef __uint64_t u_int64_t;
typedef int register_t __attribute__ ((__mode__ (__word__)));
# 176 "/usr/include/x86_64-linux-gnu/sys/types.h" 3 4
# 1 "/usr/include/endian.h" 1 3 4
# 24 "/usr/include/endian.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/endian.h" 1 3 4
# 35 "/usr/include/x86_64-linux-gnu/bits/endian.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/endianness.h" 1 3 4
# 36 "/usr/include/x86_64-linux-gnu/bits/endian.h" 2 3 4
# 25 "/usr/include/endian.h" 2 3 4
# 35 "/usr/include/endian.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/byteswap.h" 1 3 4
# 33 "/usr/include/x86_64-linux-gnu/bits/byteswap.h" 3 4
static __inline __uint16_t
__bswap_16 (__uint16_t __bsx)
{
return __builtin_bswap16 (__bsx);
}
static __inline __uint32_t
__bswap_32 (__uint32_t __bsx)
{
return __builtin_bswap32 (__bsx);
}
# 69 "/usr/include/x86_64-linux-gnu/bits/byteswap.h" 3 4
__extension__ static __inline __uint64_t
__bswap_64 (__uint64_t __bsx)
{
return __builtin_bswap64 (__bsx);
}
# 36 "/usr/include/endian.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/uintn-identity.h" 1 3 4
# 32 "/usr/include/x86_64-linux-gnu/bits/uintn-identity.h" 3 4
static __inline __uint16_t
__uint16_identity (__uint16_t __x)
{
return __x;
}
static __inline __uint32_t
__uint32_identity (__uint32_t __x)
{
return __x;
}
static __inline __uint64_t
__uint64_identity (__uint64_t __x)
{
return __x;
}
# 37 "/usr/include/endian.h" 2 3 4
# 177 "/usr/include/x86_64-linux-gnu/sys/types.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/sys/select.h" 1 3 4
# 30 "/usr/include/x86_64-linux-gnu/sys/select.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/select.h" 1 3 4
# 22 "/usr/include/x86_64-linux-gnu/bits/select.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/wordsize.h" 1 3 4
# 23 "/usr/include/x86_64-linux-gnu/bits/select.h" 2 3 4
# 31 "/usr/include/x86_64-linux-gnu/sys/select.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/sigset_t.h" 1 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/__sigset_t.h" 1 3 4
typedef struct
{
unsigned long int __val[(1024 / (8 * sizeof (unsigned long int)))];
} __sigset_t;
# 5 "/usr/include/x86_64-linux-gnu/bits/types/sigset_t.h" 2 3 4
typedef __sigset_t sigset_t;
# 34 "/usr/include/x86_64-linux-gnu/sys/select.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/struct_timeval.h" 1 3 4
struct timeval
{
__time_t tv_sec;
__suseconds_t tv_usec;
};
# 38 "/usr/include/x86_64-linux-gnu/sys/select.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/struct_timespec.h" 1 3 4
# 10 "/usr/include/x86_64-linux-gnu/bits/types/struct_timespec.h" 3 4
struct timespec
{
__time_t tv_sec;
__syscall_slong_t tv_nsec;
# 26 "/usr/include/x86_64-linux-gnu/bits/types/struct_timespec.h" 3 4
};
# 40 "/usr/include/x86_64-linux-gnu/sys/select.h" 2 3 4
typedef __suseconds_t suseconds_t;
typedef long int __fd_mask;
# 59 "/usr/include/x86_64-linux-gnu/sys/select.h" 3 4
typedef struct
{
__fd_mask __fds_bits[1024 / (8 * (int) sizeof (__fd_mask))];
} fd_set;
typedef __fd_mask fd_mask;
# 91 "/usr/include/x86_64-linux-gnu/sys/select.h" 3 4
# 101 "/usr/include/x86_64-linux-gnu/sys/select.h" 3 4
extern int select (int __nfds, fd_set *__restrict __readfds,
fd_set *__restrict __writefds,
fd_set *__restrict __exceptfds,
struct timeval *__restrict __timeout);
# 113 "/usr/include/x86_64-linux-gnu/sys/select.h" 3 4
extern int pselect (int __nfds, fd_set *__restrict __readfds,
fd_set *__restrict __writefds,
fd_set *__restrict __exceptfds,
const struct timespec *__restrict __timeout,
const __sigset_t *__restrict __sigmask);
# 126 "/usr/include/x86_64-linux-gnu/sys/select.h" 3 4
# 180 "/usr/include/x86_64-linux-gnu/sys/types.h" 2 3 4
typedef __blksize_t blksize_t;
typedef __blkcnt_t blkcnt_t;
typedef __fsblkcnt_t fsblkcnt_t;
typedef __fsfilcnt_t fsfilcnt_t;
# 227 "/usr/include/x86_64-linux-gnu/sys/types.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/pthreadtypes.h" 1 3 4
# 23 "/usr/include/x86_64-linux-gnu/bits/pthreadtypes.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/thread-shared-types.h" 1 3 4
# 44 "/usr/include/x86_64-linux-gnu/bits/thread-shared-types.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/pthreadtypes-arch.h" 1 3 4
# 21 "/usr/include/x86_64-linux-gnu/bits/pthreadtypes-arch.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/wordsize.h" 1 3 4
# 22 "/usr/include/x86_64-linux-gnu/bits/pthreadtypes-arch.h" 2 3 4
# 45 "/usr/include/x86_64-linux-gnu/bits/thread-shared-types.h" 2 3 4
typedef struct __pthread_internal_list
{
struct __pthread_internal_list *__prev;
struct __pthread_internal_list *__next;
} __pthread_list_t;
typedef struct __pthread_internal_slist
{
struct __pthread_internal_slist *__next;
} __pthread_slist_t;
# 74 "/usr/include/x86_64-linux-gnu/bits/thread-shared-types.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/struct_mutex.h" 1 3 4
# 22 "/usr/include/x86_64-linux-gnu/bits/struct_mutex.h" 3 4
struct __pthread_mutex_s
{
int __lock;
unsigned int __count;
int __owner;
unsigned int __nusers;
int __kind;
short __spins;
short __elision;
__pthread_list_t __list;
# 53 "/usr/include/x86_64-linux-gnu/bits/struct_mutex.h" 3 4
};
# 75 "/usr/include/x86_64-linux-gnu/bits/thread-shared-types.h" 2 3 4
# 87 "/usr/include/x86_64-linux-gnu/bits/thread-shared-types.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/struct_rwlock.h" 1 3 4
# 23 "/usr/include/x86_64-linux-gnu/bits/struct_rwlock.h" 3 4
struct __pthread_rwlock_arch_t
{
unsigned int __readers;
unsigned int __writers;
unsigned int __wrphase_futex;
unsigned int __writers_futex;
unsigned int __pad3;
unsigned int __pad4;
int __cur_writer;
int __shared;
signed char __rwelision;
unsigned char __pad1[7];
unsigned long int __pad2;
unsigned int __flags;
# 55 "/usr/include/x86_64-linux-gnu/bits/struct_rwlock.h" 3 4
};
# 88 "/usr/include/x86_64-linux-gnu/bits/thread-shared-types.h" 2 3 4
struct __pthread_cond_s
{
__extension__ union
{
__extension__ unsigned long long int __wseq;
struct
{
unsigned int __low;
unsigned int __high;
} __wseq32;
};
__extension__ union
{
__extension__ unsigned long long int __g1_start;
struct
{
unsigned int __low;
unsigned int __high;
} __g1_start32;
};
unsigned int __g_refs[2] ;
unsigned int __g_size[2];
unsigned int __g1_orig_size;
unsigned int __wrefs;
unsigned int __g_signals[2];
};
# 24 "/usr/include/x86_64-linux-gnu/bits/pthreadtypes.h" 2 3 4
typedef unsigned long int pthread_t;
typedef union
{
char __size[4];
int __align;
} pthread_mutexattr_t;
typedef union
{
char __size[4];
int __align;
} pthread_condattr_t;
typedef unsigned int pthread_key_t;
typedef int pthread_once_t;
union pthread_attr_t
{
char __size[56];
long int __align;
};
typedef union pthread_attr_t pthread_attr_t;
typedef union
{
struct __pthread_mutex_s __data;
char __size[40];
long int __align;
} pthread_mutex_t;
typedef union
{
struct __pthread_cond_s __data;
char __size[48];
__extension__ long long int __align;
} pthread_cond_t;
typedef union
{
struct __pthread_rwlock_arch_t __data;
char __size[56];
long int __align;
} pthread_rwlock_t;
typedef union
{
char __size[8];
long int __align;
} pthread_rwlockattr_t;
typedef volatile int pthread_spinlock_t;
typedef union
{
char __size[32];
long int __align;
} pthread_barrier_t;
typedef union
{
char __size[4];
int __align;
} pthread_barrierattr_t;
# 228 "/usr/include/x86_64-linux-gnu/sys/types.h" 2 3 4
# 395 "/usr/include/stdlib.h" 2 3 4
extern long int random (void) __attribute__ ((__nothrow__ , __leaf__));
extern void srandom (unsigned int __seed) __attribute__ ((__nothrow__ , __leaf__));
extern char *initstate (unsigned int __seed, char *__statebuf,
size_t __statelen) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (2)));
extern char *setstate (char *__statebuf) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
struct random_data
{
int32_t *fptr;
int32_t *rptr;
int32_t *state;
int rand_type;
int rand_deg;
int rand_sep;
int32_t *end_ptr;
};
extern int random_r (struct random_data *__restrict __buf,
int32_t *__restrict __result) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2)));
extern int srandom_r (unsigned int __seed, struct random_data *__buf)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (2)));
extern int initstate_r (unsigned int __seed, char *__restrict __statebuf,
size_t __statelen,
struct random_data *__restrict __buf)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (2, 4)));
extern int setstate_r (char *__restrict __statebuf,
struct random_data *__restrict __buf)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2)));
extern int rand (void) __attribute__ ((__nothrow__ , __leaf__));
extern void srand (unsigned int __seed) __attribute__ ((__nothrow__ , __leaf__));
extern int rand_r (unsigned int *__seed) __attribute__ ((__nothrow__ , __leaf__));
extern double drand48 (void) __attribute__ ((__nothrow__ , __leaf__));
extern double erand48 (unsigned short int __xsubi[3]) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern long int lrand48 (void) __attribute__ ((__nothrow__ , __leaf__));
extern long int nrand48 (unsigned short int __xsubi[3])
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern long int mrand48 (void) __attribute__ ((__nothrow__ , __leaf__));
extern long int jrand48 (unsigned short int __xsubi[3])
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern void srand48 (long int __seedval) __attribute__ ((__nothrow__ , __leaf__));
extern unsigned short int *seed48 (unsigned short int __seed16v[3])
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern void lcong48 (unsigned short int __param[7]) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
struct drand48_data
{
unsigned short int __x[3];
unsigned short int __old_x[3];
unsigned short int __c;
unsigned short int __init;
__extension__ unsigned long long int __a;
};
extern int drand48_r (struct drand48_data *__restrict __buffer,
double *__restrict __result) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2)));
extern int erand48_r (unsigned short int __xsubi[3],
struct drand48_data *__restrict __buffer,
double *__restrict __result) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2)));
extern int lrand48_r (struct drand48_data *__restrict __buffer,
long int *__restrict __result)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2)));
extern int nrand48_r (unsigned short int __xsubi[3],
struct drand48_data *__restrict __buffer,
long int *__restrict __result)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2)));
extern int mrand48_r (struct drand48_data *__restrict __buffer,
long int *__restrict __result)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2)));
extern int jrand48_r (unsigned short int __xsubi[3],
struct drand48_data *__restrict __buffer,
long int *__restrict __result)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2)));
extern int srand48_r (long int __seedval, struct drand48_data *__buffer)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (2)));
extern int seed48_r (unsigned short int __seed16v[3],
struct drand48_data *__buffer) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2)));
extern int lcong48_r (unsigned short int __param[7],
struct drand48_data *__buffer)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2)));
extern void *malloc (size_t __size) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__malloc__))
__attribute__ ((__alloc_size__ (1))) ;
extern void *calloc (size_t __nmemb, size_t __size)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__malloc__)) __attribute__ ((__alloc_size__ (1, 2))) ;
extern void *realloc (void *__ptr, size_t __size)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__warn_unused_result__)) __attribute__ ((__alloc_size__ (2)));
extern void *reallocarray (void *__ptr, size_t __nmemb, size_t __size)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__warn_unused_result__))
__attribute__ ((__alloc_size__ (2, 3)));
extern void free (void *__ptr) __attribute__ ((__nothrow__ , __leaf__));
# 1 "/usr/include/alloca.h" 1 3 4
# 24 "/usr/include/alloca.h" 3 4
# 1 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stddef.h" 1 3 4
# 25 "/usr/include/alloca.h" 2 3 4
extern void *alloca (size_t __size) __attribute__ ((__nothrow__ , __leaf__));
# 569 "/usr/include/stdlib.h" 2 3 4
extern void *valloc (size_t __size) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__malloc__))
__attribute__ ((__alloc_size__ (1))) ;
extern int posix_memalign (void **__memptr, size_t __alignment, size_t __size)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1))) ;
extern void *aligned_alloc (size_t __alignment, size_t __size)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__malloc__)) __attribute__ ((__alloc_size__ (2))) ;
extern void abort (void) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__noreturn__));
extern int atexit (void (*__func) (void)) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern int at_quick_exit (void (*__func) (void)) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern int on_exit (void (*__func) (int __status, void *__arg), void *__arg)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern void exit (int __status) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__noreturn__));
extern void quick_exit (int __status) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__noreturn__));
extern void _Exit (int __status) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__noreturn__));
extern char *getenv (const char *__name) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1))) ;
# 647 "/usr/include/stdlib.h" 3 4
extern int putenv (char *__string) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern int setenv (const char *__name, const char *__value, int __replace)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (2)));
extern int unsetenv (const char *__name) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern int clearenv (void) __attribute__ ((__nothrow__ , __leaf__));
# 675 "/usr/include/stdlib.h" 3 4
extern char *mktemp (char *__template) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
# 688 "/usr/include/stdlib.h" 3 4
extern int mkstemp (char *__template) __attribute__ ((__nonnull__ (1))) ;
# 710 "/usr/include/stdlib.h" 3 4
extern int mkstemps (char *__template, int __suffixlen) __attribute__ ((__nonnull__ (1))) ;
# 731 "/usr/include/stdlib.h" 3 4
extern char *mkdtemp (char *__template) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1))) ;
# 784 "/usr/include/stdlib.h" 3 4
extern int system (const char *__command) ;
# 800 "/usr/include/stdlib.h" 3 4
extern char *realpath (const char *__restrict __name,
char *__restrict __resolved) __attribute__ ((__nothrow__ , __leaf__)) ;
typedef int (*__compar_fn_t) (const void *, const void *);
# 820 "/usr/include/stdlib.h" 3 4
extern void *bsearch (const void *__key, const void *__base,
size_t __nmemb, size_t __size, __compar_fn_t __compar)
__attribute__ ((__nonnull__ (1, 2, 5))) ;
extern void qsort (void *__base, size_t __nmemb, size_t __size,
__compar_fn_t __compar) __attribute__ ((__nonnull__ (1, 4)));
# 840 "/usr/include/stdlib.h" 3 4
extern int abs (int __x) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__const__)) ;
extern long int labs (long int __x) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__const__)) ;
__extension__ extern long long int llabs (long long int __x)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__const__)) ;
extern div_t div (int __numer, int __denom)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__const__)) ;
extern ldiv_t ldiv (long int __numer, long int __denom)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__const__)) ;
__extension__ extern lldiv_t lldiv (long long int __numer,
long long int __denom)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__const__)) ;
# 872 "/usr/include/stdlib.h" 3 4
extern char *ecvt (double __value, int __ndigit, int *__restrict __decpt,
int *__restrict __sign) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (3, 4))) ;
extern char *fcvt (double __value, int __ndigit, int *__restrict __decpt,
int *__restrict __sign) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (3, 4))) ;
extern char *gcvt (double __value, int __ndigit, char *__buf)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (3))) ;
extern char *qecvt (long double __value, int __ndigit,
int *__restrict __decpt, int *__restrict __sign)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (3, 4))) ;
extern char *qfcvt (long double __value, int __ndigit,
int *__restrict __decpt, int *__restrict __sign)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (3, 4))) ;
extern char *qgcvt (long double __value, int __ndigit, char *__buf)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (3))) ;
extern int ecvt_r (double __value, int __ndigit, int *__restrict __decpt,
int *__restrict __sign, char *__restrict __buf,
size_t __len) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (3, 4, 5)));
extern int fcvt_r (double __value, int __ndigit, int *__restrict __decpt,
int *__restrict __sign, char *__restrict __buf,
size_t __len) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (3, 4, 5)));
extern int qecvt_r (long double __value, int __ndigit,
int *__restrict __decpt, int *__restrict __sign,
char *__restrict __buf, size_t __len)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (3, 4, 5)));
extern int qfcvt_r (long double __value, int __ndigit,
int *__restrict __decpt, int *__restrict __sign,
char *__restrict __buf, size_t __len)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (3, 4, 5)));
extern int mblen (const char *__s, size_t __n) __attribute__ ((__nothrow__ , __leaf__));
extern int mbtowc (wchar_t *__restrict __pwc,
const char *__restrict __s, size_t __n) __attribute__ ((__nothrow__ , __leaf__));
extern int wctomb (char *__s, wchar_t __wchar) __attribute__ ((__nothrow__ , __leaf__));
extern size_t mbstowcs (wchar_t *__restrict __pwcs,
const char *__restrict __s, size_t __n) __attribute__ ((__nothrow__ , __leaf__));
extern size_t wcstombs (char *__restrict __s,
const wchar_t *__restrict __pwcs, size_t __n)
__attribute__ ((__nothrow__ , __leaf__));
extern int rpmatch (const char *__response) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1))) ;
# 957 "/usr/include/stdlib.h" 3 4
extern int getsubopt (char **__restrict __optionp,
char *const *__restrict __tokens,
char **__restrict __valuep)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2, 3))) ;
# 1003 "/usr/include/stdlib.h" 3 4
extern int getloadavg (double __loadavg[], int __nelem)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
# 1013 "/usr/include/stdlib.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/stdlib-float.h" 1 3 4
# 1014 "/usr/include/stdlib.h" 2 3 4
# 1023 "/usr/include/stdlib.h" 3 4
# 18 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 2
# 1 "/usr/include/assert.h" 1 3 4
# 66 "/usr/include/assert.h" 3 4
extern void __assert_fail (const char *__assertion, const char *__file,
unsigned int __line, const char *__function)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__noreturn__));
extern void __assert_perror_fail (int __errnum, const char *__file,
unsigned int __line, const char *__function)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__noreturn__));
extern void __assert (const char *__assertion, const char *__file, int __line)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__noreturn__));
# 19 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 2
# 1 "/usr/include/stdio.h" 1 3 4
# 27 "/usr/include/stdio.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/libc-header-start.h" 1 3 4
# 28 "/usr/include/stdio.h" 2 3 4
# 1 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stddef.h" 1 3 4
# 34 "/usr/include/stdio.h" 2 3 4
# 1 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stdarg.h" 1 3 4
# 40 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stdarg.h" 3 4
typedef __builtin_va_list __gnuc_va_list;
# 37 "/usr/include/stdio.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/__fpos_t.h" 1 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/__mbstate_t.h" 1 3 4
# 13 "/usr/include/x86_64-linux-gnu/bits/types/__mbstate_t.h" 3 4
typedef struct
{
int __count;
union
{
unsigned int __wch;
char __wchb[4];
} __value;
} __mbstate_t;
# 6 "/usr/include/x86_64-linux-gnu/bits/types/__fpos_t.h" 2 3 4
typedef struct _G_fpos_t
{
__off_t __pos;
__mbstate_t __state;
} __fpos_t;
# 40 "/usr/include/stdio.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/__fpos64_t.h" 1 3 4
# 10 "/usr/include/x86_64-linux-gnu/bits/types/__fpos64_t.h" 3 4
typedef struct _G_fpos64_t
{
__off64_t __pos;
__mbstate_t __state;
} __fpos64_t;
# 41 "/usr/include/stdio.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/__FILE.h" 1 3 4
struct _IO_FILE;
typedef struct _IO_FILE __FILE;
# 42 "/usr/include/stdio.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/FILE.h" 1 3 4
struct _IO_FILE;
typedef struct _IO_FILE FILE;
# 43 "/usr/include/stdio.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/struct_FILE.h" 1 3 4
# 35 "/usr/include/x86_64-linux-gnu/bits/types/struct_FILE.h" 3 4
struct _IO_FILE;
struct _IO_marker;
struct _IO_codecvt;
struct _IO_wide_data;
typedef void _IO_lock_t;
struct _IO_FILE
{
int _flags;
char *_IO_read_ptr;
char *_IO_read_end;
char *_IO_read_base;
char *_IO_write_base;
char *_IO_write_ptr;
char *_IO_write_end;
char *_IO_buf_base;
char *_IO_buf_end;
char *_IO_save_base;
char *_IO_backup_base;
char *_IO_save_end;
struct _IO_marker *_markers;
struct _IO_FILE *_chain;
int _fileno;
int _flags2;
__off_t _old_offset;
unsigned short _cur_column;
signed char _vtable_offset;
char _shortbuf[1];
_IO_lock_t *_lock;
__off64_t _offset;
struct _IO_codecvt *_codecvt;
struct _IO_wide_data *_wide_data;
struct _IO_FILE *_freeres_list;
void *_freeres_buf;
size_t __pad5;
int _mode;
char _unused2[15 * sizeof (int) - 4 * sizeof (void *) - sizeof (size_t)];
};
# 44 "/usr/include/stdio.h" 2 3 4
# 52 "/usr/include/stdio.h" 3 4
typedef __gnuc_va_list va_list;
# 84 "/usr/include/stdio.h" 3 4
typedef __fpos_t fpos_t;
# 133 "/usr/include/stdio.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/stdio_lim.h" 1 3 4
# 134 "/usr/include/stdio.h" 2 3 4
extern FILE *stdin;
extern FILE *stdout;
extern FILE *stderr;
extern int remove (const char *__filename) __attribute__ ((__nothrow__ , __leaf__));
extern int rename (const char *__old, const char *__new) __attribute__ ((__nothrow__ , __leaf__));
extern int renameat (int __oldfd, const char *__old, int __newfd,
const char *__new) __attribute__ ((__nothrow__ , __leaf__));
# 173 "/usr/include/stdio.h" 3 4
extern FILE *tmpfile (void) ;
# 187 "/usr/include/stdio.h" 3 4
extern char *tmpnam (char *__s) __attribute__ ((__nothrow__ , __leaf__)) ;
extern char *tmpnam_r (char *__s) __attribute__ ((__nothrow__ , __leaf__)) ;
# 204 "/usr/include/stdio.h" 3 4
extern char *tempnam (const char *__dir, const char *__pfx)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__malloc__)) ;
extern int fclose (FILE *__stream);
extern int fflush (FILE *__stream);
# 227 "/usr/include/stdio.h" 3 4
extern int fflush_unlocked (FILE *__stream);
# 246 "/usr/include/stdio.h" 3 4
extern FILE *fopen (const char *__restrict __filename,
const char *__restrict __modes) ;
extern FILE *freopen (const char *__restrict __filename,
const char *__restrict __modes,
FILE *__restrict __stream) ;
# 279 "/usr/include/stdio.h" 3 4
extern FILE *fdopen (int __fd, const char *__modes) __attribute__ ((__nothrow__ , __leaf__)) ;
# 292 "/usr/include/stdio.h" 3 4
extern FILE *fmemopen (void *__s, size_t __len, const char *__modes)
__attribute__ ((__nothrow__ , __leaf__)) ;
extern FILE *open_memstream (char **__bufloc, size_t *__sizeloc) __attribute__ ((__nothrow__ , __leaf__)) ;
extern void setbuf (FILE *__restrict __stream, char *__restrict __buf) __attribute__ ((__nothrow__ , __leaf__));
extern int setvbuf (FILE *__restrict __stream, char *__restrict __buf,
int __modes, size_t __n) __attribute__ ((__nothrow__ , __leaf__));
extern void setbuffer (FILE *__restrict __stream, char *__restrict __buf,
size_t __size) __attribute__ ((__nothrow__ , __leaf__));
extern void setlinebuf (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__));
extern int fprintf (FILE *__restrict __stream,
const char *__restrict __format, ...);
extern int printf (const char *__restrict __format, ...);
extern int sprintf (char *__restrict __s,
const char *__restrict __format, ...) __attribute__ ((__nothrow__));
extern int vfprintf (FILE *__restrict __s, const char *__restrict __format,
__gnuc_va_list __arg);
extern int vprintf (const char *__restrict __format, __gnuc_va_list __arg);
extern int vsprintf (char *__restrict __s, const char *__restrict __format,
__gnuc_va_list __arg) __attribute__ ((__nothrow__));
extern int snprintf (char *__restrict __s, size_t __maxlen,
const char *__restrict __format, ...)
__attribute__ ((__nothrow__)) __attribute__ ((__format__ (__printf__, 3, 4)));
extern int vsnprintf (char *__restrict __s, size_t __maxlen,
const char *__restrict __format, __gnuc_va_list __arg)
__attribute__ ((__nothrow__)) __attribute__ ((__format__ (__printf__, 3, 0)));
# 379 "/usr/include/stdio.h" 3 4
extern int vdprintf (int __fd, const char *__restrict __fmt,
__gnuc_va_list __arg)
__attribute__ ((__format__ (__printf__, 2, 0)));
extern int dprintf (int __fd, const char *__restrict __fmt, ...)
__attribute__ ((__format__ (__printf__, 2, 3)));
extern int fscanf (FILE *__restrict __stream,
const char *__restrict __format, ...) ;
extern int scanf (const char *__restrict __format, ...) ;
extern int sscanf (const char *__restrict __s,
const char *__restrict __format, ...) __attribute__ ((__nothrow__ , __leaf__));
extern int fscanf (FILE *__restrict __stream, const char *__restrict __format, ...) __asm__ ("" "__isoc99_fscanf")
;
extern int scanf (const char *__restrict __format, ...) __asm__ ("" "__isoc99_scanf")
;
extern int sscanf (const char *__restrict __s, const char *__restrict __format, ...) __asm__ ("" "__isoc99_sscanf") __attribute__ ((__nothrow__ , __leaf__))
;
# 432 "/usr/include/stdio.h" 3 4
extern int vfscanf (FILE *__restrict __s, const char *__restrict __format,
__gnuc_va_list __arg)
__attribute__ ((__format__ (__scanf__, 2, 0))) ;
extern int vscanf (const char *__restrict __format, __gnuc_va_list __arg)
__attribute__ ((__format__ (__scanf__, 1, 0))) ;
extern int vsscanf (const char *__restrict __s,
const char *__restrict __format, __gnuc_va_list __arg)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__format__ (__scanf__, 2, 0)));
extern int vfscanf (FILE *__restrict __s, const char *__restrict __format, __gnuc_va_list __arg) __asm__ ("" "__isoc99_vfscanf")
__attribute__ ((__format__ (__scanf__, 2, 0))) ;
extern int vscanf (const char *__restrict __format, __gnuc_va_list __arg) __asm__ ("" "__isoc99_vscanf")
__attribute__ ((__format__ (__scanf__, 1, 0))) ;
extern int vsscanf (const char *__restrict __s, const char *__restrict __format, __gnuc_va_list __arg) __asm__ ("" "__isoc99_vsscanf") __attribute__ ((__nothrow__ , __leaf__))
__attribute__ ((__format__ (__scanf__, 2, 0)));
# 485 "/usr/include/stdio.h" 3 4
extern int fgetc (FILE *__stream);
extern int getc (FILE *__stream);
extern int getchar (void);
extern int getc_unlocked (FILE *__stream);
extern int getchar_unlocked (void);
# 510 "/usr/include/stdio.h" 3 4
extern int fgetc_unlocked (FILE *__stream);
# 521 "/usr/include/stdio.h" 3 4
extern int fputc (int __c, FILE *__stream);
extern int putc (int __c, FILE *__stream);
extern int putchar (int __c);
# 537 "/usr/include/stdio.h" 3 4
extern int fputc_unlocked (int __c, FILE *__stream);
extern int putc_unlocked (int __c, FILE *__stream);
extern int putchar_unlocked (int __c);
extern int getw (FILE *__stream);
extern int putw (int __w, FILE *__stream);
extern char *fgets (char *__restrict __s, int __n, FILE *__restrict __stream)
;
# 603 "/usr/include/stdio.h" 3 4
extern __ssize_t __getdelim (char **__restrict __lineptr,
size_t *__restrict __n, int __delimiter,
FILE *__restrict __stream) ;
extern __ssize_t getdelim (char **__restrict __lineptr,
size_t *__restrict __n, int __delimiter,
FILE *__restrict __stream) ;
extern __ssize_t getline (char **__restrict __lineptr,
size_t *__restrict __n,
FILE *__restrict __stream) ;
extern int fputs (const char *__restrict __s, FILE *__restrict __stream);
extern int puts (const char *__s);
extern int ungetc (int __c, FILE *__stream);
extern size_t fread (void *__restrict __ptr, size_t __size,
size_t __n, FILE *__restrict __stream) ;
extern size_t fwrite (const void *__restrict __ptr, size_t __size,
size_t __n, FILE *__restrict __s);
# 673 "/usr/include/stdio.h" 3 4
extern size_t fread_unlocked (void *__restrict __ptr, size_t __size,
size_t __n, FILE *__restrict __stream) ;
extern size_t fwrite_unlocked (const void *__restrict __ptr, size_t __size,
size_t __n, FILE *__restrict __stream);
extern int fseek (FILE *__stream, long int __off, int __whence);
extern long int ftell (FILE *__stream) ;
extern void rewind (FILE *__stream);
# 707 "/usr/include/stdio.h" 3 4
extern int fseeko (FILE *__stream, __off_t __off, int __whence);
extern __off_t ftello (FILE *__stream) ;
# 731 "/usr/include/stdio.h" 3 4
extern int fgetpos (FILE *__restrict __stream, fpos_t *__restrict __pos);
extern int fsetpos (FILE *__stream, const fpos_t *__pos);
# 757 "/usr/include/stdio.h" 3 4
extern void clearerr (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__));
extern int feof (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__)) ;
extern int ferror (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__)) ;
extern void clearerr_unlocked (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__));
extern int feof_unlocked (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__)) ;
extern int ferror_unlocked (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__)) ;
extern void perror (const char *__s);
# 1 "/usr/include/x86_64-linux-gnu/bits/sys_errlist.h" 1 3 4
# 26 "/usr/include/x86_64-linux-gnu/bits/sys_errlist.h" 3 4
extern int sys_nerr;
extern const char *const sys_errlist[];
# 782 "/usr/include/stdio.h" 2 3 4
extern int fileno (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__)) ;
extern int fileno_unlocked (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__)) ;
# 800 "/usr/include/stdio.h" 3 4
extern FILE *popen (const char *__command, const char *__modes) ;
extern int pclose (FILE *__stream);
extern char *ctermid (char *__s) __attribute__ ((__nothrow__ , __leaf__));
# 840 "/usr/include/stdio.h" 3 4
extern void flockfile (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__));
extern int ftrylockfile (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__)) ;
extern void funlockfile (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__));
# 858 "/usr/include/stdio.h" 3 4
extern int __uflow (FILE *);
extern int __overflow (FILE *, int);
# 873 "/usr/include/stdio.h" 3 4
# 20 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 2
# 21 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
void __DSVERIFIER_assume(_Bool expression){
__ESBMC_assume(expression);
# 33 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
}
void __DSVERIFIER_assert(_Bool expression){
# 36 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 3 4
((void) sizeof ((
# 36 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
expression
# 36 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 36 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
expression
# 36 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 3 4
) ; else __assert_fail (
# 36 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
"expression"
# 36 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h", 36, __extension__ __PRETTY_FUNCTION__); }))
# 36 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
;
}
void __DSVERIFIER_assert_msg(_Bool expression, char * msg){
printf("%s", msg);
# 41 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 3 4
((void) sizeof ((
# 41 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
expression
# 41 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 41 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
expression
# 41 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 3 4
) ; else __assert_fail (
# 41 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
"expression"
# 41 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h", 41, __extension__ __PRETTY_FUNCTION__); }))
# 41 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
;
}
# 22 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/fixed-point.h" 1
# 27 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/fixed-point.h"
# 1 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stdint.h" 1 3 4
# 9 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stdint.h" 3 4
# 1 "/usr/include/stdint.h" 1 3 4
# 26 "/usr/include/stdint.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/libc-header-start.h" 1 3 4
# 27 "/usr/include/stdint.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/wchar.h" 1 3 4
# 29 "/usr/include/stdint.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/wordsize.h" 1 3 4
# 30 "/usr/include/stdint.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/stdint-uintn.h" 1 3 4
# 24 "/usr/include/x86_64-linux-gnu/bits/stdint-uintn.h" 3 4
# 24 "/usr/include/x86_64-linux-gnu/bits/stdint-uintn.h" 3 4
typedef __uint8_t uint8_t;
typedef __uint16_t uint16_t;
typedef __uint32_t uint32_t;
typedef __uint64_t uint64_t;
# 38 "/usr/include/stdint.h" 2 3 4
typedef __int_least8_t int_least8_t;
typedef __int_least16_t int_least16_t;
typedef __int_least32_t int_least32_t;
typedef __int_least64_t int_least64_t;
typedef __uint_least8_t uint_least8_t;
typedef __uint_least16_t uint_least16_t;
typedef __uint_least32_t uint_least32_t;
typedef __uint_least64_t uint_least64_t;
typedef signed char int_fast8_t;
typedef long int int_fast16_t;
typedef long int int_fast32_t;
typedef long int int_fast64_t;
# 71 "/usr/include/stdint.h" 3 4
typedef unsigned char uint_fast8_t;
typedef unsigned long int uint_fast16_t;
typedef unsigned long int uint_fast32_t;
typedef unsigned long int uint_fast64_t;
# 87 "/usr/include/stdint.h" 3 4
typedef long int intptr_t;
typedef unsigned long int uintptr_t;
# 101 "/usr/include/stdint.h" 3 4
typedef __intmax_t intmax_t;
typedef __uintmax_t uintmax_t;
# 10 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stdint.h" 2 3 4
# 28 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/fixed-point.h" 2
# 1 "/usr/include/inttypes.h" 1 3 4
# 34 "/usr/include/inttypes.h" 3 4
typedef int __gwchar_t;
# 266 "/usr/include/inttypes.h" 3 4
typedef struct
{
long int quot;
long int rem;
} imaxdiv_t;
# 290 "/usr/include/inttypes.h" 3 4
extern intmax_t imaxabs (intmax_t __n) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__const__));
extern imaxdiv_t imaxdiv (intmax_t __numer, intmax_t __denom)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__const__));
extern intmax_t strtoimax (const char *__restrict __nptr,
char **__restrict __endptr, int __base) __attribute__ ((__nothrow__ , __leaf__));
extern uintmax_t strtoumax (const char *__restrict __nptr,
char ** __restrict __endptr, int __base) __attribute__ ((__nothrow__ , __leaf__));
extern intmax_t wcstoimax (const __gwchar_t *__restrict __nptr,
__gwchar_t **__restrict __endptr, int __base)
__attribute__ ((__nothrow__ , __leaf__));
extern uintmax_t wcstoumax (const __gwchar_t *__restrict __nptr,
__gwchar_t ** __restrict __endptr, int __base)
__attribute__ ((__nothrow__ , __leaf__));
# 432 "/usr/include/inttypes.h" 3 4
# 29 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/fixed-point.h" 2
# 30 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/fixed-point.h"
extern implementation impl;
typedef int64_t fxp_t;
fxp_t _fxp_one;
fxp_t _fxp_half;
fxp_t _fxp_minus_one;
fxp_t _fxp_min;
fxp_t _fxp_max;
double _dbl_max;
double _dbl_min;
fxp_t _fxp_fmask;
fxp_t _fxp_imask;
static const double scale_factor[31] = { 1.0, 2.0, 4.0, 8.0, 16.0, 32.0, 64.0,
128.0, 256.0, 512.0, 1024.0, 2048.0, 4096.0, 8192.0, 16384.0, 32768.0,
65536.0, 131072.0, 262144.0, 524288.0, 1048576.0, 2097152.0, 4194304.0,
8388608.0, 16777216.0, 33554432.0, 67108864.0, 134217728.0,
268435456.0, 536870912.0, 1073741824.0 };
static const double scale_factor_inv[31] = { 1.0, 0.5, 0.25, 0.125, 0.0625,
0.03125, 0.015625, 0.0078125, 0.00390625, 0.001953125, 0.0009765625,
0.00048828125, 0.000244140625, 0.0001220703125, 0.00006103515625,
0.000030517578125, 0.000015258789063, 0.000007629394531,
0.000003814697266, 0.000001907348633, 0.000000953674316,
0.000000476837158, 0.000000238418579, 0.000000119209290,
0.000000059604645, 0.000000029802322, 0.000000014901161,
0.000000007450581, 0.000000003725290, 0.000000001862645,
0.000000000931323 };
static const float rand_uni[10000] = { -0.486240329978498f, -0.0886462298529236f, -0.140307596103306f, 0.301096597450952f, 0.0993171079928659f, 0.971751769763271f, 0.985173975730828f, 0.555993645184930f, 0.582088652691427f, -0.153377496651175f, 0.383610009058905f, -0.335724126391271f, 0.978768141636516f, -0.276250018648572f, 0.390075705739569f, -0.179022404038782f, 0.690083827115783f, -0.872530132490992f, -0.970585763293203f, -0.581476053441704f, -0.532614615674888f, -0.239699306693312f, -0.678183014035494f, 0.349502640932782f, -0.210469890686263f, 0.841262085391842f, -0.473585465151401f, 0.659383565443701f, -0.651160036945754f, -0.961043527561335f, -0.0814927639199137f, 0.621303110569702f, -0.784529166943541f, 0.0238464770757800f, 0.392694728594110f, 0.776848735202001f, 0.0870059709310509f, 0.880563655271790f, 0.883457036977564f, -0.249235082877382f, -0.691040749216870f, 0.578731120064320f, -0.973932858000832f, -0.117699105431720f, -0.723831748151088f, -0.483149657477524f, -0.821277691383664f, -0.459725618100875f, 0.148175952221864f, 0.444306875534854f, -0.325610376336498f, 0.544142311404910f, -0.165319440455435f, 0.136706800705517f, 0.543312481350682f, 0.467210959764607f, -0.349266618228534f, -0.660110730565862f, 0.910332331495431f, 0.961049802789367f, -0.786168905164629f, 0.305648402726554f, 0.510815258508885f, 0.0950733260984060f, 0.173750645487898f, 0.144488668408672f, 0.0190031984466126f, -0.299194577636724f, 0.302411647442273f, -0.730462524226212f, 0.688646006554796f, 0.134948379722118f, 0.533716723458894f, -0.00226300779660438f, -0.561340777806718f, 0.450396313744017f, -0.569445876566955f, 0.954155246557698f, -0.255403882430676f, -0.759820984120828f, -0.855279790307514f, -0.147352581758156f, -0.302269055643746f, -0.642038024364086f, -0.367405981107491f, 0.491844011712164f, -0.542191710121194f, -0.938294043323732f, 0.683979894338020f, 0.294728290855287f, 0.00662691839443919f, -0.931040350582855f, 0.152356209974418f, 0.678620860551457f, -0.534989269238408f, 0.932096367913226f, -0.0361062818028513f, -0.847189697149530f, -0.975903030160255f, 0.623293205784014f, -0.661289688031659f, 0.724486055119603f, 0.307504095172835f, 0.00739266163731767f, -0.393681596442097f, 0.0313739422974388f, 0.0768157689673350f, -0.652063346886817f, 0.864188030044388f, -0.588932092781034f, 0.496015896758580f, -0.872858269231211f, 0.978780599551039f, -0.504887732991147f, -0.462378791937628f, 0.0141726829338038f, 0.769610007653591f, 0.945233033188923f, -0.782235375325016f, -0.832206533738799f, 0.745634368088673f, -0.696969510157151f, -0.0674631869948374f, -0.123186450806584f, -0.359158959141949f, -0.393882649464391f, 0.441371446689899f, -0.829394270569736f, -0.301502651277431f, -0.996215501187289f, 0.934634037393066f, -0.282431114746289f, -0.927550795619590f, -0.437037530043415f, -0.360426812995980f, 0.949549724575862f, 0.502784616197919f, 0.800771681422909f, -0.511398929004089f, 0.309288504642554f, -0.207261227890933f, 0.930587995125773f, -0.777029876696670f, -0.489329175755640f, -0.134595132329858f, 0.285771358983518f, 0.182331373854387f, -0.544110494560697f, 0.278439882883985f, -0.556325158102182f, 0.579043806545889f, 0.134648133801916f, 0.602850725479294f, -0.151663563868883f, 0.180694361855878f, -0.651591295315595f, 0.281129147768056f, -0.580047306475484f, 0.687883075491433f, 0.279398670804288f, -0.853428128249503f, -0.532609367372680f, -0.821156786377917f, -0.181273229058573f, -0.983898569846882f, -0.0964374318311501f, 0.880923372124250f, 0.102643371392389f, 0.893615387135596f, -0.259276649383649f, 0.699287743639363f, 0.402940604635828f, -0.110721596226581f, 0.0846246472582877f, 0.820733021865405f, 0.795578903285308f, -0.495144122011537f, 0.273150029257472f, -0.268249949701437f, 0.231982193341980f, 0.694211299124074f, 0.859950868718233f, 0.959483382623794f, -0.422972626833543f, -0.109621798738360f, 0.433094703426531f, 0.694025903378851f, 0.374478987547435f, -0.293668545105608f, -0.396213864190828f, -0.0632095887099047f, -0.0285139536748673f, 0.831794132192390f, -0.548543088139238f, 0.791869201724680f, 0.325211484201845f, 0.155274810721772f, -0.112383643064821f, -0.674403070297721f, 0.642801068229810f, -0.615712048835242f, -0.322576771285566f, -0.409336818836595f, 0.548069973193770f, -0.386353709407947f, -0.0741664985357784f, 0.619639599324983f, -0.815703814931314f, 0.965550307223862f, 0.623407852683828f, -0.789634372832984f, 0.736750050047572f, -0.0269443926793700f, 0.00545706093721488f, -0.315712479832091f, -0.890110021644720f, -0.869390443173846f, -0.381538869981866f, -0.109498998005949f, 0.131433952330613f, -0.233452413139316f, 0.660289822785465f, 0.543381186340023f, -0.384712418750451f, -0.913477554164890f, 0.767102957655267f, -0.115129944521936f, -0.741161985822647f, -0.0604180020782450f, -0.819131535144059f, -0.409539679760029f, 0.574419252943637f, -0.0440704617157433f, 0.933173744590532f, 0.261360623390448f, -0.880290575543046f, 0.329806293425492f, 0.548915621667952f, 0.635187167795234f, -0.611034070318967f, 0.458196727901944f, 0.397377226781023f, 0.711941361933987f, 0.782147744383368f, -0.00300685339552631f, 0.384687233450957f, 0.810102466029521f, 0.452919847968424f, -0.183164257016897f, -0.755603185485427f, -0.604334477365858f, -0.786222413488860f, -0.434887500763099f, -0.678845635625581f, -0.381200370488331f, -0.582350534916068f, -0.0444427346996734f, 0.116237247526397f, -0.364680921206275f, -0.829395404347498f, -0.258574590032613f, -0.910082114298859f, 0.501356900925997f, 0.0295361922006900f, -0.471786618165219f, 0.536352925101547f, -0.316120662284464f, -0.168902841718737f, 0.970850119987976f, -0.813818666854395f, -0.0861183123848732f, 0.866784827877161f, 0.535966478165739f, -0.806958669103425f, -0.627307415616045f, -0.686618354673079f, 0.0239165685193152f, 0.525427699287402f, 0.834079334357391f, -0.527333932295852f, 0.130970034225907f, -0.790218350377199f, 0.399338640441987f, 0.133591886379939f, -0.181354311053254f, 0.420121912637914f, -0.625002202728601f, -0.293296669160307f, 0.0113819513424340f, -0.882382002895096f, -0.883750159690028f, 0.441583656876336f, -0.439054135454480f, 0.873049498123622f, 0.660844523562817f, 0.0104240153103699f, 0.611420248331623f, -0.235926309432748f, 0.207317724918460f, 0.884691834560657f, 0.128302402592277f, -0.283754448219060f, 0.237649901255856f, 0.610200763264703f, -0.625035441247926f, -0.964609592118695f, -0.323146562743113f, 0.961529402270719f, -0.793576233735450f, -0.843916713821003f, 0.314105102728384f, -0.204535560653294f, 0.753318789613803f, 0.160678386635821f, -0.647065919861379f, -0.202789866826280f, 0.648108234268198f, -0.261292621025902f, 0.156681828732770f, 0.405377351820066f, 0.228465381497500f, 0.972348516671163f, 0.288346037401522f, -0.0799068604307178f, 0.916939290109587f, -0.279220972402209f, -0.203447523864279f, -0.533640046855273f, 0.543561961674653f, 0.880711097286889f, -0.549683064687774f, 0.0130107219236368f, -0.554838164576024f, -0.379442406201385f, -0.00500104610043062f, 0.409530122826868f, -0.580423080726061f, 0.824555731914455f, -0.254134502966922f, 0.655609706875230f, 0.629093866184236f, -0.690033250889974f, -0.652346551677826f, 0.169820593515952f, 0.922459552232043f, 0.351812083539940f, 0.876342426613034f, -0.513486005850680f, -0.626382302780497f, -0.734690688861027f, 0.245594886018314f, -0.875740935105191f, -0.388580462918006f, 0.0127041754106421f, -0.0330962560066819f, -0.425003146474193f, 0.0281641353527495f, 0.261441358666622f, 0.949781327102773f, 0.919646340564270f, 0.504503377003781f, 0.0817071051871894f, 0.319968570729658f, 0.229065413577318f, -0.0512608414259468f, -0.0740848540944785f, -0.0974457038582892f, 0.532775710298005f, -0.492913317622840f, 0.492871078783642f, -0.289562388384881f, 0.229149968879593f, 0.697586903105899f, 0.900855243684925f, 0.969700445892771f, -0.618162745501349f, -0.533241431614228f, -0.937955908995453f, 0.886669636523452f, 0.498748076602594f, 0.974106016180519f, -0.199411214757595f, 0.725270392729083f, -0.0279932700005097f, -0.889385821767448f, -0.452211028905500f, -0.487216271217731f, -0.577105004471439f, 0.777405674160298f, 0.390121144627092f, -0.595062864225581f, -0.844712795815575f, -0.894819796738658f, 0.0556635002662202f, 0.200767245646242f, 0.481227096067452f, -0.0854169009474664f, 0.524532943920022f, -0.880292014538901f, -0.127923833629789f, -0.929275628802356f, 0.233276357260949f, -0.776272194935070f, 0.953325886548014f, -0.884399921036004f, -0.504227548828417f, -0.546526107689276f, 0.852622421886067f, 0.947722695551154f, -0.668635552599119f, 0.768739709906834f, 0.830755876586102f, -0.720579994994166f, 0.761613532216491f, 0.340510345777526f, 0.335046764810816f, 0.490102926886310f, -0.568989013749608f, -0.296018470377601f, 0.979838924243657f, 0.624231653632879f, 0.553904401851075f, -0.355359451941014f, 0.267623165480721f, 0.985914275634075f, -0.741887849211797f, 0.560479100333108f, -0.602590162007993f, -0.874870765077352f, -0.0306218773384892f, 0.963145768131215f, 0.544824028787036f, -0.133990816021791f, 0.0679964588712787f, -0.156401335214901f, -0.0802554171832672f, 0.856386218492912f, 0.143013580527942f, 0.403921859374840f, -0.179029058044097f, 0.770723540077919f, -0.183650969350452f, -0.340718434629824f, 0.217166124261387f, -0.171159949445977f, 0.127493767348173f, -0.649649349141405f, -0.0986978180993434f, 0.301786606637125f, 0.942172200207855f, 0.0323236270151113f, -0.579853744301016f, -0.964413060851558f, 0.917535782777861f, 0.442144649483292f, -0.684960854610878f, -0.418908715566712f, 0.617844265088789f, 0.897145578082386f, 0.235463167636481f, 0.0166312355859484f, 0.948331447443040f, -0.961085640409103f, -0.0386086809179784f, -0.949138997977665f, 0.738211385880427f, 0.613757309091864f, -0.606937832993426f, 0.825253298062192f, 0.932609757667859f, -0.169023247637751f, -0.411237965787391f, 0.550590803600950f, -0.0561729280137304f, -0.559663108323671f, -0.718592671237337f, 0.885889621415361f, -0.364207826334344f, -0.839614660327507f, 0.265502694339344f, 0.394329270534417f, -0.270184577808578f, -0.865353487778069f, -0.528848754655393f, -0.179961524561963f, 0.571721065613544f, -0.774363220756696f, 0.251123315200792f, -0.217722762975159f, 0.0901359910328954f, -0.329445470667965f, 0.366410356722994f, -0.777512662632715f, 0.654844363477267f, -0.882409911562713f, -0.613612530795153f, -0.926517759636550f, 0.111572665207194f, 0.0729846382226607f, 0.789912813274098,
0.784452109264882f, -0.949766989295825f, 0.318378232675431f, 0.732077593075111f, 0.786829143208386f, -0.134682559823644f, 0.733164743374965f, 0.978410877665941f, 0.992008491438409f, -0.319064303035495f, 0.958430683602029f, 0.514518212363212f, 0.101876224417090f, 0.642655735778237f, -0.170746516901312f, 0.252352078365623f, -0.761327278132210f, 0.724119717129199f, 0.889374997869224f, -0.785987369200692f, -0.594670344572584f, 0.805192297495935f, -0.990523259595814f, 0.483998949026664f, 0.747350619254878f, -0.824845161088780f, 0.543009506581798f, -0.208778528683094f, -0.314149951901368f, 0.943576771177672f, -0.102633559170861f, -0.947663019606703f, -0.557033071578968f, 0.419150797499848f, 0.251214274356296f, 0.565717763755325f, 0.126676667925064f, -0.0213369479214840f, 0.342212953426240f, -0.288015274572288f, 0.121313363277304f, 0.452832374494206f, 0.545420403121955f, -0.616024063400938f, -0.0320352392995826f, -0.400581850938279f, 0.0642433474653812f, -0.673966224453150f, 0.951962939602010f, -0.241906012952983f, 0.0322060960995099f, -0.449185553826233f, -0.709575766146540f, 0.0283340814242898f, 0.234237103593580f, -0.285526615094797f, -0.793192668153991f, -0.437130485497140f, -0.956132143306919f, 0.601158367473616f, 0.238689691528783f, 0.173709925321432f, 0.437983847738997f, 0.397380645202102f, 0.432093344086237f, -0.0338869881121104f, -0.966303269542493f, 0.875351570183604f, -0.0584554089652962f, 0.294207497692552f, 0.200323088145182f, 0.826642387259759f, 0.284806025494260f, -0.00660991970522007f, 0.682493772727303f, -0.151980775670668f, 0.0470705546940635f, -0.236378427235531f, -0.844780853112247f, 0.134166207564174f, -0.586842667384924f, 0.0711866699414370f, 0.311698821368897f, -0.361229767252053f, 0.750924311039976f, 0.0764323989785694f, 0.898463708247144f, 0.398232179543916f, -0.515644913011399f, -0.189067061520362f, -0.567430593060929f, -0.641924269747436f, -0.0960378699625619f, -0.792054031692334f, 0.803891878854351f, -0.233518627249889f, -0.892523453249154f, 0.707550017996875f, -0.782288435525895f, -0.156166443894764f, -0.543737876329167f, 0.565637809380957f, -0.757689989749326f, -0.612543942167974f, -0.766327195073259f, 0.587626843767440f, -0.280769385897397f, -0.457487372245825f, 0.0862799426622438f, -0.616867284053547f, 0.121778903484808f, -0.451988651573766f, -0.618146087265495f, -0.285868777534354f, 0.108999472244014f, -0.620755183347358f, -0.268563184810196f, -0.721678169615489f, -0.146060198874409f, -0.661506858070617f, 0.901707853998409f, 0.222488776533930f, 0.679599685031679f, 0.974760448601209f, 0.535485953830496f, -0.562345697123585f, 0.369219363331071f, -0.0282801684694869f, -0.0734880727832297f, 0.733216287314358f, -0.514352095765627f, -0.850813063545195f, 0.642458447327163f, 0.118661521915783f, -0.907015526838341f, 0.789277766886329f, -0.719864125961721f, 0.274329068829509f, 0.830124687647056f, 0.719352367261587f, -0.821767317737384f, -0.840153496829227f, 0.650796781936517f, 0.381065387870166f, 0.341870564586224f, -0.00174423702285131f, -0.216348832349188f, 0.678010477635713f, -0.748695103596683f, -0.819659325555269f, 0.620922373008647f, 0.471659250504894f, 0.417848292160984f, -0.990577315445198f, -0.509842007818877f, 0.705761459091187f, 0.723072116074702f, -0.606476484252158f, -0.871593699865195f, -0.662059658667501f, -0.207267692377271f, -0.274706370444270f, 0.317047325063391f, 0.329780707114887f, -0.966325651181920f, -0.666131009799803f, 0.118609206658210f, 0.232960448350140f, -0.139134616436389f, -0.936412642687343f, -0.554985387484625f, -0.609914445911143f, -0.371023087262482f, -0.461044793696911f, 0.0277553171809701f, -0.241589304772568f, -0.990769995548029f, 0.114245771600061f, -0.924483328431436f, 0.237901450206836f, -0.615461633242452f, 0.201497106528945f, -0.599898812620374f, 0.982389910778332f, 0.125701388874024f, -0.892749115498369f, 0.513592673006880f, 0.229316745749793f, 0.422997355912517f, 0.150920221978738f, 0.447743452078441f, 0.366767059168664f, -0.605741985891581f, 0.274905013892524f, -0.861378867171578f, -0.731508622159258f, 0.171187057183023f, 0.250833501952177f, -0.609814068526718f, -0.639397597618127f, -0.712497631420166f, -0.539831932321101f, -0.962361328901384f, 0.799060001548069f, 0.618582550608426f, -0.603865594092701f, -0.750840334759883f, -0.432368099184739f, -0.581021252111797f, 0.134711953024238f, 0.331863889421602f, -0.172907726656169f, -0.435358718118896f, -0.689326993725649f, 0.415840315809038f, -0.333576262820904f, 0.279343777676723f, -0.0393098862927832f, 0.00852090010085194f, -0.853705195692250f, 0.526006696633762f, -0.478653377052437f, -0.584840261391485f, 0.679261003071696f, 0.0367484618219474f, -0.616340335633997f, -0.912843423145420f, -0.221248732289686f, -0.477921890680232f, -0.127369625511666f, 0.865190146410824f, 0.817916456258544f, 0.445973590438029f, -0.621435280140991f, -0.584264056171687f, 0.718712277931876f, -0.337835985469843f, 0.00569064504159345f, -0.546546294846311f, 0.101653624648361f, -0.795498735829364f, -0.249043531299132f, -0.112839395737321f, -0.350305425122331f, -0.910866368205041f, 0.345503177966105f, -0.549306515692918f, 0.711774722622726f, 0.283368922297518f, 0.0401988801224620f, 0.269228967910704f, 0.408165826013612f, -0.306571373865680f, 0.937429053394878f, 0.992154362395068f, 0.679431847774404f, 0.660561953302554f, 0.903254489326130f, -0.939312119455540f, -0.211194531611303f, 0.401554296146757f, -0.0373187111351370f, -0.209143098987164f, -0.483955198209448f, -0.860858509666882f, 0.847006442151417f, 0.287950263267018f, 0.408253171937961f, -0.720812569529331f, 0.623305171273525f, 0.543495760078790f, -0.364025150023839f, -0.893335585394842f, -0.757545415624741f, -0.525417020183382f, -0.985814550271000f, -0.571551008375522f, 0.930716377819686f, -0.272863385293023f, 0.982334910750391f, 0.297868844366342f, 0.922428080219044f, 0.917194773824871f, 0.846964493212884f, 0.0641834146212110f, 0.279768184306094f, 0.591959126556958f, 0.355630573995206f, 0.839818707895839f, 0.219674727597944f, -0.174518904670883f, 0.708669864813752f, -0.224562931791369f, 0.677232454840133f, -0.904826802486527f, -0.627559033402838f, 0.263680517444611f, 0.121902314059156f, -0.704881790282995f, 0.242825089229032f, -0.309373554231866f, -0.479824461459095f, -0.720536286348018f, -0.460418173937526f, 0.774174710513849f, 0.452001499049874f, -0.316992092650694f, 0.153064869645527f, -0.209558599627989f, 0.685508351648252f, -0.508615450383790f, 0.598109567185095f, 0.391177475074196f, 0.964444988755186f, 0.336277292954506f, -0.0367817159101076f, -0.668752640081528f, 0.169621732437504f, -0.440925495294537f, 0.352359477392856f, 0.300517139597811f, 0.464188724292127f, 0.342732840629593f, -0.772028689116952f, 0.523987886508557f, 0.920723209445309f, 0.325634245623597f, 0.999728757965472f, -0.108202444213629f, -0.703463061246440f, -0.764321104361266f, 0.153478091277821f, 0.400776808520781f, 0.0362608595686520f, 0.602660289034871f, -0.00396673312072204f, 0.296881393918662f, 0.563978362789779f, 0.849699999703012f, 0.699481370949461f, -0.517318771826836f, 0.488696839410786f, -0.863267084031406f, 0.0353144039838211f, 0.346060763700543f, 0.964270355001567f, 0.354899825242107f, 0.806313705199543f, 0.675286452110240f, 0.0873918818789949f, -0.595319879813140f, 0.768247284622921f, 0.424433552458434f, -0.308023836359512f, 0.802163480612923f, -0.348151008192881f, -0.889061130591849f, -0.593277042719599f, -0.669426232128590f, 0.758542808803890f, 0.515943031751579f, -0.359688459650311f, 0.568175936707751f, 0.741304023515212f, 0.260283681057109f, 0.957668849401749f, -0.665096753421305f, 0.769229664798946f, -0.0871019488695104f, -0.362662093346394f, -0.411439775739547f, 0.700347493632751f, 0.593221225653487f, 0.712841887456470f, 0.413663813878195f, -0.868002281057698f, -0.704419248587642f, 0.497097875881516f, -0.00234623694758684f, 0.690202361192435f, -0.850266199595343f, 0.315244026446767f, 0.709124123964306f, 0.438047076925768f, 0.798239617424585f, 0.330853072912708f, 0.581059745965701f, 0.449755612947191f, -0.462738032798907f, 0.607731925865227f, 0.0898348455002427f, -0.762827831849901f, 0.895598896497952f, -0.752254194382105f, -0.0916186048978613f, -0.906243795607547f, 0.229263971313788f, 0.401148319671400f, -0.699999035942240f, 0.949897297168705f, 0.442965954562621f, -0.836602533575693f, 0.960460356865877f, -0.588638958628591f, -0.826876652501322f, 0.358883606332526f, 0.963216314331105f, -0.932992215875777f, -0.790078242370583f, 0.402080896170037f, -0.0768348888017805f, 0.728030138891631f, -0.259252300581205f, -0.239039520569651f, -0.0343187629251645f, -0.500656851699075f, 0.213230170834557f, -0.806162554023268f, -0.346741158269134f, 0.593197383681288f, -0.874207905790597f, 0.396896283395687f, -0.899758892162590f, 0.645625478431829f, 0.724064646901595f, 0.505831437483414f, -0.592809028527107f, 0.191058921738261f, 0.329699861086760f, 0.637747614705911f, 0.228492417185859f, 0.350565075483143f, 0.495645634191973f, 0.0378873636406241f, -0.558682871042752f, -0.0463515226573312f, -0.699882077624744f, -0.727701564368345f, -0.185876979038391f, 0.969357227041006f, -0.0396554302826258f, 0.994123321254905f, -0.103700411263859f, -0.122414150286554f, -0.952967253268750f, -0.310113557790019f, 0.389885130024049f, 0.698109781822753f, -0.566884614177461f, -0.807731715569885f, 0.295459359747620f, 0.353911434620388f, -0.0365360121873806f, -0.433710246410727f, -0.112374658849445f, -0.710362620548396f, -0.750188568899340f, -0.421921409270312f, -0.0946825033112555f, -0.207114343395422f, -0.712346704375406f, -0.762905208265238f, 0.668705185793373f, 0.874811836887758f, 0.734155331047614f, 0.0717699959166771f, -0.649642655211151f, 0.710177200600726f, -0.790892796708330f, -0.609051316139055f, 0.158155751049403f, 0.273837117392194f, 0.101461674737037f, -0.341978434311156f, 0.358741707078855f, 0.415990974906378f, 0.760270133083538f, 0.164383469371383f, 0.559847879549422f, 0.209104118141764f, -0.265721227148806f, 0.165407943936551f, 0.611035396421350f, -0.626230501208063f, -0.116714293310250f, -0.696697517286888f, 0.0545261414014888f, 0.440139257477096f, 0.202311640602444f, -0.369311356303593f, 0.901884565342531f, 0.256026357399272f, -0.673699547202088f, 0.108550667621349f, -0.961092940829968f, -0.254802826645023f, 0.553897912330318f, 0.110751075533042f, -0.587445414043347f, 0.786722059164009,
0.182042556749386f, 0.398835909383655f, 0.431324012457533f, 0.587021142157922f, -0.644072183989352f, 0.187430090296218f, 0.516741122998546f, -0.275250933267487f, -0.933673413249875f, -0.767709448823879f, 0.00345814033609182f, -0.585884382069128f, 0.463549040471035f, 0.666537178805293f, -0.393605927315148f, -0.260156573858491f, -0.298799291489529f, -0.246398415746503f, 0.970774181159203f, -0.485708631308223f, -0.456571313115555f, -0.264210030877189f, -0.442583504871362f, 0.0585567697312368f, 0.955769232723545f, 0.651822742221258f, 0.667605490119116f, -0.178564750516287f, 0.744464599638885f, -0.0962758978504710f, -0.538627454923738f, -0.844634654117462f, 0.109151162611125f, -0.862255427201396f, -0.478955305843323f, 0.645965860697344f, 0.345569271369828f, 0.930605011671297f, -0.195523686135506f, 0.927940875293964f, 0.0529927450986318f, -0.537243314646225f, 0.0815400161801159f, -0.528889663721737f, -0.0803965087898244f, 0.722188412643543f, -0.115173100460772f, 0.391581967064874f, 0.609102624309301f, -0.726409099849031f, -0.924071529212721f, -0.424370859730340f, -0.932399086010354f, -0.679903916227243f, 0.398593637781810f, -0.395942610474455f, 0.911017267923838f, 0.830660098751580f, 0.485689056693942f, -0.634874052918746f, 0.558342102044082f, 0.153345477027740f, -0.418797532948752f, -0.962412446404476f, 0.499334884055701f, 0.772755578982235f, 0.486905718186221f, -0.680415982465391f, -0.983589696155766f, 0.0802707365440833f, -0.108186099494932f, 0.272227706025405f, 0.651170828846750f, -0.804713753056757f, 0.778076504684911f, 0.869094633196957f, -0.213764089899489f, -0.289485853647921f, -0.248376169846176f, -0.273907386272412f, -0.272735585352615f, -0.851779302143109f, 0.777935500545070f, 0.610526499062369f, -0.825926925832998f, -0.00122853287679647f, -0.250920102747366f, -0.0333860483260329f, 0.562878228390427f, 0.685359102189134f, 0.909722844787783f, -0.686791591637469f, 0.700018932525581f, -0.975597558640926f, 0.111273045778084f, 0.0313167229308478f, -0.185767397251192f, -0.587922465203314f, -0.569364866257444f, -0.433710470415537f, 0.744709870476354f, 0.812284989338678f, -0.835936210940005f, 0.409175739115410f, 0.364745324015946f, -0.526496413512530f, -0.0949041293633228f, -0.710914623019602f, -0.199035360261516f, 0.249903358254580f, 0.799197892184193f, -0.974131439735146f, -0.962913228246770f, -0.0584067290846062f, 0.0678080882131218f, 0.619989552612058f, 0.600692636138022f, -0.325324145536173f, 0.00758797937831957f, -0.133193608214778f, -0.312408219890363f, -0.0752971209304969f, 0.764751638735404f, 0.207290375565515f, -0.965680055629168f, 0.526346325957267f, 0.365879948128040f, -0.899713698342006f, 0.300806506284083f, 0.282047017067903f, -0.464418831301796f, -0.793644005532544f, -0.338781149582286f, 0.627059412508279f, -0.624056896643864f, -0.503708045945915f, 0.339203903916317f, -0.920899287490514f, -0.753331218450680f, -0.561190137775443f, 0.216431106588929f, -0.191601189620092f, 0.613179188721972f, 0.121381145781083f, -0.477139741951367f, 0.606347924649253f, 0.972409497819530f, 0.00419185232258634f, 0.786976564006247f, 0.716984027373809f, -0.577296880358192f, 0.336508364109364f, -0.837637061538727f, -0.706860533591818f, 0.655351330285695f, -0.799458036429467f, 0.804951754011505f, 0.405471126911303f, 0.485125485165526f, 0.0354103156047567f, 0.774748847269929f, 0.396581375869036f, 0.420464745452802f, -0.544531741676535f, -0.779088258182329f, -0.129534599431145f, 0.228882319223921f, 0.669504936432777f, -0.158954596495398f, -0.171927546721685f, 0.675107968066445f, -0.201470217862098f, -0.185894687796509f, 0.244174688826684f, 0.310288210346694f, -0.0674603586289346f, 0.138103839181198f, 0.269292861340219f, 0.121469813317732f, 0.168629748875041f, 0.581112629873687f, 0.499508530746584f, -0.741772433024897f, -0.311060071316150f, -0.263697352439521f, 0.180487383518774f, -0.800786488742242f, -0.949903966987338f, 0.134975524166410f, 0.213364683193138f, -0.684441197699222f, -0.254697287796379f, -0.260521050814253f, -0.757605554637199f, -0.134324873215927f, -0.699675596579060f, 0.136000646890289f, 0.355272520354523f, -0.712620797948690f, -0.729995036352282f, 0.323100037780915f, -0.718364487938777f, 0.807709622188084f, 0.289336059472722f, -0.558738026311145f, -0.591811756545896f, -0.894952978489225f, -0.354996929975694f, -0.142213103464027f, -0.651950180085633f, 0.182694586161578f, -0.193492058009904f, -0.540079537334588f, -0.300927433533712f, 0.119585035086049f, 0.895807833710939f, -0.413843745301811f, -0.209041322713332f, 0.808094803654324f, 0.0792829008489782f, 0.314806980452270f, 0.502591873175427f, -0.0474189387090473f, -0.407131047818007f, 0.797117088440354f, 0.902395237588928f, -0.783327055804990f, -0.591709085168646f, 0.628191184754911f, -0.454649879692076f, -0.588819444306752f, 0.250889716959370f, -0.582306627010669f, -0.145495766591841f, -0.634137346823528f, 0.667934845545285f, 0.873756470938530f, 0.425969845715827f, -0.779543910541245f, -0.265210219994391f, 0.781530681845886f, 0.304461599274577f, 0.211087853085430f, 0.281022407596766f, 0.0701313665097776f, 0.342337400087349f, -0.0618264046031387f, 0.177147380816613f, 0.751693209867024f, -0.279073264607508f, 0.740459307255654f, -0.352163564204507f, -0.726238685136937f, -0.565819729501492f, -0.779416133306559f, -0.783925450697670f, 0.542612245021260f, -0.810510148278478f, -0.693707081804938f, 0.918862988543900f, -0.368717045271828f, 0.0654919784331340f, -0.438514219239944f, -0.923935138084824f, 0.913316783811291f, -0.961646539574340f, 0.734888382653474f, -0.464102713631586f, -0.896154678819649f, 0.349856565392685f, 0.646610836502422f, -0.104378701809970f, 0.347319102015858f, -0.263947819351090f, 0.343722186197186f, 0.825747554146473f, 0.0661865525544676f, 0.918864908112419f, -0.999160312662909f, -0.904953244747070f, 0.246613032125664f, 0.123426960800262f, -0.294364203503845f, -0.150056966431615f, 0.904179479721301f, 0.517721252782648f, 0.661473373608678f, -0.784276966825964f, -0.984631287069650f, 0.239695484607744f, -0.499150590123099f, 0.00153518224500027f, -0.817955534401114f, 0.221240310713583f, 0.114442325207070f, -0.717650856748245f, -0.722902799253535f, -0.962998380704103f, 0.214092155997873f, -0.226370691123970f, 0.536806140446569f, 0.111745807092858f, 0.657580594136395f, -0.239950592200226f, 0.0981270621736083f, -0.173398466414235f, 0.414811672195735f, 0.147604904291238f, -0.649219724907210f, 0.907797399703411f, -0.496097071857490f, -0.0958082520749422f, -0.700618145301611f, 0.238049932994406f, 0.946616020659334f, 0.143538494511824f, 0.0641076718667677f, 0.377873848622552f, -0.413854028741624f, -0.838831021130186f, 0.0208044297354626f, 0.476712667979210f, 0.850908020233298f, 0.0692454021020814f, 0.841788714865238f, -0.251777041865926f, 0.512215668857165f, 0.827988589806208f, -0.399200428030715f, 0.999219950547600f, -0.00465542086542259f, 0.279790771964531f, -0.683125623289052f, 0.988128867315143f, 0.00697090775456410f, -0.409501680375786f, -0.190812202162744f, -0.154565639467601f, 0.305734586628079f, -0.922825484202279f, -0.0622811516391562f, -0.502492855870975f, 0.358550513844403f, 0.678271216185703f, -0.940222215291861f, 0.568581934651071f, 0.953835466578938f, -0.476569789986603f, 0.0141049472573418f, 0.722262461730185f, -0.128913572076972f, -0.583948340870808f, -0.254358587904773f, -0.390569309413304f, -0.0495119137883056f, -0.486356443935695f, -0.112768011009410f, -0.608763417511343f, -0.145843822867367f, 0.767829603838659f, 0.791239479733126f, 0.0208376062066382f, -0.524291005204912f, -0.200159553848628f, -0.835647719235620f, -0.222774380961612f, 0.0617292533934060f, 0.233433696650208f, -0.543969878951657f, -0.628168009147650f, -0.725602523060817f, -0.273904472034828f, 0.320527317085229f, -0.556961185821848f, 0.261533413201255f, 0.696617398495973f, 0.200506775746016f, -0.395581923906907f, 0.0196423782530712f, -0.0552577396777472f, -0.594078139517501f, -0.816132673139052f, -0.898431571909616f, 0.879105843430143f, 0.949666380003024f, -0.245578843355682f, 0.528960018663897f, 0.201586039072583f, -0.651684706542954f, 0.596063456431086f, -0.659712784781056f, -0.213702651629353f, -0.629790163054887f, -0.0572029778771013f, 0.645291034768991f, -0.453266855343461f, -0.581253959024410f, 0.632682730071992f, 0.991406037765467f, 0.701390336150136f, -0.879037255220971f, -0.304180069776406f, 0.0969095808767941f, -0.465682778651712f, 0.815108046274786f, -0.532850846043973f, 0.950550134670033f, 0.296008118726089f, -0.198390447541329f, 0.159049143352201f, 0.105169964332594f, -0.482506131358523f, 0.493753482281684f, 0.292058685647414f, 0.283730532860951f, 0.00323819209092657f, 0.765838273699203f, -0.0753176377562099f, -0.679824808630431f, 0.548180003463159f, -0.996048798712591f, 0.782768288046545f, 0.396509190560532f, 0.848686742379558f, 0.750049741585178f, 0.730186188655936f, -0.0220701180542726f, -0.487618042364281f, -0.403562199756249f, -0.0693129490117646f, 0.947019452953246f, -0.731947366410442f, 0.198175872470120f, -0.329413252854837f, -0.641319161749268f, 0.186271826190842f, -0.0739989831663739f, -0.334046268448298f, -0.191676071751509f, -0.632573515889708f, -0.999115061914042f, -0.677989795015932f, 0.289828136337821f, 0.696081747094487f, 0.965765319961706f, -0.203649463803737f, -0.195384468978610f, 0.746979659338745f, 0.701651229142588f, -0.498361303522421f, 0.289120104962302f, 0.270493509228559f, -0.132329670835432f, 0.385545665843914f, -0.265371843427444f, 0.306155119003788f, -0.859790373316264f, -0.0198057838521546f, 0.233572324299025f, 0.426354273793125f, -0.510901479579029f, -0.600001464460011f, -0.972316846268671f, 0.531678082677910f, -0.0543913028234813f, -0.860333915321655f, 0.0717414549918496f, -0.992726205437930f, 0.587189647572868f, -0.710120198811545f, -0.712433353767817f, 0.000905613890617163f, 0.323638959833707f, -0.148002344942812f, 0.422217478090035f, -0.512122539396176f, -0.652032513920892f, -0.0749826795945674f, 0.689725543651565f, 0.00708142459169103f, 0.612282380092436f, -0.182868915402510f, -0.478704046524703f, 0.630078231167476f, -0.201694106935605f, 0.471080354222778f, 0.705764111397718f, 0.504296612895499f, -0.245442802115836f, -0.0255433216413170f, 0.244606720514349f, -0.620852691611321f, 0.130333792055452f, -0.0404066268217753f, 0.533698497858480f, 0.569324696850915f, -0.0208385747745345f, -0.344454279574176f, 0.697793551353488f, 0.223740789443046,
0.0819835387259940f, -0.378565059057637f, 0.265230570199009f, -0.654654047270763f, -0.959845479426107f, -0.524706200047066f, -0.320773238900823f, 0.133125806793072f, 0.204919719422386f, 0.781296208272529f, 0.357447172843949f, -0.295741363322007f, -0.531151992759176f, -0.928760461863525f, -0.492737999698919f, 0.185299312597934f, 0.0308933157463984f, 0.0940868629278078f, -0.223134180713975f, -0.728994909644464f, 0.748645378716214f, 0.602424843862873f, 0.939628558971957f, -0.601577015562304f, -0.178714119359324f, 0.812720866753088f, -0.864296642561293f, 0.448439532249340f, 0.423570043689909f, 0.883922405988390f, -0.121889129001415f, -0.0435604321758833f, -0.823641147317994f, -0.775345608718704f, -0.621149628042832f, 0.532395431283659f, -0.803045105215129f, 0.897460124955135f, 0.432615281777583f, -0.0245386640589920f, -0.822321626075771f, -0.992080038736755f, -0.829220327319793f, 0.125841786813822f, 0.277412627470833f, 0.623989234604340f, -0.207977347981346f, -0.666564975567417f, 0.419758053880881f, -0.146809205344117f, 0.702495819380827f, 0.802212477505035f, 0.161529115911938f, 0.987832568197053f, -0.885776673164970f, -0.608518024629661f, -0.126430573784758f, 0.168260422890915f, -0.517060428948049f, -0.766296586196077f, -0.827624510690858f, -0.149091785188351f, -0.643782325842734f, 0.768634567718711f, 0.815278279059715f, -0.648037361329720f, -0.480742843535214f, 0.983809287193308f, -0.701958358623791f, 0.0797427982273327f, 0.903943825454071f, 0.980486658260621f, 0.207436790541324f, -0.536781321571165f, -0.885473392956838f, -0.626744905152131f, 0.279917970592554f, -0.489532633799085f, 0.402084958261836f, -0.566738134593205f, -0.0990017532286025f, 0.458891753618823f, 0.893734110503312f, 0.541822126435773f, -0.856210577956263f, -0.0354679151809227f, -0.868531503535520f, 0.150589222911699f, 0.611651396802303f, 0.524911319413221f, 0.555472734209632f, -0.723626819813614f, -0.162106613127807f, 0.602405197560299f, 0.903198408993777f, 0.329150411562290f, -0.806468536757339f, -0.671787125844359f, -0.707262852044556f, 0.474934689940169f, -0.379636706541612f, 0.404933387269815f, 0.332303761521238f, 0.394233678536033f, -0.0366067593524413f, 0.904405677123363f, -0.356597686978725f, -0.623034135107067f, 0.572040316921149f, 0.799160684670195f, -0.507817199545094f, -0.533380730448667f, -0.884507921224020f, -0.00424735629746076f, 0.647537115339283f, 0.456309536956504f, -0.766102127867730f, -0.625121831714406f, 0.341487890703535f, -0.360549668352997f, -0.229900108098778f, -0.666760418812903f, 0.813282715359911f, 0.115522674116703f, -0.221360306077384f, 0.0297293679340875f, 0.00682810040637105f, 0.0115235719886584f, 0.887989949086462f, 0.792212187398941f, 0.415172771519484f, -0.600202208047434f, 0.949356119962045f, -0.526700730890731f, 0.946712583567682f, -0.392771116330410f, 0.0144823046999243f, -0.649518061223406f, 0.724776068810104f, 0.00920735790862981f, -0.461670796134611f, 0.217703889787716f, 0.846151165623083f, -0.202702970245097f, 0.314177560430781f, -0.761102867343919f, 0.0528399640076420f, -0.986438508940994f, -0.595548022863232f, -0.430067198426456f, 0.150038004203120f, 0.738795383589380f, -0.605707072657181f, -0.597976219376529f, 0.375792542283657f, -0.321042914446039f, 0.902243988712398f, 0.463286578609220f, -0.739643422607773f, 0.210980536147575f, -0.539210294582617f, 0.405318056313257f, -0.876865698043818f, -0.0883135270940518f, 0.0300580586347285f, -0.657955040210154f, 0.159261648552234f, 0.288659459148804f, 0.274488527537659f, 0.646615145281349f, 0.431532024055095f, -0.982045186676854f, -0.777285361097106f, -0.124875006659614f, 0.503004910525253f, 0.824987340852061f, -0.859357943951028f, -0.894837450578304f, 0.744772864540654f, 0.415263521487854f, 0.337833126081168f, -0.612498979721313f, 0.391475686177086f, 0.573982630935632f, -0.391044576636065f, 0.669493459114130f, -0.763807443372196f, -0.898924075896803f, -0.969897663976237f, -0.266947396046322f, 0.198506503481333f, -0.355803387868922f, 0.787375525807664f, 0.655019979695179f, -0.266247398074148f, -0.665577607941915f, 0.0617617780742654f, -0.303207459096743f, 0.807119242186051f, -0.864431193732911f, 0.711808914065391f, 0.267969697417500f, -0.643939259651104f, -0.723685356192067f, 0.887757759160107f, -0.318420101532538f, -0.984559057628900f, -0.123118506428834f, 0.264872379685241f, 0.258477870902406f, -0.727462993670953f, -0.223845786938221f, 0.683462211502638f, -0.989811504909606f, 0.292644294487220f, -0.926087081411227f, -0.801377664261936f, -0.337757621052903f, 0.356167431525877f, 0.974619379699180f, 0.456124311183874f, 0.664192098344107f, -0.910993234571633f, -0.484097468631090f, -0.128534589958108f, -0.770879324529314f, 0.320053414246682f, 0.249818479771296f, 0.0153345543766990f, 0.696352481669035f, -0.397719804512483f, 0.670333638147646f, -0.678192291329959f, 0.190143924397131f, 0.342035884244954f, -0.350791038317704f, 0.0218450632953668f, 0.437133719806156f, 0.659960895652910f, 0.903378806323159f, 0.855089775229062f, 0.946706092624795f, 0.335540975081955f, 0.838337968455111f, -0.102693592034237f, -0.702102376052106f, 0.409624309223486f, -0.654483499569910f, 0.886576641430416f, -0.200573725141884f, -0.461284656727627f, 0.262661770963709f, 0.867505406245483f, -0.0688648080253220f, -0.707487995489326f, -0.248871627068848f, -0.197869870234198f, -0.243745607075197f, -0.244106806741608f, 0.489848112299788f, -0.0909708869175492f, -0.377678949786167f, 0.0385783576998284f, -0.470361956031595f, 0.802403491439449f, -0.408319987166305f, 0.345170991986463f, -0.433455880962420f, 0.00950587287655291f, -0.441888155900165f, -0.817874450719479f, 0.818308133775667f, 0.931915253798354f, 0.818494801634479f, 0.787941704188320f, 0.882012210451449f, 0.0749985961399193f, 0.259772455233352f, -0.655786948552735f, 0.0824323575519799f, 0.980211564632039f, -0.798619050684746f, 0.496019643929772f, -0.727312997781404f, -0.999839600489443f, 0.625938920414345f, -0.561059012154101f, 0.215650518505246f, 0.121571798563274f, 0.161863493108371f, -0.340322748036792f, 0.521792371708641f, 0.655248389359818f, -0.180967013066484f, 0.936797969156762f, 0.523749660366580f, 0.764744126333943f, 0.384701560810431f, -0.744092118301334f, 0.719721922905938f, 0.365931545158250f, -0.720202871171563f, 0.121662048491076f, -0.355501954289222f, 0.379420491208481f, -0.593818415223405f, -0.433690576121147f, -0.766763563509045f, -0.377445104709670f, -0.955638620720410f, 0.309622585052195f, -0.613767678153186f, 0.0177719922394908f, 0.362917537485277f, -0.297613292472489f, 0.0275561832152067f, -0.962345352767599f, 0.452866577068408f, -0.307485159523065f, 0.931778412136845f, 0.639592220588070f, 0.00782144244951311f, -0.0466407334447796f, -0.134392603781566f, 0.895314655361308f, -0.537785271016286f, 0.663926391064792f, -0.886126633268266f, -0.0975129470189278f, -0.429791706025144f, -0.440337831994928f, -0.00156267573188829f, 0.933113069253665f, -0.560704402651437f, -0.201658150324907f, 0.465819560354530f, 0.0701448781871696f, 0.859597672251104f, -0.525851890358272f, -0.992674038068357f, -0.0846761339576128f, -0.401686794568758f, -0.886069686075370f, -0.480254412625133f, 0.432758053902000f, 0.168651590377605f, -0.453397134906684f, 0.340250287733381f, -0.972972507965963f, 0.0560333167197302f, -0.180812774382952f, -0.689848943619717f, -0.427945332505659f, 0.771841237806370f, 0.329334772795521f, 0.573083591606505f, 0.280711890938316f, -0.265074342340277f, -0.166538165045598f, -0.0612128221482104f, 0.458392746490372f, 0.199475931235870f, 0.681819191997175f, 0.356837960840067f, 0.756968760265553f, 0.763288512531608f, -0.890082643508294f, -0.322752448111365f, 0.799445915816577f, -0.956403501496524f, 0.723055987751969f, 0.943900989848643f, -0.217092255585658f, -0.426893469064855f, 0.834596828462842f, 0.723793256883097f, 0.781491391875921f, 0.928040296363564f, -0.468095417622644f, 0.758584798435784f, 0.589732897992602f, 0.929077658343636f, 0.829643041135239f, 0.0947252609994522f, 0.554884923338572f, -0.513740258764285f, -0.221798194292427f, 0.499855133319165f, -0.0237986912033636f, 0.559618648100625f, -0.509812142428963f, -0.444047241791607f, 0.678274420898738f, -0.983706185790147f, -0.295400077545522f, -0.688769625375228f, 0.729259863393412f, 0.889478872450658f, 0.928277502215167f, -0.429388564745762f, -0.790568684428380f, 0.930220908227667f, -0.796970618648576f, -0.980240003047008f, 0.0372716153521411f, -0.290828043433527f, -0.303854123029680f, 0.160774056645456f, -0.712081432630280f, 0.390787025293754f, 0.981202442873064f, -0.679439021090013f, 0.183053153027806f, 0.665002789261745f, -0.708708782620398f, 0.254574948166343f, 0.0575397183305137f, -0.723713533137924f, -0.732816726186887f, 0.501983534740534f, 0.879998734527489f, 0.825871571001792f, 0.920880943816000f, 0.311565022703289f, -0.788226302840017f, -0.223197800016568f, 0.850662847422425f, -0.365181128095578f, 0.958907951854379f, -0.0421327708909884f, -0.153860389403659f, -0.219620959578892f, -0.469076971423126f, -0.523348925540362f, -0.287762354299832f, -0.913332930679763f, 0.403264134926789f, 0.725849051303960f, 0.743650157693605f, -0.382580349065687f, -0.297138545454038f, -0.480092092629432f, 0.0412697614821378f, -0.396203822475830f, -0.0721078217568973f, 0.979038611510460f, -0.766187876085830f, -0.344262922592081f, 0.943351952071948f, -0.219460259008486f, 0.115393587800227f, -0.342675526066015f, 0.926460460401492f, -0.486133445041596f, 0.0722019534490863f, -0.571069005453629f, -0.0854568609959852f, 0.370182934471805f, -0.554007448618166f, 0.899885956615126f, -0.188476209845590f, -0.548132066932086f, 0.0559544259937872f, -0.161750926638529f, -0.532342080900202f, 0.585205009957713f, -0.374876171959848f, -0.169253952741901f, -0.473665572804341f, 0.942267543457416f, -0.515867520277168f, -0.706362509002908f, -0.320672724679343f, -0.398410016134417f, 0.733774712982205f, 0.449599271169282f, 0.109119420842892f, -0.285090495549516f, 0.0854116107702212f, 0.0603189331827261f, -0.943780826189008f, 0.0679186452322331f, 0.0975973769951632f, -0.870728474197789f, -0.153122881744074f, -0.519939625069588f, -0.633620207951748f, -0.767551214057718f, -0.905802311420298f, -0.841350087901049f, -0.271805404203346f, 0.282221543099561f, -0.0874121080198842f, 0.0634591013505281f, 0.318965595714934f, -0.865047622711268f, -0.401960840475322f, 0.637557181177199f, -0.664578054110050f, -0.871253510227744,
-0.893972634695541f, 0.442396058421524f, -0.427901040556135f, -0.740186385510743f, 0.788155411447006f, -0.541278113339818f, 0.509586521956676f, -0.461159620800394f, 0.664671981848839f, 0.880365181842209f, -0.0831685214800200f, 0.952827020902887f, 0.183226454466898f, -0.176729350626920f, 0.851946105206441f, -0.361976142339276f, 0.357209010683668f, 0.982462882042961f, -0.690757734204635f, 0.178681657923363f, -0.0804395784672956f, 0.971787623805611f, 0.875217157810758f, 0.160844021450331f, -0.359951755747351f, 0.0178495935461525f, 0.0203610854761294f, 0.413933338290502f, -0.676038601090005f, -0.111093077131977f, -0.381792206260952f, -0.459903351782575f, 0.308522841938619f, 0.324961267942541f, 0.365201262605939f, 0.732543185546895f, -0.559558093250200f, 0.848266528378337f, -0.185546299813159f, 0.997052205707190f, -0.932554828383249f, -0.106322273904826f, -0.0690562674587807f, 0.919489002936141f, 0.137210930163322f, -0.664517238270193f, -0.985856844408119f, -0.0719443995256963f, -0.602400574547167f, -0.398979518518077f, -0.581117055144305f, -0.0626081333075188f, -0.0372763806643306f, -0.688808592854889f, 0.703980953746103f, -0.480647539644480f, 0.615510592326288f, -0.940226159289884f, -0.953483236094818f, -0.300312284206625f, -0.819419230573751f, 0.657560634657022f, -0.0500336389233971f, 0.628589817614501f, 0.717012803783103f, -0.0315450822394920f, -0.445526173532186f, 0.521475917548504f, -0.479539088650145f, 0.695075897089419f, -0.0365115706205694f, 0.0256264409967832f, -0.0121306374106025f, -0.817618774100623f, 0.375407640753000f, 0.944299492219378f, -0.717119961760812f, -0.120740746804286f, 0.995225399986245f, -0.460846026818625f, 0.904552069467540f, 0.807270804870602f, -0.842962924665094f, -0.923108139392625f, -0.130295037856512f, 0.760624035683226f, 0.986419847047289f, -0.959218334866074f, -0.203345611185410f, -0.474420035241129f, -0.872329912560413f, 0.485994152094788f, -0.515456811755484f, -0.948541161235413f, 0.509659433909651f, 0.783030335970347f, -4.41004028146619e-05f, -0.664795573083349f, 0.917509788523214f, -0.824045573084530f, -0.461857767121051f, -0.667434409929092f, -0.00822974230444418f, 0.825606347148302f, -0.396378080991589f, 0.0161379983198293f, -0.940751675506308f, -0.520997013834332f, -0.239727035024153f, -0.354546027474561f, 0.430652211989940f, -0.557416557692462f, -0.357117274957257f, -0.891975448321656f, -0.0775302131779423f, 0.716775563686830f, -0.903453980341467f, 0.946455001410598f, -0.615060907661003f, 0.964288374469340f, 0.0506144897273089f, 0.720601612869967f, -0.991323837622476f, 0.647403093538608f, -0.400304988135589f, -0.883732066109751f, -0.792060477777513f, 0.710867542231890f, -0.840766000234525f, 0.460362174479788f, -0.834771343071341f, -0.329399142231491f, -0.139853203297018f, -0.760035442359396f, -0.546795911275364f, -0.598172518777125f, 0.244198671304740f, 0.0816980976432087f, -0.978470883754859f, -0.425173722072458f, -0.469868865988971f, 0.847396146045236f, 0.0513388454446360f, -0.545662072513986f, -0.130534232821355f, -0.654100097045099f, 0.0409163969999120f, 0.573001152600502f, 0.706046270983569f, 0.587208280138624f, 0.237670099964068f, 0.848355476872244f, -0.318971649676775f, -0.659343733364940f, 0.321817022392701f, -0.595779268050966f, -0.114109784140171f, 0.998897482902424f, -0.615792624357560f, -0.384232465470235f, 0.156963634764123f, 0.499645454164798f, -0.627603624482829f, 0.169440948996654f, 0.109888994819522f, -0.492231461622548f, -0.463014567947703f, 0.825436145613203f, -0.0271223123229367f, 0.497887971992266f, 0.811868354230459f, -0.192668816770168f, 0.287930938097264f, 0.0283112173817568f, 0.791359470942568f, 0.365100854153897f, -0.566922537281877f, 0.915510517906894f, 0.674211624006981f, 0.505848146007678f, 0.509348889158374f, -0.0477364348461706f, 0.409703628204478f, -0.820970358007873f, -0.565377675052345f, 0.810052924776160f, -0.448904038826591f, -0.830251135876445f, -0.660589978662428f, -0.890196028167542f, 0.130526506200048f, 0.924600157422957f, 0.587215078998604f, 0.727552064386916f, -0.224172021948978f, -0.182984019951690f, 0.308546229024235f, 0.971188035736775f, 0.0229902398155457f, 0.0608728749867729f, -0.0712317776940203f, 0.549832674352445f, -0.600015690750697f, -0.0495103483291919f, -0.564669458296125f, 0.726873201108802f, -0.197851942682556f, -0.983422510445155f, -0.905314463127421f, 0.453289030588920f, 0.792504915504518f, -0.840826310621539f, 0.0979339624518987f, -0.506416975007688f, -0.143310751135128f, -0.451251909709310f, -0.356156486602212f, -0.430777119656356f, -0.593002001098269f, -0.212505135257792f, -0.378005313269430f, 0.516460778234704f, -0.574171750919822f, -0.702870049350445f, 0.190454765104412f, 0.694962035659523f, 0.177498499962424f, -0.00126954773922439f, -0.766110586126502f, -0.769862303237397f, -0.208905136673906f, 0.0728026097773338f, -0.467480087700933f, -0.368839893652514f, -0.608806955889496f, -0.531329879815774f, 0.411920547737697f, -0.407318902586407f, 0.922406353838750f, -0.0272310683929855f, 0.781051179942937f, 0.860271807949640f, -0.703736733439623f, -0.285650334863399f, -0.466904334435873f, -0.716816768536707f, 0.0869377378786880f, -0.280331892461309f, 0.773946156883160f, -0.139856444064730f, 0.575680110908147f, -0.887887626173303f, 0.314286545048942f, 0.673119170729964f, 0.520399233930039f, 0.581347801663144f, 0.731708017815653f, 0.672583525027818f, -0.0534590776637494f, -0.880572908687369f, 0.171150522778545f, -0.377041265530122f, -0.478003213002057f, 0.458602883802583f, 0.836824527658741f, -0.0686622680764437f, -0.301000630566919f, -0.652562984155554f, 0.604631263268903f, 0.791770979838877f, 0.0790491584346489f, 0.812646960034949f, 0.138794042671596f, 0.709411730079774f, 0.226484869016811f, 0.797388098554019f, -0.162225991160828f, -0.0295749256270541f, 0.218242165083417f, 0.442845427695148f, -0.480622209857766f, 0.873464432574125f, -0.868017543466245f, -0.435489784247438f, 0.0589001507244313f, 0.829134536020168f, 0.614063504046069f, -0.0498036542372153f, -0.803122689381969f, -0.495207870035615f, -0.126836582496751f, -0.0715271574335641f, -0.600815700055194f, 0.434993547671690f, -0.891665893518364f, 0.515259516482513f, 0.475325173737397f, -0.716548558025405f, -0.881097306400870f, 0.738462585443836f, -0.244486212870867f, -0.750368936394211f, 0.303496411011494f, -0.602701428305057f, -0.400346153635480f, -0.300002744969481f, -0.518552440201900f, 0.437964598712580f, -0.816689813412280f, -0.814392666138757f, -0.888568091915377f, 0.449416911306476f, -0.231889259488176f, 0.589775175288682f, 0.817224890217553f, 0.518646001325967f, -0.406046689874425f, -0.822100925750380f, 0.0528571826460145f, 0.502410576690672f, -0.795964394123106f, 0.0587614583641718f, -0.960750994569408f, 0.0366871534513058f, 0.723018804498087f, 0.0607565140068052f, 0.337380735516841f, 0.810682513202583f, -0.636743814403438f, 0.287171363373943f, -0.651998050401509f, -0.913606366413836f, 0.642186273694795f, -0.197674788034638f, -0.261253290776174f, 0.696450222503413f, -0.178859131737947f, -0.388167582041093f, -0.0593965887764258f, -0.638517356081890f, 0.804955770174156f, 0.220726627737384f, 0.263712659676167f, -0.214285245576410f, -0.267640297291737f, -0.268009369634837f, -0.957726158424482f, 0.708674977585603f, 0.336764494287156f, -0.985742981232916f, -0.883053422617300f, 0.560301189759340f, -0.692967747323003f, 0.977419052658484f, 0.0749830817523358f, 0.916618822945019f, 0.941660769630849f, 0.454145712080114f, 0.176036352526593f, 0.103229925297037f, 0.936507745325933f, -0.870159095287666f, -0.106465234217744f, 0.684178938709319f, 0.669775326656340f, -0.620857222834950f, 0.939074959093680f, -0.592224920792423f, 0.620706594809134f, 0.0456831422421473f, 0.738727999152789f, -0.751090911501446f, 0.683669216540363f, 0.153825621938168f, -0.255671723273688f, -0.773772764499189f, -0.667753952059522f, 0.887641972124558f, -0.664358118222428f, 0.512196622998674f, -0.0234362604874272f, 0.942878420215240f, -0.406617487191566f, -0.140379594627198f, -0.0587253931185765f, 0.419570878799757f, 0.533674656399007f, 0.108777047479414f, -0.695880604462579f, 0.481525582104998f, 0.511165135231064f, 0.136105196996658f, -0.481918536916982f, 0.757546893769363f, 0.957648176032083f, -0.908743619686586f, -0.395640537583668f, 0.0493439519763970f, 0.293569612893396f, 0.387420368421925f, 0.0928482742403196f, 0.407302666835821f, -0.787979245337637f, -0.968269218296593f, -0.409517247978962f, 0.775076200793689f, -0.217738166217447f, -0.370002483875998f, -0.570975789421316f, 0.844070553036478f, 0.668620483679341f, 0.00139813137293987f, -0.0912495442122028f, -0.0375370940595317f, 0.723007849224616f, 0.369999774115317f, 0.862240371150479f, 0.749525689790910f, 0.742992309993137f, -0.495813719545874f, -0.101947508108870f, -0.152536889610560f, 0.0598123624723883f, -0.436496899502871f, 0.520026918467263f, 0.241005798945400f, 0.970456690492966f, -0.376417224463442f, 0.614223236672359f, 0.336733945081746f, 0.376602027190701f, 0.00373987228923456f, -0.415425448787442f, 0.330560415319813f, -0.277250467297048f, 0.861008806111330f, -0.00655914035278493f, 0.810375656135324f, -0.0113631690466840f, -0.191699616402287f, -0.808952204107388f, 0.813180054552450f, 0.472985418265257f, 0.180147510998781f, -0.262580568975063f, 0.211152909221457f, -0.882514639604489f, -0.575589191561861f, 0.106927561961233f, 0.964591320892138f, 0.738192954342001f, 0.687649298588472f, -0.229142519883570f, -0.354434619656716f, -0.420522788056562f, 0.684638470896597f, -0.608080686160634f, 0.172668231197353f, 0.571295073068563f, -0.202258974457565f, 0.183035733721930f, -0.425589835248751f, -0.181955831301366f, 0.798193178080558f, -0.719799491928433f, -0.376418218727565f, 0.100370714244854f, -0.674685331738723f, -0.528950922374114f, 0.480443520097694f, 0.432497368954013f, 0.887439714903326f, 0.598241701759478f, -0.250064970303242f, -0.743111010477448f, 0.936189907099845f, -0.867383557331633f, 0.852536175309851f, -0.426378707286007f, 0.793838638663137f, 0.856262917294594f, 0.734157059815547f, 0.00452009494051664f, -0.884258713402709f, -0.0835595438259760f, -0.735457210599502f, -0.710727075357488f, 0.858050351034768f, -0.626070522205317f, -0.848201957131499f, 0.0180933910837406f, -0.0350884878366737f, -0.893836321618480f, -0.0682788306189803f, -0.539993219329871f, -0.557660404374917f, 0.268969847256868f, 0.505363999910409f, -0.0464757944714727f, -0.529689906951922,
-0.138445378586710f, 0.992531054118938f, 0.974585450054910f, 0.940349645687053f, 0.648085319100986f, -0.410736404028701f, 0.804131759246012f, -0.774897101314247f, 0.178246382655493f, -0.361699623232501f, -0.836093509684016f, 0.806309487627613f, -0.758182371322663f, 0.718410035716663f, -0.213136487421868f, -0.0563465521625497f, 0.0411192849612654f, -0.532497330327019f, -0.0419839515250475f, 0.769432068229678f, 0.253556234192255f, -0.745131216530268f, -0.890639235422577f, -0.140643637034330f, 0.318127074868768f, -0.497415632768561f, -0.383508820416842f, -0.468783454456628f, -0.289531078129000f, -0.0831555730758713f, 0.0107128404847427f, -0.567754537918270f, 0.926366772604370f, -0.600154724486768f, -0.0920759547805206f, 0.889582307602381f, -0.0710437157605615f, -0.182724716112986f, 0.228135065644420f, 0.851015495602628f, 0.653035806598961f, -0.986676404958677f, -0.871714951288816f, -0.824734086356281f, -0.490239304888267f, 0.244318295619814f, -0.923794688606381f, 0.670566388343457f, 0.849438492633058f, -0.225318912425116f, 0.461075616917687f, 0.656436404012820f, -0.416403369651597f, 0.205630417444150f, -0.163509095777762f, -0.0670299490212758f, -0.315561491397908f, -0.0952855008191476f, -0.377993693497066f, 0.860172853824826f, -0.669622978211317f, 0.595058880455053f, -0.425661849490015f, -0.0405359106780283f, 0.129968697438974f, -0.156244199842099f, 0.996996665434629f, -0.888570357356090f, -0.925646614993414f, -0.753998082238076f, 0.714491335460749f, -0.307849905639463f, 0.536274323586448f, -0.462944722411129f, 0.622202376598447f, -0.215582012734053f, -0.115115003363232f, 0.128168110175570f, -0.556263623663708f, 0.921813264386344f, -0.288173574121268f, -0.175054002159610f, 0.0621862747516269f, -0.468862899314091f, 0.976184545317535f, 0.468469061953779f, 0.679394669665911f, -0.0651943232114096f, 0.872740953203360f, -0.917720162541254f, 0.271535917769933f, 0.265441861283112f, 0.542190484993772f, -0.0208550501604048f, 0.983272473294640f, -0.522164666401537f, 0.833823680455458f, 0.414337644113416f, 0.588576354535126f, 0.318369292694380f, 0.870442561030567f, -0.422722224743553f, -0.200185003922166f, -0.770185495487048f, -0.878134057034045f, -0.712873198675798f, 0.647706512601268f, 0.593648188899773f, 0.126171748161942f, -0.189622212946038f, 0.707877641788638f, 0.790070498218410f, 0.698576567863428f, 0.594748885238005f, 0.567439045931572f, -0.591839707769224f, -0.632709967090349f, 0.415471238430617f, 0.115403276784208f, -0.375797954748234f, 0.123611001678020f, -0.864109581464288f, 0.115346512920739f, -0.515581940111704f, 0.880606114362175f, 0.356011740142007f, -0.318112820131587f, 0.765766689783476f, -0.226772670084743f, 0.442067390135885f, 0.348547568069751f, 0.862154389627291f, -0.894863284060244f, 0.475714942110286f, 0.552377629980789f, -0.0838875341374268f, -0.227654706745770f, 0.0998522598030438f, 0.870812229993830f, -0.518250234958224f, -0.0635791579471283f, -0.284101882205902f, -0.454751668241269f, 0.720773434493943f, 0.0756117818245317f, -0.0572317848090118f, -0.692584830354208f, 0.776250173796276f, 0.514052484701885f, 0.00770839936587864f, 0.775668871262837f, 0.933055956393907f, 0.0501713700022097f, -0.922194089981246f, 0.266653852930886f, -0.408584553416038f, 0.797066793752635f, -0.785570848747099f, 0.931403610887599f, 0.660859952465710f, -0.630963871875185f, -0.673000673345695f, 0.518897255252506f, -0.342041914345720f, 0.405613809903414f, -0.373516504843492f, -0.208292396009356f, 0.0510871025610438f, 0.396765368381847f, 0.00537609874241829f, 0.935717099427788f, -0.564801066383885f, -0.907523685862547f, 0.670551481631625f, -0.457309616171932f, 0.364001526470449f, 0.140805524345232f, -0.349945327329409f, -0.0361532758624807f, -0.304268551311720f, 0.618482952755668f, -0.0120110524971313f, 0.106364353621731f, -0.427587198043230f, 0.464249033810121f, -0.808297048471569f, 0.675277128303038f, -0.0663762607268352f, -0.431951364170808f, 0.953951718476660f, -0.725934553905574f, -0.685163723789561f, 0.164132617720945f, 0.934798872032034f, -0.695343627424553f, -0.420317401094920f, -0.689247558220342f, -0.605894279765940f, -0.693832779320227f, 0.455037128281788f, 0.968645000038447f, -0.0839147410947130f, 0.603463489419899f, 0.776913738299999f, -0.491560292499776f, 0.692235227850848f, 0.0824017593921889f, 0.459024952691847f, -0.918050509352710f, -0.777463066447746f, -0.161045596440278f, 0.982603547894360f, 0.700884888820475f, 0.998304481713913f, -0.362488733430088f, 0.171493948866881f, 0.565871153533442f, -0.965620428705067f, -0.835532968802398f, 0.885598629033760f, 0.609604257914327f, 0.725300244775050f, 0.153524048564152f, -0.662541112390878f, 0.912145212201290f, 0.135610445338421f, -0.0813934125800109f, 0.242209063597546f, -0.264886126609115f, -0.335070345839122f, 0.823958964903978f, -0.313110855907701f, -0.354068037633970f, -0.0381190024996405f, 0.117794735211134f, -0.604442743379238f, 0.524930955656444f, -0.754959642694882f, -0.359151666678207f, -0.247910739722172f, 0.573570999369016f, 0.543167570010806f, -0.718553346110069f, 0.202415372555816f, -0.860091438569300f, -0.0125446132328610f, 0.509348782140749f, 0.349261188228469f, 0.424395913611831f, 0.0557092265870811f, 0.740276822496471f, 0.479158001215769f, -0.221873518706244f, -0.744883456979009f, 0.393114117430743f, -0.733203119089531f, -0.506531269498885f, -0.505532097672033f, -0.509440981371663f, 0.666118722468113f, 0.0164067375520756f, -0.530276655546078f, 0.786338654343788f, -0.985008085364936f, 0.479988836226036f, -0.233652481382475f, 0.838641098910395f, -0.407379719374768f, -0.314266358910263f, -0.938033692224531f, -0.627320971378707f, -0.229174127295511f, 0.642505983671691f, -0.387855473250297f, 0.360324209821339f, -0.900766206699468f, 0.176676285751262f, 0.833894117554548f, -0.0207873177403817f, -0.202625183820044f, 0.706644325019314f, -0.817922707040537f, -0.242742059004419f, 0.282109349674866f, 0.0164603911954744f, -0.504625902855950f, 0.0415496120997125f, -0.787777778295785f, 0.362588721999523f, -0.371357162843751f, -0.818375262182416f, 0.727779997467707f, -0.836502839702384f, 0.0423869176265037f, -0.283934686546853f, 0.665864224978728f, -0.0428162304637920f, 0.243534621880753f, -0.803789304599586f, 0.570866852088607f, 0.340615579467880f, -0.323456502239327f, 0.403242371952148f, -0.0679158901587793f, -0.866985651416456f, -0.439873628406335f, -0.246357367033863f, 0.436234859832243f, 0.560714706225535f, -0.632564381913014f, -0.316451076258298f, -0.977122780282003f, 0.0741405862954117f, -0.217862250253606f, 0.887093089232476f, -0.418281865182365f, -0.638553415535034f, -0.262631979211197f, -0.567499176465252f, 0.676178859605923f, 0.933551699581608f, -0.0139735129263516f, -0.610719575803582f, 0.565123751720690f, 0.230672823422021f, 0.323935439339366f, 0.635142215896104f, 0.981184609133698f, 0.883668802319366f, -0.281281673616891f, 0.583204242495555f, 0.150854689098149f, -0.775890223139644f, 0.419951701513177f, -0.565767744791652f, -0.855232478054420f, 0.472188579901153f, -0.501463211798228f, 0.727960518524943f, 0.977187851385321f, 0.908113737694915f, -0.570200931535418f, 0.716036980035073f, 0.147838037485588f, 0.218820342222622f, -0.0673193461152677f, 0.433612519652386f, 0.449601736390411f, 0.556458722303960f, 0.417345590820787f, -0.783345413347895f, 0.858903187230710f, 0.178354025272247f, -0.130619018471658f, 0.858282827806003f, 0.508916167873459f, 0.139535936201634f, 0.240400109521332f, -0.102942705407161f, 0.841682417072375f, -0.696350979494975f, -0.793644449061670f, -0.698273636720141f, -0.228676865074326f, -0.195917865828574f, -0.306483109792438f, -0.865320326812636f, 0.659185969805107f, -0.368847387975239f, 0.337343722359231f, 0.0723822170210744f, 0.907475280998826f, 0.515168301614856f, 0.0790167120323961f, -0.756697420780699f, 0.966477562469936f, -0.663190129982788f, 0.145761851826854f, 0.376079225193173f, 0.631883071958707f, -0.956568110802436f, -0.735990864315730f, -0.795999578321461f, 0.958459465243432f, 0.319180429028702f, -0.907664654881857f, 0.992381284978014f, -0.511208110440365f, -0.714797966909523f, -0.717021870210999f, 0.545775837604423f, -0.0443828768329362f, 0.333311879948434f, 0.617237628406207f, -0.0895192882305207f, 0.506491005527430f, -0.354205929841282f, 0.777993157224477f, -0.667532693120319f, -0.105006112097613f, -0.337191911902220f, -0.337964429160738f, 0.609014812897482f, -0.368922911475613f, 0.889184378947484f, -0.676392242654630f, 0.429716870038086f, 0.916751115281822f, -0.655611878274175f, 0.538928395264007f, 0.382674384886170f, 0.0580742902089004f, -0.0124611362991478f, -0.0240388340005702f, -0.726296501832402f, -0.805701334732693f, 0.945344279474230f, -0.668066000378724f, 0.761436128738929f, -0.314275650172792f, -0.394331510439346f, 0.262887592668013f, 0.155064800148016f, -0.561829218656134f, -0.491542446753775f, 0.922248338472926f, 0.574575887413700f, 0.631722295929094f, -0.368854197209698f, 0.984780657580794f, 0.845286034922662f, -0.965631634115590f, -0.435710392440405f, -0.616488688868478f, 0.885865616625930f, 0.425733070487506f, 0.776721663555227f, -0.0652930284860209f, -0.734431875923792f, 0.725517937762654f, -0.474146253075108f, 0.895357779508529f, -0.0725048758018345f, -0.360185856190223f, 0.559350280666427f, 0.363695103660096f, 0.152231254765544f, 0.698196273442671f, 0.0518001104801953f, -0.139037096279713f, 0.340637636595997f, 0.584243998596814f, -0.442304329829130f, -0.501574294329747f, 0.250155103662225f, 0.320493999001502f, -0.150217982700108f, -0.0381390799255577f, 0.734760815545772f, -0.574574233376749f, 0.593440338163725f, 0.408049858247104f, -0.0845023181203484f, -0.855507806920297f, -0.473198309372409f, 0.331033392104072f, 0.196445364460658f, -0.799745050834061f, -0.973517526224363f, 0.333748727500822f, -0.772356831553232f, -0.430793038424357f, 0.649852557262489f, 0.504357958431509f, 0.779588082810134f, 0.0111847677569461f, -0.995526851285634f, -0.676007517368195f, 0.216774012875664f, -0.618928775636485f, -0.418043155155598f, -0.532063904545563f, -0.566979013994587f, 0.246319907266774f, 0.868651379198082f, -0.0433430896891542f, 0.463004686009427f, -0.162112430964754f, 0.285379745117090f, 0.901512987149549f, -0.706916206313139f, 0.685678130935725f, -0.673017501666538f, 0.0616272859909088f, 0.147532779463338f, -0.0108539826652629f, 0.960841184863269f, -0.950190006701182f, 0.992171414792924f, 0.715577145884581,
0.975908103138584f, -0.769014520827696f, -0.463212420186382f, -0.0761813427220397f, -0.704830850508594f, -0.220579724380686f, 0.840893269946637f, -0.432181989863148f, -0.956790418498701f, 0.122344784859397f, -0.242133592220528f, 0.908514497715246f, 0.303653521236872f, 0.756500828196849f, -0.752207807361831f, 0.367894642791072f, -0.702474131286247f, 0.189226989057138f, 0.401804209353236f, 0.608493473010907f, -0.437378101171900f, -0.158801297891213f, -0.381027984311046f, -0.949403985394057f, 0.370189685252539f, -0.872655295458655f, -0.337934909993878f, -0.0619622888328213f, 0.352094440420005f, 0.128759637109350f, 0.432413186229881f, -0.497474226759161f, 0.552933107875735f, 0.332665936587804f, -0.559261497212156f, -0.886188834336549f, 0.0170548801295034f, 0.192729852728271f, -0.674432365770129f, -0.526014722983374f, 0.425009223123802f, -0.186164676538888f, 0.190362042383007f, -0.0930204201587825f, 0.794188212052413f, -0.243549629178106f, 0.118970185744958f, -0.216230226310237f, 0.412570247218594f, 0.659556685538155f, -0.150540425515543f, -0.850858266540316f, -0.843827815842486f, 0.629298164439457f, 0.944304062363374f, -0.117764731240517f, 0.558568737697335f, 0.731745392387362f, -0.00413812760139165f, -0.251933493011685f, -0.473346352965658f, 0.178783613032362f, 0.547769344759580f, -0.414330113592064f, -0.550251453379012f, -0.925253680779905f, 0.623832825809309f, -0.494251081521428f, 0.0643361026845244f, 0.727107898350051f, 0.814864886916156f, 0.0177325632172460f, 0.749324691554934f, -0.266301024849295f, 0.675202550635588f, -0.0748462128620644f, -0.747853513216831f, -0.222563643557406f, -0.608884446788701f, -0.0374135649675464f, 0.852579123003940f, -0.585927920129879f, 0.604065857569210f, 0.573072924781108f, 0.816831955879520f, 0.723975232584095f, 0.367887024581694f, 0.765292601085641f, 0.836490699448589f, 0.623434131440044f, 0.743568762340577f, 0.140474444458222f, -0.746327891490507f, 0.700496422194197f, 0.549693846244016f, 0.729372970291116f, 0.728185563682229f, -0.614909046853182f, -0.756209631211223f, -0.530222413502955f, -0.312453162783936f, -0.752364704008701f, -0.634475515424180f, -0.133239439768175f, 0.252790153178337f, 0.760626105409900f, -0.838262213452153f, -0.266093046689486f, 0.549339088324875f, -0.278178592347115f, 0.190458706141960f, 0.906814275056971f, -0.579827980376046f, -0.134191470195968f, 0.244720998349483f, 0.795502128014338f, 0.287019836683889f, -0.906277889518234f, -0.817071933038363f, 0.613378274793081f, 0.518208081766432f, -0.388902790616382f, -0.785778461147273f, 0.574976429920521f, -0.283168065839246f, -0.857322381041868f, 0.424932015236353f, 0.919756642423073f, 0.412896759578072f, -0.976511020897041f, 0.157825653359643f, -0.0606591903280758f, 0.508438714729350f, -0.513115001652116f, 0.881391940997543f, -0.129708782033534f, 0.382462819411800f, -0.538751535594113f, 0.816770663497783f, 0.869013288394013f, -0.728381721932439f, -0.956736333819522f, -0.839107107637575f, 0.394821058517234f, 0.721983518815999f, -0.0847231453556103f, 0.0206545030491683f, 0.414707730497861f, 0.246591855656934f, -0.546187573590839f, -0.578957978692654f, 0.162844799084821f, 0.493731081270802f, -0.765815587549615f, 0.151613093585910f, -0.112883397239635f, 0.879319928900002f, 0.295375250614654f, -0.505370201033860f, -0.635319167339584f, -0.309818465920078f, 0.768627024018538f, -0.544374452091825f, 0.758974060573473f, -0.106050973670013f, 0.508616501970226f, -0.207224226211215f, 0.616842248601645f, 0.688381226662374f, 0.643728558619948f, -0.906982649598668f, 0.526262112978799f, -0.666644270400075f, 0.314806313630502f, -0.292000096972562f, -0.358353880616007f, 0.156344541906829f, 0.637606941586786f, -0.199572501073669f, -0.669369278061572f, 0.237513395315133f, -0.576741807179552f, 0.0750117203638310f, -0.633877533594996f, 0.829285089669934f, 0.622345234313277f, -0.892617583855908f, -0.280449892200797f, 0.241147361581176f, -0.0784016295955696f, 0.414945819313502f, 0.287238318044040f, -0.691458270387106f, 0.597656137422422f, 0.549022082569726f, -0.590776624040652f, 0.666740423918019f, -0.743115212424850f, 0.164036350785269f, -0.229427480781113f, 0.283602991107853f, -0.533993445778340f, 0.185806116700093f, -0.317953364055307f, 0.140412503708198f, 0.280706883979940f, 0.0439806827213221f, 0.176471515460512f, -0.614144204292693f, 0.314194083857125f, 0.519572839644130f, -0.850547081260782f, -0.515460990713008f, 0.353087995032390f, -0.0241014119925820f, 0.269453276643829f, -0.608515317887958f, -0.777818225534647f, -0.834277444316067f, -0.842707175235771f, -0.929547602540323f, -0.884691870945475f, 0.710591809809692f, 0.143423776629673f, 0.797136471728128f, 0.233311155245426f, -0.923169961754164f, 0.627911916101674f, -0.338187201367212f, 0.211044396110784f, -0.443699655795038f, 0.256593551969761f, -0.406688684034041f, 0.364900889856600f, 0.900530571350288f, -0.160476177153537f, 0.0634217008071056f, 0.709241599309354f, -0.789562037599596f, 0.00891621061029158f, 0.801674768895422f, -0.704378031949125f, 0.430576706378041f, 0.796937507044124f, -0.193348850174576f, -0.493924902919358f, -0.935781577118986f, 0.468142331108629f, 0.00965840085728753f, 0.0834398764999438f, 0.599712941235232f, -0.735675950275295f, 0.200152501800787f, -0.751603779675650f, 0.0697488403240092f, 0.300634243862625f, -0.901969784333300f, -0.958816237033024f, -0.754976119377363f, 0.719702182489622f, -0.338038642556184f, -0.703280944186943f, -0.579148694005994f, 0.556115731092296f, -0.920710928208685f, -0.278178108839470f, -0.793795308512285f, 0.916547680808212f, 0.419467216101691f, 0.177932177026735f, 0.682833725334600f, -0.926849803428705f, 0.179045225389745f, -0.209414969718359f, -0.889551871881532f, 0.961659420127890f, -0.250341627298645f, 0.105606170554974f, -0.547860346689080f, 0.845704098204057f, 0.886892635683680f, 0.768134466622042f, -0.954777823503721f, -0.718106389777233f, -0.580779231998609f, -0.0241800476518665f, 0.815063484178525f, -0.351971452344303f, 0.770369263680192f, 0.520886146470712f, -0.236456125482696f, 0.0900173391919312f, -0.00610611501589697f, 0.0986788038317752f, 0.277083194173223f, 0.0877085076786761f, 0.695814138412262f, 0.281021332783082f, -0.701468161850407f, -0.785496560046616f, -0.805623403379156f, -0.0524204125046179f, 0.0836418099696601f, 0.467252832788807f, 0.148967572323544f, 0.314141193557124f, -0.722297309069329f, 0.147068590429361f, -0.868307069306109f, 0.118712645744921f, 0.737896544941878f, 0.897526485681248f, 0.842207508585120f, 0.817408479766998f, 0.522315328909182f, -0.409136979179218f, 0.580654760034574f, -0.384701243761730f, -0.769398544059918f, -0.791317178699730f, 0.357020281620118f, -0.235410423267782f, -0.326332500533018f, -0.416891876268284f, -0.863029987000052f, 0.505171215727166f, -0.728709553380428f, 0.554546891580919f, 0.737429989077498f, -0.355088598334119f, 0.911987317939763f, 0.525846127625130f, 0.851549830104189f, -0.772303673276796f, 0.0421942169353806f, -0.521836640530782f, 0.995279650924240f, -0.186831960875832f, 0.421233670121556f, -0.0891583750230474f, 0.661100169663965f, 0.393809652414978f, 0.346165179707090f, 0.384203760628548f, -0.329281932973211f, 0.446133401546675f, -0.748200766224366f, -0.0275154142375615f, 0.771701580845288f, -0.0177829993094090f, 0.406813206251131f, 0.606021648140155f, 0.218435152341115f, 0.236571855064013f, -0.513495776515847f, 0.729086381137554f, -0.137775825035815f, 0.0320966747364262f, -0.313487802206023f, 0.105472520924239f, 0.423606700821375f, -0.231301628369264f, 0.465218832919270f, 0.379671652150568f, -0.00497780485272159f, 0.509290230688327f, 0.467240127182068f, 0.353587964503845f, 0.390455232684039f, 0.721536288927627f, -0.838922323815237f, 0.827628029266859f, 0.768844149796201f, -0.813963144642386f, -0.797054297232628f, -0.933039367361175f, -0.0723957249866136f, -0.664824147893300f, 0.695914840901794f, -0.206071660300270f, 0.879389414398409f, 0.181872681691416f, -0.582831210733033f, 0.624249199449935f, 0.204959730900228f, 0.354831594370532f, 0.337152636438178f, 0.596132114241829f, -0.295619496794481f, -0.443402055665686f, 0.743995051028396f, 0.543706744165365f, 0.825846155044062f, -0.764982315603181f, -0.0355223730700034f, -0.682467026736627f, -0.914037445162109f, -0.222823484413727f, 0.825323277024566f, 0.0769459194171547f, 0.696453968928934f, 0.760786120466962f, -0.525470048583831f, 0.764981036001869f, 0.458525204937000f, -0.612703584870878f, 0.626016142683351f, 0.284799326870320f, -0.130410894642153f, -0.730659587111424f, 0.0251896513929686f, 0.744421417725379f, 0.481278905427271f, -0.718686189713675f, -0.972110566787501f, -0.178005803066219f, -0.761536801353512f, 0.675177569459847f, -0.613068600254845f, -0.854757540148688f, 0.641823580903407f, 0.112536000301536f, 0.201235170163357f, -0.332623522893231f, 0.602028236317460f, 0.487529253813741f, -0.936537443253385f, 0.932862477850079f, -0.0977461167435834f, -0.485449569929182f, -0.575807340541437f, -0.920527242558033f, -0.938208754460503f, 0.890054000488493f, -0.154888511872567f, -0.106629818916523f, 0.323343252623500f, 0.105328135407289f, -0.837197492121459f, 0.497769113944639f, -0.234127101891878f, 0.840922493788059f, -0.994297350473539f, 0.241966031396186f, -0.241143860453769f, -0.598953146106117f, 0.839112451637864f, -0.639567866338402f, -0.219908091959649f, -0.778137266578287f, -0.201424793310289f, -0.486105622640452f, 0.874947034932591f, -0.131437343585340f, -0.674427373037920f, -0.161007203320351f, 0.215285933912207f, -0.963047650748652f, -0.841020847986178f, 0.259702280444602f, -0.165325097679823f, 0.572379756389254f, -0.435802768396928f, -0.0776125194906274f, -0.0293182206559168f, -0.847945015803839f, -0.576891917046364f, 0.728544652294888f, 0.110676857648527f, 0.760459056611184f, 0.486936926897001f, 0.680603035572503f, 0.330358411271561f, 0.901153157113818f, -0.893323547516767f, 0.268679990552354f, 0.794615743189695f, 0.221637368947158f, -0.0207579360252996f, -0.585634995914835f, 0.587646126395593f, -0.317780705107399f, 0.790321547328449f, 0.251610679655279f, -0.0386445267248654f, 0.881542790650722f, -0.469258891944944f, -0.900544881246558f, -0.344978220866601f, -0.271404539202745f, 0.863631450621357f, 0.805892242474368f, -0.325004362330199f, -0.649692260224921f, 0.535815472185538f, 0.427767946389023f, 0.924517987543855f, 0.571059970962007f, 0.549923246060706f, -0.639468249016352,
0.307213071097954f, -0.885892976847170f, -0.526002656640427f, 0.733743042788359f, 0.186919211020217f, 0.322167483598106f, -0.933484010727969f, 0.307181642341518f, -0.391959805653480f, -0.892298105797306f, 0.100065710151584f, -0.932962740784651f, -0.643536993204857f, 0.200747180046148f, 0.310831344540979f, -0.923416823619512f, 0.440768799148345f, -0.666930667413366f, -0.485487251971431f, -0.0627811951952384f, -0.331082293469460f, 0.0335811939608148f, -0.653610782697787f, -0.320586426505716f, 0.559163070852115f, -0.497363452770543f, -0.329886484503569f, -0.146612217140156f, -0.0265272745798242f, -0.288663397675155f, -0.996138396801714f, 0.705746028666908f, 0.634215549629091f, 0.165248482682243f, -0.110791752682943f, -0.0583711657160508f, 0.704663932851230f, 0.105987046073574f, -0.674234600022039f, -0.852792911043127f, 0.779458558047699f, -0.506163961277651f, 0.661431789813829f, 0.362986600662932f, 0.677673397902417f, 0.909704544299484f, -0.678129611146149f, -0.700854916363125f, -0.954905799366644f, 0.819329178422143f, -0.278866438326573f, 0.240572863896085f, -0.597973444252616f, 0.520707363092687f, -0.891796539359942f, -0.0707113684027092f, 0.730270237241197f, -0.202809887987925f, 0.712903235793333f, 0.815918058519912f, -0.619284883130692f, 0.620432327799984f, 0.215462902206797f, 0.913706499476201f, -0.284266999538807f, 0.137669223817851f, -0.320599930994154f, -0.279885143029947f, 0.0759863610502050f, 0.362519848337183f, 0.0897184432777523f, 0.730407126330006f, -0.715664883515070f, -0.964294244830797f, 0.337668374417089f, 0.563780948124681f, 0.534272089774928f, 0.670003495251274f, 0.976582736706313f, -0.576021162432801f, 0.318863740329612f, 0.374838616807691f, 0.437628782275460f, 0.629331465907672f, 0.800673318445353f, -0.964950925853698f, -0.115288102568929f, 0.581179798077059f, 0.892103220665649f, -0.224009831257430f, -0.486848659265476f, 0.768601825625188f, -0.478996958061453f, 0.987216084861456f, -0.00828256241998737f, 0.443388113322642f, -0.209225960405120f, 0.784392408672073f, -0.821157008960409f, 0.169088259578466f, 0.188648958653604f, 0.796321723736402f, 0.804915614204973f, -0.947435972579018f, -0.320368366702004f, -0.0857043727442930f, -0.229914128505395f, -0.802013870592427f, 0.497444368231634f, 0.791040716463223f, 0.586369970276563f, 0.871236424247704f, 0.770091868124107f, -0.458396647683594f, 0.871149873224889f, 0.753895449519495f, 0.295832468734546f, 0.574616471536691f, 0.384408809311353f, -0.978021020306570f, 0.0397482936794495f, 0.628095200786834f, -0.968059492217325f, -0.404306711220928f, 0.659301030460980f, -0.345766174675525f, -0.0517956907600681f, -0.640289082986305f, 0.965202733073502f, 0.909703156044274f, -0.744545066259015f, -0.676836498528477f, 0.0507393165493961f, 0.394673166210436f, 0.250366706754377f, -0.287411651947684f, -0.521760552601739f, 0.214487178617345f, -0.922260536787078f, -0.970217444063294f, -0.632705652784150f, -0.720016326822300f, -0.506393579710801f, 0.774172771450182f, 0.891546338793249f, 0.559706491124446f, -0.513481979527671f, 0.735727350850420f, -0.207760672132971f, 0.956672164225499f, -0.516696999265124f, -0.846015525317730f, -0.199370940530009f, 0.927580907007946f, 0.669786891276299f, -0.208316500739886f, -0.349932032863852f, 0.382722440637189f, -0.455635180187178f, -0.573852668753046f, 0.237990995216907f, -0.00210628303929439f, 0.846035951941252f, 0.921932267818374f, 0.141873820779935f, 0.871317167610738f, -0.632607355185838f, -0.565801401210940f, -0.959881482283947f, -0.732559764685905f, -0.655277252471118f, 0.136770193226314f, 0.206392768880907f, 0.0946932052352707f, -0.147722827344946f, 0.142504821799194f, -0.891443939735724f, -0.660161817562772f, -0.918683225740157f, 0.524851053279394f, -0.841532325411647f, -0.662931925252737f, 0.450018807591706f, 0.157794014139767f, -0.562525486647545f, 0.604051451992330f, 0.859220943805127f, 0.943321402026900f, 0.511188518123118f, -0.332990520726740f, 0.904709059147998f, -0.336911302156504f, -0.0329301811082998f, 0.307263624236174f, -0.640655394434152f, 0.791676792853669f, 0.450137270831791f, 0.746000232170803f, -0.915436267533878f, 0.976514418439799f, 0.828073391112522f, 0.990695018409237f, 0.419713963781614f, -0.286897378037841f, 0.111527193084439f, -0.956913449095442f, 0.263769440437253f, 0.534739246489713f, -0.918314908283506f, 0.680501951418845f, -0.0258330390798596f, -0.696521999550769f, 0.274590593565720f, -0.821334538131451f, 0.104139627465949f, -0.790104923997319f, 0.399265830301725f, 0.118854169469537f, 0.309552488812324f, -0.961100729890863f, -0.665645274594184f, -0.125767140532335f, 0.377154316156289f, -0.971986633153292f, -0.148225730575294f, -0.801072242848910f, 0.735673216754228f, 0.247753694178141f, 0.759093842520115f, -0.529946694334253f, 0.594235069164038f, -0.801015868726278f, 0.141962211231124f, 0.135473683510959f, -0.0431660672944612f, -0.437176231417910f, 0.467008031415084f, 0.324675317141816f, 0.122578305547357f, -0.0351479470228342f, -0.437236315511244f, -0.822621846670407f, 0.989461679354308f, -0.242059902390237f, 0.800837521050356f, -0.387832478851607f, 0.316362161826139f, 0.602440060427024f, 0.890992007298149f, 0.319686042477150f, 0.930326885903916f, -0.170779817104763f, -0.437602177375177f, 0.835764105962134f, 0.522922752459604f, 0.295156847627349f, -0.857646277751538f, -0.451421990712551f, 0.752856133268497f, -0.826193868550830f, -0.906961130052697f, 0.118621494342013f, -0.627099634988204f, 0.163256363060383f, -0.719362770410877f, -0.576563943780491f, -0.369939711177846f, -0.294180430088591f, 0.868430622614485f, 0.945955651201780f, -0.879259966782947f, 0.376142233233261f, -0.549019623646418f, -0.366403875933169f, -0.631308623984507f, -0.398270064613022f, 0.631780765950599f, -0.497821177556814f, -0.0754938097555216f, 0.358298259390762f, -0.438971283619577f, -0.835962846436280f, 0.771544885338102f, 0.132031497593111f, 0.0964144932127649f, -0.171144812197942f, 0.734241841669664f, 0.773828279651661f, 0.591442573315395f, 0.449840299498767f, -0.249196666141921f, 0.910274822633449f, -0.623687862912847f, -0.954398427932048f, 0.700975370671540f, -0.128268698036002f, 0.723971772247224f, -0.239872317271662f, 0.599101633280873f, 0.323504979356466f, 0.726076237951951f, 0.775013638477775f, -0.736157118505210f, 0.681129332563739f, -0.989456914597076f, -0.860559243921100f, -0.652547050354339f, 0.227533741410917f, 0.263244425371628f, -0.412800042549063f, -0.774547399227093f, 0.959749220773555f, 0.0285018454625012f, 0.0260964660594436f, -0.817249773797516f, -0.275510098931589f, -0.957071090655421f, 0.755874233806472f, 0.0601247360044190f, 0.155148678178749f, 0.744458452388040f, 0.206143083045583f, 0.405575258734775f, 0.591273066531951f, -0.286358679634110f, 0.168522523380964f, -0.0740663582251186f, 0.991796969736415f, 0.00304472789286958f, 0.0955103281360055f, 0.595292305224677f, -0.633460800851610f, 0.969720344590438f, -0.788939516987962f, -0.690852963213444f, -0.751849610482179f, -0.454105756229298f, 0.527652178438853f, -0.249156091787771f, -0.395486634371019f, -0.586329259469701f, 0.774216673365643f, 0.000796185912973479f, 0.753872935709907f, 0.691883261316931f, -0.599798140130743f, 0.140718954973018f, 0.400016581571111f, -0.412934563119652f, 0.782683275869451f, -0.837415681080234f, 0.503344297140354f, 0.443222186121185f, -0.869067764953740f, 0.891507832007671f, -0.258782538717313f, -0.592111951047753f, 0.542828422857983f, -0.959476625230936f, -0.373353196174649f, 0.558975637763876f, 0.848608638566440f, -0.861701716955403f, -0.937645215971517f, 0.0456695238513540f, -0.643462752057364f, -0.194887894642735f, 0.576940690214110f, -0.889414400002951f, -0.120401270393403f, 0.581976128201341f, -0.914549817300516f, 0.619675229253819f, -0.446355411157033f, -0.686510097388917f, 0.199022704414501f, 0.0679083509214176f, 0.939286059873160f, 0.919854436895475f, -0.921420499961796f, -0.933865152326639f, -0.173428453947994f, 0.0481843697148709f, 0.282408667923603f, 0.411093542307595f, 0.332739798472214f, -0.539048264159821f, -0.704491312083244f, -0.502163632960363f, 0.955228344617550f, 0.620064399129425f, -0.470222569036376f, 0.754614931250763f, -0.616308595262807f, -0.914574682979899f, 0.624066330640082f, 0.836911269770582f, 0.913639510454430f, 0.653228461676548f, -0.269928008555249f, 0.313006679186127f, 0.984676487220296f, -0.492012769698267f, 0.956868299674771f, 0.291679581317590f, 0.0391808383867289f, 0.572884371819903f, 0.0424011452585180f, 0.955486550514640f, -0.402317209279260f, -0.606465037288902f, 0.547296561663929f, -0.262634118959448f, -0.555413611714328f, -0.328781770154915f, 0.145794994289916f, 0.141260540582646f, -0.451655981927315f, 0.305553535897825f, 0.828724940454557f, 0.263943455052409f, -0.609183422737396f, 0.691170220321907f, -0.372701931956834f, 0.750237424665146f, -0.249353280856890f, 0.379870697565802f, 0.385751069018950f, -0.515117494253264f, 0.716937491491901f, 0.343749563024118f, -0.462962268225808f, -0.542579750084113f, 0.865163879545508f, 0.348358741505572f, -0.309602240547849f, -0.0504864877295679f, -0.822856269672862f, 0.199343960697129f, -0.790668167630170f, -0.0910655952543342f, -0.0243531696455832f, 0.832501734319368f, 0.604933598167068f, 0.899053047900036f, 0.270668041381131f, 0.523691409964688f, -0.0841567002292820f, -0.844392287920523f, -0.910987838261586f, -0.470654231510287f, -0.103828495683496f, 0.253788695977573f, -0.103172947809401f, -0.339896741661867f, -0.447251997825083f, 0.217200476817515f, -0.474840886373359f, 0.227876267254650f, -0.851351819181938f, -0.902078585170911f, 0.445464427415683f, -0.842484493463611f, -0.141606736723087f, 0.104224619207891f, -0.554900879859470f, 0.818556374444811f, -0.832710463532413f, -0.284760316465868f, 0.697962734672817f, 0.235137001970259f, 0.538298155374871f, -0.598477541924834f, -0.833959821954974f, -0.164556670763502f, -0.443902305525605f, 0.484290717235912f, 0.319356252041167f, 0.0834544406255109f, -0.839174383593280f, -0.514784811627172f, 0.466424623987191f, 0.597641402168886f, -0.344706573843316f, 0.346954604803744f, 0.150560726232471f, -0.963838773301094f, -0.210406119881130f, 0.740751216241446f, -0.519896828058978f, 0.882277568799242f, 0.982734995306564f, -0.691486807580351f, -0.120653164608028f, 0.263039860106709f, -0.472131671311566f, -0.469155525952548f, -0.562705921604020f, -0.737502946123759f, 0.151863404645485,
-0.367233093688652f, 0.149585386378220f, -0.152980596399920f, 0.572826412281344f, -0.498718037086228f, -0.0794332639424211f, 0.659760386972575f, -0.574814983564964f, 0.451329484188896f, 0.473066930128670f, -0.135151886005125f, 0.379571405476121f, -0.308712078323501f, -0.136843563834117f, 0.395667583713552f, 0.196238140324408f, 0.588147058383512f, 0.770505301611929f, -0.865188840370228f, 0.266437694165002f, -0.428134513764013f, 0.661967260527446f, -0.752421375452379f, -0.556389852423621f, 0.424944298468302f, -0.480554454112605f, 0.916159659428765f, -0.112147362457396f, 0.363475545209813f, 0.698805683596358f, -0.862382341730295f, -0.489415523853276f, 0.453056404353730f, -0.606183761884457f, -0.00869682692408680f, -0.288739722701460f, 0.487988005841341f, 0.566870040344668f, 0.0894575138005909f, 0.887832293799319f, -0.0981274237649674f, -0.279935090781560f, 0.506891141525948f, 0.952901245338457f, 0.458002767525373f, -0.569410776125351f, 0.849518291873527f, -0.585020953514368f, 0.676037258640625f, 0.299076264841081f, 0.911385441491479f, -0.954959555659035f, -0.681285607891366f, 0.631368118385947f, 0.522268523899537f, 0.900701101674748f, -0.647701850365577f, 0.567960815808216f, -0.138958982219446f, 0.267024801687456f, -0.975771109955874f, 0.314682157086949f, -0.378801381286130f, 0.665990927256163f, -0.573674360032848f, -0.860450785684384f, 0.516581474078532f, -0.190844183471714f, -0.451971355445856f, -0.808113003973650f, 0.860446168028895f, 0.377778958059242f, 0.126949039950121f, -0.892203650250330f, 0.572503460980517f, 0.975224974978800f, -0.202312370945465f, 0.500665599343084f, -0.0510413720986291f, 0.353231752436633f, -0.805555931906752f, -0.199761377956955f, -0.829487282239605f, 0.0282459088867508f, 0.814545057118991f, 0.557652277921578f, 0.613951716518862f, -0.678811366342345f, 0.896500288318877f, -0.627622562398925f, 0.802545092571611f, 0.211382709497062f, -0.979380222642662f, 0.826784411456488f, -0.670689878657734f, 0.788878029765924f, 0.137070906151783f, 0.901907287859132f, -0.526217367070263f, -0.545043827128876f, 0.494756249972086f, 0.236657948774128f, 0.156603327087660f, 0.516397244064118f, -0.325837179590292f, 0.460683385171580f, -0.196022953760504f, -0.441996357332195f, -0.808932369852494f, 0.291980108741838f, -0.833583979826152f, 0.365574438479475f, -0.797139524158001f, -0.0649288183732912f, -0.000696491493834994f, 0.100125393693922f, 0.598035350719377f, -0.312548404453564f, 0.0414605409182345f, -0.675913083156432f, 0.236245026389435f, 0.550464243484224f, 0.193366907856750f, -0.903654015709839f, -0.00993172527377806f, 0.0180900754210873f, 0.880678290110106f, 0.166539520562349f, -0.984509466189118f, 0.810283124477894f, -0.925371921448173f, 0.193528916069728f, -0.748644561903135f, 0.534508666819454f, 0.364436869280188f, -0.386979667637943f, 0.427958998441480f, 0.362750270039032f, 0.420886957715891f, 0.0300301961707390f, -0.655220626875711f, 0.0504522662127427f, 0.472640818703213f, -0.417745816013639f, 0.0689992794158720f, 0.461232479061866f, -0.483517586427718f, -0.411463769964024f, 0.622740736364726f, 0.659687134578680f, 0.243900134982579f, -0.684356227282321f, -0.688699031115733f, -0.316032121634021f, -0.644296362948831f, -0.236133265458216f, 0.880259454885881f, -0.956880609581177f, 0.737775899964131f, -0.529059297472703f, 0.794119601436042f, -0.375698158660466f, 0.493447663117292f, -0.752511119115434f, -0.941143365329844f, 0.610101048864035f, 0.253791011658991f, -0.369994602049336f, -0.697364270085742f, -0.681360550250048f, -0.571943442128960f, -0.749697324128684f, 0.611997629275096f, 0.892727938106141f, -0.440225399106758f, 0.00196047981855352f, 0.951252158369648f, 0.0351885308766962f, -0.471806546113710f, -0.657231535594911f, -0.0873481442406481f, -0.0341288006282565f, 0.579184398564974f, -0.224334624306026f, -0.298557652719061f, -0.509401519638379f, 0.188853505083675f, -0.321619146497229f, -0.613159956450671f, 0.570042044631281f, 0.699213203307007f, 0.537439231469861f, 0.529440733283839f, -0.744527226912905f, 0.362949055807175f, 0.529758698714545f, -0.114804719889245f, 0.991089489396930f, -0.186716454683287f, -0.218189173574106f, -0.0493780858124198f, -0.928812411399224f, -0.101855573638590f, 0.454268528366586f, 0.617591620012079f, -0.197519518988231f, 0.0973277590468935f, -0.185672509894105f, 0.649922648337967f, -0.896862900376972f, 0.594999589349510f, -0.746978997769556f, 0.590642952628647f, 0.935109901616311f, -0.293310684054096f, 0.783281817912060f, -0.189898897214222f, 0.414859016240278f, -0.0858574647662298f, 0.0810260863380805f, -0.633024441577653f, 0.248442861097829f, 0.984586601784679f, 0.982811638387854f, 0.547456083836220f, 0.476239638753291f, -0.897709902882279f, -0.208045489357872f, -0.860637131636973f, -0.496740558564284f, -0.944185351410090f, 0.157610983944341f, 0.975214099838643f, 0.550265718083095f, -0.630360326400067f, 0.672420341653334f, -0.897139264107564f, -0.670556423663785f, 0.298764071000339f, -0.310465384759529f, -0.978153640586955f, 0.189785151994709f, 0.929291975296760f, 0.758271912876084f, 0.806829662560108f, -0.472787451147715f, -0.802032434276146f, 0.455809631085663f, 0.985520713417984f, 0.739637167649794f, 0.311705106454777f, -0.120539152808323f, 0.977785717545631f, -0.848554870988208f, -0.281179241544089f, 0.931102239520177f, -0.255243432382956f, -0.284952242030900f, -0.189341152192864f, 0.647573166562597f, -0.474203015584843f, -0.545915610099538f, 0.672696420688916f, -0.239274489717776f, 0.956544960216021f, -0.0858024073600807f, -0.758223415922611f, -0.00817763648068581f, -0.500893489164054f, -0.669386983409311f, -0.344450617815217f, -0.728051392792875f, 0.804121117816188f, 0.00718436691280910f, 0.195237363230272f, -0.472485206728796f, 0.642070241911164f, -0.272384993247314f, -0.731715323915071f, -0.791266589031733f, 0.0339783427570857f, 0.0696513783219659f, -0.894169486972683f, 0.00234016305501483f, -0.0403382685361653f, -0.943600572111266f, -0.788181603936192f, 0.851406365407377f, -0.100015982664501f, 0.145502229793638f, -0.528736628076536f, -0.0313760382570432f, -0.662221611141088f, -0.885722031379862f, -0.744257140212482f, 0.524976313116033f, 0.186092035304635f, 0.181669793648209f, -0.606482674165339f, 0.849303544554227f, 0.226118051135263f, -0.690025550727719f, -0.256543384397548f, -0.207714017766381f, -0.447913202664626f, 0.375270273897879f, -0.884312586292038f, -0.0838720085819762f, 0.969898436757285f, -0.736808033249456f, 0.668875150485586f, -0.599937439969920f, 0.470077288925414f, 0.903135367105719f, -0.895619185450694f, -0.637694108244489f, 0.572669535020987f, -0.696211470281632f, -0.820577518545193f, 0.937364674938455f, 0.422458818039761f, -0.593964370461091f, -0.586264791612426f, 0.0282373486927521f, 0.298051147134121f, 0.592825359583763f, 0.716195674857467f, -0.684008410968338f, -0.167523841045924f, -0.370794208549223f, 0.768054740581884f, 0.997835641681024f, -0.366262133888883f, -0.523114034556271f, -0.457946740456489f, -0.530941146838744f, 0.298744841822404f, 0.390761228562591f, 0.0871171594445448f, 0.764002674223649f, 0.233966808661423f, -0.116573523634048f, 0.426118986433559f, -0.255934695328716f, 0.302314199650152f, -0.254971729124577f, -0.330865677738578f, -0.0840307537517577f, -0.711910586170446f, 0.622585361690409f, 0.367595248366733f, 0.422102667722561f, 0.269580206097961f, 0.707083822001774f, 0.625367208198523f, -0.729594790471199f, 0.708679674727951f, 0.00355767003560614f, 0.379158300246371f, -0.688791438249760f, 0.261637457245975f, 0.704008781391790f, -0.917586017594177f, 0.886443038824615f, -0.923559496787343f, 0.360365726214756f, 0.547058288460181f, -0.279853192856989f, -0.996331953899586f, -0.323735921605962f, -0.618788277975037f, 0.314597206161166f, 0.106380963133907f, -0.235044228453968f, 0.0406899091091886f, 0.687339428801573f, 0.344837805924860f, 0.123214914005620f, -0.735264225932133f, 0.0396243248944774f, 0.270602083588730f, -0.316104623194235f, 0.201800731173529f, -0.348987679395254f, 0.994312100135549f, -0.986073454140000f, -0.787571177818193f, 0.508460947811657f, -0.443663972776222f, 0.800303477136838f, 0.712158443474503f, 0.958364684407633f, -0.0512343510942759f, -0.391095518504938f, -0.291911155637644f, 0.721770656984705f, -0.163541232110535f, 0.0366644501980513f, 0.700853097239887f, -0.508089885354834f, -0.375072588159867f, 0.161585369564288f, 0.686325557438797f, -0.113188612544717f, 0.859354598908873f, -0.723198679696606f, 0.398879124170303f, 0.139357627051752f, 0.484780500073663f, -0.0437501438537016f, -0.868783676783105f, -0.147865612288567f, -0.116480069295514f, -0.986846049950927f, -0.859405305954576f, -0.631359938031082f, -0.0310065270390489f, -0.288382201791710f, -0.500960878568203f, -0.805633068309090f, -0.837604329816134f, 0.0325253228618525f, -0.538953832190091f, 0.913844038280417f, 0.681967460199437f, -0.656775429658090f, 0.922492558885196f, -0.689527254640680f, 0.688263898240070f, -0.225450858342925f, 0.0287239965989763f, -0.407744573364816f, -0.477326718671529f, -0.780374037627418f, 0.500400378743065f, -0.532646941279704f, 0.999679272201893f, 0.136003002234441f, -0.811267727922649f, -0.585019862511894f, 0.125465493193590f, 0.203160759437510f, -0.101322607820275f, 0.543784310894398f, 0.630139383695983f, 0.775322422120693f, 0.229262447827729f, -0.656821799421711f, 0.795940998463793f, 0.263281283116320f, -0.377237794697631f, -0.714267543277316f, -0.161924029976839f, 0.804294011825499f, -0.500488029613262f, 0.716655543045374f, -0.709565530287520f, -0.260746944768714f, -0.496886497176178f, -0.896154699339640f, -0.891352204187934f, 0.0589172685048254f, -0.952496908556348f, -0.543314015084183f, 0.0724005345282401f, -0.132089156895576f, 0.694937364018361f, -0.884509342587775f, -0.944587795707932f, 0.346949362800262f, -0.587900264454839f, 0.531217960795664f, 0.404240620498887f, 0.182769547944683f, 0.804826966991636f, 0.601398794220406f, -0.767933817870427f, -0.329693990599177f, -0.880648189418561f, 0.0370834298504716f, -0.405270662847564f, -0.551993194163015f, 0.357335885219159f, -0.442910616174561f, -0.978355051725551f, -0.638907517841606f, 0.266841057307734f, 0.778698832906031f, -0.967180516636130f, -0.772940622039654f, -0.268706136695081f, -0.326082261974967f, 0.0386785617389067f, 0.576293286973562f, 0.446884000380730f, 0.396703264915684f, -0.718633572608705f, 0.586041202195072f, -0.791039546767268f, 0.556638124682382,
0.728711593864679f, -0.576551104247230f, 0.690227524206044f, 0.0451432373341216f, -0.0569690667958747f, 0.877674150343795f, -0.268602876493051f, -0.770720641807978f, 0.630269600593677f, 0.801702094819180f, 0.177071915997341f, -0.0764831522886398f, -0.476930347674815f, 0.0196833210809626f, -0.566188434097295f, 0.309890567123613f, -0.642682312350471f, -0.645839718540077f, -0.985031719881713f, 0.153028235575708f, -0.446724738384881f, -0.616280949001367f, -0.306418078463084f, 0.313048512921978f, 0.944732667717825f, -0.292311689238647f, 0.263616032352334f, 0.776777395064071f, -0.529182830991988f, -0.418996105801001f, 0.286960890623362f, 0.588336822287104f, 0.268219370126612f, -0.696727535489037f, 0.806089151192541f, 0.0396168299208206f, -0.613570658239778f, 0.358002315998429f, -0.0576147175733950f, -0.859664908314368f, 0.930793190364908f, -0.108955403960031f, 0.640347446939098f, 0.0301817512477458f, 0.508435547839785f, -0.774928250619894f, 0.254548271045827f, -0.192551571812315f, -0.401867317012389f, -0.136220787532581f, -0.480363308055205f, 0.146599399729624f, 0.225767301672040f, -0.207158678688912f, 0.763491487133281f, 0.161192803873192f, -0.574968151683314f, -0.454043408746924f, 0.427131132989065f, 0.170648543751820f, 0.0690597676805780f, 0.0360172652133248f, -0.244429817416531f, -0.973014074152018f, -0.172642279134011f, -0.798684796670922f, -0.622626145444778f, -0.743408670602069f, -0.316057396003030f, 0.908608689971065f, 0.948356574904685f, 0.573858539226522f, 0.457065605245418f, -0.246203048690671f, -0.750525340546383f, 0.612971646035183f, 0.951528788403619f, -0.529776510809815f, 0.0886901849846271f, -0.0254136796699882f, 0.978897595553096f, 0.293893753097695f, 0.620217642132267f, 0.862352989549627f, -0.379040515436326f, 0.790157871471479f, 0.147151952442201f, 0.688271487774812f, -0.897847532497188f, -0.0355337105008888f, -0.850253422176695f, -0.0354384862653523f, -0.625796807949394f, 0.851730076897135f, 0.294773618291289f, 0.834287219330433f, 0.0758749738551283f, 0.912613321307355f, -0.326698079590551f, -0.844748577890143f, -0.685263599922107f, -0.197029963909655f, 0.591416614029013f, -0.130921826828109f, -0.524292687689084f, 0.356220524225632f, -0.150091552835503f, -0.935232109847821f, -0.302103008478127f, -0.998557516519010f, -0.477012685701094f, -0.882343341754284f, 0.210797034143964f, -0.963566378978947f, -0.855600913755685f, -0.790231379847513f, -0.625235937382084f, 0.106405105589857f, -0.760544427202586f, 0.0103124858505332f, -0.610157345750845f, 0.968354521575116f, 0.602472069136318f, -0.216458111191680f, 0.935180184275450f, -0.369261245032360f, -0.289325139062185f, -0.772389696964545f, -0.345513639348744f, 0.135539262008296f, -0.747409495863324f, -0.849724942811800f, -0.739393030129744f, -0.0301380087411172f, 0.373808817820448f, 0.760444548005323f, -0.365739960428504f, 0.121859476627292f, -0.719257541809299f, -0.136914676340304f, -0.178479405732130f, -0.336676444507223f, -0.795056125367297f, -0.0872862684496700f, -0.950510559362909f, -0.395266512078238f, 0.636773305385949f, -0.150667208767723f, 0.534401287220298f, -0.349371424663528f, -0.784729313810243f, -0.0510904599006878f, -0.938702345462904f, 0.616929636007953f, -0.228578318449040f, 0.239101663221907f, 0.0390879233281141f, -0.294705782740043f, -0.847928516841798f, -0.0480433695823821f, 0.487351505367245f, -0.820736333448301f, 0.128692585024021f, -0.305133215914817f, 0.344900079505924f, -0.764316168982242f, 0.717529584295197f, 0.655848670831377f, 0.479849611138232f, -0.107624564628078f, -0.345816374073252f, 0.0822414215758816f, -0.0120870567528208f, 0.475870901669481f, -0.00594923432583361f, 0.869227669945672f, -0.262862047504512f, 0.272430399676396f, -0.734262318791166f, 0.980593493214018f, 0.110413869658192f, -0.732486564250777f, 0.470756873196238f, 0.897133387901917f, -0.151953973158384f, -0.591296220619271f, -0.113167158942796f, -0.103020520738423f, 0.220384226627647f, -0.0570027879342681f, 0.0923157145066511f, -0.523010309215342f, 0.385053964060568f, -0.223938668105458f, -0.0566497019068211f, 0.636390081595965f, -0.753651530578004f, -0.765450358896516f, 0.790370075460245f, 0.622949415286967f, -0.0947634056426396f, 0.122381201893998f, -0.138573523511105f, -0.544298107235542f, 0.535416341314523f, -0.341107295330707f, 0.266262786345860f, 0.620108481133049f, 0.190424987800150f, 0.978559599202704f, -0.925772919482004f, -0.300038300695816f, 0.963372836978511f, -0.501235224357981f, 0.828375446308031f, -0.595716120481773f, -0.889271354193173f, -0.389843123593065f, 0.659433696092409f, -0.633476165557619f, -0.708607689555741f, -0.737738480460783f, 0.985245299432648f, 0.976853985813928f, -0.863072444190232f, -0.785830171723126f, 0.309433061520758f, 0.166813366328975f, -0.552916412621405f, 0.0385101740167735f, 0.445866961855263f, 0.222557362424800f, 0.0710515871571971f, -0.368563489700928f, 0.317406114361191f, 0.326902000037272f, 0.868261309598320f, -0.897838476369198f, 0.664364291232529f, -0.373333343843574f, -0.599809263387549f, -0.411236387818613f, -0.118186587264933f, 0.544960929851182f, 0.395925813072269f, 0.337332244255533f, -0.0195528742963547f, -0.580383437020279f, 0.0779554182143842f, -0.902635825594202f, -0.821554429188969f, 0.869996816042779f, 0.646142135585380f, -0.0824693320525758f, 0.643317857725100f, -0.903892480205129f, -0.457595546004975f, 0.540461917564665f, -0.467530238695992f, 0.107497588388074f, -0.122360487746121f, -0.276968072230331f, -0.436413500733568f, 0.0719555518906898f, -0.794937479672675f, -0.641344733876686f, -0.934734152781945f, -0.0610463967348016f, -0.302623058375597f, 0.281116298309257f, 0.557459622053789f, -0.350054779110337f, 0.681853624031498f, -0.0454067482892435f, -0.897204174835461f, 0.0289327275291300f, 0.664312739864751f, -0.368814604980581f, -0.576946854776660f, -0.187886132141311f, 0.424385580259236f, 0.257994303715228f, -0.567650112011742f, -0.0453371545575014f, -0.362909825264387f, 0.450095578912812f, -0.713870209574945f, -0.956583539581944f, -0.969891699048729f, -0.417755773448598f, -0.230738535348142f, -0.153353095644968f, 0.539368458440622f, 0.591116036659417f, 0.779095541288385f, -0.578525766017613f, -0.587777137316663f, -0.301051260910212f, -0.319655538885669f, -0.343495369437935f, 0.908167583226333f, 0.764220052027033f, 0.0536418758245909f, -0.0529753241803754f, 0.249066042857931f, -0.840152142252005f, -0.529971459254312f, -0.449462194610696f, 0.467144819001113f, -0.500103828192601f, -0.758390449663076f, 0.369740436821770f, 0.189153926151852f, -0.188283227959439f, -0.427563759945909f, -0.186773725840825f, -0.00989853573399446f, -0.783648829817413f, -0.626450875837851f, -0.328015817185970f, 0.760383401930071f, -0.00804531008117837f, -0.982799468341000f, 0.392730506677802f, 0.117799138097530f, 0.351088974844522f, -0.259750164530173f, 0.776495358243216f, -0.703059519879109f, -0.362866233240751f, -0.421345310205860f, -0.818968876330675f, 0.936887497269786f, 0.713300632813635f, 0.916608801523944f, -0.147818975792564f, 0.317064988534009f, 0.885779227314381f, -0.897706599297367f, 0.685423132064732f, 0.907830438936990f, 0.0636614655685575f, -0.423018627861747f, 0.411565657893159f, 0.911060408474647f, -0.617833142759668f, -0.709543522964145f, -0.817633731247023f, -0.252433983274424f, 0.160456393103956f, -0.160765428576997f, -0.622001061437904f, -0.470257555319641f, 0.790643274059634f, -0.648181378655916f, -0.828694900506363f, -0.0234091767546987f, -0.562865077760768f, 0.369299949506391f, -0.423850142805423f, 0.520699811923658f, -0.877662359466779f, -0.739844704434180f, 0.300520939787139f, 0.0655718600121620f, 0.970843358712180f, -0.634231195336845f, 0.324880041395596f, -0.479089635857354f, -0.196422753715449f, 0.568762754402869f, 0.699215376070842f, 0.445741923102597f, 0.679868900756090f, 0.107609859752086f, -0.980983474461865f, -0.788419140653730f, 0.0696289436185713f, 0.00330944186568516f, 0.392265626672398f, 0.803469542460994f, 0.131029913648810f, -0.845408454497170f, -0.754797811352229f, -0.824208086798235f, 0.510072775586974f, -0.809491727769575f, -0.0228491196350333f, 0.920014947791232f, 0.441066319826495f, 0.969846842038360f, -0.199024726691046f, 0.886564290041856f, 0.203997575245743f, 0.481547443573126f, -0.637742489331117f, 0.0664642070998316f, 0.109187062068770f, -0.952676759642045f, 0.309247049771982f, 0.880534651306060f, -0.269363005485603f, 0.280012695899358f, 0.853031642671923f, -0.216236966392235f, 0.903180305900435f, 0.837949615815047f, 0.748563816043584f, 0.266735542018788f, -0.685176037557414f, 0.505893787666761f, 0.977721983069541f, -0.667151469253569f, -0.451774081267849f, -0.385755850727233f, 0.681037251596535f, 0.550130384863457f, 0.704080312734731f, 0.519624533199220f, 0.789651392050294f, 0.176325856625025f, 0.684011432098839f, -0.469125761119035f, -0.841814129063957f, -0.901473334652527f, -0.117747872709914f, -0.608533033968273f, 0.199709646080986f, -0.349430401438670f, -0.435162733168206f, -0.368150014673779f, 0.699084004342174f, -0.446068942643995f, 0.197420740774886f, 0.524893584115327f, 0.706475758890142f, 0.912020785879679f, -0.820472223153770f, -0.334742316079635f, -0.851724976994477f, -0.702164662784812f, -0.649654462810552f, 0.411435475616403f, -0.0438368033650360f, 0.799231452421757f, 0.713371883779316f, 0.252437083518609f, -0.685658163265283f, 0.0734649179831324f, -0.400549431226783f, -0.415602545578540f, 0.233864615718965f, 0.828846528739923f, 0.606577491175688f, -0.266016048272811f, -0.619106744484090f, -0.690853262778644f, -0.503499724631377f, -0.409761822901473f, 0.0576293548519007f, 0.551582021066584f, 0.132631452787255f, -0.838228405334512f, -0.107475742619267f, -0.875306852866273f, -0.184700469068763f, -0.317074087896838f, -0.580912620700556f, 0.453916157844897f, 0.690470988649940f, 0.712835197480083f, 0.314786689622726f, 0.759835688452120f, -0.671090442836235f, -0.408277610289776f, -0.815988422173708f, 0.227854929660384f, -0.0482646895577266f, 0.968141192561708f, 0.373896367655818f, 0.820435826598941f, 0.817746838197885f, -0.0970819110331989f, 0.679170154451559f, -0.577986561676471f, -0.0523570914231941f, -0.776930151133931f, -0.560456597170701f, 0.927747720961181f, 0.0350177837302503f, 0.844938034137843f, 0.00849044473190053f, 0.325089161670337f, -0.851825175889265f, 0.835251667623832f, -0.266397917890485f, 0.108463887056499f, -0.817868888235156f, 0.590399913800720f, 0.699274619715208,
0.200782223352391f, -0.936155874445214f, 0.218471971175575f, -0.890402779861849f, 0.268496441855317f, 0.881231954583528f, 0.279360358017994f, -0.492400368838405f, -0.894376670076375f, 0.585129064098519f, 0.340135248071744f, 0.455880107692993f, -0.861081993524584f, -0.303321115935151f, -0.562781799622214f, -0.526041750296426f, 0.999581943964160f, 0.249814139040315f, -0.0537475603822974f, -0.845239239849439f, -0.874024176808607f, 0.997751771128387f, -0.861617607547820f, 0.671357923629889f, -0.687974310115279f, -0.969462039056016f, -0.448304961870341f, 0.713064428261850f, -0.00718668165564318f, -0.450608596544700f, -0.106059234376561f, -0.591961308554238f, 0.588633089685867f, -0.755341317752403f, -0.542715401462936f, 0.759199260356047f, 0.0297710796506234f, -0.997343196630657f, 0.574076752994254f, -0.696719940193256f, -0.852227517176613f, 0.906332566627663f, -0.171801252847090f, -0.925131151948528f, -0.0212194634560026f, -0.940316444070044f, 0.262965279952363f, 0.902198615594563f, -0.265057066430189f, 0.161983092277652f, 0.0181345459457500f, 0.467973650469608f, 0.857351800575040f, -0.889882538061811f, 0.728868283859490f, 0.671187732362764f, -0.296882575397444f, -0.793099233276668f, 0.335561922676737f, 0.0671874495572633f, -0.0857142329385701f, -0.352870876674233f, -0.119927139078065f, 0.814127111105761f, -0.323910302649634f, -0.313495077982818f, 0.0690526899468447f, 0.877155536890319f, 0.768040884649443f, 0.158910636324140f, -0.824414709871474f, 0.00718921022841235f, -0.868917281154898f, -0.564967532196669f, 0.206261416621150f, -0.0699574404456100f, -0.0547095858591442f, 0.811674902353136f, -0.562993920383635f, 0.441212008804309f, 0.917951119557396f, 0.915571961092301f, 0.0901952529553498f, 0.614118141118295f, 0.760473529905706f, -0.566505475760865f, 0.00880029006400429f, 0.975626259597421f, 0.370738159620831f, -0.0242162976348563f, 0.828887690189252f, -0.665240810020082f, 0.00123256686221063f, 0.184020074202841f, 0.829917510366750f, -0.447854906466885f, 0.529356328938248f, -0.995192699858126f, -0.843748622724646f, -0.422765372440245f, -0.386179414096638f, 0.206325400140261f, -0.369817591904938f, 0.266933785902425f, 0.892617584642659f, 0.740018647415220f, -0.481907279471296f, 0.248268418729551f, -0.382770749117505f, 0.974424303757207f, -0.879320252286332f, -0.0294961755317245f, 0.638693329623790f, -0.765127178629299f, -0.160881380476610f, -0.725001019123526f, 0.00294709357263234f, -0.701949969294570f, -0.708933381768328f, -0.463893635537772f, 0.476650147791524f, -0.206043208566879f, 0.223011684523516f, -0.258637160422673f, 0.206325908651728f, -0.432336904344548f, 0.921979975841259f, -0.944396630315761f, -0.00680582426415510f, 0.319263487872783f, -0.836389324192867f, 0.111532890274445f, -0.938142383682239f, -0.637288670131655f, -0.834211558255576f, 0.251969378874330f, -0.970874587083192f, 0.831662411079802f, -0.446568187924869f, -0.659109068071113f, -0.877869176622375f, -0.890670252448197f, 0.477602927742628f, 0.324737705007923f, -0.147513413112549f, -0.186594638422632f, -0.282864808082840f, 0.745093922271927f, 0.915500859154332f, 0.0421588655873384f, -0.483320910754088f, 0.00503734690385604f, 0.555792895688253f, 0.129412601050279f, -0.229347983583150f, -0.680101211823600f, -0.866063899229274f, 0.437769924839021f, 0.133958234316391f, 0.589233411145099f, -0.498053917701437f, 0.180863681584405f, 0.525955777469479f, -0.581250985307273f, -0.327934857804250f, 0.482381204171926f, -0.867703472610278f, 0.833733008515087f, -0.607761820334944f, -0.758512235503178f, 0.0380785706067470f, 0.719862150842292f, 0.651283470517919f, -0.614218162858801f, -0.239754124815405f, -0.733992057859951f, -0.422541764223845f, 0.951215428883086f, 0.882569470276544f, 0.937054481646402f, 0.184532408731968f, -0.104097666585483f, 0.693277433170057f, 0.800241936558839f, -0.998230532922071f, 0.259835639125661f, 0.562745639592536f, 0.220441127510705f, 0.313735993201991f, 0.330940415696351f, -0.602872424656300f, 0.841677792852844f, 0.749701489563795f, 0.266727039860087f, 0.696379094133993f, -0.430719144952456f, -0.276768289732264f, -0.0872580230244173f, -0.722033206227688f, -0.837309584159114f, -0.629739366225350f, -0.185692585028452f, -0.110619837317415f, 0.515881116042359f, -0.105875685978079f, -0.513700186568578f, 0.961245417898430f, 0.655513716233953f, -0.0921704793645632f, -0.694925472850399f, -0.872174817305748f, 0.0307133806779607f, 0.531120672076921f, 0.965271277398122f, -0.00974420246777163f, -0.497322783064087f, 0.693565685926388f, 0.546918707342947f, -0.230039497490898f, -0.316024461029338f, 0.684231559582941f, -0.306362794944468f, 0.861366189035942f, 0.378922635334764f, 0.259443877770437f, -0.838617128408830f, -0.205350631644011f, -0.139772960377519f, -0.192918167939180f, 0.602404904043886f, -0.537407583974730f, -0.877007125624351f, 0.361539942609439f, -0.732030207831016f, -0.488792995226420f, 0.612591017966442f, 0.567185560938756f, 0.195543595335781f, -0.428955670554558f, -0.666590144318038f, -0.702467396810860f, -0.894350832807439f, -0.0620405855731709f, -0.583114546325259f, -0.482155957064968f, 0.212152442925647f, 0.112603107288251f, 0.0683986906619714f, 0.639176340917929f, 0.642610005510521f, -0.708605273163374f, 0.739594669131005f, -0.492786220480274f, -0.308196102291547f, 0.918748221553053f, 0.186736140989674f, 0.438437026242591f, 0.638769573344929f, 0.928896220524135f, 0.579945520523175f, 0.218608554904045f, -0.526070140579576f, -0.140303420071590f, 0.304347769360423f, 0.488123173638490f, 0.987207018313181f, -0.536397951752998f, -0.553296120219359f, 0.184294880372153f, -0.101502970339396f, 0.287041514309517f, 0.658172721877726f, -0.270141883431914f, -0.0196021946303913f, 0.000779126872975988f, -0.0500294515684538f, -0.588505226599557f, 0.550916571982769f, 0.703271386531766f, 0.982335628009701f, 0.942133544852489f, 0.690741953320684f, 0.0466423349204477f, -0.941178278727504f, 0.121655023640973f, 0.777925151322362f, 0.132430336075323f, -0.114812120408198f, -0.694094073965245f, -0.441397675924967f, -0.187253074701348f, -0.672248118097589f, -0.688869123609503f, -0.0723581859661586f, 0.553779536791160f, 0.380610143087564f, -0.392032089052147f, -0.709403552653908f, -0.607184251637473f, 0.698227587629545f, -0.272885954851784f, 0.0736609147840435f, 0.687106303730018f, -0.230362931709251f, 0.393640839382244f, -0.846905732907407f, 0.0727598538725249f, -0.0119849190815611f, 0.470122652313157f, -0.171681529301612f, -0.329268850654460f, -0.433013841687086f, -0.943499527192280f, -0.123404693276305f, -0.0861435714812342f, -0.228816973160929f, 0.0531549757963279f, 0.901446101051298f, 0.470738280922993f, 0.238383552115632f, 0.292841887198914f, -0.617423653544601f, -0.865786115828523f, 0.586332203179351f, 0.267618252846898f, 0.888575002575769f, -0.0220649407038027f, -0.946385428026066f, 0.317436113017866f, -0.277195072909682f, -0.207326502081016f, 0.735387675940421f, 0.961386190882120f, -0.564038045970629f, 0.840007249305217f, -0.262593952346269f, -0.556378761937190f, -0.346529850864238f, 0.00895460576800877f, -0.695431082536551f, -0.105261635693881f, -0.658342101938401f, -0.631093613961188f, 0.601639903111316f, 0.886830692209879f, -0.600591324826329f, -0.350296019796741f, 0.294348102011741f, 0.555826495708193f, 0.216370653207427f, -0.672654026881445f, -0.572202359802723f, 0.202776438466314f, -0.490708964058038f, 0.0148723360197853f, -0.799031226692943f, -0.221164759306209f, 0.0323674121757880f, -0.130290693568615f, 0.613592603765503f, 0.372755498065474f, -0.540502917956863f, -0.740021877141017f, 0.652888612951242f, -0.666157898478327f, 0.476156241264794f, -0.632081251666311f, -0.538341981270842f, -0.275717185193560f, 0.332983363477103f, -0.989659450166330f, 0.212868816589688f, -0.238985653168422f, -0.453005976359810f, -0.805975530848911f, -0.948192632970312f, -0.291329963979224f, 0.549811667826684f, 0.291147979443248f, 0.909805561757383f, 0.0728533843443158f, 0.737767652888933f, 0.605331616290165f, 0.274826946403577f, 0.710517586349601f, 0.666670055891909f, 0.522059053677516f, -0.553398792071804f, -0.406610321679562f, -0.893232547853708f, 0.549587730399741f, 0.714498083720551f, 0.281833380830291f, 0.652788061587949f, 0.825163748516741f, 0.381299333971584f, -0.485549061474930f, -0.881961689917888f, 0.308937809723222f, -0.524542880617761f, 0.329114405956449f, 0.434631551667457f, -0.894732322264538f, -0.831528385961058f, 0.669760583803638f, -0.674650675537928f, -0.373119878846435f, 0.456602566684508f, 0.387804792569985f, -0.556983911869482f, 0.000826745899317194f, 0.687973801099889f, 0.0471935422816141f, 0.0768302380434509f, 0.317557055919800f, -0.823316513699125f, 0.394699119350099f, 0.609556161256400f, -0.0413041171293194f, -0.244100882405517f, -0.939678976894569f, 0.403390183804743f, -0.933567523933859f, -0.331149894636631f, -0.0265881324103010f, 0.224249195386459f, 0.888271870759308f, -0.119845268644579f, -0.357275416804345f, -0.597001288429956f, -0.486847206619720f, -0.181232488650601f, 0.115441291842326f, -0.599055795186955f, 0.213179364205327f, -0.205238322081458f, -0.373942142629613f, -0.610680997090469f, -0.495737765362772f, -0.257634306994249f, 0.583708320566486f, -0.372047136603982f, 0.953878668619925f, -0.632595987923462f, 0.452049761997455f, 0.166602807787896f, 0.773555002555059f, -0.277154387560832f, -0.557129156714301f, -0.985242402457283f, -0.441173064787937f, 0.561221765682284f, -0.352004972295446f, 0.970292440826449f, 0.855523836321424f, -0.528113079339624f, 0.685454746939680f, 0.322200261898966f, 0.953249967336372f, 0.825673980624808f, 0.177229970128320f, -0.728281956776614f, -0.479030792350269f, -0.00697019557862144f, 0.851652517094715f, 0.853865750362844f, 0.514736989335681f, -0.943509205199198f, -0.0524009027225623f, -0.0798997671509367f, -0.355414349557791f, -0.366273957594958f, -0.565729285138989f, -0.931573923976439f, 0.345119269147864f, 0.638375370217726f, 0.711524360229150f, 0.331664704859388f, -0.986788646426241f, 0.521200596781614f, 0.656290865944842f, -0.436907564088290f, 0.305075696150381f, -0.848337345127939f, 0.354044695448027f, 0.690691708552038f, 0.900352213238582f, 0.475181192463882f, 0.219103309687964f, 0.885437995493547f, 0.421455288320496f, -0.879874221804522f, 0.893371290952196f, -0.545214090169942f, 0.800731783168682f, 0.249421864783476f, 0.0766192343033301f, -0.745747520609971f, -0.613575150364454f, -0.700199720327423,
0.0694373671332735f, 0.759953164582251f, -0.0973030480378387f, -0.298615297250225f, 0.0176506580013247f, -0.269562553201540f, -0.405489169051539f, -0.00491991297033256f, -0.0327449030548885f, -0.688168836745951f, 0.703014457338754f, -0.0909491575673764f, 0.738417882180070f, 0.202377973915515f, 0.338436193625848f, -0.408790267504483f, 0.611776208408261f, -0.711043784659083f, 0.841495665411188f, -0.0445715899008592f, -0.127281559164749f, -0.778797832908623f, 0.210344625249896f, 0.287086540530447f, -0.703702357088620f, -0.151146112491418f, -0.785180444786487f, 0.427963227387140f, 0.873814130606035f, -0.344356753075357f, -0.755726746591465f, 0.846013365191461f, 0.126678120904524f, 0.166687962199295f, -0.148273386834835f, -0.770559345875477f, -0.999129219024862f, -0.223692721084046f, -0.652712854614213f, 0.468054498362978f, -0.911782175948953f, 0.555084850374905f, 0.103972972463380f, -0.414021910330282f, 0.938793897617340f, 0.515461292224815f, -0.127677414947037f, 0.510661477088580f, 0.898409443447962f, 0.528096097102698f, -0.444620870908750f, -0.275909952832928f, -0.516074838791812f, 0.110104492330694f, -0.293114842926621f, -0.596621371059734f, 0.152807456749103f, -0.592864305196648f, 0.948295231208874f, -0.575278847840010f, -0.312463646261757f, 0.664597237604897f, -0.177619554099550f, -0.932259652303036f, -0.295074750863924f, 0.731539128777660f, 0.860409131570119f, -0.0947206503071862f, 0.106073387018718f, -0.235389180430490f, -0.494787189603633f, -0.536357147973158f, -0.680862001049455f, 0.618979489665256f, 0.613893487415732f, -0.308605775713246f, 0.694789556987429f, -0.440049894326668f, 0.908690328690240f, 0.233612239829512f, -0.190662564463532f, -0.344799878911344f, -0.185877286582818f, -0.553543917790750f, -0.859543533414720f, -0.996044831818542f, 0.0388505104043095f, 0.650508591477642f, -0.425233346101631f, -0.576839967180874f, 0.378730359294024f, 0.531713629917424f, 0.506096660522796f, 0.854779196325727f, 0.725302682547051f, -0.414685510902716f, 0.654208477287561f, 0.580368151427426f, -0.000356066597174687f, -0.897393734991154f, -0.845565244312410f, 0.615044057364182f, 0.0434592638759266f, 0.342119048500289f, -0.696414680186901f, -0.713269554140146f, -0.580866925323696f, -0.290886355957456f, -0.473082507703548f, 0.517942229000179f, -0.846159512055215f, -0.715410253368047f, -0.526272663742330f, 0.114004124940380f, -0.207397773975621f, -0.920379649009572f, -0.277970833475531f, -0.636533427057722f, -0.972531734576472f, -0.687000156900366f, 0.872752357637196f, 0.617872391924648f, -0.835274231587444f, -0.383282792481497f, 0.399233665040770f, -0.191230601890140f, 0.620222785371960f, 0.106379326744619f, 0.987222511696630f, 0.219022023664391f, 0.179689082166371f, -0.961619514581522f, 0.570178582343486f, -0.811091514477978f, 0.924484469376845f, 0.744507591138529f, 0.272936430096096f, 0.0646316580619510f, 0.314005111302676f, 0.558833629327024f, -0.329744916784918f, -0.544045568909541f, 0.895769679770795f, 0.798125821580789f, 0.877473384028199f, 0.616163339432501f, 0.441057381106904f, -0.642498173762053f, 0.989059595616979f, -0.374771110304453f, 0.480877593471524f, 0.904941689893360f, 0.428742160807762f, -0.430483645585549f, 0.0830560957640680f, 0.694220841170708f, -0.602964792788891f, -0.522672782287498f, 0.717494777479591f, -0.918002255923909f, -0.454075191574169f, -0.378662039464110f, 0.221482629450150f, 0.750918040362614f, -0.636211037178780f, -0.254529141198887f, -0.944623201010144f, -0.720775773991847f, -0.674641067104323f, -0.208243950413264f, -0.959488786545901f, -0.619966503980330f, 0.599486634018692f, -0.0955439064236721f, -0.458181000169795f, 0.736914498713083f, -0.176789993854223f, 0.676652697410790f, -0.967275583857650f, 0.319377813603719f, -0.427030468653864f, 0.0670640089595258f, 0.769945699222976f, 0.767923203047440f, 0.985790354694142f, -0.207111795449682f, 0.219134401666738f, 0.548513609112215f, 0.977227384558063f, -0.198131173309759f, 0.914163808432723f, 0.178214485462450f, -0.240590252223318f, 0.356128697574950f, 0.453093488702627f, -0.0401152114159198f, 0.818060948361957f, -0.880551400213416f, 0.631519794065582f, 0.658832307703964f, -0.179752451562622f, -0.237844011105596f, 0.739834592198990f, 0.711355594921083f, 0.774856912009109f, 0.321864249971600f, 0.470574585274056f, 0.261964793641569f, -0.634481134262705f, 0.461363065389595f, 0.0879014163867016f, 0.698353456328335f, 0.0611830044908546f, 0.918599000791453f, -0.147822590771951f, -0.208296009525534f, 0.775436805889909f, 0.0380914463017457f, -0.954468558268744f, -0.620451283908529f, -0.770251739379244f, 0.772246778681563f, 0.326462458587915f, 0.417738473564738f, 0.0942643452092895f, 0.486153909005530f, -0.720202618855819f, 0.0172425211828453f, -0.460430186764708f, -0.582933725313246f, -0.439721219285309f, -0.694337374508112f, 0.493516461453915f, -0.993527345413430f, -0.562763570629586f, -0.0644937992008268f, 0.741476357523546f, -0.668588797988340f, 0.594184164979780f, -0.605220767543645f, 0.110074204567278f, -0.599398769115359f, 0.723882026196765f, 0.678747828159456f, -0.608589528492249f, -0.881419419882399f, -0.139357674240927f, 0.873828011683502f, 0.314798068434754f, -0.457017849147976f, -0.526003289738433f, -0.411404919696823f, -0.792254466556923f, -0.299635866135236f, 0.0102316480137963f, 0.161921266554201f, 0.981427028530907f, -0.647351555346480f, -0.183312260273700f, -0.348651484808239f, -0.198142718294920f, 0.589869434168343f, -0.201926511662287f, 0.0337896878721506f, -0.0276515055864679f, 0.236943449722327f, -0.473103622922213f, 0.954358213176107f, -0.536519478008862f, -0.603363977756898f, 0.776267386457251f, 0.780662223932714f, 0.289187291033147f, -0.439954328280331f, 0.0429585232791456f, 0.457321950803212f, 0.236810565417317f, 0.167393310927116f, 0.634521586990289f, 0.154409349572581f, -0.750588956901316f, 0.862647670558265f, 0.800182258889404f, -0.342011510602950f, -0.102697321575297f, -0.797254530582515f, -0.718599505627591f, -0.729105921762328f, -0.152424255231618f, -0.702781451563249f, -0.0212710413372206f, 0.961258625954530f, -0.598484979483616f, 0.188043416567111f, -0.511990501189325f, -0.437449883017104f, -0.352443017251219f, 0.0991554004559394f, -0.663282401319921f, -0.835139403797870f, 0.587602722898819f, -0.939771062270554f, 0.613878515061637f, -0.523857415147229f, 0.444842501987166f, -0.297001528475358f, -0.914581150341453f, 0.554844832376064f, -0.816400014706997f, 0.823726509832068f, 0.704425080572720f, -0.819397910034912f, 0.999003444973468f, -0.968751535943602f, 0.0311500939174130f, 0.247867291448898f, 0.835560943875924f, 0.169794916341582f, -0.302041142019408f, 0.289549413666482f, 0.672141268085176f, 0.947060095876251f, 0.324754171403184f, 0.800014020753458f, -0.785428883146460f, -0.463092135879982f, 0.659192831110219f, 0.118301326248760f, -0.542297334341874f, -0.335957421787428f, 0.794808066256455f, 0.625133567458879f, 0.227917183877260f, 0.533557157748932f, -0.948877884679630f, 0.186417887458649f, 0.859592912781013f, -0.0183320237921572f, 0.967066787435574f, -0.141349529637213f, 0.958107445094614f, 0.264359167622140f, -0.631325355674829f, 0.684598042547604f, -0.527467468151933f, 0.294659298854560f, -0.439220168509424f, 0.391038218778621f, 0.0155669207052447f, -0.681384294454809f, 0.146739459198561f, -0.756404876084652f, 0.381192113543008f, 0.442850940158445f, 0.964002016096921f, -0.0507253848694798f, 0.563462880019551f, 0.190980650425415f, 0.482598778123453f, -0.273426091300166f, 0.980640722167518f, 0.198298590133615f, 0.678100193958147f, 0.530416610025615f, 0.196483886579908f, -0.00515783872303177f, 0.0273438459465027f, -0.257248394117661f, -0.576964504105195f, -0.331030677719652f, 0.389178134459083f, 0.0714066784585938f, 0.915179137858455f, 0.529738860096996f, -0.0851681338619263f, -0.692212896293625f, 0.0786352959300358f, -0.122712774017974f, -0.154641019547052f, -0.487537192251297f, 0.0435645872670241f, 0.856938631597551f, 0.351874085305670f, 0.708100804109985f, -0.701200509799317f, 0.0804479422214388f, -0.0794375302823220f, 0.543751723132725f, 0.346144383452864f, -0.680373368944156f, -0.572281173045994f, 0.237981706511708f, 0.0671482960376590f, 0.852393956008547f, -0.301262907769845f, 0.523762878044853f, 0.0885512158718469f, 0.885168455552951f, -0.333351382431635f, -0.914187358461713f, 0.657220242471575f, 0.202238670865175f, -0.660684692864216f, 0.641271628674064f, 0.795923699912913f, -0.332641448887164f, -0.297595219329770f, 0.427283618553541f, 0.601893958036382f, 0.355248259075043f, -0.420766820174961f, 0.355159952778514f, -0.806733697216087f, -0.694403711049608f, -0.719250654428532f, 0.580487742419744f, 0.959156165420351f, -0.941898541689400f, 0.960568821753178f, 0.119007749103819f, -0.973468502734443f, -0.627534816021182f, 0.331394418445345f, -0.415230278112412f, 0.225355270950915f, -0.216818510922154f, 0.716553646689289f, 0.149097723527982f, -0.212491921692561f, 0.681645638056938f, 0.675358683729395f, 0.0591550775861416f, -0.221626142364110f, -0.235878877821190f, 0.168188057112471f, -0.709738432254387f, 0.842890391064944f, -0.331175752377862f, 0.231375360302226f, -0.714989093452242f, -0.492645353426504f, 0.552424848261518f, -0.436987392663331f, -0.336155191719795f, 0.137666231065822f, 0.739347397348610f, 0.493222787180627f, 0.283646543313800f, -0.603522923409923f, -0.474181275984451f, 0.249315354427624f, 0.323736714335287f, 0.933612934150728f, -0.651555022796413f, -0.743229221575077f, -0.648309364385349f, 0.115117716036212f, -0.0689988553878600f, 0.0394979772968704f, 0.732729774997258f, 0.487584669162102f, 0.808754952095239f, 0.827617962775983f, 0.550826738558347f, 0.890858298785235f, 0.152998196795770f, 0.401198245071198f, 0.187173931669199f, 0.576387011979054f, -0.464903903379260f, 0.735172244343599f, -0.0393734341215035f, -0.501927105416023f, -0.852926247859480f, 0.384774001880198f, 0.723957370923565f, 0.869614310250896f, 0.698124990202440f, -0.0618370378422302f, -0.273879540781302f, -0.0745005910544518f, -0.754408143155094f, -0.859084370639359f, -0.709011936778905f, -0.883595552533659f, 0.326386065122049f, 0.756686513420982f, -0.639817612043620f, -0.536531544653662f, -0.596858657734988f, -0.187117983404806f, 0.760208405412209f, 0.191383034225783f, -0.771443976174702f, -0.371171018178012f, 0.723338724416329f, -0.325113980261468f, -0.652823731845602f, -0.902765567501679f, -0.109945188610355,
0.863727536109734f, 0.762531987550249f, 0.484671237555863f, -0.376731181566557f, -0.961176245257487f, 0.374503763045540f, -0.275274129954644f, 0.947951135663002f, 0.891610575724484f, 0.233179187366345f, 0.868694446846928f, -0.201812205484274f, -0.676342903796604f, 0.962133604967067f, 0.0941637112283598f, -0.0856261317646829f, 0.375061189807232f, -0.275342940020193f, 0.0614298144531287f, -0.183234253182376f, 0.146964792162229f, -0.307180215012337f, -0.139123531176191f, 0.130840221889238f, -0.0654726742084248f, 0.988722897887987f, -0.805684911622576f, 0.763299463922693f, 0.148136188784880f, -0.432183160161832f, -0.592185939638987f, -0.593835208842770f, -0.366135084813261f, 0.840566739882685f, 0.572052978307971f, -0.825682529425410f, -0.970222226210689f, -0.554421263584439f, 0.324648156825255f, 0.0472246837302466f, 0.168098848238140f, 0.00634984653176796f, 0.850237261066903f, 0.286624344510407f, 0.196043215794080f, 0.289161416244007f, 0.334801090322515f, 0.871286740072183f, -0.754609531300255f, 0.623871003889383f, 0.0843430009639772f, -0.736369938040848f, 0.400507674511444f, 0.816325383600297f, -0.500667496861800f, 0.453092855162135f, 0.281798170796444f, 0.631969623501011f, 0.472467114651372f, 0.525988741184527f, -0.124862967293674f, -0.882904489381606f, -0.501090007558747f, 0.631622297793485f, -0.0234210285578584f, -0.521093811962915f, -0.0402368492672573f, -0.762999364505356f, 0.948716268452360f, -0.572740830308272f, -0.261042904339051f, -0.506108365537530f, 0.585933508412429f, -0.362463094458446f, -0.885375028242576f, -0.835757117571791f, 0.337250829139564f, 0.298618238243588f, -0.744903291826588f, -0.979848674056393f, -0.488518944548476f, -0.000297116577397283f, -0.137863396173336f, -0.627207234158244f, -0.970417810284170f, -0.601487862773028f, -0.999527775716382f, 0.116672274325216f, -0.786330829714504f, 0.740118245374718f, 0.856485463622646f, -0.555144930193560f, -0.0168912375666686f, -0.774544329159697f, -0.782767315598991f, -0.600844843420598f, 0.885816107471180f, 0.577075799078571f, 0.663829997048111f, -0.359000184287277f, -0.390009578642891f, 0.202240602818017f, -0.0191477232064394f, -0.566459499064884f, 0.288883557382261f, 0.962583478738218f, 0.782123756762393f, -0.312311582870785f, -0.749354208187204f, 0.205679267602357f, 0.804004517387718f, -0.733078779233144f, -0.426195645938973f, 0.686872484317089f, -0.398704803137823f, -0.267786412313359f, -0.374306263341615f, 0.632992513422251f, -0.972217744254910f, -0.167080739523409f, 0.608176739669718f, -0.935550125875275f, -0.422451600932096f, 0.499643952974426f, -0.491034978653149f, -0.0256130378373849f, -0.158669355267388f, 0.360503946885584f, 0.227714934784132f, -0.138648043280479f, -0.0707461296301128f, 0.0638330442765616f, -0.168811643868974f, -0.575670642767690f, -0.162143785491822f, 0.528621079903453f, 0.581283330394272f, 0.444430744183000f, 0.859288341846780f, -0.170487584890459f, -0.440175706710406f, -0.184806402672108f, 0.676010805169568f, -0.0117535553470483f, -0.231606756742133f, -0.210042044569361f, -0.517950708003565f, -0.805772781723687f, 0.156938933772370f, 0.892075905739393f, 0.403874478002384f, 0.572031508558373f, -0.604145909072008f, -0.330076696654475f, 0.0314560087228033f, 0.683787496948704f, -0.788582181996934f, 0.835276281386949f, -0.0644658492206380f, 0.938270191882745f, -0.344927907293928f, -0.976720519493346f, 0.906264084343827f, -0.648152742145255f, -0.776984965421811f, -0.299470572593974f, -0.423690646950321f, 0.749911693814570f, -0.701929894551648f, -0.665191316321370f, -0.568359320650352f, -0.957309362369509f, 0.914088966355983f, 0.770952996203681f, 0.0924190787439159f, 0.844599990803978f, -0.613336716591875f, -0.683270165308367f, 0.358563204319583f, 0.934597169812267f, 0.236596595813630f, -0.895964332479994f, -0.673302324943916f, 0.454883302340070f, -0.473926010524343f, -0.576000657136217f, -0.644850950007290f, -0.980218836434995f, 0.321620362364719f, -0.799924718666919f, 0.0619872524925393f, -0.609255645268410f, 0.159243124858648f, -0.339764623434603f, 0.379865023026277f, -0.923132229333074f, -0.0300494021321296f, -0.183835365297645f, 0.122648511393234f, 0.887652015676064f, -0.616448517838488f, -0.920600866006207f, 0.352861591267815f, -0.930578364778234f, -0.378819076263050f, 0.775423778544869f, 0.836977798656885f, 0.0472244767469148f, 0.484934339557912f, -0.939155187409193f, 0.261555270800537f, 0.143595058480400f, -0.323517719771947f, 0.483466454684928f, -0.423163689969697f, 0.356966814701025f, -0.843907304366205f, 0.945903563730962f, -0.495952298317153f, 0.972277051575873f, 0.153052037173145f, -0.715894882755676f, -0.617028915483254f, -0.332307224095366f, -0.171207102890728f, 0.841771328272651f, -0.0308707743261867f, -0.626480028747696f, -0.729235538916864f, -0.743517330301179f, -0.733868915239511f, -0.449192858200231f, 0.362286468575150f, 0.327436676142902f, 0.609768663831898f, -0.147499187968100f, -0.470195300907973f, -0.232167856443943f, 0.225074905574485f, -0.0818541072414634f, 0.793403933843056f, 0.267628199755028f, -0.391701371806294f, -0.846991992740029f, -0.776221590294324f, 0.121351482320532f, -0.189789365942677f, -0.894392208695015f, -0.632864319945356f, 0.927817761109627f, -0.732454610273421f, 0.260011686544283f, -0.713973491605344f, 0.469764032416604f, -0.608895265807545f, -0.684992974060601f, -0.745556289276139f, -0.536308213076133f, 0.586581187207818f, 0.149804345860779f, 0.401576742698496f, -0.719670291046630f, 0.618659855530024f, -0.256639783379370f, -0.862966031725668f, 0.893866512913152f, 0.861800793529066f, -0.704895723095590f, 0.154163397540805f, -0.0775797186536984f, -0.252297335448882f, 0.869851864160888f, 0.428747373815147f, -0.818372805928921f, -0.739117647833389f, -0.697378012429133f, 0.182997863108567f, 0.689563104159966f, -0.0506114067037338f, -0.705077813920782f, 0.452892458862023f, -0.365069844049503f, -0.889224821648518f, 0.0194889225677406f, 0.847743515500726f, -0.0650338075825718f, -0.108889937983496f, -0.168485037502421f, 0.912533003086865f, 0.428132366084106f, 0.692652998111620f, 0.130599999674344f, 0.411245435867244f, -0.194909473459497f, 0.562152151569866f, 0.503795293326445f, 0.801805532943245f, 0.795718119772331f, -0.327975015537058f, 0.771389506217327f, 0.237139782375987f, -0.793798852884360f, 0.537824655594807f, -0.0767253125021830f, 0.444538451472890f, 0.623473048970629f, -0.500663871860675f, -0.890399840538612f, 0.389528755348857f, -0.915832255765501f, 0.000652855725217894f, -0.121310443088642f, 0.206662014558968f, -0.409513641801496f, -0.0496262665388731f, -0.313314447256644f, -0.994839397423865f, 0.344513198428247f, 0.250828855150578f, 0.845438302422055f, -0.728803841305459f, 0.249670562418639f, 0.543601559270672f, 0.0138774767713057f, -0.0667600054234216f, -0.803421294778238f, -0.222729734665659f, 0.461896933387103f, -0.378537171475208f, -0.464200027877777f, -0.363170335357481f, 0.616070694104851f, -0.316407896795124f, 0.131719997218670f, 0.0622146037260092f, -0.881713850066484f, 0.400811652868418f, 0.163777537634682f, -0.528768052383715f, 0.553072310703894f, 0.931393033749660f, 0.410062835546529f, -0.190904471223264f, 0.0533617852685424f, -0.911780226731855f, 0.823696403963215f, 0.756735978125573f, -0.849701310148249f, 0.106070214350541f, 0.747890454578944f, -0.559823302095172f, 0.976181619002882f, 0.506524051225122f, -0.0735228576098872f, 0.635610640336510f, 0.607728217052133f, -0.383443012662118f, -0.640835123345673f, 0.0897243696426577f, 0.722421963278953f, -0.368833835044170f, 0.684790387373836f, -0.0336846755494535f, 0.199819176553169f, 0.351822803019512f, -0.433387005248570f, 0.709401898386598f, -0.0149217994364210f, -0.549115733466769f, -0.774049259429836f, 0.440376751789406f, 0.740171176715015f, -0.322301969056869f, -0.148261856544327f, 0.724527166150266f, -0.744178178219827f, -0.743031462890542f, -0.00997727490160383f, 0.550074849063942f, 0.147825200269716f, 0.777182602759074f, -0.625412073440604f, -0.0614214671235789f, -0.400121310797195f, 0.864511820640236f, 0.327656445569618f, 0.765838911283705f, -0.906185069285438f, 0.543656228031101f, -0.527337383463707f, 0.544932532036177f, 0.453966596910417f, -0.422906847383216f, 0.803455668330395f, 0.496651297123425f, -0.254890927444284f, -0.940902660088963f, -0.0691448074129200f, 0.0165534278793877f, 0.510199004798987f, -0.0286331020627788f, -0.141471298460923f, 0.872000980716430f, -0.752995088893842f, 0.167696515625982f, -0.181673581299286f, 0.496236252387172f, 0.854022562040503f, 0.388320660177419f, 0.499320363074588f, 0.173522726183149f, 0.0334192536945390f, 0.631347719906229f, -0.832803059709609f, -0.523826088751894f, 0.322557683663180f, 0.0263621365506006f, 0.948982322858062f, -0.253991680115490f, -0.165970359640120f, 0.331700483099733f, 0.808731855823033f, 0.159862831431822f, -0.438178259673022f, -0.943749594272300f, -0.967819867274861f, 0.263403865531262f, 0.710981741513574f, -0.274597382335371f, 0.929606564147885f, 0.125943272920181f, 0.691306164809532f, -0.607946869004681f, 0.284352421048012f, -0.421663515398071f, -0.409479725854699f, -0.152265311389352f, 0.630868673855242f, 0.123144840061153f, -0.645105689918733f, 0.360153393247973f, 0.683885744053582f, 0.752598814717991f, -0.581494857182821f, -0.469116962448560f, -0.0691726199196117f, 0.174679188611332f, 0.351269328558955f, 0.394815335607621f, 0.710281940645013f, -0.618593505217632f, -0.721546422551907f, -0.974088703589852f, 0.939556772536401f, 0.599407011070674f, -0.342213391542906f, -0.387135346574836f, -0.572027944718123f, -0.622717582512866f, -0.676949872287677f, 0.993953153886700f, -0.784539234625462f, 0.788778188174951f, -0.0652679971583152f, -0.988740647590182f, 0.748989697777310f, 0.412949190397683f, 0.206661198525718f, 0.573116044772809f, 0.938498079842984f, 0.743167714677278f, 0.755679122637903f, -0.295095987460132f, 0.217166189740252f, 0.230160404687938f, -0.504654557405015f, 0.472402206737240f, -0.867751757044285f, 0.869050101160567f, -0.905285205825199f, -0.0698843699947245f, 0.762379282963140f, 0.634191197174691f, -0.498487028811837f, -0.284257632541078f, 0.224245853978976f, 0.412950901773606f, -0.831984679101472f, -0.375663639002356f, 0.153699995838016f, -0.953997055484851f, -0.545360745186449f, 0.637687001020610f, 0.465459355638311f, 0.0769011654935299f, 0.267123343048604f, 0.545842501706277f, 0.778890986545214f, -0.363432183057524f, 0.479786652022207,
-0.600912698239979f, -0.738845504293020f, -0.775987143750184f, -0.705559714187038f, -0.310523750352236f, -0.576081829930414f, -0.0341897834633795f, -0.388414434291246f, -0.790681299048144f, -0.169440674711419f, 0.219815472280053f, -0.323451599202462f, 0.835623141427806f, -0.932446301638351f, -0.831480966559550f, -0.185050128422203f, 0.946045240208487f, 0.864740749402213f, 0.916918979039328f, -0.204049261822351f, -0.807183358636872f, -0.484543897885746f, 0.974235382435000f, -0.208019257024664f, 0.647411336652954f, 0.0961385231960816f, -0.800258527388060f, 0.352982142334643f, 0.917274278881503f, -0.733934252997685f, -0.229420044045673f, -0.358499183112933f, 0.469156578609832f, -0.859359096702447f, -0.937762141277625f, 0.389776419837803f, 0.458425599271073f, 0.542973137971009f, 0.675023236195573f, 0.944029213696263f, -0.774027667733194f, 0.262984845114612f, 0.842689106929982f, 0.349251854560315f, 0.815938991679117f, -0.226283690374971f, 0.144356327986477f, -0.610588223452142f, 0.539695204296007f, 0.655759463021729f, -0.725805170479948f, -0.194977831685847f, -0.306105075607822f, 0.725461617920836f, 0.678283785172857f, 0.250577882812283f, -0.571672652704059f, 0.112132856850530f, -0.236412229648694f, 0.768173015701816f, -0.799251028098975f, 0.100723381526471f, 0.113856811781171f, -0.0281630563735495f, -0.0727902548617043f, -0.515248547261805f, 0.795765010992038f, 0.505540143557856f, -0.496124371632015f, -0.363010091302494f, -0.302067159683438f, 0.941309812688142f, 0.0564765277142674f, 0.733027295879568f, 0.582734217224559f, -0.159007222603058f, 0.827637470837748f, -0.163060519537145f, 0.352357500273427f, 0.920405360379926f, -0.280691553157313f, -0.401974149240862f, -0.131353114797667f, 0.0719728276882135f, 0.795795661384902f, -0.348203323368113f, 0.946184663961743f, -0.188400643814906f, 0.979319203447783f, -0.132195434304746f, 0.585832597473452f, -0.894730397941282f, -0.998045985412111f, -0.717844040997160f, -0.706372640246558f, 0.237517748136224f, 0.767232946579208f, -0.246080656591091f, -0.767887803661775f, 0.139501344992184f, -0.545658806327887f, 0.480755550666584f, -0.355750609145607f, -0.493518864013929f, 0.832011102158605f, 0.122542855024589f, 0.179356501845966f, 0.630805165349165f, -0.888557403477561f, 0.861375782261841f, 0.963467658712489f, -0.00498707715217361f, 0.341894517453263f, 0.654808049991043f, -0.826909952854692f, 0.101446328788119f, 0.401514152845232f, -0.830556985096328f, 0.832187560444347f, -0.657254039822149f, 0.0304197382717133f, -0.718462386339415f, -0.592343549551534f, -0.356333235896531f, 0.674135547073730f, 0.606490641440102f, -0.707328770155748f, 0.0251846271186025f, 0.763024927861424f, -0.258224600040528f, 0.456384203436896f, 0.626482995304888f, 0.162353458245830f, 0.964280614412026f, 0.869262296229816f, -0.0659501568862260f, -0.712869755397848f, -0.946968242335746f, -0.852822740386429f, 0.791522782900379f, 0.824530390150335f, -0.369383609091590f, 0.118366422602132f, -0.713278848975255f, 0.549165545117801f, -0.00201102645336770f, 0.748955154405439f, -0.173689412898754f, 0.175162399203493f, 0.0819730422177463f, -0.804833155982895f, 0.972966530563786f, -0.0614871820303859f, -0.293463394754661f, 0.885919261783643f, 0.498531250561504f, -0.808874001349436f, 0.364344357769432f, -0.945616638616975f, -0.285864129675031f, -0.0438177789332626f, 0.303981486324719f, 0.362653007142366f, -0.543157427730716f, 0.174551703296805f, 0.140105048664068f, -0.704163993684247f, -0.647461975308389f, 0.831243960763754f, -0.364954329841192f, -0.730289885595360f, 0.0119708019435723f, 0.796338505809816f, -0.227851954967331f, -0.927330125804492f, 0.0602265250934577f, -0.485204061877453f, 0.198319346525046f, -0.529723177394882f, -0.321493822700232f, -0.839566193416413f, -0.187812484529161f, -0.396142329367383f, 0.367600156667632f, -0.922657847865138f, 0.893508892950972f, -0.504434314314017f, 0.663184814192863f, 0.887813887366393f, 0.267103483259066f, 0.984313142773772f, -0.667515321448428f, 0.0718416862496054f, -0.733363156570869f, 0.00186343206374962f, -0.316531364321301f, -0.467549697367438f, 0.569865535259013f, -0.556502178434536f, -0.650896672234238f, 0.564462797319346f, 0.585276582729153f, -0.433005641153548f, 0.847012427243871f, -0.462088105064984f, -0.379468633087939f, -0.0104892833799723f, 0.654191676584918f, -0.893278846859767f, -0.689350274835588f, -0.333220721049179f, -0.0461703436190983f, -0.463411501818667f, -0.995085073808794f, 0.526075522777196f, -0.0686703698159610f, -0.855908120278260f, -0.239774384006192f, -0.524142243888286f, 0.119526621106050f, -0.838266471869898f, -0.459366707886497f, -0.974921205300089f, -0.680517660007036f, 0.507695286553230f, 0.0920009889477380f, -0.674459855090400f, 0.554585280302756f, 0.357871391273056f, 0.453052004120624f, -0.991707675828263f, 0.144725488641274f, 0.0886535789688503f, 0.708257184179799f, 0.579351194763774f, 0.902098539548710f, 0.0104715251706708f, 0.112677648152527f, 0.0513772996762050f, -0.647561525299580f, 0.321958856072156f, -0.433510239079594f, -0.481493822802105f, 0.651663699618654f, 0.922649363108760f, -0.751799312011289f, -0.0336105332513619f, 0.236872038257485f, -0.0434863841224971f, 0.150810692021768f, -0.217629544451037f, 0.345890414626050f, -0.471941673338326f, 0.675001035054686f, -0.986585320322202f, -0.784679789758475f, 0.270727429189404f, 0.595792127677512f, -0.485969146811564f, 0.222507692419212f, -0.850070310429306f, -0.575184466843042f, -0.220860571657717f, -0.749449040845746f, 0.743039624335149f, 0.463892797640518f, 0.224829531690830f, 0.935410439714992f, 0.00609595972560872f, 0.830877831388658f, 0.0270299847557276f, -0.648763861115704f, 0.471982277585509f, -0.145722971031426f, 0.650947186397952f, -0.266164907037466f, -0.962378355156458f, 0.354855353373398f, -0.184127215272909f, -0.825621979621661f, 0.595495186093792f, 0.448679578752395f, -0.839671989567806f, 0.302158874138200f, -0.735484620769119f, -0.891040803749876f, 0.880298595525880f, -0.281199581528421f, 0.0195033020490396f, -0.511515485794419f, 0.447303195702203f, 0.375317547074287f, 0.964442757731427f, 0.167643569291013f, 0.0118587246816413f, 0.958187068873858f, 0.315395458761821f, 0.188852872643367f, 0.417450657662866f, -0.540566147670448f, -0.422709015019828f, 0.101425586029329f, -0.235465301656357f, -0.806044548641562f, -0.617153815671298f, 0.350658348898447f, -0.738540593521098f, 0.291893065415692f, 0.335435501842245f, 0.832048727909480f, -0.609539777284250f, -0.436992256701542f, -0.685315947977391f, -0.502107715051164f, -0.893460699283628f, -0.262263680492396f, 0.454417031133778f, 0.223227655510993f, 0.605288383003966f, -0.698800586984034f, 0.864843125666124f, 0.363752223710394f, -0.354571459375900f, -0.575008718239530f, 0.423061550052490f, -0.272459660313524f, -0.116932919064239f, 0.547073367599225f, -0.890822451422250f, -0.884262586749836f, -0.889803003239001f, 0.217660629852574f, 0.154863581361214f, -0.333284425759330f, -0.826087281020982f, -0.958198419703014f, 0.850114828540176f, -0.391190814837661f, 0.956578087128909f, 0.0541599967910713f, 0.0988550815990206f, 0.851903747125444f, 0.361959550717838f, -0.901818125706440f, -0.0561477675277424f, 0.522090821863134f, 0.263383912024089f, -0.161061362097086f, -0.983707460720128f, -0.333128836619106f, -0.546535222349413f, 0.627261888412583f, 0.408731616102241f, 0.754700916401496f, 0.869772826180715f, 0.362242883540519f, 0.853587698951791f, -0.698910717068557f, -0.671945256263701f, 0.802655941071284f, 0.338701009518668f, -0.0297818698247327f, -0.881311052338108f, -0.296717226328950f, -0.965699941652671f, -0.737164428831818f, 0.00804554422537485f, 0.989716933531351f, -0.832438692682457f, 0.454553001515962f, -0.933801685729775f, -0.644562445615081f, 0.104508389084640f, -0.535426180524709f, -0.937041822784313f, 0.599911275476691f, -0.789109397888652f, 0.821293320968620f, 0.818032308067912f, -0.838306491947354f, -0.172883985566904f, -0.185775969502745f, -0.672256019841514f, -0.412525056012874f, 0.142272136963196f, 0.792136721788200f, -0.726314486042219f, -0.445981475954073f, -0.857821372905156f, -0.783006950965519f, 0.438776336055643f, 0.400193156140386f, 0.177525578340235f, -0.435380642286229f, 0.547815754835977f, 0.0496394855194708f, -0.442174406426496f, -0.0856142956982360f, -0.0247840885457120f, -0.779016166389253f, -0.511802368745331f, 0.319887353303028f, 0.721806644023428f, 0.770423389111803f, 0.809969588377187f, -0.196191981856391f, -0.105718971622809f, -0.301674515042257f, 0.613622254387482f, -0.969517273103490f, 0.0144576310630131f, -0.668829420461301f, 0.750377960820232f, 0.696858494013122f, -0.563485511352760f, 0.726226115587466f, -0.227540741583116f, 0.665488592033944f, -0.124611809537824f, 0.489550286613580f, -0.579185308695604f, 0.628687311174276f, -0.295770837727116f, 0.240358361854250f, -0.155642183802961f, -0.885945841456110f, 0.388592282428421f, -0.663862196774143f, 0.363779469451472f, -0.371285870971327f, 0.563159689631810f, 0.102725415308920f, -0.320909176496511f, 0.334328794247963f, -0.401664407219370f, 0.726728495517480f, -0.192310060924823f, -0.107973316004269f, 0.898177814643418f, 0.456682306673978f, 0.890742303266606f, -0.742770990765425f, 0.0337493848747046f, 0.786190819119190f, 0.911503487800545f, 0.288384155888888f, -0.249479393879906f, -0.431949793185094f, -0.0847659302921913f, -0.475416985100444f, -0.362720571751962f, 0.676910741300893f, 0.00488530543559529f, -0.227678010632002f, -0.0632947771540859f, -0.990261099329279f, -0.708485805011827f, -0.304846597458441f, -0.480289782580152f, -0.593254971635338f, -0.656335976085053f, 0.584373334310954f, -0.493268395245234f, -0.00212668034894836f, -0.480221591678953f, 0.622365041709782f, -0.258845071515928f, 0.943825418665593f, -0.716642329101759f, -0.765317239111819f, 0.324487844009035f, 0.108158868464706f, -0.790583201992229f, -0.649218622127061f, 0.751409704126257f, 0.301455204388007f, 0.620482350165047f, 0.411016780608874f, -0.878843779367281f, -0.779673415191805f, 0.616508572699874f, 0.0750844738292273f, 0.341011338533919f, -0.553376665552953f, 0.277561087965059f, 0.527499935800293f, -0.489644680144407f, 0.514353996113782f, 0.229842524701725f, 0.139172928186734f, 0.793753206591897f, 0.835555341130211f, 0.794120687009671f, -0.0994745468343306f, 0.109098970584400f, 0.383123470993648f, 0.272549010931094f, 0.683070582699418f, 0.522823199313615f, 0.235903759158310,
-0.269490013000195f, -0.103775744391749f, -0.994083979953753f, 0.754983594207459f, 0.806308398378106f, -0.997543362839150f, -0.00396367603607373f, -0.873768378178592f, -0.755907732827809f, 0.703713206520365f, -0.0716773056166142f, 0.0792968663717508f, -0.113760825029016f, 0.828188140127672f, -0.103062543982628f, 0.0455017026983378f, 0.330658414568756f, -0.615810862221588f, 0.827890015477212f, -0.507551960954374f, -0.371044788092612f, 0.723489294741891f, 0.169072478802524f, 0.885612989356318f, -0.496475905980558f, 0.114400438991609f, 0.427961880327008f, -0.0456714004002505f, 0.0246660859589438f, 0.175616122301987f, -0.349777838484285f, -0.939474935533562f, -0.215061649130134f, 0.907049169335834f, -0.0553600192559760f, -0.982464152311714f, 0.405919915647442f, 0.755952405091542f, -0.695422520039876f, 0.373280568864688f, 0.483909023765611f, 0.784896384994620f, 0.978722132488262f, -0.113866140463085f, -0.630016943176703f, 0.512742627309861f, -0.829104067044703f, -0.240982431155520f, 0.0107361024967163f, -0.438682584788413f, 0.935730031472303f, -0.953447901200043f, -0.984218956474073f, -0.745077052885218f, -0.466232938128846f, 0.0326267564209573f, 0.303877586274065f, -0.199843777507458f, 0.674317529952029f, 0.448678903834397f, -0.681863209154081f, 0.273397524216090f, 0.193101955704959f, -0.342858479278718f, -0.485179713360910f, -0.586067050491890f, 0.393099777352274f, -0.982324485510343f, -0.852553426343700f, 0.773613825101220f, -0.590256032959421f, 0.837952413540589f, -0.643137731235821f, -0.311955662956384f, -0.888588599835619f, 0.304629859477166f, -0.810098957400030f, -0.534291626181040f, 0.878601703692302f, 0.362706441157764f, -0.254447668911795f, 0.604309282304246f, -0.977266419340276f, 0.250927873824064f, 0.549600558999971f, -0.796155833245480f, 0.226373301058549f, 0.0137578302483823f, 0.819708534464965f, 0.185662636424304f, -0.450456459548662f, 0.0953849597308440f, 0.736872088617975f, -0.582024306116842f, -0.0522261513001507f, 0.394348349710790f, -0.461023913227183f, 0.139996201153565f, -0.790168851966909f, 0.692544084408690f, -0.580603732841955f, -0.584540773580447f, -0.967062276813525f, -0.00886260208554912f, -0.0520831218167985f, -0.999614949922684f, -0.965820736077636f, 0.366390034326646f, 0.0323069925013668f, 0.164651515113853f, 0.300260003499445f, -0.340634856317630f, -0.238157231550037f, -0.291645957143165f, -0.773881882387456f, -0.144494053860223f, 0.660329619628580f, -0.626727996257997f, -0.994965090982706f, 0.161018019917379f, -0.327211572176153f, 0.0410991278573425f, 0.0123663905917732f, 0.747176159655312f, -0.485981637435718f, 0.00667961234248971f, 0.631625759154389f, -0.831294487064668f, 0.449606477050286f, 0.768845094514142f, 0.928354534843426f, 0.812647997969340f, 0.353418126917875f, -0.872184763557736f, -0.579130598386915f, -0.912928075675835f, -0.779484407508668f, 0.534916834944041f, 0.326353225230543f, 0.395431557674662f, -0.842103899863317f, 0.196590107332985f, -0.261317824893025f, 0.750190543523333f, -0.103409967857074f, -0.201452426430379f, -0.213633615009587f, 0.578822104214576f, -0.130809161238349f, -0.774608769872343f, -0.0222201705228122f, 0.126990738965544f, 0.785780586747108f, 0.0379484317527632f, 0.837140835706189f, -0.191007948387153f, 0.106781679021568f, 0.990298140861558f, 0.618337701073777f, 0.460255491901774f, 0.716379796730692f, -0.159421014009881f, -0.560212468621569f, -0.147263014783522f, -0.962301694075771f, -0.327702010262213f, -0.773959532468388f, 0.351239668535113f, -0.682281479449518f, 0.342188824054257f, -0.743039216419066f, 0.700710268270439f, 0.919651386092770f, 0.626343233048871f, -0.157189576636596f, 0.781882574006976f, 0.349953565654219f, 0.361235312853466f, 0.313242228422046f, 0.582185182102266f, 0.554504358491139f, 0.711217954194576f, 0.332473377627418f, 0.165078226255772f, -0.228349029389292f, 0.899730713958153f, 0.653894503448836f, -0.0452904440925501f, 0.0328806142413372f, 0.793701315832839f, -0.703826261467540f, -0.901648894320192f, -0.195631966969018f, -0.0470590812056508f, 0.487185699934959f, 0.175961644103331f, 0.818028721319245f, -0.224389104974946f, 0.901974203693823f, -0.153212477843726f, -0.472747796173897f, -0.587471692952684f, 0.452340198339707f, 0.996443894349412f, -0.849126217374502f, -0.403800337277983f, 0.923427876645159f, -0.0516037992113898f, -0.380335341989182f, -0.299914673109747f, 0.764492139190834f, 0.773463290027243f, 0.0175454601261817f, -0.400742340353541f, 0.912354892189422f, 0.999766609328281f, -0.521321752061712f, -0.365769506846305f, 0.477612405338644f, -0.0522578739905535f, -0.479259238587280f, 0.645161410912429f, -0.702546085166056f, 0.359736398041538f, 0.638130894056863f, 0.115633419893101f, -0.674410360620500f, -0.150824943737990f, -0.824854463897591f, -0.504410162129685f, 0.560317574021813f, -0.159611666752889f, 0.997647540626334f, 0.702777895178414f, -0.946494281691535f, -0.0109619562916898f, -0.383756482005404f, 0.872670066971334f, -0.453527506439184f, -0.635719199113957f, 0.932852122005178f, -0.800755479140234f, -0.225213334363716f, 0.251163542389519f, -0.598147625383133f, -0.155241293946661f, 0.967736510890644f, -0.0157250628103103f, 0.250570924071858f, 0.209749651169078f, -0.381016062687537f, -0.679300447230592f, 0.160197663113971f, -0.749803147200800f, 0.596917045783617f, -0.0878737681749431f, 0.642402180339789f, 0.261614973684270f, -0.111833224093973f, 0.300170844971678f, 0.317966800167647f, 0.0585375534708252f, -0.842709435910728f, 0.760207701069839f, -0.979366191145221f, 0.940703569377911f, 0.866488078693979f, 0.553497107695259f, 0.127260247084497f, 0.530106152060111f, 0.725171359852920f, 0.356742729430045f, -0.209841680046178f, -0.164239817187855f, -0.888858150931758f, 0.0367561852378047f, 0.803496113779956f, -0.594927045375575f, -0.00347281985657166f, 0.114118941713783f, -0.427864462568672f, 0.719021423892768f, 0.335845790828654f, 0.0207216235296064f, -0.523146933862102f, -0.145001077781793f, 0.490566784879983f, 0.461904660734682f, -0.897010089735077f, -0.895737903861849f, 0.343397505472310f, -0.684377591381862f, -0.0154016881290400f, -0.462987614871549f, 0.884045010701589f, 0.192617174725234f, 0.226497290324550f, -0.788151335932529f, -0.190538526746651f, -0.556614046330326f, -0.139480186854974f, 0.196785300148418f, 0.978844132512627f, -0.290726060479808f, -0.591813978495167f, -0.0769033757443105f, -0.467044929381376f, 0.171585053083057f, 0.408215527269010f, -0.818706013465989f, -0.328144984930982f, 0.790275356337217f, -0.977491163139178f, -0.979679268318504f, -0.524875121608236f, -0.263859024168277f, 0.0180787743488171f, -0.984390626106750f, 0.952274619010224f, -0.851400664579601f, 0.692959439369046f, -0.150312001943653f, 0.712066554169562f, -0.492336226254660f, -0.453559897031351f, -0.159679763180474f, 0.745834647687870f, -0.725963425297178f, -0.720341794596050f, 0.370674334928492f, -0.845974926208293f, -0.00448769398027360f, -0.595973105115042f, 0.967372249596385f, 0.512949503724102f, 0.889619262804735f, 0.990718232652913f, -0.662246751886904f, 0.333846293708563f, -0.423114421367372f, 0.549637439543149f, -0.987876053136374f, -0.782714958794276f, 0.294868983681807f, 0.931284560597614f, 0.445522387300861f, -0.388400162488578f, -0.182673246109423f, -0.773488958971573f, 0.438788569593725f, 0.578106509978236f, -0.373449127435319f, -0.301996528814967f, -0.227124771031239f, 0.700176189695036f, -0.910948938567526f, 0.733412403327578f, 0.486154072292544f, -0.974058632864456f, 0.216693355653246f, 0.147564301397678f, -0.715192277853558f, -0.366996833259925f, 0.568909126406069f, -0.0810069456450131f, -0.371253841044151f, 0.254736918036059f, -0.868966383080701f, 0.190312518076662f, 0.457253801337437f, 0.941043431633233f, -0.297470749600241f, 0.244270515950156f, -0.240122562119888f, -0.766384662307300f, 0.765045432900429f, -0.608250739173787f, -0.733052557932594f, -0.268433000443065f, 0.733598123424154f, -0.0550005774741753f, 0.273893221740822f, -0.659641650983149f, 0.967032725204337f, 0.390126626361090f, 0.518740746381756f, -0.859387560527806f, 0.554117289841284f, 0.648904904654236f, -0.755880975555381f, 0.834231592524942f, -0.137512395743275f, 0.0477027353535724f, -0.880364563062979f, 0.458763614093086f, 0.650036413308116f, 0.496385905878033f, -0.418537115548864f, -0.565561960782851f, -0.227941684691245f, -0.165031891659812f, 0.204464989908300f, -0.688093624763916f, -0.678874848552394f, 0.813764873880514f, -0.561723359541237f, -0.575805702297063f, -0.288097000970518f, 0.950119107184838f, 0.709879842972902f, 0.730067219897393f, 0.710813066057284f, -0.192333836978130f, -0.190446300563246f, 0.872679304648751f, 0.134143163657763f, -0.979443835407234f, -0.103872104041761f, -0.0568328979324004f, -0.863020133862081f, -0.0257801722427251f, -0.577962771617033f, -0.0500056799801032f, 0.191817418291914f, -0.799853775410853f, -0.110019424741421f, 0.840753817223395f, 0.355588322976119f, 0.274501278628024f, 0.757538306972136f, 0.771547320156202f, 0.0394143752709530f, 0.120744072764658f, 0.324337882930581f, -0.380086709776951f, -0.772025774284869f, 0.473986846199588f, 0.703247561676381f, 0.734667480205300f, -0.594290184210087f, 0.760158653782445f, 0.624553744314883f, -0.941053266957965f, -0.165913770936962f, -0.0497972870738055f, -0.0435608680908517f, -0.663165366083943f, -0.570972482385751f, 0.427845034528880f, 0.0897903148165149f, -0.481825010950428f, -0.0901127105939594f, 0.887770435656611f, 0.770985476674623f, 0.00966158758316293f, -0.331059327378268f, -0.286033645163736f, -0.0698945910210471f, 0.834392309773299f, 0.875537383319608f, -0.657919190548359f, 0.583890957562885f, -0.418481077359384f, -0.282242397022386f, 0.864577023994874f, -0.898367126143440f, 0.815804441243808f, 0.616061408588373f, 0.132365642864798f, -0.221099752471970f, -0.852722283680675f, -0.269499596712950f, 0.360828136129415f, -0.120022743070141f, -0.0354652134632905f, -0.718389836602256f, 0.973490047219112f, -0.201775047168341f, 0.348769511760972f, -0.338750368577880f, -0.269769414088757f, 0.498910931428472f, -0.787648791515347f, 0.508408064858444f, -0.904215976374529f, -0.778575029821227f, -0.662889546847757f, -0.787503064261069f, -0.915166838630178f, -0.415784802770356f, 0.731806835017609f, -0.903922155472207f, 0.0872811033112211f, -0.452516774501827f, 0.577942533813694f, -0.200909337658770f, 0.866167939661793f, 0.982552542055944f, -0.332277333696961f, 0.201673960342839,
0.881239812364993f, -0.0293753746942893f, 0.0967170348490725f, -0.765573023404242f, -0.179225339525953f, -0.931530757069740f, -0.702596334762137f, 0.439106079307245f, -0.469364154277323f, 0.211063395888038f, -0.245858633045693f, 0.936376071219385f, 0.0334087380010875f, 0.0765265939183459f, 0.417091701258078f, 0.962467059286170f, -0.180698008768999f, -0.129816441691123f, -0.833694435146788f, -0.800582099046532f, 0.736376297618233f, 0.0164704176688124f, 0.207462305741760f, 0.300555292898496f, 0.777154212278295f, -0.0804533056660695f, -0.279940128908185f, 0.203101811030871f, 0.447496959357837f, 0.508353359025257f, 0.644333822521829f, 0.897259297488483f, -0.675785952117501f, 0.149337263319588f, 0.350953290584184f, 0.600296681944338f, -0.606098182955297f, -0.418312129297725f, 0.792551232171214f, -0.944025948110651f, -0.923106441737020f, 0.508989820072736f, 0.101554011154237f, -0.799369609980037f, -0.229001813644938f, 0.196367996268564f, -0.634078446275840f, 0.267446716753553f, 0.943765754688567f, 0.329924442019441f, -0.898235312442524f, 0.563592978494850f, -0.976934293161001f, -0.609744819901837f, 0.498989633313589f, -0.105680058480959f, -0.400730747241191f, 0.264919109340783f, -0.313066735594123f, -0.465399967597728f, -0.425123918113080f, -0.609514085808810f, 0.916560800692384f, 0.0173757138934230f, 0.147814399202503f, 0.594152503614559f, -0.145681097751433f, -0.427232299718493f, 0.233460382614713f, 0.337361272635241f, 0.376106438004541f, 0.900277274651600f, 0.424547631957395f, -0.710790444715071f, 0.0846761090154495f, -0.0122707338404220f, 0.119989812955904f, -0.239774389963524f, -0.692300891031819f, -0.735109129583214f, 0.802276300301071f, 0.348982047806247f, 0.916302084278941f, -0.0838164783829127f, -0.989134997097880f, 0.832909602224562f, -0.701363449605445f, -0.150487976031971f, -0.728594035984111f, -0.144393031996783f, -0.458856761770637f, 0.733295441303064f, -0.405608670768629f, 0.522871610912813f, 0.468223399458939f, -0.575139530810903f, -0.241684287862418f, -0.499140599234906f, -0.395586476697394f, 0.692745485195348f, -0.125142235859546f, -0.342212246193052f, 0.133841188490164f, -0.539478395228865f, -0.887973984329817f, -0.474033882236453f, -0.837114132429830f, 0.773392302912611f, 0.117697651876253f, -0.461595011213406f, -0.528669601602068f, -0.957799577987062f, -0.468654423525192f, -0.0602288998398475f, 0.154553704272891f, -0.422854231304259f, -0.496136532114270f, -0.348154983723668f, 0.0576478341707483f, 0.542088962901856f, -0.0465812136931592f, -0.280128217727361f, -0.900695482510248f, 0.525110685457899f, -0.957266165874283f, 0.136490670826643f, -0.213221811269364f, 0.690040133288898f, 0.269408771473479f, -0.0488994830172422f, -0.837526616586426f, -0.289127052660601f, 0.149325279006459f, -0.694169700971401f, -0.0230547571616897f, -0.368313297034846f, 0.344434270521740f, 0.859135365902404f, 0.839336654691204f, -0.511783987355355f, -0.0349625753049687f, 0.935857929664427f, 0.820032045433520f, -0.0394079346656324f, -0.656352913407746f, -0.874383371678169f, -0.425836335156061f, 0.208600154889275f, -0.135596548598733f, 0.566430757256762f, 0.820840891306264f, 0.735746624790780f, -0.765482927015804f, -0.0195537720748045f, 0.606216172027628f, 0.436027839798869f, -0.609233580289002f, -0.963547951222316f, -0.575271468261977f, 0.692873344771925f, 0.143031668657597f, 0.890157114774225f, 0.762299295692265f, 0.653618249618643f, -0.957258626549595f, 0.521895225378123f, -0.607922211531407f, -0.956795748110572f, 0.477633684273092f, 0.794301967670603f, 0.139753218894595f, 0.371726372555490f, -0.804791987531745f, 0.837080126047059f, -0.440992020192054f, 0.584986017638085f, 0.950442046050057f, 0.613109120495913f, 0.633948971396891f, -0.581246845000116f, 0.730290176291093f, 0.599119212595240f, 0.120096101936515f, -0.144169383323758f, 0.930776406826440f, -0.0209712926465206f, 0.572995665695966f, 0.924623298379120f, -0.751832867985678f, 0.630196806059302f, 0.506634179395662f, 0.0388997263873157f, -0.311041196366299f, -0.729049093325017f, -0.918815504666740f, -0.103935429478766f, -0.000623544124330300f, 0.102880227280474f, -0.563637096166535f, -0.332148269587814f, 0.472114131256244f, 0.295717126494164f, 0.246944592105312f, -0.713191555660498f, 0.160410320426559f, 0.110992936470077f, 0.213877527744528f, 0.541660996543375f, -0.872405734998843f, 0.388515073094269f, -0.840811647524440f, -0.968008592072007f, 0.669947948420772f, -0.122943215855172f, 0.565929115911552f, -0.695408966310186f, 0.361296950635219f, 0.574282481983669f, 0.0877180513263536f, -0.694316083550519f, 0.327696487191071f, 0.289746985823208f, -0.241476327174879f, 0.605084742574250f, 0.0929272338220821f, -0.391399761658219f, -0.612928183827531f, 0.0471987261466311f, 0.157388702609590f, 0.575695018001234f, 0.450453491026024f, 0.876623108212541f, -0.456500163180038f, 0.436901006801809f, 0.796734433864345f, 0.771008396172517f, -0.784740610155705f, 0.405172719255834f, 0.958393667559228f, 0.787380105147761f, -0.262826016234054f, 0.773327117333271f, 0.482142068916266f, -0.461607549022954f, -0.153993688218026f, -0.129280134980317f, 0.901812622560630f, -0.111520793491644f, -0.0973214524989203f, -0.293695817178366f, -0.190045093887485f, -0.204792515844396f, 0.501086384719391f, 0.755953359112033f, -0.425886872154604f, -0.0883029298084141f, 0.763071371252921f, -0.556289447935984f, 0.577370462369201f, 0.0480599614417476f, -0.794423686623353f, 0.756645959967545f, 0.570538730848462f, 0.872575422156333f, -0.443572567528656f, -0.0487937634747691f, 0.283986553648095f, -0.170910821134099f, -0.329867000423004f, -0.982322841409943f, 0.555344201026651f, -0.351964643393940f, 0.776172688776518f, -0.148102477734717f, 0.889532618676503f, -0.310979434517253f, 0.711839903052208f, -0.646385596147085f, 0.145592596381502f, 0.233949589173221f, -0.825471565980294f, -0.370248763132654f, -0.777194557275684f, -0.224658064754195f, 0.263281286751478f, 0.849661910468068f, 0.271261490445121f, -0.915885420717958f, -0.947144520818678f, 0.227960459606299f, 0.784463828083640f, 0.995882406349565f, -0.987273766396493f, 0.0792453274840108f, -0.788403526960056f, -0.619975942121645f, 0.801181796307713f, 0.967884377026145f, -0.781223064263388f, -0.300716486479280f, 0.994748932974184f, -0.200152360574411f, -0.101898131541608f, 0.542914585925881f, 0.407729967031792f, -0.105215843903154f, 0.638066037611924f, -0.563777780161298f, 0.134189395993685f, -0.503320561486155f, -0.0379170306314711f, 0.723638115686875f, 0.747948383928228f, 0.928239905995551f, -0.736883772878758f, 0.892242913709735f, 0.468998243295705f, -0.224406388545097f, 0.758754382878863f, 0.994739001052496f, -0.749837906573089f, -0.938777322178786f, -0.619168635741936f, 0.827875717654585f, 0.294033159230782f, -0.372766318349126f, -0.292752124932124f, 0.396629951868878f, -0.986760927173237f, -0.0841834195975009f, 0.999760803826313f, 0.0142305924173638f, -0.820393900206961f, 0.409972278573230f, 0.227315924377402f, -0.641500351639361f, -0.470788010535406f, -0.486171076557593f, -0.758140688442947f, -0.971539708794928f, -0.949039718833189f, -0.146844988902767f, -0.0183627478820223f, 0.402918762093981f, 0.0620266698060286f, -0.182527786403967f, -0.374395326540229f, 0.566584207940253f, 0.879546558847970f, 0.853360173786566f, -0.515321950652696f, 0.511692631053674f, 0.342152084355850f, 0.374686420595610f, -0.794372980760555f, -0.648670375991101f, 0.761192158420166f, 0.223791993225057f, -0.342720055148453f, 0.965612513218950f, -0.796193009647904f, 0.215057114709867f, -0.0459498239576994f, 0.871047701509015f, 0.664672380241520f, -0.546301701630944f, -0.939910946986200f, -0.213195706858966f, 0.559543622118596f, -0.255844807516886f, 0.509576048776352f, -0.699005089750431f, -0.520317652140772f, -0.924306703712950f, -0.923814193467638f, 0.868401299001930f, -0.571229497763863f, 0.984740691690212f, -0.911782692220985f, -0.265295471266664f, 0.0479848731515942f, -0.195328058836883f, 0.758281465939343f, -0.418177229854869f, -0.263323557662932f, 0.0230762644115943f, 0.382605016442608f, -0.576209059863238f, -0.739785100410209f, 0.0956412509899256f, 0.0369702493097637f, 0.0738922616872486f, 0.589371657036664f, 0.548586250623500f, 0.996096574632666f, -0.574178408335425f, -0.827059309028347f, 0.600283403682961f, -0.0651062813338117f, 0.985857002071398f, 0.982700721670305f, 0.777628710286989f, -0.139415722014730f, 0.951156387462424f, 0.806391217144736f, 0.135433009714206f, 0.252388414319270f, 0.485541324740928f, 0.270688932431637f, 0.892850103229909f, 0.440168171407923f, 0.515384398158669f, 0.600884162546465f, 0.947986221531091f, 0.339440884303404f, 0.403857490690436f, -0.937015609644647f, 0.729529495316627f, -0.389601866986821f, -0.420712615666380f, -0.763003723744745f, -0.0619534667970105f, 0.486654476027536f, -0.943536854881494f, 0.471171699317719f, 0.996886209046820f, -0.945316270673373f, 0.230772742042993f, -0.621222111022648f, 0.838934157721328f, 0.124035987915113f, 0.737576768711407f, -0.217898078842006f, 0.0429859145211120f, 0.223685413947773f, 0.820073956039170f, -0.378381145423743f, -0.335672684173821f, 0.649791267584388f, -0.457253860252872f, -0.664776842833046f, 0.150429615666837f, 0.974812973893170f, 0.00119972362050369f, 0.140744912838368f, -0.252632269055503f, -0.124205752907507f, -0.383194456927254f, -0.356455432479067f, 0.0694989880525767f, 0.188230048541949f, -0.854592697407303f, -0.902559387772971f, 0.454054169179423f, 0.534684767654295f, 0.806837289706952f, 0.274203715752641f, -0.765433763984323f, 0.459365005291520f, -0.896797218412250f, 0.382900474341852f, 0.169400421233177f, -0.184111368111075f, 0.0323514487432812f, 0.621015577938758f, 0.139872518806323f, 0.480965263781330f, 0.0649386999855643f, 0.815365754221614f, 0.761990264098834f, -0.0927412249348933f, -0.580853742457387f, 0.211615321410605f, 0.165159968106305f, 0.305515629345863f, 0.725748395743965f, -0.667649812347274f, -0.621843189978885f, -0.939317191264789f, -0.197108718554958f, 0.902152006895939f, -0.889744652803018f, 0.667113256888905f, 0.929471703711725f, 0.660025836042506f, -0.0712223078913006f, 0.416152292126436f, -0.602223852277700f, -0.828462878627106f, -0.956915163338265f, 0.298196541541469f, -0.933863927954050f, -0.198745190221695f, 0.749101206471011f, -0.922366396086261f, 0.769953026855636f, 0.971459582749177f, -0.226637139032289f, -0.593509265485619f, -0.635649447577657,
-0.443127775644156f, 0.350464269654307f, 0.379979516655134f, 0.896282784801247f, 0.00871209446887344f, 0.401818712823609f, 0.815422566258939f, 0.215868289995843f, 0.682217845700443f, 0.508819667108007f, -0.988484263336122f, 0.216656890144568f, -0.185777888700071f, 0.522106353117928f, 0.894211314619113f, -0.779300881699217f, 0.137801937535128f, -0.818740955579722f, 0.637214461095055f, 0.187867696634722f, 0.184985729971243f, 0.315323389557324f, -0.0312525033775366f, 0.498559120407008f, 0.855778208118391f, 0.936851170962385f, -0.0524308158818188f, 0.257087262622978f, 0.816141818246927f, -0.147192803443011f, 0.194545158383538f, -0.655428449892669f, -0.650441844539509f, 0.536015423540886f, 0.0250060573607953f, -0.863380305825989f, 0.0605420782823460f, -0.963662464088496f, 0.689136717877590f, -0.929664162821947f, -0.327349437742288f, 0.713122240487331f, 0.765587094162777f, -0.314350325341316f, 0.409992519686522f, 0.753377832105546f, -0.756848529995586f, 0.760787899507869f, 0.512213162407276f, -0.674820237484644f, 0.560776719592082f, -0.874905891603855f, 0.925202682923872f, -0.907405002733482f, -0.575836335118172f, -0.248173888600965f, -0.187923239740639f, 0.230951002247789f, -0.540190666146588f, 0.390890663320481f, -0.705511708249712f, 0.0980457138183717f, 0.879979753648798f, -0.378326046226794f, -0.645363625221967f, 0.883365508962968f, 0.728720763588748f, -0.191571576393619f, -0.941989254130187f, 0.944312154950866f, -0.367184985473008f, -0.974124559264444f, -0.579946765132286f, 0.509825236656578f, 0.952047194261820f, -0.0955445631918663f, -0.00500764501201401f, -0.00111382665477655f, -0.0404281661495578f, -0.265706359102834f, 0.865881843285797f, -0.947915521623861f, -0.820337973623839f, 0.0843747524022067f, -0.948599514028391f, -0.464018526769358f, 0.600790429663803f, -0.0779017384430381f, 0.756949801920938f, -0.955436496929340f, -0.553346424499498f, -0.401256107066610f, 0.569624108543687f, 0.179455179577041f, -0.189386842296675f, -0.467166492259358f, 0.367644583467601f, -0.722338735126514f, 0.863903729827081f, 0.0631027352569811f, -0.982269235503679f, -0.837788470642698f, 0.421730643738386f, -0.671745211565315f, 0.858467932275763f, -0.745298219348761f, -0.659594977600028f, 0.403238381269873f, 0.951987904652099f, 0.228887404582426f, -0.331665752024408f, 0.794789885033899f, 0.669978127515269f, 0.977583870328654f, -0.346398989178462f, 0.692053246433782f, -0.159407706019695f, 0.710808563527500f, -0.555701359319642f, 0.625665798239905f, -0.711048329414687f, -0.672431532474912f, -0.474897384314332f, -0.196250611816064f, 0.902140605659856f, -0.459732035217428f, 0.651412290305649f, -0.686137550630920f, -0.803228611526547f, 0.371120664039117f, 0.289869860968561f, -0.720979161638185f, -0.0940498575417996f, 0.185025844935128f, 0.401524077274769f, 0.811721346556136f, 0.224659861626089f, 0.106438807548742f, -0.117458956991326f, -0.407361487623449f, 0.683891165426988f, -0.216582410631386f, 0.710644530504861f, 0.867797453793643f, 0.626683550176870f, 0.115061097783331f, 0.976742668387085f, 0.250700864990527f, 0.272723539841862f, 0.159923684669346f, 0.167713264013185f, -0.445764377935606f, -0.489538472614810f, 0.227880894824940f, 0.670702116476237f, 0.610361511284318f, 0.503801949624464f, -0.687816091694902f, -0.0413765153535617f, 0.155769004545734f, 0.921910233366689f, -0.467299226678025f, -0.991984541712805f, -0.527009262324220f, 0.248157897392517f, 0.661145853979517f, -0.975947426744844f, -0.242453990684693f, -0.277956284573619f, 0.162010437415540f, 0.889456199489152f, -0.171259539670729f, -0.0636124576727060f, 0.311318764402696f, -0.227771282875219f, -0.567702050585727f, -0.132881625149059f, 0.870846950418812f, 0.440078398779761f, -0.0908818839265000f, 0.410077545060762f, 0.917678125288724f, 0.975295290129489f, 0.736514272579886f, 0.653896379317074f, -0.166512942888681f, -0.218665383726096f, -0.0688642360506688f, -0.596589868100824f, -0.180873413844075f, 0.229002598511067f, -0.647630976455599f, 0.722615884501717f, 0.760194030884127f, 0.253262836539679f, 0.0734191803957118f, -0.941427952376035f, 0.224118866807764f, 0.634990976599086f, 0.538622500570355f, -0.591487367587299f, 0.829253069890529f, 0.426659996899884f, -0.562435396124737f, 0.924178169394878f, -0.693964899988321f, -0.520472617448914f, 0.845157115508053f, 0.162984246343684f, -0.212032053476592f, 0.0482566706558292f, 0.820584028875367f, 0.676120066619505f, 0.590174358812695f, -0.457289938956925f, -0.351282540371674f, 0.322162683499620f, -0.683726196205246f, -0.279636659553935f, -0.186133028676429f, 0.965481755833750f, -0.0550172560314044f, -0.437844829991532f, -0.448670532146325f, -0.438916826946834f, 0.830205353164842f, -0.0125988502002286f, 0.733716462327519f, 0.870000673588185f, -0.189915082276716f, -0.676269331249200f, -0.336432931956768f, -0.288892891213265f, -0.912569275291884f, 0.509853767908707f, -0.658452317958678f, -0.562848133961047f, -0.102082581799095f, 0.904062026055565f, 0.473339990381854f, 0.210234896873676f, -0.0884007008398613f, 0.720872020499257f, 0.538315255331760f, -0.884485227439286f, 0.160844002639634f, 0.625863524205804f, -0.947487159926400f, 0.362643826956149f, -0.189913270725334f, -0.110428721523612f, -0.666510263156819f, -0.214827103263521f, 0.912669747474334f, -0.973896103049543f, 0.665373714127588f, 0.148135031012834f, 0.126524689644449f, 0.00283763548841764f, 0.312700495893193f, 0.579520771033243f, 0.677583023476560f, -0.779567427807191f, 0.0694994546110597f, -0.298762697062437f, 0.655210050716681f, 0.435909078048151f, 0.322095567178671f, 0.764827170021089f, -0.713736794113842f, 0.992844460358584f, -0.735915506109616f, 0.280204875392391f, 0.584446532772711f, 0.796955505835788f, 0.742508124239176f, 0.0785523490091065f, -0.562359397016753f, 0.874448473576734f, -0.794251927759664f, -0.658767152705445f, 0.120015806343044f, 0.662372174700575f, -0.719334975225296f, -0.663474261357014f, -0.637663874969148f, 0.706137632813821f, 0.734790814693796f, -0.449118755654663f, -0.758125670003823f, 0.719059339327447f, -0.228679956701166f, -0.0782671261690160f, 0.637830522744746f, -0.178696376536345f, -0.848273935253246f, 0.840882430630200f, 0.977813953976437f, 0.565474986185913f, -0.807314895274907f, -0.100534840844589f, -0.436186956483089f, 0.854663592026441f, -0.547576146320248f, -0.621784076386717f, 0.688687549426321f, -0.688962085987764f, -0.998914668418794f, 0.751493418398842f, -0.203018738091861f, -0.881317097659280f, -0.422480898609404f, -0.321074554557095f, -0.759379357125740f, -0.806503084491033f, -0.496837315822352f, 0.217087355208111f, -0.776801484423500f, -0.445747498145286f, 0.710204776554782f, 0.274276964033182f, 0.650397224484409f, -0.709395921248168f, 0.862663541330686f, -0.946166202558813f, 0.826638502366159f, -0.450587332736099f, -0.808257632193740f, -0.414360554482101f, -0.471118187583276f, 0.981592919290155f, 0.192794908371370f, -0.314979855997427f, 0.722518962804398f, -0.795914669179603f, 0.121447532644509f, 0.0446893237592363f, 0.651720955387594f, 0.897128141094619f, 0.283834144643742f, 0.369570391543943f, -0.163784005163726f, -0.799144231493300f, 0.338136741961422f, 0.795991730702685f, 0.601735561139351f, -0.556654767533027f, 0.907044495725416f, -0.374604065784494f, 0.814308532452677f, -0.254295412850351f, 0.443103437041340f, -0.0218296619602199f, 0.826728672505738f, 0.773205771668962f, 0.171909022893217f, 0.497670481959597f, 0.954178712898056f, 0.0840098577761919f, -0.705861127301893f, 0.145663865959608f, -0.436204975766037f, 0.479359595998989f, -0.719493824988072f, -0.523146212355768f, -0.917822711649927f, -0.610003715217602f, -0.192266667446473f, -0.377507163265653f, -0.250419291332051f, 0.873627391381727f, 0.922899703740095f, -0.902411671519496f, 0.285830821349708f, -0.577368595723736f, -0.598296174995687f, -0.0152478418690674f, 0.503725955636280f, 0.946501779740920f, 0.261108140547963f, 0.206258978593364f, -0.887022338332430f, 0.989187042741485f, 0.461764104690670f, 0.305280284664753f, 0.243972878436235f, -0.573704516784209f, 0.111805651228880f, -0.373590027525854f, 0.574564836347642f, -0.712884790778729f, -0.0570130063179222f, 0.244209425500712f, -0.717492787619277f, -0.476920207759357f, -0.444169983027413f, -0.254851417015366f, -0.505678630542571f, -0.953549022234155f, -0.0316841901798541f, 0.198256779602804f, 0.151938229162240f, -0.0259028503944394f, -0.799645893003010f, -0.889308912372168f, 0.339221517072804f, 0.904784479404768f, -0.367330903112591f, 0.866281762131661f, 0.112765232993802f, -0.0852946527317187f, -0.283538359072154f, -0.734951426632046f, 0.502970854898684f, -0.541434927857400f, 0.881496286285600f, -0.227404039639917f, -0.636983936776183f, -0.0799774217214970f, -0.833780310813424f, -0.222787370954425f, 0.433143783060434f, 0.0953330524947187f, 0.965400264971588f, 0.308927931247299f, 0.344316393259575f, 0.122880788538352f, -0.898509922382301f, -0.187062523329053f, 0.705352247460646f, -0.817811000761718f, 0.303714513401701f, 0.714863075518907f, -0.00862372607283035f, -0.842715848975590f, 0.816504077307885f, 0.924594085591125f, 0.334618732730041f, -0.212414743241377f, -0.758289625449925f, 0.586405661412351f, 0.909247363444287f, -0.800422609846793f, 0.397430897916299f, -0.408827454151232f, -0.411913213123543f, -0.602703152770135f, -0.893591462026327f, 0.417648762458765f, -0.766362696266534f, -0.166060103951854f, 0.883234167729589f, -0.0741908774062401f, 0.113912882075078f, -0.268248292164738f, -0.825585719915457f, 0.885446166477969f, -0.996523379251940f, -0.000841720632677401f, 0.940286529247477f, -0.528330498750176f, 0.0938880690147421f, -0.966296878893937f, 0.891956527154360f, -0.483384605653306f, 0.257210342748458f, -0.820220338820906f, 0.363913841603935f, 0.0364865250689275f, 0.0619156958713947f, -0.645447937080250f, 0.548279343062761f, -0.289526240449473f, -0.506780094171335f, -0.901771170107367f, -0.437874075223813f, 0.748512212111141f, -0.529884246718074f, 0.924062132675193f, -0.365432219122282f, -0.263296006595835f, -0.927083881647913f, -0.192737974697553f, -0.450051159199964f, -0.543528645806642f, 0.834976909049276f, -0.426975046433596f, -0.361056079272416f, 0.883880063360531f, 0.680380429911630f, -0.553642515320953f, 0.548847108935282f, -0.357430246936948f, 0.210445016993628f, 0.949511601115471f, -0.611278947360487f, 0.344744934459962f, 0.0684247970496175f, -0.877154656281116f, -0.521992702610556,
-0.0303764312006813f, -0.647220068176984f, 0.693175336224119f, -0.0955602614554496f, -0.765579758912278f, -0.821318118938906f, -0.220936603794347f, 0.159013709512021f, 0.0222743973539492f, 0.569438412513281f, 0.896083437551563f, 0.973699071868637f, -0.403438951991928f, -0.976931032127622f, -0.0720613180573018f, 0.0788813367661694f, -0.430781354548607f, 0.580378296309349f, -0.175446689199481f, -0.256743557012462f, -0.696667845393283f, 0.870473046831235f, 0.146660713923108f, 0.277741407197705f, 0.502075064404417f, 0.396530064046844f, -0.000209092342246420f, -0.977003947244262f, 0.451457326960000f, 0.420509664462095f, -0.0826395067671402f, 0.461120688156973f, 0.786867285802415f, 0.429254905841222f, 0.894426863739026f, -0.670297281923597f, -0.833650409296060f, -0.908588009702110f, 0.516311115539149f, 0.975234001829324f, -0.532953533466378f, 0.775291582519158f, -0.0136022600428900f, 0.654817093112596f, 0.363512141498233f, 0.624779024037534f, 0.0237004661473674f, -0.172570506046968f, 0.401807838319043f, 0.997391258152958f, -0.553969395939123f, -0.415425175833161f, -0.758032843655304f, -0.482766088920005f, 0.637574309072414f, -0.729000055114342f, 0.699851428676091f, -0.827508053421131f, 0.900655803848482f, -0.431149800814228f, 0.0369409101983413f, -0.378608101457895f, 0.237564147838841f, 0.533020461112441f, -0.280269627508005f, -0.864065787343603f, -0.0381481642453043f, -0.566886547530062f, 0.539727700361167f, 0.166859339425035f, 0.850080295054718f, 0.384690146030125f, -0.384995288415294f, 0.303656036600558f, -0.580297619022502f, 0.0649069482840878f, -0.162922327392773f, -0.235019427063355f, -0.265468718118809f, -0.121827312187455f, 0.0416628805824146f, 0.343481543012411f, -0.251429566892972f, -0.868100204320718f, -0.802636407512128f, -0.549547579028752f, -0.570017983863503f, -0.853634311513627f, -0.564570567173235f, 0.955944215494794f, -0.0930750790375956f, -0.160319122401953f, -0.640886790354213f, 0.798634607857513f, 0.503051518023559f, 0.765247226736789f, 0.909476811674882f, 0.677590253114963f, -0.110641683440517f, -0.336445241915220f, -0.684064840782028f, 0.962285048920031f, 0.883303701653897f, 0.981819291389659f, -0.597290928759656f, 0.215792997443025f, -0.847656608719347f, 0.679887992445640f, 0.299901700372808f, -0.677306526467426f, -0.348340058872692f, 0.651490451411335f, -0.133387041637395f, 0.718311240322040f, 0.0869279817052975f, 0.155413706090559f, -0.869119988858735f, -0.566773040844476f, -0.0513826414151206f, -0.368087669232071f, -0.978175512831125f, -0.229213501073727f, 0.344608572405871f, -0.663307667219997f, 0.437238632879575f, 0.00205230197288353f, -0.0897076092856746f, 0.834529513214144f, 0.131872357342232f, 0.113081940417244f, -0.418620232731326f, -0.317993033651213f, -0.740303025960662f, 0.423423655701288f, -0.300833032468860f, -0.458960388256530f, 0.692670405117589f, -0.559944357561921f, 0.0168623577148430f, 0.568661331088367f, -0.385055363002398f, -0.356055436463140f, -0.794446573681063f, 0.908870080953069f, -0.295500656666577f, 0.800625150733729f, 0.206307902542489f, 0.729591183391974f, -0.0655746333947396f, -0.261707022686154f, -0.802380330579914f, 0.0812359238243023f, -0.00528231140765212f, -0.725740453383981f, 0.919076065030463f, -0.896497189839174f, 0.861919731820265f, -0.804273875755869f, 0.230339021648310f, 0.296779613186519f, -0.349872572510143f, -0.270230381483447f, 0.0368924200249658f, 0.581340248642417f, 0.943620537648739f, 0.715012058065301f, 0.528414993233909f, 0.695917111744314f, -0.634354198968852f, -0.483786223099716f, 0.565405035681248f, -0.530076864213017f, 0.363019522302994f, -0.825556544716473f, 0.891096876998683f, -0.990692760548295f, -0.450641405862313f, -0.597008073985341f, -0.464377765418678f, -0.942926913464693f, -0.871399725569805f, 0.232335933943403f, 0.858786794807406f, -0.528589179815518f, -0.324757177062634f, 0.595880088750788f, -0.976574570427974f, -0.423824220654658f, -0.832990206908489f, 0.198704682807118f, -0.168244652325292f, 0.843066822744011f, 0.0912498543932607f, 0.485570815146582f, -0.104653316420662f, -0.623461298489716f, -0.807713596811018f, 0.737782734425857f, 0.456364368166532f, -0.430703367862900f, -0.188953991637209f, -0.827984282695373f, 0.0246267653665548f, 0.891225605267640f, 0.910600867999638f, 0.345236086687552f, -0.600682365520065f, 0.833182106437698f, 0.213749250288017f, -0.0866339102562885f, -0.618385082289017f, 0.859527120927500f, 0.749978780964161f, -0.334770513867011f, 0.242140166670949f, -0.196268320459958f, 0.611789869603675f, 0.655057159657307f, -0.603759576722096f, 0.614654509385217f, 0.144145218488192f, 0.959930150756613f, 0.485009777784726f, -0.564230295010912f, -0.404716165405314f, 0.0442672151313601f, 0.929486639423805f, 0.409386317338224f, 0.527053707674182f, 0.899087569745327f, -0.933259779365388f, 0.265159475034860f, -0.858300862890810f, -0.870994388031662f, 0.354868177430506f, 0.00956840260511749f, 0.429740959889133f, 0.649668163567379f, -0.744532888765288f, -0.967499901569196f, 0.556703631745254f, 0.535130550118618f, -0.639502350153040f, -0.604586469532735f, 0.0799683564329623f, -0.156074786599444f, -0.348308700325411f, 0.217829052228100f, 0.545642400171123f, -0.303317700019152f, -0.473220675222451f, -0.239688108834945f, 0.0998500862725149f, -0.962734081833842f, 0.870743993144299f, 0.464578557934316f, 0.184511089576136f, 0.559729843314504f, 0.0702052363354577f, 0.632714874625648f, 0.212930743289312f, -0.454606863365109f, -0.592679055778218f, 0.287649993384466f, -0.457293694071368f, -0.423493046785686f, -0.0674763327876298f, 0.242131064298176f, 0.488581911885965f, -0.464567743213882f, -0.387515661812354f, -0.914585596974616f, -0.255803162310627f, 0.941267268311980f, 0.690278917089395f, 0.302397314111962f, -0.178461434689705f, -0.949279941481428f, 0.160440202901122f, -0.970582196769486f, -0.0119478205074164f, -0.206440255898676f, 0.221640403444713f, -0.819801447827624f, 0.263614394802488f, 0.616376195532700f, -0.596859494305351f, -0.118659509995453f, 0.458168997595326f, -0.0400474705134108f, 0.934465050133603f, -0.852936731989621f, 0.0191637795580570f, 0.298534793677081f, -0.857491630206749f, -0.0141198383157879f, -0.365027350962024f, 0.450964838023674f, 0.351383095290905f, -0.387039947149600f, -0.983994933095116f, 0.610531582220017f, -0.0446025524732094f, 0.216718014780746f, -0.676819246943449f, 0.0385619292249610f, 0.192482456707739f, -0.288809653393521f, 0.241774557042318f, -0.444638770943313f, 0.535319194413803f, 0.374773141606987f, 0.186364279454450f, 0.0701814972821988f, -0.452753172654203f, -0.350918291268194f, -0.332963791049667f, 0.179301863965318f, 0.954101654404080f, -0.687960044344130f, 0.611454049205213f, -0.696789567124132f, -0.551566492897529f, 0.656434797122885f, -0.601779335396959f, -0.265656331560395f, -0.528821434638507f, 0.153601151147409f, 0.514739334540489f, -0.0517769842323894f, -0.659246830986894f, -0.453055366696259f, -0.0515886000780059f, 0.958478845408115f, 0.0221452906045994f, -0.159960643390796f, 0.816263632871352f, 0.245244170325114f, -0.0919839688704780f, 0.947170598807362f, 0.846772793441790f, 0.247105133025056f, -0.801972939368103f, -0.224977420586025f, 0.130099925027197f, 0.497816036746753f, 0.308139730113712f, -0.0536876417759813f, -0.492022090866895f, 0.188938438822753f, -0.400894058284033f, 0.314370104391157f, 0.618580768947071f, 0.830051263404639f, -0.228700130023340f, 0.811855169643177f, 0.0924092179787017f, 0.273652523319809f, -0.0624274843235475f, -0.503696982048589f, 0.510545161203341f, 0.341823133345436f, -0.437486933663093f, 0.0134072800031224f, 0.613837993234983f, 0.740945655313894f, 0.135311460882606f, 0.464832228842466f, -0.973962843371452f, -0.519388256678232f, 0.631469277357519f, -0.936937468616713f, 0.208677911871604f, -0.0946010975796272f, 0.560587233611855f, 0.230925763372331f, -0.637408482848184f, -0.679175194353885f, -0.408696637706987f, -0.0837464598184048f, -0.911070817707239f, 0.985815432104941f, -0.208807972878988f, 0.741966810464688f, 0.162772839973564f, 0.717702638881939f, 0.490767958961575f, -0.835565390813677f, -0.878516167634055f, -0.956727838876563f, -0.00772081382858891f, 0.355227897612178f, 0.202889185809854f, -0.431078767653467f, 0.106936101717808f, 0.354494042302258f, -0.619623833602791f, 0.193065593078352f, -0.105803087758606f, 0.151828327005194f, -0.141094922099930f, 0.847569902283069f, -0.656683924792181f, -0.880754505470701f, -0.421714047610595f, 0.681762288858050f, 0.633712681698887f, 0.947060360650644f, -0.959122611588459f, -0.0690574969687099f, -0.805062392278087f, 0.226501754467861f, -0.414732397455275f, 0.242398867364043f, -0.831838824773804f, 0.00787391802290793f, -0.860692119913991f, -0.391321299589110f, -0.0548681430681355f, -0.992920640472037f, 0.0975642331777702f, 0.894630836703243f, 0.767919825689366f, -0.260878774442215f, 0.407457430171103f, 0.140688657702825f, 0.737494845272763f, -0.650969054257040f, 0.230613259000797f, -0.0986876345046772f, 0.0996951163848971f, -0.679173062298700f, -0.760174222364469f, -0.613840714529317f, -0.692138390397415f, -0.0919103790884603f, 0.0259548517830916f, 0.463763807478796f, -0.859327137970617f, 0.298600182982665f, -0.591236092977368f, -0.994984881037264f, -0.0533840054951049f, 0.544979189292485f, 0.652482875230260f, 0.897548627394727f, -0.340241293753474f, 0.508237349558163f, -0.611986702936889f, -0.399952468536369f, -0.758494484998191f, -0.148960755782999f, 0.895231513826071f, -0.870487943961511f, -0.172763884748068f, -0.652702954266129f, 0.784450103085903f, -0.428504279168614f, -0.347266234450861f, -0.0897193897382391f, 0.760686883857503f, -0.0863659842493281f, -0.453544362916610f, 0.713112885874267f, -0.529914378597266f, -0.134507787695203f, -0.590955798880753f, -0.372583442870916f, 0.646730663631020f, -0.809515553972267f, 0.0226873348847205f, -0.209338539804651f, -0.737170063193136f, 0.365916689978321f, 0.658019395382111f, 0.733982378695990f, -0.579926149814113f, 0.973814182111372f, 0.933875763922095f, -0.985234946636757f, -0.103124599698243f, -0.798304574918884f, -0.119705341414667f, 0.205941898284561f, 0.111088288053652f, 0.418598493379981f, 0.309112287901667f, 0.0865232803642195f, -0.281174085998345f, -0.158426951248790f, 0.156672456990889f, 0.608691108739118f, -0.124654784531448f, -0.372060827503666f, 0.555750853569654f, -0.481715370485256f, 0.411012047999522f, 0.265636511301544f, 0.164466400718006f, 0.427292785417094,
-0.407665783814271f, 0.0463239131527564f, 0.0109249300633605f, 0.0949704798708169f, 0.223291931618591f, 0.708651599857453f, 0.810927407452143f, -0.298811874805995f, 0.347215272448441f, 0.778225160999446f, -0.981258755328673f, -0.629231280170021f, -0.948786159268210f, -0.0530522786747270f, -0.665046033882002f, 0.776993795678436f, -0.604492154463805f, -0.906360689482177f, 0.543616910115371f, -0.501547360013149f, 0.571784796850774f, 0.868511495621889f, 0.783008382563488f, 0.571870376568081f, 0.0471150346240308f, 0.402433510592678f, 0.661353159662286f, 0.0253381317208246f, 0.720141243708461f, -0.478805385943742f, 0.989639021624774f, 0.538614599364854f, -0.282810721919526f, 0.888399971333007f, 0.118572990347886f, 0.564528382703688f, 0.988296121763412f, 0.509638594649021f, -0.797738059997026f, 0.0363326380089621f, 0.978315833815278f, -0.483368013204689f, 0.879051054425480f, 0.632539830439323f, 0.722677742708361f, 0.578919286433726f, -0.250721628167261f, 0.534435049744896f, -0.0404568429105234f, 0.00805525426120179f, 0.841210870775473f, -0.731771544679396f, 0.713758914490801f, 0.830250762535296f, 0.436563669872217f, 0.567024378980237f, 0.983941121609744f, -0.253548560865555f, 0.647105012325159f, 0.434994339049196f, 0.130837710207442f, -0.775136733344706f, 0.234917279141211f, -0.498429841761386f, -0.273571256415041f, 0.247467425899991f, -0.970396693506149f, 0.975835855884816f, -0.347896516486866f, -0.552856369180847f, -0.887336234316568f, -0.573271015958957f, 0.910862901097874f, -0.807236601077904f, -0.523971593712952f, -0.263589563369279f, 0.591056276091253f, -0.320168527954128f, 0.726795865615521f, -0.731502115921006f, -0.942225519371229f, 0.268573107637337f, 0.380348127119473f, -0.284539943611895f, 0.117478291379931f, -0.817442486350524f, 0.0734705767013011f, -0.626880755668906f, -0.873066996524459f, -0.528675805715351f, 0.490255491577847f, 0.398142666604162f, -0.911320079669940f, -0.870350237514323f, 0.854587452657144f, 0.736349579728106f, 0.948232845958681f, -0.00126774478569258f, 0.905641169934000f, -0.965500575551565f, 0.0831330388550517f, -0.892713267782484f, -0.277958019172831f, 0.312987842344813f, 0.484268977417485f, -0.365960524226328f, 0.177956605738091f, 0.913776767689874f, -0.897537691614058f, 0.473075982698961f, 0.913190042662185f, -0.00843862630950820f, 0.972679442298938f, -0.856058592202917f, 0.264007224067230f, -0.138444823656136f, -0.386195416368251f, -0.286657907928107f, -0.231200657384828f, 0.917365701941188f, -0.271317547281263f, -0.252691685075831f, 0.893742787021399f, 0.512463051119608f, 0.979155111008605f, -0.472272776864686f, 0.238767541974988f, -0.672234403865928f, -0.846783135777377f, 0.0877594573148737f, 0.493055606176910f, -0.289012308379085f, 0.416463895880697f, -0.0795051375851281f, -0.476692131327163f, -0.430471976159529f, -0.701875030095239f, 0.724684336417516f, 0.984802039066595f, 0.798285421773762f, 0.000509924988974175f, -0.0852199551444761f, -0.709724122158260f, -0.332735158942919f, -0.741119907407496f, 0.729608513555970f, 0.500578022862182f, 0.520862987462710f, 0.565678561009731f, -0.393741545311224f, -0.568866018100912f, 0.571654318026290f, -0.817900961532165f, -0.793268461448962f, 0.614914392385859f, 0.763415306986536f, 0.450074180772758f, -0.737435729799608f, 0.841185794339245f, 0.894276069286366f, -0.276262284222369f, -0.798623475612628f, -0.280994234105732f, 0.821175230597885f, -0.474251640366966f, -0.190039801864015f, 0.0663032720971493f, 0.884162053156770f, -0.162023139878049f, -0.963135153785511f, -0.582213329804047f, -0.328536493809765f, -0.938405687658462f, -0.0171569611327957f, -0.727260847907578f, 0.419920927745257f, -0.361592243835530f, 0.476989471873569f, -0.146161675185107f, 0.431817832405826f, -0.371528849369885f, -0.940567978751516f, 0.165203770962029f, 0.781321525273307f, 0.0585592625092357f, 0.573299596753579f, -0.378869924017182f, 0.523139576520889f, 0.385605607116478f, -0.235893429970747f, 0.285814921067909f, -0.121941292771133f, 0.621558611608942f, -0.0860979132283732f, -0.627097832687809f, -0.312083243705910f, -0.494490796681559f, -0.987187334387934f, -0.0804474888246625f, 0.496400656176795f, -0.851811189314651f, -0.791398271297849f, -0.868174317799275f, -0.226794668997878f, -0.335339474552766f, -0.276765924750817f, -0.395876032147377f, -0.740529136126816f, -0.167799472110453f, 0.593129248263724f, 0.336783120133436f, 0.248892158925787f, 0.950120283075237f, -0.795216613504226f, -0.574731116508357f, -0.822689608026685f, 0.973698546284335f, 0.125166556654624f, 0.588150318080073f, 0.128654744345192f, -0.219207714307262f, -0.271053050307713f, 0.124071241265810f, -0.618209718015327f, -0.766619799595349f, -0.478340220431165f, -0.446873929629545f, 0.978019432749647f, -0.627041040766022f, 0.169323691066764f, -0.714079827532216f, 0.386101296128268f, -0.360225804976135f, -0.236797717782837f, -0.311635747131794f, 0.0482888201705840f, -0.477302740867809f, -0.427349080854399f, 0.390352470816329f, 0.611790541936623f, -0.648292156214605f, -0.345871618789073f, 0.509300603302844f, -0.0142202703124219f, -0.570248077753979f, -0.0629178211029751f, -0.737806048037047f, 0.497750084049821f, -0.761650107803135f, -0.788756591098617f, -0.994497286039420f, -0.987344273533962f, 0.657151987467984f, -0.763708299084062f, -0.0729359162118841f, 0.0455275633022023f, -0.101919187896584f, 0.457804242981095f, 0.0117715388281796f, -0.274125197027132f, -0.949738804931191f, 0.762108173886486f, 0.405150754308562f, -0.733330375873553f, -0.712774896799572f, -0.791947616412901f, 0.444023894424500f, 0.00507562975249609f, -0.900698136223538f, -0.576055334977054f, -0.948895529956106f, -0.832665060374124f, -0.992753953473078f, -0.0674086978315183f, 0.569494111501383f, -0.962269067721443f, -0.489700810475570f, 0.972626508328545f, -0.777400448149780f, 0.115588644128954f, 0.0730469703310024f, 0.523584488072518f, 0.659055312807301f, 0.134198234373838f, -0.797833055125151f, -0.167842823235145f, -0.662347837139732f, -0.537544370279756f, -0.622353549740796f, -0.789789664448618f, 0.985300123665319f, 0.862449845163424f, 0.973193986256980f, 0.148883268671144f, 0.283619537155083f, 0.508503183151258f, -0.246167305966866f, -0.259543094514413f, -0.778029136807597f, 0.128978622849116f, -0.920978818238085f, -0.116324837544276f, -0.261472397833253f, 0.772449038068069f, -0.696754008784325f, 0.980778877985902f, -0.227636956328402f, -0.472493776528032f, -0.568519858000960f, -0.151689463117960f, -0.102997587484899f, 0.464752146042376f, -0.839114793935065f, -0.0325074343587592f, -0.180618880765978f, 0.0132253638432844f, -0.646173464496730f, 0.821983901071593f, 0.657453744559881f, 0.786315172070382f, -0.438718096604728f, 0.702691078885442f, 0.859957412428682f, -0.505281395658564f, -0.236722160990303f, -0.698465568366759f, -0.746418979540090f, -0.218205126412646f, -0.808715244840435f, -0.949813739800491f, 0.176975348790769f, 0.723960974918154f, -0.139253733704369f, -0.387224393658603f, -0.869945438924443f, -0.396979039594941f, 0.0256060022407458f, -0.566074790002811f, -0.161564565183606f, -0.736189868188370f, -0.205593811665825f, -0.628996407588712f, -0.0266462623004120f, -0.344127255771429f, -0.229003801178142f, -0.469786561635510f, 0.258249378153965f, 0.160442939158622f, 0.0528817242116550f, 0.261960766261548f, -0.571069557415276f, 0.411333771884545f, -0.145205354714326f, 0.249324532476397f, 0.163889600722793f, 0.649915677347011f, 0.147077371087195f, -0.227104208942068f, 0.867390199578604f, -0.0734153565896754f, 0.0491208061060167f, 0.0360590744216485f, 0.181620126101180f, 0.0567549454976457f, -0.856976992549465f, -0.242511192726339f, -0.624770508991394f, -0.793161214564285f, -0.251208532727981f, -0.833192309869275f, 0.368166434661069f, 0.939730260791580f, 0.305796202211942f, -0.598830491282818f, -0.0575368190467946f, 0.371329658849021f, -0.227872714677810f, 0.707539568196379f, 0.795186297468385f, 0.475847791658551f, 0.829361555893632f, 0.405386540930889f, 0.213282954068900f, 0.767339023510319f, 0.525055513018554f, 0.259437496637378f, -0.524342591286100f, -0.731515526086696f, -0.233118783725590f, 0.237972339628935f, -0.933985285078109f, 0.537013420173496f, 0.498819465200784f, -0.407713459607516f, 0.382821417923595f, -0.416894700661466f, 0.0787266904103943f, -0.0627973593192392f, -0.320105342653426f, -0.844066834407447f, 0.138221622417319f, -0.676665423871596f, -0.961043785105959f, 0.832268610130385f, -0.905530890441773f, -0.114191325652611f, -0.376697124207843f, 0.390323137798417f, 0.953143142925101f, 0.983427991280007f, -0.0895687386326503f, -0.681543125061097f, 0.677131540142176f, -0.867715848764628f, -0.812718786220309f, -0.212509939486840f, -0.990002327123638f, -0.0682855560011961f, 0.129310729289606f, -0.623746296335073f, -0.285580241032587f, 0.235626081900812f, -0.611973228709249f, 0.539189737955466f, 0.970058678533189f, 0.901944358898624f, 0.168094826408153f, -0.666711281252260f, 0.965612752173968f, 0.651034558458719f, 0.687501917067508f, 0.758614314567106f, -0.839396045781239f, -0.552775028233564f, -0.528941743867256f, 0.174761156721889f, 0.243585712774679f, 0.588913151268911f, -0.306898192880627f, 0.921540023069231f, -0.0223654942298541f, -0.102408576957649f, 0.612577852207921f, 0.835809058447089f, -0.437118459197839f, 0.455316033239981f, 0.311435507416257f, -0.648992336007256f, 0.346823844785409f, -0.632080213667648f, -0.599678627679202f, -0.653822991854328f, 0.484305292443427f, 0.782046295685087f, 0.960987598814982f, 0.627169162605570f, 0.948092598306120f, -0.185268381817018f, 0.602489977060513f, -0.885827813790617f, -0.00179203147433582f, -0.175476447614991f, 0.0461282236560925f, -0.898013889602944f, 0.256310837914276f, -0.733422110056865f, -0.740091677658095f, 0.966724540497493f, 0.328056986822768f, -0.267854591449557f, 0.670545831663244f, -0.356204313297688f, 0.0729865206358908f, -0.594530723723669f, 0.519965324048968f, 0.0632129606097647f, -0.878434885663544f, -0.497945943395010f, 0.0151854050905818f, -0.218036856012343f, 0.547721213710874f, -0.0915514918588898f, -0.279344098401951f, -0.228654882218650f, 0.100432155997130f, 0.802024600677294f, 0.175832345686877f, 0.0551231013299744f, 0.938247319394824f, 0.639298571360036f, -0.291461603371678f, -0.853503115314794f, -0.604829242631156f, 0.0291571486740745f, -0.932575328418390f, -0.621235088415116f, 0.403040314052094f, -0.809695618266849f, 0.966605888732736f, -0.199254401023053,
-0.540808222970056f, -0.0141840769249790f, 0.114579158224093f, 0.466889318471371f, -0.145415211797766f, -0.846707387707480f, -0.881237200733915f, -0.410798723199712f, -0.637697860299854f, -0.196366036081372f, 0.193267531425712f, -0.258591200841940f, -0.173003722066551f, 0.478121376006132f, 0.953819951501542f, 0.969916001975448f, 0.131515861287576f, -0.499829658784781f, 0.320952777516193f, -0.226980682212371f, 0.766886115655233f, 0.647310434110803f, -0.772594685974992f, 0.772645949480187f, -0.936357605801364f, -0.671842916281206f, -0.595127074295355f, 0.335132581825520f, 0.648964430112689f, -0.793376819398441f, -0.963663232647360f, 0.914308824314478f, -0.397663128784982f, 0.803240040231588f, -0.291039120047626f, -0.339918835846510f, -0.208620988780609f, 0.278177231697424f, -0.833157746552451f, 0.260554706029473f, -0.580537744139231f, 0.918561093477862f, 0.641368468308093f, 0.827379039283645f, -0.412231303854834f, -0.518315486749742f, 0.423356687848085f, 0.0777277584993787f, 0.394127392657178f, 0.609705410002715f, 0.264669032561337f, -0.460555696512027f, -0.0858908123066196f, -0.281781559603429f, -0.179777723960362f, -0.00449990348855067f, 0.803703377739133f, -0.155074032314596f, -0.00206139428833696f, 0.0661730930565525f, -0.737509215752079f, 0.620182143819587f, 0.114750705414661f, 0.545663051433958f, 0.661601724477194f, -0.592280382351976f, 0.609240020031149f, -0.968781019917808f, -0.668068368389875f, 0.206915551463500f, 0.0951453192552747f, 0.268580107578401f, -0.0450052302342363f, -0.933589842483940f, 0.236570492858402f, 0.0688734168318912f, 0.930163232697303f, 0.435953476823146f, 0.533759385687075f, 0.368282038662015f, -0.602312961473778f, 0.709516631712345f, -0.168303926671961f, 0.130670870119294f, -0.657736111745007f, 0.115028598388756f, 0.173728026281032f, -0.681671363429886f, -0.538786035950873f, 0.481457671665448f, 0.0136795278434168f, -0.570065342244344f, 0.188187050857249f, -0.352869308173680f, -0.979175308628854f, 0.223702879460018f, 0.994220466087713f, -0.147795166105729f, 0.218427535879435f, -0.120050826084179f, -0.0124939247430063f, -0.645134875027126f, -0.503122688484778f, 0.534123007328982f, 0.619710972635444f, -0.234248243706177f, 0.987144458053815f, 0.261284702576427f, 0.851827092094236f, 0.750019654249059f, -0.926154630610335f, 0.449356103243440f, 0.783011320523296f, -0.459228158107270f, -0.228877816937867f, 0.271108937592868f, -0.676085611673506f, 0.783114428240160f, 0.636093784021493f, -0.754110314308629f, -0.546386104880684f, 0.0385811136139234f, -0.768951137117397f, -0.644624743947807f, 0.00890157035391148f, -0.0792572116273387f, -0.989980668770044f, 0.603057533157075f, 0.280835727469123f, -0.634716709420524f, -0.712669415138995f, -0.424129916157595f, -0.436923748487354f, 0.467366013559791f, 0.907740481011987f, 0.788617065944311f, -0.152237692069130f, -0.963044404518533f, 0.907393322909416f, 0.806867676446313f, 0.699270310021791f, 0.107867603776547f, 0.127360747415417f, -0.502645789696788f, -0.511744166872327f, -0.121672719343072f, -0.596527146770249f, 0.410180172377510f, -0.852889849908704f, 0.278972213674154f, 0.0260156356783650f, 0.997558501949683f, -0.499245840292893f, -0.451169267624132f, -0.881643497362337f, 0.986957209874262f, -0.129608292321380f, 0.935829016346258f, -0.649021465281634f, 0.550436689069794f, 0.278888743082679f, 0.0137769346664500f, -0.660666060213522f, -0.416709136728042f, -0.302903068397225f, 0.180657445835459f, -0.908195955986293f, 0.280056533234627f, -0.660025789034158f, -0.798207438952561f, 0.901575224780405f, -0.608702932295102f, 0.318860199910414f, 0.874005722023406f, -0.0816057579181704f, 0.981671341873017f, -0.339234700161323f, 0.559717959858931f, 0.390363525109105f, -0.309384476087470f, 0.956563156784297f, -0.623734354817613f, -0.196627375289105f, -0.702076014509088f, 0.293098766889643f, -0.617152224560368f, 0.859117491438645f, 0.661015739867647f, 0.0747554166353739f, -0.282417009682732f, -0.667461537762524f, -0.451029960388404f, -0.464518668674360f, 0.591389440503293f, 0.552648871601186f, -0.242406315814918f, 0.147876771864331f, -0.00605730052917419f, -0.850648363553678f, -0.659957159486993f, -0.165475362851332f, 0.204150315434812f, -0.665767311591476f, -0.716154682563576f, 0.417487456932076f, 0.448184990956287f, 0.733843802413198f, -0.170228277851921f, -0.346809954182150f, 0.956058632188011f, 0.0315623945930987f, 0.509027121691627f, -0.147826185909834f, 0.717423768198044f, -0.153258078639530f, -0.586190749016474f, 0.122228033051868f, -0.884999045468193f, -0.364729711773548f, 0.0869976154696972f, -0.793532199218799f, 0.533748273468951f, -0.852754376244435f, 0.294752047699830f, 0.136764278163013f, 0.838074791168389f, 0.795224598541123f, -0.778005568697498f, -0.260924769562304f, -0.303759147861313f, 0.273726011325558f, 0.530476779331216f, 0.0866801234357086f, 0.0677702376031544f, 0.724353404182035f, -0.974710312543683f, 0.791838170482991f, 0.247768259921660f, 0.979431048271259f, -0.386992541899814f, 0.0640038231299192f, -0.00457726816166693f, 0.371455553726539f, 0.647649995487707f, 0.268304945808406f, -0.320428608173924f, 0.0927511620029309f, 0.256010036486838f, 0.740396212690346f, -0.656873241472848f, 0.823534292439413f, -0.820380362458844f, -0.453300307443023f, 0.784238355222248f, 0.912791840124321f, 0.0999478035440859f, -0.212620916988855f, 0.0170290625008669f, -0.589062380565879f, -0.171833624145497f, -0.524918122866141f, 0.961528292650892f, 0.101262818636430f, 0.941455114569308f, -0.967226220138929f, 0.616781547648562f, -0.913823148383971f, 0.274508821885917f, 0.924653374107756f, -0.866302908989783f, 0.227541907715857f, 0.0907574361370582f, -0.127499097943315f, -0.942071371521895f, -0.119419163649152f, 0.674284088819523f, 0.881328505929745f, 0.246290207551702f, 0.0547607254148590f, -0.462882918359077f, 0.888969728230585f, 0.666583509571921f, 0.238417203582380f, -0.279842248122727f, 0.855260336845903f, 0.314306869401155f, -0.188654877893078f, -0.609304918228150f, 0.169453885325888f, 0.265617874907016f, -0.943423537926184f, 0.493118676869450f, -0.386147750024858f, 0.0103920154342951f, 0.753677832518483f, 0.363353012331066f, -0.286620106520429f, -0.623332994906295f, 0.183966714365642f, -0.124278942882867f, -0.687889346448110f, -0.509002319646341f, -0.705769785650865f, 0.600586126467172f, 0.814989294939922f, 0.198959025256652f, 0.477897007911356f, 0.757957814363899f, 0.617755921094230f, -0.353589871947529f, 0.419688673189503f, -0.860584865805600f, -0.0232779635193843f, -0.789951030889387f, -0.893196700185750f, 0.610996462535201f, 0.847373590985131f, -0.989553358501822f, -0.367651771428081f, 0.741563712056747f, -0.923595352848971f, -0.580174215739367f, 0.577092000574232f, -0.910872910110270f, -0.907499077314190f, 0.692372247654077f, 0.810694134592084f, -0.608596332548047f, 0.761254615051625f, 0.0546240611947364f, -0.393956427117691f, -0.116127831535139f, -0.0352014590913388f, 0.374742194768889f, -0.927344099730091f, 0.939301337232488f, -0.969831716293845f, -0.0489333404770240f, -0.586719398908953f, 0.0235541378462407f, 0.388882981728285f, -0.0728483242295113f, 0.418280445244943f, -0.574289337805456f, -0.779962057565259f, -0.835190719754123f, 0.918717316922657f, -0.765889988109173f, -0.935310664146932f, -0.0750906135370848f, -0.256246546197534f, 0.693865929543926f, 0.592800255527084f, 0.836743344551035f, -0.801953470827580f, 0.0595524153568945f, 0.158376549012192f, -0.429364776412726f, -0.450531184162532f, -0.169317185285268f, 0.420344570579195f, -0.902838087574441f, -0.654676904337469f, 0.941802178622893f, -0.411034608875500f, -0.455381371659872f, 0.582371240315256f, -0.276150504466756f, 0.164276403376185f, -0.960238817086774f, 0.590055303394028f, -0.995185688656226f, -0.285809748360467f, -0.792066171752882f, -0.456123303649101f, -0.864169187700384f, 0.798745251308383f, -0.517673464079948f, 0.523086536900369f, 0.398784615211052f, 0.908677185333852f, -0.434846969584770f, -0.277024535706464f, 0.575800013122065f, -0.0423952171673019f, -0.327530749916683f, -0.401220909875065f, -0.232577533032385f, 0.577630268254944f, -0.733290201484409f, -0.297499739456838f, 0.166541885572822f, -0.646828619904039f, 0.0312662656272755f, 0.754145050600965f, -0.908499825108811f, 0.315379190361296f, 0.366242661082351f, 0.867903806940678f, -0.613391940567782f, 0.00760147209048068f, 0.953424134034927f, -0.812551125910811f, 0.734998935207065f, 0.781720854678504f, -0.653974423413561f, 0.612587888218526f, -0.297359914095386f, -0.409559158758694f, -0.143962230212734f, -0.814888102841114f, 0.359131810502055f, 0.356924557741016f, -0.872415989401612f, 0.716849887848809f, -0.374916928585818f, -0.0702264435280595f, 0.329843438660215f, 0.0956097573088677f, -0.937528128860310f, -0.322293489817529f, 0.781444964993177f, -0.810141738751828f, -0.150295079242497f, 0.846909181293597f, -0.128124277517711f, -0.752611695817661f, 0.839996835828451f, -0.0705685941510277f, 0.000366462394740585f, 0.0788016995849923f, -0.246053200655556f, -0.156645099915028f, -0.460752333796863f, 0.622021359864204f, 0.722871957583123f, -0.257873353238499f, -0.309810184480446f, 0.765248644407833f, -0.553316047243663f, -0.612742789838491f, 0.354017349601509f, 0.923293368553697f, 0.630695912377860f, -0.148750121613537f, -0.821801680234240f, 0.368247966228196f, 0.405416044101496f, -0.803232509711354f, -0.429778551911399f, -0.723837414527446f, -0.963925147452133f, 0.190882872226757f, 0.477008077263598f, -0.661282403679070f, 0.271643442525556f, -0.915994079618801f, 0.196564556546175f, 0.378359035245796f, 0.584016730657668f, -0.0377864332655202f, -0.327376192853106f, 0.850744189707984f, 0.799571679043808f, -0.111126908452029f, 0.525587242291601f, -0.404486180733535f, -0.134496922397279f, 0.0890128096708100f, -0.815560643303157f, -0.920166023598312f, -0.360079578314899f, -0.556238898466371f, -0.220978103133838f, -0.571530268052405f, 0.573332217175226f, -0.133862258696460f, -0.982130330352248f, -0.352538465285082f, 0.318683937697894f, -0.790927430842686f, 0.691168535237102f, 0.806014327242002f, -0.981639450008060f, 0.407200095027265f, 0.918249921845949f, 0.776880149695420f, -0.437773083955269f, -0.385117533333437f, 0.0115152415796460f, 0.687224538003991f, 0.992524870612626f, 0.471003324792228f, -0.873541777412034f, -0.560923118634380f, -0.726151823613842f, -0.538941951730010f, 0.772057551475325f, 0.858490725829641f, -0.168849338472479f };
# 102 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/fixed-point.h"
fxp_t wrap(fxp_t kX, fxp_t kLowerBound, fxp_t kUpperBound)
{
int32_t range_size = kUpperBound - kLowerBound + 1;
if (kX < kLowerBound){
kX += range_size * ((kLowerBound - kX) / range_size + 1);
}
return kLowerBound + (kX - kLowerBound) % range_size;
}
fxp_t fxp_get_int_part(fxp_t in) {
return ((in < 0) ? -((-in) & _fxp_imask) : in & _fxp_imask);
}
fxp_t fxp_get_frac_part(fxp_t in) {
return ((in < 0) ? -((-in) & _fxp_fmask) : in & _fxp_fmask);
}
float fxp_to_float(fxp_t fxp);
fxp_t fxp_quantize(fxp_t aquant) {
if (overflow_mode == 2) {
if(aquant < _fxp_min) {
return _fxp_min;
}
else if(aquant > _fxp_max) {
return _fxp_max;
}
}
else if (overflow_mode == 3) {
if(aquant < _fxp_min || aquant > _fxp_max) {
return wrap(aquant, _fxp_min, _fxp_max);
}
}
return (fxp_t) aquant;
}
void fxp_verify_overflow(fxp_t value){
fxp_quantize(value);
printf("An Overflow Occurred in system's output");
__DSVERIFIER_assert(value <= _fxp_max && value >= _fxp_min);
}
void fxp_verify_overflow_node(fxp_t value, char* msg){
if (2 == 2)
{
printf("%s",msg);
__DSVERIFIER_assert(value <= _fxp_max && value >= _fxp_min);
}
}
void fxp_verify_overflow_array(fxp_t array[], int n){
int i=0;
for(i=0; i<n;i++){
fxp_verify_overflow(array[i]);
}
}
fxp_t fxp_int_to_fxp(int in) {
fxp_t lin;
lin = (fxp_t) in*_fxp_one;
return lin;
}
int fxp_to_int(fxp_t fxp) {
if(fxp >= 0){
fxp += _fxp_half;
} else {
fxp -= _fxp_half;
}
fxp >>= impl.frac_bits;
return (int) fxp;
}
fxp_t fxp_float_to_fxp(float f) {
fxp_t tmp;
double ftemp;
ftemp = f * scale_factor[impl.frac_bits];
if(f >= 0) {
tmp = (fxp_t)(ftemp + 0.5);
}
else {
tmp = (fxp_t)(ftemp - 0.5);
}
return tmp;
}
fxp_t fxp_double_to_fxp(double value) {
fxp_t tmp;
double ftemp = value * scale_factor[impl.frac_bits];
if (rounding_mode == 0){
if(value >= 0) {
tmp = (fxp_t)(ftemp + 0.5);
}
else {
tmp = (fxp_t)(ftemp - 0.5);
}
} else if(rounding_mode == 1){
tmp = (fxp_t) ftemp;
double residue = ftemp - tmp;
if ((value < 0) && (residue != 0)){
ftemp = ftemp - 1;
tmp = (fxp_t) ftemp;
}
} else if (rounding_mode == 0){
tmp = (fxp_t) ftemp;
}
return tmp;
}
void fxp_float_to_fxp_array(float f[], fxp_t r[], int N) {
int i;
for(i = 0; i < N; ++i) {
r[i] = fxp_float_to_fxp(f[i]);
}
}
void fxp_double_to_fxp_array(double f[], fxp_t r[], int N) {
int i;
for(i = 0; i < N; ++i) {
r[i] = fxp_double_to_fxp(f[i]);
}
}
# 275 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/fixed-point.h"
float fxp_to_float(fxp_t fxp) {
float f;
int f_int = (int) fxp;
f = f_int * scale_factor_inv[impl.frac_bits];
return f;
}
double fxp_to_double(fxp_t fxp) {
double f;
int f_int = (int) fxp;
f = f_int * scale_factor_inv[impl.frac_bits];
return f;
}
void fxp_to_float_array(float f[], fxp_t r[], int N) {
int i;
for(i = 0; i < N; ++i) {
f[i] = fxp_to_float(r[i]);
}
}
void fxp_to_double_array(double f[], fxp_t r[], int N) {
int i;
for(i = 0; i < N; ++i) {
f[i] = fxp_to_double(r[i]);
}
}
fxp_t fxp_abs(fxp_t a) {
fxp_t tmp;
tmp = ((a < 0) ? -(fxp_t)(a) : a);
tmp = fxp_quantize(tmp);
return tmp;
}
fxp_t fxp_add(fxp_t aadd, fxp_t badd) {
fxp_t tmpadd;
tmpadd = ((fxp_t)(aadd) + (fxp_t)(badd));
tmpadd = fxp_quantize(tmpadd);
return tmpadd;
}
fxp_t fxp_sub(fxp_t asub, fxp_t bsub) {
fxp_t tmpsub;
tmpsub = (fxp_t)((fxp_t)(asub) - (fxp_t)(bsub));
tmpsub = fxp_quantize(tmpsub);
return tmpsub;
}
fxp_t fxp_mult(fxp_t amult, fxp_t bmult) {
fxp_t tmpmult, tmpmultprec;
tmpmult = (fxp_t)((fxp_t)(amult)*(fxp_t)(bmult));
if (tmpmult >= 0) {
tmpmultprec = (tmpmult + ((tmpmult & 1 << (impl.frac_bits - 1)) << 1)) >> impl.frac_bits;
} else {
tmpmultprec = -(((-tmpmult) + (((-tmpmult) & 1 << (impl.frac_bits - 1)) << 1)) >> impl.frac_bits);
}
tmpmultprec = fxp_quantize(tmpmultprec);
return tmpmultprec;
}
# 372 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/fixed-point.h"
fxp_t fxp_div(fxp_t a, fxp_t b){
__DSVERIFIER_assume( b!=0 );
fxp_t tmpdiv = ((a << impl.frac_bits) / b);
tmpdiv = fxp_quantize(tmpdiv);
return tmpdiv;
}
fxp_t fxp_neg(fxp_t aneg) {
fxp_t tmpneg;
tmpneg = -(fxp_t)(aneg);
tmpneg = fxp_quantize(tmpneg);
return tmpneg;
}
# 398 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/fixed-point.h"
fxp_t fxp_sign(fxp_t a) {
return ((a == 0) ? 0 : ((a < 0) ? _fxp_minus_one : _fxp_one) );
}
fxp_t fxp_shrl(fxp_t in, int shift) {
return (fxp_t) (((unsigned int) in) >> shift);
}
fxp_t fxp_square(fxp_t a) {
return fxp_mult(a, a);
}
void fxp_print_int(fxp_t a) {
printf("\n%i", (int32_t)a);
}
void fxp_print_float(fxp_t a) {
printf("\n%f", fxp_to_float(a));
}
void fxp_print_float_array(fxp_t a[], int N) {
int i;
for(i = 0; i < N; ++i) {
printf("\n%f", fxp_to_float(a[i]));
}
}
void print_fxp_array_elements(char * name, fxp_t * v, int n){
printf("%s = {", name);
int i;
for(i=0; i < n; i++){
printf(" %jd ", v[i]);
}
printf("}\n");
}
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h" 1
# 24 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h"
void initialize_array(double v[], int n){
int i;
for(i=0; i<n; i++){
v[i] = 0;
}
}
void revert_array(double v[], double out[], int n){
initialize_array(out,n);
int i;
for(i=0; i<n; i++){
out[i] = v[n-i-1];
}
}
double internal_pow(double a, double b){
int i;
double acc = 1;
for (i=0; i < b; i++){
acc = acc*a;
}
return acc;
}
double internal_abs(double a){
return a < 0 ? -a : a;
}
int fatorial(int n){
return n == 0 ? 1 : n * fatorial(n-1);
}
int check_stability(double a[], int n){
int lines = 2 * n - 1;
int columns = n;
double m[lines][n];
int i,j;
double current_stability[n];
for (i=0; i < n; i++){
current_stability[i] = a[i];
}
double sum = 0;
for (i=0; i < n; i++){
sum += a[i];
}
if (sum <= 0){
printf("[DEBUG] the first constraint of Jury criteria failed: (F(1) > 0)");
return 0;
}
sum = 0;
for (i=0; i < n; i++){
sum += a[i] * internal_pow(-1, n-1-i);
}
sum = sum * internal_pow(-1, n-1);
if (sum <= 0){
printf("[DEBUG] the second constraint of Jury criteria failed: (F(-1)*(-1)^n > 0)");
return 0;
}
if (internal_abs(a[n-1]) > a[0]){
printf("[DEBUG] the third constraint of Jury criteria failed: (abs(a0) < a_{n}*z^{n})");
return 0;
}
for (i=0; i < lines; i++){
for (j=0; j < columns; j++){
m[i][j] = 0;
}
}
for (i=0; i < lines; i++){
for (j=0; j < columns; j++){
if (i == 0){
m[i][j] = a[j];
continue;
}
if (i % 2 != 0 ){
int x;
for(x=0; x<columns;x++){
m[i][x] = m[i-1][columns-x-1];
}
columns = columns - 1;
j = columns;
}else{
m[i][j] = m[i-2][j] - (m[i-2][columns] / m[i-2][0]) * m[i-1][j];
}
}
}
int first_is_positive = m[0][0] >= 0 ? 1 : 0;
for (i=0; i < lines; i++){
if (i % 2 == 0){
int line_is_positive = m[i][0] >= 0 ? 1 : 0;
if (first_is_positive != line_is_positive){
return 0;
}
continue;
}
}
return 1;
}
void poly_sum(double a[], int Na, double b[], int Nb, double ans[], int Nans){
int i;
Nans = Na>Nb? Na:Nb;
for (i=0; i<Nans; i++){
if (Na>Nb){
ans[i]=a[i];
if (i > Na-Nb-1){
ans[i]=ans[i]+b[i-Na+Nb];
}
}else {
ans[i]=b[i];
if (i> Nb - Na -1){
ans[i]=ans[i]+a[i-Nb+Na];
}
}
}
}
void poly_mult(double a[], int Na, double b[], int Nb, double ans[], int Nans){
int i;
int j;
int k;
Nans = Na+Nb-1;
for (i=0; i<Na; i++){
for (j=0; j<Nb; j++){
k= Na + Nb - i - j - 2;
ans[k]=0;
}
}
for (i=0; i<Na; i++){
for (j=0; j<Nb; j++){
k= Na + Nb - i - j - 2;
ans[k]=ans[k]+a[Na - i - 1]*b[Nb - j - 1];
}
}
}
void double_check_oscillations(double * y, int y_size){
__DSVERIFIER_assume(y[0] != y[y_size - 1]);
int window_timer = 0;
int window_count = 0;
int i, j;
for (i = 2; i < y_size; i++){
int window_size = i;
for(j=0; j<y_size; j++){
if (window_timer > window_size){
window_timer = 0;
window_count = 0;
}
int window_index = j + window_size;
if (window_index < y_size){
if (y[j] == y[window_index]){
window_count++;
# 209 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h" 3 4
((void) sizeof ((
# 209 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h"
!(window_count == window_size)
# 209 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 209 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h"
!(window_count == window_size)
# 209 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h" 3 4
) ; else __assert_fail (
# 209 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h"
"!(window_count == window_size)"
# 209 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h", 209, __extension__ __PRETTY_FUNCTION__); }))
# 209 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h"
;
}
}else{
break;
}
window_timer++;
}
}
}
void double_check_limit_cycle(double * y, int y_size){
double reference = y[y_size - 1];
int idx = 0;
int window_size = 1;
for(idx = (y_size-2); idx >= 0; idx--){
if (y[idx] != reference){
window_size++;
}else{
break;
}
}
__DSVERIFIER_assume(window_size != y_size && window_size != 1);
printf("window_size %d\n", window_size);
int desired_elements = 2 * window_size;
int found_elements = 0;
for(idx = (y_size-1); idx >= 0; idx--){
if (idx > (y_size-window_size-1)){
printf("%.0f == %.0f\n", y[idx], y[idx-window_size]);
int cmp_idx = idx - window_size;
if ((cmp_idx > 0) && (y[idx] == y[idx-window_size])){
found_elements = found_elements + 2;
}else{
break;
}
}
}
printf("desired_elements %d\n", desired_elements);
printf("found_elements %d\n", found_elements);
__DSVERIFIER_assert(desired_elements != found_elements);
}
void double_check_persistent_limit_cycle(double * y, int y_size){
int idy = 0;
int count_same = 0;
int window_size = 0;
double reference = y[0];
for(idy = 0; idy < y_size; idy++){
if (y[idy] != reference){
window_size++;
} else if (window_size != 0){
break;
} else {
count_same++;
}
}
window_size += count_same;
__DSVERIFIER_assume(window_size > 1 && window_size <= y_size/2);
double lco_elements[window_size];
for(idy = 0; idy < y_size; idy++){
if (idy < window_size){
lco_elements[idy] = y[idy];
}
}
idy = 0;
int lco_idy = 0;
_Bool is_persistent = 0;
while (idy < y_size){
if(y[idy++] == lco_elements[lco_idy++]){
is_persistent = 1;
}else{
is_persistent = 0;
break;
}
if (lco_idy == window_size){
lco_idy = 0;
}
}
__DSVERIFIER_assert(is_persistent == 0);
}
void print_array_elements(char * name, double * v, int n){
printf("%s = {", name);
int i;
for(i=0; i < n; i++){
printf(" %.32f ", v[i]);
}
printf("}\n");
}
void double_add_matrix( unsigned int lines, unsigned int columns, double m1[4][4], double m2[4][4], double result[4][4]){
unsigned int i, j;
for (i = 0; i < lines; i++){
for (j = 0; j < columns; j++){
result[i][j] = m1[i][j] + m2[i][j];
}
}
}
void double_sub_matrix( unsigned int lines, unsigned int columns, double m1[4][4], double m2[4][4], double result[4][4]){
unsigned int i, j;
for (i = 0; i < lines; i++){
for (j = 0; j < columns; j++){
result[i][j] = m1[i][j] - m2[i][j];
}
}
}
void double_matrix_multiplication( unsigned int i1, unsigned int j1, unsigned int i2, unsigned int j2, double m1[4][4], double m2[4][4], double m3[4][4]){
unsigned int i, j, k;
if (j1 == i2) {
for (i=0; i<i1; i++) {
for (j=0; j<j2; j++) {
m3[i][j] = 0;
}
}
for (i=0;i<i1; i++) {
for (j=0; j<j2; j++) {
for (k=0; k<j1; k++) {
double mult = (m1[i][k] * m2[k][j]);
m3[i][j] = m3[i][j] + (m1[i][k] * m2[k][j]);
}
}
}
} else {
printf("\nError! Operation invalid, please enter with valid matrices.\n");
}
}
void fxp_matrix_multiplication( unsigned int i1, unsigned int j1, unsigned int i2, unsigned int j2, fxp_t m1[4][4], fxp_t m2[4][4], fxp_t m3[4][4]){
unsigned int i, j, k;
if (j1 == i2) {
for (i=0; i<i1; i++) {
for (j=0; j<j2; j++) {
m3[i][j] = 0;
}
}
for (i=0;i<i1; i++) {
for (j=0; j<j2; j++) {
for (k=0; k<j1; k++) {
m3[i][j] = fxp_add( m3[i][j], fxp_mult(m1[i][k] , m2[k][j]));
}
}
}
} else {
printf("\nError! Operation invalid, please enter with valid matrices.\n");
}
}
void fxp_exp_matrix(unsigned int lines, unsigned int columns, fxp_t m1[4][4], unsigned int expNumber, fxp_t result[4][4]){
unsigned int i, j, l, k;
fxp_t m2[4][4];
if(expNumber == 0){
for (i = 0; i < lines; i++){
for (j = 0; j < columns; j++){
if(i == j){
result[i][j] = fxp_double_to_fxp(1.0);
} else {
result[i][j] = 0.0;
}
}
}
return;
}
for (i = 0; i < lines; i++)
for (j = 0; j < columns; j++) result[i][j] = m1[i][j];
if(expNumber == 1){
return;
}
for(l = 1; l < expNumber; l++){
for (i = 0; i < lines; i++)
for (j = 0; j < columns; j++) m2[i][j] = result[i][j];
for (i = 0; i < lines; i++)
for (j = 0; j < columns; j++) result[i][j] = 0;
for (i=0;i<lines; i++) {
for (j=0; j<columns; j++) {
for (k=0; k<columns; k++) {
result[i][j] = fxp_add( result[i][j], fxp_mult(m2[i][k] , m1[k][j]));
}
}
}
}
}
void double_exp_matrix(unsigned int lines, unsigned int columns, double m1[4][4], unsigned int expNumber, double result[4][4]){
unsigned int i, j, k, l;
double m2[4][4];
if(expNumber == 0){
for (i = 0; i < lines; i++){
for (j = 0; j < columns; j++){
if(i == j){
result[i][j] = 1.0;
} else {
result[i][j] = 0.0;
}
}
}
return;
}
for (i = 0; i < lines; i++)
for (j = 0; j < columns; j++) result[i][j] = m1[i][j];
if(expNumber == 1){
return;
}
for(l = 1; l < expNumber; l++){
for (i = 0; i < lines; i++)
for (j = 0; j < columns; j++) m2[i][j] = result[i][j];
for (i = 0; i < lines; i++)
for (j = 0; j < columns; j++) result[i][j] = 0;
for (i=0;i<lines; i++) {
for (j=0; j<columns; j++) {
for (k=0; k<columns; k++) {
result[i][j] = result[i][j] + (m2[i][k] * m1[k][j]);
}
}
}
}
}
void fxp_add_matrix( unsigned int lines, unsigned int columns, fxp_t m1[4][4], fxp_t m2[4][4], fxp_t result[4][4]){
unsigned int i, j;
for (i = 0; i < lines; i++)
for (j = 0; j < columns; j++) {
result[i][j] = fxp_add(m1[i][j] , m2[i][j]);
}
}
void fxp_sub_matrix( unsigned int lines, unsigned int columns, fxp_t m1[4][4], fxp_t m2[4][4], fxp_t result[4][4]){
unsigned int i, j;
for (i = 0; i < lines; i++)
for (j = 0; j < columns; j++) result[i][j] = fxp_sub(m1[i][j] , m2[i][j]);
}
void print_matrix(double matrix[4][4], unsigned int lines, unsigned int columns){
printf("\nMatrix\n=====================\n\n");
unsigned int i, j;
for (i=0; i<lines; i++) {
for (j=0; j<columns; j++) {
printf("#matrix[%d][%d]: %2.2f ", i,j,matrix[i][j]);
}
printf("\n");
}
printf("\n");
}
double determinant(double a[4][4],int n)
{
int i,j,j1,j2;
double det = 0;
double m[4][4];
if (n < 1) {
} else if (n == 1) {
det = a[0][0];
} else if (n == 2) {
det = a[0][0] * a[1][1] - a[1][0] * a[0][1];
} else {
det = 0;
for (j1=0;j1<n;j1++) {
for (i=0;i<n-1;i++)
for (i=1;i<n;i++) {
j2 = 0;
for (j=0;j<n;j++) {
if (j == j1)
continue;
m[i-1][j2] = a[i][j];
j2++;
}
}
det += internal_pow(-1.0,1.0+j1+1.0) * a[0][j1] * determinant(m,n-1);
}
}
return(det);
}
double fxp_determinant(fxp_t a_fxp[4][4],int n)
{
int i,j,j1,j2;
double a[4][4];
for(i=0; i<n;i++){
for(j=0; j<n;j++){
a[i][j]= fxp_to_double(a_fxp[i][j]);
}
}
double det = 0;
double m[4][4];
if (n < 1) {
} else if (n == 1) {
det = a[0][0];
} else if (n == 2) {
det = a[0][0] * a[1][1] - a[1][0] * a[0][1];
} else {
det = 0;
for (j1=0;j1<n;j1++) {
for (i=0;i<n-1;i++)
for (i=1;i<n;i++) {
j2 = 0;
for (j=0;j<n;j++) {
if (j == j1)
continue;
m[i-1][j2] = a[i][j];
j2++;
}
}
det += internal_pow(-1.0,1.0+j1+1.0) * a[0][j1] * determinant(m,n-1);
}
}
return(det);
}
void transpose(double a[4][4], double b[4][4],int n, int m)
{
int i,j;
for (i=0;i<n;i++) {
for (j=0;j<m;j++) {
b[j][i] = a[i][j];
}
}
}
void fxp_transpose(fxp_t a[4][4], fxp_t b[4][4],int n, int m)
{
int i,j;
for (i=0;i<n;i++) {
for (j=0;j<m;j++) {
b[j][i] = a[i][j];
}
}
}
# 24 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 1
# 19 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
extern int generic_timer;
extern hardware hw;
double generic_timing_shift_l_double(double zIn, double z[], int N) {
generic_timer += ((2 * hw.assembly.push) + (3 * hw.assembly.in) + (3 * hw.assembly.out) + (1 * hw.assembly.sbiw) + (1 * hw.assembly.cli) + (8 * hw.assembly.std));
int i;
double zOut;
zOut = z[0];
generic_timer += ((5 * hw.assembly.ldd) + (2 * hw.assembly.mov) + (4 * hw.assembly.std) + (1 * hw.assembly.ld));
generic_timer += ((2 * hw.assembly.std) + (1 * hw.assembly.rjmp));
for (i = 0; i < N - 1; i++) {
generic_timer += ((17 * hw.assembly.ldd) + (4 * hw.assembly.lsl) + (4 * hw.assembly.rol) + (2 * hw.assembly.add) + (2 * hw.assembly.adc) + (6 * hw.assembly.mov) + (2 * hw.assembly.adiw) + (5 * hw.assembly.std) + (1 * hw.assembly.ld) + (1 * hw.assembly.st) + (1 * hw.assembly.subi) + (1 * hw.assembly.sbc)+ (1 * hw.assembly.cp) + (1 * hw.assembly.cpc) + (1 * hw.assembly.brlt));
z[i] = z[i + 1];
}
z[N - 1] = zIn;
generic_timer += ((12 * hw.assembly.ldd) + (6 * hw.assembly.mov) + (3 * hw.assembly.std) + (2 * hw.assembly.lsl) + (2 * hw.assembly.rol) + (1 * hw.assembly.adc) + (1 * hw.assembly.add) + (1 * hw.assembly.subi) + (1 * hw.assembly.sbci) + (1 * hw.assembly.st) + (1 * hw.assembly.adiw) + (1 * hw.assembly.in)+ (1 * hw.assembly.cli));
generic_timer += ((3 * hw.assembly.out) + (2 * hw.assembly.pop) + (1 * hw.assembly.ret));
return (zOut);
}
double generic_timing_shift_r_double(double zIn, double z[], int N) {
generic_timer += ((2 * hw.assembly.push) + (3 * hw.assembly.in) + (3 * hw.assembly.out) + (1 * hw.assembly.sbiw) + (1 * hw.assembly.cli) + (8 * hw.assembly.std));
int i;
double zOut;
zOut = z[N - 1];
generic_timer += ((7 * hw.assembly.ldd) + (2 * hw.assembly.rol) + (2 * hw.assembly.lsl) + (2 * hw.assembly.mov) + (4 * hw.assembly.std) + (1 * hw.assembly.add) + (1 * hw.assembly.adc) + (1 * hw.assembly.ld) + (1 * hw.assembly.subi) + (1 * hw.assembly.sbci));
generic_timer += ((2 * hw.assembly.ldd) + (2 * hw.assembly.std) + (1 * hw.assembly.sbiw) + (1 * hw.assembly.rjmp));
for (i = N - 1; i > 0; i--) {
z[i] = z[i - 1];
generic_timer += ((15 * hw.assembly.ldd) + (4 * hw.assembly.lsl) + (4 * hw.assembly.rol) + (2 * hw.assembly.add) + (2 * hw.assembly.adc) + (4 * hw.assembly.mov) + (5 * hw.assembly.std) + (1 * hw.assembly.subi) + (1 * hw.assembly.sbci) + (1 * hw.assembly.ld) + (1 * hw.assembly.st) + (1 * hw.assembly.sbiw) + (1 * hw.assembly.cp) + (1 * hw.assembly.cpc) + (1 * hw.assembly.brlt));
}
z[0] = zIn;
generic_timer += ((10 * hw.assembly.ldd) + (5 * hw.assembly.mov) + (3 * hw.assembly.std) + (3 * hw.assembly.out) + (2 * hw.assembly.pop) + (1 * hw.assembly.ret) + (1 * hw.assembly.ret) + (1 * hw.assembly.cli) + (1 * hw.assembly.in) + (1 * hw.assembly.st) + (1 * hw.assembly.adiw));
return zOut;
}
fxp_t shiftL(fxp_t zIn, fxp_t z[], int N) {
int i;
fxp_t zOut;
zOut = z[0];
for (i = 0; i < N - 1; i++) {
z[i] = z[i + 1];
}
z[N - 1] = zIn;
return (zOut);
}
fxp_t shiftR(fxp_t zIn, fxp_t z[], int N) {
int i;
fxp_t zOut;
zOut = z[N - 1];
for (i = N - 1; i > 0; i--) {
z[i] = z[i - 1];
}
z[0] = zIn;
return zOut;
}
float shiftLfloat(float zIn, float z[], int N) {
int i;
float zOut;
zOut = z[0];
for (i = 0; i < N - 1; i++) {
z[i] = z[i + 1];
}
z[N - 1] = zIn;
return (zOut);
}
float shiftRfloat(float zIn, float z[], int N) {
int i;
float zOut;
zOut = z[N - 1];
for (i = N - 1; i > 0; i--) {
z[i] = z[i - 1];
}
z[0] = zIn;
return zOut;
}
double shiftRDdouble(double zIn, double z[], int N) {
int i;
double zOut;
zOut = z[0];
for (i = 0; i < N - 1; i++) {
z[i] = z[i + 1];
}
z[N - 1] = zIn;
return (zOut);
}
double shiftRdouble(double zIn, double z[], int N) {
int i;
double zOut;
zOut = z[N - 1];
for (i = N - 1; i > 0; i--) {
z[i] = z[i - 1];
}
z[0] = zIn;
return zOut;
}
double shiftLDouble(double zIn, double z[], int N) {
int i;
double zOut;
zOut = z[0];
for (i = 0; i < N - 1; i++) {
z[i] = z[i + 1];
}
z[N - 1] = zIn;
return (zOut);
}
void shiftLboth(float zfIn, float zf[], fxp_t zIn, fxp_t z[], int N) {
int i;
fxp_t zOut;
float zfOut;
zOut = z[0];
zfOut = zf[0];
for (i = 0; i < N - 1; i++) {
z[i] = z[i + 1];
zf[i] = zf[i + 1];
}
z[N - 1] = zIn;
zf[N - 1] = zfIn;
}
void shiftRboth(float zfIn, float zf[], fxp_t zIn, fxp_t z[], int N) {
int i;
fxp_t zOut;
float zfOut;
zOut = z[N - 1];
zfOut = zf[N - 1];
for (i = N - 1; i > 0; i--) {
z[i] = z[i - 1];
zf[i] = zf[i - 1];
}
z[0] = zIn;
zf[0] = zfIn;
}
int order(int Na, int Nb) {
return Na > Nb ? Na - 1 : Nb - 1;
}
void fxp_check_limit_cycle(fxp_t y[], int y_size){
fxp_t reference = y[y_size - 1];
int idx = 0;
int window_size = 1;
for(idx = (y_size-2); idx >= 0; idx--){
if (y[idx] != reference){
window_size++;
}else{
break;
}
}
__DSVERIFIER_assume(window_size != y_size && window_size != 1);
printf("window_size %d\n", window_size);
int desired_elements = 2 * window_size;
int found_elements = 0;
for(idx = (y_size-1); idx >= 0; idx--){
if (idx > (y_size-window_size-1)){
printf("%.0f == %.0f\n", y[idx], y[idx-window_size]);
int cmp_idx = idx - window_size;
if ((cmp_idx > 0) && (y[idx] == y[idx-window_size])){
found_elements = found_elements + 2;
}else{
break;
}
}
}
__DSVERIFIER_assume(found_elements > 0);
printf("desired_elements %d\n", desired_elements);
printf("found_elements %d\n", found_elements);
__DSVERIFIER_assume(found_elements == desired_elements);
__DSVERIFIER_assert(0);
}
void fxp_check_persistent_limit_cycle(fxp_t * y, int y_size){
int idy = 0;
int count_same = 0;
int window_size = 0;
fxp_t reference = y[0];
for(idy = 0; idy < y_size; idy++){
if (y[idy] != reference){
window_size++;
} else if (window_size != 0){
break;
} else {
count_same++;
}
}
window_size += count_same;
__DSVERIFIER_assume(window_size > 1 && window_size <= y_size/2);
fxp_t lco_elements[window_size];
for(idy = 0; idy < y_size; idy++){
if (idy < window_size){
lco_elements[idy] = y[idy];
}
}
idy = 0;
int lco_idy = 0;
_Bool is_persistent = 0;
while (idy < y_size){
if(y[idy++] == lco_elements[lco_idy++]){
is_persistent = 1;
}else{
is_persistent = 0;
break;
}
if (lco_idy == window_size){
lco_idy = 0;
}
}
__DSVERIFIER_assert(is_persistent == 0);
}
void fxp_check_oscillations(fxp_t y[] , int y_size){
__DSVERIFIER_assume((y[0] != y[y_size - 1]) && (y[y_size - 1] != y[y_size - 2]));
int window_timer = 0;
int window_count = 0;
int i, j;
for (i = 2; i < y_size; i++){
int window_size = i;
for(j=0; j<y_size; j++){
if (window_timer > window_size){
window_timer = 0;
window_count = 0;
}
int window_index = j + window_size;
if (window_index < y_size){
if (y[j] == y[window_index]){
window_count++;
__DSVERIFIER_assert(!(window_count == window_size));
}
}else{
break;
}
window_timer++;
}
}
}
int fxp_ln(int x) {
int t, y;
y = 0xa65af;
if (x < 0x00008000)
x <<= 16, y -= 0xb1721;
if (x < 0x00800000)
x <<= 8, y -= 0x58b91;
if (x < 0x08000000)
x <<= 4, y -= 0x2c5c8;
if (x < 0x20000000)
x <<= 2, y -= 0x162e4;
if (x < 0x40000000)
x <<= 1, y -= 0x0b172;
t = x + (x >> 1);
if ((t & 0x80000000) == 0)
x = t, y -= 0x067cd;
t = x + (x >> 2);
if ((t & 0x80000000) == 0)
x = t, y -= 0x03920;
t = x + (x >> 3);
if ((t & 0x80000000) == 0)
x = t, y -= 0x01e27;
t = x + (x >> 4);
if ((t & 0x80000000) == 0)
x = t, y -= 0x00f85;
t = x + (x >> 5);
if ((t & 0x80000000) == 0)
x = t, y -= 0x007e1;
t = x + (x >> 6);
if ((t & 0x80000000) == 0)
x = t, y -= 0x003f8;
t = x + (x >> 7);
if ((t & 0x80000000) == 0)
x = t, y -= 0x001fe;
x = 0x80000000 - x;
y -= x >> 15;
return y;
}
double fxp_log10_low(double x) {
int xint = (int) (x * 65536.0 + 0.5);
int lnum = fxp_ln(xint);
int lden = fxp_ln(655360);
return ((double) lnum / (double) lden);
}
double fxp_log10(double x) {
if (x > 32767.0) {
if (x > 1073676289.0) {
x = x / 1073676289.0;
return fxp_log10_low(x) + 9.030873362;
}
x = x / 32767.0;
return fxp_log10_low(x) + 4.515436681;
}
return fxp_log10_low(x);
}
float snrVariance(float s[], float n[], int blksz) {
int i;
double sm = 0, nm = 0, sv = 0, nv = 0, snr;
for (i = 0; i < blksz; i++) {
sm += s[i];
nm += n[i];
}
sm /= blksz;
nm /= blksz;
for (i = 0; i < blksz; i++) {
sv += (s[i] - sm) * (s[i] - sm);
nv += (n[i] - nm) * (n[i] - nm);
}
if (nv != 0.0f) {
# 373 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
((void) sizeof ((
# 373 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
sv >= nv
# 373 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 373 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
sv >= nv
# 373 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ; else __assert_fail (
# 373 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
"sv >= nv"
# 373 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h", 373, __extension__ __PRETTY_FUNCTION__); }))
# 373 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
;
snr = sv / nv;
return snr;
} else {
return 9999.9f;
}
}
float snrPower(float s[], float n[], int blksz) {
int i;
double sv = 0, nv = 0, snr;
for (i = 0; i < blksz; i++) {
sv += s[i] * s[i];
nv += n[i] * n[i];
}
if (nv != 0.0f) {
# 394 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
((void) sizeof ((
# 394 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
sv >= nv
# 394 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 394 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
sv >= nv
# 394 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ; else __assert_fail (
# 394 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
"sv >= nv"
# 394 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h", 394, __extension__ __PRETTY_FUNCTION__); }))
# 394 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
;
snr = sv / nv;
return snr;
} else {
return 9999.9f;
}
}
float snrPoint(float s[], float n[], int blksz) {
int i;
double ratio = 0, power = 0;
for (i = 0; i < blksz; i++) {
if(n[i] == 0) continue;
ratio = s[i] / n[i];
if(ratio > 150.0f || ratio < -150.0f) continue;
power = ratio * ratio;
# 412 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
((void) sizeof ((
# 412 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
power >= 1.0f
# 412 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 412 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
power >= 1.0f
# 412 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ; else __assert_fail (
# 412 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
"power >= 1.0f"
# 412 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h", 412, __extension__ __PRETTY_FUNCTION__); }))
# 412 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
;
}
return 9999.9f;
}
unsigned long next = 1;
int rand(void)
{
next = next*1103515245 + 12345;
return (unsigned int)(next/65536) % 32768;
}
void srand(unsigned int seed)
{
next = seed;
}
float iirIIOutTime(float w[], float x, float a[], float b[], int Na, int Nb) {
int timer1 = 0;
float *a_ptr, *b_ptr, *w_ptr;
float sum = 0;
a_ptr = &a[1];
b_ptr = &b[0];
w_ptr = &w[1];
int k, j;
timer1 += 71;
for (j = 1; j < Na; j++) {
w[0] -= *a_ptr++ * *w_ptr++;
timer1 += 54;
}
w[0] += x;
w_ptr = &w[0];
for (k = 0; k < Nb; k++) {
sum += *b_ptr++ * *w_ptr++;
timer1 += 46;
}
timer1 += 38;
# 450 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
((void) sizeof ((
# 450 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
(double)timer1*1 / 16000000 <= (double)1 / 100
# 450 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 450 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
(double)timer1*1 / 16000000 <= (double)1 / 100
# 450 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ; else __assert_fail (
# 450 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
"(double)timer1*CYCLE <= (double)DEADLINE"
# 450 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h", 450, __extension__ __PRETTY_FUNCTION__); }))
# 450 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
;
return sum;
}
float iirIItOutTime(float w[], float x, float a[], float b[], int Na, int Nb) {
int timer1 = 0;
float *a_ptr, *b_ptr;
float yout = 0;
a_ptr = &a[1];
b_ptr = &b[0];
int Nw = Na > Nb ? Na : Nb;
yout = (*b_ptr++ * x) + w[0];
int j;
timer1 += 105;
for (j = 0; j < Nw - 1; j++) {
w[j] = w[j + 1];
if (j < Na - 1) {
w[j] -= *a_ptr++ * yout;
timer1 += 41;
}
if (j < Nb - 1) {
w[j] += *b_ptr++ * x;
timer1 += 38;
}
timer1 += 54;
}
timer1 += 7;
# 477 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
((void) sizeof ((
# 477 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
(double)timer1*1 / 16000000 <= (double)1 / 100
# 477 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 477 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
(double)timer1*1 / 16000000 <= (double)1 / 100
# 477 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ; else __assert_fail (
# 477 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
"(double)timer1*CYCLE <= (double)DEADLINE"
# 477 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h", 477, __extension__ __PRETTY_FUNCTION__); }))
# 477 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
;
return yout;
}
double iirIItOutTime_double(double w[], double x, double a[], double b[], int Na, int Nb) {
int timer1 = 0;
double *a_ptr, *b_ptr;
double yout = 0;
a_ptr = &a[1];
b_ptr = &b[0];
int Nw = Na > Nb ? Na : Nb;
yout = (*b_ptr++ * x) + w[0];
int j;
timer1 += 105;
for (j = 0; j < Nw - 1; j++) {
w[j] = w[j + 1];
if (j < Na - 1) {
w[j] -= *a_ptr++ * yout;
timer1 += 41;
}
if (j < Nb - 1) {
w[j] += *b_ptr++ * x;
timer1 += 38;
}
timer1 += 54;
}
timer1 += 7;
# 504 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
((void) sizeof ((
# 504 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
(double)timer1*1 / 16000000 <= (double)1 / 100
# 504 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 504 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
(double)timer1*1 / 16000000 <= (double)1 / 100
# 504 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ; else __assert_fail (
# 504 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
"(double)timer1*CYCLE <= (double)DEADLINE"
# 504 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h", 504, __extension__ __PRETTY_FUNCTION__); }))
# 504 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
;
return yout;
}
void iirOutBoth(float yf[], float xf[], float af[], float bf[], float *sumf_ref,
fxp_t y[], fxp_t x[], fxp_t a[], fxp_t b[], fxp_t *sum_ref, int Na, int Nb) {
fxp_t *a_ptr, *y_ptr, *b_ptr, *x_ptr;
float *af_ptr, *yf_ptr, *bf_ptr, *xf_ptr;
fxp_t sum = 0;
float sumf = 0;
a_ptr = &a[1];
y_ptr = &y[Na - 1];
b_ptr = &b[0];
x_ptr = &x[Nb - 1];
af_ptr = &af[1];
yf_ptr = &yf[Na - 1];
bf_ptr = &bf[0];
xf_ptr = &xf[Nb - 1];
int i, j;
for (i = 0; i < Nb; i++) {
sum = fxp_add(sum, fxp_mult(*b_ptr++, *x_ptr--));
sumf += *bf_ptr++ * *xf_ptr--;
}
for (j = 1; j < Na; j++) {
sum = fxp_sub(sum, fxp_mult(*a_ptr++, *y_ptr--));
sumf -= *af_ptr++ * *yf_ptr--;
}
*sum_ref = sum;
*sumf_ref = sumf;
}
fxp_t iirOutFixedL(fxp_t y[], fxp_t x[], fxp_t xin, fxp_t a[], fxp_t b[], int Na, int Nb) {
fxp_t *a_ptr, *y_ptr, *b_ptr, *x_ptr;
fxp_t sum = 0;
a_ptr = &a[Na - 1];
y_ptr = &y[1];
b_ptr = &b[Nb - 1];
x_ptr = &x[0];
int i, j;
for (i = 0; i < Nb - 1; i++) {
x[i] = x[i+1];
sum = fxp_add(sum, fxp_mult(*b_ptr--, *x_ptr++));
}
x[Nb - 1] = xin;
sum = fxp_add(sum, fxp_mult(*b_ptr--, *x_ptr++));
for (j = 1; j < Na - 1; j++) {
sum = fxp_sub(sum, fxp_mult(*a_ptr--, *y_ptr++));
y[j] = y[j+1];
}
if(Na>1) sum = fxp_sub(sum, fxp_mult(*a_ptr--, *y_ptr++));
y[Na - 1] = sum;
return sum;
}
float iirOutFloatL(float y[], float x[], float xin, float a[], float b[], int Na, int Nb) {
float *a_ptr, *y_ptr, *b_ptr, *x_ptr;
float sum = 0;
a_ptr = &a[Na - 1];
y_ptr = &y[1];
b_ptr = &b[Nb - 1];
x_ptr = &x[0];
int i, j;
for (i = 0; i < Nb - 1; i++) {
x[i] = x[i+1];
sum += *b_ptr-- * *x_ptr++;
}
x[Nb - 1] = xin;
sum += *b_ptr-- * *x_ptr++;
for (j = 1; j < Na - 1; j++) {
sum -= *a_ptr-- * *y_ptr++;
y[j] = y[j+1];
}
if(Na>1) sum -= *a_ptr-- * *y_ptr++;
y[Na - 1] = sum;
return sum;
}
float iirOutBothL(float yf[], float xf[], float af[], float bf[], float xfin,
fxp_t y[], fxp_t x[], fxp_t a[], fxp_t b[], fxp_t xin, int Na, int Nb) {
fxp_t *a_ptr, *y_ptr, *b_ptr, *x_ptr;
fxp_t sum = 0;
a_ptr = &a[Na - 1];
y_ptr = &y[1];
b_ptr = &b[Nb - 1];
x_ptr = &x[0];
float *af_ptr, *yf_ptr, *bf_ptr, *xf_ptr;
float sumf = 0;
af_ptr = &af[Na - 1];
yf_ptr = &yf[1];
bf_ptr = &bf[Nb - 1];
xf_ptr = &xf[0];
int i, j;
for (i = 0; i < Nb - 1; i++) {
x[i] = x[i+1];
sum = fxp_add(sum, fxp_mult(*b_ptr--, *x_ptr++));
xf[i] = xf[i+1];
sumf += *bf_ptr-- * *xf_ptr++;
}
x[Nb - 1] = xin;
sum = fxp_add(sum, fxp_mult(*b_ptr--, *x_ptr++));
xf[Nb - 1] = xfin;
sumf += *bf_ptr-- * *xf_ptr++;
for (j = 1; j < Na - 1; j++) {
sum = fxp_sub(sum, fxp_mult(*a_ptr--, *y_ptr++));
y[j] = y[j+1];
sumf -= *af_ptr-- * *yf_ptr++;
yf[j] = yf[j+1];
}
if(Na>1) sum = fxp_sub(sum, fxp_mult(*a_ptr--, *y_ptr++));
y[Na - 1] = sum;
if(Na>1) sumf -= *af_ptr-- * *yf_ptr++;
yf[Na - 1] = sumf;
return fxp_to_float(sum) - sumf;
}
float iirOutBothL2(float yf[], float xf[], float af[], float bf[], float xfin,
fxp_t y[], fxp_t x[], fxp_t a[], fxp_t b[], fxp_t xin, int Na, int Nb) {
fxp_t *a_ptr, *y_ptr, *b_ptr, *x_ptr;
fxp_t sum = 0;
a_ptr = &a[Na - 1];
y_ptr = &y[1];
b_ptr = &b[Nb - 1];
x_ptr = &x[0];
float *af_ptr, *yf_ptr, *bf_ptr, *xf_ptr;
float sumf = 0;
af_ptr = &af[Na - 1];
yf_ptr = &yf[1];
bf_ptr = &bf[Nb - 1];
xf_ptr = &xf[0];
int i=0, j=1;
for (i = 0; i < Nb - 1; i++) {
x[i] = x[i+1];
sum = fxp_add(sum, fxp_mult(b[Nb - 1 - i], x[i]));
xf[i] = xf[i+1];
sumf += bf[Nb - 1 - i] * xf[i];
}
x[Nb - 1] = xin;
sum = fxp_add(sum, fxp_mult(b[Nb - 1 - i], x[i]));
xf[Nb - 1] = xfin;
sumf += bf[Nb - 1 - i] * xf[i];
for (j = 1; j < Na - 1; j++) {
sum = fxp_sub(sum, fxp_mult(a[Na - j], y[j]));
y[j] = y[j+1];
sumf -= af[Na - j] * yf[j];
yf[j] = yf[j+1];
}
if(Na>1) sum = fxp_sub(sum, fxp_mult(a[Na - j], y[j]));
y[Na - 1] = sum;
if(Na>1) sumf -= af[Na - j] * yf[j];
yf[Na - 1] = sumf;
return fxp_to_float(sum) - sumf;
}
# 25 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 1
# 19 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
extern digital_system ds;
extern hardware hw;
extern int generic_timer;
fxp_t fxp_direct_form_1(fxp_t y[], fxp_t x[], fxp_t a[], fxp_t b[], int Na, int Nb) {
fxp_t *a_ptr, *y_ptr, *b_ptr, *x_ptr;
fxp_t sum = 0;
a_ptr = &a[1];
y_ptr = &y[Na - 1];
b_ptr = &b[0];
x_ptr = &x[Nb - 1];
int i, j;
for (i = 0; i < Nb; i++) {
sum = fxp_add(sum, fxp_mult(*b_ptr++, *x_ptr--));
}
for (j = 1; j < Na; j++) {
sum = fxp_sub(sum, fxp_mult(*a_ptr++, *y_ptr--));
}
fxp_verify_overflow_node(sum, "An Overflow Occurred in the node a0");
sum = fxp_div(sum,a[0]);
return fxp_quantize(sum);
}
fxp_t fxp_direct_form_2(fxp_t w[], fxp_t x, fxp_t a[], fxp_t b[], int Na, int Nb) {
fxp_t *a_ptr, *b_ptr, *w_ptr;
fxp_t sum = 0;
a_ptr = &a[1];
b_ptr = &b[0];
w_ptr = &w[1];
int k, j;
for (j = 1; j < Na; j++) {
w[0] = fxp_sub(w[0], fxp_mult(*a_ptr++, *w_ptr++));
}
w[0] = fxp_add(w[0], x);
w[0] = fxp_div(w[0], a[0]);
fxp_verify_overflow_node(w[0], "An Overflow Occurred in the node b0");
w_ptr = &w[0];
for (k = 0; k < Nb; k++) {
sum = fxp_add(sum, fxp_mult(*b_ptr++, *w_ptr++));
}
return fxp_quantize(sum);
}
fxp_t fxp_transposed_direct_form_2(fxp_t w[], fxp_t x, fxp_t a[], fxp_t b[], int Na, int Nb) {
fxp_t *a_ptr, *b_ptr;
fxp_t yout = 0;
a_ptr = &a[1];
b_ptr = &b[0];
int Nw = Na > Nb ? Na : Nb;
yout = fxp_add(fxp_mult(*b_ptr++, x), w[0]);
yout = fxp_div(yout, a[0]);
int j;
for (j = 0; j < Nw - 1; j++) {
w[j] = w[j + 1];
if (j < Na - 1) {
w[j] = fxp_sub(w[j], fxp_mult(*a_ptr++, yout));
}
if (j < Nb - 1) {
w[j] = fxp_add(w[j], fxp_mult(*b_ptr++, x));
}
}
fxp_verify_overflow_node(w[j], "An Overflow Occurred in the node a0");
return fxp_quantize(yout);
}
double double_direct_form_1(double y[], double x[], double a[], double b[], int Na, int Nb) {
double *a_ptr, *y_ptr, *b_ptr, *x_ptr;
double sum = 0;
a_ptr = &a[1];
y_ptr = &y[Na - 1];
b_ptr = &b[0];
x_ptr = &x[Nb - 1];
int i, j;
for (i = 0; i < Nb; i++) {
sum += *b_ptr++ * *x_ptr--;
}
for (j = 1; j < Na; j++) {
sum -= *a_ptr++ * *y_ptr--;
}
sum = (sum / a[0]);
return sum;
}
double double_direct_form_2(double w[], double x, double a[], double b[], int Na, int Nb) {
double *a_ptr, *b_ptr, *w_ptr;
double sum = 0;
a_ptr = &a[1];
b_ptr = &b[0];
w_ptr = &w[1];
int k, j;
for (j = 1; j < Na; j++) {
w[0] -= *a_ptr++ * *w_ptr++;
}
w[0] += x;
w[0] = w[0] / a[0];
w_ptr = &w[0];
for (k = 0; k < Nb; k++) {
sum += *b_ptr++ * *w_ptr++;
}
return sum;
}
double double_transposed_direct_form_2(double w[], double x, double a[], double b[], int Na, int Nb) {
double *a_ptr, *b_ptr;
double yout = 0;
a_ptr = &a[1];
b_ptr = &b[0];
int Nw = Na > Nb ? Na : Nb;
yout = (*b_ptr++ * x) + w[0];
yout = yout / a[0];
int j;
for (j = 0; j < Nw - 1; j++) {
w[j] = w[j + 1];
if (j < Na - 1) {
w[j] -= *a_ptr++ * yout;
}
if (j < Nb - 1) {
w[j] += *b_ptr++ * x;
}
}
return yout;
}
float float_direct_form_1(float y[], float x[], float a[], float b[], int Na, int Nb) {
float *a_ptr, *y_ptr, *b_ptr, *x_ptr;
float sum = 0;
a_ptr = &a[1];
y_ptr = &y[Na - 1];
b_ptr = &b[0];
x_ptr = &x[Nb - 1];
int i, j;
for (i = 0; i < Nb; i++) {
sum += *b_ptr++ * *x_ptr--;
}
for (j = 1; j < Na; j++) {
sum -= *a_ptr++ * *y_ptr--;
}
sum = (sum / a[0]);
return sum;
}
float float_direct_form_2(float w[], float x, float a[], float b[], int Na, int Nb) {
float *a_ptr, *b_ptr, *w_ptr;
float sum = 0;
a_ptr = &a[1];
b_ptr = &b[0];
w_ptr = &w[1];
int k, j;
for (j = 1; j < Na; j++) {
w[0] -= *a_ptr++ * *w_ptr++;
}
w[0] += x;
w[0] = w[0] / a[0];
w_ptr = &w[0];
for (k = 0; k < Nb; k++) {
sum += *b_ptr++ * *w_ptr++;
}
return sum;
}
float float_transposed_direct_form_2(float w[], float x, float a[], float b[], int Na, int Nb) {
float *a_ptr, *b_ptr;
float yout = 0;
a_ptr = &a[1];
b_ptr = &b[0];
int Nw = Na > Nb ? Na : Nb;
yout = (*b_ptr++ * x) + w[0];
yout = yout / a[0];
int j;
for (j = 0; j < Nw - 1; j++) {
w[j] = w[j + 1];
if (j < Na - 1) {
w[j] -= *a_ptr++ * yout;
}
if (j < Nb - 1) {
w[j] += *b_ptr++ * x;
}
}
return yout;
}
double double_direct_form_1_MSP430(double y[], double x[], double a[], double b[], int Na, int Nb){
int timer1 = 0;
double *a_ptr, *y_ptr, *b_ptr, *x_ptr;
double sum = 0;
a_ptr = &a[1];
y_ptr = &y[Na-1];
b_ptr = &b[0];
x_ptr = &x[Nb-1];
int i, j;
timer1 += 91;
for (i = 0; i < Nb; i++){
sum += *b_ptr++ * *x_ptr--;
timer1 += 47;
}
for (j = 1; j < Na; j++){
sum -= *a_ptr++ * *y_ptr--;
timer1 += 57;
}
timer1 += 3;
# 235 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
((void) sizeof ((
# 235 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
(double) timer1 * hw.cycle <= ds.sample_time
# 235 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 235 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
(double) timer1 * hw.cycle <= ds.sample_time
# 235 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
) ; else __assert_fail (
# 235 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
"(double) timer1 * hw.cycle <= ds.sample_time"
# 235 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h", 235, __extension__ __PRETTY_FUNCTION__); }))
# 235 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
;
return sum;
}
double double_direct_form_2_MSP430(double w[], double x, double a[], double b[], int Na, int Nb) {
int timer1 = 0;
double *a_ptr, *b_ptr, *w_ptr;
double sum = 0;
a_ptr = &a[1];
b_ptr = &b[0];
w_ptr = &w[1];
int k, j;
timer1 += 71;
for (j = 1; j < Na; j++) {
w[0] -= *a_ptr++ * *w_ptr++;
timer1 += 54;
}
w[0] += x;
w[0] = w[0] / a[0];
w_ptr = &w[0];
for (k = 0; k < Nb; k++) {
sum += *b_ptr++ * *w_ptr++;
timer1 += 46;
}
timer1 += 38;
# 262 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
((void) sizeof ((
# 262 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
(double) timer1 * hw.cycle <= ds.sample_time
# 262 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 262 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
(double) timer1 * hw.cycle <= ds.sample_time
# 262 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
) ; else __assert_fail (
# 262 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
"(double) timer1 * hw.cycle <= ds.sample_time"
# 262 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h", 262, __extension__ __PRETTY_FUNCTION__); }))
# 262 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
;
return sum;
}
double double_transposed_direct_form_2_MSP430(double w[], double x, double a[], double b[], int Na, int Nb) {
int timer1 = 0;
double *a_ptr, *b_ptr;
double yout = 0;
a_ptr = &a[1];
b_ptr = &b[0];
int Nw = Na > Nb ? Na : Nb;
yout = (*b_ptr++ * x) + w[0];
int j;
timer1 += 105;
for (j = 0; j < Nw - 1; j++) {
w[j] = w[j + 1];
if (j < Na - 1) {
w[j] -= *a_ptr++ * yout;
timer1 += 41;
}
if (j < Nb - 1) {
w[j] += *b_ptr++ * x;
timer1 += 38;
}
timer1 += 54;
}
timer1 += 7;
# 291 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
((void) sizeof ((
# 291 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
(double) timer1 * hw.cycle <= ds.sample_time
# 291 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 291 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
(double) timer1 * hw.cycle <= ds.sample_time
# 291 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
) ; else __assert_fail (
# 291 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
"(double) timer1 * hw.cycle <= ds.sample_time"
# 291 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h", 291, __extension__ __PRETTY_FUNCTION__); }))
# 291 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
;
return yout;
}
double generic_timing_double_direct_form_1(double y[], double x[], double a[], double b[], int Na, int Nb){
generic_timer += ((6 * hw.assembly.push) + (3 * hw.assembly.in) + (1 * hw.assembly.sbiw) + (1 * hw.assembly.cli) + (3 * hw.assembly.out) + (12 * hw.assembly.std));
double *a_ptr, *y_ptr, *b_ptr, *x_ptr;
double sum = 0;
a_ptr = &a[1];
y_ptr = &y[Na-1];
b_ptr = &b[0];
x_ptr = &x[Nb-1];
generic_timer += ((12 * hw.assembly.std) + (12 * hw.assembly.ldd) + (2 * hw.assembly.subi) + (2 * hw.assembly.sbci) + (4 * hw.assembly.lsl) + (4 * hw.assembly.rol) + (2 * hw.assembly.add) + (2 * hw.assembly.adc) + (1 * hw.assembly.adiw));
int i, j;
generic_timer += ((2 * hw.assembly.std) + (1 * hw.assembly.rjmp));
for (i = 0; i < Nb; i++){
generic_timer += ((20 * hw.assembly.ldd) + (24 * hw.assembly.mov) + (2 * hw.assembly.subi) + (1 * hw.assembly.sbci) + (1 * hw.assembly.sbc) + (10 * hw.assembly.std) + (2 * hw.assembly.ld) + (2 * hw.assembly.rcall) + (1 * hw.assembly.adiw) + (1 * hw.assembly.cp) + (1 * hw.assembly.cpc) + (1 * hw.assembly.adiw) + (1 * hw.assembly.brge) + (1 * hw.assembly.rjmp));
sum += *b_ptr++ * *x_ptr--;
}
generic_timer += ((2 * hw.assembly.ldi) + (2 * hw.assembly.std) + (1 * hw.assembly.rjmp));
for (j = 1; j < Na; j++){
generic_timer += ((22 * hw.assembly.ldd) + (24 * hw.assembly.mov) + (2 * hw.assembly.subi) + (8 * hw.assembly.std) + (1 * hw.assembly.sbci) + (2 * hw.assembly.ld) + (2 * hw.assembly.rcall) + (1 * hw.assembly.sbc) + (1 * hw.assembly.adiw) + (1 * hw.assembly.cp) + (1 * hw.assembly.cpc) + (1 * hw.assembly.adiw) + (1 * hw.assembly.brge) + (1 * hw.assembly.rjmp));
sum -= *a_ptr++ * *y_ptr--;
}
generic_timer += ((4 * hw.assembly.ldd) + (4 * hw.assembly.mov) + (1 * hw.assembly.adiw) + (1 * hw.assembly.in) + (1 * hw.assembly.cli) + (3 * hw.assembly.out) + (6 * hw.assembly.pop) + (1 * hw.assembly.ret));
return sum;
}
double generic_timing_double_direct_form_2(double w[], double x, double a[], double b[], int Na, int Nb) {
generic_timer += ((8 * hw.assembly.push) + (14 * hw.assembly.std) + (3 * hw.assembly.out) + (3 * hw.assembly.in) + (1 * hw.assembly.sbiw) + (1 * hw.assembly.cli));
double *a_ptr, *b_ptr, *w_ptr;
double sum = 0;
a_ptr = &a[1];
b_ptr = &b[0];
w_ptr = &w[1];
int k, j;
generic_timer += ((10 * hw.assembly.std) + (6 * hw.assembly.ldd) + (2 * hw.assembly.adiw));
generic_timer += ((2 * hw.assembly.ldi) + (2 * hw.assembly.std) + (1 * hw.assembly.rjmp));
for (j = 1; j < Na; j++) {
w[0] -= *a_ptr++ * *w_ptr++;
generic_timer += ((23 * hw.assembly.ldd) + (32 * hw.assembly.mov) + (9 * hw.assembly.std) + (2 * hw.assembly.subi) + (3 * hw.assembly.ld) + (2 * hw.assembly.rcall) + (2 * hw.assembly.sbci) + (1 * hw.assembly.st) + (1 * hw.assembly.adiw) + (1 * hw.assembly.cp) + (1 * hw.assembly.cpc) + (1 * hw.assembly.brge));
}
w[0] += x;
w_ptr = &w[0];
generic_timer += ((13 * hw.assembly.ldd) + (12 * hw.assembly.mov) + (5 * hw.assembly.std) + (1 * hw.assembly.st) + (1 * hw.assembly.ld) + (1 * hw.assembly.rcall));
generic_timer += ((2 * hw.assembly.std) + (1 * hw.assembly.rjmp));
for (k = 0; k < Nb; k++) {
sum += *b_ptr++ * *w_ptr++;
generic_timer += ((20 * hw.assembly.ldd) + (24 * hw.assembly.mov) + (10 * hw.assembly.std) + (2 * hw.assembly.rcall) + (2 * hw.assembly.ld) + (2 * hw.assembly.subi) + (2 * hw.assembly.sbci) + (1 * hw.assembly.adiw) + (1 * hw.assembly.cp) + (1 * hw.assembly.cpc) + (1 * hw.assembly.brge) + (1 * hw.assembly.rjmp));
}
generic_timer += ((4 * hw.assembly.ldd) + (4 * hw.assembly.mov) + (1 * hw.assembly.adiw) + (1 * hw.assembly.in) + (1 * hw.assembly.cli) + (3 * hw.assembly.out) + (8 * hw.assembly.pop) + (1 * hw.assembly.ret));
return sum;
}
double generic_timing_double_transposed_direct_form_2(double w[], double x, double a[], double b[], int Na, int Nb) {
generic_timer += ((8 * hw.assembly.push) + (14 * hw.assembly.std) + (3 * hw.assembly.out) + (3 * hw.assembly.in) + (1 * hw.assembly.sbiw) + (1 * hw.assembly.cli));
double *a_ptr, *b_ptr;
double yout = 0;
a_ptr = &a[1];
b_ptr = &b[0];
int Nw = Na > Nb ? Na : Nb;
yout = (*b_ptr++ * x) + w[0];
int j;
generic_timer += ((15 * hw.assembly.std) + (22 * hw.assembly.ldd) + (24 * hw.assembly.mov) + (2 * hw.assembly.rcall) + (2 * hw.assembly.ld) + (1 * hw.assembly.cp) + (1 * hw.assembly.cpc) + (1 * hw.assembly.subi) + (1 * hw.assembly.sbci) + (1 * hw.assembly.brge) + (1 * hw.assembly.adiw));
generic_timer += ((2 * hw.assembly.std) + (1 * hw.assembly.rjmp));
for (j = 0; j < Nw - 1; j++) {
w[j] = w[j + 1];
if (j < Na - 1) {
w[j] -= *a_ptr++ * yout;
}
if (j < Nb - 1) {
w[j] += *b_ptr++ * x;
}
generic_timer += ((70 * hw.assembly.mov) + (65 * hw.assembly.ldd) + (12 * hw.assembly.lsl) + (12 * hw.assembly.rol) + (15 * hw.assembly.std) + (6 * hw.assembly.add) + (6 * hw.assembly.adc) + (2 * hw.assembly.adiw) + (3 * hw.assembly.cpc) + (3 * hw.assembly.cp) + (5 * hw.assembly.ld) + (4 * hw.assembly.rcall) + (5 * hw.assembly.subi) + (3 * hw.assembly.rjmp) + (2 * hw.assembly.brlt) + (3 * hw.assembly.st) + (2 * hw.assembly.sbci) + (3 * hw.assembly.sbc) + (1 * hw.assembly.brge));
}
generic_timer += ((4 * hw.assembly.ldd) + (4 * hw.assembly.mov) + (8 * hw.assembly.pop) + (3 * hw.assembly.out) + (1 * hw.assembly.in) + (1 * hw.assembly.cli) + (1 * hw.assembly.adiw) + (1 * hw.assembly.ret));
return yout;
}
void double_direct_form_1_impl2(double x[], int x_size, double b[], int b_size, double a[], int a_size, double y[]){
int i = 0; int j = 0;
double v[x_size];
for(i = 0; i < x_size; i++){
v[i] = 0;
for(j = 0; j < b_size; j++){
if (j > i) break;
v[i] = v[i] + x[i-j] * b[j];
}
}
y[0] = v[0];
for(i = 1; i < x_size; i++){
y[i] = 0;
y[i] = y[i] + v[i];
for(j = 1; j < a_size; j++){
if (j > i) break;
y[i] = y[i] + y[i-j] * ((-1) * a[j]);
}
}
}
void fxp_direct_form_1_impl2(fxp_t x[], int x_size, fxp_t b[], int b_size, fxp_t a[], int a_size, fxp_t y[]){
int i = 0; int j = 0;
fxp_t v[x_size];
for(i = 0; i < x_size; i++){
v[i] = 0;
for(j = 0; j < b_size; j++){
if (j > i) break;
v[i] = fxp_add(v[i], fxp_mult(x[i-j], b[j]));
}
}
y[0] = v[0];
for(i = 1; i < x_size; i++){
y[i] = 0;
y[i] = fxp_add(y[i], v[i]);
for(j = 1; j < a_size; j++){
if (j > i) break;
y[i] = fxp_add(y[i], fxp_mult(y[i-j] , -a[j]));
}
}
}
# 26 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/delta-operator.h" 1
# 19 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/delta-operator.h"
# 1 "/usr/include/assert.h" 1 3 4
# 20 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/delta-operator.h" 2
# 1 "/usr/include/assert.h" 1 3 4
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/delta-operator.h" 2
int nchoosek(int n, int k){
if (k == 0)
return 1;
return (n * nchoosek(n - 1, k - 1)) / k;
}
void generate_delta_coefficients(double vetor[], double out[], int n, double delta){
int i,j;
int N = n - 1;
double sum_delta_operator;
for(i=0; i<=N; i++)
{
sum_delta_operator = 0;
for(j=0; j<=i; j++)
{
sum_delta_operator = sum_delta_operator + vetor[j]*nchoosek(N-j,i-j);
}
out[i] = internal_pow(delta,N-i)*sum_delta_operator;
}
}
void get_delta_transfer_function(double b[], double b_out[], int b_size, double a[], double a_out[], int a_size, double delta){
generate_delta_coefficients(b, b_out, b_size, delta);
generate_delta_coefficients(a, a_out, a_size, delta);
}
void get_delta_transfer_function_with_base(double b[], double b_out[], int b_size, double a[], double a_out[], int a_size, double delta){
int i,j;
int N = a_size - 1;
int M = b_size - 1;
double sum_delta_operator;
for(i=0; i<=N; i++)
{
sum_delta_operator = 0;
for(j=0; j<=i; j++)
{
sum_delta_operator = sum_delta_operator + a[j]*nchoosek(N-j,i-j);
}
a_out[i] = internal_pow(delta,N-i)*sum_delta_operator;
}
for(i=0; i<=M; i++)
{
sum_delta_operator = 0;
for(j=0; j<=i; j++)
{
sum_delta_operator = sum_delta_operator + b[j]*nchoosek(M-j,i-j);
}
b_out[i] = internal_pow(delta,M-i)*sum_delta_operator;
}
}
# 27 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/closed-loop.h" 1
# 28 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/closed-loop.h"
void ft_closedloop_series(double c_num[], int Nc_num, double c_den[], int Nc_den, double model_num[], int Nmodel_num, double model_den[], int Nmodel_den, double ans_num[], int Nans_num, double ans_den[], int Nans_den){
Nans_num = Nc_num + Nmodel_num - 1;
Nans_den = Nc_den + Nmodel_den - 1 ;
double den_mult [Nans_den];
poly_mult(c_num, Nc_num, model_num, Nmodel_num, ans_num, Nans_num);
poly_mult(c_den, Nc_den, model_den, Nmodel_den, den_mult, Nans_den );
poly_sum(ans_num, Nans_num , den_mult, Nans_den , ans_den, Nans_den);
}
void ft_closedloop_sensitivity(double c_num[], int Nc_num, double c_den[], int Nc_den, double model_num[], int Nmodel_num, double model_den[], int Nmodel_den, double ans_num[], int Nans_num, double ans_den[], int Nans_den){
int Nans_num_p = Nc_num + Nmodel_num-1;
Nans_den = Nc_den + Nmodel_den-1;
Nans_num = Nc_den + Nmodel_den-1;
double num_mult [Nans_num_p];
poly_mult(c_den, Nc_den, model_den, Nmodel_den, ans_num, Nans_num);
poly_mult(c_num, Nc_num, model_num, Nmodel_num, num_mult, Nans_num_p);
poly_sum(ans_num, Nans_num, num_mult, Nans_num_p, ans_den, Nans_den);
}
void ft_closedloop_feedback(double c_num[], int Nc_num, double c_den[], int Nc_den, double model_num[], int Nmodel_num, double model_den[], int Nmodel_den, double ans_num[], int Nans_num, double ans_den[], int Nans_den){
Nans_num = Nc_den + Nmodel_num - 1;
Nans_den = Nc_den + Nmodel_den - 1;
int Nnum_mult = Nc_num + Nmodel_num - 1;
double den_mult [Nans_den];
double num_mult [Nnum_mult];
poly_mult(c_num, Nc_num, model_num, Nmodel_num, num_mult, Nnum_mult);
poly_mult(c_den, Nc_den, model_den, Nmodel_den, den_mult, Nans_den);
poly_sum(num_mult, Nnum_mult, den_mult, Nans_den, ans_den, Nans_den);
poly_mult(c_den, Nc_den, model_num, Nmodel_num, ans_num, Nans_num);
}
int check_stability_closedloop(double a[], int n, double plant_num[], int p_num_size, double plant_den[], int p_den_size){
int columns = n;
double m[2 * n - 1][n];
int i,j;
int first_is_positive = 0;
double * p_num = plant_num;
double * p_den = plant_den;
double sum = 0;
for (i=0; i < n; i++){
sum += a[i];
}
__DSVERIFIER_assert(sum > 0);
sum = 0;
for (i=0; i < n; i++){
sum += a[i] * internal_pow(-1, n-1-i);
}
sum = sum * internal_pow(-1, n-1);
__DSVERIFIER_assert(sum > 0);
__DSVERIFIER_assert(internal_abs(a[n-1]) < a[0]);
for (i=0; i < 2 * n - 1; i++){
for (j=0; j < columns; j++){
m[i][j] = 0;
if (i == 0){
m[i][j] = a[j];
continue;
}
if (i % 2 != 0 ){
int x;
for(x=0; x<columns;x++){
m[i][x] = m[i-1][columns-x-1];
}
columns = columns - 1;
j = columns;
}else{
__DSVERIFIER_assert(m[i-2][0] > 0);
m[i][j] = m[i-2][j] - (m[i-2][columns] / m[i-2][0]) * m[i-1][j];
__DSVERIFIER_assert((m[0][0] >= 0) && (m[i][0] >= 0));
}
}
}
return 1;
}
# 28 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h" 1
# 17 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h"
extern digital_system ds;
extern digital_system plant;
extern digital_system control;
extern implementation impl;
extern filter_parameters filter;
extern hardware hw;
void initialization(){
if (impl.frac_bits >= 32){
printf("impl.frac_bits must be less than word width!\n");
}
if (impl.int_bits >= 32 - impl.frac_bits){
printf("impl.int_bits must be less than word width subtracted by precision!\n");
# 33 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h" 3 4
((void) sizeof ((
# 33 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h"
0
# 33 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 33 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h"
0
# 33 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h" 3 4
) ; else __assert_fail (
# 33 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h"
"0"
# 33 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h", 33, __extension__ __PRETTY_FUNCTION__); }))
# 33 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h"
;
}
if(impl.frac_bits >= 31){
_fxp_one = 0x7fffffff;
}else{
_fxp_one = (0x00000001 << impl.frac_bits);
}
_fxp_half = (0x00000001 << (impl.frac_bits - 1));
_fxp_minus_one = -(0x00000001 << impl.frac_bits);
_fxp_min = -(0x00000001 << (impl.frac_bits + impl.int_bits - 1));
_fxp_max = (0x00000001 << (impl.frac_bits + impl.int_bits - 1)) - 1;
_fxp_fmask = ((((int32_t) 1) << impl.frac_bits) - 1);
_fxp_imask = ((0x80000000) >> (32 - impl.frac_bits - 1));
_dbl_min = _fxp_min;
_dbl_min /= (1 << impl.frac_bits);
_dbl_max = _fxp_max;
_dbl_max /= (1 << impl.frac_bits);
if ((impl.scale == 0) || (impl.scale == 1)){
impl.scale = 1;
return;
}
if (impl.min != 0){
impl.min = impl.min / impl.scale;
}
if (impl.max != 0){
impl.max = impl.max / impl.scale;
}
# 80 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h"
}
# 29 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/state-space.h" 1
# 19 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/state-space.h"
extern digital_system_state_space _controller;
extern int nStates;
extern int nInputs;
extern int nOutputs;
double double_state_space_representation(void){
double result1[4][4];
double result2[4][4];
int i, j;
for(i=0; i<4;i++){
for(j=0; j<4;j++){
result1[i][j]=0;
result2[i][j]=0;
}
}
double_matrix_multiplication(nOutputs,nStates,nStates,1,_controller.C,_controller.states,result1);
double_matrix_multiplication(nOutputs,nInputs,nInputs,1,_controller.D,_controller.inputs,result2);
double_add_matrix(nOutputs,
1,
result1,
result2,
_controller.outputs);
double_matrix_multiplication(nStates,nStates,nStates,1,_controller.A,_controller.states,result1);
double_matrix_multiplication(nStates,nInputs,nInputs,1,_controller.B,_controller.inputs,result2);
double_add_matrix(nStates,
1,
result1,
result2,
_controller.states);
return _controller.outputs[0][0];
}
double fxp_state_space_representation(void){
fxp_t result1[4][4];
fxp_t result2[4][4];
int i, j;
for(i=0; i<4;i++){
for(j=0; j<4;j++){
result1[i][j]=0;
result2[i][j]=0;
}
}
fxp_t A_fpx[4][4];
fxp_t B_fpx[4][4];
fxp_t C_fpx[4][4];
fxp_t D_fpx[4][4];
fxp_t states_fpx[4][4];
fxp_t inputs_fpx[4][4];
fxp_t outputs_fpx[4][4];
for(i=0; i<4;i++){
for(j=0; j<4;j++){
A_fpx[i][j]=0;
}
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
B_fpx[i][j]=0;
}
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
C_fpx[i][j]=0;
}
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
D_fpx[i][j]=0;
}
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
states_fpx[i][j]=0;
}
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
inputs_fpx[i][j]=0;
}
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
outputs_fpx[i][j]=0;
}
}
for(i=0; i<nStates;i++){
for(j=0; j<nStates;j++){
A_fpx[i][j]= fxp_double_to_fxp(_controller.A[i][j]);
}
}
for(i=0; i<nStates;i++){
for(j=0; j<nInputs;j++){
B_fpx[i][j]= fxp_double_to_fxp(_controller.B[i][j]);
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<nStates;j++){
C_fpx[i][j]= fxp_double_to_fxp(_controller.C[i][j]);
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<nInputs;j++){
D_fpx[i][j]= fxp_double_to_fxp(_controller.D[i][j]);
}
}
for(i=0; i<nStates;i++){
for(j=0; j<1;j++){
states_fpx[i][j]= fxp_double_to_fxp(_controller.states[i][j]);
}
}
for(i=0; i<nInputs;i++){
for(j=0; j<1;j++){
inputs_fpx[i][j]= fxp_double_to_fxp(_controller.inputs[i][j]);
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<1;j++){
outputs_fpx[i][j]= fxp_double_to_fxp(_controller.outputs[i][j]);
}
}
fxp_matrix_multiplication(nOutputs,nStates,nStates,1,C_fpx,states_fpx,result1);
fxp_matrix_multiplication(nOutputs,nInputs,nInputs,1,D_fpx,inputs_fpx,result2);
fxp_add_matrix(nOutputs,
1,
result1,
result2,
outputs_fpx);
fxp_matrix_multiplication(nStates,nStates,nStates,1,A_fpx,states_fpx,result1);
fxp_matrix_multiplication(nStates,nInputs,nInputs,1,B_fpx,inputs_fpx,result2);
fxp_add_matrix(nStates,
1,
result1,
result2,
states_fpx);
for(i=0; i<nStates;i++){
for(j=0; j<1;j++){
_controller.states[i][j]= fxp_to_double(states_fpx[i][j]);
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<1;j++){
_controller.outputs[i][j]= fxp_to_double(outputs_fpx[i][j]);
}
}
return _controller.outputs[0][0];
}
# 30 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/filter_functions.h" 1
# 20 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/filter_functions.h"
double sinTyl(double x, int precision){
double sine;
double xsquared = x*x;
double aux;
if (precision < 0)
{
printf("Warning: Function sinTyl from bmc/core/filter_functions.h: "
"Precision must be a positive integer. Assuming 0 precision\n");
precision = 0;
}
if (precision >= 0)
{
aux = 0;
sine = aux;
if (precision >= 1)
{
aux = x;
sine += aux;
if (precision >= 2)
{
aux = aux*xsquared;
sine -= aux/6;
if (precision >= 3)
{
aux = aux*xsquared;
sine +=aux/120;
if(precision >=4)
{
aux = aux*xsquared;
sine -=aux/5040;
if(precision >= 5)
{
aux = aux*xsquared;
sine +=aux/362880;
if(precision >= 6)
{
aux = aux*xsquared;
sine -=aux/39916800;
if (precision >= 7)
printf("Warning: Function sinTyl "
"from bmc/core/filter_functions.h: Precision "
"representation exceeded. Assuming maximum precision of 6\n");
}
}
}
}
}
}
}
return sine;
}
double cosTyl(double x, int precision){
double cosine;
double xsquared = x*x;
double aux;
if (precision < 0)
{
printf("Warning: Function cosTyl from bmc/core/filter_functions.h: "
"Precision must be a positive integer. Assuming 0 precision\n");
precision = 0;
}
if (precision >= 0)
{
aux = 0;
cosine = aux;
if (precision >= 1)
{
aux = 1;
cosine = 1;
if (precision >= 2)
{
aux = xsquared;
cosine -= aux/2;
if (precision >= 3)
{
aux = aux*xsquared;
cosine += aux/24;
if(precision >=4)
{
aux = aux*xsquared;
cosine -=aux/720;
if(precision >= 5)
{
aux = aux*xsquared;
cosine +=aux/40320;
if(precision >= 6)
{
aux = aux*xsquared;
cosine -=aux/3628800;
if (precision >= 7) printf("Warning: Function sinTyl "
"from bmc/core/filter_functions.h: Precision "
"representation exceeded. Assuming maximum precision of 6\n");
}
}
}
}
}
}
}
return cosine;
}
double atanTyl(double x, int precision){
double atangent;
double xsquared = x*x;
double aux;
if (precision < 0)
{
printf("Warning: Function sinTyl from bmc/core/filter_functions.h: "
"Precision must be a positive integer. Assuming 0 precision\n");
precision = 0;
}
if (precision >= 0)
{
aux = 0;
atangent = aux;
if (precision >= 1)
{
aux = x;
atangent = aux;
if (precision >= 2)
{
aux = xsquared;
atangent -= aux/3;
if (precision >= 3)
{
aux = aux*xsquared;
atangent += aux/5;
if(precision >=4)
{
aux = aux*xsquared;
atangent -=aux/7;
if (precision >= 7)
printf("Warning: Function sinTyl from bmc/core/filter_functions.h: "
"Precision representation exceeded. Assuming maximum precision of 4\n");
}
}
}
}
}
return atangent;
}
float sqrt1(const float x)
{
const float xhalf = 0.5f*x;
union
{
float x;
int i;
} u;
u.x = x;
u.i = 0x5f3759df - (u.i >> 1);
return x*u.x*(1.5f - xhalf*u.x*u.x);
}
float sqrt2(const float x)
{
union
{
int i;
float x;
} u;
u.x = x;
u.i = (1<<29) + (u.i >> 1) - (1<<22);
return u.x;
}
float fabsolut(float x)
{
if (x < 0)
x = -x;
return x;
}
static float sqrt3(float val)
{
float x = val/10;
float dx;
double diff;
double min_tol = 0.00001;
int i, flag;
flag = 0;
if (val == 0 ) x = 0;
else
{
for (i=1;i<20;i++)
{
if (!flag)
{
dx = (val - (x*x)) / (2.0 * x);
x = x + dx;
diff = val - (x*x);
if (fabsolut(diff) <= min_tol) flag = 1;
}
else x =x;
}
}
return (x);
}
# 31 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_overflow.h" 1
# 19 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_overflow.h"
int nondet_int();
float nondet_float();
extern digital_system ds;
extern implementation impl;
int verify_overflow(void) {
fxp_t a_fxp[ds.a_size];
fxp_t b_fxp[ds.b_size];
fxp_double_to_fxp_array(ds.a, a_fxp, ds.a_size);
fxp_double_to_fxp_array(ds.b, b_fxp, ds.b_size);
# 73 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_overflow.h"
fxp_t min_fxp = fxp_double_to_fxp(impl.min);
fxp_t max_fxp = fxp_double_to_fxp(impl.max);
fxp_t y[X_SIZE_VALUE];
fxp_t x[X_SIZE_VALUE];
int i;
for (i = 0; i < X_SIZE_VALUE; ++i) {
y[i] = 0;
x[i] = nondet_int();
__DSVERIFIER_assume(x[i] >= min_fxp && x[i] <= max_fxp);
}
int Nw = 0;
Nw = ds.a_size > ds.b_size ? ds.a_size : ds.b_size;
fxp_t yaux[ds.a_size];
fxp_t xaux[ds.b_size];
fxp_t waux[Nw];
for (i = 0; i < ds.a_size; ++i) {
yaux[i] = 0;
}
for (i = 0; i < ds.b_size; ++i) {
xaux[i] = 0;
}
for (i = 0; i < Nw; ++i) {
waux[i] = 0;
}
fxp_t xk, temp;
fxp_t *aptr, *bptr, *xptr, *yptr, *wptr;
int j;
for (i = 0; i < X_SIZE_VALUE; ++i) {
# 129 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_overflow.h"
y[i] = fxp_transposed_direct_form_2(waux, x[i], a_fxp, b_fxp, ds.a_size, ds.b_size);
# 174 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_overflow.h"
}
overflow_mode = 1;
fxp_verify_overflow_array(y, X_SIZE_VALUE);
return 0;
}
# 33 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h" 1
# 15 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
extern digital_system ds;
extern implementation impl;
extern digital_system_state_space _controller;
extern int nStates;
extern int nInputs;
extern int nOutputs;
int verify_limit_cycle_state_space(void){
double stateMatrix[4][4];
double outputMatrix[4][4];
double arrayLimitCycle[4];
double result1[4][4];
double result2[4][4];
int i, j, k;
for(i=0; i<4;i++){
for(j=0; j<4;j++){
result1[i][j]=0;
result2[i][j]=0;
stateMatrix[i][j]=0;
outputMatrix[i][j]=0;
}
}
double_matrix_multiplication(nOutputs,nStates,nStates,1,_controller.C,_controller.states,result1);
double_matrix_multiplication(nOutputs,nInputs,nInputs,1,_controller.D,_controller.inputs,result2);
double_add_matrix(nOutputs,
1,
result1,
result2,
_controller.outputs);
k = 0;
for (i = 1; i < 0; i++) {
double_matrix_multiplication(nStates,nStates,nStates,1,_controller.A,_controller.states,result1);
double_matrix_multiplication(nStates,nInputs,nInputs,1,_controller.B,_controller.inputs,result2);
double_add_matrix(nStates,
1,
result1,
result2,
_controller.states);
double_matrix_multiplication(nOutputs,nStates,nStates,1,_controller.C,_controller.states,result1);
double_matrix_multiplication(nOutputs,nInputs,nInputs,1,_controller.D,_controller.inputs,result2);
double_add_matrix(nOutputs,
1,
result1,
result2,
_controller.outputs);
int l;
for(l = 0; l < nStates; l++){
stateMatrix[l][k] = _controller.states[l][0];
}
for(l = 0; l < nOutputs; l++){
stateMatrix[l][k] = _controller.outputs[l][0];
}
k++;
}
printf("#matrix STATES -------------------------------");
print_matrix(stateMatrix,nStates,0);
printf("#matrix OUTPUTS -------------------------------");
print_matrix(outputMatrix,nOutputs,0);
# 93 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h" 3 4
((void) sizeof ((
# 93 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
0
# 93 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 93 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
0
# 93 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h" 3 4
) ; else __assert_fail (
# 93 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
"0"
# 93 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h", 93, __extension__ __PRETTY_FUNCTION__); }))
# 93 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
;
for(i=0; i<nStates;i++){
for(j=0; j<0;j++){
arrayLimitCycle[j] = stateMatrix[i][j];
}
double_check_persistent_limit_cycle(arrayLimitCycle,0);
}
for(i=0; i<nOutputs;i++){
for(j=0; j<0;j++){
arrayLimitCycle[j] = outputMatrix[i][j];
}
double_check_persistent_limit_cycle(arrayLimitCycle,0);
}
# 110 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h" 3 4
((void) sizeof ((
# 110 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
0
# 110 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 110 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
0
# 110 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h" 3 4
) ; else __assert_fail (
# 110 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
"0"
# 110 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h", 110, __extension__ __PRETTY_FUNCTION__); }))
# 110 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
;
}
int verify_limit_cycle(void){
overflow_mode = 3;
int i;
int Set_xsize_at_least_two_times_Na = 2 * ds.a_size;
printf("X_SIZE must be at least 2 * ds.a_size");
__DSVERIFIER_assert(X_SIZE_VALUE >= Set_xsize_at_least_two_times_Na);
fxp_t a_fxp[ds.a_size];
fxp_t b_fxp[ds.b_size];
fxp_double_to_fxp_array(ds.a, a_fxp, ds.a_size);
fxp_double_to_fxp_array(ds.b, b_fxp, ds.b_size);
# 168 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
fxp_t y[X_SIZE_VALUE];
fxp_t x[X_SIZE_VALUE];
fxp_t min_fxp = fxp_double_to_fxp(impl.min);
fxp_t max_fxp = fxp_double_to_fxp(impl.max);
fxp_t xaux[ds.b_size];
int nondet_constant_input = nondet_int();
__DSVERIFIER_assume(nondet_constant_input >= min_fxp && nondet_constant_input <= max_fxp);
for (i = 0; i < X_SIZE_VALUE; ++i) {
x[i] = nondet_constant_input;
y[i] = 0;
}
for (i = 0; i < ds.b_size; ++i) {
xaux[i] = nondet_constant_input;
}
int Nw = 0;
Nw = ds.a_size > ds.b_size ? ds.a_size : ds.b_size;
fxp_t yaux[ds.a_size];
fxp_t y0[ds.a_size];
fxp_t waux[Nw];
fxp_t w0[Nw];
# 206 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
for (i = 0; i < Nw; ++i) {
waux[i] = nondet_int();
__DSVERIFIER_assume(waux[i] >= min_fxp && waux[i] <= max_fxp);
w0[i] = waux[i];
}
fxp_t xk, temp;
fxp_t *aptr, *bptr, *xptr, *yptr, *wptr;
int j;
for(i=0; i<X_SIZE_VALUE; ++i){
# 234 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
y[i] = fxp_transposed_direct_form_2(waux, x[i], a_fxp, b_fxp, ds.a_size, ds.b_size);
# 278 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
}
fxp_check_persistent_limit_cycle(y, X_SIZE_VALUE);
return 0;
}
# 34 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error.h" 1
# 17 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error.h"
extern digital_system ds;
extern implementation impl;
int verify_error(void){
overflow_mode = 2;
double a_cascade[100];
int a_cascade_size;
double b_cascade[100];
int b_cascade_size;
fxp_t a_fxp[ds.a_size];
fxp_t b_fxp[ds.b_size];
fxp_double_to_fxp_array(ds.a, a_fxp, ds.a_size);
fxp_double_to_fxp_array(ds.b, b_fxp, ds.b_size);
# 69 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error.h"
fxp_t min_fxp = fxp_double_to_fxp(impl.min);
fxp_t max_fxp = fxp_double_to_fxp(impl.max);
fxp_t y[X_SIZE_VALUE];
fxp_t x[X_SIZE_VALUE];
double yf[X_SIZE_VALUE];
double xf[X_SIZE_VALUE];
int Nw = 0;
Nw = ds.a_size > ds.b_size ? ds.a_size : ds.b_size;
fxp_t yaux[ds.a_size];
fxp_t xaux[ds.b_size];
fxp_t waux[Nw];
double yfaux[ds.a_size];
double xfaux[ds.b_size];
double wfaux[Nw];
int i;
for (i = 0; i < ds.a_size; ++i) {
yaux[i] = 0;
yfaux[i] = 0;
}
for (i = 0; i < ds.b_size; ++i) {
xaux[i] = 0;
xfaux[i] = 0;
}
for (i = 0; i < Nw; ++i) {
waux[i] = 0;
wfaux[i] = 0;
}
for (i = 0; i < X_SIZE_VALUE; ++i) {
y[i] = 0;
x[i] = nondet_int();
__DSVERIFIER_assume(x[i] >= min_fxp && x[i] <= max_fxp);
yf[i] = 0.0f;
xf[i] = fxp_to_double(x[i]);
}
for (i = 0; i < X_SIZE_VALUE; ++i) {
# 156 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error.h"
y[i] = fxp_transposed_direct_form_2(waux, x[i], a_fxp, b_fxp, ds.a_size, ds.b_size);
yf[i] = double_transposed_direct_form_2(wfaux, xf[i], ds.a, ds.b, ds.a_size, ds.b_size);
# 169 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error.h"
double absolute_error = yf[i] - fxp_to_double(y[i]);
__DSVERIFIER_assert(absolute_error < (impl.max_error) && absolute_error > (-impl.max_error));
}
return 0;
}
# 35 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h" 1
# 13 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h"
extern digital_system ds;
extern implementation impl;
int verify_zero_input_limit_cycle(void){
overflow_mode = 3;
int i,j;
int Set_xsize_at_least_two_times_Na = 2 * ds.a_size;
printf("X_SIZE must be at least 2 * ds.a_size");
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h" 3 4
((void) sizeof ((
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h"
X_SIZE_VALUE >= Set_xsize_at_least_two_times_Na
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h"
X_SIZE_VALUE >= Set_xsize_at_least_two_times_Na
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h" 3 4
) ; else __assert_fail (
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h"
"X_SIZE_VALUE >= Set_xsize_at_least_two_times_Na"
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h", 23, __extension__ __PRETTY_FUNCTION__); }))
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h"
;
fxp_t a_fxp[ds.a_size];
fxp_t b_fxp[ds.b_size];
fxp_double_to_fxp_array(ds.a, a_fxp, ds.a_size);
fxp_double_to_fxp_array(ds.b, b_fxp, ds.b_size);
# 71 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h"
fxp_t min_fxp = fxp_double_to_fxp(impl.min);
fxp_t max_fxp = fxp_double_to_fxp(impl.max);
fxp_t y[X_SIZE_VALUE];
fxp_t x[X_SIZE_VALUE];
for (i = 0; i < X_SIZE_VALUE; ++i) {
y[i] = 0;
x[i] = 0;
}
int Nw = 0;
Nw = ds.a_size > ds.b_size ? ds.a_size : ds.b_size;
fxp_t yaux[ds.a_size];
fxp_t xaux[ds.b_size];
fxp_t waux[Nw];
fxp_t y0[ds.a_size];
fxp_t w0[Nw];
# 104 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h"
for (i = 0; i < Nw; ++i) {
waux[i] = nondet_int();
__DSVERIFIER_assume(waux[i] >= min_fxp && waux[i] <= max_fxp);
w0[i] = waux[i];
}
for (i = 0; i < ds.b_size; ++i) {
xaux[i] = 0;
}
fxp_t xk, temp;
fxp_t *aptr, *bptr, *xptr, *yptr, *wptr;
for(i=0; i<X_SIZE_VALUE; ++i){
# 141 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h"
y[i] = fxp_transposed_direct_form_2(waux, x[i], a_fxp, b_fxp, ds.a_size, ds.b_size);
# 188 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h"
}
fxp_check_persistent_limit_cycle(y, X_SIZE_VALUE);
return 0;
}
# 36 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h" 1
# 16 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h"
int nondet_int();
float nondet_float();
extern digital_system ds;
extern implementation impl;
extern hardware hw;
int generic_timer = 0;
int verify_generic_timing(void) {
double y[X_SIZE_VALUE];
double x[X_SIZE_VALUE];
int i;
for (i = 0; i < X_SIZE_VALUE; ++i) {
y[i] = 0;
x[i] = nondet_float();
__DSVERIFIER_assume(x[i] >= impl.min && x[i] <= impl.max);
}
int Nw = 0;
Nw = ds.a_size > ds.b_size ? ds.a_size : ds.b_size;
double yaux[ds.a_size];
double xaux[ds.b_size];
double waux[Nw];
for (i = 0; i < ds.a_size; ++i) {
yaux[i] = 0;
}
for (i = 0; i < ds.b_size; ++i) {
xaux[i] = 0;
}
for (i = 0; i < Nw; ++i) {
waux[i] = 0;
}
double xk, temp;
double *aptr, *bptr, *xptr, *yptr, *wptr;
int j;
generic_timer += ((2 * hw.assembly.std) + (1 * hw.assembly.rjmp));
double initial_timer = generic_timer;
for (i = 0; i < X_SIZE_VALUE; ++i) {
generic_timer += ((2 * hw.assembly.ldd) + (1 * hw.assembly.adiw) + (2 * hw.assembly.std));
generic_timer += ((2 * hw.assembly.ldd) + (1 * hw.assembly.cpi) + (1 * hw.assembly.cpc) + (1 * hw.assembly.brlt));
# 85 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h"
y[i] = generic_timing_double_transposed_direct_form_2(waux, x[i], ds.a, ds.b, ds.a_size, ds.b_size);
double spent_time = (((double) generic_timer) * hw.cycle);
# 89 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h" 3 4
((void) sizeof ((
# 89 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h"
spent_time <= ds.sample_time
# 89 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 89 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h"
spent_time <= ds.sample_time
# 89 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h" 3 4
) ; else __assert_fail (
# 89 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h"
"spent_time <= ds.sample_time"
# 89 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h", 89, __extension__ __PRETTY_FUNCTION__); }))
# 89 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h"
;
generic_timer = initial_timer;
}
return 0;
}
# 37 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_timing_msp430.h" 1
# 16 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_timing_msp430.h"
int nondet_int();
float nondet_float();
extern digital_system ds;
extern implementation impl;
int verify_timing_msp_430(void) {
double y[X_SIZE_VALUE];
double x[X_SIZE_VALUE];
int i;
for (i = 0; i < X_SIZE_VALUE; ++i) {
y[i] = 0;
x[i] = nondet_float();
__DSVERIFIER_assume(x[i] >= impl.min && x[i] <= impl.max);
}
int Nw = 0;
Nw = ds.a_size > ds.b_size ? ds.a_size : ds.b_size;
double yaux[ds.a_size];
double xaux[ds.b_size];
double waux[Nw];
for (i = 0; i < ds.a_size; ++i) {
yaux[i] = 0;
}
for (i = 0; i < ds.b_size; ++i) {
xaux[i] = 0;
}
for (i = 0; i < Nw; ++i) {
waux[i] = 0;
}
double xk, temp;
double *aptr, *bptr, *xptr, *yptr, *wptr;
int j;
for (i = 0; i < X_SIZE_VALUE; ++i) {
# 75 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_timing_msp430.h"
y[i] = double_transposed_direct_form_2_MSP430(waux, x[i], ds.a, ds.b, ds.a_size, ds.b_size);
# 121 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_timing_msp430.h"
}
return 0;
}
# 38 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h" 1
# 21 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h"
extern digital_system ds;
extern implementation impl;
int verify_stability(void){
overflow_mode = 0;
fxp_t a_fxp[ds.a_size];
fxp_double_to_fxp_array(ds.a, a_fxp, ds.a_size);
double _a[ds.a_size];
fxp_to_double_array(_a, a_fxp, ds.a_size);
# 37 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h" 3 4
((void) sizeof ((
# 37 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h"
check_stability(_a, ds.a_size)
# 37 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 37 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h"
check_stability(_a, ds.a_size)
# 37 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h" 3 4
) ; else __assert_fail (
# 37 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h"
"check_stability(_a, ds.a_size)"
# 37 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h", 37, __extension__ __PRETTY_FUNCTION__); }))
# 37 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h"
;
# 83 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h"
return 0;
}
# 39 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_minimum_phase.h" 1
# 21 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_minimum_phase.h"
extern digital_system ds;
extern implementation impl;
int verify_minimum_phase(void){
overflow_mode = 0;
fxp_t b_fxp[ds.b_size];
fxp_double_to_fxp_array(ds.b, b_fxp, ds.b_size);
double _b[ds.b_size];
fxp_to_double_array(_b, b_fxp, ds.b_size);
__DSVERIFIER_assert(check_stability(_b, ds.b_size));
# 85 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_minimum_phase.h"
return 0;
}
# 40 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability_closedloop.h" 1
# 17 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability_closedloop.h"
extern digital_system plant;
extern digital_system plant_cbmc;
extern digital_system controller;
int verify_stability_closedloop_using_dslib(void){
double * c_num = controller.b;
int c_num_size = controller.b_size;
double * c_den = controller.a;
int c_den_size = controller.a_size;
fxp_t c_num_fxp[controller.b_size];
fxp_double_to_fxp_array(c_num, c_num_fxp, controller.b_size);
fxp_t c_den_fxp[controller.a_size];
fxp_double_to_fxp_array(c_den, c_den_fxp, controller.a_size);
double c_num_qtz[controller.b_size];
fxp_to_double_array(c_num_qtz, c_num_fxp, controller.b_size);
double c_den_qtz[controller.a_size];
fxp_to_double_array(c_den_qtz, c_den_fxp, controller.a_size);
double * p_num = plant.b;
int p_num_size = plant.b_size;
double * p_den = plant.a;
int p_den_size = plant.a_size;
double ans_num[100];
int ans_num_size = controller.b_size + plant.b_size - 1;
double ans_den[100];
int ans_den_size = controller.a_size + plant.a_size - 1;
# 68 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability_closedloop.h"
printf("Verifying stability for closedloop function\n");
__DSVERIFIER_assert(check_stability_closedloop(ans_den, ans_den_size, p_num, p_num_size, p_den, p_den_size));
return 0;
}
# 41 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle_closedloop.h" 1
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle_closedloop.h"
extern digital_system plant;
extern digital_system plant_cbmc;
extern digital_system controller;
double nondet_double();
int verify_limit_cycle_closed_loop(void){
overflow_mode = 3;
double * c_num = controller.b;
int c_num_size = controller.b_size;
double * c_den = controller.a;
int c_den_size = controller.a_size;
fxp_t c_num_fxp[controller.b_size];
fxp_double_to_fxp_array(c_num, c_num_fxp, controller.b_size);
fxp_t c_den_fxp[controller.a_size];
fxp_double_to_fxp_array(c_den, c_den_fxp, controller.a_size);
double c_num_qtz[controller.b_size];
fxp_to_double_array(c_num_qtz, c_num_fxp, controller.b_size);
double c_den_qtz[controller.a_size];
fxp_to_double_array(c_den_qtz, c_den_fxp, controller.a_size);
double * p_num = plant.b;
int p_num_size = plant.b_size;
double * p_den = plant.a;
int p_den_size = plant.a_size;
double ans_num[100];
int ans_num_size = controller.b_size + plant.b_size - 1;
double ans_den[100];
int ans_den_size = controller.a_size + plant.a_size - 1;
int i;
double y[X_SIZE_VALUE];
double x[X_SIZE_VALUE];
double xaux[ans_num_size];
double nondet_constant_input = nondet_double();
__DSVERIFIER_assume(nondet_constant_input >= impl.min && nondet_constant_input <= impl.max);
for (i = 0; i < X_SIZE_VALUE; ++i) {
x[i] = nondet_constant_input;
y[i] = 0;
}
for (i = 0; i < ans_num_size; ++i) {
xaux[i] = nondet_constant_input;
}
double yaux[ans_den_size];
double y0[ans_den_size];
int Nw = ans_den_size > ans_num_size ? ans_den_size : ans_num_size;
double waux[Nw];
double w0[Nw];
# 105 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle_closedloop.h"
for (i = 0; i < Nw; ++i) {
waux[i] = nondet_int();
__DSVERIFIER_assume(waux[i] >= impl.min && waux[i] <= impl.max);
w0[i] = waux[i];
}
double xk, temp;
double *aptr, *bptr, *xptr, *yptr, *wptr;
int j;
for(i=0; i<X_SIZE_VALUE; ++i){
# 134 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle_closedloop.h"
y[i] = double_transposed_direct_form_2(waux, x[i], ans_den, ans_num, ans_den_size, ans_num_size);
}
double_check_persistent_limit_cycle(y, X_SIZE_VALUE);
return 0;
}
# 42 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_closedloop.h" 1
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_closedloop.h"
extern digital_system plant;
extern digital_system plant_cbmc;
extern digital_system controller;
int verify_error_closedloop(void){
overflow_mode = 3;
double * c_num = controller.b;
int c_num_size = controller.b_size;
double * c_den = controller.a;
int c_den_size = controller.a_size;
fxp_t c_num_fxp[controller.b_size];
fxp_double_to_fxp_array(c_num, c_num_fxp, controller.b_size);
fxp_t c_den_fxp[controller.a_size];
fxp_double_to_fxp_array(c_den, c_den_fxp, controller.a_size);
double c_num_qtz[controller.b_size];
fxp_to_double_array(c_num_qtz, c_num_fxp, controller.b_size);
double c_den_qtz[controller.a_size];
fxp_to_double_array(c_den_qtz, c_den_fxp, controller.a_size);
double * p_num = plant.b;
int p_num_size = plant.b_size;
double * p_den = plant.a;
int p_den_size = plant.a_size;
double ans_num_double[100];
double ans_num_qtz[100];
int ans_num_size = controller.b_size + plant.b_size - 1;
double ans_den_qtz[100];
double ans_den_double[100];
int ans_den_size = controller.a_size + plant.a_size - 1;
# 77 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_closedloop.h"
int i;
double y_qtz[X_SIZE_VALUE];
double y_double[X_SIZE_VALUE];
double x_qtz[X_SIZE_VALUE];
double x_double[X_SIZE_VALUE];
double xaux_qtz[ans_num_size];
double xaux_double[ans_num_size];
double xaux[ans_num_size];
double nondet_constant_input = nondet_double();
__DSVERIFIER_assume(nondet_constant_input >= impl.min && nondet_constant_input <= impl.max);
for (i = 0; i < X_SIZE_VALUE; ++i) {
x_qtz[i] = nondet_constant_input;
x_double[i] = nondet_constant_input;
y_qtz[i] = 0;
y_double[i] = 0;
}
for (i = 0; i < ans_num_size; ++i) {
xaux_qtz[i] = nondet_constant_input;
xaux_double[i] = nondet_constant_input;
}
double yaux_qtz[ans_den_size];
double yaux_double[ans_den_size];
double y0_qtz[ans_den_size];
double y0_double[ans_den_size];
int Nw = ans_den_size > ans_num_size ? ans_den_size : ans_num_size;
double waux_qtz[Nw];
double waux_double[Nw];
double w0_qtz[Nw];
double w0_double[Nw];
for (i = 0; i < Nw; ++i) {
waux_qtz[i] = 0;
waux_double[i] = 0;
}
for(i=0; i<X_SIZE_VALUE; ++i){
# 150 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_closedloop.h"
y_qtz[i] = double_transposed_direct_form_2(waux_qtz, x_qtz[i], ans_den_qtz, ans_num_qtz, ans_den_size, ans_num_size);
y_double[i] = double_transposed_direct_form_2(waux_double, x_double[i], ans_den_double, ans_num_double, ans_den_size, ans_num_size);
double absolute_error = y_double[i] - fxp_to_double(y_qtz[i]);
__DSVERIFIER_assert(absolute_error < (impl.max_error) && absolute_error > (-impl.max_error));
}
return 0;
}
# 43 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h" 1
# 20 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h"
extern digital_system_state_space _controller;
extern double error_limit;
extern int closed_loop;
double new_state[4][4];
double new_stateFWL[4][4];
digital_system_state_space _controller_fxp;
digital_system_state_space _controller_double;
double ss_system_quantization_error(fxp_t inputs){
digital_system_state_space __backupController;
int i;
int j;
_controller.inputs[0][0] = inputs;
for(i=0; i<nStates;i++){
for(j=0; j<nStates;j++){
__backupController.A[i][j]= (_controller.A[i][j]);
}
}
for(i=0; i<nStates;i++){
for(j=0; j<nInputs;j++){
__backupController.B[i][j]= (_controller.B[i][j]);
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<nStates;j++){
__backupController.C[i][j]= (_controller.C[i][j]);
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<nInputs;j++){
__backupController.D[i][j]= (_controller.D[i][j]);
}
}
for(i=0; i<nStates;i++){
for(j=0; j<1;j++){
__backupController.states[i][j]= (_controller.states[i][j]);
}
}
for(i=0; i<nInputs;i++){
for(j=0; j<1;j++){
__backupController.inputs[i][j]= (_controller.inputs[i][j]);
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<1;j++){
__backupController.outputs[i][j]= (_controller.outputs[i][j]);
}
}
double __quant_error = 0.0;
for(i=0; i<nStates;i++){
for(j=0; j<1;j++){
_controller.states[i][j]= (new_state[i][j]);
}
}
double output_double = double_state_space_representation();
for(i=0; i<nStates;i++){
for(j=0; j<1;j++){
new_state[i][j]= (_controller.states[i][j]);
}
}
__backupController.inputs[0][0] = inputs;
for(i=0; i<nStates;i++){
for(j=0; j<nStates;j++){
_controller.A[i][j] = __backupController.A[i][j];
}
}
for(i=0; i<nStates;i++){
for(j=0; j<nInputs;j++){
_controller.B[i][j] = __backupController.B[i][j];
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<nStates;j++){
_controller.C[i][j] = __backupController.C[i][j];
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<nInputs;j++){
_controller.D[i][j] = __backupController.D[i][j];
}
}
for(i=0; i<nStates;i++){
for(j=0; j<1;j++){
_controller.states[i][j] = __backupController.states[i][j];
}
}
for(i=0; i<nInputs;i++){
for(j=0; j<1;j++){
_controller.inputs[i][j] = __backupController.inputs[i][j];
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<1;j++){
_controller.outputs[i][j] = __backupController.outputs[i][j];
}
}
for(i=0; i<nStates;i++){
for(j=0; j<1;j++){
_controller.states[i][j]= (new_stateFWL[i][j]);
}
}
double output_fxp = fxp_state_space_representation();
for(i=0; i<nStates;i++){
for(j=0; j<1;j++){
new_stateFWL[i][j]= (_controller.states[i][j]);
}
}
__quant_error = output_double - output_fxp;
return __quant_error;
}
double fxp_ss_closed_loop_quantization_error(double reference){
double reference_aux[4][4];
double result1[4][4];
double temp_result1[4][4];
double result2[4][4];
double temp_states[4][4];
fxp_t K_fxp[4][4];
fxp_t states_fxp[4][4];
fxp_t result_fxp[4][4];
unsigned int i;
unsigned int j;
unsigned int k;
short unsigned int flag = 0;
for(i=0; i<nOutputs;i++){
for(j=0; j<nInputs;j++){
if(_controller_fxp.D[i][j] != 0){
flag = 1;
}
}
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
reference_aux[i][j]=0;
K_fxp[i][j] = 0;
}
}
for(i=0; i<nInputs;i++){
reference_aux[i][0]= reference;
}
for(i=0; i<4;i++){
states_fxp[i][0]=0;
}
for(i=0; i<nStates;i++){
K_fxp[0][i]= fxp_double_to_fxp(_controller_fxp.K[0][i]);
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
result1[i][j]=0;
result2[i][j]=0;
}
}
for(k=0; k<nStates;k++)
{
states_fxp[k][0]= fxp_double_to_fxp(_controller_fxp.states[k][0]);
}
fxp_matrix_multiplication(nOutputs,nStates,nStates,1,K_fxp,states_fxp,result_fxp);
fxp_t reference_fxp[4][4];
fxp_t result_fxp2[4][4];
for(k=0;k<nInputs;k++)
{
reference_fxp[k][0] =fxp_double_to_fxp(fxp_quantize(reference_aux[k][0]));
}
fxp_sub_matrix(nInputs,1, reference_fxp, result_fxp, result_fxp2);
for(k=0; k<nInputs;k++)
{
_controller_fxp.inputs[k][0] = fxp_to_double(fxp_quantize(result_fxp2[k][0]));
}
double_matrix_multiplication(nOutputs,nStates,nStates,1,_controller_fxp.C,_controller_fxp.states,result1);
if(flag == 1)
{
double_matrix_multiplication(nOutputs,nInputs,nInputs,1,_controller_fxp.D,_controller_fxp.inputs,result2);
}
double_add_matrix(nOutputs,1,result1,result2,_controller_fxp.outputs);
double_matrix_multiplication(nStates,nStates,nStates,1,_controller_fxp.A,_controller_fxp.states,result1);
double_matrix_multiplication(nStates,nInputs,nInputs,1,_controller_fxp.B,_controller_fxp.inputs,result2);
double_add_matrix(nStates,1,result1,result2,_controller_fxp.states);
return _controller_fxp.outputs[0][0];
}
double ss_closed_loop_quantization_error(double reference){
double reference_aux[4][4];
double result1[4][4];
double result2[4][4];
unsigned int i;
unsigned int j;
short unsigned int flag = 0;
for(i=0; i<nOutputs;i++){
for(j=0; j<nInputs;j++){
if(_controller_double.D[i][j] != 0){
flag = 1;
}
}
}
for(i=0; i<nInputs;i++){
for(j=0; j<1;j++){
reference_aux[i][j]= reference;
}
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
result1[i][j]=0;
result2[i][j]=0;
}
}
double_matrix_multiplication(nOutputs,nStates,nStates,1,_controller_double.K,_controller_double.states,result1);
double_sub_matrix(nInputs,1,reference_aux,result1, _controller_double.inputs);
double_matrix_multiplication(nOutputs,nStates,nStates,1,_controller_double.C,_controller_double.states,result1);
if(flag == 1)
double_matrix_multiplication(nOutputs,nInputs,nInputs,1,_controller_double.D,_controller_double.inputs,result2);
double_add_matrix(nOutputs,1,result1,result2,_controller_double.outputs);
double_matrix_multiplication(nStates,nStates,nStates,1,_controller_double.A,_controller_double.states,result1);
double_matrix_multiplication(nStates,nInputs,nInputs,1,_controller_double.B,_controller_double.inputs,result2);
double_add_matrix(nStates,1,result1,result2,_controller_double.states);
return _controller_double.outputs[0][0];
}
int verify_error_state_space(void){
int i,j;
for(i=0; i<nStates;i++){
for(j=0; j<1;j++){
new_state[i][j]= (_controller.states[i][j]);
}
}
for(i=0; i<nStates;i++){
for(j=0; j<1;j++){
new_stateFWL[i][j]= (_controller.states[i][j]);
}
}
_controller_fxp = _controller;
_controller_double = _controller;
overflow_mode = 0;
fxp_t x[0];
fxp_t min_fxp = fxp_double_to_fxp(impl.min);
fxp_t max_fxp = fxp_double_to_fxp(impl.max);
double nondet_constant_input = nondet_double();
__DSVERIFIER_assume(nondet_constant_input >= min_fxp && nondet_constant_input <= max_fxp);
for (i = 0; i < 0; ++i) {
x[i] = nondet_constant_input;
}
double __quant_error;
if(closed_loop){
for (i = 0; i < 0; ++i) {
__quant_error = ss_closed_loop_quantization_error(x[i]) - fxp_ss_closed_loop_quantization_error(x[i]);
# 354 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h" 3 4
((void) sizeof ((
# 354 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h"
__quant_error < error_limit && __quant_error > ((-1)*error_limit)
# 354 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 354 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h"
__quant_error < error_limit && __quant_error > ((-1)*error_limit)
# 354 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h" 3 4
) ; else __assert_fail (
# 354 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h"
"__quant_error < error_limit && __quant_error > ((-1)*error_limit)"
# 354 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h", 354, __extension__ __PRETTY_FUNCTION__); }))
# 354 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h"
;
}
}
else {
for (i=0; i < 0; i++)
{
__quant_error = ss_system_quantization_error(x[i]);
# 361 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h" 3 4
((void) sizeof ((
# 361 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h"
__quant_error < error_limit && __quant_error > ((-1)*error_limit)
# 361 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 361 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h"
__quant_error < error_limit && __quant_error > ((-1)*error_limit)
# 361 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h" 3 4
) ; else __assert_fail (
# 361 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h"
"__quant_error < error_limit && __quant_error > ((-1)*error_limit)"
# 361 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h", 361, __extension__ __PRETTY_FUNCTION__); }))
# 361 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h"
;
}
}
return 0;
}
# 44 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h" 1
# 17 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h"
extern digital_system_state_space _controller;
extern double error_limit;
extern int closed_loop;
double fxp_ss_closed_loop_safety(){
double reference[4][4];
double result1[4][4];
double result2[4][4];
fxp_t K_fpx[4][4];
fxp_t outputs_fpx[4][4];
fxp_t result_fxp[4][4];
unsigned int i;
unsigned int j;
unsigned int k;
short unsigned int flag = 0;
for(i=0; i<nOutputs;i++){
for(j=0; j<nInputs;j++){
if(_controller.D[i][j] != 0){
flag = 1;
}
}
}
for(i=0; i<nInputs;i++){
for(j=0; j<1;j++){
reference[i][j]= (_controller.inputs[i][j]);
}
}
for(i=0; i<nInputs;i++){
for(j=0; j<nOutputs;j++){
K_fpx[i][j]=0;
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<1;j++){
outputs_fpx[i][j]=0;
}
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
result_fxp[i][j]=0;
}
}
for(i=0; i<nInputs;i++){
for(j=0; j<nOutputs;j++){
K_fpx[i][j]= fxp_double_to_fxp(_controller.K[i][j]);
}
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
result1[i][j]=0;
result2[i][j]=0;
}
}
for (i = 1; i < 0; i++) {
double_matrix_multiplication(nOutputs,nStates,nStates,1,_controller.C,_controller.states,result1);
if(flag == 1){
double_matrix_multiplication(nOutputs,nInputs,nInputs,1,_controller.D,_controller.inputs,result2);
}
double_add_matrix(nOutputs,
1,
result1,
result2,
_controller.outputs);
for(k=0; k<nOutputs;k++){
for(j=0; j<1;j++){
outputs_fpx[k][j]= fxp_double_to_fxp(_controller.outputs[k][j]);
}
}
fxp_matrix_multiplication(nInputs,nOutputs,nOutputs,1,K_fpx,outputs_fpx,result_fxp);
for(k=0; k<nInputs;k++){
for(j=0; j<1;j++){
result1[k][j]= fxp_to_double(result_fxp[k][j]);
}
}
printf("### fxp: U (before) = %.9f", _controller.inputs[0][0]);
printf("### fxp: reference = %.9f", reference[0][0]);
printf("### fxp: result1 = %.9f", result1[0][0]);
printf("### fxp: reference - result1 = %.9f", (reference[0][0] - result1[0][0]));
double_sub_matrix(nInputs,
1,
reference,
result1,
_controller.inputs);
printf("### fxp: Y = %.9f", _controller.outputs[0][0]);
printf("### fxp: U (after) = %.9f \n### \n### ", _controller.inputs[0][0]);
double_matrix_multiplication(nStates,nStates,nStates,1,_controller.A,_controller.states,result1);
double_matrix_multiplication(nStates,nInputs,nInputs,1,_controller.B,_controller.inputs,result2);
double_add_matrix(nStates,
1,
result1,
result2,
_controller.states);
}
return _controller.outputs[0][0];
}
int verify_safety_state_space(void){
fxp_t output_fxp = fxp_ss_closed_loop_safety();
double output_double = fxp_to_double(output_fxp);
# 140 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h" 3 4
((void) sizeof ((
# 140 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h"
output_double <= error_limit
# 140 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 140 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h"
output_double <= error_limit
# 140 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h" 3 4
) ; else __assert_fail (
# 140 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h"
"output_double <= error_limit"
# 140 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h", 140, __extension__ __PRETTY_FUNCTION__); }))
# 140 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h"
;
return 0;
}
# 45 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 1
# 14 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
extern digital_system_state_space _controller;
int verify_controllability(void){
int i;
int j;
fxp_t A_fpx[4][4];
fxp_t B_fpx[4][4];
fxp_t controllabilityMatrix[4][4];
fxp_t backup[4][4];
fxp_t backupSecond[4][4];
double controllabilityMatrix_double[4][4];
for(i=0; i<nStates;i++){
for(j=0; j<(nStates*nInputs);j++){
A_fpx[i][j] = 0.0;
B_fpx[i][j] = 0.0;
controllabilityMatrix[i][j] = 0.0;
backup[i][j] = 0.0;
backupSecond[i][j] = 0.0;
controllabilityMatrix_double[i][j] = 0.0;
}
}
for(i=0; i<nStates;i++){
for(j=0; j<nStates;j++){
A_fpx[i][j]= fxp_double_to_fxp(_controller.A[i][j]);
}
}
for(i=0; i<nStates;i++){
for(j=0; j<nInputs;j++){
B_fpx[i][j]= fxp_double_to_fxp(_controller.B[i][j]);
}
}
if(nInputs > 1){
int l = 0;
for(j=0; j<(nStates*nInputs);){
fxp_exp_matrix(nStates,nStates,A_fpx,l,backup);
l++;
fxp_matrix_multiplication(nStates,nStates,nStates,nInputs,backup,B_fpx,backupSecond);
for(int k = 0; k < nInputs; k++){
for(i = 0; i<nStates;i++){
controllabilityMatrix[i][j]= backupSecond[i][k];
}
j++;
}
}
for(i=0; i<nStates;i++){
for(j=0; j<(nStates*nInputs);j++){
backup[i][j]= 0.0;
}
}
fxp_transpose(controllabilityMatrix,backup,nStates,(nStates*nInputs));
fxp_t mimo_controllabilityMatrix_fxp[4][4];
fxp_matrix_multiplication(nStates,(nStates*nInputs),(nStates*nInputs),nStates,controllabilityMatrix,backup,mimo_controllabilityMatrix_fxp);
for(i=0; i<nStates;i++){
for(j=0; j<nStates;j++){
controllabilityMatrix_double[i][j]= fxp_to_double(mimo_controllabilityMatrix_fxp[i][j]);
}
}
# 91 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
((void) sizeof ((
# 91 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
determinant(controllabilityMatrix_double,nStates) != 0
# 91 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 91 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
determinant(controllabilityMatrix_double,nStates) != 0
# 91 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
) ; else __assert_fail (
# 91 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
"determinant(controllabilityMatrix_double,nStates) != 0"
# 91 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h", 91, __extension__ __PRETTY_FUNCTION__); }))
# 91 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
;
} else {
for(j=0; j<nStates;j++){
fxp_exp_matrix(nStates,nStates,A_fpx,j,backup);
fxp_matrix_multiplication(nStates,nStates,nStates,nInputs,backup,B_fpx,backupSecond);
for(i = 0; i<nStates;i++){
controllabilityMatrix[i][j]= backupSecond[i][0];
}
}
for(i=0; i<nStates;i++){
for(j=0; j<nStates;j++){
controllabilityMatrix_double[i][j]= fxp_to_double(controllabilityMatrix[i][j]);
}
}
# 113 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
((void) sizeof ((
# 113 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
determinant(controllabilityMatrix_double,nStates) != 0
# 113 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 113 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
determinant(controllabilityMatrix_double,nStates) != 0
# 113 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
) ; else __assert_fail (
# 113 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
"determinant(controllabilityMatrix_double,nStates) != 0"
# 113 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h", 113, __extension__ __PRETTY_FUNCTION__); }))
# 113 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
;
}
return 0;
}
int verify_controllability_double(void){
int i;
int j;
double controllabilityMatrix[4][4];
double backup[4][4];
double backupSecond[4][4];
double controllabilityMatrix_double[4][4];
if(nInputs > 1){
int l = 0;
for(j=0; j<(nStates*nInputs);){
double_exp_matrix(nStates,nStates,_controller.A,l,backup);
l++;
double_matrix_multiplication(nStates,nStates,nStates,nInputs,backup,_controller.B,backupSecond);
for(int k = 0; k < nInputs; k++){
for(i = 0; i<nStates;i++){
controllabilityMatrix[i][j]= backupSecond[i][k];
}
j++;
}
}
for(i=0; i<nStates;i++){
for(j=0; j<(nStates*nInputs);j++){
backup[i][j]= 0.0;
}
}
transpose(controllabilityMatrix,backup,nStates,(nStates*nInputs));
double mimo_controllabilityMatrix_double[4][4];
double_matrix_multiplication(nStates,(nStates*nInputs),(nStates*nInputs),nStates,controllabilityMatrix,backup,mimo_controllabilityMatrix_double);
# 154 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
((void) sizeof ((
# 154 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
determinant(mimo_controllabilityMatrix_double,nStates) != 0
# 154 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 154 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
determinant(mimo_controllabilityMatrix_double,nStates) != 0
# 154 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
) ; else __assert_fail (
# 154 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
"determinant(mimo_controllabilityMatrix_double,nStates) != 0"
# 154 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h", 154, __extension__ __PRETTY_FUNCTION__); }))
# 154 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
;
} else {
for(j=0; j<nStates;j++){
double_exp_matrix(nStates,nStates,_controller.A,j,backup);
double_matrix_multiplication(nStates,nStates,nStates,nInputs,backup,_controller.B,backupSecond);
for(i = 0; i<nStates;i++){
controllabilityMatrix[i][j]= backupSecond[i][0];
}
}
# 163 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
((void) sizeof ((
# 163 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
determinant(controllabilityMatrix,nStates) != 0
# 163 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 163 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
determinant(controllabilityMatrix,nStates) != 0
# 163 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
) ; else __assert_fail (
# 163 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
"determinant(controllabilityMatrix,nStates) != 0"
# 163 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h", 163, __extension__ __PRETTY_FUNCTION__); }))
# 163 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
;
}
return 0;
}
# 46 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h" 1
# 17 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
extern digital_system_state_space _controller;
int verify_observability(void){
int i;
int j;
fxp_t A_fpx[4][4];
fxp_t C_fpx[4][4];
fxp_t observabilityMatrix[4][4];
fxp_t backup[4][4];
fxp_t backupSecond[4][4];
double observabilityMatrix_double[4][4];
for(i=0; i<nStates;i++){
for(j=0; j<nStates;j++){
observabilityMatrix[i][j]= 0;
A_fpx[i][j]=0;
C_fpx[i][j]= 0;
backup[i][j]= 0;
backupSecond[i][j]= 0;
}
}
for(i=0; i<nStates;i++){
for(j=0; j<nStates;j++){
A_fpx[i][j]= fxp_double_to_fxp(_controller.A[i][j]);
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<nStates;j++){
C_fpx[i][j]= fxp_double_to_fxp(_controller.C[i][j]);
}
}
if(nOutputs > 1){
int l;
j = 0;
for(l=0; l<nStates;){
fxp_exp_matrix(nStates,nStates,A_fpx,l,backup);
l++;
fxp_matrix_multiplication(nOutputs,nStates,nStates,nStates,C_fpx,backup,backupSecond);
for(int k = 0; k < nOutputs; k++){
for(i = 0; i<nStates;i++){
observabilityMatrix[j][i]= backupSecond[k][i];
}
j++;
}
}
# 80 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
for(i=0; i<nStates;i++){
for(j=0; j<(nStates*nOutputs);j++){
backup[i][j]= 0.0;
}
}
fxp_transpose(observabilityMatrix,backup,(nStates*nOutputs),nStates);
# 99 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
fxp_t mimo_observabilityMatrix_fxp[4][4];
fxp_matrix_multiplication(nStates,(nStates*nOutputs),(nStates*nOutputs),nStates,backup,observabilityMatrix,mimo_observabilityMatrix_fxp);
# 112 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
for(i=0; i<nStates;i++){
for(j=0; j<nStates;j++){
observabilityMatrix_double[i][j]= fxp_to_double(mimo_observabilityMatrix_fxp[i][j]);
}
}
# 119 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h" 3 4
((void) sizeof ((
# 119 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
determinant(observabilityMatrix_double,nStates) != 0
# 119 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 119 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
determinant(observabilityMatrix_double,nStates) != 0
# 119 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h" 3 4
) ; else __assert_fail (
# 119 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
"determinant(observabilityMatrix_double,nStates) != 0"
# 119 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h", 119, __extension__ __PRETTY_FUNCTION__); }))
# 119 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
;
}else{
for(i=0; i<nStates;i++){
fxp_exp_matrix(nStates,nStates,A_fpx,i,backup);
fxp_matrix_multiplication(nOutputs,nStates,nStates,nStates,C_fpx,backup,backupSecond);
for(j = 0; j<nStates;j++){
observabilityMatrix[i][j]= backupSecond[0][j];
}
}
for(i=0; i<nStates;i++){
for(j=0; j<nStates;j++){
observabilityMatrix_double[i][j]= fxp_to_double(observabilityMatrix[i][j]);
}
}
# 134 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h" 3 4
((void) sizeof ((
# 134 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
determinant(observabilityMatrix_double,nStates) != 0
# 134 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 134 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
determinant(observabilityMatrix_double,nStates) != 0
# 134 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h" 3 4
) ; else __assert_fail (
# 134 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
"determinant(observabilityMatrix_double,nStates) != 0"
# 134 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h", 134, __extension__ __PRETTY_FUNCTION__); }))
# 134 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
;
}
return 0;
}
# 47 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_magnitude.h" 1
# 16 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_magnitude.h"
extern filter_parameters filter;
extern implementation impl;
extern digital_system ds;
# 28 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_magnitude.h"
void resp_mag(double* num, int lnum, double* den, int lden, double* res, int N) {
double w;
int m, i;
double out_numRe[N + 1];
double out_numIm[N + 1];
double out_denRe[N + 1];
double out_denIm[N + 1];
double old_out_Re;
double zero_test;
for (w = 0, i = 0; w <= 3.14159265358979323846; w += 3.14159265358979323846 / N, ++i) {
out_numRe[i] = num[0];
out_numIm[i] = 0;
for (m = 1; m < lnum; ++m) {
old_out_Re = out_numRe[i];
out_numRe[i] = cosTyl(w, 6) * out_numRe[i] - sinTyl(w, 6) * out_numIm[i] + num[m];
out_numIm[i] = sinTyl(w, 6) * old_out_Re + cosTyl(w, 6) * out_numIm[i];
}
out_denRe[i] = den[0];
out_denIm[i] = 0;
for (m = 1; m < lden; ++m) {
old_out_Re = out_denRe[i];
out_denRe[i] = cosTyl(w, 6) * out_denRe[i] - sinTyl(w, 6) * out_denIm[i] + den[m];
out_denIm[i] = sinTyl(w, 6) * old_out_Re + cosTyl(w, 6) * out_denIm[i];
}
res[i] = sqrt3(out_numRe[i] * out_numRe[i] + out_numIm[i] * out_numIm[i]);
zero_test = sqrt3(out_denRe[i] * out_denRe[i] + out_denIm[i] * out_denIm[i]);
__DSVERIFIER_assume(zero_test != 0);
res[i] = res[i] / zero_test;
}
}
int verify_magnitude(void) {
int freq_response_samples = 100;
double w;
double w_incr = 1.0 / freq_response_samples;
double res[freq_response_samples+1];
int i,j;
fxp_t a_fxp[ds.a_size];
fxp_double_to_fxp_array(ds.a, a_fxp, ds.a_size);
double _a[ds.a_size];
fxp_to_double_array(_a, a_fxp, ds.a_size);
fxp_t b_fxp[ds.b_size];
fxp_double_to_fxp_array(ds.b, b_fxp, ds.b_size);
double _b[ds.b_size];
fxp_to_double_array(_b, b_fxp, ds.b_size);
resp_mag(ds.b, ds.b_size, ds.a, ds.a_size, res, freq_response_samples);
if (filter.type == 1) {
for (i = 0, w = 0; (w <= 1.0); ++i, w += w_incr) {
if (w <= filter.wp) {
__DSVERIFIER_assert_msg(res[i] >= filter.Ap, "|----------------Passband Failure-------------|");
} else if (w == filter.wc) {
__DSVERIFIER_assert_msg(res[i] <= filter.Ac, "|-------------Cutoff Frequency Failure--------|");
} else if ((w >= filter.wr) && (w <= 1)) {
__DSVERIFIER_assert_msg(res[i] <= filter.Ar, "|----------------Stopband Failure-------------|");
}
}
} else if (filter.type == 2) {
for (i = 0, w = 0; (w <= 1.0); ++i, w += w_incr) {
if (w <= filter.wr) {
__DSVERIFIER_assert_msg(res[i] <= filter.Ar, "|----------------Stopband Failure-------------|");
} else if (w == filter.wc) {
__DSVERIFIER_assert_msg(res[i] <= filter.Ac, "|-------------Cutoff Frequency Failure--------|");
} else if ((w > filter.wp) && (w <= 1)) {
__DSVERIFIER_assert_msg(res[i] >= filter.Ap, "|----------------Passband Failure-------------|");
}
}
} else {
__DSVERIFIER_assert(0);
}
return 0;
}
# 48 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
extern digital_system ds;
extern digital_system plant;
digital_system plant_cbmc;
extern digital_system controller;
extern implementation impl;
extern hardware hw;
extern digital_system_state_space _controller;
extern filter_parameters filter;
unsigned int nondet_uint();
extern void initials();
void validation();
void call_verification_task(void * verification_task);
void call_closedloop_verification_task(void * closedloop_verification_task);
float nondet_float();
double nondet_double();
int main(){
initialization();
validation();
if (1 == 0)
rounding_mode = 0;
else if (1 == 1)
rounding_mode = 1;
else if (1 == 2)
rounding_mode = 2;
if (3 == 3)
{
call_verification_task(&verify_overflow);
}
else if (3 == 2)
{
call_verification_task(&verify_limit_cycle);
}
else if (3 == 6)
{
call_verification_task(&verify_error);
}
else if (3 == 1)
{
call_verification_task(&verify_zero_input_limit_cycle);
}
else if (3 == 4)
{
call_verification_task(&verify_timing_msp_430);
}
else if (3 == 5)
{
call_verification_task(&verify_generic_timing);
}
else if (3 == 7)
{
call_verification_task(&verify_stability);
}
else if (3 == 8)
{
call_verification_task(&verify_minimum_phase);
}
else if (3 == 9)
{
call_closedloop_verification_task(&verify_stability_closedloop_using_dslib);
}
else if (3 == 10)
{
call_closedloop_verification_task(&verify_limit_cycle_closed_loop);
}
else if (3 == 11)
{
call_closedloop_verification_task(&verify_error_closedloop);
}
else if (3 == 12)
{
verify_error_state_space();
}
else if (3 == 16)
{
verify_safety_state_space();
}
else if (3 == 13)
{
verify_controllability();
}
else if (3 == 14)
{
verify_observability();
}
else if (3 == 15)
{
verify_limit_cycle_state_space();
}
else if (3 == 18)
{
call_verification_task(&verify_magnitude);
}
return 0;
}
void validation()
{
if (3 == 12 || 3 == 16 ||
3 == 15 || 3 == 13 ||
3 == 14)
{
if (0 == 0)
{
printf("\n\n********************************************************************************************\n");
printf("* set a K_SIZE to use this property in DSVerifier (use: -DK_SIZE=VALUE) *\n");
printf("********************************************************************************************\n");
__DSVERIFIER_assert(0);
exit(1);
}
initials();
return;
}
if (((3 != 9) && (3 != 10) &&
(3 != 11)) && (ds.a_size == 0 || ds.b_size == 0))
{
printf("\n\n****************************************************************************\n");
printf("* set (ds and impl) parameters to check with DSVerifier *\n");
printf("****************************************************************************\n");
__DSVERIFIER_assert(0);
}
if ((3 == 9) || (3 == 10) ||
(3 == 11))
{
if (controller.a_size == 0 || plant.b_size == 0 || impl.int_bits == 0 )
{
printf("\n\n*****************************************************************************************************\n");
printf("* set (controller, plant, and impl) parameters to check CLOSED LOOP with DSVerifier *\n");
printf("*****************************************************************************************************\n");
__DSVERIFIER_assert(0);
}
else
{
printf("\n\n*****************************************************************************************************\n");
printf("* set (controller and impl) parameters so that they do not overflow *\n");
printf("*****************************************************************************************************\n");
unsigned j;
for (j = 0; j < controller.a_size; ++j)
{
const double value=controller.a[j];
__DSVERIFIER_assert(value <= _dbl_max);
__DSVERIFIER_assert(value >= _dbl_min);
}
for (j = 0; j < controller.b_size; ++j)
{
const double value=controller.b[j];
__DSVERIFIER_assert(value <= _dbl_max);
__DSVERIFIER_assert(value >= _dbl_min);
}
}
if (controller.b_size > 0)
{
unsigned j, zeros=0;
for (j = 0; j < controller.b_size; ++j)
{
if (controller.b[j]==0)
++zeros;
}
if (zeros == controller.b_size)
{
printf("\n\n*****************************************************************************************************\n");
printf("* The controller numerator must not be zero *\n");
printf("*****************************************************************************************************\n");
__DSVERIFIER_assert(0);
}
}
if (controller.a_size > 0)
{
unsigned j, zeros=0;
for (j = 0; j < controller.a_size; ++j)
{
if (controller.a[j]==0)
++zeros;
}
if (zeros == controller.a_size)
{
printf("\n\n*****************************************************************************************************\n");
printf("* The controller denominator must not be zero *\n");
printf("*****************************************************************************************************\n");
__DSVERIFIER_assert(0);
}
}
if (0 == 0)
{
printf("\n\n***************************************************************************************************************\n");
printf("* set a connection mode to check CLOSED LOOP with DSVerifier (use: --connection-mode TYPE) *\n");
printf("***************************************************************************************************************\n");
__DSVERIFIER_assert(0);
}
}
if (3 == 0)
{
printf("\n\n***************************************************************************************\n");
printf("* set the property to check with DSVerifier (use: --property NAME) *\n");
printf("***************************************************************************************\n");
__DSVERIFIER_assert(0);
}
if ((3 == 3) || (3 == 2) || (3 == 1) ||
(3 == 10) || (3 == 11) ||
(3 == 4 || 3 == 5) || 3 == 6)
{
if ((10 == 0) && !(0 == 1))
{
printf("\n\n********************************************************************************************\n");
printf("* set a X_SIZE to use this property in DSVerifier (use: --x-size VALUE) *\n");
printf("********************************************************************************************\n");
__DSVERIFIER_assert(0);
}
else if (0 == 1)
{
X_SIZE_VALUE = nondet_uint();
__DSVERIFIER_assume( X_SIZE_VALUE > (2 * ds.a_size));
}
else if (10 < 0)
{
printf("\n\n********************************************************************************************\n");
printf("* set a X_SIZE > 0 *\n");
printf("********************************************************************************************\n");
__DSVERIFIER_assert(0);
}
else
{
X_SIZE_VALUE = 10;
}
}
if ((3 == 0) && (3 != 9) && (3 != 18))
{
printf("\n\n*********************************************************************************************\n");
printf("* set the realization to check with DSVerifier (use: --realization NAME) *\n");
printf("*********************************************************************************************\n");
__DSVERIFIER_assert(0);
}
if (3 == 6 || 3 == 11)
{
if (impl.max_error == 0)
{
printf("\n\n***********************************************************************\n");
printf("* provide the maximum expected error (use: impl.max_error) *\n");
printf("***********************************************************************\n");
__DSVERIFIER_assert(0);
}
}
if (3 == 4 || 3 == 5)
{
if (3 == 5 || 3 == 4)
{
if (hw.clock == 0l)
{
printf("\n\n***************************\n");
printf("* Clock could not be zero *\n");
printf("***************************\n");
__DSVERIFIER_assert(0);
}
hw.cycle = ((double) 1.0 / hw.clock);
if (hw.cycle < 0)
{
printf("\n\n*********************************************\n");
printf("* The cycle time could not be representable *\n");
printf("*********************************************\n");
__DSVERIFIER_assert(0);
}
if (ds.sample_time == 0)
{
printf("\n\n*****************************************************************************\n");
printf("* provide the sample time of the digital system (ds.sample_time) *\n");
printf("*****************************************************************************\n");
__DSVERIFIER_assert(0);
}
}
}
if (3 == 18)
{
if (!((filter.Ap > 0) && (filter.Ac >0) && (filter.Ar >0)))
{
printf("\n\n*****************************************************************************\n");
printf("* set values bigger than 0 for Ap, Ac and Ar* \n");
printf("*****************************************************************************\n");
__DSVERIFIER_assert(0);
}
}
if ((3 == 7) || (3 == 8) || (3 == 9) ||
(3 == 10) || (3 == 11) || (3 == 12))
{
printf("\n\n******************************************\n");
printf("* Temporarily the cascade modes are disabled *\n");
printf("**********************************************\n");
__DSVERIFIER_assert(0);
}
}
void call_verification_task(void * verification_task)
{
int i = 0;
_Bool base_case_executed = 0;
if (0 == 2)
{
for(i=0; i<ds.b_size; i++)
{
if (ds.b_uncertainty[i] > 0)
{
double factor = ds.b_uncertainty[i];
factor = factor < 0 ? factor * (-1) : factor;
double min = ds.b[i] - factor;
double max = ds.b[i] + factor;
if ((factor == 0) && (base_case_executed == 1))
{
continue;
}
else if ((factor == 0) && (base_case_executed == 0))
{
base_case_executed = 1;
}
ds.b[i] = nondet_double();
__DSVERIFIER_assume((ds.b[i] >= min) && (ds.b[i] <= max));
}
}
for(i=0; i<ds.a_size; i++)
{
if (ds.a_uncertainty[i] > 0)
{
double factor = ds.a_uncertainty[i];
factor = factor < 0 ? factor * (-1) : factor;
double min = ds.a[i] - factor;
double max = ds.a[i] + factor;
if ((factor == 0) && (base_case_executed == 1))
{
continue;
}
else if ((factor == 0) && (base_case_executed == 0))
{
base_case_executed = 1;
}
ds.a[i] = nondet_double();
__DSVERIFIER_assume((ds.a[i] >= min) && (ds.a[i] <= max));
}
}
}
else
{
int i=0;
for(i=0; i<ds.b_size; i++)
{
if (ds.b_uncertainty[i] > 0)
{
double factor = ((ds.b[i] * ds.b_uncertainty[i]) / 100);
factor = factor < 0 ? factor * (-1) : factor;
double min = ds.b[i] - factor;
double max = ds.b[i] + factor;
if ((factor == 0) && (base_case_executed == 1))
{
continue;
}
else if ((factor == 0) && (base_case_executed == 0))
{
base_case_executed = 1;
}
ds.b[i] = nondet_double();
__DSVERIFIER_assume((ds.b[i] >= min) && (ds.b[i] <= max));
}
}
for(i=0; i<ds.a_size; i++)
{
if (ds.a_uncertainty[i] > 0)
{
double factor = ((ds.a[i] * ds.a_uncertainty[i]) / 100);
factor = factor < 0 ? factor * (-1) : factor;
double min = ds.a[i] - factor;
double max = ds.a[i] + factor;
if ((factor == 0) && (base_case_executed == 1))
{
continue;
}
else if ((factor == 0) && (base_case_executed == 0))
{
base_case_executed = 1;
}
ds.a[i] = nondet_double();
__DSVERIFIER_assume((ds.a[i] >= min) && (ds.a[i] <= max));
}
}
}
((void(*)())verification_task)();
}
void call_closedloop_verification_task(void * closedloop_verification_task)
{
_Bool base_case_executed = 0;
int i=0;
for(i=0; i<plant.b_size; i++)
{
if (plant.b_uncertainty[i] > 0)
{
double factor = ((plant.b[i] * plant.b_uncertainty[i]) / 100);
factor = factor < 0 ? factor * (-1) : factor;
double min = plant.b[i] - factor;
double max = plant.b[i] + factor;
if ((factor == 0) && (base_case_executed == 1))
{
continue;
}
else if ((factor == 0) && (base_case_executed == 0))
{
base_case_executed = 1;
}
plant.b[i] = nondet_double();
__DSVERIFIER_assume((plant.b[i] >= min) && (plant.b[i] <= max));
}else{
}
}
for(i=0; i<plant.a_size; i++)
{
if (plant.a_uncertainty[i] > 0)
{
double factor = ((plant.a[i] * plant.a_uncertainty[i]) / 100);
factor = factor < 0 ? factor * (-1) : factor;
double min = plant.a[i] - factor;
double max = plant.a[i] + factor;
if ((factor == 0) && (base_case_executed == 1))
{
continue;
}
else if ((factor == 0) && (base_case_executed == 0))
{
base_case_executed = 1;
}
plant.a[i] = nondet_double();
__DSVERIFIER_assume((plant.a[i] >= min) && (plant.a[i] <= max));
}
else
{
}
}
((void(*)())closedloop_verification_task)();
}
# 2 "benchmarks/ds-01-impl2.c" 2
digital_system ds = {
.b = { 1.5, -0.5 },
.b_size = 2,
.a = { 1.0, 0.0 },
.a_size = 2,
.sample_time = 0.02
};
implementation impl = {
.int_bits = 4,
.frac_bits = 12,
.max = 1.0,
.min = -1.0
};
|
the_stack_data/498610.c | // Convert the df32.mif file to Forth source, for loading into flash memory.
#include <stdint.h>
#include <stdio.h>
uint16_t mem [32768];
int main () {
FILE* fp = fopen("df32.mif", "r");
if (fp == 0) {
perror("df32.mif");
return 1;
}
char line [100];
while (fgets(line, sizeof line, fp) != 0) {
int addr, data;
if (sscanf(line, "%o:%o;", &addr, &data) == 2)
mem[addr] = data;
}
/*
$00010000 variable maddr
: f^ ( -- ) \ erase flash before filling it
maddr @ dup $10000 + swap
do
[char] . emit i flashpageerase
1024 +loop
;
: f, ( a u -- a ) \ save word to flash and advance address
2dup swap hflash!
16 rshift over 2+ hflash!
4 +
;
: m, ( u1 u2 u3 u4 u5 u6 u7 u8 -- ) \ save next 32 bytes to flash
>r >r >r >r >r >r >r >r
maddr @
r> f, r> f, r> f, r> f, r> f, r> f, r> f, r> f,
maddr !
;
*/
printf("$00010000 variable maddr\n");
printf(": f^ maddr @ dup $10000 + swap\n");
printf(" do [char] . emit i flashpageerase 1024 +loop ;\n");
printf(": f, 2dup swap hflash! 16 rshift over 2+ hflash! 4 + ;\n");
printf(": m, >r >r >r >r >r >r >r >r maddr @\n");
printf(" r> f, r> f, r> f, r> f, r> f, r> f, r> f, r> f, maddr ! ;\n");
printf("f^ hex\n");
for (int i = 0; i < sizeof mem / 4; i += 8) {
printf(" ");
for (int j = 0; j < 8; ++j)
printf(" %08x", ((const uint32_t*) mem)[i+j]);
printf(" m,\n");
}
printf("decimal\n");
return 0;
}
|
the_stack_data/247017101.c | //Copyright (c) 2016, Kauê Rodrigues
#include <stdio.h>
struct Carta {
int valor;
int naipe;
};
int main()
{
struct Carta baralho[52];
int i;
for(i=0; i<52; i++)
{
baralho[i].valor = i%13;
baralho[i].naipe = i/13;
}
for(i=0; i<52; i++)
{
int v = baralho[i].valor;
int n = baralho[i].naipe;
if(v > 0 && v < 10)
{
printf("%d", v+1);
}
else if(v == 0)
{
printf("A");
}
else if(v == 10)
{
printf("J");
}
else if(v == 11)
{
printf("Q");
}
else
{
printf("K");
}
printf(" de ");
if(n==0)
{
printf("Ouros\n");
}
else if(n==1)
{
printf("Espadas\n");
}
else if(n==2)
{
printf("Copas\n");
}
else
{
printf("Paus\n");
}
}
return 0;
}
|
the_stack_data/22012878.c | #include <stdio.h>
#include <stdlib.h>
//
// qemu_toflash
//
// python /home/olas/esp/esp-idf/components/esptool_py/esptool/esptool.py --chip esp32 --port /dev/ttyUSB0 --baud 115200 --before default_reset --after hard_reset write_flash -z --flash_mode dio --flash_freq 40m --flash_size detect
// 0x1000 /home/olas/esp/esp-idf/examples/system/ota/build/bootloader/bootloader.bin
// 0x10000 /home/olas/esp/esp-idf/examples/system/ota/build/ota.bin
// 0x8000 /home/olas/esp/esp-idf/examples/system/ota/build/partitions_two_ota.bin
//
void merge_flash(char *binfile,char *flashfile,int flash_pos,int patch_hash)
{
FILE *fbin;
FILE *fflash;
unsigned char *tmp_data;
int j=0;
int file_size=0;
int flash_size=0;
fbin = fopen(binfile, "r");
if (fbin == NULL) {
printf(" Can't open '%s' for reading.\n", binfile);
return;
}
if (fseek(fbin, 0 , SEEK_END) != 0) {
/* Handle Error */
}
file_size = ftell(fbin);
if (fseek(fbin, 0 , SEEK_SET) != 0) {
/* Handle Error */
}
fflash = fopen(flashfile, "r+");
if (fflash == NULL) {
printf(" Can't open '%s' for writing.\n", flashfile);
return;
}
if (fseek(fflash, 0 , SEEK_END) != 0) {
/* Handle Error */
}
flash_size = ftell(fflash);
rewind(fflash);
fseek(fflash,flash_pos,SEEK_SET);
//flash_data=malloc((1+flash_size)*sizeof(char));
//int len_read=fread(tmp_data,sizeof(char),file_size,fbin);
tmp_data=malloc((1+file_size)*sizeof(char));
//size_t fread(void *ptr, size_t size, size_t nmemb, FILE *stream);
//size_t fwrite(const void *ptr, size_t size, size_t nmemb,
// FILE *stream);
if (file_size<=0) {
printf("Not able to get file size %s",binfile);
}
int len_read=fread(tmp_data,sizeof(char),file_size,fbin);
if (patch_hash==1) {
for (j=0;j<33;j++)
{
tmp_data[file_size-j]=0;
}
}
int len_write=fwrite(tmp_data,sizeof(char),file_size,fflash);
if (len_read!=len_write) {
printf("Not able to merge %s",binfile);
}
fclose(fbin);
if (fseek(fflash, 0 , SEEK_END) != 0) {
}
fclose(fflash);
free(tmp_data);
}
int main(int argc,char *argv[])
{
// system("cp esp32flash.bin esp32flash.bak");
// Overwrites esp32flash.bin file, you can only need to do this once
system("dd if=/dev/zero bs=1M count=4 | tr \"\\000\" \"\\377\" > esp32flash.bin");
// Add bootloader
merge_flash("build/bootloader/bootloader.bin","esp32flash.bin",0x1000,0);
// Add partitions, test OTA here
merge_flash("build/ota_data_initial.bin","esp32flash.bin",0xd000 ,0);
merge_flash("build/partition_table/partition-table.bin","esp32flash.bin",0x8000,0);
// Add application
merge_flash(argv[1],"esp32flash.bin",0x10000,0);
system("cp esp32flash.bin ~/qemu_esp32");
}
|
the_stack_data/234518494.c | #define _GNU_SOURCE
#include <dlfcn.h>
#include <errno.h>
#include <string.h>
#include <unistd.h>
int unlinkat(int dirfd, const char* pathname, int flags) {
if (strstr(pathname, "FIX")) {
errno = EPERM;
return -1;
}
int (*f)() = dlsym(RTLD_NEXT, "unlinkat");
return f(dirfd, pathname, flags);
} |
the_stack_data/246222.c | //To invert the given String
//Note: in char, space is treated as charachter so give a space before using %c
#include<stdio.h>
int main(){
char arr1[10],arr2[10]={0,0,0,0,0,0,0,0,0};
char i,j=0,temp;
int n;
printf("Enter the length of the word:");
scanf("%d",&n);
printf("Enter the word: \n");
for(i=0;i<n;i++){
scanf(" %c",&arr1[i]);
}
for (i=n;i>=0;i--){
while(j>=0){
arr2[j]=arr1[i-1];
j++;
break;
}
}
printf("The reversed word is : ");
for(j=0;j<n;j++){
printf(" %c",arr2[j]);
}
return 0;
}
|
the_stack_data/873913.c | #include <stdio.h>
int main() {
int number;
scanf("%d",&number);
int horas;
scanf("%d",&horas);
double valor;
scanf("%lf",&valor);
printf("NUMBER = %d\n",number);
printf("SALARY = U$ %.2lf\n",horas*valor);
} |
the_stack_data/182951746.c | #include <assert.h>
#include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
// replace all illegal character with `_`
char *file_name_to_variable_name(char *name)
{
int l = strlen(name);
for (int i = 0; i < l; ++i) {
if (!isalpha(name[i]) && !isdigit(name[i])) {
name[i] = '_';
}
}
return name;
}
static inline char to_hex(int num)
{
if (0 <= num && num <= 9) {
return '0' + num;
} else {
return 'a' + num - 10;
}
}
char *escaped_file_content(FILE *f, int *file_size)
{
static char *buff = NULL;
static int size = 1;
int length = 0;
int ch;
*file_size = 0;
while ((ch = fgetc(f)) != EOF) {
if (length + 6 >= size) {
size *= 2;
buff = realloc(buff, size);
}
assert(buff != NULL);
*file_size = (*file_size) + 1;
buff[length++] = '0';
buff[length++] = 'x';
buff[length++] = to_hex((ch & 0xf0) >> 4);
buff[length++] = to_hex(ch & 0xf);
buff[length++] = ',';
if ((*file_size) % 16 == 0) {
buff[length++] = '\n';
}
}
return buff;
}
int main(int argc, char *argv[])
{
if (argc < 2) {
printf(
"Usage: elf2char [--header-only] <File Name> <File "
"Name> ...");
return -1;
}
int is_header_only = 0;
for (int i = 0; i < argc; ++i) {
if (strcmp(argv[i], "--header-only") == 0) {
is_header_only = 1;
}
}
for (int i = 1; i < argc; ++i) {
if (strcmp(argv[i], "--header-only") == 0) continue;
FILE *f = fopen(argv[i], "rb");
if (f == NULL) {
printf("ERROR: Unable to open %s\n", argv[i]);
return -1;
}
if (is_header_only) {
printf(
"extern unsigned char _elf_%s[];\n",
file_name_to_variable_name(argv[i]));
// argv[i] already changed by
// file_name_to_variable_name
printf("int _length_%s;\n", argv[i]);
} else {
int file_size = 0;
printf(
"unsigned char _elf_%s[] = {\n%s\n};\n",
file_name_to_variable_name(argv[i]),
escaped_file_content(f, &file_size));
// argv[i] already changed by
// file_name_to_variable_name
printf("int _length_%s = %d;\n", argv[i], file_size);
}
fclose(f);
}
return 0;
}
|
the_stack_data/128743.c | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
/* more headers goes there */
/* betty style doc for function main goes there */
/**
* main - Entry point
*
* Return: Always 0 (Success)
*/
int main(void)
{
int n;
int last;
srand(time(0));
n = rand() - RAND_MAX / 2;
/* your code goes there */
last = n % 10;
if (last > 5)
{
printf("Last digit of %d is %d and is greater than 5\n", n, last);
}
else if (last == 0)
{
printf("Last digit of %d is %d and is 0\n", n, last);
}
else
{
printf("Last digit of %d is %d and is less than 6 and not 0\n", n, last);
}
return (0);
}
|
the_stack_data/7950587.c | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<ctype.h>
#include<math.h>
typedef struct node{
char name[100] ;
struct node * next;
}node ;
node * insert_last(node * last , char * name)
{
node * newnode = (node * )malloc(sizeof(node)) ;
strcpy(newnode->name , name) ;
newnode->next = newnode ;
if(!last) return newnode ;
newnode->next = last->next ;
last->next = newnode ;
return newnode ;
}
node * delete_node(node * list)
{
if(!list) return 0 ;
node * todelete = list->next ;
printf("%s " , todelete->name) ;
list->next = todelete->next ;
free(todelete) ;
return list ;
}
int main(void)
{
int n , soldiers ; char name[100] ;
node * list = 0 ;
printf("Enter number of soldiers : ") ; scanf("%d" , &soldiers) ;
printf("Enter n : ") ; scanf("%d" , &n) ;
int i = 0;
for(i =0 ; i< soldiers ; i++)
{
printf("Enter name : ") ;
scanf("%s" , name) ;
list = insert_last(list , name) ;
}
while(list->next!=list)
{
for(i = 1; i< n ; i++)
list = list->next ;
list = delete_node(list) ;
}
printf("\n\nSoldier who escapes is : %s" , list->name) ;
} |
the_stack_data/1013673.c | #include <stdio.h>
//逗号表达式
//用来链接两个表达式，并以右边的表达式的值作为结果
//主要在for中使用
/*
逗号用来连接两个表达式，并以其右边的
表达式的值作为它的结果。逗号的优先级
是所有的运算符中最低的（比赋值还低），所以它两边的
表达式会先计算；逗号的组合关系是自左
向右，所以左边的表达式会先计算，而右
边的表达式的值就留下来作为逗号运算的
结果。
*/
//在函数f(a, b)中的逗号只是一个分隔参数的普通逗号
//在函数f((a, b))中的逗号是逗号表达式。与上面的区别在于多了一层括号
int main()
{
printf("Hello World!\n");
return 0;
} |
the_stack_data/142119.c | //
// Created by lifan on 2021/5/26.
//
#include <pthread.h>
typedef struct job {
struct job* j_next;
struct job* j_prev;
pthread_t pid;
} job;
typedef struct queue {
job* q_head;
job* q_tail;
pthread_rwlock_t q_lock;
} queue;
int queue_init(queue *qp) {
int err;
qp->q_head = NULL;
qp->q_tail = NULL;
err = pthread_rwlock_init(&qp->q_lock, NULL);
if (err != 0)
return err;
return 0;
}
/*
* 在头部插入job
*/
void job_insert(queue* qp, job* jp) {
pthread_rwlock_wrlock(&qp->q_lock);
jp->j_next = qp->q_head;
jp->j_prev = NULL;
if (qp->q_head != NULL)
qp->q_head->j_prev = jp;
else
qp->q_tail = jp;
qp->q_head = jp;
pthread_rwlock_unlock(&qp->q_lock);
}
/*
* 在尾部插入job
*/
void job_append(queue* qp, job* jp) {
pthread_rwlock_wrlock(&qp->q_lock); //写锁
jp->j_prev = qp->q_tail;
jp->j_next = NULL;
if (qp->q_tail != NULL)
qp->q_tail->j_next = jp;
else
qp->q_head = jp;
qp->q_tail = jp;
pthread_rwlock_unlock(&qp->q_lock);
}
/*
* 删除job
*/
void job_remove(queue* qp, job* jp) {
pthread_rwlock_wrlock(&qp->q_lock); //读锁
if (qp->q_head == jp) {
qp->q_head = jp->j_next;
if (qp->q_tail == jp)
qp->q_tail = NULL;
else
jp->j_next->j_prev = jp->j_prev;
} else if (qp->q_tail == jp) {
qp->q_tail = jp->j_prev;
jp->j_prev->j_next = jp->j_next;
} else {
jp->j_prev->j_next = jp->j_next;
jp->j_next->j_prev = jp->j_prev;
}
pthread_rwlock_unlock(&qp->q_lock);
}
/*
* find job
*/
job* job_find(queue* qp, pthread_t job_id) {
if (pthread_rwlock_rdlock(&qp->q_lock) != 0)
return NULL;
job* jp = qp->q_head;
while (jp != NULL && jp->pid != job_id)
jp = jp->j_next;
pthread_rwlock_unlock(&qp->q_lock);
return jp;
} |
the_stack_data/104828029.c | // Fig. 9.5: fig09_05.c
// Using the character and string conversion specifiers
#include <stdio.h>
int main(int argc, char const *argv[]) {
char character = 'A';
printf("%c\n", character);
printf("%s\n", "This is a string");
char string[] = "This is a string";
printf("%s\n", string);
const char stringPtr[] = "This is also a string";
printf("%s\n", stringPtr);
}
|
the_stack_data/50138348.c | #define _GNU_SOURCE
#include <ctype.h>
#include <errno.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/shm.h>
#include <time.h>
#include <unistd.h>
#include <wait.h>
#include "semaphore.h"
// ipcrm and ipcs are used to see if semaphores are being free-d
#define SCALE_FACTOR 1000000
#define MEM_KEY 1234
int *num_running;
int semid;
/**
* Determines if the string input represent a valid integer.
*/
bool is_integer(const char *input) {
int start = 0, len = strlen(input), i;
if (len >= 1 && input[0] == '-') {
if (len < 2) {
return false;
}
start = 1;
}
for (i = start; i < len; i++) {
if (!isdigit(input[i])) {
return false;
}
}
return true;
}
/**
* Attempts to convert the input string into the integer i.
* Returns true if the conversion was successful, false otherwise.
*/
bool parse_int(const char *input, int *i, const char *usage) {
long long long_long_i;
if (strlen(input) == 0) {
fprintf(stderr, "Error: Invalid input '' received for %s.\n", usage);
return false;
}
if (is_integer(input) && sscanf(input, "%lld", &long_long_i) == 1) {
*i = (int)long_long_i;
if (long_long_i != *i) {
fprintf(stderr, "Error: Integer overflow for %s.\n", usage);
return false;
}
} else {
fprintf(stderr, "Error: Invalid input '%s' received for %s.\n", input,
usage);
return false;
}
return true;
}
/**
* Returns a random integer in the range [low, high].
*/
int random_int_in_range(int low, int high) {
return low + rand() % (high - low + 1);
}
/**
* Causes the process to sleep for a random amount of time.
*/
void random_sleep() {
long pid = (long)getpid();
srand(time(NULL) ^ pid);
useconds_t sleep_time =
(useconds_t)random_int_in_range(0 * SCALE_FACTOR, 0.75 * SCALE_FACTOR);
printf("I, pid %ld, am going to sleep for %.2f seconds.\n", pid,
(double)sleep_time / SCALE_FACTOR);
usleep(sleep_time);
printf("I, pid %ld, have awakened.\n", pid);
if (P(semid) != EXIT_SUCCESS) {
fprintf(stderr, "Warning: P() failed in child pid %ld.\n", pid);
}
(*num_running)--;
if (V(semid) != EXIT_SUCCESS) {
fprintf(stderr, "Warning: V() failed in child pid %ld.\n", pid);
}
}
int main(int argc, char *argv[]) {
int retval = EXIT_SUCCESS;
if (argc != 2) {
fprintf(stderr, "Usage: %s <num processes>\n", argv[0]);
return EXIT_FAILURE;
}
int num_processes = 0;
if (!parse_int(argv[1], &num_processes, "number of processes") ||
num_processes <= 0) {
fprintf(stderr, "Error: Invalid number of processes '%s'.\n", argv[1]);
return EXIT_FAILURE;
}
key_t key;
if ((key = ftok("./", 'a')) == -1) {
fprintf(stderr, "Error: ftok() failed. '%s'.\n", strerror(errno));
return EXIT_FAILURE;
}
if ((semid = create_semaphore(key)) == -1) {
return EXIT_FAILURE;
}
if ((retval = set_sem_value(semid, 1)) != EXIT_SUCCESS) {
goto EXIT;
}
int shmid;
if ((shmid = shmget(key, sizeof(int), 0666 | IPC_CREAT)) == -1) {
fprintf(stderr, "Error: Cannot get shared memory. '%s'", strerror(errno));
retval = EXIT_FAILURE;
goto EXIT;
}
void *shm = shmat(shmid, NULL, 0);
if (shm == (void *)-1) {
fprintf(stderr, "Error: Cannot attach shared memory. '%s'",
strerror(errno));
retval = EXIT_FAILURE;
goto EXIT;
}
num_running = (int *)shm;
*num_running = 0; // going into region of shared memory accessible elsewhere
pid_t pid;
int num_started = 0;
for (int i = 1; i <= num_processes; i++) {
if ((pid = fork()) < 0) {
fprintf(stderr, "Error: process[%d] failed. %s.\n", i, strerror(errno));
continue;
} else if (pid == 0) {
random_sleep();
exit(EXIT_SUCCESS); // Make sure child process exits.
} else {
num_started++;
if (P(semid) != EXIT_SUCCESS) {
fprintf(stderr, "Warning: P() failed in parent.\n");
}
(*num_running)++;
if (V(semid) != EXIT_SUCCESS) {
fprintf(stderr, "Warning: V() failed in parent.\n");
}
}
}
for (int i = 0; i < num_started; i++) {
pid_t child_pid = wait(NULL);
if (child_pid < 0) {
fprintf(stderr, "Error: wait() failed. %s.\n", strerror(errno));
} else {
printf("Child with pid %ld has terminated.\n", (long)child_pid);
}
}
if ((*num_running) == 0) {
printf("All children are done sleeping.\n");
} else if ((*num_running) == 1) {
printf("1 child is still sleeping.\n");
} else {
printf("%d children are still sleeping.\n", (*num_running));
}
EXIT:
if (shm != (void *)-1 && shmdt(shm) == -1) {
fprintf(stderr, "Error: cannot detach shared memory. '%s'.\n",
strerror(errno));
return EXIT_FAILURE;
}
if (shm != (void *)-1 && shmctl(shmid, IPC_RMID, 0) == -1) {
fprintf(stderr, "Error: Cannot free shared memory. '%s'.\n",
strerror(errno));
return EXIT_FAILURE;
}
return retval;
}
|
the_stack_data/15763042.c | //Program to find transpose of a matrix
#include <stdio.h>
void main()
{
int m, n, i, j;
//Entering number of rows and columns
printf("Enter the number of rows:\n");
scanf("%d", &m);
printf("Enter the number of columns:\n");
scanf("%d", &n);
int a[m][n], b[n][m];
//Entering elements into the array
for (i = 0; i < m; i++)
{
for (j = 0; j < n; j++)
{
printf("\nEnter the a[%d][%d] element ", i, j);
scanf("%d", &a[i][j]);
}
}
for (i = 0; i < n; i++)
{
for (j = 0; j < m; j++)
{
b[i][j] = a[j][i];
}
}
//Displaying the enetered matrix
printf("\nThe matrix you enteredis:\n");
for (i = 0; i < m; i++)
{
for (j = 0; j < n; j++)
{
printf("\t%d", a[i][j]);
}
printf("\n");
}
//Displaying transpose matrix
printf("\nThe transpose of the matrix is:\n");
for (i = 0; i < n; i++)
{
for (j = 0; j < m; j++)
{
printf("\t%d", b[i][j]);
}
printf("\n");
}
} |
the_stack_data/198580925.c | extern void __VERIFIER_error() __attribute__ ((__noreturn__));
void __VERIFIER_assert(int cond) { if(!(cond)) { ERROR: __VERIFIER_error(); } }
#define N 200
int main ( ) {
int a[N]; int e;
int i = 0;
while( i < N && a[i] != e ) {
i = i + 1;
}
int x;
for ( x = 0 ; x < i ; x++ ) {
__VERIFIER_assert( a[x] != e );
}
return 0;
}
|
the_stack_data/161079424.c | #include <stddef.h> /* for size_t */
#include <string.h>
void *memset(void * const ptr, const int value, const size_t num) {
unsigned char * const buffer = (unsigned char * const)ptr;
for(size_t i = 0; i < num; ++i) {
buffer[i] = (unsigned char) value;
}
return ptr;
}
|
the_stack_data/143291.c | /***************************************************************************//**
@file main.c
@author Stephen Brennan
@date Thursday, 8 January 2015
@brief LSH (Libstephen SHell)
*******************************************************************************/
#include <sys/wait.h>
#include <sys/types.h>
#include <unistd.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
/*
Function Declarations for builtin shell commands:
*/
int lsh_cd(char **args);
int lsh_help(char **args);
int lsh_exit(char **args);
/*
List of builtin commands, followed by their corresponding functions.
*/
char *builtin_str[] = {
"cd",
"help",
"exit"
};
int (*builtin_func[]) (char **) = {
&lsh_cd,
&lsh_help,
&lsh_exit
};
int lsh_num_builtins() {
return sizeof(builtin_str) / sizeof(char *);
}
/*
Builtin function implementations.
*/
/**
@brief Bultin command: change directory.
@param args List of args. args[0] is "cd". args[1] is the directory.
@return Always returns 1, to continue executing.
*/
int lsh_cd(char **args)
{
if (args[1] == NULL) {
fprintf(stderr, "lsh: expected argument to \"cd\"\n");
} else {
if (chdir(args[1]) != 0) {
perror("lsh");
}
}
return 1;
}
/**
@brief Builtin command: print help.
@param args List of args. Not examined.
@return Always returns 1, to continue executing.
*/
int lsh_help(char **args)
{
int i;
printf("Stephen Brennan's LSH\n");
printf("Type program names and arguments, and hit enter.\n");
printf("The following are built in:\n");
for (i = 0; i < lsh_num_builtins(); i++) {
printf(" %s\n", builtin_str[i]);
}
printf("Use the man command for information on other programs.\n");
return 1;
}
/**
@brief Builtin command: exit.
@param args List of args. Not examined.
@return Always returns 0, to terminate execution.
*/
int lsh_exit(char **args)
{
return 0;
}
/**
@brief Launch a program and wait for it to terminate.
@param args Null terminated list of arguments (including program).
@return Always returns 1, to continue execution.
*/
int lsh_launch(char **args)
{
pid_t pid;
int status;
pid = fork();
if (pid == 0) {
// Child process
if (execvp(args[0], args) == -1) {
perror("lsh");
}
exit(EXIT_FAILURE);
} else if (pid < 0) {
// Error forking
perror("lsh");
} else {
// Parent process
do {
waitpid(pid, &status, WUNTRACED);
} while (!WIFEXITED(status) && !WIFSIGNALED(status));
}
return 1;
}
/**
@brief Execute shell built-in or launch program.
@param args Null terminated list of arguments.
@return 1 if the shell should continue running, 0 if it should terminate
*/
int lsh_execute(char **args)
{
int i;
if (args[0] == NULL) {
// An empty command was entered.
return 1;
}
for (i = 0; i < lsh_num_builtins(); i++) {
if (strcmp(args[0], builtin_str[i]) == 0) {
return (*builtin_func[i])(args);
}
}
return lsh_launch(args);
}
/**
@brief Read a line of input from stdin.
@return The line from stdin.
*/
char *lsh_read_line(void)
{
#ifdef LSH_USE_STD_GETLINE
char *line = NULL;
ssize_t bufsize = 0; // have getline allocate a buffer for us
if (getline(&line, &bufsize, stdin) == -1) {
if (feof(stdin)) {
exit(EXIT_SUCCESS); // We received an EOF
} else {
perror("lsh: getline\n");
exit(EXIT_FAILURE);
}
}
return line;
#else
#define LSH_RL_BUFSIZE 1024
int bufsize = LSH_RL_BUFSIZE;
int position = 0;
char *buffer = malloc(sizeof(char) * bufsize);
int c;
if (!buffer) {
fprintf(stderr, "lsh: allocation error\n");
exit(EXIT_FAILURE);
}
while (1) {
// Read a character
c = getchar();
if (c == EOF) {
exit(EXIT_SUCCESS);
} else if (c == '\n') {
buffer[position] = '\0';
return buffer;
} else {
buffer[position] = c;
}
position++;
// If we have exceeded the buffer, reallocate.
if (position >= bufsize) {
bufsize += LSH_RL_BUFSIZE;
buffer = realloc(buffer, bufsize);
if (!buffer) {
fprintf(stderr, "lsh: allocation error\n");
exit(EXIT_FAILURE);
}
}
}
#endif
}
#define LSH_TOK_BUFSIZE 64
#define LSH_TOK_DELIM " \t\r\n\a"
/**
@brief Split a line into tokens (very naively).
@param line The line.
@return Null-terminated array of tokens.
*/
char **lsh_split_line(char *line)
{
int bufsize = LSH_TOK_BUFSIZE, position = 0;
char **tokens = malloc(bufsize * sizeof(char*));
char *token, **tokens_backup;
if (!tokens) {
fprintf(stderr, "lsh: allocation error\n");
exit(EXIT_FAILURE);
}
token = strtok(line, LSH_TOK_DELIM);
while (token != NULL) {
tokens[position] = token;
position++;
if (position >= bufsize) {
bufsize += LSH_TOK_BUFSIZE;
tokens_backup = tokens;
tokens = realloc(tokens, bufsize * sizeof(char*));
if (!tokens) {
free(tokens_backup);
fprintf(stderr, "lsh: allocation error\n");
exit(EXIT_FAILURE);
}
}
token = strtok(NULL, LSH_TOK_DELIM);
}
tokens[position] = NULL;
return tokens;
}
/**
@brief Loop getting input and executing it.
*/
void lsh_loop(void)
{
char *line;
char **args;
int status;
do {
printf("dish-> ");
line = lsh_read_line();
args = lsh_split_line(line);
status = lsh_execute(args);
free(line);
free(args);
} while (status);
}
/**
@brief Main entry point.
@param argc Argument count.
@param argv Argument vector.
@return status code
*/
int main(int argc, char **argv)
{
// Load config files, if any.
// Run command loop.
lsh_loop();
// Perform any shutdown/cleanup.
return EXIT_SUCCESS;
}
|
the_stack_data/987174.c | #include<stdio.h>
int lcm(int ,int);
int lcm(int n1 ,int n2)
{
static int temp = 1;
if(temp % n1 == 0 && temp % n2 == 0)
{
return temp;
}
temp++;
lcm(n1,n2);
return temp;
}
int main()
{
int n1, n2, result;
printf("\ninput first number:");
scanf("%d",&n1);
printf("\ninput second number:");
scanf("%d",&n2);
result = lcm(n1,n2);
printf("\n LCM of %d and %d = %d",n1,n2,result);
return 0;
}
|
the_stack_data/200142948.c | /*
* (c) copyright 1987 by the Vrije Universiteit, Amsterdam, The Netherlands.
* See the copyright notice in the ACK home directory, in the file "Copyright".
*/
/* $Header$ */
#include <stdio.h>
#include <stdlib.h>
#define NEXITS 32
void (*__functab[NEXITS])(void);
int __funccnt = 0;
extern void _exit(int);
/* only flush output buffers when necessary */
int (*_clean)(void) = NULL;
static void
_calls(void)
{
register int i = __funccnt;
/* "Called in reversed order of their registration" */
while (--i >= 0)
(*__functab[i])();
}
void
exit(int status)
{
_calls();
if (_clean) _clean();
_exit(status) ;
}
|
the_stack_data/14201155.c | /* public domain, Simple, Minimalistic GIF writer - http://jonolick.com
*
* Quick Notes:
* Supports only 4 component input, alpha is currently ignored. (RGBX)
*
* Latest revisions:
* 1.00 (2015-11-03) initial release
*
* Basic usage:
* char *frame = new char[128*128*4]; // 4 component. RGBX format, where X is unused
* jo_gif_t gif = jo_gif_start("foo.gif", 128, 128, 0, 32);
* jo_gif_frame(&gif, frame, 4, false); // frame 1
* jo_gif_frame(&gif, frame, 4, false); // frame 2
* jo_gif_frame(&gif, frame, 4, false); // frame 3, ...
* jo_gif_end(&gif);
* */
#ifndef JO_INCLUDE_GIF_H
#define JO_INCLUDE_GIF_H
#include <stdio.h>
// To get a header file for this, either cut and paste the header,
// or create jo_gif.h, #define JO_GIF_HEADER_FILE_ONLY, and
// then include jo_gif.cpp from it.
typedef struct {
FILE *fp;
unsigned char palette[0x300];
short width, height, repeat;
int numColors, palSize;
int frame;
} jo_gif_t;
// width/height | the same for every frame
// repeat | 0 = loop forever, 1 = loop once, etc...
// palSize | must be power of 2 - 1. so, 255 not 256.
extern jo_gif_t jo_gif_start(const char *filename, short width, short height, short repeat, int palSize);
// gif | the state (returned from jo_gif_start)
// rgba | the pixels
// delayCsec | amount of time in between frames (in centiseconds)
// localPalette | true if you want a unique palette generated for this frame (does not effect future frames)
extern void jo_gif_frame(jo_gif_t *gif, unsigned char *rgba, short delayCsec, int localPalette);
// gif | the state (returned from jo_gif_start)
extern void jo_gif_end(jo_gif_t *gif);
#endif
#ifndef JO_GIF_HEADER_FILE_ONLY
#if defined(_MSC_VER) && _MSC_VER >= 0x1400
#define _CRT_SECURE_NO_WARNINGS // suppress warnings about fopen()
#endif
#include <stdlib.h>
#include <memory.h>
#include <math.h>
// Based on NeuQuant algorithm
static void jo_gif_quantize(unsigned char *rgba, int rgbaSize, int sample, unsigned char *map, int numColors) {
// defs for freq and bias
const int intbiasshift = 16; /* bias for fractions */
const int intbias = (((int) 1) << intbiasshift);
const int gammashift = 10; /* gamma = 1024 */
const int betashift = 10;
const int beta = (intbias >> betashift); /* beta = 1/1024 */
const int betagamma = (intbias << (gammashift - betashift));
// defs for decreasing radius factor
const int radiusbiasshift = 6; /* at 32.0 biased by 6 bits */
const int radiusbias = (((int) 1) << radiusbiasshift);
const int radiusdec = 30; /* factor of 1/30 each cycle */
// defs for decreasing alpha factor
const int alphabiasshift = 10; /* alpha starts at 1.0 */
const int initalpha = (((int) 1) << alphabiasshift);
// radbias and alpharadbias used for radpower calculation
const int radbiasshift = 8;
const int radbias = (((int) 1) << radbiasshift);
const int alpharadbshift = (alphabiasshift + radbiasshift);
const int alpharadbias = (((int) 1) << alpharadbshift);
sample = sample < 1 ? 1 : sample > 30 ? 30 : sample;
int network[256][3];
int bias[256] = {}, freq[256];
for(int i = 0; i < numColors; ++i) {
// Put nurons evenly through the luminance spectrum.
network[i][0] = network[i][1] = network[i][2] = (i << 12) / numColors;
freq[i] = intbias / numColors;
}
// Learn
{
const int primes[5] = {499, 491, 487, 503};
int step = 4;
for(int i = 0; i < 4; ++i) {
if(rgbaSize > primes[i] * 4 && (rgbaSize % primes[i])) { // TODO/Error? primes[i]*4?
step = primes[i] * 4;
}
}
sample = step == 4 ? 1 : sample;
int alphadec = 30 + ((sample - 1) / 3);
int samplepixels = rgbaSize / (4 * sample);
int delta = samplepixels / 100;
int alpha = initalpha;
delta = delta == 0 ? 1 : delta;
int radius = (numColors >> 3) * radiusbias;
int rad = radius >> radiusbiasshift;
rad = rad <= 1 ? 0 : rad;
int radSq = rad*rad;
int radpower[32];
for (int i = 0; i < rad; i++) {
radpower[i] = alpha * (((radSq - i * i) * radbias) / radSq);
}
// Randomly walk through the pixels and relax neurons to the "optimal" target.
for(int i = 0, pix = 0; i < samplepixels;) {
int r = rgba[pix + 0] << 4;
int g = rgba[pix + 1] << 4;
int b = rgba[pix + 2] << 4;
int j = -1;
{
// finds closest neuron (min dist) and updates freq
// finds best neuron (min dist-bias) and returns position
// for frequently chosen neurons, freq[k] is high and bias[k] is negative
// bias[k] = gamma*((1/numColors)-freq[k])
int bestd = 0x7FFFFFFF, bestbiasd = 0x7FFFFFFF, bestpos = -1;
for (int k = 0; k < numColors; k++) {
int *n = network[k];
int dist = abs(n[0] - r) + abs(n[1] - g) + abs(n[2] - b);
if (dist < bestd) {
bestd = dist;
bestpos = k;
}
int biasdist = dist - ((bias[k]) >> (intbiasshift - 4));
if (biasdist < bestbiasd) {
bestbiasd = biasdist;
j = k;
}
int betafreq = freq[k] >> betashift;
freq[k] -= betafreq;
bias[k] += betafreq << gammashift;
}
freq[bestpos] += beta;
bias[bestpos] -= betagamma;
}
// Move neuron j towards biased (b,g,r) by factor alpha
network[j][0] -= (network[j][0] - r) * alpha / initalpha;
network[j][1] -= (network[j][1] - g) * alpha / initalpha;
network[j][2] -= (network[j][2] - b) * alpha / initalpha;
if (rad != 0) {
// Move adjacent neurons by precomputed alpha*(1-((i-j)^2/[r]^2)) in radpower[|i-j|]
int lo = j - rad;
lo = lo < -1 ? -1 : lo;
int hi = j + rad;
hi = hi > numColors ? numColors : hi;
for(int jj = j+1, m=1; jj < hi; ++jj) {
int a = radpower[m++];
network[jj][0] -= (network[jj][0] - r) * a / alpharadbias;
network[jj][1] -= (network[jj][1] - g) * a / alpharadbias;
network[jj][2] -= (network[jj][2] - b) * a / alpharadbias;
}
for(int k = j-1, m=1; k > lo; --k) {
int a = radpower[m++];
network[k][0] -= (network[k][0] - r) * a / alpharadbias;
network[k][1] -= (network[k][1] - g) * a / alpharadbias;
network[k][2] -= (network[k][2] - b) * a / alpharadbias;
}
}
pix += step;
pix = pix >= rgbaSize ? pix - rgbaSize : pix;
// every 1% of the image, move less over the following iterations.
if(++i % delta == 0) {
alpha -= alpha / alphadec;
radius -= radius / radiusdec;
rad = radius >> radiusbiasshift;
rad = rad <= 1 ? 0 : rad;
radSq = rad*rad;
for (j = 0; j < rad; j++) {
radpower[j] = alpha * ((radSq - j * j) * radbias / radSq);
}
}
}
}
// Unbias network to give byte values 0..255
for (int i = 0; i < numColors; i++) {
map[i*3+0] = network[i][0] >>= 4;
map[i*3+1] = network[i][1] >>= 4;
map[i*3+2] = network[i][2] >>= 4;
}
}
typedef struct {
FILE *fp;
int numBits;
unsigned char buf[256];
unsigned char idx;
unsigned tmp;
int outBits;
int curBits;
} jo_gif_lzw_t;
static void jo_gif_lzw_write(jo_gif_lzw_t *s, int code) {
s->outBits |= code << s->curBits;
s->curBits += s->numBits;
while(s->curBits >= 8) {
s->buf[s->idx++] = s->outBits & 255;
s->outBits >>= 8;
s->curBits -= 8;
if (s->idx >= 255) {
putc(s->idx, s->fp);
fwrite(s->buf, s->idx, 1, s->fp);
s->idx = 0;
}
}
}
static void jo_gif_lzw_encode(unsigned char *in, int len, FILE *fp) {
jo_gif_lzw_t state;
memset(&state, 0, sizeof(state));
state.fp = fp;
state.numBits = 9;
int maxcode = 511;
// Note: 30k stack space for dictionary =|
const int hashSize = 5003;
short codetab[hashSize];
int hashTbl[hashSize];
memset(hashTbl, 0xFF, sizeof(hashTbl));
jo_gif_lzw_write(&state, 0x100);
int free_ent = 0x102;
int ent = *in++;
CONTINUE:
while (--len) {
int c = *in++;
int fcode = (c << 12) + ent;
int key = (c << 4) ^ ent; // xor hashing
while(hashTbl[key] >= 0) {
if(hashTbl[key] == fcode) {
ent = codetab[key];
goto CONTINUE;
}
++key;
key = key >= hashSize ? key - hashSize : key;
}
jo_gif_lzw_write(&state, ent);
ent = c;
if(free_ent < 4096) {
if(free_ent > maxcode) {
++state.numBits;
if(state.numBits == 12) {
maxcode = 4096;
} else {
maxcode = (1<<state.numBits)-1;
}
}
codetab[key] = free_ent++;
hashTbl[key] = fcode;
} else {
memset(hashTbl, 0xFF, sizeof(hashTbl));
free_ent = 0x102;
jo_gif_lzw_write(&state, 0x100);
state.numBits = 9;
maxcode = 511;
}
}
jo_gif_lzw_write(&state, ent);
jo_gif_lzw_write(&state, 0x101);
jo_gif_lzw_write(&state, 0);
if(state.idx) {
putc(state.idx, fp);
fwrite(state.buf, state.idx, 1, fp);
}
}
static int jo_gif_clamp(int a, int b, int c) { return a < b ? b : a > c ? c : a; }
jo_gif_t jo_gif_start(const char *filename, short width, short height, short repeat, int numColors) {
numColors = numColors > 255 ? 255 : numColors < 2 ? 2 : numColors;
jo_gif_t gif;
memset(&gif, 0, sizeof(gif));
gif.width = width;
gif.height = height;
gif.repeat = repeat;
gif.numColors = numColors;
gif.palSize = log2(numColors);
gif.fp = fopen(filename, "wb");
if(!gif.fp) {
printf("Error: Could not WriteGif to %s\n", filename);
return gif;
}
fwrite("GIF89a", 6, 1, gif.fp);
// Logical Screen Descriptor
fwrite(&gif.width, 2, 1, gif.fp);
fwrite(&gif.height, 2, 1, gif.fp);
putc(0xF0 | gif.palSize, gif.fp);
fwrite("\x00\x00", 2, 1, gif.fp); // bg color index (unused), aspect ratio
return gif;
}
void jo_gif_frame(jo_gif_t *gif, unsigned char * rgba, short delayCsec, int localPalette) {
if(!gif->fp) {
return;
}
short width = gif->width;
short height = gif->height;
int size = width * height;
unsigned char localPalTbl[0x300];
unsigned char *palette = gif->frame == 0 || !localPalette ? gif->palette : localPalTbl;
if(gif->frame == 0 || localPalette) {
jo_gif_quantize(rgba, size*4, 1, palette, gif->numColors);
}
unsigned char *indexedPixels = (unsigned char *)malloc(size);
{
unsigned char *ditheredPixels = (unsigned char*)malloc(size*4);
memcpy(ditheredPixels, rgba, size*4);
for(int k = 0; k < size*4; k+=4) {
int rgb[3] = { ditheredPixels[k+0], ditheredPixels[k+1], ditheredPixels[k+2] };
int bestd = 0x7FFFFFFF, best = -1;
// TODO: exhaustive search. do something better.
for(int i = 0; i < gif->numColors; ++i) {
int bb = palette[i*3+0]-rgb[0];
int gg = palette[i*3+1]-rgb[1];
int rr = palette[i*3+2]-rgb[2];
int d = bb*bb + gg*gg + rr*rr;
if(d < bestd) {
bestd = d;
best = i;
}
}
indexedPixels[k/4] = best;
int diff[3] = { ditheredPixels[k+0] - palette[indexedPixels[k/4]*3+0], ditheredPixels[k+1] - palette[indexedPixels[k/4]*3+1], ditheredPixels[k+2] - palette[indexedPixels[k/4]*3+2] };
// Floyd-Steinberg Error Diffusion
// TODO: Use something better -- http://caca.zoy.org/study/part3.html
if(k+4 < size*4) {
ditheredPixels[k+4+0] = (unsigned char)jo_gif_clamp(ditheredPixels[k+4+0]+(diff[0]*7/16), 0, 255);
ditheredPixels[k+4+1] = (unsigned char)jo_gif_clamp(ditheredPixels[k+4+1]+(diff[1]*7/16), 0, 255);
ditheredPixels[k+4+2] = (unsigned char)jo_gif_clamp(ditheredPixels[k+4+2]+(diff[2]*7/16), 0, 255);
}
if(k+width*4+4 < size*4) {
for(int i = 0; i < 3; ++i) {
ditheredPixels[k-4+width*4+i] = (unsigned char)jo_gif_clamp(ditheredPixels[k-4+width*4+i]+(diff[i]*3/16), 0, 255);
ditheredPixels[k+width*4+i] = (unsigned char)jo_gif_clamp(ditheredPixels[k+width*4+i]+(diff[i]*5/16), 0, 255);
ditheredPixels[k+width*4+4+i] = (unsigned char)jo_gif_clamp(ditheredPixels[k+width*4+4+i]+(diff[i]*1/16), 0, 255);
}
}
}
free(ditheredPixels);
}
if(gif->frame == 0) {
// Global Color Table
fwrite(palette, 3*(1<<(gif->palSize+1)), 1, gif->fp);
if(gif->repeat >= 0) {
// Netscape Extension
fwrite("\x21\xff\x0bNETSCAPE2.0\x03\x01", 16, 1, gif->fp);
fwrite(&gif->repeat, 2, 1, gif->fp); // loop count (extra iterations, 0=repeat forever)
putc(0, gif->fp); // block terminator
}
}
// Graphic Control Extension
fwrite("\x21\xf9\x04\x00", 4, 1, gif->fp);
fwrite(&delayCsec, 2, 1, gif->fp); // delayCsec x 1/100 sec
fwrite("\x00\x00", 2, 1, gif->fp); // transparent color index (first byte), currently unused
// Image Descriptor
fwrite("\x2c\x00\x00\x00\x00", 5, 1, gif->fp); // header, x,y
fwrite(&width, 2, 1, gif->fp);
fwrite(&height, 2, 1, gif->fp);
if (gif->frame == 0 || !localPalette) {
putc(0, gif->fp);
} else {
putc(0x80|gif->palSize, gif->fp );
fwrite(palette, 3*(1<<(gif->palSize+1)), 1, gif->fp);
}
putc(8, gif->fp); // block terminator
jo_gif_lzw_encode(indexedPixels, size, gif->fp);
putc(0, gif->fp); // block terminator
++gif->frame;
free(indexedPixels);
}
void jo_gif_end(jo_gif_t *gif) {
if(!gif->fp) {
return;
}
putc(0x3b, gif->fp); // gif trailer
fclose(gif->fp);
}
#endif
|
the_stack_data/28262281.c | /***********************************************************************
* サウンド出力処理 (システム依存)
*
* 詳細は、 snddrv.h / mame-quasi88.h 参照
************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#ifdef USE_SOUND
#include "mame-quasi88.h"
#define SNDDRV_WORK_DEFINE
#include "audio.h"
#include "sysdep_mixer.h" /* sysdep_mixer_init() */
/*===========================================================================*/
/* QUASI88 から呼び出される、MAME の処理関数 */
/*===========================================================================*/
/******************************************************************************
* サウンド系オプション処理の初期化／終了関数
*
* int xmame_config_init(void)
* config_init() より、オプションの解析を開始する前に呼び出される。
* MAME依存ワークの初期化などが必要な場合は、ここで行う。
*
* void xmame_config_exit(void)
* config_exit() より、処理の最後に呼び出される。
* xmame_config_init() の処理の後片付けが必要なら、ここで行う。
*
*****************************************************************************/
/* xmame_config_init() [src/unix/config.c] */
int xmame_config_init(void)
{
/* create the rc object */
if (!(rc = rc_create()))
return OSD_NOT_OK;
if(sysdep_dsp_init(rc, NULL))
return OSD_NOT_OK;
if(sysdep_mixer_init(rc, NULL))
return OSD_NOT_OK;
if(rc_register(rc, sound_opts))
return OSD_NOT_OK;
return OSD_OK;
}
/* xmame_config_exit() [src/unix/config.c] */
void xmame_config_exit(void)
{
if(rc)
{
sysdep_mixer_exit();
sysdep_dsp_exit();
rc_destroy(rc);
rc = NULL;
}
}
/******************************************************************************
* サウンド系オプションのオプションテーブル取得
*
* const T_CONFIG_TABLE *xmame_config_get_opt_tbl(void)
* config_init() より、 xmame_config_init() の後に呼び出される。
*
* サウンド系オプションの解析処理において、 QUASI88 のオプションテーブル
* T_CONFIG_TABLE を使用する場合、そのポインタを返す。
* 独自方式で解析する場合は、 NULL を返す。
*****************************************************************************/
const T_CONFIG_TABLE *xmame_config_get_opt_tbl(void)
{
return NULL;
}
/******************************************************************************
* サウンド系オプションのヘルプメッセージを表示
*
* void xmame_config_show_option(void)
* config_init() より、オプション -help の処理の際に呼び出される。
* 標準出力にヘルプメッセージを表示する。
*****************************************************************************/
void xmame_config_show_option(void)
{
fprintf(stdout,
"\n"
"==========================================\n"
"== SOUND OPTIONS ( dependent on XMAME ) ==\n"
"== [ XMAME 0.106 ] ==\n"
"==========================================\n"
);
rc_print_help(rc, stdout);
}
/******************************************************************************
* サウンド系オプションの解析処理
*
* int xmame_config_check_option(char *opt1, char *opt2, int priority)
* config_init() より、引数や設定ファイルの解析を行なう際に、
* 規定のオプションのいずれにも合致しない場合、この関数が呼び出される。
*
* opt1 … 最初の引数(文字列)
* opt2 … 次のの引数(文字列 ないし NULL)
* priority … 優先度 (値が大きいほど優先度が高い)
*
* 戻り値 1 … 処理した引数が1個 (opt1 のみ処理。 opt2 は未処理)
* 2 … 処理した引数が2個 (opt1 と opt2 を処理)
* 0 … opt1 が未知の引数のため、 opt1 opt2 ともに未処理
* -1 … 内部で致命的な異常が発生
*
* 処理中の異常 (引数の指定値が範囲外など) や、優先度により処理がスキップ
* されたような場合は、正しく処理できた場合と同様に、 1 か 2 を返す。
*
* ※ この関数は、独自方式でオプションを解析するための関数なので、
* オプションテーブル T_CONFIG_TABLE を使用する場合は、ダミーでよい。
*****************************************************************************/
int xmame_config_check_option(char *opt1, char *opt2, int priority)
{
return rc_quasi88(rc, opt1, opt2, priority);
}
/******************************************************************************
* サウンド系オプションを保存するための関数
*
* int xmame_config_save_option(void (*real_write)
* (const char *opt_name, const char *opt_arg))
*
* 設定ファイルの保存の際に、呼び出される。
* 「opt_name にオプションを、 opt_arg にオプション引数を
* セットし、real_write を呼び出す」
* という動作を、保存したい全オプションに対して繰り返し行なう。
*
* (例) "-sound" を設定ファイルに保存したい場合
* (real_write)("sound", NULL) を呼び出す。
* (例) "-fmvol 80" を設定ファイルに保存したい場合
* (real_write)("fmvol", "80") を呼び出す。
*
* 戻り値 常に 0 を返す
*
* ※ この関数は、独自方式でオプションを解析するための関数なので、
* オプションテーブル T_CONFIG_TABLE を使用する場合は、ダミーでよい。
*****************************************************************************/
#include "rc_priv.h"
int xmame_config_save_option(void (*real_write)
(const char *opt_name, const char *opt_arg))
{
return rc_quasi88_save(rc->option, real_write);
}
/******************************************************************************
* サウンド系オプションをメニューから変更するためのテーブル取得関数
*
* T_SNDDRV_CONFIG *xmame_config_get_sndopt_tbl(void)
*
* メニューモードの開始時に呼び出される。
* 変更可能なサウンド系オプションの情報を、T_SNDDRV_CONFIG 型の
* 配列として用意し、その先頭ポインタを返す。
* 配列は最大5個まで、さらに末尾には終端データをセットしておく。
*
* 特に変更したい／できるものが無い場合は NULL を返す。
*****************************************************************************/
/* T_SNDDRV_CONFIG *xmame_config_get_sndopt_tbl(void) [src/unix/sound.c] */
/******************************************************************************
* サウンド機能の情報を取得する関数
*
* int xmame_has_audiodevice(void)
* サウンドオデバイス出力の可否を返す。
* 真ならデバイス出力可。偽なら不可。
*
* int xmame_has_mastervolume(void)
* サウンドデバイスの音量が変更可能かどうかを返す。
* 真なら変更可能。偽なら不可。
*
*****************************************************************************/
int xmame_has_audiodevice(void)
{
if (use_sound) {
if (osd_has_audio_device()) return TRUE;
}
return FALSE;
}
int xmame_has_mastervolume(void)
{
if (use_sound) {
if (osd_has_sound_mixer()) return TRUE;
}
return FALSE;
}
/*===========================================================================*/
/* MAME の処理関数から呼び出される、システム依存処理関数 */
/*===========================================================================*/
/******************************************************************************
* サウンドデバイス制御
* これらの関数は、グローバル変数 use_sound が偽の場合は、呼び出されない。
*
* int osd_start_audio_stream(int stereo)
* サウンドデバイスを初期化する。
* stereo が真ならステレオ出力、偽ならモノラル出力で初期化する。
* (モノラル出力は、古いバージョンの MAME/XMAME で YM2203 を処理する
* 場合のみ、使用している。それ以外はすべてステレオ出力を使用する。)
* この関数は、エミュレーションの開始時に呼び出される。
* 成功時は、1フレームあたりのサンプル数を返す。
* 失敗時は、0 を返す。
* が、ここで 0 を返すと QUASI88 が強制終了してしまうので、
* サウンドデバイスの初期化に失敗した場合でも、サウンド出力なしで
* 処理を進めたいという場合、とにかく適当な値を返す必要がある。
*
* int osd_update_audio_stream(INT16 *buffer)
* サウンドデバイスに出力する。
* この関数は、1フレーム処理毎に呼び出される。buffer には1フレーム分
* (Machine->sample_rate / Machine->drv->frames_per_second) のサウンド
* データが格納されている。データは 16bit符号付きで、ステレオの場合は
* 左と右のサンプルが交互に並んでいる。
*
* 実際にこの関数が呼び出されたタイミングでデバイスに出力するか、あるいは
* 内部でバッファリングして別途出力するかは、実装次第である。
*
* 戻値は、 osd_start_audio_stream() と同じ
*
* void osd_stop_audio_stream(void)
* サウンドデバイスを終了する。
* この関数は、エミュレーションの終了時に呼び出される。
* 以降、 osd_update_audio_stream() などは呼び出されない。エミュレーション
* を再開する場合は、 osd_start_audio_stream() から呼び出される。
*
* void osd_update_video_and_audio(void)
* サウンドデバイスの出力その２
* タイミング的には、 osd_update_audio_stream() の直後に呼び出される。
* XMAME 0.106 に合わせて定義されているが、 osd_update_audio_stream() が
* きちんと実装できれいれば、こちらの関数はダミーでよい。
*
* void osd_sound_enable(int enable)
* サウンドデバイスへの出力あり・なしを設定する。
* enable が真なら出力あり、偽なら出力なし。
* この関数は、グローバル変数 close_device が真の場合のみ、呼び出される。
* メニューモードに入った際に、引数を偽として呼び出す。
* メニューモードから出る際に、引数を真として呼び出す。
* この関数は、引数が偽の場合に、サウンドデバイスを解放 (close) し、
* 真の場合に確保 (open) するような実装を期待しているが、サウンドデバイス
* を常時確保したままにするような実装であれば、ダミーの関数でよい。
* なお、サウンドデバイスへの出力なしの場合も osd_update_audio_stream()
* などの関数は呼び出される。
*
*****************************************************************************/
/* int osd_start_audio_stream(int stereo) [src/unix/sound.c] */
/* int osd_update_audio_stream(INT16 *buffer) [src/unix/sound.c] */
/* void osd_stop_audio_stream(void) [src/unix/sound.c] */
/* void osd_sound_enable(int enable) [src/unix/sound.c] */
/* osd_update_video_and_audio(mame_display *display) [src/unix/video.c] */
void osd_update_video_and_audio(void)
{
if (sysdep_sound_stream)
{
sysdep_sound_stream_update(sysdep_sound_stream);
}
/* if (GAME_REFRESH_RATE_CHANGED) */
/* sound_update_refresh_rate(display->game_refresh_rate); */
/* } */
}
/******************************************************************************
* 音量制御
*
* void osd_set_mastervolume(int attenuation)
* サウンドデバイスの音量を設定する。 attenuation は 音量で、 -32〜0
* (単位は db)。 音量変更のできないデバイスであれば、ダミーでよい。
*
* int osd_get_mastervolume(void)
* 現在のサウンドデバイスの音量を取得する。 戻値は -32〜0 (単位は db)。
* 音量変更のできないデバイスであれば、ダミーでよい。
*
*****************************************************************************/
/* void osd_set_mastervolume(int attenuation) [src/unix/sound.c] */
/* int osd_get_mastervolume(void) [src/unix/sound.c] */
#endif /* USE_SOUND */
|
the_stack_data/110002.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <netinet/in.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <arpa/inet.h>
#include <unistd.h>
#include <errno.h>
#define MAX_DATA 512
#define ERROR (-1)
void main(int argc, char **argv){
int sockfd;
int clientfd;
struct sockaddr_in server, client;
socklen_t len;
char data[MAX_DATA];
char msg[] = "Message Sent\n";
int tr=1;
/* Assigning addresses */
server.sin_family = PF_INET; // IPv4
server.sin_port = htons(9000); // Port in network bytes
server.sin_addr.s_addr = INADDR_ANY; // All available interfaces
bzero(&server.sin_zero, 8); // Zero padding
len = sizeof(struct sockaddr_in);
/* Success Condition: socket(2) */
if((sockfd = socket(PF_INET, SOCK_STREAM, 0)) == ERROR){
perror("Socket error");
exit(ERROR);
}
/* Failure Condition: socket(2) */
socket(ERROR, SOCK_STREAM, 0);
/* Success Condition: setsockopt(2) */
if (setsockopt(sockfd, SOL_SOCKET, SO_REUSEADDR, &tr, sizeof(int)) == ERROR){
perror("setsockopt");
exit(ERROR);
}
/* Failure Condition: setsockopt(2) */
setsockopt(ERROR, SOL_SOCKET, SO_REUSEADDR, &tr, sizeof(int));
/* Success Condition: bind(2) */
if((bind(sockfd, (struct sockaddr *)&server, (socklen_t) len)) == ERROR){
perror("Bind error");
exit(ERROR);
}
/* Failure Condition: bind(2) */
bind(ERROR, (struct sockaddr *)&server, (socklen_t) len);
/* Success Condition: listen(2) */
if((listen(sockfd, 1)) == ERROR){
perror("Listen error");
exit(ERROR);
}
/* Failure Condition: listen(2) */
listen(ERROR, 1);
/* Success Condition: accept(2) */
if((clientfd = accept(sockfd, (struct sockaddr *)&client, &len)) == ERROR){
perror("Accept error");
exit(ERROR);
}
/* Failure Condition: accept(2) */
accept(ERROR, (struct sockaddr *)&client, &len);
/* Success Condition: connect(2) established while receiving message buffer */
/* Failure Condition: connect(2) */
connect(ERROR, (struct sockaddr *)&server, len);
/* Success Condition: send(2) */
if((send(clientfd, msg, strlen(msg), 0)) == ERROR){
perror("Send error");
exit(ERROR);
}
/* Failure Condition: send(2) */
send(ERROR, msg, strlen(msg), 0);
/* Failure Condition: recv(2) */
recv(ERROR, data, MAX_DATA , 0);
/* Success Condition: recv(2) */
if((recv(clientfd, data, MAX_DATA , 0)) == ERROR){
perror("Recv error");
exit(ERROR);
};
close(clientfd);
}
|
the_stack_data/137744.c | #include <stdio.h>
#define TESTINST(instruction, in, in1, pos, size) \
{ \
unsigned long long out; \
__asm__ __volatile__( \
"move $t0, %2" "\n\t" \
"move $t1, %1" "\n\t" \
instruction" $t0, $t1, "#pos", "#size "\n\t" \
"move %0, $t0" "\n\t" \
: "=r" (out) \
: "r" (in), "r" (in1) \
: "t0", "t1" \
); \
printf("%s :: in 0x%llx, in1 0x%llx, out 0x%llx, pos: %d, size: %d\n", \
instruction, (long long) in, (long long) in1, out, pos, size); \
}
int main()
{
#if (__mips == 64) && (__mips_isa_rev >= 2)
printf("--- INS ---\n");
/* The values of pos and size must satisfy all of the following relations:
0 <= pos < 32
0 < size <= 32
0 < pos+size <= 32 */
TESTINST("ins", 0x0, 0x0, 0, 1);
TESTINST("ins", 0x0, 0xffffffffffffffff, 0, 1);
TESTINST("ins", 0x0, 0x98765432, 0, 1);
TESTINST("ins", 0x0, 0xffffffffff865421, 0, 1);
TESTINST("ins", 0xffffffffffffffff, 0x0, 0, 1);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffffffffff, 0, 1);
TESTINST("ins", 0xffffffffffffffff, 0x98765432, 0, 1);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffff865421, 0, 1);
TESTINST("ins", 0x98765432, 0x0, 0, 1);
TESTINST("ins", 0x98765432, 0xffffffffffffffff, 0, 1);
TESTINST("ins", 0x98765432, 0x98765432, 0, 1);
TESTINST("ins", 0x98765432, 0xffffffffff865421, 0, 1);
TESTINST("ins", 0xffffffffff865421, 0x0, 0, 1);
TESTINST("ins", 0xffffffffff865421, 0xffffffffffffffff, 0, 1);
TESTINST("ins", 0xffffffffff865421, 0x98765432, 0, 1);
TESTINST("ins", 0xffffffffff865421, 0xffffffffff865421, 0, 1);
TESTINST("ins", 0x0, 0x0, 0, 4);
TESTINST("ins", 0x0, 0xffffffffffffffff, 0, 4);
TESTINST("ins", 0x0, 0x98765432, 0, 4);
TESTINST("ins", 0x0, 0xffffffffff865421, 0, 4);
TESTINST("ins", 0xffffffffffffffff, 0x0, 0, 4);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffffffffff, 0, 4);
TESTINST("ins", 0xffffffffffffffff, 0x98765432, 0, 4);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffff865421, 0, 4);
TESTINST("ins", 0x98765432, 0x0, 0, 4);
TESTINST("ins", 0x98765432, 0xffffffffffffffff, 0, 4);
TESTINST("ins", 0x98765432, 0x98765432, 0, 4);
TESTINST("ins", 0x98765432, 0xffffffffff865421, 0, 4);
TESTINST("ins", 0xffffffffff865421, 0x0, 0, 4);
TESTINST("ins", 0xffffffffff865421, 0xffffffffffffffff, 0, 4);
TESTINST("ins", 0xffffffffff865421, 0x98765432, 0, 4);
TESTINST("ins", 0xffffffffff865421, 0xffffffffff865421, 0, 4);
TESTINST("ins", 0x0, 0x0, 0, 16);
TESTINST("ins", 0x0, 0xffffffffffffffff, 0, 16);
TESTINST("ins", 0x0, 0x98765432, 0, 16);
TESTINST("ins", 0x0, 0xffffffffff865421, 0, 16);
TESTINST("ins", 0xffffffffffffffff, 0x0, 0, 16);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffffffffff, 0, 16);
TESTINST("ins", 0xffffffffffffffff, 0x98765432, 0, 16);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffff865421, 0, 16);
TESTINST("ins", 0x98765432, 0x0, 0, 16);
TESTINST("ins", 0x98765432, 0xffffffffffffffff, 0, 16);
TESTINST("ins", 0x98765432, 0x98765432, 0, 16);
TESTINST("ins", 0x98765432, 0xffffffffff865421, 0, 16);
TESTINST("ins", 0xffffffffff865421, 0x0, 0, 16);
TESTINST("ins", 0xffffffffff865421, 0xffffffffffffffff, 0, 16);
TESTINST("ins", 0xffffffffff865421, 0x98765432, 0, 16);
TESTINST("ins", 0xffffffffff865421, 0xffffffffff865421, 0, 16);
TESTINST("ins", 0x0, 0x0, 0, 32);
TESTINST("ins", 0x0, 0xffffffffffffffff, 0, 32);
TESTINST("ins", 0x0, 0x98765432, 0, 32);
TESTINST("ins", 0x0, 0xffffffffff865421, 0, 32);
TESTINST("ins", 0xffffffffffffffff, 0x0, 0, 32);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffffffffff, 0, 32);
TESTINST("ins", 0xffffffffffffffff, 0x98765432, 0, 32);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffff865421, 0, 32);
TESTINST("ins", 0x98765432, 0x0, 0, 32);
TESTINST("ins", 0x98765432, 0xffffffffffffffff, 0, 32);
TESTINST("ins", 0x98765432, 0x98765432, 0, 32);
TESTINST("ins", 0x98765432, 0xffffffffff865421, 0, 32);
TESTINST("ins", 0xffffffffff865421, 0x0, 0, 32);
TESTINST("ins", 0xffffffffff865421, 0xffffffffffffffff, 0, 32);
TESTINST("ins", 0xffffffffff865421, 0x98765432, 0, 32);
TESTINST("ins", 0xffffffffff865421, 0xffffffffff865421, 0, 32);
TESTINST("ins", 0x0, 0x0, 4, 1);
TESTINST("ins", 0x0, 0xffffffffffffffff, 4, 1);
TESTINST("ins", 0x0, 0x98765432, 4, 1);
TESTINST("ins", 0x0, 0xffffffffff865421, 4, 1);
TESTINST("ins", 0xffffffffffffffff, 0x0, 4, 1);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffffffffff, 4, 1);
TESTINST("ins", 0xffffffffffffffff, 0x98765432, 4, 1);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffff865421, 4, 1);
TESTINST("ins", 0x98765432, 0x0, 4, 1);
TESTINST("ins", 0x98765432, 0xffffffffffffffff, 4, 1);
TESTINST("ins", 0x98765432, 0x98765432, 4, 1);
TESTINST("ins", 0x98765432, 0xffffffffff865421, 4, 1);
TESTINST("ins", 0xffffffffff865421, 0x0, 4, 1);
TESTINST("ins", 0xffffffffff865421, 0xffffffffffffffff, 4, 1);
TESTINST("ins", 0xffffffffff865421, 0x98765432, 4, 1);
TESTINST("ins", 0xffffffffff865421, 0xffffffffff865421, 4, 1);
TESTINST("ins", 0x0, 0x0, 4, 4);
TESTINST("ins", 0x0, 0xffffffffffffffff, 4, 4);
TESTINST("ins", 0x0, 0x98765432, 4, 4);
TESTINST("ins", 0x0, 0xffffffffff865421, 4, 4);
TESTINST("ins", 0xffffffffffffffff, 0x0, 4, 4);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffffffffff, 4, 4);
TESTINST("ins", 0xffffffffffffffff, 0x98765432, 4, 4);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffff865421, 4, 4);
TESTINST("ins", 0x98765432, 0x0, 4, 4);
TESTINST("ins", 0x98765432, 0xffffffffffffffff, 4, 4);
TESTINST("ins", 0x98765432, 0x98765432, 4, 4);
TESTINST("ins", 0x98765432, 0xffffffffff865421, 4, 4);
TESTINST("ins", 0xffffffffff865421, 0x0, 4, 4);
TESTINST("ins", 0xffffffffff865421, 0xffffffffffffffff, 4, 4);
TESTINST("ins", 0xffffffffff865421, 0x98765432, 4, 4);
TESTINST("ins", 0xffffffffff865421, 0xffffffffff865421, 4, 4);
TESTINST("ins", 0x0, 0x0, 4, 16);
TESTINST("ins", 0x0, 0xffffffffffffffff, 4, 16);
TESTINST("ins", 0x0, 0x98765432, 4, 16);
TESTINST("ins", 0x0, 0xffffffffff865421, 4, 16);
TESTINST("ins", 0xffffffffffffffff, 0x0, 4, 16);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffffffffff, 4, 16);
TESTINST("ins", 0xffffffffffffffff, 0x98765432, 4, 16);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffff865421, 4, 16);
TESTINST("ins", 0x98765432, 0x0, 4, 16);
TESTINST("ins", 0x98765432, 0xffffffffffffffff, 4, 16);
TESTINST("ins", 0x98765432, 0x98765432, 4, 16);
TESTINST("ins", 0x98765432, 0xffffffffff865421, 4, 16);
TESTINST("ins", 0xffffffffff865421, 0x0, 4, 16);
TESTINST("ins", 0xffffffffff865421, 0xffffffffffffffff, 4, 16);
TESTINST("ins", 0xffffffffff865421, 0x98765432, 4, 16);
TESTINST("ins", 0xffffffffff865421, 0xffffffffff865421, 4, 16);
TESTINST("ins", 0x0, 0x0, 4, 28);
TESTINST("ins", 0x0, 0xffffffffffffffff, 4, 28);
TESTINST("ins", 0x0, 0x98765432, 4, 28);
TESTINST("ins", 0x0, 0xffffffffff865421, 4, 28);
TESTINST("ins", 0xffffffffffffffff, 0x0, 4, 28);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffffffffff, 4, 28);
TESTINST("ins", 0xffffffffffffffff, 0x98765432, 4, 28);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffff865421, 4, 28);
TESTINST("ins", 0x98765432, 0x0, 4, 28);
TESTINST("ins", 0x98765432, 0xffffffffffffffff, 4, 28);
TESTINST("ins", 0x98765432, 0x98765432, 4, 28);
TESTINST("ins", 0x98765432, 0xffffffffff865421, 4, 28);
TESTINST("ins", 0xffffffffff865421, 0x0, 4, 28);
TESTINST("ins", 0xffffffffff865421, 0xffffffffffffffff, 4, 28);
TESTINST("ins", 0xffffffffff865421, 0x98765432, 4, 28);
TESTINST("ins", 0xffffffffff865421, 0xffffffffff865421, 4, 28);
TESTINST("ins", 0x0, 0x0, 16, 1);
TESTINST("ins", 0x0, 0xffffffffffffffff, 16, 1);
TESTINST("ins", 0x0, 0x98765432, 16, 1);
TESTINST("ins", 0x0, 0xffffffffff865421, 16, 1);
TESTINST("ins", 0xffffffffffffffff, 0x0, 16, 1);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffffffffff, 16, 1);
TESTINST("ins", 0xffffffffffffffff, 0x98765432, 16, 1);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffff865421, 16, 1);
TESTINST("ins", 0x98765432, 0x0, 16, 1);
TESTINST("ins", 0x98765432, 0xffffffffffffffff, 16, 1);
TESTINST("ins", 0x98765432, 0x98765432, 16, 1);
TESTINST("ins", 0x98765432, 0xffffffffff865421, 16, 1);
TESTINST("ins", 0xffffffffff865421, 0x0, 16, 1);
TESTINST("ins", 0xffffffffff865421, 0xffffffffffffffff, 16, 1);
TESTINST("ins", 0xffffffffff865421, 0x98765432, 16, 1);
TESTINST("ins", 0xffffffffff865421, 0xffffffffff865421, 16, 1);
TESTINST("ins", 0x0, 0x0, 16, 4);
TESTINST("ins", 0x0, 0xffffffffffffffff, 16, 4);
TESTINST("ins", 0x0, 0x98765432, 16, 4);
TESTINST("ins", 0x0, 0xffffffffff865421, 16, 4);
TESTINST("ins", 0xffffffffffffffff, 0x0, 16, 4);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffffffffff, 16, 4);
TESTINST("ins", 0xffffffffffffffff, 0x98765432, 16, 4);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffff865421, 16, 4);
TESTINST("ins", 0x98765432, 0x0, 16, 4);
TESTINST("ins", 0x98765432, 0xffffffffffffffff, 16, 4);
TESTINST("ins", 0x98765432, 0x98765432, 16, 4);
TESTINST("ins", 0x98765432, 0xffffffffff865421, 16, 4);
TESTINST("ins", 0xffffffffff865421, 0x0, 16, 4);
TESTINST("ins", 0xffffffffff865421, 0xffffffffffffffff, 16, 4);
TESTINST("ins", 0xffffffffff865421, 0x98765432, 16, 4);
TESTINST("ins", 0xffffffffff865421, 0xffffffffff865421, 16, 4);
TESTINST("ins", 0x0, 0x0, 16, 16);
TESTINST("ins", 0x0, 0xffffffffffffffff, 16, 16);
TESTINST("ins", 0x0, 0x98765432, 16, 16);
TESTINST("ins", 0x0, 0xffffffffff865421, 16, 16);
TESTINST("ins", 0xffffffffffffffff, 0x0, 16, 16);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffffffffff, 16, 16);
TESTINST("ins", 0xffffffffffffffff, 0x98765432, 16, 16);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffff865421, 16, 16);
TESTINST("ins", 0x98765432, 0x0, 16, 16);
TESTINST("ins", 0x98765432, 0xffffffffffffffff, 16, 16);
TESTINST("ins", 0x98765432, 0x98765432, 16, 16);
TESTINST("ins", 0x98765432, 0xffffffffff865421, 16, 16);
TESTINST("ins", 0xffffffffff865421, 0x0, 16, 16);
TESTINST("ins", 0xffffffffff865421, 0xffffffffffffffff, 16, 16);
TESTINST("ins", 0xffffffffff865421, 0x98765432, 16, 16);
TESTINST("ins", 0xffffffffff865421, 0xffffffffff865421, 16, 16);
TESTINST("ins", 0x0, 0x0, 31, 1);
TESTINST("ins", 0x0, 0xffffffffffffffff, 31, 1);
TESTINST("ins", 0x0, 0x98765432, 31, 1);
TESTINST("ins", 0x0, 0xffffffffff865421, 31, 1);
TESTINST("ins", 0xffffffffffffffff, 0x0, 31, 1);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffffffffff, 31, 1);
TESTINST("ins", 0xffffffffffffffff, 0x98765432, 31, 1);
TESTINST("ins", 0xffffffffffffffff, 0xffffffffff865421, 31, 1);
TESTINST("ins", 0x98765432, 0x0, 31, 1);
TESTINST("ins", 0x98765432, 0xffffffffffffffff, 31, 1);
TESTINST("ins", 0x98765432, 0x98765432, 31, 1);
TESTINST("ins", 0x98765432, 0xffffffffff865421, 31, 1);
TESTINST("ins", 0xffffffffff865421, 0x0, 31, 1);
TESTINST("ins", 0xffffffffff865421, 0xffffffffffffffff, 31, 1);
TESTINST("ins", 0xffffffffff865421, 0x98765432, 31, 1);
TESTINST("ins", 0xffffffffff865421, 0xffffffffff865421, 31, 1);
printf("--- EXT ---\n");
/* The values of pos and size must satisfy all of the following relations:
0 <= pos < 32
0 < size <= 32
0 < pos+size <= 32 */
TESTINST("ext", 0x0, 0x0, 0, 1);
TESTINST("ext", 0x0, 0xffffffffffffffff, 0, 1);
TESTINST("ext", 0x0, 0x98765432, 0, 1);
TESTINST("ext", 0x0, 0xffffffffff865421, 0, 1);
TESTINST("ext", 0xffffffffffffffff, 0x0, 0, 1);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffffffffff, 0, 1);
TESTINST("ext", 0xffffffffffffffff, 0x98765432, 0, 1);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffff865421, 0, 1);
TESTINST("ext", 0x98765432, 0x0, 0, 1);
TESTINST("ext", 0x98765432, 0xffffffffffffffff, 0, 1);
TESTINST("ext", 0x98765432, 0x98765432, 0, 1);
TESTINST("ext", 0x98765432, 0xffffffffff865421, 0, 1);
TESTINST("ext", 0xffffffffff865421, 0x0, 0, 1);
TESTINST("ext", 0xffffffffff865421, 0xffffffffffffffff, 0, 1);
TESTINST("ext", 0xffffffffff865421, 0x98765432, 0, 1);
TESTINST("ext", 0xffffffffff865421, 0xffffffffff865421, 0, 1);
TESTINST("ext", 0x0, 0x0, 0, 4);
TESTINST("ext", 0x0, 0xffffffffffffffff, 0, 4);
TESTINST("ext", 0x0, 0x98765432, 0, 4);
TESTINST("ext", 0x0, 0xffffffffff865421, 0, 4);
TESTINST("ext", 0xffffffffffffffff, 0x0, 0, 4);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffffffffff, 0, 4);
TESTINST("ext", 0xffffffffffffffff, 0x98765432, 0, 4);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffff865421, 0, 4);
TESTINST("ext", 0x98765432, 0x0, 0, 4);
TESTINST("ext", 0x98765432, 0xffffffffffffffff, 0, 4);
TESTINST("ext", 0x98765432, 0x98765432, 0, 4);
TESTINST("ext", 0x98765432, 0xffffffffff865421, 0, 4);
TESTINST("ext", 0xffffffffff865421, 0x0, 0, 4);
TESTINST("ext", 0xffffffffff865421, 0xffffffffffffffff, 0, 4);
TESTINST("ext", 0xffffffffff865421, 0x98765432, 0, 4);
TESTINST("ext", 0xffffffffff865421, 0xffffffffff865421, 0, 4);
TESTINST("ext", 0x0, 0x0, 0, 16);
TESTINST("ext", 0x0, 0xffffffffffffffff, 0, 16);
TESTINST("ext", 0x0, 0x98765432, 0, 16);
TESTINST("ext", 0x0, 0xffffffffff865421, 0, 16);
TESTINST("ext", 0xffffffffffffffff, 0x0, 0, 16);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffffffffff, 0, 16);
TESTINST("ext", 0xffffffffffffffff, 0x98765432, 0, 16);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffff865421, 0, 16);
TESTINST("ext", 0x98765432, 0x0, 0, 16);
TESTINST("ext", 0x98765432, 0xffffffffffffffff, 0, 16);
TESTINST("ext", 0x98765432, 0x98765432, 0, 16);
TESTINST("ext", 0x98765432, 0xffffffffff865421, 0, 16);
TESTINST("ext", 0xffffffffff865421, 0x0, 0, 16);
TESTINST("ext", 0xffffffffff865421, 0xffffffffffffffff, 0, 16);
TESTINST("ext", 0xffffffffff865421, 0x98765432, 0, 16);
TESTINST("ext", 0xffffffffff865421, 0xffffffffff865421, 0, 16);
TESTINST("ext", 0x0, 0x0, 0, 32);
TESTINST("ext", 0x0, 0xffffffffffffffff, 0, 32);
TESTINST("ext", 0x0, 0x98765432, 0, 32);
TESTINST("ext", 0x0, 0xffffffffff865421, 0, 32);
TESTINST("ext", 0xffffffffffffffff, 0x0, 0, 32);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffffffffff, 0, 32);
TESTINST("ext", 0xffffffffffffffff, 0x98765432, 0, 32);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffff865421, 0, 32);
TESTINST("ext", 0x98765432, 0x0, 0, 32);
TESTINST("ext", 0x98765432, 0xffffffffffffffff, 0, 32);
TESTINST("ext", 0x98765432, 0x98765432, 0, 32);
TESTINST("ext", 0x98765432, 0xffffffffff865421, 0, 32);
TESTINST("ext", 0xffffffffff865421, 0x0, 0, 32);
TESTINST("ext", 0xffffffffff865421, 0xffffffffffffffff, 0, 32);
TESTINST("ext", 0xffffffffff865421, 0x98765432, 0, 32);
TESTINST("ext", 0xffffffffff865421, 0xffffffffff865421, 0, 32);
TESTINST("ext", 0x0, 0x0, 4, 1);
TESTINST("ext", 0x0, 0xffffffffffffffff, 4, 1);
TESTINST("ext", 0x0, 0x98765432, 4, 1);
TESTINST("ext", 0x0, 0xffffffffff865421, 4, 1);
TESTINST("ext", 0xffffffffffffffff, 0x0, 4, 1);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffffffffff, 4, 1);
TESTINST("ext", 0xffffffffffffffff, 0x98765432, 4, 1);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffff865421, 4, 1);
TESTINST("ext", 0x98765432, 0x0, 4, 1);
TESTINST("ext", 0x98765432, 0xffffffffffffffff, 4, 1);
TESTINST("ext", 0x98765432, 0x98765432, 4, 1);
TESTINST("ext", 0x98765432, 0xffffffffff865421, 4, 1);
TESTINST("ext", 0xffffffffff865421, 0x0, 4, 1);
TESTINST("ext", 0xffffffffff865421, 0xffffffffffffffff, 4, 1);
TESTINST("ext", 0xffffffffff865421, 0x98765432, 4, 1);
TESTINST("ext", 0xffffffffff865421, 0xffffffffff865421, 4, 1);
TESTINST("ext", 0x0, 0x0, 4, 4);
TESTINST("ext", 0x0, 0xffffffffffffffff, 4, 4);
TESTINST("ext", 0x0, 0x98765432, 4, 4);
TESTINST("ext", 0x0, 0xffffffffff865421, 4, 4);
TESTINST("ext", 0xffffffffffffffff, 0x0, 4, 4);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffffffffff, 4, 4);
TESTINST("ext", 0xffffffffffffffff, 0x98765432, 4, 4);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffff865421, 4, 4);
TESTINST("ext", 0x98765432, 0x0, 4, 4);
TESTINST("ext", 0x98765432, 0xffffffffffffffff, 4, 4);
TESTINST("ext", 0x98765432, 0x98765432, 4, 4);
TESTINST("ext", 0x98765432, 0xffffffffff865421, 4, 4);
TESTINST("ext", 0xffffffffff865421, 0x0, 4, 4);
TESTINST("ext", 0xffffffffff865421, 0xffffffffffffffff, 4, 4);
TESTINST("ext", 0xffffffffff865421, 0x98765432, 4, 4);
TESTINST("ext", 0xffffffffff865421, 0xffffffffff865421, 4, 4);
TESTINST("ext", 0x0, 0x0, 4, 16);
TESTINST("ext", 0x0, 0xffffffffffffffff, 4, 16);
TESTINST("ext", 0x0, 0x98765432, 4, 16);
TESTINST("ext", 0x0, 0xffffffffff865421, 4, 16);
TESTINST("ext", 0xffffffffffffffff, 0x0, 4, 16);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffffffffff, 4, 16);
TESTINST("ext", 0xffffffffffffffff, 0x98765432, 4, 16);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffff865421, 4, 16);
TESTINST("ext", 0x98765432, 0x0, 4, 16);
TESTINST("ext", 0x98765432, 0xffffffffffffffff, 4, 16);
TESTINST("ext", 0x98765432, 0x98765432, 4, 16);
TESTINST("ext", 0x98765432, 0xffffffffff865421, 4, 16);
TESTINST("ext", 0xffffffffff865421, 0x0, 4, 16);
TESTINST("ext", 0xffffffffff865421, 0xffffffffffffffff, 4, 16);
TESTINST("ext", 0xffffffffff865421, 0x98765432, 4, 16);
TESTINST("ext", 0xffffffffff865421, 0xffffffffff865421, 4, 16);
TESTINST("ext", 0x0, 0x0, 4, 28);
TESTINST("ext", 0x0, 0xffffffffffffffff, 4, 28);
TESTINST("ext", 0x0, 0x98765432, 4, 28);
TESTINST("ext", 0x0, 0xffffffffff865421, 4, 28);
TESTINST("ext", 0xffffffffffffffff, 0x0, 4, 28);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffffffffff, 4, 28);
TESTINST("ext", 0xffffffffffffffff, 0x98765432, 4, 28);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffff865421, 4, 28);
TESTINST("ext", 0x98765432, 0x0, 4, 28);
TESTINST("ext", 0x98765432, 0xffffffffffffffff, 4, 28);
TESTINST("ext", 0x98765432, 0x98765432, 4, 28);
TESTINST("ext", 0x98765432, 0xffffffffff865421, 4, 28);
TESTINST("ext", 0xffffffffff865421, 0x0, 4, 28);
TESTINST("ext", 0xffffffffff865421, 0xffffffffffffffff, 4, 28);
TESTINST("ext", 0xffffffffff865421, 0x98765432, 4, 28);
TESTINST("ext", 0xffffffffff865421, 0xffffffffff865421, 4, 28);
TESTINST("ext", 0x0, 0x0, 16, 1);
TESTINST("ext", 0x0, 0xffffffffffffffff, 16, 1);
TESTINST("ext", 0x0, 0x98765432, 16, 1);
TESTINST("ext", 0x0, 0xffffffffff865421, 16, 1);
TESTINST("ext", 0xffffffffffffffff, 0x0, 16, 1);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffffffffff, 16, 1);
TESTINST("ext", 0xffffffffffffffff, 0x98765432, 16, 1);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffff865421, 16, 1);
TESTINST("ext", 0x98765432, 0x0, 16, 1);
TESTINST("ext", 0x98765432, 0xffffffffffffffff, 16, 1);
TESTINST("ext", 0x98765432, 0x98765432, 16, 1);
TESTINST("ext", 0x98765432, 0xffffffffff865421, 16, 1);
TESTINST("ext", 0xffffffffff865421, 0x0, 16, 1);
TESTINST("ext", 0xffffffffff865421, 0xffffffffffffffff, 16, 1);
TESTINST("ext", 0xffffffffff865421, 0x98765432, 16, 1);
TESTINST("ext", 0xffffffffff865421, 0xffffffffff865421, 16, 1);
TESTINST("ext", 0x0, 0x0, 16, 4);
TESTINST("ext", 0x0, 0xffffffffffffffff, 16, 4);
TESTINST("ext", 0x0, 0x98765432, 16, 4);
TESTINST("ext", 0x0, 0xffffffffff865421, 16, 4);
TESTINST("ext", 0xffffffffffffffff, 0x0, 16, 4);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffffffffff, 16, 4);
TESTINST("ext", 0xffffffffffffffff, 0x98765432, 16, 4);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffff865421, 16, 4);
TESTINST("ext", 0x98765432, 0x0, 16, 4);
TESTINST("ext", 0x98765432, 0xffffffffffffffff, 16, 4);
TESTINST("ext", 0x98765432, 0x98765432, 16, 4);
TESTINST("ext", 0x98765432, 0xffffffffff865421, 16, 4);
TESTINST("ext", 0xffffffffff865421, 0x0, 16, 4);
TESTINST("ext", 0xffffffffff865421, 0xffffffffffffffff, 16, 4);
TESTINST("ext", 0xffffffffff865421, 0x98765432, 16, 4);
TESTINST("ext", 0xffffffffff865421, 0xffffffffff865421, 16, 4);
TESTINST("ext", 0x0, 0x0, 16, 16);
TESTINST("ext", 0x0, 0xffffffffffffffff, 16, 16);
TESTINST("ext", 0x0, 0x98765432, 16, 16);
TESTINST("ext", 0x0, 0xffffffffff865421, 16, 16);
TESTINST("ext", 0xffffffffffffffff, 0x0, 16, 16);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffffffffff, 16, 16);
TESTINST("ext", 0xffffffffffffffff, 0x98765432, 16, 16);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffff865421, 16, 16);
TESTINST("ext", 0x98765432, 0x0, 16, 16);
TESTINST("ext", 0x98765432, 0xffffffffffffffff, 16, 16);
TESTINST("ext", 0x98765432, 0x98765432, 16, 16);
TESTINST("ext", 0x98765432, 0xffffffffff865421, 16, 16);
TESTINST("ext", 0xffffffffff865421, 0x0, 16, 16);
TESTINST("ext", 0xffffffffff865421, 0xffffffffffffffff, 16, 16);
TESTINST("ext", 0xffffffffff865421, 0x98765432, 16, 16);
TESTINST("ext", 0xffffffffff865421, 0xffffffffff865421, 16, 16);
TESTINST("ext", 0x0, 0x0, 31, 1);
TESTINST("ext", 0x0, 0xffffffffffffffff, 31, 1);
TESTINST("ext", 0x0, 0x98765432, 31, 1);
TESTINST("ext", 0x0, 0xffffffffff865421, 31, 1);
TESTINST("ext", 0xffffffffffffffff, 0x0, 31, 1);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffffffffff, 31, 1);
TESTINST("ext", 0xffffffffffffffff, 0x98765432, 31, 1);
TESTINST("ext", 0xffffffffffffffff, 0xffffffffff865421, 31, 1);
TESTINST("ext", 0x98765432, 0x0, 31, 1);
TESTINST("ext", 0x98765432, 0xffffffffffffffff, 31, 1);
TESTINST("ext", 0x98765432, 0x98765432, 31, 1);
TESTINST("ext", 0x98765432, 0xffffffffff865421, 31, 1);
TESTINST("ext", 0xffffffffff865421, 0x0, 31, 1);
TESTINST("ext", 0xffffffffff865421, 0xffffffffffffffff, 31, 1);
TESTINST("ext", 0xffffffffff865421, 0x98765432, 31, 1);
TESTINST("ext", 0xffffffffff865421, 0xffffffffff865421, 31, 1);
printf("--- DEXT ---\n");
/* The values of pos and size must satisfy all of the following relations:
0 <= pos < 32
0 < size <= 32
0 < pos+size <= 63 */
TESTINST("dext", 0x0, 0x0, 0, 1);
TESTINST("dext", 0x0, 0xffffffffffffffff, 0, 1);
TESTINST("dext", 0x0, 0x98765432, 0, 1);
TESTINST("dext", 0x0, 0xffffffffff865421, 0, 1);
TESTINST("dext", 0xffffffffffffffff, 0x0, 0, 1);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffffffffff, 0, 1);
TESTINST("dext", 0xffffffffffffffff, 0x98765432, 0, 1);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffff865421, 0, 1);
TESTINST("dext", 0x98765432, 0x0, 0, 1);
TESTINST("dext", 0x98765432, 0xffffffffffffffff, 0, 1);
TESTINST("dext", 0x98765432, 0x98765432, 0, 1);
TESTINST("dext", 0x98765432, 0xffffffffff865421, 0, 1);
TESTINST("dext", 0xffffffffff865421, 0x0, 0, 1);
TESTINST("dext", 0xffffffffff865421, 0xffffffffffffffff, 0, 1);
TESTINST("dext", 0xffffffffff865421, 0x98765432, 0, 1);
TESTINST("dext", 0xffffffffff865421, 0xffffffffff865421, 0, 1);
TESTINST("dext", 0x0, 0x0, 0, 4);
TESTINST("dext", 0x0, 0xffffffffffffffff, 0, 4);
TESTINST("dext", 0x0, 0x98765432, 0, 4);
TESTINST("dext", 0x0, 0xffffffffff865421, 0, 4);
TESTINST("dext", 0xffffffffffffffff, 0x0, 0, 4);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffffffffff, 0, 4);
TESTINST("dext", 0xffffffffffffffff, 0x98765432, 0, 4);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffff865421, 0, 4);
TESTINST("dext", 0x98765432, 0x0, 0, 4);
TESTINST("dext", 0x98765432, 0xffffffffffffffff, 0, 4);
TESTINST("dext", 0x98765432, 0x98765432, 0, 4);
TESTINST("dext", 0x98765432, 0xffffffffff865421, 0, 4);
TESTINST("dext", 0xffffffffff865421, 0x0, 0, 4);
TESTINST("dext", 0xffffffffff865421, 0xffffffffffffffff, 0, 4);
TESTINST("dext", 0xffffffffff865421, 0x98765432, 0, 4);
TESTINST("dext", 0xffffffffff865421, 0xffffffffff865421, 0, 4);
TESTINST("dext", 0x0, 0x0, 0, 16);
TESTINST("dext", 0x0, 0xffffffffffffffff, 0, 16);
TESTINST("dext", 0x0, 0x98765432, 0, 16);
TESTINST("dext", 0x0, 0xffffffffff865421, 0, 16);
TESTINST("dext", 0xffffffffffffffff, 0x0, 0, 16);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffffffffff, 0, 16);
TESTINST("dext", 0xffffffffffffffff, 0x98765432, 0, 16);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffff865421, 0, 16);
TESTINST("dext", 0x98765432, 0x0, 0, 16);
TESTINST("dext", 0x98765432, 0xffffffffffffffff, 0, 16);
TESTINST("dext", 0x98765432, 0x98765432, 0, 16);
TESTINST("dext", 0x98765432, 0xffffffffff865421, 0, 16);
TESTINST("dext", 0xffffffffff865421, 0x0, 0, 16);
TESTINST("dext", 0xffffffffff865421, 0xffffffffffffffff, 0, 16);
TESTINST("dext", 0xffffffffff865421, 0x98765432, 0, 16);
TESTINST("dext", 0xffffffffff865421, 0xffffffffff865421, 0, 16);
TESTINST("dext", 0x0, 0x0, 0, 32);
TESTINST("dext", 0x0, 0xffffffffffffffff, 0, 32);
TESTINST("dext", 0x0, 0x98765432, 0, 32);
TESTINST("dext", 0x0, 0xffffffffff865421, 0, 32);
TESTINST("dext", 0xffffffffffffffff, 0x0, 0, 32);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffffffffff, 0, 32);
TESTINST("dext", 0xffffffffffffffff, 0x98765432, 0, 32);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffff865421, 0, 32);
TESTINST("dext", 0x98765432, 0x0, 0, 32);
TESTINST("dext", 0x98765432, 0xffffffffffffffff, 0, 32);
TESTINST("dext", 0x98765432, 0x98765432, 0, 32);
TESTINST("dext", 0x98765432, 0xffffffffff865421, 0, 32);
TESTINST("dext", 0xffffffffff865421, 0x0, 0, 32);
TESTINST("dext", 0xffffffffff865421, 0xffffffffffffffff, 0, 32);
TESTINST("dext", 0xffffffffff865421, 0x98765432, 0, 32);
TESTINST("dext", 0xffffffffff865421, 0xffffffffff865421, 0, 32);
TESTINST("dext", 0x0, 0x0, 4, 1);
TESTINST("dext", 0x0, 0xffffffffffffffff, 4, 1);
TESTINST("dext", 0x0, 0x98765432, 4, 1);
TESTINST("dext", 0x0, 0xffffffffff865421, 4, 1);
TESTINST("dext", 0xffffffffffffffff, 0x0, 4, 1);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffffffffff, 4, 1);
TESTINST("dext", 0xffffffffffffffff, 0x98765432, 4, 1);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffff865421, 4, 1);
TESTINST("dext", 0x98765432, 0x0, 4, 1);
TESTINST("dext", 0x98765432, 0xffffffffffffffff, 4, 1);
TESTINST("dext", 0x98765432, 0x98765432, 4, 1);
TESTINST("dext", 0x98765432, 0xffffffffff865421, 4, 1);
TESTINST("dext", 0xffffffffff865421, 0x0, 4, 1);
TESTINST("dext", 0xffffffffff865421, 0xffffffffffffffff, 4, 1);
TESTINST("dext", 0xffffffffff865421, 0x98765432, 4, 1);
TESTINST("dext", 0xffffffffff865421, 0xffffffffff865421, 4, 1);
TESTINST("dext", 0x0, 0x0, 4, 4);
TESTINST("dext", 0x0, 0xffffffffffffffff, 4, 4);
TESTINST("dext", 0x0, 0x98765432, 4, 4);
TESTINST("dext", 0x0, 0xffffffffff865421, 4, 4);
TESTINST("dext", 0xffffffffffffffff, 0x0, 4, 4);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffffffffff, 4, 4);
TESTINST("dext", 0xffffffffffffffff, 0x98765432, 4, 4);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffff865421, 4, 4);
TESTINST("dext", 0x98765432, 0x0, 4, 4);
TESTINST("dext", 0x98765432, 0xffffffffffffffff, 4, 4);
TESTINST("dext", 0x98765432, 0x98765432, 4, 4);
TESTINST("dext", 0x98765432, 0xffffffffff865421, 4, 4);
TESTINST("dext", 0xffffffffff865421, 0x0, 4, 4);
TESTINST("dext", 0xffffffffff865421, 0xffffffffffffffff, 4, 4);
TESTINST("dext", 0xffffffffff865421, 0x98765432, 4, 4);
TESTINST("dext", 0xffffffffff865421, 0xffffffffff865421, 4, 4);
TESTINST("dext", 0x0, 0x0, 4, 16);
TESTINST("dext", 0x0, 0xffffffffffffffff, 4, 16);
TESTINST("dext", 0x0, 0x98765432, 4, 16);
TESTINST("dext", 0x0, 0xffffffffff865421, 4, 16);
TESTINST("dext", 0xffffffffffffffff, 0x0, 4, 16);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffffffffff, 4, 16);
TESTINST("dext", 0xffffffffffffffff, 0x98765432, 4, 16);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffff865421, 4, 16);
TESTINST("dext", 0x98765432, 0x0, 4, 16);
TESTINST("dext", 0x98765432, 0xffffffffffffffff, 4, 16);
TESTINST("dext", 0x98765432, 0x98765432, 4, 16);
TESTINST("dext", 0x98765432, 0xffffffffff865421, 4, 16);
TESTINST("dext", 0xffffffffff865421, 0x0, 4, 16);
TESTINST("dext", 0xffffffffff865421, 0xffffffffffffffff, 4, 16);
TESTINST("dext", 0xffffffffff865421, 0x98765432, 4, 16);
TESTINST("dext", 0xffffffffff865421, 0xffffffffff865421, 4, 16);
TESTINST("dext", 0x0, 0x0, 4, 32);
TESTINST("dext", 0x0, 0xffffffffffffffff, 4, 32);
TESTINST("dext", 0x0, 0x98765432, 4, 32);
TESTINST("dext", 0x0, 0xffffffffff865421, 4, 32);
TESTINST("dext", 0xffffffffffffffff, 0x0, 4, 32);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffffffffff, 4, 32);
TESTINST("dext", 0xffffffffffffffff, 0x98765432, 4, 32);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffff865421, 4, 32);
TESTINST("dext", 0x98765432, 0x0, 4, 32);
TESTINST("dext", 0x98765432, 0xffffffffffffffff, 4, 32);
TESTINST("dext", 0x98765432, 0x98765432, 4, 32);
TESTINST("dext", 0x98765432, 0xffffffffff865421, 4, 32);
TESTINST("dext", 0xffffffffff865421, 0x0, 4, 32);
TESTINST("dext", 0xffffffffff865421, 0xffffffffffffffff, 4, 32);
TESTINST("dext", 0xffffffffff865421, 0x98765432, 4, 32);
TESTINST("dext", 0xffffffffff865421, 0xffffffffff865421, 4, 32);
TESTINST("dext", 0x0, 0x0, 16, 1);
TESTINST("dext", 0x0, 0xffffffffffffffff, 16, 1);
TESTINST("dext", 0x0, 0x98765432, 16, 1);
TESTINST("dext", 0x0, 0xffffffffff865421, 16, 1);
TESTINST("dext", 0xffffffffffffffff, 0x0, 16, 1);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffffffffff, 16, 1);
TESTINST("dext", 0xffffffffffffffff, 0x98765432, 16, 1);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffff865421, 16, 1);
TESTINST("dext", 0x98765432, 0x0, 16, 1);
TESTINST("dext", 0x98765432, 0xffffffffffffffff, 16, 1);
TESTINST("dext", 0x98765432, 0x98765432, 16, 1);
TESTINST("dext", 0x98765432, 0xffffffffff865421, 16, 1);
TESTINST("dext", 0xffffffffff865421, 0x0, 16, 1);
TESTINST("dext", 0xffffffffff865421, 0xffffffffffffffff, 16, 1);
TESTINST("dext", 0xffffffffff865421, 0x98765432, 16, 1);
TESTINST("dext", 0xffffffffff865421, 0xffffffffff865421, 16, 1);
TESTINST("dext", 0x0, 0x0, 16, 4);
TESTINST("dext", 0x0, 0xffffffffffffffff, 16, 4);
TESTINST("dext", 0x0, 0x98765432, 16, 4);
TESTINST("dext", 0x0, 0xffffffffff865421, 16, 4);
TESTINST("dext", 0xffffffffffffffff, 0x0, 16, 4);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffffffffff, 16, 4);
TESTINST("dext", 0xffffffffffffffff, 0x98765432, 16, 4);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffff865421, 16, 4);
TESTINST("dext", 0x98765432, 0x0, 16, 4);
TESTINST("dext", 0x98765432, 0xffffffffffffffff, 16, 4);
TESTINST("dext", 0x98765432, 0x98765432, 16, 4);
TESTINST("dext", 0x98765432, 0xffffffffff865421, 16, 4);
TESTINST("dext", 0xffffffffff865421, 0x0, 16, 4);
TESTINST("dext", 0xffffffffff865421, 0xffffffffffffffff, 16, 4);
TESTINST("dext", 0xffffffffff865421, 0x98765432, 16, 4);
TESTINST("dext", 0xffffffffff865421, 0xffffffffff865421, 16, 4);
TESTINST("dext", 0x0, 0x0, 16, 16);
TESTINST("dext", 0x0, 0xffffffffffffffff, 16, 16);
TESTINST("dext", 0x0, 0x98765432, 16, 16);
TESTINST("dext", 0x0, 0xffffffffff865421, 16, 16);
TESTINST("dext", 0xffffffffffffffff, 0x0, 16, 16);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffffffffff, 16, 16);
TESTINST("dext", 0xffffffffffffffff, 0x98765432, 16, 16);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffff865421, 16, 16);
TESTINST("dext", 0x98765432, 0x0, 16, 16);
TESTINST("dext", 0x98765432, 0xffffffffffffffff, 16, 16);
TESTINST("dext", 0x98765432, 0x98765432, 16, 16);
TESTINST("dext", 0x98765432, 0xffffffffff865421, 16, 16);
TESTINST("dext", 0xffffffffff865421, 0x0, 16, 16);
TESTINST("dext", 0xffffffffff865421, 0xffffffffffffffff, 16, 16);
TESTINST("dext", 0xffffffffff865421, 0x98765432, 16, 16);
TESTINST("dext", 0xffffffffff865421, 0xffffffffff865421, 16, 16);
TESTINST("dext", 0x0, 0x0, 16, 32);
TESTINST("dext", 0x0, 0xffffffffffffffff, 16, 32);
TESTINST("dext", 0x0, 0x98765432, 16, 32);
TESTINST("dext", 0x0, 0xffffffffff865421, 16, 32);
TESTINST("dext", 0xffffffffffffffff, 0x0, 16, 32);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffffffffff, 16, 32);
TESTINST("dext", 0xffffffffffffffff, 0x98765432, 16, 32);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffff865421, 16, 32);
TESTINST("dext", 0x98765432, 0x0, 16, 32);
TESTINST("dext", 0x98765432, 0xffffffffffffffff, 16, 32);
TESTINST("dext", 0x98765432, 0x98765432, 16, 32);
TESTINST("dext", 0x98765432, 0xffffffffff865421, 16, 32);
TESTINST("dext", 0xffffffffff865421, 0x0, 16, 32);
TESTINST("dext", 0xffffffffff865421, 0xffffffffffffffff, 16, 32);
TESTINST("dext", 0xffffffffff865421, 0x98765432, 16, 32);
TESTINST("dext", 0xffffffffff865421, 0xffffffffff865421, 16, 32);
TESTINST("dext", 0x0, 0x0, 31, 1);
TESTINST("dext", 0x0, 0xffffffffffffffff, 31, 1);
TESTINST("dext", 0x0, 0x98765432, 31, 1);
TESTINST("dext", 0x0, 0xffffffffff865421, 31, 1);
TESTINST("dext", 0xffffffffffffffff, 0x0, 31, 1);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffffffffff, 31, 1);
TESTINST("dext", 0xffffffffffffffff, 0x98765432, 31, 1);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffff865421, 31, 1);
TESTINST("dext", 0x98765432, 0x0, 31, 1);
TESTINST("dext", 0x98765432, 0xffffffffffffffff, 31, 1);
TESTINST("dext", 0x98765432, 0x98765432, 31, 1);
TESTINST("dext", 0x98765432, 0xffffffffff865421, 31, 1);
TESTINST("dext", 0xffffffffff865421, 0x0, 31, 1);
TESTINST("dext", 0xffffffffff865421, 0xffffffffffffffff, 31, 1);
TESTINST("dext", 0xffffffffff865421, 0x98765432, 31, 1);
TESTINST("dext", 0xffffffffff865421, 0xffffffffff865421, 31, 1);
TESTINST("dext", 0x0, 0x0, 31, 4);
TESTINST("dext", 0x0, 0xffffffffffffffff, 31, 4);
TESTINST("dext", 0x0, 0x98765432, 31, 4);
TESTINST("dext", 0x0, 0xffffffffff865421, 31, 4);
TESTINST("dext", 0xffffffffffffffff, 0x0, 31, 4);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffffffffff, 31, 4);
TESTINST("dext", 0xffffffffffffffff, 0x98765432, 31, 4);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffff865421, 31, 4);
TESTINST("dext", 0x98765432, 0x0, 31, 4);
TESTINST("dext", 0x98765432, 0xffffffffffffffff, 31, 4);
TESTINST("dext", 0x98765432, 0x98765432, 31, 4);
TESTINST("dext", 0x98765432, 0xffffffffff865421, 31, 4);
TESTINST("dext", 0xffffffffff865421, 0x0, 31, 4);
TESTINST("dext", 0xffffffffff865421, 0xffffffffffffffff, 31, 4);
TESTINST("dext", 0xffffffffff865421, 0x98765432, 31, 4);
TESTINST("dext", 0xffffffffff865421, 0xffffffffff865421, 31, 4);
TESTINST("dext", 0x0, 0x0, 31, 16);
TESTINST("dext", 0x0, 0xffffffffffffffff, 31, 16);
TESTINST("dext", 0x0, 0x98765432, 31, 16);
TESTINST("dext", 0x0, 0xffffffffff865421, 31, 16);
TESTINST("dext", 0xffffffffffffffff, 0x0, 31, 16);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffffffffff, 31, 16);
TESTINST("dext", 0xffffffffffffffff, 0x98765432, 31, 16);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffff865421, 31, 16);
TESTINST("dext", 0x98765432, 0x0, 31, 16);
TESTINST("dext", 0x98765432, 0xffffffffffffffff, 31, 16);
TESTINST("dext", 0x98765432, 0x98765432, 31, 16);
TESTINST("dext", 0x98765432, 0xffffffffff865421, 31, 16);
TESTINST("dext", 0xffffffffff865421, 0x0, 31, 16);
TESTINST("dext", 0xffffffffff865421, 0xffffffffffffffff, 31, 16);
TESTINST("dext", 0xffffffffff865421, 0x98765432, 31, 16);
TESTINST("dext", 0xffffffffff865421, 0xffffffffff865421, 31, 16);
TESTINST("dext", 0x0, 0x0, 31, 32);
TESTINST("dext", 0x0, 0xffffffffffffffff, 31, 32);
TESTINST("dext", 0x0, 0x98765432, 31, 32);
TESTINST("dext", 0x0, 0xffffffffff865421, 31, 32);
TESTINST("dext", 0xffffffffffffffff, 0x0, 31, 32);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffffffffff, 31, 32);
TESTINST("dext", 0xffffffffffffffff, 0x98765432, 31, 32);
TESTINST("dext", 0xffffffffffffffff, 0xffffffffff865421, 31, 32);
TESTINST("dext", 0x98765432, 0x0, 31, 32);
TESTINST("dext", 0x98765432, 0xffffffffffffffff, 31, 32);
TESTINST("dext", 0x98765432, 0x98765432, 31, 32);
TESTINST("dext", 0x98765432, 0xffffffffff865421, 31, 32);
TESTINST("dext", 0xffffffffff865421, 0x0, 31, 32);
TESTINST("dext", 0xffffffffff865421, 0xffffffffffffffff, 31, 32);
TESTINST("dext", 0xffffffffff865421, 0x98765432, 31, 32);
TESTINST("dext", 0xffffffffff865421, 0xffffffffff865421, 31, 32);
TESTINST("dext", 0x2002ffffffffffff, 0xfffffffff0000fff, 4, 4);
TESTINST("dext", 0xffff0000ffffffff, 0xff0000ffffffffff, 8, 4);
TESTINST("dext", 0x2000ffffffffffff, 0xffff0000ffffffff, 16, 4);
TESTINST("dext", 0x2000ffffffddddff, 0xffffffffffff0008, 24, 2);
TESTINST("dext", 0x2000ffffffffeeee, 0xfffffff31415927f, 24, 4);
TESTINST("dext", 0x31415927ffffffff, 0x2000ffffffffffff, 9, 2);
TESTINST("dext", 0x2000ffffffffaaaa, 0x2000ffffffff2222, 16, 4);
TESTINST("dext", 0x2000ffffffbbbbff, 0x7fffffffddddffff, 16, 4);
TESTINST("dext", 0xeeeeff33ff22ffff, 0x2000ffffffffffff, 7, 4);
TESTINST("dext", 0x2000ffffffffffff, 0x2000ffffffffbbbb, 5, 4);
TESTINST("dext", 0x2000ffffffffbbbb, 0xfffffffff0000fff, 3, 4);
TESTINST("dext", 0x2000ffffffffffff, 0xffff0000ffffffff, 16, 16);
TESTINST("dext", 0x7fffffffddddffff, 0xffffffffffff0008, 16, 32);
TESTINST("dext", 0x2000ffffffff2222, 0xfffffff31415927f, 2, 60);
TESTINST("dext", 0x2000ffffffffffff, 0x2000ffffffffffff, 16, 6);
TESTINST("dext", 0xfffffff31415927f, 0x2000ffffffff2222, 31, 32);
TESTINST("dext", 0xffffffffffff0008, 0x7fffffffddddffff, 8, 2);
TESTINST("dext", 0xffff0000ffffffff, 0x2000ffffffffffff, 16, 4);
TESTINST("dext", 0xff0000ffffffffff, 0, 8, 4);
TESTINST("dext", 0xfffffffff0000fff, 0, 16, 4);
printf("--- DEXTM ---\n");
/* The values of pos and size must satisfy all of the following relations:
0 <= pos < 32
32 < size <= 64
32 < pos+size <= 64 */
TESTINST("dextm", 0x0, 0x0, 0, 33);
TESTINST("dextm", 0x0, 0xffffffffffffffff, 0, 33);
TESTINST("dextm", 0x0, 0x98765432, 0, 33);
TESTINST("dextm", 0x0, 0xffffffffff865421, 0, 33);
TESTINST("dextm", 0xffffffffffffffff, 0x0, 0, 33);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffffffffff, 0, 33);
TESTINST("dextm", 0xffffffffffffffff, 0x98765432, 0, 33);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffff865421, 0, 33);
TESTINST("dextm", 0x98765432, 0x0, 0, 33);
TESTINST("dextm", 0x98765432, 0xffffffffffffffff, 0, 33);
TESTINST("dextm", 0x98765432, 0x98765432, 0, 33);
TESTINST("dextm", 0x98765432, 0xffffffffff865421, 0, 33);
TESTINST("dextm", 0xffffffffff865421, 0x0, 0, 33);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffffffffff, 0, 33);
TESTINST("dextm", 0xffffffffff865421, 0x98765432, 0, 33);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffff865421, 0, 33);
TESTINST("dextm", 0x0, 0x0, 0, 37);
TESTINST("dextm", 0x0, 0xffffffffffffffff, 0, 37);
TESTINST("dextm", 0x0, 0x98765432, 0, 37);
TESTINST("dextm", 0x0, 0xffffffffff865421, 0, 37);
TESTINST("dextm", 0xffffffffffffffff, 0x0, 0, 37);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffffffffff, 0, 37);
TESTINST("dextm", 0xffffffffffffffff, 0x98765432, 0, 37);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffff865421, 0, 37);
TESTINST("dextm", 0x98765432, 0x0, 0, 37);
TESTINST("dextm", 0x98765432, 0xffffffffffffffff, 0, 37);
TESTINST("dextm", 0x98765432, 0x98765432, 0, 37);
TESTINST("dextm", 0x98765432, 0xffffffffff865421, 0, 37);
TESTINST("dextm", 0xffffffffff865421, 0x0, 0, 37);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffffffffff, 0, 37);
TESTINST("dextm", 0xffffffffff865421, 0x98765432, 0, 37);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffff865421, 0, 37);
TESTINST("dextm", 0x0, 0x0, 0, 48);
TESTINST("dextm", 0x0, 0xffffffffffffffff, 0, 48);
TESTINST("dextm", 0x0, 0x98765432, 0, 48);
TESTINST("dextm", 0x0, 0xffffffffff865421, 0, 48);
TESTINST("dextm", 0xffffffffffffffff, 0x0, 0, 48);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffffffffff, 0, 48);
TESTINST("dextm", 0xffffffffffffffff, 0x98765432, 0, 48);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffff865421, 0, 48);
TESTINST("dextm", 0x98765432, 0x0, 0, 48);
TESTINST("dextm", 0x98765432, 0xffffffffffffffff, 0, 48);
TESTINST("dextm", 0x98765432, 0x98765432, 0, 48);
TESTINST("dextm", 0x98765432, 0xffffffffff865421, 0, 48);
TESTINST("dextm", 0xffffffffff865421, 0x0, 0, 48);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffffffffff, 0, 48);
TESTINST("dextm", 0xffffffffff865421, 0x98765432, 0, 48);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffff865421, 0, 48);
TESTINST("dextm", 0x0, 0x0, 0, 64);
TESTINST("dextm", 0x0, 0xffffffffffffffff, 0, 64);
TESTINST("dextm", 0x0, 0x98765432, 0, 64);
TESTINST("dextm", 0x0, 0xffffffffff865421, 0, 64);
TESTINST("dextm", 0xffffffffffffffff, 0x0, 0, 64);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffffffffff, 0, 64);
TESTINST("dextm", 0xffffffffffffffff, 0x98765432, 0, 64);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffff865421, 0, 64);
TESTINST("dextm", 0x98765432, 0x0, 0, 64);
TESTINST("dextm", 0x98765432, 0xffffffffffffffff, 0, 64);
TESTINST("dextm", 0x98765432, 0x98765432, 0, 64);
TESTINST("dextm", 0x98765432, 0xffffffffff865421, 0, 64);
TESTINST("dextm", 0xffffffffff865421, 0x0, 0, 64);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffffffffff, 0, 64);
TESTINST("dextm", 0xffffffffff865421, 0x98765432, 0, 64);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffff865421, 0, 64);
TESTINST("dextm", 0x0, 0x0, 4, 33);
TESTINST("dextm", 0x0, 0xffffffffffffffff, 4, 33);
TESTINST("dextm", 0x0, 0x98765432, 4, 33);
TESTINST("dextm", 0x0, 0xffffffffff865421, 4, 33);
TESTINST("dextm", 0xffffffffffffffff, 0x0, 4, 33);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffffffffff, 4, 33);
TESTINST("dextm", 0xffffffffffffffff, 0x98765432, 4, 33);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffff865421, 4, 33);
TESTINST("dextm", 0x98765432, 0x0, 4, 33);
TESTINST("dextm", 0x98765432, 0xffffffffffffffff, 4, 33);
TESTINST("dextm", 0x98765432, 0x98765432, 4, 33);
TESTINST("dextm", 0x98765432, 0xffffffffff865421, 4, 33);
TESTINST("dextm", 0xffffffffff865421, 0x0, 4, 33);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffffffffff, 4, 33);
TESTINST("dextm", 0xffffffffff865421, 0x98765432, 4, 33);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffff865421, 4, 33);
TESTINST("dextm", 0x0, 0x0, 4, 37);
TESTINST("dextm", 0x0, 0xffffffffffffffff, 4, 37);
TESTINST("dextm", 0x0, 0x98765432, 4, 37);
TESTINST("dextm", 0x0, 0xffffffffff865421, 4, 37);
TESTINST("dextm", 0xffffffffffffffff, 0x0, 4, 37);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffffffffff, 4, 37);
TESTINST("dextm", 0xffffffffffffffff, 0x98765432, 4, 37);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffff865421, 4, 37);
TESTINST("dextm", 0x98765432, 0x0, 4, 37);
TESTINST("dextm", 0x98765432, 0xffffffffffffffff, 4, 37);
TESTINST("dextm", 0x98765432, 0x98765432, 4, 37);
TESTINST("dextm", 0x98765432, 0xffffffffff865421, 4, 37);
TESTINST("dextm", 0xffffffffff865421, 0x0, 4, 37);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffffffffff, 4, 37);
TESTINST("dextm", 0xffffffffff865421, 0x98765432, 4, 37);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffff865421, 4, 37);
TESTINST("dextm", 0x0, 0x0, 4, 48);
TESTINST("dextm", 0x0, 0xffffffffffffffff, 4, 48);
TESTINST("dextm", 0x0, 0x98765432, 4, 48);
TESTINST("dextm", 0x0, 0xffffffffff865421, 4, 48);
TESTINST("dextm", 0xffffffffffffffff, 0x0, 4, 48);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffffffffff, 4, 48);
TESTINST("dextm", 0xffffffffffffffff, 0x98765432, 4, 48);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffff865421, 4, 48);
TESTINST("dextm", 0x98765432, 0x0, 4, 48);
TESTINST("dextm", 0x98765432, 0xffffffffffffffff, 4, 48);
TESTINST("dextm", 0x98765432, 0x98765432, 4, 48);
TESTINST("dextm", 0x98765432, 0xffffffffff865421, 4, 48);
TESTINST("dextm", 0xffffffffff865421, 0x0, 4, 48);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffffffffff, 4, 48);
TESTINST("dextm", 0xffffffffff865421, 0x98765432, 4, 48);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffff865421, 4, 48);
TESTINST("dextm", 0x0, 0x0, 4, 60);
TESTINST("dextm", 0x0, 0xffffffffffffffff, 4, 60);
TESTINST("dextm", 0x0, 0x98765432, 4, 60);
TESTINST("dextm", 0x0, 0xffffffffff865421, 4, 60);
TESTINST("dextm", 0xffffffffffffffff, 0x0, 4, 60);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffffffffff, 4, 60);
TESTINST("dextm", 0xffffffffffffffff, 0x98765432, 4, 60);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffff865421, 4, 60);
TESTINST("dextm", 0x98765432, 0x0, 4, 60);
TESTINST("dextm", 0x98765432, 0xffffffffffffffff, 4, 60);
TESTINST("dextm", 0x98765432, 0x98765432, 4, 60);
TESTINST("dextm", 0x98765432, 0xffffffffff865421, 4, 60);
TESTINST("dextm", 0xffffffffff865421, 0x0, 4, 60);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffffffffff, 4, 60);
TESTINST("dextm", 0xffffffffff865421, 0x98765432, 4, 60);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffff865421, 4, 60);
TESTINST("dextm", 0x0, 0x0, 16, 33);
TESTINST("dextm", 0x0, 0xffffffffffffffff, 16, 33);
TESTINST("dextm", 0x0, 0x98765432, 16, 33);
TESTINST("dextm", 0x0, 0xffffffffff865421, 16, 33);
TESTINST("dextm", 0xffffffffffffffff, 0x0, 16, 33);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffffffffff, 16, 33);
TESTINST("dextm", 0xffffffffffffffff, 0x98765432, 16, 33);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffff865421, 16, 33);
TESTINST("dextm", 0x98765432, 0x0, 16, 33);
TESTINST("dextm", 0x98765432, 0xffffffffffffffff, 16, 33);
TESTINST("dextm", 0x98765432, 0x98765432, 16, 33);
TESTINST("dextm", 0x98765432, 0xffffffffff865421, 16, 33);
TESTINST("dextm", 0xffffffffff865421, 0x0, 16, 33);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffffffffff, 16, 33);
TESTINST("dextm", 0xffffffffff865421, 0x98765432, 16, 33);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffff865421, 16, 33);
TESTINST("dextm", 0x0, 0x0, 16, 37);
TESTINST("dextm", 0x0, 0xffffffffffffffff, 16, 37);
TESTINST("dextm", 0x0, 0x98765432, 16, 37);
TESTINST("dextm", 0x0, 0xffffffffff865421, 16, 37);
TESTINST("dextm", 0xffffffffffffffff, 0x0, 16, 37);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffffffffff, 16, 37);
TESTINST("dextm", 0xffffffffffffffff, 0x98765432, 16, 37);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffff865421, 16, 37);
TESTINST("dextm", 0x98765432, 0x0, 16, 37);
TESTINST("dextm", 0x98765432, 0xffffffffffffffff, 16, 37);
TESTINST("dextm", 0x98765432, 0x98765432, 16, 37);
TESTINST("dextm", 0x98765432, 0xffffffffff865421, 16, 37);
TESTINST("dextm", 0xffffffffff865421, 0x0, 16, 37);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffffffffff, 16, 37);
TESTINST("dextm", 0xffffffffff865421, 0x98765432, 16, 37);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffff865421, 16, 37);
TESTINST("dextm", 0x0, 0x0, 16, 48);
TESTINST("dextm", 0x0, 0xffffffffffffffff, 16, 48);
TESTINST("dextm", 0x0, 0x98765432, 16, 48);
TESTINST("dextm", 0x0, 0xffffffffff865421, 16, 48);
TESTINST("dextm", 0xffffffffffffffff, 0x0, 16, 48);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffffffffff, 16, 48);
TESTINST("dextm", 0xffffffffffffffff, 0x98765432, 16, 48);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffff865421, 16, 48);
TESTINST("dextm", 0x98765432, 0x0, 16, 48);
TESTINST("dextm", 0x98765432, 0xffffffffffffffff, 16, 48);
TESTINST("dextm", 0x98765432, 0x98765432, 16, 48);
TESTINST("dextm", 0x98765432, 0xffffffffff865421, 16, 48);
TESTINST("dextm", 0xffffffffff865421, 0x0, 16, 48);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffffffffff, 16, 48);
TESTINST("dextm", 0xffffffffff865421, 0x98765432, 16, 48);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffff865421, 16, 48);
TESTINST("dextm", 0x0, 0x0, 31, 33);
TESTINST("dextm", 0x0, 0xffffffffffffffff, 31, 33);
TESTINST("dextm", 0x0, 0x98765432, 31, 33);
TESTINST("dextm", 0x0, 0xffffffffff865421, 31, 33);
TESTINST("dextm", 0xffffffffffffffff, 0x0, 31, 33);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffffffffff, 31, 33);
TESTINST("dextm", 0xffffffffffffffff, 0x98765432, 31, 33);
TESTINST("dextm", 0xffffffffffffffff, 0xffffffffff865421, 31, 33);
TESTINST("dextm", 0x98765432, 0x0, 31, 33);
TESTINST("dextm", 0x98765432, 0xffffffffffffffff, 31, 33);
TESTINST("dextm", 0x98765432, 0x98765432, 31, 33);
TESTINST("dextm", 0x98765432, 0xffffffffff865421, 31, 33);
TESTINST("dextm", 0xffffffffff865421, 0x0, 31, 33);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffffffffff, 31, 33);
TESTINST("dextm", 0xffffffffff865421, 0x98765432, 31, 33);
TESTINST("dextm", 0xffffffffff865421, 0xffffffffff865421, 31, 33);
TESTINST("dextm", 0x2002ffffffffffff, 0xfffffffff0000fff, 4, 35);
TESTINST("dextm", 0xffff0000ffffffff, 0xff0000ffffffffff, 8, 33);
TESTINST("dextm", 0x2000ffffffffffff, 0xffff0000ffffffff, 16, 34);
TESTINST("dextm", 0x2000ffffffddddff, 0xffffffffffff0008, 4, 46);
TESTINST("dextm", 0x2000ffffffffeeee, 0xfffffff31415927f, 3, 56);
TESTINST("dextm", 0x31415927ffffffff, 0x2000ffffffffffff, 0, 64);
TESTINST("dextm", 0x2000ffffffffaaaa, 0x2000ffffffff2222, 16, 40);
TESTINST("dextm", 0x2000ffffffbbbbff, 0x7fffffffddddffff, 16, 42);
TESTINST("dextm", 0xeeeeff33ff22ffff, 0x2000ffffffffffff, 7, 43);
TESTINST("dextm", 0x2000ffffffffffff, 0x2000ffffffffbbbb, 5, 48);
TESTINST("dextm", 0x2000ffffffffbbbb, 0x2000ffffffffffff, 3, 52);
TESTINST("dextm", 0x2000ffffffffffff, 0xeeeeff33ff22ffff, 1, 54);
TESTINST("dextm", 0x7fffffffddddffff, 0x2000ffffffbbbbff, 2, 54);
TESTINST("dextm", 0x2000ffffffff2222, 0x2000ffffffffaaaa, 2, 48);
TESTINST("dextm", 0x2000ffffffffffff, 0x31415927ffffffff, 5, 53);
TESTINST("dextm", 0xfffffff31415927f, 0x2000ffffffffeeee, 2, 60);
TESTINST("dextm", 0xffffffffffff0008, 0x2000ffffffddddff, 3, 61);
TESTINST("dextm", 0xffff0000ffffffff, 0x2000ffffffffffff, 1, 62);
TESTINST("dextm", 0xff0000ffffffffff, 0, 8, 38);
TESTINST("dextm", 0xfffffffff0000fff, 0, 16, 39);
printf("--- DEXTU ---\n");
/* The values of pos and size must satisfy all of the following relations:
32 <= pos < 64
0 < size <= 32
32 < pos+size <= 64 */
TESTINST("dextu", 0x0, 0x0, 32, 1);
TESTINST("dextu", 0x0, 0xffffffffffffffff, 32, 1);
TESTINST("dextu", 0x0, 0x98765432, 32, 1);
TESTINST("dextu", 0x0, 0xffffffffff865421, 32, 1);
TESTINST("dextu", 0xffffffffffffffff, 0x0, 32, 1);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffffffffff, 32, 1);
TESTINST("dextu", 0xffffffffffffffff, 0x98765432, 32, 1);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffff865421, 32, 1);
TESTINST("dextu", 0x98765432, 0x0, 32, 1);
TESTINST("dextu", 0x98765432, 0xffffffffffffffff, 32, 1);
TESTINST("dextu", 0x98765432, 0x98765432, 32, 1);
TESTINST("dextu", 0x98765432, 0xffffffffff865421, 32, 1);
TESTINST("dextu", 0xffffffffff865421, 0x0, 32, 1);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffffffffff, 32, 1);
TESTINST("dextu", 0xffffffffff865421, 0x98765432, 32, 1);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffff865421, 32, 1);
TESTINST("dextu", 0x0, 0x0, 32, 4);
TESTINST("dextu", 0x0, 0xffffffffffffffff, 32, 4);
TESTINST("dextu", 0x0, 0x98765432, 32, 4);
TESTINST("dextu", 0x0, 0xffffffffff865421, 32, 4);
TESTINST("dextu", 0xffffffffffffffff, 0x0, 32, 4);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffffffffff, 32, 4);
TESTINST("dextu", 0xffffffffffffffff, 0x98765432, 32, 4);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffff865421, 32, 4);
TESTINST("dextu", 0x98765432, 0x0, 32, 4);
TESTINST("dextu", 0x98765432, 0xffffffffffffffff, 32, 4);
TESTINST("dextu", 0x98765432, 0x98765432, 32, 4);
TESTINST("dextu", 0x98765432, 0xffffffffff865421, 32, 4);
TESTINST("dextu", 0xffffffffff865421, 0x0, 32, 4);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffffffffff, 32, 4);
TESTINST("dextu", 0xffffffffff865421, 0x98765432, 32, 4);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffff865421, 32, 4);
TESTINST("dextu", 0x0, 0x0, 32, 16);
TESTINST("dextu", 0x0, 0xffffffffffffffff, 32, 16);
TESTINST("dextu", 0x0, 0x98765432, 32, 16);
TESTINST("dextu", 0x0, 0xffffffffff865421, 32, 16);
TESTINST("dextu", 0xffffffffffffffff, 0x0, 32, 16);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffffffffff, 32, 16);
TESTINST("dextu", 0xffffffffffffffff, 0x98765432, 32, 16);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffff865421, 32, 16);
TESTINST("dextu", 0x98765432, 0x0, 32, 16);
TESTINST("dextu", 0x98765432, 0xffffffffffffffff, 32, 16);
TESTINST("dextu", 0x98765432, 0x98765432, 32, 16);
TESTINST("dextu", 0x98765432, 0xffffffffff865421, 32, 16);
TESTINST("dextu", 0xffffffffff865421, 0x0, 32, 16);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffffffffff, 32, 16);
TESTINST("dextu", 0xffffffffff865421, 0x98765432, 32, 16);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffff865421, 32, 16);
TESTINST("dextu", 0x0, 0x0, 32, 32);
TESTINST("dextu", 0x0, 0xffffffffffffffff, 32, 32);
TESTINST("dextu", 0x0, 0x98765432, 32, 32);
TESTINST("dextu", 0x0, 0xffffffffff865421, 32, 32);
TESTINST("dextu", 0xffffffffffffffff, 0x0, 32, 32);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffffffffff, 32, 32);
TESTINST("dextu", 0xffffffffffffffff, 0x98765432, 32, 32);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffff865421, 32, 32);
TESTINST("dextu", 0x98765432, 0x0, 32, 32);
TESTINST("dextu", 0x98765432, 0xffffffffffffffff, 32, 32);
TESTINST("dextu", 0x98765432, 0x98765432, 32, 32);
TESTINST("dextu", 0x98765432, 0xffffffffff865421, 32, 32);
TESTINST("dextu", 0xffffffffff865421, 0x0, 32, 32);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffffffffff, 32, 32);
TESTINST("dextu", 0xffffffffff865421, 0x98765432, 32, 32);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffff865421, 32, 32);
TESTINST("dextu", 0x0, 0x0, 36, 1);
TESTINST("dextu", 0x0, 0xffffffffffffffff, 36, 1);
TESTINST("dextu", 0x0, 0x98765432, 36, 1);
TESTINST("dextu", 0x0, 0xffffffffff865421, 36, 1);
TESTINST("dextu", 0xffffffffffffffff, 0x0, 36, 1);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffffffffff, 36, 1);
TESTINST("dextu", 0xffffffffffffffff, 0x98765432, 36, 1);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffff865421, 36, 1);
TESTINST("dextu", 0x98765432, 0x0, 36, 1);
TESTINST("dextu", 0x98765432, 0xffffffffffffffff, 36, 1);
TESTINST("dextu", 0x98765432, 0x98765432, 36, 1);
TESTINST("dextu", 0x98765432, 0xffffffffff865421, 36, 1);
TESTINST("dextu", 0xffffffffff865421, 0x0, 36, 1);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffffffffff, 36, 1);
TESTINST("dextu", 0xffffffffff865421, 0x98765432, 36, 1);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffff865421, 36, 1);
TESTINST("dextu", 0x0, 0x0, 36, 4);
TESTINST("dextu", 0x0, 0xffffffffffffffff, 36, 4);
TESTINST("dextu", 0x0, 0x98765432, 36, 4);
TESTINST("dextu", 0x0, 0xffffffffff865421, 36, 4);
TESTINST("dextu", 0xffffffffffffffff, 0x0, 36, 4);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffffffffff, 36, 4);
TESTINST("dextu", 0xffffffffffffffff, 0x98765432, 36, 4);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffff865421, 36, 4);
TESTINST("dextu", 0x98765432, 0x0, 36, 4);
TESTINST("dextu", 0x98765432, 0xffffffffffffffff, 36, 4);
TESTINST("dextu", 0x98765432, 0x98765432, 36, 4);
TESTINST("dextu", 0x98765432, 0xffffffffff865421, 36, 4);
TESTINST("dextu", 0xffffffffff865421, 0x0, 36, 4);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffffffffff, 36, 4);
TESTINST("dextu", 0xffffffffff865421, 0x98765432, 36, 4);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffff865421, 36, 4);
TESTINST("dextu", 0x0, 0x0, 36, 16);
TESTINST("dextu", 0x0, 0xffffffffffffffff, 36, 16);
TESTINST("dextu", 0x0, 0x98765432, 36, 16);
TESTINST("dextu", 0x0, 0xffffffffff865421, 36, 16);
TESTINST("dextu", 0xffffffffffffffff, 0x0, 36, 16);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffffffffff, 36, 16);
TESTINST("dextu", 0xffffffffffffffff, 0x98765432, 36, 16);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffff865421, 36, 16);
TESTINST("dextu", 0x98765432, 0x0, 36, 16);
TESTINST("dextu", 0x98765432, 0xffffffffffffffff, 36, 16);
TESTINST("dextu", 0x98765432, 0x98765432, 36, 16);
TESTINST("dextu", 0x98765432, 0xffffffffff865421, 36, 16);
TESTINST("dextu", 0xffffffffff865421, 0x0, 36, 16);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffffffffff, 36, 16);
TESTINST("dextu", 0xffffffffff865421, 0x98765432, 36, 16);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffff865421, 36, 16);
TESTINST("dextu", 0x0, 0x0, 36, 28);
TESTINST("dextu", 0x0, 0xffffffffffffffff, 36, 28);
TESTINST("dextu", 0x0, 0x98765432, 36, 28);
TESTINST("dextu", 0x0, 0xffffffffff865421, 36, 28);
TESTINST("dextu", 0xffffffffffffffff, 0x0, 36, 28);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffffffffff, 36, 28);
TESTINST("dextu", 0xffffffffffffffff, 0x98765432, 36, 28);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffff865421, 36, 28);
TESTINST("dextu", 0x98765432, 0x0, 36, 28);
TESTINST("dextu", 0x98765432, 0xffffffffffffffff, 36, 28);
TESTINST("dextu", 0x98765432, 0x98765432, 36, 28);
TESTINST("dextu", 0x98765432, 0xffffffffff865421, 36, 28);
TESTINST("dextu", 0xffffffffff865421, 0x0, 36, 28);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffffffffff, 36, 28);
TESTINST("dextu", 0xffffffffff865421, 0x98765432, 36, 28);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffff865421, 36, 28);
TESTINST("dextu", 0x0, 0x0, 48, 1);
TESTINST("dextu", 0x0, 0xffffffffffffffff, 48, 1);
TESTINST("dextu", 0x0, 0x98765432, 48, 1);
TESTINST("dextu", 0x0, 0xffffffffff865421, 48, 1);
TESTINST("dextu", 0xffffffffffffffff, 0x0, 48, 1);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffffffffff, 48, 1);
TESTINST("dextu", 0xffffffffffffffff, 0x98765432, 48, 1);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffff865421, 48, 1);
TESTINST("dextu", 0x98765432, 0x0, 48, 1);
TESTINST("dextu", 0x98765432, 0xffffffffffffffff, 48, 1);
TESTINST("dextu", 0x98765432, 0x98765432, 48, 1);
TESTINST("dextu", 0x98765432, 0xffffffffff865421, 48, 1);
TESTINST("dextu", 0xffffffffff865421, 0x0, 48, 1);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffffffffff, 48, 1);
TESTINST("dextu", 0xffffffffff865421, 0x98765432, 48, 1);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffff865421, 48, 1);
TESTINST("dextu", 0x0, 0x0, 48, 4);
TESTINST("dextu", 0x0, 0xffffffffffffffff, 48, 4);
TESTINST("dextu", 0x0, 0x98765432, 48, 4);
TESTINST("dextu", 0x0, 0xffffffffff865421, 48, 4);
TESTINST("dextu", 0xffffffffffffffff, 0x0, 48, 4);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffffffffff, 48, 4);
TESTINST("dextu", 0xffffffffffffffff, 0x98765432, 48, 4);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffff865421, 48, 4);
TESTINST("dextu", 0x98765432, 0x0, 48, 4);
TESTINST("dextu", 0x98765432, 0xffffffffffffffff, 48, 4);
TESTINST("dextu", 0x98765432, 0x98765432, 48, 4);
TESTINST("dextu", 0x98765432, 0xffffffffff865421, 48, 4);
TESTINST("dextu", 0xffffffffff865421, 0x0, 48, 4);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffffffffff, 48, 4);
TESTINST("dextu", 0xffffffffff865421, 0x98765432, 48, 4);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffff865421, 48, 4);
TESTINST("dextu", 0x0, 0x0, 48, 16);
TESTINST("dextu", 0x0, 0xffffffffffffffff, 48, 16);
TESTINST("dextu", 0x0, 0x98765432, 48, 16);
TESTINST("dextu", 0x0, 0xffffffffff865421, 48, 16);
TESTINST("dextu", 0xffffffffffffffff, 0x0, 48, 16);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffffffffff, 48, 16);
TESTINST("dextu", 0xffffffffffffffff, 0x98765432, 48, 16);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffff865421, 48, 16);
TESTINST("dextu", 0x98765432, 0x0, 48, 16);
TESTINST("dextu", 0x98765432, 0xffffffffffffffff, 48, 16);
TESTINST("dextu", 0x98765432, 0x98765432, 48, 16);
TESTINST("dextu", 0x98765432, 0xffffffffff865421, 48, 16);
TESTINST("dextu", 0xffffffffff865421, 0x0, 48, 16);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffffffffff, 48, 16);
TESTINST("dextu", 0xffffffffff865421, 0x98765432, 48, 16);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffff865421, 48, 16);
TESTINST("dextu", 0x0, 0x0, 63, 1);
TESTINST("dextu", 0x0, 0xffffffffffffffff, 63, 1);
TESTINST("dextu", 0x0, 0x98765432, 63, 1);
TESTINST("dextu", 0x0, 0xffffffffff865421, 63, 1);
TESTINST("dextu", 0xffffffffffffffff, 0x0, 63, 1);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffffffffff, 63, 1);
TESTINST("dextu", 0xffffffffffffffff, 0x98765432, 63, 1);
TESTINST("dextu", 0xffffffffffffffff, 0xffffffffff865421, 63, 1);
TESTINST("dextu", 0x98765432, 0x0, 63, 1);
TESTINST("dextu", 0x98765432, 0xffffffffffffffff, 63, 1);
TESTINST("dextu", 0x98765432, 0x98765432, 63, 1);
TESTINST("dextu", 0x98765432, 0xffffffffff865421, 63, 1);
TESTINST("dextu", 0xffffffffff865421, 0x0, 63, 1);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffffffffff, 63, 1);
TESTINST("dextu", 0xffffffffff865421, 0x98765432, 63, 1);
TESTINST("dextu", 0xffffffffff865421, 0xffffffffff865421, 63, 1);
TESTINST("dextu", 0x2002ffffffffffff, 0xfffffffff0000fff, 33, 4);
TESTINST("dextu", 0xffff0000ffffffff, 0xff0000ffffffffff, 60, 4);
TESTINST("dextu", 0x2000ffffffffffff, 0xffff0000ffffffff, 54, 4);
TESTINST("dextu", 0x2000ffffffddddff, 0xffffffffffff0008, 56, 2);
TESTINST("dextu", 0x2000ffffffffeeee, 0xfffffff31415927f, 40, 4);
TESTINST("dextu", 0x31415927ffffffff, 0x2000ffffffffffff, 51, 2);
TESTINST("dextu", 0x2000ffffffffaaaa, 0x2000ffffffff2222, 48, 4);
TESTINST("dextu", 0x2000ffffffbbbbff, 0x7fffffffddddffff, 38, 4);
TESTINST("dextu", 0xeeeeff33ff22ffff, 0x2000ffffffffffff, 35, 4);
TESTINST("dextu", 0x2000ffffffffffff, 0x2000ffffffffbbbb, 36, 4);
TESTINST("dextu", 0x2000ffffffffbbbb, 0x2000ffffffffffff, 45, 1);
TESTINST("dextu", 0x2000ffffffffffff, 0xeeeeff33ff22ffff, 46, 4);
TESTINST("dextu", 0x7fffffffddddffff, 0x2000ffffffbbbbff, 52, 4);
TESTINST("dextu", 0x2000ffffffff2222, 0x2000ffffffffaaaa, 40, 8);
TESTINST("dextu", 0x2000ffffffffffff, 0x31415927ffffffff, 39, 4);
TESTINST("dextu", 0xfffffff31415927f, 0x2000ffffffffeeee, 60, 4);
TESTINST("dextu", 0xffffffffffff0008, 0x2000ffffffddddff, 63, 1);
TESTINST("dextu", 0xffff0000ffffffff, 0x2000ffffffffffff, 50, 4);
TESTINST("dextu", 0xff0000ffffffffff, 0, 36, 4);
TESTINST("dextu", 0xfffffffff0000fff, 0, 46, 4);
printf("--- DINS ---\n");
/* The values of pos and size must satisfy all of the following relations:
0 <= pos < 32
0 < size <= 32
0 < pos+size <= 32 */
TESTINST("dins", 0x0, 0x0, 0, 1);
TESTINST("dins", 0x0, 0xffffffffffffffff, 0, 1);
TESTINST("dins", 0x0, 0x98765432, 0, 1);
TESTINST("dins", 0x0, 0xffffffffff865421, 0, 1);
TESTINST("dins", 0xffffffffffffffff, 0x0, 0, 1);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffffffffff, 0, 1);
TESTINST("dins", 0xffffffffffffffff, 0x98765432, 0, 1);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffff865421, 0, 1);
TESTINST("dins", 0x98765432, 0x0, 0, 1);
TESTINST("dins", 0x98765432, 0xffffffffffffffff, 0, 1);
TESTINST("dins", 0x98765432, 0x98765432, 0, 1);
TESTINST("dins", 0x98765432, 0xffffffffff865421, 0, 1);
TESTINST("dins", 0xffffffffff865421, 0x0, 0, 1);
TESTINST("dins", 0xffffffffff865421, 0xffffffffffffffff, 0, 1);
TESTINST("dins", 0xffffffffff865421, 0x98765432, 0, 1);
TESTINST("dins", 0xffffffffff865421, 0xffffffffff865421, 0, 1);
TESTINST("dins", 0x0, 0x0, 0, 4);
TESTINST("dins", 0x0, 0xffffffffffffffff, 0, 4);
TESTINST("dins", 0x0, 0x98765432, 0, 4);
TESTINST("dins", 0x0, 0xffffffffff865421, 0, 4);
TESTINST("dins", 0xffffffffffffffff, 0x0, 0, 4);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffffffffff, 0, 4);
TESTINST("dins", 0xffffffffffffffff, 0x98765432, 0, 4);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffff865421, 0, 4);
TESTINST("dins", 0x98765432, 0x0, 0, 4);
TESTINST("dins", 0x98765432, 0xffffffffffffffff, 0, 4);
TESTINST("dins", 0x98765432, 0x98765432, 0, 4);
TESTINST("dins", 0x98765432, 0xffffffffff865421, 0, 4);
TESTINST("dins", 0xffffffffff865421, 0x0, 0, 4);
TESTINST("dins", 0xffffffffff865421, 0xffffffffffffffff, 0, 4);
TESTINST("dins", 0xffffffffff865421, 0x98765432, 0, 4);
TESTINST("dins", 0xffffffffff865421, 0xffffffffff865421, 0, 4);
TESTINST("dins", 0x0, 0x0, 0, 16);
TESTINST("dins", 0x0, 0xffffffffffffffff, 0, 16);
TESTINST("dins", 0x0, 0x98765432, 0, 16);
TESTINST("dins", 0x0, 0xffffffffff865421, 0, 16);
TESTINST("dins", 0xffffffffffffffff, 0x0, 0, 16);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffffffffff, 0, 16);
TESTINST("dins", 0xffffffffffffffff, 0x98765432, 0, 16);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffff865421, 0, 16);
TESTINST("dins", 0x98765432, 0x0, 0, 16);
TESTINST("dins", 0x98765432, 0xffffffffffffffff, 0, 16);
TESTINST("dins", 0x98765432, 0x98765432, 0, 16);
TESTINST("dins", 0x98765432, 0xffffffffff865421, 0, 16);
TESTINST("dins", 0xffffffffff865421, 0x0, 0, 16);
TESTINST("dins", 0xffffffffff865421, 0xffffffffffffffff, 0, 16);
TESTINST("dins", 0xffffffffff865421, 0x98765432, 0, 16);
TESTINST("dins", 0xffffffffff865421, 0xffffffffff865421, 0, 16);
TESTINST("dins", 0x0, 0x0, 0, 32);
TESTINST("dins", 0x0, 0xffffffffffffffff, 0, 32);
TESTINST("dins", 0x0, 0x98765432, 0, 32);
TESTINST("dins", 0x0, 0xffffffffff865421, 0, 32);
TESTINST("dins", 0xffffffffffffffff, 0x0, 0, 32);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffffffffff, 0, 32);
TESTINST("dins", 0xffffffffffffffff, 0x98765432, 0, 32);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffff865421, 0, 32);
TESTINST("dins", 0x98765432, 0x0, 0, 32);
TESTINST("dins", 0x98765432, 0xffffffffffffffff, 0, 32);
TESTINST("dins", 0x98765432, 0x98765432, 0, 32);
TESTINST("dins", 0x98765432, 0xffffffffff865421, 0, 32);
TESTINST("dins", 0xffffffffff865421, 0x0, 0, 32);
TESTINST("dins", 0xffffffffff865421, 0xffffffffffffffff, 0, 32);
TESTINST("dins", 0xffffffffff865421, 0x98765432, 0, 32);
TESTINST("dins", 0xffffffffff865421, 0xffffffffff865421, 0, 32);
TESTINST("dins", 0x0, 0x0, 4, 1);
TESTINST("dins", 0x0, 0xffffffffffffffff, 4, 1);
TESTINST("dins", 0x0, 0x98765432, 4, 1);
TESTINST("dins", 0x0, 0xffffffffff865421, 4, 1);
TESTINST("dins", 0xffffffffffffffff, 0x0, 4, 1);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffffffffff, 4, 1);
TESTINST("dins", 0xffffffffffffffff, 0x98765432, 4, 1);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffff865421, 4, 1);
TESTINST("dins", 0x98765432, 0x0, 4, 1);
TESTINST("dins", 0x98765432, 0xffffffffffffffff, 4, 1);
TESTINST("dins", 0x98765432, 0x98765432, 4, 1);
TESTINST("dins", 0x98765432, 0xffffffffff865421, 4, 1);
TESTINST("dins", 0xffffffffff865421, 0x0, 4, 1);
TESTINST("dins", 0xffffffffff865421, 0xffffffffffffffff, 4, 1);
TESTINST("dins", 0xffffffffff865421, 0x98765432, 4, 1);
TESTINST("dins", 0xffffffffff865421, 0xffffffffff865421, 4, 1);
TESTINST("dins", 0x0, 0x0, 4, 4);
TESTINST("dins", 0x0, 0xffffffffffffffff, 4, 4);
TESTINST("dins", 0x0, 0x98765432, 4, 4);
TESTINST("dins", 0x0, 0xffffffffff865421, 4, 4);
TESTINST("dins", 0xffffffffffffffff, 0x0, 4, 4);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffffffffff, 4, 4);
TESTINST("dins", 0xffffffffffffffff, 0x98765432, 4, 4);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffff865421, 4, 4);
TESTINST("dins", 0x98765432, 0x0, 4, 4);
TESTINST("dins", 0x98765432, 0xffffffffffffffff, 4, 4);
TESTINST("dins", 0x98765432, 0x98765432, 4, 4);
TESTINST("dins", 0x98765432, 0xffffffffff865421, 4, 4);
TESTINST("dins", 0xffffffffff865421, 0x0, 4, 4);
TESTINST("dins", 0xffffffffff865421, 0xffffffffffffffff, 4, 4);
TESTINST("dins", 0xffffffffff865421, 0x98765432, 4, 4);
TESTINST("dins", 0xffffffffff865421, 0xffffffffff865421, 4, 4);
TESTINST("dins", 0x0, 0x0, 4, 16);
TESTINST("dins", 0x0, 0xffffffffffffffff, 4, 16);
TESTINST("dins", 0x0, 0x98765432, 4, 16);
TESTINST("dins", 0x0, 0xffffffffff865421, 4, 16);
TESTINST("dins", 0xffffffffffffffff, 0x0, 4, 16);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffffffffff, 4, 16);
TESTINST("dins", 0xffffffffffffffff, 0x98765432, 4, 16);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffff865421, 4, 16);
TESTINST("dins", 0x98765432, 0x0, 4, 16);
TESTINST("dins", 0x98765432, 0xffffffffffffffff, 4, 16);
TESTINST("dins", 0x98765432, 0x98765432, 4, 16);
TESTINST("dins", 0x98765432, 0xffffffffff865421, 4, 16);
TESTINST("dins", 0xffffffffff865421, 0x0, 4, 16);
TESTINST("dins", 0xffffffffff865421, 0xffffffffffffffff, 4, 16);
TESTINST("dins", 0xffffffffff865421, 0x98765432, 4, 16);
TESTINST("dins", 0xffffffffff865421, 0xffffffffff865421, 4, 16);
TESTINST("dins", 0x0, 0x0, 4, 28);
TESTINST("dins", 0x0, 0xffffffffffffffff, 4, 28);
TESTINST("dins", 0x0, 0x98765432, 4, 28);
TESTINST("dins", 0x0, 0xffffffffff865421, 4, 28);
TESTINST("dins", 0xffffffffffffffff, 0x0, 4, 28);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffffffffff, 4, 28);
TESTINST("dins", 0xffffffffffffffff, 0x98765432, 4, 28);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffff865421, 4, 28);
TESTINST("dins", 0x98765432, 0x0, 4, 28);
TESTINST("dins", 0x98765432, 0xffffffffffffffff, 4, 28);
TESTINST("dins", 0x98765432, 0x98765432, 4, 28);
TESTINST("dins", 0x98765432, 0xffffffffff865421, 4, 28);
TESTINST("dins", 0xffffffffff865421, 0x0, 4, 28);
TESTINST("dins", 0xffffffffff865421, 0xffffffffffffffff, 4, 28);
TESTINST("dins", 0xffffffffff865421, 0x98765432, 4, 28);
TESTINST("dins", 0xffffffffff865421, 0xffffffffff865421, 4, 28);
TESTINST("dins", 0x0, 0x0, 16, 1);
TESTINST("dins", 0x0, 0xffffffffffffffff, 16, 1);
TESTINST("dins", 0x0, 0x98765432, 16, 1);
TESTINST("dins", 0x0, 0xffffffffff865421, 16, 1);
TESTINST("dins", 0xffffffffffffffff, 0x0, 16, 1);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffffffffff, 16, 1);
TESTINST("dins", 0xffffffffffffffff, 0x98765432, 16, 1);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffff865421, 16, 1);
TESTINST("dins", 0x98765432, 0x0, 16, 1);
TESTINST("dins", 0x98765432, 0xffffffffffffffff, 16, 1);
TESTINST("dins", 0x98765432, 0x98765432, 16, 1);
TESTINST("dins", 0x98765432, 0xffffffffff865421, 16, 1);
TESTINST("dins", 0xffffffffff865421, 0x0, 16, 1);
TESTINST("dins", 0xffffffffff865421, 0xffffffffffffffff, 16, 1);
TESTINST("dins", 0xffffffffff865421, 0x98765432, 16, 1);
TESTINST("dins", 0xffffffffff865421, 0xffffffffff865421, 16, 1);
TESTINST("dins", 0x0, 0x0, 16, 4);
TESTINST("dins", 0x0, 0xffffffffffffffff, 16, 4);
TESTINST("dins", 0x0, 0x98765432, 16, 4);
TESTINST("dins", 0x0, 0xffffffffff865421, 16, 4);
TESTINST("dins", 0xffffffffffffffff, 0x0, 16, 4);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffffffffff, 16, 4);
TESTINST("dins", 0xffffffffffffffff, 0x98765432, 16, 4);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffff865421, 16, 4);
TESTINST("dins", 0x98765432, 0x0, 16, 4);
TESTINST("dins", 0x98765432, 0xffffffffffffffff, 16, 4);
TESTINST("dins", 0x98765432, 0x98765432, 16, 4);
TESTINST("dins", 0x98765432, 0xffffffffff865421, 16, 4);
TESTINST("dins", 0xffffffffff865421, 0x0, 16, 4);
TESTINST("dins", 0xffffffffff865421, 0xffffffffffffffff, 16, 4);
TESTINST("dins", 0xffffffffff865421, 0x98765432, 16, 4);
TESTINST("dins", 0xffffffffff865421, 0xffffffffff865421, 16, 4);
TESTINST("dins", 0x0, 0x0, 16, 16);
TESTINST("dins", 0x0, 0xffffffffffffffff, 16, 16);
TESTINST("dins", 0x0, 0x98765432, 16, 16);
TESTINST("dins", 0x0, 0xffffffffff865421, 16, 16);
TESTINST("dins", 0xffffffffffffffff, 0x0, 16, 16);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffffffffff, 16, 16);
TESTINST("dins", 0xffffffffffffffff, 0x98765432, 16, 16);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffff865421, 16, 16);
TESTINST("dins", 0x98765432, 0x0, 16, 16);
TESTINST("dins", 0x98765432, 0xffffffffffffffff, 16, 16);
TESTINST("dins", 0x98765432, 0x98765432, 16, 16);
TESTINST("dins", 0x98765432, 0xffffffffff865421, 16, 16);
TESTINST("dins", 0xffffffffff865421, 0x0, 16, 16);
TESTINST("dins", 0xffffffffff865421, 0xffffffffffffffff, 16, 16);
TESTINST("dins", 0xffffffffff865421, 0x98765432, 16, 16);
TESTINST("dins", 0xffffffffff865421, 0xffffffffff865421, 16, 16);
TESTINST("dins", 0x0, 0x0, 31, 1);
TESTINST("dins", 0x0, 0xffffffffffffffff, 31, 1);
TESTINST("dins", 0x0, 0x98765432, 31, 1);
TESTINST("dins", 0x0, 0xffffffffff865421, 31, 1);
TESTINST("dins", 0xffffffffffffffff, 0x0, 31, 1);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffffffffff, 31, 1);
TESTINST("dins", 0xffffffffffffffff, 0x98765432, 31, 1);
TESTINST("dins", 0xffffffffffffffff, 0xffffffffff865421, 31, 1);
TESTINST("dins", 0x98765432, 0x0, 31, 1);
TESTINST("dins", 0x98765432, 0xffffffffffffffff, 31, 1);
TESTINST("dins", 0x98765432, 0x98765432, 31, 1);
TESTINST("dins", 0x98765432, 0xffffffffff865421, 31, 1);
TESTINST("dins", 0xffffffffff865421, 0x0, 31, 1);
TESTINST("dins", 0xffffffffff865421, 0xffffffffffffffff, 31, 1);
TESTINST("dins", 0xffffffffff865421, 0x98765432, 31, 1);
TESTINST("dins", 0xffffffffff865421, 0xffffffffff865421, 31, 1);
TESTINST("dins", 0x2002ffffffffffff, 0xfffffffff0000fff, 4, 4);
TESTINST("dins", 0xffff0000ffffffff, 0xff0000ffffffffff, 8, 4);
TESTINST("dins", 0x2000ffffffffffff, 0xffff0000ffffffff, 16, 4);
TESTINST("dins", 0x2000ffffffddddff, 0xffffffffffff0008, 24, 2);
TESTINST("dins", 0x2000ffffffffeeee, 0xfffffff31415927f, 24, 4);
TESTINST("dins", 0x31415927ffffffff, 0x2000ffffffffffff, 9, 2);
TESTINST("dins", 0x2000ffffffffaaaa, 0x2000ffffffff2222, 16, 4);
TESTINST("dins", 0x2000ffffffbbbbff, 0x7fffffffddddffff, 16, 4);
TESTINST("dins", 0xeeeeff33ff22ffff, 0x2000ffffffffffff, 7, 4);
TESTINST("dins", 0x2000ffffffffffff, 0x2000ffffffffbbbb, 5, 4);
TESTINST("dins", 0x2000ffffffffbbbb, 0x2000ffffffffffff, 3, 4);
TESTINST("dins", 0x2000ffffffffffff, 0xeeeeff33ff22ffff, 16, 4);
TESTINST("dins", 0x7fffffffddddffff, 0x2000ffffffbbbbff, 16, 2);
TESTINST("dins", 0x2000ffffffff2222, 0x2000ffffffffaaaa, 2, 8);
TESTINST("dins", 0x2000ffffffffffff, 0x2000ffffffffeeee, 0, 32);
TESTINST("dins", 0xfffffff31415927f, 0x2000ffffffddddff, 16, 16);
TESTINST("dins", 0xffffffffffff0008, 0x2000ffffffddddff, 8, 2);
TESTINST("dins", 0xffff0000ffffffff, 0x2000ffffffffffff, 16, 4);
TESTINST("dins", 0xff0000ffffffffff, 0xffff0000ffffffff, 8, 4);
TESTINST("dins", 0xfffffffff0000fff, 0, 0, 31);
printf("--- DINSM ---\n");
/* The values of pos and size must satisfy all of the following relations:
0 <= pos < 32
2 <= size <= 64
32 < pos+size <= 64 */
TESTINST("dinsm", 0x0, 0x0, 0, 33);
TESTINST("dinsm", 0x0, 0xffffffffffffffff, 0, 33);
TESTINST("dinsm", 0x0, 0x98765432, 0, 33);
TESTINST("dinsm", 0x0, 0xffffffffff865421, 0, 33);
TESTINST("dinsm", 0xffffffffffffffff, 0x0, 0, 33);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffffffffff, 0, 33);
TESTINST("dinsm", 0xffffffffffffffff, 0x98765432, 0, 33);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffff865421, 0, 33);
TESTINST("dinsm", 0x98765432, 0x0, 0, 33);
TESTINST("dinsm", 0x98765432, 0xffffffffffffffff, 0, 33);
TESTINST("dinsm", 0x98765432, 0x98765432, 0, 33);
TESTINST("dinsm", 0x98765432, 0xffffffffff865421, 0, 33);
TESTINST("dinsm", 0xffffffffff865421, 0x0, 0, 33);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffffffffff, 0, 33);
TESTINST("dinsm", 0xffffffffff865421, 0x98765432, 0, 33);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffff865421, 0, 33);
TESTINST("dinsm", 0x0, 0x0, 0, 37);
TESTINST("dinsm", 0x0, 0xffffffffffffffff, 0, 37);
TESTINST("dinsm", 0x0, 0x98765432, 0, 37);
TESTINST("dinsm", 0x0, 0xffffffffff865421, 0, 37);
TESTINST("dinsm", 0xffffffffffffffff, 0x0, 0, 37);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffffffffff, 0, 37);
TESTINST("dinsm", 0xffffffffffffffff, 0x98765432, 0, 37);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffff865421, 0, 37);
TESTINST("dinsm", 0x98765432, 0x0, 0, 37);
TESTINST("dinsm", 0x98765432, 0xffffffffffffffff, 0, 37);
TESTINST("dinsm", 0x98765432, 0x98765432, 0, 37);
TESTINST("dinsm", 0x98765432, 0xffffffffff865421, 0, 37);
TESTINST("dinsm", 0xffffffffff865421, 0x0, 0, 37);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffffffffff, 0, 37);
TESTINST("dinsm", 0xffffffffff865421, 0x98765432, 0, 37);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffff865421, 0, 37);
TESTINST("dinsm", 0x0, 0x0, 0, 48);
TESTINST("dinsm", 0x0, 0xffffffffffffffff, 0, 48);
TESTINST("dinsm", 0x0, 0x98765432, 0, 48);
TESTINST("dinsm", 0x0, 0xffffffffff865421, 0, 48);
TESTINST("dinsm", 0xffffffffffffffff, 0x0, 0, 48);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffffffffff, 0, 48);
TESTINST("dinsm", 0xffffffffffffffff, 0x98765432, 0, 48);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffff865421, 0, 48);
TESTINST("dinsm", 0x98765432, 0x0, 0, 48);
TESTINST("dinsm", 0x98765432, 0xffffffffffffffff, 0, 48);
TESTINST("dinsm", 0x98765432, 0x98765432, 0, 48);
TESTINST("dinsm", 0x98765432, 0xffffffffff865421, 0, 48);
TESTINST("dinsm", 0xffffffffff865421, 0x0, 0, 48);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffffffffff, 0, 48);
TESTINST("dinsm", 0xffffffffff865421, 0x98765432, 0, 48);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffff865421, 0, 48);
TESTINST("dinsm", 0x0, 0x0, 0, 64);
TESTINST("dinsm", 0x0, 0xffffffffffffffff, 0, 64);
TESTINST("dinsm", 0x0, 0x98765432, 0, 64);
TESTINST("dinsm", 0x0, 0xffffffffff865421, 0, 64);
TESTINST("dinsm", 0xffffffffffffffff, 0x0, 0, 64);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffffffffff, 0, 64);
TESTINST("dinsm", 0xffffffffffffffff, 0x98765432, 0, 64);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffff865421, 0, 64);
TESTINST("dinsm", 0x98765432, 0x0, 0, 64);
TESTINST("dinsm", 0x98765432, 0xffffffffffffffff, 0, 64);
TESTINST("dinsm", 0x98765432, 0x98765432, 0, 64);
TESTINST("dinsm", 0x98765432, 0xffffffffff865421, 0, 64);
TESTINST("dinsm", 0xffffffffff865421, 0x0, 0, 64);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffffffffff, 0, 64);
TESTINST("dinsm", 0xffffffffff865421, 0x98765432, 0, 64);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffff865421, 0, 64);
TESTINST("dinsm", 0x0, 0x0, 4, 29);
TESTINST("dinsm", 0x0, 0xffffffffffffffff, 4, 29);
TESTINST("dinsm", 0x0, 0x98765432, 4, 29);
TESTINST("dinsm", 0x0, 0xffffffffff865421, 4, 29);
TESTINST("dinsm", 0xffffffffffffffff, 0x0, 4, 29);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffffffffff, 4, 29);
TESTINST("dinsm", 0xffffffffffffffff, 0x98765432, 4, 29);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffff865421, 4, 29);
TESTINST("dinsm", 0x98765432, 0x0, 4, 29);
TESTINST("dinsm", 0x98765432, 0xffffffffffffffff, 4, 29);
TESTINST("dinsm", 0x98765432, 0x98765432, 4, 29);
TESTINST("dinsm", 0x98765432, 0xffffffffff865421, 4, 29);
TESTINST("dinsm", 0xffffffffff865421, 0x0, 4, 29);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffffffffff, 4, 29);
TESTINST("dinsm", 0xffffffffff865421, 0x98765432, 4, 29);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffff865421, 4, 29);
TESTINST("dinsm", 0x0, 0x0, 4, 32);
TESTINST("dinsm", 0x0, 0xffffffffffffffff, 4, 32);
TESTINST("dinsm", 0x0, 0x98765432, 4, 32);
TESTINST("dinsm", 0x0, 0xffffffffff865421, 4, 32);
TESTINST("dinsm", 0xffffffffffffffff, 0x0, 4, 32);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffffffffff, 4, 32);
TESTINST("dinsm", 0xffffffffffffffff, 0x98765432, 4, 32);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffff865421, 4, 32);
TESTINST("dinsm", 0x98765432, 0x0, 4, 32);
TESTINST("dinsm", 0x98765432, 0xffffffffffffffff, 4, 32);
TESTINST("dinsm", 0x98765432, 0x98765432, 4, 32);
TESTINST("dinsm", 0x98765432, 0xffffffffff865421, 4, 32);
TESTINST("dinsm", 0xffffffffff865421, 0x0, 4, 32);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffffffffff, 4, 32);
TESTINST("dinsm", 0xffffffffff865421, 0x98765432, 4, 32);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffff865421, 4, 32);
TESTINST("dinsm", 0x0, 0x0, 4, 37);
TESTINST("dinsm", 0x0, 0xffffffffffffffff, 4, 37);
TESTINST("dinsm", 0x0, 0x98765432, 4, 37);
TESTINST("dinsm", 0x0, 0xffffffffff865421, 4, 37);
TESTINST("dinsm", 0xffffffffffffffff, 0x0, 4, 37);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffffffffff, 4, 37);
TESTINST("dinsm", 0xffffffffffffffff, 0x98765432, 4, 37);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffff865421, 4, 37);
TESTINST("dinsm", 0x98765432, 0x0, 4, 37);
TESTINST("dinsm", 0x98765432, 0xffffffffffffffff, 4, 37);
TESTINST("dinsm", 0x98765432, 0x98765432, 4, 37);
TESTINST("dinsm", 0x98765432, 0xffffffffff865421, 4, 37);
TESTINST("dinsm", 0xffffffffff865421, 0x0, 4, 37);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffffffffff, 4, 37);
TESTINST("dinsm", 0xffffffffff865421, 0x98765432, 4, 37);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffff865421, 4, 37);
TESTINST("dinsm", 0x0, 0x0, 4, 48);
TESTINST("dinsm", 0x0, 0xffffffffffffffff, 4, 48);
TESTINST("dinsm", 0x0, 0x98765432, 4, 48);
TESTINST("dinsm", 0x0, 0xffffffffff865421, 4, 48);
TESTINST("dinsm", 0xffffffffffffffff, 0x0, 4, 48);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffffffffff, 4, 48);
TESTINST("dinsm", 0xffffffffffffffff, 0x98765432, 4, 48);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffff865421, 4, 48);
TESTINST("dinsm", 0x98765432, 0x0, 4, 48);
TESTINST("dinsm", 0x98765432, 0xffffffffffffffff, 4, 48);
TESTINST("dinsm", 0x98765432, 0x98765432, 4, 48);
TESTINST("dinsm", 0x98765432, 0xffffffffff865421, 4, 48);
TESTINST("dinsm", 0xffffffffff865421, 0x0, 4, 48);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffffffffff, 4, 48);
TESTINST("dinsm", 0xffffffffff865421, 0x98765432, 4, 48);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffff865421, 4, 48);
TESTINST("dinsm", 0x0, 0x0, 4, 60);
TESTINST("dinsm", 0x0, 0xffffffffffffffff, 4, 60);
TESTINST("dinsm", 0x0, 0x98765432, 4, 60);
TESTINST("dinsm", 0x0, 0xffffffffff865421, 4, 60);
TESTINST("dinsm", 0xffffffffffffffff, 0x0, 4, 60);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffffffffff, 4, 60);
TESTINST("dinsm", 0xffffffffffffffff, 0x98765432, 4, 60);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffff865421, 4, 60);
TESTINST("dinsm", 0x98765432, 0x0, 4, 60);
TESTINST("dinsm", 0x98765432, 0xffffffffffffffff, 4, 60);
TESTINST("dinsm", 0x98765432, 0x98765432, 4, 60);
TESTINST("dinsm", 0x98765432, 0xffffffffff865421, 4, 60);
TESTINST("dinsm", 0xffffffffff865421, 0x0, 4, 60);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffffffffff, 4, 60);
TESTINST("dinsm", 0xffffffffff865421, 0x98765432, 4, 60);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffff865421, 4, 60);
TESTINST("dinsm", 0x0, 0x0, 16, 17);
TESTINST("dinsm", 0x0, 0xffffffffffffffff, 16, 17);
TESTINST("dinsm", 0x0, 0x98765432, 16, 17);
TESTINST("dinsm", 0x0, 0xffffffffff865421, 16, 17);
TESTINST("dinsm", 0xffffffffffffffff, 0x0, 16, 17);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffffffffff, 16, 17);
TESTINST("dinsm", 0xffffffffffffffff, 0x98765432, 16, 17);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffff865421, 16, 17);
TESTINST("dinsm", 0x98765432, 0x0, 16, 17);
TESTINST("dinsm", 0x98765432, 0xffffffffffffffff, 16, 17);
TESTINST("dinsm", 0x98765432, 0x98765432, 16, 17);
TESTINST("dinsm", 0x98765432, 0xffffffffff865421, 16, 17);
TESTINST("dinsm", 0xffffffffff865421, 0x0, 16, 17);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffffffffff, 16, 17);
TESTINST("dinsm", 0xffffffffff865421, 0x98765432, 16, 17);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffff865421, 16, 17);
TESTINST("dinsm", 0x0, 0x0, 16, 32);
TESTINST("dinsm", 0x0, 0xffffffffffffffff, 16, 32);
TESTINST("dinsm", 0x0, 0x98765432, 16, 32);
TESTINST("dinsm", 0x0, 0xffffffffff865421, 16, 32);
TESTINST("dinsm", 0xffffffffffffffff, 0x0, 16, 32);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffffffffff, 16, 32);
TESTINST("dinsm", 0xffffffffffffffff, 0x98765432, 16, 32);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffff865421, 16, 32);
TESTINST("dinsm", 0x98765432, 0x0, 16, 32);
TESTINST("dinsm", 0x98765432, 0xffffffffffffffff, 16, 32);
TESTINST("dinsm", 0x98765432, 0x98765432, 16, 32);
TESTINST("dinsm", 0x98765432, 0xffffffffff865421, 16, 32);
TESTINST("dinsm", 0xffffffffff865421, 0x0, 16, 32);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffffffffff, 16, 32);
TESTINST("dinsm", 0xffffffffff865421, 0x98765432, 16, 32);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffff865421, 16, 32);
TESTINST("dinsm", 0x0, 0x0, 16, 37);
TESTINST("dinsm", 0x0, 0xffffffffffffffff, 16, 37);
TESTINST("dinsm", 0x0, 0x98765432, 16, 37);
TESTINST("dinsm", 0x0, 0xffffffffff865421, 16, 37);
TESTINST("dinsm", 0xffffffffffffffff, 0x0, 16, 37);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffffffffff, 16, 37);
TESTINST("dinsm", 0xffffffffffffffff, 0x98765432, 16, 37);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffff865421, 16, 37);
TESTINST("dinsm", 0x98765432, 0x0, 16, 37);
TESTINST("dinsm", 0x98765432, 0xffffffffffffffff, 16, 37);
TESTINST("dinsm", 0x98765432, 0x98765432, 16, 37);
TESTINST("dinsm", 0x98765432, 0xffffffffff865421, 16, 37);
TESTINST("dinsm", 0xffffffffff865421, 0x0, 16, 37);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffffffffff, 16, 37);
TESTINST("dinsm", 0xffffffffff865421, 0x98765432, 16, 37);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffff865421, 16, 37);
TESTINST("dinsm", 0x0, 0x0, 16, 48);
TESTINST("dinsm", 0x0, 0xffffffffffffffff, 16, 48);
TESTINST("dinsm", 0x0, 0x98765432, 16, 48);
TESTINST("dinsm", 0x0, 0xffffffffff865421, 16, 48);
TESTINST("dinsm", 0xffffffffffffffff, 0x0, 16, 48);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffffffffff, 16, 48);
TESTINST("dinsm", 0xffffffffffffffff, 0x98765432, 16, 48);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffff865421, 16, 48);
TESTINST("dinsm", 0x98765432, 0x0, 16, 48);
TESTINST("dinsm", 0x98765432, 0xffffffffffffffff, 16, 48);
TESTINST("dinsm", 0x98765432, 0x98765432, 16, 48);
TESTINST("dinsm", 0x98765432, 0xffffffffff865421, 16, 48);
TESTINST("dinsm", 0xffffffffff865421, 0x0, 16, 48);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffffffffff, 16, 48);
TESTINST("dinsm", 0xffffffffff865421, 0x98765432, 16, 48);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffff865421, 16, 48);
TESTINST("dinsm", 0x0, 0x0, 31, 2);
TESTINST("dinsm", 0x0, 0xffffffffffffffff, 31, 2);
TESTINST("dinsm", 0x0, 0x98765432, 31, 2);
TESTINST("dinsm", 0x0, 0xffffffffff865421, 31, 2);
TESTINST("dinsm", 0xffffffffffffffff, 0x0, 31, 2);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffffffffff, 31, 2);
TESTINST("dinsm", 0xffffffffffffffff, 0x98765432, 31, 2);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffff865421, 31, 2);
TESTINST("dinsm", 0x98765432, 0x0, 31, 2);
TESTINST("dinsm", 0x98765432, 0xffffffffffffffff, 31, 2);
TESTINST("dinsm", 0x98765432, 0x98765432, 31, 2);
TESTINST("dinsm", 0x98765432, 0xffffffffff865421, 31, 2);
TESTINST("dinsm", 0xffffffffff865421, 0x0, 31, 2);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffffffffff, 31, 2);
TESTINST("dinsm", 0xffffffffff865421, 0x98765432, 31, 2);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffff865421, 31, 2);
TESTINST("dinsm", 0x0, 0x0, 31, 16);
TESTINST("dinsm", 0x0, 0xffffffffffffffff, 31, 16);
TESTINST("dinsm", 0x0, 0x98765432, 31, 16);
TESTINST("dinsm", 0x0, 0xffffffffff865421, 31, 16);
TESTINST("dinsm", 0xffffffffffffffff, 0x0, 31, 16);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffffffffff, 31, 16);
TESTINST("dinsm", 0xffffffffffffffff, 0x98765432, 31, 16);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffff865421, 31, 16);
TESTINST("dinsm", 0x98765432, 0x0, 31, 16);
TESTINST("dinsm", 0x98765432, 0xffffffffffffffff, 31, 16);
TESTINST("dinsm", 0x98765432, 0x98765432, 31, 16);
TESTINST("dinsm", 0x98765432, 0xffffffffff865421, 31, 16);
TESTINST("dinsm", 0xffffffffff865421, 0x0, 31, 16);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffffffffff, 31, 16);
TESTINST("dinsm", 0xffffffffff865421, 0x98765432, 31, 16);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffff865421, 31, 16);
TESTINST("dinsm", 0x0, 0x0, 31, 32);
TESTINST("dinsm", 0x0, 0xffffffffffffffff, 31, 32);
TESTINST("dinsm", 0x0, 0x98765432, 31, 32);
TESTINST("dinsm", 0x0, 0xffffffffff865421, 31, 32);
TESTINST("dinsm", 0xffffffffffffffff, 0x0, 31, 32);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffffffffff, 31, 32);
TESTINST("dinsm", 0xffffffffffffffff, 0x98765432, 31, 32);
TESTINST("dinsm", 0xffffffffffffffff, 0xffffffffff865421, 31, 32);
TESTINST("dinsm", 0x98765432, 0x0, 31, 32);
TESTINST("dinsm", 0x98765432, 0xffffffffffffffff, 31, 32);
TESTINST("dinsm", 0x98765432, 0x98765432, 31, 32);
TESTINST("dinsm", 0x98765432, 0xffffffffff865421, 31, 32);
TESTINST("dinsm", 0xffffffffff865421, 0x0, 31, 32);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffffffffff, 31, 32);
TESTINST("dinsm", 0xffffffffff865421, 0x98765432, 31, 32);
TESTINST("dinsm", 0xffffffffff865421, 0xffffffffff865421, 31, 32);
TESTINST("dinsm", 0x2002ffffffffffff, 0xfffffffff0000fff, 4, 35);
TESTINST("dinsm", 0xffff0000ffffffff, 0xff0000ffffffffff, 8, 33);
TESTINST("dinsm", 0x2000ffffffffffff, 0xffff0000ffffffff, 16, 34);
TESTINST("dinsm", 0x2000ffffffddddff, 0xffffffffffff0008, 4, 46);
TESTINST("dinsm", 0x2000ffffffffeeee, 0xfffffff31415927f, 3, 56);
TESTINST("dinsm", 0x31415927ffffffff, 0x2000ffffffffffff, 0, 64);
TESTINST("dinsm", 0x2000ffffffffaaaa, 0x2000ffffffff2222, 16, 40);
TESTINST("dinsm", 0x2000ffffffbbbbff, 0x7fffffffddddffff, 16, 42);
TESTINST("dinsm", 0xeeeeff33ff22ffff, 0x2000ffffffffffff, 7, 43);
TESTINST("dinsm", 0x2000ffffffffffff, 0x2000ffffffffbbbb, 5, 48);
TESTINST("dinsm", 0x2000ffffffffbbbb, 0x2000ffffffffffff, 3, 52);
TESTINST("dinsm", 0x2000ffffffffffff, 0xeeeeff33ff22ffff, 1, 54);
TESTINST("dinsm", 0x7fffffffddddffff, 0x2000ffffffbbbbff, 2, 54);
TESTINST("dinsm", 0x2000ffffffff2222, 0x2000ffffffffaaaa, 2, 48);
TESTINST("dinsm", 0x2000ffffffffffff, 0x31415927ffffffff, 5, 53);
TESTINST("dinsm", 0xfffffff31415927f, 0x2000ffffffffeeee, 2, 60);
TESTINST("dinsm", 0xffffffffffff0008, 0x2000ffffffddddff, 3, 61);
TESTINST("dinsm", 0xffff0000ffffffff, 0x2000ffffffffffff, 1, 62);
TESTINST("dinsm", 0xff0000ffffffffff, 0, 8, 38);
TESTINST("dinsm", 0xfffffffff0000fff, 0, 16, 39);
printf("--- DINSU ---\n");
/* The values of pos and size must satisfy all of the following relations:
32 <= pos < 64
1 <= size <= 32
32 < pos+size <= 64 */
TESTINST("dinsu", 0x0, 0x0, 32, 1);
TESTINST("dinsu", 0x0, 0xffffffffffffffff, 32, 1);
TESTINST("dinsu", 0x0, 0x98765432, 32, 1);
TESTINST("dinsu", 0x0, 0xffffffffff865421, 32, 1);
TESTINST("dinsu", 0xffffffffffffffff, 0x0, 32, 1);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffffffffff, 32, 1);
TESTINST("dinsu", 0xffffffffffffffff, 0x98765432, 32, 1);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffff865421, 32, 1);
TESTINST("dinsu", 0x98765432, 0x0, 32, 1);
TESTINST("dinsu", 0x98765432, 0xffffffffffffffff, 32, 1);
TESTINST("dinsu", 0x98765432, 0x98765432, 32, 1);
TESTINST("dinsu", 0x98765432, 0xffffffffff865421, 32, 1);
TESTINST("dinsu", 0xffffffffff865421, 0x0, 32, 1);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffffffffff, 32, 1);
TESTINST("dinsu", 0xffffffffff865421, 0x98765432, 32, 1);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffff865421, 32, 1);
TESTINST("dinsu", 0x0, 0x0, 32, 4);
TESTINST("dinsu", 0x0, 0xffffffffffffffff, 32, 4);
TESTINST("dinsu", 0x0, 0x98765432, 32, 4);
TESTINST("dinsu", 0x0, 0xffffffffff865421, 32, 4);
TESTINST("dinsu", 0xffffffffffffffff, 0x0, 32, 4);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffffffffff, 32, 4);
TESTINST("dinsu", 0xffffffffffffffff, 0x98765432, 32, 4);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffff865421, 32, 4);
TESTINST("dinsu", 0x98765432, 0x0, 32, 4);
TESTINST("dinsu", 0x98765432, 0xffffffffffffffff, 32, 4);
TESTINST("dinsu", 0x98765432, 0x98765432, 32, 4);
TESTINST("dinsu", 0x98765432, 0xffffffffff865421, 32, 4);
TESTINST("dinsu", 0xffffffffff865421, 0x0, 32, 4);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffffffffff, 32, 4);
TESTINST("dinsu", 0xffffffffff865421, 0x98765432, 32, 4);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffff865421, 32, 4);
TESTINST("dinsu", 0x0, 0x0, 32, 16);
TESTINST("dinsu", 0x0, 0xffffffffffffffff, 32, 16);
TESTINST("dinsu", 0x0, 0x98765432, 32, 16);
TESTINST("dinsu", 0x0, 0xffffffffff865421, 32, 16);
TESTINST("dinsu", 0xffffffffffffffff, 0x0, 32, 16);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffffffffff, 32, 16);
TESTINST("dinsu", 0xffffffffffffffff, 0x98765432, 32, 16);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffff865421, 32, 16);
TESTINST("dinsu", 0x98765432, 0x0, 32, 16);
TESTINST("dinsu", 0x98765432, 0xffffffffffffffff, 32, 16);
TESTINST("dinsu", 0x98765432, 0x98765432, 32, 16);
TESTINST("dinsu", 0x98765432, 0xffffffffff865421, 32, 16);
TESTINST("dinsu", 0xffffffffff865421, 0x0, 32, 16);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffffffffff, 32, 16);
TESTINST("dinsu", 0xffffffffff865421, 0x98765432, 32, 16);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffff865421, 32, 16);
TESTINST("dinsu", 0x0, 0x0, 32, 32);
TESTINST("dinsu", 0x0, 0xffffffffffffffff, 32, 32);
TESTINST("dinsu", 0x0, 0x98765432, 32, 32);
TESTINST("dinsu", 0x0, 0xffffffffff865421, 32, 32);
TESTINST("dinsu", 0xffffffffffffffff, 0x0, 32, 32);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffffffffff, 32, 32);
TESTINST("dinsu", 0xffffffffffffffff, 0x98765432, 32, 32);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffff865421, 32, 32);
TESTINST("dinsu", 0x98765432, 0x0, 32, 32);
TESTINST("dinsu", 0x98765432, 0xffffffffffffffff, 32, 32);
TESTINST("dinsu", 0x98765432, 0x98765432, 32, 32);
TESTINST("dinsu", 0x98765432, 0xffffffffff865421, 32, 32);
TESTINST("dinsu", 0xffffffffff865421, 0x0, 32, 32);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffffffffff, 32, 32);
TESTINST("dinsu", 0xffffffffff865421, 0x98765432, 32, 32);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffff865421, 32, 32);
TESTINST("dinsu", 0x0, 0x0, 36, 1);
TESTINST("dinsu", 0x0, 0xffffffffffffffff, 36, 1);
TESTINST("dinsu", 0x0, 0x98765432, 36, 1);
TESTINST("dinsu", 0x0, 0xffffffffff865421, 36, 1);
TESTINST("dinsu", 0xffffffffffffffff, 0x0, 36, 1);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffffffffff, 36, 1);
TESTINST("dinsu", 0xffffffffffffffff, 0x98765432, 36, 1);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffff865421, 36, 1);
TESTINST("dinsu", 0x98765432, 0x0, 36, 1);
TESTINST("dinsu", 0x98765432, 0xffffffffffffffff, 36, 1);
TESTINST("dinsu", 0x98765432, 0x98765432, 36, 1);
TESTINST("dinsu", 0x98765432, 0xffffffffff865421, 36, 1);
TESTINST("dinsu", 0xffffffffff865421, 0x0, 36, 1);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffffffffff, 36, 1);
TESTINST("dinsu", 0xffffffffff865421, 0x98765432, 36, 1);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffff865421, 36, 1);
TESTINST("dinsu", 0x0, 0x0, 36, 4);
TESTINST("dinsu", 0x0, 0xffffffffffffffff, 36, 4);
TESTINST("dinsu", 0x0, 0x98765432, 36, 4);
TESTINST("dinsu", 0x0, 0xffffffffff865421, 36, 4);
TESTINST("dinsu", 0xffffffffffffffff, 0x0, 36, 4);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffffffffff, 36, 4);
TESTINST("dinsu", 0xffffffffffffffff, 0x98765432, 36, 4);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffff865421, 36, 4);
TESTINST("dinsu", 0x98765432, 0x0, 36, 4);
TESTINST("dinsu", 0x98765432, 0xffffffffffffffff, 36, 4);
TESTINST("dinsu", 0x98765432, 0x98765432, 36, 4);
TESTINST("dinsu", 0x98765432, 0xffffffffff865421, 36, 4);
TESTINST("dinsu", 0xffffffffff865421, 0x0, 36, 4);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffffffffff, 36, 4);
TESTINST("dinsu", 0xffffffffff865421, 0x98765432, 36, 4);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffff865421, 36, 4);
TESTINST("dinsu", 0x0, 0x0, 36, 16);
TESTINST("dinsu", 0x0, 0xffffffffffffffff, 36, 16);
TESTINST("dinsu", 0x0, 0x98765432, 36, 16);
TESTINST("dinsu", 0x0, 0xffffffffff865421, 36, 16);
TESTINST("dinsu", 0xffffffffffffffff, 0x0, 36, 16);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffffffffff, 36, 16);
TESTINST("dinsu", 0xffffffffffffffff, 0x98765432, 36, 16);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffff865421, 36, 16);
TESTINST("dinsu", 0x98765432, 0x0, 36, 16);
TESTINST("dinsu", 0x98765432, 0xffffffffffffffff, 36, 16);
TESTINST("dinsu", 0x98765432, 0x98765432, 36, 16);
TESTINST("dinsu", 0x98765432, 0xffffffffff865421, 36, 16);
TESTINST("dinsu", 0xffffffffff865421, 0x0, 36, 16);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffffffffff, 36, 16);
TESTINST("dinsu", 0xffffffffff865421, 0x98765432, 36, 16);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffff865421, 36, 16);
TESTINST("dinsu", 0x0, 0x0, 36, 28);
TESTINST("dinsu", 0x0, 0xffffffffffffffff, 36, 28);
TESTINST("dinsu", 0x0, 0x98765432, 36, 28);
TESTINST("dinsu", 0x0, 0xffffffffff865421, 36, 28);
TESTINST("dinsu", 0xffffffffffffffff, 0x0, 36, 28);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffffffffff, 36, 28);
TESTINST("dinsu", 0xffffffffffffffff, 0x98765432, 36, 28);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffff865421, 36, 28);
TESTINST("dinsu", 0x98765432, 0x0, 36, 28);
TESTINST("dinsu", 0x98765432, 0xffffffffffffffff, 36, 28);
TESTINST("dinsu", 0x98765432, 0x98765432, 36, 28);
TESTINST("dinsu", 0x98765432, 0xffffffffff865421, 36, 28);
TESTINST("dinsu", 0xffffffffff865421, 0x0, 36, 28);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffffffffff, 36, 28);
TESTINST("dinsu", 0xffffffffff865421, 0x98765432, 36, 28);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffff865421, 36, 28);
TESTINST("dinsu", 0x0, 0x0, 48, 1);
TESTINST("dinsu", 0x0, 0xffffffffffffffff, 48, 1);
TESTINST("dinsu", 0x0, 0x98765432, 48, 1);
TESTINST("dinsu", 0x0, 0xffffffffff865421, 48, 1);
TESTINST("dinsu", 0xffffffffffffffff, 0x0, 48, 1);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffffffffff, 48, 1);
TESTINST("dinsu", 0xffffffffffffffff, 0x98765432, 48, 1);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffff865421, 48, 1);
TESTINST("dinsu", 0x98765432, 0x0, 48, 1);
TESTINST("dinsu", 0x98765432, 0xffffffffffffffff, 48, 1);
TESTINST("dinsu", 0x98765432, 0x98765432, 48, 1);
TESTINST("dinsu", 0x98765432, 0xffffffffff865421, 48, 1);
TESTINST("dinsu", 0xffffffffff865421, 0x0, 48, 1);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffffffffff, 48, 1);
TESTINST("dinsu", 0xffffffffff865421, 0x98765432, 48, 1);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffff865421, 48, 1);
TESTINST("dinsu", 0x0, 0x0, 48, 4);
TESTINST("dinsu", 0x0, 0xffffffffffffffff, 48, 4);
TESTINST("dinsu", 0x0, 0x98765432, 48, 4);
TESTINST("dinsu", 0x0, 0xffffffffff865421, 48, 4);
TESTINST("dinsu", 0xffffffffffffffff, 0x0, 48, 4);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffffffffff, 48, 4);
TESTINST("dinsu", 0xffffffffffffffff, 0x98765432, 48, 4);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffff865421, 48, 4);
TESTINST("dinsu", 0x98765432, 0x0, 48, 4);
TESTINST("dinsu", 0x98765432, 0xffffffffffffffff, 48, 4);
TESTINST("dinsu", 0x98765432, 0x98765432, 48, 4);
TESTINST("dinsu", 0x98765432, 0xffffffffff865421, 48, 4);
TESTINST("dinsu", 0xffffffffff865421, 0x0, 48, 4);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffffffffff, 48, 4);
TESTINST("dinsu", 0xffffffffff865421, 0x98765432, 48, 4);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffff865421, 48, 4);
TESTINST("dinsu", 0x0, 0x0, 48, 16);
TESTINST("dinsu", 0x0, 0xffffffffffffffff, 48, 16);
TESTINST("dinsu", 0x0, 0x98765432, 48, 16);
TESTINST("dinsu", 0x0, 0xffffffffff865421, 48, 16);
TESTINST("dinsu", 0xffffffffffffffff, 0x0, 48, 16);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffffffffff, 48, 16);
TESTINST("dinsu", 0xffffffffffffffff, 0x98765432, 48, 16);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffff865421, 48, 16);
TESTINST("dinsu", 0x98765432, 0x0, 48, 16);
TESTINST("dinsu", 0x98765432, 0xffffffffffffffff, 48, 16);
TESTINST("dinsu", 0x98765432, 0x98765432, 48, 16);
TESTINST("dinsu", 0x98765432, 0xffffffffff865421, 48, 16);
TESTINST("dinsu", 0xffffffffff865421, 0x0, 48, 16);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffffffffff, 48, 16);
TESTINST("dinsu", 0xffffffffff865421, 0x98765432, 48, 16);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffff865421, 48, 16);
TESTINST("dinsu", 0x0, 0x0, 63, 1);
TESTINST("dinsu", 0x0, 0xffffffffffffffff, 63, 1);
TESTINST("dinsu", 0x0, 0x98765432, 63, 1);
TESTINST("dinsu", 0x0, 0xffffffffff865421, 63, 1);
TESTINST("dinsu", 0xffffffffffffffff, 0x0, 63, 1);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffffffffff, 63, 1);
TESTINST("dinsu", 0xffffffffffffffff, 0x98765432, 63, 1);
TESTINST("dinsu", 0xffffffffffffffff, 0xffffffffff865421, 63, 1);
TESTINST("dinsu", 0x98765432, 0x0, 63, 1);
TESTINST("dinsu", 0x98765432, 0xffffffffffffffff, 63, 1);
TESTINST("dinsu", 0x98765432, 0x98765432, 63, 1);
TESTINST("dinsu", 0x98765432, 0xffffffffff865421, 63, 1);
TESTINST("dinsu", 0xffffffffff865421, 0x0, 63, 1);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffffffffff, 63, 1);
TESTINST("dinsu", 0xffffffffff865421, 0x98765432, 63, 1);
TESTINST("dinsu", 0xffffffffff865421, 0xffffffffff865421, 63, 1);
TESTINST("dinsu", 0x2002ffffffffffff, 0xfffffffff0000fff, 33, 4);
TESTINST("dinsu", 0xffff0000ffffffff, 0xff0000ffffffffff, 60, 4);
TESTINST("dinsu", 0x2000ffffffffffff, 0xffff0000ffffffff, 54, 4);
TESTINST("dinsu", 0x2000ffffffddddff, 0xffffffffffff0008, 56, 2);
TESTINST("dinsu", 0x2000ffffffffeeee, 0xfffffff31415927f, 40, 4);
TESTINST("dinsu", 0x31415927ffffffff, 0x2000ffffffffffff, 51, 2);
TESTINST("dinsu", 0x2000ffffffffaaaa, 0x2000ffffffff2222, 48, 4);
TESTINST("dinsu", 0x2000ffffffbbbbff, 0x7fffffffddddffff, 38, 4);
TESTINST("dinsu", 0xeeeeff33ff22ffff, 0x2000ffffffffffff, 35, 4);
TESTINST("dinsu", 0x2000ffffffffffff, 0x2000ffffffffbbbb, 36, 4);
TESTINST("dinsu", 0x2000ffffffffbbbb, 0x2000ffffffffffff, 45, 1);
TESTINST("dinsu", 0x2000ffffffffffff, 0xeeeeff33ff22ffff, 46, 4);
TESTINST("dinsu", 0x7fffffffddddffff, 0x2000ffffffbbbbff, 52, 4);
TESTINST("dinsu", 0x2000ffffffff2222, 0x2000ffffffffaaaa, 40, 8);
TESTINST("dinsu", 0x2000ffffffffffff, 0x31415927ffffffff, 39, 4);
TESTINST("dinsu", 0xfffffff31415927f, 0x31415927ffffffff, 60, 4);
TESTINST("dinsu", 0xffffffffffff0008, 0x2000ffffffddddff, 63, 1);
TESTINST("dinsu", 0xffff0000ffffffff, 0x2000ffffffffffff, 50, 4);
TESTINST("dinsu", 0xff0000ffffffffff, 0, 36, 4);
TESTINST("dinsu", 0xfffffffff0000fff, 0, 46, 4);
#else
printf("This test is testing mips64r2 instructions.\n");
#endif
return 0;
}
|
the_stack_data/36074749.c | #include <stdio.h>
#include <stdint.h>
#include <stdbool.h>
#define MAX 1000000
int8_t sieve[MAX];
void init_sieve();
bool is_prime(int64_t);
int64_t n_primes_corners(int64_t len);
int main() {
init_sieve();
int32_t i = 3, total_primes = 0;
for (; ; i += 2) {
total_primes += n_primes_corners(i);
float ratio = total_primes / (float)(2 * i - 1);
if (ratio < 0.10f) { break; }
}
printf("%d\n", i);
return 0;
}
void init_sieve() {
for (int32_t i = 0; i < MAX; ++i) {
sieve[i] = 1;
}
sieve[0] = sieve[1] = 0;
for (int32_t i = 2; i < MAX; ++i) {
if (sieve[i]) {
for (int32_t j = 2 * i; j < MAX; j += i) {
sieve[j] = 0;
}
}
}
}
bool is_prime(int64_t n) {
if (n < MAX) { return sieve[n]; }
for (int64_t p = 2; p * p <= n; ++p) {
if (sieve[p] && n % p == 0) {
return false;
}
}
return true;
}
int64_t n_primes_corners(int64_t len) {
int64_t i = 0, n = len * len;
n -= (len - 1);
if (is_prime(n)) {
++i;
}
n -= (len - 1);
if (is_prime(n)) {
++i;
}
n -= (len - 1);
if (is_prime(n)) {
++i;
}
return i;
}
|
the_stack_data/28263109.c | /*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License (the "License").
* You may not use this file except in compliance with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* or http://www.opensolaris.org/os/licensing.
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 2009 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
/* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */
/* All Rights Reserved */
#include <limits.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#include <ctype.h>
/* 0 = both upper and lower case */
/* 1 = initial lower case only (build variables) */
/* 2 = initial upper case only (install variables) */
#define mode(flag, pt) (!flag || ((flag == 1) && islower(pt[1])) || \
((flag == 2) && isupper(pt[1])))
/*
* For next and last functions below, values indicate whether resolution
* was possible.
*
* 0 = all OK - the variable resolved within the established parameters
* or it wasn't time for the variable to bind.
* 1 = parameter did not resolve because there was no value in the
* environment or because it was a build variable at install
* time.
*/
/*
* This gets a raw path which may contain shell variables and returns in path
* a pathname with all appropriate parameters resolved. If it comes in
* relative, it goes out relative.
*/
int
mappath(int flag, char *path)
{
char buffer[PATH_MAX];
char varname[64];
char *npt, *pt, *pt2, *copy;
char *token;
int retvalue = 0;
copy = buffer;
/*
* For each "/" separated token. If the token contains an environment
* variable, then evaluate the variable and insert it into path.
*/
for (pt = path; *pt; /* void */) {
/*
* If this is a token and it's an environment variable
* properly situated in the path...
*/
if ((*pt == '$') && isalpha(pt[1]) &&
((pt == path) || (pt[-1] == '/'))) {
/* ... and it's the right time to evaluate it... */
if (mode(flag, pt)) {
/* replace the parameter with its value. */
pt2 = varname;
for (npt = pt+1; *npt && (*npt != '/');
/* void */)
*pt2++ = *npt++;
*pt2 = '\0';
/*
* At this point EVERY token should evaluate
* to a value. If it doesn't, there's an
* error.
*/
if ((token = getenv(varname)) != NULL &&
*token != '\0') {
/* copy in parameter value */
while (*token)
*copy++ = *token++;
pt = npt;
} else {
retvalue = 1;
*copy++ = *pt++;
}
/*
* If evaluate time is wrong, determine of this is an
* error.
*/
} else {
if (flag == 2) { /* install-time. */
/*
* ALL variables MUST evaluate at
* install time.
*/
*copy++ = *pt++;
retvalue = 1;
} else if (flag == 1 && /* build-time */
islower(pt[1])) {
/*
* All build-time variables must
* evaluate at build time.
*/
retvalue = 1;
*copy++ = *pt++;
} else /* no problem. */
*copy++ = *pt++;
}
/*
* If it's a separator, copy it over to the target buffer and
* move to the start of the next token.
*/
} else if (*pt == '/') {
while (pt[1] == '/')
pt++;
if ((pt[1] == '\0') && (pt > path))
break;
*copy++ = *pt++;
/*
* If we're in the middle of a non-parametric token, copy
* that character over and try the next character.
*/
} else
*copy++ = *pt++;
}
*copy = '\0';
(void) strcpy(path, buffer);
return (retvalue);
}
/*
* This function resolves the path into an absolute path referred to
* an install root of ir.
*/
void
basepath(char *path, char *basedir, char *ir)
{
char buffer[PATH_MAX];
/* For a relative path, prepend the basedir */
if (*path != '/') {
(void) strcpy(buffer, path);
if (ir && *ir) {
while (*ir)
*path++ = *ir++;
if (path[-1] == '/')
path--;
}
if (basedir && *basedir) {
if (ir && *ir && *basedir != '/')
*path++ = '/';
while (*basedir)
*path++ = *basedir++;
if (path[-1] == '/')
path--;
}
*path++ = '/';
(void) strcpy(path, buffer);
/* For an absolute path, just prepend the install root */
} else {
if (ir && *ir) {
(void) strcpy(buffer, path);
while (*ir)
*path++ = *ir++;
if (path[-1] == '/')
path--;
(void) strcpy(path, buffer);
}
}
}
/*
* Evaluate varname and return with environment variables resolved.
* NOTE: This assumes that varname is a buffer long enough to hold the
* evaluated string.
*/
int
mapvar(int flag, char *varname)
{
char *token;
int retvalue = 0;
/* If its a parametric entry beginning with an alpha character. */
if (*varname == '$' && isalpha(varname[1])) {
/* ...and it's the right time to evaluate it... */
if (mode(flag, varname)) {
/*
* then it MUST be possible to evaluate it. If not,
* there's an error.
*/
if (((token = getenv(&varname[1])) != NULL) &&
*token) {
/* copy token into varname */
while (*token)
*varname++ = *token++;
*varname = '\0';
} else
retvalue = 1;
} else {
if (flag == 2) /* install-time. */
/*
* ALL variables MUST evaluate at install
* time.
*/
retvalue = 1;
else if (flag == 1 && /* build-time */
islower(varname[1]))
/*
* all build-time variables must evaluate at
* build time.
*/
retvalue = 1;
}
}
return (retvalue);
}
|
the_stack_data/248579344.c | #include <stdio.h>
#include <inttypes.h>
int main() {
int y[2], x[2];
int *p=(int*)(
(((uintptr_t)&(x[0])) + ((uintptr_t)&(y[1])))
-((uintptr_t)&(y[0])) );
*p = 11; // is this free of undefined behaviour?
//(equivalent to the &x[0]+(&(y[1])-&(y[0])) version?)
printf("x[1]=%d *p=%d\n",x[1],*p);
return 0;
}
|
the_stack_data/190767254.c | #ifdef __i386__
/* -----------------------------------------------------------------------
ffi.c - Copyright (c) 1996, 1998, 1999, 2001, 2007, 2008 Red Hat, Inc.
Copyright (c) 2002 Ranjit Mathew
Copyright (c) 2002 Bo Thorsen
Copyright (c) 2002 Roger Sayle
Copyright (C) 2008, 2010 Free Software Foundation, Inc.
x86 Foreign Function Interface
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
``Software''), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED ``AS IS'', WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE.
----------------------------------------------------------------------- */
#if !defined(__x86_64__) || defined(_WIN64) || defined(__CYGWIN__)
#ifdef _WIN64
#include <windows.h>
#endif
#include <ffi.h>
#include <ffi_common.h>
#include <stdlib.h>
/* ffi_prep_args is called by the assembly routine once stack space
has been allocated for the function's arguments */
unsigned int ffi_prep_args(char *stack, extended_cif *ecif);
unsigned int ffi_prep_args(char *stack, extended_cif *ecif)
{
register unsigned int i;
register void **p_argv;
register char *argp;
register ffi_type **p_arg;
#ifndef X86_WIN64
const int cabi = ecif->cif->abi;
const int dir = (cabi == FFI_PASCAL || cabi == FFI_REGISTER) ? -1 : +1;
unsigned int stack_args_count = 0;
void *p_stack_data[3];
char *argp2 = stack;
#else
#define dir 1
#endif
argp = stack;
if ((ecif->cif->flags == FFI_TYPE_STRUCT
|| ecif->cif->flags == FFI_TYPE_MS_STRUCT)
#ifdef X86_WIN64
&& ((ecif->cif->rtype->size & (1 | 2 | 4 | 8)) == 0)
#endif
)
{
#ifndef X86_WIN64
/* For fastcall/thiscall/register this is first register-passed
argument. */
if (cabi == FFI_THISCALL || cabi == FFI_FASTCALL || cabi == FFI_REGISTER)
{
p_stack_data[stack_args_count] = argp;
++stack_args_count;
}
#endif
*(void **) argp = ecif->rvalue;
argp += sizeof(void*);
}
p_arg = ecif->cif->arg_types;
p_argv = ecif->avalue;
if (dir < 0)
{
const int nargs = ecif->cif->nargs - 1;
if (nargs > 0)
{
p_arg += nargs;
p_argv += nargs;
}
}
for (i = ecif->cif->nargs;
i != 0;
i--, p_arg += dir, p_argv += dir)
{
/* Align if necessary */
if ((sizeof(void*) - 1) & (size_t) argp)
argp = (char *) ALIGN(argp, sizeof(void*));
size_t z = (*p_arg)->size;
#ifdef X86_WIN64
if (z > FFI_SIZEOF_ARG
|| ((*p_arg)->type == FFI_TYPE_STRUCT
&& (z & (1 | 2 | 4 | 8)) == 0)
#if FFI_TYPE_DOUBLE != FFI_TYPE_LONGDOUBLE
|| ((*p_arg)->type == FFI_TYPE_LONGDOUBLE)
#endif
)
{
z = FFI_SIZEOF_ARG;
*(void **)argp = *p_argv;
}
else if ((*p_arg)->type == FFI_TYPE_FLOAT)
{
memcpy(argp, *p_argv, z);
}
else
#endif
if (z < FFI_SIZEOF_ARG)
{
z = FFI_SIZEOF_ARG;
switch ((*p_arg)->type)
{
case FFI_TYPE_SINT8:
*(ffi_sarg *) argp = (ffi_sarg)*(SINT8 *)(* p_argv);
break;
case FFI_TYPE_UINT8:
*(ffi_arg *) argp = (ffi_arg)*(UINT8 *)(* p_argv);
break;
case FFI_TYPE_SINT16:
*(ffi_sarg *) argp = (ffi_sarg)*(SINT16 *)(* p_argv);
break;
case FFI_TYPE_UINT16:
*(ffi_arg *) argp = (ffi_arg)*(UINT16 *)(* p_argv);
break;
case FFI_TYPE_SINT32:
*(ffi_sarg *) argp = (ffi_sarg)*(SINT32 *)(* p_argv);
break;
case FFI_TYPE_UINT32:
*(ffi_arg *) argp = (ffi_arg)*(UINT32 *)(* p_argv);
break;
case FFI_TYPE_STRUCT:
*(ffi_arg *) argp = *(ffi_arg *)(* p_argv);
break;
default:
FFI_ASSERT(0);
}
}
else
{
memcpy(argp, *p_argv, z);
}
#ifndef X86_WIN64
/* For thiscall/fastcall/register convention register-passed arguments
are the first two none-floating-point arguments with a size
smaller or equal to sizeof (void*). */
if ((z == FFI_SIZEOF_ARG)
&& ((cabi == FFI_REGISTER)
|| (cabi == FFI_THISCALL && stack_args_count < 1)
|| (cabi == FFI_FASTCALL && stack_args_count < 2))
&& ((*p_arg)->type != FFI_TYPE_FLOAT && (*p_arg)->type != FFI_TYPE_STRUCT)
)
{
if (dir < 0 && stack_args_count > 2)
{
/* Iterating arguments backwards, so first register-passed argument
will be passed last. Shift temporary values to make place. */
p_stack_data[0] = p_stack_data[1];
p_stack_data[1] = p_stack_data[2];
stack_args_count = 2;
}
p_stack_data[stack_args_count] = argp;
++stack_args_count;
}
#endif
#ifdef X86_WIN64
argp += (z + sizeof(void*) - 1) & ~(sizeof(void*) - 1);
#else
argp += z;
#endif
}
#ifndef X86_WIN64
/* We need to move the register-passed arguments for thiscall/fastcall/register
on top of stack, so that those can be moved to registers by call-handler. */
if (stack_args_count > 0)
{
if (dir < 0 && stack_args_count > 1)
{
/* Reverse order if iterating arguments backwards */
ffi_arg tmp = *(ffi_arg*) p_stack_data[0];
*(ffi_arg*) p_stack_data[0] = *(ffi_arg*) p_stack_data[stack_args_count - 1];
*(ffi_arg*) p_stack_data[stack_args_count - 1] = tmp;
}
int i;
for (i = 0; i < stack_args_count; i++)
{
if (p_stack_data[i] != argp2)
{
ffi_arg tmp = *(ffi_arg*) p_stack_data[i];
memmove (argp2 + FFI_SIZEOF_ARG, argp2, (size_t) ((char*) p_stack_data[i] - (char*)argp2));
*(ffi_arg *) argp2 = tmp;
}
argp2 += FFI_SIZEOF_ARG;
}
}
return stack_args_count;
#endif
return 0;
}
/* Perform machine dependent cif processing */
ffi_status ffi_prep_cif_machdep(ffi_cif *cif)
{
unsigned int i;
ffi_type **ptr;
/* Set the return type flag */
switch (cif->rtype->type)
{
case FFI_TYPE_VOID:
case FFI_TYPE_UINT8:
case FFI_TYPE_UINT16:
case FFI_TYPE_SINT8:
case FFI_TYPE_SINT16:
#ifdef X86_WIN64
case FFI_TYPE_UINT32:
case FFI_TYPE_SINT32:
#endif
case FFI_TYPE_SINT64:
case FFI_TYPE_FLOAT:
case FFI_TYPE_DOUBLE:
#ifndef X86_WIN64
#if FFI_TYPE_DOUBLE != FFI_TYPE_LONGDOUBLE
case FFI_TYPE_LONGDOUBLE:
#endif
#endif
cif->flags = (unsigned) cif->rtype->type;
break;
case FFI_TYPE_UINT64:
#ifdef X86_WIN64
case FFI_TYPE_POINTER:
#endif
cif->flags = FFI_TYPE_SINT64;
break;
case FFI_TYPE_STRUCT:
#ifndef X86
if (cif->rtype->size == 1)
{
cif->flags = FFI_TYPE_SMALL_STRUCT_1B; /* same as char size */
}
else if (cif->rtype->size == 2)
{
cif->flags = FFI_TYPE_SMALL_STRUCT_2B; /* same as short size */
}
else if (cif->rtype->size == 4)
{
#ifdef X86_WIN64
cif->flags = FFI_TYPE_SMALL_STRUCT_4B;
#else
cif->flags = FFI_TYPE_INT; /* same as int type */
#endif
}
else if (cif->rtype->size == 8)
{
cif->flags = FFI_TYPE_SINT64; /* same as int64 type */
}
else
#endif
{
#ifdef X86_WIN32
if (cif->abi == FFI_MS_CDECL)
cif->flags = FFI_TYPE_MS_STRUCT;
else
#endif
cif->flags = FFI_TYPE_STRUCT;
/* allocate space for return value pointer */
cif->bytes += ALIGN(sizeof(void*), FFI_SIZEOF_ARG);
}
break;
default:
#ifdef X86_WIN64
cif->flags = FFI_TYPE_SINT64;
break;
case FFI_TYPE_INT:
cif->flags = FFI_TYPE_SINT32;
#else
cif->flags = FFI_TYPE_INT;
#endif
break;
}
for (ptr = cif->arg_types, i = cif->nargs; i > 0; i--, ptr++)
{
if (((*ptr)->alignment - 1) & cif->bytes)
cif->bytes = ALIGN(cif->bytes, (*ptr)->alignment);
cif->bytes += (unsigned)ALIGN((*ptr)->size, FFI_SIZEOF_ARG);
}
#ifdef X86_WIN64
/* ensure space for storing four registers */
cif->bytes += 4 * FFI_SIZEOF_ARG;
#endif
#ifndef X86_WIN32
#ifndef X86_WIN64
if (cif->abi == FFI_SYSV || cif->abi == FFI_UNIX64)
#endif
cif->bytes = (cif->bytes + 15) & ~0xF;
#endif
return FFI_OK;
}
#ifdef X86_WIN64
extern int
ffi_call_win64(unsigned int (*)(char *, extended_cif *), extended_cif *,
unsigned, unsigned, unsigned *, void (*fn)(void));
#else
extern void
ffi_call_win32(unsigned int (*)(char *, extended_cif *), extended_cif *,
unsigned, unsigned, unsigned, unsigned *, void (*fn)(void));
extern void ffi_call_SYSV(void (*)(char *, extended_cif *), extended_cif *,
unsigned, unsigned, unsigned *, void (*fn)(void));
#endif
void ffi_call(ffi_cif *cif, void (*fn)(void), void *rvalue, void **avalue)
{
extended_cif ecif;
ecif.cif = cif;
ecif.avalue = avalue;
/* If the return value is a struct and we don't have a return */
/* value address then we need to make one */
#ifdef X86_WIN64
if (rvalue == NULL
&& cif->flags == FFI_TYPE_STRUCT
&& ((cif->rtype->size & (1 | 2 | 4 | 8)) == 0))
{
ecif.rvalue = alloca((cif->rtype->size + 0xF) & ~0xF);
}
#else
if (rvalue == NULL
&& (cif->flags == FFI_TYPE_STRUCT
|| cif->flags == FFI_TYPE_MS_STRUCT))
{
ecif.rvalue = alloca(cif->rtype->size);
}
#endif
else
ecif.rvalue = rvalue;
switch (cif->abi)
{
#ifdef X86_WIN64
case FFI_WIN64:
ffi_call_win64(ffi_prep_args, &ecif, cif->bytes,
cif->flags, ecif.rvalue, fn);
break;
#else
#ifndef X86_WIN32
case FFI_SYSV:
ffi_call_SYSV(ffi_prep_args, &ecif, cif->bytes, cif->flags, ecif.rvalue,
fn);
break;
#else
case FFI_SYSV:
case FFI_MS_CDECL:
#endif
case FFI_STDCALL:
case FFI_THISCALL:
case FFI_FASTCALL:
case FFI_PASCAL:
case FFI_REGISTER:
ffi_call_win32(ffi_prep_args, &ecif, cif->abi, cif->bytes, cif->flags,
ecif.rvalue, fn);
break;
#endif
default:
FFI_ASSERT(0);
break;
}
}
/** private members **/
/* The following __attribute__((regparm(1))) decorations will have no effect
on MSVC or SUNPRO_C -- standard conventions apply. */
static unsigned int ffi_prep_incoming_args (char *stack, void **ret,
void** args, ffi_cif* cif);
void FFI_HIDDEN ffi_closure_SYSV (ffi_closure *)
__attribute__ ((regparm(1)));
unsigned int FFI_HIDDEN ffi_closure_SYSV_inner (ffi_closure *, void **, void *)
__attribute__ ((regparm(1)));
unsigned int FFI_HIDDEN ffi_closure_WIN32_inner (ffi_closure *, void **, void *)
__attribute__ ((regparm(1)));
void FFI_HIDDEN ffi_closure_raw_SYSV (ffi_raw_closure *)
__attribute__ ((regparm(1)));
#ifdef X86_WIN32
void FFI_HIDDEN ffi_closure_raw_THISCALL (ffi_raw_closure *)
__attribute__ ((regparm(1)));
#endif
#ifndef X86_WIN64
void FFI_HIDDEN ffi_closure_STDCALL (ffi_closure *);
void FFI_HIDDEN ffi_closure_THISCALL (ffi_closure *);
void FFI_HIDDEN ffi_closure_FASTCALL (ffi_closure *);
void FFI_HIDDEN ffi_closure_REGISTER (ffi_closure *);
#else
void FFI_HIDDEN ffi_closure_win64 (ffi_closure *);
#endif
/* This function is jumped to by the trampoline */
#ifdef X86_WIN64
void * FFI_HIDDEN
ffi_closure_win64_inner (ffi_closure *closure, void *args) {
ffi_cif *cif;
void **arg_area;
void *result;
void *resp = &result;
cif = closure->cif;
arg_area = (void**) alloca (cif->nargs * sizeof (void*));
/* this call will initialize ARG_AREA, such that each
* element in that array points to the corresponding
* value on the stack; and if the function returns
* a structure, it will change RESP to point to the
* structure return address. */
ffi_prep_incoming_args(args, &resp, arg_area, cif);
(closure->fun) (cif, resp, arg_area, closure->user_data);
/* The result is returned in rax. This does the right thing for
result types except for floats; we have to 'mov xmm0, rax' in the
caller to correct this.
TODO: structure sizes of 3 5 6 7 are returned by reference, too!!!
*/
return cif->rtype->size > sizeof(void *) ? resp : *(void **)resp;
}
#else
unsigned int FFI_HIDDEN __attribute__ ((regparm(1)))
ffi_closure_SYSV_inner (ffi_closure *closure, void **respp, void *args)
{
/* our various things... */
ffi_cif *cif;
void **arg_area;
cif = closure->cif;
arg_area = (void**) alloca (cif->nargs * sizeof (void*));
/* this call will initialize ARG_AREA, such that each
* element in that array points to the corresponding
* value on the stack; and if the function returns
* a structure, it will change RESP to point to the
* structure return address. */
ffi_prep_incoming_args(args, respp, arg_area, cif);
(closure->fun) (cif, *respp, arg_area, closure->user_data);
return cif->flags;
}
unsigned int FFI_HIDDEN __attribute__ ((regparm(1)))
ffi_closure_WIN32_inner (ffi_closure *closure, void **respp, void *args)
{
/* our various things... */
ffi_cif *cif;
void **arg_area;
unsigned int ret;
cif = closure->cif;
arg_area = (void**) alloca (cif->nargs * sizeof (void*));
/* this call will initialize ARG_AREA, such that each
* element in that array points to the corresponding
* value on the stack; and if the function returns
* a structure, it will change RESP to point to the
* structure return address. */
ret = ffi_prep_incoming_args(args, respp, arg_area, cif);
(closure->fun) (cif, *respp, arg_area, closure->user_data);
return ret;
}
#endif /* !X86_WIN64 */
static unsigned int
ffi_prep_incoming_args(char *stack, void **rvalue, void **avalue,
ffi_cif *cif)
{
register unsigned int i;
register void **p_argv;
register char *argp;
register ffi_type **p_arg;
#ifndef X86_WIN64
const int cabi = cif->abi;
const int dir = (cabi == FFI_PASCAL || cabi == FFI_REGISTER) ? -1 : +1;
const unsigned int max_stack_count = (cabi == FFI_THISCALL) ? 1
: (cabi == FFI_FASTCALL) ? 2
: (cabi == FFI_REGISTER) ? 3
: 0;
unsigned int passed_regs = 0;
void *p_stack_data[3] = { stack - 1 };
#else
#define dir 1
#endif
argp = stack;
#ifndef X86_WIN64
argp += max_stack_count * FFI_SIZEOF_ARG;
#endif
if ((cif->flags == FFI_TYPE_STRUCT
|| cif->flags == FFI_TYPE_MS_STRUCT)
#ifdef X86_WIN64
&& ((cif->rtype->size & (1 | 2 | 4 | 8)) == 0)
#endif
)
{
#ifndef X86_WIN64
if (passed_regs < max_stack_count)
{
*rvalue = *(void**) (stack + (passed_regs*FFI_SIZEOF_ARG));
++passed_regs;
}
else
#endif
{
*rvalue = *(void **) argp;
argp += sizeof(void *);
}
}
#ifndef X86_WIN64
/* Do register arguments first */
for (i = 0, p_arg = cif->arg_types;
i < cif->nargs && passed_regs < max_stack_count;
i++, p_arg++)
{
if ((*p_arg)->type == FFI_TYPE_FLOAT
|| (*p_arg)->type == FFI_TYPE_STRUCT)
continue;
size_t sz = (*p_arg)->size;
if(sz == 0 || sz > FFI_SIZEOF_ARG)
continue;
p_stack_data[passed_regs] = avalue + i;
avalue[i] = stack + (passed_regs*FFI_SIZEOF_ARG);
++passed_regs;
}
#endif
p_arg = cif->arg_types;
p_argv = avalue;
if (dir < 0)
{
const int nargs = cif->nargs - 1;
if (nargs > 0)
{
p_arg += nargs;
p_argv += nargs;
}
}
for (i = cif->nargs;
i != 0;
i--, p_arg += dir, p_argv += dir)
{
/* Align if necessary */
if ((sizeof(void*) - 1) & (size_t) argp)
argp = (char *) ALIGN(argp, sizeof(void*));
size_t z = (*p_arg)->size;
#ifdef X86_WIN64
if (z > FFI_SIZEOF_ARG
|| ((*p_arg)->type == FFI_TYPE_STRUCT
&& (z & (1 | 2 | 4 | 8)) == 0)
#if FFI_TYPE_DOUBLE != FFI_TYPE_LONGDOUBLE
|| ((*p_arg)->type == FFI_TYPE_LONGDOUBLE)
#endif
)
{
z = FFI_SIZEOF_ARG;
*p_argv = *(void **)argp;
}
else
#else
if (passed_regs > 0
&& z <= FFI_SIZEOF_ARG
&& (p_argv == p_stack_data[0]
|| p_argv == p_stack_data[1]
|| p_argv == p_stack_data[2]))
{
/* Already assigned a register value */
continue;
}
else
#endif
{
/* because we're little endian, this is what it turns into. */
*p_argv = (void*) argp;
}
#ifdef X86_WIN64
argp += (z + sizeof(void*) - 1) & ~(sizeof(void*) - 1);
#else
argp += z;
#endif
}
return (size_t)argp - (size_t)stack;
}
#define FFI_INIT_TRAMPOLINE_WIN64(TRAMP,FUN,CTX,MASK) \
{ unsigned char *__tramp = (unsigned char*)(TRAMP); \
void* __fun = (void*)(FUN); \
void* __ctx = (void*)(CTX); \
*(unsigned char*) &__tramp[0] = 0x41; \
*(unsigned char*) &__tramp[1] = 0xbb; \
*(unsigned int*) &__tramp[2] = MASK; /* mov $mask, %r11 */ \
*(unsigned char*) &__tramp[6] = 0x48; \
*(unsigned char*) &__tramp[7] = 0xb8; \
*(void**) &__tramp[8] = __ctx; /* mov __ctx, %rax */ \
*(unsigned char *) &__tramp[16] = 0x49; \
*(unsigned char *) &__tramp[17] = 0xba; \
*(void**) &__tramp[18] = __fun; /* mov __fun, %r10 */ \
*(unsigned char *) &__tramp[26] = 0x41; \
*(unsigned char *) &__tramp[27] = 0xff; \
*(unsigned char *) &__tramp[28] = 0xe2; /* jmp %r10 */ \
}
/* How to make a trampoline. Derived from gcc/config/i386/i386.c. */
#define FFI_INIT_TRAMPOLINE(TRAMP,FUN,CTX) \
{ unsigned char *__tramp = (unsigned char*)(TRAMP); \
unsigned int __fun = (unsigned int)(FUN); \
unsigned int __ctx = (unsigned int)(CTX); \
unsigned int __dis = __fun - (__ctx + 10); \
*(unsigned char*) &__tramp[0] = 0xb8; \
*(unsigned int*) &__tramp[1] = __ctx; /* movl __ctx, %eax */ \
*(unsigned char*) &__tramp[5] = 0xe9; \
*(unsigned int*) &__tramp[6] = __dis; /* jmp __fun */ \
}
#define FFI_INIT_TRAMPOLINE_RAW_THISCALL(TRAMP,FUN,CTX,SIZE) \
{ unsigned char *__tramp = (unsigned char*)(TRAMP); \
unsigned int __fun = (unsigned int)(FUN); \
unsigned int __ctx = (unsigned int)(CTX); \
unsigned int __dis = __fun - (__ctx + 49); \
unsigned short __size = (unsigned short)(SIZE); \
*(unsigned int *) &__tramp[0] = 0x8324048b; /* mov (%esp), %eax */ \
*(unsigned int *) &__tramp[4] = 0x4c890cec; /* sub $12, %esp */ \
*(unsigned int *) &__tramp[8] = 0x04890424; /* mov %ecx, 4(%esp) */ \
*(unsigned char*) &__tramp[12] = 0x24; /* mov %eax, (%esp) */ \
*(unsigned char*) &__tramp[13] = 0xb8; \
*(unsigned int *) &__tramp[14] = __size; /* mov __size, %eax */ \
*(unsigned int *) &__tramp[18] = 0x08244c8d; /* lea 8(%esp), %ecx */ \
*(unsigned int *) &__tramp[22] = 0x4802e8c1; /* shr $2, %eax ; dec %eax */ \
*(unsigned short*) &__tramp[26] = 0x0b74; /* jz 1f */ \
*(unsigned int *) &__tramp[28] = 0x8908518b; /* 2b: mov 8(%ecx), %edx */ \
*(unsigned int *) &__tramp[32] = 0x04c18311; /* mov %edx, (%ecx) ; add $4, %ecx */ \
*(unsigned char*) &__tramp[36] = 0x48; /* dec %eax */ \
*(unsigned short*) &__tramp[37] = 0xf575; /* jnz 2b ; 1f: */ \
*(unsigned char*) &__tramp[39] = 0xb8; \
*(unsigned int*) &__tramp[40] = __ctx; /* movl __ctx, %eax */ \
*(unsigned char *) &__tramp[44] = 0xe8; \
*(unsigned int*) &__tramp[45] = __dis; /* call __fun */ \
*(unsigned char*) &__tramp[49] = 0xc2; /* ret */ \
*(unsigned short*) &__tramp[50] = (__size + 8); /* ret (__size + 8) */ \
}
#define FFI_INIT_TRAMPOLINE_WIN32(TRAMP,FUN,CTX) \
{ unsigned char *__tramp = (unsigned char*)(TRAMP); \
unsigned int __fun = (unsigned int)(FUN); \
unsigned int __ctx = (unsigned int)(CTX); \
unsigned int __dis = __fun - (__ctx + 10); \
*(unsigned char*) &__tramp[0] = 0x68; \
*(unsigned int*) &__tramp[1] = __ctx; /* push __ctx */ \
*(unsigned char*) &__tramp[5] = 0xe9; \
*(unsigned int*) &__tramp[6] = __dis; /* jmp __fun */ \
}
/* the cif must already be prep'ed */
ffi_status
ffi_prep_closure_loc (ffi_closure* closure,
ffi_cif* cif,
void (*fun)(ffi_cif*,void*,void**,void*),
void *user_data,
void *codeloc)
{
#ifdef X86_WIN64
#define ISFLOAT(IDX) (cif->arg_types[IDX]->type == FFI_TYPE_FLOAT || cif->arg_types[IDX]->type == FFI_TYPE_DOUBLE)
#define FLAG(IDX) (cif->nargs>(IDX)&&ISFLOAT(IDX)?(1<<(IDX)):0)
if (cif->abi == FFI_WIN64)
{
int mask = FLAG(0)|FLAG(1)|FLAG(2)|FLAG(3);
FFI_INIT_TRAMPOLINE_WIN64 (&closure->tramp[0],
&ffi_closure_win64,
codeloc, mask);
/* make sure we can execute here */
}
#else
if (cif->abi == FFI_SYSV)
{
FFI_INIT_TRAMPOLINE (&closure->tramp[0],
&ffi_closure_SYSV,
(void*)codeloc);
}
else if (cif->abi == FFI_REGISTER)
{
FFI_INIT_TRAMPOLINE_WIN32 (&closure->tramp[0],
&ffi_closure_REGISTER,
(void*)codeloc);
}
else if (cif->abi == FFI_FASTCALL)
{
FFI_INIT_TRAMPOLINE_WIN32 (&closure->tramp[0],
&ffi_closure_FASTCALL,
(void*)codeloc);
}
else if (cif->abi == FFI_THISCALL)
{
FFI_INIT_TRAMPOLINE_WIN32 (&closure->tramp[0],
&ffi_closure_THISCALL,
(void*)codeloc);
}
else if (cif->abi == FFI_STDCALL || cif->abi == FFI_PASCAL)
{
FFI_INIT_TRAMPOLINE_WIN32 (&closure->tramp[0],
&ffi_closure_STDCALL,
(void*)codeloc);
}
#ifdef X86_WIN32
else if (cif->abi == FFI_MS_CDECL)
{
FFI_INIT_TRAMPOLINE (&closure->tramp[0],
&ffi_closure_SYSV,
(void*)codeloc);
}
#endif /* X86_WIN32 */
#endif /* !X86_WIN64 */
else
{
return FFI_BAD_ABI;
}
closure->cif = cif;
closure->user_data = user_data;
closure->fun = fun;
return FFI_OK;
}
/* ------- Native raw API support -------------------------------- */
#if !FFI_NO_RAW_API
ffi_status
ffi_prep_raw_closure_loc (ffi_raw_closure* closure,
ffi_cif* cif,
void (*fun)(ffi_cif*,void*,ffi_raw*,void*),
void *user_data,
void *codeloc)
{
int i;
if (cif->abi != FFI_SYSV
#ifdef X86_WIN32
&& cif->abi != FFI_THISCALL
#endif
)
return FFI_BAD_ABI;
/* we currently don't support certain kinds of arguments for raw
closures. This should be implemented by a separate assembly
language routine, since it would require argument processing,
something we don't do now for performance. */
for (i = cif->nargs-1; i >= 0; i--)
{
FFI_ASSERT (cif->arg_types[i]->type != FFI_TYPE_STRUCT);
FFI_ASSERT (cif->arg_types[i]->type != FFI_TYPE_LONGDOUBLE);
}
#ifdef X86_WIN32
if (cif->abi == FFI_SYSV)
{
#endif
FFI_INIT_TRAMPOLINE (&closure->tramp[0], &ffi_closure_raw_SYSV,
codeloc);
#ifdef X86_WIN32
}
else if (cif->abi == FFI_THISCALL)
{
FFI_INIT_TRAMPOLINE_RAW_THISCALL (&closure->tramp[0], &ffi_closure_raw_THISCALL, codeloc, cif->bytes);
}
#endif
closure->cif = cif;
closure->user_data = user_data;
closure->fun = fun;
return FFI_OK;
}
static unsigned int
ffi_prep_args_raw(char *stack, extended_cif *ecif)
{
const ffi_cif *cif = ecif->cif;
unsigned int i, passed_regs = 0;
#ifndef X86_WIN64
const unsigned int abi = cif->abi;
const unsigned int max_regs = (abi == FFI_THISCALL) ? 1
: (abi == FFI_FASTCALL) ? 2
: (abi == FFI_REGISTER) ? 3
: 0;
if (cif->flags == FFI_TYPE_STRUCT)
++passed_regs;
for (i = 0; i < cif->nargs && passed_regs <= max_regs; i++)
{
if (cif->arg_types[i]->type == FFI_TYPE_FLOAT
|| cif->arg_types[i]->type == FFI_TYPE_STRUCT)
continue;
size_t sz = cif->arg_types[i]->size;
if (sz == 0 || sz > FFI_SIZEOF_ARG)
continue;
++passed_regs;
}
#endif
memcpy (stack, ecif->avalue, cif->bytes);
return passed_regs;
}
/* we borrow this routine from libffi (it must be changed, though, to
* actually call the function passed in the first argument. as of
* libffi-1.20, this is not the case.)
*/
void
ffi_raw_call(ffi_cif *cif, void (*fn)(void), void *rvalue, ffi_raw *fake_avalue)
{
extended_cif ecif;
void **avalue = (void **)fake_avalue;
ecif.cif = cif;
ecif.avalue = avalue;
/* If the return value is a struct and we don't have a return */
/* value address then we need to make one */
if (rvalue == NULL
&& (cif->flags == FFI_TYPE_STRUCT
|| cif->flags == FFI_TYPE_MS_STRUCT))
{
ecif.rvalue = alloca(cif->rtype->size);
}
else
ecif.rvalue = rvalue;
switch (cif->abi)
{
#ifndef X86_WIN32
case FFI_SYSV:
ffi_call_SYSV(ffi_prep_args_raw, &ecif, cif->bytes, cif->flags,
ecif.rvalue, fn);
break;
#else
case FFI_SYSV:
case FFI_MS_CDECL:
#endif
#ifndef X86_WIN64
case FFI_STDCALL:
case FFI_THISCALL:
case FFI_FASTCALL:
case FFI_PASCAL:
case FFI_REGISTER:
ffi_call_win32(ffi_prep_args_raw, &ecif, cif->abi, cif->bytes, cif->flags,
ecif.rvalue, fn);
break;
#endif
default:
FFI_ASSERT(0);
break;
}
}
#endif
#endif /* !__x86_64__ || X86_WIN64 */
#endif |
the_stack_data/129580.c | #include <unistd.h>
#include <fcntl.h>
#define BUF_SIZE 1000
int main(int argc, char** argv)
{
if (argc > 1)
{
close(1);
creat(argv[1], 0644);
}
char buf[BUF_SIZE];
int len;
while ((len = read(0, buf, BUF_SIZE)))
write(1, buf, len);
return 0;
}
|
the_stack_data/1190451.c | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_foreach.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: kchenna <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2018/10/02 20:26:13 by kchenna #+# #+# */
/* Updated: 2018/10/02 21:14:09 by kchenna ### ########.fr */
/* */
/* ************************************************************************** */
void ft_foreach(int *tab, int length, void (*f)(int))
{
int i;
i = 0;
while (i < length)
{
(*f)(tab[i]);
i++;
}
}
|
the_stack_data/148577157.c | // convert integers to pointers
int main ()
{
int* a = (int*)6000;
return 0;
}
|
the_stack_data/21031.c | #include<stdio.h>
int main()
{
int num = 1;
if(*(char *)&num == 1)
{
printf("\nLittle-Endian\n");
}
else
{
printf("Big-Endian\n");
}
return 0;
}
|
the_stack_data/167329964.c | /* C Primer Plus Ch.2 - Problem 5 */
#include <stdio.h>
int main(void){
int toes = 10;
printf("Toes: %d\n", toes);
printf("Twice of toes: %d\n", toes * 2);
printf("Squared of toes: %d\n", toes * toes);
return 0;
}
|
the_stack_data/1170117.c | //Contributors
//G. Poppe
//Shane Cortez
//Michael VanCleave-Lopez
//Sergio Molina
//Richmond Laureta
#include <stdlib.h>
#include <ctype.h>
#include <string.h>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <stdbool.h>
#include <unistd.h>
///////////Shanes room methods///////////
void shanesFileWriter(int choice);
///////////Shanes room methods end/////////
void extraCredit(void);
void ignoreExtra(void);
int choice1(int number);
int choice2(char *ptr);
int choice3(int number1);
int choice4(int *ptr1);
int choice5(void);
void gameRules(); //function to explain rules of room 12 game
void gameCraps(); //function to run room 12 game
char prompt(void);
void randomFill(int *ptr);
void room27Output(int z);
void oddDeviceShenanigans(void); // Room #7
int drunkBehavior(void); // Room #7
//Room 9 Functions
void bBlue(void);
void bCyan(void);
void bRed(void);
void bYellow(void);
void bGreen(void);
void reset(void);
void displayInputs(int c);
void displayStats(int c, int s);
void woman(void);
void congratulations(void);
// End of Room 9 Functions
void randStr18(char st[], int z);
void roomPrompt(int* userChoice);
void gorillaRoom(int* bananaAmount, int* orangeAmount);
void drawPicture(void);
void caseRandomizer(char *name, int *bananaAmount, int *orangeAmount);
void problem1(int math);
void problem2 (char *ptr);
int flip();
void oputmm21(int d1, int d2, int d3, int d4, int d5, int d6, int d7, int d8, int d9, int d10);
int rollsmm21();
int rollmm21();
void weaponPower(int p); //room 25 for RICHMOND LAURETA
int main(void)
{
int x,y,z,i,h,g,k,choice=0;
char decision;
char name[256];
int boxNum=0;
int input,rando,rando2,score = 0,counter = 0;
double timetaken;
time_t begin,end;
int oneusage = 0;
// NEEDED FOR ROOM 7:
srand(time(NULL));
printf("Please enter your name: "); //Input any number of array inputs
scanf("%s",name);
printf("Hello %s welcome to the rpgGame!\n",name);
while(choice != 99)
{
puts("You find yourself in a dark room and you are not sure how you got here.");
puts("As you look around you see the room has 25 doors, each labeled with a number. You are not sure how such a small room can have 25 doors, sooo magic...");
puts("The room starts filling with water and you must choose a door to open or you will likely drown. you may quit anytime by selecting option 99");
puts("What door do you choose?");
scanf("%d",&choice);
switch(choice)
{
case 1:
{
srand(time(NULL));
int length = 0, num = 0, magicNum = 0;
char word[40] = "sacramento";
char *ptr;
ptr = word;
int array[6] = {0};
for(i = 0; i < 6; i++)
{
array[i] = 1 + rand() % 10;
}
int *numptr;
numptr = array;
length = strlen(name);
for(i = 0; i < length;i++)
{
if(isupper(name[i]))
{
name[i] = tolower(name[i]);
}
}
name[0] = toupper(name[0]); //Making sure the name is written correctly with uppercase first letter
printf("Hello %s, you have entered the room 1.\n", name);
puts("You have survived the first part of your adventure..the Drowning.");
puts("You are in a dark room and see a small blue light in the middle of the room on top of the table.");
puts("You get close to it and realize that it is a laptop. You found a way to get out of the room.");
puts("But only way you can access the laptop is solving one of the 5 choices.");
puts("You have 5 choices to make in order to escape this horror adventure. \n");
printf( "1. You have to solve a math problem for survival. \n"
"2. You have to guess the word for survival. \n"
"3. You have to find the magic number for survival. \n"
"4. Find the sum of a random integer array. \n"
"5. It's a surprise!. \n");
while(choice != 99)
{
puts("Make a choice(99 to quit): ");
scanf(" %d", &choice);
switch(choice)
{
case 1:
{
puts("You have chosen to solve the math problem. Don't forget you have one chance. Now choose a number between 1-10:");
scanf(" %d", &num);
choice1(num);
return EXIT_SUCCESS;
break;
}
case 2:
{
puts("You have chosen to guess the word. What is the capital of California?");
choice2(ptr);
return EXIT_SUCCESS;
break;
}
case 3:
{
puts("Enter the magic number(between 1 - 20) by solving the math problems:");
magicNum = 1 + rand() % 20;
choice3(magicNum);
return EXIT_SUCCESS;
break;
}
case 4:
{
puts("You have chosen to calculate the average:");
choice4(numptr);
return EXIT_SUCCESS;
break;
}
case 5:
{
puts("This was the wrong choice to be made. Now you have ended up in a room with nowhere to go....");
choice5();
return EXIT_SUCCESS;
break;
}
}
}
break;
}
case 2:
{
while(choice != 99)
{
puts("you open the door and find ........");
printf("AN OGRE!!! *phew* ...oh good he's asleep but hey there's a lever behind him. You start to think maybe it will stop the water from filling up the main room. Now you must make a choice. (Hit Ctrl+C to exit the game at any time.)\n");
printf("\n");
puts("Carefully walk around the sleeping ogre and pull the lever. Enter 1.");
puts("Explore the dark mysterious room quietly. Enter 2."); puts("Wake up the ogre and see what happens. Enter 3.");
choice = 0;
while(choice < 1 || choice > 3)
{
scanf("%d",&choice); if(choice < 1 || choice > 3) puts("Sorry, I did not understand your choice. Try again.");
}
switch(choice)
{
case 1:
puts("\nOh no...the ogre hears and feels you around him and starts to wake up. You quickly try and hide behind a box that's close to you. The ogre is confused and starts to search for you, and as he does, you sneak around and try and find a way out. You find a small door but it's locked, so you go back to sneaking around trying to stay hidden from the ogre in search for this key since there's no other way out. After a bit, the ogre momentarily gives up as you continue to search for the key. You finally come across a smaller box on the bottom of a shelf. You look inside and find a little key. You take the key in your hands and start to crawl back to the small door you found earlier. As you approach the door, you hear the ogre get back up from where he was sitting and start to search from you again. You start to crawl faster towards the door as you hear his footsteps getting closer. You manage to get to the small door and try the key that you found in the box earlier. It fits and you unlock the door. You quickly open it and squeeze your body into the opening and snut the door behind you as you hear the ogre just a few feet away. You're now in a room full of books, ahh it's a library, but you soon realize that there's no other door in sight. You try very hard to think on how you're supposed to get out of here and back home. You have your cell phone but it's at 20 percent and there's no wifi or service here. Then suddenly a thought pops into your head, what if somewhere in this library there's a hidden bookshelf door, like the ones you see in the movies. You quickly begin to start taking books off the shelves of this library. Two big piles of books later and still no luck. You start to break down and think you may never get out of here. You pull one last book before falling to the ground in exhaustion and you hear a click. You look up at the bookcase and see it begin to open. You get up with tears in your eyes and walk into this small empty room with one remaining door. You run to the door and open it and find yourself transported back to the library where you fell asleep reading a book. The other people around you are looking at you strangely. Well, that's the last time you ever read a fictional magic book, that was scary. THE END. Play again! \n");
break;
case 2:
puts("\nAs you quietly explore the room, you come across a long box on a shelf.. You turn your head back to check if the ogre is still asleep, and he is. You carely open the box and find all kinds of packaging, so you move it out of the way and discover a sword! You try to pick it up with one hand and it's way too heavy, you think 'damn I need to hit the gym'. You try picking it up with both hands and manage to get it out of the box and hold it properly. Then suddenly, you feel a hot breath on the back of your neck and realize you no longer hear the ogre snoring. You quickly turn around and find yourself face to face with the ogre so you run to your left before he manages to grab you. Mid run you decide to turn back around and fight the ogre. You swing your sword and slice his hand off that was about to grab you. The ogre yells out in pain and frustration and tries to grab you again with his other hand and you manage to dodge him and slice at his knee cap, causing him to fell over and yell again. Out of breath, you back up in an attempt to get a running start. You charge at the ogre and stab him right in the heart, killing him instantly. You drop the sword and take a moment to catch your breath before rushing towards the lever on the wall switching it down. You run back to the door you came in and realize the water stopped filling the main room. You struggle to walk through the water, that is now at your waist. You use your hands to wash off the blood and sweat off your face, and suddenly you wake up in your bed back at home but your waist and legs are still wet. You peed the bed. THE END. Play again! \n");
break;
case 3:
puts("\nThe ogre wakes up and discovers you standing in front of him. You quickly try and run away but too late, he grabs you in his right hand and bites your head off. You died. THE END. Play again! \n");
break; }
}
break;
}
case 3:
{
while(choice != 99)
{
printf("%s", "You open the door and find ........\n");
printf("%s", "You see extra credit for CSC 251-01\n Do you chase it?\n");
printf("%s%s%s", "1) To chase it\n","2) Ignore the tempations of passing the class!\n","99) If you don't want to play anymore\n");
scanf("%d",&choice);
switch(choice)
{
case 1:
extraCredit();
break;
case 2:
ignoreExtra();
break;
case 99:
break;
default:
printf("%s", "Please follow the directions!\nYou're going to back to spawn!\n");
break;
}
break;
}
break;
}
case 4:
{
while(choice != 99)
{
int decision4;
char lowerName4[20];
char tempLowerName4[20];
/* puts("*****************************************************************************************");
puts("In your adventure please make sure to enter your decision exactly as stated in the 'quote'.");
puts("\n");
*/ for(i=0; i<20; i++)
{
lowerName4[i] = tolower(name[i]);
}
puts("You open the door and find two more doors.");
puts("The left one is covered in dirt,moss, and other unknown substances.");
puts("The right one is sparkling clean and there seems to be white light leaking out from under.");
puts("Do you \n 1. go left? \n 2. go right?\n");
scanf("%d", &decision4);
if(decision4 == 1)
{
printf("\nYou open the door slowly, scared of what could be behind it. But to your surprise the door leads to a clean school classroom. You sigh in relief of what could have happen. But then you hear a scream of pain in the hallway.\n Do you\n 1. check it out?\n 2. hide in the classroom?\n\n");
scanf("%d", &decision4);
if(decision4 == 1)
{
printf("\nYou walk over to the door connecting to the hallway.You open it and step a foot into the hallway. It seems clear until you look to the right see a man holding a woman up by her hair at the end of hallway.\n Do you\n 1. run to the left to try to escape the man?\n 2. approach him to try to save the woman?\n\n");
scanf("%d", &decision4);
if(decision4 == 1)
{
printf("\nYou run as quickly as can for the door hoping it's an exit. The man notices you and drops the women and starts chasing you. Luckily, the door does lead to outside but it appears you are in some kind of forest. There is a car running and long dirt road that you can't see the end of.\n Do you\n 1. get into the car?\n 2. do you hide on the side of the door and try to ambush him?\n\n");
scanf("%d", &decision4);
if(decision4 == 1)
{
printf("\nYou get into the car. Put it into drive and make a U-turn for the road. The man exits the building and begins chasing the car. It's speeding up and you left him in the dust. It seems all clear but he starts shooting at you. You swerve left and right trying to dodge his bullets. You feel your shoulder burning and you look down at and notice you've been hit. You continue driving on the road and it finally leads to a paved road. You have been driving for a couple of miles now and tried your best to help your wound but you lost a lot of blood. You see a gas station in the distance but you still have half the tank left.\n Do you\n 1. stop at the gas station for help?\n 2. do you keep driving hoping you can get to a city?\n\n");
scanf("%d", &decision4);
if(decision4 == 1)
{
printf("\nYou pull over into the old gas station and notice two cars are parked infront of it. You head inside hoping to get some help. The cashier is minding his business as you enter. You tell him about your situation and he has a confused look on his face. \"Here you can use the phone.\" You pick up the phone. \n\n");
int phoneNumberGas4 = 911;
int phoneNumberGasDial4;
// scanf("%d", phoneNumberGasDial4);
while(phoneNumberGasDial4 != phoneNumberGas4)
{
printf("\nWho do you dial?\n");
printf("Perhaps the cops?\n");
scanf("%d", &phoneNumberGasDial4);
}
// while(phoneNumberGasDial4 != phoneNumberGas4);
printf("\nIt rings for a couple of seconds . . . until a woman picks and asks \"911, What's your emergency?\". You tell her your situation and she tells you stay put since officers are on their way. The cashier asks if you want anything to eat or drink. But you decline, so he offers that you can rest in the breakroom while you wait for the police to come. You agree so he leads you to the back and you sit down on a small dirty couch. You take a sigh of relief knowing that everything is going to be okay but then you get hit in the head from behind and fall down. Everything is a blur but you are being tied to a chair. You then black out. You are awaken with cold water being splashed on you. You are tied to a chair in a dark room with two other people. They look as confused as you are and are struggling to unbound their hands. You see the cashier from earlier walking around the three of you. He says \"Let's play a small game, here is a revolver with three bullets. I'm going to give you guys 3 tries to gues a number 1 through 10 and if you fail well then you can figure out what's going to happen.\"\n\n");
printf("\nAll three of you guys are pleading for each others life but he responds \"Guess now or I'll just shoot you all.\"\n\n");
int gasNumberAnswer = 7;
int gasNumberGuess;
int gasTries = 0;
int gasTriesLimit =0;
// printf("What do you guys guess?\n");
// scanf("%d", &gasNumberGuess);
// while(gasNumberGuess != gasNumberAnswer)
while(gasNumberGuess != gasNumberAnswer && gasTriesLimit == 0)
{
if(gasTries < 3)
{
printf("\nWhat do you guys guess?\n");
scanf("%d", &gasNumberGuess);
gasTries++;
printf("You have %d guesses left.\n", 3 - gasTries);
}
else
gasTriesLimit = 1;
// printf("WRONG. GUESS AGAIN. \n");
// printf("You have %d guesses left.\n", 3 - gasTries);
}
if(gasTriesLimit != 0)
{
printf("\nThe cashier picks up his gun and shoots you all.\n\n GAME OVER.\n\n");
exit(1);
}
else
{
printf("\nHe says \"Wow I'm surprised you guys actually got it. But did you really think I would let you off?\" He picks up his gun and cocks it back. You close your eyes awaiting death. But the sirens of a police car are heard outside. The cashier puts away his gun and whispers \"Y'all better not make any noise.\" He then goes through a door that leads to the main room of the gas station. You hear converstation going on between the police officers and cashier. You start screaming for help and then you can hear the cashier and police officers start raising their voices. A couple of shots go off. The gas station is dead silent. \n Then the two police officers appear through the door but seems wounded. They untie everyone and escort them outside. \n Backup is arriving and everything seems to finally be okay. \n\n You survived.\n\n");
exit(1);
}
}
else if(decision4 == 2)
{
printf("\nYou drive past the gas station and continue driving into the unknown. Quite some time has passed but in the horizon you can see buildings. You are happy knowing you are almost in civilization. *POP* Your front passenger tire has blew out. You pull over to the side to try to fix it. You step out of the car and notice a cop car is pulling off the highway behind you. Maybe he can help. You wave towards the officers and try to signal that the tire blew out. You see the police man talking into his radio.\n\nHe steps out of his car with gun pulled and aimed at you. You have a confused look on your face and try to ask the officer \"What's wrong?\" But he doesn't give you an answer. \"Get on the ground\" he yells. You get on the ground with fear. He walks slowly towards you and handcuffs you.\n\n\"We got him!\" he says into his radio. Confusion takes over you as you don't know what he is talking about. You try to explain your situation to him but he tells you \"Shutup and be silent.\" He walks to the driver seat and pops open the trunk. He looks into the trunk with disgust.\n\nYou try to catch a peek into the trunk but it's out of sight. \"We got a body and some weapons\" he says into his radio.\n\n Do you\n 1. stay on the ground?\n 2. try to get up and runaway?\n\n");
scanf("%d", &decision4);
if(decision4 == 1)
{
printf("\nYou remain on the floor as more officers come to the area. You are found guilty of 1st degree murder due to the evidence found in the car and sentenced to death.\n\nThe last past weeks have been hell, sitting in a concrete room waiting for your death. Nothing you told them they would believe.\n\nTomorrow, is your last day.\n\nGAME OVER.\n\n");
exit(1);
}
else if(decision4 == 2)
{
printf("\nYou get an adrenaline rush, wiggle yourself up onto two feet and run full speed at the officer. He hits his head on the trunk and knocks him out. You find the handcuff keys and take off the handcuffs. You run off into the forest. You see buildings nearby after a couple of minutes of running. You made it into the city.\n\nYou survived.\n\n");
exit(1);
}
}
}
else if(decision4 == 2)
{
printf("\nYou stand to the side of the door. Getting ready to suprise attack the guy. He runs out a little but is confused on where you went. You lunge at him and tackle him to the floor. He is a equal match in strength and you are struggling to keep him down. You punch him in the face. He begins to try to reach for his hip and you notice he has a gun. You quickly try to stop his hand from grabbing it but it's too late, it's in his hands. You try your best to keep the gun pointed to the side but he gets a sudden burst of strength and overwhlems you. The gun is pointed at your face. BANG!\n\n");
printf("\nGAME OVER.\n\n");
exit(1);
// return EXIT_SUCCESS;
}
}
else if(decision4 == 2)
{
printf("\n\"Let go of her!\" you yell. The man throws her head to the floor. \"Who even are you?\" he snarls. \"Just someone that doesn't want to see someone get hurt\" you respond. \"It's a little too late for that unless you want to reverse time and save all the people that came before her\" he says. \"What do you want in exchange for her life?\" you ask him. \"Your life\" he demands. The woman has now began to regain consciousness. Frighten is wrtitten all over her face. You think for a couple of seconds about the decision.\n\n Do you\n 1. give up your life for her's?\n 2. let him take her life?\n\n");
scanf("%d", &decision4);
if(decision4 == 1)
{
printf("\n\"Wow how brave of you\" he chuckles. He picks her up and kicks her towards you. \"Scram! Tell anyone this and I'll hunt your whole linage down\" he screams. You walk towards him getting ready for your death. The woman is on the ground frozen in fear. You arrive infront of the man. You feel the cold metal of the pistol on your head. \"Your final words?\" he chuckles. You close your eyes embracing death knowing that you saved someone. You take a long breath in. The gun shot rings through the hallway. A body hits the floor. You open your eyes and see that the woman tackled the man down. They are now fighting each other strength to control the gun. You quickly jump in to help her. With her courage the both of you were able to take the gun off of the man. She takes the gun and shoots him once in each leg. The both of you leave the school out o breath. His car is parked in front and is running. The woman and you drive out of there to get help.\n\nYou survived.\n\n ");
exit(1);
}
else if(decision4 == 2)
{
printf("\n\"I figured you would, who would throw their life away for a nobody\" he says. He shoots two bullets in her head and then points it at you. \"You really thought you would live through this?\" he ask. You hear the sound of the gun and then you fade into nothingness.\n\nGAME OVER.\n\n");
exit(1);
}
}
}
else if(decision4 == 2)
{
printf("\nYou hide in the back of the classroom behind some desk. NOOO PLEASE DONT is heard from the hallway and then there is silence. You hear heavy footsteps from the hallway. You get ready for the situation if the door would swing open but it doesn't. The heavy footsteps get more distant then you hear the slam of a door.\n\n Do you\n 1. go out into the hallway since you believe it's safe?\n 2. do you continue to hide in the classroom.\n\n");
scanf("%d", &decision4);
if(decision4 == 1)
{
printf("\nYou walk into the hallway and see woman laying on the floor at the end of it. You run to her. You lay her onto her back and see that she is already dead. You immediately run towards the entrance of the school hoping to catch the person who did this to her. The door to the school is wide open. You peak out and see the man doing something in his trunk. His back is facing you. You decide to ambush him. You sneak up slowly and grab a rock while on your way to him. You swing with fury at his head. He hits the floor and blood begins to pour out from his head. You search his body for a phone and find one. You call 911. It takes awhile but they finally arrive.\n\nYou survived.\n\n");
exit(1);
}
else if(decision4 == 2)
{
printf("\nYou decide to hide a bit more. Quite some time has passed now and it's getting dark. You decide it's time to step out and see what has happened. A couple of wolves are hunched over what use to be a body. You step on a branch and make a noise that alerts the wolves. They snarl at you and creep slowly towards you. You start walking backwards, keeping your eye on them. You stumble over some debris and fall down. The wolves jump at you and start picking at you. You are their dinner tonight.\n\nGAME OVER.\n\n");
exit(1);
}
}
}
else if(decision4 == 2)
{
printf("\nYou open the door hoping it will take you to back to where you came from. As you open the door you are greeted with angelic voices singing. It's so white you can't even see a couple of feet in front of you. You take a few steps out and it all changes. Fire and stone replace the white all around. The angelic voices are replaced with screaming. YOU FOOL! is heard in the distance.\n Do you\n 1. venture into the dark stone path infront of you?\n 2. do you stay where you are at?\n\n");
scanf("%d", &decision4);
if(decision4 == 1)
{
printf("\nThe dark stone path is lit with fire scattered around it. Screaming and various noises can be heard in the distance but they seem to get closer with ever step taken. After about 10 mins of walking you arrive at a gate that reads WELCOME. It is wide open.\n\n Do you\n 1. enter?\n 2. do you go off the path and trying to find a different route?\n\n");
scanf("%d", &decision4);
if(decision4 == 1)
{
printf("\nYou see a huge castle infront of you. You walk towards it cautiously and feel like something is pulling you towards it. You get to the closed doors and knock. A man wearing a hoodie and sweatpants opens the door. \"Hello, would you like to come in?\" You agree and he guides you to the room on the left. He motions towards a big chair. You sit down and he sits in another chair across from you. \"What brings you here?\" he ask. \"I opened a door and was brought here\"you respond. \"Very well, I think I can get you back to where you came from\" he tells you. \"I would like that, how can you do that?\" you ask. \"Well, how lucky are you?\" he ask. \"Huh?\" you respond. \"Roll this dice\" he tells you. He hands you a black metal dice.\n\n Do you\n 1. roll the dice?\n 2. tell him no?\n\n" );
scanf("%d", &decision4);
if(decision4 == 1)
{
printf("\n\"Roll me a 6 in 6 tries and I'll return you to your world. But if you don't then I guess you will find out what happens. The odds are in your favor\" he says.\n\n");
int devilDiceRoll4;
int devilDiceRollTry;
while(devilDiceRoll4 != 6 || devilDiceRollTry > 6)
{
//for(i=0; i<6; i++)
//{
printf("\nYou shake the die in your hand and throw it on the table\n");
devilDiceRoll4 = rand()%6 + 1;
devilDiceRollTry++;
switch(devilDiceRoll4)
{
case 1:
printf("\nYou rolled a 1.\n\"Try your luck again. Come on it's not that hard just roll a 6.\"\n");
break;
case 2:
printf("\nYou rolled a 2\n\"Well maybe get two more twos and we got a deal.\"\n");
break;
case 3:
printf("\nYou rolled a 3\n\"Halfway there.\"\n");
break;
case 4:
printf("\nYou rolled a 4\n\"Yup that's a four.\"");
break;
case 5:
printf("\nYou rolled a 5\n\"Damn, your luck sucks.\"\n");
break;
case 6:
printf("\nYou rolled a 6\n\"Wow, you actually did it.\"");
break;
}
//}
}
if(devilDiceRoll4 == 6)
{
printf("\n\"Well, a deal is a deal. I guess you could make a bet with the devil. Have fun in the other hell.\" he says.\n\nYou survived.\n\n");
exit(1);
}
else
{
printf("\n\"Well, a deal is a deal. Take him away\" he commands to the air. A guard then appears out of thin air and drags you out of the house and to a treadmill where you will have to run for eternity.\n\nGAME OVER.\n\n");
exit(1);
}
}
else if(decision4 == 2)
{
printf("\n\"Hmmm well if you do not want to then we shall not. Take him away\" he commmands to the air. A guard then appears out of thin air and drags you out of the house and to a treadmill where you will have to run for eternity.\n\nGAME OVER.\n\n");
}
}
else if(decision4 == 2)
{
printf("\nYou decide to go off the path into the unknown. You walk cautiously into the darkness. The screaming is louder now. A very large person appears infront of you out of the darkness. You are frozen in terror as he towers over you. You decide to try to make a run for it but he grabs your arm before you can make your second step. He lifts you in the air by your arm. He begins to tear you limb by limb. You scream for help but no one is there to save you. You slowly start to fade out of conscious.\n\n");
printf("\nGAME OVER.\n");
exit(1);
// return EXIT_SUCCESS;
}
}
else if(decision4 == 2)
{
printf("\nYou decide to stay and sit in the area you arrived. Quite some time has passed and you are feeling exhausted. You decide to close your eyes and catch some sleep and hopefully you will have a solution to this when you awake.\n\n");
printf("\n\"*psssst* Wake up\" someone says in a whisper. You spring up, ready to take on whatever is around. You see a small person hunched over to the right of you. His face is slightly mangled and his clothes are tattered. \"Sorry, did not mean to frighten you.\" it says. \"Ah yes I apolgize. My name is Gevin\" it tells you. \"What brings you here?\" Gevin asks? \"A door. Not sure how it leads here but I just want to go back.\" you respond. \"Ahhhh-ha, another doorman. Well good thing I got the experience but it's quite the journey. Let's get going\" he tells you. Gevin motions to follow him as he hops forward. You follow him.\n\nYou have been following him for quite some time. He suddenly stops and turns around and tells you to be quiet. You see two large figures in the distance. They are guarding a portal that sparks with electricity every second.\n\n\"We aregoing to have to try to distract them and then you will into the portal which will get you back where you came from or some other place. I'm not sure I have not been through it.\" Gevin tells you. \"Well how are we going to distract them?\" you ask. \"Well I do not know but I got some stuff in my sack that can help\" he says as he opens a sack the size of a hand. He begins reaching in and starts pulling out weapons and various things. \"Pick your poison but do not pick the poison\" he tells you.\n\n");
printf("\n Do you\n 1. take the wood stick that has a crystal on the end of it?\n 2. take the sword and shield?\n 3. take the crystal clear ball?\n 4. take the bg rock?\n 5. take the poison\n 6. take the staff with a huge eye\n 7. throw Gevin out in the open and use him for distraction?\n\n");
scanf("%d", &decision4);
if(decision4 == 1)
{
printf("\nYou grab the wood stick with a crystal. \"That one shoots fire\" he says. You take aim and shoot some fire on the right side front of the guards. They are not bothered by it at all. \"Maybe shoot them\" he recommends. You aim at the guards and shoot the fire at them. They are not affected at all. But they notice you and start running at you. \"Welp, it's over for us\" he says. The guards come and rips the both of you limb by limb.\n\nGAME OVER.\n\n");
exit(1);
}
else if(decision4 == 2)
{
printf("\nYou grab the sword and shield. Gevin somehow pulls another one out of his bag equips himself with it. You nod at him, ready to charge at them. You scream \"GOOOO!\" and the both of you run full speed at the guards. There is a spark on the sword and shield and it transform Gevin and you into large warriors that easily tower over the guards. The guards prepare for the attack but yourguy's strength is too strong for them. You slice them in half with no effort. You can now enter the portal.\n\nYou survived.\n\n");
exit(1);
}
else if(decision4 == 3)
{
printf("\nYou grab the crystal clear ball. \"Just throw it and watch the show\" says Gevin. You throw the ball as far you can. It cracks on impact and a Chimera appears out of thin air. The guards are frightened by the creature but they run straight at it hoping to take it down. The portal is wide open to enter. Gevin says \"Farewell, doorman.\" You run to the portal while the guards are struggling to keep up with the Chimera\n\nYou survived.\n\n");
exit(1);
}
else if(decision4 == 4)
{
printf("\nYou grab the big rock. \"Well, goodluck with that\" he says. You throw it but it does not land that far infront of you. The guards notice that you threw the rock and begin running at you. \"Yeah, someone told me it did something. I guess they lied\" says Gevin. The guards grab the both of you and throw you into an eternal fire pit, where you will burn forever.\n\nGAME OVER.\n\n");
exit(1);
}
else if(decision4 == 5)
{
printf("\nYou grab the poison. \"Wait! Hold on.\" he tries to say. But you begin to melt due to coming in contact with the poison. You are now a puddle of liquid.\n\nGAME OVER.\n\n");
exit(1);
}
else if(decision4 == 6)
{
printf("\nYou grab the staff with a huge eye. \"Oh yeah that is a good one, hit the ground with it\" he tells you. You hit the ground with the staff and bubble forms around the both of you. You begin walking towards the guards and they notice and charge to attack you. They blow up instantly upon touching the bubble. \"This bubble pops you\" he says. You say your goodbye and enter through the portal.\n\nYou survived.\n\n");
exit(1);
}
else if(decision4 == 7)
{
printf("\nYou grab Gevin and throw him out in the open. \"Come on that is not cool!\" he screams. The guards charge at him. \"Damn it\" is his last words. The guards are distracted turning Gevin into mush, so you enter through the portal.\n\nYou survived.\n\n");
exit(1);
}
}
}
}
break;
}
case 5:
{
while(choice != 99)
{
puts("you open the door and find ........");
scanf("%d",&choice);
}
break;
}
case 6:
{
while(choice != 99)
{
}
break;
}
case 7:
{
/* Edwin Figueroa (RM #7)
*
* Scoped the variables locally to avoid conflicts with merge requests.
* I anticipated the potential other students would add/remove/revise key
* variables.
*
* I did however add the srand(time(NULL)) function in main.
*/
int enteredRoom = 0;
int chestLocked = 0; // 0 is locked, 1 is open.
char chestInventory[4][25] = {"a dead cricket", "an odd device", "a broken compass"};
char playerInventory[4][25] = {"", "", "", ""};
int count = 0;
char key[10] = {"an old key"};
int bottle = 3;
int arrLength = 0;
int oddDevice = 0;
while(oddDevice != 1)
{
if(enteredRoom == 0) {
puts("");
puts("You quickly grab the handle and open the 7th door. The water causes you to fall and forces you into the room. You immediately get to your feet and grab the door nob from the inside and turn it. It's jammed! Clearly the water must be forcing it closed.");
enteredRoom++;
}
if(bottle == 3) {
puts("You scan the room and find a large chest at the foot of an old bed. You also find a small table near the right side of the bed with a dusty old book and a bottle of rum. ");
}
else {
puts("You scan the room and find a large chest at the foot of an old bed. You also find a small table near the right side of the bed with a dusty old book. ");
}
puts("***********************************************");
puts("At this point you have 3 choices:");
puts("");
puts("1. Examine the chest.");
if(bottle == 3) {
puts("2. Approach the small table and examine the book next to the bottle of rum.");
}
else if(bottle > 0) {
puts("2. Have another swig of that bottle on the small table. Hell, you don't even notice the book right next to it at this point.");
}
else if (bottle == 0) {
puts("2. Approach the small table and examine the book.");
}
puts("3. Take a nap.");
puts("***********************************************");
puts("What do you choose?");
scanf("%d",&choice);
if(choice == 1)
{
if(chestLocked == 0) {
puts("");
puts("You walk over to the dark end of the room and approach the chest near the foot of the bed. It is made mostly of oak with broad iron bands reinforcing it. You jiggle the clasp but it appears to be locked.");
puts("");
}
else {
while(choice != 5) {
count = 0;
puts("");
puts("You unlock the chest with the old key and find the following within:");
puts("");
puts("***********************************************");
for(count; count < 3; count++) {
printf("%d. %s \n", count +1, chestInventory[count]);
}
puts("5. Close the chest.");
puts("Select an item in the chest to add it to your inventory, or simply close the chest [5].");
count = 0;
puts("");
puts("You have the following items in your personal inventory:");
for(count; count < 4; count++) {
printf("> %s \n", playerInventory[count]);
}
puts("***********************************************");
scanf("%d",&choice);
count = 0;
if(choice == 1) {
arrLength = strlen(chestInventory[0]);
for(count; count < arrLength; count++) {
playerInventory[0][count] = chestInventory[0][count];
chestInventory[0][count] = ' ';
}
}
else if(choice == 2) {
arrLength = strlen(chestInventory[1]);
for(count; count < arrLength; count++) {
playerInventory[1][count] = chestInventory[1][count];
chestInventory[1][count] = ' ';
}
oddDeviceShenanigans();
oddDevice = 1;
break;
}
else if(choice == 3) {
arrLength = strlen(chestInventory[2]);
for(count; count < arrLength; count++) {
playerInventory[2][count] = chestInventory[2][count];
chestInventory[2][count] = ' ';
}
}
}
}
}
else if(choice == 2)
{
if(bottle == 3) {
puts("");
puts("You approach the small table near the bed and pick up the book. It's a bit dusty with faded red lettering accross the cover. The title of the book is, 'Diary'.");
puts("");
puts("You open the book, and sift through the crumpled pages. It appears to be giberish full of what looks like complex equations and symbols. You turn to the last page and you see a sketch, maybe a schematic, of an odd looking device. At the header, the page reads, 'Odd Device!'. In the print below is a cryptic message:");
puts("");
puts("'Only this 'odd device' will get you out of here. But there is huge risk in using it, so I locked it away.'");
puts("");
puts("After reading the book, you grab the bottle of rum, pop the cork and take a huge swig! Cuz, why not.");
puts("");
}
else {
puts("");
}
if (chestLocked == 1) {
puts("");
puts("Other than the old book you've already read, there's nothing else here of interest.");
puts("");
}
else {
puts("");
}
// Random drunk behavior!
x = drunkBehavior();
if(bottle > 0) {
if(bottle == 3) {
puts("Ahhh! Good stuff. You have a compelling desire for another drink. Maybe you have a problem. Have another!");
bottle--;
}
else if(bottle == 2) {
puts("Mmm, this must be spiced rum. You can't resist another drink.");
bottle--;
}
else if(bottle == 1) {
puts("That was good! *hiccup* Take another!");
bottle--;
}
else {
puts("The bottle is empty.");
}
}
if (bottle != 0 && x <= 3) {
puts("The booze is definately hitting you.");
puts("");
puts("You stuble around the room a bit... *Now* it's a party!");
}
else if ((bottle != 0) && ((x == 4) || (x == 5) || (x == 6))) {
puts("");
puts("*hiccup* You dance around the room a bit, stumble to the floor. You dust yourself off and begin singing a song.");
puts("");
puts("You contemplate your drinking problem. BAH! Take another swig!");
puts("");
}
else if ((bottle != 0) && (x > 6)) {
puts("");
puts("Woah, you struggle to maintain your balance. You begin to see double. Hey wait, is that a second door?!?!");
puts("");
puts("Nah, it can't be... You are seriously drunk.");
puts("");
}
else if (bottle == 0) {
puts("");
puts("Damn! The rum is powerful stuff. You begin to feel dizzy. Things begin to get really fuzzy, you mumble, 'barteeeender *hicuup* make it a double'.");
puts("");
puts("....a day passes....");
puts("");
puts("Your eyes slowly open. Wow, what a headache! Slowly things come into focus. You realize you are laying on the floor near the side of the bed. Under the bed you can see the empty bottle tipped over. Something near it catches your eye.");
puts("");
puts("Next to the bottle you see a small rusted looking key.");
puts("");
bottle = 0;
count = 0;
arrLength = 10;
for(count; count < arrLength; count++) {
playerInventory[3][count] = key[count];
}
chestLocked = 1; //unlocked
}
}
else if(choice == 3)
{
puts("");
puts("It's been a long day. *yawn* After an hour or so of sleep, something wakes you up! Oh yes! There's an unexplained flood in the room outside of your jammed door.");
puts("");
puts("You jump out of bed, with a clearer mind. The rest did you well. You vaguely recall a dream about having read the dusty old book on the table next to you.");
puts("");
}
else
{
puts("wrong choice");
puts("");
}
}
break;
}
case 8:
{
while(choice != 99)
{
puts("Erick Vargas' Door\n"); //I'll remove this once we submit the final product, it's just a reminder for me
puts("You enter door 8 and you find yourself on a tropical island. You see a small group of people running around collecting materials, what do you do?\n");
printf("1) Introduce yourself 2) Ask where you are 3) Just watch them 4) Ignore them 5) Try to avoid them\n");
scanf("%d",&choice);
switch(choice)
{
case 1:
{
while(choice != 99)
{
puts("You walk up to them and introduce yourself to them, they happily greet you and introduce themselves to you. They ask where you are from, how do you respond?\n");
printf(" choose \n"); //prompt choices about how to answer.
scanf("%d",&choice);
}
break;
}
case 2:
{
while(choice != 99)
{
puts("You walk up to them and ask where you are, they look at you confusingly and tell you that the island your on is named Destiny Island. Still looking confused they ask where you came from, how do you respond?");
printf(" choose \n"); //prompt choices about how to answer.
scanf("%d",&choice);
}
break;
}
case 3:
{
while(choice != 99)
{
puts("From a distance you stay watching them, you just see that they continue running around collecting materials for some reason. As you keep watching them you notice that once they huddled up the girl of the group starts marking off on a checklist. You start to wonder more what they're trying to do, what do you do?");
printf(" choose \n"); //prompt choices about what to do.
scanf("%d",&choice);
}
break;
}
case 4:
{
while(choice != 99)
{
puts("You decide to just ignore them, what do you do instead?");
printf(" choose \n"); //prompt choices about what to do instead
scanf("%d",&choice);
}
break;
}
case 5:
{
while(choice != 99)
{
puts("Panicked, you decide to hide from them. Where do you choose to hide?");
printf(" choose \n"); //prompt choices of where to hide
scanf("%d",&choice);
}
break;
}
}
break;
}
}
case 9:
{
while(choice != 99)
{
puts("you open the door and find ........");
sleep(1);
puts("A small control room of some sort.");
sleep(1);
puts("Two doors on opposite ends of the room.");
sleep(1);
puts("The lights are dim, going off and on spontaneously.");
sleep(1);
puts("Several monitors broken and smashed in.");
sleep(1);
puts("You see a particular monitor that catches your eye.");
sleep(1);
woman();
sleep(2);
puts("!!!");
sleep(1);
puts("A young woman?");
sleep(1);
puts("Looks as if she's been in containment for a long time.");
sleep(1);
bYellow();
puts("*SLAM*");
reset();
sleep(1);
puts("A security door emerges and closes behind you.");
sleep(1);
puts("It's locked.");
sleep(1);
bRed();
puts("\nEMERGENCY EMERGENCY");
sleep(1);
puts("BOMB HAS BEEN SET OFF");
sleep(1);
puts("WARNING EXTREMELY SENSITIVE!");
sleep(2);
reset();
puts("Theres a giant piece of machinery with a big screen above.");
sleep(2);
puts("\t [ ] [2] [3] [4] [5] [6] [ / [8] [9]");
sleep(2);
puts("The 1 and 7 keys seem non functional.");
sleep(2);
puts("Theres a note next to the machine.");
sleep(2);
puts("Input 9 numbers, they must add to exactly 37.");
sleep(3);
bYellow();
puts("You have 45 seconds.");
reset();
begin = time(NULL);
while(counter < 9 )
{
scanf("%d",&choice);
if(choice < 1 || choice > 9)
{
puts("That button doesn't exist.");
}
else
{
if(choice == 1)
{
if(oneusage == 0)
{
rando = 29 + rand()%10;
rando2 = 5 + rand()%30;
rando = rando - rando2;
bYellow();
printf("%d\n",rando);
score = rando;
puts("The number is flashing on screen.");
puts("Seems it replaced my current score.");
counter++;
displayInputs(counter);
oneusage++;
reset();
}
else
{
reset();
puts("The [1] button appears to be broken.");
puts("It doesn't work.");
puts("It doesn't appear to have read any input.");
}
}
else if(choice == 7)
{
if(oneusage == 0)
{
displayStats(counter,score);
reset();
puts("Seems no input has been added from this button");
reset();
oneusage++;
}
else
{
reset();
puts("Nothing happened.");
}
}
else
{
bGreen();
puts("Ding");
reset();
score = score + choice;
counter++;
}
}
}
end = time(NULL);
timetaken = (double)(end - begin);
bYellow();
printf("Time Took %ld seconds \n",(end - begin));
displayStats(counter, score);
reset();
if(timetaken < 45)
{
if(score == 37)
{
bGreen();
puts("Bomb Deactivated.");
bBlue();
sleep(1);
puts("*sigh*.");
sleep(2);
puts("I live to see another day...");
sleep(1);
reset();
puts("The woman has a relieved expression on her face.");
sleep(1);
puts("You see a release latch to unlock her cell door.");
sleep(1);
puts("Release Latch? (1)Yes (2)No");
choice = 0;
while(choice < 1 || choice > 2)
scanf("%d",&choice);
if(choice == 1)
{
puts("You released the latch.");
sleep(2);
bBlue();
puts("We have to go NOW! she exclaims!");
sleep(2);
reset();
puts("The other door opened, its an elevator.");
sleep(1);
puts("You go in with the young lady and immediately the Elevator goes straight down really fast.");
sleep(2);
puts("It's stopped.");
sleep(1);
puts("The doors open, we see civilization.");
sleep(1);
puts("What the hell was that place?");
sleep(1);
puts("Ask her what was that place?(1) Say Goodbye(2)");
choice = 0;
while(choice < 1 || choice > 2)
scanf("%d",&choice);
if(choice == 1)
{
puts("What Happened?");
sleep(1);
bBlue();
puts("I was a hostage, a ransom that my family couldn't pay.");
sleep(1);
puts("They were going to blow me up along with that whole lab.");
sleep(1);
puts("You just happened to stumble by at the right time.");
sleep(1);
puts("Talk about dumb luck haha.");
reset();
sleep(2);
puts("Who's they?");
sleep(2);
puts("She immediately put her face to my ear and whispered.");
sleep(2);
bBlue();
printf("\nt");
printf("h");
printf("e");
printf(" ");
sleep(1);
printf("c");
sleep(1);
printf("u");
sleep(1);
printf("l");
sleep(1);
printf("t\n");
sleep(2);
puts("My family were members and I wanted out and..");
sleep(2);
reset();
puts("I decided to help her get out of town.");
sleep(1);
puts("After a long process of hiding and changing ID's and a few cosmetic surgeries.");
sleep(1);
puts("I got her a plane ticket outside of the state where cult activity was most prominent.");
sleep(1);
puts("It was time for her to go.");
sleep(1);
puts("I waved bye at the airport.");
sleep(1);
puts("She turns to me.");
congratulations();
puts("END");
}
else if(choice == 2)
{
puts("You wave bye as you leave.");
sleep(2);
puts("You think to yourself it's not worth the trouble to know or get involved any further.");
sleep(2);
puts("You go home and take a nice long nap.");
sleep(1);
puts("END");
}
}
else if(choice == 2)
{
puts("You decided not to release the latch but instead only unlock the other door.");
sleep(2);
bBlue();
puts("NOOO!!");
sleep(1);
puts("LET ME OUT PLEASE!!");
sleep(2);
reset();
puts("The door opens, it's an elevator.");
sleep(1);
puts("You go in.");
sleep(2);
puts("You go down and exit outside a building.");
sleep(1);
puts("What was that place? you ponder.");
sleep(2);
puts("You think, it doesn't matter as long as I'm free.");
sleep(2);
puts("Along the way home you justify your actions.");
sleep(2);
puts("What if she was dangerous? I couldn't put myself at risk for a stranger. I'm glad I left her.");
sleep(2);
puts("You make it home safe.");
sleep(2);
puts("But can't shake the feeling you were being followed.");
sleep(1);
puts("END");
}
choice = 99;
}
else
{
reset();
puts("BOOM!");
sleep(1);
bRed();
puts("You Are Dead.");
choice = 99;
}
}
else
{
reset();
puts("Took too long.");
sleep(1);
puts("The bomb was set off.");
sleep(1);
bRed();
puts("You are Dead.");
choice = 99;
}
}
break;
}
case 10:
{
while(choice != 99)
{
char ans = 'Y';
int count=0;
int total=0;
int prize[4]={1000000,1000,100,10};
srand(time(NULL));
do
{
int myNum[3];
int winNum[3]= {rand()%10,rand()%10,rand()%10};
int die = 1 + rand()%6;
int death = 1 + rand()%6;
int roll;
bool checkNum1;
bool checkNum2;
bool checkNum3;
puts("\nYou open the door and find ...");
puts("A lottery machine?");
puts("Welcome to Fabian's room");
printf("Enter the lottery by entering three numbers. Each 1 digit\n");
scanf(" %d %d %d",&myNum[0],&myNum[1],&myNum[2]);
printf("Your numbers are: %d, %d, %d\n",myNum[0],myNum[1],myNum[2]);
printf("The winning lottery numbers are: %d, %d, %d\n",winNum[0],winNum[1],winNum[2]);
if(myNum[0]==winNum[0] || myNum[0]==winNum[1] || myNum[0]==winNum[2])
{
checkNum1= true;
}
else
{
checkNum1=false;
}
if(checkNum1)
{
if (myNum[0]==winNum[0])
{
winNum[0]=420;
}
else if (myNum[0]==winNum[1])
{
winNum[1]=420;
}
else
{
winNum[2]=420;
}
}
if(myNum[1]==winNum[0] || myNum[1]==winNum[1] || myNum[1]==winNum[2])
{
checkNum2= true;
}
else
{
checkNum2=false;
}
if(checkNum2)
{
if (myNum[1]==winNum[0])
{
winNum[0]=420;
}
else if (myNum[1]==winNum[1])
{
winNum[1]=420;
}
else
{
winNum[2]=420;
}
}
if(myNum[2]==winNum[0] || myNum[2]==winNum[1] || myNum[2]==winNum[2])
{
checkNum3= true;
}
else
{
checkNum3=false;
}
if(checkNum3)
{
if (myNum[2]==winNum[0])
{
winNum[0]=420;
}
else if (myNum[2]==winNum[1])
{
winNum[1]=420;
}
else
{
winNum[2]=420;
}
}
if(checkNum1 && checkNum2 && checkNum3)
{
if(myNum[0]==winNum[0] && myNum[1]==winNum[1] && myNum[2]==winNum[2])
{
puts(" ##### # ### ### ### ### ### ### ### ### ### ");
puts("# # # ## # # # # # # # # # # # # ### ### ### ");
puts("# # # # # # # # # # # # # # # # ### ### ### ");
puts(" ##### # # # # # # # # # # # # # # # # ");
puts(" # # # ### # # # # # # ### # # # # # # ");
puts("# # # # ### # # # # # # ### # # # # # # ### ### ### ");
puts(" ##### ##### # ### ### ### # ### ### ### ### ### ### ");
puts(" # # ");
puts("");
printf("You've hit the jackpot of 1,000,000!\n");
puts("WOW! incredible luck there buddy!");
total = total + prize[0];
}
else
{
printf("You won $1,000\n");
puts("Go pay some bills of now!");
total = total + prize[1];
}
}
else if ((checkNum1 && checkNum2 || checkNum1 && checkNum3) || (checkNum2 && checkNum3))
{
printf("You've won $100\n");
printf("Go treat your mom to some lunch.");
total = total + prize[2];
}
else if (checkNum1 || checkNum2 || checkNum3)
{
puts("You won $10");
puts("You won a little bit of money but at least it's something right?");
total = total + prize[3];
}
else
{
printf("You won nothing...\n");
puts("Because you won nothing, you now have to roll a die to determine your fate...");
puts("Please choose a number from 1-6.If you roll your chosen number you are safe");
puts("if you don't there's a 1 in 6 chance you will die.");
puts("Please choose a number within the limits or it's automatic death");
scanf(" %d",&roll);
if (die==roll)
{
puts("\"You precede to roll your die in hopes you get a number in your favor\"");
printf("You rolled a %d\n",die);
printf("You are safe to live!");
}
else if(die== death || roll>6)
{
if(die==death)
{
puts("\"You precede to roll your die in hopes you get a number in your favor\"");
printf("You rolled a %d\n",die);
}
puts(" ______ _______ _______ _______ __ __ ");
puts("| | | || _ || || | | |");
puts("| _ || ___|| |_| ||_ _|| |_| |");
puts("| | | || |___ | | | | | |");
puts("| |_| || ___|| | | | | |");
puts("| || |___ | _ | | | | _ |");
puts("|______| |_______||__| |__| |___| |__| |__|");
puts("");
puts("");
puts(" ██████╗ █████╗ ███╗ ███╗███████╗ ██████╗ ██╗ ██╗███████╗██████╗ ██╗");
puts("██╔════╝ ██╔══██╗████╗ ████║██╔════╝ ██╔═══██╗██║ ██║██╔════╝██╔══██╗ ██║");
puts("██║ ███╗███████║██╔████╔██║█████╗ ██║ ██║██║ ██║█████╗ ██████╔╝ ██║");
puts("██║ ██║██╔══██║██║╚██╔╝██║██╔══╝ ██║ ██║╚██╗ ██╔╝██╔══╝ ██╔══██╗ ╚═╝");
puts("╚██████╔╝██║ ██║██║ ╚═╝ ██║███████╗ ╚██████╔╝ ╚████╔╝ ███████╗██║ ██║ ██╗");
puts(" ╚═════╝ ╚═╝ ╚═╝╚═╝ ╚═╝╚══════╝ ╚═════╝ ╚═══╝ ╚══════╝╚═╝ ╚═╝ ╚═╝");
puts("\nThe game will now exit. Better luck next time!");
if(roll>6||roll<1)
{
puts("I warned you about not choosing a number within the limits");
}
choice = 99;
count++;
break;
}
else
{
puts("\"You precede to roll your die in hopes you get a number in your favor\"");
printf("You rolled a %d\n",die);
puts("");
puts("Oof, that was a close one. You may not have one the lottery, ");
puts("but you at least get to leave with your life.");
}
}
printf("You have earned a total of %d so far\n",total);
printf("Would you like to try again at the lotto? Maybe you can win more money(Y/N)\n");
scanf(" %c",&ans);
ans=toupper(ans);
}
while (ans=='Y');
if(count<=0)
{
printf("Okay, go into the elevator and choose a new room\n");
scanf("%d",&choice);
}
}
}
case 11:
{
while(choice != 99)
{
puts("you open the door and find 3 more doors.");
puts("On the left there is a door with a Skull and Bones. In the middle the door has an Angel. On the right it has no symbol.\n");
puts("1. Open the Skull and Bones door. \n2. Open the Angel door. \n3. Open the no symbol door.\n");
scanf("%d", &choice);
if(choice == 1){
puts("You proceed to open the door with Skull and Bones on it.\n");
printf("A skeleton stands before you. \n'Hello %s would you like to play a game?'\nThe door behind you disappears so its not like you have a choice to say no...so you agree to play without knowing what kind of game.\n",name);
puts("[Skeleton]: Wonderful! Choose a hand *Giant Grin on his face*\n");
puts("1. Left \n2. Right\n");
scanf("%d", &choice);
if(choice == 1){
puts("[Skeleton]: *Laughs* Excellent choice. If you chose the other hand your soul would have been mine\n");
puts("[Skeleton]: Now lets play one final game. You can roll this 100 sided die and if you get anything higher than 55 you can leave here with a million dollars. Or you can walk through that door *Skeleton points to a new door as it rises from the ground*\n");
puts("1. Roll the die. \n2. Open the door\n");
scanf("%d", &choice);
if(choice == 1){
puts("[Skeleton]: *Evil Laughs* You have chosen the right path so far. However, I never told you what happens if you get anything below 55. If you land below 55 you have to stay here for the rest of your life guarding this door and I will finally be free! \n");
puts("Ready to roll?\n1. Yes\n2. No");
scanf("%d", &choice);
puts("[Skeleton]: Ahh who cares not like you have a choice! *Rolls die*\n");
srand(time(NULL));
int roll = rand()%100;
printf("%d\n",roll);
if(roll>55){
puts("Congrats you are free to exit out that door\n");
puts("\n The door just leads you straight to where you started\n");
break;
}else{
puts("[Skeleton]: Finally I'm free!");
puts("You are not stuck in this room for eternity...");
choice = 99;
break;
}
}else if(choice == 2){
puts("[Skeleton]: Did you really think I would let you live?");
puts("You have died to a Skeleton \n");
break;
}
}else if (choice == 2){
puts("[Skeleton]: Thank you for playing. *He puts his hand over your head*\n");
puts("You have died try again!\n");
break;
}
}else if(choice == 2){
puts("You proceed to open the door with an Angel on it.\n");
puts("Welcome! You need to guess the following word or you can't come to heaven.\n");
puts("You can not get 1 letter wrong or you lose \n");
puts("What is yellow and can be found in water?\n");
char answer[20] = {'d', 'u','c','k'};
char guess[20];
int x = 0;
char letter;
while (x < 6){
scanf(" %c",&letter);
if (letter == answer[x]){
guess[x]= letter;
printf("keep going\n");
if(letter == 'k'){
puts("Congrats you guess the correct word: DUCK!\n");
break;
}
}else{
printf("You failed sorry!\n");
printf("\n");
break;
}
++x;
}
break;
}else if(choice == 3){
puts("You proceed to open the blank door.\n");
puts("You enter the room and its filled with clocks. Every clock instantly stops ticking and your vision slowly fades to black. You close your eyes hoping you get your vision back, but you open them and you are no longer in the room. Instead you you are placed straight back to where you started with the option to choose any room.");
break;
}
}
break;
}
case 12:
{
while(choice != 99)
{
puts("you open the door and find you've entered room 12........\n");
char response, temp; //char variables needed for game to work
{
printf("Since you're here and brave, will you take a chance and play a game of cards? Enter 'y' twice for yes or '99' to leave at any time...\n");
response = getchar(); //set response to equal user's input
temp = getchar(); //set temp value to equal user's input
if(response == 'y' || response == 'Y') //if answer is equal to letter 'y' or 'Y'...
{
gameRules(); //simple function that prints game rules for user before game begins
gameCraps(); //calls main game function
}
else if(response == 99) //had issues modifying this code to run no...using escape 99 for now to to exit game...
{
puts("You don't want to play, but you'll be back. Goodbye for now... >:D");
break;
}
}
scanf("%d", &choice); //scan in user's input for choice...
}
break;
}
case 13:
{
while(choice != 99)
{
srand(time(NULL));
int mn = 3;
int response;
int fish = 1 + rand()%10;
int a,b,c,d,f;
while(choice != 99)
{
puts("As your hand reaches for the 13th door you think about all the superstitions related to the number 13.");
puts("However, you open it anyways and you find yourself in a large dark room that is immedietly cold and nothing is visible.");
puts("Although the room is pitch black you cant even see your hands, you stop and look to your right when something catches your eye.");
puts("A samll bright light is floating in the distance, close enough to see but far enough to not be able to know what it is.");
puts("Do you walk towards the light or do you wak in the opposite direction.");
puts("1. Walk towards the light.");
puts("2. Walk in the other direction.");
scanf("%d",&choice);
if(choice == 1)
{
puts("feeling curious you walk towards the light.");
puts("As your walking, the light gets brighter and slowly getting closer until you feel a sudden rush of cold air on your left shoulder.");
puts("You look over and see a ghost like hand resting on your shoulder");
printf("It whispers into your ear with a low grungy voice \"%s turn around, I can give you anything you want \" \n",name);
puts("Do you turn around or keep walking towards the light?");
puts("1. Continue walking towards the light.");
puts("2. Turn around and face this mysterious voice");
scanf("%d", &choice);
if(choice == 1)
{
puts("Overcoming your curiosity once more, you continue walking towards the light,");
puts("As you get closer to the light you can now see a forest and wonder if this is the way out.");
puts("You continue walking to what you believe to be a forest disregarding the voice behind you.");
puts("As you enter the light a bright white flash obscures your vision.");
puts("You can now see a small semi-transparent green orb on a tree stump.");
puts("Do you pick it up or smash it with a nearby plank of wood");
puts("1. Pick it up.");
puts("2. Smash it.");
scanf("%d", &choice);
if(choice == 1)
{
puts("You pick it up an begin to feel your body tense, this feeling of tiny needles around your entire body.");
puts("Your vision goes dark.");
puts("The feeling of rising water surrounds you and when you open your eyes you realize you are back in the first room you started.");
break;
}
else if(choice == 2)
{
puts("You grab a nearby plank of wood and step towards the orb.");
puts("With a mighty swing, you manage to smash the orb into small shards of glass, and as you do.");
puts("Your vision goes dark.");
puts("The feeling of rising water surrounds you and when you open your eyes you realize you are back in the first room you started.");
}
break;
}
else if(choice == 2)
{
puts("as you turn around and face this unknown entity, the ghoslty figure is now facing you.");
puts("With the bit a of light the creature reveals its self and you see a hunched hooded humanoid figure.");
puts("It has a sad zombie like face with a large mouth hanging low to its chest.");
puts("This creature has no eyes and in its gaping mouth nothing but a void of darkness. As you stare at this creature your mind and body go blank unable to think or move.");
puts("This creature has now taken over your body and the fear of never getting out overtakes you. Your are Dead.");
exit(0);
}
}
else if(choice == 2)
{
puts("Not knowing what this light could be you decide to turn around and head deeper into the unknown darkness.");
puts("You continue walking and stumble upon a conviently placed falsh light that can now help you see.");
puts("As you continue walking to come across a monolith that speaks to you in a loud deep voice, it asks you to guess a number between 1 through 10 if you want to survive.");
printf("Enter a number between 1 through 10\n");
scanf("%d", &response);
while(response < 1 || response > 10)
{
printf("NO!! A number between 1 through 10\n");
scanf("%d",&response);
}
printf("%d + magic number = %d\n",response,(response + mn));
printf("%d * magic number = %d\n",response,(response * mn));
printf("%d - magic number = %d\n",response,(response - mn));
printf("What is your guess? It says.\n");
scanf("%d",&response);
if(response == mn)
{
printf("You are correct! The monolith begins to glow with no issues.\n");
}
else
{
printf("NO, wrong number inferior human\n");
printf("A beam of light emits from the monolith which vaporizes you. \n");
printf("Only your boots remain. You Are Dead.\n");
exit(0);
}
puts("No you cant out smart me simple human");
puts("Fine then, lets see if you can figure this out HAHAHA");
printf("There is a tank of fish that can only hold 12 fish. At the moment it is empty\n");
printf("for every red fish there can be only 1 blue fish\n");
printf("but if there is more than 1 blue fish no yellow fish can be in the tank\n");
printf("The number of green fish in the tank can be any number\n");
printf("There are %d red fish\n", a = rand()%10);
printf("There are %d blue fish\n", b = rand()%10);
printf("There are %d green fish\n", c = rand()%10);
printf("There are %d yellow fish\n", d = rand()%10);
printf("How many fish will fit in this tank\n");
scanf("%d",&response);
if(response == (12))
{
puts("Dammit, you are smarter than you look human\n");
puts("The room begins to shake as the monolith in front of you begins to open up. Revealing a secret tunnel.\n");
puts("UGH FINE you win\n");
puts("The monolith glows and turns in to a man in a black tuxedo and black sunglasses\n");
puts("He pulls out pen from his coat pocket and with out telling you he points it towards you and it flashes\n");
puts("You now find your self back in your home sitting at your computer not knowing how you got there\n");
puts("However this person sitting down looks familiar, ITS YOU.\n");
puts("You only see yourself for a few minutes before that person is sucked into the computer\n");
puts("It takes a moment for you to compose yourself but you sit back down on your chair close the game and never return to it.");
puts("Although you cant shake the feeling of someone watching you, the presence of someone is always behind you but everytime you turn they are gone.");
printf("At this point, the computer you shutdown turns back on and displays \"Thank you for playing %s, Good Bye................................for now\" \n",name);
exit(0);
}
else
{
printf("Haha The answer was 12, only 12 fish can fit in the tank, your nothing but a simple human\n");
printf("A beam of light emits from the monolith which vaporizes you. \n");
printf("Only your boots remain. You Are Dead.\n");
exit(0);
}
break;
}
else
{
puts("Wrong choice");
}
}
break;
}
break;
}
case 14:
{//Velasco,Jesse
srand(time(NULL));
//Room 1
//Magic Number
int mn = 7;
//Universal Response variable
int response;
//Room 2
int ClassScores = 1 + rand()%10;
int a,b,c,d,f;
//Room 3
int counter = 0;
int one,two,three,four,five,six;
int number = 0;
int guess = 0;
while(choice != 99)
{
printf("Desperately.You push door 14 open\n");
printf("Once inside you bear your entire weight against the door to slam it shut.\n");
printf("Recuperated you look around to find a door with an inscription attached to it via a wooden tablet fixated above the archway\n");
printf("Its a game.\n");
printf("Guess the magic number and you'll be allowed passage. Fail.Passage to the underworld will be granted instead\n");
printf("Welp.Time to take your shot.Good luck.\n");
printf("Enter a number between 1 and 10\n");
scanf("%d", &response);
while(response < 1 || response > 10)
{
printf("Please enter a number between 1 and 10 inclusively\n");
scanf("%d",&response);
}
printf("%d + magic number = %d\n",response,(response + mn));
printf("%d * magic number = %d\n",response,(response * mn));
printf("%d - magic number = %d\n",response,(response - mn));
printf("What is your guess? It states.\n");
scanf("%d",&response);
if(response == mn)
{
printf("You are correct! The door opens. You pass through with no issues.\n");
}
else
{
printf("Oh no. You guessed wrong.\n");
printf("The ceiling begins to lower. Looks like its game over.\n");
printf("Thanks for playing!\n");
exit(0);
}
//Room 2
printf("You enter an empty classroom.\n");
printf("A monitor begins to lower from the ceiling.\n");
printf("\"Samsung\" you notice. Nice.\n");
printf("On the screen a grading scale is shown.\n");
printf("A = 4.0, B = 3.0, C = 2.0, D = 1.0,F = 0\n");
printf("There are %d A's\n", a = 1 + rand()%10);
printf("There are %d B's\n", b = 1 + rand()%10);
printf("There are %d C's\n", c = 1 + rand()%10);
printf("There are %d D's\n", d = 1 + rand()%10);
printf("What is the average?\n");
scanf("%d",&response);
if(response == ((a*4) + (b*3) + (c*2) + (d*1) + (f*0)))
{
printf("Like a teacher you graded it! Nice job!\n");
printf("The room walls begin to shake as the one in front of you begins to open up. Revealing a secret tunnel.\n");
printf("You push on.\n");
}
else
{
printf("Looks like this is where you dropout.\n");
printf("Thanks for playing!\n");
exit(0);
}
//Room 3 HAS BUG
printf("As you exit the tunnel you find yourself in a casino\n");
printf("Oddly enough there is only one table with a single seat directly ahead of you.\n");
printf("You approach the table cautiously. The dealer says \"Do not be afraid. I will only take what you are willing to give\" he laughs. Try your luck.\n");
printf("The game is simple. Pick a number and guess the number of times that number will be rolled. The die will be rolled 10 times.\n");
printf("\"What are you willing to bet?\" asks the dealer.\n");
printf("Having nothing of value you bet what you have. Your life. A true gambler at heart.\n");
printf("\"Very well. I accept your bet. \"\n");
for(int i = 0 ; i < 10 ; i++)
{
counter = 1 + rand()%6;
switch(counter)
{
case 1:
one += 1;
break;
case 2:
two += 1;
break;
case 3:
three += 1;
break;
case 4:
four += 1;
break;
case 5:
five += 1;
break;
case 6:
six += 1;
break;
}
}
printf("Now state the number you would like to bet on between 1 and 6.\n");
scanf("%d",&number);
if(number < 1 || number >6)
{
printf("Please pick a number between 1 and 6 for your bet.\n");
scanf("%d",&number);
}
switch(number)
{
case 1:
printf(" Now guess how many times that number has been rolled. You have a rage of 1 above and below the number. Good luck!\n");
scanf("%d",&guess);
if(guess >= (one - 1) || guess <= (one + 1))
{
printf("Your guess: %d\n", guess);
printf("# of rolls: %d\n",one);
printf("You win! You get to keep your life ,and get passage on.\n");
}
else
{
printf("I'm afraid you'll be cashing out now.\n");
printf("Thanks for playing!\n");
exit(0);
}
case 2:
printf(" Now guess how many times that number has been rolled. You have a rage of 1 above and below the number. Good luck!\n");
scanf("%d",&guess);
if(guess >= (two - 1) || guess <= (two + 1))
{
printf("Your guess: %d\n", guess);
printf("# of rolls: %d\n",two);
printf("You win! You get to keep your life ,and get passage on.\n");
}
else
{
printf("I'm afraid you'll be cashing out now.\n");
printf("Thanks for playing!\n");
exit(0);
}
case 3:
printf(" Now guess how many times that number has been rolled. You have a rage of 1 above and below the number. Good luck!\n");
scanf("%d",&guess);
if(guess >= (three - 1) || guess <= (three + 1))
{
printf("Your guess: %d\n", guess);
printf("# of rolls: %d\n",three);
printf("You win! You get to keep your life ,and get passage on.\n");
}
else
{
printf("I'm afraid you'll be cashing out now.\n");
printf("Thanks for playing!\n");
exit(0);
}
case 4:
printf(" Now guess how many times that number has been rolled. You have a rage of 1 above and below the number. Good luck!\n");
scanf("%d",&guess);
if(guess >= (four - 1) || guess <= (four + 1))
{
printf("Your guess: %d\n", guess);
printf("# of rolls: %d\n",four);
printf("You win! You get to keep your life ,and get passage on.\n");
}
else
{
printf("I'm afraid you'll be cashing out now.\n");
printf("Thanks for playing!\n");
exit(0);
}
case 5:
printf(" Now guess how many times that number has been rolled. You have a rage of 1 above and below the number. Good luck!\n");
scanf("%d",&guess);
if(guess >= (five - 1) || guess <= (five + 1))
{
printf("Your guess: %d\n", guess);
printf("# of rolls: %d\n",five);
printf("You win! You get to keep your life ,and get passage on.\n");
}
else
{
printf("I'm afraid you'll be cashing out now.\n");
printf("Thanks for playing!\n");
exit(0);
}
case 6:
printf(" Now guess how many times that number has been rolled. You have a rage of 1 above and below the number. Good luck!\n");
scanf("%d",&guess);
if(guess >= (six - 1) || guess <= (six + 1))
{
printf("Your guess: %d\n", guess);
printf("# of rolls: %d\n",six);
printf("You win! You get to keep your life ,and get passage on.\n");
}
else
{
printf("I'm afraid you'll be cashing out now.\n");
printf("Thanks for playing!\n");
exit(0);
}
}
printf("To be cont.\n" );
}
break;
}
case 15:
{
while(choice != 99)
{
}
break;
}
case 16:
{
while(choice != 99)
{
}
break;
}
case 17:
{
while(choice != 99)
{
puts("you open the door and find ........");
scanf("%d",&choice);
}
break;
}
case 18:
{
int dialouge = 0;
int option = 0;
int fin = 0;
int kHP=1;
int pHP=5;
while(choice != 99)
{
puts("you open the door and seem safe from the previous... ");
puts("you find a kitten in the room, along with some empty cabinets, and another door\n");
puts("With this you are left with some options, 3 to be exact:");
puts("1. Pet the kitten");
puts("2. Examine the room");
puts("3. Open the next door");
scanf("%d",&choice);
switch (choice)
{
case 1:
if(fin==0)
{
puts("you get closer to pet the kitten... IT SCRATCHED YOU");
puts("********** BATTLE START ******************");
while(pHP>1 && fin == 0)
{
printf("Kitten HP=%d", kHP);
printf(" Player HP=%d \n", pHP);
puts("*** 1. Attack 2. Defend 3. Give Up ***");
scanf("%d", &option);
switch(option)
{
case 1:
dialouge = (rand()%3)+1;
switch(dialouge)
{
case 1:
puts("'How could I attack a poor kitten...'");
puts("*KITTEN SCRATCHED YOU*");
pHP--;
break;
case 2:
puts("'I'm sorry...' *Closes eyes*");
puts("*SWING*... *ATTACK MISSED*");
puts("*KITTEN SCRATCHED YOU*");
pHP--;
break;
case 3:
puts("'I'm not a monster...'");
puts("*KITTEN SCRATCHED YOU*");
pHP--;
break;
}
break;
case 2:
puts("'Please I don't want to hurt you...'");
puts("*BLOCKED ATTACK*");
break;
case 3:
puts("You tried petting the kitten again...");
puts("Kitten did not sense any more aggression");
puts("The kitten enjoyed being petted");
puts("It looks like this battle is over");
fin = 1;
break;
default:
puts("Try Again");
break;
}
}
while(pHP==1 && fin ==0)
{
puts("\nYou feel really weak...");
puts("'I don't know what to do'");
puts("......................");
puts("......................");
puts("You KNOW what to do...");
puts("......................");
puts("......................");
printf("Kitten HP=%d", kHP);
printf(" Player HP=%d \n", pHP);
puts("*** 1. ATTACK 2. DO IT 3. LET IT OUT ***");
scanf("%d", &option);
switch(option)
{
case 1:
case 2:
case 3:
puts("*SWING*...........");
puts("..................");
puts("..................");
puts("...*ATTACK MISSED*");
puts("You couldn't do it");
puts("Instead you burst into tears from the thoughts of hurting a tiny kitten");
puts("Kitten did not sense any more aggression");
puts("It comforts you in your darkest time, it's ok");
puts("You'll be fine\n");
fin++;
break;
default:
puts("Try Again");
break;
}
}
break;
}
else
{
puts("You get closer to pet the kitten... it enjoyed that");
puts("It'll always remember you...");
}
break;
case 2:
puts("");
if(pHP==5)
{
puts("you decide to examine the cabinets, but they're all empty, even the drawers... why is that?");
break;
}
else
{
puts("You opened the drawer");
puts("'Wait... there's a bandage inside the drawer.... I swear there wasn't...'");
puts("**** HP REFILLED ****");
pHP=5;
break;
}
break;
case 3:
puts("you decide to open the next door and see a long tunnel");
puts("you see a modified motorcycle aligned to a track with some pickaxes...");
puts("your curiosity is leaving you with 2 more choices");
puts("1. Walk and see where the tunnel leads");
puts("2. Go back inside the room");
scanf("%d", &choice);
if(choice==1)
{
puts("You decide to journey along the tunnels path, you hear a faint meow behind you... you feel a bit empty...");
puts("........................................");
puts("You feel like you've walked for miles...");
puts("........................................");
puts("After a while you see a short man at the end of the tunnel...");
if(pHP<3)
{
puts("He immediately takes notice of your condition and asks you to come back at 100%");
puts("You decide to take the long journey back................");
break;
}
else
{
int n = 5;
int compare;
char c[5];
char read[6];
char d[5];
randStr18(c,n);
FILE *fptr;
fptr = fopen("room18pw.txt", "w");
fprintf(fptr, "%s", c);
fclose(fptr);
puts("He sees you and seems like he needs your assistance");
puts("'Hey I need help opening this door, can you help?'");
puts("You guys turn a corner and notice a vault-like door");
puts("'This door requires a password and I have no idea what to enter");
puts("'I tried 'exploring', but I couldn't find the answer think you know it?'");
puts("Wouldn't hurt to try.....");
while(choice != 99)
{
puts("********** ENTER PASSWORD **********");
while(pHP>=1)
{
FILE *rptr = fopen("room18pw.txt", "r");
fgets(read, 6, rptr);
scanf("%s",d);
compare = strcmp(d, c);
fclose(rptr);
if(compare == 0)
{
puts("******* PASSWORD ACCEPTED **********\n");
break;
}
else
{
puts("********** WRONG PASSWORD **********");
puts("The command panel shocked you");
pHP--;
}
}
if(pHP==0)
{
puts("You ran out of HP");
puts("********** GAME OVER **********");
choice = 99;
break;
}
else
{
puts("**** CONGLATURATION !!! ****");
puts("**** YOU HAVE COMPLETED ****");
puts("**** A GREAT GAME. ****");
puts("The vault has opened up, right before you see what's inside");
puts("The short man sucker punched you from behind, you fall down");
printf("'Thanks for the help %s'\n", name);
puts("It lo-ks lik- there was a l-t of m-ney and jew-lry ins-de");
puts("He run- of- wit- a ba-.............");
puts("it s-und- l-k- pol-c- s-r-ns ......");
puts("n---t n---t........................");
puts("...................................");
choice = 99;
}
}
}
}
else if(choice==2)
{
puts("You decided to investigate the room more before leaving");
break;
}
else
{
puts("Try again");
break;
}
default:
puts("Try Again");
break;
}
}
break;
}
case 19:
{
while(choice != 99)
{
puts("you open the door and find ........");
printf("Mauro Badillo, the 1st test");
scanf("%d",&choice);
}
break;
}
case 20:
{
bool realLooplmao = true;
while(realLooplmao)
{
int level = 0,attack = 0,magic = 0,health = 0,defense = 0,totalHP = 0;
bool NEW = true;
srand(time(NULL));
int i = 0;
puts("");
puts(" /|");
puts(" |\\|");
puts(" |||");
puts(" |||");
puts(" |||");
puts(" |||");
puts(" |||");
puts(" |||");
puts(" ~-[{o}]-~");
puts(" |/|");
puts(" |/|");
puts(" ///~` |\\_ `0' =\\\\ . .");
puts(" , |=' ,))\\_| ~-_ _) \\ _/_/|");
puts(" / , (((((( ~ \\ ~~~\\-~-_ /~ _ |");
puts(" /' -~/~)))))))'\\_ _/' \\_ /' D |");
puts(" ( (((((( ~-/ ~-/ ~-; / \\--_");
puts(" ~~--| ))'' ') ` `~~\\_ \\ )");
puts(" : (_ ~\\ , /~~- ./");
puts(" \\ \\_ )--__ /(_/) | ) )|");
puts(" ___ |_ \\__/~-__ ~~ ,' /,_;, __--( _/ |");
puts(" //~~\\`\\ /' ~~~----| ~~~~~~~~' \\- ((~~ __-~ |");
puts("((() `\\`\\_(_ _-~~-\\ ``~~ ~~~~~~ \\_ /");
puts(" ))) ~----' / \\ ) )");
puts(" ( ;`~--' : _- ,;;(");
puts(" | `\\ | _-~ ,;;;;)");
puts(" | /'`\\ ; _-~ _/");
puts(" /~ / | ) /;;;'' ,;;:-~");
puts(" | / / | / |;;' ,''");
puts(" / / | \\| | ,;( -Tua Xiong");
puts(" _/ /' \\ \\_) .---__\\_ \\,--._______");
puts(" ( )|' (~-_| (;;' ;;;~~~ ' `;;| ;;; ");
puts(" ) `|_ |-_;;--__ ~~~----__/' /'_______/");
puts(" `----' ( `~--_ ~~~;;------------~~~~~ ;;;'_ '");
puts(" `~~~~~~~~'~~~-----....___;;;____---~~");
puts("Here you will face a series of trials, make sure every choice counts.");
puts("");
puts("");
bool askNameCAPS=true;
while(askNameCAPS)
{
int nameCAPS = 0;
puts("Would you like your name to be in all caps? 1:Yes 2:No");
scanf(" %d",&nameCAPS);
switch(nameCAPS)
{
case 1:
for(i; name[i]!='\0';i++)
{
name[i]=toupper(name[i]);
}
askNameCAPS=false;
break;
case 2:
if(islower(name[0]))
name[0]=toupper(name[0]);
for(i=1; name[i]!='\0';i++)
{
name[i]=tolower(name[i]);
}
askNameCAPS=false;
break;
default:
puts("Wrong entry, continuing.");
break;
};
}
while(choice != 99)
{
/*puts("you open the door and find ........");
scanf("%d",&choice);*/
bool gameLoop = false;
int option = 0;
int levelF = level;
int healthPOT = 3;
int damage = 0;
bool magician = false;
bool warrior = false;
bool loss = false;
int multiplier = 0;
char goblin[10] = "Goblin";
char zombie[10] = "Zombie";
char giant[10] = "Giant";
char highSumm[25] = "High Summoner";
char quetzal[25] = "God Quetzalcoatl";
char goblinATT[50] = "The Goblin takes his tiny shiv and cuts you.";
char zombieATT[50] = "The Zombie lunges forward and bites you.";
char giantATT[80] = "The Giant takes his club and strikes you in the chest";
char highATT[100] = "The High Summoner casts a large cloud above you and calls down a bolt of lightning.";
char quetzalATT[100] = "Quetzalcoatl, The Creator, blasts you with a blue stream of fire.";
while(NEW)
{
puts("Pick your class.");
puts("________________________________________________________________");
puts("1. Warrior.");
puts("2. Magician.");
puts("3. Exit.");
scanf(" %d",&option);
switch(option)
{
case 1: level = 1;
attack = 5;
magic = 1;
health = 15;
defense = 2;
totalHP = 15;
warrior = true;
puts("You have selected Warrior.");
gameLoop = true;
NEW = false;
break;
case 2: level = 1;
attack = 1;
magic = 10;
health = 10;
totalHP = 10;
defense = 1;
magician = true;
puts("You have selected Magician.");
gameLoop = true;
NEW = false;
break;
case 3: gameLoop = false;
puts("Heading back to the main menu!");
NEW = false;
break;
default:
puts("Please select a valid option");
break;
};
}
if(gameLoop==false)
break;
levelF = level;
if(gameLoop == true)
puts("You will be given 3 health potions that heal \"20%\" of your health.\nUse them wisely.");
puts("________________________________________________________________");
puts("");
for(levelF; ((gameLoop == true)&&(levelF <= 5)); levelF++)
{
int monsterHP = 8;
int monsterATT = 5;
multiplier = levelF*3;
if(warrior == true)
{
totalHP += multiplier;
health += multiplier;
attack += multiplier;
defense += (multiplier/2);
}
else if(magician == true)
{
totalHP +=(3*(multiplier/2));
health +=(3*(multiplier/2));
magic += (multiplier+8);
defense += (multiplier/3);
}
else
puts("Something went wrong with warrior/magician boolean");
monsterHP+=(multiplier*2);
monsterATT+=(multiplier*2);
while(monsterHP > 0)
{
if(levelF==1)
printf("%s HP: %d DMG: %d \n", goblin,monsterHP,monsterATT);
else if(levelF==2)
printf("%s HP: %d DMG: %d \n", zombie,monsterHP,monsterATT);
else if(levelF==3)
printf("%s HP: %d DMG: %d \n", giant,monsterHP,monsterATT);
else if(levelF==4)
printf("%s HP: %d DMG: %d \n", highSumm,monsterHP,monsterATT);
else if(levelF==5)
printf("%s HP: %d DMG: %d \n", quetzal,monsterHP,monsterATT);
else
puts("Something went wrong calculating string name.");
if(warrior == true)
printf("Warrior: %s HP: %d DMG: %d \n",name,health,attack);
else
printf("Magician: %s HP: %d DMG: %d \n",name,health,magic);
puts("________________________________________________________________");
puts("1. Attack.");
puts("2. Magic.");
puts("3. Health Potion.");
scanf(" %d",&option);
int charATT = (rand()%attack);
int charMAG = (rand()%magic);
switch(option)
{
case 1: printf("You've attacked for %d.\n",charATT);
monsterHP -= charATT;
break;
case 2: printf("You've attacked for %d.\n",charMAG);
monsterHP -= charMAG;
break;
case 3: if(healthPOT <= 0)
{
puts("You have no more potions left!");
break;
}
else
{
health +=(.20*(totalHP));
healthPOT--;
}
break;
default:
break;
};
if(monsterHP > 0)
{
damage = ((rand()%monsterATT) - defense);
if(damage > 0)
{
if(levelF==1)
printf("%s\n", goblinATT);
else if(levelF==2)
printf("%s\n", zombieATT);
else if(levelF==3)
printf("%s\n", giantATT);
else if(levelF==4)
printf("%s\n", highATT);
else if(levelF==5)
printf("%s\n", quetzalATT);
else
puts("Something went wrong calculating attack string.");
health -= damage;
printf("You took %d damage.\n",damage);
}
else
puts("Their attempt to attack you has failed.");
}
else
{
if(levelF==1)
printf("You have defeated the %s\n",goblin);
else if(levelF==2)
printf("You have defeated the %s\n",zombie);
else if(levelF==3)
printf("You have defeated the %s\n",giant);
else if(levelF==4)
printf("You have defeated the %s\n",highSumm);
else if(levelF==5)
printf("You have defeated the %s\n",quetzal);
else
puts("Something went wrong calculating the defeat string.");
}
if(health<=0)
{
int lossCont = 0;
puts("You lose.");
loss=true;
bool lossChoice = true;
while(lossChoice)
{
puts("Would you like to continue? 1: Yes 2: No");
scanf(" %d",&lossCont);
switch(lossCont)
{
case 1:
puts("Continuing...");
lossChoice = false;
break;
case 2:
puts("Closing...");
lossChoice = false;
realLooplmao = false;
break;
default:
puts("Wrong choice, please enter 1 or 2.");
break;
};
}
break;
}
puts("________________________________________________________________");
}
if(loss == true)
gameLoop=false;
level = levelF;
}
if(level==5&&health>0)
{
char line[30];
printf("Congratulations %s, you defeated all the bosses in Room 20!\n",name);
//int number;
printf("%s's stats were\n_______________\n",name);
printf("Level: %d\n",level);
printf("Attack: %d\n",attack);
printf("Magic: %d\n",magic);
printf("Health: %d\n",health);
printf("Defense: %d\n",defense);
printf("TotalHP: %d\n",totalHP);
int option = 0;
//int level = 0, attack = 0, magic = 0, health = 0, defense = 0,totalHP = 0;
//srand(time(NULL));
FILE *rptr, *wptr;
bool inMenu = true;
while(inMenu)
{
puts("______________________________________");
puts("1. Start New Game");
puts("2. Save to Hall of Fame -stats.txt-");
puts("3. Read the Hall of Fame -stats.txt-");
puts("4. Exit Room 20");
scanf(" %d", &option);
switch(option)
{
case 1: //gameLoop(&level, &attack, &magic, &health, &defense,&totalHP,true);
inMenu = false;
break;
case 2: puts("Saving stats to stats.txt...");
wptr = fopen("stats.txt","a");
fprintf(wptr,"Name: %s\n",name);
fprintf(wptr,"Level: %d\n",level);
fprintf(wptr,"Attack: %d\n",attack);
fprintf(wptr,"Magic: %d\n",magic);
fprintf(wptr,"Health: %d\n",health);
fprintf(wptr,"Defense: %d\n",defense);
fprintf(wptr,"TotalHP: %d\n",totalHP);
fprintf(wptr,"___________________\n");
fclose(wptr);
break;
case 3: puts("Reading stats from stats.txt...");
rptr = fopen("stats.txt","r");
while(!feof(rptr))
{
fscanf(rptr,"%s",line);
printf("%s\n",line);
}
fclose(rptr);
break;
case 4: puts("Thank you for playing, goodbye.");
inMenu = false;
realLooplmao = false;
break;
default: puts("Wrong entry.");
break;
};
}
}
puts("________________________________________________________________");
}
}
break;
}
case 21: //Michael Morgan's room
{
while(choice != 99)
{
puts("you open the door and find ........");
puts("A penguin drinking a beer");
puts("To enter you must guess how many beers the peguin had drunk");
int j = 7;
int x = 0;
int l;
printf("Please enter a number between 1 and 10 \n");
scanf("%d",&y);
x = j + y;
printf("%d + number of beers = %d \n",y,x);
x = j * y;
printf("%d * number of beers = %d \n",y,x);
x = y - j;
printf("%d - number of beers = %d \n",y,x);
printf("Guess the number of beers: \n");
scanf("%d",&z);
if(z == j)
{
printf("YOU WIN!! \n");
printf("Hi %s my names is Bob \n", name);
}
else
{
printf("you lose \n");
choice = 99;
break;
}
puts("that's right I had seven lol");
puts("I just finished my classes and I can't figure out my GPA.");
puts("I found a program to tell me I can't enter my grades cause of the wings.");
puts("Can you put them in i got two A's one B two C's");
int A = 0, B = 0, C = 0, D = 0, F = 0, y = 0, i =0; //%d
double avg = 0, total = 0; //%lf
float h; //%f
char grade;
while(grade != 'z')
{
printf("enter the letter grade A-F (press z to finish):");
scanf(" %c", &grade);
switch(grade)
{
case 'a':
case 'A':
puts("You entered A");
A++;
total += 4;
i++;
break;
case 'b':
case 'B':
puts("You entered B");
B++;
total += 3;
i++;
break;
case 'c':
case 'C':
puts("You entered C");
C++;
total += 2;
i++;
break;
case 'd':
case 'D':
puts("You entered D");
D++;
total += 1;
i++;
break;
case 'f':
case 'F':
puts("You entered F");
F++;
i++;
break;
default:
puts("You entered an invalid letter grade");
}
}
avg = total / i;
printf("The gredes entered were: \n A = %d, B = %d, C = %d, D = %d, F = %d \n", A, B, C, D, F);
printf("The average was %.1lf.\n", avg);
puts("YESH I GET TO KEEP MY SCHOLOROSHIP");
puts("'This penguin seems really drunk', do you tell him.");
puts("1. Yes 2. No");
scanf("%d", &choice);
if(choice == 1)
{
puts("IM nto DRNUK YOU R!!!");
}
printf("%s, DO YOU WANT TO PLAY A GAME?\n", name);
puts("1. YES 2. NO");
scanf("%d",&choice);
puts("Great!!!");
puts("Okay you pick a number 1-10 and I'll pick a number I pick 7");
printf("%s you pick how many times we roll the dice.\n", name);
int die1 = 0, die2 = 0, die3 = 0, die4 = 0, die5 = 0, die6 = 0, die7 = 0,
die8 = 0, die9 = 0, die10 = 0;
srand(time(NULL));
l = rollsmm21();
for(i = 0; i < l ; i++)
{
x = rollmm21();
switch(x)
{
case 1:
++die1;
break;
case 2:
++die2;
break;
case 3:
++die3;
break;
case 4:
++die4;
break;
case 5:
++die5;
break;
case 6:
++die6;
break;
case 7:
++die7;
break;
case 8:
++die8;
break;
case 9:
++die9;
break;
case 10:
++die10;
break;
}
}
oputmm21(die1, die2, die3, die4, die5, die6, die7, die8, die9, die10);
puts("Did I win? I can't see.");
puts("1. YES 1. NO");
scanf("%d",&choice);
puts("The penguin pulls out a thumb drive and waves it menacingly at you.");
puts("DID I WIN?");
puts("1. YES 2. NO");
scanf("%d", &choice);
puts("fine. I need you back accout info so I can pay you for testing my homework.");
int account;
double balance;
char name[30];
FILE *fptr;
fptr = fopen("mmbank.txt", "w");
if(fptr == NULL)
{
puts("could not open file");
}
else
{
printf("Enter accont number: ");
scanf("%d", &account);
printf("Enter name: ");
scanf("%s", name);
printf("Enter price for checking Bob's work: ");
scanf("%lf", &balance);
fprintf(fptr,"%d %s %.lf \n", account, name, balance);
puts("thanks that's all I needed good bye");
}
fclose(fptr);
puts("You wake up in the bar and everyone is singing about the beer on the wall.");
printf("%s how long have you been out? your friend asks.\n", name);
puts("you suddenly get a message on you phone a download has started, you open it");
int c = 0;
FILE *fptr1;
fptr1 = fopen("mmbank.txt", "r");
if (fptr == NULL)
{
printf("Cannot open file \n");
exit(0);
}
// Read contents from file
c = fgetc(fptr1);
while (c != EOF)
{
printf ("%c", c);
c = fgetc(fptr1);
}
fclose(fptr1);
puts("'How did that peguin get my back info and my phone number");
return EXIT_SUCCESS;
}
}
case 22:
{
while(choice != 99)
{
puts("Entered Moises' room");
puts("You open the door and see 5 doors which one do you choose?...");
puts("Choose an option below (Enter 99 to quit)");
puts("Door 1 ");
puts("Door 2 ");
puts("Door 3 ");
puts("Door 4");
scanf("%d",&choice);
switch (choice)
{
case 1:
puts("Door is cold to the touch");
puts("What do you do first");
puts("1.Do you try and build a fire?");
puts("2.Do you look for warm clothing?");
puts("3.Do you tough it out?");
scanf("%d", &choice);
switch (choice)
{
case 1:
puts("Do you even know how to start a fire?");
puts("Of course you don't, but luckily there is a lighter in front of you");
puts("You find some dried up branches and leaves and light them");
puts("So now that the fire is started what do you do");
puts("1. Look for food");
puts("2. Find something to put on");
puts("3. Nothing, ill stay wasrm by the fire.");
scanf("%d", &choice);
break;
case 2:
puts("Smart move need to get some clothes luckily theres clothes right next to you");
break;
case 3:
puts("I too like to live dangerously");
puts("But you really shouldve chosen something else");
break;
default:
puts("Try again");
break;
}
break;
case 2:
puts("Who left the heater on?");
break;
case 3:
puts("You fall from the sky towards the ground");
puts("Are you scared?");
puts("1. Yes 2. No");
scanf("%d", &choice);
switch(choice)
{
case 1:
puts("You shouldn't be you have a parachute");
break;
case 2:
puts("Kinda edgy of you, are you ok? Maybe you should talk to somebody");
break;
default:
puts("You only really have two options");
break;
}
break;
case 4:
puts("There is a strange man in front of you");
puts("1.Do you approach him? or 2. Do you ignore him?");
break;
default:
printf("Door is locked cannot open \n");
break;
}
}
}
case 23:
{
while(choice != 99)
{
puts("you open the door and find ........");
scanf("%d",&choice);
}
break;
}
case 24:
{
int charCounter = 0,
userChoice = 0,
turn = 0,
randomAlignment = 0,
bananaAmount = 0,
orangeAmount = 0;
for (charCounter = 0; charCounter < 256; charCounter++)
{
if (islower(name[charCounter]))
{
name[charCounter] = toupper(name[charCounter]);
}
}
puts("As you open the door, you notice a sign reading: \"This is Phillip F. Aguilera's room\".\n"
"You enter the room and close the door behind you, noticing the choice of more doors. There are three more doors to choose.\n"
"A sheet of paper is lying on the floor. You pick it up and begin to read what has been written.\n"
"It states:");
printf("%s, enter the rooms and try to escape with the highest amount of bananas and oranges as possible!\n", name);
puts("You must have at least 5 bananas and at least 5 oranges in 5 turns to win this game or you lose!\n");
for (turn = 0; turn < 5; turn++)
{
printf("You have %d bananas and %d oranges!\n", bananaAmount, orangeAmount);
roomPrompt(&userChoice);
randomAlignment = rand() % 2;
if (randomAlignment == 0)
{
switch (userChoice)
{
case 1:
gorillaRoom(&bananaAmount, &orangeAmount);
break;
case 2:
drawPicture();
break;
case 3:
caseRandomizer(name, &bananaAmount, &orangeAmount);
}
}
else
{
switch (userChoice)
{
case 1:
drawPicture();
break;
case 2:
caseRandomizer(name, &bananaAmount, &orangeAmount);
break;
case 3:
gorillaRoom(&bananaAmount, &orangeAmount);
}
}
}
printf("You have %d bananas and %d oranges!\n", bananaAmount, orangeAmount);
if ((bananaAmount >= 5) && (orangeAmount >= 5))
{
puts("Congratulations! You win the game!\n");
}
else
{
puts("Sorry, you lose.\n");
}
break;
}
case 25:
{
while(choice != 99)
{ printf("Room for Richmond Laureta AKA (rlaureta)\n");
srand(time((NULL)));
int choice;
int powerWS = 0;
int randomForInt;
randomForInt = 1 + rand()%4;
printf("You are in a pod sleeping for over a thousand years, oblivious to everything, \nwhen all of a sudden, earthquake struck and collapsed the dungeon you are in. \nYour pod remains in tact and then a lightning hit your pod.\n You are awakened... you got out of your pod to a ruined dungeon.");
printf("\n\nYou see two pathways with doors at the end: \n\n1. The left pathway: INTELLIGENCE eteched on the door(RANDOM POWER)). ");
printf("\n2. The right pathway: STRENGTH etched on the door.");
printf("\nWhich pathway you want to choose?(Press 0 to exit at anytime.) ");
scanf("%d", &choice);
while (choice != 0) {
//Intelligence
if (choice == 1) {
printf("\nYou open the door and see three staffs, set on a table in the middle of the room. You walk over to the table to see the choices of staffs.\n\n");
printf("1. This staff is red and can cast flame.\n");
printf("2. This staff is blue and can cast water blast.\n");
printf("You have to choose the elemental for your weapon: ");
//RED
if (choice == 1) {
printf("\nYou picked up the fire staff and your outfit changed into a fire red wizard.\n");
printf("You exit the collapsed dungeon and after exiting you see a woman being attacked by a goblin.\n\n");
printf("1. Help the woman and cast flame on the goblin.\n");
printf("2. Cast flame on both the goblin and the woman.\n");
printf("Which action do you want to take? ");
scanf("%d", &choice);
printf("Power of the weapon: ");
weaponPower(randomForInt);
//help the woman
if (choice == 1){
printf("\nYou run towards the goblin and cast your flame spell. The goblin attacked you, but also, the goblin died in flames.\n");
printf("The woman thanked you and gave you a health potion for healing.\n");
printf("The woman explained to you what happened to the village. The woman told you \nthat the village is being attacked by an evil sorcerer in the fortress castle.\n");
printf("It is up to you if you want to save the village with your fire staff.\n\n");
printf("1. Face the evil sorcerer.\n");
printf("2. Ignore the woman.\n");
printf("What course of action would you like to take? ");
scanf("%d", &choice);
printf("Power of the weapon: ");
weaponPower(randomForInt);
if (choice == 1){
printf("\nYou journeyed to the castle and battled many enemy then you face the evil sorcerer.\n");
printf("He wants to make a deal with you. If you can help him take over the village.\n\n");
printf("1. Ignore him and defeat the evil sorcerer.\n");
printf("2. Accept the deal and rule the village with him.\n");
printf("What do you want to do? ");
scanf("%d", &choice);
printf("Power of the weapon: ");
weaponPower(randomForInt);
if (choice == 1) {
printf("\nYou defeated the sorcerer and saved countless lives. \nThe village honored you and became the fire red KING WIZARD.\n");
printf("Game Completed.");
printf("Power of the weapon: ");
weaponPower(randomForInt);
break;
}
else if (choice == 2) {
printf("\nYou defeated the sorcerer but suffered loses. \nThe village honored you and became the fire red KING WIZARD.\n");
printf("Game Completed.");
break;
printf("Power of the weapon: ");
weaponPower(randomForInt);
}
}
else if (choice == 2) {
printf("You ignored the woman and still went to the castle and face the evil sorcerer.");
printf("He wants to make a deal with you. If you can help him take over the village.\n\n");
printf("1. Ignore him and defeat the evil sorcerer.\n");
printf("2. Accept the deal and rule the village with him.\n");
printf("What do you want to do? ");
scanf("%d", &choice);
printf("Power of the weapon: ");
weaponPower(randomForInt);
if (choice == 1) {
printf("\nYou defeated the sorcerer and ruled with iron fist. \nThe village honored you and became the fire red KING WIZARD.\n");
printf("Game Completed.");
break;
printf("Power of the weapon: ");
weaponPower(randomForInt);
}
else if (choice == 2){
printf("You ruled with the evil sorcerer with an iron fist.");
break;
printf("Power of the weapon: ");
weaponPower(randomForInt);
}
}
}
//kill both
else if (choice == 2){
printf("You heartlessly cast the flame on the goblin and the woman killing them both.");
printf("The woman's soul was released and haunts you telling you that you need \nto kill the evil sorcerer that is invading the village living in the fortress castle.");
printf("It is up to you if you want to save the village with your fire staff.\n\n");
printf("1. Face the evil sorcerer.\n");
printf("2. Ignore the woman's soul\n");
printf("What course of action would you like to take? ");
scanf("%d", &choice);
printf("Power of the weapon: ");
weaponPower(randomForInt);
if (choice == 1){
printf("\nYou journeyed to the castle and battled many enemy then you face the evil sorcerer.\n");
printf("He wants to make a deal with you. If you can help him take over the village.\n\n");
printf("1. Ignore him and defeat the evil sorcerer.\n");
printf("2. Accept the deal and rule the village with him.\n");
printf("What do you want to do? ");
scanf("%d", &choice);
printf("Power of the weapon: ");
weaponPower(randomForInt);
if (choice == 1) {
printf("\nYou defeated the sorcerer but lost a lot of lives and the woman you killed haunts your mind forever. \nThe village honored you and you became the fire red KING WIZARD.\n");
printf("Game Completed.");
break;
printf("Power of the weapon: ");
weaponPower(randomForInt);
}
else if (choice == 2) {
printf("You made the pact with the evil sorcerer and ruled the village cruely for thousands of years.");
printf("Game Completed.");
break;
printf("Power of the weapon: ");
weaponPower(randomForInt);
}
}
else if (choice == 2) {
printf("You ignored the soul and still went to the castle and face the evil sorcerer.");
printf("He wants to make a deal with you. If you can help him take over the village.\n\n");
printf("1. Ignore him and defeat the evil sorcerer.\n");
printf("2. Accept the deal and rule the village with him.\n");
printf("What do you want to do? ");
scanf("%d", &choice);
printf("Power of the weapon: ");
weaponPower(randomForInt);
if (choice == 1) {
printf("\nYou defeated the sorcerer but lost a lot of lives and the woman you killed haunts your mind forever. \nThe village honored you and you became the fire red KING WIZARD.\n");
printf("Game Completed.");
break;
printf("Power of the weapon: ");
weaponPower(randomForInt);
}
else if (choice == 2) {
printf("You made the pact with the evil sorcerer and ruled the village cruely for thousands of years.");
printf("Game Completed.");
break;
printf("Power of the weapon: ");
weaponPower(randomForInt);
}
}
}
}
//BLUE
else if (choice == 2) {
printf("\nYou picked up the blue staff and your outfit changed into a blue wizard.\n");
printf("You exit the collapsed dungeon and after exiting you see a woman being attacked by a goblin.\n\n");
printf("1. Help the woman and cast water blast on the goblin.\n");
printf("2. Cast water blast on both the goblin and the woman to kill them.\n");
printf("Which action do you want to take? ");
scanf("%d", &choice);
printf("Power of the weapon: ");
weaponPower(randomForInt);
//woman alive
if (choice == 1){
printf("\nYou run towards the goblin and cast your water blast spell. The goblin attacked you, but also, the goblin died with the water blast.\n");
printf("The woman thanked you and gave you a health potion for healing.\n");
printf("The woman explained to you what happened to the village. The woman told you \nthat the village is being attacked by an evil sorcerer in the fortress castle.\n");
printf("\nIt is up to you if you want to save the village with your water staff.\n\n");
printf("1. Face the evil sorcerer.\n");
printf("2. Ignore the woman.\n");
printf("What course of action would you like to take? ");
scanf("%d", &choice);
printf("Power of the weapon: ");
weaponPower(randomForInt);
if (choice == 1){
printf("\nYou journeyed to the castle and battled many enemy then you face the evil sorcerer.\n");
printf("He wants to make a deal with you. If you can help him take over the village.\n\n");
printf("1. Ignore him and defeat the evil sorcerer.\n");
printf("2. Accept the deal and rule the village with him.\n");
printf("What do you want to do? ");
scanf("%d", &choice);
printf("Power of the weapon: ");
weaponPower(randomForInt);
if(choice == 1) {
printf("\nYou defeated the sorcerer and saved countless lives. \nThe village honored you and became the water blue KING WIZARD.\n");
printf("Game Completed.");
break;
printf("Power of the weapon: ");
weaponPower(randomForInt);
}
else if (choice ==2 ){
printf("You made the pact with the evil sorcerer and ruled the village with an iron fist.\n");
printf("Game Completed.");
break;
printf("Power of the weapon: ");
weaponPower(randomForInt);
}
}
else if (choice == 2) {
printf("You ignored the woman and still went to the castle and face the evil sorcerer.");
printf("He wants to make a deal with you. If you can help him take over the village.\n\n");
printf("1. Ignore him and defeat the evil sorcerer.\n");
printf("2. Accept the deal and rule the village with him.\n");
printf("What do you want to do? ");
scanf("%d", &choice);
printf("Power of the weapon: ");
weaponPower(randomForInt);
if(choice == 1) {
printf("\nYou defeated the sorcerer and saved countless lives. \nThe village honored you and became the water blue KING WIZARD.\n");
printf("Game Completed.");
break;
printf("Power of the weapon: ");
weaponPower(randomForInt);
}
else if (choice ==2 ){
printf("You made the pact with the evil sorcerer and ruled the village with an iron fist.\n");
printf("Game Completed.");
break;
printf("Power of the weapon: ");
weaponPower(randomForInt);
}
}
}
//woman killed
else if (choice == 2) {
printf("You heartlessly cast the water blast on the goblin and the woman killing them both.");
printf("The woman's soul was released and haunts you telling you that you need \nto kill the evil sorcerer that is invading the village living in the fortress castle.");
printf("It is up to you if you want to save the village with your water staff.\n\n");
printf("1. Face the evil sorcerer.\n");
printf("2. Ignore the woman's soul\n");
printf("What course of action would you like to take? ");
scanf("%d", &choice);
printf("Power of the weapon: ");
weaponPower(randomForInt);
if (choice == 1){
printf("\nYou journeyed to the castle and battled many enemy then you face the evil sorcerer.\n");
printf("He wants to make a deal with you. If you can help him take over the village.\n\n");
printf("1. Ignore him and defeat the evil sorcerer.\n");
printf("2. Accept the deal and rule the village with him.\n");
printf("What do you want to do? ");
scanf("%d", &choice);
printf("Power of the weapon: ");
weaponPower(randomForInt);
if (choice == 1) {
printf("\nYou defeated the sorcerer but lost a lot of lives and the woman you killed haunts your mind forever. \nThe village honored you and you became the water blue KING WIZARD.\n");
printf("Game Completed.");
break;
printf("Power of the weapon: ");
weaponPower(randomForInt);
}
else if (choice == 2) {
printf("You made the pact with the evil sorcerer and ruled the village cruely for thousands of years.");
printf("Game Completed.");
break;
printf("Power of the weapon: ");
weaponPower(randomForInt);
}
}
else if (choice == 2) {
printf("You ignored the woman's soul and still went to the castle and face the evil sorcerer.");
printf("He wants to make a deal with you. If you can help him take over the village.\n\n");
printf("1. Ignore him and defeat the evil sorcerer.\n");
printf("2. Accept the deal and rule the village with him.\n");
printf("What do you want to do? ");
scanf("%d", &choice);
printf("Power of the weapon: ");
weaponPower(randomForInt);
if (choice == 1) {
printf("\nYou defeated the sorcerer but lost a lot of lives and the woman you killed haunts your mind forever. \nThe village honored you and you became the water blue KING WIZARD.\n");
printf("Game Completed.");
break;
printf("Power of the weapon: ");
weaponPower(randomForInt);
}
else if (choice == 2) {
printf("You made the pact with the evil sorcerer and ruled the village cruely for thousands of years.");
printf("Game Completed.");
break;
printf("Power of the weapon: ");
weaponPower(randomForInt);
}
}
}
}
}
//STRENGTH
else if (choice == 2) {
printf("\nYou open the door and you see two weapons, set on a table in the middle of the room. You walk over to the table to see the choices of weapon.\n\n");
printf("1. The first weapon is a katana\n");
printf("2. The second weapon is a lance\n");
printf("What is your weapon choice? ");
scanf("%d", &choice);
//Katana
if (choice == 1) {
printf("\nYou picked up the katana blade and your outfit changed into a samurai warrior.\n");
printf("You exit the collapsed dungeon and after exiting you see a woman being attacked by a goblin.\n\n");
printf("1. Help the woman and attack the goblin with the katana.\n");
printf("2. Use the katana on both the goblin and the woman to kill them.\n");
printf("Which action do you want to take? ");
scanf("%d", &choice);
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
//help the woman
if(choice == 1) {
printf("\nYou run towards the goblin and use your katana. The goblin attacked you, but also, the goblin died.\n");
printf("The woman thanked you and gave you a health potion for healing.\n");
printf("The woman explained to you what happened to the village. The woman told you \nthat the village is being attacked by an evil sorcerer in the fortress castle.\n");
printf("It is up to you if you want to save the village with your katana.\n\n");
printf("1. Face the evil sorcerer.\n");
printf("2. Ignore the woman.\n");
printf("What course of action would you like to take? ");
scanf("%d", &choice);
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
if (choice == 1) {
printf("\nYou journeyed to the castle and battled many enemy then you face the evil sorcerer.\n");
printf("He wants to make a deal with you. If you can help him take over the village.\n\n");
printf("1. Ignore him and defeat the evil sorcerer.\n");
printf("2. Accept the deal and rule the village with him.\n");
printf("What do you want to do? ");
scanf("%d", &choice);
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
if (choice == 1) {
printf("You defeated the evil sorcerer saved countless lives. You were honored by the villagers and became an emperor shogun.\n");
printf("Game complete.");
break;
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
}
else if (choice == 2) {
printf("You ruled the village with the evil with an iron fist.\n");
printf("Game complete.");
break;
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
}
}
else if (choice == 2) {
printf("You ignored the woman and still went to the castle and face the evil sorcerer.");
printf("He wants to make a deal with you. If you can help him take over the village.\n\n");
printf("1. Ignore him and defeat the evil sorcerer.\n");
printf("2. Accept the deal and rule the village with him.\n");
printf("What do you want to do? ");
scanf("%d", &choice);
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
if (choice == 1) {
printf("You defeated the evil sorcerer saved countless lives. You were honored by the villagers and became an emperor shogun.\n");
printf("Game complete.");
break;
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
}
else if (choice == 2) {
printf("You ruled the village with the evil with an iron fist.\n");
printf("Game complete.");
break;
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
}
}
}
//kill both
else if (choice == 2) {
printf("You heartlessly use the katana on the goblin and the woman killing them both.");
printf("The woman's soul was released and haunts you telling you that you need \nto kill the evil sorcerer that is invading the village living in the fortress castle.\n");
printf("It is up to you if you want to save the village with your katana.\n\n");
printf("1. Face the evil sorcerer.\n");
printf("2. Ignore the woman's soul\n");
printf("What course of action would you like to take? ");
scanf("%d", &choice);
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
if (choice == 1) {
printf("\nYou journeyed to the castle and battled many enemy then you face the evil sorcerer.\n");
printf("He wants to make a deal with you. If you can help him take over the village.\n\n");
printf("1. Ignore him and defeat the evil sorcerer.\n");
printf("2. Accept the deal and rule the village with him.\n");
printf("What do you want to do? ");
scanf("%d", &choice);
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
if (choice == 1) {
printf("You defeated the evil sorcerer but lost a lot of lives. You were honored by the villagers and became an emperor shogun.");
printf("Game complete.");
break;
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
}
else if (choice == 2) {
printf("You ruled the village with the evil sorcerer and become tyranical.\n");
printf("Game complete.");
break;
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
}
}
else if (choice == 2) {
printf("You ignored the woman's soul and still went to the castle and face the evil sorcerer.");
printf("He wants to make a deal with you. If you can help him take over the village.\n\n");
printf("1. Ignore him and defeat the evil sorcerer.\n");
printf("2. Accept the deal and rule the village with him.\n");
printf("What do you want to do? ");
scanf("%d", &choice);
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
if (choice == 1) {
printf("You defeated the evil sorcerer but lost a lot of lives. You were honored by the villagers and became an emperor shogun.");
printf("Game complete.");
break;
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
}
else if (choice == 2) {
printf("You ruled the village with the evil sorcerer and become tyranical.\n");
printf("Game complete.");
break;
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
}
}
}
}
//Lance
else if (choice == 2) {
printf("\nYou picked up the lance and your costume changed to a Knight.\n");
printf("You exit the collapsed dungeon and after exiting you see a woman being attacked by a goblin.\n\n");
printf("1. Help the woman and use the lance on the goblin.\n");
printf("2. Use the lance on both the goblin and the woman to kill them.\n");
printf("Which action do you want to take? ");
scanf("%d", &choice);
//help the woman
if(choice == 1) {
printf("\nYou run towards the goblin and use your lance. The goblin attacked you, but also, the goblin died.\n");
printf("The woman thanked you and gave you a health potion for healing.\n");
printf("The woman explained to you what happened to the village. The woman told you \nthat the village is being attacked by an evil sorcerer in the fortress castle.\n");
printf("It is up to you if you want to save the village with your lance.\n\n");
printf("1. Face the evil sorcerer.\n");
printf("2. Ignore the woman.\n");
printf("What course of action would you like to take? ");
scanf("%d", &choice);
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
if(choice == 1) {
printf("\nYou journeyed to the castle and battled many enemy then you face the evil sorcerer.\n");
printf("He wants to make a deal with you. If you can help him take over the village.\n\n");
printf("1. Ignore him and defeat the evil sorcerer.\n");
printf("2. Accept the deal and rule the village with him.\n");
printf("What do you want to do? ");
scanf("%d", &choice);
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
if (choice == 1) {
printf("You defeated the evil sorcerer. The villager honored you and you became the knight KING.\n");
printf("Game complete.");
break;
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
}
else if (choice == 2) {
printf("You ruled the land with the evil sorcerer with an iron fist.\n");
printf("Game complete.");
break;
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
}
}
else if (choice ==2 ){
printf("You ignored the woman and still went to the castle and face the evil sorcerer.");
printf("He wants to make a deal with you. If you can help him take over the village.\n\n");
printf("1. Ignore him and defeat the evil sorcerer.\n");
printf("2. Accept the deal and rule the village with him.\n");
printf("What do you want to do? ");
scanf("%d", &choice);
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
if (choice == 1) {
printf("You defeated the evil sorcerer. The villager honored you and you became the knight KING.\n");
printf("Game complete.");
break;
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
}
else if (choice == 2) {
printf("You ruled the land with the evil sorcerer with an iron fist.\n");
printf("Game complete.");
break;
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
}
}
}
//kill both
else if (choice == 2) {
printf("You heartlessly use the lance on the goblin and the woman killing them both.");
printf("The woman's soul was released and haunts you telling you that you need \nto kill the evil sorcerer that is invading the village living in the fortress castle.");
printf("It is up to you if you want to save the village with your water staff.\n\n");
printf("1. Face the evil sorcerer.\n");
printf("2. Ignore the woman's soul\n");
printf("What course of action would you like to take? ");
scanf("%d", &choice);
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
if(choice == 1) {
printf("\nYou journeyed to the castle and battled many enemy then you face the evil sorcerer.\n");
printf("He wants to make a deal with you. If you can help him take over the village.\n\n");
printf("1. Ignore him and defeat the evil sorcerer.\n");
printf("2. Accept the deal and rule the village with him.\n");
printf("What do you want to do? ");
scanf("%d", &choice);
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
if (choice == 1) {
printf("You defeated the evil sorcerer but lost a lot of lives. The villager honored you and you became the knight KING.\n");
printf("Game complete.");
break;
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
}
else if (choice == 2) {
printf("You ruled the village with the evil sorcerer and became tyranical.\n");
printf("Game complete.");
break;
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
}
}
else if (choice ==2 ){
printf("You ignored the woman's soul and still went to the castle and face the evil sorcerer.");
printf("He wants to make a deal with you. If you can help him take over the village.\n\n");
printf("1. Ignore him and defeat the evil sorcerer.\n");
printf("2. Accept the deal and rule the village with him.\n");
printf("What do you want to do? ");
scanf("%d", &choice);
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
}
if (choice == 1) {
printf("You defeated the evil sorcerer but lost a lot of lives. The villager honored you and you became the knight KING.\n");
printf("Game complete.");
break;
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
}
else if (choice == 2) {
printf("You ruled the village with the evil sorcerer and became tyranical.\n");
printf("Game complete.");
break;
powerWS++;
printf("Weapon powered up: ");
weaponPower(powerWS);
}
}
}
}
}
int i;
printf("\nENDING CREDITS: \n");
for(i = 0; i < 20; i++){
printf("-");
}
char creatorName[8] = {"RICHMOND"};
for (i = 0; i < strlen(creatorName); i++){
printf("\n%c", creatorName[i]);
}
FILE *writeToFile;
FILE *writeToFile2;
writeToFile = fopen("output25.txt", "w");
writeToFile2 = fopen("output25.txt", "a");
printf("\nCredits is written and saved on the output25.txt\n");
fprintf(writeToFile2, "THIS game is created By RICHMOND LAURETA for CSC 251 for Garrett Poppe. Thank YOU PROFESSOR for this semester.");
fclose(writeToFile2);
fclose(writeToFile);
break;
}
break;
}
case 26:
{
//Room created by Saad Khan ©
while(choice != 99)
{
char riddleoptions[9][25] = {"The Kingdom of Kush", "The Kingdom of Aksum",
"The Land of Punt", "Harla Kingdom", "Kingdom of D'mt", "Kingdom of Numidia",
"Mali", "Kindom of Kerma", "Kindom of Makuria"};
int i, size, num;
double sqnum;
FILE *wptr;
printf("\nYou open the door...It's oddly heavy...Nonetheless it's open.\n");
puts("Upon entering the room, there's a riddle at the wall.....Behold:");
puts("1. Read the riddle.");
puts("2. Turn back.");
puts("3. Wipe the riddle off.");
scanf("%d", &choice);
if(choice == 1)
{
while(choice != 99)
{
printf("\nThe riddle reads:\n");
puts("In the \"kingdom\" of gold where the red and yellow banner is hoisted.");
puts("There inneth lies a mighty murky stream 4570720 yards long.");
puts("Resources never forsaken. Never squandered. Never disregarded.");
puts("What is this place?:");
size = sizeof(riddleoptions)/sizeof(riddleoptions[0]);
for(i = 0; i < size; i++)
{
printf("%d. %s\n", i + 1, riddleoptions[i]);
}
scanf("%d", &choice);
if(choice == 7)
{
puts("You are a individual of wisdom...Duly please...");
printf("Continue on...\n\n");
}
else
{
puts("Curse be upon thee...");
puts("Thou shalt pass... but with blighted charm!!!");
printf("Zaaaaaapppppp!!!!!!\n\n");
}
break;
}
break;
}
else if(choice == 2)
{
wptr = fopen("thefileoflife.txt", "w");
fprintf(wptr, "This \"lucky\" egg won't assist you. You must think harder.\n");
puts("You attempt to turn back...");
puts("There is no where to turn back!!! Door does not exist anymore!!!");
puts("You must do something else!");
}
else if(choice == 3)
{
while(choice != 99)
{
puts("You wipe the riddle off with your hand...");
puts("It comes off like butter...");
puts("...but another riddle appears on the wall!!!");
puts("It reads:");
srand(time(NULL));
num = (rand() % 10) + 1;
sqnum = sqrt(num);
printf("Please select the square root of %d:\n", num);
printf("1. %f\n", sqrt(sqnum));
printf("2. %f\n", pow(sqnum, 2));
printf("3. %f\n", sqnum + 3.14);
printf("4. %f\n", sqnum);
scanf("%d", &choice);
if(choice != 4)
{
puts("Absoutely incorrect!!! Incorrect calculations!!!");
puts("A hole opens beneth the \"floor()\"");
printf("You fall swiftly into it.\n\n");
}
else
{
puts("Hmmm...That answer is accurate");
puts("...But not seemingly satisfying...");
printf("You are allowed to proceed into an unknown place.\n\n");
}
break;
}
break;
}
}
break;
}
case 27:
{
int i,num,enterNum,missingNum=27, total;
char choose, letters;
int arr[5] = {0}; //array1 for random numbers
int arr2[5] = {0}; //array2 for user input
int *ptr;
ptr = arr;
srand(time(NULL));
puts("\nRoom 27 (SM)");
puts("You have entered room 27");
puts("The room is empty, you turn back....");
puts("The door has magically disappeared");
puts("Suddenly you hear something fall");
while(choice != 99)
{
puts("what do you do?");
puts("1. Stop?");
puts("2. Look around the room?");
puts("3. Find out what made the noise?");
scanf("%d",&choice);
if(choice == 1)
{
puts("\nWhy did you stop?");
puts("Keep going");
puts("You are still in Room 27");
}
else if(choice == 2)
{
puts("\nYou see numbers on the wall");
randomFill(ptr); //gets random num from function prototype
for(i = 0; i < 5; i++) //prints out numbers in array1
{
printf("%d",*ptr);
ptr++;
}
puts("\n\nYou find a keypad, do you?");
puts("1. Enter numbers? "); //gives user choice to enter or not enter num
puts("2. Dont do anything");
scanf("%d", &choice);
if(choice == 1)
{
puts("\nEnter code");
for(i = 0; i < 5; i++)
{
scanf("%d", &arr2[i]); //user enters num
}
for(i = 0; i < 5; i++)
{
if(arr[i] != arr2[i]) //checks if num are equal to each other
{
puts("\nYou didnt enter the correct numbers");
puts("The keypad breaks");
puts("There is no escape\n");
break;
}
else
{
puts("\nYou entered the numbers from the wall");
puts("A door opens up\nyou walk through the door");
puts("Room 27");
puts("You're in Room 27 again");
puts("There is a computer in the middle of the room");
puts("You sit down in front of the computer ");
puts("1. turn on computer");
puts("2. walk away");
scanf("%d", &choice);
if(choice == 1)
{
puts("The computer turns on\n");
puts("Hello");
puts("Enter a number > 0 ");
scanf("%d", &enterNum);
if(enterNum<1)
{
puts("This number is not in range");
puts("You have to start at the beginning for not following instructions");
break;
}
else
{
total = enterNum * missingNum;
printf("%d * ? = %d\n", enterNum,total);
puts("what is the missing number");
scanf("%d", &enterNum);
if(enterNum == missingNum)
{
puts("Congratulations you can walk into the next room");
puts("Welcome to Room 27");
break;
}
else
{
puts("You failed");
puts("Room 27");
break;
}
}
}
else
{
puts("You get up");
puts("You are still in Room 27");
break;
}
}
}
}
else
{
letters = prompt();
if(letters == 'y')
{
puts("\nYou have entered another room\n");
break;
}
else
{
puts("\nYou are still in Room 27");
}
}
}
else
{
puts("\nThe item on the floor is a flashlight?");
puts("The lights go out.....");
puts("Do you....");
puts("1.Turn on flashlight?\n2.Do nothing");
scanf("%d", &choice);
room27Output(choice);
break;
}
}
break;
}
case 28:
{
//Room #28 for Shane Cortez
while (choice != 99)
{
srand(time(NULL));
int randNum = rand() % 2;
puts("you enter the room marked 28");
puts("As the panic of drowning subsides you look up to notice that the room is shaking and the ground splitting in half revealing a pit to nothingness you have to act fast or risk missing the jump across!");
puts("What do you do:");
puts("1. JUMP!");
puts("2. Quickly look around and reassess the situation");
puts("99. At any time to End Game");
scanf("%d", &choice);
while (choice > 2 || choice < 1)
{
puts("enter 1, 2 or 99");
scanf("%d", &choice);
}
if (choice == 1)
{
puts("in a panic you jump across the pit and make it safely to the other side.");
puts("As you made your jump you noticed that there was a key dangling on a string over the midde of the pit, but missed your opportunity to grab it.");
puts("As you look around you notice a door sealed shut by vines, and there is a locked chest right next to it");
puts("You suspect that the key will open the chest, but you have to get it first...");
puts("What do you do:");
puts("1. Try to jump across and jump back to grab the key");
puts("2. Check inventory");
scanf("%d", &choice);
while (choice > 2 || choice < 1)
{
puts("enter 1, 2 or 99");
scanf("%d", &choice);
}
if (choice == 1)
{
puts("You attempt the first jump and realize too late that the pit is far too wide to jump across, you fall into the darkness and are never seen again....");
puts("Game Over");
choice = 99;
break;
}
else if (choice == 2)
{
puts("you check your inventory and notice that you packed your trusty hook attached to a long stick, you can use this to get the key.");
puts("you reach across the pit with your hook and grab the key, unfortunatly in the action you drop the hook while just barely being able to hang onto the key");
puts("You say your farewells to the hook and put the key in your inventory.");
puts("Key added to inventory");
puts("You are now faced with a locked chest and a vine covered door");
puts("What do you do:");
puts("1. inspect door.");
puts("2. open chest with key");
scanf("%d", &choice);
while (choice > 2 || choice < 1)
{
puts("enter 1, 2 or 99");
scanf("%d", &choice);
}
if (choice == 1)
{
puts("upon further inspection you notice that the vines appear flamable...");
puts("you then turn your attention to the chest, you pull out the key and unlock the chest, inside you find a scroll which reads:");
puts("write a spell and this scroll will grant you power...");
puts("Unfortunately you only studied one year of spellcasting in highschool and the only three spells you remember from back then are:");
puts("1. fire");
puts("2. water");
puts("3. earth");
puts("What will you write:");
scanf("%d", &choice);
shanesFileWriter(choice);
if (choice == 1) //fire choice
{
puts("you write the ancient runes of fire onto the page.");
puts("you must now read the writings properly or it will not work. (Hint:try using the rm28-scroll.txt for guidance)");
puts("What will you mutter:");
puts("1. I harness the power of Fire!");
puts("2. Aprovecho el poder de Fuego!");
puts("3. Jeg utnytter kraften til Eldur!");
scanf("%d", &choice);
while (choice > 3 || choice < 1)
{
puts("enter 1, 2, 3 or 99");
scanf("%d", &choice);
}
while (choice != 3)
{
puts("nothing seems to happen... maybe another word...");
scanf("%d", &choice);
}
if (choice == 3)
{
puts("The scroll flashes bright red with fiery power, suddenly your hands begin to feel hot, when suddenly they light ablaze! with this power you can shoot fire out of your hand!");
puts("You strike an agressive pose and engulf the vine covered door in flames.");
puts("As the fire and smoke subside, the door sits ajar with a light shining through.");
puts("What will you do:");
puts("1. walk through the door");
puts("2. Turn around and jump into the pit");
scanf("%d", &choice);
if (choice == 1)
{
//Victory!
puts("You open the door and are blinded by light, as your vision returns you realize you are in the middle of nowhere in the desert, and the door magically dissapears");
puts("You escaped, but now what?");
puts("Congrats you finished the game. Thank you for playing!");
choice = 99;
break;
}
else if (choice == 2)
{
puts("I'm not sure why you chose this, but you turn around and jump into the pit, you are never seen again....");
puts("Game Over...");
choice = 99;
break;
}
}
}
else if (choice == 2) //water choice
{
puts("You write down the ancient runes of water onto the page.");
puts("you must now read the writings properly or it will not work. (Hint:try using the rm28-scroll.txt for guidance)");
puts("What will you mutter:");
puts("1. I harness the power of Water!");
puts("2. Jeg utnytter kraften til Laguz!");
puts("3. Aprovecho el poder de Aqua!");
scanf("%d", &choice);
while (choice > 3 || choice < 1)
{
puts("enter 1, 2, 3 or 99");
scanf("%d", &choice);
}
while (choice != 2)
{
puts("nothing seems to happen... maybe another word...");
scanf("%d", &choice);
}
puts("the scroll glows a conforting blue color, suddenly your hands feel damp, you can now use this on the door.");
puts("You ready yourself and shoot a powerful stream of water on the vines.");
puts("You stare at the vines as they grow greener and stronger from the water, the vines then grow at a rapid rate engulfing the narrow walkway that you stand on.");
puts("You find yourself losing balance on the decreasing surface, eventually falling into the pit...");
puts("You are never seen again...");
puts("Game Over");
choice = 99;
break;
}
else if (choice == 3) //earth choice
{
puts("You write the ancient rune of earth.");
puts("you must now read the writings properly or it will not work. (Hint:try using the rm28-scroll.txt for guidance)");
puts("What will you mutter:");
puts("1. Jeg utnytter kraften til Midgard!");
puts("2. I harness the power of Earth!");
puts("3. Aprovecho el poder de Tierra!");
scanf("%d", &choice);
while (choice > 3 || choice < 1)
{
puts("enter 1, 2, 3 or 99");
scanf("%d", &choice);
}
while (choice != 1)
{
puts("nothing seems to happen... maybe another word...");
scanf("%d", &choice);
}
puts("suddenly the scroll glows emerald green, as your hands begin to feel one with the earth, you can use this on the door.");
puts("You ground yourself, and use your new powers on the vines.");
puts("To your suprise, the earth spell you wrote only makes the vines stronger, so much so that they begin to grow wildly out of control!");
puts("The vines begin to take up most of the surface you stand on...");
puts("You find yourself losing balance on the decreasing space, eventually falling into the pit...");
puts("You are never seen again...");
puts("Game Over");
choice = 99;
break;
}
}
else if (choice == 2)
{
puts("you turn your attention to the chest, you pull out the key and unlock the chest, inside you find a scroll which reads:");
puts("write a spell and this scroll will grant you power...");
puts("Unfortunately you only studied one year of spellcasting in highschool and the only three spells you remember from back then are:");
puts("1. fire");
puts("2. water");
puts("3. earth");
puts("What will you write:");
scanf("%d", &choice);
shanesFileWriter(choice);
if (choice == 1) //fire choice
{
puts("you write the ancient runes of fire onto the page.");
puts("you must now read the writings properly or it will not work. (Hint:try using the rm28-scroll.txt for guidance)");
puts("What will you mutter:");
puts("1. I harness the power of Fire!");
puts("2. Aprovecho el poder de Fuego!");
puts("3. Jeg utnytter kraften til Eldur!");
scanf("%d", &choice);
while (choice > 3 || choice < 1)
{
puts("enter 1, 2, 3 or 99");
scanf("%d", &choice);
}
while (choice != 3)
{
puts("nothing seems to happen... maybe another word...");
scanf("%d", &choice);
}
puts("The scroll flashes bright red with fiery power, suddenly your hands begin to feel hot, when suddenly they light ablaze! with this power you can shoot fire out of your hand!");
puts("You strike an agressive pose and engulf the vine covered door in flames.");
puts("As the fire and smoke subside, the door sits ajar with a light shining through.");
puts("What will you do:");
puts("1. walk through the door");
puts("2. Turn around and jump into the pit");
scanf("%d", &choice);
while (choice > 2 || choice < 1)
{
puts("enter 1, 2 or 99");
scanf("%d", &choice);
}
if (choice == 1)
{
//Victory!
puts("You open the door and are blinded by light, as your vision returns you realize you are in the middle of nowhere in the desert, and the door magically dissapears");
puts("You escaped, but now what?");
puts("Congrats you finished the game. Thank you for playing!");
choice = 99;
break;
}
else if (choice == 2)
{
puts("I'm not sure why you chose this, but you turn around and jump into the pit, you are never seen again....");
puts("Game Over...");
choice = 99;
break;
}
}
else if (choice == 2) //water choice
{
puts("You write down the ancient runes of water onto the page.");
puts("you must now read the writings properly or it will not work. (Hint:try using the rm28-scroll.txt for guidance)");
puts("What will you mutter:");
puts("1. I harness the power of Water!");
puts("2. Jeg utnytter kraften til Laguz!");
puts("3. Aprovecho el poder de Aqua!");
scanf("%d", &choice);
while (choice > 3 || choice < 1)
{
puts("enter 1, 2, 3 or 99");
scanf("%d", &choice);
}
while (choice != 2)
{
puts("nothing seems to happen... maybe another word...");
scanf("%d", &choice);
}
puts("the scroll glows a conforting blue color, suddenly your hands feel damp, you can now use this on the door.");
puts("You ready yourself and shoot a powerful stream of water on the vines.");
puts("You stare at the vines as they grow greener and stronger from the water, the vines then grow at a rapid rate engulfing the narrow walkway that you stand on.");
puts("You find yourself losing balance on the decreasing surface, eventually falling into the pit...");
puts("You are never seen again...");
puts("Game Over");
choice = 99;
break;
}
else if (choice == 3) //earth choice
{
puts("You write the ancient rune of earth.");
puts("you must now read the writings properly or it will not work. (Hint:try using the rm28-scroll.txt for guidance)");
puts("What will you mutter:");
puts("1. Jeg utnytter kraften til Midgard!");
puts("2. I harness the power of Earth!");
puts("3. Aprovecho el poder de Tierra!");
scanf("%d", &choice);
while (choice > 3 || choice < 1 || choice == 99)
{
puts("enter 1, 2, 3 or 99");
scanf("%d", &choice);
}
while (choice != 1)
{
puts("nothing seems to happen... maybe another word...");
scanf("%d", &choice);
}
puts("suddenly the scroll glows emerald green, as your hands begin to feel one with the earth, you can use this on the door.");
puts("You ground yourself, and use your new powers on the vines.");
puts("To your suprise, the earth spell you wrote only makes the vines stronger, so much so that they begin to grow wildly out of control!");
puts("The vines begin to take up most of the surface you stand on...");
puts("You find yourself losing balance on the decreasing space, eventually falling into the pit...");
puts("You are never seen again...");
puts("Game Over");
choice = 99;
break;
}
}
}
}
else if (choice == 2)
{
puts("As you look around frantically you notice a chest on the other side next to a door and a key dangling over the ever growing death pit on a string.... now is the time to jump");
puts("As you make your jump you take the time to aim for grabbing the key on the way over.... It's going to be close, lets see if you can make it.");
if (randNum == 0)
{
puts("You leap through the air and grab the other side, when suddenly the ledge gives way, leaving you to fall into the darkness never to be seen again....");
puts("Game Over");
choice = 99;
break;
}
else
{
puts("You jump with all your might, and land on the other side barely missing the fall by an inch.");
}
if (randNum == 1 && choice == 2)
{
puts("You made it across! now before you sits a door closed off by vines and a locked chest that you suspect will be unlocked by the key...");
puts("What is your next move:");
puts("1. Open the chest");
puts("2. Further inspect the door");
scanf("%d", &choice);
while (choice > 2 || choice < 1)
{
puts("enter 1, 2 or 99");
scanf("%d", &choice);
}
if (choice == 1)
{
puts("you turn your attention to the chest, you pull out the key and unlock the chest, inside you find a scroll which reads:");
puts("write a spell and this scroll will grant you power...");
puts("Unfortunately you only studied one year of spellcasting in highschool and the only three spells you remember from back then are:");
puts("1. fire");
puts("2. water");
puts("3. earth");
puts("What will you write:");
scanf("%d", &choice);
shanesFileWriter(choice);
if (choice == 1) //fire choice
{
puts("you write the ancient runes of fire onto the page.");
puts("you must now read the writings properly or it will not work. (Hint:try using the rm28-scroll.txt for guidance)");
puts("What will you mutter:");
puts("1. I harness the power of Fire!");
puts("2. Aprovecho el poder de Fuego!");
puts("3. Jeg utnytter kraften til Eldur!");
scanf("%d", &choice);
while (choice > 3 || choice < 1)
{
puts("enter 1, 2, 3 or 99");
scanf("%d", &choice);
}
while (choice != 3)
{
puts("nothing seems to happen... maybe another word...");
scanf("%d", &choice);
}
puts("The scroll flashes bright red with fiery power, suddenly your hands begin to feel hot, when suddenly they light ablaze! with this power you can shoot fire out of your hand!");
puts("You strike an agressive pose and engulf the vine covered door in flames.");
puts("As the fire and smoke subside, the door sits ajar with a light shining through.");
puts("What will you do:");
puts("1. walk through the door");
puts("2. Turn around and jump into the pit");
scanf("%d", &choice);
while (choice > 2 || choice < 1)
{
puts("enter 1, 2 or 99");
scanf("%d", &choice);
}
if (choice == 1)
{
//Victory!
puts("You open the door and are blinded by light, as your vision returns you realize you are in the middle of nowhere in the desert, and the door magically dissapears");
puts("You escaped, but now what?");
puts("Congrats you finished the game. Thank you for playing!");
choice = 99;
break;
}
else if (choice == 2)
{
puts("I'm not sure why you chose this, but you turn around and jump into the pit, you are never seen again....");
puts("Game Over...");
choice = 99;
break;
}
}
else if (choice == 2) //water choice
{
puts("You write down the ancient runes of water onto the page.");
puts("you must now read the writings properly or it will not work. (Hint:try using the rm28-scroll.txt for guidance)");
puts("What will you mutter:");
puts("1. I harness the power of Water!");
puts("2. Jeg utnytter kraften til Laguz!");
puts("3. Aprovecho el poder de Aqua!");
scanf("%d", &choice);
while (choice > 3 || choice < 1)
{
puts("enter 1, 2, 3 or 99");
scanf("%d", &choice);
}
while (choice != 2)
{
puts("nothing seems to happen... maybe another word...");
scanf("%d", &choice);
}
puts("the scroll glows a conforting blue color, suddenly your hands feel damp, you can now use this on the door.");
puts("You ready yourself and shoot a powerful stream of water on the vines.");
puts("You stare at the vines as they grow greener and stronger from the water, the vines then grow at a rapid rate engulfing the narrow walkway that you stand on.");
puts("You find yourself losing balance on the decreasing surface, eventually falling into the pit...");
puts("You are never seen again...");
puts("Game Over");
choice = 99;
break;
}
else if (choice == 3) //earth choice
{
puts("You write the ancient rune of earth.");
puts("you must now read the writings properly or it will not work. (Hint:try using the rm28-scroll.txt for guidance)");
puts("What will you mutter:");
puts("1. Jeg utnytter kraften til Midgard!");
puts("2. I harness the power of Earth!");
puts("3. Aprovecho el poder de Tierra!");
scanf("%d", &choice);
while (choice > 3 || choice < 1 || choice == 99)
{
puts("enter 1, 2, 3 or 99");
scanf("%d", &choice);
}
while (choice != 1)
{
puts("nothing seems to happen... maybe another word...");
scanf("%d", &choice);
}
puts("suddenly the scroll glows emerald green, as your hands begin to feel one with the earth, you can use this on the door.");
puts("You ground yourself, and use your new powers on the vines.");
puts("To your suprise, the earth spell you wrote only makes the vines stronger, so much so that they begin to grow wildly out of control!");
puts("The vines begin to take up most of the surface you stand on...");
puts("You find yourself losing balance on the decreasing space, eventually falling into the pit...");
puts("You are never seen again...");
puts("Game Over");
choice = 99;
break;
}
}
else if (choice == 2)
{
puts("you turn your attention to the chest, you pull out the key and unlock the chest, inside you find a scroll which reads:");
puts("write a spell and this scroll will grant you power...");
puts("Unfortunately you only studied one year of spellcasting in highschool and the only three spells you remember from back then are:");
puts("1. fire");
puts("2. water");
puts("3. earth");
puts("What will you write:");
scanf("%d", &choice);
shanesFileWriter(choice);
if (choice == 1) //fire choice
{
puts("you write the ancient runes of fire onto the page.");
puts("you must now read the writings properly or it will not work. (Hint:try using the rm28-scroll.txt for guidance)");
puts("What will you mutter:");
puts("1. I harness the power of Fire!");
puts("2. Aprovecho el poder de Fuego!");
puts("3. Jeg utnytter kraften til Eldur!");
scanf("%d", &choice);
while (choice > 3 || choice < 1)
{
puts("enter 1, 2, 3 or 99");
scanf("%d", &choice);
}
while (choice != 3)
{
puts("nothing seems to happen... maybe another word...");
scanf("%d", &choice);
}
puts("The scroll flashes bright red with fiery power, suddenly your hands begin to feel hot, when suddenly they light ablaze! with this power you can shoot fire out of your hand!");
puts("You strike an agressive pose and engulf the vine covered door in flames.");
puts("As the fire and smoke subside, the door sits ajar with a light shining through.");
puts("What will you do:");
puts("1. walk through the door");
puts("2. Turn around and jump into the pit");
scanf("%d", &choice);
while (choice > 2 || choice < 1)
{
puts("enter 1, 2 or 99");
scanf("%d", &choice);
}
if (choice == 1)
{
//Victory!
puts("You open the door and are blinded by light, as your vision returns you realize you are in the middle of nowhere in the desert, and the door magically dissapears");
puts("You escaped, but now what?");
puts("Congrats you finished the game. Thank you for playing!");
choice = 99;
break;
}
else if (choice == 2)
{
puts("I'm not sure why you chose this, but you turn around and jump into the pit, you are never seen again....");
puts("Game Over...");
choice = 99;
break;
}
}
else if (choice == 2) //water choice
{
puts("You write down the ancient runes of water onto the page.");
puts("you must now read the writings properly or it will not work. (Hint:try using the rm28-scroll.txt for guidance)");
puts("What will you mutter:");
puts("1. I harness the power of Water!");
puts("2. Jeg utnytter kraften til Laguz!");
puts("3. Aprovecho el poder de Aqua!");
scanf("%d", &choice);
while (choice > 3 || choice < 1)
{
puts("enter 1, 2, 3 or 99");
scanf("%d", &choice);
}
while (choice != 2)
{
puts("nothing seems to happen... maybe another word...");
scanf("%d", &choice);
}
puts("the scroll glows a conforting blue color, suddenly your hands feel damp, you can now use this on the door.");
puts("You ready yourself and shoot a powerful stream of water on the vines.");
puts("You stare at the vines as they grow greener and stronger from the water, the vines then grow at a rapid rate engulfing the narrow walkway that you stand on.");
puts("You find yourself losing balance on the decreasing surface, eventually falling into the pit...");
puts("You are never seen again...");
puts("Game Over");
choice = 99;
break;
}
else if (choice == 3) //earth choice
{
puts("You write the ancient rune of earth.");
puts("you must now read the writings properly or it will not work. (Hint:try using the rm28-scroll.txt for guidance)");
puts("What will you mutter:");
puts("1. Jeg utnytter kraften til Midgard!");
puts("2. I harness the power of Earth!");
puts("3. Aprovecho el poder de Tierra!");
scanf("%d", &choice);
while (choice > 3 || choice < 1 || choice == 99)
{
puts("enter 1, 2, 3 or 99");
scanf("%d", &choice);
}
while (choice != 1)
{
puts("nothing seems to happen... maybe another word...");
scanf("%d", &choice);
}
puts("suddenly the scroll glows emerald green, as your hands begin to feel one with the earth, you can use this on the door.");
puts("You ground yourself, and use your new powers on the vines.");
puts("To your suprise, the earth spell you wrote only makes the vines stronger, so much so that they begin to grow wildly out of control!");
puts("The vines begin to take up most of the surface you stand on...");
puts("You find yourself losing balance on the decreasing space, eventually falling into the pit...");
puts("You are never seen again...");
puts("Game Over");
choice = 99;
break;
}
}
}
}
choice = 99;
break;
}
}
case 29:
{
while(choice != 99)
{
puts("you open the door and find ........");
scanf("%d",&choice);
}
break;
}
case 30:
{
while(choice != 99)
{
puts("You open the door and find yourself trapped in another room.");
puts("In front of you are three buttons: blue, red, yellow.");
puts("Lets play a game :)");
puts("Pick a button:");
puts("1.Blue");
puts("2.Red");
puts("3.Yellow");
scanf("%d", &choice);
while((choice != 1)&&(choice != 2)&&(choice != 3)&&(choice != 99))
{
puts("Enter '1' '2' '3'.");
scanf("%d", &choice);
}
if(choice == 1)
{
puts("Room 1");
puts("Water starts pouring out from the cieling, this room is starting to flood too!");
puts("You must find a way to stop the water or you will drown, time is running out!");
}
if(choice == 2)
{
puts("Room 2");
puts("Your hear a loud crank, the walls slowly start to close in");
puts("You must find a way to stop the walls, time is running out!");
}
if(choice == 3)
{
puts("A generator turns on, the air begins to get vaccumed out of the room");
printf("You must find a way to stop from suffocating, time is running out!");
}
int x=10;
while(x!=0)
{
printf("Timer %d minutes left\n", x);
puts("1.Look Around");
puts("2.Use Laptop");
puts("3.Use Tools");
puts("4.Open Door");
scanf("%d", &y);
switch(y)
{
case 1:
puts("You look around the room.");
puts("The lights in the room are flickering.");
puts("In the middle is a big metal crate and ontop is a laptop and small box on it.");
puts("One wall has a lot of light switches with a calander next to it.");
puts("The calander has the last day circled on the month of december.");
puts("The other wall has a lever with a stickynote next to it saying 'hex: FF'.");
puts("There is another door in front of you but its locked.");
x--;
break;
case 2:
puts("You go up to the laptop and open it up to a terminal");
puts("Please enter code:");
scanf("%d", &z);
if(z==1515)
{
puts("You hear a loud clank, the water stops pouring from the cieling");
}
if(z==1231)
{
puts("A vent opens up in the cieling:");
}
if((z!=1515)&&(z!=1231))
{
puts("Nothing happened.");
}
x--;
break;
case 3:
x--;
break;
case 4:
if(y==0)
{
puts("You have survived and escaped!!");
choice=99;
}
puts("Door is locked.");
x--;
break;
}
}
puts("Sorry time ran out and you died");
}
break;
}
case 31:
{
while(choice != 99)
{
puts("you open the door and find ........");
scanf("%d",&choice);
}
break;
}
case 32:
{
while(choice != 99)
{
puts("Welcome to room 32 where I already know what is on your mind.");
puts("I bet I can guess what number your thinking of with just a couple of instructions.");
puts("Up for the challenge? y/n");
scanf("%c", &decision);
if(decision == 'y')
{
puts("Pick a number, any number and make sure you remember that number.");
puts("Now double the number.");
puts("Now add 10 to the new number.");
puts("Divide it by 2");
puts("Now subtract that by the original number.");
puts("Your new number is now 5");
break;
}
else if(decision == 'n')
{
puts("I see you're in no mood for a little fun");
break;
}
}
break;
}
case 33:
{
while(choice != 99)
{
puts("you open the door and find ........");
scanf("%d",&choice);
}
break;
}
case 34:
{
int flag = 0;
while(choice != 99 && flag !=1)
{
int userchoice;//local variable to store user input.
/*Introduction of the game*/
printf("\n");
printf("Welcome to Mythical Island Adventure: you will face certain situations where your character has to make right decision to complete the game. Use your wits to survive the Mythical Island. Good Luck!\n");
printf("Choose the response between entering 1 or 2 whichever will take you further the game. Enter 99 to exit the room 34.\n");
/*game starts*/
/*get valid input from user for decision _1_ and take action based on decision. */
do{
printf("\n");//seperator
printf("You start on the journey to come back home to your family for Christmass holiday. Your magical wand transform into a broom stick and fly to the skies. In the middle of the ocean, storm came and broke your broom-stick. You find your self in the middle of the island or so called Mythical Island. What do you do?\n");
printf("1: You make a boat using coconut leaves and try to escape to the ocean.\n");
printf("2: You find and built a shelter using woods and stones.\n");
/*seperator*/
printf("\n");
printf("Your choice: ");
scanf(" %d", &userchoice);
flag = 1;
choice = userchoice;//choice set to userchoice if the user decides to exit _99_.
if(userchoice==1)
{
printf("\n");//seperator
printf("The boat is not strong enough and destroyed your journey going to your family celebration in Christmass holiday.\n");//return
printf("\n");
printf("Game Over!\n");
printf("\n");
}
else if(userchoice == 2)
{
printf("\n");
printf("Your shelter is built. You start exploring the island...\n");
}
else if(userchoice != 1 && userchoice != 2 && choice != 99)
{
printf("Invalid input! Please enter 1 or 2 only.\n");
}
}
while(userchoice != 1 && userchoice != 2 &&choice != 99);//to make sure choice isn't _99_.
if(choice == 99)
break;
if(choice != 1)//if they didn't choose _1_, then continue.
{
do{ //get valid input from the user for decision _2_ and take action based on decision.
printf("\n");//separator
printf("You see cyclops with their weapons while exploring the forest inside of the island. What do you do?\n");
printf("1: You try to fight and kill the monster using a wood.\n");
printf("2: You quickly hide and secretely go to the other side of the island.\n");
printf("\n");//separator
printf("Your choice: ");
scanf(" %d", &userchoice);
choice = userchoice;//set choice to userchoice if _99_ was read in to exit.
if(userchoice==1)
{
printf("\n");
printf("You became cyclops lunch, they said you are yummy and thank you for the meal.\n");
printf("\n");
printf("Game Over!\n");
printf("\n");
break;//I am using my void main to exit in the game only.
}
else if(userchoice==2)
{
printf("\n");
printf("You found fruits and coconut juice. You go back to your shelter and ate them to fight another day...\n");
}
else if(userchoice != 1 && userchoice != 2 && choice != 99)
{
printf("Invalid input! Please enter 1 or 2 only.\n");
}
} while(userchoice !=1 && userchoice !=2 && choice != 99);
if(choice == 99)
break;
/*if choice wasn't _1_, they are still in the game. */
if(choice != 1)
{
do{ //get valid input from user for decision _3_ and take action based on decision.
printf("\n"); //separator
printf("By exploring yesterday, you found out cyclops looks big and strong, and trolls looks small and weak. What do you do?\n");
printf("1: You approach the friendly trolls.\n");
printf("2: You approach cyclops to align yourself with powerful forces not sure their instention though.\n");
printf("\n");
printf("Your choice: ");
scanf(" %d", &userchoice);
choice = userchoice; //set choice to userchoice to see if _99_ was read in to exit.
if(userchoice==1)
{
printf("\n");
printf("The trolls are indeed friendly they invite you to their home, so your not alone anymore.\n");
}
else if(userchoice==2)
{
printf("\n"); //separator
printf("You try to communicate with cyclops. They get angry and attack you because their hunting prey got escape.\n");
printf("\n");
printf("Game Over!\n");
printf("\n");
break; //break instead of return _0_ because I'm using a void main, and want to exit my game not the whole program.
}
else if(userchoice != 1 && userchoice != 2 && choice != 99)
{
printf("Invalid input! Please enter 1 or 2 only.\n");
}
} while(userchoice !=1 && userchoice != 2 && choice != 99);
if(choice == 99)
break;
/*if choice wasn't _2_, they are still in the game*/
if(choice != 2)
{
do{/*get valid input from user for decision _4_ and take action based on decision. */
printf("\n");//separator
printf("The grandpa troll tells you a story the enemies of the island of them are the pirates and other are cyclops. The next day you help trolls to catch fishes on the sea. However, you see a pirate ship on the other side of the island. What do you do?\n");
printf("1: You try to befriend them and use the opportunity to get away from the island.\n");
printf("2: You hide and run to tell the trolls about the arriving pirates on the island...\n");
printf("\n");//separator
printf("Your choice: ");
scanf(" %d", &userchoice);
choice = userchoice; //to set choice to userchoice to see if _99_ was read in to exit.
if(userchoice==1)
{
printf("\n");//separator
printf("You are surrounded by pirates, and make you their slave. You are taken away from the island but stuck with pirates forever.\n");
printf("\n");
printf("Game Over!\n");
printf("\n");
break; //break instead of return _0_ because I'm using my void main and want to exit to my game only.
}
else if(userchoice == 2)
{
printf("\n");
printf("The trolls are happy you told them about the pirates are exploring the beach. The trolls create an invisible barrier to keep you and other trolls safe away from the pirates.\n");
}
else if(userchoice != 1 && userchoice != 2 && choice != 99)
{
printf("Invalid input! Please enter 1 or 2 only.\n");
}
} while(userchoice != 1 && userchoice !=2 && choice != 99);
if(choice == 99)
break;
if(choice != 1)
{
do{ /*get valid input from user for decision _5_ and take action based on decision.*/
printf("\n");
printf("The pirates did not find any interesting on the island, they leave. Trolls and you gather and celebrate. However, the celebration is too loud, the cyclops came, break the barrier, and attacked the trolls home. The grandfather troll try to combat the cyclops but failed. He hand you down his magical pendant What do you do?\n");
printf("1: Take the magical pendant to fix your broken flying broom stick, save your self and ran away.\n");
printf("2: Take the pendant, fix your magical wand, summon fairies alliances to save trolls including the grandfather from evil cyclops.\n");
printf("\n");//separator
printf("Your choice: ");
scanf(" %d", &userchoice);
choice = userchoice;//to set choice to userchoice to see if _ 99_ was read in to exit.
if(userchoice==1)
{
printf("\n");//separator
printf("Because of your selfishness, your flying broomstick broke, you trip over a cliff pluging to inevitable death.\n");
printf("\n");
printf("Game Over!\n");
printf("\n");
break;//break instead of return _0_ because I'm using a void main and only want to exit my game.
}
else if(userchoice==2)
{
printf("\n");//separator
printf("The grandfather troll let you keep his magical pendant as a present, teach you to summon door a shorcut passage way going to your family home. Everyone surprise to welcome you warmly to celebrate Christmass holiday with them.\n ");
printf("\n");
printf("You win the game. The End!\n");
printf("\n");//separator
}
else if(userchoice != 1 && userchoice != 2 && choice != 99)
{
printf("Invalid input! Please enter 1 or 2 only.\n");
}
} while(userchoice !=1 && userchoice !=2 && choice !=99);
if(choice == 99)
break;
}
}
}
}
}
break;
}
case 35:
{
while(choice != 99)
{
puts("you open the door and find ........");
scanf("%d",&choice);
}
break;
}
case 36:
{
char riddle[5] = { 'j','o','k','e','\0' };
char guess[6];
int math = 7;
char* ptr;
ptr = riddle;
while (choice != 99)
{
puts("You entered Room 36");
puts("you are now entering an Arena, Where you can see the Ruler telling you to step into the middle.");
puts("You can see three shadows walking to you, the Ruler askes you to choose one of the to fight them.");
puts(" What will you do?");
puts("1. Fight one of the Shadows");
puts("2. Try and talk to the Ruler");
puts("3. Try and run for your life");
scanf("%d", &choice);
switch (choice)
{
case 1:
puts("You chose to fight one of the shadows. Now chose with whom you will fight");
puts("1. shadow #1");
puts("2. shadow #2");
puts("3. shadow #3");
scanf("%d", &choice);
if (choice == 1)
{
puts(" You Chose Shadow 1, Shadow 1 is Albert Einstein");
puts("You are infront of Einstein stonished that you forgot ur fighting him.");
puts("Einstein: Instead of fighting with your hands lets fight with our brains. You need to solve this problem to beat me.");
problem1(math);
return EXIT_SUCCESS;
break;
}
if (choice == 2)
{
puts(" You Chose to fight Shadow #2.");
puts(" Shadow #2 is Thanos.");
puts(" Now you have done it. It's your time to try and fight the most powerful villain in the MCU. You are thinking 'how can i defeat him without any powers like the other Avengers?'");
puts(" A mysterious Person appers and tosses you a flask and tells you to drink it......");
puts("Will you drink it????");
puts(".......");
puts(".....");
puts("...");
puts("It was water it didnt do much for you..... ");
puts("You died");
return EXIT_SUCCESS;
break;
}
if (choice == 3)
{
puts("You chose to fight Shadow #3");
puts("Shadow #3 is Yoda.");
puts(" Star wars Theme starts to play in the background");
puts(" before the fight starts Yoda speaks.");
puts("Yoda: In trouble you are, May the force be with you");
puts(" flip a coin we will, to see the force with whom it is.");
flip();
if (flip() == 0)
{
puts("Win the game I did, die you will");
return EXIT_SUCCESS;
break;
}
else
{
puts("Lose the game i did, reward you will get now.");
return EXIT_SUCCESS;
break;
}
break;
}
else
{
puts("Please try again");
break;
}
case 2:
puts("You tried to talk to the Ruler");
puts("He only wants entertainment and He tells you that if you solve this riddle you are free to go but if you fail you are dead.");
puts("I can be cracked, I can be made. I can be told, I can be played. What am I?");
problem2(ptr);
return EXIT_SUCCESS;
break;
case 3:
puts("You try to run");
puts("You start to run to the arc you came in once inside you lock the doorbehind you,after taking your breath back you notice that there are two alley ways and you dont remember which path you took.");
puts("Choose path 1 or path 2");
scanf("%d", &choice);
if (choice == 1)
{
puts("You chose poorly and got caught by the guards and they killed you.");
return EXIT_SUCCESS;
break;
}
if (choice == 2)
{
puts("A strange flying light guided you throughout the passage and you are now outside the cave");
puts(" You are outside and ran as far as you could from the cave to never return....");
return EXIT_SUCCESS;
break;
}
else
puts("please try again");
break;
}
}
break;
}
case 37:
{
while(choice != 99)
{
puts("you open the door and find ........");
scanf("%d",&choice);
}
break;
}
}
}
}
void extraCredit(void)
{
printf("%s", "You have gained extra credit!\nIf you beat me in a duel!\n");
printf("%s", "DUEL MECHANICS WILL BE IMPLEMENTED IN THE NEXT UPDATE\n\n");
}
void ignoreExtra(void)
{
int counter = 0;
printf("%s", "Take the extra credit, I'm not gonna ask you again!\n");
int choice;
printf("%s", "Please type 1 for extra credit\n or you will be kicked out of room THREE!\n");
scanf("%d", &choice);
switch(choice)
{
case 1:
extraCredit();
break;
defualt:
printf("%s", "You have been kicked!...LEAVE THIS ROOM AT ONCE!\n");
break;
}
}
int choice1(int number)
{
int answer = 0;
int guess = 0;
printf(" %d + (%d^2) - (%d) = ?", number, 8, 6);
scanf(" %d", &guess);
answer = (number + (pow(8, 2)) - 6);
if(answer == guess)
{
puts("\nYou have guessed the anwer correctly. You may access the laptop to get out of the mansion...Good Job!\n");
return EXIT_SUCCESS;
}
else
{
printf("\nThe answer was %d. You guessed it wrong. You have failed...\n", answer);
return EXIT_SUCCESS;
}
}
int choice2(char *ptr)
{
int size = 40, i, length = 0;
char copy[size];
char guess[size];
strcpy(copy, ptr);
puts("Please enter your guess(one chance):");
scanf(" %s", guess);
length = strlen(guess);
for(i = 0; i < length;i++)
{
if(isupper(guess[i]))
{
guess[i] = tolower(guess[i]);
}
}
if(!strcmp(copy, guess))
{
puts("You guessed correctly! You may have access to the laptop!\n");
}
else
{
puts("Your guess was incorrect! Better luck next time!\n");
}
return EXIT_SUCCESS;
}
int choice3(int number1)
{
int answer = 0;
// printf("magic number is : %d\n", number1);
printf("10 + magic number = %d\n", (10 + number1));
printf("5 * magic number = %d\n", (5 * number1));
printf("20 - magic number = %d\n", (20 - number1));
printf("(4^2) + magic Number = %.2f\n", ((pow(4, 2) + number1)));
printf("What is your guess? ");
scanf(" %d", &answer);
if(answer == number1)
{
printf("You guessed it correctly! Now you have access to the laptop!\n");
return EXIT_SUCCESS;
}
else
{
puts("You guessed it wrong! You are stuck in the room. \n");
return EXIT_SUCCESS;
}
}
int choice4(int *ptr1)
{
int i, j, k;
int sum = 0, guess = 0;
for(k = 0; k < 6; k++)
{
printf("Array[%d]= %d ",k+1, *ptr1);
sum += *ptr1;
ptr1++;
}
printf("What is your guess: ");
scanf(" %d", &guess);
if(guess == sum)
{
printf("\nSum: %d\n. You guessed it right! You have access to the laptop!\n", sum);
return EXIT_SUCCESS;
}
else
{
printf("\nSum: %d\n. You guessed it wrong! You are stuck in the room!\n", sum);
return EXIT_SUCCESS;
}
}
int choice5(void)
{
printf("************************************\n");
printf("***************YOU******************\n");
printf("***************ARE******************\n");
printf("************FINISHED!***************\n");
printf("************************************\n");
return EXIT_SUCCESS;
}
void gameRules() //simple function that prints rules of game to user...
{
puts("\nThe rules of this card game - craps - are simple...");
puts("If you roll a 7 or 11 immediately...you win!");
puts("If you roll a 2, 3, or 12 immediately...you lose!");
puts("If you roll anything besides those numbers, you want to roll that number again before you roll a 7 to win!\n");
}
void gameCraps() //function play craps that does the logic for the game...
{
int randomint(int x, int y); //function to call random integer...
srand(time(NULL)); //random seed set to clock time
int die1, die2, die3, die4, rollcount, rollcount2; //4 die and 2 roll ints
die1 = randomint(1,6); //setting first die to equal random int from 1-6
die2 = randomint(1,6); //same as above with second die
rollcount = die1 + die2; //roll function equals die 1 and die 2....
printf("You rolled a %i\n",rollcount); //print statement letting user know their roll
if(rollcount == 7 || rollcount == 11)//if roll is equal to 7 or 11...player wins game
{
printf("You Win!\n"); //let user know they won game
printf("Enter 'y' or 'Y' to roll again. Enter '99' to exit program.\n");
return;
}
else if(rollcount == 2 || rollcount == 3 || rollcount == 12) //if roll is equal to a 2, 3, or 12....player loses game
{
printf("You Lose :(\n"); //let user know they lost game
printf("Enter 'y' or 'Y' to roll again. Enter '99' to exit program.\n");
return;
}
else // otherwise on every other number roll...
{
do //run this command at least once...while conditions above aren't met...
{
die3 = randomint(1,6); //similar to above, set die3 to equal a random int between 1-6
die4 = randomint(1,6); //same as above w/4th die
rollcount2 = die3 + die4; //our 2nd roll equals die 3 + die 4
printf("You rolled a %d\n", rollcount2); //let user know what they rolled w/2nd roll...
if(rollcount == rollcount2) //if our 2nd roll is equal to our first roll...
{
printf("You Win\n"); //let user know they won game
printf("Enter 'y' or 'Y' twice to roll again. Enter '99' to exit program.\n");
return;
}
}
while(rollcount != 7); //while our 2nd roll is not equal to 7...
printf("You Lose :(\n"); //let user know they lost game...
printf("Enter 'y' or 'Y' twice to roll again. Enter '99' to exit program.\n");
}
}
int randomint(int x, int y) //random integer function to work craps game
{
return rand()%(y - x + 1); //ensures random number is generated
}
char prompt(void)
{
char choose;
puts("\nYou turn around and see a door that wasnt there before");
puts("Do you walk in?");
puts("y/n?");
scanf(" %c", &choose); //gets choice from use
return choose;
}
void randomFill(int *ptr) //function definition to fill array1 with random int 0-9:wq
{
int i;
for(i = 0; i < 5; i++)
{
ptr[i] = rand()%10;
}
}
void room27Output(int z)
{
if(z == 1)
{
puts("\nYou are trapped in here with us");
puts("Game Over");
}
else
{
puts("\nYou are sitting in the dark");
puts("Having fun?");
puts("Bye\n");
}
}
void oddDeviceShenanigans(void) {
puts("");
puts("As you you make contact with the odd device, your vision goes grey and then you black out.");
puts("");
puts("In a dream like state you feel yourself falling...and falling....");
puts("");
puts("You find yourself back in the room where you started!!!!!");
puts("");
}
int drunkBehavior(void) {
int x = 0;
x = 1 + rand()%10;
return x;
}
void bRed(void)
{
printf("\033[1;31m");
}
void bYellow(void)
{
printf("\033[01;33m");
}
void bBlue(void)
{
printf("\033[1;34m");
}
void bCyan(void)
{
printf("\033[0;36m");
}
void bGreen(void)
{
printf("\033[1;32m");
}
void reset (void)
{
printf("\033[0m");
}
void displayInputs(int c)
{
bYellow(
);
printf("Inputs: %d / 9\n", c);
reset(
);
}
void displayStats(int c, int s)
{
bYellow(
);
printf("Inputs: %d / 9\n", c);
printf("Score: %d / 37\n", s);
reset(
);
}
void woman(void)
{
bBlue();
puts(" __. ");
puts(" .qd$$$$bp.");
puts(" .q$$$$$$$$$n.");
puts(" .$$$$$$$$$$$$$$");
puts(" .q$$$$$$$$$$$$$$$");
puts(" .$$$$$$$$$$$Y ####;");
puts(" .q$$$$$$$$P^\"_.`;#### ");
puts(" q$$$$$$;} , /####P ");
puts(" .$$$P^::Y$/` _ .:.$$/");
puts(" .L.;.. \\ `.__-:.. \\$P");
puts(" $':. __.. : :.. :");
puts("");
reset();
}
void congratulations(void)
{
bBlue();
puts("\n");
puts(" __.");
puts(" .qd$$$$bp.");
puts(" .q$$$$$$$$$$n.");
puts(" .$$$$$$$$$$$$$$");
puts(" .q$$$$$$$$$$$$$$$");
puts(" .$$$$$$$$Y ######;");
puts(" .q$$$$PP^/ _`\\;###");
puts(" &$$$$;}/- - \\;##");
puts(" .2$$$$$/` . /####P");
puts(" q$$$$$$$$\\ __. .##$$#");
puts(" .$$...... ; . ./####\\$$P");
puts(" .L;;------- } `` {########");
puts(" $'\":$$ ___) (___ ");
puts(" ```` -- -- ````");
puts(" V");
puts("");
puts(" _____ _ _ __ __ __ ");
puts("|_ _| | | | \\ \\ / / \\ \\");
puts(" | | | |__ __ _ _ __ | | __ \\ V /___ _ _ (_) |");
puts(" | | | '_ \\ / _` | '_ \\| |/ / \\ // _ \\| | | | | |");
puts(" | | | | | | (_| | | | | < | | (_) | |_| | _| |");
puts(" \\_/ |_| |_|\\__,_|_| |_|_|\\_\\ \\_/\\___/ \\__,_| (_) |");
puts(" /_/ ");
reset();
}
///////////Shanes room methods///////////
void shanesFileWriter(int choice)
{
FILE *write;
char plaintext[256];
char fire[50];
char water[50];
char earth[50];
if (choice != 1 && choice != 2 && choice != 3 && choice != 99)
{
puts("Incorrect input try typing 1.Fire, 2.Water, or 3.Earth");
scanf("%d", &choice);
}else
{
write = fopen("rm28-scroll.txt","w");
char plaintext[256] = "write a spell and this scroll will grant you power...";
char fire[50] = "Jeg utnytter kraften til Eldur";
char water[50] = "Jeg utnytter kraften til Laguz";
char earth[50] = "Jeg utnytter kraften til Midgard";
}
switch (choice)
{
case 1:
//fire
puts("fire puts");
fprintf(write, "%s\n%s" ,plaintext,fire);
break;
case 2:
//water
fprintf(write, "%s\n%s", plaintext, water);
break;
case 3:
//earth
fprintf(write, "%s\n%s", plaintext, earth);
break;
case 99:
return;
default:
shanesFileWriter(choice);
break;
}
fclose(write);
}
///////////Shanes room methods end/////////
void caseRandomizer(char* name, int* bananaAmount, int* orangeAmount)
{
int charCounter = 0,
randomCase = 0,
lowerAmount = 0,
upperAmount = 0,
winLoseAmount = 0;
puts("You have entered the case randomizer room ...\n"
"Your name's letters' cases are randomized. If there are more capital letters, you are rewarded!\n"
"Otherwise, there will be punishment ... ");
for (charCounter = 0; charCounter < 256; charCounter++)
{
randomCase = rand() % 2;
if (randomCase == 0)
{
name[charCounter] = toupper(name[charCounter]);
}
else
{
name[charCounter] = tolower(name[charCounter]);
}
}
for (charCounter = 0; charCounter < 256; charCounter++)
{
if (islower(name[charCounter]))
{
lowerAmount++;
}
else if (isupper(name[charCounter]))
{
upperAmount++;
}
}
if (upperAmount > lowerAmount)
{
winLoseAmount = 1 + rand() % 7;
*bananaAmount += winLoseAmount;
*orangeAmount += winLoseAmount;
printf("Congratulations! You have won %d bananas and oranges!\n", winLoseAmount);
}
else
{
winLoseAmount = 1 + rand() % 3;
*bananaAmount -= winLoseAmount;
*orangeAmount -= winLoseAmount;
printf("Unfortunately, you lost and lose %d bananas and oranges ... \n\n", winLoseAmount);
}
}
void drawPicture(void)
{
puts("You enter the room and can faintly see a picture at the distance. As you walk closer to the image, you see ... \n");
puts(" _--~~--_");
puts(" /~/_| |_\\~\\");
puts(" |____________|");
puts(" |[][][][][][]|");
puts(" __| __ |__");
puts(" | ||. | == | |");
puts(" (| ||__| == | |)");
puts(" | |[] [] == | |");
puts(" | |____________| |");
puts(" /__\\ /__\\");
puts(" ~~ ~~ ");
puts("");
}
void roomPrompt(int* userChoice)
{
do
{
puts("Main Menu:\n"
"1) Enter Room 1.\n"
"2) Enter Room 2.\n"
"3) Enter Room 3.\n");
printf("Enter the Room you wish to enter: ");
scanf("%d", userChoice);
} while ((*userChoice < 1) || (*userChoice > 3));
}
void gorillaRoom(int* bananaAmount, int* orangeAmount)
{
int userChoice = 0,
winLoseAmount = 0,
chanceToSteal = 0;
printf("You enter the room and on the far end of the room, your eyes easily catch a very large gorilla sleeping soundly.\n"
"Behind the gorilla, you see a large pile of bananas.\n"
"If you wish to steal the bananas from the gorilla, enter 1. Otherwise, enter 0 to exit: ");
scanf("%d", &userChoice);
userChoice = toupper(userChoice);
if (userChoice == 0)
{
puts("Better safe than sorry ...");
}
else if (userChoice == 1)
{
chanceToSteal = 1 + rand() % 100;
winLoseAmount = 1 + rand() % 10;
puts("You decide to attempt to steal the bananas from the gorilla ...");
if (chanceToSteal >= 60)
{
*bananaAmount += winLoseAmount;
printf("Success! You were able to successfully steal %d bananas from the gorilla and made a hasty escape back into the main room.\n\n", winLoseAmount);
}
else
{
*bananaAmount -= winLoseAmount;
printf("As you make your way to the other side of the room, you slip on a banana ...\n"
"In doing so, you fall and the imapact with the ground made a large enough noise to wake the gorilla!\n"
"Not daring to fight him, he steals %d bananas!\n"
"You make your way back to the Main Room ... \n\n", winLoseAmount);
}
chanceToSteal = 1 + rand() % 100;
if (chanceToSteal > 85)
{
winLoseAmount = 1 + rand() & 5;
*orangeAmount += winLoseAmount;
puts("As you leave the room back into the Main Room, you notice some oranges in the dark corner!\n"
"Before the gorilla can notice, you are able to snatch some and quickly leave through the door.\n");
}
}
else
{
puts("Incorrect input! You are returning to the Main Room ...\n");
}
}
void problem1(int math)
{
int guess;
printf("What is x in this equation? \n");
printf("5x + 6 = 3x - 8 \n");
puts("X is?");
scanf("%d", &guess);
if (guess == math)
{
puts("You are correct!");
puts("You win the challenge against Einstein, now you can ask the ruler to let you go.");
}
else
{
puts("Your answer was wrong, better luck next time");
}
}
void problem2 (char *ptr)
{
int size = 30;
char prob[size];
char guess[size];
strcpy(prob, ptr);
puts("Your Guess is?");
scanf("%s", guess);
for (int i = 0; i < 0; i++)
{
if(isupper(guess[i]))
{
guess[i] = tolower(guess[i]);
}
}
if(!strcmp(prob, guess))
{
puts(" Congratulations you have guessed Correctly");
}
else
{
puts("Awwwwww You guessed Poorly");
puts("As promised Its time to die");
}
}
int flip()
{
int i = rand() %2;
if(i ==0)
return 0;
else
return 1;
}
int rollsmm21()
{
int p =0;
puts("How many times would you like to roll the dice? ");
scanf("%d", &p);
return p;
}
int rollmm21()
{
int p = 0;
p = 1 + rand() % 10;
printf("%d \n", p);
return p;
}
void oputmm21(int d1, int d2, int d3, int d4, int d5, int d6, int d7, int d8, int d9, int d10)
{
printf("The resaults of the throes are ");
printf("1: %d, 2: %d, 3: %d, ", d1, d2, d3);
printf("4: %d, 5: %d,", d4, d5);
printf("6: %d, 7: %d, 8: %d, ", d6, d7 +7, d8);
printf("9: %d, 10: %d \n", d9, d10);
}
void weaponPower(int p){
printf("%d\n", p); //ROOM 25
}
void randStr18(char str18[], int z)
{
int x,y,i;
char c;
for(i=0;i<z;i++)
{
x = (rand()%3);
if (x==0)
{
y = (rand()%(('Z') - ('A'))+1)+('A');
}
else if(x==1)
{
y = (rand()%(('z') - ('a'))+1)+('a');
}
else
{
y = (rand()%(('9') - ('0'))+1)+('0');
}
c=y;
str18[i]=c;
}
str18[i]='\0';
}
|
the_stack_data/600645.c | #include<stdio.h>
#include<unistd.h>
#include<string.h>
int main()
{
int pipefds1[2], pipefds2[2];
int returnstatus1, returnstatus2;
int pid;
char parentwrite[20];// = "string";
char readmessage[20];
returnstatus1 = pipe(pipefds1);
if (returnstatus1 == -1)
{
printf("Unable to create pipe I \n");
return 1;
}
returnstatus2 = pipe(pipefds2);
if (returnstatus2 == -1)
{
printf("Unable to create pipe 2 \n");
return 1;
}
pid = fork();
if (pid > 0) // Parent process
{
close(pipefds1[0]); // Close the unwanted pipel read side
close(pipefds2[1]); // Close the unwanted pipe2 write side
printf("\nEnter string1 and string 2:\n");
char s1[20],s2[20];
gets(s1);
read(pipefds2[0], s2, sizeof(s2));
strcat(s1,s2);
printf("In Parent: Reading from pipe 2 - string2 is %s\n", s2);
printf("In Parent: Writing to pipe I - Conacatenated string is %s\n",s1);
write(pipefds1[1], s1,sizeof(s1)+1);
}
else
{
close(pipefds1[1]); // Close the unwanted pipel write side
close(pipefds2[0]); // Close the unwanted pipe2 read side
//printf("\nEnter string2:\n");
char s2[20];
gets(s2);
printf("In Child:Writing to pipe 2 – string2 is %s\n",s2);
write(pipefds2[1], s2,sizeof(s2)+1);
read(pipefds1[0], readmessage, sizeof(readmessage));
printf("In Child: Reading from pipe I – Conacatenated string is %s\n", readmessage);
return 0;
}
} |
the_stack_data/128608.c | /***
* This code is a part of EvoApproxLib library (ehw.fit.vutbr.cz/approxlib) distributed under The MIT License.
* When used, please cite the following article(s): V. Mrazek, R. Hrbacek, Z. Vasicek and L. Sekanina, "EvoApprox8b: Library of approximate adders and multipliers for circuit design and benchmarking of approximation methods". Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017, Lausanne, 2017, pp. 258-261. doi: 10.23919/DATE.2017.7926993
* This file contains a circuit from evoapprox8b dataset. Note that a new version of library was already published.
***/
#include <stdint.h>
#include <stdlib.h>
/// Approximate function mul8_472
/// Library = EvoApprox8b
/// Circuit = mul8_472
/// Area (180) = 6184
/// Delay (180) = 3.900
/// Power (180) = 2900.20
/// Area (45) = 446
/// Delay (45) = 1.410
/// Power (45) = 251.40
/// Nodes = 102
/// HD = 271283
/// MAE = 107.54803
/// MSE = 23257.61133
/// MRE = 3.32 %
/// WCE = 801
/// WCRE = 212 %
/// EP = 96.9 %
uint16_t mul8_472(uint8_t a, uint8_t b)
{
uint16_t c = 0;
uint8_t n0 = (a >> 0) & 0x1;
uint8_t n2 = (a >> 1) & 0x1;
uint8_t n4 = (a >> 2) & 0x1;
uint8_t n6 = (a >> 3) & 0x1;
uint8_t n8 = (a >> 4) & 0x1;
uint8_t n10 = (a >> 5) & 0x1;
uint8_t n12 = (a >> 6) & 0x1;
uint8_t n14 = (a >> 7) & 0x1;
uint8_t n16 = (b >> 0) & 0x1;
uint8_t n18 = (b >> 1) & 0x1;
uint8_t n20 = (b >> 2) & 0x1;
uint8_t n22 = (b >> 3) & 0x1;
uint8_t n24 = (b >> 4) & 0x1;
uint8_t n26 = (b >> 5) & 0x1;
uint8_t n28 = (b >> 6) & 0x1;
uint8_t n30 = (b >> 7) & 0x1;
uint8_t n33;
uint8_t n34;
uint8_t n35;
uint8_t n37;
uint8_t n38;
uint8_t n41;
uint8_t n48;
uint8_t n49;
uint8_t n54;
uint8_t n73;
uint8_t n74;
uint8_t n77;
uint8_t n83;
uint8_t n93;
uint8_t n97;
uint8_t n126;
uint8_t n148;
uint8_t n197;
uint8_t n264;
uint8_t n275;
uint8_t n282;
uint8_t n365;
uint8_t n398;
uint8_t n405;
uint8_t n414;
uint8_t n415;
uint8_t n445;
uint8_t n514;
uint8_t n532;
uint8_t n548;
uint8_t n648;
uint8_t n664;
uint8_t n665;
uint8_t n682;
uint8_t n683;
uint8_t n749;
uint8_t n764;
uint8_t n782;
uint8_t n798;
uint8_t n814;
uint8_t n882;
uint8_t n898;
uint8_t n899;
uint8_t n914;
uint8_t n915;
uint8_t n932;
uint8_t n933;
uint8_t n948;
uint8_t n949;
uint8_t n998;
uint8_t n1014;
uint8_t n1032;
uint8_t n1048;
uint8_t n1064;
uint8_t n1082;
uint8_t n1099;
uint8_t n1114;
uint8_t n1132;
uint8_t n1133;
uint8_t n1148;
uint8_t n1149;
uint8_t n1164;
uint8_t n1165;
uint8_t n1182;
uint8_t n1183;
uint8_t n1198;
uint8_t n1199;
uint8_t n1214;
uint8_t n1215;
uint8_t n1232;
uint8_t n1248;
uint8_t n1264;
uint8_t n1282;
uint8_t n1298;
uint8_t n1314;
uint8_t n1332;
uint8_t n1348;
uint8_t n1364;
uint8_t n1382;
uint8_t n1383;
uint8_t n1398;
uint8_t n1399;
uint8_t n1401;
uint8_t n1414;
uint8_t n1415;
uint8_t n1432;
uint8_t n1433;
uint8_t n1448;
uint8_t n1449;
uint8_t n1464;
uint8_t n1465;
uint8_t n1482;
uint8_t n1483;
uint8_t n1514;
uint8_t n1532;
uint8_t n1548;
uint8_t n1564;
uint8_t n1582;
uint8_t n1598;
uint8_t n1614;
uint8_t n1632;
uint8_t n1648;
uint8_t n1649;
uint8_t n1664;
uint8_t n1665;
uint8_t n1682;
uint8_t n1683;
uint8_t n1698;
uint8_t n1699;
uint8_t n1714;
uint8_t n1715;
uint8_t n1732;
uint8_t n1733;
uint8_t n1748;
uint8_t n1749;
uint8_t n1764;
uint8_t n1782;
uint8_t n1798;
uint8_t n1814;
uint8_t n1832;
uint8_t n1848;
uint8_t n1864;
uint8_t n1882;
uint8_t n1898;
uint8_t n1899;
uint8_t n1914;
uint8_t n1915;
uint8_t n1932;
uint8_t n1933;
uint8_t n1948;
uint8_t n1949;
uint8_t n1964;
uint8_t n1965;
uint8_t n1982;
uint8_t n1983;
uint8_t n1998;
uint8_t n1999;
uint8_t n2014;
uint8_t n2015;
n33 = ~(n28 | n12 | n6);
n34 = ~(n8 & n24 & n10);
n35 = ~(n8 & n24 & n10);
n37 = ~(n18 | n28 | n6);
n38 = ~(n18 | n34 | n10);
n41 = n2 & n38;
n48 = ~(n28 & n12 & n0);
n49 = ~(n28 & n12 & n0);
n54 = ~((n35 & n48) | n18);
n73 = n33;
n74 = ~(n73 & n12);
n77 = (n6 & n20) | (~n6 & n41);
n83 = n6 & n37;
n93 = n49;
n97 = ~(n18 & n38);
n126 = ~(n93 & n74);
n148 = n14 & n16;
n197 = n97;
n264 = n12 & n18;
n275 = ~n197;
n282 = n14 & n18;
n365 = ~n77;
n398 = n148 ^ n264;
n405 = n93;
n414 = n275 ^ n282;
n415 = n275 & n282;
n445 = n77;
n514 = n10 & n20;
n532 = n12 & n20;
n548 = n14 & n20;
n648 = n398 | n514;
n664 = n414 ^ n532;
n665 = n414 & n532;
n682 = (n415 ^ n548) ^ n665;
n683 = (n415 & n548) | (n548 & n665) | (n415 & n665);
n749 = n6 & n22;
n764 = n8 & n22;
n782 = n10 & n22;
n798 = n12 & n22;
n814 = n14 & n22;
n882 = n749 ^ n126;
n898 = n648 ^ n764;
n899 = n648 & n764;
n914 = (n664 ^ n782) ^ n899;
n915 = (n664 & n782) | (n782 & n899) | (n664 & n899);
n932 = (n682 ^ n798) ^ n915;
n933 = (n682 & n798) | (n798 & n915) | (n682 & n915);
n948 = (n683 ^ n814) ^ n933;
n949 = (n683 & n814) | (n814 & n933) | (n683 & n933);
n998 = n4 & n24;
n1014 = n6 & n24;
n1032 = n8 & n24;
n1048 = n10 & n24;
n1064 = n12 & n24;
n1082 = n14 & n24;
n1099 = n365;
n1114 = (n1099 & n764) | (~n1099 & n405);
n1132 = n882 ^ n998;
n1133 = n882 & n998;
n1148 = (n898 ^ n1014) ^ n1133;
n1149 = (n898 & n1014) | (n1014 & n1133) | (n898 & n1133);
n1164 = (n914 ^ n1032) ^ n1149;
n1165 = (n914 & n1032) | (n1032 & n1149) | (n914 & n1149);
n1182 = (n932 ^ n1048) ^ n1165;
n1183 = (n932 & n1048) | (n1048 & n1165) | (n932 & n1165);
n1198 = (n948 ^ n1064) ^ n1183;
n1199 = (n948 & n1064) | (n1064 & n1183) | (n948 & n1183);
n1214 = (n949 ^ n1082) ^ n1199;
n1215 = (n949 & n1082) | (n1082 & n1199) | (n949 & n1199);
n1232 = n0 & n1014;
n1248 = n2 & n26;
n1264 = n4 & n26;
n1282 = n6 & n26;
n1298 = n8 & n26;
n1314 = n10 & n26;
n1332 = n12 & n26;
n1348 = n14 & n26;
n1364 = n1114 | n1232;
n1382 = n1132 | n1248;
n1383 = n1132 | n1248;
n1398 = (n1148 ^ n1264) ^ n1383;
n1399 = (n1148 & n1264) | (n1264 & n1383) | (n1148 & n1383);
n1401 = ~(n97 | n998);
n1414 = (n1164 ^ n1282) ^ n1399;
n1415 = (n1164 & n1282) | (n1282 & n1399) | (n1164 & n1399);
n1432 = (n1182 ^ n1298) ^ n1415;
n1433 = (n1182 & n1298) | (n1298 & n1415) | (n1182 & n1415);
n1448 = (n1198 ^ n1314) ^ n1433;
n1449 = (n1198 & n1314) | (n1314 & n1433) | (n1198 & n1433);
n1464 = (n1214 ^ n1332) ^ n1449;
n1465 = (n1214 & n1332) | (n1332 & n1449) | (n1214 & n1449);
n1482 = (n1215 ^ n1348) ^ n1465;
n1483 = (n1215 & n1348) | (n1348 & n1465) | (n1215 & n1465);
n1514 = n2 & n28;
n1532 = n4 & n28;
n1548 = n6 & n28;
n1564 = n8 & n28;
n1582 = n10 & n28;
n1598 = n12 & n28;
n1614 = n14 & n28;
n1632 = n1382 | n1414;
n1648 = n1398 ^ n1514;
n1649 = n1398 & n1514;
n1664 = (n1414 ^ n1532) ^ n1649;
n1665 = (n1414 & n1532) | (n1532 & n1649) | (n1414 & n1649);
n1682 = (n1432 ^ n1548) ^ n1665;
n1683 = (n1432 & n1548) | (n1548 & n1665) | (n1432 & n1665);
n1698 = (n1448 ^ n1564) ^ n1683;
n1699 = (n1448 & n1564) | (n1564 & n1683) | (n1448 & n1683);
n1714 = (n1464 ^ n1582) ^ n1699;
n1715 = (n1464 & n1582) | (n1582 & n1699) | (n1464 & n1699);
n1732 = (n1482 ^ n1598) ^ n1715;
n1733 = (n1482 & n1598) | (n1598 & n1715) | (n1482 & n1715);
n1748 = (n1483 ^ n1614) ^ n1733;
n1749 = (n1483 & n1614) | (n1614 & n1733) | (n1483 & n1733);
n1764 = n0 & n30;
n1782 = n2 & n30;
n1798 = n4 & n30;
n1814 = n6 & n30;
n1832 = n8 & n30;
n1848 = n10 & n30;
n1864 = n12 & n30;
n1882 = n14 & n30;
n1898 = n1648 ^ n1764;
n1899 = n1648 & n1764;
n1914 = (n1664 ^ n1782) ^ n1899;
n1915 = (n1664 & n1782) | (n1782 & n1899) | (n1664 & n1899);
n1932 = (n1682 ^ n1798) ^ n1915;
n1933 = (n1682 & n1798) | (n1798 & n1915) | (n1682 & n1915);
n1948 = (n1698 ^ n1814) ^ n1933;
n1949 = (n1698 & n1814) | (n1814 & n1933) | (n1698 & n1933);
n1964 = (n1714 ^ n1832) ^ n1949;
n1965 = (n1714 & n1832) | (n1832 & n1949) | (n1714 & n1949);
n1982 = (n1732 ^ n1848) ^ n1965;
n1983 = (n1732 & n1848) | (n1848 & n1965) | (n1732 & n1965);
n1998 = (n1748 ^ n1864) ^ n1983;
n1999 = (n1748 & n1864) | (n1864 & n1983) | (n1748 & n1983);
n2014 = (n1749 ^ n1882) ^ n1999;
n2015 = (n1749 & n1882) | (n1882 & n1999) | (n1749 & n1999);
c |= (n1401 & 0x1) << 0;
c |= (n54 & 0x1) << 1;
c |= (n83 & 0x1) << 2;
c |= (n1632 & 0x1) << 3;
c |= (n445 & 0x1) << 4;
c |= (n1364 & 0x1) << 5;
c |= (n1632 & 0x1) << 6;
c |= (n1898 & 0x1) << 7;
c |= (n1914 & 0x1) << 8;
c |= (n1932 & 0x1) << 9;
c |= (n1948 & 0x1) << 10;
c |= (n1964 & 0x1) << 11;
c |= (n1982 & 0x1) << 12;
c |= (n1998 & 0x1) << 13;
c |= (n2014 & 0x1) << 14;
c |= (n2015 & 0x1) << 15;
return c;
}
|
the_stack_data/22012933.c | /*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*/
#include <arpa/inet.h>
#include <linux/if_packet.h>
#include <linux/ip.h>
#include <linux/udp.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <sys/ioctl.h>
#include <sys/socket.h>
#include <net/if.h>
#include <netinet/ether.h>
#define DEST_MAC0 0x00
#define DEST_MAC1 0x00
#define DEST_MAC2 0x00
#define DEST_MAC3 0x00
#define DEST_MAC4 0x00
#define DEST_MAC5 0x00
#define ETHER_TYPE 0x0800
#define DEFAULT_IF "eth0"
#define BUF_SIZ 1024
int main(int argc, char *argv[])
{
char sender[INET6_ADDRSTRLEN];
int sockfd, ret, i;
int sockopt;
ssize_t numbytes;
struct ifreq ifopts; /* set promiscuous mode */
struct ifreq if_ip; /* get ip addr */
struct sockaddr_storage their_addr;
uint8_t buf[BUF_SIZ];
char ifName[IFNAMSIZ];
/* Get interface name */
if (argc > 1)
strcpy(ifName, argv[1]);
else
strcpy(ifName, DEFAULT_IF);
/* Header structures */
struct ether_header *eh = (struct ether_header *) buf;
struct iphdr *iph = (struct iphdr *) (buf + sizeof(struct ether_header));
struct udphdr *udph = (struct udphdr *) (buf + sizeof(struct iphdr) + sizeof(struct ether_header));
memset(&if_ip, 0, sizeof(struct ifreq));
/* Open PF_PACKET socket, listening for EtherType ETHER_TYPE */
if ((sockfd = socket(PF_PACKET, SOCK_RAW, htons(ETHER_TYPE))) == -1) {
perror("listener: socket");
return -1;
}
/* Set interface to promiscuous mode - do we need to do this every time? */
strncpy(ifopts.ifr_name, ifName, IFNAMSIZ-1);
ioctl(sockfd, SIOCGIFFLAGS, &ifopts);
ifopts.ifr_flags |= IFF_PROMISC;
ioctl(sockfd, SIOCSIFFLAGS, &ifopts);
/* Allow the socket to be reused - incase connection is closed prematurely */
if (setsockopt(sockfd, SOL_SOCKET, SO_REUSEADDR, &sockopt, sizeof sockopt) == -1) {
perror("setsockopt");
close(sockfd);
exit(EXIT_FAILURE);
}
/* Bind to device */
if (setsockopt(sockfd, SOL_SOCKET, SO_BINDTODEVICE, ifName, IFNAMSIZ-1) == -1) {
perror("SO_BINDTODEVICE");
close(sockfd);
exit(EXIT_FAILURE);
}
repeat: printf("listener: Waiting to recvfrom...\n");
numbytes = recvfrom(sockfd, buf, BUF_SIZ, 0, NULL, NULL);
printf("listener: got packet %lu bytes\n", numbytes);
/* Check the packet is for me */
if (eh->ether_dhost[0] == DEST_MAC0 &&
eh->ether_dhost[1] == DEST_MAC1 &&
eh->ether_dhost[2] == DEST_MAC2 &&
eh->ether_dhost[3] == DEST_MAC3 &&
eh->ether_dhost[4] == DEST_MAC4 &&
eh->ether_dhost[5] == DEST_MAC5) {
printf("Correct destination MAC address\n");
} else {
printf("Wrong destination MAC: %x:%x:%x:%x:%x:%x\n",
eh->ether_dhost[0],
eh->ether_dhost[1],
eh->ether_dhost[2],
eh->ether_dhost[3],
eh->ether_dhost[4],
eh->ether_dhost[5]);
ret = -1;
goto done;
}
/* Get source IP */
((struct sockaddr_in *)&their_addr)->sin_addr.s_addr = iph->saddr;
inet_ntop(AF_INET, &((struct sockaddr_in*)&their_addr)->sin_addr, sender, sizeof sender);
/* Look up my device IP addr if possible */
strncpy(if_ip.ifr_name, ifName, IFNAMSIZ-1);
if (ioctl(sockfd, SIOCGIFADDR, &if_ip) >= 0) { /* if we can't check then don't */
printf("Source IP: %s\n My IP: %s\n", sender,
inet_ntoa(((struct sockaddr_in *)&if_ip.ifr_addr)->sin_addr));
/* ignore if I sent it */
if (strcmp(sender, inet_ntoa(((struct sockaddr_in *)&if_ip.ifr_addr)->sin_addr)) == 0) {
printf("but I sent it :(\n");
ret = -1;
goto done;
}
}
/* UDP payload length */
ret = ntohs(udph->len) - sizeof(struct udphdr);
/* Print packet */
printf("\tData:");
for (i=0; i<numbytes; i++) printf("%02x:", buf[i]);
printf("\n");
done: goto repeat;
close(sockfd);
return ret;
}
|
the_stack_data/781934.c | /* zombies.c: A demonstration of what happens if parents don't wait for their children. */
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <fcntl.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/wait.h>
#include <unistd.h>
int main(int argc, char *argv[]) {
int nchildren = atoi(argv[1]);
for (int i = 0; i < nchildren; i++) {
pid_t pid = fork();
if (pid == 0) { // Child
printf("Child pid: %d, Parent pid: %d\n", getpid(), getppid());
_exit(i);
} else if (pid < 0) {
fprintf(stderr, "Unable to fork: %s\n", strerror(errno));
}
}
for (int i = 0; i < nchildren; i++) {
system("ps ux | grep 'Z+' | grep -v grep");
sleep(1);
int status = EXIT_SUCCESS;
pid_t pid = wait(&status);
printf("Child pid: %d, Exit Status: %d\n", pid, WEXITSTATUS(status));
}
return EXIT_SUCCESS;
}
/* vim: set sts=4 sw=4 ts=8 expandtab ft=c: */
|
the_stack_data/489589.c | #include <stdio.h>
#include <malloc.h>
int nextPrime(int i, char *sieve, int max) {
while(i < max && !sieve[i]) {
i++;
}
return i;
}
void setNotPrime(int i, char *sieve, int max) {
int j;
for(j = i; j < max; j += i) {
sieve[j] = 0;
}
}
int main(int argc, char**argv) {
int n = atoi(argv[1]);
char *sieve = (char*) malloc(sizeof(char));
int i;
for(i = 0; i < n; i++) {
sieve[i] = 1;
}
for(i = 2; i < n; i = nextPrime(i, sieve, n)) {
printf("%d ", i);
setNotPrime(i, sieve, n);
}
return 0;
}
|
the_stack_data/100158.c | /* startup.c */
#include <stdint.h>
#include <sys/types.h>
// ----------------------------------------------------------------------------
// Begin address for the initialization values of the .data section.
// defined in linker script
extern unsigned int _sidata;
// Begin address for the .data section; defined in linker script
extern unsigned int _sdata;
// End address for the .data section; defined in linker script
extern unsigned int _edata;
// Begin address for the .bss section; defined in linker script
extern unsigned int __bss_start__;
// End address for the .bss section; defined in linker script
extern unsigned int __bss_end__;
extern int main (void);
// The implementation for the exit routine; for embedded
// applications, a system reset might be performed.
extern void __attribute__((noreturn)) _exit (int);
// ----------------------------------------------------------------------------
static inline void __attribute__((always_inline)) __initialize_data(unsigned int *from, unsigned int *region_begin, unsigned int *region_end)
{
// Iterate and copy word by word.
// It is assumed that the pointers are word aligned.
unsigned int *p = region_begin;
while (p < region_end) {
*p++ = *from++;
}
}
static inline void __attribute__((always_inline)) __initialize_bss(unsigned int* region_begin, unsigned int* region_end) {
// Iterate and clear word by word.
// It is assumed that the pointers are word aligned.
unsigned int *p = region_begin;
while (p < region_end) {
*p++ = 0;
}
}
// These magic symbols are provided by the linker.
extern void (*__preinit_array_start[]) (void) __attribute__((weak));
extern void (*__preinit_array_end[]) (void) __attribute__((weak));
extern void (*__init_array_start[]) (void) __attribute__((weak));
extern void (*__init_array_end[]) (void) __attribute__((weak));
extern void (*__fini_array_start[]) (void) __attribute__((weak));
extern void (*__fini_array_end[]) (void) __attribute__((weak));
// Iterate over all the preinit/init routines (mainly static constructors).
inline void __attribute__((always_inline)) __run_init_array (void) {
int count;
int i;
count = __preinit_array_end - __preinit_array_start;
for (i = 0; i < count; i++)
__preinit_array_start[i] ();
// If you need to run the code in the .init section, please use
// the startup files, since this requires the code in crti.o and crtn.o
// to add the function prologue/epilogue.
//_init(); // DO NOT ENABE THIS!
count = __init_array_end - __init_array_start;
for (i = 0; i < count; i++)
__init_array_start[i] ();
}
// Run all the cleanup routines (mainly static destructors).
inline void __attribute__((always_inline)) __run_fini_array (void) {
int count;
int i;
count = __fini_array_end - __fini_array_start;
for (i = count; i > 0; i--)
__fini_array_start[i - 1] ();
// If you need to run the code in the .fini section, please use
// the startup files, since this requires the code in crti.o and crtn.o
// to add the function prologue/epilogue.
//_fini(); // DO NOT ENABE THIS!
}
static void __initialize_hardware_early(void) {
void SystemInit(void);
SystemInit();
}
static void __initialize_hardware(void){
//void PL_Init(void);
//PL_Init();
}
void __attribute__ ((section(".after_vectors"),noreturn,weak)) _startup (void) {
__initialize_hardware_early();
__initialize_data(&_sidata, &_sdata, &_edata);
__initialize_bss(&__bss_start__, &__bss_end__);
__initialize_hardware ();
// Call the standard library initialisation (mandatory for C++ to
// execute the constructors for the static objects).
__run_init_array ();
// Call the main entry point, and save the exit code.
//int code = main (argc, argv);
int code = main();
// Run the C++ static destructors.
__run_fini_array ();
_exit (code);
// Should never reach this
for (;;) {
__asm("nop");
}
}
|
the_stack_data/100140596.c | // This is a program to print a pyramid like pattern in C
#include<stdio.h>
int main()
{
int i,j,k;
for(i=1;i<=5;i++)
{
for(j=5;j>i;j--)
{
printf(" ");
}
for(k=1;k<=i;k++)
{
printf("*");
}
printf("\n");
}
}
|
the_stack_data/561332.c | #include<stdio.h>
#include<math.h>
#include<stdlib.h>
#define RD 57.2957795
#define RG 63.6619772
#define f(x) x*x-4*x-10
#define g(x) 2*x-4
#define PI 3.141593
// Function declaration for min/max of two numbers
int maxxx(int num11, int num22);
int minnn(int num11, int num22);
float calculateSD(float data[]);
float poly(float axa[], int, float);
float deriv(float axa[], int, float);
//Global Variables Section
typedef long double val;
double e = 0.0001;
//Structure Definition
struct complex
{
int real, img;
};
int main()
{
// Variable Declaration
int ch;
char ch1 = 'y';
int n1,n2;
int result;
double rresultt;
int n3,n4;
float remainder;
int m,n;
double x,expo;
float i,w,si,co,ta,csc,sc,ct;
float r,z,sih,coh,tah,csch,sch,cth;
double j,jdeg,asi,aco,ata,acsc,asc,act;
float log_value,log10_value,q;
float logh_g,h,g;
float y,fact=1,number;
float val;
float fVal,cVal;
float degree, radian;
int xn,expr=0;
int order,ii;
int coefficient[order];
int rows, cols, rr, cc, aa[100][100];
int mm, nn, ccc, ddd, matrixx[10][10], transposee[10][10];
double ab, ba, ca, D, root1, root2, realPart, imagPart, root3, root4;
int num11, num22, maximumm, minimumm;
double KM;
int arr[3][3],i2,j2,n5,row,coef=1,space;
long det;
int num1,num2,gcd,lcm,rem,numerator,denominator,num,i3,sum2=0,a3,d,tn,sum3=0;
float a4,r1,last_term,sum4=0,i4,sum5=0,term;
unsigned long sum6=0;
float xy[100],average,variance,sum7=0,sum8=0,x2,y2,r3,theta;
float a100,b100,c100,d100,e100,f100,g100,h100,i100;
struct complex a, b99, c;
int x5,y5,z5;
float mod;
double grad,radd,degg,grad1,radd1,degg1;
int i1;
float data[10];
float x1, axa[10], y1, dy1;
int deg, i111;
float lower, upper, integration=0.0, stepSize, k;
int i11, subInterval;
int base, exp;
long long resultt = 1;
int e2,r22,n55,npr,ncr,fact1,fact2,fact3;
long long rresult;
double resulttt;
int aya[3][3],iya,jiy;
float determinantt=0;
//Program Starts
printf("\n\t\t\t\t\t\tAdvanced Scientific Calculator\n");
//Do-While switch case begins
do
{
printf("\n\n\tChoose between type of calculator:");
printf("\n\n\t 1: Arithmetic Calculator");
printf("\n\t 2: Trigonometric Calculator");
printf("\n\t 3: Logarithmic Calculator");
printf("\n\t 4: Conversions");
printf("\n\t 5: Algebraic Calculator");
printf("\n\t 6: Matrix Calculator");
printf("\n\t 7: Vector Calculator");
printf("\n\t 8: Complex Calculator");
printf("\n\t 9: Statistics Calculator");
printf("\n\t 10: Calculus Calculator");
printf("\n\t 11: Series Calculator");
printf("\n\t 12: Miscellaneous Calculator");
printf("\n\n\tEnter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1:
do
{
printf("\n\n\tChoose the arithmetic operation:");
printf("\n\n\t 1: Addition");
printf("\n\t 2: Subtraction");
printf("\n\t 3: Multiplication");
printf("\n\t 4: Division");
printf("\n\t 5: a^b");
printf("\n\t 6: a^2");
printf("\n\t 7: Square root of a");
printf("\n\t 8: Cube of a");
printf("\n\t 9: Cube root of a");
printf("\n\t 10: bth root of a");
printf("\n\t 11: 2 raised to a");
printf("\n\t 12: Reciprocal of b");
printf("\n\t 13: Negation of a");
printf("\n\t 14: Remainder");
printf("\n\t 15: Absolute Value");
printf("\n\t 16: Euler's number raised to entered value");
printf("\n\t 17: Two raised to entered value");
printf("\n\t 18: Ten raised to entered value");
printf("\n\t 19: GCD and LCM of two numbers");
printf("\n\t 20: Factorial");
printf("\n\t 21: Largest and smallest number");
printf("\n\n\tEnter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("\n\n\tEnter a number: ");
scanf("%d",&n1);
printf("\n\tEnter another number: ");
scanf("%d",&n2);
result=n1+n2;
printf("\n\n\tThe sum is: %d",result);
break;
case 2: printf("\n\n\tEnter a number: ");
scanf("%d",&n1);
printf("\n\tEnter another number: ");
scanf("%d",&n2);
result=n1-n2;
printf("\n\n\tThe subtraction of %d",result);
break;
case 3: printf("\n\n\tEnter a number: ");
scanf("%d",&n1);
printf("\n\tEnter another number: ");
scanf("%d",&n2);
result=n1*n2;
printf("\n\n\tThe product of %d*%d=%d",n1,n2,result);
break;
case 4: printf("\n\n\tEnter a number: ");
scanf("%d",&n1);
printf("\n\tEnter another number: ");
scanf("%d",&n2);
result=n1/n2;
printf("\n\n\tThe quotient of %d/%d=%d",n1,n2,result);
break;
case 5: printf("\n\n\tEnter a number: ");
scanf("%d",&n1);
printf("\n\tEnter another number: ");
scanf("%d",&n2);
result=pow(n1,n2);
printf("\n\n\tThe power of %d raised to %d is :%d",n1,n2,result);
break;
case 6: printf("\n\n\tEnter a number: ");
scanf("%d",&n1);
result=pow(n1,2);
printf("\n\n\tThe square of %d=%d",n1,result);
break;
case 7: printf("\n\n\tEnter a number: ");
scanf("%d",&n1);
resulttt=sqrt(n1);
printf("\n\n\tThe square Root is %lf",resulttt);
break;
case 8: printf("\n\n\tEnter a number: ");
scanf("%d",&n1);
result=pow(n1,3);
printf("\n\n\tThe cube of %d=%d",n1,result);
break;
case 9: printf("\n\n\tEnter a number: ");
scanf("%d",&n1);
resulttt=cbrt(n1);
printf("\n\n\tThe cube root of %d=%d",n1,resulttt);
break;
case 10:printf("\n\n\tEnter a number: ");
scanf("%d",&n1);
printf("\n\tEnter another number: ");
scanf("%d",&n2);
resulttt=pow(n1,(1/n2));
printf("\n\n\tThe %d th root of %d = %lf",n2,n1,resulttt);
break;
case 11:printf("\n\n\tEnter a number: ");
scanf("%d",&n1);
result=pow(2,n1);
printf("\n\n\tThe %d th power of 2 = %d",n1,result);
break;
case 12:printf("\n\n\tEnter a number: ");
scanf("%d",&n1);
resulttt=pow(n1,-1);
printf("\n\n\tThe reciprocal of %d=%lf",n1,resulttt);
break;
case 13:printf("\n\n\tEnter a number: ");
scanf("%d",&n1);
result=-n1;
printf("\n\n\tThe negated value of %d=%d",n1,result);
break;
case 14:printf("\n\n\tEnter the dividend to find remainder of: ");
scanf("%d",&n3);
printf("\n\tEnter the divisor: ");
scanf("%d",&n4);
remainder=(n3%n4);
printf("\n\tThe remainder of %d when divided by %d is :%f",n3,n4,remainder);
break;
case 15:printf("\n\n\tEnter any two integers whose absolute value you desire to find :");
scanf("%d%d",&m,&n);
m = abs(m); // m is assigned to 200
n = abs(n); // n is assigned to -400
printf("\n\tAbsolute value of m = %d", m);
printf("\n\tAbsolute value of n = %d",n);
break;
case 16:printf("\n\n\tEnter the number to be the exponent of euler's number: ");
scanf("%lf",&x);
expo=pow(2.71828,x);
printf("\n\tThe value of e^%lf=%lf",x,expo);
break;
case 17:printf("\n\n\tEnter the number to be the exponent of 2: ");
scanf("%lf",&x);
expo=pow(2,x);
printf("\n\tThe value of 2^%lf=%lf",x,expo);
break;
case 18:printf("\n\n\tEnter the number to be the exponent of 10: ");
scanf("%lf",&x);
expo=pow(10,x);
printf("\n\tThe value of 10^%lf=%lf",x,expo);
break;
case 19:printf("\n\n\tEnter two numbers: ");
scanf("%d%d",&num1,&num2);
if(num1>num2)
{
numerator=num1;
denominator=num2;
}
else
{
numerator=num2;
denominator=num1;
}
rem=numerator%denominator;
while(rem!=0)
{
numerator=denominator;
denominator=rem;
rem=numerator%denominator;
}
gcd=denominator;
lcm=num1*num2/gcd;
printf("\n\n\tGCD of %d and %d = %d\n",num1,num2,gcd);
printf("\n\tLCM of %d and %d = %d\n",num1,num2,lcm);
break;
case 20:printf("\n\n\tEnter a number to find its factorial :");
scanf("%f",&number);
for(y=1;y<=number;y++)
{
fact=fact*y;
}
printf("\n\tFactorial of %f is: %f",number,fact);
break;
case 21:printf("\n\n\tEnter any two numbers: ");
scanf("%d%d", &num11, &num22);
maximumm = maxxx(num11, num22); // Call maximum function
minimumm = minnn(num11, num22); // Call minimum function
printf("\n\n\tMaximum = %d\n", maximumm);
printf("\n\tMinimum = %d", minimumm);
break;
default:printf("\n\n\tWrong Choice");
}
printf("\n\n\tDo you want to go again inside arithmetic calculator? (y/n)");
scanf(" %c",&ch1);
}
while(ch1=='y');
break;
case 2:
do
{
printf("\n\n\tChoose the type of trigonometric calculator:");
printf("\n\n\t 1: Trigonometric Ratios");
printf("\n\t 2: Hyperbolic Trigonometric Ratios ");
printf("\n\t 3: Inverse Trigonometric Ratios");
printf("\n\n\tEnter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("\n\n\tEnter the angle in degrees to find trigonometric ratios :");
scanf("%f",&i);
w=i*(3.142857143/180);
si=sin(w);
printf("\n\tThe value of sine(%f)=%f",w,si);
co=cos(w);
printf("\n\tThe value of cosine(%f)=%f",w,co);
ta=tan(w);
printf("\n\tThe value of tangent(%f)=%f",w,ta);
csc=(1/sin(w));
printf("\n\tThe value of cosec(%f)=%f",w,csc);
sc=(1/cos(w));
printf("\n\tThe value of sec(%f)=%f",w,sc);
ct=(1/tan(w));
printf("\n\tThe value of cot(%f)=%f",w,ct);
break;
case 2: printf("\n\n\tPlease enter angle in degrees to find hyperbolic trigonometric ratios :");
scanf("%f",&z);
r=z*(3.142857143/180);
sih=sinh(r);
printf("\n\tThe value of hyperbolic sine(%f)=%f",r,sih);
coh=cosh(r);
printf("\n\tThe value of hyperbolic cosine(%f)=%f",r,coh);
tah=tanh(r);
printf("\n\tThe value of hyperbolic tangent(%f)=%f",r,tah);
csch=(1/sinh(r));
printf("\n\tThe value of hyperbolic cosec(%f)=%f",r,csch);
sch=(1/cosh(r));
printf("\n\tThe value of hyperbolic sec(%f)=%f",r,sch);
cth=(1/tanh(r));
printf("\n\tThe value of hyperbolic tan(%f)=%f",r,cth);
break;
case 3: printf("\n\n\tPlease enter the value in degree to get arc trigonometric ratios :");
scanf("%lf",&j);
j = jdeg*(PI/180.0);
asi=asin(j);
printf("\n\tThe value of arc sin(%lf)=%lf",j,asi);
aco=acos(j);
printf("\n\tThe value of arc cos(%lf)=%lf",j,aco);
ata=atan(j);
printf("\n\tThe value of arc tan(%lf)=%lf",j,ata);
acsc=(1/asin(j));
printf("\n\tThe value of arc cosec(%lf)=%lf",j,acsc);
asc=(1/acos(j));
printf("\n\tThe value of arc sec(%lf)=%lf",j,asc);
act=(1/atan(j));
printf("\n\tThe value of arc cot(%lf)=%lf",j,act);
break;
default:printf("\n\n\tWrong Choice");
}
printf("\n\n\tDo you want to go again inside trigonometric calculator? (y/n)");
scanf(" %c",&ch1);
}
while(ch1=='y');
break;
case 3:
do
{
printf("\n\n\tChoose the logarithmic function:");
printf("\n\n\t 1: Log to the base 'e'");
printf("\n\n\t 2: Log to the base 10");
printf("\n\n\t 1: Log to the base 'Entered Number'");
printf("\n\n\tEnter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("\n\n\tEnter the argument for finding log of base e:");
scanf("%f",&q);
log_value = log(q);
printf("\n\tThe log to the base e of %f=%f",q,log_value);
break;
case 2: printf("\n\n\tEnter the argument for finding log of base 10 :");
scanf("%f",&q);
log10_value = log10(q);
printf("\n\tThe log to the base 10 of %f=%f",q,log10_value);
break;
case 3: printf("\n\n\tPlease enter the argument and base to find log :");
scanf("%f%f",&h,&g);
logh_g=((log10(h))/(log10(g)));
printf("\n\tThe log of %f with base %f = %f",h,g,logh_g);
break;
default:printf("\n\n\tWrong Choice");
break;
}
printf("\n\n\tDo you want to go again inside Logarithmic calculator? (y/n)");
scanf(" %c",&ch1);
}
while(ch1=='y');
break;
case 4:
do
{
printf("\n\n\tChoose the Conversions:");
printf("\n\n\t 1: Degrees to Radians");
printf("\n\t 2: Radians to Degrees");
printf("\n\t 3: Gradians to Degrees");
printf("\n\t 4: Degrees to Gradians");
printf("\n\t 5: Gradians to Radians");
printf("\n\t 6: Radians to Gradians");
printf("\n\t 7: Length Conversions");
printf("\n\t 8: Area Conversions");
printf("\n\t 9: Volume Conversions");
printf("\n\t 10: Speed Conversions");
printf("\n\t 11: Weight Conversions");
printf("\n\t 12: Temperature Conversions");
printf("\n\t 13: Cartesian coordinates to polar coordinates");
printf("\n\t 14: Polar coordinates to Cartesian coordinates");
printf("\n\n\tEnter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("\n\n\tEnter angle in Degrees: ");
scanf("%f", °ree);
radian=degree*(PI/180.0);
printf("\n\tAngle in Radian is %f",radian);
break;
case 2: printf("\n\n\tEnter angle in radians: ");
scanf("%f",&radian);
degree=radian*(180.0/PI);
printf("\n\tAngle in Degree is %f",degree);
break;
case 3: printf("\n\n\tEnter the angle in Gradians: ");
scanf("%lf",&grad);
degree=grad*0.9;
printf("\n\tAngle in Degrees: %.4lf\n",degg);
break;
case 4: printf("\n\n\tEnter the angle in Degrees: ");
scanf("%lf",°g1);
grad1=(1.11111)*degg1;
printf("\n\tAngle in Gradians : %.4lf\n",grad1);
break;
case 5: printf("\n\n\tEnter the angle in Gradians: ");
scanf("%lf",&grad);
radian=63.662*grad;
printf("\n\tAngle in Radians : %.4lf\n",radd);
break;
case 6: printf("\n\n\tEnter the angle in Radians : ");
scanf("%lf",&radd1);
grad1=0.01571*radd1;
printf("\n\tAngle in Gradians : %.4lf\n",grad1);
break;
case 7:
do
{
printf("\n\n\tChoose the length conversion:");
printf("\n\n\t 1: M to KM");
printf("\n\t 2: KM to M");
printf("\n\t 3: M to CM");
printf("\n\t 4: CM to M");
printf("\n\t 5: M to DM");
printf("\n\t 6: DM to M");
printf("\n\t 7: FOOT to INCH");
printf("\n\t 8: INCH to FOOT");
printf("\n\t 9: M to FOOT");
printf("\n\t 10: FOOT to M");
printf("\n\t 11: KM to Mile");
printf("\n\t 12: Mile to KM");
printf("\n\t 13: Nautical mile to metre");
printf("\n\t 14: Metre to nautical mile");
printf("\n\n\tEnter your choice: ");
scanf("%d",&ch);
printf("\n\n\tEnter the Quantity: ");
scanf("%lf",&KM);
switch(ch)
{
case 1: rresultt=KM/1000;
printf("\n\n\t%lf M = %lf KM\n",KM,rresultt);
break;
case 2: rresultt=KM*1000;
printf("\n\n\t%lf KM = %lf M\n",KM,rresultt);
break;
case 3: rresultt=KM*100;
printf("\n\n\t%lf M = %lf CM\n",KM,rresultt);
break;
case 4: rresultt=KM/100;
printf("\n\n\t%lf CM = %lf M\n",KM,rresultt);
break;
case 5: rresultt=KM*10;
printf("\n\n\t%lf M = %lf DM\n",KM,rresultt);
break;
case 6: rresultt=KM/10;
printf("\n\n\t%lf DM = %lf M\n",KM,rresultt);
break;
case 7: rresultt=KM*12;
printf("\n\n\t%lf FOOT = %lf INCH\n",KM,rresultt);
break;
case 8: rresultt=KM/12;
printf("\n\n\t%lf INCH = %lf FOOT\n",KM,rresultt);
break;
case 9: rresultt=KM*3.28;
printf("\n\n\t%lf M = %lf FOOT\n",KM,rresultt);
break;
case 10:rresultt=KM/3.28;
printf("\n\n\t%lf FOOT = %lf M\n",KM,rresultt);
break;
case 11:rresultt = (KM*0.621371);
printf("\n\n\t The value in miles is %.3lf",rresultt);
break;
case 12:rresultt = (KM*1.60934);
printf("\n\n\t The value in kilometres is %.3lf",rresultt);
break;
case 13:rresultt = (KM*1852);
printf("\n\n\t The value in metres is %.3lf",rresultt);
break;
case 14:rresultt = (KM*0.000539957);
printf("\n\n\t The value in nautical miles is %.3lf",rresultt);
break;
default:printf("\n\n\tWrong Choice");
}
printf("\n\n\tDo you want to perform any other length conversions? (y/n)");
scanf(" %c",&ch1);
}
while(ch1=='y');
break;
case 8:
do
{
printf("\n\n\tChoose the area conversion:");
printf("\n\n\t 1: M^2 to KM^2");
printf("\n\t 2: KM^2 to M^2");
printf("\n\t 3: YARD to M^2");
printf("\n\t 4: M^2 to YARD");
printf("\n\t 5: ACRE to HECTARE");
printf("\n\t 6: HECTARE to ACRE");
printf("\n\t 7: ACRE to M^2");
printf("\n\t 8: M^2 to ACRE");
printf("\n\t 9: FOOT to ACRE^2");
printf("\n\t 10: ACRE^2 to FOOT");
printf("\n\n\tEnter your choice: ");
scanf("%d",&ch);
printf("\n\n\tEnter The Quantity: ");
scanf("%lf",&KM);
switch(ch)
{
case 1: rresultt=KM/1000000;
printf("\n\n\t%lf",rresultt);
break;
case 2: rresultt=KM*1000000;
printf("\n\n\t%lf",rresultt);
break;
case 3: rresultt=KM/1.1959;
printf("\n\n\t%lf",rresultt);
break;
case 4: rresultt=KM*1.1959;
printf("\n\n\t%lf",rresultt);
break;
case 5: rresultt=KM/2.471;
printf("\n\n\t%lf",rresultt);
break;
case 6: rresultt=KM*2.471;
printf("\n\n\t%lf",rresultt);
break;
case 7: rresultt=KM*4046.945;
printf("\n\n\t%lf",rresultt);
break;
case 8: rresultt=KM/4046.945;
printf("\n\n\t%lf",rresultt);
break;
case 9: rresultt= KM/43560.95;
printf("\n\n\t%lf",rresultt);
break;
case 10:rresultt=KM*43560.95;
printf("\n\n\t%lf",rresultt);
break;
default:printf("\n\n\tWrong Choice");
break;
}
printf("\n\n\tDo you want to perform any other area conversions? (y/n)");
scanf(" %c",&ch1);
}
while(ch1=='y');
break;
case 9:
do
{
printf("\n\n\tChoose the volume conversion:");
printf("\n\n\t 1: LITRE to ML");
printf("\n\t 2: ML to LITRE");
printf("\n\t 3: LITRE to CENTI LITRE");
printf("\n\t 4: CENTI LITRE to LITRE");
printf("\n\t 5: LITRE to DECILITRE");
printf("\n\t 6: DECILITRE to LITRE");
printf("\n\t 7: LITRE to US GALLON");
printf("\n\t 8: US GALLON to LITRE ");
printf("\n\t 9: LITRE to HECTOLITRE");
printf("\n\t 10: HECTOLITRE to LITRE");
printf("\n\n\tEnter your choice: ");
scanf("%d",&ch);
printf("\n\n\tEnter the Quantity: ");
scanf("%lf",&KM);
switch(ch)
{
case 1: rresultt=KM*1000;
printf("\n\n\t%lf",rresultt);
break;
case 2: rresultt=KM/1000;
printf("\n\n\t%lf",rresultt);
break;
case 3: rresultt=KM*100;
printf("\n\n\t%lf",rresultt);
break;
case 4: rresultt=KM/100;
printf("\n\n\t%lf",rresultt);
break;
case 5: rresultt=KM*10;
printf("\n\n\t%lf",rresultt);
break;
case 6: rresultt=KM/10;
printf("\n\n\t%lf",rresultt);
break;
case 7: rresultt=KM*0.2641720;
printf("\n\n\t%lf",rresultt);
break;
case 8: rresultt=KM/0.2641720;
printf("\n\n\t%lf",rresultt);
break;
case 9: rresultt=KM/100;
printf("\n\n\t%lf",rresultt);
break;
case 10:rresultt=KM*100;
printf("\n\n\t%lf",rresultt);
break;
default:printf("\n\n\tWrong Choice");
break;
}
printf("\n\n\tDo you want to perform any other volume conversions? (y/n)");
scanf(" %c",&ch1);
}
while(ch1=='y');
break;
case 10:
do
{
printf("\n\n\tChoose the speed conversion:");
printf("\n\n\t 1: KM/s to KM/h");
printf("\n\t 2: KM/h TO KM/s");
printf("\n\t 3: KM/h TO MILE/h");
printf("\n\t 4: MILE/h TO KM/h");
printf("\n\t 5: KM/s TO M/s");
printf("\n\t 6: M/s TO KM/s");
printf("\n\t 7: Convert speed of light KM/s");
printf("\n\t 8: Convert speed of light KM/h");
printf("\n\t 9: M/s TO INCH/s");
printf("\n\t 10: INCH/s TO M/s");
printf("\n\n\tEnter your choice: ");
scanf("%d",&ch);
printf("\n\n\tEnter the Quantity: ");
scanf("%lf",&KM);
switch(ch)
{
case 1: rresultt=KM*3600;
printf("\n\n\t%lf",rresultt);
break;
case 2: rresultt=KM/3600;
printf("\n\n\t%lf",rresultt);
break;
case 3: rresultt=KM/1.6093;
printf("\n\n\t%lf",rresultt);
break;
case 4: rresultt=KM*1.6093;
printf("\n\n\t%lf",rresultt);
break;
case 5: rresultt=KM*1000;
printf("\n\n\t%lf",rresultt);
break;
case 6: rresultt=KM/1000;
printf("\n\n\t%lf",rresultt);
break;
case 7: rresultt=KM*299796.1386;
printf("\n\n\t%lf",rresultt);
break;
case 8: rresultt=KM*1079266099.05;
printf("\n\n\t%lf",rresultt);
break;
case 9: rresultt=KM*39.38;
printf("\n\n\t%lf",rresultt);
break;
case 10:rresultt=KM/39.38;
printf("\n\n\t%lf",rresultt);
break;
default:printf("\n\n\tWrong Choice");
break;
}
printf("\n\n\tDo you want to perform any other speed conversions? (y/n)");
scanf(" %c",&ch1);
}
while(ch1=='y');
break;
case 11:
do
{
printf("\n\n\tChoose the weight conversion:");
printf("\n\n\t 1: KG TO GRAM");
printf("\n\t 2: GRAM to KG");
printf("\n\t 3: KG to MG");
printf("\n\t 4: MG to KG");
printf("\n\t 5: KG to POUND");
printf("\n\t 6: POUND to KG");
printf("\n\t 7: KG to CARAT ");
printf("\n\t 8: CARAT to KG");
printf("\n\t 9: KG to LONG TON");
printf("\n\t 10: LOG TON to KG");
printf("\n\t 11: KG to QUINTAL");
printf("\n\t 12: QUINTAL to KG");
printf("\n\n\tEnter your choice: ");
scanf("%d",&ch);
printf("\n\n\tEnter the Quantity: ");
scanf("%lf",&KM);
switch(ch)
{
case 1: rresultt=KM*1000;
printf("\n\n\t%lf",rresultt);
break;
case 2: rresultt=KM/1000;
printf("\n\n\t%lf",rresultt);
break;
case 3: rresultt=KM*1000000;
printf("\n\n\t%lf",rresultt);
break;
case 4: rresultt=KM/1000000;
printf("\n\n\t%lf",rresultt);
break;
case 5: rresultt=KM*2.2046;
printf("\n\n\t%lf",rresultt);
break;
case 6: rresultt=KM/2.2046;
printf("\n\n\t%lf",rresultt);
break;
case 7: rresultt=KM*5000;
printf("\n\n\t%lf",rresultt);
break;
case 8: rresultt=KM/5000;
printf("\n\n\t%lf",rresultt);
break;
case 9: rresultt=KM/1016.55;
printf("\n\n\t%lf",rresultt);
break;
case 10:rresultt=KM*1016.53;
printf("\n\n\t%lf",rresultt);
break;
case 11:rresultt=KM/100;
printf("\n\n\t%lf",rresultt);
break;
case 12:rresultt=KM*100;
printf("\n\n\t%lf",rresultt);
break;
default:printf("\n\n\tWrong Choice");
break;
}
printf("\n\n\tDo you want to perform any other weight conversions? (y/n)");
scanf(" %c",&ch1);
}
while(ch1=='y');
break;
case 12:
do
{
printf("\n\n\tChoose the temperature conversion:");
printf("\n\n\t 1: CENTI GRADE to FARENHITE");
printf("\n\t 2: FARENHITE to CENTIGRADE");
printf("\n\t 3: FARENHITE to KELVIN");
printf("\n\t 4: KELVIN to FARENHITE");
printf("\n\t 5: CENTI GRADE to KELVIN");
printf("\n\t 6: KELVIN to CENTI GRADE");
printf("\n\n\tEnter your choice: ");
scanf("%d",&ch);
printf("\n\n\tEnter the Quantity: ");
scanf("%lf",&KM);
switch(ch)
{
case 1: rresultt=(1.8*KM)+32;
printf("\n\n\t%lf",rresultt);
break;
case 2: rresultt=(KM-32)/1.8;
printf("\n\n\t%lf",rresultt);
break;
case 3: rresultt=(KM-32)*5/9+273.15;
printf("\n\n\t%lf",rresultt);
break;
case 4: rresultt=(KM-273.15)*9/5+32;
printf("\n\n\t%lf",rresultt);
break;
case 5: rresultt=KM+273.15;
printf("\n\n\t%lf",rresultt);
break;
case 6: rresultt=KM-273.15;
printf("\n\n\t%lf",rresultt);
break;
default:printf("\n\n\tWrong Choice");
break;
}
printf("\n\n\tDo you want to perform any other temperature conversions? (y/n)");
scanf(" %c",&ch1);
}
while(ch1=='y');
break;
case 13:
printf("\n\n\tEnter Cartesian coordinate x : ");
scanf("%f",&x2);
printf("\n\tEnter Cartesian coordinate y : ");
scanf("%f",&y2);
r3=sqrt(x2*x2+y2*y2);
theta=atan(y2/x2);
theta=180.0*theta/PI;
printf("\n\n\tPolar coordinates are : r = %0.2f and theta = %0.2f in degrees",r3,theta);
break;
case 14:printf("\n\n\tEnter radius of polar coordinate (r): ");
scanf("%f",&r3);
printf("\n\tEnter angle of polar coordinate in degrees (theta): ");
scanf("%f",&theta);
theta = theta * PI/180.0;
x2 = r3 * cos(theta);
y2 = r3 * sin(theta);
printf("\n\n\tCartesian coordinates are (x,y) : (%0.3f, %0.3f)", x2, y2);
break;
default:printf("\n\n\tWrong Choice");
break;
}
printf("\n\n\tDo you want to perform any other conversions? (y/n)");
scanf(" %c",&ch1);
}
while(ch1=='y');
break;
case 5:
do
{
printf("\n\n\tChoose the algebraic Operation: ");
printf("\n\n\t 1: Zeroes of polynomial");
printf("\n\t 2: Roots of Quadratic Equations");
printf("\n\n\tEnter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("\n\n\tValue of x\n");
scanf("%d",&xn);
printf("\n\ntEnter order of polynomial\n");
scanf("%d",&order);
for(ii=0;ii<=order;ii++)
{
printf("\n\n\tEnter coefficients of polynomial at x^%d\n",ii);
scanf("%d",&coefficient[ii]);
}
for(ii=0;ii<=order;ii++)
{
expr+=coefficient[ii]*pow(xn,ii);
}
for(ii=order;ii>=0;ii--)
{
if(ii>0)
printf("\n\n\t%dx^%d+",coefficient[ii],ii);
else
printf("\n\n\t%dx^%d=",coefficient[ii],ii);
}
printf("\n\n\t%d",expr);
break;
case 2: printf("\n\n\tEnter coefficients a, b and c: ");
scanf("%lf %lf %lf", &ab, &ba, &ca);
D =(ba * ba)-(4 * ab * ca);
// condition for real and different roots
if (D > 0)
{
root1 = (-ba + sqrt(D))/(2 * ab);
root2 = (-ba - sqrt(D))/(2 * ab);
printf("\n\n\troot1 = %.2lf and root2 = %.2lf", root1, root2);
}
// condition for real and equal roots
else if (D == 0)
{
root1 = root2 = -ba / (2 * ab);
printf("\n\n\troot1 = root2 = %.2lf;", root1);
}
// if roots are not real
else
{
realPart = (-ba) / (2 * ab);
imagPart = (sqrt(-D)) / (2 * ab);
root3=realPart+imagPart;
root4=realPart-imagPart;
printf("\n\n\troot1 = %lf and root2 = %lf", root3, root4);
}
break;
default:printf("\n\n\tWrong Choice");
break;
}
printf("\n\n\tDo you want to perform any other algebraic operations? (y/n)");
scanf(" %c",&ch1);
}
while(ch1=='y');
break;
case 6:
do
{
printf("\n\n\tChoose the matrix operation to perform:");
printf("\n\n\t 1: Matrix Inverse");
printf("\n\n\t 2: Special Matrices");
printf("\n\n\t 3: Finding determinant of 3x3 matrix and checking if it is basis of R3 vector space");
printf("\n\n\tEnter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("\n\n\tEnter the 9 elements of matrix: ");
for(iya=0;iya<3;iya++)
for(jiy=0;jiy<3;jiy++)
scanf("%d",&aya[iya][jiy]);
printf("\n\n\tThe matrix is\n");
for(iya=0;iya<3;iya++)
{
printf("\n\t");
for(jiy=0;jiy<3;jiy++)
printf("%d\t",aya[iya][jiy]);
}
for(iya=0;iya<3;iya++)
determinantt = determinantt + (aya[0][iya]*(aya[1][(iya+1)%3]*aya[2][(iya+2)%3] - aya[1][(iya+2)%3]*aya[2][(iya+1)%3]));
printf("\n\n\tInverse of matrix is: \n\n");
for(iya=0;iya<3;iya++)
{
for(jiy=0;jiy<3;jiy++)
{printf("%.2f\t",((aya[(iya+1)%3][(jiy+1)%3] * aya[(iya+2)%3][(jiy+2)%3]) - (aya[(iya+1)%3][(jiy+2)%3]*aya[(iya+2)%3][(jiy+1)%3]))/ determinantt);}
printf("\n");
}
break;
case 2:
do
{
printf("\n\n\tChoose the special matrix operation:");
printf("\n\n\t 1: Triangular Matrix");
printf("\n\n\t 2: Symmetric Matrix");
printf("\n\n\tEnter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("\n\n\tPlease enter the number of rows for the matrix: ");
scanf("%d", &rows);
printf("\n");
printf("\n\tPlease enter the number of columns for the matrix: ");
scanf("%d", &cols);
printf("\n");
printf("\n\tPlease enter the elements for the Matrix: ");
for(rr = 0; rr < rows; rr++)
{
for(cc = 0;cc < cols;cc++)
{
scanf("%d", &aa[rr][cc]);
}
}
if(rows != cols)
{
printf("\n\tMatrix should be a square matrix\n");
}
else
{
printf("\n\n\tLower triangular matrix: \n\n");
for(int rr = 0; rr < rows; rr++)
{
for(int cc = 0; cc < cols; cc++)
{
if(cc > rr)
{printf("0\t");}
else
{printf("%d\t", aa[rr][cc]);}
}
printf("\n\t");
}
printf("\n\tUpper triangular matrix: \n\n");
for(int rr = 0; rr < rows; rr++)
{
for(int cc = 0; cc < cols; cc++)
{
if(rr > cc)
{printf("0\t");}
else
{printf("%d\t", aa[rr][cc]);}
}
printf("\n\t");
}
}
break;
case 2: printf("\n\n\tEnter the number of rows and columns of matrix: ");
scanf("%d%d", &mm, &nn);
printf("\n\tEnter elements of the matrix:\n\n");
for (ccc = 0; ccc < mm; ccc++)
for (ddd = 0; ddd < nn; ddd++)
scanf("%d", &matrixx[ccc][ddd]);
for (ccc = 0; ccc < mm; ccc++)
for (ddd = 0; ddd < nn; ddd++)
transposee[ddd][ccc] = matrixx[ccc][ddd];
if (mm == nn) /* check if order is same */
{
for (ccc = 0; ccc < mm; ccc++)
{
for (ddd = 0; ddd < mm; ddd++)
{
if (matrixx[ccc][ddd] != transposee[ccc][ddd])
break;
}
if (ddd != mm)
break;
}
if (ccc == mm)
printf("\n\tThe matrix is symmetric.");
else
printf("\n\tThe matrix is not symmetric.");
}
else
printf("\n\tThe matrix is not symmetric.");
break;
default:printf("\n\n\tWrong Choice");
break;
}
printf("\n\n\tDo you want to repeat operations? (y/n)");
scanf(" %c",&ch1);
}
while(ch1=='y');
break;
case 3: printf("\n\n\tEnter a 3 X 3 Matrix : ");
printf("\n\tEnter the elements of matrix : \n");
for(i2=0;i2<3;i2++)
{
for(j2=0;j2<3;j2++)
{
printf("\n\n\tEnter the values for [%d][%d] : ",i2,j2);
scanf("%d",&arr[i2][j2]);
}
}
printf("\n\n\tThe matrix is: ");
for(i2=0;i2<3;i2++)
{
printf("\n");
for(j2=0;j2<3;j2++)
{printf("%d\t",arr[i2][j2]);}
}
det=arr[0][0]*((arr[1][1]*arr[2][2])-(arr[2][1]*arr[1][2]))-arr[0][1]*((arr[1][0]*arr[2][2])-(arr[2][0]*arr[1][2]))+arr[0][2]*((arr[1][0]*arr[2][1])-(arr[2][0]*arr[1][1]));
printf("\n\n\tDeterminant of 3X3 matrix: %ld", det);
if(det!=0)
{
printf("\n\tThe vectors forms the basis of R%d as the determinant is non-zero\n",3);
}
else
{
printf("\n\tThe vectors doesn't form the basis of R%d as the determinant is zero\n",3);
}
break;
default:printf("\n\n\tWrong Choice");
break;
}
printf("\n\n\tDo you want to repeat operations? (y/n)");
scanf(" %c",&ch1);
}
while(ch1=='y');
break;
case 7: //type coordinates i j k as i,j,k only for correct output
do
{
printf("\n\n\tChoose the vector Operation:");
printf("\n\n\t 1: Magnitude of Vector");
printf("\n\t 2: Direction of vector w.r.t.X,Y,Z axes");
printf("\n\t 3: Angle between two vectors");
printf("\n\t 4: Vectorial addition");
printf("\n\t 5: Vectorial subtraction");
printf("\n\t 6: Product of scalar and vector");
printf("\n\t 7: Scalar product of Vectors");
printf("\n\t 8: Vector product of Vectors");
printf("\n\n\tEnter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("\n\n\tEnter {I,J,K components} of vector (A):");
scanf("%f,%f,%f",&a100,&b100,&c100);
d100=sqrt(a100*a100+b100*b100+c100*c100);
printf("\n\t Vector (A) is (%f)I+(%f)J+(%f)K \n",a100,b100,c100);
printf("\n\t Magnitude of Vector (A) is {%f} \n\n ",d100);
break;
case 2: printf("\n\n\tEnter {I,J,K components} of vector (A):");
scanf("%f,%f,%f",&a100,&b100,&c100);
if(a100==0&&b100==0&&c100==0)
{
printf("\n\t Vector (A) is (%f)I+(%f)j+(%f)K \n",a100,b100,c100);
printf("\n\t Direction of Vector (A) IS UNDEFINED:TRY AGAIN \n\n ");
}
else
{
anglemid_vector(a100,b100,c100,1,0,0,1,d100,0);
anglemid_vector(a100,b100,c100,0,1,0,1,e100,0);
anglemid_vector(a100,b100,c100,0,0,1,1,f100,0);
printf("\n\t Vector (A) is (%f)I+(%f)J+(%f)K \n",a100,b100,c100);
printf("\n\t Vector (A) makes with [X axis] an angle of {%f} \n",d100);
printf("\n\t Vector (A) makes with [Y axis] an angle of {%f} \n",e100);
printf("\n\t Vector (A) makes with [Z axis] an angle of {%f} \n\n ",f100);
}
break;
case 3: printf("\n\n\tEnter {I,J,K components} of vector (A):");
scanf("%f,%f,%f",&a100,&b100,&c100);
printf("\n\n\t Enter {I,J,K components} of vector (B):");
scanf("%f,%f,%f",&d100,&e100,&f100);
if((a100*a100+b100*b100+c100*c100)!=0&&(d100*d100+e100*e100+f100*f100)!=0)
{
anglemid_vector(a100,b100,c100,d100,e100,f100,1,g100,0);
printf("\n\t Vector (A) is (%f)I+(%f)J+(%f)K \n",a100,b100,c100);
printf("\n\t Vector (B) is (%f)I+(%f)J+(%f)K \n",d100,e100,f100);
printf("\n\t Angle between vectors (A) and (B) is {%f} \n\n ",g100);
}
else
{
printf("\n\t Vector (A) is (%f)I+(%f)J+(%f)K \n",a100,b100,c100);
printf("\n\t Vector (B) is (%f)I+(%f)J+(%f)K \n",d100,e100,f100);
printf("\n\t Angle between vectors (A) and (B) IS UNDEFINED:TRY AGAIN \n\n ");
}
break;
case 4: printf("\n\n\tEnter {I,J,K components} of vector (A):");
scanf("%f,%f,%f",&a100,&b100,&c100);
printf("\n\t Enter {I,J,K components} of vector (B):");
scanf("%f,%f,%f",&d100,&e100,&f100);
g100=a100+d100;
h100=b100+e100;
i100=c100+f100;
printf("\n\t Vector (A) is (%f)I+(%f)J+(%f)K \n",a100,b100,c100);
printf("\n\t Vector (B) is (%f)I+(%f)J+(%f)K \n",d100,e100,f100);
printf("\n\t Vector (A)+(B) is {%f}I+{%f}J+{%f}K \n\n ",g100,h100,i100);
break;
case 5: printf("\n\n\tEnter {I,J,K components} of vector (A):");
scanf("%f,%f,%f",&a100,&b100,&c100);
printf("\n\n\t Enter {I,J,K components} of vector (B):");
scanf("%f,%f,%f",&d100,&e100,&f100);
g100=a100-d100;
h100=b100-e100;
i100=c100-f100;
printf("\n\t Vector (A) is (%f)I+(%f)J+(%f)K \n",a100,b100,c100);
printf("\n\t Vector (B) is (%f)I+(%f)J+(%f)K \n",d100,e100,f100);
printf("\n\t Vector (A)-(B) is {%f}I+{%f}J+{%f}K \n\n ",g100,h100,i100);
break;
case 6: printf("\n\n\tEnter {a} value:");
scanf("%f",&a100);
printf("\n\n\tEnter {I,J,K components} of vector (A):");
scanf("%f,%f,%f",&b100,&c100,&d100);
e100=a100*b100;
f100=a100*c100;
g100=a100*d100;
printf("\n\t Vector (A) is (%f)I+(%f)J+(%f)K \n",b100,c100,d100);
printf("\n\t Vector [%f]*(A) is {%f}I+{%f}J+{%f}K \n\n ",a100,e100,f100,g100);
break;
case 7: printf("\n\n\tEnter {I,J,K components} of vector (A):");
scanf("%f,%f,%f",&a100,&b100,&c100);
printf("\n\n\tEnter {I,J,K components} of vector (B):");
scanf("%f,%f,%f",&d100,&e100,&f100);
g100=a100*d100+b100*e100+c100*f100;
printf("\n\t Vector (A) is (%f)I+(%f)J+(%f)K \n",a100,b100,c100);
printf("\n\t Vector (B) is (%f)I+(%f)J+(%f)K \n",d100,e100,f100);
printf("\n\t Scalar product OR Dot product of Vectors \n");
printf("\n\t (A) and (B) represented by (A).(B) is {%f} \n\n ",g100);
break;
case 8: printf("\n\n\tEnter {I,J,K components} of vector (A):");
scanf("%f,%f,%f",&a100,&b100,&c100);
printf("\n\n\tEnter {I,J,K components} of vector (B):");
scanf("%f,%f,%f",&d100,&e100,&f100);
g100=b100*f100-c100*e100;
h100=c100*d100-a100*f100;
i100=a100*e100-b100*d100;
printf("\n\t Vector (A) is (%lf)I+(%lf)J+(%lf)K \n",a100,b100,c100);
printf("\n\t Vector (B) is (%lf)I+(%lf)J+(%lf)K \n",d100,e100,f100);
printf("\n\t Vector product OR Cross product of Vectors (A) and (B) \n");
printf("\n\t represented by (A)x(B) is {%lf}I+{%lf}J+{%lf}K \n\n ",g100,h100,i100);
break;
default:printf("\n\n\tWrong Choice");
break;
}
printf("\n\n\tDo you want to repeat operations? (y/n)");
scanf(" %c",&ch1);
}
while(ch1=='y');
break;
case 8:
do
{
printf("\n\n\tChoose the complex number operation");
printf("\n\n\t 1: Addition");
printf("\n\t 2: Subtraction");
printf("\n\t 3: Multiplication");
printf("\n\t 4: Division");
printf("\n\t 5: Modulus");
printf("\n\t 6: Conjugate");
printf("\n\n\tEnter your choice: ");
scanf("%d",&ch);
printf("\n\tEnter a and b where a + ib is the first complex number.");
printf("\n\ta = ");
scanf("%d", &a.real);
printf("\n\tb = ");
scanf("%d", &a.img);
printf("\n\n\tEnter c and d where c + id is the second complex number.");
printf("\n\tc = ");
scanf("%d", &b99.real);
printf("\n\td = ");
scanf("%d", &b99.img);
switch(ch)
{
case 1: c.real = a.real + b99.real;
c.img = a.img + b99.img;
if (c.img >= 0)
{printf("\n\n\tSum of the complex numbers = %d + %di", c.real, c.img);}
else
{printf("\n\n\tSum of the complex numbers = %d %di", c.real, c.img);}
break;
case 2: c.real = a.real - b99.real;
c.img = a.img - b99.img;
if (c.img >= 0)
{printf("\n\n\tDifference of the complex numbers = %d + %di", c.real, c.img);}
else
{printf("\n\n\tDifference of the complex numbers = %d %di", c.real, c.img);}
break;
case 3: c.real = a.real*b99.real - a.img*b99.img;
c.img = a.img*b99.real + a.real*b99.img;
if (c.img >= 0)
{printf("\n\n\tMultiplication of the complex numbers = %d + %di", c.real, c.img);}
else
{printf("\n\n\tMultiplication of the complex numbers = %d %di", c.real, c.img);}
break;
case 4: if (b99.real == 0 && b99.img == 0)
printf("\n\n\tDivision by 0 + 0i isn't allowed.");
else
{
x5 = a.real*b99.real + a.img*b99.img;
y5= a.img*b99.real - a.real*b99.img;
z5 = b99.real*b99.real + b99.img*b99.img;
if (x5%z5 == 0 && y5%z5 == 0)
{
if (y5/z5 >= 0)
{printf("\n\n\tDivision of the complex numbers = %d + %di", x5/z5, y5/z5);}
else
{printf("\n\n\tDivision of the complex numbers = %d %di", x5/z5, y5/z5);}
}
else if (x5%z5 == 0 && y5%z5 != 0)
{
if (y5/z5 >= 0)
{printf("\n\n\tDivision of two complex numbers = %d + %d/%di", x5/z5, y5, z5);}
else
{printf("\n\n\tDivision of two complex numbers = %d %d/%di", x5/z5, y5, z5);}
}
else if (x5%z5 != 0 && y5%z5 == 0)
{
if (y5/z5 >= 0)
{printf("\n\n\tDivision of two complex numbers = %d/%d + %di", x5, z5, y5/z5);}
else
{printf("\n\n\tDivision of two complex numbers = %d %d/%di", x5, z5, y5/z5);}
}
else
{
if (y5/z5 >= 0)
{printf("\n\n\tDivision of two complex numbers = %d/%d + %d/%di",x5, z5, y5, z5);}
else
{printf("\n\n\tDivision of two complex numbers = %d/%d %d/%di", x5, z5, y5, z5);}
}
}
break;
case 5: printf("\n\n\t Enter the value of a and b of the complex number a + ib ");
scanf("%d%d",&a.real,&a.img);
mod = sqrt((a.real*a.real)+(a.img*a.img) );
printf("\n\n\t The value of Modulus of Complex number that you entered is =>%f",mod);
break;
case 6: printf("\n\t Enter the value of a and b of the complex number a + ib ");
scanf("%d%d",&a.real,&a.img);
printf("\n\t The Conjugate of complex no. %d+%d is %d -i%d ",a.real,a.img,a.real,a.img);
break;
default:printf("\n\n\tWrong Choice");
break;
}
printf("\n\n\tDo you want to repeat operations? (y/n)");
scanf(" %c",&ch1);
}
while(ch1=='y');
break;
case 9:
do
{
printf("\n\n\tChoose the statistical operation");
printf("\n\n\t 1: Mean and Variance");
printf("\n\t 2: Standard Deviation");
printf("\n\n\tEnter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("\n\n\tEnter the value of N: ");
scanf("%d",&n5);
printf("\n\tEnter %d real numbers: ",n5);
for (i2=0;i2<n5;i2++)
{
scanf("%f",&xy[i2]);
}
for (i2=0;i2<n5;i2++)
{
sum7=sum7+xy[i2];
}
average=sum7/(float)n5;
for (i2=0;i2<n5;i2++)
{
sum8=sum8+pow((xy[i2]-average),2);
}
variance=sum8/(float)n5;
printf("\n\n\tAverage of all elements = %.2f", average);
printf("\n\tVariance of all elements = %.2f\n", variance);
break;
case 2: printf("\n\n\tEnter 10 elements: ");
for (i11 = 0; i11 < 10; ++i11)
scanf("%f", &data[i11]);
printf("\n\tStandard Deviation = %.6f", calculateSD(data));
break;
default:printf("\n\n\tWrong Choice");
break;
}
printf("\n\n\tDo you want to repeat the statistical calculator? (y/n)");
scanf(" %c",&ch1);
}
while(ch1=='y');
break;
case 10:
do
{
printf("\n\n\tChoose the calculus operation");
printf("\n\n\t 1: Differential Equations");
printf("\n\t 2: Integration");
printf("\n\n\tEnter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("\n\n\tEnter the degree of polynomial equation: ");
scanf("%d", °);
printf("\n\n\tEnter the value of x1 for which the equation is to be evaluated: ");
scanf("%f", &x1);
for(i111=0;i111<=deg;i111++)
{
printf("\n\n\tEnter the coefficient of x1 to the power %d: ",i111);
scanf("%f",&axa[i111]);
}
y1 = poly(axa, deg, x1);
dy1 = deriv(axa, deg, x1);
printf("\n\n\tThe value of polynomial equation for the value of x1 = %.2f is: %.2f",x1,y1);
printf("\n\n\tThe value of the derivative of the polynomial equation at x1 = %.2f is: %.2f",x1,dy1);
case 2: /* Input */
printf("\n\n\tEnter lower limit of integration: ");
scanf("%f", &lower);
printf("\n\n\tEnter upper limit of integration: ");
scanf("%f", &upper);
printf("\n\n\tEnter number of sub intervals: ");
scanf("%d", &subInterval);
/* Calculation */
/* Finding step size */
stepSize = (upper - lower)/subInterval;
/* Finding Integration Value */
integration = f(lower) + f(upper);
for(i1=1; i1<= subInterval-1; i1++)
{
k = lower + i1*stepSize;
integration = integration + 2 * f(k);
}
integration = integration * stepSize/2;
printf("\n\n\tRequired value of integration is: %.3f", integration);
break;
default:printf("\n\n\tWrong Choice");
break;
}
printf("\n\n\tDo you want to repeat the calculus calculator? (y/n)");
scanf(" %c",&ch1);
}
while(ch1=='y');
break;
case 11:
do
{
printf("\n\n\tChoose the series operation");
printf("\n\n\t 1: Sum of first n natural numbers");
printf("\n\t 2: Arithmetic Progression");
printf("\n\t 3: Geometric Progression");
printf("\n\t 4: Harmonic Progression");
printf("\n\t 5: Summation");
printf("\n\n\tEnter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("\n\n\tEnter an integer number : ");
scanf ("%d",&num);
for(i3=1;i3<=num;i3++)
{
sum2=sum2+i3;
}
printf("\n\n\tSum of first %d natural numbers = %d\n",num,sum2);
break;
case 2: printf("\n\n\tEnter the total numbers in the A.P. series : ");
scanf("%d",&n5);
printf("\n\tEnter the first term value of the A.P. series : ");
scanf("%d",&a3);
printf("\n\tEnter the common difference of A.P. series : ");
scanf("%d",&d);
sum3=(n5*(2*a3+(n5-1)*d))/2;
tn=a3+(n5-1)*d;
printf("\n\n\tSum of the A.P series is : ");
for(i2=a3;i2<=tn;i2=i2+d)
{
if(i2!=tn)
{
printf("%d + ",i2);
}
else
{
printf("%d = %d ",i2,sum3);
}
}
break;
case 3: printf("\n\n\tEnter the total numbers in the G.P. series: ");
scanf("%d",&n5);
printf("\n\tEnter the first term of the G.P. series: ");
scanf("%f",&a4);
printf("\n\tEnter the common ratio of G.P. series: ");
scanf("%f",&r1);
sum4=(a4*(1-pow(r1,n5+1)))/(1-r1);
last_term=a4*pow(r1,n5-1);
printf("\n\n\tLast term term of G.P. series is : %.4f",last_term);
printf("\n\tSum of the G.P. series is : %.4f\n",sum4);
break;
case 4: printf("\n\n\t 1 + 1/2 + 1/3 + ......... +1/n");
printf("\n\tEnter the value of n : ");
scanf("%d",&n5);
for(i4=1;i4<=n5;i4++)
{
term=1/i4;
sum5=sum5+term;
}
printf("\n\n\tThe Sum of H.P Series is = %.4f\n",sum5);
break;
case 5: printf("\n\n\tThe given sequence is : \n\t");
printf("1^2 + 2^2 + 3^2 + 4^2 + ......... + n^2");
printf("\n\tEnter the value of n : ");
scanf("%d",&n5);
for(i2=1;i2<=n5;i2++)
{
sum6=sum6+pow(i2,2);
}
printf("\n\n\tSum of the series is %lu\n",sum6);
break;
default:printf("\n\n\tWrong Choice");
break;
}
printf("\n\n\tDo you want to repeat the series calculator? (y/n)");
scanf(" %c",&ch1);
}
while(ch1=='y');
break;
case 12:
do
{
printf("\n\n\tChoose the miscellaneous operation");
printf("\n\n\t 1: Floor and Ceil.");
printf("\n\t 2: Repeated Squaring");
printf("\n\t 3: Pascal Triangle");
printf("\n\t 4: Permutation and Combination");
printf("\n\n\tEnter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("\n\n\tEnter a float value to find its floor and ceil :");
scanf("%f",&val);
fVal=floor(val);
cVal =ceil(val);
printf("\n\n\tFloor value :%f\nCeil value :%f",fVal,cVal);
break;
case 2: printf("\nEnter a base number: ");
scanf("%d", &base);
printf("Enter an exponent: ");
scanf("%d", &exp);
while (exp != 0)
{
resultt *= base;
--exp;
}
printf("Answer = %lld", rresult);
break;
case 3: printf("\n 3) Pascal Triangle : ");
printf("\n\n\tEnter the number of rows : ");
scanf("%d",&row);
for(i2=0;i2<row;i2++)
{
for(space=1;space<=row-i2;space++)
{
printf(" ");
}
for(j2=0;j2<=i2;j2++)
{
if(j2==0||i2==0)
{
coef=1;
}
else
{
coef=coef*(i2-j2+1)/j2;
}
printf("%4d",coef);
}
printf("\n");
}
break;
case 4: printf("\n\n\tEnter a number n: ");
scanf("%d",&n55);
printf("\n\tEnter a number r: ");
scanf("%d",&r22);
e2=n55-r22;
fact1=1;
for(i2=1;i2<=n55;i2++)
{
fact1=fact1*i2;
}
fact2=1;
for(i2=1;i2<=e2;i2++)
{
fact2=fact2*i2;
}
fact3=1;
for(i2=1;i2<=r22;i2++)
{
fact3=fact3*i2;
}
npr=fact1/fact2;
printf("\n\n\tValue of %dP%d = %d",n55,r22,npr);
ncr=fact1/(fact2*fact3);
printf("\n\tValue of %dC%d = %d\n",n55,r22,ncr);
break;
default:printf("\n\n\tWrong Choice");
break;
}
printf("\n\n\tDo you want to repeat miscellaneous calculator? (y/n)");
scanf(" %c",&ch1);
}
while(ch1=='y');
break;
default:printf("\n\n\tWrong choice");
}
printf("\n\n\tDo you want to repeat any calculations? (y/n)");
scanf(" %c",&ch1);
}
while(ch1=='y');
}
//Function Definitions
int maxxx(int num11, int num22)
{
return (num11 > num22 ) ? num11 : num22;
}
int minnn(int num11, int num22)
{
return (num11 > num22 ) ? num22 : num11;
}
void anglemid_vector(val a100,val b100,val c100,val d100,val e100,val f100,val g100,val i100,val *h100)
{
i100=a100*cos((a100*d100+b100*e100+c100*f100)/(sqrt(a100*a100+b100*b100+c100*c100)*sqrt(d100*d100+e100*e100+f100*f100)));
if(g100!=1&&g100!=2&&g100!=3)
printf("\n SYNTAX ERROR:TRY AGAIN \n ");
else
*h100=(g100==1)?(i100*RD):((g100==2)?(i100):(i100*RG));
}
float calculateSD(float data[])
{
float sum = 0.0, mean, SD = 0.0;
int i1;
for (i1 = 0; i1 < 10; ++i1)
{
sum += data[i1];
}
mean = sum / 10;
for (i1 = 0; i1 < 10; ++i1)
{
SD += pow(data[i1] - mean, 2);
}
return sqrt(SD / 10);
}
float poly(float a[], int deg, float x1)
{
float p;
int i111;
p = a[deg];
for(i111=deg;i111>=1;i111--)
{
p = (a[i111-1] + x1*p);
}
return p;
}
float deriv(float axa[], int deg, float x)
{
float d[10], pd = 0, ps;
int i111,x1;
for(i111=0;i111<=deg;i111++)
{
ps = pow(x1, deg-(i111+1));
d[i111] = (deg-i111)*axa[deg-i111]*ps;
pd = pd + d[i111];
}
return pd;
}
|
the_stack_data/721160.c | //
// Created by zhang on 2017/1/5.
//
#include <time.h>
#include <stdio.h>
//C 库函数 char *asctime(const struct tm *timeptr) 返回一个指向字符串的指针，它代表了结构 struct timeptr 的日期和时间。
int asctime_main(){
// char *asctime(const struct tm *timeptr)
// timeptr 是指向 tm 结构的指针，包含了分解为如下各部分的日历时间：
// struct tm {
// int tm_sec; /* 秒，范围从 0 到 59 */
// int tm_min; /* 分，范围从 0 到 59 */
// int tm_hour; /* 小时，范围从 0 到 23 */
// int tm_mday; /* 一月中的第几天，范围从 1 到 31 */
// int tm_mon; /* 月份，范围从 0 到 11 */
// int tm_year; /* 自 1900 起的年数 */
// int tm_wday; /* 一周中的第几天，范围从 0 到 6 */
// int tm_yday; /* 一年中的第几天，范围从 0 到 365 */
// int tm_isdst; /* 夏令时 */
// };
// 该函数返回一个 C 字符串，包含了可读格式的日期和时间信息 Www Mmm dd hh:mm:ss yyyy，其中，
// Www 表示星期几，Mmm 是以字母表示的月份，dd 表示一月中的第几天，hh:mm:ss 表示时间，yyyy 表示年份。
struct tm t;
// t.tm_sec = 10;
// t.tm_min = 10;
// t.tm_hour = 6;
// t.tm_mday = 25;
// t.tm_mon = 2;
// t.tm_year = 89;
// t.tm_wday = 6;
t.tm_year = 117;
t.tm_mon = 1;
t.tm_wday = 4;
t.tm_mday = 5;
t.tm_hour = 20;
t.tm_min = 6;
t.tm_sec = 10;
puts(asctime(&t));
} |
the_stack_data/242329406.c | // RUN: echo "x" > %t1.res
// RUN: echo "x" >> %t1.res
// RUN: echo "x" >> %t1.res
// RUN: echo "x" >> %t1.res
// RUN: %llvmgcc %s -emit-llvm -O0 -c -o %t1.bc
// RUN: rm -rf %t.klee-out
// RUN: %klee --output-dir=%t.klee-out %t1.bc > %t1.log
// RUN: diff %t1.res %t1.log
#include <stdio.h>
unsigned klee_urange(unsigned start, unsigned end) {
unsigned x;
klee_make_symbolic(&x, sizeof x);
if (x-start>=end-start) klee_silent_exit(0);
return x;
}
int *make_int(int i) {
int *x = malloc(sizeof(*x));
*x = i;
return x;
}
int main() {
int *buf[4];
int i,s,t;
for (i=0; i<4; i++)
buf[i] = make_int((i+1)*2);
s = klee_urange(0,4);
int x = *buf[s];
if (x == 4)
if (s!=1)
abort();
printf("x\n");
fflush(stdout);
return 0;
}
|
the_stack_data/81865.c | #include<stdio.h>
main(){
//vou criar um for para percorrer os cantos de um quadrado
int y,x;
scanf("%d", &y);
x = y;
int cy, cx;
char q[y][x];
int c = 0;
if(x>=0 || x<=52){
while(c<(float)x/2){
for(cy=c, cx=c; cx<x-c; cx++) q[cy][cx] = 65+c; // topo
for(cy=c, cx=c; cy<y-c; cy++) q[cy][cx] = 65+c; // esquedo
for(cy=y-c-1, cx=c; cx<x-c; cx++) q[cy][cx] = 65+c; // base
for(cy=c, cx=x-c-1; cy<y-c; cy++) q[cy][cx] = 65+c; // direto
c++;
}
printf("\n");
for(cy=0; cy<y; cy++) {
for(cx=0; cx<x; cx++) printf("%c", q[cy][cx]);
printf("\n"); }
}}
|
the_stack_data/148578141.c | int main() {
float a = 1; a++; // a={2}
float b = 2; b++; // b={3}
float c;
c += 1; // c=T
if(c == a){ // c=a={2}
c += 1; // c={3}
a = c; // a={3}
}
// a={2,3}
return 0; // ret={5,6}
}
|
the_stack_data/232956278.c | #1 "dct.c"
#1 "dct.c" 1
#1 "<built-in>" 1
#1 "<built-in>" 3
#149 "<built-in>" 3
#1 "<command line>" 1
#1 "/opt/Xilinx/Vivado_HLS/2017.1/common/technology/autopilot/etc/autopilot_ssdm_op.h" 1
/* autopilot_ssdm_op.h*/
/*
#- (c) Copyright 2011-2017 Xilinx, Inc. All rights reserved.
#-
#- This file contains confidential and proprietary information
#- of Xilinx, Inc. and is protected under U.S. and
#- international copyright and other intellectual property
#- laws.
#-
#- DISCLAIMER
#- This disclaimer is not a license and does not grant any
#- rights to the materials distributed herewith. Except as
#- otherwise provided in a valid license issued to you by
#- Xilinx, and to the maximum extent permitted by applicable
#- law: (1) THESE MATERIALS ARE MADE AVAILABLE "AS IS" AND
#- WITH ALL FAULTS, AND XILINX HEREBY DISCLAIMS ALL WARRANTIES
#- AND CONDITIONS, EXPRESS, IMPLIED, OR STATUTORY, INCLUDING
#- BUT NOT LIMITED TO WARRANTIES OF MERCHANTABILITY, NON-
#- INFRINGEMENT, OR FITNESS FOR ANY PARTICULAR PURPOSE; and
#- (2) Xilinx shall not be liable (whether in contract or tort,
#- including negligence, or under any other theory of
#- liability) for any loss or damage of any kind or nature
#- related to, arising under or in connection with these
#- materials, including for any direct, or any indirect,
#- special, incidental, or consequential loss or damage
#- (including loss of data, profits, goodwill, or any type of
#- loss or damage suffered as a result of any action brought
#- by a third party) even if such damage or loss was
#- reasonably foreseeable or Xilinx had been advised of the
#- possibility of the same.
#-
#- CRITICAL APPLICATIONS
#- Xilinx products are not designed or intended to be fail-
#- safe, or for use in any application requiring fail-safe
#- performance, such as life-support or safety devices or
#- systems, Class III medical devices, nuclear facilities,
#- applications related to the deployment of airbags, or any
#- other applications that could lead to death, personal
#- injury, or severe property or environmental damage
#- (individually and collectively, "Critical
#- Applications"). Customer assumes the sole risk and
#- liability of any use of Xilinx products in Critical
#- Applications, subject only to applicable laws and
#- regulations governing limitations on product liability.
#-
#- THIS COPYRIGHT NOTICE AND DISCLAIMER MUST BE RETAINED AS
#- PART OF THIS FILE AT ALL TIMES.
#- ************************************************************************
*
* $Id$
*/
#289 "/opt/Xilinx/Vivado_HLS/2017.1/common/technology/autopilot/etc/autopilot_ssdm_op.h"
/*#define AP_SPEC_ATTR __attribute__ ((pure))*/
/****** SSDM Intrinsics: OPERATIONS ***/
// Interface operations
//typedef unsigned int __attribute__ ((bitwidth(1))) _uint1_;
void _ssdm_op_IfRead() __attribute__ ((nothrow));
void _ssdm_op_IfWrite() __attribute__ ((nothrow));
//_uint1_ _ssdm_op_IfNbRead() SSDM_OP_ATTR;
//_uint1_ _ssdm_op_IfNbWrite() SSDM_OP_ATTR;
//_uint1_ _ssdm_op_IfCanRead() SSDM_OP_ATTR;
//_uint1_ _ssdm_op_IfCanWrite() SSDM_OP_ATTR;
// Stream Intrinsics
void _ssdm_StreamRead() __attribute__ ((nothrow));
void _ssdm_StreamWrite() __attribute__ ((nothrow));
//_uint1_ _ssdm_StreamNbRead() SSDM_OP_ATTR;
//_uint1_ _ssdm_StreamNbWrite() SSDM_OP_ATTR;
//_uint1_ _ssdm_StreamCanRead() SSDM_OP_ATTR;
//_uint1_ _ssdm_StreamCanWrite() SSDM_OP_ATTR;
// Misc
void _ssdm_op_MemShiftRead() __attribute__ ((nothrow));
void _ssdm_op_Wait() __attribute__ ((nothrow));
void _ssdm_op_Poll() __attribute__ ((nothrow));
void _ssdm_op_Return() __attribute__ ((nothrow));
/* SSDM Intrinsics: SPECIFICATIONS */
void _ssdm_op_SpecSynModule() __attribute__ ((nothrow));
void _ssdm_op_SpecTopModule() __attribute__ ((nothrow));
void _ssdm_op_SpecProcessDecl() __attribute__ ((nothrow));
void _ssdm_op_SpecProcessDef() __attribute__ ((nothrow));
void _ssdm_op_SpecPort() __attribute__ ((nothrow));
void _ssdm_op_SpecConnection() __attribute__ ((nothrow));
void _ssdm_op_SpecChannel() __attribute__ ((nothrow));
void _ssdm_op_SpecSensitive() __attribute__ ((nothrow));
void _ssdm_op_SpecModuleInst() __attribute__ ((nothrow));
void _ssdm_op_SpecPortMap() __attribute__ ((nothrow));
void _ssdm_op_SpecReset() __attribute__ ((nothrow));
void _ssdm_op_SpecPlatform() __attribute__ ((nothrow));
void _ssdm_op_SpecClockDomain() __attribute__ ((nothrow));
void _ssdm_op_SpecPowerDomain() __attribute__ ((nothrow));
int _ssdm_op_SpecRegionBegin() __attribute__ ((nothrow));
int _ssdm_op_SpecRegionEnd() __attribute__ ((nothrow));
void _ssdm_op_SpecLoopName() __attribute__ ((nothrow));
void _ssdm_op_SpecLoopTripCount() __attribute__ ((nothrow));
int _ssdm_op_SpecStateBegin() __attribute__ ((nothrow));
int _ssdm_op_SpecStateEnd() __attribute__ ((nothrow));
void _ssdm_op_SpecInterface() __attribute__ ((nothrow));
void _ssdm_op_SpecPipeline() __attribute__ ((nothrow));
void _ssdm_op_SpecDataflowPipeline() __attribute__ ((nothrow));
void _ssdm_op_SpecLatency() __attribute__ ((nothrow));
void _ssdm_op_SpecParallel() __attribute__ ((nothrow));
void _ssdm_op_SpecProtocol() __attribute__ ((nothrow));
void _ssdm_op_SpecOccurrence() __attribute__ ((nothrow));
void _ssdm_op_SpecResource() __attribute__ ((nothrow));
void _ssdm_op_SpecResourceLimit() __attribute__ ((nothrow));
void _ssdm_op_SpecCHCore() __attribute__ ((nothrow));
void _ssdm_op_SpecFUCore() __attribute__ ((nothrow));
void _ssdm_op_SpecIFCore() __attribute__ ((nothrow));
void _ssdm_op_SpecIPCore() __attribute__ ((nothrow));
void _ssdm_op_SpecKeepValue() __attribute__ ((nothrow));
void _ssdm_op_SpecMemCore() __attribute__ ((nothrow));
void _ssdm_op_SpecExt() __attribute__ ((nothrow));
/*void* _ssdm_op_SpecProcess() SSDM_SPEC_ATTR;
void* _ssdm_op_SpecEdge() SSDM_SPEC_ATTR; */
/* Presynthesis directive functions */
void _ssdm_SpecArrayDimSize() __attribute__ ((nothrow));
void _ssdm_RegionBegin() __attribute__ ((nothrow));
void _ssdm_RegionEnd() __attribute__ ((nothrow));
void _ssdm_Unroll() __attribute__ ((nothrow));
void _ssdm_UnrollRegion() __attribute__ ((nothrow));
void _ssdm_InlineAll() __attribute__ ((nothrow));
void _ssdm_InlineLoop() __attribute__ ((nothrow));
void _ssdm_Inline() __attribute__ ((nothrow));
void _ssdm_InlineSelf() __attribute__ ((nothrow));
void _ssdm_InlineRegion() __attribute__ ((nothrow));
void _ssdm_SpecArrayMap() __attribute__ ((nothrow));
void _ssdm_SpecArrayPartition() __attribute__ ((nothrow));
void _ssdm_SpecArrayReshape() __attribute__ ((nothrow));
void _ssdm_SpecStream() __attribute__ ((nothrow));
void _ssdm_SpecExpr() __attribute__ ((nothrow));
void _ssdm_SpecExprBalance() __attribute__ ((nothrow));
void _ssdm_SpecDependence() __attribute__ ((nothrow));
void _ssdm_SpecLoopMerge() __attribute__ ((nothrow));
void _ssdm_SpecLoopFlatten() __attribute__ ((nothrow));
void _ssdm_SpecLoopRewind() __attribute__ ((nothrow));
void _ssdm_SpecFuncInstantiation() __attribute__ ((nothrow));
void _ssdm_SpecFuncBuffer() __attribute__ ((nothrow));
void _ssdm_SpecFuncExtract() __attribute__ ((nothrow));
void _ssdm_SpecConstant() __attribute__ ((nothrow));
void _ssdm_DataPack() __attribute__ ((nothrow));
void _ssdm_SpecDataPack() __attribute__ ((nothrow));
void _ssdm_op_SpecBitsMap() __attribute__ ((nothrow));
void _ssdm_op_SpecLicense() __attribute__ ((nothrow));
/*#define _ssdm_op_WaitUntil(X) while (!(X)) _ssdm_op_Wait(1);
#define _ssdm_op_Delayed(X) X */
#427 "/opt/Xilinx/Vivado_HLS/2017.1/common/technology/autopilot/etc/autopilot_ssdm_op.h"
// 67d7842dbbe25473c3c32b93c0da8047785f30d78e8a024de1b57352245f9689
#6 "<command line>" 2
#1 "<built-in>" 2
#1 "dct.c" 2
#1 "./dct.h" 1
typedef short dct_data_t;
void dct(short input[1024/16], short output[1024/16]);
#3 "dct.c" 2
void dct_1d(dct_data_t src[8 /* defines the input matrix as 8x8 */], dct_data_t dst[8 /* defines the input matrix as 8x8 */])
{_ssdm_SpecArrayDimSize(dst,8);_ssdm_SpecArrayDimSize(src,8);
unsigned int k, n;
int tmp;
const dct_data_t dct_coeff_table[8 /* defines the input matrix as 8x8 */][8 /* defines the input matrix as 8x8 */] = {
#1 "./dct_coeff_table.txt" 1
8192, 8192, 8192, 8192, 8192, 8192, 8192, 8192,
11363, 9633, 6436, 2260, -2260, -6436, -9632,-11362,
10703, 4433, -4433,-10703,-10703, -4433, 4433, 10703,
9633, -2260,-11362, -6436, 6436, 11363, 2260, -9632,
8192, -8192, -8192, 8192, 8192, -8191, -8191, 8192,
6436,-11362, 2260, 9633, -9632, -2260, 11363, -6436,
4433,-10703, 10703, -4433, -4433, 10703,-10703, 4433,
2260, -6436, 9633,-11362, 11363, -9632, 6436, -2260
#10 "dct.c" 2
};
_ssdm_SpecConstant(dct_coeff_table);
#10 "dct.c"
DCT_Outer_Loop:
for (k = 0; k < 8 /* defines the input matrix as 8x8 */; k++) {
_ssdm_op_SpecPipeline(-1, 1, 1, 0, "");
#13 "dct.c"
DCT_Inner_Loop:
for(n = 0, tmp = 0; n < 8 /* defines the input matrix as 8x8 */; n++) {
int coeff = (int)dct_coeff_table[k][n];
tmp += src[n] * coeff;
}
dst[k] = (((tmp) + (1 << ((13)-1))) >> 13);
}
}
void dct_2d(dct_data_t in_block[8 /* defines the input matrix as 8x8 */][8 /* defines the input matrix as 8x8 */],
dct_data_t out_block[8 /* defines the input matrix as 8x8 */][8 /* defines the input matrix as 8x8 */])
{_ssdm_SpecArrayDimSize(out_block,8);_ssdm_SpecArrayDimSize(in_block,8);
dct_data_t row_outbuf[8 /* defines the input matrix as 8x8 */][8 /* defines the input matrix as 8x8 */];
dct_data_t col_outbuf[8 /* defines the input matrix as 8x8 */][8 /* defines the input matrix as 8x8 */], col_inbuf[8 /* defines the input matrix as 8x8 */][8 /* defines the input matrix as 8x8 */];
_ssdm_SpecArrayPartition( col_inbuf, 2, "COMPLETE", 0, "");
#27 "dct.c"
unsigned i, j;
// DCT rows
Row_DCT_Loop:
for(i = 0; i < 8 /* defines the input matrix as 8x8 */; i++) {
dct_1d(in_block[i], row_outbuf[i]);
}
// Transpose data in order to re-use 1D DCT code
Xpose_Row_Outer_Loop:
for (j = 0; j < 8 /* defines the input matrix as 8x8 */; j++)
Xpose_Row_Inner_Loop:
for(i = 0; i < 8 /* defines the input matrix as 8x8 */; i++)
_ssdm_op_SpecPipeline(-1, 1, 1, 0, "");
#40 "dct.c"
col_inbuf[j][i] = row_outbuf[i][j];
// DCT columns
Col_DCT_Loop:
for (i = 0; i < 8 /* defines the input matrix as 8x8 */; i++) {
dct_1d(col_inbuf[i], col_outbuf[i]);
}
// Transpose data back into natural order
Xpose_Col_Outer_Loop:
for (j = 0; j < 8 /* defines the input matrix as 8x8 */; j++)
Xpose_Col_Inner_Loop:
for(i = 0; i < 8 /* defines the input matrix as 8x8 */; i++)
_ssdm_op_SpecPipeline(-1, 1, 1, 0, "");
#51 "dct.c"
out_block[j][i] = col_outbuf[i][j];
}
void read_data(short input[1024/16], short buf[8 /* defines the input matrix as 8x8 */][8 /* defines the input matrix as 8x8 */])
{_ssdm_SpecArrayDimSize(input,1024/16);_ssdm_SpecArrayDimSize(buf,8);
int r, c;
RD_Loop_Row:
for (r = 0; r < 8 /* defines the input matrix as 8x8 */; r++) {
RD_Loop_Col:
for (c = 0; c < 8 /* defines the input matrix as 8x8 */; c++)
_ssdm_op_SpecPipeline(-1, 1, 1, 0, "");
#62 "dct.c"
buf[r][c] = input[r * 8 /* defines the input matrix as 8x8 */ + c];
}
}
void write_data(short buf[8 /* defines the input matrix as 8x8 */][8 /* defines the input matrix as 8x8 */], short output[1024/16])
{_ssdm_SpecArrayDimSize(output,1024/16);_ssdm_SpecArrayDimSize(buf,8);
int r, c;
WR_Loop_Row:
for (r = 0; r < 8 /* defines the input matrix as 8x8 */; r++) {
WR_Loop_Col:
for (c = 0; c < 8 /* defines the input matrix as 8x8 */; c++)
_ssdm_op_SpecPipeline(-1, 1, 1, 0, "");
#74 "dct.c"
output[r * 8 /* defines the input matrix as 8x8 */ + c] = buf[r][c];
}
}
void dct(short input[1024/16], short output[1024/16])
{_ssdm_SpecArrayDimSize(output,1024/16);_ssdm_SpecArrayDimSize(input,1024/16);
_ssdm_op_SpecDataflowPipeline(-1, "");
#79 "dct.c"
short buf_2d_in[8 /* defines the input matrix as 8x8 */][8 /* defines the input matrix as 8x8 */];
_ssdm_SpecArrayPartition( buf_2d_in, 2, "COMPLETE", 0, "");
#81 "dct.c"
short buf_2d_out[8 /* defines the input matrix as 8x8 */][8 /* defines the input matrix as 8x8 */];
// Read input data. Fill the internal buffer.
read_data(input, buf_2d_in);
dct_2d(buf_2d_in, buf_2d_out);
// Write out the results.
write_data(buf_2d_out, output);
}
|
the_stack_data/126596.c | //
// main.c
// beej-datagram-listener
//
// Created by wan zhongwen on 2021/3/11.
//
#include <stdio.h>
#include <stdlib.h>
#include <netdb.h>
#include <string.h>
#include <unistd.h>
#include <arpa/inet.h>
#define MYPORT "4950" // the port users will be connecting to
#define MAXBUFLEN 100
void *get_in_addr(struct sockaddr *sa)
{
if (sa->sa_family == AF_INET){
return &(((struct sockaddr_in *)sa)->sin_addr);
} else {
return &(((struct sockaddr_in6 *)sa)->sin6_addr);
}
}
int main(void)
{
int sockfd;
struct addrinfo hints, *servinfo, *p;
int rv;
ssize_t numbytes;
struct sockaddr_storage their_addr;
char buf[MAXBUFLEN];
socklen_t addr_len;
char s[INET6_ADDRSTRLEN];
memset(&hints, 0, sizeof(hints));
hints.ai_family = AF_INET6;
hints.ai_socktype = SOCK_DGRAM;
hints.ai_flags = AI_PASSIVE;
if ((rv = getaddrinfo(NULL, MYPORT, &hints, &servinfo)) != 0) {
fprintf(stderr, "getaddrinfo: %s\n", gai_strerror(rv));
exit(EXIT_FAILURE);
}
for (p = servinfo; p != NULL; p = p->ai_next) {
if ((sockfd = socket(p->ai_family, p->ai_socktype, p->ai_protocol)) == -1) {
perror("listener: socket");
continue;
}
if (bind(sockfd, p->ai_addr, p->ai_addrlen) == -1) {
perror("listener: bind");
continue;
}
break;
}
if (p == NULL) {
fprintf(stderr, "listener: failed to bind socket\n");
exit(2);
}
freeaddrinfo(servinfo);
printf("listener: waiting to recvfrom...\n");
addr_len = sizeof(their_addr);
if ((numbytes = recvfrom(sockfd, buf, MAXBUFLEN - 1, 0, (struct sockaddr *)&their_addr, &addr_len)) == -1) {
perror("recvfrom");
exit(EXIT_FAILURE);
}
printf("listener: got packet from %s\n", inet_ntop(p->ai_family, get_in_addr(p->ai_addr), s, sizeof(s)));
printf("listener: packet is %zd bytes long\n", numbytes);
buf[numbytes] = '\0';
printf("listener: packet contains \"%s\"\n", buf);
close(sockfd);
return EXIT_SUCCESS;
}
|
the_stack_data/190768242.c | /*
* simple tests: initialized (or not) variables and const
* to inspect memory section mapping
*/
#include <stdlib.h>
#include <stdio.h>
int a=12;
int b=35;
int const c=10;
int d;
int main()
{
a=a+c;
d=a+b;
while(1) ;
return 0;
}
|
the_stack_data/122015867.c | /*
* Copyright (c) 2020 Friedt Professional Engineering Services, Inc
*
* SPDX-License-Identifier: BSD-3-Clause
*/
#ifdef CONFIG_SPI_SIM
#include <drivers/spi.h>
#include <drivers/gpio.h>
#include <drivers/spi/spi_sim.h>
#include <drivers/eeprom.h>
#include <stdio.h>
#include <sys/util.h>
#include <zephyr.h>
#include <logging/log.h>
LOG_MODULE_REGISTER(test_spi_sim, CONFIG_SPI_LOG_LEVEL);
#ifndef SPI_DEV_NAME
#define SPI_DEV_NAME "SPI_0"
#endif
/* AT25 instruction set */
typedef enum {
AT25_WRSR = 1, /* Write STATUS register */
AT25_WRITE = 2, /* Write data to memory array */
AT25_READ = 3, /* Read data from memory array */
AT25_WRDI = 4, /* Reset the write enable latch */
AT25_RDSR = 5, /* Read STATUS register */
AT25_WREN = 6, /* Set the write enable latch */
AT25_EONE = 0x52, /* Erase One Sector in Memory Array */
AT25_EALL = 0x62, /* Erase All Sectors in Memory Array */
AT25_RDR = 0x15, /* Read Manufacturer and Product ID */
} at25_op_t;
/* AT25 status register bits */
typedef enum {
AT25_STATUS_WIP = BIT(0), /* Write-In-Process (RO) */
AT25_STATUS_WEL = BIT(1), /* Write Enable Latch (RO) */
AT25_STATUS_BP0 = BIT(2), /* Block Protection 0 (RW) */
AT25_STATUS_BP1 = BIT(3), /* Block Protection 1 (RW) */
} at25_status_t;
static int spi_sim_callback(struct device *dev, const struct spi_config *config,
const struct spi_buf_set *tx_bufs,
const struct spi_buf_set *rx_bufs)
{
static uint8_t status;
static uint8_t data[256];
static bool write;
static uint32_t addr;
const struct spi_buf *tx = &tx_bufs->buffers[0];
const struct spi_buf *rx;
uint8_t *x;
size_t len;
/* if there is a chip-select, then use it! */
if (config->cs != NULL) {
k_usleep(config->cs->delay);
if ((config->operation & SPI_CS_ACTIVE_HIGH) != 0) {
gpio_pin_set(config->cs->gpio_dev, config->cs->gpio_pin, 1);
} else {
gpio_pin_set(config->cs->gpio_dev, config->cs->gpio_pin, 0);
}
}
at25_op_t op = ((uint8_t *)tx->buf)[0] & (~0x08);
switch(op) {
case AT25_WRSR:
break;
case AT25_WRITE:
write = true;
__ASSERT_NO_MSG(tx->len >= 4);
addr = 0;
/* A[23..17] are don't care bits for the 512k version */
/* addr |= (uint32_t)(((uint8_t *)tx->buf)[0]) << 16; */
/* A[16] should be a zero bit for the 512k version */
addr |= ((uint32_t)(((uint8_t *)tx->buf)[1]) << 8) & 7;
addr |= (uint32_t)(((uint8_t *)tx->buf)[2]) << 0;
if (tx->len == 4) {
__ASSERT_NO_MSG(tx_bufs->count > 1);
tx = &tx_bufs->buffers[1];
x = tx->buf;
len = tx->len;
} else {
x = (uint8_t *)tx->buf + 4;
len = tx->len - 4;
}
memcpy(&data[addr], x, len);
write = false;
break;
case AT25_READ:
write = false;
addr = 0;
/* A[23..17] are don't care bits for the 512k version */
/* addr |= (uint32_t)(((uint8_t *)tx->buf)[0]) << 16; */
/* A[16] should be a zero bit for the 512k version */
addr |= ((uint32_t)(((uint8_t *)tx->buf)[1]) << 8) & 7;
addr |= (uint32_t)(((uint8_t *)tx->buf)[2]) << 0;
if (tx->len == 4) {
__ASSERT_NO_MSG(rx_bufs->count > 1);
rx = &rx_bufs->buffers[1];
x = rx->buf;
len = rx->len;
} else {
rx = &rx_bufs->buffers[0];
x = (uint8_t *)rx->buf + 4;
len = rx->len - 4;
}
memcpy(x, &data[addr], len);
break;
case AT25_WRDI:
break;
case AT25_RDSR:
rx = &rx_bufs->buffers[0];
memcpy(rx->buf, tx->buf, sizeof(rx->len));
((uint8_t *)rx->buf)[1] = status;
break;
case AT25_WREN:
status |= AT25_STATUS_WEL;
break;
case AT25_EONE:
break;
case AT25_EALL:
break;
case AT25_RDR:
break;
default:
__ASSERT(1 == 0, "invalid opcode %u", op);
break;
}
/* if there is a chip-select, then use it! */
if (config->cs != NULL) {
if ((config->operation & SPI_CS_ACTIVE_HIGH) != 0) {
gpio_pin_set(config->cs->gpio_dev, config->cs->gpio_pin, 0);
} else {
gpio_pin_set(config->cs->gpio_dev, config->cs->gpio_pin, 1);
}
k_usleep(config->cs->delay);
}
return 0;
}
void spi_sim_setup(void)
{
int r;
struct device *dev;
dev = device_get_binding(SPI_DEV_NAME);
__ASSERT(dev != NULL, "failed to get binding for " SPI_DEV_NAME);
r = spi_sim_callback_register(dev, 0, spi_sim_callback);
__ASSERT(r == 0, "failed to register spi_sim callback: %d", r);
}
#endif /* CONFIG_SPI_SIM */
|
the_stack_data/145453733.c | #include<stdio.h>
void main()
{
int n1=0,n2=1,n3,i,n;
printf("enter the number of elements in the sequence");
scanf("%d",&n);
if(n>=1) printf("%d ",n1);//for 1 element only 0 will be printed
if(n>=2) printf("%d ",n2);//for 2 elemnets 0 1 will be printed
for(i=3;i<=n;i++){
n3=n1+n2;
printf("%d ",n3);
n1=n2;n2=n3;
}
}
|
the_stack_data/125140979.c | /*
MIT License (MIT)
Copyright (c) 2015 xiSQL
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
#include <stdio.h>
#include <dlfcn.h>
int main(int argc, char *argv[]){
void *pHandle = NULL;
int (*startup)(int, char*[]);
char *errorInfo = NULL;
int res = 0;
pHandle = dlopen("xisql.so", RTLD_NOW);
if (pHandle == NULL){
printf("xisql[error]: %s.\r\n", dlerror());
return 0;
}
startup = dlsym(pHandle, "startup");
errorInfo = dlerror();
if (errorInfo != NULL){
printf("xisql[error]: startup method error: %s.\r\n", errorInfo);
dlclose(pHandle);
return 0;
}
res = (*startup)(argc, argv);
if (res != 0){
printf("return error.\r\n");
}
dlclose(pHandle);
}
|
the_stack_data/138752.c | #include<stdio.h>
void main()
{
int n,s,t,x,i,S=0;
printf("Enter the value n : ");
scanf("%d",&n);
printf("Enter the value s : ");
scanf("%d",&s);
printf("Enter the value t : ");
scanf("%d",&t);
printf("Enter %d numbers : ",n);
for(i=1;i<=n;i++)
{
scanf("%d",&x);
if(s<=x&&x<=t)
{
S=S+x;
}
}
printf("The required sum is = %d.\n",S);
}
/*
Enter the value n : 5
Enter the value s : 30
Enter the value t : 90
Enter 5 numbers : 33 100 77 42 12
The required sum is = 152.
Enter the value n : 10
Enter the value s : 1
Enter the value t : 10
Enter 10 numbers : 1 2 3 4 5 6 7 8 9 10
The required sum is = 55.
Enter the value n : 8
Enter the value s : 100
Enter the value t : 150
Enter 8 numbers : 123 113 453 678 32 90 111 151
The required sum is = 347.
*/
|
the_stack_data/34511698.c | /* origin: FreeBSD /usr/src/lib/msun/src/e_logf.c */
/*
* Conversion to float by Ian Lance Taylor, Cygnus Support, [email protected].
*/
/*
* ====================================================
* Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
*
* Developed at SunPro, a Sun Microsystems, Inc. business.
* Permission to use, copy, modify, and distribute this
* software is freely granted, provided that this notice
* is preserved.
* ====================================================
*/
#include <math.h>
#include <stdint.h>
static const float
ln2_hi = 6.9313812256e-01, /* 0x3f317180 */
ln2_lo = 9.0580006145e-06, /* 0x3717f7d1 */
/* |(log(1+s)-log(1-s))/s - Lg(s)| < 2**-34.24 (~[-4.95e-11, 4.97e-11]). */
Lg1 = 0xaaaaaa.0p-24, /* 0.66666662693 */
Lg2 = 0xccce13.0p-25, /* 0.40000972152 */
Lg3 = 0x91e9ee.0p-25, /* 0.28498786688 */
Lg4 = 0xf89e26.0p-26; /* 0.24279078841 */
float logf(float x)
{
union {float f; uint32_t i;} u = {x};
float_t hfsq,f,s,z,R,w,t1,t2,dk;
uint32_t ix;
int k;
ix = u.i;
k = 0;
if (ix < 0x00800000 || ix>>31) { /* x < 2**-126 */
if (ix<<1 == 0)
return -1/(x*x); /* log(+-0)=-inf */
if (ix>>31)
return (x-x)/0.0f; /* log(-#) = NaN */
/* subnormal number, scale up x */
k -= 25;
x *= 0x1p25f;
u.f = x;
ix = u.i;
} else if (ix >= 0x7f800000) {
return x;
} else if (ix == 0x3f800000)
return 0;
/* reduce x into [sqrt(2)/2, sqrt(2)] */
ix += 0x3f800000 - 0x3f3504f3;
k += (int)(ix>>23) - 0x7f;
ix = (ix&0x007fffff) + 0x3f3504f3;
u.i = ix;
x = u.f;
f = x - 1.0f;
s = f/(2.0f + f);
z = s*s;
w = z*z;
t1= w*(Lg2+w*Lg4);
t2= z*(Lg1+w*Lg3);
R = t2 + t1;
hfsq = 0.5f*f*f;
dk = k;
return s*(hfsq+R) + dk*ln2_lo - hfsq + f + dk*ln2_hi;
}
|
the_stack_data/1069038.c | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <fcntl.h>
#include <string.h>
int main() {
char buffer[1000];
int amount_read;
int fd;
int amount_to_read = 1;
char separator[] = "|";
fd = fileno(stdin);
while (amount_read = read(fd, buffer, amount_to_read))
{
if (amount_read == -1)
{
perror("error reading");
return EXIT_FAILURE;
}
if (fwrite(buffer, sizeof(char), amount_read, stdout) == -1)
{
perror("error writing");
return EXIT_FAILURE;
}
if (fwrite(separator, sizeof(char), strlen(separator), stdout) == -1)
{
perror("error writing");
return EXIT_FAILURE;
}
amount_to_read++;
if (amount_to_read > sizeof(buffer))
amount_to_read = sizeof(buffer);
}
return EXIT_SUCCESS;
}
|
the_stack_data/97014226.c | #include <stdio.h>
#include <stdlib.h>
#include <omp.h>
int sumaglobal=0;
int main(int argc, char *argv[]){
int numeroDeHilos=strtol(argv[1],NULL,10);
long a[20],b[20];
long resultado=0;
int j;
for(j=0;j<20;j++){
a[j]=j*j;
b[j]=j;
}
int i;
#pragma omp parallel for num_threads(numeroDeHilos) \
reduction(+ : resultado)
for(i=0;i<20;i++)
resultado+=a[i]+b[i];
printf("El resultado de la operación es %ld\n", resultado);
return 0;
} |
the_stack_data/82949615.c | #include <unistd.h>
#include <stdio.h>
#include <stdlib.h>
int main(int argc, char *argv[]){
int a_flag = 0;
int size = 8192;
char ch;
char input[size];
FILE *output;
if(argc < 1){
fprintf(stderr, "Please specify at least one file\n");
return 1;
}
while ((ch = getopt(argc, argv,"a"))!=EOF){ /*check options*/
switch (ch) {
case 'a'/* append mode initiated */:
a_flag = 1;
break;
default:
fprintf(stderr, "Unknown option: '%s'\n", optarg);
return 1;
}
}
argc -= optind;
argv += optind;
while (fgets(input, size, stdin)){ /* Write to data stream*/
for(int i = 0; i < argc; i++){
if (a_flag){
output = fopen(argv[i],"a");
}
else{
output = fopen(argv[i],"w");
}
fprintf(output, "%s", input);
fclose(output);
}
fprintf(stdout,"%s",input);
}
return 0;
}
/*
Question 3: I got a segmentation fault when i accidentally include
argc -= optind and etc in the while loop. I also did not check if the file
exist or not. Next time I would add this check. But in terms of implementing
checking options and write to data stream, i followed the book example.
Question 4: The professional code implemnt the -i option and used a dynamically
allocated array for the buffer. The professional solution also implemented
warning with errno.
*/
|
the_stack_data/32950129.c | /*
* $Id: wce_getopt.c 62 2007-01-17 00:04:39Z mloskot $
*
* Copyright (c) 1987, 1993, 1994
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#if 0
static char sccsid[] = "@(#)getopt.c 8.3 (Berkeley) 4/27/95";
__RCSID("$NetBSD: getopt.c,v 1.26 2003/08/07 16:43:40 agc Exp $");
#endif
#include <stdio.h>
#include <string.h>
/*
* Declared in <unistd.h>
*/
char *optarg; /* argument associated with option */
int opterr = 1; /* if error message should be printed */
int optind = 1; /* index into parent argv vector */
int optopt; /* character checked for validity */
int optreset; /* reset getopt */
#define BADCH (int)'?'
#define BADARG (int)':'
#define EMSG ""
/*******************************************************************************
* wceex_getopt - function is a command-line parser
*
* Description:
*
* The parameters argc and argv are the argument count and argument array as
* passed to main(). The argument optstring is a string of recognised option
* characters. If a character is followed by a colon, the option takes an argument.
*
* The variable optind is the index of the next element of the argv[] vector to be
* processed. It is initialised to 1 by the system, and getopt() updates it when it
* finishes with each element of argv[].
*
* NOTE: Implementation of the getopt() function was grabbed from NetBSD
* operating system sources. See copyright note in the file header.
*
* Return:
*
* Returns the next option character specified on the command line.
* A colon (:) is returned if getopt() detects a missing argument and
* the first character of optstring was a colon (:).
* A question mark (?) is returned if getopt() encounters an option
* character not in optstring or detects a missing argument and the first
* character of optstring was not a colon (:).
* Otherwise getopt() returns -1 when all command line options are parsed.
*
* Reference:
*
* IEEE 1003.1, 2004 Edition
*
*******************************************************************************/
int wceex_getopt(int argc, char * const argv[], const char *optstring)
{
static char *place = EMSG; /* option letter processing */
char *oli; /* option letter list index */
if (optreset || *place == 0) { /* update scanning pointer */
optreset = 0;
place = argv[optind];
if (optind >= argc || *place++ != '-') {
/* Argument is absent or is not an option */
place = EMSG;
return (-1);
}
optopt = *place++;
if (optopt == '-' && *place == 0) {
/* "--" => end of options */
++optind;
place = EMSG;
return (-1);
}
if (optopt == 0) {
/* Solitary '-', treat as a '-' option
if the program (eg su) is looking for it. */
place = EMSG;
if (strchr(optstring, '-') == NULL)
return -1;
optopt = '-';
}
} else
optopt = *place++;
/* See if option letter is one the caller wanted... */
if (optopt == ':' || (oli = strchr(optstring, optopt)) == NULL) {
if (*place == 0)
++optind;
if (opterr && *optstring != ':')
(void)fprintf(stderr,
"unknown option -- %c\n", optopt);
return (BADCH);
}
/* Does this option need an argument? */
if (oli[1] != ':') {
/* don't need argument */
optarg = NULL;
if (*place == 0)
++optind;
} else {
/* Option-argument is either the rest of this argument or the
entire next argument. */
if (*place)
optarg = place;
else if (argc > ++optind)
optarg = argv[optind];
else {
/* option-argument absent */
place = EMSG;
if (*optstring == ':')
return (BADARG);
if (opterr)
(void)fprintf(stderr,
"option requires an argument -- %c\n",
optopt);
return (BADCH);
}
place = EMSG;
++optind;
}
return (optopt); /* return option letter */
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.