file
stringlengths 18
26
| data
stringlengths 3
1.04M
|
|---|---|
the_stack_data/53650.c | // Previously this was generating 1.0f64.wrapping_neg() which does not exist
double no_wrapping_neg(void) {
double a = -1.0;
return a;
}
|
the_stack_data/87636877.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
int main(){
int handle = open("lseek.txt", O_RDONLY);
int len = lseek(handle, 0, SEEK_END);
int i = 0;
char ch;
lseek(handle, 0, SEEK_SET);
for ( ; i < len; i++){
read(handle, &ch, 1);
printf("%d:%c\n", i, ch);
}
printf("len :%d\n", len);
close(handle);
return 0;
}
|
the_stack_data/45450880.c | #include <stdio.h>
#include <stdlib.h>
char evaluar(int cpu, char op1, char op2, char op3) {
if (cpu == 1)
return op1;
if (cpu == 2)
return op2;
if (cpu == 3)
return op3;
}
// e: empate, p: perdiste, g: ganaste
char jugar(int opc) {
int cpu = (rand() % 3) + 1;
printf("Tu: %d vs CPU: %d\n\n", opc, cpu);
switch (opc) {
case 1:
evaluar(cpu, 'e', 'p', 'g');
break;
case 2:
evaluar(cpu, 'g', 'e', 'p');
break;
case 3:
evaluar(cpu, 'p', 'g', 'e');
break;
case 4:
exit(-1);
break;
default:
return 'n';
break;
}
}
void notificar(char cal) {
switch (cal) {
case 'e':
printf("Empate.\n\n");
break;
case 'g':
printf("Ganaste!\n\n");
break;
case 'p':
printf("Perdiste :(\n\n");
break;
case 'n':
printf("La opcion elegida no existe.\n\n");
break;
}
}
int main() {
printf("Piedra, papel y tijeras.\n\n");
int op;
char res;
for (;;) {
printf("Juega\n\n");
printf("(1) piedra.\n");
printf("(2) papel.\n");
printf("(3) tijeras.\n");
printf("(4) salir del juego.\n\n");
printf("Elige una opcion: ");
scanf("%d", &op);
res = jugar(op);
notificar(res);
printf("Presiona una tecla para continuar.");
getch();
}
return 0;
} |
the_stack_data/145125.c | #include <sys/types.h>
#include <stdio.h>
int main (void)
{
printf("%u\n", (unsigned int)sizeof(gid_t)) ;
return 0 ;
}
|
the_stack_data/165769177.c | #include <stdio.h>
int main() {
unsigned char bytes[4];
int sum = 0;
int count = 0;
FILE *fp=fopen("1988730searlymelt.int.304.448.c", "rb");
while ( fread(bytes, 4, 1,fp) != 0) {
int piece = bytes[0] | (bytes[1]<<8) | (bytes[2]<<16) | (bytes[3]<<24);
sum += piece;
printf("The piece is %d\n", piece);
count = count + 1;
}
printf("The sum is %d\n", sum);
printf("the total count is %d\n", count);
return 0;
}
|
the_stack_data/117329440.c | /*
Author : Arnob Mahmud
mail : [email protected]
*/
#include <stdio.h>
int main(int argc, char const *argv[])
{
float A[100], n, sum = 0, avg;
printf("Enter array size : ");
scanf("%f", &n);
printf("Enter %.0f elements :\n", n);
for (int i = 0; i < n; i++)
{
printf("A[%d] : ", i);
scanf("%f", &A[i]);
}
for (int i = 0; i < n; i++)
{
sum += A[i];
}
avg = sum / n;
printf("Sum : %.2f, Average : %.2f", sum, avg);
return 0;
}
|
the_stack_data/67324549.c | #include <stdio.h>
void swap(int *i, int *j) {
int temp = *i;
*i = *j;
*j = temp;
}
void qsort(int *a, int l, int r) {
if(l >= r)
return;
int i, m=l;
for(i=l+1; i<=r; i++)
if(a[i]<a[l])
swap(&a[i], &a[++m]);
swap(&a[l], &a[m]);
qsort(a, l, m-1);
qsort(a, m+1, r);
}
int main()
{
int a[] = {2,5,1,3,7,0,9,4};
qsort(a, 0, 7);
return 0;
} |
the_stack_data/26700133.c | #include <stdio.h>
int main(){
int x, y;
while(1){
scanf("%d %d", &x, &y);
if(x == 0 || y == 0)
break;
if(x > 0 && y > 0)
printf("primeiro\n");
else if(x < 0 && y > 0)
printf("segundo\n");
else if(x < 0 && y < 0)
printf("terceiro\n");
else
printf("quarto\n");
}
return 0;
} |
the_stack_data/61074809.c | struct _MyS {
int foo;
} MyS;
struct _MyS ww;
int x, y;
typedef union {
struct {
int field : 16;
};
} r_t;
void test() {
r_t reg;
reg.field = 1;
}
// RUN: c-index-test -cursor-at=%s:1:9 \
// RUN: -cursor-at=%s:2:9 \
// RUN: -cursor-at=%s:5:9 \
// RUN: -cursor-at=%s:7:5 \
// RUN: -cursor-at=%s:7:8 \
// RUN: -cursor-at=%s:17:8 \
// RUN: %s | FileCheck %s
// CHECK: StructDecl=_MyS:1:8 (Definition)
// CHECK: FieldDecl=foo:2:7 (Definition)
// CHECK: TypeRef=struct _MyS:1:8
// CHECK: VarDecl=x:7:5
// CHECK: VarDecl=y:7:8
// CHECK: 17:7 MemberRefExpr=field:11:9 |
the_stack_data/184517180.c | /* This software was developed at the National Institute of Standards and
* Technology by employees of the Federal Government in the course of their
* official duties. Pursuant to title 17 Section 105 of the United States
* Code this software is not subject to copyright protection and is in the
* public domain. NIST assumes no responsibility whatsoever for its use by
* other parties, and makes no guarantees, expressed or implied, about its
* quality, reliability, or any other characteristic.
* We would appreciate acknowledgement if the software is used.
* The SAMATE project website is: http://samate.nist.gov
*/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
typedef struct str_t str;
struct str_t {
union {
int a;
char *b;
} foo;
};
int main(int argc, char *argv[])
{
str container;
container.foo.a = 0;
if ((container.foo.b = (char *)malloc(256*sizeof(char))) != NULL)
{
strcpy(container.foo.b, "Falut!");
container.foo.b[0] = 'S';
printf("%s\n", container.foo.b);
free(container.foo.b);
container.foo.b = NULL; /* FIX */
if(container.foo.b)
container.foo.b[0] = 'S';
}
return 0;
}
|
the_stack_data/153268205.c | /************************************************************************************
* 2.6 Feladat *
* Ciklus segítségével ötször olvasson be egy számot, majd írja ki annak négyzetét *
************************************************************************************/
#include <stdio.h>
int main()
{
int ertek, i;
for (i=0; i<5; i++)
{
scanf("%d", &ertek);
printf("a(z) %d negyzete: %d\n", ertek, ertek*ertek);
}
return 0;
}
|
the_stack_data/248581772.c | //
// Binocle
// Copyright (c) 2015-2019 Valerio Santinelli
// All rights reserved.
//
|
the_stack_data/27385.c | #include <stdio.h>
#include <stdlib.h>
// Prototyping the function (lesson)
double cube(double num);
int main()
{
// Printing out the call of the cube(3.0) function
// Expected output: 27.00000
printf("Answer: %f", cube(3.0));
return 0;
}
// Lesson on return statements
double cube(double num)
{
double result = num * num * num;
// Return will break us out of the function and return this value back
// Anything placed under this wouldn't work because the function has been broken out of
// at this point.
return result;
// you could also return num * num * num instead of the variable
}
|
the_stack_data/108172.c |
/*
* File name: smyblas2.c
* Purpose:
* Level 2 BLAS operations: solves and matvec, written in C.
* Note:
* This is only used when the system lacks an efficient BLAS library.
*/
/*
* Solves a dense UNIT lower triangular system. The unit lower
* triangular matrix is stored in a 2D array M(1:nrow,1:ncol).
* The solution will be returned in the rhs vector.
*/
void slsolve ( int ldm, int ncol, float *M, float *rhs )
{
int k;
float x0, x1, x2, x3, x4, x5, x6, x7;
float *M0;
register float *Mki0, *Mki1, *Mki2, *Mki3, *Mki4, *Mki5, *Mki6, *Mki7;
register int firstcol = 0;
M0 = &M[0];
while ( firstcol < ncol - 7 ) { /* Do 8 columns */
Mki0 = M0 + 1;
Mki1 = Mki0 + ldm + 1;
Mki2 = Mki1 + ldm + 1;
Mki3 = Mki2 + ldm + 1;
Mki4 = Mki3 + ldm + 1;
Mki5 = Mki4 + ldm + 1;
Mki6 = Mki5 + ldm + 1;
Mki7 = Mki6 + ldm + 1;
x0 = rhs[firstcol];
x1 = rhs[firstcol+1] - x0 * *Mki0++;
x2 = rhs[firstcol+2] - x0 * *Mki0++ - x1 * *Mki1++;
x3 = rhs[firstcol+3] - x0 * *Mki0++ - x1 * *Mki1++ - x2 * *Mki2++;
x4 = rhs[firstcol+4] - x0 * *Mki0++ - x1 * *Mki1++ - x2 * *Mki2++
- x3 * *Mki3++;
x5 = rhs[firstcol+5] - x0 * *Mki0++ - x1 * *Mki1++ - x2 * *Mki2++
- x3 * *Mki3++ - x4 * *Mki4++;
x6 = rhs[firstcol+6] - x0 * *Mki0++ - x1 * *Mki1++ - x2 * *Mki2++
- x3 * *Mki3++ - x4 * *Mki4++ - x5 * *Mki5++;
x7 = rhs[firstcol+7] - x0 * *Mki0++ - x1 * *Mki1++ - x2 * *Mki2++
- x3 * *Mki3++ - x4 * *Mki4++ - x5 * *Mki5++
- x6 * *Mki6++;
rhs[++firstcol] = x1;
rhs[++firstcol] = x2;
rhs[++firstcol] = x3;
rhs[++firstcol] = x4;
rhs[++firstcol] = x5;
rhs[++firstcol] = x6;
rhs[++firstcol] = x7;
++firstcol;
for (k = firstcol; k < ncol; k++)
rhs[k] = rhs[k] - x0 * *Mki0++ - x1 * *Mki1++
- x2 * *Mki2++ - x3 * *Mki3++
- x4 * *Mki4++ - x5 * *Mki5++
- x6 * *Mki6++ - x7 * *Mki7++;
M0 += 8 * ldm + 8;
}
while ( firstcol < ncol - 3 ) { /* Do 4 columns */
Mki0 = M0 + 1;
Mki1 = Mki0 + ldm + 1;
Mki2 = Mki1 + ldm + 1;
Mki3 = Mki2 + ldm + 1;
x0 = rhs[firstcol];
x1 = rhs[firstcol+1] - x0 * *Mki0++;
x2 = rhs[firstcol+2] - x0 * *Mki0++ - x1 * *Mki1++;
x3 = rhs[firstcol+3] - x0 * *Mki0++ - x1 * *Mki1++ - x2 * *Mki2++;
rhs[++firstcol] = x1;
rhs[++firstcol] = x2;
rhs[++firstcol] = x3;
++firstcol;
for (k = firstcol; k < ncol; k++)
rhs[k] = rhs[k] - x0 * *Mki0++ - x1 * *Mki1++
- x2 * *Mki2++ - x3 * *Mki3++;
M0 += 4 * ldm + 4;
}
if ( firstcol < ncol - 1 ) { /* Do 2 columns */
Mki0 = M0 + 1;
Mki1 = Mki0 + ldm + 1;
x0 = rhs[firstcol];
x1 = rhs[firstcol+1] - x0 * *Mki0++;
rhs[++firstcol] = x1;
++firstcol;
for (k = firstcol; k < ncol; k++)
rhs[k] = rhs[k] - x0 * *Mki0++ - x1 * *Mki1++;
}
}
/*
* Solves a dense upper triangular system. The upper triangular matrix is
* stored in a 2-dim array M(1:ldm,1:ncol). The solution will be returned
* in the rhs vector.
*/
void
susolve ( ldm, ncol, M, rhs )
int ldm; /* in */
int ncol; /* in */
float *M; /* in */
float *rhs; /* modified */
{
float xj;
int jcol, j, irow;
jcol = ncol - 1;
for (j = 0; j < ncol; j++) {
xj = rhs[jcol] / M[jcol + jcol*ldm]; /* M(jcol, jcol) */
rhs[jcol] = xj;
for (irow = 0; irow < jcol; irow++)
rhs[irow] -= xj * M[irow + jcol*ldm]; /* M(irow, jcol) */
jcol--;
}
}
/*
* Performs a dense matrix-vector multiply: Mxvec = Mxvec + M * vec.
* The input matrix is M(1:nrow,1:ncol); The product is returned in Mxvec[].
*/
void smatvec ( ldm, nrow, ncol, M, vec, Mxvec )
int ldm; /* in -- leading dimension of M */
int nrow; /* in */
int ncol; /* in */
float *M; /* in */
float *vec; /* in */
float *Mxvec; /* in/out */
{
float vi0, vi1, vi2, vi3, vi4, vi5, vi6, vi7;
float *M0;
register float *Mki0, *Mki1, *Mki2, *Mki3, *Mki4, *Mki5, *Mki6, *Mki7;
register int firstcol = 0;
int k;
M0 = &M[0];
while ( firstcol < ncol - 7 ) { /* Do 8 columns */
Mki0 = M0;
Mki1 = Mki0 + ldm;
Mki2 = Mki1 + ldm;
Mki3 = Mki2 + ldm;
Mki4 = Mki3 + ldm;
Mki5 = Mki4 + ldm;
Mki6 = Mki5 + ldm;
Mki7 = Mki6 + ldm;
vi0 = vec[firstcol++];
vi1 = vec[firstcol++];
vi2 = vec[firstcol++];
vi3 = vec[firstcol++];
vi4 = vec[firstcol++];
vi5 = vec[firstcol++];
vi6 = vec[firstcol++];
vi7 = vec[firstcol++];
for (k = 0; k < nrow; k++)
Mxvec[k] += vi0 * *Mki0++ + vi1 * *Mki1++
+ vi2 * *Mki2++ + vi3 * *Mki3++
+ vi4 * *Mki4++ + vi5 * *Mki5++
+ vi6 * *Mki6++ + vi7 * *Mki7++;
M0 += 8 * ldm;
}
while ( firstcol < ncol - 3 ) { /* Do 4 columns */
Mki0 = M0;
Mki1 = Mki0 + ldm;
Mki2 = Mki1 + ldm;
Mki3 = Mki2 + ldm;
vi0 = vec[firstcol++];
vi1 = vec[firstcol++];
vi2 = vec[firstcol++];
vi3 = vec[firstcol++];
for (k = 0; k < nrow; k++)
Mxvec[k] += vi0 * *Mki0++ + vi1 * *Mki1++
+ vi2 * *Mki2++ + vi3 * *Mki3++ ;
M0 += 4 * ldm;
}
while ( firstcol < ncol ) { /* Do 1 column */
Mki0 = M0;
vi0 = vec[firstcol++];
for (k = 0; k < nrow; k++)
Mxvec[k] += vi0 * *Mki0++;
M0 += ldm;
}
}
|
the_stack_data/1059618.c | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
#include <time.h>
#define N 1000000
#define NCHAR 26
#define MOD 100003 // 4e+7 5e+3 不能选太大，@可能溢出
// 2017-9-13
// 想过类似方法，但使用的逐字节异或作为hash函数
// 2018/08/07
// 判断字符串匹配 s.contains(t)，另参考KMP算法
//
int match_brute_force(char* s, char* t) {
int len = strlen(t);
for (int r=0; r<=strlen(s)-len+1; r++) { // at most strlen(s)-len+1 round trials
int i = r, j = 0;
while (j < len && s[i++] == t[j++])
if (j == len) return r;
}
return -1;
}
int hash[N]; // hash[i]: hash value of prefix string s[0..i-1]
int modpow[N]; // modpow[i]: (26^i) mod MOD, helper for calc
void init_hash(char *s) {
modpow[0] = 1; // 26^0 mod MOD == 1
hash[0] = 0; // hash value of null string is 0
for (int i=1; i<=strlen(s); i++) { // 注意这里取等，算全串的hash
modpow[i] = (modpow[i-1] * NCHAR) % MOD;
hash[i] = (hash[i-1] * NCHAR + s[i-1] - 'a') % MOD; // 'a'~'z' offset to 0~25
}
}
int get_hash(int i, int j) { // hash value of s[i..j-1]
int tmp = (hash[j] - hash[i] * modpow[j-i]) % MOD; // 可能溢出
return tmp >= 0 ? tmp : tmp + MOD;
}
bool memequ(char s1[], char s2[], int n) { // or memcmp()
while (n--) if (s1[n] != s2[n]) return false;
return true;
}
int match_hash(char* s, char* t) {
init_hash(s); // hash of s[] prefix strings
int hash = 0, len = strlen(t);
for (int i=0; i<len; i++) // hash of t
hash = (hash * NCHAR + t[i] - 'a') % MOD;
for (int i=0; i<strlen(s)-len+1; i++)
if (get_hash(i, i+len)==hash && memequ(&s[i], t, len))
return i;
return -1;
}
int main() {
srand(time(NULL));
char s[N], t[N];
int r = rand() % 10 + 1;
while (r--) {
int lens = rand() % (N-1) + 1;
for (int i=0; i<lens; i++)
s[i] = rand() % NCHAR + 'a';
s[lens] = '\0';
int lent = __max(__min(lens >> 10, 3), 2);
for (int i=0; i<lent; i++)
t[i] = rand() % NCHAR + 'a';
t[lent] = '\0';
clock_t e;
int m1, m2;
e = clock();
m1 = match_brute_force(s, t);
printf("[match_brute_force]: %d\n", clock() - e);
e = clock();
m2 = match_hash(s, t);
printf("[match_hash]: %d\n", clock() - e);
if (m1 == m2) printf("Match at %d\n", m1); // aka. m2
else {
printf("Medthods Mismatch: %d != %d\n", m1, m2);
printf("lens=%d lent=%d\n", lens, lent);
for (int i=0; i<lent; i++)
printf("%c", t[i]); putchar(10);
for (int i=m1; i<m1+lent; i++)
printf("%c", s[i]); putchar(10);
for (int i=m2; i<m2+lent; i++)
printf("%c", s[i]); putchar(10);
}
puts("=====================");
}
} |
the_stack_data/175142884.c | #include <stdio.h>
void f(int x) {
printf("In func f: &x=%p\n", &x);
x++;
}
int main() {
int x = 3;
printf("In main :&x=%p\n", &x);
f(x); // pass by value
printf("%d\n", x);
return 0;
}
|
the_stack_data/86075105.c | #include <stdio.h>
#include <stdlib.h>
#include <netdb.h>
#include <netinet/in.h>
#include <unistd.h>
#include <signal.h>
#include <pthread.h>
#include <string.h>
#define OPEN 0
#define CLOSED 1
void *connection_f ();
void *connect_handler(void* args);
int sockfd;
int max_clients = 2;
int all_clients = 0;
int isClose = OPEN;
void clear_all(){
isClose = CLOSED;
printf("closing server\r\n");
while (all_clients != 0){
printf("Waiting for closing clients... \r\n");
sleep(1);
}
printf("Closing server...\n");
shutdown(sockfd, SHUT_RDWR);
close(sockfd);
}
void deleteConnection(int newsockfd){
printf("Closing socket = %d \r\n", newsockfd);
shutdown(newsockfd, SHUT_RDWR);
close(newsockfd);
all_clients--;
pthread_exit(0);
}
int sockfd;
int main(int argc, char *argv[]) {
//CTRL+C
signal(SIGINT, clear_all);
uint16_t portno;
struct sockaddr_in serv_addr;
/* First call to socket() function */
sockfd = socket(AF_INET, SOCK_STREAM, 0);
if (sockfd <= 0) {
perror("ERROR opening socket");
exit(1);
}
/* Initialize socket structure */
bzero((char *) &serv_addr, sizeof(serv_addr));
portno = 5001;
serv_addr.sin_family = AF_INET;
serv_addr.sin_addr.s_addr = INADDR_ANY;
serv_addr.sin_port = htons(portno);
/* Now bind the host address using bind() call.*/
if (bind(sockfd, (struct sockaddr *) &serv_addr, sizeof(serv_addr)) < 0) {
perror("ERROR on binding");
exit(1);
}
/* Making new thread for messaging with client */
pthread_t thread; //thread
int result; //result of thread creating
result = pthread_create(&thread, NULL, connection_f, NULL); //create new thread
if(result != 0) {
perror("Error while creating thread");
}
char cmd;
while(!isClose){
cmd = getchar();
if (cmd == 'q'){
break;
}
}
clear_all();
return 0;
}
void *connection_f (){
/* Accept actual connection from the client */
struct sockaddr_in cli_addr;
unsigned int clilen;
int newsockfd;
int n;
listen(sockfd, 5);
clilen = sizeof(cli_addr);
pthread_t threadCreation;
while (!isClose) {
newsockfd = accept(sockfd, (struct sockaddr *) &cli_addr, &clilen);
if (newsockfd <= 0) {
perror("ERROR on accept");
continue;
}
n = pthread_create(&threadCreation, NULL, connect_handler, (void*) newsockfd);
if (n != 0) {
printf("Error on creating client thread");
} else {
all_clients++;
}
}
pthread_exit(0);
}
void *connect_handler (void *args){
int newsockfd = (int*) args;
char buffer[256];
ssize_t n;
/* If connection is established then start communicating */
while(!isClose){
bzero(buffer, sizeof(buffer));
n = read(newsockfd, buffer, sizeof(buffer)); // recv on Windows
if (n <= 0) {
perror("ERROR reading from socket");
deleteConnection(newsockfd);
}
printf("Here is the message: %s\n", buffer);
/* Write a response to the client */
n = write(newsockfd, "I got your message", 18); // send on Windows
if (n <= 0) {
perror("ERROR writing to socket");
deleteConnection(newsockfd);
}
bzero(buffer, 256);
}
deleteConnection(newsockfd);
}
|
the_stack_data/237642883.c | #include <stdio.h>
/*
As saídas do primeiro programa foram:
4 9 13
As saídas do segundo programa foram:
61FE10 61FE14 61FE18
Resposta:
O primeiro programa imprime os valores do array 'vet'.
O segundo programa imprime os endereços de memória de cada posição do array 'vet'
*/
/*
int main(){
int vet[] = {4,9,13};
int i;
for(i=0;i<3;i++){
printf("%d ",*(vet+i));
}
}
*/
int main(){
int vet[] = {4,9,13};
int i;
for(i=0;i<3;i++){
printf("%X ",vet+i);
}
}
|
the_stack_data/96903.c | #include <stdio.h>
#include <string.h>
void parseDigits(int *, char*);
void printResult(int *);
int charToDigit(char);
void main(){
int digits[21];
int i = 0;
while (i < 21){ //so we can add to the digit ARRAY right AWAY
digits[i++] = 0;
}
char input[20];
printf("Problem 13: Big ints.\n");
printf("Enter first digit: ");
scanf("%s", input);
parseDigits(digits, input);
printf("Enter second digit: ");
scanf("%s", input);
parseDigits(digits, input);
printf("Result: ");
printResult(digits);
}
//interprets the string and adds the value to the current value of the big int
void parseDigits(int* digits, char *string){
char *end = string + strlen(string) - 1;
int i;
for (i = 0; i < strlen(string); i++, end--){
int *digit = digits + i;
printf("%d", *digit);
*digit += charToDigit(*end);
printf("%d", charToDigit(*end));
if (*digit >= 10){ //carry one
*digit -= 10;
digit++;
*digit += 1;
}
}
}
int charToDigit(char intwannabe){
if (intwannabe >= 48 && intwannabe <= 57){
return intwannabe - 48;
}
return -1;
}
void printResult(int *digits){
int i = 21 - 1;
while (i >= 0){
if (*(digits + i) != 0) printf("%d", *(digits + i));
i--;
}
}
|
the_stack_data/39141.c | #include <stdio.h>
void suatuprint(int a)
{
char wordOdd[20] = "GANJIL";
char wordEven[20] = "Genap";
if (a == 1)
{
printf("A\n");
printf("%s", wordOdd);
}
else if (a == 2)
{
printf("B\n");
printf("%s", wordEven);
}
else if (a == 3)
{
printf("C\n");
printf("%s", wordOdd);
}
else if (a == 4)
{
printf("D\n");
printf("%s", wordEven);
}
else
{
printf("error");
if (a % 2 == 0)
{
printf("\n%s", wordEven);
}
else
{
printf("\n%s",wordOdd);
}
}
}
int main(int argc, char const *argv[])
{
suatuprint(3);
printf("\n");
return 0;
}
|
the_stack_data/40763189.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
void brainfuck_interpreter(char *instructions);
void clean(const char *buffer, FILE *fp);
char chaine[30000]={0};
char *ptr=chaine;
int main(){
char chaine[30000]={0};
printf("Write your brainfuck program then press ENTER :\n");
fgets(chaine, sizeof(chaine), stdin);
clean(chaine, stdin);
brainfuck_interpreter(chaine);
return 0;
}
void brainfuck_interpreter(char * instruction){
for (;*instruction != '\0'; ++instruction)
{
switch (*instruction)
{
case '>': ++ptr; break;
case '<': --ptr; break;
case '+': ++*ptr; break;
case '-': --*ptr; break;
case '.': putchar(*ptr); break;
case ',': *ptr = getchar(); break;
case '[':
if (!*ptr)
{
int loop_cnt = 1;
while (loop_cnt)
{
++instruction; //jump to next instruction
if (*instruction == ']') //decrement loop, if loop=1 close the loop
--loop_cnt;
else if (*instruction == '[') //add a loop in our loop
++loop_cnt;
}
}
break;
case ']':
if (*ptr)
{
int loop_cnt = 1;
while (loop_cnt)
{
--instruction;
if (*instruction == '[')
--loop_cnt;
else if (*instruction == ']')
++loop_cnt;
}
}
break;
default:
printf("Invalid character '%c'\n", *instruction);
}
}
}
void clean(const char *buffer, FILE *fp)
{
char *p = strchr(buffer,'\n');
if (p != NULL)
{
*p = 0;
}
else
{
int c;
while ((c = fgetc(fp)) != '\n' && c != EOF);
}
}
|
the_stack_data/596712.c | /**
* BOJ 10952번 C언어 소스 코드
* 작성자 : 동동매니저 (DDManager)
*
* ※ 실행 결과
* 사용 메모리 : 1,116 KB / 262,144 KB
* 소요 시간 : 0 ms / 1,000 ms
*
* Copyright 2019. DDManager all rights reserved.
*/
#include <stdio.h>
int main(void){
int A,B;
while(scanf("%d %d",&A,&B)!=EOF){
if(A==0&&B==0) break;
printf("%d\n",A+B);
}
return 0;
} |
the_stack_data/167331814.c | #include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#define N 10
pthread_t threads[N];
pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER;
void *thread_id(void *id) {
sleep(rand() % 5);
pthread_mutex_lock(&mutex);
printf("Hello from thread: %d\n", (int)id);
pthread_mutex_unlock(&mutex);
pthread_exit(NULL);
}
int main() {
for (int i = 0; i < N; ++i) {
// passing `i` causes warnings assotiated with `pointer to int` casts,
// but size of `int` - 4bytes < size of `void *` - 4/8bytes,
// so there is no error
int err = pthread_create(&(threads[i]), NULL, thread_id, (void *)i);
if (err) {
fprintf(stderr, "Something went wrong. %d\n", err);
}
}
for (int i = 0; i < N; ++i) {
pthread_join(threads[i], NULL);
}
return EXIT_SUCCESS;
}
|
the_stack_data/130778.c | /**
* Proof of concept offloaded memcopy using AXI Direct Memory Access v7.1
*/
#include <stdio.h>
#include <unistd.h>
#include <fcntl.h>
#include <termios.h>
#include <sys/mman.h>
#include <string.h>
#include <stdint.h>
#include <time.h>
#include <inttypes.h>
struct timespec start, end;
#define MM2S_CONTROL_REGISTER 0x00
#define MM2S_STATUS_REGISTER 0x04
#define MM2S_START_ADDRESS 0x18
#define MM2S_LENGTH 0x28
#define S2MM_CONTROL_REGISTER 0x30
#define S2MM_STATUS_REGISTER 0x34
#define S2MM_DESTINATION_ADDRESS 0x48
#define S2MM_LENGTH 0x58
#define XACELERATOR_CRTL_BUS_ADDR_AP_CTRL 0x0
#define XACELERATOR_CRTL_BUS_ADDR_GIE 0x4
#define XACELERATOR_CRTL_BUS_ADDR_IER 0x8
#define XACELERATOR_CRTL_BUS_ADDR_ISR 0xc
#define PHY_MEMORY_START 0x3e000000
#define PHY_MEMORY_SIZE 0x01000000
#define INTS_TO_GENERATE 10000
#define BYTES_TO_TRANSFER 4*INTS_TO_GENERATE //importante transferir exactamente la cantidad especificada.
unsigned int dma_set(unsigned int* dma_virtual_address, int offset, unsigned int value) {
dma_virtual_address[offset>>2] = value;
return 0;
}
unsigned int dma_get(unsigned int* dma_virtual_address, int offset) {
return dma_virtual_address[offset>>2];
}
// CRTL_BUS
// 0x0 : Control signals
// bit 0 - ap_start (Read/Write/COH)
// bit 1 - ap_done (Read/COR)
// bit 2 - ap_idle (Read)
// bit 3 - ap_ready (Read)
// bit 7 - auto_restart (Read/Write)
// others - reserved
void dma_crtl_status(unsigned int* dma_virtual_address) {
// unsigned int status = dma_get(dma_virtual_address, XACELERATOR_CRTL_BUS_ADDR_AP_CTRL);
// printf("AXILite Control signal status (0x%08x@0x%02x):", status, XACELERATOR_CRTL_BUS_ADDR_AP_CTRL);
// if (status & 0x00000001) printf(" ap_start");
// if (status & 0x00000002) printf(" ap_done");
// if (status & 0x00000004) printf(" ap_idle");
// if (status & 0x00000008) printf(" ap_ready");
// if (status & 0x00000128) printf(" auto_restart");
// printf("\n");
}
void dma_s2mm_status(unsigned int* dma_virtual_address) {
// unsigned int status = dma_get(dma_virtual_address, S2MM_STATUS_REGISTER);
// printf("Stream to memory-mapped status (0x%08x@0x%02x):", status, S2MM_STATUS_REGISTER);
// if (status & 0x00000001) printf(" halted"); else printf(" running");
// if (status & 0x00000002) printf(" idle");
// if (status & 0x00000008) printf(" SGIncld");
// if (status & 0x00000010) printf(" DMAIntErr");
// if (status & 0x00000020) printf(" DMASlvErr");
// if (status & 0x00000040) printf(" DMADecErr");
// if (status & 0x00000100) printf(" SGIntErr");
// if (status & 0x00000200) printf(" SGSlvErr");
// if (status & 0x00000400) printf(" SGDecErr");
// if (status & 0x00001000) printf(" IOC_Irq");
// if (status & 0x00002000) printf(" Dly_Irq");
// if (status & 0x00004000) printf(" Err_Irq");
// printf("\n");
}
void dma_mm2s_status(unsigned int* dma_virtual_address) {
// unsigned int status = dma_get(dma_virtual_address, MM2S_STATUS_REGISTER);
// printf("Memory-mapped to stream status (0x%08x@0x%02x):", status, MM2S_STATUS_REGISTER);
// if (status & 0x00000001) printf(" halted"); else printf(" running");
// if (status & 0x00000002) printf(" idle");
// if (status & 0x00000008) printf(" SGIncld");
// if (status & 0x00000010) printf(" DMAIntErr");
// if (status & 0x00000020) printf(" DMASlvErr");
// if (status & 0x00000040) printf(" DMADecErr");
// if (status & 0x00000100) printf(" SGIntErr");
// if (status & 0x00000200) printf(" SGSlvErr");
// if (status & 0x00000400) printf(" SGDecErr");
// if (status & 0x00001000) printf(" IOC_Irq");
// if (status & 0x00002000) printf(" Dly_Irq");
// if (status & 0x00004000) printf(" Err_Irq");
// printf("\n");
}
int dma_mm2s_sync(unsigned int* dma_virtual_address, unsigned int* dma_ip_control) {
unsigned int mm2s_status = dma_get(dma_virtual_address, MM2S_STATUS_REGISTER);
while(!(mm2s_status & 1<<12) || !(mm2s_status & 1<<1) ){
dma_s2mm_status(dma_virtual_address);
dma_mm2s_status(dma_virtual_address);
dma_crtl_status(dma_ip_control);
mm2s_status = dma_get(dma_virtual_address, MM2S_STATUS_REGISTER);
}
return 0;
}
int dma_s2mm_sync(unsigned int* dma_virtual_address, unsigned int* dma_ip_control) {
unsigned int s2mm_status = dma_get(dma_virtual_address, S2MM_STATUS_REGISTER);
while(!(s2mm_status & 1<<12) || !(s2mm_status & 1<<1)){
dma_s2mm_status(dma_virtual_address);
dma_mm2s_status(dma_virtual_address);
dma_crtl_status(dma_ip_control);
s2mm_status = dma_get(dma_virtual_address, S2MM_STATUS_REGISTER);
}
return 0;
}
void memdump(void* virtual_address, int byte_count) {
char *p = virtual_address;
int offset;
for (offset = 0; offset < byte_count; offset++) {
printf("%02x", p[offset]);
if (offset % 4 == 3) { printf(" "); }
}
//int conversion
printf("\n\t\t\t\t");
unsigned int *int_p = virtual_address;
for (offset = 0; offset < byte_count/4; offset++) {
printf("%d\t", int_p[offset]);
}
printf("\n");
}
int main() {
//printf("Stage1: Init\n");
int dh = open("/dev/mem", O_RDWR | O_SYNC); // Open /dev/mem which represents the whole physical memory
//printf("Stage1: Opened /dev/mem\n");
unsigned int* virtual_address = mmap(NULL, 65535, PROT_READ | PROT_WRITE, MAP_SHARED, dh, 0x40400000); // Memory map AXI Lite register block//printf("Stage1: Opened /dev/mem\n");
unsigned int* virtual_address_ctrl = mmap(NULL, 65535, PROT_READ | PROT_WRITE, MAP_SHARED, dh, 0x43C00000); // Memory map AXI Lite control block
//printf("Stage1: Allocated AXI memblock\n");
unsigned int* virtual_source_address = mmap(NULL, 65535, PROT_READ | PROT_WRITE, MAP_SHARED, dh, PHY_MEMORY_START); // Memory map source address
//printf("Stage1: Allocated AXIDMA source\n");
unsigned int* virtual_destination_address = mmap(NULL, 65535, PROT_READ | PROT_WRITE, MAP_SHARED, dh, PHY_MEMORY_START + (PHY_MEMORY_SIZE/2)); // Memory map destination address
//printf("Stage1: Allocated AXIDMA destination\n");
//printf("Stage2: Clearing destination blocks\n");
int i;
for(i=0; i<INTS_TO_GENERATE;i++){
virtual_source_address[i]= rand()%INTS_TO_GENERATE; // Write random stuff to source block
}
memset(virtual_destination_address, 0, BYTES_TO_TRANSFER); // Clear destination block
//printf("Stage3: Dumping!\n");
// printf("Source memory block: "); memdump(virtual_source_address, BYTES_TO_TRANSFER);
// printf("Destination memory block: "); memdump(virtual_destination_address, BYTES_TO_TRANSFER);
clock_gettime(CLOCK_MONOTONIC_RAW, &start);
//printf("Resetting DMA\n");
dma_set(virtual_address, S2MM_CONTROL_REGISTER, 4);
dma_set(virtual_address, MM2S_CONTROL_REGISTER, 4);
dma_s2mm_status(virtual_address);
dma_mm2s_status(virtual_address);
dma_crtl_status(virtual_address_ctrl);
//printf("Halting DMA\n");
dma_set(virtual_address, S2MM_CONTROL_REGISTER, 0);
dma_set(virtual_address, MM2S_CONTROL_REGISTER, 0);
dma_s2mm_status(virtual_address);
dma_mm2s_status(virtual_address);
dma_crtl_status(virtual_address_ctrl);
//printf("Starting AP...\n");
dma_set(virtual_address_ctrl, XACELERATOR_CRTL_BUS_ADDR_AP_CTRL, 1);
dma_crtl_status(virtual_address_ctrl);
//printf("Writing destination address\n");
dma_set(virtual_address, S2MM_DESTINATION_ADDRESS, PHY_MEMORY_START + (PHY_MEMORY_SIZE/2)); // Write destination address
dma_s2mm_status(virtual_address);
dma_crtl_status(virtual_address_ctrl);
//printf("Writing source address...\n");
dma_set(virtual_address, MM2S_START_ADDRESS, PHY_MEMORY_START); // Write source address
dma_mm2s_status(virtual_address);
dma_crtl_status(virtual_address_ctrl);
//printf("Starting S2MM channel with all interrupts masked...\n");
dma_set(virtual_address, S2MM_CONTROL_REGISTER, 0xf001);
dma_s2mm_status(virtual_address);
dma_crtl_status(virtual_address_ctrl);
//printf("Starting MM2S channel with all interrupts masked...\n");
dma_set(virtual_address, MM2S_CONTROL_REGISTER, 0xf001);
dma_mm2s_status(virtual_address);
dma_crtl_status(virtual_address_ctrl);
//printf("Writing S2MM transfer length...\n");
dma_set(virtual_address, S2MM_LENGTH, BYTES_TO_TRANSFER);
dma_s2mm_status(virtual_address);
dma_crtl_status(virtual_address_ctrl);
//printf("Writing MM2S transfer length...\n");
dma_set(virtual_address, MM2S_LENGTH, BYTES_TO_TRANSFER);
dma_mm2s_status(virtual_address);
dma_crtl_status(virtual_address_ctrl);
//printf("Waiting for MM2S synchronization...\n");
dma_mm2s_sync(virtual_address, virtual_address_ctrl);
//printf("Waiting for S2MM sychronization...\n");
dma_s2mm_sync(virtual_address, virtual_address_ctrl); // If this locks up make sure all memory ranges are assigned under Address Editor!
dma_s2mm_status(virtual_address);
dma_mm2s_status(virtual_address);
clock_gettime(CLOCK_MONOTONIC_RAW, &end);
uint64_t delta_us = (end.tv_sec - start.tv_sec) * 1000000 + (end.tv_nsec - start.tv_nsec) / 1000;
printf("Elapsed time: %" PRIu64 "\n", delta_us);
// printf("Destination memory block: "); memdump(virtual_destination_address, BYTES_TO_TRANSFER);
return 0;
}
|
the_stack_data/690831.c |
int a,b,c,d,e;
int *p[5];
int main() {
int *x;
p[0] = &a;
p[1] = &b;
x = (int *)p + sizeof(int *);
int y;
y = *x;
}
|
the_stack_data/7949634.c | #include<stdio.h>
#define SQUARES 64
int main(void)
{
const double CROP = 2E16;
double current, total;
int count = 1;
printf("square grains total ");
printf("fraction of \n");
printf(" added grains ");
printf("world total\n");
total = current = 1.0;
printf("%4d %13.2e %12.2e %12.2e\n", count, current,
total, total / CROP);
while (count < SQUARES)
{
count = count + 1;
current = 2.0 * current;
total = total + current;
printf("%4d %13.2e %12.2e %12.2e\n", count, current,
total, total / CROP);
}
printf("That'is all.\n");
return 0;
}
|
the_stack_data/458567.c | #include <stdio.h>
#include <stdlib.h>
int main() {
char * str = getenv("USER_NAME");
if(str != NULL) printf("Hello %s!\n", str);
} |
the_stack_data/1168067.c | #include <assert.h>
int stirling_number(int number, int it) {
int result;
if (it == 1 || number == it)
result = 1;
else
result = it * stirling_number(number - 1, it) + stirling_number(number - 1, it - 1);
return result;
}
int main() {
assert(stirling_number(5, 2) == 15);
assert(stirling_number(6, 5) == 15);
return 0;
}
|
the_stack_data/40762201.c | #include <unistd.h>
int main()
{
for(;;){
fork();
}
}
|
the_stack_data/711740.c | char *Spice_Exec_Dir = "D:spice3\\bin";
char *Spice_Lib_Dir = "D:spice3\\lib";
char Spice_OptChar = '-';
char *Def_Editor = "vi";
int AsciiRawFile = 1;
char *Bug_Addr = "";
char *Spice_Host = "";
char *Spiced_Log = "";
|
the_stack_data/179830118.c | /* More subroutines needed by GCC output code on some machines. */
/* Compile this one with gcc. */
/* Copyright (C) 1989, 1992, 2001, 2002, 2003, 2004
Free Software Foundation, Inc.
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
In addition to the permissions in the GNU General Public License, the
Free Software Foundation gives you unlimited permission to link the
compiled version of this file into combinations with other programs,
and to distribute those combinations without any restriction coming
from the use of this file. (The General Public License restrictions
do apply in other respects; for example, they cover modification of
the file, and distribution when not linked into a combine
executable.)
GCC 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 GCC; see the file COPYING. If not, write to
the Free Software Foundation, 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA. */
/* The libgcc2.c implementation gets confused by our type setup and creates
a directly recursive call, so we do our own implementation. For
the H8/300, that's in lib1funcs.asm, for H8/300H and H8S, it's here. */
#ifndef __H8300__
long __fixunssfsi (float a);
long
__fixunssfsi (float a)
{
if (a >= (float) 32768L)
return (long) (a - 32768L) + 32768L;
return (long) a;
}
#endif
|
the_stack_data/95693.c | /* Check malloc(NULL) */
#include <malloc.h>
int main()
{
int * p = NULL;
free(p);
return 0;
}
|
the_stack_data/692429.c | #include <stdio.h>
int main(){
int a,i,k;
scanf("%d",&a);
k=a;
for(i=0;i<2;i++){
a=a*k;
printf("%d\n",a);
}
return 0;
}
|
the_stack_data/150140873.c | #include <stdio.h>
int main()
{
int i,sum=0;
for(i=1; i<=100 ; i++){
if(i%2==0){
sum=sum+i;
}
}
printf("%d\n",sum);
return 0;
}
|
the_stack_data/68888397.c | // This file is part of CPAchecker,
// a tool for configurable software verification:
// https://cpachecker.sosy-lab.org
//
// SPDX-FileCopyrightText: 2007-2020 Dirk Beyer <https://www.sosy-lab.org>
//
// SPDX-License-Identifier: Apache-2.0
#include <stdlib.h>
#include <stdio.h>
struct node {
int* ptr;
};
int main() {
struct node f;
struct node* tmp;
tmp = &f;
int t = 3;
int* ptr = &t;
f.ptr = ptr;
int* generatedVar = tmp->ptr;
if (*generatedVar != 3) {
goto ERROR;
}
printf ("SAFE\n");
return 0;
ERROR:
printf ("UNSAFE\n");
ERROR2:
goto ERROR2;
return 1;
}
|
the_stack_data/156392499.c | /* Test __atomic routines for existence and proper execution on 2 byte
values with each valid memory model. */
/* { dg-do run } */
/* Test the execution of the __atomic_compare_exchange_n builtin for a short. */
extern void abort(void);
short v = 0;
short expected = 0;
short max = ~0;
short desired = ~0;
short zero = 0;
#define STRONG 0
#define WEAK 1
int
main ()
{
if (!__atomic_compare_exchange_n (&v, &expected, max, STRONG , __ATOMIC_RELAXED, __ATOMIC_RELAXED))
abort ();
if (expected != 0)
abort ();
if (__atomic_compare_exchange_n (&v, &expected, 0, STRONG , __ATOMIC_ACQUIRE, __ATOMIC_RELAXED))
abort ();
if (expected != max)
abort ();
if (!__atomic_compare_exchange_n (&v, &expected, 0, STRONG , __ATOMIC_RELEASE, __ATOMIC_ACQUIRE))
abort ();
if (expected != max)
abort ();
if (v != 0)
abort ();
if (__atomic_compare_exchange_n (&v, &expected, desired, WEAK, __ATOMIC_ACQ_REL, __ATOMIC_ACQUIRE))
abort ();
if (expected != 0)
abort ();
if (!__atomic_compare_exchange_n (&v, &expected, desired, STRONG , __ATOMIC_SEQ_CST, __ATOMIC_SEQ_CST))
abort ();
if (expected != 0)
abort ();
if (v != max)
abort ();
/* Now test the generic version. */
v = 0;
if (!__atomic_compare_exchange (&v, &expected, &max, STRONG, __ATOMIC_RELAXED, __ATOMIC_RELAXED))
abort ();
if (expected != 0)
abort ();
if (__atomic_compare_exchange (&v, &expected, &zero, STRONG , __ATOMIC_ACQUIRE, __ATOMIC_RELAXED))
abort ();
if (expected != max)
abort ();
if (!__atomic_compare_exchange (&v, &expected, &zero, STRONG , __ATOMIC_RELEASE, __ATOMIC_ACQUIRE))
abort ();
if (expected != max)
abort ();
if (v != 0)
abort ();
if (__atomic_compare_exchange (&v, &expected, &desired, WEAK, __ATOMIC_ACQ_REL, __ATOMIC_ACQUIRE))
abort ();
if (expected != 0)
abort ();
if (!__atomic_compare_exchange (&v, &expected, &desired, STRONG , __ATOMIC_SEQ_CST, __ATOMIC_SEQ_CST))
abort ();
if (expected != 0)
abort ();
if (v != max)
abort ();
return 0;
}
|
the_stack_data/179831290.c | #include<stdio.h>
#include<stdlib.h>
int main(int argc, char const *argv[])
{
/* code */
int s = 0;
printf("%d\n", s);
return 0;
} |
the_stack_data/52493.c | #include"stdio.h"
int search(int a[],int,int,int);
void main()
{
int n,a[100],i,key,pos,j,k;
//clrscr();
printf("\n Enter number of term:");
scanf("%d",&n);
printf("\n Enter elements:");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
//sorting
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
k=a[i];
a[i]=a[j];
a[j]=k;
}
}
}
printf("\n Enter searching element:");
scanf("%d",&key);
pos=search(&a[0],0,n-1,key);
if(pos==-1)
printf("\n not found....");
else
printf("\n found...");
//getch();
}
int search(int a[],int low,int high,int key)
{
int mid;
while(low<=high)
{
mid=low+(high-low)*((key-a[low])/(a[high]-a[low]));
if(key==a[mid])
return mid+1;
if(key<a[mid])
high=mid-1;
else
low=mid+1;
}
return -1;
}
|
the_stack_data/161081159.c | //clang -Xclang -ast-dump -fsyntax-only main.c
#include <stdio.h>
long long c = 10;
int main() {
printf("%lld\n", c);
long long x;
x = !c;
printf("%lld\n", x);
return 0;
}
|
the_stack_data/156393711.c | #include<stdio.h>
int main()
{
int c;
while((c = getchar()) != EOF)
putchar(c);
}
|
the_stack_data/26700078.c | #include <stdio.h>
#include <malloc.h>
struct Tree
{
struct Tree *Right;
struct Tree *Left;
double Data;
};
void init(struct Tree **t)
{
*t = (struct Tree *)malloc(sizeof(struct Tree));
(*t)->Right = NULL;
(*t)->Left = NULL;
(*t)->Data = 2147483648;
}
void clean(struct Tree *t)
{
if (t != NULL)
{
if (t->Right != NULL) clean(t->Right);
if (t->Left != NULL) clean(t->Left);
free(t);
}
}
struct Tree* find(struct Tree *t, int value)
{
if (t->Data==value) return t;
else
{
if (value < t->Data)
{
if (t->Left != NULL) return(find(t->Left, value));
else return NULL;
}
else
{
if (t->Right != NULL) return(find(t->Right, value));
else return NULL;
}
}
}
int find_with_output(struct Tree *t, int value)
{
if (t->Data == value)
{
printf("_ ");
if (t->Left != NULL) printf("%d ", (int)t->Left->Data);
else printf("_ ");
if (t->Right != NULL) printf("%d", (int)t->Right->Data);
else printf("_");
}
else
{
if (value < t->Data)
{
if (t->Left != NULL)
{
if (t->Left->Data == value)
{
printf("%d ", (int)t->Data);
if ((t->Left->Left) != NULL) printf("%d ", (int)t->Left->Left->Data);
else printf("_ ");
if ((t->Left->Right) != NULL) printf("%d", (int)t->Left->Right->Data);
else printf("_");
}
else return(find_with_output(t->Left, value));
}
else return 1;
}
else
{
if (t->Right != NULL)
{
if (t->Right->Data == value)
{
printf("%d ", (int)t->Data);
if ((t->Right->Left) != NULL) printf("%d ", (int)t->Right->Left->Data);
else printf("_ ");
if ((t->Right->Right) != NULL) printf("%d", (int)t->Right->Right->Data);
else printf("_");
}
else return(find_with_output(t->Right, value));
}
else return 1;
}
}
return 0;
}
int insert(struct Tree *t, int value)
{
if (t->Data == 2147483648)
{
t->Data = value;
return 0;
}
if (t->Data == value) return 1;
if (value > (t->Data))
{
if ((t->Right)!=NULL) return(insert(t->Right, value));
else
{
t->Right=(struct Tree *)malloc(sizeof(struct Tree));
t->Right->Right = NULL;
t->Right->Left = NULL;
t->Right->Data = value;
return 0;
}
}
else
{
if ((t->Left) != NULL) return(insert(t->Left, value));
else
{
t->Left = (struct Tree *)malloc(sizeof(struct Tree));
t->Left->Right = NULL;
t->Left->Left = NULL;
t->Left->Data = value;
return 0;
}
}
}
int deep(struct Tree *t)
{
int r=0, l=0;
if ((t->Right) != NULL) r=deep(t->Right);
if ((t->Left) != NULL) l = deep(t->Left);
if (r > l) return (r+1);
return (l+1);
}
int remove_node(struct Tree **t, int value)
{
if ((*t)->Data == value)
{
if ((*t)->Right != NULL)
{
struct Tree *Temp = (*t)->Right, *Temp2;
if (Temp->Left != NULL)
{
while (Temp->Left->Left != NULL)
{
Temp = Temp->Left;
}
(*t)->Data = Temp->Left->Data;
Temp2=Temp->Left;
Temp->Left=Temp2->Right;
free(Temp2);
}
else
{
struct Tree *Temp;
(*t)->Data = (*t)->Right->Data;
Temp = (*t)->Right;
(*t)->Right = (*t)->Right->Right;
free(Temp);
}
}
else
{
struct Tree *Temp;
Temp = (*t);
(*t) = (*t)->Left;
free(Temp);
Temp = NULL;
}
return 0;
}
else
{
if (value < ((*t)->Data))
{
if ((*t)->Left != NULL) return(remove_node(&((*t)->Left), value));
else return 1;
}
else
{
if (((*t)->Right) != NULL) return(remove_node(&((*t)->Right), value));
else return 1;
}
}
}
int remove_min(struct Tree *t)
{
struct Tree *Temp = t, *Temp2;
if (Temp->Left != NULL)
{
while (Temp->Left->Left != NULL)
{
Temp = Temp->Left;
}
Temp2 = Temp->Left;
Temp->Left = Temp2->Right;
free(Temp2);
}
else
{
Temp = t->Right;
free(t);
t = Temp;
}
return 0;
}
int rotate_right(struct Tree **t)
{
if (*t == NULL) return 1;
struct Tree *A, *B, *C=(*t)->Right, *x=(*t)->Left, *y=(*t), *Temp = (struct Tree *)malloc(sizeof(struct Tree));
if (x != NULL)
{
A = x->Left;
B = x->Right;
}
else return 1;
Temp->Right = y;
Temp->Left = A;
Temp->Right->Right = C;
Temp->Right->Left = B;
Temp->Data = x->Data;
free(x);
(*t) = Temp;
return 0;
}
int rotate_left(struct Tree **t)
{
if (*t == NULL) return 1;
struct Tree *A = (*t)->Left, *B, *C, *x = (*t), *y = (*t)->Right, *Temp=(struct Tree *)malloc(sizeof(struct Tree));
if (y != NULL)
{
B = y->Left;
C = y->Right;
}
else return 1;
Temp->Right = C;
Temp->Left = x;
Temp->Left->Right = B;
Temp->Left->Left = A;
Temp->Data = y->Data;
free(y);
(*t) = Temp;
return 0;
}
int print_tree(struct Tree *t)
{
if (t == NULL)
{
printf("-\n");
return 1;
}
struct Tree *Temp=t;
int Rang=0, i, j, k, sk;
int *comb;
Rang = deep(t);
comb = (int*)malloc(sizeof(int));
for (i = 0; i < Rang; i++)
{
if (i != 0)
{
comb = (int*)realloc(comb, i* sizeof(int));
for (j = 0; j < i; j++)
{
comb[j] = 0;
}
}
j = 1;
sk = i;
while (sk != 0)
{
j = j * 2;
sk--;
}
while (j != 0)
{
k = 0;
Temp = t;
for (k = 0; k < i; k++)
{
if (comb[k] == 0)
{
if ((Temp->Left) != NULL) Temp = Temp->Left;
else
{
k = -1;
break;
}
}
else
{
if ((Temp->Right) != NULL) Temp = Temp->Right;
else
{
k = -1;
break;
}
}
}
if (i != 0)
{
sk=i-1;
comb[sk]++;
while (1)
{
if (comb[sk] == 2)
{
comb[sk] = 0;
sk--;
if (sk < 0) break;
else comb[sk]++;
}
else break;
}
}
if (k==-1) printf("_");
else printf("%d", (int)Temp->Data);
j--;
if (j != 0) printf(" ");
}
printf("\n");
}
return 1;
}
int all(struct Tree *t)
{
if (t == NULL) return 0;
int r, l;
l = all(t->Left);
r = all(t->Right);
return (l + r+1);
}
int main()
{
struct Tree *t;
int i;
double a;
init(&t);
for (i = 0; i < 4; i++)
{
scanf("%lf", &a);
insert(t, a);
}
print_tree(t);
printf("\n");
for (i = 0; i < 3; i++)
{
scanf("%lf", &a);
insert(t, a);
}
print_tree(t);
printf("\n");
for (i = 0; i < 2; i++)
{
scanf("%lf", &a);
a = find_with_output(t, a);
if (a == 1) printf("-");
printf("\n\n");
}
scanf("%lf", &a);
remove_node(&t, a);
print_tree(t);
printf("\n");
while (1)
{
a=rotate_left(&t);
if (a == 1) break;
}
print_tree(t);
printf("\n");
while (1)
{
a = rotate_right(&t);
if (a == 1) break;
}
print_tree(t);
printf("\n");
printf("%d\n\n", all(t));
clean(t);
t = NULL;
print_tree(t);
return 0;
}
|
the_stack_data/15764135.c | int imageGrayscale(unsigned char *data, int width, int height) {
for (int i = 0, il = width * height; i < il; i++) {
unsigned char r = data[i*4+0];
unsigned char g = data[i*4+1];
unsigned char b = data[i*4+2];
data[i*4+0] = data[i*4+1] = data[i*4+2] =
0.2126*r + 0.7152*g + 0.0722*b;
}
return 1;
}
int imageGrayscaleToRed(unsigned char *data, int width, int height) {
for (int i = 0, il = width * height; i < il; i++) {
unsigned char r = data[i*4+0];
unsigned char g = data[i*4+1];
unsigned char b = data[i*4+2];
unsigned char R =254;
data[i*4+0] = R; data[i*4+1] =0; data[i*4+2] =0;
}
return 2;
}
|
the_stack_data/67324402.c | #include<stdio.h>
#include<stdlib.h>
void main()
{
int times;
printf("\n Enter No of times to Beep :");
scanf("%d",×);
while(times!=0)
{
printf("\a");
times--;
}
}
|
the_stack_data/61076411.c | #include <sys/epoll.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <stdbool.h>
#include <stdint.h>
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
static void
make_non_blocking(int fd)
{
int flags = fcntl(fd, F_GETFL);
fcntl(fd, F_SETFL, flags | O_NONBLOCK);
}
enum {
InitialCapacity = 65536, // good start
MaxPendingEvents = 10000 // too enought
};
typedef struct {
int fd;
size_t count;
bool done;
} data_t;
static data_t*
create_event_data(int epoll_fd, int fd)
{
make_non_blocking(fd);
data_t *data = calloc(1, sizeof(*data));
data->fd = fd;
struct epoll_event event_ready_read;
event_ready_read.events = EPOLLIN;
event_ready_read.data.ptr = data;
epoll_ctl(epoll_fd, EPOLL_CTL_ADD, fd, &event_ready_read);
return data;
}
static void
process_pair_ready_read(data_t *data)
{
char buffer[4096];
ssize_t cnt = read(data->fd, buffer, sizeof(buffer));
if (cnt > 0) {
data->count += cnt;
}
else if (0==cnt) {
data->done = true;
close(data->fd); // reached EOF
}
}
static void
process_epoll_event(struct epoll_event *event, size_t *files_left)
{
const uint32_t mask = event->events;
data_t *data = event->data.ptr;
if (mask & EPOLLIN) {
process_pair_ready_read(data);
}
if (data->done) {
*files_left -= 1;
}
}
extern size_t
read_data_and_count(size_t N, int in[N])
{
data_t **entries = calloc(N, sizeof(*entries));
int epoll_fd = epoll_create1(0);
for (size_t i=0; i<N; ++i) {
entries[i] = create_event_data(epoll_fd, in[i]);
}
size_t files_left = N;
struct epoll_event pending[MaxPendingEvents];
while (files_left > 0) {
int n = epoll_wait(epoll_fd, pending, MaxPendingEvents, -1);
for (int i=0; i<n; ++i) {
process_epoll_event(&pending[i], &files_left);
}
}
close(epoll_fd);
size_t result = 0;
for (size_t i=0; i<N; ++i) {
result += entries[i]->count;
}
free(entries);
return result;
}
|
the_stack_data/117328683.c | // RUN: clang-cc -fsyntax-only -verify -pedantic %s
// PR4287
#include <stdarg.h>
char *foo = "test";
int test(char*,...);
int test(fmt)
char*fmt;
{
va_list ap;
char*a;
int x;
va_start(ap,fmt);
a=va_arg(ap,char*);
x=(a!=foo);
va_end(ap);
return x;
}
void exit();
int main(argc,argv)
int argc;char**argv;
{
exit(test("",foo));
}
|
the_stack_data/607732.c | /*
Password Protected Hello 3
*/
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
//Structures
//===========================================================================
typedef struct
{
char *name;
char *pswd;
} User;
//Constants
//===========================================================================
const User users[] = {
{"Dylan", "cheetah"},
{"Fiona", "fox"},
{"Daniel", "lion"},
{"Leila", "lioness"},
{"Serena", "squirrel"}
};
//Functions
//===========================================================================
void Prompt(char *msg, char *buf, int bufSize)
{
//Display prompt
printf("%s ", msg);
//Get input
fgets(buf, bufSize, stdin);
buf[strlen(buf) - 1] = 0;
}
bool IsValid(char *name, char *pswd)
{
//Verify password
for(int i = 0; i < sizeof(users) / sizeof(User); i++)
{
//Found username?
if(strcmp(name, users[i].name) == 0)
{
return (strcmp(pswd, users[i].pswd) == 0);
}
}
return false;
}
//Entry Point
//===========================================================================
int main(int argc, char **argv)
{
//Get credentials
char name[32];
char pswd[32];
Prompt("Name:", name, sizeof(name));
Prompt("Pswd:", pswd, sizeof(pswd));
//Verify credentials
if(IsValid(name, pswd))
{
printf("Hello %s!\n", name);
}
else
{
printf("You're not allowed here %s!\n", name);
}
return 0;
} |
the_stack_data/108039.c | /* Server side implementation of UDP client-server model */
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <arpa/inet.h>
#include <netinet/in.h>
#define PORT 8080
#define MAX_LINE 1024
/* Driver code */
int main() {
int sockfd;
char buffer[MAX_LINE];
char *hello = "Hello from server";
struct sockaddr_in servaddr, cliaddr;
/* Creating socket file descriptor */
if ((sockfd = socket(AF_INET, SOCK_DGRAM, 0)) < 0) {
perror("socket creation failed");
exit(EXIT_FAILURE);
}
memset(&servaddr, 0, sizeof(servaddr));
memset(&cliaddr, 0, sizeof(cliaddr));
/* Filling server information */
servaddr.sin_family = AF_INET; // IPv4
servaddr.sin_addr.s_addr = INADDR_ANY;
servaddr.sin_port = htons(PORT);
/* Bind the socket with the server address */
if (bind(sockfd, (const struct sockaddr *) &servaddr,
sizeof(servaddr)) < 0) {
perror("bind failed");
exit(EXIT_FAILURE);
}
int len, n;
n = recvfrom(sockfd, (char *) buffer, MAX_LINE,
MSG_WAITALL, (struct sockaddr *) &cliaddr,
&len);
buffer[n] = '\0';
printf("Client : %s\n", buffer);
sendto(sockfd, (const char *) hello, strlen(hello),
MSG_CONFIRM, (const struct sockaddr *) &cliaddr,
len);
printf("Hello message sent.\n");
return 0;
} |
the_stack_data/173577495.c | /* A Bitonic Sequence is a sequence of numbers which is first
strictly increasing then after a point strictly decreasing.
Example: -10, 0, 3, 5, 15, 13, 7, 2 */
#include<stdio.h>
int isBitonic(int arr[], int N)
{
if (arr[0] > arr[1])
return -1;
int i, j;
for (i = 2; i < N; i++)
{
if (arr[i - 1] >= arr[i])
break;
}
if (i == N - 1)
return 1;
for (j = i + 1; j < N; j++)
{
if (arr[j - 1] <= arr[j])
break;
}
if (j != N)
return -1;
return 1;
}
int main()
{
printf("Enter number of elements in array");
int N;
scanf("%d", &N);
printf("Enter elements of array");
int arr[N];
for (int i = 0; i < N; i++)
scanf("%d", &arr[i]);
int ans = isBitonic(arr, N);
if (ans == -1)
printf("The array is not bitonic");
else
printf("The array is bitonic");
return 0;
}
/*
Input:
N = 5
arr = {0, 1, 2, 3, 4}
Output:
The array is not bitonic
Input:
N = 5
arr = {0, 2, 4, 3, 1}
Output:
The array is bitonic
Input:
N = 5
arr = {4, 3, 2, 1, 0}
Output:
The array is not bitonic
*/
|
the_stack_data/25137254.c | #include <stdint.h>
const uint8_t __emoji_u1F636[6456] = {
0x00, 0x00, 0x00, 0x00, 0x28, 0x00, 0x00, 0x00, 0x28, 0x00, 0x00, 0x00, 0x0a, 0x00, 0x00, 0x00, 0x38, 0x00, 0x00, 0x00, 0x00, 0x19, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xff, 0x00, 0x00, 0x03,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xc7, 0x91, 0x4b, 0x09, 0xd6, 0x93, 0x3d, 0x1e, 0xe1, 0x96, 0x34, 0x2a, 0xe1, 0x96, 0x34, 0x2a, 0xd8, 0x93, 0x3c, 0x1e, 0xc8, 0x90, 0x48, 0x0a, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xcb, 0x8c, 0x3e, 0x0a, 0xed, 0x96, 0x20, 0x51, 0xf6, 0xa2, 0x1b, 0x9b, 0xf9, 0xac, 0x1b, 0xd5, 0xfc, 0xb4, 0x1a, 0xf6, 0xfe, 0xbb, 0x19, 0xff, 0xff, 0xc0, 0x1a, 0xff, 0xff, 0xc0, 0x19, 0xff, 0xfe, 0xbb, 0x1a, 0xff, 0xfc, 0xb4, 0x1a, 0xf7, 0xf9, 0xab, 0x1a, 0xd7, 0xf6, 0xa2, 0x1a, 0x9d, 0xee, 0x95, 0x1f, 0x54, 0xd0, 0x8b, 0x37, 0x0c, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xdc, 0x8a, 0x26, 0x1a, 0xf4, 0x98, 0x15, 0x8b, 0xfb, 0xa8, 0x13, 0xed, 0xff, 0xbc, 0x13, 0xff, 0xff, 0xcc, 0x15, 0xff, 0xff, 0xda, 0x20, 0xff, 0xff, 0xe5, 0x41, 0xff, 0xff, 0xec, 0x5f, 0xff, 0xff, 0xef, 0x6e, 0xff, 0xff, 0xef, 0x6f, 0xff, 0xff, 0xec, 0x62, 0xff, 0xff, 0xe5, 0x45, 0xff, 0xff, 0xda, 0x23, 0xff, 0xff, 0xcc, 0x15, 0xff, 0xff, 0xbc, 0x13, 0xff, 0xfb, 0xa8, 0x12, 0xef, 0xf4, 0x98, 0x14, 0x90, 0xdb, 0x8a, 0x27, 0x1d, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xc6, 0x84, 0x37, 0x06, 0xf0, 0x92, 0x13, 0x7b, 0xfc, 0xa5, 0x0e, 0xf3, 0xff, 0xbd, 0x0f, 0xff, 0xff, 0xd3, 0x1d, 0xff, 0xff, 0xe9, 0x65, 0xff, 0xff, 0xf7, 0xa9, 0xff, 0xff, 0xfc, 0xd9, 0xff, 0xff, 0xfd, 0xe5, 0xff, 0xff, 0xfd, 0xe5, 0xff, 0xff, 0xfd, 0xe6, 0xff, 0xff, 0xfd, 0xe6, 0xff, 0xff, 0xfd, 0xe5, 0xff, 0xff, 0xfd, 0xe4, 0xff, 0xff, 0xfd, 0xdc, 0xff, 0xff, 0xf8, 0xb3, 0xff, 0xff, 0xeb, 0x70, 0xff, 0xff, 0xd4, 0x25, 0xff, 0xff, 0xbd, 0x0e, 0xff, 0xfc, 0xa5, 0x0d, 0xf5, 0xf0, 0x91, 0x13, 0x82, 0xc7, 0x84, 0x36, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xe1, 0x86, 0x1c, 0x23, 0xf6, 0x96, 0x0d, 0xcc, 0xff, 0xb2, 0x0b, 0xff, 0xff, 0xcb, 0x17, 0xff, 0xff, 0xe9, 0x70, 0xff, 0xff, 0xfb, 0xc3, 0xff, 0xff, 0xfc, 0xcf, 0xff, 0xff, 0xfc, 0xd2, 0xff, 0xff, 0xfd, 0xd6, 0xff, 0xff, 0xfd, 0xd9, 0xff, 0xff, 0xfd, 0xdb, 0xff, 0xff, 0xfd, 0xdd, 0xff, 0xff, 0xfd, 0xdd, 0xff, 0xff, 0xfd, 0xdb, 0xff, 0xff, 0xfd, 0xd9, 0xff, 0xff, 0xfd, 0xd5, 0xff, 0xff, 0xfc, 0xd1, 0xff, 0xff, 0xfc, 0xce, 0xff, 0xff, 0xfc, 0xc8, 0xff, 0xff, 0xed, 0x7f, 0xff, 0xff, 0xcd, 0x1f, 0xff, 0xff, 0xb2, 0x0b, 0xff, 0xf8, 0x97, 0x0c, 0xd1, 0xe1, 0x86, 0x1c, 0x28, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xe4, 0x85, 0x17, 0x3a, 0xfb, 0x9a, 0x09, 0xeb, 0xff, 0xb7, 0x0a, 0xff, 0xff, 0xd7, 0x3a, 0xff, 0xff, 0xf7, 0xa8, 0xff, 0xff, 0xfb, 0xbc, 0xff, 0xff, 0xfb, 0xc0, 0xff, 0xff, 0xfc, 0xc3, 0xff, 0xff, 0xfc, 0xc8, 0xff, 0xff, 0xfc, 0xcc, 0xff, 0xff, 0xfc, 0xcf, 0xff, 0xff, 0xfc, 0xd1, 0xff, 0xff, 0xfc, 0xd2, 0xff, 0xff, 0xfc, 0xd3, 0xff, 0xff, 0xfc, 0xd1, 0xff, 0xff, 0xfc, 0xce, 0xff, 0xff, 0xfc, 0xcb, 0xff, 0xff, 0xfc, 0xc7, 0xff, 0xff, 0xfc, 0xc3, 0xff, 0xff, 0xfb, 0xbf, 0xff, 0xff, 0xfb, 0xbc, 0xff, 0xff, 0xf9, 0xb1, 0xff, 0xff, 0xdb, 0x4c, 0xff, 0xff, 0xb8, 0x0a, 0xff, 0xfb, 0x9b, 0x08, 0xee, 0xe5, 0x87, 0x16, 0x41, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xe2, 0x83, 0x16, 0x3a, 0xfb, 0x98, 0x07, 0xf2, 0xff, 0xb7, 0x09, 0xff, 0xff, 0xdc, 0x55, 0xff, 0xff, 0xf8, 0xa9, 0xff, 0xff, 0xfa, 0xac, 0xff, 0xff, 0xfb, 0xaf, 0xff, 0xff, 0xfb, 0xb3, 0xff, 0xff, 0xfb, 0xb6, 0xff, 0xff, 0xfb, 0xba, 0xff, 0xff, 0xfb, 0xbe, 0xff, 0xff, 0xfb, 0xc1, 0xff, 0xff, 0xfc, 0xc3, 0xff, 0xff, 0xfc, 0xc5, 0xff, 0xff, 0xfc, 0xc4, 0xff, 0xff, 0xfb, 0xc3, 0xff, 0xff, 0xfb, 0xc1, 0xff, 0xff, 0xfb, 0xbd, 0xff, 0xff, 0xfb, 0xb9, 0xff, 0xff, 0xfb, 0xb6, 0xff, 0xff, 0xfb, 0xb2, 0xff, 0xff, 0xfa, 0xaf, 0xff, 0xff, 0xfa, 0xac, 0xff, 0xff, 0xf8, 0xaa, 0xff, 0xff, 0xe1, 0x6a, 0xff, 0xff, 0xb8, 0x0b, 0xff, 0xfb, 0x9a, 0x07, 0xf6, 0xe4, 0x84, 0x14, 0x41, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xd8, 0x7e, 0x19, 0x23, 0xfa, 0x93, 0x06, 0xeb, 0xff, 0xb3, 0x08, 0xff, 0xff, 0xd9, 0x55, 0xff, 0xff, 0xf2, 0x9a, 0xff, 0xff, 0xf8, 0x9b, 0xff, 0xff, 0xfa, 0x9e, 0xff, 0xff, 0xfa, 0xa1, 0xff, 0xff, 0xfa, 0xa4, 0xff, 0xff, 0xfa, 0xa8, 0xff, 0xff, 0xfa, 0xab, 0xff, 0xff, 0xfa, 0xae, 0xff, 0xff, 0xfb, 0xb1, 0xff, 0xff, 0xfb, 0xb4, 0xff, 0xff, 0xfb, 0xb5, 0xff, 0xff, 0xfb, 0xb5, 0xff, 0xff, 0xfb, 0xb3, 0xff, 0xff, 0xfb, 0xb1, 0xff, 0xff, 0xfa, 0xae, 0xff, 0xff, 0xfa, 0xab, 0xff, 0xff, 0xfa, 0xa7, 0xff, 0xff, 0xfa, 0xa4, 0xff, 0xff, 0xfa, 0xa1, 0xff, 0xff, 0xfa, 0x9e, 0xff, 0xff, 0xf8, 0x9b, 0xff, 0xff, 0xf2, 0x99, 0xff, 0xff, 0xdf, 0x69, 0xff, 0xff, 0xb4, 0x0a, 0xff, 0xfb, 0x94, 0x07, 0xef, 0xdd, 0x80, 0x19, 0x29, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xbc, 0x7f, 0x39, 0x06, 0xf5, 0x8b, 0x09, 0xcc, 0xff, 0xab, 0x07, 0xff, 0xff, 0xcf, 0x3f, 0xff, 0xff, 0xec, 0x89, 0xff, 0xff, 0xf2, 0x8b, 0xff, 0xff, 0xf7, 0x8d, 0xff, 0xff, 0xf9, 0x90, 0xff, 0xff, 0xf9, 0x93, 0xff, 0xff, 0xf9, 0x95, 0xff, 0xff, 0xf9, 0x99, 0xff, 0xff, 0xf9, 0x9c, 0xff, 0xff, 0xfa, 0x9e, 0xff, 0xff, 0xfa, 0xa1, 0xff, 0xff, 0xfa, 0xa3, 0xff, 0xff, 0xfa, 0xa4, 0xff, 0xff, 0xfa, 0xa4, 0xff, 0xff, 0xfa, 0xa3, 0xff, 0xff, 0xfa, 0xa1, 0xff, 0xff, 0xfa, 0x9e, 0xff, 0xff, 0xf9, 0x9b, 0xff, 0xff, 0xf9, 0x99, 0xff, 0xff, 0xf9, 0x95, 0xff, 0xff, 0xf9, 0x92, 0xff, 0xff, 0xf9, 0x90, 0xff, 0xff, 0xf7, 0x8d, 0xff, 0xff, 0xf2, 0x8b, 0xff, 0xff, 0xeb, 0x88, 0xff, 0xff, 0xd5, 0x52, 0xff, 0xff, 0xac, 0x07, 0xff, 0xf6, 0x8c, 0x08, 0xd3, 0xc2, 0x7f, 0x31, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xe9, 0x82, 0x0e, 0x7b, 0xff, 0x9e, 0x06, 0xff, 0xff, 0xbf, 0x20, 0xff, 0xff, 0xe3, 0x76, 0xff, 0xff, 0xea, 0x7a, 0xff, 0xff, 0xf0, 0x7d, 0xff, 0xff, 0xf4, 0x7f, 0xff, 0xff, 0xf7, 0x82, 0xff, 0xff, 0xf8, 0x83, 0xff, 0xff, 0xf8, 0x86, 0xff, 0xff, 0xf8, 0x89, 0xff, 0xff, 0xf8, 0x8b, 0xff, 0xff, 0xf9, 0x8e, 0xff, 0xff, 0xf9, 0x90, 0xff, 0xff, 0xf9, 0x92, 0xff, 0xff, 0xf9, 0x92, 0xff, 0xff, 0xf9, 0x92, 0xff, 0xff, 0xf9, 0x92, 0xff, 0xff, 0xf9, 0x90, 0xff, 0xff, 0xf9, 0x8d, 0xff, 0xff, 0xf8, 0x8b, 0xff, 0xff, 0xf8, 0x89, 0xff, 0xff, 0xf8, 0x86, 0xff, 0xff, 0xf8, 0x83, 0xff, 0xff, 0xf7, 0x81, 0xff, 0xff, 0xf4, 0x7f, 0xff, 0xff, 0xef, 0x7d, 0xff, 0xff, 0xeb, 0x7a, 0xff, 0xff, 0xe3, 0x77, 0xff, 0xff, 0xc4, 0x2f, 0xff, 0xff, 0x9f, 0x05, 0xff, 0xea, 0x83, 0x0c, 0x86, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xc9, 0x79, 0x20, 0x1a, 0xf7, 0x8d, 0x05, 0xf4, 0xff, 0xad, 0x09, 0xff, 0xff, 0xd5, 0x57, 0xff, 0xff, 0xe2, 0x69, 0xff, 0xff, 0xe7, 0x6c, 0xff, 0xff, 0xed, 0x6f, 0xff, 0xff, 0xf1, 0x71, 0xff, 0xff, 0xf4, 0x73, 0xff, 0xff, 0xf7, 0x75, 0xff, 0xff, 0xf7, 0x77, 0xff, 0xff, 0xf7, 0x79, 0xff, 0xff, 0xf8, 0x7c, 0xff, 0xff, 0xf8, 0x7d, 0xff, 0xff, 0xf8, 0x80, 0xff, 0xff, 0xf8, 0x81, 0xff, 0xff, 0xf8, 0x82, 0xff, 0xff, 0xf8, 0x82, 0xff, 0xff, 0xf8, 0x81, 0xff, 0xff, 0xf8, 0x80, 0xff, 0xff, 0xf8, 0x7d, 0xff, 0xff, 0xf8, 0x7b, 0xff, 0xff, 0xf7, 0x79, 0xff, 0xff, 0xf7, 0x76, 0xff, 0xff, 0xf7, 0x75, 0xff, 0xff, 0xf4, 0x73, 0xff, 0xff, 0xf1, 0x70, 0xff, 0xff, 0xec, 0x6f, 0xff, 0xff, 0xe8, 0x6c, 0xff, 0xff, 0xe2, 0x6a, 0xff, 0xff, 0xd8, 0x61, 0xff, 0xff, 0xaf, 0x0f, 0xff, 0xf8, 0x8e, 0x05, 0xf7, 0xd1, 0x7c, 0x1e, 0x20, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xe6, 0x7f, 0x0b, 0x8b, 0xfe, 0x9b, 0x06, 0xff, 0xff, 0xbd, 0x28, 0xff, 0xff, 0xd8, 0x5a, 0xff, 0xff, 0xde, 0x5c, 0xff, 0xff, 0xe4, 0x5f, 0xff, 0xff, 0xe9, 0x61, 0xff, 0xff, 0xee, 0x63, 0xff, 0xff, 0xf1, 0x65, 0xff, 0xff, 0xf4, 0x67, 0xff, 0xfe, 0xf4, 0x66, 0xff, 0xfd, 0xf2, 0x65, 0xff, 0xff, 0xf7, 0x6b, 0xff, 0xff, 0xf7, 0x6d, 0xff, 0xff, 0xf7, 0x6f, 0xff, 0xff, 0xf7, 0x70, 0xff, 0xff, 0xf7, 0x71, 0xff, 0xff, 0xf7, 0x71, 0xff, 0xff, 0xf7, 0x70, 0xff, 0xff, 0xf7, 0x6f, 0xff, 0xff, 0xf7, 0x6d, 0xff, 0xff, 0xf7, 0x6b, 0xff, 0xfd, 0xf2, 0x65, 0xff, 0xfe, 0xf4, 0x66, 0xff, 0xff, 0xf3, 0x67, 0xff, 0xff, 0xf0, 0x65, 0xff, 0xff, 0xee, 0x63, 0xff, 0xff, 0xe9, 0x61, 0xff, 0xff, 0xe4, 0x5f, 0xff, 0xff, 0xde, 0x5d, 0xff, 0xff, 0xd8, 0x5a, 0xff, 0xff, 0xc2, 0x35, 0xff, 0xfe, 0x9c, 0x06, 0xff, 0xe8, 0x80, 0x0a, 0x95, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xb8, 0x7c, 0x37, 0x0a, 0xef, 0x86, 0x06, 0xed, 0xff, 0xa4, 0x09, 0xff, 0xff, 0xc8, 0x41, 0xff, 0xff, 0xd4, 0x4e, 0xff, 0xff, 0xdb, 0x51, 0xff, 0xff, 0xe0, 0x53, 0xff, 0xff, 0xe5, 0x55, 0xff, 0xff, 0xea, 0x57, 0xff, 0xff, 0xed, 0x58, 0xff, 0xfa, 0xe7, 0x53, 0xff, 0xa7, 0x7d, 0x1f, 0xff, 0x86, 0x55, 0x0f, 0xff, 0xda, 0xc0, 0x3e, 0xff, 0xff, 0xf5, 0x5e, 0xff, 0xff, 0xf6, 0x60, 0xff, 0xff, 0xf6, 0x60, 0xff, 0xff, 0xf6, 0x61, 0xff, 0xff, 0xf6, 0x61, 0xff, 0xff, 0xf6, 0x61, 0xff, 0xff, 0xf6, 0x60, 0xff, 0xff, 0xf5, 0x5e, 0xff, 0xdb, 0xc0, 0x3e, 0xff, 0x85, 0x54, 0x0f, 0xff, 0xa6, 0x7b, 0x1f, 0xff, 0xfb, 0xe6, 0x53, 0xff, 0xff, 0xec, 0x59, 0xff, 0xff, 0xe9, 0x56, 0xff, 0xff, 0xe5, 0x55, 0xff, 0xff, 0xe0, 0x52, 0xff, 0xff, 0xdb, 0x51, 0xff, 0xff, 0xd4, 0x4e, 0xff, 0xff, 0xcb, 0x47, 0xff, 0xff, 0xa6, 0x0d, 0xff, 0xf1, 0x87, 0x06, 0xf2, 0xc0, 0x7d, 0x33, 0x0e, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xd8, 0x79, 0x13, 0x50, 0xf6, 0x8e, 0x04, 0xff, 0xff, 0xad, 0x17, 0xff, 0xff, 0xc8, 0x3f, 0xff, 0xff, 0xd1, 0x44, 0xff, 0xff, 0xd6, 0x47, 0xff, 0xff, 0xdc, 0x48, 0xff, 0xff, 0xe1, 0x4a, 0xff, 0xff, 0xe6, 0x4c, 0xff, 0xff, 0xe9, 0x4c, 0xff, 0xc4, 0x9f, 0x2b, 0xff, 0x7a, 0x42, 0x04, 0xff, 0x86, 0x4c, 0x05, 0xff, 0x81, 0x4f, 0x0b, 0xff, 0xfb, 0xeb, 0x4d, 0xff, 0xff, 0xf5, 0x54, 0xff, 0xff, 0xf5, 0x53, 0xff, 0xff, 0xf5, 0x54, 0xff, 0xff, 0xf5, 0x53, 0xff, 0xff, 0xf5, 0x54, 0xff, 0xff, 0xf5, 0x54, 0xff, 0xfb, 0xeb, 0x4d, 0xff, 0x82, 0x4f, 0x0b, 0xff, 0x86, 0x4c, 0x05, 0xff, 0x7a, 0x42, 0x04, 0xff, 0xc5, 0x9e, 0x2b, 0xff, 0xff, 0xe7, 0x4c, 0xff, 0xff, 0xe5, 0x4b, 0xff, 0xff, 0xe1, 0x49, 0xff, 0xff, 0xdc, 0x48, 0xff, 0xff, 0xd7, 0x47, 0xff, 0xff, 0xd1, 0x44, 0xff, 0xff, 0xc8, 0x3f, 0xff, 0xff, 0xb0, 0x1f, 0xff, 0xf7, 0x90, 0x05, 0xff, 0xdb, 0x79, 0x11, 0x5a, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xe1, 0x7b, 0x0a, 0x99, 0xf6, 0x94, 0x06, 0xff, 0xfe, 0xb2, 0x21, 0xff, 0xff, 0xc4, 0x35, 0xff, 0xff, 0xcc, 0x3a, 0xff, 0xff, 0xd2, 0x3d, 0xff, 0xff, 0xd8, 0x3f, 0xff, 0xff, 0xdd, 0x40, 0xff, 0xff, 0xe1, 0x41, 0xff, 0xff, 0xe4, 0x42, 0xff, 0x9f, 0x6f, 0x15, 0xff, 0x98, 0x5b, 0x06, 0xff, 0xa1, 0x63, 0x07, 0xff, 0x83, 0x49, 0x04, 0xff, 0xe4, 0xca, 0x38, 0xff, 0xff, 0xef, 0x48, 0xff, 0xff, 0xf0, 0x48, 0xff, 0xff, 0xf1, 0x47, 0xff, 0xff, 0xf1, 0x47, 0xff, 0xff, 0xf0, 0x48, 0xff, 0xff, 0xef, 0x47, 0xff, 0xe4, 0xca, 0x38, 0xff, 0x83, 0x49, 0x04, 0xff, 0xa1, 0x63, 0x07, 0xff, 0x98, 0x5b, 0x06, 0xff, 0x9f, 0x6e, 0x15, 0xff, 0xff, 0xe3, 0x41, 0xff, 0xff, 0xe0, 0x41, 0xff, 0xff, 0xdc, 0x40, 0xff, 0xff, 0xd8, 0x3f, 0xff, 0xff, 0xd3, 0x3d, 0xff, 0xff, 0xcd, 0x3a, 0xff, 0xff, 0xc5, 0x36, 0xff, 0xfe, 0xb5, 0x27, 0xff, 0xf6, 0x95, 0x07, 0xff, 0xe2, 0x7c, 0x0a, 0xa4, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xe1, 0x7d, 0x08, 0xd4, 0xf5, 0x97, 0x07, 0xff, 0xfe, 0xb3, 0x23, 0xff, 0xff, 0xc1, 0x2e, 0xff, 0xff, 0xc8, 0x33, 0xff, 0xff, 0xcf, 0x35, 0xff, 0xff, 0xd4, 0x36, 0xff, 0xff, 0xd9, 0x38, 0xff, 0xff, 0xdd, 0x38, 0xff, 0xff, 0xe2, 0x39, 0xff, 0x9d, 0x6a, 0x10, 0xff, 0x9f, 0x61, 0x06, 0xff, 0xa5, 0x66, 0x07, 0xff, 0x8d, 0x51, 0x04, 0xff, 0xdd, 0xc1, 0x2f, 0xff, 0xff, 0xeb, 0x3e, 0xff, 0xff, 0xeb, 0x3f, 0xff, 0xff, 0xec, 0x3e, 0xff, 0xff, 0xec, 0x3f, 0xff, 0xff, 0xec, 0x3f, 0xff, 0xff, 0xeb, 0x3e, 0xff, 0xdc, 0xc0, 0x2f, 0xff, 0x8d, 0x51, 0x04, 0xff, 0xa5, 0x66, 0x07, 0xff, 0x9f, 0x61, 0x06, 0xff, 0x9e, 0x6b, 0x11, 0xff, 0xff, 0xe1, 0x3a, 0xff, 0xff, 0xdc, 0x39, 0xff, 0xff, 0xd9, 0x38, 0xff, 0xff, 0xd4, 0x36, 0xff, 0xff, 0xcf, 0x35, 0xff, 0xff, 0xc8, 0x33, 0xff, 0xff, 0xc2, 0x2e, 0xff, 0xfe, 0xb5, 0x27, 0xff, 0xf5, 0x99, 0x08, 0xff, 0xe2, 0x7d, 0x08, 0xde, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0xb2, 0x7e, 0x40, 0x08, 0xe2, 0x7d, 0x06, 0xf6, 0xf3, 0x99, 0x09, 0xff, 0xfc, 0xb1, 0x1e, 0xff, 0xff, 0xbd, 0x28, 0xff, 0xff, 0xc4, 0x2d, 0xff, 0xff, 0xcb, 0x2e, 0xff, 0xff, 0xd0, 0x30, 0xff, 0xff, 0xd5, 0x31, 0xff, 0xff, 0xd9, 0x32, 0xff, 0xff, 0xdd, 0x33, 0xff, 0xb3, 0x88, 0x1a, 0xff, 0x9d, 0x5f, 0x06, 0xff, 0xa4, 0x65, 0x07, 0xff, 0x8d, 0x52, 0x06, 0xff, 0xf1, 0xda, 0x34, 0xff, 0xff, 0xe7, 0x36, 0xff, 0xff, 0xe7, 0x37, 0xff, 0xff, 0xe7, 0x37, 0xff, 0xff, 0xe7, 0x37, 0xff, 0xff, 0xe7, 0x37, 0xff, 0xff, 0xe7, 0x36, 0xff, 0xf1, 0xd9, 0x34, 0xff, 0x8d, 0x52, 0x06, 0xff, 0xa4, 0x65, 0x07, 0xff, 0x9d, 0x5f, 0x06, 0xff, 0xb4, 0x88, 0x1a, 0xff, 0xff, 0xdc, 0x33, 0xff, 0xff, 0xd9, 0x32, 0xff, 0xff, 0xd4, 0x31, 0xff, 0xff, 0xd0, 0x30, 0xff, 0xff, 0xcb, 0x2e, 0xff, 0xff, 0xc5, 0x2c, 0xff, 0xff, 0xbe, 0x29, 0xff, 0xfd, 0xb3, 0x20, 0xff, 0xf4, 0x9b, 0x0a, 0xff, 0xe3, 0x7e, 0x05, 0xfb, 0xb8, 0x7c, 0x38, 0x0f, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0xbb, 0x77, 0x2d, 0x1d, 0xe1, 0x7c, 0x02, 0xff, 0xf2, 0x99, 0x09, 0xff, 0xfb, 0xaf, 0x18, 0xff, 0xfe, 0xba, 0x24, 0xff, 0xff, 0xc1, 0x28, 0xff, 0xff, 0xc7, 0x2a, 0xff, 0xff, 0xcc, 0x2b, 0xff, 0xff, 0xd0, 0x2c, 0xff, 0xff, 0xd4, 0x2d, 0xff, 0xff, 0xd8, 0x2f, 0xff, 0xe9, 0xca, 0x2f, 0xff, 0x92, 0x58, 0x07, 0xff, 0x97, 0x59, 0x05, 0xff, 0xb3, 0x8b, 0x1c, 0xff, 0xff, 0xe4, 0x34, 0xff, 0xff, 0xe2, 0x31, 0xff, 0xff, 0xe3, 0x31, 0xff, 0xff, 0xe3, 0x32, 0xff, 0xff, 0xe3, 0x32, 0xff, 0xff, 0xe3, 0x31, 0xff, 0xff, 0xe2, 0x31, 0xff, 0xff, 0xe4, 0x34, 0xff, 0xb3, 0x8a, 0x1b, 0xff, 0x97, 0x59, 0x05, 0xff, 0x92, 0x58, 0x08, 0xff, 0xe9, 0xcb, 0x2f, 0xff, 0xff, 0xd8, 0x2e, 0xff, 0xff, 0xd4, 0x2d, 0xff, 0xff, 0xd1, 0x2c, 0xff, 0xff, 0xcc, 0x2b, 0xff, 0xff, 0xc7, 0x2a, 0xff, 0xff, 0xc2, 0x29, 0xff, 0xff, 0xbb, 0x25, 0xff, 0xfb, 0xb0, 0x19, 0xff, 0xf2, 0x9b, 0x0a, 0xff, 0xe2, 0x7e, 0x02, 0xff, 0xbf, 0x76, 0x27, 0x25, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0xc1, 0x73, 0x22, 0x28, 0xdf, 0x7b, 0x02, 0xff, 0xf0, 0x98, 0x08, 0xff, 0xf9, 0xac, 0x13, 0xff, 0xfe, 0xb7, 0x21, 0xff, 0xff, 0xbf, 0x28, 0xff, 0xff, 0xc4, 0x29, 0xff, 0xff, 0xc9, 0x2a, 0xff, 0xff, 0xcd, 0x2b, 0xff, 0xff, 0xd1, 0x2c, 0xff, 0xff, 0xd5, 0x2d, 0xff, 0xff, 0xd9, 0x2e, 0xff, 0xec, 0xd3, 0x35, 0xff, 0xd8, 0xbd, 0x30, 0xff, 0xfd, 0xe3, 0x34, 0xff, 0xff, 0xde, 0x2e, 0xff, 0xff, 0xdf, 0x30, 0xff, 0xff, 0xe0, 0x31, 0xff, 0xff, 0xe0, 0x31, 0xff, 0xff, 0xe0, 0x31, 0xff, 0xff, 0xe0, 0x31, 0xff, 0xff, 0xdf, 0x30, 0xff, 0xff, 0xde, 0x2f, 0xff, 0xfc, 0xe2, 0x34, 0xff, 0xd8, 0xbe, 0x30, 0xff, 0xed, 0xd5, 0x35, 0xff, 0xff, 0xd9, 0x2e, 0xff, 0xff, 0xd5, 0x2d, 0xff, 0xff, 0xd1, 0x2b, 0xff, 0xff, 0xcd, 0x2b, 0xff, 0xff, 0xca, 0x2a, 0xff, 0xff, 0xc4, 0x2a, 0xff, 0xff, 0xbf, 0x28, 0xff, 0xfe, 0xb8, 0x23, 0xff, 0xfa, 0xad, 0x15, 0xff, 0xf0, 0x9a, 0x09, 0xff, 0xe1, 0x7d, 0x02, 0xff, 0xc4, 0x70, 0x1a, 0x33, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0xc0, 0x72, 0x22, 0x29, 0xdd, 0x7a, 0x02, 0xff, 0xed, 0x96, 0x07, 0xff, 0xf8, 0xaa, 0x11, 0xff, 0xfd, 0xb6, 0x20, 0xff, 0xff, 0xbe, 0x29, 0xff, 0xff, 0xc3, 0x2b, 0xff, 0xff, 0xc8, 0x2c, 0xff, 0xff, 0xcb, 0x2c, 0xff, 0xff, 0xcf, 0x2d, 0xff, 0xff, 0xd2, 0x2e, 0xff, 0xff, 0xd5, 0x2f, 0xff, 0xff, 0xd6, 0x2f, 0xff, 0xff, 0xd9, 0x2f, 0xff, 0xff, 0xda, 0x30, 0xff, 0xff, 0xdb, 0x30, 0xff, 0xff, 0xdc, 0x30, 0xff, 0xff, 0xdd, 0x30, 0xff, 0xff, 0xdd, 0x30, 0xff, 0xff, 0xdd, 0x30, 0xff, 0xff, 0xdd, 0x30, 0xff, 0xff, 0xdc, 0x30, 0xff, 0xff, 0xdb, 0x30, 0xff, 0xff, 0xda, 0x30, 0xff, 0xff, 0xd9, 0x2f, 0xff, 0xff, 0xd7, 0x2e, 0xff, 0xff, 0xd5, 0x2f, 0xff, 0xff, 0xd2, 0x2e, 0xff, 0xff, 0xcf, 0x2d, 0xff, 0xff, 0xcb, 0x2d, 0xff, 0xff, 0xc8, 0x2c, 0xff, 0xff, 0xc4, 0x2b, 0xff, 0xff, 0xbe, 0x29, 0xff, 0xfe, 0xb6, 0x21, 0xff, 0xf9, 0xab, 0x12, 0xff, 0xee, 0x97, 0x08, 0xff, 0xde, 0x7c, 0x02, 0xff, 0xc3, 0x6f, 0x1a, 0x33, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0xb3, 0x72, 0x2d, 0x1d, 0xd9, 0x77, 0x02, 0xff, 0xea, 0x92, 0x07, 0xff, 0xf6, 0xa6, 0x0e, 0xff, 0xfc, 0xb4, 0x1d, 0xff, 0xff, 0xbb, 0x29, 0xff, 0xff, 0xc1, 0x2d, 0xff, 0xff, 0xc5, 0x2e, 0xff, 0xff, 0xc9, 0x2e, 0xff, 0xff, 0xcd, 0x30, 0xff, 0xff, 0xcf, 0x2f, 0xff, 0xff, 0xd2, 0x30, 0xff, 0xff, 0xd4, 0x31, 0xff, 0xff, 0xd6, 0x30, 0xff, 0xff, 0xd7, 0x31, 0xff, 0xff, 0xd9, 0x31, 0xff, 0xff, 0xda, 0x31, 0xff, 0xff, 0xda, 0x31, 0xff, 0xff, 0xdb, 0x31, 0xff, 0xff, 0xdb, 0x31, 0xff, 0xff, 0xda, 0x32, 0xff, 0xff, 0xda, 0x32, 0xff, 0xff, 0xd9, 0x31, 0xff, 0xff, 0xd7, 0x31, 0xff, 0xff, 0xd6, 0x31, 0xff, 0xff, 0xd4, 0x30, 0xff, 0xff, 0xd2, 0x30, 0xff, 0xff, 0xcf, 0x2f, 0xff, 0xff, 0xcd, 0x2f, 0xff, 0xff, 0xca, 0x2e, 0xff, 0xff, 0xc5, 0x2e, 0xff, 0xff, 0xc1, 0x2d, 0xff, 0xff, 0xbc, 0x2a, 0xff, 0xfc, 0xb4, 0x1e, 0xff, 0xf7, 0xa7, 0x0e, 0xff, 0xeb, 0x94, 0x08, 0xff, 0xdb, 0x78, 0x02, 0xff, 0xbb, 0x73, 0x27, 0x25, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0xb2, 0x7d, 0x3f, 0x09, 0xd4, 0x73, 0x05, 0xf6, 0xe6, 0x8d, 0x07, 0xff, 0xf3, 0xa2, 0x0c, 0xff, 0xfb, 0xb0, 0x17, 0xff, 0xfe, 0xb9, 0x26, 0xff, 0xff, 0xbe, 0x2f, 0xff, 0xff, 0xc3, 0x2f, 0xff, 0xff, 0xc7, 0x31, 0xff, 0xff, 0xcb, 0x30, 0xff, 0xff, 0xcd, 0x31, 0xff, 0xff, 0xcf, 0x32, 0xff, 0xff, 0xd1, 0x32, 0xff, 0xff, 0xd3, 0x31, 0xff, 0xff, 0xd5, 0x32, 0xff, 0xff, 0xd6, 0x33, 0xff, 0xff, 0xd7, 0x34, 0xff, 0xff, 0xd8, 0x33, 0xff, 0xff, 0xd8, 0x33, 0xff, 0xff, 0xd8, 0x33, 0xff, 0xff, 0xd8, 0x33, 0xff, 0xff, 0xd7, 0x34, 0xff, 0xff, 0xd6, 0x33, 0xff, 0xff, 0xd5, 0x31, 0xff, 0xff, 0xd3, 0x32, 0xff, 0xff, 0xd2, 0x32, 0xff, 0xff, 0xd0, 0x32, 0xff, 0xff, 0xcd, 0x32, 0xff, 0xff, 0xcb, 0x31, 0xff, 0xff, 0xc7, 0x30, 0xff, 0xff, 0xc3, 0x30, 0xff, 0xff, 0xbf, 0x2f, 0xff, 0xfe, 0xb9, 0x26, 0xff, 0xfb, 0xb1, 0x18, 0xff, 0xf4, 0xa4, 0x0d, 0xff, 0xe7, 0x8f, 0x08, 0xff, 0xd5, 0x74, 0x04, 0xfb, 0xb5, 0x79, 0x36, 0x10, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xce, 0x70, 0x08, 0xd5, 0xe1, 0x88, 0x06, 0xff, 0xef, 0x9d, 0x0c, 0xff, 0xf9, 0xac, 0x12, 0xff, 0xfd, 0xb4, 0x1f, 0xff, 0xff, 0xbc, 0x2c, 0xff, 0xff, 0xc1, 0x31, 0xff, 0xff, 0xc4, 0x32, 0xff, 0xff, 0xc8, 0x32, 0xff, 0xff, 0xcb, 0x33, 0xff, 0xff, 0xcd, 0x34, 0xff, 0xff, 0xcf, 0x33, 0xff, 0xff, 0xd1, 0x34, 0xff, 0xff, 0xd2, 0x34, 0xff, 0xff, 0xd3, 0x33, 0xff, 0xff, 0xd4, 0x34, 0xff, 0xff, 0xd5, 0x34, 0xff, 0xff, 0xd5, 0x34, 0xff, 0xff, 0xd5, 0x34, 0xff, 0xff, 0xd5, 0x34, 0xff, 0xff, 0xd4, 0x34, 0xff, 0xff, 0xd3, 0x33, 0xff, 0xff, 0xd2, 0x34, 0xff, 0xff, 0xd1, 0x34, 0xff, 0xff, 0xcf, 0x34, 0xff, 0xff, 0xcd, 0x34, 0xff, 0xff, 0xcb, 0x33, 0xff, 0xff, 0xc8, 0x33, 0xff, 0xff, 0xc5, 0x33, 0xff, 0xff, 0xc1, 0x31, 0xff, 0xff, 0xbc, 0x2c, 0xff, 0xfd, 0xb5, 0x1f, 0xff, 0xfa, 0xad, 0x12, 0xff, 0xf0, 0x9f, 0x0d, 0xff, 0xe2, 0x89, 0x07, 0xff, 0xcf, 0x71, 0x08, 0xdf, 0xb3, 0x7d, 0x3d, 0x01, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xca, 0x6c, 0x0a, 0x9b, 0xdb, 0x80, 0x06, 0xff, 0xea, 0x97, 0x0b, 0xff, 0xf5, 0xa7, 0x10, 0xff, 0xfc, 0xb1, 0x18, 0xff, 0xfe, 0xb7, 0x24, 0xff, 0xff, 0xbd, 0x2f, 0xff, 0xff, 0xc1, 0x33, 0xff, 0xff, 0xc4, 0x34, 0xff, 0xff, 0xc8, 0x35, 0xff, 0xff, 0xca, 0x35, 0xff, 0xff, 0xcd, 0x35, 0xff, 0xff, 0xce, 0x35, 0xff, 0xff, 0xcf, 0x35, 0xff, 0xff, 0xd0, 0x35, 0xff, 0xff, 0xd1, 0x36, 0xff, 0xff, 0xd1, 0x36, 0xff, 0xff, 0xd2, 0x36, 0xff, 0xff, 0xd2, 0x36, 0xff, 0xff, 0xd2, 0x36, 0xff, 0xff, 0xd1, 0x36, 0xff, 0xff, 0xd0, 0x36, 0xff, 0xff, 0xcf, 0x35, 0xff, 0xff, 0xce, 0x35, 0xff, 0xff, 0xcd, 0x35, 0xff, 0xff, 0xcb, 0x35, 0xff, 0xff, 0xc8, 0x34, 0xff, 0xff, 0xc5, 0x35, 0xff, 0xff, 0xc1, 0x33, 0xff, 0xff, 0xbd, 0x2f, 0xff, 0xfe, 0xb8, 0x25, 0xff, 0xfc, 0xb1, 0x18, 0xff, 0xf6, 0xa7, 0x10, 0xff, 0xeb, 0x98, 0x0c, 0xff, 0xdc, 0x81, 0x06, 0xff, 0xcb, 0x6d, 0x09, 0xa5, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xc3, 0x6b, 0x11, 0x52, 0xd4, 0x77, 0x04, 0xff, 0xe4, 0x8f, 0x0a, 0xff, 0xf0, 0xa1, 0x0f, 0xff, 0xf9, 0xac, 0x13, 0xff, 0xfd, 0xb4, 0x1c, 0xff, 0xfe, 0xb9, 0x28, 0xff, 0xff, 0xbe, 0x31, 0xff, 0xff, 0xc1, 0x35, 0xff, 0xff, 0xc4, 0x36, 0xff, 0xff, 0xc7, 0x36, 0xff, 0xff, 0xc9, 0x37, 0xff, 0xff, 0xcb, 0x36, 0xff, 0xff, 0xcd, 0x37, 0xff, 0xff, 0xce, 0x37, 0xff, 0xff, 0xce, 0x37, 0xff, 0xff, 0xcf, 0x37, 0xff, 0xff, 0xcf, 0x37, 0xff, 0xff, 0xcf, 0x37, 0xff, 0xff, 0xcf, 0x37, 0xff, 0xff, 0xce, 0x37, 0xff, 0xff, 0xce, 0x37, 0xff, 0xff, 0xcd, 0x37, 0xff, 0xff, 0xcb, 0x37, 0xff, 0xff, 0xc9, 0x37, 0xff, 0xff, 0xc7, 0x36, 0xff, 0xff, 0xc5, 0x36, 0xff, 0xff, 0xc1, 0x35, 0xff, 0xff, 0xbe, 0x31, 0xff, 0xfe, 0xb9, 0x28, 0xff, 0xfd, 0xb4, 0x1d, 0xff, 0xfa, 0xac, 0x13, 0xff, 0xf1, 0xa2, 0x0f, 0xff, 0xe5, 0x90, 0x0a, 0xff, 0xd5, 0x78, 0x04, 0xff, 0xc4, 0x6a, 0x10, 0x5d, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xb4, 0x78, 0x36, 0x0b, 0xcd, 0x6f, 0x05, 0xee, 0xdc, 0x85, 0x07, 0xff, 0xea, 0x99, 0x0e, 0xff, 0xf4, 0xa6, 0x12, 0xff, 0xfb, 0xae, 0x15, 0xff, 0xfe, 0xb5, 0x1f, 0xff, 0xff, 0xba, 0x29, 0xff, 0xff, 0xbd, 0x31, 0xff, 0xff, 0xc1, 0x37, 0xff, 0xff, 0xc3, 0x37, 0xff, 0xff, 0xc5, 0x38, 0xff, 0xff, 0xc8, 0x38, 0xff, 0xff, 0xc9, 0x38, 0xff, 0xff, 0xca, 0x38, 0xff, 0xff, 0xcb, 0x38, 0xff, 0xff, 0xcb, 0x38, 0xff, 0xff, 0xcc, 0x38, 0xff, 0xff, 0xcc, 0x38, 0xff, 0xff, 0xcb, 0x38, 0xff, 0xff, 0xcb, 0x38, 0xff, 0xff, 0xca, 0x38, 0xff, 0xff, 0xc9, 0x38, 0xff, 0xff, 0xc7, 0x38, 0xff, 0xff, 0xc5, 0x38, 0xff, 0xff, 0xc3, 0x37, 0xff, 0xff, 0xc1, 0x37, 0xff, 0xff, 0xbe, 0x32, 0xff, 0xff, 0xba, 0x2a, 0xff, 0xfe, 0xb5, 0x1f, 0xff, 0xfc, 0xaf, 0x16, 0xff, 0xf5, 0xa7, 0x12, 0xff, 0xea, 0x9a, 0x0e, 0xff, 0xdd, 0x86, 0x08, 0xff, 0xce, 0x6f, 0x05, 0xf3, 0xb5, 0x75, 0x2f, 0x10, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xc8, 0x6a, 0x0b, 0x8e, 0xd4, 0x79, 0x05, 0xff, 0xe1, 0x8e, 0x0b, 0xff, 0xee, 0x9f, 0x10, 0xff, 0xf7, 0xa9, 0x14, 0xff, 0xfc, 0xb0, 0x17, 0xff, 0xfe, 0xb5, 0x1f, 0xff, 0xff, 0xb9, 0x29, 0xff, 0xff, 0xbc, 0x31, 0xff, 0xff, 0xbf, 0x37, 0xff, 0xff, 0xc1, 0x38, 0xff, 0xff, 0xc3, 0x38, 0xff, 0xff, 0xc5, 0x39, 0xff, 0xff, 0xc6, 0x39, 0xff, 0xff, 0xc7, 0x39, 0xff, 0xff, 0xc8, 0x39, 0xff, 0xff, 0xc8, 0x39, 0xff, 0xff, 0xc8, 0x3a, 0xff, 0xff, 0xc7, 0x3a, 0xff, 0xff, 0xc7, 0x39, 0xff, 0xff, 0xc6, 0x39, 0xff, 0xff, 0xc5, 0x38, 0xff, 0xff, 0xc3, 0x38, 0xff, 0xff, 0xc1, 0x38, 0xff, 0xff, 0xbf, 0x37, 0xff, 0xff, 0xbc, 0x31, 0xff, 0xff, 0xb9, 0x2a, 0xff, 0xfe, 0xb5, 0x1f, 0xff, 0xfd, 0xb0, 0x17, 0xff, 0xf7, 0xa9, 0x14, 0xff, 0xee, 0x9f, 0x11, 0xff, 0xe3, 0x90, 0x0c, 0xff, 0xd5, 0x7b, 0x06, 0xff, 0xc8, 0x6b, 0x0a, 0x98, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xba, 0x6f, 0x20, 0x1c, 0xcd, 0x6e, 0x04, 0xf5, 0xd8, 0x82, 0x08, 0xff, 0xe5, 0x94, 0x0d, 0xff, 0xf0, 0xa2, 0x12, 0xff, 0xf7, 0xaa, 0x15, 0xff, 0xfc, 0xaf, 0x17, 0xff, 0xff, 0xb4, 0x1d, 0xff, 0xff, 0xb8, 0x27, 0xff, 0xff, 0xbb, 0x2e, 0xff, 0xff, 0xbe, 0x34, 0xff, 0xff, 0xc0, 0x38, 0xff, 0xff, 0xc1, 0x3a, 0xff, 0xff, 0xc3, 0x39, 0xff, 0xff, 0xc3, 0x39, 0xff, 0xff, 0xc4, 0x39, 0xff, 0xff, 0xc4, 0x39, 0xff, 0xff, 0xc4, 0x39, 0xff, 0xff, 0xc4, 0x39, 0xff, 0xff, 0xc3, 0x39, 0xff, 0xff, 0xc3, 0x39, 0xff, 0xff, 0xc1, 0x3a, 0xff, 0xff, 0xc0, 0x39, 0xff, 0xff, 0xbe, 0x34, 0xff, 0xff, 0xbb, 0x2e, 0xff, 0xff, 0xb8, 0x27, 0xff, 0xff, 0xb4, 0x1d, 0xff, 0xfd, 0xaf, 0x17, 0xff, 0xf8, 0xaa, 0x15, 0xff, 0xf1, 0xa2, 0x13, 0xff, 0xe6, 0x96, 0x0e, 0xff, 0xd9, 0x83, 0x08, 0xff, 0xce, 0x6f, 0x04, 0xf8, 0xbe, 0x6e, 0x1d, 0x23, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xc6, 0x69, 0x0c, 0x80, 0xd1, 0x75, 0x04, 0xff, 0xdb, 0x88, 0x0a, 0xff, 0xe7, 0x98, 0x10, 0xff, 0xf0, 0xa2, 0x13, 0xff, 0xf7, 0xa9, 0x16, 0xff, 0xfc, 0xae, 0x17, 0xff, 0xff, 0xb2, 0x1a, 0xff, 0xff, 0xb5, 0x21, 0xff, 0xff, 0xb8, 0x29, 0xff, 0xff, 0xba, 0x2d, 0xff, 0xff, 0xbc, 0x32, 0xff, 0xff, 0xbe, 0x36, 0xff, 0xff, 0xbf, 0x38, 0xff, 0xff, 0xbf, 0x3a, 0xff, 0xff, 0xc0, 0x3a, 0xff, 0xff, 0xc0, 0x3a, 0xff, 0xff, 0xbf, 0x39, 0xff, 0xff, 0xbf, 0x39, 0xff, 0xff, 0xbe, 0x36, 0xff, 0xff, 0xbc, 0x32, 0xff, 0xff, 0xba, 0x2d, 0xff, 0xff, 0xb9, 0x28, 0xff, 0xff, 0xb6, 0x22, 0xff, 0xff, 0xb2, 0x1b, 0xff, 0xfc, 0xae, 0x17, 0xff, 0xf8, 0xa9, 0x16, 0xff, 0xf1, 0xa3, 0x14, 0xff, 0xe8, 0x99, 0x10, 0xff, 0xdc, 0x89, 0x0b, 0xff, 0xd2, 0x76, 0x05, 0xff, 0xc8, 0x6a, 0x0b, 0x8a, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xcf, 0x83, 0x1c, 0x08, 0xc9, 0x6b, 0x06, 0xd0, 0xd4, 0x7a, 0x06, 0xff, 0xdd, 0x8b, 0x0b, 0xff, 0xe8, 0x99, 0x10, 0xff, 0xf1, 0xa2, 0x14, 0xff, 0xf7, 0xa8, 0x16, 0xff, 0xfb, 0xac, 0x17, 0xff, 0xfe, 0xb0, 0x19, 0xff, 0xff, 0xb2, 0x1d, 0xff, 0xff, 0xb5, 0x21, 0xff, 0xff, 0xb7, 0x26, 0xff, 0xff, 0xb8, 0x29, 0xff, 0xff, 0xb9, 0x2b, 0xff, 0xff, 0xba, 0x2d, 0xff, 0xff, 0xba, 0x2e, 0xff, 0xff, 0xba, 0x2e, 0xff, 0xff, 0xba, 0x2c, 0xff, 0xff, 0xb9, 0x2b, 0xff, 0xff, 0xb8, 0x2a, 0xff, 0xff, 0xb7, 0x26, 0xff, 0xff, 0xb5, 0x21, 0xff, 0xff, 0xb3, 0x1d, 0xff, 0xfe, 0xb0, 0x19, 0xff, 0xfb, 0xac, 0x17, 0xff, 0xf7, 0xa8, 0x16, 0xff, 0xf1, 0xa2, 0x14, 0xff, 0xe9, 0x9a, 0x11, 0xff, 0xde, 0x8c, 0x0c, 0xff, 0xd5, 0x7c, 0x06, 0xff, 0xcb, 0x6b, 0x06, 0xd7, 0xc7, 0x7b, 0x1e, 0x0b, 0xff, 0xa0, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xff, 0xa0, 0x00, 0x01, 0xc6, 0x6f, 0x12, 0x27, 0xcc, 0x6d, 0x04, 0xee, 0xd5, 0x7d, 0x07, 0xff, 0xde, 0x8c, 0x0c, 0xff, 0xe7, 0x97, 0x11, 0xff, 0xef, 0xa0, 0x14, 0xff, 0xf5, 0xa6, 0x15, 0xff, 0xf9, 0xa9, 0x16, 0xff, 0xfc, 0xac, 0x17, 0xff, 0xfe, 0xaf, 0x18, 0xff, 0xff, 0xb0, 0x1a, 0xff, 0xff, 0xb2, 0x1e, 0xff, 0xff, 0xb4, 0x21, 0xff, 0xff, 0xb5, 0x22, 0xff, 0xff, 0xb4, 0x22, 0xff, 0xff, 0xb4, 0x22, 0xff, 0xff, 0xb4, 0x22, 0xff, 0xff, 0xb4, 0x21, 0xff, 0xff, 0xb2, 0x1e, 0xff, 0xff, 0xb1, 0x1a, 0xff, 0xfe, 0xaf, 0x17, 0xff, 0xfc, 0xad, 0x17, 0xff, 0xf9, 0xaa, 0x16, 0xff, 0xf5, 0xa6, 0x15, 0xff, 0xf0, 0xa1, 0x14, 0xff, 0xe8, 0x99, 0x11, 0xff, 0xdf, 0x8d, 0x0d, 0xff, 0xd6, 0x7e, 0x07, 0xff, 0xcd, 0x6d, 0x05, 0xf2, 0xc6, 0x6e, 0x11, 0x2e, 0xff, 0xa0, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xff, 0xa0, 0x00, 0x01, 0xff, 0xa0, 0x00, 0x02, 0xc4, 0x6c, 0x0f, 0x3f, 0xcc, 0x6e, 0x05, 0xf5, 0xd6, 0x7d, 0x07, 0xff, 0xde, 0x8a, 0x0b, 0xff, 0xe6, 0x95, 0x10, 0xff, 0xed, 0x9d, 0x12, 0xff, 0xf2, 0xa3, 0x14, 0xff, 0xf7, 0xa6, 0x16, 0xff, 0xfa, 0xa9, 0x16, 0xff, 0xfb, 0xab, 0x17, 0xff, 0xfd, 0xac, 0x16, 0xff, 0xfe, 0xad, 0x17, 0xff, 0xfe, 0xad, 0x18, 0xff, 0xfe, 0xae, 0x18, 0xff, 0xfe, 0xae, 0x19, 0xff, 0xfe, 0xad, 0x18, 0xff, 0xfe, 0xad, 0x17, 0xff, 0xfd, 0xac, 0x16, 0xff, 0xfc, 0xab, 0x17, 0xff, 0xfa, 0xa9, 0x16, 0xff, 0xf7, 0xa7, 0x15, 0xff, 0xf3, 0xa3, 0x14, 0xff, 0xed, 0x9e, 0x13, 0xff, 0xe6, 0x96, 0x10, 0xff, 0xdf, 0x8b, 0x0c, 0xff, 0xd7, 0x7e, 0x07, 0xff, 0xce, 0x6f, 0x04, 0xf8, 0xc6, 0x6b, 0x0d, 0x47, 0xff, 0xa0, 0x00, 0x02, 0xff, 0xa0, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xff, 0xa0, 0x00, 0x01, 0xff, 0xa0, 0x00, 0x02, 0xc4, 0x6b, 0x0f, 0x40, 0xcc, 0x6d, 0x04, 0xee, 0xd5, 0x7b, 0x06, 0xff, 0xdd, 0x87, 0x0a, 0xff, 0xe3, 0x91, 0x0e, 0xff, 0xe9, 0x99, 0x11, 0xff, 0xee, 0x9e, 0x12, 0xff, 0xf3, 0xa2, 0x14, 0xff, 0xf6, 0xa4, 0x15, 0xff, 0xf8, 0xa6, 0x16, 0xff, 0xf9, 0xa8, 0x16, 0xff, 0xfa, 0xa8, 0x16, 0xff, 0xfa, 0xa9, 0x16, 0xff, 0xfa, 0xa9, 0x16, 0xff, 0xfa, 0xa8, 0x16, 0xff, 0xf9, 0xa8, 0x16, 0xff, 0xf8, 0xa7, 0x16, 0xff, 0xf6, 0xa5, 0x15, 0xff, 0xf3, 0xa2, 0x14, 0xff, 0xef, 0x9e, 0x13, 0xff, 0xea, 0x99, 0x11, 0xff, 0xe4, 0x91, 0x0e, 0xff, 0xdd, 0x88, 0x0a, 0xff, 0xd6, 0x7c, 0x06, 0xff, 0xcc, 0x6d, 0x05, 0xf1, 0xc6, 0x6c, 0x0c, 0x47, 0xff, 0xa0, 0x00, 0x03, 0xff, 0xa0, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xff, 0xa0, 0x00, 0x01, 0xff, 0xa0, 0x00, 0x03, 0xc5, 0x6f, 0x11, 0x28, 0xc7, 0x6a, 0x06, 0xd1, 0xd3, 0x75, 0x04, 0xff, 0xda, 0x81, 0x08, 0xff, 0xe0, 0x8b, 0x0b, 0xff, 0xe5, 0x92, 0x0e, 0xff, 0xe9, 0x98, 0x10, 0xff, 0xed, 0x9c, 0x12, 0xff, 0xf0, 0x9e, 0x13, 0xff, 0xf2, 0xa0, 0x13, 0xff, 0xf3, 0xa1, 0x14, 0xff, 0xf3, 0xa2, 0x14, 0xff, 0xf3, 0xa2, 0x14, 0xff, 0xf3, 0xa2, 0x14, 0xff, 0xf2, 0xa0, 0x14, 0xff, 0xf0, 0x9f, 0x13, 0xff, 0xed, 0x9c, 0x12, 0xff, 0xe9, 0x98, 0x10, 0xff, 0xe5, 0x93, 0x0e, 0xff, 0xe0, 0x8c, 0x0c, 0xff, 0xdb, 0x82, 0x08, 0xff, 0xd3, 0x76, 0x04, 0xff, 0xc8, 0x6b, 0x06, 0xd6, 0xc5, 0x6e, 0x10, 0x2e, 0xff, 0xa0, 0x00, 0x03, 0xff, 0xa0, 0x00, 0x01, 0xff, 0xa0, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xff, 0xa0, 0x00, 0x01, 0xff, 0xa0, 0x00, 0x03, 0xda, 0x88, 0x14, 0x0b, 0xc3, 0x68, 0x09, 0x82, 0xca, 0x6c, 0x04, 0xf5, 0xd5, 0x78, 0x05, 0xff, 0xda, 0x82, 0x08, 0xff, 0xdf, 0x89, 0x0a, 0xff, 0xe3, 0x8e, 0x0c, 0xff, 0xe6, 0x92, 0x0d, 0xff, 0xe8, 0x95, 0x0e, 0xff, 0xe9, 0x97, 0x0f, 0xff, 0xea, 0x98, 0x0f, 0xff, 0xea, 0x98, 0x0f, 0xff, 0xe9, 0x97, 0x10, 0xff, 0xe8, 0x95, 0x0f, 0xff, 0xe6, 0x93, 0x0d, 0xff, 0xe3, 0x8f, 0x0c, 0xff, 0xe0, 0x89, 0x0b, 0xff, 0xdb, 0x82, 0x08, 0xff, 0xd5, 0x79, 0x05, 0xff, 0xcb, 0x6d, 0x05, 0xf7, 0xc4, 0x69, 0x0a, 0x88, 0xd8, 0x86, 0x12, 0x0d, 0xff, 0xa0, 0x00, 0x03, 0xff, 0xa0, 0x00, 0x01, 0xff, 0xa0, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xff, 0xa0, 0x00, 0x01, 0xff, 0xa0, 0x00, 0x02, 0xff, 0xa0, 0x00, 0x03, 0xc8, 0x75, 0x12, 0x20, 0xc3, 0x67, 0x08, 0x91, 0xc7, 0x6b, 0x05, 0xf0, 0xd0, 0x73, 0x04, 0xff, 0xd6, 0x7b, 0x06, 0xff, 0xda, 0x80, 0x08, 0xff, 0xdd, 0x84, 0x09, 0xff, 0xde, 0x87, 0x09, 0xff, 0xdf, 0x88, 0x0a, 0xff, 0xdf, 0x88, 0x0a, 0xff, 0xde, 0x87, 0x09, 0xff, 0xdd, 0x84, 0x09, 0xff, 0xda, 0x80, 0x08, 0xff, 0xd7, 0x7c, 0x06, 0xff, 0xd1, 0x74, 0x04, 0xff, 0xc8, 0x6b, 0x05, 0xf2, 0xc3, 0x68, 0x08, 0x96, 0xc5, 0x72, 0x13, 0x23, 0xff, 0xa1, 0x01, 0x04, 0xff, 0xa0, 0x00, 0x02, 0xff, 0xa0, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xff, 0xa0, 0x00, 0x01, 0xff, 0xa0, 0x00, 0x02, 0xff, 0xa0, 0x00, 0x02, 0xff, 0xa0, 0x00, 0x03, 0xd8, 0x87, 0x14, 0x0f, 0xbd, 0x68, 0x0d, 0x57, 0xc1, 0x67, 0x08, 0x9f, 0xc5, 0x6a, 0x06, 0xd9, 0xc6, 0x6b, 0x05, 0xf8, 0xc9, 0x6c, 0x04, 0xff, 0xcb, 0x6e, 0x03, 0xff, 0xcb, 0x6e, 0x03, 0xff, 0xc9, 0x6c, 0x03, 0xff, 0xc7, 0x6b, 0x05, 0xf9, 0xc5, 0x6a, 0x06, 0xdb, 0xc1, 0x67, 0x07, 0xa2, 0xbe, 0x67, 0x0c, 0x5a, 0xd6, 0x85, 0x13, 0x10, 0xff, 0xa0, 0x00, 0x03, 0xff, 0xa0, 0x00, 0x03, 0xff, 0xa0, 0x00, 0x01, 0xff, 0xa0, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xff, 0xa0, 0x00, 0x01, 0xff, 0xa0, 0x00, 0x01, 0xff, 0xa0, 0x00, 0x02, 0xff, 0xa0, 0x00, 0x03, 0xff, 0xa0, 0x00, 0x03, 0xfe, 0xa0, 0x02, 0x03, 0xe1, 0x90, 0x12, 0x0f, 0xc6, 0x7a, 0x18, 0x23, 0xbf, 0x70, 0x15, 0x30, 0xbf, 0x70, 0x16, 0x31, 0xc5, 0x79, 0x19, 0x24, 0xe0, 0x90, 0x12, 0x10, 0xfe, 0xa0, 0x02, 0x03, 0xff, 0xa0, 0x00, 0x04, 0xff, 0xa0, 0x00, 0x03, 0xff, 0xa0, 0x00, 0x02, 0xff, 0xa0, 0x00, 0x01, 0xff, 0xa0, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0xff, 0x00, 0x00, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xff, 0xa0, 0x00, 0x01, 0xff, 0xa0, 0x00, 0x01, 0xff, 0xa0, 0x00, 0x02, 0xff, 0xa0, 0x00, 0x02, 0xff, 0xa0, 0x00, 0x03, 0xff, 0xa0, 0x00, 0x03, 0xff, 0xa0, 0x00, 0x03, 0xff, 0xa0, 0x00, 0x03, 0xff, 0xa0, 0x00, 0x02, 0xff, 0xa0, 0x00, 0x02, 0xff, 0xa0, 0x00, 0x01, 0xff, 0xa0, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
};
|
the_stack_data/447560.c | unsigned char cyrillic_txt[] = {
0x04, 0x10, 0x04, 0x11, 0x04, 0x12, 0x04, 0x13, 0x04, 0x14, 0x04, 0x15,
0x04, 0x01, 0x04, 0x16, 0x04, 0x17, 0x04, 0x18, 0x04, 0x19, 0x04, 0x1a,
0x04, 0x1b, 0x04, 0x1c, 0x04, 0x1d, 0x04, 0x1e, 0x04, 0x1f, 0x04, 0x20,
0x04, 0x21, 0x04, 0x22, 0x04, 0x23, 0x04, 0x24, 0x04, 0x25, 0x04, 0x26,
0x04, 0x27, 0x04, 0x28, 0x04, 0x29, 0x04, 0x2c, 0x04, 0x2b, 0x04, 0x2a,
0x04, 0x2d, 0x04, 0x2e, 0x04, 0x2f, 0x04, 0x30, 0x04, 0x31, 0x04, 0x32,
0x04, 0x33, 0x04, 0x34, 0x04, 0x35, 0x04, 0x51, 0x04, 0x36, 0x04, 0x37,
0x04, 0x38, 0x04, 0x39, 0x04, 0x3a, 0x04, 0x3b, 0x04, 0x3c, 0x04, 0x3d,
0x04, 0x3e, 0x04, 0x3f, 0x04, 0x40, 0x04, 0x41, 0x04, 0x42, 0x04, 0x43,
0x04, 0x44, 0x04, 0x45, 0x04, 0x46, 0x04, 0x47, 0x04, 0x48, 0x04, 0x49,
0x04, 0x4c, 0x04, 0x4b, 0x04, 0x4a, 0x04, 0x4d, 0x04, 0x4e, 0x04, 0x4f
};
unsigned int cyrillic_txt_len = 132;
|
the_stack_data/248581639.c | /* { dg-do compile } */
/* { dg-require-effective-target arm_neon_ok } */
/* { dg-options "-O2 -ftree-vectorize" } */
/* { dg-add-options arm_neon } */
void
_op_blend_p_caa_dp(unsigned *s, unsigned* e, unsigned *d, unsigned c) {
while (d < e) {
*d = ( (((((*s) >> 8) & 0x00ff00ff) * (c)) & 0xff00ff00) + (((((*s) & 0x00ff00ff) * (c)) >> 8) & 0x00ff00ff) );
d++;
s++;
}
}
/* These constants should be emitted as immediates rather than loaded from memory. */
/* { dg-final { scan-assembler-not "(\\.d?word)" } } */
|
the_stack_data/61074942.c | #include <stdio.h>
int main() {
int c;
/* Create a null FILE pointer */
FILE *ptr = 0 ;
/* List the files in a directory and listen */
ptr = popen("ls ./" , "r");
/* If the command fails return failure */
if(!ptr) return 1;
/* Read each character */
while((c = fgetc(ptr)) != EOF) {
/* Print the characters */
printf("%c" ,(char)c);
}
/* Close the pipe */
pclose(ptr);
return 0;
}
|
the_stack_data/26146.c | /* https://wasdk.github.io/WasmFiddle/?k4qsn */
extern unsigned readUInt32(int index);
extern void writeUInt32(unsigned pixel, int index);
#define RED_SHIFT 24
#define GREEN_SHIFT 16
#define BLUE_SHIFT 8
#define BYTE_MASK 0xFF
#define RED_MASK (BYTE_MASK << RED_SHIFT)
#define GREEN_MASK (BYTE_MASK << GREEN_SHIFT)
#define BLUE_MASK (BYTE_MASK << BLUE_SHIFT)
#define ALPHA_MASK BYTE_MASK
#define GET_RED(pixel) (pixel & RED_MASK) >> RED_SHIFT
#define GET_GREEN(pixel) (pixel & GREEN_MASK) >> GREEN_SHIFT
#define GET_BLUE(pixel) (pixel & BLUE_MASK) >> BLUE_SHIFT
#define GET_ALPHA(pixel) pixel & ALPHA_MASK
#define DESATURATE_BT601(r, g, b) (((r) * 299 + (g) * 587 + (b) * 114) / 1000) & BYTE_MASK
#define GET_PIXEL(grey, alpha) ((grey) << RED_SHIFT) + ((grey) << GREEN_SHIFT) + ((grey) << BLUE_SHIFT) + (alpha)
void desaturate(int bufferLength, int channels) {
unsigned pixel, grey;
for (int index = 0; index < bufferLength; index += channels) {
pixel = readUInt32(index);
grey = DESATURATE_BT601(GET_RED(pixel), GET_GREEN(pixel), GET_BLUE(pixel));
writeUInt32(GET_PIXEL(grey, GET_ALPHA(pixel)), index);
}
}
void desaturateVoid(int bufferLength, int channels) {
unsigned pixel, desaturatedPixel, grey;
for (int index = 0; index < bufferLength; index += channels) {
pixel = 0x123456FF;
grey = DESATURATE_BT601(GET_RED(pixel), GET_GREEN(pixel), GET_BLUE(pixel));
desaturatedPixel = GET_PIXEL(grey, GET_ALPHA(pixel));
}
} |
the_stack_data/89904.c | #include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#include <sys/types.h>
#include <sys/inotify.h>
#include <limits.h>
#include <sys/socket.h>
#include <arpa/inet.h>
#include <netdb.h>
#include <string.h>
#define MAX_EVENTS 1024 /*Max. number of events to process at one go*/
#define LEN_NAME 64 /*Assuming that the length of the filename won't exceed 64 bytes*/
#define EVENT_SIZE ( sizeof (struct inotify_event) ) /*size of one event*/
#define BUF_LEN ( MAX_EVENTS * ( EVENT_SIZE + LEN_NAME )) /*buffer to store the data of events*/
struct url{
char *url;
char schema[100];
char host[1000];
char page[1000];
int port;
};
struct url parse_url(char *url);
/*
build http1.1 post message
*/
char *build_http_message(char *host, char *page,char *data,char *query);
/*
create socket connected to specified url
*/
int create_socket_and_connect(struct url url);
/*
open file with read mode
*/
FILE * open_file(char *dir,char *file);
/*
read file to the end
*/
void read_file_to_end(FILE *fp,struct url url,int *sock,void(*process)(char *,struct url url,int *sock));
void do_nothing(char *line,struct url url,int *sock);
void send_log_to_server(char *line,struct url url,int *sock);
void watch(char *dir,char *file,uint32_t mask,struct url url,int *sock);
/*
usage: ./rlc xx/xx/log xxx.log http://operation01:8080/hotitem/businesslog
*/
int main( int argc, char **argv ){
struct url url = parse_url(argv[3]);
int sock = create_socket_and_connect(url);
watch(argv[1],argv[2],IN_CREATE | IN_MODIFY | IN_DELETE,url,&sock);
close(sock);
return 0;
}
void process_event(struct inotify_event *event,struct url url,int *sock,FILE **fp,char *dir,char *file){
if ( event->mask & IN_CREATE) {
if (event->mask & IN_ISDIR){} else{
printf("created %s\n",event->name);
if(strcmp(event->name , file)==0){
fclose(*fp);
*fp = open_file(dir, file);
}
}
}
if ( event->mask & IN_MODIFY) {
if (event->mask & IN_ISDIR){}
else{
if(strcmp(event->name , file)==0){
read_file_to_end(*fp,url,sock,send_log_to_server);
}
}
}
if ( event->mask & IN_DELETE) {
if (event->mask & IN_ISDIR){} else{}
}
}
void watch(char *dir,char *file,uint32_t mask,struct url url,int *sock){
int length, i = 0, wd;
int fd;
char buffer[BUF_LEN];
FILE *fp;
/* Initialize Inotify*/
fd = inotify_init();
/* add watch to starting directory */
wd = inotify_add_watch(fd, dir, mask);
fp = open_file(dir,file);
read_file_to_end(fp,url,sock,do_nothing);
/* do it forever*/
while(1)
{
int i = 0;
int length = read( fd, buffer, BUF_LEN );
while ( i < length ) {
struct inotify_event *event = ( struct inotify_event * ) &buffer[ i ];
if ( event->len ) {
process_event(event,url,sock,&fp,dir,file);
i += EVENT_SIZE + event->len;
}
}
}
/* Clean up*/
inotify_rm_watch( fd, wd );
close( fd );
close(sock);
}
void do_nothing(char *line,struct url url,int *sock){
}
int needSend(char *line){
char line_cp[10000] ;
strcpy(line_cp, line);
char *p = strtok(line_cp,"\2");
int i=0;
while (p != NULL) {
if(++i >9)break;
p = strtok(NULL,"\2");
}
return (i==10 && p!=NULL && (strcmp(p , "2")==0));
}
void send_log_to_server(char *line,struct url url,int *sock){
if(!needSend(line)){
return;
}
char data[10000];
sprintf(data, "log=%s", line);
char query[100000];
build_http_message(url.host, url.page,data,&query[0]);
//send(sock, query, strlen(query), 0);
int ret = send(*sock, query, strlen(query), MSG_NOSIGNAL);
if (ret == -1) {
//retry
printf("retry connect!\n");
*sock = create_socket_and_connect(url);
send(*sock, query, strlen(query), 0);
}
}
void read_file_to_end(FILE *fp,struct url url,int *sock,void(*process)(char *,struct url url,int *sock)){
char * line = NULL;
size_t len = 0;
ssize_t readlen;
while ((readlen = getline(&line, &len, fp)) != -1) {
readlen = getline(&line, &len, fp);
(*process)(line,url,sock);
}
}
FILE * open_file(char *dir,char *file){
char * name = malloc(strlen(dir)+strlen(file) + 2);
sprintf(name,"%s/%s", dir, file);
printf("open : %s\n",name);
FILE *fp = fopen(name, "r");
free(name);
return fp;
}
struct url parse_url(char *url){
struct url u;
sscanf(url, "%[^://]://%99[^:]:%99d/%99[^\n]",u.schema, u.host, &u.port, u.page);
printf("host:%s\n",u.host);
printf("port:%d\n",u.port);
printf("page:%s\n",u.page);
return u;
}
char *build_http_message(char *host, char *page,char *data,char *query) {
//char *query;
char *tpl = "POST /%s HTTP/1.1\r\nHost: %s\r\nConnection: keep-alive\r\nContent-Length: %d\r\nContent-Type: application/x-www-form-urlencoded; charset=UTF-8\r\n\r\n%s\r\n\0";
//query = (char *)malloc(strlen(page)+strlen(host)+strlen(tpl));
sprintf(query, tpl, page, host,strlen(data),data);
return query;
}
int create_tcp_socket() {
int sock;
if((sock = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP)) < 0){
perror("Can't create TCP socket");
exit(1);
}
return sock;
}
char *get_ip(char *host) {
struct hostent *hent;
int iplen = 15; //XXX.XXX.XXX.XXX
char *ip = (char *)malloc(iplen+1);
memset(ip, 0, iplen+1);
if((hent = gethostbyname(host)) == NULL) {
herror("Can't get IP");
exit(1);
}
if(inet_ntop(AF_INET, (void *)hent->h_addr_list[0], ip, iplen) == NULL) {
perror("Can't resolve host");
exit(1);
}
return ip;
}
int create_socket_and_connect(struct url url){
struct sockaddr_in *remote;
int sock;
int tmpres;
char *ip;
char *http_message;
char buf[BUFSIZ+1];
sock = create_tcp_socket();
ip = get_ip(url.host);
printf("ip: %s\n", ip);
remote = (struct sockaddr_in *)malloc(sizeof(struct sockaddr_in *));
remote->sin_family = AF_INET;
tmpres = inet_pton(AF_INET, ip, (void *)(&(remote->sin_addr.s_addr)));
if( tmpres < 0) {
perror("Can't set remote->sin_addr.s_addr");
exit(1);
}else if(tmpres == 0) {
fprintf(stderr, "%s is not a valid IP address\n", ip);
exit(1);
}
remote->sin_port = htons(url.port);
if(connect(sock, (struct sockaddr *)remote, sizeof(struct sockaddr)) < 0){
perror("Could not connect");
exit(1);
}
return sock;
}
|
the_stack_data/212642527.c | /* 1) Criar uma função para ordenar os elementos de um vetor de tamanho 'n'. */
#include <stdio.h>
void GVA(int vet[], int tam, int lim);
int main(void)
{
int i, j;
int tam;
int aux;
printf("Informe o tamanho do vetor: ");
scanf("%d", &tam);
int vetorA[tam];
GVA(vetorA, tam, 100);
printf("Vetor Aleatorio:\n\n");
for (i = 0; i < tam; i++)
{
printf("%d\t", vetorA[i]);
}
printf("\n\n");
for (i = 0; i < tam; i++)
{
for (j = i + 1; j < tam; j++)
{
if (vetorA[i] > vetorA[j])
{
aux = vetorA[i];
vetorA[i] = vetorA[j];
vetorA[j] = aux;
}
}
}
printf("Vetor Ordenado:\n\n");
for (i = 0; i < tam; i++)
{
printf("%d\t", vetorA[i]);
}
return 0;
}
//Funcao GVA
void GVA(int vet[], int tam, int lim)
{
int i;
srand(time(NULL));
for (i = 0; i < tam; i++)
{
vet[i] = rand() % (lim + 1);
}
}
|
the_stack_data/23574788.c | /*
関数についての問題です。
引数を二つ取り、それら同士を足し合わせた答えを出力(printf)するadd_and_printという名前の関数を宣言してください。
実行して8と出力されたら正解です。
*/
#include <stdio.h>
//--------------------------ここに記入する
//---------------------------
int main(){
int a = 3,b = 5;
add_and_print(a,b);
}
|
the_stack_data/150142520.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.
*/
int main() {
int k = 0;
for (int i = 0; i < 10; i++) {
while (k < 10) {
k++;
}
}
return k;
}
|
the_stack_data/117175.c | #include <math.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <complex.h>
#ifdef complex
#undef complex
#endif
#ifdef I
#undef I
#endif
#if defined(_WIN64)
typedef long long BLASLONG;
typedef unsigned long long BLASULONG;
#else
typedef long BLASLONG;
typedef unsigned long BLASULONG;
#endif
#ifdef LAPACK_ILP64
typedef BLASLONG blasint;
#if defined(_WIN64)
#define blasabs(x) llabs(x)
#else
#define blasabs(x) labs(x)
#endif
#else
typedef int blasint;
#define blasabs(x) abs(x)
#endif
typedef blasint integer;
typedef unsigned int uinteger;
typedef char *address;
typedef short int shortint;
typedef float real;
typedef double doublereal;
typedef struct { real r, i; } complex;
typedef struct { doublereal r, i; } doublecomplex;
#ifdef _MSC_VER
static inline _Fcomplex Cf(complex *z) {_Fcomplex zz={z->r , z->i}; return zz;}
static inline _Dcomplex Cd(doublecomplex *z) {_Dcomplex zz={z->r , z->i};return zz;}
static inline _Fcomplex * _pCf(complex *z) {return (_Fcomplex*)z;}
static inline _Dcomplex * _pCd(doublecomplex *z) {return (_Dcomplex*)z;}
#else
static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}
static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}
static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}
static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}
#endif
#define pCf(z) (*_pCf(z))
#define pCd(z) (*_pCd(z))
typedef int logical;
typedef short int shortlogical;
typedef char logical1;
typedef char integer1;
#define TRUE_ (1)
#define FALSE_ (0)
/* Extern is for use with -E */
#ifndef Extern
#define Extern extern
#endif
/* I/O stuff */
typedef int flag;
typedef int ftnlen;
typedef int ftnint;
/*external read, write*/
typedef struct
{ flag cierr;
ftnint ciunit;
flag ciend;
char *cifmt;
ftnint cirec;
} cilist;
/*internal read, write*/
typedef struct
{ flag icierr;
char *iciunit;
flag iciend;
char *icifmt;
ftnint icirlen;
ftnint icirnum;
} icilist;
/*open*/
typedef struct
{ flag oerr;
ftnint ounit;
char *ofnm;
ftnlen ofnmlen;
char *osta;
char *oacc;
char *ofm;
ftnint orl;
char *oblnk;
} olist;
/*close*/
typedef struct
{ flag cerr;
ftnint cunit;
char *csta;
} cllist;
/*rewind, backspace, endfile*/
typedef struct
{ flag aerr;
ftnint aunit;
} alist;
/* inquire */
typedef struct
{ flag inerr;
ftnint inunit;
char *infile;
ftnlen infilen;
ftnint *inex; /*parameters in standard's order*/
ftnint *inopen;
ftnint *innum;
ftnint *innamed;
char *inname;
ftnlen innamlen;
char *inacc;
ftnlen inacclen;
char *inseq;
ftnlen inseqlen;
char *indir;
ftnlen indirlen;
char *infmt;
ftnlen infmtlen;
char *inform;
ftnint informlen;
char *inunf;
ftnlen inunflen;
ftnint *inrecl;
ftnint *innrec;
char *inblank;
ftnlen inblanklen;
} inlist;
#define VOID void
union Multitype { /* for multiple entry points */
integer1 g;
shortint h;
integer i;
/* longint j; */
real r;
doublereal d;
complex c;
doublecomplex z;
};
typedef union Multitype Multitype;
struct Vardesc { /* for Namelist */
char *name;
char *addr;
ftnlen *dims;
int type;
};
typedef struct Vardesc Vardesc;
struct Namelist {
char *name;
Vardesc **vars;
int nvars;
};
typedef struct Namelist Namelist;
#define abs(x) ((x) >= 0 ? (x) : -(x))
#define dabs(x) (fabs(x))
#define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
#define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
#define dmin(a,b) (f2cmin(a,b))
#define dmax(a,b) (f2cmax(a,b))
#define bit_test(a,b) ((a) >> (b) & 1)
#define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
#define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
#define abort_() { sig_die("Fortran abort routine called", 1); }
#define c_abs(z) (cabsf(Cf(z)))
#define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
#ifdef _MSC_VER
#define c_div(c, a, b) {Cf(c)._Val[0] = (Cf(a)._Val[0]/Cf(b)._Val[0]); Cf(c)._Val[1]=(Cf(a)._Val[1]/Cf(b)._Val[1]);}
#define z_div(c, a, b) {Cd(c)._Val[0] = (Cd(a)._Val[0]/Cd(b)._Val[0]); Cd(c)._Val[1]=(Cd(a)._Val[1]/df(b)._Val[1]);}
#else
#define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
#define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
#endif
#define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
#define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
#define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
//#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
#define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
#define d_abs(x) (fabs(*(x)))
#define d_acos(x) (acos(*(x)))
#define d_asin(x) (asin(*(x)))
#define d_atan(x) (atan(*(x)))
#define d_atn2(x, y) (atan2(*(x),*(y)))
#define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
#define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
#define d_cos(x) (cos(*(x)))
#define d_cosh(x) (cosh(*(x)))
#define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
#define d_exp(x) (exp(*(x)))
#define d_imag(z) (cimag(Cd(z)))
#define r_imag(z) (cimagf(Cf(z)))
#define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#define d_log(x) (log(*(x)))
#define d_mod(x, y) (fmod(*(x), *(y)))
#define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
#define d_nint(x) u_nint(*(x))
#define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
#define d_sign(a,b) u_sign(*(a),*(b))
#define r_sign(a,b) u_sign(*(a),*(b))
#define d_sin(x) (sin(*(x)))
#define d_sinh(x) (sinh(*(x)))
#define d_sqrt(x) (sqrt(*(x)))
#define d_tan(x) (tan(*(x)))
#define d_tanh(x) (tanh(*(x)))
#define i_abs(x) abs(*(x))
#define i_dnnt(x) ((integer)u_nint(*(x)))
#define i_len(s, n) (n)
#define i_nint(x) ((integer)u_nint(*(x)))
#define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
#define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
#define pow_si(B,E) spow_ui(*(B),*(E))
#define pow_ri(B,E) spow_ui(*(B),*(E))
#define pow_di(B,E) dpow_ui(*(B),*(E))
#define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
#define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
#define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
#define s_cat(lpp, rpp, rnp, np, llp) { ftnlen i, nc, ll; char *f__rp, *lp; ll = (llp); lp = (lpp); for(i=0; i < (int)*(np); ++i) { nc = ll; if((rnp)[i] < nc) nc = (rnp)[i]; ll -= nc; f__rp = (rpp)[i]; while(--nc >= 0) *lp++ = *(f__rp)++; } while(--ll >= 0) *lp++ = ' '; }
#define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
#define s_copy(A,B,C,D) { int __i,__m; for (__i=0, __m=f2cmin((C),(D)); __i<__m && (B)[__i] != 0; ++__i) (A)[__i] = (B)[__i]; }
#define sig_die(s, kill) { exit(1); }
#define s_stop(s, n) {exit(0);}
static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";
#define z_abs(z) (cabs(Cd(z)))
#define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
#define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
#define myexit_() break;
#define mycycle() continue;
#define myceiling(w) {ceil(w)}
#define myhuge(w) {HUGE_VAL}
//#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
#define mymaxloc(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}
/* procedure parameter types for -A and -C++ */
#define F2C_proc_par_types 1
#ifdef __cplusplus
typedef logical (*L_fp)(...);
#else
typedef logical (*L_fp)();
#endif
static float spow_ui(float x, integer n) {
float pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static double dpow_ui(double x, integer n) {
double pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#ifdef _MSC_VER
static _Fcomplex cpow_ui(complex x, integer n) {
complex pow={1.0,0.0}; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;
for(u = n; ; ) {
if(u & 01) pow.r *= x.r, pow.i *= x.i;
if(u >>= 1) x.r *= x.r, x.i *= x.i;
else break;
}
}
_Fcomplex p={pow.r, pow.i};
return p;
}
#else
static _Complex float cpow_ui(_Complex float x, integer n) {
_Complex float pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#endif
#ifdef _MSC_VER
static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
_Dcomplex pow={1.0,0.0}; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
for(u = n; ; ) {
if(u & 01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
else break;
}
}
_Dcomplex p = {pow._Val[0], pow._Val[1]};
return p;
}
#else
static _Complex double zpow_ui(_Complex double x, integer n) {
_Complex double pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#endif
static integer pow_ii(integer x, integer n) {
integer pow; unsigned long int u;
if (n <= 0) {
if (n == 0 || x == 1) pow = 1;
else if (x != -1) pow = x == 0 ? 1/x : 0;
else n = -n;
}
if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
u = n;
for(pow = 1; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static integer dmaxloc_(double *w, integer s, integer e, integer *n)
{
double m; integer i, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
return mi-s+1;
}
static integer smaxloc_(float *w, integer s, integer e, integer *n)
{
float m; integer i, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
return mi-s+1;
}
static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Fcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conjf(Cf(&x[i]))._Val[0] * Cf(&y[i])._Val[0];
zdotc._Val[1] += conjf(Cf(&x[i]))._Val[1] * Cf(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conjf(Cf(&x[i*incx]))._Val[0] * Cf(&y[i*incy])._Val[0];
zdotc._Val[1] += conjf(Cf(&x[i*incx]))._Val[1] * Cf(&y[i*incy])._Val[1];
}
}
pCf(z) = zdotc;
}
#else
_Complex float zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
}
}
pCf(z) = zdotc;
}
#endif
static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Dcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conj(Cd(&x[i]))._Val[0] * Cd(&y[i])._Val[0];
zdotc._Val[1] += conj(Cd(&x[i]))._Val[1] * Cd(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conj(Cd(&x[i*incx]))._Val[0] * Cd(&y[i*incy])._Val[0];
zdotc._Val[1] += conj(Cd(&x[i*incx]))._Val[1] * Cd(&y[i*incy])._Val[1];
}
}
pCd(z) = zdotc;
}
#else
_Complex double zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
}
}
pCd(z) = zdotc;
}
#endif
static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Fcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cf(&x[i])._Val[0] * Cf(&y[i])._Val[0];
zdotc._Val[1] += Cf(&x[i])._Val[1] * Cf(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cf(&x[i*incx])._Val[0] * Cf(&y[i*incy])._Val[0];
zdotc._Val[1] += Cf(&x[i*incx])._Val[1] * Cf(&y[i*incy])._Val[1];
}
}
pCf(z) = zdotc;
}
#else
_Complex float zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cf(&x[i]) * Cf(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
}
}
pCf(z) = zdotc;
}
#endif
static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Dcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cd(&x[i])._Val[0] * Cd(&y[i])._Val[0];
zdotc._Val[1] += Cd(&x[i])._Val[1] * Cd(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cd(&x[i*incx])._Val[0] * Cd(&y[i*incy])._Val[0];
zdotc._Val[1] += Cd(&x[i*incx])._Val[1] * Cd(&y[i*incy])._Val[1];
}
}
pCd(z) = zdotc;
}
#else
_Complex double zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cd(&x[i]) * Cd(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
}
}
pCd(z) = zdotc;
}
#endif
/* -- translated by f2c (version 20000121).
You must link the resulting object file with the libraries:
-lf2c -lm (in that order)
*/
/* > \brief \b STPTTF copies a triangular matrix from the standard packed format (TP) to the rectangular full
packed format (TF). */
/* =========== DOCUMENTATION =========== */
/* Online html documentation available at */
/* http://www.netlib.org/lapack/explore-html/ */
/* > \htmlonly */
/* > Download STPTTF + dependencies */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/stpttf.
f"> */
/* > [TGZ]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/stpttf.
f"> */
/* > [ZIP]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/stpttf.
f"> */
/* > [TXT]</a> */
/* > \endhtmlonly */
/* Definition: */
/* =========== */
/* SUBROUTINE STPTTF( TRANSR, UPLO, N, AP, ARF, INFO ) */
/* CHARACTER TRANSR, UPLO */
/* INTEGER INFO, N */
/* REAL AP( 0: * ), ARF( 0: * ) */
/* > \par Purpose: */
/* ============= */
/* > */
/* > \verbatim */
/* > */
/* > STPTTF copies a triangular matrix A from standard packed format (TP) */
/* > to rectangular full packed format (TF). */
/* > \endverbatim */
/* Arguments: */
/* ========== */
/* > \param[in] TRANSR */
/* > \verbatim */
/* > TRANSR is CHARACTER*1 */
/* > = 'N': ARF in Normal format is wanted; */
/* > = 'T': ARF in Conjugate-transpose format is wanted. */
/* > \endverbatim */
/* > */
/* > \param[in] UPLO */
/* > \verbatim */
/* > UPLO is CHARACTER*1 */
/* > = 'U': A is upper triangular; */
/* > = 'L': A is lower triangular. */
/* > \endverbatim */
/* > */
/* > \param[in] N */
/* > \verbatim */
/* > N is INTEGER */
/* > The order of the matrix A. N >= 0. */
/* > \endverbatim */
/* > */
/* > \param[in] AP */
/* > \verbatim */
/* > AP is REAL array, dimension ( N*(N+1)/2 ), */
/* > On entry, the upper or lower triangular matrix A, packed */
/* > columnwise in a linear array. The j-th column of A is stored */
/* > in the array AP as follows: */
/* > if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j; */
/* > if UPLO = 'L', AP(i + (j-1)*(2n-j)/2) = A(i,j) for j<=i<=n. */
/* > \endverbatim */
/* > */
/* > \param[out] ARF */
/* > \verbatim */
/* > ARF is REAL array, dimension ( N*(N+1)/2 ), */
/* > On exit, the upper or lower triangular matrix A stored in */
/* > RFP format. For a further discussion see Notes below. */
/* > \endverbatim */
/* > */
/* > \param[out] INFO */
/* > \verbatim */
/* > INFO is INTEGER */
/* > = 0: successful exit */
/* > < 0: if INFO = -i, the i-th argument had an illegal value */
/* > \endverbatim */
/* Authors: */
/* ======== */
/* > \author Univ. of Tennessee */
/* > \author Univ. of California Berkeley */
/* > \author Univ. of Colorado Denver */
/* > \author NAG Ltd. */
/* > \date December 2016 */
/* > \ingroup realOTHERcomputational */
/* > \par Further Details: */
/* ===================== */
/* > */
/* > \verbatim */
/* > */
/* > We first consider Rectangular Full Packed (RFP) Format when N is */
/* > even. We give an example where N = 6. */
/* > */
/* > AP is Upper AP is Lower */
/* > */
/* > 00 01 02 03 04 05 00 */
/* > 11 12 13 14 15 10 11 */
/* > 22 23 24 25 20 21 22 */
/* > 33 34 35 30 31 32 33 */
/* > 44 45 40 41 42 43 44 */
/* > 55 50 51 52 53 54 55 */
/* > */
/* > */
/* > Let TRANSR = 'N'. RFP holds AP as follows: */
/* > For UPLO = 'U' the upper trapezoid A(0:5,0:2) consists of the last */
/* > three columns of AP upper. The lower triangle A(4:6,0:2) consists of */
/* > the transpose of the first three columns of AP upper. */
/* > For UPLO = 'L' the lower trapezoid A(1:6,0:2) consists of the first */
/* > three columns of AP lower. The upper triangle A(0:2,0:2) consists of */
/* > the transpose of the last three columns of AP lower. */
/* > This covers the case N even and TRANSR = 'N'. */
/* > */
/* > RFP A RFP A */
/* > */
/* > 03 04 05 33 43 53 */
/* > 13 14 15 00 44 54 */
/* > 23 24 25 10 11 55 */
/* > 33 34 35 20 21 22 */
/* > 00 44 45 30 31 32 */
/* > 01 11 55 40 41 42 */
/* > 02 12 22 50 51 52 */
/* > */
/* > Now let TRANSR = 'T'. RFP A in both UPLO cases is just the */
/* > transpose of RFP A above. One therefore gets: */
/* > */
/* > */
/* > RFP A RFP A */
/* > */
/* > 03 13 23 33 00 01 02 33 00 10 20 30 40 50 */
/* > 04 14 24 34 44 11 12 43 44 11 21 31 41 51 */
/* > 05 15 25 35 45 55 22 53 54 55 22 32 42 52 */
/* > */
/* > */
/* > We then consider Rectangular Full Packed (RFP) Format when N is */
/* > odd. We give an example where N = 5. */
/* > */
/* > AP is Upper AP is Lower */
/* > */
/* > 00 01 02 03 04 00 */
/* > 11 12 13 14 10 11 */
/* > 22 23 24 20 21 22 */
/* > 33 34 30 31 32 33 */
/* > 44 40 41 42 43 44 */
/* > */
/* > */
/* > Let TRANSR = 'N'. RFP holds AP as follows: */
/* > For UPLO = 'U' the upper trapezoid A(0:4,0:2) consists of the last */
/* > three columns of AP upper. The lower triangle A(3:4,0:1) consists of */
/* > the transpose of the first two columns of AP upper. */
/* > For UPLO = 'L' the lower trapezoid A(0:4,0:2) consists of the first */
/* > three columns of AP lower. The upper triangle A(0:1,1:2) consists of */
/* > the transpose of the last two columns of AP lower. */
/* > This covers the case N odd and TRANSR = 'N'. */
/* > */
/* > RFP A RFP A */
/* > */
/* > 02 03 04 00 33 43 */
/* > 12 13 14 10 11 44 */
/* > 22 23 24 20 21 22 */
/* > 00 33 34 30 31 32 */
/* > 01 11 44 40 41 42 */
/* > */
/* > Now let TRANSR = 'T'. RFP A in both UPLO cases is just the */
/* > transpose of RFP A above. One therefore gets: */
/* > */
/* > RFP A RFP A */
/* > */
/* > 02 12 22 00 01 00 10 20 30 40 50 */
/* > 03 13 23 33 11 33 11 21 31 41 51 */
/* > 04 14 24 34 44 43 44 22 32 42 52 */
/* > \endverbatim */
/* > */
/* ===================================================================== */
/* Subroutine */ int stpttf_(char *transr, char *uplo, integer *n, real *ap,
real *arf, integer *info)
{
/* System generated locals */
integer i__1, i__2, i__3;
/* Local variables */
integer i__, j, k;
logical normaltransr;
extern logical lsame_(char *, char *);
logical lower;
integer n1, n2, ij, jp, js, nt;
extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
logical nisodd;
integer lda, ijp;
/* -- LAPACK computational routine (version 3.7.0) -- */
/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
/* December 2016 */
/* ===================================================================== */
/* Test the input parameters. */
*info = 0;
normaltransr = lsame_(transr, "N");
lower = lsame_(uplo, "L");
if (! normaltransr && ! lsame_(transr, "T")) {
*info = -1;
} else if (! lower && ! lsame_(uplo, "U")) {
*info = -2;
} else if (*n < 0) {
*info = -3;
}
if (*info != 0) {
i__1 = -(*info);
xerbla_("STPTTF", &i__1, (ftnlen)6);
return 0;
}
/* Quick return if possible */
if (*n == 0) {
return 0;
}
if (*n == 1) {
if (normaltransr) {
arf[0] = ap[0];
} else {
arf[0] = ap[0];
}
return 0;
}
/* Size of array ARF(0:NT-1) */
nt = *n * (*n + 1) / 2;
/* Set N1 and N2 depending on LOWER */
if (lower) {
n2 = *n / 2;
n1 = *n - n2;
} else {
n1 = *n / 2;
n2 = *n - n1;
}
/* If N is odd, set NISODD = .TRUE. */
/* If N is even, set K = N/2 and NISODD = .FALSE. */
/* set lda of ARF^C; ARF^C is (0:(N+1)/2-1,0:N-noe) */
/* where noe = 0 if n is even, noe = 1 if n is odd */
if (*n % 2 == 0) {
k = *n / 2;
nisodd = FALSE_;
lda = *n + 1;
} else {
nisodd = TRUE_;
lda = *n;
}
/* ARF^C has lda rows and n+1-noe cols */
if (! normaltransr) {
lda = (*n + 1) / 2;
}
/* start execution: there are eight cases */
if (nisodd) {
/* N is odd */
if (normaltransr) {
/* N is odd and TRANSR = 'N' */
if (lower) {
/* N is odd, TRANSR = 'N', and UPLO = 'L' */
ijp = 0;
jp = 0;
i__1 = n2;
for (j = 0; j <= i__1; ++j) {
i__2 = *n - 1;
for (i__ = j; i__ <= i__2; ++i__) {
ij = i__ + jp;
arf[ij] = ap[ijp];
++ijp;
}
jp += lda;
}
i__1 = n2 - 1;
for (i__ = 0; i__ <= i__1; ++i__) {
i__2 = n2;
for (j = i__ + 1; j <= i__2; ++j) {
ij = i__ + j * lda;
arf[ij] = ap[ijp];
++ijp;
}
}
} else {
/* N is odd, TRANSR = 'N', and UPLO = 'U' */
ijp = 0;
i__1 = n1 - 1;
for (j = 0; j <= i__1; ++j) {
ij = n2 + j;
i__2 = j;
for (i__ = 0; i__ <= i__2; ++i__) {
arf[ij] = ap[ijp];
++ijp;
ij += lda;
}
}
js = 0;
i__1 = *n - 1;
for (j = n1; j <= i__1; ++j) {
ij = js;
i__2 = js + j;
for (ij = js; ij <= i__2; ++ij) {
arf[ij] = ap[ijp];
++ijp;
}
js += lda;
}
}
} else {
/* N is odd and TRANSR = 'T' */
if (lower) {
/* N is odd, TRANSR = 'T', and UPLO = 'L' */
ijp = 0;
i__1 = n2;
for (i__ = 0; i__ <= i__1; ++i__) {
i__2 = *n * lda - 1;
i__3 = lda;
for (ij = i__ * (lda + 1); i__3 < 0 ? ij >= i__2 : ij <=
i__2; ij += i__3) {
arf[ij] = ap[ijp];
++ijp;
}
}
js = 1;
i__1 = n2 - 1;
for (j = 0; j <= i__1; ++j) {
i__3 = js + n2 - j - 1;
for (ij = js; ij <= i__3; ++ij) {
arf[ij] = ap[ijp];
++ijp;
}
js = js + lda + 1;
}
} else {
/* N is odd, TRANSR = 'T', and UPLO = 'U' */
ijp = 0;
js = n2 * lda;
i__1 = n1 - 1;
for (j = 0; j <= i__1; ++j) {
i__3 = js + j;
for (ij = js; ij <= i__3; ++ij) {
arf[ij] = ap[ijp];
++ijp;
}
js += lda;
}
i__1 = n1;
for (i__ = 0; i__ <= i__1; ++i__) {
i__3 = i__ + (n1 + i__) * lda;
i__2 = lda;
for (ij = i__; i__2 < 0 ? ij >= i__3 : ij <= i__3; ij +=
i__2) {
arf[ij] = ap[ijp];
++ijp;
}
}
}
}
} else {
/* N is even */
if (normaltransr) {
/* N is even and TRANSR = 'N' */
if (lower) {
/* N is even, TRANSR = 'N', and UPLO = 'L' */
ijp = 0;
jp = 0;
i__1 = k - 1;
for (j = 0; j <= i__1; ++j) {
i__2 = *n - 1;
for (i__ = j; i__ <= i__2; ++i__) {
ij = i__ + 1 + jp;
arf[ij] = ap[ijp];
++ijp;
}
jp += lda;
}
i__1 = k - 1;
for (i__ = 0; i__ <= i__1; ++i__) {
i__2 = k - 1;
for (j = i__; j <= i__2; ++j) {
ij = i__ + j * lda;
arf[ij] = ap[ijp];
++ijp;
}
}
} else {
/* N is even, TRANSR = 'N', and UPLO = 'U' */
ijp = 0;
i__1 = k - 1;
for (j = 0; j <= i__1; ++j) {
ij = k + 1 + j;
i__2 = j;
for (i__ = 0; i__ <= i__2; ++i__) {
arf[ij] = ap[ijp];
++ijp;
ij += lda;
}
}
js = 0;
i__1 = *n - 1;
for (j = k; j <= i__1; ++j) {
ij = js;
i__2 = js + j;
for (ij = js; ij <= i__2; ++ij) {
arf[ij] = ap[ijp];
++ijp;
}
js += lda;
}
}
} else {
/* N is even and TRANSR = 'T' */
if (lower) {
/* N is even, TRANSR = 'T', and UPLO = 'L' */
ijp = 0;
i__1 = k - 1;
for (i__ = 0; i__ <= i__1; ++i__) {
i__2 = (*n + 1) * lda - 1;
i__3 = lda;
for (ij = i__ + (i__ + 1) * lda; i__3 < 0 ? ij >= i__2 :
ij <= i__2; ij += i__3) {
arf[ij] = ap[ijp];
++ijp;
}
}
js = 0;
i__1 = k - 1;
for (j = 0; j <= i__1; ++j) {
i__3 = js + k - j - 1;
for (ij = js; ij <= i__3; ++ij) {
arf[ij] = ap[ijp];
++ijp;
}
js = js + lda + 1;
}
} else {
/* N is even, TRANSR = 'T', and UPLO = 'U' */
ijp = 0;
js = (k + 1) * lda;
i__1 = k - 1;
for (j = 0; j <= i__1; ++j) {
i__3 = js + j;
for (ij = js; ij <= i__3; ++ij) {
arf[ij] = ap[ijp];
++ijp;
}
js += lda;
}
i__1 = k - 1;
for (i__ = 0; i__ <= i__1; ++i__) {
i__3 = i__ + (k + i__) * lda;
i__2 = lda;
for (ij = i__; i__2 < 0 ? ij >= i__3 : ij <= i__3; ij +=
i__2) {
arf[ij] = ap[ijp];
++ijp;
}
}
}
}
}
return 0;
/* End of STPTTF */
} /* stpttf_ */
|
the_stack_data/38382.c | /*
A C-program for MT19937, with initialization improved 2002/1/26.
Coded by Takuji Nishimura and Makoto Matsumoto.
Before using, initialize the state by using init_genrand(seed)
or init_by_array(init_key, key_length).
Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The names of its contributors may not be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
Any feedback is very welcome.
http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)
*/
/* Period parameters */
#define N 624
#define M 397
#define MATRIX_A 0x9908b0dfUL /* constant vector a */
#define UPPER_MASK 0x80000000UL /* most significant w-r bits */
#define LOWER_MASK 0x7fffffffUL /* least significant r bits */
static unsigned long mt[N]; /* the array for the state vector */
static int mti=N+1; /* mti==N+1 means mt[N] is not initialized */
/* initializes mt[N] with a seed */
void init_genrand(unsigned long s)
{
mt[0]= s & 0xffffffffUL;
for (mti=1; mti<N; mti++) {
mt[mti] =
(1812433253UL * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti);
/* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
/* In the previous versions, MSBs of the seed affect */
/* only MSBs of the array mt[]. */
/* 2002/01/09 modified by Makoto Matsumoto */
mt[mti] &= 0xffffffffUL;
/* for >32 bit machines */
}
}
/* initialize by an array with array-length */
/* init_key is the array for initializing keys */
/* key_length is its length */
/* slight change for C++, 2004/2/26 */
void init_by_array(unsigned long init_key[], int key_length)
{
int i, j, k;
init_genrand(19650218UL);
i=1; j=0;
k = (N>key_length ? N : key_length);
for (; k; k--) {
mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1664525UL))
+ init_key[j] + j; /* non linear */
mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
i++; j++;
if (i>=N) { mt[0] = mt[N-1]; i=1; }
if (j>=key_length) j=0;
}
for (k=N-1; k; k--) {
mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1566083941UL))
- i; /* non linear */
mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
i++;
if (i>=N) { mt[0] = mt[N-1]; i=1; }
}
mt[0] = 0x80000000UL; /* MSB is 1; assuring non-zero initial array */
}
/* generates a random number on [0,0xffffffff]-interval */
unsigned long genrand_int32(void)
{
unsigned long y;
static unsigned long mag01[2]={0x0UL, MATRIX_A};
/* mag01[x] = x * MATRIX_A for x=0,1 */
if (mti >= N) { /* generate N words at one time */
int kk;
if (mti == N+1) /* if init_genrand() has not been called, */
init_genrand(5489UL); /* a default initial seed is used */
for (kk=0;kk<N-M;kk++) {
y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
mt[kk] = mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1UL];
}
for (;kk<N-1;kk++) {
y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
mt[kk] = mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1UL];
}
y = (mt[N-1]&UPPER_MASK)|(mt[0]&LOWER_MASK);
mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1UL];
mti = 0;
}
y = mt[mti++];
/* Tempering */
y ^= (y >> 11);
y ^= (y << 7) & 0x9d2c5680UL;
y ^= (y << 15) & 0xefc60000UL;
y ^= (y >> 18);
return y;
}
/* generates a random number on [0,0x7fffffff]-interval */
long genrand_int31(void)
{
return (long)(genrand_int32()>>1);
}
/* generates a random number on [0,1]-real-interval */
double genrand_real1(void)
{
return genrand_int32()*(1.0/4294967295.0);
/* divided by 2^32-1 */
}
/* generates a random number on [0,1)-real-interval */
double genrand_real2(void)
{
return genrand_int32()*(1.0/4294967296.0);
/* divided by 2^32 */
}
/* generates a random number on (0,1)-real-interval */
double genrand_real3(void)
{
return (((double)genrand_int32()) + 0.5)*(1.0/4294967296.0);
/* divided by 2^32 */
}
/* generates a random number on [0,1) with 53-bit resolution*/
double genrand_res53(void)
{
unsigned long a=genrand_int32()>>5, b=genrand_int32()>>6;
return(a*67108864.0+b)*(1.0/9007199254740992.0);
}
/* These real versions are due to Isaku Wada, 2002/01/09 added */
int putchar(int);
void print_digits(unsigned i) {
if (i == 0) {
return;
}
print_digits(i / 10);
putchar('0' + i % 10);
}
void print_uint(unsigned i)
{
if (i == 0) {
putchar('0');
} else {
print_digits(i);
}
}
void put_float(double f)
{
if (f < 0) {
putchar('-');
f = -f;
}
print_uint((unsigned) f);
putchar('.');
f = f - (int) f;
if (f == 0.0) {
putchar('0');
putchar('\n');
return;
}
while (f > 0.0000001) {
f *= 10;
putchar('0' + (int) f);
f = f - (int) f;
}
putchar('\n');
}
void put_int(int i)
{
if (i < 0) {
putchar('-');
i = -i;
}
print_uint(i);
putchar('\n');
}
void put_str(char *s)
{
while (*s != '\0') {
putchar(*s);
s++;
}
putchar('\n');
}
void _start(void)
{
int i;
unsigned long init[4]={0x123, 0x234, 0x345, 0x456}, length=4;
init_by_array(init, length);
put_str("1000 outputs of genrand_int32()");
for (i=0; i<1000; i++) {
put_int(genrand_int32());
}
put_str("\n1000 outputs of genrand_real2()");
for (i=0; i<1000; i++) {
put_float(genrand_real2());
}
}
|
the_stack_data/130633.c | /*
Modifying the print_part function from the book
so that its parameter is a pointer to a part struct
and I gotta use the -> operator.
*/
#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#define NAME_LEN 25
struct part
{
int number;
char name[NAME_LEN + 1];
int on_hand;
};
void print_part(struct part *p);
int main(void)
{
struct part example = {10, "Random name", 3};
struct part *pointer;
pointer = malloc(sizeof(struct part));
*pointer = example;
print_part(pointer);
printf("\n");
}
void print_part(struct part *p)
{
printf("Part number: %d\n", p->number);
printf("Part name: %s\n", p -> name);
printf("Quantity at hand: %d\n", p -> on_hand);
} |
the_stack_data/370461.c | // The OpenMP standard defines 3 ways of providing ompt_start_tool:
// 1. "statically-linking the tool’s definition of ompt_start_tool into an
// OpenMP application"
// RUN: %libomp-compile -DCODE -DTOOL && env OMP_TOOL_VERBOSE_INIT=stdout \
// RUN: %libomp-run | FileCheck %s --check-prefixes CHECK,ADDRSPACE
// Note: We should compile the tool without -fopenmp as other tools developer
// would do. Otherwise this test may pass for the wrong reasons on Darwin.
// RUN: %clang %flags -DTOOL -shared -fPIC %s -o %T/tool.so
// 2. "introducing a dynamically-linked library that includes the tool’s
// definition of ompt_start_tool into the application’s address space"
// 2.1 Link with tool during compilation
// RUN: %libomp-compile -DCODE %no-as-needed-flag %T/tool.so && \
// RUN: env OMP_TOOL_VERBOSE_INIT=stdout %libomp-run | FileCheck %s \
// RUN: --check-prefixes CHECK,ADDRSPACE
// 2.2 Link with tool during compilation, but AFTER the runtime
// RUN: %libomp-compile -DCODE -lomp %no-as-needed-flag %T/tool.so && \
// RUN: env OMP_TOOL_VERBOSE_INIT=stdout %libomp-run | FileCheck %s \
// RUN: --check-prefixes CHECK,ADDRSPACE
// 2.3 Inject tool via the dynamic loader
// RUN: %libomp-compile -DCODE && env OMP_TOOL_VERBOSE_INIT=stdout \
// RUN: %preload-tool %libomp-run | FileCheck %s \
// RUN: --check-prefixes CHECK,ADDRSPACE
// 3. "providing the name of a dynamically-linked library appropriate for the
// architecture and operating system used by the application in the
// tool-libraries-var ICV"
// 3.1 OMP_TOOL_VERBOSE_INIT not set
// RUN: %libomp-compile -DCODE && \
// RUN: env OMP_TOOL_LIBRARIES=%T/tool.so %libomp-run | FileCheck %s
// 3.2 OMP_TOOL_VERBOSE_INIT disabled
// RUN: env OMP_TOOL_LIBRARIES=%T/tool.so OMP_TOOL_VERBOSE_INIT=disabled \
// RUN: %libomp-run | FileCheck %s
// 3.3 OMP_TOOL_VERBOSE_INIT to stdout
// RUN: %libomp-compile -DCODE && env OMP_TOOL_LIBRARIES=%T/tool.so \
// RUN: OMP_TOOL_VERBOSE_INIT=stdout %libomp-run | \
// RUN: FileCheck %s -DPARENTPATH=%T --check-prefixes CHECK,TOOLLIB
// 3.4 OMP_TOOL_VERBOSE_INIT to stderr, check merged stdout and stderr
// RUN: env OMP_TOOL_LIBRARIES=%T/tool.so OMP_TOOL_VERBOSE_INIT=stderr \
// RUN: %libomp-run 2>&1 | \
// RUN: FileCheck %s -DPARENTPATH=%T --check-prefixes CHECK,TOOLLIB
// 3.5 OMP_TOOL_VERBOSE_INIT to stderr, check just stderr
// RUN: env OMP_TOOL_LIBRARIES=%T/tool.so OMP_TOOL_VERBOSE_INIT=stderr \
// RUN: %libomp-run 2>&1 >/dev/null | \
// RUN: FileCheck %s -DPARENTPATH=%T --check-prefixes TOOLLIB
// 3.6 OMP_TOOL_VERBOSE_INIT to file "init.log"
// RUN: env OMP_TOOL_LIBRARIES=%T/tool.so OMP_TOOL_VERBOSE_INIT=%T/init.log \
// RUN: %libomp-run | FileCheck %s && cat %T/init.log | \
// RUN: FileCheck %s -DPARENTPATH=%T --check-prefixes TOOLLIB
// REQUIRES: ompt
/*
* This file contains code for an OMPT shared library tool to be
* loaded and the code for the OpenMP executable.
* -DTOOL enables the code for the tool during compilation
* -DCODE enables the code for the executable during compilation
*/
// Check if libomp supports the callbacks for this test.
// CHECK-NOT: {{^}}0: Could not register callback
// ADDRSPACE: ----- START LOGGING OF TOOL REGISTRATION -----
// ADDRSPACE-NEXT: Search for OMP tool in current address space... Success.
// ADDRSPACE-NEXT: Tool was started and is using the OMPT interface.
// ADDRSPACE-NEXT: ----- END LOGGING OF TOOL REGISTRATION -----
// TOOLLIB: ----- START LOGGING OF TOOL REGISTRATION -----
// TOOLLIB-NEXT: Search for OMP tool in current address space... Failed.
// TOOLLIB-NEXT: Searching tool libraries...
// TOOLLIB-NEXT: OMP_TOOL_LIBRARIES = [[PARENTPATH]]/tool.so
// TOOLLIB-NEXT: Opening [[PARENTPATH]]/tool.so... Success.
// TOOLLIB-NEXT: Searching for ompt_start_tool in
// TOOLLIB-SAME: [[PARENTPATH]]/tool.so... Success.
// TOOLLIB-NEXT: Tool was started and is using the OMPT interface.
// TOOLLIB-NEXT: ----- END LOGGING OF TOOL REGISTRATION -----
#ifdef CODE
#include "omp.h"
int main()
{
#pragma omp parallel num_threads(2)
{
}
// CHECK-NOT: ----- START LOGGING OF TOOL REGISTRATION -----
// CHECK-NOT: ----- END LOGGING OF TOOL REGISTRATION -----
// CHECK: {{^}}0: NULL_POINTER=[[NULL:.*$]]
// CHECK: {{^}}0: ompt_event_runtime_shutdown
return 0;
}
#endif /* CODE */
#ifdef TOOL
#include <stdio.h>
#include <omp-tools.h>
int ompt_initialize(ompt_function_lookup_t lookup, int initial_device_num,
ompt_data_t *tool_data) {
printf("0: NULL_POINTER=%p\n", (void*)NULL);
return 1; //success
}
void ompt_finalize(ompt_data_t* tool_data)
{
printf("0: ompt_event_runtime_shutdown\n");
}
ompt_start_tool_result_t* ompt_start_tool(
unsigned int omp_version,
const char *runtime_version)
{
static ompt_start_tool_result_t ompt_start_tool_result = {&ompt_initialize,&ompt_finalize, 0};
return &ompt_start_tool_result;
}
#endif /* TOOL */
|
the_stack_data/23575400.c | #include <stdio.h>
#include <string.h>
short dp[5009][5009];
char str[5009];
int min(int a, int b);
int main(void)
{
int i, j, len;
scanf("%*d%s", str);
len = strlen(str) - 1;
memset(dp, 0x7f, sizeof(dp));
for (i = 0; i <= len; ++i) {
dp[i][i] = 0;
if (str[i] == str[i + 1])
dp[i][i + 1] = 0;
}
for (i = len; i >= 0; --i) {
for (j = i; j <= len; ++j) {
if (str[i] == str[j] && j - 1 >= 0 && i + 1 <= len)
dp[i][j] = min(dp[i + 1][j - 1], dp[i][j]);
if (i + 1 <= j)
dp[i][j] = min(dp[i + 1][j] + 1, dp[i][j]);
if (j - 1 >= 0)
dp[i][j] = min(dp[i][j - 1] + 1, dp[i][j]);
}
}
printf("%d\n", dp[0][len]);
return 0;
}
int min(int a, int b)
{
return a < b ? a : b;
}
|
the_stack_data/96848.c | /*
* serial.c
*
* Created on: 28 Dec 2019
* Author: wudi
*/
void rs_write(struct tty_struct * tty)
{
}
|
the_stack_data/239906.c | #include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#include <string.h>
void die(const char *message){
if(errno) {
perror(message);
} else {
printf("ERROR: %s\n", message);
}
exit(1);
}
// Function Pointer "(*compare_cb)"
// typedef is used here to create a new type, like int or long
typedef int (*compare_cb)(int a, int b);
/**
Bubble sort funcion it uses compare_cb to sort
**/
int *bubble_sort(int *numbers, int count, compare_cb cmp){ //compare_cb is used to define cmp, remember that we used typedef to create a new type
int temp = 0;
int i = 0;
int j = 0;
int *target = malloc(count * sizeof(int));
if(!target) die("Memory error.");
//memcpy copies part of memory to other part of memory
memcpy(target, numbers, count * sizeof(int));
for(i = 0; i < count; i++){
for(j = 0; j < count - 1; j++){
if(cmp(target[j], target[j+1]) > 0){
temp = target[j+1];
target[j+1] = target[j];
target[j] = temp;
}
}
}
return target;
}
int sorted_order(int a, int b) {
return a - b;
}
int reverse_order(int a, int b) {
return b - a;
}
int strange_order(int a, int b) {
if (a == 0 || b == 0) {
return 0;
} else {
return a % b;
}
}
/**
Used to test what we are sorting correctly
bt doing the sort and printing it out
**/
void test_sorting(int *numbers, int count, compare_cb cmp) {
int i = 0;
int *sorted = bubble_sort(numbers, count, cmp);
if(!sorted) die("Failed to sort as requested.");
for(i = 0; i < count; i++){
printf("%d ", sorted[i]);
}
printf("\n");
free(sorted);
/*
"How to break it" We are testing function pointer, so to demostrated it
we are using the pointer to the funcion do get the code from memory
*/
unsigned char *data = (unsigned char *)cmp;
//Print the code from memory
for(i = 0; i < 25; i++) {
printf("%02x:", data[i]);
}
printf("\n");
}
int main(int argc, char *argv[]){
if(argc < 2) die("USAGE: ex18 5 3 6 1 2");
int count = argc - 1;
int i = 0;
char **inputs = argv + 1;
int *numbers = malloc(count * sizeof(int));
if(!numbers) die("Memory Error.");
for(i = 0; i < count; i++) {
numbers[i] = atoi(inputs[i]);
}
test_sorting(numbers, count, sorted_order);
test_sorting(numbers, count, reverse_order);
test_sorting(numbers, count, strange_order);
return 0;
}
|
the_stack_data/97013351.c | /*
**
** halt.c
**
** $PostgreSQL$
**
** This is used to print out error messages and exit
*/
#include <stdarg.h>
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <errno.h>
/*-------------------------------------------------------------------------
**
** halt - print error message, and call clean up routine or exit
**
**------------------------------------------------------------------------*/
/*VARARGS*/
void
halt(const char *format,...)
{
va_list arg_ptr;
const char *pstr;
void (*sig_func) ();
va_start(arg_ptr, format);
if (strncmp(format, "PERROR", 6) != 0)
vfprintf(stderr, format, arg_ptr);
else
{
for (pstr = format + 6; *pstr == ' ' || *pstr == ':'; pstr++)
;
vfprintf(stderr, pstr, arg_ptr);
perror("");
}
va_end(arg_ptr);
fflush(stderr);
/* call one clean up function if defined */
if ((sig_func = signal(SIGTERM, SIG_DFL)) != SIG_DFL &&
sig_func != SIG_IGN)
(*sig_func) (0);
else if ((sig_func = signal(SIGHUP, SIG_DFL)) != SIG_DFL &&
sig_func != SIG_IGN)
(*sig_func) (0);
else if ((sig_func = signal(SIGINT, SIG_DFL)) != SIG_DFL &&
sig_func != SIG_IGN)
(*sig_func) (0);
else if ((sig_func = signal(SIGQUIT, SIG_DFL)) != SIG_DFL &&
sig_func != SIG_IGN)
(*sig_func) (0);
exit(1);
}
|
the_stack_data/140764196.c | //
// Created by zhangrongxiang on 2017/10/12 16:02
// File server
//
#include <stdio.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <string.h>
#include <unistd.h>
#define BUFSIZE 1024
int main(int argc, char *argv[]) {
int server_sockfd;
int len;
struct sockaddr_in my_addr; //服务器网络地址结构体
struct sockaddr_in remote_addr; //客户端网络地址结构体
int sin_size;
char buf[BUFSIZE]; //数据传送的缓冲区
memset(&my_addr, 0, sizeof(my_addr)); //数据初始化--清零
my_addr.sin_family = AF_INET; //设置为IP通信
my_addr.sin_addr.s_addr = INADDR_ANY;//服务器IP地址--允许连接到所有本地地址上
my_addr.sin_port = htons(8000); //服务器端口号
/*创建服务器端套接字--IPv4协议，面向无连接通信，UDP协议*/
if ((server_sockfd = socket(PF_INET, SOCK_DGRAM, 0)) < 0) {
perror("socket");
return 1;
}
/*将套接字绑定到服务器的网络地址上*/
if (bind(server_sockfd, (struct sockaddr *) &my_addr, sizeof(struct sockaddr)) < 0) {
perror("bind");
return 1;
}
sin_size = sizeof(struct sockaddr_in);
printf("waiting for a packet...\n");
/*接收客户端的数据并将其发送给客户端--recvfrom是无连接的*/
if ((len = recvfrom(server_sockfd, buf, BUFSIZE, 0, (struct sockaddr *) &remote_addr, &sin_size)) < 0) {
perror("recvfrom");
return 1;
}
printf("received packet from %s:\n", inet_ntoa(remote_addr.sin_addr));
buf[len] = '\0';
printf("contents: %s\n", buf);
close(server_sockfd);
return 0;
} |
the_stack_data/37394.c | //file: _insn_test_mula_hs_hs_X0.c
//op=165
#include <stdio.h>
#include <stdlib.h>
void func_exit(void) {
printf("%s\n", __func__);
exit(0);
}
void func_call(void) {
printf("%s\n", __func__);
exit(0);
}
unsigned long mem[2] = { 0xec7e102d827fb085, 0x2fbb511bf652c89f };
int main(void) {
unsigned long a[4] = { 0, 0 };
asm __volatile__ (
"moveli r42, -23610\n"
"shl16insli r42, r42, -23703\n"
"shl16insli r42, r42, 2719\n"
"shl16insli r42, r42, -32635\n"
"moveli r11, 21737\n"
"shl16insli r11, r11, 21508\n"
"shl16insli r11, r11, 4642\n"
"shl16insli r11, r11, -1298\n"
"moveli r45, 16489\n"
"shl16insli r45, r45, 1852\n"
"shl16insli r45, r45, -22328\n"
"shl16insli r45, r45, -20016\n"
"{ mula_hs_hs r42, r11, r45 ; fnop }\n"
"move %0, r42\n"
"move %1, r11\n"
"move %2, r45\n"
:"=r"(a[0]),"=r"(a[1]),"=r"(a[2]));
printf("%016lx\n", a[0]);
printf("%016lx\n", a[1]);
printf("%016lx\n", a[2]);
return 0;
}
|
the_stack_data/118163.c | int x = 42;
int f(void) {
return x;
}
int main(void) {
return f();
}
|
the_stack_data/153267358.c | #include <stdio.h>
#include <string.h>
#define ERROR '0'
#define ARRLEN 100
char repSymbol(char *, size_t);
int main(void) {
//Get the string from user.
char buff[ARRLEN];
puts("Please, enter your line! :");
gets_s(buff, ARRLEN * sizeof(char));
int len = strlen(buff);
//Find repeatable symbol
char resultCh = repSymbol(buff, len);
printf("%c\n", resultCh);
getchar();
return 0;
}
char repSymbol(char *str, size_t len) {
if (1 == len) {
return ERROR;
}
else if (str[len] == str[len-1]) {
return str[len];
}
else {
repSymbol(str, len - 1);
}
} |
the_stack_data/586703.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX 41
int main(void)
{
FILE *fp = NULL;
char words[MAX];
if ((fp = fopen("data.txt", "a+")) == NULL)
{
fprintf(stdout, "Can't open file.\n");
exit(EXIT_FAILURE);
}
puts("Enter words to add to the file; press the #");
puts("key at the beginning of a line to terminate.");
while ((fscanf(stdin, "%40s", words) == 1) && (words[0] != '#'))
fprintf(fp, "%s\n", words);
puts("File contents:");
rewind(fp); // go back to the start of the file
while(fscanf(fp, "%s", words) == 1)
puts(words);
puts("Done!");
if(fclose(fp) != 0)
fprintf(stderr, "Error closing file\n");
return 0;
}
|
the_stack_data/86912.c | // NOTE: Assertions have been autogenerated by utils/update_cc_test_checks.py UTC_ARGS: --function-signature --include-generated-funcs --replace-value-regex "__omp_offloading_[0-9a-z]+_[0-9a-z]+" "reduction_size[.].+[.]" "pl_cond[.].+[.|,]" --prefix-filecheck-ir-name _
// Test target codegen - host bc file has to be created first.
// RUN: %clang_cc1 -verify -fopenmp -x c -triple powerpc64le-unknown-unknown -fopenmp-targets=nvptx64-nvidia-cuda -emit-llvm-bc %s -o %t-ppc-host.bc
// RUN: %clang_cc1 -verify -fopenmp -x c -triple nvptx64-unknown-unknown -fopenmp-targets=nvptx64-nvidia-cuda -emit-llvm %s -fopenmp-is-device -fopenmp-host-ir-file-path %t-ppc-host.bc -o - | FileCheck %s --check-prefix CHECK --check-prefix CHECK-64
// RUN: %clang_cc1 -verify -fopenmp -x c -triple i386-unknown-unknown -fopenmp-targets=nvptx-nvidia-cuda -emit-llvm-bc %s -o %t-x86-host.bc
// RUN: %clang_cc1 -verify -fopenmp -x c -triple nvptx-unknown-unknown -fopenmp-targets=nvptx-nvidia-cuda -emit-llvm %s -fopenmp-is-device -fopenmp-host-ir-file-path %t-x86-host.bc -o - | FileCheck %s --check-prefix CHECK --check-prefix CHECK-32
// expected-no-diagnostics
extern int printf(const char *, ...);
// Check a simple call to printf end-to-end.
int CheckSimple() {
#pragma omp target
{
// printf in master-only basic block.
const char* fmt = "%d %lld %f";
printf(fmt, 1, 2ll, 3.0);
}
return 0;
}
void CheckNoArgs() {
#pragma omp target
{
// printf in master-only basic block.
printf("hello, world!");
}
}
// Check that printf's alloca happens in the entry block, not inside the if
// statement.
int foo;
void CheckAllocaIsInEntryBlock() {
#pragma omp target
{
if (foo) {
printf("%d", 42);
}
}
}
//
//
//
// CHECK-64-LABEL: define {{[^@]+}}@{{__omp_offloading_[0-9a-z]+_[0-9a-z]+}}_CheckSimple_l13
// CHECK-64-SAME: () #[[ATTR0:[0-9]+]] {
// CHECK-64-NEXT: entry:
// CHECK-64-NEXT: [[FMT:%.*]] = alloca i8*, align 8
// CHECK-64-NEXT: [[TMP:%.*]] = alloca [[PRINTF_ARGS:%.*]], align 8
// CHECK-64-NEXT: [[TMP0:%.*]] = call i32 @__kmpc_target_init(%struct.ident_t* @[[GLOB1:[0-9]+]], i8 1, i1 true, i1 true)
// CHECK-64-NEXT: [[EXEC_USER_CODE:%.*]] = icmp eq i32 [[TMP0]], -1
// CHECK-64-NEXT: br i1 [[EXEC_USER_CODE]], label [[USER_CODE_ENTRY:%.*]], label [[WORKER_EXIT:%.*]]
// CHECK-64: user_code.entry:
// CHECK-64-NEXT: store i8* getelementptr inbounds ([11 x i8], [11 x i8]* @.str, i64 0, i64 0), i8** [[FMT]], align 8
// CHECK-64-NEXT: [[TMP1:%.*]] = load i8*, i8** [[FMT]], align 8
// CHECK-64-NEXT: [[TMP2:%.*]] = getelementptr inbounds [[PRINTF_ARGS]], %printf_args* [[TMP]], i32 0, i32 0
// CHECK-64-NEXT: store i32 1, i32* [[TMP2]], align 4
// CHECK-64-NEXT: [[TMP3:%.*]] = getelementptr inbounds [[PRINTF_ARGS]], %printf_args* [[TMP]], i32 0, i32 1
// CHECK-64-NEXT: store i64 2, i64* [[TMP3]], align 8
// CHECK-64-NEXT: [[TMP4:%.*]] = getelementptr inbounds [[PRINTF_ARGS]], %printf_args* [[TMP]], i32 0, i32 2
// CHECK-64-NEXT: store double 3.000000e+00, double* [[TMP4]], align 8
// CHECK-64-NEXT: [[TMP5:%.*]] = bitcast %printf_args* [[TMP]] to i8*
// CHECK-64-NEXT: [[TMP6:%.*]] = call i32 @__llvm_omp_vprintf(i8* [[TMP1]], i8* [[TMP5]], i32 24)
// CHECK-64-NEXT: call void @__kmpc_target_deinit(%struct.ident_t* @[[GLOB1]], i8 1, i1 true)
// CHECK-64-NEXT: ret void
// CHECK-64: worker.exit:
// CHECK-64-NEXT: ret void
//
//
// CHECK-64-LABEL: define {{[^@]+}}@{{__omp_offloading_[0-9a-z]+_[0-9a-z]+}}_CheckNoArgs_l25
// CHECK-64-SAME: () #[[ATTR0]] {
// CHECK-64-NEXT: entry:
// CHECK-64-NEXT: [[TMP0:%.*]] = call i32 @__kmpc_target_init(%struct.ident_t* @[[GLOB1]], i8 1, i1 true, i1 true)
// CHECK-64-NEXT: [[EXEC_USER_CODE:%.*]] = icmp eq i32 [[TMP0]], -1
// CHECK-64-NEXT: br i1 [[EXEC_USER_CODE]], label [[USER_CODE_ENTRY:%.*]], label [[WORKER_EXIT:%.*]]
// CHECK-64: user_code.entry:
// CHECK-64-NEXT: [[TMP1:%.*]] = call i32 @__llvm_omp_vprintf(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @.str1, i64 0, i64 0), i8* null, i32 0)
// CHECK-64-NEXT: call void @__kmpc_target_deinit(%struct.ident_t* @[[GLOB1]], i8 1, i1 true)
// CHECK-64-NEXT: ret void
// CHECK-64: worker.exit:
// CHECK-64-NEXT: ret void
//
//
// CHECK-64-LABEL: define {{[^@]+}}@{{__omp_offloading_[0-9a-z]+_[0-9a-z]+}}_CheckAllocaIsInEntryBlock_l36
// CHECK-64-SAME: (i64 [[FOO:%.*]]) #[[ATTR0]] {
// CHECK-64-NEXT: entry:
// CHECK-64-NEXT: [[FOO_ADDR:%.*]] = alloca i64, align 8
// CHECK-64-NEXT: [[TMP:%.*]] = alloca [[PRINTF_ARGS_0:%.*]], align 8
// CHECK-64-NEXT: store i64 [[FOO]], i64* [[FOO_ADDR]], align 8
// CHECK-64-NEXT: [[CONV:%.*]] = bitcast i64* [[FOO_ADDR]] to i32*
// CHECK-64-NEXT: [[TMP0:%.*]] = call i32 @__kmpc_target_init(%struct.ident_t* @[[GLOB1]], i8 1, i1 true, i1 true)
// CHECK-64-NEXT: [[EXEC_USER_CODE:%.*]] = icmp eq i32 [[TMP0]], -1
// CHECK-64-NEXT: br i1 [[EXEC_USER_CODE]], label [[USER_CODE_ENTRY:%.*]], label [[WORKER_EXIT:%.*]]
// CHECK-64: user_code.entry:
// CHECK-64-NEXT: [[TMP1:%.*]] = load i32, i32* [[CONV]], align 4
// CHECK-64-NEXT: [[TOBOOL:%.*]] = icmp ne i32 [[TMP1]], 0
// CHECK-64-NEXT: br i1 [[TOBOOL]], label [[IF_THEN:%.*]], label [[IF_END:%.*]]
// CHECK-64: if.then:
// CHECK-64-NEXT: [[TMP2:%.*]] = getelementptr inbounds [[PRINTF_ARGS_0]], %printf_args.0* [[TMP]], i32 0, i32 0
// CHECK-64-NEXT: store i32 42, i32* [[TMP2]], align 4
// CHECK-64-NEXT: [[TMP3:%.*]] = bitcast %printf_args.0* [[TMP]] to i8*
// CHECK-64-NEXT: [[TMP4:%.*]] = call i32 @__llvm_omp_vprintf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str2, i64 0, i64 0), i8* [[TMP3]], i32 4)
// CHECK-64-NEXT: br label [[IF_END]]
// CHECK-64: worker.exit:
// CHECK-64-NEXT: ret void
// CHECK-64: if.end:
// CHECK-64-NEXT: call void @__kmpc_target_deinit(%struct.ident_t* @[[GLOB1]], i8 1, i1 true)
// CHECK-64-NEXT: ret void
//
//
//
//
//
// CHECK-32-LABEL: define {{[^@]+}}@{{__omp_offloading_[0-9a-z]+_[0-9a-z]+}}_CheckSimple_l13
// CHECK-32-SAME: () #[[ATTR0:[0-9]+]] {
// CHECK-32-NEXT: entry:
// CHECK-32-NEXT: [[FMT:%.*]] = alloca i8*, align 4
// CHECK-32-NEXT: [[TMP:%.*]] = alloca [[PRINTF_ARGS:%.*]], align 8
// CHECK-32-NEXT: [[TMP0:%.*]] = call i32 @__kmpc_target_init(%struct.ident_t* @[[GLOB1:[0-9]+]], i8 1, i1 true, i1 true)
// CHECK-32-NEXT: [[EXEC_USER_CODE:%.*]] = icmp eq i32 [[TMP0]], -1
// CHECK-32-NEXT: br i1 [[EXEC_USER_CODE]], label [[USER_CODE_ENTRY:%.*]], label [[WORKER_EXIT:%.*]]
// CHECK-32: user_code.entry:
// CHECK-32-NEXT: store i8* getelementptr inbounds ([11 x i8], [11 x i8]* @.str, i32 0, i32 0), i8** [[FMT]], align 4
// CHECK-32-NEXT: [[TMP1:%.*]] = load i8*, i8** [[FMT]], align 4
// CHECK-32-NEXT: [[TMP2:%.*]] = getelementptr inbounds [[PRINTF_ARGS]], %printf_args* [[TMP]], i32 0, i32 0
// CHECK-32-NEXT: store i32 1, i32* [[TMP2]], align 4
// CHECK-32-NEXT: [[TMP3:%.*]] = getelementptr inbounds [[PRINTF_ARGS]], %printf_args* [[TMP]], i32 0, i32 1
// CHECK-32-NEXT: store i64 2, i64* [[TMP3]], align 8
// CHECK-32-NEXT: [[TMP4:%.*]] = getelementptr inbounds [[PRINTF_ARGS]], %printf_args* [[TMP]], i32 0, i32 2
// CHECK-32-NEXT: store double 3.000000e+00, double* [[TMP4]], align 8
// CHECK-32-NEXT: [[TMP5:%.*]] = bitcast %printf_args* [[TMP]] to i8*
// CHECK-32-NEXT: [[TMP6:%.*]] = call i32 @__llvm_omp_vprintf(i8* [[TMP1]], i8* [[TMP5]], i32 24)
// CHECK-32-NEXT: call void @__kmpc_target_deinit(%struct.ident_t* @[[GLOB1]], i8 1, i1 true)
// CHECK-32-NEXT: ret void
// CHECK-32: worker.exit:
// CHECK-32-NEXT: ret void
//
//
// CHECK-32-LABEL: define {{[^@]+}}@{{__omp_offloading_[0-9a-z]+_[0-9a-z]+}}_CheckNoArgs_l25
// CHECK-32-SAME: () #[[ATTR0]] {
// CHECK-32-NEXT: entry:
// CHECK-32-NEXT: [[TMP0:%.*]] = call i32 @__kmpc_target_init(%struct.ident_t* @[[GLOB1]], i8 1, i1 true, i1 true)
// CHECK-32-NEXT: [[EXEC_USER_CODE:%.*]] = icmp eq i32 [[TMP0]], -1
// CHECK-32-NEXT: br i1 [[EXEC_USER_CODE]], label [[USER_CODE_ENTRY:%.*]], label [[WORKER_EXIT:%.*]]
// CHECK-32: user_code.entry:
// CHECK-32-NEXT: [[TMP1:%.*]] = call i32 @__llvm_omp_vprintf(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @.str1, i32 0, i32 0), i8* null, i32 0)
// CHECK-32-NEXT: call void @__kmpc_target_deinit(%struct.ident_t* @[[GLOB1]], i8 1, i1 true)
// CHECK-32-NEXT: ret void
// CHECK-32: worker.exit:
// CHECK-32-NEXT: ret void
//
//
// CHECK-32-LABEL: define {{[^@]+}}@{{__omp_offloading_[0-9a-z]+_[0-9a-z]+}}_CheckAllocaIsInEntryBlock_l36
// CHECK-32-SAME: (i32 [[FOO:%.*]]) #[[ATTR0]] {
// CHECK-32-NEXT: entry:
// CHECK-32-NEXT: [[FOO_ADDR:%.*]] = alloca i32, align 4
// CHECK-32-NEXT: [[TMP:%.*]] = alloca [[PRINTF_ARGS_0:%.*]], align 8
// CHECK-32-NEXT: store i32 [[FOO]], i32* [[FOO_ADDR]], align 4
// CHECK-32-NEXT: [[TMP0:%.*]] = call i32 @__kmpc_target_init(%struct.ident_t* @[[GLOB1]], i8 1, i1 true, i1 true)
// CHECK-32-NEXT: [[EXEC_USER_CODE:%.*]] = icmp eq i32 [[TMP0]], -1
// CHECK-32-NEXT: br i1 [[EXEC_USER_CODE]], label [[USER_CODE_ENTRY:%.*]], label [[WORKER_EXIT:%.*]]
// CHECK-32: user_code.entry:
// CHECK-32-NEXT: [[TMP1:%.*]] = load i32, i32* [[FOO_ADDR]], align 4
// CHECK-32-NEXT: [[TOBOOL:%.*]] = icmp ne i32 [[TMP1]], 0
// CHECK-32-NEXT: br i1 [[TOBOOL]], label [[IF_THEN:%.*]], label [[IF_END:%.*]]
// CHECK-32: if.then:
// CHECK-32-NEXT: [[TMP2:%.*]] = getelementptr inbounds [[PRINTF_ARGS_0]], %printf_args.0* [[TMP]], i32 0, i32 0
// CHECK-32-NEXT: store i32 42, i32* [[TMP2]], align 4
// CHECK-32-NEXT: [[TMP3:%.*]] = bitcast %printf_args.0* [[TMP]] to i8*
// CHECK-32-NEXT: [[TMP4:%.*]] = call i32 @__llvm_omp_vprintf(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @.str2, i32 0, i32 0), i8* [[TMP3]], i32 4)
// CHECK-32-NEXT: br label [[IF_END]]
// CHECK-32: worker.exit:
// CHECK-32-NEXT: ret void
// CHECK-32: if.end:
// CHECK-32-NEXT: call void @__kmpc_target_deinit(%struct.ident_t* @[[GLOB1]], i8 1, i1 true)
// CHECK-32-NEXT: ret void
//
|
the_stack_data/29150.c | #include <pthread.h>
void *malloc(unsigned size);
pthread_mutex_t mutex;
#if 1
void *thread1(void *arg)
{
pthread_mutex_lock(&mutex);
pthread_mutex_unlock(&mutex);
}
#endif
#if 1
void *thread2(void *arg)
{
pthread_mutex_lock(&mutex);
// pthread_mutex_unlock(&mutex);
}
#endif
int main(void)
{
pthread_t id1, id2;
// mutex = (pthread_mutex_t *) malloc(sizeof(pthread_mutex_t));
pthread_mutex_init(&mutex, NULL);
// assert(0);
pthread_create(&id1, NULL, thread1, NULL);
pthread_create(&id2, NULL, thread2, NULL);
return 0;
}
|
the_stack_data/1231251.c | #include <stdio.h>
main(){
int n,i,j;
scanf("%d",&n);
for(i=0;i<n*2-1;i++){
if(i<n){
for(j=0;j<=i;j++)
putchar('*');
for(j=0;j<(n-i)*2-2;j++)
putchar(32);
for(j=0;j<=i;j++)
putchar('*');
}else{
for(j=2*(n-1)-i;j>=0;j--)
putchar('*');
for(j=0;j<(i-n)*2+2;j++)
putchar(32);
for(j=2*(n-1)-i;j>=0;j--)
putchar('*');
}
putchar(10);
}
} |
the_stack_data/173578483.c | /* MMCMP (Zirconia) decompressor.
** Taken from Mmcmp.cpp (ModPlug Tracker source code) and converted
** from C++ to C. libmodplug is public domain, so this file should be
** able to go under BSD 3-clause.
*/
#include <stdint.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
#define MMCMP_COMP 0x0001
#define MMCMP_DELTA 0x0002
#define MMCMP_16BIT 0x0004
#define MMCMP_ABS16 0x0200
#ifdef _MSC_VER
#pragma pack(push)
#pragma pack(1)
#endif
typedef struct MMCMPFILEHEADER
{
uint32_t id_ziRC; // "ziRC"
uint32_t id_ONia; // "ONia"
uint16_t hdrsize;
}
#ifdef __GNUC__
__attribute__ ((packed))
#endif
MMCMPFILEHEADER, *LPMMCMPFILEHEADER;
typedef struct MMCMPHEADER
{
uint16_t version;
uint16_t nblocks;
uint32_t filesize;
uint32_t blktable;
uint8_t glb_comp;
uint8_t fmt_comp;
}
#ifdef __GNUC__
__attribute__ ((packed))
#endif
MMCMPHEADER, *LPMMCMPHEADER;
typedef struct MMCMPBLOCK
{
uint32_t unpk_size;
uint32_t pk_size;
uint32_t xor_chk;
uint16_t sub_blk;
uint16_t flags;
uint16_t tt_entries;
uint16_t num_bits;
}
#ifdef __GNUC__
__attribute__ ((packed))
#endif
MMCMPBLOCK, *LPMMCMPBLOCK;
typedef struct MMCMPSUBBLOCK
{
uint32_t unpk_pos;
uint32_t unpk_size;
}
#ifdef __GNUC__
__attribute__ ((packed))
#endif
MMCMPSUBBLOCK, *LPMMCMPSUBBLOCK;
#ifdef _MSC_VER
#pragma pack(pop)
#endif
typedef struct MMCMPBITBUFFER
{
uint32_t bitcount;
uint32_t bitbuffer;
const uint8_t *pSrc;
const uint8_t *pEnd;
} MMCMPBITBUFFER;
static uint32_t GetBits(MMCMPBITBUFFER *bb, uint32_t nBits)
{
if (!nBits)
return 0;
while (bb->bitcount < 24)
{
bb->bitbuffer |= ((bb->pSrc < bb->pEnd) ? *bb->pSrc++ : 0) << bb->bitcount;
bb->bitcount += 8;
}
uint32_t d = bb->bitbuffer & ((1 << nBits) - 1);
bb->bitbuffer >>= nBits;
bb->bitcount -= nBits;
return d;
}
static const uint8_t MMCMP8BitCommands[8] = { 0x01, 0x03, 0x07, 0x0F, 0x1E, 0x3C, 0x78, 0xF8 };
static const uint8_t MMCMP16BitFetch[16] = { 4, 4, 4, 4, 3, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
static const uint8_t MMCMP8BitFetch[8] = { 3, 3, 3, 3, 2, 1, 0, 0 };
static const uint16_t MMCMP16BitCommands[16] =
{
0x01, 0x03, 0x07, 0x0F, 0x1E, 0x3C, 0x78, 0xF0,
0x1F0, 0x3F0, 0x7F0, 0xFF0, 0x1FF0, 0x3FF0, 0x7FF0, 0xFFF0
};
bool unpackMMCMP(uint8_t **ppMemFile, uint32_t *pdwMemLength)
{
uint32_t dwMemLength = *pdwMemLength;
const uint8_t *lpMemFile = *ppMemFile;
uint8_t *pBuffer;
LPMMCMPFILEHEADER pmfh = (LPMMCMPFILEHEADER)lpMemFile;
LPMMCMPHEADER pmmh = (LPMMCMPHEADER)(lpMemFile+10);
uint32_t *pblk_table;
uint32_t dwFileSize;
if ((dwMemLength < 256) || !pmfh || pmfh->id_ziRC != 0x4352697A || pmfh->id_ONia != 0x61694e4f || pmfh->hdrsize < 14
|| !pmmh->nblocks || pmmh->filesize < 16 || pmmh->filesize > 0x8000000 || pmmh->blktable >= dwMemLength
|| pmmh->blktable + 4*pmmh->nblocks > dwMemLength)
{
return false;
}
dwFileSize = pmmh->filesize;
pBuffer = (uint8_t *)malloc((dwFileSize + 31) & ~15);
if (pBuffer == NULL)
return false;
pblk_table = (uint32_t *)(lpMemFile+pmmh->blktable);
for (uint32_t nBlock = 0; nBlock < pmmh->nblocks; nBlock++)
{
uint32_t dwMemPos = pblk_table[nBlock];
LPMMCMPBLOCK pblk = (LPMMCMPBLOCK)(lpMemFile+dwMemPos);
LPMMCMPSUBBLOCK psubblk = (LPMMCMPSUBBLOCK)(lpMemFile+dwMemPos+20);
if (dwMemPos+20 >= dwMemLength || dwMemPos+20+pblk->sub_blk*8 >= dwMemLength)
break;
dwMemPos += 20+pblk->sub_blk*8;
// Data is not packed
if (!(pblk->flags & MMCMP_COMP))
{
for (uint32_t i = 0; i<pblk->sub_blk; i++)
{
if (psubblk->unpk_pos > dwFileSize || psubblk->unpk_pos+psubblk->unpk_size > dwFileSize)
break;
memcpy(pBuffer+psubblk->unpk_pos, lpMemFile+dwMemPos, psubblk->unpk_size);
dwMemPos += psubblk->unpk_size;
psubblk++;
}
}
else if (pblk->flags & MMCMP_16BIT) // Data is 16-bit packed
{
MMCMPBITBUFFER bb;
uint16_t *pDest = (uint16_t *)(pBuffer + psubblk->unpk_pos);
uint32_t dwSize = psubblk->unpk_size >> 1;
uint32_t dwPos = 0;
uint32_t numbits = pblk->num_bits;
uint32_t subblk = 0, oldval = 0;
bb.bitcount = 0;
bb.bitbuffer = 0;
bb.pSrc = lpMemFile+dwMemPos+pblk->tt_entries;
bb.pEnd = lpMemFile+dwMemPos+pblk->pk_size;
while (subblk < pblk->sub_blk)
{
uint32_t newval = 0x10000;
uint32_t d = GetBits(&bb, numbits+1);
if (d >= MMCMP16BitCommands[numbits])
{
uint32_t nFetch = MMCMP16BitFetch[numbits];
uint32_t newbits = GetBits(&bb, nFetch) + ((d - MMCMP16BitCommands[numbits]) << nFetch);
if (newbits != numbits)
{
numbits = newbits & 0x0F;
}
else
{
d = GetBits(&bb, 4);
if (d == 0x0F)
{
if (GetBits(&bb, 1))
break;
newval = 0xFFFF;
}
else
{
newval = 0xFFF0 + d;
}
}
}
else
{
newval = d;
}
if (newval < 0x10000)
{
newval = (newval & 1) ? (uint32_t)(-(int32_t)((newval+1) >> 1)) : (uint32_t)(newval >> 1);
if (pblk->flags & MMCMP_DELTA)
{
newval += oldval;
oldval = newval;
}
else if (!(pblk->flags & MMCMP_ABS16))
{
newval ^= 0x8000;
}
pDest[dwPos++] = (uint16_t)newval;
}
if (dwPos >= dwSize)
{
subblk++;
dwPos = 0;
dwSize = psubblk[subblk].unpk_size >> 1;
pDest = (uint16_t *)(pBuffer + psubblk[subblk].unpk_pos);
}
}
}
else // Data is 8-bit packed
{
MMCMPBITBUFFER bb;
uint8_t *pDest = pBuffer + psubblk->unpk_pos;
uint32_t dwSize = psubblk->unpk_size;
uint32_t dwPos = 0;
uint32_t numbits = pblk->num_bits;
uint32_t subblk = 0, oldval = 0;
const uint8_t *ptable = lpMemFile+dwMemPos;
bb.bitcount = 0;
bb.bitbuffer = 0;
bb.pSrc = lpMemFile+dwMemPos+pblk->tt_entries;
bb.pEnd = lpMemFile+dwMemPos+pblk->pk_size;
while (subblk < pblk->sub_blk)
{
uint32_t newval = 0x100;
uint32_t d = GetBits(&bb, numbits+1);
if (d >= MMCMP8BitCommands[numbits])
{
uint32_t nFetch = MMCMP8BitFetch[numbits];
uint32_t newbits = GetBits(&bb, nFetch) + ((d - MMCMP8BitCommands[numbits]) << nFetch);
if (newbits != numbits)
{
numbits = newbits & 0x07;
}
else
{
d = GetBits(&bb, 3);
if (d == 7)
{
if (GetBits(&bb, 1))
break;
newval = 0xFF;
}
else
{
newval = 0xF8 + d;
}
}
}
else
{
newval = d;
}
if (newval < 0x100)
{
int32_t n = ptable[newval];
if (pblk->flags & MMCMP_DELTA)
{
n += oldval;
oldval = n;
}
pDest[dwPos++] = (uint8_t)n;
}
if (dwPos >= dwSize)
{
subblk++;
dwPos = 0;
dwSize = psubblk[subblk].unpk_size;
pDest = pBuffer + psubblk[subblk].unpk_pos;
}
}
}
}
*ppMemFile = pBuffer;
*pdwMemLength = dwFileSize;
return true;
}
|
the_stack_data/25138242.c | /*******************************************************************************
*
* Copyright (C) 2014-2018 Wave Computing, Inc.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* 3. Neither the name of the copyright holder nor the names of its
* contributors may be used to endorse or promote products derived from this
* software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*
******************************************************************************/
/*-
* Copyright (c) 2002 Tim J. Robbins.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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.
*/
/* Write a wide character to standard output */
#include <stdio.h>
#include <wchar.h>
#undef putwchar
wint_t putwchar (wchar_t wc)
{
return fputwc (wc, stdout);
}/* putwchar */
|
the_stack_data/120769.c | /**************************************************************
* Copyright (c) Wuzhiyi
* Introduction to Algorithms
*
* 题目: Exercise 10.4-3
* 名称: NONRECURSIVE-PRINT-TREE
* 作者: skanev
* 语言: c
* 内容摘要: 非递归输出二叉树结点关键字
*
* 修改记录:
* 修改日期 版本号 修改人 修改内容
* ------------------------------------------------------------
* 20150709 V1.0 wuzhiyi 创建
**************************************************************/
#define MAX_SIZE 10
struct tree_t {
struct tree_t *left;
struct tree_t *right;
struct tree_t *parent;
int key;
};
typedef struct tree_t tree_t;
void store(int);
void print_tree(tree_t *tree) {
tree_t *stack[MAX_SIZE];
int count = 0;
stack[count++] = tree;
while (count) {
tree = stack[--count];
store(tree->key);
if (tree->right)
stack[count++] = tree->right;
if (tree->left)
stack[count++] = tree->left;
}
}
int keys[MAX_SIZE];
int count = 0;
void reset_storage() {
count = 0;
}
void store(int key) {
keys[count++] = key;
}
|
the_stack_data/184519355.c | // File: 3.1.c
// Author: iBug
#include <stdio.h>
int main(){
float p = 1.0f, r = 0.09f;
int n = 10, i;
for (i = 0; i < n; i ++){
p = p * (1 + r);
}
printf("%f\n", p-1);
return 0;
}
|
the_stack_data/31389022.c | #include <stdio.h>
void insertionsort(int arr[], int n)
{
int i, j, temp;
for(i = 1; i < n; i++){
temp = arr[i];
for(j = i; j > 0 && arr[j-1] > temp; j--){
arr[j] = arr[j-1];
}
arr[j] = temp;
}
}
int main()
{
int i;
int num[] = { 3, 2, 5, 8, 1, 6, 7, 4 };
const int n = 8;
for(i = 0; i < n; i++){
printf("%d ", num[i]);
}
printf("\n");
insertionsort(num, n);
for(i = 0; i < n; i++){
printf("%d ", num[i]);
}
printf("\n");
return 0;
}
|
the_stack_data/95449761.c | #include <stdio.h>
void max_progression_series(int n, int arr[n]);
int main()
{
int n;
printf("\n Enter the number of elements of the array : ");
scanf("%d", &n);
int arr[n];
printf("\n The array elements are : \n");
for (int i = 0; i < n; i ++)
{
scanf("%d", &arr[i]);
}
max_progression_series(n, arr);
}
void max_progression_series(int n, int arr[n])
{
int j = 1, k = 0, index[n], count[n], c = 1;
index[0] = 0;
for (int i = 0; i < n; i ++)
{
if (arr[i + 1] == arr[i] + 1)
{
c ++;
//printf(" %d ",c);
}
else
{
index[j] = i + 1;
j ++;
//printf("%d", index[j]);
count[k] = c;
k ++;
c = 1;
//printf("%d", count[k]);
}
}
int max = -1, ind = -1;
for (int i = 0; i < k; i ++)
{
//printf (" %d ", index[i]);
//printf (" %d ", count[i]);
if (count[i] > max)
{
max = count[i];
ind = i;
}
}
printf("\n The maximum count of the progression series present in that array is %d", max);
int start_index = index[ind];
printf("\n ***********The longest progression series is*******************\n");
for (int i = start_index; i < start_index + count[ind]; i ++)
{
printf("%d ", arr[i]);
}
} |
the_stack_data/84441.c | /*-
* Copyright (c) 2008-2015 Varnish Software AS
* All rights reserved.
*
* Author: Poul-Henning Kamp <[email protected]>
*
* SPDX-License-Identifier: BSD-2-Clause
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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.
*/
#ifdef VTEST_WITH_VTC_VARNISH
#include "config.h"
#include <sys/types.h>
#include <sys/socket.h>
#include <fcntl.h>
#include <fnmatch.h>
#include <inttypes.h>
#include <poll.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "vtc.h"
#include "vapi/vsc.h"
#include "vapi/vsl.h"
#include "vapi/vsm.h"
#include "vcli.h"
#include "vjsn.h"
#include "vre.h"
#include "vsub.h"
#include "vtcp.h"
#include "vtim.h"
struct varnish {
unsigned magic;
#define VARNISH_MAGIC 0x208cd8e3
char *name;
struct vtclog *vl;
VTAILQ_ENTRY(varnish) list;
struct vsb *args;
int fds[4];
pid_t pid;
double syntax;
pthread_t tp;
pthread_t tp_vsl;
int expect_exit;
int cli_fd;
int vcl_nbr;
char *workdir;
char *jail;
char *proto;
struct vsm *vsm_vsl;
struct vsm *vsm_vsc;
struct vsc *vsc;
int has_a_arg;
unsigned vsl_tag_count[256];
volatile int vsl_rec;
volatile int vsl_idle;
};
#define NONSENSE "%XJEIFLH|)Xspa8P"
static VTAILQ_HEAD(, varnish) varnishes =
VTAILQ_HEAD_INITIALIZER(varnishes);
/**********************************************************************
* Ask a question over CLI
*/
static enum VCLI_status_e
varnish_ask_cli(const struct varnish *v, const char *cmd, char **repl)
{
int i;
unsigned retval;
char *r;
if (cmd != NULL) {
vtc_dump(v->vl, 4, "CLI TX", cmd, -1);
i = write(v->cli_fd, cmd, strlen(cmd));
if (i != strlen(cmd) && !vtc_stop)
vtc_fatal(v->vl, "CLI write failed (%s) = %u %s",
cmd, errno, strerror(errno));
i = write(v->cli_fd, "\n", 1);
if (i != 1 && !vtc_stop)
vtc_fatal(v->vl, "CLI write failed (%s) = %u %s",
cmd, errno, strerror(errno));
}
i = VCLI_ReadResult(v->cli_fd, &retval, &r, vtc_maxdur);
if (i != 0 && !vtc_stop)
vtc_fatal(v->vl, "CLI failed (%s) = %d %u %s",
cmd != NULL ? cmd : "NULL", i, retval, r);
vtc_log(v->vl, 3, "CLI RX %u", retval);
vtc_dump(v->vl, 4, "CLI RX", r, -1);
if (repl != NULL)
*repl = r;
else
free(r);
return ((enum VCLI_status_e)retval);
}
/**********************************************************************
*
*/
static void
wait_stopped(const struct varnish *v)
{
char *r = NULL;
enum VCLI_status_e st;
vtc_log(v->vl, 3, "wait-stopped");
while (1) {
st = varnish_ask_cli(v, "status", &r);
if (st != CLIS_OK)
vtc_fatal(v->vl,
"CLI status command failed: %u %s", st, r);
if (!strcmp(r, "Child in state stopped")) {
free(r);
break;
}
free(r);
r = NULL;
(void)usleep(200000);
}
}
/**********************************************************************
*
*/
static void
wait_running(const struct varnish *v)
{
char *r = NULL;
enum VCLI_status_e st;
while (1) {
vtc_log(v->vl, 3, "wait-running");
st = varnish_ask_cli(v, "status", &r);
if (st != CLIS_OK)
vtc_fatal(v->vl,
"CLI status command failed: %u %s", st, r);
if (!strcmp(r, "Child in state stopped"))
vtc_fatal(v->vl,
"Child stopped before running: %u %s", st, r);
if (!strcmp(r, "Child in state running")) {
free(r);
r = NULL;
st = varnish_ask_cli(v, "debug.listen_address", &r);
if (st != CLIS_OK)
vtc_fatal(v->vl,
"CLI status command failed: %u %s", st, r);
free(r);
break;
}
free(r);
r = NULL;
(void)usleep(200000);
}
}
/**********************************************************************
* Varnishlog gatherer thread
*/
static void *
varnishlog_thread(void *priv)
{
struct varnish *v;
struct VSL_data *vsl;
struct vsm *vsm;
struct VSL_cursor *c;
enum VSL_tag_e tag;
uint32_t vxid;
unsigned len;
const char *tagname, *data;
int type, i, opt;
struct vsb *vsb = NULL;
CAST_OBJ_NOTNULL(v, priv, VARNISH_MAGIC);
vsl = VSL_New();
AN(vsl);
vsm = v->vsm_vsl;
c = NULL;
opt = 0;
while (v->fds[1] > 0 || c != NULL) { //lint !e845 bug in flint
if (c == NULL) {
if (vtc_error)
break;
VTIM_sleep(0.1);
(void)VSM_Status(vsm);
c = VSL_CursorVSM(vsl, vsm, opt);
if (c == NULL) {
vtc_log(v->vl, 3, "vsl|%s", VSL_Error(vsl));
VSL_ResetError(vsl);
continue;
}
}
AN(c);
opt = VSL_COPT_TAIL;
while (1) {
i = VSL_Next(c);
if (i != 1)
break;
v->vsl_rec = 1;
tag = VSL_TAG(c->rec.ptr);
vxid = VSL_ID(c->rec.ptr);
if (tag == SLT__Batch)
continue;
tagname = VSL_tags[tag];
len = VSL_LEN(c->rec.ptr);
type = VSL_CLIENT(c->rec.ptr) ?
'c' : VSL_BACKEND(c->rec.ptr) ?
'b' : '-';
data = VSL_CDATA(c->rec.ptr);
v->vsl_tag_count[tag]++;
if (VSL_tagflags[tag] & SLT_F_BINARY) {
if (vsb == NULL)
vsb = VSB_new_auto();
VSB_clear(vsb);
VSB_quote(vsb, data, len, VSB_QUOTE_HEX);
AZ(VSB_finish(vsb));
/* +2 to skip "0x" */
vtc_log(v->vl, 4, "vsl| %10u %-15s %c [%s]",
vxid, tagname, type, VSB_data(vsb) + 2);
} else {
vtc_log(v->vl, 4, "vsl| %10u %-15s %c %.*s",
vxid, tagname, type, (int)len, data);
}
}
if (i == 0) {
/* Nothing to do but wait */
v->vsl_idle++;
if (!(VSM_Status(vsm) & VSM_WRK_RUNNING)) {
/* Abandoned - try reconnect */
VSL_DeleteCursor(c);
c = NULL;
} else {
VTIM_sleep(0.1);
}
} else if (i == -2) {
/* Abandoned - try reconnect */
VSL_DeleteCursor(c);
c = NULL;
} else
break;
}
if (c)
VSL_DeleteCursor(c);
VSL_Delete(vsl);
if (vsb != NULL)
VSB_destroy(&vsb);
return (NULL);
}
/**********************************************************************
* Allocate and initialize a varnish
*/
static struct varnish *
varnish_new(const char *name)
{
struct varnish *v;
struct vsb *vsb;
char buf[1024];
ALLOC_OBJ(v, VARNISH_MAGIC);
AN(v);
REPLACE(v->name, name);
REPLACE(v->jail, "");
v->vl = vtc_logopen("%s", name);
AN(v->vl);
vsb = macro_expandf(v->vl, "${tmpdir}/%s", name);
AN(vsb);
v->workdir = strdup(VSB_data(vsb));
AN(v->workdir);
VSB_destroy(&vsb);
bprintf(buf, "rm -rf %s ; mkdir -p %s", v->workdir, v->workdir);
AZ(system(buf));
v->args = VSB_new_auto();
v->cli_fd = -1;
VTAILQ_INSERT_TAIL(&varnishes, v, list);
return (v);
}
/**********************************************************************
* Delete a varnish instance
*/
static void
varnish_delete(struct varnish *v)
{
CHECK_OBJ_NOTNULL(v, VARNISH_MAGIC);
vtc_logclose(v->vl);
free(v->name);
free(v->jail);
free(v->workdir);
VSB_destroy(&v->args);
if (v->vsc != NULL)
VSC_Destroy(&v->vsc, v->vsm_vsc);
if (v->vsm_vsc != NULL)
VSM_Destroy(&v->vsm_vsc);
if (v->vsm_vsl != NULL)
VSM_Destroy(&v->vsm_vsl);
/*
* We do not delete the workdir, it may contain stuff people
* want (coredumps, shmlog/stats etc), and trying to divine
* "may want" is just too much trouble. Leave it around and
* nuke it at the start of the next test-run.
*/
/* XXX: MEMLEAK (?) */
FREE_OBJ(v);
}
/**********************************************************************
* Varnish listener
*/
static void *
varnish_thread(void *priv)
{
struct varnish *v;
CAST_OBJ_NOTNULL(v, priv, VARNISH_MAGIC);
return (vtc_record(v->vl, v->fds[0], NULL));
}
/**********************************************************************
* Launch a Varnish
*/
static void
varnish_launch(struct varnish *v)
{
struct vsb *vsb, *vsb1;
int i, nfd, asock;
char abuf[128], pbuf[128];
struct pollfd fd[3];
enum VCLI_status_e u;
const char *err;
char *r = NULL;
/* Create listener socket */
asock = VTCP_listen_on(default_listen_addr, NULL, 1, &err);
if (err != NULL)
vtc_fatal(v->vl, "Create CLI listen socket failed: %s", err);
assert(asock > 0);
VTCP_myname(asock, abuf, sizeof abuf, pbuf, sizeof pbuf);
AZ(VSB_finish(v->args));
vtc_log(v->vl, 2, "Launch");
vsb = VSB_new_auto();
AN(vsb);
VSB_cat(vsb, "cd ${pwd} &&");
VSB_printf(vsb, " exec varnishd %s -d -n %s",
v->jail, v->workdir);
VSB_cat(vsb, VSB_data(params_vsb));
if (leave_temp) {
VSB_cat(vsb, " -p debug=+vcl_keep");
VSB_cat(vsb, " -p debug=+vmod_so_keep");
VSB_cat(vsb, " -p debug=+vsm_keep");
}
VSB_cat(vsb, " -l 2m");
VSB_cat(vsb, " -p auto_restart=off");
VSB_cat(vsb, " -p syslog_cli_traffic=off");
VSB_cat(vsb, " -p thread_pool_min=10");
VSB_cat(vsb, " -p debug=+vtc_mode");
VSB_cat(vsb, " -p vsl_mask=+Debug");
VSB_cat(vsb, " -p h2_initial_window_size=1m");
VSB_cat(vsb, " -p h2_rx_window_low_water=64k");
if (!v->has_a_arg) {
VSB_printf(vsb, " -a '%s'", default_listen_addr);
if (v->proto != NULL)
VSB_printf(vsb, ",%s", v->proto);
}
VSB_printf(vsb, " -M '%s %s'", abuf, pbuf);
VSB_printf(vsb, " -P %s/varnishd.pid", v->workdir);
if (vmod_path != NULL)
VSB_printf(vsb, " -p vmod_path=%s", vmod_path);
VSB_printf(vsb, " %s", VSB_data(v->args));
AZ(VSB_finish(vsb));
vtc_log(v->vl, 3, "CMD: %s", VSB_data(vsb));
vsb1 = macro_expand(v->vl, VSB_data(vsb));
AN(vsb1);
VSB_destroy(&vsb);
vsb = vsb1;
vtc_log(v->vl, 3, "CMD: %s", VSB_data(vsb));
AZ(pipe(&v->fds[0]));
AZ(pipe(&v->fds[2]));
v->pid = fork();
assert(v->pid >= 0);
if (v->pid == 0) {
AZ(dup2(v->fds[0], 0));
assert(dup2(v->fds[3], 1) == 1);
assert(dup2(1, 2) == 2);
closefd(&v->fds[0]);
closefd(&v->fds[1]);
closefd(&v->fds[2]);
closefd(&v->fds[3]);
VSUB_closefrom(STDERR_FILENO + 1);
AZ(execl("/bin/sh", "/bin/sh", "-c", VSB_data(vsb), (char*)0));
exit(1);
} else {
vtc_log(v->vl, 3, "PID: %ld", (long)v->pid);
macro_def(v->vl, v->name, "pid", "%ld", (long)v->pid);
macro_def(v->vl, v->name, "name", "%s", v->workdir);
}
closefd(&v->fds[0]);
closefd(&v->fds[3]);
v->fds[0] = v->fds[2];
v->fds[2] = v->fds[3] = -1;
VSB_destroy(&vsb);
AZ(pthread_create(&v->tp, NULL, varnish_thread, v));
/* Wait for the varnish to call home */
memset(fd, 0, sizeof fd);
fd[0].fd = asock;
fd[0].events = POLLIN;
fd[1].fd = v->fds[1];
fd[1].events = POLLIN;
fd[2].fd = v->fds[2];
fd[2].events = POLLIN;
i = poll(fd, 2, vtc_maxdur * 1000 / 3);
vtc_log(v->vl, 4, "CLIPOLL %d 0x%x 0x%x 0x%x",
i, fd[0].revents, fd[1].revents, fd[2].revents);
if (i == 0)
vtc_fatal(v->vl, "FAIL timeout waiting for CLI connection");
if (fd[1].revents & POLLHUP)
vtc_fatal(v->vl, "FAIL debug pipe closed");
if (!(fd[0].revents & POLLIN))
vtc_fatal(v->vl, "FAIL CLI connection wait failure");
nfd = accept(asock, NULL, NULL);
closefd(&asock);
if (nfd < 0)
vtc_fatal(v->vl, "FAIL no CLI connection accepted");
v->cli_fd = nfd;
vtc_log(v->vl, 3, "CLI connection fd = %d", v->cli_fd);
assert(v->cli_fd >= 0);
/* Receive the banner or auth response */
u = varnish_ask_cli(v, NULL, &r);
if (vtc_error)
return;
if (u != CLIS_AUTH)
vtc_fatal(v->vl, "CLI auth demand expected: %u %s", u, r);
bprintf(abuf, "%s/_.secret", v->workdir);
nfd = open(abuf, O_RDONLY);
assert(nfd >= 0);
assert(sizeof abuf >= CLI_AUTH_RESPONSE_LEN + 7);
bstrcpy(abuf, "auth ");
VCLI_AuthResponse(nfd, r, abuf + 5);
closefd(&nfd);
free(r);
r = NULL;
strcat(abuf, "\n");
u = varnish_ask_cli(v, abuf, &r);
if (vtc_error)
return;
if (u != CLIS_OK)
vtc_fatal(v->vl, "CLI auth command failed: %u %s", u, r);
free(r);
v->vsm_vsc = VSM_New();
AN(v->vsm_vsc);
v->vsc = VSC_New();
AN(v->vsc);
assert(VSM_Arg(v->vsm_vsc, 'n', v->workdir) > 0);
AZ(VSM_Attach(v->vsm_vsc, -1));
v->vsm_vsl = VSM_New();
assert(VSM_Arg(v->vsm_vsl, 'n', v->workdir) > 0);
AZ(VSM_Attach(v->vsm_vsl, -1));
AZ(pthread_create(&v->tp_vsl, NULL, varnishlog_thread, v));
}
#define VARNISH_LAUNCH(v) \
do { \
CHECK_OBJ_NOTNULL(v, VARNISH_MAGIC); \
if (v->cli_fd < 0) \
varnish_launch(v); \
if (vtc_error) \
return; \
} while (0)
/**********************************************************************
* Start a Varnish
*/
static void
varnish_listen(const struct varnish *v, char *la)
{
const char *a, *p, *n, *n2;
char m[64], s[256];
unsigned first;
n2 = "";
first = 1;
while (*la != '\0') {
n = la;
la = strchr(la, ' ');
AN(la);
*la = '\0';
a = ++la;
la = strchr(la, ' ');
AN(la);
*la = '\0';
p = ++la;
la = strchr(la, '\n');
AN(la);
*la = '\0';
la++;
AN(*n);
AN(*a);
AN(*p);
if (*p == '-') {
bprintf(s, "%s", a);
a = "0.0.0.0";
p = "0";
} else if (strchr(a, ':')) {
bprintf(s, "[%s]:%s", a, p);
} else {
bprintf(s, "%s:%s", a, p);
}
if (first) {
vtc_log(v->vl, 2, "Listen on %s %s", a, p);
macro_def(v->vl, v->name, "addr", "%s", a);
macro_def(v->vl, v->name, "port", "%s", p);
macro_def(v->vl, v->name, "sock", "%s", s);
first = 0;
}
if (!strcmp(n, n2))
continue;
bprintf(m, "%s_addr", n);
macro_def(v->vl, v->name, m, "%s", a);
bprintf(m, "%s_port", n);
macro_def(v->vl, v->name, m, "%s", p);
bprintf(m, "%s_sock", n);
macro_def(v->vl, v->name, m, "%s", s);
n2 = n;
}
}
static void
varnish_start(struct varnish *v)
{
enum VCLI_status_e u;
char *resp = NULL;
VARNISH_LAUNCH(v);
vtc_log(v->vl, 2, "Start");
u = varnish_ask_cli(v, "start", &resp);
if (vtc_error)
return;
if (u != CLIS_OK)
vtc_fatal(v->vl, "CLI start command failed: %u %s", u, resp);
wait_running(v);
free(resp);
resp = NULL;
u = varnish_ask_cli(v, "debug.xid 999", &resp);
if (vtc_error)
return;
if (u != CLIS_OK)
vtc_fatal(v->vl, "CLI debug.xid command failed: %u %s",
u, resp);
free(resp);
resp = NULL;
u = varnish_ask_cli(v, "debug.listen_address", &resp);
if (vtc_error)
return;
if (u != CLIS_OK)
vtc_fatal(v->vl,
"CLI debug.listen_address command failed: %u %s", u, resp);
varnish_listen(v, resp);
free(resp);
/* Wait for vsl logging to get underway */
while (v->vsl_rec == 0)
VTIM_sleep(.1);
}
/**********************************************************************
* Stop a Varnish
*/
static void
varnish_stop(struct varnish *v)
{
VARNISH_LAUNCH(v);
vtc_log(v->vl, 2, "Stop");
(void)varnish_ask_cli(v, "stop", NULL);
wait_stopped(v);
}
/**********************************************************************
* Cleanup
*/
static void
varnish_cleanup(struct varnish *v)
{
void *p;
/* Close the CLI connection */
closefd(&v->cli_fd);
/* Close the STDIN connection. */
closefd(&v->fds[1]);
/* Wait until STDOUT+STDERR closes */
AZ(pthread_join(v->tp, &p));
closefd(&v->fds[0]);
/* Pick up the VSL thread */
AZ(pthread_join(v->tp_vsl, &p));
vtc_wait4(v->vl, v->pid, v->expect_exit, 0, 0);
v->pid = 0;
}
/**********************************************************************
* Wait for a Varnish
*/
static void
varnish_wait(struct varnish *v)
{
if (v->cli_fd < 0)
return;
vtc_log(v->vl, 2, "Wait");
if (!vtc_error) {
/* Do a backend.list to log if child is still running */
(void)varnish_ask_cli(v, "backend.list", NULL);
}
/* Then stop it */
varnish_stop(v);
if (varnish_ask_cli(v, "panic.clear", NULL) != CLIS_CANT)
vtc_fatal(v->vl, "Unexpected panic");
varnish_cleanup(v);
}
/**********************************************************************
* Ask a CLI JSON question
*/
static void
varnish_cli_json(struct varnish *v, const char *cli)
{
enum VCLI_status_e u;
char *resp = NULL;
const char *errptr;
struct vjsn *vj;
VARNISH_LAUNCH(v);
u = varnish_ask_cli(v, cli, &resp);
vtc_log(v->vl, 2, "CLI %03u <%s>", u, cli);
if (u != CLIS_OK)
vtc_fatal(v->vl,
"FAIL CLI response %u expected %u", u, CLIS_OK);
vj = vjsn_parse(resp, &errptr);
if (vj == NULL)
vtc_fatal(v->vl, "FAIL CLI, not good JSON: %s", errptr);
vjsn_delete(&vj);
free(resp);
}
/**********************************************************************
* Ask a CLI question
*/
static void
varnish_cli(struct varnish *v, const char *cli, unsigned exp, const char *re)
{
enum VCLI_status_e u;
vre_t *vre = NULL;
char *resp = NULL;
const char *errptr;
int err;
VARNISH_LAUNCH(v);
if (re != NULL) {
vre = VRE_compile(re, 0, &errptr, &err);
if (vre == NULL)
vtc_fatal(v->vl, "Illegal regexp");
}
u = varnish_ask_cli(v, cli, &resp);
vtc_log(v->vl, 2, "CLI %03u <%s>", u, cli);
if (exp != 0 && exp != (unsigned)u)
vtc_fatal(v->vl, "FAIL CLI response %u expected %u", u, exp);
if (vre != NULL) {
err = VRE_exec(vre, resp, strlen(resp), 0, 0, NULL, 0, NULL);
if (err < 1)
vtc_fatal(v->vl, "Expect failed (%d)", err);
VRE_free(&vre);
}
free(resp);
}
/**********************************************************************
* Load a VCL program
*/
static void
varnish_vcl(struct varnish *v, const char *vcl, int fail, char **resp)
{
struct vsb *vsb;
enum VCLI_status_e u;
VARNISH_LAUNCH(v);
vsb = VSB_new_auto();
AN(vsb);
VSB_printf(vsb, "vcl.inline vcl%d << %s\nvcl %.1f;\n%s\n%s\n",
++v->vcl_nbr, NONSENSE, v->syntax, vcl, NONSENSE);
AZ(VSB_finish(vsb));
u = varnish_ask_cli(v, VSB_data(vsb), resp);
if (u == CLIS_OK) {
VSB_clear(vsb);
VSB_printf(vsb, "vcl.use vcl%d", v->vcl_nbr);
AZ(VSB_finish(vsb));
u = varnish_ask_cli(v, VSB_data(vsb), NULL);
}
if (u == CLIS_OK && fail) {
VSB_destroy(&vsb);
vtc_fatal(v->vl, "VCL compilation succeeded expected failure");
} else if (u != CLIS_OK && !fail) {
VSB_destroy(&vsb);
vtc_fatal(v->vl, "VCL compilation failed expected success");
} else if (fail)
vtc_log(v->vl, 2, "VCL compilation failed (as expected)");
VSB_destroy(&vsb);
}
/**********************************************************************
* Load a VCL program prefixed by backend decls for our servers
*/
static void
varnish_vclbackend(struct varnish *v, const char *vcl)
{
struct vsb *vsb, *vsb2;
enum VCLI_status_e u;
VARNISH_LAUNCH(v);
vsb = VSB_new_auto();
AN(vsb);
vsb2 = VSB_new_auto();
AN(vsb2);
VSB_printf(vsb2, "vcl %.1f;\n", v->syntax);
cmd_server_gen_vcl(vsb2);
AZ(VSB_finish(vsb2));
VSB_printf(vsb, "vcl.inline vcl%d << %s\n%s\n%s\n%s\n",
++v->vcl_nbr, NONSENSE, VSB_data(vsb2), vcl, NONSENSE);
AZ(VSB_finish(vsb));
u = varnish_ask_cli(v, VSB_data(vsb), NULL);
if (u != CLIS_OK) {
VSB_destroy(&vsb);
VSB_destroy(&vsb2);
vtc_fatal(v->vl, "FAIL VCL does not compile");
}
VSB_clear(vsb);
VSB_printf(vsb, "vcl.use vcl%d", v->vcl_nbr);
AZ(VSB_finish(vsb));
u = varnish_ask_cli(v, VSB_data(vsb), NULL);
assert(u == CLIS_OK);
VSB_destroy(&vsb);
VSB_destroy(&vsb2);
}
/**********************************************************************
*/
struct dump_priv {
const char *arg;
const struct varnish *v;
};
static int
do_stat_dump_cb(void *priv, const struct VSC_point * const pt)
{
const struct varnish *v;
struct dump_priv *dp;
uint64_t u;
if (pt == NULL)
return (0);
dp = priv;
v = dp->v;
if (strcmp(pt->ctype, "uint64_t"))
return (0);
u = VSC_Value(pt);
if (strcmp(dp->arg, "*")) {
if (fnmatch(dp->arg, pt->name, 0))
return (0);
}
vtc_log(v->vl, 4, "VSC %s %ju", pt->name, (uintmax_t)u);
return (0);
}
static void
varnish_vsc(struct varnish *v, const char *arg)
{
struct dump_priv dp;
VARNISH_LAUNCH(v);
memset(&dp, 0, sizeof dp);
dp.v = v;
dp.arg = arg;
(void)VSM_Status(v->vsm_vsc);
(void)VSC_Iter(v->vsc, v->vsm_vsc, do_stat_dump_cb, &dp);
}
/**********************************************************************
* Check statistics
*/
struct stat_arg {
const char *pattern;
uintmax_t val;
unsigned good;
};
struct stat_priv {
struct stat_arg lhs;
struct stat_arg rhs;
};
static int
stat_match(const char *pattern, const char *name)
{
if (strchr(pattern, '.') == NULL) {
if (fnmatch("MAIN.*", name, 0))
return (FNM_NOMATCH);
name += 5;
}
return (fnmatch(pattern, name, 0));
}
static int
do_expect_cb(void *priv, const struct VSC_point * const pt)
{
struct stat_priv *sp = priv;
if (pt == NULL)
return (0);
if (!sp->lhs.good && stat_match(sp->lhs.pattern, pt->name) == 0) {
AZ(strcmp(pt->ctype, "uint64_t"));
AN(pt->ptr);
sp->lhs.val = VSC_Value(pt);
sp->lhs.good = 1;
}
if (sp->rhs.pattern == NULL) {
sp->rhs.good = 1;
} else if (!sp->rhs.good &&
stat_match(sp->rhs.pattern, pt->name) == 0) {
AZ(strcmp(pt->ctype, "uint64_t"));
AN(pt->ptr);
sp->rhs.val = VSC_Value(pt);
sp->rhs.good = 1;
}
return (sp->lhs.good && sp->rhs.good);
}
/**********************************************************************
*/
static void
varnish_expect(struct varnish *v, char * const *av)
{
struct stat_priv sp;
int good, i, not;
uintmax_t u;
char *l, *p;
VARNISH_LAUNCH(v);
ZERO_OBJ(&sp, sizeof sp);
l = av[0];
not = (*l == '!');
if (not) {
l++;
AZ(av[1]);
} else {
AN(av[1]);
AN(av[2]);
u = strtoumax(av[2], &p, 0);
if (u != UINTMAX_MAX && *p == '\0')
sp.rhs.val = u;
else
sp.rhs.pattern = av[2];
}
sp.lhs.pattern = l;
for (i = 0; i < 50; i++, (void)usleep(100000)) {
(void)VSM_Status(v->vsm_vsc);
sp.lhs.good = sp.rhs.good = 0;
good = VSC_Iter(v->vsc, v->vsm_vsc, do_expect_cb, &sp);
if (!good)
good = -2;
if (good < 0)
continue;
if (not)
vtc_fatal(v->vl, "Found (not expected): %s", l);
good = -1;
if (!strcmp(av[1], "==")) good = (sp.lhs.val == sp.rhs.val);
if (!strcmp(av[1], "!=")) good = (sp.lhs.val != sp.rhs.val);
if (!strcmp(av[1], ">" )) good = (sp.lhs.val > sp.rhs.val);
if (!strcmp(av[1], "<" )) good = (sp.lhs.val < sp.rhs.val);
if (!strcmp(av[1], ">=")) good = (sp.lhs.val >= sp.rhs.val);
if (!strcmp(av[1], "<=")) good = (sp.lhs.val <= sp.rhs.val);
if (good == -1)
vtc_fatal(v->vl, "comparison %s unknown", av[1]);
if (good)
break;
}
if (good == -1) {
vtc_fatal(v->vl, "VSM error: %s", VSM_Error(v->vsm_vsc));
}
if (good == -2) {
if (not) {
vtc_log(v->vl, 2, "not found (as expected): %s", l);
return;
}
vtc_fatal(v->vl, "stats field %s unknown",
sp.lhs.good ? sp.rhs.pattern : sp.lhs.pattern);
}
if (good == 1) {
vtc_log(v->vl, 2, "as expected: %s (%ju) %s %s (%ju)",
av[0], sp.lhs.val, av[1], av[2], sp.rhs.val);
} else {
vtc_fatal(v->vl, "Not true: %s (%ju) %s %s (%ju)",
av[0], sp.lhs.val, av[1], av[2], sp.rhs.val);
}
}
static void
vsl_catchup(struct varnish *v)
{
int vsl_idle;
VARNISH_LAUNCH(v);
vsl_idle = v->vsl_idle;
while (!vtc_error && vsl_idle == v->vsl_idle)
VTIM_sleep(0.1);
}
/* SECTION: varnish varnish
*
* Define and interact with varnish instances.
*
* To define a Varnish server, you'll use this syntax::
*
* varnish vNAME [-arg STRING] [-vcl STRING] [-vcl+backend STRING]
* [-errvcl STRING STRING] [-jail STRING] [-proto PROXY]
*
* The first ``varnish vNAME`` invocation will start the varnishd master
* process in the background, waiting for the ``-start`` switch to actually
* start the child.
*
* Types used in the description below:
*
* PATTERN
* is a 'glob' style pattern (ie: fnmatch(3)) as used in shell filename
* expansion.
*
* Arguments:
*
* vNAME
* Identify the Varnish server with a string, it must starts with 'v'.
*
* \-arg STRING
* Pass an argument to varnishd, for example "-h simple_list".
*
* \-vcl STRING
* Specify the VCL to load on this Varnish instance. You'll probably
* want to use multi-lines strings for this ({...}).
*
* \-vcl+backend STRING
* Do the exact same thing as -vcl, but adds the definition block of
* known backends (ie. already defined).
*
* \-errvcl STRING1 STRING2
* Load STRING2 as VCL, expecting it to fail, and Varnish to send an
* error string matching STRING2
*
* \-jail STRING
* Look at ``man varnishd`` (-j) for more information.
*
* \-proto PROXY
* Have Varnish use the proxy protocol. Note that PROXY here is the
* actual string.
*
* You can decide to start the Varnish instance and/or wait for several events::
*
* varnish vNAME [-start] [-wait] [-wait-running] [-wait-stopped]
*
* \-start
* Start the child process.
*
* Once successfully started, the following macros are available for
* the default listen address: ``${vNAME_addr}``, ``${vNAME_port}``
* and ``${vNAME_sock}``. Additional macros are available, including
* the listen address name for each address vNAME listens to, like for
* example: ``${vNAME_a0_addr}``.
*
* \-stop
* Stop the child process.
*
* \-syntax
* Set the VCL syntax level for this command (default: 4.1)
*
* \-wait
* Wait for that instance to terminate.
*
* \-wait-running
* Wait for the Varnish child process to be started.
*
* \-wait-stopped
* Wait for the Varnish child process to stop.
*
* \-cleanup
* Once Varnish is stopped, clean everything after it. This is only used
* in very few tests and you should never need it.
*
* \-expectexit NUMBER
* Expect varnishd to exit(3) with this value
*
* Once Varnish is started, you can talk to it (as you would through
* ``varnishadm``) with these additional switches::
*
* varnish vNAME [-cli STRING] [-cliok STRING] [-clierr STRING]
* [-clijson STRING]
*
* \-cli STRING|-cliok STRING|-clierr STATUS STRING|-cliexpect REGEXP STRING
* All four of these will send STRING to the CLI, the only difference
* is what they expect the result to be. -cli doesn't expect
* anything, -cliok expects 200, -clierr expects STATUS, and
* -cliexpect expects the REGEXP to match the returned response.
*
* \-clijson STRING
* Send STRING to the CLI, expect success (CLIS_OK/200) and check
* that the response is parsable JSON.
*
* It is also possible to interact with its shared memory (as you would
* through tools like ``varnishstat``) with additional switches:
*
* \-expect \!PATTERN|PATTERN OP NUMBER|PATTERN OP PATTERN
* Look into the VSM and make sure the first VSC counter identified by
* PATTERN has a correct value. OP can be ==, >, >=, <, <=. For
* example::
*
* varnish v1 -expect SM?.s1.g_space > 1000000
* varnish v1 -expect cache_hit >= cache_hit_grace
*
* In the \! form the test fails if a counter matches PATTERN.
*
* The ``MAIN.`` namespace can be omitted from PATTERN.
*
* The test takes up to 5 seconds before timing out.
*
* \-vsc PATTERN
* Dump VSC counters matching PATTERN.
*
* \-vsl_catchup
* Wait until the logging thread has idled to make sure that all
* the generated log is flushed
*/
void
cmd_varnish(CMD_ARGS)
{
struct varnish *v, *v2;
(void)priv;
if (av == NULL) {
/* Reset and free */
VTAILQ_FOREACH_SAFE(v, &varnishes, list, v2) {
if (v->cli_fd >= 0)
varnish_wait(v);
VTAILQ_REMOVE(&varnishes, v, list);
varnish_delete(v);
}
return;
}
AZ(strcmp(av[0], "varnish"));
av++;
VTC_CHECK_NAME(vl, av[0], "Varnish", 'v');
VTAILQ_FOREACH(v, &varnishes, list)
if (!strcmp(v->name, av[0]))
break;
if (v == NULL)
v = varnish_new(av[0]);
av++;
v->syntax = 4.1;
for (; *av != NULL; av++) {
if (vtc_error)
break;
if (!strcmp(*av, "-arg")) {
AN(av[1]);
AZ(v->pid);
VSB_cat(v->args, " ");
VSB_cat(v->args, av[1]);
if (av[1][0] == '-' && av[1][1] == 'a')
v->has_a_arg = 1;
av++;
continue;
}
if (!strcmp(*av, "-cleanup")) {
AZ(av[1]);
varnish_cleanup(v);
continue;
}
if (!strcmp(*av, "-cli")) {
AN(av[1]);
varnish_cli(v, av[1], 0, NULL);
av++;
continue;
}
if (!strcmp(*av, "-clierr")) {
AN(av[1]);
AN(av[2]);
varnish_cli(v, av[2], atoi(av[1]), NULL);
av += 2;
continue;
}
if (!strcmp(*av, "-cliexpect")) {
AN(av[1]);
AN(av[2]);
varnish_cli(v, av[2], 0, av[1]);
av += 2;
continue;
}
if (!strcmp(*av, "-clijson")) {
AN(av[1]);
varnish_cli_json(v, av[1]);
av++;
continue;
}
if (!strcmp(*av, "-cliok")) {
AN(av[1]);
varnish_cli(v, av[1], (unsigned)CLIS_OK, NULL);
av++;
continue;
}
if (!strcmp(*av, "-errvcl")) {
char *r = NULL;
AN(av[1]);
AN(av[2]);
varnish_vcl(v, av[2], 1, &r);
if (strstr(r, av[1]) == NULL)
vtc_fatal(v->vl,
"Did not find expected string: (\"%s\")",
av[1]);
else
vtc_log(v->vl, 3,
"Found expected string: (\"%s\")",
av[1]);
free(r);
av += 2;
continue;
}
if (!strcmp(*av, "-expect")) {
av++;
varnish_expect(v, av);
av += 2;
continue;
}
if (!strcmp(*av, "-expectexit")) {
v->expect_exit = strtoul(av[1], NULL, 0);
av++;
continue;
}
if (!strcmp(*av, "-jail")) {
AN(av[1]);
AZ(v->pid);
REPLACE(v->jail, av[1]);
av++;
continue;
}
if (!strcmp(*av, "-proto")) {
AN(av[1]);
AZ(v->pid);
REPLACE(v->proto, av[1]);
av++;
continue;
}
if (!strcmp(*av, "-start")) {
varnish_start(v);
continue;
}
if (!strcmp(*av, "-stop")) {
varnish_stop(v);
continue;
}
if (!strcmp(*av, "-syntax")) {
AN(av[1]);
v->syntax = strtod(av[1], NULL);
av++;
continue;
}
if (!strcmp(*av, "-vcl")) {
AN(av[1]);
varnish_vcl(v, av[1], 0, NULL);
av++;
continue;
}
if (!strcmp(*av, "-vcl+backend")) {
AN(av[1]);
varnish_vclbackend(v, av[1]);
av++;
continue;
}
if (!strcmp(*av, "-vsc")) {
AN(av[1]);
varnish_vsc(v, av[1]);
av++;
continue;
}
if (!strcmp(*av, "-wait-stopped")) {
wait_stopped(v);
continue;
}
if (!strcmp(*av, "-wait-running")) {
wait_running(v);
continue;
}
if (!strcmp(*av, "-wait")) {
varnish_wait(v);
continue;
}
if (!strcmp(*av, "-vsl_catchup")) {
vsl_catchup(v);
continue;
}
vtc_fatal(v->vl, "Unknown varnish argument: %s", *av);
}
}
#endif /* VTEST_WITH_VTC_VARNISH */
|
the_stack_data/192329892.c | // RUN: clang-cc -emit-llvm < %s | grep '@foo.*global.*addrspace(1)'
// RUN: clang-cc -emit-llvm < %s | grep '@ban.*global.*addrspace(1)'
// RUN: clang-cc -emit-llvm < %s | grep 'load.*addrspace(1)' | count 2
// RUN: clang-cc -emit-llvm < %s | grep 'load.*addrspace(2).. @A'
// RUN: clang-cc -emit-llvm < %s | grep 'load.*addrspace(2).. @B'
int foo __attribute__((address_space(1)));
int ban[10] __attribute__((address_space(1)));
int bar() { return foo; }
int baz(int i) { return ban[i]; }
// Both A and B point into addrspace(2).
__attribute__((address_space(2))) int *A, *B;
void test3() {
*A = *B;
}
|
the_stack_data/117327695.c | /*
* FreeRTOS Kernel V10.2.1
* Copyright (C) 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy of
* this software and associated documentation files (the "Software"), to deal in
* the Software without restriction, including without limitation the rights to
* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
* the Software, and to permit persons to whom the Software is furnished to do so,
* subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
* FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
* COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
* IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
* http://www.FreeRTOS.org
* http://aws.amazon.com/freertos
*
* 1 tab == 4 spaces!
*/
/*
* "Reg test" tasks - These fill the registers with known values, then check
* that each register maintains its expected value for the lifetime of the
* task. Each task uses a different set of values. The reg test tasks execute
* with a very low priority, so get preempted very frequently. A register
* containing an unexpected value is indicative of an error in the context
* switching mechanism.
*/
void vRegTest1Implementation( void ) __attribute__ ((naked));
void vRegTest2Implementation( void ) __attribute__ ((naked));
void vRegTest1Implementation( void )
{
__asm volatile
(
".extern ulRegTest1LoopCounter \n"
"/* Fill the core registers with known values. */ \n"
"mov r0, #100 \n"
"mov r1, #101 \n"
"mov r2, #102 \n"
"mov r3, #103 \n"
"mov r4, #104 \n"
"mov r5, #105 \n"
"mov r6, #106 \n"
"mov r7, #107 \n"
"mov r8, #108 \n"
"mov r9, #109 \n"
"mov r10, #110 \n"
"mov r11, #111 \n"
"mov r12, #112 \n"
"/* Fill the VFP registers with known values. */ \n"
"vmov d0, r0, r1 \n"
"vmov d1, r2, r3 \n"
"vmov d2, r4, r5 \n"
"vmov d3, r6, r7 \n"
"vmov d4, r8, r9 \n"
"vmov d5, r10, r11 \n"
"vmov d6, r0, r1 \n"
"vmov d7, r2, r3 \n"
"vmov d8, r4, r5 \n"
"vmov d9, r6, r7 \n"
"vmov d10, r8, r9 \n"
"vmov d11, r10, r11 \n"
"vmov d12, r0, r1 \n"
"vmov d13, r2, r3 \n"
"vmov d14, r4, r5 \n"
"vmov d15, r6, r7 \n"
"reg1_loop: \n"
"/* Check all the VFP registers still contain the values set above. \n"
"First save registers that are clobbered by the test. */ \n"
"push { r0-r1 } \n"
"vmov r0, r1, d0 \n"
"cmp r0, #100 \n"
"bne reg1_error_loopf \n"
"cmp r1, #101 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d1 \n"
"cmp r0, #102 \n"
"bne reg1_error_loopf \n"
"cmp r1, #103 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d2 \n"
"cmp r0, #104 \n"
"bne reg1_error_loopf \n"
"cmp r1, #105 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d3 \n"
"cmp r0, #106 \n"
"bne reg1_error_loopf \n"
"cmp r1, #107 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d4 \n"
"cmp r0, #108 \n"
"bne reg1_error_loopf \n"
"cmp r1, #109 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d5 \n"
"cmp r0, #110 \n"
"bne reg1_error_loopf \n"
"cmp r1, #111 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d6 \n"
"cmp r0, #100 \n"
"bne reg1_error_loopf \n"
"cmp r1, #101 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d7 \n"
"cmp r0, #102 \n"
"bne reg1_error_loopf \n"
"cmp r1, #103 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d8 \n"
"cmp r0, #104 \n"
"bne reg1_error_loopf \n"
"cmp r1, #105 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d9 \n"
"cmp r0, #106 \n"
"bne reg1_error_loopf \n"
"cmp r1, #107 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d10 \n"
"cmp r0, #108 \n"
"bne reg1_error_loopf \n"
"cmp r1, #109 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d11 \n"
"cmp r0, #110 \n"
"bne reg1_error_loopf \n"
"cmp r1, #111 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d12 \n"
"cmp r0, #100 \n"
"bne reg1_error_loopf \n"
"cmp r1, #101 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d13 \n"
"cmp r0, #102 \n"
"bne reg1_error_loopf \n"
"cmp r1, #103 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d14 \n"
"cmp r0, #104 \n"
"bne reg1_error_loopf \n"
"cmp r1, #105 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d15 \n"
"cmp r0, #106 \n"
"bne reg1_error_loopf \n"
"cmp r1, #107 \n"
"bne reg1_error_loopf \n"
"/* Restore the registers that were clobbered by the test. */ \n"
"pop {r0-r1} \n"
"/* VFP register test passed. Jump to the core register test. */ \n"
"b reg1_loopf_pass \n"
"reg1_error_loopf: \n"
"/* If this line is hit then a VFP register value was found to be incorrect. */ \n"
"b reg1_error_loopf \n"
"reg1_loopf_pass: \n"
"cmp r0, #100 \n"
"bne reg1_error_loop \n"
"cmp r1, #101 \n"
"bne reg1_error_loop \n"
"cmp r2, #102 \n"
"bne reg1_error_loop \n"
"cmp r3, #103 \n"
"bne reg1_error_loop \n"
"cmp r4, #104 \n"
"bne reg1_error_loop \n"
"cmp r5, #105 \n"
"bne reg1_error_loop \n"
"cmp r6, #106 \n"
"bne reg1_error_loop \n"
"cmp r7, #107 \n"
"bne reg1_error_loop \n"
"cmp r8, #108 \n"
"bne reg1_error_loop \n"
"cmp r9, #109 \n"
"bne reg1_error_loop \n"
"cmp r10, #110 \n"
"bne reg1_error_loop \n"
"cmp r11, #111 \n"
"bne reg1_error_loop \n"
"cmp r12, #112 \n"
"bne reg1_error_loop \n"
"/* Everything passed, increment the loop counter. */ \n"
"push { r0-r1 } \n"
"ldr r0, =ulRegTest1LoopCounter \n"
"ldr r1, [r0] \n"
"adds r1, r1, #1 \n"
"str r1, [r0] \n"
"pop { r0-r1 } \n"
"/* Start again. */ \n"
"b reg1_loop \n"
"reg1_error_loop: \n"
"/* If this line is hit then there was an error in a core register value. \n"
"The loop ensures the loop counter stops incrementing. */ \n"
"b reg1_error_loop \n"
"nop "
); /* __asm volatile. */
}
/*-----------------------------------------------------------*/
void vRegTest2Implementation( void )
{
__asm volatile
(
".extern ulRegTest2LoopCounter \n"
"/* Set all the core registers to known values. */ \n"
"mov r0, #-1 \n"
"mov r1, #1 \n"
"mov r2, #2 \n"
"mov r3, #3 \n"
"mov r4, #4 \n"
"mov r5, #5 \n"
"mov r6, #6 \n"
"mov r7, #7 \n"
"mov r8, #8 \n"
"mov r9, #9 \n"
"mov r10, #10 \n"
"mov r11, #11 \n"
"mov r12, #12 \n"
"/* Set all the VFP to known values. */ \n"
"vmov d0, r0, r1 \n"
"vmov d1, r2, r3 \n"
"vmov d2, r4, r5 \n"
"vmov d3, r6, r7 \n"
"vmov d4, r8, r9 \n"
"vmov d5, r10, r11 \n"
"vmov d6, r0, r1 \n"
"vmov d7, r2, r3 \n"
"vmov d8, r4, r5 \n"
"vmov d9, r6, r7 \n"
"vmov d10, r8, r9 \n"
"vmov d11, r10, r11 \n"
"vmov d12, r0, r1 \n"
"vmov d13, r2, r3 \n"
"vmov d14, r4, r5 \n"
"vmov d15, r6, r7 \n"
"reg2_loop: \n"
"/* Check all the VFP registers still contain the values set above. \n"
"First save registers that are clobbered by the test. */ \n"
"push { r0-r1 } \n"
"vmov r0, r1, d0 \n"
"cmp r0, #-1 \n"
"bne reg2_error_loopf \n"
"cmp r1, #1 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d1 \n"
"cmp r0, #2 \n"
"bne reg2_error_loopf \n"
"cmp r1, #3 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d2 \n"
"cmp r0, #4 \n"
"bne reg2_error_loopf \n"
"cmp r1, #5 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d3 \n"
"cmp r0, #6 \n"
"bne reg2_error_loopf \n"
"cmp r1, #7 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d4 \n"
"cmp r0, #8 \n"
"bne reg2_error_loopf \n"
"cmp r1, #9 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d5 \n"
"cmp r0, #10 \n"
"bne reg2_error_loopf \n"
"cmp r1, #11 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d6 \n"
"cmp r0, #-1 \n"
"bne reg2_error_loopf \n"
"cmp r1, #1 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d7 \n"
"cmp r0, #2 \n"
"bne reg2_error_loopf \n"
"cmp r1, #3 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d8 \n"
"cmp r0, #4 \n"
"bne reg2_error_loopf \n"
"cmp r1, #5 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d9 \n"
"cmp r0, #6 \n"
"bne reg2_error_loopf \n"
"cmp r1, #7 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d10 \n"
"cmp r0, #8 \n"
"bne reg2_error_loopf \n"
"cmp r1, #9 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d11 \n"
"cmp r0, #10 \n"
"bne reg2_error_loopf \n"
"cmp r1, #11 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d12 \n"
"cmp r0, #-1 \n"
"bne reg2_error_loopf \n"
"cmp r1, #1 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d13 \n"
"cmp r0, #2 \n"
"bne reg2_error_loopf \n"
"cmp r1, #3 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d14 \n"
"cmp r0, #4 \n"
"bne reg2_error_loopf \n"
"cmp r1, #5 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d15 \n"
"cmp r0, #6 \n"
"bne reg2_error_loopf \n"
"cmp r1, #7 \n"
"bne reg2_error_loopf \n"
"/* Restore the registers that were clobbered by the test. */ \n"
"pop {r0-r1} \n"
"/* VFP register test passed. Jump to the core register test. */ \n"
"b reg2_loopf_pass \n"
"reg2_error_loopf: \n"
"/* If this line is hit then a VFP register value was found to be \n"
"incorrect. */ \n"
"b reg2_error_loopf \n"
"reg2_loopf_pass: \n"
"cmp r0, #-1 \n"
"bne reg2_error_loop \n"
"cmp r1, #1 \n"
"bne reg2_error_loop \n"
"cmp r2, #2 \n"
"bne reg2_error_loop \n"
"cmp r3, #3 \n"
"bne reg2_error_loop \n"
"cmp r4, #4 \n"
"bne reg2_error_loop \n"
"cmp r5, #5 \n"
"bne reg2_error_loop \n"
"cmp r6, #6 \n"
"bne reg2_error_loop \n"
"cmp r7, #7 \n"
"bne reg2_error_loop \n"
"cmp r8, #8 \n"
"bne reg2_error_loop \n"
"cmp r9, #9 \n"
"bne reg2_error_loop \n"
"cmp r10, #10 \n"
"bne reg2_error_loop \n"
"cmp r11, #11 \n"
"bne reg2_error_loop \n"
"cmp r12, #12 \n"
"bne reg2_error_loop \n"
"/* Increment the loop counter to indicate this test is still functioning \n"
"correctly. */ \n"
"push { r0-r1 } \n"
"ldr r0, =ulRegTest2LoopCounter \n"
"ldr r1, [r0] \n"
"adds r1, r1, #1 \n"
"str r1, [r0] \n"
"/* Yield to increase test coverage. */ \n"
"movs r0, #0x01 \n"
"ldr r1, =0xe000ed04 /*NVIC_INT_CTRL */ \n"
"lsl r0, r0, #28 /* Shift to PendSV bit */ \n"
"str r0, [r1] \n"
"dsb \n"
"pop { r0-r1 } \n"
"/* Start again. */ \n"
"b reg2_loop \n"
"reg2_error_loop: \n"
"/* If this line is hit then there was an error in a core register value. \n"
"This loop ensures the loop counter variable stops incrementing. */ \n"
"b reg2_error_loop \n"
); /* __asm volatile */
}
/*-----------------------------------------------------------*/
|
the_stack_data/64107.c | #include <sys/types.h>
#include <pthread.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
void *PrintHello(void *threadnum) {
sleep(1);
printf("Thread nº %d tid: %ld\n",*((int*) threadnum), pthread_self());
pthread_exit(NULL);
}
int main(int argc, char* argv[]) {
if(argc != 2) {
printf("Usage: %s <num_thread>\n",argv[0]);
exit(1);
}
int num = atoi(argv[1]);
pthread_t threads[num];
int t[num];
for(int i =0; i< num; i++) {
t[i] =i;
printf("Creating thread %d\n", t[i]);
pthread_create(&threads[i], NULL, PrintHello, (void *)&t[i]);
}
pthread_exit(0);
} |
the_stack_data/43641.c | void kernel_jacobi_1d(int tsteps,
int n,
float A[ n + 0],
float B[ n + 0])
{
int t, i;
#pragma scop
for (t = 0; t < tsteps; t++)
{
for (i = 1; i < n - 1; i++)
B[i] = 0.33333 * (A[i-1] + A[i] + A[i + 1]);
for (i = 1; i < n - 1; i++)
A[i] = 0.33333 * (B[i-1] + B[i] + B[i + 1]);
}
#pragma endscop
}
|
the_stack_data/362868.c | #include <stdio.h>
#include <stdlib.h>
#define Size 4
typedef struct Table
{
int * head;//声明一个名为head的长度不定的数组, 动态数组
int length;//记录当前顺序表的长度
int size;//记录顺序表分配的存储容量
} table;
table initTable()
{
table t;
t.head = (int *)malloc(Size*sizeof(int));//构造一个空的顺序表,动态存储空间
if (!t.head)
{
printf("初始化失败");
exit(0);
}
t.length = 0;//空表的长度初始化为0
t.size = Size;//空表的初始存储空间为Size
return t;
}
//插入函数,插入elem, add为位置
table addTable(table t, int elem, int add)
{
//插入的元素位置比整张表的长度还大1,
//插入的位置不存在
if (add > t.length+1 || add<1)
{
printf("插入位置有问题");
return t;
}
if (t.length>=t.size)
{
//做插入操作时,查看顺序表是否有多余的存储空间提供给插入的元素,没有则申请
t.head=(int *)realloc(t.head, (t.size+1)*sizeof(int));
if (!t.head)
{
printf("存储分配失败");
}
t.size += 1;
}
//插入操作,从插入位置开始的后续元素,逐个后移
for (int i = t.length-1; i>=add-i; i--)
{
t.head[i+1] = t.head[i];
}
t.head[add-1] = elem;
//添加了元素,长度+1
t.length++;
return t;
}
table delTable(table t, int add)
{
if (add>t.length || add<1)
{
printf("被删除的位置有误");
exit(0);
}
for (int i=add; i<t.length; i++)
{
t.head[i-1] = t.head[i];
}
t.length --;
return t;
}
//查找函数,elem表示要查找的数据元素的值
int selectTable(table t, int elem)
{
for (int i=0; i<t.length; i++)
{
if (t.head[i] == elem)
{
return i+1;
}
}
return -1;//失败则返回-1
}
//更改函数,elem->newElem
table amendTable(table t,int elem, int newElem)
{
int add = selectTable(t, elem);
t.head[add - 1] = newElem;//返回的是元素在顺序表中的位置,-1就是该元素在数组中的下标
return t;
}
void displayTable(table t)
{
for (int i=0; i<t.length; i++)
{
printf("%d", t.head[i]);
}
printf("\n");
printf("%d \n", t.length);
}
int main()
{
table t1=initTable();
for (int i=1; i<=Size; i++)
{
t1.head[i-1] = i;
t1.length++;//在这里给length赋值
}
printf("原顺序表: \n");
displayTable(t1);
printf("删除元素1: \n");
t1=delTable(t1, 1);
displayTable(t1);
printf("在第二的位置插入元素5: \n");
t1=addTable(t1, 5, 2);
displayTable(t1);
printf("查找元素3的位置: \n");
int add=selectTable(t1, 3);
printf("%d \n", add);
printf("将元素3改为元素6: \n");
t1=amendTable(t1, 3, 6);
displayTable(t1);
return 0;
} |
the_stack_data/57949669.c | /**
* @file: Write a program that console logs the nubers from 1 to n.
* But for multiples of three print "fizz" instead of the number and for the multiples of five print "buzz".
* For numbers which are multiples of both three and five print "fizzbuzz" .Make use of functions and methods where necessary.
**/
#include <stdio.h> //for I/O operations.
//prototype
void fizzBuzz(int );
int main(void){
int n;
printf("Enter number: ");
scanf("%d", &n);
fizzBuzz(n);
return 0;
}
/**
* @brief: Prints numbers from 1 to n in the form above
* @param n: stop interger.
* @return: void.
**/
void fizzBuzz(int n){
for(int i = 1; i <= n; i++){
if (i % 3 == 0 && i % 5 == 0)
printf("fizzbuzz\n");
else if (i % 3 == 0)
printf("fizz\n");
else if(i % 5 == 0)
printf("buzz\n");
else
printf("%d\n", i);
}
} |
the_stack_data/155134.c | /* Pipe to a Subprocess
Copyright (C) 1991-2015 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 2
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, if not, see <http://www.gnu.org/licenses/>.
*/
#include <stdio.h>
#include <stdlib.h>
void
write_data (FILE * stream)
{
int i;
for (i = 0; i < 100; i++)
fprintf (stream, "%d\n", i);
if (ferror (stream))
{
fprintf (stderr, "Output to stream failed.\n");
exit (EXIT_FAILURE);
}
}
/*@group*/
int
main (void)
{
FILE *output;
output = popen ("more", "w");
if (!output)
{
fprintf (stderr,
"incorrect parameters or too many files.\n");
return EXIT_FAILURE;
}
write_data (output);
if (pclose (output) != 0)
{
fprintf (stderr,
"Could not run more or other error.\n");
}
return EXIT_SUCCESS;
}
/*@end group*/
|
the_stack_data/5582.c | extern void __VERIFIER_error() __attribute__ ((__noreturn__));
extern void __VERIFIER_assume(int);
void __VERIFIER_assert(int cond) { if(!(cond)) { ERROR: __VERIFIER_error(); } }
extern int __VERIFIER_nondet_int(void);
int SIZE;
int main()
{
SIZE = __VERIFIER_nondet_int();
if(SIZE <= 0) return 1;
int i;
int a[SIZE];
long long sum[1];
sum[0]=0;
for(i = 0; i < SIZE; i++)
{
a[i] = __VERIFIER_nondet_int();
}
for(i = 0; i < SIZE; i++)
{
sum[0] = sum[0] + a[i];
}
for(i = 0; i < SIZE; i++)
{
sum[0] = sum[0] + a[i];
}
for(i = 0; i < SIZE; i++)
{
sum[0] = sum[0] - a[i];
}
for(i = 0; i < SIZE; i++)
{
sum[0] = sum[0] - a[i];
}
__VERIFIER_assert(sum[0] == 0);
return 1;
}
|
the_stack_data/920857.c | /*************************************************************************
> File Name: udp_server.c
> Author: Miko Song
> Mail: [email protected]
> Created Time: Tue 14 Mar 2017 11:16:57 PM PDT
************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#include <string.h>
#include <sys/types.h>
#include <netinet/in.h>
#include <sys/socket.h>
#include <sys/wait.h>
#define MYPORT 3490
void main()
{
int sockfd;
struct sockaddr_in my_addr;
struct sockaddr_in their_addr;
int sin_size, retval;
char buf[128];
if ((sockfd = socket(AF_INET, SOCK_DGRAM, 0)) == -1) {
perror("socket");
exit(1);
}
my_addr.sin_family = AF_INET;
my_addr.sin_port = htons(MYPORT);
my_addr.sin_addr.s_addr = INADDR_ANY;
bzero(&(my_addr.sin_zero), 8);
if (bind(sockfd, (struct sockaddr *)&my_addr, sizeof(my_addr)) == -1) {
perror("bind");
exit(1);
}
while(1) {
retval = recvfrom(sockfd, buf, 128, 0, (struct sockaddr *)&their_addr, &sin_size);
printf("Received datagram from %d \n",inet_ntoa(their_addr.sin_addr));
if (retval == 0) {
perror ("recvfrom");
close(sockfd);
break;
}
retval = sendto(sockfd, buf, 128, 0, (struct sockaddr *)&their_addr, sin_size);
}
}
|
the_stack_data/193894101.c | /*
Pointers on c - ch9, ex11
the_count.c - count occurances of 'the' on standard input assuming:
-- words separated by one or more whitespace chars
-- input lines less than 100 lines
author: nicolas miller <[email protected]>
*/
#include <stdio.h>
#define BUFFSIZE 100
int matches(char *str, char *the) {
while(*the != '\0') {
if(*str != *the)
return 0;
str++;
the++;
}
/* only match if bounded by space or null on right */
if(!isspace(*str) || *str == '\0')
return 0;
return 1;
}
int the_count(char *str)
{
int count = 0;
while(*str != '\0') {
if(matches(str, "the"))
count++;
while(!isspace(*str)) /* skip over rest of word */
str++;
while(isspace(*str)) /* skip over space between words */
str++;
}
return count;
}
int main(int argc, char* argv[])
{
char buffer[BUFFSIZE];
while(fgets(buffer, BUFFSIZE, stdin) != NULL) {
printf("the_count: %d\n", the_count(buffer));
}
return 1;
}
|
the_stack_data/12981.c | // infix to prefix expression.
# include <stdio.h>
# include <string.h>
// variables are used in the function.
char opr[25],out[25],ch;
int topopr = -1,topout = -1;
// operation for the operator stack
void pushopr(char ele){
if (topopr==24)
printf("\nStack overflow.");
else{
topopr++;
opr[topopr]=ele;
}
}
char popopr(){
if (topopr!=-1){
ch=opr[topopr];
topopr--;
}
return ch;
}
char peepopr(){
if (topopr!=-1)
ch = opr[topopr];
return ch;
}
void displayopr(){
printf("\nOperator Stack...");
for (int i = 0; i<=topopr; i++)
printf("| %c",opr[i]);
}
// operation for the output stack.
void pushout(char ele){
if (topout==24)
printf("\nStack overflow.");
else{
topout++;
out[topout]=ele;
}
}
void displayout(){
int i=0;
printf("\nOutput Stack...");
for (i = 0; i<=topout; i++)
printf("| %c",out[i]);
}
// checking the priority of the operator.
int priority(char ele){
switch (ele)
{
case '^':
return 3;
case '*':
case '/':
return 2;
case '+':
case '-':
return 1;
}
return -1;
}
void main(){
char infix[25],ele,popele;
printf("Enter the infix expression : ");
scanf("%s",infix);
int i=strlen(infix)-1;
while (i>=0)
{
ele = infix[i];
if (ele==')'){
pushopr(ele);
}
else if (ele=='('){
while (peepopr()!=')') // pop element upto but excluding )
{
popele = popopr();
pushout(popele);
}
// deleating the left bracket.
popopr();
}
else if (ele=='^'||ele=='+'||ele=='/'||ele=='+'||ele=='-'){
if (topopr>=0){
while (priority(peepopr())>=priority(ele) && topopr!=-1)
{
popele = popopr();
// popping out the operator with lower priority
pushout(popele);
}
}
// push the element in the operator stack which has greater priority.
pushopr(ele);
}
else{
pushout(ele);
}
displayopr();
displayout();
i--;
}
if (topopr!=-1){
while (topopr!=-1)
{
popele = popopr();
pushout(popele);
}
}
printf("\nPrefix expression = %s",strrev(out));
}
|
the_stack_data/43889024.c | /*
* Runawk lite version 0.30.0 by Jim Pryor
* https://github.com/dubiousjim/awkenough
* Adapted from Runawk 1.4.0 by Aleksey Cheusov
* http://runawk.sourceforge.net/
* Released under the MIT license; see LICENSE
* Date: Fri May 4 01:04:30 EDT 2012
*/
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include <stdio.h>
#include <unistd.h>
#include <sys/stat.h>
#include <limits.h>
#include <signal.h>
#include <sys/wait.h>
#ifndef AWK
#define AWK "/usr/bin/awk"
#define AWK2 NULL
#else
#ifndef AWK2
#define AWK2 NULL
#endif
#endif
#define VERSION "0.30.0"
static char temp_fn [PATH_MAX] = "/tmp/runawk.XXXXXX";
static int temp_fn_created = 0;
typedef struct {
size_t size;
size_t allocated;
char **contents;
} array_t;
static struct {
int argc;
char ** argv;
array_t array;
} shebang;
static void array_init (array_t * array) {
array->size = 0;
array->allocated = 0;
array->contents = NULL;
}
static void array_push (array_t * array, char *item) {
if (array->allocated == array->size) {
array->allocated = array->allocated * 4 / 3 + 100;
array->contents = realloc (array->contents,
array->allocated * sizeof (*array->contents));
}
array->contents [array->size++] = item;
}
static void array_pushdup (array_t * array, const char *item) {
char *d = (item ? strdup (item) : NULL);
array_push (array, d);
}
static void array_free (array_t * array) {
size_t i;
for (i=0; i < array->size; ++i) {
if (array->contents [i]) {
free (array->contents [i]);
array->contents [i] = NULL;
}
}
if (array->contents)
free (array->contents);
array->contents = NULL;
array->size = 0;
array->allocated = 0;
}
static void die (int status);
static char *xstrdup (const char *s) {
char *ret = strdup (s);
if (!ret) {
perror ("runawk: strdup(3) failed");
die (33);
}
return ret;
}
/*
static void *xmalloc (size_t size) {
char *ret = malloc (size);
if (!ret) {
perror ("runawk: malloc(3) failed");
die (33);
}
return ret;
}
*/
/* also passes gawk's `--exec file`, and any unrecognized long options without arguments that precede -- */
static void usage (void) {
puts ("\
Usage: runawk [OPTIONS] file [arguments ...]\n\
runawk [OPTIONS] -e 'script' [arguments...]\n\
wrapper for " AWK " interpreter\n\
Author: Jim Pryor <[email protected]>\n\
Version: " VERSION "\n\
\n\
Options:\n\
-F sep assign FS=sep\n\
-v var=value assign var=value\n\
-f|--file file.awk load awk library files\n\
-e|--source 'script' program\n\
--stdin process stdin after arguments...\n\
--version show version number and exit\n\
--help show this message and exit\n\
");
}
static void version (void) {
printf ("runawk %s written by Aleksey Cheusov and Jim Pryor\n", VERSION);
}
static pid_t awk_pid = -1;
static int killing_sig = 0;
static char cwd [PATH_MAX];
static const char *interpreter = AWK;
static int add_stdin = 0;
static array_t new_argv;
static int files = 0;
static int execing = 0;
static void die (int status) {
if (temp_fn_created)
unlink (temp_fn);
if (killing_sig)
exit (128 + killing_sig);
else
exit (status);
}
static void handler (int sig) {
killing_sig = sig;
if (awk_pid != -1) {
kill (awk_pid, sig);
}
}
static void set_sig_handler (void) {
static const int sigs [] = {
SIGINT, SIGQUIT, SIGTERM,
SIGHUP, SIGPIPE
};
struct sigaction sa;
size_t i;
sa.sa_handler = handler;
sigemptyset (&sa.sa_mask);
sa.sa_flags = 0;
for (i=0; i < sizeof (sigs)/sizeof (sigs [0]); ++i) {
int sig = sigs [i];
sigaction (sig, &sa, NULL);
}
}
static void add_file (const char *dir, const char *name, int is_execing) {
/* add to queue */
(void) dir;
array_pushdup (&new_argv, is_execing ? "--exec" : "-f");
array_pushdup (&new_argv, name);
files = 1;
}
static void add_buffer (const char *buffer, size_t len) {
int fd = -1;
if (files == 0) {
array_pushdup (&new_argv, "--");
array_pushdup (&new_argv, buffer);
} else {
fd = mkstemp (temp_fn);
temp_fn_created = 1;
if (fd == -1) {
perror ("runawk: mkstemp(3) failed");
die (40);
}
if (write (fd, buffer, len) != (ssize_t) len) {
perror ("runawk: write(2) failed");
die (40);
}
if (close (fd)) {
perror ("runawk: close(2) failed");
die (40);
}
/* add to queue */
array_pushdup (&new_argv, "-f");
array_pushdup (&new_argv, temp_fn);
files = 1;
}
}
int main (int argc, char **argv) {
const char *progname = NULL;
const char *script = NULL;
int child_status = 0;
size_t i;
array_init (&new_argv);
set_sig_handler ();
/* discard runawk's own ARGV[0] */
--argc, ++argv;
if (argc == 0) {
usage ();
return 30;
}
/* cwd */
if (!getcwd (cwd, sizeof (cwd))) {
perror ("runawk: getcwd (3) failed");
die (32);
}
array_pushdup (&new_argv, NULL); /* will fill in progname later */
if (AWK2) {
array_pushdup (&new_argv, AWK2);
}
/* need to parse a run-together shebang line? */
if (argc >= 2 && argv [0][0] == '-' && argv[1][0] != '-' && strchr(argv[0], ' ')) {
shebang.argc = --argc;
shebang.argv = ++argv;
array_init (&shebang.array);
char *p;
char *token = argv[-1];
for (p = token; *p; ) {
if (*p == ' ') {
*p++ = 0;
array_pushdup(&shebang.array, token);
token = p;
} else {
p++;
}
}
if (p > token) {
array_pushdup(&shebang.array, token);
}
argc = shebang.array.size;
argv = (char **) shebang.array.contents;
} else {
shebang.argc = 0;
}
/* parse options manually */
for (; argc && argv [0][0] == '-'; --argc, ++argv) {
/* --help */
if (!strcmp (argv [0], "--help")) {
usage ();
die (0);
}
/* --version */
if (!strcmp (argv [0], "--version")) {
version ();
die (0);
}
/* --stdin */
if (!strcmp (argv [0], "--stdin")) {
add_stdin = 1;
continue;
}
/* -F <FS>*/
if (!strcmp (argv [0], "-F")) {
if (argc == 1) {
fprintf (stderr, "runawk: missing argument for -F option\n");
die (39);
}
array_pushdup (&new_argv, "-F");
array_pushdup (&new_argv, argv [1]);
--argc;
++argv;
continue;
}
/* -F<FS>*/
if (!strncmp (argv [0], "-F", 2)) {
array_pushdup (&new_argv, "-F");
array_pushdup (&new_argv, argv [0]+2);
continue;
}
/* -v|--assign <VAR=VALUE> */
if (!strcmp (argv [0], "-v") || !strcmp (argv [0], "--assign")) {
if (argc == 1) {
fprintf (stderr, "runawk: missing argument for -v option\n");
die (39);
}
array_pushdup (&new_argv, "-v");
array_pushdup (&new_argv, argv [1]);
--argc;
++argv;
continue;
}
/* -v<VAR=VALUE> */
if (!strncmp (argv [0], "-v", 2)) {
array_pushdup (&new_argv, "-v");
array_pushdup (&new_argv, argv [0]+2);
continue;
}
/* -f|--file <FILE> */
if (!strcmp (argv [0], "-f") || !strcmp (argv [0], "--file")) {
if (argc == 1) {
fprintf (stderr, "runawk: missing argument for -f option\n");
die (39);
}
add_file (cwd, argv [1], 0);
--argc;
++argv;
continue;
}
/* -f<FILE> */
if (!strncmp (argv [0], "-f", 2)) {
add_file (cwd, argv [0]+2, 0);
continue;
}
/* -e|--source <PROGRAM TEXT> */
if (!strcmp (argv [0], "-e") || !strcmp (argv [0], "--source")) {
if (argc == 1) {
fprintf (stderr, "runawk: missing argument for -e option\n");
die (39);
}
script = argv [1];
--argc;
++argv;
continue;
}
/* -e<PROGRAM TEXT> */
if (!strncmp (argv [0], "-e", 2)) {
script = argv [0]+2;
continue;
}
if (!strcmp (argv [0], "--exec")) {
if (shebang.argc) {
if (script) {
fprintf (stderr, "runawk: --exec conflicts with --source\n");
die (39);
}
execing = 1;
// add_file(cwd, shebang.argv [0], 1);
// ++shebang.argv;
// --shebang.argc;
--argc;
++argv;
break;
}
if (argc == 1) {
fprintf (stderr, "runawk: missing argument for --exec option\n");
die (39);
}
execing = 1;
// add_file (cwd, argv [1], 1);
--argc;
++argv;
break;
}
/* -- */
if (!strcmp (argv [0], "--")) {
--argc;
++argv;
break;
}
/* --unknown */
if (!strncmp (argv [0], "--", 2)) {
array_pushdup (&new_argv, argv [0]);
continue;
}
/* -x etc */
if (argv[0][1]) {
fprintf (stderr, "runawk: unknown option -%c\n", *(argv [0]+1));
die (1);
}
/* - */
break;
}
if (shebang.argc) {
if (argc) {
fprintf (stderr, "runawk: can't parse shebang line: %s\n", argv[0]);
die (1);
}
array_free (&shebang.array);
argv = shebang.argv;
argc = shebang.argc;
}
progname = interpreter;
if (script) {
add_buffer (script, strlen (script));
} else {
/* program_file */
if (argc < 1) {
usage ();
die (30);
}
--argc;
add_file (cwd, *argv, execing);
progname = *argv;
#if 0
setprogname (*argv);
setproctitle (*argv);
#endif
++argv;
}
/* exec */
new_argv.contents [0] = xstrdup (progname);
if (files && !execing)
array_pushdup (&new_argv, "--");
for (i=0; i < (size_t) argc; ++i) {
array_pushdup (&new_argv, argv [i]);
}
if (add_stdin) {
array_pushdup (&new_argv, "/dev/stdin");
}
array_pushdup (&new_argv, NULL);
awk_pid = fork ();
switch (awk_pid) {
case -1:
perror ("runawk: fork(2) failed");
die (42);
break;
case 0:
/* child */
execvp (interpreter, (char *const *) new_argv.contents);
fprintf (stderr, "runawk: running '%s' failed: %s\n", interpreter, strerror (errno));
exit (1);
break;
default:
/* parent */
waitpid (-1, &child_status, 0);
array_free (&new_argv);
if (killing_sig) {
die (0);
} else if (WIFSIGNALED (child_status)) {
die (128 + WTERMSIG (child_status));
} else if (WIFEXITED (child_status)) {
die (WEXITSTATUS (child_status));
} else {
die (200);
}
}
die (0);
return 0; /* this should not happen but fixes gcc warning */
}
|
the_stack_data/775284.c | //查找一个字符串中无重复最长子串的长度
#include <stdio.h>
#define max(a,b) ((a) > (b)) ? (a) : (b)
int length_of_substring(char *str)
{
int start = 0, end = 0;
int i, len, result, temp;
len = strlen(str);
result = 1;
for (end = 0; end < len; end++) {
temp = end - start + 1;
for (i = start; i < end; i++) {
if (str[i] == str[end]) {
if (start < end)
start = i + 1;
temp = end - start + 1;
}
}
result = max(result, temp);
}
return result;
}
int main(void)
{
char buf[1024];
while(scanf("%s", buf) != EOF) {
printf("%d\n", length_of_substring(buf));
}
return 0;
} |
the_stack_data/68887381.c | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/wait.h>
int forkujSe(){
int pid = fork();
if(pid == 0){
printf("Poruka od deteta.\n");
} else {
int child_status;
wait(&child_status);
if(WIFEXITED(child_status)){
int exit_status = WEXITSTATUS(child_status);
printf("Status deteta: %i\n", exit_status);
if(exit_status != 0){
printf("Doslo je do greske kod deteta...\n");
_exit(exit_status);
}
} else {
printf("Dete nije svojevoljno zavrsilo sa radom [jos uvek]...\n");
}
printf("Poruka od roditelja.\n");
return 1;
}
// ovde podesavamo exit status deteta
_exit(1);
}
int main(){
printf("Start...\n");
int rez = forkujSe();
printf("Gotov... rez = %i\n", rez);
return 0;
}
|
the_stack_data/512790.c | // myls.c ... my very own "ls" implementation
#include <stdlib.h>
#include <stdio.h>
#include <bsd/string.h>
#include <unistd.h>
#include <fcntl.h>
#include <dirent.h>
#include <grp.h>
#include <pwd.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <error.h>
#include <errno.h>
#include <dirent.h>
#define MAXDIRNAME 100
#define MAXFNAME 200
#define MAXNAME 20
#define MAX_STATUS_COUNT 200
char *rwxmode(mode_t, char *);
char *username(uid_t, char *);
char *groupname(gid_t, char *);
int main(int argc, char *argv[])
{
// string buffers for various names
char dirname[MAXDIRNAME];
char uname[MAXNAME+1];
char gname[MAXNAME+1];
char mode[MAXNAME+1];
// collect the directory name, with "." as default
if (argc < 2)
strlcpy(dirname, ".", MAXDIRNAME);
else
strlcpy(dirname, argv[1], MAXDIRNAME);
// check that the name really is a directory
struct stat info;
if (stat(dirname, &info) < 0)
{ perror(argv[0]); exit(EXIT_FAILURE); }
if ((info.st_mode & S_IFMT) != S_IFDIR)
{ fprintf(stderr, "%s: Not a directory\n",argv[0]); exit(EXIT_FAILURE); }
// open the directory to start reading
DIR *df;
// try to open the directory
df= opendir(dirname);
// unable to open that directory
if (df == NULL){
// try to print out the error message
error(errno, errno,"Can not open the directory: %s\n", dirname);
}
// read directory entries
struct dirent *entry[MAX_STATUS_COUNT];
int count_entry = 0;
// readthough all the entry in the directory
while((entry[count_entry] = readdir(df))!= NULL){
if (entry[count_entry]->d_name[0] == '.'){
// filter the first charater is .
continue ;
}
// add one for each recorded file
count_entry ++;
}
int swap = 1;
// sort the array entry
while (swap){
// re initial the swap flag
swap = 0;
for (int i= 0; i < count_entry-1; i++){
// search throught the array
if (strcmp(entry[i]->d_name, entry[i+1]->d_name)>0){
struct dirent *tmp = entry[i];
entry[i]= entry[i+1];
entry[i+1] = tmp;
swap = 1;
}
}
}
struct stat sb;
for (int i = 0; i< count_entry; i++){
// get the file name with directory
char fileLo[512];
sprintf(fileLo, "%s/%s", dirname, entry[i]->d_name);
// print the information of all sorted entry
if (lstat(fileLo, &sb) == -1) {
// try to get the information of this file
perror("stat");
exit(EXIT_FAILURE);
}
// alloc enought space for file name to show
char fileName[512];
// give it the basic value of file name;
strcpy(fileName, entry[i]->d_name);
// try to read the real address if it is a symbolic link
if ((sb.st_mode& S_IFMT)==S_IFLNK){
char addr[255]="";
printf("%s",addr);
readlink(fileLo, addr,255);
//printf("%s\n",addr);
// refresh the fileName to print
//printf("%s\n",addr);
strcat(fileName, " -> ");
strcat(fileName, addr);
strcat(fileName, "\0");
}
printf("%s %-8.8s %-8.8s %8lld %s\n",
rwxmode(sb.st_mode, mode),
username(sb.st_uid, uname),
groupname(sb.st_gid, gname),
(long long)sb.st_size,
fileName);
//printf("%s", fileName);
}
// finish up
closedir(df); // UNCOMMENT this line
return EXIT_SUCCESS;
}
// convert octal mode to -rwxrwxrwx string
char *rwxmode(mode_t mode, char *str)
{
//clear the input string
strcpy(str,"");
// use the input mode to generate the string represent the file mode.
// determine the file type
switch (mode& S_IFMT){
case S_IFREG:strcat(str,"-");break;
case S_IFLNK:strcat(str,"l");break;
case S_IFDIR:strcat(str,"d");break;
// unknown file type for this iteration
default: strcat(str,"?"); break;
}
// determine owner premission
strcat(str,((mode&S_IRUSR)?"r":"-"));
strcat(str,((mode&S_IWUSR)?"w":"-"));
strcat(str,((mode&S_IXUSR)?"x":"-"));
// determine group premission
strcat(str,((mode&S_IRGRP)?"r":"-"));
strcat(str,((mode&S_IWGRP)?"w":"-"));
strcat(str,((mode&S_IXGRP)?"x":"-"));
// determine others premission
strcat(str,((mode&S_IROTH)?"r":"-"));
strcat(str,((mode&S_IWOTH)?"w":"-"));
strcat(str,((mode&S_IXOTH)?"x":"-"));
return str;
}
// convert user id to user name
char *username(uid_t uid, char *name)
{
struct passwd *uinfo = getpwuid(uid);
if (uinfo == NULL)
snprintf(name, MAXNAME, "%d?", (int)uid);
else
snprintf(name, MAXNAME, "%s", uinfo->pw_name);
return name;
}
// convert group id to group name
char *groupname(gid_t gid, char *name)
{
struct group *ginfo = getgrgid(gid);
if (ginfo == NULL)
snprintf(name, MAXNAME, "%d?", (int)gid);
else
snprintf(name, MAXNAME, "%s", ginfo->gr_name);
return name;
}
|
the_stack_data/54134.c | int f(int a), g(int a), a;
int
main()
{
return f(1) - g(1);
}
int
f(int a)
{
return a;
}
int
g(int a)
{
return a;
}
|
the_stack_data/73672.c | /******************************************************************************
@file ble_dispatch_lite.c
@brief ICall BLE Stack Dispatcher for embedded and NP/Serial messages.
Group: WCS, BTS
Target Device: CC2640R2
******************************************************************************
Copyright (c) 2016, Texas Instruments Incorporated
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of Texas Instruments Incorporated nor the names of
its contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 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.
******************************************************************************
Release Name: ti-ble-3.0-stack-sdk_3_00_00
Release Date: 2016-12-21 12:44:47
*****************************************************************************/
#ifdef ICALL_LITE
/*********************************************************************
* INCLUDES
*/
#include "osal_snv.h"
#include "osal_bufmgr.h"
#include "ble_dispatch.h"
#include "ble_dispatch_lite.h"
#include "rom_jt.h"
#include <icall_lite_translation.h>
/*********************************************************************
* MACROS
*/
/*********************************************************************
* CONSTANTS
*/
#if !defined(STACK_REVISION)
#define STACK_REVISION 0x030000
#endif // STACK_REVISION
extern const uint16 ll_buildRevision;
/*********************************************************************
* TYPEDEFS
*/
/*********************************************************************
* LOCAL FUNCTIONS
*/
/*********************************************************************
* GLOBAL VARIABLES
*/
/*********************************************************************
* EXTERNAL VARIABLES
*/
uint8_t icall_liteTaskId;
/*********************************************************************
* EXTERNAL FUNCTIONS
*/
/*********************************************************************
* LOCAL VARIABLES
*/
/*********************************************************************
* NETWORK LAYER CALLBACKS
*/
/*********************************************************************
* PUBLIC FUNCTIONS
*/
/*********************************************************************
* LOCAL FUNCTION PROTOTYPES
*/
/*********************************************************************
* @fn bleDispatch_BMAlloc
*
* @brief Implementation of the BM allocator functionality.
*
* Note: This function should only be called by the upper
* layer protocol/application.
*
* @param type - type of the message to allocate.
* @param size - number of bytes to allocate from the heap.
* @param connHandle - connection that GATT message is to be sent on
* (applicable only to BM_MSG_GATT type).
* @param opcode - opcode of GATT message that buffer to be allocated for
* (applicable only to BM_MSG_GATT type).
* @param pSizeAlloc - number of bytes allocated for the caller from the heap
* (applicable only to BM_MSG_GATT type).
*
* @return pointer to the heap allocation; NULL if error or failure.
*/
void *bleDispatch_BMAlloc(uint8_t type, uint16_t size, uint16_t connHandle,
uint8_t opcode, uint16_t *pSizeAlloc)
{
void *pBuf;
switch (type)
{
#if defined(HOST_CONFIG) && (HOST_CONFIG & (CENTRAL_CFG | PERIPHERAL_CFG))
case BM_MSG_GATT:
pBuf = GATT_bm_alloc(connHandle, opcode, size, pSizeAlloc);
break;
case BM_MSG_L2CAP:
pBuf = L2CAP_bm_alloc(size);
break;
#endif /* defined(HOST_CONFIG) && (HOST_CONFIG & (CENTRAL_CFG | PERIPHERAL_CFG)) */
default:
pBuf = BM_alloc(size);
break;
}
return (pBuf);
}
/*********************************************************************
* @fn bleDispatch_BMFree
*
* @brief Implementation of the BM de-allocator functionality.
*
* @param type - type of the message to free.
* @param pBuf - pointer to the memory to free.
* @param opcode - opcode of GATT message (applicable only to BM_MSG_GATT
* type).
*
* @return none
*/
void bleDispatch_BMFree(uint8_t type, void *pBuf, uint8_t opcode)
{
switch (type)
{
#if defined(HOST_CONFIG) && (HOST_CONFIG & (CENTRAL_CFG | PERIPHERAL_CFG))
case BM_MSG_GATT:
GATT_bm_free((gattMsg_t *)pBuf, opcode);
break;
case BM_MSG_L2CAP:
/*lint --fallthrough */
#endif /* defined(HOST_CONFIG) && (HOST_CONFIG & (CENTRAL_CFG | PERIPHERAL_CFG)) */
default:
BM_free(pBuf);
break;
}
}
/*********************************************************************
* @fn buildRevision
*
* @brief Read the Build Revision used to build the BLE stack.
*
* @param pBuildRev - pointer to variable to copy build revision into
*
* @return SUCCESS: Operation was successfully.
* INVALIDPARAMETER: Invalid parameter.
*/
uint8 buildRevision(ICall_BuildRevision *pBuildRev)
{
if (pBuildRev!= NULL)
{
pBuildRev->stackVersion = (uint32)STACK_REVISION;
pBuildRev->buildVersion = (uint16)ll_buildRevision;
// Stack info (Byte 5)
// Bit 0: IAR used to build stack project (0: no, 1: yes)
// Bit 1: CCS used to build stack project (0: no, 1: yes)
// Bits 2-3: Reserved
// Bit 4: IAR used to build stack library (0: no, 1: yes)
// Bits 5-6: Reserved
// Bit 7: ROM build (0: no, 1: yes)
pBuildRev->stackInfo =
#if defined(__IAR_SYSTEMS_ICC__)
BLDREV_STK_IAR_PROJ |
#endif // __IAR_SYSTEMS_ICC__
#if defined(__TI_COMPILER_VERSION__)
BLDREV_STK_CCS_PROJ |
#endif // __TI_COMPILER_VERSION__
#if defined(FLASH_ROM_BUILD)
BLDREV_STK_IAR_LIB |
BLDREV_STK_ROM_BLD |
#endif // FLASH_ROM_BUILD
0;
// Controller info - part 1 (Byte 6)
// Bit 0: ADV_NCONN_CFG (0: not included, 1: included)
// Bit 1: ADV_CONN_CFG (0: not included, 1: included)
// Bit 2: SCAN_CFG (0: not included, 1: included)
// Bit 3: INIT_CFG (0: not included, 1: included)
// Bit 4: PING_CFG (0: not included, 1: included)
// Bit 5: SLV_FEAT_EXCHG_CFG (0: not included, 1: included)
// Bit 6: CONN_PARAM_REQ_CFG (0: not included, 1: included)
// Bit 7: Reserved
pBuildRev->ctrlInfo =
#if defined(CTRL_CONFIG)
CTRL_CONFIG |
#endif // CTRL_CONFIG
#if defined(CTRL_V41_CONFIG) && (CTRL_V41_CONFIG & PING_CFG)
BLDREV_CTRL_PING_CFG |
#endif // CTRL_V41_CONFIG=PING_CFG
#if defined(CTRL_V41_CONFIG) && (CTRL_V41_CONFIG & SLV_FEAT_EXCHG_CFG)
BLDREV_CTRL_SLV_FEAT_EXCHG_CFG |
#endif // CTRL_V41_CONFIG=SLV_FEAT_EXCHG_CFG
#if defined(CTRL_V41_CONFIG) && (CTRL_V41_CONFIG & CONN_PARAM_REQ_CFG)
BLDREV_CTRL_CONN_PARAM_REQ_CFG |
#endif // CTRL_V41_CONFIG=CONN_PARAM_REQ_CFG
0;
// Host info - part 1 (Byte 8)
// Bit 0: BROADCASTER_CFG (0: not included, 1: included)
// Bit 1: OBSERVER_CFG (0: not included, 1: included)
// Bit 2: PERIPHERAL_CFG (0: not included, 1: included)
// Bit 3: CENTRAL_CFG (0: not included, 1: included)
// Bit 4: GAP_BOND_MGR (0: not included, 1: included)
// Bit 5: L2CAP_CO_CHANNELS (0: not included, 1: included)
// Bits 6-7: Reserved
pBuildRev->hostInfo =
#if defined(HOST_CONFIG)
HOST_CONFIG |
#endif // HOST_CONFIG
#if defined(GAP_BOND_MGR)
BLDREV_HOST_GAP_BOND_MGR |
#endif // GAP_BOND_MGR
#if defined(BLE_V41_FEATURES) && (BLE_V41_FEATURES & L2CAP_COC_CFG)
BLDREV_HOST_L2CAP_CO_CHANNELS |
#endif //(BLE_V41_FEATURES & L2CAP_COC_CFG)
0;
return (SUCCESS);
}
return (INVALIDPARAMETER);
}
/*********************************************************************
* @fn icall_liteMsgParser
*
* @brief parsing of the ble specific icall direct API message.
*
* @param *msg - pointer to message receive
*
* @return None
*/
void icall_liteMsgParser(void * msg)
{
osal_msg_hdr_t *hdr;
hdr = (osal_msg_hdr_t *) msg - 1;
if (hdr->format == ICALL_MSG_FORMAT_DIRECT_API_ID)
{
osal_msg_send(icall_liteTaskId, msg);
}
}
/*********************************************************************
* @fn ble_dispatch_liteProcess
*
* @brief Process osal message send to the icall lite task. This allows icall
* lite direct API messages to be parse with the lowest priority, and
* not diverge from the previous implementation.
*
* @param taskId.
* events
*
* @return None
*/
uint16 ble_dispatch_liteProcess(uint8_t taskId, uint16_t events)
{
uint8 *pMsg;
VOID taskId;
if ( events & SYS_EVENT_MSG )
{
if ( (pMsg = MAP_osal_msg_receive( icall_liteTaskId )) != NULL )
{
icall_directAPIMsg_t* appMsg = (icall_directAPIMsg_t*) pMsg;
icall_liteTranslation(appMsg);
}
// Return unprocessed events
return (events ^ SYS_EVENT_MSG);
}
return 0;
}
/*********************************************************************
* @fn ble_dispatch_liteInit
*
* @brief initialize the icall lite osal task.
*
* @param taskId.
*
* @return None
*/
void ble_dispatch_liteInit(uint8_t taskId)
{
icall_liteTaskId = taskId;
}
/*********************************************************************
* @fn icall_liteErrorFunction
*
* @brief call assert. this function is used to replace non-existant function
* in the jump table.
*
* @param None
*
* @return None
*/
#ifndef STACK_LIBRARY
void icall_liteErrorFunction (void)
{
HAL_ASSERT( HAL_ASSERT_CAUSE_INTERNAL_ERROR );
return;
}
#endif /* STACK_LIBRARY */
#endif /* ICALL_LITE */
/*********************************************************************
*********************************************************************/
|
the_stack_data/218892466.c | /*
Fenwick Tree[also known as binary indexed tree] is used when there is a problem of range sum query wiht update i.e.RMQ.
Suppose you have an array and you have been asked to find sum in range.It can be done in linear time with static array
method.It will be difficult for on to do it in linear time when you have point updates.In this, update operation
incrementing an index by some value.Brute force approach will take O(n^2) time but Fenwick tree will take O(nlogn) time.
*/
#include <stdio.h>
#include <stdlib.h>
/* n --> No. of elements present in input array.
BITree[0..n] --> Array that represents Fenwick Tree(Binary Indexed Tree).
arr[0..n-1] --> Input array for which prefix sum is evaluated.
*/
/*
Returns sum of arr[0..index]. This function assumes that the array is preprocessed and partial sums of
array elements are stored in BITree[].
*/
int getSum(int BITree[], int index)
{
int sum = 0; // Iniialize result
// index in BITree[] is 1 more than the index in arr[]
index = index + 1;
// Traverse ancestors of BITree[index]
while (index > 0)
{
// Add current element of BITree to sum
sum += BITree[index];
// Move index to parent node in getSum View
index -= index & (-index);
}
return sum;
}
/*
Updates a node in Fenwick Tree at given index in BITree. The given value 'val' is added to BITree[i] and
all of its ancestors in tree.
*/
void updateBIT(int BITree[], int n, int index, int val)
{
// index in BITree[] is 1 more than the index in arr[]
index = index + 1;
// Traverse all ancestors and add 'val'
while (index <= n)
{
// Add 'val' to current node of BI Tree
BITree[index] += val;
// Update index to that of parent in update View
index += index & (-index);
}
}
/*
Constructs and returns a Fenwick Tree for given array of size n.
*/
int *constructBITree(int arr[], int n)
{
// Create and initialize BITree[] as 0
int *BITree = (int*) calloc(n+1, sizeof(int));
for (int i = 1; i <= n; ++i)
BITree[i] = 0;
// Store the actual values in BITree[] using update()
for (int i = 0; i < n; ++i)
updateBIT(BITree, n, i, arr[i]);
return BITree;
}
int rangeSum(int l, int r, int BITree[])
{
return getSum(BITree, r) - getSum(BITree, l);
}
int main()
{
int n;
scanf("%d", &n);
int freq[n];
for (int i = 0; i < n; ++i)
{
scanf("%d", &freq[i]);
}
int *BITree = constructBITree(freq, n);
// Print sum of freq[0...5]
printf("%d\n", getSum(BITree, 5));
//Update operation
freq[4] += 16;
updateBIT(BITree, n, 4, 16);
//Print sum of freq[2....7] after update
printf("%d\n", rangeSum(2, 7, BITree));
return 0;
}
/*
INPUT
-----
n=12
freq :[2,1,1,3,2,3,4,5,6,7,8,9];
Print sum of freq[0...5]
Update position 4 by adding 16
Print sum of freq[2....7] after update
OUTPUT
------
12
33
*/
|
the_stack_data/93334.c | // This file was automatically generated from ./build/MPG4MasterFirmware.dnl using dnl2c.
unsigned int ui32MPG4_MasterMTXTOPAZFWTextSize = 5686;
unsigned int ui32MPG4_MasterMTXTOPAZFWDataSize = 2993;
unsigned int ui32MPG4_MasterMTXTOPAZFWTextRelocSize = 0;
unsigned int ui32MPG4_MasterMTXTOPAZFWDataRelocSize = 0;
unsigned int ui32MPG4_MasterMTXTOPAZFWTextOrigin = 0x80900000;
unsigned int ui32MPG4_MasterMTXTOPAZFWDataOrigin = 0x828858d8;
unsigned int aui32MPG4_MasterMTXTOPAZFWText[] =
{
0x9040c001,
0xc80993fe,
0xc0000e42,
0xc8290e00,
0xc87a8422,
0xc8298400,
0xc58c8622,
0x9e838660,
0xc8099e43,
0xcb180d42,
0xc8090d40,
0xcb1a0942,
0xc8090900,
0xc00a0e42,
0xc8090e40,
0xc00e87c2,
0x9c1887c0,
0x0c020802,
0x09820d82,
0x09020d02,
0x08820c82,
0x9320fffe,
0xa401c838,
0x0dc2c809,
0x0d80cb18,
0x0e42c809,
0x0c66b080,
0x0882a992,
0x9ff3a48d,
0x93e0ffff,
0x80819d13,
0xa205f839,
0x03070707,
0x9e970685,
0xc8090383,
0xcb1a0ac2,
0xc8090aa0,
0xcb1a1ac0,
0x060f1a80,
0x07fac101,
0x018d058d,
0x9c62008f,
0x9320ffff,
0xc101060b,
0x9c6206da,
0x9380ffff,
0x018d058d,
0x440cb700,
0x4394b780,
0xa6059c01,
0xc8090687,
0xcb1a0ac2,
0xc8090aa0,
0xcb1a1ac0,
0x060b1a80,
0x06dac101,
0xffff9c62,
0xf9f89380,
0xf9f8aa9d,
0x9c22aa1d,
0x420cb700,
0xc000587c,
0xe0003800,
0xc0003800,
0x9c22901a,
0x9c8fc127,
0x080a9c22,
0x9c81c017,
0x9c80c071,
0x9c80c017,
0x0d849c22,
0x9e5a5db0,
0x4018b960,
0x0900c021,
0x0940c00e,
0xaa45f031,
0xf0009dad,
0x0910a261,
0x9341ffff,
0xc3fe9e5c,
0xc02129c0,
0xc0010a00,
0xc00e3988,
0x9dcd0a30,
0xa1e1f000,
0xc0219c22,
0xd1100d80,
0x9d3d05b7,
0x2244aa61,
0xffff7115,
0x9c229384,
0xd011a605,
0xc3fe0eb2,
0xc28029c0,
0x020b5ab0,
0x0a00c021,
0x398cc001,
0xc00e0685,
0x9dcd0a30,
0xa1e1f000,
0xc00e9eab,
0x0d020992,
0x0902cff0,
0x0a80c021,
0x9bdbfff4,
0x0ac0c00e,
0x4018b960,
0xaa619d5d,
0xa225f231,
0xffff0a90,
0xb79f9361,
0xb7bf7f6e,
0x8c407fee,
0xfffd9c22,
0x9e5c9040,
0x9c8bc020,
0x9080c000,
0xa185d229,
0x93c1ffff,
0xa6059c22,
0x9e5d9e9a,
0xfff40982,
0x000b9bf2,
0x7f6eb79f,
0x7feeb7bf,
0x9c228c40,
0xb7209c22,
0xb760428c,
0x0d864688,
0x55b1b749,
0x5529b709,
0x90a0c000,
0xc00e0005,
0x9e5a287c,
0x52407015,
0x0902d011,
0x48a8b340,
0xffff78c8,
0x9c2292a4,
0xb7a0a605,
0xc0b64a0c,
0xd1106dc2,
0x099a06bb,
0xb76d008b,
0x0d845a31,
0x9b27c154,
0xb78d008b,
0xc00e5aa9,
0x7100287c,
0xd0010802,
0xb79f0802,
0xb7bf7f6e,
0x8c407fee,
0xa61d9c22,
0x9e9b0787,
0x07059e9d,
0x9e4e0385,
0x9bdcfff4,
0xd0127400,
0xc0011000,
0x9e6c9044,
0x4a0cb720,
0x6a42c0b6,
0x9ea902c2,
0x6e5fd2d1,
0x5a51b76d,
0xc101099a,
0xc2000246,
0x00c25a10,
0x4c2db5c3,
0x4ab5b5e3,
0x4b35b5c3,
0x4badb5e3,
0xc1540d84,
0x008b9aee,
0x5a29b50d,
0xb79f0806,
0xb7bf7e6e,
0xb7df7eee,
0xb7ff7f6e,
0xc0027fee,
0x9c228c00,
0xb7409e5c,
0xc0b64a0c,
0x02446a42,
0x428cb580,
0x4590b560,
0x0d849c22,
0x9e5c5db0,
0x0a00c021,
0x0a00c010,
0xf0009dcd,
0x09bca162,
0x59905928,
0x2980cff0,
0x297cc00f,
0x0d80c021,
0xc00e3126,
0x9dbe0d80,
0xa161f000,
0x0d849c22,
0xc00e5db0,
0x0d020992,
0x0902cff0,
0x9260fff8,
0x5db00d84,
0xc0219e5c,
0xc0100a00,
0x9dcd0a00,
0xa162f000,
0x599009bc,
0xcff05928,
0xc00f2980,
0xc011297c,
0xc0213980,
0x31b40d80,
0x0d80c00e,
0xf0009dbe,
0x9c22a1e1,
0xc002a61d,
0xd0318400,
0x9e9f0abe,
0xa1922ac1,
0xa116a119,
0x9300c001,
0x7562c1fc,
0x0f02c0fc,
0x4446b356,
0xa992a916,
0x09029e73,
0x9bcefff4,
0x0b82a992,
0xfff4068d,
0xab199bc0,
0xc000010f,
0x7dde92e0,
0x9144c000,
0xe092a992,
0x018f8d00,
0x9ad8fff4,
0x8d00e091,
0x0b8477c0,
0x90e2c000,
0xaa45d029,
0xd2081f84,
0x0b04a241,
0x777f1e84,
0x9124ffff,
0xc101a91a,
0x052c12dc,
0xa916a11a,
0xa116052c,
0xfffe7540,
0xb79f9124,
0xb7bf7c6e,
0xb7df7cee,
0xb7ff7d6e,
0xc0047dee,
0x9c228c00,
0xc002a61d,
0x9e5c8400,
0xc2009e9f,
0xc0215a30,
0xa19a0a00,
0x0a30c110,
0x9dcd0982,
0xa1e1f000,
0x0efed032,
0xa1122ec1,
0xc002a115,
0xc1fc9180,
0xc0fc7762,
0xb3560f02,
0x0d024846,
0xb55f9e76,
0xb55f7df4,
0xb55f7d74,
0xb55f7cf4,
0x0b827c74,
0x8d80e092,
0xd01077c0,
0xc0000534,
0xa9919162,
0xd0291f84,
0xa191aa65,
0xa241d008,
0x9080c000,
0xa3c2d008,
0xf0310b84,
0x0d042afe,
0x9244c000,
0xe092a99a,
0xd0518d00,
0xfff419f0,
0x9eaa9a42,
0x7decb5bf,
0x7d6cb5bf,
0x7cecb5bf,
0x7c6cb5bf,
0x1b04e000,
0x92c4fffe,
0xa99aa916,
0x010d9e73,
0x9b19fff4,
0x16dca99a,
0x9b2ffff4,
0x05bca996,
0x7740a196,
0x92a4fffd,
0x7c6eb79f,
0x7ceeb7bf,
0x7d6eb7df,
0x7deeb7ff,
0x8c00c004,
0xb7209c22,
0xc0b4428c,
0xb74309aa,
0xb76d5a2d,
0x9e8a6631,
0x9100fffc,
0xa285f839,
0xf0089e90,
0xd091aa4d,
0xf0080cae,
0xc080a949,
0xc1015815,
0x01200244,
0xb5807640,
0xb54041cc,
0xc000414c,
0xb7809202,
0xb74040cc,
0xb740404c,
0x11284254,
0xc2000a06,
0x9ea15208,
0xb5403522,
0xd1a24254,
0xc00f5e30,
0x9ea308fe,
0x0d02cff1,
0x0d80c021,
0x9c83c010,
0x0de0c140,
0x08fcc00e,
0x0d00cff0,
0x9200c000,
0xaa65f029,
0x214a9e55,
0x59212242,
0x5a20c200,
0xba243244,
0x9dbe4006,
0xa261f000,
0x9241ffff,
0x404cb780,
0xb5800a04,
0xf9f8404c,
0x9c22aa9d,
0x9e91a685,
0x06858702,
0xc00e8522,
0xf2100b7e,
0x7640882b,
0x5153c200,
0x9182c002,
0xaa61f008,
0xe0009e69,
0x22a22a1c,
0x5920c280,
0x4442b423,
0xaa61f008,
0xa962d010,
0xf3102a1c,
0xc1018821,
0xba0c1242,
0x1003400a,
0xc2005241,
0x9e955921,
0x2a7cc00e,
0x0910d031,
0x520bc200,
0xd3f23454,
0xc0002ace,
0xc20092ea,
0x9e515224,
0xd0103242,
0xf008a261,
0xd011a961,
0xd1102a2e,
0x750e0619,
0x0615d110,
0x0db2d009,
0xa261f008,
0x9240c000,
0xa062d010,
0xaa61f008,
0x0619d110,
0x02429e81,
0xa261f008,
0x2cfccffe,
0xa164d032,
0x9220fffd,
0xb7bf9e58,
0xb7df7f6e,
0x8c407fee,
0xa60d9c22,
0x1ea0f011,
0xd01d9e58,
0x9e9e025a,
0x1b42d00d,
0x909ac000,
0x134a120b,
0x0d020906,
0x9080c000,
0x01241364,
0x1a22d011,
0xd3f2710c,
0x0d042eae,
0x9306ffff,
0xc0009e6d,
0xfff49080,
0xd0119b83,
0x75100a52,
0x9e739e83,
0x09220d02,
0xffff1aa0,
0xd3f192d2,
0x0d04294e,
0x9b74fff4,
0x91e0c000,
0x2aced3f2,
0xc2009e6c,
0xd3f252d1,
0xfff4295e,
0x9e6c9b69,
0x52b0c200,
0x7750136a,
0x1e50d031,
0x9e739e83,
0xffff0922,
0xd3f291b2,
0x9e6a296e,
0x7eeeb79f,
0x7f6eb7bf,
0x7feeb7df,
0xfffa8c60,
0x02079220,
0xa1c1d010,
0x9ea29e53,
0xfff70c82,
0xa60d9360,
0xe0518460,
0x0a028c88,
0xa215a219,
0xb59fa211,
0xb5807d6c,
0xf008402d,
0x0707a9e1,
0x198c9e56,
0xd01274e2,
0xc0000a92,
0xd1a69332,
0x85205908,
0x8044e050,
0x941b9415,
0x940f9429,
0x9437940e,
0x940b940c,
0x9409940a,
0x94079408,
0x94059406,
0x94039404,
0x943e9460,
0xc0040802,
0xd07291a0,
0xe0711924,
0x058b8d80,
0x91a0c000,
0x428cb780,
0x8d80e071,
0xc09e058b,
0xd2080a5c,
0xd120a902,
0xfff41125,
0xc0039b64,
0xd3f191c0,
0xe0712aae,
0x9eaa8d80,
0x0916058b,
0x9afafff4,
0x428cb780,
0x0a5cc09e,
0xa281d208,
0x93a0c002,
0xaacdf010,
0x8d80e071,
0x0d02058b,
0xfff40906,
0x4afd9ae9,
0x9e832a9c,
0x8d80e071,
0xc00e010b,
0xc0020d7e,
0xb7209100,
0xb784428c,
0x75026ead,
0x1248d01a,
0x9174c000,
0x542db761,
0xc1549ea3,
0x7400985b,
0xd0010a02,
0xf0120a42,
0x0d0a09c0,
0xd0010485,
0x9e4a1ca2,
0xe07176c0,
0xb3328d80,
0x058b4842,
0x90e0c001,
0x428cb720,
0x542db761,
0x6eb5b764,
0xc00074c0,
0x0a8690a4,
0x9220c000,
0xc0029e9a,
0xc0000902,
0xd0119100,
0x01091a22,
0xc00e0524,
0x7680297c,
0x9336ffff,
0xc1540285,
0x9e82982b,
0x8d80e071,
0xc00e058b,
0xd3f12d7c,
0xfff4295e,
0xb77f9a97,
0xe0527d6c,
0x058d8d08,
0xfff4010d,
0x08069b40,
0x7d6eb79f,
0x7deeb7bf,
0x7e6eb7df,
0x8c40c002,
0xa61d9c22,
0x8440c002,
0xf0319e5f,
0xd011abc6,
0xc2000a72,
0x9ea65a30,
0xc0400d82,
0xc0210a00,
0xa2150f00,
0xb55fa191,
0xb53f7dec,
0xa0997d74,
0x7c74b57f,
0xb57f9e56,
0xb57f7a74,
0xb57f7af4,
0xb57f7b74,
0xc0407bf4,
0xc8010f50,
0x9dee0a02,
0xa261f000,
0x9200c002,
0xaa41f208,
0x0b10028d,
0xc0007500,
0x75049102,
0x90a2c000,
0xc0007502,
0xd0119284,
0xd00809d8,
0x7504a962,
0x9ebb0c82,
0x8d00e0d1,
0x0c92d002,
0x99f2fff4,
0x03605808,
0xc0000806,
0xb75f9200,
0xb73f7dec,
0x9ebb7d74,
0x8d00e0d2,
0xfff4018b,
0xd0119aea,
0xd0201e72,
0xf20803c0,
0x74c0a9a1,
0x90a4c000,
0xc000a19d,
0x74d891e0,
0x9124c000,
0x0d06a919,
0xd8080e86,
0xc000a142,
0x77409220,
0x9144c000,
0x0e82a91d,
0xc00e0220,
0xa21d2a7c,
0x90c0c000,
0x0651d110,
0x2aced3f2,
0x7a6cb79f,
0xfffd711f,
0x774091e6,
0x9322c000,
0xd011a91d,
0x59201e52,
0x2900c1f0,
0x32442a7c,
0x5940a911,
0xa9153244,
0x0900c021,
0x0900c008,
0xf0009dad,
0xa91aa261,
0xd8100a06,
0xa919a241,
0xaa41d808,
0xc0007500,
0xa9159284,
0x7c6cb79f,
0x0900c021,
0xc7ff0970,
0x9dad2a7e,
0xa261f000,
0x7aecb79f,
0x1679d110,
0xf0009dee,
0xb71fa261,
0xb79f7bec,
0xb7bf7b6e,
0xb7df7bee,
0xb7ff7c6e,
0xc0047cee,
0x9c228c40,
0x0d84a61d,
0x5f30c180,
0x9e769e74,
0x0a00c040,
0x078d9ea5,
0x0b00c021,
0x0f80c021,
0xc0210287,
0xc0080e80,
0x0b400b82,
0x0fd0c040,
0x93e0c000,
0x757ec03c,
0x0a7ec01e,
0x4434b354,
0x5914c200,
0xc3fe12d8,
0x9dfe2900,
0xa161f000,
0xaa619d5e,
0xf0009ded,
0x3a40a3e1,
0xf0009dde,
0x9ebaa261,
0x058d0992,
0xffd4010f,
0x75409b70,
0x9044ffff,
0x0a02c008,
0xf0009ded,
0xb79fa261,
0xb7bf7e6e,
0xb7df7eee,
0xb7ff7f6e,
0xc0027fee,
0x9c228c00,
0x0d84a605,
0x9e5d5db0,
0x0e82c008,
0x0a80c021,
0x9ddd0ac0,
0xa2e2f000,
0xc0219e5a,
0xc0400900,
0x9d2d0900,
0x74c0a962,
0x3e20d051,
0x9082c000,
0x3e20d0d1,
0xf0009dad,
0x9e6aa261,
0x050b0992,
0x9b3bffd4,
0xf0009ddd,
0xb79fa2e2,
0xb7bf7f6e,
0x8c407fee,
0xa61d9c22,
0x8420c008,
0x8c88f212,
0x07059e5e,
0x9e9a0385,
0x0a829e6a,
0x0982c008,
0x5e6ab5bf,
0x982cfff4,
0x9e729eb3,
0xe2319eb9,
0x018b8c80,
0xfff4050b,
0x9eb39ab8,
0xfff4018b,
0xb79f9bb9,
0xb7bf75ee,
0xb7df766e,
0xb7ff76ee,
0xc00a776e,
0x9c228c20,
0xa285f839,
0x4a0cb720,
0x9d3a0a02,
0x9e8b9e8a,
0x9e889e89,
0x4c9cb760,
0x02830003,
0x9ea50183,
0xc09e0916,
0xc0a80ddc,
0xc09e0810,
0xc1560d60,
0xc15e0c9c,
0xc1560ad0,
0xc10009a0,
0x877f0c70,
0xa261d010,
0xa241d010,
0x4028b580,
0x4048b580,
0x4049b580,
0xa261d008,
0xa221d208,
0x6eadb549,
0x4c2db588,
0x5629b589,
0x5d2db543,
0x40adb544,
0x5e2db582,
0x4b2db549,
0x4708b580,
0x90a0c000,
0xc2229d6b,
0xd3f1a104,
0x0e842e5e,
0xffff7135,
0xf9f89338,
0x9c22aa9d,
0xc912a61d,
0xc9129cc4,
0xb7c09cce,
0x9e5a4894,
0xa1edf010,
0x1f68d191,
0xd0510e86,
0x0f820be0,
0xf2089e75,
0x7500aa2d,
0x93c4c000,
0x0a20d051,
0xf2089eab,
0xf208a003,
0xd011a2ae,
0xf2080a58,
0xd248a803,
0xf208aa21,
0xb580a921,
0x9e944608,
0xf2089c62,
0x010da863,
0x4610b5e0,
0xa2cef208,
0x9000ffff,
0xc0007502,
0xd05191c4,
0xf2080a20,
0xd051a003,
0xf2080a50,
0xd248a803,
0xc000aa21,
0x1ad09280,
0xc003714c,
0xfffe9262,
0xd0519180,
0xf2080a20,
0xb780a003,
0xf208480c,
0xb780a803,
0xd248448c,
0xb580aa01,
0xc0034608,
0xc0219140,
0x0a100a02,
0xaa619d4d,
0x7d00dfe0,
0x90c2c000,
0x0b02c100,
0x9120c001,
0x4788b760,
0x010f0b8a,
0xc02174c0,
0xc0300a02,
0xd0010a00,
0x9d4d1972,
0x2d71a962,
0x290c9e51,
0x9dcd3122,
0xa161f000,
0x080ac100,
0x9c81c017,
0xc00074c0,
0x9e9b90a4,
0x9a12ffd4,
0x9c82c171,
0x9c88c817,
0xcffe9ebb,
0xffd42b7c,
0x0d8a9a09,
0x9a06ffd4,
0x0902c021,
0x0900c030,
0xaa619d2d,
0x9dad3a0c,
0xa261f000,
0x4794b740,
0xd0319eb3,
0xc1000a58,
0x08862d80,
0x29e4d011,
0xa941f010,
0xc0007486,
0x76c090a4,
0x90c0c000,
0xc0007484,
0x74c090a4,
0x4644b40a,
0x72991d50,
0x91a2c000,
0x91c0ffff,
0x448cb780,
0xaa0df208,
0xfffc7502,
0xfffc9384,
0xb79f9140,
0xb7bf7e6e,
0xb7df7eee,
0xb7ff7f6e,
0xc0027fee,
0x9c228c00,
0xb780a605,
0x9e5b4608,
0x4494b760,
0xb7a06a52,
0xd1204588,
0xfff401c7,
0x9eab9b2b,
0x7f6eb79f,
0x7feeb7bf,
0xffd48c40,
0xa60593e0,
0xc0009e5d,
0xfff49080,
0xb7809be7,
0x0d924688,
0xffff7948,
0x424a9344,
0x4688b580,
0x7f6eb79f,
0x7feeb7bf,
0x9c228c40,
0x9e5da605,
0x448cb740,
0x0a54d011,
0x02446a52,
0x0948d031,
0xaa41f008,
0xd0017508,
0xb4221a46,
0xc0004622,
0xfff49080,
0x9eab9bc3,
0x9a1cffd4,
0x0d927400,
0x9324ffff,
0x7f6eb79f,
0x7feeb7bf,
0x9c228c40,
0xa205f839,
0x9080c000,
0x9bb0fff4,
0x428cb720,
0x4688b780,
0xb7490d92,
0x22285629,
0xffff7104,
0xf9f892a2,
0xffcfaa1d,
0xa61d9080,
0x8400c002,
0xa1999e5e,
0xa111a116,
0x9080c000,
0x9b96fff4,
0x4508b780,
0xc01c0d92,
0xffff7d3e,
0xb7809324,
0xc0214508,
0xc0100d02,
0x0a040d10,
0x4508b580,
0xab629d2e,
0x0902c021,
0x0920c010,
0x2eeed072,
0xaa619d2d,
0xd0719e55,
0x038529ce,
0x9180c000,
0x9b74fff4,
0xab629d5d,
0x2eeed072,
0xaa619d7d,
0x29ced071,
0x0fd2d012,
0x2e7ed071,
0x71060d8a,
0x9202ffff,
0xb59f0a02,
0xb59f7c6c,
0xb59f7cec,
0xb59f7d6c,
0x03897dec,
0x4078b960,
0x9d7daa15,
0x8d00e093,
0xa905c270,
0x8026f010,
0xd2080b84,
0xffffa101,
0x9dcb92a1,
0x09829eb3,
0x9919ffd4,
0xe0929eb3,
0x09828d00,
0x993cffd4,
0xb780aa91,
0xc2804a0c,
0xc0b65e88,
0x9eb36ac2,
0xc04e02d8,
0xf2080ac0,
0xb79fa922,
0x018f7dec,
0xa94ae050,
0xa21d0902,
0x99e7ffd4,
0xcffe9eb3,
0xffd42f01,
0xaa1d99fc,
0xe0929eb3,
0x4a7d8d00,
0xb59f0982,
0xffd47dec,
0xf20898ee,
0x9e6caaa1,
0xe2409eb3,
0x018fa926,
0xffd40902,
0x9eb399f1,
0x99e5ffd4,
0x77c0c004,
0xb3740a02,
0x9e724824,
0x32442a7c,
0x0902c021,
0x0910c010,
0xf0009dad,
0x9eb3a261,
0x8d00e092,
0xffd40982,
0xa91f98f5,
0x7decb79f,
0xffff7135,
0xb78092c4,
0xa9194508,
0x74801a04,
0x4508b580,
0x9102c000,
0xffd40d8e,
0x0d8a98af,
0x98acffd4,
0x7c6eb79f,
0x7ceeb7bf,
0x7d6eb7df,
0x7deeb7ff,
0x8c00c004,
0xf8399c22,
0x8440a205,
0x5e20d1a2,
0x9e9ba115,
0x9e539e4a,
0x2a00c7f0,
0x8d00e052,
0x3a04c001,
0xfff4a211,
0xf9f89b28,
0x9c22aa15,
0xa205f839,
0x0a028440,
0x0a40c0b6,
0x4a0cb720,
0x00c26229,
0x592db783,
0x5ca0c180,
0x59b5b703,
0x2a7cc006,
0xb7039ea3,
0xc7f05a2d,
0xb7232c80,
0x34965aad,
0x9e539e9b,
0x8d00e052,
0xa019a016,
0xa092a09d,
0x9b01fff4,
0xaa15f9f8,
0xa6059c22,
0x448cb780,
0xb7400906,
0xf2084914,
0xf010a10d,
0x0a10a043,
0xa803f208,
0x478cb7a0,
0xb5800a02,
0xd1924608,
0x010b1ad8,
0xaa4df1e9,
0xc000750a,
0x0d9290e2,
0x9a80fff4,
0x92e0ffff,
0xffff709b,
0xb78092a4,
0xf208490c,
0xb79fa803,
0xb7bf7f6e,
0x8c407fee,
0xa6059c22,
0x0d80c021,
0x06b7d110,
0xc0000685,
0xb78091c0,
0x0a044788,
0x4788b580,
0x9a62fff4,
0x4788b780,
0xb5801a04,
0x9d5d4788,
0x791baa61,
0xffff0d8e,
0xb79f9202,
0xb7bf7f6e,
0x8c407fee,
0xb7409c22,
0x0d06470c,
0x4028b960,
0xaa41f008,
0xb4127508,
0x09504a22,
0x9341ffff,
0xb7409c22,
0x45b44690,
0x4690b560,
0x91a0ffff,
0xb7a0a605,
0x008b428c,
0x59adb783,
0xb5899ea9,
0xb7205629,
0xb783428c,
0xc20059ad,
0xb5895a21,
0xb72055c9,
0xb726428c,
0xb52973ab,
0xb7205549,
0xb72d428c,
0xb52967a9,
0xb72054c9,
0xb769428c,
0xfff45631,
0x008b9a2e,
0x5529b749,
0x4c8cb780,
0x55b1b769,
0x4000ba12,
0x0d0201a8,
0xc00008ff,
0xd0299080,
0xd110a0e5,
0x0d040625,
0xffff7117,
0xb720935c,
0xb769428c,
0xb79f5631,
0xb7bf7f6e,
0x8c407fee,
0x92e0fffd,
0xc002a60d,
0x9e568400,
0x0d02c021,
0xc0309e95,
0x9d2e0d00,
0x0205a961,
0x2a70c03e,
0xcfc00a10,
0xc03e290d,
0x32442a70,
0xf0009dae,
0x0a7fa261,
0xd21076d4,
0xc003a221,
0xd3f19304,
0x750a2a3e,
0x5921d1a4,
0x9272c00b,
0x5908d226,
0xe0508520,
0x94068044,
0x940a956b,
0x941d9418,
0xb7209422,
0xb545428c,
0xc00b4d35,
0xb7809040,
0x0906428c,
0x0a10c0a6,
0xa101d208,
0x428cb780,
0x0a14c0a6,
0xa102d208,
0x9260c00a,
0x428cb720,
0x6e35b544,
0x91a0c00a,
0x428cb720,
0x6fb5b544,
0x90e0c00a,
0x99f2fff4,
0x0a869e83,
0xc00e9eaa,
0x55cc2dfc,
0xa021d210,
0x2dfcc00e,
0x99affff4,
0xa9a2d210,
0xe0919eb2,
0x09d28d00,
0x988effd4,
0xa9a2d210,
0x55cc9eaa,
0x2dfcc00e,
0x9b49fff4,
0x428cb720,
0x7c6cb79f,
0x4e2db585,
0x428cb720,
0x7cecb79f,
0x4eadb585,
0x428cb720,
0x7d6cb79f,
0x4f2db585,
0x428cb720,
0x7decb79f,
0x4fadb585,
0xb720aa11,
0xb585428c,
0xb780502d,
0xc0a6428c,
0xd2080a38,
0xc008a281,
0x76d69080,
0x9164c001,
0x29bed0f2,
0x5a19c180,
0x76fec004,
0x7c6cb59f,
0x90c2c000,
0x428cb720,
0x54b5b561,
0xd324020d,
0xc0fc5931,
0xb7202a00,
0xc200428c,
0xd0f15a19,
0xb57f296e,
0xb55f7270,
0xb59f72e8,
0xb55f7368,
0xb7257a72,
0xe092682d,
0x9e8c8d80,
0xc0069c62,
0x76d89300,
0x9384c003,
0x9980fff4,
0x0a869e83,
0xc00e9eaa,
0x55cc2dfc,
0xa021d210,
0x2dfcc00e,
0x993dfff4,
0xa9a2d210,
0x8d00e091,
0xc0029eb2,
0xffd40982,
0xd210981b,
0xc200aa21,
0xd3f252b0,
0xfff429de,
0xf0919ad6,
0xd2c88c00,
0xb780a915,
0x0244428c,
0x7e68b75f,
0x0a00c09c,
0xa105d208,
0x8d00e091,
0x428cb720,
0xaa55d0c8,
0x5a08c200,
0xb79f00c2,
0xb5827c6c,
0xd0c85fad,
0xb720aa55,
0xc200428c,
0x00c25a08,
0x7cecb79f,
0x642db582,
0xaa55d0c8,
0x428cb720,
0x5a08c200,
0xb79f00c2,
0xb5827d6c,
0xd0c868ad,
0xb720aa55,
0xc200428c,
0x00c25a08,
0x7decb79f,
0x6d2db582,
0xaa55d0c8,
0x428cb720,
0x5a08c200,
0xaa1100c2,
0x71adb582,
0xaa55d0c8,
0x428cb720,
0x5a08c200,
0xaa1500c2,
0x762db582,
0xaa55d0c8,
0x428cb720,
0x5a08c200,
0xaa1900c2,
0x462db583,
0x9360c002,
0xc00176da,
0xd3f190a4,
0x75022a3e,
0x9342c000,
0xc0007502,
0x75049226,
0x91a4c002,
0x428cb720,
0x5a21c180,
0x4eadb5c2,
0x428cb720,
0x5229b589,
0x9020c002,
0x428cb720,
0x4f2db5c2,
0x9360c001,
0x428cb720,
0x4fadb5c2,
0x92a0c001,
0xc00076dc,
0xb78093c4,
0xd032428c,
0x0902293e,
0x0629d110,
0xc09c5d08,
0xd2080a20,
0xb720a109,
0xc180428c,
0xd1105a11,
0xb5c204a3,
0xb7207aad,
0xd110428c,
0xb58204a3,
0xc0007ead,
0x76de92c0,
0x9164c000,
0x428cb780,
0xc0a60906,
0xd2080a30,
0xc000a101,
0xb7409140,
0xd1a2530c,
0xe2205e08,
0x9ea4aa05,
0xb79f9c62,
0xb7bf7cee,
0xb7df7d6e,
0xc0027dee,
0x9c228c60,
0xb720a60d,
0xb7404b8c,
0x0a164494,
0x402db580,
0x6e2db585,
0x0a42c809,
0xc9fe0902,
0xf0500a30,
0xf050a149,
0xf050a15d,
0xf010a141,
0xd0b2a255,
0x02850ea0,
0xfff40b06,
0xf23199a2,
0xd3f1aa35,
0x0d82295e,
0x9eb27500,
0xc0000a84,
0x9e5b90e2,
0x4608b5c0,
0x996cfff4,
0xffff7544,
0xb79f9204,
0xb7bf7eee,
0xb7df7f6e,
0x8c607fee,
0x5db09c22,
0x0d80c021,
0x0da0c102,
0xaa619d3e,
0xc40059b8,
0xcbfe2980,
0x32462a7d,
0xf0009dbe,
0x9c22a261,
0x428cb720,
0x9e5b0926,
0x6e35b744,
0xd0110802,
0x75101e22,
0x4826b322,
0x9c8bc010,
0x9160c000,
0xaa01d208,
0xc0007106,
0xc00e90a4,
0x9c22287c,
0x02030804,
0x0a04c09c,
0xffff0884,
0xc00e9261,
0x9c22087e,
0xb780a605,
0xb7604c8c,
0x097f428c,
0x04079ea2,
0xa169c020,
0x4038b960,
0x0d820107,
0xc09c0207,
0xd2080a28,
0x0984a902,
0xc0017680,
0xb78093e4,
0xd1104c8c,
0xd3f10535,
0x9ea32ebe,
0x0920c09c,
0xc0300a06,
0xd008a289,
0xb720a249,
0xc000428c,
0xb7605c88,
0xd1105294,
0xd0220483,
0xb54c5e18,
0xb7205631,
0xd120428c,
0xc00401c7,
0xd1100982,
0xb54c0483,
0xb7205731,
0xd110428c,
0xb5430493,
0xb72042b5,
0xb543428c,
0xb78043b5,
0xc101428c,
0xb5430498,
0xb7204455,
0xb543428c,
0xffb44535,
0x000b99d4,
0x90e0c000,
0xfffd0d84,
0xc00e9321,
0xb79f087e,
0xb7bf7f6e,
0x8c407fee,
0xa6059c22,
0x428cb720,
0x02030687,
0x0a30c0a6,
0xaa01d208,
0x55a9b7a9,
0xc0037500,
0x020392c4,
0x0a50c09e,
0xaa01d208,
0xc0037500,
0x9eab90e4,
0x91c0c000,
0x9b76ffd4,
0x428cb780,
0xc0a69eab,
0xd2080a30,
0x7500aa01,
0x93e4c002,
0x9b7cfff4,
0x743ec01c,
0xffff0d8a,
0xb78091e2,
0xb7204c8c,
0xc2804294,
0xc2405908,
0x7740aa25,
0x5a08c200,
0x00c2c101,
0x7aadb722,
0x4c0cb780,
0xe0409e8a,
0xc001a146,
0xb7699022,
0x09825551,
0x55d1b709,
0x5e30d1a2,
0x01099e9a,
0x0900c021,
0x0930c140,
0x91a0c000,
0xf0009dad,
0xd011a162,
0x9dcd0a28,
0xa162f000,
0xc1000984,
0xc1010900,
0x71110236,
0x925cffff,
0x5a30c280,
0x0a00c021,
0x0910d111,
0x0a40c146,
0xf0009dcd,
0xb786a161,
0x750058c9,
0x9184c000,
0x47cbb78b,
0xc0007500,
0xb76590e2,
0x9eab644d,
0x9964ffd4,
0x428cb780,
0xc09e0906,
0xd2080a50,
0xb79fa101,
0xb7bf7f6e,
0x8c407fee,
0xb7809c22,
0x9e5a538c,
0x4294b700,
0xaa45c040,
0x5c88c180,
0x0496c101,
0x4000ba24,
0x0528c101,
0x5c88d122,
0x00960492,
0x00920490,
0x4ecbb784,
0x0090c101,
0x6aabb723,
0x4002ba24,
0x0142e000,
0x1124d015,
0x90cac000,
0x0a7ec03e,
0x7088c810,
0x5c88d122,
0x00920096,
0x0090c101,
0x6aabb543,
0x5c88d1a2,
0x428cb780,
0x00920096,
0x0a020098,
0x4eabb584,
0xa6059c22,
0x428cb720,
0xb7849e5d,
0x7d20622d,
0x9182c001,
0x430cb740,
0x0a0ec001,
0x0a64c028,
0xc0007088,
0x0a0290b2,
0x752bb584,
0x428cb720,
0xb5840a06,
0xb720792b,
0xb789428c,
0x01835429,
0xb7419e8b,
0xb7455333,
0xc028662d,
0x01b809ec,
0x0dc0c04a,
0x9c629e94,
0x428cb720,
0x622db784,
0x2a3dcffe,
0x622db584,
0x428cb720,
0x472bb78b,
0xc0017500,
0xb7449222,
0x748473ad,
0x9124c000,
0x52adb781,
0xc0017500,
0xc0009084,
0x74829140,
0x90e4c000,
0x522db781,
0xc0007502,
0x02039344,
0x0a54c09e,
0xaa01d208,
0xc0007500,
0x74869244,
0x9144c000,
0xc09c0203,
0xd2080a70,
0x7500aa01,
0x90e4c000,
0x64adb781,
0xc000750a,
0x0a0290a4,
0x472bb58b,
0x428cb720,
0xc0a80203,
0xd2080a10,
0x7500aa01,
0x9022c001,
0x53abb741,
0x67adb705,
0x73b5b764,
0x472bb76b,
0x9e849eaa,
0xb7209c62,
0xb781428c,
0x1a1064ad,
0xc0007502,
0xb78b90f2,
0x7500472b,
0x9204c000,
0xc09e0203,
0xd2080a60,
0xc000a001,
0xb7499120,
0x02036b29,
0x0a60c09e,
0xa101d208,
0x428cb720,
0x64adb781,
0x75021a10,
0x90f2c000,
0x472bb78b,
0xc0007500,
0xb7499344,
0xb7605529,
0x01835094,
0x09e0c09e,
0x9140c000,
0xaa61d008,
0x9e529e91,
0xa229c030,
0x297cc00e,
0x55a9b789,
0x0922d012,
0xffff7104,
0xb79f9268,
0xb7bf7f6e,
0x8c407fee,
0xb7209c22,
0x05964294,
0x0dc0c09a,
0xa8f1d010,
0x754db704,
0x4000ba09,
0xd001747f,
0xb3401802,
0x009248a2,
0x0092c101,
0x612bb789,
0x2a60c00e,
0x5a0fc200,
0x9c220040,
0xb7a0a61d,
0x9e5e428c,
0x020b0387,
0x0a38c09a,
0xa982d208,
0xfff40705,
0x020b9bda,
0x0a34c09a,
0xa982d208,
0xfff49e85,
0x020b9bd2,
0x0a30c09a,
0xaa01d208,
0x9e819ea8,
0xc09a0258,
0xd2080a40,
0xb744aa11,
0xba24754c,
0x753f4000,
0x19a2d001,
0x9202c000,
0xc09a020b,
0xd2080a18,
0x0092a881,
0xb789009a,
0xc00e612b,
0xc2002a60,
0x01c45a0f,
0xc00075c0,
0x9eaa9102,
0xc02a0d82,
0xc0010d30,
0x77869040,
0x91e2c000,
0xd11d7357,
0xd11e1657,
0xd012123b,
0xd03119c2,
0xc02a6e39,
0xc0000a60,
0x70d39200,
0xd11e0c02,
0xd11d1617,
0xd0121233,
0xcc121942,
0xd0317280,
0xc0a06e39,
0xd0200a00,
0xf0100158,
0x008daa49,
0xb58076c0,
0xf010622d,
0xb580aa45,
0xf01062ad,
0xb580aa41,
0xc000632d,
0xd3f19236,
0xd0a22e5e,
0xc2005d60,
0x32445a20,
0x293ed3f1,
0x3a7cc00e,
0x32445940,
0x622db580,
0x7e6eb79f,
0x7eeeb7bf,
0x7f6eb7df,
0x7feeb7ff,
0x8c00c002,
0xa60d9c22,
0x510cb740,
0x4294b720,
0xd0080a02,
0xb741a241,
0xd01164cd,
0x75021a28,
0x9172c000,
0x474bb78b,
0xc0007500,
0xb74090c2,
0xc0006e55,
0xb7849140,
0xc20073cd,
0xc1015a08,
0xb74000c2,
0x748a6cb5,
0x90a2c000,
0xc0000906,
0xb78090c0,
0xd2084d0c,
0xb769a901,
0x9e535551,
0x5094b740,
0xa96ac020,
0x9bf3ffb4,
0x428cb720,
0x64adb781,
0x75021a10,
0x9372c002,
0x472bb78b,
0xc0027500,
0xc02192c2,
0xc0080b02,
0xc1000e82,
0x9ded0b40,
0xa2e2f000,
0x0902c021,
0x0900c140,
0xaa619d2d,
0x3a40c002,
0xf0009dad,
0xb780a261,
0xc4014c8c,
0xc0210902,
0xd2080a82,
0xc008aa01,
0xc1000900,
0xc2000aa0,
0x00c25a08,
0x7ab5b7c2,
0xf0009ddd,
0x9e6aa161,
0x0d82c100,
0x050b0992,
0x9ae7ff94,
0x9ddd0a02,
0xa261f000,
0xf0009ded,
0xc021a2e2,
0xc1400a02,
0x9d4d0a20,
0x1a10a962,
0xaa619d4d,
0x0a02c021,
0x0a40c146,
0xa9619d4d,
0xc0007480,
0xd1229142,
0xc1015e35,
0x2a7c112c,
0xc0041128,
0xb7201900,
0xb544428c,
0xb79f7c2d,
0xb7bf7eee,
0xb7df7f6e,
0x8c607fee,
0xa60d9c22,
0x030774c6,
0xc0009e5d,
0x74c490a2,
0x90a4c000,
0xc0009eb6,
0xb74092c0,
0x0205428c,
0x0a54c09e,
0xaa01d208,
0xc0007500,
0x0f0690a4,
0x9120c000,
0xc06c0205,
0x71480a60,
0xd0020f02,
0xf2080f62,
0xb720aa31,
0x73994294,
0x9344c000,
0x574db783,
0xa221f208,
0x428cb720,
0x57adb723,
0xa0a5f208,
0x428cb720,
0x582db723,
0xa0a9f208,
0x428cb720,
0x58adb723,
0xa0adf208,
0x90e0c001,
0x5c88d322,
0x5551b769,
0x0092c101,
0x6a35b740,
0x09c2c010,
0xff94010b,
0xb7209b79,
0xf208428c,
0xb583aa21,
0xb720572d,
0xf208428c,
0xb583aa25,
0xb72057ad,
0xf208428c,
0xb583aa29,
0xb720582d,
0xf208428c,
0xb583aa2d,
0xb72058ad,
0xd0524294,
0xb7890ad8,
0xba0c5249,
0xc0004008,
0x5888922a,
0x0092c101,
0x5551b769,
0x5035b742,
0xc00e9e6a,
0xff9409f2,
0x0a169b4b,
0xa231f208,
0xaa21d210,
0x0982c400,
0x0902c200,
0xa221f210,
0xa92ef208,
0x2d7dc9fe,
0xa12ef208,
0x428cb720,
0x7aadb784,
0xb3437500,
0x75004422,
0x4422b342,
0x9e533126,
0xf2083126,
0xb720a12d,
0xb784428c,
0x750273ad,
0x90c2c000,
0x3900c020,
0xa12df208,
0xaa2df208,
0x3a00c010,
0xa22df208,
0x428cb720,
0x73adb784,
0xc0007506,
0xf20891c4,
0xc080aa21,
0xc0007d00,
0x010391c2,
0x093cc09a,
0xc0000a02,
0x010390c0,
0x093cc09a,
0xd0080a0a,
0xb720a241,
0xf208428c,
0xb781a92d,
0x750464ad,
0x9102c000,
0x297dcfde,
0xa12df208,
0x9020c001,
0x0a5ecfff,
0x0a7cc7fe,
0x2128d020,
0xa12ef208,
0x428cb720,
0xc09c0203,
0xd2080a70,
0x7500aa01,
0x90e4c000,
0x5829b786,
0xc0007500,
0x9e539142,
0x2900c800,
0xc0013226,
0xf2083a20,
0xb780a22d,
0xf208428c,
0xc011a92e,
0xc09a0902,
0xd2080a3c,
0xcfefaa01,
0x75002d7e,
0xb3420a02,
0x9e544424,
0xf2083128,
0xb720a12d,
0xb783428c,
0xc2004d2b,
0xc0015a50,
0x31282a40,
0xa12df208,
0x428cb720,
0x652db781,
0xc0007508,
0xb7819164,
0x750464ad,
0x90c4c000,
0x3900c201,
0xa12df208,
0x9eab7780,
0x09829eb2,
0x09b2d001,
0x7eeeb79f,
0x7f6eb7bf,
0x7feeb7df,
0xffed8c60,
0xf8399160,
0x04b6a285,
0x4e0cb780,
0x04079e48,
0xa886c040,
0x4e94b760,
0x4d8cb780,
0x59c09e40,
0xaa05c040,
0x29fcc00f,
0xa98ac030,
0x75009e9d,
0x5da0349a,
0x8d80e033,
0x3616d010,
0xa9f9d9d8,
0x90c2c000,
0x3a00c201,
0x90e0c000,
0xc0007680,
0xc1019082,
0x74803a00,
0x9082c000,
0x3a00c011,
0xc0007440,
0x74c09122,
0x3a00c021,
0x9082c000,
0x3a00c041,
0x5d08d028,
0x501cb740,
0xe0209e2d,
0xf9f8a26d,
0x9c22aa9d,
0x8420a61d,
0x510cb780,
0xb7c09e5e,
0xc2404294,
0xa199aa45,
0x9d199e73,
0x8c80e0b1,
0x09f4c09c,
0x05857500,
0xd0089e90,
0xb7ffa962,
0xb7bf7e29,
0xb77f7e33,
0xc0007d2b,
0x9e719244,
0x7aadb784,
0xc0007500,
0xb78490e4,
0x750273ad,
0x90e2c000,
0xb7a49e71,
0xc00073ad,
0x0a829060,
0x4c0cb780,
0x5908c300,
0xe0407740,
0xc000abc6,
0x9e719122,
0x732db784,
0x0609d110,
0x284ed3f2,
0xc09e9e74,
0xd2080a58,
0x7500aa01,
0x90a4c000,
0xc0010009,
0x9e7490e0,
0x0a50c0a4,
0xaa01d208,
0xc0007500,
0x080690a2,
0x9380c000,
0xb7899e71,
0xc10155a9,
0x710c00ec,
0x9124c000,
0xc0a40203,
0xd2080a40,
0xc000a815,
0x010391a0,
0xc0a40203,
0xc0a40944,
0xd2080a40,
0xd008aa15,
0x1044a955,
0xc10175c2,
0xc00000ec,
0xb5299172,
0xb7207b31,
0x00e2428c,
0x7a31b509,
0x9100c000,
0x7b29b789,
0x0619d110,
0x7b29b589,
0xc00074c0,
0x9e719104,
0x4f29b787,
0xc0057500,
0xb72092a2,
0xc1004294,
0x5d985c08,
0x049dd110,
0x6f4db744,
0x7a29b769,
0x7b31b749,
0xd0f15938,
0xcc002e08,
0xc03c2900,
0x59e02d80,
0x9e5a3244,
0x5d409e9b,
0xb72b3526,
0x3244474b,
0x74409e52,
0xd0113244,
0xd0202956,
0xc0003144,
0xc0809082,
0x9e4c3d00,
0x0a58c09e,
0xaa01d208,
0xc0007500,
0xc0409082,
0x9dcf3d00,
0xc00076c0,
0xc1009082,
0xc0003d00,
0xc00f5a40,
0xc3802a7c,
0x31c45960,
0x77409e4c,
0x0a30c09a,
0xaa01d208,
0x528cb740,
0x39b4d002,
0x5a08c200,
0x024cc101,
0xaa11f208,
0x0482d010,
0x0e82c124,
0xc3007500,
0x02445a18,
0xd002a919,
0x028939b2,
0xa101f208,
0x462db723,
0xa106f208,
0xa189f208,
0xa08df208,
0x9eaa9e6b,
0x0ec09eb3,
0x9833ff94,
0x7740c250,
0xffff0ac0,
0x9eb392e4,
0x0982c004,
0xc124050f,
0xff940902,
0x9eb39910,
0x9927ff94,
0xb7879e71,
0x75004f29,
0x93e2c000,
0x4c0cb740,
0x5908d324,
0xc101aa19,
0xf0100524,
0xc006a9c1,
0xc3000a7c,
0x02465930,
0x2a01cffc,
0x0900c021,
0xa241f010,
0x0940c146,
0x0a00c004,
0xf0009dad,
0xc000a261,
0x9eb392e0,
0xc004050f,
0xc1240982,
0xff940902,
0x9eb39905,
0x7deeb79f,
0x7e6eb7bf,
0x7eeeb7df,
0x7f6eb7ff,
0x8c20c002,
0x91e0ff87,
0x7deeb79f,
0x7e6eb7bf,
0x7eeeb7df,
0x7f6eb7ff,
0x8c20c002,
0xb7209c22,
0x9e5a428c,
0xc0a40203,
0xd2080a50,
0x7500aa01,
0x9222c000,
0x02039e8a,
0x0d4cc0a8,
0x0a68c0a4,
0xa901d208,
0xaa41d010,
0x70880802,
0x0802d003,
0xb7869c22,
0x750056a9,
0x9162c000,
0x4d0cb780,
0xaa45c040,
0xc0007500,
0x08069082,
0x02229c22,
0xc0a40109,
0xc0a40940,
0xd2080a60,
0xd008aa01,
0x0802a955,
0xd0037104,
0x9c220802,
0x428cb720,
0x02030c06,
0x0a10c0b4,
0xc0b40103,
0xd2080914,
0xd008a981,
0xb729a941,
0x9e9a5531,
0x4000ba12,
0x72821d04,
0x9096c000,
0x55b1b749,
0x2daed3f2,
0x560cd022,
0xc01c2228,
0xc0007d3e,
0x729790a4,
0x9204ffff,
0x0e28d011,
0x448cb740,
0x02446a52,
0x0948d031,
0xaa41f008,
0x02037508,
0x0a10c0b4,
0x4a22b402,
0xa182d208,
0xb7409c22,
0x0205428c,
0x0a14c0b4,
0xaa01d208,
0xc0007500,
0x020590e4,
0x0a10c0b4,
0xa182d208,
0x0a069e5a,
0x5208c200,
0x428cb740,
0x0914c0b4,
0xa942d008,
0x32469e53,
0xa241d008,
0xa6059c22,
0xc0009e5d,
0xffb49080,
0xb780997b,
0x0d92428c,
0x0a10c0b4,
0xaa01d208,
0xffff710a,
0xb79f92c4,
0xb7bf7f6e,
0x8c407fee,
0xb7809c22,
0x9e5a508c,
0x428cb720,
0xaa45c040,
0xb7415db0,
0xc00271ad,
0xc0212a7c,
0x32440d80,
0x0df0c116,
0xf0009dbe,
0x9c22a261,
0xb720a60d,
0xb783428c,
0x75004d2b,
0x9342c003,
0x6eadb784,
0xc0037500,
0xb78192a2,
0xb7416a2d,
0xb74168ad,
0xb7616935,
0xc20069ad,
0x59405a20,
0xc0015d60,
0xc3f0297c,
0xb7a92a00,
0xc3f15531,
0x32442d00,
0x9e5229fc,
0xb7c93246,
0x31c455a9,
0x0d829e6a,
0x91e0c000,
0xf0009dad,
0xc021a1e1,
0xc0340a00,
0x9d4d0a00,
0xd3f1aa61,
0xc1012d2e,
0xd01205b8,
0x708c0922,
0x5e30d122,
0xc0210109,
0xc0320900,
0xffff0960,
0xb7809134,
0xb741412d,
0xb7606ab5,
0xb7a141ad,
0xb741682d,
0x61b967ad,
0xc0015d60,
0xcff00a1e,
0xc0310a00,
0xc2802d00,
0x59205ad0,
0xc00f2128,
0x9e542ac0,
0x32d832d4,
0x9a36c0d4,
0x287cc00e,
0x098232d0,
0x91c0c000,
0xf0009dad,
0xc021a2e1,
0xc0340a00,
0x9dcd0a00,
0xa1e1f000,
0x2eaed3f2,
0x0d52d012,
0x5e30d122,
0x0109735d,
0x0900c021,
0x0970c032,
0x9154ffff,
0x7eeeb79f,
0x7f6eb7bf,
0x7feeb7df,
0x9c228c60,
0xb720a60d,
0x9e5e428c,
0xc09a0203,
0xd2080a18,
0x7500aa01,
0x9344c004,
0x6fadb7a4,
0x6e2db764,
0xc0007540,
0xb7449222,
0x729b6eb5,
0x9188c000,
0xc09a0203,
0xd2080a1c,
0xc101a901,
0x71041254,
0x90c6c000,
0xc00474c0,
0x02879022,
0xb7840103,
0xc09a6ead,
0xd008091c,
0x1258a941,
0xc0037104,
0xb76992a8,
0x0e865531,
0x55acc200,
0x2dfcc00e,
0x98a9ffb4,
0x428cb720,
0x09d2c004,
0x6eadb784,
0x089cc09a,
0xb5801258,
0xb7204029,
0x0203428c,
0x0a1cc09a,
0xaa01d208,
0xb5811a04,
0xb72052ad,
0x0203428c,
0x0a1cc09a,
0x6335b741,
0xaa01d208,
0x5531b769,
0xc2000103,
0xcff05a1c,
0xc1010d01,
0xc0a00528,
0xff740900,
0xb7209b65,
0xb769428c,
0xc2005531,
0xc00e55ac,
0xffb42dfc,
0xb7409a1e,
0xf048448c,
0x7508aa41,
0x9084c000,
0xa2c2f048,
0x428cb720,
0xc09a0203,
0xd2080a1c,
0xb749aa01,
0x1a04612b,
0x5a0cc200,
0x291dcff0,
0x2a60c00e,
0xb5893244,
0xb740612b,
0x0205428c,
0x0a54c09e,
0xaa01d208,
0xc0007500,
0x02059224,
0x0a18c09a,
0xa881d208,
0x00940092,
0x612bb789,
0x2a60c00e,
0x5a0fc200,
0xa241d208,
0x428cb720,
0xaa41d208,
0x752db744,
0x4000ba24,
0xb5840244,
0xb7207aad,
0xb784428c,
0xc09c7aad,
0xb5800880,
0xb7204029,
0xb784428c,
0xb7447aad,
0x1244742d,
0x7aadb584,
0x7eeeb79f,
0x7f6eb7bf,
0x7feeb7df,
0x9c228c60,
0xc008a61d,
0xb7a08460,
0x9e6c4294,
0xc0a69e69,
0xd2080a30,
0xb7a1a981,
0x74c0652d,
0x9244c025,
0x0a069e6a,
0x0934c0a6,
0xa241d008,
0x428cb780,
0xc09e096a,
0xd2080a5c,
0xb720a101,
0xb564428c,
0xb7207fad,
0x0203428c,
0x0a70c09c,
0xaa01d208,
0xc0007500,
0xb78490e2,
0x0a047b2d,
0x7b2db584,
0x428cb740,
0x0918c09a,
0xaa41d008,
0xd0080a04,
0xb780a241,
0x9ea2428c,
0xc09a0109,
0xc09a0d18,
0xd010091c,
0xd008aa41,
0x7104a941,
0x4442b41a,
0x428cb720,
0x702db784,
0xb5841a04,
0xb740702d,
0x0205428c,
0x0a18c09a,
0xa881d208,
0x00929e92,
0xb7890094,
0xc09c612b,
0x2a100d70,
0x5a0bc200,
0xa241d010,
0x4294b720,
0xc09a9e4c,
0xd2080a18,
0x0092a881,
0x0092c101,
0x612bb789,
0xc0f00109,
0xd1242900,
0xc2005821,
0x9e435831,
0x70c0c812,
0xb5842a0c,
0xb72073cd,
0x09044294,
0x9e4a0385,
0x0918c09a,
0xa8c1d008,
0xc1010092,
0xb7890092,
0xc00e612b,
0xc2002a60,
0xb59e5a0f,
0xd0087468,
0x7500aa41,
0x9224c005,
0x6ecdb784,
0x754db584,
0x428cb720,
0x4d35b745,
0xc0027684,
0xb74490e2,
0x74806ead,
0x9242c000,
0x522db781,
0xc0007500,
0xb78490e2,
0x7500702d,
0x911cc000,
0xc0007682,
0x768090a2,
0x9244c001,
0x742db784,
0x1128e000,
0x9142c000,
0x51adb781,
0xc0007088,
0x768090a8,
0x9324c000,
0xc09e0103,
0x0a060954,
0xa241d008,
0x428cb720,
0xb5440902,
0xb7207b2d,
0xb544428c,
0xb7207aad,
0xb784428c,
0xb5846ead,
0xb55e742d,
0xb7207468,
0x0a06428c,
0x73adb584,
0x428cb720,
0x522db781,
0x702db584,
0x428cb720,
0x0a7ec00e,
0xb5850d86,
0xb7404d2d,
0xc09a428c,
0xd0080944,
0x0a04aa41,
0xa241d008,
0x428cb780,
0x01099ea2,
0x0d44c09a,
0x0940c09a,
0xaa41d010,
0xa941d008,
0xd0147104,
0xb4221244,
0xc0004448,
0xd01093a0,
0xd110aa41,
0xd0080639,
0xb780a245,
0xc101428c,
0x01850146,
0x0a40c09a,
0x09c0c09a,
0xa901d208,
0xaa65d008,
0x71040d84,
0x1144d020,
0x9086c000,
0xa166d008,
0x428cb720,
0x0216c101,
0x02030109,
0x0a40c09a,
0xaa01d208,
0xc09a9e8a,
0xc09a0940,
0x72d90d44,
0x92b8fffe,
0x5429b789,
0xc09a0218,
0xd2080a40,
0x0218aa05,
0x0a40c09a,
0xa911d208,
0xd2081904,
0xb740a111,
0x9e544294,
0x0a70c09c,
0xaa01d208,
0xc0017500,
0xc00e91c2,
0xd1102bfc,
0x9e52062f,
0x0a40c09a,
0xaa05d208,
0x0930c09a,
0xa241d008,
0x428cb780,
0xc09a0109,
0xd0080930,
0xd1e8a942,
0xc101a949,
0xc09a0244,
0xd2080a40,
0xb720a111,
0x0203428c,
0x0a30c09a,
0xaa01d208,
0x7b2db744,
0x5a08c200,
0xb54400c2,
0xc001772d,
0x9e5492a0,
0x0a40c09a,
0xa901d208,
0x0124c101,
0x0940c09a,
0xaa45d008,
0xd0080a04,
0xb780a245,
0x0109428c,
0x0940c09a,
0xa941d008,
0x9ea20228,
0xc09a0908,
0xd0100d40,
0x7104aa45,
0x90b8c000,
0xd0101a08,
0xb780a245,
0x0109428c,
0x0940c09a,
0xa941d008,
0x02449ea2,
0x0a40c09a,
0xaa05d208,
0x0d30c09a,
0xa241d010,
0x428cb740,
0x0220c101,
0x0a40c09a,
0xaa05d208,
0x0934c09a,
0xa241d008,
0x428cb720,
0x5429b749,
0x7b2db784,
0x71049e8a,
0x0d38c09a,
0x9134c000,
0xc09a0210,
0xd2080a40,
0xc000aa05,
0x020390e0,
0x0a34c09a,
0xaa01d208,
0xd0109e69,
0xb786a241,
0xb7205629,
0x75004294,
0x73cdb744,
0x90c2c000,
0x744db781,
0x9080c000,
0x74cdb781,
0xb5847486,
0xc000624d,
0x74829182,
0x9222c000,
0x428cb720,
0x622db784,
0xc0003a04,
0xb7209100,
0xb784428c,
0xc008622d,
0xb5843a00,
0xb780622d,
0xc09a428c,
0xd2080a30,
0xc200aa01,
0xc1015a08,
0xf2080242,
0x7480a911,
0x9222c000,
0xa111f248,
0x428cb780,
0xc09a0902,
0xd2080a30,
0xc200aa01,
0xc1015a08,
0xf2080242,
0xb742a111,
0x76804ed5,
0x93e2c000,
0x428cb780,
0x0a30c09a,
0xaa01d208,
0x5a08c200,
0x0242c101,
0xa911f248,
0xa111f208,
0x428cb780,
0xb5420902,
0xc09a4ecd,
0xd2080a30,
0xc200aa01,
0xc1015a08,
0xf2480242,
0xb720a112,
0xb742428c,
0x02034f4d,
0x0a30c09a,
0xaa01d208,
0xc2007480,
0xc1015a08,
0xf2480242,
0xb584aa11,
0xb72062ad,
0xc000428c,
0x0a029122,
0x6c2db544,
0x4f4db582,
0x91e0c000,
0xc09a0203,
0xd2080a34,
0xc200aa01,
0xc1015a08,
0xf2480242,
0xb584aa11,
0xb7826c2d,
0xb7204fcd,
0x7500428c,
0x9122c000,
0x6d2db584,
0xb5820a02,
0xc0004fcd,
0x020391e0,
0x0a38c09a,
0xaa01d208,
0x5a08c200,
0x0242c101,
0xaa11f248,
0x6d2db584,
0x428cb720,
0x4155b740,
0xb744048b,
0x5d1072ad,
0x62adb784,
0x097c5910,
0x2901cffe,
0x6125c101,
0x554db761,
0xb5840228,
0xb720632d,
0xd012428c,
0xb784193e,
0x769c6c2d,
0xb5840228,
0xb7206cad,
0xb784428c,
0x01286d2d,
0x6dadb544,
0x90bcc000,
0xc0000d3a,
0x0d8290a0,
0x7286c812,
0x428cb720,
0x4d0cb780,
0x2daed031,
0x5531b769,
0x08060c02,
0x4001ba1b,
0x04b8c101,
0x5e30d1a2,
0xc0219ea2,
0xc1120d00,
0xc0010d10,
0xb5009340,
0xb7844049,
0xf21072ad,
0x1a04a929,
0x5a40c200,
0xc00e1904,
0xc00f297c,
0x32442a7c,
0xf0009dae,
0x9e69a261,
0xb7419e54,
0xc03672ad,
0x9dcd0a00,
0xa161f000,
0x732db741,
0x9dcd0a20,
0xa161f000,
0x722db741,
0x1a30c008,
0xf0009dcd,
0xb781a161,
0x9e5264ad,
0x75041a0c,
0x0940c020,
0x90b2c000,
0xf0009dad,
0x0c04a1e1,
0xc1000c84,
0xb7200d00,
0xd010428c,
0xb7890506,
0x708855a9,
0x903cfffe,
0xc0007540,
0x048b9182,
0x5649b786,
0xc0007500,
0xb58292c4,
0xc00057cd,
0x9e699240,
0xb781048b,
0xb74154ad,
0xb589552d,
0xb7206b29,
0xb544428c,
0xb7246ccb,
0xb524732d,
0xb7406d4b,
0xf048448c,
0x7508aa41,
0x90a4c000,
0xf0481a0c,
0xb720a241,
0xe272428c,
0xb7c48d80,
0xb7c46fb5,
0xc0006e2d,
0xff949340,
0xb72098cf,
0xe272428c,
0x02038d80,
0x0a30c0a6,
0xaa01d208,
0xc00b7500,
0xb78493e4,
0x71886e2d,
0x90e4c000,
0x6fadb784,
0xc0007399,
0xffd49082,
0xb7809beb,
0xc09c428c,
0xd2080a00,
0xffb4a982,
0xc01c989f,
0x0281743e,
0xfffe0d92,
0xb7809342,
0x0b02428c,
0xc0a60906,
0xd2080a34,
0xb780a301,
0xc09e428c,
0xd2080a58,
0xb720a101,
0x0203428c,
0x0a10c0a6,
0xaa01d208,
0xc0007500,
0xb54b9082,
0xb720472b,
0xc00e428c,
0xb7292bfc,
0x10f25429,
0x1992d012,
0x2dfccffe,
0x99b5ffb4,
0xb7869e69,
0x75005629,
0x9162c000,
0x428cb720,
0xb5830a16,
0xb7205d2d,
0xb584428c,
0x048b40ad,
0x5649b5c6,
0x428cb720,
0x472bb78b,
0xc0007500,
0x010392e2,
0x0910c0a6,
0xaa41d008,
0xc0007500,
0xd00891e2,
0xb740a341,
0x0205428c,
0x0a14c0a6,
0xaa01d208,
0x0958c09e,
0xa241d008,
0x428cb780,
0x0a58c09e,
0xaa01d208,
0xc0007500,
0xffd49082,
0xb7209af5,
0x0a02428c,
0x7e2db584,
0x428cb720,
0x7fadb584,
0x428cb720,
0x5631b769,
0x984fff94,
0xb7809e69,
0xb743428c,
0xc09c6a2b,
0x74800a74,
0xa281d208,
0x9102c006,
0x428cb720,
0xc09e0203,
0xd2080a58,
0x7500aa01,
0x9022c005,
0xc09c0203,
0xd2080a74,
0xb769aa01,
0xf2515531,
0xc2008c88,
0x00c25a08,
0x7035b740,
0x09a6c008,
0xff54010b,
0xb7809b0d,
0xd208428c,
0x018ba921,
0x0a48c0a8,
0xa101d208,
0x428cb720,
0xa965d029,
0xb7860c02,
0x9ea956a9,
0x08ccc0a8,
0x0a027500,
0x0a42d002,
0x05815150,
0x4029b540,
0x9300c000,
0xa969d029,
0xc0a80214,
0xd2080a40,
0xb780a192,
0xd030428c,
0x0128a92a,
0x0960c0ac,
0xa142d008,
0x4049b780,
0x0639d110,
0x29ced3f2,
0x428cb720,
0x2e0ed3f1,
0x01030c04,
0x0948c0a8,
0xa941d008,
0xfffe7088,
0x048b93f2,
0x64cdb781,
0xc0007508,
0xb78b91a4,
0x7500472b,
0x9102c000,
0x098e9e8b,
0x0de0c06c,
0x90e0c000,
0xb7649e8b,
0xc06c73ad,
0xffb40de0,
0x9e699af2,
0x56a9b786,
0xc0017500,
0xb7209082,
0x0203428c,
0x0a54c09e,
0xaa01d208,
0x75009e8b,
0x0dd0c07e,
0x9102c000,
0x73adb764,
0x9adbffb4,
0x9220c000,
0x01099e8a,
0x0d60c06c,
0x48d8b960,
0x9e919e53,
0xaa65c020,
0xc0100904,
0xffffa269,
0xb7209321,
0x0a7f428c,
0xb5890902,
0xb7805229,
0xc0a4428c,
0xd2080a5c,
0xb720a101,
0xb769428c,
0xff945631,
0xb720993e,
0x0902428c,
0x55a9b789,
0x0890c0b4,
0x4029b580,
0x428cb780,
0x0a14c0b4,
0xa101d208,
0x428cb780,
0x0a50c0a4,
0xa101d208,
0x9080c001,
0xb9609e92,
0xb7204030,
0xc100428c,
0x0d045c8c,
0x0493d110,
0x4eabb544,
0x428cb720,
0x0493d110,
0x4f2bb544,
0x428cb720,
0x0493d110,
0x4fabb544,
0x428cb780,
0x0498c101,
0x504bb544,
0x90a1ffff,
0x9340fff8,
0x74eeb79f,
0x756eb7bf,
0x75eeb7df,
0x766eb7ff,
0x8c60c00a,
0xf8399c22,
0xb720a205,
0x0902428c,
0xb7890d86,
0xc09a5429,
0x0a0808c0,
0x4029b580,
0x428cb780,
0x0a44c09a,
0xa101d208,
0x9320c000,
0xa1c6d008,
0x428cb780,
0x0146c101,
0xc09a0185,
0xc09a0a40,
0xd20809c0,
0xd008a901,
0x0d84aa65,
0xd0207104,
0xc0001144,
0xd0089086,
0xb720a166,
0xc101428c,
0x01090216,
0xc09a0203,
0xd2080a40,
0xc09aaa01,
0x72d90940,
0x9398fffe,
0xc09a0203,
0xd2080a10,
0x09c2aa01,
0x52adb581,
0x428cb720,
0xc09a0203,
0xd2080a14,
0xb585aa01,
0xb7404c29,
0x0205428c,
0x0a10c09a,
0xaa01d208,
0x091cc09a,
0xd0080a04,
0xb780a241,
0x097f428c,
0x0a18c09a,
0xa101d208,
0x428cb720,
0x5531b769,
0x74b5b740,
0xc0980103,
0xff540910,
0xb72099cd,
0xb781428c,
0xb74952ad,
0xc200612b,
0xcff05a0c,
0xc00e291d,
0x32442a60,
0x612bb589,
0x428cb720,
0xb5840a02,
0xf9f86fad,
0x9c22aa1d,
0xc006a61d,
0xb7208440,
0xf1d2428c,
0xb7238d00,
0xb7c35ab5,
0xa09a59ad,
0x592db783,
0x0a06a211,
0x5218c200,
0x28ced3f2,
0x2cfcc00e,
0xb723a09e,
0x05835a2d,
0xff74a095,
0xb7209ab2,
0xe1d14294,
0xb9608d00,
0xb7ed4028,
0xb7ed5a49,
0x9e495ad1,
0x4aadb783,
0xa241f008,
0x4b2db783,
0xa245f008,
0x4badb783,
0xa249f008,
0x4c2db783,
0xf00808c0,
0x0940a24d,
0x91c1ffff,
0x5a55b743,
0xd3f29e4a,
0xc0b429ee,
0xb7a909aa,
0xb7a97d51,
0xff547dc9,
0xb720996d,
0x0d02428c,
0x4028b960,
0x7da9b5a9,
0x428cb720,
0x7d31b5a9,
0x428cb720,
0x5a29b5ed,
0x428cb720,
0x5ab1b5ed,
0x428cb720,
0xaa41f210,
0x5c90c100,
0x0493d110,
0xb5830d04,
0xb7204aad,
0xf210428c,
0xd110aa45,
0xb5830493,
0xb7204b2d,
0xf210428c,
0xd110aa49,
0xb5830493,
0xb7804bad,
0xf210428c,
0x0f40a94d,
0x0498c101,
0x4c4db543,
0x9381fffe,
0x428cb720,
0x0902aa11,
0x0982c021,
0x592db583,
0x428cb720,
0x0d02c021,
0x0980c014,
0x59adb5c3,
0x428cb720,
0xc014a896,
0xb9600d10,
0xb5234038,
0xb7205a35,
0xaa19428c,
0x5aadb583,
0x428cb780,
0x0a30c0a6,
0xa101d208,
0x428cb780,
0x0a34c0a6,
0xa101d208,
0x428cb7c0,
0xd2f1008d,
0xb5820a68,
0xb7205e2d,
0x9e494294,
0x4badb781,
0xf0009dbd,
0xb781a261,
0x9dae4fad,
0xa261f000,
0xffff1890,
0x008d92a1,
0x5629b786,
0xc0057500,
0xc00e9022,
0xb5850a7e,
0xb7204d4d,
0x0a82428c,
0xb5a40e86,
0xb7206ead,
0xb5a4428c,
0xb7206f2d,
0xb5a4428c,
0xb720702d,
0xb5a4428c,
0xb72073b5,
0xb5a4428c,
0xb780742d,
0xc09e428c,
0xd2080a50,
0xb780a281,
0xc09e428c,
0xd2080a58,
0xb720a282,
0xb781428c,
0xc09a52ad,
0xb5800890,
0xb7204029,
0xb785428c,
0xc09a4c29,
0xb5800894,
0xfff44029,
0xb7409a80,
0x9eaa428c,
0x02059e6b,
0x0a40c09a,
0xaa01d208,
0x4038b960,
0xc09a0128,
0xd0080940,
0xb780a245,
0xd110428c,
0x0d040629,
0x0a20c09c,
0xa189d208,
0x92e1ffff,
0x428cb780,
0xf2080902,
0xc09ca94e,
0xd2080a70,
0xb720a101,
0xf208428c,
0x9eb1aa49,
0x72b5b544,
0x428cb7a0,
0x554db761,
0xb764008b,
0xc10172b5,
0xc09465b9,
0x9eb19ac5,
0xb781008b,
0xb5045f4b,
0xb740732d,
0x75004294,
0x9142c000,
0x0a6a9e52,
0x095cc09e,
0xa241d008,
0x9140c000,
0x9e549eb1,
0x54cdb741,
0x0a5cc09e,
0xa101d208,
0x428cb720,
0x0d7f0902,
0x54adb781,
0x08e0c09e,
0x4040b960,
0x4029b580,
0x428cb780,
0xc09c0228,
0xd2080a00,
0x0904a106,
0x9301ffff,
0xb7209eb1,
0xb781428c,
0xb585654d,
0xb720512d,
0xb785428c,
0x7508512d,
0x9304c000,
0x7455b741,
0x7e80c100,
0x9242c000,
0x1a0c0103,
0x0940c0a8,
0xa241d008,
0x2d00c100,
0x428cb720,
0x0a047680,
0x1a42d001,
0x51adb585,
0xb741008d,
0xb780652d,
0xb741428c,
0x748064b5,
0xd0020902,
0xc0a80922,
0xd2080a10,
0xb780a101,
0x7684428c,
0xd0010902,
0xc0a80922,
0xd2080a44,
0xb720a101,
0xb785428c,
0x7506512d,
0x9162c000,
0xc0007500,
0xc8099104,
0xc72a0a42,
0xb5850a20,
0xa99e682d,
0x776eb79f,
0x77eeb7bf,
0x786eb7df,
0x78eeb7ff,
0x8c40c008,
0x92e0ff75,
0x8440a61d,
0x428cb720,
0xc0a60203,
0xd2080a30,
0x7500aa01,
0x90a4c00a,
0xc09e0203,
0xd2080a58,
0x7500aa01,
0x90c2c001,
0x5529b7a9,
0x448cb7c0,
0x9320c000,
0x0a58d011,
0x2a7cc00e,
0x024c6a52,
0x0ac8d032,
0x9080c000,
0x98d2ff74,
0xaa21f210,
0x750a0d92,
0x9344ffff,
0x0a52d011,
0xc00e0289,
0xb7202afc,
0xb789428c,
0x710a55a9,
0x9088ffff,
0x428cb720,
0xc09e0203,
0xd2080a58,
0x7500aa01,
0x9364c001,
0xb7c99ea3,
0xff9455b1,
0xb7809922,
0xc0a6428c,
0xd2080a30,
0x7580ab01,
0x9024c008,
0x9eaa0a86,
0xc00e56d8,
0x058b2efc,
0x98b5ff74,
0x9eb19eb2,
0x008b018d,
0x058d010d,
0xa319a31d,
0xffb4a295,
0xb7209941,
0xb740428c,
0x9e744c8c,
0x4590b760,
0xa905c220,
0x6631b74d,
0x04879e73,
0x99afff74,
0xff74058b,
0xb7809a42,
0x097f518c,
0xc2209ea2,
0xb720a149,
0x0203428c,
0x0a10c0a8,
0xaa01d208,
0xc0007500,
0xb78591a2,
0xb764672d,
0x01837fb5,
0x09f0c0b0,
0x9c629ea4,
0x9080c000,
0x472bb58b,
0x428cb720,
0x6eadb784,
0xb5840a04,
0xb7206ead,
0x0203428c,
0x0a58c09e,
0xaa01d208,
0xc0017500,
0xb7849322,
0x0a046f2d,
0x6f2db584,
0x4294b740,
0x0d54c09e,
0xaa41d010,
0xc0007500,
0x09029342,
0xa141d010,
0x428cb720,
0x5429b789,
0xc09a0218,
0xd2080a44,
0x0098aa05,
0x08c0c09a,
0x4229b540,
0x428cb780,
0xc09a1904,
0xd2080a18,
0xb720a101,
0xb784428c,
0x750673ad,
0x9182c000,
0x7dadb784,
0x7cadb584,
0x428cb720,
0x7d2db784,
0x7dadb584,
0x428cb780,
0xc09e0a82,
0xd2080a50,
0xb720a281,
0xb744428c,
0x74806fad,
0x91a2c000,
0x6eadb784,
0xc0007088,
0xfff49104,
0xb72098d0,
0xb5a5428c,
0xb7204d2d,
0xc010428c,
0x0d820c82,
0x5529b749,
0x55a9b769,
0x9140c000,
0xf0009dcd,
0x9dcda0e2,
0xa1e2f000,
0x2d2ed3f1,
0x0922d012,
0xd1227086,
0xc0215e30,
0xffff0a00,
0xb7439234,
0x76806a33,
0x93a4c001,
0x5d2db783,
0x09020b82,
0xd00a7502,
0x75040bf2,
0x0922d001,
0x0a027508,
0x0a42d001,
0x312875c0,
0x90a2c000,
0xc0009e56,
0x748090c0,
0xd0010b06,
0x0f820b62,
0x4b22d012,
0xc000068f,
0x9eab9360,
0x9eb29e6b,
0xff940a84,
0x754898b8,
0x9324ffff,
0xc00075c0,
0x9eab9164,
0x0a849e6b,
0xff94050d,
0x754e98ac,
0x9324ffff,
0x77480e84,
0x90a2c000,
0xffff9e7d,
0xb79f90c0,
0xb7bf7d6e,
0xb7df7dee,
0xb7ff7e6e,
0xc0027eee,
0x9c228c40,
0x4c94b740,
0x428cb720,
0xa9eac020,
0x64adb741,
0xd1105d88,
0x748404b3,
0x7eadb782,
0x580cc200,
0x90a4c000,
0x0841cd6e,
0xcfff9c22,
0xc4600850,
0x9c220800,
0xc002a61d,
0xd0118440,
0xd2240a32,
0x03875ab0,
0x07879e6c,
0x0a00c021,
0x0a30c03c,
0xaa619d4d,
0x428cb740,
0xc1809ea2,
0xcff05a88,
0x5d212d00,
0x2a7cc00e,
0xb55f0154,
0xb59f7472,
0xc06274ea,
0xf0080900,
0xc101a9c1,
0x050b0244,
0xf0080246,
0xb720a241,
0xf0d1428c,
0xb77f8c00,
0xda08746a,
0xb783a905,
0xc021452d,
0x01260d00,
0xc03a0244,
0xb5830d00,
0x9d2e452d,
0x9e6ca962,
0x2d7ec7ff,
0x0a00c021,
0x7af4b55f,
0x0a20c03a,
0xaa619d4d,
0x2a7ec7ff,
0x7b6cb59f,
0xc0219e6c,
0xc03a0a00,
0x9d4d0a10,
0xa211aa61,
0xc0219e6c,
0xc03a0a00,
0x9d4d0a30,
0x058baa61,
0x0d80c021,
0xc042a215,
0x9d3e0dc0,
0x050ba9e2,
0x2dfec00f,
0x0d00c021,
0x7c74b57f,
0x0d50c042,
0xa9629d2e,
0xc00f070b,
0xc0212d7e,
0xb55f0f00,
0xc0427cf4,
0x9d6e0f20,
0x9e6ba8e2,
0x2cfccffe,
0x0980c021,
0x7df4b53f,
0x09b0c042,
0xa9e19d3d,
0xc00f9e6c,
0xc02129fe,
0xb57f0a00,
0xc0467d6c,
0x9d4d0a60,
0xb720aa61,
0x0109428c,
0x297cc3ff,
0xc3fe5941,
0xb55f2a7c,
0xb59f776a,
0x00d277ea,
0x42adb783,
0x05220526,
0x0526c101,
0x0244c101,
0x42adb583,
0x428cb720,
0xb7839ebb,
0xc10143ad,
0xb5830244,
0xb7c043ad,
0xfff4428c,
0x02dc9b35,
0xb783008b,
0x710042ad,
0x90c6c000,
0x0a0600ee,
0x5629b58c,
0xb7809e6a,
0xd3a4528c,
0xc0215918,
0xc0420900,
0xd1300910,
0x9d2d0529,
0x9e92a961,
0xa9c2d858,
0xa8c5d858,
0xa8cad858,
0xa84ed858,
0xcff00205,
0xc00f2a00,
0xc1002d7c,
0xc20059e1,
0x5d415a21,
0x297cc00e,
0x0246c101,
0x05220122,
0x01b0c101,
0xa241d858,
0xa145d858,
0xa14ad858,
0xa1cdd858,
0xa9619d6e,
0xaa51d858,
0xf0185961,
0x0128a95e,
0x7decb79f,
0xa9c1f058,
0x8c80f0d1,
0x0528c101,
0x7d6cb79f,
0xa9c6f058,
0xa83dda08,
0xb79f01b8,
0xf0587c6c,
0xb7bfa8d2,
0xf0587af4,
0xda08ab55,
0xf058aab9,
0xf058a8c9,
0xc101a84e,
0xb79f05b8,
0xc1017cec,
0x087f0490,
0x0098400c,
0x040ac101,
0xd858701b,
0xf018a151,
0xf058a15e,
0xf058a1c1,
0xf058a1c6,
0xf058a0c9,
0xf058a0d2,
0xc000a04e,
0xd0d891b2,
0xd110aa49,
0x0a041551,
0xa155f058,
0xa249d0d8,
0x90c0c000,
0x026ac101,
0xa255f058,
0xaa59f058,
0x7b6cb75f,
0x4d7d9ea2,
0xc0007295,
0xd0d891b2,
0xc101aa4d,
0xf0581124,
0x0a04a159,
0xa24dd0d8,
0x90a0c000,
0xf0580244,
0xb720a259,
0x0203428c,
0x0a10c0a8,
0xaa01d208,
0xc0007500,
0xb7859142,
0xe0d265ad,
0x058f8d00,
0x9ea4018f,
0xb79f9c62,
0xb7bf7b6e,
0xb7df7bee,
0xb7ff7c6e,
0xc0047cee,
0x9c228c40,
0xaa71d810,
0x753edffc,
0x48a2b340,
0x428cb720,
0x522db581,
0x428cb720,
0xaa71d810,
0x51adb581,
0x428cb720,
0xaa71d810,
0x702db744,
0x5a05c200,
0xb3407088,
0x0a0248bc,
0x702db584,
0xa60d9c22,
0x428cb720,
0xc0a60203,
0xd2080a30,
0xb7c9ab02,
0x778055a9,
0x9244c002,
0xc2000a86,
0x9ea55238,
0x2efcc00e,
0xff54058b,
0x9eab99f2,
0x9a4bff74,
0x428cb720,
0x64adb781,
0x75061a08,
0x4832b363,
0x92d2c000,
0x5908d226,
0xe0508520,
0x94088044,
0x940c940a,
0xc1019401,
0xc0000982,
0x09869120,
0x90c0c000,
0xc000098e,
0x098a9060,
0x56b1b746,
0x0a02c020,
0x5930c300,
0xb3247680,
0xc1404822,
0x32460900,
0x0900c021,
0xf0009dad,
0x0203a261,
0x0a60c09e,
0x5a2db763,
0xa902d208,
0x09069eb3,
0x9861ff54,
0xb79f058b,
0xb7bf7eee,
0xb7df7f6e,
0x8c607fee,
0x92a0ff5a,
0x7eeeb79f,
0x7f6eb7bf,
0x7feeb7df,
0x9c228c60,
0xc014a61d,
0xb57f8400,
0xd0506ff4,
0xd050aa61,
0x1a10a9e6,
0x1d880389,
0x2bfcc00e,
0x2dfcc00e,
0x982eff34,
0x0a72d011,
0x5b30d224,
0x4e0cb780,
0xc380017e,
0x01285888,
0x4c8cb780,
0x706cb53f,
0x796cb55f,
0xb75f0278,
0xb59f706c,
0xb78072ec,
0xb7204c0c,
0x040d428c,
0xb59f0228,
0xb780606c,
0xc040510c,
0xb51f0c00,
0x02785cf4,
0x5a6cb59f,
0x4d0cb780,
0xc02100f2,
0x02780c00,
0x7becb59f,
0x518cb780,
0x7a74b51f,
0x02789e73,
0x7c6cb59f,
0xb5890a02,
0x9e747c29,
0x058d050d,
0x9e71078d,
0xc0219e72,
0xc0210d00,
0xc0210980,
0xc0210d80,
0xc0210a00,
0x048d0f80,
0x0d00c01e,
0x0990c01e,
0x0da0c01e,
0x0a70c014,
0x0f80c010,
0x0c11cfd0,
0x0880c021,
0x0c80c021,
0x0900c021,
0x7274b55f,
0x736cb57f,
0x74f4b57f,
0x5d6cb59f,
0x71f4b5ff,
0x5ef4b51f,
0x08a0c010,
0x0cb0c010,
0x0900c004,
0x1d60c00a,
0x19e0c00a,
0x1de0c00c,
0x1a20c004,
0x0c600fe0,
0x5e6cb53f,
0x5df4b53f,
0x636cb55f,
0x62f4b55f,
0x626cb57f,
0x7b74b57f,
0x79ecb59f,
0x75f4b5ff,
0x7574b51f,
0x08b0c002,
0x0cb0c002,
0x0970c00e,
0x09d00d70,
0x0de0c002,
0xc0040a70,
0xc0040fe0,
0xb53f0c60,
0xb53f61ec,
0xb55f7474,
0xb55f73ec,
0xb57f6174,
0xb57f60ec,
0xc0045ff4,
0xb59f0890,
0xc00c5f6c,
0xc0240ca0,
0xc00e0950,
0xc0121d50,
0xc0300980,
0xc0320dd0,
0xb5ff0a40,
0xb51f7674,
0x1f906c74,
0x0c30c01e,
0x6becb53f,
0x6b74b53f,
0x1880c002,
0x0cb0c062,
0x6aecb55f,
0x6a74b55f,
0x0910c00e,
0x0d60c014,
0x76ecb57f,
0x69f4b57f,
0x19d0c00a,
0x0dd1cfe0,
0x696cb59f,
0x68f4b5ff,
0x0a31cfce,
0xb51f1f90,
0xcfde6874,
0xb53f0c41,
0xb53f67ec,
0xb55f6774,
0xb55f66ec,
0xb57f6674,
0xb57f776c,
0xb59f65f4,
0xb5ff77ec,
0xb51f7874,
0x189078f4,
0x0cd1cf94,
0x0971cfb8,
0x0d01cfe6,
0x09c0c02c,
0x0db0c012,
0x0a70c02a,
0x0ff0c028,
0x0c00c032,
0x64ecb53f,
0x6474b53f,
0x7d6cb55f,
0x7af4b55f,
0x6f6cb57f,
0x6ef4b57f,
0x6e6cb59f,
0x6d74b5ff,
0x6cf4b51f,
0x9220c042,
0x09829ebb,
0x9841ff74,
0x428cb720,
0x7decb53f,
0x6a2bb743,
0xc0037480,
0xb7849364,
0x0b0273ad,
0x75020e82,
0x0b62d00a,
0xd0017504,
0x75800ed2,
0x90c4c000,
0x09067740,
0x0922d001,
0x7decb77f,
0x5a0cc100,
0xd0206963,
0x08020138,
0x0abec001,
0xd0200405,
0x9d0903a8,
0x0a80cfc0,
0x0c28c03a,
0x4018b960,
0x4e52d011,
0x7decb73f,
0x5a08c200,
0x02480240,
0x00c2d020,
0x04f0d010,
0xb7807580,
0xb7405a2b,
0x9dcb502b,
0x4002ba24,
0x5a28c200,
0xc03e224a,
0x31c4297c,
0x4052b760,
0x462bb720,
0x92a4c000,
0x40cbb784,
0x4acbb744,
0x76d3b743,
0x4002ba24,
0x5a28c200,
0x5950224a,
0xc3ff9ea1,
0xc03e2940,
0x31b42d7c,
0xd3f13514,
0x75062a0e,
0x90e2c000,
0x726cb75f,
0xf0009dad,
0xba21a1e1,
0xc03e4002,
0x9e5b2dfc,
0x5a28c200,
0x3246224a,
0x7374b77f,
0xf0009dbe,
0xb79fa261,
0x9dcd74ec,
0xa162f000,
0x0c080804,
0x91c1fffd,
0xff949ebb,
0xb7ff9a5e,
0xd21072f4,
0xc01caa61,
0xc000753e,
0xc0009324,
0xff349080,
0x9ebb9bd1,
0x9be0ff54,
0x743ec01c,
0xffff0d8a,
0xb7809302,
0xc000428c,
0xb71f5888,
0x00986074,
0x7aadb722,
0x404cb520,
0xff949ebb,
0x740099b0,
0x90c4c000,
0x097ec00e,
0x9020c004,
0x428cb740,
0xc0a40205,
0xd2080a50,
0x7680a902,
0x90e2c001,
0x01859e93,
0x09e8c0a4,
0x0dc8c0a8,
0xa962d008,
0xaa61d010,
0xc0007115,
0xb73f91f2,
0x0a027bec,
0x4029b580,
0xaa61d008,
0xa961d010,
0x9ea21244,
0x2d7cc00e,
0x428cb740,
0x0968c0a4,
0xaa41d008,
0xd0080a04,
0xc001a241,
0x00ae9380,
0x01030203,
0x0a60c0a4,
0x0940c0a4,
0xaa01d208,
0xa955d008,
0xc0017104,
0xb73f9064,
0xb5407bf4,
0xb5494051,
0xb7a07c31,
0x9ea8428c,
0xc0a8020b,
0xb7690a48,
0xd20855d0,
0xb769aa01,
0xc10154c8,
0x02de15be,
0x65b9c101,
0x1a32d011,
0x01c7d120,
0x0ae0c0a4,
0x989fc074,
0xa021d208,
0x428cb780,
0xc0a4024e,
0xd2080a60,
0xd011a902,
0xd2080d22,
0xb780a101,
0xc09e428c,
0xd2080a54,
0x7500aa01,
0x9142c000,
0x7becb73f,
0x4029b780,
0x0a027500,
0x0a42d002,
0x5a74b73f,
0xb5809e52,
0xb75f4049,
0xb77f7bf4,
0xd0107c6c,
0xd008aa41,
0xb740a161,
0x7500428c,
0x90c2c000,
0x0960c06c,
0x9080c000,
0x0950c07e,
0x7cecb55f,
0x7cf4b77f,
0x7df4b71f,
0xa962f010,
0x724cb741,
0x294d7e82,
0x3928d002,
0x9244c000,
0x7e80c010,
0x91c2c000,
0x428cb780,
0xc09a3920,
0xd2080a3c,
0x7500aa01,
0x9084c000,
0x3900c100,
0x7a6cb73f,
0xf0009d9d,
0xb73fa161,
0xb7e07c74,
0xc0104294,
0xb7a07e82,
0x09024051,
0x0922d001,
0xb78006fa,
0x9e6b4d8c,
0xb71f9e92,
0xc0a87df4,
0xc24009c0,
0xb57fa166,
0xb7816dec,
0xd008554c,
0xb720ab71,
0xb7a0414c,
0x63694e8c,
0x01839eb3,
0x716cb53f,
0x9818c074,
0x716cb77f,
0x9eb302fa,
0xa021d208,
0x986cc074,
0x7974b73f,
0x0ee0c0ac,
0x4f0cb780,
0x404bb500,
0xaaa2d210,
0x9e920902,
0xa2e6c240,
0x4f8cb780,
0xa166c240,
0xc0a89e7c,
0xd2080a10,
0x7500aa01,
0x91a2c001,
0x7becb77f,
0x6df4b77f,
0xaa61d008,
0xa971d010,
0xc0007500,
0x040f9124,
0x734cb784,
0x01090228,
0x297cc00e,
0x9e939e79,
0x66adb705,
0x9e84018f,
0xb7209c62,
0xb781428c,
0x1a1064ad,
0xc0007502,
0xb78b90f2,
0x7500472b,
0x90e4c000,
0x508cb780,
0xc2409e81,
0xb71fa0e6,
0xb7817df4,
0x750864cc,
0x9084c000,
0x991dff74,
0xff949ebb,
0xb7a09914,
0xb780428c,
0xb73f508c,
0x008b5d74,
0x4ca9b745,
0xaa65c240,
0xc0305920,
0xc0022900,
0x32442a7c,
0xf0009d9e,
0xb75fa261,
0x020b7bec,
0x0a74c09c,
0xa941d008,
0x70ecb55f,
0x64b5b741,
0xb55f7480,
0xc0005c74,
0xd20891e2,
0xc200aa01,
0x00ca5a08,
0x68b5b742,
0x5fadb742,
0x642db782,
0x91a0c000,
0xaa01d208,
0x5a08c200,
0xb74200ca,
0xb7427635,
0xb7826d2d,
0xb77f71ad,
0x9dbd71ec,
0xa161f000,
0x5ef4b77f,
0xf0009dbe,
0xb79fa261,
0x9dcd5e6c,
0xa162f000,
0xb73f9ea8,
0xb7815dec,
0x9d9d504c,
0xa261f000,
0xab29f208,
0x70f4b73f,
0x0a66d011,
0x76402a71,
0x5990c200,
0x91a2c000,
0x5cccb783,
0x0d820882,
0x2a00e003,
0x4422b331,
0xc0010902,
0x9ea890c0,
0x404cb784,
0x654ab749,
0x7d00c005,
0x61b4d032,
0x90a2c000,
0xc0009e59,
0xd1109080,
0xc30004b7,
0xc0025a10,
0xcffc0a7c,
0x59102a01,
0xd020097c,
0xcffe0148,
0xc1012901,
0xc1010528,
0xd1226525,
0xc1015d05,
0xc08101b6,
0xc1c00a22,
0xb73f0a70,
0x9d9e6374,
0xa261f000,
0xb73f9ea8,
0xb78462f4,
0x022862cc,
0xf0009d9e,
0xb784a261,
0xb75f634c,
0x02286274,
0xf0009dae,
0xb784a261,
0xb7ff6c4c,
0x02287b74,
0xf0009dfe,
0xb784a261,
0xb71f6ccc,
0x022879f4,
0xf0009d8e,
0x9ea9a261,
0x75f4b75f,
0x6d4db784,
0x9dae0228,
0xa261f000,
0x6dcdb784,
0x7574b7ff,
0x9dfe0228,
0xa261f000,
0xc09a020b,
0xd2080a38,
0xb71fa901,
0xc10061f4,
0x024a5a08,
0xaa11f288,
0x0639d110,
0xf0009d8e,
0x590ca261,
0xf0c8012a,
0xb73fa951,
0x01347474,
0xf0009d9e,
0xb75fa161,
0x9dae73f4,
0xa161f000,
0xc09a020b,
0xd2080a30,
0xb77fa901,
0xd020616c,
0xd1220124,
0x024a5e08,
0xaa11f2c8,
0x9dbd0218,
0xa261f000,
0x012a5908,
0xa951f088,
0x0535d110,
0x60f4b77f,
0xf0009dbe,
0x0d04a161,
0xc1015d08,
0xf0d0052a,
0xb79fa952,
0xd1205fec,
0x9dcd0115,
0xa162f000,
0x706cb75f,
0x5f74b75f,
0xb72100aa,
0x9dae50ad,
0xa0e1f000,
0xb7849ea8,
0x75007acc,
0x9284c000,
0x71ecb73f,
0xaa619d1d,
0x0a7cc00e,
0x2a01cff0,
0x7b74b73f,
0xf0009d9e,
0xb75fa261,
0x9dad79ec,
0xa261f000,
0xb7849ea8,
0xc010624c,
0xc0007d00,
0xb73f93a4,
0x9d1d7b6c,
0xb73faa61,
0x9d9e75f4,
0xa261f000,
0x79ecb75f,
0xaa619d2d,
0x7574b75f,
0xf0009dae,
0xb77fa261,
0x9d3d746c,
0xb77faa61,
0x9dbe73f4,
0xa261f000,
0x7cf4b71f,
0x4e8cb780,
0x7cf4b75f,
0x7974b73f,
0x624cb740,
0xaae6c240,
0x4f0cb780,
0x7df4b71f,
0xa946f010,
0x4053b760,
0xc2409ea9,
0x0205a8e5,
0x554cb761,
0x6b55b7e1,
0x3a00c101,
0x5bf4b55f,
0x7674b71f,
0xf0009d8e,
0x9d8ea261,
0xa161f000,
0x7cf4b73f,
0x6c6cb75f,
0x62cdb780,
0xf0009dad,
0xb780a261,
0xb75f634d,
0x9dae6bf4,
0xa261f000,
0x414db780,
0x6b74b71f,
0xf0009d8e,
0x9ea9a261,
0x6aecb75f,
0x6bcdb781,
0xf0009dad,
0xb781a261,
0xb75f6ccd,
0x9dae6a74,
0xa261f000,
0x474bb78b,
0x6d4db741,
0xc0017500,
0xc00190c2,
0xc0007c82,
0x097e90c4,
0xc0009e92,
0xd3f29220,
0x0a7e292e,
0xcff09ea0,
0x76be2900,
0xb3205921,
0x74be4846,
0x4426b324,
0x01090501,
0x3d04c001,
0x5a20c100,
0xb75f9e52,
0x322876f4,
0xf0009dae,
0xc000a261,
0xb79f90e0,
0x9dcd76ec,
0xa161f000,
0xb73f9ea8,
0xb78169f4,
0x9d9e6ecc,
0xa261f000,
0x6f4cb781,
0x696cb75f,
0xf0009dad,
0x6217a261,
0x716cb77f,
0xc1011d84,
0xc05405b8,
0xd11099d3,
0x9e7b0451,
0x287cc00e,
0x30065820,
0x68f4b77f,
0xf0009dbe,
0x9ea8a061,
0x686cb73f,
0x6fccb781,
0xf0009d9d,
0xb75fa261,
0xd2a25bec,
0xb75f5e20,
0x324467f4,
0xf0009dae,
0xb781a261,
0xb77f714c,
0x9dbd676c,
0xa261f000,
0x674ab783,
0x66f4b77f,
0xf0009dbe,
0xc021a261,
0xc0120902,
0x9dad0950,
0xa261f000,
0x5c6cb79f,
0xc0017504,
0xb7819044,
0xb7ff6dcc,
0x9dfe6674,
0xa261f000,
0x73ccb784,
0xc0007502,
0xb7819162,
0xb71f6e4c,
0x9d8e7774,
0xa261f000,
0x92a0c000,
0x0a0ec001,
0x0a7ccffe,
0x776cb73f,
0xf0009d9d,
0xc000a261,
0x9ea99140,
0x65ecb75f,
0x704db781,
0xf0009dad,
0xb75fa261,
0x020b70f4,
0x0a74c09c,
0xc0007680,
0xd20893c2,
0xb77faa01,
0xc20077ec,
0x00ca5a08,
0x7aadb780,
0xf0009dbd,
0xb780a261,
0xb77f7f2d,
0x9dbe7874,
0xa261f000,
0x43adb721,
0x78ecb79f,
0xf0009dcd,
0xc001a0e1,
0xd2089360,
0xd3f2a902,
0x9ea829ee,
0xd1a25d08,
0xb7495e0c,
0xd110654a,
0xc00204ab,
0xb7400a7c,
0xcffc7ab5,
0x62452a01,
0x77f4b73f,
0x0244c101,
0xf0009d9e,
0xd012a261,
0xc1006d3b,
0x0d0c5a18,
0xb7605d0b,
0xc1017f2d,
0xb75f6245,
0x02467874,
0xf0009dae,
0xc101a261,
0xb7216127,
0x012443ad,
0x097cc002,
0x2901cffc,
0xb77f0122,
0x9dbd78ec,
0xa161f000,
0x7cf4b77f,
0x64ecb79f,
0xa96df010,
0xf0009dcd,
0x9ea8a161,
0x646cb73f,
0x70ccb781,
0xf0009d9d,
0xb73fa261,
0xb7867df4,
0x750057c9,
0x9164c000,
0x54c9b789,
0xc0007502,
0xc08090c4,
0xf0103900,
0xc7fea16d,
0xb75f0a7e,
0x9dad7d6c,
0xa261f000,
0x0a02c401,
0x0a00c500,
0x7af4b75f,
0xf0009dae,
0xff74a261,
0xb78099cd,
0xb77f4f8c,
0x0378706c,
0x4f0cb780,
0xb59f0278,
0xb780656c,
0x02784e8c,
0x63ecb59f,
0x500cb780,
0xb59f0238,
0xc0085aec,
0x74809180,
0x0f821a04,
0x0ff2d001,
0x70880882,
0x0892d001,
0xb7a077c0,
0xc0004294,
0x040b9142,
0x554cb761,
0x4752b74b,
0xc0020906,
0x9e6c9120,
0x7c74b73f,
0x0a48c0a8,
0xa901d208,
0x4049b780,
0xc0027104,
0xc1019048,
0xb78c04de,
0x75005749,
0x9204c000,
0x5649b78c,
0xc0007500,
0x040b9164,
0x474ab78b,
0x75000d02,
0x0d22d002,
0x9060c000,
0xb77f0d06,
0x048b796c,
0x554db781,
0xa961d808,
0xd8080244,
0xc000a261,
0xb77f91a0,
0xb71f63f4,
0xd0107974,
0xb560aa61,
0x0a04404a,
0xa261d010,
0x7974b73f,
0xa929f210,
0x404bb780,
0x11c47104,
0x91a8ffff,
0xb761040b,
0x0902554c,
0x9e919ebb,
0xff54a09d,
0xb73f9b92,
0x9e745aec,
0x0a00c021,
0x402db740,
0x0a00c016,
0xf0009dcd,
0x9ebba161,
0x999bff74,
0x0992058d,
0x0d02c400,
0x98a5ff34,
0x0a02c400,
0x7d74b73f,
0xf0009d9e,
0xd208a261,
0xb75fa941,
0xb7207c74,
0x0904428c,
0xa141d208,
0xaa41d010,
0x7becb77f,
0x297cc00e,
0xc0a80218,
0xd0080a40,
0xd208a962,
0x7680aa11,
0xc00002c4,
0xb78490a4,
0x02d8732d,
0xc00077c0,
0xd01290e4,
0x018f19d4,
0x9b66ffb4,
0x428cb720,
0xc0a80203,
0xd2080a10,
0x7500aa01,
0x9242c001,
0x7c74b77f,
0xc0a80203,
0xd2080a48,
0xd010a901,
0x7104aa61,
0x9108c002,
0x6574b7ff,
0xa941d208,
0xaa61d210,
0xc0017088,
0xb70593e8,
0x9eab66ad,
0x9e84018f,
0xb7209c62,
0xb781428c,
0x1a1064ad,
0xc0007502,
0xb78b90f2,
0x7500472b,
0x9184c001,
0x508cb780,
0x9ebb9e80,
0xa066c240,
0x9040c001,
0xb78c009e,
0x75005629,
0x93c2c000,
0xb7409e69,
0xb781508c,
0x750464ad,
0x9124c000,
0x0a44c002,
0xc2209ea1,
0xc000a0e6,
0x02749180,
0xa901d208,
0x09080d7e,
0xc8109e93,
0xd2087286,
0x9ebba102,
0x9923ff74,
0x98b6ff74,
0x428cb780,
0x0a30c0a6,
0xaa01d208,
0xc0007500,
0xb7ff9164,
0xd2086574,
0xd210a941,
0x7088aa61,
0x91e6fff7,
0x428cb740,
0xc0a40205,
0xd2080a50,
0x7500aa01,
0x90a2c000,
0xc0000a06,
0x022e9200,
0xc0a40109,
0xc0a40940,
0xd2080a60,
0xd008aa01,
0x7104a955,
0xd0010a02,
0x9ebb0a42,
0xff740309,
0x058d98da,
0xc1000992,
0xff140d02,
0xcffe9be4,
0xc1002b7c,
0xb71f0a02,
0x9d8e7d74,
0xa261f000,
0x7c6cb73f,
0x428cb7a0,
0xb7800e86,
0xb73f4029,
0x02d86f74,
0xc0ac020b,
0xc0a80a60,
0xd2080ac0,
0xd208aab1,
0x02d8aa01,
0x9d9e1a84,
0xa2e2f000,
0x6eecb75f,
0xf0009dad,
0xb77fa2e2,
0x9e6a5cf4,
0x09f2c006,
0xfef40d02,
0x9e6a9816,
0x0d02058d,
0x09f2c038,
0x980ffef4,
0x018f9eab,
0x9a98ffb4,
0xc0007580,
0x010d90a4,
0x9280c000,
0x428cb720,
0x56a9b786,
0xc0007500,
0x9e6a90a4,
0x9140c000,
0x7bf4b75f,
0xd0100902,
0x7500aa41,
0x0922d001,
0x75809e95,
0x2efccffe,
0x9124c000,
0x428cb720,
0x4f29b787,
0xc0027500,
0xc00890c2,
0xb77f0a82,
0x9dbd7d6c,
0xa2e1f000,
0x7a74b77f,
0xa9619d3e,
0x0a02c401,
0x0a00c008,
0x7af4b7ff,
0xf0009dfe,
0xc002a261,
0x9dbe3940,
0xa161f000,
0x09929eaa,
0xff14058d,
0x0a029b68,
0xf0009dfe,
0xb71fa261,
0x9d8e7d74,
0xa2e1f000,
0x6e6cb73f,
0xa9e19d1d,
0x6d74b73f,
0xaa619d1e,
0x6cecb75f,
0xa9629d2d,
0xc0007680,
0xb77f9202,
0xc1806074,
0x2a7c5a35,
0xa961f010,
0x1525d110,
0xd1111128,
0xc0001aa0,
0x0a829060,
0x428cb740,
0x09869ebb,
0x095cc0a4,
0xaa41d008,
0xd0080a04,
0xb740a241,
0x012e428c,
0x0960c04e,
0xaa41d008,
0xd0080a04,
0xff34a241,
0x75809978,
0x9162c000,
0x428cb720,
0x590cc280,
0x7fadb784,
0xb5840244,
0x77407fad,
0x9242c000,
0x428cb780,
0xc0a49ea2,
0xc0a80a5c,
0xd2080d4c,
0xd010a901,
0x7088aa41,
0xb3540a02,
0x9ea54828,
0x428cb720,
0x64adb781,
0x75021a10,
0x9132c000,
0x472bb78b,
0xc0007500,
0xb7a49082,
0xb79f7c2d,
0xb7ff7c6c,
0xd0207bf4,
0xd208001e,
0x0203a901,
0x0a30c09a,
0xd2080122,
0x0205a902,
0x0a60c0ac,
0xa882d208,
0xaa61d210,
0x0940c0a8,
0xa951d008,
0x7c50b709,
0x9e697500,
0x0a029ebb,
0x0a42d001,
0xa01e018b,
0xa315a219,
0x99f0ff54,
0xc0007580,
0xb71f9282,
0xb72072f4,
0x9d0b428c,
0x4048b780,
0x09929ebb,
0x5a08c200,
0xb74200c2,
0xcfec7ab5,
0xfef40901,
0xb720982b,
0xb743428c,
0x76806a33,
0x9184c006,
0x5d2db783,
0x09028782,
0xe00a7502,
0x9d6487b2,
0xd0017504,
0x75080922,
0xd0010a02,
0x74400a42,
0x3128d040,
0x90a2c000,
0xc0009e54,
0x9dc490e0,
0x76400a06,
0x0a42d001,
0x853ec001,
0x5a08c200,
0xcfc00e82,
0xb59f8500,
0xb9605b6c,
0xd3f14018,
0x75062e5e,
0x12dad011,
0x90c2c000,
0x726cb75f,
0xaae19d2d,
0x7374b75f,
0xa9e19d2e,
0x74ecb79f,
0xa9e29d4d,
0x5b74b7ff,
0x4294b720,
0x045ad010,
0x0400047a,
0x0482d010,
0x0083d120,
0x6aabb723,
0x4ecbb784,
0x9d489e9a,
0x2d7cc03e,
0xc1011242,
0xb5840244,
0xb7204ecb,
0x49044294,
0xd0105908,
0xd1200482,
0xc1010083,
0xb784012a,
0xb72350cb,
0xd02070ab,
0x9d4b0124,
0x21b41242,
0x024659a9,
0x50cbb584,
0x4294b720,
0xc03e010b,
0xd010297c,
0xd1200482,
0xb7230083,
0xb7847aab,
0x078752cb,
0x2ffcc03e,
0x02441242,
0x52cbb584,
0x428cb720,
0x9d7e9d4f,
0x0402c101,
0x9ddf0082,
0x54abb784,
0x44d2b704,
0x25be2156,
0x59299dfc,
0x1240c101,
0x2ac0c3ff,
0x77c00244,
0x0e845da9,
0x59d1c280,
0x54abb584,
0x91c4c001,
0x4294b720,
0x04a2d010,
0x0083d120,
0x76abb723,
0x56cbb784,
0xc3011242,
0xb5840246,
0xb72056cb,
0xd0104294,
0xd12004a2,
0xb7240083,
0xb78440ab,
0x124258cb,
0x0246c101,
0x58cbb584,
0x4294b720,
0x04a2d010,
0x0083d120,
0x4aabb724,
0x5acbb784,
0x02461242,
0x5acbb584,
0x93e1fffa,
0x428cb720,
0xc0a40203,
0xd2080a50,
0x7500aa01,
0x91e4c000,
0xb71f021e,
0xc0a47c74,
0xd2080a40,
0xb740aa15,
0x1a044048,
0xc0007088,
0x758092d8,
0x91c2c000,
0x6631b74d,
0x72ecb73f,
0x4590b760,
0xb740018f,
0x04874029,
0x9961ff14,
0x72f4b73f,
0xb5800a7f,
0xb7404049,
0xb75f428c,
0x0a7f7c74,
0xa241d010,
0xc0a40205,
0xd2080a50,
0x7500aa01,
0x92a4c000,
0x02059e92,
0x0a5cc0a4,
0x0d4cc0a8,
0xa901d208,
0xaa41d010,
0xc0007088,
0x9ebb9108,
0x9a09ff54,
0xffbd7400,
0xb77f91a4,
0x0a166fec,
0xa26df008,
0x428cb720,
0xc0a40203,
0xd2080a50,
0x7500aa01,
0x9044c001,
0x55b1b769,
0x5529b749,
0x4494b720,
0x0d060089,
0x9120c000,
0xaa7df088,
0x750a9e8f,
0x4842b327,
0xd051050f,
0x70976a29,
0x01c2c101,
0x0a22d011,
0xc00e0109,
0xffff297c,
0x768091f4,
0x9162c000,
0x4588b780,
0x448cb740,
0x02446a52,
0xf2480906,
0x9e72a115,
0x0a02c002,
0x0900c021,
0xf0009dad,
0xc002a261,
0x9dad1a00,
0xa261f000,
0x428cb740,
0xc2000a86,
0xc0b452bc,
0xd0080914,
0x0a7fa942,
0x9e51424a,
0xd0082242,
0xff54a241,
0xd3f299e7,
0xff1429de,
0xb79f9976,
0xb7bf6a6e,
0xb7df6aee,
0xb7ff6b6e,
0xcfea6bee,
0x9c228401,
0xc021a605,
0xfed40e82,
0xc0109965,
0x0a060e80,
0xf0009dde,
0x0d82a261,
0x9a50fed4,
0xfed40d8a,
0xc0219963,
0xc03c0a02,
0x9d4d0a40,
0xc021aa61,
0xb5800a82,
0xc004430c,
0x9d5d0ae0,
0xd072aae1,
0x2afc29de,
0x9a72fef4,
0x4a0cb720,
0x0a02c021,
0x0a50c006,
0xc1000103,
0xd0080964,
0xb5a9a2c1,
0x9d4d54a9,
0x7d1eaa61,
0x92c2c000,
0x0a02c021,
0x0a40c006,
0xa9619d4d,
0x9dde0a0a,
0xa261f000,
0xc00074bf,
0xc0219122,
0xc0020a02,
0x9dcd0a10,
0xa161f000,
0x0a02c401,
0x0902c021,
0x0a00cff0,
0x9dad0920,
0xa261f000,
0x520cb720,
0xb7400a02,
0x0c964694,
0xb5809ea3,
0xb5804688,
0x28e14788,
0xc03c0189,
0xc0580ec2,
0xc01c0a82,
0xc0140802,
0xc0200c02,
0xd3f19c87,
0xf0102d3e,
0x7480a0c6,
0xa141d010,
0x90e4c000,
0xf1d09e43,
0xc000a0dd,
0xf1d09240,
0x7482aa49,
0x02460a1c,
0xf1d02a61,
0xb303a25d,
0xc0004422,
0x9e6b90c2,
0xb3537486,
0x0d844432,
0xffff0d50,
0xc0219001,
0xc8010a02,
0xc0040902,
0x9dcd0a40,
0xa161f000,
0x9e920902,
0x4018b960,
0x5a08c100,
0x0a00c021,
0x0a40c10e,
0xf0009dcd,
0x0904a162,
0x92c1ffff,
0x0d02c021,
0x0d30c10e,
0xb9600902,
0x020553f8,
0x2a40c3fe,
0x3a08c001,
0xf0009dae,
0x0940a261,
0x92e1ffff,
0x0a02c021,
0xc0040a82,
0x9dcd0a40,
0xa2e1f000,
0x0a50c00a,
0xf0009dcd,
0x0a10a2e1,
0xf0009dcd,
0xc123a2e1,
0xc5660952,
0x1a200960,
0xf0009dcd,
0xfed4a161,
0xc8299902,
0xc8780922,
0xf0080960,
0x7500aa41,
0x90a2c000,
0xf0080a04,
0xff14a241,
0x9eab9a73,
0x9890fed4,
0xb79f000b,
0xb7bf7f6e,
0x8c407fee,
0xa61d9c22,
0xb7208460,
0x0a024a0c,
0x9e8a09ff,
0xc1220103,
0xc1220910,
0xd0080d14,
0xd010a241,
0xa192a241,
0x4408b560,
0x5a29b58d,
0x5aa9b58d,
0x0882c021,
0x08d0c006,
0xaa619d1d,
0x2a7cc00e,
0xc0007506,
0x0d8a90f2,
0x9a9cfef4,
0x9240ffff,
0x0902c021,
0x0940c006,
0xab629d2d,
0xabe19d2d,
0xa9629d2d,
0x9d2da11e,
0xd1f1a9e1,
0xa1992eee,
0xc0017542,
0xb7c09184,
0x0e82460c,
0xaa55f229,
0x2eded3f1,
0x750a058d,
0xa91d9eba,
0x0e84a89a,
0xc000018b,
0xfed490e2,
0x9eab98ee,
0x9a9cfef4,
0xffff7744,
0x058b91a4,
0x9a6cfef4,
0x0a16a891,
0x41adb580,
0x7ceeb79f,
0x7d6eb7bf,
0x7deeb7df,
0x7e6eb7ff,
0x8c60c002,
0x9e749c22,
0x448cb760,
0x2a00c7f0,
0x5aa1d224,
0x6d59d051,
0xf2480226,
0x750aaa15,
0x91c4c000,
0x458cb720,
0x0d42c809,
0x0d30cabc,
0x09020222,
0xa10df208,
0xa102f208,
0xc000754e,
0x9e6c93a4,
0x4a0cb760,
0x4408b740,
0x6a42c0b6,
0x00c6d020,
0x74bec01c,
0x7d49b549,
0x9122c000,
0xc0b60a02,
0x62290a40,
0xb5a900c6,
0x0a7f7db1,
0x7dc9b589,
0x4410b5a0,
0x7f80c010,
0x9142c004,
0xfed4058b,
0xa91e98cf,
0xe0719eab,
0x018f8d00,
0x9820ff14,
0x7468b79f,
0x753ec01c,
0x90c4c000,
0x9a5afef4,
0x7468b51f,
0x7470b77f,
0x55cc0d06,
0x2dfcc00e,
0x9a19fef4,
0xb7209e6c,
0xc0b64a0c,
0xb77f6a42,
0x02c27468,
0x058b008b,
0x59adb723,
0x030b9ead,
0x0ea0c06c,
0xaba2f210,
0xa322f210,
0x008ba095,
0x59adb5e3,
0xc06ca91d,
0xc3000b40,
0xf2085d3d,
0xf208ab42,
0xaa19a141,
0x5aadb7e3,
0xb5839e5a,
0x2d045aad,
0x9b18fef4,
0xb77f008b,
0xf2107470,
0xf208a3a2,
0xb5e3a342,
0xa9155aad,
0x55cc0d06,
0x2dfcc00e,
0x59adb543,
0x9b87fef4,
0x4494b740,
0xaa55f050,
0xc0007508,
0xb7609124,
0x0a06448c,
0xa275f048,
0x9180c000,
0xc0007504,
0xb7209124,
0xb7804b0c,
0x75004029,
0x9224ffff,
0x448cb740,
0xaa49f088,
0xc0007508,
0x75049182,
0x93c4fff7,
0x4a94b740,
0xaa41d010,
0xfff77500,
0xb76092e2,
0x0a06448c,
0xa269f088,
0x9200fff7,
0xa89aa91d,
0x9e6b9eba,
0xfed4058d,
0x058b980a,
0x99b8fef4,
0x9080fff7,
0xb740a60d,
0x0205428c,
0x0a30c0a6,
0xaa01d208,
0xc0037500,
0x9e9292a4,
0x0d50c0a4,
0xa941d010,
0xc0007480,
0x0a0492e4,
0xa241d010,
0x428cb780,
0xc0a49e93,
0xd2080a68,
0xff14a101,
0xb78099de,
0xc0a6428c,
0xd2080a30,
0x7500aa01,
0x9304c002,
0x428cb720,
0xc09e0203,
0xd2080a58,
0x7500aa01,
0x91c2c002,
0x55a9b7a9,
0x4514b7c0,
0x9220c001,
0xaa2df210,
0xc000750a,
0x9eaa93e4,
0x55e80d86,
0x2dfcc00e,
0x995dfef4,
0x448cb720,
0x4608b780,
0x29ded3f2,
0xb58000e2,
0xff346ca9,
0x0a029ba0,
0xa22df210,
0x0a42c809,
0x0a60c74a,
0xa221f210,
0x90c0c001,
0x5529b789,
0x02857148,
0x9124c000,
0xfef40d92,
0xb7209929,
0xb7a9428c,
0xb72055a9,
0xba2d428c,
0xd0514000,
0x02036b59,
0xc0a40103,
0xc0a80a68,
0xd208094c,
0xd008a902,
0xd120aa41,
0xd01102ed,
0x72991952,
0x9386fffd,
0x7eeeb79f,
0x7f6eb7bf,
0x7feeb7df,
0x9c228c60,
0x8420a61d,
0x428cb780,
0x0a30c0a6,
0xaa01d208,
0xc0097500,
0xff549124,
0xb72098f5,
0x0203428c,
0x0a30c0a6,
0xa902d208,
0xc0087680,
0xc00693a4,
0xd2081a58,
0x7500aa01,
0x9222c004,
0xc0a80203,
0xb7a90a48,
0xd20854b1,
0x9e57a901,
0x12050705,
0xc101a21d,
0xd011612b,
0xba3d1e52,
0x03444001,
0x90a0c001,
0x5529b789,
0x029cc101,
0xc0a402d8,
0xc0140ac0,
0xd2089a12,
0xb720a035,
0xd011428c,
0xba3c0a72,
0xb7894000,
0xf1105529,
0x0f040669,
0x9ea20242,
0xc0a40109,
0xc0a40d40,
0xc000095c,
0xd01090c2,
0xd008aa55,
0xa91da241,
0x9eb371df,
0x03649e6b,
0x428cb720,
0x92c4fffe,
0x55a9b789,
0x9e900902,
0xc0a40218,
0xc8200a60,
0x00059c87,
0xa101d208,
0x9020c002,
0x428cb720,
0x5529b789,
0x0609d110,
0x5a08c200,
0xb50500c2,
0xb7204bad,
0xb789428c,
0xc1015529,
0x00980090,
0x08e0c0a4,
0x4029b760,
0x91a0c000,
0xaa61d010,
0x552db741,
0x4bd5b745,
0xc1016245,
0xb5850244,
0xb7204bcd,
0xd012428c,
0xb7890932,
0x01165529,
0xd1109e93,
0xc0ac0609,
0xc2000de0,
0x02425908,
0x0a40c0a4,
0xaa15d208,
0x00a2d020,
0x9e537106,
0x29fcc00e,
0x9392fffe,
0xfffe0c04,
0x0d829021,
0x98c7ff14,
0x428cb720,
0xc0a60203,
0xd2080a30,
0x7680a902,
0x9344c003,
0x1a58c006,
0xaa01d208,
0xc0037500,
0x020390e2,
0x0a48c0a8,
0xaa01d208,
0x54a9b749,
0x55b1b7a9,
0x71040705,
0x4001ba2d,
0x0d7ecfff,
0xcffe0189,
0xd0510d30,
0xb3236e59,
0x65554432,
0x448cb740,
0x0528c101,
0x01449e6e,
0x1fa2d031,
0x29fcc00e,
0x0aa2d171,
0x0fa6d012,
0xc000a199,
0xfef49360,
0xb7809830,
0xd3f24608,
0xd20829ee,
0xff34a221,
0xc8099a76,
0xc74a0d42,
0x9e7a0d60,
0xa166e250,
0x1a62d011,
0xe0500d02,
0xba34a146,
0x1ad04000,
0x428cb720,
0x165cd010,
0xd0240906,
0xb72951d0,
0xa91955a9,
0x2dfcc00e,
0x10940f04,
0xfffe7102,
0xc000931a,
0xfed49080,
0xb7809bef,
0x0d92428c,
0xc0a49ea2,
0xc0a80a5c,
0xd2080d48,
0xd010a901,
0x7088aa41,
0x9226ffff,
0x7deeb79f,
0x7e6eb7bf,
0x7eeeb7df,
0x7f6eb7ff,
0x8c20c002,
0x93c0ff76,
0x7deeb79f,
0x7e6eb7bf,
0x7eeeb7df,
0x7f6eb7ff,
0x8c20c002,
0xa61d9c22,
0x8400c002,
0xd050a196,
0xb740aa61,
0xb7e04a0c,
0x1a08448c,
0x0f029ea5,
0x2efcc00e,
0xd2d19e6c,
0xc0b66cdf,
0x02c46a42,
0x020b018b,
0x09a0c06c,
0x0a40c06c,
0x7decb53f,
0xa191a299,
0x7d6cb59f,
0x058b0f86,
0x9a56feb4,
0x428cb780,
0x0a50c0a4,
0xab01d208,
0x9080c000,
0x9b9afed4,
0xb760a899,
0x0d924a0c,
0x5a29b74d,
0x5aa9b78d,
0x7088a19d,
0x9282ffff,
0xc0007580,
0xb72091a4,
0xb780428c,
0xb7494688,
0x22445629,
0x7d3ec01c,
0x90c4ffff,
0x428cb720,
0x4488b780,
0xb749058b,
0x42445629,
0x4488b580,
0x9a26feb4,
0xb76d008b,
0xb78d5aa9,
0x71065a29,
0x90e2c001,
0x7decb75f,
0xd0129ea9,
0x022609b2,
0xc200a91d,
0x099a5a10,
0xb78300c4,
0xb7434b2d,
0xb7434aad,
0xb5834c35,
0xb79f59cd,
0xb7237d6c,
0xb5434bad,
0xd1f25ad5,
0xf2082b2e,
0xa891a081,
0x402db540,
0x98d9c014,
0xb50d9ea9,
0x058b5ac9,
0x99f6feb4,
0x428cb720,
0x8d00e091,
0xb743058d,
0xb7635a35,
0xfef459ad,
0xb79f9943,
0xc01c7068,
0xc000753e,
0xfeb490c4,
0xb51f9974,
0x77827068,
0x9142c000,
0x7070b77f,
0x55ecc200,
0x2dfcc00e,
0x9b39fed4,
0x4590b760,
0xb77fa91d,
0x9e5c7068,
0x6a42c0b6,
0xb74300c4,
0x9e5a5935,
0x2d045d3d,
0x9852fef4,
0xc0007782,
0xb77f9142,
0xc2007070,
0xc00e55ec,
0xfef42dfc,
0xf24898c8,
0x7508aa61,
0x9084c000,
0xa3e2f248,
0x428cb720,
0xaa75f248,
0x4488b740,
0x5631b749,
0x9e547508,
0x22444a7d,
0x4488b580,
0x9164c000,
0x4a0cb720,
0x5629b789,
0xc0007a99,
0xf2489082,
0xf288a3f6,
0x7508aa69,
0x9164c000,
0x4994b720,
0x4049b780,
0xc0007a99,
0xf2889082,
0x7782a3ea,
0x9264fff9,
0x448cb740,
0x4708b780,
0xa342f048,
0x0a04a915,
0x4708b580,
0xf0080a16,
0xb79fa24d,
0xb7bf7c6e,
0xb7df7cee,
0xb7ff7d6e,
0xc0047dee,
0x9c228c00,
0x08029e98,
0xc0000902,
0x9e989140,
0xd0100802,
0xcc144530,
0xc01472c0,
0x72c07200,
0x5d09c180,
0x7204e009,
0x5d04f012,
0x9254c000,
0xd00472c4,
0xd0240804,
0x72c015b4,
0x0802d004,
0x15b0d024,
0x3124e000,
0xb3301181,
0x9c22442a,
0x088672c0,
0x93a6ffff,
0x72c0c402,
0x2c9ed065,
0x3c9ed065,
0x7200c802,
0x2d2ed065,
0x3d2ed065,
0x1514e000,
0xd01a9e53,
0xd01a5408,
0x72c050ac,
0x0002d014,
0x15b0d024,
0x5885e080,
0xffff5c05,
0xe0009304,
0x11813124,
0x442ab330,
0x9e649c22,
0xc8099d3a,
0xb0960e42,
0x9ea40026,
0x9e589dc3,
0x3400e000,
0xb3301587,
0x9c22482a,
0xc8099e64,
0xb0950e42,
0x9ea43f86,
0x9c229e58,
0x87c2c809,
0x0e60b060,
0x87c2c809,
0x0b80b060,
0x87c2c809,
0x0ac0b060,
};
unsigned int aui32MPG4_MasterMTXTOPAZFWData[] =
{
0x00000000,
0x00000000,
0xff0000ff,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x809000b0,
0x80909c40,
0x828859d0,
0x82885a20,
0x828859f8,
0x82885a04,
0x828859d8,
0x828859dc,
0x82885a40,
0x828859e0,
0x82885a34,
0x82885a48,
0x82886a6c,
0x82885a50,
0x8288702c,
0x828864bc,
0x8288659c,
0x82887130,
0x82887138,
0x8288713c,
0x82887140,
0x82887142,
0x82887148,
0x8288714c,
0x82887150,
0x82887154,
0x8288715c,
0x82887160,
0x82887164,
0x8288716f,
0x82888718,
0x82885978,
0x828859c8,
0x809003f0,
0x809003f0,
0x80907324,
0x8090a6d8,
0x80904ad8,
0x8090a4c0,
0x80906710,
0x80906008,
0x809009d4,
0x80902200,
0x809003f0,
0x809003f0,
0x809003f0,
0x809003f0,
0x809003f0,
0x809003f0,
0x809003f0,
0x809003f0,
0x809003f0,
0x809003f0,
0x0d080300,
0x00100b06,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x1234baac,
};
unsigned int aui32MPG4_MasterMTXTOPAZFWTextReloc[] =
{
0
};
unsigned char aui8MPG4_MasterMTXTOPAZFWTextRelocType[] =
{
0
};
unsigned int aui32MPG4_MasterMTXTOPAZFWTextRelocFullAddr[] =
{
0
};
unsigned int aui32MPG4_MasterMTXTOPAZFWDataReloc[] =
{
0
};
|
the_stack_data/113981.c | #include <stdio.h>
#include <stdlib.h>
#include <assert.h>
void mainQ(int i, int n) {
assert(n >= 0);
int sum = 0;
for (i = 0; i < n; ++i) {
sum = sum + i;
}
//%%%traces: int sum, int i, int n
//assert(sum >= 0);
}
int main(int argc, char *argv[]) {
mainQ(atoi(argv[1]), atoi(argv[2]));
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.