file
stringlengths 18
26
| data
stringlengths 3
1.04M
|
|---|---|
the_stack_data/1177327.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <CL/cl.h>
unsigned char *read_buffer(char *file_name, size_t *size_ptr)
{
FILE *f;
unsigned char *buf;
size_t size;
/* Open file */
f = fopen(file_name, "rb");
if (!f)
return NULL;
/* Obtain file size */
fseek(f, 0, SEEK_END);
size = ftell(f);
fseek(f, 0, SEEK_SET);
/* Allocate and read buffer */
buf = malloc(size + 1);
fread(buf, 1, size, f);
buf[size] = '\0';
/* Return size of buffer */
if (size_ptr)
*size_ptr = size;
/* Return buffer */
return buf;
}
void write_buffer(char *file_name, const char *buffer, size_t buffer_size)
{
FILE *f;
/* Open file */
f = fopen(file_name, "w+");
/* Write buffer */
if(buffer)
fwrite(buffer, 1, buffer_size, f);
/* Close file */
fclose(f);
}
int main(int argc, char const *argv[])
{
/* Get platform */
cl_platform_id platform;
cl_uint num_platforms;
cl_int ret = clGetPlatformIDs(1, &platform, &num_platforms);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clGetPlatformIDs' failed\n");
exit(1);
}
printf("Number of platforms: %d\n", num_platforms);
printf("platform=%p\n", platform);
/* Get platform name */
char platform_name[100];
ret = clGetPlatformInfo(platform, CL_PLATFORM_NAME, sizeof(platform_name), platform_name, NULL);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clGetPlatformInfo' failed\n");
exit(1);
}
printf("platform.name='%s'\n\n", platform_name);
/* Get device */
cl_device_id device;
cl_uint num_devices;
ret = clGetDeviceIDs(platform, CL_DEVICE_TYPE_GPU, 1, &device, &num_devices);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clGetDeviceIDs' failed\n");
exit(1);
}
printf("Number of devices: %d\n", num_devices);
printf("device=%p\n", device);
/* Get device name */
char device_name[100];
ret = clGetDeviceInfo(device, CL_DEVICE_NAME, sizeof(device_name),
device_name, NULL);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clGetDeviceInfo' failed\n");
exit(1);
}
printf("device.name='%s'\n", device_name);
printf("\n");
/* Create a Context Object */
cl_context context;
context = clCreateContext(NULL, 1, &device, NULL, NULL, &ret);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clCreateContext' failed\n");
exit(1);
}
printf("context=%p\n", context);
/* Create a Command Queue Object*/
cl_command_queue command_queue;
command_queue = clCreateCommandQueue(context, device, 0, &ret);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clCreateCommandQueue' failed\n");
exit(1);
}
printf("command_queue=%p\n", command_queue);
printf("\n");
/* Program source */
unsigned char *source_code;
size_t source_length;
/* Read program from 'isunordered_float4float4.cl' */
source_code = read_buffer("isunordered_float4float4.cl", &source_length);
/* Create a program */
cl_program program;
program = clCreateProgramWithSource(context, 1, (const char **)&source_code, &source_length, &ret);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clCreateProgramWithSource' failed\n");
exit(1);
}
printf("program=%p\n", program);
/* Build program */
ret = clBuildProgram(program, 1, &device, NULL, NULL, NULL);
if (ret != CL_SUCCESS )
{
size_t size;
char *log;
/* Get log size */
clGetProgramBuildInfo(program, device, CL_PROGRAM_BUILD_LOG,0, NULL, &size);
/* Allocate log and print */
log = malloc(size);
clGetProgramBuildInfo(program, device, CL_PROGRAM_BUILD_LOG,size, log, NULL);
printf("error: call to 'clBuildProgram' failed:\n%s\n", log);
/* Free log and exit */
free(log);
exit(1);
}
printf("program built\n");
printf("\n");
/* Create a Kernel Object */
cl_kernel kernel;
kernel = clCreateKernel(program, "isunordered_float4float4", &ret);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clCreateKernel' failed\n");
exit(1);
}
/* Create and allocate host buffers */
size_t num_elem = 10;
/* Create and init host side src buffer 0 */
cl_float4 *src_0_host_buffer;
src_0_host_buffer = malloc(num_elem * sizeof(cl_float4));
for (int i = 0; i < num_elem; i++)
src_0_host_buffer[i] = (cl_float4){{2.0, 2.0, 2.0, 2.0}};
/* Create and init device side src buffer 0 */
cl_mem src_0_device_buffer;
src_0_device_buffer = clCreateBuffer(context, CL_MEM_READ_ONLY, num_elem * sizeof(cl_float4), NULL, &ret);
if (ret != CL_SUCCESS)
{
printf("error: could not create source buffer\n");
exit(1);
}
ret = clEnqueueWriteBuffer(command_queue, src_0_device_buffer, CL_TRUE, 0, num_elem * sizeof(cl_float4), src_0_host_buffer, 0, NULL, NULL);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clEnqueueWriteBuffer' failed\n");
exit(1);
}
/* Create and init host side src buffer 1 */
cl_float4 *src_1_host_buffer;
src_1_host_buffer = malloc(num_elem * sizeof(cl_float4));
for (int i = 0; i < num_elem; i++)
src_1_host_buffer[i] = (cl_float4){{2.0, 2.0, 2.0, 2.0}};
/* Create and init device side src buffer 1 */
cl_mem src_1_device_buffer;
src_1_device_buffer = clCreateBuffer(context, CL_MEM_READ_ONLY, num_elem * sizeof(cl_float4), NULL, &ret);
if (ret != CL_SUCCESS)
{
printf("error: could not create source buffer\n");
exit(1);
}
ret = clEnqueueWriteBuffer(command_queue, src_1_device_buffer, CL_TRUE, 0, num_elem * sizeof(cl_float4), src_1_host_buffer, 0, NULL, NULL);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clEnqueueWriteBuffer' failed\n");
exit(1);
}
/* Create host dst buffer */
cl_int4 *dst_host_buffer;
dst_host_buffer = malloc(num_elem * sizeof(cl_int4));
memset((void *)dst_host_buffer, 1, num_elem * sizeof(cl_int4));
/* Create device dst buffer */
cl_mem dst_device_buffer;
dst_device_buffer = clCreateBuffer(context, CL_MEM_WRITE_ONLY, num_elem *sizeof(cl_int4), NULL, &ret);
if (ret != CL_SUCCESS)
{
printf("error: could not create dst buffer\n");
exit(1);
}
/* Set kernel arguments */
ret = CL_SUCCESS;
ret |= clSetKernelArg(kernel, 0, sizeof(cl_mem), &src_0_device_buffer);
ret |= clSetKernelArg(kernel, 1, sizeof(cl_mem), &src_1_device_buffer);
ret |= clSetKernelArg(kernel, 2, sizeof(cl_mem), &dst_device_buffer);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clSetKernelArg' failed\n");
exit(1);
}
/* Launch the kernel */
size_t global_work_size = num_elem;
size_t local_work_size = num_elem;
ret = clEnqueueNDRangeKernel(command_queue, kernel, 1, NULL, &global_work_size, &local_work_size, 0, NULL, NULL);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clEnqueueNDRangeKernel' failed\n");
exit(1);
}
/* Wait for it to finish */
clFinish(command_queue);
/* Read results from GPU */
ret = clEnqueueReadBuffer(command_queue, dst_device_buffer, CL_TRUE,0, num_elem * sizeof(cl_int4), dst_host_buffer, 0, NULL, NULL);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clEnqueueReadBuffer' failed\n");
exit(1);
}
/* Dump dst buffer to file */
char dump_file[100];
sprintf((char *)&dump_file, "%s.result", argv[0]);
write_buffer(dump_file, (const char *)dst_host_buffer, num_elem * sizeof(cl_int4));
printf("Result dumped to %s\n", dump_file);
/* Free host dst buffer */
free(dst_host_buffer);
/* Free device dst buffer */
ret = clReleaseMemObject(dst_device_buffer);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clReleaseMemObject' failed\n");
exit(1);
}
/* Free host side src buffer 0 */
free(src_0_host_buffer);
/* Free device side src buffer 0 */
ret = clReleaseMemObject(src_0_device_buffer);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clReleaseMemObject' failed\n");
exit(1);
}
/* Free host side src buffer 1 */
free(src_1_host_buffer);
/* Free device side src buffer 1 */
ret = clReleaseMemObject(src_1_device_buffer);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clReleaseMemObject' failed\n");
exit(1);
}
/* Release kernel */
ret = clReleaseKernel(kernel);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clReleaseKernel' failed\n");
exit(1);
}
/* Release program */
ret = clReleaseProgram(program);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clReleaseProgram' failed\n");
exit(1);
}
/* Release command queue */
ret = clReleaseCommandQueue(command_queue);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clReleaseCommandQueue' failed\n");
exit(1);
}
/* Release context */
ret = clReleaseContext(context);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clReleaseContext' failed\n");
exit(1);
}
return 0;
} |
the_stack_data/86074081.c | #include <stdlib.h>
#include <stdio.h>
typedef struct node {
int value;
struct node *next;
struct node *prev;
} node;
node *head=NULL;
node *tail=NULL;
int isEmpty()
{
if ((head==NULL)&&(tail==NULL))
return 1;
else
return 0;
}
node *find_node_num(int k)
{
node *tmp = head;
for (int i=1;i<k;i++)
{
tmp=tmp->next;
if (tmp==NULL)
break;
}
return tmp;
}
node *find_node_val(int k)
{
node *tmp = head;
while (tmp != NULL && tmp->value != k)
{
tmp=tmp->next;
}
return tmp;
}
void init (int value)
{
node *tmp = malloc(sizeof(node));
tmp->value = value;
tmp->next = NULL;
tmp->prev = NULL;
head = tmp;
tail = tmp;
}
void add (int val)
{
if (isEmpty()==1)
init (val);
else
{
node *tmp = malloc(sizeof(node));
tmp->value=val;
tmp->prev=tail;
tmp->next=NULL;
tail=tmp;
tmp->prev->next=tmp;
}
}
void add_end(int num, int data)
{
node *tmp = find_node_num(num);
if (tmp==NULL||tmp==tail)
{
node *temp = malloc(sizeof(node));
temp->value=data;
temp->next=NULL;
temp->prev=tail;
temp->prev->next=temp;
tail=temp;
}
else
{
node *temp = malloc(sizeof(node));
temp->value=data;
temp->next=tmp->next;
temp->prev=tmp;
tmp->next->prev=temp;
tmp->next=temp;
}
}
void add_pend(int num, int data)
{
node *tmp = find_node_num(num);
if (tmp==NULL||tmp==head)
{
node *temp = malloc(sizeof(node));
temp->value=data;
temp->prev=NULL;
temp->next=head;
head=temp;
temp->next->prev=temp;
}
else
{
node *temp = malloc(sizeof(node));
temp->value=data;
temp->prev=tmp->prev;
temp->next=tmp;
tmp->prev=temp;
temp->prev->next=temp;
}
}
void get_out()
{
node *tmp=head;
printf("%i",tmp->value);
while (tmp->next!=NULL)
{
tmp=tmp->next;
printf(" ");
printf("%i",tmp->value);
}
printf("\n");
}
void destroy()
{
if (isEmpty()==0)
{
node *tmp=head;
node *temp=NULL;
do{
temp=tmp->next;
free(tmp);
tmp=temp;
}while (tmp!=NULL);
head=NULL;
tail=NULL;
}
}
void remove_node(node *tmp)
{
int no_op=0;
if (tmp==NULL)
no_op = 1;
if (tmp==head && tmp==tail && no_op==0)
{
destroy();
no_op=1;
}
if (tmp==head && no_op==0)
{
head=tmp->next;
tmp->next->prev=NULL;
free(tmp);
no_op=1;
}
if(tmp==tail && no_op==0)
{
tail=tmp->prev;
tmp->prev->next=NULL;
free(tmp);
no_op=1;
}
if (tmp!=head && tmp!=head && no_op==0)
{
tmp->next->prev=tmp->prev;
tmp->prev->next=tmp->next;
free(tmp);
no_op=1;
}
}
int main()
{
int n=0;
int val=0;
int k=0;
scanf("%i",&n);
for (int i=0;i<n;i++)
{
scanf ("%i", &val);
add(val);
}
if (isEmpty()==0)
get_out();
scanf("%i",&k);
remove_node(find_node_num(k));
if (isEmpty()==0)
get_out();
scanf("%i",&k);
remove_node(find_node_val(k));
if (isEmpty()==0)
get_out();
scanf ("%i",&k);
scanf ("%i", &val);
add_end(k,val);
if (isEmpty()==0)
get_out();
scanf ("%i",&k);
scanf ("%i", &val);
add_pend(k,val);
if (isEmpty()==0)
get_out();
destroy();
return 0;
}
|
the_stack_data/237643907.c | /*
** EPITECH PROJECT, 2020
** my_showstr.c
** File description:
** [email protected]
*/
#include <stdlib.h>
#include <unistd.h>
void my_putchar(char c);
void putHexa(int n)
{
char const *str = "0123456789abcdef";
size_t left = n / 16;
size_t right = n % 16;
my_putchar('\\');
my_putchar(str[left]);
my_putchar(str[right]);
}
int my_showstr(char const *str)
{
for (size_t i = 0; str[i] != '\0'; i++) {
if ((int)(str[i]) >= ' ')
my_putchar(str[i]);
else
putHexa((int)(str[i]));
}
return 0;
} |
the_stack_data/153268009.c | #include <stdio.h>
#include <unistd.h>
#include <sys/ipc.h>
#include <sys/shm.h>
#include <sys/sem.h>
#define CNT_MAX 10
int main()
{
int semid, shmid;
key_t key;
int flag = 1;
struct sembuf sops;
int *shmaddr;
key = ftok("ping.c", 'a');
if(key<0)
{
perror("ftok");
return 1;
}
shmid = shmget(key, sizeof(int), IPC_CREAT | 0666);
if(shmid < 0)
{
perror("shmget");
return 2;
}
semid = semget(key, 1, IPC_CREAT | 0666);
if(semid < 0)
{
perror("semget");
return 3;
}
semctl(semid, 0, SETVAL, 0);
shmaddr = shmat(shmid, NULL, 0);
if(shmaddr == (void*)-1)
{
perror("shmat");
return 4;
}
sops.sem_num = 0;
sops.sem_flg = SEM_UNDO;
shmaddr[0] = 0;
sops.sem_op = 2;
semop(semid, &sops, 1);
do
{
sops.sem_op = 0;
semop(semid, &sops, 1);
if(shmaddr[0] < CNT_MAX)
printf("process 1: %d\n", shmaddr[0]++);
else
{
shmaddr[0] = -1;
flag = 0;
}
sops.sem_op = 2;
semop(semid, &sops, 1);
}while(flag);
shmdt(shmaddr);
shmctl(shmid, IPC_RMID, NULL);
semctl(semid, 0, IPC_RMID, NULL);
return 0;
}
|
the_stack_data/175143900.c | #include <stdio.h>
int main(void){
int a, ans = 0;
for(int i=0;i<5;i++){
scanf("%d", &a);
ans += a*a;
}
printf("%d", ans%10);
return 0;
}
|
the_stack_data/26201.c | // RUN: %libomptarget-compile-generic -fopenmp-version=51
// RUN: %libomptarget-run-generic 2>&1 \
// RUN: | %fcheck-generic
#include <stdio.h>
int main() {
int i;
#pragma omp target enter data map(alloc:i)
// i isn't present at the end of the target data region, but the "present"
// modifier is only checked at the beginning of a region.
#pragma omp target data map(present, alloc: i)
{
#pragma omp target exit data map(delete:i)
}
// CHECK-NOT: Libomptarget
// CHECK: success
// CHECK-NOT: Libomptarget
fprintf(stderr, "success\n");
return 0;
}
|
the_stack_data/1197661.c | #include <stdio.h>
int main()
{
char c;
printf("输入一个字符: ");
// 读取用户输入
scanf("%c", &c);
// %d 显示整数
// %c 显示对应字符
printf("%c 的 ASCII 为 %d", c, c);
return 0;
}
|
the_stack_data/212642660.c | #include <stdio.h>
#include <string.h>
int get_int() {
int ch, i;
while (((ch = getchar()) == ' ') || (ch == '\n'));
for (i = 0; ch >= '0' && ch <= '9'; ch = getchar() )
i = 10 * i + (ch - '0');
return i;
}
int main() {
int n, freq[60][60], dp[60][60];
register int i, j, p, k, mini, m, c = 1;
char out[100000], str[100];
*out = 0;
while (1) {
n = get_int(); if (!n) break;
for (i = 0; i < n; i++) freq[i][i] = get_int();
for (i = 0; i < n; i++) for (j = i+1; j < n; j++)
freq[i][j] = freq[i][j-1] + freq[j][j];
for (k = 1; k < n; k++) for (i = 0, j = k; j < n; i++, j++) {
mini = dp[i+1][j] + freq[i+1][j];
for (p = i+1; p < j; p++) {
m = dp[i][p-1] + freq[i][p-1] + dp[p+1][j] + freq[p+1][j];
if (m < mini) mini = m;
}
m = dp[i][j-1] + freq[i][j-1]; if (m < mini) mini = m;
dp[i][j] = mini;
}
sprintf(str, "Teste %d\n%d\n\n", c++, dp[0][n-1]); strcat(out, str);
}
printf(out);
return 0;
}
|
the_stack_data/167330990.c | /*
* gen_crc32_table.c - a program for CRC-32 table generation
*
* Copyright 2016 Eric Biggers
*
* 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 <stdint.h>
#include <stdio.h>
static uint32_t crc32_table[0x800];
static uint32_t
crc32_update_bit(uint32_t remainder, uint8_t next_bit)
{
return (remainder >> 1) ^
(((remainder ^ next_bit) & 1) ? 0xEDB88320 : 0);
}
static uint32_t
crc32_update_byte(uint32_t remainder, uint8_t next_byte)
{
for (int j = 0; j < 8; j++, next_byte >>= 1)
remainder = crc32_update_bit(remainder, next_byte & 1);
return remainder;
}
static void
print_256_entries(const uint32_t *entries)
{
for (size_t i = 0; i < 256 / 4; i++) {
printf("\t");
for (size_t j = 0; j < 4; j++) {
printf("0x%08x,", entries[i * 4 + j]);
if (j != 3)
printf(" ");
}
printf("\n");
}
}
int
main(void)
{
/* crc32_table[i] for 0 <= i < 0x100 is the CRC-32 of byte i. */
for (int i = 0; i < 0x100; i++)
crc32_table[i] = crc32_update_byte(0, i);
/* crc32_table[i] for 0x100 <= i < 0x800 is the CRC-32 of byte i % 0x100
* followed by i / 0x100 zero bytes. */
for (int i = 0x100; i < 0x800; i++)
crc32_table[i] = crc32_update_byte(crc32_table[i - 0x100], 0);
printf("/*\n");
printf(" * crc32_table.h - data table to accelerate CRC-32 computation\n");
printf(" *\n");
printf(" * THIS FILE WAS AUTOMATICALLY GENERATED "
"BY gen_crc32_table.c. DO NOT EDIT.\n");
printf(" */\n");
printf("\n");
printf("#include <stdint.h>\n");
printf("\n");
printf("static const uint32_t crc32_table[] = {\n");
print_256_entries(&crc32_table[0x000]);
printf("#if defined(CRC32_SLICE4) || defined(CRC32_SLICE8)\n");
print_256_entries(&crc32_table[0x100]);
print_256_entries(&crc32_table[0x200]);
print_256_entries(&crc32_table[0x300]);
printf("#endif /* CRC32_SLICE4 || CRC32_SLICE8 */\n");
printf("#if defined(CRC32_SLICE8)\n");
print_256_entries(&crc32_table[0x400]);
print_256_entries(&crc32_table[0x500]);
print_256_entries(&crc32_table[0x600]);
print_256_entries(&crc32_table[0x700]);
printf("#endif /* CRC32_SLICE8 */\n");
printf("};\n");
return 0;
}
|
the_stack_data/576058.c | /* PR target/52086 */
/* { dg-do compile } */
/* { dg-options "-O2" } */
/* { dg-additional-options "-fpic" { target fpic } } */
struct S { char a; char b[100]; };
int bar (void);
int baz (int);
void
foo (struct S *x)
{
if (bar () & 1)
{
char c = bar ();
baz (4);
x->a += c;
while (x->a)
x->b[c] = bar ();
}
}
|
the_stack_data/150142667.c | const char *a = "hello \
world";
const char *b = "hello "
"world";
|
the_stack_data/130574.c | #include <string.h>
/* FUNCTION
* <<strlen>>
*
* SYNOPSIS
* #include <string.h>
* size_t strlen(const char *s);
*
* DESCRIPTION
* The strlen() function shall compute the number of bytes in the string to which s points, not including the
* terminating NUL character.
*
* RETURNS
*
* The strlen() function shall return the length of s; no return value shall be reserved to indicate an error.
*
*/
size_t strlen(const char *str) {
size_t len = 0;
while (str[len])
len++;
return len;
}
|
the_stack_data/117232.c | // RUN: %clang_cc1 -triple x86_64-unknown-linux -fsanitize=cfi-icall -fsanitize-trap=cfi-icall -emit-llvm -o - %s | FileCheck --check-prefix=CHECK --check-prefix=UNGENERALIZED %s
// RUN: %clang_cc1 -triple x86_64-unknown-linux -fsanitize=cfi-icall -fsanitize-trap=cfi-icall -fsanitize-cfi-icall-generalize-pointers -emit-llvm -o - %s | FileCheck --check-prefix=CHECK --check-prefix=GENERALIZED %s
// Test that const char* is generalized to const void* and that const char** is
// generalized to void*
// CHECK: define i32** @f({{.*}} !type [[TYPE:![0-9]+]] !type [[TYPE_GENERALIZED:![0-9]+]]
int** f(const char *a, const char **b) {
return (int**)0;
}
void g(int** (*fp)(const char *, const char **)) {
// UNGENERALIZED: call i1 @llvm.type.test(i8* {{.*}}, metadata !"_ZTSFPPiPKcPS2_E")
// GENERALIZED: call i1 @llvm.type.test(i8* {{.*}}, metadata !"_ZTSFPvPKvS_E.generalized")
fp(0, 0);
}
// CHECK: [[TYPE]] = !{i64 0, !"_ZTSFPPiPKcPS2_E"}
// CHECK: [[TYPE_GENERALIZED]] = !{i64 0, !"_ZTSFPvPKvS_E.generalized"}
|
the_stack_data/97887.c | // RUN: %clang_cc1 -O2 -emit-llvm %s -o - | not grep alloca
// RUN: %clang_cc1 -triple i686-pc-linux-gnu -O2 -emit-llvm %s -o - | not grep store
enum {
PP_C,
PP_D,
PP_R,
PP_2D,
PP_1D,
PP_SR,
PP_S2D,
PP_S1D,
PP_SC
};
enum {
G_VP,
G_FP,
G_VS,
G_GS,
G_FS
};
enum {
G_NONE,
G_B,
G_R
};
typedef union _Key {
struct {
unsigned int count : 2;
unsigned int Aconst : 1;
unsigned int Bconst : 1;
unsigned int Cconst : 1;
unsigned int Xused : 1;
unsigned int Yused : 1;
unsigned int Zused : 1;
unsigned int Wused : 1;
unsigned int ttype : 3;
unsigned int scalar : 1;
unsigned int AType : 4;
unsigned int BType : 4;
unsigned int CType : 4;
unsigned int RType : 4;
unsigned int Size : 2;
unsigned int prec : 1;
unsigned int ASize : 2;
unsigned int BSize : 2;
unsigned int CSize : 2;
unsigned int tTex : 4;
unsigned int proj : 1;
unsigned int lod : 2;
unsigned int dvts : 1;
unsigned int uipad : 18;
} key_io;
struct {
unsigned int key0;
unsigned int key1;
} key;
unsigned long long lkey;
} Key;
static void foo(const Key iospec, int* ret)
{
*ret=0;
if(((iospec.key_io.lod == G_B) &&
(iospec.key_io.ttype != G_VS) &&
(iospec.key_io.ttype != G_GS) &&
(iospec.key_io.ttype != G_FS)) ||
(((iospec.key_io.tTex == PP_C) ||
(iospec.key_io.tTex == PP_SC)) &&
((iospec.key_io.tTex == PP_SR) ||
(iospec.key_io.tTex == PP_S2D) ||
(iospec.key_io.tTex == PP_S1D) ||
(iospec.key_io.tTex == PP_SC))))
*ret=1;
}
extern int bar(unsigned long long key_token2)
{
int ret;
__attribute__ ((unused)) Key iospec = (Key) key_token2;
foo(iospec, &ret);
return ret;
}
|
the_stack_data/9808.c | extern void __VERIFIER_error() __attribute__ ((__noreturn__));
extern void __VERIFIER_assume(int);
void __VERIFIER_assert(int cond) { if(!(cond)) { ERROR: __VERIFIER_error(); } }
extern int __VERIFIER_nondet_int(void);
int SIZE;
int main()
{
SIZE = __VERIFIER_nondet_int();
if(SIZE <= 0) return 1;
int i;
int a[SIZE];
long long sum;
sum=0;
for(i = 0; i < SIZE; i++)
{
a[i] = __VERIFIER_nondet_int();
}
for(i = 0; i < SIZE; i++)
{
sum = sum + a[i];
}
for(i = 0; i < SIZE; i++)
{
sum = sum + a[i];
}
for(i = 0; i < SIZE; i++)
{
sum = sum + a[i];
}
for(i = 0; i < SIZE; i++)
{
sum = sum - a[i];
}
for(i = 0; i < SIZE; i++)
{
sum = sum - a[i];
}
for(i = 0; i < SIZE; i++)
{
sum = sum - a[i];
}
__VERIFIER_assert(sum == 0);
return 1;
}
|
the_stack_data/7949438.c | //===-- nesf2vfp_test.c - Test __nesf2vfp ---------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This file tests __nesf2vfp for the compiler_rt library.
//
//===----------------------------------------------------------------------===//
#include <stdlib.h>
#include <stdint.h>
#include <stdio.h>
#include <math.h>
extern int __nesf2vfp(float a, float b);
#if __arm__
int test__nesf2vfp(float a, float b)
{
int actual = __nesf2vfp(a, b);
int expected = (a != b) ? 1 : 0;
if (actual != expected)
printf("error in __nesf2vfp(%f, %f) = %d, expected %d\n",
a, b, actual, expected);
return actual != expected;
}
#endif
int main()
{
#if __arm__
if (test__nesf2vfp(0.0, 0.0))
return 1;
if (test__nesf2vfp(1.0, 1.0))
return 1;
if (test__nesf2vfp(-1.0, -1.0))
return 1;
if (test__nesf2vfp(HUGE_VALF, 1.0))
return 1;
if (test__nesf2vfp(1.0, HUGE_VALF))
return 1;
#endif
return 0;
}
|
the_stack_data/23575747.c | /**
******************************************************************************
* @file stm32f7xx_ll_usart.c
* @author MCD Application Team
* @brief USART LL module driver.
******************************************************************************
* @attention
*
* <h2><center>© Copyright (c) 2017 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(USE_FULL_LL_DRIVER)
/* Includes ------------------------------------------------------------------*/
#include "stm32f7xx_ll_usart.h"
#include "stm32f7xx_ll_rcc.h"
#include "stm32f7xx_ll_bus.h"
#ifdef USE_FULL_ASSERT
#include "stm32_assert.h"
#else
#define assert_param(expr) ((void)0U)
#endif /* USE_FULL_ASSERT */
/** @addtogroup STM32F7xx_LL_Driver
* @{
*/
#if defined (USART1) || defined (USART2) || defined (USART3) || defined (USART6) || defined (UART4) || defined (UART5) || defined (UART7) || defined (UART8)
/** @addtogroup USART_LL
* @{
*/
/* Private types -------------------------------------------------------------*/
/* Private variables ---------------------------------------------------------*/
/* Private constants ---------------------------------------------------------*/
/* Private macros ------------------------------------------------------------*/
/** @addtogroup USART_LL_Private_Macros
* @{
*/
/* __BAUDRATE__ The maximum Baud Rate is derived from the maximum clock available
* divided by the smallest oversampling used on the USART (i.e. 8) */
#define IS_LL_USART_BAUDRATE(__BAUDRATE__) ((__BAUDRATE__) <= 27000000U)
/* __VALUE__ In case of oversampling by 16 and 8, BRR content must be greater than or equal to 16d. */
#define IS_LL_USART_BRR_MIN(__VALUE__) ((__VALUE__) >= 16U)
#define IS_LL_USART_DIRECTION(__VALUE__) (((__VALUE__) == LL_USART_DIRECTION_NONE) \
|| ((__VALUE__) == LL_USART_DIRECTION_RX) \
|| ((__VALUE__) == LL_USART_DIRECTION_TX) \
|| ((__VALUE__) == LL_USART_DIRECTION_TX_RX))
#define IS_LL_USART_PARITY(__VALUE__) (((__VALUE__) == LL_USART_PARITY_NONE) \
|| ((__VALUE__) == LL_USART_PARITY_EVEN) \
|| ((__VALUE__) == LL_USART_PARITY_ODD))
#define IS_LL_USART_DATAWIDTH(__VALUE__) (((__VALUE__) == LL_USART_DATAWIDTH_7B) \
|| ((__VALUE__) == LL_USART_DATAWIDTH_8B) \
|| ((__VALUE__) == LL_USART_DATAWIDTH_9B))
#define IS_LL_USART_OVERSAMPLING(__VALUE__) (((__VALUE__) == LL_USART_OVERSAMPLING_16) \
|| ((__VALUE__) == LL_USART_OVERSAMPLING_8))
#define IS_LL_USART_LASTBITCLKOUTPUT(__VALUE__) (((__VALUE__) == LL_USART_LASTCLKPULSE_NO_OUTPUT) \
|| ((__VALUE__) == LL_USART_LASTCLKPULSE_OUTPUT))
#define IS_LL_USART_CLOCKPHASE(__VALUE__) (((__VALUE__) == LL_USART_PHASE_1EDGE) \
|| ((__VALUE__) == LL_USART_PHASE_2EDGE))
#define IS_LL_USART_CLOCKPOLARITY(__VALUE__) (((__VALUE__) == LL_USART_POLARITY_LOW) \
|| ((__VALUE__) == LL_USART_POLARITY_HIGH))
#define IS_LL_USART_CLOCKOUTPUT(__VALUE__) (((__VALUE__) == LL_USART_CLOCK_DISABLE) \
|| ((__VALUE__) == LL_USART_CLOCK_ENABLE))
#define IS_LL_USART_STOPBITS(__VALUE__) (((__VALUE__) == LL_USART_STOPBITS_0_5) \
|| ((__VALUE__) == LL_USART_STOPBITS_1) \
|| ((__VALUE__) == LL_USART_STOPBITS_1_5) \
|| ((__VALUE__) == LL_USART_STOPBITS_2))
#define IS_LL_USART_HWCONTROL(__VALUE__) (((__VALUE__) == LL_USART_HWCONTROL_NONE) \
|| ((__VALUE__) == LL_USART_HWCONTROL_RTS) \
|| ((__VALUE__) == LL_USART_HWCONTROL_CTS) \
|| ((__VALUE__) == LL_USART_HWCONTROL_RTS_CTS))
/**
* @}
*/
/* Private function prototypes -----------------------------------------------*/
/* Exported functions --------------------------------------------------------*/
/** @addtogroup USART_LL_Exported_Functions
* @{
*/
/** @addtogroup USART_LL_EF_Init
* @{
*/
/**
* @brief De-initialize USART registers (Registers restored to their default values).
* @param USARTx USART Instance
* @retval An ErrorStatus enumeration value:
* - SUCCESS: USART registers are de-initialized
* - ERROR: USART registers are not de-initialized
*/
ErrorStatus LL_USART_DeInit(USART_TypeDef *USARTx)
{
ErrorStatus status = SUCCESS;
/* Check the parameters */
assert_param(IS_UART_INSTANCE(USARTx));
if (USARTx == USART1)
{
/* Force reset of USART clock */
LL_APB2_GRP1_ForceReset(LL_APB2_GRP1_PERIPH_USART1);
/* Release reset of USART clock */
LL_APB2_GRP1_ReleaseReset(LL_APB2_GRP1_PERIPH_USART1);
}
else if (USARTx == USART2)
{
/* Force reset of USART clock */
LL_APB1_GRP1_ForceReset(LL_APB1_GRP1_PERIPH_USART2);
/* Release reset of USART clock */
LL_APB1_GRP1_ReleaseReset(LL_APB1_GRP1_PERIPH_USART2);
}
else if (USARTx == USART3)
{
/* Force reset of USART clock */
LL_APB1_GRP1_ForceReset(LL_APB1_GRP1_PERIPH_USART3);
/* Release reset of USART clock */
LL_APB1_GRP1_ReleaseReset(LL_APB1_GRP1_PERIPH_USART3);
}
else if (USARTx == UART4)
{
/* Force reset of UART clock */
LL_APB1_GRP1_ForceReset(LL_APB1_GRP1_PERIPH_UART4);
/* Release reset of UART clock */
LL_APB1_GRP1_ReleaseReset(LL_APB1_GRP1_PERIPH_UART4);
}
else if (USARTx == UART5)
{
/* Force reset of UART clock */
LL_APB1_GRP1_ForceReset(LL_APB1_GRP1_PERIPH_UART5);
/* Release reset of UART clock */
LL_APB1_GRP1_ReleaseReset(LL_APB1_GRP1_PERIPH_UART5);
}
else if (USARTx == USART6)
{
/* Force reset of USART clock */
LL_APB2_GRP1_ForceReset(LL_APB2_GRP1_PERIPH_USART6);
/* Release reset of USART clock */
LL_APB2_GRP1_ReleaseReset(LL_APB2_GRP1_PERIPH_USART6);
}
else if (USARTx == UART7)
{
/* Force reset of UART clock */
LL_APB1_GRP1_ForceReset(LL_APB1_GRP1_PERIPH_UART7);
/* Release reset of UART clock */
LL_APB1_GRP1_ReleaseReset(LL_APB1_GRP1_PERIPH_UART7);
}
else if (USARTx == UART8)
{
/* Force reset of UART clock */
LL_APB1_GRP1_ForceReset(LL_APB1_GRP1_PERIPH_UART8);
/* Release reset of UART clock */
LL_APB1_GRP1_ReleaseReset(LL_APB1_GRP1_PERIPH_UART8);
}
else
{
status = ERROR;
}
return (status);
}
/**
* @brief Initialize USART registers according to the specified
* parameters in USART_InitStruct.
* @note As some bits in USART configuration registers can only be written when
* the USART is disabled (USART_CR1_UE bit =0), USART Peripheral should be in disabled state prior calling
* this function. Otherwise, ERROR result will be returned.
* @note Baud rate value stored in USART_InitStruct BaudRate field, should be valid (different from 0).
* @param USARTx USART Instance
* @param USART_InitStruct pointer to a LL_USART_InitTypeDef structure
* that contains the configuration information for the specified USART peripheral.
* @retval An ErrorStatus enumeration value:
* - SUCCESS: USART registers are initialized according to USART_InitStruct content
* - ERROR: Problem occurred during USART Registers initialization
*/
ErrorStatus LL_USART_Init(USART_TypeDef *USARTx, LL_USART_InitTypeDef *USART_InitStruct)
{
ErrorStatus status = ERROR;
uint32_t periphclk = LL_RCC_PERIPH_FREQUENCY_NO;
/* Check the parameters */
assert_param(IS_UART_INSTANCE(USARTx));
assert_param(IS_LL_USART_BAUDRATE(USART_InitStruct->BaudRate));
assert_param(IS_LL_USART_DATAWIDTH(USART_InitStruct->DataWidth));
assert_param(IS_LL_USART_STOPBITS(USART_InitStruct->StopBits));
assert_param(IS_LL_USART_PARITY(USART_InitStruct->Parity));
assert_param(IS_LL_USART_DIRECTION(USART_InitStruct->TransferDirection));
assert_param(IS_LL_USART_HWCONTROL(USART_InitStruct->HardwareFlowControl));
assert_param(IS_LL_USART_OVERSAMPLING(USART_InitStruct->OverSampling));
/* USART needs to be in disabled state, in order to be able to configure some bits in
CRx registers */
if (LL_USART_IsEnabled(USARTx) == 0U)
{
/*---------------------------- USART CR1 Configuration ---------------------
* Configure USARTx CR1 (USART Word Length, Parity, Mode and Oversampling bits) with parameters:
* - DataWidth: USART_CR1_M bits according to USART_InitStruct->DataWidth value
* - Parity: USART_CR1_PCE, USART_CR1_PS bits according to USART_InitStruct->Parity value
* - TransferDirection: USART_CR1_TE, USART_CR1_RE bits according to USART_InitStruct->TransferDirection value
* - Oversampling: USART_CR1_OVER8 bit according to USART_InitStruct->OverSampling value.
*/
MODIFY_REG(USARTx->CR1,
(USART_CR1_M | USART_CR1_PCE | USART_CR1_PS |
USART_CR1_TE | USART_CR1_RE | USART_CR1_OVER8),
(USART_InitStruct->DataWidth | USART_InitStruct->Parity |
USART_InitStruct->TransferDirection | USART_InitStruct->OverSampling));
/*---------------------------- USART CR2 Configuration ---------------------
* Configure USARTx CR2 (Stop bits) with parameters:
* - Stop Bits: USART_CR2_STOP bits according to USART_InitStruct->StopBits value.
* - CLKEN, CPOL, CPHA and LBCL bits are to be configured using LL_USART_ClockInit().
*/
LL_USART_SetStopBitsLength(USARTx, USART_InitStruct->StopBits);
/*---------------------------- USART CR3 Configuration ---------------------
* Configure USARTx CR3 (Hardware Flow Control) with parameters:
* - HardwareFlowControl: USART_CR3_RTSE, USART_CR3_CTSE bits according to
* USART_InitStruct->HardwareFlowControl value.
*/
LL_USART_SetHWFlowCtrl(USARTx, USART_InitStruct->HardwareFlowControl);
/*---------------------------- USART BRR Configuration ---------------------
* Retrieve Clock frequency used for USART Peripheral
*/
if (USARTx == USART1)
{
periphclk = LL_RCC_GetUSARTClockFreq(LL_RCC_USART1_CLKSOURCE);
}
else if (USARTx == USART2)
{
periphclk = LL_RCC_GetUSARTClockFreq(LL_RCC_USART2_CLKSOURCE);
}
else if (USARTx == USART3)
{
periphclk = LL_RCC_GetUSARTClockFreq(LL_RCC_USART3_CLKSOURCE);
}
else if (USARTx == UART4)
{
periphclk = LL_RCC_GetUARTClockFreq(LL_RCC_UART4_CLKSOURCE);
}
else if (USARTx == UART5)
{
periphclk = LL_RCC_GetUARTClockFreq(LL_RCC_UART5_CLKSOURCE);
}
else if (USARTx == USART6)
{
periphclk = LL_RCC_GetUSARTClockFreq(LL_RCC_USART6_CLKSOURCE);
}
else if (USARTx == UART7)
{
periphclk = LL_RCC_GetUARTClockFreq(LL_RCC_UART7_CLKSOURCE);
}
else if (USARTx == UART8)
{
periphclk = LL_RCC_GetUARTClockFreq(LL_RCC_UART8_CLKSOURCE);
}
else
{
/* Nothing to do, as error code is already assigned to ERROR value */
}
/* Configure the USART Baud Rate :
- valid baud rate value (different from 0) is required
- Peripheral clock as returned by RCC service, should be valid (different from 0).
*/
if ((periphclk != LL_RCC_PERIPH_FREQUENCY_NO)
&& (USART_InitStruct->BaudRate != 0U))
{
status = SUCCESS;
LL_USART_SetBaudRate(USARTx,
periphclk,
USART_InitStruct->OverSampling,
USART_InitStruct->BaudRate);
/* Check BRR is greater than or equal to 16d */
assert_param(IS_LL_USART_BRR_MIN(USARTx->BRR));
}
}
/* Endif (=> USART not in Disabled state => return ERROR) */
return (status);
}
/**
* @brief Set each @ref LL_USART_InitTypeDef field to default value.
* @param USART_InitStruct pointer to a @ref LL_USART_InitTypeDef structure
* whose fields will be set to default values.
* @retval None
*/
void LL_USART_StructInit(LL_USART_InitTypeDef *USART_InitStruct)
{
/* Set USART_InitStruct fields to default values */
USART_InitStruct->BaudRate = 9600U;
USART_InitStruct->DataWidth = LL_USART_DATAWIDTH_8B;
USART_InitStruct->StopBits = LL_USART_STOPBITS_1;
USART_InitStruct->Parity = LL_USART_PARITY_NONE ;
USART_InitStruct->TransferDirection = LL_USART_DIRECTION_TX_RX;
USART_InitStruct->HardwareFlowControl = LL_USART_HWCONTROL_NONE;
USART_InitStruct->OverSampling = LL_USART_OVERSAMPLING_16;
}
/**
* @brief Initialize USART Clock related settings according to the
* specified parameters in the USART_ClockInitStruct.
* @note As some bits in USART configuration registers can only be written when
* the USART is disabled (USART_CR1_UE bit =0), USART Peripheral should be in disabled state prior calling
* this function. Otherwise, ERROR result will be returned.
* @param USARTx USART Instance
* @param USART_ClockInitStruct pointer to a @ref LL_USART_ClockInitTypeDef structure
* that contains the Clock configuration information for the specified USART peripheral.
* @retval An ErrorStatus enumeration value:
* - SUCCESS: USART registers related to Clock settings are initialized according
* to USART_ClockInitStruct content
* - ERROR: Problem occurred during USART Registers initialization
*/
ErrorStatus LL_USART_ClockInit(USART_TypeDef *USARTx, LL_USART_ClockInitTypeDef *USART_ClockInitStruct)
{
ErrorStatus status = SUCCESS;
/* Check USART Instance and Clock signal output parameters */
assert_param(IS_UART_INSTANCE(USARTx));
assert_param(IS_LL_USART_CLOCKOUTPUT(USART_ClockInitStruct->ClockOutput));
/* USART needs to be in disabled state, in order to be able to configure some bits in
CRx registers */
if (LL_USART_IsEnabled(USARTx) == 0U)
{
/* If USART Clock signal is disabled */
if (USART_ClockInitStruct->ClockOutput == LL_USART_CLOCK_DISABLE)
{
/* Deactivate Clock signal delivery :
* - Disable Clock Output: USART_CR2_CLKEN cleared
*/
LL_USART_DisableSCLKOutput(USARTx);
}
else
{
/* Ensure USART instance is USART capable */
assert_param(IS_USART_INSTANCE(USARTx));
/* Check clock related parameters */
assert_param(IS_LL_USART_CLOCKPOLARITY(USART_ClockInitStruct->ClockPolarity));
assert_param(IS_LL_USART_CLOCKPHASE(USART_ClockInitStruct->ClockPhase));
assert_param(IS_LL_USART_LASTBITCLKOUTPUT(USART_ClockInitStruct->LastBitClockPulse));
/*---------------------------- USART CR2 Configuration -----------------------
* Configure USARTx CR2 (Clock signal related bits) with parameters:
* - Enable Clock Output: USART_CR2_CLKEN set
* - Clock Polarity: USART_CR2_CPOL bit according to USART_ClockInitStruct->ClockPolarity value
* - Clock Phase: USART_CR2_CPHA bit according to USART_ClockInitStruct->ClockPhase value
* - Last Bit Clock Pulse Output: USART_CR2_LBCL bit according to USART_ClockInitStruct->LastBitClockPulse value.
*/
MODIFY_REG(USARTx->CR2,
USART_CR2_CLKEN | USART_CR2_CPHA | USART_CR2_CPOL | USART_CR2_LBCL,
USART_CR2_CLKEN | USART_ClockInitStruct->ClockPolarity |
USART_ClockInitStruct->ClockPhase | USART_ClockInitStruct->LastBitClockPulse);
}
}
/* Else (USART not in Disabled state => return ERROR */
else
{
status = ERROR;
}
return (status);
}
/**
* @brief Set each field of a @ref LL_USART_ClockInitTypeDef type structure to default value.
* @param USART_ClockInitStruct pointer to a @ref LL_USART_ClockInitTypeDef structure
* whose fields will be set to default values.
* @retval None
*/
void LL_USART_ClockStructInit(LL_USART_ClockInitTypeDef *USART_ClockInitStruct)
{
/* Set LL_USART_ClockInitStruct fields with default values */
USART_ClockInitStruct->ClockOutput = LL_USART_CLOCK_DISABLE;
USART_ClockInitStruct->ClockPolarity = LL_USART_POLARITY_LOW; /* Not relevant when ClockOutput =
LL_USART_CLOCK_DISABLE */
USART_ClockInitStruct->ClockPhase = LL_USART_PHASE_1EDGE; /* Not relevant when ClockOutput =
LL_USART_CLOCK_DISABLE */
USART_ClockInitStruct->LastBitClockPulse = LL_USART_LASTCLKPULSE_NO_OUTPUT; /* Not relevant when ClockOutput =
LL_USART_CLOCK_DISABLE */
}
/**
* @}
*/
/**
* @}
*/
/**
* @}
*/
#endif /* USART1 || USART2 || USART3 || USART6 || UART4 || UART5 || UART7 || UART8 */
/**
* @}
*/
#endif /* USE_FULL_LL_DRIVER */
/************************ (C) COPYRIGHT STMicroelectronics *****END OF FILE****/
|
the_stack_data/40763385.c | #include <stdlib.h>
typedef struct
{
int* prefixsum;
} NumArray;
NumArray* numArrayCreate(int* nums, int numsSize)
{
NumArray* arr = (NumArray*)malloc(sizeof(NumArray));
arr->prefixsum = (int*)malloc(sizeof(int) * (numsSize + 1));
for (int i = 0; i < numsSize; ++i)
arr->prefixsum[i + 1] = arr->prefixsum[i] + nums[i];
return arr;
}
int numArraySumRange(NumArray* obj, int i, int j)
{
return obj->prefixsum[j + 1] - obj->prefixsum[i];
}
void numArrayFree(NumArray* obj)
{
if (obj)
{
if (obj->prefixsum)
free(obj->prefixsum);
free(obj);
}
}
/**
* Your NumArray struct will be instantiated and called as such:
* NumArray* obj = numArrayCreate(nums, numsSize);
* int param_1 = numArraySumRange(obj, i, j);
* numArrayFree(obj);
*/
|
the_stack_data/156391905.c | #include<stdio.h>
/**
* main - Entry point
*
* Return: Always 0 (Success)
*/
int main(void)
{
int digit;
for (digit = 48; digit != 58; digit++)
putchar(digit);
for (digit = 97; digit != 103; digit++)
putchar(digit);
putchar('\n');
return (0);
}
|
the_stack_data/960602.c | /* Generated by CIL v. 1.7.0 */
/* print_CIL_Input is false */
struct _IO_FILE;
struct timeval;
extern float strtof(char const *str , char const *endptr ) ;
extern void signal(int sig , void *func ) ;
typedef struct _IO_FILE FILE;
extern int atoi(char const *s ) ;
extern double strtod(char const *str , char const *endptr ) ;
extern int fclose(void *stream ) ;
extern void *fopen(char const *filename , char const *mode ) ;
extern void abort() ;
extern void exit(int status ) ;
extern int raise(int sig ) ;
extern int fprintf(struct _IO_FILE *stream , char const *format , ...) ;
extern int strcmp(char const *a , char const *b ) ;
extern int rand() ;
extern unsigned long strtoul(char const *str , char const *endptr , int base ) ;
void RandomFunc(unsigned long input[1] , unsigned long output[1] ) ;
extern int strncmp(char const *s1 , char const *s2 , unsigned long maxlen ) ;
extern int gettimeofday(struct timeval *tv , void *tz , ...) ;
extern int printf(char const *format , ...) ;
int main(int argc , char *argv[] ) ;
void megaInit(void) ;
extern unsigned long strlen(char const *s ) ;
extern long strtol(char const *str , char const *endptr , int base ) ;
extern unsigned long strnlen(char const *s , unsigned long maxlen ) ;
extern void *memcpy(void *s1 , void const *s2 , unsigned long size ) ;
struct timeval {
long tv_sec ;
long tv_usec ;
};
extern void *malloc(unsigned long size ) ;
extern int scanf(char const *format , ...) ;
void megaInit(void)
{
{
}
}
void RandomFunc(unsigned long input[1] , unsigned long output[1] )
{
unsigned long state[1] ;
unsigned long local2 ;
unsigned long local1 ;
char copy11 ;
{
state[0UL] = input[0UL] + 1373777115UL;
local1 = 0UL;
while (local1 < input[1UL]) {
local2 = 0UL;
while (local2 < input[1UL]) {
copy11 = *((char *)(& state[0UL]) + 1);
*((char *)(& state[0UL]) + 1) = *((char *)(& state[0UL]) + 4);
*((char *)(& state[0UL]) + 4) = copy11;
local2 ++;
}
local1 ++;
}
output[0UL] = (state[0UL] + 45871808UL) - 33819252UL;
}
}
int main(int argc , char *argv[] )
{
unsigned long input[1] ;
unsigned long output[1] ;
int randomFuns_i5 ;
unsigned long randomFuns_value6 ;
int randomFuns_main_i7 ;
{
megaInit();
if (argc != 2) {
printf("Call this program with %i arguments\n", 1);
exit(-1);
} else {
}
randomFuns_i5 = 0;
while (randomFuns_i5 < 1) {
randomFuns_value6 = strtoul(argv[randomFuns_i5 + 1], 0, 10);
input[randomFuns_i5] = randomFuns_value6;
randomFuns_i5 ++;
}
RandomFunc(input, output);
if (output[0] == 4242424242UL) {
printf("You win!\n");
} else {
}
randomFuns_main_i7 = 0;
while (randomFuns_main_i7 < 1) {
printf("%lu\n", output[randomFuns_main_i7]);
randomFuns_main_i7 ++;
}
}
}
|
the_stack_data/161080196.c | // PARAM: --set ana.activated[+] thread --set ana.path_sens[+] threadflag
#include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#ifndef offsetof
#define offsetof(TYPE, MEMBER) ((unsigned long) &((TYPE *)0)->MEMBER)
#endif
#ifndef container_of
#define container_of(ptr, type, member) ({ \
const typeof( ((type *)0)->member ) *__mptr = (ptr); \
(type *)( (char *)__mptr - offsetof(type,member) );})
#endif
extern void abort(void);
#include <assert.h>
void reach_error() { assert(0); } // FAIL
int __VERIFIER_nondet_int(void);
void ldv_assert(int expression) { if (!expression) { ERROR: {reach_error();abort();}}; return; } // NOWARN
pthread_t t1,t2;
struct device {
//struct device_private *p;
};
struct A {
int a;
int b;
};
struct my_data {
pthread_mutex_t lock;
struct device dev;
struct A shared;
};
void *my_callback(void *arg) {
struct device *dev = (struct device*)arg;
struct my_data *data;
data = container_of(dev, struct my_data, dev);
pthread_mutex_lock (&data->lock);
data->shared.a = 1; // NORACE
data->shared.b = data->shared.b + 1; // NORACE
pthread_mutex_unlock (&data->lock);
return 0;
}
int my_drv_probe(struct my_data *data) {
struct device *d = &data->dev;
//init data (single thread)
//not a race
pthread_mutex_init(&data->lock, NULL);
data->shared.a = 0; // NORACE
data->shared.b = 0; // NORACE
ldv_assert(data->shared.a==0); // NORACE
ldv_assert(data->shared.b==0); // NORACE
int res = __VERIFIER_nondet_int();
if(res)
goto exit;
//register callback
pthread_create(&t1, NULL, my_callback, (void *)d);
pthread_create(&t2, NULL, my_callback, (void *)d);
return 0;
exit:
pthread_mutex_destroy(&data->lock);
return -1;
}
void my_drv_disconnect(struct my_data *data) {
void *status;
pthread_join(t1, &status);
pthread_join(t2, &status);
pthread_mutex_destroy(&data->lock);
}
int my_drv_init(void) {
return 0;
}
void my_drv_cleanup(void) {
return;
}
int main(void) {
int ret = my_drv_init();
if(ret==0) {
int probe_ret;
struct my_data data;
probe_ret = my_drv_probe(&data);
if(probe_ret==0) {
my_drv_disconnect(&data);
ldv_assert(data.shared.a==1); // NORACE
ldv_assert(data.shared.b==2); // NORACE
}
my_drv_cleanup();
data.shared.a = -1; // NORACE
data.shared.b = -1; // NORACE
ldv_assert(data.shared.a==-1); // NORACE
ldv_assert(data.shared.b==-1); // NORACE
}
return 0;
}
|
the_stack_data/132827.c | void ignored() {
putchar('n');
}
int main() {
putchar('o');
} |
the_stack_data/75092.c | #include <stdio.h>
int main () {
char egn[10];
int check = 1 ;
int check_sum = 0;
fgets(egn , 12 , stdin);
if ( egn [2] < '0' || egn[2] > '5' ){
check = 0;
}
else if( (egn[2] == '1' && egn[3] > '2' ) || (egn[2] == '3' && egn[3] > '2' ) || (egn[2] == '5' && egn[3] > '2' )){
check = 0;
}
if( egn[4] > '3' || (egn[4] == '3' && egn[5] > '1') || (egn[4] == '0' && egn[5] == '0' ) ){
check = 0;
}
check_sum = check_sum + ((egn[0] - '0') * 2);
check_sum = check_sum + ((egn[1] - '0') * 4);
check_sum = check_sum + ((egn[2] - '0') * 8);
check_sum = check_sum + ((egn[3] - '0') * 5);
check_sum = check_sum + ((egn[4] - '0') * 10);
check_sum = check_sum + ((egn[5] - '0') * 9);
check_sum = check_sum + ((egn[6] - '0') * 7);
check_sum = check_sum + ((egn[7] - '0') * 3);
check_sum = check_sum + ((egn[8] - '0') * 6);
if( check_sum % 11 < 10 ){
if(( egn[9] - '0') != (check_sum % 11) ){
check = 0;
}
}else { if( egn[9] != '0' ) check = 0;}
printf("%d", check);
return 0;
}
|
the_stack_data/218894286.c | #include <stdio.h>
int a = 1;
int main() {
printf("%d\n", a);
return 0;
}
|
the_stack_data/156393456.c | /**
* Compiler implementation of the
* $(LINK2 http://www.dlang.org, D programming language).
*
* Copyright: Copyright (C) 1994-1998 by Symantec
* Copyright (C) 2000-2018 by The D Language Foundation, All Rights Reserved
* Authors: $(LINK2 http://www.digitalmars.com, Walter Bright)
* License: $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)
* Source: $(LINK2 https://github.com/dlang/dmd/blob/master/src/dmd/backend/cod3.c, backend/cod3.c)
* Coverage: https://codecov.io/gh/dlang/dmd/src/master/src/dmd/backend/cod3.c
*/
#if (SCPP && !HTOD) || MARS
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>
#include "cc.h"
#include "el.h"
#include "code.h"
#include "oper.h"
#include "global.h"
#include "type.h"
#include "tinfo.h"
#include "melf.h"
#include "outbuf.h"
#include "xmm.h"
#if SCPP
#include "exh.h"
#endif
#if HYDRATE
#include "parser.h"
#endif
static char __file__[] = __FILE__; /* for tassert.h */
#include "tassert.h"
extern targ_size_t retsize;
STATIC void pinholeopt_unittest();
static void doswitch(CodeBuilder& cdb, block *b);
//#define JMPJMPTABLE TARGET_WINDOS
#define JMPJMPTABLE 0 // benchmarking shows it's slower
#define MINLL 0x8000000000000000LL
#define MAXLL 0x7FFFFFFFFFFFFFFFLL
/*************
* Size in bytes of each instruction.
* 0 means illegal instruction.
* bit M: if there is a modregrm field (EV1 is reserved for modregrm)
* bit T: if there is a second operand (EV2)
* bit E: if second operand is only 8 bits
* bit A: a short version exists for the AX reg
* bit R: a short version exists for regs
* bits 2..0: size of instruction (excluding optional bytes)
*/
enum
{
M = 0x80,
T = 0x40,
E = 0x20,
A = 0x10,
R = 0x08,
W = 0,
};
static unsigned char inssize[256] =
{ M|2,M|2,M|2,M|2, T|E|2,T|3,1,1, /* 00 */
M|2,M|2,M|2,M|2, T|E|2,T|3,1,1, /* 08 */
M|2,M|2,M|2,M|2, T|E|2,T|3,1,1, /* 10 */
M|2,M|2,M|2,M|2, T|E|2,T|3,1,1, /* 18 */
M|2,M|2,M|2,M|2, T|E|2,T|3,1,1, /* 20 */
M|2,M|2,M|2,M|2, T|E|2,T|3,1,1, /* 28 */
M|2,M|2,M|2,M|2, T|E|2,T|3,1,1, /* 30 */
M|2,M|2,M|2,M|2, T|E|2,T|3,1,1, /* 38 */
1,1,1,1, 1,1,1,1, /* 40 */
1,1,1,1, 1,1,1,1, /* 48 */
1,1,1,1, 1,1,1,1, /* 50 */
1,1,1,1, 1,1,1,1, /* 58 */
1,1,M|2,M|2, 1,1,1,1, /* 60 */
T|3,M|T|4,T|E|2,M|T|E|3, 1,1,1,1, /* 68 */
T|E|2,T|E|2,T|E|2,T|E|2, T|E|2,T|E|2,T|E|2,T|E|2, /* 70 */
T|E|2,T|E|2,T|E|2,T|E|2, T|E|2,T|E|2,T|E|2,T|E|2, /* 78 */
M|T|E|A|3,M|T|A|4,M|T|E|3,M|T|E|3, M|2,M|2,M|2,M|A|R|2, /* 80 */
M|A|2,M|A|2,M|A|2,M|A|2, M|2,M|2,M|2,M|R|2, /* 88 */
1,1,1,1, 1,1,1,1, /* 90 */
1,1,T|5,1, 1,1,1,1, /* 98 */
#if 0 /* cod3_set32() patches this */
T|5,T|5,T|5,T|5, 1,1,1,1, /* A0 */
#else
T|3,T|3,T|3,T|3, 1,1,1,1, /* A0 */
#endif
T|E|2,T|3,1,1, 1,1,1,1, /* A8 */
T|E|2,T|E|2,T|E|2,T|E|2, T|E|2,T|E|2,T|E|2,T|E|2, /* B0 */
T|3,T|3,T|3,T|3, T|3,T|3,T|3,T|3, /* B8 */
M|T|E|3,M|T|E|3,T|3,1, M|2,M|2,M|T|E|R|3,M|T|R|4, /* C0 */
T|E|4,1,T|3,1, 1,T|E|2,1,1, /* C8 */
M|2,M|2,M|2,M|2, T|E|2,T|E|2,0,1, /* D0 */
/* For the floating instructions, allow room for the FWAIT */
M|2,M|2,M|2,M|2, M|2,M|2,M|2,M|2, /* D8 */
T|E|2,T|E|2,T|E|2,T|E|2, T|E|2,T|E|2,T|E|2,T|E|2, /* E0 */
T|3,T|3,T|5,T|E|2, 1,1,1,1, /* E8 */
1,0,1,1, 1,1,M|A|2,M|A|2, /* F0 */
1,1,1,1, 1,1,M|2,M|R|2 /* F8 */
};
static const unsigned char inssize32[256] =
{ 2,2,2,2, 2,5,1,1, /* 00 */
2,2,2,2, 2,5,1,1, /* 08 */
2,2,2,2, 2,5,1,1, /* 10 */
2,2,2,2, 2,5,1,1, /* 18 */
2,2,2,2, 2,5,1,1, /* 20 */
2,2,2,2, 2,5,1,1, /* 28 */
2,2,2,2, 2,5,1,1, /* 30 */
2,2,2,2, 2,5,1,1, /* 38 */
1,1,1,1, 1,1,1,1, /* 40 */
1,1,1,1, 1,1,1,1, /* 48 */
1,1,1,1, 1,1,1,1, /* 50 */
1,1,1,1, 1,1,1,1, /* 58 */
1,1,2,2, 1,1,1,1, /* 60 */
5,6,2,3, 1,1,1,1, /* 68 */
2,2,2,2, 2,2,2,2, /* 70 */
2,2,2,2, 2,2,2,2, /* 78 */
3,6,3,3, 2,2,2,2, /* 80 */
2,2,2,2, 2,2,2,2, /* 88 */
1,1,1,1, 1,1,1,1, /* 90 */
1,1,7,1, 1,1,1,1, /* 98 */
5,5,5,5, 1,1,1,1, /* A0 */
2,5,1,1, 1,1,1,1, /* A8 */
2,2,2,2, 2,2,2,2, /* B0 */
5,5,5,5, 5,5,5,5, /* B8 */
3,3,3,1, 2,2,3,6, /* C0 */
4,1,3,1, 1,2,1,1, /* C8 */
2,2,2,2, 2,2,0,1, /* D0 */
/* For the floating instructions, don't need room for the FWAIT */
2,2,2,2, 2,2,2,2, /* D8 */
2,2,2,2, 2,2,2,2, /* E0 */
5,5,7,2, 1,1,1,1, /* E8 */
1,0,1,1, 1,1,2,2, /* F0 */
1,1,1,1, 1,1,2,2 /* F8 */
};
/* For 2 byte opcodes starting with 0x0F */
static unsigned char inssize2[256] =
{ M|3,M|3,M|3,M|3, 2,2,2,2, // 00
2,2,M|3,2, 2,M|3,2,M|T|E|4, // 08
M|3,M|3,M|3,M|3, M|3,M|3,M|3,M|3, // 10
M|3,2,2,2, 2,2,2,2, // 18
M|3,M|3,M|3,M|3, M|3,2,M|3,2, // 20
M|3,M|3,M|3,M|3, M|3,M|3,M|3,M|3, // 28
2,2,2,2, 2,2,2,2, // 30
M|4,2,M|T|E|5,2, 2,2,2,2, // 38
M|3,M|3,M|3,M|3, M|3,M|3,M|3,M|3, // 40
M|3,M|3,M|3,M|3, M|3,M|3,M|3,M|3, // 48
M|3,M|3,M|3,M|3, M|3,M|3,M|3,M|3, // 50
M|3,M|3,M|3,M|3, M|3,M|3,M|3,M|3, // 58
M|3,M|3,M|3,M|3, M|3,M|3,M|3,M|3, // 60
M|3,M|3,M|3,M|3, M|3,M|3,M|3,M|3, // 68
M|T|E|4,M|T|E|4,M|T|E|4,M|T|E|4, M|3,M|3,M|3,2, // 70
2,2,2,2, M|3,M|3,M|3,M|3, // 78
W|T|4,W|T|4,W|T|4,W|T|4, W|T|4,W|T|4,W|T|4,W|T|4, // 80
W|T|4,W|T|4,W|T|4,W|T|4, W|T|4,W|T|4,W|T|4,W|T|4, // 88
M|3,M|3,M|3,M|3, M|3,M|3,M|3,M|3, // 90
M|3,M|3,M|3,M|3, M|3,M|3,M|3,M|3, // 98
2,2,2,M|3, M|T|E|4,M|3,2,2, // A0
2,2,2,M|3, M|T|E|4,M|3,M|3,M|3, // A8
M|E|3,M|3,M|3,M|3, M|3,M|3,M|3,M|3, // B0
M|3,2,M|T|E|4,M|3, M|3,M|3,M|3,M|3, // B8
M|3,M|3,M|T|E|4,M|3, M|T|E|4,M|T|E|4,M|T|E|4,M|3, // C0
2,2,2,2, 2,2,2,2, // C8
M|3,M|3,M|3,M|3, M|3,M|3,M|3,M|3, // D0
M|3,M|3,M|3,M|3, M|3,M|3,M|3,M|3, // D8
M|3,M|3,M|3,M|3, M|3,M|3,M|3,M|3, // E0
M|3,M|3,M|3,M|3, M|3,M|3,M|3,M|3, // E8
M|3,M|3,M|3,M|3, M|3,M|3,M|3,M|3, // F0
M|3,M|3,M|3,M|3, M|3,M|3,M|3,2 // F8
};
/*************************************************
* Allocate register temporaries
*/
void REGSAVE::save(CodeBuilder& cdb, int reg, unsigned *pidx)
{
unsigned i;
if (reg >= XMM0)
{
alignment = 16;
idx = (idx + 15) & ~15;
i = idx;
idx += 16;
// MOVD idx[RBP],xmm
unsigned op = STOAPD;
if (0)
/* This is because the regsave does not get properly aligned
* to 16 on 32 bit machines.
* Doing so wreaks havoc with the location of vthis, which messes
* up testcontracts.d, which is likely broken anyway for this same
* reason. Need to fix.
*/
op = STOUPD;
cdb.genc1(op,modregxrm(2, reg - XMM0, BPRM),FLregsave,(targ_uns) i);
}
else
{
if (!alignment)
alignment = REGSIZE;
i = idx;
idx += REGSIZE;
// MOV idx[RBP],reg
cdb.genc1(0x89,modregxrm(2, reg, BPRM),FLregsave,(targ_uns) i);
if (I64)
code_orrex(cdb.last(), REX_W);
}
reflocal = TRUE;
if (idx > top)
top = idx; // keep high water mark
*pidx = i;
}
void REGSAVE::restore(CodeBuilder& cdb, int reg, unsigned idx)
{
if (reg >= XMM0)
{
assert(alignment == 16);
// MOVD xmm,idx[RBP]
unsigned op = LODAPD;
if (0)
op = LODUPD;
cdb.genc1(op,modregxrm(2, reg - XMM0, BPRM),FLregsave,(targ_uns) idx);
}
else
{ // MOV reg,idx[RBP]
cdb.genc1(0x8B,modregxrm(2, reg, BPRM),FLregsave,(targ_uns) idx);
if (I64)
code_orrex(cdb.last(), REX_W);
}
}
/************************************
* Size for vex encoded instruction.
*/
unsigned char vex_inssize(code *c)
{
assert(c->Iflags & CFvex && c->Ivex.pfx == 0xC4);
unsigned char ins;
if (c->Iflags & CFvex3)
{
switch (c->Ivex.mmmm)
{
case 0: // no prefix
case 1: // 0F
ins = inssize2[c->Ivex.op] + 2;
break;
case 2: // 0F 38
ins = inssize2[0x38] + 1;
break;
case 3: // 0F 3A
ins = inssize2[0x3A] + 1;
break;
default:
printf("Iop = %x mmmm = %x\n", c->Iop, c->Ivex.mmmm);
assert(0);
}
}
else
{
ins = inssize2[c->Ivex.op] + 1;
}
return ins;
}
/************************************
* Determine if there is a modregrm byte for code.
*/
int cod3_EA(code *c)
{ unsigned ins;
unsigned op1 = c->Iop & 0xFF;
if (op1 == ESCAPE)
ins = 0;
else if ((c->Iop & 0xFFFD00) == 0x0F3800)
ins = inssize2[(c->Iop >> 8) & 0xFF];
else if ((c->Iop & 0xFF00) == 0x0F00)
ins = inssize2[op1];
else
ins = inssize[op1];
return ins & M;
}
/********************************
* setup ALLREGS and BYTEREGS
* called by: codgen
*/
void cod3_initregs()
{
if (I64)
{
ALLREGS = mAX|mBX|mCX|mDX|mSI|mDI| mR8|mR9|mR10|mR11|mR12|mR13|mR14|mR15;
BYTEREGS = ALLREGS;
}
else
{
ALLREGS = ALLREGS_INIT;
BYTEREGS = BYTEREGS_INIT;
}
}
/********************************
* set initial global variable values
*/
void cod3_setdefault()
{
fregsaved = mBP | mSI | mDI;
}
/********************************
* Fix global variables for 386.
*/
void cod3_set32()
{
inssize[0xA0] = T|5;
inssize[0xA1] = T|5;
inssize[0xA2] = T|5;
inssize[0xA3] = T|5;
BPRM = 5; /* [EBP] addressing mode */
fregsaved = mBP | mBX | mSI | mDI; // saved across function calls
FLOATREGS = FLOATREGS_32;
FLOATREGS2 = FLOATREGS2_32;
DOUBLEREGS = DOUBLEREGS_32;
if (config.flags3 & CFG3eseqds)
fregsaved |= mES;
for (unsigned i = 0x80; i < 0x90; i++)
inssize2[i] = W|T|6;
#if TARGET_OSX
STACKALIGN = 16; // 16 for OSX because OSX uses SIMD
#else
STACKALIGN = 4;
#endif
}
/********************************
* Fix global variables for I64.
*/
void cod3_set64()
{
inssize[0xA0] = T|5; // MOV AL,mem
inssize[0xA1] = T|5; // MOV RAX,mem
inssize[0xA2] = T|5; // MOV mem,AL
inssize[0xA3] = T|5; // MOV mem,RAX
BPRM = 5; // [RBP] addressing mode
#if TARGET_WINDOS
fregsaved = mBP | mBX | mDI | mSI | mR12 | mR13 | mR14 | mR15 | mES | mXMM6 | mXMM7; // also XMM8..15;
#else
fregsaved = mBP | mBX | mR12 | mR13 | mR14 | mR15 | mES; // saved across function calls
#endif
FLOATREGS = FLOATREGS_64;
FLOATREGS2 = FLOATREGS2_64;
DOUBLEREGS = DOUBLEREGS_64;
STACKALIGN = 16;
ALLREGS = mAX|mBX|mCX|mDX|mSI|mDI| mR8|mR9|mR10|mR11|mR12|mR13|mR14|mR15;
BYTEREGS = ALLREGS;
for (unsigned i = 0x80; i < 0x90; i++)
inssize2[i] = W|T|6;
STACKALIGN = 16; // 16 rather than 8 because of SIMD alignment
}
/*********************************
* Word or dword align start of function.
* Params:
* seg = segment to write alignment bytes to
* nbytes = number of alignment bytes to write
*/
void cod3_align_bytes(int seg, size_t nbytes)
{
/* Table 4-2 from Intel Instruction Set Reference M-Z
* 1 bytes NOP 90
* 2 bytes 66 NOP 66 90
* 3 bytes NOP DWORD ptr [EAX] 0F 1F 00
* 4 bytes NOP DWORD ptr [EAX + 00H] 0F 1F 40 00
* 5 bytes NOP DWORD ptr [EAX + EAX*1 + 00H] 0F 1F 44 00 00
* 6 bytes 66 NOP DWORD ptr [EAX + EAX*1 + 00H] 66 0F 1F 44 00 00
* 7 bytes NOP DWORD ptr [EAX + 00000000H] 0F 1F 80 00 00 00 00
* 8 bytes NOP DWORD ptr [EAX + EAX*1 + 00000000H] 0F 1F 84 00 00 00 00 00
* 9 bytes 66 NOP DWORD ptr [EAX + EAX*1 + 00000000H] 66 0F 1F 84 00 00 00 00 00
* only for CPUs: CPUID.01H.EAX[Bytes 11:8] = 0110B or 1111B
*/
assert(SegData[seg]->SDseg == seg);
while (nbytes)
{ size_t n = nbytes;
const char *p;
if (nbytes > 1 && (I64 || config.fpxmmregs))
{
switch (n)
{
case 2: p = "\x66\x90"; break;
case 3: p = "\x0F\x1F\x00"; break;
case 4: p = "\x0F\x1F\x40\x00"; break;
case 5: p = "\x0F\x1F\x44\x00\x00"; break;
case 6: p = "\x66\x0F\x1F\x44\x00\x00"; break;
case 7: p = "\x0F\x1F\x80\x00\x00\x00\x00"; break;
case 8: p = "\x0F\x1F\x84\x00\x00\x00\x00\x00"; break;
default: p = "\x66\x0F\x1F\x84\x00\x00\x00\x00\x00"; n = 9; break;
}
}
else
{
static const unsigned char nops[] = {
0x90,0x90,0x90,0x90,0x90,0x90,0x90,0x90,0x90,0x90,0x90,0x90,0x90,0x90,0x90
}; // XCHG AX,AX
if (n > sizeof(nops))
n = sizeof(nops);
p = (char*)nops;
}
objmod->write_bytes(SegData[seg],n,const_cast<char*>(p));
nbytes -= n;
}
}
/****************************
* Align start of function.
* Params:
* seg = segment of function
*/
void cod3_align(int seg)
{
unsigned nbytes;
#if TARGET_WINDOS
if (config.flags4 & CFG4speed) // if optimized for speed
{
// Pick alignment based on CPU target
if (config.target_cpu == TARGET_80486 ||
config.target_cpu >= TARGET_PentiumPro)
{ // 486 does reads on 16 byte boundaries, so if we are near
// such a boundary, align us to it
nbytes = -Offset(seg) & 15;
if (nbytes < 8)
cod3_align_bytes(seg, nbytes);
}
}
#else
nbytes = -Offset(seg) & 7;
cod3_align_bytes(seg, nbytes);
#endif
}
/**********************************
* Generate code to adjust the stack pointer by `nbytes`
* Params:
* cdb = code builder
* nbytes = number of bytes to adjust stack pointer
*/
void cod3_stackadj(CodeBuilder& cdb, int nbytes)
{
//printf("cod3_stackadj(%d)\n", nbytes);
unsigned grex = I64 ? REX_W << 16 : 0;
unsigned rm;
if (nbytes > 0)
rm = modregrm(3,5,SP); // SUB ESP,nbytes
else
{
nbytes = -nbytes;
rm = modregrm(3,0,SP); // ADD ESP,nbytes
}
cdb.genc2(0x81, grex | rm, nbytes);
}
#if ELFOBJ
/* Constructor that links the ModuleReference to the head of
* the list pointed to by _Dmoduleref
*/
void cod3_buildmodulector(Outbuffer* buf, int codeOffset, int refOffset)
{
/* ret
* codeOffset:
* pushad
* mov EAX,&ModuleReference
* mov ECX,_DmoduleRef
* mov EDX,[ECX]
* mov [EAX],EDX
* mov [ECX],EAX
* popad
* ret
*/
const int seg = CODE;
if (I64 && config.flags3 & CFG3pic)
{ // LEA RAX,ModuleReference[RIP]
buf->writeByte(REX | REX_W);
buf->writeByte(LEA);
buf->writeByte(modregrm(0,AX,5));
codeOffset += 3;
codeOffset += ElfObj::writerel(seg, codeOffset, R_X86_64_PC32, 3 /*STI_DATA*/, refOffset - 4);
// MOV RCX,_DmoduleRef@GOTPCREL[RIP]
buf->writeByte(REX | REX_W);
buf->writeByte(0x8B);
buf->writeByte(modregrm(0,CX,5));
codeOffset += 3;
codeOffset += ElfObj::writerel(seg, codeOffset, R_X86_64_GOTPCREL, Obj::external_def("_Dmodule_ref"), -4);
}
else
{
/* movl ModuleReference*, %eax */
buf->writeByte(0xB8);
codeOffset += 1;
const unsigned reltype = I64 ? R_X86_64_32 : R_386_32;
codeOffset += ElfObj::writerel(seg, codeOffset, reltype, 3 /*STI_DATA*/, refOffset);
/* movl _Dmodule_ref, %ecx */
buf->writeByte(0xB9);
codeOffset += 1;
codeOffset += ElfObj::writerel(seg, codeOffset, reltype, Obj::external_def("_Dmodule_ref"), 0);
}
if (I64)
buf->writeByte(REX | REX_W);
buf->writeByte(0x8B); buf->writeByte(0x11); /* movl (%ecx), %edx */
if (I64)
buf->writeByte(REX | REX_W);
buf->writeByte(0x89); buf->writeByte(0x10); /* movl %edx, (%eax) */
if (I64)
buf->writeByte(REX | REX_W);
buf->writeByte(0x89); buf->writeByte(0x01); /* movl %eax, (%ecx) */
buf->writeByte(0xC3); /* ret */
}
#endif
/*****************************
* Given a type, return a mask of
* registers to hold that type.
* Input:
* tyf function type
*/
regm_t regmask(tym_t tym, tym_t tyf)
{
switch (tybasic(tym))
{
case TYvoid:
case TYstruct:
case TYarray:
return 0;
case TYbool:
case TYwchar_t:
case TYchar16:
case TYchar:
case TYschar:
case TYuchar:
case TYshort:
case TYushort:
case TYint:
case TYuint:
case TYnullptr:
case TYnptr:
case TYnref:
#if TARGET_SEGMENTED
case TYsptr:
case TYcptr:
#endif
return mAX;
case TYfloat:
case TYifloat:
if (I64)
return mXMM0;
if (config.exe & EX_flat)
return mST0;
case TYlong:
case TYulong:
case TYdchar:
if (!I16)
return mAX;
#if TARGET_SEGMENTED
case TYfptr:
case TYhptr:
#endif
return mDX | mAX;
case TYcent:
case TYucent:
assert(I64);
return mDX | mAX;
#if TARGET_SEGMENTED
case TYvptr:
return mDX | mBX;
#endif
case TYdouble:
case TYdouble_alias:
case TYidouble:
if (I64)
return mXMM0;
if (config.exe & EX_flat)
return mST0;
return DOUBLEREGS;
case TYllong:
case TYullong:
return I64 ? (regm_t) mAX : (I32 ? mDX | mAX : DOUBLEREGS);
case TYldouble:
case TYildouble:
return mST0;
case TYcfloat:
#if TARGET_LINUX || TARGET_OSX || TARGET_FREEBSD || TARGET_OPENBSD || TARGET_DRAGONFLYBSD || TARGET_SOLARIS
if (I32 && tybasic(tyf) == TYnfunc)
return mDX | mAX;
#endif
case TYcdouble:
if (I64)
return mXMM0 | mXMM1;
case TYcldouble:
return mST01;
// SIMD vector types
case TYfloat4:
case TYdouble2:
case TYschar16:
case TYuchar16:
case TYshort8:
case TYushort8:
case TYlong4:
case TYulong4:
case TYllong2:
case TYullong2:
case TYfloat8:
case TYdouble4:
case TYschar32:
case TYuchar32:
case TYshort16:
case TYushort16:
case TYlong8:
case TYulong8:
case TYllong4:
case TYullong4:
if (!config.fpxmmregs)
{ printf("SIMD operations not supported on this platform\n");
exit(1);
}
return mXMM0;
default:
#if DEBUG
WRTYxx(tym);
#endif
assert(0);
return 0;
}
}
/*******************************
* setup register allocator parameters with platform specific data
*/
void cgreg_dst_regs(unsigned *dst_integer_reg, unsigned *dst_float_reg)
{
*dst_integer_reg = AX;
*dst_float_reg = XMM0;
}
void cgreg_set_priorities(tym_t ty, unsigned char **pseq, unsigned char **pseqmsw)
{
unsigned sz = tysize(ty);
if (tyxmmreg(ty))
{
static unsigned char sequence[] = {XMM0,XMM1,XMM2,XMM3,XMM4,XMM5,XMM6,XMM7,NOREG};
*pseq = sequence;
}
else if (I64)
{
if (sz == REGSIZE * 2)
{
static unsigned char seqmsw[] = {CX,DX,NOREG};
static unsigned char seqlsw[] = {AX,BX,SI,DI,NOREG};
*pseq = seqlsw;
*pseqmsw = seqmsw;
}
else
{ // R10 is reserved for the static link
static unsigned char sequence[] = {AX,CX,DX,SI,DI,R8,R9,R11,BX,R12,R13,R14,R15,BP,NOREG};
*pseq = sequence;
}
}
else if (I32)
{
if (sz == REGSIZE * 2)
{
static unsigned char seqlsw[] = {AX,BX,SI,DI,NOREG};
static unsigned char seqmsw[] = {CX,DX,NOREG};
*pseq = seqlsw;
*pseqmsw = seqmsw;
}
else
{
static unsigned char sequence[] = {AX,CX,DX,BX,SI,DI,BP,NOREG};
*pseq = sequence;
}
}
else
{ assert(I16);
if (typtr(ty))
{
// For pointer types, try to pick index register first
static unsigned char seqidx[] = {BX,SI,DI,AX,CX,DX,BP,NOREG};
*pseq = seqidx;
}
else
{
// Otherwise, try to pick index registers last
static unsigned char sequence[] = {AX,CX,DX,BX,SI,DI,BP,NOREG};
*pseq = sequence;
}
}
}
/*******************************************
* Call finally block.
* Params:
* bf = block to call
* retregs = registers to preserve across call
* Returns:
* code generated
*/
static code *callFinallyBlock(block *bf, regm_t retregs)
{
CodeBuilder cdbs;
CodeBuilder cdbr;
int nalign = 0;
calledFinally = true;
unsigned npush = gensaverestore(retregs,cdbs,cdbr);
if (STACKALIGN == 16)
{ npush += REGSIZE;
if (npush & (STACKALIGN - 1))
{ nalign = STACKALIGN - (npush & (STACKALIGN - 1));
cod3_stackadj(cdbs, nalign);
}
}
cdbs.genc(0xE8,0,0,0,FLblock,(targ_size_t)bf);
regcon.immed.mval = 0;
if (nalign)
cod3_stackadj(cdbs, -nalign);
cdbs.append(cdbr);
return cdbs.finish();
}
/*******************************
* Generate block exit code
*/
void outblkexitcode(CodeBuilder& cdb, block *bl, int& anyspill, const char* sflsave, symbol** retsym, const regm_t mfuncregsave)
{
CodeBuilder cdb2;
elem *e = bl->Belem;
block *nextb;
regm_t retregs = 0;
if (bl->BC != BCasm)
assert(bl->Bcode == NULL);
switch (bl->BC) /* block exit condition */
{
case BCiftrue:
{
bool jcond = TRUE;
block *bs1 = bl->nthSucc(0);
block *bs2 = bl->nthSucc(1);
if (bs1 == bl->Bnext)
{ // Swap bs1 and bs2
block *btmp;
jcond ^= 1;
btmp = bs1;
bs1 = bs2;
bs2 = btmp;
}
logexp(cdb,e,jcond,FLblock,(code *) bs1);
nextb = bs2;
}
L5:
if (configv.addlinenumbers && bl->Bsrcpos.Slinnum &&
!(funcsym_p->ty() & mTYnaked))
{
//printf("BCiftrue: %s(%u)\n", bl->Bsrcpos.Sfilename ? bl->Bsrcpos.Sfilename : "", bl->Bsrcpos.Slinnum);
cdb.genlinnum(bl->Bsrcpos);
}
if (nextb != bl->Bnext)
{
assert(!(bl->Bflags & BFLepilog));
genjmp(cdb,JMP,FLblock,nextb);
}
break;
case BCjmptab:
case BCifthen:
case BCswitch:
{
assert(!(bl->Bflags & BFLepilog));
doswitch(cdb,bl); // hide messy details
break;
}
#if MARS
case BCjcatch: // D catch clause of try-catch
assert(ehmethod(funcsym_p) != EH_NONE);
// Mark all registers as destroyed. This will prevent
// register assignments to variables used in catch blocks.
getregs(cdb,lpadregs());
if (config.ehmethod == EH_DWARF)
{
/* Each block must have ESP set to the same value it was at the end
* of the prolog. But the unwinder calls catch blocks with ESP set
* at the value it was when the throwing function was called, which
* may have arguments pushed on the stack.
* This instruction will reset ESP to the correct offset from EBP.
*/
cdb.gen1(ESCAPE | ESCfixesp);
}
goto case_goto;
#endif
#if SCPP
case BCcatch: // C++ catch clause of try-catch
// Mark all registers as destroyed. This will prevent
// register assignments to variables used in catch blocks.
getregs(cdb,allregs | mES);
goto case_goto;
case BCtry:
usednteh |= EHtry;
if (config.exe == EX_WIN32)
usednteh |= NTEHtry;
goto case_goto;
#endif
case BCgoto:
nextb = bl->nthSucc(0);
if ((MARS ||
funcsym_p->Sfunc->Fflags3 & Fnteh) &&
ehmethod(funcsym_p) != EH_DWARF &&
bl->Btry != nextb->Btry &&
nextb->BC != BC_finally)
{
regm_t retregsx = 0;
gencodelem(cdb,e,&retregsx,TRUE);
int toindex = nextb->Btry ? nextb->Btry->Bscope_index : -1;
assert(bl->Btry);
int fromindex = bl->Btry->Bscope_index;
#if MARS
if (toindex + 1 == fromindex)
{ // Simply call __finally
if (bl->Btry &&
bl->Btry->nthSucc(1)->BC == BCjcatch)
{
goto L5; // it's a try-catch, not a try-finally
}
}
#endif
if (config.ehmethod == EH_WIN32 && !(funcsym_p->Sfunc->Fflags3 & Feh_none) ||
config.ehmethod == EH_SEH)
{
nteh_unwind(cdb,0,toindex);
}
#if MARS
else if (toindex + 1 <= fromindex)
{
//c = cat(c, linux_unwind(0, toindex));
block *bt;
//printf("B%d: fromindex = %d, toindex = %d\n", bl->Bdfoidx, fromindex, toindex);
bt = bl;
while ((bt = bt->Btry) != NULL && bt->Bscope_index != toindex)
{ block *bf;
//printf("\tbt->Bscope_index = %d, bt->Blast_index = %d\n", bt->Bscope_index, bt->Blast_index);
bf = bt->nthSucc(1);
// Only look at try-finally blocks
if (bf->BC == BCjcatch)
continue;
if (bf == nextb)
continue;
//printf("\tbf = B%d, nextb = B%d\n", bf->Bdfoidx, nextb->Bdfoidx);
if (nextb->BC == BCgoto &&
!nextb->Belem &&
bf == nextb->nthSucc(0))
continue;
// call __finally
cdb.append(callFinallyBlock(bf->nthSucc(0), retregsx));
}
}
#endif
goto L5;
}
case_goto:
{
regm_t retregsx = 0;
gencodelem(cdb,e,&retregsx,TRUE);
if (anyspill)
{ // Add in the epilog code
CodeBuilder cdbstore;
CodeBuilder cdbload;
for (int i = 0; i < anyspill; i++)
{ symbol *s = globsym.tab[i];
if (s->Sflags & SFLspill &&
vec_testbit(dfoidx,s->Srange))
{
s->Sfl = sflsave[i]; // undo block register assignments
cgreg_spillreg_epilog(bl,s,cdbstore,cdbload);
}
}
cdb.append(cdbstore);
cdb.append(cdbload);
}
nextb = bl->nthSucc(0);
goto L5;
}
case BC_try:
if (config.ehmethod == EH_NONE || funcsym_p->Sfunc->Fflags3 & Feh_none)
{
/* Need to use frame pointer to access locals, not the stack pointer,
* because we'll be calling the BC_finally blocks and the stack will be off.
*/
needframe = 1;
}
else if (config.ehmethod == EH_SEH || config.ehmethod == EH_WIN32)
{
usednteh |= NTEH_try;
nteh_usevars();
}
else
usednteh |= EHtry;
goto case_goto;
case BC_finally:
if (ehmethod(funcsym_p) == EH_DWARF)
{
// Mark scratch registers as destroyed.
getregsNoSave(lpadregs());
regm_t retregsx = 0;
gencodelem(cdb,bl->Belem,&retregsx,TRUE);
// JMP bl->nthSucc(1)
nextb = bl->nthSucc(1);
goto L5;
}
else
{
if (config.ehmethod == EH_SEH ||
config.ehmethod == EH_WIN32 && !(funcsym_p->Sfunc->Fflags3 & Feh_none))
{
// Mark all registers as destroyed. This will prevent
// register assignments to variables used in finally blocks.
getregsNoSave(lpadregs());
}
assert(!e);
// Generate CALL to finalizer code
cdb.append(callFinallyBlock(bl->nthSucc(0), 0));
// JMP bl->nthSucc(1)
nextb = bl->nthSucc(1);
goto L5;
}
case BC_lpad:
{
assert(ehmethod(funcsym_p) == EH_DWARF);
// Mark all registers as destroyed. This will prevent
// register assignments to variables used in finally blocks.
getregsNoSave(lpadregs());
regm_t retregs = 0;
gencodelem(cdb,bl->Belem,&retregs,TRUE);
// JMP bl->nthSucc(0)
nextb = bl->nthSucc(0);
goto L5;
}
case BC_ret:
{
regm_t retregsx = 0;
gencodelem(cdb,e,&retregsx,TRUE);
if (ehmethod(funcsym_p) == EH_DWARF)
{
}
else
cdb.gen1(0xC3); // RET
break;
}
#if NTEXCEPTIONS
case BC_except:
{
assert(!e);
usednteh |= NTEH_except;
nteh_setsp(cdb,0x8B);
getregsNoSave(allregs);
nextb = bl->nthSucc(0);
goto L5;
}
case BC_filter:
{
nteh_filter(cdb, bl);
// Mark all registers as destroyed. This will prevent
// register assignments to variables used in filter blocks.
getregsNoSave(allregs);
regm_t retregsx = regmask(e->Ety, TYnfunc);
gencodelem(cdb,e,&retregsx,TRUE);
cdb.gen1(0xC3); // RET
break;
}
#endif
case BCretexp:
retregs = regmask(e->Ety, funcsym_p->ty());
// For the final load into the return regs, don't set regcon.used,
// so that the optimizer can potentially use retregs for register
// variable assignments.
if (config.flags4 & CFG4optimized)
{ regm_t usedsave;
docommas(cdb,&e);
usedsave = regcon.used;
if (EOP(e))
gencodelem(cdb,e,&retregs,TRUE);
else
{
if (e->Eoper == OPconst)
regcon.mvar = 0;
gencodelem(cdb,e,&retregs,TRUE);
regcon.used = usedsave;
if (e->Eoper == OPvar)
{ symbol *s = e->EV.sp.Vsym;
if (s->Sfl == FLreg && s->Sregm != mAX)
*retsym = s;
}
}
}
else
{
gencodelem(cdb,e,&retregs,TRUE);
}
goto L4;
case BCret:
case BCexit:
retregs = 0;
gencodelem(cdb,e,&retregs,TRUE);
L4:
if (retregs == mST0)
{ assert(stackused == 1);
pop87(); // account for return value
}
else if (retregs == mST01)
{ assert(stackused == 2);
pop87();
pop87(); // account for return value
}
if (bl->BC == BCexit)
{
if (config.flags4 & CFG4optimized)
mfuncreg = mfuncregsave;
}
else if (MARS || usednteh & NTEH_try)
{
block *bt = bl;
while ((bt = bt->Btry) != NULL)
{
block *bf = bt->nthSucc(1);
#if MARS
// Only look at try-finally blocks
if (bf->BC == BCjcatch)
{
continue;
}
#endif
if (config.ehmethod == EH_WIN32 && !(funcsym_p->Sfunc->Fflags3 & Feh_none) ||
config.ehmethod == EH_SEH)
{
if (bt->Bscope_index == 0)
{
// call __finally
CodeBuilder cdbs;
CodeBuilder cdbr;
nteh_gensindex(cdb,-1);
gensaverestore(retregs,cdbs,cdbr);
cdb.append(cdbs);
cdb.genc(0xE8,0,0,0,FLblock,(targ_size_t)bf->nthSucc(0));
regcon.immed.mval = 0;
cdb.append(cdbr);
}
else
{
nteh_unwind(cdb,retregs,~0);
}
break;
}
else
{
// call __finally
cdb.append(callFinallyBlock(bf->nthSucc(0), retregs));
}
}
}
break;
#if SCPP || MARS
case BCasm:
{
assert(!e);
// Mark destroyed registers
CodeBuilder cdbx;
getregs(cdbx,iasm_regs(bl)); // mark destroyed registers
code *c = cdbx.finish();
if (bl->Bsucc)
{ nextb = bl->nthSucc(0);
if (!bl->Bnext)
{
cdb.append(bl->Bcode);
cdb.append(c);
goto L5;
}
if (nextb != bl->Bnext &&
bl->Bnext &&
!(bl->Bnext->BC == BCgoto &&
!bl->Bnext->Belem &&
nextb == bl->Bnext->nthSucc(0)))
{
// See if already have JMP at end of block
code *cl = code_last(bl->Bcode);
if (!cl || cl->Iop != JMP)
{
cdb.append(bl->Bcode);
cdb.append(c);
goto L5; // add JMP at end of block
}
}
}
cdb.append(bl->Bcode);
break;
}
#endif
default:
#ifdef DEBUG
printf("bl->BC = %d\n",bl->BC);
#endif
assert(0);
}
}
/***********************************************
* Struct necessary for sorting switch cases.
*/
extern "C" // qsort cmp functions need to be "C"
{
struct CaseVal
{
targ_ullong val;
block *target;
/* Sort function for qsort() */
static int
#if __DMC__
__cdecl
#endif
cmp(const void *p, const void *q)
{
const CaseVal *c1 = (const CaseVal *)p;
const CaseVal *c2 = (const CaseVal *)q;
return (c1->val < c2->val) ? -1 : ((c1->val == c2->val) ? 0 : 1);
}
};
}
/***
* Generate comparison of [reg2,reg] with val
*/
static void cmpval(CodeBuilder& cdb, targ_llong val, unsigned sz, unsigned reg, unsigned reg2, unsigned sreg)
{
if (I64 && sz == 8)
{
assert(reg2 == NOREG);
if (val == (int)val) // if val is a 64 bit value sign-extended from 32 bits
{
cdb.genc2(0x81,modregrmx(3,7,reg),val); // CMP reg,value32
cdb.last()->Irex |= REX_W; // 64 bit operand
}
else
{
assert(sreg != NOREG);
movregconst(cdb,sreg,val,64); // MOV sreg,val64
genregs(cdb,0x3B,reg,sreg); // CMP reg,sreg
code_orrex(cdb.last(), REX_W);
getregsNoSave(mask[sreg]); // don't remember we loaded this constant
}
}
else if (reg2 == NOREG)
cdb.genc2(0x81,modregrmx(3,7,reg),val); // CMP reg,casevalue
else
{
cdb.genc2(0x81,modregrm(3,7,reg2),MSREG(val)); // CMP reg2,MSREG(casevalue)
code *cnext = gennop(CNIL);
genjmp(cdb,JNE,FLcode,(block *) cnext); // JNE cnext
cdb.genc2(0x81,modregrm(3,7,reg),val); // CMP reg,casevalue
cdb.append(cnext);
}
}
static void ifthen(CodeBuilder& cdb, CaseVal *casevals, size_t ncases,
unsigned sz, unsigned reg, unsigned reg2, unsigned sreg, block *bdefault, bool last)
{
if (ncases >= 4 && config.flags4 & CFG4speed)
{
size_t pivot = ncases >> 1;
// Compares for casevals[0..pivot]
CodeBuilder cdb1;
ifthen(cdb1, casevals, pivot, sz, reg, reg2, sreg, bdefault, true);
// Compares for casevals[pivot+1..ncases]
CodeBuilder cdb2;
ifthen(cdb2, casevals + pivot + 1, ncases - pivot - 1, sz, reg, reg2, sreg, bdefault, last);
code *c2 = gennop(CNIL);
// Compare for caseval[pivot]
cmpval(cdb, casevals[pivot].val, sz, reg, reg2, sreg);
genjmp(cdb,JE,FLblock,casevals[pivot].target); // JE target
// Note unsigned jump here, as cases were sorted using unsigned comparisons
genjmp(cdb,JA,FLcode,(block *) c2); // JG c2
cdb.append(cdb1);
cdb.append(c2);
cdb.append(cdb2);
}
else
{ // Not worth doing a binary search, just do a sequence of CMP/JE
for (size_t n = 0; n < ncases; n++)
{
targ_llong val = casevals[n].val;
cmpval(cdb, val, sz, reg, reg2, sreg);
code *cnext = CNIL;
if (reg2 != NOREG)
{
cnext = gennop(CNIL);
genjmp(cdb,JNE,FLcode,(block *) cnext); // JNE cnext
cdb.genc2(0x81,modregrm(3,7,reg2),MSREG(val)); // CMP reg2,MSREG(casevalue)
}
genjmp(cdb,JE,FLblock,casevals[n].target); // JE caseaddr
cdb.append(cnext);
}
if (last) // if default is not next block
genjmp(cdb,JMP,FLblock,bdefault);
}
}
/*******************************
* Generate code for blocks ending in a switch statement.
* Take BCswitch and decide on
* BCifthen use if - then code
* BCjmptab index into jump table
* BCswitch search table for match
*/
void doswitch(CodeBuilder& cdb, block *b)
{
targ_ulong msw;
#if TARGET_SEGMENTED
// If switch tables are in code segment and we need a CS: override to get at them
bool csseg = config.flags & CFGromable;
#else
bool csseg = false;
#endif
//printf("doswitch(%d)\n", b->BC);
elem *e = b->Belem;
elem_debug(e);
docommas(cdb,&e);
cgstate.stackclean++;
tym_t tys = tybasic(e->Ety);
int sz = _tysize[tys];
bool dword = (sz == 2 * REGSIZE);
bool mswsame = true; // assume all msw's are the same
targ_llong *p = b->BS.Bswitch; // pointer to case data
assert(p);
unsigned ncases = *p++; // number of cases
targ_llong vmax = MINLL; // smallest possible llong
targ_llong vmin = MAXLL; // largest possible llong
for (unsigned n = 0; n < ncases; n++) // find max and min case values
{
targ_llong val = *p++;
if (val > vmax) vmax = val;
if (val < vmin) vmin = val;
if (REGSIZE == 2)
{
unsigned short ms = (val >> 16) & 0xFFFF;
if (n == 0)
msw = ms;
else if (msw != ms)
mswsame = 0;
}
else // REGSIZE == 4
{
targ_ulong ms = (val >> 32) & 0xFFFFFFFF;
if (n == 0)
msw = ms;
else if (msw != ms)
mswsame = 0;
}
}
p -= ncases;
//dbg_printf("vmax = x%lx, vmin = x%lx, vmax-vmin = x%lx\n",vmax,vmin,vmax - vmin);
/* Three kinds of switch strategies - pick one
*/
if (ncases <= 3)
goto Lifthen;
else if (I16 && (targ_ullong)(vmax - vmin) <= ncases * 2)
goto Ljmptab; // >=50% of the table is case values, rest is default
else if ((targ_ullong)(vmax - vmin) <= ncases * 3)
goto Ljmptab; // >= 33% of the table is case values, rest is default
else if (I16)
goto Lswitch;
else
goto Lifthen;
/*************************************************************************/
{ // generate if-then sequence
Lifthen:
regm_t retregs = ALLREGS;
b->BC = BCifthen;
scodelem(cdb,e,&retregs,0,TRUE);
unsigned reg, reg2;
if (dword)
{ reg = findreglsw(retregs);
reg2 = findregmsw(retregs);
}
else
{
reg = findreg(retregs); // reg that result is in
reg2 = NOREG;
}
list_t bl = b->Bsucc;
block *bdefault = b->nthSucc(0);
if (dword && mswsame)
{
cdb.genc2(0x81,modregrm(3,7,reg2),msw); // CMP reg2,MSW
genjmp(cdb,JNE,FLblock,bdefault); // JNE default
reg2 = NOREG;
}
unsigned sreg = NOREG; // may need a scratch register
// Put into casevals[0..ncases] so we can sort then slice
CaseVal *casevals = (CaseVal *)malloc(ncases * sizeof(CaseVal));
assert(casevals);
for (unsigned n = 0; n < ncases; n++)
{
casevals[n].val = p[n];
bl = list_next(bl);
casevals[n].target = list_block(bl);
// See if we need a scratch register
if (sreg == NOREG && I64 && sz == 8 && p[n] != (int)p[n])
{ regm_t regm = ALLREGS & ~mask[reg];
allocreg(cdb,®m, &sreg, TYint);
}
}
// Sort cases so we can do a runtime binary search
qsort(casevals, ncases, sizeof(CaseVal), &CaseVal::cmp);
//for (unsigned n = 0; n < ncases; n++)
//printf("casevals[%lld] = x%x\n", n, casevals[n].val);
// Generate binary tree of comparisons
ifthen(cdb, casevals, ncases, sz, reg, reg2, sreg, bdefault, bdefault != b->Bnext);
free(casevals);
cgstate.stackclean--;
return;
}
/*************************************************************************/
{
// Use switch value to index into jump table
Ljmptab:
//printf("Ljmptab:\n");
b->BC = BCjmptab;
/* If vmin is small enough, we can just set it to 0 and the jump
* table entries from 0..vmin-1 can be set with the default target.
* This saves the SUB instruction.
* Must be same computation as used in outjmptab().
*/
if (vmin > 0 && vmin <= intsize)
vmin = 0;
b->Btablesize = (int) (vmax - vmin + 1) * tysize(TYnptr);
regm_t retregs = IDXREGS;
if (dword)
retregs |= mMSW;
#if TARGET_LINUX || TARGET_FREEBSD || TARGET_OPENBSD || TARGET_DRAGONFLYBSD || TARGET_SOLARIS
if (I32 && config.flags3 & CFG3pic)
retregs &= ~mBX; // need EBX for GOT
#endif
bool modify = (I16 || I64 || vmin);
scodelem(cdb,e,&retregs,0,!modify);
unsigned reg = findreg(retregs & IDXREGS); // reg that result is in
unsigned reg2;
if (dword)
reg2 = findregmsw(retregs);
if (modify)
{
assert(!(retregs & regcon.mvar));
getregs(cdb,retregs);
}
if (vmin) // if there is a minimum
{
cdb.genc2(0x81,modregrm(3,5,reg),vmin); // SUB reg,vmin
if (dword)
{ cdb.genc2(0x81,modregrm(3,3,reg2),MSREG(vmin)); // SBB reg2,vmin
genjmp(cdb,JNE,FLblock,b->nthSucc(0)); // JNE default
}
}
else if (dword)
{ gentstreg(cdb,reg2); // TEST reg2,reg2
genjmp(cdb,JNE,FLblock,b->nthSucc(0)); // JNE default
}
if (vmax - vmin != REGMASK) // if there is a maximum
{ // CMP reg,vmax-vmin
cdb.genc2(0x81,modregrm(3,7,reg),vmax-vmin);
if (I64 && sz == 8)
code_orrex(cdb.last(), REX_W);
genjmp(cdb,JA,FLblock,b->nthSucc(0)); // JA default
}
if (I64)
{
if (!vmin)
{ // Need to clear out high 32 bits of reg
// Use 8B instead of 89, as 89 will be optimized away as a NOP
genregs(cdb,0x8B,reg,reg); // MOV reg,reg
}
if (config.flags3 & CFG3pic || config.exe == EX_WIN64)
{
/* LEA R1,disp[RIP] 48 8D 05 00 00 00 00
* MOVSXD R2,[reg*4][R1] 48 63 14 B8
* LEA R1,[R1][R2] 48 8D 04 02
* JMP R1 FF E0
*/
unsigned r1;
regm_t scratchm = ALLREGS & ~mask[reg];
allocreg(cdb,&scratchm,&r1,TYint);
unsigned r2;
scratchm = ALLREGS & ~(mask[reg] | mask[r1]);
allocreg(cdb,&scratchm,&r2,TYint);
CodeBuilder cdbe;
cdbe.genc1(LEA,(REX_W << 16) | modregxrm(0,r1,5),FLswitch,0); // LEA R1,disp[RIP]
cdbe.last()->IEV1.Vswitch = b;
cdbe.gen2sib(0x63,(REX_W << 16) | modregxrm(0,r2,4), modregxrmx(2,reg,r1)); // MOVSXD R2,[reg*4][R1]
cdbe.gen2sib(LEA,(REX_W << 16) | modregxrm(0,r1,4),modregxrmx(0,r1,r2)); // LEA R1,[R1][R2]
cdbe.gen2(0xFF,modregrmx(3,4,r1)); // JMP R1
b->Btablesize = (int) (vmax - vmin + 1) * 4;
code *ce = cdbe.finish();
pinholeopt(ce, NULL);
cdb.append(cdbe);
}
else
{
cdb.genc1(0xFF,modregrm(0,4,4),FLswitch,0); // JMP disp[reg*8]
cdb.last()->IEV1.Vswitch = b;
cdb.last()->Isib = modregrm(3,reg & 7,5);
if (reg & 8)
cdb.last()->Irex |= REX_X;
}
}
else if (I32)
{
#if JMPJMPTABLE
/* LEA jreg,offset ctable[reg][reg * 4]
JMP jreg
ctable:
JMP case0
JMP case1
...
*/
CodeBuilder ctable;
block *bdef = b->nthSucc(0);
targ_llong u;
for (u = vmin; ; u++)
{ block *targ = bdef;
for (n = 0; n < ncases; n++)
{
if (p[n] == u)
{ targ = b->nthSucc(n + 1);
break;
}
}
genjmp(ctable,JMP,FLblock,targ);
ctable.last()->Iflags |= CFjmp5; // don't shrink these
if (u == vmax)
break;
}
// Allocate scratch register jreg
regm_t scratchm = ALLREGS & ~mask[reg];
unsigned jreg = AX;
allocreg(cdb,&scratchm,&jreg,TYint);
// LEA jreg, offset ctable[reg][reg*4]
cdb.genc1(LEA,modregrm(2,jreg,4),FLcode,6);
cdb.last()->Isib = modregrm(2,reg,reg);
cdb.gen2(0xFF,modregrm(3,4,jreg)); // JMP jreg
cdb.append(ctable);
b->Btablesize = 0;
cgstate.stackclean--;
return;
#elif TARGET_OSX
/* CALL L1
* L1: POP R1
* ADD R1,disp[reg*4][R1]
* JMP R1
*/
// Allocate scratch register r1
regm_t scratchm = ALLREGS & ~mask[reg];
unsigned r1;
allocreg(cdb,&scratchm,&r1,TYint);
cdb.genc2(CALL,0,0); // CALL L1
cdb.gen1(0x58 + r1); // L1: POP R1
cdb.genc1(0x03,modregrm(2,r1,4),FLswitch,0); // ADD R1,disp[reg*4][EBX]
cdb.last()->IEV1.Vswitch = b;
cdb.last()->Isib = modregrm(2,reg,r1);
cdb.gen2(0xFF,modregrm(3,4,r1)); // JMP R1
#else
if (config.flags3 & CFG3pic)
{
/* MOV R1,EBX
* SUB R1,funcsym_p@GOTOFF[offset][reg*4][EBX]
* JMP R1
*/
// Load GOT in EBX
load_localgot(cdb);
// Allocate scratch register r1
regm_t scratchm = ALLREGS & ~(mask[reg] | mBX);
unsigned r1;
allocreg(cdb,&scratchm,&r1,TYint);
genmovreg(cdb,r1,BX); // MOV R1,EBX
cdb.genc1(0x2B,modregxrm(2,r1,4),FLswitch,0); // SUB R1,disp[reg*4][EBX]
cdb.last()->IEV1.Vswitch = b;
cdb.last()->Isib = modregrm(2,reg,BX);
cdb.gen2(0xFF,modregrmx(3,4,r1)); // JMP R1
}
else
{
cdb.genc1(0xFF,modregrm(0,4,4),FLswitch,0); // JMP disp[idxreg*4]
cdb.last()->IEV1.Vswitch = b;
cdb.last()->Isib = modregrm(2,reg,5);
}
#endif
}
else if (I16)
{
cdb.gen2(0xD1,modregrm(3,4,reg)); // SHL reg,1
unsigned rm = getaddrmode(retregs) | modregrm(0,4,0);
cdb.genc1(0xFF,rm,FLswitch,0); // JMP [CS:]disp[idxreg]
cdb.last()->IEV1.Vswitch = b;
cdb.last()->Iflags |= csseg ? CFcs : 0; // segment override
}
else
assert(0);
cgstate.stackclean--;
return;
}
/*************************************************************************/
{
/* Scan a table of case values, and jump to corresponding address.
* Since it relies on REPNE SCASW, it has really nothing to recommend it
* over Lifthen for 32 and 64 bit code.
* Note that it has not been tested with MACHOBJ (OSX).
*/
Lswitch:
regm_t retregs = mAX; // SCASW requires AX
if (dword)
retregs |= mDX;
else if (ncases <= 6 || config.flags4 & CFG4speed)
goto Lifthen;
scodelem(cdb,e,&retregs,0,TRUE);
if (dword && mswsame)
{ /* CMP DX,MSW */
cdb.genc2(0x81,modregrm(3,7,DX),msw);
genjmp(cdb,JNE,FLblock,b->nthSucc(0)); // JNE default
}
getregs(cdb,mCX|mDI);
#if TARGET_LINUX || TARGET_OSX || TARGET_FREEBSD || TARGET_OPENBSD || TARGET_DRAGONFLYBSD || TARGET_SOLARIS
if (config.flags3 & CFG3pic)
{ // Add in GOT
getregs(cdb,mDX);
cdb.genc2(CALL,0,0); // CALL L1
cdb.gen1(0x58 + DI); // L1: POP EDI
// ADD EDI,_GLOBAL_OFFSET_TABLE_+3
Symbol *gotsym = Obj::getGOTsym();
cdb.gencs(0x81,modregrm(3,0,DI),FLextern,gotsym);
cdb.last()->Iflags = CFoff;
cdb.last()->IEVoffset2 = 3;
makeitextern(gotsym);
genmovreg(cdb, DX, DI); // MOV EDX, EDI
// ADD EDI,offset of switch table
cdb.gencs(0x81,modregrm(3,0,DI),FLswitch,NULL);
cdb.last()->IEV2.Vswitch = b;
}
else
#endif
{
// MOV DI,offset of switch table
cdb.gencs(0xC7,modregrm(3,0,DI),FLswitch,NULL);
cdb.last()->IEV2.Vswitch = b;
}
movregconst(cdb,CX,ncases,0); // MOV CX,ncases
/* The switch table will be accessed through ES:DI.
* Therefore, load ES with proper segment value.
*/
if (config.flags3 & CFG3eseqds)
{
assert(!csseg);
getregs(cdb,mCX); // allocate CX
}
else
{
getregs(cdb,mES|mCX); // allocate ES and CX
cdb.gen1(csseg ? 0x0E : 0x1E); // PUSH CS/DS
cdb.gen1(0x07); // POP ES
}
targ_size_t disp = (ncases - 1) * intsize; // displacement to jump table
if (dword && !mswsame)
{
/* Build the following:
L1: SCASW
JNE L2
CMP DX,[CS:]disp[DI]
L2: LOOPNE L1
*/
const int mod = (disp > 127) ? 2 : 1; // displacement size
code *cloop = genc2(CNIL,0xE0,0,-7 - mod - csseg); // LOOPNE scasw
cdb.gen1(0xAF); // SCASW
code_orflag(cdb.last(),CFtarg2); // target of jump
genjmp(cdb,JNE,FLcode,(block *) cloop); // JNE loop
// CMP DX,[CS:]disp[DI]
cdb.genc1(0x39,modregrm(mod,DX,5),FLconst,disp);
cdb.last()->Iflags |= csseg ? CFcs : 0; // possible seg override
cdb.append(cloop);
disp += ncases * intsize; // skip over msw table
}
else
{
cdb.gen1(0xF2); // REPNE
cdb.gen1(0xAF); // SCASW
}
genjmp(cdb,JNE,FLblock,b->nthSucc(0)); // JNE default
const int mod = (disp > 127) ? 2 : 1; // 1 or 2 byte displacement
if (csseg)
cdb.gen1(SEGCS); // table is in code segment
#if TARGET_LINUX || TARGET_OSX || TARGET_FREEBSD || TARGET_OPENBSD || TARGET_DRAGONFLYBSD || TARGET_SOLARIS
if (config.flags3 & CFG3pic)
{ // ADD EDX,(ncases-1)*2[EDI]
cdb.genc1(0x03,modregrm(mod,DX,7),FLconst,disp);
// JMP EDX
cdb.gen2(0xFF,modregrm(3,4,DX));
}
else
#endif
{ // JMP (ncases-1)*2[DI]
cdb.genc1(0xFF,modregrm(mod,4,(I32 ? 7 : 5)),FLconst,disp);
cdb.last()->Iflags |= csseg ? CFcs : 0;
}
b->Btablesize = disp + intsize + ncases * tysize(TYnptr);
//assert(b->Bcode);
cgstate.stackclean--;
return;
}
}
/******************************
* Output data block for a jump table (BCjmptab).
* The 'holes' in the table get filled with the
* default label.
*/
void outjmptab(block *b)
{
#if JMPJMPTABLE
if (I32)
return;
#endif
targ_llong *p = b->BS.Bswitch; // pointer to case data
size_t ncases = *p++; // number of cases
/* Find vmin and vmax, the range of the table will be [vmin .. vmax + 1]
* Must be same computation as used in doswitch().
*/
targ_llong vmax = MINLL; // smallest possible llong
targ_llong vmin = MAXLL; // largest possible llong
for (size_t n = 0; n < ncases; n++) // find min case value
{ targ_llong val = p[n];
if (val > vmax) vmax = val;
if (val < vmin) vmin = val;
}
if (vmin > 0 && vmin <= intsize)
vmin = 0;
assert(vmin <= vmax);
/* Segment and offset into which the jump table will be emitted
*/
int jmpseg = objmod->jmpTableSegment(funcsym_p);
targ_size_t *poffset = &Offset(jmpseg);
/* Align start of jump table
*/
targ_size_t alignbytes = _align(0,*poffset) - *poffset;
objmod->lidata(jmpseg,*poffset,alignbytes);
assert(*poffset == b->Btableoffset); // should match precomputed value
symbol *gotsym = NULL;
targ_size_t def = b->nthSucc(0)->Boffset; // default address
for (targ_llong u = vmin; ; u++)
{ targ_size_t targ = def; // default
for (size_t n = 0; n < ncases; n++)
{ if (p[n] == u)
{ targ = b->nthSucc(n + 1)->Boffset;
break;
}
}
#if TARGET_LINUX || TARGET_FREEBSD || TARGET_OPENBSD || TARGET_DRAGONFLYBSD || TARGET_SOLARIS
if (I64)
{
if (config.flags3 & CFG3pic)
{
objmod->reftodatseg(jmpseg,*poffset,targ + (u - vmin) * 4,funcsym_p->Sseg,CFswitch);
*poffset += 4;
}
else
{
objmod->reftodatseg(jmpseg,*poffset,targ,funcsym_p->Sxtrnnum,CFoffset64 | CFswitch);
*poffset += 8;
}
}
else
{
if (config.flags3 & CFG3pic)
{
assert(config.flags & CFGromable);
// Want a GOTPC fixup to _GLOBAL_OFFSET_TABLE_
if (!gotsym)
gotsym = Obj::getGOTsym();
objmod->reftoident(jmpseg,*poffset,gotsym,*poffset - targ,CFswitch);
}
else
objmod->reftocodeseg(jmpseg,*poffset,targ);
*poffset += 4;
}
#elif TARGET_OSX
targ_size_t val;
if (I64)
val = targ - b->Btableoffset;
else
val = targ - b->Btablebase;
objmod->write_bytes(SegData[jmpseg],4,&val);
#elif TARGET_WINDOS
if (I64)
{
targ_size_t val = targ - b->Btableoffset;
objmod->write_bytes(SegData[jmpseg],4,&val);
}
else
{
objmod->reftocodeseg(jmpseg,*poffset,targ);
*poffset += tysize(TYnptr);
}
#else
assert(0);
#endif
if (u == vmax) // for case that (vmax == ~0)
break;
}
}
/******************************
* Output data block for a switch table.
* Two consecutive tables, the first is the case value table, the
* second is the address table.
*/
void outswitab(block *b)
{
//printf("outswitab()\n");
targ_llong *p = b->BS.Bswitch; // pointer to case data
unsigned ncases = *p++; // number of cases
const int seg = objmod->jmpTableSegment(funcsym_p);
targ_size_t *poffset = &Offset(seg);
targ_size_t offset = *poffset;
targ_size_t alignbytes = _align(0,*poffset) - *poffset;
objmod->lidata(seg,*poffset,alignbytes); // any alignment bytes necessary
assert(*poffset == offset + alignbytes);
unsigned sz = intsize;
assert(SegData[seg]->SDseg == seg);
for (unsigned n = 0; n < ncases; n++) // send out value table
{
//printf("\tcase %d, offset = x%x\n", n, *poffset);
objmod->write_bytes(SegData[seg],sz,p);
p++;
}
offset += alignbytes + sz * ncases;
assert(*poffset == offset);
if (b->Btablesize == ncases * (REGSIZE * 2 + tysize(TYnptr)))
{
// Send out MSW table
p -= ncases;
for (unsigned n = 0; n < ncases; n++)
{
targ_size_t val = MSREG(*p);
p++;
objmod->write_bytes(SegData[seg],REGSIZE,&val);
}
offset += REGSIZE * ncases;
assert(*poffset == offset);
}
list_t bl = b->Bsucc;
for (unsigned n = 0; n < ncases; n++) // send out address table
{ bl = list_next(bl);
objmod->reftocodeseg(seg,*poffset,list_block(bl)->Boffset);
*poffset += tysize(TYnptr);
}
assert(*poffset == offset + ncases * tysize(TYnptr));
}
/*****************************
* Return a jump opcode relevant to the elem for a JMP TRUE.
*/
int jmpopcode(elem *e)
{ tym_t tym;
int zero,i,jp,op;
static const char jops[][2][6] =
{ /* <= > < >= == != <=0 >0 <0 >=0 ==0 !=0 */
{ {JLE,JG ,JL ,JGE,JE ,JNE},{JLE,JG ,JS ,JNS,JE ,JNE} }, /* signed */
{ {JBE,JA ,JB ,JAE,JE ,JNE},{JE ,JNE,JB ,JAE,JE ,JNE} }, /* unsigned */
#if 0
{ {JLE,JG ,JL ,JGE,JE ,JNE},{JLE,JG ,JL ,JGE,JE ,JNE} }, /* real */
{ {JBE,JA ,JB ,JAE,JE ,JNE},{JBE,JA ,JB ,JAE,JE ,JNE} }, /* 8087 */
{ {JA ,JBE,JAE,JB ,JE ,JNE},{JBE,JA ,JB ,JAE,JE ,JNE} }, /* 8087 R */
#endif
};
enum
{
XP = (JP << 8),
XNP = (JNP << 8),
};
static const unsigned jfops[1][26] =
/* le gt lt ge eqeq ne unord lg leg ule ul uge */
{
{ XNP|JBE,JA,XNP|JB,JAE,XNP|JE, XP|JNE,JP, JNE,JNP, JBE,JC,XP|JAE,
/* ug ue ngt nge nlt nle ord nlg nleg nule nul nuge nug nue */
XP|JA,JE,JBE,JB, XP|JAE,XP|JA, JNP,JE, JP, JA, JNC,XNP|JB, XNP|JBE,JNE }, /* 8087 */
};
assert(e);
while (e->Eoper == OPcomma ||
/* The !EOP(e->E1) is to line up with the case in cdeq() where */
/* we decide if mPSW is passed on when evaluating E2 or not. */
(e->Eoper == OPeq && !EOP(e->E1)))
e = e->E2; /* right operand determines it */
op = e->Eoper;
tym_t tymx = tybasic(e->Ety);
bool needsNanCheck = tyfloating(tymx) && config.inline8087 &&
(tymx == TYldouble || tymx == TYildouble || tymx == TYcldouble ||
tymx == TYcdouble || tymx == TYcfloat ||
op == OPind ||
(OTcall(op) && (regmask(tymx, tybasic(e->E1->Eoper)) & (mST0 | XMMREGS))));
if (e->Ecount != e->Ecomsub) // comsubs just get Z bit set
{
if (needsNanCheck) // except for floating point values that need a NaN check
return XP|JNE;
else
return JNE;
}
if (!OTrel(op)) // not relational operator
{
if (needsNanCheck)
return XP|JNE;
if (op == OPu32_64) { e = e->E1; op = e->Eoper; }
if (op == OPu16_32) { e = e->E1; op = e->Eoper; }
if (op == OPu8_16) op = e->E1->Eoper;
return ((op >= OPbt && op <= OPbts) || op == OPbtst) ? JC : JNE;
}
if (e->E2->Eoper == OPconst)
zero = !boolres(e->E2);
else
zero = 0;
tym = e->E1->Ety;
if (tyfloating(tym))
#if 1
{ i = 0;
if (config.inline8087)
{ i = 1;
#if 1
if (rel_exception(op) || config.flags4 & CFG4fastfloat)
{
const bool NOSAHF = (I64 || config.fpxmmregs);
if (zero)
{
if (NOSAHF)
op = swaprel(op);
}
else if (NOSAHF)
op = swaprel(op);
else if (cmporder87(e->E2))
op = swaprel(op);
else
;
}
else
{
if (zero && config.target_cpu < TARGET_80386)
;
else
op = swaprel(op);
}
#else
if (zero && !rel_exception(op) && config.target_cpu >= TARGET_80386)
op = swaprel(op);
else if (!zero &&
(cmporder87(e->E2) || !(rel_exception(op) || config.flags4 & CFG4fastfloat)))
/* compare is reversed */
op = swaprel(op);
#endif
}
jp = jfops[0][op - OPle];
goto L1;
}
#else
i = (config.inline8087) ? (3 + cmporder87(e->E2)) : 2;
#endif
else if (tyuns(tym) || tyuns(e->E2->Ety))
i = 1;
else if (tyintegral(tym) || typtr(tym))
i = 0;
else
{
#if DEBUG
elem_print(e);
WRTYxx(tym);
#endif
assert(0);
}
jp = jops[i][zero][op - OPle]; /* table starts with OPle */
/* Try to rewrite unsigned comparisons so they rely on just the Carry flag
*/
if (i == 1 && (jp == JA || jp == JBE) &&
(e->E2->Eoper != OPconst && e->E2->Eoper != OPrelconst))
{
jp = (jp == JA) ? JC : JNC;
}
L1:
#if DEBUG
if ((jp & 0xF0) != 0x70)
{
WROP(op);
printf("i %d zero %d op x%x jp x%x\n",i,zero,op,jp);
}
#endif
assert((jp & 0xF0) == 0x70);
return jp;
}
/**********************************
* Append code to cdb which validates pointer described by
* addressing mode in *pcs. Modify addressing mode in *pcs.
* Params:
* cdb = append generated code to this
* pcs = original addressing mode to be updated
* keepmsk = mask of registers we must not destroy or use
* if (keepmsk & RMstore), this will be only a store operation
* into the lvalue
*/
void cod3_ptrchk(CodeBuilder& cdb,code *pcs,regm_t keepmsk)
{
unsigned char sib;
unsigned reg;
unsigned flagsave;
unsigned opsave;
assert(!I64);
if (!I16 && pcs->Iflags & (CFes | CFss | CFcs | CFds | CFfs | CFgs))
return; // not designed to deal with 48 bit far pointers
unsigned char rm = pcs->Irm;
assert(!(rm & 0x40)); // no disp8 or reg addressing modes
// If the addressing mode is already a register
reg = rm & 7;
if (I16)
{ static const unsigned char imode[8] = { BP,BP,BP,BP,SI,DI,BP,BX };
reg = imode[reg]; // convert [SI] to SI, etc.
}
regm_t idxregs = mask[reg];
if ((rm & 0x80 && (pcs->IFL1 != FLoffset || pcs->IEV1.Vuns)) ||
!(idxregs & ALLREGS)
)
{
// Load the offset into a register, so we can push the address
idxregs = (I16 ? IDXREGS : ALLREGS) & ~keepmsk; // only these can be index regs
assert(idxregs);
allocreg(cdb,&idxregs,®,TYoffset);
opsave = pcs->Iop;
flagsave = pcs->Iflags;
pcs->Iop = LEA;
pcs->Irm |= modregrm(0,reg,0);
pcs->Iflags &= ~(CFopsize | CFss | CFes | CFcs); // no prefix bytes needed
cdb.gen(pcs); // LEA reg,EA
pcs->Iflags = flagsave;
pcs->Iop = opsave;
}
// registers destroyed by the function call
//used = (mBP | ALLREGS | mES) & ~fregsaved;
regm_t used = 0; // much less code generated this way
code *cs2 = CNIL;
regm_t tosave = used & (keepmsk | idxregs);
for (int i = 0; tosave; i++)
{ regm_t mi = mask[i];
assert(i < REGMAX);
if (mi & tosave) /* i = register to save */
{
int push,pop;
stackchanged = 1;
if (i == ES)
{ push = 0x06;
pop = 0x07;
}
else
{ push = 0x50 + i;
pop = push | 8;
}
cdb.gen1(push); // PUSH i
cs2 = cat(gen1(CNIL,pop),cs2); // POP i
tosave &= ~mi;
}
}
// For 16 bit models, push a far pointer
if (I16)
{ int segreg;
switch (pcs->Iflags & (CFes | CFss | CFcs | CFds | CFfs | CFgs))
{ case CFes: segreg = 0x06; break;
case CFss: segreg = 0x16; break;
case CFcs: segreg = 0x0E; break;
case 0: segreg = 0x1E; break; // DS
default:
assert(0);
}
// See if we should default to SS:
// (Happens when BP is part of the addressing mode)
if (segreg == 0x1E && (rm & 0xC0) != 0xC0 &&
rm & 2 && (rm & 7) != 7)
{ segreg = 0x16;
if (config.wflags & WFssneds)
pcs->Iflags |= CFss; // because BP won't be there anymore
}
cdb.gen1(segreg); // PUSH segreg
}
cdb.gen1(0x50 + reg); // PUSH reg
// Rewrite the addressing mode in *pcs so it is just 0[reg]
setaddrmode(pcs, idxregs);
pcs->IFL1 = FLoffset;
pcs->IEV1.Vuns = 0;
// Call the validation function
{
makeitextern(getRtlsym(RTLSYM_PTRCHK));
used &= ~(keepmsk | idxregs); // regs destroyed by this exercise
getregs(cdb,used);
// CALL __ptrchk
cdb.gencs((LARGECODE) ? 0x9A : CALL,0,FLfunc,getRtlsym(RTLSYM_PTRCHK));
}
cdb.append(cs2);
}
/***********************************
* Determine if BP can be used as a general purpose register.
* Note parallels between this routine and prolog().
* Returns:
* 0 can't be used, needed for frame
* mBP can be used
*/
regm_t cod3_useBP()
{
tym_t tym;
tym_t tyf;
// Note that DOSX memory model cannot use EBP as a general purpose
// register, as SS != DS.
if (!(config.exe & EX_flat) || config.flags & (CFGalwaysframe | CFGnoebp))
goto Lcant;
if (anyiasm)
goto Lcant;
tyf = funcsym_p->ty();
if (tyf & mTYnaked) // if no prolog/epilog for function
goto Lcant;
if (funcsym_p->Sfunc->Fflags3 & Ffakeeh)
{
goto Lcant; // need consistent stack frame
}
tym = tybasic(tyf);
if (tym == TYifunc)
goto Lcant;
stackoffsets(0);
localsize = Auto.offset + Fast.offset; // an estimate only
// if (localsize)
{
if (!(config.flags4 & CFG4speed) ||
config.target_cpu < TARGET_Pentium ||
tyfarfunc(tym) ||
config.flags & CFGstack ||
localsize >= 0x100 || // arbitrary value < 0x1000
(usednteh & (NTEH_try | NTEH_except | NTEHcpp | EHcleanup | EHtry | NTEHpassthru)) ||
calledFinally ||
Alloca.size
)
goto Lcant;
}
Lcan:
return mBP;
Lcant:
return 0;
}
/*************************************************
* Generate code segment to be used later to restore a cse
*/
bool cse_simple(code *c, elem *e)
{ regm_t regm;
unsigned reg;
int sz = tysize(e->Ety);
if (!I16 && // don't bother with 16 bit code
e->Eoper == OPadd &&
sz == REGSIZE &&
e->E2->Eoper == OPconst &&
e->E1->Eoper == OPvar &&
isregvar(e->E1,®m,®) &&
!(e->E1->EV.sp.Vsym->Sflags & SFLspill)
)
{
memset(c,0,sizeof(*c));
// Make this an LEA instruction
c->Iop = LEA;
buildEA(c,reg,-1,1,e->E2->EV.Vuns);
if (I64)
{ if (sz == 8)
c->Irex |= REX_W;
}
return true;
}
else if (e->Eoper == OPind &&
sz <= REGSIZE &&
e->E1->Eoper == OPvar &&
isregvar(e->E1,®m,®) &&
(I32 || I64 || regm & IDXREGS) &&
!(e->E1->EV.sp.Vsym->Sflags & SFLspill)
)
{
memset(c,0,sizeof(*c));
// Make this a MOV instruction
c->Iop = (sz == 1) ? 0x8A : 0x8B; // MOV reg,EA
buildEA(c,reg,-1,1,0);
if (sz == 2 && I32)
c->Iflags |= CFopsize;
else if (I64)
{ if (sz == 8)
c->Irex |= REX_W;
}
return true;
}
return false;
}
void gen_testcse(CodeBuilder& cdb, unsigned sz, targ_uns i)
{
cdb.genc(sz == 1 ? 0x80 : 0x81,modregrm(2,7,BPRM),
FLcs,i, FLconst,(targ_uns) 0);
if ((I64 || I32) && sz == 2)
cdb.last()->Iflags |= CFopsize;
if (I64 && sz == 8)
code_orrex(cdb.last(), REX_W);
}
void gen_loadcse(CodeBuilder& cdb, unsigned reg, targ_uns i)
{
unsigned op = 0x8B;
if (reg == ES)
{
op = 0x8E;
reg = 0;
}
cdb.genc1(op,modregxrm(2,reg,BPRM),FLcs,i);
if (I64)
code_orrex(cdb.last(), REX_W);
}
/***************************************
* Gen code for OPframeptr
*/
void cdframeptr(CodeBuilder& cdb, elem *e, regm_t *pretregs)
{
regm_t retregs = *pretregs & allregs;
if (!retregs)
retregs = allregs;
unsigned reg;
allocreg(cdb,&retregs, ®, TYint);
code cs;
cs.Iop = ESCAPE | ESCframeptr;
cs.Iflags = 0;
cs.Irex = 0;
cs.Irm = reg;
cdb.gen(&cs);
fixresult(cdb,e,retregs,pretregs);
}
/***************************************
* Gen code for load of _GLOBAL_OFFSET_TABLE_.
* This value gets cached in the local variable 'localgot'.
*/
void cdgot(CodeBuilder& cdb, elem *e, regm_t *pretregs)
{
#if TARGET_OSX
regm_t retregs = *pretregs & allregs;
if (!retregs)
retregs = allregs;
unsigned reg;
allocreg(cdb,&retregs, ®, TYnptr);
cdb.genc(CALL,0,0,0,FLgot,0); // CALL L1
cdb.gen1(0x58 + reg); // L1: POP reg
fixresult(cdb,e,retregs,pretregs);
#elif TARGET_LINUX || TARGET_FREEBSD || TARGET_OPENBSD || TARGET_DRAGONFLYBSD || TARGET_SOLARIS
regm_t retregs = *pretregs & allregs;
if (!retregs)
retregs = allregs;
unsigned reg;
allocreg(cdb,&retregs, ®, TYnptr);
cdb.genc2(CALL,0,0); // CALL L1
cdb.gen1(0x58 + reg); // L1: POP reg
// ADD reg,_GLOBAL_OFFSET_TABLE_+3
symbol *gotsym = Obj::getGOTsym();
cdb.gencs(0x81,modregrm(3,0,reg),FLextern,gotsym);
/* Because the 2:3 offset from L1: is hardcoded,
* this sequence of instructions must not
* have any instructions in between,
* so set CFvolatile to prevent the scheduler from rearranging it.
*/
code *cgot = cdb.last();
cgot->Iflags = CFoff | CFvolatile;
cgot->IEVoffset2 = (reg == AX) ? 2 : 3;
makeitextern(gotsym);
fixresult(cdb,e,retregs,pretregs);
#else
assert(0);
#endif
}
/**************************************************
* Load contents of localgot into EBX.
*/
void load_localgot(CodeBuilder& cdb)
{
#if TARGET_LINUX || TARGET_FREEBSD || TARGET_OPENBSD || TARGET_DRAGONFLYBSD || TARGET_SOLARIS
if (config.flags3 & CFG3pic && I32)
{
if (localgot && !(localgot->Sflags & SFLdead))
{
localgot->Sflags &= ~GTregcand; // because this hack doesn't work with reg allocator
elem *e = el_var(localgot);
regm_t retregs = mBX;
codelem(cdb,e,&retregs,FALSE);
el_free(e);
}
else
{
elem *e = el_long(TYnptr, 0);
e->Eoper = OPgot;
regm_t retregs = mBX;
codelem(cdb,e,&retregs,FALSE);
el_free(e);
}
}
#endif
}
#if TARGET_LINUX || TARGET_OSX || TARGET_FREEBSD || TARGET_OPENBSD || TARGET_DRAGONFLYBSD || TARGET_SOLARIS
/*****************************
* Returns:
* # of bytes stored
*/
STATIC int obj_namestring(char *p,const char *name)
{
size_t len = strlen(name);
if (len > 255)
{
short *ps = (short *)p;
p[0] = 0xFF;
p[1] = 0;
ps[1] = len;
memcpy(p + 4,name,len);
const int ONS_OHD = 4; // max # of extra bytes added by obj_namestring()
len += ONS_OHD;
}
else
{ p[0] = len;
memcpy(p + 1,name,len);
len++;
}
return len;
}
#endif
void genregs(CodeBuilder& cdb,unsigned op,unsigned dstreg,unsigned srcreg)
{ return cdb.gen2(op,modregxrmx(3,dstreg,srcreg)); }
void gentstreg(CodeBuilder& cdb, unsigned t)
{
cdb.gen2(0x85,modregxrmx(3,t,t)); // TEST t,t
code_orflag(cdb.last(),CFpsw);
}
void genpush(CodeBuilder& cdb, unsigned reg)
{
cdb.gen1(0x50 + (reg & 7));
if (reg & 8)
code_orrex(cdb.last(), REX_B);
}
void genpop(CodeBuilder& cdb, unsigned reg)
{
cdb.gen1(0x58 + (reg & 7));
if (reg & 8)
code_orrex(cdb.last(), REX_B);
}
/**************************
* Generate a MOV to save a register to a stack slot
*/
void gensavereg(CodeBuilder& cdb, unsigned& reg, targ_uns slot)
{
// MOV i[BP],reg
unsigned op = 0x89; // normal mov
if (reg == ES)
{ reg = 0; // the real reg number
op = 0x8C; // segment reg mov
}
cdb.genc1(op,modregxrm(2, reg, BPRM),FLcs,slot);
if (I64)
code_orrex(cdb.last(), REX_W);
}
/**************************
* Generate a MOV to,from register instruction.
* Smart enough to dump redundant register moves, and segment
* register moves.
*/
code *genmovreg(unsigned to,unsigned from)
{
CodeBuilder cdb;
genmovreg(cdb, to, from);
return cdb.finish();
}
void genmovreg(CodeBuilder& cdb,unsigned to,unsigned from)
{
#if DEBUG
if (to > ES || from > ES)
printf("genmovreg(to = %d, from = %d)\n",to,from);
#endif
assert(to <= ES && from <= ES);
if (to != from)
{
if (to == ES)
genregs(cdb,0x8E,0,from);
else if (from == ES)
genregs(cdb,0x8C,0,to);
else
genregs(cdb,0x89,from,to);
if (I64)
code_orrex(cdb.last(), REX_W);
}
}
/***************************************
* Generate immediate multiply instruction for r1=r2*imm.
* Optimize it into LEA's if we can.
*/
void genmulimm(CodeBuilder& cdb,unsigned r1,unsigned r2,targ_int imm)
{
// These optimizations should probably be put into pinholeopt()
switch (imm)
{
case 1:
genmovreg(cdb,r1,r2);
break;
case 5:
{
code cs;
cs.Iop = LEA;
cs.Iflags = 0;
cs.Irex = 0;
buildEA(&cs,r2,r2,4,0);
cs.orReg(r1);
cdb.gen(&cs);
break;
}
default:
cdb.genc2(0x69,modregxrmx(3,r1,r2),imm); // IMUL r1,r2,imm
break;
}
}
/******************************
* Load CX with the value of _AHSHIFT.
*/
void genshift(CodeBuilder& cdb)
{
#if SCPP && TX86
// Set up ahshift to trick ourselves into giving the right fixup,
// which must be seg-relative, external frame, external target.
cdb.gencs(0xC7,modregrm(3,0,CX),FLfunc,getRtlsym(RTLSYM_AHSHIFT));
cdb.last()->Iflags |= CFoff;
#else
assert(0);
#endif
}
/******************************
* Move constant value into reg.
* Take advantage of existing values in registers.
* If flags & mPSW
* set flags based on result
* Else if flags & 8
* do not disturb flags
* Else
* don't care about flags
* If flags & 1 then byte move
* If flags & 2 then short move (for I32 and I64)
* If flags & 4 then don't disturb unused portion of register
* If flags & 16 then reg is a byte register AL..BH
* If flags & 64 (0x40) then 64 bit move (I64 only)
* Returns:
* code (if any) generated
*/
void movregconst(CodeBuilder& cdb,unsigned reg,targ_size_t value,regm_t flags)
{ unsigned r;
regm_t mreg;
//printf("movregconst(reg=%s, value= %lld (%llx), flags=%x)\n", regm_str(mask[reg]), value, value, flags);
regm_t regm = regcon.immed.mval & mask[reg];
targ_size_t regv = regcon.immed.value[reg];
if (flags & 1) // 8 bits
{
value &= 0xFF;
regm &= BYTEREGS;
// If we already have the right value in the right register
if (regm && (regv & 0xFF) == value)
goto L2;
if (flags & 16 && reg & 4 && // if an H byte register
regcon.immed.mval & mask[reg & 3] &&
(((regv = regcon.immed.value[reg & 3]) >> 8) & 0xFF) == value)
goto L2;
/* Avoid byte register loads on Pentium Pro and Pentium II
* to avoid dependency stalls.
*/
if (config.flags4 & CFG4speed &&
config.target_cpu >= TARGET_PentiumPro && !(flags & 4))
goto L3;
// See if another register has the right value
r = 0;
for (mreg = (regcon.immed.mval & BYTEREGS); mreg; mreg >>= 1)
{
if (mreg & 1)
{
if ((regcon.immed.value[r] & 0xFF) == value)
{ genregs(cdb,0x8A,reg,r); // MOV regL,rL
if (I64 && reg >= 4 || r >= 4)
code_orrex(cdb.last(), REX);
goto L2;
}
if (!(I64 && reg >= 4) &&
r < 4 && ((regcon.immed.value[r] >> 8) & 0xFF) == value)
{ genregs(cdb,0x8A,reg,r | 4); // MOV regL,rH
goto L2;
}
}
r++;
}
if (value == 0 && !(flags & 8))
{
if (!(flags & 4) && // if we can set the whole register
!(flags & 16 && reg & 4)) // and reg is not an H register
{ genregs(cdb,0x31,reg,reg); // XOR reg,reg
regimmed_set(reg,value);
regv = 0;
}
else
genregs(cdb,0x30,reg,reg); // XOR regL,regL
flags &= ~mPSW; // flags already set by XOR
}
else
{ cdb.genc2(0xC6,modregrmx(3,0,reg),value); // MOV regL,value
if (reg >= 4 && I64)
{
code_orrex(cdb.last(), REX);
}
}
L2:
if (flags & mPSW)
genregs(cdb,0x84,reg,reg); // TEST regL,regL
if (regm)
// Set just the 'L' part of the register value
regimmed_set(reg,(regv & ~(targ_size_t)0xFF) | value);
else if (flags & 16 && reg & 4 && regcon.immed.mval & mask[reg & 3])
// Set just the 'H' part of the register value
regimmed_set((reg & 3),(regv & ~(targ_size_t)0xFF00) | (value << 8));
return;
}
L3:
if (I16)
value = (targ_short) value; // sign-extend MSW
else if (I32)
value = (targ_int) value;
if (!I16 && flags & 2) // load 16 bit value
{
value &= 0xFFFF;
if (value == 0)
goto L1;
else
{
if (flags & mPSW)
goto L1;
cdb.genc2(0xC7,modregrmx(3,0,reg),value); // MOV reg,value
cdb.last()->Iflags |= CFopsize; // yes, even for I64
if (regm)
// High bits of register are not affected by 16 bit load
regimmed_set(reg,(regv & ~(targ_size_t)0xFFFF) | value);
}
return;
}
L1:
// If we already have the right value in the right register
if (regm && (regv & 0xFFFFFFFF) == (value & 0xFFFFFFFF) && !(flags & 64))
{ if (flags & mPSW)
gentstreg(cdb,reg);
}
else if (flags & 64 && regm && regv == value)
{ // Look at the full 64 bits
if (flags & mPSW)
{
gentstreg(cdb,reg);
code_orrex(cdb.last(), REX_W);
}
}
else
{
if (flags & mPSW)
{
switch (value)
{ case 0:
genregs(cdb,0x31,reg,reg);
break;
case 1:
if (I64)
goto L4;
genregs(cdb,0x31,reg,reg);
goto inc;
case ~(targ_size_t)0:
if (I64)
goto L4;
genregs(cdb,0x31,reg,reg);
goto dec;
default:
L4:
if (flags & 64)
{
cdb.genc2(0xB8 + (reg&7),REX_W << 16 | (reg&8) << 13,value); // MOV reg,value64
gentstreg(cdb,reg);
code_orrex(cdb.last(), REX_W);
}
else
{
value &= 0xFFFFFFFF;
cdb.genc2(0xB8 + (reg&7),(reg&8) << 13,value); // MOV reg,value
gentstreg(cdb,reg);
}
break;
}
}
else
{
// Look for single byte conversion
if (regcon.immed.mval & mAX)
{
if (I32)
{ if (reg == AX && value == (targ_short) regv)
{ cdb.gen1(0x98); // CWDE
goto done;
}
if (reg == DX &&
value == (regcon.immed.value[AX] & 0x80000000 ? 0xFFFFFFFF : 0) &&
!(config.flags4 & CFG4speed && config.target_cpu >= TARGET_Pentium)
)
{ cdb.gen1(0x99); // CDQ
goto done;
}
}
else if (I16)
{
if (reg == AX &&
(targ_short) value == (signed char) regv)
{ cdb.gen1(0x98); // CBW
goto done;
}
if (reg == DX &&
(targ_short) value == (regcon.immed.value[AX] & 0x8000 ? (targ_short) 0xFFFF : (targ_short) 0) &&
!(config.flags4 & CFG4speed && config.target_cpu >= TARGET_Pentium)
)
{ cdb.gen1(0x99); // CWD
goto done;
}
}
}
if (value == 0 && !(flags & 8) && config.target_cpu >= TARGET_80486)
{
genregs(cdb,0x31,reg,reg); // XOR reg,reg
goto done;
}
if (!I64 && regm && !(flags & 8))
{ if (regv + 1 == value ||
// Catch case of (0xFFFF+1 == 0) for 16 bit compiles
(I16 && (targ_short)(regv + 1) == (targ_short)value))
{
inc:
cdb.gen1(0x40 + reg); // INC reg
goto done;
}
if (regv - 1 == value)
{
dec:
cdb.gen1(0x48 + reg); // DEC reg
goto done;
}
}
// See if another register has the right value
r = 0;
for (mreg = regcon.immed.mval; mreg; mreg >>= 1)
{
#ifdef DEBUG
assert(!I16 || regcon.immed.value[r] == (targ_short)regcon.immed.value[r]);
#endif
if (mreg & 1 && regcon.immed.value[r] == value)
{ genmovreg(cdb,reg,r);
goto done;
}
r++;
}
if (value == 0 && !(flags & 8))
{
genregs(cdb,0x31,reg,reg); // XOR reg,reg
}
else
{ // See if we can just load a byte
if (regm & BYTEREGS &&
!(config.flags4 & CFG4speed && config.target_cpu >= TARGET_PentiumPro)
)
{
if ((regv & ~(targ_size_t)0xFF) == (value & ~(targ_size_t)0xFF))
{ movregconst(cdb,reg,value,(flags & 8) |4|1); // load regL
return;
}
if (regm & (mAX|mBX|mCX|mDX) &&
(regv & ~(targ_size_t)0xFF00) == (value & ~(targ_size_t)0xFF00) &&
!I64)
{ movregconst(cdb,4|reg,value >> 8,(flags & 8) |4|1|16); // load regH
return;
}
}
if (flags & 64)
cdb.genc2(0xB8 + (reg&7),REX_W << 16 | (reg&8) << 13,value); // MOV reg,value64
else
{
value &= 0xFFFFFFFF;
cdb.genc2(0xB8 + (reg&7),(reg&8) << 13,value); // MOV reg,value
}
}
}
done:
regimmed_set(reg,value);
}
}
/**************************
* Generate a jump instruction.
*/
void genjmp(CodeBuilder& cdb,unsigned op,unsigned fltarg,block *targ)
{
code cs;
cs.Iop = op & 0xFF;
cs.Iflags = 0;
cs.Irex = 0;
if (op != JMP && op != 0xE8) // if not already long branch
cs.Iflags = CFjmp16; // assume long branch for op = 0x7x
cs.IFL2 = fltarg; // FLblock (or FLcode)
cs.IEV2.Vblock = targ; // target block (or code)
if (fltarg == FLcode)
((code *)targ)->Iflags |= CFtarg;
if (config.flags4 & CFG4fastfloat) // if fast floating point
{
cdb.gen(&cs);
return;
}
switch (op & 0xFF00) // look at second jump opcode
{
// The JP and JNP come from floating point comparisons
case JP << 8:
cdb.gen(&cs);
cs.Iop = JP;
cdb.gen(&cs);
break;
case JNP << 8:
{
// Do a JP around the jump instruction
code *cnop = gennop(CNIL);
genjmp(cdb,JP,FLcode,(block *) cnop);
cdb.gen(&cs);
cdb.append(cnop);
break;
}
case 1 << 8: // toggled no jump
case 0 << 8:
cdb.gen(&cs);
break;
default:
#ifdef DEBUG
printf("jop = x%x\n",op);
#endif
assert(0);
}
}
/*********************************************
* Generate first part of prolog for interrupt function.
*/
void prolog_ifunc(CodeBuilder& cdb, tym_t* tyf)
{
static unsigned char ops2[] = { 0x60,0x1E,0x06,0 };
static unsigned char ops0[] = { 0x50,0x51,0x52,0x53,
0x54,0x55,0x56,0x57,
0x1E,0x06,0 };
unsigned char *p = (config.target_cpu >= TARGET_80286) ? ops2 : ops0;
do
cdb.gen1(*p);
while (*++p);
genregs(cdb,0x8B,BP,SP); // MOV BP,SP
if (localsize)
cod3_stackadj(cdb, localsize);
*tyf |= mTYloadds;
}
void prolog_ifunc2(CodeBuilder& cdb, tym_t tyf, tym_t tym, bool pushds)
{
/* Determine if we need to reload DS */
if (tyf & mTYloadds)
{
if (!pushds) // if not already pushed
cdb.gen1(0x1E); // PUSH DS
spoff += intsize;
cdb.genc(0xC7,modregrm(3,0,AX),0,0,FLdatseg,(targ_uns) 0); // MOV AX,DGROUP
code *c = cdb.last();
c->IEVseg2 = DATA;
c->Iflags ^= CFseg | CFoff; // turn off CFoff, on CFseg
cdb.gen2(0x8E,modregrm(3,3,AX)); // MOV DS,AX
useregs(mAX);
}
if (tym == TYifunc)
cdb.gen1(0xFC); // CLD
}
void prolog_16bit_windows_farfunc(CodeBuilder& cdb, tym_t* tyf, bool* pushds)
{
int wflags = config.wflags;
if (wflags & WFreduced && !(*tyf & mTYexport))
{ // reduced prolog/epilog for non-exported functions
wflags &= ~(WFdgroup | WFds | WFss);
}
getregsNoSave(mAX); // should not have any value in AX
int segreg;
switch (wflags & (WFdgroup | WFds | WFss))
{ case WFdgroup: // MOV AX,DGROUP
{
if (wflags & WFreduced)
*tyf &= ~mTYloadds; // remove redundancy
cdb.genc(0xC7,modregrm(3,0,AX),0,0,FLdatseg,(targ_uns) 0);
code *c = cdb.last();
c->IEVseg2 = DATA;
c->Iflags ^= CFseg | CFoff; // turn off CFoff, on CFseg
break;
}
case WFss:
segreg = 2; // SS
goto Lmovax;
case WFds:
segreg = 3; // DS
Lmovax:
cdb.gen2(0x8C,modregrm(3,segreg,AX)); // MOV AX,segreg
if (wflags & WFds)
cdb.gen1(0x90); // NOP
break;
case 0:
break;
default:
#ifdef DEBUG
printf("config.wflags = x%x\n",config.wflags);
#endif
assert(0);
}
if (wflags & WFincbp)
cdb.gen1(0x40 + BP); // INC BP
cdb.gen1(0x50 + BP); // PUSH BP
genregs(cdb,0x8B,BP,SP); // MOV BP,SP
if (wflags & (WFsaveds | WFds | WFss | WFdgroup))
{ cdb.gen1(0x1E); // PUSH DS
*pushds = true;
BPoff = -REGSIZE;
}
if (wflags & (WFds | WFss | WFdgroup))
cdb.gen2(0x8E,modregrm(3,3,AX)); // MOV DS,AX
}
/**********************************************
* Set up frame register.
* Input:
* *xlocalsize amount of local variables
* Output:
* *enter set to TRUE if ENTER instruction can be used, FALSE otherwise
* *xlocalsize amount to be subtracted from stack pointer
* *cfa_offset the frame pointer's offset from the CFA
* Returns:
* generated code
*/
void prolog_frame(CodeBuilder& cdb, unsigned farfunc, unsigned* xlocalsize, bool* enter, int* cfa_offset)
{
//printf("prolog_frame\n");
*cfa_offset = 0;
if (0 && config.exe == EX_WIN64)
{
// PUSH RBP
// LEA RBP,0[RSP]
cdb. gen1(0x50 + BP);
cdb.genc1(LEA,(REX_W<<16) | (modregrm(0,4,SP)<<8) | modregrm(2,BP,4),FLconst,0);
*enter = false;
return;
}
if (config.wflags & WFincbp && farfunc)
cdb.gen1(0x40 + BP); // INC BP
if (config.target_cpu < TARGET_80286 ||
config.exe & (EX_LINUX | EX_LINUX64 | EX_OSX | EX_OSX64 | EX_FREEBSD | EX_FREEBSD64 | EX_DRAGONFLYBSD64 | EX_SOLARIS | EX_SOLARIS64 | EX_WIN64) ||
!localsize ||
config.flags & CFGstack ||
(*xlocalsize >= 0x1000 && config.exe & EX_flat) ||
localsize >= 0x10000 ||
#if NTEXCEPTIONS == 2
(usednteh & (NTEH_try | NTEH_except | NTEHcpp | EHcleanup | EHtry | NTEHpassthru) && (config.ehmethod == EH_WIN32 && !(funcsym_p->Sfunc->Fflags3 & Feh_none) || config.ehmethod == EH_SEH)) ||
#endif
(config.target_cpu >= TARGET_80386 &&
config.flags4 & CFG4speed)
)
{
cdb.gen1(0x50 + BP); // PUSH BP
genregs(cdb,0x8B,BP,SP); // MOV BP,SP
if (I64)
code_orrex(cdb.last(), REX_W); // MOV RBP,RSP
if ((config.objfmt & (OBJ_ELF | OBJ_MACH)) && config.fulltypes)
// Don't reorder instructions, as dwarf CFA relies on it
code_orflag(cdb.last(), CFvolatile);
#if NTEXCEPTIONS == 2
if (usednteh & (NTEH_try | NTEH_except | NTEHcpp | EHcleanup | EHtry | NTEHpassthru) && (config.ehmethod == EH_WIN32 && !(funcsym_p->Sfunc->Fflags3 & Feh_none) || config.ehmethod == EH_SEH))
{
nteh_prolog(cdb);
int sz = nteh_contextsym_size();
assert(sz != 0); // should be 5*4, not 0
*xlocalsize -= sz; // sz is already subtracted from ESP
// by nteh_prolog()
}
#endif
if (config.fulltypes == CVDWARF_C || config.fulltypes == CVDWARF_D ||
config.ehmethod == EH_DWARF)
{ int off = 2 * REGSIZE; // 1 for the return address + 1 for the PUSH EBP
dwarf_CFA_set_loc(1); // address after PUSH EBP
dwarf_CFA_set_reg_offset(SP, off); // CFA is now 8[ESP]
dwarf_CFA_offset(BP, -off); // EBP is at 0[ESP]
dwarf_CFA_set_loc(I64 ? 4 : 3); // address after MOV EBP,ESP
/* Oddly, the CFA is not the same as the frame pointer,
* which is why the offset of BP is set to 8
*/
dwarf_CFA_set_reg_offset(BP, off); // CFA is now 0[EBP]
*cfa_offset = off; // remember the difference between the CFA and the frame pointer
}
*enter = false; /* do not use ENTER instruction */
}
else
*enter = true;
}
void prolog_frameadj(CodeBuilder& cdb, tym_t tyf, unsigned xlocalsize, bool enter, bool* pushalloc)
{
unsigned pushallocreg = (tyf == TYmfunc) ? CX : AX;
#if !TARGET_LINUX // seems that Linux doesn't need to fault in stack pages
if ((config.flags & CFGstack && !(I32 && xlocalsize < 0x1000)) // if stack overflow check
#if TARGET_WINDOS
|| (xlocalsize >= 0x1000 && config.exe & EX_flat)
#endif
)
{
if (I16)
{
// BUG: Won't work if parameter is passed in AX
movregconst(cdb,AX,xlocalsize,FALSE); // MOV AX,localsize
makeitextern(getRtlsym(RTLSYM_CHKSTK));
// CALL _chkstk
cdb.gencs((LARGECODE) ? 0x9A : CALL,0,FLfunc,getRtlsym(RTLSYM_CHKSTK));
useregs((ALLREGS | mBP | mES) & ~getRtlsym(RTLSYM_CHKSTK)->Sregsaved);
}
else
{
/* Watch out for 64 bit code where EDX is passed as a register parameter
*/
int reg = I64 ? R11 : DX; // scratch register
/* MOV EDX, xlocalsize/0x1000
* L1: SUB ESP, 0x1000
* TEST [ESP],ESP
* DEC EDX
* JNE L1
* SUB ESP, xlocalsize % 0x1000
*/
movregconst(cdb, reg, xlocalsize / 0x1000, FALSE);
cod3_stackadj(cdb, 0x1000);
code_orflag(cdb.last(), CFtarg2);
cdb.gen2sib(0x85, modregrm(0,SP,4),modregrm(0,4,SP));
if (I64)
{ cdb.gen2(0xFF, modregrmx(3,1,R11)); // DEC R11D
cdb.genc2(JNE,0,(targ_uns)-15);
}
else
{ cdb.gen1(0x48 + DX); // DEC EDX
cdb.genc2(JNE,0,(targ_uns)-12);
}
regimmed_set(reg,0); // reg is now 0
cod3_stackadj(cdb, xlocalsize & 0xFFF);
useregs(mask[reg]);
}
}
else
#endif
{
if (enter)
{ // ENTER xlocalsize,0
cdb.genc(0xC8,0,FLconst,xlocalsize,FLconst,(targ_uns) 0);
assert(!(config.fulltypes == CVDWARF_C || config.fulltypes == CVDWARF_D)); // didn't emit Dwarf data
}
else if (xlocalsize == REGSIZE && config.flags4 & CFG4optimized)
{ cdb. gen1(0x50 + pushallocreg); // PUSH AX
// Do this to prevent an -x[EBP] to be moved in
// front of the push.
code_orflag(cdb.last(),CFvolatile);
*pushalloc = true;
}
else
cod3_stackadj(cdb, xlocalsize);
}
}
void prolog_frameadj2(CodeBuilder& cdb, tym_t tyf, unsigned xlocalsize, bool* pushalloc)
{
unsigned pushallocreg = (tyf == TYmfunc) ? CX : AX;
if (xlocalsize == REGSIZE)
{ cdb.gen1(0x50 + pushallocreg); // PUSH AX
*pushalloc = true;
}
else if (xlocalsize == 2 * REGSIZE)
{ cdb.gen1(0x50 + pushallocreg); // PUSH AX
cdb.gen1(0x50 + pushallocreg); // PUSH AX
*pushalloc = true;
}
else
cod3_stackadj(cdb, xlocalsize);
}
void prolog_setupalloca(CodeBuilder& cdb)
{
// Set up magic parameter for alloca()
// MOV -REGSIZE[BP],localsize - BPoff
cdb.genc(0xC7,modregrm(2,0,BPRM),
FLconst,Alloca.offset + BPoff,
FLconst,localsize - BPoff);
if (I64)
code_orrex(cdb.last(), REX_W);
}
/**************************************
* Save registers that the function destroys,
* but that the ABI says should be preserved across
* function calls.
*
* Emit Dwarf info for these saves.
* Params:
* cdb = append generated instructions to this
* topush = mask of registers to push
* cfa_offset = offset of frame pointer from CFA
*/
void prolog_saveregs(CodeBuilder& cdb, regm_t topush, int cfa_offset)
{
if (pushoffuse)
{
// Save to preallocated section in the stack frame
int xmmtopush = numbitsset(topush & XMMREGS); // XMM regs take 16 bytes
int gptopush = numbitsset(topush) - xmmtopush; // general purpose registers to save
targ_size_t xmmoffset = pushoff + BPoff;
if (!hasframe)
xmmoffset += EBPtoESP;
targ_size_t gpoffset = xmmoffset + xmmtopush * 16;
while (topush)
{
unsigned reg = findreg(topush);
topush &= ~mask[reg];
if (reg >= XMM0)
{
if (hasframe)
{
// MOVUPD xmmoffset[EBP],xmm
cdb.genc1(STOUPD,modregxrm(2,reg-XMM0,BPRM),FLconst,xmmoffset);
}
else
{
// MOVUPD xmmoffset[ESP],xmm
cdb.genc1(STOUPD,modregxrm(2,reg-XMM0,4) + 256*modregrm(0,4,SP),FLconst,xmmoffset);
}
xmmoffset += 16;
}
else
{
if (hasframe)
{
// MOV gpoffset[EBP],reg
cdb.genc1(0x89,modregxrm(2,reg,BPRM),FLconst,gpoffset);
}
else
{
// MOV gpoffset[ESP],reg
cdb.genc1(0x89,modregxrm(2,reg,4) + 256*modregrm(0,4,SP),FLconst,gpoffset);
}
if (I64)
code_orrex(cdb.last(), REX_W);
if (config.fulltypes == CVDWARF_C || config.fulltypes == CVDWARF_D ||
config.ehmethod == EH_DWARF)
{ // Emit debug_frame data giving location of saved register
code *c = cdb.finish();
pinholeopt(c, NULL);
dwarf_CFA_set_loc(calcblksize(c)); // address after save
dwarf_CFA_offset(reg, gpoffset - cfa_offset);
cdb.reset();
cdb.append(c);
}
gpoffset += REGSIZE;
}
}
}
else
{
while (topush) /* while registers to push */
{
unsigned reg = findreg(topush);
topush &= ~mask[reg];
if (reg >= XMM0)
{
// SUB RSP,16
cod3_stackadj(cdb, 16);
// MOVUPD 0[RSP],xmm
cdb.genc1(STOUPD,modregxrm(2,reg-XMM0,4) + 256*modregrm(0,4,SP),FLconst,0);
EBPtoESP += 16;
spoff += 16;
}
else
{
genpush(cdb, reg);
EBPtoESP += REGSIZE;
spoff += REGSIZE;
if (config.fulltypes == CVDWARF_C || config.fulltypes == CVDWARF_D ||
config.ehmethod == EH_DWARF)
{ // Emit debug_frame data giving location of saved register
// relative to 0[EBP]
code *c = cdb.finish();
pinholeopt(c, NULL);
dwarf_CFA_set_loc(calcblksize(c)); // address after PUSH reg
dwarf_CFA_offset(reg, -EBPtoESP - REGSIZE - cfa_offset);
cdb.reset();
cdb.append(c);
}
}
}
}
}
/**************************************
* Undo prolog_saveregs()
*/
static void epilog_restoreregs(CodeBuilder& cdb, regm_t topop)
{
#ifdef DEBUG
if (topop & ~(XMMREGS | 0xFFFF))
printf("fregsaved = %s, mfuncreg = %s\n",regm_str(fregsaved),regm_str(mfuncreg));
#endif
assert(!(topop & ~(XMMREGS | 0xFFFF)));
if (pushoffuse)
{
// Save to preallocated section in the stack frame
int xmmtopop = numbitsset(topop & XMMREGS); // XMM regs take 16 bytes
int gptopop = numbitsset(topop) - xmmtopop; // general purpose registers to save
targ_size_t xmmoffset = pushoff + BPoff;
if (!hasframe)
xmmoffset += EBPtoESP;
targ_size_t gpoffset = xmmoffset + xmmtopop * 16;
while (topop)
{
unsigned reg = findreg(topop);
topop &= ~mask[reg];
if (reg >= XMM0)
{
if (hasframe)
{
// MOVUPD xmm,xmmoffset[EBP]
cdb.genc1(LODUPD,modregxrm(2,reg-XMM0,BPRM),FLconst,xmmoffset);
}
else
{
// MOVUPD xmm,xmmoffset[ESP]
cdb.genc1(LODUPD,modregxrm(2,reg-XMM0,4) + 256*modregrm(0,4,SP),FLconst,xmmoffset);
}
xmmoffset += 16;
}
else
{
if (hasframe)
{
// MOV reg,gpoffset[EBP]
cdb.genc1(0x8B,modregxrm(2,reg,BPRM),FLconst,gpoffset);
}
else
{
// MOV reg,gpoffset[ESP]
cdb.genc1(0x8B,modregxrm(2,reg,4) + 256*modregrm(0,4,SP),FLconst,gpoffset);
}
if (I64)
code_orrex(cdb.last(), REX_W);
gpoffset += REGSIZE;
}
}
}
else
{
unsigned reg = I64 ? XMM7 : DI;
if (!(topop & XMMREGS))
reg = R15;
regm_t regm = 1 << reg;
while (topop)
{ if (topop & regm)
{
if (reg >= XMM0)
{
// MOVUPD xmm,0[RSP]
cdb.genc1(LODUPD,modregxrm(2,reg-XMM0,4) + 256*modregrm(0,4,SP),FLconst,0);
// ADD RSP,16
cod3_stackadj(cdb, -16);
}
else
{
cdb.gen1(0x58 + (reg & 7)); // POP reg
if (reg & 8)
code_orrex(cdb.last(), REX_B);
}
topop &= ~regm;
}
regm >>= 1;
reg--;
}
}
}
#if SCPP
void prolog_trace(CodeBuilder& cdb, bool farfunc, unsigned* regsaved)
{
symbol *s = getRtlsym(farfunc ? RTLSYM_TRACE_PRO_F : RTLSYM_TRACE_PRO_N);
makeitextern(s);
cdb.gencs(I16 ? 0x9A : CALL,0,FLfunc,s); // CALL _trace
if (!I16)
code_orflag(cdb.last(),CFoff | CFselfrel);
/* Embedding the function name inline after the call works, but it
* makes disassembling the code annoying.
*/
#if ELFOBJ || MACHOBJ
// Generate length prefixed name that is recognized by profiler
size_t len = strlen(funcsym_p->Sident);
char *buffer = (char *)malloc(len + 4);
assert(buffer);
if (len <= 254)
{ buffer[0] = len;
memcpy(buffer + 1, funcsym_p->Sident, len);
len++;
}
else
{ buffer[0] = 0xFF;
buffer[1] = 0;
buffer[2] = len & 0xFF;
buffer[3] = len >> 8;
memcpy(buffer + 4, funcsym_p->Sident, len);
len += 4;
}
cdb.genasm(buffer, len); // append func name
free(buffer);
#else
char name[IDMAX+IDOHD+1];
size_t len = objmod->mangle(funcsym_p,name);
assert(len < sizeof(name));
cdb.genasm((char *)name,len); // append func name
#endif
*regsaved = s->Sregsaved;
}
#endif
void prolog_genvarargs(CodeBuilder& cdb, symbol* sv, regm_t* namedargs)
{
/* Generate code to move any arguments passed in registers into
* the stack variable __va_argsave,
* so we can reference it via pointers through va_arg().
* struct __va_argsave_t {
* size_t[6] regs;
* real[8] fpregs;
* uint offset_regs;
* uint offset_fpregs;
* void* stack_args;
* void* reg_args;
* }
* The MOVAPS instructions seg fault if data is not aligned on
* 16 bytes, so this gives us a nice check to ensure no mistakes.
MOV voff+0*8[RBP],EDI
MOV voff+1*8[RBP],ESI
MOV voff+2*8[RBP],RDX
MOV voff+3*8[RBP],RCX
MOV voff+4*8[RBP],R8
MOV voff+5*8[RBP],R9
MOVZX EAX,AL // AL = 0..8, # of XMM registers used
SHL EAX,2 // 4 bytes for each MOVAPS
LEA R11,offset L2[RIP]
SUB R11,RAX
LEA RAX,voff+6*8+0x7F[RBP]
JMP R11d
MOVAPS -0x0F[RAX],XMM7 // only save XMM registers if actually used
MOVAPS -0x1F[RAX],XMM6
MOVAPS -0x2F[RAX],XMM5
MOVAPS -0x3F[RAX],XMM4
MOVAPS -0x4F[RAX],XMM3
MOVAPS -0x5F[RAX],XMM2
MOVAPS -0x6F[RAX],XMM1
MOVAPS -0x7F[RAX],XMM0
L2:
MOV 1[RAX],offset_regs // set __va_argsave.offset_regs
MOV 5[RAX],offset_fpregs // set __va_argsave.offset_fpregs
LEA R11, Para.size+Para.offset[RBP]
MOV 9[RAX],R11 // set __va_argsave.stack_args
SUB RAX,6*8+0x7F // point to start of __va_argsave
MOV 6*8+8*16+4+4+8[RAX],RAX // set __va_argsave.reg_args
MOV RDX,R11
*/
targ_size_t voff = Auto.size + BPoff + sv->Soffset; // EBP offset of start of sv
const int vregnum = 6;
const unsigned vsize = vregnum * 8 + 8 * 16;
static unsigned char regs[vregnum] = { DI,SI,DX,CX,R8,R9 };
if (!hasframe)
voff += EBPtoESP;
for (int i = 0; i < vregnum; i++)
{
unsigned r = regs[i];
if (!(mask[r] & *namedargs)) // named args are already dealt with
{ unsigned ea = (REX_W << 16) | modregxrm(2,r,BPRM);
if (!hasframe)
ea = (REX_W << 16) | (modregrm(0,4,SP) << 8) | modregxrm(2,r,4);
cdb.genc1(0x89,ea,FLconst,voff + i*8);
}
}
genregs(cdb,0x0FB6,AX,AX); // MOVZX EAX,AL
cdb.genc2(0xC1,modregrm(3,4,AX),2); // SHL EAX,2
int raxoff = voff+6*8+0x7F;
unsigned L2offset = (raxoff < -0x7F) ? 0x2D : 0x2A;
if (!hasframe)
L2offset += 1; // +1 for sib byte
// LEA R11,offset L2[RIP]
cdb.genc1(LEA,(REX_W << 16) | modregxrm(0,R11,5),FLconst,L2offset);
genregs(cdb,0x29,AX,R11); // SUB R11,RAX
code_orrex(cdb.last(), REX_W);
// LEA RAX,voff+vsize-6*8-16+0x7F[RBP]
unsigned ea = (REX_W << 16) | modregrm(2,AX,BPRM);
if (!hasframe)
// add sib byte for [RSP] addressing
ea = (REX_W << 16) | (modregrm(0,4,SP) << 8) | modregxrm(2,AX,4);
cdb.genc1(LEA,ea,FLconst,raxoff);
cdb.gen2(0xFF,modregrmx(3,4,R11)); // JMP R11d
for (int i = 0; i < 8; i++)
{
// MOVAPS -15-16*i[RAX],XMM7-i
cdb.genc1(0x0F29,modregrm(0,XMM7-i,0),FLconst,-15-16*i);
}
/* Compute offset_regs and offset_fpregs
*/
unsigned offset_regs = 0;
unsigned offset_fpregs = vregnum * 8;
for (int i = AX; i <= XMM7; i++)
{ regm_t m = mask[i];
if (m & *namedargs)
{
if (m & (mDI|mSI|mDX|mCX|mR8|mR9))
offset_regs += 8;
else if (m & XMMREGS)
offset_fpregs += 16;
*namedargs &= ~m;
if (!*namedargs)
break;
}
}
// MOV 1[RAX],offset_regs
cdb.genc(0xC7,modregrm(2,0,AX),FLconst,1,FLconst,offset_regs);
// MOV 5[RAX],offset_fpregs
cdb.genc(0xC7,modregrm(2,0,AX),FLconst,5,FLconst,offset_fpregs);
// LEA R11, Para.size+Para.offset[RBP]
ea = modregxrm(2,R11,BPRM);
if (!hasframe)
ea = (modregrm(0,4,SP) << 8) | modregrm(2,DX,4);
Para.offset = (Para.offset + (REGSIZE - 1)) & ~(REGSIZE - 1);
cdb.genc1(LEA,(REX_W << 16) | ea,FLconst,Para.size + Para.offset);
// MOV 9[RAX],R11
cdb.genc1(0x89,(REX_W << 16) | modregxrm(2,R11,AX),FLconst,9);
// SUB RAX,6*8+0x7F // point to start of __va_argsave
cdb.genc2(0x2D,0,6*8+0x7F);
code_orrex(cdb.last(), REX_W);
// MOV 6*8+8*16+4+4+8[RAX],RAX // set __va_argsave.reg_args
cdb.genc1(0x89,(REX_W << 16) | modregrm(2,AX,AX),FLconst,6*8+8*16+4+4+8);
pinholeopt(cdb.peek(), NULL);
useregs(mAX|mR11);
}
void prolog_gen_win64_varargs(CodeBuilder& cdb)
{
/* The Microsoft scheme.
* http://msdn.microsoft.com/en-US/library/dd2wa36c(v=vs.80)
* Copy registers onto stack.
mov 8[RSP],RCX
mov 010h[RSP],RDX
mov 018h[RSP],R8
mov 020h[RSP],R9
*/
}
void prolog_loadparams(CodeBuilder& cdb, tym_t tyf, bool pushalloc, regm_t* namedargs)
{
//printf("prolog_loadparams()\n");
#ifdef DEBUG
for (SYMIDX si = 0; si < globsym.top; si++)
{ symbol *s = globsym.tab[si];
if (debugr && (s->Sclass == SCfastpar || s->Sclass == SCshadowreg))
{
printf("symbol '%s' is fastpar in register [%s,%s]\n", s->Sident,
regm_str(mask[s->Spreg]),
(s->Spreg2 == NOREG ? "NOREG" : regm_str(mask[s->Spreg2])));
if (s->Sfl == FLreg)
printf("\tassigned to register %s\n", regm_str(mask[s->Sreglsw]));
}
}
#endif
unsigned pushallocreg = (tyf == TYmfunc) ? CX : AX;
/* Copy SCfastpar and SCshadowreg (parameters passed in registers) that were not assigned
* registers into their stack locations.
*/
regm_t shadowregm = 0;
for (SYMIDX si = 0; si < globsym.top; si++)
{ symbol *s = globsym.tab[si];
unsigned sz = type_size(s->Stype);
if ((s->Sclass == SCfastpar || s->Sclass == SCshadowreg) && s->Sfl != FLreg)
{ // Argument is passed in a register
type *t = s->Stype;
type *t2 = NULL;
if (tybasic(t->Tty) == TYstruct && config.exe != EX_WIN64)
{ type *targ1 = t->Ttag->Sstruct->Sarg1type;
t2 = t->Ttag->Sstruct->Sarg2type;
if (targ1)
t = targ1;
}
if (s->Sisdead(anyiasm))
{
// Ignore it, as it is never referenced
;
}
else
{
targ_size_t offset = Fast.size + BPoff;
if (s->Sclass == SCshadowreg)
offset = Para.size;
offset += s->Soffset;
if (!hasframe)
offset += EBPtoESP;
unsigned preg = s->Spreg;
for (int i = 0; i < 2; ++i) // twice, once for each possible parameter register
{
shadowregm |= mask[preg];
int op = 0x89; // MOV x[EBP],preg
if (XMM0 <= preg && preg <= XMM15)
op = xmmstore(t->Tty);
if (!(pushalloc && preg == pushallocreg) || s->Sclass == SCshadowreg)
{
if (hasframe)
{
// MOV x[EBP],preg
cdb.genc1(op,modregxrm(2,preg,BPRM),FLconst,offset);
if (XMM0 <= preg && preg <= XMM15)
{
}
else
{
//printf("%s Fast.size = %d, BPoff = %d, Soffset = %d, sz = %d\n",
// s->Sident, (int)Fast.size, (int)BPoff, (int)s->Soffset, (int)sz);
if (I64 && sz > 4)
code_orrex(cdb.last(), REX_W);
}
}
else
{
// MOV offset[ESP],preg
// BUG: byte size?
cdb.genc1(op,
(modregrm(0,4,SP) << 8) |
modregxrm(2,preg,4),FLconst,offset);
if (preg >= XMM0 && preg <= XMM15)
{
}
else
{
if (I64 && sz > 4)
cdb.last()->Irex |= REX_W;
}
}
}
preg = s->Spreg2;
if (preg == NOREG)
break;
if (t2)
t = t2;
offset += REGSIZE;
}
}
}
}
if (config.exe == EX_WIN64 && variadic(funcsym_p->Stype))
{
/* The Microsoft scheme.
* http://msdn.microsoft.com/en-US/library/dd2wa36c(v=vs.80)
* Copy registers onto stack.
mov 8[RSP],RCX or XMM0
mov 010h[RSP],RDX or XMM1
mov 018h[RSP],R8 or XMM2
mov 020h[RSP],R9 or XMM3
*/
static reg_t vregs[4] = { CX,DX,R8,R9 };
for (int i = 0; i < sizeof(vregs)/sizeof(vregs[0]); ++i)
{
unsigned preg = vregs[i];
unsigned offset = Para.size + i * REGSIZE;
if (!(shadowregm & (mask[preg] | mask[XMM0 + i])))
{
if (hasframe)
{
// MOV x[EBP],preg
cdb.genc1(0x89,
modregxrm(2,preg,BPRM),FLconst, offset);
code_orrex(cdb.last(), REX_W);
}
else
{
// MOV offset[ESP],preg
cdb.genc1(0x89,
(modregrm(0,4,SP) << 8) |
modregxrm(2,preg,4),FLconst,offset + EBPtoESP);
}
cdb.last()->Irex |= REX_W;
}
}
}
/* Copy SCfastpar and SCshadowreg (parameters passed in registers) that were assigned registers
* into their assigned registers.
* Note that we have a big problem if Pa is passed in R1 and assigned to R2,
* and Pb is passed in R2 but assigned to R1. Detect it and assert.
*/
regm_t assignregs = 0;
for (SYMIDX si = 0; si < globsym.top; si++)
{ symbol *s = globsym.tab[si];
unsigned sz = type_size(s->Stype);
if (s->Sclass == SCfastpar || s->Sclass == SCshadowreg)
*namedargs |= s->Spregm();
if ((s->Sclass == SCfastpar || s->Sclass == SCshadowreg) && s->Sfl == FLreg)
{ // Argument is passed in a register
type *t = s->Stype;
type *t2 = NULL;
if (tybasic(t->Tty) == TYstruct && config.exe != EX_WIN64)
{ type *targ1 = t->Ttag->Sstruct->Sarg1type;
t2 = t->Ttag->Sstruct->Sarg2type;
if (targ1)
t = targ1;
}
reg_t preg = s->Spreg;
reg_t r = s->Sreglsw;
for (int i = 0; i < 2; ++i)
{
if (preg == NOREG)
break;
assert(!(mask[preg] & assignregs)); // not already stepped on
assignregs |= mask[r];
// MOV reg,preg
if (mask[preg] & XMMREGS)
{
unsigned op = xmmload(t->Tty); // MOVSS/D xreg,preg
unsigned xreg = r - XMM0;
cdb.gen2(op,modregxrmx(3,xreg,preg - XMM0));
}
else
{
genmovreg(cdb,r,preg);
if (I64 && sz == 8)
code_orrex(cdb.last(), REX_W);
}
preg = s->Spreg2;
r = s->Sregmsw;
if (t2)
t = t2;
}
}
}
/* For parameters that were passed on the stack, but are enregistered,
* initialize the registers with the parameter stack values.
* Do not use assignaddr(), as it will replace the stack reference with
* the register.
*/
for (SYMIDX si = 0; si < globsym.top; si++)
{ symbol *s = globsym.tab[si];
unsigned sz = type_size(s->Stype);
if ((s->Sclass == SCregpar || s->Sclass == SCparameter) &&
s->Sfl == FLreg &&
(refparam
#if MARS
// This variable has been reference by a nested function
|| s->Stype->Tty & mTYvolatile
#endif
))
{
// MOV reg,param[BP]
//assert(refparam);
if (mask[s->Sreglsw] & XMMREGS)
{
unsigned op = xmmload(s->Stype->Tty); // MOVSS/D xreg,mem
unsigned xreg = s->Sreglsw - XMM0;
cdb.genc1(op,modregxrm(2,xreg,BPRM),FLconst,Para.size + s->Soffset);
if (!hasframe)
{ // Convert to ESP relative address rather than EBP
code *c = cdb.last();
c->Irm = modregxrm(2,xreg,4);
c->Isib = modregrm(0,4,SP);
c->IEVpointer1 += EBPtoESP;
}
}
else
{
cdb.genc1(sz == 1 ? 0x8A : 0x8B,
modregxrm(2,s->Sreglsw,BPRM),FLconst,Para.size + s->Soffset);
code *c = cdb.last();
if (!I16 && sz == SHORTSIZE)
c->Iflags |= CFopsize; // operand size
if (I64 && sz >= REGSIZE)
c->Irex |= REX_W;
if (I64 && sz == 1 && s->Sreglsw >= 4)
c->Irex |= REX;
if (!hasframe)
{ // Convert to ESP relative address rather than EBP
assert(!I16);
c->Irm = modregxrm(2,s->Sreglsw,4);
c->Isib = modregrm(0,4,SP);
c->IEVpointer1 += EBPtoESP;
}
if (sz > REGSIZE)
{
cdb.genc1(0x8B,
modregxrm(2,s->Sregmsw,BPRM),FLconst,Para.size + s->Soffset + REGSIZE);
code *cx = cdb.last();
if (I64)
cx->Irex |= REX_W;
if (!hasframe)
{ // Convert to ESP relative address rather than EBP
assert(!I16);
cx->Irm = modregxrm(2,s->Sregmsw,4);
cx->Isib = modregrm(0,4,SP);
cx->IEVpointer1 += EBPtoESP;
}
}
}
}
}
}
/*******************************
* Generate and return function epilog.
* Output:
* retsize Size of function epilog
*/
void epilog(block *b)
{
code *cpopds;
unsigned reg;
unsigned regx; // register that's not a return reg
regm_t topop,regm;
int op;
targ_size_t xlocalsize = localsize;
CodeBuilder cdbx;
tym_t tyf = funcsym_p->ty();
tym_t tym = tybasic(tyf);
char farfunc = tyfarfunc(tym);
if (!(b->Bflags & BFLepilog)) // if no epilog code
goto Lret; // just generate RET
regx = (b->BC == BCret) ? AX : CX;
retsize = 0;
if (tyf & mTYnaked) // if no prolog/epilog
return;
if (tym == TYifunc)
{ static unsigned char ops2[] = { 0x07,0x1F,0x61,0xCF,0 };
static unsigned char ops0[] = { 0x07,0x1F,0x5F,0x5E,
0x5D,0x5B,0x5B,0x5A,
0x59,0x58,0xCF,0 };
unsigned char *p;
genregs(cdbx,0x8B,SP,BP); // MOV SP,BP
p = (config.target_cpu >= TARGET_80286) ? ops2 : ops0;
do
cdbx.gen1(*p);
while (*++p);
goto Lopt;
}
if (config.flags & CFGtrace &&
(!(config.flags4 & CFG4allcomdat) ||
funcsym_p->Sclass == SCcomdat ||
funcsym_p->Sclass == SCglobal ||
(config.flags2 & CFG2comdat && SymInline(funcsym_p))
)
)
{
symbol *s = getRtlsym(farfunc ? RTLSYM_TRACE_EPI_F : RTLSYM_TRACE_EPI_N);
makeitextern(s);
cdbx.gencs(I16 ? 0x9A : CALL,0,FLfunc,s); // CALLF _trace
if (!I16)
code_orflag(cdbx.last(),CFoff | CFselfrel);
useregs((ALLREGS | mBP | mES) & ~s->Sregsaved);
}
if (usednteh & (NTEH_try | NTEH_except | NTEHcpp | EHcleanup | EHtry | NTEHpassthru) && (config.exe == EX_WIN32 || MARS))
{
nteh_epilog(cdbx);
}
cpopds = CNIL;
if (tyf & mTYloadds)
{ cdbx.gen1(0x1F); // POP DS
cpopds = cdbx.last();
}
/* Pop all the general purpose registers saved on the stack
* by the prolog code. Remember to do them in the reverse
* order they were pushed.
*/
topop = fregsaved & ~mfuncreg;
epilog_restoreregs(cdbx, topop);
#if MARS
if (usednteh & NTEHjmonitor)
{
regm_t retregs = 0;
if (b->BC == BCretexp)
retregs = regmask(b->Belem->Ety, tym);
nteh_monitor_epilog(cdbx,retregs);
xlocalsize += 8;
}
#endif
if (config.wflags & WFwindows && farfunc)
{
int wflags = config.wflags;
if (wflags & WFreduced && !(tyf & mTYexport))
{ // reduced prolog/epilog for non-exported functions
wflags &= ~(WFdgroup | WFds | WFss);
if (!(wflags & WFsaveds))
goto L4;
}
if (localsize)
{
cdbx.genc1(LEA,modregrm(1,SP,6),FLconst,(targ_uns)-2); /* LEA SP,-2[BP] */
}
if (wflags & (WFsaveds | WFds | WFss | WFdgroup))
{ if (cpopds)
cpopds->Iop = NOP; // don't need previous one
cdbx.gen1(0x1F); // POP DS
}
cdbx.gen1(0x58 + BP); // POP BP
if (config.wflags & WFincbp)
cdbx.gen1(0x48 + BP); // DEC BP
assert(hasframe);
}
else
{
if (needframe || (xlocalsize && hasframe))
{
L4:
assert(hasframe);
if (xlocalsize)
{
if (config.flags2 & CFG2stomp)
{ /* MOV ECX,0xBEAF
* L1:
* MOV [ESP],ECX
* ADD ESP,4
* CMP EBP,ESP
* JNE L1
* POP EBP
*/
/* Value should be:
* 1. != 0 (code checks for null pointers)
* 2. be odd (to mess up alignment)
* 3. fall in first 64K (likely marked as inaccessible)
* 4. be a value that stands out in the debugger
*/
assert(I32 || I64);
targ_size_t value = 0x0000BEAF;
reg_t regcx = CX;
mfuncreg &= ~mask[regcx];
unsigned grex = I64 ? REX_W << 16 : 0;
cdbx.genc2(0xC7,grex | modregrmx(3,0,regcx),value); // MOV regcx,value
cdbx.gen2sib(0x89,grex | modregrm(0,regcx,4),modregrm(0,4,SP)); // MOV [ESP],regcx
code *c1 = cdbx.last();
cdbx.genc2(0x81,grex | modregrm(3,0,SP),REGSIZE); // ADD ESP,REGSIZE
genregs(cdbx,0x39,SP,BP); // CMP EBP,ESP
if (I64)
code_orrex(cdbx.last(),REX_W);
genjmp(cdbx,JNE,FLcode,(block *)c1); // JNE L1
// explicitly mark as short jump, needed for correct retsize calculation (Bugzilla 15779)
cdbx.last()->Iflags &= ~CFjmp16;
cdbx.gen1(0x58 + BP); // POP BP
}
else if (config.exe == EX_WIN64)
{ // See http://msdn.microsoft.com/en-us/library/tawsa7cb(v=vs.80).aspx
// LEA RSP,0[RBP]
cdbx.genc1(LEA,(REX_W<<16)|modregrm(2,SP,BPRM),FLconst,0);
cdbx.gen1(0x58 + BP); // POP RBP
}
else if (config.target_cpu >= TARGET_80286 &&
!(config.target_cpu >= TARGET_80386 && config.flags4 & CFG4speed)
)
cdbx.gen1(0xC9); // LEAVE
else if (0 && xlocalsize == REGSIZE && Alloca.size == 0 && I32)
{ // This doesn't work - I should figure out why
mfuncreg &= ~mask[regx];
cdbx.gen1(0x58 + regx); // POP regx
cdbx.gen1(0x58 + BP); // POP BP
}
else
{ genregs(cdbx,0x8B,SP,BP); // MOV SP,BP
if (I64)
code_orrex(cdbx.last(), REX_W); // MOV RSP,RBP
cdbx.gen1(0x58 + BP); // POP BP
}
}
else
cdbx.gen1(0x58 + BP); // POP BP
if (config.wflags & WFincbp && farfunc)
cdbx.gen1(0x48 + BP); // DEC BP
}
else if (xlocalsize == REGSIZE && (!I16 || b->BC == BCret))
{ mfuncreg &= ~mask[regx];
cdbx.gen1(0x58 + regx); // POP regx
}
else if (xlocalsize)
cod3_stackadj(cdbx, -xlocalsize);
}
if (b->BC == BCret || b->BC == BCretexp)
{
Lret:
op = tyfarfunc(tym) ? 0xCA : 0xC2;
if (tym == TYhfunc)
{
cdbx.genc2(0xC2,0,4); // RET 4
}
else if (!typfunc(tym) || // if caller cleans the stack
config.exe == EX_WIN64 ||
Para.offset == 0) // or nothing pushed on the stack anyway
{ op++; // to a regular RET
cdbx.gen1(op);
}
else
{ // Stack is always aligned on register size boundary
Para.offset = (Para.offset + (REGSIZE - 1)) & ~(REGSIZE - 1);
if (Para.offset >= 0x10000)
{
/*
POP REG
ADD ESP, Para.offset
JMP REG
*/
cdbx.gen1(0x58+regx);
cdbx.genc2(0x81, modregrm(3,0,SP), Para.offset);
if (I64)
code_orrex(cdbx.last(), REX_W);
cdbx.genc2(0xFF, modregrm(3,4,regx), 0);
if (I64)
code_orrex(cdbx.last(), REX_W);
}
else
cdbx.genc2(op,0,Para.offset); // RET Para.offset
}
}
Lopt:
// If last instruction in ce is ADD SP,imm, and first instruction
// in c sets SP, we can dump the ADD.
CodeBuilder cdb;
cdb.append(b->Bcode);
code *cr = cdb.last();
code *c = cdbx.peek();
if (cr && c && !I64)
{
if (cr->Iop == 0x81 && cr->Irm == modregrm(3,0,SP)) // if ADD SP,imm
{
if (
c->Iop == 0xC9 || // LEAVE
(c->Iop == 0x8B && c->Irm == modregrm(3,SP,BP)) || // MOV SP,BP
(c->Iop == LEA && c->Irm == modregrm(1,SP,6)) // LEA SP,-imm[BP]
)
cr->Iop = NOP;
else if (c->Iop == 0x58 + BP) // if POP BP
{ cr->Iop = 0x8B;
cr->Irm = modregrm(3,SP,BP); // MOV SP,BP
}
}
#if 0 // These optimizations don't work if the called function
// cleans off the stack.
else if (c->Iop == 0xC3 && cr->Iop == CALL) // CALL near
{ cr->Iop = 0xE9; // JMP near
c->Iop = NOP;
}
else if (c->Iop == 0xCB && cr->Iop == 0x9A) // CALL far
{ cr->Iop = 0xEA; // JMP far
c->Iop = NOP;
}
#endif
}
pinholeopt(c, NULL);
retsize += calcblksize(c); // compute size of function epilog
cdb.append(cdbx);
b->Bcode = cdb.finish();
}
/*******************************
* Return offset of SP from BP.
*/
targ_size_t cod3_spoff()
{
//printf("spoff = x%x, localsize = x%x\n", (int)spoff, (int)localsize);
return spoff + localsize;
}
void gen_spill_reg(CodeBuilder& cdb, Symbol* s, bool toreg)
{
code cs;
const regm_t keepmsk = toreg ? RMload : RMstore;
elem* e = el_var(s); // so we can trick getlvalue() into working for us
if (mask[s->Sreglsw] & XMMREGS)
{ // Convert to save/restore of XMM register
if (toreg)
cs.Iop = xmmload(s->Stype->Tty); // MOVSS/D xreg,mem
else
cs.Iop = xmmstore(s->Stype->Tty); // MOVSS/D mem,xreg
getlvalue(cdb,&cs,e,keepmsk);
cs.orReg(s->Sreglsw - XMM0);
cdb.gen(&cs);
}
else
{
const int sz = type_size(s->Stype);
cs.Iop = toreg ? 0x8B : 0x89; // MOV reg,mem[ESP] : MOV mem[ESP],reg
cs.Iop ^= (sz == 1);
getlvalue(cdb,&cs,e,keepmsk);
cs.orReg(s->Sreglsw);
if (I64 && sz == 1 && s->Sreglsw >= 4)
cs.Irex |= REX;
if ((cs.Irm & 0xC0) == 0xC0 && // reg,reg
(((cs.Irm >> 3) ^ cs.Irm) & 7) == 0 && // registers match
(((cs.Irex >> 2) ^ cs.Irex) & 1) == 0) // REX_R and REX_B match
; // skip MOV reg,reg
else
cdb.gen(&cs);
if (sz > REGSIZE)
{
cs.setReg(s->Sregmsw);
getlvalue_msw(&cs);
if ((cs.Irm & 0xC0) == 0xC0 && // reg,reg
(((cs.Irm >> 3) ^ cs.Irm) & 7) == 0 && // registers match
(((cs.Irex >> 2) ^ cs.Irex) & 1) == 0) // REX_R and REX_B match
; // skip MOV reg,reg
else
cdb.gen(&cs);
}
}
el_free(e);
}
/****************************
* Generate code for, and output a thunk.
* Params:
* sthunk = Symbol of thunk
* sfunc = Symbol of thunk's target function
* thisty = Type of this pointer
* p = ESP parameter offset to this pointer
* d = offset to add to 'this' pointer
* d2 = offset from 'this' to vptr
* i = offset into vtbl[]
*/
void cod3_thunk(Symbol *sthunk,Symbol *sfunc,unsigned p,tym_t thisty,
unsigned d,int i,unsigned d2)
{
targ_size_t thunkoffset;
int seg = sthunk->Sseg;
cod3_align(seg);
// Skip over return address
tym_t thunkty = tybasic(sthunk->ty());
#if TARGET_SEGMENTED
if (tyfarfunc(thunkty))
p += I32 ? 8 : tysize(TYfptr); // far function
else
#endif
p += tysize(TYnptr);
CodeBuilder cdb;
if (!I16)
{
/*
Generate:
ADD p[ESP],d
For direct call:
JMP sfunc
For virtual call:
MOV EAX, p[ESP] EAX = this
MOV EAX, d2[EAX] EAX = this->vptr
JMP i[EAX] jump to virtual function
*/
unsigned reg = 0;
if ((int)d < 0)
{
d = -d;
reg = 5; // switch from ADD to SUB
}
if (thunkty == TYmfunc)
{ // ADD ECX,d
if (d)
cdb.genc2(0x81,modregrm(3,reg,CX),d);
}
else if (thunkty == TYjfunc || (I64 && thunkty == TYnfunc))
{ // ADD EAX,d
int rm = AX;
if (config.exe == EX_WIN64)
rm = CX;
else if (I64)
rm = DI;
if (d)
cdb.genc2(0x81,modregrm(3,reg,rm),d);
}
else
{
cdb.genc(0x81,modregrm(2,reg,4),
FLconst,p, // to this
FLconst,d); // ADD p[ESP],d
cdb.last()->Isib = modregrm(0,4,SP);
}
if (I64 && cdb.peek())
cdb.last()->Irex |= REX_W;
}
else
{
/*
Generate:
MOV BX,SP
ADD [SS:] p[BX],d
For direct call:
JMP sfunc
For virtual call:
MOV BX, p[BX] BX = this
MOV BX, d2[BX] BX = this->vptr
JMP i[BX] jump to virtual function
*/
genregs(cdb,0x89,SP,BX); // MOV BX,SP
cdb.genc(0x81,modregrm(2,0,7),
FLconst,p, // to this
FLconst,d); // ADD p[BX],d
if (config.wflags & WFssneds ||
// If DS needs reloading from SS,
// then assume SS != DS on thunk entry
(LARGEDATA && config.wflags & WFss))
cdb.last()->Iflags |= CFss; // SS:
}
if ((i & 0xFFFF) != 0xFFFF) // if virtual call
{
const bool FARTHIS = (tysize(thisty) > REGSIZE);
const bool FARVPTR = FARTHIS;
assert(thisty != TYvptr); // can't handle this case
if (!I16)
{
assert(!FARTHIS && !LARGECODE);
if (thunkty == TYmfunc) // if 'this' is in ECX
{
// MOV EAX,d2[ECX]
cdb.genc1(0x8B,modregrm(2,AX,CX),FLconst,d2);
}
else if (thunkty == TYjfunc) // if 'this' is in EAX
{
// MOV EAX,d2[EAX]
cdb.genc1(0x8B,modregrm(2,AX,AX),FLconst,d2);
}
else
{
// MOV EAX,p[ESP]
cdb.genc1(0x8B,(modregrm(0,4,SP) << 8) | modregrm(2,AX,4),FLconst,(targ_uns) p);
if (I64)
cdb.last()->Irex |= REX_W;
// MOV EAX,d2[EAX]
cdb.genc1(0x8B,modregrm(2,AX,AX),FLconst,d2);
}
if (I64)
code_orrex(cdb.last(), REX_W);
// JMP i[EAX]
cdb.genc1(0xFF,modregrm(2,4,0),FLconst,(targ_uns) i);
}
else
{
// MOV/LES BX,[SS:] p[BX]
cdb.genc1((FARTHIS ? 0xC4 : 0x8B),modregrm(2,BX,7),FLconst,(targ_uns) p);
if (config.wflags & WFssneds ||
// If DS needs reloading from SS,
// then assume SS != DS on thunk entry
(LARGEDATA && config.wflags & WFss))
cdb.last()->Iflags |= CFss; // SS:
// MOV/LES BX,[ES:]d2[BX]
cdb.genc1((FARVPTR ? 0xC4 : 0x8B),modregrm(2,BX,7),FLconst,d2);
if (FARTHIS)
cdb.last()->Iflags |= CFes; // ES:
// JMP i[BX]
cdb.genc1(0xFF,modregrm(2,(LARGECODE ? 5 : 4),7),FLconst,(targ_uns) i);
if (FARVPTR)
cdb.last()->Iflags |= CFes; // ES:
}
}
else
{
#if 0
localgot = NULL; // no local variables
code *c1 = load_localgot();
if (c1)
{ assignaddrc(c1);
cdb.append(c1);
}
#endif
cdb.gencs((LARGECODE ? 0xEA : 0xE9),0,FLfunc,sfunc); // JMP sfunc
cdb.last()->Iflags |= LARGECODE ? (CFseg | CFoff) : (CFselfrel | CFoff);
}
thunkoffset = Offset(seg);
code *c = cdb.finish();
pinholeopt(c,NULL);
codout(seg,c);
code_free(c);
sthunk->Soffset = thunkoffset;
sthunk->Ssize = Offset(seg) - thunkoffset; // size of thunk
sthunk->Sseg = seg;
#if TARGET_LINUX || TARGET_OSX || TARGET_FREEBSD || TARGET_OPENBSD || TARGET_DRAGONFLYBSD || TARGET_SOLARIS
objmod->pubdef(seg,sthunk,sthunk->Soffset);
#endif
#if TARGET_WINDOS
if (config.objfmt == OBJ_MSCOFF)
objmod->pubdef(seg,sthunk,sthunk->Soffset);
#endif
searchfixlist(sthunk); // resolve forward refs
}
/*****************************
* Assume symbol s is extern.
*/
void makeitextern(symbol *s)
{
if (s->Sxtrnnum == 0)
{ s->Sclass = SCextern; /* external */
/*printf("makeitextern(x%x)\n",s);*/
objmod->external(s);
}
}
/*******************************
* Replace JMPs in Bgotocode with JMP SHORTs whereever possible.
* This routine depends on FLcode jumps to only be forward
* referenced.
* BFLjmpoptdone is set to TRUE if nothing more can be done
* with this block.
* Input:
* flag !=0 means don't have correct Boffsets yet
* Returns:
* number of bytes saved
*/
int branch(block *bl,int flag)
{ int bytesaved;
code *c,*cn,*ct;
targ_size_t offset,disp;
targ_size_t csize;
if (!flag)
bl->Bflags |= BFLjmpoptdone; // assume this will be all
c = bl->Bcode;
if (!c)
return 0;
bytesaved = 0;
offset = bl->Boffset; /* offset of start of block */
while (1)
{ unsigned char op;
csize = calccodsize(c);
cn = code_next(c);
op = c->Iop;
if ((op & ~0x0F) == 0x70 && c->Iflags & CFjmp16 ||
(op == JMP && !(c->Iflags & CFjmp5)))
{
L1:
switch (c->IFL2)
{
case FLblock:
if (flag) // no offsets yet, don't optimize
goto L3;
disp = c->IEV2.Vblock->Boffset - offset - csize;
/* If this is a forward branch, and there is an aligned
* block intervening, it is possible that shrinking
* the jump instruction will cause it to be out of
* range of the target. This happens if the alignment
* prevents the target block from moving correspondingly
* closer.
*/
if (disp >= 0x7F-4 && c->IEV2.Vblock->Boffset > offset)
{ /* Look for intervening alignment
*/
for (block *b = bl->Bnext; b; b = b->Bnext)
{
if (b->Balign)
{
bl->Bflags &= ~BFLjmpoptdone; // some JMPs left
goto L3;
}
if (b == c->IEV2.Vblock)
break;
}
}
break;
case FLcode:
{ code *cr;
disp = 0;
ct = c->IEV2.Vcode; /* target of branch */
assert(ct->Iflags & (CFtarg | CFtarg2));
for (cr = cn; cr; cr = code_next(cr))
{
if (cr == ct)
break;
disp += calccodsize(cr);
}
if (!cr)
{ // Didn't find it in forward search. Try backwards jump
int s = 0;
disp = 0;
for (cr = bl->Bcode; cr != cn; cr = code_next(cr))
{
assert(cr != NULL); // must have found it
if (cr == ct)
s = 1;
if (s)
disp += calccodsize(cr);
}
}
if (config.flags4 & CFG4optimized && !flag)
{
/* Propagate branch forward past junk */
while (1)
{ if (ct->Iop == NOP ||
ct->Iop == (ESCAPE | ESClinnum))
{ ct = code_next(ct);
if (!ct)
goto L2;
}
else
{ c->IEV2.Vcode = ct;
ct->Iflags |= CFtarg;
break;
}
}
/* And eliminate jmps to jmps */
if ((op == ct->Iop || ct->Iop == JMP) &&
(op == JMP || c->Iflags & CFjmp16))
{ c->IFL2 = ct->IFL2;
c->IEV2.Vcode = ct->IEV2.Vcode;
/*printf("eliminating branch\n");*/
goto L1;
}
L2: ;
}
}
break;
default:
goto L3;
}
if (disp == 0) // bra to next instruction
{ bytesaved += csize;
c->Iop = NOP; // del branch instruction
c->IEV2.Vcode = NULL;
c = cn;
if (!c)
break;
continue;
}
else if ((targ_size_t)(targ_schar)(disp - 2) == (disp - 2) &&
(targ_size_t)(targ_schar)disp == disp)
{
if (op == JMP)
{ c->Iop = JMPS; // JMP SHORT
bytesaved += I16 ? 1 : 3;
}
else // else Jcond
{ c->Iflags &= ~CFjmp16; // a branch is ok
bytesaved += I16 ? 3 : 4;
// Replace a cond jump around a call to a function that
// never returns with a cond jump to that function.
if (config.flags4 & CFG4optimized &&
config.target_cpu >= TARGET_80386 &&
disp == (I16 ? 3 : 5) &&
cn &&
cn->Iop == CALL &&
cn->IFL2 == FLfunc &&
cn->IEVsym2->Sflags & SFLexit &&
!(cn->Iflags & (CFtarg | CFtarg2))
)
{
cn->Iop = 0x0F00 | ((c->Iop & 0x0F) ^ 0x81);
c->Iop = NOP;
c->IEV2.Vcode = NULL;
bytesaved++;
// If nobody else points to ct, we can remove the CFtarg
if (flag && ct)
{ code *cx;
for (cx = bl->Bcode; 1; cx = code_next(cx))
{
if (!cx)
{ ct->Iflags &= ~CFtarg;
break;
}
if (cx->IEV2.Vcode == ct)
break;
}
}
}
}
csize = calccodsize(c);
}
else
bl->Bflags &= ~BFLjmpoptdone; // some JMPs left
}
L3:
if (cn)
{ offset += csize;
c = cn;
}
else
break;
}
//printf("bytesaved = x%x\n",bytesaved);
return bytesaved;
}
/************************************************
* Adjust all Soffset's of stack variables so they
* are all relative to the frame pointer.
*/
#if MARS
void cod3_adjSymOffsets()
{ SYMIDX si;
//printf("cod3_adjSymOffsets()\n");
for (si = 0; si < globsym.top; si++)
{ //printf("\tglobsym.tab[%d] = %p\n",si,globsym.tab[si]);
symbol *s = globsym.tab[si];
switch (s->Sclass)
{
case SCparameter:
case SCregpar:
case SCshadowreg:
//printf("s = '%s', Soffset = x%x, Para.size = x%x, EBPtoESP = x%x\n", s->Sident, s->Soffset, Para.size, EBPtoESP);
s->Soffset += Para.size;
if (0 && !(funcsym_p->Sfunc->Fflags3 & Fmember))
{
if (!hasframe)
s->Soffset += EBPtoESP;
if (funcsym_p->Sfunc->Fflags3 & Fnested)
s->Soffset += REGSIZE;
}
break;
case SCfastpar:
//printf("\tfastpar %s %p Soffset %x Fast.size %x BPoff %x\n", s->Sident, s, (int)s->Soffset, (int)Fast.size, (int)BPoff);
s->Soffset += Fast.size + BPoff;
break;
case SCauto:
case SCregister:
case_auto:
if (s->Sfl == FLfast)
s->Soffset += Fast.size + BPoff;
else
//printf("s = '%s', Soffset = x%x, Auto.size = x%x, BPoff = x%x EBPtoESP = x%x\n", s->Sident, (int)s->Soffset, (int)Auto.size, (int)BPoff, (int)EBPtoESP);
// if (!(funcsym_p->Sfunc->Fflags3 & Fnested))
s->Soffset += Auto.size + BPoff;
break;
case SCbprel:
break;
default:
continue;
}
#if 0
if (!hasframe)
s->Soffset += EBPtoESP;
#endif
}
}
#endif
/*******************************
* Take symbol info in union ev and replace it with a real address
* in Vpointer.
*/
void assignaddr(block *bl)
{
int EBPtoESPsave = EBPtoESP;
int hasframesave = hasframe;
if (bl->Bflags & BFLoutsideprolog)
{ EBPtoESP = -REGSIZE;
hasframe = 0;
}
assignaddrc(bl->Bcode);
hasframe = hasframesave;
EBPtoESP = EBPtoESPsave;
}
void assignaddrc(code *c)
{
int sn;
symbol *s;
unsigned char ins,rm;
targ_size_t soff;
targ_size_t base;
base = EBPtoESP;
for (; c; c = code_next(c))
{
#ifdef DEBUG
if (0)
{ printf("assignaddrc()\n");
c->print();
}
if (code_next(c) && code_next(code_next(c)) == c)
assert(0);
#endif
if (c->Iflags & CFvex && c->Ivex.pfx == 0xC4)
ins = vex_inssize(c);
else if ((c->Iop & 0xFFFD00) == 0x0F3800)
ins = inssize2[(c->Iop >> 8) & 0xFF];
else if ((c->Iop & 0xFF00) == 0x0F00)
ins = inssize2[c->Iop & 0xFF];
else if ((c->Iop & 0xFF) == ESCAPE)
{
if (c->Iop == (ESCAPE | ESCadjesp))
{
//printf("adjusting EBPtoESP (%d) by %ld\n",EBPtoESP,(long)c->IEV1.Vint);
EBPtoESP += c->IEV1.Vint;
c->Iop = NOP;
}
else if (c->Iop == (ESCAPE | ESCfixesp))
{
//printf("fix ESP\n");
if (hasframe)
{
// LEA ESP,-EBPtoESP-REGSIZE[EBP]
c->Iop = LEA;
if (c->Irm & 8)
c->Irex |= REX_R;
c->Irm = modregrm(2,SP,BP);
c->Iflags = CFoff;
c->IFL1 = FLconst;
c->IEV1.Vuns = -EBPtoESP - REGSIZE;
}
}
else if (c->Iop == (ESCAPE | ESCframeptr))
{ // Convert to load of frame pointer
// c->Irm is the register to use
if (hasframe)
{ // MOV reg,EBP
c->Iop = 0x89;
if (c->Irm & 8)
c->Irex |= REX_B;
c->Irm = modregrm(3,BP,c->Irm & 7);
}
else
{ // LEA reg,EBPtoESP[ESP]
c->Iop = LEA;
if (c->Irm & 8)
c->Irex |= REX_R;
c->Irm = modregrm(2,c->Irm & 7,4);
c->Isib = modregrm(0,4,SP);
c->Iflags = CFoff;
c->IFL1 = FLconst;
c->IEV1.Vuns = EBPtoESP;
}
}
if (I64)
c->Irex |= REX_W;
continue;
}
else
ins = inssize[c->Iop & 0xFF];
if (!(ins & M) ||
((rm = c->Irm) & 0xC0) == 0xC0)
goto do2; /* if no first operand */
if (is32bitaddr(I32,c->Iflags))
{
if (
((rm & 0xC0) == 0 && !((rm & 7) == 4 && (c->Isib & 7) == 5 || (rm & 7) == 5))
)
goto do2; /* if no first operand */
}
else
{
if (
((rm & 0xC0) == 0 && !((rm & 7) == 6))
)
goto do2; /* if no first operand */
}
s = c->IEVsym1;
switch (c->IFL1)
{
case FLdata:
if (config.objfmt == OBJ_OMF && s->Sclass != SCcomdat)
{
#if MARS
c->IEVseg1 = s->Sseg;
#else
c->IEVseg1 = DATA;
#endif
c->IEVpointer1 += s->Soffset;
c->IFL1 = FLdatseg;
}
else
c->IFL1 = FLextern;
goto do2;
case FLudata:
if (config.objfmt == OBJ_OMF)
{
#if MARS
c->IEVseg1 = s->Sseg;
#else
c->IEVseg1 = UDATA;
#endif
c->IEVpointer1 += s->Soffset;
c->IFL1 = FLdatseg;
}
else
c->IFL1 = FLextern;
goto do2;
case FLtlsdata:
if (config.objfmt == OBJ_ELF || config.objfmt == OBJ_MACH)
c->IFL1 = FLextern;
goto do2;
case FLdatseg:
//c->IEVseg1 = DATA;
goto do2;
#if TARGET_SEGMENTED
case FLfardata:
case FLcsdata:
#endif
case FLpseudo:
goto do2;
case FLstack:
//printf("Soffset = %d, EBPtoESP = %d, base = %d, pointer = %d\n",
//s->Soffset,EBPtoESP,base,c->IEVpointer1);
c->IEVpointer1 += s->Soffset + EBPtoESP - base - EEStack.offset;
break;
case FLfast:
soff = Fast.size;
goto L1;
case FLreg:
case FLauto:
soff = Auto.size;
L1:
if (s->Sisdead(anyiasm))
{ c->Iop = NOP; // remove references to it
continue;
}
if (s->Sfl == FLreg && c->IEVpointer1 < 2)
{ int reg = s->Sreglsw;
assert(!(s->Sregm & ~mask[reg]));
if (c->IEVpointer1 == 1)
{ assert(reg < 4); /* must be a BYTEREGS */
reg |= 4; /* convert to high byte reg */
}
if (reg & 8)
{ assert(I64);
c->Irex |= REX_B;
reg &= 7;
}
c->Irm = (c->Irm & modregrm(0,7,0))
| modregrm(3,0,reg);
assert(c->Iop != LES && c->Iop != LEA);
goto do2;
}
else
{ c->IEVpointer1 += s->Soffset + soff + BPoff;
if (s->Sflags & SFLunambig)
c->Iflags |= CFunambig;
L2:
if (!hasframe)
{ /* Convert to ESP relative address instead of EBP */
assert(!I16);
c->IEVpointer1 += EBPtoESP;
unsigned char crm = c->Irm;
if ((crm & 7) == 4) // if SIB byte
{
assert((c->Isib & 7) == BP);
assert((crm & 0xC0) != 0);
c->Isib = (c->Isib & ~7) | modregrm(0,0,SP);
}
else
{
assert((crm & 7) == 5);
c->Irm = (crm & modregrm(0,7,0))
| modregrm(2,0,4);
c->Isib = modregrm(0,4,SP);
}
}
}
break;
case FLpara:
soff = Para.size - BPoff; // cancel out add of BPoff
goto L1;
case FLfltreg:
c->IEVpointer1 += Foff + BPoff;
c->Iflags |= CFunambig;
goto L2;
case FLallocatmp:
c->IEVpointer1 += Alloca.offset + BPoff;
goto L2;
case FLfuncarg:
c->IEVpointer1 += cgstate.funcarg.offset + BPoff;
goto L2;
case FLbprel:
c->IEVpointer1 += s->Soffset;
break;
case FLcs:
sn = c->IEV1.Vuns;
if (!CSE_loaded(sn)) // if never loaded
{ c->Iop = NOP;
continue;
}
c->IEVpointer1 = sn * REGSIZE + CSoff + BPoff;
c->Iflags |= CFunambig;
goto L2;
case FLregsave:
sn = c->IEV1.Vuns;
c->IEVpointer1 = sn + regsave.off + BPoff;
c->Iflags |= CFunambig;
goto L2;
case FLndp:
#if MARS
assert(c->IEV1.Vuns < NDP::savetop);
#endif
c->IEVpointer1 = c->IEV1.Vuns * tysize(TYldouble) + NDPoff + BPoff;
c->Iflags |= CFunambig;
goto L2;
case FLoffset:
break;
case FLlocalsize:
c->IEVpointer1 += localsize;
break;
case FLconst:
default:
goto do2;
}
c->IFL1 = FLconst;
do2:
/* Ignore TEST (F6 and F7) opcodes */
if (!(ins & T)) goto done; /* if no second operand */
s = c->IEVsym2;
switch (c->IFL2)
{
case FLdata:
if (config.objfmt == OBJ_ELF || config.objfmt == OBJ_MACH)
{
c->IFL2 = FLextern;
goto do2;
}
else
{
if (s->Sclass == SCcomdat)
{ c->IFL2 = FLextern;
goto do2;
}
c->IEVseg2 = MARS ? s->Sseg : DATA;
c->IEVpointer2 += s->Soffset;
c->IFL2 = FLdatseg;
goto done;
}
case FLudata:
if (config.objfmt == OBJ_ELF || config.objfmt == OBJ_MACH)
{
c->IFL2 = FLextern;
goto do2;
}
else
{
c->IEVseg2 = MARS ? s->Sseg : UDATA;
c->IEVpointer2 += s->Soffset;
c->IFL2 = FLdatseg;
goto done;
}
case FLtlsdata:
if (config.objfmt == OBJ_ELF || config.objfmt == OBJ_MACH)
{
c->IFL2 = FLextern;
goto do2;
}
goto done;
case FLdatseg:
//c->IEVseg2 = DATA;
goto done;
#if TARGET_SEGMENTED
case FLcsdata:
case FLfardata:
goto done;
#endif
case FLreg:
case FLpseudo:
assert(0);
/* NOTREACHED */
case FLfast:
c->IEVpointer2 += s->Soffset + Fast.size + BPoff;
break;
case FLauto:
c->IEVpointer2 += s->Soffset + Auto.size + BPoff;
break;
case FLpara:
c->IEVpointer2 += s->Soffset + Para.size;
break;
case FLfltreg:
c->IEVpointer2 += Foff + BPoff;
break;
case FLallocatmp:
c->IEVpointer2 += Alloca.offset + BPoff;
break;
case FLfuncarg:
c->IEVpointer2 += cgstate.funcarg.offset + BPoff;
break;
case FLbprel:
c->IEVpointer2 += s->Soffset;
break;
case FLstack:
c->IEVpointer2 += s->Soffset + EBPtoESP - base;
break;
case FLcs:
case FLndp:
case FLregsave:
assert(0);
/* NOTREACHED */
case FLconst:
break;
case FLlocalsize:
c->IEVpointer2 += localsize;
break;
default:
goto done;
}
c->IFL2 = FLconst;
done:
;
}
}
/*******************************
* Return offset from BP of symbol s.
*/
targ_size_t cod3_bpoffset(symbol *s)
{ targ_size_t offset;
symbol_debug(s);
offset = s->Soffset;
switch (s->Sfl)
{
case FLpara:
offset += Para.size;
break;
case FLfast:
offset += Fast.size + BPoff;
break;
case FLauto:
offset += Auto.size + BPoff;
break;
default:
WRFL((enum FL)s->Sfl);
symbol_print(s);
assert(0);
}
assert(hasframe);
return offset;
}
/*******************************
* Find shorter versions of the same instructions.
* Does these optimizations:
* replaces jmps to the next instruction with NOPs
* sign extension of modregrm displacement
* sign extension of immediate data (can't do it for OR, AND, XOR
* as the opcodes are not defined)
* short versions for AX EA
* short versions for reg EA
* Code is neither removed nor added.
* Params:
* b = block for code (or NULL)
* c = code list to optimize
*/
void pinholeopt(code *c,block *b)
{ targ_size_t a;
unsigned op,mod;
unsigned char ins;
int usespace;
int useopsize;
int space;
block *bn;
#ifdef DEBUG
static int tested; if (!tested) { tested++; pinholeopt_unittest(); }
#endif
#if 0
code *cstart = c;
if (debugc)
{
printf("+pinholeopt(%p)\n",c);
}
#endif
if (b)
{ bn = b->Bnext;
usespace = (config.flags4 & CFG4space && b->BC != BCasm);
useopsize = (I16 || (config.flags4 & CFG4space && b->BC != BCasm));
}
else
{ bn = NULL;
usespace = (config.flags4 & CFG4space);
useopsize = (I16 || config.flags4 & CFG4space);
}
for (; c; c = code_next(c))
{
L1:
op = c->Iop;
if (c->Iflags & CFvex && c->Ivex.pfx == 0xC4)
ins = vex_inssize(c);
else if ((op & 0xFFFD00) == 0x0F3800)
ins = inssize2[(op >> 8) & 0xFF];
else if ((op & 0xFF00) == 0x0F00)
ins = inssize2[op & 0xFF];
else
ins = inssize[op & 0xFF];
if (ins & M) // if modregrm byte
{ int shortop = (c->Iflags & CFopsize) ? !I16 : I16;
int local_BPRM = BPRM;
if (c->Iflags & CFaddrsize)
local_BPRM ^= 5 ^ 6; // toggle between 5 and 6
unsigned rm = c->Irm;
unsigned reg = rm & modregrm(0,7,0); // isolate reg field
unsigned ereg = rm & 7;
//printf("c = %p, op = %02x rm = %02x\n", c, op, rm);
/* If immediate second operand */
if ((ins & T ||
((op == 0xF6 || op == 0xF7) && (reg < modregrm(0,2,0) || reg > modregrm(0,3,0)))
) &&
c->IFL2 == FLconst)
{
int flags = c->Iflags & CFpsw; /* if want result in flags */
targ_long u = c->IEV2.Vuns;
if (ins & E)
u = (signed char) u;
else if (shortop)
u = (short) u;
// Replace CMP reg,0 with TEST reg,reg
if ((op & 0xFE) == 0x80 && // 80 is CMP R8,imm8; 81 is CMP reg,imm
rm >= modregrm(3,7,AX) &&
u == 0)
{ c->Iop = (op & 1) | 0x84;
c->Irm = modregrm(3,ereg,ereg);
if (c->Irex & REX_B)
c->Irex |= REX_R;
goto L1;
}
/* Optimize ANDs with an immediate constant */
if ((op == 0x81 || op == 0x80) && reg == modregrm(0,4,0))
{
if (rm >= modregrm(3,4,AX)) // AND reg,imm
{
if (u == 0)
{ /* Replace with XOR reg,reg */
c->Iop = 0x30 | (op & 1);
c->Irm = modregrm(3,ereg,ereg);
if (c->Irex & REX_B)
c->Irex |= REX_R;
goto L1;
}
if (u == 0xFFFFFFFF && !flags)
{ c->Iop = NOP;
goto L1;
}
}
if (op == 0x81 && !flags)
{ // If we can do the operation in one byte
// If EA is not SI or DI
if ((rm < modregrm(3,4,SP) || I64) &&
(config.flags4 & CFG4space ||
config.target_cpu < TARGET_PentiumPro)
)
{
if ((u & 0xFFFFFF00) == 0xFFFFFF00)
goto L2;
else if (rm < modregrm(3,0,0) || (!c->Irex && ereg < 4))
{ if (!shortop)
{ if ((u & 0xFFFF00FF) == 0xFFFF00FF)
goto L3;
}
else
{
if ((u & 0xFF) == 0xFF)
goto L3;
}
}
}
if (!shortop && useopsize)
{
if ((u & 0xFFFF0000) == 0xFFFF0000)
{ c->Iflags ^= CFopsize;
goto L1;
}
if ((u & 0xFFFF) == 0xFFFF && rm < modregrm(3,4,AX))
{ c->IEVoffset1 += 2; /* address MSW */
c->IEV2.Vuns >>= 16;
c->Iflags ^= CFopsize;
goto L1;
}
if (rm >= modregrm(3,4,AX))
{
if (u == 0xFF && (rm <= modregrm(3,4,BX) || I64))
{ c->Iop = 0x0FB6; // MOVZX
c->Irm = modregrm(3,ereg,ereg);
if (c->Irex & REX_B)
c->Irex |= REX_R;
goto L1;
}
if (u == 0xFFFF)
{ c->Iop = 0x0FB7; // MOVZX
c->Irm = modregrm(3,ereg,ereg);
if (c->Irex & REX_B)
c->Irex |= REX_R;
goto L1;
}
}
}
}
}
/* Look for ADD,OR,SUB,XOR with u that we can eliminate */
if (!flags &&
(op == 0x81 || op == 0x80) &&
(reg == modregrm(0,0,0) || reg == modregrm(0,1,0) || // ADD,OR
reg == modregrm(0,5,0) || reg == modregrm(0,6,0)) // SUB, XOR
)
{
if (u == 0)
{
c->Iop = NOP;
goto L1;
}
if (u == ~0 && reg == modregrm(0,6,0)) /* XOR */
{
c->Iop = 0xF6 | (op & 1); /* NOT */
c->Irm ^= modregrm(0,6^2,0);
goto L1;
}
if (!shortop &&
useopsize &&
op == 0x81 &&
(u & 0xFFFF0000) == 0 &&
(reg == modregrm(0,6,0) || reg == modregrm(0,1,0)))
{ c->Iflags ^= CFopsize;
goto L1;
}
}
/* Look for TEST or OR or XOR with an immediate constant */
/* that we can replace with a byte operation */
if (op == 0xF7 && reg == modregrm(0,0,0) ||
op == 0x81 && reg == modregrm(0,6,0) && !flags ||
op == 0x81 && reg == modregrm(0,1,0))
{
// See if we can replace a dword with a word
// (avoid for 32 bit instructions, because CFopsize
// is too slow)
if (!shortop && useopsize)
{ if ((u & 0xFFFF0000) == 0)
{ c->Iflags ^= CFopsize;
goto L1;
}
/* If memory (not register) addressing mode */
if ((u & 0xFFFF) == 0 && rm < modregrm(3,0,AX))
{ c->IEVoffset1 += 2; /* address MSW */
c->IEV2.Vuns >>= 16;
c->Iflags ^= CFopsize;
goto L1;
}
}
// If EA is not SI or DI
if (rm < (modregrm(3,0,SP) | reg) &&
(usespace ||
config.target_cpu < TARGET_PentiumPro)
)
{
if ((u & 0xFFFFFF00) == 0)
{
L2: c->Iop--; /* to byte instruction */
c->Iflags &= ~CFopsize;
goto L1;
}
if (((u & 0xFFFF00FF) == 0 ||
(shortop && (u & 0xFF) == 0)) &&
(rm < modregrm(3,0,0) || (!c->Irex && ereg < 4)))
{
L3:
c->IEV2.Vuns >>= 8;
if (rm >= (modregrm(3,0,AX) | reg))
c->Irm |= 4; /* AX->AH, BX->BH, etc. */
else
c->IEVoffset1 += 1;
goto L2;
}
}
#if 0
// BUG: which is right?
else if ((u & 0xFFFF0000) == 0)
#else
else if (0 && op == 0xF7 &&
rm >= modregrm(3,0,SP) &&
(u & 0xFFFF0000) == 0)
#endif
c->Iflags &= ~CFopsize;
}
// Try to replace TEST reg,-1 with TEST reg,reg
if (op == 0xF6 && rm >= modregrm(3,0,AX) && rm <= modregrm(3,0,7)) // TEST regL,immed8
{ if ((u & 0xFF) == 0xFF)
{
L4: c->Iop = 0x84; // TEST regL,regL
c->Irm = modregrm(3,ereg,ereg);
if (c->Irex & REX_B)
c->Irex |= REX_R;
c->Iflags &= ~CFopsize;
goto L1;
}
}
if (op == 0xF7 && rm >= modregrm(3,0,AX) && rm <= modregrm(3,0,7) && (I64 || ereg < 4))
{ if (u == 0xFF)
goto L4;
if ((u & 0xFFFF) == 0xFF00 && shortop && !c->Irex && ereg < 4)
{ ereg |= 4; /* to regH */
goto L4;
}
}
/* Look for sign extended immediate data */
if ((signed char) u == u)
{
if (op == 0x81)
{ if (reg != 0x08 && reg != 0x20 && reg != 0x30)
c->Iop = op = 0x83; /* 8 bit sgn ext */
}
else if (op == 0x69) /* IMUL rw,ew,dw */
c->Iop = op = 0x6B; /* IMUL rw,ew,db */
}
// Look for SHIFT EA,imm8 we can replace with short form
if (u == 1 && ((op & 0xFE) == 0xC0))
c->Iop |= 0xD0;
} /* if immediate second operand */
/* Look for AX short form */
if (ins & A)
{ if (rm == modregrm(0,AX,local_BPRM) &&
!(c->Irex & REX_R) && // and it's AX, not R8
(op & ~3) == 0x88 &&
!I64)
{ op = ((op & 3) + 0xA0) ^ 2;
/* 8A-> A0 */
/* 8B-> A1 */
/* 88-> A2 */
/* 89-> A3 */
c->Iop = op;
c->IFL2 = c->IFL1;
c->IEV2 = c->IEV1;
}
/* Replace MOV REG1,REG2 with MOV EREG1,EREG2 */
else if (!I16 &&
(op == 0x89 || op == 0x8B) &&
(rm & 0xC0) == 0xC0 &&
(!b || b->BC != BCasm)
)
c->Iflags &= ~CFopsize;
// If rm is AX
else if ((rm & modregrm(3,0,7)) == modregrm(3,0,AX) && !(c->Irex & (REX_R | REX_B)))
{ switch (op)
{ case 0x80: op = reg | 4; break;
case 0x81: op = reg | 5; break;
case 0x87: op = 0x90 + (reg>>3); break; // XCHG
case 0xF6:
if (reg == 0)
op = 0xA8; /* TEST AL,immed8 */
break;
case 0xF7:
if (reg == 0)
op = 0xA9; /* TEST AX,immed16 */
break;
}
c->Iop = op;
}
}
/* Look for reg short form */
if ((ins & R) && (rm & 0xC0) == 0xC0)
{ switch (op)
{ case 0xC6: op = 0xB0 + ereg; break;
case 0xC7: // if no sign extension
if (!(c->Irex & REX_W && c->IEV2.Vint < 0))
{
c->Irm = 0;
c->Irex &= ~REX_W;
op = 0xB8 + ereg;
}
break;
case 0xFF:
switch (reg)
{ case 6<<3: op = 0x50+ereg; break;/* PUSH*/
case 0<<3: if (!I64) op = 0x40+ereg; break; /* INC*/
case 1<<3: if (!I64) op = 0x48+ereg; break; /* DEC*/
}
break;
case 0x8F: op = 0x58 + ereg; break;
case 0x87:
if (reg == 0 && !(c->Irex & (REX_R | REX_B))) // Issue 12968: Needed to ensure it's referencing RAX, not R8
op = 0x90 + ereg;
break;
}
c->Iop = op;
}
// Look to remove redundant REX prefix on XOR
if (c->Irex == REX_W // ignore ops involving R8..R15
&& (op == 0x31 || op == 0x33) // XOR
&& ((rm & 0xC0) == 0xC0) // register direct
&& ((reg >> 3) == ereg)) // register with itself
{
c->Irex = 0;
}
// Look to replace SHL reg,1 with ADD reg,reg
if ((op & ~1) == 0xD0 &&
(rm & modregrm(3,7,0)) == modregrm(3,4,0) &&
config.target_cpu >= TARGET_80486)
{
c->Iop &= 1;
c->Irm = (rm & modregrm(3,0,7)) | (ereg << 3);
if (c->Irex & REX_B)
c->Irex |= REX_R;
if (!(c->Iflags & CFpsw) && !I16)
c->Iflags &= ~CFopsize;
goto L1;
}
/* Look for sign extended modregrm displacement, or 0
* displacement.
*/
if (((rm & 0xC0) == 0x80) && // it's a 16/32 bit disp
c->IFL1 == FLconst) // and it's a constant
{
a = c->IEVpointer1;
if (a == 0 && (rm & 7) != local_BPRM && // if 0[disp]
!(local_BPRM == 5 && (rm & 7) == 4 && (c->Isib & 7) == BP)
)
c->Irm &= 0x3F;
else if (!I16)
{
if ((targ_size_t)(targ_schar)a == a)
c->Irm ^= 0xC0; /* do 8 sx */
}
else if (((targ_size_t)(targ_schar)a & 0xFFFF) == (a & 0xFFFF))
c->Irm ^= 0xC0; /* do 8 sx */
}
/* Look for LEA reg,[ireg], replace with MOV reg,ireg */
if (op == LEA)
{ rm = c->Irm & 7;
mod = c->Irm & modregrm(3,0,0);
if (mod == 0)
{
if (!I16)
{
switch (rm)
{
case 4:
case 5:
break;
default:
c->Irm |= modregrm(3,0,0);
c->Iop = 0x8B;
break;
}
}
else
{
switch (rm)
{
case 4: rm = modregrm(3,0,SI); goto L6;
case 5: rm = modregrm(3,0,DI); goto L6;
case 7: rm = modregrm(3,0,BX); goto L6;
L6: c->Irm = rm + reg;
c->Iop = 0x8B;
break;
}
}
}
/* replace LEA reg,0[BP] with MOV reg,BP */
else if (mod == modregrm(1,0,0) && rm == local_BPRM &&
c->IFL1 == FLconst && c->IEVpointer1 == 0)
{ c->Iop = 0x8B; /* MOV reg,BP */
c->Irm = modregrm(3,0,BP) + reg;
}
}
// Replace [R13] with 0[R13]
if (c->Irex & REX_B && ((c->Irm & modregrm(3,0,7)) == modregrm(0,0,BP) ||
issib(c->Irm) && (c->Irm & modregrm(3,0,0)) == 0 && (c->Isib & 7) == BP))
{
c->Irm |= modregrm(1,0,0);
c->IFL1 = FLconst;
c->IEVpointer1 = 0;
}
}
else if (!(c->Iflags & CFvex))
{
switch (op)
{
default:
// Look for MOV r64, immediate
if ((c->Irex & REX_W) && (op & ~7) == 0xB8)
{
/* Look for zero extended immediate data */
if (c->IEV2.Vsize_t == c->IEV2.Vuns)
{
c->Irex &= ~REX_W;
}
/* Look for sign extended immediate data */
else if (c->IEV2.Vsize_t == c->IEV2.Vint)
{
c->Irm = modregrm(3,0,op & 7);
c->Iop = op = 0xC7;
c->IEV2.Vsize_t = c->IEV2.Vuns;
}
}
if ((op & ~0x0F) != 0x70)
break;
case JMP:
switch (c->IFL2)
{ case FLcode:
if (c->IEV2.Vcode == code_next(c))
{ c->Iop = NOP;
continue;
}
break;
case FLblock:
if (!code_next(c) && c->IEV2.Vblock == bn)
{ c->Iop = NOP;
continue;
}
break;
case FLconst:
case FLfunc:
case FLextern:
break;
default:
WRFL((enum FL)c->IFL2);
assert(0);
}
break;
case 0x68: // PUSH immed16
if (c->IFL2 == FLconst)
{
targ_long u = c->IEV2.Vuns;
if (I64 ||
((c->Iflags & CFopsize) ? I16 : I32))
{ // PUSH 32/64 bit operand
if (u == (signed char) u)
c->Iop = 0x6A; // PUSH immed8
}
else // PUSH 16 bit operand
{ if ((short)u == (signed char) u)
c->Iop = 0x6A; // PUSH immed8
}
}
break;
}
}
}
#if 0
if (1 || debugc) {
printf("-pinholeopt(%p)\n",cstart);
for (c = cstart; c; c = code_next(c))
c->print();
}
#endif
}
#ifdef DEBUG
STATIC void pinholeopt_unittest()
{
//printf("pinholeopt_unittest()\n");
struct CS {
unsigned model,op,ea;
targ_size_t ev1,ev2;
unsigned flags;
} tests[][2] =
{
// XOR reg,immed NOT regL
{{ 16,0x81,modregrm(3,6,BX),0,0xFF,0 }, { 0,0xF6,modregrm(3,2,BX),0,0xFF }},
// MOV 0[BX],3 MOV [BX],3
{{ 16,0xC7,modregrm(2,0,7),0,3}, { 0,0xC7,modregrm(0,0,7),0,3 }},
#if 0 // only if config.flags4 & CFG4space
// TEST regL,immed8
{{ 0,0xF6,modregrm(3,0,BX),0,0xFF,0 }, { 0,0x84,modregrm(3,BX,BX),0,0xFF }},
{{ 0,0xF7,modregrm(3,0,BX),0,0xFF,0 }, { 0,0x84,modregrm(3,BX,BX),0,0xFF }},
{{ 64,0xF6,modregrmx(3,0,R8),0,0xFF,0 }, { 0,0x84,modregxrmx(3,R8,R8),0,0xFF }},
{{ 64,0xF7,modregrmx(3,0,R8),0,0xFF,0 }, { 0,0x84,modregxrmx(3,R8,R8),0,0xFF }},
#endif
// PUSH immed => PUSH immed8
{{ 0,0x68,0,0,0 }, { 0,0x6A,0,0,0 }},
{{ 0,0x68,0,0,0x7F }, { 0,0x6A,0,0,0x7F }},
{{ 0,0x68,0,0,0x80 }, { 0,0x68,0,0,0x80 }},
{{ 16,0x68,0,0,0,CFopsize }, { 0,0x6A,0,0,0,CFopsize }},
{{ 16,0x68,0,0,0x7F,CFopsize }, { 0,0x6A,0,0,0x7F,CFopsize }},
{{ 16,0x68,0,0,0x80,CFopsize }, { 0,0x68,0,0,0x80,CFopsize }},
{{ 16,0x68,0,0,0x10000,0 }, { 0,0x6A,0,0,0x10000,0 }},
{{ 16,0x68,0,0,0x10000,CFopsize }, { 0,0x68,0,0,0x10000,CFopsize }},
{{ 32,0x68,0,0,0,CFopsize }, { 0,0x6A,0,0,0,CFopsize }},
{{ 32,0x68,0,0,0x7F,CFopsize }, { 0,0x6A,0,0,0x7F,CFopsize }},
{{ 32,0x68,0,0,0x80,CFopsize }, { 0,0x68,0,0,0x80,CFopsize }},
{{ 32,0x68,0,0,0x10000,CFopsize }, { 0,0x6A,0,0,0x10000,CFopsize }},
{{ 32,0x68,0,0,0x8000,CFopsize }, { 0,0x68,0,0,0x8000,CFopsize }},
// clear r64, for r64 != R8..R15
{{ 64,0x31,0x800C0,0,0,0 }, { 0,0x31,0xC0,0,0,0}},
{{ 64,0x33,0x800C0,0,0,0 }, { 0,0x33,0xC0,0,0,0}},
// MOV r64, immed
{{ 64,0xC7,0x800C0,0,0xFFFFFFFF,0 }, { 0,0xC7,0x800C0,0,0xFFFFFFFF,0}},
{{ 64,0xC7,0x800C0,0,0x7FFFFFFF,0 }, { 0,0xB8,0,0,0x7FFFFFFF,0}},
{{ 64,0xB8,0x80000,0,0xFFFFFFFF,0 }, { 0,0xB8,0,0,0xFFFFFFFF,0 }},
{{ 64,0xB8,0x80000,0,0x1FFFFFFFF,0 }, { 0,0xB8,0x80000,0,0x1FFFFFFFF,0 }},
{{ 64,0xB8,0x80000,0,0xFFFFFFFFFFFFFFFF,0 }, { 0,0xC7,0x800C0,0,0xFFFFFFFF,0}},
};
//config.flags4 |= CFG4space;
for (int i = 0; i < sizeof(tests)/sizeof(tests[0]); i++)
{ CS *pin = &tests[i][0];
CS *pout = &tests[i][1];
code cs;
memset(&cs, 0, sizeof(cs));
if (pin->model)
{
if (I16 && pin->model != 16)
continue;
if (I32 && pin->model != 32)
continue;
if (I64 && pin->model != 64)
continue;
}
//printf("[%d]\n", i);
cs.Iop = pin->op;
cs.Iea = pin->ea;
cs.IFL1 = FLconst;
cs.IFL2 = FLconst;
cs.IEV1.Vsize_t = pin->ev1;
cs.IEV2.Vsize_t = pin->ev2;
cs.Iflags = pin->flags;
pinholeopt(&cs, NULL);
if (cs.Iop != pout->op)
{ printf("[%d] Iop = x%02x, pout = x%02x\n", i, cs.Iop, pout->op);
assert(0);
}
assert(cs.Iea == pout->ea);
assert(cs.IEV1.Vsize_t == pout->ev1);
assert(cs.IEV2.Vsize_t == pout->ev2);
assert(cs.Iflags == pout->flags);
}
}
#endif
void simplify_code(code* c)
{
unsigned reg;
if (config.flags4 & CFG4optimized &&
(c->Iop == 0x81 || c->Iop == 0x80) &&
c->IFL2 == FLconst &&
reghasvalue((c->Iop == 0x80) ? BYTEREGS : ALLREGS,I64 ? c->IEV2.Vsize_t : c->IEV2.Vlong,®) &&
!(I16 && c->Iflags & CFopsize)
)
{
// See if we can replace immediate instruction with register instruction
static unsigned char regop[8] =
{ 0x00,0x08,0x10,0x18,0x20,0x28,0x30,0x38 };
//printf("replacing 0x%02x, val = x%lx\n",c->Iop,c->IEV2.Vlong);
c->Iop = regop[(c->Irm & modregrm(0,7,0)) >> 3] | (c->Iop & 1);
code_newreg(c, reg);
if (I64 && !(c->Iop & 1) && (reg & 4))
c->Irex |= REX;
}
}
/**************************
* Compute jump addresses for FLcode.
* Note: only works for forward referenced code.
* only direct jumps and branches are detected.
* LOOP instructions only work for backward refs.
*/
void jmpaddr(code *c)
{ code *ci,*cn,*ctarg,*cstart;
targ_size_t ad;
unsigned op;
//printf("jmpaddr()\n");
cstart = c; /* remember start of code */
while (c)
{
op = c->Iop;
if (op <= 0xEB &&
inssize[op] & T && // if second operand
c->IFL2 == FLcode &&
((op & ~0x0F) == 0x70 || op == JMP || op == JMPS || op == JCXZ || op == CALL))
{ ci = code_next(c);
ctarg = c->IEV2.Vcode; /* target code */
ad = 0; /* IP displacement */
while (ci && ci != ctarg)
{
ad += calccodsize(ci);
ci = code_next(ci);
}
if (!ci)
goto Lbackjmp; // couldn't find it
if (!I16 || op == JMP || op == JMPS || op == JCXZ || op == CALL)
c->IEVpointer2 = ad;
else /* else conditional */
{ if (!(c->Iflags & CFjmp16)) /* if branch */
c->IEVpointer2 = ad;
else /* branch around a long jump */
{ cn = code_next(c);
code_next(c) = code_calloc();
code_next(code_next(c)) = cn;
c->Iop = op ^ 1; /* converse jmp */
c->Iflags &= ~CFjmp16;
c->IEVpointer2 = I16 ? 3 : 5;
cn = code_next(c);
cn->Iop = JMP; /* long jump */
cn->IFL2 = FLconst;
cn->IEVpointer2 = ad;
}
}
c->IFL2 = FLconst;
}
if (op == LOOP && c->IFL2 == FLcode) /* backwards refs */
{
Lbackjmp:
ctarg = c->IEV2.Vcode;
for (ci = cstart; ci != ctarg; ci = code_next(ci))
if (!ci || ci == c)
assert(0);
ad = 2; /* - IP displacement */
while (ci != c)
{ assert(ci);
ad += calccodsize(ci);
ci = code_next(ci);
}
c->IEVpointer2 = (-ad) & 0xFF;
c->IFL2 = FLconst;
}
c = code_next(c);
}
}
/*******************************
* Calculate bl->Bsize.
*/
unsigned calcblksize(code *c)
{ unsigned size;
for (size = 0; c; c = code_next(c))
{
unsigned sz = calccodsize(c);
//printf("off=%02x, sz = %d, code %p: op=%02x\n", size, sz, c, c->Iop);
size += sz;
}
//printf("calcblksize(c = x%x) = %d\n", c, size);
return size;
}
/*****************************
* Calculate and return code size of a code.
* Note that NOPs are sometimes used as markers, but are
* never output. LINNUMs are never output.
* Note: This routine must be fast. Profiling shows it is significant.
*/
unsigned calccodsize(code *c)
{ unsigned size;
unsigned op;
unsigned char rm,mod,ins;
unsigned iflags;
unsigned i32 = I32 || I64;
unsigned a32 = i32;
#ifdef DEBUG
assert((a32 & ~1) == 0);
#endif
iflags = c->Iflags;
op = c->Iop;
if (iflags & CFvex && c->Ivex.pfx == 0xC4)
{
ins = vex_inssize(c);
size = ins & 7;
goto Lmodrm;
}
else if ((op & 0xFF00) == 0x0F00 || (op & 0xFFFD00) == 0x0F3800)
op = 0x0F;
else
op &= 0xFF;
switch (op)
{
case 0x0F:
if ((c->Iop & 0xFFFD00) == 0x0F3800)
{ // 3 byte op ( 0F38-- or 0F3A-- )
ins = inssize2[(c->Iop >> 8) & 0xFF];
size = ins & 7;
if (c->Iop & 0xFF000000)
size++;
}
else
{ // 2 byte op ( 0F-- )
ins = inssize2[c->Iop & 0xFF];
size = ins & 7;
if (c->Iop & 0xFF0000)
size++;
}
break;
case NOP:
case ESCAPE:
size = 0; // since these won't be output
goto Lret2;
case ASM:
if (c->Iflags == CFaddrsize) // kludge for DA inline asm
size = NPTRSIZE;
else
size = c->IEV1.as.len;
goto Lret2;
case 0xA1:
case 0xA3:
if (c->Irex)
{
size = 9; // 64 bit immediate value for MOV to/from RAX
goto Lret;
}
goto Ldefault;
case 0xF6: /* TEST mem8,immed8 */
ins = inssize[op];
size = ins & 7;
if (i32)
size = inssize32[op];
if ((c->Irm & (7<<3)) == 0)
size++; /* size of immed8 */
break;
case 0xF7:
ins = inssize[op];
size = ins & 7;
if (i32)
size = inssize32[op];
if ((c->Irm & (7<<3)) == 0)
size += (i32 ^ ((iflags & CFopsize) !=0)) ? 4 : 2;
break;
default:
Ldefault:
ins = inssize[op];
size = ins & 7;
if (i32)
size = inssize32[op];
}
if (iflags & (CFwait | CFopsize | CFaddrsize | CFSEG))
{
if (iflags & CFwait) // if add FWAIT prefix
size++;
if (iflags & CFSEG) // if segment override
size++;
// If the instruction has a second operand that is not an 8 bit,
// and the operand size prefix is present, then fix the size computation
// because the operand size will be different.
// Walter, I had problems with this bit at the end. There can still be
// an ADDRSIZE prefix for these and it does indeed change the operand size.
if (iflags & (CFopsize | CFaddrsize))
{
if ((ins & (T|E)) == T)
{
if ((op & 0xAC) == 0xA0)
{
if (iflags & CFaddrsize && !I64)
{ if (I32)
size -= 2;
else
size += 2;
}
}
else if (iflags & CFopsize)
{ if (I16)
size += 2;
else
size -= 2;
}
}
if (iflags & CFaddrsize)
{ if (!I64)
a32 ^= 1;
size++;
}
if (iflags & CFopsize)
size++; /* +1 for OPSIZE prefix */
}
}
Lmodrm:
if ((op & ~0x0F) == 0x70)
{ if (iflags & CFjmp16) // if long branch
size += I16 ? 3 : 4; // + 3(4) bytes for JMP
}
else if (ins & M) // if modregrm byte
{
rm = c->Irm;
mod = rm & 0xC0;
if (a32 || I64)
{ // 32 bit addressing
if (issib(rm))
size++;
switch (mod)
{ case 0:
if (issib(rm) && (c->Isib & 7) == 5 ||
(rm & 7) == 5)
size += 4; /* disp32 */
if (c->Irex & REX_B && (rm & 7) == 5)
/* Instead of selecting R13, this mode is an [RIP] relative
* address. Although valid, it's redundant, and should not
* be generated. Instead, generate 0[R13] instead of [R13].
*/
assert(0);
break;
case 0x40:
size++; /* disp8 */
break;
case 0x80:
size += 4; /* disp32 */
break;
}
}
else
{ // 16 bit addressing
if (mod == 0x40) /* 01: 8 bit displacement */
size++;
else if (mod == 0x80 || (mod == 0 && (rm & 7) == 6))
size += 2;
}
}
Lret:
if (!(iflags & CFvex) && c->Irex)
{ size++;
if (c->Irex & REX_W && (op & ~7) == 0xB8)
size += 4;
}
Lret2:
//printf("op = x%02x, size = %d\n",op,size);
return size;
}
/********************************
* Return !=0 if codes match.
*/
#if 0
int code_match(code *c1,code *c2)
{ code cs1,cs2;
unsigned char ins;
if (c1 == c2)
goto match;
cs1 = *c1;
cs2 = *c2;
if (cs1.Iop != cs2.Iop)
goto nomatch;
switch (cs1.Iop)
{
case ESCAPE | ESCctor:
case ESCAPE | ESCdtor:
goto nomatch;
case NOP:
goto match;
case ASM:
if (cs1.IEV1.as.len == cs2.IEV1.as.len &&
memcmp(cs1.IEV1.as.bytes,cs2.IEV1.as.bytes,cs1.EV1.as.len) == 0)
goto match;
else
goto nomatch;
default:
if ((cs1.Iop & 0xFF) == ESCAPE)
goto match;
break;
}
if (cs1.Iflags != cs2.Iflags)
goto nomatch;
ins = inssize[cs1.Iop & 0xFF];
if ((cs1.Iop & 0xFFFD00) == 0x0F3800)
{
ins = inssize2[(cs1.Iop >> 8) & 0xFF];
}
else if ((cs1.Iop & 0xFF00) == 0x0F00)
{
ins = inssize2[cs1.Iop & 0xFF];
}
if (ins & M) // if modregrm byte
{
if (cs1.Irm != cs2.Irm)
goto nomatch;
if ((cs1.Irm & 0xC0) == 0xC0)
goto do2;
if (is32bitaddr(I32,cs1.Iflags))
{
if (issib(cs1.Irm) && cs1.Isib != cs2.Isib)
goto nomatch;
if (
((rm & 0xC0) == 0 && !((rm & 7) == 4 && (c->Isib & 7) == 5 || (rm & 7) == 5))
)
goto do2; /* if no first operand */
}
else
{
if (
((rm & 0xC0) == 0 && !((rm & 7) == 6))
)
goto do2; /* if no first operand */
}
if (cs1.IFL1 != cs2.IFL1)
goto nomatch;
if (flinsymtab[cs1.IFL1] && cs1.IEVsym1 != cs2.IEVsym1)
goto nomatch;
if (cs1.IEVoffset1 != cs2.IEVoffset1)
goto nomatch;
}
do2:
if (!(ins & T)) // if no second operand
goto match;
if (cs1.IFL2 != cs2.IFL2)
goto nomatch;
if (flinsymtab[cs1.IFL2] && cs1.IEVsym2 != cs2.IEVsym2)
goto nomatch;
if (cs1.IEVoffset2 != cs2.IEVoffset2)
goto nomatch;
match:
return 1;
nomatch:
return 0;
}
#endif
/**************************
* Write code to intermediate file.
* Code starts at offset.
* Returns:
* addr of end of code
*/
struct MiniCodeBuf
{
size_t index;
size_t offset;
int seg;
char bytes[100];
MiniCodeBuf(int seg)
{
index = 0;
this->offset = Offset(seg);
this->seg = seg;
}
void flushx()
{
// Emit accumulated bytes to code segment
#ifdef DEBUG
assert(index < sizeof(bytes));
#endif
offset += objmod->bytes(seg, offset, index, bytes);
index = 0;
}
void gen(char c) { bytes[index++] = c; }
void genp(size_t n, void *p) { memcpy(&bytes[index], p, n); index += n; }
void flush() { if (index) flushx(); }
unsigned getOffset() { return offset + index; }
unsigned available() { return sizeof(bytes) - index; }
};
static void do8bit(MiniCodeBuf *pbuf, enum FL,union evc *);
static void do16bit(MiniCodeBuf *pbuf, enum FL,union evc *,int);
static void do32bit(MiniCodeBuf *pbuf, enum FL,union evc *,int,int = 0);
static void do64bit(MiniCodeBuf *pbuf, enum FL,union evc *,int);
unsigned codout(int seg, code *c)
{ unsigned op;
unsigned char rm,mod;
unsigned char ins;
code *cn;
unsigned flags;
symbol *s;
#ifdef DEBUG
if (debugc) printf("codout(%p), Coffset = x%llx\n",c,(unsigned long long)Offset(seg));
#endif
MiniCodeBuf ggen(seg);
for (; c; c = code_next(c))
{
#ifdef DEBUG
if (debugc) { printf("off=%02lx, sz=%ld, ",(long)ggen.getOffset(),(long)calccodsize(c)); c->print(); }
unsigned startoffset = ggen.getOffset();
#endif
op = c->Iop;
ins = inssize[op & 0xFF];
switch (op & 0xFF)
{ case ESCAPE:
/* Check for SSE4 opcode v/pmaxuw xmm1,xmm2/m128 */
if(op == 0x660F383E || c->Iflags & CFvex) break;
switch (op & 0xFFFF00)
{ case ESClinnum:
/* put out line number stuff */
objmod->linnum(c->IEV1.Vsrcpos,seg,ggen.getOffset());
break;
#if SCPP
#if 1
case ESCctor:
case ESCdtor:
case ESCoffset:
if (config.exe != EX_WIN32)
except_pair_setoffset(c,ggen.getOffset() - funcoffset);
break;
case ESCmark:
case ESCrelease:
case ESCmark2:
case ESCrelease2:
break;
#else
case ESCctor:
except_push(ggen.getOffset() - funcoffset,c->IEV1.Vtor,NULL);
break;
case ESCdtor:
except_pop(ggen.getOffset() - funcoffset,c->IEV1.Vtor,NULL);
break;
case ESCmark:
except_mark();
break;
case ESCrelease:
except_release();
break;
#endif
#endif
case ESCadjesp:
//printf("adjust ESP %ld\n", (long)c->IEV1.Vint);
break;
}
#ifdef DEBUG
assert(calccodsize(c) == 0);
#endif
continue;
case NOP: /* don't send them out */
if (op != NOP)
break;
#ifdef DEBUG
assert(calccodsize(c) == 0);
#endif
continue;
case ASM:
if (op != ASM)
break;
ggen.flush();
if (c->Iflags == CFaddrsize) // kludge for DA inline asm
{
do32bit(&ggen, FLblockoff,&c->IEV1,0);
}
else
{
ggen.offset += objmod->bytes(seg,ggen.offset,c->IEV1.as.len,c->IEV1.as.bytes);
}
#ifdef DEBUG
assert(calccodsize(c) == c->IEV1.as.len);
#endif
continue;
}
flags = c->Iflags;
// See if we need to flush (don't have room for largest code sequence)
if (ggen.available() < (1+4+4+8+8))
ggen.flush();
// see if we need to put out prefix bytes
if (flags & (CFwait | CFPREFIX | CFjmp16))
{ int override;
if (flags & CFwait)
ggen.gen(0x9B); // FWAIT
/* ? SEGES : SEGSS */
switch (flags & CFSEG)
{ case CFes: override = SEGES; goto segover;
case CFss: override = SEGSS; goto segover;
case CFcs: override = SEGCS; goto segover;
case CFds: override = SEGDS; goto segover;
case CFfs: override = SEGFS; goto segover;
case CFgs: override = SEGGS; goto segover;
segover: ggen.gen(override);
break;
}
if (flags & CFaddrsize)
ggen.gen(0x67);
// Do this last because of instructions like ADDPD
if (flags & CFopsize)
ggen.gen(0x66); /* operand size */
if ((op & ~0x0F) == 0x70 && flags & CFjmp16) /* long condit jmp */
{
if (!I16)
{ // Put out 16 bit conditional jump
c->Iop = op = 0x0F00 | (0x80 | (op & 0x0F));
}
else
{
cn = code_calloc();
/*cxcalloc++;*/
code_next(cn) = code_next(c);
code_next(c) = cn; // link into code
cn->Iop = JMP; // JMP block
cn->IFL2 = c->IFL2;
cn->IEV2.Vblock = c->IEV2.Vblock;
c->Iop = op ^= 1; // toggle condition
c->IFL2 = FLconst;
c->IEVpointer2 = I16 ? 3 : 5; // skip over JMP block
c->Iflags &= ~CFjmp16;
}
}
}
if (flags & CFvex)
{
if (flags & CFvex3)
{
ggen.gen(0xC4);
ggen.gen(VEX3_B1(c->Ivex));
ggen.gen(VEX3_B2(c->Ivex));
ggen.gen(c->Ivex.op);
}
else
{
ggen.gen(0xC5);
ggen.gen(VEX2_B1(c->Ivex));
ggen.gen(c->Ivex.op);
}
ins = vex_inssize(c);
goto Lmodrm;
}
if (op > 0xFF)
{
if ((op & 0xFFFD00) == 0x0F3800)
ins = inssize2[(op >> 8) & 0xFF];
else if ((op & 0xFF00) == 0x0F00)
ins = inssize2[op & 0xFF];
if (op & 0xFF000000)
{
unsigned char op1 = op >> 24;
if (op1 == 0xF2 || op1 == 0xF3 || op1 == 0x66)
{
ggen.gen(op1);
if (c->Irex)
ggen.gen(c->Irex | REX);
}
else
{
if (c->Irex)
ggen.gen(c->Irex | REX);
ggen.gen(op1);
}
ggen.gen((op >> 16) & 0xFF);
ggen.gen((op >> 8) & 0xFF);
ggen.gen(op & 0xFF);
}
else if (op & 0xFF0000)
{
unsigned char op1 = op >> 16;
if (op1 == 0xF2 || op1 == 0xF3 || op1 == 0x66)
{
ggen.gen(op1);
if (c->Irex)
ggen.gen(c->Irex | REX);
}
else
{
if (c->Irex)
ggen.gen(c->Irex | REX);
ggen.gen(op1);
}
ggen.gen((op >> 8) & 0xFF);
ggen.gen(op & 0xFF);
}
else
{
if (c->Irex)
ggen.gen(c->Irex | REX);
ggen.gen((op >> 8) & 0xFF);
ggen.gen(op & 0xFF);
}
}
else
{
if (c->Irex)
ggen.gen(c->Irex | REX);
ggen.gen(op);
}
Lmodrm:
if (ins & M) /* if modregrm byte */
{
rm = c->Irm;
ggen.gen(rm);
// Look for an address size override when working with the
// MOD R/M and SIB bytes
if (is32bitaddr( I32, flags))
{
if (issib(rm))
ggen.gen(c->Isib);
switch (rm & 0xC0)
{ case 0x40:
do8bit(&ggen, (enum FL) c->IFL1,&c->IEV1); // 8 bit
break;
case 0:
if (!(issib(rm) && (c->Isib & 7) == 5 ||
(rm & 7) == 5))
break;
case 0x80:
{
int cfflags = CFoff;
targ_size_t val = 0;
if (I64)
{
if ((rm & modregrm(3,0,7)) == modregrm(0,0,5)) // if disp32[RIP]
{
cfflags |= CFpc32;
val = -4;
unsigned reg = rm & modregrm(0,7,0);
if (ins & T ||
((op == 0xF6 || op == 0xF7) && (reg == modregrm(0,0,0) || reg == modregrm(0,1,0))))
{ if (ins & E || op == 0xF6)
val = -5;
else if (c->Iflags & CFopsize)
val = -6;
else
val = -8;
}
#if TARGET_OSX || TARGET_WINDOS
/* Mach-O and Win64 fixups already take the 4 byte size
* into account, so bias by 4
` */
val += 4;
#endif
}
}
do32bit(&ggen, (enum FL)c->IFL1,&c->IEV1,cfflags,val);
break;
}
}
}
else
{
switch (rm & 0xC0)
{ case 0x40:
do8bit(&ggen, (enum FL) c->IFL1,&c->IEV1); // 8 bit
break;
case 0:
if ((rm & 7) != 6)
break;
case 0x80:
do16bit(&ggen, (enum FL)c->IFL1,&c->IEV1,CFoff);
break;
}
}
}
else
{
if (op == 0xC8)
do16bit(&ggen, (enum FL)c->IFL1,&c->IEV1,0);
}
flags &= CFseg | CFoff | CFselfrel;
if (ins & T) /* if second operand */
{ if (ins & E) /* if data-8 */
do8bit(&ggen, (enum FL) c->IFL2,&c->IEV2);
else if (!I16)
{
switch (op)
{ case 0xC2: /* RETN imm16 */
case 0xCA: /* RETF imm16 */
do16:
do16bit(&ggen, (enum FL)c->IFL2,&c->IEV2,flags);
break;
case 0xA1:
case 0xA3:
if (I64 && c->Irex)
{
do64:
do64bit(&ggen, (enum FL)c->IFL2,&c->IEV2,flags);
break;
}
case 0xA0: /* MOV AL,byte ptr [] */
case 0xA2:
if (c->Iflags & CFaddrsize && !I64)
goto do16;
else
do32:
do32bit(&ggen, (enum FL)c->IFL2,&c->IEV2,flags);
break;
case 0x9A:
case 0xEA:
if (c->Iflags & CFopsize)
goto ptr1616;
else
goto ptr1632;
case 0x68: // PUSH immed32
if ((enum FL)c->IFL2 == FLblock)
{
c->IFL2 = FLblockoff;
goto do32;
}
else
goto case_default;
case CALL: // CALL rel
case JMP: // JMP rel
flags |= CFselfrel;
goto case_default;
default:
if ((op|0xF) == 0x0F8F) // Jcc rel16 rel32
flags |= CFselfrel;
if (I64 && (op & ~7) == 0xB8 && c->Irex & REX_W)
goto do64;
case_default:
if (c->Iflags & CFopsize)
goto do16;
else
goto do32;
break;
}
}
else
{
switch (op) {
case 0xC2:
case 0xCA:
goto do16;
case 0xA0:
case 0xA1:
case 0xA2:
case 0xA3:
if (c->Iflags & CFaddrsize)
goto do32;
else
goto do16;
break;
case 0x9A:
case 0xEA:
if (c->Iflags & CFopsize)
goto ptr1632;
else
goto ptr1616;
ptr1616:
ptr1632:
//assert(c->IFL2 == FLfunc);
ggen.flush();
if (c->IFL2 == FLdatseg)
{
objmod->reftodatseg(seg,ggen.offset,c->IEVpointer2,
c->IEVseg2,flags);
ggen.offset += 4;
}
else
{
s = c->IEVsym2;
ggen.offset += objmod->reftoident(seg,ggen.offset,s,0,flags);
}
break;
case 0x68: // PUSH immed16
if ((enum FL)c->IFL2 == FLblock)
{ c->IFL2 = FLblockoff;
goto do16;
}
else
goto case_default16;
case CALL:
case JMP:
flags |= CFselfrel;
default:
case_default16:
if (c->Iflags & CFopsize)
goto do32;
else
goto do16;
break;
}
}
}
else if (op == 0xF6) /* TEST mem8,immed8 */
{ if ((rm & (7<<3)) == 0)
do8bit(&ggen, (enum FL)c->IFL2,&c->IEV2);
}
else if (op == 0xF7)
{ if ((rm & (7<<3)) == 0) /* TEST mem16/32,immed16/32 */
{
if ((I32 || I64) ^ ((c->Iflags & CFopsize) != 0))
do32bit(&ggen, (enum FL)c->IFL2,&c->IEV2,flags);
else
do16bit(&ggen, (enum FL)c->IFL2,&c->IEV2,flags);
}
}
#ifdef DEBUG
if (ggen.getOffset() - startoffset != calccodsize(c))
{
printf("actual: %d, calc: %d\n", (int)(ggen.getOffset() - startoffset), (int)calccodsize(c));
c->print();
assert(0);
}
#endif
}
ggen.flush();
Offset(seg) = ggen.offset;
//printf("-codout(), Coffset = x%x\n", Offset(seg));
return ggen.offset; /* ending address */
}
static void do64bit(MiniCodeBuf *pbuf, enum FL fl,union evc *uev,int flags)
{ char *p;
symbol *s;
targ_size_t ad;
assert(I64);
switch (fl)
{
case FLconst:
ad = * (targ_size_t *) uev;
L1:
pbuf->genp(8,&ad);
return;
case FLdatseg:
pbuf->flush();
objmod->reftodatseg(pbuf->seg,pbuf->offset,uev->_EP.Vpointer,uev->_EP.Vseg,CFoffset64 | flags);
break;
case FLframehandler:
framehandleroffset = pbuf->getOffset();
ad = 0;
goto L1;
case FLswitch:
pbuf->flush();
ad = uev->Vswitch->Btableoffset;
if (config.flags & CFGromable)
objmod->reftocodeseg(pbuf->seg,pbuf->offset,ad);
else
objmod->reftodatseg(pbuf->seg,pbuf->offset,ad,objmod->jmpTableSegment(funcsym_p),CFoff);
break;
#if TARGET_SEGMENTED
case FLcsdata:
case FLfardata:
//symbol_print(uev->sp.Vsym);
#endif
// NOTE: In ELFOBJ all symbol refs have been tagged FLextern
// strings and statics are treated like offsets from a
// un-named external with is the start of .rodata or .data
case FLextern: /* external data symbol */
case FLtlsdata:
#if TARGET_LINUX || TARGET_FREEBSD || TARGET_OPENBSD || TARGET_DRAGONFLYBSD || TARGET_SOLARIS
case FLgot:
case FLgotoff:
#endif
pbuf->flush();
s = uev->sp.Vsym; /* symbol pointer */
objmod->reftoident(pbuf->seg,pbuf->offset,s,uev->sp.Voffset,CFoffset64 | flags);
break;
#if TARGET_OSX
case FLgot:
funcsym_p->Slocalgotoffset = pbuf->getOffset();
ad = 0;
goto L1;
#endif
case FLfunc: /* function call */
s = uev->sp.Vsym; /* symbol pointer */
assert(TARGET_SEGMENTED || !tyfarfunc(s->ty()));
pbuf->flush();
objmod->reftoident(pbuf->seg,pbuf->offset,s,0,CFoffset64 | flags);
break;
case FLblock: /* displacement to another block */
ad = uev->Vblock->Boffset - pbuf->getOffset() - 4;
//printf("FLblock: funcoffset = %x, pbuf->getOffset = %x, Boffset = %x, ad = %x\n", funcoffset, pbuf->getOffset(), uev->Vblock->Boffset, ad);
goto L1;
case FLblockoff:
pbuf->flush();
assert(uev->Vblock);
//printf("FLblockoff: offset = %x, Boffset = %x, funcoffset = %x\n", pbuf->offset, uev->Vblock->Boffset, funcoffset);
objmod->reftocodeseg(pbuf->seg,pbuf->offset,uev->Vblock->Boffset);
break;
default:
WRFL(fl);
assert(0);
}
pbuf->offset += 8;
}
static void do32bit(MiniCodeBuf *pbuf, enum FL fl,union evc *uev,int flags, int val)
{ char *p;
symbol *s;
targ_size_t ad;
//printf("do32bit(flags = x%x)\n", flags);
switch (fl)
{
case FLconst:
assert(sizeof(targ_size_t) == 4 || sizeof(targ_size_t) == 8);
ad = * (targ_size_t *) uev;
L1:
pbuf->genp(4,&ad);
return;
case FLdatseg:
pbuf->flush();
objmod->reftodatseg(pbuf->seg,pbuf->offset,uev->_EP.Vpointer,uev->_EP.Vseg,flags);
break;
case FLframehandler:
framehandleroffset = pbuf->getOffset();
ad = 0;
goto L1;
case FLswitch:
pbuf->flush();
ad = uev->Vswitch->Btableoffset;
if (config.flags & CFGromable)
{
#if TARGET_OSX
// These are magic values based on the exact code generated for the switch jump
if (I64)
uev->Vswitch->Btablebase = pbuf->getOffset() + 4;
else
uev->Vswitch->Btablebase = pbuf->getOffset() + 4 - 8;
ad -= uev->Vswitch->Btablebase;
goto L1;
#elif TARGET_WINDOS
if (I64)
{
uev->Vswitch->Btablebase = pbuf->getOffset() + 4;
ad -= uev->Vswitch->Btablebase;
goto L1;
}
else
objmod->reftocodeseg(pbuf->seg,pbuf->offset,ad);
#else
objmod->reftocodeseg(pbuf->seg,pbuf->offset,ad);
#endif
}
else
objmod->reftodatseg(pbuf->seg,pbuf->offset,ad,objmod->jmpTableSegment(funcsym_p),CFoff);
break;
case FLcode:
assert(JMPJMPTABLE); // the only use case
pbuf->flush();
ad = * (targ_size_t *) uev + pbuf->getOffset();
objmod->reftocodeseg(pbuf->seg,pbuf->offset,ad);
break;
case FLcsdata:
case FLfardata:
//symbol_print(uev->sp.Vsym);
// NOTE: In ELFOBJ all symbol refs have been tagged FLextern
// strings and statics are treated like offsets from a
// un-named external with is the start of .rodata or .data
case FLextern: /* external data symbol */
case FLtlsdata:
#if TARGET_LINUX || TARGET_FREEBSD || TARGET_OPENBSD || TARGET_DRAGONFLYBSD || TARGET_SOLARIS
case FLgot:
case FLgotoff:
#endif
pbuf->flush();
s = uev->sp.Vsym; /* symbol pointer */
#if TARGET_WINDOS
if (I64 && (flags & CFpc32))
{
/* This is for those funky fixups where the location to be fixed up
* is a 'val' amount back from the current RIP, biased by adding 4.
*/
assert(val >= -5 && val <= 0);
flags |= (-val & 7) << 24; // set CFREL value
assert(CFREL == (7 << 24));
objmod->reftoident(pbuf->seg,pbuf->offset,s,uev->sp.Voffset,flags);
}
else
#endif
objmod->reftoident(pbuf->seg,pbuf->offset,s,uev->sp.Voffset + val,flags);
break;
#if TARGET_OSX
case FLgot:
funcsym_p->Slocalgotoffset = pbuf->getOffset();
ad = 0;
goto L1;
#endif
case FLfunc: /* function call */
s = uev->sp.Vsym; /* symbol pointer */
#if TARGET_SEGMENTED
if (tyfarfunc(s->ty()))
{ /* Large code references are always absolute */
pbuf->flush();
pbuf->offset += objmod->reftoident(pbuf->seg,pbuf->offset,s,0,flags) - 4;
}
else if (s->Sseg == pbuf->seg &&
(s->Sclass == SCstatic || s->Sclass == SCglobal) &&
s->Sxtrnnum == 0 && flags & CFselfrel)
{ /* if we know it's relative address */
ad = s->Soffset - pbuf->getOffset() - 4;
goto L1;
}
else
#endif
{
assert(TARGET_SEGMENTED || !tyfarfunc(s->ty()));
pbuf->flush();
objmod->reftoident(pbuf->seg,pbuf->offset,s,val,flags);
}
break;
case FLblock: /* displacement to another block */
ad = uev->Vblock->Boffset - pbuf->getOffset() - 4;
//printf("FLblock: funcoffset = %x, pbuf->getOffset = %x, Boffset = %x, ad = %x\n", funcoffset, pbuf->getOffset(), uev->Vblock->Boffset, ad);
goto L1;
case FLblockoff:
pbuf->flush();
assert(uev->Vblock);
//printf("FLblockoff: offset = %x, Boffset = %x, funcoffset = %x\n", pbuf->offset, uev->Vblock->Boffset, funcoffset);
objmod->reftocodeseg(pbuf->seg,pbuf->offset,uev->Vblock->Boffset);
break;
default:
WRFL(fl);
assert(0);
}
pbuf->offset += 4;
}
static void do16bit(MiniCodeBuf *pbuf, enum FL fl,union evc *uev,int flags)
{ char *p;
symbol *s;
targ_size_t ad;
switch (fl)
{
case FLconst:
pbuf->genp(2,(char *) uev);
return;
case FLdatseg:
pbuf->flush();
objmod->reftodatseg(pbuf->seg,pbuf->offset,uev->_EP.Vpointer,uev->_EP.Vseg,flags);
break;
case FLswitch:
pbuf->flush();
ad = uev->Vswitch->Btableoffset;
if (config.flags & CFGromable)
objmod->reftocodeseg(pbuf->seg,pbuf->offset,ad);
else
objmod->reftodatseg(pbuf->seg,pbuf->offset,ad,objmod->jmpTableSegment(funcsym_p),CFoff);
break;
#if TARGET_SEGMENTED
case FLcsdata:
case FLfardata:
#endif
case FLextern: /* external data symbol */
case FLtlsdata:
assert(SIXTEENBIT || TARGET_SEGMENTED);
pbuf->flush();
s = uev->sp.Vsym; /* symbol pointer */
objmod->reftoident(pbuf->seg,pbuf->offset,s,uev->sp.Voffset,flags);
break;
case FLfunc: /* function call */
assert(SIXTEENBIT || TARGET_SEGMENTED);
s = uev->sp.Vsym; /* symbol pointer */
if (tyfarfunc(s->ty()))
{ /* Large code references are always absolute */
pbuf->flush();
pbuf->offset += objmod->reftoident(pbuf->seg,pbuf->offset,s,0,flags) - 2;
}
else if (s->Sseg == pbuf->seg &&
(s->Sclass == SCstatic || s->Sclass == SCglobal) &&
s->Sxtrnnum == 0 && flags & CFselfrel)
{ /* if we know it's relative address */
ad = s->Soffset - pbuf->getOffset() - 2;
goto L1;
}
else
{ pbuf->flush();
objmod->reftoident(pbuf->seg,pbuf->offset,s,0,flags);
}
break;
case FLblock: /* displacement to another block */
ad = uev->Vblock->Boffset - pbuf->getOffset() - 2;
#ifdef DEBUG
{
targ_ptrdiff_t delta = uev->Vblock->Boffset - pbuf->getOffset() - 2;
assert((signed short)delta == delta);
}
#endif
L1:
pbuf->genp(2,&ad); // displacement
return;
case FLblockoff:
pbuf->flush();
objmod->reftocodeseg(pbuf->seg,pbuf->offset,uev->Vblock->Boffset);
break;
default:
WRFL(fl);
assert(0);
}
pbuf->offset += 2;
}
static void do8bit(MiniCodeBuf *pbuf, enum FL fl,union evc *uev)
{ char c;
targ_ptrdiff_t delta;
switch (fl)
{
case FLconst:
c = uev->Vuns;
break;
case FLblock:
delta = uev->Vblock->Boffset - pbuf->getOffset() - 1;
if ((signed char)delta != delta)
{
#if MARS
if (uev->Vblock->Bsrcpos.Slinnum)
fprintf(stderr, "%s(%d): ", uev->Vblock->Bsrcpos.Sfilename, uev->Vblock->Bsrcpos.Slinnum);
#endif
fprintf(stderr, "block displacement of %lld exceeds the maximum offset of -128 to 127.\n", (long long)delta);
err_exit();
}
c = delta;
#ifdef DEBUG
assert(uev->Vblock->Boffset > pbuf->getOffset() || c != 0x7F);
#endif
break;
default:
#ifdef DEBUG
fprintf(stderr,"fl = %d\n",fl);
#endif
assert(0);
}
pbuf->gen(c);
}
/**********************************
*/
#if HYDRATE
void code_hydrate(code **pc)
{
code *c;
unsigned char ins,rm;
enum FL fl;
assert(pc);
while (*pc)
{
c = (code *) ph_hydrate(pc);
if (c->Iflags & CFvex && c->Ivex.pfx == 0xC4)
ins = vex_inssize(c);
else if ((c->Iop & 0xFFFD00) == 0x0F3800)
ins = inssize2[(c->Iop >> 8) & 0xFF];
else if ((c->Iop & 0xFF00) == 0x0F00)
ins = inssize2[c->Iop & 0xFF];
else
ins = inssize[c->Iop & 0xFF];
switch (c->Iop)
{
default:
break;
case ESCAPE | ESClinnum:
srcpos_hydrate(&c->IEV1.Vsrcpos);
goto done;
case ESCAPE | ESCctor:
case ESCAPE | ESCdtor:
el_hydrate(&c->IEV1.Vtor);
goto done;
case ASM:
ph_hydrate(&c->IEV1.as.bytes);
goto done;
}
if (!(ins & M) ||
((rm = c->Irm) & 0xC0) == 0xC0)
goto do2; /* if no first operand */
if (is32bitaddr(I32,c->Iflags))
{
if (
((rm & 0xC0) == 0 && !((rm & 7) == 4 && (c->Isib & 7) == 5 || (rm & 7) == 5))
)
goto do2; /* if no first operand */
}
else
{
if (
((rm & 0xC0) == 0 && !((rm & 7) == 6))
)
goto do2; /* if no first operand */
}
fl = (enum FL) c->IFL1;
switch (fl)
{
case FLudata:
case FLdata:
case FLreg:
case FLauto:
case FLfast:
case FLbprel:
case FLpara:
#if TARGET_SEGMENTED
case FLcsdata:
case FLfardata:
#endif
case FLtlsdata:
case FLfunc:
case FLpseudo:
case FLextern:
assert(flinsymtab[fl]);
symbol_hydrate(&c->IEVsym1);
symbol_debug(c->IEVsym1);
break;
case FLdatseg:
case FLfltreg:
case FLallocatmp:
case FLcs:
case FLndp:
case FLoffset:
case FLlocalsize:
case FLconst:
case FLframehandler:
assert(!flinsymtab[fl]);
break;
case FLcode:
(void) ph_hydrate(&c->IEV1.Vcode);
break;
case FLblock:
case FLblockoff:
(void) ph_hydrate(&c->IEV1.Vblock);
break;
#if SCPP
case FLctor:
case FLdtor:
el_hydrate(&c->IEV1.Vtor);
break;
#endif
case FLasm:
(void) ph_hydrate(&c->IEV1.as.bytes);
break;
default:
WRFL(fl);
assert(0);
break;
}
do2:
/* Ignore TEST (F6 and F7) opcodes */
if (!(ins & T))
goto done; /* if no second operand */
fl = (enum FL) c->IFL2;
switch (fl)
{
case FLudata:
case FLdata:
case FLreg:
case FLauto:
case FLfast:
case FLbprel:
case FLpara:
#if TARGET_SEGMENTED
case FLcsdata:
case FLfardata:
#endif
case FLtlsdata:
case FLfunc:
case FLpseudo:
case FLextern:
assert(flinsymtab[fl]);
symbol_hydrate(&c->IEVsym2);
symbol_debug(c->IEVsym2);
break;
case FLdatseg:
case FLfltreg:
case FLallocatmp:
case FLcs:
case FLndp:
case FLoffset:
case FLlocalsize:
case FLconst:
case FLframehandler:
assert(!flinsymtab[fl]);
break;
case FLcode:
(void) ph_hydrate(&c->IEV2.Vcode);
break;
case FLblock:
case FLblockoff:
(void) ph_hydrate(&c->IEV2.Vblock);
break;
default:
WRFL(fl);
assert(0);
break;
}
done:
;
pc = &code_next(c);
}
}
#endif
/**********************************
*/
#if DEHYDRATE
void code_dehydrate(code **pc)
{
code *c;
unsigned char ins,rm;
enum FL fl;
while ((c = *pc) != NULL)
{
ph_dehydrate(pc);
if (c->Iflags & CFvex && c->Ivex.pfx == 0xC4)
ins = vex_inssize(c);
else if ((c->Iop & 0xFFFD00) == 0x0F3800)
ins = inssize2[(c->Iop >> 8) & 0xFF];
else if ((c->Iop & 0xFF00) == 0x0F00)
ins = inssize2[c->Iop & 0xFF];
else
ins = inssize[c->Iop & 0xFF];
switch (c->Iop)
{
default:
break;
case ESCAPE | ESClinnum:
srcpos_dehydrate(&c->IEV1.Vsrcpos);
goto done;
case ESCAPE | ESCctor:
case ESCAPE | ESCdtor:
el_dehydrate(&c->IEV1.Vtor);
goto done;
case ASM:
ph_dehydrate(&c->IEV1.as.bytes);
goto done;
}
if (!(ins & M) ||
((rm = c->Irm) & 0xC0) == 0xC0)
goto do2; /* if no first operand */
if (is32bitaddr(I32,c->Iflags))
{
if (
((rm & 0xC0) == 0 && !((rm & 7) == 4 && (c->Isib & 7) == 5 || (rm & 7) == 5))
)
goto do2; /* if no first operand */
}
else
{
if (
((rm & 0xC0) == 0 && !((rm & 7) == 6))
)
goto do2; /* if no first operand */
}
fl = (enum FL) c->IFL1;
switch (fl)
{
case FLudata:
case FLdata:
case FLreg:
case FLauto:
case FLfast:
case FLbprel:
case FLpara:
#if TARGET_SEGMENTED
case FLcsdata:
case FLfardata:
#endif
case FLtlsdata:
case FLfunc:
case FLpseudo:
case FLextern:
assert(flinsymtab[fl]);
symbol_dehydrate(&c->IEVsym1);
break;
case FLdatseg:
case FLfltreg:
case FLallocatmp:
case FLcs:
case FLndp:
case FLoffset:
case FLlocalsize:
case FLconst:
case FLframehandler:
assert(!flinsymtab[fl]);
break;
case FLcode:
ph_dehydrate(&c->IEV1.Vcode);
break;
case FLblock:
case FLblockoff:
ph_dehydrate(&c->IEV1.Vblock);
break;
#if SCPP
case FLctor:
case FLdtor:
el_dehydrate(&c->IEV1.Vtor);
break;
#endif
case FLasm:
ph_dehydrate(&c->IEV1.as.bytes);
break;
default:
WRFL(fl);
assert(0);
break;
}
do2:
/* Ignore TEST (F6 and F7) opcodes */
if (!(ins & T))
goto done; /* if no second operand */
fl = (enum FL) c->IFL2;
switch (fl)
{
case FLudata:
case FLdata:
case FLreg:
case FLauto:
case FLfast:
case FLbprel:
case FLpara:
#if TARGET_SEGMENTED
case FLcsdata:
case FLfardata:
#endif
case FLtlsdata:
case FLfunc:
case FLpseudo:
case FLextern:
assert(flinsymtab[fl]);
symbol_dehydrate(&c->IEVsym2);
break;
case FLdatseg:
case FLfltreg:
case FLallocatmp:
case FLcs:
case FLndp:
case FLoffset:
case FLlocalsize:
case FLconst:
case FLframehandler:
assert(!flinsymtab[fl]);
break;
case FLcode:
ph_dehydrate(&c->IEV2.Vcode);
break;
case FLblock:
case FLblockoff:
ph_dehydrate(&c->IEV2.Vblock);
break;
default:
WRFL(fl);
assert(0);
break;
}
done:
;
pc = &code_next(c);
}
}
#endif
/***************************
* Debug code to dump code structure.
*/
void WRcodlst(code *c)
{ for (; c; c = code_next(c))
c->print();
}
void code::print()
{
unsigned char ins;
unsigned char rexb;
code *c = this;
if (c == CNIL)
{ printf("code 0\n");
return;
}
unsigned op = c->Iop;
if (c->Iflags & CFvex && c->Ivex.pfx == 0xC4)
ins = vex_inssize(c);
else if ((c->Iop & 0xFFFD00) == 0x0F3800)
ins = inssize2[(op >> 8) & 0xFF];
else if ((c->Iop & 0xFF00) == 0x0F00)
ins = inssize2[op & 0xFF];
else
ins = inssize[op & 0xFF];
printf("code %p: nxt=%p ",c,code_next(c));
if (c->Iflags & CFvex)
{
if (c->Iflags & CFvex3)
{ printf("vex=0xC4");
printf(" 0x%02X", VEX3_B1(c->Ivex));
printf(" 0x%02X", VEX3_B2(c->Ivex));
rexb =
( c->Ivex.w ? REX_W : 0) |
(!c->Ivex.r ? REX_R : 0) |
(!c->Ivex.x ? REX_X : 0) |
(!c->Ivex.b ? REX_B : 0);
}
else
{ printf("vex=0xC5");
printf(" 0x%02X", VEX2_B1(c->Ivex));
rexb = !c->Ivex.r ? REX_R : 0;
}
printf(" ");
}
else
rexb = c->Irex;
if (rexb)
{ printf("rex=0x%02X ", c->Irex);
if (rexb & REX_W)
printf("W");
if (rexb & REX_R)
printf("R");
if (rexb & REX_X)
printf("X");
if (rexb & REX_B)
printf("B");
printf(" ");
}
printf("op=0x%02X",op);
if ((op & 0xFF) == ESCAPE)
{ if ((op & 0xFF00) == ESClinnum)
{ printf(" linnum = %d\n",c->IEV1.Vsrcpos.Slinnum);
return;
}
printf(" ESCAPE %d",c->Iop >> 8);
}
if (c->Iflags)
printf(" flg=%x",c->Iflags);
if (ins & M)
{ unsigned rm = c->Irm;
printf(" rm=0x%02X=%d,%d,%d",rm,(rm>>6)&3,(rm>>3)&7,rm&7);
if (!I16 && issib(rm))
{ unsigned char sib = c->Isib;
printf(" sib=%02x=%d,%d,%d",sib,(sib>>6)&3,(sib>>3)&7,sib&7);
}
if ((rm & 0xC7) == BPRM || (rm & 0xC0) == 0x80 || (rm & 0xC0) == 0x40)
{
switch (c->IFL1)
{
case FLconst:
case FLoffset:
printf(" int = %4d",c->IEV1.Vuns);
break;
case FLblock:
printf(" block = %p",c->IEV1.Vblock);
break;
case FLswitch:
case FLblockoff:
case FLlocalsize:
case FLframehandler:
case 0:
break;
case FLdatseg:
printf(" %d.%llx",c->IEVseg1,(unsigned long long)c->IEVpointer1);
break;
case FLauto:
case FLfast:
case FLreg:
case FLdata:
case FLudata:
case FLpara:
case FLbprel:
case FLtlsdata:
printf(" sym='%s'",c->IEVsym1->Sident);
break;
case FLextern:
printf(" FLextern offset = %4d",(int)c->IEVoffset1);
break;
default:
WRFL((enum FL)c->IFL1);
break;
}
}
}
if (ins & T)
{ printf(" "); WRFL((enum FL)c->IFL2);
switch (c->IFL2)
{
case FLconst:
printf(" int = %4d",c->IEV2.Vuns);
break;
case FLblock:
printf(" block = %p",c->IEV2.Vblock);
break;
case FLswitch:
case FLblockoff:
case 0:
case FLlocalsize:
case FLframehandler:
break;
case FLdatseg:
printf(" %d.%llx",c->IEVseg2,(unsigned long long)c->IEVpointer2);
break;
case FLauto:
case FLfast:
case FLreg:
case FLpara:
case FLbprel:
case FLfunc:
case FLdata:
case FLudata:
case FLtlsdata:
printf(" sym='%s'",c->IEVsym2->Sident);
break;
case FLcode:
printf(" code = %p",c->IEV2.Vcode);
break;
default:
WRFL((enum FL)c->IFL2);
break;
}
}
printf("\n");
}
#endif // !SPP
|
the_stack_data/605926.c | #ifdef sgi
#include <sys/fpu.h>
/*
THE FOLLOWING FUNCTION
sets the special "flush zero" but (FS, bit 24) in the
Control Status Register of the FPU of R4k and beyond
so that the result of any underflowing operation will
be clamped to zero, and no exception of any kind will
be generated on the CPU. This has no effect on
an R3000.
*/
void flush_all_underflows_to_zero()
{
union fpc_csr f;
f.fc_word = get_fpc_csr();
f.fc_struct.flush = 1;
set_fpc_csr(f.fc_word);
}
#endif
#ifdef LINUX
#include <stdio.h>
#include <stdlib.h>
#include <signal.h>
void sigfpe_handler(int sig)
{
fprintf(stderr,
"\nRTcmix FATAL ERROR: floating point exception halted process.\n");
exit(1);
}
#endif
|
the_stack_data/67324745.c | #include <err.h>
#include <errno.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
#include <stdlib.h>
#include <stdint.h>
#include <stdio.h>
int comparator(const void* p1, const void* p2) {
uint16_t num1 = *(const uint16_t*)p1;
uint16_t num2 = *(const uint16_t*)p2;
return num1 - num2;
}
int main(int argc, char* argv[]) {
if (argc != 3) {
errx(1, "Wrong parameters! Usage: %s [input.bin] [output.bin]", argv[0]);
}
struct stat st;
if (stat(argv[1], &st) < 0) {
err(2, "Error stat file %s", argv[1]);
}
if (st.st_size / sizeof(uint16_t) >= UINT16_MAX) {
errx(3, "File is too big");
}
else if (st.st_size % sizeof(uint16_t) != 0) {
errx(3, "File is not aligned");
}
int fd1 = open(argv[1], O_RDONLY);
if (fd1 < 0) {
err(4, "Error opening file %s", argv[1]);
}
int fd2 = open(argv[2], O_CREAT | O_TRUNC | O_WRONLY, st.st_mode);
if (fd2 < 0) {
int old_errno = errno;
close(fd1);
errno = old_errno;
err(4, "Error opening file %s", argv[2]);
}
uint16_t* buffer = malloc(st.st_size);
if (!buffer) {
int old_errno = errno;
close(fd1);
close(fd2);
errno = old_errno;
err(5, "Error allocating memory");
}
if (read(fd1, buffer, st.st_size) < 0) {
int old_errno = errno;
close(fd1);
close(fd2);
free(buffer);
errno = old_errno;
err(6, "Error read from file %s", argv[1]);
}
close(fd1);
qsort(buffer, st.st_size / sizeof(uint16_t), sizeof(uint16_t), comparator);
if (write(fd2, buffer, st.st_size) < 0) {
int old_errno = errno;
close(fd2);
free(buffer);
errno = old_errno;
err(7, "Error write to file %s", argv[2]);
}
close(fd1);
close(fd2);
free(buffer);
exit(0);
}
|
the_stack_data/145329.c |
#include <stdio.h>
int main()
{
int K;
scanf("%d",&K);
if(K ==1 )
printf("Top 1\n");
else if(K<=3)
printf("Top 3\n");
else if(K<=5)
printf("Top 5\n");
else if(K<=10)
printf("Top 10\n");
else if(K<=25)
printf("Top 25\n");
else if(K <= 50)
printf("Top 50\n");
else if(K <= 100 )
printf("Top 100\n");
return 0;
}
|
the_stack_data/248581435.c | /* This program shows how is the process identification (pid) is executed.
* Fork returns the pid of the child process in the parent, and returns 0 in the child.
* If creation of a process was unsuccessful then it returns -1.
*
* Email : [email protected]
* Date : 31.08.2021
* Author : Abinash
*/
#include<stdio.h> /* required for printf */
#include<unistd.h> /* required for fork() */
#include<sys/types.h> /* required for fork() */
/* main program */
int main()
{
pid_t pid; /* The pid_t data type is a signed integer type which is capable of representing a process ID */
pid = fork(); /* fork is assigned to pid */
if(pid < 0)
printf("Failed to fork...\n");
else if(pid == 0)
printf("Child process...\n");
else if(pid > 0)
printf("Parent process...\n");
sleep(2);
return 0; /* program executed successfully */
}
|
the_stack_data/153268142.c | #include<stdio.h>
#include<unistd.h>
#define MAX 512
int main(int argc, char* argv[]) {
int fd[2];
char buf[MAX];
int nb, i;
if (pipe(fd) == -1){
perror("Creating pipe");
exit(1);
}
switch(fork()){
case -1:
perror("Creating a process ");
exit(1);
case 0:
dup2(fd[1], 1);
execvp("ls", argv);
perror("program ls");
exit(1);
default:
close(fd[1]);
while ((nb=read(fd[0], buf, MAX)) > 0){
for(i=0; i<nb; i++)
buf[i] = toupper(buf[i]);
printf("Test %s \n",buf);
if (write(1, buf, nb) == -1){
perror ("Writting to stdout");
exit(1);
}
}
if (nb == -1){
perror("Reading from pipe");
exit(1);
}
}
}
|
the_stack_data/1218485.c | #include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <stdlib.h>
#include <errno.h>
#include <stdint.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
static int pm_qos_fd = -1;
void set_latency_target(int32_t target_us)
{
ssize_t ret;
if (pm_qos_fd >= 0)
return;
pm_qos_fd = open("/dev/cpu_dma_latency", O_RDWR);
if (pm_qos_fd < 0) {
fprintf(stderr, "Failed to open PM QOS file: %s\n",
strerror(errno));
exit(errno);
}
ret = write(pm_qos_fd, &target_us, sizeof(target_us));
if (ret < 0) {
fprintf(stderr, "Fail to set QOS target\n");
exit(errno);
}
}
int main(int argc, char *argv[])
{
if (argc < 2) {
printf("usage: [maximum c-state latency in microseconds]\n");
exit(1);
}
set_latency_target(atoi(argv[1]));
while (1)
sleep(10);
return 0;
}
|
the_stack_data/108235.c | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
int main(int arg,char *argv[],char *env[])
{
printf("\n\n**BY COMMAND LINE ARGUMENT env***\n\n");
int i;
for(i=0;env[i]!=NULL;i++)
printf("\n %s",env[i]);
printf("\n\n**BY COMMAND LINE ARGUMENT environ***\n\n");
extern char **environ;
for(i=0;environ[i]!=NULL;i++)
printf("\n %s",environ[i]);
// printf("\n\n**BY COMMAND LINE ARGUMENT getenv***\n\n");
// char en[]="PATH";
// printf("%s=%s\n",en,getenv(en));
// char envA[10][10]={"HOME","USER","SHELL","LOGNAME"};
// for(i=0;i<4;i++)
// printf("%s=%s\n",envA[i],getenv(envA[i]));
return 0;
}
|
the_stack_data/88880.c | /**************************************************************************//**
* @file os_tick_ostm.c
* @brief CMSIS OS Tick implementation for OS Timer
* @version V1.0.1
* @date 19. September 2017
******************************************************************************/
/*
* Copyright (c) 2017-2017 ARM Limited. All rights reserved.
*
* SPDX-License-Identifier: Apache-2.0
*
* 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
*
* www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an AS IS BASIS, WITHOUT
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifdef MBED_CONF_RTOS_PRESENT
#include "os_tick.h"
#include "irq_ctrl.h"
#include <MBRZA1H.h>
#include <cmsis.h>
// Define OS TImer interrupt priority
#ifndef OSTM_IRQ_PRIORITY
#define OSTM_IRQ_PRIORITY 0xFFU
#endif
// Define OS Timer channel and interrupt number
#define OSTM (OSTM0)
#define OSTM_IRQn ((IRQn_ID_t)OSTMI0TINT_IRQn)
static uint32_t OSTM_Clock; // Timer tick frequency
static uint8_t OSTM_PendIRQ; // Timer interrupt pending flag
// Setup OS Tick.
int32_t OS_Tick_Setup (uint32_t freq, IRQHandler_t handler)
{
uint32_t clock;
uint32_t prio;
uint32_t bits;
if (freq == 0U) {
return (-1);
}
OSTM_PendIRQ = 0U;
// Get CPG.FRQCR[IFC] bits
clock = (CPG.FRQCR >> 8) & 0x03;
// Determine Divider 2 output clock by using SystemCoreClock
if (clock == 0x03U) {
clock = (SystemCoreClock * 3U);
}
else if (clock == 0x01U) {
clock = (SystemCoreClock * 3U)/2U;
}
else {
clock = SystemCoreClock;
}
// Determine tick frequency
clock = clock / freq;
// Save frequency for later
OSTM_Clock = clock;
// Enable OSTM clock
CPG.STBCR5 &= ~(CPG_STBCR5_BIT_MSTP51);
// Stop the OSTM counter
OSTM.OSTMnTT = 0x01U;
// Set interval timer mode and disable interrupts when counting starts
OSTM.OSTMnCTL = 0x00U;
// Set compare value
OSTM.OSTMnCMP = clock - 1U;
// Disable corresponding IRQ
IRQ_Disable (OSTM_IRQn);
IRQ_ClearPending(OSTM_IRQn);
// Determine number of implemented priority bits
IRQ_SetPriority (OSTM_IRQn, 0xFFU);
prio = IRQ_GetPriority (OSTM_IRQn);
// At least bits [7:4] must be implemented
if ((prio & 0xF0U) == 0U) {
return (-1);
}
for (bits = 0; bits < 4; bits++) {
if ((prio & 0x01) != 0) {
break;
}
prio >>= 1;
}
// Adjust configured priority to the number of implemented priority bits
prio = (OSTM_IRQ_PRIORITY << bits) & 0xFFUL;
// Set OSTM interrupt priority
IRQ_SetPriority(OSTM_IRQn, prio-1U);
// Set edge-triggered, non-secure, single CPU targeted IRQ
IRQ_SetMode (OSTM_IRQn, IRQ_MODE_TRIG_EDGE);
// Register tick interrupt handler function
IRQ_SetHandler(OSTM_IRQn, (IRQHandler_t)handler);
// Enable corresponding IRQ
IRQ_Enable (OSTM_IRQn);
return (0);
}
/// Enable OS Tick.
int32_t OS_Tick_Enable (void)
{
if (OSTM_PendIRQ != 0U) {
OSTM_PendIRQ = 0U;
IRQ_SetPending (OSTM_IRQn);
}
// Start the OSTM counter
OSTM.OSTMnTS = 0x01U;
return (0);
}
/// Disable OS Tick.
int32_t OS_Tick_Disable (void)
{
// Stop the OSTM counter
OSTM.OSTMnTT = 0x01U;
if (IRQ_GetPending(OSTM_IRQn) != 0) {
IRQ_ClearPending (OSTM_IRQn);
OSTM_PendIRQ = 1U;
}
return (0);
}
// Acknowledge OS Tick IRQ.
int32_t OS_Tick_AcknowledgeIRQ (void)
{
return (IRQ_ClearPending (OSTM_IRQn));
}
// Get OS Tick IRQ number.
int32_t OS_Tick_GetIRQn (void)
{
return (OSTM_IRQn);
}
// Get OS Tick clock.
uint32_t OS_Tick_GetClock (void)
{
return (OSTM_Clock);
}
// Get OS Tick interval.
uint32_t OS_Tick_GetInterval (void)
{
return (OSTM.OSTMnCMP + 1U);
}
// Get OS Tick count value.
uint32_t OS_Tick_GetCount (void)
{
uint32_t cmp = OSTM.OSTMnCMP;
return (cmp - OSTM.OSTMnCNT);
}
// Get OS Tick overflow status.
uint32_t OS_Tick_GetOverflow (void)
{
return (IRQ_GetPending(OSTM_IRQn));
}
#endif
|
the_stack_data/173577699.c | /*
* Copyright 1997 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
/* Copyright (c) 1983, 1984, 1985, 1986, 1987, 1988, 1989 AT&T */
/* All Rights Reserved */
/*
* Copyright (c) 1980 Regents of the University of California.
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/*LINTLIBRARY*/
#if 0
static char
sccsid[] = "@(#)termcap.c 1.11 88/02/08 SMI"; /* from UCB 5.1 6/5/85 */
#endif
#define BUFSIZ 1024
#define MAXHOP 32 /* max number of tc= indirections */
#define E_TERMCAP "/etc/termcap"
#include <sys/types.h>
#include <unistd.h>
#include <stdlib.h>
#include <stddef.h>
#include <string.h>
#include <strings.h>
#include <ctype.h>
/*
* termcap - routines for dealing with the terminal capability data base
*
* BUG: Should use a "last" pointer in tbuf, so that searching
* for capabilities alphabetically would not be a n**2/2
* process when large numbers of capabilities are given.
* Note: If we add a last pointer now we will screw up the
* tc capability. We really should compile termcap.
*
* Essentially all the work here is scanning and decoding escapes
* in string capabilities. We don't use stdio because the editor
* doesn't, and because living w/o it is not hard.
*/
static char *tbuf;
static int hopcount; /* detect infinite loops in termcap, init 0 */
/* forward declarations */
static char *tdecode(char *, char **);
static void tngetsize(char *);
static char *tskip(char *bp);
static char *appendsmalldec(char *, int);
int tnamatch(char *);
int tnchktc(void);
/*
* Get an entry for terminal name in buffer bp,
* from the termcap file. Parse is very rudimentary;
* we just notice escaped newlines.
*/
int
tgetent(char *bp, char *name)
{
char *cp;
int c;
int i = 0;
ssize_t cnt = 0;
char ibuf[BUFSIZ];
int tf;
tbuf = bp;
tf = -1;
#ifndef V6
cp = getenv("TERMCAP");
/*
* TERMCAP can have one of two things in it. It can be the
* name of a file to use instead of /etc/termcap. In this
* case it better start with a "/". Or it can be an entry to
* use so we don't have to read the file. In this case it
* has to already have the newlines crunched out.
*/
if (cp && *cp) {
if (*cp == '/') {
tf = open(cp, 0);
} else {
tbuf = cp;
c = tnamatch(name);
tbuf = bp;
if (c) {
(void) strcpy(bp, cp);
return (tnchktc());
}
}
}
if (tf < 0)
tf = open(E_TERMCAP, 0);
#else
tf = open(E_TERMCAP, 0);
#endif
if (tf < 0)
return (-1);
for (;;) {
cp = bp;
for (;;) {
if (i == cnt) {
cnt = read(tf, ibuf, BUFSIZ);
if (cnt <= 0) {
(void) close(tf);
return (0);
}
i = 0;
}
c = ibuf[i++];
if (c == '\n') {
if (cp > bp && cp[-1] == '\\') {
cp--;
continue;
}
break;
}
if (cp >= bp+BUFSIZ) {
(void) write(2, "Termcap entry too long\n", 23);
break;
} else
*cp++ = (char) c;
}
*cp = 0;
/*
* The real work for the match.
*/
if (tnamatch(name)) {
(void) close(tf);
return (tnchktc());
}
}
}
/*
* tnchktc: check the last entry, see if it's tc=xxx. If so,
* recursively find xxx and append that entry (minus the names)
* to take the place of the tc=xxx entry. This allows termcap
* entries to say "like an HP2621 but doesn't turn on the labels".
* Note that this works because of the left to right scan.
*/
int
tnchktc(void)
{
char *p, *q;
char tcname[16]; /* name of similar terminal */
char tcbuf[BUFSIZ];
char *holdtbuf = tbuf;
ptrdiff_t l;
p = tbuf + strlen(tbuf) - 2; /* before the last colon */
while (*--p != ':')
if (p < tbuf) {
(void) write(2, "Bad termcap entry\n", 18);
return (0);
}
p++;
/* p now points to beginning of last field */
if (p[0] != 't' || p[1] != 'c') {
tngetsize(tbuf);
return (1);
}
(void) strcpy(tcname, p+3);
q = tcname;
while (*q && *q != ':')
q++;
*q = 0;
if (++hopcount > MAXHOP) {
(void) write(2, "Infinite tc= loop\n", 18);
return (0);
}
if (tgetent(tcbuf, tcname) != 1) {
hopcount = 0; /* unwind recursion */
return (0);
}
for (q = tcbuf; *q != ':'; q++)
;
l = p - holdtbuf + strlen(q);
if (l > BUFSIZ) {
(void) write(2, "Termcap entry too long\n", 23);
q[BUFSIZ - (p-tbuf)] = 0;
}
(void) strcpy(p, q+1);
tbuf = holdtbuf;
hopcount = 0; /* unwind recursion */
tngetsize(tbuf);
return (1);
}
/*
* Tnamatch deals with name matching. The first field of the termcap
* entry is a sequence of names separated by |'s, so we compare
* against each such name. The normal : terminator after the last
* name (before the first field) stops us.
*/
int
tnamatch(char *np)
{
char *Np, *Bp;
Bp = tbuf;
if (*Bp == '#')
return (0);
for (;;) {
for (Np = np; *Np && *Bp == *Np; Bp++, Np++)
continue;
if (*Np == 0 && (*Bp == '|' || *Bp == ':' || *Bp == 0))
return (1);
while (*Bp && *Bp != ':' && *Bp != '|')
Bp++;
if (*Bp == 0 || *Bp == ':')
return (0);
Bp++;
}
}
/*
* Skip to the next field. Notice that this is very dumb, not
* knowing about \: escapes or any such. If necessary, :'s can be put
* into the termcap file in octal.
*/
static char *
tskip(char *bp)
{
while (*bp && *bp != ':')
bp++;
if (*bp == ':') {
do {
bp++;
while (isspace(*bp))
bp++;
} while (*bp == ':');
}
return (bp);
}
/*
* Return the (numeric) option id.
* Numeric options look like
* li#80
* i.e. the option string is separated from the numeric value by
* a # character. If the option is not found we return -1.
* Note that we handle octal numbers beginning with 0.
*/
int
tgetnum(char *id)
{
int i, base;
char *bp = tbuf;
for (;;) {
bp = tskip(bp);
if (*bp == 0)
return (-1);
if (*bp++ != id[0] || *bp == 0 || *bp++ != id[1])
continue;
if (*bp == '@')
return (-1);
if (*bp != '#')
continue;
bp++;
base = 10;
if (*bp == '0')
base = 8;
i = 0;
while (isdigit(*bp))
i *= base, i += *bp++ - '0';
return (i);
}
}
/*
* Handle a flag option.
* Flag options are given "naked", i.e. followed by a : or the end
* of the buffer. Return 1 if we find the option, or 0 if it is
* not given.
*/
int
tgetflag(char *id)
{
char *bp = tbuf;
for (;;) {
bp = tskip(bp);
if (!*bp)
return (0);
if (*bp++ == id[0] && *bp != 0 && *bp++ == id[1]) {
if (!*bp || *bp == ':')
return (1);
else if (*bp == '@')
return (0);
}
}
}
/*
* Get a string valued option.
* These are given as
* cl=^Z
* Much decoding is done on the strings, and the strings are
* placed in area, which is a ref parameter which is updated.
* No checking on area overflow.
*/
char *
tgetstr(char *id, char **area)
{
char *bp = tbuf;
for (;;) {
bp = tskip(bp);
if (!*bp)
return (0);
if (*bp++ != id[0] || *bp == 0 || *bp++ != id[1])
continue;
if (*bp == '@')
return (0);
if (*bp != '=')
continue;
bp++;
return (tdecode(bp, area));
}
}
/*
* Tdecode does the grung work to decode the
* string capability escapes.
*/
static char *
tdecode(char *str, char **area)
{
char *cp;
int c;
char *dp;
int i;
cp = *area;
while (((c = *str++) != 0) && c != ':') {
switch (c) {
case '^':
c = *str++ & 037;
break;
case '\\':
dp = "E\033^^\\\\::n\nr\rt\tb\bf\f";
c = *str++;
nextc:
if (*dp++ == c) {
c = *dp++;
break;
}
dp++;
if (*dp)
goto nextc;
if (isdigit(c)) {
c -= '0', i = 2;
do
c <<= 3, c |= *str++ - '0';
while (--i && isdigit(*str));
}
break;
}
*cp++ = (char) c;
}
*cp++ = 0;
str = *area;
*area = cp;
return (str);
}
#include <sys/ioctl.h>
static void
tngetsize(char *bp)
{
struct winsize ws;
char *np, *cp;
if (ioctl(1, TIOCGWINSZ, (char *)&ws) < 0)
return;
if (ws.ws_row == 0 || ws.ws_col == 0 ||
ws.ws_row > 999 || ws.ws_col > 999)
return;
cp = index(bp, ':'); /* find start of description */
bp = rindex(bp, 0); /* find end of description */
np = bp + 15; /* allow enough room for stuff below */
while (bp >= cp) /* move description right 15 chars */
*np-- = *bp--;
bp++; /* bp now points to where ':' used to be */
*bp++ = ':';
*bp++ = 'l';
*bp++ = 'i';
*bp++ = '#';
bp = appendsmalldec(bp, ws.ws_row);
*bp++ = ':';
*bp++ = 'c';
*bp++ = 'o';
*bp++ = '#';
bp = appendsmalldec(bp, ws.ws_col);
*bp++ = ':';
while (bp <= np) /* space fill to start of orig description */
*bp++ = ' ';
}
static char *
appendsmalldec(char *bp, int val)
{
int i;
if ((i = val / 100) != 0) {
*bp++ = '0' + i;
val %= 100;
if (0 == val / 10)
*bp++ = '0'; /* place holder because next test fails */
}
if ((i = val / 10) != 0)
*bp++ = '0' + i;
*bp++ = '0' + val % 10;
return (bp);
}
|
the_stack_data/25137058.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int dim = 2;
int testaCoda = 0;
int fondoCoda = -1;
int cardCoda = 0;
char** VerificaRaddoppio(char** vecchio)
{
if(cardCoda >= dim)
{
char** nuovo = malloc(2 * dim * sizeof(char*));
int i;
int indLettura = testaCoda;
int indScrittura = 0;
for(i=0; i<cardCoda; i++)
{
nuovo[indScrittura] = vecchio[indLettura];
indScrittura = (indScrittura + 1) % (2*dim);
indLettura = (indLettura + 1) % dim;
}
dim = dim * 2;
testaCoda = 0;
fondoCoda = cardCoda-1;
free(vecchio);
return nuovo;
}
else return vecchio;
}
char** VerificaDimezzamento(char** vecchio)
{
if(cardCoda <= (dim/4))
{
char** nuovo = malloc(dim/2 * sizeof(char*));
int i;
int indLettura = testaCoda;
int indScrittura = 0;
for(i=0; i<cardCoda; i++)
{
nuovo[indScrittura] = vecchio[indLettura];
indScrittura = (indScrittura + 1) % (dim/2);
indLettura = (indLettura + 1) % dim;
}
dim = dim/2;
testaCoda = 0;
fondoCoda = cardCoda-1;
free(vecchio);
return nuovo;
}
else return vecchio;
}
int Confronta(const void* a, const void* b)
{
char** uno = (char**) a;
char** due = (char**) b;
return strcmp(*uno, *due);
}
int main()
{
char** a = malloc(2 * sizeof(char*));
int e;
scanf("%d", &e);
while(e != 0)
{
if(e == 1)
{
//E' arrivato un paziente. Ci dice il nome e si accoda
char* nome = malloc(101 * sizeof(char));
scanf("%s", nome);
a = VerificaRaddoppio(a);
cardCoda++;
fondoCoda = (fondoCoda + 1) % dim;
a[fondoCoda] = nome;
}
if(e == 2 && cardCoda > 0)
{
//Il dottore visita il primo paziente in coda
cardCoda--;
free(a[testaCoda]);
testaCoda = (testaCoda + 1) % dim;
a = VerificaDimezzamento(a);
}
scanf("%d", &e);
}
if(cardCoda > 0)
{
//Sistemo in un array dove il primo è il primo
char** nuovo = malloc(cardCoda * sizeof(char*));
int indLettura = testaCoda;
int indScrittura;
for(indScrittura=0; indScrittura<cardCoda; indScrittura++)
{
nuovo[indScrittura] = a[indLettura];
indLettura = (indLettura + 1) % dim;
}
free(a);
a = nuovo;
//Ordino
qsort(a, cardCoda, sizeof(char*), Confronta);
//Stampo
for(e=0; e<cardCoda; e++)
{
printf("%s\n", a[e]);
free(a[e]);
}
}
printf("$\n");
free(a);
return 0;
}
|
the_stack_data/86075242.c | #define _GNU_SOURCE
#include <fcntl.h>
#include <stdio.h>
#include <unistd.h>
#include <limits.h>
int main(int argc, char *argv[]) {
int in;
if (argc == 1) {
in = STDIN_FILENO;
} else if (argc == 2) {
if ((in = open(argv[1], O_RDONLY)) < 0) {
perror("open");
return -1;
}
} else {
fprintf(stderr, "usage: %s file\n", argv[0]);
return -1;
}
if (tee(in, STDOUT_FILENO, INT_MAX, SPLICE_F_NONBLOCK) < 0) {
perror("tee");
return -1;
}
close(in);
return 0;
}
|
the_stack_data/39206.c | #include <stdio.h>
#include <ctype.h>
#include <stdbool.h>
bool jemale(int c)
{
return (c >= 'a' && c <= 'Z');
}
int navelke(int znak)
{
int velke;
if (jemale(znak))
return znak - 'a' + 'A';
else
return znak;
// return jemale (znak) ? znak - 'a' + 'A' : znak; //TO ISTE CO HORE
}
int main(int argc, char *argv[])
{
(void)argc;
(void)argv
;
int c;
int velke;
while( (c = getchar() ) != EOF)
{
velke = toupper(c);
putchar(velke);
}
return 0;
}
|
the_stack_data/9943.c | /**
* Alternative mkstemps implementation.
*
* Based on https://github.com/ClickHouse/ClickHouse/blob/3203fa4c34ac66990393e846621c89352fd4ac42/base/glibc-compatibility/musl/mkstemps.c
* Original code was wrapped in an #ifndef preprocessor block.
*
* Copyright 2016-2021 Yandex LLC
*
* 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
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef HAVE_MKSTEMPS
#include <errno.h>
#include <fcntl.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <unistd.h>
/* This assumes that a check for the
template size has already been made */
static char * __randname(char * template)
{
int i;
struct timespec ts;
unsigned long r;
clock_gettime(CLOCK_REALTIME, &ts);
r = (ts.tv_nsec * 65537) ^ ((((intptr_t)(&ts)) / 16) + ((intptr_t)template));
for (i = 0; i < 6; i++, r >>= 5)
template[i] = 'A' + (r & 15) + (r & 16) * 2;
return template;
}
int mkstemps(char * template, int len)
{
size_t l = strlen(template);
if (l < 6 || len > l - 6 || memcmp(template + l - len - 6, "XXXXXX", 6))
{
errno = EINVAL;
return -1;
}
int fd, retries = 100;
do
{
__randname(template + l - len - 6);
if ((fd = open(template, O_RDWR | O_CREAT | O_EXCL, 0600)) >= 0)
return fd;
} while (--retries && errno == EEXIST);
memcpy(template + l - len - 6, "XXXXXX", 6);
return -1;
}
#endif /*! HAVE_MKSTEMPS */
|
the_stack_data/117379.c | //
// Created by Wenxin Zheng on 2020/7/20.
//
#include <pthread.h>
#include <stdio.h>
int Global;
void *Thread1(void *x) {
Global++;
return NULL;
}
void *Thread2(void *x) {
Global--;
return NULL;
}
int main() {
pthread_t t[2];
pthread_create(&t[0], NULL, Thread1, NULL);
pthread_create(&t[1], NULL, Thread2, NULL);
pthread_join(t[0], NULL);
pthread_join(t[1], NULL);
} |
the_stack_data/51844.c | #include <sys/stat.h>
int main() {
chmod("/tmp/ducktape/ducktape", S_IRUSR|S_IWUSR|S_IXUSR|S_IRGRP|S_IXGRP|S_IROTH|S_IXOTH);
return 0;
}
|
the_stack_data/7949573.c | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define HI(x) ((x>>4) & 0x0F)
#define LO(x) ((x) & 0x0F)
/* base64 index table */
const static unsigned char b64[64] = {'A', 'B', 'C', 'D',
'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N',
'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X',
'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h',
'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z', '0', '1',
'2', '3', '4', '5', '6', '7', '8', '9', '+', '/'};
/* returns 0xFF on error */
unsigned char b64idx(unsigned char input) {
unsigned char idx;
for(idx=0; idx<64; idx++) {
if(b64[idx] == input) {
return idx;
}
}
return 0xFF;
}
/* returns 0xFF on error */
unsigned char hex2ascii(unsigned char input) {
switch (input) {
case 0 :
return '0';
case 1 :
return '1';
case 2 :
return '2';
case 3 :
return '3';
case 4:
return '4';
case 5 :
return '5';
case 6 :
return '6';
case 7 :
return '7';
case 8 :
return '8';
case 9 :
return '9';
case 10 :
return 'a';
case 11 :
return 'b';
case 12 :
return 'c';
case 13 :
return 'd';
case 14 :
return 'e';
case 15 :
return 'f';
default :
return 255;
}
}
/* returns 0xFF on error */
unsigned char ascii2hex(unsigned char input) {
switch (input) {
case '0' :
return 0x00;
case '1' :
return 0x01;
case '2' :
return 0x02;
case '3' :
return 0x03;
case '4' :
return 0x04;
case '5' :
return 0x05;
case '6' :
return 0x06;
case '7' :
return 0x07;
case '8' :
return 0x08;
case '9' :
return 0x09;
case 'a' :
case 'A' :
return 0x0A;
case 'b' :
case 'B' :
return 0x0B;
case 'c' :
case 'C' :
return 0x0C;
case 'd' :
case 'D' :
return 0x0D;
case 'e' :
case 'E' :
return 0x0E;
case 'f' :
case 'F' :
return 0x0F;
default :
return 255;
}
}
void hextobase64(unsigned char *hexstr) {
int b64_idx = 5;
unsigned char b64_out = 0x00;
unsigned char tmp;
int inputidx = 0;
int inloop;
while(hexstr[inputidx]) {
tmp = ascii2hex(hexstr[inputidx]);
if(tmp == 0xFF) /* error condition */
return;
for(inloop=3; inloop>=0; inloop--) {
if(tmp & (0x01 << inloop)) {
b64_out |= (0x01 << b64_idx);
}
b64_idx--;
if(b64_idx < 0) { /* packed a full output 6-bits */
b64_idx = 5;
(void) fputc(b64[b64_out], stdout);
b64_out = 0x00;
}
}
inputidx++;
}
if(b64_idx != 5) { /* partial state */
(void) fputc(b64[b64_out], stdout);
}
return;
}
void base64tohex(unsigned char *b64str) {
int hex_idx = 7;
unsigned char hex_out = 0x00;
unsigned char tmp;
int inputidx = 0;
int inloop;
while(b64str[inputidx]) {
tmp = b64idx(b64str[inputidx]); /* pop single input char */
if(tmp == 0xFF) /* error condition */
return;
for(inloop=5; inloop>=0; inloop--) {
if(tmp & (0x01 << inloop)) {
hex_out |= (0x01 << hex_idx);
}
hex_idx--;
if(hex_idx < 0) { /* packed full output 8-bits */
hex_idx = 7;
(void) fputc(hex2ascii(HI(hex_out)), stdout);
(void) fputc(hex2ascii(LO(hex_out)), stdout);
hex_out = 0x00;
}
}
inputidx++;
}
return;
}
int main(int argc, char **argv) {
/*unsigned char hexstr[] = "49276d206b696c6c696e6720796f757220627261696e206c696b65206120706f69736f6e6f7573206d757368726f6f6d";
unsigned char b64str[] = "SSdtIGtpbGxpbmcgeW91ciBicmFpbiBsaWtlIGEgcG9pc29ub3VzIG11c2hyb29t";
base64tohex(&b64str[0]);
printf("\n");
hextobase64(&hexstr[0]);
printf("\n"); */
if(argc != 3) {
printf("Usage: %s -b/-x input\n", argv[0]);
printf("Flag -b if input is in Base64. Flag -x in input is Hexadecimal.\n");
printf("Program outputs coded string to stdout.\n");
exit(EXIT_FAILURE);
}
if(!strcmp("-b", argv[1])) {
base64tohex((unsigned char *) &argv[2][0]);
} else if (!strcmp("-x", argv[1])) {
hextobase64((unsigned char *) &argv[2][0]);
} else {
printf("Invalid input flag.\n");
}
printf("\n");
return 0;
}
|
the_stack_data/1206641.c | //*****************************************************************************
// strspn.c : string function
// 2002/02/04 by Gaku : this is rough sketch
//*****************************************************************************
#include <stddef.h>
//=============================================================================
// return the length of D of any character in S
//=============================================================================
size_t GO_strspn (char *d, char *s)
{
char *tmp = d;
char *bgn = s;
while ('\0' != *d) {
while ('\0' != *s) {
if (*d == *s)
break;
s++;
}
if ('\0' == *s)
return d - tmp;
d++;
s = bgn;
}
return d - tmp;
}
|
the_stack_data/23574584.c | #include <stdlib.h>
#include <string.h>
#define MAYBE_REALLOC(p, size, reqsize) \
if (reqsize > size) { \
size *= 2; \
p = realloc(p, size); \
}
char *toGoatLatin(char *S) {
// For starters, start with a length x 3 of S.
// its overall size strictly depends on how many
// words we have.
int size = (strlen(S) + 1) * 3;
char *result = malloc(size);
int counter = 1, length = 0;
while (*S) {
char first = *S++;
if (first == ' ')
continue;
switch (first) {
case 'a':
case 'A':
case 'i':
case 'I':
case 'e':
case 'E':
case 'u':
case 'U':
case 'o':
case 'O': {
result[length++] = first;
// Go till the end.
while (*S && *S != ' ') {
MAYBE_REALLOC(result, size, length + 1);
result[length++] = *S++;
}
break;
}
default: {
// Go till the end.
while (*S && *S != ' ') {
MAYBE_REALLOC(result, size, length + 1);
result[length++] = *S++;
}
result[length++] = first;
break;
}
}
MAYBE_REALLOC(result, size, (length + counter + 3));
result[length++] = 'm';
for (int i = 0; i < counter + 1; i++)
result[length++] = 'a';
// Add required space.
result[length++] = ' ', counter++;
}
// Remove trailing whitespace.
result[--length] = '\0';
return result;
}
|
the_stack_data/40762146.c | /*
Autor: Josué Gómez
Compilador: gcc (Ubuntu 7.5.0-3ubuntu1~18.04) 7.5.0
Compilado: gcc Programa3.c -o Programa3
Fecha: Sat Mar 20 23:30:47 CST 2021
Librerias: stdio (u otras)
Resumen: Programa que lee un número mayor que 1 y determina si es primo o no
Entada: Numero mayor a 1
Salida: Es primo o no es primo
*/
//Librerias
#include <stdio.h>
int main(){
//Declaración e inicialización de variables
int N=0;
int i=0;
int primo=1;
//Interacción con el usuario, y se almacena información en la variable N
printf("**| Determinar si un número mayor a 1 es primo |**\n");
printf("Ingrese un número: ");
scanf("%d",&N);
//Utilizamos for para determinar las condiciones
for (i=2;(i<N-1 && primo==1);i++)
{
// Con if verificamos el módulo que da el residuo, por el concepto de que un número primo solo es divisible entre sí mismo y uno
if (N%i==0)
{
primo=0;
}
}
// Sí el residuo es cero quiere decir que no es divisible en sólo en sí mismo, por lo tanto con if verificamos esa característica.
if (primo==0)
{
printf("No es primo\n");
} else{printf("Es primo\n");
}
return 0;
}
|
the_stack_data/68889213.c | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_tolower.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: vpelissi <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2014/11/03 17:22:44 by vpelissi #+# #+# */
/* Updated: 2014/11/03 17:44:30 by vpelissi ### ########.fr */
/* */
/* ************************************************************************** */
int ft_tolower(int c)
{
if (c >= 'A' && c <= 'Z')
return (c + 32);
else
return (c);
}
|
the_stack_data/94717.c | #include<stdio.h>
#include<string.h>
#include<ctype.h>
main()
{
FILE *fint,*ftab,*flen,*fsym;
int op1[10],txtlen,txtlen1,i,j=0,len;
char add[5],symadd[5],op[5],start[10],temp[30],line[20],label[20],mne[10],operand[10],symtab[10],opmne[10];
fint=fopen("input.txt","r");
flen=fopen("length.txt","r");
ftab=fopen("optab.txt","r");
fsym=fopen("symbol.txt","r");
fscanf(fint,"%s%s%s%s",add,label,mne,operand);
if(strcmp(mne,"START")==0)
{
strcpy(start,operand);
fscanf(flen,"%d",&len); //reading the length of the program
}
printf("H^%s^%s^%d\nT^00%s^",label,start,len,start); // reading the first instruction statement from source code
fscanf(fint,"%s%s%s%s",add,label,mne,operand);
while(strcmp(mne,"END")!=0)
{
fscanf(ftab,"%s%s",opmne,op); //reading opcodes from Optab
while(!feof(ftab))
{
if(strcmp(mne,opmne)==0)
{
fclose(ftab);
fscanf(fsym,"%s%s",symadd,symtab); //reading symbols from symtab
while(!feof(fsym)) //reading till EOF
{
if(strcmp(operand,symtab)==0)
{
printf("%s%s^",op,symadd); //
break;
}
else
fscanf(fsym,"%s%s",symadd,symtab);
}
break;
}
else
fscanf(ftab,"%s%s",opmne,op);
}
if((strcmp(mne,"BYTE")==0)||(strcmp(mne,"WORD")==0))
{
if(strcmp(mne,"WORD")==0)
printf("0000%s^",operand);
else
{
len=strlen(operand);
for(i=2;i<len;i++)
{
printf("%d",operand[i]);
}
printf("^");
}
}
fscanf(fint,"%s%s%s%s",add,label,mne,operand);
ftab=fopen("optab.txt","r");
fseek(ftab,SEEK_SET,0);
}
printf("\nE^00%s",start);
fclose(fint);
fclose(ftab);
fclose(fsym);
fclose(flen);
fcloseall();
}
|
the_stack_data/161081355.c | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_strncpy.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: akharrou <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2018/10/29 09:27:41 by akharrou #+# #+# */
/* Updated: 2018/11/01 09:49:09 by akharrou ### ########.fr */
/* */
/* ************************************************************************** */
char *ft_strncpy(char *dest, char *src, unsigned int n)
{
unsigned int i;
i = 0;
while (*src && i < n)
dest[i++] = *src++;
while (i < n)
dest[i++] = '\0';
return (dest);
}
|
the_stack_data/156392695.c | /*
* Copyright (C) 2010 The Android Open Source Project
*
* 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
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/* This program tests for a compiler bug that was found in the
* arm-linux-androideabi-4.4.3 toolchain and fixed by the change at
* https://review.source.android.com/#change,19474
*
* The bug generated an invalid sequence of thumb machine instructions
* when signed chars were being used.
*/
#include <stdio.h>
int test(signed char anim_col)
{
if (anim_col >= 31) {
return 1;
} else if (anim_col <= -15) {
return -2;
}
return 0;
}
int main(void)
{
const int testval = -7;
const int expected = 0;
int ret = test(testval);
if (ret != expected) {
fprintf(stderr, "ERROR: test(%d) returned %d instead of %d\n",
testval, ret, expected);
return 1;
}
printf("OK: test(%d) returned %d\n", testval, expected);
return 0;
}
|
the_stack_data/1044940.c | #include <stdlib.h>
#include <stdio.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/wait.h>
int result;
int main()
{
int array[] = {1, 2, 3, 4}, result_first = 0, result_second = 0;
pid_t first = fork();
if(first == 0)
{
result_first += array[0] + array[1];
printf("Child 1, %d \n", result_first);
exit(0);
}
pid_t second = fork();
if(second == 0)
{
result_second += array[2] + array[3];
printf("Child 2, %d \n", result_second);
exit(0);
}
wait(0);
wait(0);
result += result_first + result_second;
printf("Parent: result=%d \n", result);
return 0;
}
|
the_stack_data/53517.c | //
// main.c
// baodaotanxianDFS
//
// Created by mingyue on 2022/4/23.
// Copyright © 2022 Gmingyue. All rights reserved.
//
/**
10 10 6 8
1 2 1 0 0 0 0 0 2 3
3 0 2 0 1 2 1 0 1 2
4 0 1 0 1 2 3 2 0 1
3 2 0 0 0 1 2 4 0 0
0 0 0 0 0 0 1 5 3 0
0 1 2 1 0 1 5 4 3 0
0 1 2 3 1 3 6 2 1 0
0 0 3 4 8 9 7 5 0 0
0 0 0 8 7 8 6 0 1 2
0 0 0 0 0 0 0 0 1 0
38
*/
#include <stdio.h>
int a[51][51];
int book[51][51], n, m, sum;
void dfs(int x, int y) {
int next[4][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
int k, tx, ty;
for (k = 0; k <= 3; k++) {
tx = x + next[k][0];
ty = y + next[k][1];
if (tx < 1 || tx > n || ty < 1 || ty > m) {
continue;
}
if (a[tx][ty] > 0 && book[tx][ty] == 0) {
sum++;
book[tx][ty] = 1;
dfs(tx, ty);
}
}
return;
}
int main(int argc, const char * argv[]) {
int i, j, startX, startY;
scanf("%d %d %d %d", &n, &m, &startX, &startY);
for (i = 1; i <= n; i++) {
for (j = 1; j <= m; j++) {
scanf("%d", &a[i][j]);
}
}
book[startX][startY] = 1;
sum = 1;
dfs(startX, startY);
printf("%d\n", sum);
getchar();getchar();
return 0;
}
|
the_stack_data/960749.c | //#include <iostream>
//#include <glad/glad.h> // 要选于glfw引入
//#include <GLFW/glfw3.h>
//
//// 回调函数声明
//void framebuffer_size_callback(GLFWwindow* window, int width, int height);
//void processInput(GLFWwindow *window);
//
//// settings
//const unsigned int SCR_WIDTH = 300;
//const unsigned int SCR_HEIGHT = 300;
//
//int main(int argc, char * argv[]) {
// // 初始化GLFW
// glfwInit();
// glfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, 3);
// glfwWindowHint(GLFW_CONTEXT_VERSION_MINOR, 3);
// glfwWindowHint(GLFW_OPENGL_PROFILE, GLFW_OPENGL_CORE_PROFILE);
//#ifdef __APPLE__
// glfwWindowHint(GLFW_OPENGL_FORWARD_COMPAT, GL_TRUE); // uncomment this statement to fix compilation on OS X
//#endif
// // 创建一个窗口对象
// GLFWwindow *window = glfwCreateWindow(SCR_WIDTH, SCR_HEIGHT, "opengl_190715", NULL, NULL);
// if (window == NULL)
// {
// glfwTerminate();
// return -1;
// }
// // 通知GLFW将我们窗口的上下文设置为当前线程的主上下文
// glfwMakeContextCurrent(window);
// // 对窗口注册一个回调函数,每当窗口改变大小，GLFW会调用这个函数并填充相应的参数供你处理
// glfwSetFramebufferSizeCallback(window, framebuffer_size_callback);
// // 初始化GLAD用来管理OpenGL的函数指针
// if (!gladLoadGLLoader((GLADloadproc)glfwGetProcAddress)) {
// return -1;
// }
//
// // 渲染循环
// while(!glfwWindowShouldClose(window)) {
// // 输入
// processInput(window);
//
// // 渲染指令
// glClearColor(0.0f, 1.0f, 1.0f, 1.0f);
// glClear(GL_COLOR_BUFFER_BIT);
//
// // 检查并调用事件，交换缓冲
// glfwPollEvents(); // 检查触发事件
// glfwSwapBuffers(window); // 交换颜色缓冲
// }
//
// // 释放/删除之前的分配的所有资源
// glfwTerminate();
// return EXIT_SUCCESS;
//}
//
//// 输入控制，检查用户是否按下了返回键(Esc)
//void processInput(GLFWwindow *window) {
// if(glfwGetKey(window, GLFW_KEY_ESCAPE) == GLFW_PRESS)
// glfwSetWindowShouldClose(window, true);
//}
//
//// 当用户改变窗口的大小的时候，视口也应该被调整
//void framebuffer_size_callback(GLFWwindow *window, int width, int height) {
// // 注意：对于视网膜(Retina)显示屏，width和height都会明显比原输入值更高一点。
// glViewport(0, 0, width, height);
//}
|
the_stack_data/74251.c | /*
* Software License Agreement (BSD License)
*
* Copyright (c) 2010, Roel Verdult
* 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 copyright holders 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 ''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 COPYRIGHT HOLDERS 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.
*
*/
#include <stdio.h>
#include <stdint.h>
#define BLOCK_COUNT 7
#define BLOCK_LENGTH 4
#define BLOCK_TOTAL (BLOCK_COUNT*BLOCK_LENGTH)
typedef unsigned char byte_t;
int main(int argc, char *argv[])
{
FILE* pf;
byte_t buf[BLOCK_TOTAL];
uint32_t crc = 0;
uint32_t block;
// Check for required arguments
if (argc < 2)
{
printf("syntax: lpcrc <firmware.bin>\n");
return 1;
}
// Try to open the supplied firmware
if ((pf = fopen(argv[1],"rb+")) == NULL)
{
printf("error: could not open file [%s] with write access\n",argv[1]);
return 1;
}
// Read out the data blocks used for crc calculation
if (fread(buf,1,BLOCK_TOTAL,pf) != BLOCK_TOTAL)
{
printf("error: could not read required bytes\n");
fclose(pf);
return 1;
}
// Compute the crc value
for (block=0; block<BLOCK_COUNT; block++)
{
crc += *((uint32_t*)(buf+(block*BLOCK_LENGTH)));
}
crc = (~crc) + 1;
// Reposition the file stream indicator to switch between read and write
if (fseek(pf,0,SEEK_CUR) != 0)
{
printf("error: could not switch from read to write mode\n");
fclose(pf);
return 1;
}
// Write the crc back to the file
if (fwrite((byte_t*)&crc,1,BLOCK_LENGTH,pf) != BLOCK_LENGTH)
{
printf("error: could not write crc back to file\n");
fclose(pf);
return 1;
}
printf("succesfully updated crc to: %08x\n",crc);
fclose(pf);
return 0;
}
|
the_stack_data/179830314.c | int main()
{
int c;
int mm[2] = {1, 2};
c = mm[1] > mm[0];
print("c 1");
printid(c);
return 0;
} |
the_stack_data/225144554.c | #include <stdio.h>
#include <stdlib.h>
#include <pthread.h>
static inline
void f()
{
printf("this is f(inline)\n");
}
void e()
{
printf("this is e\n");
}
void d()
{
printf("this is d\n");
}
void c()
{
printf("this is c\n");
}
void b(int i)
{
printf("this is b\n");
if (i == 1) {
c();
f();
} else {
for (int i=0; i<2; i++) {
d();
}
e();
}
}
void a()
{
printf("this is a\n");
b(1);
b(2);
}
void* work(void* arg)
{
for (int i=0; i<=2; i++) {
a();
}
return NULL;
}
int main(int argc, char** argv)
{
for (int i=0; i<=2; i++) {
a();
}
pthread_t t1, t2;
pthread_create(&t1, NULL, work, NULL);
pthread_create(&t2, NULL, work, NULL);
pthread_join(t1, NULL);
pthread_join(t2, NULL);
return 0;
}
|
the_stack_data/67325586.c | #define _DEFAULT_SOURCE
#include <unistd.h> /* sleep() */
#include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
#include <string.h>
#include <time.h>
#include <X11/Xlib.h>
const char *tmfmt = "%Y-%m-%d %H:%M";
const char *tzmtl = "America/Montreal";
const char *tzgva = "Europe/Paris";
static Display *dpy;
char *smprintf(const char *fmt, ...)
{
va_list fmtargs;
char *ret;
int len;
va_start(fmtargs, fmt);
len = vsnprintf(NULL, 0, fmt, fmtargs);
va_end(fmtargs);
ret = malloc(++len);
if (ret == NULL) {
perror("malloc");
exit(1);
}
va_start(fmtargs, fmt);
vsnprintf(ret, len, fmt, fmtargs);
va_end(fmtargs);
return ret;
}
void settz(const char *tzname)
{
setenv("TZ", tzname, 1);
}
char* mktimes(const char *fmt, const char *tzname)
{
char buf[129];
time_t tim;
struct tm *timtm;
memset(buf, 0, sizeof(buf));
settz(tzname);
tim = time(NULL);
timtm = localtime(&tim);
if (timtm == NULL) {
perror("localtime");
exit(1);
}
if (!strftime(buf, sizeof(buf)-1, fmt, timtm)) {
fprintf(stderr, "strftime == 0\n");
exit(1);
}
return smprintf("%s", buf);
}
void setstatus(const char *str)
{
XStoreName(dpy, DefaultRootWindow(dpy), str);
XSync(dpy, False);
}
char* battery(void)
{
int nmarks,full,now;
char *bar;
FILE *battinfo = fopen("/sys/class/power_supply/BAT1/energy_full","r");
fscanf(battinfo,"%d",&full);
fclose(battinfo);
battinfo = fopen("/sys/class/power_supply/BAT1/energy_now","r");
fscanf(battinfo,"%d",&now);
fclose(battinfo);
bar = (char*)malloc(sizeof(char) * 25);
nmarks = 10*now/full;
if((double)now/full <= 0.05) {
strcpy(bar,"*** BATTERIE < 5% ***");
} else {
strcpy(bar,"[");
for(int i = 1; i < 11; i++) {
if(i <= nmarks)
strcat(bar,"#");
else
strcat(bar," ");
}
strcat(bar,"]");
}
return bar;
}
int main(void)
{
char *status;
char *batt;
char *tmmtl;
char *tmgva;
if (!(dpy = XOpenDisplay(NULL))) {
fprintf(stderr, "dwmstatus: cannot open display.\n");
return 1;
}
for (;;sleep(1)) {
batt = battery();
tmmtl = mktimes(tmfmt, tzmtl);
tmgva = mktimes(tmfmt, tzgva);
status = smprintf("%s | mtl: %s gva: %s",
batt,tmmtl,tmgva);
setstatus(status);
free(batt);
free(tmmtl);
free(status);
}
XCloseDisplay(dpy);
return 0;
}
|
the_stack_data/785494.c | #include <stdio.h>
typedef unsigned char *byte_pointer;
void show_bytes(byte_pointer start, int len)
{
for (int i = 0; i < len; i++)
printf("%.2x", start[i]);
printf("\n");
}
void show_init(int x)
{
show_bytes((byte_pointer)&x, sizeof(int));
}
void show_float(float x)
{
show_bytes((byte_pointer)&x, sizeof(float));
}
void show_pointer(void *x)
{
show_bytes((byte_pointer)&x, sizeof(void *));
}
int main()
{
int num = 10;
float fnum = (float)num;
int *pnum = #
show_init(num); // 0a 00 00 00
show_float(fnum); // 00 00 20 41
show_pointer(pnum); // cc 87 ae 5c ff 7f 00 00
} |
the_stack_data/145262.c | #include <stdio.h>
#include <math.h>
int main() {
int num, quad, raiz;
printf("Escreva um numero inteiro: ");
scanf("%d", &num);
printf("O quadrado de %d e %.2f e a raiz quadrada de %d e %.2f", num, pow(num,2), num, sqrt(num));
return(0);
}
|
the_stack_data/165769230.c | /*
* Copyright (C) 2016 The CyanogenMod Project
*
* 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
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifdef LIBSHIMS_64BIT
/* MediaBufferGroup::MediaBufferGroup */
int _ZN7android16MediaBufferGroupC1Em();
int _ZN7android16MediaBufferGroupC1Ev() {
return _ZN7android16MediaBufferGroupC1Em();
}
#else
/* MediaBufferGroup::MediaBufferGroup */
int _ZN7android16MediaBufferGroupC1Ej();
int _ZN7android16MediaBufferGroupC1Ev() {
return _ZN7android16MediaBufferGroupC1Ej();
}
#endif
|
the_stack_data/26700274.c | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
bool buscaBinaria(int * vetor_inteiros, int tamanho_vetor, int valor_procurado){
bool foi_encontrado = false;
int esquerda = 0, direita = tamanho_vetor - 1, pivo;
while(esquerda <= direita){
pivo = (esquerda + direita)/2;
if(vetor_inteiros[pivo] == valor_procurado){
printf("Valor[%d] encontrado na posição: %d", valor_procurado, pivo);
foi_encontrado = true;
return foi_encontrado;
}
if(vetor_inteiros[pivo] < valor_procurado){
esquerda = pivo + 1;
}
else{
direita = pivo - 1; //Interessante notar que para fazer as aleterações tanto a esquerda, como a direita, sempre se baseiam no valor do pivo (meio).
//Digo isto pois errei, inicialmente, colocando aqui o valor da esquerda - 1.
//O que, caso o algoritmo iniciasse com o pivo sendo menor que o valor solicitado, ele iria pegar o valor da esquerda (0) - 1, ou seja -1.
//Isso acaba por resultar em uma situação onde, no começo do algoritmo, o valor da esquerda torna-se maior que o da direita.
//Assim, terminando a busca.
}
}
if(foi_encontrado == false)
printf("Valor %d não foi encontrado!", valor_procurado);
return foi_encontrado;
}
void main(){
bool foi_encontrado;
int * vetor_inteiros;
int tamanho_vetor, valor_procurado, posicao_valor;
printf("Digite o tamanho do vetor: ");
scanf("%d", &tamanho_vetor);
vetor_inteiros = (int *) malloc(tamanho_vetor * sizeof(int));
for(int x = 0; x < tamanho_vetor; x++){
printf("Digite o valor na posição[%d]: ", x);
scanf("%d", &vetor_inteiros[x]);
}
printf("Digite o valor procurado: ");
scanf("%d", &valor_procurado);
foi_encontrado = buscaBinaria(vetor_inteiros, tamanho_vetor, valor_procurado);
}
|
the_stack_data/57949465.c | #include<stdio.h>
#include<math.h>
int main(void)
{
float x[10],y[10],a[10][10];
int i,j,k,n,iteration;
printf("Enter the value of order:\n");
scanf("%d",&n);
printf("Enter the coefficient and RHS\n");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
scanf("%f",&a[i][j]);
}
getchar();
}
for(i=0;i<n;i++)
{
x[i]=0;
y[i]=0;
}
iteration=0;
printf("Here");
for(k=0;k<n;k++)
{
if(fabs(x[k]-y[k])>0.00005)
{
printf("\nIteration=%d\n",iteration);
for(i=0;i<n;i++)
{
y[i]=x[i];
printf("\nx[%d]= %f",i,x[i]);
}
iteration+=1;
for(i=0;i<n;i++)
{
x[i]=a[i][n];
for(j=0;j<n;j++)
{
if(i!=j)
{
x[i]=x[i]-(a[i][j]*x[j]);
}
}
x[i]=x[i]/a[i][i];
}
}
}
printf("Here2");
printf("\n THE FINAL RESULT IS \n");
for(i=0;i<n;i++)
{
printf("%f\t",x[i]);
}
return 0;
}
|
the_stack_data/117326711.c | /*
This test makes sure the thread exit notification signals don't
interfere with the stack growth signals.
Thread death notifications are sent as RT signals, which are
queued. In general, these notifications are ignored, since they're
only used by the main thread if it has exited and is still waiting
for the rest to exit.
The system has a finite limit to the number of RT signals which can
be queued (typically 1024), and beyond that it stops queueing
siginfo. We rely on getting SIGSEGVs with siginfo information to
grow the stack. If we don't get the siginfo, then it just looks
like the program crashed.
The extra complication in this test is making sure that the
unwanted signals are discarded while the main thread is blocked in
a syscall. So, to check this, main creates a new process, which
attempts to grow the stack once all the threads have been created
and exited. main() itself is blocked waiting for the child
process.
Oh, and this test also makes sure that thread resources are cleaned
up properly.
*/
#include <pthread.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#include <signal.h>
#include <sys/wait.h>
static int grower;
static void handler(int sig)
{
}
static void *thr(void *v)
{
return 0;
}
#define FRAME 4096
static void grow(int depth)
{
volatile char frame[FRAME];
memset((char *)frame, 0xff, sizeof(frame));
if (depth > 1)
grow(depth-1);
}
static void *maker(void *v)
{
int i;
sleep(1);
/* Create lots of threads */
printf("creating threads...\n");
for(i = 0; i < 1300; i++) {
pthread_t t;
int ret;
if (i % 100 == 0)
printf("%d...\n", i);
ret = pthread_create(&t, NULL, thr, NULL);
if (ret) {
printf("pthread_create failed: %s\n", strerror(ret));
exit(1);
}
ret = pthread_join(t, NULL);
if (ret) {
printf("pthread_join failed: %s\n", strerror(ret));
exit(1);
}
}
kill(grower, SIGUSR1);
return NULL;
}
int main()
{
pthread_t pth;
sigset_t mask;
int status;
struct sigaction sa;
sigemptyset(&mask);
sigaddset(&mask, SIGCHLD);
sigprocmask(SIG_BLOCK, &mask, NULL);
sa.sa_handler = handler;
sa.sa_flags = 0;
sigfillset(&sa.sa_mask);
sigaction(SIGUSR1, &sa, NULL);
grower = fork();
if (grower == -1) {
perror("fork");
exit(1);
}
if (grower == 0) {
pause(); /* child - wait for SIGUSR1 */
grow(10);
printf("stack grew OK\n");
exit(0);
}
pthread_create(&pth, NULL, maker, NULL);
/* wait for child */
if (waitpid(grower, &status, 0) != grower)
printf("FAILED\n");
else if (WIFEXITED(status) && WEXITSTATUS(status) == 0)
printf("PASS: child OK\n");
else
printf("FAILED: exit status=%d\n", status);
pthread_join(pth, NULL);
return 0;
}
|
the_stack_data/165766226.c | // How movies portray robots
#include <stdint.h>
typedef struct robot_counter {
uint32_t uptime_ticks: 31;
uint8_t should_kill_humans: 1;
} robot_counter;
extern void tick(robot_counter);
void time_keeper() {
robot_counter counter = {
.uptime_ticks = 0,
.should_kill_humans = 0,
};
uint32_t *fast_counter = (uint32_t *) &counter;
while (1) {
(*fast_counter)++;
tick(counter);
}
}
|
the_stack_data/122836.c | #include <stdlib.h>
#include <stdio.h>
int main(int argc, char *argv[])
{
FILE *file;
if (argc != 2)
{
printf("File Name: %s name.type\n");
}
else
{
file = fopen(argv[1], "r");
}
if (file == NULL)
{
printf("The file could not be found.\n");
}
else
{
int i;
while ((i = fgetc(file)) != EOF)
{
printf("%c", i);
}
fclose(file);
}
}
|
the_stack_data/70449162.c | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <string.h>
/* Multiply n x n matrices a and b */
void multiply_naive(double *a, double *b, double *c, int n) {
int i, j, k;
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
for (k = 0; k < n; k++)
c[i*n + j] += a[i*n + k]*b[k*n + j];
}
/* Multiply n x n matrices a and b */
void multiply_blocked(double *a, double *b, double *c, int n, int B) {
int i, j, k, i1, j1, k1;
for (i = 0; i < n; i+=B)
for (j = 0; j < n; j+=B)
for(k = 0; k < n; k+=B)
/* B x B mini matrix multiplications */
// DONE: Complete this method
for (i1 = 0; i1 < B && i+i1 < n; i1++)
for (j1 = 0; j1 < B && j+j1 < n; j1++)
for (k1 = 0; k1 < B && k+k1 < n; k1++)
c[(i+i1)*n + (j+j1)] +=
a[(i+i1)*n + (k+k1)]*b[(k+k1)*n + (j+j1)];
}
void readMatrix(char* filename, double* matrix, int n) {
int i, j;
double x;
FILE* fp = fopen(filename,"r");
for (i=0;i<n;i++){
for(j=0;j<n;j++){
fscanf(fp,"%lf",&x);
matrix[i*n+j] = x;
}
}
fclose(fp);
}
int main ( int arc, char **argv ) {
char* method = argv[1];
int n = atoi(argv[2]);
char *filenameA = argv[3];
char *filenameB = argv[4];
int block_size=n;
if (strcmp(method,"blocked")==0) {
block_size = atoi(argv[5]);
}
printf("method=%s\nN=%d\nB=%d\nmatrix A: %s\nmatrix B: %s\n",method,n,block_size, filenameA, filenameB);
double* a = (double *) calloc(sizeof(double), n*n);
double* b = (double *) calloc(sizeof(double), n*n);
readMatrix(filenameA, a, n);
readMatrix(filenameB, b, n);
// DONE: initialize matrix c, calloc zeroes initialized buffer
double* c = (double *) calloc(sizeof(double), n*n);
clock_t begin, end;
double time_spent;
begin = clock();
if (strcmp(method,"blocked")==0){
multiply_blocked(a,b,c,n,block_size);
} else {
multiply_naive(a,b,c,n);
}
end = clock();
time_spent = (double)(end - begin) / CLOCKS_PER_SEC;
printf("time: %lf\n", time_spent);
return 0;
};
|
the_stack_data/203053.c | // compile with: gcc -std=c99 -Wall -g islands.c -lpthread -o islands
//
// parent thread: glud
// children threads: people (kids or adults)
//
// licence WTFPL
//
#include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#define bool int
#define true 1
#define false 0
// defining the number of people in the islands
#define KIDS_OAHU 3
#define ADULTS_OAHU 5
#define TOTAL_OAHU (KIDS_OAHU + ADULTS_OAHU)
#define KIDS_MOLOKAI 0
#define ADULTS_MOLOKAI 6
#define TOTAL_MOLOKAI (KIDS_MOLOKAI + ADULTS_MOLOKAI)
#define TOTAL_PEOPLE (TOTAL_OAHU + TOTAL_MOLOKAI)
// islands of Hawaii
#define OAHU 0x15
#define MOLOKAI 0x62
#define BOAT 0x25
// the boat and its resources
struct boat {
int name;
void *parked;
// the boat know the islands but it shouldn't parked in some island if not
// is not throwing.
struct oahu *oahu;
struct molokai *molokai;
bool pilot;
bool copilot;
bool rowing;
pthread_mutex_t mutex_boat;
pthread_cond_t cond_boat; // used for syncronize the get off of the boat
pthread_cond_t cond_boat2; // used for syncronize the get off of the boat
};
#define boat_parked(island) ( ((struct basic_island *) island)->boat != NULL)
#define boat_occupied(boat) ((boat)->pilot == true)
#define boat_with_copilot(boat) ((boat)->copilot == true)
#define get_on_board_as_pilot(boat) (boat)->pilot = true
#define get_on_board_as_copilot(b) {\
(b)->copilot = true; \
wplace->place = ((struct basic_island *)wplace->place)->boat; }
#define get_off_board_as_pilot(boat) (boat)->pilot = false
#define get_off_board_as_copilot(boat) (boat)->copilot = false
// scheme of an island structure
struct basic_island {
int name;
struct boat *boat;
};
#define ubication(wplace) *((int *) wplace->place)
#define lifting_the_anchors(wplace) {\
struct basic_island *island = wplace->place; \
wplace->place = island->boat; \
( (struct boat *)wplace->place )->parked = NULL; \
island->boat = NULL; }
#define arrived_(island, wplace) {\
struct boat *b = wplace->place; \
b->parked = b->island; \
wplace->place = b->island; \
((struct basic_island *) wplace->place)->boat = b; }
// island of oahu
struct oahu {
int name;
struct boat *boat;
int population;
pthread_mutex_t mutex_counter; // for count the population
// for select only two kids from possibly more than two kids
int selected_kids;
pthread_mutex_t mutex_oahu;
// when kids set this condition then it's possible get on the boat
pthread_cond_t wait_signal_kids;
bool boat_ready;
// the selected kid wait for her copilot
pthread_cond_t waiting_copilot;
// one selected kid wait the boat and the second selected kid that come
// from Molokai
pthread_cond_t waiting_second_kid;
};
// island of molokai
struct molokai {
int name;
struct boat *boat;
pthread_mutex_t mutex_molokai;
pthread_cond_t waiting_boat; // selected kid wait the return of the boat
bool first_gone; // know if is the first selected kid who come back to Oahu
};
// this is for each person, with this glud (parent thread) can see the state
// (the place) of his children (each person)
struct wrapped_place {
void *place;
struct glud_communication *glud_com;
};
// for synchronization between threads children (the people) and the parent
// thread (glud)
struct glud_communication {
bool *glud_say_finished;
bool *finished;
pthread_mutex_t *mutex_glud;
pthread_cond_t *people_wait_glud;
pthread_cond_t *glud_wait_kids;
};
// the trow made by each kid (no selected kids) and adult in Oahu
void trow_to_molokai(struct wrapped_place *wplace, char *kid_or_adult)
{
// actual place: Oahu
{
struct oahu *oahu = wplace->place;
// add herself to the population
pthread_mutex_lock( &(oahu->mutex_counter) );
(oahu->population) ++;
printf("population Oahu: %2d\n", oahu->population);
pthread_mutex_unlock( &(oahu->mutex_counter) );
pthread_mutex_lock( & (oahu->mutex_oahu) );
// wait while the boat is NOT ready
if(!oahu->boat_ready)
do pthread_cond_wait( &(oahu->wait_signal_kids)
, &(oahu->mutex_oahu));
while(!boat_parked(oahu) || boat_occupied(oahu->boat));
get_on_board_as_pilot(oahu->boat);
// the boat is now occupied, then is NOT ready
oahu->boat_ready = false;
lifting_the_anchors(wplace);
pthread_mutex_unlock( & (oahu->mutex_oahu) );
// delete herself to the population
pthread_mutex_lock( &(oahu->mutex_counter) );
(oahu->population) --;
printf("population Oahu: %2d\n", oahu->population);
pthread_mutex_unlock( &(oahu->mutex_counter) );
}
// actual place: the boat
{
struct boat *boat = wplace->place;
// rowing, rowing, rowing
printf("%s rowing to molokai\n", kid_or_adult);
arrived_(molokai, wplace);
printf("%s arrive molokai\n", kid_or_adult);
get_off_board_as_pilot(boat);
}
// actual place: Molokai
{
struct molokai *molokai = wplace->place;
// one selected kid is waiting for the boat, the person inform about
// the boat that is ready in Molokai
pthread_mutex_lock( &(molokai->mutex_molokai) );
pthread_cond_signal( &(molokai->waiting_boat) );
pthread_mutex_unlock( &(molokai->mutex_molokai) );
}
}
// kids behavior
void *kid(void *wrapped_place)
{
// now I, one kid, appear in somewhere
struct wrapped_place *wplace = (struct wrapped_place *) wrapped_place;
// where am I?
switch ( ubication(wplace) ) {
case OAHU:
// kid in Oahu
printf("kid in Oahu\n");
// only two kids are selected, then they need know who they are
bool i_am_selected = false;
{
struct oahu *oahu = wplace->place;
pthread_mutex_lock( & (oahu->mutex_oahu) );
// if not all kids are selected (two kids will selected), then
// she is selected
if(oahu->selected_kids < 2) {
oahu->selected_kids ++;
i_am_selected = true;
}
pthread_mutex_unlock( & (oahu->mutex_oahu) );
}
// if the kid are not selected then she do exactly that the adults do
if(!i_am_selected) {
trow_to_molokai(wplace, "kid");
// the kid was selected, then she is one of the leaders of the operation
} else {
printf("kid selected\n");
// do the next routine while glud don't say that every is finished
// (note: while `break`s in the middle)
while(true) {
// for know if is the pilot or the copilot
bool i_am_pilot = false;
int posible_population_oahu;
// kid in Oahu
{
struct oahu *oahu = wplace->place;
// count the population while on Oahu
posible_population_oahu = oahu->population;
pthread_mutex_lock( &(oahu->mutex_oahu) );
// if the boat is not occupied, then
if(!boat_occupied(oahu->boat)) {
// the first on the boat do:
get_on_board_as_pilot(oahu->boat);
i_am_pilot = true;
printf("kid* as pilot (in oahu)\n");
// wait while the copilot get on the boat
do pthread_cond_wait( &(oahu->waiting_copilot)
, &(oahu->mutex_oahu));
while(!boat_with_copilot(oahu->boat));
lifting_the_anchors(wplace);
// if someone is on the boat, then
} else {
// the second on the boat (is the copilot):
get_on_board_as_copilot(oahu->boat);
printf("kid* as copilot (in oahu)\n");
// say to the pilot that the copilot is on board
pthread_cond_signal( &(oahu->waiting_copilot) );
}
pthread_mutex_unlock( &(oahu->mutex_oahu) );
}
// kid in the boat
{
struct boat *boat = wplace->place;
if(i_am_pilot) {
// the pilot do
pthread_mutex_lock( &(boat->mutex_boat) );
// the pilot row to Molokai
boat->rowing = true;
printf("kid* rowing to molokai\n");
// if the copilot is waiting for the pilot then
// inform she that the boat is now rowing
pthread_cond_signal( &(boat->cond_boat2) );
// wait while the copilot arrive to the island
do pthread_cond_wait( &(boat->cond_boat)
, &(boat->mutex_boat) );
while (boat_with_copilot(boat));
// the boat arrive
arrived_(molokai, wplace);
// now the boat is not rowing
boat->rowing = false;
// get off the boat
get_off_board_as_pilot(boat);
printf("kid* arrive Molokai\n");
// say to the copilot that the boat is now parked
pthread_cond_signal( &(boat->cond_boat2) );
pthread_mutex_unlock( &(boat->mutex_boat) );
} else {
// the copilot do
pthread_mutex_lock( &(boat->mutex_boat) );
// if the boat is not rowing wait for the pilot inform
// about that
while( !(boat->rowing) )
pthread_cond_wait( &(boat->cond_boat2)
, &(boat->mutex_boat) );
// now, the pilot is rowing to Molokai, then I ride to
// Molokai
printf("kid* ride to Molokai\n");
// the boat arrive Molokai
wplace->place = boat->molokai;
// the kid get off the boat
get_off_board_as_copilot(boat);
printf("kid* arrive Molokai\n");
// say to the pilot that the boat arrived
pthread_cond_signal( &(boat->cond_boat) );
// wait for the pilot, who is park the boat.
pthread_cond_wait( &(boat->cond_boat2)
, &(boat->mutex_boat) );
pthread_mutex_unlock( &(boat->mutex_boat) );
}
}
bool the_end = false;
// if the kid remaind that was no one on the island then she
// communicate with Glud
if(posible_population_oahu == 0) {
pthread_mutex_lock( wplace->glud_com->mutex_glud );
// if Glud say that everything is ok, then is the end
if(*(wplace->glud_com->glud_say_finished))
the_end = true;
// if Glud not said that everything is ok, then ask him
else {
// for me is everything ok,
*(wplace->glud_com->finished) = true;
printf("questioning to glud\n");
// , and for you Glud, is everything okay?
pthread_cond_signal( wplace->glud_com->glud_wait_kids );
// wait for the answer of Glud
pthread_cond_wait( wplace->glud_com->people_wait_glud
, wplace->glud_com->mutex_glud );
// if Glud say that everything is ok, then is the end
if(*(wplace->glud_com->glud_say_finished))
the_end = true;
}
pthread_mutex_unlock( wplace->glud_com->mutex_glud );
// is it the end?
if(the_end)
break;
}
bool first_kid = true;
// kid in Molokai
{
struct molokai *molokai = wplace->place;
pthread_mutex_lock( &(molokai->mutex_molokai) );
// if the first kid is gone now then
if(! molokai->first_gone)
// I'm the first kid to return to Oahu, then
molokai->first_gone = true;
else {
// I'm not the first kid gone to Oahu
first_kid = false;
// wait while the boat is not in Molokai
while (!boat_parked(molokai))
pthread_cond_wait( &(molokai->waiting_boat)
, &(molokai->mutex_molokai) );
// now, nobody will be in the island then reset the
// variable
molokai->first_gone = false;
}
// get on boat and return to Oahu
get_on_board_as_pilot(molokai->boat);
lifting_the_anchors(wplace);
pthread_mutex_unlock( &(molokai->mutex_molokai) );
}
// kid on boat
{
struct boat *boat = wplace->place;
printf("kid* rowing to Oahu\n");
arrived_(oahu, wplace);
printf("kid* arrive Oahu\n");
get_off_board_as_pilot(boat);
}
// kid in Oahu
if(first_kid)
{
// the first kid to return to Oahu do:
struct oahu *oahu = wplace->place;
pthread_mutex_lock( &(oahu->mutex_oahu) );
// the kid inform to the people of the Oahu that the boat
// is ready
oahu->boat_ready = true;
pthread_cond_signal( &(oahu->wait_signal_kids) );
// the kid wait the second kid that will return from
// Molokai
pthread_cond_wait( &(oahu->waiting_second_kid)
, &(oahu->mutex_oahu));
pthread_mutex_unlock( &(oahu->mutex_oahu) );
}
else
{
struct oahu *oahu = wplace->place;
// when de second kid return to Oahu inform to the first
// kid that she is now in the island
pthread_mutex_lock( &(oahu->mutex_oahu) );
pthread_cond_signal( &(oahu->waiting_second_kid) );
pthread_mutex_unlock( &(oahu->mutex_oahu) );
}
}
}
break;
case MOLOKAI:
printf("kid in molokai\n");
break;
default:
printf("something went wrong!");
break;
}
pthread_mutex_lock( wplace->glud_com->mutex_glud );
// wait for the signal of Glud to die
while(! *(wplace->glud_com->glud_say_finished))
pthread_cond_wait( wplace->glud_com->people_wait_glud
, wplace->glud_com->mutex_glud );
pthread_mutex_unlock( wplace->glud_com->mutex_glud );
// well, kid die
puts("kid say bye");
return NULL;
}
// adults behavior
void *adult(void *wrapped_place)
{
// now I, one adult, appear in somewhere
struct wrapped_place *wplace = (struct wrapped_place *) wrapped_place;
// where am I?
switch ( ubication(wplace) ) {
case OAHU:
printf("adult in oahu\n");
trow_to_molokai(wplace, "adult");
break;
case MOLOKAI:
printf("adult in molokai\n");
// nothing to do
break;
default:
printf("something went wrong!");
break;
}
pthread_mutex_lock( wplace->glud_com->mutex_glud );
// wait for the signal of Glud to die
while(! *(wplace->glud_com->glud_say_finished))
pthread_cond_wait( wplace->glud_com->people_wait_glud
, wplace->glud_com->mutex_glud );
pthread_mutex_unlock( wplace->glud_com->mutex_glud );
// well, adult die
puts("adult say bye");
return NULL;
}
// parent thread (glud), who create the people and send the signal to die
int main()
{
printf("*** simulation initialized ***\n");
// one thread for each person
pthread_t people[TOTAL_PEOPLE];
// state of each person
struct wrapped_place people_state[TOTAL_PEOPLE];
// initializing the islands and the boat
struct oahu oahu = { .name = OAHU
, .population = 0
, .mutex_counter = PTHREAD_MUTEX_INITIALIZER
, .selected_kids = 0
, .mutex_oahu = PTHREAD_MUTEX_INITIALIZER
, .wait_signal_kids = PTHREAD_COND_INITIALIZER
, .waiting_copilot = PTHREAD_COND_INITIALIZER
, .waiting_second_kid = PTHREAD_COND_INITIALIZER
, .boat_ready = false
};
struct molokai molokai = { .name = MOLOKAI
, .boat = NULL
, .mutex_molokai = PTHREAD_MUTEX_INITIALIZER
, .waiting_boat = PTHREAD_COND_INITIALIZER
, .first_gone = false
};
struct boat boat = { .name = BOAT
, .parked = &oahu
, .oahu = &oahu
, .molokai = &molokai
, .pilot = false
, .copilot = false
, .rowing = false
, .mutex_boat = PTHREAD_MUTEX_INITIALIZER
, .cond_boat = PTHREAD_COND_INITIALIZER
, .cond_boat2 = PTHREAD_COND_INITIALIZER
};
oahu.boat = &boat;
// used for comunicate between the people and glud
bool glud_say_finished = false;
bool finished = false;
pthread_mutex_t mutex_glud = PTHREAD_MUTEX_INITIALIZER;
pthread_cond_t people_wait_glud = PTHREAD_COND_INITIALIZER;
pthread_cond_t glud_wait_kids = PTHREAD_COND_INITIALIZER;
struct glud_communication glud_com = {
.glud_say_finished = &glud_say_finished
, .finished = &finished
, .mutex_glud = &mutex_glud
, .people_wait_glud = &people_wait_glud
, .glud_wait_kids = &glud_wait_kids
};
// creating all the people (threads)
int rc, i;
for (i=0; i<KIDS_OAHU; ++i) {
printf("glud: creating citizen %d kid in Oahu\n", i);
people_state[i].place = &oahu;
people_state[i].glud_com = &glud_com;
rc = pthread_create(&people[i], NULL, kid, (void *) &people_state[i]);
assert(0 == rc);
} for (; i<TOTAL_OAHU; ++i) {
printf("glud: creating citizen %d adult in Oahu\n", i);
people_state[i].place = &oahu;
people_state[i].glud_com = &glud_com;
rc = pthread_create(&people[i], NULL, adult, (void *) &people_state[i]);
assert(0 == rc);
} for (; i<TOTAL_OAHU + KIDS_MOLOKAI; ++i) {
printf("glud: creating citizen %d kid in Molokai\n", i);
people_state[i].place = &molokai;
people_state[i].glud_com = &glud_com;
rc = pthread_create(&people[i], NULL, kid, (void *) &people_state[i]);
assert(0 == rc);
} for (; i<TOTAL_PEOPLE; ++i) {
printf("glud: creating citizen %d adult in Molokai\n", i);
people_state[i].place = &molokai;
people_state[i].glud_com = &glud_com;
rc = pthread_create(&people[i], NULL, adult, (void *) &people_state[i]);
assert(0 == rc);
}
pthread_mutex_lock( &mutex_glud );
// while I (Glud) not said that everything is ok, then
while (!glud_say_finished) {
// if the kids said that they finished, then check if true
if(finished) {
glud_say_finished = true;
// checking if all the people are in Molokai
// if not, Glud say that everything is not okay
for(i=0; i<TOTAL_PEOPLE; ++i)
if( *((int *) people_state[i].place ) != MOLOKAI ) {
glud_say_finished = false;
finished = false;
break;
}
if(glud_say_finished)
printf("glud say: all finished\n");
// say to all the people who are waiting the aswer of Glud that now
// Glud has decided
pthread_cond_broadcast( &people_wait_glud );
}
else
// if the kids have not said anything then wait for they
pthread_cond_wait( &glud_wait_kids, &mutex_glud );
}
pthread_mutex_unlock( &mutex_glud );
/* wait for all threads to complete */
for (i=0; i<TOTAL_PEOPLE; ++i) {
rc = pthread_join(people[i], NULL);
assert(0 == rc);
}
printf("*** simulation finalized with success ***\n");
exit(EXIT_SUCCESS);
}
|
the_stack_data/117327499.c | /* This file was automatically generated by CasADi.
The CasADi copyright holders make no ownership claim of its contents. */
#ifdef __cplusplus
extern "C" {
#endif
/* How to prefix internal symbols */
#ifdef CODEGEN_PREFIX
#define NAMESPACE_CONCAT(NS, ID) _NAMESPACE_CONCAT(NS, ID)
#define _NAMESPACE_CONCAT(NS, ID) NS ## ID
#define CASADI_PREFIX(ID) NAMESPACE_CONCAT(CODEGEN_PREFIX, ID)
#else
#define CASADI_PREFIX(ID) inv_pendulum_phi_fun_ ## ID
#endif
#include <math.h>
#ifndef casadi_real
#define casadi_real double
#endif
#ifndef casadi_int
#define casadi_int int
#endif
/* Add prefix to internal symbols */
#define casadi_f0 CASADI_PREFIX(f0)
#define casadi_s0 CASADI_PREFIX(s0)
#define casadi_s1 CASADI_PREFIX(s1)
#define casadi_s2 CASADI_PREFIX(s2)
/* Symbol visibility in DLLs */
#ifndef CASADI_SYMBOL_EXPORT
#if defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
#if defined(STATIC_LINKED)
#define CASADI_SYMBOL_EXPORT
#else
#define CASADI_SYMBOL_EXPORT __declspec(dllexport)
#endif
#elif defined(__GNUC__) && defined(GCC_HASCLASSVISIBILITY)
#define CASADI_SYMBOL_EXPORT __attribute__ ((visibility ("default")))
#else
#define CASADI_SYMBOL_EXPORT
#endif
#endif
static const casadi_int casadi_s0[12] = {8, 1, 0, 8, 0, 1, 2, 3, 4, 5, 6, 7};
static const casadi_int casadi_s1[5] = {1, 1, 0, 1, 0};
static const casadi_int casadi_s2[7] = {3, 1, 0, 3, 0, 1, 2};
/* inv_pendulum_phi_fun:(i0[8],i1)->(o0[3]) */
static int casadi_f0(const casadi_real** arg, casadi_real** res, casadi_int* iw, casadi_real* w, void* mem) {
casadi_real a0, a1, a2, a3, a4;
a0=-3.5000000000000000e+00;
a1=arg[0] ? arg[0][6] : 0;
a2=arg[1] ? arg[1][0] : 0;
a1=(a1+a2);
a2=arg[0] ? arg[0][1] : 0;
a1=(a1*a2);
a0=(a0-a1);
a1=arg[0] ? arg[0][7] : 0;
a3=arg[0] ? arg[0][0] : 0;
a1=(a1*a3);
a0=(a0+a1);
if (res[0]!=0) res[0][0]=a0;
a0=arg[0] ? arg[0][3] : 0;
a1=arg[0] ? arg[0][4] : 0;
a0=(a0*a1);
a4=arg[0] ? arg[0][5] : 0;
a2=(a2*a4);
a0=(a0+a2);
if (res[0]!=0) res[0][1]=a0;
a0=arg[0] ? arg[0][2] : 0;
a0=(a0*a1);
a3=(a3*a4);
a0=(a0+a3);
a0=(-a0);
if (res[0]!=0) res[0][2]=a0;
return 0;
}
CASADI_SYMBOL_EXPORT int inv_pendulum_phi_fun(const casadi_real** arg, casadi_real** res, casadi_int* iw, casadi_real* w, void* mem){
return casadi_f0(arg, res, iw, w, mem);
}
CASADI_SYMBOL_EXPORT void inv_pendulum_phi_fun_incref(void) {
}
CASADI_SYMBOL_EXPORT void inv_pendulum_phi_fun_decref(void) {
}
CASADI_SYMBOL_EXPORT casadi_int inv_pendulum_phi_fun_n_in(void) { return 2;}
CASADI_SYMBOL_EXPORT casadi_int inv_pendulum_phi_fun_n_out(void) { return 1;}
CASADI_SYMBOL_EXPORT const char* inv_pendulum_phi_fun_name_in(casadi_int i){
switch (i) {
case 0: return "i0";
case 1: return "i1";
default: return 0;
}
}
CASADI_SYMBOL_EXPORT const char* inv_pendulum_phi_fun_name_out(casadi_int i){
switch (i) {
case 0: return "o0";
default: return 0;
}
}
CASADI_SYMBOL_EXPORT const casadi_int* inv_pendulum_phi_fun_sparsity_in(casadi_int i) {
switch (i) {
case 0: return casadi_s0;
case 1: return casadi_s1;
default: return 0;
}
}
CASADI_SYMBOL_EXPORT const casadi_int* inv_pendulum_phi_fun_sparsity_out(casadi_int i) {
switch (i) {
case 0: return casadi_s2;
default: return 0;
}
}
CASADI_SYMBOL_EXPORT int inv_pendulum_phi_fun_work(casadi_int *sz_arg, casadi_int* sz_res, casadi_int *sz_iw, casadi_int *sz_w) {
if (sz_arg) *sz_arg = 2;
if (sz_res) *sz_res = 1;
if (sz_iw) *sz_iw = 0;
if (sz_w) *sz_w = 0;
return 0;
}
#ifdef __cplusplus
} /* extern "C" */
#endif
|
the_stack_data/65083.c | # 1 "benchmarks/ds-04-impl3.c"
# 1 "<built-in>"
# 1 "<command-line>"
# 1 "/usr/include/stdc-predef.h" 1 3 4
# 1 "<command-line>" 2
# 1 "benchmarks/ds-04-impl3.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) {
# 123 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_overflow.h"
shiftR(0, waux, Nw);
y[i] = fxp_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){
# 228 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
shiftR(0, waux, Nw);
y[i] = fxp_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) {
# 139 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error.h"
shiftRboth(0.0f, wfaux, 0, waux, Nw);
y[i] = fxp_direct_form_2(waux, x[i], a_fxp, b_fxp, ds.a_size, ds.b_size);
yf[i] = double_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){
# 132 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h"
shiftR(0, waux, Nw);
y[i] = fxp_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));
# 79 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h"
generic_timing_shift_r_double(0, waux, Nw);
y[i] = generic_timing_double_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) {
# 69 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_timing_msp430.h"
shiftR(0, waux, Nw);
y[i] = double_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){
# 128 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle_closedloop.h"
shiftRDdouble(0, waux, Nw);
y[i] = double_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){
# 140 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_closedloop.h"
shiftRDdouble(0, waux_qtz, Nw);
y_qtz[i] = double_direct_form_2(waux_qtz, x_qtz[i], ans_den_qtz, ans_num_qtz, ans_den_size, ans_num_size);
shiftRDdouble(0, waux_double, Nw);
y_double[i] = double_direct_form_2(waux_double, x_double[i], ans_den_double, ans_num_double, ans_den_size, ans_num_size);
# 156 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_closedloop.h"
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 ((15 == 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 (15 < 0)
{
printf("\n\n********************************************************************************************\n");
printf("* set a X_SIZE > 0 *\n");
printf("********************************************************************************************\n");
__DSVERIFIER_assert(0);
}
else
{
X_SIZE_VALUE = 15;
}
}
if ((2 == 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 ((2 == 7) || (2 == 8) || (2 == 9) ||
(2 == 10) || (2 == 11) || (2 == 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-04-impl3.c" 2
digital_system ds = {
.b = { 135.0, -260.0, 125.0 },
.b_size = 3,
.a = { 1.0, -1.0, 0.0 },
.a_size = 3,
.sample_time = 0.02
};
implementation impl = {
.int_bits = 11,
.frac_bits = 5,
.max = 1.0,
.min = -1.0
};
|
the_stack_data/1245588.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define SLEN 81
struct namect {
char *fname;
char *lname;
int letters;
};
void getinfo(struct namect *);
void makeinfo(struct namect *);
void showinfo(const struct namect *);
void cleanup(struct namect *);
char *s_gets(char *st, int n);
int main(void) {
struct namect person;
getinfo(&person);
makeinfo(&person);
showinfo(&person);
cleanup(&person);
return 0;
}
void getinfo(struct namect *pst) {
char temp[SLEN];
printf("Please enter your first name.\n");
s_gets(temp, SLEN);
pst->fname = (char *)malloc(strlen(temp) + 1);
strcpy(pst->fname, temp);
printf("Please enter your last name.\n");
s_gets(temp, SLEN);
pst->lname = (char *)malloc(strlen(temp) + 1);
strcpy(pst->lname, temp);
}
void makeinfo(struct namect *pst) {
pst->letters = strlen(pst->fname) + strlen(pst->lname);
}
void showinfo(const struct namect *pst) {
printf("%s %s, your name contains %d letters.\n", pst->fname, pst->lname,
pst->letters);
}
void cleanup(struct namect *pst) {
free(pst->fname);
free(pst->lname);
}
char *s_gets(char *st, int n) {
char *ret_val;
char *find;
ret_val = fgets(st, n, stdin);
if (ret_val) {
find = strchr(st, '\n');
if (find) {
*find = '\0';
} else {
while (getchar() != '\n') {
continue;
}
}
}
return ret_val;
} |
the_stack_data/794646.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define TOL_D 0.2;
#define TOL_B 3.5;
/*#define M_PI acos(-1.0)*/
FILE *finput1, *finput2; /* pointer na vstupni soubor */
char *fname1, *fname2;
FILE *f_shiftoutput, *f_Boutput, *fasta;
#define WARN1 " \0"
#define WARN2 "** \0"
#define WARN3 "*** \0"
#define WARN4 "****\0"
#define WARN5 "!!!!\0"
int LONGLIST=0;
int SEQUENCE=0;
int DIFFER=0;
int ANISO=0;
/* int WATER_CONTACTS=0; */
char record[250], record2[250];
long int Aparam, Oparam; /* Number of records with "alternate" and/or BYLO LONG INT? nejde %4d
"Occupancy=0.50 atoms */
double Bmin, Bmax, Omin, Omax; /* Minimal and maximal B value and
Minimal and maximal occupancy respectively*/
double Bav; /* Average B value */
int atcount; /* Number of atoms */
int atBcount=0;
int atAcount=0;
int watercount=0;
int newres=1;
double told, tolb;
struct inmemtype{ /* Structure for record storage in a memory */
char *PDBstring;
struct inmemtype *nextr;
};
struct inmemtype
*alternate_first, /* The first record of "alternate" list */
*alternate_last, /* The last record of "alternate" list */
*Occup_first, /* The first record of "Occup=50.00" list */
*Occup_last, /* The last record of "Occup=50.00" list */
*Zccup_first, /* The first record of "Occup<=0.1" list */
*Zccup_last, /* The last record of "Occup<=0.1" list */
*locator; /* Just for moving along the list */
char Chstring_old[1]; /* Storing of the chain identifier*/
typedef struct bchain { /* Structure for storage of B values of individual chains */
char chain[1];
double Bmax, Bmin, Bav;
int atcount, rescount;
}BCHAIN;
BCHAIN **chain_array= NULL;
int chain_nu=-1;
typedef struct changeat { /* Structure for storage of changed atoms */
char Atiden[27], warning[5];
double dd,dx,dy,dz,dB,B,O;
}CHANGEAT;
CHANGEAT **shiftat_array= NULL; /*shifted atoms */
int shiftat_nu=-1;
CHANGEAT **difB_array=NULL; /* large B changes */
int difB_nu=-1;
CHANGEAT **difAl_array=NULL; /* both shifts and B changes */
int difAl_nu=-1;
typedef struct atoms { /* structure for storing input PDB file */
char *PDBstring;
char resname[4];
int Resnum;
char iCode;
double B;
}ATOMS;
ATOMS **atomA_array = NULL;
char atomA[10], atomB[10];
typedef struct anisoadp {
char *ADPstring;
double U11,U22,U33,U12,U13,U23;
}ANISOADP;
ANISOADP **adpA_array = NULL;
int adpAcount=0;
int ResBprev, ResShiftprev; /* prev residues - export of PDB files with biggest changes*/
typedef struct bextreme
{
char Atiden[27];
double B;
}BEXTREME;
BEXTREME lowB_array[10];
BEXTREME highB_array[10];
typedef struct nonconsh { /* nonstandard atoms */
char atom[3];
char resname[4];
int checked;
} NONCONSH;
NONCONSH **nonconsh_array=NULL;
int nonstd_nu=-1;
typedef struct nonstandard { /*nonstandard residues */
char chain;
int Atomcount, Resnum, checked;
char resname[4];
} NONSTD;
NONSTD **nonstd_array=NULL;
int nonconsh_nu=-1;
/*char resname[3]; */ /* proc [3]? kde se to pouziva? */
int Atomcount=0; /*number of atoms in a nonstandard residue*/
typedef struct seq {
char chain;
char *seqstr;
int chain_size;
} SEQ;
SEQ **sequence_array=NULL;
int sequence_nu=-1;
/* eigenvalues
Joachim Kopp
Numerical diagonalization of hermitian 3x3 matrices
arXiv.org preprint: physics/0610206
Int. J. Mod. Phys. C19 (2008) 523-548
*/
// Constants
#define M_SQRT3 1.73205080756887729352744634151 // sqrt(3)
// Macros
#define SQR(x) ((x)*(x)) // x^2
void printhelp(char *comm) /*Prints a help screen... */
{
fprintf(stderr,"\n Use: %s [-l] [-d] file_final (file2) [shift_tol[]] [delta_B_tol[]] \n\n",comm);
fprintf(stderr," Options: -l ... lists all atoms with occupancy different\n");
fprintf(stderr," from 0.00 and 1.00\n");
fprintf(stderr," -d ... compares atom positions and B-factors in two PDB files \n");
fprintf(stderr," shift_tol: minimal shift to be printed\n");
fprintf(stderr," delta_B: minimal difference in B to be printed\n");
fprintf(stderr," (Alternate locations, occupancies and B-factors are printed\n");
fprintf(stderr," only for the first file.)\n");
fprintf(stderr," -s ... prints out sequence\n\n");
/*printf(" -w ... zatim nic - blizke kontakty vod\n");*/
};
void initparam(void) /* Intializes the program parameters */
{
Aparam=Oparam=0;
Bmin=100.00;
Bmax=0.00;
Omin=1.00;
Omax=0.00;
Bav=0.00;
atcount=0;
alternate_first=alternate_last=Occup_first=Occup_last=Zccup_first=Zccup_last=NULL;
Chstring_old[0]='\0';
ResBprev=0;
ResShiftprev=0;
};
void getrecordA() /* Reads a record from the file defined */
{
int i, CONTINUE;
i=0;
CONTINUE=1; /* It's just for case when there is no newline
at the end of file */
while ((!feof(finput1))&&(CONTINUE)){
record [i++]=fgetc(finput1);
if (record[i-1]=='\n') CONTINUE=0;
};
record[i-1]=0;
};
void getrecordB()
{
int i, CONTINUE;
i=0;
CONTINUE=1; /* It's just for case when there is no newline
at the end of file */
while ((!feof(finput2))&&(CONTINUE)){
record2 [i++]=fgetc(finput2);
if (record2[i-1]=='\n') CONTINUE=0;
};
record2[i-1]=0;
/*locator->PDBstring=(char *) malloc(strlen(record2));*/
};
void getatomsA() /*stores an array of atom records */
{
int i;
int Resnum;
double B, U;
char Resstring[4], Bstring[6], Ustring[7];
while (!feof(finput1)) {
getrecordA();
if (((record[0]=='A')&&(record[1]=='T')&&(record[2]=='O')&&(record[3]=='M'))||((record[0]=='H')&&(record[1]=='E')&&(record[2]=='T')&&(record[3]=='A'))) {
if((atomA_array = (ATOMS **)realloc(atomA_array, (atAcount + 1) * sizeof(ATOMS *)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
if((atomA_array[atAcount]=(ATOMS *)malloc(sizeof(ATOMS)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
if((atomA_array[atAcount]->PDBstring=(char *) malloc(strlen(record)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
for (i=0;i<4;++i) Resstring[i]=record[i+22];
Resstring[i]='\0';
Resnum=atof(Resstring);
atomA_array[atAcount]->Resnum=Resnum;
for (i=0;i<6;++i) Bstring[i]=record[i+60]; /* The B factor value is read... */
Bstring[i]='\0';
B=atof(Bstring);
atomA_array[atAcount]->B=B;
for (i=0;i<3;++i) (atomA_array[atAcount]->resname[i])=record[i+17];
atomA_array[atAcount]->resname[i]='\0';
atomA_array[atAcount]->iCode=record[26];
atomA_array[atAcount++]->PDBstring = strdup(record);
}
else if ((record[0]=='A')&&(record[1]=='N')&&(record[2]=='I')&&(record[3]=='S')&&(record[4]=='O')&&(record[5]=='U')) { /* anisotropic ANISOADP */
if((adpA_array = (ANISOADP **)realloc(adpA_array, (adpAcount + 1) * sizeof(ANISOADP *)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
if((adpA_array[adpAcount]=(ANISOADP *)malloc(sizeof(ANISOADP)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
if((adpA_array[adpAcount]->ADPstring=(char *) malloc(strlen(record)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
for (i=0;i<7;++i) Ustring[i]=record[i+28];
Ustring[i]='\0';
U=atof(Ustring);
U=U/10000;
adpA_array[adpAcount]->U11=U;
for (i=0;i<7;++i) Ustring[i]=record[i+35];
U=atof(Ustring);
U=U/10000;
adpA_array[adpAcount]->U22=U;
for (i=0;i<7;++i) Ustring[i]=record[i+42];
U=atof(Ustring);
U=U/10000;
adpA_array[adpAcount]->U33=U;
for (i=0;i<7;++i) Ustring[i]=record[i+49];
U=atof(Ustring);
U=U/10000;
adpA_array[adpAcount]->U12=U;
for (i=0;i<7;++i) Ustring[i]=record[i+56];
U=atof(Ustring);
U=U/10000;
adpA_array[adpAcount]->U13=U;
for (i=0;i<7;++i) Ustring[i]=record[i+63];
U=atof(Ustring);
U=U/10000;
adpA_array[adpAcount]->U23=U;
adpA_array[adpAcount++]->ADPstring = strdup(record);
ANISO=1;
};
};
};
void analyserecord(void) /* Self-explanatory (I think) */
{
int i,k,j,l;
char Bstring[6], Ostring[6]; /* To read the B and occupancy values
from record */
double B, Bcor, O, Ocor; /* To operate with B and occupancy values
as with a number */
int Resnumprev;
B=0, O=0;
char atomname[2];
int Resnumtmp=0;
char iCodetmp='\0'; /* for work wint nonstandard residues and atoms */
char resnametmp[4]={'\0'};
char chaintmp[2];
for (i=0;i<10;i++) {
lowB_array[i].B=500;
highB_array[i].B=-500;
};
for (k=0; k<atAcount; k++) {
if (atomA_array[k]->PDBstring[16]!=' ') { /* The atom has alternate location! */
Aparam++;
locator=(struct inmemtype *) malloc(sizeof(struct inmemtype));
locator->PDBstring=atomA_array[k]->PDBstring;
locator->nextr=NULL;
/* The record is taken to the memory */
if (alternate_first==NULL) {
/*Is this a first "alternate" atom? */
alternate_first=locator;
alternate_last=locator;
}else alternate_last->nextr=locator;
/* If no, then put it at the end
of the list... */
alternate_last=locator;
};
if (Chstring_old[0]!=(atomA_array[k]->PDBstring[21])) { /* new chain? initialization of parameters */
chain_nu++;
chain_array = (BCHAIN **)realloc(chain_array, (chain_nu+1)*sizeof(BCHAIN *));
chain_array[chain_nu]=(BCHAIN *)malloc(sizeof(BCHAIN));
chain_array[chain_nu]->chain[0]=atomA_array[k]->PDBstring[21];
chain_array[chain_nu]->Bmin=100.00;
chain_array[chain_nu]->Bmax=0.00;
chain_array[chain_nu]->Bav=0.00;
chain_array[chain_nu]->atcount=0;
chain_array[chain_nu]->rescount=0;
Chstring_old[0]=atomA_array[k]->PDBstring[21];
Resnumprev=0;
};
B=atomA_array[k]->B; /* ...converted from a string
into a number... */
chain_array[chain_nu]->atcount++;
chain_array[chain_nu]->Bav=chain_array[chain_nu]->Bav+B;
if(chain_array[chain_nu]->Bmin>B) chain_array[chain_nu]->Bmin=B;
if(chain_array[chain_nu]->Bmax<B) chain_array[chain_nu]->Bmax=B;
if((atomA_array[k]->Resnum)!=Resnumprev) {
chain_array[chain_nu]->rescount++;
Resnumprev=atomA_array[k]->Resnum;
}
Bav=Bav+B; /* Sum of B values -- counting of average B */
atcount++;
if (B<Bmin) Bmin=B; /* Is it a new B minimum? */
if (B>Bmax) Bmax=B; /* Or is it a new B maximum? */
for (i=0;i<10;i++) {
if(B < lowB_array[i].B) {
for (j=9; j>i; j--) {
lowB_array[j].B=lowB_array[j-1].B;
strcpy(lowB_array[j].Atiden,lowB_array[j-1].Atiden);
}
lowB_array[i].B=atomA_array[k]->B;
strncpy(lowB_array[i].Atiden,atomA_array[k]->PDBstring,26);
lowB_array[i].Atiden[26]='\0';
break;
};
};
for (i=0;i<10;i++) {
if(B>highB_array[i].B) {
for (j=9; j>i; j--) {
highB_array[j].B=highB_array[j-1].B;
strcpy(highB_array[j].Atiden,highB_array[j-1].Atiden);
}
highB_array[i].B=B;
strncpy(highB_array[i].Atiden,atomA_array[k]->PDBstring,26);
highB_array[i].Atiden[26]='\0';
break;
};
};
for (i=0;i<6;++i) Ostring[i]=atomA_array[k]->PDBstring[i+54];
/* The occupancy value is read... */
Ostring[i]='\0';
O=atof(Ostring); /* ...converted from a string
into a number... */
if (O<Omin) Omin=O; /* Is it a new occupancy minimum? */
if (O>Omax) Omax=O; /* Or is it a new occupancy maximum? */
if ((O!=0.0)&&(O!=1.0)){ /* When a occupancy value differs from
0.00 and 1.00... */
Oparam++;
locator=(struct inmemtype *) malloc(sizeof(struct inmemtype));
locator->PDBstring=atomA_array[k]->PDBstring;
/* ...put the record to the memory
(in the same way as with "alternate"
records ;-) */
locator->nextr=NULL;
if (Occup_first==NULL) {
Occup_first=locator;
Occup_last=locator;
}else Occup_last->nextr=locator;
Occup_last=locator;
};
if ((O<=0.1)){ /* When a occupancy value is .le. 0.1 */
locator=(struct inmemtype *) malloc(sizeof(struct inmemtype));
locator->PDBstring=atomA_array[k]->PDBstring;
/* ...put the record to the memory
(in the same way as with "alternate"
records ;-) */
locator->nextr=NULL;
if (Zccup_first==NULL) {
Zccup_first=locator;
Zccup_last=locator;
}else Zccup_last->nextr=locator;
Zccup_last=locator;
};
if ((atomA_array[k]->PDBstring[13]=='O')&&(atomA_array[k]->PDBstring[17]=='H')&&(atomA_array[k]->PDBstring[18]=='O')&&(atomA_array[k]->PDBstring[19]=='H')) {
watercount++; /*number of water molecules */
}
if((((atomA_array[k]->Resnum)!=Resnumtmp)||((atomA_array[k]->iCode)!=iCodetmp))||(strcmp((atomA_array[k]->resname),resnametmp)!=0)) { /*new residue */
Atomcount=0;
strncpy(resnametmp,(atomA_array[k]->resname),4);
iCodetmp=(atomA_array[k]->iCode);
Resnumtmp=(atomA_array[k]->Resnum);
chaintmp[0]=(atomA_array[k]->PDBstring[21]);
chaintmp[1]='\0';
if ((strcmp(resnametmp,"GLY")!=0)&& /*is it a non-standard residue?*/
(strcmp(resnametmp,"ALA")!=0)&&
(strcmp(resnametmp,"VAL")!=0)&&
(strcmp(resnametmp,"LEU")!=0)&&
(strcmp(resnametmp,"ILE")!=0)&&
(strcmp(resnametmp,"SER")!=0)&&
(strcmp(resnametmp,"TYR")!=0)&&
(strcmp(resnametmp,"THR")!=0)&&
(strcmp(resnametmp,"PHE")!=0)&&
(strcmp(resnametmp,"TRP")!=0)&&
(strcmp(resnametmp,"HIS")!=0)&&
(strcmp(resnametmp,"LYS")!=0)&&
(strcmp(resnametmp,"ARG")!=0)&&
(strcmp(resnametmp,"GLN")!=0)&&
(strcmp(resnametmp,"GLU")!=0)&&
(strcmp(resnametmp,"ASN")!=0)&&
(strcmp(resnametmp,"ASP")!=0)&&
(strcmp(resnametmp,"PRO")!=0)&&
(strcmp(resnametmp,"CYS")!=0)&&
(strcmp(resnametmp,"MET")!=0)&&
(strcmp(resnametmp,"HOH")!=0)) {
nonstd_nu++;
if((nonstd_array = (NONSTD **)realloc(nonstd_array, (nonstd_nu+1)*sizeof(NONSTD *)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
if((nonstd_array[nonstd_nu]=(NONSTD *)malloc(sizeof(NONSTD)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
strncpy((nonstd_array[nonstd_nu]->resname),resnametmp,strlen(resnametmp)+1); /*store a non-standard residue*/
nonstd_array[nonstd_nu]->resname[3]='\0';
nonstd_array[nonstd_nu]->Resnum=atomA_array[k]->Resnum;
nonstd_array[nonstd_nu]->chain=(atomA_array[k]->PDBstring[21]);
nonstd_array[nonstd_nu]->checked=0;
for(l=k;l<atAcount;l++) {
if((Resnumtmp==(atomA_array[l]->Resnum))&&(iCodetmp==(atomA_array[l]->iCode))&&(strncmp(resnametmp,(atomA_array[l]->resname),3)==0)&&(atomA_array[l]->PDBstring[21]==chaintmp[0])) {
for (i=0;i<2;i++) atomname[i]=(atomA_array[l]->PDBstring[i+76]);
atomname[i]='\0';
if (strcmp(atomname," H")!=0) { /*counting of non-H atoms in a nonstandard residue*/
Atomcount++;
}
if ((strcmp(atomname," C")!=0)&& /*is it a nonstandard atom?*/
(strcmp(atomname," H")!=0)&&
(strcmp(atomname," N")!=0)&&
(strcmp(atomname," O")!=0)&&
(strcmp(atomname," S")!=0)) {
nonconsh_nu++;
if((nonconsh_array = (NONCONSH **)realloc(nonconsh_array, (nonconsh_nu+1)*sizeof(NONCONSH *)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
if((nonconsh_array[nonconsh_nu]=(NONCONSH *)malloc(sizeof(NONCONSH)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
strncpy((nonconsh_array[nonconsh_nu]->resname),resnametmp,strlen(resnametmp)+1); /*store nonstandard atoms*/
strncpy(nonconsh_array[nonconsh_nu]->atom,atomname,strlen(atomname)+1);
nonconsh_array[nonconsh_nu]->atom[2]='\0';
nonconsh_array[nonconsh_nu]->resname[3]='\0';
nonconsh_array[nonconsh_nu]->checked=0;
}
}
nonstd_array[nonstd_nu]->Atomcount=Atomcount;
}
}
}
};
};
void analyseU(void)
{
int print=1;
double e1=100;
double e2=100;
double e3=100;
double m, c1, c0;
double U11,U22,U33,U12,U23,U13;
int k;
for (k=0; k<adpAcount; k++) {
U11=adpA_array[k]->U11;
U22=adpA_array[k]->U22;
U33=adpA_array[k]->U33;
U12=adpA_array[k]->U12;
U13=adpA_array[k]->U13;
U23=adpA_array[k]->U23;
// Determine coefficients of characteristic poynomial. We write
// | a d f | U11 U12 U13
// A = | d* b e | U12 U22 U23
// | f* e* c | U13 U23 U33
double de = U12*U23; // d * e
double dd = SQR(U12); // d^2
double ee = SQR(U23); // e^2
double ff = SQR(U13); // f^2
m = U11 + U22 + U33;
c1 = (U11*U22 + U11*U33 + U22*U33) // a*b + a*c + b*c - d^2 - e^2 - f^2
- (dd + ee + ff);
c0 = U33*dd + U11*ee + U22*ff - U11*U22*U33
- 2.0 * U13*de; // c*d^2 + a*e^2 + b*f^2 - a*b*c - 2*f*d*e)
double p, sqrt_p, q, c, s, phi;
p = SQR(m) - 3.0*c1;
q = m*(p - (3.0/2.0)*c1) - (27.0/2.0)*c0;
sqrt_p = sqrt(fabs(p));
phi = 27.0 * ( 0.25*SQR(c1)*(p - c1) + c0*(q + 27.0/4.0*c0));
phi = (1.0/3.0) * atan2(sqrt(fabs(phi)), q);
c = sqrt_p*cos(phi);
s = (1.0/M_SQRT3)*sqrt_p*sin(phi);
e2 = (1.0/3.0)*(m - c);
e3 = e2 + s;
e1 = e2 + c;
e2 -= s;
if(((e1<=0)||(e2<=0)||(e3<=0))&&print==1) {
printf("\n Warning: ADP non positive definite! e1 e2 e3");
print=0;
};
if((e1<=0)||(e2<=0)||(e3<=0)) {
printf("\n %s %6.3f %6.3f %6.3f",adpA_array[k]->ADPstring, e1, e2, e3);
};
};
};
void analysechanges(void) /*analyse changes during the refinement*/
{
double x1,x2,y1,y2,z1,z2,dx,dy,dz,dd,dB,B2,O1;
char Coorstring[9], Bstring[7], Ostring[7], Chstring[1];
int Resnum2;
char Resstring[5];
int i, k, j, differ=1;
if (((record2[0]=='A')&&(record2[1]=='T')&&(record2[2]=='O')&&(record2[3]=='M'))||((record2[0]=='H')&&(record2[1]=='E')&&(record2[2]=='T')&&(record2[3]=='A'))) {
for (i=0;i<4;++i) Resstring[i]=record2[i+22];
Resstring[i]='\0';
Resnum2=atof(Resstring);
for (k=0;k<atAcount;k++) {
if ((atomA_array[k]->Resnum)==Resnum2) {
for (i=0;i<10;++i) atomA[i]=atomA_array[k]->PDBstring[i+12];
atomA[i]='\0';
for (i=0;i<10;++i) atomB[i]=record2[i+12];
atomB[i]='\0';
differ=strncmp(atomB,atomA,10);
if (differ==0) {
for (i=0;i<6;++i) Bstring[i]=record2[i+60]; /* The B factor value is read... */
Bstring[i]='\0';
B2=atof(Bstring);
for (i=0;i<8;++i) Coorstring[i]=atomA_array[k]->PDBstring[i+30]; /*x*/
Coorstring[i]='\0';
x1=atof(Coorstring);
for (i=0;i<8;++i) Coorstring[i]=record2[i+30];
Coorstring[i]='\0';
x2=atof(Coorstring);
for (i=0;i<8;++i) Coorstring[i]=atomA_array[k]->PDBstring[i+38]; /*y*/
Coorstring[i]='\0';
y1=atof(Coorstring);
for (i=0;i<8;++i) Coorstring[i]=record2[i+38];
Coorstring[i]='\0';
y2=atof(Coorstring);
for (i=0;i<8;++i) Coorstring[i]=atomA_array[k]->PDBstring[i+46]; /*z*/
Coorstring[i]='\0';
z1=atof(Coorstring);
for (i=0;i<8;++i) Coorstring[i]=record2[i+46];
Coorstring[i]='\0';
z2=atof(Coorstring);
for (i=0;i<6;++i) Ostring[i]=atomA_array[k]->PDBstring[i+54];
/* The occupancy value is read... */
Ostring[i]='\0';
O1=atof(Ostring); /* ...converted from a string
into a number... */
dx=x1-x2;
dy=y1-y2;
dz=z1-z2;
dd=sqrt(dx*dx+dy*dy+dz*dz);
dB=(atomA_array[k]->B)-B2;
break;
}; /*differ*/
} /*resnum1=resnum2*/
} /* for pres pole */
if (dd>told) { /*is the shift larger than the set cutoff?*/
shiftat_nu++;
if((shiftat_array = (CHANGEAT **)realloc(shiftat_array, (shiftat_nu+1)*sizeof(CHANGEAT *)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
if((shiftat_array[shiftat_nu]=(CHANGEAT *)malloc(sizeof(CHANGEAT)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
strncpy(shiftat_array[shiftat_nu]->Atiden,atomA_array[k]->PDBstring,26); /*store shifted atoms for futher use*/
shiftat_array[shiftat_nu]->Atiden[26]='\0';
shiftat_array[shiftat_nu]->dd=dd;
shiftat_array[shiftat_nu]->dx=dx;
shiftat_array[shiftat_nu]->dy=dy;
shiftat_array[shiftat_nu]->dz=dz;
shiftat_array[shiftat_nu]->dB=dB;
shiftat_array[shiftat_nu]->B=atomA_array[k]->B;
shiftat_array[shiftat_nu]->O=O1;
Chstring[0]=atomA_array[k]->PDBstring[21];
if (dd>(5*told)) {
strcpy(shiftat_array[shiftat_nu]->warning,WARN5);
}
else if (dd>(4*told)) {
strcpy(shiftat_array[shiftat_nu]->warning,WARN4);
}
else if (dd>(3*told)) {
strcpy(shiftat_array[shiftat_nu]->warning,WARN3);
}
else if (dd>(2*told)) {
strcpy(shiftat_array[shiftat_nu]->warning,WARN2);
}
else {
strcpy(shiftat_array[shiftat_nu]->warning,WARN1);
}
if(ResShiftprev!=Resnum2) { /* printing a PDB containing shifted atoms */
for (j=0;j<atAcount;j++) {
if((Resnum2==(atomA_array[j]->Resnum))&&(Chstring[0]==(atomA_array[j]->PDBstring[21]))) {
fprintf(f_shiftoutput ,"%s \n",(atomA_array[j]->PDBstring));
}
}
ResShiftprev=Resnum2;
}
}
if ((fabs(dB))>tolb) { /* B change larger than the set cutoff */
difB_nu++;
if((difB_array = (CHANGEAT**)realloc(difB_array, (difB_nu+1)*sizeof(CHANGEAT*)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
if((difB_array[difB_nu]=(CHANGEAT*)malloc(sizeof(CHANGEAT)))==NULL){
fprintf(stderr,"Could not allocate memory\n");
return;
}
strncpy(difB_array[difB_nu]->Atiden,atomA_array[k]->PDBstring,26); /*store B changes*/
difB_array[difB_nu]->Atiden[26]='\0';
difB_array[difB_nu]->dB=dB;
difB_array[difB_nu]->dd=dd;
difB_array[difB_nu]->dx=dx;
difB_array[difB_nu]->dy=dy;
difB_array[difB_nu]->dz=dz;
difB_array[difB_nu]->B=atomA_array[k]->B;
difB_array[difB_nu]->O=O1;
Chstring[0]=atomA_array[k]->PDBstring[21];
if (fabs(dB)>(5*tolb)) {
strcpy(difB_array[difB_nu]->warning,WARN5);
}
else if ((fabs(dB))>(4*tolb)) {
strcpy(difB_array[difB_nu]->warning,WARN4);
}
else if ((fabs(dB))>(3*tolb)) {
strcpy(difB_array[difB_nu]->warning,WARN3);
}
else if ((fabs(dB))>(2*tolb)) {
strcpy(difB_array[difB_nu]->warning,WARN2);
}
else {
strcpy(difB_array[difB_nu]->warning,WARN1);
}
if(ResBprev!=Resnum2) { /* printing a PDB containing atoms with dB>tolb */
for (j=0;j<atAcount;j++) {
if((Resnum2==(atomA_array[j]->Resnum))&&(Chstring[0]==(atomA_array[j]->PDBstring[21]))) {
fprintf(f_Boutput ,"%s \n",(atomA_array[j]->PDBstring));
}
}
ResBprev=Resnum2;
}
}
if ((dd>told)&&((fabs(dB))>tolb)) { /* both shift & B */
difAl_nu++;
if((difAl_array = (CHANGEAT **)realloc(difAl_array, (difAl_nu+1)*sizeof(CHANGEAT *)))==NULL) {
fprintf(stderr,"Could not allocate memory\n");
return;
}
if((difAl_array[difAl_nu]=(CHANGEAT *)malloc(sizeof(CHANGEAT)))==NULL) {
fprintf(stderr,"Could not allocate memory\n");
return;
}
strncpy(difAl_array[difAl_nu]->Atiden,atomA_array[k]->PDBstring,26);
difAl_array[difAl_nu]->Atiden[26]='\0';
difAl_array[difAl_nu]->dd=dd;
difAl_array[difAl_nu]->dx=dx;
difAl_array[difAl_nu]->dy=dy;
difAl_array[difAl_nu]->dz=dz;
difAl_array[difAl_nu]->dB=dB;
difAl_array[difAl_nu]->B=atomA_array[k]->B;
difAl_array[difAl_nu]->O=O1;
strcpy(difAl_array[difAl_nu]->warning,WARN1);
}
} /*tady konci ATOM if nebo for k*/
}; /* tady konci funkce */
void sequenceanalysis(void)
{
char resname[4];
char iCodetmp='\n';
int k,i;
int Resnumtmp=0;
char Chaintmp='\0';
for(k=0;k<atAcount;k++) {
if(atomA_array[k]->PDBstring[0]=='A') {
if ((Resnumtmp!=atomA_array[k]->Resnum)||(iCodetmp!=atomA_array[k]->iCode)) {
strncpy(resname,(atomA_array[k]->resname),4);
Resnumtmp=(atomA_array[k]->Resnum);
iCodetmp=(atomA_array[k]->iCode);
if(Chaintmp!=atomA_array[k]->PDBstring[21]) { /*new chain*/
i=1;
sequence_nu++;
if((sequence_array = (SEQ **)realloc(sequence_array, (sequence_nu+1)*sizeof(SEQ *)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
if((sequence_array[sequence_nu]=(SEQ *)malloc(sizeof(SEQ)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
if((sequence_array[sequence_nu]->seqstr=(char*)malloc(sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
sequence_array[sequence_nu]->seqstr[0]='\0';
return;
}
(sequence_array[sequence_nu]->chain)=(atomA_array[k]->PDBstring[21]);
Chaintmp=(atomA_array[k]->PDBstring[21]);
} /*tady konci if pres chain */
/*convert to one-letter code */
if (!strncmp(resname, "GLY",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='G';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "ALA",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='A';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "VAL",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='V';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "LEU",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='L';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "ILE",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='I';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "SER",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='S';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "THR",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='T';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "PHE",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='F';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "TYR",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='Y';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "TRP",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='W';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "CYS",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='C';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "MET",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='M';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "PRO",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='P';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "HIS",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='H';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "LYS",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='K';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "ARG",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='R';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "GLU",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='E';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "ASP",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='D';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "GLN",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='Q';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "ASN",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='N';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "PYL",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='O';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
else if (!strncmp(resname, "SEC",3)) {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='U';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}/*else if... other residues? SEM HYP?*/
else if (!strncmp(resname, "HOH",3)) {
sequence_array[sequence_nu]->seqstr[i-1]='\0';
sequence_array[sequence_nu]->seqstr[i]='\0';
sequence_array[sequence_nu]->chain_size=i;
}
else {
if(((sequence_array[sequence_nu]->seqstr) = (char *)realloc((sequence_array[sequence_nu]->seqstr), (i+1)*sizeof(char)))==NULL) {
fprintf(stderr,"Could not allocate memory\n" );
return;
}
sequence_array[sequence_nu]->chain_size=i;
sequence_array[sequence_nu]->seqstr[i-1]='Z';
sequence_array[sequence_nu]->seqstr[i]='\0';
i++;
}
} /*konec if - new residue */
} /* konec if ATOM */
} /*tady konci for pres pole*/
} /*tady konci funkce */
void printresult(void) /* Self-explanatory */
{
int i,j,m,l;
int Resnum, Resnumprev; /* Current and previous residue
number indicator */
char Resstring[4], /* To get residue number... */
Confprev; /* Conformation of the previous atom
of the same residue */
int Nres, Nat; /*numer of atoms in a nonstandard residue, number of nonstandard atoms*/
Bav=Bav/atcount;
printf("\n Results:\n");
printf("\n Number of residues:\n");
for(i=0; i <=chain_nu; i++) {
printf("\n Chain %c ", chain_array[i]->chain[0]);
printf(" %d ", chain_array[i]->rescount);
};
printf("\n Number of waters: %d \n", watercount );
printf("\n\n Nonstandard residues:");
for (i=0; i<=nonstd_nu; i++) {
if(nonstd_array[i]->checked!=1) { /*new nonstandard residue?*/
Nres=1;
for(j=(i+1);j<=nonstd_nu; j++) {
if(strcmp((nonstd_array[i]->resname),(nonstd_array[j]->resname))==0) { /* are there more residues with the same name*/
nonstd_array[j]->checked=1;
Nres++;
}
}
printf("\n\n%3d x %s: ",Nres,(nonstd_array[i]->resname) );
for (j=i; j<=nonstd_nu;j++) {
if(strcmp((nonstd_array[i]->resname),(nonstd_array[j]->resname))==0) {
printf("%c%d ",(nonstd_array[j]->chain),(nonstd_array[j]->Resnum) );
}
}
printf("\n %d non-H atom(s) |", (nonstd_array[i]->Atomcount) );
for (l=0;l<=nonconsh_nu;++l) { /*nonstandard atoms in the current residue*/
if ((strcmp((nonstd_array[i]->resname),(nonconsh_array[l]->resname))==0)&&((nonconsh_array[l]->checked)!=1)) {
Nat=0;
for(m=l; m<=nonconsh_nu;m++) {
if((strcmp((nonconsh_array[l]->atom),(nonconsh_array[m]->atom))==0)&&(strcmp((nonconsh_array[l]->resname),(nonconsh_array[m]->resname))==0)) {
Nat++;
nonconsh_array[m]->checked=1;
}
}
Nat=Nat/Nres;
printf(" %d x %s |",Nat, nonconsh_array[l]->atom );
}
}
}
}
printf("\n");
printf("\n\n Number of atoms with alternate location: %4ld\n", Aparam);
char Aistring[7];
double Ai=0;
double Aisum=0;
char Atomid[5];
char Atomidprev[5];
strcpy(Atomidprev, "1234");
Resnumprev=0; Confprev=' ';
locator=alternate_first;
while (locator!=NULL){
for (i=0;i<4;i++) Resstring[i]=locator->PDBstring[i+22];
Resnum=atoi(Resstring);
if (Resnum!=Resnumprev) { /* Is it new residue? */
if(Aisum>1)printf(" (** sum %4.2f! **) ",Aisum);
printf("\n ");
for (i=0;i<9;i++) printf("%c",locator->PDBstring[i+17]);
printf(": ");
Confprev=' ';
Aisum=0;
};
for (i=0;i<4;i++) Atomid[i]=locator->PDBstring[i+12]; /* Is it a new atom? */
if (strcmp(Atomid,Atomidprev)!=0) {
if(Aisum>1)printf(" (** sum %4.2f **) ",Aisum);
Confprev=' ';
Aisum=0;
strcpy(Atomidprev, Atomid);
};
if (Confprev!=locator->PDBstring[16]) {
/* Is it a new alternate location? */
if (Resnum==Resnumprev) printf(", ");
printf("%c/",locator->PDBstring[16]);
for(i=0;i<6;i++) printf("%c", locator->PDBstring[i+54]);
for (i=0;i<6;i++) Aistring[i]=locator->PDBstring[i+54];
Ai=atof(Aistring);
Aisum=Aisum+Ai;
};
Confprev=locator->PDBstring[16];
Resnumprev=Resnum;
locator=locator->nextr;
};
printf("\n\n All ATOMs:\n");
printf(" Minimum B: %6.2f\n", Bmin);
printf(" Maximum B: %6.2f\n", Bmax);
printf(" Average B: %6.2f\n",Bav);
for(i=0; i <=chain_nu; i++) {
chain_array[i]->Bav=(chain_array[i]->Bav)/(chain_array[i]->atcount);
printf("\n Chain %c ", chain_array[i]->chain[0]);
printf(" Bmin: %6.2f ", chain_array[i]->Bmin);
printf(" Bmax: %6.2f ", chain_array[i]->Bmax);
printf(" Bave: %6.2f ", chain_array[i]->Bav);
};
printf("\n\n Minimum occupancy: %6.2f\n", Omin);
printf(" Maximum occupancy: %6.2f\n", Omax);
printf("\n Number of atoms with occupancy");
printf(" differing from 0.00 and 1.00: %4ld\n\n", Oparam);
printf("\n Atoms with occupancy close to 0:\n\n");
locator=Zccup_first;
while (locator!=NULL){
printf("%s\n",locator->PDBstring);
locator=locator->nextr;
}
printf("\n Atoms with the lowest B factors: \n\n");
for (i=0;i<10;i++) {
printf(" %s %6.2f \n",lowB_array[i].Atiden,lowB_array[i].B );
};
printf("\n Atoms with the highest B factors: \n\n");
for (i=0;i<10;i++) {
printf(" %s %6.2f \n",highB_array[i].Atiden,highB_array[i].B );
};
if (LONGLIST) {
int NEGATIVE=0;
printf("\n Atoms with occupancy differing from 0.00 and 1.00 \n\n");
locator=Occup_first;
while (locator!=NULL){
printf(" %s \n",locator->PDBstring);
locator=locator->nextr;
};
locator=Occup_first;
while (locator!=NULL){
for (i=0;i<6;i++) Aistring[i]=locator->PDBstring[i+54];
Ai=atof(Aistring);
if(Ai<0){
if(!NEGATIVE){
printf("\n Atoms with negative occupancy \n\n");
NEGATIVE=1;
}
printf(" %s \n",locator->PDBstring);
}
locator=locator->nextr;
};
};
if(DIFFER) {
printf("\n\n Atoms shifted by more than %4.2f A\n",told);
printf("\n shift delta_x delta_y delta_z delta_B final B occupancy");
printf("\n =======");
for(i=0; i <=shiftat_nu; i++) {
printf("\n %s ", shiftat_array[i]->Atiden);
printf("%s", shiftat_array[i]->warning);
printf(" %7.3f ", shiftat_array[i]->dd);
printf(" %7.3f ", shiftat_array[i]->dx);
printf(" %7.3f ", shiftat_array[i]->dy);
printf(" %7.3f ", shiftat_array[i]->dz);
printf(" %7.2f ", shiftat_array[i]->dB);
printf(" %7.2f ", shiftat_array[i]->B);
printf(" %7.2f ", shiftat_array[i]->O);
};
printf("\n\n\n Atoms differing in B by more than %4.2f A^2\n",tolb);
printf("\n delta_B final B shift occupancy");
printf("\n =======");
for(i=0; i <=difB_nu; i++) {
printf("\n %s ",difB_array[i]->Atiden);
printf("%s", difB_array[i]->warning);
printf(" %6.2f ", difB_array[i]->dB);
printf(" %6.2f ", difB_array[i]->B);
printf(" %7.3f ", difB_array[i]->dd);
printf(" %6.2f ", difB_array[i]->O);
};
printf("\n\n\n Atoms appearing both in shift and B tables");
printf("\n shift delta_x delta_y delta_z delta_B final B occupancy");
for(i=0; i <=difAl_nu; i++) {
printf("\n %s ",difAl_array[i]->Atiden);
/* printf("%s", difAl_array[i]->warning); */
printf(" %7.3f ", difAl_array[i]->dd);
printf(" %7.3f ", difAl_array[i]->dx);
printf(" %7.3f ", difAl_array[i]->dy);
printf(" %7.3f ", difAl_array[i]->dz);
printf(" %6.2f ", difAl_array[i]->dB);
printf(" %6.2f ", difAl_array[i]->B);
printf(" %6.2f ", difAl_array[i]->O);
};
printf("\n\n Atoms with position or B change higher than tolerance value were printed into following files:\n shifted_atoms.pdb\n B_atoms.pdb\n");
};
if (SEQUENCE) {
printf("\n Sequence:");
for(i = 0; i<=sequence_nu; i++) {
if ((sequence_array[i]->chain_size>0)&&(sequence_array[i]->seqstr[0]!='\0'))
{
printf("\n\n>%s chain %c ",fname1,sequence_array[i]->chain);
fprintf(fasta,"\n>%s chain %c ",fname1,sequence_array[i]->chain);
for(j=0; j<sequence_array[i]->chain_size;j++) {
if((j+1)%60==1) {
printf("\n ");
fprintf(fasta,"\n ");
}
else if((j+1)%10==1) {
printf(" ");
fprintf(fasta," ");
}
printf("%c", sequence_array[i]->seqstr[j] );
fprintf(fasta,"%c", sequence_array[i]->seqstr[j] );
}
}
}
printf("\n Sequence was printed to the pdb.fasta file \n");
}
};
void releasememory(void) /*Selfexplanatory*/
{
int i=0;
while (alternate_first!=NULL){ /*Releasing an "alternate" list */
locator=alternate_first->nextr;
free(alternate_first->PDBstring);
free(alternate_first);
alternate_first=locator;
};
while (Occup_first!=NULL){ /*Releasing a "B=50.00" list */
locator=Occup_first->nextr;
/*free(Occup_first->PDBstring);*/
free(Occup_first);
Occup_first=locator;
};
while (Zccup_first!=NULL){ /*Releasing a "zero occupancy" list */
locator=Zccup_first->nextr;
/* free(Zccup_first->PDBstring);*/
free(Zccup_first);
Zccup_first=locator;
};
for(i=0; i<=chain_nu; i++) free(chain_array[i]);
free(chain_array);
for(i = 0; i <atAcount; i++) {
/*free(atomA_array[i]->PDBstring);*/
free(atomA_array[i]);
}
free(atomA_array);
for(i = 0; i <adpAcount; i++) {
free(adpA_array[i]);
}
free(adpA_array);
for(i=0; i<=nonstd_nu; i++) free(nonstd_array[i]);
free(nonstd_array);
for(i=0; i<=nonconsh_nu; i++) free(nonconsh_array[i]);
free(nonconsh_array);
if(DIFFER) {
for(i=0; i<=shiftat_nu; i++) free(shiftat_array[i]);
free(shiftat_array);
for(i=0; i<=difB_nu;i++) free(difB_array[i]);
free(difB_array);
for(i=0; i<=difAl_nu;i++) free(difAl_array[i]);
free(difAl_array);
}
if(SEQUENCE){
for(i = 0; i <=sequence_nu; i++) {
free(sequence_array[i]->seqstr);
free(sequence_array[i]);
}
free(sequence_array);
}
};
int main(int argc, char *argv[]) /*Main routine*/
{
char opt; /* options z prikazove radky */
int argi;
argi=argc;
char *comm;
comm=argv[0];
/* prepinace -i -v -h -e*/
while ((--argi > 0 ) && ((*++argv)[0] == '-')) {
while ((opt = *++argv[0])) {
switch (opt) {
case 'l':
LONGLIST=1;
break;
case 's':
SEQUENCE=1;
break;
case 'd':
DIFFER=1;
break;
/* case 'w':
WATER_CONTACTS=1;
break; */
default :
fprintf(stderr,"Illegal option %c\n",opt);
printhelp(comm);
exit(1);
};
};
};
if (argi == 0) {
fprintf(stderr,"Please specify a pdb file.\n");
printhelp(comm);
exit(1);
};
fname1=*argv++;
argi--;
if ((finput1 = fopen(fname1,"r")) == NULL) {
fprintf(stderr,"Can\'t open %s\n",fname1);
exit(1);
};
if (DIFFER) {
if (argi == 0) {
fprintf(stderr,"Please specify a second pdb file.\n");
printhelp(comm);
fclose(finput1);
exit(1);
};
fname2=*argv++;
argi--;
if ((finput2 = fopen(fname2,"r")) == NULL) {
fprintf(stderr,"Can\'t open %s\n",fname2);
exit(1);
};
if (argi>0){
argi--;
told=atof(*argv++);
}
else told=TOL_D;
if(argi>0){
argi--;
tolb=atof(*argv);
argv++;
}
else tolb=TOL_B;
}
initparam();
printf("\n *** %s - 2015/08/17 very unstable version *** \n",comm);
printf("\n File name:\t*** %s ***",fname1);
if(DIFFER) {
printf("\t(%s)",fname2);
}
printf("\n\n");
getatomsA();
analyserecord();
if (DIFFER) {
f_shiftoutput = fopen("shifted_atoms.pdb","w");
f_Boutput = fopen("B_atoms.pdb","w");
while (!feof(finput2)) {
getrecordB();
analysechanges();
}
}
if (SEQUENCE) {
fasta = fopen("pdb.fasta","w");
sequenceanalysis();
}
printresult();
if (ANISO==1) analyseU();
releasememory();
fclose(finput1);
if (DIFFER) {
fclose(finput2);
fclose(f_shiftoutput);
fclose(f_Boutput);
};
if(SEQUENCE) {
fclose(fasta);
}
printf("\n");
exit(0);
};
|
the_stack_data/192138.c | #include <stdio.h>
#include <stdlib.h>
#include<string.h>
int main() {
/*
* Using XOR operations on the two input values
* Opposite binary numbers gives 1, else 0
*
*/
int val1, val2;
printf("Enter the first integer value: ");
scanf("%d", &val1);
printf("Enter the second integer value: ");
scanf("%d", &val2);
val1 = val1 ^ val2;
val2 = val1 ^ val2;
val1 = val1 ^ val2;
printf("Value of first swapped integer %d \n", val1);
printf("Value of second swapped integer %d \n", val2);
return 0;
}
|
the_stack_data/4406.c | // colddays.c -- finds percentage of days below freezing
#include <stdio.h>
int main(){
const int FREEZING = 0;
float temperature;
int cold_days = 0;
int all_days = 0;
printf("Enter the list of daily low temperatures.\n");
printf("Use Celsius, and enter q to quit.\n");
while(scanf("%f", &temperature) == 1){
all_days++;
if (temperature < FREEZING)
cold_days++;
}
if (all_days != 0)
printf("%d days total: %.1f%% were below freezing.\n", all_days, 100.0 * (float) cold_days / all_days);
if (all_days == 0)
printf("No data entered!\n");
return 0;
}
|
the_stack_data/6386956.c | #include <math.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <complex.h>
#ifdef complex
#undef complex
#endif
#ifdef I
#undef I
#endif
#if defined(_WIN64)
typedef long long BLASLONG;
typedef unsigned long long BLASULONG;
#else
typedef long BLASLONG;
typedef unsigned long BLASULONG;
#endif
#ifdef LAPACK_ILP64
typedef BLASLONG blasint;
#if defined(_WIN64)
#define blasabs(x) llabs(x)
#else
#define blasabs(x) labs(x)
#endif
#else
typedef int blasint;
#define blasabs(x) abs(x)
#endif
typedef blasint integer;
typedef unsigned int uinteger;
typedef char *address;
typedef short int shortint;
typedef float real;
typedef double doublereal;
typedef struct { real r, i; } complex;
typedef struct { doublereal r, i; } doublecomplex;
#ifdef _MSC_VER
static inline _Fcomplex Cf(complex *z) {_Fcomplex zz={z->r , z->i}; return zz;}
static inline _Dcomplex Cd(doublecomplex *z) {_Dcomplex zz={z->r , z->i};return zz;}
static inline _Fcomplex * _pCf(complex *z) {return (_Fcomplex*)z;}
static inline _Dcomplex * _pCd(doublecomplex *z) {return (_Dcomplex*)z;}
#else
static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}
static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}
static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}
static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}
#endif
#define pCf(z) (*_pCf(z))
#define pCd(z) (*_pCd(z))
typedef int logical;
typedef short int shortlogical;
typedef char logical1;
typedef char integer1;
#define TRUE_ (1)
#define FALSE_ (0)
/* Extern is for use with -E */
#ifndef Extern
#define Extern extern
#endif
/* I/O stuff */
typedef int flag;
typedef int ftnlen;
typedef int ftnint;
/*external read, write*/
typedef struct
{ flag cierr;
ftnint ciunit;
flag ciend;
char *cifmt;
ftnint cirec;
} cilist;
/*internal read, write*/
typedef struct
{ flag icierr;
char *iciunit;
flag iciend;
char *icifmt;
ftnint icirlen;
ftnint icirnum;
} icilist;
/*open*/
typedef struct
{ flag oerr;
ftnint ounit;
char *ofnm;
ftnlen ofnmlen;
char *osta;
char *oacc;
char *ofm;
ftnint orl;
char *oblnk;
} olist;
/*close*/
typedef struct
{ flag cerr;
ftnint cunit;
char *csta;
} cllist;
/*rewind, backspace, endfile*/
typedef struct
{ flag aerr;
ftnint aunit;
} alist;
/* inquire */
typedef struct
{ flag inerr;
ftnint inunit;
char *infile;
ftnlen infilen;
ftnint *inex; /*parameters in standard's order*/
ftnint *inopen;
ftnint *innum;
ftnint *innamed;
char *inname;
ftnlen innamlen;
char *inacc;
ftnlen inacclen;
char *inseq;
ftnlen inseqlen;
char *indir;
ftnlen indirlen;
char *infmt;
ftnlen infmtlen;
char *inform;
ftnint informlen;
char *inunf;
ftnlen inunflen;
ftnint *inrecl;
ftnint *innrec;
char *inblank;
ftnlen inblanklen;
} inlist;
#define VOID void
union Multitype { /* for multiple entry points */
integer1 g;
shortint h;
integer i;
/* longint j; */
real r;
doublereal d;
complex c;
doublecomplex z;
};
typedef union Multitype Multitype;
struct Vardesc { /* for Namelist */
char *name;
char *addr;
ftnlen *dims;
int type;
};
typedef struct Vardesc Vardesc;
struct Namelist {
char *name;
Vardesc **vars;
int nvars;
};
typedef struct Namelist Namelist;
#define abs(x) ((x) >= 0 ? (x) : -(x))
#define dabs(x) (fabs(x))
#define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
#define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
#define dmin(a,b) (f2cmin(a,b))
#define dmax(a,b) (f2cmax(a,b))
#define bit_test(a,b) ((a) >> (b) & 1)
#define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
#define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
#define abort_() { sig_die("Fortran abort routine called", 1); }
#define c_abs(z) (cabsf(Cf(z)))
#define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
#ifdef _MSC_VER
#define c_div(c, a, b) {Cf(c)._Val[0] = (Cf(a)._Val[0]/Cf(b)._Val[0]); Cf(c)._Val[1]=(Cf(a)._Val[1]/Cf(b)._Val[1]);}
#define z_div(c, a, b) {Cd(c)._Val[0] = (Cd(a)._Val[0]/Cd(b)._Val[0]); Cd(c)._Val[1]=(Cd(a)._Val[1]/df(b)._Val[1]);}
#else
#define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
#define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
#endif
#define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
#define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
#define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
//#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
#define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
#define d_abs(x) (fabs(*(x)))
#define d_acos(x) (acos(*(x)))
#define d_asin(x) (asin(*(x)))
#define d_atan(x) (atan(*(x)))
#define d_atn2(x, y) (atan2(*(x),*(y)))
#define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
#define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
#define d_cos(x) (cos(*(x)))
#define d_cosh(x) (cosh(*(x)))
#define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
#define d_exp(x) (exp(*(x)))
#define d_imag(z) (cimag(Cd(z)))
#define r_imag(z) (cimagf(Cf(z)))
#define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#define d_log(x) (log(*(x)))
#define d_mod(x, y) (fmod(*(x), *(y)))
#define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
#define d_nint(x) u_nint(*(x))
#define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
#define d_sign(a,b) u_sign(*(a),*(b))
#define r_sign(a,b) u_sign(*(a),*(b))
#define d_sin(x) (sin(*(x)))
#define d_sinh(x) (sinh(*(x)))
#define d_sqrt(x) (sqrt(*(x)))
#define d_tan(x) (tan(*(x)))
#define d_tanh(x) (tanh(*(x)))
#define i_abs(x) abs(*(x))
#define i_dnnt(x) ((integer)u_nint(*(x)))
#define i_len(s, n) (n)
#define i_nint(x) ((integer)u_nint(*(x)))
#define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
#define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
#define pow_si(B,E) spow_ui(*(B),*(E))
#define pow_ri(B,E) spow_ui(*(B),*(E))
#define pow_di(B,E) dpow_ui(*(B),*(E))
#define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
#define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
#define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
#define s_cat(lpp, rpp, rnp, np, llp) { ftnlen i, nc, ll; char *f__rp, *lp; ll = (llp); lp = (lpp); for(i=0; i < (int)*(np); ++i) { nc = ll; if((rnp)[i] < nc) nc = (rnp)[i]; ll -= nc; f__rp = (rpp)[i]; while(--nc >= 0) *lp++ = *(f__rp)++; } while(--ll >= 0) *lp++ = ' '; }
#define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
#define s_copy(A,B,C,D) { int __i,__m; for (__i=0, __m=f2cmin((C),(D)); __i<__m && (B)[__i] != 0; ++__i) (A)[__i] = (B)[__i]; }
#define sig_die(s, kill) { exit(1); }
#define s_stop(s, n) {exit(0);}
static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";
#define z_abs(z) (cabs(Cd(z)))
#define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
#define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
#define myexit_() break;
#define mycycle() continue;
#define myceiling(w) {ceil(w)}
#define myhuge(w) {HUGE_VAL}
//#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
#define mymaxloc(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}
/* procedure parameter types for -A and -C++ */
#define F2C_proc_par_types 1
#ifdef __cplusplus
typedef logical (*L_fp)(...);
#else
typedef logical (*L_fp)();
#endif
static float spow_ui(float x, integer n) {
float pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static double dpow_ui(double x, integer n) {
double pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#ifdef _MSC_VER
static _Fcomplex cpow_ui(complex x, integer n) {
complex pow={1.0,0.0}; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;
for(u = n; ; ) {
if(u & 01) pow.r *= x.r, pow.i *= x.i;
if(u >>= 1) x.r *= x.r, x.i *= x.i;
else break;
}
}
_Fcomplex p={pow.r, pow.i};
return p;
}
#else
static _Complex float cpow_ui(_Complex float x, integer n) {
_Complex float pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#endif
#ifdef _MSC_VER
static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
_Dcomplex pow={1.0,0.0}; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
for(u = n; ; ) {
if(u & 01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
else break;
}
}
_Dcomplex p = {pow._Val[0], pow._Val[1]};
return p;
}
#else
static _Complex double zpow_ui(_Complex double x, integer n) {
_Complex double pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#endif
static integer pow_ii(integer x, integer n) {
integer pow; unsigned long int u;
if (n <= 0) {
if (n == 0 || x == 1) pow = 1;
else if (x != -1) pow = x == 0 ? 1/x : 0;
else n = -n;
}
if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
u = n;
for(pow = 1; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static integer dmaxloc_(double *w, integer s, integer e, integer *n)
{
double m; integer i, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
return mi-s+1;
}
static integer smaxloc_(float *w, integer s, integer e, integer *n)
{
float m; integer i, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
return mi-s+1;
}
static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Fcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conjf(Cf(&x[i]))._Val[0] * Cf(&y[i])._Val[0];
zdotc._Val[1] += conjf(Cf(&x[i]))._Val[1] * Cf(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conjf(Cf(&x[i*incx]))._Val[0] * Cf(&y[i*incy])._Val[0];
zdotc._Val[1] += conjf(Cf(&x[i*incx]))._Val[1] * Cf(&y[i*incy])._Val[1];
}
}
pCf(z) = zdotc;
}
#else
_Complex float zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
}
}
pCf(z) = zdotc;
}
#endif
static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Dcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conj(Cd(&x[i]))._Val[0] * Cd(&y[i])._Val[0];
zdotc._Val[1] += conj(Cd(&x[i]))._Val[1] * Cd(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conj(Cd(&x[i*incx]))._Val[0] * Cd(&y[i*incy])._Val[0];
zdotc._Val[1] += conj(Cd(&x[i*incx]))._Val[1] * Cd(&y[i*incy])._Val[1];
}
}
pCd(z) = zdotc;
}
#else
_Complex double zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
}
}
pCd(z) = zdotc;
}
#endif
static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Fcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cf(&x[i])._Val[0] * Cf(&y[i])._Val[0];
zdotc._Val[1] += Cf(&x[i])._Val[1] * Cf(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cf(&x[i*incx])._Val[0] * Cf(&y[i*incy])._Val[0];
zdotc._Val[1] += Cf(&x[i*incx])._Val[1] * Cf(&y[i*incy])._Val[1];
}
}
pCf(z) = zdotc;
}
#else
_Complex float zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cf(&x[i]) * Cf(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
}
}
pCf(z) = zdotc;
}
#endif
static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Dcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cd(&x[i])._Val[0] * Cd(&y[i])._Val[0];
zdotc._Val[1] += Cd(&x[i])._Val[1] * Cd(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cd(&x[i*incx])._Val[0] * Cd(&y[i*incy])._Val[0];
zdotc._Val[1] += Cd(&x[i*incx])._Val[1] * Cd(&y[i*incy])._Val[1];
}
}
pCd(z) = zdotc;
}
#else
_Complex double zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cd(&x[i]) * Cd(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
}
}
pCd(z) = zdotc;
}
#endif
/* -- translated by f2c (version 20000121).
You must link the resulting object file with the libraries:
-lf2c -lm (in that order)
*/
/* Table of constant values */
static doublereal c_b9 = 0.;
static doublereal c_b10 = 1.;
static integer c__3 = 3;
static integer c__1 = 1;
/* > \brief \b DLAROR */
/* =========== DOCUMENTATION =========== */
/* Online html documentation available at */
/* http://www.netlib.org/lapack/explore-html/ */
/* Definition: */
/* =========== */
/* SUBROUTINE DLAROR( SIDE, INIT, M, N, A, LDA, ISEED, X, INFO ) */
/* CHARACTER INIT, SIDE */
/* INTEGER INFO, LDA, M, N */
/* INTEGER ISEED( 4 ) */
/* DOUBLE PRECISION A( LDA, * ), X( * ) */
/* > \par Purpose: */
/* ============= */
/* > */
/* > \verbatim */
/* > */
/* > DLAROR pre- or post-multiplies an M by N matrix A by a random */
/* > orthogonal matrix U, overwriting A. A may optionally be initialized */
/* > to the identity matrix before multiplying by U. U is generated using */
/* > the method of G.W. Stewart (SIAM J. Numer. Anal. 17, 1980, 403-409). */
/* > \endverbatim */
/* Arguments: */
/* ========== */
/* > \param[in] SIDE */
/* > \verbatim */
/* > SIDE is CHARACTER*1 */
/* > Specifies whether A is multiplied on the left or right by U. */
/* > = 'L': Multiply A on the left (premultiply) by U */
/* > = 'R': Multiply A on the right (postmultiply) by U' */
/* > = 'C' or 'T': Multiply A on the left by U and the right */
/* > by U' (Here, U' means U-transpose.) */
/* > \endverbatim */
/* > */
/* > \param[in] INIT */
/* > \verbatim */
/* > INIT is CHARACTER*1 */
/* > Specifies whether or not A should be initialized to the */
/* > identity matrix. */
/* > = 'I': Initialize A to (a section of) the identity matrix */
/* > before applying U. */
/* > = 'N': No initialization. Apply U to the input matrix A. */
/* > */
/* > INIT = 'I' may be used to generate square or rectangular */
/* > orthogonal matrices: */
/* > */
/* > For M = N and SIDE = 'L' or 'R', the rows will be orthogonal */
/* > to each other, as will the columns. */
/* > */
/* > If M < N, SIDE = 'R' produces a dense matrix whose rows are */
/* > orthogonal and whose columns are not, while SIDE = 'L' */
/* > produces a matrix whose rows are orthogonal, and whose first */
/* > M columns are orthogonal, and whose remaining columns are */
/* > zero. */
/* > */
/* > If M > N, SIDE = 'L' produces a dense matrix whose columns */
/* > are orthogonal and whose rows are not, while SIDE = 'R' */
/* > produces a matrix whose columns are orthogonal, and whose */
/* > first M rows are orthogonal, and whose remaining rows are */
/* > zero. */
/* > \endverbatim */
/* > */
/* > \param[in] M */
/* > \verbatim */
/* > M is INTEGER */
/* > The number of rows of A. */
/* > \endverbatim */
/* > */
/* > \param[in] N */
/* > \verbatim */
/* > N is INTEGER */
/* > The number of columns of A. */
/* > \endverbatim */
/* > */
/* > \param[in,out] A */
/* > \verbatim */
/* > A is DOUBLE PRECISION array, dimension (LDA, N) */
/* > On entry, the array A. */
/* > On exit, overwritten by U A ( if SIDE = 'L' ), */
/* > or by A U ( if SIDE = 'R' ), */
/* > or by U A U' ( if SIDE = 'C' or 'T'). */
/* > \endverbatim */
/* > */
/* > \param[in] LDA */
/* > \verbatim */
/* > LDA is INTEGER */
/* > The leading dimension of the array A. LDA >= f2cmax(1,M). */
/* > \endverbatim */
/* > */
/* > \param[in,out] ISEED */
/* > \verbatim */
/* > ISEED is INTEGER array, dimension (4) */
/* > On entry ISEED specifies the seed of the random number */
/* > generator. The array elements should be between 0 and 4095; */
/* > if not they will be reduced mod 4096. Also, ISEED(4) must */
/* > be odd. The random number generator uses a linear */
/* > congruential sequence limited to small integers, and so */
/* > should produce machine independent random numbers. The */
/* > values of ISEED are changed on exit, and can be used in the */
/* > next call to DLAROR to continue the same random number */
/* > sequence. */
/* > \endverbatim */
/* > */
/* > \param[out] X */
/* > \verbatim */
/* > X is DOUBLE PRECISION array, dimension (3*MAX( M, N )) */
/* > Workspace of length */
/* > 2*M + N if SIDE = 'L', */
/* > 2*N + M if SIDE = 'R', */
/* > 3*N if SIDE = 'C' or 'T'. */
/* > \endverbatim */
/* > */
/* > \param[out] INFO */
/* > \verbatim */
/* > INFO is INTEGER */
/* > An error flag. It is set to: */
/* > = 0: normal return */
/* > < 0: if INFO = -k, the k-th argument had an illegal value */
/* > = 1: if the random numbers generated by DLARND are bad. */
/* > \endverbatim */
/* Authors: */
/* ======== */
/* > \author Univ. of Tennessee */
/* > \author Univ. of California Berkeley */
/* > \author Univ. of Colorado Denver */
/* > \author NAG Ltd. */
/* > \date December 2016 */
/* > \ingroup double_matgen */
/* ===================================================================== */
/* Subroutine */ int dlaror_(char *side, char *init, integer *m, integer *n,
doublereal *a, integer *lda, integer *iseed, doublereal *x, integer *
info)
{
/* System generated locals */
integer a_dim1, a_offset, i__1, i__2;
doublereal d__1;
/* Local variables */
integer kbeg;
extern /* Subroutine */ int dger_(integer *, integer *, doublereal *,
doublereal *, integer *, doublereal *, integer *, doublereal *,
integer *);
integer jcol, irow;
extern doublereal dnrm2_(integer *, doublereal *, integer *);
integer j;
extern /* Subroutine */ int dscal_(integer *, doublereal *, doublereal *,
integer *);
extern logical lsame_(char *, char *);
extern /* Subroutine */ int dgemv_(char *, integer *, integer *,
doublereal *, doublereal *, integer *, doublereal *, integer *,
doublereal *, doublereal *, integer *);
integer ixfrm, itype, nxfrm;
doublereal xnorm;
extern doublereal dlarnd_(integer *, integer *);
extern /* Subroutine */ int dlaset_(char *, integer *, integer *,
doublereal *, doublereal *, doublereal *, integer *),
xerbla_(char *, integer *);
doublereal factor, xnorms;
/* -- LAPACK auxiliary routine (version 3.7.0) -- */
/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
/* December 2016 */
/* ===================================================================== */
/* Parameter adjustments */
a_dim1 = *lda;
a_offset = 1 + a_dim1 * 1;
a -= a_offset;
--iseed;
--x;
/* Function Body */
*info = 0;
if (*n == 0 || *m == 0) {
return 0;
}
itype = 0;
if (lsame_(side, "L")) {
itype = 1;
} else if (lsame_(side, "R")) {
itype = 2;
} else if (lsame_(side, "C") || lsame_(side, "T")) {
itype = 3;
}
/* Check for argument errors. */
if (itype == 0) {
*info = -1;
} else if (*m < 0) {
*info = -3;
} else if (*n < 0 || itype == 3 && *n != *m) {
*info = -4;
} else if (*lda < *m) {
*info = -6;
}
if (*info != 0) {
i__1 = -(*info);
xerbla_("DLAROR", &i__1);
return 0;
}
if (itype == 1) {
nxfrm = *m;
} else {
nxfrm = *n;
}
/* Initialize A to the identity matrix if desired */
if (lsame_(init, "I")) {
dlaset_("Full", m, n, &c_b9, &c_b10, &a[a_offset], lda);
}
/* If no rotation possible, multiply by random +/-1 */
/* Compute rotation by computing Householder transformations */
/* H(2), H(3), ..., H(nhouse) */
i__1 = nxfrm;
for (j = 1; j <= i__1; ++j) {
x[j] = 0.;
/* L10: */
}
i__1 = nxfrm;
for (ixfrm = 2; ixfrm <= i__1; ++ixfrm) {
kbeg = nxfrm - ixfrm + 1;
/* Generate independent normal( 0, 1 ) random numbers */
i__2 = nxfrm;
for (j = kbeg; j <= i__2; ++j) {
x[j] = dlarnd_(&c__3, &iseed[1]);
/* L20: */
}
/* Generate a Householder transformation from the random vector X */
xnorm = dnrm2_(&ixfrm, &x[kbeg], &c__1);
xnorms = d_sign(&xnorm, &x[kbeg]);
d__1 = -x[kbeg];
x[kbeg + nxfrm] = d_sign(&c_b10, &d__1);
factor = xnorms * (xnorms + x[kbeg]);
if (abs(factor) < 1e-20) {
*info = 1;
xerbla_("DLAROR", info);
return 0;
} else {
factor = 1. / factor;
}
x[kbeg] += xnorms;
/* Apply Householder transformation to A */
if (itype == 1 || itype == 3) {
/* Apply H(k) from the left. */
dgemv_("T", &ixfrm, n, &c_b10, &a[kbeg + a_dim1], lda, &x[kbeg], &
c__1, &c_b9, &x[(nxfrm << 1) + 1], &c__1);
d__1 = -factor;
dger_(&ixfrm, n, &d__1, &x[kbeg], &c__1, &x[(nxfrm << 1) + 1], &
c__1, &a[kbeg + a_dim1], lda);
}
if (itype == 2 || itype == 3) {
/* Apply H(k) from the right. */
dgemv_("N", m, &ixfrm, &c_b10, &a[kbeg * a_dim1 + 1], lda, &x[
kbeg], &c__1, &c_b9, &x[(nxfrm << 1) + 1], &c__1);
d__1 = -factor;
dger_(m, &ixfrm, &d__1, &x[(nxfrm << 1) + 1], &c__1, &x[kbeg], &
c__1, &a[kbeg * a_dim1 + 1], lda);
}
/* L30: */
}
d__1 = dlarnd_(&c__3, &iseed[1]);
x[nxfrm * 2] = d_sign(&c_b10, &d__1);
/* Scale the matrix A by D. */
if (itype == 1 || itype == 3) {
i__1 = *m;
for (irow = 1; irow <= i__1; ++irow) {
dscal_(n, &x[nxfrm + irow], &a[irow + a_dim1], lda);
/* L40: */
}
}
if (itype == 2 || itype == 3) {
i__1 = *n;
for (jcol = 1; jcol <= i__1; ++jcol) {
dscal_(m, &x[nxfrm + jcol], &a[jcol * a_dim1 + 1], &c__1);
/* L50: */
}
}
return 0;
/* End of DLAROR */
} /* dlaror_ */
|
the_stack_data/72013552.c | #include<stdio.h>
void main()
{
int n1,n2,x,y,sum=0;
printf("Enter two integers:\n");
scanf("%d %d",&n1 ,&n2);
while(n1>=1)
{
if(n1%2!=0)
sum=sum+n2;
x=n1/2;
n1=x;
y=n2*2;
n2=y;
}
printf("sum is: %d \n",sum);
}
|
the_stack_data/155338.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
typedef unsigned int uint;
// input: type = {0,1,2,3}, number = {a,2,3,4,5,6,7,8,9,o,j,q,k}
// encode: | 8b type * 100 + number |
uint card(char type, char number) {
type -= 48;
switch(number) {
case 'o':
number = 10; break;
case 'j':
number = 11; break;
case 'q':
number = 12; break;
case 'k':
number = 13; break;
case 'a':
number = 14; break;
default:
number -= 48;
}
return type * 100 + number;
}
int inline typeCount(int type) {
return (type & 0x01)+(type>>1 & 0x01)+(type>>2 & 0x01)+(type>>3 & 0x01);
}
// encode: | 4b number | type 4b |
uint eval(uint* card) {
uint compress[7] = {0,0,0,0,0,0,0};
uint n = 0;
int i, j, k, t, level, diff;
int count_shun[5], prev_shun[5], pos_shun[5], type_same[4], pos_type[4];
// copy
memcpy(compress, card, sizeof(uint)*7);
// sort
for(i=0;i<6;i++) {
k = i;
for(j=i+1;j<7;j++)
if(compress[k]%100 < compress[j]%100) k = j;
j = compress[k]; compress[k] = compress[i]; compress[i] = j;
}
// compress
j=0; k=0; compress[0] = (compress[0]%100) << 4 | (1 << (compress[0]/100));
for(i=1;i<7;i++) {
if((compress[k]>>4) == (compress[i]%100)) {
compress[k] |= 1 << (compress[i] / 100);
} else {
k++; compress[k] = (compress[i]%100) << 4 | (1 << (compress[i]/100));
}
}
for(i=k+1;i<7;i++) compress[i] = 0;
n = k+1;
//for(i=0;i<7;i++) printf("%x ", compress[i]); printf("\n");
// init
memset(count_shun, 0, 5*sizeof(uint));
memset(prev_shun, 0, 5*sizeof(uint));
memset(pos_shun, 0, 5*sizeof(uint));
memset(type_same, 0, 4*sizeof(uint));
memset(pos_type, 0, 4*sizeof(uint));
#define LV(x) ((x) << 20)
#define D5(x) ((x) << 16)
#define D4(x) ((x) << 12)
#define D3(x) ((x) << 8)
#define D2(x) ((x) << 4)
#define D1(x) (x)
// level: 0=1, 1=2, 2=2+2, 3=3, 4=straight, 5=flush, 6=3+2, 7=4, 8=flush+straight
level = 0; diff = 0;
for(i=0;i<n;i++) {
j = compress[i] >> 4; // number
k = compress[i] & 0x0f; // types
// handle with pair, tri, quad
//printf("card=%d, type=0x%x(%d)\n", j, k, typeCount(k));
switch(typeCount(k)) {
case 4:
level = 7;
diff = D5(j);
return LV(level)+diff;
break;
case 3:
if(level == 1) {
level = 6;
diff += D5(j);
return LV(level)+diff;
} else if(level < 3){
level = 3;
diff = D5(j);
}
break;
case 2:
if(level == 3) {
level = 6;
diff += D4(j);
return LV(level)+diff;
} else if(level == 1) {
level = 2;
diff += D3(j);
} else if(level == 0) {
level = 1;
diff += D4(j);
}
break;
case 1:
break;
}
// handle with straight and flush
if(j + 1 == prev_shun[4]) {
count_shun[4] ++;
prev_shun[4] = j;
if(count_shun[4] >= 5 && level < 4) {
level = 4;
diff = D1(compress[pos_shun[4]] >> 4);
} else if(count_shun[4] == 4 && prev_shun[4] == 2 && compress[0] >> 4 == 14) {
// 5 4 3 2 1
level = 4;
diff = D1(compress[pos_shun[4]] >> 4);
}
} else if(count_shun[4] < 5) {
count_shun[4] = 1;
prev_shun[4] = j;
pos_shun[4] = i;
}
for(t=0;t<4;t++) {
if(k & (1 << t)) {
if(j + 1 == prev_shun[t]) {
count_shun[t] ++;
prev_shun[t] = j;
} else if(count_shun[t] < 5) {
count_shun[t] = 1;
prev_shun[t] = j;
pos_shun[t] = i;
}
if(count_shun[t] >= 5) {
level = 8;
diff = D1(compress[pos_shun[t]] >> 4);
return LV(level)+diff;
} else if(count_shun[t] == 4 && prev_shun[t] == 2 && compress[0] >> 4 == 14) {
// 5 4 3 2 1
level = 8;
diff = D1(compress[pos_shun[4]] >> 4);
return LV(level)+diff;
}
type_same[t] ++;
if(pos_type[t] == 0) {
pos_type[t] = j;
} else if(type_same[t] >= 5 && level < 5) {
level = 5;
diff = D1(pos_type[t]);
}
} else {
count_shun[t] = 0;
prev_shun[t] = 0;
pos_shun[t] = 0;
}
}
} // i
switch(level) {
case 3: // 3++
break;
case 2: // 22+
for(i=0;i<n;i++) {
k = compress[i] & 0x0f;
if(typeCount(k) == 1) {
diff += D1(compress[i] >> 4);
break;
}
}
break;
case 1: // 2+++
t = 0;
for(i=0;i<n;i++) {
k = compress[i] & 0x0f;
if(typeCount(k) == 1) {
diff += (compress[i] >> 4) << ((2-t) * 4);
t ++;
if(t >= 3) break;
}
}
break;
case 0: // +++++
diff = D5(compress[0]>>4) + D4(compress[1]>>4) + D3(compress[2]>>4) +
D2(compress[3]>>4) + D1(compress[4]>>4);
break;
}
//printf("LV=%d, DIFF=0x%x\n", level, diff);
//printf("T=0-%d 1-%d 2-%d 3-%d\n", type_same[0], type_same[1], type_same[2], type_same[3]);
return LV(level)+diff;
}
static const uint cardsuite[52] = {
2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114,
202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214,
302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314
};
void deckShuffle(uint* cards, int reserved) {
uint i,j,k,t;
for(i=0;i<40;i++) {
j = rand() % (52-reserved); j += reserved;
k = rand() % (52-reserved); k += reserved;
if(j == k) continue;
t = cards[j]; cards[j] = cards[k]; cards[k] = t;
}
}
void deckFindAndSwap(uint* cards, uint index, uint cardno) {
uint i;
for(i=0;i<52;i++) {
if(cards[i] == cardno) {
cards[i] = cards[index]; cards[index] = cardno;
break;
}
}
}
int init() {
srand(time(0));
}
int play(int n, uint* cards, int reserved) {
uint player[7] = {0,0,0,0,0,0,0};
uint i, t;
deckShuffle(cards, reserved);
memcpy(player+2, cards+2, sizeof(uint)*5);
// player A card 0n1
player[0] = cards[0]; player[1] = cards[1];
t = eval(player);
for(i=1;i<n;i++) {
player[0] = cards[5+i*2];
player[1] = cards[6+i*2];
if(eval(player) > t) return 0;
}
return 1;
}
int main(int argc, char** argv) {
if(argc != 4) {
printf(
"Usage: deck times visibleCards playerNumber\n"
" times: run how many times to get the frequency of winning\n"
" visibleCards: one card in (type, number)\n"
" type: 0, 1, 2, 3\n"
" number: 2, 3, 4, 5, 6, 7, 8, 9, o, j, q, k, a\n"
" playerNumber: the number of current players remaining\n"
"e.g. deck 100000 0a1a 13\n"
" deck 100000 0a0k35 10\n"
);
exit(-1);
}
/*char* input = argv[1];
uint cards[7] = {0,0,0,0,0,0,0};
uint i, val;
for(i=0;i<7;i++) {
cards[i] = card(input[i*2], input[i*2+1]);
}
val = eval(cards);
printf("0x%x\n", val);*/
uint i, c;
uint deck[52];
char* input = argv[2];
uint n = atoi(argv[3]),
t = atoi(argv[1]);
uint len = strlen(input)/2;
if(len>7) len = 7;
c = n*2;
init();
memcpy(deck, cardsuite, sizeof(uint)*52);
switch(len) {
case 7:
deckFindAndSwap(deck, 6, card(input[12], input[13]));
case 6:
deckFindAndSwap(deck, 5, card(input[10], input[11]));
case 5:
deckFindAndSwap(deck, 4, card(input[8], input[9]));
case 4:
deckFindAndSwap(deck, 3, card(input[6], input[7]));
case 3:
deckFindAndSwap(deck, 2, card(input[4], input[5]));
case 2:
deckFindAndSwap(deck, 1, card(input[2], input[3]));
case 1:
deckFindAndSwap(deck, 0, card(input[0], input[1]));
break;
default:
exit(1);
}
c = 0;
for(i=0;i<t;i++) if(play(n,deck,len)) {/*printf("%d\n", i+1);*/c++;}
printf("P = %.4lf\n", c*100.0/t);
return 0;
}
|
the_stack_data/13805.c | /*
A C-program for MT19937, with initialization improved 2002/2/10.
Coded by Takuji Nishimura and Makoto Matsumoto.
This is a faster version by taking Shawn Cokus's optimization,
Matthe Bellew's simplification, Isaku Wada's real version.
Before using, initialize the state by using init_genrand(seed)
or init_by_array(init_key, key_length).
Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
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. The names of its contributors may not 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 COPYRIGHT OWNER 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.
Any feedback is very welcome.
http://www.math.keio.ac.jp/matumoto/emt.html
email: [email protected]
*/
#include <stdio.h>
/* Period parameters */
#define N 624
#define M 397
#define MATRIX_A 0x9908b0dfUL /* constant vector a */
#define UMASK 0x80000000UL /* most significant w-r bits */
#define LMASK 0x7fffffffUL /* least significant r bits */
#define MIXBITS(u,v) ( ((u) & UMASK) | ((v) & LMASK) )
#define TWIST(u,v) ((MIXBITS(u,v) >> 1) ^ ((v)&1UL ? MATRIX_A : 0UL))
static unsigned long state[N]; /* the array for the state vector */
static int left = 1;
static int initf = 0;
static unsigned long *next;
/* initializes state[N] with a seed */
void init_genrand(unsigned long s)
{
int j;
state[0]= s & 0xffffffffUL;
for (j=1; j<N; j++) {
state[j] = (1812433253UL * (state[j-1] ^ (state[j-1] >> 30)) + j);
/* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
/* In the previous versions, MSBs of the seed affect */
/* only MSBs of the array state[]. */
/* 2002/01/09 modified by Makoto Matsumoto */
state[j] &= 0xffffffffUL; /* for >32 bit machines */
}
left = 1; initf = 1;
}
/* initialize by an array with array-length */
/* init_key is the array for initializing keys */
/* key_length is its length */
void init_by_array(init_key, key_length)
unsigned long init_key[], key_length;
{
int i, j, k;
init_genrand(19650218UL);
i=1; j=0;
k = (N>key_length ? N : key_length);
for (; k; k--) {
state[i] = (state[i] ^ ((state[i-1] ^ (state[i-1] >> 30)) * 1664525UL))
+ init_key[j] + j; /* non linear */
state[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
i++; j++;
if (i>=N) { state[0] = state[N-1]; i=1; }
if (j>=key_length) j=0;
}
for (k=N-1; k; k--) {
state[i] = (state[i] ^ ((state[i-1] ^ (state[i-1] >> 30)) * 1566083941UL))
- i; /* non linear */
state[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
i++;
if (i>=N) { state[0] = state[N-1]; i=1; }
}
state[0] = 0x80000000UL; /* MSB is 1; assuring non-zero initial array */
left = 1; initf = 1;
}
static void next_state(void)
{
unsigned long *p=state;
int j;
/* if init_genrand() has not been called, */
/* a default initial seed is used */
if (initf==0) init_genrand(5489UL);
left = N;
next = state;
for (j=N-M+1; --j; p++)
*p = p[M] ^ TWIST(p[0], p[1]);
for (j=M; --j; p++)
*p = p[M-N] ^ TWIST(p[0], p[1]);
*p = p[M-N] ^ TWIST(p[0], state[0]);
}
/* generates a random number on [0,0xffffffff]-interval */
unsigned long genrand_int32(void)
{
unsigned long y;
if (--left == 0) next_state();
y = *next++;
/* Tempering */
y ^= (y >> 11);
y ^= (y << 7) & 0x9d2c5680UL;
y ^= (y << 15) & 0xefc60000UL;
y ^= (y >> 18);
return y;
}
/* generates a random number on [0,0x7fffffff]-interval */
long genrand_int31(void)
{
unsigned long y;
if (--left == 0) next_state();
y = *next++;
/* Tempering */
y ^= (y >> 11);
y ^= (y << 7) & 0x9d2c5680UL;
y ^= (y << 15) & 0xefc60000UL;
y ^= (y >> 18);
return (long)(y>>1);
}
/* generates a random number on [0,1]-real-interval */
double genrand_real1(void)
{
unsigned long y;
if (--left == 0) next_state();
y = *next++;
/* Tempering */
y ^= (y >> 11);
y ^= (y << 7) & 0x9d2c5680UL;
y ^= (y << 15) & 0xefc60000UL;
y ^= (y >> 18);
return (double)y * (1.0/4294967295.0);
/* divided by 2^32-1 */
}
/* generates a random number on [0,1)-real-interval */
double genrand_real2(void)
{
unsigned long y;
if (--left == 0) next_state();
y = *next++;
/* Tempering */
y ^= (y >> 11);
y ^= (y << 7) & 0x9d2c5680UL;
y ^= (y << 15) & 0xefc60000UL;
y ^= (y >> 18);
return (double)y * (1.0/4294967296.0);
/* divided by 2^32 */
}
/* generates a random number on (0,1)-real-interval */
double genrand_real3(void)
{
unsigned long y;
if (--left == 0) next_state();
y = *next++;
/* Tempering */
y ^= (y >> 11);
y ^= (y << 7) & 0x9d2c5680UL;
y ^= (y << 15) & 0xefc60000UL;
y ^= (y >> 18);
return ((double)y + 0.5) * (1.0/4294967296.0);
/* divided by 2^32 */
}
/* generates a random number on [0,1) with 53-bit resolution*/
double genrand_res53(void)
{
unsigned long a=genrand_int32()>>5, b=genrand_int32()>>6;
return(a*67108864.0+b)*(1.0/9007199254740992.0);
}
/* These real versions are due to Isaku Wada, 2002/01/09 added */
#if 0
int main(void)
{
int i;
unsigned long init[4]={0x123, 0x234, 0x345, 0x456}, length=4;
init_by_array(init, length);
/* This is an example of initializing by an array. */
/* You may use init_genrand(seed) with any 32bit integer */
/* as a seed for a simpler initialization */
printf("1000 outputs of genrand_int32()\n");
for (i=0; i<1000; i++) {
printf("%10lu ", genrand_int32());
if (i%5==4) printf("\n");
}
printf("\n1000 outputs of genrand_real2()\n");
for (i=0; i<1000; i++) {
printf("%10.8f ", genrand_real2());
if (i%5==4) printf("\n");
}
return 0;
}
#endif
|
the_stack_data/6955.c | #include<stdio.h>
//! 24) Faça um programa em C que receba como entrada três números reais e informe se
//! estes números podem ou não representar as medidas de um triângulo. Lembrando que
//! em todo triângulo a medida de cada lado tem que ser menor que a soma das outras duas
//! medidas.
int main (){
float lado_1,lado_2,lado_3;
printf("digite a medida do lado: ");
scanf("%f",&lado_1);
printf("digite a medida do lado: ");
scanf("%f",&lado_2);
printf("digite a medida do lado: ");
scanf("%f",&lado_3);
if (((lado_1 + lado_2) > lado_3) && ((lado_1 + lado_3) > lado_2) && ((lado_3 + lado_2) > lado_1)){
printf("esta medidas pertencem a de um trianagulo");
}else{
printf("esta medidas nao pertencem a de um triangulo");
}
return 0 ;
} |
the_stack_data/37198.c | // Copyright 2015-2016 Espressif Systems (Shanghai) PTE LTD
//
// 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
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#ifdef ESP32
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "esp_system.h"
#include "esp_log.h"
#include "nvs_flash.h"
#include "bt.h"
#include "bta_api.h"
#include "esp_gatt_defs.h"
#include "esp_gap_ble_api.h"
#include "esp_gatts_api.h"
#include "esp_bt_defs.h"
#include "esp_bt_main.h"
#include "esp_bt_main.h"
#define GATTS_TAG "GATTS"
///Declare the static function
static void gatts_profile_a_event_handler(esp_gatts_cb_event_t event, esp_gatt_if_t gatts_if, esp_ble_gatts_cb_param_t *param);
size_t gatts_read_callback(uint8_t* buffer, size_t len);
void gatts_write_callback(uint8_t* data, size_t len);
#define GATTS_SERVICE_UUID_TEST_A 0x00FF
#define GATTS_CHAR_UUID_TEST_A 0xFF01
#define GATTS_DESCR_UUID_TEST_A 0x3333
#define GATTS_NUM_HANDLE_TEST_A 4
#define DEVICE_MANUFACTURER "FREEMATICS"
#define GATTS_DEMO_CHAR_VAL_LEN_MAX 0x40
uint8_t char1_str[] = {0x11,0x22,0x33};
esp_attr_value_t gatts_demo_char1_val = {GATTS_DEMO_CHAR_VAL_LEN_MAX, sizeof(char1_str), char1_str};
char ble_device_name[32] = "FREEMATICS ONE+";
static uint8_t test_service_uuid128[32] = {
/* LSB <--------------------------------------------------------------------------------> MSB */
//first uuid, 16bit, [12],[13] is the value
0xfb, 0x34, 0x9b, 0x5f, 0x80, 0x00, 0x00, 0x80, 0x00, 0x10, 0x00, 0x00, 0xAB, 0xCD, 0x00, 0x00,
//second uuid, 32bit, [12], [13], [14], [15] is the value
0xfb, 0x34, 0x9b, 0x5f, 0x80, 0x00, 0x00, 0x80, 0x00, 0x10, 0x00, 0x00, 0xAB, 0xCD, 0xAB, 0xCD,
};
//static uint8_t test_manufacturer[TEST_MANUFACTURER_DATA_LEN] = {0x12, 0x23, 0x45, 0x56};
static esp_ble_adv_params_t test_adv_params;
#define PROFILE_NUM 1
#define PROFILE_A_APP_ID 0
typedef struct {
esp_gatts_cb_t gatts_cb;
uint16_t gatts_if;
uint16_t app_id;
uint16_t conn_id;
uint16_t service_handle;
esp_gatt_srvc_id_t service_id;
uint16_t char_handle;
esp_bt_uuid_t char_uuid;
esp_gatt_perm_t perm;
esp_gatt_char_prop_t property;
uint16_t descr_handle;
esp_bt_uuid_t descr_uuid;
} GATTS_PROFILE;
/* One gatt-based profile one app_id and one gatts_if, this array will store the gatts_if returned by ESP_GATTS_REG_EVT */
static GATTS_PROFILE gl_profile_tab[PROFILE_NUM] = {0};
static int gatt_connected = 0;
static void gap_event_handler(esp_gap_ble_cb_event_t event, esp_ble_gap_cb_param_t *param)
{
switch (event) {
case ESP_GAP_BLE_ADV_DATA_SET_COMPLETE_EVT:
esp_ble_gap_start_advertising(&test_adv_params);
break;
case ESP_GAP_BLE_ADV_DATA_RAW_SET_COMPLETE_EVT:
esp_ble_gap_start_advertising(&test_adv_params);
break;
case ESP_GAP_BLE_SCAN_RSP_DATA_RAW_SET_COMPLETE_EVT:
esp_ble_gap_start_advertising(&test_adv_params);
break;
case ESP_GAP_BLE_ADV_START_COMPLETE_EVT:
//advertising start complete event to indicate advertising start successfully or failed
if (param->adv_start_cmpl.status != ESP_BT_STATUS_SUCCESS) {
ESP_LOGE(GATTS_TAG, "Advertising start failed\n");
}
case ESP_GAP_BLE_ADV_STOP_COMPLETE_EVT:
if (param->adv_stop_cmpl.status != ESP_BT_STATUS_SUCCESS) {
ESP_LOGE(GATTS_TAG, "Advertising stop failed\n");
}
else {
ESP_LOGI(GATTS_TAG, "Stop adv successfully\n");
}
break;
default:
break;
}
}
static void gatts_profile_a_event_handler(esp_gatts_cb_event_t event, esp_gatt_if_t gatts_if, esp_ble_gatts_cb_param_t* param) {
switch (event) {
case ESP_GATTS_REG_EVT:
{
ESP_LOGI(GATTS_TAG, "REGISTER_APP_EVT, status %d, app_id %d\n", param->reg.status, param->reg.app_id);
gl_profile_tab[PROFILE_A_APP_ID].service_id.is_primary = true;
gl_profile_tab[PROFILE_A_APP_ID].service_id.id.inst_id = 0x00;
gl_profile_tab[PROFILE_A_APP_ID].service_id.id.uuid.len = ESP_UUID_LEN_16;
gl_profile_tab[PROFILE_A_APP_ID].service_id.id.uuid.uuid.uuid16 = GATTS_SERVICE_UUID_TEST_A;
esp_ble_gap_set_device_name(ble_device_name);
const char* manufacturer = DEVICE_MANUFACTURER;
esp_ble_adv_data_t test_adv_data;
test_adv_data.set_scan_rsp = false;
test_adv_data.include_name = true;
test_adv_data.include_txpower = true;
test_adv_data.min_interval = 0x20;
test_adv_data.max_interval = 0x40;
test_adv_data.appearance = 0x00;
test_adv_data.manufacturer_len = strlen(manufacturer);
test_adv_data.p_manufacturer_data = (uint8_t*)manufacturer;
test_adv_data.service_data_len = 0;
test_adv_data.p_service_data = NULL;
test_adv_data.service_uuid_len = 32;
test_adv_data.p_service_uuid = test_service_uuid128;
test_adv_data.flag = (ESP_BLE_ADV_FLAG_GEN_DISC | ESP_BLE_ADV_FLAG_BREDR_NOT_SPT);
esp_ble_gap_config_adv_data(&test_adv_data);
esp_ble_gatts_create_service(gatts_if, &gl_profile_tab[PROFILE_A_APP_ID].service_id, GATTS_NUM_HANDLE_TEST_A);
}
break;
case ESP_GATTS_READ_EVT: {
esp_gatt_rsp_t rsp = {0};
ESP_LOGI(GATTS_TAG, "GATT_READ_EVT, conn_id %d, trans_id %d, handle %d\n", param->read.conn_id, param->read.trans_id, param->read.handle);
rsp.attr_value.handle = param->read.handle;
// get response data from callback
rsp.attr_value.len = gatts_read_callback((uint8_t*)rsp.attr_value.value, sizeof(rsp.attr_value.value));
esp_ble_gatts_send_response(gatts_if, param->read.conn_id, param->read.trans_id, ESP_GATT_OK, &rsp);
break;
}
case ESP_GATTS_WRITE_EVT: {
ESP_LOGI(GATTS_TAG, "GATT_WRITE_EVT, conn_id %d, trans_id %d, handle %d\n", param->write.conn_id, param->write.trans_id, param->write.handle);
ESP_LOGI(GATTS_TAG, "GATT_WRITE_EVT, value len %d, value %08x\n", param->write.len, *(uint32_t *)param->write.value);
// forward received data to callback
gatts_write_callback((uint8_t*)param->write.value, param->write.len);
esp_ble_gatts_send_response(gatts_if, param->write.conn_id, param->write.trans_id, ESP_GATT_OK, NULL);
break;
}
case ESP_GATTS_EXEC_WRITE_EVT:
case ESP_GATTS_MTU_EVT:
case ESP_GATTS_CONF_EVT:
case ESP_GATTS_UNREG_EVT:
break;
case ESP_GATTS_CREATE_EVT:
ESP_LOGI(GATTS_TAG, "CREATE_SERVICE_EVT, status %d, service_handle %d\n", param->create.status, param->create.service_handle);
gl_profile_tab[PROFILE_A_APP_ID].service_handle = param->create.service_handle;
gl_profile_tab[PROFILE_A_APP_ID].char_uuid.len = ESP_UUID_LEN_16;
gl_profile_tab[PROFILE_A_APP_ID].char_uuid.uuid.uuid16 = GATTS_CHAR_UUID_TEST_A;
esp_ble_gatts_start_service(gl_profile_tab[PROFILE_A_APP_ID].service_handle);
esp_ble_gatts_add_char(gl_profile_tab[PROFILE_A_APP_ID].service_handle, &gl_profile_tab[PROFILE_A_APP_ID].char_uuid,
ESP_GATT_PERM_READ | ESP_GATT_PERM_WRITE,
ESP_GATT_CHAR_PROP_BIT_READ | ESP_GATT_CHAR_PROP_BIT_WRITE | ESP_GATT_CHAR_PROP_BIT_NOTIFY,
&gatts_demo_char1_val, NULL);
break;
case ESP_GATTS_ADD_INCL_SRVC_EVT:
break;
case ESP_GATTS_ADD_CHAR_EVT: {
uint16_t length = 0;
const uint8_t *prf_char;
ESP_LOGI(GATTS_TAG, "ADD_CHAR_EVT, status %d, attr_handle %d, service_handle %d\n",
param->add_char.status, param->add_char.attr_handle, param->add_char.service_handle);
gl_profile_tab[PROFILE_A_APP_ID].char_handle = param->add_char.attr_handle;
gl_profile_tab[PROFILE_A_APP_ID].descr_uuid.len = ESP_UUID_LEN_16;
gl_profile_tab[PROFILE_A_APP_ID].descr_uuid.uuid.uuid16 = ESP_GATT_UUID_CHAR_CLIENT_CONFIG;
esp_ble_gatts_get_attr_value(param->add_char.attr_handle, &length, &prf_char);
ESP_LOGI(GATTS_TAG, "the gatts demo char length = %x\n", length);
for(int i = 0; i < length; i++){
ESP_LOGI(GATTS_TAG, "prf_char[%x] =%x\n",i,prf_char[i]);
}
esp_ble_gatts_add_char_descr(gl_profile_tab[PROFILE_A_APP_ID].service_handle, &gl_profile_tab[PROFILE_A_APP_ID].descr_uuid,
ESP_GATT_PERM_READ | ESP_GATT_PERM_WRITE, NULL, NULL);
break;
}
case ESP_GATTS_ADD_CHAR_DESCR_EVT:
ESP_LOGI(GATTS_TAG, "ADD_DESCR_EVT, status %d, attr_handle %d, service_handle %d\n",
param->add_char.status, param->add_char.attr_handle, param->add_char.service_handle);
break;
case ESP_GATTS_DELETE_EVT:
gatt_connected = 0;
break;
case ESP_GATTS_START_EVT:
ESP_LOGI(GATTS_TAG, "SERVICE_START_EVT, status %d, service_handle %d\n",
param->start.status, param->start.service_handle);
break;
case ESP_GATTS_STOP_EVT:
gatt_connected = 0;
break;
case ESP_GATTS_CONNECT_EVT:
ESP_LOGI(GATTS_TAG, "SERVICE_START_EVT, conn_id %d, remote %02x:%02x:%02x:%02x:%02x:%02x:, is_conn %d\n",
param->connect.conn_id,
param->connect.remote_bda[0], param->connect.remote_bda[1], param->connect.remote_bda[2],
param->connect.remote_bda[3], param->connect.remote_bda[4], param->connect.remote_bda[5],
param->connect.is_connected);
gl_profile_tab[PROFILE_A_APP_ID].conn_id = param->connect.conn_id;
gatt_connected = 1;
break;
case ESP_GATTS_DISCONNECT_EVT:
esp_ble_gap_start_advertising(&test_adv_params);
gatt_connected = 0;
break;
case ESP_GATTS_OPEN_EVT:
case ESP_GATTS_CANCEL_OPEN_EVT:
case ESP_GATTS_CLOSE_EVT:
case ESP_GATTS_LISTEN_EVT:
case ESP_GATTS_CONGEST_EVT:
default:
break;
}
}
static void gatts_event_handler(esp_gatts_cb_event_t event, esp_gatt_if_t gatts_if, esp_ble_gatts_cb_param_t *param)
{
/* If event is register event, store the gatts_if for each profile */
if (event == ESP_GATTS_REG_EVT) {
if (param->reg.status == ESP_GATT_OK) {
gl_profile_tab[param->reg.app_id].gatts_if = gatts_if;
} else {
ESP_LOGI(GATTS_TAG, "Reg app failed, app_id %04x, status %d\n",
param->reg.app_id,
param->reg.status);
return;
}
}
/* If the gatts_if equal to profile A, call profile A cb handler,
* so here call each profile's callback */
do {
int idx;
for (idx = 0; idx < PROFILE_NUM; idx++) {
if (gatts_if == ESP_GATT_IF_NONE || /* ESP_GATT_IF_NONE, not specify a certain gatt_if, need to call every profile cb function */
gatts_if == gl_profile_tab[idx].gatts_if) {
if (gl_profile_tab[idx].gatts_cb) {
gl_profile_tab[idx].gatts_cb(event, gatts_if, param);
}
}
}
} while (0);
}
void gatts_init(const char* device_name)
{
if (device_name)
strncpy(ble_device_name, device_name, sizeof(ble_device_name) - 1);
test_adv_params.adv_int_min = 0x20;
test_adv_params.adv_int_max = 0x40;
test_adv_params.adv_type = ADV_TYPE_IND;
test_adv_params.own_addr_type = BLE_ADDR_TYPE_PUBLIC;
test_adv_params.channel_map = ADV_CHNL_ALL;
test_adv_params.adv_filter_policy = ADV_FILTER_ALLOW_SCAN_ANY_CON_ANY;
memset(gl_profile_tab, 0, sizeof(gl_profile_tab));
gl_profile_tab[0].gatts_cb = gatts_profile_a_event_handler,
gl_profile_tab[0].gatts_if = ESP_GATT_IF_NONE;
esp_ble_gatts_register_callback(gatts_event_handler);
esp_ble_gap_register_callback(gap_event_handler);
esp_ble_gatts_app_register(PROFILE_A_APP_ID);
}
void gatts_uninit()
{
esp_ble_gatts_app_unregister(PROFILE_A_APP_ID);
}
int gatts_send(uint8_t* data, size_t len)
{
if (!gatt_connected) return 0;
esp_gatt_rsp_t rsp = {0};
rsp.attr_value.len = (len > ESP_GATT_MAX_ATTR_LEN) ? ESP_GATT_MAX_ATTR_LEN : len;
memcpy(rsp.attr_value.value, data, rsp.attr_value.len);
return esp_ble_gatts_send_indicate(gl_profile_tab[PROFILE_A_APP_ID].gatts_if, gl_profile_tab[PROFILE_A_APP_ID].conn_id, gl_profile_tab[PROFILE_A_APP_ID].char_handle, len, data, false) == ESP_OK;
}
#endif
|
the_stack_data/159516133.c | #include <stdio.h>
void towerOfHanoi(int n, char from_rod,
char to_rod, char aux_rod)
{
if (n == 1)
{
printf("Move disk 1 from rod %c to rod %c\n",from_rod,to_rod);
return;
}
towerOfHanoi(n - 1, from_rod, aux_rod, to_rod);
printf("Move disk %d from rod %c to %c\n",n,from_rod,to_rod);
towerOfHanoi(n - 1, aux_rod, to_rod, from_rod);
}
int main()
{
int n;
printf("enter no of disks: ");
scanf("%d",&n);
towerOfHanoi(n, 'A', 'C', 'B');
return 0;
}
|
the_stack_data/36210.c | #include<stdio.h>
#include<stdlib.h>
struct node{
int data;
struct node *next;
};
struct node *head1 = NULL;
struct node *head2 = NULL;
///// MAIN ALGORITHMIC FUNCTION to MERGE the two input linked lists ///////
void merge()
{
struct node *temp1 = head1;
struct node *temp2 = head2;
struct node *holder1 = NULL;
struct node *holder2 = NULL;
//Temporary pointer variables to store the address of next node of the two input linked list
while(temp1!=NULL && temp2!=NULL)
{
holder1 = temp1 -> next;
//Storing the address of next node of first linked list
temp1->next=temp2;
//Making the first node of first linked list point to first node of second linked list
if(holder1!=NULL) {
//Making the first node of second linked list point to second node of first linked list
holder2 = temp2 -> next;
temp2 -> next = holder1;
}
temp1=holder1;
temp2=holder2;
//Updating the address location of two pointer variables temp1 and temp2
}
}
void printlist(struct node *temp){
printf("%d",temp->data);
temp=temp->next;
while(temp!=NULL){
printf("->%d",temp->data);
temp=temp->next;
}
printf("\n");
}
int main()
{
// Linked List 1: 1->3->5->7 : Linked List 2: 2->4->6
// making lists
struct node *one = (struct node*)malloc(sizeof(struct node));
struct node *two = (struct node*)malloc(sizeof(struct node));
struct node *three = (struct node*)malloc(sizeof(struct node));
struct node *four = (struct node*)malloc(sizeof(struct node));
struct node *five = (struct node*)malloc(sizeof(struct node));
struct node *six = (struct node*)malloc(sizeof(struct node));
struct node *seven = (struct node*)malloc(sizeof(struct node));
//Seven nodes are created
head1=one;
head2=two;
//head1 points to first node of first linked list
//head2 points to first node of second linked list
one->data=1;
one->next=three;
two->data=2;
two->next=four;
three->data=3;
three->next=five;
four->data=4;
four->next=six;
five->data=5;
five->next=seven;
six->data=6;
six->next=NULL;
//Last node of second input linked list
seven->data=7;
seven->next=NULL;
//Last node of first input linked list
printf("Linked List 1: ");
printlist(head1);
printf("\nLinked List 2: ");
printlist(head2);
//Merging the two linked list into single linked list
merge();
printf("\nMerged Linked List: ");
printlist(head1); //list one has been modified
return 0;
}
|
the_stack_data/11556.c | /* ========================================================================== */
/* === cholmod_gpu_kernels.c ================================================ */
/* ========================================================================== */
/* a dummy file to satisfy 'make' when the GPU is not available */
|
the_stack_data/242331631.c | #include <stdio.h>
#include <string.h>
void csort(unsigned max, unsigned size, const unsigned src[size], unsigned dst[size])
{
unsigned count[max];
memset(count, 0, sizeof(unsigned) * max);
for (size_t i = 0; i < size; ++i)
++count[src[i]];
for (size_t i = 0, v = 0; v <= max;)
count[v]-- ? dst[i++] = v : ++v;
}
int main(void)
{
unsigned src[] = {2, 0, 7, 3, 9, 7, 4, 5, 5, 8, 2, 6, 1, 5, 2};
unsigned dst[sizeof(src) / sizeof(unsigned)];
csort(10, sizeof(src) / sizeof(unsigned), src, dst);
for (size_t i = 0; i < sizeof(src) / sizeof(unsigned); ++i) {
printf("%zu: %u\n", i, dst[i]);
}
return 0;
}
|
the_stack_data/72011801.c | /*
ANNOUNCEMENT: Up to 20% marks will be allotted for good programming practice. These include
- Comments: for the non trivial part of the code
- Indentation: align your code properly
-Don't put extra whitespace anywhere.
---------------------------------
Given an input number N(0<=N<=9), a width w and height h,respectively,generate a rectangle boundary space as shown below:
Example:
Input:
3 4 5
Output:
3333
3 3
3 3
3 3
3333
Input:
2 2 2
22
22
*/
#include<stdio.h>
int main()
{
int N,width,height;
scanf("%d %d %d",&N,&width,&height);
int i,j;
for(i=1;i<=height;i++)
{
for(j=1;j<=width;j++)
{
if(j==width || j==1 || i==1 || i==height)
printf("%d",N);
else
printf(" ");
}
printf("\n");
}
return 0;
}
|
the_stack_data/751915.c | extern int nd (void);
extern void __VERIFIER_error() __attribute__ ((__noreturn__));
extern void __VERIFIER_assume(int);
__attribute__ ((__always_inline__)) void __VERIFIER_assert(int v)
{if (!v) __VERIFIER_error ();}
#define assume __VERIFIER_assume
#define assert __VERIFIER_assert
int base;
int ptr;
int size;
int offset;
int foo (int addr, int n, int v)
{
for (int i = 0; i < n; ++i)
{
/* deref addr + 4*i */;
int o = base == addr ? 4*i : offset + 4*i;
if (base == addr || ptr == addr)
assert (o + 4 <= size);
}
return addr;
}
int main(void)
{
int N;
N = nd();
assume (N > 0);
#ifdef FIXED_SIZE
assume (N == FIXED_SIZE);
#endif
base = nd();
assume (base > 0);
size = nd();
assume (size > 0);
ptr = 0;
offset = 0;
int addr = nd();
assume (addr > 0);
/* addr = alloc(4*N) */
if (base == addr)
{
ptr = base;
assume(size == 4*N);
}
else
assume (base + size < addr);
int x;
x = nd();
assume (x == 5);
int b = foo (addr, N, x);
int c = foo (b, N, x+1);
return 0;
}
|
the_stack_data/140765012.c | /*Given a N by M matrix of numbers,print out the matrix in a clockwise spiral
Example given matrix is shown in input
Input:
[[1,2,3,4,5],
[6,7,8,9,10],
[11,12,13,14,15],
[16,17,18,19,20]]
Output :1 2 3 4 5 10 15 20 19 18 17 16 11 6 7 8 9 14 13 12
*/
#include<stdio.h>
int main()
{
int a[100][100];
int i,k=0,l=0,m,n,j;
printf("Enter the no of rows\t");
scanf("%d",&m);
printf("Enter the no of columns\t");
scanf("%d",&n);
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
}
}
i=0;
j=0;
while (k < m && l < n) {
for (i = l; i < n; ++i) {
printf("%d ", a[k][i]);
}
k++;
for (i = k; i < m; ++i) {
printf("%d ", a[i][n - 1]);
}
n--;
if (k < m) {
for (i = n - 1; i >= l; --i) {
printf("%d ", a[m - 1][i]);
}
m--;
}
if (l < n) {
for (i = m - 1; i >= k; --i) {
printf("%d ", a[i][l]);
}
l++;
}
}
}
|
the_stack_data/184519159.c | #include <stdio.h>
int main(int argc, char const *argv[])
{
char letra = argv[1][0];
if (letra > 64 && letra < 91){
letra += 32;
}
printf("%c\n", letra);
return 0;
} |
the_stack_data/120565.c | #include <stdio.h>
int main(void){
int max,min;
printf("Enter a Range: ");
scanf("%d %d",&min,&max);
/*
If user tries to input an integer below 2
Ask them to input again.
*/
while(max < 2 || min < 2){
printf("Enter a Range greater or equal to 2 ! : ");
scanf("%d %d",&min,&max);
}
// Swapping the range if input is incorrect
if(max < min){
int temp = max;
max = min;
min = temp;
}
/*
sdc stands for Successful Division Count
*/
int sdc = 0;
for(int i = min; i <= max; i++){
sdc = 0;
for(int d = 2; d <= max; d++){
if(i % d == 0){
sdc++;
}
if(sdc > 1 || d > i){
break;
}
}
if(sdc == 1){
printf("%d\n",i);
}
}
return 0;
}
|
the_stack_data/87896.c | // RUN: %clang_cc1 -emit-llvm < %s | grep "llvm.returnaddress"
// RUN: %clang_cc1 -emit-llvm < %s | grep "llvm.frameaddress"
void* a(unsigned x) {
return __builtin_return_address(0);
}
void* c(unsigned x) {
return __builtin_frame_address(0);
}
|
the_stack_data/107223.c | #include<stdio.h>
void mergesort(int[],int,int);
void combine(int[],int,int,int);
void main()
{
int a[10],n,i;
printf("\n Enter no of elements ");
scanf("%d",&n);
printf("\n Enter the elements\n");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
mergesort(a,0,n-1);
printf("\nSorted array is \n");
for(i=0;i<n;i++)
printf("%d ",a[i]);
}
void mergesort(int a[10],int low, int high)
{
int mid;
if(low<high)
{
mid=(low+high)/2;
mergesort(a,low,mid);
mergesort(a,mid+1,high);
combine(a,low,mid,high);
}
}
void combine(int a[10],int low,int mid, int high)
{
int i,j,k,temp[10];
i=low;
j=mid+1;
k=low;
while(i<=mid && j<=high)
{
if(a[i]<a[j])
{
temp[k]=a[i];
k++;
i++;
}
else
{
temp[k]=a[j];
k++;
j++;
}
}
while(i<=mid)
{
temp[k]=a[i];
k++;
i++;
}
while(j<=high)
{
temp[k]=a[j];
k++;
j++;
}
for(i=low;i<=high;i++)
a[i]=temp[i];
} |
the_stack_data/32949096.c | // kernel BUG in ext4_mb_load_buddy_gfp
// https://syzkaller.appspot.com/bug?id=9fb6cebb68c961541029
// status:0
// autogenerated by syzkaller (https://github.com/google/syzkaller)
#define _GNU_SOURCE
#include <endian.h>
#include <errno.h>
#include <fcntl.h>
#include <pthread.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/stat.h>
#include <sys/syscall.h>
#include <sys/types.h>
#include <time.h>
#include <unistd.h>
#include <linux/futex.h>
static void sleep_ms(uint64_t ms)
{
usleep(ms * 1000);
}
static uint64_t current_time_ms(void)
{
struct timespec ts;
if (clock_gettime(CLOCK_MONOTONIC, &ts))
exit(1);
return (uint64_t)ts.tv_sec * 1000 + (uint64_t)ts.tv_nsec / 1000000;
}
static void thread_start(void* (*fn)(void*), void* arg)
{
pthread_t th;
pthread_attr_t attr;
pthread_attr_init(&attr);
pthread_attr_setstacksize(&attr, 128 << 10);
int i = 0;
for (; i < 100; i++) {
if (pthread_create(&th, &attr, fn, arg) == 0) {
pthread_attr_destroy(&attr);
return;
}
if (errno == EAGAIN) {
usleep(50);
continue;
}
break;
}
exit(1);
}
typedef struct {
int state;
} event_t;
static void event_init(event_t* ev)
{
ev->state = 0;
}
static void event_reset(event_t* ev)
{
ev->state = 0;
}
static void event_set(event_t* ev)
{
if (ev->state)
exit(1);
__atomic_store_n(&ev->state, 1, __ATOMIC_RELEASE);
syscall(SYS_futex, &ev->state, FUTEX_WAKE | FUTEX_PRIVATE_FLAG, 1000000);
}
static void event_wait(event_t* ev)
{
while (!__atomic_load_n(&ev->state, __ATOMIC_ACQUIRE))
syscall(SYS_futex, &ev->state, FUTEX_WAIT | FUTEX_PRIVATE_FLAG, 0, 0);
}
static int event_isset(event_t* ev)
{
return __atomic_load_n(&ev->state, __ATOMIC_ACQUIRE);
}
static int event_timedwait(event_t* ev, uint64_t timeout)
{
uint64_t start = current_time_ms();
uint64_t now = start;
for (;;) {
uint64_t remain = timeout - (now - start);
struct timespec ts;
ts.tv_sec = remain / 1000;
ts.tv_nsec = (remain % 1000) * 1000 * 1000;
syscall(SYS_futex, &ev->state, FUTEX_WAIT | FUTEX_PRIVATE_FLAG, 0, &ts);
if (__atomic_load_n(&ev->state, __ATOMIC_ACQUIRE))
return 1;
now = current_time_ms();
if (now - start > timeout)
return 0;
}
}
#define FUSE_MIN_READ_BUFFER 8192
enum fuse_opcode {
FUSE_LOOKUP = 1,
FUSE_FORGET = 2,
FUSE_GETATTR = 3,
FUSE_SETATTR = 4,
FUSE_READLINK = 5,
FUSE_SYMLINK = 6,
FUSE_MKNOD = 8,
FUSE_MKDIR = 9,
FUSE_UNLINK = 10,
FUSE_RMDIR = 11,
FUSE_RENAME = 12,
FUSE_LINK = 13,
FUSE_OPEN = 14,
FUSE_READ = 15,
FUSE_WRITE = 16,
FUSE_STATFS = 17,
FUSE_RELEASE = 18,
FUSE_FSYNC = 20,
FUSE_SETXATTR = 21,
FUSE_GETXATTR = 22,
FUSE_LISTXATTR = 23,
FUSE_REMOVEXATTR = 24,
FUSE_FLUSH = 25,
FUSE_INIT = 26,
FUSE_OPENDIR = 27,
FUSE_READDIR = 28,
FUSE_RELEASEDIR = 29,
FUSE_FSYNCDIR = 30,
FUSE_GETLK = 31,
FUSE_SETLK = 32,
FUSE_SETLKW = 33,
FUSE_ACCESS = 34,
FUSE_CREATE = 35,
FUSE_INTERRUPT = 36,
FUSE_BMAP = 37,
FUSE_DESTROY = 38,
FUSE_IOCTL = 39,
FUSE_POLL = 40,
FUSE_NOTIFY_REPLY = 41,
FUSE_BATCH_FORGET = 42,
FUSE_FALLOCATE = 43,
FUSE_READDIRPLUS = 44,
FUSE_RENAME2 = 45,
FUSE_LSEEK = 46,
FUSE_COPY_FILE_RANGE = 47,
FUSE_SETUPMAPPING = 48,
FUSE_REMOVEMAPPING = 49,
CUSE_INIT = 4096,
CUSE_INIT_BSWAP_RESERVED = 1048576,
FUSE_INIT_BSWAP_RESERVED = 436207616,
};
struct fuse_in_header {
uint32_t len;
uint32_t opcode;
uint64_t unique;
uint64_t nodeid;
uint32_t uid;
uint32_t gid;
uint32_t pid;
uint32_t padding;
};
struct fuse_out_header {
uint32_t len;
uint32_t error;
uint64_t unique;
};
struct syz_fuse_req_out {
struct fuse_out_header* init;
struct fuse_out_header* lseek;
struct fuse_out_header* bmap;
struct fuse_out_header* poll;
struct fuse_out_header* getxattr;
struct fuse_out_header* lk;
struct fuse_out_header* statfs;
struct fuse_out_header* write;
struct fuse_out_header* read;
struct fuse_out_header* open;
struct fuse_out_header* attr;
struct fuse_out_header* entry;
struct fuse_out_header* dirent;
struct fuse_out_header* direntplus;
struct fuse_out_header* create_open;
struct fuse_out_header* ioctl;
};
static int fuse_send_response(int fd, const struct fuse_in_header* in_hdr,
struct fuse_out_header* out_hdr)
{
if (!out_hdr) {
return -1;
}
out_hdr->unique = in_hdr->unique;
if (write(fd, out_hdr, out_hdr->len) == -1) {
return -1;
}
return 0;
}
static volatile long syz_fuse_handle_req(volatile long a0, volatile long a1,
volatile long a2, volatile long a3)
{
struct syz_fuse_req_out* req_out = (struct syz_fuse_req_out*)a3;
struct fuse_out_header* out_hdr = NULL;
char* buf = (char*)a1;
int buf_len = (int)a2;
int fd = (int)a0;
if (!req_out) {
return -1;
}
if (buf_len < FUSE_MIN_READ_BUFFER) {
return -1;
}
int ret = read(fd, buf, buf_len);
if (ret == -1) {
return -1;
}
if ((size_t)ret < sizeof(struct fuse_in_header)) {
return -1;
}
const struct fuse_in_header* in_hdr = (const struct fuse_in_header*)buf;
if (in_hdr->len > (uint32_t)ret) {
return -1;
}
switch (in_hdr->opcode) {
case FUSE_GETATTR:
case FUSE_SETATTR:
out_hdr = req_out->attr;
break;
case FUSE_LOOKUP:
case FUSE_SYMLINK:
case FUSE_LINK:
case FUSE_MKNOD:
case FUSE_MKDIR:
out_hdr = req_out->entry;
break;
case FUSE_OPEN:
case FUSE_OPENDIR:
out_hdr = req_out->open;
break;
case FUSE_STATFS:
out_hdr = req_out->statfs;
break;
case FUSE_RMDIR:
case FUSE_RENAME:
case FUSE_RENAME2:
case FUSE_FALLOCATE:
case FUSE_SETXATTR:
case FUSE_REMOVEXATTR:
case FUSE_FSYNCDIR:
case FUSE_FSYNC:
case FUSE_SETLKW:
case FUSE_SETLK:
case FUSE_ACCESS:
case FUSE_FLUSH:
case FUSE_RELEASE:
case FUSE_RELEASEDIR:
case FUSE_UNLINK:
case FUSE_DESTROY:
out_hdr = req_out->init;
if (!out_hdr) {
return -1;
}
out_hdr->len = sizeof(struct fuse_out_header);
break;
case FUSE_READ:
out_hdr = req_out->read;
break;
case FUSE_READDIR:
out_hdr = req_out->dirent;
break;
case FUSE_READDIRPLUS:
out_hdr = req_out->direntplus;
break;
case FUSE_INIT:
out_hdr = req_out->init;
break;
case FUSE_LSEEK:
out_hdr = req_out->lseek;
break;
case FUSE_GETLK:
out_hdr = req_out->lk;
break;
case FUSE_BMAP:
out_hdr = req_out->bmap;
break;
case FUSE_POLL:
out_hdr = req_out->poll;
break;
case FUSE_GETXATTR:
case FUSE_LISTXATTR:
out_hdr = req_out->getxattr;
break;
case FUSE_WRITE:
case FUSE_COPY_FILE_RANGE:
out_hdr = req_out->write;
break;
case FUSE_FORGET:
case FUSE_BATCH_FORGET:
return 0;
case FUSE_CREATE:
out_hdr = req_out->create_open;
break;
case FUSE_IOCTL:
out_hdr = req_out->ioctl;
break;
default:
return -1;
}
return fuse_send_response(fd, in_hdr, out_hdr);
}
struct thread_t {
int created, call;
event_t ready, done;
};
static struct thread_t threads[16];
static void execute_call(int call);
static int running;
static void* thr(void* arg)
{
struct thread_t* th = (struct thread_t*)arg;
for (;;) {
event_wait(&th->ready);
event_reset(&th->ready);
execute_call(th->call);
__atomic_fetch_sub(&running, 1, __ATOMIC_RELAXED);
event_set(&th->done);
}
return 0;
}
static void loop(void)
{
int i, call, thread;
for (call = 0; call < 11; call++) {
for (thread = 0; thread < (int)(sizeof(threads) / sizeof(threads[0]));
thread++) {
struct thread_t* th = &threads[thread];
if (!th->created) {
th->created = 1;
event_init(&th->ready);
event_init(&th->done);
event_set(&th->done);
thread_start(thr, th);
}
if (!event_isset(&th->done))
continue;
event_reset(&th->done);
th->call = call;
__atomic_fetch_add(&running, 1, __ATOMIC_RELAXED);
event_set(&th->ready);
event_timedwait(&th->done, 50);
break;
}
}
for (i = 0; i < 100 && __atomic_load_n(&running, __ATOMIC_RELAXED); i++)
sleep_ms(1);
}
#ifndef __NR_bpf
#define __NR_bpf 321
#endif
uint64_t r[4] = {0xffffffffffffffff, 0xffffffffffffffff, 0x0,
0xffffffffffffffff};
void execute_call(int call)
{
intptr_t res = 0;
switch (call) {
case 0:
memcpy((void*)0x200000c0, "memory.events\000", 14);
res = syscall(__NR_openat, 0xffffff9c, 0x200000c0ul, 0x26e1ul, 0ul);
if (res != -1)
r[0] = res;
break;
case 1:
*(uint32_t*)0x20000040 = 0;
*(uint32_t*)0x20000044 = -1;
*(uint32_t*)0x20000048 = 0;
*(uint32_t*)0x2000004c = 0x1ab;
*(uint64_t*)0x20000050 = 0x200003c0;
memcpy(
(void*)0x200003c0,
"bdev!)-%+wlan\000posi\031Mx_dxl_accesszQ\tU\227\022=J\325\213;"
"YE\354\214;"
"\367\314\247\2136\n\276\001\001\256\266\f4\207\331j\330\016\302\020"
"\261\177\225\001fE\256a\020\217\254\251+V\2063Hhk{"
"2\000\024I\367\326\315)\005\207q6\355~"
"\320\262\370\215\252\b\344\"\034\277\217_[\027@"
"\345\354\020\a\2715w\213y}/\214w\346\231\376 "
"\204]8\2240U\263E;\377\241!"
"\232\207\210\002\277\253\227B\331\006\362\n\367\037\330v\177D\362\207"
"\367}V\211}\360\267\215\205\366\233\314\323Lh.\r\323J\"\037\336W;F."
"\337$\356\030\0165\241\374N\210`\273j,q[\220/"
"\233\360\314r\301\250\205E\205p+"
"\321\276\020\rgx\270\223k\214\035Ti\257q\336\006/ "
"\223O.\345<0\372\b\202\344c&\231\326psf\250\254jh9\213k\217\n$"
"\362\006#\310\322\000\000w\003,"
"\273\355\361o\330\031\322\035\273\323\030E\016&\203\337WL?P$"
"\264a\f\0254\335\254x\221<"
"\227\023\253\342\335\n\023\031\271U\n\265\266\377BQ\200\346\346\257"
"\310\025_>\346\374\271R\006\315/"
"\207\021\361\271\276&,c\3753\304\352P\233\3375\314\244RDx\255\300\217|"
"\343u\276\036\325\246\314\270\206\2130\'\314\001\233Q/"
"\371\247vfa\337!\032xt\321\r\331&MC\314,2\316\322kCJ\020\210\305#"
"\222\2432)2\323\2402q\333\344\343\227\235\274\311\370G",
427);
syscall(__NR_bpf, 0x14ul, 0x20000040ul, 0x30ul);
break;
case 2:
*(uint64_t*)0x20000040 = 0;
syscall(__NR_ioctl, r[0], 0x4030582a, 0x20000040ul);
break;
case 3:
memcpy((void*)0x200020c0, "./file0\000", 8);
syscall(__NR_mkdir, 0x200020c0ul, 0ul);
break;
case 4:
memcpy((void*)0x20002080, "/dev/fuse\000", 10);
res = syscall(__NR_openat, 0xffffffffffffff9cul, 0x20002080ul, 0x42ul, 0ul);
if (res != -1)
r[1] = res;
break;
case 5:
memcpy((void*)0x200042c0, "./file0\000", 8);
memcpy((void*)0x20002000, "fuse\000", 5);
memcpy((void*)0x20002100, "fd", 2);
*(uint8_t*)0x20002102 = 0x3d;
sprintf((char*)0x20002103, "0x%016llx", (long long)r[1]);
*(uint8_t*)0x20002115 = 0x2c;
memcpy((void*)0x20002116, "rootmode", 8);
*(uint8_t*)0x2000211e = 0x3d;
sprintf((char*)0x2000211f, "%023llo", (long long)0x4000);
*(uint8_t*)0x20002136 = 0x2c;
memcpy((void*)0x20002137, "user_id", 7);
*(uint8_t*)0x2000213e = 0x3d;
sprintf((char*)0x2000213f, "%020llu", (long long)0);
*(uint8_t*)0x20002153 = 0x2c;
memcpy((void*)0x20002154, "group_id", 8);
*(uint8_t*)0x2000215c = 0x3d;
sprintf((char*)0x2000215d, "%020llu", (long long)0);
*(uint8_t*)0x20002171 = 0x2c;
*(uint8_t*)0x20002172 = 0;
syscall(__NR_mount, 0ul, 0x200042c0ul, 0x20002000ul, 0ul, 0x20002100ul);
break;
case 6:
res = syscall(__NR_read, r[1], 0x20006a40ul, 0x2020ul);
if (res != -1)
r[2] = *(uint64_t*)0x20006a48;
break;
case 7:
*(uint32_t*)0x20004200 = 0x50;
*(uint32_t*)0x20004204 = 0;
*(uint64_t*)0x20004208 = r[2];
*(uint32_t*)0x20004210 = 7;
*(uint32_t*)0x20004214 = 0x21;
*(uint32_t*)0x20004218 = 0;
*(uint32_t*)0x2000421c = 0;
*(uint16_t*)0x20004220 = 0;
*(uint16_t*)0x20004222 = 0;
*(uint32_t*)0x20004224 = 0;
*(uint32_t*)0x20004228 = 0;
*(uint16_t*)0x2000422c = 0;
*(uint16_t*)0x2000422e = 0;
memset((void*)0x20004230, 0, 32);
syscall(__NR_write, r[1], 0x20004200ul, 0x50ul);
break;
case 8:
memcpy(
(void*)0x20000000,
"\x9e\xda\x43\x88\x38\x74\x3b\xd4\xe9\x72\x0b\xee\x57\x09\x35\x15\xdc"
"\x18\x9a\x5e\xa6\x85\xe9\x55\x6c\x1c\x2c\x3c\xfc\x4d\xf5\x0d\x66\xd3"
"\x1a\x48\xaa\x31\x26\x63\xb6\x8d\x18\xc5\x82\x6b\x5b\x55\xfb\x73\x82"
"\x08\x86\x3d\xac\x0f\x10\xf4\x23\xae\xe7\xa5\xd8\xdd\xc4\x5e\xbd\xfe"
"\xb7\x42\x4b\xae\x85\x9d\x7c\x37\xec\xfc\x4b\x63\x91\x4d\x5a\x56\xd9"
"\x10\x17\xdd\x22\xbc\x84\xf7\x59\xa1\x59\x69\x95\x1a\xef\x9d\x5c\x88"
"\xc9\x65\x60\x89\x69\x88\xfa\x18\xcd\x94\x6c\xfc\xc3\xa0\xf1\xc9\x93"
"\x34\x83\x77\x90\x4e\xac\x32\xc9\x80\xbd\xf7\x97\x6e\xbc\xa2\xb4\x99"
"\xca\xb6\x3c\x4e\x84\x15\x14\x27\x7f\xc7\x1d\x46\x20\xe2\x9a\x92\x52"
"\x34\x02\x48\x5d\xe0\xe8\x28\x96\x48\x4c\x0a\xe4\x97\xa4\xd6\x86\xdf"
"\x23\xca\x7b\x68\xc3\xfd\x5e\x62\x4d\x35\x10\xd7\xf9\x48\x38\xe5\x4a"
"\xf8\x77\xca\x58\xa0\x0c\x5a\x67\x2b\xba\x11\xf5\xaa\x1e\xd1\x98\x0d"
"\xfe\xf4\x7b\x99\x73\xd0\xbf\x45\x6d\xed\x5e\x72\xf1\x70\x2b\x3d\xc5"
"\x19\x7f\xce\x39\xcb\xa5\x3a\x03\x8d\x8d\xc0\xec\x78\x3c\xe7\x05\x77"
"\x10\x7d\xc5\xe8\xb2\x99\xe6\x4a\x0b\x7f\x11\x91\xf0\x92\x6b\xd2\x57"
"\x62\x37\x01\x91\x71\x0b\xab\x2f\x44\xe9\x06\x9f\x55\xf8\xa3\xf8\x7e"
"\x4c\xb4\x88\xa2\xfb\x33\x48\xc0\xbf\x3b\x38\x74\x29\x1f\x83\xe4\x77"
"\x6b\x16\x0e\xa7\x3a\xaf\xa3\x91\x9c\x7c\x06\x9c\x73\xc0\x05\x21\x73"
"\xa6\x31\x58\xdb\x8b\x65\x54\x1d\x16\x1f\x9c\x96\x49\x26\xad\x7f\x06"
"\xbd\xd6\xcb\x6a\x32\x13\x5b\x04\xe3\x57\x01\xc2\xe1\x3c\x49\xc1\xf7"
"\x5d\xc7\xa2\x5d\x62\x33\x78\x86\x06\x92\xd1\x72\xec\x3f\x1e\x1f\x2d"
"\x9d\xc7\x7c\x01\x5c\x13\x72\x1e\xfc\xb1\x01\xc2\x39\x0a\xbb\x84\x7e"
"\x87\x11\x32\xf4\x72\xa3\x7c\xc0\x16\x3b\x39\xb1\xd5\x75\xa5\x44\x4e"
"\x24\x6a\x08\xa1\xaf\xb1\xa6\x96\xca\xba\xb2\x94\x98\xa3\x14\x42\x9a"
"\x3b\x9f\x44\xc4\x3b\xa2\x9f\x71\xfa\xc1\xfb\xe0\xd0\x1c\x3c\x16\xd2"
"\x27\x30\x93\x27\x04\xbc\xfb\x0c\x1b\x7a\x43\x2b\xc5\x1d\xd3\xf5\xdd"
"\x5a\xfc\x3b\x34\x2c\xbe\x6a\x6f\xf8\x99\x03\x9e\x28\xf9\xa5\x18\x81"
"\xb1\xd4\x6f\xdc\xf3\x17\x67\xcb\x6f\x5c\x5c\x69\xab\x3c\x80\x61\x5d"
"\x77\xc4\xd1\x66\x4f\xc4\xec\x83\x1b\x8c\xea\x2e\x75\x2b\xbb\x7a\x9c"
"\xe7\x9d\xf8\x75\xb2\x9f\x1e\x23\x27\x51\xda\xf3\x2a\x1a\x0c\x4f\xf8"
"\xbd\x06\x88\xe2\xb8\xe2\xd6\x68\xb8\xa7\x7e\x20\xa9\xeb\x6e\xc2\xe2"
"\xc2\x3b\x94\xe5\x07\xba\xea\xcb\xcf\xa3\x1f\xb6\xe1\xca\x33\x43\x66"
"\x8f\x43\xe3\xaa\x6d\x85\xe7\xc2\x9b\xf0\xbb\x4d\xbd\xab\xdd\xc9\x2b"
"\xe7\xf4\xa6\xf5\xd2\x1b\x19\xe6\xda\x17\xbf\xb6\xcc\x92\x6e\x38\x47"
"\x53\x2f\xae\x29\xc7\xb6\x2f\xb9\x09\x13\x0e\xc3\x72\xd3\xc1\x6c\xfe"
"\x6a\xaf\x3c\xe2\xaf\x0f\xe7\x61\x0f\xde\x7a\xad\x61\xbc\x80\xd2\xf9"
"\x6b\x99\x9c\x8c\xcf\x6d\x22\xcf\x90\x3c\xa8\xae\x8b\x87\x9e\xc4\xa4"
"\x16\xf3\x34\x98\x2e\x98\x10\xc0\x14\x0a\x18\xd4\xdc\x81\xb5\xed\xaa"
"\xe2\x3e\x9f\x4a\xba\xf4\x0e\xd7\x15\x12\xae\xbb\xba\x5b\xb2\x51\x54"
"\x5e\x18\x8d\xb7\x89\x55\x8a\x84\x5a\x28\x77\xb1\x4b\xda\xee\xc3\xc7"
"\x38\xb7\xd7\x30\xc0\x86\x05\x31\xbf\x55\x17\xd4\xf0\xe8\xf9\x5e\xd3"
"\x57\x1f\x8a\x35\x81\x6d\x51\x16\xfc\xb8\xd7\xcb\xf4\x2b\x7d\x5d\x5e"
"\x65\x54\x15\x08\xc8\x98\xbb\x2e\x0f\xe9\x62\x97\xd2\xab\x71\x35\x66"
"\x2d\xe3\x9d\xf0\x99\xeb\xae\xd5\x87\x11\x11\xf5\x34\x62\x78\xce\xe5"
"\x72\x8c\xec\x51\x2e\x6c\x0a\x0d\x65\xb5\x1e\x3d\x62\x78\x73\x19\x5b"
"\x84\x10\x33\x41\xc2\xbc\x83\xb6\xc8\xfd\xd8\xba\x17\xf5\x95\x74\x13"
"\xf6\x1c\x69\xd6\x18\xc9\xb9\xd0\xb1\xf0\x8d\xc8\x19\x21\xb6\xc6\x62"
"\xee\x1d\xa3\xbf\xa0\x19\xb0\x95\xe9\xa0\x3c\x2d\xb4\xd6\x45\xcc\xb7"
"\x36\x4e\x89\x50\x98\xcb\xf7\xd9\x32\xc7\x2d\x80\x66\x3c\x7a\x16\x94"
"\xd1\x22\xf7\x34\x83\x93\x07\x92\x23\xc1\x1d\x36\xc6\x4a\x58\x56\xea"
"\xe0\x39\x7a\xb9\xa9\xd9\x48\x20\x4b\x74\xe5\x65\x25\xa9\xd5\x52\xdd"
"\x09\x16\xde\x81\xcb\xb5\xaf\x3c\x59\xb3\xd7\xf8\xf9\x15\x44\x23\xce"
"\x2c\xb4\x5a\x5b\xc8\x08\xe2\x4b\xef\x13\x21\x20\x19\xa1\x95\x45\xfe"
"\x54\xba\x84\xd0\x15\x34\x35\x83\x80\x19\x2b\x8c\x7b\x0e\xda\x90\x78"
"\x10\x37\x5b\xb6\x6a\x57\x8a\x58\xfe\xc3\x92\xb4\x79\x91\x27\x1c\x83"
"\x67\xb9\x1d\x71\x0e\x8a\x17\x6b\xc1\xa4\xe9\x6f\x0e\x13\x7d\x4c\x25"
"\xfb\xb0\x3e\xdd\xc3\x92\xf9\xf1\x70\xdd\x74\x44\x72\xb8\x64\xfb\xba"
"\xe7\xc9\x3d\x86\xe6\x82\x30\x8b\x21\xb7\x3c\x56\x52\x06\x5d\x72\xcf"
"\x02\xe1\x15\x2b\x44\x02\x4a\x90\xa3\xb5\x2e\xb0\xbb\x3c\xb4\x12\xe5"
"\x18\xd3\x7a\x68\xaa\x4c\x7f\x46\x78\x9c\x54\xab\x30\xd3\xa7\x3d\x0a"
"\x87\x12\xfd\xe6\x12\x29\x4c\xda\x2a\xa1\xcc\xf1\x64\x93\x0b\x9b\x1d"
"\x17\x80\x1d\x4f\xbb\x06\xe8\x49\xd3\x9b\xf2\xb5\x14\x13\x30\xca\xa0"
"\xd2\x61\x8b\x61\x6f\x1c\x67\xe1\xca\x57\x08\x0e\x79\xed\x90\x92\xba"
"\x7a\x55\xe8\x12\x1c\xfc\x82\x5c\xd2\x6a\x01\x99\xa4\x79\xa7\xab\x1b"
"\x7b\x23\xd2\xa4\xdd\x82\xfa\x6d\x04\xee\x41\xca\x68\x04\x35\xef\xc9"
"\x34\xf0\x45\x1e\x86\x5e\x86\x32\xac\x2f\x11\x15\xf4\xcd\xd3\x3b\x0f"
"\xcc\xb7\xa2\x32\x61\x27\xfa\xf2\x0c\xba\x37\xc8\x28\x61\x3d\xba\x5a"
"\x98\xf4\xe1\xad\x25\xeb\x6b\x91\x07\x8c\xf7\x3d\x87\x3d\xf9\xef\x91"
"\x53\x14\x76\xf6\x4b\x83\x55\x9f\xf7\xcc\xdc\x4c\x07\x0d\x47\x8b\x18"
"\x19\x6e\xa0\x5f\xe8\xd4\xea\x02\x16\xee\x52\x73\xdf\xab\xbd\x04\x58"
"\x2f\x40\xf0\x64\xc9\x78\x1a\xfd\x2c\xbf\x30\x90\x1f\x28\xcd\x09\xcc"
"\x93\x4f\x1b\x2d\x50\x88\x37\x78\x27\x41\x77\xe3\xdb\xa8\xaf\x0a\x1b"
"\x93\x1d\x80\xce\x1a\x6c\x40\x85\x78\x0e\xa2\x19\x5b\x65\xec\xfd\x29"
"\x53\xf7\x8a\x52\x90\xfe\x56\x0d\x0c\xd6\xa5\xe7\x38\x90\xa5\xa8\x2d"
"\xc4\x10\xb9\x2a\x3e\xf2\xbe\x05\xec\x56\x07\x82\x0f\xd4\xca\x6b\x9c"
"\x3a\xa2\x58\xd5\x90\x22\xfd\xcb\x21\x66\x5f\x1c\xe4\xe8\xaa\xd8\xfd"
"\x91\x8c\x43\xbd\x3c\x2a\xfe\x3d\xc2\x23\xff\x9f\x48\x83\x1d\x40\x1c"
"\x8b\x69\x96\x19\x07\x93\xd1\xdd\x75\x51\xf8\x51\x1b\x69\x28\x39\x92"
"\x39\x8d\x8f\x9b\x4b\xd2\xb3\x39\x8d\x3b\x8c\x6f\x3c\x5d\x8b\x80\x2c"
"\xa5\x28\x2b\x70\x24\x2d\xf2\xb7\xbe\x4b\x38\xe7\x0c\x30\x65\xf8\xda"
"\x88\x86\x31\x37\x5a\xfc\xc0\x5c\xe5\x78\x08\x9c\x4f\x78\x37\x76\xb2"
"\x86\xb7\xa6\x0d\x1b\x5e\x18\x9e\x27\x42\xa3\x24\x0c\x10\x36\xa9\x53"
"\xd8\x86\x88\x54\x22\xee\xf0\x14\x13\xc3\x80\x99\xb6\x45\x05\xfd\x5a"
"\x73\x48\x8a\xcb\x4e\x61\x18\x20\x67\x4c\x58\xae\x74\xd6\xc6\x4a\x88"
"\x5d\x4b\xed\xa9\xbd\x79\x03\xbc\xdc\x71\xe3\x71\x1e\x2a\x05\x7c\x0e"
"\xab\x21\x00\xc3\x21\x05\x0a\xb1\x4c\x6e\x45\x3c\x53\x18\x25\x77\xad"
"\x31\x78\x60\x3c\xd9\xaf\xde\x40\xa7\x01\x12\x0e\x9a\x36\x07\x4f\xd5"
"\x82\x42\x8c\x74\xe0\x27\x81\x31\x8e\x6c\x65\x45\x0f\x8f\x02\x0b\xd2"
"\x24\x75\x69\x6f\xe1\x3b\x8c\x59\x26\x0e\x53\xa0\x6d\x16\xea\xbd\x13"
"\x5e\x88\x7a\x0a\x6b\xbc\x8a\xd2\x1b\xe7\x66\x1d\xf7\x6f\xec\x5b\x13"
"\x84\x4f\x68\xb8\xee\xd1\xa7\x37\x97\x13\x73\x8b\xea\xc9\xf2\x3c\x7a"
"\x26\x52\x0e\x19\x79\x7a\x91\x0c\xde\x9f\xb2\x85\x17\x95\x26\x88\x9b"
"\x90\x8b\x7e\xb4\x9b\xb0\x6f\x70\xf6\x27\x1f\xba\x87\x12\xc1\xa4\x26"
"\x9e\xbc\xf4\xb7\xd0\x43\xe9\x24\xe3\xd2\xc4\xc7\x53\xfd\x7e\x54\x7d"
"\x95\x84\x1e\x33\x51\x79\x83\x6f\x76\x42\x4e\x72\x88\x10\xd7\xf3\x2b"
"\x78\x25\x6e\xa3\x0c\x79\xd9\x23\x8a\x65\x88\x42\x6e\x1f\x2d\x4c\x0b"
"\x03\xd5\x60\x5b\xd8\x26\xed\x24\xf0\xf1\x13\x26\xb4\xcf\x95\x86\x32"
"\xb8\x6e\x01\x7a\xa8\x0e\x14\x2d\xb1\x58\x0c\x44\xf7\x6d\x9c\x98\x19"
"\x6f\x3f\x68\x52\xab\x2b\xfc\x6a\x01\xa3\x55\x3a\x13\x0c\x2d\x17\x19"
"\x57\xf5\xa4\x5c\x35\x50\xfb\xbc\x99\x0e\xf8\x74\x2a\x98\xa8\x6b\x28"
"\x0a\x57\xb9\xf1\x98\xff\x43\x6b\xc0\x11\x61\xad\xa5\x0e\x6f\x23\x02"
"\x6c\x32\x54\xad\xf2\x32\x1b\xff\x7e\x20\xaa\x54\x08\x0b\xbb\x57\xd8"
"\xd5\x2c\x6a\x6d\xf6\x10\x77\x06\xa2\xe5\xbc\x6d\xa6\x8f\x17\xb4\x74"
"\xc0\xed\xd3\x94\x01\xd7\x65\x08\x6e\x88\x5c\xf7\x99\x24\x05\xf8\x56"
"\x55\x79\x15\x60\x3c\xbe\x88\x94\x67\x6e\x99\x6b\xba\xdb\xb6\x49\xa5"
"\xe7\x49\x8b\x91\xf9\xbd\x2f\x69\x7d\xd9\xeb\xbe\x4d\x38\x60\x50\x25"
"\x8b\x9f\x4c\x94\x78\x1e\x61\xc6\x60\x65\x1c\x3f\x1e\x3a\xe5\x1f\x8c"
"\x03\x5e\xca\x36\x5b\xf1\x5d\x6d\xb4\x8e\xa9\xce\x18\x35\x15\xf4\xa2"
"\x08\xd0\x10\xf7\xc2\x3d\xca\xcb\xd6\xe2\x25\x49\x0d\x7e\x9c\x13\x35"
"\x25\xf5\xc9\x01\x8d\x75\x2b\x21\xb4\x89\x7b\xf1\x8b\x64\xb6\xa9\x93"
"\x6f\x53\x8a\x0a\x89\x58\xfc\x93\x44\x40\xae\xea\xad\x2b\x68\xac\x84"
"\x4d\x76\xf0\x90\x0a\x6c\x95\xbd\x0b\x35\x3d\x85\xd4\xfb\x62\xeb\x88"
"\x36\x01\x12\x23\x7f\xd8\xc6\x36\xa8\x0e\x31\x30\xb2\x1d\x66\xae\x8e"
"\xc5\x8a\x4b\x76\xcb\xa0\x60\x2f\x96\xda\x91\x9f\x7e\x84\xfd\x37\xe3"
"\xec\x23\x79\xf5\x8e\x38\x9a\x39\xc7\x8d\x24\x82\xe0\x3c\x37\x9e\x3c"
"\x46\x49\xad\x63\xa7\x6e\x37\x07\xec\xff\x07\xd2\xfc\xb0\xc9\xdf\xc5"
"\x24\xca\xb4\x9e\x69\xa0\x9c\x92\xe4\xf8\x87\x14\x33\x5c\xb5\x7d\x3f"
"\x61\x84\xd0\x7b\xef\x96\x57\x28\x0f\xb5\xc9\xfd\x2d\x8f\x94\x0f\x7a"
"\xc6\xc5\x40\x7e\x30\x77\xaa\x2e\x4b\xa8\xe2\x17\xe0\xee\x19\xe3\x02"
"\xd6\xd9\x0e\x3b\xe0\x5a\x86\xda\xde\x35\xd2\xe4\x54\xe5\x11\xaf\xb5"
"\xcf\x59\x36\xf1\xd1\x1f\x2f\xa6\xbe\x6c\xea\xa8\x17\xdb\xdc\x7a\x6a"
"\xab\xf2\xfa\xd8\xff\x3e\xfa\x83\x82\xa2\x50\x99\xf0\xc5\x98\x9d\x2a"
"\xd5\x6a\xe0\xf4\x96\x8b\x2c\xfc\xfc\x67\xb4\xf1\xc1\x61\xc7\x59\x00"
"\xb4\x84\x8f\x59\xa3\xc0\x37\x6d\xfc\xb7\x99\x7b\xf2\x8e\x9e\x85\xd6"
"\xdd\x94\x2a\x36\x05\x16\xde\x38\xe1\xc1\xa0\x38\xa7\x96\xf9\xa7\x7f"
"\xf2\xb0\xc7\xe5\xe8\xf4\x93\x23\x91\xa0\xe5\x8e\x76\xda\xcc\x6f\x97"
"\x64\x17\x8a\x21\x1d\xfd\xe3\xe7\x5d\x36\x7d\x29\x11\xff\x39\x81\x26"
"\xff\xdf\x83\xcf\x2f\xbd\xf1\xad\x52\x32\xbe\xd9\x15\x5f\x7a\x16\x86"
"\x38\xa5\x72\x09\x4a\x9e\x93\x4d\x49\x69\xb3\x58\xcf\x6e\x12\x1d\x7f"
"\xd2\xae\xae\x2f\x49\x90\x68\xb4\x2c\x15\x2f\x0e\x34\x03\xa2\x30\x88"
"\x5d\x6f\x92\xf0\x38\xdd\xaa\x23\x49\x9f\x80\x4f\xfb\x06\xab\xdb\xab"
"\xb5\x1f\x6c\x38\xc9\x2f\xb1\xa6\x27\x1a\x4b\x13\xd6\xd1\x11\x25\xb8"
"\xec\x12\xef\xa5\x90\x7d\xc6\x50\x62\x79\x7f\xb9\xcc\xa1\x5e\x2f\x25"
"\x4e\x76\xb1\x82\xd3\xfc\xdb\x4e\x96\xac\x4d\xe3\x6d\x6d\xf7\xe7\xbb"
"\xa5\xc3\x2f\x42\x22\x86\xb1\xbe\x3b\x79\xbf\xfb\x6f\xd6\x93\x76\x19"
"\x52\xd1\x95\xa8\x4a\xd9\xce\xb0\x72\x87\xa0\xfb\xef\xab\x9e\x03\x47"
"\xb5\x13\xc5\xf6\x02\x33\xcc\xd4\xb5\x2d\x90\xec\x14\x4a\x2f\x89\x6d"
"\x9d\xc7\xf2\x79\xf8\xaa\x93\x03\x8f\x3e\xfa\x28\x6e\x1c\x30\x06\x93"
"\x3a\x4d\x71\x83\xd9\x52\xf8\xd2\x8b\x14\x1b\x28\xb2\xaf\x35\x5b\x5b"
"\xd8\x19\x8d\xfd\xe1\xff\xb8\xd0\x92\x02\xaf\xf0\xd1\x6c\xa3\xfe\xc1"
"\x94\x66\x28\x92\xa4\x9f\x82\x98\x13\x97\x0a\x45\x20\xf1\x22\x8a\xa0"
"\x3d\x21\x1a\x45\xbe\xd3\xb2\xe0\x5b\xf1\xf1\x0b\x1a\x15\x27\x61\xe7"
"\xb6\xc6\xdd\xea\x86\x3a\x3c\x02\x22\x42\x56\x09\x2c\x70\xca\x70\xdc"
"\x18\x5c\x4c\x38\x5d\xd9\x8b\x09\xe2\x68\x26\x61\xe1\xe6\x6f\x71\xd9"
"\xc4\x03\x70\x48\xeb\x70\xe8\xa1\xcb\xe5\x7d\xe8\x7e\xc4\x37\x13\xab"
"\xf5\xfd\xcf\x63\xb9\xc4\x82\xf3\x18\xe3\xbe\xc3\x7e\x87\x8d\xad\xba"
"\xe1\x5a\x02\xd7\x31\xe6\xc8\x57\x4e\xb1\x4c\x05\x9d\x72\xf7\x3b\xe5"
"\x17\x4a\xdd\x78\x6d\x06\xb5\x85\xa2\x8a\x06\xd3\x49\xd8\xe4\x34\xa4"
"\x91\xb3\x48\x97\xb3\xc1\xad\x78\x6e\xc8\x28\x0d\x7f\x57\xed\xd4\xfb"
"\xc6\xae\xa5\x48\x5d\x65\x9b\x59\xd3\x93\xe3\x31\xcf\x91\xe6\xed\x76"
"\xf3\x40\xfc\xf7\xcf\x46\x08\x92\xfa\x73\x18\xfc\x42\xb8\x83\xf6\x1d"
"\x88\x8a\xd9\x82\xa7\x51\xac\xcb\x61\x3c\x66\x66\x1f\xba\x5f\x3d\x6d"
"\xe7\x51\xa6\xa9\xef\x8a\x47\x00\x31\x6a\xaa\xd0\x4e\x99\x1a\xab\x79"
"\x03\xf4\xef\x01\x2e\xc2\xa8\xc0\x92\x23\x4e\x74\xef\x33\x5d\xaf\x36"
"\x0a\xe4\x7b\xbd\x2b\xbc\x6a\xd8\xc1\xa4\xf8\x1e\xfe\x8b\xbd\x70\x3c"
"\xb5\x5e\xf3\x6b\x32\xb4\xe3\x0c\xb5\xa3\xb1\x65\xc0\x2b\xa2\x95\xd0"
"\xe1\xc4\x0c\xe6\xff\x8f\x47\x9a\x74\xf0\x12\x75\xf1\x13\xeb\xfa\x8a"
"\xde\x37\xa5\x9c\xe7\x0e\x6c\xa2\xa6\xf4\x8f\x1b\xe0\x85\xf6\x1b\xf7"
"\x72\xe2\xc2\xda\x52\x3a\x2c\xfe\x63\xe9\x9c\x57\xbd\xb1\xff\x23\x13"
"\x9d\x4f\xca\x49\xef\xf7\x54\x7e\x98\x80\xee\xfd\x3f\x75\x11\xa6\x77"
"\xef\xa2\x3b\x52\x09\x8b\xa8\x90\x37\xc4\x8d\xfc\xda\x2e\x8c\x1c\xfb"
"\x9f\x89\x21\x61\x04\x9e\x53\xf8\xce\xe5\x52\x56\x27\x95\x12\xae\xca"
"\xb8\xc4\x41\x60\x0d\xae\x0f\xd9\x57\x88\x32\x73\x04\x7c\xf5\xc6\x6b"
"\xa2\x09\xf8\x30\xaa\x2c\xe0\xcb\xe4\x1c\xa0\x8c\x0c\xef\x4a\xed\x7f"
"\x43\x24\x00\x92\x00\x66\x1a\x7c\xe6\x80\xe5\xa8\xdf\x2d\x05\x1c\x1d"
"\x8b\x2f\x63\xd2\x5d\x8d\x74\xd0\x5c\x75\xc4\x6c\x8f\x3f\x24\xd6\x25"
"\x53\x9e\x63\x45\x96\x50\x96\x04\x98\xa5\x4e\xc3\xb1\x62\x25\xbb\xbf"
"\x4d\x39\x30\x00\x9d\xf2\x65\x83\x9d\x72\x61\x1f\x53\x32\xa9\x04\xcd"
"\xeb\xad\xa1\x08\x23\x6e\x44\x14\xa2\x90\x9a\xd0\x1e\xc4\x4b\x9d\x7f"
"\x75\xde\x43\x85\xad\x7c\xa5\x15\x2e\x89\x0a\x09\x19\xb3\x63\x9f\xd1"
"\xbc\xbc\xa3\xb7\x37\xeb\xb8\xd9\xae\x54\x1b\x12\x71\xcf\x21\x66\xba"
"\x15\x83\x0e\x66\xf3\xd3\xaf\xd3\xb7\x54\xa7\xf8\x1a\xd4\xf0\x99\x97"
"\x04\xae\x99\xc1\x14\x90\x7c\x5b\xe4\xa4\x79\x7f\x13\xb8\x05\x64\xf2"
"\x34\x72\x3a\x34\xdb\xe1\x37\xda\xbf\xd7\xfa\x23\x56\x2d\xf6\x79\xf5"
"\x4a\x6a\xb5\x4d\xef\x6d\x63\xde\xae\x98\x44\xf7\x2f\xd7\x3e\xfd\x04"
"\x13\x55\x1f\x5c\x4b\x9e\xe8\x26\xeb\x3b\x7f\xaf\x92\xa5\x9e\xa3\x4a"
"\x16\x72\x3b\x4f\xea\x14\xd1\xc8\x81\x5a\x4e\x2d\x39\xfc\x48\xd1\xdb"
"\xce\x52\x6a\x7c\x53\xf5\xa9\x6d\x0e\xf6\x46\x3a\x0c\xee\x73\xfd\x35"
"\x05\xf5\xc7\x64\xa2\x64\xb8\x3c\x4a\x21\xf8\x0e\x8b\x61\xc8\x2d\x24"
"\x44\x2d\x13\xda\x99\xd1\x8d\xc1\xb2\x53\x8e\x7a\x51\x0f\x60\x93\xd9"
"\xef\x2b\xc5\xcc\x77\x7d\x4f\x98\x41\x1e\x93\x91\x9e\xdd\xfd\x69\xd6"
"\xe2\x0d\x22\x7c\xb6\x1c\x50\xf3\x58\xea\x22\x7f\x4d\xe9\x41\xfb\x08"
"\x0c\x1c\xf6\xb1\xf6\xe2\x55\x33\x76\x8f\xe1\x33\xdb\xfc\x3f\x9d\x29"
"\xc6\x03\xbe\xd3\x8a\xa3\xc5\xaf\x5b\x81\xa7\x06\xb0\x06\x7b\x40\xb8"
"\x8f\x99\x26\x10\xd0\x4c\x7c\xc3\x6b\x8f\x64\x96\x97\xcd\x6a\x93\xfa"
"\xe5\x11\x38\x16\x18\x91\xae\x75\xa7\x14\x77\x80\xfc\x59\xaf\x5a\x6e"
"\x18\xc5\x4f\x9d\x2a\x4f\xe7\xfa\x92\x31\x4b\x39\x9a\xfb\xa9\xa4\x0d"
"\x0c\xc2\x4f\x70\xa2\x59\x3a\xcf\x8d\x17\x92\x15\xe0\x6b\x7a\x9a\x88"
"\x22\x4b\xaf\xcb\x2c\xbf\x60\xca\xf5\xfe\x4f\xf3\x82\x08\xa7\x07\x93"
"\xb5\xdc\x33\xcd\x57\x29\x56\x26\x0e\x1c\x86\x31\x2d\x3b\xa9\xb3\xa4"
"\xb2\xb4\x43\x76\xf2\xe7\x8c\x61\x6a\x6c\x08\x80\xac\x8d\xcb\xaa\x30"
"\xb9\xf7\x61\xd5\x00\xfd\x03\xa8\x51\x8d\xd0\x50\x91\x57\xb1\x84\xa2"
"\xd9\x5e\x0c\xaf\x3f\xfc\x8a\xc2\xdb\x6c\x54\xd8\x0c\x71\xa1\xe5\xb9"
"\xea\x3b\xf5\x10\x71\xe2\x11\x8a\xf2\x04\x12\x3d\xac\xee\xb0\x4e\x4f"
"\x6f\x31\xf3\x2a\x4d\x3f\xbb\x76\xee\x49\x44\x0c\xab\xda\x2c\x12\x1c"
"\x1b\x99\xac\xab\x5b\x87\xce\xcc\x37\xc3\xf9\x06\x6a\xf3\x4a\xb2\x9d"
"\x65\x98\xbb\xfd\x91\x04\x7a\x2a\xc7\xce\x3a\x8f\x30\x27\xff\x5e\x6d"
"\x74\x35\x06\xf1\x61\x08\x72\x78\x89\x6a\x98\xed\x37\x12\x2b\xa2\x08"
"\xb6\x1c\xf5\x4d\x39\x29\x55\x5a\xb0\x6b\x56\x4c\xd5\xe4\xf4\x6f\x47"
"\x55\xa6\xcf\xa2\xef\x2b\x30\xd2\x9e\xa6\x6f\x27\x49\xd4\x06\x0d\x41"
"\x1f\xa9\x16\x0c\x91\xb6\xf5\x5c\xf0\x71\xac\x82\x22\xc6\x31\x3d\xf1"
"\x87\x59\xe2\x95\x8c\xdd\xfe\x3d\xb4\xcb\xeb\x9c\xd3\x9a\xbc\xf5\xf0"
"\xbe\xae\xca\xe8\x43\x78\x13\x99\x5c\xb7\xed\x0b\x87\xd4\x2c\xa9\x42"
"\xff\x72\x45\xec\xe2\x04\x79\x8d\x01\x36\x1c\x5f\x00\x8e\x0d\x82\xbd"
"\xf7\x66\x60\x51\x5b\xc7\x8f\x7f\x8f\x40\x9c\xcf\x68\x61\x4b\x2c\xb5"
"\x0f\x5a\xf2\x61\x56\x61\x32\x6f\xd9\x71\xbc\x57\xee\xea\xde\x60\xea"
"\x90\x6b\x8d\xf1\xcb\x0d\xfa\xfd\x31\x8c\xd2\xc3\x96\x30\x9c\x32\x9d"
"\x04\x69\xca\x19\x2a\xa8\xf5\x1d\x7c\x42\x27\x68\x54\x40\xf0\x73\x98"
"\x32\x55\xba\xf0\x54\xb9\x7b\x9d\x7b\xe1\xd1\x47\x0d\x7e\xab\xd5\xc0"
"\x9b\x21\x16\xb4\xe8\x6b\x05\x67\xb7\xe9\x7e\x08\x87\x17\xa4\xfe\x3d"
"\xbd\xd3\x10\xa1\xc3\x91\x36\xea\x4d\x2c\x47\x49\x20\x01\xf9\x88\x5d"
"\xba\x03\xbf\x97\xe7\xda\x37\x61\x71\xd6\x66\x44\x1c\xdc\x2f\x99\x9d"
"\xb1\x37\x60\x3d\x57\xdf\x32\xb4\x26\x0f\xa0\x16\x5e\x82\x91\x7b\xb1"
"\x63\x1e\xa3\x14\xe7\xa7\x43\x7e\x66\xfc\x68\xce\xf2\x2c\xda\x8f\x45"
"\x6d\x6e\x58\x3f\x6e\x32\x37\xe0\xbc\x79\x98\x7a\x91\x03\xf7\xcf\x09"
"\x18\xe2\x68\x81\xf6\x7e\xa5\x82\xe1\xff\x3a\x49\x17\x75\x99\xd3\x85"
"\xbf\x6e\x42\x57\x2a\x25\x47\x93\x3a\xed\xdb\x82\x65\x30\xe9\xad\xf3"
"\x0d\xd8\x4c\x3a\x7f\xae\x5c\x4c\x26\xf6\xc6\xf3\xa9\xf0\x90\x6d\xec"
"\xd3\x14\xe2\x40\x78\x25\xab\xef\x95\x9c\x54\x16\xd1\x8a\x92\xff\x34"
"\xe6\xc5\x21\xa1\x6e\x8a\x0a\x29\x93\x7c\x77\xd4\xee\x99\xb4\x1d\x53"
"\x0a\x73\x2a\xcb\xe0\xbf\x5d\x27\x4d\xf9\xd4\x96\xb4\x7a\x9a\x62\x45"
"\x46\xbd\xcf\x99\x76\xcd\xe1\x2e\xc9\x89\xcb\x2a\x70\xb3\x3a\x7c\x8a"
"\x3a\x77\x65\x20\x23\x16\x46\x95\xf9\xdb\x30\xdf\xcf\x58\x7f\x0c\xd4"
"\xf7\x3e\x38\x57\x30\xbc\xbd\xd6\x88\xf6\xdc\xb0\x8b\xa0\xef\xbb\x9f"
"\x57\x92\x20\xaf\xef\xa4\xac\xfe\xa5\x22\xe8\x64\xfc\xe9\xb1\x78\x2c"
"\xe9\xf1\x48\x24\xd1\x6e\x9d\x33\xa2\x60\x9c\x23\xba\x3c\x5a\x1a\xf0"
"\x25\x49\x35\x7a\x0d\xcc\x12\xe3\x78\x19\xd7\x78\x02\x17\x62\xcf\x89"
"\x5a\xbe\xac\x11\x25\xb7\x44\xc8\xb8\x22\x5a\x09\x1e\x7b\xe9\xde\xd9"
"\x99\x3c\xfa\x3c\xa9\xab\xb8\x3e\x25\xc8\xf5\x59\x00\x99\x77\xa2\xed"
"\x93\x74\xa8\x96\x19\xfa\xe5\xef\x6d\x16\x4b\xb7\x3d\x24\x20\x04\xdc"
"\x84\x28\xe4\x46\x89\xb3\x3e\xe3\xbb\xe8\x8b\xb4\x96\x2a\xb0\xa3\x2a"
"\x90\xe7\xae\xa0\x44\xf0\x84\x10\x75\x2c\xb2\xd7\xae\xaf\x31\x96\x64"
"\x8a\x3a\x99\x09\x26\x65\xb4\x78\xbb\x39\x4b\x48\xf7\x9b\x36\xdb\x0e"
"\xfc\x7f\x50\xd6\xa5\x17\x9c\x94\x5f\x52\x98\xcf\xaa\xc5\xe5\xde\xa7"
"\x15\x29\x6f\x92\xab\xce\x72\x81\xd4\x8a\x0c\x9c\x6b\x78\x5a\x35\xef"
"\x5f\x16\x97\xc0\x47\xdd\xb2\x54\xfe\x9a\x8a\xb9\xf4\x98\xb0\xc1\xae"
"\x09\xff\xd0\x1a\x3d\x8d\x42\x7f\xee\x7e\x36\xc5\x1e\x0e\x5c\x2f\xee"
"\x22\x45\xfb\x84\x64\x62\x6a\xb5\xc9\x85\x7e\xbc\xe9\x1f\x7d\x22\xbf"
"\x02\x4d\x10\xc2\xd7\x10\x21\xcd\x69\x26\x84\x72\xde\x41\x9e\x6c\xef"
"\xd9\x70\xcc\x3a\x8e\x4d\x1b\xbe\x64\x96\x79\x9a\xa7\xf1\x00\x41\x17"
"\x66\xe7\x12\xaf\xf0\x8b\x73\x14\x60\xf1\x4f\x9d\x73\x56\xdb\x12\xcf"
"\x8e\x1c\x61\x21\x96\x8d\xc6\x8b\x1d\x81\xc0\x86\xb3\x25\xca\x4c\xe6"
"\xfe\x1f\x47\x67\x07\xe0\x8f\xa9\x13\x14\x4b\x75\x7c\x6b\xe1\x7c\xf9"
"\x31\x50\xdb\x29\x54\x4d\x20\x7f\x09\xa8\x96\xf3\x3b\x73\x35\xd9\x33"
"\x92\x15\xda\x75\x1e\x7a\xf2\xc6\xbd\xd1\x9d\xb6\xf5\x21\xaf\x2c\x8a"
"\x59\x98\xdc\x60\x7f\x97\x02\x6d\x07\x11\x14\x88\x74\x11\x34\xc1\xc8"
"\x6e\xba\x12\x32\x73\xd1\xfd\x5e\xe4\xb4\x71\xe8\x6f\x9a\xe9\x47\x8a"
"\x04\xc7\x48\x20\x76\xab\x34\xa1\xec\xa5\xc6\x4f\x89\xe5\x10\x6e\xed"
"\x44\xbc\xee\xc0\x19\xc6\x7c\x12\xfb\x4d\xb4\xfd\xac\x15\x3f\x4a\xc3"
"\xb6\x3f\xfe\xb6\xd3\x0d\xe5\x8e\xc0\x39\xe2\xdd\x3c\x18\x1e\x25\x4c"
"\xd9\x4d\x0a\x2b\x0b\x44\x49\x03\x84\xcc\x59\x15\xb5\x4e\xe1\xdb\x2b"
"\x6d\x05\x98\x79\xbf\x81\x26\xc9\xca\x97\x6d\x0f\x78\x62\xda\x07\xec"
"\xd3\x50\x93\x0a\x08\x18\x10\xa7\xaf\xd7\x2b\x2a\xd3\xf6\x5b\x96\xae"
"\x9c\x7f\x91\x22\x7a\x2b\x55\x13\xa5\x59\xf3\x6b\x90\xfe\x01\xbe\x9a"
"\xe5\xad\x3c\xa6\x5e\x2c\x26\xf3\x58\xfc\x26\xb8\x58\xa3\x63\x3f\xda"
"\x7a\xe4\x9a\x5f\xb7\x05\x22\x0a\x58\x19\xb3\xcc\xa4\x1b\x1c\xcc\x21"
"\xd7\xc4\x0f\x5f\xa9\xc4\x22\x28\x8e\xfa\x53\x94\xe4\x31\x26\x75\x89"
"\x9d\x70\x4a\x2a\xab\x62\xb8\x36\x3f\x58\xfd\x4b\xc1\x2a\x8b\xea\x6f"
"\xfc\x45\xb4\x41\x42\x37\xbf\x5f\x01\x93\x21\x20\x6d\xbb\xa4\x39\xac"
"\xb5\xef\x26\x64\x1f\x30\xfd\xac\x20\xf9\x64\x35\x4b\xce\x94\xe4\xc9"
"\xd7\x3e\x13\x7f\x98\x06\xde\xef\xaf\x6f\x4a\xca\xa0\xe7\x6a\xd4\xfe"
"\xf9\xf6\xcb\x7f\xc0\x1b\xba\xbd\xa9\x61\x2c\x05\xad\xbe\x46\xaf\xcf"
"\x94\x81\x9e\x8a\x4b\x4b\x49\xff\x76\x47\x84\xfa\x43\x2d\x47\xfb\x6d"
"\x42\x30\x90\x00\x43\xd1\xb4\x52\x1c\xd6\x83\x9f\xe8\xc5\xdf\x4d\x18"
"\x99\xfd\xfb\x13\x88\x0e\x20\x7c\xac\x73\xf0\xa2\x90\x20\xbd\xd5\x63"
"\xbd\x9c\x2f\x6b\xcd\x1e\xc5\x23\xb3\xe0\x3e\xbf\x61\x64\xfc\x65\xaf"
"\x00\x18\x30\xc5\x13\x96\xf9\xdf\x2d\x34\x6f\x83\xa5\x9c\xfc\x82\x20"
"\x1c\xf1\x15\x0e\xa5\x72\x59\xd5\x79\xfc\x2e\xd1\x99\xb3\xfb\xe4\x2d"
"\x51\x88\xc8\x4e\x43\x54\x61\x07\x43\xe5\xb2\x3a\x26\x52\x46\x31\x3c"
"\xc6\x39\x13\xf1\x74\x12\xfa\x00\xd9\x8b\x37\x9b\x80\xb9\x6d\x93\x69"
"\x69\x57\x2e\x11\x31\x6b\xc8\x92\x6c\xb2\x31\x15\x18\x6f\x3b\x23\x87"
"\xb8\x2c\x38\x98\xfa\x41\xbf\x16\xa3\x08\xda\x62\xd5\xa3\xeb\x36\x09"
"\xaf\x19\x43\xfd\xdd\xe0\x8a\x40\x36\xeb\x2a\x41\xb7\x29\x2c\xaa\xd9"
"\xeb\x08\x26\x14\xb0\x2a\x1f\xa2\x55\xbc\x7a\xbd\x4d\x0e\x3b\x4e\xc1"
"\x80\x1e\x13\x1e\x68\xc7\xaa\x9d\xa1\xa0\xff\x10\xf9\xde\x87\xde\xc8"
"\xfa\xd1\xad\x8b\xfa\x99\xca\xa4\x9e\x20\x3a\x7b\x9c\x33\xe0\x44\xd4"
"\x54\x4a\x53\x74\x71\xe7\xa4\x52\x46\x8b\x82\x19\x59\xbc\x48\x8c\x6b"
"\x8c\xbf\x81\xe9\x00\x81\xa2\x6d\xe2\x73\xad\x12\x03\xcc\x06\xad\xb6"
"\xaf\x24\x2a\xb1\x9f\x96\xc1\xc6\x6b\x58\xc3\x7e\x2c\x93\x09\x70\x4f"
"\xba\x63\xaf\x99\xa8\xd9\xc5\xef\xc6\x51\xaf\xb6\x31\xfe\x9f\x54\x6b"
"\x93\x8c\xc3\xb8\xe5\x26\xc4\x15\x9e\x5c\x9f\x7a\xfb\x29\xfd\x1d\x55"
"\xfa\xbf\x09\x36\x7c\xe2\xa6\x3a\x35\xe7\xa2\x06\x2d\x1c\x77\x2e\xd9"
"\x81\xfd\x77\x15\x7a\x84\x7f\x68\x7a\x17\x7c\xf9\x88\x6c\xe4\x1d\xf8"
"\xcc\x50\x93\x02\xb4\x6b\xc1\xe2\xba\x89\x6b\x1c\x16\x56\xa1\xbb\xfd"
"\xf4\xcd\x9a\xc3\x9c\xf8\x51\x0d\x1c\x82\x30\x75\xf1\x65\x50\xfd\x04"
"\x4a\xac\xc8\xd4\x2a\x56\xf0\x37\x18\xf7\xb1\x84\x75\xcd\xc3\x99\x9f"
"\xae\xb2\x5a\xb3\xdd\x8a\x80\x7e\xe0\x4d\x8e\x5d\x83\x1d\x08\xb4\xe3"
"\x09\xdf\xf5\x03\x30\x68\x51\x38\x79\x7e\x10\xc6\x36\x26\x36\xf5\x3f"
"\x22\xbf\xc1\xf3\xd5\x09\x0a\x5d\x36\x92\x82\xd9\xde\x36\xbb\x4e\x25"
"\x05\x41\x1c\xcc\x6e\xa3\x95\xaf\xa1\x56\x7b\x15\xa2\xfb\x4b\xe2\xad"
"\xee\xa7\x12\x6b\x1a\x8e\x80\x03\x41\x05\xe0\xd9\x8b\xdd\x78\xe7\x96"
"\xce\x1c\xdc\x06\xa4\xae\x66\x6f\xc0\xba\xec\x5c\x52\x61\x43\x40\xed"
"\x99\x76\x73\xe2\x6e\xc4\x7c\x88\x84\x6c\x00\x0b\xb7\xc9\x07\x73\x37"
"\xcd\x44\xf5\xc0\x41\xfd\xcc\x64\x98\x6e\x5e\x1c\x0f\x48\x81\x48\xf0"
"\xee\x6f\x84\x2c\x44\xc0\xb7\x2e\x82\x10\x92\x70\x34\x1b\xba\x6e\x90"
"\x80\xb7\x0f\xcf\x93\x0d\x0f\x10\xbe\x5a\x36\x79\x8e\x70\x11\x1f\xed"
"\x72\x72\x7b\x72\x28\x2f\xf1\x64\xfc\x08\x31\x9d\x74\xf1\xf5\x7c\xde"
"\x71\xb5\x7c\xb3\x97\xa9\xe7\x53\xf8\x7b\x97\x72\x9b\xaf\xba\x01\x7a"
"\x24\xcb\xfd\xee\x5d\xfe\x7f\xc2\x96\xc1\x12\xe9\x3b\xb8\xfc\xe5\x60"
"\xca\x80\xa3\xaf\xd8\x37\x0b\xaa\xa7\x9a\xd7\x83\xb5\x13\x52\xb5\x44"
"\x0b\x14\x4a\x47\x37\x8c\x9a\xe2\x2e\xda\x57\x94\x32\x8e\x95\xbc\xca"
"\x22\x0f\xd0\x7b\xb5\x69\x15\x52\x9b\x15\x5c\x61\x85\x8e\xfe\x89\xad"
"\x36\xa7\x92\x88\xe7\x4c\x0e\x25\x1a\xdd\xcf\xaf\x79\x74\x32\x17\x5a"
"\x55\x62\xb4\x6e\xff\x5e\x3a\xeb\xeb\x74\x62\x3e\x18\xbe\xef\x85\x38"
"\x93\x83\xc6\x04\xd8\x88\x44\x31\xb0\x7d\xc4\xbe\xa0\x17\x4a\xad\xc3"
"\x37\xff\x41\xf5\x58\xa6\x3f\x16\x69\x0f\xea\xe4\x7e\xfa\x2a\x5d\x13"
"\x18\xb7\x39\x7e\x1e\x4b\xa3\x98\x72\x7d\x28\x67\x91\xb7\x16\x10\xe1"
"\xd7\x8d\x32\x80\x0e\x7e\x11\x3c\x12\xab\xf0\xf6\x0b\x6c\xa4\x40\x1e"
"\xcd\x23\xb7\xaa\xcd\x99\x06\x33\xb2\xb0\x17\xda\xf6\xbf\xef\x1b\x23"
"\x61\xec\xe7\x4b\x7d\xbc\xbb\x1a\x73\xd4\xbc\x1f\x9d\x2e\x5c\x9f\xb0"
"\xb7\x98\x0d\x25\xcc\x44\xd1\xb1\x0c\x09\xef\x5a\x6a\x05\xc8\x46\x69"
"\x29\x4a\x5c\xad\xf0\xcd\x88\xab\x44\x9f\x9f\x0b\xcd\xd8\xc4\x85\x90"
"\xd4\x16\xc5\xc1\xfe\xaa\x49\x4a\x21\x45\x94\x9c\x2a\x33\x73\xdf\x7c"
"\x60\x14\x22\x5f\x27\x45\xbb\xeb\x20\xff\x29\x4d\x22\xc0\xd9\x6c\xa1"
"\x11\xe6\x92\x69\x46\x20\x7c\xab\x56\xa0\x31\x62\xa4\x9e\x68\x96\x8e"
"\x39\x8f\x70\x69\x01\x88\xee\x3c\xa8\x47\xef\x42\x17\x42\xd6\x0b\x9a"
"\x6a\xd0\x29\xe8\xa3\xd6\x07\x95\x0b\x2b\xf8\xad\x8f\xf2\x97\xcb\x39"
"\xac\xc9\x49\x05\x63\x57\x70\x43\x6e\x13\x44\x35\xe2\x82\x05\x14\x03"
"\x31\xb5\x10\x0d\x9f\x64\x46\x97\x92\xff\xfa\xc8\x7b\xca\x08\x35\xcb"
"\xc6\x17\x44\x6f\xf8\x6a\x7b\x50\x41\x8c\x30\x5f\x32\xe6\x58\xb3\x21"
"\x30\xe4\x91\xe3\x87\x09\xfd\x36\x97\x01\x7a\xc8\x08\x4c\xdf\x1e\xd8"
"\x1a\x28\x37\x5a\xed\x09\x2a\xb4\xe3\x2c\xa8\x8a\x93\x31\x54\xdd\x3a"
"\x9e\x99\x35\x1a\xcb\xad\xa9\x26\xb6\x7b\x31\x0c\x70\x70\xac\x1a\x41"
"\x4a\x28\xc5\xab\xfe\x1f\x45\x47\x62\x49\xa1\x2f\x18\xca\x2d\x98\x15"
"\x28\xd8\x81\xed\x3c\x50\x72\xe4\x6a\x6e\xff\x3c\xdf\x37\xdc\xbc\x89"
"\xc7\xf7\x9c\x88\xa1\xf8\xd1\x5d\x15\xbe\xb6\x6a\x0e\x44\x40\xc7\xb9"
"\x3e\x37\x9c\x4e\x2b\xac\x1d\x5c\x8e\x85\xf1\x85\x28\x87\xe2\xcf\xeb"
"\x17\x8f\xba\x1c\x67\xdc\x2a\xdb\x0c\x87\xdf\x8c\xa4\x44\x4c\xa7\xf4"
"\x55\x50\x9f\x49\x2e\xff\xb5\x00\x13\x28\xb8\xcc\x69\x6e\x29\x33\x20"
"\x7a\x2d\x78\xbb\xce\x85\x62\xca\x34\xa2\x48\x19\x3c\x91\x44\x06\xb1"
"\x61\xc8\x14\x14\x79\xd8\x91\xb0\xc6\x11\x0e\xc1\xe2\x5c\xad\x38\x29"
"\x9b\x48\x9f\x2e\xc4\x37\x01\x7c\xad\xba\x67\xdc\xb5\x8a\xbd\x49\x33"
"\xc9\x5b\x35\x26\xf1\xd4\x74\x7b\x87\x01\xa7\xd7\x1e\x44\x6e\x4b\x62"
"\xe2\x94\x1d\x42\x81\xfa\xca\x0c\xf2\x29\x14\xbe\x5a\xad\x80\xf4\x71"
"\x00\x00\x00\x00\xce\xb2\x4e\x82\x50\x8f\xe5\x5a\x92\xfb\x6d\xb7\x0d"
"\x03\xd1\xc1\xec\x09\xcf\xee\x31\x63\x93\x41\x75\x6a\x46\x30\xa0\xea"
"\xae\xca\xc7\xbf\xbd\xdf\x9d\x30\xc4\x2c\xbd\x45\xeb\x18\x1d\x5b\xd3"
"\x41\x30\x7a\xd2\x6f\x49\x6b\xb0\x42\xe2\xb6\x55\xc0\x3a\xc3\xdc\xc5"
"\x87\xac\xbf\x50\xf7\x9b\x5c\x23\x9b\xe9\x93\x8b\x62\xd3\x25\x1b\x19"
"\x9f\x84\x13\xb0\x20\x60\x5d\x5d\x05\x52\xcf\xd9\xc3\x9c\x91\x32\x71"
"\x9d\x6d\x0a\x32\x6b\x00\x0e\x12\xfc\xb5\x1b\xc2\x74\xdf\x79\xd1\x14"
"\x30\x06\x0d\x05\x97\x8c\xdd\x50\x58\x3f\x1b\xca\x82\xc5\x7d\xbe\xe6"
"\x05\xe2\xd0\x0f\xcb\x54\x14\xaf\x13\xa5\x96\xd3\x5c\xb5\xba\x62\xde"
"\x6a\x28\xcb\xcc\xc8\x57\xd2\x35\x47\xb1\xc7\xfd\x5a\xc8\xfb\xf6\x75"
"\x8d\x5b\x84\x51\xfa\x46\xd9\xac\xc0\x03\x44\xdc\x2e\x56\x56\x74\xb1"
"\xdd\x35\x47\xeb\x8f\x8a\xa5\xff\xf9\x90\x42\xf8\xd1\xd5\x9e\x6a\xd2"
"\xf5\x33\x79\x21\x1e\x68\x32\xfc\xb6\x8f\x57\x77\xeb\x2d\xb8\x5b\x28"
"\xf7\x24\xf4\xe4\xce\x63\x42\xcf\x55\x71\x3f\xf7\xb0\xcb\x4f\x7f\x47"
"\xdd\x12\xa6\x56\x6b\x86\x70\x9e\xae\xfa\xe0\x24\x37\x32\x67\xce\x72"
"\xa8\x9e\x7f\x3e\x42\xab\x48\xed\xcc\xcc\x96\xb5\xd0\x40\x3f\xe9\x3a"
"\x92\x7e\x5c\xcf\x47\x00\x14\xf2\x20\xb8\x25\x73\x93\x22\x6c\xd7\xb9"
"\x96\xf2\x0e\x6a\x34\xf8\x12\x06\x73\x3a\x9f\xdc\xe0\x3b\x70\x19\x43"
"\xc1\xb5\x60\xd3\xea\xb6\x8c\x2c\x22\x5c\xf7\xf7\xf2\xb5\x61\x23\xbe"
"\x2b\xb1\x73\xe9\xe5\xb3\x7f\x4d\x33\x48\xf6\xb9\x87\x76\x4a\xd0\x7c"
"\x2a\xcd\x44\x51\x4f\xf2\x64\xd7\xed\xa3\x1e\x5e\x51\x7a\x17\x94\x14"
"\x84\x1a\xd4\x55\x3d\x51\xc0\x8f\x43\x5e\x05\xf1\x0a\xa8\x2d\x74\xb9"
"\x7a\x9b\xa3\xa1\x33\xe6\xc9\x17\x5f\xdc\xd4\xf3\xdc\x9c\x16\xd3\xbe"
"\x1d\x5b\xba\xf1\x32\x40\x17\x70\x81\xac\x1d\x56\x68\x1b\xfa\x98\x8a"
"\x93\xaf\x09\x86\x8a\xfd\x60\x85\x20\xc0\xbf\xd7\x1d\x85\x7a\x66\x61"
"\xfd\xaf\x6f\x2e\x16\x69\x87\xeb\x00\x74\x49\xdd\x26\x33\x4a\xe9\x32"
"\xc5\x00\x3f\xef\xc0\xf9\x83\xb9\xe4\x9c\xbf\xce\xa3\x25\xf2\xde\x16"
"\xa9\xae\x93\x5c\xaa\x46\xf5\xb3\x43\x39\x57\xfb\x37\x09\x71\xed\x95"
"\x7f\x13\x8f\x08\xa6\x0f\xed\x5b\x84\x99\x5e\x42\x8e\x7a\xe7\xd5\xc2"
"\x20\x21\xff\x01\x6b\xae\xf0\xe7\x13\xa1\x18\x34\x4c\x01\x6a\x99\xad"
"\x46\x93\x13\xba\x7f\x24\x52\xda\x0d\xd8\x2e\x01\x9f\x64\xaa\x22\x9c"
"\xf8\x0a\x69\xb3\xe0\x8a\xc5\x84\x7f\x10\xd2\x47\x17\x98\x55\x54\x63"
"\x13\x23\x2f\x23\xe0\x55\xc2\xf7\x4e\xce\xf1\x4e\x0f\xdc\xc2\x9a\x9b"
"\xf0\x97\x6f\xbb\x24\x9b\xd5\xc7\x90\x31\x83\xd2\xa5\x3c\x70\x96\x0a"
"\x18\x36\x30\xe7\xd4\x92\x8d\xaa\x70\x91\xa8\x5a\xd9\x87\xd2\xa4\xa5"
"\xb8\xf6\xbe\x66\x12\xfa\x72\xd9\xfb\xb3\x3c\x67\xbb\x38\xef\xf1\x9f"
"\x2e\x78\x4f\x94\xe0\x35\x4c\xf6\xd3\x5a\x5b\x2c\x62\x23\x3c\x03\x9d"
"\xe3\x73\x4b\x38\xe9\x7e\xc7\x2b\xd6\x73\xfe\xf0\x9f\xd5\x6f\xec\x32"
"\x98\x18\xcc\x68\xcd\xf1\x2c\xb5\x2f\x7d\x37\xa8\x35\x0c\x16\xe9\x42"
"\x08\x88\x0b\xfc\xd3\xe8\x95\xd7\xaa\x44\x89\xe3\xdd\x15\xdb\x4a\x90"
"\x26\xf0\xd2\xa4\x6f\x1e\x89\xc3\x58\x45\xdb\xd9\x76\xa1\x99\x2b\x87"
"\xc1\x5a\x0c\x75\x80\xe6\x42\x4b\x87\x92\xa7\xbb\x7b\x93\x3d\x7c\x54"
"\x33\xd4\x13\x3b\xa4\xdb\xbc\xf7\x99\x5d\x6e\xd3\xfe\xaa\x32\xf8\x76"
"\xa2\x87\xfe\xeb\x9c\xc6\x10\x77\x78\xc1\xf8\x3e\x01\x19\xd9\x80\xb9"
"\xe9\x94\xc2\xa3\xae\x3d\xe2\x4a\x10\x3e\xfb\x3c\xac\xb7\x46\xb4\x9d"
"\x1a\xd8\x57\x46\xb2\x33\xab\x4a\xaf\x0e\x98\x8e\xc2\xa7\x86\xbc\x93"
"\xf3\x20\x40\xd3\xbd\xc3\x00\x80\x31\x63\x4c\xdf\xde\xd5\xac\x95\xb2"
"\x27\x9e\x09\x62\x43\x22\x82\x96\x59\x1e\x7b\xa5\x3c\x4a\x12\x77\x72"
"\xcc\x46\x20\xe6\xb2\x38\xcc\xad\x25\x06\x29\x19\x45\x33\xd0\xa6\x69"
"\xff\x33\x66\xc5\x2d\x64\x92\x86\x93\xe0\xb0\xcb\xb0\xb8\xe2\xc6\x02"
"\x90\x89\xd4\xdf\xe2\xb4\xb6\xc5\xdc\xd8\x5f\x1a\x02\x77\x06\x11\xe6"
"\x50\x01\xe4\x8a\x32\xa8\xb0\x43\x1a\x3b\x9d\x77\xfa\x3a\x95\xbe\x38"
"\xa0\x43\x6a\x70\x4c\x05\xa8\xe0\x18\x3f\x32\x14\xc2\x55\x31\xa6\x37"
"\x96\xf6\x79\xbf\x72\x88\x5a\xa7\x66\x46\x8d\x42\xb2\x54\x35\x42\xd7"
"\xe8\x25\x44\xef\xc5\xc5\xe8\x1e\x6a\x91\xa0\xf5\xd4\xe6\x80\x00\xcf"
"\xf6\x87\xd6\x3e\x45\xc9\xa1\x1d\x4e\xf5\x15\x05\x0d\xaa\x59\x2c\x9a"
"\x82\x8a\xc7\xc0\x48\x8e\x7c\xdb\x3d\x6f\xda\xef\x5e\x91\x76\xee\x68"
"\xd9\x81\xea\x50\xd3\x86\xd7\x4d\xf3\xb4\x06\x60\x35\x17\x36\xde\xb0"
"\x3b\xfc\xeb\x72\x18\x78\xcf\x98\x94\xb0\x30\x2d\xf1\x59\x64\x24\x2a"
"\xb6\xb9\xf7\x7f\x98\xba\x1c\x79\x93\x73\x59\x83\xd2\xb0\x22\x60\x0a"
"\xb7\x4a\x19\xe3\x63\x6e\x14\x00\xd0\x8b\xa4\x5d\x3a\x5c\x27\x74\xcb"
"\x06\xa1\xc3\x58\xbb\xfc\x11\xd2\x7e\xfa\xf7\xca\x53\xc2\xe7\x75\x7c"
"\x8c\x76\xda\x24\x70\x7d\x91\xa4\xa5\x24\x42\x62\x89\x8d\x68\x08\x3f"
"\xf9\x1c\x51\x4d\x9b\x9b\x1e\xba\xa0\xcb\x0b\x10\x25\x4f\xda\x1b\x1e"
"\x82\xb9\xa1\xa4\x7f\x11\x7b\x5b\x28\x0d\xdb\xec\x1f\x67\x32\xd1\x11"
"\x17\xef\x1a\x7a\x67\x46\x99\xdf\x87\xfe\x79\x5d\x12\x43\xcb\x9c\x45"
"\x27\xe3\x64\xe2\xb7\x11\xb6\x56\x2a\x87\xfa\xfc\x13\x0c\xe0\xba\xf1"
"\x70\x16\x86\x63\x9b\x05\xf0\xc8\xdc\x70\x8f\x00\x8b\x1e\x6a\xb8\x9e"
"\x8d\x62\x3b\xb8\x3f\x3d\x54\xb7\xbc\xdb\xda\xcd\x05\x5a\xc4\xec\xcb"
"\xd3\x6b\xbe\x0a\xf0\xf6\x5a\x00\xe3\xd6\xdd\x98\x5a\xe8\x85\x1d\x17"
"\x69\x76\xcf\xb5\x81\x6d\x1f\xc2\xa6\x3d\x35\x46\xae\xca\xa4\xe7\x12"
"\xca\x69\x61\xd1\xf1\x81\x31\x5d\x55\x3d\xe6\xb5\x34\x85\xfa\xed\x0d"
"\xcf\xcf\x81\x9a\x1b\xa3\xba\xdf\xfe\x79\x73\x77\xd3\xd1\xdd\xae\xd8"
"\xe7\xa0\xac\xc0\xc3\xd2\x77\x76\x22\x62\xa1\x39\xf9\x4d\xe4\x9f\xac"
"\xa1\x67\xb1\x1b\xf0\x4f\x21\x04\xa5\xab\x9a\x73\x36\x7a\x64\x61\xf7"
"\x12\x4c\x91\xa2\xc4\x22\x9e\xf9\x8e\x6e\xbd\xe9\xaa\xc2\x83\xc7\xd0"
"\x29\x40\x0d\x71\x29\x3f\x48\x8b\xa1\x69\xb6\x2c\x1e\x94\x68\x9c\xf5"
"\xb2\x48\xed\x4a\xea\x62\xb8\x8d\x65\xbb\x76\x4c\xfe\x27\xd5\x23\x1a"
"\x58\x48\x6e\x73\x81\xdf\x51\x8f\x4e\xd8\x1c\xb9\x05\x10\x8c\x54\xa5"
"\x05\x0a\x94\xca\x0e\x94\xda\x20\xd3\x79\x4b\xc5\xfa\xb9\x12\x7d\xc9"
"\x5b\x64\x04\xb1\xe2\x7b\x4e\x28\x13\x6f\xc2\x78\x06\xf7\xbe\x79\x84"
"\x44\xc3\x3a\xca\x88\xff\xd4\x5b\x86\x0e\xba\x0d\x50\x33\x83\x9f\x5a"
"\x09\x28\x63\x95\x46\x04\xf1\x95\x2b\xd6\x1d\xad\x23\xb1\x16\x43\xfe"
"\x14\xf3\xad\xe0\x81\x16\xaa\x2c\x13\xee\xe7\x01\xcc\xd1\x3e\x50\x6b"
"\xd6\x5a\x10\x60\xbf\x69\x57\x9a\xea\x8c\x81\x43\xcd\x38\xc0\x89\x1a"
"\x30\x65\xf2\x51\xeb\xa0\xc2\x0a\xb9\xc6\x9d\xdf\x28\xe3\xbd\x64\x00"
"\xcc\x20\x3b\xac\x8d\xe1\x88\x22\x39\xad\x4e\x1b\x97\xb0\xae\x2f\x1a"
"\xbb\x7b\xac\x7c\x0d\x8e\xf8\x2b\x97\xeb\xfb\x1f\x55\x77\xf0\x6a\x3a"
"\x13\x77\xb0\x9a\xda\x4d\xb8\x7d\x34\x2f\x20\xab\x0e\xca\x4b\x9c\x20"
"\x60\x42\x47\x13\x07\x51\x14\x29\xcb\x57\xa5\x78\x21\x1f\x92\xd3\x64"
"\x71\x89\x86\x1c\xad\x91\x45\xf5\xeb\x26\xab\x69\x6a\xbe\x50\xa2\xa6"
"\xc1\xb4\x69\xdf\x97\xda\x28\xab\xa4\xe7\x9b\x58\x6c\x34\x8a\x43\x0f"
"\x5e\xa6\x1c\x4b\xe1\x03\x2f\xa6\x1d\x18\x58\x1f\x05\xa0\x7f\xb8\x70"
"\x7c\x89\x96\xe0\xff\xf1\xc3\xed\xa5\x9b\x99\x26\x87\xfa\x12\x48\x3b"
"\x93\x27\xe1\x02\x24\xb2\x0d\x42\xe8\xb3\xfc\x46\x70\xbf\x07\x0c\xed"
"\x60\x22\x83\x27\x3d\x68\x18\xac\xd1\xf6\xda\x56\x7c\x44\xd3\xf5\xe1"
"\x37\x70\x65\xd4\x3d\x87\xd8\x89\x84\x3a\xe4\x8e\x7f\xa8\xba\x16\x34"
"\x81\x56\x95\xb8\xc4\x80\xca\x27\x1e\x6e\x83\x37\x99\xc7\x0d\xa8\x0f"
"\xd7\x9a\xcc\x09\xb9\x89\x66\x7a\x22\x94\xde\x5d\xa7\x3f\x03\x63\xdf"
"\x9a\x33\xad\x4d\xab\x8d\x27\xcf\x7b\xed\x0a\x06\x83\x86\x72\xe3\xd0"
"\x7d\x52\xb6\x39\x6e\x9b\x55\x76\x02\x1d\x5e\x92\x5a\xbd\x53\x3b\xf1"
"\x61\xc9\x44\x79\x50\x65\xfd\xd4\x4e\x84\x62\xe3\x07\x0c\x47\x9f\x1c"
"\x11\x82\x76\x65\x34\x88\xdd\x9b\x2f\x1a\x67\x3f\x8c\xad\x36\x12\xca"
"\x1f\xab\x43\x88\xec\x9c\x8f\x83\x4a\x01\xa4\x99\xad\xb7\xb3\xa9\xa9"
"\x77\x67\x2f\x6d\x75\xb4\x1b\xbd\xd7\xf9\x1c\xeb\x7e\x7a\x88\x56\x8d"
"\x17\xbb\x43\x2b\xe9\xe4\xe9\x6e\x11\x50\x75\xbc\xe1\x97\xef\x47\x54"
"\xd2\x91\x4c\x2c\x59\xe2\xd7\xf4\xc0\x8f\x0d\xbe\x34\xd3\x1f\x22\x94"
"\x28\xf2\x11\xbf\x1d\x7e\x8f\x5c\x31\x9e\xd4\xa8\x27\x3c\xb6\x25\x5e"
"\xb3\x18\x85\x1a\xc4\x55\x7b\x02\x78\xfa\xc6\x31\x07\xa5\x4d\x40\x7c"
"\x42\xf3\x00\xb8\x43\xa1\x2a\xbd\x3b\x89\x3b\x46\xc7\xef\xac\x2e\x38"
"\x8a\xb4\x2b\x87\xae\xbe\x25\x43\xbd\x4c\x15\xf4\x59\xbc\x50\xaa\xd1"
"\x0f\xfe\x1c\x11\x96\xfb\x52\xc2\x6e\x54\xbd\xaa\x7f\xbd\x52\x45\x1f"
"\x20\x7f\xfb\x07\x3e\xf4\xb3\xf7\x1e\xed\xd7\xda\x40\xc8\x95\x05\x01"
"\x97\x39\xe3\xfa\x73\x3b\xcd\xc8\x4f\xf4\x91\x9e\x8f\xe2\x35\x81\x29"
"\xef\x28\x29\x1b\xe1\xd6\x42\x6b\x8b\xaf\xe8\x84\x63\xb1\xd3\xcd\x72"
"\x73\x74\x53\x81\xc7\xf6\x52\x21\x89\x8e\x6a\xd3\x61\xe8\x8b\x24\xc5"
"\x4c\xcc\x7a\xc9\xa8\x30\x14\x5b\x6d\xc0\x96\xe2\xd7\x1e\xf7\x1e\xc4"
"\xf0\x35\x24\xcb\x87\x0b\x72\x4e\x08\xd2\x23\xbd\xec\x2f\x6f\xdd\xe6"
"\x20\x02\x17\xa1\x3b\x51\x36\x00\x4d\x45\x5d\x66\x54\x7f\x5a\x17\x93"
"\xe0\xca\xd8\x56\x77\xd4\x9e\x5c\x55\x88\x52\x10\x70\x07\xc8\x13\x68"
"\x12\xcf\x02\x1a\xfa\xf6\xf7\xe8\xf5\x98\x83\x37\x1b\xe4\x6c\xda\x41"
"\x2d\xd9\xc6\xfc\xf1\x87\xc3\x12\x52\xce\xb5\x75\x89\x01\xd3\x9c\xd5"
"\x35\x5a\xb3\x86\xd9\xa7\xfe\x6e\xa4\x6e\xbf\x27\x7a\xaf\x80\x9c\x30"
"\x23\x21\x1e\xa9\xaa\x18\x9d\xe4\xd4\x22\x08\x0e\xbb\x9f\xec\x50\xff"
"\xab\x6b\x95\xba\x4a\xe5\x01\x8a\xcc\xc4\x97\xe7\x91\x49\xed\x60\x47"
"\xce\x56\x1c\xcc\x10\xe9\x19\x4c\xdc\xcd\x5c\x9f\xb7\x51\x75\xc8\xdb"
"\xc9\xd0\xa9\x16\xad\x59\x28\x8f\x01\x0d\xef\xbb\xb5\x0d\x26\x30\x41"
"\xab\x37\xaa\xc0\xf9\x32\x53\xbe\xf6\xf8\x98\xcd\x08\x25\xd9\x9d\x27"
"\x22\x4f\x26\x18\x1f\x97\x13\xb8\x97\x9d\xa6\x47\x56\xc9\x5e\x75\x05"
"\xf2\x5a\x26\x88\x96\x0d\x61\x55\xc3\x61\x3d\xcc\x31\xb6\xc3\x37\xa6"
"\xdb\xfc\x6b\x12\xcf\xde\x1d\xb2\x2b\x93\xbb\xd5\xe4\x85\x34\xfb\x0b"
"\xda\x8b\x21\x25\x77\xa1\x4d\xcf\x66\x5c\x83\x4b\x0b\xd2\x4e\x5f\x62"
"\x4d\x24\x55\xfe\x04\x8d\xbe\x93\x03\x28\xd7\xcb\x63\x2d\xb3\xb0\xe2"
"\x44\xbb\x5d\x43\x39\x0b\x42\x0b\x15\x15\x7a\x33\x94\x87\xfc\x78\x97"
"\x6f\x86\x7d\x3a\x36\x1a\xaf\xdd\x3f\x50\xa9\x3c\x01\x88\x2d\xa7\xc2"
"\x20\x08\x9a\x54\x43\x81\xdb\x22\xe2\xc8\x6b\x22\x8d\xc2\xbe\x01\x82"
"\x04\x68\x46\x04\x37\x58\x89\x52\xa5\x49\xd3\x74\x98\xe5\x29\xe6\x2a"
"\xa6\x2b\xad\x15\x80\x54\x6b\xcb\x1e\x9a\x6e\xd1\x87\x0b\x78\x38\xd0"
"\x5d\x12\xf6\xe3\xa0\x41\xe7\x8b\x1b\xdb\x80\x89\x46\x26\xf2\x08\x89"
"\xcc\xb3\xa4\x68\xaa\x4f\xb2\x4b\x9c\x87\xcb\xb2\x86\x23\xce\x59\xc6"
"\xb3\xc6\x28\x6d\xb3\x66\xd0\x80\x04\x55\x1a\x25\xfe\x4d\x8d\x19\x4a"
"\x2b\xb7\xc5\x2e\x1c\x85\xa5\xfb\xe4\xcb\x15\xb1\x71\x48\x9d\xa1\x21"
"\xbe\xa1\xc4\x69\xa6\xbb\x18\x5d\x63\x21\x30\x84\xe3\xa8\x1e\xe5\x4d"
"\xc0\x3a\x94\xdc\x5e\xcd\xda\x7b\xfa\xad\x1d\xf6\x80\x21\xaa\xf4\x62"
"\x7c\x9d\x52\x9f\x13\xe5\xc8\x1b\x5e\xe4\xdd\x22\x89\x49\xca\x16\xb9"
"\xa6\x1d\x18\x62\x11\xd1\x53\x29\x44\x70\x90\x75\x57\xe5\xe1\x4a\xe6"
"\x65\x01\x3f\x28\x5f\xe4\xd3\x76\x6e\x7b\x3d\x8c\xe5\xe2\xa1\x46\x92"
"\x07\x2d\x4d\x8f\x79\x35\x4b\xcc\x8d\xb8\xa2\xa3\x6c\x8b\xcd",
8192);
*(uint64_t*)0x200069c0 = 0;
*(uint64_t*)0x200069c8 = 0;
*(uint64_t*)0x200069d0 = 0;
*(uint64_t*)0x200069d8 = 0;
*(uint64_t*)0x200069e0 = 0;
*(uint64_t*)0x200069e8 = 0;
*(uint64_t*)0x200069f0 = 0;
*(uint64_t*)0x200069f8 = 0;
*(uint64_t*)0x20006a00 = 0;
*(uint64_t*)0x20006a08 = 0;
*(uint64_t*)0x20006a10 = 0;
*(uint64_t*)0x20006a18 = 0x200066c0;
*(uint32_t*)0x200066c0 = 0x90;
*(uint32_t*)0x200066c4 = 0;
*(uint64_t*)0x200066c8 = 0;
*(uint64_t*)0x200066d0 = 7;
*(uint64_t*)0x200066d8 = 0;
*(uint64_t*)0x200066e0 = 0;
*(uint64_t*)0x200066e8 = 0;
*(uint32_t*)0x200066f0 = 0;
*(uint32_t*)0x200066f4 = 0;
*(uint64_t*)0x200066f8 = 0;
*(uint64_t*)0x20006700 = 0;
*(uint64_t*)0x20006708 = 0;
*(uint64_t*)0x20006710 = 0;
*(uint64_t*)0x20006718 = 0;
*(uint64_t*)0x20006720 = 0;
*(uint32_t*)0x20006728 = 0;
*(uint32_t*)0x2000672c = 0;
*(uint32_t*)0x20006730 = 0;
*(uint32_t*)0x20006734 = 0x6000;
*(uint32_t*)0x20006738 = 0;
*(uint32_t*)0x2000673c = 0;
*(uint32_t*)0x20006740 = 0;
*(uint32_t*)0x20006744 = 0x801;
*(uint32_t*)0x20006748 = 0;
*(uint32_t*)0x2000674c = 0;
*(uint64_t*)0x20006a20 = 0;
*(uint64_t*)0x20006a28 = 0;
*(uint64_t*)0x20006a30 = 0;
*(uint64_t*)0x20006a38 = 0;
syz_fuse_handle_req(r[1], 0x20000000, 0x2000, 0x200069c0);
break;
case 9:
memcpy((void*)0x20000140, "./file0/file1\000", 14);
res = syscall(__NR_creat, 0x20000140ul, 0ul);
if (res != -1)
r[3] = res;
break;
case 10:
memcpy((void*)0x200009c0, "threaded\000", 9);
syscall(__NR_write, r[3], 0x200009c0ul, 0xd4ba0fful);
break;
}
}
int main(void)
{
syscall(__NR_mmap, 0x1ffff000ul, 0x1000ul, 0ul, 0x32ul, -1, 0ul);
syscall(__NR_mmap, 0x20000000ul, 0x1000000ul, 7ul, 0x32ul, -1, 0ul);
syscall(__NR_mmap, 0x21000000ul, 0x1000ul, 0ul, 0x32ul, -1, 0ul);
loop();
return 0;
}
|
the_stack_data/82951422.c | /*
* POK header
*
* The following file is a part of the POK project. Any modification should
* be made according to the POK licence. You CANNOT use this file or a part
* of a file for your own project.
*
* For more information on the POK licence, please see our LICENCE FILE
*
* Please follow the coding guidelines described in doc/CODING_GUIDELINES
*
* Copyright (c) 2007-2022 POK team
*/
/* @(#)e_remainder.c 5.1 93/09/24 */
/*
* ====================================================
* 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.
* ====================================================
*/
/* __ieee754_remainder(x,p)
* Return :
* returns x REM p = x - [x/p]*p as if in infinite
* precise arithmetic, where [x/p] is the (infinite bit)
* integer nearest x/p (in half way case choose the even one).
* Method :
* Based on fmod() return x-[x/p]chopped*p exactlp.
*/
#ifdef POK_NEEDS_LIBMATH
#include "math_private.h"
#include <libm.h>
static const double zero = 0.0;
double __ieee754_remainder(double x, double p) {
int32_t hx, hp;
uint32_t sx, lx, lp;
double p_half;
EXTRACT_WORDS(hx, lx, x);
EXTRACT_WORDS(hp, lp, p);
sx = hx & 0x80000000;
hp &= 0x7fffffff;
hx &= 0x7fffffff;
/* purge off exception values */
if ((hp | lp) == 0)
return (x * p) / (x * p); /* p = 0 */
if ((hx >= 0x7ff00000) || /* x not finite */
((hp >= 0x7ff00000) && /* p is NaN */
(((hp - 0x7ff00000) | lp) != 0)))
return (x * p) / (x * p);
if (hp <= 0x7fdfffff)
x = __ieee754_fmod(x, p + p); /* now x < 2p */
if (((hx - hp) | (lx - lp)) == 0)
return zero * x;
x = fabs(x);
p = fabs(p);
if (hp < 0x00200000) {
if (x + x > p) {
x -= p;
if (x + x >= p)
x -= p;
}
} else {
p_half = 0.5 * p;
if (x > p_half) {
x -= p;
if (x >= p_half)
x -= p;
}
}
GET_HIGH_WORD(hx, x);
SET_HIGH_WORD(x, hx ^ sx);
return x;
}
#endif
|
the_stack_data/153267154.c | // clockKeeper
// 以秒为单位更新时间的程序
#include <stdio.h>
#include <stdbool.h>
struct time{
int hour;
int minutes;
int seconds;
} ;
// 以秒为单位更新时间的函数
struct time timeUpdate(struct time now){
++now.seconds;
if(now.seconds == 60){
now.seconds = 0;
++now.minutes;
if(now.minutes == 60){
now.minutes = 0;
++now.hour;
if(now.hour == 24)
now.hour = 0;
}
}
return now;
}
struct date{
int month;
int day;
int year;
};
// 计算下一天日期的函数
struct date dateUpdate(struct date today){
struct date tomorrow;
int numberOfDays(struct date d);
if(today.day != numberOfDays(today)){
tomorrow.day = today.day + 1;
tomorrow.month = today.month;
tomorrow.year = today.year;
}
else if(today.month == 12){
tomorrow.day = 1;
tomorrow.month = 1;
tomorrow.year = today.year + 1;
}
else{
tomorrow.day = 1;
tomorrow.month = today.month + 1;
tomorrow.year = today.year;
}
return tomorrow;
}
// 查找一月中日期数的函数
int numberOfDays(struct date d){
int days;
bool isLeapYear(struct date d);
const int daysPerMonth[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
if(isLeapYear(d) && d.month == 2)
days = 29;
else
days = daysPerMonth[d.month - 1];
return days;
}
// 判断是否为闰年的函数
bool isLeapYear(struct date d){
bool leapYearFlag;
if((d.year % 4 == 0 && d.year % 100 != 0 )|| d.year % 400 == 0)
leapYearFlag = true; // 闰年
else
leapYearFlag = false; // 非闰年
return leapYearFlag;
}
struct dateAndTime{
struct time now;
struct date d;
};
struct dateAndTime clockKeeper (struct dateAndTime dat){
struct time timeUpdate(struct time now);
struct date dateUpdate(struct date d);
dat.now = timeUpdate(dat.now);
// 时间过午夜则更新日期
if(dat.now.hour == 0)
dat.d = dateUpdate(dat.d);
return dat;
};
int main(void){
struct dateAndTime clockKeeper(struct dateAndTime dat);
struct dateAndTime dat;
// 使用复合字面量赋值
dat.now = (struct time){23, 59, 59};
dat.d = (struct date){2, 28, 2016};
dat = clockKeeper(dat);
printf("%i:%i:%i: %i/%i/%i", dat.now.hour, dat.now.minutes, dat.now.seconds,
dat.d.month, dat.d.day, dat.d.year);
return 0;
}
|
the_stack_data/55453.c | #include <stdio.h>
/*
Assignment 4
Exercise #1 & Exercise #8
Exercise #1: User enters several numbers one at a time (don't have to be integers).
When user enters 0 or a negative number display largest non-negative number.
Exercise #8: Prints a 1 month calender based on the number of days in the month and the
starting day of the week which the month begins.
*/
int exercise1();
int exercise8();
int main() {
int in = 0;
// Get the exercise to grade.
do {
printf("Enter exercise to run (1=exercise#1, 8=exercise#8, -1=quit) : ");
scanf("%d", &in);
if (in == 1) {
exercise1();
}
if (in == 8) {
exercise8();
}
if (in == -1) {
break;
}
} while (in != 1 || in != 8);
return 0;
}
int exercise1() {
double largest = 0, in = 1; // assign in to 1 so loop starts, this won't be considered in largest calculation.
printf("Running Exercise #1\n");
while (in > 0) {
printf("Enter a number: ");
scanf("%lf", &in); // read input from user
// if in is larger then largest, assign largest to in.
if (largest < in) {
largest = in;
}
}
printf("The largest number entered was %lf\n", largest);
return(system("Pause"));
}
int exercise8() {
int nDays = 0, nStart = 0;
printf("Running Exercise #8\n");
printf("Enter number of days in month: ");
scanf("%d", &nDays);
// place nStart in a loop so we can error check and ensure the number is between 1 and 7.
do {
printf("Enter starting day of the week. (1=Sun, 7=Sat): ");
scanf("%d", &nStart);
} while (nStart < 1 || nStart > 7);
// print a set number of spaces (left justifed w/ 2 places) before the printing of
// calendar numbers
for (int i = 0; i < nStart-1; i++) {
printf("%2s ","");
}
// print from 1 to the total number of days provided by user
for (int i = 1; i < nDays+1; i++) {
printf("%2d ", i); // left justifed, 2 number places
// calculate the end of the week by subtracting 1 from the start provided, adding the
// increment then doing modulo by 7. 0 means we are at the end of the week.
if ((i + (nStart - 1)) % 7 == 0) {
printf("\n"); // print new line
}
}
printf("\n");
return(system("Pause"));
} |
the_stack_data/218893101.c | /*MACRO to test if char is upper case*/
#include <stdio.h>
#define IsUpper(x) (x >= 'A' && x <= 'Z' ? 1 : 0)
int main (void)
{
char alpha = 'X', beta = 'x' ;
if ( IsUpper(alpha) ) //testing alpha
printf("Upper case\n") ;
else
printf("Not upper case\n") ;
if ( IsUpper(beta) ) //testing beta
printf("Upper case\n") ;
else
printf("Not upper case\n") ;
return 0 ;
} |
the_stack_data/72315.c | /* Test options to ignore. */
/* { dg-do run { target i?86-*-darwin* } } */
/* { dg-options "-faltivec -mno-fused-madd -mlong-branch -mlongcall -mcpu=G4 -mcpu=G5" } */
int
main ()
{
return 0;
}
|
the_stack_data/134828.c | #include<stdio.h>
#include<math.h>
void main(){
int floor=10,h=3,u=0,s=0;
float a=9.8,t=0,temp,d;
s=floor*h;
d=u*t;
temp=(2*s-d)/a;
t=sqrt(temp);
printf("Time taken to reach gorund= %f sec",t);
} |
the_stack_data/1123233.c |
int glob = 1;
int num;
volatile void check(int c)
{
++num;
}
int main(void)
{
int a = 0, b = 0;
while (a < 10) {
if (a++ > 0)
// check that we haven't deleted b++ later
test_assert(b > 0);
b++;
}
return 0;
}
|
the_stack_data/92653.c | /*prog0302.c : Testes e Condições
*AUTOR: Lucas Deboni
*DATA: 19/10/2020
*/
#include <stdio.h>
main()
{
int x;
printf("Introduza um Nº ");
scanf("%d", &x);
if(x >= 0)
printf("Número Positivo\n");
else
printf("Número Negativo\n");
} |
the_stack_data/218892289.c | #include <stdio.h>
#include <unistd.h>
int main(){
int pid;
pid = fork();
if(pid == 0){
execlp("ls","ls","-a","/", (char *)NULL);
}
else{
printf("Soy el padre.\n");
}
}
|
the_stack_data/12637363.c |
int main()
{
int n;
int a;
#pragma scop
{
int c1;
if (n >= 1) {
for (c1 = 0; c1 <= n + -1; c1++) {{
a;
}
}
}
}
#pragma endscop
}
|
the_stack_data/182952961.c | /* { dg-do compile } */
/* { dg-options "-O -mcpu=ultrasparc -mvis" } */
typedef char vec8 __attribute__((vector_size(8)));
typedef short vec16 __attribute__((vector_size(8)));
typedef int vec32 __attribute__((vector_size(8)));
extern vec8 foo1_8(void);
extern vec8 foo2_8(void);
vec8 fun8(void)
{
return foo1_8 () ^ foo2_8 ();
}
vec8 fun8_2(vec8 a, vec8 b)
{
return a ^ b;
}
extern vec16 foo1_16(void);
extern vec16 foo2_16(void);
vec16 fun16(void)
{
return foo1_16 () ^ foo2_16 ();
}
vec16 fun16_2(vec16 a, vec16 b)
{
return a ^ b;
}
extern vec32 foo1_32(void);
extern vec32 foo2_32(void);
vec32 fun32(void)
{
return foo1_32 () ^ foo2_32 ();
}
vec32 fun32_2(vec32 a, vec32 b)
{
return a ^ b;
}
/* { dg-final { scan-assembler-times "fxor\t%" 6 } } */
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.