file
stringlengths 18
26
| data
stringlengths 3
1.04M
|
|---|---|
the_stack_data/82040.c
|
#include <stdio.h>
#include <pthread.h>
#include <unistd.h>
#include <stdlib.h>
#include <errno.h>
/*
考虑到不同处理器执行速度可能差别巨大，包括 total 可能会被调整以方便观察，这里将线程
设置成可结合的状态，后面阻塞等待线程完成。
*/
void *thread_function (void *arg) {
/* 循环次数，如果CPU性能差导致执行时间太久，可以减少这个值 */
int total = 100000;
int i;
int *temp;
int start, end;
/* 转换成int类型的指针 */
temp = (int *)arg;
start = *temp;
for (i = 0; i < total; i++) {
/* 指针指向的整数加1，然后保存回去 */
*temp = *temp + 1;
}
end = *temp;
printf("%d\t->\t%d\n", start, end);
}
/* 线程创建失败用来打印错误消息 */
void print_error_info(int result) {
switch (result) {
case EAGAIN:
printf("资源不足，无法创建另一个线程，或线程数量达到操作系统的极限\n");
break;
case EINVAL:
printf("线程的运行设置无效，问题出现在pthread_create的第二个输入参数\n");
break;
case EPERM:
printf("没有权限设置调度策略和其它的参数\n");
break;
default:
printf("出现了意料之外的异常情况\n");
}
}
int main(void) {
int i, result;
/* 所有线程都能操作的变量 */
int share = 0;
/* 线程数 */
int thread_num = 16;
/* 存线程ID的数组 */
pthread_t *threads;
/* 线程配置 */
pthread_attr_t attr;
/* 申请一组内存空间，用来存放线程ID的数组 */
threads = (pthread_t *)calloc(thread_num, sizeof(pthread_t));
for (i = 0; i < thread_num; i++) {
/* 首先设置线程的配置 */
if (0 != pthread_attr_init(&attr)) {
printf("属性设置初始化失败\n");
return 0;
}
/* 下面会等待这些线程执行完成，所以这里设置成可结合状态 */
if (0 != pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_JOINABLE)) {
printf("设置可结合状态失败\n");
return 0;
}
/* 设置调度策略为分时调度策略 */
if (0 != pthread_attr_setschedpolicy(&attr, SCHED_RR)) {
printf("设置调度策略失败\n");
return 0;
}
/* 创建线程 */
result = pthread_create(&(threads[i]), &attr, &thread_function, (void *)(&share));
if (0 != result) {
printf("创建第 %d 个线程时失败了\n", i + 1);
print_error_info(result);
return 0;
}
/* 线程创建完成后销毁线程配置项 */
if (0 != pthread_attr_destroy(&attr)) {
printf("属性销毁失败\n");
return 0;
}
}
/* 阻塞等线程执行完成 */
for (i = 0; i < thread_num; i++) {
if (0 != pthread_join(threads[i], NULL)) {
printf("pthread_join()调用出现异常\n");
return 0;
}
}
printf("进程执行完成\n");
/* 释放线程数组占用的内存 */
free(threads);
return 0;
}
|
the_stack_data/424666.c
|
//{{BLOCK(GalleryButtonPauseRight)
//======================================================================
//
// GalleryButtonPauseRight, 56x32@2,
// + 28 tiles not compressed
// + regular map (flat), not compressed, 7x4
// Total size: 464 + 56 = 520
//
// Exported by Cearn's GBA Image Transmogrifier, v0.8.6
// ( http://www.coranac.com/projects/#grit )
//
//======================================================================
const unsigned int GalleryButtonPauseRightTiles[116] __attribute__((aligned(4)))=
{
0x00000000,0xFFF00000,0xFD705570,0xFD70CD70,
0x00000000,0x000F0000,0x0035003D,0x55F5FFF5,0x00000000,0x00000000,0x00000000,0x5F5FFFFF,
0x00000000,0x00000000,0x00000000,0xF55FFFFF,0x00000000,0x00000000,0x00000000,0x0F5503FF,
0xAC000000,0xAAB0AAC0,0x5AAC6AB0,0x5AAC5AAC,0x00EA0000,0x3AAA0EAA,0xEA963AA5,0xEA95EA96,
0xFD705570,0x0D700D70,0x00000FF0,0x00000000,0x55FF7FFD,0x55F07D70,0x0000FFC0,0x00000000,
0x5F5D5F5D,0x557D5F5D,0x0000FFFF,0x00000000,0x7D5F7FD7,0xFD5775FF,0x0000CFFF,0x00000000,
0x0D550D7D,0x03550FFD,0x000003FF,0x00000000,0x5AAC5AAC,0xAABC5A9C,0xA5F0AA70,0xFC005FC0,
0xEA96EA96,0xFAAADA96,0x3D6A36AA,0x00FF0FD5,0x00000000,0xFFF00000,0xFD705570,0xFD70CD70,
0x00000000,0x000F0000,0x0035003D,0x55F5FFF5,0x00000000,0x00000000,0x00000000,0x5F5FFFFF,
0x00000000,0x00000000,0x00000000,0xF55FFFFF,0x00000000,0x00000000,0x00000000,0x0F5503FF,
0xFC000000,0xAAF0AFC0,0x6ABCAAB0,0x5AAC5AAC,0x00FF0000,0x3EAA0FEA,0xFAA53AAA,0xEA96EA96,
0xFD705570,0x0D700D70,0x00000FF0,0x00000000,0x55FF7FFD,0x55F07D70,0x0000FFC0,0x00000000,
0x5F5D5F5D,0x557D5F5D,0x0000FFFF,0x00000000,0x7D5F7FD7,0xFD5775FF,0x0000CFFF,0x00000000,
0x0D550D7D,0x03550FFD,0x000003FF,0x00000000,0x5AAC5AAC,0x5ABC5AAC,0xAAF0AAB0,0xFC00AFC0,
0xEA96EA95,0xFA96EA96,0x3EAA3AAA,0x00FF0FEA,
};
const unsigned short GalleryButtonPauseRightMap[28] __attribute__((aligned(4)))=
{
0x0000,0x0001,0x0002,0x0003,0x0004,0x0005,0x0006,0x0007,
0x0008,0x0009,0x000a,0x000b,0x000c,0x000d,0x000e,0x000f,
0x0010,0x0011,0x0012,0x0013,0x0014,0x0015,0x0016,0x0017,
0x0018,0x0019,0x001a,0x001b,
};
//}}BLOCK(GalleryButtonPauseRight)
|
the_stack_data/51700907.c
|
/*numPass=5, numTotal=5
Verdict:ACCEPTED, Visibility:1, Input:"1 5 7 2", ExpOutput:"The second largest number is 5", Output:"The second largest number is 5"
Verdict:ACCEPTED, Visibility:1, Input:"8 6 4 2", ExpOutput:"The second largest number is 6", Output:"The second largest number is 6"
Verdict:ACCEPTED, Visibility:0, Input:"1 10 15 3", ExpOutput:"The second largest number is 10", Output:"The second largest number is 10"
Verdict:ACCEPTED, Visibility:0, Input:"1 3 3 2 ", ExpOutput:"The second largest number is 3", Output:"The second largest number is 3"
Verdict:ACCEPTED, Visibility:0, Input:"1 1 1 2", ExpOutput:"The second largest number is 1", Output:"The second largest number is 1"
*/
#include<stdio.h>
int main()
{ int a,b,c,d;
scanf("%d %d %d %d",&a,&b,&c,&d);//input the numbers
int g1=a,g2=c,s;
if(b>a)
{g1=b;
b=a;
}//g1 stores greatest and b stores lowest among a and b
if(d>g2)
{g2=d;
d=c;
}//g2 stores greatest and d stores lowest among c and d
if(g1>g2)
{if(b>g2)
s=b;
else
s=g2;
}
else
{if(d>g1)
s=d;
else
s=g1;
}
printf("The second largest number is %d",s);
return 0;
}
|
the_stack_data/860127.c
|
#include <stdio.h>
#include <stdlib.h>
int get_int() {
int ch, i, s;
while (((ch = getchar()) == ' ') || (ch == '\n'));
s = (ch == '-') ? 1, ch = getchar() : 0;
for (i = 0; ch>='0' && ch<='9'; ch = getchar()) i = 10 * i + (ch - '0');
if (s) return -i; return i;
}
int p[10000];
int cmp(int *a, int *b) { return *b-*a; }
int main() {
register int i, n, m;
int cmp();
n = get_int(); m = get_int();
for (i = 0; i < n; i++) p[i] = get_int();
qsort(p, n, sizeof(int), cmp);
for (i = 0; i < m; i++) printf("%d\n", p[i]);
return 0;
}
|
the_stack_data/193893688.c
|
#include <stdio.h>
int main()
{
int num[100], n,i,low, high, mid,found=0,key;
printf("Enter the number of elements:\n");
scanf("%d",&n);
printf("Enter the numbers in ascending order\n");
for (i=0; i<n; i++)
scanf("%d",&num[i]);
printf("Please enter the number to be searched\n ");
scanf("%d",&key);
low=0;
high=n-1;
while(low<=high && !found)
{
mid=(low+high)/2;
if (num[mid]==key)
found=1;
else if (key>num[mid])
low=mid+1;
else
high=mid-1;
}
if (found==1)
printf ("\nNumber found in position %d",mid+1);
else
printf("\nNumber not found !!!");
return 0;
}
|
the_stack_data/57950324.c
|
/*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
void array_access_Ok(int x, int y) {
int a[1];
if (x + y == 1) {
a[x + y - 1] = 0;
}
}
void call_array_access_Ok() { array_access_Ok(0, 0); }
void FP_array_access2_Ok(int x, int y) {
int a[1];
if (x + y == 1) {
if (x + y != 1) {
a[3] = 0;
}
}
}
void FP_array_access3_Ok(int x, int* y) {
int a[1];
*y = x + 1;
if (x + 1 == 1) {
if (*y != 1) {
a[3] = 0;
}
}
}
void FP_array_access4_Ok(int x, int* y) {
int a[1];
*y = x * 3 + 1;
if (x * 3 + 1 == 1) {
if (*y != 1) {
a[3] = 0;
}
}
}
|
the_stack_data/847661.c
|
#include <stdio.h>
#include <stdlib.h>
typedef struct {
int dia;
int mes;
int year;
} sFecha;
typedef struct {
int legajo;
char nombre[20];
char genero;
float sueldo;
sFecha fecha;
} sEmpleado;
// clase 13/05/2019
void leerPuntero (int* p);
void mostrarVector1(int vec[], int tam);
void mostrarVector2(int vec[], int tam);
void mostrarVector3(int* vec, int tam);
void mostrarVector4(int* vec, int tam);
void mostrarCadena(char* nombre);
int main()
{
sEmpleado unEmpleado[] = { { 1234, "juan", 'm', 3000, {13,5,2019} }, { 1232, "peter", 'm', 3000, {13,5,2019}} };
sEmpleado* punteroEmpleado;
punteroEmpleado = &unEmpleado[0];
printf("dia: %d\n\n", punteroEmpleado->fecha.dia);
printf("dia: %s\n\n", (*punteroEmpleado).nombre);
//---------------------------------------------------------------------------------------
int x = 10;
int* p; // este P va a guardar la direccion de memoria de una variable entera (leelo como complemento A2)
p = &x; // P apunta a X (P, guarda a la direccion de memoria de X, pero la direccion, no el valor)
// DOS FORMAS DE MOSTRAR X
printf("X sola, vale %d\n\n", x);
printf("P, guarda la direccion de memoria de X. y en esa direccion, esta guardado del valor: %d \n\n", *p);
// %x es HEXADECIMAL %p es POINTER
printf("-----------------------------------------------\n\n");
printf("X direccion de memoria %p\n", &x);
printf("P direccion de memoria %p\n\n", p);
printf("-----------------------------------------------\n\n");
printf("antes de la funcion leer puntero, X vale: %d\n\n", x);
leerPuntero(&x);
printf("despues de la funcion leer puntero, X vale: %d\n\n", x);
printf("-----------------------------------------------\n\n");
int o = 10;
int* j = &o;
int** r = &j;
printf("la variable 'r', tiene la direccion de 'J', y 'J' tiene la direccion de 'o', y 'o' vale: %d\n", **r); //puntero a puntero a puntero a puntero etc etc etc
printf("\n-----------------------------------------------\n\n");
int vec[] = {3,5,2,4,3}; // esto es asi a partir de memoria dinamica
printf("&vec = %x || vec = %x || *vec = %x\n\n", &vec, vec, *vec);
printf("VECTOR RECORRIDO CON *(VEC+I): ");
for (int i = 0; i < 5; i++)
{
printf("%d ", *(vec+i));
}
printf("\n\n-----------------------LLAMADAS DE FUNCIONES-----------------------\n\n");
int tam = 5;
mostrarVector1(vec, tam);
mostrarVector2(vec, tam);
mostrarVector3(vec, tam);
mostrarVector4(vec, tam);
printf("-----------------------------------------------\n\n");
char nombre[20] = "sebastian";
mostrarCadena(nombre);
return 0;
}
void leerPuntero (int* p) // int* p va a campturar una direccion de memoria de un entero (ejemplo: "&x" y X es un int)
{
*p = 38;
}
void mostrarVector1(int vec[], int tam) //recibe con nomenclatura vectorial y trabaja con la misma
{
for (int i = 0; i < tam; i++)
{
printf("%d ", vec[i]);
}
printf("end of function...\n\n");
} // Lo correcto es esto. si lo recibo como rochete, lo trabajo como corchete. COHERENCIA, DUH
void mostrarVector2(int vec[], int tam) //recibe con nomenclatura vectorial y trabaja con nom. puntero
{
for (int i = 0; i < tam; i++)
{
printf("%d ", *(vec+i));
}
printf("end of function...\n\n");
} // NO ESTA BIEN VISTO, NO NO NO NO NO >:C
void mostrarVector3(int* vec, int tam) //recibe con nomenclatura puntero y trabaja con nom. vectorial
{
for (int i = 0; i < tam; i++)
{
printf("%d ", vec[i]);
}
printf("end of function...\n\n");
} // NO ESTA BIEN VISTO, NO NO NO NO NO >:C
void mostrarVector4(int* vec, int tam) //recibe con nomenclatura puntero y trabaja con la misma
{
for (int i = 0; i < tam; i++)
{
printf("%d ", *(vec+i));
}
printf("end of function...\n\n");
} // esto tambien esta correcto, si utilizo puntero, trabajo con puntero COHERENCIA, DUH UTILIZAR ESTO A TODA COSTA PROGRAMADOR PROFESIONAL
void mostrarCadena(char* nombre)
{
char* x = nombre;
while ( *x != '\0' )
{
printf("%c", *x);
x++;
}
printf("\n\nend of function...\n\n");
}
|
the_stack_data/194735.c
|
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <unistd.h>
#include <pthread.h>
#include <string.h>
typedef struct {
char* readbuffer;
unsigned short* values;
int count;
unsigned int sum;
}SParams;
int cmpfunc (const void * a, const void * b) {
return ( *(unsigned short*)a - *(unsigned short*)b );
}
void printvalues(SParams* params) {
for(int i = 0; i < params->count; i++) {
printf("%d", params->values[i]);
}
printf("\n");
printf("sum: '%u'\n", params->sum);
}
void* convertandsum(void* arg) {
SParams* params = (SParams*) arg;
char* p;
unsigned short* pv;
for(p = params->readbuffer, pv = params->values;
p < params->readbuffer + params->count; p++, pv++) {
*pv = ((unsigned short)*p) - 0x30; // Convertir digito en char a entero
params->sum += *pv;
}
return NULL;
}
void* sort(void* arg) {
SParams* params = (SParams*) arg;
qsort(params->values, params->count, sizeof(unsigned short), cmpfunc);
return NULL;
}
int main(int argc, char** argv) {
printf("Iniciando proceso hijo, pid '%d'.\n", getpid());
char readbuff[128];
char* values;
int trc = 0;
int cz = 4;
int rc = 0;
if (argc < 2) {
fprintf(stderr, "Uso: %s <fd>\n", argv[0]);
exit(EXIT_FAILURE);
}
int fd = atoi((char *)argv[1]);
values = malloc(sizeof(char)*128);
while ((rc = read(fd, readbuff, 128)) > 0) {
if (readbuff[0] == '\n') {
break;
}
else if (readbuff[rc-1] == '\n') {
rc--;
}
if (trc + rc > cz) {
cz = 2 * (trc + rc);
values = realloc(values, sizeof(char)*cz);
// printf("values readbuffer size increased to '%d'.\n", cz);
}
memmove(values + trc, readbuff, rc);
trc += rc;
// printf("child read '%d' bytes.\n", rc);
}
pthread_t t1, t2;
pthread_attr_t tattr;
SParams params = { values, NULL, trc, 0 };
params.values = (unsigned short*)malloc(sizeof(unsigned short)*trc);
if (pthread_attr_init(&tattr)) {
fprintf(stderr, "Error iniciando atributos de thread\n");
}
// Convertir valores en array
if (pthread_create(&t1, &tattr, convertandsum, (void *)¶ms)) {
fprintf(stderr, "Error iniciando thread 't1'\n");
}
pthread_join(t1, NULL);
printvalues(¶ms);
// Ordenar valores en array
if (pthread_create(&t2, &tattr, sort, (void *)¶ms)) {
fprintf(stderr, "Error iniciando thread 't2'\n");
}
pthread_join(t2, NULL);
printvalues(¶ms);
printf("Proceso hijo ha terminado.\n");
free(values);
free(params.values);
return(EXIT_SUCCESS);
}
|
the_stack_data/900898.c
|
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
#include <math.h>
#define forr(i, a, b) for(int i=a;i<b;i++)
#define forp(i, a, b) for(int i=a;i<=b;i++)
#define times(n) int _##n=n;while(_##n--)
#define mset(d, v) memset(d,v,sizeof(d))
#define min(a, b) (((a)<=(b))?(a):(b))
#define swap(a, b) (a)^=(b)^=(a)^=(b)
#define input(x) scanf("%d",&x)
#define read(x) int x;input(x)
#define prtl() putchar('\n')
#define prti(x) printf("%d", x)
#define prta(x, a, b) forr(i,a,b){if(i!=a)putchar(' ');prti(x[i]);}
int cmp(const void* a,const void *b){return *((int*)a)-*((int*)b);}
#define N 1000
/* Heaps (30) */
int heap[N+1];
bool maxheap, minheap;
bool prtflag, ok;
void bt_heapchk(int cur, int n) {
int left = cur << 1, right = left | 0x01;
if (!ok && left <= n) {
minheap |= heap[left] >= heap[cur];
maxheap |= heap[left] <= heap[cur];
if (maxheap ^ minheap) bt_heapchk(left, n);
else ok = true;
}
if (!ok && right <= n) {
minheap |= heap[right] >= heap[cur];
maxheap |= heap[right] <= heap[cur];
if (maxheap ^ minheap) bt_heapchk(right, n);
else ok = true;
}
}
void bt_postorder(int cur, int n) {
int left = cur << 1, right = left | 0x01;
if (left <= n) bt_postorder(left, n);
if (right <= n) bt_postorder(right, n);
if (prtflag) putchar(' ');
else prtflag = true;
prti(heap[cur]);
}
int main() {
read(m); read(n); times(m) {
forp(i, 1, n) input(heap[i]);
maxheap = minheap = ok = false;
bt_heapchk(1, n);
if (maxheap && minheap) puts("Not Heap");
else if (maxheap) puts("Max Heap");
else puts("Min Heap");
prtflag = false;
bt_postorder(1, n);
prtl();
}
}
|
the_stack_data/969152.c
|
/**
* 사칙연산 구현하기
*/
# include <stdio.h>
int main(void) {
int x = 10;
int y = 20;
printf("x = %d 입니다.\n", x);
printf("y = %d 입니다.\n", y);
printf("x + y = %d입니다.\n", x + y);
printf("x - y = %d입니다.\n", x - y);
printf("x * y = %d입니다.\n", x * y);
printf("x / y = %d입니다.\n", x / y); // 몫만 봤을땐 0이고 나머지는 10이다
return 0;
}
|
the_stack_data/70450623.c
|
int d(int i,int p, int l, int m){
int k = i + p + m + l;
return k;
}
int main(){
int a;
a = d(120,5,7, (7*4)+1);
return a;
}
|
the_stack_data/54825654.c
|
// clang-format off
// RUN: %c-to-llvm %s | %apply-typeart -S 2>&1 | FileCheck %s
// clang-format on
#include <stdlib.h>
void test() {
int* p = (int*)malloc(42 * sizeof(int));
}
// CHECK: [[POINTER:%[0-9]+]] = call noalias i8* @malloc
// CHECK-NEXT: call void @__typeart_alloc(i8* [[POINTER]], i32 2, i64 42)
// CHECK-NEXT: bitcast i8* [[POINTER]] to i32*
// CHECK: TypeArtPass [Heap]
// CHECK-NEXT: Malloc{{[ ]*}}:{{[ ]*}}1
// CHECK-NEXT: Free{{[ ]*}}:{{[ ]*}}0
// CHECK-NEXT: Alloca{{[ ]*}}:{{[ ]*}}0
|
the_stack_data/193892500.c
|
#include "stdio.h"
int main(int argc, char const *argv[])
{
printf("hello world!\n");
return 0;
}
|
the_stack_data/153535.c
|
#include <stdio.h>
int main(void) {
int a;
scanf("%d", &a);
while (a--) {
int d;
float b;
scanf("%f", &b);
for (d = 0; b > 1; d++, b /= 2);
printf("%d dias\n", d);
}
return 0;
}
|
the_stack_data/3183.c
|
#include <stdio.h>
int main()
{
puts("Hello world.");
puts("good bye world.");
puts("its been a fun world.");
puts("a mad world.");
puts("a bad world.");
puts("Hello world.");
return 0;
}
|
the_stack_data/75138959.c
|
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
typedef long long ll;
ll arr[1000000];
void swap(ll *p, ll *q)
{
ll x = *p;
*p = *q;
*q = x;
}
/// MERGE SORT
void merge(ll *arr, ll p, ll q, ll r)
{
ll n1 = q - p + 1;
ll n2 = r - q;
ll left[n1 + 1];
ll right[n2 + 1];
for (ll i = 0; i < n1; i++)
left[i] = arr[p + i];
for (ll j = 0; j < n2; j++)
right[j] = arr[q + j + 1];
left[n1] = 999999999999999999;
right[n2] = 999999999999999999;
ll i = 0, j = 0;
for (ll k = p; k <= r; k++)
{
if (left[i] < right[j])
{
arr[k] = left[i];
i++;
}
else
{
arr[k] = right[j];
j++;
}
}
}
void mergeSort(ll *arr, ll p, ll r)
{
if (p < r)
{
ll q = (p + r) / 2;
//recursively divide
mergeSort(arr, p, q);
mergeSort(arr, q + 1, r);
//recursively merge and sort
merge(arr, p, q, r);
}
}
/// QUICK SORT
ll partition(ll *arr, ll low, ll high)
{
ll pivot = arr[high];
ll i = (low - 1);
for (ll j = low; j <= high - 1; j++)
{
if (arr[j] < pivot)
{
i++;
swap(&arr[i], &arr[j]);
}
}
swap(&arr[i + 1], &arr[high]);
return (i + 1);
}
void quickSort(ll *arr, ll low, ll high)
{
if (low < high)
{
ll pi = partition(arr, low, high);
quickSort(arr, low, pi - 1);
quickSort(arr, pi + 1, high);
}
}
/// HEAP SORT
void heapify(ll *arr, ll n, ll i)
{
ll largest = i;
ll l = 2 * i + 1;
ll r = 2 * i + 2;
if (l < n && arr[l] > arr[largest])
largest = l;
if (r < n && arr[r] > arr[largest])
largest = r;
if (largest != i)
{
swap(&arr[i], &arr[largest]);
heapify(arr, n, largest);
}
}
void heapSort(ll *arr, ll n)
{
for (ll i = n / 2 - 1; i >= 0; i--)
heapify(arr, n, i);
for (ll i = n - 1; i > 0; i--)
{
swap(&arr[0], &arr[i]);
heapify(arr, i, 0);
}
}
// void printArray(ll *arr, ll n)
// {
// for (ll i = 0; i < n; ++i)
// printf("%lld\t", arr[i]);
// printf("\n");
// }
int main()
{
srand(time(0));
ll n = 10;
FILE *fp;
fp = fopen("q1_plot_c.txt", "w");
if(fp == NULL){
printf("ERROR Opening File.\n");
}
double merge_sort_time, quick_sort_time, heap_sort_time, mst, qst, hst;
while (n <= 1000000)
{
mst = qst = hst = 0.0;
// ll arr[n];
clock_t time;
for (int k = 1; k <= 10; k++)
{
for (ll i = 0; i < n; i++)
{
arr[i] = rand();
}
///MERGE SORT BEGINS
time = clock();
///START
mergeSort(arr, 0, n - 1);
///END
time = clock() - time;
///MERGE SORT ENDS
mst += ((double)time) / CLOCKS_PER_SEC;
}
merge_sort_time = mst / 10;
for (int k = 1; k <= 10; k++)
{
for (ll i = 0; i < n; i++)
{
arr[i] = rand();
}
///QUICK SORT BEGINS
time = clock();
///START
quickSort(arr, 0, n - 1);
///END
time = clock() - time;
///QUICK SORT ENDS
qst += ((double)time) / CLOCKS_PER_SEC;
}
quick_sort_time = qst / 10;
for (int k = 1; k <= 10; k++)
{
for (ll i = 0; i < n; i++)
{
arr[i] = rand();
}
///HEAP SORT BEGINS
time = clock();
///START
heapSort(arr, n);
///END
time = clock() - time;
///HEAP SORT ENDS
hst += ((double)time) / CLOCKS_PER_SEC;
}
heap_sort_time = hst / 10;
fprintf(fp, "%lld, %lf, %lf, %lf\n", n, merge_sort_time, quick_sort_time, heap_sort_time);
n *= 10;
}
fclose(fp);
return 0;
}
|
the_stack_data/54092.c
|
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
double* readFile(char *file, int *N)
{
FILE *ifp;
double *V;
int i;
ifp = fopen(file, "r");
assert(ifp != NULL);
assert(fscanf(ifp,"%d", N) == 1);
assert(*N > 0);
V = malloc(*N * sizeof(double));
assert(V);
for (i=0; i<*N; i++)
assert(fscanf(ifp, "%lg", &V[i]) == 1);
fclose(ifp);
return(V);
}
void writeFile(char *file, int N, double *V)
{
FILE *ofp;
int i;
ofp = fopen(file,"w");
assert(ofp);
fprintf(ofp, "%d\n", N);
for(i=0; i<N; i++)
fprintf(ofp, "%lg\n", V[i]);
fclose(ofp);
}
void sortVec(int N, double *V)
{
int i,j;
for (i=0; i<N-1; i++)
for (j=N-1; j>i; j--)
if (V[j] < V[j-1])
{
double temp = V[j];
V[j] = V[j-1];
V[j-1] = temp;
}
}
int main(int argc, char *argv[])
{
int N;
double *A;
if(argc != 3)
{
printf("USAGE: %s <input file> <output/sorted file>\n", argv[0]);
exit(1);
}
A = readFile(argv[1], &N);
sortVec(N, A);
writeFile(argv[2], N, A);
free(A);
return 0;
}
|
the_stack_data/176705764.c
|
/*
* iopl.c - Test case for a Linux on Xen 64-bit bug
* Copyright (c) 2015 Andrew Lutomirski
*/
#define _GNU_SOURCE
#include <err.h>
#include <stdio.h>
#include <stdint.h>
#include <signal.h>
#include <setjmp.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <stdbool.h>
#include <sched.h>
#include <sys/io.h>
static int nerrs = 0;
static void sethandler(int sig, void (*handler)(int, siginfo_t *, void *),
int flags)
{
struct sigaction sa;
memset(&sa, 0, sizeof(sa));
sa.sa_sigaction = handler;
sa.sa_flags = SA_SIGINFO | flags;
sigemptyset(&sa.sa_mask);
if (sigaction(sig, &sa, 0))
err(1, "sigaction");
}
static jmp_buf jmpbuf;
static void sigsegv(int sig, siginfo_t *si, void *ctx_void)
{
siglongjmp(jmpbuf, 1);
}
int main(void)
{
cpu_set_t cpuset;
CPU_ZERO(&cpuset);
CPU_SET(0, &cpuset);
if (sched_setaffinity(0, sizeof(cpuset), &cpuset) != 0)
err(1, "sched_setaffinity to CPU 0");
/* Probe for iopl support. Note that iopl(0) works even as nonroot. */
if (iopl(3) != 0) {
printf("[OK]\tiopl(3) failed (%d) -- try running as root\n",
errno);
return 0;
}
/* Restore our original state prior to starting the test. */
if (iopl(0) != 0)
err(1, "iopl(0)");
pid_t child = fork();
if (child == -1)
err(1, "fork");
if (child == 0) {
printf("\tchild: set IOPL to 3\n");
if (iopl(3) != 0)
err(1, "iopl");
printf("[RUN]\tchild: write to 0x80\n");
asm volatile ("outb %%al, $0x80" : : "a" (0));
return 0;
} else {
int status;
if (waitpid(child, &status, 0) != child ||
!WIFEXITED(status)) {
printf("[FAIL]\tChild died\n");
nerrs++;
} else if (WEXITSTATUS(status) != 0) {
printf("[FAIL]\tChild failed\n");
nerrs++;
} else {
printf("[OK]\tChild succeeded\n");
}
}
printf("[RUN]\tparent: write to 0x80 (should fail)\n");
sethandler(SIGSEGV, sigsegv, 0);
if (sigsetjmp(jmpbuf, 1) != 0) {
printf("[OK]\twrite was denied\n");
} else {
asm volatile ("outb %%al, $0x80" : : "a" (0));
printf("[FAIL]\twrite was allowed\n");
nerrs++;
}
/* Test the capability checks. */
printf("\tiopl(3)\n");
if (iopl(3) != 0)
err(1, "iopl(3)");
printf("\tDrop privileges\n");
if (setresuid(1, 1, 1) != 0) {
printf("[WARN]\tDropping privileges failed\n");
goto done;
}
printf("[RUN]\tiopl(3) unprivileged but with IOPL==3\n");
if (iopl(3) != 0) {
printf("[FAIL]\tiopl(3) should work if iopl is already 3 even if unprivileged\n");
nerrs++;
}
printf("[RUN]\tiopl(0) unprivileged\n");
if (iopl(0) != 0) {
printf("[FAIL]\tiopl(0) should work if iopl is already 3 even if unprivileged\n");
nerrs++;
}
printf("[RUN]\tiopl(3) unprivileged\n");
if (iopl(3) == 0) {
printf("[FAIL]\tiopl(3) should fail if when unprivileged if iopl==0\n");
nerrs++;
} else {
printf("[OK]\tFailed as expected\n");
}
done:
return nerrs ? 1 : 0;
}
|
the_stack_data/156394098.c
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
int main (int argc, char *argv[])
{
float valor_somado;
float valor_lido;
if (argc==2) {
valor_somado = atoi(argv[1]);
scanf("%f",&valor_lido);
printf("%f\n",valor_lido + valor_somado);
return 0;
}
if (argc==3)
if (strcmp(argv[1],"-c")==0) {
valor_somado = atoi(argv[2]);
for(;;) {
scanf("%f",&valor_lido);
printf("%f\n",valor_lido + valor_somado);
fflush(stdout);
}
}
return -1;
}
|
the_stack_data/218893648.c
|
#include <stdio.h>
int main(void) {
int n, k;
scanf("%d%d", &n, &k);
int r, g, b;
r = ((n * 2) + k - 1)/k;
g = ((n * 5) + k - 1)/k;
b = ((n * 8) + k - 1)/k;
int tot = r + g + b;
printf("%d", tot);
return 0;
}
|
the_stack_data/113827.c
|
/*
TASK : 1
AUTHOR: Hydrolyzed~
GITHUB: MasterIceZ
LANG : C
SCHOOL: RYW
*/
#include<stdio.h>
int main(){
printf("Hello, world");
printf("\n");
return 0;
}
|
the_stack_data/93292.c
|
// RUN: %clang_cc1 -triple i686 %s -emit-llvm -o - | FileCheck %s
// RUN: %clang_cc1 -triple x86_64 %s -emit-llvm -o - | FileCheck %s
// RUN: %clang_cc1 -triple arm %s -emit-llvm -o - | FileCheck %s
// RUN: %clang_cc1 -triple mips %s -emit-llvm -o - | FileCheck %s
// RUN: %clang_cc1 -triple mipsel %s -emit-llvm -o - | FileCheck %s
// RUN: %clang_cc1 -triple powerpc %s -emit-llvm -o - | FileCheck %s
// RUN: %clang_cc1 -triple powerpc64 %s -emit-llvm -o - | FileCheck %s
// RUN: %clang_cc1 -triple s390x %s -emit-llvm -o - | FileCheck %s
// RUN: %clang_cc1 -triple sparc %s -emit-llvm -o - | FileCheck %s
// RUN: %clang_cc1 -triple sparcv9 %s -emit-llvm -o - | FileCheck %s
// RUN: %clang_cc1 -triple thumb %s -emit-llvm -o - | FileCheck %s
int mout0;
int min1;
int marray[2];
// CHECK: @single_m
void single_m(void)
{
// CHECK: call void asm "foo $1,$0", "=*m,*m[[CLOBBERS:[a-zA-Z0-9@%{},~_$ ]*\"]](i32* elementtype(i32) {{[a-zA-Z0-9@%]+}}, i32* elementtype(i32) {{[a-zA-Z0-9@%]+}})
asm("foo %1,%0" : "=m" (mout0) : "m" (min1));
}
// CHECK: @single_o
void single_o(void)
{
register int out0 = 0;
register int index = 1;
// Doesn't really do an offset...
//asm("foo %1, %2,%0" : "=r" (out0) : "o" (min1));
}
// CHECK: @single_V
void single_V(void)
{
// asm("foo %1,%0" : "=m" (mout0) : "V" (min1));
}
// CHECK: @single_lt
void single_lt(void)
{
register int out0 = 0;
register int in1 = 1;
// CHECK: call i32 asm "foo $1,$0", "=r,<r[[CLOBBERS]](i32 {{[a-zA-Z0-9@%]+}})
asm("foo %1,%0" : "=r" (out0) : "<r" (in1));
// CHECK: call i32 asm "foo $1,$0", "=r,r<[[CLOBBERS]](i32 {{[a-zA-Z0-9@%]+}})
asm("foo %1,%0" : "=r" (out0) : "r<" (in1));
}
// CHECK: @single_gt
void single_gt(void)
{
register int out0 = 0;
register int in1 = 1;
// CHECK: call i32 asm "foo $1,$0", "=r,>r[[CLOBBERS]](i32 {{[a-zA-Z0-9@%]+}})
asm("foo %1,%0" : "=r" (out0) : ">r" (in1));
// CHECK: call i32 asm "foo $1,$0", "=r,r>[[CLOBBERS]](i32 {{[a-zA-Z0-9@%]+}})
asm("foo %1,%0" : "=r" (out0) : "r>" (in1));
}
// CHECK: @single_r
void single_r(void)
{
register int out0 = 0;
register int in1 = 1;
// CHECK: call i32 asm "foo $1,$0", "=r,r[[CLOBBERS]](i32 {{[a-zA-Z0-9@%]+}})
asm("foo %1,%0" : "=r" (out0) : "r" (in1));
}
// CHECK: @single_i
void single_i(void)
{
register int out0 = 0;
// CHECK: call i32 asm "foo $1,$0", "=r,i[[CLOBBERS]](i32 1)
asm("foo %1,%0" : "=r" (out0) : "i" (1));
}
// CHECK: @single_n
void single_n(void)
{
register int out0 = 0;
// CHECK: call i32 asm "foo $1,$0", "=r,n[[CLOBBERS]](i32 1)
asm("foo %1,%0" : "=r" (out0) : "n" (1));
}
// CHECK: @single_E
void single_E(void)
{
register double out0 = 0.0;
// CHECK: call double asm "foo $1,$0", "=r,E[[CLOBBERS]](double {{[0-9.eE+-]+}})
asm("foo %1,%0" : "=r" (out0) : "E" (1.0e+01));
}
// CHECK: @single_F
void single_F(void)
{
register double out0 = 0.0;
// CHECK: call double asm "foo $1,$0", "=r,F[[CLOBBERS]](double {{[0-9.eE+-]+}})
asm("foo %1,%0" : "=r" (out0) : "F" (1.0));
}
// CHECK: @single_s
void single_s(void)
{
register int out0 = 0;
//asm("foo %1,%0" : "=r" (out0) : "s" (single_s));
}
// CHECK: @single_g
void single_g(void)
{
register int out0 = 0;
register int in1 = 1;
// CHECK: call i32 asm "foo $1,$0", "=r,imr[[CLOBBERS]](i32 {{[a-zA-Z0-9@%]+}})
asm("foo %1,%0" : "=r" (out0) : "g" (in1));
// CHECK: call i32 asm "foo $1,$0", "=r,imr[[CLOBBERS]](i32 {{[a-zA-Z0-9@%]+}})
asm("foo %1,%0" : "=r" (out0) : "g" (min1));
// CHECK: call i32 asm "foo $1,$0", "=r,imr[[CLOBBERS]](i32 1)
asm("foo %1,%0" : "=r" (out0) : "g" (1));
}
// CHECK: @single_X
void single_X(void)
{
register int out0 = 0;
register int in1 = 1;
// CHECK: call i32 asm "foo $1,$0", "=r,X[[CLOBBERS]](i32 {{[a-zA-Z0-9@%]+}})
asm("foo %1,%0" : "=r" (out0) : "X" (in1));
// CHECK: call i32 asm "foo $1,$0", "=r,X[[CLOBBERS]](i32 {{[a-zA-Z0-9@%]+}})
asm("foo %1,%0" : "=r" (out0) : "X" (min1));
// CHECK: call i32 asm "foo $1,$0", "=r,X[[CLOBBERS]](i32 1)
asm("foo %1,%0" : "=r" (out0) : "X" (1));
// CHECK: call i32 asm "foo $1,$0", "=r,X[[CLOBBERS]](i32* getelementptr inbounds ([2 x i32], [2 x i32]* {{[a-zA-Z0-9@%]+}}, i{{32|64}} 0, i{{32|64}} 0))
asm("foo %1,%0" : "=r" (out0) : "X" (marray));
// CHECK: call i32 asm "foo $1,$0", "=r,X[[CLOBBERS]](double {{[0-9.eE+-]+}})
asm("foo %1,%0" : "=r" (out0) : "X" (1.0e+01));
// CHECK: call i32 asm "foo $1,$0", "=r,X[[CLOBBERS]](double {{[0-9.eE+-]+}})
asm("foo %1,%0" : "=r" (out0) : "X" (1.0));
}
// CHECK: @single_p
void single_p(void)
{
register int out0 = 0;
// Constraint converted differently on different platforms moved to platform-specific.
// : call i32 asm "foo $1,$0", "=r,im[[CLOBBERS]](i32* getelementptr inbounds ([2 x i32], [2 x i32]* {{[a-zA-Z0-9@%]+}}, i{{32|64}} 0, i{{32|64}} 0))
asm("foo %1,%0" : "=r" (out0) : "p" (marray));
}
// CHECK: @multi_m
void multi_m(void)
{
// CHECK: call void asm "foo $1,$0", "=*m|r,m|r[[CLOBBERS]](i32* elementtype(i32) {{[a-zA-Z0-9@%]+}}, i32 {{[a-zA-Z0-9@%]+}})
asm("foo %1,%0" : "=m,r" (mout0) : "m,r" (min1));
}
// CHECK: @multi_o
void multi_o(void)
{
register int out0 = 0;
register int index = 1;
// Doesn't really do an offset...
//asm("foo %1, %2,%0" : "=r,r" (out0) : "r,o" (min1));
}
// CHECK: @multi_V
void multi_V(void)
{
// asm("foo %1,%0" : "=m,r" (mout0) : "r,V" (min1));
}
// CHECK: @multi_lt
void multi_lt(void)
{
register int out0 = 0;
register int in1 = 1;
// CHECK: call i32 asm "foo $1,$0", "=r|r,r|<r[[CLOBBERS]](i32 {{[a-zA-Z0-9@%]+}})
asm("foo %1,%0" : "=r,r" (out0) : "r,<r" (in1));
// CHECK: call i32 asm "foo $1,$0", "=r|r,r|r<[[CLOBBERS]](i32 {{[a-zA-Z0-9@%]+}})
asm("foo %1,%0" : "=r,r" (out0) : "r,r<" (in1));
}
// CHECK: @multi_gt
void multi_gt(void)
{
register int out0 = 0;
register int in1 = 1;
// CHECK: call i32 asm "foo $1,$0", "=r|r,r|>r[[CLOBBERS]](i32 {{[a-zA-Z0-9@%]+}})
asm("foo %1,%0" : "=r,r" (out0) : "r,>r" (in1));
// CHECK: call i32 asm "foo $1,$0", "=r|r,r|r>[[CLOBBERS]](i32 {{[a-zA-Z0-9@%]+}})
asm("foo %1,%0" : "=r,r" (out0) : "r,r>" (in1));
}
// CHECK: @multi_r
void multi_r(void)
{
register int out0 = 0;
register int in1 = 1;
// CHECK: call i32 asm "foo $1,$0", "=r|r,r|m[[CLOBBERS]](i32 {{[a-zA-Z0-9@%]+}})
asm("foo %1,%0" : "=r,r" (out0) : "r,m" (in1));
}
// CHECK: @multi_i
void multi_i(void)
{
register int out0 = 0;
// CHECK: call i32 asm "foo $1,$0", "=r|r,r|i[[CLOBBERS]](i32 1)
asm("foo %1,%0" : "=r,r" (out0) : "r,i" (1));
}
// CHECK: @multi_n
void multi_n(void)
{
register int out0 = 0;
// CHECK: call i32 asm "foo $1,$0", "=r|r,r|n[[CLOBBERS]](i32 1)
asm("foo %1,%0" : "=r,r" (out0) : "r,n" (1));
}
// CHECK: @multi_E
void multi_E(void)
{
register double out0 = 0.0;
// CHECK: call double asm "foo $1,$0", "=r|r,r|E[[CLOBBERS]](double {{[0-9.eE+-]+}})
asm("foo %1,%0" : "=r,r" (out0) : "r,E" (1.0e+01));
}
// CHECK: @multi_F
void multi_F(void)
{
register double out0 = 0.0;
// CHECK: call double asm "foo $1,$0", "=r|r,r|F[[CLOBBERS]](double {{[0-9.eE+-]+}})
asm("foo %1,%0" : "=r,r" (out0) : "r,F" (1.0));
}
// CHECK: @multi_s
void multi_s(void)
{
register int out0 = 0;
//asm("foo %1,%0" : "=r,r" (out0) : "r,s" (multi_s));
}
// CHECK: @multi_g
void multi_g(void)
{
register int out0 = 0;
register int in1 = 1;
// CHECK: call i32 asm "foo $1,$0", "=r|r,r|imr[[CLOBBERS]](i32 {{[a-zA-Z0-9@%]+}})
asm("foo %1,%0" : "=r,r" (out0) : "r,g" (in1));
// CHECK: call i32 asm "foo $1,$0", "=r|r,r|imr[[CLOBBERS]](i32 {{[a-zA-Z0-9@%]+}})
asm("foo %1,%0" : "=r,r" (out0) : "r,g" (min1));
// CHECK: call i32 asm "foo $1,$0", "=r|r,r|imr[[CLOBBERS]](i32 1)
asm("foo %1,%0" : "=r,r" (out0) : "r,g" (1));
}
// CHECK: @multi_X
void multi_X(void)
{
register int out0 = 0;
register int in1 = 1;
// CHECK: call i32 asm "foo $1,$0", "=r|r,r|X[[CLOBBERS]](i32 {{[a-zA-Z0-9@%]+}})
asm("foo %1,%0" : "=r,r" (out0) : "r,X" (in1));
// CHECK: call i32 asm "foo $1,$0", "=r|r,r|X[[CLOBBERS]](i32 {{[a-zA-Z0-9@%]+}})
asm("foo %1,%0" : "=r,r" (out0) : "r,X" (min1));
// CHECK: call i32 asm "foo $1,$0", "=r|r,r|X[[CLOBBERS]](i32 1)
asm("foo %1,%0" : "=r,r" (out0) : "r,X" (1));
// CHECK: call i32 asm "foo $1,$0", "=r|r,r|X[[CLOBBERS]](i32* getelementptr inbounds ([2 x i32], [2 x i32]* {{[a-zA-Z0-9@%]+}}, i{{32|64}} 0, i{{32|64}} 0))
asm("foo %1,%0" : "=r,r" (out0) : "r,X" (marray));
// CHECK: call i32 asm "foo $1,$0", "=r|r,r|X[[CLOBBERS]](double {{[0-9.eE+-]+}})
asm("foo %1,%0" : "=r,r" (out0) : "r,X" (1.0e+01));
// CHECK: call i32 asm "foo $1,$0", "=r|r,r|X[[CLOBBERS]](double {{[0-9.eE+-]+}})
asm("foo %1,%0" : "=r,r" (out0) : "r,X" (1.0));
}
// CHECK: @multi_p
void multi_p(void)
{
register int out0 = 0;
// Constraint converted differently on different platforms moved to platform-specific.
// : call i32 asm "foo $1,$0", "=r|r,r|im[[CLOBBERS]](i32* getelementptr inbounds ([2 x i32], [2 x i32]* {{[a-zA-Z0-9@%]+}}, {{i[0-9]*}} 0, {{i[0-9]*}} 0))
asm("foo %1,%0" : "=r,r" (out0) : "r,p" (marray));
}
|
the_stack_data/1252157.c
|
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <complex.h>
//#include <zheev.h>
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
/*
This program is calculating phonon spectar for arbitrary nonpolar semiconducting material. Your task is to put appropriate
dynamical matrices on appropriate place in memory, or modify ***input function so it can read your form of input data.
Complex number problem is solved by defining structure cplx, containing real and imaginary parts Some functions, such as
summing, multiplying complex numbers, calculating inner products in real and complex vector spaces, calculating exp(ic), whece
c is real number, etc. All of this operations will be used in calculating force constants as well as dynamical matrices for
arbitrary q vector. They are implemented as void because of optimisation.
*/
// Constants, such as number of q vectors, number of atoms in unit cell.
#define N 512 // number of q vectors in reciprocal lattice; //const int N = 512;
#define n 2 // number of atoms in unit cell; //const int n = 2;
//#define nR 34 // number of neighbour cells force constants that will be calculated,
// it's now a completely random number and will be modified optionally; //const int nR = 16;
#define pi 3.14159265359 // pi
#define x 0 // Indexes of x,y and z components
#define y 1
#define z 2
#define A 10.187000000 / 18897161646.3
#define B (2.0000000000000000000*pi*18897161646.3)/10.187000000000
#define au (2.1798741*1.e-18)/((5.2917721092*1.e-11)*(5.2917721092*1.e-11)*(1.8218779*1.e-30))
// Variables used ih whole program
struct cplx
{
double Re, Im; // Real and imaginary part of complex number, respectively.
} ;
struct vect
{
double X,Y,Z; // Components of vector
};
struct cplx Dq[3*n][3*n]; // Dynamical matrix that will be diagonalized
struct cplx fR[3*n][3*n][600]; // Force constants for interaction between 0-th and nR-th cell.
double eigen_Dq[3*n]; // Eigenvalues of Dq
double modes[3*n]; // Modes for arbitrary q
double qa[3]; // Arbitrary q vector
double qv[N][3];
double R[600][3]; // Position vectors of other cells
struct vect a_[3]; // Direct lattice vectors
struct vect b_[3]; // Reciprocal lattice vectors
int N1 = 8,N2 = 8,N3 = 8;
int nR = 453;
// List of functions
// Main procedures for this program
void input_fc(struct cplx t[3*n][3*n][N]); // Reading input data from files
void input_q (double t[N][3]); // Reading q vectors from file
void generate_R (); // Generates lattice vectors
void calculating_force_constants (); // Calculating force constants from dynamical matrices
void generate_Dq (); // Generating dynamical matrices for arbitrary q knowing force constants
void generate_N (struct vect *ne); // Generating neighbour
void init_lattice ();
void diagonalize_Dq (); // Finding eigenvalues for dynamical matrix
void write_eigen_values (); // Writting eigen values
void write_w (int k); // Writting modes
void write_force_constants (); // Writting force constants to separate file
void test (); // Testing some functions
void sort (double *a, int num);
void q_GX ();
void q_XW ();
void q_WK ();
void q_KG ();
void q_GL ();
// Other functions used in code
struct cplx s (struct cplx a, struct cplx b); // Sum of complex numbers
struct cplx d (struct cplx a, struct cplx b); // Diffrence between complex numbers
struct cplx m (struct cplx a, struct cplx b); // Multiplication of complex numbers
struct cplx conjugate (struct cplx a); // Conjugate complex number
struct cplx e_i (double a); // Calculating exp(ix), where x is real number
struct cplx inner_C (struct cplx *t, struct cplx *s, int num); // Standard Inner product in complex num-dimensional vector space
double inner_R (double *t, double *s, int num); // Standard Inner product in real num-dimensional vector space
double inner_R3 (struct vect t, struct vect s); // Ineer product in R^3
double Re (struct cplx t); // Real part of complex number
double Im (struct cplx t); // Imaginary part of complex number
struct vect s_v (struct vect s, struct vect t); // Sum of vectors
struct vect d_v (struct vect s, struct vect t); // Diffrence between vectors
struct vect m_v (struct vect s, double t); // Mutiplication of vectors and scalar
double norn_v (struct vect s); // Norm of vector
// Next few lines contain usual algebraic functions in field of complex numbers, (C,+,*)
struct cplx s (struct cplx a, struct cplx b)
{
a.Re += b.Re, a.Im += b.Im;
return a;
}
struct cplx d (struct cplx a, struct cplx b)
{
a.Re -= b.Re, a.Im -= b.Im;
return a;
}
struct cplx m (struct cplx a, struct cplx b)
{
struct cplx p;
p.Re = a.Re * b.Re - a.Im * b.Im;
p.Im = a.Re * b.Im + a.Im * b.Re;
return p;
}
struct cplx conjugate (struct cplx a)
{
a.Im *= -1;
return a;
}
struct cplx e_i (double a)
{
struct cplx p;
p.Re = cos (a), p.Im = sin (a);
return p;
}
double Re (struct cplx a)
{
return a.Re;
}
double Im (struct cplx a)
{
return a.Im;
}
double inner_R (double *a, double *b, int num)
{
int i;
double res = 0;
for (i = 0; i < num; i++) res += *(a+i) * *(b+i);
return res;
}
struct cplx inner_C (struct cplx *a, struct cplx *b, int num)
{
struct cplx p;
int i;
p.Re = p.Im = 0;
for (i = 0; i < num; i++)
{
struct cplx temp = m(a[i],conjugate(b[i]));
p.Re += temp.Re, p.Im += temp.Im;
}
return p;
}
double inner_R3 (struct vect a, struct vect b)
{
return a.X*b.X + a.Y*b.Y + a.Z*b.Z;
}
struct vect s_v (struct vect a, struct vect b)
{
a.X += b.X;
a.Y += b.Y;
a.Z += b.Z;
return a;
}
struct vect m_v (struct vect a, double b)
{
struct vect ret;
ret.X = a.X * b;
ret.Y = a.Y * b;
ret.Z = a.Z * b;
return ret;
}
struct vect d_v (struct vect a, struct vect b)
{
a.X -= b.X;
a.Y -= b.Y;
a.Z -= b.Z;
return a;
}
double norm_v (struct vect a)
{
return sqrt(inner_R3(a,a));
}
// Now functions for actual code
// This functon is calculating force constants. After declaring variables, it calls another functions to read them and then calculates
// force constants obtained using Furier transform of dynamical matrices elements.
void sort (double *a, int num)
{
int i,j;
for (i = 0; i < num-1; i++)
for (j = i; j < num; j++)
if (a[i] > a[j])
{
double temp;
temp = a[j];
a[j] = a[i];
a[i] = temp;
}
}
void calculating_force_constants ()
{
// Variables for calculation dynamical matrices for arbitrary q vector,
// such as dynamical matrices for q in first Brilouin zone, q vectors
// in first Brilouin zone, force constants.
struct cplx Dyn[3*n][3*n][N]; // Dynamical matrices, each for N-th q vector in first Brilouin zone.
double q[N][3]; // q vectors in first Brilouin zone. ***UNITS
// Other variables used in this function
int i,j;
// Input parts, calling input_fc() for all data given in separate files and input_q() for file dyn0
input_q (q);
input_fc(Dyn);
// Calculating force constants for q vectors in first Briloun zone, using Fourier transform.
// Too many loops, unfortunately
for (i = 0; i < 3*n; i++)
for (j = 0; j < 3*n; j++)
{
int k,l; // Other variables
for (k = 0; k < nR; k++)
{
struct cplx temp;
fR[i][j][k].Re = fR[i][j][k].Im = 0; // Initialisation
for (l = 0; l < N; l++) // Loop. For every pair (j,k) we sum all pairs (j,k) from N dynamical matrices times phase factor
{
qv[l][x] = q[l][x];
qv[l][y] = q[l][y];
qv[l][z] = q[l][z];
//Dyn[i][j][l].Re *= au;
//Dyn[i][j][l].Im *= au;
temp = m(Dyn[i][j][l],e_i(-1 * inner_R(q[l],R[k],3)));
//printf ("D %le %le q %le %le %le\n", Dyn[i][j][l].Im, Dyn[i][j][l].Re, q[l][0],q[l][1],q[l][2]);
fR[i][j][k].Re += temp.Re;
fR[i][j][k].Im += temp.Im; // Calculation
}
fR[i][j][k].Re /= N;
fR[i][j][k].Im /= N; // Also some kind of calculation
// printf ("(%i,%i) R = %le %le %le\n",i,j,R[k][0]*R[k][0]+R[k][1]*R[k][1]+R[k][2]*R[k][2], fR[i][j][k].Re, fR[i][j][k].Im);
// printf ("%le %le\n", fR[i][j][k].Re, fR[i][j][k].Im);
}
}
}
// Reading q vectors from file dyn0
void input_q (double q[N][3])
{
FILE *f; // pointer to a file
int i = 0; // i for loop, pos for position of last character in location
char location[] = ""; // Location of dynamical matrices on disk
//char location[] = "";
char line[80]; // Input buffer
f = fopen (location, "r"); // Opening file
fgets(line,80,f); // Two lines with information which are not necessairly for the program
sscanf(line, "%i %i %i", &N1, &N2, &N3); // Reading N1,N2,N3
fgets(line,80,f);
// Reading q vectors from file
while (fgets(line,80,f) && (i<512))
{
double qx, qy, qz;
sscanf (line, "%le %le %le", &qx, &qy, &qz);
q[i][x] = qx*B;
q[i][y] = qy*B;
q[i][z] = qz*B;
i++;
}
}
// Reading dynamical matrices from files
void input_fc(struct cplx Dyn[3*n][3*n][N])
{
FILE *f; // pointer to a file
int i, pos = 18; // i for loop, pos for position of last character in location, 18,51
char location[] = ""; // Location of dynamical matrices in disk
//char location[] = "";
for (i = 0; i < N; i++)
{
int j,k = 0;
char line[80];
f = fopen (location, "r");
while (fgets (line, 80, f))
{
k++;
int a;
if (k > 12 && k < 16)
{
a = k%13;
sscanf (line, "%le %le %le %le %le %le", &Dyn[a][x][i].Re, &Dyn[a][x][i].Im, &Dyn[a][y][i].Re,
&Dyn[a][y][i].Im, &Dyn[a][z][i].Re, &Dyn[a][z][i].Im);
}
if (k > 16 && k < 20)
{
a = k%17;
sscanf (line, "%le %le %le %le %le %le", &Dyn[a][x+3][i].Re, &Dyn[a][x+3][i].Im, &Dyn[a][y+3][i].Re,
&Dyn[a][y+3][i].Im, &Dyn[a][z+3][i].Re, &Dyn[a][z+3][i].Im);
}
if (k > 20 && k < 24)
{
a = k%21 + 3;
sscanf (line, "%le %le %le %le %le %le", &Dyn[a][x][i].Re, &Dyn[a][x][i].Im, &Dyn[a][y][i].Re,
&Dyn[a][y][i].Im, &Dyn[a][z][i].Re, &Dyn[a][z][i].Im);
}
if (k > 24 && k < 28)
{
a = k%25 + 3;
sscanf (line, "%le %le %le %le %le %le", &Dyn[a][x+3][i].Re, &Dyn[a][x+3][i].Im, &Dyn[a][y+3][i].Re,
&Dyn[a][y+3][i].Im, &Dyn[a][z+3][i].Re, &Dyn[a][z+3][i].Im);
}
}
/*if (i == 150)
{
int j;
for (j = 0; j<3*n; j++)
{
for (k = 0; k<3*n; k++)
{
printf ("%le %le ", Dyn[j][k][i].Re, Dyn[j][k][i].Im);
}
printf ("\n");
}
}*/
fclose (f);
//Change of location
// printf ("\n%c%c%c", location[pos-2],location[pos-1],location[pos]);
if (location[pos] == 57)
location [pos-1] == 57 ? location [pos-2]++, location[pos-1] = location[pos] = 48 : location [pos-1]++, location[pos] = 48;
else
location [pos]++;
}
//}
}
// Generating dynamical matrices for arbitrary q vector
void generate_Dq ()
{
int i, j;
for (i = 0; i < 3*n; i++)
for (j = 0; j < 3*n; j++)
{
Dq [i][j].Re = Dq [i][j].Im = 0;
int k;
struct cplx temp;
for (k = 0; k < nR; k++)
{
temp = m(fR [i][j][k],e_i (inner_R(qa,R[k],3)));
Dq [i][j].Re += temp.Re, Dq [i][j].Im += temp.Im;
}
}
/*for (i = 0; i < 3*n; i++)
{
for (j = 0; j < 3*n; j++)
{
printf ("%le %le ", Dq[i][j].Re, Dq[i][j].Im);
}
printf ("\n");
}
printf ("\n\n\n");*/
}
// Writting eigen values of dynnamical matrix for arbitrary q vectors
void write_eigen_values ()
{
int i;
for (i = 0; i < 3*n; i++)
printf ("%f\n", eigen_Dq[i]);
}
// Writting modes, w(q)
void write_w (int k)
{
int i,j;
FILE *f;
char location[] = "";
//char location[] = "";
f = fopen (location, "a");
for (i = 0; i < 3*n; i++)
{
fprintf (f,"%le\t", modes[i]*sqrt(au)*(0.151096*1.e+12/2.464680e+14));
printf ("%le\t", modes[i]*sqrt(au));
}
//fprintf (f, "%le\t %le\t %le \n", qa[x], qa[y], qa[z]);
fprintf (f, "\n");
printf ("\n");
if (k == 9) fprintf (f, "\n");
fclose (f);
}
void diagonalize_Dq ()
{
double rwork[3*3*n - 2];
double complex c_H [36], work[100];
int i, j, n1 = 3*n, lda = 3*n, lwork = 100, info = 1;
for (i = 0; i < 3*n; i++)
for (j = 0; j < 3*n; j++)
c_H [i*3*n + j] = Dq[i][j].Re + Dq[i][j].Im * I;
while (info != 0)
//zheev_("Vectors", "Upper", &n1, c_H, &lda, eigen_Dq, work, &lwork, rwork, &info);
for (i = 0; i < 3*n; i++)
modes[i] = sqrt (eigen_Dq[i] * (eigen_Dq[i] > 0 ? 1 : -1));
sort (modes, 6);
}
// Generating R vectors over which interpolation is done
void generate_R()
{
struct vect neighbour[35];
generate_N (neighbour);
int i,j,k,l, count = 0;
//for (i = 0; i<12;i++)
//printf ("%le %le %le \n", neighbour[i].X, neighbour[i].Y, neighbour[i].Z);
for (i = -8; i < 8; i++)
for (j = -8; j < 8; j++)
for (k = -8; k < 8; k++)
{
struct vect temp;
temp = s_v (s_v(m_v(a_[0],i) , m_v(a_[1],j)) , m_v(a_[2],k));
int m = 0;
for (l = 0; l < 30; l++)
{
if (norm_v(temp) <= norm_v(d_v(temp, neighbour[l]))) m++;
//printf ("i = %i j = %i k = %i l = %i m = %i\n",i,j,k,l,m);
if (m == 30 && l == 29)
{
R[count][x] = (i*a_[0].X + j*a_[1].X + k*a_[2].X);
R[count][y] = (i*a_[0].Y + j*a_[1].Y + k*a_[2].Y);
R[count][z] = (i*a_[0].Z + j*a_[1].Z + k*a_[2].Z);
// printf ("%le %le %le\n", R[count][x], R[count][y], R[count][z]);
count++;
//printf ("%i\n", count);
}
}
}
nR = count;
//printf ("%i\n", nR);
}
// Help procedure that generates neighbourhood of 0th cell
void generate_N (struct vect *ne)
{
int i;
ne[0] = m_v (a_[0],N1);
ne[1] = m_v (a_[1],N2);
ne[2] = m_v (a_[2],N3);
ne[3] = d_v (ne[0],ne[1]);
ne[4] = d_v (ne[1],ne[2]);
ne[5] = d_v (ne[2],ne[0]);
for (i = 6; i < 12; i++)
ne[i] = m_v (ne[i%6], -1);
ne[12] = s_v (ne[0],ne[1]);
ne[13] = s_v (ne[1],ne[2]);
ne[14] = s_v (ne[0],ne[2]);
for (i = 15; i < 18; i++)
ne[i] = m_v (ne[i%15], -1);
ne[18] = s_v (ne[12], ne[2]);
ne[19] = d_v (ne[12], ne[2]);
ne[20] = s_v (ne[13], ne[0]);
ne[21] = d_v (ne[13], ne[0]);
ne[22] = s_v (ne[14], ne[1]);
ne[23] = d_v (ne[14], ne[1]);
for (i = 24; i < 30; i++)
ne[i] = m_v (ne[i%24], -1);
}
// Moving from (0,0,0) to (1/2,0,1/2)
void q_GX ()
{
int i;
qa[x] = qa[y] = qa[z] = 0;
qa[x] = -0.099999999*B;
for (i = 0; i < 11; i++)
{
qa[x] -= 0.1000 * B;
qa[y] += 0.0000 * B;
qa[z] += 0.0000 * B;
//printf ("\n%le %le %le \n", qa[x],qa[y],qa[z]);
generate_Dq ();
diagonalize_Dq ();
write_w (i);
}
}
// Moving from (1/2,0,1/2) to (1/2,1/4,3/4)
void q_XW ()
{
int i;
for (i = 0; i < 10; i++)
{
qa[x] += 0.0000 * B;
qa[y] += 0.0500 * B;
qa[z] += 0.0000 * B;
//printf ("%le %le %le \n", qa[x],qa[y],qa[z]);
generate_Dq ();
diagonalize_Dq ();
write_w (i);
}
}
void q_WK ()
{
int i;
for (i = 0; i < 10; i++)
{
qa[x] += 0.0625 * B;
qa[y] -= 0.0125 * B;
qa[z] += 0.0000 * B;
//printf ("%le %le %le \n", qa[x],qa[y],qa[z]);
generate_Dq ();
diagonalize_Dq ();
write_w (i);
}
}
void q_KG ()
{
int i;
for (i = 0; i < 10; i++)
{
qa[x] += 0.0375 * B;
qa[y] -= 0.0375 * B;
qa[z] += 0.0000 * B;
//printf ("%le %le %le \n", qa[x],qa[y],qa[z]);
generate_Dq ();
diagonalize_Dq ();
write_w (i);
}
}
// Moving from (0,0,0) to (1/2,1/2,1/2)
void q_GL ()
{
int i;
qa[x] = qa[y] = qa[z] = -0.04999999*B;
qa[x] *= -1;
for (i = 0; i < 11; i++)
{
qa[x] -= 0.0500 * B;
qa[y] += 0.0500 * B;
qa[z] += 0.0500 * B;
//printf ("%le %le %le \n", qa[x],qa[y],qa[z]);
generate_Dq ();
diagonalize_Dq ();
write_w (i);
}
}
void init_lattice ()
{
a_[0].X = -1 * A/2;
a_[0].Y = 0;
a_[0].Z = A/2;
a_[1].X = 0;
a_[1].Y = A/2;
a_[1].Z = A/2;
a_[2].X = -1 * A/2;
a_[2].Y = A/2;
a_[2].Z = 0;
b_[0].X = -1 * B;
b_[0].Y = -1 * B;
b_[0].Z = B;
b_[1].X = B;
b_[1].Y = B;
b_[1].Z = B;
b_[2].X = -1 * B;
b_[2].Y = B;
b_[2].Z = -1 * B;
}
void q_ ()
{
q_GX ();
q_XW ();
q_WK ();
q_KG ();
q_GL ();
}
void q_test ()
{
/* FILE *f;
char location[] = "";
//char location[] = "";
f = fopen (location, "a");*/
int i;
for (i = 0; i < N; i++)
{
qa[x] = qv[i][x];
qa[y] = qv[i][y];
qa[z] = qv[i][z];
generate_Dq ();
/*fprintf (f, "\n\n%i\n\n", i);
int j,k;
for (j = 0; j < 3*n; j++)
{
for (k = 0; k < 3*n; k++)
fprintf (f,"%le %le\t", Dq[j][k].Re, Dq[j][k].Im);
fprintf (f,"\n");
}
printf ("%i \n", i);*/
diagonalize_Dq ();
write_w (7869);
}
printf ("izasao");
}
int main(int argc, char *argv[]) {
init_lattice ();
generate_R ();
calculating_force_constants ();
// moving q vectors through first Briloun zone
q_();
//q_test();
return 0;
}
|
the_stack_data/225142359.c
|
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_strcmp.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: pguillie <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2020/01/07 20:26:36 by pguillie #+# #+# */
/* Updated: 2020/01/07 20:28:25 by pguillie ### ########.fr */
/* */
/* ************************************************************************** */
int ft_strcmp(const char *s1, const char *s2)
{
while (*s1 && *s2 && *s1 == *s2) {
s1++;
s2++;
}
return (*s1 - *s2);
}
|
the_stack_data/762457.c
|
#include <math.h>
#include <omp.h>
#include <stdio.h>
#include <stdlib.h>
#include <sys/time.h>
static void init_array(double a[], int start, int stop, int incr);
static void do_work(double a[], int nr_runs, int start, int stop, int incr);
#define N 1000
int main(void) {
const int nr_threads = 2;
const int n = N;
const int nr_runs = 20000000;
double a[N], sum = 0.0;
int i;
omp_set_dynamic(0);
omp_set_num_threads(nr_threads);
#pragma omp parallel default(none) shared(a)
{
#pragma omp sections
{
#pragma omp section
{
struct timeval tv1, tv2;
int thread_nr = omp_get_thread_num();
init_array(a, n/2, n, 1);
gettimeofday(&tv1, NULL);
do_work(a, nr_runs, n/2, n, 1);
gettimeofday(&tv2, NULL);
printf("thread %d: %.6f\n", thread_nr,
1.0e-6*(tv2.tv_usec - tv1.tv_usec) +
(tv2.tv_sec - tv1.tv_sec));
}
#pragma omp section
{
struct timeval tv1, tv2;
int thread_nr = omp_get_thread_num();
init_array(a, 0, n/2, 1);
gettimeofday(&tv1, NULL);
do_work(a, nr_runs, 0, n/2, 1);
gettimeofday(&tv2, NULL);
printf("thread %d: %.6f\n", thread_nr,
1.0e-6*(tv2.tv_usec - tv1.tv_usec) +
(tv2.tv_sec - tv1.tv_sec));
}
}
}
sum = 0.0;
for (i = 0; i < n; i++)
sum += a[i];
printf("no false sharing: %.1lf\n", sum);
#pragma omp parallel default(none) shared(a)
{
#pragma omp sections
{
#pragma omp section
{
struct timeval tv1, tv2;
int thread_nr = omp_get_thread_num();
init_array(a, 0, n, 2);
gettimeofday(&tv1, NULL);
do_work(a, nr_runs, 0, n, 2);
gettimeofday(&tv2, NULL);
printf("thread %d: %.6f\n", thread_nr,
1.0e-6*(tv2.tv_usec - tv1.tv_usec) +
(tv2.tv_sec - tv1.tv_sec));
}
#pragma omp section
{
struct timeval tv1, tv2;
int thread_nr = omp_get_thread_num();
init_array(a, 1, n, 2);
gettimeofday(&tv1, NULL);
do_work(a, nr_runs, 1, n, 2);
gettimeofday(&tv2, NULL);
printf("thread %d: %.6f\n", thread_nr,
1.0e-6*(tv2.tv_usec - tv1.tv_usec) +
(tv2.tv_sec - tv1.tv_sec));
}
}
}
sum = 0.0;
for (i = 0; i < n; i++)
sum += a[i];
printf("false sharing: %.1lf\n", sum);
return EXIT_SUCCESS;
}
void init_array(double a[], int start, int stop, int incr) {
int i;
for (i = start; i < stop; i += incr)
a[i] = 0.0;
}
void do_work(double a[], int nr_runs, int start, int stop, int incr) {
int run_nr, i;
for (run_nr = 0; run_nr < nr_runs; run_nr++)
for (i = start; i < stop ;i += incr)
a[i] += i;
}
|
the_stack_data/22814.c
|
/*
** 2016-05-27
**
** 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.
**
******************************************************************************
**
** This file contains the implementation of an SQLite vfs shim that
** tracks I/O. Access to the accumulated status counts is provided using
** an eponymous virtual table.
*/
#include <sqlite3ext.h>
SQLITE_EXTENSION_INIT1
/*
** This module contains code for a wrapper VFS that cause stats for
** most VFS calls to be recorded.
**
** To use this module, first compile it as a loadable extension. See
** https://www.sqlite.org/loadext.html#build for compilations instructions.
**
** After compliing, load this extension, then open database connections to be
** measured. Query usages status using the vfsstat virtual table:
**
** SELECT * FROM vfsstat;
**
** Reset counters using UPDATE statements against vfsstat:
**
** UPDATE vfsstat SET count=0;
**
** EXAMPLE SCRIPT:
**
** .load ./vfsstat
** .open test.db
** DROP TABLE IF EXISTS t1;
** CREATE TABLE t1(x,y);
** INSERT INTO t1 VALUES(123, randomblob(5000));
** CREATE INDEX t1x ON t1(x);
** DROP TABLE t1;
** VACUUM;
** SELECT * FROM vfsstat WHERE count>0;
**
** LIMITATIONS:
**
** This module increments counters without using mutex protection. So if
** two or more threads try to use this module at the same time, race conditions
** may occur which mess up the counts. This is harmless, other than giving
** incorrect statistics.
*/
#include <string.h>
#include <stdlib.h>
#include <assert.h>
/*
** File types
*/
#define VFSSTAT_MAIN 0 /* Main database file */
#define VFSSTAT_JOURNAL 1 /* Rollback journal */
#define VFSSTAT_WAL 2 /* Write-ahead log file */
#define VFSSTAT_MASTERJRNL 3 /* Master journal */
#define VFSSTAT_SUBJRNL 4 /* Subjournal */
#define VFSSTAT_TEMPDB 5 /* TEMP database */
#define VFSSTAT_TEMPJRNL 6 /* Journal for TEMP database */
#define VFSSTAT_TRANSIENT 7 /* Transient database */
#define VFSSTAT_ANY 8 /* Unspecified file type */
#define VFSSTAT_nFile 9 /* This many file types */
/* Names of the file types. These are allowed values for the
** first column of the vfsstat virtual table.
*/
static const char *azFile[] = {
"database", "journal", "wal", "master-journal", "sub-journal",
"temp-database", "temp-journal", "transient-db", "*"
};
/*
** Stat types
*/
#define VFSSTAT_BYTESIN 0 /* Bytes read in */
#define VFSSTAT_BYTESOUT 1 /* Bytes written out */
#define VFSSTAT_READ 2 /* Read requests */
#define VFSSTAT_WRITE 3 /* Write requests */
#define VFSSTAT_SYNC 4 /* Syncs */
#define VFSSTAT_OPEN 5 /* File opens */
#define VFSSTAT_LOCK 6 /* Lock requests */
#define VFSSTAT_ACCESS 0 /* xAccess calls. filetype==ANY only */
#define VFSSTAT_DELETE 1 /* xDelete calls. filetype==ANY only */
#define VFSSTAT_FULLPATH 2 /* xFullPathname calls. ANY only */
#define VFSSTAT_RANDOM 3 /* xRandomness calls. ANY only */
#define VFSSTAT_SLEEP 4 /* xSleep calls. ANY only */
#define VFSSTAT_CURTIME 5 /* xCurrentTime calls. ANY only */
#define VFSSTAT_nStat 7 /* This many stat types */
/* Names for the second column of the vfsstat virtual table for all
** cases except when the first column is "*" or VFSSTAT_ANY. */
static const char *azStat[] = {
"bytes-in", "bytes-out", "read", "write", "sync", "open", "lock",
};
static const char *azStatAny[] = {
"access", "delete", "fullpathname", "randomness", "sleep", "currenttimestamp",
"not-used"
};
/* Total number of counters */
#define VFSSTAT_MXCNT (VFSSTAT_nStat*VFSSTAT_nFile)
/*
** Performance stats are collected in an instance of the following
** global array.
*/
static sqlite3_uint64 aVfsCnt[VFSSTAT_MXCNT];
/*
** Access to a specific counter
*/
#define STATCNT(filetype,stat) (aVfsCnt[(filetype)*VFSSTAT_nStat+(stat)])
/*
** Forward declaration of objects used by this utility
*/
typedef struct VStatVfs VStatVfs;
typedef struct VStatFile VStatFile;
/* An instance of the VFS */
struct VStatVfs {
sqlite3_vfs base; /* VFS methods */
sqlite3_vfs *pVfs; /* Parent VFS */
};
/* An open file */
struct VStatFile {
sqlite3_file base; /* IO methods */
sqlite3_file *pReal; /* Underlying file handle */
unsigned char eFiletype; /* What type of file is this */
};
#define REALVFS(p) (((VStatVfs*)(p))->pVfs)
/*
** Methods for VStatFile
*/
static int vstatClose(sqlite3_file*);
static int vstatRead(sqlite3_file*, void*, int iAmt, sqlite3_int64 iOfst);
static int vstatWrite(sqlite3_file*,const void*,int iAmt, sqlite3_int64 iOfst);
static int vstatTruncate(sqlite3_file*, sqlite3_int64 size);
static int vstatSync(sqlite3_file*, int flags);
static int vstatFileSize(sqlite3_file*, sqlite3_int64 *pSize);
static int vstatLock(sqlite3_file*, int);
static int vstatUnlock(sqlite3_file*, int);
static int vstatCheckReservedLock(sqlite3_file*, int *pResOut);
static int vstatFileControl(sqlite3_file*, int op, void *pArg);
static int vstatSectorSize(sqlite3_file*);
static int vstatDeviceCharacteristics(sqlite3_file*);
static int vstatShmMap(sqlite3_file*, int iPg, int pgsz, int, void volatile**);
static int vstatShmLock(sqlite3_file*, int offset, int n, int flags);
static void vstatShmBarrier(sqlite3_file*);
static int vstatShmUnmap(sqlite3_file*, int deleteFlag);
static int vstatFetch(sqlite3_file*, sqlite3_int64 iOfst, int iAmt, void **pp);
static int vstatUnfetch(sqlite3_file*, sqlite3_int64 iOfst, void *p);
/*
** Methods for VStatVfs
*/
static int vstatOpen(sqlite3_vfs*, const char *, sqlite3_file*, int , int *);
static int vstatDelete(sqlite3_vfs*, const char *zName, int syncDir);
static int vstatAccess(sqlite3_vfs*, const char *zName, int flags, int *);
static int vstatFullPathname(sqlite3_vfs*, const char *zName, int, char *zOut);
static void *vstatDlOpen(sqlite3_vfs*, const char *zFilename);
static void vstatDlError(sqlite3_vfs*, int nByte, char *zErrMsg);
static void (*vstatDlSym(sqlite3_vfs *pVfs, void *p, const char*zSym))(void);
static void vstatDlClose(sqlite3_vfs*, void*);
static int vstatRandomness(sqlite3_vfs*, int nByte, char *zOut);
static int vstatSleep(sqlite3_vfs*, int microseconds);
static int vstatCurrentTime(sqlite3_vfs*, double*);
static int vstatGetLastError(sqlite3_vfs*, int, char *);
static int vstatCurrentTimeInt64(sqlite3_vfs*, sqlite3_int64*);
static VStatVfs vstat_vfs = {
{
2, /* iVersion */
0, /* szOsFile (set by register_vstat()) */
1024, /* mxPathname */
0, /* pNext */
"vfslog", /* zName */
0, /* pAppData */
vstatOpen, /* xOpen */
vstatDelete, /* xDelete */
vstatAccess, /* xAccess */
vstatFullPathname, /* xFullPathname */
vstatDlOpen, /* xDlOpen */
vstatDlError, /* xDlError */
vstatDlSym, /* xDlSym */
vstatDlClose, /* xDlClose */
vstatRandomness, /* xRandomness */
vstatSleep, /* xSleep */
vstatCurrentTime, /* xCurrentTime */
vstatGetLastError, /* xGetLastError */
vstatCurrentTimeInt64 /* xCurrentTimeInt64 */
},
0
};
static const sqlite3_io_methods vstat_io_methods = {
3, /* iVersion */
vstatClose, /* xClose */
vstatRead, /* xRead */
vstatWrite, /* xWrite */
vstatTruncate, /* xTruncate */
vstatSync, /* xSync */
vstatFileSize, /* xFileSize */
vstatLock, /* xLock */
vstatUnlock, /* xUnlock */
vstatCheckReservedLock, /* xCheckReservedLock */
vstatFileControl, /* xFileControl */
vstatSectorSize, /* xSectorSize */
vstatDeviceCharacteristics, /* xDeviceCharacteristics */
vstatShmMap, /* xShmMap */
vstatShmLock, /* xShmLock */
vstatShmBarrier, /* xShmBarrier */
vstatShmUnmap, /* xShmUnmap */
vstatFetch, /* xFetch */
vstatUnfetch /* xUnfetch */
};
/*
** Close an vstat-file.
*/
static int vstatClose(sqlite3_file *pFile){
VStatFile *p = (VStatFile *)pFile;
int rc = SQLITE_OK;
if( p->pReal->pMethods ){
rc = p->pReal->pMethods->xClose(p->pReal);
}
return rc;
}
/*
** Read data from an vstat-file.
*/
static int vstatRead(
sqlite3_file *pFile,
void *zBuf,
int iAmt,
sqlite_int64 iOfst
){
int rc;
VStatFile *p = (VStatFile *)pFile;
rc = p->pReal->pMethods->xRead(p->pReal, zBuf, iAmt, iOfst);
STATCNT(p->eFiletype,VFSSTAT_READ)++;
if( rc==SQLITE_OK ){
STATCNT(p->eFiletype,VFSSTAT_BYTESIN) += iAmt;
}
return rc;
}
/*
** Write data to an vstat-file.
*/
static int vstatWrite(
sqlite3_file *pFile,
const void *z,
int iAmt,
sqlite_int64 iOfst
){
int rc;
VStatFile *p = (VStatFile *)pFile;
rc = p->pReal->pMethods->xWrite(p->pReal, z, iAmt, iOfst);
STATCNT(p->eFiletype,VFSSTAT_WRITE)++;
if( rc==SQLITE_OK ){
STATCNT(p->eFiletype,VFSSTAT_BYTESOUT) += iAmt;
}
return rc;
}
/*
** Truncate an vstat-file.
*/
static int vstatTruncate(sqlite3_file *pFile, sqlite_int64 size){
int rc;
VStatFile *p = (VStatFile *)pFile;
rc = p->pReal->pMethods->xTruncate(p->pReal, size);
return rc;
}
/*
** Sync an vstat-file.
*/
static int vstatSync(sqlite3_file *pFile, int flags){
int rc;
VStatFile *p = (VStatFile *)pFile;
rc = p->pReal->pMethods->xSync(p->pReal, flags);
STATCNT(p->eFiletype,VFSSTAT_SYNC)++;
return rc;
}
/*
** Return the current file-size of an vstat-file.
*/
static int vstatFileSize(sqlite3_file *pFile, sqlite_int64 *pSize){
int rc;
VStatFile *p = (VStatFile *)pFile;
rc = p->pReal->pMethods->xFileSize(p->pReal, pSize);
return rc;
}
/*
** Lock an vstat-file.
*/
static int vstatLock(sqlite3_file *pFile, int eLock){
int rc;
VStatFile *p = (VStatFile *)pFile;
rc = p->pReal->pMethods->xLock(p->pReal, eLock);
STATCNT(p->eFiletype,VFSSTAT_LOCK)++;
return rc;
}
/*
** Unlock an vstat-file.
*/
static int vstatUnlock(sqlite3_file *pFile, int eLock){
int rc;
VStatFile *p = (VStatFile *)pFile;
rc = p->pReal->pMethods->xUnlock(p->pReal, eLock);
STATCNT(p->eFiletype,VFSSTAT_LOCK)++;
return rc;
}
/*
** Check if another file-handle holds a RESERVED lock on an vstat-file.
*/
static int vstatCheckReservedLock(sqlite3_file *pFile, int *pResOut){
int rc;
VStatFile *p = (VStatFile *)pFile;
rc = p->pReal->pMethods->xCheckReservedLock(p->pReal, pResOut);
STATCNT(p->eFiletype,VFSSTAT_LOCK)++;
return rc;
}
/*
** File control method. For custom operations on an vstat-file.
*/
static int vstatFileControl(sqlite3_file *pFile, int op, void *pArg){
VStatFile *p = (VStatFile *)pFile;
int rc;
rc = p->pReal->pMethods->xFileControl(p->pReal, op, pArg);
if( op==SQLITE_FCNTL_VFSNAME && rc==SQLITE_OK ){
*(char**)pArg = sqlite3_mprintf("vstat/%z", *(char**)pArg);
}
return rc;
}
/*
** Return the sector-size in bytes for an vstat-file.
*/
static int vstatSectorSize(sqlite3_file *pFile){
int rc;
VStatFile *p = (VStatFile *)pFile;
rc = p->pReal->pMethods->xSectorSize(p->pReal);
return rc;
}
/*
** Return the device characteristic flags supported by an vstat-file.
*/
static int vstatDeviceCharacteristics(sqlite3_file *pFile){
int rc;
VStatFile *p = (VStatFile *)pFile;
rc = p->pReal->pMethods->xDeviceCharacteristics(p->pReal);
return rc;
}
/* Create a shared memory file mapping */
static int vstatShmMap(
sqlite3_file *pFile,
int iPg,
int pgsz,
int bExtend,
void volatile **pp
){
VStatFile *p = (VStatFile *)pFile;
return p->pReal->pMethods->xShmMap(p->pReal, iPg, pgsz, bExtend, pp);
}
/* Perform locking on a shared-memory segment */
static int vstatShmLock(sqlite3_file *pFile, int offset, int n, int flags){
VStatFile *p = (VStatFile *)pFile;
return p->pReal->pMethods->xShmLock(p->pReal, offset, n, flags);
}
/* Memory barrier operation on shared memory */
static void vstatShmBarrier(sqlite3_file *pFile){
VStatFile *p = (VStatFile *)pFile;
p->pReal->pMethods->xShmBarrier(p->pReal);
}
/* Unmap a shared memory segment */
static int vstatShmUnmap(sqlite3_file *pFile, int deleteFlag){
VStatFile *p = (VStatFile *)pFile;
return p->pReal->pMethods->xShmUnmap(p->pReal, deleteFlag);
}
/* Fetch a page of a memory-mapped file */
static int vstatFetch(
sqlite3_file *pFile,
sqlite3_int64 iOfst,
int iAmt,
void **pp
){
VStatFile *p = (VStatFile *)pFile;
return p->pReal->pMethods->xFetch(p->pReal, iOfst, iAmt, pp);
}
/* Release a memory-mapped page */
static int vstatUnfetch(sqlite3_file *pFile, sqlite3_int64 iOfst, void *pPage){
VStatFile *p = (VStatFile *)pFile;
return p->pReal->pMethods->xUnfetch(p->pReal, iOfst, pPage);
}
/*
** Open an vstat file handle.
*/
static int vstatOpen(
sqlite3_vfs *pVfs,
const char *zName,
sqlite3_file *pFile,
int flags,
int *pOutFlags
){
int rc;
VStatFile *p = (VStatFile*)pFile;
p->pReal = (sqlite3_file*)&p[1];
rc = REALVFS(pVfs)->xOpen(REALVFS(pVfs), zName, p->pReal, flags, pOutFlags);
if( flags & SQLITE_OPEN_MAIN_DB ){
p->eFiletype = VFSSTAT_MAIN;
}else if( flags & SQLITE_OPEN_MAIN_JOURNAL ){
p->eFiletype = VFSSTAT_JOURNAL;
}else if( flags & SQLITE_OPEN_WAL ){
p->eFiletype = VFSSTAT_WAL;
}else if( flags & SQLITE_OPEN_MASTER_JOURNAL ){
p->eFiletype = VFSSTAT_MASTERJRNL;
}else if( flags & SQLITE_OPEN_SUBJOURNAL ){
p->eFiletype = VFSSTAT_SUBJRNL;
}else if( flags & SQLITE_OPEN_TEMP_DB ){
p->eFiletype = VFSSTAT_TEMPDB;
}else if( flags & SQLITE_OPEN_TEMP_JOURNAL ){
p->eFiletype = VFSSTAT_TEMPJRNL;
}else{
p->eFiletype = VFSSTAT_TRANSIENT;
}
STATCNT(p->eFiletype,VFSSTAT_OPEN)++;
pFile->pMethods = rc ? 0 : &vstat_io_methods;
return rc;
}
/*
** Delete the file located at zPath. If the dirSync argument is true,
** ensure the file-system modifications are synced to disk before
** returning.
*/
static int vstatDelete(sqlite3_vfs *pVfs, const char *zPath, int dirSync){
int rc;
rc = REALVFS(pVfs)->xDelete(REALVFS(pVfs), zPath, dirSync);
STATCNT(VFSSTAT_ANY,VFSSTAT_DELETE)++;
return rc;
}
/*
** Test for access permissions. Return true if the requested permission
** is available, or false otherwise.
*/
static int vstatAccess(
sqlite3_vfs *pVfs,
const char *zPath,
int flags,
int *pResOut
){
int rc;
rc = REALVFS(pVfs)->xAccess(REALVFS(pVfs), zPath, flags, pResOut);
STATCNT(VFSSTAT_ANY,VFSSTAT_ACCESS)++;
return rc;
}
/*
** Populate buffer zOut with the full canonical pathname corresponding
** to the pathname in zPath. zOut is guaranteed to point to a buffer
** of at least (INST_MAX_PATHNAME+1) bytes.
*/
static int vstatFullPathname(
sqlite3_vfs *pVfs,
const char *zPath,
int nOut,
char *zOut
){
STATCNT(VFSSTAT_ANY,VFSSTAT_FULLPATH)++;
return REALVFS(pVfs)->xFullPathname(REALVFS(pVfs), zPath, nOut, zOut);
}
/*
** Open the dynamic library located at zPath and return a handle.
*/
static void *vstatDlOpen(sqlite3_vfs *pVfs, const char *zPath){
return REALVFS(pVfs)->xDlOpen(REALVFS(pVfs), zPath);
}
/*
** Populate the buffer zErrMsg (size nByte bytes) with a human readable
** utf-8 string describing the most recent error encountered associated
** with dynamic libraries.
*/
static void vstatDlError(sqlite3_vfs *pVfs, int nByte, char *zErrMsg){
REALVFS(pVfs)->xDlError(REALVFS(pVfs), nByte, zErrMsg);
}
/*
** Return a pointer to the symbol zSymbol in the dynamic library pHandle.
*/
static void (*vstatDlSym(sqlite3_vfs *pVfs, void *p, const char *zSym))(void){
return REALVFS(pVfs)->xDlSym(REALVFS(pVfs), p, zSym);
}
/*
** Close the dynamic library handle pHandle.
*/
static void vstatDlClose(sqlite3_vfs *pVfs, void *pHandle){
REALVFS(pVfs)->xDlClose(REALVFS(pVfs), pHandle);
}
/*
** Populate the buffer pointed to by zBufOut with nByte bytes of
** random data.
*/
static int vstatRandomness(sqlite3_vfs *pVfs, int nByte, char *zBufOut){
STATCNT(VFSSTAT_ANY,VFSSTAT_RANDOM)++;
return REALVFS(pVfs)->xRandomness(REALVFS(pVfs), nByte, zBufOut);
}
/*
** Sleep for nMicro microseconds. Return the number of microseconds
** actually slept.
*/
static int vstatSleep(sqlite3_vfs *pVfs, int nMicro){
STATCNT(VFSSTAT_ANY,VFSSTAT_SLEEP)++;
return REALVFS(pVfs)->xSleep(REALVFS(pVfs), nMicro);
}
/*
** Return the current time as a Julian Day number in *pTimeOut.
*/
static int vstatCurrentTime(sqlite3_vfs *pVfs, double *pTimeOut){
STATCNT(VFSSTAT_ANY,VFSSTAT_CURTIME)++;
return REALVFS(pVfs)->xCurrentTime(REALVFS(pVfs), pTimeOut);
}
static int vstatGetLastError(sqlite3_vfs *pVfs, int a, char *b){
return REALVFS(pVfs)->xGetLastError(REALVFS(pVfs), a, b);
}
static int vstatCurrentTimeInt64(sqlite3_vfs *pVfs, sqlite3_int64 *p){
STATCNT(VFSSTAT_ANY,VFSSTAT_CURTIME)++;
return REALVFS(pVfs)->xCurrentTimeInt64(REALVFS(pVfs), p);
}
/*
** A virtual table for accessing the stats collected by this VFS shim
*/
static int vstattabConnect(sqlite3*, void*, int, const char*const*,
sqlite3_vtab**,char**);
static int vstattabBestIndex(sqlite3_vtab*,sqlite3_index_info*);
static int vstattabDisconnect(sqlite3_vtab*);
static int vstattabOpen(sqlite3_vtab*, sqlite3_vtab_cursor**);
static int vstattabClose(sqlite3_vtab_cursor*);
static int vstattabFilter(sqlite3_vtab_cursor*, int idxNum, const char *idxStr,
int argc, sqlite3_value **argv);
static int vstattabNext(sqlite3_vtab_cursor*);
static int vstattabEof(sqlite3_vtab_cursor*);
static int vstattabColumn(sqlite3_vtab_cursor*,sqlite3_context*,int);
static int vstattabRowid(sqlite3_vtab_cursor*,sqlite3_int64*);
static int vstattabUpdate(sqlite3_vtab*,int,sqlite3_value**,sqlite3_int64*);
/* A cursor for the vfsstat virtual table */
typedef struct VfsStatCursor {
sqlite3_vtab_cursor base; /* Base class. Must be first */
int i; /* Pointing to this aVfsCnt[] value */
} VfsStatCursor;
static int vstattabConnect(
sqlite3 *db,
void *pAux,
int argc, const char *const*argv,
sqlite3_vtab **ppVtab,
char **pzErr
){
sqlite3_vtab *pNew;
int rc;
/* Column numbers */
#define VSTAT_COLUMN_FILE 0
#define VSTAT_COLUMN_STAT 1
#define VSTAT_COLUMN_COUNT 2
rc = sqlite3_declare_vtab(db,"CREATE TABLE x(file,stat,count)");
if( rc==SQLITE_OK ){
pNew = *ppVtab = sqlite3_malloc( sizeof(*pNew) );
if( pNew==0 ) return SQLITE_NOMEM;
memset(pNew, 0, sizeof(*pNew));
}
return rc;
}
/*
** This method is the destructor for vstat table object.
*/
static int vstattabDisconnect(sqlite3_vtab *pVtab){
sqlite3_free(pVtab);
return SQLITE_OK;
}
/*
** Constructor for a new vstat table cursor object.
*/
static int vstattabOpen(sqlite3_vtab *p, sqlite3_vtab_cursor **ppCursor){
VfsStatCursor *pCur;
pCur = sqlite3_malloc( sizeof(*pCur) );
if( pCur==0 ) return SQLITE_NOMEM;
memset(pCur, 0, sizeof(*pCur));
*ppCursor = &pCur->base;
return SQLITE_OK;
}
/*
** Destructor for a VfsStatCursor.
*/
static int vstattabClose(sqlite3_vtab_cursor *cur){
sqlite3_free(cur);
return SQLITE_OK;
}
/*
** Advance a VfsStatCursor to its next row of output.
*/
static int vstattabNext(sqlite3_vtab_cursor *cur){
((VfsStatCursor*)cur)->i++;
return SQLITE_OK;
}
/*
** Return values of columns for the row at which the VfsStatCursor
** is currently pointing.
*/
static int vstattabColumn(
sqlite3_vtab_cursor *cur, /* The cursor */
sqlite3_context *ctx, /* First argument to sqlite3_result_...() */
int i /* Which column to return */
){
VfsStatCursor *pCur = (VfsStatCursor*)cur;
switch( i ){
case VSTAT_COLUMN_FILE: {
sqlite3_result_text(ctx, azFile[pCur->i/VFSSTAT_nStat], -1, SQLITE_STATIC);
break;
}
case VSTAT_COLUMN_STAT: {
const char **az;
az = (pCur->i/VFSSTAT_nStat)==VFSSTAT_ANY ? azStatAny : azStat;
sqlite3_result_text(ctx, az[pCur->i%VFSSTAT_nStat], -1, SQLITE_STATIC);
break;
}
case VSTAT_COLUMN_COUNT: {
sqlite3_result_int64(ctx, aVfsCnt[pCur->i]);
break;
}
}
return SQLITE_OK;
}
/*
** Return the rowid for the current row.
*/
static int vstattabRowid(sqlite3_vtab_cursor *cur, sqlite_int64 *pRowid){
VfsStatCursor *pCur = (VfsStatCursor*)cur;
*pRowid = pCur->i;
return SQLITE_OK;
}
/*
** Return TRUE if the cursor has been moved off of the last
** row of output.
*/
static int vstattabEof(sqlite3_vtab_cursor *cur){
VfsStatCursor *pCur = (VfsStatCursor*)cur;
return pCur->i >= VFSSTAT_MXCNT;
}
/*
** Only a full table scan is supported. So xFilter simply rewinds to
** the beginning.
*/
static int vstattabFilter(
sqlite3_vtab_cursor *pVtabCursor,
int idxNum, const char *idxStr,
int argc, sqlite3_value **argv
){
VfsStatCursor *pCur = (VfsStatCursor*)pVtabCursor;
pCur->i = 0;
return SQLITE_OK;
}
/*
** Only a forwards full table scan is supported. xBestIndex is a no-op.
*/
static int vstattabBestIndex(
sqlite3_vtab *tab,
sqlite3_index_info *pIdxInfo
){
return SQLITE_OK;
}
/*
** Any VSTAT_COLUMN_COUNT can be changed to a positive integer.
** No deletions or insertions are allowed. No changes to other
** columns are allowed.
*/
static int vstattabUpdate(
sqlite3_vtab *tab,
int argc, sqlite3_value **argv,
sqlite3_int64 *pRowid
){
sqlite3_int64 iRowid, x;
if( argc==1 ) return SQLITE_ERROR;
if( sqlite3_value_type(argv[0])!=SQLITE_INTEGER ) return SQLITE_ERROR;
iRowid = sqlite3_value_int64(argv[0]);
if( iRowid!=sqlite3_value_int64(argv[1]) ) return SQLITE_ERROR;
if( iRowid<0 || iRowid>=VFSSTAT_MXCNT ) return SQLITE_ERROR;
if( sqlite3_value_type(argv[VSTAT_COLUMN_COUNT+2])!=SQLITE_INTEGER ){
return SQLITE_ERROR;
}
x = sqlite3_value_int64(argv[VSTAT_COLUMN_COUNT+2]);
if( x<0 ) return SQLITE_ERROR;
aVfsCnt[iRowid] = x;
return SQLITE_OK;
}
static sqlite3_module VfsStatModule = {
0, /* iVersion */
0, /* xCreate */
vstattabConnect, /* xConnect */
vstattabBestIndex, /* xBestIndex */
vstattabDisconnect, /* xDisconnect */
0, /* xDestroy */
vstattabOpen, /* xOpen - open a cursor */
vstattabClose, /* xClose - close a cursor */
vstattabFilter, /* xFilter - configure scan constraints */
vstattabNext, /* xNext - advance a cursor */
vstattabEof, /* xEof - check for end of scan */
vstattabColumn, /* xColumn - read data */
vstattabRowid, /* xRowid - read data */
vstattabUpdate, /* xUpdate */
0, /* xBegin */
0, /* xSync */
0, /* xCommit */
0, /* xRollback */
0, /* xFindMethod */
0, /* xRename */
};
/*
** This routine is an sqlite3_auto_extension() callback, invoked to register
** the vfsstat virtual table for all new database connections.
*/
static int vstatRegister(
sqlite3 *db,
const char **pzErrMsg,
const struct sqlite3_api_routines *pThunk
){
return sqlite3_create_module(db, "vfsstat", &VfsStatModule, 0);
}
#ifdef _WIN32
__declspec(dllexport)
#endif
/*
** This routine is called when the extension is loaded.
**
** Register the new VFS. Make arrangement to register the virtual table
** for each new database connection.
*/
int sqlite3_vfsstat_init(
sqlite3 *db,
char **pzErrMsg,
const sqlite3_api_routines *pApi
){
int rc = SQLITE_OK;
SQLITE_EXTENSION_INIT2(pApi);
vstat_vfs.pVfs = sqlite3_vfs_find(0);
vstat_vfs.base.szOsFile = sizeof(VStatFile) + vstat_vfs.pVfs->szOsFile;
rc = sqlite3_vfs_register(&vstat_vfs.base, 1);
if( rc==SQLITE_OK ){
rc = sqlite3_auto_extension(vstatRegister);
}
if( rc==SQLITE_OK ) rc = SQLITE_OK_LOAD_PERMANENTLY;
return rc;
}
|
the_stack_data/15762534.c
|
/**
* Program to generate sha1 - using openssl libs
*
* Dev Naga ([email protected])
*/
#include <stdio.h>
#include <sys/types.h>
#include <stdint.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
#include <string.h>
#include <openssl/sha.h>
int main(int argc, char **argv)
{
int fd;
uint8_t sha1sum[40];
if (argc != 2) {
fprintf(stderr, "generate sha1 for a file\n\n <%s> filename>\n", argv[0]);
return -1;
}
fd = open(argv[1], O_RDONLY);
if (fd < 0) {
fprintf(stderr, "failed to open %s \n", argv[1]);
return -1;
}
SHA_CTX c;
SHA1_Init(&c);
for (;;) {
char data[2000];
int ret;
memset(data, 0, sizeof(data));
ret = read(fd, data, sizeof(data));
if (ret <= 0) {
break;
}
SHA1_Update(&c, data, ret);
}
SHA1_Final(sha1sum, &c);
int i;
printf("[%s] sha1sum: ", argv[1]);
for (i = 0; i < SHA_DIGEST_LENGTH; i ++) {
printf("%02x", sha1sum[i]);
}
printf("\n");
return 0;
}
|
the_stack_data/179829455.c
|
char* doit(int flag)
{
return 1 + (flag ? "\0wrong\n" : "\0right\n");
}
int main()
{
char *result = doit(0);
if (*result == 'r' && result[1] == 'i')
exit(0);
abort();
}
|
the_stack_data/979008.c
|
#include <stdio.h>
#include <sys/stat.h>
#include <stdbool.h>
#include <stdlib.h>
#include <dirent.h>
#include <unistd.h>
#include <string.h>
#include <ftw.h>
#define MAX_FTW_DEPTH 16
static int num_dirs, num_regular;
static int callback(const char *fpath, const struct stat *sb, int typeflag){
if(typeflag == FTW_F){
num_regular++;
} else if (typeflag == FTW_D){
num_dirs++;
}
}
int main (int argc, char *argv[]) {
// Ensure an argument was provided.
if (argc != 2) {
printf ("Usage: %s <path>\n", argv[0]);
printf (" where <path> is the file or root of the tree you want to summarize.\n");
return 1;
}
num_dirs = 0;
num_regular = 0;
ftw(argv[1], callback, MAX_FTW_DEPTH);
printf("There were %d directories.\n", num_dirs);
printf("There were %d regular files.\n", num_regular);
return 0;
}
|
the_stack_data/125139717.c
|
#include <sys/types.h>
#include <sys/wait.h>
#include <unistd.h>
#include <stdio.h>
#include <stdlib.h>
int main(int argc, char *argv[])
{
int num;
pid_t pid;
srandom(getpid());
for (num = 0; num < 3; num++)
{
pid = fork();
printf("Soy el proceso de PID %d y mi padre tiene %d de PID.\n", getpid(), getppid());
if (pid == 0)
break;
}
if (pid == 0)
sleep(random() % 5);
else
for (num = 0; num < 3; num++)
printf("Fin del proceso de PID %d.\n", wait(NULL));
return 0;
}
|
the_stack_data/151704688.c
|
/***
* This code is a part of EvoApproxLib library (ehw.fit.vutbr.cz/approxlib) distributed under The MIT License.
* When used, please cite the following article(s): V. Mrazek, L. Sekanina, Z. Vasicek "Libraries of Approximate Circuits: Automated Design and Application in CNN Accelerators" IEEE Journal on Emerging and Selected Topics in Circuits and Systems, Vol 10, No 4, 2020
* This file contains a circuit from a sub-set of pareto optimal circuits with respect to the pwr and ep parameters
***/
// MAE% = 0.00076 %
// MAE = 0.5
// WCE% = 0.012 %
// WCE = 8.0
// WCRE% = 100.00 %
// EP% = 6.25 %
// MRE% = 0.013 %
// MSE = 4.0
// PDK45_PWR = 0.075 mW
// PDK45_AREA = 159.6 um2
// PDK45_DELAY = 1.25 ns
#include <stdint.h>
#include <stdlib.h>
uint64_t add16se_2LJ(const uint64_t B,const uint64_t A)
{
uint64_t dout_32, dout_33, dout_34, dout_35, dout_36, dout_37, dout_38, dout_39, dout_40, dout_41, dout_42, dout_43, dout_44, dout_45, dout_46, dout_47, dout_48, dout_49, dout_50, dout_51, dout_52, dout_53, dout_54, dout_55, dout_56, dout_57, dout_58, dout_59, dout_60, dout_61, dout_62, dout_63, dout_64, dout_65, dout_67, dout_68, dout_69, dout_70, dout_71, dout_72, dout_73, dout_74, dout_75, dout_76, dout_77, dout_78, dout_79, dout_80, dout_81, dout_82, dout_83, dout_84, dout_85, dout_88, dout_89, dout_90, dout_91, dout_92, dout_93, dout_94, dout_95, dout_96, dout_97, dout_98, dout_99, dout_100, dout_101, dout_102, dout_103, dout_104, dout_105, dout_106, dout_107, dout_108, dout_109, dout_110, dout_111, dout_112, dout_113, dout_114, dout_115, dout_116, dout_117, dout_118, dout_119, dout_120, dout_121, dout_122, dout_123, dout_124, dout_125, dout_126, dout_127, dout_128, dout_129, dout_130, dout_131, dout_132, dout_133, dout_134, dout_135, dout_136, dout_137, dout_138, dout_139, dout_140, dout_141, dout_142, dout_143;
uint64_t O;
dout_32=((A >> 0)&1)&((B >> 0)&1);
dout_33=((A >> 0)&1)^((B >> 0)&1);
dout_34=((A >> 1)&1)&((B >> 1)&1);
dout_35=((A >> 1)&1)^((B >> 1)&1);
dout_36=((A >> 2)&1)&((B >> 2)&1);
dout_37=((A >> 2)&1)^((B >> 2)&1);
dout_38=((A >> 3)&1)&((B >> 3)&1);
dout_39=((A >> 3)&1)^((B >> 3)&1);
dout_40=((A >> 4)&1)&((B >> 4)&1);
dout_41=((A >> 4)&1)^((B >> 4)&1);
dout_42=((A >> 5)&1)&((B >> 5)&1);
dout_43=((A >> 5)&1)^((B >> 5)&1);
dout_44=((A >> 6)&1)&((B >> 6)&1);
dout_45=((A >> 6)&1)^((B >> 6)&1);
dout_46=((A >> 7)&1)&((B >> 7)&1);
dout_47=((A >> 7)&1)^((B >> 7)&1);
dout_48=((A >> 8)&1)&((B >> 8)&1);
dout_49=((A >> 8)&1)^((B >> 8)&1);
dout_50=((A >> 9)&1)&((B >> 9)&1);
dout_51=((A >> 9)&1)^((B >> 9)&1);
dout_52=((A >> 10)&1)&((B >> 10)&1);
dout_53=((A >> 10)&1)^((B >> 10)&1);
dout_54=((A >> 11)&1)&((B >> 11)&1);
dout_55=((A >> 11)&1)^((B >> 11)&1);
dout_56=((A >> 12)&1)&((B >> 12)&1);
dout_57=((A >> 12)&1)^((B >> 12)&1);
dout_58=((A >> 13)&1)&((B >> 13)&1);
dout_59=((A >> 13)&1)^((B >> 13)&1);
dout_60=((A >> 14)&1)&((B >> 14)&1);
dout_61=((A >> 14)&1)^((B >> 14)&1);
dout_62=((A >> 15)&1)&((B >> 15)&1);
dout_63=((A >> 15)&1)^((B >> 15)&1);
dout_64=((A >> 15)&1)^((B >> 15)&1);
dout_65=dout_37&dout_34;
dout_67=dout_36|dout_65;
dout_68=dout_41&dout_38;
dout_69=dout_41&dout_39;
dout_70=dout_40|dout_68;
dout_71=dout_45&dout_42;
dout_72=dout_45&dout_43;
dout_73=dout_44|dout_71;
dout_74=dout_49&dout_46;
dout_75=dout_49&dout_47;
dout_76=dout_48|dout_74;
dout_77=dout_53&dout_50;
dout_78=dout_53&dout_51;
dout_79=dout_52|dout_77;
dout_80=dout_57&dout_54;
dout_81=dout_57&dout_55;
dout_82=dout_56|dout_80;
dout_83=dout_61&dout_58;
dout_84=dout_61&dout_59;
dout_85=dout_60|dout_83;
dout_88=dout_72&dout_70;
dout_89=dout_72&dout_69;
dout_90=dout_73|dout_88;
dout_91=dout_78&dout_76;
dout_92=dout_78&dout_75;
dout_93=dout_79|dout_91;
dout_94=dout_84&dout_82;
dout_95=dout_84&dout_81;
dout_96=dout_85|dout_94;
dout_97=dout_89&dout_67;
dout_98=dout_90|dout_97;
dout_99=dout_95&dout_93;
dout_100=dout_95&dout_92;
dout_101=dout_96|dout_99;
dout_102=dout_100&dout_98;
dout_103=dout_101|dout_102;
dout_104=dout_92&dout_98;
dout_105=dout_93|dout_104;
dout_106=dout_69&dout_67;
dout_107=dout_70|dout_106;
dout_108=dout_75&dout_98;
dout_109=dout_76|dout_108;
dout_110=dout_81&dout_105;
dout_111=dout_82|dout_110;
dout_112=dout_35&dout_32;
dout_113=dout_34|dout_112;
dout_114=dout_39&dout_67;
dout_115=dout_38|dout_114;
dout_116=dout_43&dout_107;
dout_117=dout_42|dout_116;
dout_118=dout_47&dout_98;
dout_119=dout_46|dout_118;
dout_120=dout_51&dout_109;
dout_121=dout_50|dout_120;
dout_122=dout_55&dout_105;
dout_123=dout_54|dout_122;
dout_124=dout_59&dout_111;
dout_125=dout_58|dout_124;
dout_126=dout_63&dout_103;
dout_127=dout_62|dout_126;
dout_128=dout_35^dout_32;
dout_129=dout_37^dout_113;
dout_130=dout_39^dout_67;
dout_131=dout_41^dout_115;
dout_132=dout_43^dout_107;
dout_133=dout_45^dout_117;
dout_134=dout_47^dout_98;
dout_135=dout_49^dout_119;
dout_136=dout_51^dout_109;
dout_137=dout_53^dout_121;
dout_138=dout_55^dout_105;
dout_139=dout_57^dout_123;
dout_140=dout_59^dout_111;
dout_141=dout_61^dout_125;
dout_142=dout_63^dout_103;
dout_143=dout_64^dout_127;
O = 0;
O |= (dout_33&1) << 0;
O |= (dout_128&1) << 1;
O |= (dout_129&1) << 2;
O |= (dout_130&1) << 3;
O |= (dout_131&1) << 4;
O |= (dout_132&1) << 5;
O |= (dout_133&1) << 6;
O |= (dout_134&1) << 7;
O |= (dout_135&1) << 8;
O |= (dout_136&1) << 9;
O |= (dout_137&1) << 10;
O |= (dout_138&1) << 11;
O |= (dout_139&1) << 12;
O |= (dout_140&1) << 13;
O |= (dout_141&1) << 14;
O |= (dout_142&1) << 15;
O |= (dout_143&1) << 16;
return O;
}
|
the_stack_data/20547.c
|
/*
* linux/tools/build.c
*
* (C) 1991 Linus Torvalds
*/
/*
* This file builds a disk-image from three different files:
*
* - bootsect: max 510 bytes of 8086 machine code, loads the rest
* - setup: max 4 sectors of 8086 machine code, sets up system parm
* - system: 80386 code for actual system
*
* It does some checking that all files are of the correct type, and
* just writes the result to stdout, removing headers and padding to
* the right amount. It also writes some system data to stderr.
*/
/*
* Changes by tytso to allow root device specification
*/
#include <stdio.h> /* fprintf */
#include <string.h>
#include <stdlib.h> /* contains exit */
#include <sys/types.h> /* unistd.h needs this */
#include <sys/stat.h>
#include <linux/fs.h>
#include <unistd.h> /* contains read/write */
#include <fcntl.h>
/*
* Changes by falcon<[email protected]> to define MAJOR and MINOR for they
* are not defined in current linux header file linux/fs.h,I copy it from
* include/linux/fs.h directly.
*/
#ifndef MAJOR
#define MAJOR(a) (((unsigned)(a))>>8)
#endif
#ifndef MINOR
#define MINOR(a) ((a)&0xff)
#endif
#define MINIX_HEADER 32
#define GCC_HEADER 1024
#define SYS_SIZE 0x3000
/*
* Changes by falcon<[email protected]> to let this kernel Image file boot
* with a root image file on the first hardware device /dev/hd1, hence, you
* should prepare a root image file, and configure the bochs with
* the following lines(please set the ... as suitable info):
* ...
* floppya: 1_44="Image", status=inserted
* ata0-master: type=disk, path="/path/to/rootimage.img", mode=flat ...
* ...
*/
#define DEFAULT_MAJOR_ROOT 3
#define DEFAULT_MINOR_ROOT 1
/* max nr of sectors of setup: don't change unless you also change
* bootsect etc */
#define SETUP_SECTS 4
#define STRINGIFY(x) #x
void die(char * str)
{
fprintf(stderr,"%s\n",str);
exit(1);
}
void usage(void)
{
die("Usage: build bootsect setup system [rootdev] [> image]");
}
int main(int argc, char ** argv)
{
int i,c,id;
char buf[1024];
char major_root, minor_root;
struct stat sb;
if ((argc != 4) && (argc != 5))
usage();
if (argc == 5) {
if (strcmp(argv[4], "FLOPPY")) {
if (stat(argv[4], &sb)) {
perror(argv[4]);
die("Couldn't stat root device.");
}
major_root = MAJOR(sb.st_rdev);
minor_root = MINOR(sb.st_rdev);
} else {
major_root = 0;
minor_root = 0;
}
} else {
major_root = DEFAULT_MAJOR_ROOT;
minor_root = DEFAULT_MINOR_ROOT;
}
fprintf(stderr, "Root device is (%d, %d)\n", major_root, minor_root);
if ((major_root != 2) && (major_root != 3) &&
(major_root != 0)) {
fprintf(stderr, "Illegal root device (major = %d)\n",
major_root);
die("Bad root device --- major #");
}
for (i=0;i<sizeof buf; i++) buf[i]=0;
if ((id=open(argv[1],O_RDONLY,0))<0)
die("Unable to open 'boot'");
if (read(id,buf,MINIX_HEADER) != MINIX_HEADER)
die("Unable to read header of 'boot'");
if (((long *) buf)[0]!=0x04100301)
die("Non-Minix header of 'boot'");
if (((long *) buf)[1]!=MINIX_HEADER)
die("Non-Minix header of 'boot'");
if (((long *) buf)[3]!=0)
die("Illegal data segment in 'boot'");
if (((long *) buf)[4]!=0)
die("Illegal bss in 'boot'");
if (((long *) buf)[5] != 0)
die("Non-Minix header of 'boot'");
if (((long *) buf)[7] != 0)
die("Illegal symbol table in 'boot'");
i=read(id,buf,sizeof buf);
fprintf(stderr,"Boot sector %d bytes.\n",i);
if (i != 512)
die("Boot block must be exactly 512 bytes");
if ((*(unsigned short *)(buf+510)) != 0xAA55)
die("Boot block hasn't got boot flag (0xAA55)");
buf[508] = (char) minor_root;
buf[509] = (char) major_root;
i=write(1,buf,512);
if (i!=512)
die("Write call failed");
close (id);
if ((id=open(argv[2],O_RDONLY,0))<0)
die("Unable to open 'setup'");
if (read(id,buf,MINIX_HEADER) != MINIX_HEADER)
die("Unable to read header of 'setup'");
if (((long *) buf)[0]!=0x04100301)
die("Non-Minix header of 'setup'");
if (((long *) buf)[1]!=MINIX_HEADER)
die("Non-Minix header of 'setup'");
if (((long *) buf)[3]!=0)
die("Illegal data segment in 'setup'");
if (((long *) buf)[4]!=0)
die("Illegal bss in 'setup'");
if (((long *) buf)[5] != 0)
die("Non-Minix header of 'setup'");
if (((long *) buf)[7] != 0)
die("Illegal symbol table in 'setup'");
for (i=0 ; (c=read(id,buf,sizeof buf))>0 ; i+=c )
if (write(1,buf,c)!=c)
die("Write call failed");
close (id);
if (i > SETUP_SECTS*512)
die("Setup exceeds " STRINGIFY(SETUP_SECTS)
" sectors - rewrite build/boot/setup");
fprintf(stderr,"Setup is %d bytes.\n",i);
for (c=0 ; c<sizeof(buf) ; c++)
buf[c] = '\0';
while (i<SETUP_SECTS*512) {
c = SETUP_SECTS*512-i;
if (c > sizeof(buf))
c = sizeof(buf);
if (write(1,buf,c) != c)
die("Write call failed");
i += c;
}
// if ((id=open(argv[3],O_RDONLY,0))<0)
// die("Unable to open 'system'");
//// if (read(id,buf,GCC_HEADER) != GCC_HEADER)
//// die("Unable to read header of 'system'");
//// if (((long *) buf)[5] != 0)
//// die("Non-GCC header of 'system'");
// for (i=0 ; (c=read(id,buf,sizeof buf))>0 ; i+=c )
// if (write(1,buf,c)!=c)
// die("Write call failed");
// close(id);
// fprintf(stderr,"System is %d bytes.\n",i);
// if (i > SYS_SIZE*16)
// die("System is too big");
return(0);
}
|
the_stack_data/234518321.c
|
/* APPLE LOCAL file radar 6131435 */
/* { dg-do compile { target { { i?86-*-* x86_64-*-* } && lp64 } } } */
/* { dg-options "-O2" } */
/* { dg-final { scan-assembler "movb" } } */
/* { dg-final { scan-assembler "movw" } } */
/* { dg-final { scan-assembler "andw" } } */
#define ARRAY_LENGTH 16
union bitfield {
struct {
unsigned int field0 : 6;
unsigned int field1 : 6;
unsigned int field2 : 6;
unsigned int field3 : 6;
unsigned int field4 : 3;
unsigned int field5 : 4;
unsigned int field6 : 1;
} bitfields, bits;
unsigned int u32All;
signed int i32All;
float f32All;
};
typedef struct program_t {
union bitfield array[ARRAY_LENGTH];
} program;
void foo(program* prog, unsigned int fmt1)
{
unsigned int shift = 0;
unsigned int texCount = 0;
unsigned int i;
for (i = 0; i < 8; i++)
{
prog->array[i].bitfields.field0 = texCount;
prog->array[i].bitfields.field1 = texCount + 1;
prog->array[i].bitfields.field2 = texCount + 2;
prog->array[i].bitfields.field3 = texCount + 3;
texCount += (fmt1 >> shift) & 0x7;
shift += 3;
}
}
/* APPLE LOCAL file radar 4287182 */
|
the_stack_data/151705500.c
|
#include <stdio.h>
#define LIMIT 1000
int main (int argc, char *argv[])
{
int i=0;
int sum=0;
for (i=1;i<LIMIT;++i)
if (i%3==0 || i%5==0 )
sum+=i;
printf("Sum = %d\n",sum);
return 0;
}
|
the_stack_data/7950232.c
|
/* BEGIN LICENSE BLOCK
* Version: CMPL 1.1
*
* The contents of this file are subject to the Cisco-style Mozilla Public
* License Version 1.1 (the "License"); you may not use this file except
* in compliance with the License. You may obtain a copy of the License
* at www.eclipse-clp.org/license.
*
* Software distributed under the License is distributed on an "AS IS"
* basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See
* the License for the specific language governing rights and limitations
* under the License.
*
* The Original Code is The ECLiPSe Constraint Logic Programming System.
* The Initial Developer of the Original Code is Cisco Systems, Inc.
* Portions created by the Initial Developer are
* Copyright (C) 1992-2006 Cisco Systems, Inc. All Rights Reserved.
*
* Contributor(s):
*
* END LICENSE BLOCK */
/*
* VERSION $Id: lib7.c,v 1.1 2008/06/30 17:43:56 jschimpf Exp $
*/
/*
* IDENTIFICATION lib7.c
* This is the sepia library that contains
* the dummy version of the MegaLog init
* functions.
*
* DESCRIPTION
*
* AUTHOR VERSION DATE REASON
* Michel Dahmen 3.0 27.2.92 created the file
*/
/*ARGSUSED*/
void megalog_init(flags) int flags; {}
/*ARGSUSED*/
void megalog_boot_init(flags) int flags; {}
void megalog_end() {}
int megalog_present() { return (0); }
|
the_stack_data/1078414.c
|
// this source is derived from CHILL AST originally from file '/uufs/chpc.utah.edu/common/home/u1142914/lib/ytopt_vinu/polybench/polybench-code/stencils/fdtd-2d/kernel.c' as parsed by frontend compiler rose
void kernel_fdtd_2d(int tmax, int nx, int ny, double ex[1000 + 0][1200 + 0], double ey[1000 + 0][1200 + 0], double hz[1000 + 0][1200 + 0], double _fict_[500 + 0]) {
int t10;
int t8;
int t6;
int t4;
int t2;
for (t2 = 0; t2 <= tmax - 1; t2 += 1) {
for (t4 = 0; t4 <= ny - 1; t4 += 1)
ey[0][t4] = _fict_[t2];
for (t4 = 1; t4 <= nx - 1; t4 += 16)
for (t6 = t4; t6 <= (t4 + 15 < nx - 1 ? t4 + 15 : nx - 1); t6 += 1)
for (t8 = 0; t8 <= ny - 1; t8 += 64)
for (t10 = t8; t10 <= (ny - 1 < t8 + 63 ? ny - 1 : t8 + 63); t10 += 1)
ey[t6][t10] = ey[t6][t10] - 0.5 * (hz[t6][t10] - hz[t6 - 1][t10]);
for (t4 = 0; t4 <= nx - 1; t4 += 16)
for (t6 = t4; t6 <= (t4 + 15 < nx - 1 ? t4 + 15 : nx - 1); t6 += 1)
for (t8 = 1; t8 <= ny - 1; t8 += 64)
for (t10 = t8; t10 <= (ny - 1 < t8 + 63 ? ny - 1 : t8 + 63); t10 += 1)
ex[t6][t10] = ex[t6][t10] - 0.5 * (hz[t6][t10] - hz[t6][t10 - 1]);
for (t4 = 0; t4 <= nx - 2; t4 += 16)
for (t6 = t4; t6 <= (t4 + 15 < nx - 2 ? t4 + 15 : nx - 2); t6 += 1)
for (t8 = 0; t8 <= ny - 2; t8 += 64)
for (t10 = t8; t10 <= (ny - 2 < t8 + 63 ? ny - 2 : t8 + 63); t10 += 1)
hz[t6][t10] = hz[t6][t10] - 0.69999999999999996 * (ex[t6][t10 + 1] - ex[t6][t10] + ey[t6 + 1][t10] - ey[t6][t10]);
}
}
|
the_stack_data/103264698.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_2__ TYPE_1__ ;
/* Type definitions */
typedef int /*<<< orphan*/ u8 ;
typedef int u16 ;
struct wpa_sm {scalar_t__ pairwise_cipher; scalar_t__ group_cipher; scalar_t__ proto; TYPE_1__* ctx; int /*<<< orphan*/ rx_replay_counter; scalar_t__ rx_replay_counter_set; int /*<<< orphan*/ key_mgmt; int /*<<< orphan*/ eapol; int /*<<< orphan*/ pmk_len; scalar_t__ ft_completed; } ;
struct wpa_eapol_key {unsigned long type; int /*<<< orphan*/ replay_counter; int /*<<< orphan*/ * key_info; } ;
struct ieee802_1x_hdr {unsigned long type; int /*<<< orphan*/ version; int /*<<< orphan*/ length; } ;
struct TYPE_2__ {int /*<<< orphan*/ msg_ctx; } ;
/* Variables and functions */
unsigned long EAPOL_KEY_TYPE_RSN ;
unsigned long EAPOL_KEY_TYPE_WPA ;
int /*<<< orphan*/ EAPOL_VERSION ;
unsigned long IEEE802_1X_TYPE_EAPOL_KEY ;
int /*<<< orphan*/ MSG_DEBUG ;
int /*<<< orphan*/ MSG_INFO ;
int /*<<< orphan*/ MSG_MSGDUMP ;
int /*<<< orphan*/ MSG_WARNING ;
scalar_t__ WPA_CIPHER_CCMP ;
scalar_t__ WPA_CIPHER_GCMP ;
void* WPA_GET_BE16 (int /*<<< orphan*/ *) ;
int WPA_KEY_INFO_ACK ;
int WPA_KEY_INFO_ENCR_KEY_DATA ;
int WPA_KEY_INFO_KEY_INDEX_MASK ;
int WPA_KEY_INFO_KEY_TYPE ;
int WPA_KEY_INFO_MIC ;
int WPA_KEY_INFO_REQUEST ;
int WPA_KEY_INFO_SMK_MESSAGE ;
int WPA_KEY_INFO_TYPE_AES_128_CMAC ;
int WPA_KEY_INFO_TYPE_AKM_DEFINED ;
int WPA_KEY_INFO_TYPE_HMAC_MD5_RC4 ;
int WPA_KEY_INFO_TYPE_HMAC_SHA1_AES ;
int WPA_KEY_INFO_TYPE_MASK ;
scalar_t__ WPA_PROTO_OSEN ;
scalar_t__ WPA_PROTO_RSN ;
int /*<<< orphan*/ WPA_REPLAY_COUNTER_LEN ;
size_t be_to_host16 (int /*<<< orphan*/ ) ;
int /*<<< orphan*/ bin_clear_free (int /*<<< orphan*/ *,size_t) ;
int /*<<< orphan*/ eapol_sm_notify_lower_layer_success (int /*<<< orphan*/ ,int /*<<< orphan*/ ) ;
scalar_t__ os_memcmp (int /*<<< orphan*/ ,int /*<<< orphan*/ ,int /*<<< orphan*/ ) ;
int /*<<< orphan*/ * os_memdup (int /*<<< orphan*/ const*,size_t) ;
int /*<<< orphan*/ wpa_dbg (int /*<<< orphan*/ ,int /*<<< orphan*/ ,char*,unsigned long,...) ;
int /*<<< orphan*/ wpa_eapol_key_dump (struct wpa_sm*,struct wpa_eapol_key*,size_t,int /*<<< orphan*/ *,size_t) ;
int /*<<< orphan*/ wpa_hexdump (int /*<<< orphan*/ ,char*,int /*<<< orphan*/ const*,size_t) ;
scalar_t__ wpa_key_mgmt_ft (int /*<<< orphan*/ ) ;
scalar_t__ wpa_key_mgmt_sha256 (int /*<<< orphan*/ ) ;
size_t wpa_mic_len (int /*<<< orphan*/ ,int /*<<< orphan*/ ) ;
int /*<<< orphan*/ wpa_msg (int /*<<< orphan*/ ,int /*<<< orphan*/ ,char*,...) ;
scalar_t__ wpa_supp_aead_decrypt (struct wpa_sm*,int /*<<< orphan*/ *,size_t,size_t*) ;
scalar_t__ wpa_supplicant_decrypt_key_data (struct wpa_sm*,struct wpa_eapol_key*,size_t,int,int /*<<< orphan*/ *,size_t*) ;
int /*<<< orphan*/ wpa_supplicant_process_1_of_2 (struct wpa_sm*,int /*<<< orphan*/ const*,struct wpa_eapol_key*,int /*<<< orphan*/ *,size_t,int) ;
int /*<<< orphan*/ wpa_supplicant_process_1_of_4 (struct wpa_sm*,int /*<<< orphan*/ const*,struct wpa_eapol_key*,int,int /*<<< orphan*/ *,size_t) ;
int /*<<< orphan*/ wpa_supplicant_process_3_of_4 (struct wpa_sm*,struct wpa_eapol_key*,int,int /*<<< orphan*/ *,size_t) ;
scalar_t__ wpa_supplicant_verify_eapol_key_mic (struct wpa_sm*,struct wpa_eapol_key*,int,int /*<<< orphan*/ *,size_t) ;
scalar_t__ wpa_use_akm_defined (int /*<<< orphan*/ ) ;
int wpa_sm_rx_eapol(struct wpa_sm *sm, const u8 *src_addr,
const u8 *buf, size_t len)
{
size_t plen, data_len, key_data_len;
const struct ieee802_1x_hdr *hdr;
struct wpa_eapol_key *key;
u16 key_info, ver;
u8 *tmp = NULL;
int ret = -1;
u8 *mic, *key_data;
size_t mic_len, keyhdrlen;
#ifdef CONFIG_IEEE80211R
sm->ft_completed = 0;
#endif /* CONFIG_IEEE80211R */
mic_len = wpa_mic_len(sm->key_mgmt, sm->pmk_len);
keyhdrlen = sizeof(*key) + mic_len + 2;
if (len < sizeof(*hdr) + keyhdrlen) {
wpa_dbg(sm->ctx->msg_ctx, MSG_DEBUG,
"WPA: EAPOL frame too short to be a WPA "
"EAPOL-Key (len %lu, expecting at least %lu)",
(unsigned long) len,
(unsigned long) sizeof(*hdr) + keyhdrlen);
return 0;
}
hdr = (const struct ieee802_1x_hdr *) buf;
plen = be_to_host16(hdr->length);
data_len = plen + sizeof(*hdr);
wpa_dbg(sm->ctx->msg_ctx, MSG_DEBUG,
"IEEE 802.1X RX: version=%d type=%d length=%lu",
hdr->version, hdr->type, (unsigned long) plen);
if (hdr->version < EAPOL_VERSION) {
/* TODO: backwards compatibility */
}
if (hdr->type != IEEE802_1X_TYPE_EAPOL_KEY) {
wpa_dbg(sm->ctx->msg_ctx, MSG_DEBUG,
"WPA: EAPOL frame (type %u) discarded, "
"not a Key frame", hdr->type);
ret = 0;
goto out;
}
wpa_hexdump(MSG_MSGDUMP, "WPA: RX EAPOL-Key", buf, len);
if (plen > len - sizeof(*hdr) || plen < keyhdrlen) {
wpa_dbg(sm->ctx->msg_ctx, MSG_DEBUG,
"WPA: EAPOL frame payload size %lu "
"invalid (frame size %lu)",
(unsigned long) plen, (unsigned long) len);
ret = 0;
goto out;
}
if (data_len < len) {
wpa_dbg(sm->ctx->msg_ctx, MSG_DEBUG,
"WPA: ignoring %lu bytes after the IEEE 802.1X data",
(unsigned long) len - data_len);
}
/*
* Make a copy of the frame since we need to modify the buffer during
* MAC validation and Key Data decryption.
*/
tmp = os_memdup(buf, data_len);
if (tmp == NULL)
goto out;
key = (struct wpa_eapol_key *) (tmp + sizeof(struct ieee802_1x_hdr));
mic = (u8 *) (key + 1);
key_data = mic + mic_len + 2;
if (key->type != EAPOL_KEY_TYPE_WPA && key->type != EAPOL_KEY_TYPE_RSN)
{
wpa_dbg(sm->ctx->msg_ctx, MSG_DEBUG,
"WPA: EAPOL-Key type (%d) unknown, discarded",
key->type);
ret = 0;
goto out;
}
key_data_len = WPA_GET_BE16(mic + mic_len);
wpa_eapol_key_dump(sm, key, key_data_len, mic, mic_len);
if (key_data_len > plen - keyhdrlen) {
wpa_msg(sm->ctx->msg_ctx, MSG_INFO, "WPA: Invalid EAPOL-Key "
"frame - key_data overflow (%u > %u)",
(unsigned int) key_data_len,
(unsigned int) (plen - keyhdrlen));
goto out;
}
eapol_sm_notify_lower_layer_success(sm->eapol, 0);
key_info = WPA_GET_BE16(key->key_info);
ver = key_info & WPA_KEY_INFO_TYPE_MASK;
if (ver != WPA_KEY_INFO_TYPE_HMAC_MD5_RC4 &&
#if defined(CONFIG_IEEE80211R) || defined(CONFIG_IEEE80211W)
ver != WPA_KEY_INFO_TYPE_AES_128_CMAC &&
#endif /* CONFIG_IEEE80211R || CONFIG_IEEE80211W */
ver != WPA_KEY_INFO_TYPE_HMAC_SHA1_AES &&
!wpa_use_akm_defined(sm->key_mgmt)) {
wpa_msg(sm->ctx->msg_ctx, MSG_INFO,
"WPA: Unsupported EAPOL-Key descriptor version %d",
ver);
goto out;
}
if (wpa_use_akm_defined(sm->key_mgmt) &&
ver != WPA_KEY_INFO_TYPE_AKM_DEFINED) {
wpa_msg(sm->ctx->msg_ctx, MSG_INFO,
"RSN: Unsupported EAPOL-Key descriptor version %d (expected AKM defined = 0)",
ver);
goto out;
}
#ifdef CONFIG_IEEE80211R
if (wpa_key_mgmt_ft(sm->key_mgmt)) {
/* IEEE 802.11r uses a new key_info type (AES-128-CMAC). */
if (ver != WPA_KEY_INFO_TYPE_AES_128_CMAC &&
!wpa_use_akm_defined(sm->key_mgmt)) {
wpa_msg(sm->ctx->msg_ctx, MSG_INFO,
"FT: AP did not use AES-128-CMAC");
goto out;
}
} else
#endif /* CONFIG_IEEE80211R */
#ifdef CONFIG_IEEE80211W
if (wpa_key_mgmt_sha256(sm->key_mgmt)) {
if (ver != WPA_KEY_INFO_TYPE_AES_128_CMAC &&
!wpa_use_akm_defined(sm->key_mgmt)) {
wpa_msg(sm->ctx->msg_ctx, MSG_INFO,
"WPA: AP did not use the "
"negotiated AES-128-CMAC");
goto out;
}
} else
#endif /* CONFIG_IEEE80211W */
if (sm->pairwise_cipher == WPA_CIPHER_CCMP &&
!wpa_use_akm_defined(sm->key_mgmt) &&
ver != WPA_KEY_INFO_TYPE_HMAC_SHA1_AES) {
wpa_msg(sm->ctx->msg_ctx, MSG_INFO,
"WPA: CCMP is used, but EAPOL-Key "
"descriptor version (%d) is not 2", ver);
if (sm->group_cipher != WPA_CIPHER_CCMP &&
!(key_info & WPA_KEY_INFO_KEY_TYPE)) {
/* Earlier versions of IEEE 802.11i did not explicitly
* require version 2 descriptor for all EAPOL-Key
* packets, so allow group keys to use version 1 if
* CCMP is not used for them. */
wpa_msg(sm->ctx->msg_ctx, MSG_INFO,
"WPA: Backwards compatibility: allow invalid "
"version for non-CCMP group keys");
} else if (ver == WPA_KEY_INFO_TYPE_AES_128_CMAC) {
wpa_msg(sm->ctx->msg_ctx, MSG_INFO,
"WPA: Interoperability workaround: allow incorrect (should have been HMAC-SHA1), but stronger (is AES-128-CMAC), descriptor version to be used");
} else
goto out;
} else if (sm->pairwise_cipher == WPA_CIPHER_GCMP &&
!wpa_use_akm_defined(sm->key_mgmt) &&
ver != WPA_KEY_INFO_TYPE_HMAC_SHA1_AES) {
wpa_msg(sm->ctx->msg_ctx, MSG_INFO,
"WPA: GCMP is used, but EAPOL-Key "
"descriptor version (%d) is not 2", ver);
goto out;
}
if (sm->rx_replay_counter_set &&
os_memcmp(key->replay_counter, sm->rx_replay_counter,
WPA_REPLAY_COUNTER_LEN) <= 0) {
wpa_msg(sm->ctx->msg_ctx, MSG_WARNING,
"WPA: EAPOL-Key Replay Counter did not increase - "
"dropping packet");
goto out;
}
if (key_info & WPA_KEY_INFO_SMK_MESSAGE) {
wpa_msg(sm->ctx->msg_ctx, MSG_INFO,
"WPA: Unsupported SMK bit in key_info");
goto out;
}
if (!(key_info & WPA_KEY_INFO_ACK)) {
wpa_msg(sm->ctx->msg_ctx, MSG_INFO,
"WPA: No Ack bit in key_info");
goto out;
}
if (key_info & WPA_KEY_INFO_REQUEST) {
wpa_msg(sm->ctx->msg_ctx, MSG_INFO,
"WPA: EAPOL-Key with Request bit - dropped");
goto out;
}
if ((key_info & WPA_KEY_INFO_MIC) &&
wpa_supplicant_verify_eapol_key_mic(sm, key, ver, tmp, data_len))
goto out;
#ifdef CONFIG_FILS
if (!mic_len && (key_info & WPA_KEY_INFO_ENCR_KEY_DATA)) {
if (wpa_supp_aead_decrypt(sm, tmp, data_len, &key_data_len))
goto out;
}
#endif /* CONFIG_FILS */
if ((sm->proto == WPA_PROTO_RSN || sm->proto == WPA_PROTO_OSEN) &&
(key_info & WPA_KEY_INFO_ENCR_KEY_DATA) && mic_len) {
/*
* Only decrypt the Key Data field if the frame's authenticity
* was verified. When using AES-SIV (FILS), the MIC flag is not
* set, so this check should only be performed if mic_len != 0
* which is the case in this code branch.
*/
if (!(key_info & WPA_KEY_INFO_MIC)) {
wpa_msg(sm->ctx->msg_ctx, MSG_WARNING,
"WPA: Ignore EAPOL-Key with encrypted but unauthenticated data");
goto out;
}
if (wpa_supplicant_decrypt_key_data(sm, key, mic_len,
ver, key_data,
&key_data_len))
goto out;
}
if (key_info & WPA_KEY_INFO_KEY_TYPE) {
if (key_info & WPA_KEY_INFO_KEY_INDEX_MASK) {
wpa_msg(sm->ctx->msg_ctx, MSG_WARNING,
"WPA: Ignored EAPOL-Key (Pairwise) with "
"non-zero key index");
goto out;
}
if (key_info & (WPA_KEY_INFO_MIC |
WPA_KEY_INFO_ENCR_KEY_DATA)) {
/* 3/4 4-Way Handshake */
wpa_supplicant_process_3_of_4(sm, key, ver, key_data,
key_data_len);
} else {
/* 1/4 4-Way Handshake */
wpa_supplicant_process_1_of_4(sm, src_addr, key,
ver, key_data,
key_data_len);
}
} else {
if ((mic_len && (key_info & WPA_KEY_INFO_MIC)) ||
(!mic_len && (key_info & WPA_KEY_INFO_ENCR_KEY_DATA))) {
/* 1/2 Group Key Handshake */
wpa_supplicant_process_1_of_2(sm, src_addr, key,
key_data, key_data_len,
ver);
} else {
wpa_msg(sm->ctx->msg_ctx, MSG_WARNING,
"WPA: EAPOL-Key (Group) without Mic/Encr bit - "
"dropped");
}
}
ret = 1;
out:
bin_clear_free(tmp, data_len);
return ret;
}
|
the_stack_data/20449875.c
|
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <stdbool.h>
#include <math.h>
#define MaxNumber 2000000
// My solution to projecteuler 10
// https://projecteuler.net/problem=10
int main()
{
int64_t result = 0;
for(int i = 0; i < MaxNumber; i++) {
if(isPrime(i)) {
result += i;
}
}
printf("\nSum of all primes below %i is %I64d", MaxNumber, result);
getchar();
return 0;
}
int isPrime(int n){
int i;
if (n==2)
return 1;
if (n%2==0)
return 0;
if (n < 2)
return 0;
for (i=3;i<=sqrt(n);i+=2)
if (n%i==0)
return 0;
return 1;
}
|
the_stack_data/14200423.c
|
#include <stdio.h>
int main(void)
{
// Variables declaration
int a, b;
char *str[] = {"", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"};
// Assigns the input to the corresponding variables
scanf("%d\n%d", &a, &b);
// Loop from a to b
for (; a <= b; a++)
{
// Simple conditions
if (a >= 1 && a <= 9)
printf("%s\n", str[a]);
else if (a > 9 && a % 2 == 0)
printf("even\n");
else if (a > 9)
printf("odd\n");
}
// Returns successful exit status
return (0);
}
|
the_stack_data/879.c
|
#include <stdio.h>
int main(){
int n;
scanf("%d", &n);
while(n != 0){
printf("n = %d\n", n);
scanf("%d", &n);
}
return 0;
}
|
the_stack_data/111574.c
|
#ifdef _WIN32
#pragma comment(lib, "ws2_32.lib")
//Windows specific includes
#define WINVER 0x501
#define _CRT_SECURE_NO_WARNINGS
#include <WinSock2.h>
#include <WS2tcpip.h>
#include <stdio.h>
#include <time.h>
#include <stdint.h>
#else //#ifdef _WIN32
//other OS includes and some tricks to fake Win32 API
#include <pthread.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <netdb.h>
#include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
#include <stdint.h>
#include <string.h>
#include <unistd.h>
#include <errno.h>
#include <time.h>
typedef int SOCKET;
#define SOCKET_ERROR (-1)
#define closesocket(hSock) close(hSock)
#define WSAGetLastError() errno
#define CRITICAL_SECTION pthread_mutex_t
#define InitializeCriticalSection(criticalSection) pthread_mutex_init(criticalSection, NULL)
#define EnterCriticalSection(criticalSection) pthread_mutex_lock(criticalSection)
#define LeaveCriticalSection(criticalSection) pthread_mutex_unlock(criticalSection)
#endif //#ifdef _WIN32
//application name and version
#define APP_NAME "DNS2PROXY"
//first output line in console
#define APP_STRING "\n" APP_NAME " (free software, use parameter /? to display help)\n"
//log file header line
#define LOG_HEADER APP_NAME " log opened"
//date/time format string for ISO 8601 format, but leave away the T delimiter as it's bad to read
#define DATE_TIME_FORMAT "%u-%02u-%02u %02u:%02u:%02u "
#define DEFAULT_SOCKS_SERVER "127.0.0.1"
#define DEFAULT_SOCKS_PORT "23333"
#define DEFAULT_DNS_SERVER "1.1.1.1"
#define DEFAULT_LISTEN_IP "127.0.0.1"
#define DEFAULT_DNS_PORT "53"
#define DEFAULT_LISTEN_PORT "5533"
//defines for OutputToLog (bits)
#define OUTPUT_LINE_BREAK (1)
#define OUTPUT_DATE_TIME (2)
#define OUTPUT_CONSOLE (4)
#define OUTPUT_ALL (OUTPUT_LINE_BREAK|OUTPUT_DATE_TIME|OUTPUT_CONSOLE)
union UClient
{
struct sockaddr_storage sAddr; //address of requesting client for UDP
SOCKET hSock; //socket handle for TCP
};
//entry for DNS request and answer (cache entry)
struct SEntry
{
struct SEntry* psNext; //next list entry or NULL
uint16_t* u16aAnswer; //pointer to answer or NULL
time_t iTime; //time when the answer was deliviered last time
union UClient client; //information on how to send response back to client
unsigned char uAddrLen; //length of used part of sAddr for UDP, sizeof(SOCKET) for TCP
uint16_t u16aRequest[1]; //extended dynamically at malloc for "struct SEntry" (use "uint16_t" to ensure according alignment, first element contains length in big endian format)
};
static struct SEntry* g_psFirst = NULL; //list of DNS requests and answers (cache)
static unsigned int g_uCacheCount = 0; //amout of entries in list g_psFirst
static int g_bCacheEnabled = 1; //!=0 when cache is enabled
static struct sockaddr_storage g_sDnsSrvAddr; //DNS server supporting TCP
static struct sockaddr_storage g_sSocksAddr; //SOCKS5 server
static CRITICAL_SECTION g_sCritSect; //to protect the list g_psFirst and g_uCacheCount
static SOCKET g_hSockUdp; //UDP socket
static unsigned char* g_uaUsrPwd = NULL; //authentication package for SOCKS
static int g_iUsrPwdLen; //length of g_caUsrPwd
static int g_iHttpProxyConnectLen = 0; //length of CONNECT command in g_caHttpProxyConnect
static char g_caHttpProxyConnect[300]; //CONNECT command in case of using HTTP proxy
//OS specific functionality
#ifdef _WIN32
//for Windows we can create an own console window, so here we use some OS specific functions;
//also for the file access we use the WIN32 API - we could use the C API as we do for the other OSes
//but as we need to take special care about the line break (\r\n) anyway and WIN32 should be a little
//bit faster, we use WIN32
static HANDLE g_hConsole = NULL; //handle for console output
static HANDLE g_hLogFile = INVALID_HANDLE_VALUE; //handle for log file
//passes a string and its length to a function
#define STRING_AND_LEN(szString) szString, sizeof(szString)-1
static char* GetSysError(int iErrNo)
{
char* szBuffer;
size_t uLen;
if (!FormatMessage(FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS, NULL, iErrNo, MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT), (LPSTR)&szBuffer, 0, NULL))
{
szBuffer = (char*)LocalAlloc(LMEM_FIXED, 14);
memcpy(szBuffer, "Unknown error", 14);
}
else
{
//remove line breaks at the end
uLen = strlen(szBuffer);
while (uLen > 0 && (szBuffer[uLen - 1] == '\n' || szBuffer[uLen - 1] == '\r'))
szBuffer[--uLen] = '\0';
}
return szBuffer;
}
static void FreeSysError(char* szString)
{
LocalFree(szString);
}
static void OutputToLog(unsigned int uOutputSettingBits, const char* szFormatString, ...)
{
va_list pArgs;
int iLenPrefix;
int iLen;
DWORD uDummy;
char szBuf[1024];
//nothing to do?
if ((!g_hConsole || !(uOutputSettingBits&OUTPUT_CONSOLE)) && g_hLogFile == INVALID_HANDLE_VALUE)
return;
//add line break?
if (uOutputSettingBits&OUTPUT_LINE_BREAK)
{
szBuf[0] = '\r';
szBuf[1] = '\n';
iLenPrefix = 2;
}
else
iLenPrefix = 0;
if (uOutputSettingBits&OUTPUT_DATE_TIME)
{
SYSTEMTIME sTime;
//add date/time string
GetLocalTime(&sTime);
iLen = _snprintf_s(szBuf + iLenPrefix, ARRAYSIZE(szBuf) - iLenPrefix, _TRUNCATE, DATE_TIME_FORMAT, sTime.wYear, sTime.wMonth, sTime.wDay, sTime.wHour, sTime.wMinute, sTime.wSecond);
if (iLen < 0) //error?
return;
iLenPrefix += iLen;
}
//add log string
va_start(pArgs, szFormatString);
iLen = _vsnprintf_s(szBuf + iLenPrefix, ARRAYSIZE(szBuf) - iLenPrefix, _TRUNCATE, szFormatString, pArgs);
if (iLen < 0) //error?
return;
iLen += iLenPrefix;
//output
if (g_hConsole && (uOutputSettingBits&OUTPUT_CONSOLE))
{
wchar_t wcBuf[1024];
//convert to wide char to avoid trouble with special characters
iLen = MultiByteToWideChar(CP_ACP, 0, szBuf, iLen, wcBuf, ARRAYSIZE(wcBuf));
if (iLen)
WriteConsoleW(g_hConsole, wcBuf, iLen, &uDummy, NULL);
}
if (g_hLogFile)
WriteFile(g_hLogFile, szBuf, iLen, &uDummy, NULL);
}
static void OpenLogFile(const char* szFilePath, int bAppend)
{
g_hLogFile = CreateFile(szFilePath, GENERIC_WRITE, FILE_SHARE_READ, NULL, bAppend ? OPEN_ALWAYS : CREATE_ALWAYS, 0, NULL);
if (g_hLogFile == INVALID_HANDLE_VALUE)
{
char* szErrMsg = GetSysError(GetLastError());
OutputToLog(OUTPUT_ALL, "Failed to open log file \"%s\": %s", szFilePath, szErrMsg);
FreeSysError(szErrMsg);
}
else
{
//append and no new file was created?
if (bAppend && GetLastError() == ERROR_ALREADY_EXISTS)
{
DWORD uDummy;
//go to end of file for appending
SetFilePointer(g_hLogFile, 0, NULL, FILE_END);
//add line breaks for appending
WriteFile(g_hLogFile, STRING_AND_LEN("\r\n\r\n"), &uDummy, NULL);
}
//output header string in log
OutputToLog(OUTPUT_DATE_TIME, LOG_HEADER);
}
}
static void OpenConsole()
{
if (g_hConsole) //already openend?
return;
AllocConsole();
g_hConsole = GetStdHandle(STD_OUTPUT_HANDLE);
if (g_hConsole)
{
DWORD uDummy;
WriteConsole(g_hConsole, STRING_AND_LEN(APP_STRING), &uDummy, NULL);
}
}
static void OutputFatal(const char* szFormatString, ...)
{
HANDLE hReadConsole;
va_list pArgs;
int iLen;
DWORD uDummy;
INPUT_RECORD sRecord;
char szBuf[4096];
OpenConsole();
if (!g_hConsole) //console available?
return;
va_start(pArgs, szFormatString);
iLen = _vsnprintf_s(szBuf, ARRAYSIZE(szBuf), _TRUNCATE, szFormatString, pArgs);
if (iLen < 0) //error?
return;
//output
WriteConsole(g_hConsole, szBuf, iLen, &uDummy, NULL);
WriteConsole(g_hConsole, STRING_AND_LEN("\nPress any key to close the application..."), &uDummy, NULL);
hReadConsole = GetStdHandle(STD_INPUT_HANDLE);
//wait for key
while (ReadConsoleInput(hReadConsole, &sRecord, 1, &uDummy) && (sRecord.EventType != KEY_EVENT || !sRecord.Event.KeyEvent.bKeyDown))
;
}
//thread handling for Windows
#define THREAD_FUNCTION(threadFunction, pParam) static DWORD __stdcall threadFunction(LPVOID pParam)
int ThreadCreate(LPTHREAD_START_ROUTINE pThreadFunction, void* pParam)
{
DWORD uId;
HANDLE hThread = CreateThread(NULL, 0, pThreadFunction, pParam, 0, &uId);
if (!hThread)
{
char* szErrMsg = GetSysError(GetLastError());
OutputToLog(OUTPUT_ALL, "Creating new thread has failed: %s", szErrMsg);
FreeSysError(szErrMsg);
return 0; //error
}
CloseHandle(hThread);
return 1; //o.k.
}
#else //#ifdef _WIN32
//on other OS create no own console window
static int g_bConsole = 0; //console output enabled?
static FILE* g_pLogFile = NULL; //log file pointer
#define GetSysError(iErrNo) strerror(iErrNo)
#define FreeSysError(szString) //nothing to do
static void OutputToLog(unsigned int uOutputSettingBits, const char* szFormatString, ...)
{
va_list pArgs;
int iLenPrefix;
int iLen;
char szBuf[4096];
//nothing to do?
if ((!g_bConsole || !(uOutputSettingBits&OUTPUT_CONSOLE)) && !g_pLogFile)
return;
//add line break?
if (uOutputSettingBits&OUTPUT_LINE_BREAK)
{
szBuf[0] = '\n';
iLenPrefix = 1;
}
else
iLenPrefix = 0;
if (uOutputSettingBits&OUTPUT_DATE_TIME)
{
//add date/time string
time_t iTime;
struct tm* psTime;
if (time(&iTime) == (time_t)-1)
return; //error
psTime = localtime(&iTime);
if (!psTime) //error?
return;
iLen = snprintf(szBuf + iLenPrefix, sizeof(szBuf) - iLenPrefix, DATE_TIME_FORMAT, psTime->tm_year + 1900, psTime->tm_mon + 1, psTime->tm_mday, psTime->tm_hour, psTime->tm_min, psTime->tm_sec);
if (iLen < 0) //error?
return;
iLenPrefix += iLen;
}
//add log string
va_start(pArgs, szFormatString);
iLen = vsnprintf(szBuf + iLenPrefix, sizeof(szBuf) - iLenPrefix, szFormatString, pArgs);
va_end(pArgs);
if (iLen < 0) //error?
return;
iLen += iLenPrefix;
if (iLen >= sizeof(szBuf)) //truncated? -> make sure to add \0
{
szBuf[sizeof(szBuf) - 1] = '\0';
iLen = sizeof(szBuf) - 1;
}
//output
if (g_bConsole && (uOutputSettingBits&OUTPUT_CONSOLE))
fputs(szBuf, stdout);
if (g_pLogFile)
fwrite(szBuf, 1, iLen, g_pLogFile);
}
static void OpenLogFile(const char* szFilePath, int bAppend)
{
g_pLogFile = fopen(szFilePath, bAppend ? "ab" : "wb");
if (!g_pLogFile)
OutputToLog(OUTPUT_ALL, "Failed to open log file \"%s\": %s", szFilePath, strerror(errno));
else
{
//append and file is not empty?
if (bAppend && ftell(g_pLogFile))
{
//add line breaks for appending
fputs("\n\n", g_pLogFile);
}
setbuf(g_pLogFile, NULL); //disable buffering (no newline needed for actual output)
//output header string in log
OutputToLog(OUTPUT_DATE_TIME, LOG_HEADER);
}
}
static void OpenConsole()
{
if (g_bConsole) //already openend?
return;
g_bConsole = 1;
setbuf(stdout, NULL); //disable buffering (no newline needed for actual output)
printf(APP_STRING);
}
//for OutputFatal we can just use a macro to prefix the parameters
#define OutputFatal OpenConsole(); printf
//thread handling via pthread
#define THREAD_FUNCTION(threadFunction, pParam) static void* threadFunction(void* pParam)
int ThreadCreate(void* (*pThreadFunction)(void*), void* pParam)
{
pthread_t hThread;
int iErrNo = pthread_create(&hThread, NULL, pThreadFunction, pParam);
if (iErrNo)
{
OutputToLog(OUTPUT_ALL, "Creating new thread has failed: error code %d", iErrNo);
return 0; //error
}
pthread_detach(hThread);
return 1; //o.k.
}
#endif //#ifdef _WIN32
//returns the internal length of a socket address (IPv4 / IPv6)
static unsigned int GetAddrLen(const struct sockaddr_storage* psAddr)
{
if (psAddr->ss_family == AF_INET)
return sizeof(struct sockaddr_in);
return sizeof(struct sockaddr_in6);
}
//sends UDP answer
static void SendAnswer(struct SEntry* psEntry)
{
//ignore error here
//UDP?
if (psEntry->uAddrLen != sizeof(SOCKET))
//+2 because DNS on UDP doesn't include the length
sendto(g_hSockUdp, (char*)(psEntry->u16aAnswer + 1), ntohs(*psEntry->u16aAnswer), 0, (struct sockaddr*)&psEntry->client.sAddr, psEntry->uAddrLen);
else
{
//TCP
send(*(SOCKET*)&psEntry->client.hSock, (char*)psEntry->u16aAnswer, ntohs(*psEntry->u16aAnswer) + 2, 0);
closesocket(psEntry->client.hSock);
}
}
//searches for an entry in the cache list and removes it - also closes a socket and outputs an error message
static void RemoveEntry(struct SEntry* psEntry, SOCKET hSock, int bUseCriticalSection)
{
struct SEntry** ppsPrev;
struct SEntry* psEntry2;
//close the socket created by the caller
if (hSock != SOCKET_ERROR)
closesocket(hSock);
if (bUseCriticalSection)
EnterCriticalSection(&g_sCritSect);
ppsPrev = &g_psFirst;
for (psEntry2 = g_psFirst; psEntry2; psEntry2 = psEntry2->psNext)
{
//found entry?
if (psEntry == psEntry2)
{
//remove entry from list
*ppsPrev = psEntry->psNext;
--g_uCacheCount;
break;
}
ppsPrev = &psEntry2->psNext;
}
//free the entry
free(psEntry->u16aAnswer); //should be NULL anyway
//close socket in case of TCP
if (psEntry->uAddrLen == sizeof(SOCKET))
closesocket(psEntry->client.hSock);
free(psEntry);
if (bUseCriticalSection)
LeaveCriticalSection(&g_sCritSect);
}
static int InvalidEntryErrorOutput()
{
OutputToLog(OUTPUT_ALL, "Invalid DNS answer detected while calculating TTL");
return 0; //mark as expired for CalculateTimeToLive
}
//updates the time to live fields of an entry and checks for expiration (returns 0 if expired)
static int CalculateTimeToLive(struct SEntry* psEntry)
{
time_t iCurTime;
int32_t i32TimeOffset;
int32_t i32TimeToLive;
uint16_t u16ContentLen;
uint16_t u16AmountQuestions;
uint16_t u16Len;
uint8_t* pu8Pos;
uint8_t* pu8AnswerEnd;
uint8_t u8NameLen;
if (psEntry->iTime == (time_t)-1)
return 1; //getting time failed last time; without a working timer we ignore time to live stuff completely
u16Len = ntohs(*psEntry->u16aAnswer);
if (u16Len <= 12)
return InvalidEntryErrorOutput(); //answer has no useful information; mark as expired
pu8Pos = (uint8_t*)psEntry->u16aAnswer + 2;
pu8AnswerEnd = pu8Pos + u16Len;
u16AmountQuestions = ntohs(((uint16_t*)pu8Pos)[2]);
pu8Pos += 12; //go behind header
//ignore questions
for (; u16AmountQuestions; --u16AmountQuestions)
{
//ignore name
for (;;)
{
if (pu8Pos >= pu8AnswerEnd)
return InvalidEntryErrorOutput(); //failed; mark as expired
u8NameLen = *pu8Pos;
if (!u8NameLen)
break; //end of name
if (u8NameLen >= 0xc0) //compression used? (reference to other name via offset)
{
++pu8Pos; //ignore 2nd part of offset
break;
}
pu8Pos += u8NameLen + 1;
}
pu8Pos += 5; //ignore type and class
}
//calculate amount of seconds since last delivery
if (time(&iCurTime) == (time_t)-1)
return 1; //error, can't get current time -> ignore time to live stuff completely
i32TimeOffset = (int32_t)(iCurTime - psEntry->iTime);
psEntry->iTime = iCurTime; //store current time for next delivery
//for all records
do
{
//ignore name of resource record
for (;;)
{
if (pu8Pos >= pu8AnswerEnd)
return InvalidEntryErrorOutput(); //failed; mark as expired
u8NameLen = *pu8Pos;
if (!u8NameLen)
break; //end of name
if (u8NameLen >= 0xc0) //compression used? (reference to other name via offset)
{
++pu8Pos; //ignore 2nd part of offset
break;
}
pu8Pos += u8NameLen + 1;
}
pu8Pos += 5; //ignore type and class
if (pu8Pos > pu8AnswerEnd - 4)
return InvalidEntryErrorOutput(); //failed; mark as expired
//check time to live field (0 means "omitted")
i32TimeToLive = ntohl(*(uint32_t*)pu8Pos);
if (i32TimeToLive > 0)
{
i32TimeToLive -= i32TimeOffset;
if (i32TimeToLive <= 0)
return 0; //expired
*(uint32_t*)pu8Pos = htonl(i32TimeToLive); //update field
}
else if (i32TimeToLive < 0)
return 0; //failed, TTL must be positive; mark as expired, however: no error output in this case
//ignore record content
if (pu8Pos > pu8AnswerEnd - 6)
return InvalidEntryErrorOutput(); //failed; mark as expired
u16ContentLen = ntohs(*(uint16_t*)(pu8Pos + 4));
pu8Pos += 6 + u16ContentLen;
if (pu8Pos > pu8AnswerEnd)
return InvalidEntryErrorOutput(); //failed; mark as expired
} while (pu8Pos < pu8AnswerEnd);
return 1; //succeeded, not expired
}
//receives a specific amount of bytes
static int ReceiveBytes(SOCKET hSock, unsigned int uAmount, uint16_t* u16aBuf)
{
unsigned int uPos = 0;
int iLen;
char* szErrMsg;
for (;;)
{
iLen = recv(hSock, (char*)u16aBuf + uPos, uAmount, 0);
switch (iLen)
{
case SOCKET_ERROR:
szErrMsg = GetSysError(WSAGetLastError());
OutputToLog(OUTPUT_ALL, "Receiving from SOCKS server has failed: %s", szErrMsg);
FreeSysError(szErrMsg);
return 0; //failed
case 0:
OutputToLog(OUTPUT_ALL, "The SOCKS server has closed the connection unexpectedly");
return 0; //failed
default:
uAmount -= iLen;
if (!uAmount)
return 1; //succeeded
uPos += iLen;
}
}
}
//sends CONNECT command to HTTP proxy and checks answer
static int HandleHttpProxy(SOCKET hSock, char* caBuf)
{
char* szErrMsg;
char* szPosEnd;
const char* szPosStatus;
int iRet;
int iPos;
iRet = send(hSock, g_caHttpProxyConnect, g_iHttpProxyConnectLen, 0);
if (iRet != g_iHttpProxyConnectLen)
{
szErrMsg = (iRet == SOCKET_ERROR) ? GetSysError(WSAGetLastError()) : "Invalid amount of sent bytes";
OutputToLog(OUTPUT_ALL, "Sending to HTTP proxy has failed: %s", szErrMsg);
if (iRet == SOCKET_ERROR)
FreeSysError(szErrMsg);
return 0; //error
}
//receive answer
iPos = 0;
for (;;)
{
iRet = recv(hSock, caBuf + iPos, 2000 - iPos, 0);
if (iRet <= 0)
{
if (iRet == SOCKET_ERROR)
OutputToLog(OUTPUT_ALL, "The HTTP proxy has closed the connection unexpectedly");
else
{
szErrMsg = GetSysError(WSAGetLastError());
OutputToLog(OUTPUT_ALL, "Receiving from HTTP proxy has failed: %s", szErrMsg);
FreeSysError(szErrMsg);
}
return 0; //error
}
iPos += iRet;
if (iPos < 4)
continue; //continue receiving
//check header, must begin with HTTP
if (caBuf[0] == 'H' || caBuf[1] == 'T' || caBuf[2] == 'T' || caBuf[3] == 'P')
{
caBuf[iPos] = '\0'; //terminate the string
//try to find empty line that marks the end of the HTTP proxy answer
szPosEnd = strstr(caBuf, "\r\n\r\n");
if (!szPosEnd)
continue; //continue receiving
//extract status code -> scan for space character (also stops on any control character)
szPosStatus = caBuf + 4;
while (*(unsigned char*)szPosStatus > ' ')
++szPosStatus;
if (*szPosStatus == ' ')
{
//we want: 200 Connection established
if (atoi(++szPosStatus) == 200)
break; //header reception complete
//find end of line (must be there, otherwise upper search for empty line would have failed
szPosEnd = strchr(szPosStatus, '\r');
*szPosEnd = '\0';
OutputToLog(OUTPUT_ALL, "Connecting DNS server has failed: %s", szPosStatus);
return 0; //error
}
}
OutputToLog(OUTPUT_ALL, "Invalid answer from HTTP proxy");
return 0; //error
}
//so far there shouldn't be an answer from the DNS server (nothing after \r\n\r\n)
if (szPosEnd[4])
{
OutputToLog(OUTPUT_ALL, "DNS server answered before request");
return 0; //error
}
return 1; //o.k.
}
//thread for connecting the SOCKS server and resolving the DNS request
THREAD_FUNCTION(DnsThread, pEntry)
{
uint16_t u16aBuf[32754]; //max UDP packet length on Windows plus one byte - using uint16_t here for alignment
struct SEntry* psEntry = (struct SEntry*)pEntry;
char* szErrMsg;
SOCKET hSock = socket(g_sSocksAddr.ss_family, SOCK_STREAM, IPPROTO_TCP);
int iRet;
int iPos;
int iLen;
if (hSock == SOCKET_ERROR)
{
szErrMsg = GetSysError(WSAGetLastError());
OutputToLog(OUTPUT_ALL, "Creating a TCP socket has failed: %s", szErrMsg);
FreeSysError(szErrMsg);
RemoveEntry(psEntry, hSock, g_bCacheEnabled);
return 0;
}
//connect SOCKS server or HTTP proxy
if (connect(hSock, (struct sockaddr*)&g_sSocksAddr, GetAddrLen(&g_sSocksAddr)) == SOCKET_ERROR)
{
szErrMsg = GetSysError(WSAGetLastError());
OutputToLog(OUTPUT_ALL, "Connecting the SOCKS server has failed: %s", szErrMsg);
FreeSysError(szErrMsg);
RemoveEntry(psEntry, hSock, g_bCacheEnabled);
return 0;
}
//using HTTP proxy instead of SOCKS?
if (g_iHttpProxyConnectLen)
{
if (!HandleHttpProxy(hSock, (char*)u16aBuf))
{
RemoveEntry(psEntry, hSock, g_bCacheEnabled);
return 0;
}
}
else
{
((uint8_t*)u16aBuf)[0] = 5; //version 5 as we use SOCKS5
((uint8_t*)u16aBuf)[1] = 1; //number of authentication methods supported
((uint8_t*)u16aBuf)[2] = g_uaUsrPwd ? 2 : 0; //user/password authentication or no authentication
iLen = send(hSock, (const char*)u16aBuf, 3, 0);
if (iLen != 3)
{
szErrMsg = (iLen == SOCKET_ERROR) ? GetSysError(WSAGetLastError()) : "Invalid amount of sent bytes";
OutputToLog(OUTPUT_ALL, "Sending to SOCKS server has failed: %s", szErrMsg);
if (iLen == SOCKET_ERROR)
FreeSysError(szErrMsg);
RemoveEntry(psEntry, hSock, g_bCacheEnabled);
return 0;
}
//check respons
if (!ReceiveBytes(hSock, 2, u16aBuf + 8))
{
RemoveEntry(psEntry, hSock, g_bCacheEnabled);
return 0;
}
if (((uint8_t*)u16aBuf)[16] != 5 || ((uint8_t*)u16aBuf)[17] != ((uint8_t*)u16aBuf)[2])
{
if (((uint8_t*)u16aBuf)[16] != 5)
OutputToLog(OUTPUT_ALL, "The SOCKS server has answered with a SOCKS version number unequal to 5");
else if (g_uaUsrPwd)
OutputToLog(OUTPUT_ALL, "The SOCKS server does not support user/password authentication");
else
OutputToLog(OUTPUT_ALL, "The SOCKS server wants an authentication");
RemoveEntry(psEntry, hSock, g_bCacheEnabled);
return 0;
}
//send authentication if enabled
if (g_uaUsrPwd)
{
iLen = send(hSock, (const char*)g_uaUsrPwd, g_iUsrPwdLen, 0);
if (iLen != g_iUsrPwdLen)
{
szErrMsg = (iLen == SOCKET_ERROR) ? GetSysError(WSAGetLastError()) : "Invalid amount of sent bytes";
OutputToLog(OUTPUT_ALL, "Sending to SOCKS server has failed: %s", szErrMsg);
if (iLen == SOCKET_ERROR)
FreeSysError(szErrMsg);
RemoveEntry(psEntry, hSock, g_bCacheEnabled);
return 0;
}
//check response
if (!ReceiveBytes(hSock, 2, u16aBuf + 8))
{
RemoveEntry(psEntry, hSock, g_bCacheEnabled);
return 0;
}
if (((uint8_t*)u16aBuf)[17]) //2nd byte of answer must be 0 for "success"
{
OutputToLog(OUTPUT_ALL, "The SOCKS server authentication has failed (error code %u)", (unsigned int)((uint8_t*)u16aBuf)[17]);
RemoveEntry(psEntry, hSock, g_bCacheEnabled);
return 0;
}
}
//connect DNS server via SOCKS, the DNS server must support TCP
((uint8_t*)u16aBuf)[1] = 1; //establish a TCP/IP stream connection
((uint8_t*)u16aBuf)[2] = 0; //reserved, must be 0x00
switch (g_sDnsSrvAddr.ss_family)
{
case AF_UNSPEC: //use name
((uint8_t*)u16aBuf)[3] = 3; //name
iLen = (int)((struct sockaddr_in6*)&g_sDnsSrvAddr)->sin6_flowinfo; //length in sin6_flowinfo (see ParseIpAndPort)
((uint8_t*)u16aBuf)[4] = (uint8_t)iLen; //maximum length is 255
memcpy(((uint8_t*)u16aBuf) + 5, *(char**)&((struct sockaddr_in6*)&g_sDnsSrvAddr)->sin6_addr, iLen); //copy name (see ParseIpAndPort)
*(uint16_t*)(((uint8_t*)u16aBuf) + iLen + 5) = ((struct sockaddr_in6*)&g_sDnsSrvAddr)->sin6_port; //port
iPos = iLen + 7;
break;
case AF_INET: //use IPv4
((uint8_t*)u16aBuf)[3] = 1; //IPv4 address
*(uint32_t*)(u16aBuf + 2) = ((struct sockaddr_in*)&g_sDnsSrvAddr)->sin_addr.s_addr; //address
*(uint16_t*)(u16aBuf + 4) = ((struct sockaddr_in*)&g_sDnsSrvAddr)->sin_port; //port
iPos = 10;
break;
default: //use IPv6
((uint8_t*)u16aBuf)[3] = 4; //IPv6 address
memcpy(u16aBuf + 2, &((struct sockaddr_in6*)&g_sDnsSrvAddr)->sin6_addr, 16); //address
*(uint16_t*)(u16aBuf + 10) = ((struct sockaddr_in6*)&g_sDnsSrvAddr)->sin6_port; //port
iPos = 22;
}
iLen = send(hSock, (const char*)u16aBuf, iPos, 0);
if (iLen != iPos)
{
szErrMsg = (iLen == SOCKET_ERROR) ? GetSysError(WSAGetLastError()) : "Invalid amount of sent bytes";
OutputToLog(OUTPUT_ALL, "Connecting through SOCKS server has failed: %s", szErrMsg);
if (iLen == SOCKET_ERROR)
FreeSysError(szErrMsg);
RemoveEntry(psEntry, hSock, g_bCacheEnabled);
return 0;
}
//check expected answer (get first 5 bytes to detect address type)
if (!ReceiveBytes(hSock, 5, u16aBuf))
{
RemoveEntry(psEntry, hSock, g_bCacheEnabled);
return 0;
}
if (((uint8_t*)u16aBuf)[0] != 5 || ((uint8_t*)u16aBuf)[1] != 0 || (((uint8_t*)u16aBuf)[3] != 1 && ((uint8_t*)u16aBuf)[3] != 3 && ((uint8_t*)u16aBuf)[3] != 4))
{
szErrMsg = "Unexpected answer from SOCKS server";
//correct version -> try to resolve the error code
if (((uint8_t*)u16aBuf)[0] == 5)
switch (((uint8_t*)u16aBuf)[1])
{
case 2:
szErrMsg = "Connection not allowed by ruleset";
break;
case 3:
szErrMsg = "Network unreachable";
break;
case 4:
szErrMsg = "Host unreachable";
break;
case 5:
szErrMsg = "Connection refused by destination host";
break;
case 6:
szErrMsg = "TTL expired";
break;
case 7:
szErrMsg = "Command not supported / protocol error";
break;
case 8:
szErrMsg = "Address type not supported";
}
OutputToLog(OUTPUT_ALL, "Connecting through SOCKS server has failed: %s", szErrMsg);
RemoveEntry(psEntry, hSock, g_bCacheEnabled);
return 0;
}
//get rest of answer
//all bytes after that are part of the "normal" communication
switch (((uint8_t*)u16aBuf)[3])
{
case 1: //IPv4
iLen = 5;
break;
case 4: //IPv6
iLen = 17;
break;
default: //name
iLen = 2 + ((uint8_t*)u16aBuf)[4]; //port length plus length of name
}
if (!ReceiveBytes(hSock, iLen, u16aBuf))
{
RemoveEntry(psEntry, hSock, g_bCacheEnabled);
return 0;
}
}
iPos = 2 + ntohs(*psEntry->u16aRequest);
//send DNS request via SOCKS
iLen = send(hSock, (const char*)psEntry->u16aRequest, iPos, 0);
if (iLen != iPos)
{
szErrMsg = (iLen == SOCKET_ERROR) ? GetSysError(WSAGetLastError()) : "Invalid amount of sent bytes";
OutputToLog(OUTPUT_ALL, "Sending through SOCKS server has failed: %s", szErrMsg);
if (iLen == SOCKET_ERROR)
FreeSysError(szErrMsg);
RemoveEntry(psEntry, hSock, g_bCacheEnabled);
return 0;
}
//receive answer
iPos = 0;
for (;;)
{
iRet = recv(hSock, (char*)u16aBuf + iPos, sizeof(u16aBuf) - iPos, 0);
if (iRet <= 0)
{
szErrMsg = (iRet == SOCKET_ERROR) ? GetSysError(WSAGetLastError()) : "Server has closed the connection unexpectedly";
OutputToLog(OUTPUT_ALL, "Broken answer from DNS server: %s", szErrMsg);
if (iRet == SOCKET_ERROR)
FreeSysError(szErrMsg);
RemoveEntry(psEntry, hSock, g_bCacheEnabled);
return 0;
}
iPos += iRet;
//first 2 bytes contain length (Big Endian)
if (iPos >= 2)
{
iLen = 2 + ntohs(*u16aBuf);
if (iPos >= iLen)
break; //answer completely received
}
//answer too long?
if (iPos >= sizeof(u16aBuf))
{
OutputToLog(OUTPUT_ALL, "Answer from DNS server too long!");
RemoveEntry(psEntry, hSock, g_bCacheEnabled);
return 0;
}
}
//invalid answer?
if (iPos <= 4)
{
OutputToLog(OUTPUT_ALL, "Answer from DNS server too short!");
RemoveEntry(psEntry, hSock, g_bCacheEnabled);
return 0;
}
closesocket(hSock);
if (g_bCacheEnabled)
{
//store answer in cache
EnterCriticalSection(&g_sCritSect);
psEntry->u16aAnswer = (uint16_t*)malloc(iLen);
memcpy(psEntry->u16aAnswer, u16aBuf, iLen);
//copy ID
psEntry->u16aAnswer[1] = psEntry->u16aRequest[1];
//remember current time for time to live calculations
psEntry->iTime = time(NULL);
//send DNS answer to original requesting client via UDP or TCP
SendAnswer(psEntry);
LeaveCriticalSection(&g_sCritSect);
}
else
{
//send DNS answer to original requesting client via UDP or TCP
psEntry->u16aAnswer = u16aBuf;
SendAnswer(psEntry);
free(psEntry);
}
return 0;
}
//searches the cache for the same request and sends the answer if there is a cache hit
//or creates a thread for forwarding the request to the DNS server via SOCKS
static void HandleDnsRequest(uint16_t* u16aRequest, int iLen, void* pClientAddr, socklen_t iAddrLen)
{
uint8_t* pu8Pos;
uint8_t* pu8End;
struct SEntry* psEntry;
unsigned char uLen;
//search in cache
EnterCriticalSection(&g_sCritSect);
for (psEntry = g_psFirst; ; psEntry = psEntry->psNext)
{
if (!psEntry)
{
//create new entry (length of struct SEntry up to u16aRequest plus request length plus 2 for length)
psEntry = (struct SEntry*)malloc(((uint8_t*)psEntry->u16aRequest - (uint8_t*)psEntry) + iLen + 2);
psEntry->iTime = (time_t)-1;
psEntry->u16aAnswer = NULL;
psEntry->uAddrLen = (unsigned char)iAddrLen;
memcpy(&psEntry->client, pClientAddr, iAddrLen);
*psEntry->u16aRequest = htons((uint16_t)iLen);
memcpy(psEntry->u16aRequest + 1, u16aRequest, iLen);
//add entry to cache list in case cache is enabled
psEntry->psNext = g_psFirst;
if (g_bCacheEnabled)
g_psFirst = psEntry;
//create thread to resolve entry
if (ThreadCreate(DnsThread, psEntry))
{
++g_uCacheCount;
//output amount of entries and current entry
pu8Pos = (uint8_t*)u16aRequest + 12;
pu8End = (uint8_t*)u16aRequest + iLen;
while (pu8Pos < pu8End)
{
uLen = *pu8Pos;
if (!uLen)
{
OutputToLog(OUTPUT_ALL, "%3u %s", g_uCacheCount, (char*)((uint8_t*)u16aRequest + 13));
break;
}
if (uLen >= 0xc0) //compression used? (reference to other name via offset)
break; //no output in this case
*pu8Pos = '.'; //replace length by .
pu8Pos += uLen + 1;
}
}
else
{
//remove entry from cache list
g_psFirst = psEntry->psNext;
free(psEntry);
}
break;
}
//cache hit? (do not compare ID in first 2 bytes of request)
if ((uint16_t)iLen == ntohs(*psEntry->u16aRequest) && memcmp(u16aRequest + 1, psEntry->u16aRequest + 2, iLen - 2) == 0)
{
//answer already received?
if (psEntry->u16aAnswer)
{
//answer to current address
psEntry->uAddrLen = (unsigned char)iAddrLen;
memcpy(&psEntry->client, pClientAddr, iAddrLen);
//check if expired
if (!CalculateTimeToLive(psEntry))
{
//expired -> kill last answer
free(psEntry->u16aAnswer);
psEntry->u16aAnswer = NULL;
//copy current ID
psEntry->u16aRequest[1] = *u16aRequest;
//create thread to resolve request again
if (!ThreadCreate(DnsThread, psEntry))
RemoveEntry(psEntry, (SOCKET)SOCKET_ERROR, 0);
}
else
{
//use current ID
psEntry->u16aAnswer[1] = *u16aRequest;
SendAnswer(psEntry);
}
}
else
{
//copy current ID so the thread uses that one if it gets the answer
psEntry->u16aRequest[1] = *u16aRequest;
//overwrite address; currently we can only handle one request address while waiting for an answer through SOCKS
//current address is TCP? -> need to close it before overwriting it
if (psEntry->uAddrLen == sizeof(SOCKET))
closesocket(psEntry->client.hSock);
psEntry->uAddrLen = (unsigned char)iAddrLen;
memcpy(&psEntry->client, pClientAddr, iAddrLen);
}
break;
}
}
LeaveCriticalSection(&g_sCritSect);
}
//outputs an error caused by "bind" and closes the according socket
static void OutputBindError(SOCKET hSock, struct sockaddr_storage* psAddr, int bUdp)
{
char szAddr[256];
char szNo[16];
char* szErrMsg = GetSysError(WSAGetLastError());
closesocket(hSock);
if (getnameinfo((struct sockaddr*)psAddr, GetAddrLen(psAddr), szAddr, sizeof(szAddr), szNo, sizeof(szNo), NI_NUMERICHOST | NI_NUMERICSERV))
{
//should never happen
strcpy(szAddr, "unknown address");
strcpy(szNo, "unknown");
}
//UDP is mandatory, TCP is optional
if (bUdp)
{
//need { ... } on *nix as OutputFatal is a multi-line macro there
OutputFatal("\nBinding on %s, UDP port %s has failed: %s\n", szAddr, szNo, szErrMsg);
}
else
OutputToLog(OUTPUT_ALL, "Binding on %s, TCP port %s has failed: %s", szAddr, szNo, szErrMsg);
FreeSysError(szErrMsg);
}
//thread for receiving DNS requests via TCP
THREAD_FUNCTION(TcpThread, pAddr)
{
SOCKET hSockServer;
SOCKET hSock;
uint16_t u16aBuf[32769]; //maximum possible DNS request size plus one byte - using uint16_t here for alignment; the actual size is stored in the first 2 bytes which can have a maximum value of 0xffff
socklen_t iAddrLen;
int iCurBufLen;
int iLen;
uint16_t u16ReqLen;
struct sockaddr_storage sAddr;
char* szErrMsg;
hSockServer = socket(((struct sockaddr_storage*)pAddr)->ss_family, SOCK_STREAM, IPPROTO_TCP);
if (hSockServer == SOCKET_ERROR)
{
szErrMsg = GetSysError(WSAGetLastError());
OutputToLog(OUTPUT_ALL, "Creating a TCP socket has failed: %s", szErrMsg);
FreeSysError(szErrMsg);
return 0;
}
//bind+listen on local TCP port (get DNS requests)
if (bind(hSockServer, (struct sockaddr*)pAddr, GetAddrLen((struct sockaddr_storage*)pAddr)) == SOCKET_ERROR)
{
OutputBindError(hSockServer, (struct sockaddr_storage*)pAddr, 0);
return 0;
}
if (listen(hSockServer, 5) == SOCKET_ERROR)
{
szErrMsg = GetSysError(WSAGetLastError());
closesocket(hSockServer);
OutputToLog(OUTPUT_ALL, "Listening on TCP socket has failed: %s", szErrMsg);
FreeSysError(szErrMsg);
return 0;
}
//as long as "accept" is working
for (;;)
{
iAddrLen = sizeof(sAddr);
hSock = accept(hSockServer, (struct sockaddr*)&sAddr, &iAddrLen);
if (hSock == SOCKET_ERROR)
{
szErrMsg = GetSysError(WSAGetLastError());
OutputToLog(OUTPUT_ALL, "Accepting new connection on TCP socket has failed: %s", szErrMsg);
FreeSysError(szErrMsg);
break;
}
//collect the whole DNS request
iCurBufLen = 0;
for (;;)
{
iLen = recv(hSock, (char*)u16aBuf + iCurBufLen, sizeof(u16aBuf) - iCurBufLen, 0);
if (iLen <= 0)
{
szErrMsg = GetSysError(WSAGetLastError());
closesocket(hSock);
OutputToLog(OUTPUT_ALL, "DNS request on TCP broken: %s", szErrMsg);
FreeSysError(szErrMsg);
break;
}
iCurBufLen += iLen;
//got the whole DNS request?
if (iCurBufLen >= 2 && (u16ReqLen = ntohs(*u16aBuf)) + 2 >= iCurBufLen)
{
if (u16ReqLen > 12) //12 bytes header plus at least one byte of data
HandleDnsRequest(u16aBuf + 1, u16ReqLen, &hSock, sizeof(hSock)); //HandleDnsRequest takes care of hSock now
else
closesocket(hSock);
break;
}
}
}
closesocket(hSockServer);
return 0;
}
//parses a command line parameter of the format IPv4 or IPv4:port or IPv6 or [IPv6]:port
static int ParseIpAndPort(int iFlag, const char* szParamName, const char* szPort, char* szIpAndPort, struct sockaddr_storage* psAddr)
{
struct addrinfo sHint;
struct addrinfo* psResult;
char* szPos;
int iRet;
if (strchr(szIpAndPort, '.'))
{
//seems to be IPv4
szPos = strchr(szIpAndPort, ':');
if (szPos)
{
*szPos = '\0'; //overwrite ':' for getaddrinfo below
szPort = szPos + 1;
}
}
else
{
//seems to be IPv6
//format [IPv6]:port?
if (*szIpAndPort == '[')
{
++szIpAndPort;
szPos = strchr(szIpAndPort, ']');
if (szPos)
{
*szPos = '\0'; //overwrite ']' for getaddrinfo below
//is there a port specification?
if (szPos[1] == ':')
szPort = szPos + 2;
}
}
}
//prepare hint: only numeric values
memset(&sHint, 0, sizeof(sHint));
sHint.ai_family = AF_UNSPEC;
sHint.ai_flags = iFlag | AI_NUMERICHOST | AI_NUMERICSERV;
//now resolve it
iRet = getaddrinfo(szIpAndPort, szPort, &sHint, &psResult);
if (iRet)
{
//some getaddrinfo implementations seem to have some trouble, so try the old IPv4 variant additionally
#ifdef _WIN32
InetPton(AF_INET, szIpAndPort, &((struct sockaddr_in*)psAddr)->sin_addr.s_addr);
#else
((struct sockaddr_in*)psAddr)->sin_addr.s_addr = inet_addr(szIpAndPort);
#endif
if (INADDR_NONE != ((struct sockaddr_in*)psAddr)->sin_addr.s_addr)
{
((struct sockaddr_in*)psAddr)->sin_port = htons((uint16_t)atoi(szPort));
if (((struct sockaddr_in*)psAddr)->sin_port)
{
((struct sockaddr_in*)psAddr)->sin_family = AF_INET;
return 1; //o.k.
}
}
//only for the DNS server also support name
if (&g_sDnsSrvAddr == psAddr)
{
size_t uLen = strlen(szIpAndPort);
if (uLen < 256 && uLen)
{
((struct sockaddr_in6*)&g_sDnsSrvAddr)->sin6_port = htons((uint16_t)atoi(szPort));
if (((struct sockaddr_in6*)&g_sDnsSrvAddr)->sin6_port)
{
g_sDnsSrvAddr.ss_family = AF_UNSPEC; //this marks usage of name
*(char**)&((struct sockaddr_in6*)&g_sDnsSrvAddr)->sin6_addr = szIpAndPort; //use sin6_addr for pointer to name (128 bit -> large enough, alignment should also be fine)
((struct sockaddr_in6*)&g_sDnsSrvAddr)->sin6_flowinfo = (uint8_t)uLen; //use sin6_flowinfo for length
return 1; //o.k.
}
}
}
OutputFatal("\nInvalid address '%s' and port '%s' specified for %s!\n", szIpAndPort, szPort, szParamName);
return 0; //error
}
if (psResult->ai_addrlen > sizeof(*psAddr))
{
//should never happen
OutputFatal("\nAddress '%s' and port '%s' specified for %s too long for internal storage!\n", szIpAndPort, szPort, szParamName);
return 0; //error
}
//copy 1st result
memcpy(psAddr, psResult->ai_addr, psResult->ai_addrlen);
freeaddrinfo(psResult);
return 1; //o.k.
}
//creates CONNECT command for HTTP proxy containing DNS address
static int CreateHttpProxyConnectCommand()
{
memcpy(g_caHttpProxyConnect, "CONNECT ", 8);
g_iHttpProxyConnectLen = 8;
if (g_sDnsSrvAddr.ss_family == AF_UNSPEC)
{
//sin6_addr contains pointer to name, see ParseIpAndPort (max. length is 255)
int iLenDnsAddr = sprintf(g_caHttpProxyConnect + g_iHttpProxyConnectLen, "%s:%u", *(char**)&((struct sockaddr_in6*)&g_sDnsSrvAddr)->sin6_addr, ntohs(((struct sockaddr_in6*)&g_sDnsSrvAddr)->sin6_port));
if (iLenDnsAddr <= 0)
return 0; //error
g_iHttpProxyConnectLen += iLenDnsAddr;
}
else
{
//add IP and port to g_caHttpProxyConnect
char szPort[6];
int iLenPort;
if (g_sDnsSrvAddr.ss_family == AF_INET6)
g_caHttpProxyConnect[g_iHttpProxyConnectLen++] = '['; //enclose with [] for IPv6
if (getnameinfo((struct sockaddr*)&g_sDnsSrvAddr, GetAddrLen(&g_sDnsSrvAddr), g_caHttpProxyConnect + g_iHttpProxyConnectLen, 128, szPort, sizeof(szPort), NI_NUMERICHOST | NI_NUMERICSERV))
return 0; //error
g_iHttpProxyConnectLen += (int)strlen(g_caHttpProxyConnect + g_iHttpProxyConnectLen);
if (g_sDnsSrvAddr.ss_family == AF_INET6)
g_caHttpProxyConnect[g_iHttpProxyConnectLen++] = ']'; //enclose with [] for IPv6
g_caHttpProxyConnect[g_iHttpProxyConnectLen++] = ':';
iLenPort = (int)strlen(szPort);
memcpy(g_caHttpProxyConnect + g_iHttpProxyConnectLen, szPort, iLenPort);
g_iHttpProxyConnectLen += iLenPort;
}
//complete command
memcpy(g_caHttpProxyConnect + g_iHttpProxyConnectLen, " HTTP/1.0\r\n\r\n", 13);
g_iHttpProxyConnectLen += 13;
return 1; //o.k.
}
int main(int iArgCount, char** szaArgs)
{
static struct sockaddr_storage sAddr; //make it static so the lower array assignment causes no compiler warning
const char* szUser;
const char* szPassword;
char** pszCurArg;
char* szCurArg;
char* szLogFilePath;
char* szErrMsg;
size_t uUserLen;
size_t uPasswordLen;
socklen_t iAddrLen;
int iAddrCount;
int iLen;
int bAppend; //append log file?
int bQuiet; //parameter q specified?
uint16_t u16aBuf[32754]; //max UDP packet length on Windows plus one byte - using uint16_t here for alignment
//struct array for the three addresses passed via command line
struct SAddr
{
struct sockaddr_storage* psAddr;
const char* szDefaultAddress;
const char* szDefaultPort;
const char* szName;
int iFlag;
} saAddresses[3] =
{
{ &g_sSocksAddr, DEFAULT_SOCKS_SERVER, DEFAULT_SOCKS_PORT, "SOCKS server", 0 },
{ &g_sDnsSrvAddr, DEFAULT_DNS_SERVER, DEFAULT_DNS_PORT, "DNS server", 0 },
{ &sAddr, DEFAULT_LISTEN_IP, DEFAULT_LISTEN_PORT, "listening", AI_PASSIVE } //AI_PASSIVE for "getaddrinfo" as we use it for "bind"
};
//parse command line - use e.g. "/?" to display the usage
bQuiet = 0;
bAppend = 0;
iAddrCount = 0;
szLogFilePath = NULL;
szUser = NULL;
szPassword = NULL;
for (pszCurArg = szaArgs + 1; --iArgCount; ++pszCurArg)
{
szCurArg = *pszCurArg;
//no address parameter?
if (*szCurArg == '-' || *szCurArg == '/')
{
switch (szCurArg[1])
{
case 'd': //disable cache?
case 'D':
if (!szCurArg[2])
{
g_bCacheEnabled = 0;
continue; //correct parameter, go to next one
}
break;
case 'q': //no console output?
case 'Q':
if (!szCurArg[2])
{
bQuiet = 1;
continue; //correct parameter, go to next one
}
break;
case 'l': //log output?
case 'L':
if (!szLogFilePath) //only allowed once
{
bAppend = (szCurArg[2] == 'a' || szCurArg[2] == 'A'); //append?
if (szCurArg[2 + bAppend] == ':')
{
szLogFilePath = szCurArg + 3 + bAppend;
continue; //correct parameter, go to next one
}
}
break;
case 'u': //user?
case 'U':
if (!szUser && szCurArg[2] == ':') //only allowed once and : must be 2nd char
{
szUser = szCurArg + 3;
continue;
}
break;
case 'p': //password?
case 'P':
if (!szPassword && szCurArg[2] == ':') //only allowed once and : must be 2nd char
{
szPassword = szCurArg + 3;
continue;
}
break;
case 't': //HTTP proxy?
case 'T':
g_iHttpProxyConnectLen = 1; //used as boolean here; later it contains the real length of the CONNECT command
continue;
}
}
else
{
//try to parse address
if (iAddrCount < sizeof(saAddresses) / sizeof(*saAddresses))
{
if (!ParseIpAndPort(saAddresses[iAddrCount].iFlag, saAddresses[iAddrCount].szName, saAddresses[iAddrCount].szDefaultPort, szCurArg, saAddresses[iAddrCount].psAddr))
return 1;
++iAddrCount;
continue; //correct parameter, go to next one
}
}
//either correct help request or unknown parameter -> display usage and stop
OutputFatal("\nDNS2SOCKS tunnels DNS requests via SOCKS5 and caches the answers.\n\n\n"
"Usage:\n\n"
"DNS2PROXY [/?] [/t] [/d] [/q] [/l[a]:FilePath] [/u:User /p:Password]\n"
" [Socks5ServerIP[:Port]] [DNSServerIPorName[:Port]] [ListenIP[:Port]]\n\n"
"/? to view this help\n"
"/t to use a HTTP proxy instead of a SOCKS server\n"
" (here: Socks5ServerIP = HttpProxyIP, no support for /u and /p)\n"
"/d to disable the cache\n"
"/q to suppress the text output\n"
"/l:FilePath to create a new log file \"FilePath\"\n"
"/la:FilePath to create a new log file or append to the existing \"FilePath\"\n"
"/u:User user name if your SOCKS server uses user/password authentication\n"
"/p:Password password if your SOCKS server uses user/password authentication\n\n"
"Default Socks5ServerIP:Port = %s:%s\n"
"Default DNSServerIPorName:Port = %s:%s\n"
"Default ListenIP:Port = %s:%s\n",
DEFAULT_SOCKS_SERVER, DEFAULT_SOCKS_PORT,
DEFAULT_DNS_SERVER, DEFAULT_DNS_PORT,
DEFAULT_LISTEN_IP, DEFAULT_LISTEN_PORT);
return 1;
}
if (szPassword && !szUser)
{
OutputFatal("\nPassword specified but no user!\n");
return 1;
}
if (!szPassword && szUser)
{
OutputFatal("\nUser specified but no password!\n");
return 1;
}
if (g_iHttpProxyConnectLen && szPassword)
{
OutputFatal("\nAuthentication not supported for HTTP proxy!\n");
return 1;
}
if (szUser)
{
uUserLen = strlen(szUser);
if (uUserLen > 255)
{
OutputFatal("\nUser exceeds 255 characters!\n");
return 1;
}
uPasswordLen = strlen(szPassword);
if (uPasswordLen > 255)
{
OutputFatal("\nPassword exceeds 255 characters!\n");
return 1;
}
}
else
{
//initialize uUserLen and uPasswordLen - otherwise VC++ 2010 outputs a wrong warning
uUserLen = 0;
uPasswordLen = 0;
}
//fill unspecified addresses with default values
while (iAddrCount < sizeof(saAddresses) / sizeof(*saAddresses))
{
if (!ParseIpAndPort(saAddresses[iAddrCount].iFlag, saAddresses[iAddrCount].szName, saAddresses[iAddrCount].szDefaultPort, (char*)saAddresses[iAddrCount].szDefaultAddress, saAddresses[iAddrCount].psAddr))
return 1;
++iAddrCount;
}
//create CONNECT command in case of using HTPP proxy
if (g_iHttpProxyConnectLen)
{
if (!CreateHttpProxyConnectCommand())
{
OutputFatal("\nFailed to create CONNECT command!\n");
return 1;
}
}
g_hSockUdp = socket(sAddr.ss_family, SOCK_DGRAM, IPPROTO_UDP);
if (g_hSockUdp == SOCKET_ERROR)
{
szErrMsg = GetSysError(WSAGetLastError());
OutputFatal("\nCreating a UDP socket has failed: %s\n", szErrMsg);
FreeSysError(szErrMsg);
return 1;
}
//listen on local UDP port (get DNS requests)
if (bind(g_hSockUdp, (struct sockaddr*)&sAddr, GetAddrLen(&sAddr)) == SOCKET_ERROR)
{
OutputBindError(g_hSockUdp, &sAddr, 1);
return 1;
}
if (!bQuiet)
OpenConsole();
//convert adresses+ports to strings
if (getnameinfo((struct sockaddr*)&g_sSocksAddr, GetAddrLen(&g_sSocksAddr), (char*)u16aBuf, 256, (char*)u16aBuf + 256, 256, NI_NUMERICHOST | NI_NUMERICSERV))
{
//should never happen
strcpy((char*)u16aBuf, "unknown address");
strcpy((char*)u16aBuf + 256, "unknown");
}
if (g_sDnsSrvAddr.ss_family == AF_UNSPEC) //name for DNS server?
{
//sin6_addr contains pointer to name, see ParseIpAndPort (max. length is 255)
strcpy((char*)u16aBuf + 512, *(char**)&((struct sockaddr_in6*)&g_sDnsSrvAddr)->sin6_addr);
sprintf((char*)u16aBuf + 768, "%hu", ntohs(((struct sockaddr_in6*)&g_sDnsSrvAddr)->sin6_port));
}
else if (getnameinfo((struct sockaddr*)&g_sDnsSrvAddr, GetAddrLen(&g_sDnsSrvAddr), (char*)u16aBuf + 512, 256, (char*)u16aBuf + 768, 256, NI_NUMERICHOST | NI_NUMERICSERV))
{
//should never happen
strcpy((char*)u16aBuf + 512, "unknown address");
strcpy((char*)u16aBuf + 768, "unknown");
}
if (getnameinfo((struct sockaddr*)&sAddr, GetAddrLen(&sAddr), (char*)u16aBuf + 1024, 256, (char*)u16aBuf + 1280, 256, NI_NUMERICHOST | NI_NUMERICSERV))
{
//should never happen
strcpy((char*)u16aBuf + 1024, "unknown address");
strcpy((char*)u16aBuf + 1280, "unknown");
}
//output configuration
OutputToLog(OUTPUT_LINE_BREAK | OUTPUT_CONSOLE, "%s %s port %s\n"
"DNS server %s port %s\n"
"listening on %s port %s\n"
"cache %s\n"
"authentication %s\n",
g_iHttpProxyConnectLen ? "HTTP proxy " : "SOCKS server", (char*)u16aBuf, (char*)u16aBuf + 256,
(char*)u16aBuf + 512, (char*)u16aBuf + 768,
(char*)u16aBuf + 1024, (char*)u16aBuf + 1280,
g_bCacheEnabled ? "enabled" : "disabled",
szUser ? "enabled" : "disabled");
InitializeCriticalSection(&g_sCritSect);
//log file was requested?
if (szLogFilePath)
OpenLogFile(szLogFilePath, bAppend);
//create authentication package if user/password was specified
if (szUser)
{
g_iUsrPwdLen = uUserLen + uPasswordLen + 3;
g_uaUsrPwd = (unsigned char*)malloc(g_iUsrPwdLen);
g_uaUsrPwd[0] = 1; //version 1
g_uaUsrPwd[1] = (unsigned char)uUserLen;
memcpy(g_uaUsrPwd + 2, szUser, uUserLen);
g_uaUsrPwd[uUserLen + 2] = (unsigned char)uPasswordLen;
memcpy(g_uaUsrPwd + uUserLen + 3, szPassword, uPasswordLen);
}
//create thread for TCP connection
ThreadCreate(TcpThread, &sAddr);
//endless loop
for (;;)
{
//receive DNS request
iAddrLen = sizeof(sAddr);
iLen = recvfrom(g_hSockUdp, (char*)u16aBuf, sizeof(u16aBuf), 0, (struct sockaddr*)&sAddr, &iAddrLen);
if (iLen > 12) //12 bytes header plus at least one byte of data
HandleDnsRequest(u16aBuf, iLen, &sAddr, iAddrLen);
}
/*no cleanup code as we have an endless loop
we would need something like this:
terminate all threads and clear their resources
free(g_uaUsrPwd);
DeleteCriticalSection(&g_sCritSect);
closesocket(g_hSockUdp);
free all cache entries
close the console
close the log file
return 0;*/
}
#ifdef _WIN32
//entry function for Windows applications - just forwards to "main"
int WINAPI WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance, LPSTR szCmdLine, int iCmdShow)
{
WSADATA sData;
char* szErrMsg;
int iErrNo;
hInstance;
hPrevInstance;
szCmdLine;
iCmdShow;
iErrNo = WSAStartup(0x202, &sData);
if (iErrNo)
{
szErrMsg = GetSysError(iErrNo);
OutputFatal("\nWSAStartup has failed: %s\n", szErrMsg);
FreeSysError(szErrMsg);
return 1;
}
//call "main" with the already parsed command line parameters stored in global variables by CRT
iErrNo = main(__argc, __argv);
WSACleanup();
return iErrNo;
}
#endif //#ifdef _WIN32
|
the_stack_data/136232.c
|
#include <stdlib.h>
#include <stdio.h>
#include <time.h>
#ifdef _OPENMP
#include <omp.h>
#else
#define omp_get_thread_num()0
#endif
#define PRINTF_ALL
#define VECTOR_DYNAMIC //descomentar para que los vectores sean variables ...
//dinámicas (memoria reautilizable durante la ejecución)
int main(int argc, char** argv){
int i,j,k,temporal, temporal1, temporal2, temporal3;
struct timespec cgt1,cgt2;
double ncgt; //para tiempo de ejecución
if(argc<2){
printf("Faltan nº componentes de las matrices <nº_filas_matriz_y_nº_columnas_matriz>\n");
exit(-1);
}
unsigned int N=atoi(argv[1]);
int **matriz, **matriz2, **resultado;
//Reservamos espacio para las matrices
//***********************************************
matriz= (int**) malloc(N*sizeof(int*));
for(i=0;i<N;i++){
matriz[i]=(int *) malloc(N*sizeof(int));
}
matriz2= (int**) malloc(N*sizeof(int*));
for(i=0;i<N;i++)
matriz2[i]=(int *) malloc(N*sizeof(int));
resultado= (int**) malloc(N*sizeof(int*)); //matriz resultante de la multiplicación
for(i=0;i<N;i++)
resultado[i]=(int *) malloc(N*sizeof(int));
//************************************************
if((matriz==NULL) || (matriz2==NULL) || (resultado==NULL)){
printf("Error en la reserva de espacio para los vectores\n");
exit(-2);
}
//Inicializar matrices
for(i=0;i<N;i++){
for(j=0;j<N/4;j++){
matriz[i][j]= i*j;
matriz[i][j+1]= i*j;
matriz[i][j+1]= i*j;
matriz[i][j+1]= i*j;
//printf("/matriz[%d][%d] con valor[%d] ejecutado por la hebra: %d\n", i,j,matriz[i][j],omp_get_thread_num());
}
}
for(i=0;i<N;i++){
for(j=0;j<N/4;j++){
matriz2[i][j]= i*j;
matriz2[i][j+1]= i*j;
matriz2[i][j+2]= i*j;
matriz2[i][j+3]= i*j;
//printf("/matriz2[%d][%d] con valor [%d] ejecutado por la hebra: %d\n", i,j,matriz2[i][j],omp_get_thread_num());
}
}
for(i=0;i<N;i++){
for(j=0;j<N/4;j++){
resultado[i][j]=0;
resultado[i][j+1]=0;
resultado[i][j+2]=0;
resultado[i][j+3]=0;
//printf("/resultado[%d][%d] con valor [%d] ejecutado por la hebra: %d\n", i,j,resultado[i][j],omp_get_thread_num());
}
}
//***********************
clock_gettime(CLOCK_REALTIME,&cgt1);
//Calcular multiplicación de la matrices
//**************************************
for(i=0;i<N;i++){ //filas de la matriz resultante
for(j=0;j<N;j++){ //columnas de la matriz resultante
for(k=0;k<N;k+=k+4){ //empezamos a multiplicar los elementos de la matriz
temporal+=matriz[i][k] * matriz2[k][j];
temporal1+=matriz[i][k+1] * matriz2[k+1][j];
temporal2+=matriz[i][k+2] * matriz2[k+2][j];
temporal3+=matriz[i][k+3] * matriz2[k+3][j];
}
resultado[i][j]+=temporal+temporal1+temporal2+temporal3;
//printf("Operación: /matriz[%d][%d]*matriz2[%d][%d](%d*%d=%d) ejecutado por la hebra: %d\n", i,j,i,j,matriz[i][j],matriz2[i][j],matriz[i][j] * matriz2[i][j],omp_get_thread_num());
}
}
//**************************************
clock_gettime(CLOCK_REALTIME,&cgt2);
ncgt=(double) (cgt2.tv_sec-cgt1.tv_sec) + (double) ((cgt2.tv_nsec-cgt1.tv_nsec)/(1.e+9));
#ifdef PRINTF_ALL
printf("Tiempo(seg.): %11.9f\t / Tamaño Vectores:%u\n",ncgt,N);
/*
for(i=0;i<N;i++){
printf("Mostramos resultados intermedios:\n");
for(j=0;j<N;j++)
printf("/matriz[%d][%d]*matriz2[%d][%d](%d*%d=%d)/\n", i,j,i,j,matriz[i][j],matriz2[i][j],matriz[i][j] * matriz2[i][j]);
}
printf("Mostramos resultados finales:\n");
for(i=0;i<N;i++){
for(j=0;j<N;j++)
printf("resultado[%d][%d]= %d\n", i,j,resultado[i][j]);
}*/
#else
printf("Tiempo(seg.): %11.9f\t / Tamaño Vectores:%u\n",
ncgt,N,matriz[0][0],matriz2[0][0],resultado[0][0],N-1,N-1,N-1,matriz[N-1][N-1],matriz2[N-1][N-1],resultado[N-1][N-1]);
#endif
#ifdef VECTOR_DYNAMIC
free(matriz); //libera el espacio reservado para v1
free(matriz2); //libera el espacio reservado para v2
free(resultado); //libera el espacio reservado para v3
#endif
return 0;
}
|
the_stack_data/103265510.c
|
#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <signal.h>
void sighandler(int);
int main () {
signal(SIGINT, sighandler);
while(1) {
printf("Going to sleep for a second...\n");
sleep(1);
}
return(0);
}
void sighandler(int signum) {
printf("Caught signal %d, coming out...\n", signum);
exit(1);
}
|
the_stack_data/212644126.c
|
# include <stdio.h>
int main(){
FILE *f;
int i;
f = fopen("f", "wb");
fwrite(f, 2, 1, f);
fclose(f);
f = fopen("f", "rb");
fseek(f, 0, SEEK_END);
i = ftell(f);
fclose(f);
printf("%d", i);
return 0;
}
|
the_stack_data/258753.c
|
#include <stdio.h>
#include <stdlib.h>
int get_result(int x, int y, int grid_size)
{
if (x == grid_size && y == grid_size)
{
return 1;
}
if (x > grid_size || y > grid_size)
{
return 0;
}
return get_result(x+1, y, grid_size) + get_result(x, y+1, grid_size);
}
int main()
{
int n;
scanf("%d", &n);
printf("%d", get_result(1, 1, n));
return 0;
}
|
the_stack_data/18888906.c
|
/* { dg-skip-if "requires alloca" { ! alloca } { "-O0" } { "" } } */
static void
foo ()
{
long maplength;
int type;
{
const long nibbles = 8;
char buf1[nibbles + 1];
char buf2[nibbles + 1];
char buf3[nibbles + 1];
buf1[nibbles] = '\0';
buf2[nibbles] = '\0';
buf3[nibbles] = '\0';
((nibbles) <= 16
? (({
void *__s = (buf1);
union
{
unsigned int __ui;
unsigned short int __usi;
unsigned char __uc;
}
*__u = __s;
unsigned char __c = (unsigned char)('0');
switch ((unsigned int) (nibbles))
{
case 16:
__u->__ui = __c * 0x01010101;
__u = __extension__ ((void *) __u + 4);
case 12:
__u->__ui = __c * 0x01010101;
__u = __extension__ ((void *) __u + 4);
case 0:
break;
}
__s;
}))
: 0);
((nibbles) <= 16
? (({
void *__s = (buf2);
union
{
unsigned int __ui;
unsigned short int __usi;
unsigned char __uc;
}
*__u = __s;
unsigned char __c = (unsigned char)('0');
switch ((unsigned int) (nibbles))
{
case 16:
__u->__ui = __c * 0x01010101;
__u = __extension__ ((void *) __u + 4);
case 12:
__u->__ui = __c * 0x01010101;
__u = __extension__ ((void *) __u + 4);
case 8:
__u->__ui = __c * 0x01010101;
__u = __extension__ ((void *) __u + 4);
case 4:
__u->__ui = __c * 0x01010101;
case 0:
break;
}
__s;
}))
: 0);
}
}
|
the_stack_data/150144121.c
|
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_print_alphabet.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: aahsan +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2021/08/04 12:39:00 by aahsan #+# #+# */
/* Updated: 2021/08/07 08:50:02 by aahsan ### ########.fr */
/* */
/* ************************************************************************** */
#include <unistd.h>
void ft_print_alphabet(void)
{
char var;
var = 96;
while (++var <= 122)
write(1, &var, 1);
}
|
the_stack_data/98574448.c
|
float A[100][100];
void foo(int X) {
int I, J;
for (J = 0; J < 100; J += X + 1)
for (I = 0; I < 100; ++I)
A[I][J] = I + J + 1.;
}
|
the_stack_data/631300.c
|
#include <stdio.h>
#include <stdlib.h>
struct Stack {
int * arr;
int size;
int top;
};
// Function to create a stack of given size
struct Stack* createStack (int size) {
struct Stack* stack = (struct Stack*) malloc(sizeof(struct Stack));
stack->top = -1;
stack->size = size;
stack->arr = (int *) malloc(size * sizeof(int));
return stack;
}
int isFull (struct Stack* stack) {
return stack->top == stack->size - 1;
}
int isEmpty (struct Stack* stack) {
return stack->top == -1;
}
void push (struct Stack* stack, int data) {
if ( isFull(stack) ) {
printf("Stack Overflow");
return;
}
stack->arr[++stack->top] = data;
}
int pop (struct Stack* stack) {
if ( isEmpty(stack) ) {
printf("Stack Underflow");
return;
}
return stack->arr[stack->top--];
}
int main(int argc, char const *argv[]) {
struct Stack* stack = createStack(10);
push(stack, 10);
push(stack, 20);
push(stack, 30);
printf("%d popped from stack\n", pop(stack));
printf("%d popped from stack\n", pop(stack));
return 0;
}
|
the_stack_data/7977.c
|
#include <stdio.h>
int a(int i) {
int j[2]={2,2},k[2],l;
j[0]=0;
l=0;
store(k,j);
if(i)
l=i;
else
k[0]=1;
return k[0]+k[1];
}
int main(int argc, char *argv[]) {
printf("%d\n",a(argc));
return 0;
}
|
the_stack_data/211079860.c
|
/* $OpenBSD: wcslcat.c,v 1.5 2015/01/15 03:54:12 millert Exp $ */
/*
* Copyright (c) 1998, 2015 Todd C. Miller <[email protected]>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <wchar.h>
/*
* Appends src to string dst of size dsize (unlike strncat, dsize is the
* full size of dst, not space left). At most dsize-1 characters
* will be copied. Always NUL terminates (unless dsize <= wcslen(dst)).
* Returns wcslen(src) + MIN(dsize, wcslen(initial dst)).
* If retval >= siz, truncation occurred.
*/
size_t
wcslcat(wchar_t *dst, const wchar_t *src, size_t dsize)
{
const wchar_t *odst = dst;
const wchar_t *osrc = src;
size_t n = dsize;
size_t dlen;
/* Find the end of dst and adjust bytes left but don't go past end. */
while (n-- != 0 && *dst != L'\0')
dst++;
dlen = dst - odst;
n = dsize - dlen;
if (n-- == 0)
return(dlen + wcslen(src));
while (*src != L'\0') {
if (n != 0) {
*dst++ = *src;
n--;
}
src++;
}
*dst = L'\0';
return(dlen + (src - osrc)); /* count does not include NUL */
}
DEF_WEAK(wcslcat);
|
the_stack_data/37232.c
|
#include <stdio.h>
#include <stdlib.h>
int main(){
int a, b;
scanf("%d %d", &a, &b);
if(a == b){
printf("Equal");
}else{
printf("Not equal");
}
return 0;
}
|
the_stack_data/630088.c
|
#include <stdio.h>
typedef struct _stack{
char value[100];
int top;
} _stack;
void PUSH(char c, _stack * stack){
stack->top++;
stack->value[stack->top] = c;
}
char POP(_stack * stack){
char c = stack->value[stack->top];
stack->top--;
return c;
}
|
the_stack_data/491414.c
|
#include <stdio.h>
#include <unistd.h>
int divs_sum(int n){
int res=0;
for(int i = 1;i<n;i++)n%i==0?(res+=i):(res+=0);
return res;
}
int main(void){
for(int i =1;i<300;i++)
for(int y=1;y<300;y++)
!((divs_sum(i)==y)&&(divs_sum(y)==i)&&i!=y)?:printf("%d %d\n",i,y);
return 0;
}
|
the_stack_data/10574.c
|
/* -*- Mode: C; c-basic-offset:4 ; indent-tabs-mode:nil ; -*- */
/*
* See LICENSE.txt in top-level directory.
*/
#include <assert.h>
#include <omp.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#define NUM_TASKS 50000
#define NUM_REPS 1
int o = 0;
void sscal(float value, float *a)
{
*a = *a * value;
}
void na(float value)
{
o++;
}
void presscal(float value, float *a)
{
#pragma omp task
{
sscal(value, a);
}
#pragma omp task
{
na(value);
}
}
int main(int argc, char *argv[])
{
int i, r, nthreads;
double *time, avg_time = 0.0;
char *str, *endptr;
float *a;
double time2 = 0.0;
#pragma omp parallel
{
#pragma omp master
{
nthreads = omp_get_num_threads();
}
}
if (argc > 1) {
str = argv[1];
}
int ntasks = argc > 1 ? strtoll(str, &endptr, 10) : NUM_TASKS;
if (ntasks < nthreads)
ntasks = nthreads;
int rep = (argc > 2) ? atoi(argv[2]) : NUM_REPS;
time = malloc(sizeof(double) * rep);
a = malloc(sizeof(float) * ntasks);
for (i = 0; i < ntasks; i++) {
a[i] = i + 100.0f;
}
for (r = 0; r < rep; r++) {
time[r] = omp_get_wtime();
#pragma omp parallel
{
#pragma omp single
{
time2 = omp_get_wtime();
for (i = 0; i < ntasks; i++) {
#pragma omp task firstprivate(i)
{
presscal(0.9f, &a[i]);
}
}
time2 = omp_get_wtime() - time2;
}
}
time[r] = omp_get_wtime() - time[r];
avg_time += time[r];
}
// TODO: Just works with one repetition
for (i = 0; i < ntasks; i++) {
if (a[i] != (i + 100.0f) * 0.9f) {
printf("error: a[%d]=%2.f expected %2.f\n", i,
a[i], (i + 100.0f) * 0.9f);
}
}
avg_time /= rep;
printf("nthreads: %d\nntasks: %d\nTime(s):%f\nCreation Time: %f\n",
nthreads, ntasks, avg_time, time2);
printf("o=%d deberia valer %d\n", o, ntasks);
return EXIT_SUCCESS;
}
|
the_stack_data/242330613.c
|
#include <stdio.h>
int main() {
printf("Hello, World!");
return 0;
}
|
the_stack_data/159516299.c
|
#include <stdio.h>
#include <string.h>
const char* fizzbuzz(int x) {
static char b[0115];
if (b[42] != 98) {
b[21] = 102; b[22] = 105; b[23] = 122; b[24] = 122;
b['A'] = 122; b['B'] = 122; b['C'] = 98; b['D'] = 117;
b['E'] = 122; b['F'] = 122; b[','] = 122; b['*'] = 98;
b['?'] = 102; b['@'] = 105; b['+'] = 117; b['-'] = 122;
}
return sprintf(b, "%d", x), b + ((x % 5) ? 0 : 0x15) + ((x % 3) ? 0 : '*');
}
int main() {
for (int i=0; i < 32; i++) {
printf("%d: %s\n", i, fizzbuzz(i));
}
}
|
the_stack_data/14199371.c
|
#ifdef MATRIX
#include "board.h"
int main(int argc, char *argv[]){
Board *p1, *p2;
int* lstOfShips;
int random = 0;
p1 = malloc(sizeof (Board));
p2 = malloc(sizeof (Board));
if(checkArgs(argc, argv)){
newBoard(atoi(argv[1]), atoi(argv[2]), p1, p2);
}else{
int col, row;
printWarningMsg("Specify the board size! Minimum size:20x20 ; Maximum size:40x40");
printWarningMsg("Format of board sizes: X Y");
scanf("%d%d",&row,&col);
newBoard(row, col, p1, p2);
}
lstOfShips = selectShips(p1->rowSize,p1->colSize);
setHP(p1,p2,lstOfShips);
printAllShipsTypes();
printWarningMsg("Player 1: Randomly set ships ?(" KGRN "1" KNRM "/" KRED "0" KNRM "): ");
scanf("%d",&random);
while(random != 1 && random != 0){
printf("\n" KNRM "Randomly set ships ? (" KGRN "1" KNRM "/" KRED "0" KNRM "): ");
scanf("%d",&random);
}
if(random == 1){
randomPlaceShips(p1,lstOfShips);
}else{
manualyPlanceShips(p1,lstOfShips);
}
printWarningMsg("Player 2: Randomly set ships ?(" KGRN "1" KNRM "/" KRED "0" KNRM "): ");
scanf("%d",&random);
while(random != 1 && random != 0){
printf("\n" KNRM "Randomly set ships ? (" KGRN "1" KNRM "/" KRED "0" KNRM "): ");
scanf("%d",&random);
}
if(random == 1){
randomPlaceShips(p2,lstOfShips);
}else{
manualyPlanceShips(p2,lstOfShips);
}
fire(p1,p2);
clearBoard(p1);
clearBoard(p2);
return 0;
}
#endif
#ifdef QT
#include "quadtree.h"
int main(int argc, char *argv[]){
QD_NODE *p1, *p2;
int p1Hp = 0, p2Hp = 0, random, rowSize, colSize;
Coordinate c1, c2;
int *lstOfShips;
if(checkArgs(argc, argv)){
int side = (atoi(argv[1]) == 20)?32:64;
rowSize = atoi(argv[1]);
colSize = atoi(argv[2]);
c1 = make_point(0,side);
c2 = make_point(side,0);
p1 = newQuadLeaf(c1,c2);
p2 = newQuadLeaf(c1,c2);
}else{
int col, row;
printWarningMsg("Specify the board size! Minimum size:20x20 ; Maximum size:40x40");
printWarningMsg("Format of board sizes: X Y");
scanf("%d%d",&row,&col);
int side = (row == 20)?32:64;
rowSize = atoi(argv[1]);
colSize = atoi(argv[2]);
c1 = make_point(0,side);
c2 = make_point(side,0);
p1 = newQuadLeaf(c1,c2);
p2 = newQuadLeaf(c1,c2);
}
setup(rowSize, colSize);
lstOfShips = selectShips(rowSize,colSize);
sumShipSizesAndSetHP(lstOfShips, &p1Hp, &p2Hp);
printAllShipsTypes();
printWarningMsg("Player 1: Randomly set ships ?(" KGRN "1" KNRM "/" KRED "0" KNRM "): ");
scanf("%d",&random);
while(random != 1 && random != 0){
printf("\n" KNRM "Randomly set ships ? (" KGRN "1" KNRM "/" KRED "0" KNRM "): ");
scanf("%d",&random);
}
if(random == 1){
p1 = randomPlaceShips(p1,lstOfShips);
}else{
p1 = manualPlaceShips(p1,lstOfShips);
}
printTree(p1);
printWarningMsg("Player 2: Randomly set ships ?(" KGRN "1" KNRM "/" KRED "0" KNRM "): ");
scanf("%d",&random);
while(random != 1 && random != 0){
printf("\n" KNRM "Randomly set ships ? (" KGRN "1" KNRM "/" KRED "0" KNRM "): ");
scanf("%d",&random);
}
if(random == 1){
p2 = randomPlaceShips(p2,lstOfShips);
}else{
p2 = manualPlaceShips(p2,lstOfShips);
}
fire(p1,p2, &p1Hp, &p2Hp);
return 0;
}
#endif
|
the_stack_data/121547.c
|
double mean(int n, double* a)
{
double s;
int i;
for (s=0., i=0; i<n; i++) s+=*(a++);
return s/n;
}
|
the_stack_data/106201.c
|
#include <unistd.h>
#include <stdlib.h>
#include <stdio.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <string.h>
#include <arpa/inet.h>
void str_echo(int sockfd)
{
char buff[50];
printf("\n Enter the message for client \n");
scanf("%s",buff);
write(sockfd,buff, strlen(buff));
return;
}
int main(int argc, char** argv)
{
int listenfd, connfd;
struct sockaddr_in servaddr, cliaddr;
pid_t childpid;
listenfd = socket(AF_INET, SOCK_STREAM, 0);
bzero(&servaddr, sizeof(servaddr));
servaddr.sin_family= AF_INET;
servaddr.sin_port= htons(atoi(argv[1]));
int j= inet_aton("argv[2]",&servaddr.sin_addr);
bind(listenfd,(const struct sockaddr*)&servaddr, sizeof(servaddr));
listen(listenfd, atoi(argv[3]));
for(;;)
{
printf("hello");
printf("\n hello.0000000");
socklen_t siz=sizeof(cliaddr);
connfd= accept(listenfd, (struct sockaddr*)&cliaddr, &siz);
printf("\n connection is established with the client at");
printf("\n IP= %s", inet_ntoa(cliaddr.sin_addr));
printf("\n and port_no= %d",ntohs(cliaddr.sin_port));
if ((childpid=fork())==0)
{
close(listenfd);
str_echo (connfd);
close(connfd);
exit(0);
}
close(connfd);
}
return 0;
}
|
the_stack_data/90766059.c
|
/*numPass=0, numTotal=9
Verdict:WRONG_ANSWER, Visibility:1, Input:"abcdef", ExpOutput:"defabc", Output:"defabcdefabcdefabcdefabcdefabcdefabcdefabc"
Verdict:WRONG_ANSWER, Visibility:1, Input:"programming", ExpOutput:"mmingaprogr", Output:"mmingaprogrmmingaprogrmmingaprogrmmingaprogrmmingaprogrmmingaprogrmmingaprogrmmingaprogrmmingaprogrmmingaprogrmmingaprogrmmingaprogr"
Verdict:WRONG_ANSWER, Visibility:1, Input:"hello-@programmer", ExpOutput:"ogrammerrhello-@p", Output:"ogrammerrhello-@pogrammerrhello-@pogrammerrhello-@pogrammerrhello-@pogrammerrhello-@pogrammerrhello-@pogrammerrhello-@pogrammerrhello-@pogrammerrhello-@pogrammerrhello-@pogrammerrhello-@pogrammerrhello-@pogrammerrhello-@pogrammerrhello-@pogrammerrhello-@pogrammerrhello-@pogrammerrhello-@pogrammerrhello-@p"
Verdict:WRONG_ANSWER, Visibility:1, Input:"abab", ExpOutput:"abab", Output:"abababababababababab"
Verdict:WRONG_ANSWER, Visibility:0, Input:"hellodear", ExpOutput:"dearohell", Output:"dearohelldearohelldearohelldearohelldearohelldearohelldearohelldearohelldearohelldearohell"
Verdict:WRONG_ANSWER, Visibility:0, Input:"progamming", ExpOutput:"mmingproga", Output:"mmingprogammingprogammingprogammingprogammingprogammingprogammingprogammingprogammingprogammingprogammingproga"
Verdict:WRONG_ANSWER, Visibility:0, Input:"abcdz", ExpOutput:"dzcab", Output:"dzcabdzcabdzcabdzcabdzcabdzcab"
Verdict:WRONG_ANSWER, Visibility:0, Input:"abc", ExpOutput:"cba", Output:"cbacbacbacba"
Verdict:WRONG_ANSWER, Visibility:0, Input:"a", ExpOutput:"a", Output:"aa"
*/
#include <stdio.h>
void swap_str(char a,char b){
char temp;
temp=b;
b=a;
a=temp;
}
int main() {
char str[100];
int j,i=0,k;
while(str[i]!='\0'){
scanf("%s",&str[i]);
i++;
}
scanf("%s",&str[i]);
for(j=0;j<i/2;j++){
char temp=str[j];
str[j]=str[j+(i+1)/2];
str[j+(i+1)/2]=temp;
}
for(k=0;k<i+1;k++){
printf("%s",str);
}
return 0;
}
|
the_stack_data/31389184.c
|
/*
David Vandensteen
2019
*/
// todo (minor) - remake this sample (all is deprecated) - sample panic
/*
#include <neocore.h>
#include <math.h>
#include "player.h"
#include "externs.h"
NEOCORE_INIT
static picturePhysicShrunkCentroid laser, boss;
static BYTE shrunk_x;
static WORD shrunk_y = 0;
static Box *boxes_collide_to_test[2];
static picture5 laser_box_pics, boss_box_pics;
static void init();
static void display();
static void update();
static void init() {
image_physic_shrunk_centroid_init(&laser, &laser_sprite, &laser_sprite_Palettes, 160, 180);
image_physic_shrunk_centroid_init(&boss, &boss_city_sprite, &boss_city_sprite_Palettes, 160, 60);
shrunk_x = 0;
player_init();
box_init(&laser.pp.box, 320, 80, 0, 0);
box_init(&boss.pp.box, 160, 128, 0, 0);
boxes_collide_to_test[0] = &laser.pp.box;
boxes_collide_to_test[1] = &boss.pp.box;
}
static void display() {
image_physic_shrunk_centroid_display(&laser, shrunk_forge(shrunk_x, shrunk_y));
image_physic_shrunk_centroid_display(&boss, shrunk_forge(shrunk_x, shrunk_y));
player_display();
box_display(&laser_box_pics, &laser.pp.box, &dot_sprite, &dot_sprite_Palettes);
box_display(&boss_box_pics, &boss.pp.box, &dot_sprite, &dot_sprite_Palettes);
}
static void update() {
joypad_update_edge();
if (DAT_frameCounter % 5 == 0) {
logger_init();
image_physic_shrunk_centroid_update(&laser, shrunk_forge(shrunk_x, shrunk_y));
image_physic_shrunk_centroid_update(&boss, shrunk_forge(shrunk_x, shrunk_y));
box_debug_update(&laser_box_pics, &laser.pp.box);
box_debug_update(&boss_box_pics, &boss.pp.box);
*/
/* Set Pos
laser.positionCenter.x++;
picturePhysicShrunkCentroidSetPos(&laser.boxOrigin, laser.positionCenter.x, laser.positionCenter.y);
*/
/* Move
picturePhysicShrunkCentroidMove(&laser, 1, 1);
*/
/*
shrunk_x++;
shrunk_y++;
if (shrunk_x >= 0xF) shrunk_x = 0;
if (shrunk_y >= 0xFF) shrunk_y = 0;
}
player_update();
player_collides(boxes_collide_to_test, 2);
}
int main(void) {
GPU_INIT
init();
display();
while(1) {
wait_vbl();
update();
SCClose();
};
SCClose();
return 0;
}
*/
|
the_stack_data/107189.c
|
/*
* Date: 17.12.2013
* Author: Thomas Ströder
*/
typedef long unsigned int size_t;
void * __attribute__((__cdecl__)) malloc (size_t __size) ;
extern int __VERIFIER_nondet_int(void);
/* Returns some null-terminated string. */
char* build_nondet_String(void) {
int length = __VERIFIER_nondet_int();
if (length < 1) {
length = 1;
}
char* nondetString = (char*) malloc(length * sizeof(char));
nondetString[length-1] = '\0';
return nondetString;
}
int (cstrcmp)(const char *s1, const char *s2)
{
unsigned char uc1, uc2;
/* Move s1 and s2 to the first differing characters
in each string, or the ends of the strings if they
are identical. */
while (*s1 != '\0' && *s1 == *s2) {
s1++;
s2++;
}
/* Compare the characters as unsigned char and
return the difference. */
uc1 = (*(unsigned char *) s1);
uc2 = (*(unsigned char *) s2);
return ((uc1 < uc2) ? -1 : (uc1 > uc2));
}
int main() {
return cstrcmp(build_nondet_String(),build_nondet_String());
}
|
the_stack_data/76699371.c
|
/*
## Cypress FX3 Boot Firmware Example Source file (usb_descriptors.c)
## ===========================
##
## Copyright Cypress Semiconductor Corporation, 2010-2018,
## All Rights Reserved
## UNPUBLISHED, LICENSED SOFTWARE.
##
## CONFIDENTIAL AND PROPRIETARY INFORMATION
## WHICH IS THE PROPERTY OF CYPRESS.
##
## Use of this file is governed
## by the license agreement included in the file
##
## <install>/license/license.txt
##
## where <install> is the Cypress software
## installation root directory path.
##
## ===========================
*/
/* Device, config and string descriptors. */
unsigned char gbDevDesc[] =
{
0x12, /* Descriptor Size */
0x01, /* Device Descriptor Type */
0x10,0x02, /* USB 2.10 */
0x00, /* Device Class */
0x00, /* Device Sub-class */
0x00, /* Device protocol */
0x40, /* Maxpacket size for EP0 : 64 bytes */
0x56,0x04, /* Vendor ID */
0x02,0xEF, /* Product ID */
0x00,0x00, /* Device release number */
0x01, /* Manufacture string index */
0x02, /* Product string index */
0x03, /* Serial number string index */
0x01 /* Number of configurations */
};
unsigned char gbDevQualDesc[] =
{
0x0A, /* Descriptor Size */
0x06, /* Device Qualifier Descriptor Type */
0x00,0x02, /* USB 2.0 */
0xFF, /* Device Class */
0xFF, /* Device Sub-class */
0xFF, /* Device protocol */
0x40, /* Maxpacket size for EP0 : 64 bytes */
0x01, /* Number of configurations */
0x00 /* Reserved */
};
unsigned char gbCfgDesc[] =
{
0x09, /* Descriptor Size */
0x02, /* Configuration Descriptor Type */
0x12,0x00, /* Length of this descriptor and all sub descriptors */
0x01, /* Number of interfaces */
0x01, /* Configuration number */
0x00, /* COnfiguration string index */
0x80, /* Config characteristics - Bus powered */
0x32, /* Max power consumption of device (in 2mA unit) : 100mA */
/* Interface Descriptor */
0x09, /* Descriptor size */
0x04, /* Interface Descriptor type */
0x00, /* Interface number */
0x00, /* Alternate setting number */
0x00, /* Number of end points */
0xFF, /* Interface class */
0x00, /* Interface sub class */
0x00, /* Interface protocol code */
0x00, /* Interface descriptor string index */
};
unsigned char gbLangIDDesc[] =
{
0x04, /* Descriptor Size */
0x03, /* Device Descriptor Type */
0x09,0x04 /* Language ID supported */
};
/* Standard Manufacturer String Descriptor */
unsigned char gbManufactureDesc[] =
{
0x1E, /* Descriptor Size */
0x03, /* Device Descriptor Type */
'A',0x00,
'n',0x00,
'a',0x00,
'l',0x00,
'o',0x00,
'g',0x00,
' ',0x00,
'D',0x00,
'e',0x00,
'v',0x00,
'i',0x00,
'c',0x00,
'e',0x00,
's',0x00
};
unsigned char gbProductDesc[] =
{
0x2C, /* Descriptor Size */
0x03, /* Device Descriptor Type */
'F',0x00,
'X',0x00,
'3',0x00,
' ',0x00,
'B',0x00,
'o',0x00,
'o',0x00,
't',0x00,
'l',0x00,
'o',0x00,
'a',0x00,
'd',0x00,
'e',0x00,
'r',0x00,
' ',0x00,
'v',0x00,
'1',0x00,
'.',0x00,
'0',0x00,
'.',0x00,
'1',0x00
};
unsigned char gbSerialNumDesc [] =
{
0x22, /* bLength */
0x03, /* bDescType */
'0',0x00,'0',0x00,'0',0x00,'0',0x00,
'0',0x00,'0',0x00,'0',0x00,'0',0x00,
'0',0x00,'0',0x00,'0',0x00,'0',0x00,
'0',0x00,'0',0x00,'0',0x00,'0',0x00,
};
/* SuperSpeed descriptors */
/* Binary Device Object Store Descriptor */
unsigned char gbBosDesc[] =
{
0x05, /* Descriptor Size */
0x0F, /* Device Descriptor Type */
0x16,0x00, /* Length of this descriptor and all sub descriptors */
0x02, /* Number of device capability descriptors */
/* USB 2.0 Extension */
0x07, /* Descriptor Size */
0x10, /* Device Capability Type descriptor */
0x02, /* USB 2.0 Extension Capability Type */
0x02,0x00,0x00,0x00, /* Supported device level features - LPM Support */
/* SuperSpeed Device Capability */
0x0A, /* Descriptor Size */
0x10, /* Device Capability Type descriptor */
0x03, /* SuperSpeed Device Capability Type */
0x00, /* Supported device level features */
0x0E,0x00, /* Speeds Supported by the device : SS, HS and FS */
0x03, /* Functionality support */
0x00, /* U1 Device Exit Latency */
0x00,0x00 /* U2 Device Exit Latency */
};
/* Standard Super Speed Configuration Descriptor */
unsigned char gbSsConfigDesc[] =
{
/* Configuration Descriptor Type */
0x09, /* Descriptor Size */
0x02, /* Configuration Descriptor Type */
0x12,0x00, /* Length of this descriptor and all sub descriptors */
0x01, /* Number of interfaces */
0x01, /* Configuration number */
0x00, /* Configuration string index */
0x80, /* Config characteristics - D6: Self power; D5: Remote Wakeup */
0x32, /* Max power consumption of device (in 8mA unit) : 400mA */
/* Interface Descriptor */
0x09, /* Descriptor size */
0x04, /* Interface Descriptor type */
0x00, /* Interface number */
0x00, /* Alternate setting number */
0x00, /* Number of end points */
0xFF, /* Interface class */
0x00, /* Interface sub class */
0x00, /* Interface protocol code */
0x00, /* Interface descriptor string index */
};
/* Standard Device Descriptor for USB 3.0 */
unsigned char gbSsDevDesc[] =
{
0x12, /* Descriptor Size */
0x01, /* Device Descriptor Type */
0x10,0x03, /* USB 3.10 */
0x00, /* Device Class */
0x00, /* Device Sub-class */
0x00, /* Device protocol */
0x09, /* Maxpacket size for EP0 : 2^9 */
0x56,0x04, /* Vendor ID */
0x02,0xEF, /* Product ID */
0x00,0x00, /* Device release number */
0x01, /* Manufacture string index */
0x02, /* Product string index */
0x03, /* Serial number string index */
0x01 /* Number of configurations */
};
/* Standard Full Speed Configuration Descriptor */
unsigned char gbFsConfigDesc[] =
{
/* Configuration Descriptor Type */
0x09, /* Descriptor Size */
0x02, /* Configuration Descriptor Type */
0x12,0x00, /* Length of this descriptor and all sub descriptors */
0x01, /* Number of interfaces */
0x01, /* Configuration number */
0x00, /* COnfiguration string index */
0x80, /* Config characteristics - Bus powered */
0x32, /* Max power consumption of device (in 2mA unit) : 100mA */
/* Interface Descriptor */
0x09, /* Descriptor size */
0x04, /* Interface Descriptor type */
0x00, /* Interface number */
0x00, /* Alternate setting number */
0x00, /* Number of end points */
0xFF, /* Interface class */
0x00, /* Interface sub class */
0x00, /* Interface protocol code */
0x00, /* Interface descriptor string index */
};
|
the_stack_data/680986.c
|
#include <stdio.h>
#define nx 81
#define ny 81
#define nt 100
void Scheme(float u[][ny], float un[][ny],float v[][ny], float vn[][ny], float dt, float dx, float dy, float c)
{
FILE *fp;
fp = fopen("2D_NonLinear_Advection_final_Condition.dat","w");
int i,j,k;
float y[ny],x[nx];
for (j = 0; j < ny;j++)
{
y[j] = j*dy;
x[j] = j*dx;
}
for (k = 0;k < nt; k++)
{
for(i=0;i<nx;i++)
{
for(j=0;j<ny;j++)
{
un[i][j]= u[i][j];
vn[i][j]= v[i][j];
}
}
for ( i = 1; i < nx-1; i++)
{
for (j = 1; j < ny-1; j++)
{
u[i][j] = (un[i][j] - (un[i][j] * dt / dx * (un[i][j] - un[i-1][j])) - (vn[i][j]* dt / dy * (un[i][j] - un[j-1][i])));
u[0][j] = 1.0;
u[nx][j] = 1.0;
u[i][0] = 1.0;
u[i][ny] = 1.0;
v[i][j] = (vn[i][j] - (un[i][j] * dt / dx * (vn[i][j] - vn[i-1][j])) - (vn[i][j]* dt / dy * (vn[i][j] - vn[j-1][i])));
v[0][j] = 1.0;
v[nx][j] = 1.0;
v[i][0] = 1.0;
v[i][ny] = 1.0;
}
}
}
fprintf(fp,"VARIABLES = \"x\"\t,\"y\"\t,\"u\"\t,\"v\"\n");
for (i=0 ; i < nx ; i++)
{
for (j=0 ; j < ny ; j++)
{
fprintf(fp,"%0.2f\t %0.2f\t %f\t %f\n",x[i],y[j],u[i][j],v[i][j]);
}
}
}
int main()
{
int i,j;
float c = 1.0;
float dx = 2.0 / (nx - 1.0);
float dy = 2.0 / (ny - 1.0);
float sigma = 0.2;
float dt = sigma * dx;
FILE *fp;
fp = fopen("2D_NonLinear_Advection_Initial_Condition.dat","w");
float x[nx],y[ny],u[nx][ny], un[nx][ny],v[nx][ny], vn[nx][ny];
for (i = 0; i < nx ;i++)
{
x[i] = i*dx;
y[i] = i*dy;
}
for (i = 0; i<nx ;i++)
{
for(j=0;j<ny;j++)
{
u[i][j] = 1.0;
v[i][j] = 1.0;
un[i][j] = 1.0;
vn[i][j] = 1.0;
}
}
for (i = 20 ; i <= 41 ; i++ )
{
for(j = 20 ; j <= 41 ; j++)
{
u[i][j] = 2.0;
v[i][j] = 2.0;
}
}
fprintf(fp,"VARIABLES = \"x\"\t,\"y\"\t,\"u\"\t,\"v\"\n");
for (i = 0; i < nx; i++)
{
for (j = 0; j < ny; j++)
{
fprintf(fp,"%0.2f\t %0.2f\t %f\t %f\n",x[i],y[j],u[i][j],v[i][j]);
}
}
Scheme(u,un,v,vn,dt,dx,dy,c);
}
|
the_stack_data/173578525.c
|
/* MDH WCET BENCHMARK SUITE. File version $Id: crc.c,v 1.4 2006/01/27 13:15:05 jgn Exp $ */
/*************************************************************************/
/* */
/* SNU-RT Benchmark Suite for Worst Case Timing Analysis */
/* ===================================================== */
/* Collected and Modified by S.-S. Lim */
/* [email protected] */
/* Real-Time Research Group */
/* Seoul National University */
/* */
/* */
/* < Features > - restrictions for our experimental environment */
/* */
/* 1. Completely structured. */
/* - There are no unconditional jumps. */
/* - There are no exit from loop bodies. */
/* (There are no 'break' or 'return' in loop bodies) */
/* 2. No 'switch' statements. */
/* 3. No 'do..while' statements. */
/* 4. Expressions are restricted. */
/* - There are no multiple expressions joined by 'or', */
/* 'and' operations. */
/* 5. No library calls. */
/* - All the functions needed are implemented in the */
/* source file. */
/* */
/* */
/*************************************************************************/
/* */
/* FILE: crc.c */
/* SOURCE : Numerical Recipes in C - The Second Edition */
/* */
/* DESCRIPTION : */
/* */
/* A demonstration for CRC (Cyclic Redundancy Check) operation. */
/* The CRC is manipulated as two functions, icrc1 and icrc. */
/* icrc1 is for one character and icrc uses icrc1 for a string. */
/* The input string is stored in array lin[]. */
/* icrc is called two times, one for X-Modem string CRC and the */
/* other for X-Modem packet CRC. */
/* */
/* REMARK : */
/* */
/* EXECUTION TIME : */
/* */
/* */
/*************************************************************************/
/* Changes:
* JG 2005/12/12: Indented program.
*/
typedef unsigned char uchar;
#define LOBYTE(x) ((uchar)((x) & 0xFF))
#define HIBYTE(x) ((uchar)((x) >> 8))
unsigned char lin[256] = "asdffeagewaHAFEFaeDsFEawFdsFaefaeerdjgp";
unsigned short icrc1(unsigned short crc, unsigned char onech);
unsigned short
icrc(unsigned short crc, unsigned long len,
short jinit, int jrev);
unsigned short
icrc1(unsigned short crc, unsigned char onech)
{
int i;
unsigned short ans = (crc ^ onech << 8);
for (i = 0; i < 8; i++) {
if (ans & 0x8000) {
ans <<= 1;
ans = ans ^ 4129;
}
else
ans <<= 1;
}
return ans;
}
unsigned short
icrc(unsigned short crc, unsigned long len,
short jinit, int jrev)
{
unsigned short icrc1(unsigned short crc, unsigned char onech);
static unsigned short icrctb[256], init = 0;
static uchar rchr[256];
unsigned short tmp1, tmp2, j, cword = crc;
static uchar it[16] = {0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15};
if (!init) {
init = 1;
for (j = 0; j <= 255; j++) {
icrctb[j] = icrc1(j << 8, (uchar) 0);
rchr[j] = (uchar) (it[j & 0xF] << 4 | it[j >> 4]);
}
}
if (jinit >= 0)
cword = ((uchar) jinit) | (((uchar) jinit) << 8);
else if (jrev < 0)
cword = rchr[HIBYTE(cword)] | rchr[LOBYTE(cword)] << 8;
#ifdef DEBUG
printf("len = %d\n", len);
#endif
for (j = 1; j <= len; j++) {
if (jrev < 0) {
tmp1 = rchr[lin[j]] ^ HIBYTE(cword);
} else {
tmp1 = lin[j] ^ HIBYTE(cword);
}
cword = icrctb[tmp1] ^ LOBYTE(cword) << 8;
}
if (jrev >= 0) {
tmp2 = cword;
} else {
tmp2 = rchr[HIBYTE(cword)] | rchr[LOBYTE(cword)] << 8;
}
return (tmp2);
}
int
main()
{
unsigned short i1, i2;
unsigned long n;
n = 40;
lin[n + 1] = 0;
i1 = icrc(0, n, (short) 0, 1);
lin[n + 1] = HIBYTE(i1);
lin[n + 2] = LOBYTE(i1);
i2 = icrc(i1, n + 2, (short) 0, 1);
return 0;
}
|
the_stack_data/82950400.c
|
#include "stdio.h"
int x = 3;
int y = 2;
int r;
int main() {
if (x > y)
{
}
else {
r = y;
}
printf("%d\n", r);
r;
return 0;
}
|
the_stack_data/165767204.c
|
#include <stdio.h>
#include <stdbool.h> //bool类型需要的包
//bool类型（需要导包），从C99开始有bool类型
//实际上bool还是用整数类型表达的
//在java中，0和1 与 boolean是没有任何关系的
//如果你写if(1)或者if(0)都会报错。因为只能是boolean类型
int main()
{
bool flag1 = true;
bool flag2 = false;
printf("%d\n", flag1);
printf("%d\n", flag2);
return 0;
}
|
the_stack_data/117327733.c
|
extern void __VERIFIER_error() __attribute__ ((__noreturn__));
void __VERIFIER_assert(int cond) {
if (!(cond)) {
ERROR: __VERIFIER_error();
}
return;
}
#ifndef _BASE_H
#define _BASE_H
/* Only #define it if it hasn't already been defined using -D */
#ifndef BASE_SZ
#define BASE_SZ 2
#endif
#ifndef MAX_GETC
#define MAX_GETC 10
#endif
#endif
#ifndef _STUBS_H
#define _STUBS_H
#define NULL ((void *)0)
#define EOS 0
#define EOF -1
#define ERR -1
/* I had size_t being an unsigned long before, but that led to the
* infamous "Equality without matching types" error when I used a
* size_t to index into an array. */
typedef int size_t;
typedef int bool;
#define true 1
#define false 0
#define TYPECAST_MEMCPY 0
char *strchr(const char *s, int c);
char *strrchr(const char *s, int c);
char *strstr(const char *haystack, const char *needle);
char *strncpy (char *dest, const char *src, size_t n);
char *strncpy_ptr (char *dest, const char *src, size_t n);
char *strcpy (char *dest, const char *src);
unsigned strlen(const char *s);
int strncmp (const char *s1, const char *s2, size_t n);
int strcmp (const char *s1, const char *s2);
char *strcat(char *dest, const char *src);
void *memcpy(void *dest, const void *src, size_t n);
int isascii (int c);
int isspace (int c);
int getc (/* ignore FILE* arg */);
/* Extensions to libc's string library */
char *strrand (char *s);
int istrrand (char *s);
int istrchr(const char *s, int c);
int istrrchr(const char *s, int c);
int istrncmp (const char *s1, int start, const char *s2, size_t n);
int istrstr(const char *haystack, const char *needle);
/* Hackish duplicate functions to enable us to determine which claims
* are relevant. Oh, the hilarity. */
char *r_strncpy (char *dest, const char *src, size_t n);
char *r_strcpy (char *dest, const char *src);
char *r_strcat(char *dest, const char *src);
char *r_strncat(char *dest, const char *src, size_t n);
void *r_memcpy(void *dest, const void *src, size_t n);
#endif
typedef unsigned int u_int;
typedef unsigned char u_int8_t;
struct ieee80211_scan_entry {
u_int8_t *se_rsn_ie; /* captured RSN ie */
};
#define IEEE80211_ELEMID_RSN 200 /* fake */
/* Size of an array leader[] which is written to buf[] before it is
* overflowed by the ie[] array. */
#define LEADERSZ 1
/* We first write the "leader" to buf[], and then write from the "ie"
* array. buf[] has to be bigger than LEADERSZ by at least 2. */
#define BUFSZ BASE_SZ + LEADERSZ + 3
/* Just has to be big enough to overflow buf[]
* Note that for each byte in ie[], two bytes are written to buf[] in
* encode_ie() */
#define IESZ BUFSZ - LEADERSZ
typedef int NSS_STATUS;
/* Size of overflowed buffer. */
#define FSTRING_LEN BASE_SZ /* originally 256 */
typedef char fstring[FSTRING_LEN];
/* Size of input buffer. */
#define INSZ (FSTRING_LEN+2)
// Destination buffer.
#define BUF BASE_SZ
// Source buffers. Make each big enough that the size checks in the OK
// versions are necessary to ensure safety.
#define GECOS BASE_SZ + 2
#define LOGIN BASE_SZ + 2
#define EXPRESSION_LENGTH BASE_SZ
#define NEEDLE "EX"
#define NEEDLE_SZ 2
/* Enough to fill a buffer of size EXPRESSION_LENGTH, enough to
* contain the needle, and enough to overflow the buffer. */
#define LINE_LENGTH EXPRESSION_LENGTH + NEEDLE_SZ + 4
/* Size of buffer being overflowed.
* Ensure that SUN_PATH_SZ - 1 is non-negative */
#define SUN_PATH_SZ BASE_SZ + 1/* originally 108 */
/* Size of input buffer. */
#define FILENAME_SZ SUN_PATH_SZ + 2 /* originally 1024 */
struct sockaddr_un
{
char sun_path[SUN_PATH_SZ]; /* Path name. */
};
static int parse_expression_list(char *str)
{
int start=0, i=-1, j=-1;
char str2[EXPRESSION_LENGTH];
if (!str) return -1;
do {
/* i only changes here --> it's the "current character" */
i++;
switch(str[i]) {
case EOS: /* word found */
/* Skip initial whitespace from start of the word being processed */
while ((str[start] == ' ') || (str[start] == '\t')) start++;
/* Skip quote marks */
if (str[start] == '"') start++;
/* Set j to point to the end of the current word */
j = i-1;
/* Skip over quotes and whitespace at the END of the word */
while ((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) j--;
if ((0 < j) && (str[j] == '"')) j--;
/* If word not empty.... */
if (start<=j) {
/* valid word */
if (j-start+1>=EXPRESSION_LENGTH) {
return -1;
}
/* OK */
r_strncpy(str2, str+start, j-start+1);
str2[j-start+1] = EOS;
} else {
/* parsing error */
return -1;
}
/* for the next word */
start = i+1;
}
} while (str[i] != EOS);
return 0;
}
int main ()
{
char A [LINE_LENGTH+1];
A[LINE_LENGTH] = EOS;
parse_expression_list (A);
return 0;
}
|
the_stack_data/123814.c
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include<assert.h>
#define MAX_CHARACTERS 1005
#define MAX_PARAGRAPHS 5
char* kth_word_in_mth_sentence_of_nth_paragraph(char**** document, int k, int m, int n) {
return document[n-1][m-1][k-1];
}
char** kth_sentence_in_mth_paragraph(char**** document, int k, int m) {
return document[m-1][k-1];
}
char*** kth_paragraph(char**** document, int k) {
return document[k-1];
}
char** split_string(char* text, char delim) {
assert(text != NULL);
char** result = malloc(1*sizeof(char*));
int size = 1;
char* temp = strtok(text, &delim);
*result = temp;
while(temp != NULL) {
size++;
result = realloc(result,size*sizeof(char*));
temp = strtok(NULL, &delim);
result[size-1] = temp;
}
return result;
}
char**** get_document(char* text) {
assert(text != NULL);
// split text by '\n' and count number of paragraphs
char** paragraphs = split_string(text, '\n');
int npar = 0;
while (paragraphs[npar] != NULL) {
npar++;
}
char**** doc = malloc((npar+1)*sizeof(char***));
// set last position to NULL for the user
// to know when the array ends.
doc[npar] = NULL;
int i = 0;
while (paragraphs[i] != NULL) {
// split sentences of paragraph by '.' and count number of sentences
char** sentences = split_string(paragraphs[i], '.');
int nsen = 0;
while(sentences[nsen] != NULL) {
nsen++;
}
doc[i] = malloc((nsen+1)*sizeof(char**));
// set last position to NULL for the user
// to know when the array ends.
doc[i][nsen] = NULL;
int j = 0;
while (sentences[j] != NULL) {
// remember that doc[0][0] means: paragraph #0,
// sentence #0 and should act like a pointer to
// the first element of an array of words (strings)
// split string by ' ' and associate doc[i][j]
// with the array of strings representing words
// that is returned by split_string.
doc[i][j] = split_string(sentences[j], ' ');
j++;
}
i++;
}
return doc;
}
char* get_input_text() {
int paragraph_count;
scanf("%d", ¶graph_count);
char p[MAX_PARAGRAPHS][MAX_CHARACTERS], doc[MAX_CHARACTERS];
memset(doc, 0, sizeof(doc));
getchar();
for (int i = 0; i < paragraph_count; i++) {
scanf("%[^\n]%*c", p[i]);
strcat(doc, p[i]);
if (i != paragraph_count - 1)
strcat(doc, "\n");
}
char* returnDoc = (char*)malloc((strlen (doc)+1) * (sizeof(char)));
strcpy(returnDoc, doc);
return returnDoc;
}
void print_word(char* word) {
printf("%s", word);
}
void print_sentence(char** sentence) {
int word_count;
scanf("%d", &word_count);
for(int i = 0; i < word_count; i++){
printf("%s", sentence[i]);
if( i != word_count - 1)
printf(" ");
}
}
void print_paragraph(char*** paragraph) {
int sentence_count;
scanf("%d", &sentence_count);
for (int i = 0; i < sentence_count; i++) {
print_sentence(*(paragraph + i));
printf(".");
}
}
int main()
{
char* text = get_input_text();
char**** document = get_document(text);
int q;
scanf("%d", &q);
while (q--) {
int type;
scanf("%d", &type);
if (type == 3){
int k, m, n;
scanf("%d %d %d", &k, &m, &n);
char* word = kth_word_in_mth_sentence_of_nth_paragraph(document, k, m, n);
print_word(word);
}
else if (type == 2){
int k, m;
scanf("%d %d", &k, &m);
char** sentence = kth_sentence_in_mth_paragraph(document, k, m);
print_sentence(sentence);
}
else{
int k;
scanf("%d", &k);
char*** paragraph = kth_paragraph(document, k);
print_paragraph(paragraph);
}
printf("\n");
}
}
|
the_stack_data/192329934.c
|
// this tests some basic void* stuff
extern void echo(int);
int is_null(void* p) {
if(p) {
return 0;
} else {
return 1;
}
}
volatile int* q;
int main() {
int* p;
int x = 1;
int result;
// 1
result = is_null((void*)q);
echo(result);
// 0
result = is_null((void*)&x);
echo(result);
// 0
q = &x;
result = is_null((void*)q);
echo(result);
// unknown
result = is_null((void*)p);
echo(result);
// 0
p = &x;
result = is_null((void*)p);
echo(result);
// 1
p = 0;
result = is_null((void*)p);
echo(result);
return 0;
}
|
the_stack_data/65329.c
|
/* Copyright 2013-2014 Jose Sebastian Battig
*
* All rights reserved. No warranty, explicit or implicit, provided.
*/
|
the_stack_data/45590986.c
|
#include <stdio.h>
#include <time.h>
#include <stdbool.h>
void pause(double);
int main(void)
{
double sec;
int rv = 1;
puts("Enter pause lenght in seconds: (q to quit)");
while (true)
{
rv = scanf("%lf", &sec);
if (rv)
{
fprintf(stdout, "pause for %.2f seconds..", sec);
pause(sec);
puts("Enter next pause: (q to quit)");
}
else break;
}
return 0;
}
void pause(double sec)
{
clock_t start = clock();
clock_t current;
do
{
current = clock();
} while (((double)(current-start)/CLOCKS_PER_SEC) < sec);
puts("done.");
}
|
the_stack_data/898302.c
|
#define _GNU_SOURCE
#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <signal.h>
#include <wait.h>
#include <time.h>
#include <sys/ptrace.h>
#include <elf.h>
#include <sys/user.h>
#include <sys/uio.h>
#include <sys/syscall.h>
#include <math.h>
#include <stdbool.h>
#define MICROSECONDS 1000000
#define NANOSECONDS (MICROSECONDS*1000)
#define NUM_SYSCALLS 512 // this is higher than the real number, but shouldn't matter
#ifndef PID_MAX
#define PID_MAX 32768 // XXX: assumption
#endif
#define NUM_CLKIDS 16 // XXX: incorrect, but "works" anyway
double starttimes[NUM_CLKIDS], delayfactor, timefactor;
bool leavesys[PID_MAX];
void (*before_handlers[NUM_SYSCALLS])(pid_t, struct user_regs_struct *);
void (*after_handlers[NUM_SYSCALLS])(pid_t, struct user_regs_struct *);
int is64bit(pid_t pid) {
struct user_regs_struct x64regs;
struct iovec iov = {
.iov_base = &x64regs,
.iov_len = sizeof(x64regs)
};
ptrace(PTRACE_GETREGSET, pid, NT_PRSTATUS, &iov);
return iov.iov_len == sizeof(x64regs);
}
void read_block(pid_t pid, void * dst, void * src, size_t len) {
for (size_t i = 0; i < len; i += sizeof(void *)) {
*(void **)(dst + i) = (void *)ptrace(PTRACE_PEEKDATA, pid, src + i, NULL); // XXX
}
}
void write_block(pid_t pid, void * src, void * dst, size_t len) {
for (size_t i = 0; i < len; i += sizeof(void *)) {
ptrace(PTRACE_POKEDATA, pid, dst + i, *(void **)(src + i)); // XXX
}
}
void scale_timespec(struct timespec * ts, double factor, double starttime) {
double time = ts->tv_sec + (double)ts->tv_nsec / NANOSECONDS;
if (starttime != 0) {
time = starttime + (time - starttime) * factor;
} else {
time *= factor;
}
ts->tv_sec = time;
ts->tv_nsec = fmod(time, 1) * NANOSECONDS;
}
void scale_timeval(struct timeval * tv, double factor, double starttime) {
double time = tv->tv_sec + (double)tv->tv_usec / MICROSECONDS;
if (starttime != 0) {
time = starttime + (time - starttime) * factor;
} else {
time *= factor;
}
tv->tv_sec = time;
tv->tv_usec = fmod(time, 1) * MICROSECONDS;
}
/* pre-syscall handlers */
void before_nanosleep(pid_t pid, struct user_regs_struct * uregs) {
struct timespec ts;
read_block(pid, &ts, (void *)uregs->rdi, sizeof(struct timespec));
scale_timespec(&ts, 1.0/delayfactor, 0);
write_block(pid, &ts, (void *)uregs->rdi, sizeof(struct timespec));
}
void before_poll(pid_t pid, struct user_regs_struct * uregs) {
int timeout = uregs->rdx & 0xFFFFFFFF; // isolate edx
if (timeout > 0) {
uregs->rdx = timeout / delayfactor; // not sure if this behaves the way I want
}
ptrace(PTRACE_SETREGS, pid, 0, uregs);
}
void before_select(pid_t pid, struct user_regs_struct * uregs) {
if (uregs->r8 != 0) {
struct timeval tv;
read_block(pid, &tv, (void *)uregs->r8, sizeof(struct timeval));
scale_timeval(&tv, 1.0/delayfactor, 0);
write_block(pid, &tv, (void *)uregs->r8, sizeof(struct timeval));
}
}
void before_clock_nanosleep(pid_t pid, struct user_regs_struct * uregs) {
struct timespec rqtp;
read_block(pid, &rqtp, (void *)uregs->rdx, sizeof(struct timespec));
scale_timespec(&rqtp, 1.0/delayfactor, 0);
write_block(pid, &rqtp, (void *)uregs->rdx, sizeof(struct timespec));
}
/* post-syscall handlers */
void after_gettimeofday(pid_t pid, struct user_regs_struct * uregs) {
struct timeval tv;
read_block(pid, &tv, (void *)uregs->rdi, sizeof(struct timeval));
scale_timeval(&tv, timefactor, starttimes[CLOCK_REALTIME]);
write_block(pid, &tv, (void *)uregs->rdi, sizeof(struct timeval));
}
void after_clock_gettime(pid_t pid, struct user_regs_struct * uregs) {
struct timespec ts;
read_block(pid, &ts, (void *)uregs->rsi, sizeof(struct timespec));
scale_timespec(&ts, timefactor, starttimes[uregs->rdi]); // FIXME check bounds
write_block(pid, &ts, (void *)uregs->rsi, sizeof(struct timespec));
}
void after_time(pid_t pid, struct user_regs_struct * uregs) {
uregs->rdi = starttimes[CLOCK_REALTIME] + (uregs->rdi - starttimes[CLOCK_REALTIME]) * timefactor;
ptrace(PTRACE_SETREGS, pid, 0, uregs);
}
void after_clock_nanosleep(pid_t pid, struct user_regs_struct * uregs) {
struct timespec rmtp;
read_block(pid, &rmtp, (void *)uregs->rcx, sizeof(struct timespec));
scale_timespec(&rmtp, 1.0/delayfactor, 0);
write_block(pid, &rmtp, (void *)uregs->rcx, sizeof(struct timespec));
}
int main(int argc, char *argv[], char *envp[]) {
if (argc < 3) {
printf("USAGE: %s DELAY_FACTOR TIME_FACTOR COMMAND [ARGS]...\n", argv[0]);
exit(EXIT_FAILURE);
}
delayfactor = strtod(argv[1], NULL);
timefactor = strtod(argv[2], NULL);
before_handlers[SYS_nanosleep] = before_nanosleep;
before_handlers[SYS_poll] = before_poll;
before_handlers[SYS_select] = before_select;
before_handlers[SYS_clock_nanosleep] = before_clock_nanosleep;
after_handlers[SYS_gettimeofday] = after_gettimeofday;
after_handlers[SYS_clock_gettime] = after_clock_gettime;
after_handlers[SYS_time] = after_time;
after_handlers[SYS_clock_nanosleep] = after_clock_nanosleep;
struct timespec sts;
for (clockid_t id = 0; id < NUM_CLKIDS; id++) {
clock_gettime(id, &sts); // sometimes id will be invalid, but it shouldn't matter
starttimes[id] = sts.tv_sec + (double)sts.tv_nsec / NANOSECONDS;
}
pid_t child = fork();
if(child == 0) {
/* child */
envp[0] = "LD_PRELOAD=./novdso.so"; // FIXME: Do something more sensible
kill(getpid(), SIGSTOP);
execvpe(argv[3], &argv[3], envp);
perror("execvpe"); // execvpe only returns on error
exit(-1);
}
#ifdef DEBUG
fprintf(stderr, "Child spawned with PID %d\n", child);
#endif
ptrace(PTRACE_SEIZE, child, 0, PTRACE_O_TRACESYSGOOD | PTRACE_O_TRACEEXEC | PTRACE_O_EXITKILL | PTRACE_O_TRACEFORK | PTRACE_O_TRACEVFORK | PTRACE_O_TRACECLONE);
wait(NULL); // wait for SIGSTOP to happen
ptrace(PTRACE_SYSCALL, child, 0, 0); // continue execution
if (is64bit(child)) {
#ifdef DEBUG
fprintf(stderr, "Child is 64-bit\n");
#endif
} else {
fprintf(stderr, "ERROR: 32-bit processes are currently unsupported\n");
exit(-1);
}
for (;;) { // TODO: Understand ptrace, simplify code structure
struct user_regs_struct uregs;
int status;
pid_t pid = waitpid(-1, &status, 0);
if (WIFEXITED(status)) {
if (pid == child) {
exit(WEXITSTATUS(status));
} else {
continue;
}
}
if (WIFSTOPPED(status) && WSTOPSIG(status) != SIGTRAP && WSTOPSIG(status) != SIGSTOP) {
if (WSTOPSIG(status) & 0x80) {
// handle syscall
} else {
ptrace(PTRACE_SYSCALL, pid, 0, WSTOPSIG(status));
continue;
}
} else {
ptrace(PTRACE_SYSCALL, pid, 0, 0);
continue;
}
ptrace(PTRACE_GETREGS, pid, 0, &uregs);
if (!leavesys[pid]) {
#ifdef DEBUG
fprintf(stderr, "[pid %d] syscall(%llu)\t0x%016llX 0x%016llX 0x%016llX = ...\n", pid, uregs.orig_rax, uregs.rdi, uregs.rsi, uregs.rdx);
#endif
if (uregs.orig_rax < NUM_SYSCALLS && before_handlers[uregs.orig_rax] != NULL) {
before_handlers[uregs.orig_rax](pid, &uregs);
}
} else {
#ifdef DEBUG
fprintf(stderr, "... 0x%llX\n", uregs.rax);
#endif
if (uregs.orig_rax < NUM_SYSCALLS && after_handlers[uregs.orig_rax] != NULL) {
after_handlers[uregs.orig_rax](pid, &uregs);
}
}
leavesys[pid] ^= true;
ptrace(PTRACE_SYSCALL, pid, 0, 0);
}
}
|
the_stack_data/1113549.c
|
/**
* Triangle Count
*
* You are given an equilateral triangle ΔABC with the side BC being the
* base. Each side of the triangle is of length L. There are L-1
* additional points on each of the sides dividing the sides into equal
* parts of unit lengths. Points on the sides of the triangle are called
* major points. Joining these points with lines parallel to the sides of
* ΔABC will produce some more equilateral triangles. The intersection
* points of these parallel lines are called minor points.
*
* You will be given L, the length of the original triangle ΔABC. You need
* to find out the number of valid equilateral triangles with side length
* exactly K.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void)
{
int test;
scanf("%d",&test);
for(int q = 1; q <= test; q++ ) {
int m,n;
scanf("%d %d",&m,&n);
if(m < n) {
printf("Case %d: 0\n",q);
continue;
}
int t = (m-n)+1;
int val = (t * t + t) / 2;
printf("Case %d: %d\n",q,val);
}
return 0;
}
|
the_stack_data/867708.c
|
/*
############################################################################
# Copyright 2008-2012 Istituto Nazionale di Fisica Nucleare
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
############################################################################
*/
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/statvfs.h>
#include <mntent.h>
#include <fstab.h>
#define NOBODY_UID 99
#define NOBODY_GID 99
int main(int argc,char **argv) {
char *yamssRecallPath="/system/YAMSS_DMRECALL";
char s[4096];
char hname[4096];
int fd;
char rpath[4096];
int i;
struct statvfs vbuf, sbuf;
struct mntent *ent;
FILE *mnttab;
uid_t uid, euid;
gid_t gid, egid;
char s_uid[64];
char s_euid[64];
char s_gid[64];
char s_egid[64];
int rc=0;
if(argc==1) {
fprintf(stderr,"Usage: yamssRecall FILE...\n");
exit(1);
}
/* get user credentials */
uid=getuid();
euid=geteuid();
gid=getgid();
egid=getegid();
sprintf(s_uid,"%d ",uid);
sprintf(s_euid,"%d ",euid);
sprintf(s_gid,"%d ",gid);
sprintf(s_egid,"%d ",egid);
/* get host name */
if(gethostname(hname,4096)) {
fprintf(stderr,"yamssRecall: Error: cannot get hostname. Recall of all files failed\n");
return -1;
}
for(i=1; i<argc; i++) {
/* reset effective uid and gid */
if(setegid(gid)<0) {
perror("setegid");
fprintf(stderr, "yamssRecall: Error: cannot reset gid %d\n", egid);
return 1;
}
if(seteuid(uid)<0) {
perror("seteuid");
fprintf(stderr, "yamssRecall: Error: cannot reset uid %d\n", euid);
return 1;
}
if(!realpath(argv[i],rpath)) {
perror("realpath");
fprintf(stderr,"yamssRecall: Error while calling realpath for file %s. Cannot recall it\n",argv[i]);
rc=1;
continue;
}
if(statvfs(rpath, &vbuf)) {
perror("statvfs");
fprintf(stderr,"yamssRecall: Error: cannot statvfs file %s. Cannot recall it\n",rpath);
rc=1;
continue;
}
/* look for the mount point where the file resides */
mnttab = fopen("/etc/mtab", "r");
ent=getmntent(mnttab);
while(ent) {
if(!statvfs(ent->mnt_dir, &sbuf)) {
if(vbuf.f_fsid==sbuf.f_fsid) {
break;
}
}
ent = getmntent(mnttab);
}
fclose(mnttab);
if(!ent) {
fprintf(stderr,"yamssRecall: Error: cannot find mountpoint for file %s. Cannot recall it\n",rpath);
rc=1;
continue;
}
/* set effective uid and gid to nobody */
if(setegid(NOBODY_GID)<0) {
perror("setegid");
fprintf(stderr, "yamssRecall: Error: cannot set gid to nobody\n");
return 1;
}
if(seteuid(NOBODY_UID)<0) {
perror("seteuid");
fprintf(stderr, "yamssRecall: Error: cannot set uid to nobody\n");
return 1;
}
/* generate temporary file with unique name containing the file to be recalled */
sprintf(s,"%s%s/%s.%d.XXXXXXXX",ent->mnt_dir,yamssRecallPath,hname,getpid());
if((fd=mkstemp(s))<0) {
fprintf(stderr,"yamssRecall: Error: cannot generate temporary file %s for file %s. Cannot recall it\n",s,rpath);
rc=1;
continue;
}
/* write file name into temporary file */
if(write(fd,rpath,strlen(rpath))<0 || write(fd,"\n",1)<0) {
perror("write");
fprintf(stderr,"yamssRecall: Error: cannot write into temporary file %s for file %s. Cannot recall it\n",s,rpath);
close(fd);
if(unlink(s)<0) {
perror("unlink");
fprintf(stderr,"yamssRecall: Error: cannot delete temporary file %s for file %s. Cannot recall it\n",s,rpath);
}
rc=1;
continue;
}
close(fd);
printf("File %s enqueued for recall\n",rpath);
}
return rc;
}
|
the_stack_data/5424.c
|
/* Test deadvars tactic on if statement */
int f(int x, int y, int z) {
int a, b, c, d;
d=2;
b=1;
c=0;
a=x+1;
if (a>0) {
b=x+y;
}
else {
b=x;
c=z;
}
return c+b;
}
int g(int x, int y, int z) {
int a, b, c, d;
d=2;
b=1;
c=0;
a=x+1;
while (a>0) {
b=x;
}
return c+b;
}
|
the_stack_data/155092.c
|
#include<stdio.h>
union n {
int age;
int sal;
};
int main(){
union n n1={10,250};
//error as when defining a union variable, we can only initialize one member
printf("%d",n1.age);
}
|
the_stack_data/6387974.c
|
#include <stdio.h>
int main() {
int j;
char days[7][10] = {"Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday"};
for (j = 0; j <= 6; j++)
printf("%s\n", days[j]);
printf("%c", days[1][3]);
return 0;
}
|
the_stack_data/51699115.c
|
/*
Author : Arnob Mahmud
mail : [email protected]
*/
#include <stdio.h>
int main(int argc, char const *argv[])
{
float atd_cls, total_cls, atd;
printf("Enter attended classes & total classes : \n");
scanf("%f %f", &atd_cls, &total_cls);
atd = (atd_cls / total_cls) * 100;
//printf("Attendence percentage is : %.2f\n", atd);
if (atd >= 90)
{
printf("8");
}
else if (atd >= 85)
{
printf("7");
}
else if (atd >= 80)
{
printf("6");
}
else if (atd >= 75)
{
printf("5");
}
else if (atd >= 70)
{
printf("4");
}
else if (atd >= 65)
{
printf("3");
}
else if (atd >= 60)
{
printf("2");
}
else
{
printf("0");
}
return 0;
}
|
the_stack_data/68887227.c
|
// Warning: This is a generated file, do not edit it!
#include <stdint.h>
#include <stddef.h>
const char logo_allnet_png[] = {
0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a, 0x00, 0x00, 0x00, 0x0d,
0x49, 0x48, 0x44, 0x52, 0x00, 0x00, 0x00, 0x99, 0x00, 0x00, 0x00, 0x37,
0x08, 0x06, 0x00, 0x00, 0x00, 0x1f, 0x4a, 0xe8, 0x24, 0x00, 0x00, 0x01,
0x84, 0x69, 0x43, 0x43, 0x50, 0x49, 0x43, 0x43, 0x20, 0x70, 0x72, 0x6f,
0x66, 0x69, 0x6c, 0x65, 0x00, 0x00, 0x28, 0x91, 0x7d, 0x91, 0x3d, 0x48,
0xc3, 0x40, 0x1c, 0xc5, 0x5f, 0x3f, 0xb4, 0x22, 0x15, 0x11, 0x3b, 0x88,
0x28, 0x64, 0xa8, 0x4e, 0x16, 0x44, 0x45, 0x1c, 0xb5, 0x0a, 0x45, 0xa8,
0x10, 0x6a, 0x85, 0x56, 0x1d, 0x4c, 0x2e, 0xfd, 0x82, 0x26, 0x0d, 0x49,
0x8a, 0x8b, 0xa3, 0xe0, 0x5a, 0x70, 0xf0, 0x63, 0xb1, 0xea, 0xe0, 0xe2,
0xac, 0xab, 0x83, 0xab, 0x20, 0x08, 0x7e, 0x80, 0x38, 0x3a, 0x39, 0x29,
0xba, 0x48, 0x89, 0xff, 0x4b, 0x0a, 0x2d, 0x62, 0x3c, 0x38, 0xee, 0xc7,
0xbb, 0x7b, 0x8f, 0xbb, 0x77, 0x80, 0xbf, 0x5e, 0x66, 0xaa, 0x19, 0x1c,
0x07, 0x54, 0xcd, 0x32, 0x52, 0x89, 0xb8, 0x90, 0xc9, 0xae, 0x0a, 0xa1,
0x57, 0x04, 0xd1, 0x89, 0x30, 0xfa, 0x30, 0x2c, 0x31, 0x53, 0x9f, 0x13,
0xc5, 0x24, 0x3c, 0xc7, 0xd7, 0x3d, 0x7c, 0x7c, 0xbd, 0x8b, 0xf1, 0x2c,
0xef, 0x73, 0x7f, 0x8e, 0x1e, 0x25, 0x67, 0x32, 0xc0, 0x27, 0x10, 0xcf,
0x32, 0xdd, 0xb0, 0x88, 0x37, 0x88, 0xa7, 0x37, 0x2d, 0x9d, 0xf3, 0x3e,
0x71, 0x84, 0x15, 0x25, 0x85, 0xf8, 0x9c, 0x78, 0xcc, 0xa0, 0x0b, 0x12,
0x3f, 0x72, 0x5d, 0x76, 0xf9, 0x8d, 0x73, 0xc1, 0x61, 0x3f, 0xcf, 0x8c,
0x18, 0xe9, 0xd4, 0x3c, 0x71, 0x84, 0x58, 0x28, 0xb4, 0xb1, 0xdc, 0xc6,
0xac, 0x68, 0xa8, 0xc4, 0x53, 0xc4, 0x51, 0x45, 0xd5, 0x28, 0xdf, 0x9f,
0x71, 0x59, 0xe1, 0xbc, 0xc5, 0x59, 0x2d, 0x57, 0x59, 0xf3, 0x9e, 0xfc,
0x85, 0xe1, 0x9c, 0xb6, 0xb2, 0xcc, 0x75, 0x9a, 0x43, 0x48, 0x60, 0x11,
0x4b, 0x10, 0x21, 0x40, 0x46, 0x15, 0x25, 0x94, 0x61, 0x21, 0x46, 0xab,
0x46, 0x8a, 0x89, 0x14, 0xed, 0xc7, 0x3d, 0xfc, 0x83, 0x8e, 0x5f, 0x24,
0x97, 0x4c, 0xae, 0x12, 0x18, 0x39, 0x16, 0x50, 0x81, 0x0a, 0xc9, 0xf1,
0x83, 0xff, 0xc1, 0xef, 0x6e, 0xcd, 0xfc, 0xe4, 0x84, 0x9b, 0x14, 0x8e,
0x03, 0x1d, 0x2f, 0xb6, 0xfd, 0x31, 0x02, 0x84, 0x76, 0x81, 0x46, 0xcd,
0xb6, 0xbf, 0x8f, 0x6d, 0xbb, 0x71, 0x02, 0x04, 0x9e, 0x81, 0x2b, 0xad,
0xe5, 0xaf, 0xd4, 0x81, 0x99, 0x4f, 0xd2, 0x6b, 0x2d, 0x2d, 0x7a, 0x04,
0xf4, 0x6e, 0x03, 0x17, 0xd7, 0x2d, 0x4d, 0xde, 0x03, 0x2e, 0x77, 0x80,
0x81, 0x27, 0x5d, 0x32, 0x24, 0x47, 0x0a, 0xd0, 0xf4, 0xe7, 0xf3, 0xc0,
0xfb, 0x19, 0x7d, 0x53, 0x16, 0xe8, 0xbf, 0x05, 0xba, 0xd7, 0xdc, 0xde,
0x9a, 0xfb, 0x38, 0x7d, 0x00, 0xd2, 0xd4, 0x55, 0xf2, 0x06, 0x38, 0x38,
0x04, 0x46, 0x0b, 0x94, 0xbd, 0xee, 0xf1, 0xee, 0xae, 0xf6, 0xde, 0xfe,
0x3d, 0xd3, 0xec, 0xef, 0x07, 0x18, 0xf7, 0x72, 0x83, 0x48, 0x1c, 0xa3,
0x49, 0x00, 0x00, 0x00, 0x06, 0x62, 0x4b, 0x47, 0x44, 0x00, 0xff, 0x00,
0xff, 0x00, 0xff, 0xa0, 0xbd, 0xa7, 0x93, 0x00, 0x00, 0x00, 0x09, 0x70,
0x48, 0x59, 0x73, 0x00, 0x00, 0x2e, 0x23, 0x00, 0x00, 0x2e, 0x23, 0x01,
0x78, 0xa5, 0x3f, 0x76, 0x00, 0x00, 0x00, 0x07, 0x74, 0x49, 0x4d, 0x45,
0x07, 0xe6, 0x04, 0x06, 0x0c, 0x15, 0x27, 0x47, 0x87, 0x01, 0x38, 0x00,
0x00, 0x00, 0x19, 0x74, 0x45, 0x58, 0x74, 0x43, 0x6f, 0x6d, 0x6d, 0x65,
0x6e, 0x74, 0x00, 0x43, 0x72, 0x65, 0x61, 0x74, 0x65, 0x64, 0x20, 0x77,
0x69, 0x74, 0x68, 0x20, 0x47, 0x49, 0x4d, 0x50, 0x57, 0x81, 0x0e, 0x17,
0x00, 0x00, 0x20, 0x00, 0x49, 0x44, 0x41, 0x54, 0x78, 0xda, 0xcd, 0xbd,
0x57, 0x70, 0x64, 0xd7, 0x99, 0xe7, 0xf9, 0x3b, 0xf7, 0xa6, 0x03, 0x12,
0x09, 0x20, 0x33, 0xe1, 0xbd, 0x37, 0xe5, 0x50, 0xde, 0xb3, 0x8a, 0x5e,
0x22, 0x45, 0x52, 0xa2, 0xa8, 0x96, 0xd4, 0x6a, 0x33, 0xdd, 0x3d, 0xae,
0x37, 0x66, 0x1e, 0x26, 0x26, 0x76, 0xf7, 0x6d, 0x63, 0x35, 0xb1, 0x2f,
0xfb, 0x30, 0xbb, 0x11, 0x33, 0x4f, 0xbb, 0xe3, 0x7a, 0x26, 0x66, 0x7b,
0xb4, 0x1a, 0x4d, 0x8f, 0x5c, 0x4b, 0xa4, 0x28, 0x8a, 0x46, 0x34, 0x45,
0xb2, 0x0c, 0xcb, 0xa1, 0x0a, 0x28, 0x14, 0x3c, 0x90, 0x00, 0xd2, 0x7b,
0x7f, 0xef, 0xd9, 0x87, 0x7b, 0xd3, 0x02, 0x28, 0x96, 0x48, 0xcd, 0xc4,
0x66, 0x30, 0x59, 0x89, 0xcc, 0x9b, 0x37, 0xef, 0x3d, 0xe7, 0x3b, 0xdf,
0xf7, 0xff, 0xfe, 0x9f, 0x39, 0x62, 0xe8, 0xc4, 0xff, 0x2a, 0x01, 0x84,
0x10, 0x94, 0x1e, 0x42, 0x08, 0x74, 0x24, 0x92, 0xea, 0x87, 0x28, 0x1f,
0x23, 0xa5, 0x2c, 0x1f, 0x67, 0x1c, 0xa4, 0x98, 0x9f, 0x95, 0x9e, 0xbf,
0xcb, 0x43, 0x9a, 0xcf, 0x3d, 0x3e, 0x91, 0x55, 0xef, 0x0b, 0xfd, 0x31,
0xce, 0x63, 0xfc, 0x23, 0xa4, 0xdc, 0xf3, 0x5a, 0x2b, 0xe7, 0x13, 0x35,
0xf7, 0x5b, 0x39, 0x83, 0x40, 0x9a, 0xd7, 0x5f, 0xfe, 0xbe, 0xa8, 0xdc,
0x9b, 0x40, 0x01, 0x40, 0x17, 0xa5, 0xbf, 0x94, 0x9a, 0x6b, 0xac, 0x19,
0x03, 0x45, 0xad, 0xfa, 0x0d, 0x51, 0xfe, 0x4d, 0x59, 0xf7, 0x37, 0x42,
0xa9, 0xbb, 0xa6, 0xfa, 0xeb, 0x52, 0xf6, 0xbc, 0x56, 0xa4, 0x62, 0xfe,
0x53, 0x7b, 0xbd, 0xc6, 0x95, 0x89, 0xca, 0x69, 0xa4, 0xd8, 0xff, 0x7e,
0xab, 0xc6, 0xc9, 0xf8, 0x5b, 0x07, 0x21, 0xeb, 0xc6, 0x5e, 0xd6, 0xcc,
0x93, 0xf1, 0xb6, 0x40, 0x08, 0xc5, 0x1c, 0x0f, 0x01, 0x28, 0x95, 0xcf,
0xb5, 0x22, 0x92, 0x02, 0x50, 0x34, 0xce, 0x25, 0x05, 0x96, 0xfd, 0x26,
0x57, 0x56, 0x5d, 0x93, 0xaa, 0x2a, 0x58, 0x54, 0x15, 0x45, 0x55, 0x91,
0x52, 0xd2, 0xe9, 0x6d, 0xc4, 0xe5, 0xb4, 0xa3, 0x28, 0x02, 0x84, 0x20,
0x9e, 0x28, 0x10, 0x08, 0xa7, 0xca, 0x37, 0xae, 0xe9, 0x12, 0x5d, 0xd7,
0x29, 0x6a, 0xfa, 0x7e, 0xf2, 0xf3, 0x58, 0x8f, 0x5a, 0xc1, 0xf8, 0xdd,
0x1f, 0xd5, 0xdf, 0xad, 0x3d, 0x8f, 0x7c, 0xec, 0xc5, 0x60, 0x8c, 0xb9,
0x34, 0x0f, 0x37, 0xbe, 0xa7, 0x7c, 0xee, 0xd7, 0xc5, 0x17, 0xbd, 0xe3,
0xc7, 0x3c, 0x8f, 0x30, 0xff, 0x13, 0x7b, 0x0e, 0xaf, 0x44, 0x1a, 0x82,
0xf6, 0x08, 0x81, 0xfa, 0xfd, 0x8c, 0x7d, 0x69, 0x20, 0xaa, 0x16, 0x9a,
0x22, 0x40, 0x57, 0x8c, 0xc5, 0x6a, 0xbe, 0x6d, 0xd9, 0xf7, 0x22, 0x24,
0x34, 0x39, 0x6d, 0xf4, 0x76, 0xb9, 0x18, 0xea, 0xf7, 0xd2, 0xdf, 0xeb,
0xa5, 0xd9, 0xd5, 0x40, 0x2e, 0x5f, 0x20, 0x12, 0x4d, 0x53, 0xd4, 0x74,
0xba, 0xda, 0x5d, 0x74, 0x76, 0x34, 0xb3, 0xb0, 0x14, 0xa2, 0xb9, 0xc9,
0x8e, 0xd5, 0x66, 0x45, 0x2b, 0xea, 0xf8, 0x83, 0x49, 0xfc, 0xc1, 0x04,
0xc1, 0x40, 0x82, 0x64, 0x3a, 0x47, 0x24, 0x9e, 0x23, 0x9e, 0xc8, 0x53,
0xd4, 0x74, 0x84, 0xf8, 0xdd, 0x05, 0xcd, 0x58, 0x41, 0x8a, 0x39, 0xe3,
0xf2, 0x77, 0x16, 0xb0, 0xbd, 0x3f, 0xd7, 0x11, 0x65, 0x2d, 0x62, 0x1e,
0x5f, 0x52, 0x24, 0xd5, 0x2b, 0x0c, 0x63, 0x35, 0x56, 0x84, 0xcc, 0x9c,
0x64, 0xf9, 0x25, 0x64, 0xe9, 0xb1, 0x1e, 0xca, 0x3e, 0xe2, 0xf5, 0x28,
0x8b, 0x21, 0xbe, 0xb0, 0x50, 0xd5, 0xde, 0x97, 0xdc, 0xe3, 0x9c, 0xa2,
0xce, 0xea, 0x48, 0x8c, 0xc9, 0xd4, 0x41, 0x56, 0xb4, 0xbd, 0x44, 0x20,
0x14, 0x05, 0xa4, 0x82, 0x94, 0x5a, 0xad, 0x90, 0x55, 0x5f, 0x98, 0xc5,
0xa2, 0x70, 0x62, 0xa6, 0x87, 0x91, 0xc1, 0x4e, 0x5a, 0x5b, 0x1c, 0x34,
0x39, 0xed, 0x64, 0x73, 0x1a, 0xff, 0xcf, 0xdf, 0x5c, 0x23, 0x1a, 0xcf,
0xa0, 0xeb, 0x86, 0x51, 0x69, 0x72, 0xda, 0xf9, 0xfa, 0x57, 0x0e, 0xb1,
0xbd, 0x93, 0xe0, 0x87, 0x9f, 0xac, 0x20, 0x25, 0x58, 0x54, 0x95, 0x9e,
0x8e, 0x26, 0xfa, 0x7b, 0x5b, 0xf9, 0xe3, 0x6f, 0x9f, 0x24, 0x99, 0xca,
0x33, 0xbf, 0x18, 0x40, 0x2b, 0x16, 0x88, 0xc6, 0x32, 0xdc, 0x9d, 0x0f,
0xb0, 0x15, 0x48, 0x56, 0xae, 0xf1, 0x91, 0x26, 0x56, 0xaf, 0xbd, 0x41,
0x29, 0xea, 0x06, 0xe0, 0xcb, 0x3d, 0xa4, 0xd4, 0x6b, 0x7e, 0x5f, 0x52,
0xd1, 0x5a, 0x52, 0x96, 0x56, 0x73, 0x69, 0x2c, 0xa5, 0xa9, 0xa8, 0xcd,
0xeb, 0x40, 0xf9, 0x9d, 0x17, 0xcc, 0x17, 0xd1, 0xe4, 0xf5, 0x50, 0xa6,
0x64, 0x2d, 0x76, 0x1f, 0x27, 0x76, 0x7d, 0xef, 0x0b, 0x6b, 0x53, 0x73,
0x9c, 0x85, 0xa8, 0x86, 0x1b, 0x20, 0x65, 0xad, 0xd6, 0x92, 0x75, 0xb0,
0xc4, 0x30, 0xff, 0x25, 0xc8, 0xa1, 0x62, 0xda, 0x56, 0xd4, 0xd6, 0x9e,
0x27, 0xbf, 0x5f, 0xfd, 0x13, 0x5e, 0xb7, 0x93, 0x17, 0x9e, 0x99, 0xa6,
0xdd, 0xdb, 0xcc, 0xea, 0x46, 0x90, 0x5f, 0xfc, 0xe6, 0x3e, 0x37, 0xef,
0x6e, 0x32, 0xd0, 0xeb, 0x66, 0x6a, 0xb4, 0x83, 0x85, 0xa5, 0x00, 0x99,
0x6c, 0x01, 0x5d, 0x97, 0xe4, 0xf2, 0x45, 0x22, 0xd1, 0x34, 0x67, 0x4f,
0x0c, 0x11, 0x8d, 0xa5, 0xf1, 0x07, 0x52, 0x14, 0x8a, 0x1a, 0xe1, 0x58,
0x86, 0xd5, 0x8d, 0x28, 0xe1, 0x70, 0x92, 0xd6, 0x96, 0x06, 0xae, 0xdf,
0xda, 0xa0, 0xc1, 0x61, 0xa1, 0xb1, 0xc1, 0xce, 0xd0, 0x40, 0x1b, 0x67,
0x8f, 0xf5, 0xd1, 0x60, 0xb7, 0x90, 0x48, 0xe6, 0xd1, 0x74, 0xf9, 0x08,
0xad, 0x53, 0xb9, 0xa9, 0x7a, 0x7c, 0xb3, 0x9f, 0xb0, 0x89, 0x7d, 0x26,
0xaa, 0x82, 0xeb, 0xc4, 0xfe, 0x6a, 0x5f, 0x40, 0x59, 0x72, 0x44, 0xb5,
0xe8, 0x19, 0x98, 0xa6, 0x8c, 0x75, 0x4a, 0x97, 0x20, 0xd4, 0x7d, 0x26,
0xdb, 0x18, 0xec, 0xbd, 0x30, 0xd9, 0xae, 0xbf, 0xab, 0xb1, 0x54, 0xf9,
0x75, 0x2d, 0x0e, 0x13, 0xe6, 0xf9, 0x6a, 0x05, 0xac, 0x1a, 0xd3, 0x55,
0x84, 0xb1, 0x7c, 0x0d, 0x65, 0xed, 0xbb, 0x7b, 0x11, 0xd7, 0xe3, 0xef,
0xfd, 0x4d, 0xb2, 0x2c, 0x9f, 0xb3, 0x34, 0x45, 0xe5, 0xe1, 0xa9, 0x19,
0x57, 0x51, 0x65, 0x9e, 0x85, 0x29, 0x90, 0xa5, 0x91, 0x93, 0xb5, 0x42,
0xe6, 0x6e, 0x69, 0xe0, 0x4f, 0xbe, 0x7d, 0x8a, 0xc9, 0xd1, 0x4e, 0x7e,
0xf1, 0x9b, 0x7b, 0xdc, 0xbc, 0xb7, 0x45, 0xa1, 0xa8, 0x93, 0xcb, 0x17,
0x59, 0x5e, 0x0b, 0xd1, 0xd2, 0xe2, 0xe0, 0xc8, 0x81, 0x1e, 0x36, 0xb7,
0xa3, 0xe4, 0xf3, 0x1a, 0x4d, 0x8d, 0x36, 0x24, 0x12, 0x55, 0x55, 0x78,
0xfa, 0xc2, 0x18, 0xb1, 0x58, 0x86, 0x46, 0x87, 0x85, 0xe6, 0x26, 0x1b,
0x76, 0x9b, 0x4a, 0x36, 0xab, 0x31, 0xd8, 0xef, 0x61, 0xc7, 0x1f, 0xe7,
0xfd, 0xab, 0xeb, 0x2c, 0xad, 0x46, 0xd8, 0xf2, 0xc7, 0x09, 0x04, 0x93,
0x0c, 0xf6, 0x7b, 0xf9, 0xc6, 0x0b, 0x07, 0x71, 0xb7, 0x34, 0xa0, 0x6b,
0x1a, 0x5a, 0x51, 0x27, 0x57, 0xd0, 0x1f, 0x53, 0xd0, 0xd8, 0x5f, 0xc8,
0x6a, 0x17, 0xdb, 0xee, 0xef, 0x88, 0x47, 0x60, 0x9d, 0x9a, 0x49, 0xaf,
0xc5, 0x1c, 0xc2, 0x74, 0x00, 0x2a, 0x5f, 0x17, 0x8f, 0x10, 0x32, 0x40,
0x28, 0x5f, 0x40, 0xc8, 0x94, 0x3d, 0x8e, 0xa5, 0x0a, 0x60, 0xb3, 0x5b,
0x98, 0x44, 0xf5, 0xdf, 0x94, 0x1d, 0x14, 0x21, 0xaa, 0xaf, 0xff, 0x8b,
0x08, 0xd9, 0x7e, 0xb0, 0x50, 0xec, 0xd6, 0xe0, 0x35, 0xbf, 0x6d, 0x8c,
0xb3, 0xa1, 0x38, 0x4c, 0x57, 0xaa, 0xe4, 0x5d, 0x3a, 0xec, 0x16, 0xbe,
0xf6, 0xdc, 0x01, 0x84, 0x50, 0x88, 0xc6, 0xd2, 0x8c, 0x0d, 0x77, 0x70,
0xef, 0x81, 0x8f, 0x8f, 0xae, 0xae, 0x1a, 0x58, 0x0a, 0xb0, 0xdb, 0xad,
0xbc, 0xf4, 0xfc, 0x01, 0x46, 0x87, 0xda, 0x58, 0x59, 0x0d, 0x90, 0xc9,
0x83, 0xd5, 0xaa, 0xd0, 0xe6, 0x76, 0x32, 0xd8, 0xe7, 0xa6, 0xa5, 0xd9,
0xc9, 0xdc, 0xc3, 0x1d, 0x12, 0xc9, 0x1c, 0xa9, 0x74, 0x81, 0x6c, 0xae,
0xc8, 0xd4, 0x58, 0x3b, 0x02, 0xc9, 0x27, 0x37, 0x56, 0x59, 0xdd, 0x8c,
0xb1, 0xb6, 0x15, 0x47, 0xd3, 0x24, 0x16, 0x8b, 0xc2, 0x1f, 0xbd, 0x3a,
0x43, 0x2e, 0xa7, 0xe1, 0x6d, 0x6d, 0x24, 0x9a, 0xcc, 0x92, 0x8c, 0xa7,
0xb9, 0x7e, 0xd7, 0xc7, 0xfa, 0x76, 0xa2, 0xec, 0xb3, 0x94, 0xa1, 0x6c,
0x8d, 0xb6, 0xdb, 0xed, 0xfb, 0x96, 0x24, 0x4b, 0x61, 0x7f, 0xd8, 0x26,
0xab, 0x7c, 0xbb, 0xbd, 0x04, 0x4d, 0xee, 0xd2, 0x98, 0x54, 0x99, 0xd2,
0x2a, 0x2f, 0xb3, 0x24, 0x1c, 0x42, 0x31, 0x7f, 0xab, 0x24, 0x2c, 0x4a,
0xd5, 0x80, 0x2b, 0xbb, 0x26, 0xbf, 0x72, 0x9c, 0xa8, 0xf1, 0x26, 0x65,
0x59, 0x70, 0x2c, 0xe6, 0x9c, 0x29, 0x55, 0xe0, 0xbb, 0x6a, 0x91, 0xa1,
0x20, 0x45, 0xdd, 0x24, 0xef, 0xf2, 0x48, 0xab, 0x4d, 0xab, 0x78, 0xa4,
0x19, 0x7e, 0x94, 0xa7, 0x2f, 0xeb, 0xc6, 0x75, 0xb7, 0xe3, 0x54, 0x7f,
0x52, 0xc5, 0x70, 0x26, 0xa5, 0x8a, 0x10, 0x12, 0x89, 0x8e, 0xd4, 0x35,
0x84, 0x2c, 0x18, 0x9a, 0x4c, 0x08, 0xc1, 0x81, 0xf1, 0x4e, 0x46, 0x06,
0xdb, 0xf8, 0xc5, 0xaf, 0x67, 0xb9, 0xf7, 0xc0, 0x4f, 0x3a, 0x9d, 0xe5,
0xf0, 0x74, 0x1f, 0x23, 0x03, 0x1e, 0xb6, 0x03, 0x71, 0x40, 0x70, 0xe2,
0x70, 0x2f, 0x43, 0x03, 0x6d, 0xb4, 0xb6, 0x34, 0x70, 0x68, 0xba, 0x97,
0x1b, 0xb7, 0xd7, 0xb9, 0x7e, 0x6b, 0x83, 0xf7, 0x3f, 0x59, 0xe5, 0xe3,
0xeb, 0x6b, 0x38, 0x9d, 0x76, 0x16, 0x57, 0x42, 0xfc, 0xfc, 0xcd, 0x39,
0x36, 0x7c, 0x31, 0x52, 0xa9, 0x1c, 0xa9, 0x74, 0x8e, 0x63, 0x87, 0xfa,
0xd0, 0x24, 0xb4, 0xb7, 0xb9, 0x38, 0x3c, 0xdd, 0x45, 0x5f, 0x77, 0x0b,
0x9a, 0xa6, 0xe3, 0x6c, 0xb4, 0xb3, 0x15, 0x48, 0xf0, 0xc6, 0xbb, 0x0f,
0x90, 0xba, 0x4e, 0x4f, 0x57, 0x0b, 0x63, 0x23, 0xed, 0x0c, 0xf6, 0xb5,
0x92, 0x48, 0xe4, 0xc8, 0xe6, 0x34, 0x74, 0x5d, 0xee, 0x33, 0x30, 0xb2,
0x4e, 0x01, 0x55, 0x26, 0x74, 0x7f, 0x03, 0x20, 0xaa, 0x80, 0xf3, 0xa3,
0x17, 0x6d, 0x49, 0x6b, 0x89, 0x8a, 0x2e, 0x33, 0x35, 0x5a, 0x95, 0xe0,
0x88, 0xea, 0x63, 0x0d, 0x8f, 0x4a, 0xec, 0x61, 0xfe, 0x84, 0x10, 0xe5,
0xf9, 0x16, 0x75, 0x42, 0x26, 0xab, 0x84, 0xad, 0x72, 0xbc, 0x52, 0x65,
0x26, 0x95, 0x2a, 0x21, 0x13, 0xa0, 0xd4, 0x6b, 0x25, 0x65, 0x4f, 0xa7,
0x41, 0x3c, 0xc2, 0x2b, 0xf9, 0x3c, 0x13, 0x59, 0x5e, 0x0b, 0xc8, 0xc7,
0xd6, 0x78, 0xc6, 0x2d, 0x54, 0x7e, 0xb7, 0x32, 0x7a, 0x9a, 0x21, 0x64,
0x0e, 0xbb, 0x95, 0xa7, 0x9f, 0x98, 0x60, 0x7e, 0x61, 0x9b, 0x85, 0xe5,
0x10, 0x42, 0x40, 0x30, 0x92, 0x66, 0x75, 0x33, 0x4c, 0x57, 0x87, 0x8b,
0x67, 0x9e, 0x98, 0xe2, 0xf4, 0xb1, 0x01, 0xac, 0x56, 0x0b, 0x1f, 0x7d,
0xba, 0xcc, 0xdb, 0x1f, 0x3d, 0x64, 0xc3, 0x17, 0x65, 0x74, 0xa8, 0x8d,
0xb5, 0x8d, 0x30, 0x89, 0x64, 0x81, 0x7c, 0x41, 0xc3, 0x1f, 0x48, 0x71,
0xf9, 0xfc, 0x28, 0xc9, 0x44, 0x96, 0x8d, 0xed, 0x38, 0x91, 0x58, 0x96,
0x95, 0x8d, 0x28, 0x8a, 0x02, 0x9a, 0x84, 0xdf, 0x7e, 0xb2, 0xcc, 0x8e,
0x3f, 0x81, 0xd5, 0xaa, 0x72, 0xe9, 0xec, 0x30, 0x93, 0x63, 0x1d, 0x74,
0x7a, 0x9d, 0x2c, 0xaf, 0x85, 0x58, 0xdd, 0x8c, 0x31, 0xfb, 0x60, 0x87,
0x2d, 0x7f, 0x82, 0x26, 0xa7, 0x8d, 0xaf, 0x3e, 0x35, 0x85, 0xbb, 0xd9,
0x41, 0x3a, 0x9d, 0x27, 0x9d, 0x29, 0xa2, 0xcb, 0xca, 0x04, 0x97, 0x2d,
0x85, 0xd8, 0x8b, 0x5b, 0x12, 0x8f, 0xe5, 0xf4, 0xd5, 0xe3, 0xc0, 0xda,
0x41, 0xdc, 0xcd, 0x2b, 0x49, 0xb1, 0x5b, 0x70, 0x10, 0xb5, 0x1a, 0x89,
0xaa, 0x09, 0xaf, 0xbe, 0x2e, 0xe3, 0x58, 0x6a, 0xcc, 0x21, 0x75, 0xc2,
0x25, 0x6a, 0xb0, 0x95, 0x52, 0x35, 0xe9, 0xa2, 0xbc, 0x38, 0xaa, 0x85,
0x75, 0x2f, 0xb3, 0x6a, 0xbc, 0xab, 0x3e, 0x72, 0x21, 0x7d, 0xbe, 0xc0,
0x54, 0x5d, 0x1f, 0x26, 0x17, 0x26, 0x45, 0x95, 0xe0, 0x95, 0xc6, 0xaf,
0xf2, 0x77, 0xc5, 0x01, 0x10, 0x65, 0x58, 0x61, 0x2c, 0x48, 0x83, 0xb3,
0x54, 0x5b, 0x7b, 0x9e, 0xfc, 0x7e, 0x6b, 0x4b, 0x03, 0xdf, 0x7a, 0xe9,
0x28, 0xeb, 0xbe, 0x30, 0xe1, 0x48, 0x86, 0x6c, 0xbe, 0x88, 0x10, 0x82,
0x6c, 0xb6, 0x48, 0x24, 0x96, 0xe1, 0xe4, 0x4c, 0x3f, 0xbd, 0xdd, 0xad,
0xcc, 0xce, 0x6f, 0x73, 0x7b, 0x6e, 0x8b, 0x78, 0x2a, 0xc7, 0x76, 0x20,
0x81, 0xbb, 0xd9, 0xce, 0xe5, 0xf3, 0x13, 0x44, 0xa3, 0x69, 0x42, 0x91,
0x34, 0xa9, 0x74, 0x81, 0x54, 0x32, 0xcb, 0xd3, 0x97, 0xc6, 0xd9, 0xda,
0x8e, 0x11, 0x8d, 0xe7, 0x90, 0x40, 0x38, 0x92, 0xe6, 0xc9, 0x0b, 0x23,
0xdc, 0x9b, 0xdf, 0x66, 0x63, 0x2b, 0xce, 0x96, 0x3f, 0xc1, 0xad, 0xfb,
0xdb, 0xac, 0x6e, 0x44, 0xf8, 0xda, 0xb3, 0xd3, 0x34, 0xbb, 0x1a, 0xe8,
0x6a, 0x73, 0xd2, 0xd8, 0x60, 0x61, 0xcd, 0x17, 0x67, 0x65, 0x3d, 0xc2,
0xdd, 0xf9, 0x1d, 0x4e, 0x1e, 0xe9, 0xe5, 0xb9, 0x27, 0x27, 0x69, 0x6a,
0xb0, 0x50, 0x2c, 0x68, 0x44, 0xe3, 0x99, 0xcf, 0x05, 0x0f, 0x42, 0x7c,
0xbe, 0x98, 0xed, 0xe5, 0x68, 0x3c, 0xae, 0x90, 0x95, 0xf0, 0x59, 0x49,
0xc8, 0x6b, 0x85, 0x4c, 0x3c, 0x5a, 0xc8, 0x6a, 0x74, 0xa3, 0xa8, 0x80,
0xe6, 0x5d, 0x8b, 0x45, 0xec, 0xd2, 0x78, 0xe5, 0xeb, 0x51, 0x6a, 0x75,
0xae, 0xa2, 0x08, 0x9a, 0x9c, 0x16, 0x9a, 0x9c, 0x56, 0x74, 0x4d, 0xa0,
0xe9, 0x7c, 0xa9, 0xc7, 0xbe, 0x02, 0x58, 0x27, 0x60, 0xbb, 0xe0, 0x98,
0xb9, 0x38, 0x84, 0x49, 0xcc, 0x8a, 0x2a, 0x70, 0xac, 0xb6, 0x76, 0x3f,
0xf9, 0xfd, 0xfe, 0x3e, 0x37, 0x6d, 0x1e, 0x27, 0x08, 0xc1, 0xc1, 0xa9,
0x6e, 0x9a, 0x1a, 0xad, 0x84, 0x22, 0x69, 0x10, 0x82, 0xf3, 0x27, 0x07,
0xc9, 0x17, 0x34, 0x7e, 0xf1, 0xeb, 0x59, 0xc6, 0x47, 0xda, 0x19, 0x1e,
0xf4, 0x12, 0x8a, 0xa6, 0x48, 0xa4, 0x72, 0xac, 0x6e, 0x44, 0x70, 0x39,
0x6d, 0x1c, 0x3b, 0x3c, 0x40, 0xb3, 0xcb, 0xce, 0xe1, 0xa9, 0x2e, 0x7a,
0xbb, 0x5b, 0x19, 0x1b, 0x6e, 0xe3, 0xcc, 0x89, 0x01, 0xfa, 0xbb, 0x9a,
0x19, 0x1d, 0xf2, 0x30, 0x31, 0xd2, 0x46, 0xb3, 0xab, 0x81, 0xa1, 0xbe,
0x56, 0x96, 0x56, 0xc3, 0x14, 0x35, 0x1d, 0x4d, 0xd3, 0x49, 0xa4, 0x72,
0x8c, 0x0c, 0x78, 0xf9, 0xf1, 0x2f, 0xef, 0xe2, 0x69, 0x6d, 0xa0, 0xaf,
0xd7, 0xc3, 0xc1, 0xc9, 0x4e, 0x04, 0x12, 0x7f, 0x38, 0x85, 0xbb, 0xd9,
0x86, 0xa6, 0x49, 0xf2, 0x05, 0x8d, 0xf1, 0xd1, 0x0e, 0x7a, 0x3a, 0x5d,
0xf8, 0x83, 0x29, 0xf2, 0x05, 0x9d, 0x2a, 0xf2, 0xbe, 0x56, 0x38, 0x64,
0xdd, 0x28, 0x3c, 0x26, 0x77, 0xf6, 0x79, 0xe6, 0x40, 0x56, 0x9b, 0x5c,
0x51, 0xe3, 0x7e, 0xee, 0x61, 0xfa, 0xf6, 0x10, 0x54, 0x33, 0x3a, 0xb2,
0x0b, 0xf3, 0x55, 0x0b, 0x59, 0x95, 0x47, 0x58, 0xa6, 0x06, 0xcc, 0xdf,
0x13, 0x7b, 0x38, 0x14, 0xaa, 0xaa, 0x30, 0x33, 0xe5, 0xe1, 0xdc, 0xf1,
0x2e, 0xba, 0xdb, 0x1b, 0x39, 0x30, 0xe6, 0x26, 0x16, 0xcb, 0x93, 0x48,
0x17, 0xcb, 0xcc, 0xfc, 0xde, 0xcf, 0xc7, 0x17, 0xb2, 0xea, 0x28, 0xc9,
0xa3, 0xe9, 0x23, 0x51, 0x66, 0xff, 0xab, 0x3d, 0x50, 0x09, 0xa8, 0xcd,
0x5d, 0x97, 0xbe, 0x7f, 0x78, 0xaa, 0x9b, 0x95, 0xf5, 0x30, 0xef, 0x7d,
0xf4, 0x90, 0x78, 0x3c, 0xc3, 0xc4, 0x68, 0x27, 0xc7, 0x0f, 0xf7, 0xa3,
0xeb, 0x1a, 0x67, 0x4f, 0x8e, 0xf0, 0x5f, 0x7e, 0x7e, 0x93, 0x8d, 0xad,
0x38, 0x4b, 0xab, 0x21, 0xbc, 0x9e, 0x46, 0x2e, 0x9e, 0x1e, 0x25, 0x99,
0xcc, 0x82, 0x94, 0xf4, 0xf7, 0xba, 0x99, 0x39, 0xd0, 0xc7, 0xc1, 0xa9,
0x2e, 0xfc, 0xc1, 0x24, 0xd7, 0x6e, 0x6d, 0x70, 0xeb, 0x9e, 0x8f, 0x8e,
0x36, 0x27, 0xba, 0x14, 0x7c, 0xfa, 0xd9, 0x3a, 0x5b, 0xfe, 0x04, 0xd9,
0x5c, 0x91, 0x13, 0x33, 0xfd, 0x9c, 0x3b, 0x39, 0xc8, 0xe1, 0xa9, 0x2e,
0x9c, 0x0d, 0x56, 0x14, 0x01, 0xfd, 0xbd, 0x6e, 0xee, 0x2f, 0xf8, 0xb9,
0x75, 0x7f, 0x87, 0x95, 0x8d, 0x28, 0x85, 0xbc, 0x71, 0xdc, 0xa9, 0x99,
0x3e, 0xdc, 0xad, 0x4e, 0x6e, 0xdc, 0xde, 0xe4, 0xdd, 0x8f, 0x96, 0x09,
0x84, 0x12, 0x74, 0x75, 0x34, 0x73, 0xf9, 0xfc, 0x28, 0xba, 0xa6, 0x11,
0x8d, 0xa5, 0x29, 0x14, 0xe5, 0x2e, 0x50, 0x5f, 0x2f, 0x77, 0xfb, 0xb1,
0xfe, 0x9f, 0x6f, 0x32, 0xa8, 0x59, 0x8d, 0xb2, 0x24, 0x04, 0x75, 0x40,
0xa4, 0xda, 0x75, 0x47, 0x28, 0x7b, 0x2e, 0xfd, 0x6a, 0x81, 0xd9, 0x75,
0xfe, 0x92, 0x90, 0xd5, 0x01, 0xf9, 0x5d, 0x0e, 0x43, 0xc9, 0x8c, 0x56,
0x99, 0xeb, 0x9e, 0x8e, 0x46, 0x5e, 0x7e, 0x66, 0x08, 0x4f, 0xab, 0x9d,
0xe9, 0x51, 0x37, 0xe9, 0x8c, 0x46, 0xbb, 0xd7, 0xc1, 0xfa, 0x56, 0x92,
0x5c, 0x5e, 0x7f, 0x84, 0x90, 0x7d, 0x51, 0xae, 0x51, 0x54, 0x69, 0x29,
0xf6, 0xb9, 0x57, 0xa5, 0x8e, 0x0d, 0x10, 0xa8, 0xcd, 0xdd, 0x97, 0xbf,
0x7f, 0x78, 0xba, 0x9b, 0x44, 0x32, 0xc7, 0xba, 0x2f, 0x4a, 0x38, 0x9a,
0x62, 0x71, 0x25, 0x44, 0xb1, 0xa8, 0xf1, 0xed, 0xaf, 0x1f, 0x47, 0x08,
0x89, 0x6f, 0x3b, 0x42, 0x38, 0x9a, 0x25, 0x93, 0x2d, 0xb0, 0xb6, 0x19,
0x25, 0x9b, 0xcb, 0xf3, 0xf2, 0x57, 0x8e, 0x70, 0xf9, 0xdc, 0x18, 0xe9,
0x4c, 0x9e, 0x7f, 0xff, 0xc3, 0xab, 0x6c, 0xfa, 0xc2, 0x1c, 0x98, 0xe8,
0x26, 0x14, 0x4e, 0x72, 0x77, 0xde, 0xcf, 0xd2, 0x4a, 0x88, 0x99, 0x43,
0x3d, 0x44, 0x22, 0x29, 0x6e, 0xcf, 0xed, 0xb0, 0xb9, 0x13, 0xa7, 0xa9,
0xc1, 0x4a, 0x30, 0x9c, 0xe2, 0xf5, 0xb7, 0xe7, 0xf1, 0xba, 0x1b, 0x39,
0x77, 0x62, 0x80, 0x91, 0x01, 0x2f, 0xcd, 0x4e, 0x1b, 0x85, 0x42, 0x91,
0xed, 0x40, 0x8a, 0x9d, 0x60, 0x8a, 0xb9, 0x87, 0x01, 0x04, 0x92, 0xe7,
0x2e, 0x4d, 0x90, 0x48, 0xe6, 0xc8, 0x66, 0xf3, 0xac, 0xf9, 0x62, 0xac,
0xac, 0x45, 0xf0, 0xfb, 0x13, 0x9c, 0x39, 0x39, 0xc8, 0x60, 0x9f, 0x9b,
0x42, 0xbe, 0x40, 0x24, 0x96, 0x45, 0xa2, 0x57, 0xb1, 0x14, 0x95, 0xa9,
0xac, 0x17, 0x30, 0x51, 0xa5, 0x35, 0x1e, 0x8d, 0xc9, 0x6a, 0xcd, 0x6f,
0x59, 0xc8, 0xea, 0xb4, 0x4c, 0x59, 0x20, 0xf6, 0xd1, 0x64, 0x35, 0xe7,
0x15, 0x62, 0x17, 0xb5, 0x52, 0x43, 0x61, 0xd4, 0x9b, 0xde, 0xaa, 0x49,
0x2a, 0xff, 0x5f, 0xd4, 0x7a, 0xc0, 0x23, 0xfd, 0x2e, 0x1a, 0x1c, 0x56,
0x5a, 0x9b, 0x6c, 0xf4, 0x75, 0x37, 0x11, 0x8d, 0xe7, 0x48, 0x24, 0x0b,
0x44, 0xa2, 0x59, 0xa2, 0x89, 0xe2, 0x63, 0xe8, 0xe5, 0xc7, 0xc7, 0xae,
0x95, 0x31, 0xab, 0xd7, 0x68, 0xd5, 0xa6, 0x51, 0xec, 0x21, 0x70, 0x02,
0xb5, 0xa5, 0xe7, 0x89, 0xef, 0x0f, 0x0f, 0x7a, 0xc9, 0x66, 0x8b, 0x6c,
0xed, 0xc4, 0x91, 0x12, 0x8a, 0x45, 0x0d, 0x9f, 0x3f, 0xc1, 0x40, 0x4f,
0x2b, 0x6b, 0x9b, 0x11, 0x86, 0xfa, 0xdb, 0x18, 0x1d, 0xf6, 0x92, 0xcf,
0x69, 0x44, 0x13, 0x59, 0x0a, 0x9a, 0xce, 0x70, 0xbf, 0x97, 0x7c, 0xa1,
0x48, 0x3c, 0x99, 0xc3, 0xb7, 0x1d, 0x67, 0x7e, 0x29, 0x48, 0x2a, 0x95,
0x65, 0xe6, 0x60, 0x2f, 0xaa, 0x02, 0x2b, 0x1b, 0x51, 0x62, 0xd1, 0x14,
0x67, 0x4e, 0x0c, 0x12, 0x0c, 0xa5, 0x08, 0xc7, 0x32, 0xe4, 0xf2, 0x45,
0x46, 0x06, 0xdb, 0x79, 0xb0, 0x18, 0x64, 0xf6, 0x81, 0x9f, 0x6b, 0xb7,
0x7c, 0x14, 0xf2, 0x45, 0x2e, 0x9e, 0x19, 0x41, 0xd3, 0x15, 0xa6, 0x46,
0xdb, 0xb1, 0xaa, 0x2a, 0xa1, 0x48, 0x06, 0x9b, 0x45, 0xc5, 0xdd, 0xd2,
0xc0, 0xb6, 0x3f, 0xc1, 0xf4, 0x44, 0x27, 0xbd, 0x5d, 0x2e, 0xb6, 0xfd,
0x49, 0x02, 0x91, 0x34, 0x73, 0x0f, 0x83, 0xb4, 0xb9, 0x1b, 0x98, 0x39,
0xd4, 0x4b, 0x57, 0xbb, 0x93, 0x75, 0x5f, 0x1c, 0x4d, 0xd3, 0x50, 0x14,
0x81, 0xd5, 0xa2, 0xa2, 0xaa, 0x0a, 0xaa, 0x6a, 0x98, 0x95, 0x6a, 0xef,
0xb4, 0x5e, 0x90, 0xaa, 0x8f, 0x55, 0x15, 0x65, 0x97, 0x95, 0xad, 0xc6,
0x45, 0x16, 0x55, 0xc1, 0xaa, 0xaa, 0x58, 0x54, 0x05, 0x8b, 0xa2, 0xa0,
0x94, 0xcf, 0xad, 0x20, 0x84, 0x82, 0xaa, 0xaa, 0x58, 0x2d, 0x16, 0x2c,
0xe6, 0xf9, 0x4a, 0x13, 0x69, 0xb1, 0xa8, 0xa8, 0x16, 0x05, 0x55, 0x51,
0x8d, 0xd7, 0x4a, 0x29, 0x0e, 0x2c, 0x50, 0x55, 0x15, 0x8b, 0xa2, 0xa0,
0x9a, 0x1e, 0xa3, 0xa2, 0x28, 0xa8, 0xaa, 0x30, 0xfe, 0x55, 0x14, 0x14,
0xc5, 0xb8, 0x3e, 0x45, 0x55, 0x51, 0x2c, 0x8a, 0xf1, 0x1d, 0x45, 0x41,
0x51, 0x15, 0x14, 0xa1, 0xd0, 0xec, 0xb4, 0x31, 0x3d, 0xee, 0x21, 0x97,
0xd7, 0x70, 0x39, 0x6d, 0xa4, 0xd2, 0x05, 0xc2, 0xd1, 0x1c, 0x2b, 0xeb,
0x09, 0x92, 0xe9, 0x62, 0x85, 0xdb, 0xab, 0x7b, 0x7e, 0x11, 0x4d, 0xb6,
0x9b, 0x8e, 0x91, 0xbb, 0x5e, 0x97, 0x02, 0xec, 0xc2, 0xe4, 0x10, 0xa5,
0x34, 0x4c, 0xbd, 0x45, 0x00, 0xa1, 0x70, 0x92, 0x03, 0x13, 0x3d, 0x04,
0x82, 0x49, 0x42, 0x91, 0x14, 0xa9, 0x74, 0x01, 0xcd, 0x64, 0x6c, 0x3f,
0xf8, 0x64, 0x19, 0x4d, 0xd3, 0x19, 0x1b, 0x6e, 0xe7, 0x99, 0x4b, 0x13,
0xf8, 0x83, 0x09, 0x1a, 0x1b, 0x6d, 0xac, 0x6e, 0x84, 0xf8, 0xe0, 0xea,
0x32, 0x87, 0x26, 0xbb, 0xf9, 0xd6, 0xcb, 0x33, 0xbc, 0xfb, 0xe1, 0x02,
0xf7, 0x17, 0xfc, 0xc4, 0xe2, 0x39, 0xbe, 0x62, 0x7a, 0x86, 0xef, 0x7f,
0xba, 0x46, 0xf7, 0xa2, 0x9f, 0x27, 0xce, 0x8d, 0x10, 0xfd, 0xf5, 0x3d,
0x96, 0x37, 0xa2, 0x1c, 0x3d, 0x98, 0x65, 0x6a, 0xac, 0x9d, 0xd0, 0xb5,
0x2c, 0xba, 0xae, 0xb3, 0xb8, 0x12, 0x62, 0x69, 0x35, 0xcc, 0x2f, 0xdf,
0x9e, 0x67, 0xa0, 0xa7, 0x99, 0x13, 0x33, 0x7d, 0x9c, 0x3b, 0x35, 0x48,
0xb1, 0xa8, 0x71, 0xe7, 0xfe, 0x36, 0xef, 0x7f, 0xb2, 0xc2, 0x37, 0x5f,
0x3c, 0xc8, 0x3f, 0xfa, 0xf3, 0x8b, 0x7c, 0xeb, 0xa5, 0x24, 0x81, 0xa0,
0x61, 0x7a, 0x5f, 0x7f, 0xfb, 0x1e, 0xb3, 0x73, 0x5b, 0xfc, 0xd1, 0x6b,
0x27, 0x69, 0x6f, 0x73, 0xf1, 0x9b, 0xf7, 0xe7, 0x99, 0x18, 0x6d, 0xe3,
0x85, 0x27, 0x0f, 0x94, 0x17, 0xd3, 0x27, 0xd7, 0x57, 0xf8, 0xe9, 0xaf,
0xee, 0x52, 0x28, 0x68, 0xbb, 0x34, 0x5b, 0xb3, 0xd3, 0xc6, 0x3f, 0xf9,
0xcb, 0xa7, 0x70, 0x35, 0x39, 0x10, 0x40, 0x38, 0x96, 0xe1, 0x87, 0x3f,
0xbe, 0xc1, 0xd2, 0x5a, 0x68, 0x97, 0xf6, 0x53, 0x14, 0xc1, 0xd7, 0x9e,
0x9d, 0xe6, 0xec, 0x89, 0x21, 0x2c, 0x16, 0x15, 0x29, 0xe1, 0xd3, 0x1b,
0xab, 0xfc, 0xe4, 0x57, 0xf7, 0xca, 0x40, 0xfb, 0xf8, 0xa1, 0x2e, 0x5e,
0x7d, 0xe1, 0x20, 0x56, 0xab, 0x82, 0x2e, 0xe1, 0xd7, 0xbf, 0x5d, 0xe4,
0xee, 0xbc, 0x9f, 0x3f, 0x79, 0x6d, 0x86, 0x76, 0x4f, 0x53, 0x1d, 0xb9,
0x6a, 0x68, 0xc6, 0x92, 0x91, 0xd4, 0xa5, 0xe4, 0xe7, 0xbf, 0x5e, 0xa4,
0xb1, 0xc1, 0xc6, 0x53, 0x17, 0x06, 0xb0, 0xa8, 0xca, 0x2e, 0xdc, 0xb6,
0xdb, 0x6a, 0x09, 0xde, 0x7c, 0x7f, 0x93, 0x42, 0x41, 0xa3, 0xa0, 0x49,
0xde, 0xfa, 0x60, 0x93, 0xc3, 0xd3, 0x6e, 0x62, 0xf1, 0x1c, 0xfe, 0x48,
0xee, 0xb1, 0xe2, 0xb7, 0x5f, 0x34, 0xd9, 0x60, 0xbf, 0x00, 0x7a, 0xe9,
0x3d, 0x61, 0xc6, 0x98, 0x4b, 0x97, 0x6d, 0x11, 0x42, 0xb0, 0x13, 0x48,
0xf2, 0xea, 0xd7, 0xba, 0xf0, 0xb4, 0x3a, 0xd9, 0x09, 0x24, 0xf1, 0x07,
0x22, 0xac, 0xfb, 0x62, 0xd8, 0xed, 0x56, 0xa4, 0x94, 0x84, 0xa3, 0x69,
0xae, 0xdd, 0x5a, 0xe7, 0xc1, 0x52, 0x80, 0xcb, 0xe7, 0x46, 0x79, 0xf6,
0xd2, 0x24, 0x7f, 0xfb, 0xeb, 0x59, 0x5a, 0x9a, 0x6c, 0x5c, 0xbd, 0xb5,
0x46, 0x28, 0x94, 0xe2, 0xe2, 0xd9, 0x51, 0x7a, 0xbb, 0x5b, 0xf9, 0xf8,
0xfa, 0x2a, 0xbf, 0x79, 0x7f, 0x81, 0xaf, 0x3e, 0x3d, 0x85, 0xa6, 0x49,
0x3e, 0xbd, 0xed, 0xe3, 0xc5, 0x36, 0x17, 0x17, 0x4f, 0x0d, 0xf2, 0xe6,
0xfb, 0x8b, 0x7c, 0x74, 0x6d, 0x8d, 0x6f, 0xbe, 0x70, 0x88, 0x1b, 0x77,
0xb7, 0x48, 0xa5, 0x8d, 0xa0, 0x79, 0x51, 0xd3, 0x48, 0xa5, 0xf2, 0xdc,
0x99, 0xdb, 0xe1, 0xe1, 0x4a, 0x98, 0xe9, 0xb1, 0x76, 0xfe, 0xd1, 0x5f,
0x9c, 0x07, 0x29, 0xc9, 0x66, 0xf3, 0x7c, 0xe3, 0x85, 0x83, 0x8c, 0x0f,
0xb7, 0x31, 0x31, 0xd2, 0x8e, 0xa6, 0x4b, 0x34, 0x4d, 0xc7, 0x6a, 0x55,
0x58, 0x5c, 0x0b, 0xf3, 0xaf, 0xfe, 0xe3, 0x47, 0x78, 0xdd, 0x8d, 0xbc,
0xfa, 0xe2, 0x0c, 0xe3, 0xc3, 0x6d, 0x7c, 0xf5, 0xe9, 0x69, 0x40, 0xa0,
0xeb, 0x3a, 0x3b, 0x81, 0x38, 0xc5, 0xa2, 0xb6, 0x6b, 0xa0, 0x14, 0x21,
0xe8, 0xeb, 0x69, 0xe1, 0xa5, 0xe7, 0x0e, 0xe3, 0x76, 0x3b, 0x01, 0x58,
0x5c, 0xf6, 0xf3, 0xd7, 0x3f, 0xba, 0xba, 0x77, 0xa8, 0x5a, 0x08, 0x9e,
0xbe, 0x38, 0xce, 0x57, 0x9e, 0x3a, 0x80, 0x62, 0x6a, 0xa9, 0xa9, 0xf1,
0x0e, 0x6e, 0xdc, 0xd9, 0x60, 0x79, 0x23, 0x81, 0xaa, 0x08, 0x8e, 0x4c,
0x75, 0xf2, 0xea, 0x8b, 0x07, 0x51, 0x14, 0x41, 0xa1, 0xa0, 0xf1, 0xe9,
0x8d, 0x35, 0x3a, 0xbd, 0x8d, 0xfc, 0xf1, 0x37, 0x67, 0x70, 0x38, 0xac,
0x8f, 0x9c, 0xc0, 0x64, 0x2a, 0xcf, 0x27, 0x9f, 0xf9, 0x98, 0x1e, 0x6b,
0xe7, 0xe5, 0x67, 0x47, 0xb1, 0x58, 0x94, 0xcf, 0x9d, 0xf4, 0x7c, 0x5e,
0xe3, 0x8d, 0x77, 0x56, 0xf8, 0xe1, 0xdf, 0x2e, 0x71, 0x68, 0xc2, 0x8d,
0xbb, 0xd5, 0xce, 0x2f, 0xdf, 0x5e, 0x67, 0x6e, 0x29, 0x86, 0xa6, 0xc9,
0x2f, 0x89, 0xbd, 0xbe, 0x4c, 0xa6, 0x86, 0x41, 0xc4, 0x22, 0x2b, 0x9a,
0x4f, 0x01, 0x88, 0xc6, 0x33, 0x6c, 0xf8, 0x22, 0xfc, 0x9b, 0xbf, 0xfe,
0x98, 0xcf, 0xee, 0xac, 0xd1, 0xdd, 0xe9, 0xe6, 0xd4, 0xb1, 0x61, 0x86,
0xfa, 0x3d, 0x1c, 0x3b, 0xd4, 0x8b, 0xa7, 0xb5, 0x11, 0x21, 0x8c, 0xe3,
0x66, 0xe7, 0xb7, 0x78, 0xf7, 0xca, 0x22, 0xce, 0x46, 0x1b, 0x4f, 0x3f,
0x31, 0xc5, 0x53, 0xe7, 0x46, 0x09, 0x84, 0x53, 0xfc, 0xfc, 0xcd, 0x59,
0xec, 0x36, 0x0b, 0x2f, 0x3e, 0x33, 0x8d, 0xaa, 0x0a, 0x7e, 0xf2, 0xfa,
0x5d, 0xfa, 0x7a, 0xdc, 0x9c, 0x39, 0xda, 0xc7, 0x47, 0xd7, 0xd6, 0xe8,
0xed, 0x76, 0x73, 0xfc, 0x50, 0x37, 0xa1, 0x48, 0x9a, 0xad, 0x9d, 0x38,
0x47, 0x0f, 0x74, 0x02, 0x90, 0xc9, 0x6a, 0x44, 0xe2, 0x39, 0xda, 0xbd,
0x8d, 0x48, 0x09, 0xe9, 0x4c, 0x81, 0x8d, 0xad, 0x18, 0x77, 0xe7, 0xb6,
0xd9, 0x09, 0xa4, 0xf8, 0xe3, 0x6f, 0x9d, 0x60, 0xe6, 0x40, 0x8f, 0x61,
0x36, 0x14, 0x81, 0xd5, 0xa2, 0xe0, 0xb0, 0x5b, 0xb8, 0x7c, 0x7e, 0x8c,
0xb5, 0xb5, 0x30, 0xf7, 0x17, 0xfc, 0xbc, 0xf7, 0xf1, 0x32, 0x57, 0xae,
0x2e, 0x72, 0x60, 0xbc, 0x0b, 0xab, 0x45, 0xc5, 0x6a, 0x51, 0xc8, 0xe5,
0x8a, 0xf8, 0x03, 0xf1, 0xbd, 0xc7, 0x59, 0xc0, 0xc8, 0x50, 0x1b, 0x8e,
0x06, 0x2b, 0x56, 0x8b, 0x82, 0x45, 0x55, 0x48, 0x24, 0xb2, 0x6c, 0xfb,
0xe3, 0x7b, 0xae, 0x60, 0x97, 0xd3, 0x46, 0x77, 0x47, 0x33, 0x76, 0xbb,
0x05, 0xab, 0x45, 0xc1, 0x6a, 0x51, 0x19, 0x1e, 0x6c, 0xe3, 0xc5, 0x67,
0xa7, 0xb1, 0x5a, 0x04, 0xce, 0x06, 0x0b, 0x83, 0xfd, 0x6e, 0xac, 0x56,
0x05, 0xab, 0x45, 0x21, 0x95, 0xce, 0x13, 0x8d, 0x65, 0xe9, 0xeb, 0xae,
0xfe, 0x8e, 0x69, 0x0a, 0x85, 0x40, 0x31, 0x39, 0xd5, 0xd2, 0x33, 0x9e,
0xcc, 0x13, 0x0c, 0x67, 0x98, 0x1c, 0x75, 0x63, 0xb5, 0x18, 0xa6, 0xb8,
0x74, 0xaf, 0xa5, 0xa7, 0xc5, 0xbc, 0x7f, 0xe3, 0xfb, 0x02, 0x7f, 0x28,
0x4b, 0x34, 0x91, 0x27, 0x91, 0x2a, 0x70, 0xe5, 0x33, 0x3f, 0xbf, 0x7c,
0x67, 0x9d, 0xdb, 0x73, 0x61, 0xf2, 0x79, 0xad, 0x8e, 0xbd, 0xdf, 0xeb,
0xf9, 0xfb, 0x0e, 0xe2, 0xef, 0xe1, 0x91, 0x56, 0xe5, 0xff, 0x59, 0x00,
0x0a, 0x45, 0x8d, 0x9d, 0x40, 0x82, 0xe1, 0x7e, 0x37, 0x77, 0xe7, 0xb7,
0x59, 0x58, 0x0e, 0xe2, 0x6e, 0x69, 0xa4, 0xcd, 0xe3, 0xa4, 0xb7, 0xc7,
0xcd, 0xd4, 0x44, 0x17, 0x3b, 0xfe, 0x04, 0x37, 0x6e, 0xaf, 0xd1, 0xd5,
0xe1, 0x22, 0x10, 0x4a, 0xf2, 0xce, 0x47, 0x0f, 0x69, 0x6b, 0x6d, 0xe4,
0xf0, 0x74, 0x0f, 0x7f, 0xfe, 0x9d, 0x33, 0x5c, 0xb9, 0xbe, 0xc2, 0xbb,
0x1f, 0x3d, 0x64, 0x64, 0xc0, 0xcb, 0xf3, 0x4f, 0x4e, 0x71, 0x6b, 0x76,
0x93, 0xb7, 0x3e, 0x78, 0xc8, 0x0b, 0x4f, 0x4f, 0xd2, 0xee, 0x75, 0xf2,
0xe1, 0xd5, 0x65, 0xce, 0x1e, 0x1f, 0x24, 0x18, 0x4a, 0x33, 0x3b, 0xb7,
0xcd, 0xb3, 0x97, 0xc7, 0xb9, 0x3d, 0xe7, 0x27, 0x93, 0x2d, 0x92, 0x4a,
0xe5, 0xe9, 0x6a, 0x6f, 0x62, 0xcb, 0x9f, 0x44, 0x4a, 0x18, 0x1b, 0x6e,
0xe3, 0xee, 0xdc, 0x0e, 0xeb, 0x1b, 0x11, 0xbe, 0xf7, 0xcd, 0xa3, 0x38,
0x1c, 0xbb, 0xd3, 0xde, 0x72, 0xf9, 0x22, 0x97, 0xce, 0x8d, 0xb1, 0x13,
0x4c, 0x70, 0x77, 0x6e, 0x9b, 0xf5, 0xcd, 0x08, 0x9a, 0xac, 0xdc, 0x58,
0x2a, 0x95, 0x63, 0x73, 0x3b, 0xbe, 0xe7, 0x90, 0x2a, 0x42, 0x30, 0x3d,
0xd1, 0x8d, 0xdd, 0x6a, 0x29, 0x0f, 0xca, 0xe6, 0x4e, 0xac, 0x8c, 0xdf,
0xea, 0x57, 0x66, 0x77, 0x97, 0x8b, 0x96, 0x96, 0xc6, 0x9a, 0x77, 0x9d,
0x0d, 0x36, 0x9e, 0xba, 0x38, 0xce, 0x9b, 0xef, 0x2e, 0x10, 0x4b, 0x16,
0x69, 0x6f, 0x73, 0x96, 0x87, 0x3a, 0x1a, 0xcb, 0x12, 0x8e, 0x65, 0xb8,
0x34, 0xdd, 0x85, 0x62, 0xae, 0xe6, 0xa2, 0xa6, 0x73, 0x7f, 0x21, 0xc0,
0xbd, 0x07, 0xc1, 0x2a, 0xfa, 0xc5, 0x30, 0x98, 0xdb, 0x81, 0x14, 0x2b,
0xeb, 0x09, 0xae, 0xdf, 0xd9, 0x66, 0x63, 0x3b, 0x09, 0x08, 0x5c, 0x4e,
0x2b, 0xcf, 0x5d, 0x1a, 0xc2, 0x6a, 0x6a, 0xb5, 0x70, 0x34, 0xcb, 0x47,
0xd7, 0xb7, 0xc8, 0xe4, 0x8a, 0x80, 0x60, 0x75, 0x33, 0x89, 0x2f, 0x90,
0xe1, 0xff, 0x4f, 0x8f, 0x12, 0xbc, 0x90, 0xd2, 0x08, 0x03, 0x0a, 0xc5,
0x48, 0x03, 0xb2, 0x94, 0x54, 0xef, 0xda, 0x7a, 0x90, 0x03, 0x93, 0x9d,
0xcc, 0x2e, 0xf8, 0x0d, 0x13, 0x19, 0x49, 0xf3, 0xd9, 0x9d, 0x0d, 0x9a,
0x5d, 0x0e, 0x7e, 0xf6, 0xc6, 0x6d, 0xc6, 0x86, 0xdb, 0x79, 0xfa, 0x89,
0x49, 0xdc, 0xad, 0x4e, 0x0a, 0x45, 0x8d, 0x8d, 0xcd, 0x30, 0x0b, 0xcb,
0x21, 0xde, 0x7a, 0xff, 0x01, 0x77, 0xee, 0x6d, 0xf3, 0xf4, 0x13, 0x63,
0x4c, 0x4f, 0x74, 0x72, 0x6f, 0xce, 0xc7, 0x9b, 0xef, 0x3d, 0xe0, 0xe2,
0xa9, 0x21, 0x3a, 0xda, 0x5c, 0x5c, 0xb9, 0xb6, 0xca, 0xc5, 0xd3, 0x43,
0x0c, 0xf7, 0x7b, 0xd8, 0xdc, 0x8a, 0x70, 0xf9, 0xdc, 0x28, 0x7f, 0xfb,
0xd6, 0x3c, 0x81, 0x60, 0x8a, 0xd3, 0x33, 0xbd, 0xbc, 0x73, 0x65, 0x85,
0x54, 0x32, 0x43, 0x47, 0x9b, 0xb3, 0x0c, 0x3f, 0x06, 0x7a, 0x5b, 0xb8,
0x39, 0xbb, 0xc5, 0xd3, 0x17, 0x87, 0x39, 0x3c, 0xdd, 0x65, 0xe0, 0x16,
0xdd, 0xc8, 0xca, 0x54, 0x55, 0x93, 0x23, 0x52, 0x04, 0xbf, 0xf9, 0xe0,
0x01, 0x27, 0x67, 0x06, 0xe8, 0xea, 0x70, 0xe1, 0xdb, 0x0a, 0xd3, 0xe6,
0x69, 0xaa, 0x98, 0x93, 0xa2, 0x46, 0x32, 0x95, 0x43, 0x51, 0xc4, 0x1e,
0x80, 0x1e, 0x06, 0x7a, 0xdd, 0xa8, 0xe6, 0x04, 0x6a, 0x9a, 0xce, 0xbd,
0xb9, 0x2d, 0x34, 0x29, 0x6b, 0xb3, 0x7e, 0xcd, 0x87, 0xa7, 0xb5, 0x91,
0x26, 0xa7, 0x7d, 0xd7, 0x39, 0xa6, 0xc6, 0xbb, 0xb8, 0x70, 0x6a, 0x90,
0x4f, 0x3e, 0xdb, 0x64, 0x6c, 0xd8, 0x5b, 0xfe, 0x4e, 0x38, 0x96, 0x26,
0x12, 0xcd, 0x30, 0x32, 0xe8, 0x36, 0x12, 0x3b, 0x01, 0x4d, 0x93, 0x2c,
0xad, 0x46, 0xf8, 0xe4, 0xfa, 0x1a, 0xba, 0xac, 0x68, 0x81, 0x5c, 0x41,
0x72, 0x77, 0x21, 0x82, 0x3f, 0x98, 0xe6, 0xdf, 0xfe, 0xe7, 0xbb, 0x28,
0x8a, 0x41, 0x68, 0x9e, 0x3b, 0xde, 0xcd, 0xd3, 0xe7, 0x07, 0xca, 0x42,
0xb6, 0xe6, 0x4b, 0xf0, 0x2f, 0xfe, 0xea, 0x36, 0x91, 0x78, 0x1e, 0x84,
0x30, 0xf8, 0xc3, 0xbc, 0xbe, 0x6f, 0xde, 0xd9, 0x7f, 0xcf, 0x87, 0x40,
0x41, 0x97, 0x5a, 0x39, 0xae, 0x5c, 0xc9, 0x01, 0x34, 0xf0, 0x99, 0xa5,
0x24, 0x81, 0x81, 0x50, 0x92, 0xa9, 0xf1, 0x1e, 0xba, 0xda, 0x9b, 0xd8,
0xf6, 0x27, 0x40, 0xc0, 0xfc, 0x92, 0x9f, 0xef, 0x7c, 0xe3, 0x38, 0xbf,
0x7a, 0x6f, 0x9e, 0x4f, 0x6f, 0xae, 0x73, 0xe3, 0x8e, 0x8f, 0xb1, 0x61,
0x2f, 0x7f, 0xf1, 0xbd, 0x73, 0x9c, 0x3f, 0x35, 0xca, 0xf8, 0x68, 0x27,
0x81, 0x60, 0x92, 0x7b, 0xf3, 0x7e, 0xfe, 0xdf, 0x9f, 0xde, 0x62, 0x7a,
0xac, 0x9d, 0x63, 0x87, 0xfb, 0x88, 0x25, 0x72, 0xdc, 0x5f, 0xf0, 0x33,
0x3c, 0xe8, 0xe1, 0xe4, 0xd1, 0x7e, 0x6e, 0xdc, 0xf5, 0x31, 0x3e, 0xd2,
0x46, 0xb1, 0x68, 0x41, 0x97, 0x92, 0xb3, 0xc7, 0xfb, 0x58, 0xd9, 0x88,
0x30, 0x35, 0xd6, 0x81, 0xcb, 0x69, 0x43, 0x28, 0x86, 0xa7, 0x27, 0x84,
0xa0, 0xb9, 0xc9, 0x86, 0x10, 0x82, 0xd6, 0x96, 0x06, 0x5e, 0x7a, 0xfe,
0x20, 0x0d, 0x0e, 0x2b, 0x12, 0x88, 0x27, 0x73, 0x68, 0x9a, 0x8e, 0xd7,
0x6d, 0x68, 0x14, 0x77, 0x6b, 0x23, 0xb9, 0x5c, 0x81, 0x9f, 0xfe, 0xea,
0x2e, 0xcf, 0x5e, 0x1a, 0xe7, 0xc2, 0xe9, 0x61, 0x1a, 0x1b, 0x6c, 0xe5,
0x1b, 0xb7, 0xdb, 0x2c, 0x1c, 0x3f, 0x32, 0xc0, 0xb6, 0x3f, 0xc1, 0xba,
0x2f, 0x56, 0x93, 0x4e, 0xec, 0x6c, 0xb4, 0xd3, 0xdb, 0xe3, 0x2e, 0x03,
0x6c, 0x5d, 0x4a, 0x96, 0x56, 0x83, 0x35, 0xc2, 0x58, 0x9d, 0x2b, 0xd5,
0xd5, 0xe1, 0xa2, 0xd9, 0xe5, 0xd8, 0x35, 0xb8, 0x0d, 0x76, 0x2b, 0xaf,
0xbc, 0x70, 0x84, 0x60, 0x34, 0x4b, 0x77, 0x47, 0x73, 0xf9, 0xfd, 0x58,
0x3c, 0x4b, 0x32, 0x95, 0x67, 0xa0, 0xa7, 0xa5, 0x7c, 0x0e, 0xbb, 0x4d,
0xe5, 0x95, 0xe7, 0xa7, 0x78, 0xe5, 0xf9, 0xc9, 0x9a, 0x73, 0x04, 0xc3,
0x19, 0xfe, 0xc7, 0xff, 0xed, 0x37, 0xec, 0x04, 0xd2, 0x64, 0xb2, 0x1a,
0xa0, 0x21, 0x84, 0x42, 0xbb, 0xb7, 0xc1, 0xc8, 0x32, 0x35, 0x17, 0x98,
0x3f, 0x98, 0x66, 0x2b, 0x90, 0x31, 0xf0, 0x56, 0xb5, 0x97, 0xf7, 0x25,
0x08, 0xe6, 0xdf, 0xa3, 0x0e, 0xab, 0x20, 0xc0, 0x52, 0x2e, 0x5a, 0x39,
0x34, 0x20, 0x29, 0x25, 0x8a, 0xb3, 0xb9, 0x9d, 0x04, 0x74, 0x2e, 0x9f,
0x1d, 0xa5, 0xbb, 0xdd, 0x45, 0xb3, 0xcb, 0x4e, 0xa1, 0xa8, 0x11, 0x8d,
0x67, 0x19, 0x19, 0x74, 0x23, 0x05, 0x14, 0x74, 0x9d, 0xd9, 0x87, 0x01,
0x1e, 0x2c, 0xfa, 0xf9, 0xf0, 0xea, 0x12, 0xf7, 0x1f, 0xec, 0xe0, 0xb0,
0xdb, 0xf8, 0xe6, 0x4b, 0x47, 0xf8, 0x93, 0xd7, 0x8e, 0x93, 0xce, 0xe4,
0xf9, 0xf9, 0xaf, 0x67, 0x59, 0x5c, 0x0d, 0x31, 0x36, 0xda, 0x86, 0xc7,
0xdd, 0x48, 0x30, 0x9c, 0xe2, 0xfc, 0xa9, 0x21, 0x62, 0xf1, 0x2c, 0x4d,
0x8d, 0x76, 0x5a, 0x9a, 0x1d, 0x0c, 0x0f, 0x78, 0x69, 0x69, 0x76, 0x18,
0xd9, 0xb5, 0x1d, 0x4e, 0xe2, 0xc9, 0x1c, 0x3a, 0x60, 0xb5, 0x0a, 0xfa,
0x7b, 0x5c, 0x14, 0x35, 0x9d, 0x97, 0x9e, 0x9d, 0x64, 0x64, 0xd0, 0x5b,
0x86, 0x17, 0xf1, 0x44, 0x86, 0xad, 0x9d, 0x38, 0x9a, 0xa9, 0x06, 0x6c,
0x56, 0x95, 0x89, 0xb1, 0x76, 0x62, 0x89, 0x1c, 0xbf, 0x7c, 0xeb, 0x3e,
0xc5, 0x82, 0x8e, 0xa2, 0x54, 0x04, 0x24, 0x14, 0x4d, 0x31, 0x3c, 0xd8,
0xc6, 0x3f, 0xfe, 0x7b, 0x97, 0x99, 0x9e, 0xec, 0x00, 0x45, 0x20, 0xd1,
0x90, 0xe8, 0xb4, 0x7b, 0x1b, 0x71, 0x36, 0x54, 0xc0, 0xb8, 0xa6, 0xe9,
0xac, 0x6f, 0x46, 0xf6, 0x24, 0x6b, 0x85, 0xaa, 0xe0, 0xf5, 0x36, 0xd1,
0x60, 0x1e, 0x5f, 0x28, 0x16, 0xf1, 0x07, 0x93, 0xe5, 0x2c, 0xdf, 0x83,
0x93, 0x5d, 0x7c, 0xfb, 0x95, 0xa3, 0xd8, 0xed, 0x96, 0xb2, 0x19, 0x5f,
0x5d, 0x0f, 0xe3, 0x6a, 0xb2, 0xe2, 0xf5, 0x38, 0xa9, 0x27, 0xfd, 0xeb,
0xe9, 0x84, 0x6c, 0xbe, 0xc8, 0xf2, 0x7a, 0x0c, 0xbd, 0x4a, 0x8b, 0x2a,
0x42, 0x30, 0x3e, 0xd4, 0x5a, 0xa6, 0x36, 0x0a, 0x45, 0x9d, 0x8d, 0xad,
0x24, 0x42, 0xca, 0xda, 0xa4, 0x1f, 0xb9, 0x37, 0xcd, 0x50, 0xcd, 0x05,
0xd6, 0x3f, 0xbf, 0x28, 0x75, 0xa1, 0x28, 0xca, 0x9e, 0x34, 0x90, 0xc1,
0x4d, 0xea, 0x28, 0x80, 0x5a, 0x8a, 0x76, 0x4a, 0xc5, 0xc8, 0x37, 0x95,
0x3a, 0x12, 0xbd, 0x92, 0x19, 0xab, 0x69, 0x3a, 0x37, 0x6e, 0x6d, 0xf0,
0x67, 0x7f, 0x78, 0x96, 0x81, 0x3e, 0x0f, 0xb9, 0xa2, 0x46, 0x34, 0x96,
0xc1, 0xe9, 0xb4, 0xf3, 0xd2, 0x73, 0x07, 0x79, 0xeb, 0xbd, 0x79, 0x22,
0xf1, 0x2c, 0xc1, 0x48, 0x86, 0x3b, 0x73, 0x5b, 0x8c, 0x0e, 0xb6, 0xf1,
0xb3, 0x5f, 0xdf, 0xe7, 0xe1, 0x72, 0x18, 0xd7, 0xed, 0x75, 0x7a, 0x3b,
0x5b, 0xb8, 0x78, 0x66, 0x04, 0xbb, 0xcd, 0xca, 0xdc, 0xa2, 0x9f, 0xd9,
0xfb, 0x5b, 0x38, 0x1c, 0x36, 0x8e, 0x1f, 0xe9, 0x25, 0x95, 0xce, 0x73,
0xf4, 0x50, 0x2f, 0x3b, 0x81, 0x04, 0x9a, 0x26, 0xf1, 0xb4, 0x38, 0xb8,
0x7c, 0x76, 0x84, 0xa5, 0xb5, 0x30, 0xcf, 0x5c, 0x1c, 0x63, 0xfe, 0xa1,
0x9f, 0xe6, 0x26, 0x07, 0x8d, 0x0e, 0x1b, 0x1d, 0x5e, 0x27, 0xe3, 0xc3,
0x6d, 0x3c, 0x71, 0x7a, 0x18, 0x9b, 0xd5, 0xc8, 0xd7, 0xca, 0xe4, 0x0a,
0xbc, 0xfe, 0xf6, 0x3c, 0x9a, 0xa6, 0x31, 0x32, 0xe8, 0xa1, 0xb1, 0xc1,
0x86, 0xaa, 0x2a, 0xbc, 0xf2, 0xfc, 0x61, 0x16, 0x97, 0x83, 0xcc, 0xce,
0xef, 0xe0, 0x71, 0x37, 0xa0, 0x98, 0x8c, 0x7b, 0x51, 0xd3, 0xb9, 0x73,
0xcf, 0xc7, 0xbf, 0xfd, 0x4f, 0x1f, 0xe3, 0x6e, 0x71, 0xf0, 0xd2, 0x73,
0x87, 0xb1, 0xa8, 0xb3, 0xdc, 0xbd, 0xbf, 0x85, 0xa6, 0xe9, 0xf4, 0x74,
0xb7, 0xe2, 0x6a, 0x72, 0x94, 0x05, 0x72, 0x6d, 0x23, 0x4c, 0x3c, 0x91,
0xdd, 0x73, 0x90, 0x9b, 0x1a, 0xad, 0xf4, 0x75, 0xbb, 0xcb, 0xd8, 0x2a,
0x14, 0x4e, 0xf3, 0x83, 0x9f, 0x5c, 0xe7, 0x7b, 0xaf, 0x9e, 0xa0, 0xb3,
0xbd, 0x19, 0xab, 0x45, 0xe1, 0xec, 0xf1, 0xfe, 0xb2, 0x40, 0xe4, 0xf2,
0x45, 0x36, 0xb7, 0xe3, 0x0c, 0xf5, 0xb9, 0x71, 0xd8, 0x2a, 0x58, 0x32,
0x95, 0xce, 0xe3, 0x0f, 0xa5, 0x6a, 0xc3, 0x34, 0x48, 0xee, 0xde, 0x0f,
0x10, 0x4b, 0xe4, 0xcb, 0x11, 0x67, 0xe3, 0x73, 0x9d, 0xd1, 0x81, 0x16,
0x93, 0x6f, 0x83, 0x5c, 0x5e, 0x63, 0x69, 0x3d, 0xb6, 0x5b, 0x69, 0x09,
0xb9, 0x6f, 0x3a, 0xcf, 0xfe, 0xde, 0xdf, 0x97, 0xa3, 0x30, 0x7e, 0xa7,
0xf3, 0x99, 0x34, 0x98, 0xa5, 0xfa, 0x82, 0xee, 0x2f, 0x06, 0xb8, 0x7d,
0x6f, 0x93, 0x8d, 0xad, 0x28, 0x9f, 0x7c, 0xb6, 0x4e, 0x7b, 0x5b, 0x13,
0x47, 0xa6, 0xbb, 0xf9, 0xca, 0x93, 0xd3, 0x7c, 0xfd, 0x85, 0x06, 0xe6,
0x1e, 0xfa, 0x89, 0x25, 0x32, 0x38, 0xec, 0x56, 0x9e, 0xbb, 0x3c, 0xc5,
0xe6, 0x96, 0x11, 0xcc, 0x8e, 0x25, 0xb2, 0xdc, 0x8b, 0x07, 0xb8, 0xbf,
0x18, 0xa4, 0xcd, 0xeb, 0xe4, 0xec, 0xf1, 0x01, 0x06, 0x7a, 0x3d, 0x24,
0x53, 0x39, 0xd6, 0x36, 0x62, 0x78, 0xdc, 0x8d, 0xa4, 0xd2, 0x39, 0xa6,
0xc7, 0x3a, 0x10, 0x42, 0x90, 0x4c, 0xe5, 0x58, 0xdd, 0x8c, 0x80, 0x94,
0xe4, 0xf2, 0x1a, 0x23, 0x43, 0x6d, 0x34, 0x39, 0xed, 0x3c, 0x75, 0x7e,
0x84, 0x76, 0xaf, 0x93, 0x8b, 0xa7, 0x86, 0xe8, 0xea, 0xac, 0x98, 0x1f,
0x5d, 0x97, 0x1c, 0x9e, 0xea, 0xc6, 0xd5, 0x64, 0x2b, 0x9b, 0x38, 0x81,
0xa0, 0xbf, 0xa7, 0x95, 0x7f, 0xf0, 0xc7, 0x17, 0xb8, 0x73, 0x7f, 0x93,
0x63, 0x87, 0xfa, 0xcb, 0x93, 0xa2, 0x6b, 0x92, 0x87, 0x2b, 0x41, 0xf2,
0x05, 0x8d, 0x9d, 0x50, 0x8a, 0xfb, 0x0b, 0xdb, 0x7c, 0xfb, 0xeb, 0x27,
0x68, 0xb0, 0xdd, 0xe2, 0xe6, 0xec, 0x16, 0xfd, 0x5d, 0xad, 0x34, 0xbb,
0x1a, 0xca, 0xca, 0x60, 0xdb, 0x9f, 0xc0, 0xeb, 0x6d, 0xc2, 0x66, 0xb7,
0xee, 0xa2, 0x16, 0x9a, 0x9a, 0xac, 0x0c, 0xf6, 0x7b, 0xcb, 0xfa, 0x23,
0x14, 0x49, 0xf1, 0xf6, 0x07, 0x0b, 0x8c, 0x0e, 0x7a, 0x79, 0xe9, 0xb9,
0xc3, 0x28, 0x8a, 0xc0, 0x62, 0xa9, 0x24, 0x2f, 0x66, 0xb3, 0x45, 0xd6,
0x7d, 0x31, 0x06, 0xfb, 0xdd, 0x65, 0xed, 0x26, 0x25, 0x7c, 0x7a, 0x73,
0x83, 0x7f, 0xf1, 0x6f, 0x3e, 0xa6, 0x50, 0xd4, 0xab, 0x42, 0x50, 0x82,
0x54, 0xa6, 0x68, 0x82, 0x79, 0xe3, 0x40, 0x21, 0x04, 0x2d, 0x2e, 0x3b,
0xed, 0xde, 0xc6, 0xb2, 0x16, 0xcc, 0x17, 0x34, 0x16, 0x96, 0x22, 0xe8,
0xba, 0xbe, 0x3f, 0x77, 0xb6, 0x4f, 0x5e, 0x7f, 0xb5, 0xa0, 0xfd, 0xf7,
0x33, 0x9f, 0x35, 0x17, 0x65, 0xf0, 0x64, 0xd5, 0x69, 0x7c, 0xef, 0x7c,
0xf8, 0x90, 0x3f, 0x78, 0xe5, 0x18, 0x0b, 0xcb, 0x41, 0xd6, 0x7d, 0x51,
0x36, 0xb7, 0x63, 0x08, 0x01, 0x76, 0x9b, 0x8d, 0x0f, 0xae, 0x2e, 0xe3,
0x6a, 0xb4, 0xe1, 0x72, 0x3a, 0xb8, 0xfa, 0xd9, 0x2a, 0xaf, 0xbd, 0x74,
0x84, 0xf9, 0xc5, 0x20, 0x2d, 0x2e, 0x07, 0x89, 0x54, 0x8e, 0x07, 0x8b,
0x41, 0x56, 0x36, 0x22, 0xfc, 0xe6, 0xfd, 0x87, 0x58, 0xad, 0x16, 0xba,
0x3b, 0x9a, 0xe9, 0x6c, 0x77, 0xd1, 0xdd, 0x69, 0xa1, 0xd9, 0xe9, 0x20,
0x95, 0xce, 0x93, 0xcb, 0x6b, 0xfc, 0x87, 0x1f, 0xdd, 0xc0, 0x1f, 0x4c,
0x99, 0x09, 0x79, 0x06, 0x7e, 0xea, 0xed, 0x72, 0x31, 0x3e, 0xec, 0xe5,
0xd4, 0xd1, 0x7e, 0x86, 0x07, 0xdd, 0x65, 0xc0, 0x6b, 0x68, 0x13, 0x1b,
0xe7, 0x4e, 0x0d, 0x52, 0x9f, 0xab, 0x67, 0xb7, 0x59, 0xf8, 0xed, 0x27,
0x4b, 0xf4, 0x76, 0xba, 0xf0, 0x7a, 0x2a, 0x93, 0x62, 0xb5, 0xaa, 0xfc,
0xd1, 0x37, 0x4f, 0xf2, 0xca, 0xf3, 0x87, 0x0c, 0xf3, 0xa3, 0x2a, 0x74,
0x78, 0x9b, 0x38, 0x7e, 0xa8, 0x97, 0x7f, 0xf6, 0xcf, 0x7f, 0x89, 0xc7,
0xe3, 0xa4, 0xc1, 0x61, 0x2b, 0x9b, 0xa6, 0x23, 0x07, 0x7a, 0xf9, 0xdf,
0xff, 0x97, 0xaf, 0x9b, 0x93, 0x68, 0x0a, 0xb6, 0x84, 0x37, 0xdf, 0xbe,
0xcf, 0x87, 0x57, 0x17, 0x69, 0xf7, 0x36, 0x95, 0xcf, 0x1d, 0x8e, 0xa6,
0x09, 0x86, 0x93, 0xfc, 0xe8, 0xe7, 0x37, 0xb9, 0x70, 0x7a, 0xac, 0x8c,
0x11, 0x4b, 0x8f, 0x4c, 0xb6, 0xc0, 0xc2, 0x52, 0x80, 0xa7, 0xce, 0x8f,
0x94, 0x85, 0x4c, 0x08, 0x98, 0x1a, 0x6b, 0xe7, 0x7f, 0xfe, 0x1f, 0x2e,
0x9a, 0x29, 0x4b, 0x15, 0xc8, 0x1c, 0x8e, 0x66, 0xf9, 0x3f, 0xfe, 0xd5,
0x55, 0x03, 0xae, 0x98, 0xef, 0x0f, 0xf5, 0xba, 0x6a, 0x3c, 0xea, 0x7c,
0x5e, 0x67, 0x27, 0x98, 0x2e, 0x57, 0x21, 0xc9, 0xea, 0xd2, 0xb4, 0x47,
0x84, 0x81, 0x7e, 0x9f, 0xd8, 0xec, 0x8b, 0x69, 0x44, 0xc3, 0x44, 0xef,
0xe2, 0x06, 0xfc, 0xc1, 0x24, 0x77, 0x66, 0x37, 0x78, 0xfe, 0xc9, 0x29,
0x7e, 0xf0, 0x93, 0xcf, 0xc8, 0xe5, 0x35, 0xde, 0xbb, 0xb2, 0xc4, 0x77,
0xbf, 0x71, 0x9c, 0x96, 0x26, 0x3b, 0x0b, 0x2b, 0x61, 0x90, 0x82, 0x70,
0x34, 0x8d, 0xd3, 0xe9, 0xe0, 0xd6, 0xac, 0x8f, 0xed, 0x9d, 0x38, 0x4e,
0xa7, 0x9d, 0xe1, 0x41, 0x2f, 0xcf, 0x5f, 0x1e, 0xc7, 0xdd, 0xd2, 0x40,
0x38, 0x9a, 0x65, 0xdd, 0x17, 0x23, 0x1c, 0x49, 0x73, 0x6b, 0x76, 0x13,
0x9b, 0xd5, 0xca, 0x93, 0xe7, 0x87, 0x09, 0x47, 0xd3, 0x44, 0x62, 0x59,
0x74, 0xbd, 0x72, 0xe3, 0xd9, 0x5c, 0x91, 0xc5, 0xd5, 0x08, 0xa9, 0x74,
0x9e, 0x6f, 0xbf, 0x72, 0x08, 0xbb, 0x69, 0x66, 0xb2, 0xd9, 0x02, 0xa1,
0x68, 0x9a, 0x46, 0x87, 0x0d, 0x45, 0x15, 0x24, 0x12, 0x59, 0x3c, 0x1e,
0x27, 0x8d, 0x26, 0xb9, 0x29, 0x04, 0xac, 0xae, 0x47, 0xd8, 0xd8, 0x8c,
0xf0, 0xc2, 0x33, 0x07, 0xca, 0xc0, 0x5f, 0x51, 0x04, 0xc3, 0x03, 0xde,
0xdd, 0xa6, 0xcf, 0xe9, 0xe0, 0x5b, 0x2f, 0x1f, 0x37, 0xca, 0xf9, 0xd4,
0x2a, 0xef, 0xd1, 0xdd, 0x88, 0xa7, 0x4e, 0x58, 0x34, 0x5d, 0xe7, 0x57,
0x6f, 0xdf, 0xc3, 0xdd, 0xd2, 0xc0, 0x60, 0x9f, 0xa7, 0xac, 0x91, 0x76,
0xfc, 0x71, 0x82, 0xe1, 0x0c, 0xb9, 0x5c, 0x80, 0xb7, 0x7e, 0xbb, 0xc0,
0x6b, 0x2f, 0x1d, 0xae, 0x62, 0xe8, 0x21, 0x12, 0xcb, 0x90, 0xcd, 0x15,
0xe8, 0xe9, 0x6a, 0x2e, 0x9b, 0x7b, 0x80, 0xee, 0x0e, 0x17, 0xdd, 0x1d,
0xae, 0x5d, 0xd7, 0xb4, 0xb4, 0x16, 0x25, 0x93, 0xc9, 0x55, 0x8a, 0x9f,
0x24, 0x0c, 0xf4, 0xb9, 0x68, 0xa8, 0x12, 0xb2, 0xc5, 0xd5, 0x28, 0xa9,
0x4c, 0xb1, 0x8a, 0xe7, 0x12, 0xec, 0x55, 0x8e, 0xb6, 0xbb, 0x6a, 0xe1,
0xbf, 0x8d, 0xe6, 0xaa, 0x0b, 0xc3, 0x7e, 0xae, 0xa0, 0xed, 0x12, 0x32,
0x4d, 0xd3, 0xb9, 0x39, 0xeb, 0x63, 0x64, 0xa4, 0x83, 0x33, 0xc7, 0x06,
0xf8, 0xe0, 0xea, 0x0a, 0x89, 0x54, 0x9e, 0x6b, 0x37, 0xd7, 0x78, 0xf2,
0xc2, 0x24, 0xfe, 0xe0, 0x4d, 0x62, 0x89, 0x2c, 0xeb, 0x5b, 0x09, 0x16,
0x97, 0xfc, 0x4c, 0x8c, 0xb6, 0x71, 0x7f, 0x21, 0xc0, 0x56, 0x20, 0xc5,
0xd2, 0x7a, 0x04, 0xc5, 0x44, 0xdf, 0xed, 0x9e, 0x26, 0x46, 0x87, 0xbc,
0x4c, 0x8e, 0xb5, 0xd3, 0xd8, 0x60, 0x23, 0x96, 0xc8, 0xb2, 0xb9, 0x93,
0xa0, 0xdd, 0xe3, 0xa4, 0xd9, 0xe9, 0x20, 0x90, 0x4b, 0xd7, 0x72, 0x57,
0x8a, 0xe0, 0xd8, 0xa1, 0x2e, 0x66, 0x0e, 0xf4, 0x98, 0xab, 0x54, 0xe2,
0x0f, 0xa5, 0xf9, 0xc9, 0xeb, 0xb3, 0x44, 0x13, 0x19, 0x34, 0x4d, 0xe7,
0xce, 0xfd, 0x6d, 0xfe, 0xe9, 0x3f, 0x7c, 0x82, 0x73, 0x27, 0x07, 0x51,
0x84, 0x40, 0x55, 0x15, 0x46, 0x06, 0xdc, 0x04, 0xc3, 0x29, 0x2c, 0x16,
0xa5, 0x8a, 0xa7, 0xa9, 0x1b, 0x6a, 0x61, 0x98, 0xdc, 0x87, 0xcb, 0x01,
0xee, 0xde, 0xf7, 0xf1, 0x17, 0xdf, 0x3b, 0x57, 0xc6, 0x0b, 0xfb, 0x0d,
0x97, 0x56, 0xd4, 0xd9, 0xf0, 0x45, 0xe8, 0xea, 0x68, 0xc1, 0xa2, 0x1a,
0xe7, 0xce, 0xe5, 0x35, 0x76, 0x82, 0x09, 0x34, 0x0d, 0x22, 0xb1, 0x1c,
0x3f, 0x7f, 0xf3, 0x1e, 0xe7, 0x4e, 0x0d, 0xd2, 0xdf, 0xdd, 0x4a, 0xa9,
0xf0, 0x75, 0x71, 0x25, 0x40, 0x73, 0xb3, 0x1d, 0x77, 0x4b, 0x03, 0x9f,
0xbf, 0xf8, 0x25, 0xeb, 0x9b, 0x31, 0xb2, 0x79, 0xad, 0x22, 0x34, 0x42,
0x32, 0xd2, 0xdf, 0x42, 0xa3, 0xc3, 0x5a, 0x1e, 0x87, 0x95, 0x8d, 0x98,
0x69, 0x66, 0xab, 0xf3, 0xf6, 0xcd, 0xd7, 0xff, 0x4d, 0xea, 0x3f, 0xbf,
0x28, 0xdb, 0xbf, 0x8f, 0x90, 0xe9, 0xa5, 0xac, 0xc7, 0xaa, 0x0b, 0x0b,
0xc7, 0xb3, 0xbc, 0x7f, 0xe5, 0x21, 0x97, 0xce, 0x4f, 0xb0, 0xbe, 0x19,
0xc1, 0x1f, 0x4c, 0xb1, 0xb8, 0x1a, 0x66, 0x70, 0xa0, 0x8d, 0x17, 0x9f,
0x99, 0xe4, 0xa7, 0xbf, 0x9a, 0xa5, 0x50, 0xd4, 0xb9, 0x72, 0x73, 0x93,
0xef, 0xbc, 0x32, 0xc3, 0xcc, 0xc1, 0x2e, 0x6e, 0xce, 0x6e, 0x55, 0x4c,
0x81, 0x54, 0x08, 0x45, 0xd2, 0x84, 0xa3, 0x19, 0xae, 0xdd, 0xda, 0x44,
0x00, 0x4e, 0xa7, 0x83, 0xd6, 0x66, 0x07, 0x17, 0xcf, 0x0c, 0x31, 0x3d,
0xde, 0x4e, 0xf8, 0xda, 0x06, 0x9a, 0x19, 0xf8, 0x93, 0x02, 0x54, 0xab,
0xca, 0xa9, 0x63, 0x03, 0xac, 0x6f, 0xc5, 0xf0, 0xed, 0xc4, 0xc9, 0xe5,
0x8b, 0xdc, 0xb9, 0xbf, 0x83, 0xc7, 0xdd, 0xc8, 0x1b, 0xef, 0x3e, 0x60,
0x63, 0x33, 0x8a, 0xa2, 0x0a, 0x66, 0xe7, 0x77, 0xf0, 0xba, 0x1b, 0x51,
0x15, 0x05, 0x4d, 0xd3, 0x71, 0x38, 0x6c, 0x34, 0x36, 0x14, 0xd8, 0xda,
0x31, 0x0a, 0x54, 0x5c, 0x4d, 0x76, 0x84, 0x10, 0xc4, 0x93, 0x59, 0x90,
0x86, 0xf0, 0x7a, 0xdc, 0x8d, 0x44, 0x63, 0x19, 0xae, 0xde, 0x5c, 0xe1,
0xce, 0x9c, 0x8f, 0xb5, 0xcd, 0x08, 0x0e, 0x87, 0x95, 0x50, 0x24, 0x85,
0xae, 0xed, 0x3d, 0x50, 0xd1, 0x78, 0x1a, 0xdf, 0x76, 0x9c, 0xe9, 0xc9,
0x2e, 0xe6, 0x16, 0xb6, 0x51, 0x14, 0x85, 0x78, 0x32, 0xcb, 0xed, 0x7b,
0x5b, 0x06, 0x33, 0xa4, 0xa8, 0xdc, 0xba, 0xb7, 0xcd, 0x1b, 0x6f, 0xcf,
0x73, 0xee, 0xc4, 0x00, 0xaa, 0x62, 0x04, 0xcc, 0xaf, 0xdf, 0xde, 0x40,
0x11, 0x0a, 0xdb, 0xfe, 0x38, 0xf7, 0x17, 0x2c, 0x8f, 0x9e, 0x70, 0x09,
0xd7, 0xee, 0xf8, 0xc8, 0x17, 0x8b, 0x18, 0xf5, 0x8b, 0x86, 0x41, 0x2c,
0x14, 0x35, 0x96, 0xd6, 0xa3, 0x65, 0x3d, 0x75, 0x77, 0xce, 0x4f, 0xa1,
0x50, 0x44, 0x4a, 0x33, 0x33, 0xb6, 0x9c, 0x96, 0x2a, 0xcb, 0x09, 0x11,
0xb2, 0x92, 0x2e, 0xb2, 0xbb, 0x4c, 0xed, 0x73, 0x70, 0xdb, 0xef, 0x92,
0xcc, 0x68, 0x78, 0xa9, 0x75, 0x81, 0xf1, 0xba, 0xe2, 0x1b, 0x59, 0x93,
0xdf, 0x27, 0x10, 0x03, 0x27, 0xeb, 0xdb, 0x14, 0x98, 0xf8, 0x4c, 0x11,
0x3c, 0x71, 0x6a, 0x88, 0x3f, 0xfd, 0xf6, 0x19, 0xd6, 0x37, 0xa3, 0x24,
0x53, 0x39, 0x76, 0x82, 0x49, 0x0e, 0x4d, 0x75, 0x91, 0x48, 0x66, 0x99,
0x7d, 0x10, 0x40, 0xd7, 0x25, 0x6d, 0x9e, 0x46, 0x8e, 0x1d, 0xea, 0x65,
0x76, 0x7e, 0x87, 0xad, 0x9d, 0x84, 0x79, 0xef, 0xf5, 0xe0, 0xb4, 0x82,
0xfb, 0x5c, 0x4e, 0x3b, 0x83, 0xfd, 0xad, 0xfc, 0xf8, 0xf5, 0x59, 0xe6,
0x17, 0x43, 0x86, 0x01, 0x30, 0x33, 0x5e, 0xba, 0xbc, 0x8d, 0x65, 0x2c,
0xa6, 0xe9, 0x92, 0x64, 0xaa, 0xc0, 0xe5, 0x33, 0x83, 0xbc, 0xf8, 0xec,
0x24, 0xeb, 0x9b, 0x31, 0x72, 0xf9, 0x22, 0xcd, 0x2e, 0x3b, 0x0d, 0x0e,
0x6b, 0xf9, 0x1e, 0xd3, 0x99, 0x3c, 0xba, 0x94, 0x34, 0x35, 0xda, 0xcc,
0xcc, 0x0a, 0x85, 0xa9, 0xb1, 0x0e, 0xd6, 0x36, 0xa3, 0xc4, 0xcc, 0x4c,
0x5a, 0xaf, 0xbb, 0x11, 0xaf, 0xc7, 0xc9, 0xdd, 0x79, 0x1f, 0x89, 0x64,
0x16, 0x4f, 0x8b, 0x13, 0xaf, 0xc7, 0xc9, 0x0f, 0x7e, 0x7c, 0x8d, 0xf9,
0x87, 0x3b, 0x66, 0xfd, 0x56, 0xad, 0xb0, 0x15, 0x35, 0x49, 0x28, 0x9c,
0xa6, 0xa1, 0xc1, 0x4a, 0x73, 0x93, 0xf1, 0x7b, 0x45, 0x0d, 0x42, 0xd1,
0x1c, 0xb9, 0x3c, 0xa8, 0xaa, 0x15, 0x29, 0x75, 0x5a, 0x5d, 0x76, 0x9a,
0x9c, 0x56, 0x4a, 0x73, 0x1f, 0x89, 0x67, 0xc9, 0x17, 0x74, 0xbc, 0x9e,
0x06, 0xac, 0x16, 0xd5, 0x20, 0x4b, 0xa5, 0x91, 0xf6, 0x22, 0xeb, 0x4a,
0xd4, 0x14, 0x45, 0x25, 0x96, 0xcc, 0x13, 0x4b, 0xe6, 0xcb, 0xe9, 0xce,
0x12, 0xf0, 0x34, 0x37, 0xe0, 0x6a, 0xb2, 0x96, 0x89, 0xd6, 0x50, 0xac,
0x40, 0x3a, 0xab, 0x99, 0xe9, 0xd7, 0x2a, 0x95, 0xca, 0x26, 0x8c, 0x6a,
0x76, 0x8c, 0x76, 0x0a, 0x98, 0x0b, 0x7c, 0x3f, 0x21, 0xfb, 0xfc, 0xf4,
0xa6, 0xdf, 0x11, 0x9f, 0xed, 0x2a, 0xb6, 0xae, 0xa3, 0x49, 0xa4, 0x44,
0x54, 0x80, 0xff, 0x1e, 0x27, 0xd2, 0x25, 0x9f, 0x7e, 0xb6, 0x41, 0x67,
0xbb, 0x61, 0x2e, 0x7e, 0xf5, 0xde, 0x03, 0x12, 0xa9, 0x1c, 0x9f, 0xdd,
0xf1, 0x72, 0xf9, 0xfc, 0x04, 0x0f, 0x97, 0x83, 0x2c, 0x2c, 0x07, 0x11,
0x08, 0xe6, 0x17, 0xfc, 0x1c, 0x39, 0xd8, 0xcb, 0xb5, 0x5b, 0x9b, 0x04,
0xc3, 0xe9, 0xba, 0x9b, 0xa8, 0x78, 0x83, 0x8a, 0x2a, 0x68, 0xf3, 0x34,
0x72, 0x49, 0x0c, 0xf1, 0xbd, 0x57, 0x67, 0xf8, 0xeb, 0xbf, 0xb9, 0xc9,
0xc3, 0xb5, 0x28, 0x45, 0xdd, 0xc8, 0x74, 0xdd, 0x0a, 0xa6, 0x6b, 0x2e,
0x52, 0x91, 0xf0, 0xee, 0x95, 0x15, 0xa6, 0xc7, 0x3b, 0x59, 0xf7, 0x45,
0xf1, 0xed, 0x24, 0x48, 0xa6, 0xb3, 0x84, 0x23, 0x19, 0x42, 0xd1, 0x14,
0x85, 0xbc, 0x86, 0x94, 0x12, 0xdd, 0x74, 0xfb, 0x4b, 0x40, 0xfe, 0xd2,
0x99, 0x21, 0x3a, 0x3b, 0x9a, 0xf9, 0xf1, 0xeb, 0xb7, 0xc9, 0xe7, 0x8a,
0x78, 0xdc, 0x0d, 0xbc, 0xf0, 0xf4, 0x01, 0x3e, 0xbb, 0xbb, 0xca, 0xbd,
0x07, 0x3b, 0x48, 0x24, 0x7d, 0x5d, 0x2d, 0x7c, 0xf5, 0xe9, 0x83, 0xdc,
0x99, 0xdb, 0x62, 0xcb, 0x9f, 0xd8, 0x57, 0xf5, 0xe7, 0x12, 0x3a, 0xe1,
0x32, 0xbd, 0x61, 0x76, 0xc0, 0x50, 0x2a, 0x1a, 0x2a, 0x1c, 0xcb, 0x10,
0x8e, 0x65, 0x6a, 0x00, 0xb7, 0x10, 0x82, 0xad, 0x40, 0x8a, 0x12, 0x07,
0x59, 0x12, 0x0a, 0x43, 0xc8, 0x94, 0xda, 0x74, 0xe5, 0x52, 0xa2, 0x63,
0xd5, 0x34, 0x84, 0xe3, 0x39, 0x22, 0x89, 0x7c, 0x55, 0x86, 0xad, 0x02,
0xc2, 0x48, 0x45, 0x12, 0x18, 0x2d, 0x24, 0x4a, 0x85, 0xc9, 0x52, 0x52,
0x97, 0xcf, 0xf5, 0xf8, 0xda, 0xea, 0x8b, 0x6b, 0xb5, 0xfd, 0x38, 0xe0,
0x5d, 0xf5, 0x88, 0x20, 0x41, 0x6d, 0xed, 0xad, 0x2e, 0xee, 0xad, 0xad,
0x54, 0xd6, 0x74, 0xf0, 0x6d, 0xc7, 0x39, 0x74, 0xa0, 0x1b, 0x97, 0xd3,
0xce, 0xea, 0x46, 0x8c, 0x9d, 0x60, 0x06, 0xad, 0xa8, 0xf1, 0xc4, 0x99,
0x11, 0x56, 0xd6, 0x23, 0xc4, 0x93, 0x79, 0xfc, 0xa1, 0x34, 0xdd, 0xed,
0x2e, 0x26, 0x47, 0xdb, 0x78, 0xb8, 0x12, 0x26, 0x9b, 0x2b, 0xa2, 0xeb,
0x06, 0x0f, 0xac, 0x28, 0x86, 0x4b, 0x7e, 0xe2, 0x68, 0x2f, 0x97, 0xcf,
0x0d, 0xd3, 0xd3, 0xd9, 0xcc, 0x4e, 0x20, 0xc9, 0xb6, 0x3f, 0xc1, 0xb1,
0xc3, 0xbd, 0x48, 0xa9, 0x13, 0x08, 0xa7, 0xca, 0x24, 0xab, 0xa8, 0x29,
0x64, 0x10, 0x14, 0x35, 0x1d, 0x5d, 0xd7, 0x78, 0xe2, 0xcc, 0x30, 0x9b,
0xdb, 0x71, 0xec, 0x76, 0x2b, 0xc3, 0x03, 0x1e, 0x4e, 0xce, 0xf4, 0x72,
0xe2, 0x70, 0x2f, 0x6d, 0x5e, 0x27, 0x02, 0x85, 0x44, 0x32, 0x87, 0x56,
0xd4, 0xd1, 0x34, 0xc9, 0xe6, 0x76, 0x9c, 0xd1, 0xa1, 0x36, 0x5a, 0x9b,
0x1d, 0x3c, 0x5c, 0x09, 0x91, 0x48, 0xe6, 0xc9, 0x64, 0xf3, 0x5c, 0x38,
0x33, 0xc2, 0xdc, 0xc2, 0x0e, 0xc9, 0x74, 0x81, 0x58, 0x22, 0x87, 0xc3,
0x6e, 0xe1, 0xf0, 0x54, 0x0f, 0x0b, 0xcb, 0x41, 0x34, 0x5d, 0xdf, 0x3b,
0xf7, 0x4a, 0xd4, 0x35, 0x33, 0x11, 0x0a, 0x08, 0xab, 0x21, 0x34, 0x52,
0xdf, 0x3f, 0xef, 0x6a, 0xcf, 0x1a, 0x4b, 0xa3, 0x8e, 0xa8, 0x32, 0x1d,
0xb5, 0x19, 0xa4, 0x42, 0x50, 0x03, 0xea, 0xab, 0x13, 0x1e, 0xab, 0x73,
0x1b, 0x45, 0x39, 0x25, 0xbb, 0xaa, 0xe7, 0x85, 0x28, 0x95, 0xd6, 0xed,
0x9d, 0x95, 0xfb, 0x85, 0xf2, 0xfa, 0x3f, 0x0f, 0xeb, 0x3d, 0xc6, 0xd7,
0x84, 0x04, 0xb5, 0xa5, 0xe7, 0xf2, 0xf7, 0xf7, 0x8a, 0xa4, 0x97, 0x56,
0x58, 0x36, 0x57, 0x64, 0xc3, 0x17, 0xe3, 0xd2, 0xd9, 0x51, 0x1a, 0x1d,
0x56, 0x36, 0xb6, 0x13, 0xf8, 0x83, 0x49, 0x14, 0x24, 0x4f, 0x9e, 0x1f,
0x65, 0x67, 0x27, 0x49, 0x34, 0x9e, 0x67, 0xdd, 0x17, 0xa3, 0xb7, 0xbb,
0x95, 0xc1, 0x3e, 0x37, 0x91, 0x68, 0x06, 0x4f, 0x8b, 0x83, 0xe1, 0x7e,
0x0f, 0xcf, 0x3f, 0x39, 0xc6, 0xb9, 0x93, 0x83, 0xc4, 0xe2, 0x39, 0x6e,
0xde, 0xdd, 0xe4, 0xde, 0x03, 0x3f, 0x0b, 0xcb, 0x61, 0xc2, 0xd1, 0x2c,
0x07, 0x27, 0x3a, 0x98, 0x1a, 0x6b, 0xa7, 0xa7, 0xb3, 0x99, 0x42, 0x5e,
0x23, 0x95, 0x2e, 0x52, 0xd4, 0x64, 0x4d, 0x75, 0x0e, 0x08, 0x1c, 0x36,
0x85, 0x27, 0xcf, 0x8f, 0x60, 0xb5, 0xa8, 0xe8, 0xba, 0x64, 0x71, 0x25,
0xcc, 0xea, 0x46, 0x94, 0x87, 0x8b, 0x86, 0x70, 0x8c, 0x0c, 0x79, 0x78,
0xf2, 0xdc, 0x28, 0x27, 0x66, 0xfa, 0xe8, 0xe9, 0x6c, 0xc6, 0xe1, 0x50,
0xd1, 0x34, 0x9d, 0x83, 0x93, 0xdd, 0xf8, 0x76, 0xa2, 0xa4, 0x32, 0x46,
0x06, 0x6d, 0xbb, 0xc7, 0xc9, 0xf8, 0x48, 0x07, 0x0b, 0x4b, 0x41, 0x34,
0x4d, 0x92, 0x48, 0x64, 0x99, 0x1c, 0xef, 0xa4, 0x90, 0x37, 0x1b, 0xc6,
0xec, 0x9b, 0xae, 0x5c, 0x25, 0x64, 0x8a, 0x6a, 0x92, 0xbe, 0x02, 0xaa,
0x33, 0x72, 0x45, 0x5d, 0xc1, 0xc7, 0x3e, 0x42, 0x56, 0xca, 0xf3, 0xaf,
0x42, 0x34, 0x75, 0xb4, 0xd7, 0xee, 0x82, 0x14, 0x21, 0x76, 0x3b, 0x32,
0xc6, 0xeb, 0x8a, 0xc8, 0xca, 0xaa, 0x93, 0x08, 0xc4, 0xee, 0xcc, 0xdc,
0xdf, 0xab, 0x90, 0x95, 0xee, 0x41, 0xee, 0x9b, 0x6a, 0x5e, 0xfe, 0x7d,
0x43, 0x93, 0x3d, 0xf5, 0xfd, 0xdd, 0x25, 0x65, 0xb5, 0x15, 0xcb, 0x99,
0xac, 0x46, 0x30, 0x9c, 0xe2, 0xf2, 0x85, 0x31, 0x72, 0xb9, 0x02, 0x5b,
0x3b, 0x09, 0x76, 0x82, 0x29, 0x7a, 0x3a, 0x5c, 0x9c, 0x38, 0xda, 0xcf,
0xa6, 0x2f, 0x4a, 0x3a, 0x6b, 0x54, 0x38, 0x7d, 0xe5, 0xa9, 0x09, 0x0e,
0x4e, 0x76, 0x32, 0x34, 0xe0, 0xa5, 0xa1, 0xc1, 0xca, 0xf5, 0xdb, 0x3e,
0xde, 0xf9, 0x70, 0x89, 0xf9, 0xc5, 0x10, 0x81, 0x70, 0x86, 0x4c, 0x56,
0xa3, 0xab, 0xdd, 0xc9, 0x2b, 0x5f, 0x99, 0x62, 0xdd, 0x17, 0xe5, 0x27,
0x6f, 0xcc, 0x71, 0x68, 0xb2, 0x8d, 0xe7, 0x9f, 0x1c, 0xc7, 0xa2, 0x2a,
0x74, 0x78, 0x1a, 0xca, 0xf9, 0x52, 0x8a, 0x80, 0xce, 0x76, 0x27, 0x2f,
0x3c, 0x3d, 0x41, 0xbb, 0xc7, 0xc9, 0x9d, 0xb9, 0x1d, 0x72, 0xf9, 0x22,
0x43, 0x03, 0x6e, 0x3a, 0xda, 0x9a, 0x50, 0x15, 0x85, 0x70, 0x34, 0xcb,
0x67, 0x77, 0x7c, 0x5c, 0xbb, 0xb5, 0xc1, 0xec, 0xfc, 0x0e, 0x45, 0x4d,
0xa7, 0xb7, 0xbb, 0x85, 0xd1, 0x21, 0x2f, 0x83, 0x7d, 0x6e, 0xba, 0x3b,
0x9a, 0x71, 0x3a, 0x6d, 0x74, 0x77, 0x38, 0x49, 0x26, 0xf3, 0x5c, 0x38,
0x39, 0xcc, 0xd6, 0x4e, 0x82, 0x70, 0x34, 0x43, 0x26, 0xa7, 0x61, 0x51,
0x05, 0xd3, 0xe3, 0xdd, 0xac, 0xac, 0x85, 0xc9, 0x17, 0xf6, 0xc8, 0x8b,
0x17, 0x35, 0x31, 0x21, 0x14, 0x45, 0x45, 0x11, 0x96, 0x5d, 0x42, 0xb6,
0x5b, 0x93, 0xb1, 0xa7, 0x90, 0x89, 0x9a, 0x49, 0xaa, 0x17, 0x34, 0xc5,
0xd4, 0x6e, 0xbb, 0x6b, 0x31, 0x2b, 0x35, 0x01, 0xec, 0xaa, 0x01, 0xa8,
0x40, 0x3d, 0x51, 0x15, 0x4b, 0xdc, 0xbf, 0x65, 0xd4, 0xde, 0xd9, 0xae,
0x5f, 0xc4, 0xc5, 0x94, 0x75, 0x05, 0x30, 0xbb, 0x35, 0x9e, 0x90, 0x12,
0x31, 0x78, 0xea, 0x9f, 0xd5, 0x02, 0x7f, 0xb9, 0x97, 0x56, 0x53, 0x11,
0x8a, 0x60, 0xa0, 0xb7, 0x85, 0x4b, 0x67, 0x47, 0x99, 0x7f, 0xb8, 0xc3,
0xf5, 0xbb, 0x3e, 0xec, 0x56, 0x2b, 0xaf, 0x7e, 0xf5, 0x20, 0x47, 0x0e,
0x74, 0xb1, 0xb2, 0x1e, 0x21, 0x12, 0xcf, 0x92, 0x48, 0x64, 0xe9, 0x68,
0x73, 0xa1, 0xaa, 0x2a, 0x7f, 0xf3, 0x8b, 0x59, 0x62, 0x89, 0x5c, 0x25,
0x37, 0x1c, 0xe8, 0xee, 0x68, 0xe2, 0xb5, 0xaf, 0x1d, 0x64, 0x69, 0x2d,
0xcc, 0x3b, 0x1f, 0xae, 0x20, 0x81, 0xa7, 0x2f, 0x8e, 0x90, 0x4a, 0xe7,
0xb0, 0x5b, 0x55, 0x4e, 0xcc, 0xf4, 0x12, 0x08, 0xa7, 0x68, 0xb0, 0x59,
0x68, 0x70, 0x58, 0x71, 0xd8, 0x2d, 0xa8, 0xaa, 0x42, 0xa1, 0xa8, 0xa1,
0x69, 0x3a, 0x91, 0x98, 0xf1, 0x1b, 0xb7, 0xe6, 0x76, 0x68, 0x6b, 0x75,
0xd0, 0xd2, 0xdc, 0x40, 0x67, 0x7b, 0x23, 0xdb, 0x3b, 0x09, 0xae, 0x5c,
0x5f, 0x23, 0x12, 0xcb, 0x9a, 0x29, 0x3f, 0x92, 0xb1, 0x41, 0x0f, 0xaf,
0x7d, 0xed, 0x30, 0x57, 0xae, 0xad, 0x20, 0xa5, 0xa4, 0xc1, 0x61, 0xe1,
0xf0, 0x74, 0x0f, 0x9d, 0x6d, 0x4d, 0x2c, 0xaf, 0x85, 0x78, 0xb0, 0x64,
0x10, 0xce, 0xe7, 0x4e, 0x0c, 0x72, 0xfd, 0xf6, 0x3a, 0xb7, 0xee, 0x6d,
0xed, 0x0a, 0x92, 0x1b, 0x4e, 0x50, 0x09, 0xe8, 0xaa, 0x28, 0x8a, 0x15,
0x81, 0x05, 0x5d, 0xd7, 0x11, 0x14, 0x77, 0xc7, 0x3b, 0x4b, 0x2d, 0x9d,
0x04, 0x7b, 0x62, 0x32, 0x21, 0x6b, 0xf3, 0xb0, 0xf4, 0xea, 0x09, 0x29,
0x17, 0x8a, 0x28, 0xe5, 0xfc, 0xf8, 0x5a, 0x21, 0x53, 0xaa, 0x6a, 0x01,
0x4a, 0xd8, 0x4e, 0x29, 0x1b, 0x9c, 0x8c, 0xe7, 0x00, 0x00, 0x18, 0x45,
0x49, 0x44, 0x41, 0x54, 0x57, 0x96, 0x53, 0x5f, 0x56, 0x57, 0xd7, 0x53,
0xe3, 0xf7, 0xce, 0xfc, 0x97, 0x72, 0xc6, 0xa4, 0x49, 0x1b, 0x09, 0xb9,
0x0b, 0xfc, 0x0b, 0x5d, 0x2f, 0x69, 0xb2, 0xfa, 0x88, 0xba, 0xa8, 0x14,
0x4e, 0x08, 0xca, 0xbd, 0xa6, 0x62, 0xc9, 0x1c, 0x89, 0x44, 0x86, 0x67,
0x2f, 0x4d, 0x70, 0x60, 0xa2, 0x83, 0x8b, 0xa7, 0x87, 0xb0, 0x59, 0x2c,
0xf8, 0x76, 0xe2, 0x74, 0x75, 0x34, 0x73, 0xf5, 0xb3, 0x0d, 0x3e, 0xb8,
0xba, 0xce, 0xc2, 0x52, 0x08, 0xaf, 0xbb, 0x81, 0xe3, 0x87, 0x7b, 0x09,
0x86, 0x92, 0x24, 0x52, 0x05, 0x84, 0x80, 0xde, 0xae, 0x26, 0x9e, 0xba,
0x30, 0xc2, 0xbd, 0x79, 0x3f, 0x57, 0xae, 0x6f, 0x90, 0xcb, 0x6b, 0x78,
0x5a, 0x8d, 0x52, 0xba, 0xf7, 0x3e, 0x5e, 0x25, 0x1e, 0x4b, 0x33, 0xd4,
0xef, 0xe6, 0xc3, 0x4f, 0xd7, 0x98, 0x1e, 0xef, 0x64, 0x79, 0x2d, 0x84,
0xab, 0xc9, 0x41, 0x2c, 0x91, 0x23, 0x96, 0xc8, 0x93, 0xca, 0xe4, 0xb1,
0xa8, 0x2a, 0xf1, 0x64, 0x8e, 0x23, 0x07, 0xba, 0x88, 0xc4, 0x32, 0xcc,
0xce, 0x05, 0xd8, 0xd8, 0x8c, 0xe2, 0x68, 0xb0, 0xf1, 0xe4, 0x85, 0x11,
0xc6, 0x87, 0xdb, 0xd0, 0x8b, 0x3a, 0xba, 0x06, 0x91, 0x78, 0x86, 0x93,
0x87, 0x7b, 0x79, 0xff, 0xd3, 0x65, 0x6e, 0xdd, 0xdf, 0xc1, 0xb7, 0x95,
0x60, 0xdb, 0x1f, 0x37, 0x3c, 0xcd, 0xfb, 0x5b, 0x14, 0x8a, 0x1a, 0x93,
0xa3, 0x1d, 0x4c, 0x8c, 0xb5, 0xd3, 0xd7, 0xd3, 0xc2, 0xb5, 0x9b, 0xab,
0x06, 0x36, 0xac, 0x2a, 0xa3, 0x54, 0x14, 0xa3, 0x60, 0x16, 0xa1, 0x22,
0x84, 0x05, 0x45, 0xa8, 0x08, 0x29, 0x40, 0xea, 0xe8, 0xa2, 0x88, 0xa2,
0x18, 0xad, 0x1a, 0x24, 0x95, 0x6a, 0x24, 0x59, 0x6a, 0x78, 0x22, 0xeb,
0x0a, 0x78, 0x6b, 0x04, 0x4a, 0xd4, 0xf8, 0xdd, 0x86, 0x36, 0x52, 0xca,
0x66, 0x48, 0x08, 0x49, 0xa9, 0x15, 0x61, 0x05, 0xce, 0xc8, 0xaa, 0x06,
0x77, 0xf5, 0xf9, 0xfa, 0xb2, 0xa6, 0xb5, 0x80, 0x40, 0x20, 0x14, 0xb0,
0x58, 0x4c, 0x9e, 0x50, 0xca, 0xaa, 0xc2, 0xdb, 0xcf, 0x4f, 0xad, 0x7e,
0x3c, 0x07, 0xa1, 0x82, 0x25, 0x2d, 0x16, 0x33, 0x16, 0x21, 0xeb, 0x64,
0xa9, 0x62, 0x2e, 0xf7, 0xa2, 0x8b, 0xf7, 0x96, 0xf6, 0x68, 0x22, 0x47,
0x20, 0x94, 0xe4, 0xe2, 0xe9, 0x61, 0x16, 0x96, 0x42, 0xfc, 0xec, 0xcd,
0x7b, 0xdc, 0xb8, 0xe3, 0x43, 0xea, 0x3a, 0x87, 0x0f, 0x74, 0x53, 0x2c,
0x6a, 0x6c, 0x6c, 0x27, 0x58, 0xdd, 0x88, 0xe2, 0x6a, 0xb2, 0x71, 0xe6,
0xf8, 0x00, 0xc5, 0xa2, 0x86, 0xbb, 0xc5, 0xc1, 0x73, 0x97, 0xc7, 0x59,
0x58, 0x0a, 0xf1, 0xe9, 0xad, 0x4d, 0x0a, 0x45, 0xa3, 0xbf, 0x46, 0x47,
0xbb, 0x93, 0xd1, 0x41, 0x37, 0x57, 0x6e, 0x6c, 0xe0, 0x6a, 0xb4, 0x32,
0x3e, 0xdc, 0xc6, 0xdb, 0x1f, 0xad, 0x30, 0x3e, 0xe4, 0xe1, 0xc1, 0x72,
0x88, 0x7c, 0x5e, 0x23, 0x9b, 0xd3, 0x70, 0x3a, 0xad, 0xa4, 0xd2, 0x05,
0x22, 0xd1, 0x0c, 0x6d, 0x9e, 0x46, 0x66, 0xe7, 0xfc, 0x78, 0xdc, 0x8d,
0x8c, 0x8f, 0x18, 0x85, 0x14, 0xf7, 0x16, 0x02, 0x7c, 0x76, 0xdb, 0x47,
0x32, 0x95, 0xe3, 0xc2, 0xa9, 0x41, 0x46, 0x86, 0xbc, 0x78, 0x5b, 0x1b,
0xb1, 0xd9, 0x2d, 0xd8, 0x2c, 0x2a, 0xcb, 0xeb, 0x61, 0x0a, 0x05, 0x8d,
0x70, 0x34, 0x43, 0x87, 0xd7, 0x49, 0x3a, 0x93, 0xe7, 0x93, 0x1b, 0xeb,
0xcc, 0x2d, 0xec, 0x70, 0xfd, 0xe6, 0x3a, 0x9d, 0xed, 0xcd, 0x14, 0x0a,
0x3a, 0xfe, 0x60, 0x1d, 0x36, 0x93, 0xa6, 0xd6, 0x50, 0x14, 0x84, 0x50,
0x51, 0x84, 0x6a, 0xf2, 0x6f, 0x60, 0xb7, 0x29, 0x78, 0x5a, 0x1d, 0x3c,
0x7f, 0x79, 0x82, 0x8d, 0xad, 0x38, 0xb9, 0x72, 0x56, 0xea, 0xee, 0xb2,
0xb6, 0xcf, 0x2b, 0x1e, 0xae, 0x06, 0x66, 0xc2, 0x24, 0x9a, 0x1d, 0x76,
0x8b, 0x59, 0xf6, 0xb7, 0x4f, 0xaf, 0x8b, 0x3d, 0xaa, 0xa3, 0xea, 0xf1,
0xdc, 0xb3, 0xe7, 0x7b, 0xb0, 0x5b, 0x15, 0x82, 0x91, 0x1c, 0xfb, 0x35,
0x55, 0xdb, 0x5d, 0x68, 0xf2, 0xbb, 0x61, 0x36, 0x67, 0x83, 0x95, 0xa7,
0xce, 0x75, 0x23, 0x84, 0x41, 0xf1, 0x54, 0x03, 0x2f, 0xa4, 0x44, 0x6d,
0x31, 0x7b, 0x61, 0xec, 0xb2, 0xa5, 0xf5, 0x7e, 0x9e, 0x59, 0xf8, 0x20,
0x81, 0x68, 0x3c, 0xcb, 0xc2, 0x52, 0x80, 0x43, 0xd3, 0xdd, 0xf4, 0x74,
0xb8, 0x58, 0x5c, 0x09, 0xb3, 0xb8, 0x16, 0x21, 0x9b, 0x29, 0x70, 0xfe,
0xe4, 0x10, 0xdd, 0xed, 0x8d, 0x2c, 0x2c, 0x87, 0x59, 0xdb, 0x8c, 0x91,
0xcb, 0x15, 0x78, 0xee, 0xf2, 0x38, 0xcf, 0x5c, 0x1a, 0xe5, 0xe3, 0x6b,
0xeb, 0x7c, 0x78, 0x6d, 0xc3, 0xcc, 0x41, 0x37, 0x8a, 0x53, 0x4f, 0xcc,
0xf4, 0xe1, 0xdb, 0x89, 0xb3, 0xee, 0x8b, 0x63, 0xb3, 0xaa, 0xf4, 0xf7,
0xb6, 0xb2, 0xe6, 0x8b, 0x11, 0x0a, 0x27, 0xb9, 0x70, 0x6a, 0x90, 0x37,
0x7f, 0xbb, 0xc4, 0xd1, 0x83, 0x5d, 0x6c, 0x6c, 0x19, 0x39, 0x61, 0xaa,
0xaa, 0x70, 0x67, 0x6e, 0x87, 0x83, 0x13, 0x1d, 0x64, 0xb3, 0x06, 0x61,
0xdb, 0xdb, 0xdd, 0xcc, 0xe9, 0x63, 0xfd, 0xd8, 0xac, 0x0a, 0x77, 0xe7,
0xfd, 0xdc, 0xb8, 0xb3, 0x85, 0x6f, 0x27, 0x86, 0xcb, 0x69, 0xc7, 0xe5,
0xb4, 0xf3, 0xec, 0xa5, 0x71, 0x1c, 0x76, 0x0b, 0xa1, 0x48, 0x9a, 0x74,
0xb6, 0x80, 0xa2, 0x28, 0x4c, 0x4f, 0x76, 0xf3, 0x70, 0x39, 0x48, 0x3a,
0xab, 0x91, 0xcd, 0x6b, 0xd8, 0x2c, 0x0a, 0xd3, 0x13, 0x5d, 0xcc, 0x3e,
0xf0, 0x57, 0xd4, 0x58, 0x49, 0x53, 0x08, 0xc5, 0x68, 0x86, 0x62, 0x82,
0x7e, 0x87, 0x4d, 0xe1, 0xef, 0x7d, 0xef, 0x38, 0xf9, 0x42, 0x81, 0xe1,
0x7e, 0x0f, 0x7f, 0xf0, 0xf2, 0x0c, 0x6f, 0xbd, 0xf7, 0x80, 0x4c, 0xae,
0x68, 0xd2, 0x0c, 0x02, 0x8b, 0xaa, 0xa2, 0x2a, 0x95, 0xf6, 0x9d, 0xe5,
0x7c, 0x77, 0x33, 0xb5, 0x5a, 0x51, 0x44, 0x8d, 0x6c, 0xa9, 0x4a, 0xa5,
0xb7, 0x97, 0x45, 0x55, 0xf8, 0xf3, 0x6f, 0x1f, 0xc1, 0x62, 0x55, 0xd8,
0xda, 0x49, 0x96, 0x35, 0x94, 0xaa, 0x28, 0xe5, 0x5a, 0x4f, 0xd5, 0x64,
0xdc, 0x15, 0x61, 0xbc, 0xae, 0x08, 0xa8, 0x59, 0x62, 0x2b, 0xc0, 0xd5,
0x64, 0xe3, 0x9f, 0xfc, 0xf9, 0x11, 0x36, 0xb6, 0x53, 0xac, 0x6e, 0x26,
0x8c, 0x98, 0x67, 0x29, 0x50, 0x20, 0x2a, 0xd7, 0x52, 0x1d, 0x25, 0x29,
0xa5, 0x78, 0xd7, 0x5f, 0x5b, 0x75, 0xaf, 0xb6, 0xf2, 0x3d, 0x98, 0x14,
0x45, 0x4f, 0x67, 0x03, 0x7f, 0xe7, 0x5b, 0x93, 0xac, 0xac, 0xc6, 0x58,
0xdf, 0x4e, 0xa3, 0x2a, 0x15, 0x67, 0x44, 0x94, 0x84, 0x6c, 0x2f, 0xcf,
0x60, 0x77, 0xf4, 0x5e, 0xd4, 0x80, 0xd5, 0x44, 0x2a, 0xcf, 0xa6, 0x2f,
0xca, 0xc8, 0xa0, 0x97, 0x23, 0xd3, 0x86, 0x10, 0xac, 0xf9, 0x0c, 0xd6,
0xfd, 0xf0, 0x74, 0x37, 0x13, 0x23, 0x5e, 0xb6, 0x03, 0x49, 0x6c, 0x56,
0x95, 0x81, 0x3e, 0x37, 0x81, 0x90, 0xd1, 0xab, 0x2c, 0x6c, 0xb6, 0x33,
0xd0, 0x74, 0x89, 0xdd, 0xa6, 0xf2, 0xfc, 0xe5, 0x31, 0xde, 0x7a, 0x7f,
0x89, 0x6c, 0xae, 0x88, 0x50, 0xa0, 0xa7, 0xab, 0x05, 0xad, 0xa8, 0xb1,
0xbc, 0x11, 0xa3, 0xaf, 0xab, 0x19, 0x87, 0xdd, 0xc2, 0x67, 0x77, 0xb7,
0x38, 0x71, 0xa4, 0x97, 0x5b, 0xf7, 0x76, 0x70, 0x36, 0xd8, 0xe8, 0x6c,
0x6b, 0xe2, 0xea, 0xcd, 0x4d, 0xba, 0xda, 0x9b, 0x18, 0x1d, 0xf2, 0x70,
0xfd, 0xb6, 0x8f, 0xf5, 0x8d, 0x28, 0x7d, 0xdd, 0x2d, 0x3c, 0x71, 0x66,
0x88, 0x6c, 0xb6, 0x40, 0x20, 0x94, 0xe1, 0xe1, 0x4a, 0x98, 0x60, 0x28,
0xc1, 0xc1, 0x89, 0x4e, 0xee, 0x3d, 0xf0, 0x73, 0xe6, 0xf8, 0x20, 0x47,
0x0f, 0x75, 0x93, 0x48, 0x16, 0x38, 0x7b, 0xbc, 0x9f, 0x3b, 0xf7, 0xb6,
0x48, 0xa4, 0x0b, 0x65, 0x95, 0xdf, 0xdb, 0xed, 0x66, 0x3b, 0x90, 0x20,
0x93, 0x2d, 0x96, 0x85, 0xcc, 0xc0, 0x35, 0x26, 0x16, 0x53, 0xac, 0xb4,
0xba, 0x1c, 0xfc, 0xe9, 0x1f, 0x1c, 0xe1, 0x0f, 0xbf, 0x71, 0x94, 0x42,
0x41, 0x67, 0xa8, 0xdf, 0xcb, 0xc8, 0xa0, 0x97, 0x83, 0x93, 0x5d, 0x4c,
0x8d, 0xb6, 0xb1, 0xb0, 0x14, 0x60, 0x6c, 0xc8, 0xcb, 0x5f, 0xfc, 0xe1,
0x29, 0x5e, 0x7a, 0x76, 0x0a, 0xa9, 0xeb, 0xac, 0x6c, 0x18, 0x69, 0x3a,
0x2d, 0xcd, 0x76, 0xfe, 0xee, 0x77, 0x8f, 0xf3, 0xe2, 0xb3, 0x93, 0x7c,
0xf3, 0xc5, 0x03, 0x68, 0x9a, 0xc6, 0x96, 0x3f, 0xc9, 0xe5, 0xb3, 0x83,
0xfc, 0x83, 0x3f, 0x3a, 0xc1, 0xe9, 0x63, 0xbd, 0x04, 0x42, 0x69, 0x5e,
0x78, 0x6a, 0x8c, 0x3f, 0xfd, 0x83, 0x19, 0x1a, 0x1c, 0x56, 0x4e, 0x1c,
0xee, 0x42, 0xea, 0x12, 0x55, 0x15, 0xfc, 0xe5, 0x1f, 0x1d, 0x05, 0x5d,
0x62, 0xb5, 0x28, 0x7c, 0xf3, 0x85, 0x09, 0xf2, 0xf9, 0x22, 0xaf, 0x3c,
0x37, 0xca, 0x77, 0x5e, 0x9e, 0xe0, 0xc8, 0x64, 0x1b, 0xab, 0x1b, 0x31,
0x8e, 0x1d, 0xf0, 0xf2, 0x8d, 0xaf, 0x8c, 0x72, 0xf6, 0x58, 0x17, 0x3d,
0x9d, 0x4e, 0x26, 0x47, 0xdc, 0x5c, 0xbf, 0x1b, 0xe2, 0x85, 0x4b, 0xfd,
0x64, 0xb3, 0x45, 0x02, 0xe1, 0x2c, 0x52, 0x0a, 0xbe, 0xfe, 0xec, 0x00,
0x2f, 0x3d, 0x33, 0xc8, 0xcb, 0xcf, 0x0e, 0x30, 0x33, 0xe5, 0xe1, 0xde,
0x42, 0x94, 0xde, 0xce, 0x06, 0xfe, 0xe4, 0xd5, 0x71, 0x5e, 0x7b, 0x61,
0x08, 0x55, 0x40, 0x30, 0x92, 0xe5, 0x0f, 0x5e, 0x18, 0xe6, 0xbb, 0x2f,
0x8f, 0x72, 0xfc, 0x90, 0x17, 0xdf, 0x76, 0x8a, 0x91, 0xfe, 0x26, 0xbe,
0xfb, 0xf2, 0x28, 0xcf, 0x5e, 0xec, 0xe5, 0xf9, 0x8b, 0xbd, 0x04, 0xc3,
0x19, 0x5a, 0x9a, 0x6c, 0x1c, 0x3f, 0xd4, 0xc6, 0x7b, 0x9f, 0x6e, 0xf3,
0xf4, 0xb9, 0x6e, 0xbe, 0xf7, 0xf5, 0x71, 0xa6, 0xc7, 0x5a, 0x79, 0xb8,
0x12, 0x25, 0x93, 0x2d, 0xd6, 0x0a, 0xd9, 0xfe, 0x21, 0x90, 0xfa, 0x46,
0x23, 0xa5, 0x1c, 0x29, 0x8d, 0xe5, 0xb5, 0x08, 0x5e, 0x77, 0x03, 0x17,
0x4e, 0x0d, 0x11, 0x4b, 0x64, 0x58, 0xdd, 0x8c, 0x33, 0xff, 0x30, 0xc0,
0x60, 0x5f, 0x2b, 0xaf, 0x3c, 0x3f, 0xcd, 0xe8, 0x90, 0x97, 0xf7, 0x3f,
0x5e, 0xe6, 0xcd, 0xdf, 0x2e, 0x52, 0x28, 0x14, 0x79, 0xe2, 0xec, 0x30,
0x9e, 0x56, 0x07, 0xe9, 0x4c, 0x81, 0x06, 0x87, 0x85, 0xc1, 0xfe, 0x56,
0xae, 0xdf, 0xf1, 0xa1, 0x69, 0x86, 0x3d, 0xef, 0xe9, 0x6c, 0xc2, 0x66,
0x53, 0x59, 0x5c, 0x8d, 0xe2, 0x74, 0xa8, 0x0c, 0xf6, 0xbb, 0xb9, 0x39,
0xeb, 0x47, 0xa0, 0x73, 0x78, 0xba, 0x9b, 0xf7, 0xae, 0xac, 0x32, 0xd4,
0xdf, 0xca, 0xd4, 0x58, 0x1b, 0x6f, 0xbd, 0xbf, 0x8c, 0xd4, 0x75, 0xce,
0x1c, 0x1b, 0x20, 0x96, 0xcc, 0xf2, 0xf1, 0x8d, 0x0d, 0x22, 0xd1, 0x34,
0x17, 0xcf, 0x0e, 0x33, 0xd0, 0xdb, 0x8a, 0xae, 0xeb, 0x24, 0x52, 0x79,
0x46, 0x87, 0xbc, 0xfc, 0xcd, 0x2f, 0xef, 0x31, 0xb7, 0xe0, 0x27, 0x1a,
0xcb, 0x72, 0xe4, 0x40, 0x17, 0x27, 0x8e, 0xf4, 0x91, 0xca, 0x14, 0xb0,
0x5b, 0x15, 0xb2, 0x39, 0x8d, 0x64, 0xaa, 0x48, 0x7f, 0x4f, 0x2b, 0xf9,
0x9c, 0x46, 0x28, 0x92, 0x2d, 0x37, 0x1b, 0x29, 0xb5, 0x74, 0x12, 0x8a,
0x15, 0xa1, 0x18, 0xda, 0xe9, 0xf8, 0xa1, 0x4e, 0xda, 0xbc, 0x4e, 0xfe,
0xea, 0x07, 0x9f, 0xf2, 0xcc, 0x13, 0x63, 0xf8, 0xb6, 0xe3, 0xbc, 0x7b,
0x65, 0x89, 0x3f, 0xfc, 0xc6, 0x71, 0x66, 0xe7, 0x76, 0xf8, 0xf6, 0x2b,
0x33, 0x04, 0x42, 0x46, 0x58, 0xea, 0xa9, 0x0b, 0xa3, 0x7c, 0x74, 0x75,
0x8d, 0x6c, 0x4e, 0x63, 0xb0, 0xa7, 0x85, 0x3f, 0xfb, 0xce, 0x71, 0x16,
0x57, 0xc2, 0x14, 0x8b, 0x3a, 0x53, 0xe3, 0x1d, 0xc4, 0x13, 0x39, 0xfe,
0xec, 0x3b, 0xc7, 0x79, 0xf3, 0xbd, 0x45, 0x86, 0xfa, 0xdd, 0x78, 0xdc,
0x8d, 0xe8, 0xba, 0x64, 0xa0, 0xb7, 0x95, 0x7f, 0xfd, 0xd7, 0xd7, 0x38,
0x7d, 0xac, 0xcf, 0x8c, 0x05, 0x37, 0xf2, 0xed, 0x97, 0x0f, 0xb2, 0xb2,
0x1e, 0x65, 0x78, 0xb0, 0xc5, 0xa4, 0x88, 0x5a, 0x98, 0x1c, 0xf5, 0xf2,
0xaf, 0xff, 0xd3, 0x4d, 0x9e, 0xba, 0x30, 0x40, 0x73, 0x93, 0x95, 0xb1,
0xa1, 0x56, 0x2e, 0x9d, 0xe9, 0xe3, 0x93, 0x1b, 0x5b, 0xd8, 0x6d, 0x16,
0x8e, 0x4c, 0x79, 0x99, 0x18, 0x6a, 0x61, 0x79, 0x2d, 0xc6, 0x87, 0xd7,
0xb6, 0x29, 0xe4, 0x35, 0x84, 0xa2, 0xf0, 0x67, 0xaf, 0x8d, 0x63, 0xb5,
0x2a, 0xfc, 0xfa, 0xfd, 0x4d, 0x5e, 0x78, 0x6a, 0x80, 0xd5, 0xcd, 0x04,
0xaf, 0x7e, 0x75, 0x08, 0x8b, 0x45, 0xe1, 0xd6, 0x5c, 0x98, 0x73, 0xc7,
0x3a, 0x18, 0x1b, 0x6a, 0x61, 0xe6, 0x60, 0x1b, 0xff, 0xee, 0x87, 0x73,
0x1c, 0x3f, 0xe4, 0xa5, 0xb7, 0xcb, 0x49, 0x73, 0x93, 0x8d, 0x53, 0x33,
0x1d, 0xfc, 0xe0, 0x67, 0x4b, 0x9c, 0x9e, 0x69, 0xa7, 0xc9, 0x69, 0xa1,
0xb5, 0xc5, 0x8e, 0xcb, 0xa9, 0x92, 0xcb, 0xeb, 0x3c, 0x73, 0xa1, 0x9f,
0x5f, 0xbe, 0xbb, 0xc6, 0x85, 0x13, 0x5d, 0x04, 0x42, 0x19, 0xd6, 0x7d,
0xc9, 0xbd, 0x1b, 0x13, 0xd7, 0xb4, 0x6c, 0x29, 0x87, 0x0b, 0x2a, 0x41,
0xd1, 0x6a, 0xc8, 0x96, 0xce, 0x14, 0x78, 0xfb, 0xc3, 0x25, 0x8e, 0x45,
0xd3, 0x3c, 0x73, 0x71, 0x8c, 0x81, 0xa5, 0x20, 0xef, 0x7e, 0xbc, 0x8a,
0x3f, 0x98, 0xc4, 0x6e, 0xb3, 0x10, 0x8a, 0x64, 0x18, 0x1a, 0xf0, 0x70,
0xff, 0x61, 0x90, 0x1b, 0x77, 0xb7, 0x59, 0xdb, 0x8c, 0x73, 0xec, 0x50,
0x17, 0x5f, 0xb9, 0x3c, 0x46, 0x47, 0x9b, 0x93, 0x0f, 0xaf, 0xad, 0x53,
0x28, 0xea, 0x48, 0x29, 0x0d, 0x0f, 0xb2, 0x58, 0xa0, 0xd9, 0xd5, 0x80,
0x94, 0x92, 0x3b, 0x0f, 0xc2, 0x8c, 0x8d, 0xb4, 0xd3, 0xdd, 0xd1, 0xc4,
0xb5, 0x3b, 0x3b, 0x34, 0xbb, 0x1a, 0xb8, 0x78, 0xaa, 0x9f, 0xdf, 0x7c,
0xb0, 0xc2, 0xf9, 0x13, 0xbd, 0x7c, 0xf5, 0xa9, 0x31, 0x7e, 0xf2, 0xfa,
0x7d, 0x36, 0xb7, 0xe3, 0x9c, 0x39, 0x3e, 0xc0, 0xe4, 0x58, 0x1b, 0x3f,
0x7f, 0xf3, 0x01, 0x7f, 0xf5, 0x83, 0xcf, 0x38, 0x38, 0xd1, 0xc6, 0xcc,
0xc1, 0x6e, 0xba, 0x3a, 0x9a, 0x28, 0x16, 0x0c, 0x47, 0x20, 0x59, 0xd0,
0x78, 0xb0, 0x1c, 0x66, 0x79, 0x3d, 0x8a, 0x40, 0xe0, 0x72, 0x3a, 0x18,
0x19, 0x6c, 0xe7, 0xd8, 0xa1, 0x7e, 0x0a, 0x85, 0x02, 0x4e, 0xa7, 0x03,
0x7f, 0x20, 0xb1, 0xdb, 0xa3, 0x43, 0x01, 0xa1, 0x82, 0x54, 0xc9, 0x66,
0x8b, 0x28, 0x42, 0x70, 0x6b, 0xd6, 0x47, 0x28, 0x9a, 0xc5, 0xe5, 0x74,
0xf0, 0xa3, 0x9f, 0xdd, 0x24, 0x5f, 0x34, 0x32, 0x58, 0x1a, 0x1c, 0x36,
0x0e, 0x4c, 0x74, 0x92, 0xce, 0x14, 0x68, 0x6c, 0xb0, 0xb2, 0xbc, 0x16,
0x46, 0xd3, 0x8c, 0xfb, 0xeb, 0x6c, 0x73, 0x12, 0x4d, 0xe4, 0x78, 0xfd,
0xed, 0x79, 0x2e, 0x9e, 0x1e, 0xa2, 0xbf, 0x47, 0xe1, 0xd0, 0x54, 0x07,
0x0e, 0xbb, 0x51, 0xed, 0x94, 0xcb, 0x69, 0x6c, 0xef, 0x24, 0xf0, 0xb8,
0x1b, 0xb8, 0xf7, 0x20, 0xc0, 0xfd, 0x85, 0x10, 0x3b, 0x81, 0x04, 0x43,
0xfd, 0x6e, 0x54, 0x45, 0xf0, 0xd1, 0xb5, 0x75, 0xdc, 0xee, 0x46, 0x46,
0x06, 0x5a, 0xf9, 0xeb, 0xff, 0x7a, 0x97, 0xbf, 0xff, 0xbd, 0xa3, 0x5c,
0xbd, 0xb3, 0xcd, 0x83, 0x65, 0xa3, 0x29, 0x61, 0x67, 0xbb, 0x93, 0x36,
0xb7, 0x83, 0x77, 0x3e, 0x5c, 0xe3, 0xc7, 0x6f, 0x2e, 0xf1, 0x8f, 0xff,
0xe4, 0x30, 0x00, 0x2d, 0x2e, 0x3b, 0xef, 0x7e, 0xec, 0x23, 0x69, 0x3a,
0x60, 0xee, 0x16, 0x1b, 0x5e, 0x4f, 0x03, 0x3f, 0x7e, 0x63, 0x99, 0xed,
0x60, 0x06, 0x4d, 0x97, 0x34, 0xbb, 0x6c, 0xf4, 0x74, 0x3a, 0xd9, 0xf2,
0xa7, 0xe9, 0xef, 0x72, 0xb2, 0xb9, 0x93, 0x66, 0x66, 0xda, 0xc3, 0xdd,
0x07, 0x61, 0xee, 0x2d, 0xc5, 0xc8, 0x64, 0x34, 0xda, 0x3d, 0x0d, 0xb8,
0x9b, 0x6d, 0x2c, 0xad, 0xc6, 0x58, 0xd9, 0x4c, 0x92, 0xcd, 0x6b, 0xa8,
0xaa, 0x60, 0x64, 0xa0, 0x99, 0x2d, 0x7f, 0x9a, 0x23, 0x93, 0x6e, 0x34,
0x4d, 0x67, 0x72, 0xd8, 0x4d, 0x38, 0x6a, 0x54, 0x52, 0x19, 0x6c, 0x9e,
0x34, 0x3c, 0x80, 0x9a, 0xa7, 0xd8, 0x5b, 0x93, 0x95, 0x04, 0xac, 0x9c,
0xbe, 0x6d, 0xfe, 0x55, 0x28, 0xea, 0x5c, 0xbd, 0xbd, 0xc5, 0x9b, 0xef,
0xce, 0xd3, 0xd1, 0xd1, 0xc4, 0xff, 0xf4, 0x97, 0x17, 0x98, 0x1c, 0xeb,
0xe0, 0x3f, 0xfe, 0xe8, 0x3a, 0x3f, 0xfc, 0xc9, 0x2d, 0xd2, 0x99, 0x3c,
0x7f, 0xf6, 0xdd, 0x63, 0x1c, 0x9a, 0xec, 0x20, 0x99, 0x2e, 0xf0, 0x9b,
0x0f, 0x57, 0x78, 0xe7, 0xc3, 0x25, 0x1a, 0x1b, 0x6c, 0x3c, 0x77, 0x79,
0x84, 0xb3, 0xc7, 0x7a, 0x69, 0xf7, 0x34, 0x96, 0xeb, 0x0d, 0x4b, 0x18,
0x20, 0x93, 0xc9, 0xb3, 0xb2, 0x16, 0xe1, 0xe4, 0x4c, 0x37, 0x20, 0x8d,
0x41, 0x6e, 0x6d, 0xe0, 0xc0, 0x98, 0x87, 0x77, 0x3f, 0x5a, 0x66, 0x65,
0x2d, 0xcc, 0xd7, 0x9e, 0x9d, 0x20, 0x9e, 0xcc, 0xf3, 0xc6, 0x3b, 0x0f,
0xd8, 0xd9, 0x49, 0xf2, 0xda, 0x8b, 0x07, 0x18, 0x1f, 0xf6, 0x30, 0xfb,
0x20, 0xc0, 0xaf, 0xdf, 0x5b, 0xc4, 0x6a, 0x51, 0xf1, 0x7a, 0x1a, 0x79,
0xed, 0x6b, 0x07, 0xe9, 0xed, 0x6a, 0xc6, 0x6a, 0xb1, 0xa0, 0x69, 0x90,
0x48, 0x1a, 0x75, 0x9e, 0x6f, 0xbc, 0xb3, 0xc0, 0x47, 0x9f, 0x2e, 0xb3,
0xb2, 0x1e, 0xc5, 0xd3, 0xd2, 0x48, 0x57, 0x47, 0x0b, 0x56, 0x8b, 0xc5,
0x08, 0xe3, 0x28, 0x8a, 0x11, 0x13, 0x54, 0xd4, 0xaa, 0x6a, 0x6c, 0xe8,
0xeb, 0x69, 0x46, 0x22, 0x19, 0x19, 0xf4, 0xa0, 0xe9, 0x3a, 0xeb, 0x9b,
0x31, 0x3c, 0x2d, 0x0d, 0xf8, 0x83, 0x29, 0x12, 0xc9, 0x1c, 0x81, 0x70,
0x9a, 0x7b, 0x0b, 0x7e, 0x3e, 0xf8, 0x74, 0x95, 0xd7, 0xdf, 0x79, 0x40,
0x32, 0x9d, 0x47, 0x55, 0x15, 0x3a, 0x3b, 0x5c, 0x6c, 0xfb, 0x13, 0xa4,
0xb3, 0x45, 0x7a, 0xbb, 0x5b, 0x58, 0x5c, 0x09, 0xb2, 0xed, 0x4f, 0x10,
0x8c, 0xa4, 0xb9, 0x75, 0x77, 0x8b, 0xdf, 0x7e, 0xba, 0xca, 0x3b, 0x57,
0x56, 0xe8, 0xee, 0x68, 0x42, 0x51, 0x04, 0x4e, 0xa7, 0x95, 0x60, 0x38,
0xcb, 0xe8, 0xa0, 0x9b, 0x2d, 0x7f, 0x92, 0x35, 0x5f, 0x9c, 0x0b, 0xa7,
0xfa, 0x58, 0x59, 0x8f, 0x32, 0xbb, 0x10, 0x62, 0x2b, 0x90, 0xc4, 0xdb,
0xea, 0xe0, 0xc9, 0x73, 0x7d, 0xa6, 0x60, 0x86, 0x71, 0x36, 0xda, 0xb8,
0xff, 0x20, 0x80, 0x45, 0x81, 0x8e, 0xf6, 0x46, 0xde, 0xbb, 0xb2, 0xce,
0xea, 0x46, 0x9c, 0x53, 0x87, 0xdb, 0x40, 0x18, 0xcc, 0xde, 0xd8, 0x80,
0x8b, 0x96, 0x66, 0x3b, 0x3d, 0x5d, 0x4e, 0x2e, 0x9d, 0xea, 0x22, 0x12,
0xcd, 0xb1, 0xba, 0x99, 0x24, 0x96, 0xc8, 0xb3, 0xb4, 0x16, 0xe7, 0x83,
0x6b, 0x3b, 0xbc, 0x73, 0xc5, 0xc7, 0xfc, 0x62, 0x94, 0x16, 0x97, 0x9d,
0x73, 0x47, 0xdb, 0xe9, 0xed, 0x6e, 0xe2, 0xf6, 0xfd, 0x30, 0x5d, 0xed,
0x4e, 0x5a, 0x9b, 0xed, 0x1c, 0x9e, 0x74, 0xd3, 0xe4, 0xb4, 0x31, 0xb7,
0x18, 0xc7, 0xeb, 0x6e, 0xe0, 0xe1, 0x4a, 0x82, 0x48, 0x3c, 0x4f, 0x30,
0x9c, 0xe5, 0xda, 0x9d, 0x20, 0xbf, 0x78, 0x67, 0x9d, 0x85, 0x95, 0x24,
0x12, 0x05, 0xd5, 0xdd, 0xf3, 0xd4, 0xf7, 0x2b, 0x00, 0x5f, 0x82, 0x34,
0x4a, 0xe0, 0xe5, 0xa3, 0x6a, 0xeb, 0xf6, 0x60, 0x96, 0x8d, 0x5c, 0xaa,
0x2c, 0xab, 0xeb, 0x11, 0x1a, 0x1d, 0x16, 0xbc, 0x6e, 0x27, 0xdb, 0x81,
0x04, 0x6b, 0xbe, 0x38, 0x8b, 0xab, 0x11, 0x02, 0xa1, 0x14, 0x17, 0x4f,
0x0f, 0x33, 0xd4, 0xd7, 0x4a, 0x26, 0x5b, 0x20, 0x9b, 0x2f, 0xe2, 0x70,
0x58, 0x78, 0xcb, 0x34, 0x13, 0xa7, 0x67, 0xfa, 0x68, 0x75, 0x19, 0x40,
0xdd, 0x61, 0xb3, 0xb0, 0xb4, 0x1a, 0x41, 0xd3, 0x74, 0x42, 0x91, 0x0c,
0x97, 0xcf, 0x0e, 0x12, 0x0c, 0x26, 0xd9, 0xf2, 0x27, 0x08, 0x86, 0x12,
0x5c, 0x38, 0x33, 0x44, 0x38, 0x92, 0xe6, 0xce, 0x9c, 0x9f, 0x76, 0x4f,
0x23, 0x4f, 0x9e, 0x1f, 0x61, 0x71, 0x35, 0xcc, 0x9d, 0x39, 0x3f, 0xe9,
0x4c, 0x9e, 0x8b, 0xa7, 0x87, 0x68, 0x6d, 0x76, 0x50, 0xd4, 0x75, 0x06,
0xfb, 0xdc, 0xfc, 0xe0, 0xbf, 0xde, 0x42, 0x55, 0x15, 0x9e, 0xba, 0x30,
0x8a, 0xbb, 0xc5, 0x81, 0xa6, 0x49, 0x06, 0xfb, 0x3d, 0x6c, 0xed, 0x24,
0xd8, 0xf2, 0x27, 0x09, 0x45, 0x73, 0x6c, 0x6e, 0x27, 0x49, 0x67, 0x0b,
0x58, 0xad, 0x56, 0x36, 0xb6, 0x52, 0x14, 0xa5, 0x81, 0xc5, 0x8c, 0x10,
0x92, 0xcd, 0x24, 0x60, 0x41, 0xca, 0x22, 0xba, 0x5e, 0x64, 0x62, 0xb8,
0x8d, 0x78, 0xa2, 0xc8, 0xc6, 0x56, 0x8c, 0x9b, 0x77, 0x77, 0xb0, 0xdb,
0xac, 0xac, 0xfb, 0x62, 0xdc, 0xb9, 0x1f, 0x20, 0x96, 0xc8, 0x70, 0xfe,
0xe4, 0x20, 0xdd, 0x9d, 0xcd, 0xdc, 0x9d, 0xf3, 0x13, 0x89, 0xe5, 0xb0,
0xa8, 0x0a, 0x6d, 0x1e, 0x27, 0x9b, 0xdb, 0x09, 0x96, 0xd7, 0x63, 0x38,
0x1c, 0x56, 0xee, 0xdc, 0xdf, 0xe1, 0xee, 0x7c, 0x00, 0x4f, 0x6b, 0x23,
0xe7, 0x4e, 0x0e, 0x22, 0x75, 0xc9, 0xb5, 0xdb, 0x5b, 0xe4, 0xf3, 0x3a,
0x63, 0xc3, 0x1e, 0x42, 0xd1, 0x2c, 0x4b, 0xab, 0x51, 0xa4, 0x84, 0x5f,
0xbd, 0xb7, 0x44, 0x2c, 0x91, 0x43, 0x2b, 0x4a, 0x7e, 0xfa, 0xe6, 0x02,
0xa1, 0x48, 0x8e, 0xed, 0x40, 0x8a, 0x89, 0x61, 0x0f, 0xd3, 0xe3, 0xed,
0xbc, 0xfe, 0xf6, 0x22, 0x37, 0xef, 0x1b, 0xc5, 0x30, 0x9f, 0xcd, 0x06,
0xc8, 0xe6, 0x75, 0xdc, 0x2d, 0x76, 0x3e, 0xf9, 0x6c, 0x9b, 0xa5, 0xd5,
0x38, 0x56, 0xbb, 0x85, 0xf5, 0xed, 0x14, 0x05, 0x4d, 0x72, 0xf1, 0x44,
0x27, 0x5d, 0x1d, 0x4d, 0xe4, 0xf3, 0x1a, 0xee, 0x56, 0x07, 0xff, 0xe5,
0x97, 0x8b, 0xdc, 0x5f, 0x8c, 0x93, 0x4e, 0x17, 0x98, 0x39, 0xd0, 0xce,
0x70, 0xbf, 0x8b, 0x85, 0xe5, 0x38, 0xb7, 0xee, 0x85, 0x19, 0xe8, 0x6d,
0xe2, 0xe8, 0xc1, 0x76, 0xde, 0xbd, 0xe2, 0xe3, 0xde, 0xc3, 0x28, 0xa7,
0x8f, 0x75, 0x12, 0x89, 0xe5, 0x18, 0x1f, 0x6a, 0xe6, 0xb7, 0x9f, 0xf8,
0xb8, 0x76, 0x27, 0x8c, 0xdd, 0xa6, 0xf0, 0xe1, 0x8d, 0x00, 0x0b, 0x4b,
0x71, 0x7a, 0x3a, 0x9d, 0x9c, 0x9a, 0x69, 0x27, 0x1a, 0xcb, 0xf1, 0x60,
0xd5, 0x48, 0xb7, 0x37, 0xdb, 0x79, 0x8a, 0x1a, 0x4b, 0xa9, 0x28, 0x02,
0x4d, 0xd6, 0x36, 0xca, 0xad, 0x2b, 0x5c, 0xac, 0x98, 0x92, 0x3d, 0x72,
0xcc, 0x15, 0x45, 0x61, 0x62, 0xc4, 0xc3, 0xc9, 0x99, 0x7e, 0x90, 0xf0,
0xe1, 0xa7, 0xab, 0xac, 0x6f, 0x27, 0x70, 0x36, 0xd8, 0x98, 0x39, 0xd0,
0xc9, 0x60, 0xbf, 0x9b, 0x89, 0x61, 0x0f, 0x0f, 0x96, 0x42, 0xfc, 0xe8,
0x6f, 0x67, 0x29, 0x6a, 0x92, 0x0e, 0xaf, 0x93, 0xa3, 0x07, 0x3a, 0xe9,
0xef, 0x6d, 0x65, 0x74, 0xc8, 0xc3, 0xad, 0x59, 0x1f, 0x1f, 0x5e, 0xdb,
0x60, 0xdd, 0x17, 0xe7, 0xe8, 0x81, 0x0e, 0x4e, 0x1d, 0xed, 0xe5, 0xdf,
0xfd, 0xf0, 0x26, 0xba, 0x2e, 0x39, 0x76, 0xb0, 0x8b, 0x03, 0x13, 0x1d,
0xfc, 0xe2, 0x37, 0x0f, 0x48, 0xa5, 0xf3, 0x5c, 0x3e, 0x3b, 0xc8, 0xf0,
0x80, 0x87, 0x9f, 0xbd, 0x39, 0xc7, 0x4e, 0x30, 0x85, 0xa7, 0xa5, 0x81,
0xaf, 0x3d, 0x3b, 0xce, 0xa5, 0xb3, 0xc3, 0xfc, 0xe4, 0x8d, 0x7b, 0xbc,
0xf1, 0xce, 0x22, 0x9a, 0xae, 0x1b, 0x31, 0xd4, 0xc3, 0x5d, 0x0c, 0xf6,
0x7b, 0x38, 0x35, 0xd3, 0xcb, 0x3f, 0xff, 0xbf, 0x3e, 0xe4, 0xe1, 0x4a,
0xb8, 0x7c, 0xdd, 0x3d, 0x5d, 0xcd, 0x9c, 0x3c, 0xda, 0xc7, 0x3b, 0x1f,
0xae, 0x92, 0x48, 0x17, 0x29, 0xf5, 0x85, 0x2d, 0x11, 0xb0, 0x52, 0xea,
0xe8, 0x5a, 0x1e, 0x28, 0x98, 0x35, 0x85, 0xd2, 0x4c, 0x0f, 0xaf, 0x62,
0xfe, 0x75, 0x89, 0x50, 0x84, 0xb1, 0xe7, 0x81, 0xf9, 0x59, 0x75, 0x81,
0x08, 0x66, 0x8b, 0x4e, 0x55, 0x55, 0xcc, 0x32, 0x3f, 0x89, 0xaa, 0xaa,
0x28, 0x8a, 0x40, 0x97, 0x46, 0xe9, 0x5c, 0xa9, 0x35, 0x42, 0xa5, 0x19,
0xb0, 0x52, 0x66, 0x1f, 0x8c, 0x1e, 0x1c, 0x15, 0xba, 0x42, 0x51, 0x55,
0xe3, 0x9c, 0xba, 0x91, 0xef, 0xaf, 0x98, 0x3d, 0x3d, 0xa4, 0x04, 0xc5,
0xa2, 0xa2, 0x4b, 0x89, 0x62, 0xb6, 0x19, 0xd5, 0xcd, 0xb9, 0xfd, 0xa7,
0x7f, 0x7e, 0x10, 0x87, 0xc3, 0xca, 0xbf, 0xfc, 0x0f, 0xf7, 0xc9, 0x64,
0x34, 0x34, 0xf3, 0x1a, 0xcb, 0x05, 0x23, 0x66, 0x16, 0x0c, 0xc8, 0xb2,
0xf7, 0xa9, 0xeb, 0x92, 0x99, 0xa9, 0x56, 0xfe, 0xee, 0x77, 0xa6, 0xf8,
0x97, 0x7f, 0x35, 0xcb, 0xe2, 0x46, 0x12, 0x69, 0x5e, 0xbf, 0x22, 0x84,
0x99, 0xa4, 0x40, 0xcd, 0xf1, 0xba, 0x6e, 0x9c, 0xb3, 0xaa, 0x31, 0x71,
0x55, 0x48, 0x62, 0x57, 0x87, 0x9a, 0xba, 0x18, 0x95, 0xac, 0x0a, 0x19,
0x88, 0x0a, 0xdd, 0x51, 0x4d, 0xde, 0x85, 0x22, 0x19, 0xd6, 0x37, 0x0d,
0xae, 0xec, 0xfc, 0xe9, 0x21, 0x1a, 0x1d, 0x56, 0xb6, 0x76, 0x12, 0x2c,
0xae, 0x46, 0x08, 0x85, 0x93, 0x0c, 0xf5, 0xb5, 0x72, 0x68, 0xaa, 0x13,
0x87, 0xdd, 0x42, 0x24, 0x96, 0x25, 0x1c, 0xcd, 0x30, 0xbf, 0x14, 0x66,
0x63, 0x2b, 0x4a, 0x4f, 0x67, 0x33, 0xc9, 0x74, 0x81, 0x83, 0x13, 0xed,
0x9c, 0x38, 0xdc, 0x8d, 0x50, 0x14, 0xba, 0x3b, 0x9b, 0xc9, 0xe5, 0x0a,
0xc4, 0xe2, 0x39, 0x42, 0xd1, 0x0c, 0x9d, 0x6d, 0x4e, 0x26, 0x47, 0xbd,
0x2c, 0x2c, 0x87, 0x59, 0xdd, 0x88, 0x61, 0x51, 0xe1, 0xe2, 0x99, 0x21,
0x22, 0xd1, 0x0c, 0xbd, 0x5d, 0x2e, 0x86, 0x07, 0x3c, 0x6c, 0xf9, 0xe3,
0x78, 0xdc, 0x4e, 0xb3, 0xe4, 0xcf, 0xe8, 0xf1, 0xb1, 0xbc, 0x1e, 0x23,
0x95, 0xca, 0x72, 0xe2, 0x48, 0x2f, 0xbd, 0xdd, 0x2e, 0x9c, 0x0d, 0x56,
0xc2, 0xd1, 0x2c, 0xb9, 0x82, 0xa4, 0xc5, 0xd5, 0x48, 0x57, 0x47, 0x33,
0x2b, 0x1b, 0x49, 0x8a, 0x9a, 0x99, 0x87, 0xaf, 0xd8, 0x50, 0x54, 0x3b,
0xaa, 0xd5, 0x6a, 0x3a, 0x00, 0x06, 0x29, 0x2b, 0xcb, 0xbb, 0x70, 0x94,
0x34, 0x9e, 0x6a, 0x08, 0xa4, 0x6a, 0x98, 0x5a, 0xbd, 0xc4, 0xc6, 0x8b,
0xca, 0xe7, 0x98, 0x1d, 0x15, 0x15, 0x33, 0xab, 0xa2, 0xcc, 0xec, 0x0b,
0xc5, 0x4c, 0x45, 0x57, 0xaa, 0x08, 0x53, 0xa5, 0xd2, 0x81, 0xb1, 0xc4,
0xf4, 0x0b, 0x61, 0xf6, 0xae, 0x55, 0xcb, 0x19, 0x1c, 0x12, 0xc5, 0x6c,
0x6c, 0x22, 0x40, 0xa8, 0xe5, 0xde, 0xb6, 0x46, 0x39, 0x5d, 0xa9, 0x29,
0x9d, 0x52, 0x5e, 0x30, 0x42, 0x11, 0x84, 0x42, 0x19, 0x6e, 0xcf, 0x85,
0xf1, 0x87, 0xf2, 0xe5, 0xc4, 0x84, 0x92, 0x60, 0x4a, 0xa9, 0xa3, 0x4b,
0xbd, 0xdc, 0x58, 0x58, 0x4a, 0x59, 0x5e, 0x0c, 0x99, 0x6c, 0x81, 0xc5,
0xe5, 0x28, 0x0f, 0xd7, 0xe3, 0x14, 0x0b, 0x5a, 0xcd, 0x31, 0x95, 0x1d,
0x4b, 0x64, 0xcd, 0xc2, 0x82, 0x5d, 0x2d, 0xd6, 0x6b, 0x5b, 0x16, 0xc9,
0x5d, 0x44, 0x9c, 0xdc, 0x23, 0x18, 0x5a, 0xd5, 0xca, 0x91, 0xd2, 0xb6,
0x29, 0xa2, 0x5c, 0x65, 0xb3, 0xe6, 0x8b, 0xb1, 0xb6, 0x11, 0x61, 0x6a,
0xac, 0x93, 0x13, 0x47, 0x7a, 0x40, 0x4a, 0x62, 0x89, 0x1c, 0xad, 0x2d,
0x8d, 0xbc, 0xfd, 0xe1, 0x12, 0x8a, 0x50, 0x78, 0xf2, 0xfc, 0x30, 0xad,
0x2d, 0x0e, 0x2c, 0x16, 0x41, 0x30, 0x9c, 0x66, 0xa0, 0xa7, 0x85, 0x1b,
0xb7, 0x7d, 0x7c, 0x7a, 0x73, 0x93, 0x75, 0x5f, 0x8c, 0xc6, 0x46, 0x1b,
0x43, 0xfd, 0x6e, 0x2e, 0x9e, 0x1e, 0xa4, 0xd9, 0xe5, 0xc0, 0xdd, 0xe2,
0x40, 0x08, 0xc1, 0xe9, 0x63, 0xfd, 0x58, 0x2c, 0x06, 0x57, 0xd3, 0xdc,
0xdc, 0x40, 0x6f, 0x57, 0x33, 0xdf, 0xfa, 0xda, 0x21, 0xec, 0x36, 0x95,
0xd7, 0xdf, 0x9e, 0xe7, 0xbd, 0x2b, 0xab, 0x6c, 0x6c, 0x46, 0x38, 0x77,
0x72, 0x90, 0x9e, 0xce, 0x26, 0x42, 0xe1, 0x34, 0xa9, 0x4c, 0x81, 0xd1,
0x41, 0x0f, 0x81, 0x50, 0x8a, 0xb7, 0x3f, 0x58, 0xa2, 0xab, 0xa3, 0x99,
0x63, 0x87, 0x7b, 0x71, 0xd8, 0x6d, 0x78, 0x3c, 0x4e, 0x84, 0x50, 0x58,
0xdd, 0x4c, 0xa1, 0xc9, 0x0a, 0x6d, 0xa1, 0x5a, 0xac, 0x28, 0x8a, 0x6a,
0x46, 0x00, 0x84, 0xf9, 0xda, 0x0c, 0x1d, 0x55, 0xb5, 0xf2, 0xac, 0xf4,
0x21, 0xa3, 0x36, 0xae, 0x58, 0x1d, 0x9f, 0x2c, 0xb7, 0xe8, 0xac, 0x1a,
0x6f, 0xc4, 0xae, 0x66, 0x7e, 0xbb, 0x42, 0x7b, 0xd5, 0xef, 0xd7, 0x87,
0x54, 0xeb, 0xd2, 0x6c, 0x2a, 0x4d, 0xfa, 0xea, 0x03, 0xe5, 0xd2, 0xac,
0x53, 0xc8, 0x19, 0x45, 0xc2, 0xd4, 0x6e, 0x03, 0x54, 0xdd, 0x9e, 0xb3,
0xa6, 0x2c, 0x50, 0x94, 0xaa, 0xf6, 0x75, 0x76, 0x42, 0xd9, 0x32, 0xcf,
0xf9, 0xb8, 0x19, 0x1b, 0xbb, 0xfa, 0xf8, 0x97, 0x53, 0x6b, 0x4b, 0x0d,
0x6a, 0xd9, 0xaf, 0x21, 0xf0, 0x1e, 0xef, 0x97, 0x43, 0x51, 0xd5, 0xb9,
0x4d, 0x46, 0xd5, 0xcf, 0xc2, 0x52, 0x98, 0x6c, 0x36, 0xcf, 0x81, 0x89,
0x4e, 0x4e, 0x1d, 0xed, 0xc5, 0xdd, 0xe2, 0xe0, 0x8d, 0x77, 0x1f, 0xf2,
0x70, 0x25, 0xc2, 0xbd, 0x79, 0x3f, 0x2d, 0x4d, 0x76, 0x46, 0x87, 0x3c,
0x1c, 0x9e, 0xea, 0xe2, 0xc4, 0x91, 0x1e, 0xee, 0x3f, 0x0c, 0xb0, 0xb6,
0x19, 0x27, 0x9e, 0x34, 0x32, 0x3c, 0x1e, 0x2e, 0x1b, 0x21, 0xa6, 0xcf,
0xee, 0xfa, 0x08, 0x85, 0x53, 0x28, 0x02, 0x36, 0xb6, 0x62, 0x9c, 0x3a,
0xd6, 0x4f, 0x93, 0xd3, 0xc6, 0xb6, 0x3f, 0xce, 0xed, 0x7b, 0xdb, 0xac,
0x6d, 0x46, 0xe8, 0xee, 0x6c, 0x61, 0x65, 0x2d, 0xcc, 0x96, 0xdf, 0x00,
0xb3, 0x8b, 0x2b, 0x21, 0x3a, 0xbc, 0x4e, 0x2e, 0x9c, 0x1e, 0xa4, 0xb5,
0xd9, 0xc6, 0xc8, 0xa0, 0x97, 0x4f, 0x6f, 0x6e, 0xb0, 0xba, 0x19, 0x63,
0x69, 0x2d, 0x42, 0x2a, 0x95, 0x67, 0x62, 0xac, 0x9d, 0x93, 0x87, 0x7b,
0xd8, 0xdc, 0x4e, 0xb1, 0xb2, 0x91, 0x31, 0x34, 0x93, 0x62, 0x41, 0xb1,
0xd8, 0x0c, 0x12, 0x5a, 0xd7, 0xd0, 0x65, 0xd1, 0xdc, 0x65, 0x43, 0x2b,
0x17, 0xb0, 0x2a, 0x55, 0xd5, 0xd2, 0x52, 0xd7, 0xd0, 0x74, 0x0d, 0xa4,
0x8e, 0x90, 0x3a, 0xb2, 0xea, 0x89, 0xf9, 0xd4, 0xa5, 0xf1, 0xb9, 0xf1,
0xbe, 0x56, 0xfe, 0x97, 0x2a, 0x0d, 0x22, 0xf7, 0xf8, 0x6e, 0xf5, 0xf1,
0xd4, 0x7c, 0x57, 0x9a, 0xaf, 0x6b, 0x3f, 0x33, 0x32, 0x6d, 0x75, 0x44,
0x49, 0xdb, 0x18, 0x85, 0x90, 0xa0, 0x97, 0x72, 0xf0, 0xf4, 0x2a, 0xc1,
0x97, 0x55, 0x09, 0x88, 0xe2, 0xcb, 0x07, 0xce, 0xeb, 0x96, 0xc6, 0xfe,
0x42, 0x56, 0x83, 0xf1, 0x1f, 0xb3, 0x2b, 0x61, 0xdd, 0x66, 0x0b, 0xd5,
0x9f, 0xe9, 0x3a, 0xec, 0x04, 0xd3, 0x2c, 0xaf, 0x87, 0x91, 0x9a, 0x86,
0xbb, 0xd5, 0xc9, 0xd4, 0x68, 0x1b, 0xd1, 0x58, 0x86, 0x58, 0x22, 0xcb,
0xf2, 0x46, 0x84, 0x95, 0xb5, 0x08, 0x7a, 0xa1, 0x80, 0xc7, 0xdd, 0xc8,
0x91, 0xe9, 0x2e, 0x0e, 0x8c, 0xb7, 0xa1, 0xe9, 0x3a, 0x99, 0xac, 0x46,
0x2a, 0x5d, 0xc0, 0xd3, 0x62, 0xc7, 0xdd, 0xe2, 0xe0, 0xda, 0x6d, 0x1f,
0xab, 0x1b, 0x31, 0x96, 0xd7, 0xa3, 0xc4, 0x62, 0x69, 0x7a, 0xbb, 0x9a,
0xb9, 0x7a, 0x73, 0x93, 0x75, 0x5f, 0x9c, 0x35, 0x5f, 0x8c, 0x6c, 0x36,
0xc7, 0xd1, 0x43, 0xbd, 0xe4, 0xf3, 0x45, 0xc2, 0xd1, 0x0c, 0xd9, 0x5c,
0x11, 0x9f, 0x3f, 0x41, 0xab, 0xcb, 0xce, 0x77, 0x5f, 0x3d, 0x4a, 0x3c,
0x99, 0xe5, 0xca, 0xb5, 0x4d, 0x72, 0x79, 0x0d, 0x29, 0x21, 0x14, 0xcb,
0xf3, 0x70, 0x25, 0x41, 0x6f, 0x97, 0x0b, 0xdf, 0x4e, 0x86, 0x2d, 0x7f,
0x0e, 0xa1, 0x58, 0xcc, 0x30, 0x92, 0x05, 0xa9, 0xeb, 0xe8, 0x7a, 0x01,
0x5d, 0xcb, 0xa3, 0xeb, 0x79, 0x74, 0x2d, 0x87, 0xa6, 0x15, 0xcb, 0x1e,
0xb6, 0xc0, 0x60, 0xbf, 0x85, 0xd9, 0x40, 0xc5, 0x18, 0x3d, 0x43, 0x70,
0xc0, 0x10, 0x10, 0x23, 0x14, 0x6e, 0x3c, 0x45, 0xb9, 0x20, 0x44, 0x2f,
0x1f, 0x63, 0xc4, 0x29, 0x4d, 0x9c, 0x57, 0x77, 0x7c, 0xf5, 0x31, 0xa5,
0x34, 0xed, 0xd2, 0xdf, 0xe5, 0x73, 0x55, 0x09, 0xb2, 0xa8, 0x12, 0xcc,
0xd2, 0xef, 0x1b, 0xdf, 0x2b, 0x09, 0x38, 0x35, 0x26, 0xce, 0x50, 0x7a,
0x72, 0x8f, 0x76, 0xed, 0xbf, 0x9f, 0x7a, 0x4d, 0xb5, 0xb5, 0xa7, 0x94,
0xea, 0x53, 0x1b, 0x6f, 0x93, 0xbb, 0x9c, 0xc9, 0xfd, 0x03, 0xa4, 0xd5,
0x42, 0x26, 0xd9, 0x67, 0xbb, 0x16, 0x53, 0xdb, 0xe5, 0x0b, 0x1a, 0xeb,
0xdb, 0x09, 0xe6, 0x17, 0xfd, 0x20, 0x25, 0x97, 0xce, 0x0e, 0xd3, 0xdf,
0xd3, 0x82, 0xaa, 0x08, 0xe2, 0x89, 0x1c, 0x2b, 0x9b, 0x46, 0x7e, 0x7f,
0xa1, 0xa8, 0x73, 0xe7, 0xde, 0x0e, 0x63, 0x23, 0x6d, 0x9c, 0x3d, 0xd1,
0x4f, 0x5f, 0x77, 0x33, 0x89, 0x54, 0x9e, 0xaf, 0x5c, 0x1e, 0x67, 0x75,
0x3d, 0x4c, 0xbe, 0xa8, 0x1b, 0xb1, 0xc6, 0x50, 0x9a, 0xce, 0x36, 0x27,
0x53, 0x63, 0x6d, 0x2c, 0xad, 0x46, 0xc8, 0x17, 0x74, 0xb6, 0xfc, 0x69,
0x72, 0xb9, 0x02, 0x4f, 0x9c, 0x1d, 0x06, 0x29, 0x71, 0x38, 0x2c, 0x1c,
0x18, 0xef, 0xe0, 0xf8, 0x4c, 0x1f, 0xef, 0x7f, 0xbc, 0x42, 0xb1, 0x68,
0x78, 0x6f, 0xf1, 0x44, 0x96, 0x54, 0xaa, 0x80, 0x40, 0xa5, 0xa9, 0xd1,
0x41, 0x4f, 0x77, 0x0b, 0x2b, 0x9b, 0x29, 0xa2, 0xa9, 0x22, 0x08, 0xc5,
0x2c, 0x8a, 0x91, 0x08, 0x5d, 0x47, 0xca, 0x22, 0x52, 0x16, 0xa1, 0xf4,
0xaf, 0xae, 0x21, 0xb5, 0x3c, 0x52, 0x16, 0x40, 0x2f, 0x82, 0xd4, 0x10,
0x42, 0xa2, 0x0a, 0x15, 0x45, 0xb5, 0x22, 0x84, 0xa3, 0x8c, 0xc3, 0xa4,
0x90, 0x48, 0xa1, 0x21, 0x85, 0x56, 0xb5, 0x0f, 0x5d, 0x75, 0xf7, 0x68,
0x73, 0xd3, 0x2d, 0xa9, 0x23, 0x84, 0x34, 0x04, 0x55, 0x82, 0x90, 0xc2,
0x14, 0x50, 0xcc, 0x06, 0xee, 0x95, 0x67, 0x49, 0xa0, 0xa4, 0x19, 0x1f,
0x94, 0x55, 0x9b, 0x8c, 0x95, 0x77, 0x2b, 0x10, 0x15, 0x0d, 0x55, 0x16,
0xc6, 0x52, 0x93, 0x3a, 0xaa, 0x92, 0x1e, 0x4d, 0xe2, 0x73, 0xaf, 0x06,
0xf5, 0x52, 0x50, 0x6e, 0x97, 0xf0, 0x45, 0x75, 0x99, 0x18, 0x3a, 0xf1,
0xfd, 0x3d, 0x0d, 0xac, 0x2e, 0xf6, 0xa0, 0x30, 0xe4, 0xa3, 0x22, 0xf1,
0xa2, 0x6a, 0xdf, 0x04, 0x51, 0x6e, 0xc4, 0xb1, 0x5f, 0x41, 0x4b, 0xc9,
0x83, 0xb2, 0x59, 0x55, 0x0e, 0x4f, 0x76, 0x30, 0x3a, 0xdc, 0x66, 0x14,
0x80, 0x24, 0x32, 0x2c, 0xad, 0xc5, 0x38, 0x7f, 0x72, 0x80, 0x1f, 0xfc,
0xe4, 0x36, 0xf9, 0x82, 0x8e, 0x45, 0x55, 0xe8, 0xef, 0x76, 0x31, 0x3d,
0xd6, 0xc6, 0x81, 0xc9, 0x0e, 0x9c, 0x4e, 0x07, 0xd7, 0x6f, 0x6f, 0x62,
0xb3, 0x1a, 0x55, 0x44, 0x4d, 0x8d, 0x36, 0x4e, 0xcc, 0xf4, 0x73, 0xfd,
0xd6, 0x3a, 0x0f, 0x96, 0xc3, 0x38, 0xec, 0x16, 0xbc, 0xee, 0x06, 0x06,
0xfb, 0xdc, 0xf4, 0x76, 0xb7, 0x10, 0x89, 0x66, 0xb8, 0x7e, 0x6b, 0x83,
0x1b, 0x77, 0xb7, 0xf0, 0x87, 0xd2, 0xd8, 0xac, 0x2a, 0x27, 0x0f, 0x77,
0x33, 0x38, 0xe0, 0x61, 0x6b, 0x3b, 0xce, 0x47, 0xd7, 0xb7, 0x38, 0x34,
0xd1, 0xc5, 0xc1, 0x03, 0x5d, 0xfc, 0xe7, 0x5f, 0x3c, 0x24, 0x5f, 0x54,
0x51, 0x2c, 0x16, 0x63, 0xab, 0x41, 0x5d, 0x2b, 0x9b, 0x4a, 0x5d, 0x2f,
0x20, 0xf5, 0x02, 0x52, 0x37, 0xcd, 0xa6, 0x5e, 0xac, 0xca, 0x52, 0x28,
0x65, 0x50, 0x94, 0x40, 0xbe, 0x82, 0x50, 0x84, 0xb1, 0x71, 0x42, 0xb5,
0x56, 0x29, 0x29, 0x95, 0xb2, 0x86, 0x31, 0x26, 0x5e, 0x31, 0x41, 0x7e,
0x49, 0xcb, 0x54, 0xb7, 0xf2, 0x94, 0x7b, 0x04, 0xab, 0x4b, 0xe3, 0xad,
0x97, 0x3d, 0xfc, 0x3d, 0x82, 0xf0, 0x52, 0x54, 0x31, 0x01, 0x55, 0xe9,
0x41, 0x42, 0xad, 0x4a, 0x8b, 0x37, 0x1d, 0x08, 0xa5, 0xf4, 0x7b, 0xea,
0xee, 0xc9, 0x52, 0xaa, 0xf6, 0xb1, 0xf9, 0x9d, 0x53, 0xce, 0xf4, 0x2f,
0x27, 0x64, 0x95, 0x1d, 0x33, 0x76, 0xa1, 0xd0, 0xcf, 0x11, 0xcc, 0xfa,
0x0a, 0x18, 0x68, 0x6c, 0xb0, 0x30, 0x35, 0xd2, 0x46, 0x5f, 0x4f, 0x2b,
0x43, 0x03, 0x1e, 0xc6, 0x47, 0xda, 0xf8, 0x3f, 0xff, 0xef, 0x0f, 0xd8,
0x0e, 0x24, 0x29, 0xe4, 0x35, 0x73, 0x0f, 0x26, 0x68, 0x73, 0x3b, 0xf8,
0xde, 0x37, 0x8f, 0x72, 0xed, 0xd6, 0x06, 0xaa, 0x62, 0x06, 0x88, 0x55,
0xc3, 0xdd, 0x3f, 0x7b, 0x72, 0x98, 0x68, 0x3c, 0xcb, 0xf5, 0x5b, 0x1b,
0x34, 0xda, 0xd5, 0xb2, 0x56, 0x1d, 0x19, 0x6a, 0xe3, 0xfe, 0x82, 0xd1,
0x3e, 0x54, 0xd3, 0x2b, 0x98, 0x72, 0x7c, 0xc8, 0xcd, 0xb9, 0x93, 0x83,
0x58, 0x2c, 0x82, 0xc6, 0x46, 0x07, 0xef, 0x7f, 0xb2, 0xc9, 0x9d, 0x85,
0x38, 0x42, 0xb5, 0x61, 0xb5, 0xd8, 0x90, 0x12, 0x74, 0xcd, 0xd0, 0x5c,
0x86, 0x60, 0x55, 0x5e, 0xeb, 0x7a, 0x11, 0x85, 0xbd, 0xfb, 0x4b, 0x18,
0xc5, 0x31, 0xb2, 0xec, 0x59, 0x0a, 0x4c, 0xcf, 0xb3, 0xec, 0x45, 0x1a,
0x29, 0xe5, 0x52, 0x16, 0xd1, 0x31, 0x31, 0x1e, 0x18, 0x3d, 0x24, 0xf6,
0xd8, 0xdb, 0x49, 0xea, 0x62, 0x5f, 0xeb, 0xa0, 0xa3, 0xd4, 0x71, 0x99,
0x75, 0x19, 0xb9, 0x55, 0x09, 0x97, 0xa5, 0x18, 0xad, 0x28, 0x25, 0x5d,
0x56, 0xf7, 0xde, 0x2f, 0x27, 0x05, 0xa8, 0xd5, 0x8d, 0x72, 0x7f, 0x0f,
0xf6, 0x52, 0xdb, 0x27, 0xac, 0xf4, 0x05, 0x8b, 0x0a, 0xaa, 0xf7, 0x59,
0x94, 0x52, 0x3e, 0x56, 0x3f, 0xfd, 0x92, 0x57, 0x93, 0xc9, 0x16, 0xf9,
0xec, 0xde, 0x36, 0xb3, 0x0b, 0x41, 0xdc, 0x2d, 0x0e, 0x26, 0x47, 0xdb,
0x79, 0xee, 0xd2, 0x38, 0x45, 0x4d, 0xe3, 0xc1, 0xc3, 0x00, 0xfe, 0x60,
0x92, 0xed, 0x40, 0x8a, 0x58, 0x32, 0xcf, 0x83, 0xc5, 0x00, 0x5d, 0xed,
0x2e, 0x7e, 0xfa, 0xe6, 0x5c, 0x4d, 0x4f, 0xb1, 0x68, 0x3c, 0xc7, 0xb9,
0x93, 0x43, 0x6c, 0x6e, 0x27, 0xf0, 0xed, 0x24, 0x6b, 0x8a, 0x63, 0x2f,
0x9d, 0x1b, 0xc2, 0x61, 0xb7, 0x70, 0xe5, 0xc6, 0x46, 0xb9, 0x51, 0xdc,
0xd2, 0x5a, 0x14, 0xa1, 0x28, 0xfc, 0xfd, 0x3f, 0x3e, 0xc9, 0x7b, 0x1f,
0xaf, 0x30, 0xbb, 0x10, 0x34, 0x88, 0x57, 0x45, 0x41, 0xd7, 0x35, 0xd0,
0x75, 0x43, 0x73, 0x51, 0x0b, 0xd0, 0x0d, 0xcc, 0xf4, 0xa8, 0x6e, 0x3a,
0xd2, 0xc4, 0x42, 0x12, 0x5d, 0x33, 0x92, 0x1b, 0x85, 0xa2, 0xa2, 0x9b,
0xd4, 0x83, 0x62, 0x52, 0x0c, 0x8a, 0xb0, 0xa2, 0x48, 0x93, 0x7f, 0xd3,
0x75, 0xf4, 0x12, 0xde, 0x12, 0xa5, 0x96, 0x05, 0x7a, 0x8d, 0x45, 0xd8,
0xb3, 0xfd, 0xb9, 0x90, 0x7b, 0x47, 0x02, 0xab, 0x9d, 0xb1, 0xfa, 0x88,
0x21, 0x5a, 0x99, 0xd6, 0xa0, 0x94, 0x81, 0x51, 0xa2, 0xa2, 0x4c, 0xad,
0x28, 0x45, 0xbd, 0xc0, 0x7e, 0xf1, 0x9e, 0x1a, 0x7b, 0x02, 0xff, 0xdd,
0x98, 0x6c, 0xbf, 0x1e, 0xf0, 0xf5, 0xdd, 0x8e, 0x77, 0xef, 0x4f, 0xf4,
0x38, 0x55, 0xcc, 0xd5, 0x83, 0xa7, 0xe9, 0x3a, 0xa9, 0x74, 0x91, 0xf5,
0xad, 0x38, 0x77, 0xe7, 0x76, 0x88, 0x46, 0xd3, 0x8c, 0x0c, 0xba, 0x99,
0x18, 0xed, 0xa0, 0xbf, 0xb7, 0x85, 0x43, 0x13, 0xed, 0xa8, 0xaa, 0x42,
0x5f, 0x4f, 0x0b, 0xcb, 0x6b, 0x11, 0x92, 0xa9, 0x42, 0xf9, 0xb7, 0x83,
0xe1, 0x34, 0xae, 0x26, 0x3b, 0xc7, 0x8f, 0xf4, 0x30, 0xff, 0x30, 0x68,
0x6c, 0xea, 0x6a, 0x66, 0x8c, 0xc4, 0x62, 0x59, 0x2e, 0x9f, 0x1f, 0xa1,
0xc3, 0xdd, 0xc0, 0xc2, 0x4a, 0x08, 0xab, 0x45, 0xe5, 0xfc, 0xc9, 0x3e,
0x8e, 0x1d, 0xee, 0xe5, 0xfa, 0xed, 0x0d, 0xde, 0xfd, 0x64, 0x8d, 0x7c,
0x01, 0x2c, 0xaa, 0xdd, 0x18, 0x64, 0xcd, 0x34, 0x8f, 0xb2, 0x88, 0xd4,
0x35, 0x03, 0x34, 0xa3, 0xd7, 0x00, 0xec, 0x3a, 0xdd, 0x5f, 0xe5, 0xc5,
0x55, 0x76, 0x06, 0x51, 0x15, 0x53, 0xe8, 0xa4, 0x06, 0xb2, 0x80, 0xa6,
0x17, 0xd0, 0x31, 0xea, 0x2c, 0x45, 0x99, 0x2b, 0xb3, 0xa0, 0xaa, 0x56,
0x54, 0xb5, 0xd4, 0xcf, 0x5f, 0x56, 0xe5, 0xee, 0x7f, 0xde, 0x18, 0xd6,
0x6e, 0xf8, 0x5a, 0xdd, 0xab, 0xb5, 0x06, 0x4b, 0x57, 0x6d, 0x63, 0x23,
0xeb, 0xdf, 0xae, 0xa1, 0x43, 0xcd, 0xfd, 0x06, 0xaa, 0xf7, 0x8b, 0xfa,
0x52, 0xce, 0x80, 0xfc, 0xb2, 0x42, 0xb6, 0x7f, 0xf5, 0x8a, 0xd8, 0xb5,
0x39, 0xc2, 0xfe, 0x5f, 0x15, 0xa2, 0x3e, 0x99, 0xce, 0x30, 0x8d, 0x9a,
0x26, 0x09, 0xc7, 0xb2, 0xdc, 0x5f, 0x08, 0xf2, 0x70, 0x39, 0x84, 0xd4,
0x75, 0xa3, 0x2e, 0x53, 0x28, 0xf4, 0x74, 0x35, 0x33, 0x39, 0xda, 0x46,
0x5f, 0xb7, 0x0b, 0x97, 0xd3, 0x46, 0x3a, 0x53, 0x40, 0x47, 0x10, 0x8e,
0x64, 0x99, 0x1a, 0x6d, 0xa3, 0xdd, 0xd3, 0xc8, 0xfa, 0x56, 0x1c, 0xd5,
0xec, 0x32, 0x9d, 0xc9, 0x16, 0x09, 0x84, 0x52, 0x1c, 0x3f, 0xd2, 0xcb,
0x99, 0x63, 0x7d, 0x1c, 0x9a, 0xea, 0x40, 0x55, 0x2d, 0xdc, 0x9e, 0xdd,
0xe4, 0xd3, 0x5b, 0xdb, 0xe4, 0x8b, 0x12, 0x45, 0xb5, 0xa2, 0xa8, 0x56,
0xa4, 0x0e, 0x5a, 0x09, 0xd4, 0x53, 0x4d, 0x41, 0x68, 0x55, 0x5e, 0x5f,
0x7d, 0xad, 0x61, 0x1d, 0xc8, 0x2e, 0x95, 0xe9, 0x95, 0x3d, 0x41, 0x03,
0xbc, 0x1b, 0xc0, 0x5b, 0x1a, 0xcd, 0x36, 0x90, 0x15, 0xcf, 0x0f, 0xad,
0x8c, 0xab, 0x14, 0xb3, 0xf3, 0xb5, 0x30, 0xb1, 0x93, 0x30, 0xe9, 0x12,
0x51, 0xcf, 0xa5, 0x89, 0x7a, 0xbc, 0x56, 0x87, 0x5c, 0xea, 0x4a, 0xe5,
0xa8, 0xeb, 0x5e, 0x5d, 0xe1, 0xc6, 0xea, 0x6a, 0xe9, 0x45, 0xf5, 0xf6,
0x35, 0xe2, 0x4b, 0x0b, 0xd9, 0xe3, 0x63, 0x32, 0xa9, 0x3c, 0xca, 0x7f,
0x30, 0x81, 0x68, 0xed, 0xde, 0x6d, 0xa2, 0xcc, 0x34, 0xb3, 0xa7, 0xba,
0xaf, 0x11, 0x32, 0xb9, 0xf7, 0xfe, 0xdb, 0x7b, 0x3d, 0x1c, 0x76, 0x0b,
0x4d, 0x8d, 0x56, 0x1c, 0x0e, 0x0b, 0xde, 0xd6, 0x46, 0x7a, 0x7b, 0x5a,
0xe8, 0xee, 0x6c, 0xc6, 0x6e, 0x55, 0xb1, 0xd9, 0x0c, 0x81, 0x9a, 0x1e,
0x6f, 0xe7, 0xda, 0xcd, 0x4d, 0x0a, 0x66, 0x63, 0x62, 0x97, 0xd3, 0x8e,
0xcd, 0xa1, 0xa2, 0x08, 0xc1, 0xe2, 0x72, 0x90, 0xfb, 0x0b, 0x01, 0x42,
0x91, 0x2c, 0xc9, 0x74, 0xde, 0x60, 0xcc, 0x55, 0x2b, 0xaa, 0xb5, 0x01,
0x50, 0x0d, 0xc6, 0x5a, 0xcf, 0x03, 0xc5, 0x4a, 0x87, 0x6a, 0x5d, 0x33,
0xa8, 0x81, 0x32, 0x65, 0x20, 0xab, 0xa6, 0x46, 0xd6, 0x15, 0xba, 0x56,
0xcc, 0xa9, 0x61, 0xea, 0x94, 0xb2, 0x86, 0x90, 0x35, 0x51, 0x14, 0x59,
0xb7, 0x9d, 0x8c, 0xb5, 0x6a, 0x87, 0x12, 0x83, 0x3e, 0x31, 0xe4, 0xa4,
0x60, 0xf2, 0x60, 0xf5, 0xfb, 0xb2, 0x1b, 0xfb, 0xe5, 0x95, 0x34, 0x42,
0xfd, 0x1e, 0x99, 0xa2, 0x1c, 0x83, 0x16, 0xb5, 0xbb, 0x14, 0x57, 0xe5,
0xfe, 0x2b, 0x66, 0x34, 0x41, 0x56, 0x47, 0x28, 0xca, 0x51, 0x0c, 0xa5,
0xca, 0x49, 0xf8, 0x22, 0xfd, 0x66, 0x65, 0x09, 0x93, 0xc9, 0x47, 0xf7,
0x4d, 0x90, 0xb5, 0x93, 0xbd, 0x3b, 0xdf, 0xbb, 0x6e, 0x03, 0xf4, 0x1a,
0xf3, 0x59, 0x9a, 0x10, 0x2a, 0x55, 0x38, 0x25, 0x44, 0x5b, 0x12, 0x5a,
0xc9, 0x23, 0x56, 0x8b, 0xbe, 0xa7, 0x69, 0xce, 0xe6, 0x8a, 0x64, 0xcd,
0x76, 0x4b, 0xbe, 0x9d, 0x24, 0x77, 0x1f, 0x04, 0xca, 0x31, 0x33, 0x30,
0xda, 0xa7, 0xb7, 0x7b, 0x1a, 0xca, 0x59, 0x23, 0x79, 0x93, 0xea, 0xc8,
0x15, 0x8c, 0xc9, 0xd7, 0x35, 0x23, 0x5e, 0x27, 0x64, 0xa9, 0x60, 0xc3,
0x82, 0x10, 0x0e, 0x84, 0x94, 0xe8, 0x32, 0x8b, 0xd4, 0x0a, 0x65, 0x4c,
0x55, 0x1e, 0x7e, 0x59, 0x9f, 0x45, 0x5f, 0xf7, 0x4a, 0x56, 0x6f, 0xf6,
0xaa, 0xee, 0x51, 0x94, 0x2e, 0x6b, 0xcc, 0xea, 0xee, 0x13, 0x09, 0xa0,
0x00, 0xba, 0xa1, 0xe4, 0x0c, 0x42, 0xdc, 0xd8, 0x6a, 0x59, 0x28, 0x56,
0x10, 0x46, 0x47, 0x4a, 0x01, 0xe8, 0x7a, 0xa9, 0xb3, 0x8f, 0x8e, 0x22,
0xf3, 0xbb, 0xcd, 0x8f, 0x59, 0x3d, 0xa4, 0xa3, 0x95, 0x7b, 0x93, 0x94,
0xb6, 0xd8, 0x16, 0x65, 0xca, 0x43, 0x47, 0x28, 0x8a, 0xf1, 0xaf, 0xac,
0xec, 0x53, 0x89, 0x28, 0x99, 0x7c, 0xbd, 0x3c, 0x47, 0x65, 0x7a, 0x4a,
0x97, 0xb5, 0xb5, 0x05, 0xc2, 0xa8, 0x45, 0x90, 0xba, 0x5a, 0xab, 0xd5,
0x85, 0x44, 0x31, 0x35, 0xb8, 0xfe, 0x58, 0xc0, 0xff, 0x4b, 0x68, 0xca,
0x1a, 0x81, 0x2c, 0x87, 0x5c, 0xf6, 0xda, 0x84, 0x9d, 0x2f, 0xbc, 0xd5,
0xb2, 0x6e, 0x9a, 0x1d, 0xad, 0xd2, 0x49, 0x9d, 0x60, 0xbe, 0x48, 0x30,
0x92, 0xde, 0xb3, 0x16, 0xb0, 0x4c, 0x1b, 0x94, 0x2a, 0x7c, 0x24, 0x08,
0x45, 0x41, 0x51, 0xcc, 0xb8, 0x9d, 0x56, 0x61, 0xd2, 0xcb, 0xdd, 0x6b,
0xea, 0x3c, 0xc8, 0xc7, 0x6b, 0x34, 0xb2, 0x3b, 0x4c, 0x53, 0x2f, 0x9e,
0xbb, 0x57, 0x7d, 0x75, 0x18, 0xc7, 0xd4, 0x93, 0xba, 0x86, 0xd1, 0x96,
0xcc, 0x68, 0xf3, 0xa9, 0x28, 0xaa, 0x51, 0xdc, 0x62, 0xe2, 0x39, 0x5d,
0x53, 0xcb, 0x02, 0x87, 0x49, 0xe8, 0x1a, 0xfb, 0x4d, 0x1a, 0xe3, 0xa2,
0xeb, 0xa5, 0x46, 0x2e, 0x7a, 0x95, 0x1d, 0x55, 0x2a, 0x9e, 0xab, 0x34,
0xe0, 0x87, 0x52, 0xd2, 0x66, 0xb2, 0xb4, 0x3d, 0xb6, 0x59, 0xec, 0x6c,
0x6e, 0x00, 0x51, 0xb1, 0x34, 0xa2, 0x4a, 0xa1, 0xc8, 0x3a, 0x43, 0x5b,
0xe9, 0x7a, 0x5d, 0x1a, 0x67, 0x29, 0xe1, 0xff, 0x03, 0xd7, 0x3d, 0x7f,
0x90, 0x80, 0x27, 0x85, 0x42, 0x00, 0x00, 0x00, 0x00, 0x49, 0x45, 0x4e,
0x44, 0xae, 0x42, 0x60, 0x82
};
const size_t logo_allnet_png_len = sizeof(logo_allnet_png) / sizeof(char);
|
the_stack_data/43889182.c
|
extern void abort(void);
void reach_error(){}
extern unsigned short __VERIFIER_nondet_ushort(void);
void __VERIFIER_assert(int cond) {
if (!(cond)) {
ERROR: {reach_error();abort();}
}
return;
}
int main(void) {
unsigned int x = 0;
unsigned short N = __VERIFIER_nondet_ushort();
while (x < N) {
x += 2;
}
__VERIFIER_assert(x % 2);
}
|
the_stack_data/72012570.c
|
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
uint8_t udp_optcksum(uint8_t *, int);
int
main(int argc, char **argv)
{
#define BUFSIZE 256
uint8_t data[BUFSIZE];
uint16_t optlen;
if (argc == 1) {
printf("need some data to parse\n");
exit(1);
}
if (argc-1 > BUFSIZE) {
printf("faaaar too much data, we can only take %d of options\n",
BUFSIZE);
exit(1);
}
for (int count = 1; count < argc; count++, argv++)
data[optlen++] = (uint8_t)strtol(*argv, NULL, 16);
#if 1
int toggle = 0;
for(int i = 0; i < optlen; i++) {
printf("%02x ", data[i]);
if(++toggle % 16 == 0)
printf("\n");
}
printf("\n");
#endif
printf("optchecksum %x\n", udp_optcksum(data, optlen));
return 0;
}
uint8_t
udp_optcksum(uint8_t *cp, int len)
{
uint16_t cksum = 0;
for(int i = 0; i < len; i++) {
cksum += cp[i];
}
while(cksum > 0x00FF)
cksum = ((cksum & 0xFF00) >> 8) + (cksum & 0x00FF);
return (uint8_t)~cksum;
}
|
the_stack_data/12827.c
|
extern int GET();
extern int MALLOC();
extern void FREE(int);
extern void PRINT(int);
int main() {
int a;
int *p = &a;
a = GET();
PRINT(*p);
}
|
the_stack_data/68888231.c
|
/*
* mirror.c
* A program to find the mirror image of a matrix
*/
#include <stdio.h>
int main()
{
int i, j, matrix[10][10], r, c, mirror[10][10], ctr;
printf("Enter the number of rows and colums: ");
scanf("%i %i", &r, &c);
printf("Enter the matrix:\n");
for (i = 0; i < r; ++i)
for (j = 0; j < c; ++j)
scanf("%i", &matrix[i][j]);
printf("\nMatrix:\n");
for (i = 0; i < r; ++i) {
for (j = 0; j < c; ++j)
printf("%2i ", matrix[i][j]);
printf("\n");
}
for (i = c - 1, ctr = 1; i >= 0; --i, ctr += 2)
for (j = 0; j < r; ++j)
mirror[j][(i + ctr) % c] = matrix[j][i];
printf("\nMirror Matrix:\n");
for (i = 0; i < r; ++i) {
for (j = 0; j < c; ++j)
printf("%2i ", mirror[i][j]);
printf("\n");
}
return 0;
}
|
the_stack_data/95735.c
|
#include <stdio.h>
#include <stdlib.h>
#include <pthread.h>
#include <sys/types.h>
#include <unistd.h>
#include <semaphore.h>
#include <fcntl.h>
#define LIMITE 1000000
void *incrementa();
void *decrementa();
static int global_var=0;
pthread_mutex_t *mutex;
int main()
{
pthread_t suma, resta;
pthread_mutex_init(&mutex, NULL);
pthread_create(&suma, NULL, &incrementa, NULL);
pthread_create(&resta, NULL, &decrementa, NULL);
pthread_join(resta, NULL);
pthread_join(suma, NULL);
printf("El valor final de la variable es %d\n", global_var);
pthread_mutex_destroy(&mutex);
sem_unlink("/semaforo");
return 0;
}
void *incrementa()
{
int i;
puts("Comienza hilo suma\n");
for (i=0;i<LIMITE;i++)
{
pthread_mutex_lock(&mutex);
global_var=global_var+1;
pthread_mutex_unlock(&mutex);
}
printf("Suma: el valor final de la variable es %d\n", global_var);
return 0;
}
void *decrementa()
{
int i;
puts("Comienza hilo resta\n");
for (i=0;i<LIMITE;i++)
{
pthread_mutex_lock(&mutex);
global_var=global_var-1;
pthread_mutex_unlock(&mutex);
}
printf("resta:valor final de la variable es %d\n", global_var);
return 0;
}
|
the_stack_data/161080377.c
|
#include <stdlib.h>
#include <stdio.h>
#include <stdint.h>
#include <string.h>
#include <signal.h>
#include <unistd.h>
#include <pthread.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <errno.h>
#include <semaphore.h>
#include <sys/time.h>
#include <fcntl.h>
#include <sys/stat.h>
struct second_level_pt {
int phy_add[1024];
int val[1024];
};
struct second_level_pt slpt1,slpt2,slpt3,slpt4;
struct first_level_pt {
struct second_level_pt *sl;
int valid;
long p_id;
}flpt[4];
static int np=0,pf1=0,pf2=0,pf3=0,pf4=0,va1=0,va2=0,va3=0,va4=0;
unsigned long tidArray[4];
int vad1[256];
int vad2[256];
int vad3[256];
int vad4[256];
pthread_t tid[4];
int ptov(int n) {
int v=0;
n=n<<12;
v = v|n;
return v;
}
int cse320_virt_to_phys(int v)
{
v=v>>12;
return v;
}
unsigned int cse320_malloc(int id)
{
unsigned int va; int i,j;
int fifo_main,fifo_mem;
int phyadd;
fifo_mem = open("fifo_mem",O_RDWR);
if(fifo_mem<1) {
printf("Error opening file");
}
write(fifo_mem,"allocate",sizeof("allocate"));
close(fifo_mem);
fifo_main = open("fifo_main",O_RDWR);
if(fifo_main<1) {
printf("Error opening file");
}
read(fifo_main,&phyadd,sizeof(int));
close(fifo_main);
j=id;
for(i=0;i<1024;i++)
{
if( flpt[j].sl->val[i] == 0)
{
int k;
flpt[j].sl->phy_add[i] = phyadd;
flpt[j].sl->val[i] = 1;
va = ptov(i);
if(j==0)
{
k=1;
if(va1==0)
{
vad1[va1]=va;
va1++;
}
else
{
while(k<256 && vad1[k]!=0)
{k++;}
if(k<256)
{
vad1[k]=va;
va1++;
}
}
}
else if(j==1)
{
k=1;
if(va2==0)
{
vad2[va2]=va;
va2++;
}
else
{
while(k<256 && vad2[k]!=0)
{k++;}
if(k<256)
{
vad2[k]=va;
va2++;
}
}
}
else if(j==2)
{
k=1;
if(va3==0)
{
vad3[va3]=va;
va3++;
}
else
{
while(k<256 && vad3[k]!=0)
{k++;}
if(k<256)
{
vad3[k]=va;
va3++;
}
}
}
else if(j==3)
{
k=1;
if(va4==0)
{
vad4[va4]=va;
va4++;
}
else
{
while(k<256 && vad4[k]!=0)
{k++;}
if(k<256)
{
vad4[k]=va;
va4++;
}
}
}
break;
}
}
close(fifo_main);
close(fifo_mem);
return va;
}
void *processCreate1(void *vargp)
{
flpt[0].sl = &slpt1;
flpt[0].valid = 1;
while(pf1==1)
{
}
return NULL;
}
void *processCreate2(void *vargp)
{
flpt[1].sl = &slpt2;
flpt[1].valid = 1;
while(pf2==1)
{
}
return NULL;
}
void *processCreate3(void *vargp)
{
flpt[2].sl = &slpt3;
flpt[2].valid = 1;
while(pf3==1)
{
}
return NULL;
}
void *processCreate4(void *vargp)
{
flpt[3].sl = &slpt4;
flpt[3].valid = 1;
while(pf4==1)
{
}
return NULL;
}
int main(int argc, char** argv) {
char app[100],*b;
char *token,arr[100][100];
int q;
while(1)
{
l1: printf("Which command to run - ");
fgets(app , sizeof(app), stdin);
if(strcmp(app,"\n")==0)
{
printf("Enter Correct Command\n");
goto l1;
}
q=0;
size_t rem= strlen(app);
if(app[--rem]=='\n')
app[rem]='\0';
token = strtok(app," ");
while(token!=NULL)
{
strcpy(*(arr+q),token);
q++;
token = strtok(NULL," ");
}
if(strcmp(*arr,"create")==0)
{
if(q!=1)
{
printf("Enter Correct Command Arguments to Run\n");
goto l1;
}
if(pf1==0)
{
np=0;
pf1=1;
}
else if(pf2==0)
{
np=1;
pf2=1;
}
else if(pf3==0)
{
np=2;
pf3=1;
}
else if(pf4==0)
{
np=3;
pf4=1;
}
else np=5;
if(np==0)
{
pthread_create(&tid[np], NULL, processCreate1, NULL);
tidArray[np]=(unsigned long)tid[np];
flpt[0].p_id = (unsigned long)tid[np];
}
else if(np==1)
{
pthread_create(&tid[np], NULL, processCreate2, NULL);
tidArray[np]=(unsigned long)tid[np];
flpt[1].p_id = (unsigned long)tid[np];
}
else if(np==2)
{
pthread_create(&tid[np], NULL, processCreate3, NULL);
tidArray[np]=(unsigned long)tid[np];
flpt[2].p_id = (unsigned long)tid[np];
}
else if(np==3)
{
pthread_create(&tid[np], NULL, processCreate4, NULL);
tidArray[np]=(unsigned long)tid[np];
flpt[3].p_id = (unsigned long)tid[np];
}
else
{
printf("Can't create more than four processes, kill some process before creating more\n");
}
}
else if(strcmp(*arr,"kill")==0)
{
if(q!=2)
{
printf("Enter Correct Command Arguments to Run\n");
goto l1;
}
int fifo_mem;
fifo_mem = open("fifo_mem",O_RDWR);
if(fifo_mem<1) {
printf("Error opening file");
}
int i;
long proc_id;
proc_id= atol(*(arr+1));
i=0;
while(i<4)
{
if(proc_id!=flpt[i].p_id)
{
i++;
}
else break;
}
if(i==4)
{
printf("Wrong Process ID\n");
}
else
{
for(i=0;i<4;i++)
{
if(tidArray[i]==proc_id)
{
if(i==0)
{
pf1=0;
tidArray[0]=0;
flpt[0].p_id = 0;
int cl=0;
while(flpt[0].sl->val[cl]==1)
{
char msg[100],strnum[30];
sprintf(strnum, "%d", flpt[0].sl->phy_add[cl]);
strcpy(msg,"kill ");
strcat(msg, strnum);
size_t rem= strlen(msg);
msg[rem]='\0';
write(fifo_mem,msg,strlen(msg)+1);
vad1[cl]=0;
va1=0;
flpt[0].sl->val[cl] = 0;
cl++;
}
}
else if(i==1)
{
pf2=0;
tidArray[1]=0;
flpt[1].p_id = 0;
int cl=0;
while(flpt[1].sl->val[cl]==1)
{
char msg[100],strnum[30];
sprintf(strnum, "%d", flpt[1].sl->phy_add[cl]);
strcpy(msg,"kill ");
strcat(msg, strnum);
size_t rem= strlen(msg);
msg[rem]='\0';
write(fifo_mem,msg,strlen(msg)+1);
vad2[cl]=0;
va2=0;
flpt[1].sl->val[cl] = 0;
cl++;
}
}
else if(i==2)
{
pf3=0;
tidArray[2]=0;
flpt[2].p_id = 0;
int cl=0;
while(flpt[2].sl->val[cl]==1)
{
char msg[100],strnum[30];
sprintf(strnum, "%d", flpt[2].sl->phy_add[cl]);
strcpy(msg,"kill ");
strcat(msg, strnum);
size_t rem= strlen(msg);
msg[rem]='\0';
write(fifo_mem,msg,strlen(msg)+1);
vad3[cl]=0;
va3=0;
flpt[2].sl->val[cl] = 0;
cl++;
}
}
else
{
pf4=0;
tidArray[3]=0;
flpt[3].p_id = 0;
int cl=0;
while(flpt[3].sl->val[cl]==1)
{
char msg[100],strnum[30];
sprintf(strnum, "%d", flpt[3].sl->phy_add[cl]);
strcpy(msg,"kill ");
strcat(msg, strnum);
size_t rem= strlen(msg);
msg[rem]='\0';
write(fifo_mem,msg,strlen(msg)+1);
vad4[cl]=0;
va4=0;
flpt[3].sl->val[cl] = 0;
cl++;
}
}
pthread_join(tid[i], (void**)&b);
}
}
}
}
else if(strcmp(*arr,"list")==0)
{
if(q!=1)
{
printf("Enter Correct Command Arguments to Run\n");
goto l1;
}
int i;
for(i=0;i<4;i++)
{
printf("%lu\n",tidArray[i]);
}
}
else if(strcmp(*arr,"mem")==0)
{
if(q!=2)
{
printf("Enter Correct Command Arguments to Run\n");
goto l1;
}
long proc_id;
proc_id= atol(*(arr+1));
int i,j;
i=0;
while(i<4)
{
if(proc_id!=flpt[i].p_id)
{
i++;
}
else break;
}
if(i==4)
{
printf("Wrong Process ID\n");
}
else
{
if(i==0)
{
for(i=0;i<va1;i++)
{
for(j=31; j>=0; j--)
printf("%d",((vad1[i] >> j) & 1));
printf("\n");
}
}
else if(i==1)
{
for(i=0;i<va2;i++)
{
for(j=31; j>=0; j--)
printf("%d",((vad2[i] >> j) & 1));
printf("\n");
}
}
else if(i==2)
{
for(i=0;i<va3;i++)
{
for(j=31; j>=0; j--)
printf("%d",((vad3[i] >> j) & 1));
printf("\n");
}
}
else if(i==3)
{
for(i=0;i<va4;i++)
{
for(j=31; j>=0; j--)
printf("%d",((vad4[i] >> j) & 1));
printf("\n");
}
}
}
}
else if(strcmp(*arr,"allocate")==0)
{
if(q!=2)
{
printf("Enter Correct Command Arguments to Run\n");
goto l1;
}
int i;
long proc_id;
proc_id= atol(*(arr+1));
i=0;
while(i<4)
{
if(proc_id!=flpt[i].p_id)
{
i++;
}
else break;
}
if(i==4)
{
printf("Wrong Process ID\n");
}
else
{
cse320_malloc(i);
}
}
else if(strcmp(*arr,"read")==0)
{
if(q!=3)
{
printf("Enter Correct Command Arguments to Run\n");
goto l1;
}
long proc_id;
char *c;
proc_id = atol(*(arr+1));
int reqva;
reqva = strtol(*(arr+2),&c,2);
int cpa = cse320_virt_to_phys(reqva); //got process ID for lvl 1 table and index for lvl 2 table
if(cpa>1023 || cpa <0)
{
printf("error, address out of range\n");
goto l1;
}
int i;
i=0;
while(i<4)
{
if(proc_id!=flpt[i].p_id)
{
i++;
}
else break;
}
if(i==4)
{
printf("Wrong Process ID\n");
}
else
{
char strnum[30];
if(flpt[i].sl->val[cpa]!=1)
{
printf("No Physical Address at that Index\n");
goto l1;
}
int a = flpt[i].sl->phy_add[cpa]; //got actual physical address
sprintf(strnum, "%d", a);
int fifo_main,fifo_mem;
fifo_mem = open("fifo_mem",O_RDWR);
if(fifo_mem<1) {
printf("Error opening file");
}
char msg[100];
strcpy(msg,"read ");
strcat(msg, strnum);
size_t rem= strlen(msg);
msg[rem]='\0';
write(fifo_mem,msg,strlen(msg)+1);
int item;
fifo_main = open("fifo_main",O_RDWR);
if(fifo_main<1) {
printf("Error opening file");
}
read(fifo_main,&item,sizeof(int));
printf("Data at given address is : %d\n",item);
close(fifo_mem);
close(fifo_main);
}
}
else if(strcmp(*arr,"write")==0)
{
if(q!=4)
{
printf("Enter Correct Command Arguments to Run\n");
goto l1;
}
long proc_id;
char *c;
proc_id = atol(*(arr+1));
int reqva;
reqva = strtol(*(arr+2),&c,2);
int cpa = cse320_virt_to_phys(reqva); //got process ID for lvl 1 table and index for lvl 2 table
if(cpa>1023 || cpa <0)
{
printf("error, address out of range\n");
goto l1;
}
int i;
i=0;
while(i<4)
{
if(proc_id!=flpt[i].p_id)
{
i++;
}
else break;
}
if(i==4)
{
printf("Wrong Process ID\n");
}
else
{
char strnum[30];
if(flpt[i].sl->val[cpa]!=1)
{
printf("No Physical Address at that Index\n");
goto l1;
}
int a = flpt[i].sl->phy_add[cpa]; //got actual physical address
sprintf(strnum, "%d", a);
int fifo_mem;
fifo_mem = open("fifo_mem",O_RDWR);
if(fifo_mem<1) {
printf("Error opening file");
}
char msg[100];
strcpy(msg,"write ");
strcat(msg, strnum);
strcat(msg, " ");
strcat(msg, *(arr+3));
size_t rem= strlen(msg);
msg[rem]='\0';
write(fifo_mem,msg,strlen(msg)+1);
sleep(5);
close(fifo_mem);
}
}
else if(strcmp(*arr,"exit")==0)
{
int fifo_mem;
fifo_mem = open("fifo_mem",O_RDWR);
if(fifo_mem<1) {
printf("Error opening file");
}
int i;
for(i=0;i<4;i++)
{
if(tidArray[i]!=0)
{
if(i==0)
{
pf1=0;
tidArray[0]=0;
flpt[0].p_id = 0;
int cl=0;
while(flpt[0].sl->val[cl]==1)
{
char msg[100],strnum[30];
sprintf(strnum, "%d", flpt[0].sl->phy_add[cl]);
strcpy(msg,"kill ");
strcat(msg, strnum);
size_t rem= strlen(msg);
msg[rem]='\0';
write(fifo_mem,msg,strlen(msg)+1);
vad1[cl]=0;
va1=0;
flpt[0].sl->val[cl] = 0;
cl++;
}
}
else if(i==1)
{
pf2=0;
tidArray[1]=0;
flpt[1].p_id = 0;
int cl=0;
while(flpt[1].sl->val[cl]==1)
{
char msg[100],strnum[30];
sprintf(strnum, "%d", flpt[1].sl->phy_add[cl]);
strcpy(msg,"kill ");
strcat(msg, strnum);
size_t rem= strlen(msg);
msg[rem]='\0';
write(fifo_mem,msg,strlen(msg)+1);
vad2[cl]=0;
va2=0;
flpt[1].sl->val[cl] = 0;
cl++;
}
}
else if(i==2)
{
pf3=0;
tidArray[2]=0;
flpt[2].p_id = 0;
int cl=0;
while(flpt[2].sl->val[cl]==1)
{
char msg[100],strnum[30];
sprintf(strnum, "%d", flpt[2].sl->phy_add[cl]);
strcpy(msg,"kill ");
strcat(msg, strnum);
size_t rem= strlen(msg);
msg[rem]='\0';
write(fifo_mem,msg,strlen(msg)+1);
vad3[cl]=0;
va3=0;
flpt[2].sl->val[cl] = 0;
cl++;
}
}
else
{
pf4=0;
tidArray[3]=0;
flpt[3].p_id = 0;
int cl=0;
while(flpt[3].sl->val[cl]==1)
{
char msg[100],strnum[30];
sprintf(strnum, "%d", flpt[3].sl->phy_add[cl]);
strcpy(msg,"kill ");
strcat(msg, strnum);
size_t rem= strlen(msg);
msg[rem]='\0';
write(fifo_mem,msg,strlen(msg)+1);
vad4[cl]=0;
va4=0;
flpt[3].sl->val[cl] = 0;
cl++;
}
}
pthread_join(tid[i], (void**)&b);
}
}
char msgEx[100];
strcpy(msgEx,"exit");
size_t rem= strlen(msgEx);
msgEx[rem]='\0';
write(fifo_mem,msgEx,strlen(msgEx)+1);
close(fifo_mem);
exit(EXIT_SUCCESS);
}
else printf("Enter Correct Command to Run\n");
}
return -1;
}
|
the_stack_data/220455114.c
|
#include "unicode/ucol.h"
#define PASSES (100000)
#define INPUT1 ("аАбБвВгГдДеЕёЁжЖзЗиИйЙкКлЛмМнНоОпПрРсСтТуУфФхХцЦчЧшШщЩъЪыЫьЬэЭюЮяЯ")
#define INPUT2 ("аАбБвВгГдДеЕёЁжЖзЗиИйЙкКлЛмМнНоОппррссттууффххццччшшщщъъыыььээююяя")
int main() {
UErrorCode status = U_ZERO_ERROR;
UCollator *coll = ucol_open(0, &status);
ucol_setStrength(coll, UCOL_PRIMARY);
for (int i = 0; i < PASSES; ++i) {
UCollationResult coll_res = ucol_strcollUTF8(coll, INPUT1, -1, INPUT2, -1, &status);
(void)(coll_res);
}
ucol_close(coll);
return 0;
}
|
the_stack_data/6388962.c
|
/*
Copyright 2015 William Carney
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
/*
* Utility program to extract subsets of Rihtan source based on
* an index written by the compiler using the -fx option.
*/
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int LineNumbers = 0;
FILE *indexfile;
#define BUFF_SIZE 100
char buff[BUFF_SIZE];
char linetype;
char filename[100];
unsigned firstline, lastline;
int IndentLines = 0;
int Depth = -1;
#define MAX_FILES 100
struct {
char *Name;
FILE *InFile;
unsigned Line;
unsigned PackageNum;
char PreviousLineType;
} Files[MAX_FILES];
int NumFiles = 0;
#define FILE_BUFF_SIZE 1000
char FileBuff[FILE_BUFF_SIZE];
unsigned char LineTypesToDisplay['Z' - 'A' + 1];
void ShowLineNumber(int filenum)
{
if (LineNumbers) {
printf("%05u ", Files[filenum].Line);
}
}
void Indent(void)
{
int n;
if (IndentLines) {
for (n = 0; n < Depth; n++) {
printf(" ");
}
}
}
void WriteLine(void)
{
int commentonly = 0;
if (!LineTypesToDisplay['C' - 'A']) {
char *s;
int instring, quote, comment;
s = FileBuff;
instring = 0; quote = 0;
commentonly = 1; comment = 0;
while (*s) {
if (quote) {
quote = 0;
}
else {
if (*s == '\\' && instring) quote = 1;
if (*s == '"' && (!quote)) instring = !instring;
if (*s == '/' && *(s + 1) == '/' && (!instring)) {
*s = '\n';
*(s + 1) = 0;
comment = 1;
break;
}
else if (*s > ' ') {
commentonly = 0;
}
}
s++;
}
commentonly = commentonly && comment;
}
if (!commentonly) {
fputs(FileBuff, stdout);
}
}
void GetLine(int filenum, int InRange)
{
if (fgets(FileBuff, FILE_BUFF_SIZE, Files[filenum].InFile) == NULL) {
printf("Error reading line %u of %s\n", Files[filenum].Line, Files[filenum].Name);
exit(1);
}
if (InRange && (linetype == 'H' || (linetype == 'G' && Files[filenum].PreviousLineType != 'G'))) {
Files[filenum].PackageNum++;
if (Files[filenum].PackageNum == 1) {
Depth++;
}
}
if ( (InRange && LineTypesToDisplay[linetype - 'A'])
|| ((!InRange) && LineTypesToDisplay['Z' - 'A'])
) {
ShowLineNumber(filenum);
Indent();
WriteLine();
}
else if ( InRange
&& linetype == 'S'
&& (!LineTypesToDisplay['S' - 'A']) /* Not displaying 'separate' statements */
&& (LineTypesToDisplay['H' - 'A']) /* Displaying package headers */
) {
/* Write out a comment to show that the package was from a separate file */
ShowLineNumber(filenum);
Indent();
printf(" //-");
WriteLine();
}
Files[filenum].Line++;
if (InRange && linetype == 'E') {
Files[filenum].PackageNum--;
if (Files[filenum].PackageNum == 0) {
Depth--;
}
}
Files[filenum].PreviousLineType = linetype;
}
void SetDisplay(int negate, char *charlist)
{
int j;
char *s;
for (j = 'A'; j <= 'Z'; j++) LineTypesToDisplay[j - 'A'] = negate;
s = charlist;
while (*s) {
if (*s >= 'A' && *s <= 'Z') {
LineTypesToDisplay[*s - 'A'] = !negate;
}
else {
printf("Unexpected display character '%c'\n", *s);
exit(1);
}
s++;
}
}
void Usage(void)
{
printf("Read the source code along with source_index.txt in order to\n");
printf("extract subsets of the source.\n");
printf("\nCompile with the -fx switch to build source_index.txt.\n\n");
printf("usage: indexer [-nl] [-i] [display]\n");
printf("where\n");
printf(" display is a set of:\n");
printf(" H package header lines\n");
printf(" E package end lines\n");
printf(" G generic package declarations\n");
printf(" I generic package instantiations\n");
printf(" S 'separate' statements\n");
printf(" P public declarations\n");
printf(" U unit test routines and sections\n");
printf(" C comments\n");
printf(" Z everything else\n");
printf(" Prefixing this with '/' indicates the negation of the set\n");
printf(" The default is '/S', i.e. everything except 'separate' statements\n");
printf("\n");
printf("-nl Add line numbers at the left\n");
printf("-i Indent separate packages\n");
printf
("\n-------------------------------------------------------------------------------\n");
printf("Rihtan source indexer Copyright (C) 2015 William Carney\n");
printf("Licensed under the Apache License, Version 2.0 (the \"License\");\n");
printf("you may not use this file except in compliance with the License.\n");
printf("You may obtain a copy of the License at\n");
printf(" http://www.apache.org/licenses/LICENSE-2.0\n");
printf("Unless required by applicable law or agreed to in writing, software\n");
printf("distributed under the License is distributed on an \"AS IS\" BASIS,\n");
printf("WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n");
printf("See the License for the specific language governing permissions and\n");
printf("limitations under the License.\n");
printf
("-------------------------------------------------------------------------------\n\n");
}
int main(int argc, char **argv)
{
char *s;
int j;
int wrotenl;
// Default - display everything except 'separate' statements (but do display
// the separate files themselves)
SetDisplay(1, "S");
//
argv++;
while (argc > 1) {
s = *argv;
if (s[0] == '-') {
if (!strcmp(s, "-nl")) {
LineNumbers = 1;
}
else if (!strcmp(s, "-i")) {
IndentLines = 1;
}
else if (!strcmp(s, "--help")) {
Usage();
exit(1);
}
else {
printf("Unexpected parameter '%s'\n\n", s);
Usage();
exit(1);
}
}
else if (s[0] == '/') {
SetDisplay(1, s + 1);
}
else {
SetDisplay(0, s);
}
argv++;
argc--;
}
//
indexfile = fopen("source_index.txt", "r");
if (indexfile == NULL) {
printf("Cannot open source_index.txt\n");
exit(1);
}
wrotenl = 0;
while (!feof(indexfile)) {
fgets(buff, BUFF_SIZE, indexfile);
s = buff;
while (*s) {
if (*s == ':' || *s == '-') *s = ' ';
s++;
}
sscanf(buff, "%c %s %u %u\n", &linetype, filename, &firstline, &lastline);
// printf(">> %c,%s,%u,%u\n", linetype, filename, firstline, lastline);
if (!(linetype >= 'A' && linetype <= 'Z')) {
printf("Bad line type '%c' in %s\n", linetype, filename);
exit(2);
}
for (j = 0; j < NumFiles; j++) {
if (!strcmp(Files[j].Name, filename)) break;
}
if (j >= NumFiles) {
if (j >= MAX_FILES) {
printf("Too many files\n");
return 1;
}
NumFiles = j + 1;
Files[j].Name = strdup(filename);
Files[j].InFile = fopen(filename, "r");
if (Files[j].InFile == NULL) {
printf("Cannot open %s\n", Files[j].Name);
exit(1);
}
Files[j].Line = 1;
Files[j].PackageNum = 0;
Files[j].PreviousLineType = 0;
}
if (Files[j].Line < firstline) {
while (Files[j].Line < firstline) {
GetLine(j, 0);
wrotenl = 0;
}
if ((!LineTypesToDisplay['Z' - 'A']) && (!wrotenl)) {
printf("\n");
wrotenl = 1;
}
}
while (Files[j].Line <= lastline) {
GetLine(j, 1);
wrotenl = 0;
}
}
fclose(indexfile);
return 0;
}
|
the_stack_data/52535.c
|
#include <stdio.h>
#include <stdbool.h>
int main(){
printf("int possui: %dbytes \n", sizeof(int));
printf("float possui: %dbytes \n", sizeof(float));
printf("double possui: %dbytes \n", sizeof(double));
printf("bool possui: %dbytes \n", sizeof(bool));
printf("char possui: %dbytes \n", sizeof(char));
return 0;
}
|
the_stack_data/75273.c
|
/*
* Copyright (C) 2019 Intel Corporation. All rights reserved.
* SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
*/
#include <stdio.h>
#include <pthread.h>
static pthread_mutex_t mutex;
static pthread_cond_t cond;
static void *thread(void *arg)
{
int *num = (int *)arg;
pthread_mutex_lock(&mutex);
printf("thread start \n");
for (int i = 0; i < 10; i++) {
*num = *num + 1;
printf("num: %d\n", *num);
}
pthread_cond_signal(&cond);
pthread_mutex_unlock(&mutex);
printf("thread exit \n");
return NULL;
}
int main(int argc, char *argv[])
{
pthread_t tid;
int num = 0, ret = -1;
if (pthread_mutex_init(&mutex, NULL) != 0) {
printf("Failed to init mutex.\n");
return -1;
}
if (pthread_cond_init(&cond, NULL) != 0) {
printf("Failed to init cond.\n");
goto fail1;
}
pthread_mutex_lock(&mutex);
if (pthread_create(&tid, NULL, thread, &num) != 0) {
printf("Failed to create thread.\n");
goto fail2;
}
printf("cond wait start\n");
pthread_cond_wait(&cond, &mutex);
pthread_mutex_unlock(&mutex);
printf("cond wait success.\n");
if (pthread_join(tid, NULL) != 0) {
printf("Failed to join thread.\n");
}
ret = 0;
fail2:
pthread_cond_destroy(&cond);
fail1:
pthread_mutex_destroy(&mutex);
return ret;
}
|
the_stack_data/179831336.c
|
#include <stdio.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <unistd.h>
#include <time.h>
#include <stdlib.h>
#define CMD_TAM 32
#define NMR_STRUCS 5
#define TIME_LIMIT 11
#define CMD_SIZE 14
typedef struct {
char cmd[CMD_TAM];
int tempo;
} comando;
volatile sig_atomic_t cmdNr = 0;
volatile sig_atomic_t sonPid = -1;
char executable[CMD_SIZE] = "/0";
void handle_ALRM(int signo, siginfo_t *sinfo, void *context) {
char msg[CMD_SIZE] = "/0";
sprintf(msg, "Gonna kill %d\n", sonPid);
write(STDOUT_FILENO, msg, (sizeof(msg)+1));
strncpy(msg, "/0", (sizeof(msg)+1));
//msg = "/0";
kill(sonPid, SIGKILL);
wait(NULL);
sprintf(msg, "The command %s didn’t end in its allowed time!\n", executable);
write(STDOUT_FILENO, msg, (sizeof(msg)+1));
}
void handleCHLD(int signo, siginfo_t *sinfo, void *context) {
alarm(0);
}
void fillCommandsList(comando *cmds) {
int i;
char buffer[CMD_SIZE] = "/0";
int t_exec;
//int t_allowed;
srand(time(0));
for (i = 0; i < NMR_STRUCS; i++) {
t_exec = rand() % 10;
sprintf(buffer, "dorminhoco %d", t_exec);
strncpy(cmds[i].cmd, buffer, (sizeof(buffer)+1));
cmds[i].tempo = rand() % 10;
}
}
int main() {
struct sigaction act;
memset(&act, 0, sizeof(struct sigaction));
sigemptyset(&act.sa_mask);
sigaddset(&act.sa_mask, SIGCHLD);
act.sa_sigaction = handle_ALRM;
act.sa_flags = SA_SIGINFO;
sigaction(SIGALRM, &act, NULL);
struct sigaction act2;
memset(&act2, 0, sizeof(struct sigaction));
sigemptyset(&act2.sa_mask);
act2.sa_sigaction = handleCHLD;
act2.sa_flags = SA_SIGINFO;
sigaction(SIGCHLD, &act2, NULL);
printf("Father process: %d\n", getpid());
comando c1, c2, c3, c4, c5;
comando commandsList[NMR_STRUCS] = {c1, c2, c3, c4, c5};
fillCommandsList(commandsList);
int i;
for (i = 0; i < NMR_STRUCS; i++) {
int j;
pid_t pid = fork();
if(pid==-1){
perror("fork failed");
return 1;
}
if (pid == 0) {
sonPid = getpid();
execl(commandsList[i].cmd, commandsList[i].cmd, (char *)NULL);
//printf("Process %s on child failed.", commandList[i].cmd);
//exit(EXIT_FAILURE);
} if (pid > 0) {
strncpy(executable, commandsList[i].cmd, (sizeof(commandsList[i].cmd)+1));
alarm(commandsList[i].tempo);
}
for (j = 0; j < commandsList[i].tempo; j++) {
if((j + 1) > TIME_LIMIT) {
cmdNr = (i + 1);
//raise(SIGINT);
break;
}
sleep(1);
}
}
return 0;
}
|
the_stack_data/218894067.c
|
/* Write a program to determine the ranges of char, short, int, and long variables,
both signed and unsigned, by printing the appripriate values from standard
headers and by direct computation. */
#include <stdio.h>
int main(void)
{
printf("char: %d\n", sizeof(char));
printf("short: %d\n", sizeof(short));
printf("int: %d\n", sizeof(int));
printf("unsigned int: %d\n", sizeof(unsigned int));
printf("signed int: %d\n", sizeof(signed int));
printf("long: %d\n", sizeof(long));
printf("\nfloat: %d\n", sizeof(float));
printf("double: %d\n", sizeof(double));
printf("long double: %d\n", sizeof(long double));
printf("\nComputed range of char: %d\n", compute_char());
// the range for other types can be computed like this as well
return 0;
}
/* compute_char: returns the range of a char in bytes. */
int compute_char(void)
{
char x = 1;
int i = 0;
while (x)
{
x = x << 1; // shift left by 1 bit
++i;
}
return (i / 8); // transform bits in bytes
}
|
the_stack_data/15764093.c
|
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
#include <stddef.h>
#include <stdio.h>
#include <string.h>
typedef struct
{
unsigned u, v, w;
} Edge;
// Yields a small gain in performance over sscanf and friends in CE's
// environment due to naive parsing rules and lack of locale awareness
// on our part.
static unsigned extractUint(const char** string)
{
assert(string && *string);
unsigned result = 0;
const char* c = *string;
#define IS_PAYLOAD() (*c >= '0' && *c <= '9')
// Eat anything that's not a digit.
while(*c && !IS_PAYLOAD()) ++c;
for(;*c; ++c)
{
if(!IS_PAYLOAD())
{
++c;
break;
}
else result = (result * 10) + (*c - '0');
}
#undef IS_PAYLOAD
*string = c;
return result;
}
static unsigned getMaxVertexId(const Edge* const edges, const size_t edgeCount)
{
assert(edges && edgeCount);
#define MAX(A, B) ((A) > (B) ? (A) : (B))
unsigned result = 0;
for(size_t i = 0; i < edgeCount; ++i)
{
const unsigned peak = MAX(edges[i].u, edges[i].v);
if(peak > result) result = peak;
}
return result;
#undef MAX
}
// Reusing challenge 164's solution.
static unsigned getMstLength(const Edge* const edges, const size_t edgeCount)
{
assert(edges && edgeCount);
const unsigned tableWidth = getMaxVertexId(edges, edgeCount);
// As per the problem statement.
assert((tableWidth >= 3) && (tableWidth <= 100));
// VLAs yield a slightly better memory score on CodeEval than straight
// [m,c]alloc. Shouldn't rely on this in C11 and onwards, though.
unsigned distances[tableWidth][tableWidth];
memset(distances, 0, sizeof distances);
// Fill the distance table.
for(size_t i = 0; i < edgeCount; ++i)
{
const Edge* const edge = &edges[i];
distances[edge->u - 1][edge->v - 1] = edge->w;
distances[edge->v - 1][edge->u - 1] = edge->w;
}
bool used[tableWidth];
size_t indices[tableWidth];
unsigned values[tableWidth];
memset(used, false, sizeof used);
memset(indices, 0, sizeof indices);
for(size_t i = 0; i < tableWidth; ++i)
{
values[i] = UINT_MAX;
}
for(size_t i = 0; i < tableWidth; ++i)
{
size_t j = 0;
// Find the next best unused node. The upper bound is pretty small so
// dumb linear search should be fast enough.
{
unsigned value = UINT_MAX;
for(size_t k = 0; k < tableWidth; ++k) if(!used[k])
{
if(values[k] < value)
{
j = k;
value = values[k];
}
}
used[j] = true;
}
// Record path.
for(size_t k = 0; k < tableWidth; ++k) if(!used[k])
{
const unsigned value = distances[j][k];
if(value && value < values[k])
{
values[k] = value;
indices[k] = j;
}
}
}
// Presence of unvisited vertices means the "must visit all cities"
// constraint can't be satisfied.
if(memchr(used, false, sizeof used)) return 0;
unsigned result = 0;
// Tally path sum.
for(size_t i = 0; i < tableWidth; ++i)
{
result += distances[indices[i]][i];
}
return result;
}
int main(const int argc, const char* const argv[])
{
// Getting away with no error checking throughout because CodeEval makes some
// strong guarantees about our runtime environment. No need to pay when we're
// being benchmarked. Don't forget to define NDEBUG prior to submitting!
assert(argc >= 2 && "Expecting at least one command-line argument.");
static char stdoutBuffer[256] = "";
// Turn on full output buffering for stdout.
setvbuf(stdout, stdoutBuffer, _IOFBF, sizeof stdoutBuffer);
FILE* inputStream = fopen(argv[1], "r");
assert(inputStream && "Failed to open input stream.");
for(char lineBuffer[8192] = "";
fgets(lineBuffer, sizeof lineBuffer, inputStream);)
{
Edge edges[640] = {{0}};
size_t edgeCount = 0;
// Unserialize graph.
for(const char* cursor = lineBuffer; *cursor;)
{
assert(edgeCount < (sizeof edges / sizeof *edges));
Edge* const edge = &edges[edgeCount++];
edge->u = extractUint(&cursor); // Vertex A.
edge->v = extractUint(&cursor); // Vertex B.
edge->w = extractUint(&cursor); // Edge weight.
}
assert(edgeCount);
const unsigned pathLength = getMstLength(edges, edgeCount);
if(pathLength) printf("%u\n", pathLength);
else puts("False");
}
// The CRT takes care of cleanup.
}
|
the_stack_data/144240.c
|
/* { dg-do compile { target x86_64-*-* } } */
/* { dg-options "-O" } */
typedef int int32_t;
int32_t round32hi (const __int128_t arg)
{
const int SHIFT = 96;
const int mshift = 96;
const __int128_t M = (~(__int128_t) 0) << mshift;
const __int128_t L = (~M) + 1;
const __int128_t L1 = ((__int128_t) L) >> 1;
const __int128_t Mlo = ((__int128_t) (~M)) >> 1;
__int128_t vv = arg & M;
if ((arg & (L1)) && ((arg & Mlo) || (arg & L)))
vv += L;
return (int32_t) (vv >> SHIFT);
}
|
the_stack_data/445995.c
|
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
/*
* gcc-4.8 -m32 -S sample06.c -o sample06.s
*
* $Id: sample06.c $
* $Lastupdate: 2020/06/05 16:59:05 $
*/
/*
1234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890
*--------+---------+---------+---------+---------X---------+---------+---------+---------+---------X
*/
void fun()
{
int a = 4;
int b = 8;
int d = 0;
switch (b) {
case 2:
a++;
break;
case 8:
b++;
break;
default:
d++;
break;
}
}
|
the_stack_data/165768212.c
|
/*
* Copyright (C) 2008 The Android Open Source Project
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#define MAGIC1 0xcafebabeU
#define MAGIC2 0x8badf00dU
#define MAGIC3 0x12345667U
static int g_ok1 = 0;
static int g_ok2 = 0;
static int g_ok3 = 0;
static void
cleanup1( void* arg )
{
if ((unsigned)arg != MAGIC1)
g_ok1 = -1;
else
g_ok1 = +1;
}
static void
cleanup2( void* arg )
{
if ((unsigned)arg != MAGIC2) {
g_ok2 = -1;
} else
g_ok2 = +1;
}
static void
cleanup3( void* arg )
{
if ((unsigned)arg != MAGIC3)
g_ok3 = -1;
else
g_ok3 = +1;
}
static void*
thread1_func( void* arg )
{
pthread_cleanup_push( cleanup1, (void*)MAGIC1 );
pthread_cleanup_push( cleanup2, (void*)MAGIC2 );
pthread_cleanup_push( cleanup3, (void*)MAGIC3 );
if (arg != NULL)
pthread_exit(0);
pthread_cleanup_pop(0);
pthread_cleanup_pop(1);
pthread_cleanup_pop(1);
return NULL;
}
static int test( int do_exit )
{
pthread_t t;
pthread_create( &t, NULL, thread1_func, (void*)do_exit );
pthread_join( t, NULL );
if (g_ok1 != +1) {
if (g_ok1 == 0) {
fprintf(stderr, "cleanup1 not called !!\n");
} else {
fprintf(stderr, "cleanup1 called with wrong argument\n" );
}
exit(1);
}
else if (g_ok2 != +1) {
if (g_ok2 == 0)
fprintf(stderr, "cleanup2 not called !!\n");
else
fprintf(stderr, "cleanup2 called with wrong argument\n");
exit(2);
}
else if (do_exit && g_ok3 != +1) {
if (g_ok3 == 0) {
fprintf(stderr, "cleanup3 not called !!\n");
} else {
fprintf(stderr, "cleanup3 called with bad argument !!\n");
}
exit(3);
}
else if (!do_exit && g_ok3 != 0) {
if (g_ok3 == 1) {
fprintf(stderr, "cleanup3 wrongly called !!\n");
} else {
fprintf(stderr, "cleanup3 wrongly called with bad argument !!\n");
}
exit(3);
}
return 0;
}
int main( void )
{
test(0);
test(1);
printf("OK\n");
return 0;
}
|
the_stack_data/117328725.c
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
const int max=100;
int Dlina(char **uk, char *p, int *a, int n)
{
int x=0,y=0,m=0,i=0,j=0,k=0,t=0,flag=0;
for(i=0;i<n;i++) {
if(a[i]==1) {
a[i]=0;
x=Dlina(uk,uk[i],a,n);
a[i]=1;
t=strnlen(p,max);
if(t>strnlen(uk[i],max)) t=strnlen(uk[i],max);
for(j=strnlen(p,max)-1;j>=0 && ( strnlen(p,max)-j<=strnlen(uk[i],max) );j--) {
flag=1;
for(k=0; k<strnlen(uk[i],max) && k<strnlen(p,max)-j;k++) {
if(p[j+k]!=uk[i][k]) {
flag=0;
break;
}
}
if(flag==1) y=strnlen(p,max)-j;
}
if(y+x>m) m=y+x;
}
}
return m;
}
int main()
{
int n=0, i=0, m=0, rezult=0, s=0;
char **uk;
scanf("%u\n", &n);
uk=(char**)malloc(n*sizeof(char*));
int *a;
a=(int*)malloc(n*sizeof(int));
for(i=0;i<n;i++)
a[i]=0;
for(i=0;i<n;i++) {
uk[i]=(char*)malloc(sizeof(char)*max);
scanf("%s",uk[i]);
a[i]=1;
s+=strnlen(uk[i],max);
}
rezult=s;
for(i=0;i<n;i++) {
a[i]=0;
m=Dlina(uk,uk[i],a,n);
a[i]=1;
if (rezult>s-m) rezult=s-m;
}
printf("%u\n",rezult);
for(i=0;i<n;i++)
free(uk[i]);
free(uk);
free(a);
return 0;
}
|
the_stack_data/26701256.c
|
/* This testcase is part of GDB, the GNU debugger.
Copyright (C) 2013-2016 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/>. */
/* GDB will analyze the prologue of functions f1 and f2. */
struct foo
{
int a[32];
};
static int
f1 (void)
{
return 0;
}
static double
f2 (int a, long long b, double c, struct foo f)
{
f.a[0] = a + (int) b + c;
return c + 0.2;
}
int
main (void)
{
struct foo f;
f1 ();
f2 (0, 0, 0.1, f);
return 0;
}
|
the_stack_data/649818.c
|
/**
* @brief random based sparse matrix generation tool
* @author Zhuoqiang Guo <[email protected]>
*/
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <stdint.h>
inline static int random_int(int m)
{
return rand() % m;
}
inline float random_float()
{
return (float)rand() / RAND_MAX;
}
typedef struct
{
int x;
int y;
float v;
} point_t;
static int row_first_cmp(const point_t *a, const point_t *b)
{
if (a->x != b->x)
return a->x - b->x;
return a->y - b->y;
}
int main(int argc, char *argv[])
{
time_t t;
srand((unsigned)time(&t));
int64_t m, n;
double rate;
if (argc == 4)
{
m = atol(argv[1]);
n = atol(argv[2]);
rate = atof(argv[3]);
}
else if (argc == 3)
{
m = atoi(argv[1]);
n = atoi(argv[2]);
rate = 0.05;
}
else if (argc == 2)
{
m = n = atoi(argv[1]);
rate = 0.05;
}
else
{
printf("Usage : sparse_gen m [n] [rate]\n");
exit(0);
}
size_t number = m * n * rate;
point_t *points = malloc(sizeof(point_t) * number);
for (int i = 0; i < number; i++)
{
points[i].x = random_int(m) + 1;
points[i].y = random_int(n) + 1;
points[i].v = random_float();
}
//sort
qsort(points, number, sizeof(point_t), (__compar_fn_t)row_first_cmp);
//unique
int index = 0;
for (int i = 1; i < number; i++)
{
if (!(points[i].x == points[index].x && points[i].y == points[index].y))
{
index++;
points[index] = points[i];
}
}
int64_t count = index + 1;
//output
char filename[100];
sprintf(filename, "Matrix/%ld_%ld_%ld.mtx", m, n, count);
FILE *fp = fopen(filename, "w");
if(fp == NULL){
printf("output file open error!!!");
exit(-1);
}
fprintf(fp, "%ld %ld %ld\n", m, n, count);
for (int i = 0; i < count; i++)
{
fprintf(fp, "%d %d %.6f\n", points[i].x, points[i].y,points[i].v);
}
printf("%ld %ld %ld \n", m, n, count);
free(points);
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.