file
stringlengths 18
26
| data
stringlengths 3
1.04M
|
|---|---|
the_stack_data/102263.c | #include <stdio.h>
int calculoArea(altura, largura, area) {
area = altura * largura;
printf("A area calculada da parede é: %i \n", area);
return 0;
}
int main(void) {
int altura, largura, area;
printf("Digite aqui a altura: \n");
scanf("%i", &altura);
printf("Digite aqui a largura: \n");
scanf("%i", &largura);
calculoArea(altura, largura, area);
} |
the_stack_data/162643525.c | /*
* OpenHMD - Free and Open Source API and drivers for immersive technology.
* Copyright (C) 2013 Fredrik Hultin.
* Copyright (C) 2013 Jakob Bornecrantz.
* Distributed under the Boost 1.0 licence, see LICENSE for full text.
*/
/* Platform Specific Functions, Win32 Implementation */
#ifdef _WIN32
#define WIN32_LEAN_AND_MEAN
#define WIN32_EXTRA_LEAN
#include <windows.h>
#include "platform.h"
#include "openhmdi.h"
double ohmd_get_tick()
{
double high, low;
FILETIME filetime;
GetSystemTimeAsFileTime(&filetime);
high = filetime.dwHighDateTime;
low = filetime.dwLowDateTime;
return (high * 4294967296.0 + low) / 10000000;
}
static const uint64_t NUM_10_000_000 = 10000000;
void ohmd_monotonic_init(ohmd_context* ctx)
{
ctx->monotonic_ticks_per_sec = NUM_10_000_000;
}
uint64_t ohmd_monotonic_get(ohmd_context* ctx)
{
FILETIME filetime;
GetSystemTimeAsFileTime(&filetime);
return ((uint64_t)filetime.dwHighDateTime << 32) | filetime.dwLowDateTime;
}
// TODO higher resolution
void ohmd_sleep(double seconds)
{
Sleep((DWORD)(seconds * 1000));
}
// threads
struct ohmd_thread {
HANDLE handle;
void* arg;
unsigned int (*routine)(void* arg);
};
struct ohmd_mutex {
HANDLE handle;
};
DWORD __stdcall ohmd_thread_wrapper(void* t)
{
ohmd_thread* thread = (ohmd_thread*)t;
return thread->routine(thread->arg);
}
ohmd_thread* ohmd_create_thread(ohmd_context* ctx, unsigned int (*routine)(void* arg), void* arg)
{
ohmd_thread* thread = ohmd_alloc(ctx, sizeof(ohmd_thread));
if(!thread)
return NULL;
thread->routine = routine;
thread->arg = arg;
thread->handle = CreateThread(NULL, 0, ohmd_thread_wrapper, thread, 0, NULL);
return thread;
}
void ohmd_destroy_thread(ohmd_thread* thread)
{
ohmd_sleep(3);
WaitForSingleObject(thread->handle, INFINITE);
CloseHandle(thread->handle);
free(thread);
}
ohmd_mutex* ohmd_create_mutex(ohmd_context* ctx)
{
ohmd_mutex* mutex = ohmd_alloc(ctx, sizeof(ohmd_mutex));
if(!mutex)
return NULL;
mutex->handle = CreateMutex(NULL, FALSE, NULL);
return mutex;
}
void ohmd_destroy_mutex(ohmd_mutex* mutex)
{
CloseHandle(mutex->handle);
free(mutex);
}
void ohmd_lock_mutex(ohmd_mutex* mutex)
{
if(mutex)
WaitForSingleObject(mutex->handle, INFINITE);
}
void ohmd_unlock_mutex(ohmd_mutex* mutex)
{
if(mutex)
ReleaseMutex(mutex->handle);
}
int findEndPoint(char* path, int endpoint)
{
char comp[8];
sprintf(comp,"mi_0%d",endpoint);
if (strstr(path, comp) != NULL) {
return 1;
}
return 0;
}
/// Handling ovr service
static int _enable_ovr_service = 0;
void ohmd_toggle_ovr_service(int state) //State is 0 for Disable, 1 for Enable
{
SC_HANDLE serviceDbHandle = OpenSCManager(NULL,NULL,SC_MANAGER_ALL_ACCESS);
SC_HANDLE serviceHandle = OpenService(serviceDbHandle, "OVRService", SC_MANAGER_ALL_ACCESS);
SERVICE_STATUS_PROCESS status;
DWORD bytesNeeded;
QueryServiceStatusEx(serviceHandle, SC_STATUS_PROCESS_INFO,(LPBYTE) &status,sizeof(SERVICE_STATUS_PROCESS), &bytesNeeded);
if (state == 0 || status.dwCurrentState == SERVICE_RUNNING)
{
// Stop it
BOOL b = ControlService(serviceHandle, SERVICE_CONTROL_STOP, (LPSERVICE_STATUS) &status);
if (b)
{
printf("OVRService stopped\n");
_enable_ovr_service = 1;
}
else
printf("Error: OVRService failed to stop, please try running with Administrator rights\n");
}
else if (state == 1 && _enable_ovr_service)
{
// Start it
BOOL b = StartService(serviceHandle, NULL, NULL);
if (b)
printf("OVRService started\n");
else
printf("Error: OVRService failed to start, please try running with Administrator rights\n");
}
CloseServiceHandle(serviceHandle);
CloseServiceHandle(serviceDbHandle);
}
#endif
|
the_stack_data/51701219.c | /*
* Copyright (c) 1982, 1985, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* @(#)errlst.c 8.2 (Berkeley) 11/16/93
* $FreeBSD: src/lib/libc/gen/errlst.c,v 1.9 2007/01/09 00:27:53 imp Exp $
* $DragonFly: src/lib/libc/gen/errlst.c,v 1.3 2005/05/03 07:29:04 joerg Exp $
*/
#include <stdio.h>
const char *const sys_errlist[] = {
"Undefined error: 0", /* 0 - ENOERROR */
"Operation not permitted", /* 1 - EPERM */
"No such file or directory", /* 2 - ENOENT */
"No such process", /* 3 - ESRCH */
"Interrupted system call", /* 4 - EINTR */
"Input/output error", /* 5 - EIO */
"Device not configured", /* 6 - ENXIO */
"Argument list too long", /* 7 - E2BIG */
"Exec format error", /* 8 - ENOEXEC */
"Bad file descriptor", /* 9 - EBADF */
"No child processes", /* 10 - ECHILD */
"Resource deadlock avoided", /* 11 - EDEADLK */
"Cannot allocate memory", /* 12 - ENOMEM */
"Permission denied", /* 13 - EACCES */
"Bad address", /* 14 - EFAULT */
"Block device required", /* 15 - ENOTBLK */
"Device busy", /* 16 - EBUSY */
"File exists", /* 17 - EEXIST */
"Cross-device link", /* 18 - EXDEV */
"Operation not supported by device", /* 19 - ENODEV */
"Not a directory", /* 20 - ENOTDIR */
"Is a directory", /* 21 - EISDIR */
"Invalid argument", /* 22 - EINVAL */
"Too many open files in system", /* 23 - ENFILE */
"Too many open files", /* 24 - EMFILE */
"Inappropriate ioctl for device", /* 25 - ENOTTY */
"Text file busy", /* 26 - ETXTBSY */
"File too large", /* 27 - EFBIG */
"No space left on device", /* 28 - ENOSPC */
"Illegal seek", /* 29 - ESPIPE */
"Read-only file system", /* 30 - EROFS */
"Too many links", /* 31 - EMLINK */
"Broken pipe", /* 32 - EPIPE */
/* math software */
"Numerical argument out of domain", /* 33 - EDOM */
"Result too large", /* 34 - ERANGE */
/* non-blocking and interrupt i/o */
"Resource temporarily unavailable", /* 35 - EAGAIN */
/* 35 - EWOULDBLOCK */
"Operation now in progress", /* 36 - EINPROGRESS */
"Operation already in progress", /* 37 - EALREADY */
/* ipc/network software -- argument errors */
"Socket operation on non-socket", /* 38 - ENOTSOCK */
"Destination address required", /* 39 - EDESTADDRREQ */
"Message too long", /* 40 - EMSGSIZE */
"Protocol wrong type for socket", /* 41 - EPROTOTYPE */
"Protocol not available", /* 42 - ENOPROTOOPT */
"Protocol not supported", /* 43 - EPROTONOSUPPORT */
"Socket type not supported", /* 44 - ESOCKTNOSUPPORT */
"Operation not supported", /* 45 - EOPNOTSUPP */
"Protocol family not supported", /* 46 - EPFNOSUPPORT */
/* 47 - EAFNOSUPPORT */
"Address family not supported by protocol family",
"Address already in use", /* 48 - EADDRINUSE */
"Can't assign requested address", /* 49 - EADDRNOTAVAIL */
/* ipc/network software -- operational errors */
"Network is down", /* 50 - ENETDOWN */
"Network is unreachable", /* 51 - ENETUNREACH */
"Network dropped connection on reset", /* 52 - ENETRESET */
"Software caused connection abort", /* 53 - ECONNABORTED */
"Connection reset by peer", /* 54 - ECONNRESET */
"No buffer space available", /* 55 - ENOBUFS */
"Socket is already connected", /* 56 - EISCONN */
"Socket is not connected", /* 57 - ENOTCONN */
"Can't send after socket shutdown", /* 58 - ESHUTDOWN */
"Too many references: can't splice", /* 59 - ETOOMANYREFS */
"Operation timed out", /* 60 - ETIMEDOUT */
"Connection refused", /* 61 - ECONNREFUSED */
"Too many levels of symbolic links", /* 62 - ELOOP */
"File name too long", /* 63 - ENAMETOOLONG */
/* should be rearranged */
"Host is down", /* 64 - EHOSTDOWN */
"No route to host", /* 65 - EHOSTUNREACH */
"Directory not empty", /* 66 - ENOTEMPTY */
/* quotas & mush */
"Too many processes", /* 67 - EPROCLIM */
"Too many users", /* 68 - EUSERS */
"Disc quota exceeded", /* 69 - EDQUOT */
/* Network File System */
"Stale NFS file handle", /* 70 - ESTALE */
"Too many levels of remote in path", /* 71 - EREMOTE */
"RPC struct is bad", /* 72 - EBADRPC */
"RPC version wrong", /* 73 - ERPCMISMATCH */
"RPC prog. not avail", /* 74 - EPROGUNAVAIL */
"Program version wrong", /* 75 - EPROGMISMATCH */
"Bad procedure for program", /* 76 - EPROCUNAVAIL */
"No locks available", /* 77 - ENOLCK */
"Function not implemented", /* 78 - ENOSYS */
"Inappropriate file type or format", /* 79 - EFTYPE */
"Authentication error", /* 80 - EAUTH */
"Need authenticator", /* 81 - ENEEDAUTH */
"Identifier removed", /* 82 - EIDRM */
"No message of desired type", /* 83 - ENOMSG */
"Value too large to be stored in data type", /* 84 - EOVERFLOW */
"Operation canceled", /* 85 - ECANCELED */
"Illegal byte sequence", /* 86 - EILSEQ */
"Attribute not found", /* 87 - ENOATTR */
/* General */
"Programming error", /* 88 - EDOOFUS */
"Bad message", /* 89 - EBADMSG */
"Multihop attempted", /* 90 - EMULTIHOP */
"Link has been severed", /* 91 - ENOLINK */
"Protocol error", /* 92 - EPROTO */
};
__thread int errno;
const int sys_nerr = sizeof(sys_errlist) / sizeof(sys_errlist[0]);
|
the_stack_data/92327547.c | // BUG: using __this_cpu_read() in preemptible [ADDR] code: syzkaller0NUM/3339
// https://syzkaller.appspot.com/bug?id=5c07370f529ff0db9775832e0036660164726c17
// status:invalid
// autogenerated by syzkaller (http://github.com/google/syzkaller)
#define _GNU_SOURCE
#include <sys/syscall.h>
#include <unistd.h>
#include <stdint.h>
#include <string.h>
static void test();
void loop()
{
while (1) {
test();
}
}
long r[60];
void test()
{
memset(r, -1, sizeof(r));
r[0] = syscall(__NR_mmap, 0x20000000ul, 0x904000ul, 0x3ul, 0x32ul,
0xfffffffffffffffful, 0x0ul);
r[1] = syscall(__NR_socket, 0xful, 0x3ul, 0x2ul);
*(uint64_t*)0x205f5000 = (uint64_t)0x0;
*(uint32_t*)0x205f5008 = (uint32_t)0x0;
*(uint64_t*)0x205f5010 = (uint64_t)0x208feff0;
*(uint64_t*)0x205f5018 = (uint64_t)0x1;
*(uint64_t*)0x205f5020 = (uint64_t)0x0;
*(uint64_t*)0x205f5028 = (uint64_t)0x0;
*(uint32_t*)0x205f5030 = (uint32_t)0x0;
*(uint64_t*)0x208feff0 = (uint64_t)0x208fe000;
*(uint64_t*)0x208feff8 = (uint64_t)0x50;
*(uint8_t*)0x208fe000 = (uint8_t)0x2;
*(uint8_t*)0x208fe001 = (uint8_t)0x3;
*(uint8_t*)0x208fe002 = (uint8_t)0x0;
*(uint8_t*)0x208fe003 = (uint8_t)0x9;
*(uint16_t*)0x208fe004 = (uint16_t)0xa;
*(uint16_t*)0x208fe006 = (uint16_t)0x0;
*(uint32_t*)0x208fe008 = (uint32_t)0x3;
*(uint32_t*)0x208fe00c = (uint32_t)0x0;
*(uint16_t*)0x208fe010 = (uint16_t)0x3;
*(uint16_t*)0x208fe012 = (uint16_t)0x6;
*(uint8_t*)0x208fe014 = (uint8_t)0x0;
*(uint8_t*)0x208fe015 = (uint8_t)0x0;
*(uint16_t*)0x208fe016 = (uint16_t)0x0;
*(uint16_t*)0x208fe018 = (uint16_t)0x2;
*(uint16_t*)0x208fe01a = (uint16_t)0x204e;
*(uint32_t*)0x208fe01c = (uint32_t)0x1020000;
*(uint8_t*)0x208fe020 = (uint8_t)0x0;
*(uint8_t*)0x208fe021 = (uint8_t)0x0;
*(uint8_t*)0x208fe022 = (uint8_t)0x0;
*(uint8_t*)0x208fe023 = (uint8_t)0x0;
*(uint8_t*)0x208fe024 = (uint8_t)0x0;
*(uint8_t*)0x208fe025 = (uint8_t)0x0;
*(uint8_t*)0x208fe026 = (uint8_t)0x0;
*(uint8_t*)0x208fe027 = (uint8_t)0x0;
*(uint16_t*)0x208fe028 = (uint16_t)0x2;
*(uint16_t*)0x208fe02a = (uint16_t)0x1;
*(uint32_t*)0x208fe02c = (uint32_t)0x0;
*(uint8_t*)0x208fe030 = (uint8_t)0x0;
*(uint8_t*)0x208fe031 = (uint8_t)0x0;
*(uint8_t*)0x208fe032 = (uint8_t)0x0;
*(uint8_t*)0x208fe033 = (uint8_t)0x2;
*(uint32_t*)0x208fe034 = (uint32_t)0x0;
*(uint16_t*)0x208fe038 = (uint16_t)0x3;
*(uint16_t*)0x208fe03a = (uint16_t)0x2000000005;
*(uint8_t*)0x208fe03c = (uint8_t)0x0;
*(uint8_t*)0x208fe03d = (uint8_t)0x0;
*(uint16_t*)0x208fe03e = (uint16_t)0x0;
*(uint16_t*)0x208fe040 = (uint16_t)0x2;
*(uint16_t*)0x208fe042 = (uint16_t)0x204e;
*(uint32_t*)0x208fe044 = (uint32_t)0x100007f;
*(uint8_t*)0x208fe048 = (uint8_t)0x0;
*(uint8_t*)0x208fe049 = (uint8_t)0x0;
*(uint8_t*)0x208fe04a = (uint8_t)0x0;
*(uint8_t*)0x208fe04b = (uint8_t)0x0;
*(uint8_t*)0x208fe04c = (uint8_t)0x0;
*(uint8_t*)0x208fe04d = (uint8_t)0x0;
*(uint8_t*)0x208fe04e = (uint8_t)0x0;
*(uint8_t*)0x208fe04f = (uint8_t)0x0;
r[59] = syscall(__NR_sendmsg, r[1], 0x205f5000ul, 0x0ul);
}
int main()
{
loop();
return 0;
}
|
the_stack_data/3915.c | #ifndef TH_GENERIC_FILE
#define TH_GENERIC_FILE "generic/BCECriterion.c"
#else
#define EPS 1e-12
void THNN_(BCECriterion_updateOutput)(THNNState *state, THTensor *input,
THTensor *target, THTensor *output,
bool sizeAverage, THTensor *weights)
{
THNN_CHECK_NELEMENT(input, target);
THNN_CHECK_NELEMENT(input, weights);
THNN_CHECK_DIM_SIZE(output, 1, 0, 1);
real sum = 0;
if(weights)
TH_TENSOR_APPLY3(real, input, real, target, real, weights,
real x = *input_data;
real y = *target_data;
real w = *weights_data;
THAssertMsg(x >= 0. && x <= 1.,
"input value should be between 0~1, but got %f",
(double) x);
sum -= (log(x + EPS) * y + log(1. - x + EPS) * (1. - y)) * w;
)
else
TH_TENSOR_APPLY2(real, input, real, target,
real x = *input_data;
real y = *target_data;
THAssertMsg(x >= 0. && x <= 1.,
"input value should be between 0~1, but got %f",
(double) x);
sum -= log(x + EPS) * y + log(1. - x + EPS) * (1. - y);
);
if (sizeAverage)
sum /= THTensor_(nElement)(input);
THTensor_(set1d)(output, 0, sum);
}
void THNN_(BCECriterion_updateGradInput)(THNNState *state, THTensor *input,
THTensor *target, THTensor *gradInput,
bool sizeAverage, THTensor *weights)
{
THNN_CHECK_NELEMENT(input, target);
THNN_CHECK_NELEMENT(input, weights);
real norm = (sizeAverage ? 1./((real)THTensor_(nElement)(input)) : 1.);
THTensor_(resizeAs)(gradInput, input);
TH_TENSOR_APPLY3(real, gradInput, real, input, real, target,
real x = *input_data;
real y = *target_data;
*gradInput_data = - norm * (y - x) / ((1. - x + EPS) * (x + EPS));
);
if(weights)
THTensor_(cmul)(gradInput, gradInput, weights);
}
#undef EPS
#endif
|
the_stack_data/192330549.c | #include <stdio.h>
#include <stdlib.h>
int main()
{
float Celcius, Fahrenheit;
printf("Enter temperature (Fahrenheit) to be converted: \n");
scanf("%f", &Fahrenheit);
Celcius = (Fahrenheit - 32) * (5.0/9.0);
printf("Degree in Celcius: %.2f", Celcius);
return 0;
}
|
the_stack_data/33250.c | /***
*heaphook.c - set the heap hook
*
* Copyright (c) Microsoft Corporation. All rights reserved.
*
*Purpose:
* Defines the following functions:
* _setheaphook() - set the heap hook
*
*******************************************************************************/
|
the_stack_data/14516.c | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
int calcBhaskara(float a,float b,float c){
float x1, x2, delta;
delta = b*b - 4*a*c;
x1 = (-b + sqrt(delta)) / (2*a);
x2 = (-b - sqrt(delta)) / (2*a);
if(delta < 0) {
printf("\nA equacao nao possui raizes reais.n");
} else {
printf("\nO valor de x1: %.2fn", x1);
printf("\nO valor de x2: %.2fn", x2);
}
}
int main(int argc, char** argv)
{
float A,B,C;
printf("\nDigite o valor de A: ");
scanf("%f", &A);
printf("\nDigite o valor de B: ");
scanf("%f", &B);
printf("\nDigite o valor de C: ");
scanf("%f", &C);
return calcBhaskara(A,B,C);
}
|
the_stack_data/293308.c | #include <stdio.h>
#include <stdlib.h>
int main()
{
int option;
printf("Welcome, please enter the option you want to see\n");
printf("The options are: 1, 2 or 3\n");
scanf("%i", &option);
switch(option)
{
case 1:
printf("An old man lived in the village. He was one of the most unfortunate people in the world. The whole village was tired of him; he was always gloomy, he constantly complained and was always in a bad mood.\n");
break;
case 2:
printf("People have been coming to the wise man, complaining about the same problems every time. One day he told them a joke and everyone roared in laughter.\n");
break;
case 3:
printf("A salt seller used to carry the salt bag on his donkey to the market every day. On the way they had to cross a stream. One day the donkey suddenly tumbled down the stream and the salt bag also fell into the water.\n");
break;
}
return 0;
}
|
the_stack_data/59514027.c | extern void __VERIFIER_error();
#include <pthread.h>
int i=1, j=1;
#define NUM 6
void *
t1(void* arg)
{
int k = 0;
for (k = 0; k < NUM; k++)
i+=j;
pthread_exit(NULL);
}
void *
t2(void* arg)
{
int k = 0;
for (k = 0; k < NUM; k++)
j+=i;
pthread_exit(NULL);
}
int
main(int argc, char **argv)
{
pthread_t id1, id2;
pthread_create(&id1, NULL, t1, NULL);
pthread_create(&id2, NULL, t2, NULL);
pthread_join(id1, NULL);
pthread_join(id2, NULL);
if (i > 377 || j > 377) {
ERROR: __VERIFIER_error();
}
return 0;
}
|
the_stack_data/206391842.c | #include <stdio.h>
int main()
{
double n[12][12],s=0,m=0,t=0;
int i,j;
char c;
scanf("%c",&c);
for(i=0;i<12;i++)
{
for(j=0;j<12;j++)
{
scanf("%lf",&n[i][j]);
}
}
for(i=1;i<11;i++)
{
if(i<6) t++;
if(i==6) t=6;
if(i>5) t--;
for(j=0;j<t;j++)
{
m++;
s=n[i][j]+s;
}
}
if(c=='S') printf("%.1lf\n",s);
else printf("%.1lf\n",s/m);
return 0;
}
|
the_stack_data/112339.c | #include<stdio.h>
int main(){
printf("Hello world \n");
printf("--------My handle CODEKCG23-----------");
return 0;
}
|
the_stack_data/54804.c | /*
*
* @author : Anmol Agrawal
*
*/
#include <stdio.h>
#include <string.h>
#include <math.h>
int main()
{
int r,x,i,j,len;
double a;
char str[100];
scanf("%s",str);
len=strlen(str);
a=sqrt((double)len);
x=a;
if(x==a)
r=x;
else
r=x+1;
if(x*r<len)
{
x++;
}
for(i=0;i<r;i++)
{
for(j=i;j<len;j+=r)
{
printf("%c",*(str+j));
}
printf(" ");
}
return 0;
}
|
the_stack_data/45449410.c | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
double f(double t)
{
return sqrt(expm1(t) * exp(-t)) * exp(-t);
}
double p(double x)
{
double val;
if (x >= 0) {
val = x + log1p(exp(- x));
} else {
val = log1p(exp(x));
}
return val;
}
double pinv(double t)
{
return log(expm1(t));
}
double sinc(double x)
{
double val = 1.0;
if (x != 0) {
val = sin(M_PI * x) / (M_PI * x);
}
return val;
}
double S(int k, double h, double x)
{
return sinc((x/h) - k);
}
double fapp(int n, double d, double alpha, double beta, double t)
{
int k, M, N;
double mu= fmin(alpha, beta);
double h = sqrt(M_PI * d / (mu*n));
if (alpha <= beta) {
M = n;
N = (int)ceil(alpha * n / beta);
} else {
M = (int)ceil(beta * n / alpha);
N = n;
}
double x = pinv(t);
double val1 = 0;
double val2 = 0;
for (k = -M; k < 0; k++) {
val1 += f(p(k*h)) * S(k,h,x);
}
for (k = N; k >= 0; k--) {
val2 += f(p(k*h)) * S(k,h,x);
}
return val1 + val2;
}
double err_bound(int n, double K, double d, double alpha, double beta)
{
double mu = fmin(alpha, beta);
double pdm = sqrt(M_PI * d * mu);
double sqn = sqrt(n);
double val = 1.0;
val += 2 * pow(M_E / (M_E - 1), 0.5*mu) / (pdm * (1 - exp(-2 * pdm)) * pow(cos(0.5*d),alpha+beta));
val *= 2 * K / pdm;
return val * sqn * exp(- pdm * sqn);
}
int main()
{
int i, n;
double d = 3;
double alpha = 0.5;
double beta = 1.0;
double gamma = 1 + 1.0/cos(d/2);
double K = pow(gamma * (1 + log(1 + gamma))/log(1 + gamma), alpha);
double t, err, maxerr;
for (n = 2; n <= 200; n += 5) {
maxerr = 0;
for (i = -100; i <= 100; i++) {
t = pow(2, 0.5*i);
err = fabs(f(t) - fapp(n, d, alpha, beta, t));
if (maxerr < err) {
maxerr = err;
}
}
printf("%d\t%e\t%e\n", n, maxerr, err_bound(n, K, d, alpha, beta));
}
return EXIT_SUCCESS;
}
|
the_stack_data/200142720.c | /*
* Copyright (c) 2021-2022 Nordic Semiconductor ASA
*
* SPDX-License-Identifier: Apache-2.0
*/
#if defined(CONFIG_BT_AUDIO_UNICAST_CLIENT)
#include <bluetooth/bluetooth.h>
#include <bluetooth/audio/audio.h>
#include <bluetooth/audio/capabilities.h>
#include "common.h"
#include "unicast_common.h"
extern enum bst_result_t bst_result;
static struct bt_audio_stream g_streams[CONFIG_BT_AUDIO_UNICAST_CLIENT_ASE_SNK_COUNT];
static struct bt_codec *g_remote_codecs[CONFIG_BT_AUDIO_UNICAST_CLIENT_PAC_COUNT];
static struct bt_audio_ep *g_sinks[CONFIG_BT_AUDIO_UNICAST_CLIENT_ASE_SNK_COUNT];
/* Mandatory support preset by both client and server */
static struct bt_audio_lc3_preset preset_16_2_1 = BT_AUDIO_LC3_UNICAST_PRESET_16_2_1;
CREATE_FLAG(flag_connected);
CREATE_FLAG(flag_mtu_exchanged);
CREATE_FLAG(flag_sink_discovered);
CREATE_FLAG(flag_stream_configured);
CREATE_FLAG(flag_stream_qos);
CREATE_FLAG(flag_stream_enabled);
static void stream_configured(struct bt_audio_stream *stream,
const struct bt_codec_qos_pref *pref)
{
printk("Configured stream %p\n", stream);
/* TODO: The preference should be used/taken into account when
* setting the QoS
*/
SET_FLAG(flag_stream_configured);
}
static void stream_qos_set(struct bt_audio_stream *stream)
{
printk("QoS set stream %p\n", stream);
SET_FLAG(flag_stream_qos);
}
static void stream_enabled(struct bt_audio_stream *stream)
{
printk("Enabled stream %p\n", stream);
SET_FLAG(flag_stream_enabled);
}
static void stream_started(struct bt_audio_stream *stream)
{
printk("Started stream %p\n", stream);
}
static void stream_metadata_updated(struct bt_audio_stream *stream)
{
printk("Metadata updated stream %p\n", stream);
}
static void stream_disabled(struct bt_audio_stream *stream)
{
printk("Disabled stream %p\n", stream);
}
static void stream_stopped(struct bt_audio_stream *stream)
{
printk("Stopped stream %p\n", stream);
}
static void stream_released(struct bt_audio_stream *stream)
{
printk("Released stream %p\n", stream);
}
static struct bt_audio_stream_ops stream_ops = {
.configured = stream_configured,
.qos_set = stream_qos_set,
.enabled = stream_enabled,
.started = stream_started,
.metadata_updated = stream_metadata_updated,
.disabled = stream_disabled,
.stopped = stream_stopped,
.released = stream_released,
};
static void add_remote_sink(struct bt_audio_ep *ep, uint8_t index)
{
printk("Sink #%u: ep %p\n", index, ep);
g_sinks[index] = ep;
}
static void add_remote_codec(struct bt_codec *codec, int index, uint8_t type)
{
printk("#%u: codec %p type 0x%02x\n", index, codec, type);
print_codec(codec);
if (type != BT_AUDIO_SINK && type != BT_AUDIO_SOURCE) {
return;
}
if (index < CONFIG_BT_AUDIO_UNICAST_CLIENT_PAC_COUNT) {
g_remote_codecs[index] = codec;
}
}
static void discover_sink_cb(struct bt_conn *conn,
struct bt_codec *codec,
struct bt_audio_ep *ep,
struct bt_audio_discover_params *params)
{
static bool codec_found;
static bool endpoint_found;
if (params->err != 0) {
FAIL("Discovery failed: %d\n", params->err);
return;
}
if (codec != NULL) {
add_remote_codec(codec, params->num_caps, params->type);
codec_found = true;
return;
}
if (ep != NULL) {
if (params->type == BT_AUDIO_SINK) {
add_remote_sink(ep, params->num_eps);
endpoint_found = true;
} else {
FAIL("Invalid param type: %u\n", params->type);
}
return;
}
printk("Discover complete\n");
(void)memset(params, 0, sizeof(*params));
if (endpoint_found && codec_found) {
SET_FLAG(flag_sink_discovered);
} else {
FAIL("Did not discover endpoint and codec\n");
}
}
static void gatt_mtu_cb(struct bt_conn *conn, uint8_t err,
struct bt_gatt_exchange_params *params)
{
if (err != 0) {
FAIL("Failed to exchange MTU (%u)\n", err);
return;
}
printk("MTU exchanged\n");
SET_FLAG(flag_mtu_exchanged);
}
static void connected(struct bt_conn *conn, uint8_t err)
{
char addr[BT_ADDR_LE_STR_LEN];
(void)bt_addr_le_to_str(bt_conn_get_dst(conn), addr, sizeof(addr));
if (err != 0) {
bt_conn_unref(default_conn);
default_conn = NULL;
FAIL("Failed to connect to %s (%u)\n", addr, err);
return;
}
printk("Connected to %s\n", addr);
SET_FLAG(flag_connected);
}
BT_CONN_CB_DEFINE(conn_callbacks) = {
.connected = connected,
.disconnected = disconnected,
};
static void init(void)
{
int err;
err = bt_enable(NULL);
if (err != 0) {
FAIL("Bluetooth enable failed (err %d)\n", err);
return;
}
for (size_t i = 0; i < ARRAY_SIZE(g_streams); i++) {
g_streams[i].ops = &stream_ops;
}
}
static void scan_and_connect(void)
{
int err;
err = bt_le_scan_start(BT_LE_SCAN_PASSIVE, device_found);
if (err != 0) {
FAIL("Scanning failed to start (err %d)\n", err);
return;
}
printk("Scanning successfully started\n");
WAIT_FOR_FLAG(flag_connected);
}
static void exchange_mtu(void)
{
struct bt_gatt_exchange_params mtu_params = {
.func = gatt_mtu_cb
};
int err;
err = bt_gatt_exchange_mtu(default_conn, &mtu_params);
if (err != 0) {
FAIL("Failed to exchange MTU %d\n", err);
return;
}
WAIT_FOR_FLAG(flag_mtu_exchanged);
}
static void discover_sink(void)
{
static struct bt_audio_discover_params params;
int err;
params.func = discover_sink_cb;
params.type = BT_AUDIO_SINK;
err = bt_audio_discover(default_conn, ¶ms);
if (err != 0) {
printk("Failed to discover sink: %d\n", err);
return;
}
WAIT_FOR_FLAG(flag_sink_discovered);
}
static int configure_stream(struct bt_audio_stream *stream,
struct bt_audio_ep *ep)
{
int err;
UNSET_FLAG(flag_stream_configured);
err = bt_audio_stream_config(default_conn, stream, ep,
&preset_16_2_1.codec);
if (err != 0) {
FAIL("Could not configure stream: %d\n", err);
return err;
}
WAIT_FOR_FLAG(flag_stream_configured);
return 0;
}
static void test_main(void)
{
struct bt_audio_unicast_group *unicast_group;
size_t stream_cnt;
int err;
init();
scan_and_connect();
exchange_mtu();
discover_sink();
printk("Configuring streams\n");
for (stream_cnt = 0; stream_cnt < ARRAY_SIZE(g_sinks); stream_cnt++) {
if (g_sinks[stream_cnt] == NULL) {
break;
}
err = configure_stream(&g_streams[stream_cnt],
g_sinks[stream_cnt]);
if (err != 0) {
FAIL("Unable to configure stream[%zu]: %d",
stream_cnt, err);
return;
}
}
printk("Creating unicast group\n");
err = bt_audio_unicast_group_create(g_streams, 1, &unicast_group);
if (err != 0) {
FAIL("Unable to create unicast group: %d", err);
return;
}
/* Test removing streams from group before adding them */
if (stream_cnt > 1) {
err = bt_audio_unicast_group_remove_streams(unicast_group,
g_streams + 1,
stream_cnt - 1);
if (err == 0) {
FAIL("Able to remove stream not in group");
return;
}
/* Test adding streams to group after creation */
err = bt_audio_unicast_group_add_streams(unicast_group,
g_streams + 1,
stream_cnt - 1);
if (err != 0) {
FAIL("Unable to add streams to unicast group: %d", err);
return;
}
}
/* TODO: When babblesim supports ISO setup Audio streams */
/* Test removing streams from group after creation */
if (stream_cnt > 1) {
err = bt_audio_unicast_group_remove_streams(unicast_group,
g_streams + 1,
stream_cnt - 1);
if (err != 0) {
FAIL("Unable to remove streams from unicast group: %d",
err);
return;
}
}
printk("Deleting unicast group\n");
err = bt_audio_unicast_group_delete(unicast_group);
if (err != 0) {
FAIL("Unable to delete unicast group: %d", err);
return;
}
unicast_group = NULL;
/* Recreate unicast group to verify that it's possible */
printk("Recreating unicast group\n");
err = bt_audio_unicast_group_create(g_streams, stream_cnt,
&unicast_group);
if (err != 0) {
FAIL("Unable to create unicast group: %d", err);
return;
}
printk("Deleting unicast group\n");
err = bt_audio_unicast_group_delete(unicast_group);
if (err != 0) {
FAIL("Unable to delete unicast group: %d", err);
return;
}
unicast_group = NULL;
PASS("Unicast client passed\n");
}
static const struct bst_test_instance test_unicast_client[] = {
{
.test_id = "unicast_client",
.test_post_init_f = test_init,
.test_tick_f = test_tick,
.test_main_f = test_main
},
BSTEST_END_MARKER
};
struct bst_test_list *test_unicast_client_install(struct bst_test_list *tests)
{
return bst_add_tests(tests, test_unicast_client);
}
#else /* !(CONFIG_BT_AUDIO_UNICAST_CLIENT) */
struct bst_test_list *test_unicast_client_install(struct bst_test_list *tests)
{
return tests;
}
#endif /* CONFIG_BT_AUDIO_UNICAST_CLIENT */
|
the_stack_data/36076472.c | #include <stdio.h>
#include <math.h>
int main() {
printf("Quadratic Equation \n");
printf("( ax%c + bx + c = 0 ) \n", 253);
printf("\n");
float a, b, c, alpha, beta, discriminant;
printf("a = ");
scanf("%f", &a);
printf("b = ");
scanf("%f", &b);
printf("c = ");
scanf("%f", &c);
printf("\n");
if (!a) {
printf("\'a\' must not be 0. \n");
}
else {
discriminant = pow(b, 2) - 4 * a*c;
printf("Discriminant : %f \n", discriminant);
printf("\n");
if (discriminant > 0) {
alpha = (-b + sqrt(discriminant)) / (2 * a);
beta = (-b - sqrt(discriminant)) / (2 * a);
printf("The roots are Real and Distinct \n");
printf("\n");
printf("alpha = %f \n", alpha);
printf("beta = %f \n", beta);
printf("\n");
}
else if (!discriminant) {
alpha = beta = -b / (2 * a);
printf("The roots are Real and Equal \n");
printf("\n");
printf("alpha = beta = %f \n", alpha);
printf("\n");
}
else {
printf("Root are Complex (Real + Imaginary) \n");
printf("\n");
printf("alpha = %f + %f i \n", (-b / (2 * a)), sqrt(fabs(discriminant)) / (2 * a));
printf("beta = %f - %f i \n", (-b / (2 * a)), sqrt(fabs(discriminant)) / (2 * a));
printf("\n");
}
}
return 0;
} |
the_stack_data/181392406.c | // KASAN: use-after-free Write in tls_push_record
// https://syzkaller.appspot.com/bug?id=2ba02045eb5dbeb12c20b68c462f4866fed8c949
// status:open
// autogenerated by syzkaller (https://github.com/google/syzkaller)
#define _GNU_SOURCE
#include <endian.h>
#include <errno.h>
#include <fcntl.h>
#include <pthread.h>
#include <stdarg.h>
#include <stdbool.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;
for (i = 0; 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);
}
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_RELAXED))
return 1;
now = current_time_ms();
if (now - start > timeout)
return 0;
}
}
static bool write_file(const char* file, const char* what, ...)
{
char buf[1024];
va_list args;
va_start(args, what);
vsnprintf(buf, sizeof(buf), what, args);
va_end(args);
buf[sizeof(buf) - 1] = 0;
int len = strlen(buf);
int fd = open(file, O_WRONLY | O_CLOEXEC);
if (fd == -1)
return false;
if (write(fd, buf, len) != len) {
int err = errno;
close(fd);
errno = err;
return false;
}
close(fd);
return true;
}
static int inject_fault(int nth)
{
int fd;
fd = open("/proc/thread-self/fail-nth", O_RDWR);
if (fd == -1)
exit(1);
char buf[16];
sprintf(buf, "%d", nth + 1);
if (write(fd, buf, strlen(buf)) != (ssize_t)strlen(buf))
exit(1);
return fd;
}
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 < 9; 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, 45);
break;
}
}
for (i = 0; i < 100 && __atomic_load_n(&running, __ATOMIC_RELAXED); i++)
sleep_ms(1);
}
uint64_t r[1] = {0xffffffffffffffff};
void execute_call(int call)
{
long res;
switch (call) {
case 0:
syscall(__NR_mmap, 0x20000000, 0xe7e000, 2, 0x31, -1, 0);
break;
case 1:
res = syscall(__NR_socket, 0xa, 1, 0);
if (res != -1)
r[0] = res;
break;
case 2:
*(uint32_t*)0x200000c0 = 1;
syscall(__NR_setsockopt, r[0], 6, 0x13, 0x200000c0, 4);
break;
case 3:
syscall(__NR_setsockopt, r[0], 6, 0xe, 0, 0);
break;
case 4:
syscall(__NR_ioctl, r[0], 0x5421, 0);
break;
case 5:
*(uint16_t*)0x20000180 = 0xa;
*(uint16_t*)0x20000182 = htobe16(0);
*(uint32_t*)0x20000184 = htobe32(0);
*(uint64_t*)0x20000188 = htobe64(0);
*(uint64_t*)0x20000190 = htobe64(1);
*(uint32_t*)0x20000198 = 0;
syscall(__NR_connect, r[0], 0x20000180, 0x1c);
break;
case 6:
memcpy((void*)0x20000340, "tls\000", 4);
syscall(__NR_setsockopt, r[0], 6, 0x1f, 0x20000340, 4);
break;
case 7:
*(uint16_t*)0x20000100 = 0x303;
*(uint16_t*)0x20000102 = 0x33;
syscall(__NR_setsockopt, r[0], 0x11a, 1, 0x20000100, 0x28);
break;
case 8:
write_file("/sys/kernel/debug/failslab/ignore-gfp-wait", "N");
write_file("/sys/kernel/debug/fail_futex/ignore-private", "N");
write_file("/sys/kernel/debug/fail_page_alloc/ignore-gfp-highmem", "N");
write_file("/sys/kernel/debug/fail_page_alloc/ignore-gfp-wait", "N");
write_file("/sys/kernel/debug/fail_page_alloc/min-order", "0");
inject_fault(7);
syscall(__NR_sendto, r[0], 0x200005c0, 0xfffffffffffffee0, 0, 0, 0xb6);
break;
}
}
int main(void)
{
syscall(__NR_mmap, 0x20000000, 0x1000000, 3, 0x32, -1, 0);
loop();
return 0;
}
|
the_stack_data/92328551.c | /* reading of strings*/
#include<stdio.h>
main()
{
int no;
char name1[15],name2[15],name3[15];
printf("enter the serial number and the name one\n");
scanf("%d %15c",&no,name1);
printf("%d %15s\n\n",no,name1);
printf("enter the serial number and two\n");
scanf("%d %s",&no,name2);
printf("%d %15s\n\n",no,name2);
}
|
the_stack_data/22011980.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 short input[1] , unsigned short 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 , ...) ;
int main(int argc , char *argv[] )
{
unsigned short input[1] ;
unsigned short output[1] ;
int randomFuns_i5 ;
unsigned short 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 = (unsigned short )strtoul(argv[randomFuns_i5 + 1], 0, 10);
input[randomFuns_i5] = randomFuns_value6;
randomFuns_i5 ++;
}
RandomFunc(input, output);
if (output[0] == 322) {
printf("You win!\n");
} else {
}
randomFuns_main_i7 = 0;
while (randomFuns_main_i7 < 1) {
printf("%u\n", output[randomFuns_main_i7]);
randomFuns_main_i7 ++;
}
}
}
void RandomFunc(unsigned short input[1] , unsigned short output[1] )
{
unsigned short state[1] ;
unsigned short local2 ;
unsigned short local1 ;
char copy11 ;
char copy12 ;
{
state[0UL] = (input[0UL] + 51238316UL) + (unsigned short)8426;
local1 = 0UL;
while (local1 < 1UL) {
local2 = 0UL;
while (local2 < 1UL) {
copy11 = *((char *)(& state[local1]) + 0);
*((char *)(& state[local1]) + 0) = *((char *)(& state[local1]) + 1);
*((char *)(& state[local1]) + 1) = copy11;
copy11 = *((char *)(& state[local1]) + 1);
*((char *)(& state[local1]) + 1) = *((char *)(& state[local1]) + 0);
*((char *)(& state[local1]) + 0) = copy11;
copy12 = *((char *)(& state[local2]) + 1);
*((char *)(& state[local2]) + 1) = *((char *)(& state[local2]) + 0);
*((char *)(& state[local2]) + 0) = copy12;
copy12 = *((char *)(& state[local2]) + 0);
*((char *)(& state[local2]) + 0) = *((char *)(& state[local2]) + 1);
*((char *)(& state[local2]) + 1) = copy12;
local2 ++;
}
local1 += 2UL;
}
output[0UL] = (state[0UL] + 760496316UL) + (unsigned short)39351;
}
}
void megaInit(void)
{
{
}
}
|
the_stack_data/225143847.c | /* -----------------------------------------------------------------------------
*
* (c) The GHC Team, 2001,2019
* Author: Sungwoo Park, Daniel Gröber
*
* Generalised profiling heap traversal.
*
* ---------------------------------------------------------------------------*/
#if defined(PROFILING)
#include <string.h>
#include "rts/PosixSource.h"
#include "Rts.h"
#include "sm/Storage.h"
#include "TraverseHeap.h"
const stackData nullStackData;
StgWord getTravData(const StgClosure *c)
{
const StgWord hp_hdr = c->header.prof.hp.trav;
return hp_hdr & (STG_WORD_MAX ^ 1);
}
void setTravData(const traverseState *ts, StgClosure *c, StgWord w)
{
c->header.prof.hp.trav = w | ts->flip;
}
bool isTravDataValid(const traverseState *ts, const StgClosure *c)
{
return (c->header.prof.hp.trav & 1) == ts->flip;
}
#if defined(DEBUG)
unsigned int g_traversalDebugLevel = 0;
static void debug(const char *s, ...)
{
va_list ap;
if(g_traversalDebugLevel == 0)
return;
va_start(ap,s);
vdebugBelch(s, ap);
va_end(ap);
}
#else
#define debug(...)
#endif
// number of blocks allocated for one stack
#define BLOCKS_IN_STACK 1
/* -----------------------------------------------------------------------------
* Add a new block group to the stack.
* Invariants:
* currentStack->link == s.
* -------------------------------------------------------------------------- */
STATIC_INLINE void
newStackBlock( traverseState *ts, bdescr *bd )
{
ts->currentStack = bd;
ts->stackTop = (stackElement *)(bd->start + BLOCK_SIZE_W * bd->blocks);
ts->stackBottom = (stackElement *)bd->start;
ts->stackLimit = (stackElement *)ts->stackTop;
bd->free = (StgPtr)ts->stackLimit;
}
/* -----------------------------------------------------------------------------
* Return to the previous block group.
* Invariants:
* s->link == currentStack.
* -------------------------------------------------------------------------- */
STATIC_INLINE void
returnToOldStack( traverseState *ts, bdescr *bd )
{
ts->currentStack = bd;
ts->stackTop = (stackElement *)bd->free;
ts->stackBottom = (stackElement *)bd->start;
ts->stackLimit = (stackElement *)(bd->start + BLOCK_SIZE_W * bd->blocks);
bd->free = (StgPtr)ts->stackLimit;
}
/**
* Initializes the traversal work-stack.
*/
void
initializeTraverseStack( traverseState *ts )
{
if (ts->firstStack != NULL) {
freeChain(ts->firstStack);
}
ts->firstStack = allocGroup(BLOCKS_IN_STACK);
ts->firstStack->link = NULL;
ts->firstStack->u.back = NULL;
ts->stackSize = 0;
ts->maxStackSize = 0;
newStackBlock(ts, ts->firstStack);
}
/**
* Frees all the block groups in the traversal works-stack.
*
* Invariants:
* firstStack != NULL
*/
void
closeTraverseStack( traverseState *ts )
{
freeChain(ts->firstStack);
ts->firstStack = NULL;
}
/**
* Returns the largest stack size encountered during the traversal.
*/
int
getTraverseStackMaxSize(traverseState *ts)
{
return ts->maxStackSize;
}
/**
* Returns true if the whole stack is empty.
**/
STATIC_INLINE bool
isEmptyWorkStack( traverseState *ts )
{
return (ts->firstStack == ts->currentStack) && ts->stackTop == ts->stackLimit;
}
/**
* Returns size of stack
*/
W_
traverseWorkStackBlocks(traverseState *ts)
{
bdescr* bd;
W_ res = 0;
for (bd = ts->firstStack; bd != NULL; bd = bd->link)
res += bd->blocks;
return res;
}
/**
* Initializes *info from ptrs and payload.
*
* Invariants:
*
* payload[] begins with ptrs pointers followed by non-pointers.
*/
STATIC_INLINE void
init_ptrs( stackPos *info, uint32_t ptrs, StgPtr payload )
{
info->type = posTypePtrs;
info->next.ptrs.pos = 0;
info->next.ptrs.ptrs = ptrs;
info->next.ptrs.payload = payload;
}
/**
* Find the next object from *info.
*/
STATIC_INLINE StgClosure *
find_ptrs( stackPos *info )
{
if (info->next.ptrs.pos < info->next.ptrs.ptrs) {
return (StgClosure *)info->next.ptrs.payload[info->next.ptrs.pos++];
} else {
return NULL;
}
}
/**
* Initializes *info from SRT information stored in *infoTable.
*/
STATIC_INLINE void
init_srt_fun( stackPos *info, const StgFunInfoTable *infoTable )
{
info->type = posTypeSRT;
if (infoTable->i.srt) {
info->next.srt.srt = (StgClosure*)GET_FUN_SRT(infoTable);
} else {
info->next.srt.srt = NULL;
}
}
STATIC_INLINE void
init_srt_thunk( stackPos *info, const StgThunkInfoTable *infoTable )
{
info->type = posTypeSRT;
if (infoTable->i.srt) {
info->next.srt.srt = (StgClosure*)GET_SRT(infoTable);
} else {
info->next.srt.srt = NULL;
}
}
/**
* Find the next object from *info.
*/
STATIC_INLINE StgClosure *
find_srt( stackPos *info )
{
StgClosure *c;
if (info->type == posTypeSRT) {
c = info->next.srt.srt;
info->next.srt.srt = NULL;
return c;
}
return NULL;
}
/**
* Push a set of closures, represented by a single 'stackElement', onto the
* traversal work-stack.
*/
static stackElement*
pushStackElement(traverseState *ts, const stackElement se)
{
bdescr *nbd; // Next Block Descriptor
if (ts->stackTop - 1 < ts->stackBottom) {
debug("pushStackElement() to the next stack.\n");
// currentStack->free is updated when the active stack is switched
// to the next stack.
ts->currentStack->free = (StgPtr)ts->stackTop;
if (ts->currentStack->link == NULL) {
nbd = allocGroup(BLOCKS_IN_STACK);
nbd->link = NULL;
nbd->u.back = ts->currentStack;
ts->currentStack->link = nbd;
} else
nbd = ts->currentStack->link;
newStackBlock(ts, nbd);
}
// adjust stackTop (actual push)
ts->stackTop--;
// If the size of stackElement was huge, we would better replace the
// following statement by either a memcpy() call or a switch statement
// on the type of the element. Currently, the size of stackElement is
// small enough (5 words) that this direct assignment seems to be enough.
*ts->stackTop = se;
ts->stackSize++;
if (ts->stackSize > ts->maxStackSize) ts->maxStackSize = ts->stackSize;
ASSERT(ts->stackSize >= 0);
debug("stackSize = %d\n", ts->stackSize);
return ts->stackTop;
}
/**
* Push a single closure onto the traversal work-stack.
*
* cp - object's parent
* c - closure
* data - data associated with closure.
*/
inline void
traversePushClosure(traverseState *ts, StgClosure *c, StgClosure *cp, stackElement *sep, stackData data) {
stackElement se;
se.c = c;
se.info.next.cp = cp;
se.sep = sep;
se.data = data;
se.accum = (stackAccum)(StgWord)0;
se.info.type = posTypeFresh;
pushStackElement(ts, se);
};
void
traversePushRoot(traverseState *ts, StgClosure *c, StgClosure *cp, stackData data)
{
traversePushClosure(ts, c, cp, NULL, data);
};
/**
* Push an empty stackElement onto the traversal work-stack for the sole purpose
* of triggering the return callback 'traversalState.return_cb' for the closure
* '*c' when traversing of it's children is complete.
*
* This is needed for code-paths which don't inherently have to push a
* stackElement. c.f. traverseWorkStack.
*
* When return_cb is NULL this function does nothing.
*/
STATIC_INLINE stackElement *
traversePushReturn(traverseState *ts, StgClosure *c, stackAccum acc, stackElement *sep)
{
if(!ts->return_cb)
return sep;
stackElement se;
se.c = c;
se.info.next.cp = NULL;
se.accum = acc;
se.sep = sep;
memset(&se.data, 0, sizeof(se.data));
// return frames never emit closures, traversePop just skips over them. So
// the data field is simply never used.
se.info.type = posTypeEmpty;
return pushStackElement(ts, se);
};
/**
* traverseGetChildren() extracts the first child of 'c' in 'first_child' and if
* 'other_children' is true returns a stackElement in 'se' which
* conceptually contains all remaining children of 'c'.
*
* If 'c' has no children, 'first_child' is set to NULL, other_children is set
* to false and nothing is returned in 'se'.
*
* If 'c' has only one child, 'first_child' is set to that child, other_children
* is set to false and nothing is returned in 'se'.
*
* Otherwise 'other_children' is set to true and a stackElement representing the
* other children is returned in 'se'.
*
* Note that when 'se' is set only the fields fields 'se.c' and 'se.info'
* are initialized. It is the caller's responsibility to initialize the rest.
*
* Invariants:
*
* - 'c' is not any of TSO, AP, PAP, AP_STACK, which means that there cannot
* be any stack objects.
*
* Note: SRTs are considered to be children as well.
*/
STATIC_INLINE void
traverseGetChildren(StgClosure *c, StgClosure **first_child, bool *other_children, stackElement *se)
{
ASSERT(get_itbl(c)->type != TSO);
ASSERT(get_itbl(c)->type != AP_STACK);
//
// fill in se
//
se->c = c;
*other_children = false;
// fill in se->info
switch (get_itbl(c)->type) {
// no child, no SRT
case CONSTR_0_1:
case CONSTR_0_2:
case ARR_WORDS:
case COMPACT_NFDATA:
*first_child = NULL;
return;
// one child (fixed), no SRT
case MUT_VAR_CLEAN:
case MUT_VAR_DIRTY:
*first_child = ((StgMutVar *)c)->var;
return;
case THUNK_SELECTOR:
*first_child = ((StgSelector *)c)->selectee;
return;
case BLACKHOLE:
*first_child = ((StgInd *)c)->indirectee;
return;
case CONSTR_1_0:
case CONSTR_1_1:
*first_child = c->payload[0];
return;
// For CONSTR_2_0 and MVAR, we use se->info.step to record the position
// of the next child. We do not write a separate initialization code.
// Also we do not have to initialize info.type;
// two children (fixed), no SRT
// need to push a stackElement, but nothing to store in se->info
case CONSTR_2_0:
*first_child = c->payload[0]; // return the first pointer
se->info.type = posTypeStep;
se->info.next.step = 2; // 2 = second
break;
// three children (fixed), no SRT
// need to push a stackElement
case MVAR_CLEAN:
case MVAR_DIRTY:
// head must be TSO and the head of a linked list of TSOs.
// Shoule it be a child? Seems to be yes.
*first_child = (StgClosure *)((StgMVar *)c)->head;
se->info.type = posTypeStep;
se->info.next.step = 2; // 2 = second
break;
// three children (fixed), no SRT
case WEAK:
*first_child = ((StgWeak *)c)->key;
se->info.type = posTypeStep;
se->info.next.step = 2;
break;
// layout.payload.ptrs, no SRT
case TVAR:
case CONSTR:
case CONSTR_NOCAF:
case PRIM:
case MUT_PRIM:
case BCO:
init_ptrs(&se->info, get_itbl(c)->layout.payload.ptrs,
(StgPtr)c->payload);
*first_child = find_ptrs(&se->info);
if (*first_child == NULL)
return; // no child
break;
// StgMutArrPtr.ptrs, no SRT
case MUT_ARR_PTRS_CLEAN:
case MUT_ARR_PTRS_DIRTY:
case MUT_ARR_PTRS_FROZEN_CLEAN:
case MUT_ARR_PTRS_FROZEN_DIRTY:
init_ptrs(&se->info, ((StgMutArrPtrs *)c)->ptrs,
(StgPtr)(((StgMutArrPtrs *)c)->payload));
*first_child = find_ptrs(&se->info);
if (*first_child == NULL)
return;
break;
// StgMutArrPtr.ptrs, no SRT
case SMALL_MUT_ARR_PTRS_CLEAN:
case SMALL_MUT_ARR_PTRS_DIRTY:
case SMALL_MUT_ARR_PTRS_FROZEN_CLEAN:
case SMALL_MUT_ARR_PTRS_FROZEN_DIRTY:
init_ptrs(&se->info, ((StgSmallMutArrPtrs *)c)->ptrs,
(StgPtr)(((StgSmallMutArrPtrs *)c)->payload));
*first_child = find_ptrs(&se->info);
if (*first_child == NULL)
return;
break;
// layout.payload.ptrs, SRT
case FUN_STATIC:
case FUN: // *c is a heap object.
case FUN_2_0:
init_ptrs(&se->info, get_itbl(c)->layout.payload.ptrs, (StgPtr)c->payload);
*first_child = find_ptrs(&se->info);
if (*first_child == NULL)
// no child from ptrs, so check SRT
goto fun_srt_only;
break;
case THUNK:
case THUNK_2_0:
init_ptrs(&se->info, get_itbl(c)->layout.payload.ptrs,
(StgPtr)((StgThunk *)c)->payload);
*first_child = find_ptrs(&se->info);
if (*first_child == NULL)
// no child from ptrs, so check SRT
goto thunk_srt_only;
break;
// 1 fixed child, SRT
case FUN_1_0:
case FUN_1_1:
*first_child = c->payload[0];
ASSERT(*first_child != NULL);
init_srt_fun(&se->info, get_fun_itbl(c));
break;
case THUNK_1_0:
case THUNK_1_1:
*first_child = ((StgThunk *)c)->payload[0];
ASSERT(*first_child != NULL);
init_srt_thunk(&se->info, get_thunk_itbl(c));
break;
case FUN_0_1: // *c is a heap object.
case FUN_0_2:
fun_srt_only:
init_srt_fun(&se->info, get_fun_itbl(c));
*first_child = find_srt(&se->info);
if (*first_child == NULL)
return; // no child
break;
// SRT only
case THUNK_STATIC:
ASSERT(get_itbl(c)->srt != 0);
/* fall-thru */
case THUNK_0_1:
case THUNK_0_2:
thunk_srt_only:
init_srt_thunk(&se->info, get_thunk_itbl(c));
*first_child = find_srt(&se->info);
if (*first_child == NULL)
return; // no child
break;
case TREC_CHUNK:
*first_child = (StgClosure *)((StgTRecChunk *)c)->prev_chunk;
se->info.type = posTypeStep;
se->info.next.step = 0; // entry no.
break;
// cannot appear
case PAP:
case AP:
case AP_STACK:
case TSO:
case STACK:
case IND_STATIC:
// stack objects
case UPDATE_FRAME:
case CATCH_FRAME:
case UNDERFLOW_FRAME:
case STOP_FRAME:
case RET_BCO:
case RET_SMALL:
case RET_BIG:
// invalid objects
case IND:
case INVALID_OBJECT:
default:
barf("Invalid object *c in push(): %d", get_itbl(c)->type);
return;
}
// se->info.next.cp has to be initialized when type==posTypeFresh. We don't
// do that here though. So type must be !=posTypeFresh.
ASSERT(se->info.type != posTypeFresh);
*other_children = true;
}
STATIC_INLINE void
popStackElement(traverseState *ts) {
debug("popStackElement(): stackTop = 0x%x\n", ts->stackTop);
ASSERT(ts->stackTop != ts->stackLimit);
ASSERT(!isEmptyWorkStack(ts));
// <= (instead of <) is wrong!
if (ts->stackTop + 1 < ts->stackLimit) {
ts->stackTop++;
ts->stackSize--;
if (ts->stackSize > ts->maxStackSize) ts->maxStackSize = ts->stackSize;
ASSERT(ts->stackSize >= 0);
debug("stackSize = (--) %d\n", ts->stackSize);
return;
}
bdescr *pbd; // Previous Block Descriptor
debug("popStackElement() to the previous stack.\n");
ASSERT(ts->stackTop + 1 == ts->stackLimit);
ASSERT(ts->stackBottom == (stackElement *)ts->currentStack->start);
if (ts->firstStack == ts->currentStack) {
// The stack is completely empty.
ts->stackTop++;
ASSERT(ts->stackTop == ts->stackLimit);
ts->stackSize--;
if (ts->stackSize > ts->maxStackSize) ts->maxStackSize = ts->stackSize;
ASSERT(ts->stackSize >= 0);
debug("stackSize = %d\n", ts->stackSize);
return;
}
// currentStack->free is updated when the active stack is switched back
// to the previous stack.
ts->currentStack->free = (StgPtr)ts->stackLimit;
// find the previous block descriptor
pbd = ts->currentStack->u.back;
ASSERT(pbd != NULL);
returnToOldStack(ts, pbd);
ts->stackSize--;
if (ts->stackSize > ts->maxStackSize) ts->maxStackSize = ts->stackSize;
ASSERT(ts->stackSize >= 0);
debug("stackSize = %d\n", ts->stackSize);
}
/**
* callReturnAndPopStackElement(): Call 'traversalState.return_cb' and remove a
* depleted stackElement from the top of the traversal work-stack.
*
* Invariants:
* stackTop cannot be equal to stackLimit unless the whole stack is
* empty, in which case popStackElement() is not allowed.
*/
static void
callReturnAndPopStackElement(traverseState *ts)
{
stackElement *se = ts->stackTop;
if(ts->return_cb)
ts->return_cb(se->c, se->accum,
se->sep->c, &se->sep->accum);
popStackElement(ts);
}
/**
* Finds the next object to be considered for retainer profiling and store
* its pointer to *c.
*
* If the unprocessed object was stored in the stack (posTypeFresh), the
* this object is returned as-is. Otherwise Test if the topmost stack
* element indicates that more objects are left,
* and if so, retrieve the next object and store its pointer to *c. Also,
* set *cp and *data appropriately, both of which are stored in the stack
* element. The topmost stack element is then overwritten so it denotes the
* next object.
*
* If the topmost stack element indicates no more objects are left, pop
* off the stack element until either an object can be retrieved or
* the work-stack becomes empty, indicated by true returned by
* isEmptyWorkStack(), in which case *c is set to NULL.
*
* Note:
*
* It is okay to call this function even when the work-stack is empty.
*/
STATIC_INLINE void
traversePop(traverseState *ts, StgClosure **c, StgClosure **cp, stackData *data, stackElement **sep)
{
stackElement *se;
debug("traversePop(): stackTop = 0x%x\n", ts->stackTop);
// Is this the last internal sub-element?
bool last = false;
*c = NULL;
do {
if (isEmptyWorkStack(ts)) {
*c = NULL;
return;
}
// Note: Below every `break`, where the loop condition is true, must be
// accompanied by a popStackElement()/callReturnAndPopStackElement()
// call otherwise this is an infinite loop.
se = ts->stackTop;
*sep = se->sep;
// If this is a top-level element, you should pop that out.
if (se->info.type == posTypeFresh) {
*cp = se->info.next.cp;
*c = se->c;
*data = se->data;
popStackElement(ts);
return;
} else if (se->info.type == posTypeEmpty) {
callReturnAndPopStackElement(ts);
continue;
}
// Note: The first ptr of all of these was already returned as
// *fist_child in push(), so we always start with the second field.
switch (get_itbl(se->c)->type) {
// two children (fixed), no SRT
// nothing in se.info
case CONSTR_2_0:
*c = se->c->payload[1];
last = true;
goto out;
// three children (fixed), no SRT
// need to push a stackElement
case MVAR_CLEAN:
case MVAR_DIRTY:
if (se->info.next.step == 2) {
*c = (StgClosure *)((StgMVar *)se->c)->tail;
se->info.next.step++; // move to the next step
// no popStackElement
} else {
*c = ((StgMVar *)se->c)->value;
last = true;
}
goto out;
// three children (fixed), no SRT
case WEAK:
if (se->info.next.step == 2) {
*c = ((StgWeak *)se->c)->value;
se->info.next.step++;
// no popStackElement
} else {
*c = ((StgWeak *)se->c)->finalizer;
last = true;
}
goto out;
case TREC_CHUNK: {
// These are pretty complicated: we have N entries, each
// of which contains 3 fields that we want to follow. So
// we divide the step counter: the 2 low bits indicate
// which field, and the rest of the bits indicate the
// entry number (starting from zero).
TRecEntry *entry;
StgWord step = se->info.next.step;
uint32_t entry_no = step >> 2;
uint32_t field_no = step & 3;
entry = &((StgTRecChunk *)se->c)->entries[entry_no];
if (field_no == 0) {
*c = (StgClosure *)entry->tvar;
} else if (field_no == 1) {
*c = entry->expected_value;
} else {
*c = entry->new_value;
}
se->info.next.step = ++step;
entry_no = step >> 2;
if (entry_no == ((StgTRecChunk *)se->c)->next_entry_idx) {
se->info.type = posTypeEmpty;
continue;
}
goto out;
}
case TVAR:
case CONSTR:
case PRIM:
case MUT_PRIM:
case BCO:
// StgMutArrPtr.ptrs, no SRT
case MUT_ARR_PTRS_CLEAN:
case MUT_ARR_PTRS_DIRTY:
case MUT_ARR_PTRS_FROZEN_CLEAN:
case MUT_ARR_PTRS_FROZEN_DIRTY:
case SMALL_MUT_ARR_PTRS_CLEAN:
case SMALL_MUT_ARR_PTRS_DIRTY:
case SMALL_MUT_ARR_PTRS_FROZEN_CLEAN:
case SMALL_MUT_ARR_PTRS_FROZEN_DIRTY:
*c = find_ptrs(&se->info);
if (*c == NULL) {
se->info.type = posTypeEmpty;
continue;
}
goto out;
// layout.payload.ptrs, SRT
case FUN: // always a heap object
case FUN_STATIC:
case FUN_2_0:
if (se->info.type == posTypePtrs) {
*c = find_ptrs(&se->info);
if (*c != NULL) {
goto out;
}
init_srt_fun(&se->info, get_fun_itbl(se->c));
}
goto do_srt;
case THUNK:
case THUNK_2_0:
if (se->info.type == posTypePtrs) {
*c = find_ptrs(&se->info);
if (*c != NULL) {
goto out;
}
init_srt_thunk(&se->info, get_thunk_itbl(se->c));
}
goto do_srt;
// SRT
do_srt:
case THUNK_STATIC:
case FUN_0_1:
case FUN_0_2:
case THUNK_0_1:
case THUNK_0_2:
case FUN_1_0:
case FUN_1_1:
case THUNK_1_0:
case THUNK_1_1:
*c = find_srt(&se->info);
if(*c == NULL) {
se->info.type = posTypeEmpty;
continue;
}
goto out;
// no child (fixed), no SRT
case CONSTR_0_1:
case CONSTR_0_2:
case ARR_WORDS:
// one child (fixed), no SRT
case MUT_VAR_CLEAN:
case MUT_VAR_DIRTY:
case THUNK_SELECTOR:
case CONSTR_1_1:
// cannot appear
case PAP:
case AP:
case AP_STACK:
case TSO:
case STACK:
case IND_STATIC:
case CONSTR_NOCAF:
// stack objects
case UPDATE_FRAME:
case CATCH_FRAME:
case UNDERFLOW_FRAME:
case STOP_FRAME:
case RET_BCO:
case RET_SMALL:
case RET_BIG:
// invalid objects
case IND:
case INVALID_OBJECT:
default:
barf("Invalid object *c in traversePop(): %d", get_itbl(se->c)->type);
return;
}
} while (*c == NULL);
out:
ASSERT(*c != NULL);
*cp = se->c;
*data = se->data;
*sep = se;
if(last && ts->return_cb)
se->info.type = posTypeEmpty;
else if(last)
popStackElement(ts);
return;
}
/**
* Make sure a closure's profiling data is initialized to zero if it does not
* conform to the current value of the flip bit, returns true in this case.
*
* See Note [Profiling heap traversal visited bit].
*/
bool
traverseMaybeInitClosureData(const traverseState* ts, StgClosure *c)
{
if (!isTravDataValid(ts, c)) {
setTravData(ts, c, 0);
return true;
}
return false;
}
/**
* Call traversePushClosure for each of the closures covered by a large bitmap.
*/
static void
traverseLargeBitmap(traverseState *ts, StgPtr p, StgLargeBitmap *large_bitmap,
uint32_t size, StgClosure *c, stackElement *sep, stackData data)
{
uint32_t i, b;
StgWord bitmap;
b = 0;
bitmap = large_bitmap->bitmap[b];
for (i = 0; i < size; ) {
if ((bitmap & 1) == 0) {
traversePushClosure(ts, (StgClosure *)*p, c, sep, data);
}
i++;
p++;
if (i % BITS_IN(W_) == 0) {
b++;
bitmap = large_bitmap->bitmap[b];
} else {
bitmap = bitmap >> 1;
}
}
}
STATIC_INLINE StgPtr
traverseSmallBitmap (traverseState *ts, StgPtr p, uint32_t size, StgWord bitmap,
StgClosure *c, stackElement *sep, stackData data)
{
while (size > 0) {
if ((bitmap & 1) == 0) {
traversePushClosure(ts, (StgClosure *)*p, c, sep, data);
}
p++;
bitmap = bitmap >> 1;
size--;
}
return p;
}
/**
* traversePushStack(ts, cp, data, stackStart, stackEnd) pushes all the objects
* in the STG stack-chunk from stackStart to stackEnd onto the traversal
* work-stack with 'c' and 'data' being their parent and associated data,
* respectively.
*
* Invariants:
*
* *cp is one of the following: TSO, AP_STACK.
*
* stackStart < stackEnd.
*
* If *c is TSO, its state is not ThreadComplete,or ThreadKilled,
* which means that its stack is ready to process.
*
* Note:
*
* This code was almost plagiarzied from GC.c! For each pointer,
* traversePushClosure() is invoked instead of evacuate().
*/
static void
traversePushStack(traverseState *ts, StgClosure *cp, stackElement *sep,
stackData data, StgPtr stackStart, StgPtr stackEnd)
{
StgPtr p;
const StgRetInfoTable *info;
StgWord bitmap;
uint32_t size;
ASSERT(get_itbl(cp)->type == STACK);
p = stackStart;
while (p < stackEnd) {
info = get_ret_itbl((StgClosure *)p);
switch(info->i.type) {
case UPDATE_FRAME:
traversePushClosure(ts, ((StgUpdateFrame *)p)->updatee, cp, sep, data);
p += sizeofW(StgUpdateFrame);
continue;
case UNDERFLOW_FRAME:
case STOP_FRAME:
case CATCH_FRAME:
case CATCH_STM_FRAME:
case CATCH_RETRY_FRAME:
case ATOMICALLY_FRAME:
case RET_SMALL:
bitmap = BITMAP_BITS(info->i.layout.bitmap);
size = BITMAP_SIZE(info->i.layout.bitmap);
p++;
p = traverseSmallBitmap(ts, p, size, bitmap, cp, sep, data);
follow_srt:
if (info->i.srt) {
traversePushClosure(ts, GET_SRT(info), cp, sep, data);
}
continue;
case RET_BCO: {
StgBCO *bco;
p++;
traversePushClosure(ts, (StgClosure*)*p, cp, sep, data);
bco = (StgBCO *)*p;
p++;
size = BCO_BITMAP_SIZE(bco);
traverseLargeBitmap(ts, p, BCO_BITMAP(bco), size, cp, sep, data);
p += size;
continue;
}
// large bitmap (> 32 entries, or > 64 on a 64-bit machine)
case RET_BIG:
size = GET_LARGE_BITMAP(&info->i)->size;
p++;
traverseLargeBitmap(ts, p, GET_LARGE_BITMAP(&info->i),
size, cp, sep, data);
p += size;
// and don't forget to follow the SRT
goto follow_srt;
case RET_FUN: {
StgRetFun *ret_fun = (StgRetFun *)p;
const StgFunInfoTable *fun_info;
traversePushClosure(ts, ret_fun->fun, cp, sep, data);
fun_info = get_fun_itbl(UNTAG_CONST_CLOSURE(ret_fun->fun));
p = (P_)&ret_fun->payload;
switch (fun_info->f.fun_type) {
case ARG_GEN:
bitmap = BITMAP_BITS(fun_info->f.b.bitmap);
size = BITMAP_SIZE(fun_info->f.b.bitmap);
p = traverseSmallBitmap(ts, p, size, bitmap, cp, sep, data);
break;
case ARG_GEN_BIG:
size = GET_FUN_LARGE_BITMAP(fun_info)->size;
traverseLargeBitmap(ts, p, GET_FUN_LARGE_BITMAP(fun_info),
size, cp, sep, data);
p += size;
break;
default:
bitmap = BITMAP_BITS(stg_arg_bitmaps[fun_info->f.fun_type]);
size = BITMAP_SIZE(stg_arg_bitmaps[fun_info->f.fun_type]);
p = traverseSmallBitmap(ts, p, size, bitmap, cp, sep, data);
break;
}
goto follow_srt;
}
default:
barf("Invalid object found in traversePushStack(): %d",
(int)(info->i.type));
}
}
}
/**
* Call traversePushClosure for each of the children of a PAP/AP
*/
STATIC_INLINE StgPtr
traversePAP (traverseState *ts,
StgClosure *pap, /* NOT tagged */
stackElement *sep,
stackData data,
StgClosure *fun, /* tagged */
StgClosure** payload, StgWord n_args)
{
StgPtr p;
StgWord bitmap;
const StgFunInfoTable *fun_info;
traversePushClosure(ts, fun, pap, sep, data);
fun = UNTAG_CLOSURE(fun);
fun_info = get_fun_itbl(fun);
ASSERT(fun_info->i.type != PAP);
p = (StgPtr)payload;
switch (fun_info->f.fun_type) {
case ARG_GEN:
bitmap = BITMAP_BITS(fun_info->f.b.bitmap);
p = traverseSmallBitmap(ts, p, n_args, bitmap,
pap, sep, data);
break;
case ARG_GEN_BIG:
traverseLargeBitmap(ts, p, GET_FUN_LARGE_BITMAP(fun_info),
n_args, pap, sep, data);
p += n_args;
break;
case ARG_BCO:
traverseLargeBitmap(ts, (StgPtr)payload, BCO_BITMAP(fun),
n_args, pap, sep, data);
p += n_args;
break;
default:
bitmap = BITMAP_BITS(stg_arg_bitmaps[fun_info->f.fun_type]);
p = traverseSmallBitmap(ts, p, n_args, bitmap, pap, sep, data);
break;
}
return p;
}
static void
resetMutableObjects(traverseState* ts)
{
uint32_t g, n;
bdescr *bd;
StgPtr ml;
// The following code resets the 'trav' field of each unvisited mutable
// object.
for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
// NOT true: even G0 has a block on its mutable list
// ASSERT(g != 0 || (generations[g].mut_list == NULL));
// Traversing through mut_list is necessary
// because we can find MUT_VAR objects which have not been
// visited during heap traversal.
for (n = 0; n < n_capabilities; n++) {
for (bd = capabilities[n]->mut_lists[g]; bd != NULL; bd = bd->link) {
for (ml = bd->start; ml < bd->free; ml++) {
traverseMaybeInitClosureData(ts, (StgClosure *)*ml);
}
}
}
}
}
/**
* Traverse all closures on the traversal work-stack, calling 'visit_cb' on each
* closure. See 'visitClosure_cb' for details.
*/
void
traverseWorkStack(traverseState *ts, visitClosure_cb visit_cb)
{
// first_child = first child of c
StgClosure *c, *cp, *first_child;
stackData data, child_data;
StgWord typeOfc;
stackElement *sep;
bool other_children;
// c = Current closure (possibly tagged)
// cp = Current closure's Parent (NOT tagged)
// data = current closures' associated data (NOT tagged)
// child_data = data to associate with current closure's children
loop:
traversePop(ts, &c, &cp, &data, &sep);
if (c == NULL) {
debug("maxStackSize= %d\n", ts->maxStackSize);
return;
}
inner_loop:
c = UNTAG_CLOSURE(c);
typeOfc = get_itbl(c)->type;
// special cases
switch (typeOfc) {
case TSO:
if (((StgTSO *)c)->what_next == ThreadComplete ||
((StgTSO *)c)->what_next == ThreadKilled) {
debug("ThreadComplete or ThreadKilled encountered in traverseWorkStack()\n");
goto loop;
}
break;
case IND_STATIC:
// We just skip IND_STATIC, so it's never visited.
c = ((StgIndStatic *)c)->indirectee;
goto inner_loop;
case CONSTR_NOCAF:
// static objects with no pointers out, so goto loop.
// It is not just enough not to visit *c; it is
// mandatory because CONSTR_NOCAF are not reachable from
// scavenged_static_objects, the list from which is assumed to traverse
// all static objects after major garbage collections.
goto loop;
case THUNK_STATIC:
if (get_itbl(c)->srt == 0) {
// No need to visit *c; no dynamic objects are reachable from it.
//
// Static objects: if we traverse all the live closures,
// including static closures, during each heap census then
// we will observe that some static closures appear and
// disappear. eg. a closure may contain a pointer to a
// static function 'f' which is not otherwise reachable
// (it doesn't indirectly point to any CAFs, so it doesn't
// appear in any SRTs), so we would find 'f' during
// traversal. However on the next sweep there may be no
// closures pointing to 'f'.
//
// We must therefore ignore static closures whose SRT is
// empty, because these are exactly the closures that may
// "appear". A closure with a non-empty SRT, and which is
// still required, will always be reachable.
//
// But what about CONSTR? Surely these may be able
// to appear, and they don't have SRTs, so we can't
// check. So for now, we're calling
// resetStaticObjectForProfiling() from the
// garbage collector to reset the retainer sets in all the
// reachable static objects.
goto loop;
}
/* fall-thru */
case FUN_STATIC: {
const StgInfoTable *info = get_itbl(c);
if (info->srt == 0 && info->layout.payload.ptrs == 0) {
goto loop;
} else {
break;
}
}
default:
break;
}
stackAccum accum = {};
// If this is the first visit to c, initialize its data.
bool first_visit = traverseMaybeInitClosureData(ts, c);
bool traverse_children = first_visit;
if(visit_cb)
traverse_children = visit_cb(c, cp, data, first_visit,
&accum, &child_data);
if(!traverse_children)
goto loop;
// process child
// Special case closures: we process these all in one go rather
// than attempting to save the current position, because doing so
// would be hard.
switch (typeOfc) {
case STACK:
sep = traversePushReturn(ts, c, accum, sep);
traversePushStack(ts, c, sep, child_data,
((StgStack *)c)->sp,
((StgStack *)c)->stack + ((StgStack *)c)->stack_size);
goto loop;
case TSO:
{
StgTSO *tso = (StgTSO *)c;
sep = traversePushReturn(ts, c, accum, sep);
traversePushClosure(ts, (StgClosure *) tso->stackobj, c, sep, child_data);
traversePushClosure(ts, (StgClosure *) tso->blocked_exceptions, c, sep, child_data);
traversePushClosure(ts, (StgClosure *) tso->bq, c, sep, child_data);
traversePushClosure(ts, (StgClosure *) tso->trec, c, sep, child_data);
if ( tso->why_blocked == BlockedOnMVar
|| tso->why_blocked == BlockedOnMVarRead
|| tso->why_blocked == BlockedOnIOCompletion
|| tso->why_blocked == BlockedOnBlackHole
|| tso->why_blocked == BlockedOnMsgThrowTo
) {
traversePushClosure(ts, tso->block_info.closure, c, sep, child_data);
}
goto loop;
}
case BLOCKING_QUEUE:
{
StgBlockingQueue *bq = (StgBlockingQueue *)c;
sep = traversePushReturn(ts, c, accum, sep);
traversePushClosure(ts, (StgClosure *) bq->link, c, sep, child_data);
traversePushClosure(ts, (StgClosure *) bq->bh, c, sep, child_data);
traversePushClosure(ts, (StgClosure *) bq->owner, c, sep, child_data);
goto loop;
}
case PAP:
{
StgPAP *pap = (StgPAP *)c;
sep = traversePushReturn(ts, c, accum, sep);
traversePAP(ts, c, sep, child_data, pap->fun, pap->payload, pap->n_args);
goto loop;
}
case AP:
{
StgAP *ap = (StgAP *)c;
sep = traversePushReturn(ts, c, accum, sep);
traversePAP(ts, c, sep, child_data, ap->fun, ap->payload, ap->n_args);
goto loop;
}
case AP_STACK:
sep = traversePushReturn(ts, c, accum, sep);
traversePushClosure(ts, ((StgAP_STACK *)c)->fun, c, sep, child_data);
traversePushStack(ts, c, sep, child_data,
(StgPtr)((StgAP_STACK *)c)->payload,
(StgPtr)((StgAP_STACK *)c)->payload +
((StgAP_STACK *)c)->size);
goto loop;
}
stackElement se;
traverseGetChildren(c, &first_child, &other_children, &se);
// If first_child is null, c has no child.
// If first_child is not null, the top stack element points to the next
// object.
if(first_child == NULL && ts->return_cb) { // no children
// This is only true when we're pushing additional return frames onto
// the stack due to return_cb, so don't get any funny ideas about
// replacing 'cp' by sep.
ASSERT(sep->c == cp);
ts->return_cb(c, accum, cp, &sep->accum);
goto loop;
} else if (first_child == NULL) { // no children
goto loop;
} else if(!other_children) { // one child
// Pushing a return frame for one child is pretty inefficent. We could
// optimize this by storing a pointer to cp in c's profiling header
// instead. I tested this out in a Haskell prototype of this code and it
// works out but is rather fiddly.
//
// See Haskell model code here:
//
// https://gitlab.haskell.org/ghc/ghc/snippets/1461
sep = traversePushReturn(ts, c, accum, sep);
} else { // many children
se.sep = sep;
se.data = child_data;
se.accum = accum;
sep = pushStackElement(ts, se);
}
// (c, cp, data) = (first_child, c, child_data)
data = child_data;
cp = c;
c = first_child;
goto inner_loop;
}
/**
* This function flips the 'flip' bit and hence every closure's profiling data
* will be reset to zero upon visiting. See Note [Profiling heap traversal
* visited bit].
*/
void
traverseInvalidateClosureData(traverseState* ts)
{
// First make sure any unvisited mutable objects are valid so they're
// invalidated by the flip below
resetMutableObjects(ts);
// Then flip the flip bit, invalidating all closures.
ts->flip = ts->flip ^ 1;
}
/**
* Traverse all static objects and invalidate their traversal-data. This ensures
* that when doing the actual traversal no static closures will seem to have
* been visited already because they weren't visited in the last run.
*
* This function must be called before zeroing all objects reachable from
* scavenged_static_objects in the case of major garbage collections. See
* GarbageCollect() in GC.c.
*
* Note:
*
* The mut_once_list of the oldest generation must also be traversed?
*
* Why? Because if the evacuation of an object pointed to by a static
* indirection object fails, it is put back to the mut_once_list of the oldest
* generation.
*
* However, this is not necessary because any static indirection objects are
* just traversed through to reach dynamic objects. In other words, they are
* never visited during traversal.
*/
void
resetStaticObjectForProfiling( const traverseState *ts, StgClosure *static_objects )
{
uint32_t count = 0;
StgClosure *p;
p = static_objects;
while (p != END_OF_STATIC_OBJECT_LIST) {
p = UNTAG_STATIC_LIST_PTR(p);
count++;
switch (get_itbl(p)->type) {
case IND_STATIC:
// Since we do not compute the retainer set of any
// IND_STATIC object, we don't have to reset its retainer
// field.
p = (StgClosure*)*IND_STATIC_LINK(p);
break;
case THUNK_STATIC:
traverseMaybeInitClosureData(ts, p);
p = (StgClosure*)*THUNK_STATIC_LINK(p);
break;
case FUN_STATIC:
case CONSTR:
case CONSTR_1_0:
case CONSTR_2_0:
case CONSTR_1_1:
case CONSTR_NOCAF:
traverseMaybeInitClosureData(ts, p);
p = (StgClosure*)*STATIC_LINK(get_itbl(p), p);
break;
default:
barf("resetStaticObjectForProfiling: %p (%lu)",
p, (unsigned long)get_itbl(p)->type);
break;
}
}
debug("count in scavenged_static_objects = %d\n", count);
}
#endif /* PROFILING */
|
the_stack_data/22082.c | /*
*/
#if defined(USE_POW)
#define r23 pow(0.5, 23.0)
#define r46 (r23*r23)
#define t23 pow(2.0, 23.0)
#define t46 (t23*t23)
#else
#define r23 (0.5*0.5*0.5*0.5*0.5*0.5*0.5*0.5*0.5*0.5*0.5*0.5*0.5*0.5*0.5*0.5*0.5*0.5*0.5*0.5*0.5*0.5*0.5)
#define r46 (r23*r23)
#define t23 (2.0*2.0*2.0*2.0*2.0*2.0*2.0*2.0*2.0*2.0*2.0*2.0*2.0*2.0*2.0*2.0*2.0*2.0*2.0*2.0*2.0*2.0*2.0)
#define t46 (t23*t23)
#endif
/*c---------------------------------------------------------------------
c---------------------------------------------------------------------*/
double randlc (double *x, double a) {
/*c---------------------------------------------------------------------
c---------------------------------------------------------------------*/
/*c---------------------------------------------------------------------
c
c This routine returns a uniform pseudorandom double precision number in the
c range (0, 1) by using the linear congruential generator
c
c x_{k+1} = a x_k (mod 2^46)
c
c where 0 < x_k < 2^46 and 0 < a < 2^46. This scheme generates 2^44 numbers
c before repeating. The argument A is the same as 'a' in the above formula,
c and X is the same as x_0. A and X must be odd double precision integers
c in the range (1, 2^46). The returned value RANDLC is normalized to be
c between 0 and 1, i.e. RANDLC = 2^(-46) * x_1. X is updated to contain
c the new seed x_1, so that subsequent calls to RANDLC using the same
c arguments will generate a continuous sequence.
c
c This routine should produce the same results on any computer with at least
c 48 mantissa bits in double precision floating point data. On 64 bit
c systems, double precision should be disabled.
c
c David H. Bailey October 26, 1990
c
c---------------------------------------------------------------------*/
double t1,t2,t3,t4,a1,a2,x1,x2,z;
/*c---------------------------------------------------------------------
c Break A into two parts such that A = 2^23 * A1 + A2.
c---------------------------------------------------------------------*/
t1 = r23 * a;
a1 = (int)t1;
a2 = a - t23 * a1;
/*c---------------------------------------------------------------------
c Break X into two parts such that X = 2^23 * X1 + X2, compute
c Z = A1 * X2 + A2 * X1 (mod 2^23), and then
c X = 2^23 * Z + A2 * X2 (mod 2^46).
c---------------------------------------------------------------------*/
t1 = r23 * (*x);
x1 = (int)t1;
x2 = (*x) - t23 * x1;
t1 = a1 * x2 + a2 * x1;
t2 = (int)(r23 * t1);
z = t1 - t23 * t2;
t3 = t23 * z + a2 * x2;
t4 = (int)(r46 * t3);
(*x) = t3 - t46 * t4;
return (r46 * (*x));
}
/*c---------------------------------------------------------------------
c---------------------------------------------------------------------*/
void vranlc (int n, double *x_seed, double a, double* y) {
/*c---------------------------------------------------------------------
c---------------------------------------------------------------------*/
/*c---------------------------------------------------------------------
c
c This routine generates N uniform pseudorandom double precision numbers in
c the range (0, 1) by using the linear congruential generator
c
c x_{k+1} = a x_k (mod 2^46)
c
c where 0 < x_k < 2^46 and 0 < a < 2^46. This scheme generates 2^44 numbers
c before repeating. The argument A is the same as 'a' in the above formula,
c and X is the same as x_0. A and X must be odd double precision integers
c in the range (1, 2^46). The N results are placed in Y and are normalized
c to be between 0 and 1. X is updated to contain the new seed, so that
c subsequent calls to VRANLC using the same arguments will generate a
c continuous sequence. If N is zero, only initialization is performed, and
c the variables X, A and Y are ignored.
c
c This routine is the standard version designed for scalar or RISC systems.
c However, it should produce the same results on any single processor
c computer with at least 48 mantissa bits in double precision floating point
c data. On 64 bit systems, double precision should be disabled.
c
c---------------------------------------------------------------------*/
int i;
double x,t1,t2,t3,t4,a1,a2,x1,x2,z;
double __a;
/*c---------------------------------------------------------------------
c Break A into two parts such that A = 2^23 * A1 + A2.
c---------------------------------------------------------------------*/
t1 = r23 * a;
a1 = (int)t1;
a2 = a - t23 * a1;
x = *x_seed;
/*c---------------------------------------------------------------------
c Generate N results. This loop is not vectorizable.
c---------------------------------------------------------------------*/
for (i = 1; i <= n; i++) {
/*c---------------------------------------------------------------------
c Break X into two parts such that X = 2^23 * X1 + X2, compute
c Z = A1 * X2 + A2 * X1 (mod 2^23), and then
c X = 2^23 * Z + A2 * X2 (mod 2^46).
c---------------------------------------------------------------------*/
t1 = r23 * x;
x1 = (int)t1;
x2 = x - t23 * x1;
t1 = a1 * x2 + a2 * x1;
t2 = (int)(r23 * t1);
z = t1 - t23 * t2;
t3 = t23 * z + a2 * x2;
t4 = (int)(r46 * t3);
x = t3 - t46 * t4;
y[i] = r46 * x;
}
*x_seed = x;
}
|
the_stack_data/37637053.c | /* Copyright (C) 1996, 1997, 1999 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Ulrich Drepper <[email protected]>, 1996.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
The GNU C Library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with the GNU C Library; if not, write to the Free
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
02111-1307 USA. */
#include <netinet/ether.h>
#include <netinet/if_ether.h>
char *
ether_ntoa (const struct ether_addr *addr)
{
static char asc[18];
return ether_ntoa_r (addr, asc);
}
|
the_stack_data/182953536.c | /*
* Copyright (c) 2013, 2014 Jonas 'Sortie' Termansen.
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*
* string/strlcpy.c
* Copies a string and truncates it if the destination is too small.
*/
#include <string.h>
size_t strlcpy(char* restrict dest, const char* restrict src, size_t size)
{
if ( !size )
return strlen(src);
size_t result;
for ( result = 0; result < size-1 && src[result]; result++ )
dest[result] = src[result];
dest[result] = '\0';
return result + strlen(src + result);
}
|
the_stack_data/548982.c | #include<stdio.h>
#include<string.h>
long long n;
long long f[16];
void reverse(char *s,int len) {
int i;
char t;
for(i=0;i<len-i-1;i++) {
t=s[i],s[i]=s[len-i-1],s[len-i-1]=t;
}
}
int len(long long n) {
char str[16];
sprintf(str,"%lld",n);
return strlen(str);
}
int main() {
int N,cs=0,i,l;
char str[16];
long long ret,t,t1,t2,tt;
for(f[0]=i=1;i<16;i++) f[i]=f[i-1]*10;
for(scanf("%d",&N);N--;) {
scanf("%lld",&n);
ret=n;
sprintf(str,"%lld",n);
l=strlen(str);
for(t=i=0;i<l-1;i++) {
t+=f[(i+1)/2]-1+f[(i+1)-(i+1)/2];
if (!i) t--;
}
ret=t+(n-f[l-1])+1;
// fprintf(stderr,"%lld %d %lld\n",t,l,ret);
for(t1=i=0;i<=l;i++) {
sscanf(str+i,"%lld",&t2);
tt=t1+t2+t+1;
if (!t2) {
tt=t+f[l-i]+1;
if (t1<f[i-1]) {
int l1 = len(t1);
// printf("%lld %d\n",tt,l1);
tt+=f[i]+t1-f[l1]-f[l1-1];
} else tt+=t1-f[i-1];
}
// printf("%d %lld %lld %lld\n",i,t1,t2,tt);
if (tt<ret) ret=tt;
t1=t1+(str[i]-'0')*f[i];
}
printf("Case #%d: %lld\n",++cs,ret);
}
return 0;
}
|
the_stack_data/175144558.c | #include <stdio.h>
int print_hash_value = 1;
static void platform_main_begin(void)
{
}
static unsigned crc32_tab[256];
static unsigned crc32_context = 0xFFFFFFFFUL;
static void
crc32_gentab (void)
{
unsigned crc;
unsigned poly = 0xEDB88320UL;
int i, j;
for (i = 0; i < 256; i++) {
crc = i;
for (j = 8; j > 0; j--) {
if (crc & 1) {
crc = (crc >> 1) ^ poly;
} else {
crc >>= 1;
}
}
crc32_tab[i] = crc;
}
}
static void
crc32_byte (unsigned char b) {
crc32_context =
((crc32_context >> 8) & 0x00FFFFFF) ^
crc32_tab[(crc32_context ^ b) & 0xFF];
}
extern int strcmp ( char *, char *);
static void
crc32_8bytes (unsigned val)
{
crc32_byte ((val>>0) & 0xff);
crc32_byte ((val>>8) & 0xff);
crc32_byte ((val>>16) & 0xff);
crc32_byte ((val>>24) & 0xff);
}
static void
transparent_crc (unsigned val, char* vname, int flag)
{
crc32_8bytes(val);
if (flag) {
printf("...checksum after hashing %s : %X\n", vname, crc32_context ^ 0xFFFFFFFFU);
}
}
static void
platform_main_end (int x, int flag)
{
if (!flag) printf ("checksum = %x\n", x);
}
static long __undefined;
void csmith_compute_hash(void);
void step_hash(int stmt_id);
static int g_7 = 0x386CCE57L;
static int *g_6 = &g_7;
static unsigned g_28 = 4294967290UL;
static int g_70 = 0x6A74B4FBL;
static int *g_104 = &g_7;
static int **g_204 = &g_104;
static int ***g_203 = &g_204;
static unsigned short g_248 = 0x570AL;
static int g_271 = 1L;
static int g_312 = 0x0E0531CCL;
static int *g_329 = &g_7;
static signed char func_1(void);
static int * func_2(int * p_3, unsigned short p_4, unsigned p_5);
static signed char func_8(int * p_9, signed char p_10);
static int * func_11(int * p_12);
static int * func_13(int * p_14, int p_15);
static int * func_16(unsigned p_17, short p_18);
static int * func_21(signed char p_22);
static int * func_33(unsigned p_34, int p_35, unsigned p_36, int p_37, int ** p_38);
static unsigned char func_41(short p_42, int * p_43, int * p_44, int * p_45, int ** p_46);
static short func_47(int * p_48);
static signed char func_1(void)
{
signed char l_330 = 0L;
int **l_506 = (void*)0;
int **l_507 = &g_6;
step_hash(335);
(*l_507) = func_2(g_6, (func_8(func_11(func_13(func_16(g_7, g_7), l_330)), g_248) ^ g_248), g_248);
step_hash(336);
(**l_507) = (-5L);
step_hash(337);
return (**l_507);
}
static int * func_2(int * p_3, unsigned short p_4, unsigned p_5)
{
int l_504 = 0x44675D09L;
int **l_505 = &g_329;
step_hash(332);
(**g_203) = func_33(((unsigned char)(p_5 ^ (*p_3)) * (unsigned char)((((unsigned)(((((short)((void*)0 == &g_204) * (short)(((void*)0 == &p_3) == l_504)) <= (~((&l_504 == (void*)0) & g_70))) && l_504) ^ 0UL) % (unsigned)0x16825E04L) != l_504) & (*g_6))), l_504, l_504, l_504, l_505);
step_hash(333);
(*g_104) = (*p_3);
step_hash(334);
return (*g_204);
}
static signed char func_8(int * p_9, signed char p_10)
{
int ***l_353 = &g_204;
int *l_358 = &g_312;
int *l_365 = &g_312;
unsigned l_401 = 0x9AA9D4D8L;
signed char l_414 = 0x8EL;
int l_439 = 0L;
step_hash(245);
(*l_358) |= (((unsigned char)(((signed char)((signed char)(((signed char)(+(((signed char)((int)p_10 + (int)(l_353 != &g_204)) << (signed char)7) || (((0UL >= ((signed char)g_7 + (signed char)g_248)) && (0x5DL == (l_353 == (void*)0))) > p_10))) - (signed char)1L) || g_7) % (signed char)g_28) << (signed char)g_70) | g_271) * (unsigned char)0UL) == 5L);
step_hash(313);
if ((((short)((*l_358) && ((**l_353) != (**g_203))) * (short)(*l_358)) != (((unsigned short)((unsigned)((*l_358) >= p_10) + (unsigned)((*l_353) != (void*)0)) << (unsigned short)10) ^ ((void*)0 != l_353))))
{
int *l_366 = &g_312;
int l_369 = 0L;
step_hash(247);
(*g_329) ^= (*l_366);
step_hash(248);
(*l_365) &= ((unsigned short)l_369 - (unsigned short)p_10);
}
else
{
short l_374 = 0x101EL;
int *l_377 = (void*)0;
int *l_420 = &g_7;
int *l_430 = &g_312;
int l_456 = 1L;
unsigned short l_462 = 0x80F5L;
step_hash(266);
if (((short)((signed char)(!l_374) << (signed char)(g_248 | g_312)) * (short)7UL))
{
int *l_378 = (void*)0;
step_hash(251);
(*g_204) = l_377;
step_hash(252);
(*g_329) |= (g_271 & (((p_10 <= (((short)0x2AB5L << (short)((void*)0 == (*g_203))) & g_271)) || (((unsigned)((unsigned short)(g_248 != (g_248 || g_271)) / (unsigned short)g_312) / (unsigned)0x4928AC87L) ^ 0xDBL)) < p_10));
}
else
{
step_hash(263);
for (g_70 = (-17); (g_70 < 21); g_70 += 7)
{
step_hash(261);
for (g_7 = 0; (g_7 < 29); ++g_7)
{
step_hash(260);
(**l_353) = func_21(g_271);
}
step_hash(262);
(*g_6) = ((g_271 | (g_248 == ((unsigned char)((unsigned)4294967295UL % (unsigned)((short)g_312 << (short)(&p_9 != (*g_203)))) / (unsigned char)((unsigned short)p_10 << (unsigned short)9)))) >= p_10);
}
step_hash(264);
(**g_203) = func_21(p_10);
step_hash(265);
(*g_329) &= (((*g_203) != (*g_203)) != (0x33CBL & g_312));
}
step_hash(267);
(*g_6) ^= ((unsigned char)p_10 - (unsigned char)(*l_365));
step_hash(311);
if (((0x3EL ^ (0x7861L != (*l_365))) || (*l_358)))
{
unsigned l_413 = 4294967289UL;
int *l_419 = &g_312;
step_hash(269);
(*l_365) = ((unsigned)((unsigned char)0UL - (unsigned char)g_271) % (unsigned)(-(int)(((int)func_41(g_28, l_419, l_420, l_420, &l_419) / (int)l_413) < 4294967288UL)));
}
else
{
int *l_427 = (void*)0;
int l_428 = (-1L);
unsigned l_429 = 0x62E70A77L;
step_hash(271);
(*g_329) = ((short)((((unsigned char)(p_10 || ((signed char)(0x15214DAFL == g_271) << (signed char)6)) >> (unsigned char)((*l_365) | p_10)) < l_428) | l_429) + (short)l_428);
step_hash(272);
(*g_203) = (*g_203);
step_hash(309);
if (p_10)
{
int **l_435 = &l_377;
step_hash(274);
(*g_6) = ((signed char)g_248 * (signed char)((*g_203) != l_435));
step_hash(275);
l_439 ^= (((((0xC75A7728L | (-(unsigned short)((((*l_358) && ((*l_358) ^ g_7)) != ((short)p_10 >> (short)9)) < (g_28 != ((&g_204 != (void*)0) || 0x9597B686L))))) == p_10) > g_7) != g_312) || g_248);
}
else
{
unsigned char l_444 = 1UL;
int *l_476 = &g_7;
step_hash(287);
if (((unsigned short)((*g_204) != p_9) % (unsigned short)g_271))
{
step_hash(278);
(*g_204) = (*g_204);
}
else
{
step_hash(285);
for (l_439 = 0; (l_439 > (-6)); l_439 -= 4)
{
step_hash(283);
(*l_358) = (3L >= (l_444 < ((signed char)(-(int)(*g_329)) / (signed char)5L)));
step_hash(284);
if (p_10)
break;
}
step_hash(286);
(*g_204) = (*g_204);
}
step_hash(288);
(*l_430) |= ((unsigned char)(~(((unsigned short)l_444 << (unsigned short)1) & 0x83L)) + (unsigned char)p_10);
step_hash(307);
for (l_374 = 0; (l_374 <= 26); l_374 += 1)
{
int l_454 = 3L;
int *l_455 = (void*)0;
int **l_457 = (void*)0;
int l_475 = 0x3296AF75L;
}
step_hash(308);
(*g_6) = (*l_365);
}
step_hash(310);
(*l_358) = (*g_329);
}
step_hash(312);
(**l_353) = (*g_204);
}
step_hash(314);
(*l_358) = ((short)p_10 - (short)(g_271 <= ((unsigned short)((*l_358) || 1L) * (unsigned short)0x4600L)));
step_hash(329);
if ((((signed char)((void*)0 == &g_204) * (signed char)(*l_365)) && (*l_358)))
{
step_hash(322);
for (g_70 = 0; (g_70 < 27); ++g_70)
{
int l_492 = 9L;
step_hash(319);
p_9 = (**l_353);
step_hash(320);
l_492 = ((signed char)(((0x40L & ((l_492 > g_7) <= p_10)) ^ (((short)p_10 >> (short)(0xC281L == ((void*)0 == (*l_353)))) == (-1L))) > p_10) >> (signed char)g_271);
step_hash(321);
(*l_358) = 0xF185857AL;
}
}
else
{
step_hash(328);
for (l_414 = 0; (l_414 >= 1); l_414 += 1)
{
int *l_497 = &g_7;
step_hash(327);
l_497 = func_11(p_9);
}
}
step_hash(330);
return p_10;
}
static int * func_11(int * p_12)
{
unsigned char l_339 = 0x1BL;
int l_340 = 0x343EB088L;
step_hash(240);
(*g_329) ^= 0xCA18A4ECL;
step_hash(241);
l_340 = ((l_339 <= l_339) ^ g_271);
step_hash(242);
(*g_203) = &g_104;
step_hash(243);
return (**g_203);
}
static int * func_13(int * p_14, int p_15)
{
unsigned char l_335 = 0x35L;
int *l_338 = (void*)0;
step_hash(236);
(*p_14) = (*p_14);
step_hash(237);
p_14 = &p_15;
step_hash(238);
return l_338;
}
static int * func_16(unsigned p_17, short p_18)
{
int *l_20 = &g_7;
int **l_19 = &l_20;
step_hash(2);
(*l_19) = &g_7;
step_hash(6);
(*l_19) = func_21(p_17);
step_hash(233);
if ((((0x7C629C4DL >= g_7) && ((signed char)((&l_20 != (void*)0) >= (*l_20)) << (signed char)7)) && (*l_20)))
{
step_hash(13);
for (p_18 = 26; (p_18 == (-23)); p_18 -= 1)
{
step_hash(11);
(*g_6) = (-1L);
step_hash(12);
(*g_6) &= 0x8BC698DCL;
}
}
else
{
int l_39 = 1L;
int **l_272 = &g_6;
step_hash(231);
g_329 = func_33(l_39, (-(int)(func_41(func_47(func_21(((short)l_39 >> (short)(g_28 > g_28)))), (*l_19), &l_39, (*l_19), l_272) | g_248)), g_248, g_248, &l_20);
step_hash(232);
(*l_19) = func_21(p_17);
}
step_hash(234);
return &g_7;
}
static int * func_21(signed char p_22)
{
signed char l_27 = 0x0EL;
step_hash(4);
g_28 ^= (0x6EEAL | (((signed char)p_22 * (signed char)(0xDACDL <= (((signed char)g_7 >> (signed char)7) | g_7))) | (+l_27)));
step_hash(5);
return &g_7;
}
static int * func_33(unsigned p_34, int p_35, unsigned p_36, int p_37, int ** p_38)
{
int *l_296 = &g_7;
step_hash(216);
for (p_36 = 0; (p_36 > 59); p_36 += 2)
{
int *l_297 = &g_70;
step_hash(187);
(*g_6) = (p_34 > g_271);
step_hash(215);
for (g_70 = 0; (g_70 >= 4); ++g_70)
{
int *l_278 = &g_7;
step_hash(191);
l_278 = (*p_38);
step_hash(213);
for (g_28 = 0; (g_28 != 7); g_28 += 6)
{
short l_284 = 0L;
int *l_313 = &g_70;
}
step_hash(214);
return l_296;
}
}
step_hash(229);
if (((unsigned short)func_41((g_312 > ((*p_38) != (void*)0)), (*p_38), (*p_38), (*p_38), p_38) + (unsigned short)0x89B6L))
{
int *l_320 = (void*)0;
step_hash(218);
(*p_38) = func_21((*l_296));
step_hash(219);
(**p_38) = (((unsigned short)((int)(*l_296) + (int)(((unsigned short)((unsigned char)p_35 + (unsigned char)g_70) + (unsigned short)(+p_35)) < p_37)) * (unsigned short)g_7) || p_36);
step_hash(220);
(**p_38) &= (-(unsigned char)255UL);
}
else
{
step_hash(228);
for (p_34 = 0; (p_34 > 19); ++p_34)
{
int *l_328 = &g_70;
step_hash(225);
(*p_38) = (*p_38);
step_hash(226);
(**p_38) = (*l_296);
step_hash(227);
return l_328;
}
}
step_hash(230);
return l_296;
}
static unsigned char func_41(short p_42, int * p_43, int * p_44, int * p_45, int ** p_46)
{
int *l_273 = (void*)0;
step_hash(178);
(**p_46) = 0x1734EC99L;
step_hash(179);
(*p_45) = 0x222683E6L;
step_hash(180);
l_273 = (*p_46);
step_hash(181);
(*g_6) = (*p_43);
step_hash(182);
return (*l_273);
}
static short func_47(int * p_48)
{
int **l_53 = &g_6;
unsigned char l_54 = 9UL;
unsigned l_127 = 0UL;
unsigned char l_199 = 0xEDL;
int l_249 = 0L;
step_hash(175);
if (((short)(+(4294967290UL ^ (l_53 != (void*)0))) - (short)l_54))
{
signed char l_57 = 0xFDL;
step_hash(17);
(*p_48) = ((unsigned char)l_57 * (unsigned char)(**l_53));
step_hash(18);
(*p_48) = ((unsigned char)((l_57 == 0x9FL) < ((unsigned char)l_57 / (unsigned char)l_57)) * (unsigned char)0x49L);
}
else
{
int l_67 = 1L;
int **l_77 = &g_6;
int l_82 = 0L;
unsigned l_103 = 0xBB1179EFL;
int l_166 = (-6L);
step_hash(172);
if ((*p_48))
{
unsigned short l_88 = 0xA040L;
int *l_107 = &l_82;
int ***l_182 = &l_77;
unsigned l_197 = 0x6AE705E6L;
step_hash(21);
(*p_48) = (((void*)0 != &g_7) || (&p_48 != l_53));
step_hash(84);
if ((**l_53))
{
unsigned short l_66 = 65535UL;
step_hash(36);
for (g_7 = 0; (g_7 != (-16)); g_7 -= 3)
{
unsigned l_87 = 0UL;
step_hash(26);
l_66 = (g_7 == ((unsigned short)g_28 - (unsigned short)g_7));
step_hash(34);
if (l_67)
{
int *l_68 = (void*)0;
int *l_69 = &g_70;
step_hash(28);
(*l_69) = (*g_6);
}
else
{
short l_71 = 0x0716L;
int **l_72 = (void*)0;
int *l_74 = &g_7;
int **l_73 = &l_74;
step_hash(30);
(*l_73) = func_21(l_71);
step_hash(31);
if ((*g_6))
continue;
step_hash(32);
l_82 ^= (((unsigned short)((l_77 == l_53) >= ((unsigned short)((*g_6) == ((unsigned short)(((*p_48) && g_28) != (&p_48 != &p_48)) >> (unsigned short)12)) * (unsigned short)(**l_77))) - (unsigned short)(g_7 & g_70)) ^ (-1L));
step_hash(33);
(*l_73) = func_21(g_28);
}
step_hash(35);
l_88 = ((unsigned)((unsigned short)(**l_53) / (unsigned short)l_87) + (unsigned)l_66);
}
step_hash(53);
if ((((&g_6 != (void*)0) <= (0x5C30L | ((g_7 & ((**l_53) > ((+8L) & ((((**l_77) != 0x4896B3C8L) && (0UL & (**l_53))) > 246UL)))) || g_7))) && 4294967286UL))
{
unsigned l_94 = 4294967292UL;
step_hash(43);
for (l_66 = 0; (l_66 < 34); l_66 += 5)
{
int *l_93 = &l_82;
step_hash(41);
(*l_93) |= (*p_48);
step_hash(42);
(*g_6) = (l_94 && (0x7B54C1CEL || ((signed char)(((((*l_93) & g_28) ^ (**l_77)) | ((0xA6L == (**l_53)) & g_28)) >= (+((unsigned short)((l_88 | l_94) != g_28) << (unsigned short)8))) - (signed char)1UL)));
}
step_hash(48);
for (g_28 = (-27); (g_28 != 29); g_28 += 6)
{
step_hash(47);
return g_7;
}
}
else
{
short l_120 = 0x31D7L;
int l_128 = (-3L);
step_hash(50);
g_104 = func_21((g_7 <= ((unsigned short)l_66 / (unsigned short)l_103)));
step_hash(51);
(*g_104) &= (((unsigned)(l_107 != &g_70) - (unsigned)0UL) == 0x34387970L);
step_hash(52);
l_128 |= (g_28 && (((**l_77) ^ (((unsigned char)((short)((int)((unsigned short)(((unsigned short)(l_120 ^ (((unsigned short)l_66 * (unsigned short)((((signed char)g_28 * (signed char)((signed char)0x42L * (signed char)((**l_77) < (**l_53)))) && ((&g_70 != p_48) | l_120)) & 0xAD9A11D3L)) ^ g_7)) / (unsigned short)g_7) <= (**l_77)) + (unsigned short)l_127) - (int)(-8L)) - (short)(**l_77)) % (unsigned char)g_70) != 0xF8L)) != (*g_104)));
}
step_hash(54);
(**l_53) &= l_66;
}
else
{
short l_133 = (-7L);
int *l_136 = &g_70;
step_hash(56);
(*p_48) = ((unsigned short)g_70 << (unsigned short)2);
step_hash(57);
g_104 = func_21((*l_107));
step_hash(82);
if (((signed char)l_133 >> (signed char)((signed char)(l_136 != (void*)0) << (signed char)5)))
{
unsigned char l_147 = 0x6DL;
int ***l_174 = &l_53;
step_hash(65);
for (l_103 = (-2); (l_103 <= 34); ++l_103)
{
int **l_152 = &l_136;
step_hash(62);
(*l_107) ^= (((short)1L << (short)((unsigned char)((unsigned short)((**l_53) ^ (((((signed char)l_147 % (signed char)0x77L) <= g_70) > ((void*)0 != &p_48)) < g_28)) * (unsigned short)(((unsigned char)(((unsigned char)g_28 >> (unsigned char)g_28) & g_28) - (unsigned char)(*l_136)) && g_70)) << (unsigned char)g_28)) > 0xDFL);
step_hash(63);
(*l_152) = func_21((**l_53));
step_hash(64);
g_104 = (void*)0;
}
step_hash(76);
if ((*g_6))
{
unsigned short l_159 = 0UL;
step_hash(67);
(*l_107) ^= ((short)g_70 << (short)11);
step_hash(68);
p_48 = func_21(((signed char)(**l_53) + (signed char)(*l_107)));
step_hash(69);
(*l_136) = ((unsigned short)(((void*)0 != l_107) >= (**l_53)) % (unsigned short)(**l_77));
step_hash(70);
(*l_136) = (((l_159 < g_28) <= (g_70 ^ (((unsigned char)l_147 * (unsigned char)((unsigned)((signed char)g_70 << (signed char)3) + (unsigned)(l_166 != (251UL ^ (**l_53))))) <= l_159))) < l_159);
}
else
{
int *l_169 = &g_70;
int **l_170 = (void*)0;
int **l_171 = &g_104;
step_hash(72);
p_48 = func_21(((short)0x1A9CL << (short)7));
step_hash(73);
(*l_171) = l_169;
step_hash(74);
(*l_171) = &g_70;
step_hash(75);
(*l_136) = (g_7 & (((signed char)(**l_53) >> (signed char)(*l_136)) & (*l_136)));
}
step_hash(77);
(*l_174) = &l_136;
}
else
{
unsigned l_179 = 0x8C224E53L;
int *l_183 = &l_166;
step_hash(79);
p_48 = &g_70;
step_hash(80);
(*g_104) &= 0x4CD87840L;
step_hash(81);
(*l_183) ^= ((short)((((unsigned short)l_179 % (unsigned short)(((signed char)(*l_107) * (signed char)(**l_53)) && (*p_48))) && 0xF9L) & ((void*)0 == l_182)) << (short)0);
}
step_hash(83);
p_48 = p_48;
}
step_hash(85);
(*g_6) = (-9L);
step_hash(93);
if (((signed char)(***l_182) % (signed char)(~0x4CL)))
{
unsigned short l_186 = 0x9C59L;
step_hash(87);
(*l_107) &= (*p_48);
step_hash(88);
g_70 ^= ((((**l_77) | ((***l_182) | l_186)) < ((short)1L >> (short)g_7)) == (0xE5D6L < ((***l_182) != ((unsigned short)(((unsigned short)(((signed char)((*g_6) && ((unsigned)l_186 + (unsigned)g_28)) / (signed char)(***l_182)) || 0xFCL) * (unsigned short)l_197) != (**l_77)) << (unsigned short)12))));
}
else
{
step_hash(90);
(*l_107) |= (*g_6);
step_hash(91);
(*l_107) = (*p_48);
step_hash(92);
l_199 ^= (g_28 & (-(int)(***l_182)));
}
}
else
{
int **l_200 = &g_104;
int l_213 = 0x7B67C161L;
int *l_251 = &g_70;
step_hash(95);
(*l_200) = p_48;
step_hash(96);
(**l_77) = ((short)g_7 >> (short)6);
step_hash(171);
if (((void*)0 != p_48))
{
int l_207 = 1L;
int l_232 = 3L;
step_hash(98);
(*g_204) = func_21((g_203 == &g_204));
step_hash(103);
for (l_54 = 18; (l_54 == 29); l_54 += 1)
{
step_hash(102);
return l_207;
}
step_hash(136);
if ((**l_200))
{
int *l_212 = (void*)0;
step_hash(112);
if ((g_7 ^ ((**l_53) | ((unsigned short)g_70 - (unsigned short)((int)(*p_48) + (int)(**l_77))))))
{
step_hash(106);
(*l_200) = l_212;
step_hash(107);
(*g_203) = &p_48;
step_hash(108);
l_212 = (void*)0;
}
else
{
step_hash(110);
(***g_203) = (**l_77);
step_hash(111);
return (**l_77);
}
step_hash(113);
(**g_204) = (**g_204);
step_hash(114);
(**g_203) = func_21(g_28);
step_hash(122);
if ((((void*)0 != &g_204) && g_28))
{
unsigned l_214 = 0UL;
unsigned short l_221 = 0xE24DL;
step_hash(116);
l_213 &= (*g_6);
step_hash(117);
l_214 &= (**l_77);
step_hash(118);
(***g_203) &= (p_48 == l_212);
step_hash(119);
(*p_48) = (g_7 && ((((unsigned short)((((unsigned short)(((g_70 == l_207) > ((unsigned short)((p_48 == p_48) == ((l_207 > 0x346EL) & l_207)) + (unsigned short)l_221)) != 0xEBL) >> (unsigned short)g_7) || 4UL) ^ (**l_53)) - (unsigned short)l_221) == g_70) > g_7));
}
else
{
step_hash(121);
(**l_53) = (&g_204 == (void*)0);
}
}
else
{
step_hash(128);
for (g_70 = 0; (g_70 <= 4); g_70 += 2)
{
step_hash(127);
(*l_200) = func_21(g_70);
}
step_hash(129);
(***g_203) = (**l_200);
step_hash(135);
for (l_166 = 29; (l_166 > (-11)); l_166--)
{
unsigned l_230 = 4294967292UL;
int *l_231 = &l_213;
step_hash(133);
(*l_231) &= ((int)((short)l_230 >> (short)((*p_48) & 0x11894CECL)) / (int)0xAF6FDADEL);
step_hash(134);
(*l_231) &= (**g_204);
}
}
step_hash(137);
l_232 ^= 0x9798A6DBL;
}
else
{
unsigned short l_235 = 0x387BL;
int ***l_250 = &l_200;
step_hash(143);
for (l_166 = 0; (l_166 == 12); l_166 += 5)
{
step_hash(142);
return l_235;
}
step_hash(154);
for (g_28 = (-6); (g_28 == 54); g_28 += 4)
{
step_hash(151);
for (l_54 = (-19); (l_54 < 7); l_54++)
{
step_hash(150);
(**g_203) = (*g_204);
}
step_hash(152);
(**g_204) = (*g_104);
step_hash(153);
return g_28;
}
step_hash(159);
for (g_7 = (-24); (g_7 >= 17); g_7++)
{
step_hash(158);
l_249 = ((unsigned short)((signed char)(((short)(**l_200) * (short)g_248) ^ g_7) << (signed char)0) >> (unsigned short)7);
}
step_hash(170);
if (((void*)0 != l_250))
{
step_hash(167);
if ((*p_48))
{
step_hash(162);
(*g_6) = (!(*g_104));
}
else
{
step_hash(164);
(***l_250) = 0L;
step_hash(165);
(*g_6) = (**l_77);
step_hash(166);
l_251 = func_21((***l_250));
}
}
else
{
unsigned char l_258 = 0x66L;
step_hash(169);
(*g_104) = ((unsigned char)((**l_77) < (p_48 == p_48)) * (unsigned char)((*p_48) == ((signed char)g_70 + (signed char)(((short)((**l_77) && l_258) + (short)g_28) > ((signed char)((((g_70 | 0x60L) > (*p_48)) | (*p_48)) | (**l_53)) + (signed char)0x22L)))));
}
}
}
step_hash(173);
l_249 ^= ((((unsigned short)((*g_203) != l_77) % (unsigned short)((short)((int)((*p_48) < ((*p_48) || 7L)) - (int)(g_248 <= (0L && ((unsigned char)(p_48 == p_48) >> (unsigned char)g_7)))) / (short)(**l_77))) ^ (*g_6)) > (**l_77));
step_hash(174);
g_271 &= (!(*p_48));
}
step_hash(176);
return l_249;
}
void csmith_compute_hash(void)
{
transparent_crc(g_7, "g_7", print_hash_value);
transparent_crc(g_28, "g_28", print_hash_value);
transparent_crc(g_70, "g_70", print_hash_value);
transparent_crc(g_248, "g_248", print_hash_value);
transparent_crc(g_271, "g_271", print_hash_value);
transparent_crc(g_312, "g_312", print_hash_value);
}
void step_hash(int stmt_id)
{
int i = 0;
csmith_compute_hash();
printf("before stmt(%d): checksum = %X\n", stmt_id, crc32_context ^ 0xFFFFFFFFUL);
crc32_context = 0xFFFFFFFFUL;
for (i = 0; i < 256; i++) {
crc32_tab[i] = 0;
}
crc32_gentab();
}
int main (void)
{
int print_hash_value = 0;
platform_main_begin();
crc32_gentab();
func_1();
csmith_compute_hash();
platform_main_end(crc32_context ^ 0xFFFFFFFFUL, print_hash_value);
return 0;
}
|
the_stack_data/140222.c | #include <stdio.h>
int printhead() { printf("<section><h2>Tabla ASCII</h2>\n<table style=\"border-collapse: collapse; border:1px; width: 100%; font-size: 22px; \">\n"); }
int printtail() { printf("\n</table>\n</section>\n"); }
int printrowbegin() { printf("<tr>\n"); }
int printrowend() { printf("</tr>\n"); }
int printcell(int c) {
char *bg;
bg = "#EEEEEE";
if('A' <= c && c <= 'Z') bg = "#EEFF00";
if('a' <= c && c <= 'z') bg = "#FFCC00";
if('0' <= c && c <= '9') bg = "#00EEFF";
printf("<td align=\"right\" style=\"background-color: %s;\">%d</td><td align=\"center\" style=\"background-color: %s;\">%c</td> ", bg, c, bg, c);
}
main()
{
int i,j;
int c = 32;
int J = 8; // cols
int I;
I = (127-31)/J; // rows
printhead();
for(i=0; i<I; i++) {
printrowbegin();
for(j=0; j<J; j++) {
c = 32 + i + I * j;
//if(c == 127) goto chau;
printcell(c);
//printf("%3d %c ",c,c);
}
printrowend();
puts("");
}
chau: printtail();
}
|
the_stack_data/48793.c | #include <stdio.h>
void main()
{
long nc;
nc = 0;
while (getchar() != EOF)
++nc;
printf("%ld\n", nc);
} |
the_stack_data/182951865.c | #include<stdio.h>
#include<time.h>
#include<pthread.h>
#define MAX_PRODUCTION2_NUM 512
#define MAX_PRODUCTION1_NUM 128
#define MAX_VN_NUM 128
#define MAX_VT_NUM 128
#define MAX_STRING_LENGTH 1024
#define THREAD_NUM 36
pthread_mutex_t public_mutex;
pthread_cond_t public_cond;
int end_thread = 0;
typedef struct VnProduction {
int parent, child1, child2;
} VnProduction;
typedef struct VtProduction {
int parent;
char child;
} VtProduction;
int vnProductions_cnt, vtProductions_cnt;
VtProduction vtProductions[MAX_PRODUCTION1_NUM];
VnProduction vnProductions[MAX_PRODUCTION2_NUM];
unsigned dp[(1 + MAX_STRING_LENGTH) * MAX_STRING_LENGTH / 2 * MAX_VN_NUM];
int slen;
char solve[MAX_STRING_LENGTH];
int vnNum;
void *task(void *args);
void input() {
freopen("input.txt", "r", stdin);
scanf("%d\n", &vnNum);
scanf("%d\n", &vnProductions_cnt);
for (int i = 0; i < vnProductions_cnt; i++)
scanf("<%d>::=<%d><%d>\n", &vnProductions[i].parent, &vnProductions[i].child1, &vnProductions[i].child2);
scanf("%d\n", &vtProductions_cnt);
for (int i = 0; i < vtProductions_cnt; i++)
scanf("<%d>::=%c\n", &vtProductions[i].parent, &vtProductions[i].child);
scanf("%d\n", &slen);
scanf("%s\n", solve);
}
int main() {
input();
for (int i = 0; i < slen; i++) {
char c = solve[i];
for (int vt_index = 0; vt_index < vtProductions_cnt; vt_index++) {
VtProduction tmp = vtProductions[vt_index];
if (c == tmp.child) {
int row = (slen + slen - (i - 1)) * i / 2;
dp[(row + i) * vnNum + tmp.parent]++;
}
}
}
pthread_mutex_init(&public_mutex, NULL);
pthread_cond_init(&public_cond, NULL);
pthread_t handlers[THREAD_NUM];
for (int thread_index = 0; thread_index < THREAD_NUM; thread_index++) {
pthread_create(&handlers[thread_index], NULL, task, (void *)thread_index);
}
for (int thread_index = 0; thread_index < THREAD_NUM; thread_index++) {
pthread_join(handlers[thread_index], NULL);
}
printf("%u\n", dp[(slen - 1) * vnNum]);
return 0;
}
void *task(void *args) {
int tid = (long long) args;
for (int len = 2; len <= slen; len++) {
int left_end = slen - len;
for (int left = tid; left <= left_end; left += THREAD_NUM) {
int right_end = left + len;
for (int right = left + 1; right < right_end; right++) {
int all = ((slen + slen - (left - 1)) * left / 2 + (left + len - 1)) * vnNum;
int leftPart = ((slen + slen - (left - 1)) * left / 2 + (right - 1)) * vnNum;
int rightPart = ((slen + slen - (right - 1)) * right / 2 + (left + len - 1)) * vnNum;
for (int vn_index = 0; vn_index < vnProductions_cnt; vn_index++) {
VnProduction tmp = vnProductions[vn_index];
dp[all + tmp.parent] += dp[leftPart + tmp.child1] * dp[rightPart + tmp.child2];
}
}
}
pthread_mutex_lock(&public_mutex);
end_thread++;
if (end_thread != THREAD_NUM) {
pthread_cond_wait(&public_cond, &public_mutex);
} else {
end_thread = 0;
pthread_cond_broadcast(&public_cond);
}
pthread_mutex_unlock(&public_mutex);
}
return NULL;
} |
the_stack_data/873630.c | int main()
{
return 0;
} |
the_stack_data/128860.c | #include <stdio.h>
int __attribute__((weak)) get_checked(void) {
return -1;
}
#define CHECK_VALUE (100)
#define TEST_SUCCESS (0)
#define TEST_FAILTURE (-1)
int main(void) {
if (get_checked() == CHECK_VALUE) {
fprintf(stdout,"good\n");
return TEST_SUCCESS;
}
fprintf(stdout,"bad\n");
return TEST_FAILTURE;
}
|
the_stack_data/11076616.c | #include <stdio.h> // printf
#include <math.h> // round
#define LOWER -50
#define UPPER 300
#define STEP 40
int main () {
int t, dir = 1, ord = 0; // flags: dir for 1-4, ord 1-5
if (dir == 0) { // Ex. 1-3 and 1-4
printf("F\tC\n--------------\n"); // print a header
} else {
printf("C\tF\n--------------\n");
}
for (t = (ord == 1 ? LOWER : UPPER); // Ex. 1-5 up or down
(t <= UPPER && ord == 1) || (t >= LOWER && ord != 1); // if (this and this) or (this and this)
t += STEP * (ord == 1 ? 1 : -1)) { // increment or decrement depending on the direction
printf("%3d\t%3d\n", t, (int)round(dir == 0 ? 5 * (t - 32) / 9 : 9 * t / 5 + 32)); // mini-if cond ? true : false
}
return 0;
}
|
the_stack_data/206393511.c | #include <stdio.h>
int main()
{
int i, t;
t = 1;
i = 2;
while(i<=5)
{
t = t * i;
i = i + 1;
}
printf("%d\n", t);
return 0;
} |
the_stack_data/18888190.c | /* Here the program begins */
extern int rand (void) ;
typedef unsigned bool;
unsigned Cur_Vertical_Sep;
bool High_Confidence;
bool Two_of_Three_Reports_Valid;
unsigned Own_Tracked_Alt;
unsigned Own_Tracked_Alt_Rate;
unsigned Other_Tracked_Alt;
unsigned Alt_Layer_Value;
unsigned Positive_RA_Alt_Thresh__0 ;
unsigned Positive_RA_Alt_Thresh__1 ;
unsigned Positive_RA_Alt_Thresh__2 ;
unsigned Positive_RA_Alt_Thresh__3 ;
unsigned Up_Separation;
unsigned Down_Separation;
unsigned Other_RAC;
unsigned Other_Capability;
unsigned Climb_Inhibit;
bool Own_Below_Threat() ;
bool Own_Above_Threat() ;
void initialize()
{
Positive_RA_Alt_Thresh__0 = 400;
Positive_RA_Alt_Thresh__1 = 500;
Positive_RA_Alt_Thresh__2 = 640;
Positive_RA_Alt_Thresh__3 = 740;
}
bool __NONDET__()
{
if ( ((double) rand() / (2147483647 +1.0)) > 0.5 )
return 1 ;
return 0 ;
}
unsigned ALIM ()
{
if ( Alt_Layer_Value == 0 )
return Positive_RA_Alt_Thresh__0 ;
if ( Alt_Layer_Value == 1 )
return Positive_RA_Alt_Thresh__1 ;
if ( Alt_Layer_Value == 2 )
return Positive_RA_Alt_Thresh__2 ;
return Positive_RA_Alt_Thresh__3 ;
}
unsigned Inhibit_Biased_Climb ()
{
if (Climb_Inhibit==1) return Up_Separation + 100;
else return Up_Separation;
/* return (Climb_Inhibit==1 ? Up_Separation + 100 : Up_Separation);*/
}
bool Non_Crossing_Biased_Climb()
{
unsigned upward_preferred = 0 ;
unsigned upward_crossing_situation;
//bool result = 0 ;
// unsigned alim = ALIM() ;
// New variables added ...
bool result;
unsigned alim;
unsigned temp1;
bool temp2,temp3;
/******************************************/
/* Coded added due to compiler limitation */
/******************************************/
result=0;
alim = ALIM() ;
/******************************************/
/******************************************/
/* Coded added due to compiler limitation */
/******************************************/
// if ( Inhibit_Biased_Climb() > Down_Separation )
temp1 = Inhibit_Biased_Climb();
if (temp1 > Down_Separation )
/***************************************/
upward_preferred = 1 ;
if (upward_preferred==1)
{
/******************************************/
/* Coded added due to compiler limitation */
/******************************************/
//if ( !(Own_Below_Threat()) || ((Own_Below_Threat()) && (!(Down_Separation >= alim))) )
temp2 = Own_Below_Threat();
if ( !temp2 || (temp2 && (!(Down_Separation >= alim))) )
/***************************************/
result = 1 ;
}
else
{
/******************************************/
/* Coded added due to compiler limitation */
/******************************************/
//if ( Own_Above_Threat() && (Cur_Vertical_Sep >= 300) && (Up_Separation >= alim) )
temp3= Own_Above_Threat();
if ( temp3 && (Cur_Vertical_Sep >= 300) && (Up_Separation >= alim) )
/***************************************/
result = 1 ;
}
// LEAVING_NON_CROSSING_BIASED_CLIMB:
return result;
}
bool Non_Crossing_Biased_Descend()
{
unsigned upward_preferred = 0 ;
unsigned upward_crossing_situation;
//bool result = 0 ;
//unsigned alim=ALIM() ;
// New variables added
bool result;
unsigned alim;
unsigned temp1;
bool temp2,temp3;
result = 0 ;
alim=ALIM() ;
/******************************************/
/* Coded added due to compiler limitation */
/******************************************/
// if ( Inhibit_Biased_Climb() > Down_Separation )
temp1 = Inhibit_Biased_Climb();
if ( temp1 > Down_Separation )
/******************************************/
upward_preferred = 1 ;
if (upward_preferred==1)
{
/******************************************/
/* Coded added due to compiler limitation */
/******************************************/
//if ( Own_Below_Threat() && (Cur_Vertical_Sep >= 300) && (Down_Separation >= alim) )
temp2 = Own_Below_Threat();
if ( temp2 && (Cur_Vertical_Sep >= 300) && (Down_Separation >= alim) )
/******************************************/
result = 1 ;
}
else
{
/******************************************/
/* Coded added due to compiler limitation */
/******************************************/
//if ( !(Own_Above_Threat()) || ((Own_Above_Threat()) && (Up_Separation >= alim)))
temp3 = Own_Above_Threat();
if ( !temp3 || (temp3 && (Up_Separation >= alim)))
result = 1 ;
}
return result;
}
bool Own_Below_Threat()
{
if (Own_Tracked_Alt < Other_Tracked_Alt)
return 1 ;
return 0 ;
}
bool Own_Above_Threat()
{
if (Other_Tracked_Alt < Own_Tracked_Alt)
return 1 ;
return 0 ;
}
/*
void error ()
{
ERROR:
return;
exit (1);
}
*/
/*
void property1a ( unsigned thresh )
{
if ( Up_Separation >= thresh && Down_Separation < thresh )
{
goto PROPERTY1A;
PROPERTY1A: ;
error();
}
}
*/
/*
void property1b ( unsigned thresh )
{
if ( Up_Separation < thresh && Down_Separation >= thresh )
{
goto PROPERTY1B;
PROPERTY1B: ;
error();
}
}
*/
/*
void property2a ( unsigned thresh )
{
if ( Up_Separation < thresh && Down_Separation < thresh && Up_Separation > Down_Separation )
{
goto PROPERTY2A;
PROPERTY2A:;
error();
}
}
*/
/*
void property2b ( unsigned thresh )
{
if ( Up_Separation < thresh && Down_Separation < thresh && Up_Separation < Down_Separation )
{ goto PROPERTY2B;
PROPERTY2B: ;
error();
}
}
*/
/*
void property3a ( unsigned thresh )
{
if ( Up_Separation >= thresh && Down_Separation >= thresh && Own_Tracked_Alt > Other_Tracked_Alt )
{
goto PROPERTY3A;
PROPERTY3A:;
error();
}
}
*/
/*
void property3b ( unsigned thresh )
{
if ( Up_Separation >= thresh && Down_Separation >= thresh && Own_Tracked_Alt > Other_Tracked_Alt )
{
goto PROPERTY3B;
PROPERTY3B: ;
error();
}
}
*/
/*
void property4a ()
{
if ( Own_Tracked_Alt > Other_Tracked_Alt )
{
goto PROPERTY4A;
PROPERTY4A:;
return ;
}
}
*/
/*
void property4b ()
{
if( Own_Tracked_Alt < Other_Tracked_Alt )
{
goto PROPERTY4B;
PROPERTY4B: ;
return ;
}
}
*/
/*
void property5a ()
{
if ( Up_Separation > Down_Separation )
{
goto PROPERTY5A;
PROPERTY5A: ;
error();
}
}
*/
/*
void property5b ()
{
if ( Up_Separation < Down_Separation )
{
goto PROPERTY5B;
PROPERTY5B:;
error();
}
}
*/
unsigned alt_sep_test()
{
bool enabled=0, tcas_equipped=0, intent_not_known=0;
bool need_upward_RA=0, need_downward_RA=0;
unsigned alt_sep;
// The compiler fails here
//unsigned alim = ALIM() ;
unsigned alim;
// New variables added ....
bool temp1,temp2,temp3,temp4;
alim = ALIM();
if ( High_Confidence && (Own_Tracked_Alt_Rate <= 600) && (Cur_Vertical_Sep > 600) )
enabled = 1 ;
if ( Other_Capability == 0 )
tcas_equipped = 1 ;
if ( Two_of_Three_Reports_Valid && Other_RAC == 0 )
intent_not_known = 1 ;
alt_sep = 0;
if (enabled && ((tcas_equipped && intent_not_known) || !tcas_equipped))
{
/******************************************/
/* Coded added due to compiler limitation */
/******************************************/
temp1 = Non_Crossing_Biased_Climb();
temp2 = Own_Below_Threat();
//if ( Non_Crossing_Biased_Climb() && Own_Below_Threat() )
/******************************************/
if ( temp1 && temp2 )
{
need_upward_RA = 1 ;
}
/******************************************/
/* Coded added due to compiler limitation */
/******************************************/
temp3 = Non_Crossing_Biased_Descend();
temp4 = Own_Above_Threat();
//if ( Non_Crossing_Biased_Descend() && Own_Above_Threat() )
if ( temp3 && temp4 )
{
need_downward_RA = 1 ;
}
if (need_upward_RA && need_downward_RA)
{
alt_sep = 0;
}
else if (need_upward_RA)
{
/*property1b(alim) ;*/
// _ABORT(Up_Separation < alim && Down_Separation >= alim);
/*property2b(alim) ;*/
// _ABORT(Up_Separation < alim && Down_Separation < alim && Up_Separation < Down_Separation);
/*property3b(alim) ;*/
// _ABORT(Up_Separation >= alim && Down_Separation >= alim && Own_Tracked_Alt > Other_Tracked_Alt);
/*property4b() ;*/
_TRACER_abort(Own_Tracked_Alt < Other_Tracked_Alt);
//_DECOMPILE_ABORT(Own_Tracked_Alt < Other_Tracked_Alt);
/*property5b() ;*/
// _ABORT(Up_Separation < Down_Separation);
alt_sep = 1;
}
else if (need_downward_RA)
{
/*property1a(alim) ;*/
// _ABORT( Up_Separation >= alim && Down_Separation < alim );
/*property2a(alim) ;*/
// _ABORT(Up_Separation < alim && Down_Separation < alim && Up_Separation > Down_Separation);
/*property3a(alim) ;*/
// _ABORT(Up_Separation >= alim && Down_Separation >= alim && Own_Tracked_Alt > Other_Tracked_Alt);
/*property4a() ;*/
// _ABORT(Own_Tracked_Alt > Other_Tracked_Alt);
/* property5a() ;*/
// _ABORT(Up_Separation > Down_Separation);
alt_sep = 2;
}
else
alt_sep = 0;
}
return alt_sep;
}
unsigned main( )
{
initialize();
alt_sep_test();
return 0;
}
|
the_stack_data/519642.c | struct S {
int a;
int b;
int c;
struct S *d;
} GS;
int f(struct S *AS) {
struct S LS;
return GS.a + AS->b + LS.c + LS.d->c;
}
int main() { }
|
the_stack_data/19853.c | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* 30:Digit_fifth_powers.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: adelille <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2021/10/28 17:30:19 by adelille #+# #+# */
/* Updated: 2021/10/28 18:01:27 by adelille ### ########.fr */
/* */
/* ************************************************************************** */
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define TRUE 1
#define FALSE 0
#define LIMIT 1000000
static int ft_is_true(int n, int e)
{
int sum;
int d;
sum = 0;
d = n;
while (d > 0 && sum <= n)
{
sum += (int)pow(d % 10, e);
d /= 10;
}
if (sum == n)
return (TRUE);
return (FALSE);
}
int main(int ac, char **av)
{
int e;
int i;
int res;
int last_res;
int percent;
long sum;
if (ac == 2)
e = atoi(av[1]);
else
e = 5;
i = 2;
sum = 0;
percent = 0;
while (i < LIMIT)
{
res = ft_is_true(i, e);
if (res == TRUE)
{
last_res = i;
sum += i;
}
if (i / LIMIT * 100 > percent)
{
percent = 1 / LIMIT * 100;
printf("\rProcess [%d%%]\t%d", percent, last_res);
}
i++;
}
printf("Sum: %ld\n", sum);
return (0);
}
|
the_stack_data/91757.c | /**
* Exercise 1-5
*
* Modify the temperature conversion program to print the table in reverse order, that is, from 300 degrees to 0.
*/
#include <stdio.h>
int main() {
float fahr, celsius;
int lower, upper, step;
lower = 0;
upper = 300;
step = 20;
fahr = upper;
while (fahr >= lower) {
celsius = (5.0 / 9.0) * (fahr - 32);
printf("%4.0f\t%6.1f\n", fahr, celsius);
fahr -= step;
}
}
|
the_stack_data/70199.c | #include <stdio.h>
int main(void)
{
int n,soma,resto,aux; // n - Numero da conta, s - Soma dos digitos da conta.
printf("Digite um numero: ");
scanf("%d",&n);
aux = n;
soma=0;
while(n>0)
{
soma+=n%10;
n/=10;
}
resto = soma %10;
printf("Numero da conta : %06d-%d\n",aux,resto);
return 0;
}
|
the_stack_data/36074921.c | /* Copyright (C) 1992-2015 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
The GNU C Library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with the GNU C Library; if not, see
<http://www.gnu.org/licenses/>. */
#include <termios.h>
/* Set *T to indicate raw mode. */
void
cfmakeraw (t)
struct termios *t;
{
t->c_iflag &= ~(IGNBRK|BRKINT|PARMRK|ISTRIP|INLCR|IGNCR|ICRNL|IXON);
t->c_oflag &= ~OPOST;
t->c_lflag &= ~(ECHO|ECHONL|ICANON|ISIG|IEXTEN);
t->c_cflag &= ~(CSIZE|PARENB);
t->c_cflag |= CS8;
t->c_cc[VMIN] = 1; /* read returns when one char is available. */
t->c_cc[VTIME] = 0;
}
|
the_stack_data/176706129.c | /* Program to compute Pi using Monte Carlo methods */
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <string.h>
#define SEED 35791246
main(int argc, char* argv)
{
int niter=10000000;
double x,y;
int i,count=0; /* # of points in the 1st quadrant of unit circle */
double z;
double pi;
/* initialize random numbers */
srand(SEED);
count=0;
for ( i=0; i<niter; i++) {
x = (double)rand()/RAND_MAX;
y = (double)rand()/RAND_MAX;
z = x*x+y*y;
if (z<=1) count++;
}
pi=(double)count/niter*4;
printf("estimate of pi is %g \n",pi);
}
|
the_stack_data/206392699.c | /***********************************************************
totient.c -- Euler (オイラー) の関数
***********************************************************/
unsigned phi(unsigned x)
{
unsigned d, t;
t = x;
if (x % 2 == 0) {
t /= 2;
do { x /= 2; } while (x % 2 == 0);
}
d = 3;
while (x / d >= d) {
if (x % d == 0) {
t = t / d * (d - 1);
do { x /= d; } while (x % d == 0);
}
d += 2;
}
if (x > 1) t = t / x * (x - 1);
return t;
}
#include <stdio.h>
#include <stdlib.h>
int main(void)
{
int i, j;
printf("オイラーの関数 φ(1),…,φ(200)\n ");
for (j = 1; j <= 10; j++) printf(" +%2d", j);
printf("\n ");
for (j = 1; j <= 10; j++) printf("-----");
printf("\n");
for (i = 0; i < 20; i++) {
printf("%3d |", 10 * i);
for (j = 1; j <= 10; j++) printf("%5d", phi(10 * i + j));
printf("\n");
}
return 0;
}
|
the_stack_data/56557.c | #include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
struct time {
int64_t tv_sec;
int32_t tv_nsec;
};
struct time *system_time(struct time *);
struct time *addTime(struct time*, struct time*, struct time*);
int compareTime(struct time*, struct time*);
int main(int argc, char **argv)
{
struct time tm1, tm2, tm3;
system_time(&tm1);
tm2.tv_sec = 2;
tm2.tv_nsec = 0;
addTime(&tm1, &tm2, &tm3);
do {
system_time(&tm1);
} while(compareTime(&tm1, &tm3) < 0);
printf("Done!\n");
return 0;
}
|
the_stack_data/71211.c | #include <stdio.h>
// Declaro la aridad de la funcion de ASM
extern int suma2Enteros(int a, int b);
int main(){
int suma;
suma = suma2Enteros(2,41);
printf("\nLa suma es %d\n\n",suma);
return 0;
}
|
the_stack_data/215767028.c | //Binary Search Tree
#include <stdio.h>
#include <stdlib.h>
typedef struct BinarySearchTree
{
int data;
struct BinarySearchTree *left;
struct BinarySearchTree *right;
} bst;
int insert(bst *root, int val)
{
bst *ptr = (bst *)malloc(sizeof(bst));
ptr->data = val;
ptr->right = NULL;
ptr->left = NULL;
if (root == NULL)
{
root = ptr;
return root;
}
bst *temp = root;
bst *parent = NULL;
while (temp != NULL)
{
if (val < temp->data)
{
parent = temp;
temp = temp->left;
}
else
{
parent = temp;
temp = temp->right;
}
}
if (parent->data > val)
{
parent->left = ptr;
return root;
}
parent->right = ptr;
return root;
}
int Delete(bst *root, int num)
{
bst *temp = root;
bst *parent = NULL;
if (temp == NULL)
{
printf("\nThe Tree is Empty\n");
return root;
}
if (root->data == num && root->left == NULL && root->right == NULL)
{
root = NULL;
return root;
}
while (temp != NULL)
{
if (num == temp->data)
{
break;
}
if (num < temp->data)
{
parent = temp;
temp = temp->left;
}
else
{
parent = temp;
temp = temp->right;
}
}
if (temp == NULL)
{
printf("\nElement NOT Found\n");
return root;
}
if (temp->left == NULL && temp->right == NULL)
{
if (temp == root)
{
free(temp);
return root;
}
if (parent->left == temp)
parent->left = NULL;
else
parent->right = NULL;
free(temp);
return root;
}
if (temp->left != NULL && temp->right == NULL)
{
if (temp == root)
{
root = root->left;
free(temp);
return root;
}
if (parent->left == temp)
parent->left = temp->left;
else
parent->right = temp->left;
free(temp);
return root;
}
if (temp->left == NULL && temp->right != NULL)
{
if (temp == root)
{
root = root->right;
free(temp);
return root;
}
if (parent->left == temp)
parent->left = temp->right;
else
parent->right = temp->right;
free(temp);
return root;
}
if (temp->left != NULL && temp->right != NULL)
{
bst *lt, *plt;
lt = temp->left;
if (lt->right == NULL)
{
temp->data = lt->data;
temp->left = lt->left;
free(lt);
return root;
}
while (lt->right != NULL)
{
plt = lt;
lt = lt->right;
}
temp->data = lt->data;
plt->right = lt->left;
free(lt);
return root;
}
}
int inorder(bst *temp)
{
if (temp != NULL)
{
inorder(temp->left);
printf("%4d", temp->data);
inorder(temp->right);
}
}
int preorder(bst *current)
{
if (current != NULL)
{
printf("%4d", current->data);
preorder(current->left);
preorder(current->right);
}
}
int postorder(bst *current)
{
if (current != NULL)
{
postorder(current->left);
postorder(current->right);
printf("%4d", current->data);
}
}
int main()
{
int opt, n, del, a = 0;
bst *root = NULL;
printf("Welcome to Binary Search Tree Implementation Using Linked List\n");
do
{
printf("\nEnter Your Choice \n1) -> Insert \n2) -> Delete \n3) -> Inorder \n4) -> Preorder \n5) -> Postorder \n6) -> Exit\n");
scanf("%d", &opt);
switch (opt)
{
case 1:
printf("\nEnter the Element : ");
scanf("%d", &n);
root = insert(root, n);
break;
case 2:
printf("\nEnter the Element you want to Delete : ");
scanf("%d", &del);
root = Delete(root, del);
break;
case 3:
if (root == NULL)
{
printf("\nTree is Empty\n");
break;
}
printf("\nIn-order Display : ");
inorder(root);
printf("\n");
break;
case 4:
if (root == NULL)
{
printf("\nTree is Empty\n");
break;
}
printf("\nPre-order Display : ");
preorder(root);
printf("\n");
break;
case 5:
if (root == NULL)
{
printf("\nTree is Empty\n");
break;
}
printf("\nPost-order Display : ");
postorder(root);
printf("\n");
break;
case 6:
printf("\nThank You");
a = 1;
break;
default:
printf("\nInvalid Choice\n");
}
} while (a == 0);
/*insert(1);
insert(3);
insert(5);
insert(2);
insert(4);
insert(6);
inorder(root);
printf("\n");
Delete(1);
inorder(root);
printf("\n");
Delete(5);
inorder(root);*/
} |
the_stack_data/154829774.c | /* Verify that SRA total scalarization will not be confused by padding. */
/* { dg-do compile } */
/* { dg-options "-O1 --param sra-max-scalarization-size-Ospeed=16 -fdump-tree-release_ssa" } */
struct S
{
int i;
unsigned short f1;
char f2;
unsigned short f3, f4;
};
int foo (struct S *p)
{
struct S l;
l = *p;
l.i++;
*p = l;
}
/* { dg-final { scan-tree-dump-times "l;" 0 "release_ssa" } } */
|
the_stack_data/1129686.c | /*
* Copyright © 2009 CNRS
* Copyright © 2009-2015 Inria. All rights reserved.
* Copyright © 2009-2010 Université Bordeaux
* Copyright © 2009-2011 Cisco Systems, Inc. All rights reserved.
* See COPYING in top-level directory.
*/
#include <stdio.h>
#include <assert.h>
#include <infiniband/verbs.h>
#include "hwloc.h"
#include "hwloc/openfabrics-verbs.h"
/* check the ibverbs helpers */
int main(void)
{
hwloc_topology_t topology;
struct ibv_device **dev_list, *dev;
int count, i;
int err;
dev_list = ibv_get_device_list(&count);
if (!dev_list) {
fprintf(stderr, "ibv_get_device_list failed\n");
return 0;
}
printf("ibv_get_device_list found %d devices\n", count);
hwloc_topology_init(&topology);
hwloc_topology_set_type_filter(topology, HWLOC_OBJ_PCI_DEVICE, HWLOC_TYPE_FILTER_KEEP_IMPORTANT);
hwloc_topology_set_type_filter(topology, HWLOC_OBJ_OS_DEVICE, HWLOC_TYPE_FILTER_KEEP_IMPORTANT);
hwloc_topology_load(topology);
for(i=0; i<count; i++) {
hwloc_bitmap_t set;
dev = dev_list[i];
set = hwloc_bitmap_alloc();
err = hwloc_ibv_get_device_cpuset(topology, dev, set);
if (err < 0) {
printf("failed to get cpuset for device %d (%s)\n",
i, ibv_get_device_name(dev));
} else {
char *cpuset_string = NULL;
hwloc_obj_t os;
hwloc_bitmap_asprintf(&cpuset_string, set);
printf("got cpuset %s for device %d (%s)\n",
cpuset_string, i, ibv_get_device_name(dev));
free(cpuset_string);
os = hwloc_ibv_get_device_osdev(topology, dev);
if (os) {
assert(os->type == HWLOC_OBJ_OS_DEVICE);
printf("found OS object subtype %u lindex %u name %s\n",
(unsigned) os->attr->osdev.type, os->logical_index, os->name);
assert(os->attr->osdev.type == HWLOC_OBJ_OSDEV_OPENFABRICS);
if (strcmp(ibv_get_device_name(dev), os->name))
assert(0);
}
}
hwloc_bitmap_free(set);
}
hwloc_topology_destroy(topology);
ibv_free_device_list(dev_list);
return 0;
}
|
the_stack_data/3262779.c | /*
* Copyright (c) 2016, 2018, Oracle and/or its affiliates.
*
* 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 holder nor the names of its contributors may be used to
* endorse or promote products derived from this software without specific prior written
* permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS
* OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT HOLDER 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.
*/
int main() {
int arg1 = 0xAAAAAAAA;
int arg2 = 0xDEADBEEF;
int out1 = 0;
int out2 = 0;
int out3 = 0;
__asm__("movl %3, %0; movl %3, %1; movl %4, %2;" : "=m"(out1), "=m"(out2), "=r"(out3) : "r"(arg1), "m"(arg2));
return (arg1 == out1) && (arg1 == out2) && (arg2 == out3);
}
|
the_stack_data/6269.c | #include <stdio.h>
int main(){
char name[][20] = {
"Sufiyaan",
"Qasim",
"Ahsan"
};
int i, j;
char (*ptr)[20] = &name[0];
for(i=0;i<4;i++){
puts(*(ptr+i));
}
return 0;
}
|
the_stack_data/118853.c | #include <unistd.h>
#include <stdio.h>
#include <dirent.h>
#include <string.h>
#include <sys/stat.h>
#include <stdlib.h>
void print_dir(char *dir, int depth)
{
DIR *dp;
struct dirent *entry;
struct stat statbuf;
if ((dp = opendir(dir)) == NULL) {
fprintf(stderr, "cannot open directory: %s\n", dir);
return;
}
chdir(dir);
while((entry = readdir(dp)) != NULL) {
lstat(entry->d_name, &statbuf);
if(S_ISDIR(statbuf.st_mode)) {
if(strcmp(".", entry->d_name) == 0 ||
strcmp("..", entry->d_name) == 0)
continue;
printf("%*s%s/\n", depth, "", entry->d_name);
print_dir(entry->d_name, depth+4);
}
else printf("%*s%s\n", depth, "", entry->d_name);
}
chdir("..");
closedir(dp);
}
int main()
{
printf("directory scn of /Users/colin/MyDesign:\n");
print_dir("/Users/colin/Git/mlenv/linux", 0);
printf("done.\n");
exit(0);
}
|
the_stack_data/79428.c | #include<stdio.h>//AC 1.4S
#include<stdlib.h>
#define SIZE 10001
int main(){
int n,m;
while(scanf("%d%d",&n,&m)!=EOF){
int array[SIZE]={0};
int a,b;
int odd=0;
for(int i=0;i<m;++i){
scanf("%d%d",&a,&b);
++array[a];
++array[b];
}
for(int i=1;i<n+1;++i){
if(array[i]%2==1){
++odd;
if(odd>2)break;
}
}
if(odd!=0 && odd!=2)puts("NO");
else puts("YES");
}
}
/*#include<stdio.h>//AC 1.4S
#include<stdlib.h>
#define SIZE 11001
int main(){
int n,m;
while(scanf("%d%d",&n,&m)!=EOF){
int array[SIZE]={0};
int a,b;
int odd=0;
//if(n==0)odd=1;
for(int i=0;i<m;++i){
scanf("%d%d",&a,&b);
++array[a];
++array[b];
}
if(array[1]%2 != array[n]%2){
puts("NO");
continue;
}
for(int i=2;i<n;++i){
if(array[i]%2==1){
odd=1;
break;
}
}
if(odd)puts("NO");
else puts("YES");
}
}*/
|
the_stack_data/157557.c | #include <stdio.h>
int a = 0;
|
the_stack_data/165764449.c | /* ヘッダファイルのインクルード */
#include <stdio.h> /* 標準入出力 */
/* main関数の定義 */
int main(void){
/* CGIとして文字列の出力. */
printf("Content-type: text/plain\n"); /* "Content-type: text/plain\n"を出力. */
printf("\n"); /* printfで改行を出力. */
printf("ABCDE"); /* printfで"ABCDE"(改行無し)の出力. */
/* プログラムの終了 */
return 0; /* 0を返して正常終了. */
}
|
the_stack_data/168893464.c | #include <stdio.h>
int is_letter(char c) {
return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z');
}
int is_vowel(char c) {
c = tolower(c);
switch (c) {
case 'a':
case 'e':
case 'i':
case 'o':
case 'u':
return 1;
default:
return 0;
}
}
int main() {
char c;
int consonants = 0, vowels = 0;
FILE *dat;
// Opening file for reading
if ((dat = fopen("text.txt", "r")) == NULL) {
printf("The file `text.txt` can not be opened.\n");
return -1;
}
// Reading char by char until EndOfFile (EOF)
while ((c = fgetc(dat)) != EOF) {
if (is_letter(c)) {
if (is_vowel(c))
vowels++;
else
consonants++;
}
}
fclose(dat);
printf("Ratio vowels/consonants: %d/%d = %5.2f\n", vowels, consonants,
(float) vowels / consonants);
return 0;
}
|
the_stack_data/9512496.c | #include "stdio.h"
#include "stdlib.h"
int t;
int array[3];
void update() {
t = array[2];
t += 4;
array[1] = array[2] + t;
array[0] = t;
}
int main (int argc, char* argv[]) {
char* ep;
if (argc != 4) {
printf("invalid number of arguments\n");
return -1;
}
for (int i=0; i<3; i++) {
array[i] = strtol (argv[i+1], &ep, 10);
if (*ep) {
printf ("Argument is not a number\n");
return -1;
}
}
update();
printf("t: %d\n", t);
printf("array[0]: %d\n", array[0]);
printf("array[1]: %d\n", array[1]);
printf("array[2]: %d\n", array[2]);
return 0;
}
|
the_stack_data/66564.c | long f1(long a, long b) {
if(a <= b) {
return a = b;
}
return a;
}
long f2(long a, long b) {
long max;
if (a > b) {
max = a;
}else {
max = b;
}
return max;
} |
the_stack_data/646098.c | #include <stdio.h>
#include <stdlib.h>
#include <termios.h>
#include <sys/fcntl.h>
#include <string.h>
#include <ctype.h>
#include <unistd.h>
#define PROMPT_ASK "Do you want another transaction(y/n)? "
#define PROMPT_WRONG_INPUT "Cannot understand last input, please try y(Y) or n(N): "
#define SLEEPTIME 1
#define TRIES 5
// #define BEEP putchar('\a');
int get_ok_char() {
int c;
while ((c = getchar()) != EOF && !(strchr("yYnN", c))) { }
return c;
}
int get_response(int max_tries) {
int response = 1;
printf(PROMPT_ASK);
fflush(stdout);
while (1) {
sleep(SLEEPTIME);
int input = tolower(get_ok_char());
if (input == 'y') return 1;
if (input == 'n') return 1;
if (--max_tries == 0) return 2;
}
}
void set_cr_noecho_mode() {
struct termios ttystate;
tcgetattr(0, &ttystate);
ttystate.c_lflag &= ~ICANON; // 不需要输入回车即可开始执行
ttystate.c_lflag &= ~ECHO; // 不回显
ttystate.c_cc[VMIN] = 1;
tcsetattr(0, TCSANOW, &ttystate);
}
void set_nodelay_mode() {
int termflags;
termflags = fcntl(0, F_GETFL);
termflags |= O_NDELAY;
fcntl(0, F_SETFL, termflags);
}
void tty_mode(int how) {
static struct termios original_mode;
if (how == 0) {
tcgetattr(0, &original_mode); // Keep original mode
}
else {
tcsetattr(0, TCSANOW, &original_mode); // Restore original mode
}
}
int main(int argc, char const *argv[]) {
tty_mode(0);
set_cr_noecho_mode();
set_nodelay_mode();
int response = get_response(TRIES);
tty_mode(1);
putchar('\n');
return response;
}
|
the_stack_data/149793.c | //@ ltl invariant negative: (AP(x_1 - x_19 > -1) && (<> ([] AP(x_8 - x_25 > -8))));
float x_0;
float x_1;
float x_2;
float x_3;
float x_4;
float x_5;
float x_6;
float x_7;
float x_8;
float x_9;
float x_10;
float x_11;
float x_12;
float x_13;
float x_14;
float x_15;
float x_16;
float x_17;
float x_18;
float x_19;
float x_20;
float x_21;
float x_22;
float x_23;
float x_24;
float x_25;
float x_26;
float x_27;
int main()
{
float x_0_;
float x_1_;
float x_2_;
float x_3_;
float x_4_;
float x_5_;
float x_6_;
float x_7_;
float x_8_;
float x_9_;
float x_10_;
float x_11_;
float x_12_;
float x_13_;
float x_14_;
float x_15_;
float x_16_;
float x_17_;
float x_18_;
float x_19_;
float x_20_;
float x_21_;
float x_22_;
float x_23_;
float x_24_;
float x_25_;
float x_26_;
float x_27_;
while(1) {
x_0_ = ((((3.0 + x_4) > ((13.0 + x_5) > (20.0 + x_6)? (13.0 + x_5) : (20.0 + x_6))? (3.0 + x_4) : ((13.0 + x_5) > (20.0 + x_6)? (13.0 + x_5) : (20.0 + x_6))) > (((3.0 + x_8) > (15.0 + x_10)? (3.0 + x_8) : (15.0 + x_10)) > ((3.0 + x_11) > (1.0 + x_14)? (3.0 + x_11) : (1.0 + x_14))? ((3.0 + x_8) > (15.0 + x_10)? (3.0 + x_8) : (15.0 + x_10)) : ((3.0 + x_11) > (1.0 + x_14)? (3.0 + x_11) : (1.0 + x_14)))? ((3.0 + x_4) > ((13.0 + x_5) > (20.0 + x_6)? (13.0 + x_5) : (20.0 + x_6))? (3.0 + x_4) : ((13.0 + x_5) > (20.0 + x_6)? (13.0 + x_5) : (20.0 + x_6))) : (((3.0 + x_8) > (15.0 + x_10)? (3.0 + x_8) : (15.0 + x_10)) > ((3.0 + x_11) > (1.0 + x_14)? (3.0 + x_11) : (1.0 + x_14))? ((3.0 + x_8) > (15.0 + x_10)? (3.0 + x_8) : (15.0 + x_10)) : ((3.0 + x_11) > (1.0 + x_14)? (3.0 + x_11) : (1.0 + x_14)))) > (((10.0 + x_18) > ((10.0 + x_20) > (13.0 + x_21)? (10.0 + x_20) : (13.0 + x_21))? (10.0 + x_18) : ((10.0 + x_20) > (13.0 + x_21)? (10.0 + x_20) : (13.0 + x_21))) > (((14.0 + x_22) > (5.0 + x_23)? (14.0 + x_22) : (5.0 + x_23)) > ((19.0 + x_24) > (13.0 + x_25)? (19.0 + x_24) : (13.0 + x_25))? ((14.0 + x_22) > (5.0 + x_23)? (14.0 + x_22) : (5.0 + x_23)) : ((19.0 + x_24) > (13.0 + x_25)? (19.0 + x_24) : (13.0 + x_25)))? ((10.0 + x_18) > ((10.0 + x_20) > (13.0 + x_21)? (10.0 + x_20) : (13.0 + x_21))? (10.0 + x_18) : ((10.0 + x_20) > (13.0 + x_21)? (10.0 + x_20) : (13.0 + x_21))) : (((14.0 + x_22) > (5.0 + x_23)? (14.0 + x_22) : (5.0 + x_23)) > ((19.0 + x_24) > (13.0 + x_25)? (19.0 + x_24) : (13.0 + x_25))? ((14.0 + x_22) > (5.0 + x_23)? (14.0 + x_22) : (5.0 + x_23)) : ((19.0 + x_24) > (13.0 + x_25)? (19.0 + x_24) : (13.0 + x_25))))? (((3.0 + x_4) > ((13.0 + x_5) > (20.0 + x_6)? (13.0 + x_5) : (20.0 + x_6))? (3.0 + x_4) : ((13.0 + x_5) > (20.0 + x_6)? (13.0 + x_5) : (20.0 + x_6))) > (((3.0 + x_8) > (15.0 + x_10)? (3.0 + x_8) : (15.0 + x_10)) > ((3.0 + x_11) > (1.0 + x_14)? (3.0 + x_11) : (1.0 + x_14))? ((3.0 + x_8) > (15.0 + x_10)? (3.0 + x_8) : (15.0 + x_10)) : ((3.0 + x_11) > (1.0 + x_14)? (3.0 + x_11) : (1.0 + x_14)))? ((3.0 + x_4) > ((13.0 + x_5) > (20.0 + x_6)? (13.0 + x_5) : (20.0 + x_6))? (3.0 + x_4) : ((13.0 + x_5) > (20.0 + x_6)? (13.0 + x_5) : (20.0 + x_6))) : (((3.0 + x_8) > (15.0 + x_10)? (3.0 + x_8) : (15.0 + x_10)) > ((3.0 + x_11) > (1.0 + x_14)? (3.0 + x_11) : (1.0 + x_14))? ((3.0 + x_8) > (15.0 + x_10)? (3.0 + x_8) : (15.0 + x_10)) : ((3.0 + x_11) > (1.0 + x_14)? (3.0 + x_11) : (1.0 + x_14)))) : (((10.0 + x_18) > ((10.0 + x_20) > (13.0 + x_21)? (10.0 + x_20) : (13.0 + x_21))? (10.0 + x_18) : ((10.0 + x_20) > (13.0 + x_21)? (10.0 + x_20) : (13.0 + x_21))) > (((14.0 + x_22) > (5.0 + x_23)? (14.0 + x_22) : (5.0 + x_23)) > ((19.0 + x_24) > (13.0 + x_25)? (19.0 + x_24) : (13.0 + x_25))? ((14.0 + x_22) > (5.0 + x_23)? (14.0 + x_22) : (5.0 + x_23)) : ((19.0 + x_24) > (13.0 + x_25)? (19.0 + x_24) : (13.0 + x_25)))? ((10.0 + x_18) > ((10.0 + x_20) > (13.0 + x_21)? (10.0 + x_20) : (13.0 + x_21))? (10.0 + x_18) : ((10.0 + x_20) > (13.0 + x_21)? (10.0 + x_20) : (13.0 + x_21))) : (((14.0 + x_22) > (5.0 + x_23)? (14.0 + x_22) : (5.0 + x_23)) > ((19.0 + x_24) > (13.0 + x_25)? (19.0 + x_24) : (13.0 + x_25))? ((14.0 + x_22) > (5.0 + x_23)? (14.0 + x_22) : (5.0 + x_23)) : ((19.0 + x_24) > (13.0 + x_25)? (19.0 + x_24) : (13.0 + x_25)))));
x_1_ = ((((4.0 + x_0) > ((14.0 + x_1) > (13.0 + x_2)? (14.0 + x_1) : (13.0 + x_2))? (4.0 + x_0) : ((14.0 + x_1) > (13.0 + x_2)? (14.0 + x_1) : (13.0 + x_2))) > (((15.0 + x_3) > (17.0 + x_6)? (15.0 + x_3) : (17.0 + x_6)) > ((14.0 + x_9) > (8.0 + x_11)? (14.0 + x_9) : (8.0 + x_11))? ((15.0 + x_3) > (17.0 + x_6)? (15.0 + x_3) : (17.0 + x_6)) : ((14.0 + x_9) > (8.0 + x_11)? (14.0 + x_9) : (8.0 + x_11)))? ((4.0 + x_0) > ((14.0 + x_1) > (13.0 + x_2)? (14.0 + x_1) : (13.0 + x_2))? (4.0 + x_0) : ((14.0 + x_1) > (13.0 + x_2)? (14.0 + x_1) : (13.0 + x_2))) : (((15.0 + x_3) > (17.0 + x_6)? (15.0 + x_3) : (17.0 + x_6)) > ((14.0 + x_9) > (8.0 + x_11)? (14.0 + x_9) : (8.0 + x_11))? ((15.0 + x_3) > (17.0 + x_6)? (15.0 + x_3) : (17.0 + x_6)) : ((14.0 + x_9) > (8.0 + x_11)? (14.0 + x_9) : (8.0 + x_11)))) > (((13.0 + x_13) > ((17.0 + x_15) > (11.0 + x_17)? (17.0 + x_15) : (11.0 + x_17))? (13.0 + x_13) : ((17.0 + x_15) > (11.0 + x_17)? (17.0 + x_15) : (11.0 + x_17))) > (((9.0 + x_22) > (12.0 + x_25)? (9.0 + x_22) : (12.0 + x_25)) > ((19.0 + x_26) > (5.0 + x_27)? (19.0 + x_26) : (5.0 + x_27))? ((9.0 + x_22) > (12.0 + x_25)? (9.0 + x_22) : (12.0 + x_25)) : ((19.0 + x_26) > (5.0 + x_27)? (19.0 + x_26) : (5.0 + x_27)))? ((13.0 + x_13) > ((17.0 + x_15) > (11.0 + x_17)? (17.0 + x_15) : (11.0 + x_17))? (13.0 + x_13) : ((17.0 + x_15) > (11.0 + x_17)? (17.0 + x_15) : (11.0 + x_17))) : (((9.0 + x_22) > (12.0 + x_25)? (9.0 + x_22) : (12.0 + x_25)) > ((19.0 + x_26) > (5.0 + x_27)? (19.0 + x_26) : (5.0 + x_27))? ((9.0 + x_22) > (12.0 + x_25)? (9.0 + x_22) : (12.0 + x_25)) : ((19.0 + x_26) > (5.0 + x_27)? (19.0 + x_26) : (5.0 + x_27))))? (((4.0 + x_0) > ((14.0 + x_1) > (13.0 + x_2)? (14.0 + x_1) : (13.0 + x_2))? (4.0 + x_0) : ((14.0 + x_1) > (13.0 + x_2)? (14.0 + x_1) : (13.0 + x_2))) > (((15.0 + x_3) > (17.0 + x_6)? (15.0 + x_3) : (17.0 + x_6)) > ((14.0 + x_9) > (8.0 + x_11)? (14.0 + x_9) : (8.0 + x_11))? ((15.0 + x_3) > (17.0 + x_6)? (15.0 + x_3) : (17.0 + x_6)) : ((14.0 + x_9) > (8.0 + x_11)? (14.0 + x_9) : (8.0 + x_11)))? ((4.0 + x_0) > ((14.0 + x_1) > (13.0 + x_2)? (14.0 + x_1) : (13.0 + x_2))? (4.0 + x_0) : ((14.0 + x_1) > (13.0 + x_2)? (14.0 + x_1) : (13.0 + x_2))) : (((15.0 + x_3) > (17.0 + x_6)? (15.0 + x_3) : (17.0 + x_6)) > ((14.0 + x_9) > (8.0 + x_11)? (14.0 + x_9) : (8.0 + x_11))? ((15.0 + x_3) > (17.0 + x_6)? (15.0 + x_3) : (17.0 + x_6)) : ((14.0 + x_9) > (8.0 + x_11)? (14.0 + x_9) : (8.0 + x_11)))) : (((13.0 + x_13) > ((17.0 + x_15) > (11.0 + x_17)? (17.0 + x_15) : (11.0 + x_17))? (13.0 + x_13) : ((17.0 + x_15) > (11.0 + x_17)? (17.0 + x_15) : (11.0 + x_17))) > (((9.0 + x_22) > (12.0 + x_25)? (9.0 + x_22) : (12.0 + x_25)) > ((19.0 + x_26) > (5.0 + x_27)? (19.0 + x_26) : (5.0 + x_27))? ((9.0 + x_22) > (12.0 + x_25)? (9.0 + x_22) : (12.0 + x_25)) : ((19.0 + x_26) > (5.0 + x_27)? (19.0 + x_26) : (5.0 + x_27)))? ((13.0 + x_13) > ((17.0 + x_15) > (11.0 + x_17)? (17.0 + x_15) : (11.0 + x_17))? (13.0 + x_13) : ((17.0 + x_15) > (11.0 + x_17)? (17.0 + x_15) : (11.0 + x_17))) : (((9.0 + x_22) > (12.0 + x_25)? (9.0 + x_22) : (12.0 + x_25)) > ((19.0 + x_26) > (5.0 + x_27)? (19.0 + x_26) : (5.0 + x_27))? ((9.0 + x_22) > (12.0 + x_25)? (9.0 + x_22) : (12.0 + x_25)) : ((19.0 + x_26) > (5.0 + x_27)? (19.0 + x_26) : (5.0 + x_27)))));
x_2_ = ((((5.0 + x_1) > ((10.0 + x_8) > (14.0 + x_9)? (10.0 + x_8) : (14.0 + x_9))? (5.0 + x_1) : ((10.0 + x_8) > (14.0 + x_9)? (10.0 + x_8) : (14.0 + x_9))) > (((4.0 + x_10) > (6.0 + x_12)? (4.0 + x_10) : (6.0 + x_12)) > ((10.0 + x_14) > (14.0 + x_16)? (10.0 + x_14) : (14.0 + x_16))? ((4.0 + x_10) > (6.0 + x_12)? (4.0 + x_10) : (6.0 + x_12)) : ((10.0 + x_14) > (14.0 + x_16)? (10.0 + x_14) : (14.0 + x_16)))? ((5.0 + x_1) > ((10.0 + x_8) > (14.0 + x_9)? (10.0 + x_8) : (14.0 + x_9))? (5.0 + x_1) : ((10.0 + x_8) > (14.0 + x_9)? (10.0 + x_8) : (14.0 + x_9))) : (((4.0 + x_10) > (6.0 + x_12)? (4.0 + x_10) : (6.0 + x_12)) > ((10.0 + x_14) > (14.0 + x_16)? (10.0 + x_14) : (14.0 + x_16))? ((4.0 + x_10) > (6.0 + x_12)? (4.0 + x_10) : (6.0 + x_12)) : ((10.0 + x_14) > (14.0 + x_16)? (10.0 + x_14) : (14.0 + x_16)))) > (((19.0 + x_17) > ((15.0 + x_19) > (7.0 + x_21)? (15.0 + x_19) : (7.0 + x_21))? (19.0 + x_17) : ((15.0 + x_19) > (7.0 + x_21)? (15.0 + x_19) : (7.0 + x_21))) > (((11.0 + x_22) > (13.0 + x_24)? (11.0 + x_22) : (13.0 + x_24)) > ((14.0 + x_25) > (6.0 + x_26)? (14.0 + x_25) : (6.0 + x_26))? ((11.0 + x_22) > (13.0 + x_24)? (11.0 + x_22) : (13.0 + x_24)) : ((14.0 + x_25) > (6.0 + x_26)? (14.0 + x_25) : (6.0 + x_26)))? ((19.0 + x_17) > ((15.0 + x_19) > (7.0 + x_21)? (15.0 + x_19) : (7.0 + x_21))? (19.0 + x_17) : ((15.0 + x_19) > (7.0 + x_21)? (15.0 + x_19) : (7.0 + x_21))) : (((11.0 + x_22) > (13.0 + x_24)? (11.0 + x_22) : (13.0 + x_24)) > ((14.0 + x_25) > (6.0 + x_26)? (14.0 + x_25) : (6.0 + x_26))? ((11.0 + x_22) > (13.0 + x_24)? (11.0 + x_22) : (13.0 + x_24)) : ((14.0 + x_25) > (6.0 + x_26)? (14.0 + x_25) : (6.0 + x_26))))? (((5.0 + x_1) > ((10.0 + x_8) > (14.0 + x_9)? (10.0 + x_8) : (14.0 + x_9))? (5.0 + x_1) : ((10.0 + x_8) > (14.0 + x_9)? (10.0 + x_8) : (14.0 + x_9))) > (((4.0 + x_10) > (6.0 + x_12)? (4.0 + x_10) : (6.0 + x_12)) > ((10.0 + x_14) > (14.0 + x_16)? (10.0 + x_14) : (14.0 + x_16))? ((4.0 + x_10) > (6.0 + x_12)? (4.0 + x_10) : (6.0 + x_12)) : ((10.0 + x_14) > (14.0 + x_16)? (10.0 + x_14) : (14.0 + x_16)))? ((5.0 + x_1) > ((10.0 + x_8) > (14.0 + x_9)? (10.0 + x_8) : (14.0 + x_9))? (5.0 + x_1) : ((10.0 + x_8) > (14.0 + x_9)? (10.0 + x_8) : (14.0 + x_9))) : (((4.0 + x_10) > (6.0 + x_12)? (4.0 + x_10) : (6.0 + x_12)) > ((10.0 + x_14) > (14.0 + x_16)? (10.0 + x_14) : (14.0 + x_16))? ((4.0 + x_10) > (6.0 + x_12)? (4.0 + x_10) : (6.0 + x_12)) : ((10.0 + x_14) > (14.0 + x_16)? (10.0 + x_14) : (14.0 + x_16)))) : (((19.0 + x_17) > ((15.0 + x_19) > (7.0 + x_21)? (15.0 + x_19) : (7.0 + x_21))? (19.0 + x_17) : ((15.0 + x_19) > (7.0 + x_21)? (15.0 + x_19) : (7.0 + x_21))) > (((11.0 + x_22) > (13.0 + x_24)? (11.0 + x_22) : (13.0 + x_24)) > ((14.0 + x_25) > (6.0 + x_26)? (14.0 + x_25) : (6.0 + x_26))? ((11.0 + x_22) > (13.0 + x_24)? (11.0 + x_22) : (13.0 + x_24)) : ((14.0 + x_25) > (6.0 + x_26)? (14.0 + x_25) : (6.0 + x_26)))? ((19.0 + x_17) > ((15.0 + x_19) > (7.0 + x_21)? (15.0 + x_19) : (7.0 + x_21))? (19.0 + x_17) : ((15.0 + x_19) > (7.0 + x_21)? (15.0 + x_19) : (7.0 + x_21))) : (((11.0 + x_22) > (13.0 + x_24)? (11.0 + x_22) : (13.0 + x_24)) > ((14.0 + x_25) > (6.0 + x_26)? (14.0 + x_25) : (6.0 + x_26))? ((11.0 + x_22) > (13.0 + x_24)? (11.0 + x_22) : (13.0 + x_24)) : ((14.0 + x_25) > (6.0 + x_26)? (14.0 + x_25) : (6.0 + x_26)))));
x_3_ = ((((5.0 + x_3) > ((15.0 + x_4) > (6.0 + x_5)? (15.0 + x_4) : (6.0 + x_5))? (5.0 + x_3) : ((15.0 + x_4) > (6.0 + x_5)? (15.0 + x_4) : (6.0 + x_5))) > (((9.0 + x_8) > (17.0 + x_9)? (9.0 + x_8) : (17.0 + x_9)) > ((8.0 + x_12) > (19.0 + x_13)? (8.0 + x_12) : (19.0 + x_13))? ((9.0 + x_8) > (17.0 + x_9)? (9.0 + x_8) : (17.0 + x_9)) : ((8.0 + x_12) > (19.0 + x_13)? (8.0 + x_12) : (19.0 + x_13)))? ((5.0 + x_3) > ((15.0 + x_4) > (6.0 + x_5)? (15.0 + x_4) : (6.0 + x_5))? (5.0 + x_3) : ((15.0 + x_4) > (6.0 + x_5)? (15.0 + x_4) : (6.0 + x_5))) : (((9.0 + x_8) > (17.0 + x_9)? (9.0 + x_8) : (17.0 + x_9)) > ((8.0 + x_12) > (19.0 + x_13)? (8.0 + x_12) : (19.0 + x_13))? ((9.0 + x_8) > (17.0 + x_9)? (9.0 + x_8) : (17.0 + x_9)) : ((8.0 + x_12) > (19.0 + x_13)? (8.0 + x_12) : (19.0 + x_13)))) > (((10.0 + x_14) > ((3.0 + x_15) > (10.0 + x_17)? (3.0 + x_15) : (10.0 + x_17))? (10.0 + x_14) : ((3.0 + x_15) > (10.0 + x_17)? (3.0 + x_15) : (10.0 + x_17))) > (((5.0 + x_18) > (19.0 + x_20)? (5.0 + x_18) : (19.0 + x_20)) > ((2.0 + x_23) > (6.0 + x_24)? (2.0 + x_23) : (6.0 + x_24))? ((5.0 + x_18) > (19.0 + x_20)? (5.0 + x_18) : (19.0 + x_20)) : ((2.0 + x_23) > (6.0 + x_24)? (2.0 + x_23) : (6.0 + x_24)))? ((10.0 + x_14) > ((3.0 + x_15) > (10.0 + x_17)? (3.0 + x_15) : (10.0 + x_17))? (10.0 + x_14) : ((3.0 + x_15) > (10.0 + x_17)? (3.0 + x_15) : (10.0 + x_17))) : (((5.0 + x_18) > (19.0 + x_20)? (5.0 + x_18) : (19.0 + x_20)) > ((2.0 + x_23) > (6.0 + x_24)? (2.0 + x_23) : (6.0 + x_24))? ((5.0 + x_18) > (19.0 + x_20)? (5.0 + x_18) : (19.0 + x_20)) : ((2.0 + x_23) > (6.0 + x_24)? (2.0 + x_23) : (6.0 + x_24))))? (((5.0 + x_3) > ((15.0 + x_4) > (6.0 + x_5)? (15.0 + x_4) : (6.0 + x_5))? (5.0 + x_3) : ((15.0 + x_4) > (6.0 + x_5)? (15.0 + x_4) : (6.0 + x_5))) > (((9.0 + x_8) > (17.0 + x_9)? (9.0 + x_8) : (17.0 + x_9)) > ((8.0 + x_12) > (19.0 + x_13)? (8.0 + x_12) : (19.0 + x_13))? ((9.0 + x_8) > (17.0 + x_9)? (9.0 + x_8) : (17.0 + x_9)) : ((8.0 + x_12) > (19.0 + x_13)? (8.0 + x_12) : (19.0 + x_13)))? ((5.0 + x_3) > ((15.0 + x_4) > (6.0 + x_5)? (15.0 + x_4) : (6.0 + x_5))? (5.0 + x_3) : ((15.0 + x_4) > (6.0 + x_5)? (15.0 + x_4) : (6.0 + x_5))) : (((9.0 + x_8) > (17.0 + x_9)? (9.0 + x_8) : (17.0 + x_9)) > ((8.0 + x_12) > (19.0 + x_13)? (8.0 + x_12) : (19.0 + x_13))? ((9.0 + x_8) > (17.0 + x_9)? (9.0 + x_8) : (17.0 + x_9)) : ((8.0 + x_12) > (19.0 + x_13)? (8.0 + x_12) : (19.0 + x_13)))) : (((10.0 + x_14) > ((3.0 + x_15) > (10.0 + x_17)? (3.0 + x_15) : (10.0 + x_17))? (10.0 + x_14) : ((3.0 + x_15) > (10.0 + x_17)? (3.0 + x_15) : (10.0 + x_17))) > (((5.0 + x_18) > (19.0 + x_20)? (5.0 + x_18) : (19.0 + x_20)) > ((2.0 + x_23) > (6.0 + x_24)? (2.0 + x_23) : (6.0 + x_24))? ((5.0 + x_18) > (19.0 + x_20)? (5.0 + x_18) : (19.0 + x_20)) : ((2.0 + x_23) > (6.0 + x_24)? (2.0 + x_23) : (6.0 + x_24)))? ((10.0 + x_14) > ((3.0 + x_15) > (10.0 + x_17)? (3.0 + x_15) : (10.0 + x_17))? (10.0 + x_14) : ((3.0 + x_15) > (10.0 + x_17)? (3.0 + x_15) : (10.0 + x_17))) : (((5.0 + x_18) > (19.0 + x_20)? (5.0 + x_18) : (19.0 + x_20)) > ((2.0 + x_23) > (6.0 + x_24)? (2.0 + x_23) : (6.0 + x_24))? ((5.0 + x_18) > (19.0 + x_20)? (5.0 + x_18) : (19.0 + x_20)) : ((2.0 + x_23) > (6.0 + x_24)? (2.0 + x_23) : (6.0 + x_24)))));
x_4_ = ((((4.0 + x_0) > ((15.0 + x_3) > (4.0 + x_4)? (15.0 + x_3) : (4.0 + x_4))? (4.0 + x_0) : ((15.0 + x_3) > (4.0 + x_4)? (15.0 + x_3) : (4.0 + x_4))) > (((6.0 + x_8) > (16.0 + x_11)? (6.0 + x_8) : (16.0 + x_11)) > ((20.0 + x_13) > (14.0 + x_14)? (20.0 + x_13) : (14.0 + x_14))? ((6.0 + x_8) > (16.0 + x_11)? (6.0 + x_8) : (16.0 + x_11)) : ((20.0 + x_13) > (14.0 + x_14)? (20.0 + x_13) : (14.0 + x_14)))? ((4.0 + x_0) > ((15.0 + x_3) > (4.0 + x_4)? (15.0 + x_3) : (4.0 + x_4))? (4.0 + x_0) : ((15.0 + x_3) > (4.0 + x_4)? (15.0 + x_3) : (4.0 + x_4))) : (((6.0 + x_8) > (16.0 + x_11)? (6.0 + x_8) : (16.0 + x_11)) > ((20.0 + x_13) > (14.0 + x_14)? (20.0 + x_13) : (14.0 + x_14))? ((6.0 + x_8) > (16.0 + x_11)? (6.0 + x_8) : (16.0 + x_11)) : ((20.0 + x_13) > (14.0 + x_14)? (20.0 + x_13) : (14.0 + x_14)))) > (((2.0 + x_15) > ((19.0 + x_16) > (18.0 + x_17)? (19.0 + x_16) : (18.0 + x_17))? (2.0 + x_15) : ((19.0 + x_16) > (18.0 + x_17)? (19.0 + x_16) : (18.0 + x_17))) > (((16.0 + x_21) > (12.0 + x_22)? (16.0 + x_21) : (12.0 + x_22)) > ((7.0 + x_23) > (1.0 + x_27)? (7.0 + x_23) : (1.0 + x_27))? ((16.0 + x_21) > (12.0 + x_22)? (16.0 + x_21) : (12.0 + x_22)) : ((7.0 + x_23) > (1.0 + x_27)? (7.0 + x_23) : (1.0 + x_27)))? ((2.0 + x_15) > ((19.0 + x_16) > (18.0 + x_17)? (19.0 + x_16) : (18.0 + x_17))? (2.0 + x_15) : ((19.0 + x_16) > (18.0 + x_17)? (19.0 + x_16) : (18.0 + x_17))) : (((16.0 + x_21) > (12.0 + x_22)? (16.0 + x_21) : (12.0 + x_22)) > ((7.0 + x_23) > (1.0 + x_27)? (7.0 + x_23) : (1.0 + x_27))? ((16.0 + x_21) > (12.0 + x_22)? (16.0 + x_21) : (12.0 + x_22)) : ((7.0 + x_23) > (1.0 + x_27)? (7.0 + x_23) : (1.0 + x_27))))? (((4.0 + x_0) > ((15.0 + x_3) > (4.0 + x_4)? (15.0 + x_3) : (4.0 + x_4))? (4.0 + x_0) : ((15.0 + x_3) > (4.0 + x_4)? (15.0 + x_3) : (4.0 + x_4))) > (((6.0 + x_8) > (16.0 + x_11)? (6.0 + x_8) : (16.0 + x_11)) > ((20.0 + x_13) > (14.0 + x_14)? (20.0 + x_13) : (14.0 + x_14))? ((6.0 + x_8) > (16.0 + x_11)? (6.0 + x_8) : (16.0 + x_11)) : ((20.0 + x_13) > (14.0 + x_14)? (20.0 + x_13) : (14.0 + x_14)))? ((4.0 + x_0) > ((15.0 + x_3) > (4.0 + x_4)? (15.0 + x_3) : (4.0 + x_4))? (4.0 + x_0) : ((15.0 + x_3) > (4.0 + x_4)? (15.0 + x_3) : (4.0 + x_4))) : (((6.0 + x_8) > (16.0 + x_11)? (6.0 + x_8) : (16.0 + x_11)) > ((20.0 + x_13) > (14.0 + x_14)? (20.0 + x_13) : (14.0 + x_14))? ((6.0 + x_8) > (16.0 + x_11)? (6.0 + x_8) : (16.0 + x_11)) : ((20.0 + x_13) > (14.0 + x_14)? (20.0 + x_13) : (14.0 + x_14)))) : (((2.0 + x_15) > ((19.0 + x_16) > (18.0 + x_17)? (19.0 + x_16) : (18.0 + x_17))? (2.0 + x_15) : ((19.0 + x_16) > (18.0 + x_17)? (19.0 + x_16) : (18.0 + x_17))) > (((16.0 + x_21) > (12.0 + x_22)? (16.0 + x_21) : (12.0 + x_22)) > ((7.0 + x_23) > (1.0 + x_27)? (7.0 + x_23) : (1.0 + x_27))? ((16.0 + x_21) > (12.0 + x_22)? (16.0 + x_21) : (12.0 + x_22)) : ((7.0 + x_23) > (1.0 + x_27)? (7.0 + x_23) : (1.0 + x_27)))? ((2.0 + x_15) > ((19.0 + x_16) > (18.0 + x_17)? (19.0 + x_16) : (18.0 + x_17))? (2.0 + x_15) : ((19.0 + x_16) > (18.0 + x_17)? (19.0 + x_16) : (18.0 + x_17))) : (((16.0 + x_21) > (12.0 + x_22)? (16.0 + x_21) : (12.0 + x_22)) > ((7.0 + x_23) > (1.0 + x_27)? (7.0 + x_23) : (1.0 + x_27))? ((16.0 + x_21) > (12.0 + x_22)? (16.0 + x_21) : (12.0 + x_22)) : ((7.0 + x_23) > (1.0 + x_27)? (7.0 + x_23) : (1.0 + x_27)))));
x_5_ = ((((13.0 + x_0) > ((15.0 + x_5) > (9.0 + x_6)? (15.0 + x_5) : (9.0 + x_6))? (13.0 + x_0) : ((15.0 + x_5) > (9.0 + x_6)? (15.0 + x_5) : (9.0 + x_6))) > (((8.0 + x_7) > (6.0 + x_8)? (8.0 + x_7) : (6.0 + x_8)) > ((9.0 + x_10) > (4.0 + x_13)? (9.0 + x_10) : (4.0 + x_13))? ((8.0 + x_7) > (6.0 + x_8)? (8.0 + x_7) : (6.0 + x_8)) : ((9.0 + x_10) > (4.0 + x_13)? (9.0 + x_10) : (4.0 + x_13)))? ((13.0 + x_0) > ((15.0 + x_5) > (9.0 + x_6)? (15.0 + x_5) : (9.0 + x_6))? (13.0 + x_0) : ((15.0 + x_5) > (9.0 + x_6)? (15.0 + x_5) : (9.0 + x_6))) : (((8.0 + x_7) > (6.0 + x_8)? (8.0 + x_7) : (6.0 + x_8)) > ((9.0 + x_10) > (4.0 + x_13)? (9.0 + x_10) : (4.0 + x_13))? ((8.0 + x_7) > (6.0 + x_8)? (8.0 + x_7) : (6.0 + x_8)) : ((9.0 + x_10) > (4.0 + x_13)? (9.0 + x_10) : (4.0 + x_13)))) > (((14.0 + x_17) > ((15.0 + x_19) > (6.0 + x_20)? (15.0 + x_19) : (6.0 + x_20))? (14.0 + x_17) : ((15.0 + x_19) > (6.0 + x_20)? (15.0 + x_19) : (6.0 + x_20))) > (((14.0 + x_22) > (6.0 + x_23)? (14.0 + x_22) : (6.0 + x_23)) > ((11.0 + x_26) > (14.0 + x_27)? (11.0 + x_26) : (14.0 + x_27))? ((14.0 + x_22) > (6.0 + x_23)? (14.0 + x_22) : (6.0 + x_23)) : ((11.0 + x_26) > (14.0 + x_27)? (11.0 + x_26) : (14.0 + x_27)))? ((14.0 + x_17) > ((15.0 + x_19) > (6.0 + x_20)? (15.0 + x_19) : (6.0 + x_20))? (14.0 + x_17) : ((15.0 + x_19) > (6.0 + x_20)? (15.0 + x_19) : (6.0 + x_20))) : (((14.0 + x_22) > (6.0 + x_23)? (14.0 + x_22) : (6.0 + x_23)) > ((11.0 + x_26) > (14.0 + x_27)? (11.0 + x_26) : (14.0 + x_27))? ((14.0 + x_22) > (6.0 + x_23)? (14.0 + x_22) : (6.0 + x_23)) : ((11.0 + x_26) > (14.0 + x_27)? (11.0 + x_26) : (14.0 + x_27))))? (((13.0 + x_0) > ((15.0 + x_5) > (9.0 + x_6)? (15.0 + x_5) : (9.0 + x_6))? (13.0 + x_0) : ((15.0 + x_5) > (9.0 + x_6)? (15.0 + x_5) : (9.0 + x_6))) > (((8.0 + x_7) > (6.0 + x_8)? (8.0 + x_7) : (6.0 + x_8)) > ((9.0 + x_10) > (4.0 + x_13)? (9.0 + x_10) : (4.0 + x_13))? ((8.0 + x_7) > (6.0 + x_8)? (8.0 + x_7) : (6.0 + x_8)) : ((9.0 + x_10) > (4.0 + x_13)? (9.0 + x_10) : (4.0 + x_13)))? ((13.0 + x_0) > ((15.0 + x_5) > (9.0 + x_6)? (15.0 + x_5) : (9.0 + x_6))? (13.0 + x_0) : ((15.0 + x_5) > (9.0 + x_6)? (15.0 + x_5) : (9.0 + x_6))) : (((8.0 + x_7) > (6.0 + x_8)? (8.0 + x_7) : (6.0 + x_8)) > ((9.0 + x_10) > (4.0 + x_13)? (9.0 + x_10) : (4.0 + x_13))? ((8.0 + x_7) > (6.0 + x_8)? (8.0 + x_7) : (6.0 + x_8)) : ((9.0 + x_10) > (4.0 + x_13)? (9.0 + x_10) : (4.0 + x_13)))) : (((14.0 + x_17) > ((15.0 + x_19) > (6.0 + x_20)? (15.0 + x_19) : (6.0 + x_20))? (14.0 + x_17) : ((15.0 + x_19) > (6.0 + x_20)? (15.0 + x_19) : (6.0 + x_20))) > (((14.0 + x_22) > (6.0 + x_23)? (14.0 + x_22) : (6.0 + x_23)) > ((11.0 + x_26) > (14.0 + x_27)? (11.0 + x_26) : (14.0 + x_27))? ((14.0 + x_22) > (6.0 + x_23)? (14.0 + x_22) : (6.0 + x_23)) : ((11.0 + x_26) > (14.0 + x_27)? (11.0 + x_26) : (14.0 + x_27)))? ((14.0 + x_17) > ((15.0 + x_19) > (6.0 + x_20)? (15.0 + x_19) : (6.0 + x_20))? (14.0 + x_17) : ((15.0 + x_19) > (6.0 + x_20)? (15.0 + x_19) : (6.0 + x_20))) : (((14.0 + x_22) > (6.0 + x_23)? (14.0 + x_22) : (6.0 + x_23)) > ((11.0 + x_26) > (14.0 + x_27)? (11.0 + x_26) : (14.0 + x_27))? ((14.0 + x_22) > (6.0 + x_23)? (14.0 + x_22) : (6.0 + x_23)) : ((11.0 + x_26) > (14.0 + x_27)? (11.0 + x_26) : (14.0 + x_27)))));
x_6_ = ((((5.0 + x_1) > ((18.0 + x_2) > (6.0 + x_6)? (18.0 + x_2) : (6.0 + x_6))? (5.0 + x_1) : ((18.0 + x_2) > (6.0 + x_6)? (18.0 + x_2) : (6.0 + x_6))) > (((11.0 + x_9) > (14.0 + x_10)? (11.0 + x_9) : (14.0 + x_10)) > ((20.0 + x_13) > (17.0 + x_16)? (20.0 + x_13) : (17.0 + x_16))? ((11.0 + x_9) > (14.0 + x_10)? (11.0 + x_9) : (14.0 + x_10)) : ((20.0 + x_13) > (17.0 + x_16)? (20.0 + x_13) : (17.0 + x_16)))? ((5.0 + x_1) > ((18.0 + x_2) > (6.0 + x_6)? (18.0 + x_2) : (6.0 + x_6))? (5.0 + x_1) : ((18.0 + x_2) > (6.0 + x_6)? (18.0 + x_2) : (6.0 + x_6))) : (((11.0 + x_9) > (14.0 + x_10)? (11.0 + x_9) : (14.0 + x_10)) > ((20.0 + x_13) > (17.0 + x_16)? (20.0 + x_13) : (17.0 + x_16))? ((11.0 + x_9) > (14.0 + x_10)? (11.0 + x_9) : (14.0 + x_10)) : ((20.0 + x_13) > (17.0 + x_16)? (20.0 + x_13) : (17.0 + x_16)))) > (((11.0 + x_17) > ((2.0 + x_18) > (10.0 + x_19)? (2.0 + x_18) : (10.0 + x_19))? (11.0 + x_17) : ((2.0 + x_18) > (10.0 + x_19)? (2.0 + x_18) : (10.0 + x_19))) > (((9.0 + x_22) > (13.0 + x_23)? (9.0 + x_22) : (13.0 + x_23)) > ((2.0 + x_25) > (15.0 + x_27)? (2.0 + x_25) : (15.0 + x_27))? ((9.0 + x_22) > (13.0 + x_23)? (9.0 + x_22) : (13.0 + x_23)) : ((2.0 + x_25) > (15.0 + x_27)? (2.0 + x_25) : (15.0 + x_27)))? ((11.0 + x_17) > ((2.0 + x_18) > (10.0 + x_19)? (2.0 + x_18) : (10.0 + x_19))? (11.0 + x_17) : ((2.0 + x_18) > (10.0 + x_19)? (2.0 + x_18) : (10.0 + x_19))) : (((9.0 + x_22) > (13.0 + x_23)? (9.0 + x_22) : (13.0 + x_23)) > ((2.0 + x_25) > (15.0 + x_27)? (2.0 + x_25) : (15.0 + x_27))? ((9.0 + x_22) > (13.0 + x_23)? (9.0 + x_22) : (13.0 + x_23)) : ((2.0 + x_25) > (15.0 + x_27)? (2.0 + x_25) : (15.0 + x_27))))? (((5.0 + x_1) > ((18.0 + x_2) > (6.0 + x_6)? (18.0 + x_2) : (6.0 + x_6))? (5.0 + x_1) : ((18.0 + x_2) > (6.0 + x_6)? (18.0 + x_2) : (6.0 + x_6))) > (((11.0 + x_9) > (14.0 + x_10)? (11.0 + x_9) : (14.0 + x_10)) > ((20.0 + x_13) > (17.0 + x_16)? (20.0 + x_13) : (17.0 + x_16))? ((11.0 + x_9) > (14.0 + x_10)? (11.0 + x_9) : (14.0 + x_10)) : ((20.0 + x_13) > (17.0 + x_16)? (20.0 + x_13) : (17.0 + x_16)))? ((5.0 + x_1) > ((18.0 + x_2) > (6.0 + x_6)? (18.0 + x_2) : (6.0 + x_6))? (5.0 + x_1) : ((18.0 + x_2) > (6.0 + x_6)? (18.0 + x_2) : (6.0 + x_6))) : (((11.0 + x_9) > (14.0 + x_10)? (11.0 + x_9) : (14.0 + x_10)) > ((20.0 + x_13) > (17.0 + x_16)? (20.0 + x_13) : (17.0 + x_16))? ((11.0 + x_9) > (14.0 + x_10)? (11.0 + x_9) : (14.0 + x_10)) : ((20.0 + x_13) > (17.0 + x_16)? (20.0 + x_13) : (17.0 + x_16)))) : (((11.0 + x_17) > ((2.0 + x_18) > (10.0 + x_19)? (2.0 + x_18) : (10.0 + x_19))? (11.0 + x_17) : ((2.0 + x_18) > (10.0 + x_19)? (2.0 + x_18) : (10.0 + x_19))) > (((9.0 + x_22) > (13.0 + x_23)? (9.0 + x_22) : (13.0 + x_23)) > ((2.0 + x_25) > (15.0 + x_27)? (2.0 + x_25) : (15.0 + x_27))? ((9.0 + x_22) > (13.0 + x_23)? (9.0 + x_22) : (13.0 + x_23)) : ((2.0 + x_25) > (15.0 + x_27)? (2.0 + x_25) : (15.0 + x_27)))? ((11.0 + x_17) > ((2.0 + x_18) > (10.0 + x_19)? (2.0 + x_18) : (10.0 + x_19))? (11.0 + x_17) : ((2.0 + x_18) > (10.0 + x_19)? (2.0 + x_18) : (10.0 + x_19))) : (((9.0 + x_22) > (13.0 + x_23)? (9.0 + x_22) : (13.0 + x_23)) > ((2.0 + x_25) > (15.0 + x_27)? (2.0 + x_25) : (15.0 + x_27))? ((9.0 + x_22) > (13.0 + x_23)? (9.0 + x_22) : (13.0 + x_23)) : ((2.0 + x_25) > (15.0 + x_27)? (2.0 + x_25) : (15.0 + x_27)))));
x_7_ = ((((6.0 + x_0) > ((6.0 + x_1) > (6.0 + x_2)? (6.0 + x_1) : (6.0 + x_2))? (6.0 + x_0) : ((6.0 + x_1) > (6.0 + x_2)? (6.0 + x_1) : (6.0 + x_2))) > (((15.0 + x_3) > (4.0 + x_5)? (15.0 + x_3) : (4.0 + x_5)) > ((14.0 + x_7) > (10.0 + x_8)? (14.0 + x_7) : (10.0 + x_8))? ((15.0 + x_3) > (4.0 + x_5)? (15.0 + x_3) : (4.0 + x_5)) : ((14.0 + x_7) > (10.0 + x_8)? (14.0 + x_7) : (10.0 + x_8)))? ((6.0 + x_0) > ((6.0 + x_1) > (6.0 + x_2)? (6.0 + x_1) : (6.0 + x_2))? (6.0 + x_0) : ((6.0 + x_1) > (6.0 + x_2)? (6.0 + x_1) : (6.0 + x_2))) : (((15.0 + x_3) > (4.0 + x_5)? (15.0 + x_3) : (4.0 + x_5)) > ((14.0 + x_7) > (10.0 + x_8)? (14.0 + x_7) : (10.0 + x_8))? ((15.0 + x_3) > (4.0 + x_5)? (15.0 + x_3) : (4.0 + x_5)) : ((14.0 + x_7) > (10.0 + x_8)? (14.0 + x_7) : (10.0 + x_8)))) > (((4.0 + x_12) > ((8.0 + x_14) > (3.0 + x_21)? (8.0 + x_14) : (3.0 + x_21))? (4.0 + x_12) : ((8.0 + x_14) > (3.0 + x_21)? (8.0 + x_14) : (3.0 + x_21))) > (((2.0 + x_22) > (9.0 + x_23)? (2.0 + x_22) : (9.0 + x_23)) > ((6.0 + x_24) > (8.0 + x_25)? (6.0 + x_24) : (8.0 + x_25))? ((2.0 + x_22) > (9.0 + x_23)? (2.0 + x_22) : (9.0 + x_23)) : ((6.0 + x_24) > (8.0 + x_25)? (6.0 + x_24) : (8.0 + x_25)))? ((4.0 + x_12) > ((8.0 + x_14) > (3.0 + x_21)? (8.0 + x_14) : (3.0 + x_21))? (4.0 + x_12) : ((8.0 + x_14) > (3.0 + x_21)? (8.0 + x_14) : (3.0 + x_21))) : (((2.0 + x_22) > (9.0 + x_23)? (2.0 + x_22) : (9.0 + x_23)) > ((6.0 + x_24) > (8.0 + x_25)? (6.0 + x_24) : (8.0 + x_25))? ((2.0 + x_22) > (9.0 + x_23)? (2.0 + x_22) : (9.0 + x_23)) : ((6.0 + x_24) > (8.0 + x_25)? (6.0 + x_24) : (8.0 + x_25))))? (((6.0 + x_0) > ((6.0 + x_1) > (6.0 + x_2)? (6.0 + x_1) : (6.0 + x_2))? (6.0 + x_0) : ((6.0 + x_1) > (6.0 + x_2)? (6.0 + x_1) : (6.0 + x_2))) > (((15.0 + x_3) > (4.0 + x_5)? (15.0 + x_3) : (4.0 + x_5)) > ((14.0 + x_7) > (10.0 + x_8)? (14.0 + x_7) : (10.0 + x_8))? ((15.0 + x_3) > (4.0 + x_5)? (15.0 + x_3) : (4.0 + x_5)) : ((14.0 + x_7) > (10.0 + x_8)? (14.0 + x_7) : (10.0 + x_8)))? ((6.0 + x_0) > ((6.0 + x_1) > (6.0 + x_2)? (6.0 + x_1) : (6.0 + x_2))? (6.0 + x_0) : ((6.0 + x_1) > (6.0 + x_2)? (6.0 + x_1) : (6.0 + x_2))) : (((15.0 + x_3) > (4.0 + x_5)? (15.0 + x_3) : (4.0 + x_5)) > ((14.0 + x_7) > (10.0 + x_8)? (14.0 + x_7) : (10.0 + x_8))? ((15.0 + x_3) > (4.0 + x_5)? (15.0 + x_3) : (4.0 + x_5)) : ((14.0 + x_7) > (10.0 + x_8)? (14.0 + x_7) : (10.0 + x_8)))) : (((4.0 + x_12) > ((8.0 + x_14) > (3.0 + x_21)? (8.0 + x_14) : (3.0 + x_21))? (4.0 + x_12) : ((8.0 + x_14) > (3.0 + x_21)? (8.0 + x_14) : (3.0 + x_21))) > (((2.0 + x_22) > (9.0 + x_23)? (2.0 + x_22) : (9.0 + x_23)) > ((6.0 + x_24) > (8.0 + x_25)? (6.0 + x_24) : (8.0 + x_25))? ((2.0 + x_22) > (9.0 + x_23)? (2.0 + x_22) : (9.0 + x_23)) : ((6.0 + x_24) > (8.0 + x_25)? (6.0 + x_24) : (8.0 + x_25)))? ((4.0 + x_12) > ((8.0 + x_14) > (3.0 + x_21)? (8.0 + x_14) : (3.0 + x_21))? (4.0 + x_12) : ((8.0 + x_14) > (3.0 + x_21)? (8.0 + x_14) : (3.0 + x_21))) : (((2.0 + x_22) > (9.0 + x_23)? (2.0 + x_22) : (9.0 + x_23)) > ((6.0 + x_24) > (8.0 + x_25)? (6.0 + x_24) : (8.0 + x_25))? ((2.0 + x_22) > (9.0 + x_23)? (2.0 + x_22) : (9.0 + x_23)) : ((6.0 + x_24) > (8.0 + x_25)? (6.0 + x_24) : (8.0 + x_25)))));
x_8_ = ((((16.0 + x_0) > ((15.0 + x_3) > (18.0 + x_7)? (15.0 + x_3) : (18.0 + x_7))? (16.0 + x_0) : ((15.0 + x_3) > (18.0 + x_7)? (15.0 + x_3) : (18.0 + x_7))) > (((14.0 + x_8) > (1.0 + x_9)? (14.0 + x_8) : (1.0 + x_9)) > ((3.0 + x_12) > (11.0 + x_13)? (3.0 + x_12) : (11.0 + x_13))? ((14.0 + x_8) > (1.0 + x_9)? (14.0 + x_8) : (1.0 + x_9)) : ((3.0 + x_12) > (11.0 + x_13)? (3.0 + x_12) : (11.0 + x_13)))? ((16.0 + x_0) > ((15.0 + x_3) > (18.0 + x_7)? (15.0 + x_3) : (18.0 + x_7))? (16.0 + x_0) : ((15.0 + x_3) > (18.0 + x_7)? (15.0 + x_3) : (18.0 + x_7))) : (((14.0 + x_8) > (1.0 + x_9)? (14.0 + x_8) : (1.0 + x_9)) > ((3.0 + x_12) > (11.0 + x_13)? (3.0 + x_12) : (11.0 + x_13))? ((14.0 + x_8) > (1.0 + x_9)? (14.0 + x_8) : (1.0 + x_9)) : ((3.0 + x_12) > (11.0 + x_13)? (3.0 + x_12) : (11.0 + x_13)))) > (((2.0 + x_14) > ((17.0 + x_17) > (7.0 + x_18)? (17.0 + x_17) : (7.0 + x_18))? (2.0 + x_14) : ((17.0 + x_17) > (7.0 + x_18)? (17.0 + x_17) : (7.0 + x_18))) > (((17.0 + x_19) > (4.0 + x_20)? (17.0 + x_19) : (4.0 + x_20)) > ((15.0 + x_22) > (1.0 + x_24)? (15.0 + x_22) : (1.0 + x_24))? ((17.0 + x_19) > (4.0 + x_20)? (17.0 + x_19) : (4.0 + x_20)) : ((15.0 + x_22) > (1.0 + x_24)? (15.0 + x_22) : (1.0 + x_24)))? ((2.0 + x_14) > ((17.0 + x_17) > (7.0 + x_18)? (17.0 + x_17) : (7.0 + x_18))? (2.0 + x_14) : ((17.0 + x_17) > (7.0 + x_18)? (17.0 + x_17) : (7.0 + x_18))) : (((17.0 + x_19) > (4.0 + x_20)? (17.0 + x_19) : (4.0 + x_20)) > ((15.0 + x_22) > (1.0 + x_24)? (15.0 + x_22) : (1.0 + x_24))? ((17.0 + x_19) > (4.0 + x_20)? (17.0 + x_19) : (4.0 + x_20)) : ((15.0 + x_22) > (1.0 + x_24)? (15.0 + x_22) : (1.0 + x_24))))? (((16.0 + x_0) > ((15.0 + x_3) > (18.0 + x_7)? (15.0 + x_3) : (18.0 + x_7))? (16.0 + x_0) : ((15.0 + x_3) > (18.0 + x_7)? (15.0 + x_3) : (18.0 + x_7))) > (((14.0 + x_8) > (1.0 + x_9)? (14.0 + x_8) : (1.0 + x_9)) > ((3.0 + x_12) > (11.0 + x_13)? (3.0 + x_12) : (11.0 + x_13))? ((14.0 + x_8) > (1.0 + x_9)? (14.0 + x_8) : (1.0 + x_9)) : ((3.0 + x_12) > (11.0 + x_13)? (3.0 + x_12) : (11.0 + x_13)))? ((16.0 + x_0) > ((15.0 + x_3) > (18.0 + x_7)? (15.0 + x_3) : (18.0 + x_7))? (16.0 + x_0) : ((15.0 + x_3) > (18.0 + x_7)? (15.0 + x_3) : (18.0 + x_7))) : (((14.0 + x_8) > (1.0 + x_9)? (14.0 + x_8) : (1.0 + x_9)) > ((3.0 + x_12) > (11.0 + x_13)? (3.0 + x_12) : (11.0 + x_13))? ((14.0 + x_8) > (1.0 + x_9)? (14.0 + x_8) : (1.0 + x_9)) : ((3.0 + x_12) > (11.0 + x_13)? (3.0 + x_12) : (11.0 + x_13)))) : (((2.0 + x_14) > ((17.0 + x_17) > (7.0 + x_18)? (17.0 + x_17) : (7.0 + x_18))? (2.0 + x_14) : ((17.0 + x_17) > (7.0 + x_18)? (17.0 + x_17) : (7.0 + x_18))) > (((17.0 + x_19) > (4.0 + x_20)? (17.0 + x_19) : (4.0 + x_20)) > ((15.0 + x_22) > (1.0 + x_24)? (15.0 + x_22) : (1.0 + x_24))? ((17.0 + x_19) > (4.0 + x_20)? (17.0 + x_19) : (4.0 + x_20)) : ((15.0 + x_22) > (1.0 + x_24)? (15.0 + x_22) : (1.0 + x_24)))? ((2.0 + x_14) > ((17.0 + x_17) > (7.0 + x_18)? (17.0 + x_17) : (7.0 + x_18))? (2.0 + x_14) : ((17.0 + x_17) > (7.0 + x_18)? (17.0 + x_17) : (7.0 + x_18))) : (((17.0 + x_19) > (4.0 + x_20)? (17.0 + x_19) : (4.0 + x_20)) > ((15.0 + x_22) > (1.0 + x_24)? (15.0 + x_22) : (1.0 + x_24))? ((17.0 + x_19) > (4.0 + x_20)? (17.0 + x_19) : (4.0 + x_20)) : ((15.0 + x_22) > (1.0 + x_24)? (15.0 + x_22) : (1.0 + x_24)))));
x_9_ = ((((14.0 + x_1) > ((2.0 + x_5) > (8.0 + x_6)? (2.0 + x_5) : (8.0 + x_6))? (14.0 + x_1) : ((2.0 + x_5) > (8.0 + x_6)? (2.0 + x_5) : (8.0 + x_6))) > (((10.0 + x_9) > (7.0 + x_11)? (10.0 + x_9) : (7.0 + x_11)) > ((17.0 + x_12) > (3.0 + x_13)? (17.0 + x_12) : (3.0 + x_13))? ((10.0 + x_9) > (7.0 + x_11)? (10.0 + x_9) : (7.0 + x_11)) : ((17.0 + x_12) > (3.0 + x_13)? (17.0 + x_12) : (3.0 + x_13)))? ((14.0 + x_1) > ((2.0 + x_5) > (8.0 + x_6)? (2.0 + x_5) : (8.0 + x_6))? (14.0 + x_1) : ((2.0 + x_5) > (8.0 + x_6)? (2.0 + x_5) : (8.0 + x_6))) : (((10.0 + x_9) > (7.0 + x_11)? (10.0 + x_9) : (7.0 + x_11)) > ((17.0 + x_12) > (3.0 + x_13)? (17.0 + x_12) : (3.0 + x_13))? ((10.0 + x_9) > (7.0 + x_11)? (10.0 + x_9) : (7.0 + x_11)) : ((17.0 + x_12) > (3.0 + x_13)? (17.0 + x_12) : (3.0 + x_13)))) > (((11.0 + x_14) > ((9.0 + x_16) > (17.0 + x_19)? (9.0 + x_16) : (17.0 + x_19))? (11.0 + x_14) : ((9.0 + x_16) > (17.0 + x_19)? (9.0 + x_16) : (17.0 + x_19))) > (((16.0 + x_22) > (13.0 + x_25)? (16.0 + x_22) : (13.0 + x_25)) > ((17.0 + x_26) > (7.0 + x_27)? (17.0 + x_26) : (7.0 + x_27))? ((16.0 + x_22) > (13.0 + x_25)? (16.0 + x_22) : (13.0 + x_25)) : ((17.0 + x_26) > (7.0 + x_27)? (17.0 + x_26) : (7.0 + x_27)))? ((11.0 + x_14) > ((9.0 + x_16) > (17.0 + x_19)? (9.0 + x_16) : (17.0 + x_19))? (11.0 + x_14) : ((9.0 + x_16) > (17.0 + x_19)? (9.0 + x_16) : (17.0 + x_19))) : (((16.0 + x_22) > (13.0 + x_25)? (16.0 + x_22) : (13.0 + x_25)) > ((17.0 + x_26) > (7.0 + x_27)? (17.0 + x_26) : (7.0 + x_27))? ((16.0 + x_22) > (13.0 + x_25)? (16.0 + x_22) : (13.0 + x_25)) : ((17.0 + x_26) > (7.0 + x_27)? (17.0 + x_26) : (7.0 + x_27))))? (((14.0 + x_1) > ((2.0 + x_5) > (8.0 + x_6)? (2.0 + x_5) : (8.0 + x_6))? (14.0 + x_1) : ((2.0 + x_5) > (8.0 + x_6)? (2.0 + x_5) : (8.0 + x_6))) > (((10.0 + x_9) > (7.0 + x_11)? (10.0 + x_9) : (7.0 + x_11)) > ((17.0 + x_12) > (3.0 + x_13)? (17.0 + x_12) : (3.0 + x_13))? ((10.0 + x_9) > (7.0 + x_11)? (10.0 + x_9) : (7.0 + x_11)) : ((17.0 + x_12) > (3.0 + x_13)? (17.0 + x_12) : (3.0 + x_13)))? ((14.0 + x_1) > ((2.0 + x_5) > (8.0 + x_6)? (2.0 + x_5) : (8.0 + x_6))? (14.0 + x_1) : ((2.0 + x_5) > (8.0 + x_6)? (2.0 + x_5) : (8.0 + x_6))) : (((10.0 + x_9) > (7.0 + x_11)? (10.0 + x_9) : (7.0 + x_11)) > ((17.0 + x_12) > (3.0 + x_13)? (17.0 + x_12) : (3.0 + x_13))? ((10.0 + x_9) > (7.0 + x_11)? (10.0 + x_9) : (7.0 + x_11)) : ((17.0 + x_12) > (3.0 + x_13)? (17.0 + x_12) : (3.0 + x_13)))) : (((11.0 + x_14) > ((9.0 + x_16) > (17.0 + x_19)? (9.0 + x_16) : (17.0 + x_19))? (11.0 + x_14) : ((9.0 + x_16) > (17.0 + x_19)? (9.0 + x_16) : (17.0 + x_19))) > (((16.0 + x_22) > (13.0 + x_25)? (16.0 + x_22) : (13.0 + x_25)) > ((17.0 + x_26) > (7.0 + x_27)? (17.0 + x_26) : (7.0 + x_27))? ((16.0 + x_22) > (13.0 + x_25)? (16.0 + x_22) : (13.0 + x_25)) : ((17.0 + x_26) > (7.0 + x_27)? (17.0 + x_26) : (7.0 + x_27)))? ((11.0 + x_14) > ((9.0 + x_16) > (17.0 + x_19)? (9.0 + x_16) : (17.0 + x_19))? (11.0 + x_14) : ((9.0 + x_16) > (17.0 + x_19)? (9.0 + x_16) : (17.0 + x_19))) : (((16.0 + x_22) > (13.0 + x_25)? (16.0 + x_22) : (13.0 + x_25)) > ((17.0 + x_26) > (7.0 + x_27)? (17.0 + x_26) : (7.0 + x_27))? ((16.0 + x_22) > (13.0 + x_25)? (16.0 + x_22) : (13.0 + x_25)) : ((17.0 + x_26) > (7.0 + x_27)? (17.0 + x_26) : (7.0 + x_27)))));
x_10_ = ((((16.0 + x_0) > ((8.0 + x_2) > (4.0 + x_3)? (8.0 + x_2) : (4.0 + x_3))? (16.0 + x_0) : ((8.0 + x_2) > (4.0 + x_3)? (8.0 + x_2) : (4.0 + x_3))) > (((13.0 + x_6) > (19.0 + x_9)? (13.0 + x_6) : (19.0 + x_9)) > ((6.0 + x_10) > (17.0 + x_13)? (6.0 + x_10) : (17.0 + x_13))? ((13.0 + x_6) > (19.0 + x_9)? (13.0 + x_6) : (19.0 + x_9)) : ((6.0 + x_10) > (17.0 + x_13)? (6.0 + x_10) : (17.0 + x_13)))? ((16.0 + x_0) > ((8.0 + x_2) > (4.0 + x_3)? (8.0 + x_2) : (4.0 + x_3))? (16.0 + x_0) : ((8.0 + x_2) > (4.0 + x_3)? (8.0 + x_2) : (4.0 + x_3))) : (((13.0 + x_6) > (19.0 + x_9)? (13.0 + x_6) : (19.0 + x_9)) > ((6.0 + x_10) > (17.0 + x_13)? (6.0 + x_10) : (17.0 + x_13))? ((13.0 + x_6) > (19.0 + x_9)? (13.0 + x_6) : (19.0 + x_9)) : ((6.0 + x_10) > (17.0 + x_13)? (6.0 + x_10) : (17.0 + x_13)))) > (((13.0 + x_15) > ((13.0 + x_16) > (1.0 + x_20)? (13.0 + x_16) : (1.0 + x_20))? (13.0 + x_15) : ((13.0 + x_16) > (1.0 + x_20)? (13.0 + x_16) : (1.0 + x_20))) > (((19.0 + x_22) > (2.0 + x_23)? (19.0 + x_22) : (2.0 + x_23)) > ((8.0 + x_24) > (15.0 + x_26)? (8.0 + x_24) : (15.0 + x_26))? ((19.0 + x_22) > (2.0 + x_23)? (19.0 + x_22) : (2.0 + x_23)) : ((8.0 + x_24) > (15.0 + x_26)? (8.0 + x_24) : (15.0 + x_26)))? ((13.0 + x_15) > ((13.0 + x_16) > (1.0 + x_20)? (13.0 + x_16) : (1.0 + x_20))? (13.0 + x_15) : ((13.0 + x_16) > (1.0 + x_20)? (13.0 + x_16) : (1.0 + x_20))) : (((19.0 + x_22) > (2.0 + x_23)? (19.0 + x_22) : (2.0 + x_23)) > ((8.0 + x_24) > (15.0 + x_26)? (8.0 + x_24) : (15.0 + x_26))? ((19.0 + x_22) > (2.0 + x_23)? (19.0 + x_22) : (2.0 + x_23)) : ((8.0 + x_24) > (15.0 + x_26)? (8.0 + x_24) : (15.0 + x_26))))? (((16.0 + x_0) > ((8.0 + x_2) > (4.0 + x_3)? (8.0 + x_2) : (4.0 + x_3))? (16.0 + x_0) : ((8.0 + x_2) > (4.0 + x_3)? (8.0 + x_2) : (4.0 + x_3))) > (((13.0 + x_6) > (19.0 + x_9)? (13.0 + x_6) : (19.0 + x_9)) > ((6.0 + x_10) > (17.0 + x_13)? (6.0 + x_10) : (17.0 + x_13))? ((13.0 + x_6) > (19.0 + x_9)? (13.0 + x_6) : (19.0 + x_9)) : ((6.0 + x_10) > (17.0 + x_13)? (6.0 + x_10) : (17.0 + x_13)))? ((16.0 + x_0) > ((8.0 + x_2) > (4.0 + x_3)? (8.0 + x_2) : (4.0 + x_3))? (16.0 + x_0) : ((8.0 + x_2) > (4.0 + x_3)? (8.0 + x_2) : (4.0 + x_3))) : (((13.0 + x_6) > (19.0 + x_9)? (13.0 + x_6) : (19.0 + x_9)) > ((6.0 + x_10) > (17.0 + x_13)? (6.0 + x_10) : (17.0 + x_13))? ((13.0 + x_6) > (19.0 + x_9)? (13.0 + x_6) : (19.0 + x_9)) : ((6.0 + x_10) > (17.0 + x_13)? (6.0 + x_10) : (17.0 + x_13)))) : (((13.0 + x_15) > ((13.0 + x_16) > (1.0 + x_20)? (13.0 + x_16) : (1.0 + x_20))? (13.0 + x_15) : ((13.0 + x_16) > (1.0 + x_20)? (13.0 + x_16) : (1.0 + x_20))) > (((19.0 + x_22) > (2.0 + x_23)? (19.0 + x_22) : (2.0 + x_23)) > ((8.0 + x_24) > (15.0 + x_26)? (8.0 + x_24) : (15.0 + x_26))? ((19.0 + x_22) > (2.0 + x_23)? (19.0 + x_22) : (2.0 + x_23)) : ((8.0 + x_24) > (15.0 + x_26)? (8.0 + x_24) : (15.0 + x_26)))? ((13.0 + x_15) > ((13.0 + x_16) > (1.0 + x_20)? (13.0 + x_16) : (1.0 + x_20))? (13.0 + x_15) : ((13.0 + x_16) > (1.0 + x_20)? (13.0 + x_16) : (1.0 + x_20))) : (((19.0 + x_22) > (2.0 + x_23)? (19.0 + x_22) : (2.0 + x_23)) > ((8.0 + x_24) > (15.0 + x_26)? (8.0 + x_24) : (15.0 + x_26))? ((19.0 + x_22) > (2.0 + x_23)? (19.0 + x_22) : (2.0 + x_23)) : ((8.0 + x_24) > (15.0 + x_26)? (8.0 + x_24) : (15.0 + x_26)))));
x_11_ = ((((15.0 + x_1) > ((12.0 + x_3) > (1.0 + x_5)? (12.0 + x_3) : (1.0 + x_5))? (15.0 + x_1) : ((12.0 + x_3) > (1.0 + x_5)? (12.0 + x_3) : (1.0 + x_5))) > (((3.0 + x_9) > (12.0 + x_10)? (3.0 + x_9) : (12.0 + x_10)) > ((4.0 + x_12) > (10.0 + x_13)? (4.0 + x_12) : (10.0 + x_13))? ((3.0 + x_9) > (12.0 + x_10)? (3.0 + x_9) : (12.0 + x_10)) : ((4.0 + x_12) > (10.0 + x_13)? (4.0 + x_12) : (10.0 + x_13)))? ((15.0 + x_1) > ((12.0 + x_3) > (1.0 + x_5)? (12.0 + x_3) : (1.0 + x_5))? (15.0 + x_1) : ((12.0 + x_3) > (1.0 + x_5)? (12.0 + x_3) : (1.0 + x_5))) : (((3.0 + x_9) > (12.0 + x_10)? (3.0 + x_9) : (12.0 + x_10)) > ((4.0 + x_12) > (10.0 + x_13)? (4.0 + x_12) : (10.0 + x_13))? ((3.0 + x_9) > (12.0 + x_10)? (3.0 + x_9) : (12.0 + x_10)) : ((4.0 + x_12) > (10.0 + x_13)? (4.0 + x_12) : (10.0 + x_13)))) > (((9.0 + x_14) > ((10.0 + x_17) > (9.0 + x_19)? (10.0 + x_17) : (9.0 + x_19))? (9.0 + x_14) : ((10.0 + x_17) > (9.0 + x_19)? (10.0 + x_17) : (9.0 + x_19))) > (((11.0 + x_20) > (11.0 + x_21)? (11.0 + x_20) : (11.0 + x_21)) > ((6.0 + x_22) > (10.0 + x_26)? (6.0 + x_22) : (10.0 + x_26))? ((11.0 + x_20) > (11.0 + x_21)? (11.0 + x_20) : (11.0 + x_21)) : ((6.0 + x_22) > (10.0 + x_26)? (6.0 + x_22) : (10.0 + x_26)))? ((9.0 + x_14) > ((10.0 + x_17) > (9.0 + x_19)? (10.0 + x_17) : (9.0 + x_19))? (9.0 + x_14) : ((10.0 + x_17) > (9.0 + x_19)? (10.0 + x_17) : (9.0 + x_19))) : (((11.0 + x_20) > (11.0 + x_21)? (11.0 + x_20) : (11.0 + x_21)) > ((6.0 + x_22) > (10.0 + x_26)? (6.0 + x_22) : (10.0 + x_26))? ((11.0 + x_20) > (11.0 + x_21)? (11.0 + x_20) : (11.0 + x_21)) : ((6.0 + x_22) > (10.0 + x_26)? (6.0 + x_22) : (10.0 + x_26))))? (((15.0 + x_1) > ((12.0 + x_3) > (1.0 + x_5)? (12.0 + x_3) : (1.0 + x_5))? (15.0 + x_1) : ((12.0 + x_3) > (1.0 + x_5)? (12.0 + x_3) : (1.0 + x_5))) > (((3.0 + x_9) > (12.0 + x_10)? (3.0 + x_9) : (12.0 + x_10)) > ((4.0 + x_12) > (10.0 + x_13)? (4.0 + x_12) : (10.0 + x_13))? ((3.0 + x_9) > (12.0 + x_10)? (3.0 + x_9) : (12.0 + x_10)) : ((4.0 + x_12) > (10.0 + x_13)? (4.0 + x_12) : (10.0 + x_13)))? ((15.0 + x_1) > ((12.0 + x_3) > (1.0 + x_5)? (12.0 + x_3) : (1.0 + x_5))? (15.0 + x_1) : ((12.0 + x_3) > (1.0 + x_5)? (12.0 + x_3) : (1.0 + x_5))) : (((3.0 + x_9) > (12.0 + x_10)? (3.0 + x_9) : (12.0 + x_10)) > ((4.0 + x_12) > (10.0 + x_13)? (4.0 + x_12) : (10.0 + x_13))? ((3.0 + x_9) > (12.0 + x_10)? (3.0 + x_9) : (12.0 + x_10)) : ((4.0 + x_12) > (10.0 + x_13)? (4.0 + x_12) : (10.0 + x_13)))) : (((9.0 + x_14) > ((10.0 + x_17) > (9.0 + x_19)? (10.0 + x_17) : (9.0 + x_19))? (9.0 + x_14) : ((10.0 + x_17) > (9.0 + x_19)? (10.0 + x_17) : (9.0 + x_19))) > (((11.0 + x_20) > (11.0 + x_21)? (11.0 + x_20) : (11.0 + x_21)) > ((6.0 + x_22) > (10.0 + x_26)? (6.0 + x_22) : (10.0 + x_26))? ((11.0 + x_20) > (11.0 + x_21)? (11.0 + x_20) : (11.0 + x_21)) : ((6.0 + x_22) > (10.0 + x_26)? (6.0 + x_22) : (10.0 + x_26)))? ((9.0 + x_14) > ((10.0 + x_17) > (9.0 + x_19)? (10.0 + x_17) : (9.0 + x_19))? (9.0 + x_14) : ((10.0 + x_17) > (9.0 + x_19)? (10.0 + x_17) : (9.0 + x_19))) : (((11.0 + x_20) > (11.0 + x_21)? (11.0 + x_20) : (11.0 + x_21)) > ((6.0 + x_22) > (10.0 + x_26)? (6.0 + x_22) : (10.0 + x_26))? ((11.0 + x_20) > (11.0 + x_21)? (11.0 + x_20) : (11.0 + x_21)) : ((6.0 + x_22) > (10.0 + x_26)? (6.0 + x_22) : (10.0 + x_26)))));
x_12_ = ((((10.0 + x_1) > ((19.0 + x_4) > (5.0 + x_5)? (19.0 + x_4) : (5.0 + x_5))? (10.0 + x_1) : ((19.0 + x_4) > (5.0 + x_5)? (19.0 + x_4) : (5.0 + x_5))) > (((15.0 + x_6) > (7.0 + x_8)? (15.0 + x_6) : (7.0 + x_8)) > ((3.0 + x_9) > (5.0 + x_11)? (3.0 + x_9) : (5.0 + x_11))? ((15.0 + x_6) > (7.0 + x_8)? (15.0 + x_6) : (7.0 + x_8)) : ((3.0 + x_9) > (5.0 + x_11)? (3.0 + x_9) : (5.0 + x_11)))? ((10.0 + x_1) > ((19.0 + x_4) > (5.0 + x_5)? (19.0 + x_4) : (5.0 + x_5))? (10.0 + x_1) : ((19.0 + x_4) > (5.0 + x_5)? (19.0 + x_4) : (5.0 + x_5))) : (((15.0 + x_6) > (7.0 + x_8)? (15.0 + x_6) : (7.0 + x_8)) > ((3.0 + x_9) > (5.0 + x_11)? (3.0 + x_9) : (5.0 + x_11))? ((15.0 + x_6) > (7.0 + x_8)? (15.0 + x_6) : (7.0 + x_8)) : ((3.0 + x_9) > (5.0 + x_11)? (3.0 + x_9) : (5.0 + x_11)))) > (((5.0 + x_13) > ((7.0 + x_14) > (5.0 + x_15)? (7.0 + x_14) : (5.0 + x_15))? (5.0 + x_13) : ((7.0 + x_14) > (5.0 + x_15)? (7.0 + x_14) : (5.0 + x_15))) > (((10.0 + x_18) > (1.0 + x_20)? (10.0 + x_18) : (1.0 + x_20)) > ((12.0 + x_23) > (3.0 + x_26)? (12.0 + x_23) : (3.0 + x_26))? ((10.0 + x_18) > (1.0 + x_20)? (10.0 + x_18) : (1.0 + x_20)) : ((12.0 + x_23) > (3.0 + x_26)? (12.0 + x_23) : (3.0 + x_26)))? ((5.0 + x_13) > ((7.0 + x_14) > (5.0 + x_15)? (7.0 + x_14) : (5.0 + x_15))? (5.0 + x_13) : ((7.0 + x_14) > (5.0 + x_15)? (7.0 + x_14) : (5.0 + x_15))) : (((10.0 + x_18) > (1.0 + x_20)? (10.0 + x_18) : (1.0 + x_20)) > ((12.0 + x_23) > (3.0 + x_26)? (12.0 + x_23) : (3.0 + x_26))? ((10.0 + x_18) > (1.0 + x_20)? (10.0 + x_18) : (1.0 + x_20)) : ((12.0 + x_23) > (3.0 + x_26)? (12.0 + x_23) : (3.0 + x_26))))? (((10.0 + x_1) > ((19.0 + x_4) > (5.0 + x_5)? (19.0 + x_4) : (5.0 + x_5))? (10.0 + x_1) : ((19.0 + x_4) > (5.0 + x_5)? (19.0 + x_4) : (5.0 + x_5))) > (((15.0 + x_6) > (7.0 + x_8)? (15.0 + x_6) : (7.0 + x_8)) > ((3.0 + x_9) > (5.0 + x_11)? (3.0 + x_9) : (5.0 + x_11))? ((15.0 + x_6) > (7.0 + x_8)? (15.0 + x_6) : (7.0 + x_8)) : ((3.0 + x_9) > (5.0 + x_11)? (3.0 + x_9) : (5.0 + x_11)))? ((10.0 + x_1) > ((19.0 + x_4) > (5.0 + x_5)? (19.0 + x_4) : (5.0 + x_5))? (10.0 + x_1) : ((19.0 + x_4) > (5.0 + x_5)? (19.0 + x_4) : (5.0 + x_5))) : (((15.0 + x_6) > (7.0 + x_8)? (15.0 + x_6) : (7.0 + x_8)) > ((3.0 + x_9) > (5.0 + x_11)? (3.0 + x_9) : (5.0 + x_11))? ((15.0 + x_6) > (7.0 + x_8)? (15.0 + x_6) : (7.0 + x_8)) : ((3.0 + x_9) > (5.0 + x_11)? (3.0 + x_9) : (5.0 + x_11)))) : (((5.0 + x_13) > ((7.0 + x_14) > (5.0 + x_15)? (7.0 + x_14) : (5.0 + x_15))? (5.0 + x_13) : ((7.0 + x_14) > (5.0 + x_15)? (7.0 + x_14) : (5.0 + x_15))) > (((10.0 + x_18) > (1.0 + x_20)? (10.0 + x_18) : (1.0 + x_20)) > ((12.0 + x_23) > (3.0 + x_26)? (12.0 + x_23) : (3.0 + x_26))? ((10.0 + x_18) > (1.0 + x_20)? (10.0 + x_18) : (1.0 + x_20)) : ((12.0 + x_23) > (3.0 + x_26)? (12.0 + x_23) : (3.0 + x_26)))? ((5.0 + x_13) > ((7.0 + x_14) > (5.0 + x_15)? (7.0 + x_14) : (5.0 + x_15))? (5.0 + x_13) : ((7.0 + x_14) > (5.0 + x_15)? (7.0 + x_14) : (5.0 + x_15))) : (((10.0 + x_18) > (1.0 + x_20)? (10.0 + x_18) : (1.0 + x_20)) > ((12.0 + x_23) > (3.0 + x_26)? (12.0 + x_23) : (3.0 + x_26))? ((10.0 + x_18) > (1.0 + x_20)? (10.0 + x_18) : (1.0 + x_20)) : ((12.0 + x_23) > (3.0 + x_26)? (12.0 + x_23) : (3.0 + x_26)))));
x_13_ = ((((10.0 + x_2) > ((2.0 + x_6) > (2.0 + x_7)? (2.0 + x_6) : (2.0 + x_7))? (10.0 + x_2) : ((2.0 + x_6) > (2.0 + x_7)? (2.0 + x_6) : (2.0 + x_7))) > (((5.0 + x_8) > (12.0 + x_10)? (5.0 + x_8) : (12.0 + x_10)) > ((19.0 + x_11) > (17.0 + x_13)? (19.0 + x_11) : (17.0 + x_13))? ((5.0 + x_8) > (12.0 + x_10)? (5.0 + x_8) : (12.0 + x_10)) : ((19.0 + x_11) > (17.0 + x_13)? (19.0 + x_11) : (17.0 + x_13)))? ((10.0 + x_2) > ((2.0 + x_6) > (2.0 + x_7)? (2.0 + x_6) : (2.0 + x_7))? (10.0 + x_2) : ((2.0 + x_6) > (2.0 + x_7)? (2.0 + x_6) : (2.0 + x_7))) : (((5.0 + x_8) > (12.0 + x_10)? (5.0 + x_8) : (12.0 + x_10)) > ((19.0 + x_11) > (17.0 + x_13)? (19.0 + x_11) : (17.0 + x_13))? ((5.0 + x_8) > (12.0 + x_10)? (5.0 + x_8) : (12.0 + x_10)) : ((19.0 + x_11) > (17.0 + x_13)? (19.0 + x_11) : (17.0 + x_13)))) > (((3.0 + x_16) > ((4.0 + x_17) > (13.0 + x_18)? (4.0 + x_17) : (13.0 + x_18))? (3.0 + x_16) : ((4.0 + x_17) > (13.0 + x_18)? (4.0 + x_17) : (13.0 + x_18))) > (((18.0 + x_19) > (13.0 + x_21)? (18.0 + x_19) : (13.0 + x_21)) > ((8.0 + x_22) > (4.0 + x_23)? (8.0 + x_22) : (4.0 + x_23))? ((18.0 + x_19) > (13.0 + x_21)? (18.0 + x_19) : (13.0 + x_21)) : ((8.0 + x_22) > (4.0 + x_23)? (8.0 + x_22) : (4.0 + x_23)))? ((3.0 + x_16) > ((4.0 + x_17) > (13.0 + x_18)? (4.0 + x_17) : (13.0 + x_18))? (3.0 + x_16) : ((4.0 + x_17) > (13.0 + x_18)? (4.0 + x_17) : (13.0 + x_18))) : (((18.0 + x_19) > (13.0 + x_21)? (18.0 + x_19) : (13.0 + x_21)) > ((8.0 + x_22) > (4.0 + x_23)? (8.0 + x_22) : (4.0 + x_23))? ((18.0 + x_19) > (13.0 + x_21)? (18.0 + x_19) : (13.0 + x_21)) : ((8.0 + x_22) > (4.0 + x_23)? (8.0 + x_22) : (4.0 + x_23))))? (((10.0 + x_2) > ((2.0 + x_6) > (2.0 + x_7)? (2.0 + x_6) : (2.0 + x_7))? (10.0 + x_2) : ((2.0 + x_6) > (2.0 + x_7)? (2.0 + x_6) : (2.0 + x_7))) > (((5.0 + x_8) > (12.0 + x_10)? (5.0 + x_8) : (12.0 + x_10)) > ((19.0 + x_11) > (17.0 + x_13)? (19.0 + x_11) : (17.0 + x_13))? ((5.0 + x_8) > (12.0 + x_10)? (5.0 + x_8) : (12.0 + x_10)) : ((19.0 + x_11) > (17.0 + x_13)? (19.0 + x_11) : (17.0 + x_13)))? ((10.0 + x_2) > ((2.0 + x_6) > (2.0 + x_7)? (2.0 + x_6) : (2.0 + x_7))? (10.0 + x_2) : ((2.0 + x_6) > (2.0 + x_7)? (2.0 + x_6) : (2.0 + x_7))) : (((5.0 + x_8) > (12.0 + x_10)? (5.0 + x_8) : (12.0 + x_10)) > ((19.0 + x_11) > (17.0 + x_13)? (19.0 + x_11) : (17.0 + x_13))? ((5.0 + x_8) > (12.0 + x_10)? (5.0 + x_8) : (12.0 + x_10)) : ((19.0 + x_11) > (17.0 + x_13)? (19.0 + x_11) : (17.0 + x_13)))) : (((3.0 + x_16) > ((4.0 + x_17) > (13.0 + x_18)? (4.0 + x_17) : (13.0 + x_18))? (3.0 + x_16) : ((4.0 + x_17) > (13.0 + x_18)? (4.0 + x_17) : (13.0 + x_18))) > (((18.0 + x_19) > (13.0 + x_21)? (18.0 + x_19) : (13.0 + x_21)) > ((8.0 + x_22) > (4.0 + x_23)? (8.0 + x_22) : (4.0 + x_23))? ((18.0 + x_19) > (13.0 + x_21)? (18.0 + x_19) : (13.0 + x_21)) : ((8.0 + x_22) > (4.0 + x_23)? (8.0 + x_22) : (4.0 + x_23)))? ((3.0 + x_16) > ((4.0 + x_17) > (13.0 + x_18)? (4.0 + x_17) : (13.0 + x_18))? (3.0 + x_16) : ((4.0 + x_17) > (13.0 + x_18)? (4.0 + x_17) : (13.0 + x_18))) : (((18.0 + x_19) > (13.0 + x_21)? (18.0 + x_19) : (13.0 + x_21)) > ((8.0 + x_22) > (4.0 + x_23)? (8.0 + x_22) : (4.0 + x_23))? ((18.0 + x_19) > (13.0 + x_21)? (18.0 + x_19) : (13.0 + x_21)) : ((8.0 + x_22) > (4.0 + x_23)? (8.0 + x_22) : (4.0 + x_23)))));
x_14_ = ((((9.0 + x_0) > ((14.0 + x_1) > (18.0 + x_2)? (14.0 + x_1) : (18.0 + x_2))? (9.0 + x_0) : ((14.0 + x_1) > (18.0 + x_2)? (14.0 + x_1) : (18.0 + x_2))) > (((19.0 + x_3) > (2.0 + x_4)? (19.0 + x_3) : (2.0 + x_4)) > ((19.0 + x_7) > (13.0 + x_8)? (19.0 + x_7) : (13.0 + x_8))? ((19.0 + x_3) > (2.0 + x_4)? (19.0 + x_3) : (2.0 + x_4)) : ((19.0 + x_7) > (13.0 + x_8)? (19.0 + x_7) : (13.0 + x_8)))? ((9.0 + x_0) > ((14.0 + x_1) > (18.0 + x_2)? (14.0 + x_1) : (18.0 + x_2))? (9.0 + x_0) : ((14.0 + x_1) > (18.0 + x_2)? (14.0 + x_1) : (18.0 + x_2))) : (((19.0 + x_3) > (2.0 + x_4)? (19.0 + x_3) : (2.0 + x_4)) > ((19.0 + x_7) > (13.0 + x_8)? (19.0 + x_7) : (13.0 + x_8))? ((19.0 + x_3) > (2.0 + x_4)? (19.0 + x_3) : (2.0 + x_4)) : ((19.0 + x_7) > (13.0 + x_8)? (19.0 + x_7) : (13.0 + x_8)))) > (((2.0 + x_10) > ((12.0 + x_15) > (16.0 + x_18)? (12.0 + x_15) : (16.0 + x_18))? (2.0 + x_10) : ((12.0 + x_15) > (16.0 + x_18)? (12.0 + x_15) : (16.0 + x_18))) > (((20.0 + x_22) > (7.0 + x_25)? (20.0 + x_22) : (7.0 + x_25)) > ((1.0 + x_26) > (1.0 + x_27)? (1.0 + x_26) : (1.0 + x_27))? ((20.0 + x_22) > (7.0 + x_25)? (20.0 + x_22) : (7.0 + x_25)) : ((1.0 + x_26) > (1.0 + x_27)? (1.0 + x_26) : (1.0 + x_27)))? ((2.0 + x_10) > ((12.0 + x_15) > (16.0 + x_18)? (12.0 + x_15) : (16.0 + x_18))? (2.0 + x_10) : ((12.0 + x_15) > (16.0 + x_18)? (12.0 + x_15) : (16.0 + x_18))) : (((20.0 + x_22) > (7.0 + x_25)? (20.0 + x_22) : (7.0 + x_25)) > ((1.0 + x_26) > (1.0 + x_27)? (1.0 + x_26) : (1.0 + x_27))? ((20.0 + x_22) > (7.0 + x_25)? (20.0 + x_22) : (7.0 + x_25)) : ((1.0 + x_26) > (1.0 + x_27)? (1.0 + x_26) : (1.0 + x_27))))? (((9.0 + x_0) > ((14.0 + x_1) > (18.0 + x_2)? (14.0 + x_1) : (18.0 + x_2))? (9.0 + x_0) : ((14.0 + x_1) > (18.0 + x_2)? (14.0 + x_1) : (18.0 + x_2))) > (((19.0 + x_3) > (2.0 + x_4)? (19.0 + x_3) : (2.0 + x_4)) > ((19.0 + x_7) > (13.0 + x_8)? (19.0 + x_7) : (13.0 + x_8))? ((19.0 + x_3) > (2.0 + x_4)? (19.0 + x_3) : (2.0 + x_4)) : ((19.0 + x_7) > (13.0 + x_8)? (19.0 + x_7) : (13.0 + x_8)))? ((9.0 + x_0) > ((14.0 + x_1) > (18.0 + x_2)? (14.0 + x_1) : (18.0 + x_2))? (9.0 + x_0) : ((14.0 + x_1) > (18.0 + x_2)? (14.0 + x_1) : (18.0 + x_2))) : (((19.0 + x_3) > (2.0 + x_4)? (19.0 + x_3) : (2.0 + x_4)) > ((19.0 + x_7) > (13.0 + x_8)? (19.0 + x_7) : (13.0 + x_8))? ((19.0 + x_3) > (2.0 + x_4)? (19.0 + x_3) : (2.0 + x_4)) : ((19.0 + x_7) > (13.0 + x_8)? (19.0 + x_7) : (13.0 + x_8)))) : (((2.0 + x_10) > ((12.0 + x_15) > (16.0 + x_18)? (12.0 + x_15) : (16.0 + x_18))? (2.0 + x_10) : ((12.0 + x_15) > (16.0 + x_18)? (12.0 + x_15) : (16.0 + x_18))) > (((20.0 + x_22) > (7.0 + x_25)? (20.0 + x_22) : (7.0 + x_25)) > ((1.0 + x_26) > (1.0 + x_27)? (1.0 + x_26) : (1.0 + x_27))? ((20.0 + x_22) > (7.0 + x_25)? (20.0 + x_22) : (7.0 + x_25)) : ((1.0 + x_26) > (1.0 + x_27)? (1.0 + x_26) : (1.0 + x_27)))? ((2.0 + x_10) > ((12.0 + x_15) > (16.0 + x_18)? (12.0 + x_15) : (16.0 + x_18))? (2.0 + x_10) : ((12.0 + x_15) > (16.0 + x_18)? (12.0 + x_15) : (16.0 + x_18))) : (((20.0 + x_22) > (7.0 + x_25)? (20.0 + x_22) : (7.0 + x_25)) > ((1.0 + x_26) > (1.0 + x_27)? (1.0 + x_26) : (1.0 + x_27))? ((20.0 + x_22) > (7.0 + x_25)? (20.0 + x_22) : (7.0 + x_25)) : ((1.0 + x_26) > (1.0 + x_27)? (1.0 + x_26) : (1.0 + x_27)))));
x_15_ = ((((5.0 + x_1) > ((6.0 + x_3) > (16.0 + x_5)? (6.0 + x_3) : (16.0 + x_5))? (5.0 + x_1) : ((6.0 + x_3) > (16.0 + x_5)? (6.0 + x_3) : (16.0 + x_5))) > (((14.0 + x_6) > (2.0 + x_8)? (14.0 + x_6) : (2.0 + x_8)) > ((8.0 + x_10) > (4.0 + x_13)? (8.0 + x_10) : (4.0 + x_13))? ((14.0 + x_6) > (2.0 + x_8)? (14.0 + x_6) : (2.0 + x_8)) : ((8.0 + x_10) > (4.0 + x_13)? (8.0 + x_10) : (4.0 + x_13)))? ((5.0 + x_1) > ((6.0 + x_3) > (16.0 + x_5)? (6.0 + x_3) : (16.0 + x_5))? (5.0 + x_1) : ((6.0 + x_3) > (16.0 + x_5)? (6.0 + x_3) : (16.0 + x_5))) : (((14.0 + x_6) > (2.0 + x_8)? (14.0 + x_6) : (2.0 + x_8)) > ((8.0 + x_10) > (4.0 + x_13)? (8.0 + x_10) : (4.0 + x_13))? ((14.0 + x_6) > (2.0 + x_8)? (14.0 + x_6) : (2.0 + x_8)) : ((8.0 + x_10) > (4.0 + x_13)? (8.0 + x_10) : (4.0 + x_13)))) > (((15.0 + x_17) > ((8.0 + x_19) > (15.0 + x_20)? (8.0 + x_19) : (15.0 + x_20))? (15.0 + x_17) : ((8.0 + x_19) > (15.0 + x_20)? (8.0 + x_19) : (15.0 + x_20))) > (((19.0 + x_21) > (15.0 + x_22)? (19.0 + x_21) : (15.0 + x_22)) > ((12.0 + x_24) > (15.0 + x_26)? (12.0 + x_24) : (15.0 + x_26))? ((19.0 + x_21) > (15.0 + x_22)? (19.0 + x_21) : (15.0 + x_22)) : ((12.0 + x_24) > (15.0 + x_26)? (12.0 + x_24) : (15.0 + x_26)))? ((15.0 + x_17) > ((8.0 + x_19) > (15.0 + x_20)? (8.0 + x_19) : (15.0 + x_20))? (15.0 + x_17) : ((8.0 + x_19) > (15.0 + x_20)? (8.0 + x_19) : (15.0 + x_20))) : (((19.0 + x_21) > (15.0 + x_22)? (19.0 + x_21) : (15.0 + x_22)) > ((12.0 + x_24) > (15.0 + x_26)? (12.0 + x_24) : (15.0 + x_26))? ((19.0 + x_21) > (15.0 + x_22)? (19.0 + x_21) : (15.0 + x_22)) : ((12.0 + x_24) > (15.0 + x_26)? (12.0 + x_24) : (15.0 + x_26))))? (((5.0 + x_1) > ((6.0 + x_3) > (16.0 + x_5)? (6.0 + x_3) : (16.0 + x_5))? (5.0 + x_1) : ((6.0 + x_3) > (16.0 + x_5)? (6.0 + x_3) : (16.0 + x_5))) > (((14.0 + x_6) > (2.0 + x_8)? (14.0 + x_6) : (2.0 + x_8)) > ((8.0 + x_10) > (4.0 + x_13)? (8.0 + x_10) : (4.0 + x_13))? ((14.0 + x_6) > (2.0 + x_8)? (14.0 + x_6) : (2.0 + x_8)) : ((8.0 + x_10) > (4.0 + x_13)? (8.0 + x_10) : (4.0 + x_13)))? ((5.0 + x_1) > ((6.0 + x_3) > (16.0 + x_5)? (6.0 + x_3) : (16.0 + x_5))? (5.0 + x_1) : ((6.0 + x_3) > (16.0 + x_5)? (6.0 + x_3) : (16.0 + x_5))) : (((14.0 + x_6) > (2.0 + x_8)? (14.0 + x_6) : (2.0 + x_8)) > ((8.0 + x_10) > (4.0 + x_13)? (8.0 + x_10) : (4.0 + x_13))? ((14.0 + x_6) > (2.0 + x_8)? (14.0 + x_6) : (2.0 + x_8)) : ((8.0 + x_10) > (4.0 + x_13)? (8.0 + x_10) : (4.0 + x_13)))) : (((15.0 + x_17) > ((8.0 + x_19) > (15.0 + x_20)? (8.0 + x_19) : (15.0 + x_20))? (15.0 + x_17) : ((8.0 + x_19) > (15.0 + x_20)? (8.0 + x_19) : (15.0 + x_20))) > (((19.0 + x_21) > (15.0 + x_22)? (19.0 + x_21) : (15.0 + x_22)) > ((12.0 + x_24) > (15.0 + x_26)? (12.0 + x_24) : (15.0 + x_26))? ((19.0 + x_21) > (15.0 + x_22)? (19.0 + x_21) : (15.0 + x_22)) : ((12.0 + x_24) > (15.0 + x_26)? (12.0 + x_24) : (15.0 + x_26)))? ((15.0 + x_17) > ((8.0 + x_19) > (15.0 + x_20)? (8.0 + x_19) : (15.0 + x_20))? (15.0 + x_17) : ((8.0 + x_19) > (15.0 + x_20)? (8.0 + x_19) : (15.0 + x_20))) : (((19.0 + x_21) > (15.0 + x_22)? (19.0 + x_21) : (15.0 + x_22)) > ((12.0 + x_24) > (15.0 + x_26)? (12.0 + x_24) : (15.0 + x_26))? ((19.0 + x_21) > (15.0 + x_22)? (19.0 + x_21) : (15.0 + x_22)) : ((12.0 + x_24) > (15.0 + x_26)? (12.0 + x_24) : (15.0 + x_26)))));
x_16_ = ((((4.0 + x_0) > ((5.0 + x_1) > (16.0 + x_4)? (5.0 + x_1) : (16.0 + x_4))? (4.0 + x_0) : ((5.0 + x_1) > (16.0 + x_4)? (5.0 + x_1) : (16.0 + x_4))) > (((17.0 + x_5) > (9.0 + x_7)? (17.0 + x_5) : (9.0 + x_7)) > ((2.0 + x_10) > (11.0 + x_11)? (2.0 + x_10) : (11.0 + x_11))? ((17.0 + x_5) > (9.0 + x_7)? (17.0 + x_5) : (9.0 + x_7)) : ((2.0 + x_10) > (11.0 + x_11)? (2.0 + x_10) : (11.0 + x_11)))? ((4.0 + x_0) > ((5.0 + x_1) > (16.0 + x_4)? (5.0 + x_1) : (16.0 + x_4))? (4.0 + x_0) : ((5.0 + x_1) > (16.0 + x_4)? (5.0 + x_1) : (16.0 + x_4))) : (((17.0 + x_5) > (9.0 + x_7)? (17.0 + x_5) : (9.0 + x_7)) > ((2.0 + x_10) > (11.0 + x_11)? (2.0 + x_10) : (11.0 + x_11))? ((17.0 + x_5) > (9.0 + x_7)? (17.0 + x_5) : (9.0 + x_7)) : ((2.0 + x_10) > (11.0 + x_11)? (2.0 + x_10) : (11.0 + x_11)))) > (((4.0 + x_13) > ((7.0 + x_16) > (12.0 + x_18)? (7.0 + x_16) : (12.0 + x_18))? (4.0 + x_13) : ((7.0 + x_16) > (12.0 + x_18)? (7.0 + x_16) : (12.0 + x_18))) > (((2.0 + x_22) > (3.0 + x_24)? (2.0 + x_22) : (3.0 + x_24)) > ((9.0 + x_26) > (18.0 + x_27)? (9.0 + x_26) : (18.0 + x_27))? ((2.0 + x_22) > (3.0 + x_24)? (2.0 + x_22) : (3.0 + x_24)) : ((9.0 + x_26) > (18.0 + x_27)? (9.0 + x_26) : (18.0 + x_27)))? ((4.0 + x_13) > ((7.0 + x_16) > (12.0 + x_18)? (7.0 + x_16) : (12.0 + x_18))? (4.0 + x_13) : ((7.0 + x_16) > (12.0 + x_18)? (7.0 + x_16) : (12.0 + x_18))) : (((2.0 + x_22) > (3.0 + x_24)? (2.0 + x_22) : (3.0 + x_24)) > ((9.0 + x_26) > (18.0 + x_27)? (9.0 + x_26) : (18.0 + x_27))? ((2.0 + x_22) > (3.0 + x_24)? (2.0 + x_22) : (3.0 + x_24)) : ((9.0 + x_26) > (18.0 + x_27)? (9.0 + x_26) : (18.0 + x_27))))? (((4.0 + x_0) > ((5.0 + x_1) > (16.0 + x_4)? (5.0 + x_1) : (16.0 + x_4))? (4.0 + x_0) : ((5.0 + x_1) > (16.0 + x_4)? (5.0 + x_1) : (16.0 + x_4))) > (((17.0 + x_5) > (9.0 + x_7)? (17.0 + x_5) : (9.0 + x_7)) > ((2.0 + x_10) > (11.0 + x_11)? (2.0 + x_10) : (11.0 + x_11))? ((17.0 + x_5) > (9.0 + x_7)? (17.0 + x_5) : (9.0 + x_7)) : ((2.0 + x_10) > (11.0 + x_11)? (2.0 + x_10) : (11.0 + x_11)))? ((4.0 + x_0) > ((5.0 + x_1) > (16.0 + x_4)? (5.0 + x_1) : (16.0 + x_4))? (4.0 + x_0) : ((5.0 + x_1) > (16.0 + x_4)? (5.0 + x_1) : (16.0 + x_4))) : (((17.0 + x_5) > (9.0 + x_7)? (17.0 + x_5) : (9.0 + x_7)) > ((2.0 + x_10) > (11.0 + x_11)? (2.0 + x_10) : (11.0 + x_11))? ((17.0 + x_5) > (9.0 + x_7)? (17.0 + x_5) : (9.0 + x_7)) : ((2.0 + x_10) > (11.0 + x_11)? (2.0 + x_10) : (11.0 + x_11)))) : (((4.0 + x_13) > ((7.0 + x_16) > (12.0 + x_18)? (7.0 + x_16) : (12.0 + x_18))? (4.0 + x_13) : ((7.0 + x_16) > (12.0 + x_18)? (7.0 + x_16) : (12.0 + x_18))) > (((2.0 + x_22) > (3.0 + x_24)? (2.0 + x_22) : (3.0 + x_24)) > ((9.0 + x_26) > (18.0 + x_27)? (9.0 + x_26) : (18.0 + x_27))? ((2.0 + x_22) > (3.0 + x_24)? (2.0 + x_22) : (3.0 + x_24)) : ((9.0 + x_26) > (18.0 + x_27)? (9.0 + x_26) : (18.0 + x_27)))? ((4.0 + x_13) > ((7.0 + x_16) > (12.0 + x_18)? (7.0 + x_16) : (12.0 + x_18))? (4.0 + x_13) : ((7.0 + x_16) > (12.0 + x_18)? (7.0 + x_16) : (12.0 + x_18))) : (((2.0 + x_22) > (3.0 + x_24)? (2.0 + x_22) : (3.0 + x_24)) > ((9.0 + x_26) > (18.0 + x_27)? (9.0 + x_26) : (18.0 + x_27))? ((2.0 + x_22) > (3.0 + x_24)? (2.0 + x_22) : (3.0 + x_24)) : ((9.0 + x_26) > (18.0 + x_27)? (9.0 + x_26) : (18.0 + x_27)))));
x_17_ = ((((5.0 + x_0) > ((8.0 + x_1) > (13.0 + x_5)? (8.0 + x_1) : (13.0 + x_5))? (5.0 + x_0) : ((8.0 + x_1) > (13.0 + x_5)? (8.0 + x_1) : (13.0 + x_5))) > (((17.0 + x_7) > (3.0 + x_8)? (17.0 + x_7) : (3.0 + x_8)) > ((18.0 + x_9) > (7.0 + x_10)? (18.0 + x_9) : (7.0 + x_10))? ((17.0 + x_7) > (3.0 + x_8)? (17.0 + x_7) : (3.0 + x_8)) : ((18.0 + x_9) > (7.0 + x_10)? (18.0 + x_9) : (7.0 + x_10)))? ((5.0 + x_0) > ((8.0 + x_1) > (13.0 + x_5)? (8.0 + x_1) : (13.0 + x_5))? (5.0 + x_0) : ((8.0 + x_1) > (13.0 + x_5)? (8.0 + x_1) : (13.0 + x_5))) : (((17.0 + x_7) > (3.0 + x_8)? (17.0 + x_7) : (3.0 + x_8)) > ((18.0 + x_9) > (7.0 + x_10)? (18.0 + x_9) : (7.0 + x_10))? ((17.0 + x_7) > (3.0 + x_8)? (17.0 + x_7) : (3.0 + x_8)) : ((18.0 + x_9) > (7.0 + x_10)? (18.0 + x_9) : (7.0 + x_10)))) > (((17.0 + x_13) > ((13.0 + x_16) > (12.0 + x_17)? (13.0 + x_16) : (12.0 + x_17))? (17.0 + x_13) : ((13.0 + x_16) > (12.0 + x_17)? (13.0 + x_16) : (12.0 + x_17))) > (((6.0 + x_18) > (15.0 + x_23)? (6.0 + x_18) : (15.0 + x_23)) > ((14.0 + x_25) > (11.0 + x_26)? (14.0 + x_25) : (11.0 + x_26))? ((6.0 + x_18) > (15.0 + x_23)? (6.0 + x_18) : (15.0 + x_23)) : ((14.0 + x_25) > (11.0 + x_26)? (14.0 + x_25) : (11.0 + x_26)))? ((17.0 + x_13) > ((13.0 + x_16) > (12.0 + x_17)? (13.0 + x_16) : (12.0 + x_17))? (17.0 + x_13) : ((13.0 + x_16) > (12.0 + x_17)? (13.0 + x_16) : (12.0 + x_17))) : (((6.0 + x_18) > (15.0 + x_23)? (6.0 + x_18) : (15.0 + x_23)) > ((14.0 + x_25) > (11.0 + x_26)? (14.0 + x_25) : (11.0 + x_26))? ((6.0 + x_18) > (15.0 + x_23)? (6.0 + x_18) : (15.0 + x_23)) : ((14.0 + x_25) > (11.0 + x_26)? (14.0 + x_25) : (11.0 + x_26))))? (((5.0 + x_0) > ((8.0 + x_1) > (13.0 + x_5)? (8.0 + x_1) : (13.0 + x_5))? (5.0 + x_0) : ((8.0 + x_1) > (13.0 + x_5)? (8.0 + x_1) : (13.0 + x_5))) > (((17.0 + x_7) > (3.0 + x_8)? (17.0 + x_7) : (3.0 + x_8)) > ((18.0 + x_9) > (7.0 + x_10)? (18.0 + x_9) : (7.0 + x_10))? ((17.0 + x_7) > (3.0 + x_8)? (17.0 + x_7) : (3.0 + x_8)) : ((18.0 + x_9) > (7.0 + x_10)? (18.0 + x_9) : (7.0 + x_10)))? ((5.0 + x_0) > ((8.0 + x_1) > (13.0 + x_5)? (8.0 + x_1) : (13.0 + x_5))? (5.0 + x_0) : ((8.0 + x_1) > (13.0 + x_5)? (8.0 + x_1) : (13.0 + x_5))) : (((17.0 + x_7) > (3.0 + x_8)? (17.0 + x_7) : (3.0 + x_8)) > ((18.0 + x_9) > (7.0 + x_10)? (18.0 + x_9) : (7.0 + x_10))? ((17.0 + x_7) > (3.0 + x_8)? (17.0 + x_7) : (3.0 + x_8)) : ((18.0 + x_9) > (7.0 + x_10)? (18.0 + x_9) : (7.0 + x_10)))) : (((17.0 + x_13) > ((13.0 + x_16) > (12.0 + x_17)? (13.0 + x_16) : (12.0 + x_17))? (17.0 + x_13) : ((13.0 + x_16) > (12.0 + x_17)? (13.0 + x_16) : (12.0 + x_17))) > (((6.0 + x_18) > (15.0 + x_23)? (6.0 + x_18) : (15.0 + x_23)) > ((14.0 + x_25) > (11.0 + x_26)? (14.0 + x_25) : (11.0 + x_26))? ((6.0 + x_18) > (15.0 + x_23)? (6.0 + x_18) : (15.0 + x_23)) : ((14.0 + x_25) > (11.0 + x_26)? (14.0 + x_25) : (11.0 + x_26)))? ((17.0 + x_13) > ((13.0 + x_16) > (12.0 + x_17)? (13.0 + x_16) : (12.0 + x_17))? (17.0 + x_13) : ((13.0 + x_16) > (12.0 + x_17)? (13.0 + x_16) : (12.0 + x_17))) : (((6.0 + x_18) > (15.0 + x_23)? (6.0 + x_18) : (15.0 + x_23)) > ((14.0 + x_25) > (11.0 + x_26)? (14.0 + x_25) : (11.0 + x_26))? ((6.0 + x_18) > (15.0 + x_23)? (6.0 + x_18) : (15.0 + x_23)) : ((14.0 + x_25) > (11.0 + x_26)? (14.0 + x_25) : (11.0 + x_26)))));
x_18_ = ((((3.0 + x_2) > ((5.0 + x_3) > (8.0 + x_4)? (5.0 + x_3) : (8.0 + x_4))? (3.0 + x_2) : ((5.0 + x_3) > (8.0 + x_4)? (5.0 + x_3) : (8.0 + x_4))) > (((16.0 + x_8) > (17.0 + x_13)? (16.0 + x_8) : (17.0 + x_13)) > ((9.0 + x_16) > (14.0 + x_17)? (9.0 + x_16) : (14.0 + x_17))? ((16.0 + x_8) > (17.0 + x_13)? (16.0 + x_8) : (17.0 + x_13)) : ((9.0 + x_16) > (14.0 + x_17)? (9.0 + x_16) : (14.0 + x_17)))? ((3.0 + x_2) > ((5.0 + x_3) > (8.0 + x_4)? (5.0 + x_3) : (8.0 + x_4))? (3.0 + x_2) : ((5.0 + x_3) > (8.0 + x_4)? (5.0 + x_3) : (8.0 + x_4))) : (((16.0 + x_8) > (17.0 + x_13)? (16.0 + x_8) : (17.0 + x_13)) > ((9.0 + x_16) > (14.0 + x_17)? (9.0 + x_16) : (14.0 + x_17))? ((16.0 + x_8) > (17.0 + x_13)? (16.0 + x_8) : (17.0 + x_13)) : ((9.0 + x_16) > (14.0 + x_17)? (9.0 + x_16) : (14.0 + x_17)))) > (((11.0 + x_18) > ((17.0 + x_19) > (7.0 + x_20)? (17.0 + x_19) : (7.0 + x_20))? (11.0 + x_18) : ((17.0 + x_19) > (7.0 + x_20)? (17.0 + x_19) : (7.0 + x_20))) > (((13.0 + x_21) > (16.0 + x_22)? (13.0 + x_21) : (16.0 + x_22)) > ((6.0 + x_24) > (11.0 + x_25)? (6.0 + x_24) : (11.0 + x_25))? ((13.0 + x_21) > (16.0 + x_22)? (13.0 + x_21) : (16.0 + x_22)) : ((6.0 + x_24) > (11.0 + x_25)? (6.0 + x_24) : (11.0 + x_25)))? ((11.0 + x_18) > ((17.0 + x_19) > (7.0 + x_20)? (17.0 + x_19) : (7.0 + x_20))? (11.0 + x_18) : ((17.0 + x_19) > (7.0 + x_20)? (17.0 + x_19) : (7.0 + x_20))) : (((13.0 + x_21) > (16.0 + x_22)? (13.0 + x_21) : (16.0 + x_22)) > ((6.0 + x_24) > (11.0 + x_25)? (6.0 + x_24) : (11.0 + x_25))? ((13.0 + x_21) > (16.0 + x_22)? (13.0 + x_21) : (16.0 + x_22)) : ((6.0 + x_24) > (11.0 + x_25)? (6.0 + x_24) : (11.0 + x_25))))? (((3.0 + x_2) > ((5.0 + x_3) > (8.0 + x_4)? (5.0 + x_3) : (8.0 + x_4))? (3.0 + x_2) : ((5.0 + x_3) > (8.0 + x_4)? (5.0 + x_3) : (8.0 + x_4))) > (((16.0 + x_8) > (17.0 + x_13)? (16.0 + x_8) : (17.0 + x_13)) > ((9.0 + x_16) > (14.0 + x_17)? (9.0 + x_16) : (14.0 + x_17))? ((16.0 + x_8) > (17.0 + x_13)? (16.0 + x_8) : (17.0 + x_13)) : ((9.0 + x_16) > (14.0 + x_17)? (9.0 + x_16) : (14.0 + x_17)))? ((3.0 + x_2) > ((5.0 + x_3) > (8.0 + x_4)? (5.0 + x_3) : (8.0 + x_4))? (3.0 + x_2) : ((5.0 + x_3) > (8.0 + x_4)? (5.0 + x_3) : (8.0 + x_4))) : (((16.0 + x_8) > (17.0 + x_13)? (16.0 + x_8) : (17.0 + x_13)) > ((9.0 + x_16) > (14.0 + x_17)? (9.0 + x_16) : (14.0 + x_17))? ((16.0 + x_8) > (17.0 + x_13)? (16.0 + x_8) : (17.0 + x_13)) : ((9.0 + x_16) > (14.0 + x_17)? (9.0 + x_16) : (14.0 + x_17)))) : (((11.0 + x_18) > ((17.0 + x_19) > (7.0 + x_20)? (17.0 + x_19) : (7.0 + x_20))? (11.0 + x_18) : ((17.0 + x_19) > (7.0 + x_20)? (17.0 + x_19) : (7.0 + x_20))) > (((13.0 + x_21) > (16.0 + x_22)? (13.0 + x_21) : (16.0 + x_22)) > ((6.0 + x_24) > (11.0 + x_25)? (6.0 + x_24) : (11.0 + x_25))? ((13.0 + x_21) > (16.0 + x_22)? (13.0 + x_21) : (16.0 + x_22)) : ((6.0 + x_24) > (11.0 + x_25)? (6.0 + x_24) : (11.0 + x_25)))? ((11.0 + x_18) > ((17.0 + x_19) > (7.0 + x_20)? (17.0 + x_19) : (7.0 + x_20))? (11.0 + x_18) : ((17.0 + x_19) > (7.0 + x_20)? (17.0 + x_19) : (7.0 + x_20))) : (((13.0 + x_21) > (16.0 + x_22)? (13.0 + x_21) : (16.0 + x_22)) > ((6.0 + x_24) > (11.0 + x_25)? (6.0 + x_24) : (11.0 + x_25))? ((13.0 + x_21) > (16.0 + x_22)? (13.0 + x_21) : (16.0 + x_22)) : ((6.0 + x_24) > (11.0 + x_25)? (6.0 + x_24) : (11.0 + x_25)))));
x_19_ = ((((12.0 + x_0) > ((9.0 + x_5) > (13.0 + x_6)? (9.0 + x_5) : (13.0 + x_6))? (12.0 + x_0) : ((9.0 + x_5) > (13.0 + x_6)? (9.0 + x_5) : (13.0 + x_6))) > (((4.0 + x_7) > (12.0 + x_8)? (4.0 + x_7) : (12.0 + x_8)) > ((19.0 + x_10) > (19.0 + x_12)? (19.0 + x_10) : (19.0 + x_12))? ((4.0 + x_7) > (12.0 + x_8)? (4.0 + x_7) : (12.0 + x_8)) : ((19.0 + x_10) > (19.0 + x_12)? (19.0 + x_10) : (19.0 + x_12)))? ((12.0 + x_0) > ((9.0 + x_5) > (13.0 + x_6)? (9.0 + x_5) : (13.0 + x_6))? (12.0 + x_0) : ((9.0 + x_5) > (13.0 + x_6)? (9.0 + x_5) : (13.0 + x_6))) : (((4.0 + x_7) > (12.0 + x_8)? (4.0 + x_7) : (12.0 + x_8)) > ((19.0 + x_10) > (19.0 + x_12)? (19.0 + x_10) : (19.0 + x_12))? ((4.0 + x_7) > (12.0 + x_8)? (4.0 + x_7) : (12.0 + x_8)) : ((19.0 + x_10) > (19.0 + x_12)? (19.0 + x_10) : (19.0 + x_12)))) > (((20.0 + x_13) > ((19.0 + x_14) > (7.0 + x_16)? (19.0 + x_14) : (7.0 + x_16))? (20.0 + x_13) : ((19.0 + x_14) > (7.0 + x_16)? (19.0 + x_14) : (7.0 + x_16))) > (((4.0 + x_17) > (18.0 + x_18)? (4.0 + x_17) : (18.0 + x_18)) > ((8.0 + x_20) > (15.0 + x_26)? (8.0 + x_20) : (15.0 + x_26))? ((4.0 + x_17) > (18.0 + x_18)? (4.0 + x_17) : (18.0 + x_18)) : ((8.0 + x_20) > (15.0 + x_26)? (8.0 + x_20) : (15.0 + x_26)))? ((20.0 + x_13) > ((19.0 + x_14) > (7.0 + x_16)? (19.0 + x_14) : (7.0 + x_16))? (20.0 + x_13) : ((19.0 + x_14) > (7.0 + x_16)? (19.0 + x_14) : (7.0 + x_16))) : (((4.0 + x_17) > (18.0 + x_18)? (4.0 + x_17) : (18.0 + x_18)) > ((8.0 + x_20) > (15.0 + x_26)? (8.0 + x_20) : (15.0 + x_26))? ((4.0 + x_17) > (18.0 + x_18)? (4.0 + x_17) : (18.0 + x_18)) : ((8.0 + x_20) > (15.0 + x_26)? (8.0 + x_20) : (15.0 + x_26))))? (((12.0 + x_0) > ((9.0 + x_5) > (13.0 + x_6)? (9.0 + x_5) : (13.0 + x_6))? (12.0 + x_0) : ((9.0 + x_5) > (13.0 + x_6)? (9.0 + x_5) : (13.0 + x_6))) > (((4.0 + x_7) > (12.0 + x_8)? (4.0 + x_7) : (12.0 + x_8)) > ((19.0 + x_10) > (19.0 + x_12)? (19.0 + x_10) : (19.0 + x_12))? ((4.0 + x_7) > (12.0 + x_8)? (4.0 + x_7) : (12.0 + x_8)) : ((19.0 + x_10) > (19.0 + x_12)? (19.0 + x_10) : (19.0 + x_12)))? ((12.0 + x_0) > ((9.0 + x_5) > (13.0 + x_6)? (9.0 + x_5) : (13.0 + x_6))? (12.0 + x_0) : ((9.0 + x_5) > (13.0 + x_6)? (9.0 + x_5) : (13.0 + x_6))) : (((4.0 + x_7) > (12.0 + x_8)? (4.0 + x_7) : (12.0 + x_8)) > ((19.0 + x_10) > (19.0 + x_12)? (19.0 + x_10) : (19.0 + x_12))? ((4.0 + x_7) > (12.0 + x_8)? (4.0 + x_7) : (12.0 + x_8)) : ((19.0 + x_10) > (19.0 + x_12)? (19.0 + x_10) : (19.0 + x_12)))) : (((20.0 + x_13) > ((19.0 + x_14) > (7.0 + x_16)? (19.0 + x_14) : (7.0 + x_16))? (20.0 + x_13) : ((19.0 + x_14) > (7.0 + x_16)? (19.0 + x_14) : (7.0 + x_16))) > (((4.0 + x_17) > (18.0 + x_18)? (4.0 + x_17) : (18.0 + x_18)) > ((8.0 + x_20) > (15.0 + x_26)? (8.0 + x_20) : (15.0 + x_26))? ((4.0 + x_17) > (18.0 + x_18)? (4.0 + x_17) : (18.0 + x_18)) : ((8.0 + x_20) > (15.0 + x_26)? (8.0 + x_20) : (15.0 + x_26)))? ((20.0 + x_13) > ((19.0 + x_14) > (7.0 + x_16)? (19.0 + x_14) : (7.0 + x_16))? (20.0 + x_13) : ((19.0 + x_14) > (7.0 + x_16)? (19.0 + x_14) : (7.0 + x_16))) : (((4.0 + x_17) > (18.0 + x_18)? (4.0 + x_17) : (18.0 + x_18)) > ((8.0 + x_20) > (15.0 + x_26)? (8.0 + x_20) : (15.0 + x_26))? ((4.0 + x_17) > (18.0 + x_18)? (4.0 + x_17) : (18.0 + x_18)) : ((8.0 + x_20) > (15.0 + x_26)? (8.0 + x_20) : (15.0 + x_26)))));
x_20_ = ((((19.0 + x_1) > ((5.0 + x_2) > (8.0 + x_4)? (5.0 + x_2) : (8.0 + x_4))? (19.0 + x_1) : ((5.0 + x_2) > (8.0 + x_4)? (5.0 + x_2) : (8.0 + x_4))) > (((17.0 + x_5) > (18.0 + x_6)? (17.0 + x_5) : (18.0 + x_6)) > ((10.0 + x_8) > (4.0 + x_10)? (10.0 + x_8) : (4.0 + x_10))? ((17.0 + x_5) > (18.0 + x_6)? (17.0 + x_5) : (18.0 + x_6)) : ((10.0 + x_8) > (4.0 + x_10)? (10.0 + x_8) : (4.0 + x_10)))? ((19.0 + x_1) > ((5.0 + x_2) > (8.0 + x_4)? (5.0 + x_2) : (8.0 + x_4))? (19.0 + x_1) : ((5.0 + x_2) > (8.0 + x_4)? (5.0 + x_2) : (8.0 + x_4))) : (((17.0 + x_5) > (18.0 + x_6)? (17.0 + x_5) : (18.0 + x_6)) > ((10.0 + x_8) > (4.0 + x_10)? (10.0 + x_8) : (4.0 + x_10))? ((17.0 + x_5) > (18.0 + x_6)? (17.0 + x_5) : (18.0 + x_6)) : ((10.0 + x_8) > (4.0 + x_10)? (10.0 + x_8) : (4.0 + x_10)))) > (((19.0 + x_11) > ((18.0 + x_13) > (17.0 + x_17)? (18.0 + x_13) : (17.0 + x_17))? (19.0 + x_11) : ((18.0 + x_13) > (17.0 + x_17)? (18.0 + x_13) : (17.0 + x_17))) > (((2.0 + x_19) > (9.0 + x_23)? (2.0 + x_19) : (9.0 + x_23)) > ((18.0 + x_26) > (1.0 + x_27)? (18.0 + x_26) : (1.0 + x_27))? ((2.0 + x_19) > (9.0 + x_23)? (2.0 + x_19) : (9.0 + x_23)) : ((18.0 + x_26) > (1.0 + x_27)? (18.0 + x_26) : (1.0 + x_27)))? ((19.0 + x_11) > ((18.0 + x_13) > (17.0 + x_17)? (18.0 + x_13) : (17.0 + x_17))? (19.0 + x_11) : ((18.0 + x_13) > (17.0 + x_17)? (18.0 + x_13) : (17.0 + x_17))) : (((2.0 + x_19) > (9.0 + x_23)? (2.0 + x_19) : (9.0 + x_23)) > ((18.0 + x_26) > (1.0 + x_27)? (18.0 + x_26) : (1.0 + x_27))? ((2.0 + x_19) > (9.0 + x_23)? (2.0 + x_19) : (9.0 + x_23)) : ((18.0 + x_26) > (1.0 + x_27)? (18.0 + x_26) : (1.0 + x_27))))? (((19.0 + x_1) > ((5.0 + x_2) > (8.0 + x_4)? (5.0 + x_2) : (8.0 + x_4))? (19.0 + x_1) : ((5.0 + x_2) > (8.0 + x_4)? (5.0 + x_2) : (8.0 + x_4))) > (((17.0 + x_5) > (18.0 + x_6)? (17.0 + x_5) : (18.0 + x_6)) > ((10.0 + x_8) > (4.0 + x_10)? (10.0 + x_8) : (4.0 + x_10))? ((17.0 + x_5) > (18.0 + x_6)? (17.0 + x_5) : (18.0 + x_6)) : ((10.0 + x_8) > (4.0 + x_10)? (10.0 + x_8) : (4.0 + x_10)))? ((19.0 + x_1) > ((5.0 + x_2) > (8.0 + x_4)? (5.0 + x_2) : (8.0 + x_4))? (19.0 + x_1) : ((5.0 + x_2) > (8.0 + x_4)? (5.0 + x_2) : (8.0 + x_4))) : (((17.0 + x_5) > (18.0 + x_6)? (17.0 + x_5) : (18.0 + x_6)) > ((10.0 + x_8) > (4.0 + x_10)? (10.0 + x_8) : (4.0 + x_10))? ((17.0 + x_5) > (18.0 + x_6)? (17.0 + x_5) : (18.0 + x_6)) : ((10.0 + x_8) > (4.0 + x_10)? (10.0 + x_8) : (4.0 + x_10)))) : (((19.0 + x_11) > ((18.0 + x_13) > (17.0 + x_17)? (18.0 + x_13) : (17.0 + x_17))? (19.0 + x_11) : ((18.0 + x_13) > (17.0 + x_17)? (18.0 + x_13) : (17.0 + x_17))) > (((2.0 + x_19) > (9.0 + x_23)? (2.0 + x_19) : (9.0 + x_23)) > ((18.0 + x_26) > (1.0 + x_27)? (18.0 + x_26) : (1.0 + x_27))? ((2.0 + x_19) > (9.0 + x_23)? (2.0 + x_19) : (9.0 + x_23)) : ((18.0 + x_26) > (1.0 + x_27)? (18.0 + x_26) : (1.0 + x_27)))? ((19.0 + x_11) > ((18.0 + x_13) > (17.0 + x_17)? (18.0 + x_13) : (17.0 + x_17))? (19.0 + x_11) : ((18.0 + x_13) > (17.0 + x_17)? (18.0 + x_13) : (17.0 + x_17))) : (((2.0 + x_19) > (9.0 + x_23)? (2.0 + x_19) : (9.0 + x_23)) > ((18.0 + x_26) > (1.0 + x_27)? (18.0 + x_26) : (1.0 + x_27))? ((2.0 + x_19) > (9.0 + x_23)? (2.0 + x_19) : (9.0 + x_23)) : ((18.0 + x_26) > (1.0 + x_27)? (18.0 + x_26) : (1.0 + x_27)))));
x_21_ = ((((19.0 + x_1) > ((14.0 + x_3) > (7.0 + x_5)? (14.0 + x_3) : (7.0 + x_5))? (19.0 + x_1) : ((14.0 + x_3) > (7.0 + x_5)? (14.0 + x_3) : (7.0 + x_5))) > (((6.0 + x_6) > (17.0 + x_7)? (6.0 + x_6) : (17.0 + x_7)) > ((11.0 + x_10) > (8.0 + x_11)? (11.0 + x_10) : (8.0 + x_11))? ((6.0 + x_6) > (17.0 + x_7)? (6.0 + x_6) : (17.0 + x_7)) : ((11.0 + x_10) > (8.0 + x_11)? (11.0 + x_10) : (8.0 + x_11)))? ((19.0 + x_1) > ((14.0 + x_3) > (7.0 + x_5)? (14.0 + x_3) : (7.0 + x_5))? (19.0 + x_1) : ((14.0 + x_3) > (7.0 + x_5)? (14.0 + x_3) : (7.0 + x_5))) : (((6.0 + x_6) > (17.0 + x_7)? (6.0 + x_6) : (17.0 + x_7)) > ((11.0 + x_10) > (8.0 + x_11)? (11.0 + x_10) : (8.0 + x_11))? ((6.0 + x_6) > (17.0 + x_7)? (6.0 + x_6) : (17.0 + x_7)) : ((11.0 + x_10) > (8.0 + x_11)? (11.0 + x_10) : (8.0 + x_11)))) > (((3.0 + x_12) > ((13.0 + x_14) > (13.0 + x_17)? (13.0 + x_14) : (13.0 + x_17))? (3.0 + x_12) : ((13.0 + x_14) > (13.0 + x_17)? (13.0 + x_14) : (13.0 + x_17))) > (((12.0 + x_18) > (14.0 + x_19)? (12.0 + x_18) : (14.0 + x_19)) > ((17.0 + x_20) > (5.0 + x_21)? (17.0 + x_20) : (5.0 + x_21))? ((12.0 + x_18) > (14.0 + x_19)? (12.0 + x_18) : (14.0 + x_19)) : ((17.0 + x_20) > (5.0 + x_21)? (17.0 + x_20) : (5.0 + x_21)))? ((3.0 + x_12) > ((13.0 + x_14) > (13.0 + x_17)? (13.0 + x_14) : (13.0 + x_17))? (3.0 + x_12) : ((13.0 + x_14) > (13.0 + x_17)? (13.0 + x_14) : (13.0 + x_17))) : (((12.0 + x_18) > (14.0 + x_19)? (12.0 + x_18) : (14.0 + x_19)) > ((17.0 + x_20) > (5.0 + x_21)? (17.0 + x_20) : (5.0 + x_21))? ((12.0 + x_18) > (14.0 + x_19)? (12.0 + x_18) : (14.0 + x_19)) : ((17.0 + x_20) > (5.0 + x_21)? (17.0 + x_20) : (5.0 + x_21))))? (((19.0 + x_1) > ((14.0 + x_3) > (7.0 + x_5)? (14.0 + x_3) : (7.0 + x_5))? (19.0 + x_1) : ((14.0 + x_3) > (7.0 + x_5)? (14.0 + x_3) : (7.0 + x_5))) > (((6.0 + x_6) > (17.0 + x_7)? (6.0 + x_6) : (17.0 + x_7)) > ((11.0 + x_10) > (8.0 + x_11)? (11.0 + x_10) : (8.0 + x_11))? ((6.0 + x_6) > (17.0 + x_7)? (6.0 + x_6) : (17.0 + x_7)) : ((11.0 + x_10) > (8.0 + x_11)? (11.0 + x_10) : (8.0 + x_11)))? ((19.0 + x_1) > ((14.0 + x_3) > (7.0 + x_5)? (14.0 + x_3) : (7.0 + x_5))? (19.0 + x_1) : ((14.0 + x_3) > (7.0 + x_5)? (14.0 + x_3) : (7.0 + x_5))) : (((6.0 + x_6) > (17.0 + x_7)? (6.0 + x_6) : (17.0 + x_7)) > ((11.0 + x_10) > (8.0 + x_11)? (11.0 + x_10) : (8.0 + x_11))? ((6.0 + x_6) > (17.0 + x_7)? (6.0 + x_6) : (17.0 + x_7)) : ((11.0 + x_10) > (8.0 + x_11)? (11.0 + x_10) : (8.0 + x_11)))) : (((3.0 + x_12) > ((13.0 + x_14) > (13.0 + x_17)? (13.0 + x_14) : (13.0 + x_17))? (3.0 + x_12) : ((13.0 + x_14) > (13.0 + x_17)? (13.0 + x_14) : (13.0 + x_17))) > (((12.0 + x_18) > (14.0 + x_19)? (12.0 + x_18) : (14.0 + x_19)) > ((17.0 + x_20) > (5.0 + x_21)? (17.0 + x_20) : (5.0 + x_21))? ((12.0 + x_18) > (14.0 + x_19)? (12.0 + x_18) : (14.0 + x_19)) : ((17.0 + x_20) > (5.0 + x_21)? (17.0 + x_20) : (5.0 + x_21)))? ((3.0 + x_12) > ((13.0 + x_14) > (13.0 + x_17)? (13.0 + x_14) : (13.0 + x_17))? (3.0 + x_12) : ((13.0 + x_14) > (13.0 + x_17)? (13.0 + x_14) : (13.0 + x_17))) : (((12.0 + x_18) > (14.0 + x_19)? (12.0 + x_18) : (14.0 + x_19)) > ((17.0 + x_20) > (5.0 + x_21)? (17.0 + x_20) : (5.0 + x_21))? ((12.0 + x_18) > (14.0 + x_19)? (12.0 + x_18) : (14.0 + x_19)) : ((17.0 + x_20) > (5.0 + x_21)? (17.0 + x_20) : (5.0 + x_21)))));
x_22_ = ((((13.0 + x_0) > ((16.0 + x_2) > (5.0 + x_4)? (16.0 + x_2) : (5.0 + x_4))? (13.0 + x_0) : ((16.0 + x_2) > (5.0 + x_4)? (16.0 + x_2) : (5.0 + x_4))) > (((2.0 + x_5) > (12.0 + x_7)? (2.0 + x_5) : (12.0 + x_7)) > ((10.0 + x_8) > (4.0 + x_9)? (10.0 + x_8) : (4.0 + x_9))? ((2.0 + x_5) > (12.0 + x_7)? (2.0 + x_5) : (12.0 + x_7)) : ((10.0 + x_8) > (4.0 + x_9)? (10.0 + x_8) : (4.0 + x_9)))? ((13.0 + x_0) > ((16.0 + x_2) > (5.0 + x_4)? (16.0 + x_2) : (5.0 + x_4))? (13.0 + x_0) : ((16.0 + x_2) > (5.0 + x_4)? (16.0 + x_2) : (5.0 + x_4))) : (((2.0 + x_5) > (12.0 + x_7)? (2.0 + x_5) : (12.0 + x_7)) > ((10.0 + x_8) > (4.0 + x_9)? (10.0 + x_8) : (4.0 + x_9))? ((2.0 + x_5) > (12.0 + x_7)? (2.0 + x_5) : (12.0 + x_7)) : ((10.0 + x_8) > (4.0 + x_9)? (10.0 + x_8) : (4.0 + x_9)))) > (((12.0 + x_10) > ((19.0 + x_11) > (12.0 + x_13)? (19.0 + x_11) : (12.0 + x_13))? (12.0 + x_10) : ((19.0 + x_11) > (12.0 + x_13)? (19.0 + x_11) : (12.0 + x_13))) > (((16.0 + x_14) > (1.0 + x_16)? (16.0 + x_14) : (1.0 + x_16)) > ((12.0 + x_17) > (16.0 + x_22)? (12.0 + x_17) : (16.0 + x_22))? ((16.0 + x_14) > (1.0 + x_16)? (16.0 + x_14) : (1.0 + x_16)) : ((12.0 + x_17) > (16.0 + x_22)? (12.0 + x_17) : (16.0 + x_22)))? ((12.0 + x_10) > ((19.0 + x_11) > (12.0 + x_13)? (19.0 + x_11) : (12.0 + x_13))? (12.0 + x_10) : ((19.0 + x_11) > (12.0 + x_13)? (19.0 + x_11) : (12.0 + x_13))) : (((16.0 + x_14) > (1.0 + x_16)? (16.0 + x_14) : (1.0 + x_16)) > ((12.0 + x_17) > (16.0 + x_22)? (12.0 + x_17) : (16.0 + x_22))? ((16.0 + x_14) > (1.0 + x_16)? (16.0 + x_14) : (1.0 + x_16)) : ((12.0 + x_17) > (16.0 + x_22)? (12.0 + x_17) : (16.0 + x_22))))? (((13.0 + x_0) > ((16.0 + x_2) > (5.0 + x_4)? (16.0 + x_2) : (5.0 + x_4))? (13.0 + x_0) : ((16.0 + x_2) > (5.0 + x_4)? (16.0 + x_2) : (5.0 + x_4))) > (((2.0 + x_5) > (12.0 + x_7)? (2.0 + x_5) : (12.0 + x_7)) > ((10.0 + x_8) > (4.0 + x_9)? (10.0 + x_8) : (4.0 + x_9))? ((2.0 + x_5) > (12.0 + x_7)? (2.0 + x_5) : (12.0 + x_7)) : ((10.0 + x_8) > (4.0 + x_9)? (10.0 + x_8) : (4.0 + x_9)))? ((13.0 + x_0) > ((16.0 + x_2) > (5.0 + x_4)? (16.0 + x_2) : (5.0 + x_4))? (13.0 + x_0) : ((16.0 + x_2) > (5.0 + x_4)? (16.0 + x_2) : (5.0 + x_4))) : (((2.0 + x_5) > (12.0 + x_7)? (2.0 + x_5) : (12.0 + x_7)) > ((10.0 + x_8) > (4.0 + x_9)? (10.0 + x_8) : (4.0 + x_9))? ((2.0 + x_5) > (12.0 + x_7)? (2.0 + x_5) : (12.0 + x_7)) : ((10.0 + x_8) > (4.0 + x_9)? (10.0 + x_8) : (4.0 + x_9)))) : (((12.0 + x_10) > ((19.0 + x_11) > (12.0 + x_13)? (19.0 + x_11) : (12.0 + x_13))? (12.0 + x_10) : ((19.0 + x_11) > (12.0 + x_13)? (19.0 + x_11) : (12.0 + x_13))) > (((16.0 + x_14) > (1.0 + x_16)? (16.0 + x_14) : (1.0 + x_16)) > ((12.0 + x_17) > (16.0 + x_22)? (12.0 + x_17) : (16.0 + x_22))? ((16.0 + x_14) > (1.0 + x_16)? (16.0 + x_14) : (1.0 + x_16)) : ((12.0 + x_17) > (16.0 + x_22)? (12.0 + x_17) : (16.0 + x_22)))? ((12.0 + x_10) > ((19.0 + x_11) > (12.0 + x_13)? (19.0 + x_11) : (12.0 + x_13))? (12.0 + x_10) : ((19.0 + x_11) > (12.0 + x_13)? (19.0 + x_11) : (12.0 + x_13))) : (((16.0 + x_14) > (1.0 + x_16)? (16.0 + x_14) : (1.0 + x_16)) > ((12.0 + x_17) > (16.0 + x_22)? (12.0 + x_17) : (16.0 + x_22))? ((16.0 + x_14) > (1.0 + x_16)? (16.0 + x_14) : (1.0 + x_16)) : ((12.0 + x_17) > (16.0 + x_22)? (12.0 + x_17) : (16.0 + x_22)))));
x_23_ = ((((5.0 + x_1) > ((12.0 + x_2) > (20.0 + x_3)? (12.0 + x_2) : (20.0 + x_3))? (5.0 + x_1) : ((12.0 + x_2) > (20.0 + x_3)? (12.0 + x_2) : (20.0 + x_3))) > (((8.0 + x_6) > (19.0 + x_7)? (8.0 + x_6) : (19.0 + x_7)) > ((8.0 + x_8) > (6.0 + x_9)? (8.0 + x_8) : (6.0 + x_9))? ((8.0 + x_6) > (19.0 + x_7)? (8.0 + x_6) : (19.0 + x_7)) : ((8.0 + x_8) > (6.0 + x_9)? (8.0 + x_8) : (6.0 + x_9)))? ((5.0 + x_1) > ((12.0 + x_2) > (20.0 + x_3)? (12.0 + x_2) : (20.0 + x_3))? (5.0 + x_1) : ((12.0 + x_2) > (20.0 + x_3)? (12.0 + x_2) : (20.0 + x_3))) : (((8.0 + x_6) > (19.0 + x_7)? (8.0 + x_6) : (19.0 + x_7)) > ((8.0 + x_8) > (6.0 + x_9)? (8.0 + x_8) : (6.0 + x_9))? ((8.0 + x_6) > (19.0 + x_7)? (8.0 + x_6) : (19.0 + x_7)) : ((8.0 + x_8) > (6.0 + x_9)? (8.0 + x_8) : (6.0 + x_9)))) > (((18.0 + x_10) > ((1.0 + x_11) > (4.0 + x_14)? (1.0 + x_11) : (4.0 + x_14))? (18.0 + x_10) : ((1.0 + x_11) > (4.0 + x_14)? (1.0 + x_11) : (4.0 + x_14))) > (((10.0 + x_19) > (10.0 + x_23)? (10.0 + x_19) : (10.0 + x_23)) > ((9.0 + x_26) > (20.0 + x_27)? (9.0 + x_26) : (20.0 + x_27))? ((10.0 + x_19) > (10.0 + x_23)? (10.0 + x_19) : (10.0 + x_23)) : ((9.0 + x_26) > (20.0 + x_27)? (9.0 + x_26) : (20.0 + x_27)))? ((18.0 + x_10) > ((1.0 + x_11) > (4.0 + x_14)? (1.0 + x_11) : (4.0 + x_14))? (18.0 + x_10) : ((1.0 + x_11) > (4.0 + x_14)? (1.0 + x_11) : (4.0 + x_14))) : (((10.0 + x_19) > (10.0 + x_23)? (10.0 + x_19) : (10.0 + x_23)) > ((9.0 + x_26) > (20.0 + x_27)? (9.0 + x_26) : (20.0 + x_27))? ((10.0 + x_19) > (10.0 + x_23)? (10.0 + x_19) : (10.0 + x_23)) : ((9.0 + x_26) > (20.0 + x_27)? (9.0 + x_26) : (20.0 + x_27))))? (((5.0 + x_1) > ((12.0 + x_2) > (20.0 + x_3)? (12.0 + x_2) : (20.0 + x_3))? (5.0 + x_1) : ((12.0 + x_2) > (20.0 + x_3)? (12.0 + x_2) : (20.0 + x_3))) > (((8.0 + x_6) > (19.0 + x_7)? (8.0 + x_6) : (19.0 + x_7)) > ((8.0 + x_8) > (6.0 + x_9)? (8.0 + x_8) : (6.0 + x_9))? ((8.0 + x_6) > (19.0 + x_7)? (8.0 + x_6) : (19.0 + x_7)) : ((8.0 + x_8) > (6.0 + x_9)? (8.0 + x_8) : (6.0 + x_9)))? ((5.0 + x_1) > ((12.0 + x_2) > (20.0 + x_3)? (12.0 + x_2) : (20.0 + x_3))? (5.0 + x_1) : ((12.0 + x_2) > (20.0 + x_3)? (12.0 + x_2) : (20.0 + x_3))) : (((8.0 + x_6) > (19.0 + x_7)? (8.0 + x_6) : (19.0 + x_7)) > ((8.0 + x_8) > (6.0 + x_9)? (8.0 + x_8) : (6.0 + x_9))? ((8.0 + x_6) > (19.0 + x_7)? (8.0 + x_6) : (19.0 + x_7)) : ((8.0 + x_8) > (6.0 + x_9)? (8.0 + x_8) : (6.0 + x_9)))) : (((18.0 + x_10) > ((1.0 + x_11) > (4.0 + x_14)? (1.0 + x_11) : (4.0 + x_14))? (18.0 + x_10) : ((1.0 + x_11) > (4.0 + x_14)? (1.0 + x_11) : (4.0 + x_14))) > (((10.0 + x_19) > (10.0 + x_23)? (10.0 + x_19) : (10.0 + x_23)) > ((9.0 + x_26) > (20.0 + x_27)? (9.0 + x_26) : (20.0 + x_27))? ((10.0 + x_19) > (10.0 + x_23)? (10.0 + x_19) : (10.0 + x_23)) : ((9.0 + x_26) > (20.0 + x_27)? (9.0 + x_26) : (20.0 + x_27)))? ((18.0 + x_10) > ((1.0 + x_11) > (4.0 + x_14)? (1.0 + x_11) : (4.0 + x_14))? (18.0 + x_10) : ((1.0 + x_11) > (4.0 + x_14)? (1.0 + x_11) : (4.0 + x_14))) : (((10.0 + x_19) > (10.0 + x_23)? (10.0 + x_19) : (10.0 + x_23)) > ((9.0 + x_26) > (20.0 + x_27)? (9.0 + x_26) : (20.0 + x_27))? ((10.0 + x_19) > (10.0 + x_23)? (10.0 + x_19) : (10.0 + x_23)) : ((9.0 + x_26) > (20.0 + x_27)? (9.0 + x_26) : (20.0 + x_27)))));
x_24_ = ((((4.0 + x_0) > ((12.0 + x_2) > (8.0 + x_5)? (12.0 + x_2) : (8.0 + x_5))? (4.0 + x_0) : ((12.0 + x_2) > (8.0 + x_5)? (12.0 + x_2) : (8.0 + x_5))) > (((19.0 + x_6) > (15.0 + x_9)? (19.0 + x_6) : (15.0 + x_9)) > ((2.0 + x_10) > (12.0 + x_11)? (2.0 + x_10) : (12.0 + x_11))? ((19.0 + x_6) > (15.0 + x_9)? (19.0 + x_6) : (15.0 + x_9)) : ((2.0 + x_10) > (12.0 + x_11)? (2.0 + x_10) : (12.0 + x_11)))? ((4.0 + x_0) > ((12.0 + x_2) > (8.0 + x_5)? (12.0 + x_2) : (8.0 + x_5))? (4.0 + x_0) : ((12.0 + x_2) > (8.0 + x_5)? (12.0 + x_2) : (8.0 + x_5))) : (((19.0 + x_6) > (15.0 + x_9)? (19.0 + x_6) : (15.0 + x_9)) > ((2.0 + x_10) > (12.0 + x_11)? (2.0 + x_10) : (12.0 + x_11))? ((19.0 + x_6) > (15.0 + x_9)? (19.0 + x_6) : (15.0 + x_9)) : ((2.0 + x_10) > (12.0 + x_11)? (2.0 + x_10) : (12.0 + x_11)))) > (((20.0 + x_12) > ((5.0 + x_19) > (17.0 + x_20)? (5.0 + x_19) : (17.0 + x_20))? (20.0 + x_12) : ((5.0 + x_19) > (17.0 + x_20)? (5.0 + x_19) : (17.0 + x_20))) > (((11.0 + x_21) > (7.0 + x_22)? (11.0 + x_21) : (7.0 + x_22)) > ((3.0 + x_25) > (2.0 + x_27)? (3.0 + x_25) : (2.0 + x_27))? ((11.0 + x_21) > (7.0 + x_22)? (11.0 + x_21) : (7.0 + x_22)) : ((3.0 + x_25) > (2.0 + x_27)? (3.0 + x_25) : (2.0 + x_27)))? ((20.0 + x_12) > ((5.0 + x_19) > (17.0 + x_20)? (5.0 + x_19) : (17.0 + x_20))? (20.0 + x_12) : ((5.0 + x_19) > (17.0 + x_20)? (5.0 + x_19) : (17.0 + x_20))) : (((11.0 + x_21) > (7.0 + x_22)? (11.0 + x_21) : (7.0 + x_22)) > ((3.0 + x_25) > (2.0 + x_27)? (3.0 + x_25) : (2.0 + x_27))? ((11.0 + x_21) > (7.0 + x_22)? (11.0 + x_21) : (7.0 + x_22)) : ((3.0 + x_25) > (2.0 + x_27)? (3.0 + x_25) : (2.0 + x_27))))? (((4.0 + x_0) > ((12.0 + x_2) > (8.0 + x_5)? (12.0 + x_2) : (8.0 + x_5))? (4.0 + x_0) : ((12.0 + x_2) > (8.0 + x_5)? (12.0 + x_2) : (8.0 + x_5))) > (((19.0 + x_6) > (15.0 + x_9)? (19.0 + x_6) : (15.0 + x_9)) > ((2.0 + x_10) > (12.0 + x_11)? (2.0 + x_10) : (12.0 + x_11))? ((19.0 + x_6) > (15.0 + x_9)? (19.0 + x_6) : (15.0 + x_9)) : ((2.0 + x_10) > (12.0 + x_11)? (2.0 + x_10) : (12.0 + x_11)))? ((4.0 + x_0) > ((12.0 + x_2) > (8.0 + x_5)? (12.0 + x_2) : (8.0 + x_5))? (4.0 + x_0) : ((12.0 + x_2) > (8.0 + x_5)? (12.0 + x_2) : (8.0 + x_5))) : (((19.0 + x_6) > (15.0 + x_9)? (19.0 + x_6) : (15.0 + x_9)) > ((2.0 + x_10) > (12.0 + x_11)? (2.0 + x_10) : (12.0 + x_11))? ((19.0 + x_6) > (15.0 + x_9)? (19.0 + x_6) : (15.0 + x_9)) : ((2.0 + x_10) > (12.0 + x_11)? (2.0 + x_10) : (12.0 + x_11)))) : (((20.0 + x_12) > ((5.0 + x_19) > (17.0 + x_20)? (5.0 + x_19) : (17.0 + x_20))? (20.0 + x_12) : ((5.0 + x_19) > (17.0 + x_20)? (5.0 + x_19) : (17.0 + x_20))) > (((11.0 + x_21) > (7.0 + x_22)? (11.0 + x_21) : (7.0 + x_22)) > ((3.0 + x_25) > (2.0 + x_27)? (3.0 + x_25) : (2.0 + x_27))? ((11.0 + x_21) > (7.0 + x_22)? (11.0 + x_21) : (7.0 + x_22)) : ((3.0 + x_25) > (2.0 + x_27)? (3.0 + x_25) : (2.0 + x_27)))? ((20.0 + x_12) > ((5.0 + x_19) > (17.0 + x_20)? (5.0 + x_19) : (17.0 + x_20))? (20.0 + x_12) : ((5.0 + x_19) > (17.0 + x_20)? (5.0 + x_19) : (17.0 + x_20))) : (((11.0 + x_21) > (7.0 + x_22)? (11.0 + x_21) : (7.0 + x_22)) > ((3.0 + x_25) > (2.0 + x_27)? (3.0 + x_25) : (2.0 + x_27))? ((11.0 + x_21) > (7.0 + x_22)? (11.0 + x_21) : (7.0 + x_22)) : ((3.0 + x_25) > (2.0 + x_27)? (3.0 + x_25) : (2.0 + x_27)))));
x_25_ = ((((9.0 + x_4) > ((7.0 + x_7) > (14.0 + x_8)? (7.0 + x_7) : (14.0 + x_8))? (9.0 + x_4) : ((7.0 + x_7) > (14.0 + x_8)? (7.0 + x_7) : (14.0 + x_8))) > (((7.0 + x_12) > (8.0 + x_13)? (7.0 + x_12) : (8.0 + x_13)) > ((4.0 + x_15) > (9.0 + x_16)? (4.0 + x_15) : (9.0 + x_16))? ((7.0 + x_12) > (8.0 + x_13)? (7.0 + x_12) : (8.0 + x_13)) : ((4.0 + x_15) > (9.0 + x_16)? (4.0 + x_15) : (9.0 + x_16)))? ((9.0 + x_4) > ((7.0 + x_7) > (14.0 + x_8)? (7.0 + x_7) : (14.0 + x_8))? (9.0 + x_4) : ((7.0 + x_7) > (14.0 + x_8)? (7.0 + x_7) : (14.0 + x_8))) : (((7.0 + x_12) > (8.0 + x_13)? (7.0 + x_12) : (8.0 + x_13)) > ((4.0 + x_15) > (9.0 + x_16)? (4.0 + x_15) : (9.0 + x_16))? ((7.0 + x_12) > (8.0 + x_13)? (7.0 + x_12) : (8.0 + x_13)) : ((4.0 + x_15) > (9.0 + x_16)? (4.0 + x_15) : (9.0 + x_16)))) > (((1.0 + x_18) > ((18.0 + x_19) > (3.0 + x_21)? (18.0 + x_19) : (3.0 + x_21))? (1.0 + x_18) : ((18.0 + x_19) > (3.0 + x_21)? (18.0 + x_19) : (3.0 + x_21))) > (((7.0 + x_22) > (4.0 + x_23)? (7.0 + x_22) : (4.0 + x_23)) > ((17.0 + x_25) > (3.0 + x_27)? (17.0 + x_25) : (3.0 + x_27))? ((7.0 + x_22) > (4.0 + x_23)? (7.0 + x_22) : (4.0 + x_23)) : ((17.0 + x_25) > (3.0 + x_27)? (17.0 + x_25) : (3.0 + x_27)))? ((1.0 + x_18) > ((18.0 + x_19) > (3.0 + x_21)? (18.0 + x_19) : (3.0 + x_21))? (1.0 + x_18) : ((18.0 + x_19) > (3.0 + x_21)? (18.0 + x_19) : (3.0 + x_21))) : (((7.0 + x_22) > (4.0 + x_23)? (7.0 + x_22) : (4.0 + x_23)) > ((17.0 + x_25) > (3.0 + x_27)? (17.0 + x_25) : (3.0 + x_27))? ((7.0 + x_22) > (4.0 + x_23)? (7.0 + x_22) : (4.0 + x_23)) : ((17.0 + x_25) > (3.0 + x_27)? (17.0 + x_25) : (3.0 + x_27))))? (((9.0 + x_4) > ((7.0 + x_7) > (14.0 + x_8)? (7.0 + x_7) : (14.0 + x_8))? (9.0 + x_4) : ((7.0 + x_7) > (14.0 + x_8)? (7.0 + x_7) : (14.0 + x_8))) > (((7.0 + x_12) > (8.0 + x_13)? (7.0 + x_12) : (8.0 + x_13)) > ((4.0 + x_15) > (9.0 + x_16)? (4.0 + x_15) : (9.0 + x_16))? ((7.0 + x_12) > (8.0 + x_13)? (7.0 + x_12) : (8.0 + x_13)) : ((4.0 + x_15) > (9.0 + x_16)? (4.0 + x_15) : (9.0 + x_16)))? ((9.0 + x_4) > ((7.0 + x_7) > (14.0 + x_8)? (7.0 + x_7) : (14.0 + x_8))? (9.0 + x_4) : ((7.0 + x_7) > (14.0 + x_8)? (7.0 + x_7) : (14.0 + x_8))) : (((7.0 + x_12) > (8.0 + x_13)? (7.0 + x_12) : (8.0 + x_13)) > ((4.0 + x_15) > (9.0 + x_16)? (4.0 + x_15) : (9.0 + x_16))? ((7.0 + x_12) > (8.0 + x_13)? (7.0 + x_12) : (8.0 + x_13)) : ((4.0 + x_15) > (9.0 + x_16)? (4.0 + x_15) : (9.0 + x_16)))) : (((1.0 + x_18) > ((18.0 + x_19) > (3.0 + x_21)? (18.0 + x_19) : (3.0 + x_21))? (1.0 + x_18) : ((18.0 + x_19) > (3.0 + x_21)? (18.0 + x_19) : (3.0 + x_21))) > (((7.0 + x_22) > (4.0 + x_23)? (7.0 + x_22) : (4.0 + x_23)) > ((17.0 + x_25) > (3.0 + x_27)? (17.0 + x_25) : (3.0 + x_27))? ((7.0 + x_22) > (4.0 + x_23)? (7.0 + x_22) : (4.0 + x_23)) : ((17.0 + x_25) > (3.0 + x_27)? (17.0 + x_25) : (3.0 + x_27)))? ((1.0 + x_18) > ((18.0 + x_19) > (3.0 + x_21)? (18.0 + x_19) : (3.0 + x_21))? (1.0 + x_18) : ((18.0 + x_19) > (3.0 + x_21)? (18.0 + x_19) : (3.0 + x_21))) : (((7.0 + x_22) > (4.0 + x_23)? (7.0 + x_22) : (4.0 + x_23)) > ((17.0 + x_25) > (3.0 + x_27)? (17.0 + x_25) : (3.0 + x_27))? ((7.0 + x_22) > (4.0 + x_23)? (7.0 + x_22) : (4.0 + x_23)) : ((17.0 + x_25) > (3.0 + x_27)? (17.0 + x_25) : (3.0 + x_27)))));
x_26_ = ((((3.0 + x_0) > ((19.0 + x_1) > (12.0 + x_3)? (19.0 + x_1) : (12.0 + x_3))? (3.0 + x_0) : ((19.0 + x_1) > (12.0 + x_3)? (19.0 + x_1) : (12.0 + x_3))) > (((5.0 + x_4) > (8.0 + x_5)? (5.0 + x_4) : (8.0 + x_5)) > ((9.0 + x_6) > (6.0 + x_7)? (9.0 + x_6) : (6.0 + x_7))? ((5.0 + x_4) > (8.0 + x_5)? (5.0 + x_4) : (8.0 + x_5)) : ((9.0 + x_6) > (6.0 + x_7)? (9.0 + x_6) : (6.0 + x_7)))? ((3.0 + x_0) > ((19.0 + x_1) > (12.0 + x_3)? (19.0 + x_1) : (12.0 + x_3))? (3.0 + x_0) : ((19.0 + x_1) > (12.0 + x_3)? (19.0 + x_1) : (12.0 + x_3))) : (((5.0 + x_4) > (8.0 + x_5)? (5.0 + x_4) : (8.0 + x_5)) > ((9.0 + x_6) > (6.0 + x_7)? (9.0 + x_6) : (6.0 + x_7))? ((5.0 + x_4) > (8.0 + x_5)? (5.0 + x_4) : (8.0 + x_5)) : ((9.0 + x_6) > (6.0 + x_7)? (9.0 + x_6) : (6.0 + x_7)))) > (((3.0 + x_9) > ((1.0 + x_14) > (13.0 + x_18)? (1.0 + x_14) : (13.0 + x_18))? (3.0 + x_9) : ((1.0 + x_14) > (13.0 + x_18)? (1.0 + x_14) : (13.0 + x_18))) > (((14.0 + x_20) > (19.0 + x_22)? (14.0 + x_20) : (19.0 + x_22)) > ((3.0 + x_24) > (6.0 + x_26)? (3.0 + x_24) : (6.0 + x_26))? ((14.0 + x_20) > (19.0 + x_22)? (14.0 + x_20) : (19.0 + x_22)) : ((3.0 + x_24) > (6.0 + x_26)? (3.0 + x_24) : (6.0 + x_26)))? ((3.0 + x_9) > ((1.0 + x_14) > (13.0 + x_18)? (1.0 + x_14) : (13.0 + x_18))? (3.0 + x_9) : ((1.0 + x_14) > (13.0 + x_18)? (1.0 + x_14) : (13.0 + x_18))) : (((14.0 + x_20) > (19.0 + x_22)? (14.0 + x_20) : (19.0 + x_22)) > ((3.0 + x_24) > (6.0 + x_26)? (3.0 + x_24) : (6.0 + x_26))? ((14.0 + x_20) > (19.0 + x_22)? (14.0 + x_20) : (19.0 + x_22)) : ((3.0 + x_24) > (6.0 + x_26)? (3.0 + x_24) : (6.0 + x_26))))? (((3.0 + x_0) > ((19.0 + x_1) > (12.0 + x_3)? (19.0 + x_1) : (12.0 + x_3))? (3.0 + x_0) : ((19.0 + x_1) > (12.0 + x_3)? (19.0 + x_1) : (12.0 + x_3))) > (((5.0 + x_4) > (8.0 + x_5)? (5.0 + x_4) : (8.0 + x_5)) > ((9.0 + x_6) > (6.0 + x_7)? (9.0 + x_6) : (6.0 + x_7))? ((5.0 + x_4) > (8.0 + x_5)? (5.0 + x_4) : (8.0 + x_5)) : ((9.0 + x_6) > (6.0 + x_7)? (9.0 + x_6) : (6.0 + x_7)))? ((3.0 + x_0) > ((19.0 + x_1) > (12.0 + x_3)? (19.0 + x_1) : (12.0 + x_3))? (3.0 + x_0) : ((19.0 + x_1) > (12.0 + x_3)? (19.0 + x_1) : (12.0 + x_3))) : (((5.0 + x_4) > (8.0 + x_5)? (5.0 + x_4) : (8.0 + x_5)) > ((9.0 + x_6) > (6.0 + x_7)? (9.0 + x_6) : (6.0 + x_7))? ((5.0 + x_4) > (8.0 + x_5)? (5.0 + x_4) : (8.0 + x_5)) : ((9.0 + x_6) > (6.0 + x_7)? (9.0 + x_6) : (6.0 + x_7)))) : (((3.0 + x_9) > ((1.0 + x_14) > (13.0 + x_18)? (1.0 + x_14) : (13.0 + x_18))? (3.0 + x_9) : ((1.0 + x_14) > (13.0 + x_18)? (1.0 + x_14) : (13.0 + x_18))) > (((14.0 + x_20) > (19.0 + x_22)? (14.0 + x_20) : (19.0 + x_22)) > ((3.0 + x_24) > (6.0 + x_26)? (3.0 + x_24) : (6.0 + x_26))? ((14.0 + x_20) > (19.0 + x_22)? (14.0 + x_20) : (19.0 + x_22)) : ((3.0 + x_24) > (6.0 + x_26)? (3.0 + x_24) : (6.0 + x_26)))? ((3.0 + x_9) > ((1.0 + x_14) > (13.0 + x_18)? (1.0 + x_14) : (13.0 + x_18))? (3.0 + x_9) : ((1.0 + x_14) > (13.0 + x_18)? (1.0 + x_14) : (13.0 + x_18))) : (((14.0 + x_20) > (19.0 + x_22)? (14.0 + x_20) : (19.0 + x_22)) > ((3.0 + x_24) > (6.0 + x_26)? (3.0 + x_24) : (6.0 + x_26))? ((14.0 + x_20) > (19.0 + x_22)? (14.0 + x_20) : (19.0 + x_22)) : ((3.0 + x_24) > (6.0 + x_26)? (3.0 + x_24) : (6.0 + x_26)))));
x_27_ = ((((14.0 + x_0) > ((12.0 + x_1) > (17.0 + x_3)? (12.0 + x_1) : (17.0 + x_3))? (14.0 + x_0) : ((12.0 + x_1) > (17.0 + x_3)? (12.0 + x_1) : (17.0 + x_3))) > (((11.0 + x_4) > (11.0 + x_5)? (11.0 + x_4) : (11.0 + x_5)) > ((18.0 + x_6) > (18.0 + x_13)? (18.0 + x_6) : (18.0 + x_13))? ((11.0 + x_4) > (11.0 + x_5)? (11.0 + x_4) : (11.0 + x_5)) : ((18.0 + x_6) > (18.0 + x_13)? (18.0 + x_6) : (18.0 + x_13)))? ((14.0 + x_0) > ((12.0 + x_1) > (17.0 + x_3)? (12.0 + x_1) : (17.0 + x_3))? (14.0 + x_0) : ((12.0 + x_1) > (17.0 + x_3)? (12.0 + x_1) : (17.0 + x_3))) : (((11.0 + x_4) > (11.0 + x_5)? (11.0 + x_4) : (11.0 + x_5)) > ((18.0 + x_6) > (18.0 + x_13)? (18.0 + x_6) : (18.0 + x_13))? ((11.0 + x_4) > (11.0 + x_5)? (11.0 + x_4) : (11.0 + x_5)) : ((18.0 + x_6) > (18.0 + x_13)? (18.0 + x_6) : (18.0 + x_13)))) > (((9.0 + x_14) > ((11.0 + x_15) > (3.0 + x_19)? (11.0 + x_15) : (3.0 + x_19))? (9.0 + x_14) : ((11.0 + x_15) > (3.0 + x_19)? (11.0 + x_15) : (3.0 + x_19))) > (((16.0 + x_20) > (20.0 + x_22)? (16.0 + x_20) : (20.0 + x_22)) > ((13.0 + x_23) > (18.0 + x_24)? (13.0 + x_23) : (18.0 + x_24))? ((16.0 + x_20) > (20.0 + x_22)? (16.0 + x_20) : (20.0 + x_22)) : ((13.0 + x_23) > (18.0 + x_24)? (13.0 + x_23) : (18.0 + x_24)))? ((9.0 + x_14) > ((11.0 + x_15) > (3.0 + x_19)? (11.0 + x_15) : (3.0 + x_19))? (9.0 + x_14) : ((11.0 + x_15) > (3.0 + x_19)? (11.0 + x_15) : (3.0 + x_19))) : (((16.0 + x_20) > (20.0 + x_22)? (16.0 + x_20) : (20.0 + x_22)) > ((13.0 + x_23) > (18.0 + x_24)? (13.0 + x_23) : (18.0 + x_24))? ((16.0 + x_20) > (20.0 + x_22)? (16.0 + x_20) : (20.0 + x_22)) : ((13.0 + x_23) > (18.0 + x_24)? (13.0 + x_23) : (18.0 + x_24))))? (((14.0 + x_0) > ((12.0 + x_1) > (17.0 + x_3)? (12.0 + x_1) : (17.0 + x_3))? (14.0 + x_0) : ((12.0 + x_1) > (17.0 + x_3)? (12.0 + x_1) : (17.0 + x_3))) > (((11.0 + x_4) > (11.0 + x_5)? (11.0 + x_4) : (11.0 + x_5)) > ((18.0 + x_6) > (18.0 + x_13)? (18.0 + x_6) : (18.0 + x_13))? ((11.0 + x_4) > (11.0 + x_5)? (11.0 + x_4) : (11.0 + x_5)) : ((18.0 + x_6) > (18.0 + x_13)? (18.0 + x_6) : (18.0 + x_13)))? ((14.0 + x_0) > ((12.0 + x_1) > (17.0 + x_3)? (12.0 + x_1) : (17.0 + x_3))? (14.0 + x_0) : ((12.0 + x_1) > (17.0 + x_3)? (12.0 + x_1) : (17.0 + x_3))) : (((11.0 + x_4) > (11.0 + x_5)? (11.0 + x_4) : (11.0 + x_5)) > ((18.0 + x_6) > (18.0 + x_13)? (18.0 + x_6) : (18.0 + x_13))? ((11.0 + x_4) > (11.0 + x_5)? (11.0 + x_4) : (11.0 + x_5)) : ((18.0 + x_6) > (18.0 + x_13)? (18.0 + x_6) : (18.0 + x_13)))) : (((9.0 + x_14) > ((11.0 + x_15) > (3.0 + x_19)? (11.0 + x_15) : (3.0 + x_19))? (9.0 + x_14) : ((11.0 + x_15) > (3.0 + x_19)? (11.0 + x_15) : (3.0 + x_19))) > (((16.0 + x_20) > (20.0 + x_22)? (16.0 + x_20) : (20.0 + x_22)) > ((13.0 + x_23) > (18.0 + x_24)? (13.0 + x_23) : (18.0 + x_24))? ((16.0 + x_20) > (20.0 + x_22)? (16.0 + x_20) : (20.0 + x_22)) : ((13.0 + x_23) > (18.0 + x_24)? (13.0 + x_23) : (18.0 + x_24)))? ((9.0 + x_14) > ((11.0 + x_15) > (3.0 + x_19)? (11.0 + x_15) : (3.0 + x_19))? (9.0 + x_14) : ((11.0 + x_15) > (3.0 + x_19)? (11.0 + x_15) : (3.0 + x_19))) : (((16.0 + x_20) > (20.0 + x_22)? (16.0 + x_20) : (20.0 + x_22)) > ((13.0 + x_23) > (18.0 + x_24)? (13.0 + x_23) : (18.0 + x_24))? ((16.0 + x_20) > (20.0 + x_22)? (16.0 + x_20) : (20.0 + x_22)) : ((13.0 + x_23) > (18.0 + x_24)? (13.0 + x_23) : (18.0 + x_24)))));
x_0 = x_0_;
x_1 = x_1_;
x_2 = x_2_;
x_3 = x_3_;
x_4 = x_4_;
x_5 = x_5_;
x_6 = x_6_;
x_7 = x_7_;
x_8 = x_8_;
x_9 = x_9_;
x_10 = x_10_;
x_11 = x_11_;
x_12 = x_12_;
x_13 = x_13_;
x_14 = x_14_;
x_15 = x_15_;
x_16 = x_16_;
x_17 = x_17_;
x_18 = x_18_;
x_19 = x_19_;
x_20 = x_20_;
x_21 = x_21_;
x_22 = x_22_;
x_23 = x_23_;
x_24 = x_24_;
x_25 = x_25_;
x_26 = x_26_;
x_27 = x_27_;
}
return 0;
}
|
the_stack_data/41222.c | #ifdef COMPILE_FOR_TEST
#include <assert.h>
#define assume(cond) assert(cond)
#endif
void main(int argc, char* argv[]) {
int x_0_0;//sh_buf.outcnt
int x_0_1;//sh_buf.outcnt
int x_0_2;//sh_buf.outcnt
int x_0_3;//sh_buf.outcnt
int x_0_4;//sh_buf.outcnt
int x_1_0;//sh_buf.outbuf[0]
int x_1_1;//sh_buf.outbuf[0]
int x_2_0;//sh_buf.outbuf[1]
int x_2_1;//sh_buf.outbuf[1]
int x_3_0;//sh_buf.outbuf[2]
int x_3_1;//sh_buf.outbuf[2]
int x_4_0;//sh_buf.outbuf[3]
int x_4_1;//sh_buf.outbuf[3]
int x_5_0;//sh_buf.outbuf[4]
int x_5_1;//sh_buf.outbuf[4]
int x_6_0;//sh_buf.outbuf[5]
int x_7_0;//sh_buf.outbuf[6]
int x_8_0;//sh_buf.outbuf[7]
int x_9_0;//sh_buf.outbuf[8]
int x_10_0;//sh_buf.outbuf[9]
int x_11_0;//LOG_BUFSIZE
int x_11_1;//LOG_BUFSIZE
int x_12_0;//CREST_scheduler::lock_0
int x_12_1;//CREST_scheduler::lock_0
int x_12_2;//CREST_scheduler::lock_0
int x_13_0;//t3 T0
int x_14_0;//t2 T0
int x_15_0;//arg T0
int x_16_0;//functioncall::param T0
int x_16_1;//functioncall::param T0
int x_17_0;//buffered T0
int x_18_0;//functioncall::param T0
int x_18_1;//functioncall::param T0
int x_19_0;//functioncall::param T0
int x_19_1;//functioncall::param T0
int x_20_0;//functioncall::param T0
int x_20_1;//functioncall::param T0
int x_20_2;//functioncall::param T0
int x_21_0;//functioncall::param T0
int x_21_1;//functioncall::param T0
int x_22_0;//direction T0
int x_23_0;//functioncall::param T0
int x_23_1;//functioncall::param T0
int x_24_0;//functioncall::param T0
int x_24_1;//functioncall::param T0
int x_25_0;//functioncall::param T0
int x_25_1;//functioncall::param T0
int x_26_0;//functioncall::param T0
int x_26_1;//functioncall::param T0
int x_27_0;//functioncall::param T0
int x_27_1;//functioncall::param T0
int x_28_0;//functioncall::param T0
int x_28_1;//functioncall::param T0
int x_29_0;//functioncall::param T0
int x_29_1;//functioncall::param T0
int x_30_0;//functioncall::param T0
int x_30_1;//functioncall::param T0
int x_31_0;//functioncall::param T0
int x_31_1;//functioncall::param T0
int x_32_0;//functioncall::param T0
int x_32_1;//functioncall::param T0
int x_33_0;//functioncall::param T0
int x_33_1;//functioncall::param T0
int x_34_0;//functioncall::param T0
int x_34_1;//functioncall::param T0
int x_35_0;//functioncall::param T1
int x_35_1;//functioncall::param T1
int x_36_0;//functioncall::param T1
int x_36_1;//functioncall::param T1
int x_37_0;//i T1
int x_37_1;//i T1
int x_37_2;//i T1
int x_38_0;//rv T1
int x_39_0;//functioncall::param T1
int x_39_1;//functioncall::param T1
int x_40_0;//functioncall::param T1
int x_40_1;//functioncall::param T1
int x_41_0;//functioncall::param T1
int x_41_1;//functioncall::param T1
int x_42_0;//functioncall::param T1
int x_42_1;//functioncall::param T1
int x_43_0;//functioncall::param T2
int x_43_1;//functioncall::param T2
int x_44_0;//functioncall::param T2
int x_44_1;//functioncall::param T2
int x_45_0;//i T2
int x_45_1;//i T2
int x_45_2;//i T2
int x_45_3;//i T2
int x_46_0;//rv T2
int x_47_0;//rv T2
int x_48_0;//blocksize T2
int x_48_1;//blocksize T2
int x_49_0;//functioncall::param T2
int x_49_1;//functioncall::param T2
int x_49_2;//functioncall::param T2
int x_50_0;//apr_thread_mutex_lock::rv T2
int x_50_1;//apr_thread_mutex_lock::rv T2
int x_51_0;//functioncall::param T2
int x_51_1;//functioncall::param T2
int x_52_0;//status T2
int x_52_1;//status T2
int x_53_0;//functioncall::param T2
int x_53_1;//functioncall::param T2
int x_54_0;//functioncall::param T2
int x_54_1;//functioncall::param T2
int x_55_0;//functioncall::param T2
int x_55_1;//functioncall::param T2
int x_56_0;//functioncall::param T2
int x_56_1;//functioncall::param T2
int x_57_0;//functioncall::param T2
int x_57_1;//functioncall::param T2
int x_57_2;//functioncall::param T2
int x_58_0;//functioncall::param T2
int x_58_1;//functioncall::param T2
int x_59_0;//functioncall::param T2
int x_59_1;//functioncall::param T2
int x_60_0;//functioncall::param T2
int x_60_1;//functioncall::param T2
T_0_0_0: x_0_0 = 0;
T_0_1_0: x_1_0 = 0;
T_0_2_0: x_2_0 = 0;
T_0_3_0: x_3_0 = 0;
T_0_4_0: x_4_0 = 0;
T_0_5_0: x_5_0 = 0;
T_0_6_0: x_6_0 = 0;
T_0_7_0: x_7_0 = 0;
T_0_8_0: x_8_0 = 0;
T_0_9_0: x_9_0 = 0;
T_0_10_0: x_10_0 = 0;
T_0_11_0: x_11_0 = 0;
T_0_12_0: x_13_0 = 2427134336;
T_0_13_0: x_14_0 = 833049184;
T_0_14_0: x_15_0 = 0;
T_0_15_0: x_16_0 = 1494032285;
T_0_16_0: x_16_1 = -1;
T_0_17_0: x_17_0 = 0;
T_0_18_0: x_18_0 = 1419106459;
T_0_19_0: x_18_1 = x_17_0;
T_0_20_0: x_19_0 = 1353287441;
T_0_21_0: x_19_1 = 97;
T_0_22_0: x_20_0 = 1534714866;
T_0_23_0: x_20_1 = 0;
T_0_24_0: x_21_0 = 1250848636;
T_0_25_0: x_21_1 = 0;
T_0_26_0: x_22_0 = 833044544;
T_0_27_0: x_23_0 = 966669761;
T_0_28_0: x_23_1 = x_22_0;
T_0_29_0: x_24_0 = 1286842270;
T_0_30_0: x_24_1 = 0;
T_0_31_0: x_12_0 = -1;
T_0_32_0: x_0_1 = 5;
T_0_33_0: x_1_1 = 72;
T_0_34_0: x_2_1 = 69;
T_0_35_0: x_3_1 = 76;
T_0_36_0: x_4_1 = 76;
T_0_37_0: x_5_1 = 79;
T_0_38_0: x_25_0 = 1191878858;
T_0_39_0: x_25_1 = 83;
T_0_40_0: x_26_0 = 1504092618;
T_0_41_0: x_26_1 = 1;
T_0_42_0: x_27_0 = 821434667;
T_0_43_0: x_27_1 = 1;
T_0_44_0: x_28_0 = 1465846309;
T_0_45_0: x_28_1 = 1;
T_0_46_0: x_29_0 = 1197119751;
T_0_47_0: x_29_1 = 82;
T_0_48_0: x_30_0 = 1398996073;
T_0_49_0: x_30_1 = 90;
T_0_50_0: x_31_0 = 835235919;
T_0_51_0: x_31_1 = 1;
T_0_52_0: x_32_0 = 809276136;
T_0_53_0: x_32_1 = 1;
T_0_54_0: x_33_0 = 2040811693;
T_0_55_0: x_33_1 = 2;
T_0_56_0: x_34_0 = 58344360;
T_0_57_0: x_34_1 = 2;
T_0_58_0: x_11_1 = 6;
T_1_59_1: x_35_0 = 98447486;
T_1_60_1: x_35_1 = x_27_1;
T_1_61_1: x_36_0 = 1710657734;
T_1_62_1: x_36_1 = x_28_1;
T_1_63_1: x_37_0 = 0;
T_1_64_1: x_38_0 = -881606143;
T_1_65_1: if (x_36_1 < x_11_1) x_39_0 = 1347741596;
T_1_66_1: if (x_36_1 < x_11_1) x_39_1 = 47297061472000;
T_2_67_2: x_43_0 = 1233717912;
T_2_68_2: x_43_1 = x_33_1;
T_2_69_2: x_44_0 = 1723464973;
T_2_70_2: x_44_1 = x_34_1;
T_2_71_2: x_45_0 = 0;
T_2_72_2: x_46_0 = -883707391;
T_2_73_2: if (x_0_1 + x_44_1 > x_11_1 && x_0_1 != 0) x_47_0 = 840112048;
T_2_74_2: if (x_0_1 + x_44_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0) x_48_0 = 11012;
T_2_75_2: if (x_0_1 + x_44_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0) x_49_0 = 1257120816;
T_2_76_2: if (x_0_1 + x_44_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0) x_49_1 = x_0_1;
T_2_77_2: if (x_0_1 + x_44_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_0_1 == x_49_1) x_50_0 = 0;
T_2_78_2: if (x_0_1 + x_44_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_0_1 == x_49_1 && 0 == x_12_0 + 1) x_12_1 = 2;
T_2_79_2: if (x_0_1 + x_44_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_0_1 == x_49_1 && 2 == x_12_1) x_50_1 = 0;
T_2_80_2: if (x_0_1 + x_44_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 2 == x_12_1) x_51_0 = 1544996614;
T_2_81_2: if (x_0_1 + x_44_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 2 == x_12_1) x_51_1 = 0;
T_2_82_2: if (x_0_1 + x_44_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 0 == x_51_1 && 2 == x_12_1) x_48_1 = x_49_1;
T_2_83_2: if (x_0_1 + x_44_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 0 == x_51_1 && 2 == x_12_1) x_20_2 = x_20_1 + x_48_1;
T_2_84_2: if (x_0_1 + x_44_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && 0 == x_51_1 && 2 == x_12_1) x_49_2 = -1*x_48_1 + x_49_1;
T_2_85_2: if (x_0_1 + x_44_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_49_2 <= 0 && 2 == x_12_1) x_52_0 = 0;
T_2_86_2: if (x_0_1 + x_44_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_49_2 <= 0 && 2 == x_12_1) x_12_2 = -1;
T_2_87_2: if (x_36_1 < x_11_1) x_40_0 = 1321549204;
T_2_88_2: if (x_36_1 < x_11_1) x_40_1 = x_0_1 + x_36_1;
T_2_89_2: if (x_36_1 < x_11_1) x_37_1 = 0;
T_1_90_1: if (x_36_1 < x_11_1 && x_37_1 < x_35_1) x_41_0 = 1650337014;
T_1_91_1: if (x_36_1 < x_11_1 && x_37_1 < x_35_1) x_41_1 = 47297061472000;
T_1_92_1: if (x_36_1 < x_11_1) x_37_2 = 1 + x_37_1;
T_1_93_1: if (x_36_1 < x_11_1) x_42_0 = 2004152588;
T_1_94_1: if (x_36_1 < x_11_1) x_42_1 = 47297061472000;
T_1_95_1: if (x_0_1 + x_44_1 > x_11_1 && x_0_1 != 0 && x_18_1 != 0 && x_49_2 <= 0) x_52_1 = 0;
T_1_96_1: if (x_0_1 + x_44_1 > x_11_1 && x_0_1 != 0) x_53_0 = 1268716281;
T_1_97_1: if (x_0_1 + x_44_1 > x_11_1 && x_0_1 != 0) x_53_1 = x_51_1;
T_2_98_2: if (x_0_1 + x_44_1 > x_11_1 && x_0_1 != 0) x_54_0 = 1163029914;
T_2_99_2: if (x_0_1 + x_44_1 > x_11_1 && x_0_1 != 0) x_54_1 = x_53_1;
T_2_100_2: if (x_0_1 + x_44_1 > x_11_1 && x_0_1 != 0) x_0_2 = 0;
T_2_101_2: if (x_44_1 < x_11_1) x_55_0 = 901241801;
T_2_102_2: if (x_44_1 < x_11_1) x_55_1 = 47297063573248;
T_2_103_2: if (x_36_1 < x_11_1) x_0_3 = x_0_1 + x_36_1;
T_2_104_2: if (x_44_1 < x_11_1) x_56_0 = 1139146781;
T_2_105_2: if (x_44_1 < x_11_1) x_56_1 = x_0_2 + x_44_1;
T_1_106_1: if (x_44_1 < x_11_1) x_45_1 = 0;
T_2_107_2: if (x_44_1 < x_11_1 && x_45_1 < x_43_1) x_57_0 = 509578551;
T_2_108_2: if (x_44_1 < x_11_1 && x_45_1 < x_43_1) x_57_1 = 47297063573248;
T_2_109_2: if (x_44_1 < x_11_1) x_45_2 = 1 + x_45_1;
T_2_110_2: if (x_44_1 < x_11_1 && x_45_2 < x_43_1) x_57_2 = 47297063573248;
T_2_111_2: if (x_44_1 < x_11_1) x_45_3 = 1 + x_45_2;
T_2_112_2: if (x_44_1 < x_11_1) x_58_0 = 172864612;
T_2_113_2: if (x_44_1 < x_11_1) x_58_1 = 47297063573248;
T_2_114_2: if (x_44_1 < x_11_1) x_0_4 = x_0_3 + x_44_1;
T_2_115_2: if (x_44_1 < x_11_1) x_59_0 = 344950574;
T_2_116_2: if (x_44_1 < x_11_1) x_59_1 = 47297063573248;
T_2_117_2: if (x_44_1 < x_11_1) x_60_0 = 2044293417;
T_2_118_2: if (x_44_1 < x_11_1) x_60_1 = 47297063573248;
T_2_119_2: if (x_44_1 < x_11_1) assert(x_0_4 == x_56_1);
}
|
the_stack_data/231391887.c | /*
* Copyright 2000-2016 The OpenSSL Project Authors. All Rights Reserved.
*
* Licensed under the Apache License 2.0 (the "License"). You may not use
* this file except in compliance with the License. You can obtain a copy
* in the file LICENSE in the source distribution or at
* https://www.openssl.org/source/license.html
*/
#include <stdio.h>
#include <stdlib.h>
#include <openssl/pem.h>
#include <openssl/err.h>
#include <openssl/pkcs12.h>
/* Simple PKCS#12 file creator */
int main(int argc, char **argv)
{
FILE *fp;
EVP_PKEY *pkey;
X509 *cert;
PKCS12 *p12;
if (argc != 5) {
fprintf(stderr, "Usage: pkwrite infile password name p12file\n");
exit(1);
}
OpenSSL_add_all_algorithms();
ERR_load_crypto_strings();
if ((fp = fopen(argv[1], "r")) == NULL) {
fprintf(stderr, "Error opening file %s\n", argv[1]);
exit(1);
}
cert = VR_PEM_read_X509(fp, NULL, NULL, NULL);
rewind(fp);
pkey = VR_PEM_read_PrivateKey(fp, NULL, NULL, NULL);
fclose(fp);
p12 = VR_PKCS12_create(argv[2], argv[3], pkey, cert, NULL, 0, 0, 0, 0, 0);
if (!p12) {
fprintf(stderr, "Error creating PKCS#12 structure\n");
VR_ERR_print_errors_fp(stderr);
exit(1);
}
if ((fp = fopen(argv[4], "wb")) == NULL) {
fprintf(stderr, "Error opening file %s\n", argv[1]);
VR_ERR_print_errors_fp(stderr);
exit(1);
}
VR_i2d_PKCS12_fp(fp, p12);
VR_PKCS12_free(p12);
fclose(fp);
return 0;
}
|
the_stack_data/86022.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define WIDTH 24
#define PREC 16
int DYS_DumpBuf(char *tb, int sz)
{
int i;
for(i=0; i<sz; i++)fputc(tb[i]+'0', stdout);
// for(i=0; i<sz; i++)printf("%d ", tb[i]);
fputc('\n', stdout);
}
int DYS_InvertBuf(char *tb, int sz)
{
char *t;
t=tb+(sz-1);
while(t>=tb)*t--=9-(*t);
return(0);
}
int DYS_NegBuf(char *tb, int sz)
{
char *t;
int i;
t=tb+(sz-1); i=1;
while(t>=tb)
{
i+=9-(*t);
*t--=(i%10); i/=10;
}
return(i);
}
int DYS_Shl10Buf(char *tb, int sz, int sh)
{
char *s, *t, *se;
s=tb+sh; t=tb; se=tb+sz;
while(s<se)*t++=*s++;
while(t<se)*t++=0;
return(0);
}
int DYS_Shr10Buf(char *tb, int sz, int sh)
{
char *s, *t;
s=tb+(sz-1)-sh; t=tb+(sz-1);
while(s>=tb)*t--=*s--;
while(t>=tb)*t--=(s[1]>=5)?9:0;
return(0);
}
int DYS_Shl2Buf1(char *tb, int sz)
{
char *t;
int i;
t=tb+sz-1; i=0;
while(t>=tb)
{
i+=(*t)*2;
*t--=(i%10); i/=10;
}
return(0);
}
int DYS_Shr2Buf1(char *tb, int sz)
{
char *t, *te;
int i, j;
t=tb; te=tb+sz; i=(tb[0]>=5)?9:0;
while(t<te)
{
j=i&1;
i=(*t);
j=(i/2)+(j*5);
*t--=j;
}
return(0);
}
void DYS_Shl2Buf(char *tb, int sz, int sh)
{
int i;
for(i=0; i<sh; i++)DYS_Shl2Buf1(tb, sz);
}
void DYS_Shr2Buf(char *tb, int sz, int sh)
{
int i;
for(i=0; i<sh; i++)DYS_Shr2Buf1(tb, sz);
}
int DYS_AddBufInt(char *tb, int sz, int v)
{
char *t;
int i;
t=tb+(sz-1);
i=v;
while(i && (t>=tb))
{
i+=*t;
*t--=(i%10); i/=10;
}
return(i);
}
int DYS_AddBuf(char *sa, int sza, char *sb, int szb)
{
char *s, *t;
int i, j;
s=sb+(szb-1);
t=sa+(sza-1);
i=0;
while((s>=sb) && (t>=sa))
{
i+=(*t)+(*s);
*t=(i%10); i/=10;
s--; t--;
}
if(t<sa)return(-1);
j=(sb[0]>=5)?9:0;
while(i && (t>=sa))
{
i+=(*t)+j;
*t=(i%10); i/=10;
t--;
}
return(i);
}
int DYS_SubBuf(char *sa, int sza, char *sb, int szb)
{
char *s, *t;
int i, j;
s=sb+(szb-1);
t=sa+(sza-1);
i=1;
while((s>=sb) && (t>=sa))
{
i+=(*t)+(9-(*s));
*t=(i%10); i/=10;
s--; t--;
}
if(t<sa)return(-1);
j=(sb[0]>=5)?9:0;
while(i && (t>=sa))
{
i+=(*t)+(9-j);
*t=(i%10); i/=10;
t--;
}
return(i);
}
int DYS_AddBufScaleInt(char *sa, int sza, char *sb, int szb, int sc)
{
char *s, *t;
int i;
s=sb+(szb-1);
t=sa+(sza-1);
i=0;
while((s>=sb) && (t>=sa))
{
i+=(*t)+((*s)*sc);
*t=(i%10); i/=10;
s--; t--;
}
if(t<sa)return(-1);
while(i && (t>=sa))
{
i+=(*t);
*t=(i%10); i/=10;
t--;
}
return(i);
}
int DYS_CmpBuf(char *sa, int sza, char *sb, int szb)
{
int pa, pb;
int i, j, k;
if((sa[0]>=5) && (sb[0]<5))return(-1);
if((sa[0]<5) && (sb[0]>=5))return(1);
i=(sza>szb)?sza:szb;
pa=sza-i;
pb=szb-i;
while(pa<sza)
{
i=(pa>=0)?sa[pa]:((sa[0]>=5)?9:0);
j=(pb>=0)?sb[pb]:((sb[0]>=5)?9:0);
if(i!=j)break;
pa++; pb++;
}
if(pa>=sza)return(0);
if(i<j)return(-1);
if(i>j)return(1);
return(0);
}
int DYS_CopyStrBuf(char *tb, int sz, char *sa)
{
char *s, *t;
int i, j, pt;
if((sa[0]=='0') && (sa[1]=='x'))
{
for(i=0; i<sz; i++)tb[i]=0;
s=sa+2;
while(*s)
{
i=0;
if((*s>='0') && (*s<='9'))i=*s-'0';
if((*s>='A') && (*s<='F'))i=*s-'A'+10;
if((*s>='a') && (*s<='f'))i=*s-'a'+10;
s++;
DYS_Shl2Buf(tb, sz, 4);
DYS_AddBufInt(tb, sz, i);
}
return(0);
}
s=sa+strlen(sa)-1;
t=tb+(sz-1);
i=0; j=0; pt=0;
while((s>=sa) && (t>=tb))
{
if(*s=='-') break;
if(*s=='.') { s--; pt=j; continue; }
*t--=(*s--)-'0'; j++;
}
while(t>=tb)*t--=0;
if(*s=='-')DYS_NegBuf(tb, sz);
return(pt);
}
int DYS_CopyBufStr(char *tb, char *sa, int sz, int pt)
{
char *s, *t, *s1, *se, *sp;
int i;
// printf("TS0 %d %d\n", sz, p);
t=tb;
if(sa[0]>=5)
{
DYS_NegBuf(sa, sz);
*t++='-';
}
if(pt>PREC)
{
i=pt-PREC;
sz-=i;
pt-=i;
}
s=sa; se=sa+sz; sp=sa+sz-pt;
while((!(*s)) && (s<sp))s++;
// printf("TS1 %d\n", p);
if(s>=sp)*t++='0';
while(s<sp)*t++=(*s++)+'0';
if(s<se)
{
*t++='.';
while(s<se)
{
*t++=(*s++)+'0';
s1=s; while(!(*s1) && (s1<se))s1++;
if(s1>=se)break;
}
}
*t++=0;
// DYS_DumpBuf(sa, sz);
// printf("TS %s %d\n", tb, p);
return(0);
}
char *dysShl(char *s, int v)
{
char ta[WIDTH], tb[WIDTH];
int i, pa, pb;
pa=DYS_CopyStrBuf(ta, WIDTH, s);
DYS_Shl2Buf(ta, WIDTH, v);
DYS_CopyBufStr(tb, ta, WIDTH, pa);
return(strdup(tb));
}
char *dysShr(char *s, int v)
{
char ta[WIDTH], tb[WIDTH];
int i, pa, pb;
pa=DYS_CopyStrBuf(ta, WIDTH, s);
DYS_Shr2Buf(ta, WIDTH, v);
DYS_CopyBufStr(tb, ta, WIDTH, pa);
return(strdup(tb));
}
char *dysShl10(char *s, int v)
{
char ta[WIDTH], tb[WIDTH];
int i, pa, pb;
pa=DYS_CopyStrBuf(ta, WIDTH, s);
if(v>pa) { DYS_Shl10Buf(ta, WIDTH, v-pa); pa=0; }
else pa-=v;
DYS_CopyBufStr(tb, ta, WIDTH, pa);
return(strdup(tb));
}
char *dysShr10(char *s, int v)
{
char ta[WIDTH], tb[WIDTH];
int i, pa, pb;
pa=DYS_CopyStrBuf(ta, WIDTH, s);
DYS_Shr10Buf(ta, WIDTH, v);
DYS_CopyBufStr(tb, ta, WIDTH, pa);
return(strdup(tb));
}
char *dysShr10F(char *s, int v)
{
char ta[WIDTH], tb[WIDTH];
int i, pa, pb;
pa=DYS_CopyStrBuf(ta, WIDTH, s);
pa+=v;
DYS_CopyBufStr(tb, ta, WIDTH, pa);
return(strdup(tb));
}
int dysCmp(char *s0, char *s1)
{
char ta[WIDTH], tb[WIDTH];
int i, pa, pb;
pa=DYS_CopyStrBuf(ta, WIDTH, s0);
pb=DYS_CopyStrBuf(tb, WIDTH, s1);
if(pa || pb)
{
i=pa>pb?pa:pb;
DYS_Shl10Buf(ta, WIDTH, i-pa);
DYS_Shl10Buf(tb, WIDTH, i-pb);
pa=i;
}
i=DYS_CmpBuf(ta, WIDTH, tb, WIDTH);
return(i);
}
char *dysAdd(char *s0, char *s1)
{
char ta[WIDTH], tb[WIDTH];
int i, pa, pb;
pa=DYS_CopyStrBuf(ta, WIDTH, s0);
pb=DYS_CopyStrBuf(tb, WIDTH, s1);
// DYS_DumpBuf(ta, WIDTH);
// DYS_DumpBuf(tb, WIDTH);
if(pa || pb)
{
i=pa>pb?pa:pb;
DYS_Shl10Buf(ta, WIDTH, i-pa);
DYS_Shl10Buf(tb, WIDTH, i-pb);
pa=i;
}
// DYS_DumpBuf(ta, WIDTH);
// DYS_DumpBuf(tb, WIDTH);
DYS_AddBuf(ta, WIDTH, tb, WIDTH);
// DYS_DumpBuf(ta, WIDTH);
DYS_CopyBufStr(tb, ta, WIDTH, pa);
return(strdup(tb));
}
char *dysSub(char *s0, char *s1)
{
char ta[WIDTH], tb[WIDTH];
int i, pa, pb;
pa=DYS_CopyStrBuf(ta, WIDTH, s0);
pb=DYS_CopyStrBuf(tb, WIDTH, s1);
DYS_NegBuf(tb, WIDTH);
if(pa || pb)
{
i=pa>pb?pa:pb;
DYS_Shl10Buf(ta, WIDTH, i-pa);
DYS_Shl10Buf(tb, WIDTH, i-pb);
pa=i;
}
// DYS_DumpBuf(ta, WIDTH);
// DYS_DumpBuf(tb, WIDTH);
DYS_AddBuf(ta, WIDTH, tb, WIDTH);
// DYS_DumpBuf(ta, WIDTH);
DYS_CopyBufStr(tb, ta, WIDTH, pa);
return(strdup(tb));
}
char *dysMul(char *s0, char *s1)
{
char ta[WIDTH], tb[WIDTH], tc[WIDTH];
int i, j, pa, pb, pc;
pa=DYS_CopyStrBuf(ta, WIDTH, s0);
pb=DYS_CopyStrBuf(tb, WIDTH, s1);
pc=pa+pb;
for(i=0; i<WIDTH; i++)tc[i]=0;
for(i=0; i<WIDTH; i++)
{
DYS_AddBufScaleInt(tc, WIDTH-i, ta, WIDTH, tb[WIDTH-1-i]);
}
DYS_CopyBufStr(ta, tc, WIDTH, pc);
return(strdup(ta));
}
char *dysDiv(char *s0, char *s1)
{
char ta[WIDTH*3], tb[WIDTH*3], tc[WIDTH*2];
int pa, pb, pc;
int i, j, k, sg;
for(i=0; i<(3*WIDTH); i++)ta[i]=0;
for(i=0; i<(3*WIDTH); i++)tb[i]=0;
for(i=0; i<(2*WIDTH); i++)tc[i]=0;
pa=DYS_CopyStrBuf(ta+WIDTH, WIDTH, s0);
pb=DYS_CopyStrBuf(tb, WIDTH, s1);
pc=pa+pb;
sg=0;
if(ta[WIDTH]>=5) { DYS_NegBuf(ta+WIDTH, WIDTH); sg=!sg; }
if(tb[0]>=5) { DYS_NegBuf(tb, WIDTH); sg=!sg; }
DYS_Shr10Buf(ta, WIDTH*3, pa);
DYS_Shr10Buf(tb, WIDTH*3, pb);
// DYS_DumpBuf(ta, WIDTH*3);
// DYS_DumpBuf(tb, WIDTH*3);
for(i=0; i<=WIDTH*2; i++)
{
j=10;
while(DYS_CmpBuf(ta, WIDTH*3, tb, WIDTH*3-i)>=0)
{
// printf("A ");
// DYS_DumpBuf(ta, WIDTH*3);
// printf("B "); k=i; while(k--)fputc(' ', stdout);
// DYS_DumpBuf(tb, WIDTH*3-i);
DYS_SubBuf(ta, WIDTH*3, tb, WIDTH*3-i);
DYS_AddBufInt(tc, i, 1);
if(!(j--))break;
}
}
// DYS_DumpBuf(ta, WIDTH*3);
// DYS_DumpBuf(tb, WIDTH*3);
// DYS_DumpBuf(tc, WIDTH*2);
if(sg)DYS_NegBuf(tc, WIDTH*2);
DYS_CopyBufStr(tb, tc, WIDTH*2, WIDTH);
return(strdup(tb));
}
int main()
{
char *s0, *s1, *s2;
int i, j, k;
s0="1234.5";
s1="-4321.0";
s2=dysAdd(s0, s1);
printf("%s %s %s\n", s0, s1, s2);
// s0="1234.5";
// s1="-4321.0";
s2=dysSub(s0, s1);
printf("%s %s %s\n", s0, s1, s2);
s0="12345678";
s1="-87654321";
s2=dysMul(s0, s1);
printf("%s %s %s\n", s0, s1, s2);
i=dysCmp(s0, s1);
j=dysCmp(s1, s0);
k=0;
printf("%s %s %d %d %d\n", s0, s1, i, j, k);
s2=dysDiv(s0, s1);
printf("%s %s %s\n", s0, s1, s2);
s2=dysDiv(s0, "0x100");
printf("%s %s %s\n", s0, s1, s2);
}
|
the_stack_data/29860.c | /*Exercise 3 - Repetition
Write a C program to calculate the sum of the numbers from 1 to n.
Where n is a keyboard input.
e.g.
n -> 100
sum = 1+2+3+....+ 99+100 = 5050
n -> 1-
sum = 1+2+3+...+10 = 55 */
#include <stdio.h>
int main() {
int n,i,sum=0;
printf("Input a number :");
scanf("%d",&n);
for(i=0;i<=n;i++){
sum=sum+i;
}
printf("sum of the numbers from 1 to %d : %d",n,sum);
return 0;
}
|
the_stack_data/64837.c |
unsigned short gx_cursor18x18[18] = {
0b000000000000000000,
0b000000000000000000,
0b001000000000000000,
0b001100000000000000,
0b001110000000000000,
0b001111000000000000,
0b001101100000000000,
0b001100110000000000,
0b001100011000000000,
0b001100001100000000,
0b001100000110000000,
0b001100000011000000,
0b001111000111100000,
0b000001101100000000,
0b000000110110000000,
0b000000011100000000,
0b000000000000000000,
0b000000000000000000
};
|
the_stack_data/48575517.c | // same result with if04 except for the info on k, why??
//Want to analyse the transformer/precondition
// for a if in lhs and rhs and deref lhs and rhs without a temp
// without any points-to information : lost every information
// with effect_with_points_to info : lost the value of i and j
// with effect_with_points_to and points-to info : (i, j) and (l1, l2) have the same info
#include<stdlib.h>
int main()
{
int i, j, k, l1, l2, m, n, *p, *q;
i=0; l1=i;
j=1; l2=j;
m=10;
n =11;
if (rand()) {
if (rand()) {
q = &m;
k = m;
} else {
q = &n;
k = n;
}
p = &i;
l1 = k;
l1 = l1;
} else {
if (rand()) {
q = &m;
k = m;
} else {
q = &n;
k = n;
}
p = &j;
l2 = k;
l2 = l2;
}
//We lost the info on k why? 10<=k<=11
*p = *q;
return 0;
}
|
the_stack_data/90765614.c | #include <ncurses.h>
int main(int argc, char *argv[])
{
initscr();
start_color();
init_pair(1, COLOR_CYAN, COLOR_BLACK);
printw("A Big string which i didn't care to type fully ");
mvchgat(0, 0, -1, A_BLINK, 1, NULL);
refresh();
getch();
endwin();
return 0;
}
|
the_stack_data/1233632.c | #include <stdlib.h>
#include <string.h>
static int mode = 3;
static void *zalloc(size_t x) {
void *p = malloc(x);
memset(p, 0, x);
return p;
}
static void *foo(size_t x) {
(void) x;
static int bar = 0xfeed;
return &bar;
}
static void *foo2(size_t x) {
(void) x;
static int bar = 0xbee;
return &bar;
}
int main(void) {
void *(*f)(size_t);
if (mode == 0)
f = malloc;
else if (mode == 1)
f = zalloc;
else if (mode == 2)
f = foo;
else
f = foo2;
int *p = f(sizeof(int));
if (mode == 1) {
test_assert(*p == 0);
} else if (mode == 2) {
test_assert(*p == 0xfeed);
} else if (mode > 2) {
test_assert(*p == 0xbee);
}
if (mode <= 1)
free(p);
return 0;
}
|
the_stack_data/168891937.c |
#include <stdio.h>
#include <stdlib.h>
float MO(float arr[] , int A , int B);
int main(){
int i ,min ,max;
float vathm[50]={};
printf("Type 10 grades of students. (Grades 0 to 10)\n");
for(i=0;i<50;i++){
printf("%d. ",i+1);
scanf("%f",&vathm[i]);
if(vathm[i]<0||10<vathm[i]){
printf("Grade must be from 0 to 10\n");
i--;
}
}
printf("Type a minimum and maximum grade to find the average.(Lowest for min 0 , highest for max 10)\n");
do{
printf("MINIMUM -> ");
scanf("%d",&min);
printf("MAXIMUM -> ");
scanf("%d",&max);
}while((min>max || min<0 || 10<min || max<0 || 10<max) && printf("Values must be 0<=MIN<=MAX<=10.\n"));
printf("The average grade in the interval [%d,%d] is : %.1f",min,max,MO(vathm,min,max));
}
float MO(float arr[] , int A , int B){
int i , cnt=0;
float sum=0;
for(i=0;i<50;i++){
if(A<=arr[i] && arr[i]<=B){ //An to arr[i] einai anamesa sto A kai B.
cnt++;
sum+=arr[i];
}
}
return sum/cnt;
}
|
the_stack_data/123082.c | // RUN: %check --prefix=no-flags %s -x cpp-output -Wimplicit
// RUN: %check --prefix=wnosysh %s -x cpp-output -Wimplicit -Wno-system-headers
// RUN: %check --prefix=wsysh %s -x cpp-output -Wimplicit -Wsystem-headers
// flag "3" means system header:
# 7 "stdio.h" 1 3
// ^ the above 7 is volatile to change
f(); // CHECK-no-flags: !/warning/
// CHECK-wnosysh: ^ !/warning/
// CHECK-wsysh: ^^ /warning/
# 2 "src.c" 1
int main(void)
{
return 0;
}
|
the_stack_data/455059.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct{
char studentId[10];
char name[10];
int grade;
char major[50];
} Student;
int main(void){
Student *s = malloc(sizeof(Student));
strcpy(s->studentId, "20101111");
strcpy(s->name, "lowgiant");
s->grade = 4;
strcpy(s->major, "컴퓨터 과학과");
printf("학번: %s\n", s->studentId);
printf("이름: %s\n", s->name);
printf("학년: %d\n", s->grade);
printf("전공: %s\n", s->major);
return 0;
} |
the_stack_data/51699983.c | /* 29nov17abu
* (c) Software Lab. Alexander Burger
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef unsigned long word;
typedef unsigned char byte;
#undef bool
typedef enum {NO,YES} bool;
#define txt(n) (n << 1| 1)
#define box(n) (n << 2| 2)
#define Nil (1 << 2)
#define T (5 << 2)
#define Quote (7 << 2)
static int Bits, Chr, RomIx, RamIx;
static char **Rom, **Ram;
static char Token[1024];
static int read0(bool);
static char Delim[] = " \t\n\r\"'(),[]`~{}";
typedef struct symbol {
char *nm;
int val;
struct symbol *less, *more;
} symbol;
static symbol *Intern, *Transient;
static byte Ascii6[] = {
0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 4, 6,
27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 8, 51, 10, 53,
55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85,
87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117,
119, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40,
42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 121, 123, 125, 127, 0
};
static void giveup(char *msg) {
fprintf(stderr, "gen3m: %s\n", msg);
exit(1);
}
static void noReadMacros(void) {
giveup("Can't support read-macros");
}
static void eofErr(void) {
giveup("EOF Overrun");
}
static void addList(int *ix, char ***list, char *fmt, long x) {
char buf[40];
*list = realloc(*list, (*ix + 1) * sizeof(char*));
if (x)
sprintf(buf, fmt, x);
(*list)[(*ix)++] = strdup(x? buf : fmt);
}
static void mkSym(int *ix, char ***list, char *mem, char *name, char *value) {
bool bin;
int i, c, d;
word w;
bin = NO;
i = (w = Ascii6[*name++ & 127]) & 1? 7 : 6;
while (*name) {
d = (c = Ascii6[*name++ & 127]) & 1? 7 : 6;
if (i != Bits)
w |= (word)c << i;
if (i + d > Bits) {
if (bin)
addList(&RomIx, &Rom, "(Rom+%d)", RomIx + 2);
else {
addList(ix, list, "(Rom+%d)", RomIx + (ix == &RomIx? 3 : 1));
addList(ix, list, value, 0);
bin = YES;
}
addList(&RomIx, &Rom, "0x%lx", w);
w = c >> Bits - i;
i -= Bits;
}
i += d;
}
if (bin) {
if (i <= (Bits-2))
addList(&RomIx, &Rom, "0x%lx", box(w));
else {
addList(&RomIx, &Rom, "(Rom+%d)", RomIx + 2);
addList(&RomIx, &Rom, "0x%lx", w);
addList(&RomIx, &Rom, "2", 0);
}
}
else if (i > Bits-1) {
addList(ix, list, "(Rom+%d)", RomIx + (ix == &RomIx? 3 : 1));
addList(ix, list, value, 0);
addList(&RomIx, &Rom, "0x%lx", w);
addList(&RomIx, &Rom, "2", 0);
}
else {
addList(ix, list, "0x%lx", txt(w));
addList(ix, list, value, 0);
}
}
static void print(char buf[], int x) {
if (x & 2)
sprintf(buf, "%d", x);
else if ((x >>= 2) > 0)
sprintf(buf, "(Rom+%d)", x);
else
sprintf(buf, "(Ram+%d)", -x);
}
static int cons(int x, int y) {
int i, ix = RomIx;
char car[40], cdr[40];
print(car, x);
print(cdr, y);
for (i = 0; i < RomIx; i += 2)
if (strcmp(car, Rom[i]) == 0 && strcmp(cdr, Rom[i+1]) == 0)
return i << 2;
addList(&RomIx, &Rom, car, 0);
addList(&RomIx, &Rom, cdr, 0);
return ix << 2;
}
static int romSym(char *name, char *value) {
int ix = RomIx;
mkSym(&RomIx, &Rom, "(Rom+%d)", name, value);
return ix + 1 << 2;
}
static int ramSym(char *name, char *value) {
int ix = RamIx;
mkSym(&RamIx, &Ram, "(Ram+%d)", name, value);
return -(ix + 1) << 2;
}
static void insert(symbol **tree, char *name, int value) {
symbol *p, **t;
p = malloc(sizeof(symbol));
p->nm = strdup(name);
p->val = value;
p->less = p->more = NULL;
for (t = tree; *t; t = strcmp(name, (*t)->nm) >= 0? &(*t)->more : &(*t)->less);
*t = p;
}
static int lookup(symbol **tree, char *name) {
symbol *p;
int n;
for (p = *tree; p; p = n > 0? p->more : p->less)
if ((n = strcmp(name, p->nm)) == 0)
return p->val;
return 0;
}
static int skip(void) {
for (;;) {
if (Chr < 0)
return Chr;
while (Chr <= ' ') {
Chr = getchar();
if (Chr < 0)
return Chr;
}
if (Chr != '#')
return Chr;
Chr = getchar();
if (Chr != '{') {
while (Chr != '\n') {
if (Chr < 0)
return Chr;
Chr = getchar();
}
}
else {
for (;;) {
Chr = getchar();
if (Chr < 0)
return Chr;
if (Chr == '}' && (Chr = getchar(), Chr == '#'))
break;
}
Chr = getchar();
}
}
}
/* Test for escaped characters */
static bool testEsc(void) {
for (;;) {
if (Chr < 0)
return NO;
if (Chr != '\\')
return YES;
if (Chr = getchar(), Chr != '\n')
return YES;
do
Chr = getchar();
while (Chr == ' ' || Chr == '\t');
}
}
/* Read a list */
static int rdList(int z) {
int x;
if (skip() == ')') {
Chr = getchar();
return Nil;
}
if (Chr == ']')
return Nil;
if (Chr == '~')
noReadMacros();
if (Chr == '.') {
Chr = getchar();
x = skip()==')' || Chr==']'? z : read0(NO);
if (skip() == ')')
Chr = getchar();
else if (Chr != ']')
giveup("Bad dotted pair");
return x;
}
x = read0(NO);
return cons(x, rdList(z ?0 : x));
}
/* Read one expression */
static int read0(bool top) {
int x;
word w;
char *p, buf[40];
if (skip() < 0) {
if (top)
return Nil;
eofErr();
}
if (Chr == '(') {
Chr = getchar();
x = rdList(0);
if (top && Chr == ']')
Chr = getchar();
return x;
}
if (Chr == '[') {
Chr = getchar();
x = rdList(0);
if (Chr != ']')
giveup("Super parentheses mismatch");
Chr = getchar();
return x;
}
if (Chr == '\'') {
Chr = getchar();
return cons(Quote, read0(top));
}
if (Chr == '`')
noReadMacros();
if (Chr == '"') {
Chr = getchar();
if (Chr == '"') {
Chr = getchar();
return Nil;
}
for (p = Token;;) {
if (!testEsc())
eofErr();
*p++ = Chr;
if (p == Token+1024)
giveup("Token too long");
if ((Chr = getchar()) == '"') {
Chr = getchar();
break;
}
}
*p = '\0';
if (x = lookup(&Transient, Token))
return x;
print(buf, -(RamIx + 1) << 2);
insert(&Transient, Token, x = ramSym(Token, buf));
return x;
}
if (strchr(Delim, Chr))
giveup("Bad input");
if (Chr == '\\')
Chr = getchar();
for (p = Token;;) {
*p++ = Chr;
if (p == Token+1024)
giveup("Token too long");
Chr = getchar();
if (strchr(Delim, Chr))
break;
if (Chr == '\\')
Chr = getchar();
}
*p = '\0';
w = strtol(Token, &p, 10);
if (p != Token && *p == '\0')
return box(w);
if (x = lookup(&Intern, Token))
return x;
insert(&Intern, Token, x = ramSym(Token, "(Rom+1)"));
return x;
}
int main(int ac, char *av[]) {
int x, ix;
FILE *fp;
char *p, buf[40];
if ((ac -= 2) <= 0)
giveup("No input files");
if ((Bits = atoi(*++av)) == 0)
Bits = (int)sizeof(char*) * 8;
if ((fp = fopen("sym.d", "w")) == NULL)
giveup("Can't create output files");
insert(&Intern, "NIL", romSym("NIL", "(Rom+1)"));
cons(Nil, Nil);
fprintf(fp, "#define Nil (any)(Rom+1)\n");
insert(&Intern, "T", romSym("T", "(Rom+5)"));
fprintf(fp, "#define T (any)(Rom+5)\n");
insert(&Intern, "quote", romSym("quote", "(num(doQuote) + 2)"));
fprintf(fp, "#define Quote (any)(Rom+7)\nany doQuote(any);\n");
do {
if (!freopen(*++av, "r", stdin))
giveup("Can't open input file");
Chr = getchar();
while ((x = read0(YES)) != Nil) {
if (x & 2 || (x & 4) == 0)
giveup("Symbol expected");
if (skip() == '[') { // C Identifier
fprintf(fp, "#define ");
for (;;) {
Chr = getchar();
if (Chr == EOF)
break;
if (Chr == ']') {
Chr = getchar();
break;
}
putc(Chr, fp);
}
print(buf, x);
fprintf(fp, " (any)%s\n", buf);
}
x >>= 2;
if (skip() == '{') { // Function pointer
for (p = Token;;) {
Chr = getchar();
if (Chr == EOF)
break;
if (Chr == '}') {
Chr = getchar();
break;
}
*p++ = Chr;
}
*p = '\0';
sprintf(buf, "(num(%s) + 2)", Token);
Ram[-x] = strdup(buf);
fprintf(fp, "any %s(any);\n", Token);
}
else { // Value
print(buf, read0(YES));
if (x > 0)
Rom[x] = strdup(buf);
else
Ram[-x] = strdup(buf);
}
while (skip() == ',') { // Properties
Chr = getchar();
if (Chr == EOF)
break;
print(buf, read0(YES));
ix = RomIx;
if (x > 0) {
addList(&RomIx, &Rom, Rom[x-1], 0);
addList(&RomIx, &Rom, buf, 0);
print(buf, ix << 2);
Rom[x-1] = strdup(buf);
}
else {
addList(&RomIx, &Rom, Ram[-x-1], 0);
addList(&RomIx, &Rom, buf, 0);
print(buf, ix << 2);
Ram[-x-1] = strdup(buf);
}
}
}
} while (--ac);
fprintf(fp, "\n#define ROMS %d\n", RomIx);
fprintf(fp, "#define RAMS %d\n", RamIx);
fclose(fp);
if (fp = fopen("rom.d", "w")) {
for (x = 0; x < RomIx; x += 2)
fprintf(fp, "(any)%s, (any)%s,\n", Rom[x], Rom[x+1]);
fclose(fp);
}
if (fp = fopen("ram.d", "w")) {
for (x = 0; x < RamIx; x += 2)
fprintf(fp, "(any)%s, (any)%s,\n", Ram[x], Ram[x+1]);
fclose(fp);
}
return 0;
}
|
the_stack_data/87638392.c | extern const unsigned short title_Palette[256] = {
0x0000, 0x0200, 0x4010, 0x4210, 0x6378, 0x0165, 0x2965, 0x01e5,
0x29e5, 0x0265, 0x2a65, 0x2ae5, 0x2b65, 0x03e5, 0x280a, 0x006a,
0x286a, 0x00ea, 0x28ea, 0x296a, 0x29ea, 0x2a6a, 0x2aea, 0x2b6a,
0x2bea, 0x280f, 0x540f, 0x286f, 0x546f, 0x28ef, 0x54ef, 0x296f,
0x556f, 0x29ef, 0x55ef, 0x566f, 0x2aef, 0x56ef, 0x2b6f, 0x576f,
0x2bef, 0x57ef, 0x5415, 0x5475, 0x54f5, 0x2975, 0x5575, 0x55f5,
0x5675, 0x56f5, 0x5775, 0x57f5, 0x541a, 0x7c1a, 0x7c7a, 0x54fa,
0x7cfa, 0x7d7a, 0x55fa, 0x7dfa, 0x567a, 0x7e7a, 0x56fa, 0x7efa,
0x7f7a, 0x57fa, 0x7ffa, 0x7c7f, 0x54ff, 0x7cff, 0x7d7f, 0x7dff,
0x567f, 0x7e7f, 0x2aff, 0x7eff, 0x7f7f, 0x7f39, 0x01e0, 0x29e0,
0x0260, 0x02e0, 0x0360, 0x0005, 0x2805, 0x0065, 0x2865, 0x00e5,
0x28e5, 0x7bff, 0x5294, 0x03e0, 0x7c1f, 0x7fff, 0x4000, 0x54e5,
0x7ce5, 0x7c0a, 0x546a, 0x54ea, 0x7cea, 0x556a, 0x7d6a, 0x7c0f,
0x00ef, 0x7cef, 0x016f, 0x7d6f, 0x7def, 0x00f5, 0x0175, 0x01f5,
0x29f5, 0x7df5, 0x2a75, 0x7ef5, 0x28fa, 0x017a, 0x01fa, 0x29fa,
0x2a7a, 0x2afa, 0x577a, 0x547f, 0x28ff, 0x01ff, 0x29ff, 0x027f,
0x2a7f, 0x56ff, 0x577f, 0x57ff, 0x5405, 0x7c05, 0x5465, 0x7c65,
0x7c00, 0x0210, 0x7b34, 0x02e5, 0x0365, 0x000a, 0x540a, 0x7c6a,
0x016a, 0x01ea, 0x55ea, 0x7dea, 0x026a, 0x02ea, 0x036a, 0x006f,
0x7c6f, 0x01ef, 0x026f, 0x7e6f, 0x02ef, 0x036f, 0x2815, 0x7c15,
0x7cf5, 0x0275, 0x7e75, 0x02f5, 0x0375, 0x027a, 0x541f, 0x02ff,
0x4200, 0x2875, 0x28f5, 0x287a, 0x547a, 0x297a, 0x017f, 0x297f,
0x557f, 0x2a60, 0x557a, 0x7f3f, 0x2a6f, 0x0000, 0x0000, 0x0000,
0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000,
0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000, 0x0000
};
|
the_stack_data/97011732.c | #include <stdio.h>
extern int load(int x, int y);
int main() {
int result = 0;
int count = 9;
result = load(0x0, count+1);
printf("Sum of number from 1 to %d is %d\n", count, result);
}
|
the_stack_data/13339.c | /*
* KubOS Core Flight Services
* Copyright (C) 2015 Kubos Corporation
*
* 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.
*/
/**
{
"fs": {
"fatfs": {
"driver": "sdio"
}
}
}
**/
#ifdef YOTTA_CFG_FS_FATFS_DRIVER_SDIO
#include "kubos-core/modules/fatfs/diskio.h"
#include "kubos-hal/sdio.h"
/* Status of SDCARD */
static volatile DSTATUS Stat = STA_NOINIT;
#define SD_BLOCK_SIZE 512
DSTATUS disk_initialize (BYTE pdrv)
{
if (k_sdio_init() != SDIO_OK)
{
return STA_NOINIT;
}
return RES_OK;
}
DSTATUS disk_status (BYTE pdrv)
{
Stat = STA_NOINIT;
if (k_sdio_card_status() == SDIO_OK)
{
Stat &= ~STA_NOINIT;
}
else
{
Stat |= STA_NOINIT;
}
return Stat;
}
DRESULT disk_read (BYTE pdrv, BYTE * buff, DWORD sector, UINT count)
{
uint64_t block_addr = sector * SD_BLOCK_SIZE;
if (k_sdio_read_blocks((uint32_t*)buff, block_addr, SD_BLOCK_SIZE, count) != SDIO_OK)
{
return RES_ERROR;
}
return RES_OK;
}
DRESULT disk_write (BYTE pdrv, const BYTE* buff, DWORD sector, UINT count)
{
uint64_t block_addr = sector * SD_BLOCK_SIZE;
if (k_sdio_write_blocks((uint32_t*)buff, block_addr, SD_BLOCK_SIZE, count) != SDIO_OK)
{
return RES_ERROR;
}
return RES_OK;
}
DRESULT disk_ioctl (BYTE pdrv, BYTE cmd, void* buff)
{
DRESULT res = RES_ERROR;
k_sdio_card_info_t card_info;
switch (cmd) {
/* Make sure that no pending write process */
case CTRL_SYNC :
res = RES_OK;
break;
/* Size in bytes for single sector */
case GET_SECTOR_SIZE:
*(WORD *)buff = SD_BLOCK_SIZE;
res = RES_OK;
break;
/* Get number of sectors on the disk (DWORD) */
case GET_SECTOR_COUNT :
card_info = k_sdio_card_info();
*(DWORD *)buff = card_info.capacity / SD_BLOCK_SIZE;
res = RES_OK;
break;
/* Get erase block size in unit of sector (DWORD) */
case GET_BLOCK_SIZE :
*(DWORD*)buff = SD_BLOCK_SIZE;
break;
default:
res = RES_PARERR;
}
return res;
}
DWORD get_fattime (void)
{
return ((DWORD)(2013 - 1980) << 25) /* Year 2013 */
| ((DWORD)7 << 21) /* Month 7 */
| ((DWORD)28 << 16) /* Mday 28 */
| ((DWORD)0 << 11) /* Hour 0 */
| ((DWORD)0 << 5) /* Min 0 */
| ((DWORD)0 >> 1); /* Sec 0 */
}
#endif
|
the_stack_data/886950.c | /* n_29.c: #undef directive. */
/* 29.1: Undefined macro is not a macro. */
/* DEFINED; */
#define DEFINED
#undef DEFINED
DEFINED;
/* 29.2: Undefining undefined name is not an error. */
#undef UNDEFINED
/* { dg-do preprocess }
{ dg-final { if ![file exist n_29.i] { return } } }
{ dg-final { if \{ [grep n_29.i "DEFINED"] != "" \} \{ } }
{ dg-final { return \} } }
{ dg-final { fail "n_29.c: #undef" } }
*/
|
the_stack_data/243891881.c | /* Test Darwin linker option -dynamic. */
/* Developed by Devang Patel <[email protected]>. */
/* { dg-options "-dynamic" } */
/* { dg-do link { target *-*-darwin* } } */
int main()
{
return 0;
}
|
the_stack_data/68886939.c | /**
******************************************************************************
* @file stm32l0xx_ll_tim.c
* @author MCD Application Team
* @version V1.7.0
* @date 31-May-2016
* @brief TIM LL module driver.
******************************************************************************
* @attention
*
* <h2><center>© COPYRIGHT(c) 2016 STMicroelectronics</center></h2>
*
* 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 STMicroelectronics nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
******************************************************************************
*/
#if defined(USE_FULL_LL_DRIVER)
/* Includes ------------------------------------------------------------------*/
#include "stm32l0xx_ll_tim.h"
#include "stm32l0xx_ll_bus.h"
#ifdef USE_FULL_ASSERT
#include "stm32_assert.h"
#else
#define assert_param(expr) ((void)0U)
#endif
/** @addtogroup STM32L0xx_LL_Driver
* @{
*/
#if defined (TIM2) || defined (TIM3) || defined (TIM21) || defined (TIM22) || defined (TIM6) || defined (TIM7)
/** @addtogroup TIM_LL
* @{
*/
/* Private types -------------------------------------------------------------*/
/* Private variables ---------------------------------------------------------*/
/* Private constants ---------------------------------------------------------*/
/* Private macros ------------------------------------------------------------*/
/** @addtogroup TIM_LL_Private_Macros
* @{
*/
#define IS_LL_TIM_COUNTERMODE(__VALUE__) (((__VALUE__) == LL_TIM_COUNTERMODE_UP) \
|| ((__VALUE__) == LL_TIM_COUNTERMODE_DOWN) \
|| ((__VALUE__) == LL_TIM_COUNTERMODE_CENTER_UP) \
|| ((__VALUE__) == LL_TIM_COUNTERMODE_CENTER_DOWN) \
|| ((__VALUE__) == LL_TIM_COUNTERMODE_CENTER_UP_DOWN))
#define IS_LL_TIM_CLOCKDIVISION(__VALUE__) (((__VALUE__) == LL_TIM_CLOCKDIVISION_DIV1) \
|| ((__VALUE__) == LL_TIM_CLOCKDIVISION_DIV2) \
|| ((__VALUE__) == LL_TIM_CLOCKDIVISION_DIV4))
#define IS_LL_TIM_OCMODE(__VALUE__) (((__VALUE__) == LL_TIM_OCMODE_FROZEN) \
|| ((__VALUE__) == LL_TIM_OCMODE_ACTIVE) \
|| ((__VALUE__) == LL_TIM_OCMODE_INACTIVE) \
|| ((__VALUE__) == LL_TIM_OCMODE_TOGGLE) \
|| ((__VALUE__) == LL_TIM_OCMODE_FORCED_INACTIVE) \
|| ((__VALUE__) == LL_TIM_OCMODE_FORCED_ACTIVE) \
|| ((__VALUE__) == LL_TIM_OCMODE_PWM1) \
|| ((__VALUE__) == LL_TIM_OCMODE_PWM2))
#define IS_LL_TIM_OCSTATE(__VALUE__) (((__VALUE__) == LL_TIM_OCSTATE_DISABLE) \
|| ((__VALUE__) == LL_TIM_OCSTATE_ENABLE))
#define IS_LL_TIM_OCPOLARITY(__VALUE__) (((__VALUE__) == LL_TIM_OCPOLARITY_HIGH) \
|| ((__VALUE__) == LL_TIM_OCPOLARITY_LOW))
#define IS_LL_TIM_ACTIVEINPUT(__VALUE__) (((__VALUE__) == LL_TIM_ACTIVEINPUT_DIRECTTI) \
|| ((__VALUE__) == LL_TIM_ACTIVEINPUT_INDIRECTTI) \
|| ((__VALUE__) == LL_TIM_ACTIVEINPUT_TRC))
#define IS_LL_TIM_ICPSC(__VALUE__) (((__VALUE__) == LL_TIM_ICPSC_DIV1) \
|| ((__VALUE__) == LL_TIM_ICPSC_DIV2) \
|| ((__VALUE__) == LL_TIM_ICPSC_DIV4) \
|| ((__VALUE__) == LL_TIM_ICPSC_DIV8))
#define IS_LL_TIM_IC_FILTER(__VALUE__) (((__VALUE__) == LL_TIM_IC_FILTER_FDIV1) \
|| ((__VALUE__) == LL_TIM_IC_FILTER_FDIV1_N2) \
|| ((__VALUE__) == LL_TIM_IC_FILTER_FDIV1_N4) \
|| ((__VALUE__) == LL_TIM_IC_FILTER_FDIV1_N8) \
|| ((__VALUE__) == LL_TIM_IC_FILTER_FDIV2_N6) \
|| ((__VALUE__) == LL_TIM_IC_FILTER_FDIV2_N8) \
|| ((__VALUE__) == LL_TIM_IC_FILTER_FDIV4_N6) \
|| ((__VALUE__) == LL_TIM_IC_FILTER_FDIV4_N8) \
|| ((__VALUE__) == LL_TIM_IC_FILTER_FDIV8_N6) \
|| ((__VALUE__) == LL_TIM_IC_FILTER_FDIV8_N8) \
|| ((__VALUE__) == LL_TIM_IC_FILTER_FDIV16_N5) \
|| ((__VALUE__) == LL_TIM_IC_FILTER_FDIV16_N6) \
|| ((__VALUE__) == LL_TIM_IC_FILTER_FDIV16_N8) \
|| ((__VALUE__) == LL_TIM_IC_FILTER_FDIV32_N5) \
|| ((__VALUE__) == LL_TIM_IC_FILTER_FDIV32_N6) \
|| ((__VALUE__) == LL_TIM_IC_FILTER_FDIV32_N8))
#define IS_LL_TIM_IC_POLARITY(__VALUE__) (((__VALUE__) == LL_TIM_IC_POLARITY_RISING) \
|| ((__VALUE__) == LL_TIM_IC_POLARITY_FALLING) \
|| ((__VALUE__) == LL_TIM_IC_POLARITY_BOTHEDGE))
#define IS_LL_TIM_ENCODERMODE(__VALUE__) (((__VALUE__) == LL_TIM_ENCODERMODE_X2_TI1) \
|| ((__VALUE__) == LL_TIM_ENCODERMODE_X2_TI2) \
|| ((__VALUE__) == LL_TIM_ENCODERMODE_X4_TI12))
#define IS_LL_TIM_IC_POLARITY_ENCODER(__VALUE__) (((__VALUE__) == LL_TIM_IC_POLARITY_RISING) \
|| ((__VALUE__) == LL_TIM_IC_POLARITY_FALLING))
/**
* @}
*/
/* Private function prototypes -----------------------------------------------*/
/** @defgroup TIM_LL_Private_Functions TIM Private Functions
* @{
*/
static ErrorStatus OC1Config(TIM_TypeDef* TIMx, LL_TIM_OC_InitTypeDef* TIM_OCInitStruct);
static ErrorStatus OC2Config(TIM_TypeDef* TIMx, LL_TIM_OC_InitTypeDef* TIM_OCInitStruct);
static ErrorStatus OC3Config(TIM_TypeDef* TIMx, LL_TIM_OC_InitTypeDef* TIM_OCInitStruct);
static ErrorStatus OC4Config(TIM_TypeDef* TIMx, LL_TIM_OC_InitTypeDef* TIM_OCInitStruct);
static ErrorStatus IC1Config(TIM_TypeDef* TIMx, LL_TIM_IC_InitTypeDef* TIM_ICInitStruct);
static ErrorStatus IC2Config(TIM_TypeDef* TIMx, LL_TIM_IC_InitTypeDef* TIM_ICInitStruct);
static ErrorStatus IC3Config(TIM_TypeDef* TIMx, LL_TIM_IC_InitTypeDef* TIM_ICInitStruct);
static ErrorStatus IC4Config(TIM_TypeDef* TIMx, LL_TIM_IC_InitTypeDef* TIM_ICInitStruct);
/**
* @}
*/
/* Exported functions --------------------------------------------------------*/
/** @addtogroup TIM_LL_Exported_Functions
* @{
*/
/** @addtogroup TIM_LL_EF_Init
* @{
*/
/**
* @brief Set TIMx registers to their reset values.
* @param TIMx Timer instance
* @retval An ErrorStatus enumeration value:
* - SUCCESS: TIMx registers are de-initialized
* - ERROR: invalid TIMx instance
*/
ErrorStatus LL_TIM_DeInit(TIM_TypeDef* TIMx)
{
ErrorStatus result = SUCCESS;
/* Check the parameters */
assert_param(IS_TIM_INSTANCE(TIMx));
if (TIMx == TIM2)
{
LL_APB1_GRP1_ForceReset(LL_APB1_GRP1_PERIPH_TIM2);
LL_APB1_GRP1_ReleaseReset(LL_APB1_GRP1_PERIPH_TIM2);
}
#if defined(TIM3)
else if (TIMx == TIM3)
{
LL_APB1_GRP1_ForceReset(LL_APB1_GRP1_PERIPH_TIM3);
LL_APB1_GRP1_ReleaseReset(LL_APB1_GRP1_PERIPH_TIM3);
}
#endif /* TIM3 */
#if defined(TIM6)
else if (TIMx == TIM6)
{
LL_APB1_GRP1_ForceReset(LL_APB1_GRP1_PERIPH_TIM6);
LL_APB1_GRP1_ReleaseReset(LL_APB1_GRP1_PERIPH_TIM6);
}
#endif /* TIM6 */
#if defined(TIM7)
else if (TIMx == TIM7)
{
LL_APB1_GRP1_ForceReset(LL_APB1_GRP1_PERIPH_TIM7);
LL_APB1_GRP1_ReleaseReset(LL_APB1_GRP1_PERIPH_TIM7);
}
#endif /* TIM7 */
else if (TIMx == TIM21)
{
LL_APB2_GRP1_ForceReset(LL_APB2_GRP1_PERIPH_TIM21);
LL_APB2_GRP1_ReleaseReset(LL_APB2_GRP1_PERIPH_TIM21);
}
#if defined(TIM22)
else if (TIMx == TIM22)
{
LL_APB2_GRP1_ForceReset(LL_APB2_GRP1_PERIPH_TIM22);
LL_APB2_GRP1_ReleaseReset(LL_APB2_GRP1_PERIPH_TIM22);
}
#endif /* TIM22 */
else
{
result = ERROR;
}
return result;
}
/**
* @brief Set the fields of the time base unit configuration data structure
* to their default values.
* @param TIM_InitStruct pointer to a @ref LL_TIM_InitTypeDef structure (time base unit configuration data structure)
* @retval None
*/
void LL_TIM_StructInit(LL_TIM_InitTypeDef* TIM_InitStruct)
{
/* Set the default configuration */
TIM_InitStruct->Prescaler = (uint16_t)0x0000U;
TIM_InitStruct->CounterMode = LL_TIM_COUNTERMODE_UP;
TIM_InitStruct->Autoreload = (uint32_t)0xFFFFFFFFU;
TIM_InitStruct->ClockDivision = LL_TIM_CLOCKDIVISION_DIV1;
}
/**
* @brief Configure the TIMx time base unit.
* @param TIMx Timer Instance
* @param TIM_InitStruct pointer to a @ref LL_TIM_InitTypeDef structure (TIMx time base unit configuration data structure)
* @retval An ErrorStatus enumeration value:
* - SUCCESS: TIMx registers are de-initialized
* - ERROR: not applicable
*/
ErrorStatus LL_TIM_Init(TIM_TypeDef * TIMx, LL_TIM_InitTypeDef* TIM_InitStruct)
{
uint16_t tmpcr1 = 0U;
/* Check the parameters */
assert_param(IS_TIM_INSTANCE(TIMx));
assert_param(IS_LL_TIM_COUNTERMODE(TIM_InitStruct->CounterMode));
assert_param(IS_LL_TIM_CLOCKDIVISION(TIM_InitStruct->ClockDivision));
tmpcr1 = LL_TIM_ReadReg(TIMx, CR1);
if(IS_TIM_COUNTER_MODE_SELECT_INSTANCE(TIMx))
{
/* Select the Counter Mode */
tmpcr1 &= (uint16_t)(~(TIM_CR1_DIR | TIM_CR1_CMS));
tmpcr1 |= (uint32_t)TIM_InitStruct->CounterMode;
}
if(IS_TIM_CLOCK_DIVISION_INSTANCE(TIMx))
{
/* Set the clock division */
tmpcr1 &= (uint16_t)(~TIM_CR1_CKD);
tmpcr1 |= (uint32_t)TIM_InitStruct->ClockDivision;
}
/* Write to TIMx CR1 */
LL_TIM_WriteReg(TIMx, CR1, tmpcr1);
/* Set the Autoreload value */
LL_TIM_SetAutoReload(TIMx, TIM_InitStruct->Autoreload);
/* Set the Prescaler value */
LL_TIM_SetPrescaler(TIMx, TIM_InitStruct->Prescaler);
/* Generate an update event to reload the Prescaler
and the repetition counter value (if applicable) immediately */
LL_TIM_GenerateEvent_UPDATE(TIMx);
return SUCCESS;
}
/**
* @brief Set the fields of the TIMx output channel configuration data
* structure to their default values.
* @param TIM_OC_InitStruct pointer to a @ref LL_TIM_OC_InitTypeDef structure (the output channel configuration data structure)
* @retval None
*/
void LL_TIM_OC_StructInit(LL_TIM_OC_InitTypeDef* TIM_OC_InitStruct)
{
/* Set the default configuration */
TIM_OC_InitStruct->OCMode = LL_TIM_OCMODE_FROZEN;
TIM_OC_InitStruct->OCState = LL_TIM_OCSTATE_DISABLE;
TIM_OC_InitStruct->CompareValue = (uint32_t)0x00000000U;
TIM_OC_InitStruct->OCPolarity = LL_TIM_OCPOLARITY_HIGH;
}
/**
* @brief Configure the TIMx output channel.
* @param TIMx Timer Instance
* @param Channel This parameter can be one of the following values:
* @arg @ref LL_TIM_CHANNEL_CH1
* @arg @ref LL_TIM_CHANNEL_CH2
* @arg @ref LL_TIM_CHANNEL_CH3
* @arg @ref LL_TIM_CHANNEL_CH4
* @param TIM_OC_InitStruct pointer to a @ref LL_TIM_OC_InitTypeDef structure (TIMx output channel configuration data structure)
* @retval An ErrorStatus enumeration value:
* - SUCCESS: TIMx output channel is initialized
* - ERROR: TIMx output channel is not initialized
*/
ErrorStatus LL_TIM_OC_Init(TIM_TypeDef* TIMx, uint32_t Channel, LL_TIM_OC_InitTypeDef* TIM_OC_InitStruct)
{
ErrorStatus result = ERROR;
switch(Channel)
{
case LL_TIM_CHANNEL_CH1:
result = OC1Config(TIMx, TIM_OC_InitStruct);
break;
case LL_TIM_CHANNEL_CH2:
result = OC2Config(TIMx, TIM_OC_InitStruct);
break;
case LL_TIM_CHANNEL_CH3:
result = OC3Config(TIMx, TIM_OC_InitStruct);
break;
case LL_TIM_CHANNEL_CH4:
result = OC4Config(TIMx, TIM_OC_InitStruct);
break;
default:
break;
}
return result;
}
/**
* @brief Set the fields of the TIMx input channel configuration data
* structure to their default values.
* @param TIM_ICInitStruct pointer to a @ref LL_TIM_IC_InitTypeDef structure (the input channel configuration data structure)
* @retval None
*/
void LL_TIM_IC_StructInit(LL_TIM_IC_InitTypeDef* TIM_ICInitStruct)
{
/* Set the default configuration */
TIM_ICInitStruct->ICPolarity = LL_TIM_IC_POLARITY_RISING;
TIM_ICInitStruct->ICActiveInput = LL_TIM_ACTIVEINPUT_DIRECTTI;
TIM_ICInitStruct->ICPrescaler = LL_TIM_ICPSC_DIV1;
TIM_ICInitStruct->ICFilter = LL_TIM_IC_FILTER_FDIV1;
}
/**
* @brief Configure the TIMx input channel.
* @param TIMx Timer Instance
* @param Channel This parameter can be one of the following values:
* @arg @ref LL_TIM_CHANNEL_CH1
* @arg @ref LL_TIM_CHANNEL_CH2
* @arg @ref LL_TIM_CHANNEL_CH3
* @arg @ref LL_TIM_CHANNEL_CH4
* @param TIM_IC_InitStruct pointer to a @ref LL_TIM_IC_InitTypeDef structure (TIMx input channel configuration data structure)
* @retval An ErrorStatus enumeration value:
* - SUCCESS: TIMx output channel is initialized
* - ERROR: TIMx output channel is not initialized
*/
ErrorStatus LL_TIM_IC_Init(TIM_TypeDef* TIMx, uint32_t Channel, LL_TIM_IC_InitTypeDef* TIM_IC_InitStruct)
{
ErrorStatus result = ERROR;
switch(Channel)
{
case LL_TIM_CHANNEL_CH1:
result = IC1Config(TIMx, TIM_IC_InitStruct);
break;
case LL_TIM_CHANNEL_CH2:
result = IC2Config(TIMx, TIM_IC_InitStruct);
break;
case LL_TIM_CHANNEL_CH3:
result = IC3Config(TIMx, TIM_IC_InitStruct);
break;
case LL_TIM_CHANNEL_CH4:
result = IC4Config(TIMx, TIM_IC_InitStruct);
break;
default:
break;
}
return result;
}
/**
* @brief Fills each TIM_EncoderInitStruct field with its default value
* @param TIM_EncoderInitStruct pointer to a @ref LL_TIM_ENCODER_InitTypeDef structure (encoder interface configuration data structure)
* @retval None
*/
void LL_TIM_ENCODER_StructInit(LL_TIM_ENCODER_InitTypeDef* TIM_EncoderInitStruct)
{
/* Set the default configuration */
TIM_EncoderInitStruct->EncoderMode = LL_TIM_ENCODERMODE_X2_TI1;
TIM_EncoderInitStruct->IC1Polarity = LL_TIM_IC_POLARITY_RISING;
TIM_EncoderInitStruct->IC1ActiveInput = LL_TIM_ACTIVEINPUT_DIRECTTI;
TIM_EncoderInitStruct->IC1Prescaler = LL_TIM_ICPSC_DIV1;
TIM_EncoderInitStruct->IC1Filter = LL_TIM_IC_FILTER_FDIV1;
TIM_EncoderInitStruct->IC2Polarity = LL_TIM_IC_POLARITY_RISING;
TIM_EncoderInitStruct->IC2ActiveInput = LL_TIM_ACTIVEINPUT_DIRECTTI;
TIM_EncoderInitStruct->IC2Prescaler = LL_TIM_ICPSC_DIV1;
TIM_EncoderInitStruct->IC2Filter = LL_TIM_IC_FILTER_FDIV1;
}
/**
* @brief Configure the encoder interface of the timer instance.
* @param TIMx Timer Instance
* @param TIM_EncoderInitStruct pointer to a @ref LL_TIM_ENCODER_InitTypeDef structure (TIMx encoder interface configuration data structure)
* @retval An ErrorStatus enumeration value:
* - SUCCESS: TIMx registers are de-initialized
* - ERROR: not applicable
*/
ErrorStatus LL_TIM_ENCODER_Init(TIM_TypeDef* TIMx, LL_TIM_ENCODER_InitTypeDef* TIM_EncoderInitStruct)
{
uint32_t tmpccmr1 = 0U;
uint32_t tmpccer = 0U;
/* Check the parameters */
assert_param(IS_TIM_ENCODER_INTERFACE_INSTANCE(TIMx));
assert_param(IS_LL_TIM_ENCODERMODE(TIM_EncoderInitStruct->EncoderMode));
assert_param(IS_LL_TIM_IC_POLARITY_ENCODER(TIM_EncoderInitStruct->IC1Polarity));
assert_param(IS_LL_TIM_ACTIVEINPUT(TIM_EncoderInitStruct->IC1ActiveInput));
assert_param(IS_LL_TIM_ICPSC(TIM_EncoderInitStruct->IC1Prescaler));
assert_param(IS_LL_TIM_IC_FILTER(TIM_EncoderInitStruct->IC1Filter));
assert_param(IS_LL_TIM_IC_POLARITY_ENCODER(TIM_EncoderInitStruct->IC2Polarity));
assert_param(IS_LL_TIM_ACTIVEINPUT(TIM_EncoderInitStruct->IC2ActiveInput));
assert_param(IS_LL_TIM_ICPSC(TIM_EncoderInitStruct->IC2Prescaler));
assert_param(IS_LL_TIM_IC_FILTER(TIM_EncoderInitStruct->IC2Filter));
/* Disable the CC1 and CC2: Reset the CC1E and CC2E Bits */
TIMx->CCER &= (uint32_t)~(TIM_CCER_CC1E | TIM_CCER_CC2E);
/* Get the TIMx CCMR1 register value */
tmpccmr1 = LL_TIM_ReadReg(TIMx, CCMR1);
/* Get the TIMx CCER register value */
tmpccer = LL_TIM_ReadReg(TIMx, CCER);
/* Configure TI1 */
tmpccmr1 &= (uint32_t)~(TIM_CCMR1_CC1S | TIM_CCMR1_IC1F | TIM_CCMR1_IC1PSC);
tmpccmr1 |= (uint32_t)(TIM_EncoderInitStruct->IC1ActiveInput >> 16U);
tmpccmr1 |= (uint32_t)(TIM_EncoderInitStruct->IC1Filter >> 16U);
tmpccmr1 |= (uint32_t)(TIM_EncoderInitStruct->IC1Prescaler >> 16U);
/* Configure TI2 */
tmpccmr1 &= (uint32_t)~(TIM_CCMR1_CC2S | TIM_CCMR1_IC2F | TIM_CCMR1_IC2PSC);
tmpccmr1 |= (uint32_t)(TIM_EncoderInitStruct->IC2ActiveInput >> 8U);
tmpccmr1 |= (uint32_t)(TIM_EncoderInitStruct->IC2Filter >> 8U);
tmpccmr1 |= (uint32_t)(TIM_EncoderInitStruct->IC2Prescaler >> 8U);
/* Set TI1 and TI2 polarity and enable TI1 and TI2 */
tmpccer &= (uint32_t)~(TIM_CCER_CC1P | TIM_CCER_CC1NP | TIM_CCER_CC2P | TIM_CCER_CC2NP);
tmpccer |= (uint32_t)(TIM_EncoderInitStruct->IC1Polarity);
tmpccer |= (uint32_t)(TIM_EncoderInitStruct->IC2Polarity << 4U);
tmpccer |= (uint32_t)(TIM_CCER_CC1E | TIM_CCER_CC2E);
/* Set encoder mode */
LL_TIM_SetEncoderMode(TIMx, TIM_EncoderInitStruct->EncoderMode);
/* Write to TIMx CCMR1 */
LL_TIM_WriteReg(TIMx, CCMR1, tmpccmr1);
/* Write to TIMx CCER */
LL_TIM_WriteReg(TIMx, CCER, tmpccer);
return SUCCESS;
}
/**
* @}
*/
/**
* @}
*/
/** @addtogroup TIM_LL_Private_Functions TIM Private Functions
* @brief Private functions
* @{
*/
/**
* @brief Configure the TIMx output channel 1.
* @param TIMx Timer Instance
* @param TIM_OCInitStruct pointer to the the TIMx output channel 1 configuration data structure
* @retval An ErrorStatus enumeration value:
* - SUCCESS: TIMx registers are de-initialized
* - ERROR: not applicable
*/
static ErrorStatus OC1Config(TIM_TypeDef* TIMx, LL_TIM_OC_InitTypeDef* TIM_OCInitStruct)
{
uint32_t tmpccmr1 = 0U;
uint32_t tmpccer = 0U;
uint32_t tmpcr2 = 0U;
/* Check the parameters */
assert_param(IS_TIM_CC1_INSTANCE(TIMx));
assert_param(IS_LL_TIM_OCMODE(TIM_OCInitStruct->OCMode));
assert_param(IS_LL_TIM_OCSTATE(TIM_OCInitStruct->OCState));
assert_param(IS_LL_TIM_OCPOLARITY(TIM_OCInitStruct->OCPolarity));
/* Disable the Channel 1: Reset the CC1E Bit */
CLEAR_BIT(TIMx->CCER, TIM_CCER_CC1E);
/* Get the TIMx CCER register value */
tmpccer = LL_TIM_ReadReg(TIMx, CCER);
/* Get the TIMx CR2 register value */
tmpcr2 = LL_TIM_ReadReg(TIMx, CR2);
/* Get the TIMx CCMR1 register value */
tmpccmr1 = LL_TIM_ReadReg(TIMx, CCMR1);
/* Reset Capture/Compare selection Bits */
CLEAR_BIT(tmpccmr1, TIM_CCMR1_CC1S);
/* Set the Output Compare Mode */
MODIFY_REG(tmpccmr1, TIM_CCMR1_OC1M, TIM_OCInitStruct->OCMode);
/* Set the Output Compare Polarity */
MODIFY_REG(tmpccer, TIM_CCER_CC1P, TIM_OCInitStruct->OCPolarity);
/* Set the Output State */
MODIFY_REG(tmpccer, TIM_CCER_CC1E, TIM_OCInitStruct->OCState);
/* Write to TIMx CR2 */
LL_TIM_WriteReg(TIMx, CR2, tmpcr2);
/* Write to TIMx CCMR1 */
LL_TIM_WriteReg(TIMx, CCMR1, tmpccmr1);
/* Set the Capture Compare Register value */
LL_TIM_OC_SetCompareCH1(TIMx, TIM_OCInitStruct->CompareValue);
/* Write to TIMx CCER */
LL_TIM_WriteReg(TIMx, CCER, tmpccer);
return SUCCESS;
}
/**
* @brief Configure the TIMx output channel 2.
* @param TIMx Timer Instance
* @param TIM_OCInitStruct pointer to the the TIMx output channel 2 configuration data structure
* @retval An ErrorStatus enumeration value:
* - SUCCESS: TIMx registers are de-initialized
* - ERROR: not applicable
*/
static ErrorStatus OC2Config(TIM_TypeDef* TIMx, LL_TIM_OC_InitTypeDef* TIM_OCInitStruct)
{
uint32_t tmpccmr1 = 0U;
uint32_t tmpccer = 0U;
uint32_t tmpcr2 = 0U;
/* Check the parameters */
assert_param(IS_TIM_CC2_INSTANCE(TIMx));
assert_param(IS_LL_TIM_OCMODE(TIM_OCInitStruct->OCMode));
assert_param(IS_LL_TIM_OCSTATE(TIM_OCInitStruct->OCState));
assert_param(IS_LL_TIM_OCPOLARITY(TIM_OCInitStruct->OCPolarity));
/* Disable the Channel 2: Reset the CC2E Bit */
CLEAR_BIT(TIMx->CCER, TIM_CCER_CC2E);
/* Get the TIMx CCER register value */
tmpccer = LL_TIM_ReadReg(TIMx, CCER);
/* Get the TIMx CR2 register value */
tmpcr2 = LL_TIM_ReadReg(TIMx, CR2);
/* Get the TIMx CCMR1 register value */
tmpccmr1 = LL_TIM_ReadReg(TIMx, CCMR1);
/* Reset Capture/Compare selection Bits */
CLEAR_BIT(tmpccmr1, TIM_CCMR1_CC2S);
/* Select the Output Compare Mode */
MODIFY_REG(tmpccmr1, TIM_CCMR1_OC2M, TIM_OCInitStruct->OCMode << 8U);
/* Set the Output Compare Polarity */
MODIFY_REG(tmpccer, TIM_CCER_CC2P, TIM_OCInitStruct->OCPolarity<< 4U);
/* Set the Output State */
MODIFY_REG(tmpccer, TIM_CCER_CC2E, TIM_OCInitStruct->OCState << 4U);
/* Write to TIMx CR2 */
LL_TIM_WriteReg(TIMx, CR2, tmpcr2);
/* Write to TIMx CCMR1 */
LL_TIM_WriteReg(TIMx, CCMR1, tmpccmr1);
/* Set the Capture Compare Register value */
LL_TIM_OC_SetCompareCH2(TIMx, TIM_OCInitStruct->CompareValue);
/* Write to TIMx CCER */
LL_TIM_WriteReg(TIMx, CCER, tmpccer);
return SUCCESS;
}
/**
* @brief Configure the TIMx output channel 3.
* @param TIMx Timer Instance
* @param TIM_OCInitStruct pointer to the the TIMx output channel 3 configuration data structure
* @retval An ErrorStatus enumeration value:
* - SUCCESS: TIMx registers are de-initialized
* - ERROR: not applicable
*/
static ErrorStatus OC3Config(TIM_TypeDef* TIMx, LL_TIM_OC_InitTypeDef* TIM_OCInitStruct)
{
uint32_t tmpccmr2 = 0U;
uint32_t tmpccer = 0U;
uint32_t tmpcr2 = 0U;
/* Check the parameters */
assert_param(IS_TIM_CC3_INSTANCE(TIMx));
assert_param(IS_LL_TIM_OCMODE(TIM_OCInitStruct->OCMode));
assert_param(IS_LL_TIM_OCSTATE(TIM_OCInitStruct->OCState));
assert_param(IS_LL_TIM_OCPOLARITY(TIM_OCInitStruct->OCPolarity));
/* Disable the Channel 3: Reset the CC3E Bit */
CLEAR_BIT(TIMx->CCER, TIM_CCER_CC3E);
/* Get the TIMx CCER register value */
tmpccer = LL_TIM_ReadReg(TIMx, CCER);
/* Get the TIMx CR2 register value */
tmpcr2 = LL_TIM_ReadReg(TIMx, CR2);
/* Get the TIMx CCMR2 register value */
tmpccmr2 = LL_TIM_ReadReg(TIMx, CCMR2);
/* Reset Capture/Compare selection Bits */
CLEAR_BIT(tmpccmr2, TIM_CCMR2_CC3S);
/* Select the Output Compare Mode */
MODIFY_REG(tmpccmr2, TIM_CCMR2_OC3M, TIM_OCInitStruct->OCMode);
/* Set the Output Compare Polarity */
MODIFY_REG(tmpccer, TIM_CCER_CC3P, TIM_OCInitStruct->OCPolarity << 8U);
/* Set the Output State */
MODIFY_REG(tmpccer, TIM_CCER_CC3E, TIM_OCInitStruct->OCState << 8U);
/* Write to TIMx CR2 */
LL_TIM_WriteReg(TIMx, CR2, tmpcr2);
/* Write to TIMx CCMR2 */
LL_TIM_WriteReg(TIMx, CCMR2, tmpccmr2);
/* Set the Capture Compare Register value */
LL_TIM_OC_SetCompareCH3(TIMx, TIM_OCInitStruct->CompareValue);
/* Write to TIMx CCER */
LL_TIM_WriteReg(TIMx, CCER, tmpccer);
return SUCCESS;
}
/**
* @brief Configure the TIMx output channel 4.
* @param TIMx Timer Instance
* @param TIM_OCInitStruct pointer to the the TIMx output channel 4 configuration data structure
* @retval An ErrorStatus enumeration value:
* - SUCCESS: TIMx registers are de-initialized
* - ERROR: not applicable
*/
static ErrorStatus OC4Config(TIM_TypeDef* TIMx, LL_TIM_OC_InitTypeDef* TIM_OCInitStruct)
{
uint32_t tmpccmr2 = 0U;
uint32_t tmpccer = 0U;
uint32_t tmpcr2 = 0U;
/* Check the parameters */
assert_param(IS_TIM_CC4_INSTANCE(TIMx));
assert_param(IS_LL_TIM_OCMODE(TIM_OCInitStruct->OCMode));
assert_param(IS_LL_TIM_OCSTATE(TIM_OCInitStruct->OCState));
assert_param(IS_LL_TIM_OCPOLARITY(TIM_OCInitStruct->OCPolarity));
/* Disable the Channel 4: Reset the CC4E Bit */
CLEAR_BIT(TIMx->CCER, TIM_CCER_CC4E);
/* Get the TIMx CCER register value */
tmpccer = LL_TIM_ReadReg(TIMx, CCER);
/* Get the TIMx CR2 register value */
tmpcr2 = LL_TIM_ReadReg(TIMx, CR2);
/* Get the TIMx CCMR2 register value */
tmpccmr2 = LL_TIM_ReadReg(TIMx, CCMR2);
/* Reset Capture/Compare selection Bits */
CLEAR_BIT(tmpccmr2, TIM_CCMR2_CC4S);
/* Select the Output Compare Mode */
MODIFY_REG(tmpccmr2, TIM_CCMR2_OC4M, TIM_OCInitStruct->OCMode << 8U);
/* Set the Output Compare Polarity */
MODIFY_REG(tmpccer, TIM_CCER_CC4P, TIM_OCInitStruct->OCPolarity << 12U);
/* Set the Output State */
MODIFY_REG(tmpccer, TIM_CCER_CC4E, TIM_OCInitStruct->OCState << 12U);
/* Write to TIMx CR2 */
LL_TIM_WriteReg(TIMx, CR2, tmpcr2);
/* Write to TIMx CCMR2 */
LL_TIM_WriteReg(TIMx, CCMR2, tmpccmr2);
/* Set the Capture Compare Register value */
LL_TIM_OC_SetCompareCH4(TIMx, TIM_OCInitStruct->CompareValue);
/* Write to TIMx CCER */
LL_TIM_WriteReg(TIMx, CCER, tmpccer);
return SUCCESS;
}
/**
* @brief Configure the TIMx input channel 1.
* @param TIMx Timer Instance
* @param TIM_ICInitStruct pointer to the the TIMx input channel 1 configuration data structure
* @retval An ErrorStatus enumeration value:
* - SUCCESS: TIMx registers are de-initialized
* - ERROR: not applicable
*/
static ErrorStatus IC1Config(TIM_TypeDef* TIMx, LL_TIM_IC_InitTypeDef* TIM_ICInitStruct)
{
/* Check the parameters */
assert_param(IS_TIM_CC1_INSTANCE(TIMx));
assert_param(IS_LL_TIM_IC_POLARITY(TIM_ICInitStruct->ICPolarity));
assert_param(IS_LL_TIM_ACTIVEINPUT(TIM_ICInitStruct->ICActiveInput));
assert_param(IS_LL_TIM_ICPSC(TIM_ICInitStruct->ICPrescaler));
assert_param(IS_LL_TIM_IC_FILTER(TIM_ICInitStruct->ICFilter));
/* Disable the Channel 1: Reset the CC1E Bit */
TIMx->CCER &= (uint32_t)~TIM_CCER_CC1E;
/* Select the Input and set the filter and the prescaler value */
MODIFY_REG(TIMx->CCMR1,
(TIM_CCMR1_CC1S | TIM_CCMR1_IC1F | TIM_CCMR1_IC1PSC),
(TIM_ICInitStruct->ICActiveInput | TIM_ICInitStruct->ICFilter | TIM_ICInitStruct->ICPrescaler) >> 16U);
/* Select the Polarity and set the CC1E Bit */
MODIFY_REG(TIMx->CCER,
(TIM_CCER_CC1P | TIM_CCER_CC1NP),
(TIM_ICInitStruct->ICPolarity | TIM_CCER_CC1E));
return SUCCESS;
}
/**
* @brief Configure the TIMx input channel 2.
* @param TIMx Timer Instance
* @param TIM_ICInitStruct pointer to the the TIMx input channel 2 configuration data structure
* @retval An ErrorStatus enumeration value:
* - SUCCESS: TIMx registers are de-initialized
* - ERROR: not applicable
*/
static ErrorStatus IC2Config(TIM_TypeDef* TIMx, LL_TIM_IC_InitTypeDef* TIM_ICInitStruct)
{
/* Check the parameters */
assert_param(IS_TIM_CC2_INSTANCE(TIMx));
assert_param(IS_LL_TIM_IC_POLARITY(TIM_ICInitStruct->ICPolarity));
assert_param(IS_LL_TIM_ACTIVEINPUT(TIM_ICInitStruct->ICActiveInput));
assert_param(IS_LL_TIM_ICPSC(TIM_ICInitStruct->ICPrescaler));
assert_param(IS_LL_TIM_IC_FILTER(TIM_ICInitStruct->ICFilter));
/* Disable the Channel 2: Reset the CC2E Bit */
TIMx->CCER &= (uint32_t)~TIM_CCER_CC2E;
/* Select the Input and set the filter and the prescaler value */
MODIFY_REG(TIMx->CCMR1,
(TIM_CCMR1_CC2S | TIM_CCMR1_IC2F | TIM_CCMR1_IC2PSC),
(TIM_ICInitStruct->ICActiveInput | TIM_ICInitStruct->ICFilter | TIM_ICInitStruct->ICPrescaler) >> 8U);
/* Select the Polarity and set the CC2E Bit */
MODIFY_REG(TIMx->CCER,
(TIM_CCER_CC2P | TIM_CCER_CC2NP),
((TIM_ICInitStruct->ICPolarity << 4U) | TIM_CCER_CC2E) );
return SUCCESS;
}
/**
* @brief Configure the TIMx input channel 3.
* @param TIMx Timer Instance
* @param TIM_ICInitStruct pointer to the the TIMx input channel 3 configuration data structure
* @retval An ErrorStatus enumeration value:
* - SUCCESS: TIMx registers are de-initialized
* - ERROR: not applicable
*/
static ErrorStatus IC3Config(TIM_TypeDef* TIMx, LL_TIM_IC_InitTypeDef* TIM_ICInitStruct)
{
/* Check the parameters */
assert_param(IS_TIM_CC3_INSTANCE(TIMx));
assert_param(IS_LL_TIM_IC_POLARITY(TIM_ICInitStruct->ICPolarity));
assert_param(IS_LL_TIM_ACTIVEINPUT(TIM_ICInitStruct->ICActiveInput));
assert_param(IS_LL_TIM_ICPSC(TIM_ICInitStruct->ICPrescaler));
assert_param(IS_LL_TIM_IC_FILTER(TIM_ICInitStruct->ICFilter));
/* Disable the Channel 3: Reset the CC3E Bit */
TIMx->CCER &= (uint32_t)~TIM_CCER_CC3E;
/* Select the Input and set the filter and the prescaler value */
MODIFY_REG(TIMx->CCMR2,
(TIM_CCMR2_CC3S | TIM_CCMR2_IC3F | TIM_CCMR2_IC3PSC),
(TIM_ICInitStruct->ICActiveInput | TIM_ICInitStruct->ICFilter | TIM_ICInitStruct->ICPrescaler) >> 16U);
/* Select the Polarity and set the CC3E Bit */
MODIFY_REG(TIMx->CCER,
(TIM_CCER_CC3P | TIM_CCER_CC3NP),
((TIM_ICInitStruct->ICPolarity << 8U) | TIM_CCER_CC3E) );
return SUCCESS;
}
/**
* @brief Configure the TIMx input channel 4.
* @param TIMx Timer Instance
* @param TIM_ICInitStruct pointer to the the TIMx input channel 4 configuration data structure
* @retval An ErrorStatus enumeration value:
* - SUCCESS: TIMx registers are de-initialized
* - ERROR: not applicable
*/
static ErrorStatus IC4Config(TIM_TypeDef* TIMx, LL_TIM_IC_InitTypeDef* TIM_ICInitStruct)
{
/* Check the parameters */
assert_param(IS_TIM_CC4_INSTANCE(TIMx));
assert_param(IS_LL_TIM_IC_POLARITY(TIM_ICInitStruct->ICPolarity));
assert_param(IS_LL_TIM_ACTIVEINPUT(TIM_ICInitStruct->ICActiveInput));
assert_param(IS_LL_TIM_ICPSC(TIM_ICInitStruct->ICPrescaler));
assert_param(IS_LL_TIM_IC_FILTER(TIM_ICInitStruct->ICFilter));
/* Disable the Channel 4: Reset the CC4E Bit */
TIMx->CCER &= (uint32_t)~TIM_CCER_CC4E;
/* Select the Input and set the filter and the prescaler value */
MODIFY_REG(TIMx->CCMR2,
(TIM_CCMR2_CC4S | TIM_CCMR2_IC4F | TIM_CCMR2_IC4PSC),
(TIM_ICInitStruct->ICActiveInput | TIM_ICInitStruct->ICFilter | TIM_ICInitStruct->ICPrescaler) >> 8U);
/* Select the Polarity and set the CC2E Bit */
MODIFY_REG(TIMx->CCER,
(TIM_CCER_CC4P | TIM_CCER_CC4NP),
((TIM_ICInitStruct->ICPolarity << 12U) | TIM_CCER_CC4E) );
return SUCCESS;
}
/**
* @}
*/
/**
* @}
*/
#endif /* TIM1 || TIM3 || TIM21 || TIM22 || TIM6 || TIM7 */
/**
* @}
*/
#endif /* USE_FULL_LL_DRIVER */
/************************ (C) COPYRIGHT STMicroelectronics *****END OF FILE****/
|
the_stack_data/161081869.c | #include <stdio.h>
int main(void){
float a;
scanf("%d", &a);
if( a = 0.0){
a = 2.0;
}
return 0;
} |
the_stack_data/87637384.c | /// 3.2. Se citesc 4 perechi de numere reale, care reprezintă în coordonatele vârfurilor unui patrulater. Să se stabilească natura acestui patrulater.
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
typedef struct { float x, y; } Punct;
float panta(Punct *A, Punct *B){ return (B->y-A->y)/(B->x-A->y); }
float unghi(Punct *A, Punct *B, Punct *C, Punct *D){
float u1, u2;
u1=atan(panta(A, B))*180/M_PI;
u2=atan(panta(C, D))*180/M_PI;
return u2-u1;
}
int trapez(Punct *A, Punct *B, Punct *C, Punct *D){
if(panta(A, B)==panta(C, D) && panta(B, C)!=panta(D, A) || panta(B, C)==panta(D, A) && panta(A, B)!=panta(C, D)) return 1;
return 0;
}
int paralelogram(Punct *A, Punct *B, Punct *C, Punct *D){
if(panta(A, B)==panta(A, D) && panta(B, C)==panta(D, A)) return 1;
return 0;
}
int dreptunghi(Punct *A, Punct *B, Punct *C, Punct *D){
if(abs(unghi(D, A, A, B))==90) return 1;
return 0;
}
int romb(Punct *A, Punct *B, Punct *C, Punct *D){
if(panta(A, C)*panta(B,D)==-1) return 1;
return 0;
}
int patrat(Punct *A, Punct *B, Punct *C, Punct *D)
{
if(dreptunghi(A, B, C, D) && romb(A, B, C, D)) return 1;
return 0;
}
int main()
{
Punct *A, *B, *C, *D;
printf("Cititi varful lui A (x, y): ");
scanf("(%lf, %lf)%*c", &A->x, &A->y);
printf("Cititi varful lui B (x, y): ");
scanf("(%lf, %lf)%*c", &B->x, &B->y);
printf("Cititi varful lui C (x, y): ");
scanf("(%f, %f)%*c", &C->x, &C->y);
printf("Cititi varful lui D (x, y): ");
scanf("(%f, %f)", &D->x, &D->y);
if(patrat(A, B, C, D)==1) printf("ABCD este patrat");
else if(trapez(A, B, C, D)==1) printf("ABCD este trapez");
else if(dreptunghi(A, B, C, D)==1) printf("ABCD este dreptunghi");
else if(romb(A, B, C, D)==1) printf("ABCD este romb");
else if(paralelogram(A, B, C, D)) printf("ABCD este paralelogram");
return 0;
}
|
the_stack_data/200144287.c | #include <stdio.h>
int main() {
// Um printf basico
printf("\nSistema em teste, so para entender os laços em C\n");
int A = 0, B = 7, C = 4, D = 3, Z = 0;
for (A = 0; A < B; A++)
{
D = D + 1;
}
for (int i = 100; i <= 200; i++)
{
int D = i;
printf("Sobrou zero >> %d D=%d \n", i, D);
}
// Assim que mistura strings e variaveis dentro do printf
printf("\nResultado para for >%d< %s", Z, "\n\n");
//É o calculo??
printf("Calculando o divisão resto da divisão? > %d \n\n", 100%5);
//for (A = 0; A <= C; A++)
//{
// D = D + 2;
//}
if (D >= 20)
{
printf("\n%d %s", D, " - ");
printf("SISTEMA OPERACIONAIS\n");
}
else
{
printf("%d %s", D, " - ");
printf("REDES DE COMPUTADORES\n");
}
return 0;
}
|
the_stack_data/59513608.c | #ifndef lint
static char yysccsid[] = "@(#)yaccpar 1.9 (Berkeley) 02/21/93";
#endif
#define YYBYACC 1
#define YYMAJOR 1
#define YYMINOR 9
#define yyclearin (yychar=(-1))
#define yyerrok (yyerrflag=0)
#define YYRECOVERING (yyerrflag!=0)
#define YYPREFIX "yy"
#define YYERRCODE 256
short yylhs[] = { -1,
0,
};
short yylen[] = { 2,
1,
};
short yydefred[] = { 0,
1, 0,
};
short yydgoto[] = { 2,
};
short yysindex[] = { -256,
0, 0,
};
short yyrindex[] = { 0,
0, 0,
};
short yygindex[] = { 0,
};
#define YYTABLESIZE 0
short yytable[] = { 1,
};
short yycheck[] = { 256,
};
#define YYFINAL 2
#ifndef YYDEBUG
#define YYDEBUG 0
#endif
#define YYMAXTOKEN 0
#if YYDEBUG
char *yyname[] = {
"end-of-file",
};
char *yyrule[] = {
"$accept : S",
"S : error",
};
#endif
#ifndef YYSTYPE
typedef int YYSTYPE;
#endif
#ifdef YYSTACKSIZE
#undef YYMAXDEPTH
#define YYMAXDEPTH YYSTACKSIZE
#else
#ifdef YYMAXDEPTH
#define YYSTACKSIZE YYMAXDEPTH
#else
#define YYSTACKSIZE 500
#define YYMAXDEPTH 500
#endif
#endif
int yydebug;
int yynerrs;
int yyerrflag;
int yychar;
short *yyssp;
YYSTYPE *yyvsp;
YYSTYPE yyval;
YYSTYPE yylval;
short yyss[YYSTACKSIZE];
YYSTYPE yyvs[YYSTACKSIZE];
#define yystacksize YYSTACKSIZE
#line 4 "error.y"
main(){printf("yyparse() = %d\n",yyparse());}
yylex(){return-1;}
yyerror(s)char*s;{printf("%s\n",s);}
#line 80 "error.tab.c"
#define YYABORT goto yyabort
#define YYREJECT goto yyabort
#define YYACCEPT goto yyaccept
#define YYERROR goto yyerrlab
int
yyparse()
{
register int yym, yyn, yystate;
#if YYDEBUG
register char *yys;
extern char *getenv();
if (yys = getenv("YYDEBUG"))
{
yyn = *yys;
if (yyn >= '0' && yyn <= '9')
yydebug = yyn - '0';
}
#endif
yynerrs = 0;
yyerrflag = 0;
yychar = (-1);
yyssp = yyss;
yyvsp = yyvs;
*yyssp = yystate = 0;
yyloop:
if (yyn = yydefred[yystate]) goto yyreduce;
if (yychar < 0)
{
if ((yychar = yylex()) < 0) yychar = 0;
#if YYDEBUG
if (yydebug)
{
yys = 0;
if (yychar <= YYMAXTOKEN) yys = yyname[yychar];
if (!yys) yys = "illegal-symbol";
printf("%sdebug: state %d, reading %d (%s)\n",
YYPREFIX, yystate, yychar, yys);
}
#endif
}
if ((yyn = yysindex[yystate]) && (yyn += yychar) >= 0 &&
yyn <= YYTABLESIZE && yycheck[yyn] == yychar)
{
#if YYDEBUG
if (yydebug)
printf("%sdebug: state %d, shifting to state %d\n",
YYPREFIX, yystate, yytable[yyn]);
#endif
if (yyssp >= yyss + yystacksize - 1)
{
goto yyoverflow;
}
*++yyssp = yystate = yytable[yyn];
*++yyvsp = yylval;
yychar = (-1);
if (yyerrflag > 0) --yyerrflag;
goto yyloop;
}
if ((yyn = yyrindex[yystate]) && (yyn += yychar) >= 0 &&
yyn <= YYTABLESIZE && yycheck[yyn] == yychar)
{
yyn = yytable[yyn];
goto yyreduce;
}
if (yyerrflag) goto yyinrecovery;
#ifdef lint
goto yynewerror;
#endif
yynewerror:
yyerror("syntax error");
#ifdef lint
goto yyerrlab;
#endif
yyerrlab:
++yynerrs;
yyinrecovery:
if (yyerrflag < 3)
{
yyerrflag = 3;
for (;;)
{
if ((yyn = yysindex[*yyssp]) && (yyn += YYERRCODE) >= 0 &&
yyn <= YYTABLESIZE && yycheck[yyn] == YYERRCODE)
{
#if YYDEBUG
if (yydebug)
printf("%sdebug: state %d, error recovery shifting\
to state %d\n", YYPREFIX, *yyssp, yytable[yyn]);
#endif
if (yyssp >= yyss + yystacksize - 1)
{
goto yyoverflow;
}
*++yyssp = yystate = yytable[yyn];
*++yyvsp = yylval;
goto yyloop;
}
else
{
#if YYDEBUG
if (yydebug)
printf("%sdebug: error recovery discarding state %d\n",
YYPREFIX, *yyssp);
#endif
if (yyssp <= yyss) goto yyabort;
--yyssp;
--yyvsp;
}
}
}
else
{
if (yychar == 0) goto yyabort;
#if YYDEBUG
if (yydebug)
{
yys = 0;
if (yychar <= YYMAXTOKEN) yys = yyname[yychar];
if (!yys) yys = "illegal-symbol";
printf("%sdebug: state %d, error recovery discards token %d (%s)\n",
YYPREFIX, yystate, yychar, yys);
}
#endif
yychar = (-1);
goto yyloop;
}
yyreduce:
#if YYDEBUG
if (yydebug)
printf("%sdebug: state %d, reducing by rule %d (%s)\n",
YYPREFIX, yystate, yyn, yyrule[yyn]);
#endif
yym = yylen[yyn];
yyval = yyvsp[1-yym];
switch (yyn)
{
}
yyssp -= yym;
yystate = *yyssp;
yyvsp -= yym;
yym = yylhs[yyn];
if (yystate == 0 && yym == 0)
{
#if YYDEBUG
if (yydebug)
printf("%sdebug: after reduction, shifting from state 0 to\
state %d\n", YYPREFIX, YYFINAL);
#endif
yystate = YYFINAL;
*++yyssp = YYFINAL;
*++yyvsp = yyval;
if (yychar < 0)
{
if ((yychar = yylex()) < 0) yychar = 0;
#if YYDEBUG
if (yydebug)
{
yys = 0;
if (yychar <= YYMAXTOKEN) yys = yyname[yychar];
if (!yys) yys = "illegal-symbol";
printf("%sdebug: state %d, reading %d (%s)\n",
YYPREFIX, YYFINAL, yychar, yys);
}
#endif
}
if (yychar == 0) goto yyaccept;
goto yyloop;
}
if ((yyn = yygindex[yym]) && (yyn += yystate) >= 0 &&
yyn <= YYTABLESIZE && yycheck[yyn] == yystate)
yystate = yytable[yyn];
else
yystate = yydgoto[yym];
#if YYDEBUG
if (yydebug)
printf("%sdebug: after reduction, shifting from state %d \
to state %d\n", YYPREFIX, *yyssp, yystate);
#endif
if (yyssp >= yyss + yystacksize - 1)
{
goto yyoverflow;
}
*++yyssp = yystate;
*++yyvsp = yyval;
goto yyloop;
yyoverflow:
yyerror("yacc stack overflow");
yyabort:
return (1);
yyaccept:
return (0);
}
|
the_stack_data/64200782.c | #include <stdio.h>
#define SIZE 10
int ar[SIZE];
int top1 = -1;
int top2 = SIZE;
//Functions to push data
void push_stack1 (int data)
{
if (top1 < top2 - 1)
{
ar[++top1] = data;
}
else
{
printf ("Stack Full! Cannot Push\n");
}
}
void push_stack2 (int data)
{
if (top1 < top2 - 1)
{
ar[--top2] = data;
}
else
{
printf ("Stack Full! Cannot Push\n");
}
}
//Functions to pop data
void pop_stack1 ()
{
if (top1 >= 0)
{
int popped_value = ar[top1--];
printf ("%d is being popped from Stack 1\n", popped_value);
}
else
{
printf ("Stack Empty! Cannot Pop\n");
}
}
void pop_stack2 ()
{
if (top2 < SIZE)
{
int popped_value = ar[top2++];
printf ("%d is being popped from Stack 2\n", popped_value);
}
else
{
printf ("Stack Empty! Cannot Pop\n");
}
}
//Functions to Print Stack 1 and Stack 2
void print_stack1 ()
{
int i;
for (i = top1; i >= 0; --i)
{
printf ("%d ", ar[i]);
}
printf ("\n");
}
void print_stack2 ()
{
int i;
for (i = top2; i < SIZE; ++i)
{
printf ("%d ", ar[i]);
}
printf ("\n");
}
int main()
{
int ar[SIZE];
int i;
int num_of_ele;
printf ("We can push a total of 10 values\n");
//Number of elements pushed in stack 1 is 6
//Number of elements pushed in stack 2 is 4
for (i = 1; i <= 6; ++i)
{
push_stack1 (i);
printf ("Value Pushed in Stack 1 is %d\n", i);
}
for (i = 1; i <= 4; ++i)
{
push_stack2 (i);
printf ("Value Pushed in Stack 2 is %d\n", i);
}
//Print Both Stacks
print_stack1 ();
print_stack2 ();
//Pushing on Stack Full
printf ("Pushing Value in Stack 1 is %d\n", 11);
push_stack1 (11);
//Popping All Elements From Stack 1
num_of_ele = top1 + 1;
while (num_of_ele)
{
pop_stack1 ();
--num_of_ele;
}
//Trying to Pop From Empty Stack
pop_stack1 ();
return 0;
} |
the_stack_data/115516.c | #include <stdio.h>
#include <stdlib.h>
struct node
{
int data;
struct node *next;
struct node *prev;
};
struct node *head;
void create()
{
int ch;
struct node *temp,*newn;
do
{
newn=(struct node *)malloc(sizeof(struct node));
printf("Enter data : ");
scanf("%d",&newn->data);
newn->next=0;
if(head==0)
{
head=newn;
temp=newn;
newn->prev=0;
}
else
{
temp->next=newn;
newn->prev=temp;
temp=newn;
}
printf("Enter 1 to create another node and 0 to exit : ");
scanf("%d",&ch);
}while(ch==1);
}
void ins_beg()
{
struct node *newn;
newn=(struct node *)malloc(sizeof(struct node));
printf("Enter data : ");
scanf("%d",&newn->data);
newn->next=head;
newn->prev=0;
head->prev=newn;
head=newn;
}
void ins_end()
{
struct node *temp,*newn;
newn=(struct node *)malloc(sizeof(struct node));
printf("Enter data : ");
scanf("%d",&newn->data);
newn->next=0;
temp=head;
while(temp->next!=0)
temp=temp->next;
temp->next=newn;
newn->prev=temp;
}
void ins_aft()
{
int d;
struct node *temp,*newn;
printf("Enter the data in the node after which you want the new node : ");
scanf("%d",&d);
newn=(struct node *)malloc(sizeof(struct node));
printf("Enter data : ");
scanf("%d",&newn->data);
temp=head;
while(temp->data!=d)
temp=temp->next;
newn->next=temp->next;
newn->prev=temp;
temp->next->prev=newn;
temp->next=newn;
}
void ins_bef()
{
int d;
struct node *temp,*newn;
printf("Enter the data in the node before which you want the new node : ");
scanf("%d",&d);
newn=(struct node *)malloc(sizeof(struct node));
printf("Enter data : ");
scanf("%d",&newn->data);
temp=head;
while(temp->data!=d)
temp=temp->next;
newn->next=temp;
newn->prev=temp->prev;
temp->prev->next=newn;
temp->prev=newn;
}
void del_beg()
{
if(head==0)
{
printf("List empty\n");
}
else
{
struct node *temp;
temp=head;
head=head->next;
head->prev=0;
printf("%d deleted\n",temp->data);
free(temp);
}
}
void del_end()
{
if(head==0)
{
printf("List empty\n");
}
else
{
struct node *temp;
temp=head;
while(temp->next!=0)
temp=temp->next;
temp->prev->next=0;
printf("%d deleted\n",temp->data);
free(temp);
}
}
void disp()
{
struct node *temp;
printf("The linked list currently contains\n");
temp=head;
while(temp!=0)
{
printf("%d ",temp->data);
temp=temp->next;
}
printf("\n");
}
void del_aft()
{
if(head==0)
{
printf("List empty\n");
}
else
{
int d;
struct node *temp;
temp=head;
printf("Enter the data in the node after which you want the to delete node : ");
scanf("%d",&d);
while(temp->data!=d)
temp=temp->next;
temp->next->next->prev=temp;
temp->next=temp->next->next;
temp=temp->next;
printf("%d deleted\n",temp->data);
free(temp);
}
}
void del_bef()
{
if(head==0)
{
printf("List empty\n");
}
else
{
int d;
struct node *temp,*prevvn,*prevn;
temp=head;
printf("Enter the data in the node after which you want the to delete node : ");
scanf("%d",&d);
while(temp->data!=d)
{
temp=temp->next;
if(temp==0)
break;
}
if(temp==0)
printf("Node not found\n");
else
{
temp->prev=temp->prev->prev;
temp->prev->prev->next=temp;
temp=temp->prev;
printf("%d deleted\n",temp->data);
free(temp);
}
}
}
int main()
{
int ch;
head=0;
printf("1.Create Linked List\n2.Start with an empty list\nEnter choice: ");
scanf("%d",&ch);
if(ch==1)
create();
do
{
printf("*************** Main Menu ***********\n");
printf("1.Insert node at beginning\n2.Insert node at end\n3.Insert node after a specified node\n4.Insert node before a specified node\n5.Delete node from beginning\n6.Delete node from end\n7.Delete node after a specified node\n8.Delete node before a specified node\n9.Display List\n10.Exit\nEnter choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1:
ins_beg();
break;
case 2:
ins_end();
break;
case 3:
ins_aft();
break;
case 4:
ins_bef();
break;
case 5:
del_beg();
break;
case 6:
del_end();
break;
case 7:
del_aft();
break;
case 8:
del_bef();
break;
case 9:
disp();
break;
case 10:
break;
default:
printf("Wrong choice\n");
}
}while(ch!=10);
return 0;
}
|
the_stack_data/433985.c | #include<stdio.h>
#include<stdlib.h>
void f_iter(int *a, int s, int f)
{
int t;
while(s < f)
{
t = a[s];
a[s] = a[f];
a[f] = t;
s++;
f--;
}
}
void f_rec(int *a, int s, int f)
{
int t;
if(s < f)
{
t = a[s];
a[s] = a[f];
a[f] = t;
f_rec(a, s+1, f-1);
}
}
#define N 10
int main()
{
int arr[N] = {95, 86, 79, 63, 52, 41, 34, 28, 17, 6};
int s, f, i;
s = 0;
f = N-1;
f_iter(arr, s, f);
printf("f_iter : ");
i = 0;
while(i < N)
{
printf("%d ", arr[i]);
i++;
}
printf("\n");
s = 0;
f = N-1;
f_rec(arr, s, f);
printf("f_rec : ");
i = 0;
while(i < N)
{
printf("%d ", arr[i]);
i++;
}
printf("\n");
return 0;
}
|
the_stack_data/132250.c | /*
Name - Nikhil Ranjan Nayak
Regd no - 1641012040
Desc - sin & cos table.
*/
#include "stdio.h"
#include "math.h"
#define PI 3.14
void main()
{
int init_degree, final_degree, step_degree;
printf("\nEnter initial degree - ");
scanf("%d", &init_degree);
printf("\nEnter final degree - ");
scanf("%d", &final_degree);
printf("\nEnter step degree - ");
scanf("%d", &step_degree);
while(init_degree <= final_degree)
{
printf("\nsin(%d) %7c %d", init_degree, ' ',sin(init_degree));
printf("\ncos(%d) %7c %d", init_degree, ' ',cos(init_degree));
init_degree += step_degree;
}
printf("\n");
}
|
the_stack_data/220455982.c | #include <stdio.h>
void main()
{
putchar(EOF);
}
|
the_stack_data/43886902.c | #include <stdio.h>
#include <stdlib.h>
int main()
{
int i;
for(i=2;i<=100;i=i+2)
printf("%d\n",i);
return 0;
}
|
the_stack_data/179830828.c | // RUN: %clang_asan -O2 %s -o %t
// RUN: env ASAN_OPTIONS="$ASAN_OPTIONS:sleep_before_dying=1" not %run %t 2>&1 | FileCheck %s
#include <stdlib.h>
int main() {
char *x = (char*)malloc(10 * sizeof(char));
free(x);
return x[5];
// CHECK: Sleeping for 1 second
}
|
the_stack_data/132952569.c | // WARNING in uvc_scan_chain_forward
// https://syzkaller.appspot.com/bug?id=1f6bfa19402df8149a7c8f2faf588246e758186d
// status:open
// autogenerated by syzkaller (https://github.com/google/syzkaller)
#define _GNU_SOURCE
#include <endian.h>
#include <errno.h>
#include <fcntl.h>
#include <stdarg.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/mount.h>
#include <sys/stat.h>
#include <sys/syscall.h>
#include <sys/types.h>
#include <unistd.h>
#include <linux/usb/ch9.h>
unsigned long long procid;
static void sleep_ms(uint64_t ms)
{
usleep(ms * 1000);
}
#define MAX_FDS 30
#define USB_MAX_IFACE_NUM 4
#define USB_MAX_EP_NUM 32
struct usb_iface_index {
struct usb_interface_descriptor* iface;
uint8_t bInterfaceNumber;
uint8_t bAlternateSetting;
uint8_t bInterfaceClass;
struct usb_endpoint_descriptor eps[USB_MAX_EP_NUM];
int eps_num;
};
struct usb_device_index {
struct usb_device_descriptor* dev;
struct usb_config_descriptor* config;
uint8_t bDeviceClass;
uint8_t bMaxPower;
int config_length;
struct usb_iface_index ifaces[USB_MAX_IFACE_NUM];
int ifaces_num;
int iface_cur;
};
static bool parse_usb_descriptor(char* buffer, size_t length,
struct usb_device_index* index)
{
if (length < sizeof(*index->dev) + sizeof(*index->config))
return false;
memset(index, 0, sizeof(*index));
index->dev = (struct usb_device_descriptor*)buffer;
index->config = (struct usb_config_descriptor*)(buffer + sizeof(*index->dev));
index->bDeviceClass = index->dev->bDeviceClass;
index->bMaxPower = index->config->bMaxPower;
index->config_length = length - sizeof(*index->dev);
index->iface_cur = -1;
size_t offset = 0;
while (true) {
if (offset + 1 >= length)
break;
uint8_t desc_length = buffer[offset];
uint8_t desc_type = buffer[offset + 1];
if (desc_length <= 2)
break;
if (offset + desc_length > length)
break;
if (desc_type == USB_DT_INTERFACE &&
index->ifaces_num < USB_MAX_IFACE_NUM) {
struct usb_interface_descriptor* iface =
(struct usb_interface_descriptor*)(buffer + offset);
index->ifaces[index->ifaces_num].iface = iface;
index->ifaces[index->ifaces_num].bInterfaceNumber =
iface->bInterfaceNumber;
index->ifaces[index->ifaces_num].bAlternateSetting =
iface->bAlternateSetting;
index->ifaces[index->ifaces_num].bInterfaceClass = iface->bInterfaceClass;
index->ifaces_num++;
}
if (desc_type == USB_DT_ENDPOINT && index->ifaces_num > 0) {
struct usb_iface_index* iface = &index->ifaces[index->ifaces_num - 1];
if (iface->eps_num < USB_MAX_EP_NUM) {
memcpy(&iface->eps[iface->eps_num], buffer + offset,
sizeof(iface->eps[iface->eps_num]));
iface->eps_num++;
}
}
offset += desc_length;
}
return true;
}
#define UDC_NAME_LENGTH_MAX 128
struct usb_raw_init {
__u8 driver_name[UDC_NAME_LENGTH_MAX];
__u8 device_name[UDC_NAME_LENGTH_MAX];
__u8 speed;
};
enum usb_raw_event_type {
USB_RAW_EVENT_INVALID,
USB_RAW_EVENT_CONNECT,
USB_RAW_EVENT_CONTROL,
};
struct usb_raw_event {
__u32 type;
__u32 length;
__u8 data[0];
};
struct usb_raw_ep_io {
__u16 ep;
__u16 flags;
__u32 length;
__u8 data[0];
};
#define USB_RAW_IOCTL_INIT _IOW('U', 0, struct usb_raw_init)
#define USB_RAW_IOCTL_RUN _IO('U', 1)
#define USB_RAW_IOCTL_EVENT_FETCH _IOR('U', 2, struct usb_raw_event)
#define USB_RAW_IOCTL_EP0_WRITE _IOW('U', 3, struct usb_raw_ep_io)
#define USB_RAW_IOCTL_EP0_READ _IOWR('U', 4, struct usb_raw_ep_io)
#define USB_RAW_IOCTL_EP_ENABLE _IOW('U', 5, struct usb_endpoint_descriptor)
#define USB_RAW_IOCTL_EP_DISABLE _IOW('U', 6, __u32)
#define USB_RAW_IOCTL_EP_WRITE _IOW('U', 7, struct usb_raw_ep_io)
#define USB_RAW_IOCTL_EP_READ _IOWR('U', 8, struct usb_raw_ep_io)
#define USB_RAW_IOCTL_CONFIGURE _IO('U', 9)
#define USB_RAW_IOCTL_VBUS_DRAW _IOW('U', 10, __u32)
static int usb_raw_open()
{
return open("/dev/raw-gadget", O_RDWR);
}
static int usb_raw_init(int fd, uint32_t speed, const char* driver,
const char* device)
{
struct usb_raw_init arg;
strncpy((char*)&arg.driver_name[0], driver, sizeof(arg.driver_name));
strncpy((char*)&arg.device_name[0], device, sizeof(arg.device_name));
arg.speed = speed;
return ioctl(fd, USB_RAW_IOCTL_INIT, &arg);
}
static int usb_raw_run(int fd)
{
return ioctl(fd, USB_RAW_IOCTL_RUN, 0);
}
static int usb_raw_event_fetch(int fd, struct usb_raw_event* event)
{
return ioctl(fd, USB_RAW_IOCTL_EVENT_FETCH, event);
}
static int usb_raw_ep0_write(int fd, struct usb_raw_ep_io* io)
{
return ioctl(fd, USB_RAW_IOCTL_EP0_WRITE, io);
}
static int usb_raw_ep0_read(int fd, struct usb_raw_ep_io* io)
{
return ioctl(fd, USB_RAW_IOCTL_EP0_READ, io);
}
static int usb_raw_ep_enable(int fd, struct usb_endpoint_descriptor* desc)
{
return ioctl(fd, USB_RAW_IOCTL_EP_ENABLE, desc);
}
static int usb_raw_ep_disable(int fd, int ep)
{
return ioctl(fd, USB_RAW_IOCTL_EP_DISABLE, ep);
}
static int usb_raw_configure(int fd)
{
return ioctl(fd, USB_RAW_IOCTL_CONFIGURE, 0);
}
static int usb_raw_vbus_draw(int fd, uint32_t power)
{
return ioctl(fd, USB_RAW_IOCTL_VBUS_DRAW, power);
}
#define MAX_USB_FDS 6
struct usb_info {
int fd;
struct usb_device_index index;
};
static struct usb_info usb_devices[MAX_USB_FDS];
static int usb_devices_num;
static struct usb_device_index* add_usb_index(int fd, char* dev, size_t dev_len)
{
int i = __atomic_fetch_add(&usb_devices_num, 1, __ATOMIC_RELAXED);
if (i >= MAX_USB_FDS)
return NULL;
int rv = 0;
rv = parse_usb_descriptor(dev, dev_len, &usb_devices[i].index);
if (!rv)
return NULL;
__atomic_store_n(&usb_devices[i].fd, fd, __ATOMIC_RELEASE);
return &usb_devices[i].index;
}
static struct usb_device_index* lookup_usb_index(int fd)
{
int i;
for (i = 0; i < MAX_USB_FDS; i++) {
if (__atomic_load_n(&usb_devices[i].fd, __ATOMIC_ACQUIRE) == fd) {
return &usb_devices[i].index;
}
}
return NULL;
}
static void set_interface(int fd, int n)
{
struct usb_device_index* index = lookup_usb_index(fd);
int ep;
if (!index)
return;
if (index->iface_cur >= 0 && index->iface_cur < index->ifaces_num) {
for (ep = 0; ep < index->ifaces[index->iface_cur].eps_num; ep++) {
int rv = usb_raw_ep_disable(fd, ep);
if (rv < 0) {
} else {
}
}
}
if (n >= 0 && n < index->ifaces_num) {
for (ep = 0; ep < index->ifaces[n].eps_num; ep++) {
int rv = usb_raw_ep_enable(fd, &index->ifaces[n].eps[ep]);
if (rv < 0) {
} else {
}
}
index->iface_cur = n;
}
}
static int configure_device(int fd)
{
struct usb_device_index* index = lookup_usb_index(fd);
if (!index)
return -1;
int rv = usb_raw_vbus_draw(fd, index->bMaxPower);
if (rv < 0) {
return rv;
}
rv = usb_raw_configure(fd);
if (rv < 0) {
return rv;
}
set_interface(fd, 0);
return 0;
}
#define USB_MAX_PACKET_SIZE 1024
struct usb_raw_control_event {
struct usb_raw_event inner;
struct usb_ctrlrequest ctrl;
char data[USB_MAX_PACKET_SIZE];
};
struct usb_raw_ep_io_data {
struct usb_raw_ep_io inner;
char data[USB_MAX_PACKET_SIZE];
};
struct vusb_connect_string_descriptor {
uint32_t len;
char* str;
} __attribute__((packed));
struct vusb_connect_descriptors {
uint32_t qual_len;
char* qual;
uint32_t bos_len;
char* bos;
uint32_t strs_len;
struct vusb_connect_string_descriptor strs[0];
} __attribute__((packed));
static const char default_string[] = {8, USB_DT_STRING, 's', 0, 'y', 0, 'z', 0};
static const char default_lang_id[] = {4, USB_DT_STRING, 0x09, 0x04};
static bool lookup_connect_response(int fd,
struct vusb_connect_descriptors* descs,
struct usb_ctrlrequest* ctrl,
char** response_data,
uint32_t* response_length)
{
struct usb_device_index* index = lookup_usb_index(fd);
uint8_t str_idx;
if (!index)
return false;
switch (ctrl->bRequestType & USB_TYPE_MASK) {
case USB_TYPE_STANDARD:
switch (ctrl->bRequest) {
case USB_REQ_GET_DESCRIPTOR:
switch (ctrl->wValue >> 8) {
case USB_DT_DEVICE:
*response_data = (char*)index->dev;
*response_length = sizeof(*index->dev);
return true;
case USB_DT_CONFIG:
*response_data = (char*)index->config;
*response_length = index->config_length;
return true;
case USB_DT_STRING:
str_idx = (uint8_t)ctrl->wValue;
if (descs && str_idx < descs->strs_len) {
*response_data = descs->strs[str_idx].str;
*response_length = descs->strs[str_idx].len;
return true;
}
if (str_idx == 0) {
*response_data = (char*)&default_lang_id[0];
*response_length = default_lang_id[0];
return true;
}
*response_data = (char*)&default_string[0];
*response_length = default_string[0];
return true;
case USB_DT_BOS:
*response_data = descs->bos;
*response_length = descs->bos_len;
return true;
case USB_DT_DEVICE_QUALIFIER:
if (!descs->qual) {
struct usb_qualifier_descriptor* qual =
(struct usb_qualifier_descriptor*)response_data;
qual->bLength = sizeof(*qual);
qual->bDescriptorType = USB_DT_DEVICE_QUALIFIER;
qual->bcdUSB = index->dev->bcdUSB;
qual->bDeviceClass = index->dev->bDeviceClass;
qual->bDeviceSubClass = index->dev->bDeviceSubClass;
qual->bDeviceProtocol = index->dev->bDeviceProtocol;
qual->bMaxPacketSize0 = index->dev->bMaxPacketSize0;
qual->bNumConfigurations = index->dev->bNumConfigurations;
qual->bRESERVED = 0;
*response_length = sizeof(*qual);
return true;
}
*response_data = descs->qual;
*response_length = descs->qual_len;
return true;
default:
exit(1);
return false;
}
break;
default:
exit(1);
return false;
}
break;
default:
exit(1);
return false;
}
return false;
}
static volatile long syz_usb_connect(volatile long a0, volatile long a1,
volatile long a2, volatile long a3)
{
uint64_t speed = a0;
uint64_t dev_len = a1;
char* dev = (char*)a2;
struct vusb_connect_descriptors* descs = (struct vusb_connect_descriptors*)a3;
if (!dev) {
return -1;
}
int fd = usb_raw_open();
if (fd < 0) {
return fd;
}
if (fd >= MAX_FDS) {
close(fd);
return -1;
}
struct usb_device_index* index = add_usb_index(fd, dev, dev_len);
if (!index) {
return -1;
}
char device[32];
sprintf(&device[0], "dummy_udc.%llu", procid);
int rv = usb_raw_init(fd, speed, "dummy_udc", &device[0]);
if (rv < 0) {
return rv;
}
rv = usb_raw_run(fd);
if (rv < 0) {
return rv;
}
bool done = false;
while (!done) {
struct usb_raw_control_event event;
event.inner.type = 0;
event.inner.length = sizeof(event.ctrl);
rv = usb_raw_event_fetch(fd, (struct usb_raw_event*)&event);
if (rv < 0) {
return rv;
}
if (event.inner.type != USB_RAW_EVENT_CONTROL)
continue;
bool response_found = false;
char* response_data = NULL;
uint32_t response_length = 0;
if (event.ctrl.bRequestType & USB_DIR_IN) {
response_found = lookup_connect_response(
fd, descs, &event.ctrl, &response_data, &response_length);
if (!response_found) {
return -1;
}
} else {
if ((event.ctrl.bRequestType & USB_TYPE_MASK) != USB_TYPE_STANDARD ||
event.ctrl.bRequest != USB_REQ_SET_CONFIGURATION) {
exit(1);
return -1;
}
done = true;
}
if (done) {
rv = configure_device(fd);
if (rv < 0) {
return rv;
}
}
struct usb_raw_ep_io_data response;
response.inner.ep = 0;
response.inner.flags = 0;
if (response_length > sizeof(response.data))
response_length = 0;
if (event.ctrl.wLength < response_length)
response_length = event.ctrl.wLength;
response.inner.length = response_length;
if (response_data)
memcpy(&response.data[0], response_data, response_length);
else
memset(&response.data[0], 0, response_length);
if (event.ctrl.bRequestType & USB_DIR_IN) {
rv = usb_raw_ep0_write(fd, (struct usb_raw_ep_io*)&response);
} else {
rv = usb_raw_ep0_read(fd, (struct usb_raw_ep_io*)&response);
}
if (rv < 0) {
return rv;
}
}
sleep_ms(200);
return fd;
}
int main(void)
{
syscall(__NR_mmap, 0x20000000ul, 0x1000000ul, 3ul, 0x32ul, -1, 0);
memcpy((void*)0x20000140,
"\x12\x01\x00\x00\x5b\x84\x33\x20\xcd\x18\xfe\xca\xe3\x99\x01\x02\x03"
"\x01\x09\x02\x50\x00\x01\x00\x00\x00\x00\x09\x04\x00\x00\x00\x0e\x01"
"\x00\x00\x09\x24\x03\x00\x00\x03\x00\x00\x00\x00\x00\x00\x13\x24\x06"
"\x00\x00\x06\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x05"
"\x24\x05\x00\x00\x0b\x24\x06\x00\x00\x02\x00\x00\x00\x00\x00",
83);
syz_usb_connect(0, 0x62, 0x20000140, 0);
return 0;
}
|
the_stack_data/713268.c | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <stdbool.h>
#include <string.h>
#define DIMC_VERSION "0.050"
extern int opterr;
int main (int argc, char *argv[]) {
int opt;
bool use_post_copy = false;
char *output_file_path;
char *input_file_path;
opterr = 0;
while ((opt = getopt(argc, argv, "Vco:")) != -1) {
switch(opt) {
case 'c':
use_post_copy = true;
break;
case 'o':
output_file_path = optarg;
break;
case 'V':
printf("dimc version %s\n", DIMC_VERSION);
exit(0);
case '?':
if (optopt == 'o')
fprintf(stderr, "Option -%c requires an argument\n", optopt);
else
fprintf(stderr, "Unknown option -%c\n", optopt);
return 1;
default:
fprintf(stderr, "Usage: %s [-c] [-o output_file] input_file\n", argv[0]);
exit(1);
}
}
if (optind >= argc) {
fprintf(stderr, "One input file is required..");
exit(1);
} else {
input_file_path = argv[optind];
}
if (use_post_copy == true)
printf("Post-process copy is on\n");
printf("Input file: %s\n", input_file_path);
printf("Output file: %s\n", output_file_path);
FILE *input_file, *output_file;
input_file = fopen(input_file_path, "r");
if (input_file == NULL) {
fprintf(stderr, "Can't open source file %s\n", input_file_path);
exit(1);
}
fseek(input_file, 0, SEEK_END);
long in_file_size = ftell(input_file);
fseek(input_file, 0, SEEK_SET);
char *in_file_content = malloc(in_file_size);
fread(in_file_content, 1, in_file_size, input_file);
fclose(input_file);
/*output_file = fopen(output_file_path, "w");
if (output_file == NULL) {
fprintf(stderr, "Can't open destination file %s\n", output_file_path);
exit(1);
}*/
char *line;
line = strtok(in_file_content, "\r\n");
while (line != NULL) {
printf("%s\n", line);
line = strtok(NULL, "\r\n");
}
} |
the_stack_data/59512580.c | #include <stdio.h>
#include <stdlib.h>
int main()
{
int c = 0, a , b;
do {
printf("Informe um número: ");
scanf("%d", &b);
if(c != 1) {
a = b;
} else if(c == 1 && b == 0) {
c--;
}
c++;
} while (c < 2);
printf("Resultado de %d / %d é %d", a, b, a / b);
return 0;
} |
the_stack_data/150140143.c | /**
* @file test_avalon_enable.c
* @author Franz Luepke
* @date 8 March 2021
* @version 0.1
* @brief A Linux user space program that communicates with the avalon_enable.c LKM. It passes a
* int to the LKM and the enable with this number. For this example to work the device
* must be called /dev/avalon_enable.
*/
#include<stdio.h>
#include<stdlib.h>
#include<errno.h>
#include<fcntl.h>
#include<string.h>
#include<unistd.h>
// DEFINITIONS
#define DEVICES 1 // Number of devices of the same type
#define BUFFER_LENGTH 256 // The buffer length (crude but fine)
#define LOOP_DELAY 10000 // Delay in us
// Constants
const char *pathname = "/dev/avalon_enable";
const void* buffer;
// STATIC CHARS
static char receive[BUFFER_LENGTH]; // The receive buffer from the LKM
// MAIN FUNCTION
int main(int argc, char ** argv)
{
int ret;
int fd;
int index;
int value;
// char buffer[BUFFER_LENGTH];
// printf("Starting device test code example...\n");
// Arguments
if(argc != 3)
{
printf(" Please enter two arguments: motor_select \t state\n");
exit(EXIT_FAILURE);
}
index = atoi(argv[1]);
value = atoi(argv[2]);
// Open devices
printf(" Open devices...\n");
fd = open(pathname, O_RDWR); // Open the device with read/write access
if (fd < 0)
{
perror(" Failed to open the device.");
return errno;
}
// // Writing operations
// for (int i = 0; i < 2; ++i)
// {
// lseek(fd, i*4, SEEK_SET);
// sprintf(buffer, "%d", 0);
// printf(" Buffer: %s\n", buffer);
// ret = write(fd, buffer, sizeof(buffer)); // Send the string to the LKM
// if (ret < 0)
// {
// perror(" Failed to write the message to the device.");
// return errno;
// }
// }
// buffer = (const void*) index;
// sprintf(buffer, "%d", 3);
printf(" Index = %d\t Value: %d\n", index, value);
// std::string s = std::to_string(msg->data);
// int number = (int)strtol(s.c_str(), NULL, 10);
// int number = (int) 10;
// const void* buffer = (const void*) number;
buffer = (const void*) value;
lseek(fd, index*4, SEEK_SET);
ret = write(fd, &buffer, sizeof(buffer)); // Send the string to the LKM
if (ret < 0)
{
perror(" Failed to write the message to the device.");
return errno;
}
// lseek(fd, 4, SEEK_SET);
// // lseek(fd, 4, SEEK_CUR);
// sprintf(buffer, "%d", state);
// printf(" Buffer: %s\n", buffer);
// ret = write(fd, buffer, sizeof(buffer)); // Send the string to the LKM
// if (ret < 0)
// {
// perror(" Failed to write the message to the device.");
// return errno;
// }
// Reading operations
for (int i = 0; i < 3; ++i)
{
lseek(fd, i*4, SEEK_SET);
ret = read(fd, receive, BUFFER_LENGTH);
if(ret < 0)
{
perror(" Failed to read message from device");
}
printf(" Num: %d \t State value: [%d]\n", i*4, receive[0]);
}
// // Reading operations
// for (int i = 0; i < 20; ++i)
// {
// lseek(fd, i, SEEK_SET);
// ret = read(fd, receive, BUFFER_LENGTH);
// if(ret < 0)
// {
// perror(" Failed to read message from device");
// }
// printf(" Num: %d \t State value: [%d]\n", i, receive[0]);
// }
// lseek(fd, 0, SEEK_SET);
// ret = read(fd, receive, BUFFER_LENGTH);
// if(ret < 0)
// {
// perror(" Failed to read message from device");
// }
// printf(" Motor value [%d]\n ", receive[0]);
// lseek(fd, 4, SEEK_SET);
// ret = read(fd, receive, BUFFER_LENGTH);
// if(ret < 0)
// {
// perror(" Failed to read message from device");
// }
// printf(" State value [%d]\n", receive[0]);
printf("End of the program\n");
return 0;
} |
the_stack_data/178264488.c | #include <stdio.h>
/**
* computes whether the chosen year is leap.
* @code rem @return remaindercalculates if divisible.
* @c Leap or not leap.
*/
int main(void)
{
int year, rem4, rem100, rem400;
printf("prompt: ");
scanf("%i", &year);
rem4 = year % 4;
rem100 = year % 100;
rem400 = year % 400;
if ((rem4 == 0 && rem100 != 0) || rem400 == 0) {
puts("It's a leap year.");
}
else {
puts("Nope, is not a leap year.");
}
} |
the_stack_data/24525.c | extern float __VERIFIER_nondet_float(void);
extern int __VERIFIER_nondet_int(void);
typedef enum {false, true} bool;
bool __VERIFIER_nondet_bool(void) {
return __VERIFIER_nondet_int() != 0;
}
int main()
{
bool _EL_X_2381, _x__EL_X_2381;
float x_21, _x_x_21;
float x_9, _x_x_9;
float x_2, _x_x_2;
float x_1, _x_x_1;
float x_13, _x_x_13;
float x_3, _x_x_3;
float x_4, _x_x_4;
float x_16, _x_x_16;
float x_24, _x_x_24;
float x_5, _x_x_5;
float x_6, _x_x_6;
float x_7, _x_x_7;
float x_8, _x_x_8;
bool _EL_X_2379, _x__EL_X_2379;
bool _EL_U_2377, _x__EL_U_2377;
float x_10, _x_x_10;
float x_20, _x_x_20;
float x_11, _x_x_11;
float x_22, _x_x_22;
float x_15, _x_x_15;
float x_17, _x_x_17;
float x_25, _x_x_25;
float x_26, _x_x_26;
float x_12, _x_x_12;
float x_14, _x_x_14;
float x_18, _x_x_18;
float x_19, _x_x_19;
float x_23, _x_x_23;
float x_0, _x_x_0;
float x_27, _x_x_27;
int __steps_to_fair = __VERIFIER_nondet_int();
_EL_X_2381 = __VERIFIER_nondet_bool();
x_21 = __VERIFIER_nondet_float();
x_9 = __VERIFIER_nondet_float();
x_2 = __VERIFIER_nondet_float();
x_1 = __VERIFIER_nondet_float();
x_13 = __VERIFIER_nondet_float();
x_3 = __VERIFIER_nondet_float();
x_4 = __VERIFIER_nondet_float();
x_16 = __VERIFIER_nondet_float();
x_24 = __VERIFIER_nondet_float();
x_5 = __VERIFIER_nondet_float();
x_6 = __VERIFIER_nondet_float();
x_7 = __VERIFIER_nondet_float();
x_8 = __VERIFIER_nondet_float();
_EL_X_2379 = __VERIFIER_nondet_bool();
_EL_U_2377 = __VERIFIER_nondet_bool();
x_10 = __VERIFIER_nondet_float();
x_20 = __VERIFIER_nondet_float();
x_11 = __VERIFIER_nondet_float();
x_22 = __VERIFIER_nondet_float();
x_15 = __VERIFIER_nondet_float();
x_17 = __VERIFIER_nondet_float();
x_25 = __VERIFIER_nondet_float();
x_26 = __VERIFIER_nondet_float();
x_12 = __VERIFIER_nondet_float();
x_14 = __VERIFIER_nondet_float();
x_18 = __VERIFIER_nondet_float();
x_19 = __VERIFIER_nondet_float();
x_23 = __VERIFIER_nondet_float();
x_0 = __VERIFIER_nondet_float();
x_27 = __VERIFIER_nondet_float();
bool __ok = (1 && _EL_X_2381);
while (__steps_to_fair >= 0 && __ok) {
if (((19.0 <= (x_7 + (-1.0 * x_24))) || ( !((19.0 <= (x_7 + (-1.0 * x_24))) || (((x_12 + (-1.0 * x_19)) <= 20.0) && _EL_U_2377))))) {
__steps_to_fair = __VERIFIER_nondet_int();
} else {
__steps_to_fair--;
}
_x__EL_X_2381 = __VERIFIER_nondet_bool();
_x_x_21 = __VERIFIER_nondet_float();
_x_x_9 = __VERIFIER_nondet_float();
_x_x_2 = __VERIFIER_nondet_float();
_x_x_1 = __VERIFIER_nondet_float();
_x_x_13 = __VERIFIER_nondet_float();
_x_x_3 = __VERIFIER_nondet_float();
_x_x_4 = __VERIFIER_nondet_float();
_x_x_16 = __VERIFIER_nondet_float();
_x_x_24 = __VERIFIER_nondet_float();
_x_x_5 = __VERIFIER_nondet_float();
_x_x_6 = __VERIFIER_nondet_float();
_x_x_7 = __VERIFIER_nondet_float();
_x_x_8 = __VERIFIER_nondet_float();
_x__EL_X_2379 = __VERIFIER_nondet_bool();
_x__EL_U_2377 = __VERIFIER_nondet_bool();
_x_x_10 = __VERIFIER_nondet_float();
_x_x_20 = __VERIFIER_nondet_float();
_x_x_11 = __VERIFIER_nondet_float();
_x_x_22 = __VERIFIER_nondet_float();
_x_x_15 = __VERIFIER_nondet_float();
_x_x_17 = __VERIFIER_nondet_float();
_x_x_25 = __VERIFIER_nondet_float();
_x_x_26 = __VERIFIER_nondet_float();
_x_x_12 = __VERIFIER_nondet_float();
_x_x_14 = __VERIFIER_nondet_float();
_x_x_18 = __VERIFIER_nondet_float();
_x_x_19 = __VERIFIER_nondet_float();
_x_x_23 = __VERIFIER_nondet_float();
_x_x_0 = __VERIFIER_nondet_float();
_x_x_27 = __VERIFIER_nondet_float();
__ok = ((((((((((((((((((((((((((((((((x_26 + (-1.0 * _x_x_0)) <= -1.0) && (((x_24 + (-1.0 * _x_x_0)) <= -19.0) && (((x_21 + (-1.0 * _x_x_0)) <= -5.0) && (((x_20 + (-1.0 * _x_x_0)) <= -1.0) && (((x_19 + (-1.0 * _x_x_0)) <= -7.0) && (((x_16 + (-1.0 * _x_x_0)) <= -15.0) && (((x_15 + (-1.0 * _x_x_0)) <= -10.0) && (((x_12 + (-1.0 * _x_x_0)) <= -9.0) && (((x_11 + (-1.0 * _x_x_0)) <= -12.0) && (((x_10 + (-1.0 * _x_x_0)) <= -17.0) && (((x_5 + (-1.0 * _x_x_0)) <= -17.0) && (((x_4 + (-1.0 * _x_x_0)) <= -7.0) && (((x_1 + (-1.0 * _x_x_0)) <= -8.0) && ((x_3 + (-1.0 * _x_x_0)) <= -16.0)))))))))))))) && (((x_26 + (-1.0 * _x_x_0)) == -1.0) || (((x_24 + (-1.0 * _x_x_0)) == -19.0) || (((x_21 + (-1.0 * _x_x_0)) == -5.0) || (((x_20 + (-1.0 * _x_x_0)) == -1.0) || (((x_19 + (-1.0 * _x_x_0)) == -7.0) || (((x_16 + (-1.0 * _x_x_0)) == -15.0) || (((x_15 + (-1.0 * _x_x_0)) == -10.0) || (((x_12 + (-1.0 * _x_x_0)) == -9.0) || (((x_11 + (-1.0 * _x_x_0)) == -12.0) || (((x_10 + (-1.0 * _x_x_0)) == -17.0) || (((x_5 + (-1.0 * _x_x_0)) == -17.0) || (((x_4 + (-1.0 * _x_x_0)) == -7.0) || (((x_1 + (-1.0 * _x_x_0)) == -8.0) || ((x_3 + (-1.0 * _x_x_0)) == -16.0))))))))))))))) && ((((x_26 + (-1.0 * _x_x_1)) <= -6.0) && (((x_25 + (-1.0 * _x_x_1)) <= -16.0) && (((x_24 + (-1.0 * _x_x_1)) <= -5.0) && (((x_22 + (-1.0 * _x_x_1)) <= -2.0) && (((x_18 + (-1.0 * _x_x_1)) <= -15.0) && (((x_16 + (-1.0 * _x_x_1)) <= -2.0) && (((x_14 + (-1.0 * _x_x_1)) <= -18.0) && (((x_12 + (-1.0 * _x_x_1)) <= -3.0) && (((x_11 + (-1.0 * _x_x_1)) <= -14.0) && (((x_6 + (-1.0 * _x_x_1)) <= -20.0) && (((x_5 + (-1.0 * _x_x_1)) <= -11.0) && (((x_4 + (-1.0 * _x_x_1)) <= -2.0) && (((x_2 + (-1.0 * _x_x_1)) <= -2.0) && ((x_3 + (-1.0 * _x_x_1)) <= -8.0)))))))))))))) && (((x_26 + (-1.0 * _x_x_1)) == -6.0) || (((x_25 + (-1.0 * _x_x_1)) == -16.0) || (((x_24 + (-1.0 * _x_x_1)) == -5.0) || (((x_22 + (-1.0 * _x_x_1)) == -2.0) || (((x_18 + (-1.0 * _x_x_1)) == -15.0) || (((x_16 + (-1.0 * _x_x_1)) == -2.0) || (((x_14 + (-1.0 * _x_x_1)) == -18.0) || (((x_12 + (-1.0 * _x_x_1)) == -3.0) || (((x_11 + (-1.0 * _x_x_1)) == -14.0) || (((x_6 + (-1.0 * _x_x_1)) == -20.0) || (((x_5 + (-1.0 * _x_x_1)) == -11.0) || (((x_4 + (-1.0 * _x_x_1)) == -2.0) || (((x_2 + (-1.0 * _x_x_1)) == -2.0) || ((x_3 + (-1.0 * _x_x_1)) == -8.0)))))))))))))))) && ((((x_27 + (-1.0 * _x_x_2)) <= -19.0) && (((x_26 + (-1.0 * _x_x_2)) <= -13.0) && (((x_25 + (-1.0 * _x_x_2)) <= -15.0) && (((x_24 + (-1.0 * _x_x_2)) <= -9.0) && (((x_22 + (-1.0 * _x_x_2)) <= -9.0) && (((x_21 + (-1.0 * _x_x_2)) <= -19.0) && (((x_18 + (-1.0 * _x_x_2)) <= -20.0) && (((x_16 + (-1.0 * _x_x_2)) <= -2.0) && (((x_12 + (-1.0 * _x_x_2)) <= -3.0) && (((x_9 + (-1.0 * _x_x_2)) <= -17.0) && (((x_7 + (-1.0 * _x_x_2)) <= -17.0) && (((x_5 + (-1.0 * _x_x_2)) <= -15.0) && (((x_0 + (-1.0 * _x_x_2)) <= -2.0) && ((x_2 + (-1.0 * _x_x_2)) <= -14.0)))))))))))))) && (((x_27 + (-1.0 * _x_x_2)) == -19.0) || (((x_26 + (-1.0 * _x_x_2)) == -13.0) || (((x_25 + (-1.0 * _x_x_2)) == -15.0) || (((x_24 + (-1.0 * _x_x_2)) == -9.0) || (((x_22 + (-1.0 * _x_x_2)) == -9.0) || (((x_21 + (-1.0 * _x_x_2)) == -19.0) || (((x_18 + (-1.0 * _x_x_2)) == -20.0) || (((x_16 + (-1.0 * _x_x_2)) == -2.0) || (((x_12 + (-1.0 * _x_x_2)) == -3.0) || (((x_9 + (-1.0 * _x_x_2)) == -17.0) || (((x_7 + (-1.0 * _x_x_2)) == -17.0) || (((x_5 + (-1.0 * _x_x_2)) == -15.0) || (((x_0 + (-1.0 * _x_x_2)) == -2.0) || ((x_2 + (-1.0 * _x_x_2)) == -14.0)))))))))))))))) && ((((x_27 + (-1.0 * _x_x_3)) <= -11.0) && (((x_24 + (-1.0 * _x_x_3)) <= -9.0) && (((x_23 + (-1.0 * _x_x_3)) <= -15.0) && (((x_20 + (-1.0 * _x_x_3)) <= -16.0) && (((x_16 + (-1.0 * _x_x_3)) <= -3.0) && (((x_15 + (-1.0 * _x_x_3)) <= -7.0) && (((x_14 + (-1.0 * _x_x_3)) <= -2.0) && (((x_11 + (-1.0 * _x_x_3)) <= -13.0) && (((x_9 + (-1.0 * _x_x_3)) <= -10.0) && (((x_8 + (-1.0 * _x_x_3)) <= -8.0) && (((x_7 + (-1.0 * _x_x_3)) <= -4.0) && (((x_4 + (-1.0 * _x_x_3)) <= -20.0) && (((x_0 + (-1.0 * _x_x_3)) <= -7.0) && ((x_2 + (-1.0 * _x_x_3)) <= -18.0)))))))))))))) && (((x_27 + (-1.0 * _x_x_3)) == -11.0) || (((x_24 + (-1.0 * _x_x_3)) == -9.0) || (((x_23 + (-1.0 * _x_x_3)) == -15.0) || (((x_20 + (-1.0 * _x_x_3)) == -16.0) || (((x_16 + (-1.0 * _x_x_3)) == -3.0) || (((x_15 + (-1.0 * _x_x_3)) == -7.0) || (((x_14 + (-1.0 * _x_x_3)) == -2.0) || (((x_11 + (-1.0 * _x_x_3)) == -13.0) || (((x_9 + (-1.0 * _x_x_3)) == -10.0) || (((x_8 + (-1.0 * _x_x_3)) == -8.0) || (((x_7 + (-1.0 * _x_x_3)) == -4.0) || (((x_4 + (-1.0 * _x_x_3)) == -20.0) || (((x_0 + (-1.0 * _x_x_3)) == -7.0) || ((x_2 + (-1.0 * _x_x_3)) == -18.0)))))))))))))))) && ((((x_27 + (-1.0 * _x_x_4)) <= -14.0) && (((x_24 + (-1.0 * _x_x_4)) <= -20.0) && (((x_23 + (-1.0 * _x_x_4)) <= -20.0) && (((x_21 + (-1.0 * _x_x_4)) <= -9.0) && (((x_20 + (-1.0 * _x_x_4)) <= -11.0) && (((x_17 + (-1.0 * _x_x_4)) <= -5.0) && (((x_16 + (-1.0 * _x_x_4)) <= -6.0) && (((x_14 + (-1.0 * _x_x_4)) <= -13.0) && (((x_13 + (-1.0 * _x_x_4)) <= -15.0) && (((x_11 + (-1.0 * _x_x_4)) <= -4.0) && (((x_5 + (-1.0 * _x_x_4)) <= -14.0) && (((x_2 + (-1.0 * _x_x_4)) <= -1.0) && (((x_0 + (-1.0 * _x_x_4)) <= -7.0) && ((x_1 + (-1.0 * _x_x_4)) <= -6.0)))))))))))))) && (((x_27 + (-1.0 * _x_x_4)) == -14.0) || (((x_24 + (-1.0 * _x_x_4)) == -20.0) || (((x_23 + (-1.0 * _x_x_4)) == -20.0) || (((x_21 + (-1.0 * _x_x_4)) == -9.0) || (((x_20 + (-1.0 * _x_x_4)) == -11.0) || (((x_17 + (-1.0 * _x_x_4)) == -5.0) || (((x_16 + (-1.0 * _x_x_4)) == -6.0) || (((x_14 + (-1.0 * _x_x_4)) == -13.0) || (((x_13 + (-1.0 * _x_x_4)) == -15.0) || (((x_11 + (-1.0 * _x_x_4)) == -4.0) || (((x_5 + (-1.0 * _x_x_4)) == -14.0) || (((x_2 + (-1.0 * _x_x_4)) == -1.0) || (((x_0 + (-1.0 * _x_x_4)) == -7.0) || ((x_1 + (-1.0 * _x_x_4)) == -6.0)))))))))))))))) && ((((x_25 + (-1.0 * _x_x_5)) <= -14.0) && (((x_24 + (-1.0 * _x_x_5)) <= -19.0) && (((x_23 + (-1.0 * _x_x_5)) <= -2.0) && (((x_21 + (-1.0 * _x_x_5)) <= -9.0) && (((x_20 + (-1.0 * _x_x_5)) <= -13.0) && (((x_18 + (-1.0 * _x_x_5)) <= -2.0) && (((x_15 + (-1.0 * _x_x_5)) <= -17.0) && (((x_14 + (-1.0 * _x_x_5)) <= -13.0) && (((x_9 + (-1.0 * _x_x_5)) <= -18.0) && (((x_6 + (-1.0 * _x_x_5)) <= -15.0) && (((x_4 + (-1.0 * _x_x_5)) <= -3.0) && (((x_2 + (-1.0 * _x_x_5)) <= -6.0) && (((x_0 + (-1.0 * _x_x_5)) <= -17.0) && ((x_1 + (-1.0 * _x_x_5)) <= -15.0)))))))))))))) && (((x_25 + (-1.0 * _x_x_5)) == -14.0) || (((x_24 + (-1.0 * _x_x_5)) == -19.0) || (((x_23 + (-1.0 * _x_x_5)) == -2.0) || (((x_21 + (-1.0 * _x_x_5)) == -9.0) || (((x_20 + (-1.0 * _x_x_5)) == -13.0) || (((x_18 + (-1.0 * _x_x_5)) == -2.0) || (((x_15 + (-1.0 * _x_x_5)) == -17.0) || (((x_14 + (-1.0 * _x_x_5)) == -13.0) || (((x_9 + (-1.0 * _x_x_5)) == -18.0) || (((x_6 + (-1.0 * _x_x_5)) == -15.0) || (((x_4 + (-1.0 * _x_x_5)) == -3.0) || (((x_2 + (-1.0 * _x_x_5)) == -6.0) || (((x_0 + (-1.0 * _x_x_5)) == -17.0) || ((x_1 + (-1.0 * _x_x_5)) == -15.0)))))))))))))))) && ((((x_27 + (-1.0 * _x_x_6)) <= -10.0) && (((x_26 + (-1.0 * _x_x_6)) <= -2.0) && (((x_25 + (-1.0 * _x_x_6)) <= -13.0) && (((x_24 + (-1.0 * _x_x_6)) <= -1.0) && (((x_23 + (-1.0 * _x_x_6)) <= -13.0) && (((x_21 + (-1.0 * _x_x_6)) <= -5.0) && (((x_20 + (-1.0 * _x_x_6)) <= -5.0) && (((x_19 + (-1.0 * _x_x_6)) <= -1.0) && (((x_17 + (-1.0 * _x_x_6)) <= -3.0) && (((x_16 + (-1.0 * _x_x_6)) <= -2.0) && (((x_6 + (-1.0 * _x_x_6)) <= -7.0) && (((x_5 + (-1.0 * _x_x_6)) <= -2.0) && (((x_1 + (-1.0 * _x_x_6)) <= -8.0) && ((x_2 + (-1.0 * _x_x_6)) <= -8.0)))))))))))))) && (((x_27 + (-1.0 * _x_x_6)) == -10.0) || (((x_26 + (-1.0 * _x_x_6)) == -2.0) || (((x_25 + (-1.0 * _x_x_6)) == -13.0) || (((x_24 + (-1.0 * _x_x_6)) == -1.0) || (((x_23 + (-1.0 * _x_x_6)) == -13.0) || (((x_21 + (-1.0 * _x_x_6)) == -5.0) || (((x_20 + (-1.0 * _x_x_6)) == -5.0) || (((x_19 + (-1.0 * _x_x_6)) == -1.0) || (((x_17 + (-1.0 * _x_x_6)) == -3.0) || (((x_16 + (-1.0 * _x_x_6)) == -2.0) || (((x_6 + (-1.0 * _x_x_6)) == -7.0) || (((x_5 + (-1.0 * _x_x_6)) == -2.0) || (((x_1 + (-1.0 * _x_x_6)) == -8.0) || ((x_2 + (-1.0 * _x_x_6)) == -8.0)))))))))))))))) && ((((x_26 + (-1.0 * _x_x_7)) <= -18.0) && (((x_24 + (-1.0 * _x_x_7)) <= -12.0) && (((x_18 + (-1.0 * _x_x_7)) <= -12.0) && (((x_17 + (-1.0 * _x_x_7)) <= -9.0) && (((x_16 + (-1.0 * _x_x_7)) <= -17.0) && (((x_14 + (-1.0 * _x_x_7)) <= -20.0) && (((x_13 + (-1.0 * _x_x_7)) <= -9.0) && (((x_10 + (-1.0 * _x_x_7)) <= -2.0) && (((x_9 + (-1.0 * _x_x_7)) <= -7.0) && (((x_8 + (-1.0 * _x_x_7)) <= -19.0) && (((x_7 + (-1.0 * _x_x_7)) <= -6.0) && (((x_3 + (-1.0 * _x_x_7)) <= -2.0) && (((x_0 + (-1.0 * _x_x_7)) <= -11.0) && ((x_2 + (-1.0 * _x_x_7)) <= -8.0)))))))))))))) && (((x_26 + (-1.0 * _x_x_7)) == -18.0) || (((x_24 + (-1.0 * _x_x_7)) == -12.0) || (((x_18 + (-1.0 * _x_x_7)) == -12.0) || (((x_17 + (-1.0 * _x_x_7)) == -9.0) || (((x_16 + (-1.0 * _x_x_7)) == -17.0) || (((x_14 + (-1.0 * _x_x_7)) == -20.0) || (((x_13 + (-1.0 * _x_x_7)) == -9.0) || (((x_10 + (-1.0 * _x_x_7)) == -2.0) || (((x_9 + (-1.0 * _x_x_7)) == -7.0) || (((x_8 + (-1.0 * _x_x_7)) == -19.0) || (((x_7 + (-1.0 * _x_x_7)) == -6.0) || (((x_3 + (-1.0 * _x_x_7)) == -2.0) || (((x_0 + (-1.0 * _x_x_7)) == -11.0) || ((x_2 + (-1.0 * _x_x_7)) == -8.0)))))))))))))))) && ((((x_26 + (-1.0 * _x_x_8)) <= -4.0) && (((x_25 + (-1.0 * _x_x_8)) <= -17.0) && (((x_24 + (-1.0 * _x_x_8)) <= -19.0) && (((x_18 + (-1.0 * _x_x_8)) <= -17.0) && (((x_17 + (-1.0 * _x_x_8)) <= -18.0) && (((x_16 + (-1.0 * _x_x_8)) <= -20.0) && (((x_14 + (-1.0 * _x_x_8)) <= -10.0) && (((x_13 + (-1.0 * _x_x_8)) <= -7.0) && (((x_12 + (-1.0 * _x_x_8)) <= -11.0) && (((x_11 + (-1.0 * _x_x_8)) <= -9.0) && (((x_10 + (-1.0 * _x_x_8)) <= -1.0) && (((x_7 + (-1.0 * _x_x_8)) <= -18.0) && (((x_0 + (-1.0 * _x_x_8)) <= -6.0) && ((x_6 + (-1.0 * _x_x_8)) <= -19.0)))))))))))))) && (((x_26 + (-1.0 * _x_x_8)) == -4.0) || (((x_25 + (-1.0 * _x_x_8)) == -17.0) || (((x_24 + (-1.0 * _x_x_8)) == -19.0) || (((x_18 + (-1.0 * _x_x_8)) == -17.0) || (((x_17 + (-1.0 * _x_x_8)) == -18.0) || (((x_16 + (-1.0 * _x_x_8)) == -20.0) || (((x_14 + (-1.0 * _x_x_8)) == -10.0) || (((x_13 + (-1.0 * _x_x_8)) == -7.0) || (((x_12 + (-1.0 * _x_x_8)) == -11.0) || (((x_11 + (-1.0 * _x_x_8)) == -9.0) || (((x_10 + (-1.0 * _x_x_8)) == -1.0) || (((x_7 + (-1.0 * _x_x_8)) == -18.0) || (((x_0 + (-1.0 * _x_x_8)) == -6.0) || ((x_6 + (-1.0 * _x_x_8)) == -19.0)))))))))))))))) && ((((x_26 + (-1.0 * _x_x_9)) <= -7.0) && (((x_24 + (-1.0 * _x_x_9)) <= -15.0) && (((x_22 + (-1.0 * _x_x_9)) <= -12.0) && (((x_21 + (-1.0 * _x_x_9)) <= -13.0) && (((x_20 + (-1.0 * _x_x_9)) <= -16.0) && (((x_19 + (-1.0 * _x_x_9)) <= -4.0) && (((x_18 + (-1.0 * _x_x_9)) <= -9.0) && (((x_17 + (-1.0 * _x_x_9)) <= -13.0) && (((x_15 + (-1.0 * _x_x_9)) <= -2.0) && (((x_14 + (-1.0 * _x_x_9)) <= -17.0) && (((x_7 + (-1.0 * _x_x_9)) <= -4.0) && (((x_6 + (-1.0 * _x_x_9)) <= -20.0) && (((x_0 + (-1.0 * _x_x_9)) <= -12.0) && ((x_1 + (-1.0 * _x_x_9)) <= -6.0)))))))))))))) && (((x_26 + (-1.0 * _x_x_9)) == -7.0) || (((x_24 + (-1.0 * _x_x_9)) == -15.0) || (((x_22 + (-1.0 * _x_x_9)) == -12.0) || (((x_21 + (-1.0 * _x_x_9)) == -13.0) || (((x_20 + (-1.0 * _x_x_9)) == -16.0) || (((x_19 + (-1.0 * _x_x_9)) == -4.0) || (((x_18 + (-1.0 * _x_x_9)) == -9.0) || (((x_17 + (-1.0 * _x_x_9)) == -13.0) || (((x_15 + (-1.0 * _x_x_9)) == -2.0) || (((x_14 + (-1.0 * _x_x_9)) == -17.0) || (((x_7 + (-1.0 * _x_x_9)) == -4.0) || (((x_6 + (-1.0 * _x_x_9)) == -20.0) || (((x_0 + (-1.0 * _x_x_9)) == -12.0) || ((x_1 + (-1.0 * _x_x_9)) == -6.0)))))))))))))))) && ((((x_26 + (-1.0 * _x_x_10)) <= -2.0) && (((x_25 + (-1.0 * _x_x_10)) <= -16.0) && (((x_24 + (-1.0 * _x_x_10)) <= -18.0) && (((x_23 + (-1.0 * _x_x_10)) <= -19.0) && (((x_21 + (-1.0 * _x_x_10)) <= -13.0) && (((x_20 + (-1.0 * _x_x_10)) <= -1.0) && (((x_19 + (-1.0 * _x_x_10)) <= -17.0) && (((x_17 + (-1.0 * _x_x_10)) <= -11.0) && (((x_16 + (-1.0 * _x_x_10)) <= -19.0) && (((x_7 + (-1.0 * _x_x_10)) <= -16.0) && (((x_6 + (-1.0 * _x_x_10)) <= -5.0) && (((x_2 + (-1.0 * _x_x_10)) <= -16.0) && (((x_0 + (-1.0 * _x_x_10)) <= -18.0) && ((x_1 + (-1.0 * _x_x_10)) <= -14.0)))))))))))))) && (((x_26 + (-1.0 * _x_x_10)) == -2.0) || (((x_25 + (-1.0 * _x_x_10)) == -16.0) || (((x_24 + (-1.0 * _x_x_10)) == -18.0) || (((x_23 + (-1.0 * _x_x_10)) == -19.0) || (((x_21 + (-1.0 * _x_x_10)) == -13.0) || (((x_20 + (-1.0 * _x_x_10)) == -1.0) || (((x_19 + (-1.0 * _x_x_10)) == -17.0) || (((x_17 + (-1.0 * _x_x_10)) == -11.0) || (((x_16 + (-1.0 * _x_x_10)) == -19.0) || (((x_7 + (-1.0 * _x_x_10)) == -16.0) || (((x_6 + (-1.0 * _x_x_10)) == -5.0) || (((x_2 + (-1.0 * _x_x_10)) == -16.0) || (((x_0 + (-1.0 * _x_x_10)) == -18.0) || ((x_1 + (-1.0 * _x_x_10)) == -14.0)))))))))))))))) && ((((x_26 + (-1.0 * _x_x_11)) <= -13.0) && (((x_24 + (-1.0 * _x_x_11)) <= -15.0) && (((x_22 + (-1.0 * _x_x_11)) <= -12.0) && (((x_21 + (-1.0 * _x_x_11)) <= -11.0) && (((x_19 + (-1.0 * _x_x_11)) <= -12.0) && (((x_18 + (-1.0 * _x_x_11)) <= -6.0) && (((x_17 + (-1.0 * _x_x_11)) <= -5.0) && (((x_16 + (-1.0 * _x_x_11)) <= -13.0) && (((x_11 + (-1.0 * _x_x_11)) <= -8.0) && (((x_5 + (-1.0 * _x_x_11)) <= -20.0) && (((x_4 + (-1.0 * _x_x_11)) <= -12.0) && (((x_3 + (-1.0 * _x_x_11)) <= -19.0) && (((x_0 + (-1.0 * _x_x_11)) <= -12.0) && ((x_1 + (-1.0 * _x_x_11)) <= -15.0)))))))))))))) && (((x_26 + (-1.0 * _x_x_11)) == -13.0) || (((x_24 + (-1.0 * _x_x_11)) == -15.0) || (((x_22 + (-1.0 * _x_x_11)) == -12.0) || (((x_21 + (-1.0 * _x_x_11)) == -11.0) || (((x_19 + (-1.0 * _x_x_11)) == -12.0) || (((x_18 + (-1.0 * _x_x_11)) == -6.0) || (((x_17 + (-1.0 * _x_x_11)) == -5.0) || (((x_16 + (-1.0 * _x_x_11)) == -13.0) || (((x_11 + (-1.0 * _x_x_11)) == -8.0) || (((x_5 + (-1.0 * _x_x_11)) == -20.0) || (((x_4 + (-1.0 * _x_x_11)) == -12.0) || (((x_3 + (-1.0 * _x_x_11)) == -19.0) || (((x_0 + (-1.0 * _x_x_11)) == -12.0) || ((x_1 + (-1.0 * _x_x_11)) == -15.0)))))))))))))))) && ((((x_27 + (-1.0 * _x_x_12)) <= -12.0) && (((x_26 + (-1.0 * _x_x_12)) <= -16.0) && (((x_25 + (-1.0 * _x_x_12)) <= -10.0) && (((x_24 + (-1.0 * _x_x_12)) <= -3.0) && (((x_23 + (-1.0 * _x_x_12)) <= -4.0) && (((x_16 + (-1.0 * _x_x_12)) <= -10.0) && (((x_15 + (-1.0 * _x_x_12)) <= -8.0) && (((x_13 + (-1.0 * _x_x_12)) <= -6.0) && (((x_12 + (-1.0 * _x_x_12)) <= -10.0) && (((x_9 + (-1.0 * _x_x_12)) <= -6.0) && (((x_6 + (-1.0 * _x_x_12)) <= -11.0) && (((x_2 + (-1.0 * _x_x_12)) <= -10.0) && (((x_0 + (-1.0 * _x_x_12)) <= -6.0) && ((x_1 + (-1.0 * _x_x_12)) <= -15.0)))))))))))))) && (((x_27 + (-1.0 * _x_x_12)) == -12.0) || (((x_26 + (-1.0 * _x_x_12)) == -16.0) || (((x_25 + (-1.0 * _x_x_12)) == -10.0) || (((x_24 + (-1.0 * _x_x_12)) == -3.0) || (((x_23 + (-1.0 * _x_x_12)) == -4.0) || (((x_16 + (-1.0 * _x_x_12)) == -10.0) || (((x_15 + (-1.0 * _x_x_12)) == -8.0) || (((x_13 + (-1.0 * _x_x_12)) == -6.0) || (((x_12 + (-1.0 * _x_x_12)) == -10.0) || (((x_9 + (-1.0 * _x_x_12)) == -6.0) || (((x_6 + (-1.0 * _x_x_12)) == -11.0) || (((x_2 + (-1.0 * _x_x_12)) == -10.0) || (((x_0 + (-1.0 * _x_x_12)) == -6.0) || ((x_1 + (-1.0 * _x_x_12)) == -15.0)))))))))))))))) && ((((x_27 + (-1.0 * _x_x_13)) <= -16.0) && (((x_23 + (-1.0 * _x_x_13)) <= -15.0) && (((x_21 + (-1.0 * _x_x_13)) <= -10.0) && (((x_19 + (-1.0 * _x_x_13)) <= -18.0) && (((x_18 + (-1.0 * _x_x_13)) <= -7.0) && (((x_16 + (-1.0 * _x_x_13)) <= -5.0) && (((x_15 + (-1.0 * _x_x_13)) <= -9.0) && (((x_14 + (-1.0 * _x_x_13)) <= -17.0) && (((x_12 + (-1.0 * _x_x_13)) <= -20.0) && (((x_11 + (-1.0 * _x_x_13)) <= -10.0) && (((x_10 + (-1.0 * _x_x_13)) <= -9.0) && (((x_9 + (-1.0 * _x_x_13)) <= -14.0) && (((x_4 + (-1.0 * _x_x_13)) <= -10.0) && ((x_6 + (-1.0 * _x_x_13)) <= -17.0)))))))))))))) && (((x_27 + (-1.0 * _x_x_13)) == -16.0) || (((x_23 + (-1.0 * _x_x_13)) == -15.0) || (((x_21 + (-1.0 * _x_x_13)) == -10.0) || (((x_19 + (-1.0 * _x_x_13)) == -18.0) || (((x_18 + (-1.0 * _x_x_13)) == -7.0) || (((x_16 + (-1.0 * _x_x_13)) == -5.0) || (((x_15 + (-1.0 * _x_x_13)) == -9.0) || (((x_14 + (-1.0 * _x_x_13)) == -17.0) || (((x_12 + (-1.0 * _x_x_13)) == -20.0) || (((x_11 + (-1.0 * _x_x_13)) == -10.0) || (((x_10 + (-1.0 * _x_x_13)) == -9.0) || (((x_9 + (-1.0 * _x_x_13)) == -14.0) || (((x_4 + (-1.0 * _x_x_13)) == -10.0) || ((x_6 + (-1.0 * _x_x_13)) == -17.0)))))))))))))))) && ((((x_27 + (-1.0 * _x_x_14)) <= -2.0) && (((x_26 + (-1.0 * _x_x_14)) <= -4.0) && (((x_25 + (-1.0 * _x_x_14)) <= -16.0) && (((x_24 + (-1.0 * _x_x_14)) <= -19.0) && (((x_20 + (-1.0 * _x_x_14)) <= -8.0) && (((x_19 + (-1.0 * _x_x_14)) <= -18.0) && (((x_15 + (-1.0 * _x_x_14)) <= -5.0) && (((x_11 + (-1.0 * _x_x_14)) <= -3.0) && (((x_10 + (-1.0 * _x_x_14)) <= -16.0) && (((x_9 + (-1.0 * _x_x_14)) <= -7.0) && (((x_5 + (-1.0 * _x_x_14)) <= -20.0) && (((x_2 + (-1.0 * _x_x_14)) <= -2.0) && (((x_0 + (-1.0 * _x_x_14)) <= -12.0) && ((x_1 + (-1.0 * _x_x_14)) <= -11.0)))))))))))))) && (((x_27 + (-1.0 * _x_x_14)) == -2.0) || (((x_26 + (-1.0 * _x_x_14)) == -4.0) || (((x_25 + (-1.0 * _x_x_14)) == -16.0) || (((x_24 + (-1.0 * _x_x_14)) == -19.0) || (((x_20 + (-1.0 * _x_x_14)) == -8.0) || (((x_19 + (-1.0 * _x_x_14)) == -18.0) || (((x_15 + (-1.0 * _x_x_14)) == -5.0) || (((x_11 + (-1.0 * _x_x_14)) == -3.0) || (((x_10 + (-1.0 * _x_x_14)) == -16.0) || (((x_9 + (-1.0 * _x_x_14)) == -7.0) || (((x_5 + (-1.0 * _x_x_14)) == -20.0) || (((x_2 + (-1.0 * _x_x_14)) == -2.0) || (((x_0 + (-1.0 * _x_x_14)) == -12.0) || ((x_1 + (-1.0 * _x_x_14)) == -11.0)))))))))))))))) && ((((x_26 + (-1.0 * _x_x_15)) <= -18.0) && (((x_25 + (-1.0 * _x_x_15)) <= -18.0) && (((x_24 + (-1.0 * _x_x_15)) <= -7.0) && (((x_22 + (-1.0 * _x_x_15)) <= -8.0) && (((x_21 + (-1.0 * _x_x_15)) <= -9.0) && (((x_20 + (-1.0 * _x_x_15)) <= -10.0) && (((x_17 + (-1.0 * _x_x_15)) <= -20.0) && (((x_16 + (-1.0 * _x_x_15)) <= -13.0) && (((x_8 + (-1.0 * _x_x_15)) <= -11.0) && (((x_6 + (-1.0 * _x_x_15)) <= -2.0) && (((x_5 + (-1.0 * _x_x_15)) <= -2.0) && (((x_3 + (-1.0 * _x_x_15)) <= -15.0) && (((x_0 + (-1.0 * _x_x_15)) <= -15.0) && ((x_2 + (-1.0 * _x_x_15)) <= -5.0)))))))))))))) && (((x_26 + (-1.0 * _x_x_15)) == -18.0) || (((x_25 + (-1.0 * _x_x_15)) == -18.0) || (((x_24 + (-1.0 * _x_x_15)) == -7.0) || (((x_22 + (-1.0 * _x_x_15)) == -8.0) || (((x_21 + (-1.0 * _x_x_15)) == -9.0) || (((x_20 + (-1.0 * _x_x_15)) == -10.0) || (((x_17 + (-1.0 * _x_x_15)) == -20.0) || (((x_16 + (-1.0 * _x_x_15)) == -13.0) || (((x_8 + (-1.0 * _x_x_15)) == -11.0) || (((x_6 + (-1.0 * _x_x_15)) == -2.0) || (((x_5 + (-1.0 * _x_x_15)) == -2.0) || (((x_3 + (-1.0 * _x_x_15)) == -15.0) || (((x_0 + (-1.0 * _x_x_15)) == -15.0) || ((x_2 + (-1.0 * _x_x_15)) == -5.0)))))))))))))))) && ((((x_27 + (-1.0 * _x_x_16)) <= -13.0) && (((x_26 + (-1.0 * _x_x_16)) <= -1.0) && (((x_25 + (-1.0 * _x_x_16)) <= -6.0) && (((x_24 + (-1.0 * _x_x_16)) <= -8.0) && (((x_22 + (-1.0 * _x_x_16)) <= -17.0) && (((x_21 + (-1.0 * _x_x_16)) <= -10.0) && (((x_20 + (-1.0 * _x_x_16)) <= -2.0) && (((x_16 + (-1.0 * _x_x_16)) <= -11.0) && (((x_14 + (-1.0 * _x_x_16)) <= -7.0) && (((x_12 + (-1.0 * _x_x_16)) <= -20.0) && (((x_5 + (-1.0 * _x_x_16)) <= -4.0) && (((x_3 + (-1.0 * _x_x_16)) <= -10.0) && (((x_0 + (-1.0 * _x_x_16)) <= -3.0) && ((x_1 + (-1.0 * _x_x_16)) <= -2.0)))))))))))))) && (((x_27 + (-1.0 * _x_x_16)) == -13.0) || (((x_26 + (-1.0 * _x_x_16)) == -1.0) || (((x_25 + (-1.0 * _x_x_16)) == -6.0) || (((x_24 + (-1.0 * _x_x_16)) == -8.0) || (((x_22 + (-1.0 * _x_x_16)) == -17.0) || (((x_21 + (-1.0 * _x_x_16)) == -10.0) || (((x_20 + (-1.0 * _x_x_16)) == -2.0) || (((x_16 + (-1.0 * _x_x_16)) == -11.0) || (((x_14 + (-1.0 * _x_x_16)) == -7.0) || (((x_12 + (-1.0 * _x_x_16)) == -20.0) || (((x_5 + (-1.0 * _x_x_16)) == -4.0) || (((x_3 + (-1.0 * _x_x_16)) == -10.0) || (((x_0 + (-1.0 * _x_x_16)) == -3.0) || ((x_1 + (-1.0 * _x_x_16)) == -2.0)))))))))))))))) && ((((x_27 + (-1.0 * _x_x_17)) <= -11.0) && (((x_25 + (-1.0 * _x_x_17)) <= -17.0) && (((x_19 + (-1.0 * _x_x_17)) <= -2.0) && (((x_18 + (-1.0 * _x_x_17)) <= -3.0) && (((x_17 + (-1.0 * _x_x_17)) <= -1.0) && (((x_16 + (-1.0 * _x_x_17)) <= -11.0) && (((x_15 + (-1.0 * _x_x_17)) <= -9.0) && (((x_14 + (-1.0 * _x_x_17)) <= -4.0) && (((x_12 + (-1.0 * _x_x_17)) <= -12.0) && (((x_9 + (-1.0 * _x_x_17)) <= -20.0) && (((x_7 + (-1.0 * _x_x_17)) <= -2.0) && (((x_6 + (-1.0 * _x_x_17)) <= -2.0) && (((x_1 + (-1.0 * _x_x_17)) <= -7.0) && ((x_2 + (-1.0 * _x_x_17)) <= -5.0)))))))))))))) && (((x_27 + (-1.0 * _x_x_17)) == -11.0) || (((x_25 + (-1.0 * _x_x_17)) == -17.0) || (((x_19 + (-1.0 * _x_x_17)) == -2.0) || (((x_18 + (-1.0 * _x_x_17)) == -3.0) || (((x_17 + (-1.0 * _x_x_17)) == -1.0) || (((x_16 + (-1.0 * _x_x_17)) == -11.0) || (((x_15 + (-1.0 * _x_x_17)) == -9.0) || (((x_14 + (-1.0 * _x_x_17)) == -4.0) || (((x_12 + (-1.0 * _x_x_17)) == -12.0) || (((x_9 + (-1.0 * _x_x_17)) == -20.0) || (((x_7 + (-1.0 * _x_x_17)) == -2.0) || (((x_6 + (-1.0 * _x_x_17)) == -2.0) || (((x_1 + (-1.0 * _x_x_17)) == -7.0) || ((x_2 + (-1.0 * _x_x_17)) == -5.0)))))))))))))))) && ((((x_26 + (-1.0 * _x_x_18)) <= -5.0) && (((x_25 + (-1.0 * _x_x_18)) <= -7.0) && (((x_23 + (-1.0 * _x_x_18)) <= -12.0) && (((x_21 + (-1.0 * _x_x_18)) <= -19.0) && (((x_20 + (-1.0 * _x_x_18)) <= -16.0) && (((x_19 + (-1.0 * _x_x_18)) <= -8.0) && (((x_18 + (-1.0 * _x_x_18)) <= -13.0) && (((x_17 + (-1.0 * _x_x_18)) <= -4.0) && (((x_11 + (-1.0 * _x_x_18)) <= -9.0) && (((x_9 + (-1.0 * _x_x_18)) <= -3.0) && (((x_8 + (-1.0 * _x_x_18)) <= -7.0) && (((x_6 + (-1.0 * _x_x_18)) <= -9.0) && (((x_0 + (-1.0 * _x_x_18)) <= -18.0) && ((x_3 + (-1.0 * _x_x_18)) <= -3.0)))))))))))))) && (((x_26 + (-1.0 * _x_x_18)) == -5.0) || (((x_25 + (-1.0 * _x_x_18)) == -7.0) || (((x_23 + (-1.0 * _x_x_18)) == -12.0) || (((x_21 + (-1.0 * _x_x_18)) == -19.0) || (((x_20 + (-1.0 * _x_x_18)) == -16.0) || (((x_19 + (-1.0 * _x_x_18)) == -8.0) || (((x_18 + (-1.0 * _x_x_18)) == -13.0) || (((x_17 + (-1.0 * _x_x_18)) == -4.0) || (((x_11 + (-1.0 * _x_x_18)) == -9.0) || (((x_9 + (-1.0 * _x_x_18)) == -3.0) || (((x_8 + (-1.0 * _x_x_18)) == -7.0) || (((x_6 + (-1.0 * _x_x_18)) == -9.0) || (((x_0 + (-1.0 * _x_x_18)) == -18.0) || ((x_3 + (-1.0 * _x_x_18)) == -3.0)))))))))))))))) && ((((x_26 + (-1.0 * _x_x_19)) <= -8.0) && (((x_25 + (-1.0 * _x_x_19)) <= -16.0) && (((x_23 + (-1.0 * _x_x_19)) <= -15.0) && (((x_21 + (-1.0 * _x_x_19)) <= -12.0) && (((x_20 + (-1.0 * _x_x_19)) <= -18.0) && (((x_17 + (-1.0 * _x_x_19)) <= -3.0) && (((x_16 + (-1.0 * _x_x_19)) <= -14.0) && (((x_13 + (-1.0 * _x_x_19)) <= -17.0) && (((x_12 + (-1.0 * _x_x_19)) <= -14.0) && (((x_8 + (-1.0 * _x_x_19)) <= -12.0) && (((x_7 + (-1.0 * _x_x_19)) <= -3.0) && (((x_6 + (-1.0 * _x_x_19)) <= -5.0) && (((x_2 + (-1.0 * _x_x_19)) <= -1.0) && ((x_5 + (-1.0 * _x_x_19)) <= -4.0)))))))))))))) && (((x_26 + (-1.0 * _x_x_19)) == -8.0) || (((x_25 + (-1.0 * _x_x_19)) == -16.0) || (((x_23 + (-1.0 * _x_x_19)) == -15.0) || (((x_21 + (-1.0 * _x_x_19)) == -12.0) || (((x_20 + (-1.0 * _x_x_19)) == -18.0) || (((x_17 + (-1.0 * _x_x_19)) == -3.0) || (((x_16 + (-1.0 * _x_x_19)) == -14.0) || (((x_13 + (-1.0 * _x_x_19)) == -17.0) || (((x_12 + (-1.0 * _x_x_19)) == -14.0) || (((x_8 + (-1.0 * _x_x_19)) == -12.0) || (((x_7 + (-1.0 * _x_x_19)) == -3.0) || (((x_6 + (-1.0 * _x_x_19)) == -5.0) || (((x_2 + (-1.0 * _x_x_19)) == -1.0) || ((x_5 + (-1.0 * _x_x_19)) == -4.0)))))))))))))))) && ((((x_27 + (-1.0 * _x_x_20)) <= -4.0) && (((x_20 + (-1.0 * _x_x_20)) <= -20.0) && (((x_19 + (-1.0 * _x_x_20)) <= -9.0) && (((x_18 + (-1.0 * _x_x_20)) <= -12.0) && (((x_17 + (-1.0 * _x_x_20)) <= -9.0) && (((x_16 + (-1.0 * _x_x_20)) <= -14.0) && (((x_11 + (-1.0 * _x_x_20)) <= -16.0) && (((x_8 + (-1.0 * _x_x_20)) <= -19.0) && (((x_5 + (-1.0 * _x_x_20)) <= -7.0) && (((x_4 + (-1.0 * _x_x_20)) <= -14.0) && (((x_3 + (-1.0 * _x_x_20)) <= -4.0) && (((x_2 + (-1.0 * _x_x_20)) <= -9.0) && (((x_0 + (-1.0 * _x_x_20)) <= -20.0) && ((x_1 + (-1.0 * _x_x_20)) <= -12.0)))))))))))))) && (((x_27 + (-1.0 * _x_x_20)) == -4.0) || (((x_20 + (-1.0 * _x_x_20)) == -20.0) || (((x_19 + (-1.0 * _x_x_20)) == -9.0) || (((x_18 + (-1.0 * _x_x_20)) == -12.0) || (((x_17 + (-1.0 * _x_x_20)) == -9.0) || (((x_16 + (-1.0 * _x_x_20)) == -14.0) || (((x_11 + (-1.0 * _x_x_20)) == -16.0) || (((x_8 + (-1.0 * _x_x_20)) == -19.0) || (((x_5 + (-1.0 * _x_x_20)) == -7.0) || (((x_4 + (-1.0 * _x_x_20)) == -14.0) || (((x_3 + (-1.0 * _x_x_20)) == -4.0) || (((x_2 + (-1.0 * _x_x_20)) == -9.0) || (((x_0 + (-1.0 * _x_x_20)) == -20.0) || ((x_1 + (-1.0 * _x_x_20)) == -12.0)))))))))))))))) && ((((x_27 + (-1.0 * _x_x_21)) <= -2.0) && (((x_26 + (-1.0 * _x_x_21)) <= -18.0) && (((x_25 + (-1.0 * _x_x_21)) <= -4.0) && (((x_18 + (-1.0 * _x_x_21)) <= -19.0) && (((x_17 + (-1.0 * _x_x_21)) <= -1.0) && (((x_16 + (-1.0 * _x_x_21)) <= -3.0) && (((x_12 + (-1.0 * _x_x_21)) <= -6.0) && (((x_11 + (-1.0 * _x_x_21)) <= -20.0) && (((x_10 + (-1.0 * _x_x_21)) <= -7.0) && (((x_7 + (-1.0 * _x_x_21)) <= -8.0) && (((x_5 + (-1.0 * _x_x_21)) <= -8.0) && (((x_2 + (-1.0 * _x_x_21)) <= -16.0) && (((x_0 + (-1.0 * _x_x_21)) <= -12.0) && ((x_1 + (-1.0 * _x_x_21)) <= -2.0)))))))))))))) && (((x_27 + (-1.0 * _x_x_21)) == -2.0) || (((x_26 + (-1.0 * _x_x_21)) == -18.0) || (((x_25 + (-1.0 * _x_x_21)) == -4.0) || (((x_18 + (-1.0 * _x_x_21)) == -19.0) || (((x_17 + (-1.0 * _x_x_21)) == -1.0) || (((x_16 + (-1.0 * _x_x_21)) == -3.0) || (((x_12 + (-1.0 * _x_x_21)) == -6.0) || (((x_11 + (-1.0 * _x_x_21)) == -20.0) || (((x_10 + (-1.0 * _x_x_21)) == -7.0) || (((x_7 + (-1.0 * _x_x_21)) == -8.0) || (((x_5 + (-1.0 * _x_x_21)) == -8.0) || (((x_2 + (-1.0 * _x_x_21)) == -16.0) || (((x_0 + (-1.0 * _x_x_21)) == -12.0) || ((x_1 + (-1.0 * _x_x_21)) == -2.0)))))))))))))))) && ((((x_26 + (-1.0 * _x_x_22)) <= -5.0) && (((x_22 + (-1.0 * _x_x_22)) <= -2.0) && (((x_20 + (-1.0 * _x_x_22)) <= -2.0) && (((x_19 + (-1.0 * _x_x_22)) <= -1.0) && (((x_14 + (-1.0 * _x_x_22)) <= -7.0) && (((x_13 + (-1.0 * _x_x_22)) <= -2.0) && (((x_12 + (-1.0 * _x_x_22)) <= -3.0) && (((x_11 + (-1.0 * _x_x_22)) <= -1.0) && (((x_10 + (-1.0 * _x_x_22)) <= -1.0) && (((x_9 + (-1.0 * _x_x_22)) <= -7.0) && (((x_6 + (-1.0 * _x_x_22)) <= -9.0) && (((x_5 + (-1.0 * _x_x_22)) <= -4.0) && (((x_1 + (-1.0 * _x_x_22)) <= -8.0) && ((x_3 + (-1.0 * _x_x_22)) <= -16.0)))))))))))))) && (((x_26 + (-1.0 * _x_x_22)) == -5.0) || (((x_22 + (-1.0 * _x_x_22)) == -2.0) || (((x_20 + (-1.0 * _x_x_22)) == -2.0) || (((x_19 + (-1.0 * _x_x_22)) == -1.0) || (((x_14 + (-1.0 * _x_x_22)) == -7.0) || (((x_13 + (-1.0 * _x_x_22)) == -2.0) || (((x_12 + (-1.0 * _x_x_22)) == -3.0) || (((x_11 + (-1.0 * _x_x_22)) == -1.0) || (((x_10 + (-1.0 * _x_x_22)) == -1.0) || (((x_9 + (-1.0 * _x_x_22)) == -7.0) || (((x_6 + (-1.0 * _x_x_22)) == -9.0) || (((x_5 + (-1.0 * _x_x_22)) == -4.0) || (((x_1 + (-1.0 * _x_x_22)) == -8.0) || ((x_3 + (-1.0 * _x_x_22)) == -16.0)))))))))))))))) && ((((x_26 + (-1.0 * _x_x_23)) <= -6.0) && (((x_23 + (-1.0 * _x_x_23)) <= -14.0) && (((x_22 + (-1.0 * _x_x_23)) <= -14.0) && (((x_21 + (-1.0 * _x_x_23)) <= -6.0) && (((x_18 + (-1.0 * _x_x_23)) <= -6.0) && (((x_17 + (-1.0 * _x_x_23)) <= -10.0) && (((x_16 + (-1.0 * _x_x_23)) <= -19.0) && (((x_14 + (-1.0 * _x_x_23)) <= -2.0) && (((x_11 + (-1.0 * _x_x_23)) <= -2.0) && (((x_7 + (-1.0 * _x_x_23)) <= -8.0) && (((x_5 + (-1.0 * _x_x_23)) <= -3.0) && (((x_4 + (-1.0 * _x_x_23)) <= -6.0) && (((x_0 + (-1.0 * _x_x_23)) <= -10.0) && ((x_1 + (-1.0 * _x_x_23)) <= -15.0)))))))))))))) && (((x_26 + (-1.0 * _x_x_23)) == -6.0) || (((x_23 + (-1.0 * _x_x_23)) == -14.0) || (((x_22 + (-1.0 * _x_x_23)) == -14.0) || (((x_21 + (-1.0 * _x_x_23)) == -6.0) || (((x_18 + (-1.0 * _x_x_23)) == -6.0) || (((x_17 + (-1.0 * _x_x_23)) == -10.0) || (((x_16 + (-1.0 * _x_x_23)) == -19.0) || (((x_14 + (-1.0 * _x_x_23)) == -2.0) || (((x_11 + (-1.0 * _x_x_23)) == -2.0) || (((x_7 + (-1.0 * _x_x_23)) == -8.0) || (((x_5 + (-1.0 * _x_x_23)) == -3.0) || (((x_4 + (-1.0 * _x_x_23)) == -6.0) || (((x_0 + (-1.0 * _x_x_23)) == -10.0) || ((x_1 + (-1.0 * _x_x_23)) == -15.0)))))))))))))))) && ((((x_27 + (-1.0 * _x_x_24)) <= -16.0) && (((x_26 + (-1.0 * _x_x_24)) <= -1.0) && (((x_24 + (-1.0 * _x_x_24)) <= -4.0) && (((x_22 + (-1.0 * _x_x_24)) <= -2.0) && (((x_20 + (-1.0 * _x_x_24)) <= -15.0) && (((x_18 + (-1.0 * _x_x_24)) <= -20.0) && (((x_15 + (-1.0 * _x_x_24)) <= -4.0) && (((x_12 + (-1.0 * _x_x_24)) <= -6.0) && (((x_9 + (-1.0 * _x_x_24)) <= -2.0) && (((x_8 + (-1.0 * _x_x_24)) <= -5.0) && (((x_7 + (-1.0 * _x_x_24)) <= -3.0) && (((x_3 + (-1.0 * _x_x_24)) <= -6.0) && (((x_1 + (-1.0 * _x_x_24)) <= -8.0) && ((x_2 + (-1.0 * _x_x_24)) <= -12.0)))))))))))))) && (((x_27 + (-1.0 * _x_x_24)) == -16.0) || (((x_26 + (-1.0 * _x_x_24)) == -1.0) || (((x_24 + (-1.0 * _x_x_24)) == -4.0) || (((x_22 + (-1.0 * _x_x_24)) == -2.0) || (((x_20 + (-1.0 * _x_x_24)) == -15.0) || (((x_18 + (-1.0 * _x_x_24)) == -20.0) || (((x_15 + (-1.0 * _x_x_24)) == -4.0) || (((x_12 + (-1.0 * _x_x_24)) == -6.0) || (((x_9 + (-1.0 * _x_x_24)) == -2.0) || (((x_8 + (-1.0 * _x_x_24)) == -5.0) || (((x_7 + (-1.0 * _x_x_24)) == -3.0) || (((x_3 + (-1.0 * _x_x_24)) == -6.0) || (((x_1 + (-1.0 * _x_x_24)) == -8.0) || ((x_2 + (-1.0 * _x_x_24)) == -12.0)))))))))))))))) && ((((x_27 + (-1.0 * _x_x_25)) <= -8.0) && (((x_26 + (-1.0 * _x_x_25)) <= -17.0) && (((x_23 + (-1.0 * _x_x_25)) <= -3.0) && (((x_19 + (-1.0 * _x_x_25)) <= -7.0) && (((x_18 + (-1.0 * _x_x_25)) <= -19.0) && (((x_17 + (-1.0 * _x_x_25)) <= -3.0) && (((x_15 + (-1.0 * _x_x_25)) <= -20.0) && (((x_14 + (-1.0 * _x_x_25)) <= -20.0) && (((x_13 + (-1.0 * _x_x_25)) <= -16.0) && (((x_12 + (-1.0 * _x_x_25)) <= -9.0) && (((x_9 + (-1.0 * _x_x_25)) <= -20.0) && (((x_3 + (-1.0 * _x_x_25)) <= -1.0) && (((x_0 + (-1.0 * _x_x_25)) <= -1.0) && ((x_2 + (-1.0 * _x_x_25)) <= -19.0)))))))))))))) && (((x_27 + (-1.0 * _x_x_25)) == -8.0) || (((x_26 + (-1.0 * _x_x_25)) == -17.0) || (((x_23 + (-1.0 * _x_x_25)) == -3.0) || (((x_19 + (-1.0 * _x_x_25)) == -7.0) || (((x_18 + (-1.0 * _x_x_25)) == -19.0) || (((x_17 + (-1.0 * _x_x_25)) == -3.0) || (((x_15 + (-1.0 * _x_x_25)) == -20.0) || (((x_14 + (-1.0 * _x_x_25)) == -20.0) || (((x_13 + (-1.0 * _x_x_25)) == -16.0) || (((x_12 + (-1.0 * _x_x_25)) == -9.0) || (((x_9 + (-1.0 * _x_x_25)) == -20.0) || (((x_3 + (-1.0 * _x_x_25)) == -1.0) || (((x_0 + (-1.0 * _x_x_25)) == -1.0) || ((x_2 + (-1.0 * _x_x_25)) == -19.0)))))))))))))))) && ((((x_26 + (-1.0 * _x_x_26)) <= -16.0) && (((x_25 + (-1.0 * _x_x_26)) <= -1.0) && (((x_24 + (-1.0 * _x_x_26)) <= -13.0) && (((x_16 + (-1.0 * _x_x_26)) <= -7.0) && (((x_15 + (-1.0 * _x_x_26)) <= -10.0) && (((x_13 + (-1.0 * _x_x_26)) <= -7.0) && (((x_10 + (-1.0 * _x_x_26)) <= -8.0) && (((x_9 + (-1.0 * _x_x_26)) <= -16.0) && (((x_8 + (-1.0 * _x_x_26)) <= -14.0) && (((x_7 + (-1.0 * _x_x_26)) <= -17.0) && (((x_5 + (-1.0 * _x_x_26)) <= -6.0) && (((x_4 + (-1.0 * _x_x_26)) <= -1.0) && (((x_0 + (-1.0 * _x_x_26)) <= -12.0) && ((x_1 + (-1.0 * _x_x_26)) <= -18.0)))))))))))))) && (((x_26 + (-1.0 * _x_x_26)) == -16.0) || (((x_25 + (-1.0 * _x_x_26)) == -1.0) || (((x_24 + (-1.0 * _x_x_26)) == -13.0) || (((x_16 + (-1.0 * _x_x_26)) == -7.0) || (((x_15 + (-1.0 * _x_x_26)) == -10.0) || (((x_13 + (-1.0 * _x_x_26)) == -7.0) || (((x_10 + (-1.0 * _x_x_26)) == -8.0) || (((x_9 + (-1.0 * _x_x_26)) == -16.0) || (((x_8 + (-1.0 * _x_x_26)) == -14.0) || (((x_7 + (-1.0 * _x_x_26)) == -17.0) || (((x_5 + (-1.0 * _x_x_26)) == -6.0) || (((x_4 + (-1.0 * _x_x_26)) == -1.0) || (((x_0 + (-1.0 * _x_x_26)) == -12.0) || ((x_1 + (-1.0 * _x_x_26)) == -18.0)))))))))))))))) && ((((x_26 + (-1.0 * _x_x_27)) <= -17.0) && (((x_25 + (-1.0 * _x_x_27)) <= -13.0) && (((x_17 + (-1.0 * _x_x_27)) <= -12.0) && (((x_15 + (-1.0 * _x_x_27)) <= -15.0) && (((x_11 + (-1.0 * _x_x_27)) <= -15.0) && (((x_10 + (-1.0 * _x_x_27)) <= -16.0) && (((x_8 + (-1.0 * _x_x_27)) <= -5.0) && (((x_7 + (-1.0 * _x_x_27)) <= -11.0) && (((x_6 + (-1.0 * _x_x_27)) <= -17.0) && (((x_5 + (-1.0 * _x_x_27)) <= -2.0) && (((x_4 + (-1.0 * _x_x_27)) <= -15.0) && (((x_3 + (-1.0 * _x_x_27)) <= -6.0) && (((x_1 + (-1.0 * _x_x_27)) <= -5.0) && ((x_2 + (-1.0 * _x_x_27)) <= -1.0)))))))))))))) && (((x_26 + (-1.0 * _x_x_27)) == -17.0) || (((x_25 + (-1.0 * _x_x_27)) == -13.0) || (((x_17 + (-1.0 * _x_x_27)) == -12.0) || (((x_15 + (-1.0 * _x_x_27)) == -15.0) || (((x_11 + (-1.0 * _x_x_27)) == -15.0) || (((x_10 + (-1.0 * _x_x_27)) == -16.0) || (((x_8 + (-1.0 * _x_x_27)) == -5.0) || (((x_7 + (-1.0 * _x_x_27)) == -11.0) || (((x_6 + (-1.0 * _x_x_27)) == -17.0) || (((x_5 + (-1.0 * _x_x_27)) == -2.0) || (((x_4 + (-1.0 * _x_x_27)) == -15.0) || (((x_3 + (-1.0 * _x_x_27)) == -6.0) || (((x_1 + (-1.0 * _x_x_27)) == -5.0) || ((x_2 + (-1.0 * _x_x_27)) == -1.0)))))))))))))))) && ((_EL_X_2381 == _x__EL_X_2379) && ((_EL_U_2377 == ((_x__EL_U_2377 && ((_x_x_12 + (-1.0 * _x_x_19)) <= 20.0)) || (19.0 <= (_x_x_7 + (-1.0 * _x_x_24))))) && (_EL_X_2379 == ((_x__EL_U_2377 && ((_x_x_12 + (-1.0 * _x_x_19)) <= 20.0)) || (19.0 <= (_x_x_7 + (-1.0 * _x_x_24))))))));
_EL_X_2381 = _x__EL_X_2381;
x_21 = _x_x_21;
x_9 = _x_x_9;
x_2 = _x_x_2;
x_1 = _x_x_1;
x_13 = _x_x_13;
x_3 = _x_x_3;
x_4 = _x_x_4;
x_16 = _x_x_16;
x_24 = _x_x_24;
x_5 = _x_x_5;
x_6 = _x_x_6;
x_7 = _x_x_7;
x_8 = _x_x_8;
_EL_X_2379 = _x__EL_X_2379;
_EL_U_2377 = _x__EL_U_2377;
x_10 = _x_x_10;
x_20 = _x_x_20;
x_11 = _x_x_11;
x_22 = _x_x_22;
x_15 = _x_x_15;
x_17 = _x_x_17;
x_25 = _x_x_25;
x_26 = _x_x_26;
x_12 = _x_x_12;
x_14 = _x_x_14;
x_18 = _x_x_18;
x_19 = _x_x_19;
x_23 = _x_x_23;
x_0 = _x_x_0;
x_27 = _x_x_27;
}
}
|
the_stack_data/1033972.c | // (c) Copyright 2002. Adobe Systems, Incorporated. All rights reserved.
// $Id: $
// $DateTime: $
// $Change: $
// $Author: $
|
the_stack_data/89199387.c | int test() {
int a = 0;
return a;
}
|
the_stack_data/178265700.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <math.h>
int main(int argc, char **argv) {
char *s = malloc(sizeof(char*) * 3);
//char s[] = malloc(sizeof(char*) * 3); // Wrong!
//s = "Alice";
//(s + 1) = &"Bob";
//(s + 2) = "Charlie";
//s = {"Alice", "Bob", "Charlie"};
free(s);
return 0;
}
|
the_stack_data/26700948.c | #include<stdio.h>
struct Student
{
int number;//学号
float score;//分数
struct Student *next;//下一个节点
};
int main()
{
struct Student stu1,stu2,stu3;//3个节点
struct Student *head;//头结点
struct Student *p;//移动指针
stu1.number = 1001;
stu1.score = 89.5;
stu2.number = 1002;
stu2.score = 99.5;
stu3.number = 1003;
stu3.score = 78.5;
//构建静态链表
head = &stu1;
stu1.next = &stu2;
stu2.next = &stu3;
stu3.next = NULL;
p = head;//p也指向stu1节点
do
{
printf("%d,%5.1f\n",p->number,p->score);
p = p->next;
}while(p != NULL);
return 0;
}
|
the_stack_data/182954319.c | #ifdef __cplusplus
extern "C"
#endif
void ccmalloc_check_for_integrity();
#include <stdlib.h>
int
main()
{
char * a = (char*) malloc(100);
a[-5]='0'; /* this is exactly in the second
* word below `a' on 32 bit machines
*/
ccmalloc_check_for_integrity();
malloc(20);
malloc(30);
malloc(40);
malloc(50);
exit(0);
return 0;
}
|
the_stack_data/45451373.c | /* File: driver.c -- driver for the parser
** Author(s): Yifei Dong
** Contact: [email protected]
**
** Copyright (C) SUNY at Stony Brook, 1998-2000
**
** XMC is free software; you can redistribute it and/or modify it under the
** terms of the GNU Library General Public License as published by the Free
** Software Foundation; either version 2 of the License, or (at your option)
** any later version.
**
** XMC is distributed in the hope that it will be useful, but WITHOUT ANY
** WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
** FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for
** more details.
**
** You should have received a copy of the GNU Library General Public License
** along with XMC; if not, write to the Free Software Foundation,
** Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
**
** $Id: driver.c,v 1.4 2010-08-19 15:03:39 spyrosh Exp $
**
*/
#include <stdio.h>
#include <string.h>
extern FILE *yyin;
extern FILE* error_file;
extern int yyparse();
extern int line_no, char_no;
extern char* yytext;
extern char* fn_source;
int num_errs;
void warning(char* msg, char* arg)
{
fprintf(error_file, "%s:%d/%d: ",
fn_source, line_no, char_no);
fprintf(error_file, msg, arg);
fprintf(error_file, "\n");
num_errs++;
}
int yyerror(char *errtype)
{
fprintf(error_file, "%s:%d/%d: %s near token `%s'.\n",
fn_source,
line_no, char_no, errtype, yytext);
num_errs++;
return 0;
}
|
the_stack_data/1256135.c | #include <stdio.h>
int main() {
printf("Hello, hell!\n");
return 0;
}
|
the_stack_data/741373.c | /* tcpserver.c
*
* Copyright (c) 2001 Sean Walton and Macmillan Publishers. Use may be in
* whole or in part in accordance to the General Public License (GPL).
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
/*****************************************************************************/
/*** tcpserver.c ***/
/*** ***/
/*** Demonstrate an TCP server. ***/
/*****************************************************************************/
#include <sys/socket.h>
#include <sys/types.h>
#include <resolv.h>
#include <pthread.h>
#include <netdb.h>
void panic(char *msg);
#define panic(m) {perror(m); abort();}
/*****************************************************************************/
/*** This program creates a simple echo server: whatever you send it, it ***/
/*** echoes the message back. ***/
/*****************************************************************************/
void *servlet(void *arg) /* servlet thread */
{ FILE *fp = (FILE*)arg; /* get & convert the data */
char s[100];
/* proc client's requests */
while (fgets(s, sizeof(s), fp) != 0 && strcmp(s, "bye\n") != 0)
{
printf("msg: %s", s); /* display message */
fputs(s, fp); /* echo it back */
}
fclose(fp); /* close the client's channel */
return 0; /* terminate the thread */
}
int main(int count, char *args[])
{ struct sockaddr_in addr;
int sd, port;
if ( count != 2 )
{
printf("usage: %s <protocol or portnum>\n", args[0]);
exit(0);
}
/*---Get server's IP and standard service connection--*/
if ( !isdigit(args[1][0]) )
{
struct servent *srv = getservbyname(args[1], "tcp");
if ( srv == NULL )
panic(args[1]);
printf("%s: port=%d\n", srv->s_name, ntohs(srv->s_port));
port = srv->s_port;
}
else
port = htons(atoi(args[1]));
/*--- create socket ---*/
sd = socket(PF_INET, SOCK_STREAM, 0);
if ( sd < 0 )
panic("socket");
/*--- bind port/address to socket ---*/
memset(&addr, 0, sizeof(addr));
addr.sin_family = AF_INET;
addr.sin_port = port;
addr.sin_addr.s_addr = INADDR_ANY; /* any interface */
if ( bind(sd, (struct sockaddr*)&addr, sizeof(addr)) != 0 )
panic("bind");
/*--- make into listener with 10 slots ---*/
if ( listen(sd, 10) != 0 )
panic("listen")
/*--- begin waiting for connections ---*/
else
{ int sd;
pthread_t child;
FILE *fp;
while (1) /* process all incoming clients */
{
sd = accept(sd, 0, 0); /* accept connection */
fp = fdopen(sd, "r+"); /* convert into FILE* */
pthread_create(&child, 0, servlet, fp); /* start thread */
pthread_detach(child); /* don't track it */
}
}
}
|
the_stack_data/175143377.c | #include <stdio.h>
int main ()
{
int aux, a, b, c;
scanf("%d\n%d\n%d", &a, &b, &c);
if(a < b || a < c)
{
if(b > c)
{
aux = a;
a = b;
b = aux;
}else{
aux = a;
a = c;
c = aux;
}
}
if(b < c)
{
aux = b;
b = c;
c = aux;
}
printf("%d\n%d\n%d\n", a, b, c);
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.