file
stringlengths 18
26
| data
stringlengths 3
1.04M
|
|---|---|
the_stack_data/31612.c
|
#include <stdio.h>
#include <stdlib.h>
typedef struct Node Node;
struct Node
{
int data;
Node* right;
Node* left;
};
// Search
Node* Search(Node* current, int key)
{
if (current == NULL)
{
return NULL;
}
if (current->data == key)
{
return current;
}
if (key >= current->data)
{
Search(current->right, key);
}
else
{
Search(current->left, key);
}
}
// Insert
void Add(Node** current, int data)
{
if (*current == NULL)
{
*current = malloc(sizeof(Node));
(*current)->data = data;
(*current)->left = NULL;
(*current)->right = NULL;
return;
}
if (data >= (*current)->data)
{
Add(&(*current)->right, data);
}
else
{
Add(&(*current)->left, data);
}
}
struct Node * minValueNode(struct Node* node)
{
struct Node* current = node;
/* loop down to find the leftmost leaf */
while (current->left != NULL)
current = current->left;
return current;
}
// Delete
struct Node* deleteNode(struct Node* root, int data)
{
// base case
if (root == NULL) return root;
if (data < root->data)
root->left = deleteNode(root->left, data);
else if (data > root->data)
root->right = deleteNode(root->right, data);
else
{
// node with only one child or no child
if (root->left == NULL)
{
struct Node *temp = root->right;
free(root);
return temp;
}
else if (root->right == NULL)
{
struct Node *temp = root->left;
free(root);
return temp;
}
struct Node* temp = minValueNode(root->right);
root->data = temp->data;
root->right = deleteNode(root->right, temp->data);
}
return root;
}
void PrintInOrder(Node* currentNode)
{
if (currentNode == NULL)
{
return;
}
PrintInOrder(currentNode->left);
printf("%d\n", currentNode->data);
PrintInOrder(currentNode->right);
}
// Test
int main()
{
Node* tree = NULL;
Add(&tree, 6);
Add(&tree, 5);
Add(&tree, 4);
Add(&tree, 5);
Add(&tree, 2);
Add(&tree, 8);
Add(&tree, 7);
Add(&tree, 10);
Node* searchPt = Search(tree, 20);
tree = deleteNode(tree ,7);
PrintInOrder(tree);
}
|
the_stack_data/18887897.c
|
/*BEGIN_LEGAL
Intel Open Source License
Copyright (c) 2002-2013 Intel Corporation. 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
the Intel Corporation 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 INTEL OR
ITS 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.
END_LEGAL */
/*
compare 64 bit value od edx:eax with the destination memory operand.
if ==
store ecx:ebx in the destination memory operand and zf=1
if !=
store load the destination memory operand into edx:eax and zf=0
This test checks that the correct memory location is referenced when ebx is
explicitly used in the memory operand of the cmpxchg8b instruction.
*/
int cmpxchg8_with_explicit_ebx();
unsigned int eaxVal;
unsigned int edxVal;
unsigned char a[] = {0x1, 0xff, 0xff, 0xff, 0x2, 0xff, 0xff, 0xff};
int main()
{
cmpxchg8_with_explicit_ebx();
printf ("eaxVal %x edxVal %x\n", eaxVal, edxVal);
/*
asm( "mov %ebp, %ebx");
asm( "mov $8, %eax");
asm( "cmpxchg8b 0x0(%ebx,%eax,1)");
*/
}
|
the_stack_data/32950650.c
|
#include <stdio.h>
#include <stdlib.h>
#include <sys/socket.h>
#include <sys/un.h>
#include <strings.h>
#include <unistd.h> // write()
int main()
{
int client_socket = socket( AF_UNIX, SOCK_STREAM, 0);
if (client_socket < 0)
{
perror("socket");
exit(1);
}
struct sockaddr_un server_address = {AF_UNIX, "/tmp/my_socket"};
int ret = connect(client_socket, (struct sockaddr*)&server_address, SUN_LEN(&server_address));
if (ret < 0)
{
perror("connect");
exit(1);
}
char message_to_server[10] = "hello";
printf("Enter message to server: \n");
scanf("%s", message_to_server);
int written_bytes = write(client_socket, message_to_server, strlen(message_to_server));
if (written_bytes <= 0)
{
perror("write");
exit(1);
}
printf("Message sent\n");
close(client_socket);
return 0;
}
|
the_stack_data/270184.c
|
#include <wchar.h>
wchar_t *wcpncpy(wchar_t *restrict d, const wchar_t *restrict s, size_t n)
{
return wcsncpy(d, s, n) + wcsnlen(s, n);
}
|
the_stack_data/100621.c
|
/*
* SPI testing utility (using spidev driver)
*
* Copyright (c) 2007 MontaVista Software, Inc.
* Copyright (c) 2007 Anton Vorontsov <[email protected]>
*
* 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.
*
* Cross-compile with cross-gcc -I/path/to/cross-kernel/include
*/
#include <stdint.h>
#include <unistd.h>
#include <stdio.h>
#include <stdlib.h>
#include <getopt.h>
#include <fcntl.h>
#include <sys/ioctl.h>
#include <linux/types.h>
#include <linux/spi/spidev.h>
#define ARRAY_SIZE(a) (sizeof(a) / sizeof((a)[0]))
static void pabort(const char *s)
{
perror(s);
abort();
}
static const char *device = "/dev/spidev0.0";
static uint8_t mode;
static uint8_t bits = 8;
static uint32_t speed = 500000;
static uint16_t delay;
static void transfer(int fd)
{
int ret;
uint8_t tx[] = {
0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
0x40, 0x00, 0x00, 0x00, 0x00, 0x95,
0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
0xDE, 0xAD, 0xBE, 0xEF, 0xBA, 0xAD,
0xF0, 0x0D,
};
uint8_t rx[ARRAY_SIZE(tx)] = {0, };
struct spi_ioc_transfer tr = {
.tx_buf = (unsigned long)tx,
.rx_buf = (unsigned long)rx,
.len = ARRAY_SIZE(tx),
.delay_usecs = delay,
.speed_hz = speed,
.bits_per_word = bits,
};
ret = ioctl(fd, SPI_IOC_MESSAGE(1), &tr);
if (ret < 1)
pabort("can't send spi message");
for (ret = 0; ret < ARRAY_SIZE(tx); ret++) {
if (!(ret % 6))
puts("");
printf("%.2X ", rx[ret]);
}
puts("");
}
static void print_usage(const char *prog)
{
printf("Usage: %s [-DsbdlHOLC3]\n", prog);
puts(" -D --device device to use (default /dev/spidev1.1)\n"
" -s --speed max speed (Hz)\n"
" -d --delay delay (usec)\n"
" -b --bpw bits per word \n"
" -l --loop loopback\n"
" -H --cpha clock phase\n"
" -O --cpol clock polarity\n"
" -L --lsb least significant bit first\n"
" -C --cs-high chip select active high\n"
" -3 --3wire SI/SO signals shared\n");
exit(1);
}
static void parse_opts(int argc, char *argv[])
{
while (1) {
static const struct option lopts[] = {
{ "device", 1, 0, 'D' },
{ "speed", 1, 0, 's' },
{ "delay", 1, 0, 'd' },
{ "bpw", 1, 0, 'b' },
{ "loop", 0, 0, 'l' },
{ "cpha", 0, 0, 'H' },
{ "cpol", 0, 0, 'O' },
{ "lsb", 0, 0, 'L' },
{ "cs-high", 0, 0, 'C' },
{ "3wire", 0, 0, '3' },
{ "no-cs", 0, 0, 'N' },
{ "ready", 0, 0, 'R' },
{ NULL, 0, 0, 0 },
};
int c;
c = getopt_long(argc, argv, "D:s:d:b:lHOLC3NR", lopts, NULL);
if (c == -1)
break;
switch (c) {
case 'D':
device = optarg;
break;
case 's':
speed = atoi(optarg);
break;
case 'd':
delay = atoi(optarg);
break;
case 'b':
bits = atoi(optarg);
break;
case 'l':
mode |= SPI_LOOP;
break;
case 'H':
mode |= SPI_CPHA;
break;
case 'O':
mode |= SPI_CPOL;
break;
case 'L':
mode |= SPI_LSB_FIRST;
break;
case 'C':
mode |= SPI_CS_HIGH;
break;
case '3':
mode |= SPI_3WIRE;
break;
case 'N':
mode |= SPI_NO_CS;
break;
case 'R':
mode |= SPI_READY;
break;
default:
print_usage(argv[0]);
break;
}
}
}
int main(int argc, char *argv[])
{
int ret = 0;
int fd;
printf("in function");
parse_opts(argc, argv);
fd = open(device, O_RDWR);
if (fd < 0)
pabort("can't open device");
/*
* spi mode
*/
ret = ioctl(fd, SPI_IOC_WR_MODE, &mode);
if (ret == -1)
pabort("can't set spi mode");
ret = ioctl(fd, SPI_IOC_RD_MODE, &mode);
if (ret == -1)
pabort("can't get spi mode");
/*
* bits per word
*/
ret = ioctl(fd, SPI_IOC_WR_BITS_PER_WORD, &bits);
if (ret == -1)
pabort("can't set bits per word");
ret = ioctl(fd, SPI_IOC_RD_BITS_PER_WORD, &bits);
if (ret == -1)
pabort("can't get bits per word");
/*
* max speed hz
*/
ret = ioctl(fd, SPI_IOC_WR_MAX_SPEED_HZ, &speed);
if (ret == -1)
pabort("can't set max speed hz");
ret = ioctl(fd, SPI_IOC_RD_MAX_SPEED_HZ, &speed);
if (ret == -1)
pabort("can't get max speed hz");
printf("spi mode: %d\n", mode);
printf("bits per word: %d\n", bits);
printf("max speed: %d Hz (%d KHz)\n", speed, speed/1000);
transfer(fd);
close(fd);
return ret;
}
|
the_stack_data/127167.c
|
/*4. Escreva um programa que gere dois vetores contendo N n´umeros inteiros aleat´orios cada um. Ap´os a gera¸c˜ao dos vetores,
o programa deve imprimir a soma dos elementos dos vetores da seguinte forma: o primeiro elemento do primeiro vetor
+ o ´ultimo elemento do segundo vetor, o segundo elemento do primeiro vetor + o pen´ultimo elemento do segundo
vetor, e assim por diante, at´e o ´ultimo elemento do primeiro vetor + o primeiro elemento do segundo vetor.*/
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define N 5
void fillRandom(int array1[],int array2[]);
void printSum(int array1[],int array2[]);
int main(){
int array1[N], array2[N];
fillRandom(array1, array2);
printSum(array1,array2);
}
void fillRandom(int array1[],int array2[]){
int i;
srand(time(NULL));
for(i=0; i<N; i++){
array1[i]=rand()%100;
array2[i]=rand()%100;
printf("Vetor 1 %d: %d\n", i, array1[i]);
printf("Vetor 2 %d: %d\n",i, array2[i]);
}
}
void printSum(int array1[],int array2[]){
int i, j=N-1;
for(i=0; i<N; i++,j--)
printf("\t\t\t%d + %d = %d\n", array1[i], array2[j],array1[i]+array2[j]);
}
|
the_stack_data/73576047.c
|
/* A Bison parser, made by GNU Bison 3.0.4. */
/* Bison implementation for Yacc-like parsers in C
Copyright (C) 1984, 1989-1990, 2000-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 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
/* As a special exception, you may create a larger work that contains
part or all of the Bison parser skeleton and distribute that work
under terms of your choice, so long as that work isn't itself a
parser generator using the skeleton or a modified version thereof
as a parser skeleton. Alternatively, if you modify or redistribute
the parser skeleton itself, you may (at your option) remove this
special exception, which will cause the skeleton and the resulting
Bison output files to be licensed under the GNU General Public
License without this special exception.
This special exception was added by the Free Software Foundation in
version 2.2 of Bison. */
/* C LALR(1) parser skeleton written by Richard Stallman, by
simplifying the original so-called "semantic" parser. */
/* All symbols defined below should begin with yy or YY, to avoid
infringing on user name space. This should be done even for local
variables, as they might otherwise be expanded by user macros.
There are some unavoidable exceptions within include files to
define necessary library symbols; they are noted "INFRINGES ON
USER NAME SPACE" below. */
/* Identify Bison output. */
#define YYBISON 1
/* Bison version. */
#define YYBISON_VERSION "3.0.4"
/* Skeleton name. */
#define YYSKELETON_NAME "yacc.c"
/* Pure parsers. */
#define YYPURE 0
/* Push parsers. */
#define YYPUSH 0
/* Pull parsers. */
#define YYPULL 1
/* Copy the first part of user declarations. */
#line 1 "zad5.y" /* yacc.c:339 */
#include <ctype.h>
#include <stdio.h>
#define YYSTYPE char*
int yylex(void);
int yyparse(void);
int yyerror(char *s);
#line 75 "zad5.tab.c" /* yacc.c:339 */
# ifndef YY_NULLPTR
# if defined __cplusplus && 201103L <= __cplusplus
# define YY_NULLPTR nullptr
# else
# define YY_NULLPTR 0
# endif
# endif
/* Enabling verbose error messages. */
#ifdef YYERROR_VERBOSE
# undef YYERROR_VERBOSE
# define YYERROR_VERBOSE 1
#else
# define YYERROR_VERBOSE 0
#endif
/* In a future release of Bison, this section will be replaced
by #include "zad5.tab.h". */
#ifndef YY_YY_ZAD5_TAB_H_INCLUDED
# define YY_YY_ZAD5_TAB_H_INCLUDED
/* Debug traces. */
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
#if YYDEBUG
extern int yydebug;
#endif
/* Token type. */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
enum yytokentype
{
_COLOR = 258,
_AM = 259,
_FALL = 260,
_COOKIE = 261,
_FRIES = 262,
_FREEWAY = 263
};
#endif
/* Value type. */
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
typedef int YYSTYPE;
# define YYSTYPE_IS_TRIVIAL 1
# define YYSTYPE_IS_DECLARED 1
#endif
extern YYSTYPE yylval;
int yyparse (void);
#endif /* !YY_YY_ZAD5_TAB_H_INCLUDED */
/* Copy the second part of user declarations. */
#line 135 "zad5.tab.c" /* yacc.c:358 */
#ifdef short
# undef short
#endif
#ifdef YYTYPE_UINT8
typedef YYTYPE_UINT8 yytype_uint8;
#else
typedef unsigned char yytype_uint8;
#endif
#ifdef YYTYPE_INT8
typedef YYTYPE_INT8 yytype_int8;
#else
typedef signed char yytype_int8;
#endif
#ifdef YYTYPE_UINT16
typedef YYTYPE_UINT16 yytype_uint16;
#else
typedef unsigned short int yytype_uint16;
#endif
#ifdef YYTYPE_INT16
typedef YYTYPE_INT16 yytype_int16;
#else
typedef short int yytype_int16;
#endif
#ifndef YYSIZE_T
# ifdef __SIZE_TYPE__
# define YYSIZE_T __SIZE_TYPE__
# elif defined size_t
# define YYSIZE_T size_t
# elif ! defined YYSIZE_T
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T size_t
# else
# define YYSIZE_T unsigned int
# endif
#endif
#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
#ifndef YY_
# if defined YYENABLE_NLS && YYENABLE_NLS
# if ENABLE_NLS
# include <libintl.h> /* INFRINGES ON USER NAME SPACE */
# define YY_(Msgid) dgettext ("bison-runtime", Msgid)
# endif
# endif
# ifndef YY_
# define YY_(Msgid) Msgid
# endif
#endif
#ifndef YY_ATTRIBUTE
# if (defined __GNUC__ \
&& (2 < __GNUC__ || (__GNUC__ == 2 && 96 <= __GNUC_MINOR__))) \
|| defined __SUNPRO_C && 0x5110 <= __SUNPRO_C
# define YY_ATTRIBUTE(Spec) __attribute__(Spec)
# else
# define YY_ATTRIBUTE(Spec) /* empty */
# endif
#endif
#ifndef YY_ATTRIBUTE_PURE
# define YY_ATTRIBUTE_PURE YY_ATTRIBUTE ((__pure__))
#endif
#ifndef YY_ATTRIBUTE_UNUSED
# define YY_ATTRIBUTE_UNUSED YY_ATTRIBUTE ((__unused__))
#endif
#if !defined _Noreturn \
&& (!defined __STDC_VERSION__ || __STDC_VERSION__ < 201112)
# if defined _MSC_VER && 1200 <= _MSC_VER
# define _Noreturn __declspec (noreturn)
# else
# define _Noreturn YY_ATTRIBUTE ((__noreturn__))
# endif
#endif
/* Suppress unused-variable warnings by "using" E. */
#if ! defined lint || defined __GNUC__
# define YYUSE(E) ((void) (E))
#else
# define YYUSE(E) /* empty */
#endif
#if defined __GNUC__ && 407 <= __GNUC__ * 100 + __GNUC_MINOR__
/* Suppress an incorrect diagnostic about yylval being uninitialized. */
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
_Pragma ("GCC diagnostic push") \
_Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")\
_Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")
# define YY_IGNORE_MAYBE_UNINITIALIZED_END \
_Pragma ("GCC diagnostic pop")
#else
# define YY_INITIAL_VALUE(Value) Value
#endif
#ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
# define YY_IGNORE_MAYBE_UNINITIALIZED_END
#endif
#ifndef YY_INITIAL_VALUE
# define YY_INITIAL_VALUE(Value) /* Nothing. */
#endif
#if ! defined yyoverflow || YYERROR_VERBOSE
/* The parser invokes alloca or malloc; define the necessary symbols. */
# ifdef YYSTACK_USE_ALLOCA
# if YYSTACK_USE_ALLOCA
# ifdef __GNUC__
# define YYSTACK_ALLOC __builtin_alloca
# elif defined __BUILTIN_VA_ARG_INCR
# include <alloca.h> /* INFRINGES ON USER NAME SPACE */
# elif defined _AIX
# define YYSTACK_ALLOC __alloca
# elif defined _MSC_VER
# include <malloc.h> /* INFRINGES ON USER NAME SPACE */
# define alloca _alloca
# else
# define YYSTACK_ALLOC alloca
# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
/* Use EXIT_SUCCESS as a witness for stdlib.h. */
# ifndef EXIT_SUCCESS
# define EXIT_SUCCESS 0
# endif
# endif
# endif
# endif
# endif
# ifdef YYSTACK_ALLOC
/* Pacify GCC's 'empty if-body' warning. */
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
# ifndef YYSTACK_ALLOC_MAXIMUM
/* The OS might guarantee only one guard page at the bottom of the stack,
and a page size can be as small as 4096 bytes. So we cannot safely
invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
to allow for a few compiler-allocated temporary stack slots. */
# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
# endif
# else
# define YYSTACK_ALLOC YYMALLOC
# define YYSTACK_FREE YYFREE
# ifndef YYSTACK_ALLOC_MAXIMUM
# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
# endif
# if (defined __cplusplus && ! defined EXIT_SUCCESS \
&& ! ((defined YYMALLOC || defined malloc) \
&& (defined YYFREE || defined free)))
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
# ifndef EXIT_SUCCESS
# define EXIT_SUCCESS 0
# endif
# endif
# ifndef YYMALLOC
# define YYMALLOC malloc
# if ! defined malloc && ! defined EXIT_SUCCESS
void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# ifndef YYFREE
# define YYFREE free
# if ! defined free && ! defined EXIT_SUCCESS
void free (void *); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# endif
#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
#if (! defined yyoverflow \
&& (! defined __cplusplus \
|| (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
/* A type that is properly aligned for any stack member. */
union yyalloc
{
yytype_int16 yyss_alloc;
YYSTYPE yyvs_alloc;
};
/* The size of the maximum gap between one aligned stack and the next. */
# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
/* The size of an array large to enough to hold all stacks, each with
N elements. */
# define YYSTACK_BYTES(N) \
((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \
+ YYSTACK_GAP_MAXIMUM)
# define YYCOPY_NEEDED 1
/* Relocate STACK from its old location to the new one. The
local variables YYSIZE and YYSTACKSIZE give the old and new number of
elements in the stack, and YYPTR gives the new location of the
stack. Advance YYPTR to a properly aligned location for the next
stack. */
# define YYSTACK_RELOCATE(Stack_alloc, Stack) \
do \
{ \
YYSIZE_T yynewbytes; \
YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \
Stack = &yyptr->Stack_alloc; \
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
yyptr += yynewbytes / sizeof (*yyptr); \
} \
while (0)
#endif
#if defined YYCOPY_NEEDED && YYCOPY_NEEDED
/* Copy COUNT objects from SRC to DST. The source and destination do
not overlap. */
# ifndef YYCOPY
# if defined __GNUC__ && 1 < __GNUC__
# define YYCOPY(Dst, Src, Count) \
__builtin_memcpy (Dst, Src, (Count) * sizeof (*(Src)))
# else
# define YYCOPY(Dst, Src, Count) \
do \
{ \
YYSIZE_T yyi; \
for (yyi = 0; yyi < (Count); yyi++) \
(Dst)[yyi] = (Src)[yyi]; \
} \
while (0)
# endif
# endif
#endif /* !YYCOPY_NEEDED */
/* YYFINAL -- State number of the termination state. */
#define YYFINAL 2
/* YYLAST -- Last index in YYTABLE. */
#define YYLAST 8
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 9
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 2
/* YYNRULES -- Number of rules. */
#define YYNRULES 8
/* YYNSTATES -- Number of states. */
#define YYNSTATES 9
/* YYTRANSLATE[YYX] -- Symbol number corresponding to YYX as returned
by yylex, with out-of-bounds checking. */
#define YYUNDEFTOK 2
#define YYMAXUTOK 263
#define YYTRANSLATE(YYX) \
((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM
as returned by yylex, without out-of-bounds checking. */
static const yytype_uint8 yytranslate[] =
{
0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 1, 2, 3, 4,
5, 6, 7, 8
};
#if YYDEBUG
/* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
static const yytype_uint8 yyrline[] =
{
0, 18, 18, 20, 21, 22, 23, 24, 25
};
#endif
#if YYDEBUG || YYERROR_VERBOSE || 0
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
static const char *const yytname[] =
{
"$end", "error", "$undefined", "_COLOR", "_AM", "_FALL", "_COOKIE",
"_FRIES", "_FREEWAY", "$accept", "word", YY_NULLPTR
};
#endif
# ifdef YYPRINT
/* YYTOKNUM[NUM] -- (External) token number corresponding to the
(internal) symbol number NUM (which must be that of a token). */
static const yytype_uint16 yytoknum[] =
{
0, 256, 257, 258, 259, 260, 261, 262, 263
};
# endif
#define YYPACT_NINF -1
#define yypact_value_is_default(Yystate) \
(!!((Yystate) == (-1)))
#define YYTABLE_NINF -1
#define yytable_value_is_error(Yytable_value) \
0
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
STATE-NUM. */
static const yytype_int8 yypact[] =
{
-1, 0, -1, -1, -1, -1, -1, -1, -1
};
/* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM.
Performed when YYTABLE does not specify something else to do. Zero
means the default is an error. */
static const yytype_uint8 yydefact[] =
{
2, 0, 1, 3, 4, 5, 6, 7, 8
};
/* YYPGOTO[NTERM-NUM]. */
static const yytype_int8 yypgoto[] =
{
-1, -1
};
/* YYDEFGOTO[NTERM-NUM]. */
static const yytype_int8 yydefgoto[] =
{
-1, 1
};
/* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM. If
positive, shift that token. If negative, reduce the rule whose
number is the opposite. If YYTABLE_NINF, syntax error. */
static const yytype_uint8 yytable[] =
{
2, 0, 0, 3, 4, 5, 6, 7, 8
};
static const yytype_int8 yycheck[] =
{
0, -1, -1, 3, 4, 5, 6, 7, 8
};
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
symbol of state STATE-NUM. */
static const yytype_uint8 yystos[] =
{
0, 10, 0, 3, 4, 5, 6, 7, 8
};
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
static const yytype_uint8 yyr1[] =
{
0, 9, 10, 10, 10, 10, 10, 10, 10
};
/* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */
static const yytype_uint8 yyr2[] =
{
0, 2, 0, 2, 2, 2, 2, 2, 2
};
#define yyerrok (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
#define YYEMPTY (-2)
#define YYEOF 0
#define YYACCEPT goto yyacceptlab
#define YYABORT goto yyabortlab
#define YYERROR goto yyerrorlab
#define YYRECOVERING() (!!yyerrstatus)
#define YYBACKUP(Token, Value) \
do \
if (yychar == YYEMPTY) \
{ \
yychar = (Token); \
yylval = (Value); \
YYPOPSTACK (yylen); \
yystate = *yyssp; \
goto yybackup; \
} \
else \
{ \
yyerror (YY_("syntax error: cannot back up")); \
YYERROR; \
} \
while (0)
/* Error token number */
#define YYTERROR 1
#define YYERRCODE 256
/* Enable debugging if requested. */
#if YYDEBUG
# ifndef YYFPRINTF
# include <stdio.h> /* INFRINGES ON USER NAME SPACE */
# define YYFPRINTF fprintf
# endif
# define YYDPRINTF(Args) \
do { \
if (yydebug) \
YYFPRINTF Args; \
} while (0)
/* This macro is provided for backward compatibility. */
#ifndef YY_LOCATION_PRINT
# define YY_LOCATION_PRINT(File, Loc) ((void) 0)
#endif
# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \
do { \
if (yydebug) \
{ \
YYFPRINTF (stderr, "%s ", Title); \
yy_symbol_print (stderr, \
Type, Value); \
YYFPRINTF (stderr, "\n"); \
} \
} while (0)
/*----------------------------------------.
| Print this symbol's value on YYOUTPUT. |
`----------------------------------------*/
static void
yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
{
FILE *yyo = yyoutput;
YYUSE (yyo);
if (!yyvaluep)
return;
# ifdef YYPRINT
if (yytype < YYNTOKENS)
YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
# endif
YYUSE (yytype);
}
/*--------------------------------.
| Print this symbol on YYOUTPUT. |
`--------------------------------*/
static void
yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep)
{
YYFPRINTF (yyoutput, "%s %s (",
yytype < YYNTOKENS ? "token" : "nterm", yytname[yytype]);
yy_symbol_value_print (yyoutput, yytype, yyvaluep);
YYFPRINTF (yyoutput, ")");
}
/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
| TOP (included). |
`------------------------------------------------------------------*/
static void
yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop)
{
YYFPRINTF (stderr, "Stack now");
for (; yybottom <= yytop; yybottom++)
{
int yybot = *yybottom;
YYFPRINTF (stderr, " %d", yybot);
}
YYFPRINTF (stderr, "\n");
}
# define YY_STACK_PRINT(Bottom, Top) \
do { \
if (yydebug) \
yy_stack_print ((Bottom), (Top)); \
} while (0)
/*------------------------------------------------.
| Report that the YYRULE is going to be reduced. |
`------------------------------------------------*/
static void
yy_reduce_print (yytype_int16 *yyssp, YYSTYPE *yyvsp, int yyrule)
{
unsigned long int yylno = yyrline[yyrule];
int yynrhs = yyr2[yyrule];
int yyi;
YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
yyrule - 1, yylno);
/* The symbols being reduced. */
for (yyi = 0; yyi < yynrhs; yyi++)
{
YYFPRINTF (stderr, " $%d = ", yyi + 1);
yy_symbol_print (stderr,
yystos[yyssp[yyi + 1 - yynrhs]],
&(yyvsp[(yyi + 1) - (yynrhs)])
);
YYFPRINTF (stderr, "\n");
}
}
# define YY_REDUCE_PRINT(Rule) \
do { \
if (yydebug) \
yy_reduce_print (yyssp, yyvsp, Rule); \
} while (0)
/* Nonzero means print parse trace. It is left uninitialized so that
multiple parsers can coexist. */
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args)
# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
# define YY_STACK_PRINT(Bottom, Top)
# define YY_REDUCE_PRINT(Rule)
#endif /* !YYDEBUG */
/* YYINITDEPTH -- initial size of the parser's stacks. */
#ifndef YYINITDEPTH
# define YYINITDEPTH 200
#endif
/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
if the built-in stack extension method is used).
Do not make this value too large; the results are undefined if
YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
evaluated with infinite-precision integer arithmetic. */
#ifndef YYMAXDEPTH
# define YYMAXDEPTH 10000
#endif
#if YYERROR_VERBOSE
# ifndef yystrlen
# if defined __GLIBC__ && defined _STRING_H
# define yystrlen strlen
# else
/* Return the length of YYSTR. */
static YYSIZE_T
yystrlen (const char *yystr)
{
YYSIZE_T yylen;
for (yylen = 0; yystr[yylen]; yylen++)
continue;
return yylen;
}
# endif
# endif
# ifndef yystpcpy
# if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
# define yystpcpy stpcpy
# else
/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
YYDEST. */
static char *
yystpcpy (char *yydest, const char *yysrc)
{
char *yyd = yydest;
const char *yys = yysrc;
while ((*yyd++ = *yys++) != '\0')
continue;
return yyd - 1;
}
# endif
# endif
# ifndef yytnamerr
/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
quotes and backslashes, so that it's suitable for yyerror. The
heuristic is that double-quoting is unnecessary unless the string
contains an apostrophe, a comma, or backslash (other than
backslash-backslash). YYSTR is taken from yytname. If YYRES is
null, do not copy; instead, return the length of what the result
would have been. */
static YYSIZE_T
yytnamerr (char *yyres, const char *yystr)
{
if (*yystr == '"')
{
YYSIZE_T yyn = 0;
char const *yyp = yystr;
for (;;)
switch (*++yyp)
{
case '\'':
case ',':
goto do_not_strip_quotes;
case '\\':
if (*++yyp != '\\')
goto do_not_strip_quotes;
/* Fall through. */
default:
if (yyres)
yyres[yyn] = *yyp;
yyn++;
break;
case '"':
if (yyres)
yyres[yyn] = '\0';
return yyn;
}
do_not_strip_quotes: ;
}
if (! yyres)
return yystrlen (yystr);
return yystpcpy (yyres, yystr) - yyres;
}
# endif
/* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message
about the unexpected token YYTOKEN for the state stack whose top is
YYSSP.
Return 0 if *YYMSG was successfully written. Return 1 if *YYMSG is
not large enough to hold the message. In that case, also set
*YYMSG_ALLOC to the required number of bytes. Return 2 if the
required number of bytes is too large to store. */
static int
yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg,
yytype_int16 *yyssp, int yytoken)
{
YYSIZE_T yysize0 = yytnamerr (YY_NULLPTR, yytname[yytoken]);
YYSIZE_T yysize = yysize0;
enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
/* Internationalized format string. */
const char *yyformat = YY_NULLPTR;
/* Arguments of yyformat. */
char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
/* Number of reported tokens (one for the "unexpected", one per
"expected"). */
int yycount = 0;
/* There are many possibilities here to consider:
- If this state is a consistent state with a default action, then
the only way this function was invoked is if the default action
is an error action. In that case, don't check for expected
tokens because there are none.
- The only way there can be no lookahead present (in yychar) is if
this state is a consistent state with a default action. Thus,
detecting the absence of a lookahead is sufficient to determine
that there is no unexpected or expected token to report. In that
case, just report a simple "syntax error".
- Don't assume there isn't a lookahead just because this state is a
consistent state with a default action. There might have been a
previous inconsistent state, consistent state with a non-default
action, or user semantic action that manipulated yychar.
- Of course, the expected token list depends on states to have
correct lookahead information, and it depends on the parser not
to perform extra reductions after fetching a lookahead from the
scanner and before detecting a syntax error. Thus, state merging
(from LALR or IELR) and default reductions corrupt the expected
token list. However, the list is correct for canonical LR with
one exception: it will still contain any token that will not be
accepted due to an error action in a later state.
*/
if (yytoken != YYEMPTY)
{
int yyn = yypact[*yyssp];
yyarg[yycount++] = yytname[yytoken];
if (!yypact_value_is_default (yyn))
{
/* Start YYX at -YYN if negative to avoid negative indexes in
YYCHECK. In other words, skip the first -YYN actions for
this state because they are default actions. */
int yyxbegin = yyn < 0 ? -yyn : 0;
/* Stay within bounds of both yycheck and yytname. */
int yychecklim = YYLAST - yyn + 1;
int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
int yyx;
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR
&& !yytable_value_is_error (yytable[yyx + yyn]))
{
if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
{
yycount = 1;
yysize = yysize0;
break;
}
yyarg[yycount++] = yytname[yyx];
{
YYSIZE_T yysize1 = yysize + yytnamerr (YY_NULLPTR, yytname[yyx]);
if (! (yysize <= yysize1
&& yysize1 <= YYSTACK_ALLOC_MAXIMUM))
return 2;
yysize = yysize1;
}
}
}
}
switch (yycount)
{
# define YYCASE_(N, S) \
case N: \
yyformat = S; \
break
YYCASE_(0, YY_("syntax error"));
YYCASE_(1, YY_("syntax error, unexpected %s"));
YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s"));
YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s"));
YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s"));
YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"));
# undef YYCASE_
}
{
YYSIZE_T yysize1 = yysize + yystrlen (yyformat);
if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM))
return 2;
yysize = yysize1;
}
if (*yymsg_alloc < yysize)
{
*yymsg_alloc = 2 * yysize;
if (! (yysize <= *yymsg_alloc
&& *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM))
*yymsg_alloc = YYSTACK_ALLOC_MAXIMUM;
return 1;
}
/* Avoid sprintf, as that infringes on the user's name space.
Don't have undefined behavior even if the translation
produced a string with the wrong number of "%s"s. */
{
char *yyp = *yymsg;
int yyi = 0;
while ((*yyp = *yyformat) != '\0')
if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount)
{
yyp += yytnamerr (yyp, yyarg[yyi++]);
yyformat += 2;
}
else
{
yyp++;
yyformat++;
}
}
return 0;
}
#endif /* YYERROR_VERBOSE */
/*-----------------------------------------------.
| Release the memory associated to this symbol. |
`-----------------------------------------------*/
static void
yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
{
YYUSE (yyvaluep);
if (!yymsg)
yymsg = "Deleting";
YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
YYUSE (yytype);
YY_IGNORE_MAYBE_UNINITIALIZED_END
}
/* The lookahead symbol. */
int yychar;
/* The semantic value of the lookahead symbol. */
YYSTYPE yylval;
/* Number of syntax errors so far. */
int yynerrs;
/*----------.
| yyparse. |
`----------*/
int
yyparse (void)
{
int yystate;
/* Number of tokens to shift before error messages enabled. */
int yyerrstatus;
/* The stacks and their tools:
'yyss': related to states.
'yyvs': related to semantic values.
Refer to the stacks through separate pointers, to allow yyoverflow
to reallocate them elsewhere. */
/* The state stack. */
yytype_int16 yyssa[YYINITDEPTH];
yytype_int16 *yyss;
yytype_int16 *yyssp;
/* The semantic value stack. */
YYSTYPE yyvsa[YYINITDEPTH];
YYSTYPE *yyvs;
YYSTYPE *yyvsp;
YYSIZE_T yystacksize;
int yyn;
int yyresult;
/* Lookahead token as an internal (translated) token number. */
int yytoken = 0;
/* The variables used to return semantic value and location from the
action routines. */
YYSTYPE yyval;
#if YYERROR_VERBOSE
/* Buffer for error messages, and its allocated size. */
char yymsgbuf[128];
char *yymsg = yymsgbuf;
YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
#endif
#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N))
/* The number of symbols on the RHS of the reduced rule.
Keep to zero when no symbol should be popped. */
int yylen = 0;
yyssp = yyss = yyssa;
yyvsp = yyvs = yyvsa;
yystacksize = YYINITDEPTH;
YYDPRINTF ((stderr, "Starting parse\n"));
yystate = 0;
yyerrstatus = 0;
yynerrs = 0;
yychar = YYEMPTY; /* Cause a token to be read. */
goto yysetstate;
/*------------------------------------------------------------.
| yynewstate -- Push a new state, which is found in yystate. |
`------------------------------------------------------------*/
yynewstate:
/* In all cases, when you get here, the value and location stacks
have just been pushed. So pushing a state here evens the stacks. */
yyssp++;
yysetstate:
*yyssp = yystate;
if (yyss + yystacksize - 1 <= yyssp)
{
/* Get the current used size of the three stacks, in elements. */
YYSIZE_T yysize = yyssp - yyss + 1;
#ifdef yyoverflow
{
/* Give user a chance to reallocate the stack. Use copies of
these so that the &'s don't force the real ones into
memory. */
YYSTYPE *yyvs1 = yyvs;
yytype_int16 *yyss1 = yyss;
/* Each stack pointer address is followed by the size of the
data in use in that stack, in bytes. This used to be a
conditional around just the two extra args, but that might
be undefined if yyoverflow is a macro. */
yyoverflow (YY_("memory exhausted"),
&yyss1, yysize * sizeof (*yyssp),
&yyvs1, yysize * sizeof (*yyvsp),
&yystacksize);
yyss = yyss1;
yyvs = yyvs1;
}
#else /* no yyoverflow */
# ifndef YYSTACK_RELOCATE
goto yyexhaustedlab;
# else
/* Extend the stack our own way. */
if (YYMAXDEPTH <= yystacksize)
goto yyexhaustedlab;
yystacksize *= 2;
if (YYMAXDEPTH < yystacksize)
yystacksize = YYMAXDEPTH;
{
yytype_int16 *yyss1 = yyss;
union yyalloc *yyptr =
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
if (! yyptr)
goto yyexhaustedlab;
YYSTACK_RELOCATE (yyss_alloc, yyss);
YYSTACK_RELOCATE (yyvs_alloc, yyvs);
# undef YYSTACK_RELOCATE
if (yyss1 != yyssa)
YYSTACK_FREE (yyss1);
}
# endif
#endif /* no yyoverflow */
yyssp = yyss + yysize - 1;
yyvsp = yyvs + yysize - 1;
YYDPRINTF ((stderr, "Stack size increased to %lu\n",
(unsigned long int) yystacksize));
if (yyss + yystacksize - 1 <= yyssp)
YYABORT;
}
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
if (yystate == YYFINAL)
YYACCEPT;
goto yybackup;
/*-----------.
| yybackup. |
`-----------*/
yybackup:
/* Do appropriate processing given the current state. Read a
lookahead token if we need one and don't already have one. */
/* First try to decide what to do without reference to lookahead token. */
yyn = yypact[yystate];
if (yypact_value_is_default (yyn))
goto yydefault;
/* Not known => get a lookahead token if don't already have one. */
/* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */
if (yychar == YYEMPTY)
{
YYDPRINTF ((stderr, "Reading a token: "));
yychar = yylex ();
}
if (yychar <= YYEOF)
{
yychar = yytoken = YYEOF;
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
else
{
yytoken = YYTRANSLATE (yychar);
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
}
/* If the proper action on seeing token YYTOKEN is to reduce or to
detect an error, take that action. */
yyn += yytoken;
if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
goto yydefault;
yyn = yytable[yyn];
if (yyn <= 0)
{
if (yytable_value_is_error (yyn))
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
/* Count tokens shifted since error; after three, turn off error
status. */
if (yyerrstatus)
yyerrstatus--;
/* Shift the lookahead token. */
YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
/* Discard the shifted token. */
yychar = YYEMPTY;
yystate = yyn;
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
*++yyvsp = yylval;
YY_IGNORE_MAYBE_UNINITIALIZED_END
goto yynewstate;
/*-----------------------------------------------------------.
| yydefault -- do the default action for the current state. |
`-----------------------------------------------------------*/
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
goto yyreduce;
/*-----------------------------.
| yyreduce -- Do a reduction. |
`-----------------------------*/
yyreduce:
/* yyn is the number of a rule to reduce with. */
yylen = yyr2[yyn];
/* If YYLEN is nonzero, implement the default value of the action:
'$$ = $1'.
Otherwise, the following line sets YYVAL to garbage.
This behavior is undocumented and Bison
users should not rely upon it. Assigning to YYVAL
unconditionally makes the parser a bit smaller, and it avoids a
GCC warning that YYVAL may be used uninitialized. */
yyval = yyvsp[1-yylen];
YY_REDUCE_PRINT (yyn);
switch (yyn)
{
case 3:
#line 20 "zad5.y" /* yacc.c:1646 */
{printf("colour");}
#line 1201 "zad5.tab.c" /* yacc.c:1646 */
break;
case 4:
#line 21 "zad5.y" /* yacc.c:1646 */
{printf("br");}
#line 1207 "zad5.tab.c" /* yacc.c:1646 */
break;
case 5:
#line 22 "zad5.y" /* yacc.c:1646 */
{printf("autumn");}
#line 1213 "zad5.tab.c" /* yacc.c:1646 */
break;
case 6:
#line 23 "zad5.y" /* yacc.c:1646 */
{printf("biscuit");}
#line 1219 "zad5.tab.c" /* yacc.c:1646 */
break;
case 7:
#line 24 "zad5.y" /* yacc.c:1646 */
{printf("chips");}
#line 1225 "zad5.tab.c" /* yacc.c:1646 */
break;
case 8:
#line 25 "zad5.y" /* yacc.c:1646 */
{printf("motorway");}
#line 1231 "zad5.tab.c" /* yacc.c:1646 */
break;
#line 1235 "zad5.tab.c" /* yacc.c:1646 */
default: break;
}
/* User semantic actions sometimes alter yychar, and that requires
that yytoken be updated with the new translation. We take the
approach of translating immediately before every use of yytoken.
One alternative is translating here after every semantic action,
but that translation would be missed if the semantic action invokes
YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or
if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an
incorrect destructor might then be invoked immediately. In the
case of YYERROR or YYBACKUP, subsequent parser actions might lead
to an incorrect destructor call or verbose syntax error message
before the lookahead is translated. */
YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
*++yyvsp = yyval;
/* Now 'shift' the result of the reduction. Determine what state
that goes to, based on the state we popped back to and the rule
number reduced by. */
yyn = yyr1[yyn];
yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
yystate = yytable[yystate];
else
yystate = yydefgoto[yyn - YYNTOKENS];
goto yynewstate;
/*--------------------------------------.
| yyerrlab -- here on detecting error. |
`--------------------------------------*/
yyerrlab:
/* Make sure we have latest lookahead translation. See comments at
user semantic actions for why this is necessary. */
yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar);
/* If not already recovering from an error, report this error. */
if (!yyerrstatus)
{
++yynerrs;
#if ! YYERROR_VERBOSE
yyerror (YY_("syntax error"));
#else
# define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \
yyssp, yytoken)
{
char const *yymsgp = YY_("syntax error");
int yysyntax_error_status;
yysyntax_error_status = YYSYNTAX_ERROR;
if (yysyntax_error_status == 0)
yymsgp = yymsg;
else if (yysyntax_error_status == 1)
{
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc);
if (!yymsg)
{
yymsg = yymsgbuf;
yymsg_alloc = sizeof yymsgbuf;
yysyntax_error_status = 2;
}
else
{
yysyntax_error_status = YYSYNTAX_ERROR;
yymsgp = yymsg;
}
}
yyerror (yymsgp);
if (yysyntax_error_status == 2)
goto yyexhaustedlab;
}
# undef YYSYNTAX_ERROR
#endif
}
if (yyerrstatus == 3)
{
/* If just tried and failed to reuse lookahead token after an
error, discard it. */
if (yychar <= YYEOF)
{
/* Return failure if at end of input. */
if (yychar == YYEOF)
YYABORT;
}
else
{
yydestruct ("Error: discarding",
yytoken, &yylval);
yychar = YYEMPTY;
}
}
/* Else will try to reuse lookahead token after shifting the error
token. */
goto yyerrlab1;
/*---------------------------------------------------.
| yyerrorlab -- error raised explicitly by YYERROR. |
`---------------------------------------------------*/
yyerrorlab:
/* Pacify compilers like GCC when the user code never invokes
YYERROR and the label yyerrorlab therefore never appears in user
code. */
if (/*CONSTCOND*/ 0)
goto yyerrorlab;
/* Do not reclaim the symbols of the rule whose action triggered
this YYERROR. */
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
yystate = *yyssp;
goto yyerrlab1;
/*-------------------------------------------------------------.
| yyerrlab1 -- common code for both syntax error and YYERROR. |
`-------------------------------------------------------------*/
yyerrlab1:
yyerrstatus = 3; /* Each real token shifted decrements this. */
for (;;)
{
yyn = yypact[yystate];
if (!yypact_value_is_default (yyn))
{
yyn += YYTERROR;
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
{
yyn = yytable[yyn];
if (0 < yyn)
break;
}
}
/* Pop the current state because it cannot handle the error token. */
if (yyssp == yyss)
YYABORT;
yydestruct ("Error: popping",
yystos[yystate], yyvsp);
YYPOPSTACK (1);
yystate = *yyssp;
YY_STACK_PRINT (yyss, yyssp);
}
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
*++yyvsp = yylval;
YY_IGNORE_MAYBE_UNINITIALIZED_END
/* Shift the error token. */
YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
yystate = yyn;
goto yynewstate;
/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here. |
`-------------------------------------*/
yyacceptlab:
yyresult = 0;
goto yyreturn;
/*-----------------------------------.
| yyabortlab -- YYABORT comes here. |
`-----------------------------------*/
yyabortlab:
yyresult = 1;
goto yyreturn;
#if !defined yyoverflow || YYERROR_VERBOSE
/*-------------------------------------------------.
| yyexhaustedlab -- memory exhaustion comes here. |
`-------------------------------------------------*/
yyexhaustedlab:
yyerror (YY_("memory exhausted"));
yyresult = 2;
/* Fall through. */
#endif
yyreturn:
if (yychar != YYEMPTY)
{
/* Make sure we have latest lookahead translation. See comments at
user semantic actions for why this is necessary. */
yytoken = YYTRANSLATE (yychar);
yydestruct ("Cleanup: discarding lookahead",
yytoken, &yylval);
}
/* Do not reclaim the symbols of the rule whose action triggered
this YYABORT or YYACCEPT. */
YYPOPSTACK (yylen);
YY_STACK_PRINT (yyss, yyssp);
while (yyssp != yyss)
{
yydestruct ("Cleanup: popping",
yystos[*yyssp], yyvsp);
YYPOPSTACK (1);
}
#ifndef yyoverflow
if (yyss != yyssa)
YYSTACK_FREE (yyss);
#endif
#if YYERROR_VERBOSE
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
#endif
return yyresult;
}
#line 27 "zad5.y" /* yacc.c:1906 */
int main()
{
return yyparse();
}
int yyerror(char *s)
{
fprintf(stderr, "%s\n",s);
}
|
the_stack_data/340473.c
|
/* This testcase is part of GDB, the GNU debugger.
Copyright (C) 2013-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 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
int
main (void)
{
int x = 5;
++x; /* Next without dprintf. */
++x; /* Set dprintf here. */
return x - 7;
}
|
the_stack_data/154831906.c
|
#include<stdio.h>
int main(int argc,char** argv){
printf("%d\n",argc);
while(*argv!="\0"){
printf("%s\n",*argv);
argv++;
}
}
|
the_stack_data/100141167.c
|
//===-- b.c -----------------------------------------------------*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
static int __b_global = 2;
int b(int arg) {
int result = arg + __b_global;
return result;
}
int bb(int arg1) {
int result2 = arg1 - __b_global;
return result2;
}
|
the_stack_data/92325105.c
|
/*27. Implemente um programa em C que calcule o ano de nascimento de uma pessoa a partir
de sua idade e do ano atual.*/
#include <stdio.h>
int main(){
int nasc, ano, idade;
printf("Digite em que ano estamos: ");
scanf("%d",&ano);
printf("Digite a sua idade: ");
scanf("%d",&idade);
nasc = ano-idade;
printf("Voce nasceu no ano de: %d \n");
return 0;
}
|
the_stack_data/232956501.c
|
/* PR tree-optimization/29581 */
/* Origin: gcc.dg/vect/vect-87.c */
/* { dg-do run } */
/* { dg-options "-O2 -ftree-loop-linear" } */
extern void abort (void);
#define N 16
int main1 (int n, int *a)
{
int i, j, k;
int b[N];
for (i = 0; i < n; i++)
{
for (j = 0; j < n; j++)
{
k = i + n;
a[j] = k;
}
b[i] = k;
}
for (j = 0; j < n; j++)
if (a[j] != i + n - 1)
abort();
for (j = 0; j < n; j++)
if (b[j] != j + n)
abort();
return 0;
}
int main (void)
{
int a[N] __attribute__ ((__aligned__(16)));
main1 (N, a);
main1 (0, a);
main1 (1, a);
main1 (2, a);
main1 (N-1, a);
return 0;
}
|
the_stack_data/148578638.c
|
#include <stdio.h>
#include <stdlib.h>
#define BASE 10 //基数桶[0-9]
void radixsort(int arr[], int size)
{
if (arr == NULL)
return ;
//找出最大数
int max = arr[0];
int i;
for (i = 1; i < size; ++i) {
if (arr[i] > max) {
max = arr[i];
}
}
int exp = 1; //位数
int *temp = (int*) malloc(size * sizeof(int));
while (max / exp > 0) {
//重置基数桶
int bucket[BASE] = {0};
//统计每个基数上有多少个数据
for (i = 0; i < size; ++i) {
bucket[(arr[i] / exp) % BASE]++;
}
//求出基数桶的边界索引,bucket[i]值为第i个桶的右边界索引+1
for (i = 1; i < BASE; ++i) {
bucket[i] += bucket[i - 1];
// printf(" i ===>%d",i);
}
//这里要从右向左扫描，保证排序稳定性
for (i = size - 1; i >= 0; i--) {
temp[--bucket[(arr[i] / exp) % BASE]] = arr[i];
printf("");
}
printf("temp ===>");
for (int j = 0; j <BASE ; ++j) {
printf("%d ",temp[j]);
}
printf("\n");
//将基数桶排好的数据赋值到原数据，完成一趟排序
for (i = 0; i < size; ++i) {
arr[i] = temp[i];
}
exp *= BASE; //位数递增
}
free(temp);
}
int main()
{
int arr[] = {27, 91, 1, 97, 17, 23, 84, 28, 72, 5, 67, 25};
int size = sizeof(arr) / sizeof(int);
// soer
radixsort(arr, size);
//print
int i;
for (i = 0; i < size; ++i)
printf("%d ", arr[i]);
printf("\n");
getchar();
return 0;
}
|
the_stack_data/1210091.c
|
#include <stdio.h>
#include <stdint.h>
int
main()
{
struct {
uint8_t name[13];
int32_t math, chinese;
}__attribute__((packed)) s;
printf("%d\n", sizeof(s));
return 0;
}
|
the_stack_data/151705487.c
|
#include<stdio.h>
#include<math.h>
long long jiecheng(int x)
{
int i;
long long r = 1;
for(i = 1 ; i <= x ; i++){
r = r * i;
}
return r;
}
int main()
{
int n, m;
long long fenzi, fenmu, r;
scanf("%d%d", &m, &n);
fenmu = jiecheng(n);
fenzi = jiecheng(m) / jiecheng(m-n);
r = fenzi / fenmu;
if(n == 0){printf("%d", n);}
else{printf("%lld", r);}
return 0;
}
|
the_stack_data/21748.c
|
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <complex.h>
#ifdef complex
#undef complex
#endif
#ifdef I
#undef I
#endif
#if defined(_WIN64)
typedef long long BLASLONG;
typedef unsigned long long BLASULONG;
#else
typedef long BLASLONG;
typedef unsigned long BLASULONG;
#endif
#ifdef LAPACK_ILP64
typedef BLASLONG blasint;
#if defined(_WIN64)
#define blasabs(x) llabs(x)
#else
#define blasabs(x) labs(x)
#endif
#else
typedef int blasint;
#define blasabs(x) abs(x)
#endif
typedef blasint integer;
typedef unsigned int uinteger;
typedef char *address;
typedef short int shortint;
typedef float real;
typedef double doublereal;
typedef struct { real r, i; } complex;
typedef struct { doublereal r, i; } doublecomplex;
#ifdef _MSC_VER
static inline _Fcomplex Cf(complex *z) {_Fcomplex zz={z->r , z->i}; return zz;}
static inline _Dcomplex Cd(doublecomplex *z) {_Dcomplex zz={z->r , z->i};return zz;}
static inline _Fcomplex * _pCf(complex *z) {return (_Fcomplex*)z;}
static inline _Dcomplex * _pCd(doublecomplex *z) {return (_Dcomplex*)z;}
#else
static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}
static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}
static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}
static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}
#endif
#define pCf(z) (*_pCf(z))
#define pCd(z) (*_pCd(z))
typedef int logical;
typedef short int shortlogical;
typedef char logical1;
typedef char integer1;
#define TRUE_ (1)
#define FALSE_ (0)
/* Extern is for use with -E */
#ifndef Extern
#define Extern extern
#endif
/* I/O stuff */
typedef int flag;
typedef int ftnlen;
typedef int ftnint;
/*external read, write*/
typedef struct
{ flag cierr;
ftnint ciunit;
flag ciend;
char *cifmt;
ftnint cirec;
} cilist;
/*internal read, write*/
typedef struct
{ flag icierr;
char *iciunit;
flag iciend;
char *icifmt;
ftnint icirlen;
ftnint icirnum;
} icilist;
/*open*/
typedef struct
{ flag oerr;
ftnint ounit;
char *ofnm;
ftnlen ofnmlen;
char *osta;
char *oacc;
char *ofm;
ftnint orl;
char *oblnk;
} olist;
/*close*/
typedef struct
{ flag cerr;
ftnint cunit;
char *csta;
} cllist;
/*rewind, backspace, endfile*/
typedef struct
{ flag aerr;
ftnint aunit;
} alist;
/* inquire */
typedef struct
{ flag inerr;
ftnint inunit;
char *infile;
ftnlen infilen;
ftnint *inex; /*parameters in standard's order*/
ftnint *inopen;
ftnint *innum;
ftnint *innamed;
char *inname;
ftnlen innamlen;
char *inacc;
ftnlen inacclen;
char *inseq;
ftnlen inseqlen;
char *indir;
ftnlen indirlen;
char *infmt;
ftnlen infmtlen;
char *inform;
ftnint informlen;
char *inunf;
ftnlen inunflen;
ftnint *inrecl;
ftnint *innrec;
char *inblank;
ftnlen inblanklen;
} inlist;
#define VOID void
union Multitype { /* for multiple entry points */
integer1 g;
shortint h;
integer i;
/* longint j; */
real r;
doublereal d;
complex c;
doublecomplex z;
};
typedef union Multitype Multitype;
struct Vardesc { /* for Namelist */
char *name;
char *addr;
ftnlen *dims;
int type;
};
typedef struct Vardesc Vardesc;
struct Namelist {
char *name;
Vardesc **vars;
int nvars;
};
typedef struct Namelist Namelist;
#define abs(x) ((x) >= 0 ? (x) : -(x))
#define dabs(x) (fabs(x))
#define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
#define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
#define dmin(a,b) (f2cmin(a,b))
#define dmax(a,b) (f2cmax(a,b))
#define bit_test(a,b) ((a) >> (b) & 1)
#define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
#define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
#define abort_() { sig_die("Fortran abort routine called", 1); }
#define c_abs(z) (cabsf(Cf(z)))
#define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
#ifdef _MSC_VER
#define c_div(c, a, b) {Cf(c)._Val[0] = (Cf(a)._Val[0]/Cf(b)._Val[0]); Cf(c)._Val[1]=(Cf(a)._Val[1]/Cf(b)._Val[1]);}
#define z_div(c, a, b) {Cd(c)._Val[0] = (Cd(a)._Val[0]/Cd(b)._Val[0]); Cd(c)._Val[1]=(Cd(a)._Val[1]/df(b)._Val[1]);}
#else
#define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
#define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
#endif
#define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
#define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
#define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
//#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
#define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
#define d_abs(x) (fabs(*(x)))
#define d_acos(x) (acos(*(x)))
#define d_asin(x) (asin(*(x)))
#define d_atan(x) (atan(*(x)))
#define d_atn2(x, y) (atan2(*(x),*(y)))
#define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
#define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
#define d_cos(x) (cos(*(x)))
#define d_cosh(x) (cosh(*(x)))
#define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
#define d_exp(x) (exp(*(x)))
#define d_imag(z) (cimag(Cd(z)))
#define r_imag(z) (cimagf(Cf(z)))
#define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#define d_log(x) (log(*(x)))
#define d_mod(x, y) (fmod(*(x), *(y)))
#define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
#define d_nint(x) u_nint(*(x))
#define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
#define d_sign(a,b) u_sign(*(a),*(b))
#define r_sign(a,b) u_sign(*(a),*(b))
#define d_sin(x) (sin(*(x)))
#define d_sinh(x) (sinh(*(x)))
#define d_sqrt(x) (sqrt(*(x)))
#define d_tan(x) (tan(*(x)))
#define d_tanh(x) (tanh(*(x)))
#define i_abs(x) abs(*(x))
#define i_dnnt(x) ((integer)u_nint(*(x)))
#define i_len(s, n) (n)
#define i_nint(x) ((integer)u_nint(*(x)))
#define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
#define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
#define pow_si(B,E) spow_ui(*(B),*(E))
#define pow_ri(B,E) spow_ui(*(B),*(E))
#define pow_di(B,E) dpow_ui(*(B),*(E))
#define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
#define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
#define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
#define s_cat(lpp, rpp, rnp, np, llp) { ftnlen i, nc, ll; char *f__rp, *lp; ll = (llp); lp = (lpp); for(i=0; i < (int)*(np); ++i) { nc = ll; if((rnp)[i] < nc) nc = (rnp)[i]; ll -= nc; f__rp = (rpp)[i]; while(--nc >= 0) *lp++ = *(f__rp)++; } while(--ll >= 0) *lp++ = ' '; }
#define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
#define s_copy(A,B,C,D) { int __i,__m; for (__i=0, __m=f2cmin((C),(D)); __i<__m && (B)[__i] != 0; ++__i) (A)[__i] = (B)[__i]; }
#define sig_die(s, kill) { exit(1); }
#define s_stop(s, n) {exit(0);}
static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";
#define z_abs(z) (cabs(Cd(z)))
#define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
#define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
#define myexit_() break;
#define mycycle() continue;
#define myceiling(w) {ceil(w)}
#define myhuge(w) {HUGE_VAL}
//#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
#define mymaxloc(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}
/* procedure parameter types for -A and -C++ */
#define F2C_proc_par_types 1
#ifdef __cplusplus
typedef logical (*L_fp)(...);
#else
typedef logical (*L_fp)();
#endif
static float spow_ui(float x, integer n) {
float pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static double dpow_ui(double x, integer n) {
double pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#ifdef _MSC_VER
static _Fcomplex cpow_ui(complex x, integer n) {
complex pow={1.0,0.0}; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;
for(u = n; ; ) {
if(u & 01) pow.r *= x.r, pow.i *= x.i;
if(u >>= 1) x.r *= x.r, x.i *= x.i;
else break;
}
}
_Fcomplex p={pow.r, pow.i};
return p;
}
#else
static _Complex float cpow_ui(_Complex float x, integer n) {
_Complex float pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#endif
#ifdef _MSC_VER
static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
_Dcomplex pow={1.0,0.0}; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
for(u = n; ; ) {
if(u & 01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
else break;
}
}
_Dcomplex p = {pow._Val[0], pow._Val[1]};
return p;
}
#else
static _Complex double zpow_ui(_Complex double x, integer n) {
_Complex double pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#endif
static integer pow_ii(integer x, integer n) {
integer pow; unsigned long int u;
if (n <= 0) {
if (n == 0 || x == 1) pow = 1;
else if (x != -1) pow = x == 0 ? 1/x : 0;
else n = -n;
}
if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
u = n;
for(pow = 1; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static integer dmaxloc_(double *w, integer s, integer e, integer *n)
{
double m; integer i, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
return mi-s+1;
}
static integer smaxloc_(float *w, integer s, integer e, integer *n)
{
float m; integer i, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
return mi-s+1;
}
static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Fcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conjf(Cf(&x[i]))._Val[0] * Cf(&y[i])._Val[0];
zdotc._Val[1] += conjf(Cf(&x[i]))._Val[1] * Cf(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conjf(Cf(&x[i*incx]))._Val[0] * Cf(&y[i*incy])._Val[0];
zdotc._Val[1] += conjf(Cf(&x[i*incx]))._Val[1] * Cf(&y[i*incy])._Val[1];
}
}
pCf(z) = zdotc;
}
#else
_Complex float zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
}
}
pCf(z) = zdotc;
}
#endif
static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Dcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conj(Cd(&x[i]))._Val[0] * Cd(&y[i])._Val[0];
zdotc._Val[1] += conj(Cd(&x[i]))._Val[1] * Cd(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conj(Cd(&x[i*incx]))._Val[0] * Cd(&y[i*incy])._Val[0];
zdotc._Val[1] += conj(Cd(&x[i*incx]))._Val[1] * Cd(&y[i*incy])._Val[1];
}
}
pCd(z) = zdotc;
}
#else
_Complex double zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
}
}
pCd(z) = zdotc;
}
#endif
static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Fcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cf(&x[i])._Val[0] * Cf(&y[i])._Val[0];
zdotc._Val[1] += Cf(&x[i])._Val[1] * Cf(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cf(&x[i*incx])._Val[0] * Cf(&y[i*incy])._Val[0];
zdotc._Val[1] += Cf(&x[i*incx])._Val[1] * Cf(&y[i*incy])._Val[1];
}
}
pCf(z) = zdotc;
}
#else
_Complex float zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cf(&x[i]) * Cf(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
}
}
pCf(z) = zdotc;
}
#endif
static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Dcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cd(&x[i])._Val[0] * Cd(&y[i])._Val[0];
zdotc._Val[1] += Cd(&x[i])._Val[1] * Cd(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cd(&x[i*incx])._Val[0] * Cd(&y[i*incy])._Val[0];
zdotc._Val[1] += Cd(&x[i*incx])._Val[1] * Cd(&y[i*incy])._Val[1];
}
}
pCd(z) = zdotc;
}
#else
_Complex double zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cd(&x[i]) * Cd(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
}
}
pCd(z) = zdotc;
}
#endif
/* -- translated by f2c (version 20000121).
You must link the resulting object file with the libraries:
-lf2c -lm (in that order)
*/
/* Table of constant values */
static real c_b8 = 1.f;
static integer c__1 = 1;
/* > \brief \b CPPTRI */
/* =========== DOCUMENTATION =========== */
/* Online html documentation available at */
/* http://www.netlib.org/lapack/explore-html/ */
/* > \htmlonly */
/* > Download CPPTRI + dependencies */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/cpptri.
f"> */
/* > [TGZ]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/cpptri.
f"> */
/* > [ZIP]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/cpptri.
f"> */
/* > [TXT]</a> */
/* > \endhtmlonly */
/* Definition: */
/* =========== */
/* SUBROUTINE CPPTRI( UPLO, N, AP, INFO ) */
/* CHARACTER UPLO */
/* INTEGER INFO, N */
/* COMPLEX AP( * ) */
/* > \par Purpose: */
/* ============= */
/* > */
/* > \verbatim */
/* > */
/* > CPPTRI computes the inverse of a complex Hermitian positive definite */
/* > matrix A using the Cholesky factorization A = U**H*U or A = L*L**H */
/* > computed by CPPTRF. */
/* > \endverbatim */
/* Arguments: */
/* ========== */
/* > \param[in] UPLO */
/* > \verbatim */
/* > UPLO is CHARACTER*1 */
/* > = 'U': Upper triangular factor is stored in AP; */
/* > = 'L': Lower triangular factor is stored in AP. */
/* > \endverbatim */
/* > */
/* > \param[in] N */
/* > \verbatim */
/* > N is INTEGER */
/* > The order of the matrix A. N >= 0. */
/* > \endverbatim */
/* > */
/* > \param[in,out] AP */
/* > \verbatim */
/* > AP is COMPLEX array, dimension (N*(N+1)/2) */
/* > On entry, the triangular factor U or L from the Cholesky */
/* > factorization A = U**H*U or A = L*L**H, packed columnwise as */
/* > a linear array. The j-th column of U or L is stored in the */
/* > array AP as follows: */
/* > if UPLO = 'U', AP(i + (j-1)*j/2) = U(i,j) for 1<=i<=j; */
/* > if UPLO = 'L', AP(i + (j-1)*(2n-j)/2) = L(i,j) for j<=i<=n. */
/* > */
/* > On exit, the upper or lower triangle of the (Hermitian) */
/* > inverse of A, overwriting the input factor U or L. */
/* > \endverbatim */
/* > */
/* > \param[out] INFO */
/* > \verbatim */
/* > INFO is INTEGER */
/* > = 0: successful exit */
/* > < 0: if INFO = -i, the i-th argument had an illegal value */
/* > > 0: if INFO = i, the (i,i) element of the factor U or L is */
/* > zero, and the inverse could not be computed. */
/* > \endverbatim */
/* Authors: */
/* ======== */
/* > \author Univ. of Tennessee */
/* > \author Univ. of California Berkeley */
/* > \author Univ. of Colorado Denver */
/* > \author NAG Ltd. */
/* > \date December 2016 */
/* > \ingroup complexOTHERcomputational */
/* ===================================================================== */
/* Subroutine */ int cpptri_(char *uplo, integer *n, complex *ap, integer *
info)
{
/* System generated locals */
integer i__1, i__2, i__3;
real r__1;
complex q__1;
/* Local variables */
extern /* Subroutine */ int chpr_(char *, integer *, real *, complex *,
integer *, complex *);
integer j;
extern /* Complex */ VOID cdotc_(complex *, integer *, complex *, integer
*, complex *, integer *);
extern logical lsame_(char *, char *);
extern /* Subroutine */ int ctpmv_(char *, char *, char *, integer *,
complex *, complex *, integer *);
logical upper;
integer jc, jj;
extern /* Subroutine */ int csscal_(integer *, real *, complex *, integer
*), xerbla_(char *, integer *, ftnlen), ctptri_(char *, char *,
integer *, complex *, integer *);
real ajj;
integer jjn;
/* -- 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. */
/* Parameter adjustments */
--ap;
/* Function Body */
*info = 0;
upper = lsame_(uplo, "U");
if (! upper && ! lsame_(uplo, "L")) {
*info = -1;
} else if (*n < 0) {
*info = -2;
}
if (*info != 0) {
i__1 = -(*info);
xerbla_("CPPTRI", &i__1, (ftnlen)6);
return 0;
}
/* Quick return if possible */
if (*n == 0) {
return 0;
}
/* Invert the triangular Cholesky factor U or L. */
ctptri_(uplo, "Non-unit", n, &ap[1], info);
if (*info > 0) {
return 0;
}
if (upper) {
/* Compute the product inv(U) * inv(U)**H. */
jj = 0;
i__1 = *n;
for (j = 1; j <= i__1; ++j) {
jc = jj + 1;
jj += j;
if (j > 1) {
i__2 = j - 1;
chpr_("Upper", &i__2, &c_b8, &ap[jc], &c__1, &ap[1]);
}
i__2 = jj;
ajj = ap[i__2].r;
csscal_(&j, &ajj, &ap[jc], &c__1);
/* L10: */
}
} else {
/* Compute the product inv(L)**H * inv(L). */
jj = 1;
i__1 = *n;
for (j = 1; j <= i__1; ++j) {
jjn = jj + *n - j + 1;
i__2 = jj;
i__3 = *n - j + 1;
cdotc_(&q__1, &i__3, &ap[jj], &c__1, &ap[jj], &c__1);
r__1 = q__1.r;
ap[i__2].r = r__1, ap[i__2].i = 0.f;
if (j < *n) {
i__2 = *n - j;
ctpmv_("Lower", "Conjugate transpose", "Non-unit", &i__2, &ap[
jjn], &ap[jj + 1], &c__1);
}
jj = jjn;
/* L20: */
}
}
return 0;
/* End of CPPTRI */
} /* cpptri_ */
|
the_stack_data/125139690.c
|
#include <stdio.h>
int main() {
// When performing a textual operation with printf, it is mandatory to put a semicolon at the end of the parameters.
printf("Hello, C Programming Language.");
return 0;
}
|
the_stack_data/1157128.c
|
#include <stdio.h>
#include <stdlib.h>
int main()
{
printf("INIT\n");
const char* UNEXISTENT_ENVVAR = getenv("UNEXISTENT_ENVVAR");
printf("UNEXISTENT_ENVVAR = %s\n",(UNEXISTENT_ENVVAR!=NULL)? UNEXISTENT_ENVVAR : "[NULL]");
printf("Setting UNEXISTENT_ENVVAR=PUTENV (via putenv)\n");
putenv("UNEXISTENT_ENVVAR=PUTENV");
UNEXISTENT_ENVVAR = getenv("UNEXISTENT_ENVVAR");
printf("UNEXISTENT_ENVVAR = %s\n",(UNEXISTENT_ENVVAR!=NULL)? UNEXISTENT_ENVVAR : "[NULL]");
printf("Setting UNEXISTENT_ENVVAR=SETENV (via setenv, overwrite)\n");
setenv("UNEXISTENT_ENVVAR", "SETENV", 1);
UNEXISTENT_ENVVAR = getenv("UNEXISTENT_ENVVAR");
printf("UNEXISTENT_ENVVAR = %s\n",(UNEXISTENT_ENVVAR!=NULL)? UNEXISTENT_ENVVAR : "[NULL]");
printf("Setting UNEXISTENT_ENVVAR=SETENV_NEW (via setenv, NO overwrite)\n");
setenv("UNEXISTENT_ENVVAR", "SETENV_NEW", 0);
UNEXISTENT_ENVVAR = getenv("UNEXISTENT_ENVVAR");
printf("UNEXISTENT_ENVVAR = %s\n",(UNEXISTENT_ENVVAR!=NULL)? UNEXISTENT_ENVVAR : "[NULL]");
printf("Unsetting UNEXISTENT_ENVVAR\n");
unsetenv("UNEXISTENT_ENVVAR");
UNEXISTENT_ENVVAR = getenv("UNEXISTENT_ENVVAR");
printf("UNEXISTENT_ENVVAR = %s\n",(UNEXISTENT_ENVVAR!=NULL)? UNEXISTENT_ENVVAR : "[NULL]");
printf("END\n");
}
|
the_stack_data/128171.c
|
void dependenttype02() {
int i;
for (i=0; i<10; i++) {
int a[i+1];
for (int j=0; j<i+1; j++) {
a[j] = j;
}
}
}
|
the_stack_data/854867.c
|
#include <stdio.h>
int main(void) {
int tam;
printf("\ndigite tam: ");
scanf("%d", &tam);
int vet[tam];
printf("%d", vet[0]);
}
//https://pt.stackoverflow.com/q/35149/101
|
the_stack_data/437860.c
|
#include <stdio.h>
// FOR DEBUG
// void showMatrix(int arr[3][3]) {
// for (int i=0; i<3;i++) {
// for (int j=0; j<3; j++) {
// printf("%d", arr[i][j]);
// }
// puts("");
// }
// }
void matrix_add(int a[3][3], int b[3][3]) {
for (int i=0; i<3; i++) {
for (int j=0; j<3; j++) {
a[i][j] += b[i][j];
}
}
}
int main(int argc, char *argv[])
{
int a[3][3] = {0};
int b[3][3] = {0};
// a matrix
puts("Input Matrix A");
for (int i=1; i<=3; i++) {
printf("Input a%d1 a%d2 a%d3: ", i, i, i);
scanf("%d%d%d", &a[i-1][0], &a[i-1][1], &a[i-1][2]);
}
// b matrix
puts("");
puts("Input Matrix B");
for (int i=1; i<=3; i++) {
printf("Input b%d1 b%d2 b%d3: ", i, i, i);
scanf("%d%d%d", &b[i-1][0], &b[i-1][1], &b[i-1][2]);
}
matrix_add(a, b);
puts("");
puts("A Matrix + b + Matrix");
for (int i=0; i<3; i++) {
printf("%d %d %d\n", a[i][0], a[i][1], a[i][2]);
}
return 0;
}
|
the_stack_data/19142.c
|
#include <stdio.h>
#include <string.h>
#define likely(x) __builtin_expect(!!(x), 1)
#define unlikely(x) __builtin_expect(!!(x), 0)
#define BUFSIZE (1024 * 1024)
int main() {
char buf[BUFSIZE] __attribute__((aligned(4096))); // page align
char out[BUFSIZE] __attribute__((aligned(4096)));
memset(buf, 0, BUFSIZE);
if (setvbuf(stdin, out, _IOFBF, 1024 * 1024) != 0) {
fprintf(stderr, "setvbuf failed\n");
return 1;
}
while (1) {
if (unlikely(fread(buf, 1, BUFSIZE, stdin) < BUFSIZE)) {
break;
}
}
return 0;
}
|
the_stack_data/397729.c
|
#include <stdio.h>
int main()
{
int variable = 5;
printf("Valor: %d\n", variable);
printf("Direccion: %u \n", &variable); //Notice, the ampersand(&) before var.
return 0;
}
|
the_stack_data/247017733.c
|
/* This test purpose is simply to check Standard header independancy that
* is to say that the header can be included alone without any previous
* include.
* Additionnaly, for C Standard headers that STLport expose, it can also be
* used to check that files included by those headers are compatible with
* pure C compilers.
*/
#include <time.h>
|
the_stack_data/103265497.c
|
// implement asprintf using vsnprintf
#ifndef HAVE_ASPRINTF
#define HAVE_ASPRINTF
#include <stdio.h> //vsnprintf
#include <stdlib.h> //malloc
#include <stdarg.h> //va_start et al
// the declaration, to put into a .h file. The __attribute__ tells the
// compiler to support it; just remove it if yours doesn't
int asprintf(char **str, char *fmt, ...) __attribute__ ((format (printf, 2, 3)));
int asprintf(char **str, char *fmt, ...) {
va_list argp;
va_start(argp, fmt);
char one_char[1];
int len = vsnprintf(one_char, 1, fmt, argp);
if (len < 1){
fprintf(stderr, "An encoding error occurred. Setting the input pointer to NULL\n");
*str = NULL;
return len;
}
va_end(argp);
*str = malloc(len+1);
if (!str) {
fprintf(stderr, "Couldn't allocate %i bytes.\n", len+1);
return -1;
}
va_start(argp, fmt);
vsnprintf(*str, len+1, fmt, argp);
va_end(argp);
return len;
}
#endif
int main(){
char *s;
asprintf(&s, "hello, %s.", "-Reader~");
printf("%s\n", s);
asprintf(&s, "%c", '\0');
printf("blank string: [%s]\n", s);
int i = 0;
asprintf(&s, "%i", i++);
printf("Zero: %s\n", s);
}
|
the_stack_data/70888.c
|
// Prog 3.3 More Arithmetic Operators
#include <stdio.h>
int main (void)
{
int a = 25;
int b = 2;
float c = 25.0;
float d = 2.0;
printf("6 + a / 5 * b = %i\n", 6 + a / 5 * b);
printf("a / b * b = %i\n", a / b * b );
printf("c / d * d = %f\n", c / d * d );
printf("-a = %i\n", -a);
}
|
the_stack_data/18888881.c
|
#include <stdio.h>
#include <stdlib.h>
void pausar(){
printf("\nPressione alguma tecla para continuar...");
getch();
}
int main(){
float numero1, numero2, numero3, maior, meio, menor, iguais;
printf("Digite o primeiro valor: \n");
scanf("%f", &numero1);
printf("Digite o segundo valor: \n");
scanf("%f", &numero2);
printf("Digite o terceiro valor: \n");
scanf("%f", &numero3);
//Alguns são iguais e outro não.
// // Em cima e Em baixo
if((numero1 == numero2) && (numero3 > numero1)) {
maior = numero3;
meio = numero1;
menor = numero2;
}
if((numero1 == numero2) && (numero2 > numero3)) {
maior = numero1;
meio = numero2;
menor = numero3;
}
if((numero2 == numero3) && (numero1 > numero2)) {
maior = numero1;
meio = numero2;
menor = numero3;
}
if((numero3 == numero2) && (numero2 > numero1)) {
maior = numero3;
meio = numero2;
menor = numero1;
}
// // Meio
if((numero1 == numero3) && (numero3 > numero2)) {
maior = numero1;
meio = numero3;
menor = numero2;
}
if((numero1 == numero3) && (numero2 > numero1)) {
maior = numero2;
meio = numero1;
menor = numero3;
}
//Todos são diferentes
if((numero1 > numero3) && (numero2 > numero1) && (numero2 > numero3)) {
maior = numero2;
meio = numero1;
menor = numero3;
}
if((numero3 > numero2) && (numero1 > numero3) && (numero1 > numero2)) {
maior = numero1;
meio = numero3;
menor = numero2;
}
if((numero3 > numero1) && (numero2 > numero3) && (numero2 > numero1)) {
maior = numero2;
meio = numero3;
menor = numero1;
}
if((numero2 > numero1) && (numero3 > numero2) && (numero3 > numero1)) {
maior = numero3;
meio = numero2;
menor = numero1;
}
printf("\n Maior:....[%.2f] \n Meio:.....[%.2f] \n Menor:....[%.2f] \n", maior, meio, menor);
//Todos são iguais
if((numero1 == numero2) && (numero1 == numero3)) {
maior = numero1;
iguais = maior;
printf("Todos sao iguais ha: [%.2f] \n", iguais);
exit(1);
}
pausar();
return(0);
}
|
the_stack_data/215767939.c
|
/*BEGIN_LEGAL
Intel Open Source License
Copyright (c) 2002-2012 Intel Corporation. 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
the Intel Corporation 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 INTEL OR
ITS 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.
END_LEGAL */
#include <sched.h>
#include <unistd.h>
int main() {
sched_yield();
sleep(1);
return 0;
}
|
the_stack_data/176706838.c
|
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <complex.h>
#ifdef complex
#undef complex
#endif
#ifdef I
#undef I
#endif
#if defined(_WIN64)
typedef long long BLASLONG;
typedef unsigned long long BLASULONG;
#else
typedef long BLASLONG;
typedef unsigned long BLASULONG;
#endif
#ifdef LAPACK_ILP64
typedef BLASLONG blasint;
#if defined(_WIN64)
#define blasabs(x) llabs(x)
#else
#define blasabs(x) labs(x)
#endif
#else
typedef int blasint;
#define blasabs(x) abs(x)
#endif
typedef blasint integer;
typedef unsigned int uinteger;
typedef char *address;
typedef short int shortint;
typedef float real;
typedef double doublereal;
typedef struct { real r, i; } complex;
typedef struct { doublereal r, i; } doublecomplex;
#ifdef _MSC_VER
static inline _Fcomplex Cf(complex *z) {_Fcomplex zz={z->r , z->i}; return zz;}
static inline _Dcomplex Cd(doublecomplex *z) {_Dcomplex zz={z->r , z->i};return zz;}
static inline _Fcomplex * _pCf(complex *z) {return (_Fcomplex*)z;}
static inline _Dcomplex * _pCd(doublecomplex *z) {return (_Dcomplex*)z;}
#else
static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}
static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}
static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}
static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}
#endif
#define pCf(z) (*_pCf(z))
#define pCd(z) (*_pCd(z))
typedef int logical;
typedef short int shortlogical;
typedef char logical1;
typedef char integer1;
#define TRUE_ (1)
#define FALSE_ (0)
/* Extern is for use with -E */
#ifndef Extern
#define Extern extern
#endif
/* I/O stuff */
typedef int flag;
typedef int ftnlen;
typedef int ftnint;
/*external read, write*/
typedef struct
{ flag cierr;
ftnint ciunit;
flag ciend;
char *cifmt;
ftnint cirec;
} cilist;
/*internal read, write*/
typedef struct
{ flag icierr;
char *iciunit;
flag iciend;
char *icifmt;
ftnint icirlen;
ftnint icirnum;
} icilist;
/*open*/
typedef struct
{ flag oerr;
ftnint ounit;
char *ofnm;
ftnlen ofnmlen;
char *osta;
char *oacc;
char *ofm;
ftnint orl;
char *oblnk;
} olist;
/*close*/
typedef struct
{ flag cerr;
ftnint cunit;
char *csta;
} cllist;
/*rewind, backspace, endfile*/
typedef struct
{ flag aerr;
ftnint aunit;
} alist;
/* inquire */
typedef struct
{ flag inerr;
ftnint inunit;
char *infile;
ftnlen infilen;
ftnint *inex; /*parameters in standard's order*/
ftnint *inopen;
ftnint *innum;
ftnint *innamed;
char *inname;
ftnlen innamlen;
char *inacc;
ftnlen inacclen;
char *inseq;
ftnlen inseqlen;
char *indir;
ftnlen indirlen;
char *infmt;
ftnlen infmtlen;
char *inform;
ftnint informlen;
char *inunf;
ftnlen inunflen;
ftnint *inrecl;
ftnint *innrec;
char *inblank;
ftnlen inblanklen;
} inlist;
#define VOID void
union Multitype { /* for multiple entry points */
integer1 g;
shortint h;
integer i;
/* longint j; */
real r;
doublereal d;
complex c;
doublecomplex z;
};
typedef union Multitype Multitype;
struct Vardesc { /* for Namelist */
char *name;
char *addr;
ftnlen *dims;
int type;
};
typedef struct Vardesc Vardesc;
struct Namelist {
char *name;
Vardesc **vars;
int nvars;
};
typedef struct Namelist Namelist;
#define abs(x) ((x) >= 0 ? (x) : -(x))
#define dabs(x) (fabs(x))
#define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
#define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
#define dmin(a,b) (f2cmin(a,b))
#define dmax(a,b) (f2cmax(a,b))
#define bit_test(a,b) ((a) >> (b) & 1)
#define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
#define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
#define abort_() { sig_die("Fortran abort routine called", 1); }
#define c_abs(z) (cabsf(Cf(z)))
#define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
#ifdef _MSC_VER
#define c_div(c, a, b) {Cf(c)._Val[0] = (Cf(a)._Val[0]/Cf(b)._Val[0]); Cf(c)._Val[1]=(Cf(a)._Val[1]/Cf(b)._Val[1]);}
#define z_div(c, a, b) {Cd(c)._Val[0] = (Cd(a)._Val[0]/Cd(b)._Val[0]); Cd(c)._Val[1]=(Cd(a)._Val[1]/df(b)._Val[1]);}
#else
#define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
#define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
#endif
#define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
#define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
#define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
//#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
#define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
#define d_abs(x) (fabs(*(x)))
#define d_acos(x) (acos(*(x)))
#define d_asin(x) (asin(*(x)))
#define d_atan(x) (atan(*(x)))
#define d_atn2(x, y) (atan2(*(x),*(y)))
#define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
#define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
#define d_cos(x) (cos(*(x)))
#define d_cosh(x) (cosh(*(x)))
#define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
#define d_exp(x) (exp(*(x)))
#define d_imag(z) (cimag(Cd(z)))
#define r_imag(z) (cimagf(Cf(z)))
#define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#define d_log(x) (log(*(x)))
#define d_mod(x, y) (fmod(*(x), *(y)))
#define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
#define d_nint(x) u_nint(*(x))
#define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
#define d_sign(a,b) u_sign(*(a),*(b))
#define r_sign(a,b) u_sign(*(a),*(b))
#define d_sin(x) (sin(*(x)))
#define d_sinh(x) (sinh(*(x)))
#define d_sqrt(x) (sqrt(*(x)))
#define d_tan(x) (tan(*(x)))
#define d_tanh(x) (tanh(*(x)))
#define i_abs(x) abs(*(x))
#define i_dnnt(x) ((integer)u_nint(*(x)))
#define i_len(s, n) (n)
#define i_nint(x) ((integer)u_nint(*(x)))
#define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
#define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
#define pow_si(B,E) spow_ui(*(B),*(E))
#define pow_ri(B,E) spow_ui(*(B),*(E))
#define pow_di(B,E) dpow_ui(*(B),*(E))
#define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
#define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
#define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
#define s_cat(lpp, rpp, rnp, np, llp) { ftnlen i, nc, ll; char *f__rp, *lp; ll = (llp); lp = (lpp); for(i=0; i < (int)*(np); ++i) { nc = ll; if((rnp)[i] < nc) nc = (rnp)[i]; ll -= nc; f__rp = (rpp)[i]; while(--nc >= 0) *lp++ = *(f__rp)++; } while(--ll >= 0) *lp++ = ' '; }
#define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
#define s_copy(A,B,C,D) { int __i,__m; for (__i=0, __m=f2cmin((C),(D)); __i<__m && (B)[__i] != 0; ++__i) (A)[__i] = (B)[__i]; }
#define sig_die(s, kill) { exit(1); }
#define s_stop(s, n) {exit(0);}
static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";
#define z_abs(z) (cabs(Cd(z)))
#define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
#define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
#define myexit_() break;
#define mycycle() continue;
#define myceiling(w) {ceil(w)}
#define myhuge(w) {HUGE_VAL}
//#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
#define mymaxloc(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}
/* procedure parameter types for -A and -C++ */
#define F2C_proc_par_types 1
#ifdef __cplusplus
typedef logical (*L_fp)(...);
#else
typedef logical (*L_fp)();
#endif
static float spow_ui(float x, integer n) {
float pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static double dpow_ui(double x, integer n) {
double pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#ifdef _MSC_VER
static _Fcomplex cpow_ui(complex x, integer n) {
complex pow={1.0,0.0}; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;
for(u = n; ; ) {
if(u & 01) pow.r *= x.r, pow.i *= x.i;
if(u >>= 1) x.r *= x.r, x.i *= x.i;
else break;
}
}
_Fcomplex p={pow.r, pow.i};
return p;
}
#else
static _Complex float cpow_ui(_Complex float x, integer n) {
_Complex float pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#endif
#ifdef _MSC_VER
static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
_Dcomplex pow={1.0,0.0}; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
for(u = n; ; ) {
if(u & 01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
else break;
}
}
_Dcomplex p = {pow._Val[0], pow._Val[1]};
return p;
}
#else
static _Complex double zpow_ui(_Complex double x, integer n) {
_Complex double pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#endif
static integer pow_ii(integer x, integer n) {
integer pow; unsigned long int u;
if (n <= 0) {
if (n == 0 || x == 1) pow = 1;
else if (x != -1) pow = x == 0 ? 1/x : 0;
else n = -n;
}
if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
u = n;
for(pow = 1; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static integer dmaxloc_(double *w, integer s, integer e, integer *n)
{
double m; integer i, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
return mi-s+1;
}
static integer smaxloc_(float *w, integer s, integer e, integer *n)
{
float m; integer i, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
return mi-s+1;
}
static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Fcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conjf(Cf(&x[i]))._Val[0] * Cf(&y[i])._Val[0];
zdotc._Val[1] += conjf(Cf(&x[i]))._Val[1] * Cf(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conjf(Cf(&x[i*incx]))._Val[0] * Cf(&y[i*incy])._Val[0];
zdotc._Val[1] += conjf(Cf(&x[i*incx]))._Val[1] * Cf(&y[i*incy])._Val[1];
}
}
pCf(z) = zdotc;
}
#else
_Complex float zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
}
}
pCf(z) = zdotc;
}
#endif
static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Dcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conj(Cd(&x[i]))._Val[0] * Cd(&y[i])._Val[0];
zdotc._Val[1] += conj(Cd(&x[i]))._Val[1] * Cd(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conj(Cd(&x[i*incx]))._Val[0] * Cd(&y[i*incy])._Val[0];
zdotc._Val[1] += conj(Cd(&x[i*incx]))._Val[1] * Cd(&y[i*incy])._Val[1];
}
}
pCd(z) = zdotc;
}
#else
_Complex double zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
}
}
pCd(z) = zdotc;
}
#endif
static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Fcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cf(&x[i])._Val[0] * Cf(&y[i])._Val[0];
zdotc._Val[1] += Cf(&x[i])._Val[1] * Cf(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cf(&x[i*incx])._Val[0] * Cf(&y[i*incy])._Val[0];
zdotc._Val[1] += Cf(&x[i*incx])._Val[1] * Cf(&y[i*incy])._Val[1];
}
}
pCf(z) = zdotc;
}
#else
_Complex float zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cf(&x[i]) * Cf(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
}
}
pCf(z) = zdotc;
}
#endif
static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Dcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cd(&x[i])._Val[0] * Cd(&y[i])._Val[0];
zdotc._Val[1] += Cd(&x[i])._Val[1] * Cd(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cd(&x[i*incx])._Val[0] * Cd(&y[i*incy])._Val[0];
zdotc._Val[1] += Cd(&x[i*incx])._Val[1] * Cd(&y[i*incy])._Val[1];
}
}
pCd(z) = zdotc;
}
#else
_Complex double zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cd(&x[i]) * Cd(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
}
}
pCd(z) = zdotc;
}
#endif
/* -- translated by f2c (version 20000121).
You must link the resulting object file with the libraries:
-lf2c -lm (in that order)
*/
/* Table of constant values */
static integer c__1 = 1;
static integer c_n1 = -1;
/* > \brief \b SORGHR */
/* =========== DOCUMENTATION =========== */
/* Online html documentation available at */
/* http://www.netlib.org/lapack/explore-html/ */
/* > \htmlonly */
/* > Download SORGHR + dependencies */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/sorghr.
f"> */
/* > [TGZ]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/sorghr.
f"> */
/* > [ZIP]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/sorghr.
f"> */
/* > [TXT]</a> */
/* > \endhtmlonly */
/* Definition: */
/* =========== */
/* SUBROUTINE SORGHR( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO ) */
/* INTEGER IHI, ILO, INFO, LDA, LWORK, N */
/* REAL A( LDA, * ), TAU( * ), WORK( * ) */
/* > \par Purpose: */
/* ============= */
/* > */
/* > \verbatim */
/* > */
/* > SORGHR generates a real orthogonal matrix Q which is defined as the */
/* > product of IHI-ILO elementary reflectors of order N, as returned by */
/* > SGEHRD: */
/* > */
/* > Q = H(ilo) H(ilo+1) . . . H(ihi-1). */
/* > \endverbatim */
/* Arguments: */
/* ========== */
/* > \param[in] N */
/* > \verbatim */
/* > N is INTEGER */
/* > The order of the matrix Q. N >= 0. */
/* > \endverbatim */
/* > */
/* > \param[in] ILO */
/* > \verbatim */
/* > ILO is INTEGER */
/* > \endverbatim */
/* > */
/* > \param[in] IHI */
/* > \verbatim */
/* > IHI is INTEGER */
/* > */
/* > ILO and IHI must have the same values as in the previous call */
/* > of SGEHRD. Q is equal to the unit matrix except in the */
/* > submatrix Q(ilo+1:ihi,ilo+1:ihi). */
/* > 1 <= ILO <= IHI <= N, if N > 0; ILO=1 and IHI=0, if N=0. */
/* > \endverbatim */
/* > */
/* > \param[in,out] A */
/* > \verbatim */
/* > A is REAL array, dimension (LDA,N) */
/* > On entry, the vectors which define the elementary reflectors, */
/* > as returned by SGEHRD. */
/* > On exit, the N-by-N orthogonal matrix Q. */
/* > \endverbatim */
/* > */
/* > \param[in] LDA */
/* > \verbatim */
/* > LDA is INTEGER */
/* > The leading dimension of the array A. LDA >= f2cmax(1,N). */
/* > \endverbatim */
/* > */
/* > \param[in] TAU */
/* > \verbatim */
/* > TAU is REAL array, dimension (N-1) */
/* > TAU(i) must contain the scalar factor of the elementary */
/* > reflector H(i), as returned by SGEHRD. */
/* > \endverbatim */
/* > */
/* > \param[out] WORK */
/* > \verbatim */
/* > WORK is REAL array, dimension (MAX(1,LWORK)) */
/* > On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
/* > \endverbatim */
/* > */
/* > \param[in] LWORK */
/* > \verbatim */
/* > LWORK is INTEGER */
/* > The dimension of the array WORK. LWORK >= IHI-ILO. */
/* > For optimum performance LWORK >= (IHI-ILO)*NB, where NB is */
/* > the optimal blocksize. */
/* > */
/* > If LWORK = -1, then a workspace query is assumed; the routine */
/* > only calculates the optimal size of the WORK array, returns */
/* > this value as the first entry of the WORK array, and no error */
/* > message related to LWORK is issued by XERBLA. */
/* > \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 */
/* ===================================================================== */
/* Subroutine */ int sorghr_(integer *n, integer *ilo, integer *ihi, real *a,
integer *lda, real *tau, real *work, integer *lwork, integer *info)
{
/* System generated locals */
integer a_dim1, a_offset, i__1, i__2;
/* Local variables */
integer i__, j, iinfo, nb, nh;
extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
integer *, integer *, ftnlen, ftnlen);
extern /* Subroutine */ int sorgqr_(integer *, integer *, integer *, real
*, integer *, real *, real *, integer *, integer *);
integer lwkopt;
logical lquery;
/* -- 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 arguments */
/* Parameter adjustments */
a_dim1 = *lda;
a_offset = 1 + a_dim1 * 1;
a -= a_offset;
--tau;
--work;
/* Function Body */
*info = 0;
nh = *ihi - *ilo;
lquery = *lwork == -1;
if (*n < 0) {
*info = -1;
} else if (*ilo < 1 || *ilo > f2cmax(1,*n)) {
*info = -2;
} else if (*ihi < f2cmin(*ilo,*n) || *ihi > *n) {
*info = -3;
} else if (*lda < f2cmax(1,*n)) {
*info = -5;
} else if (*lwork < f2cmax(1,nh) && ! lquery) {
*info = -8;
}
if (*info == 0) {
nb = ilaenv_(&c__1, "SORGQR", " ", &nh, &nh, &nh, &c_n1, (ftnlen)6, (
ftnlen)1);
lwkopt = f2cmax(1,nh) * nb;
work[1] = (real) lwkopt;
}
if (*info != 0) {
i__1 = -(*info);
xerbla_("SORGHR", &i__1, (ftnlen)6);
return 0;
} else if (lquery) {
return 0;
}
/* Quick return if possible */
if (*n == 0) {
work[1] = 1.f;
return 0;
}
/* Shift the vectors which define the elementary reflectors one */
/* column to the right, and set the first ilo and the last n-ihi */
/* rows and columns to those of the unit matrix */
i__1 = *ilo + 1;
for (j = *ihi; j >= i__1; --j) {
i__2 = j - 1;
for (i__ = 1; i__ <= i__2; ++i__) {
a[i__ + j * a_dim1] = 0.f;
/* L10: */
}
i__2 = *ihi;
for (i__ = j + 1; i__ <= i__2; ++i__) {
a[i__ + j * a_dim1] = a[i__ + (j - 1) * a_dim1];
/* L20: */
}
i__2 = *n;
for (i__ = *ihi + 1; i__ <= i__2; ++i__) {
a[i__ + j * a_dim1] = 0.f;
/* L30: */
}
/* L40: */
}
i__1 = *ilo;
for (j = 1; j <= i__1; ++j) {
i__2 = *n;
for (i__ = 1; i__ <= i__2; ++i__) {
a[i__ + j * a_dim1] = 0.f;
/* L50: */
}
a[j + j * a_dim1] = 1.f;
/* L60: */
}
i__1 = *n;
for (j = *ihi + 1; j <= i__1; ++j) {
i__2 = *n;
for (i__ = 1; i__ <= i__2; ++i__) {
a[i__ + j * a_dim1] = 0.f;
/* L70: */
}
a[j + j * a_dim1] = 1.f;
/* L80: */
}
if (nh > 0) {
/* Generate Q(ilo+1:ihi,ilo+1:ihi) */
sorgqr_(&nh, &nh, &nh, &a[*ilo + 1 + (*ilo + 1) * a_dim1], lda, &tau[*
ilo], &work[1], lwork, &iinfo);
}
work[1] = (real) lwkopt;
return 0;
/* End of SORGHR */
} /* sorghr_ */
|
the_stack_data/1087199.c
|
#include <stdio.h>
int main(void)
{
unsigned long int fatorial = 1;
int num, i;
// adota-se unsigned long int em razao do crescimento da funcao
printf("Digite um numero inteiro qualquer: ");
scanf("%d", &num);
for (i=1; i<=num; i++)
{
fatorial=fatorial*i;
//para conferir:
printf("i: %d, fatorial: %lu\n",i,fatorial);
}
printf("fatorial de %d vale %lu", num, fatorial);
/*
adota-se a definicao de 0!=1 do ensino medio;
ressalta-se no entando que a integral da funcao gama que define a funcao fatorial so é convergente para num>0.
*/
return 0;
}
|
the_stack_data/28263670.c
|
/*
Input Format
The first line contains a single integer N. The next N lines contain N integers (each) describing the matrix.
Constraints
1≤N≤100
−100≤A[i]≤100
Output Format
Output a single integer equal to the absolute difference in the sums across the diagonals.
Sample Input
3
11 2 4
4 5 6
10 8 -12
Sample Output
15
Explanation
The first diagonal of the matrix is:
11
5
-12
Sum across the first diagonal = 11+5-12= 4
The second diagonal of the matrix is:
4
5
10
Sum across the second diagonal = 4+5+10 = 19
Difference: |4-19| =15
*/
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main() {
int n,i,j;
scanf("%d",&n);
int A[n][n];
int d1=0;
int d2=0;
for(i=0; i<n ; i++){
for(j=0; j<n; j++){
scanf("%d ",&A[i][j]);
}
}
for(i=0; i<n ;i++){
d1 = d1 + A[i][i];
d2 = d2 + A[i][n-1-i];
}
printf("%d\n", abs(d1-d2));
return 0;
}
|
the_stack_data/98575647.c
|
/*Exercise 3 - Repetition
Write a C program to calculate the sum of the numbers from 1 to n.
Where n is a keyboard input.
e.g.
n -> 100
sum = 1+2+3+....+ 99+100 = 5050
n -> 1-
sum = 1+2+3+...+10 = 55 */
#include <stdio.h>
int main() {
int num, i, sum = 0;
printf("n -> ");
scanf("%d", &num);
for(i = 1; i <= num; i++)
{
sum += i;
}
printf("Sum = %d", sum);
return 0;
}
|
the_stack_data/36074030.c
|
#include <stdio.h>
#include <math.h>
static inline double
Ackley (double x, double y)
{
return 20. * (1. - exp (-0.2 * sqrt (0.5 * (x * x + y * y)))) + M_E
- exp (0.5 * (cos (2. * M_PI * x) + cos (2. * M_PI * y)));
}
int
main (int argn __attribute__ ((unused)), char **argc)
{
FILE *file;
double x, y;
file = fopen (argc[1], "r");
if (fscanf (file, "%*s%lf%*s%lf", &x, &y) != 2)
return 1;
fclose (file);
file = fopen (argc[2], "w");
fprintf (file, "%.14le", Ackley (x - M_PI_4, y - M_PI_4));
fclose (file);
return 0;
}
|
the_stack_data/716005.c
|
#include <stdio.h>
/*
* Stampare l'insieme dei divisori non banali
* di un numero x>0. Un divisore non banale è
* un divisore diverso da 1 e x.
* Inoltre, se x è primo, stampare
* "il numero x è primo".
*
* Es. se x=5 stampa
* Il numero 5 è primo
*
* Es. se x=6 stampa
* Il numero 6 è divisibile per 2
* Il numero 6 è divisibile per 3
*
* Per la consegna utilizzare x=63
*
*/
int main(void) {
// inserisco il numero di cui voglio conoscere i divisori
const int x = 84;
// questo valore mi permette di capire se il numero è primo o meno
int primo = 0;
// per ogni numero tra 2 e radice quadrata di di x controllo se è un divisore
// non controllo l'1: divisore banale, non esistono divisori interi di x superiori a x / 2
for (int i = 2; i < x + 1 / 2; i++) {
if ( x % i == 0 ) {
// per definizione se il resto della divisione tra x e un numero i è 0, allora x è divisibile per i
// dunque stampo il numero che si rivela essere un divisore di x
printf("Il numero %d è divisibile per %d\n", x, i);
// quando viene trovato un divisore primo viene incrementato di 1
primo += 1;
}
}
// se primo non è mai stato incrementato, allora x non ha divisori interi
if (primo == 0) printf("il numero %d è primo\n", x);
}
|
the_stack_data/12636625.c
|
/**
******************************************************************************
* @file main.c
* @author Auto-generated by STM32CubeIDE
* @version V1.0
* @brief Default main function.
******************************************************************************
*/
#if !defined(__SOFT_FP__) && defined(__ARM_FP)
#warning "FPU is not initialized, but the project is compiling for an FPU. Please initialize the FPU before use."
#endif
#include <stdint.h>
#define RCC_BASE_ADDR 0x40023800UL
#define RCC_CFGR_REG_OFFSET 0x08UL
#define RCC_CFGR_REG_ADDR (RCC_BASE_ADDR + RCC_CFGR_REG_OFFSET)
#define RCC_CR_REG_OFFSET 0x00UL
#define RCC_CR_REG_ADDR (RCC_BASE_ADDR + RCC_CR_REG_OFFSET)
#define GPIOA_BASE_ADDR 0x40020000UL
int main(void)
{
uint32_t *pRccCrReg = (uint32_t *) RCC_CR_REG_ADDR;
//1) Configure the RCC_CR HSEBYP bitfields to select HSE as bypass.
*pRccCrReg &= ~(1 << 18); //clear HSEBYP
*pRccCrReg |= (1 << 18); //set HSEBYP
*pRccCrReg &= ~(1 << 16); //clear HSEON
*pRccCrReg |= (1 << 16); //set HSEON
while (!(*pRccCrReg & (1 << 17))) ; //wait to clock stabilize
uint32_t *pRccCfgrReg = (uint32_t *) RCC_CFGR_REG_ADDR;
//1) Configure the RCC_CFGR MC01 bitfields to select HSE as clock source.
*pRccCfgrReg |= (0x1 << 0);
*pRccCfgrReg &= ~(0x3 << 21);
*pRccCfgrReg |= (0x1 << 22);
//Configure MCO1 prescaler
*pRccCfgrReg |= (1 << 25);
*pRccCfgrReg |= (1 << 26);
//2) Configure PA8 to Alternate Function AF0 to act as MCO1 signal
// a) Enable the GPIOA peripheral
uint32_t *pRCCAbh1Enr = (uint32_t *) (RCC_BASE_ADDR + 0x30);
*pRCCAbh1Enr |= (1 << 0); //enable GPIOA peripheral clock.
// b) configure the mode of GPIOA pin 8 - PA8 - as alternate function AF0
uint32_t *pGPIOAModeReg = (uint32_t *) (GPIOA_BASE_ADDR + 0x00);
*pGPIOAModeReg &= ~(0x03 << 16); //clear
*pGPIOAModeReg |= (0x02 << 16); //set
// c) configure the alternate function register to set the mode 0 at PA8
uint32_t *pGPIOAAltFuncHighReg = (uint32_t *) (GPIOA_BASE_ADDR + 0x24);
*pGPIOAAltFuncHighReg &= ~( 0x0F << 0);
for(;;);
}
|
the_stack_data/93315.c
|
#include <stdio.h>
#include <stdlib.h>
#define N 32
#define REAL float
#define OFFSET(x, y, z) ((x) + (y) * N + (z) * N * N)
void kernel(float *g1, float *g2) {
int x, y, z;
int halo_width = 2;
for (z = halo_width; z < N-halo_width; ++z) {
for (y = halo_width; y < N-halo_width; ++y) {
for (x = halo_width; x < N-halo_width; ++x) {
float v = g1[OFFSET(x, y, z)] +
g1[OFFSET(x+1, y+1, z+1)] + g1[OFFSET(x-2, y-2, z-2)];
g2[OFFSET(x, y, z)] = v;
}
}
}
return;
}
void dump(float *input) {
int i;
for (i = 0; i < N*N*N; ++i) {
printf("%f\n", input[i]);
}
}
int main(int argc, char *argv[]) {
REAL *g1, *g2;
size_t nelms = N*N*N;
g1 = (REAL *)malloc(sizeof(REAL) * nelms);
g2 = (REAL *)malloc(sizeof(REAL) * nelms);
int i;
for (i = 0; i < (int)nelms; i++) {
g1[i] = i;
g2[i] = i;
}
kernel(g1, g2);
dump(g2);
free(g1);
free(g2);
return 0;
}
|
the_stack_data/1224856.c
|
// RUN: %clang %s -target x86_64-apple-driverkit19.0 \
// RUN: -isysroot %S/Inputs/DriverKit19.0.sdk -### 2>&1 \
// RUN: | FileCheck %s -check-prefix=CHECK-DEFAULT
// RUN: %clang %s -target x86_64-apple-driverkit19.0 -nodriverkitlib \
// RUN: -isysroot %S/Inputs/DriverKit19.0.sdk -### 2>&1 \
// RUN: | FileCheck %s -check-prefix=CHECK-NO-DRIVERKIT
int main() { return 0; }
// CHECK-DEFAULT: "-framework" "DriverKit"
// CHECK-NO-DRIVERKIT-NOT: "-framework" "DriverKit"
|
the_stack_data/73653.c
|
#include <stdio.h>
int main()
{
unsigned int size = 5; // 計算したい要素数
unsigned int x[] = {
0x4b1a3f43,
0x4b1a3f44,
0x4b1a3f45,
0x4b1a3f46,
0x4b1a3f47};
int *xp = x;
unsigned int y[] = {
0x272d3e3c,
0x272d3e4c,
0x272d3e5c,
0x272d3e6c,
0x272d3e7c};
int *yp = y;
unsigned int z[size];
int *zp = z;
/*
計算結果はあってる
1週目
X = 4B1A3F46 4B1A3F45 4B1A3F44 4B1A3F43
Y = 272D3E6C 272D3E5C 272D3E4C 272D3E3C
Z = 72477db2 72477da1 72477d90 72477d7f
2週目
X = 0x4b1a3f47
Y = 0x272d3e7c
Z = 72477dc3
*/
/*
a0 = size;
a1 = x address;
a2 = y address;
a3 = z address
*/
asm volatile("loop:");
asm volatile("vsetvli t0, %0, e32, m1" ::"r"(size)); // 実際に計算される要素数vlがt0に格納される
// 計算したい要素数sizeをデクリメント
asm volatile("sub %0, %1, t0"
: "=r"(size)
: "r"(size));
asm volatile("slli t0, t0, 2"); // ポインタの進める量
asm volatile("vle32.v v1,(%0)" ::"r"(xp));
asm volatile("add %0, %1, t0"
: "=r"(xp)
: "r"(xp)); // xポインタを進める
asm volatile("vle32.v v2,(%0)" ::"r"(yp));
asm volatile("add %0, %1 ,t0"
: "=r"(yp)
: "r"(yp)); // yポインタを進める
// ベクトル演算
asm volatile("vadd.vv v3,v2,v1");
// 結果のstore
asm volatile("vse32.v v3,(%0)" ::"r"(zp));
// 再ロードして検算
asm volatile("vle32.v v4,(%0)" ::"r"(zp));
// zポインタを進める
asm volatile("add %0, %1 ,t0"
: "=r"(zp)
: "r"(zp));
// 計算したい要素数size=0になったら、終了
asm volatile("bnez %0, loop" ::"r"(size));
asm volatile("unimp");
return 0;
}
|
the_stack_data/218892447.c
|
// RUN: rm -rf %t*
// RUN: 3c -base-dir=%S -alltypes -addcr %s -- | FileCheck -match-full-lines -check-prefixes="CHECK_ALL","CHECK" %s
// RUN: 3c -base-dir=%S -addcr %s -- | FileCheck -match-full-lines -check-prefixes="CHECK_NOALL","CHECK" %s
// RUN: 3c -base-dir=%S -addcr %s -- | %clang -c -fcheckedc-extension -x c -o /dev/null -
// RUN: 3c -base-dir=%S -output-dir=%t.checked -alltypes %s --
// RUN: 3c -base-dir=%t.checked -alltypes %t.checked/gvar.c -- | diff %t.checked/gvar.c -
int *x;
//CHECK: _Ptr<int> x = ((void *)0);
extern int *x;
void foo(void) {
//CHECK: void foo(void) _Checked {
*x = 1;
}
extern int *y;
int *y;
//CHECK: int *y;
int *bar(void) {
//CHECK: _Ptr<int> bar(void) {
y = (int *)5;
//CHECK: y = (int *)5;
return x;
}
|
the_stack_data/54115.c
|
/*
* Copyright (c) 2011 Martin Pieuchot <[email protected]>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <err.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#define OFFSET 16384
const char start[] = "start";
const char hello[] = "hello";
const char *
_umem_debug_init(void)
{
return ("default,verbose");
}
const char *
_umem_logging_init(void)
{
return ("fail,contents");
}
int
main(void)
{
FILE *fp;
char *buf = (char *)0xff;
size_t size = 0;
off_t off;
int i, failures = 0;
if ((fp = open_memstream(&buf, &size)) == NULL) {
warn("open_memstream failed");
return (1);
}
off = ftello(fp);
if (off != 0) {
warnx("ftello failed. (1)");
failures++;
}
if (fflush(fp) != 0) {
warnx("fflush failed. (2)");
failures++;
}
if (size != 0) {
warnx("string should be empty. (3)");
failures++;
}
if (buf == (char *)0xff) {
warnx("buf not updated. (4)");
failures++;
}
if (fseek(fp, OFFSET, SEEK_SET) != 0) {
warnx("failed to fseek. (5)");
failures++;
}
if (fprintf(fp, hello) == EOF) {
warnx("fprintf failed. (6)");
failures++;
}
if (fflush(fp) == EOF) {
warnx("fflush failed. (7)");
failures++;
}
if (size != OFFSET + sizeof(hello)-1) {
warnx("failed, size %zu should be %zu. (8)",
size, OFFSET + sizeof(hello)-1);
failures++;
}
if (fseek(fp, 0, SEEK_SET) != 0) {
warnx("failed to fseek. (9)");
failures++;
}
if (fprintf(fp, start) == EOF) {
warnx("fprintf failed. (10)");
failures++;
}
if (fflush(fp) == EOF) {
warnx("fflush failed. (11)");
failures++;
}
if (size != sizeof(start)-1) {
warnx("failed, size %zu should be %zu. (12)",
size, sizeof(start)-1);
failures++;
}
/* Needed for sparse files */
if (strncmp(buf, start, sizeof(start)-1) != 0) {
warnx("failed, buffer didn't start with '%s'. (13)", start);
failures++;
}
for (i = sizeof(start)-1; i < OFFSET; i++)
if (buf[i] != '\0') {
warnx("failed, buffer non zero (offset %d). (14)", i);
failures++;
break;
}
if (memcmp(buf + OFFSET, hello, sizeof(hello)-1) != 0) {
warnx("written string incorrect. (15)");
failures++;
}
/* verify that simply seeking past the end doesn't increase the size */
if (fseek(fp, 100, SEEK_END) != 0) {
warnx("failed to fseek. (16)");
failures++;
}
if (fflush(fp) == EOF) {
warnx("fflush failed. (17)");
failures++;
}
if (size != OFFSET + sizeof(hello)-1) {
warnx("failed, size %zu should be %zu. (18)",
size, OFFSET + sizeof(hello)-1);
failures++;
}
if (fseek(fp, -1, SEEK_END) != 0) {
warnx("failed to fseek. (19)");
failures++;
}
if (fseek(fp, 8, SEEK_SET) != 0) {
warnx("failed to fseek. (20)");
failures++;
}
if (ftell(fp) != 8) {
warnx("failed seek test. (21)");
failures++;
}
/* Try to seek backward */
if (fseek(fp, -1, SEEK_CUR) != 0) {
warnx("failed to fseek. (22)");
failures++;
}
if (ftell(fp) != 7) {
warnx("failed seeking backward. (23)");
failures++;
}
if (fseek(fp, 5, SEEK_CUR) != 0) {
warnx("failed to fseek. (24)");
failures++;
}
if (fclose(fp) == EOF) {
warnx("fclose failed. (25)");
failures++;
}
if (size != 12) {
warnx("failed, size %zu should be %u. (26)",
size, 12);
failures++;
}
free(buf);
return (failures);
}
|
the_stack_data/225143156.c
|
//*****************************************************************************
//
//! @file appl_ams.c
//!
//! @brief Provides functions for the AMS service.
//!
//
//*****************************************************************************
//*****************************************************************************
//
// Copyright (c) 2021, Ambiq Micro, Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// 1. Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the name of the copyright holder nor the names of its
// contributors may be used to endorse or promote products derived from this
// software without specific prior written permission.
//
// Third party software included in this distribution is subject to the
// additional license terms as defined in the /docs/licenses directory.
//
// 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.
//
// This is part of revision b0-release-20210111-1514-g6a1d4008b7 of the AmbiqSuite Development Package.
//
//*****************************************************************************
/**
* \file appl_ams.c
*
*/
/* --------------------------------------------- Header File Inclusion */
#ifdef AMS
#include "appl.h"
#include "BT_common.h"
#include "BT_hci_api.h"
#include "BT_att_api.h"
#include "BT_smp_api.h"
#include "smp_pl.h"
#include "l2cap.h"
#include "fsm_defines.h"
#include "task.h"
/* ----------------------------------------- Configuration Defines */
extern uint32_t am_util_stdio_printf(const char *pcFmt, ...);
#undef APPL_TRC
#undef APPL_ERR
#define APPL_TRC am_util_stdio_printf
#define APPL_ERR am_util_stdio_printf
/* ----------------------------------------- Macro Defines */
/**@brief Entity IDs */
typedef enum
{
AMS_ENTITY_ID_PLAYER, /** The currently active media app. Attributes for this entity include values such as its name, playback state, and playback volume. */
AMS_ENTITY_ID_QUEUE, /** The currently loaded playback queue. Attributes for this entity include values such as its size and its shuffle and repeat modes. */
AMS_ENTITY_ID_TRACK, /** The currently loaded track. Attributes for this entity include values such as its artist, title, and duration. */
} ams_entity_id_values_t;
/**@brief Player AttributeID */
typedef enum
{
AMS_PLAYER_ATTRID_NAME, /** A string containing the localized name of the app */
AMS_PLAYER_ATTRID_PLAYBACKINFO, /** PlaybackState, PlaybackRate, ElapsedTime */
AMS_PLAYER_ATTRID_VOLUME, /** A string that represents the floating point value of the volume, ranging from 0 (silent) to 1 (full volume). */
} ams_player_attribute_id_values_t;
/**@brief Queue AttributeID */
typedef enum
{
AMS_QUEUE_ATTRID_INDEX, /** A string containing the integer value of the queue index, zero-based. */
AMS_QUEUE_ATTRID_COUNT, /** A string containing the integer value of the total number of items in the queue. */
AMS_QUEUE_ATTRID_SHUFFLE, /** A string containing the integer value of the shuffle mode. */
AMS_QUEUE_ATTRID_REPEAT, /** A string containing the integer value value of the repeat mode. */
} ams_queue_attribute_id_values_t;
/**@brief Track AttributeID */
typedef enum
{
AMS_TRACK_ATTRID_ARTIST, /** A string containing the name of the artist. */
AMS_TRACK_ATTRID_ALBUM, /** A string containing the name of the album. */
AMS_TRACK_ATTRID_TITLE, /** A string containing the title of the track. */
AMS_TRACK_ATTRID_DURATION, /** A string containing the floating point value of the total duration of the track in seconds. */
} ams_track_attribute_id_values_t;
typedef enum
{
AMS_DISCONNECTED,
AMS_CONNECTED,
AMS_BONDED,
AMS_DISCOVERED,
} ams_appl_state_t;
/* ----------------------------------------- External Global Variables */
void appl_profile_operations (void);
void appl_bond_with_peer(void);
void appl_discover_AMS(void);
extern BT_DEVICE_ADDR g_bd_addr;
/* ----------------------------------------- Exported Global Variables */
/* ----------------------------------------- Static Global Variables */
DECL_STATIC UCHAR write_response = 0;
DECL_STATIC API_RESULT gResult = 0;
DECL_STATIC ams_appl_state_t appl_ams_state = AMS_DISCONNECTED;
DECL_STATIC ATT_UUID ams_service_uuid128 = {.uuid_128.value = {0xDC, 0xF8, 0x55, 0xAD, 0x02, 0xC5, 0xF4, 0x8E, 0x3A, 0x43, 0x36, 0x0F, 0x2B, 0x50, 0xD3, 0x89}};
DECL_STATIC ATT_UUID AMS_RemoteCommand_UUID = {.uuid_128.value = {0xC2, 0x51, 0xCA, 0xF7, 0x56, 0x0E, 0xDF, 0xB8, 0x8A, 0x4A, 0xB1, 0x57, 0xD8, 0x81, 0x3C, 0x9B}};
DECL_STATIC ATT_UUID AMS_EntityUpdate_UUID = {.uuid_128.value = {0x02, 0xC1, 0x96, 0xBA, 0x92, 0xBB, 0x0C, 0x9A, 0x1F, 0x41, 0x8D, 0x80, 0xCE, 0xAB, 0x7C, 0x2F}};
DECL_STATIC ATT_UUID AMS_EntityAttribute_UUID = {.uuid_128.value = {0xD7, 0xD5, 0xBB, 0x70, 0xA8, 0xA3, 0xAB, 0xA6, 0xD8, 0x46, 0xAB, 0x23, 0x8C, 0xF3, 0xB2, 0xC6}};
/* BLE Connection Handle */
//DECL_STATIC UINT16 appl_ble_connection_handle;
/** AMS Characteristic related information */
typedef struct
{
/* AMS Service */
/* Remote Command */
ATT_ATTR_HANDLE ams_remote_command_hdl;
/* Remote Command - CCC */
ATT_ATTR_HANDLE ams_remote_command_ccc_hdl;
/* Entity Update */
ATT_ATTR_HANDLE ams_entity_update_hdl;
/* Entity Update - CCC */
ATT_ATTR_HANDLE ams_entity_update_ccc_hdl;
/* Entity Attribute */
ATT_ATTR_HANDLE ams_entity_attribute_hdl;
} AMS_CHAR_INFO;
#define APPL_CLI_CNFG_VAL_LENGTH 2
DECL_STATIC AMS_CHAR_INFO ams_char_info;
#ifdef APPL_MENU_OPS
BT_DEVICE_ADDR g_peer_bd_addr;
static UCHAR ams_client_menu[] =
"\n\
\r\n\
1. Bond with peer \r\n\
\r\n\
2. Discover AMS \r\n\
\r\n\
3. Subscribe to Entity Update \r\n\
\r\n\
4. Write to Entity Update \r\n\
\r\n\
5. Write to Remote Command \r\n\
\r\n\
6. Write to Entity Attribute \r\n\
\r\n\
7. Read Entity Attribute \r\n\
\r\n\
Your Option? \0";
#endif /* APPL_MENU_OPS */
/* --------------------------------------------- Constants */
/* --------------------------------------------- Static Global Variables */
/* --------------------------------------------- Functions */
void appl_bond_with_peer(void)
{
API_RESULT retval;
/* If connection is successful, initiate bonding [Step 2(c)] */
SMP_AUTH_INFO auth;
SMP_BD_ADDR smp_peer_bd_addr;
SMP_BD_HANDLE smp_bd_handle;
APPL_TRC("\n<<appl_bond_with_peer>>\n");
auth.param = 1;
auth.bonding = 1;
auth.ekey_size = 12;
auth.security = SMP_SEC_LEVEL_1;
BT_COPY_BD_ADDR(smp_peer_bd_addr.addr, g_bd_addr.addr);
BT_COPY_TYPE(smp_peer_bd_addr.type, g_bd_addr.type);
retval = BT_smp_get_bd_handle
(
&smp_peer_bd_addr,
&smp_bd_handle
);
if (API_SUCCESS == retval)
{
retval = BT_smp_authenticate (&smp_bd_handle, &auth);
}
if (API_SUCCESS != retval)
{
APPL_TRC (
"Initiation of Authentication Failed. Reason 0x%04X\n",
retval);
}
/**
* Application will receive authentication complete event,
* in SMP Callback.
*
* Look for 'SMP_AUTHENTICATION_COMPLETE' event handling in
* 'appl_smp_callback'.
*/
}
void appl_ams_init(void)
{
appl_ams_state = AMS_DISCONNECTED;
APPL_TRC("\n\n<<appl_ams_init>>\n\n");
}
void appl_ams_connect(APPL_HANDLE * appl_handle)
{
APPL_STATE_T state = GET_APPL_STATE(*appl_handle);
if ( state == SL_0_TRANSPORT_OPERATING && appl_ams_state == AMS_DISCONNECTED )
{
appl_ams_state = AMS_CONNECTED;
APPL_TRC("\n\n<<CONNECTED>>\n\n");
}
else if ( state == SL_0_TRANSPORT_OPERATING && appl_ams_state == AMS_DISCOVERED)
{
appl_ams_state = AMS_BONDED;
APPL_TRC("\n\n<<BONDED>>\n\n");
}
else
{
appl_ams_state = AMS_DISCONNECTED;
APPL_TRC("\n\n<<DISCONNECTED>>\n\n");
}
}
void appl_search_complete(void)
{
appl_ams_state = AMS_DISCOVERED;
APPL_TRC("\n\n<<DISCOVERED>>\n\n");
}
void appl_recvice_att_event(UCHAR att_event, API_RESULT event_result)
{
if ( att_event == ATT_WRITE_RSP )
{
write_response = 1;
gResult = 0;
}
else if ( att_event == ATT_ERROR_RSP )
{
gResult = event_result;
}
}
void appl_manage_trasnfer (GATT_DB_HANDLE handle, UINT16 config)
{
APPL_TRC("\n\n<<appl_manage_trasnfer>>\n\n");
}
void appl_send_ams_measurement (APPL_HANDLE * handle)
{
APPL_TRC("\n\n<<appl_send_ams_measurement>>\n\n");
}
void appl_timer_expiry_handler (void *data, UINT16 datalen)
{
APPL_TRC("\n\n<<appl_timer_expiry_handler>>\n\n");
}
void appl_ams_server_reinitialize (void)
{
appl_ams_state = AMS_DISCONNECTED;
APPL_TRC("\n\n<<appl_ams_server_reinitialize>>\n\n");
}
void ams_mtu_update(APPL_HANDLE * appl_handle, UINT16 t_mtu)
{
UINT16 mtu = 0;
BT_att_access_mtu(&APPL_GET_ATT_INSTANCE(*appl_handle),
&mtu);
APPL_TRC("appl_handle 0x%x t_mtu = %d %d\n", *appl_handle, t_mtu, mtu);
}
/* ------------------------------- ATT related Functions */
void appl_rcv_service_desc (UINT16 config, ATT_UUID uuid, UINT16 value_handle)
{
/* Populate Needed CCCDs here */
if (GATT_CLIENT_CONFIG == config)
{
if ( memcmp(&uuid, &AMS_RemoteCommand_UUID, ATT_128_BIT_UUID_SIZE) == 0 )
{
ams_char_info.ams_remote_command_ccc_hdl = value_handle;
}
else if ( memcmp(&uuid, &AMS_EntityUpdate_UUID, ATT_128_BIT_UUID_SIZE) == 0 )
{
ams_char_info.ams_entity_update_ccc_hdl = value_handle;
}
}
}
void appl_rcv_service_char (ATT_UUID uuid, UINT16 value_handle)
{
if ( memcmp(&uuid, &AMS_RemoteCommand_UUID, ATT_128_BIT_UUID_SIZE) == 0 )
{
ams_char_info.ams_remote_command_hdl = value_handle;
}
else if ( memcmp(&uuid, &AMS_EntityUpdate_UUID, ATT_128_BIT_UUID_SIZE) == 0 )
{
ams_char_info.ams_entity_update_hdl = value_handle;
}
else if ( memcmp(&uuid, &AMS_EntityAttribute_UUID, ATT_128_BIT_UUID_SIZE) == 0 )
{
ams_char_info.ams_entity_attribute_hdl = value_handle;
}
}
void Wait4WrtRsp(void)
{
const TickType_t xDelay = 10 / portTICK_PERIOD_MS;
UCHAR i = 0;
while ( !write_response )
{
vTaskDelay( xDelay );
if (i++ > 10 )
{
break;
}
}
write_response = 0;
}
void appl_discover_AMS(void)
{
APPL_TRC("\n<<appl discover AMS>>\n");
appl_discover_service
(
ams_service_uuid128,
ATT_128_BIT_UUID_FORMAT
);
return;
}
void AmsWrite2EnityUpdate(uint8_t entityID)
{
ATT_VALUE att_value;
uint8_t buf[5];
APPL_TRC("\n++<<AmsWrite2EnityUpdate %d>>\n", entityID);
if ( entityID == AMS_ENTITY_ID_PLAYER )
{
buf[0] = AMS_ENTITY_ID_PLAYER;
buf[1] = AMS_PLAYER_ATTRID_NAME;
buf[2] = AMS_PLAYER_ATTRID_PLAYBACKINFO;
buf[3] = AMS_PLAYER_ATTRID_VOLUME;
att_value.len = 4;
}
else if ( entityID == AMS_ENTITY_ID_QUEUE )
{
buf[0] = AMS_ENTITY_ID_QUEUE;
buf[1] = AMS_QUEUE_ATTRID_INDEX;
buf[2] = AMS_QUEUE_ATTRID_COUNT;
buf[3] = AMS_QUEUE_ATTRID_SHUFFLE;
buf[4] = AMS_QUEUE_ATTRID_REPEAT;
att_value.len = 5;
}
else if ( entityID == AMS_ENTITY_ID_TRACK )
{
buf[0] = AMS_ENTITY_ID_TRACK;
buf[1] = AMS_TRACK_ATTRID_ARTIST;
buf[2] = AMS_TRACK_ATTRID_ALBUM;
buf[3] = AMS_TRACK_ATTRID_TITLE;
buf[4] = AMS_TRACK_ATTRID_DURATION;
att_value.len = 5;
}
else
{
return;
}
att_value.val = buf;
appl_write_req (ams_char_info.ams_entity_update_hdl, &att_value);
Wait4WrtRsp();
APPL_TRC("\n--<<AmsWrite2EnityUpdate %d>>\n", entityID);
}
void AmsWrite2RemoteCommand(uint8_t cmd)
{
ATT_VALUE att_value;
uint8_t buf[1]; // retrieve the complete attribute list
buf[0] = cmd;
att_value.len = 1;
att_value.val = buf;
appl_write_req (ams_char_info.ams_remote_command_hdl, &att_value);
}
void AmsWrite2EntityAttribute(uint8_t entityID, uint8_t attrID)
{
ATT_VALUE att_value;
uint8_t buf[2]; // retrieve the complete attribute list
buf[0] = entityID;
buf[1] = attrID;
att_value.len = 2;
att_value.val = buf;
appl_write_req (ams_char_info.ams_entity_attribute_hdl, &att_value);
}
void AmsSubscribe2EnityUpdate(void)
{
ATT_VALUE att_value;
UINT16 cli_cfg;
UCHAR cfg_val[APPL_CLI_CNFG_VAL_LENGTH];
APPL_TRC("\n++<<AmsSubscribe2EnityUpdate>>\n");
cli_cfg = GATT_CLI_CNFG_NOTIFICATION;
BT_PACK_LE_2_BYTE(cfg_val, &cli_cfg);
att_value.len = APPL_CLI_CNFG_VAL_LENGTH;
att_value.val = cfg_val;
appl_write_req (ams_char_info.ams_entity_update_ccc_hdl, &att_value);
Wait4WrtRsp();
APPL_TRC("\n--<<AmsSubscribe2EnityUpdate(0x%04X)>>\n", gResult);
}
void appl_profile_operations (void)
{
const TickType_t xDelay = 100 / portTICK_PERIOD_MS;
write_response = 0;
fsm_post_event
(
APPL_FSM_ID,
ev_appl_device_init_req,
NULL
);
while ( appl_ams_state != AMS_CONNECTED )
{
vTaskDelay( xDelay );
}
appl_discover_AMS();
while ( appl_ams_state != AMS_DISCOVERED )
{
vTaskDelay( xDelay );
}
AmsSubscribe2EnityUpdate();
if (gResult == 0x0305 /* insufficient authentication */ ||
gResult == 0x030F /* insufficient Encryption */ )
{
appl_bond_with_peer();
while ( appl_ams_state != AMS_BONDED )
{
vTaskDelay( xDelay );
}
AmsSubscribe2EnityUpdate();
}
else
{
appl_ams_state = AMS_BONDED;
}
AmsWrite2EnityUpdate(AMS_ENTITY_ID_PLAYER);
AmsWrite2EnityUpdate(AMS_ENTITY_ID_QUEUE);
AmsWrite2EnityUpdate(AMS_ENTITY_ID_TRACK);
while ( appl_ams_state != AMS_DISCONNECTED )
{
vTaskDelay( xDelay );
}
}
void AmsDumpBytes (UCHAR *buffer, UINT16 length)
{
char hex_stream[49];
char char_stream[17];
UINT32 i;
UINT16 offset, count;
UCHAR c;
APPL_TRC("\n");
APPL_TRC (
"-------------------------------------------------------------------\n");
count = 0;
offset = 0;
for (i = 0; i < length; i ++ )
{
c = buffer[i];
sprintf(hex_stream + offset, "%02X ", c);
if ( (c >= 0x20) && (c <= 0x7E) )
{
char_stream[count] = c;
}
else
{
char_stream[count] = '.';
}
count ++;
offset += 3;
if ( 16 == count )
{
char_stream[count] = '\0';
count = 0;
offset = 0;
APPL_TRC ("%s %s\n",
hex_stream, char_stream);
BT_mem_set(hex_stream, 0, 49);
BT_mem_set(char_stream, 0, 17);
}
}
if ( offset != 0 )
{
char_stream[count] = '\0';
/* Maintain the alignment */
APPL_TRC ("%-48s %s\n",
hex_stream, char_stream);
}
APPL_TRC (
"-------------------------------------------------------------------\n");
APPL_TRC ("\n");
return;
}
void AmsNotificationCb(UCHAR *event_data, UINT16 event_datalen)
{
AmsDumpBytes(event_data + 2, (event_datalen - 2));
}
void AmsReadRSPCb(UCHAR *event_data, UINT16 event_datalen)
{
ATT_ATTR_HANDLE attr_handle;
BT_UNPACK_LE_2_BYTE(&attr_handle, event_data);
AmsDumpBytes(event_data + 2, (event_datalen - 2));
}
#endif /* AMS */
|
the_stack_data/104828750.c
|
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main (void) {
int n = 0;
char *p;
while (1) {
if ((p = malloc(1<<26)) == NULL) {
printf("malloc failure after %d MB\n", n);
return 0;
}
memset (p, 0, (1<<26));
n += 64;
printf ("got %d MB\n", n);
}
}
|
the_stack_data/142660.c
|
#define SM_CXSCREEN 0
#define SM_CYSCREEN 1
#define SM_CXVSCROLL 2
#define SM_CYHSCROLL 3
#define SM_CYCAPTION 4
#define SM_CXBORDER 5
#define SM_CYBORDER 6
#define SM_CXDLGFRAME 7
#define SM_CYDLGFRAME 8
#define SM_CYVTHUMB 9
#define SM_CXHTHUMB 10
#define SM_CXICON 11
#define SM_CYICON 12
#define SM_CXCURSOR 13
#define SM_CYCURSOR 14
#define SM_CYMENU 15
#define SM_CXFULLSCREEN 16
#define SM_CYFULLSCREEN 17
#define SM_CYKANJIWINDOW 18
#define SM_MOUSEPRESENT 19
#define SM_CYVSCROLL 20
#define SM_CXHSCROLL 21
#define SM_DEBUG 22
#define SM_SWAPBUTTON 23
#define SM_RESERVED1 24
#define SM_RESERVED2 25
#define SM_RESERVED3 26
#define SM_RESERVED4 27
#define SM_CXMIN 28
#define SM_CYMIN 29
#define SM_CXSIZE 30
#define SM_CYSIZE 31
#define SM_CXFRAME 32
#define SM_CYFRAME 33
#define SM_CXMINTRACK 34
#define SM_CYMINTRACK 35
#define SM_CXDOUBLECLK 36
#define SM_CYDOUBLECLK 37
#define SM_CXICONSPACING 38
#define SM_CYICONSPACING 39
#define SM_MENUDROPALIGNMENT 40
#define SM_PENWINDOWS 41
#define SM_DBCSENABLED 42
#define SM_CMOUSEBUTTONS 43
#define SM_CXFIXEDFRAME SM_CXDLGFRAME
#define SM_CYFIXEDFRAME SM_CYDLGFRAME
#define SM_CXSIZEFRAME SM_CXFRAME
#define SM_CYSIZEFRAME SM_CYFRAME
#define SM_SECURE 44
#define SM_CXEDGE 45
#define SM_CYEDGE 46
#define SM_CXMINSPACING 47
#define SM_CYMINSPACING 48
#define SM_CXSMICON 49
#define SM_CYSMICON 50
#define SM_CYSMCAPTION 51
#define SM_CXSMSIZE 52
#define SM_CYSMSIZE 53
#define SM_CXMENUSIZE 54
#define SM_CYMENUSIZE 55
#define SM_ARRANGE 56
#define SM_CXMINIMIZED 57
#define SM_CYMINIMIZED 58
#define SM_CXMAXTRACK 59
#define SM_CYMAXTRACK 60
#define SM_CXMAXIMIZED 61
#define SM_CYMAXIMIZED 62
#define SM_NETWORK 63
#define SM_CLEANBOOT 67
#define SM_CXDRAG 68
#define SM_CYDRAG 69
#define SM_SHOWSOUNDS 70
#define SM_CXMENUCHECK 71
#define SM_CYMENUCHECK 72
#define SM_SLOWMACHINE 73
#define SM_MIDEASTENABLED 74
#define SM_MOUSEWHEELPRESENT 75
#define SM_XVIRTUALSCREEN 76
#define SM_YVIRTUALSCREEN 77
#define SM_CXVIRTUALSCREEN 78
#define SM_CYVIRTUALSCREEN 79
#define SM_CMONITORS 80
#define SM_SAMEDISPLAYFORMAT 81
#define SM_IMMENABLED 82
#define SM_CXFOCUSBORDER 83
#define SM_CYFOCUSBORDER 84
#define SM_TABLETPC 86
#define SM_MEDIACENTER 87
#define SM_STARTER 88
#define SM_SERVERR2 89
#define SM_DIGITIZER 94
#define SM_MAXIMUMTOUCHES 95
#define SM_CMETRICS 97
#define SM_REMOTESESSION 0x1000
#define SM_SHUTTINGDOWN 0x2000
#define SM_REMOTECONTROL 0x2001
#define SM_CARETBLINKINGENABLED 0x2002
#define SM_CONVERTIBLESLATEMODE 0x2003
#define SM_SYSTEMDOCKED 0x2004
#define PMB_ACTIVE 0x00000001
#define MNC_IGNORE 0
#define MNC_CLOSE 1
#define MNC_EXECUTE 2
#define MNC_SELECT 3
#define MNS_NOCHECK 0x80000000
#define MNS_MODELESS 0x40000000
#define MNS_DRAGDROP 0x20000000
#define MNS_AUTODISMISS 0x10000000
#define MNS_NOTIFYBYPOS 0x08000000
#define MNS_CHECKORBMP 0x04000000
#define MIM_MAXHEIGHT 0x00000001
#define MIM_BACKGROUND 0x00000002
#define MIM_HELPID 0x00000004
#define MIM_MENUDATA 0x00000008
#define MIM_STYLE 0x00000010
#define MIM_APPLYTOSUBMENUS 0x80000000
#define MND_CONTINUE 0
#define MND_ENDMENU 1
#define MNGOF_TOPGAP 0x00000001
#define MNGOF_BOTTOMGAP 0x00000002
#define MNGO_NOINTERFACE 0x00000000
#define MNGO_NOERROR 0x00000001
#define MIIM_STATE 0x00000001
#define MIIM_ID 0x00000002
#define MIIM_SUBMENU 0x00000004
#define MIIM_CHECKMARKS 0x00000008
#define MIIM_TYPE 0x00000010
#define MIIM_DATA 0x00000020
#define MIIM_STRING 0x00000040
#define MIIM_BITMAP 0x00000080
#define MIIM_FTYPE 0x00000100
|
the_stack_data/50138431.c
|
#include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
typedef struct {
char a;
char b;
} struct1;
typedef struct {
int a;
short b;
int c;
double d;
} struct2;
void vaarg(char unused, ...) {
va_list vl;
va_start(vl, unused);
printf("1 : %d\n", va_arg(vl, short));
printf("2 : %c\n", va_arg(vl, int));
printf("3 : %f\n", va_arg(vl, double));
printf("4 : %d\n", va_arg(vl, char));
printf("5 : %d\n", va_arg(vl, struct1).a);
printf("6 : %d\n", va_arg(vl, struct2).b);
printf("7 : %d\n", *va_arg(vl, short*));
va_end(vl);
}
int main(int argc, char* argv[]) {
struct1 st1;
st1.a = 1;
st1.b = 2;
struct2 st2;
st2.a = 10;
st2.b = 20;
vaarg(0, 1, 'b', (float)3.1, 4, st1, st2, &st2.b);
return 0;
}
|
the_stack_data/11074254.c
|
#include <err.h> /* err */
#include <stdio.h> /* fopen, fgetln, fputs, fwrite */
/*
* Read a file line by line.
* http://rosettacode.org/wiki/Read_a_file_line_by_line
*/
int
main()
{
FILE *f;
size_t len;
char *line;
f = fopen("foobar.txt", "r");
if (f == NULL)
err(1, "foobar.txt");
/*
* This loop reads each line.
* Remember that line is not a C string.
* There is no terminating '\0'.
*/
while (line = fgetln(f, &len)) {
/*
* Do something with line.
*/
fputs("LINE: ", stdout);
fwrite(line, len, 1, stdout);
}
if (!feof(f))
err(1, "fgetln");
return 0;
}
|
the_stack_data/37637942.c
|
int main()
{
int a = 5;
int b = 2;
int c = 6;
a /= b-c;
return a;
}
|
the_stack_data/22993.c
|
extern int n;
void main() {
int x,y;
assume(x==n&&y==n&&n>=0);
while(x!=0){
x--;
y--;
}
assert(y==0);
}
|
the_stack_data/7951176.c
|
/* This checks various ways of dead code inside if statements
where there are non-obvious ways of how the code is actually
not dead due to reachable by labels. */
extern int printf (const char *, ...);
static void kb_wait_1(void)
{
unsigned long timeout = 2;
do {
/* Here the else arm is a statement expression that's supposed
to be suppressed. The label inside the while would unsuppress
code generation again if not handled correctly. And that
would wreak havoc to the cond-expression because there's no
jump-around emitted, the whole statement expression really
needs to not generate code (perhaps except useless forward jumps). */
(1 ?
printf("timeout=%ld\n", timeout) :
({
int i = 1;
while (1)
while (i--)
some_label:
printf("error\n");
goto some_label;
})
);
timeout--;
} while (timeout);
}
static int global;
static void foo(int i)
{
global+=i;
printf ("g=%d\n", global);
}
static int check(void)
{
printf ("check %d\n", global);
return 1;
}
static void dowhile(void)
{
do {
foo(1);
if (global == 1) {
continue;
} else if (global == 2) {
continue;
}
/* The following break shouldn't disable the check() call,
as it's reachable by the continues above. */
break;
} while (check());
}
int main (void)
{
int i = 1;
kb_wait_1();
/* Simple test of dead code at first sight which isn't actually dead. */
if (0) {
yeah:
printf ("yeah\n");
} else {
printf ("boo\n");
}
if (i--)
goto yeah;
/* Some more non-obvious uses where the problems are loops, so that even
the first loop statements aren't actually dead. */
i = 1;
if (0) {
while (i--) {
printf ("once\n");
enterloop:
printf ("twice\n");
}
}
if (i >= 0)
goto enterloop;
/* The same with statement expressions. One might be tempted to
handle them specially by counting if inside statement exprs and
not unsuppressing code at loops at all then.
See kb_wait_1 for the other side of the medal where that wouldn't work. */
i = ({
int j = 1;
if (0) {
while (j--) {
printf ("SEonce\n");
enterexprloop:
printf ("SEtwice\n");
}
}
if (j >= 0)
goto enterexprloop;
j; });
/* The other two loop forms: */
i = 1;
if (0) {
for (i = 1; i--;) {
printf ("once2\n");
enterloop2:
printf ("twice2\n");
}
}
if (i > 0)
goto enterloop2;
i = 1;
if (0) {
do {
printf ("once3\n");
enterloop3:
printf ("twice3\n");
} while (i--);
}
if (i > 0)
goto enterloop3;
/* And check that case and default labels have the same effect
of disabling code suppression. */
i = 41;
switch (i) {
if (0) {
printf ("error\n");
case 42:
printf ("error2\n");
case 41:
printf ("caseok\n");
}
}
i = 41;
switch (i) {
if (0) {
printf ("error3\n");
default:
printf ("caseok2\n");
break;
case 42:
printf ("error4\n");
}
}
dowhile();
return 0;
}
|
the_stack_data/151704644.c
|
/* type1.c -- translate human readable text to a type 1 font */
#include <stdio.h>
#include <ctype.h>
#include <string.h>
#include <stdarg.h>
#include <stdlib.h>
#ifdef _MSC_VER /* defined by Microsoft Compiler */
#include <fcntl.h>
#include <io.h>
#endif
#define streq(s, t) (strcmp(s, t) == 0)
#define length_of(array) ((sizeof (array)) / (sizeof *(array)))
typedef unsigned char Card8;
typedef unsigned long Card32;
static const char *panicname = "detype1";
static void panic(const char *fmt, ...) {
va_list args;
fprintf(stderr, "%s: ", panicname);
va_start(args, fmt);
vfprintf(stderr, fmt, args);
va_end(args);
fprintf(stderr, "\n");
exit(1);
}
int inmode = 0;
int col = 0;
static unsigned char *mainbuffer = NULL;
static int inmain = 0;
static int mainlen = 0;
/*
* encryption code -- this is used for both eexec and charstrings
*/
#define C1 ((unsigned short) 52845)
#define C2 ((unsigned short) 22719)
#define key_eexec ((unsigned short) 55665)
#define key_charstring ((unsigned short) 4330)
unsigned short key = key_eexec;
static void put1(int c){
if(inmain >= mainlen){
if(mainlen == 0){
mainlen = BUFSIZ;
mainbuffer = malloc(mainlen);
} else {
mainlen *= 4;
mainbuffer = realloc(mainbuffer, mainlen);
}
if (mainbuffer == NULL)
panic("out of memory");
}
mainbuffer[inmain++] = c;
}
static void flushtext(FILE *fp){
int i;
unsigned int j;
if(mainbuffer[inmain-2] == '\r')
inmain--;
mainbuffer[inmain-1] = ' ';
j = inmain;
if(inmode == 1){
putc(0x80, fp);
putc(0x01, fp);
putc(j, fp);
j >>= 8;
putc(j, fp);
j >>= 8;
putc(j, fp);
j >>= 8;
putc(j, fp);
}
for(i=0; i < inmain; i++)
putc(mainbuffer[i], fp);
inmain = 0;
}
static void flusheexec(FILE *fp){
int i;
unsigned int j;
j = inmain;
if(inmode == 1){
putc(0x80, fp);
putc(0x02, fp);
putc(j, fp);
j >>= 8;
putc(j, fp);
j >>= 8;
putc(j, fp);
j >>= 8;
putc(j, fp);
}
for(i=0; i < inmain; i++)
putc(mainbuffer[i], fp);
inmain = 0;
}
static void flushfinish(FILE *fp){
if(inmode == 1){
putc(0x80, fp);
putc(0x03, fp);
}
}
static Card8 Encrypt(Card8 plain, unsigned short *keyp) {
unsigned short key = *keyp;
Card8 cipher = plain ^ (key >> 8);
*keyp = (cipher + key) * C1 + C2;
return cipher;
}
static int get1(FILE *fp){
int c;
if(inmode == 0){
c = getc(fp);
if(c == '~'){
inmode = 1;
return getc(fp);
} else {
inmode = 2;
return c;
}
}
return getc(fp);
}
/*
* eeputchar -- write a character in hex encoded format, suitable for eexec
*/
static void eeputchar(int c) {
c = (int)Encrypt((unsigned char)c, &key);
if(inmode == 1){
put1(c);
} else {
char text[3];
sprintf(text,"%02x", c);
put1(text[0]);
put1(text[1]);
if (++col == 32) {
put1('\n');
col = 0;
}
}
}
/*
* charstring -- decode charstrings
*/
static char *charstring(Card8 *csbuf, const char *s, int *lenp) {
int i;
char token[100], *t;
Card8 *cs = csbuf;
static const char
* const cmd[] = {
"reserved_0", "hstem", "compose", "vstem", "vmoveto", "rlineto",
"hlineto", "vlineto", "rrcurveto", "closepath",
"callsubr", "return", NULL, "hsbw", "endchar",
"reserved_1", "blend", "callgrel", "hstemhm", "hintmask", "cntrmask",
"rmoveto", "hmoveto", "vstemhm", "rcurveline", "rlinecurve", "vvcurveto", "hhcurveto",
"extendednumber", "callgsubr", "vhcurveto", "hvcurveto",
},
* const esc[] = {
"dotsection", "vstem3", "hstem3", "and", "or", "not",
"seac", "sbw", "store", "abs", "add", "sub", "div",
"load", "neg", "eq", "callother", "pop", "drop",
"setwv", "put", "get", "ifelse", "random", "mul", "div2",
"sqrt", "dup", "exch", "index", "roll", "rotate", "attach",
"setcurrentpoint", "hflex", "flex", "hflex1", "flex1", "cntron",
"blend1", "blend2", "blend3", "blend4", "blend6", "setwv1", "setwv2",
"setwv3", "setwv4", "setwv5", "setwvN", "transform"
};
nexttoken:
while (isspace(*s))
s++;
for (t = token; !isspace(*s); s++)
*t++ = *s;
*t = '\0';
if (streq(token, "}")) {
*lenp = (int)(cs - csbuf);
while (isspace(s[-1]))
--s;
return (char *) s;
}
for (i = 0; i < length_of(cmd); i++)
if (cmd[i] != NULL && streq(cmd[i], token)) {
*cs++ = i;
goto nexttoken;
}
for (i = 0; i < length_of(esc); i++)
if (esc[i] != NULL && streq(esc[i], token)) {
*cs++ = 12;
*cs++ = i;
goto nexttoken;
}
for (t = token; isdigit(*t) || (t == token && *t == '-'); t++)
;
if (*t == '\0') {
long n = strtol(token, NULL, 0);
if (-107 <= n && n <= 107)
*cs++ = (Card8)(n + 139);
else if (108 <= n && n <= 1131) {
n -= 108;
*cs++ = (Card8)((n >> 8) + 247);
*cs++ = (unsigned char)n;
} else if (-1131 <= n && n <= -108) {
n = -n - 108;
*cs++ = (Card8)((n >> 8) + 251);
*cs++ = (unsigned char)n;
} else {
*cs++ = 255;
*cs++ = (unsigned char)((Card32) n >> 24);
*cs++ = (unsigned char)((Card32) n >> 16);
*cs++ = (unsigned char)((Card32) n >> 8);
*cs++ = (unsigned char)n;
}
goto nexttoken;
}
panic("bad token in charstring: %s", token);
return NULL;
}
/*
* getlenIV -- find the lenIV value from the to be encrypted text
*/
static int getlenIV(const char *s, const char *end) {
static const char key[] = "/lenIV";
const char *k = key;
for (; s < end; s++)
if (*s != *k)
k = key;
else if (*++k == '\0')
return atoi(++s);
return 4;
}
/*
* eeappend, snarfeexec, writeeexec -- create the eexec encrypted portions of the file
*/
static char *eebuf = 0;
static int eecount = 0, eelen = 0;
static void eeappend(int c) {
if (eecount >= eelen) {
if (eelen == 0) {
eelen = BUFSIZ;
eebuf = malloc(eelen);
} else {
eelen *= 4;
eebuf = realloc(eebuf, eelen);
}
if (eebuf == NULL)
panic("out of memory");
}
eebuf[eecount++] = c;
}
static void writeeexec(void) {
char *s, *end;
int lenIV;
s = eebuf;
end = &s[eecount];
lenIV = getlenIV(s, end);
while (s < end)
if (s[0] != '#' || s[1] != '#')
eeputchar(*s++);
else {
int i, len;
unsigned short key = key_charstring;
char *t, RD[20], prefix[40];
Card8 csbuf[65536];
s += 2;
while (isspace(*s))
s++;
for (t = RD; !isspace(*s); s++)
*t++ = *s;
*t = '\0';
while (isspace(*s))
s++;
if (*s++ != '{')
panic("expected ``{'' after ``## %s''", RD);
while (isspace(*s))
s++;
s = charstring(csbuf, s, &len);
if (s >= end)
panic("charstring extended past end of encrypted region");
if (len > sizeof csbuf)
panic("charstring too long");
if(lenIV >= 0){
sprintf(prefix, "%d %s ", len + lenIV, RD);
for (t = prefix; *t != '\0'; t++)
eeputchar(*t);
for (i = 0; i < lenIV; i++)
eeputchar(Encrypt('x', &key));
for (i = 0; i < len; i++)
eeputchar(Encrypt(csbuf[i], &key));
} else {
sprintf(prefix, "%d %s ", len , RD);
for (t = prefix; *t != '\0'; t++)
eeputchar(*t);
for (i = 0; i < len; i++)
eeputchar(csbuf[i]);
}
}
}
static void snarfeexec(FILE *fp) {
int c;
static const char closefile[] = "%currentfile closefile";
const char *cp = closefile, *s;
eecount = 0;
eelen = 0;
while ((c = get1(fp)) != EOF)
if (c != *cp) {
for (s = closefile; s < cp; s++)
eeappend(*s);
eeappend(c);
cp = closefile;
} else if (*++cp == '\0') {
for (s = closefile + 1; *s != '\0'; s++)
eeappend(*s);
cp = closefile;
return;
}
panic("EOF in ciphertext region");
}
static void ciphertext(FILE *fp1) {
snarfeexec(fp1);
eeputchar('y');
eeputchar('o');
eeputchar('g');
eeputchar('i');
writeeexec();
eeputchar('\n');
}
static void cleartext(FILE *fp1, FILE *fp2) {
int c;
const char eexec[] = "%currentfile eexec";
const char *ee = eexec;
while ((c = get1(fp1)) != EOF)
if (c != *ee) {
const char *s;
for (s = eexec; s < ee; s++)
put1(*s);
put1(c);
ee = eexec;
} else if (*++ee == '\0') {
for(c=1;eexec[c] != 0;c++)put1(eexec[c]);
while ((c = get1(fp1)) != EOF && isspace(c))
put1(c);
if (c == EOF)
break;
ungetc(c, fp1);
return;
}
flushtext(fp2);
flushfinish(fp2);
exit(0);
}
static void epilogue(FILE *fp1) {
int i, c, j;
const char zeros[] =
"0000000000000000000000000000000000000000000000000000000000000000\n";
while ((c = get1(fp1)) == '0' || c == '\n' || c == '\r')
;
if (c == EOF)
panic("EOF before cleartomark");
put1('\n');
for (i = 0; i < 8; i++)
for(j=0;zeros[j] != 0;j++)put1(zeros[j]);
put1(c);
}
static void type1(FILE *fp1, FILE *fp2) {
for(;;){
key = key_eexec;
col = 0;
cleartext(fp1, fp2);
flushtext(fp2);
ciphertext(fp1);
flusheexec(fp2);
epilogue(fp1);
eecount = 0;
}
}
/*
* main, usage -- command line parsing
*/
static void usage(void) {
fprintf(stderr, "usage: type1 [text [font]]\n");
exit(1);
}
#ifndef _MSC_VER /* unix */
extern int getopt(int argc, char **argv, char *optstring);
extern int optind;
extern char *optarg;
#else /* dos */
static char *optarg;
static int optind=1;
static int opterr=0;
int getopt (int argc, char **argv, char *opstring) {
char *s;
/* have all our command line arguments ? */
if (optind >= argc)
return EOF;
/* Is this a valid options (starts with '-') */
if (argv[optind][0] != '-')
return EOF;
/* '--' means end of options */
if (argv[optind][1] == '-') {
optind++;
return EOF;
}
/* is this option in our list of valid options ? */
s = strchr(opstring, (int) (argv[optind][1]));
/* if no match return question mark */
if (s == NULL) {
fprintf(stderr,"Unknown Option encountered: %s\n", argv[optind]);
return '?';
}
/* Does this option have an argument */
if (s[1] == ':') {
optind++;
if (optind < argc)
optarg = argv[optind];
else {
fprintf(stderr, "No argument present for %s\n", argv[optind]);
return '?';
}
} else
optarg = NULL;
optind++;
return (int) *s;
}
#endif /* getopt(3) definition for dos */
int main(int argc, char *argv[]) {
int c;
while ((c = getopt(argc, argv, "?")) != EOF)
switch (c) {
default: usage();
}
if (optind == argc){
#if _MSC_VER
_setmode(_fileno(stdin),_O_BINARY);
_setmode(_fileno(stdout),_O_BINARY);
#endif /* _MSC_VER */
type1(stdin,stdout);
} else if (optind + 1 == argc) {
FILE *fp = fopen(argv[optind], "rb");
if (fp == NULL) {
perror(argv[optind]);
return 1;
}
panicname = argv[optind];
#if _MSC_VER
_setmode(_fileno(stdout),_O_BINARY);
#endif /* _MSC_VER */
type1(fp,stdout);
} else if (optind +2 == argc) {
FILE *fp1 = fopen(argv[optind], "rb");
FILE *fp2 = fopen(argv[optind+1], "wb");
if (fp1 == NULL) {
perror(argv[optind]);
return 1;
}
if (fp2 == NULL) {
perror(argv[optind+1]);
return 1;
}
panicname = argv[optind];
type1(fp1,fp2);
} else
usage();
return 0;
}
|
the_stack_data/234519065.c
|
/* (Project 7.05) Scrabble word value */
#include <stdio.h>
#include <ctype.h>
int main(void)
{
char a;
float val = 0.0f, let[26] =
{
1, 3, 3, 2, 1, 4, 2, 4, 1, 8, 5, 1, 3, 1, 1, 3, 10, 1, 1, 1, 1, 4, 4, 8, 4, 10
};
printf("Enter a scrabble word: ");
while ((a = getchar()) != '\n'){
a = toupper(a);
val += let[a-65];
}
printf("Scrabble value: %.0f\n", val);
return 0;
}
|
the_stack_data/93888887.c
|
#include <stdio.h>
void exibeOnzeTracos(void);
int main(){
int op;
printf("1-Xavante 2 - Pelotas: ");
scanf("%d",&op);
while(op!=1 && op!=2){
printf("1-Xavante 2 - Pelotas: ");
scanf("%d",&op);
}
printf(" +");
exibeOnzeTracos();
printf("+\n");
exibeOnzeTracos();
if(op==1){
printf("| XAVANTE |");
} else{
printf("| PELOTAS |");
}
exibeOnzeTracos();
printf("\n");
printf(" +");
exibeOnzeTracos();
printf("+\n");
return 0;
}
void exibeOnzeTracos(void){
int i;
for(i=1;i<=11;i++){
printf("-");
}
}
|
the_stack_data/190767466.c
|
#include <stdio.h>
#include <string.h>
#define MAX 2000
struct occurance_t{
long int hash;
int counter;
};
long hash(char *word);
int main(){
struct occurance_t compare[MAX];
char sentence[200];
char replacer[8];
int count = 0;
int max = 0;
long int maxhash = 0;
for(int i = 0; i < MAX; i++){
compare[i].hash = 0;
compare[i].counter = 0;
}
for(int i = 0; i < 200; i++){
sentence[i] = 0;
}
strcpy(replacer, "vsmisal");
while(strcmp(sentence, replacer) != 0){
scanf("%s", sentence);
if(strcmp(sentence, replacer) == 0){
break;
}
else{
compare[count].hash = hash(sentence);
count ++;
}
}
for(int i = 0; i < count; i++){
for(int k = 1; k < count; k++){
if(compare[i].hash == compare[k].hash){
compare[i].counter ++;
if(compare[i].hash > max){
max = compare[i].counter;
maxhash = compare[i].hash;
}
}
}
}
printf("%d %ld", max, maxhash);
return 0;
}
long hash(char *word){
long int hash;
hash = 42;
for(int i = 0; i < strlen(word); i++){
hash = hash + (word[i] * (i + 1));
}
return hash;
}
|
the_stack_data/148577765.c
|
#include <stdio.h>
#include <time.h>
int main() {
clock_t begin = clock();
for (int i = 0; i < 10000000; ++i) {
}
clock_t end = clock();
double duration = (double)(end - begin) / CLOCKS_PER_SEC;
printf("Took: %f milliseconds\n", duration);
FILE *out = fopen("output.txt", "a");
fprintf(out, "%f\n", duration);
fclose(out);
return 0;
}
|
the_stack_data/21603.c
|
//
// Created by zhangrongxiang on 2017/10/30 14:11
// File rand
//
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <time.h>
int getRandom(unsigned char *Buff, int len);
int main() {
unsigned char buff[16] = {0x00};
int i = 0;
while (i++ < 100) {
srand((unsigned) time(NULL));
getRandom(buff, 16);
printf("%s\n", buff);
sleep(1);
}
return 0;
}
int getRandom(unsigned char *Buffer, int len) {
long i = 0, reman = 0, rand = 0;
reman = len % 4;
// printf("1--------------------\n");
for (i = 0; i < len / 4; i++) {
// printf("2--------------------\n");
rand = random();
// printf("%ld\n", rand);
// printf("22--------------------\n");
memcpy(Buffer + i * 4, &rand, 4);
// printf("%s\n", Buffer);
}
if (reman > 0) {
// printf("3--------------------\n");
rand = random();
memcpy(Buffer + i * 4, &rand, reman);
}
// printf("--------------------\n");
return 0;
}
|
the_stack_data/176706973.c
|
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
int main(int argc, char **argv){
if (argc < 2) {
printf("ERROR: Introduce el comando.\n");
return -1;
}
char cmd[1024] = "";
for(int i = 1; i < argc; i++){
strcat(cmd, argv[i]);
strcat(cmd, " ");
}
system(cmd);
// Como system hace un fork y ejecuta execl, siempre imprimira esta parte.
printf("El comando terminó de ejecutarse.\n");
return 0;
}
|
the_stack_data/248579576.c
|
#include <pthread.h>
extern void *__symbiotic_global_lock(void);
void __symbiotic_atomic_end(void)
{
pthread_mutex_unlock(__symbiotic_global_lock());
}
|
the_stack_data/103264654.c
|
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <fcntl.h>
#define BUFSZ 1024
int main (int argc, char * argv[])
{
int n,i;
int fd;
char buf[BUFSZ];
if ( argc == 1 ) {
fprintf(stderr,"Usage: prog2 <file list>\n");
exit(-1);
}
for ( i=1; i<argc; i++ ) {
if((fd = open(argv[i], O_RDONLY)) < 0 ) {
perror(argv[i]);
exit(-1);
}
while ( (n = read(fd, buf, BUFSZ)) > 0 ) {
write(STDOUT_FILENO,buf,n);
}
if ( n < 0 ) {
perror("I/O error");
exit(-1);
}
close(fd);
}
exit(0);
}
|
the_stack_data/110630.c
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
//
//#include "assert.h"
//#include "mem.h"
//#include "thread.h"
//#include "sem.h"
//
//#ifdef WIN32
//#include <windows.h>
//#include <process.h>
//
//
//static char rcsid[] = "$Id$";
//
//#define T Thread_T
//struct T {
// DWORD IDThread; /* Win 32 thread identifier */
// T handle; /* self pointer */
// int code; /* exit code */
// HANDLE join; /* join semaphore */
// T joinlist; /* threads waiting on join */
// T link; /* next thread on this join list */
// T next; /* next thread on this hash chain */
// int alerted; /* 1 if this thread has been alerted */
// int (*apply)(void *); /* initial function for this thread */
// void *args; /* argument for apply */
//};
//
//const Except_T Thread_Alerted = { "Thread alerted" };
//const Except_T Thread_Failed = { "Thread creation failed" };
//
//static T allthreads[317];
//#define HASH(id) ((int)((id)%(sizeof allthreads/sizeof allthreads[0])))
//static int nthreads; /* number of threads in allthreads */
//static T root;
//static HANDLE join0; /* Thread_join(NULL) semaphore */
//static int join0count; /* number of threads waiting on join0; always 0 or 1 */
//
//static int critical;
//static CRITICAL_SECTION csection;
//#define ENTERCRITICAL EnterCriticalSection(&csection); assert(critical == 0); critical++
//#define LEAVECRITICAL critical--; assert(critical == 0); LeaveCriticalSection(&csection)
//
//static T getThreadByID(DWORD id) {
// T t;
//
// ENTERCRITICAL;
// for (t = allthreads[HASH(id)]; t != NULL; t = t->next)
// if (t->IDThread == id)
// break;
// LEAVECRITICAL;
// assert(t);
// return t;
//}
//
///* removeThread - must be called from within a critical region */
//static void removeThread(T t) {
// T *q;
//
// q = &allthreads[HASH(t->IDThread)];
// for ( ; *q != NULL && *q != t; q = &(*q)->next)
// ;
// assert(*q == t);
// *q = t->next;
// nthreads--;
// t->handle = NULL;
//}
//
//static void addThread(T t) {
// T *q;
//
// ENTERCRITICAL;
// q = &allthreads[HASH(t->IDThread)];
// t->next = *q;
// *q = t;
// nthreads++;
// t->handle = t;
// LEAVECRITICAL;
//}
//
//static void testalert(T t) {
// ENTERCRITICAL;
// if (t->alerted) {
// t->alerted = 0;
// LEAVECRITICAL;
// RAISE(Thread_Alerted);
// }
// LEAVECRITICAL;
//}
//
//int Thread_init(int preempt, ...) {
// assert(preempt == 0 || preempt == 1);
// assert(root == NULL);
// TRY
// NEW0(root);
// EXCEPT(Mem_Failed)
// return -1;
// END_TRY;
// join0 = CreateSemaphore(NULL, 0, 1, NULL);
// if (join0 == NULL)
// return -1;
// root->join = CreateSemaphore(NULL, 0, INT_MAX, NULL);
// if (root->join == NULL) {
// BOOL result = CloseHandle(join0);
// assert(result == TRUE);
// return -1;
// }
// InitializeCriticalSection(&csection);
// root->IDThread = GetCurrentThreadId();
// addThread(root);
// /* handle preempt == 0 */
// return 1;
//}
//
//T Thread_self(void) {
// assert(root);
// return getThreadByID(GetCurrentThreadId());
//}
//
//void Thread_pause(void) {
// assert(root);
// Sleep(0);
//}
//
//int Thread_join(T t) {
// T current = Thread_self();
//
// assert(root);
// assert(t != current);
// testalert(current);
// if (t != NULL) {
// ENTERCRITICAL;
// if (t->handle == t) {
// HANDLE join = t->join;
// DWORD result;
// assert(current->link == NULL);
// current->link = t->joinlist;
// t->joinlist = current;
// LEAVECRITICAL;
// result = WaitForSingleObject(join, INFINITE);
// assert(result != WAIT_FAILED);
// testalert(current);
// return current->code;
// } else {
// LEAVECRITICAL;
// return -1;
// }
// }
// ENTERCRITICAL;
// if (nthreads > 1) {
// DWORD result;
// assert(join0count == 0);
// join0count++;
// LEAVECRITICAL;
// result = WaitForSingleObject(join0, INFINITE);
// assert(result != WAIT_FAILED);
// ENTERCRITICAL;
// join0count--;
// LEAVECRITICAL;
// testalert(current);
// } else {
// assert(join0count == 0);
// LEAVECRITICAL;
// return 0;
// }
//}
//
//void Thread_exit(int code) {
// BOOL result;
// T current = Thread_self();
//
// ENTERCRITICAL;
// removeThread(current);
// if (current->joinlist != NULL) {
// T t, n;
// int count = 0;
// assert(current->join);
// for (t = current->joinlist; t != NULL; t = n) {
// t->code = code;
// n = t->link;
// t->link = NULL;
// count++;
// }
// current->joinlist = NULL;
// result = ReleaseSemaphore(current->join, count, NULL);
// assert(result == TRUE);
// }
// result = CloseHandle(current->join);
// assert(result == TRUE);
// current->join = NULL;
// if (join0count > 0 && nthreads == 1) {
// assert(join0count == 1);
// result = ReleaseSemaphore(join0, 1, NULL);
// assert(result == TRUE);
// }
// if (nthreads == 0) {
// result = CloseHandle(join0);
// assert(result == TRUE);
// }
// FREE(current);
// LEAVECRITICAL;
// _endthreadex(code);
//}
//
//void Thread_alert(T t) {
// assert(root);
// ENTERCRITICAL;
// assert(t && t->handle == t);
// t->alerted = 1;
// LEAVECRITICAL;
//}
//
//static unsigned __stdcall start(void *p) {
// T t = p;
//
// if (Except_index == -1)
// Except_init();
// TlsSetValue(Except_index, NULL);
// Thread_exit((*t->apply)(t->args));
// return 0;
//}
//
//T Thread_new(int apply(void *), void *args, int nbytes, ...) {
// T t;
// HANDLE hThread;
//
// assert(root);
// assert(apply);
// assert(args && nbytes >= 0 || args == NULL);
// if (args == NULL)
// nbytes = 0;
// TRY
// t = ALLOC((sizeof (*t) + nbytes + 15)&~15);
// memset(t, '\0', sizeof *t);
// EXCEPT(Mem_Failed)
// RAISE(Thread_Failed);
// END_TRY;
// t->join = CreateSemaphore(NULL, 0, INT_MAX, NULL);
// if (t->join == NULL) {
// FREE(t);
// RAISE(Thread_Failed);
// }
// if (nbytes > 0) {
// t->args = t + 1;
// memcpy(t->args, args, nbytes);
// } else
// t->args = args;
// t->apply = apply;
// hThread = (HANDLE)_beginthreadex(
// NULL, /* default security attributes */
// 0, /* default stack size */
// start, /* initial function */
// t, /* start's argument */
// 0, /* default thread creation flags */
// &t->IDThread /* where to store the thread id */
// );
// if (hThread == NULL) {
// CloseHandle(t->join);
// FREE(t);
// RAISE(Thread_Failed);
// }
// CloseHandle(hThread);
// addThread(t);
// return t;
//}
//#undef T
//
//#define T Sem_T
//T *Sem_new(int count) {
// T *s;
//
// NEW(s);
// Sem_init(s, count);
// return s;
//}
//
//void Sem_init(T *s, int count) {
// assert(root);
// assert(s);
// assert(count >= 0);
// s->count = 0;
// s->queue = CreateSemaphore(NULL, count, INT_MAX, NULL);
// assert(s->queue);
//}
//
//void Sem_wait(T *s) {
// DWORD result;
// Thread_T current = Thread_self();
//
// assert(s);
// testalert(current);
// result = WaitForSingleObject(s->queue, INFINITE);
// assert(result != WAIT_FAILED);
// ENTERCRITICAL;
// if (current->alerted) {
// BOOL result;
// current->alerted = 0;
// LEAVECRITICAL;
// result = ReleaseSemaphore(s->queue, 1, NULL);
// assert(result == TRUE);
// RAISE(Thread_Alerted);
// }
// LEAVECRITICAL;
//}
//
//void Sem_signal(T *s) {
// BOOL result;
//
// assert(root);
// assert(s);
// result = ReleaseSemaphore(s->queue, 1, NULL);
// assert(result == TRUE);
//}
//#undef T
//
//
//#endif
|
the_stack_data/215767872.c
|
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
struct node {
int data;
struct node *left;
struct node *right;
};
struct node* insert( struct node* root, int data ) {
if(root == NULL) {
struct node* node = (struct node*)malloc(sizeof(struct node));
node->data = data;
node->left = NULL;
node->right = NULL;
return node;
} else {
struct node* cur;
if(data <= root->data) {
cur = insert(root->left, data);
root->left = cur;
} else {
cur = insert(root->right, data);
root->right = cur;
}
return root;
}
}
/* you only have to complete the function given below.
node is defined as
struct node {
int data;
struct node *left;
struct node *right;
};
*/
int height(struct node* root)
{
int right, left;
if(root== NULL)return 0 ;
else {
right= height(root->right);
left = height(root->left);
if(right >left)return right+1;
else return left+1;
}
}
void print(struct node* root, int i){
if(root == NULL) return;
if(i == 1)printf("%d ", root->data);
else if(i > 1){
print(root->left, i-1);
print(root->right, i-1);
}
}
void levelOrder( struct node *root) {
int h = height(root);
int i;
for(i=1; i<=h; i++){
print(root, i);
}
}
int main() {
struct node* root = NULL;
int t;
int data;
scanf("%d", &t);
while(t-- > 0) {
scanf("%d", &data);
root = insert(root, data);
}
levelOrder(root);
return 0;
}
|
the_stack_data/18381.c
|
/* This testcase is part of GDB, the GNU debugger.
Copyright 2012-2019 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
static void
bottom_func (void)
{
return; /* Break bottom_func here. */
}
static void
middle_func (void)
{
bottom_func ();
}
static void
top_func (void)
{
middle_func ();
}
int
main ()
{
top_func ();
return 0;
}
|
the_stack_data/137176.c
|
/* jsmin.c
Copyright (c) 2017 John Talbot (www.BeNiceGames.com)
- Inspired by jsmin from Douglas Crockford (www.crockford.com)
- As compared to his, This jsmin leaves the output uncompacted
so that it is legible and ONLY removes C & C++ style comments.
- This code was rewritten from scratch, only the Permissions
are the same, but Kudos to Douglas for coming up with a solution
for allowing comments in json files. I just needed something
that I could debug the output of more easily.
- Execution is the same: jsmin < config.min.json > config.json
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 shall be used for Good, not Evil.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
#include <stdlib.h>
#include <stdio.h>
int theCurrentChar;
int theNextChar;
int insideSingleQuote = 0;
int insideDoubleQuote = 0;
unsigned long theCharacterPositionInLine = 0;
unsigned long lineCounter =1;
// Return the next character from stdin. increasing line number count accordingly.
int getCharFromStdin()
{
int c = getc(stdin);
if (c == '\r')
c = '\n';
if (c == '\n') {
lineCounter ++;
theCharacterPositionInLine = 0;
} else {
theCharacterPositionInLine ++;
}
return c;
}
// jsmin -- Copy stdin to stdout, deleting 'C' or 'C++' style comments.
// -- Everything else is left the same, except:
// - any \r characters are changed to \n.
// - any empty blank lines are removed.
// - any trailing blanks are removed.
// Errors: The only error possible is for unterminated 'C' style comments.
void outputChar(int c)
{
static unsigned long consecutiveSpaceCounter = 0;
static int printableCharFoundOnLine = 0;
// Do not print anything if no characters were on the line.
if (c == '\n' && printableCharFoundOnLine == 0)
{
consecutiveSpaceCounter = 0;
return;
}
// Count the spaces before printing them so that empty lines
// are removed. (This looks better for blank lines with comments removed).
if (c == ' ')
{
consecutiveSpaceCounter ++;
} else {
// This will print any spaces counted before a real character
// and not when EOL is found.
if (c != '\n')
{
// Since consecutiveSpaceCounter is unsigned, there is no
// possability of being stuck in a loop forever.
while (consecutiveSpaceCounter != 0)
{
putc(' ', stdout);
consecutiveSpaceCounter --;
}
printableCharFoundOnLine = 1;
} else {
// A new line means the next line needs to reset char found flag.
printableCharFoundOnLine = 0 ;
}
putc(c, stdout);
// Since a char was printed, reset the space counter.
consecutiveSpaceCounter = 0;
}
}
static void
jsmin()
{
// Prime the pump.
theCurrentChar = getCharFromStdin();
while (theCurrentChar != EOF)
{
if (theCurrentChar == '\'')
{
insideSingleQuote = 1;
outputChar(theCurrentChar);
theCurrentChar = getCharFromStdin();
// Continue until out of single quotes
// or forced out of single quotes by a newline
while (insideSingleQuote == 1 &&
theCurrentChar !=EOF)
{
theNextChar = getCharFromStdin();
// Skip passed escaped single quotes
if (theCurrentChar == '\\' && theNextChar == '\'' )
{
outputChar(theCurrentChar);
theCurrentChar = theNextChar;
continue;
}
// Found end of single quotes
if (theCurrentChar == '\'')
{
insideSingleQuote = 0;
}
// Newline and inside single quotes breaks
// out automatically
if (theCurrentChar == '\n')
{
insideSingleQuote = 0;
}
outputChar(theCurrentChar);
theCurrentChar = theNextChar;
}
}
if (theCurrentChar == '\"')
{
insideDoubleQuote = 1;
outputChar(theCurrentChar);
theCurrentChar = getCharFromStdin();
// Continue until out of single quotes
// or forced out of single quotes by a newline
while (insideDoubleQuote == 1 &&
theCurrentChar !=EOF)
{
theNextChar = getCharFromStdin();
// Skip passed escaped double quotes
if (theCurrentChar == '\\' && theNextChar == '\"' )
{
outputChar(theCurrentChar);
outputChar(theNextChar);
theCurrentChar = getCharFromStdin();
theNextChar = getCharFromStdin();
}
// Found end of double quotes
if (theCurrentChar == '\"')
{
insideDoubleQuote = 0;
}
// Newline and inside double quotes breaks
// out automatically
if (theCurrentChar == '\n')
{
insideDoubleQuote = 0;
}
outputChar(theCurrentChar);
theCurrentChar = theNextChar;
}
}
// Look for the start of a 'C' or 'C++' style comment.
if (theCurrentChar == '/' )
{
theNextChar = getCharFromStdin();
// Found a 'C++' style comment.
if (theNextChar == '/' )
{
// Continue until \n
while (theCurrentChar != '\n' )
{
theCurrentChar = getCharFromStdin();
if (theCurrentChar == EOF)
break;
}
outputChar(theCurrentChar); // The EOL char
theCurrentChar = getCharFromStdin();
continue; // Main loop.
}
if (theNextChar == '*') // Found a 'C' style comment.
{
unsigned long openCommentLineNumber = lineCounter;
// Move past the start of the comment
theCurrentChar = getCharFromStdin();
theNextChar = getCharFromStdin();
// Continue until '*/'
while (theCurrentChar != '*' || theNextChar != '/' )
{
if (theCurrentChar == EOF)
{
fprintf(stderr, "Missing comment terminator for line %lu\n\n", openCommentLineNumber);
exit(-1);
}
theCurrentChar = theNextChar;
theNextChar = getCharFromStdin();
}
theCurrentChar = getCharFromStdin();
continue; // The main loop.
}
outputChar(theCurrentChar);
// The next char has already been read, use it.
theCurrentChar = theNextChar;
continue; // The main loop.
}
outputChar(theCurrentChar);
// Read the char to be processed next.
theCurrentChar = getCharFromStdin();
}
}
// main -- Output any command line arguments to stderr and then minify the input.
extern int
main(int argc, char* argv[])
{
int i;
for (i = 1; i < argc; i += 1) {
fprintf(stderr, "%s\n", argv[i]);
}
jsmin();
return 0;
}
|
the_stack_data/98574484.c
|
/*Demonstarting an Array of Counters*/
#include <stdio.h>
int main (void)
{
int ratingCounters[11] = {0};
int i, response;
printf ("Enter your responses\n");
for ( i = 1; i <= 20; ++i ) {
scanf ("%i", &response);
if ( response < 1 || response > 10 ) {
printf ("Bad response: %i\n", response);
} else {
++ratingCounters[response];
}
}
printf ("\n\nRating Number of Responses\n");
printf ("------ -------------------\n");
for ( i = 1; i <= 10; ++i ) {
printf ("%4i%14i\n", i, ratingCounters[i]);
}
return 0;
}
|
the_stack_data/19009.c
|
/**
* This file was autogenerated from doodleR.png by WiiBuilder.
*/
const unsigned char doodleR[] = {
0x89, 0x50, 0x4E, 0x47, 0x0D, 0x0A, 0x1A, 0x0A, 0x00, 0x00, 0x00, 0x0D, 0x49, 0x48, 0x44, 0x52,
0x00, 0x00, 0x00, 0x3C, 0x00, 0x00, 0x00, 0x3C, 0x08, 0x06, 0x00, 0x00, 0x00, 0x3A, 0xFC, 0xD9,
0x72, 0x00, 0x00, 0x00, 0x04, 0x67, 0x41, 0x4D, 0x41, 0x00, 0x00, 0xB1, 0x8E, 0x7C, 0xFB, 0x51,
0x93, 0x00, 0x00, 0x00, 0x20, 0x63, 0x48, 0x52, 0x4D, 0x00, 0x00, 0x87, 0x0F, 0x00, 0x00, 0x8C,
0x0F, 0x00, 0x00, 0xFD, 0x52, 0x00, 0x00, 0x81, 0x40, 0x00, 0x00, 0x7D, 0x79, 0x00, 0x00, 0xE9,
0x8B, 0x00, 0x00, 0x3C, 0xE5, 0x00, 0x00, 0x19, 0xCC, 0x73, 0x3C, 0x85, 0x77, 0x00, 0x00, 0x0A,
0x39, 0x69, 0x43, 0x43, 0x50, 0x50, 0x68, 0x6F, 0x74, 0x6F, 0x73, 0x68, 0x6F, 0x70, 0x20, 0x49,
0x43, 0x43, 0x20, 0x70, 0x72, 0x6F, 0x66, 0x69, 0x6C, 0x65, 0x00, 0x00, 0x48, 0xC7, 0x9D, 0x96,
0x77, 0x54, 0x54, 0xD7, 0x16, 0x87, 0xCF, 0xBD, 0x77, 0x7A, 0xA1, 0xCD, 0x30, 0xD2, 0x19, 0x7A,
0x93, 0x2E, 0x30, 0x80, 0xF4, 0x2E, 0x20, 0x1D, 0x04, 0x51, 0x18, 0x66, 0x06, 0x18, 0xCA, 0x00,
0xC3, 0x0C, 0x4D, 0x6C, 0x88, 0xA8, 0x40, 0x44, 0x11, 0x11, 0x01, 0x45, 0x90, 0xA0, 0x80, 0x01,
0xA3, 0xA1, 0x48, 0xAC, 0x88, 0x62, 0x21, 0x28, 0xA8, 0x60, 0x0F, 0x48, 0x10, 0x50, 0x62, 0x30,
0x8A, 0xA8, 0xA8, 0x64, 0x46, 0xD6, 0x4A, 0x7C, 0x79, 0x79, 0xEF, 0xE5, 0xE5, 0xF7, 0xC7, 0xBD,
0xDF, 0xDA, 0x67, 0xEF, 0x73, 0xF7, 0xD9, 0x7B, 0x9F, 0xB5, 0x2E, 0x00, 0x24, 0x4F, 0x1F, 0x2E,
0x2F, 0x05, 0x96, 0x02, 0x20, 0x99, 0x27, 0xE0, 0x07, 0x7A, 0x38, 0xD3, 0x57, 0x85, 0x47, 0xD0,
0xB1, 0xFD, 0x00, 0x06, 0x78, 0x80, 0x01, 0xA6, 0x00, 0x30, 0x59, 0xE9, 0xA9, 0xBE, 0x41, 0xEE,
0xC1, 0x40, 0x24, 0x2F, 0x37, 0x17, 0x7A, 0xBA, 0xC8, 0x09, 0xFC, 0x8B, 0xDE, 0x0C, 0x01, 0x48,
0xFC, 0xBE, 0x65, 0xE8, 0xE9, 0x4F, 0xA7, 0x83, 0xFF, 0x4F, 0xD2, 0xAC, 0x54, 0xBE, 0x00, 0x00,
0xC8, 0x5F, 0xC4, 0xE6, 0x6C, 0x4E, 0x3A, 0x4B, 0xC4, 0xF9, 0x22, 0x4E, 0xCA, 0x14, 0xA4, 0x8A,
0xED, 0x33, 0x22, 0xA6, 0xC6, 0x24, 0x8A, 0x19, 0x46, 0x89, 0x99, 0x2F, 0x4A, 0x50, 0xC4, 0x72,
0x62, 0x8E, 0x5B, 0xE4, 0xA5, 0x9F, 0x7D, 0x16, 0xD9, 0x51, 0xCC, 0xEC, 0x64, 0x1E, 0x5B, 0xC4,
0xE2, 0x9C, 0x53, 0xD9, 0xC9, 0x6C, 0x31, 0xF7, 0x88, 0x78, 0x7B, 0x86, 0x90, 0x23, 0x62, 0xC4,
0x47, 0xC4, 0x05, 0x19, 0x5C, 0x4E, 0xA6, 0x88, 0x6F, 0x8B, 0x58, 0x33, 0x49, 0x98, 0xCC, 0x15,
0xF1, 0x5B, 0x71, 0x6C, 0x32, 0x87, 0x99, 0x0E, 0x00, 0x8A, 0x24, 0xB6, 0x0B, 0x38, 0xAC, 0x78,
0x11, 0x9B, 0x88, 0x98, 0xC4, 0x0F, 0x0E, 0x74, 0x11, 0xF1, 0x72, 0x00, 0x70, 0xA4, 0xB8, 0x2F,
0x38, 0xE6, 0x0B, 0x16, 0x70, 0xB2, 0x04, 0xE2, 0x43, 0xB9, 0xA4, 0xA4, 0x66, 0xF3, 0xB9, 0x71,
0xF1, 0x02, 0xBA, 0x2E, 0x4B, 0x8F, 0x6E, 0x6A, 0x6D, 0xCD, 0xA0, 0x7B, 0x72, 0x32, 0x93, 0x38,
0x02, 0x81, 0xA1, 0x3F, 0x93, 0x95, 0xC8, 0xE4, 0xB3, 0xE9, 0x2E, 0x29, 0xC9, 0xA9, 0x4C, 0x5E,
0x36, 0x00, 0x8B, 0x67, 0xFE, 0x2C, 0x19, 0x71, 0x6D, 0xE9, 0xA2, 0x22, 0x5B, 0x9A, 0x5A, 0x5B,
0x5A, 0x1A, 0x9A, 0x19, 0x99, 0x7E, 0x51, 0xA8, 0xFF, 0xBA, 0xF8, 0x37, 0x25, 0xEE, 0xED, 0x22,
0xBD, 0x0A, 0xF8, 0xDC, 0x33, 0x88, 0xD6, 0xF7, 0x87, 0xED, 0xAF, 0xFC, 0x52, 0xEA, 0x00, 0x60,
0xCC, 0x8A, 0x6A, 0xB3, 0xEB, 0x0F, 0x5B, 0xCC, 0x7E, 0x00, 0x3A, 0xB6, 0x02, 0x20, 0x77, 0xFF,
0x0F, 0x9B, 0xE6, 0x21, 0x00, 0x24, 0x45, 0x7D, 0x6B, 0xBF, 0xF1, 0xC5, 0x79, 0x68, 0xE2, 0x79,
0x89, 0x17, 0x08, 0x52, 0x6D, 0x8C, 0x8D, 0x33, 0x33, 0x33, 0x8D, 0xB8, 0x1C, 0x96, 0x91, 0xB8,
0xA0, 0xBF, 0xEB, 0x7F, 0x3A, 0xFC, 0x0D, 0x7D, 0xF1, 0x3D, 0x23, 0xF1, 0x76, 0xBF, 0x97, 0x87,
0xEE, 0xCA, 0x89, 0x65, 0x0A, 0x93, 0x04, 0x74, 0x71, 0xDD, 0x58, 0x29, 0x49, 0x29, 0x42, 0x3E,
0x3D, 0x3D, 0x95, 0xC9, 0xE2, 0xD0, 0x0D, 0xFF, 0x3C, 0xC4, 0xFF, 0x38, 0xF0, 0xAF, 0xF3, 0x58,
0x1A, 0xC8, 0x89, 0xE5, 0xF0, 0x39, 0x3C, 0x51, 0x44, 0xA8, 0x68, 0xCA, 0xB8, 0xBC, 0x38, 0x51,
0xBB, 0x79, 0x6C, 0xAE, 0x80, 0x9B, 0xC2, 0xA3, 0x73, 0x79, 0xFF, 0xA9, 0x89, 0xFF, 0x30, 0xEC,
0x4F, 0x5A, 0x9C, 0x6B, 0x91, 0x28, 0xF5, 0x9F, 0x00, 0x35, 0xCA, 0x08, 0x48, 0xDD, 0xA0, 0x02,
0xE4, 0xE7, 0x3E, 0x80, 0xA2, 0x10, 0x01, 0x12, 0x79, 0x50, 0xDC, 0xF5, 0xDF, 0xFB, 0xE6, 0x83,
0x0F, 0x05, 0xE2, 0x9B, 0x17, 0xA6, 0x3A, 0xB1, 0x38, 0xF7, 0x9F, 0x05, 0xFD, 0xFB, 0xAE, 0x70,
0x89, 0xF8, 0x91, 0xCE, 0x8D, 0xFB, 0x1C, 0xE7, 0x12, 0x18, 0x4C, 0x67, 0x09, 0xF9, 0x19, 0x8B,
0x6B, 0xE2, 0x6B, 0x09, 0xD0, 0x80, 0x00, 0x24, 0x01, 0x15, 0xC8, 0x03, 0x15, 0xA0, 0x01, 0x74,
0x81, 0x21, 0x30, 0x03, 0x56, 0xC0, 0x16, 0x38, 0x02, 0x37, 0xB0, 0x02, 0xF8, 0x81, 0x60, 0x10,
0x0E, 0xD6, 0x02, 0x16, 0x88, 0x07, 0xC9, 0x80, 0x0F, 0x32, 0x41, 0x2E, 0xD8, 0x0C, 0x0A, 0x40,
0x11, 0xD8, 0x05, 0xF6, 0x82, 0x4A, 0x50, 0x03, 0xEA, 0x41, 0x23, 0x68, 0x01, 0x27, 0x40, 0x07,
0x38, 0x0D, 0x2E, 0x80, 0xCB, 0xE0, 0x3A, 0xB8, 0x09, 0xEE, 0x80, 0x07, 0x60, 0x04, 0x8C, 0x83,
0xE7, 0x60, 0x06, 0xBC, 0x01, 0xF3, 0x10, 0x04, 0x61, 0x21, 0x32, 0x44, 0x81, 0xE4, 0x21, 0x55,
0x48, 0x0B, 0x32, 0x80, 0xCC, 0x20, 0x06, 0x64, 0x0F, 0xB9, 0x41, 0x3E, 0x50, 0x20, 0x14, 0x0E,
0x45, 0x43, 0x71, 0x10, 0x0F, 0x12, 0x42, 0xB9, 0xD0, 0x16, 0xA8, 0x08, 0x2A, 0x85, 0x2A, 0xA1,
0x5A, 0xA8, 0x11, 0xFA, 0x16, 0x3A, 0x05, 0x5D, 0x80, 0xAE, 0x42, 0x03, 0xD0, 0x3D, 0x68, 0x14,
0x9A, 0x82, 0x7E, 0x85, 0xDE, 0xC3, 0x08, 0x4C, 0x82, 0xA9, 0xB0, 0x32, 0xAC, 0x0D, 0x1B, 0xC3,
0x0C, 0xD8, 0x09, 0xF6, 0x86, 0x83, 0xE1, 0x35, 0x70, 0x1C, 0x9C, 0x06, 0xE7, 0xC0, 0xF9, 0xF0,
0x4E, 0xB8, 0x02, 0xAE, 0x83, 0x8F, 0xC1, 0xED, 0xF0, 0x05, 0xF8, 0x3A, 0x7C, 0x07, 0x1E, 0x81,
0x9F, 0xC3, 0xB3, 0x08, 0x40, 0x88, 0x08, 0x0D, 0x51, 0x43, 0x0C, 0x11, 0x06, 0xE2, 0x82, 0xF8,
0x21, 0x11, 0x48, 0x2C, 0xC2, 0x47, 0x36, 0x20, 0x85, 0x48, 0x39, 0x52, 0x87, 0xB4, 0x20, 0x5D,
0x48, 0x2F, 0x72, 0x0B, 0x19, 0x41, 0xA6, 0x91, 0x77, 0x28, 0x0C, 0x8A, 0x82, 0xA2, 0xA3, 0x0C,
0x51, 0xB6, 0x28, 0x4F, 0x54, 0x08, 0x8A, 0x85, 0x4A, 0x43, 0x6D, 0x40, 0x15, 0xA3, 0x2A, 0x51,
0x47, 0x51, 0xED, 0xA8, 0x1E, 0xD4, 0x2D, 0xD4, 0x28, 0x6A, 0x06, 0xF5, 0x09, 0x4D, 0x46, 0x2B,
0xA1, 0x0D, 0xD0, 0x36, 0x68, 0x2F, 0xF4, 0x2A, 0x74, 0x1C, 0x3A, 0x13, 0x5D, 0x80, 0x2E, 0x47,
0x37, 0xA0, 0xDB, 0xD0, 0x97, 0xD0, 0x77, 0xD0, 0xE3, 0xE8, 0x37, 0x18, 0x0C, 0x86, 0x86, 0xD1,
0xC1, 0x58, 0x61, 0x3C, 0x31, 0xE1, 0x98, 0x04, 0xCC, 0x3A, 0x4C, 0x31, 0xE6, 0x00, 0xA6, 0x15,
0x73, 0x1E, 0x33, 0x80, 0x19, 0xC3, 0xCC, 0x62, 0xB1, 0x58, 0x79, 0xAC, 0x01, 0xD6, 0x0E, 0xEB,
0x87, 0x65, 0x62, 0x05, 0xD8, 0x02, 0xEC, 0x7E, 0xEC, 0x31, 0xEC, 0x39, 0xEC, 0x20, 0x76, 0x1C,
0xFB, 0x16, 0x47, 0xC4, 0xA9, 0xE2, 0xCC, 0x70, 0xEE, 0xB8, 0x08, 0x1C, 0x0F, 0x97, 0x87, 0x2B,
0xC7, 0x35, 0xE1, 0xCE, 0xE2, 0x06, 0x71, 0x13, 0xB8, 0x79, 0xBC, 0x14, 0x5E, 0x0B, 0x6F, 0x83,
0xF7, 0xC3, 0xB3, 0xF1, 0xD9, 0xF8, 0x12, 0x7C, 0x3D, 0xBE, 0x0B, 0x7F, 0x03, 0x3F, 0x8E, 0x9F,
0x27, 0x48, 0x13, 0x74, 0x08, 0x76, 0x84, 0x60, 0x42, 0x02, 0x61, 0x33, 0xA1, 0x82, 0xD0, 0x42,
0xB8, 0x44, 0x78, 0x48, 0x78, 0x45, 0x24, 0x12, 0xD5, 0x89, 0xD6, 0xC4, 0x00, 0x22, 0x97, 0xB8,
0x89, 0x58, 0x41, 0x3C, 0x4E, 0xBC, 0x42, 0x1C, 0x25, 0xBE, 0x23, 0xC9, 0x90, 0xF4, 0x49, 0x2E,
0xA4, 0x48, 0x92, 0x90, 0xB4, 0x93, 0x74, 0x84, 0x74, 0x9E, 0x74, 0x8F, 0xF4, 0x8A, 0x4C, 0x26,
0x6B, 0x93, 0x1D, 0xC9, 0x11, 0x64, 0x01, 0x79, 0x27, 0xB9, 0x91, 0x7C, 0x91, 0xFC, 0x98, 0xFC,
0x56, 0x82, 0x22, 0x61, 0x24, 0xE1, 0x25, 0xC1, 0x96, 0xD8, 0x28, 0x51, 0x25, 0xD1, 0x2E, 0x31,
0x28, 0xF1, 0x42, 0x12, 0x2F, 0xA9, 0x25, 0xE9, 0x24, 0xB9, 0x56, 0x32, 0x47, 0xB2, 0x5C, 0xF2,
0xA4, 0xE4, 0x0D, 0xC9, 0x69, 0x29, 0xBC, 0x94, 0xB6, 0x94, 0x8B, 0x14, 0x53, 0x6A, 0x83, 0x54,
0x95, 0xD4, 0x29, 0xA9, 0x61, 0xA9, 0x59, 0x69, 0x8A, 0xB4, 0xA9, 0xB4, 0x9F, 0x74, 0xB2, 0x74,
0xB1, 0x74, 0x93, 0xF4, 0x55, 0xE9, 0x49, 0x19, 0xAC, 0x8C, 0xB6, 0x8C, 0x9B, 0x0C, 0x5B, 0x26,
0x5F, 0xE6, 0xB0, 0xCC, 0x45, 0x99, 0x31, 0x0A, 0x42, 0xD1, 0xA0, 0xB8, 0x50, 0x58, 0x94, 0x2D,
0x94, 0x7A, 0xCA, 0x25, 0xCA, 0x38, 0x15, 0x43, 0xD5, 0xA1, 0x7A, 0x51, 0x13, 0xA8, 0x45, 0xD4,
0x6F, 0xA8, 0xFD, 0xD4, 0x19, 0x59, 0x19, 0xD9, 0x65, 0xB2, 0xA1, 0xB2, 0x59, 0xB2, 0x55, 0xB2,
0x67, 0x64, 0x47, 0x68, 0x08, 0x4D, 0x9B, 0xE6, 0x45, 0x4B, 0xA2, 0x95, 0xD0, 0x4E, 0xD0, 0x86,
0x68, 0xEF, 0x97, 0x28, 0x2F, 0x71, 0x5A, 0xC2, 0x59, 0xB2, 0x63, 0x49, 0xCB, 0x92, 0xC1, 0x25,
0x73, 0x72, 0x8A, 0x72, 0x8E, 0x72, 0x1C, 0xB9, 0x42, 0xB9, 0x56, 0xB9, 0x3B, 0x72, 0xEF, 0xE5,
0xE9, 0xF2, 0x6E, 0xF2, 0x89, 0xF2, 0xBB, 0xE5, 0x3B, 0xE4, 0x1F, 0x29, 0xA0, 0x14, 0xF4, 0x15,
0x02, 0x14, 0x32, 0x15, 0x0E, 0x2A, 0x5C, 0x52, 0x98, 0x56, 0xA4, 0x2A, 0xDA, 0x2A, 0xB2, 0x14,
0x0B, 0x15, 0x4F, 0x28, 0xDE, 0x57, 0x82, 0x95, 0xF4, 0x95, 0x02, 0x95, 0xD6, 0x29, 0x1D, 0x56,
0xEA, 0x53, 0x9A, 0x55, 0x56, 0x51, 0xF6, 0x50, 0x4E, 0x55, 0xDE, 0xAF, 0x7C, 0x51, 0x79, 0x5A,
0x85, 0xA6, 0xE2, 0xA8, 0x92, 0xA0, 0x52, 0xA6, 0x72, 0x56, 0x65, 0x4A, 0x95, 0xA2, 0x6A, 0xAF,
0xCA, 0x55, 0x2D, 0x53, 0x3D, 0xA7, 0xFA, 0x8C, 0x2E, 0x4B, 0x77, 0xA2, 0x27, 0xD1, 0x2B, 0xE8,
0x3D, 0xF4, 0x19, 0x35, 0x25, 0x35, 0x4F, 0x35, 0xA1, 0x5A, 0xAD, 0x5A, 0xBF, 0xDA, 0xBC, 0xBA,
0x8E, 0x7A, 0x88, 0x7A, 0x9E, 0x7A, 0xAB, 0xFA, 0x23, 0x0D, 0x82, 0x06, 0x43, 0x23, 0x56, 0xA3,
0x4C, 0xA3, 0x5B, 0x63, 0x46, 0x53, 0x55, 0xD3, 0x57, 0x33, 0x57, 0xB3, 0x59, 0xF3, 0xBE, 0x16,
0x5E, 0x8B, 0xA1, 0x15, 0xAF, 0xB5, 0x4F, 0xAB, 0x57, 0x6B, 0x4E, 0x5B, 0x47, 0x3B, 0x4C, 0x7B,
0x9B, 0x76, 0x87, 0xF6, 0xA4, 0x8E, 0x9C, 0x8E, 0x97, 0x4E, 0x8E, 0x4E, 0xB3, 0xCE, 0x43, 0x5D,
0xB2, 0xAE, 0x83, 0x6E, 0x9A, 0x6E, 0x9D, 0xEE, 0x6D, 0x3D, 0x8C, 0x1E, 0x43, 0x2F, 0x51, 0xEF,
0x80, 0xDE, 0x4D, 0x7D, 0x58, 0xDF, 0x42, 0x3F, 0x5E, 0xBF, 0x4A, 0xFF, 0x86, 0x01, 0x6C, 0x60,
0x69, 0xC0, 0x35, 0x38, 0x60, 0x30, 0xB0, 0x14, 0xBD, 0xD4, 0x7A, 0x29, 0x6F, 0x69, 0xDD, 0xD2,
0x61, 0x43, 0x92, 0xA1, 0x93, 0x61, 0x86, 0x61, 0xB3, 0xE1, 0xA8, 0x11, 0xCD, 0xC8, 0xC7, 0x28,
0xCF, 0xA8, 0xC3, 0xE8, 0x85, 0xB1, 0xA6, 0x71, 0x84, 0xF1, 0x6E, 0xE3, 0x5E, 0xE3, 0x4F, 0x26,
0x16, 0x26, 0x49, 0x26, 0xF5, 0x26, 0x0F, 0x4C, 0x65, 0x4C, 0x57, 0x98, 0xE6, 0x99, 0x76, 0x99,
0xFE, 0x6A, 0xA6, 0x6F, 0xC6, 0x32, 0xAB, 0x32, 0xBB, 0x6D, 0x4E, 0x36, 0x77, 0x37, 0xDF, 0x68,
0xDE, 0x69, 0xFE, 0x72, 0x99, 0xC1, 0x32, 0xCE, 0xB2, 0x83, 0xCB, 0xEE, 0x5A, 0x50, 0x2C, 0x7C,
0x2D, 0xB6, 0x59, 0x74, 0x5B, 0x7C, 0xB4, 0xB4, 0xB2, 0xE4, 0x5B, 0xB6, 0x58, 0x4E, 0x59, 0x69,
0x5A, 0x45, 0x5B, 0x55, 0x5B, 0x0D, 0x33, 0xA8, 0x0C, 0x7F, 0x46, 0x31, 0xE3, 0x8A, 0x35, 0xDA,
0xDA, 0xD9, 0x7A, 0xA3, 0xF5, 0x69, 0xEB, 0x77, 0x36, 0x96, 0x36, 0x02, 0x9B, 0x13, 0x36, 0xBF,
0xD8, 0x1A, 0xDA, 0x26, 0xDA, 0x36, 0xD9, 0x4E, 0x2E, 0xD7, 0x59, 0xCE, 0x59, 0x5E, 0xBF, 0x7C,
0xCC, 0x4E, 0xDD, 0x8E, 0x69, 0x57, 0x6B, 0x37, 0x62, 0x4F, 0xB7, 0x8F, 0xB6, 0x3F, 0x64, 0x3F,
0xE2, 0xA0, 0xE6, 0xC0, 0x74, 0xA8, 0x73, 0x78, 0xE2, 0xA8, 0xE1, 0xC8, 0x76, 0x6C, 0x70, 0x9C,
0x70, 0xD2, 0x73, 0x4A, 0x70, 0x3A, 0xE6, 0xF4, 0xC2, 0xD9, 0xC4, 0x99, 0xEF, 0xDC, 0xE6, 0x3C,
0xE7, 0x62, 0xE3, 0xB2, 0xDE, 0xE5, 0xBC, 0x2B, 0xE2, 0xEA, 0xE1, 0x5A, 0xE8, 0xDA, 0xEF, 0x26,
0xE3, 0x16, 0xE2, 0x56, 0xE9, 0xF6, 0xD8, 0x5D, 0xDD, 0x3D, 0xCE, 0xBD, 0xD9, 0x7D, 0xC6, 0xC3,
0xC2, 0x63, 0x9D, 0xC7, 0x79, 0x4F, 0xB4, 0xA7, 0xB7, 0xE7, 0x6E, 0xCF, 0x61, 0x2F, 0x65, 0x2F,
0x96, 0x57, 0xA3, 0xD7, 0xCC, 0x0A, 0xAB, 0x15, 0xEB, 0x57, 0xF4, 0x78, 0x93, 0xBC, 0x83, 0xBC,
0x2B, 0xBD, 0x9F, 0xF8, 0xE8, 0xFB, 0xF0, 0x7D, 0xBA, 0x7C, 0x61, 0xDF, 0x15, 0xBE, 0x7B, 0x7C,
0x1F, 0xAE, 0xD4, 0x5A, 0xC9, 0x5B, 0xD9, 0xE1, 0x07, 0xFC, 0xBC, 0xFC, 0xF6, 0xF8, 0x3D, 0xF2,
0xD7, 0xF1, 0x4F, 0xF3, 0xFF, 0x3E, 0x00, 0x13, 0xE0, 0x1F, 0x50, 0x15, 0xF0, 0x34, 0xD0, 0x34,
0x30, 0x37, 0xB0, 0x37, 0x88, 0x12, 0x14, 0x15, 0xD4, 0x14, 0xF4, 0x26, 0xD8, 0x39, 0xB8, 0x24,
0xF8, 0x41, 0x88, 0x6E, 0x88, 0x30, 0xA4, 0x3B, 0x54, 0x32, 0x34, 0x32, 0xB4, 0x31, 0x74, 0x2E,
0xCC, 0x35, 0xAC, 0x34, 0x6C, 0x64, 0x95, 0xF1, 0xAA, 0xF5, 0xAB, 0xAE, 0x87, 0x2B, 0x84, 0x73,
0xC3, 0x3B, 0x23, 0xB0, 0x11, 0xA1, 0x11, 0x0D, 0x11, 0xB3, 0xAB, 0xDD, 0x56, 0xEF, 0x5D, 0x3D,
0x1E, 0x69, 0x11, 0x59, 0x10, 0x39, 0xB4, 0x46, 0x67, 0x4D, 0xD6, 0x9A, 0xAB, 0x6B, 0x15, 0xD6,
0x26, 0xAD, 0x3D, 0x13, 0x25, 0x19, 0xC5, 0x8C, 0x3A, 0x19, 0x8D, 0x8E, 0x0E, 0x8B, 0x6E, 0x8A,
0xFE, 0xC0, 0xF4, 0x63, 0xD6, 0x31, 0x67, 0x63, 0xBC, 0x62, 0xAA, 0x63, 0x66, 0x58, 0x2E, 0xAC,
0x7D, 0xAC, 0xE7, 0x6C, 0x47, 0x76, 0x19, 0x7B, 0x8A, 0x63, 0xC7, 0x29, 0xE5, 0x4C, 0xC4, 0xDA,
0xC5, 0x96, 0xC6, 0x4E, 0xC6, 0xD9, 0xC5, 0xED, 0x89, 0x9B, 0x8A, 0x77, 0x88, 0x2F, 0x8F, 0x9F,
0xE6, 0xBA, 0x70, 0x2B, 0xB9, 0x2F, 0x13, 0x3C, 0x13, 0x6A, 0x12, 0xE6, 0x12, 0xFD, 0x12, 0x8F,
0x24, 0x2E, 0x24, 0x85, 0x25, 0xB5, 0x26, 0xE3, 0x92, 0xA3, 0x93, 0x4F, 0xF1, 0x64, 0x78, 0x89,
0xBC, 0x9E, 0x14, 0x95, 0x94, 0xAC, 0x94, 0x81, 0x54, 0x83, 0xD4, 0x82, 0xD4, 0x91, 0x34, 0x9B,
0xB4, 0xBD, 0x69, 0x33, 0x7C, 0x6F, 0x7E, 0x43, 0x3A, 0x94, 0xBE, 0x26, 0xBD, 0x53, 0x40, 0x15,
0xFD, 0x4C, 0xF5, 0x09, 0x75, 0x85, 0x5B, 0x85, 0xA3, 0x19, 0xF6, 0x19, 0x55, 0x19, 0x6F, 0x33,
0x43, 0x33, 0x4F, 0x66, 0x49, 0x67, 0xF1, 0xB2, 0xFA, 0xB2, 0xF5, 0xB3, 0x77, 0x64, 0x4F, 0xE4,
0xB8, 0xE7, 0x7C, 0xBD, 0x0E, 0xB5, 0x8E, 0xB5, 0xAE, 0x3B, 0x57, 0x2D, 0x77, 0x73, 0xEE, 0xE8,
0x7A, 0xA7, 0xF5, 0xB5, 0x1B, 0xA0, 0x0D, 0x31, 0x1B, 0xBA, 0x37, 0x6A, 0x6C, 0xCC, 0xDF, 0x38,
0xBE, 0xC9, 0x63, 0xD3, 0xD1, 0xCD, 0x84, 0xCD, 0x89, 0x9B, 0x7F, 0xC8, 0x33, 0xC9, 0x2B, 0xCD,
0x7B, 0xBD, 0x25, 0x6C, 0x4B, 0x57, 0xBE, 0x72, 0xFE, 0xA6, 0xFC, 0xB1, 0xAD, 0x1E, 0x5B, 0x9B,
0x0B, 0x24, 0x0A, 0xF8, 0x05, 0xC3, 0xDB, 0x6C, 0xB7, 0xD5, 0x6C, 0x47, 0x6D, 0xE7, 0x6E, 0xEF,
0xDF, 0x61, 0xBE, 0x63, 0xFF, 0x8E, 0x4F, 0x85, 0xEC, 0xC2, 0x6B, 0x45, 0x26, 0x45, 0xE5, 0x45,
0x1F, 0x8A, 0x59, 0xC5, 0xD7, 0xBE, 0x32, 0xFD, 0xAA, 0xE2, 0xAB, 0x85, 0x9D, 0xB1, 0x3B, 0xFB,
0x4B, 0x2C, 0x4B, 0x0E, 0xEE, 0xC2, 0xEC, 0xE2, 0xED, 0x1A, 0xDA, 0xED, 0xB0, 0xFB, 0x68, 0xA9,
0x74, 0x69, 0x4E, 0xE9, 0xD8, 0x1E, 0xDF, 0x3D, 0xED, 0x65, 0xF4, 0xB2, 0xC2, 0xB2, 0xD7, 0x7B,
0xA3, 0xF6, 0x5E, 0x2D, 0x5F, 0x56, 0x5E, 0xB3, 0x8F, 0xB0, 0x4F, 0xB8, 0x6F, 0xA4, 0xC2, 0xA7,
0xA2, 0x73, 0xBF, 0xE6, 0xFE, 0x5D, 0xFB, 0x3F, 0x54, 0xC6, 0x57, 0xDE, 0xA9, 0x72, 0xAE, 0x6A,
0xAD, 0x56, 0xAA, 0xDE, 0x51, 0x3D, 0x77, 0x80, 0x7D, 0x60, 0xF0, 0xA0, 0xE3, 0xC1, 0x96, 0x1A,
0xE5, 0x9A, 0xA2, 0x9A, 0xF7, 0x87, 0xB8, 0x87, 0xEE, 0xD6, 0x7A, 0xD4, 0xB6, 0xD7, 0x69, 0xD7,
0x95, 0x1F, 0xC6, 0x1C, 0xCE, 0x38, 0xFC, 0xB4, 0x3E, 0xB4, 0xBE, 0xF7, 0x6B, 0xC6, 0xD7, 0x8D,
0x0D, 0x0A, 0x0D, 0x45, 0x0D, 0x1F, 0x8F, 0xF0, 0x8E, 0x8C, 0x1C, 0x0D, 0x3C, 0xDA, 0xD3, 0x68,
0xD5, 0xD8, 0xD8, 0xA4, 0xD4, 0x54, 0xD2, 0x0C, 0x37, 0x0B, 0x9B, 0xA7, 0x8E, 0x45, 0x1E, 0xBB,
0xF9, 0x8D, 0xEB, 0x37, 0x9D, 0x2D, 0x86, 0x2D, 0xB5, 0xAD, 0xB4, 0xD6, 0xA2, 0xE3, 0xE0, 0xB8,
0xF0, 0xF8, 0xB3, 0x6F, 0xA3, 0xBF, 0x1D, 0x3A, 0xE1, 0x7D, 0xA2, 0xFB, 0x24, 0xE3, 0x64, 0xCB,
0x77, 0x5A, 0xDF, 0x55, 0xB7, 0x51, 0xDA, 0x0A, 0xDB, 0xA1, 0xF6, 0xEC, 0xF6, 0x99, 0x8E, 0xF8,
0x8E, 0x91, 0xCE, 0xF0, 0xCE, 0x81, 0x53, 0x2B, 0x4E, 0x75, 0x77, 0xD9, 0x76, 0xB5, 0x7D, 0x6F,
0xF4, 0xFD, 0x91, 0xD3, 0x6A, 0xA7, 0xAB, 0xCE, 0xC8, 0x9E, 0x29, 0x39, 0x4B, 0x38, 0x9B, 0x7F,
0x76, 0xE1, 0x5C, 0xCE, 0xB9, 0xD9, 0xF3, 0xA9, 0xE7, 0xA7, 0x2F, 0xC4, 0x5D, 0x18, 0xEB, 0x8E,
0xEA, 0x7E, 0x70, 0x71, 0xD5, 0xC5, 0xDB, 0x3D, 0x01, 0x3D, 0xFD, 0x97, 0xBC, 0x2F, 0x5D, 0xB9,
0xEC, 0x7E, 0xF9, 0x62, 0xAF, 0x53, 0xEF, 0xB9, 0x2B, 0x76, 0x57, 0x4E, 0x5F, 0xB5, 0xB9, 0x7A,
0xEA, 0x1A, 0xE3, 0x5A, 0xC7, 0x75, 0xCB, 0xEB, 0xED, 0x7D, 0x16, 0x7D, 0x6D, 0x3F, 0x58, 0xFC,
0xD0, 0xD6, 0x6F, 0xD9, 0xDF, 0x7E, 0xC3, 0xEA, 0x46, 0xE7, 0x4D, 0xEB, 0x9B, 0x5D, 0x03, 0xCB,
0x07, 0xCE, 0x0E, 0x3A, 0x0C, 0x5E, 0xB8, 0xE5, 0x7A, 0xEB, 0xF2, 0x6D, 0xAF, 0xDB, 0xD7, 0xEF,
0xAC, 0xBC, 0x33, 0x30, 0x14, 0x32, 0x74, 0x77, 0x38, 0x72, 0x78, 0xE4, 0x2E, 0xFB, 0xEE, 0xE4,
0xBD, 0xA4, 0x7B, 0x2F, 0xEF, 0x67, 0xDC, 0x9F, 0x7F, 0xB0, 0xE9, 0x21, 0xFA, 0x61, 0xE1, 0x23,
0xA9, 0x47, 0xE5, 0x8F, 0x95, 0x1E, 0xD7, 0xFD, 0xA8, 0xF7, 0x63, 0xEB, 0x88, 0xE5, 0xC8, 0x99,
0x51, 0xD7, 0xD1, 0xBE, 0x27, 0x41, 0x4F, 0x1E, 0x8C, 0xB1, 0xC6, 0x9E, 0xFF, 0x94, 0xFE, 0xD3,
0x87, 0xF1, 0xFC, 0xA7, 0xE4, 0xA7, 0xE5, 0x13, 0xAA, 0x13, 0x8D, 0x93, 0x66, 0x93, 0xA7, 0xA7,
0xDC, 0xA7, 0x6E, 0x3E, 0x5B, 0xFD, 0x6C, 0xFC, 0x79, 0xEA, 0xF3, 0xF9, 0xE9, 0x82, 0x9F, 0xA5,
0x7F, 0xAE, 0x7E, 0xA1, 0xFB, 0xE2, 0xBB, 0x5F, 0x1C, 0x7F, 0xE9, 0x9B, 0x59, 0x35, 0x33, 0xFE,
0x92, 0xFF, 0x72, 0xE1, 0xD7, 0xE2, 0x57, 0xF2, 0xAF, 0x8E, 0xBC, 0x5E, 0xF6, 0xBA, 0x7B, 0xD6,
0x7F, 0xF6, 0xF1, 0x9B, 0xE4, 0x37, 0xF3, 0x73, 0x85, 0x6F, 0xE5, 0xDF, 0x1E, 0x7D, 0xC7, 0x78,
0xD7, 0xFB, 0x3E, 0xEC, 0xFD, 0xC4, 0x7C, 0xE6, 0x07, 0xEC, 0x87, 0x8A, 0x8F, 0x7A, 0x1F, 0xBB,
0x3E, 0x79, 0x7F, 0x7A, 0xB8, 0x90, 0xBC, 0xB0, 0xF0, 0x1B, 0xF7, 0x84, 0xF3, 0xFB, 0xE2, 0xE6,
0x1D, 0xC2, 0x00, 0x00, 0x00, 0x09, 0x70, 0x48, 0x59, 0x73, 0x00, 0x00, 0x0B, 0x11, 0x00, 0x00,
0x0B, 0x11, 0x01, 0x7F, 0x64, 0x5F, 0x91, 0x00, 0x00, 0x00, 0x19, 0x74, 0x45, 0x58, 0x74, 0x53,
0x6F, 0x66, 0x74, 0x77, 0x61, 0x72, 0x65, 0x00, 0x70, 0x61, 0x69, 0x6E, 0x74, 0x2E, 0x6E, 0x65,
0x74, 0x20, 0x34, 0x2E, 0x30, 0x2E, 0x32, 0x31, 0xF1, 0x20, 0x69, 0x95, 0x00, 0x00, 0x25, 0x47,
0x49, 0x44, 0x41, 0x54, 0x68, 0x43, 0xE5, 0x7A, 0x67, 0x58, 0x14, 0xD9, 0xB6, 0xF6, 0x6A, 0xCC,
0x91, 0xD4, 0xDD, 0x74, 0xEE, 0xA6, 0xC9, 0x2A, 0x08, 0x88, 0x80, 0x28, 0x88, 0x12, 0x4C, 0x60,
0x16, 0x15, 0x13, 0x28, 0x2A, 0x2A, 0x62, 0x16, 0x05, 0x13, 0x28, 0x3A, 0x8E, 0x61, 0xCC, 0x11,
0xB3, 0x63, 0x8E, 0x28, 0xA2, 0x28, 0x08, 0x4A, 0xCE, 0x19, 0x54, 0x4C, 0xE4, 0xA4, 0x60, 0x9A,
0xE4, 0xCC, 0xAC, 0xBB, 0x76, 0xA1, 0x73, 0x3C, 0xE7, 0x78, 0xCF, 0x33, 0xF7, 0xBB, 0x3E, 0xF7,
0xCF, 0xF7, 0xE3, 0x7D, 0xAA, 0x7A, 0x57, 0x75, 0xD5, 0x7E, 0x57, 0x78, 0xD7, 0x5A, 0x34, 0xF0,
0xAC, 0x34, 0xFE, 0x2F, 0x94, 0x97, 0xC6, 0x42, 0x65, 0x51, 0x0C, 0x54, 0x16, 0xDE, 0x69, 0x55,
0x9E, 0x7B, 0xAB, 0x0D, 0x01, 0xAA, 0x0A, 0xEF, 0x11, 0xEE, 0x42, 0x55, 0x6E, 0x64, 0xEB, 0xBA,
0xC2, 0x9B, 0xAD, 0x9F, 0x66, 0x5D, 0x81, 0x47, 0xF9, 0x31, 0xB0, 0x2A, 0x78, 0x29, 0x6C, 0xD9,
0xB0, 0x9C, 0x7F, 0x72, 0xDF, 0x3A, 0xBB, 0xB0, 0xA0, 0x19, 0xF3, 0x02, 0x67, 0x8D, 0x0F, 0x5A,
0x34, 0xDB, 0x6B, 0xF9, 0xF2, 0x80, 0x09, 0xCB, 0xD6, 0xAF, 0x0C, 0x18, 0x75, 0x74, 0xD7, 0x77,
0x26, 0x99, 0xF1, 0xD7, 0x85, 0xE3, 0xC6, 0x8E, 0x84, 0xC5, 0xF3, 0x67, 0xC3, 0x70, 0x8F, 0x41,
0xF0, 0x4B, 0x5D, 0x26, 0x7C, 0xA8, 0xCE, 0x84, 0x9A, 0xD2, 0x7B, 0x1A, 0xCF, 0xF3, 0xA2, 0x34,
0x5E, 0x16, 0xDF, 0x85, 0x97, 0x8F, 0xE3, 0xE0, 0x71, 0xFA, 0x59, 0xDE, 0xD3, 0xAC, 0xCB, 0xAD,
0x5F, 0xE6, 0xDD, 0xE4, 0x55, 0x97, 0xC6, 0x41, 0xDD, 0xA3, 0x04, 0xA8, 0x28, 0xBC, 0xC5, 0xAB,
0x2E, 0x8C, 0x6A, 0xF7, 0xAE, 0x34, 0x81, 0x5B, 0xAB, 0xA1, 0x7D, 0x94, 0xE7, 0x5C, 0x6F, 0x5B,
0x99, 0x1F, 0xD5, 0xB1, 0xBA, 0x30, 0x06, 0x6A, 0x8B, 0xEF, 0x43, 0x5D, 0x49, 0x3C, 0xD4, 0x14,
0xC4, 0xF0, 0x6A, 0xF2, 0x6E, 0xF0, 0xEA, 0x8A, 0xEE, 0x41, 0x7D, 0x49, 0x22, 0xD4, 0xE5, 0x9E,
0x81, 0xBA, 0xF4, 0x70, 0xC2, 0x9A, 0xB6, 0x35, 0xF7, 0x9C, 0x5A, 0x57, 0xC6, 0x79, 0xC0, 0x89,
0x60, 0x63, 0x58, 0x3B, 0x41, 0xAB, 0xD5, 0x48, 0x5B, 0x53, 0x8D, 0x2F, 0x09, 0xF3, 0x88, 0x30,
0xAF, 0xBC, 0xE4, 0x2E, 0x94, 0x17, 0x44, 0x69, 0x3C, 0xCB, 0xB9, 0xD6, 0xEA, 0x65, 0xDE, 0x75,
0xA8, 0xA6, 0x07, 0x55, 0x17, 0xC5, 0xF0, 0xDE, 0x3D, 0xBB, 0xC3, 0xBB, 0x78, 0x6C, 0x0B, 0x2C,
0x9D, 0x3F, 0x0B, 0x66, 0xFB, 0xF9, 0x1A, 0xFB, 0xF9, 0x4E, 0x5A, 0x33, 0xCC, 0xB5, 0x7F, 0x52,
0x6F, 0x2B, 0x8B, 0x06, 0xB5, 0xBE, 0x21, 0x1A, 0x2A, 0x0D, 0xD0, 0x50, 0x45, 0x47, 0x95, 0x1A,
0xCD, 0x8C, 0x0C, 0x7F, 0x73, 0xB0, 0xB5, 0x79, 0x3E, 0xDA, 0xD3, 0x33, 0xD5, 0xC5, 0xB9, 0xEF,
0x16, 0xFF, 0x19, 0x93, 0x3D, 0x3C, 0x3D, 0x06, 0xB7, 0x3B, 0xBC, 0x3B, 0x14, 0x1E, 0xA5, 0x47,
0xC2, 0xCF, 0x35, 0x69, 0x1A, 0x55, 0x8F, 0x63, 0x79, 0x95, 0x4F, 0xE2, 0xBE, 0x24, 0x4C, 0xEF,
0xFB, 0x44, 0xF8, 0xF1, 0x03, 0x5E, 0x55, 0x7E, 0x24, 0xAF, 0x36, 0xF7, 0x5A, 0xEB, 0x0F, 0x25,
0xF7, 0x69, 0x2D, 0x96, 0x57, 0x5B, 0x4C, 0xE4, 0x4A, 0xEE, 0xB6, 0xAA, 0x29, 0xBA, 0xDD, 0xA6,
0x86, 0x9C, 0xF2, 0x89, 0x30, 0xEF, 0x4B, 0xC2, 0x0D, 0xC5, 0xF1, 0xBC, 0x3A, 0xE2, 0x52, 0x5B,
0x16, 0x0B, 0xAF, 0xF3, 0x8F, 0x6A, 0xD4, 0xC6, 0x0F, 0x6F, 0xDF, 0x98, 0x3A, 0x85, 0xF7, 0x22,
0x6E, 0x1E, 0x6C, 0xF3, 0x05, 0x8D, 0x40, 0x0F, 0x61, 0xEB, 0x2F, 0x09, 0x73, 0x1E, 0xFE, 0x44,
0x18, 0x2A, 0xF2, 0x6F, 0x40, 0xD2, 0xED, 0xD3, 0x50, 0x9C, 0x72, 0x13, 0x0A, 0x12, 0xAF, 0xC1,
0xA5, 0xA3, 0xBB, 0x21, 0x78, 0xF1, 0x9C, 0xD6, 0x93, 0x27, 0x7A, 0xF9, 0x99, 0x9B, 0x99, 0x3C,
0x55, 0x48, 0xE4, 0xD8, 0xA9, 0x9D, 0x08, 0xBB, 0xB4, 0x17, 0xA3, 0x50, 0x4B, 0x8C, 0x62, 0x81,
0x14, 0x45, 0x02, 0x09, 0x0A, 0x74, 0x64, 0xA8, 0xD3, 0x85, 0xAE, 0xB5, 0x17, 0x60, 0xC7, 0x76,
0x3A, 0x28, 0x15, 0xCA, 0xB0, 0x87, 0xA1, 0xE9, 0x9B, 0xDE, 0x36, 0xE6, 0x77, 0x5C, 0x06, 0xD8,
0x8F, 0xF1, 0xF7, 0x99, 0x08, 0x07, 0x76, 0xAC, 0x85, 0x6D, 0x1B, 0x96, 0x40, 0xF4, 0x95, 0x03,
0x50, 0xF9, 0x34, 0x9E, 0x11, 0x06, 0x22, 0x0C, 0x44, 0x18, 0x3E, 0x11, 0x06, 0x22, 0x0C, 0x44,
0x18, 0x88, 0x30, 0x54, 0x97, 0xC4, 0x42, 0x0D, 0x11, 0xAC, 0x79, 0x42, 0x20, 0x03, 0xD5, 0xD0,
0x3E, 0xBF, 0xF0, 0x30, 0x10, 0x61, 0xA8, 0x2F, 0x8C, 0x85, 0x3A, 0xFA, 0x6E, 0xD5, 0xF3, 0x3B,
0x50, 0xF1, 0x82, 0xDD, 0x7F, 0x1C, 0x1A, 0x33, 0x96, 0xB5, 0x7E, 0x95, 0xB3, 0xBE, 0xD3, 0x87,
0xE2, 0xEF, 0x34, 0x62, 0xF7, 0x59, 0xF2, 0x16, 0x7A, 0x80, 0x06, 0x3C, 0xA7, 0x2F, 0x7D, 0x46,
0x05, 0x3D, 0xA4, 0xB2, 0x98, 0x6E, 0x2E, 0x8A, 0x85, 0xE6, 0x47, 0xF7, 0x20, 0x39, 0xFA, 0x3C,
0x2C, 0x5F, 0x30, 0x17, 0x7C, 0x26, 0x8E, 0x87, 0x7D, 0x9B, 0x37, 0x2B, 0x46, 0x0D, 0x73, 0xBD,
0x28, 0x15, 0xC9, 0x51, 0xB3, 0x83, 0x0C, 0x95, 0x62, 0x19, 0x3A, 0x3B, 0x4A, 0x70, 0xD6, 0x74,
0x19, 0x86, 0xAD, 0x96, 0xE2, 0x0F, 0x5B, 0xC5, 0xB8, 0xF3, 0x07, 0x21, 0x6E, 0xDA, 0x20, 0xC6,
0xE5, 0x4B, 0x64, 0x38, 0x65, 0xA2, 0x1A, 0xFB, 0xDA, 0x29, 0x51, 0x2E, 0x92, 0xA0, 0x76, 0x27,
0x39, 0x8A, 0xB4, 0x65, 0x68, 0x6E, 0xA2, 0xFE, 0xDD, 0xA9, 0x8F, 0xC3, 0xC9, 0x80, 0x39, 0x53,
0x8C, 0x83, 0x16, 0xF8, 0x40, 0xA0, 0xDF, 0x14, 0xF0, 0x1E, 0x3B, 0x1C, 0x9E, 0x64, 0x46, 0x52,
0x1A, 0xC5, 0x90, 0x91, 0xEF, 0x52, 0x28, 0x33, 0x82, 0xF1, 0x50, 0x99, 0x17, 0x09, 0x75, 0x05,
0xB7, 0xA1, 0x9E, 0xED, 0xA7, 0x94, 0x11, 0x25, 0x72, 0xA5, 0x71, 0xBC, 0x9A, 0x47, 0x71, 0x50,
0xFB, 0xA8, 0xE5, 0x1E, 0x0E, 0x85, 0xB7, 0xE9, 0x7B, 0x37, 0xA1, 0xB2, 0x84, 0xC8, 0x3E, 0x8A,
0x85, 0x8A, 0x27, 0xD1, 0x50, 0x59, 0x76, 0x9B, 0x57, 0xFE, 0x3C, 0x96, 0x57, 0x5F, 0x7A, 0x06,
0x9A, 0x0B, 0xB6, 0x74, 0xFA, 0xA5, 0x74, 0x7D, 0x9B, 0x92, 0x48, 0x0F, 0x98, 0x37, 0x44, 0x03,
0x28, 0x67, 0xE9, 0xE1, 0x5F, 0xA0, 0xBA, 0x88, 0x1E, 0x56, 0x18, 0xCB, 0x7B, 0xF7, 0x24, 0x8E,
0x97, 0x1D, 0x7B, 0x19, 0x16, 0x07, 0xCC, 0x86, 0x71, 0x23, 0x3D, 0xFA, 0x0D, 0x73, 0x77, 0xCF,
0xD2, 0xEC, 0x2C, 0x44, 0x03, 0xA5, 0x1C, 0x67, 0x12, 0xC9, 0x53, 0x27, 0x25, 0x98, 0x96, 0xDC,
0x15, 0x8B, 0xF3, 0xF8, 0x58, 0x52, 0xAC, 0x8D, 0x25, 0x85, 0x2D, 0x28, 0x2D, 0xD2, 0xC5, 0xD2,
0x42, 0x1D, 0x2C, 0xCC, 0x15, 0x62, 0x62, 0x02, 0x1F, 0x8F, 0x46, 0xF0, 0x71, 0xBA, 0x8F, 0x18,
0xBB, 0x1B, 0xA9, 0x51, 0xA0, 0xA9, 0x42, 0x11, 0x5F, 0x84, 0xFD, 0x1D, 0xAC, 0x9E, 0x07, 0xCC,
0x98, 0x38, 0x65, 0xE1, 0xAC, 0x69, 0x30, 0x62, 0x88, 0x2B, 0x94, 0x65, 0xD1, 0x86, 0x29, 0x47,
0x19, 0xE1, 0x97, 0x05, 0xF7, 0xA1, 0x82, 0xED, 0x85, 0x23, 0x1C, 0x03, 0x75, 0x8C, 0x30, 0x47,
0x90, 0x88, 0x66, 0xDF, 0xE1, 0xD5, 0xE5, 0xDE, 0x86, 0x3A, 0x32, 0x4E, 0x75, 0x49, 0xC2, 0xBF,
0x10, 0xBE, 0x0F, 0x55, 0x14, 0x09, 0x2F, 0x33, 0x22, 0x79, 0x2F, 0xB2, 0xAE, 0xF2, 0x2A, 0x89,
0x7C, 0x6D, 0x49, 0x14, 0x34, 0x3D, 0x3E, 0xAE, 0xD1, 0x94, 0xE1, 0xDF, 0xEE, 0x7D, 0xB6, 0x2F,
0x44, 0xED, 0x76, 0xFC, 0x37, 0xC2, 0xBC, 0x06, 0x0A, 0xA7, 0x0F, 0x2F, 0x92, 0x5A, 0x95, 0x26,
0x9E, 0x87, 0xC3, 0xBB, 0xB7, 0xC0, 0xAA, 0xA5, 0x81, 0x63, 0x95, 0x72, 0x75, 0xBD, 0x66, 0x67,
0x31, 0x7A, 0x8D, 0x94, 0xE0, 0x95, 0x0B, 0x7A, 0x58, 0x94, 0x2F, 0x20, 0x92, 0x7C, 0x2C, 0xC8,
0x16, 0x62, 0x56, 0xAA, 0x36, 0xA6, 0x26, 0xEB, 0x60, 0x5A, 0x8A, 0x36, 0xA6, 0xA7, 0xD0, 0x91,
0xCE, 0xD9, 0x31, 0x3B, 0x55, 0x17, 0x0B, 0xE9, 0xFA, 0x23, 0x32, 0x46, 0x21, 0x19, 0xE5, 0xCA,
0x25, 0x2D, 0x9C, 0x34, 0x49, 0x84, 0x0A, 0x91, 0x21, 0x6A, 0xD3, 0xB3, 0x2C, 0x4C, 0x4C, 0x3E,
0xCC, 0x9A, 0xE4, 0x35, 0x6B, 0x8C, 0xC7, 0x60, 0x28, 0x4A, 0xBE, 0x08, 0x95, 0xF9, 0x77, 0x5A,
0x57, 0x15, 0xDC, 0xE3, 0x71, 0x84, 0x29, 0x5F, 0x2B, 0xF3, 0xAE, 0x6B, 0x54, 0xE7, 0xDD, 0xE8,
0x50, 0x5F, 0x14, 0x4B, 0x5E, 0x6D, 0x09, 0xEB, 0xEA, 0xEC, 0x1B, 0x6D, 0x6A, 0xF2, 0xA2, 0xDA,
0xD7, 0x16, 0xDE, 0x61, 0x84, 0x79, 0x44, 0x98, 0x84, 0xED, 0x76, 0x6B, 0x22, 0xDC, 0x86, 0x08,
0xF3, 0x88, 0x30, 0xEF, 0x65, 0xCE, 0x0D, 0x78, 0x9E, 0x7E, 0xB9, 0x6D, 0x55, 0x61, 0x4C, 0xAB,
0xCA, 0xE2, 0x04, 0xCA, 0xE9, 0x2B, 0x64, 0xA4, 0x4D, 0xED, 0xAB, 0x12, 0xBC, 0x5A, 0x35, 0x65,
0x4C, 0x03, 0x0A, 0x93, 0x07, 0x1C, 0x6A, 0x4B, 0x1F, 0x72, 0xA4, 0x4B, 0xD3, 0xA2, 0x20, 0x37,
0xF6, 0x02, 0xCC, 0x9D, 0xEE, 0xDB, 0xCE, 0x77, 0xF2, 0xC4, 0x55, 0x6A, 0x99, 0xC9, 0x4F, 0x0A,
0x89, 0x1E, 0x86, 0xAF, 0x93, 0x63, 0x7E, 0xAE, 0x0E, 0x16, 0x17, 0x10, 0xC9, 0x74, 0x5D, 0xCC,
0x60, 0x04, 0x93, 0x84, 0x98, 0x91, 0xAC, 0x8D, 0x19, 0x44, 0x2E, 0x83, 0x88, 0x33, 0xA4, 0xA7,
0xE8, 0x12, 0x79, 0x42, 0xB2, 0xE0, 0x2F, 0x23, 0x64, 0xA7, 0x0B, 0x89, 0x34, 0x11, 0x2F, 0xE8,
0x84, 0xDB, 0xB6, 0xF0, 0xD1, 0xD4, 0x40, 0x8D, 0x3A, 0x9D, 0x95, 0x24, 0x70, 0x06, 0x1F, 0xFA,
0xDA, 0xF6, 0xF6, 0x09, 0x5B, 0x31, 0x0F, 0x9E, 0x64, 0x5C, 0x87, 0x17, 0x79, 0xE4, 0xAD, 0xC2,
0x04, 0xF2, 0x16, 0xA9, 0x34, 0x09, 0x66, 0x55, 0xCE, 0x15, 0x8D, 0xC6, 0x22, 0x96, 0xB3, 0x2D,
0x61, 0xDC, 0x58, 0x72, 0x4F, 0xA3, 0xBA, 0x30, 0x9A, 0x57, 0xD5, 0x42, 0xF8, 0xB3, 0x87, 0x79,
0x44, 0x98, 0xF7, 0x97, 0x87, 0x19, 0xE1, 0xCC, 0x2B, 0x1A, 0x55, 0x24, 0xB4, 0x55, 0x5C, 0xDE,
0x5F, 0xA1, 0xDC, 0xDE, 0xDB, 0xBA, 0x36, 0xD1, 0xAB, 0x4D, 0xCD, 0x83, 0x31, 0x00, 0x85, 0x29,
0x37, 0x38, 0x14, 0x13, 0xD1, 0xAC, 0x84, 0xAB, 0xB0, 0x25, 0x3C, 0x14, 0x7C, 0xA7, 0x4C, 0xE9,
0xE2, 0xD6, 0x7F, 0xE0, 0x61, 0xA1, 0x2E, 0x09, 0x8E, 0xA9, 0x08, 0xCF, 0x9C, 0xD4, 0x23, 0x4F,
0x69, 0x11, 0x51, 0x2D, 0x4C, 0x4F, 0x26, 0x72, 0xC9, 0x7C, 0x4C, 0x27, 0x72, 0x69, 0x1C, 0x41,
0x22, 0xFD, 0x89, 0xD8, 0x3F, 0xC0, 0x0C, 0x42, 0xA4, 0x3F, 0x19, 0x20, 0x23, 0x4D, 0x93, 0xBE,
0xA7, 0x4D, 0xDF, 0xA7, 0xC8, 0x28, 0xD2, 0xC4, 0x8B, 0x3F, 0xEA, 0x61, 0x9F, 0x5E, 0x0A, 0xD4,
0xD5, 0x91, 0xA2, 0x89, 0x5A, 0xF5, 0x76, 0xF2, 0xB8, 0x51, 0xBE, 0x17, 0x7F, 0xDC, 0x01, 0xD9,
0x29, 0xE7, 0xA1, 0x98, 0x54, 0xFC, 0x19, 0xCB, 0x65, 0x12, 0xAD, 0x8A, 0xDC, 0xCB, 0x50, 0x5D,
0x70, 0x8B, 0x13, 0xB2, 0x5A, 0x2E, 0x77, 0xE3, 0x78, 0x15, 0x4C, 0x54, 0x4B, 0x62, 0x88, 0x5C,
0x4B, 0x1E, 0x57, 0x51, 0x9E, 0x57, 0xE4, 0x7E, 0x0A, 0x69, 0xBA, 0x8F, 0x23, 0x9C, 0x71, 0x99,
0x4A, 0xE9, 0x1D, 0xBA, 0x87, 0xAE, 0x97, 0x5E, 0x84, 0xAA, 0xE2, 0x88, 0x56, 0x55, 0x19, 0x21,
0x9D, 0xAA, 0xB2, 0xD6, 0x68, 0xC0, 0xDD, 0xEB, 0xC7, 0x39, 0xDC, 0x8B, 0x64, 0xC7, 0x93, 0xB0,
0xE7, 0x87, 0xCD, 0xED, 0x47, 0x0F, 0x1B, 0x7E, 0x90, 0xE5, 0x9B, 0x95, 0xB9, 0x18, 0x2F, 0x5E,
0x96, 0xE0, 0xE3, 0x52, 0x22, 0x9B, 0x4A, 0x9B, 0x26, 0x32, 0x2D, 0x9E, 0xFC, 0x7C, 0xD4, 0xFA,
0xE2, 0xFC, 0x6B, 0x60, 0xD7, 0xFE, 0xF1, 0x9D, 0x74, 0x32, 0x0C, 0x3B, 0x2F, 0x2B, 0xD5, 0xC6,
0x1B, 0xD7, 0x04, 0x68, 0x6B, 0xA9, 0xC6, 0xAE, 0x1D, 0xC4, 0x64, 0x54, 0xD3, 0x37, 0xA7, 0x0E,
0x87, 0x0F, 0x29, 0x48, 0xBF, 0x04, 0xC9, 0xF7, 0x4F, 0x40, 0x51, 0xFA, 0x45, 0xAA, 0x14, 0x57,
0xC9, 0xE3, 0x57, 0xE0, 0x79, 0xDE, 0x25, 0xCA, 0xEB, 0x1B, 0x54, 0x41, 0xA8, 0x0E, 0x97, 0xDE,
0xA3, 0xB2, 0x19, 0xC3, 0x11, 0xAE, 0x28, 0xE6, 0xFA, 0x05, 0x32, 0x0C, 0x11, 0xCE, 0xA6, 0xAA,
0x92, 0x73, 0x93, 0xA2, 0x22, 0x9A, 0xCB, 0xE7, 0x0A, 0x52, 0x6D, 0xAA, 0xD7, 0x9C, 0xA1, 0xAA,
0x1F, 0xDD, 0x86, 0xEA, 0x94, 0x75, 0xBC, 0x9A, 0xA4, 0x15, 0x1A, 0x35, 0xF1, 0x7E, 0x00, 0x71,
0x37, 0x4F, 0x72, 0x88, 0xBF, 0x75, 0x0A, 0x1E, 0xDE, 0x39, 0x07, 0xCB, 0x16, 0xCE, 0x0F, 0xD3,
0xE9, 0xA2, 0xC0, 0xEE, 0x06, 0x72, 0xBC, 0x40, 0xF9, 0xCA, 0xC8, 0x66, 0x70, 0x5E, 0xFB, 0x92,
0xC8, 0xFF, 0x12, 0x29, 0x5A, 0x58, 0xF6, 0x48, 0x17, 0xCF, 0x9D, 0x15, 0xA1, 0xA9, 0xA1, 0x3E,
0x76, 0x6C, 0xAB, 0x8B, 0x23, 0x87, 0x38, 0xE7, 0xDE, 0x8D, 0xDC, 0xA3, 0xB8, 0x7B, 0xEB, 0x04,
0x94, 0xD0, 0xE6, 0xCB, 0xF3, 0x2F, 0x10, 0xE1, 0xCB, 0xAD, 0x19, 0x69, 0x86, 0x2A, 0x22, 0x58,
0x45, 0x21, 0xFD, 0x32, 0xFF, 0x86, 0xC6, 0x0B, 0x2A, 0x57, 0xE5, 0x54, 0xC2, 0x2A, 0xF2, 0x19,
0x41, 0x0A, 0xE9, 0xEC, 0x28, 0x8D, 0xF2, 0x0C, 0x5A, 0xCB, 0x22, 0xB5, 0xA7, 0x92, 0x5A, 0x5D,
0x14, 0xCD, 0xE3, 0x08, 0x97, 0xDC, 0xA3, 0x90, 0x4E, 0x80, 0xDA, 0x87, 0x4B, 0xA1, 0x36, 0x6E,
0x46, 0x87, 0xDA, 0x68, 0xCF, 0xB6, 0x70, 0x8F, 0xC8, 0x32, 0xC4, 0x47, 0x9F, 0x81, 0x03, 0x3F,
0x84, 0x7B, 0x1A, 0xA9, 0x4D, 0xDF, 0x8A, 0x84, 0x42, 0x3C, 0xB0, 0x9F, 0xD4, 0xB7, 0x48, 0x1B,
0x33, 0x39, 0x11, 0x62, 0xDE, 0x65, 0x9B, 0x65, 0x1E, 0xFD, 0x97, 0xCD, 0xFF, 0xBF, 0x80, 0x7B,
0x1E, 0xA9, 0x79, 0x91, 0x16, 0xFE, 0xB0, 0x8D, 0x09, 0x99, 0x1A, 0x75, 0xBB, 0x8A, 0x30, 0x28,
0x70, 0xF2, 0x99, 0xB8, 0x3B, 0xA7, 0x20, 0x3F, 0x3B, 0x86, 0x3C, 0x7B, 0x99, 0xF7, 0x22, 0xFF,
0x6A, 0xFB, 0xE7, 0x9C, 0x97, 0x09, 0xD9, 0x97, 0x18, 0xDA, 0x3C, 0xCF, 0xB9, 0xD4, 0xFE, 0x79,
0xCE, 0x45, 0xAA, 0xD9, 0x14, 0xF2, 0xCC, 0xBB, 0xF9, 0xB7, 0x5A, 0x95, 0x67, 0xDF, 0x68, 0x55,
0x4E, 0xA5, 0x8D, 0x0B, 0x6D, 0x22, 0x4C, 0x68, 0x4D, 0x5E, 0xD6, 0xA8, 0xA6, 0xF0, 0xAF, 0x79,
0xF2, 0x00, 0x2A, 0x73, 0x23, 0x79, 0x95, 0x99, 0xA7, 0x3A, 0xD5, 0xDC, 0x0F, 0x6C, 0x03, 0x77,
0x6E, 0x9E, 0x86, 0x18, 0x02, 0x1D, 0xF9, 0xFD, 0xFA, 0x38, 0x16, 0x77, 0x6D, 0x27, 0xC0, 0xE5,
0x81, 0x72, 0x22, 0xDB, 0x22, 0x44, 0x69, 0x9C, 0x77, 0xF9, 0x98, 0xF9, 0xAD, 0xC8, 0xD2, 0x73,
0xD2, 0xD2, 0x28, 0xCC, 0x49, 0xD4, 0x32, 0xE9, 0x58, 0x40, 0x25, 0x6C, 0xF6, 0x0C, 0x09, 0x6A,
0x76, 0x55, 0xA2, 0x52, 0x24, 0xFE, 0x75, 0xDF, 0x8E, 0x55, 0x93, 0x72, 0x72, 0x13, 0xE1, 0x09,
0xF3, 0x62, 0x51, 0x14, 0xEF, 0x33, 0xE1, 0xB2, 0xAC, 0xB3, 0x0C, 0xBC, 0xB2, 0xEC, 0x73, 0xBC,
0xA7, 0xD9, 0x67, 0xE1, 0x45, 0xEE, 0x55, 0xF2, 0x72, 0x34, 0x21, 0x8A, 0xF7, 0x32, 0x3B, 0x92,
0xF7, 0xD9, 0xBB, 0x0C, 0x94, 0xFF, 0xBC, 0xF2, 0x1C, 0x16, 0x15, 0xB7, 0xA1, 0xA6, 0xEC, 0x21,
0x94, 0x17, 0xA6, 0x42, 0x4D, 0xC6, 0x1E, 0x5E, 0x53, 0x74, 0x4F, 0x80, 0xCD, 0xA1, 0xAB, 0x20,
0x62, 0xCF, 0x56, 0x58, 0x32, 0xDF, 0xFF, 0xFB, 0xCE, 0x1D, 0x25, 0xE8, 0x68, 0x2B, 0xC7, 0xC4,
0x78, 0x29, 0x16, 0xE4, 0x7D, 0x99, 0xB3, 0xDF, 0x18, 0xEC, 0xB9, 0x9C, 0x21, 0x75, 0xB0, 0xA8,
0x40, 0x1B, 0xE3, 0xEF, 0x0B, 0xD1, 0xAE, 0x97, 0x3E, 0x76, 0x68, 0x2B, 0xC0, 0x61, 0x6E, 0xCE,
0x79, 0x31, 0x37, 0xAF, 0x09, 0xEF, 0xDD, 0xBA, 0x06, 0x65, 0xD9, 0xD1, 0x50, 0x4D, 0x5E, 0xAC,
0xA7, 0xEE, 0xAA, 0xF1, 0x49, 0xFC, 0x5F, 0x78, 0x55, 0x96, 0x40, 0xCA, 0x4B, 0x5D, 0x21, 0x47,
0xF8, 0x16, 0xF5, 0xD8, 0x94, 0xE3, 0xD9, 0x94, 0xB7, 0x24, 0x70, 0x0C, 0x5C, 0x1E, 0xE7, 0x92,
0xCA, 0x93, 0x92, 0x37, 0xA6, 0xCC, 0x85, 0xC6, 0xD8, 0x21, 0xF0, 0x2A, 0xCE, 0x4D, 0xE3, 0xF5,
0x3D, 0xC7, 0x56, 0xB0, 0x69, 0x6D, 0x08, 0xEC, 0xD9, 0x12, 0xDE, 0xDD, 0xBE, 0x97, 0x6D, 0xA5,
0x66, 0x47, 0x31, 0x6E, 0xDC, 0x20, 0xC5, 0x47, 0x25, 0x5A, 0x64, 0xFD, 0x6F, 0xE5, 0xD1, 0xFF,
0x04, 0x5D, 0x8A, 0x1C, 0x6D, 0x7C, 0x5C, 0xAC, 0x8B, 0xDF, 0x7F, 0x27, 0x41, 0xA1, 0xAE, 0x14,
0x25, 0x7C, 0x31, 0x06, 0x2F, 0x59, 0xB6, 0x32, 0xEA, 0xDA, 0x79, 0xD2, 0x95, 0xF3, 0x5C, 0x93,
0x51, 0x47, 0x4D, 0x47, 0x3D, 0xE5, 0x23, 0x07, 0x12, 0x2F, 0x76, 0x6C, 0x28, 0xBD, 0x4B, 0x25,
0x89, 0x86, 0x9A, 0x02, 0x1A, 0x6E, 0x0A, 0xD8, 0xF1, 0x13, 0xA8, 0xC5, 0x64, 0x68, 0xA4, 0x86,
0xA5, 0xFE, 0x71, 0x2A, 0x34, 0xC6, 0x8F, 0x80, 0xD7, 0xB7, 0x8C, 0xE0, 0xD5, 0x1D, 0x2B, 0x8D,
0xC6, 0x58, 0xE7, 0x56, 0xE0, 0x3F, 0x6D, 0x32, 0x8C, 0x1F, 0xE1, 0xB1, 0x42, 0x4F, 0x57, 0x82,
0xBD, 0x2D, 0xE5, 0x78, 0x3F, 0x8E, 0x1A, 0x8A, 0x9C, 0x96, 0x30, 0xFE, 0x66, 0x39, 0xFB, 0x2F,
0xF8, 0xB2, 0x7C, 0xB1, 0x32, 0x97, 0x9B, 0x49, 0xE7, 0x54, 0xBA, 0x86, 0xB8, 0x2A, 0x91, 0x35,
0x38, 0xD6, 0x3D, 0x7B, 0x56, 0x9D, 0x3C, 0xB2, 0xD9, 0x2C, 0x31, 0xE6, 0x04, 0xF5, 0xC8, 0x34,
0xBC, 0xE4, 0x93, 0x1A, 0x53, 0xAF, 0x4D, 0xD0, 0xA8, 0xC8, 0xBE, 0xD2, 0x8A, 0x40, 0xCA, 0x4C,
0xA5, 0x87, 0xBC, 0xFF, 0x89, 0x30, 0x8F, 0x91, 0xAD, 0xE6, 0x26, 0x3B, 0x8E, 0x30, 0xEF, 0x15,
0x19, 0xE9, 0x0D, 0x35, 0x51, 0x0D, 0xB9, 0x11, 0x50, 0x9B, 0xB5, 0x1B, 0x6A, 0x53, 0x56, 0xF2,
0x1A, 0xA2, 0xED, 0x34, 0x40, 0x25, 0x93, 0xB4, 0x55, 0x48, 0xC5, 0x17, 0x04, 0x3A, 0x6A, 0xF4,
0xF7, 0x51, 0x63, 0x31, 0xB5, 0x87, 0x8C, 0x28, 0x13, 0x29, 0x66, 0xFD, 0xAF, 0x6D, 0xF8, 0x7F,
0x8A, 0x74, 0x66, 0x38, 0x22, 0x98, 0x9B, 0xA9, 0x85, 0x39, 0x99, 0x8C, 0x30, 0x7B, 0xBE, 0x80,
0xD6, 0x88, 0x30, 0x5D, 0x4B, 0xA5, 0x6B, 0xA5, 0x14, 0xDA, 0x7B, 0x76, 0x4A, 0x68, 0xD8, 0x30,
0x40, 0x1D, 0x2D, 0x3E, 0xAE, 0x5A, 0x3E, 0x63, 0xDF, 0xD3, 0x82, 0x9B, 0xBC, 0x46, 0xF2, 0x68,
0x03, 0x81, 0xC6, 0x53, 0x26, 0x3E, 0xAD, 0x08, 0x6D, 0x08, 0xEC, 0x1C, 0x6A, 0x89, 0x70, 0x75,
0xDE, 0x1D, 0x5E, 0x15, 0xA1, 0xA1, 0x38, 0x8E, 0x4A, 0xD3, 0x6D, 0x6A, 0x25, 0x13, 0xE0, 0xF5,
0xA3, 0x04, 0x0D, 0x22, 0xCC, 0x7B, 0x92, 0x7C, 0x15, 0x1E, 0xE7, 0x24, 0xC3, 0xE3, 0xC2, 0x62,
0xAA, 0xD3, 0xF1, 0xBC, 0xFA, 0x18, 0x57, 0x80, 0xEE, 0xBD, 0x7B, 0xEB, 0x19, 0xEA, 0xAB, 0x32,
0x64, 0x7A, 0x0A, 0xDC, 0xBB, 0x43, 0x44, 0x84, 0x69, 0x03, 0x49, 0x3A, 0x98, 0xF9, 0xCD, 0x3C,
0xCC, 0x9A, 0x15, 0x6D, 0xEA, 0xD2, 0x04, 0x98, 0x93, 0xC5, 0x1A, 0x12, 0x01, 0x91, 0xD4, 0x25,
0x92, 0xAC, 0xB6, 0xEB, 0x62, 0x71, 0xBE, 0x0E, 0xE6, 0x53, 0x17, 0x96, 0x93, 0x21, 0xA4, 0x75,
0x01, 0x0E, 0x76, 0x91, 0xD3, 0xB4, 0x25, 0x41, 0x7B, 0x1B, 0xF3, 0xE6, 0xBB, 0x37, 0x0E, 0x5A,
0x47, 0x5F, 0x3B, 0x08, 0xD7, 0x2F, 0xEE, 0xA6, 0x0E, 0x2C, 0x86, 0x75, 0x62, 0xBC, 0x97, 0x2D,
0xE0, 0x14, 0xBA, 0x2C, 0xE3, 0x16, 0x85, 0xFC, 0x5D, 0x78, 0xFF, 0x34, 0x11, 0x1E, 0x46, 0x1E,
0x83, 0x93, 0xFB, 0xB7, 0xC3, 0xBD, 0x8B, 0x11, 0x90, 0x1A, 0x7D, 0x0A, 0x2E, 0x1C, 0xD9, 0x01,
0x93, 0xBD, 0xC6, 0xC2, 0xE6, 0xB0, 0x50, 0xB8, 0x70, 0xEA, 0x14, 0x34, 0x95, 0xDF, 0x86, 0xC6,
0xB4, 0x40, 0x80, 0x6E, 0x83, 0x07, 0x9B, 0x29, 0xA4, 0xFA, 0x2F, 0x7A, 0x18, 0xCB, 0x31, 0xEA,
0xA6, 0x00, 0x73, 0xB3, 0x35, 0x69, 0x33, 0xD4, 0x49, 0xD1, 0x86, 0xFE, 0x73, 0x53, 0xF1, 0xF7,
0x90, 0x99, 0xA6, 0x8D, 0x79, 0xE4, 0xD9, 0xA3, 0x47, 0xF8, 0x38, 0xD4, 0x5D, 0x81, 0x8B, 0x02,
0x44, 0xE4, 0x65, 0x11, 0xE6, 0x65, 0x6B, 0x63, 0x62, 0xA2, 0x0E, 0x06, 0x2F, 0x97, 0x60, 0x70,
0x90, 0x10, 0x53, 0x92, 0x04, 0xF8, 0xF8, 0x51, 0x17, 0xDC, 0xB4, 0x49, 0x8A, 0x62, 0x6D, 0x43,
0x94, 0xEA, 0x89, 0x71, 0xDC, 0x08, 0xF7, 0x1D, 0x61, 0xAB, 0x83, 0xC0, 0xD7, 0xD7, 0x1B, 0x2E,
0x1C, 0xDF, 0x01, 0x0D, 0x4F, 0x12, 0x34, 0x2A, 0x0A, 0xEE, 0xF0, 0x9E, 0xD3, 0x00, 0x51, 0x9C,
0x11, 0x03, 0xC9, 0xB1, 0x91, 0x90, 0x70, 0xE3, 0x24, 0x1C, 0xA3, 0x71, 0x73, 0xE6, 0x54, 0x2F,
0xD8, 0xB8, 0x2A, 0x18, 0x26, 0x8F, 0xF7, 0x86, 0x90, 0x25, 0x73, 0x49, 0x84, 0xE7, 0xC1, 0xAC,
0xA9, 0x93, 0x3A, 0xEC, 0xFC, 0xFE, 0x3B, 0xE1, 0xC1, 0x7D, 0x11, 0x50, 0x9C, 0x7C, 0x40, 0xE3,
0x5D, 0xD6, 0x9C, 0x36, 0x60, 0xE4, 0xE6, 0x6A, 0x2F, 0xE3, 0xCB, 0x1B, 0x5C, 0xFB, 0x29, 0xE9,
0xA5, 0x24, 0x56, 0x14, 0x66, 0xA9, 0x5C, 0x6F, 0xAC, 0x49, 0xF8, 0x5F, 0x12, 0xA6, 0xB4, 0xC8,
0xCE, 0x60, 0xC3, 0x83, 0x16, 0x8E, 0x19, 0xA1, 0x44, 0x00, 0x15, 0x3A, 0xD8, 0xE9, 0x63, 0x72,
0x12, 0x1F, 0x9F, 0x3F, 0xD6, 0xC4, 0x83, 0xFB, 0x84, 0x94, 0xB3, 0x6A, 0xD4, 0xA3, 0x74, 0x3A,
0x79, 0x92, 0x8F, 0x2F, 0x9F, 0xE8, 0xE0, 0xFD, 0xBB, 0x5A, 0x68, 0xD5, 0x5D, 0x82, 0x5A, 0x5D,
0x15, 0xA8, 0x94, 0x08, 0x7F, 0x5D, 0x12, 0xE8, 0x1F, 0xE0, 0xEF, 0xEF, 0xDB, 0xFA, 0xBB, 0xB0,
0x60, 0x68, 0x78, 0xF6, 0x00, 0x5E, 0x3F, 0x4B, 0x82, 0xAC, 0x87, 0xD1, 0x90, 0x9D, 0x4C, 0xE3,
0x6B, 0xEC, 0x0D, 0x38, 0x7B, 0x74, 0x27, 0xF8, 0x4E, 0xF0, 0x80, 0x89, 0x63, 0x3D, 0x60, 0xD7,
0xA6, 0x0D, 0x30, 0x67, 0xC6, 0x0C, 0x5E, 0xE8, 0xCA, 0x40, 0xD1, 0xC2, 0x39, 0x7E, 0xE3, 0x1D,
0x6C, 0xAC, 0xEF, 0x0D, 0x1A, 0x38, 0x20, 0x7F, 0xDD, 0xEA, 0x2D, 0xE2, 0xFB, 0xD7, 0xF7, 0xC2,
0x2F, 0xD9, 0x73, 0x3A, 0x80, 0x81, 0x52, 0xE1, 0x29, 0xE2, 0xEB, 0xFF, 0x34, 0x7E, 0xB4, 0x1E,
0xF5, 0xBA, 0x1D, 0x68, 0x93, 0x14, 0x5A, 0x14, 0x76, 0x99, 0xDF, 0xC0, 0xBB, 0x0C, 0x4C, 0x07,
0x4A, 0x0A, 0x34, 0x71, 0xF6, 0x4C, 0x31, 0x11, 0x36, 0xA4, 0x50, 0x55, 0x62, 0x52, 0xA2, 0x2E,
0x3E, 0x2F, 0xD3, 0xC6, 0xED, 0x9B, 0xF9, 0xD8, 0xA5, 0xAD, 0x1A, 0xF9, 0x34, 0x2B, 0x9F, 0x38,
0x2E, 0xC1, 0x27, 0x85, 0x5D, 0xB1, 0x28, 0x4F, 0x07, 0xC3, 0xC2, 0xF4, 0x50, 0x22, 0x50, 0xA1,
0xAE, 0x96, 0x14, 0xCD, 0x8D, 0xBB, 0xFD, 0x3E, 0x6C, 0x90, 0xEB, 0xB9, 0xA9, 0xE3, 0x47, 0x7A,
0x8E, 0x1E, 0xE2, 0x68, 0x7C, 0xE3, 0xCC, 0xB1, 0x36, 0x25, 0x59, 0x89, 0x50, 0x56, 0x90, 0x02,
0xF9, 0xA9, 0x71, 0x10, 0x75, 0xF1, 0x48, 0xEB, 0x45, 0xB3, 0x26, 0x98, 0x4C, 0x9B, 0x38, 0xCA,
0x3C, 0x78, 0xF1, 0x82, 0xE9, 0x9E, 0x83, 0x06, 0xEF, 0xEF, 0xDF, 0xA7, 0x77, 0xB1, 0x81, 0x4A,
0x89, 0x52, 0x9A, 0xC5, 0x85, 0xDA, 0x7A, 0x38, 0x77, 0xBA, 0xCF, 0xE6, 0x8A, 0x9C, 0xE3, 0xD0,
0x9C, 0xBF, 0xA9, 0x0D, 0xF4, 0xEC, 0x66, 0x3A, 0x83, 0x2C, 0xFC, 0xE7, 0x1C, 0x3F, 0x05, 0xE6,
0xE6, 0x92, 0x87, 0x53, 0xD9, 0x30, 0xC0, 0x72, 0xF8, 0x1B, 0xD5, 0x60, 0xF2, 0x72, 0x7E, 0x96,
0x26, 0xF5, 0xCE, 0x7A, 0xE8, 0x35, 0x46, 0x0F, 0xD7, 0x85, 0xE8, 0x51, 0x2E, 0x6B, 0xD2, 0xD4,
0xA5, 0x8D, 0xD7, 0xAE, 0xF2, 0xB1, 0x2F, 0x0D, 0x11, 0xDE, 0x13, 0xF5, 0x68, 0xC4, 0xE4, 0xD3,
0x54, 0xC5, 0xCA, 0x94, 0x00, 0x0B, 0x28, 0xDF, 0xB7, 0x7D, 0x27, 0x44, 0xCB, 0x6E, 0x4A, 0xD4,
0xA2, 0x7C, 0x16, 0x6A, 0xD2, 0x90, 0xA1, 0x6F, 0xF0, 0x93, 0xAD, 0x55, 0x8F, 0x32, 0xDF, 0x49,
0x5E, 0x17, 0x83, 0x17, 0x07, 0x86, 0xAF, 0x09, 0x5A, 0x18, 0xBE, 0x7C, 0xA1, 0xFF, 0xC6, 0xE9,
0x93, 0xC6, 0x5D, 0x70, 0xED, 0x6B, 0xFF, 0xD4, 0xC6, 0xD2, 0xA2, 0xD2, 0xC4, 0xC8, 0xF0, 0x4F,
0x95, 0x44, 0x4A, 0xF7, 0xCB, 0x90, 0xAF, 0xA3, 0x4F, 0x84, 0xD5, 0x28, 0x16, 0xE8, 0x62, 0x5F,
0xDB, 0x5E, 0xCF, 0x92, 0xA2, 0xF7, 0xAB, 0xEB, 0xCA, 0xAE, 0x03, 0xB8, 0x38, 0x39, 0x06, 0x0A,
0xB4, 0x15, 0xB8, 0x64, 0x91, 0x3E, 0xE6, 0xE5, 0x75, 0xA1, 0x4D, 0x52, 0x89, 0xA0, 0x8D, 0x7E,
0x2B, 0x0F, 0x73, 0x20, 0xD2, 0xB9, 0x99, 0x7C, 0xD2, 0x87, 0xAE, 0x94, 0xBF, 0x7A, 0xD4, 0xBD,
0x91, 0x20, 0x26, 0x93, 0x68, 0xA5, 0x09, 0xF0, 0x41, 0x3C, 0x53, 0x6A, 0x0A, 0xFD, 0x74, 0x1D,
0x4C, 0xA1, 0xF5, 0xB4, 0x64, 0x21, 0xE6, 0xA4, 0x77, 0xA1, 0x99, 0xBB, 0x2B, 0xDE, 0xBA, 0xA9,
0x85, 0x81, 0x01, 0x52, 0xB4, 0xB4, 0x50, 0x50, 0x8D, 0x96, 0xA3, 0x76, 0x17, 0x15, 0x76, 0xEE,
0xA0, 0x87, 0x5D, 0x3A, 0x48, 0xB0, 0x6B, 0x67, 0x11, 0x76, 0xED, 0xC4, 0x20, 0x25, 0xA3, 0xC8,
0x51, 0xAB, 0x03, 0xE5, 0xBE, 0xAE, 0x02, 0xE5, 0x12, 0x25, 0x0E, 0x70, 0x94, 0xE3, 0xC1, 0xDD,
0x22, 0x9C, 0x3E, 0x55, 0x8A, 0xBA, 0xDA, 0x72, 0x94, 0x8B, 0x94, 0xB8, 0x77, 0xDB, 0xDA, 0xF9,
0x8F, 0xB2, 0x2F, 0x02, 0x38, 0x39, 0x38, 0x2C, 0x12, 0x50, 0x48, 0x85, 0xAC, 0x54, 0x61, 0x7E,
0x4E, 0x57, 0x0A, 0x67, 0x46, 0xB8, 0x65, 0xBC, 0xFB, 0x56, 0x75, 0xB8, 0xA5, 0x3D, 0x15, 0x90,
0x2A, 0xB3, 0x08, 0x62, 0x7F, 0x24, 0x20, 0x92, 0x29, 0x7A, 0x74, 0x4D, 0x87, 0xD4, 0x99, 0xE6,
0xE5, 0x34, 0xF2, 0x2C, 0xB5, 0x9A, 0x4C, 0xA5, 0xD3, 0xE8, 0xDD, 0x6C, 0x96, 0x66, 0xF5, 0xB9,
0x90, 0xFA, 0x81, 0xA2, 0x42, 0x3E, 0xC6, 0xC5, 0xE9, 0xE0, 0xC1, 0xBD, 0xBA, 0xB8, 0x64, 0x81,
0x04, 0xBD, 0x46, 0xC9, 0xD0, 0x75, 0xA0, 0x18, 0x9D, 0x1C, 0xE4, 0xD8, 0xAF, 0x8F, 0x1C, 0x07,
0x38, 0x49, 0x71, 0xA4, 0x87, 0x08, 0x17, 0x04, 0xC8, 0x70, 0x90, 0x1B, 0x91, 0xEF, 0xAA, 0xC2,
0xD0, 0xB5, 0x52, 0x6C, 0xAC, 0x66, 0xE3, 0xA8, 0x2E, 0x3A, 0x3B, 0x2A, 0xB0, 0x53, 0x3B, 0x3D,
0x9C, 0xE4, 0x3D, 0xF2, 0x50, 0x53, 0x12, 0xA9, 0xB4, 0x4B, 0x7F, 0xA7, 0x65, 0x42, 0x9A, 0x4B,
0xD7, 0xAE, 0x36, 0xA4, 0x50, 0xEA, 0x42, 0x2F, 0xA2, 0x32, 0x42, 0x3D, 0x2E, 0x57, 0x3B, 0xBF,
0xA9, 0x97, 0xE9, 0x59, 0x6C, 0x00, 0xE1, 0x0C, 0xC9, 0xD6, 0x98, 0x67, 0x35, 0x49, 0xC5, 0xA9,
0x85, 0xFD, 0xFC, 0x1E, 0xAE, 0x2E, 0xD3, 0x39, 0x9B, 0xB9, 0x59, 0xA5, 0xA0, 0x72, 0x96, 0x9E,
0xCA, 0x27, 0x45, 0xE7, 0x53, 0xB9, 0xD4, 0x25, 0xAF, 0xB3, 0xF2, 0x25, 0xC0, 0x54, 0x52, 0xF7,
0x84, 0x38, 0x5D, 0x4C, 0x88, 0xD5, 0xC5, 0xC4, 0x04, 0x5D, 0x8A, 0x14, 0x3D, 0x7C, 0x52, 0x26,
0xC0, 0x85, 0xFE, 0x7C, 0xEC, 0xDA, 0xC6, 0x00, 0x97, 0x2E, 0x12, 0x61, 0x41, 0xBE, 0x16, 0x96,
0x14, 0x6B, 0x62, 0xD8, 0x6A, 0x11, 0xB6, 0x6F, 0x27, 0xC2, 0x41, 0x83, 0xDC, 0x4B, 0x9A, 0x32,
0xB7, 0x9A, 0xC0, 0xC8, 0x61, 0x43, 0x43, 0xF4, 0x74, 0x64, 0xB8, 0x32, 0x48, 0x89, 0x79, 0x39,
0x6D, 0xB9, 0x72, 0xC4, 0x42, 0x8E, 0x4D, 0x48, 0xDF, 0x94, 0xF0, 0xDF, 0x06, 0x19, 0x9C, 0x0C,
0xD1, 0xE2, 0x69, 0x16, 0xE2, 0x8C, 0x3C, 0x79, 0x8B, 0x88, 0x33, 0xB2, 0x79, 0xD9, 0x5A, 0xD4,
0x09, 0x92, 0xF7, 0x73, 0xB5, 0xB9, 0x63, 0x6E, 0x26, 0x45, 0x4E, 0xBA, 0x16, 0x16, 0x15, 0xEB,
0xE0, 0x32, 0x22, 0xDA, 0xA1, 0x9D, 0x3E, 0x4E, 0x1C, 0x27, 0xA5, 0xFB, 0x84, 0x5C, 0x7D, 0x3F,
0x7B, 0x96, 0x8F, 0x62, 0xA1, 0x14, 0x2D, 0xCC, 0xCC, 0xFE, 0xC8, 0xB8, 0x19, 0x3E, 0x0A, 0x66,
0xFA, 0x4C, 0x09, 0x11, 0x51, 0xEC, 0x2F, 0x59, 0x24, 0xA7, 0xF2, 0x41, 0xD6, 0xA6, 0x17, 0xA4,
0xA5, 0xB2, 0x70, 0xFB, 0xDA, 0x66, 0xFE, 0x6F, 0xC0, 0xFE, 0x44, 0xC4, 0xBC, 0x9B, 0x97, 0xA1,
0x89, 0x85, 0xD4, 0x98, 0x14, 0x91, 0xCA, 0xE7, 0x13, 0xC1, 0x4C, 0x0A, 0x7F, 0x16, 0x01, 0x99,
0xE9, 0x44, 0x9C, 0xC8, 0xB2, 0xC1, 0xA3, 0xA4, 0x40, 0x07, 0x0B, 0xB3, 0xA9, 0x86, 0x53, 0x3F,
0xBE, 0x6D, 0xB3, 0x98, 0x9A, 0x16, 0x15, 0x89, 0x94, 0x02, 0x1F, 0x3C, 0xEC, 0xC2, 0xB5, 0xC8,
0x31, 0x77, 0xF8, 0xD8, 0xCD, 0x44, 0x89, 0x06, 0x72, 0x45, 0x5D, 0xC4, 0x7A, 0x47, 0x1B, 0x58,
0xB9, 0x74, 0xD1, 0x1C, 0x99, 0x9E, 0x01, 0xFA, 0xFB, 0x09, 0x88, 0x30, 0xB5, 0x7B, 0x2C, 0xBF,
0xC8, 0x9A, 0xDF, 0xAA, 0xF1, 0xF8, 0x7B, 0xA0, 0x77, 0x71, 0xEF, 0xFB, 0xFC, 0x59, 0x07, 0x4B,
0xF2, 0x29, 0xDC, 0x69, 0x1F, 0xA7, 0x4F, 0x0B, 0x30, 0x24, 0x58, 0x17, 0x67, 0x4C, 0x15, 0x51,
0x23, 0xA2, 0xC4, 0x11, 0x43, 0xA5, 0x54, 0xD3, 0x15, 0xE8, 0x3B, 0x49, 0xC9, 0x79, 0x74, 0xC7,
0x4E, 0x11, 0x46, 0x5E, 0xD7, 0xC6, 0x47, 0xC5, 0x9D, 0x31, 0xEA, 0x86, 0x00, 0x8D, 0x55, 0x0A,
0x6A, 0x5A, 0xE4, 0x78, 0xEA, 0x94, 0x90, 0xDA, 0x55, 0x01, 0xDE, 0x8F, 0xE5, 0xA3, 0xB5, 0x85,
0x01, 0x11, 0x56, 0x55, 0xF9, 0x0D, 0xE7, 0xF7, 0x84, 0xAD, 0xE1, 0xEB, 0x1D, 0x8D, 0xD5, 0x16,
0x4D, 0xE3, 0xBD, 0x98, 0x48, 0xB0, 0xF6, 0xAE, 0x45, 0x64, 0xBE, 0x95, 0x60, 0xFD, 0x3D, 0xB0,
0x10, 0xA6, 0xF7, 0x51, 0x08, 0xE7, 0x64, 0x50, 0xC8, 0x52, 0x28, 0x1E, 0x3E, 0x40, 0x79, 0xE7,
0xA6, 0x40, 0x85, 0x58, 0x8E, 0xBA, 0xD4, 0x84, 0x68, 0x77, 0x91, 0xA1, 0x76, 0x57, 0x29, 0xF2,
0xB5, 0x64, 0x7F, 0xF0, 0xBB, 0x4A, 0xFE, 0xD4, 0xEA, 0x48, 0x0A, 0xDC, 0x55, 0x8E, 0x22, 0x1D,
0x39, 0x1A, 0xAB, 0x45, 0x54, 0xF2, 0x24, 0xF8, 0xFD, 0x16, 0x15, 0x3A, 0xF6, 0xD5, 0x27, 0xC5,
0x26, 0x83, 0x4C, 0x55, 0xE0, 0x93, 0xC7, 0xBA, 0xF8, 0x90, 0x72, 0xBD, 0x47, 0x37, 0x05, 0x1A,
0xA9, 0x54, 0x55, 0xB3, 0x3D, 0x84, 0x3D, 0xE1, 0xCC, 0xB1, 0x7D, 0xBA, 0xD6, 0x16, 0x36, 0xC9,
0x6E, 0xAE, 0xAC, 0x05, 0x64, 0x84, 0x99, 0x52, 0x7F, 0x16, 0x96, 0xFF, 0x1B, 0xB0, 0xBE, 0x9D,
0xE5, 0x6D, 0x36, 0x9D, 0xE7, 0x93, 0xD1, 0x43, 0x56, 0x8A, 0x51, 0xAE, 0xA7, 0xC4, 0x2E, 0x9D,
0x55, 0x68, 0xA4, 0x6F, 0xFC, 0x7B, 0x6F, 0x8B, 0x1E, 0x59, 0x23, 0x3C, 0xDD, 0xAE, 0x2E, 0x5D,
0x38, 0x63, 0x61, 0xC8, 0x52, 0xBF, 0x51, 0xAB, 0x57, 0xCC, 0x1B, 0x1F, 0x38, 0x77, 0xFA, 0x36,
0xAA, 0x30, 0xB1, 0x3D, 0xBB, 0x99, 0xE5, 0x18, 0xAB, 0x4D, 0x7F, 0xEE, 0x4C, 0x65, 0x49, 0xA8,
0x23, 0x42, 0x23, 0x03, 0x35, 0x2A, 0xC5, 0x6A, 0xD4, 0x97, 0x18, 0xE2, 0xF1, 0x93, 0x12, 0x3C,
0x7F, 0x56, 0x88, 0x12, 0x3D, 0x15, 0xF6, 0x30, 0x90, 0x14, 0xAF, 0xF7, 0xED, 0xA4, 0x20, 0xC2,
0x5B, 0x35, 0xDC, 0x9D, 0x9D, 0x22, 0x6C, 0xAC, 0x28, 0x3F, 0x92, 0xC4, 0x98, 0x41, 0x73, 0x70,
0x7A, 0x32, 0xF3, 0xF0, 0xFF, 0x5D, 0x38, 0x73, 0x7F, 0x4D, 0x49, 0xD2, 0xA3, 0x66, 0x44, 0x13,
0x77, 0xED, 0x10, 0xA2, 0x4C, 0xA0, 0x8F, 0x22, 0x81, 0x02, 0x7B, 0xF6, 0x30, 0xAE, 0x0A, 0xF4,
0x1B, 0xE3, 0x3B, 0x7E, 0x84, 0xAB, 0x4E, 0x80, 0xFF, 0x24, 0xD8, 0xFE, 0xFD, 0x4A, 0x58, 0xB1,
0x78, 0x3A, 0x1D, 0x83, 0xE1, 0xD8, 0xC1, 0x2D, 0x30, 0x72, 0xA8, 0x3B, 0x6F, 0xAC, 0x87, 0x8B,
0x30, 0xD0, 0xCF, 0x6B, 0xF8, 0x68, 0x0F, 0x8F, 0xDD, 0xBD, 0x2C, 0x2C, 0x4A, 0x54, 0x32, 0x25,
0xCA, 0xC5, 0x32, 0x82, 0x12, 0x6D, 0x2C, 0x15, 0xE8, 0x4C, 0x1E, 0x17, 0x68, 0x2B, 0x71, 0xA0,
0xAD, 0x7E, 0xD2, 0x86, 0x39, 0xC6, 0x5A, 0xB0, 0x75, 0xFD, 0x22, 0x18, 0x39, 0x78, 0xD0, 0x06,
0x53, 0x63, 0x21, 0xC6, 0xDD, 0xD3, 0xA5, 0xDE, 0x97, 0x72, 0x98, 0xA6, 0xA5, 0xFF, 0x39, 0x61,
0x96, 0x02, 0x9F, 0xF1, 0xB5, 0xEB, 0x0C, 0x5F, 0xDE, 0xF3, 0xF9, 0x3E, 0x56, 0x15, 0xBA, 0x92,
0x10, 0x51, 0x0F, 0x4F, 0x86, 0x76, 0xA1, 0xBA, 0x29, 0x60, 0x5D, 0x12, 0x0D, 0x0F, 0x5E, 0xA3,
0xDC, 0x22, 0x16, 0xCF, 0xF5, 0x82, 0x61, 0x2E, 0x7D, 0x60, 0x86, 0xCF, 0x68, 0xD8, 0xB6, 0x79,
0x05, 0x2C, 0x5F, 0xE8, 0x03, 0x1B, 0xC3, 0x16, 0x43, 0xC4, 0xFE, 0xCD, 0x30, 0xD4, 0xD5, 0x99,
0xE0, 0x04, 0x41, 0x81, 0xD3, 0x20, 0x37, 0x2D, 0x03, 0xAE, 0x9D, 0xBB, 0xAA, 0x18, 0xEB, 0x31,
0x62, 0x89, 0xAD, 0x95, 0xD5, 0x0B, 0xBE, 0x8E, 0x16, 0x67, 0x34, 0x5D, 0x4D, 0x11, 0xB5, 0xA8,
0x7A, 0xF8, 0x5D, 0xD0, 0xB8, 0x55, 0xCF, 0xEE, 0xCF, 0xD5, 0x80, 0x00, 0x3F, 0x4F, 0xF0, 0x74,
0x77, 0x0C, 0x51, 0xAB, 0x24, 0x18, 0x79, 0x55, 0x48, 0x56, 0xEE, 0x4A, 0x5D, 0x0F, 0x75, 0x45,
0xD4, 0xF4, 0x33, 0xF2, 0x59, 0x74, 0xCC, 0xA2, 0x2E, 0x88, 0x3B, 0x52, 0x7D, 0x66, 0xC5, 0x9C,
0xFD, 0x2D, 0x8A, 0x4D, 0x41, 0x0C, 0x6C, 0x8D, 0x33, 0x0E, 0x9D, 0x67, 0x70, 0xE7, 0x8C, 0x04,
0x5D, 0xFF, 0x8B, 0xE4, 0x67, 0xE3, 0xB1, 0x34, 0x61, 0x35, 0xF3, 0xF3, 0x1A, 0x9F, 0x9E, 0xC5,
0x9E, 0xCD, 0xFE, 0xBA, 0xA2, 0x4D, 0x75, 0x56, 0x13, 0xCF, 0x9F, 0xE3, 0xA3, 0x4A, 0xAA, 0x44,
0x99, 0x48, 0x81, 0x6E, 0xCE, 0x0E, 0x85, 0xAB, 0x57, 0x2F, 0xB2, 0xFA, 0x7E, 0xF3, 0x1A, 0x58,
0xB9, 0x38, 0x00, 0x42, 0x43, 0x16, 0x40, 0xE6, 0xED, 0x83, 0x70, 0xFE, 0xE0, 0x3A, 0xD8, 0xB7,
0x7B, 0x23, 0x3C, 0x2E, 0xCD, 0x82, 0x8D, 0xA1, 0xAB, 0x21, 0x34, 0x28, 0x00, 0x3E, 0xBC, 0x6D,
0x06, 0x44, 0x84, 0x07, 0x77, 0xE3, 0xC1, 0x7B, 0xD4, 0x58, 0x98, 0x34, 0x7E, 0x9C, 0xD1, 0xB4,
0xA9, 0x13, 0xF6, 0x77, 0x33, 0x35, 0x6A, 0x30, 0x33, 0x31, 0x69, 0x9C, 0x3C, 0x7E, 0x4C, 0x68,
0xCA, 0x79, 0xEF, 0x36, 0x1F, 0x8B, 0xE7, 0xF0, 0xE0, 0xF0, 0xDE, 0x79, 0xB0, 0xC0, 0x7F, 0xE4,
0x02, 0x89, 0xAE, 0xEC, 0xCF, 0x03, 0x7B, 0x68, 0x6C, 0xA3, 0xE6, 0x3D, 0x89, 0xC2, 0x8B, 0xFD,
0x64, 0x92, 0x91, 0x46, 0x2D, 0x20, 0x85, 0x78, 0x26, 0x1B, 0xDC, 0x69, 0x96, 0xCD, 0xCB, 0xD6,
0xA5, 0xA3, 0x16, 0xE6, 0x66, 0x51, 0xAE, 0x51, 0x9D, 0x63, 0x0D, 0x41, 0x3E, 0x95, 0x87, 0x82,
0x5C, 0x1D, 0x2A, 0x01, 0xEC, 0xD7, 0x05, 0x01, 0x35, 0xFF, 0xAC, 0x41, 0x60, 0x10, 0xD2, 0x39,
0x9F, 0xD0, 0x32, 0x2D, 0x15, 0x51, 0x23, 0xC0, 0xFD, 0xFA, 0x40, 0xD7, 0xF3, 0xE9, 0x1D, 0xEC,
0x57, 0x0C, 0xF6, 0xFD, 0x1C, 0x6A, 0x39, 0x99, 0x41, 0xD9, 0xFD, 0xDB, 0xB7, 0xAA, 0xB9, 0x16,
0xD2, 0x40, 0x2D, 0xFD, 0x3D, 0x60, 0xB6, 0xD7, 0xA8, 0x4D, 0xE1, 0x41, 0xF0, 0xB4, 0x30, 0x0F,
0xF0, 0xD7, 0x5F, 0xE1, 0x97, 0xDA, 0xE7, 0x50, 0x9D, 0x72, 0x0C, 0xEA, 0xB3, 0xCE, 0xC3, 0xBB,
0xE6, 0x7A, 0x68, 0x7A, 0x5D, 0x07, 0xEF, 0xDF, 0x36, 0x40, 0x45, 0xFA, 0x19, 0xA8, 0xCA, 0x8B,
0x06, 0xFC, 0xF8, 0x3B, 0xDC, 0xBC, 0x1C, 0x05, 0xC1, 0x8B, 0x17, 0x43, 0xE4, 0xB5, 0x4B, 0x90,
0x91, 0x72, 0x1F, 0x26, 0x8D, 0xF5, 0xB0, 0xF5, 0x99, 0x34, 0xB5, 0xCF, 0x99, 0x43, 0xAB, 0xE0,
0x7D, 0xFA, 0xF4, 0x76, 0x75, 0x49, 0xF3, 0xDA, 0xC0, 0xDA, 0x15, 0xDE, 0x30, 0x6D, 0x82, 0xBB,
0xB7, 0x4C, 0x24, 0xFB, 0xD5, 0xDE, 0x5A, 0x8E, 0x9E, 0x6E, 0x6A, 0x9A, 0x5B, 0xE5, 0x38, 0x6C,
0xB0, 0x0C, 0x47, 0x78, 0xA8, 0xA8, 0x6D, 0x93, 0xE1, 0xE8, 0x51, 0x72, 0xF4, 0x1A, 0x2D, 0xC5,
0x89, 0x5E, 0x52, 0xF4, 0x1E, 0x2F, 0xC1, 0x29, 0xDE, 0x12, 0xF4, 0x9D, 0x2C, 0x45, 0x9F, 0x29,
0x62, 0x9C, 0xE1, 0x2B, 0xC6, 0x59, 0x7E, 0x52, 0xF4, 0x9F, 0xA1, 0xC4, 0x39, 0x33, 0x55, 0x18,
0xE0, 0xAF, 0xC4, 0xC0, 0xB9, 0x2A, 0x9C, 0x3F, 0x57, 0x8E, 0xF3, 0xE7, 0xC8, 0x30, 0x70, 0x8E,
0x14, 0x03, 0xE7, 0x49, 0x68, 0x4D, 0x82, 0x73, 0x67, 0xE9, 0xD1, 0x7D, 0x42, 0x9C, 0x35, 0x43,
0xCC, 0xFD, 0xC0, 0x36, 0xD5, 0x5B, 0x8C, 0x13, 0xC7, 0x8B, 0x70, 0xCC, 0x68, 0x31, 0xD7, 0x1E,
0xF6, 0xED, 0xAD, 0x46, 0x85, 0x48, 0x8E, 0xDD, 0x8D, 0x4D, 0x7E, 0x1B, 0xEC, 0xDE, 0xDF, 0x25,
0x74, 0xD5, 0x32, 0x22, 0xF2, 0x1B, 0xBC, 0xAF, 0xAF, 0x85, 0xE6, 0x97, 0xC5, 0x50, 0x99, 0x7C,
0x14, 0xAA, 0xD2, 0xCE, 0xC0, 0xAB, 0xFA, 0x72, 0x78, 0xD5, 0x58, 0xC3, 0x6B, 0xAC, 0xAF, 0x80,
0x67, 0xC9, 0x67, 0xE1, 0xC9, 0x83, 0x08, 0xA8, 0xC8, 0x89, 0x86, 0x9C, 0xB4, 0x2C, 0xA8, 0x7E,
0xF9, 0x98, 0xBC, 0xFD, 0x2B, 0x7C, 0xFC, 0xED, 0x1D, 0xAC, 0x5F, 0x13, 0x04, 0x53, 0x27, 0x8C,
0x83, 0x92, 0xE8, 0xB5, 0xD0, 0x98, 0xB4, 0xA6, 0x6D, 0xED, 0xC3, 0x8D, 0xAD, 0x41, 0xA5, 0x27,
0x07, 0x95, 0x58, 0x36, 0xD8, 0x50, 0x29, 0x7F, 0x27, 0x11, 0xEA, 0xA3, 0x4E, 0x27, 0x25, 0xF7,
0xFB, 0x2E, 0xBF, 0xAB, 0x12, 0x05, 0x5D, 0x14, 0xC8, 0xA7, 0x73, 0x01, 0x95, 0x05, 0xEE, 0xB3,
0x96, 0x92, 0x94, 0x50, 0x45, 0x50, 0x50, 0xA3, 0xAE, 0x42, 0x09, 0x9D, 0x8B, 0xF9, 0x4A, 0x94,
0xF0, 0x49, 0x64, 0xF8, 0xEC, 0x97, 0x41, 0x02, 0xAD, 0x8B, 0xE9, 0xB3, 0x58, 0xD7, 0x80, 0x83,
0x90, 0xF2, 0x91, 0xCD, 0xBB, 0x02, 0x2D, 0x15, 0xEA, 0x50, 0x19, 0xD1, 0xA1, 0xE7, 0xF0, 0xE9,
0xB9, 0xBA, 0x9D, 0x69, 0xA2, 0xE9, 0x42, 0xE7, 0xA4, 0xC4, 0xEC, 0x77, 0x26, 0x7E, 0x47, 0x7A,
0x2E, 0x89, 0x0B, 0x2B, 0x43, 0x96, 0x66, 0xA6, 0x1F, 0x27, 0x8C, 0x76, 0x1F, 0xBC, 0x62, 0x91,
0x3F, 0xD4, 0x3E, 0x2B, 0x83, 0x0F, 0x0D, 0x35, 0x50, 0x93, 0x71, 0x1E, 0xAA, 0x52, 0x4F, 0xF1,
0xAA, 0x92, 0x8F, 0x43, 0x4D, 0xFE, 0x2D, 0x78, 0xFD, 0xAA, 0x01, 0x5A, 0x08, 0x9F, 0x81, 0xA7,
0x49, 0xA7, 0x78, 0x8F, 0x13, 0x22, 0xA0, 0x32, 0x3F, 0x1A, 0x7E, 0xFD, 0xB9, 0x19, 0xDE, 0xBE,
0xAE, 0xA1, 0x30, 0xA7, 0xEB, 0x0D, 0xD5, 0x50, 0xF1, 0xF2, 0x29, 0xBC, 0x2D, 0x8B, 0x87, 0xD7,
0x39, 0x67, 0x78, 0xAF, 0x93, 0xB6, 0xF1, 0x18, 0x59, 0x50, 0xCB, 0x14, 0x7D, 0x54, 0x62, 0x69,
0xA3, 0x6D, 0x6F, 0x53, 0x9C, 0xB0, 0xD0, 0x1A, 0xBD, 0x03, 0xAD, 0x70, 0xF2, 0x12, 0x5B, 0x9C,
0xB2, 0xDC, 0x16, 0x7D, 0x83, 0xED, 0x70, 0xC6, 0x6A, 0x7B, 0xF4, 0x5B, 0x6B, 0x8B, 0xFE, 0x61,
0x76, 0x18, 0xB8, 0xC9, 0x01, 0x17, 0x6D, 0xB4, 0xC3, 0xA5, 0x5B, 0x6C, 0x39, 0x2C, 0xDB, 0xCA,
0xCE, 0xED, 0xE8, 0x68, 0x8F, 0x4B, 0x08, 0x4B, 0xB7, 0x3A, 0x10, 0xFA, 0xE1, 0xF2, 0x6D, 0x8E,
0xF4, 0xB9, 0x1F, 0x06, 0x6E, 0xEC, 0xC3, 0x7D, 0x27, 0x60, 0xBD, 0x3D, 0xFA, 0xAF, 0xB5, 0x43,
0xFF, 0x75, 0x76, 0x38, 0x33, 0xA4, 0x37, 0xCE, 0x58, 0x69, 0x83, 0xBE, 0xCB, 0x7B, 0xE1, 0x94,
0xC5, 0x36, 0x38, 0x71, 0x41, 0x2F, 0xEE, 0x9D, 0xC3, 0xA7, 0x5A, 0xA0, 0x5A, 0x21, 0x47, 0x13,
0xB5, 0xD1, 0x47, 0x57, 0x57, 0xD7, 0x41, 0xB6, 0xF6, 0xF6, 0x10, 0xB1, 0x6F, 0x1F, 0xE0, 0x6F,
0x3F, 0x43, 0x75, 0xDA, 0x8F, 0x8C, 0x30, 0x70, 0x84, 0x73, 0x23, 0xFF, 0x95, 0x30, 0x94, 0x3D,
0x3C, 0x0E, 0xE5, 0x39, 0x91, 0xF0, 0xFE, 0x5D, 0x23, 0x85, 0x7C, 0x2D, 0x91, 0xAE, 0x85, 0xD7,
0xAF, 0xEB, 0xE1, 0x75, 0x53, 0x03, 0xEF, 0xED, 0x1B, 0x8A, 0x92, 0xB2, 0xD8, 0x56, 0x4D, 0xB7,
0x87, 0xB5, 0x01, 0x7D, 0xA9, 0x04, 0x54, 0x52, 0x89, 0xB9, 0x84, 0x2F, 0xAB, 0x72, 0x70, 0x36,
0xC5, 0x4D, 0x91, 0x03, 0x71, 0x73, 0xD4, 0x40, 0xDC, 0x78, 0xCD, 0x0D, 0x37, 0x5D, 0x77, 0xF9,
0x84, 0x81, 0xB4, 0xEE, 0x4A, 0x6B, 0x84, 0xAB, 0x74, 0x7E, 0xCD, 0x05, 0x37, 0xD0, 0xF9, 0x7A,
0x0E, 0x6E, 0x74, 0xEE, 0x46, 0xEB, 0x2E, 0xB8, 0xF1, 0xCA, 0x40, 0x0C, 0xA7, 0x6B, 0xE1, 0xD7,
0x06, 0xD2, 0xDA, 0x27, 0x5C, 0x1F, 0x40, 0xF7, 0x38, 0xD3, 0x91, 0xAE, 0xD1, 0xB3, 0x36, 0xD2,
0x73, 0xC2, 0xAF, 0xBB, 0xD2, 0x67, 0x02, 0x9D, 0x33, 0x84, 0xD3, 0xB5, 0x2D, 0xD1, 0xAE, 0xB8,
0xE2, 0x88, 0x13, 0xAA, 0xF5, 0x65, 0xA8, 0xD0, 0x93, 0x7E, 0xDC, 0x14, 0xBE, 0xD6, 0xFD, 0xC4,
0xB1, 0xFD, 0x70, 0xE3, 0xEA, 0x39, 0xC8, 0x4C, 0x8A, 0x85, 0xCA, 0xD4, 0xD3, 0x5F, 0x10, 0xBE,
0x41, 0x84, 0x1B, 0xC9, 0x83, 0x95, 0x7F, 0x11, 0x7E, 0xF2, 0xE0, 0x08, 0xB0, 0x5F, 0x1F, 0x7E,
0xAE, 0x6F, 0x86, 0x0F, 0xB5, 0x0D, 0x1C, 0xDE, 0xD7, 0x10, 0x6A, 0x9B, 0xE0, 0x75, 0x45, 0x19,
0x94, 0x67, 0xAD, 0x6F, 0xD3, 0xFC, 0x60, 0x54, 0x07, 0x30, 0xEA, 0x6E, 0x41, 0xE8, 0xA9, 0xAF,
0x92, 0x19, 0x96, 0x5A, 0x59, 0x19, 0x62, 0xF0, 0x09, 0xDA, 0xE0, 0xD5, 0xFE, 0xB8, 0xF6, 0xBC,
0x33, 0x86, 0x5E, 0x18, 0x88, 0xEB, 0x2E, 0xB8, 0x10, 0xDC, 0x30, 0xEC, 0x82, 0x33, 0x61, 0x00,
0x86, 0x5E, 0x1C, 0x48, 0x70, 0xC1, 0xF5, 0x97, 0xE8, 0xBE, 0x4F, 0x08, 0x23, 0x84, 0x5E, 0x1A,
0x88, 0xEB, 0x2F, 0x0F, 0xC4, 0xB0, 0xCB, 0x64, 0x84, 0x2B, 0x44, 0xE4, 0x32, 0xDD, 0x43, 0xD8,
0x70, 0x85, 0x1D, 0x89, 0x38, 0xAD, 0x85, 0x5F, 0x65, 0x20, 0xE2, 0xB4, 0xC6, 0x0C, 0xB7, 0x91,
0x8C, 0xB3, 0x91, 0xC8, 0x6E, 0xBC, 0x36, 0x00, 0xB7, 0xDC, 0x72, 0xC7, 0xA0, 0x08, 0x67, 0x34,
0x54, 0xB3, 0x14, 0x11, 0xE1, 0x86, 0xB0, 0xE0, 0x59, 0x67, 0x4E, 0x1D, 0x80, 0x43, 0x07, 0xB6,
0xC3, 0xCE, 0xED, 0xE1, 0xDC, 0x7F, 0x06, 0xD4, 0x3E, 0x7A, 0x00, 0x35, 0x25, 0x0F, 0xA0, 0xBA,
0x34, 0x01, 0xEA, 0x5F, 0x16, 0x41, 0x63, 0xCD, 0x0B, 0x22, 0x7B, 0x9A, 0xF3, 0xEE, 0xB3, 0xD4,
0xB3, 0x50, 0x9D, 0x1F, 0x07, 0x3F, 0x57, 0x13, 0xE1, 0xAA, 0x46, 0xF8, 0x89, 0x43, 0x03, 0xFB,
0xCC, 0x6B, 0x7E, 0x51, 0x02, 0x65, 0x99, 0xEB, 0x5B, 0x35, 0x3E, 0x74, 0xD3, 0x80, 0xDE, 0x13,
0x27, 0x83, 0xED, 0x64, 0x1F, 0x3D, 0x13, 0x0B, 0xDB, 0x54, 0x33, 0x13, 0x09, 0xAE, 0x3E, 0xDD,
0x1F, 0xB7, 0xC5, 0x90, 0xC7, 0xB8, 0xCD, 0x90, 0xB7, 0xC8, 0x73, 0x6C, 0xE3, 0x61, 0x97, 0xC9,
0x00, 0x8C, 0x18, 0x33, 0xC4, 0xD9, 0x01, 0xB8, 0xF6, 0xCC, 0x00, 0x5C, 0xF3, 0xE3, 0x40, 0xBA,
0x7F, 0x00, 0xAE, 0x3E, 0xD5, 0x1F, 0x57, 0x9D, 0x6C, 0x41, 0xC8, 0x89, 0x81, 0x18, 0x7C, 0xAC,
0x3F, 0x06, 0x1F, 0x77, 0xC4, 0x15, 0x47, 0x1D, 0x71, 0xF9, 0xE1, 0x7E, 0xB8, 0x22, 0xC2, 0x09,
0x97, 0x1D, 0x74, 0xC2, 0xA5, 0xFB, 0x1D, 0x71, 0xD1, 0xDE, 0x7E, 0xB8, 0x78, 0x57, 0x5F, 0x5C,
0xB4, 0xAD, 0x2F, 0xCE, 0xDF, 0xEC, 0x80, 0x73, 0xC2, 0xFB, 0xE0, 0x74, 0x0A, 0x73, 0x9F, 0x10,
0x1B, 0x1C, 0x35, 0xC3, 0x12, 0x0D, 0x94, 0x0A, 0x94, 0x89, 0xA5, 0x38, 0x63, 0xDA, 0xF8, 0xC3,
0x2B, 0x96, 0xCE, 0x81, 0x45, 0xF3, 0xA7, 0xC3, 0xB1, 0x03, 0x9B, 0xA1, 0xE6, 0x51, 0x32, 0xD4,
0x3E, 0x4E, 0xE6, 0x8E, 0x35, 0x8F, 0x92, 0xA0, 0xA6, 0x34, 0x91, 0xC3, 0xF3, 0xF4, 0x0B, 0x84,
0x8B, 0xF0, 0xBA, 0xAE, 0x02, 0xDE, 0x90, 0xD7, 0xDF, 0xD4, 0x51, 0x38, 0xD7, 0x7E, 0x89, 0x1A,
0xDE, 0x9B, 0xC6, 0x8F, 0x50, 0x57, 0x96, 0xC4, 0x6B, 0x48, 0x70, 0x04, 0x30, 0x75, 0x75, 0x03,
0x33, 0xF7, 0x41, 0x7A, 0x6A, 0x93, 0x1E, 0xA9, 0x06, 0x4A, 0x29, 0x8E, 0x9D, 0x6D, 0x83, 0xDE,
0xCB, 0xAC, 0x71, 0xF8, 0x74, 0x0B, 0x1C, 0xE2, 0x6D, 0x8E, 0x83, 0xC6, 0x98, 0xA1, 0x8B, 0xA7,
0x19, 0x3A, 0x0E, 0x31, 0xC6, 0x3E, 0x2E, 0xC6, 0x68, 0xD7, 0xDF, 0x04, 0x7B, 0xDB, 0x1B, 0x61,
0x2F, 0x3B, 0x13, 0xB4, 0xB4, 0x31, 0x44, 0x0B, 0x4B, 0x35, 0x07, 0x73, 0x73, 0x43, 0x34, 0xEF,
0x61, 0x88, 0xDD, 0xBB, 0x1B, 0x60, 0x37, 0x53, 0x7D, 0xEC, 0x6E, 0xAA, 0x42, 0x33, 0x63, 0x15,
0x9A, 0x1A, 0x11, 0x0C, 0xD5, 0x68, 0x42, 0x2D, 0x9F, 0xB1, 0x5A, 0xC5, 0xC1, 0x50, 0xA5, 0xA2,
0x5C, 0x55, 0xA1, 0xBE, 0x54, 0x85, 0x2A, 0x89, 0x0A, 0x95, 0x22, 0x7D, 0x6A, 0x25, 0x25, 0xA8,
0xE0, 0x53, 0x49, 0x92, 0xA9, 0x50, 0x21, 0x97, 0xE0, 0xE0, 0xFE, 0xFD, 0x2E, 0x8E, 0x1E, 0xEC,
0xCA, 0x73, 0x77, 0x74, 0x80, 0x8C, 0x7B, 0x97, 0xA0, 0xE9, 0x65, 0x26, 0x23, 0xCA, 0xE3, 0xC8,
0x7E, 0x06, 0x23, 0xFD, 0x38, 0x05, 0x5E, 0x91, 0xA7, 0x9B, 0x29, 0xA7, 0x9B, 0x48, 0xDC, 0x9A,
0x09, 0xFF, 0x4C, 0xBA, 0x8E, 0xD6, 0x10, 0x6A, 0x9F, 0x24, 0x40, 0x43, 0x82, 0x13, 0x80, 0xBE,
0xCA, 0x80, 0x60, 0x28, 0x56, 0xAB, 0x14, 0x99, 0x86, 0x4A, 0x25, 0x8A, 0x75, 0x24, 0x28, 0xEC,
0x24, 0x41, 0xBD, 0x4E, 0x32, 0x52, 0x67, 0x29, 0xD7, 0x9C, 0xCB, 0xA8, 0xAF, 0x55, 0xD2, 0xE6,
0x0C, 0x95, 0xFA, 0x68, 0x42, 0x9B, 0xEF, 0x41, 0xA4, 0x7A, 0x5A, 0xA9, 0xD1, 0x8A, 0x08, 0xDB,
0x38, 0x18, 0xA3, 0x6D, 0x3F, 0x13, 0x32, 0x84, 0x11, 0xF6, 0x21, 0x0D, 0xB0, 0x77, 0x36, 0x41,
0xA6, 0x05, 0x7D, 0x1C, 0x8D, 0xD1, 0x9E, 0xAD, 0x13, 0x7A, 0xD9, 0x91, 0x81, 0x6C, 0xC9, 0x40,
0xBD, 0x8C, 0xD0, 0x9C, 0x8C, 0xD3, 0xC3, 0x9C, 0x0C, 0xD2, 0x5D, 0x8D, 0xA6, 0xA6, 0x6A, 0x34,
0x32, 0xD6, 0x47, 0x63, 0x03, 0x32, 0x84, 0xBE, 0x1A, 0x0D, 0xF5, 0xF5, 0xE9, 0x1D, 0x2A, 0xEE,
0x8F, 0x6F, 0x83, 0x06, 0x3A, 0x9D, 0xF7, 0x99, 0x3A, 0x0E, 0xBC, 0xC6, 0x7A, 0x40, 0xFC, 0xED,
0x1F, 0xA9, 0x2C, 0x65, 0x11, 0xB9, 0xD4, 0x7F, 0x42, 0x6D, 0x59, 0x3A, 0x34, 0xD5, 0x57, 0x41,
0x73, 0x23, 0xD5, 0x65, 0x22, 0xFA, 0x25, 0xDE, 0x10, 0x59, 0x86, 0x7F, 0x26, 0x4C, 0x1E, 0x96,
0xF2, 0x75, 0x19, 0x34, 0x95, 0x22, 0x59, 0x8C, 0x81, 0x4C, 0x4D, 0x9B, 0x35, 0x43, 0xCF, 0x29,
0x16, 0x38, 0x6E, 0x8E, 0x05, 0x4E, 0x0B, 0xEA, 0x8D, 0xFE, 0xEB, 0xFB, 0xE2, 0xC2, 0x6D, 0x14,
0x92, 0xFB, 0xFA, 0x53, 0x68, 0x3A, 0x63, 0xC8, 0x71, 0x27, 0x0A, 0x63, 0x47, 0x5C, 0x7B, 0xD6,
0x19, 0xD7, 0x9D, 0xA3, 0x9C, 0xA5, 0xDC, 0x5E, 0x77, 0xA1, 0x3F, 0xE5, 0x35, 0xCB, 0x67, 0x0A,
0x7D, 0xCA, 0x71, 0x76, 0x5C, 0x4F, 0x47, 0x76, 0x1E, 0xCA, 0xF2, 0xFE, 0xDC, 0x00, 0x5C, 0x47,
0x29, 0xB0, 0x96, 0x85, 0xFF, 0xC9, 0x01, 0xB8, 0xEA, 0x04, 0x3D, 0x87, 0xC2, 0x7E, 0xC5, 0x21,
0x7A, 0xEE, 0x01, 0x47, 0x5C, 0xBC, 0xBF, 0x1F, 0x2E, 0xDA, 0xDD, 0x17, 0x17, 0xEC, 0xB4, 0x47,
0x5B, 0x47, 0x33, 0x14, 0x76, 0x16, 0xE2, 0xE8, 0x91, 0xAE, 0x91, 0x97, 0x63, 0x23, 0x34, 0x2E,
0xC7, 0x1E, 0x81, 0x73, 0x77, 0x0E, 0x41, 0x0E, 0x09, 0x52, 0x6D, 0x61, 0x14, 0x54, 0x15, 0xDC,
0x6A, 0x41, 0xFE, 0x0D, 0x78, 0x55, 0x5D, 0x46, 0x9E, 0xFD, 0x77, 0xB2, 0x0C, 0xAF, 0xEB, 0x5B,
0xD0, 0x4C, 0x35, 0xBC, 0xE9, 0xD5, 0x9F, 0x44, 0x38, 0x11, 0xEA, 0x13, 0x06, 0x01, 0x4C, 0x9B,
0x32, 0x0E, 0xA6, 0x4F, 0x9B, 0xA0, 0x61, 0x6F, 0x63, 0x73, 0x5A, 0x2C, 0xD0, 0xC3, 0x19, 0x21,
0x76, 0xB8, 0xED, 0xDE, 0x60, 0x0C, 0xBF, 0x31, 0x80, 0x53, 0xCF, 0x0D, 0x2C, 0x8F, 0x99, 0xF0,
0x50, 0x2E, 0x87, 0x92, 0xF8, 0xAC, 0x23, 0x32, 0xEB, 0x48, 0xB4, 0x98, 0x98, 0x85, 0x32, 0x41,
0x3B, 0xEF, 0x42, 0xE4, 0x89, 0x10, 0xE5, 0xF6, 0x5A, 0x22, 0xBE, 0xEE, 0x3C, 0x81, 0x19, 0xE0,
0x7C, 0xCB, 0x1A, 0x47, 0x98, 0x88, 0xAF, 0x23, 0x01, 0x64, 0xC7, 0x30, 0x32, 0x4C, 0xE8, 0xC5,
0xFE, 0x24, 0x74, 0x4E, 0x24, 0x6C, 0xA4, 0xDE, 0xA4, 0xEC, 0x1B, 0x2E, 0xBB, 0x61, 0x38, 0x61,
0xE3, 0x4D, 0x67, 0xEC, 0x4F, 0xE9, 0xC3, 0xEF, 0x24, 0x44, 0x37, 0x37, 0xC7, 0x8C, 0xB3, 0x37,
0xF6, 0x6B, 0x9D, 0x8B, 0x3A, 0x08, 0x67, 0x6F, 0x1E, 0x80, 0xEC, 0x07, 0x07, 0xA1, 0x22, 0xED,
0x10, 0x94, 0xA7, 0x47, 0x70, 0x78, 0x91, 0x7A, 0x00, 0x1A, 0x2B, 0x8A, 0xFF, 0x0A, 0x65, 0x02,
0xEF, 0x6B, 0x84, 0x9B, 0x1A, 0x6B, 0xE1, 0xD5, 0xFB, 0x3F, 0xA1, 0xA1, 0xE4, 0x2C, 0x34, 0xC4,
0xBA, 0x03, 0xAC, 0x59, 0xB5, 0x04, 0xC2, 0xD6, 0x2E, 0x87, 0xB1, 0xA3, 0x46, 0xEE, 0x13, 0x51,
0xA3, 0x3D, 0x31, 0xD0, 0x0E, 0xB7, 0xC4, 0xBA, 0x93, 0x60, 0xB9, 0x13, 0x51, 0x52, 0xDB, 0x4F,
0x8A, 0xBB, 0x81, 0xD4, 0x97, 0x3B, 0xE7, 0x40, 0xAA, 0x4D, 0x06, 0x08, 0xBB, 0x4A, 0x0A, 0x4D,
0xA5, 0x27, 0x8C, 0x29, 0x2F, 0x57, 0xAA, 0xC8, 0x30, 0x64, 0xA0, 0xF5, 0x5C, 0x39, 0x22, 0xF5,
0x65, 0x65, 0x88, 0x19, 0x2E, 0x92, 0x81, 0x3E, 0x47, 0x52, 0x89, 0x63, 0x65, 0x88, 0x8E, 0xEC,
0x7C, 0x23, 0x95, 0x26, 0x56, 0xFE, 0x58, 0xB9, 0x62, 0xA5, 0xEE, 0xBB, 0x28, 0x17, 0x74, 0xF6,
0x30, 0xA7, 0x66, 0x44, 0x40, 0x53, 0x8E, 0xFD, 0xCB, 0x03, 0x07, 0x37, 0xAA, 0x0F, 0x1C, 0xDE,
0x08, 0x87, 0x8F, 0x6C, 0x82, 0xF2, 0x34, 0xEA, 0xA6, 0xD2, 0xA9, 0xF4, 0x64, 0x1C, 0xFB, 0x84,
0xA3, 0xD4, 0x5D, 0x9D, 0x23, 0x52, 0x55, 0x44, 0x90, 0xBC, 0xF8, 0x15, 0xB2, 0x9F, 0x09, 0x37,
0x7E, 0x40, 0x68, 0x2C, 0xDE, 0x07, 0x8D, 0x77, 0x29, 0xA4, 0xE7, 0xCF, 0x9D, 0x09, 0x81, 0xF3,
0x66, 0xC1, 0xDC, 0x99, 0xD3, 0xF7, 0x89, 0x75, 0x65, 0x38, 0xDE, 0xBF, 0x0F, 0x2E, 0x3B, 0x4C,
0x61, 0xBC, 0x8B, 0x14, 0x76, 0x9F, 0x13, 0x06, 0x1D, 0x74, 0xC4, 0xE0, 0x23, 0x84, 0x63, 0x4E,
0x54, 0xB2, 0x48, 0x89, 0x4F, 0x0D, 0xC0, 0x90, 0x93, 0xCE, 0xB4, 0xE6, 0x8C, 0x2B, 0x8F, 0x32,
0x50, 0x58, 0x1E, 0x72, 0x24, 0x15, 0xA6, 0x46, 0x63, 0xBF, 0x13, 0x2E, 0xDA, 0xE3, 0x84, 0x0B,
0x7E, 0xE8, 0x87, 0x01, 0xD4, 0x80, 0xCC, 0xD9, 0x44, 0xCD, 0x06, 0x35, 0x1C, 0x7E, 0x6B, 0x58,
0x03, 0xD3, 0x1B, 0xA7, 0x2E, 0xB3, 0xC1, 0x49, 0x0B, 0x7B, 0xE1, 0x84, 0xF9, 0xBD, 0x70, 0x5C,
0x80, 0x35, 0x8E, 0xF1, 0xB7, 0xC4, 0xB1, 0xB3, 0xAC, 0x70, 0xAC, 0xBF, 0x35, 0xA5, 0x50, 0x6F,
0xF4, 0x9A, 0x6B, 0x85, 0x56, 0xBD, 0x4C, 0x50, 0xAC, 0x2D, 0x42, 0x67, 0x07, 0xBB, 0xF2, 0x3D,
0xFB, 0x36, 0xA8, 0xF7, 0xEE, 0xDF, 0x00, 0x07, 0x0E, 0x86, 0xC3, 0xF3, 0x54, 0x8E, 0x30, 0x8F,
0xC8, 0x32, 0x70, 0x84, 0xCB, 0x33, 0x4E, 0x10, 0xA9, 0xCA, 0xBF, 0x49, 0xF8, 0x20, 0x11, 0x26,
0xD1, 0x5A, 0xB3, 0x3A, 0x08, 0xD6, 0xAE, 0x59, 0x01, 0x2B, 0x83, 0x96, 0x1E, 0x94, 0x4A, 0x14,
0xD8, 0xD7, 0x89, 0xC4, 0x84, 0x94, 0x55, 0x49, 0x53, 0x8B, 0x81, 0x3E, 0x0D, 0xE0, 0x86, 0x4A,
0x34, 0x33, 0x51, 0x71, 0xCA, 0xDB, 0xCD, 0x8C, 0x09, 0x16, 0x29, 0x71, 0x37, 0x35, 0x9A, 0xD1,
0xB9, 0x29, 0xC1, 0x84, 0xD4, 0xD8, 0x88, 0xEE, 0x37, 0x52, 0xEB, 0x23, 0xFB, 0x6B, 0xBF, 0x5A,
0x26, 0x43, 0x7D, 0x9A, 0x47, 0x95, 0x02, 0x9A, 0x49, 0x49, 0x75, 0xA5, 0x24, 0x7A, 0x12, 0x82,
0x94, 0x86, 0x02, 0x19, 0x03, 0xAD, 0x49, 0xF8, 0xEC, 0x77, 0x60, 0x09, 0x9D, 0xCB, 0x50, 0x4A,
0x9F, 0x45, 0xDA, 0x72, 0x22, 0xC9, 0xAE, 0xC9, 0x48, 0xA5, 0xF5, 0x69, 0x60, 0x17, 0xA3, 0x73,
0x3F, 0xC7, 0x67, 0x87, 0x8E, 0xEE, 0x52, 0x1E, 0x3A, 0xB6, 0x0B, 0x8E, 0x9C, 0xD8, 0x05, 0xCF,
0x53, 0x0E, 0x13, 0x61, 0x0A, 0xE7, 0x2F, 0x3C, 0x5C, 0x9E, 0x79, 0xF2, 0xEF, 0x10, 0xE6, 0x11,
0x61, 0x5E, 0x63, 0xC9, 0xE1, 0x16, 0x0F, 0x4F, 0x18, 0x35, 0x92, 0x83, 0xD7, 0x88, 0xE1, 0x07,
0xF5, 0xE5, 0x54, 0x03, 0x85, 0x72, 0x34, 0x56, 0x92, 0x02, 0x5B, 0x1B, 0x91, 0xAA, 0x1A, 0x92,
0xC5, 0x0D, 0xB1, 0x17, 0xC1, 0x9A, 0x14, 0xB9, 0x97, 0x8D, 0x11, 0x5A, 0x7F, 0x5A, 0xEB, 0x49,
0x4D, 0x8A, 0xB9, 0x25, 0xA9, 0xB5, 0x35, 0x9D, 0xB3, 0x7B, 0xEC, 0x0D, 0xD1, 0xCE, 0xC9, 0x18,
0x1D, 0xDD, 0x4C, 0xD1, 0x75, 0x04, 0x95, 0xB4, 0x49, 0x16, 0x38, 0xCA, 0xCF, 0x8A, 0x52, 0xC4,
0x1A, 0x7D, 0xC8, 0xBB, 0x33, 0x43, 0xED, 0x71, 0xDE, 0x26, 0xAA, 0xBD, 0xDB, 0xFA, 0xE0, 0xFC,
0xED, 0xF6, 0x18, 0xB0, 0xA5, 0x2F, 0xCE, 0xD9, 0xE8, 0x88, 0xBE, 0xA4, 0x19, 0x5E, 0x73, 0x2D,
0xD1, 0x65, 0x84, 0x19, 0x19, 0xD2, 0x88, 0xEA, 0x30, 0xF5, 0xE0, 0x7C, 0x01, 0x0E, 0xEA, 0xDF,
0x3F, 0xED, 0xDC, 0xF9, 0x08, 0xCD, 0xF3, 0x17, 0x8F, 0xC0, 0xE9, 0x33, 0x07, 0x69, 0xF4, 0xA3,
0x4E, 0x2B, 0x93, 0x48, 0xFE, 0x15, 0xD6, 0x7F, 0x93, 0xF0, 0xEB, 0x66, 0x68, 0xAC, 0x2D, 0x80,
0xC6, 0x58, 0x37, 0x5E, 0x63, 0xBC, 0xA7, 0x06, 0x38, 0xD8, 0x58, 0xB6, 0xA0, 0x57, 0xCF, 0x83,
0x0A, 0xA1, 0x0A, 0xED, 0x1C, 0x0D, 0x71, 0xC5, 0xC1, 0xFE, 0x2D, 0x2D, 0x22, 0xEB, 0x8C, 0xA8,
0x35, 0xDC, 0x40, 0xF9, 0x17, 0xCE, 0xE5, 0x1E, 0xB5, 0x9B, 0x04, 0xAE, 0x35, 0xA4, 0x3C, 0x5D,
0x4F, 0x39, 0xBC, 0xFE, 0x32, 0xE5, 0x27, 0xE5, 0xF7, 0x46, 0x96, 0xDB, 0x2C, 0x8F, 0xE9, 0x3B,
0x1B, 0x2E, 0xB9, 0x92, 0x7A, 0xBB, 0x51, 0xF8, 0x3B, 0xE1, 0xCA, 0x08, 0x47, 0x5C, 0x4A, 0xCD,
0x46, 0xC0, 0xF7, 0x0E, 0x38, 0x83, 0x7A, 0xE9, 0x49, 0x4B, 0x7A, 0xE3, 0x98, 0xD9, 0xD6, 0xE8,
0x41, 0x35, 0xDE, 0x6D, 0x78, 0x0F, 0x74, 0x1C, 0x68, 0x46, 0xA5, 0x8D, 0xD5, 0x73, 0x43, 0xD4,
0xD7, 0x97, 0xA2, 0x9E, 0x1E, 0x1F, 0x3B, 0xB5, 0xEF, 0x88, 0xC3, 0x87, 0xB9, 0xDD, 0x8C, 0xB9,
0x7B, 0x85, 0x77, 0x3B, 0xE6, 0x32, 0xA4, 0xA4, 0xDC, 0x23, 0x4F, 0x51, 0x2B, 0xF9, 0x22, 0x8F,
0x72, 0xF9, 0x30, 0xBC, 0x4C, 0xDD, 0x4F, 0x38, 0x00, 0x2F, 0xC9, 0xE3, 0x5F, 0x23, 0xFC, 0x8A,
0x88, 0x7E, 0x46, 0x13, 0x13, 0xB5, 0xF2, 0xDB, 0xD0, 0x9C, 0xB5, 0xA8, 0x75, 0x53, 0xFA, 0xFC,
0xB6, 0xD0, 0xCD, 0xC8, 0x90, 0x83, 0x99, 0xA1, 0xE1, 0x11, 0xB9, 0x58, 0xC1, 0x79, 0x71, 0xA8,
0x17, 0x79, 0x68, 0xA2, 0x39, 0x7A, 0x4E, 0xB6, 0xA4, 0xEE, 0xC7, 0x9A, 0xCB, 0x33, 0x2F, 0x7F,
0xCA, 0xBB, 0xD9, 0x0C, 0xD6, 0x74, 0x6E, 0x8D, 0xA3, 0xC9, 0x7B, 0x23, 0x7C, 0xA8, 0xE1, 0x9F,
0x62, 0x85, 0x2E, 0x63, 0x4C, 0xB1, 0x9F, 0xBB, 0x01, 0xDA, 0x39, 0x2B, 0xB0, 0xB7, 0x83, 0x8A,
0xBC, 0x4E, 0x4D, 0x47, 0x77, 0x39, 0x76, 0xEB, 0xAE, 0x8F, 0x66, 0xA6, 0x86, 0xA8, 0xA2, 0x66,
0x42, 0xA2, 0xAB, 0x47, 0xD1, 0x23, 0x43, 0xB1, 0x96, 0x88, 0x26, 0x2F, 0x21, 0x6A, 0x77, 0xE6,
0xA3, 0x6E, 0x27, 0x3E, 0x35, 0x1C, 0x14, 0xE2, 0x7A, 0x0A, 0x94, 0x0A, 0x25, 0xD8, 0xC3, 0x84,
0x6A, 0xB8, 0x7D, 0xAF, 0xFC, 0x61, 0xEE, 0x8E, 0x91, 0xA1, 0x41, 0xF3, 0x7D, 0xCF, 0x1C, 0xD9,
0x09, 0xC7, 0xF6, 0x6D, 0x86, 0x17, 0x8F, 0x8B, 0xE0, 0x5D, 0x53, 0x03, 0xD5, 0xDB, 0x46, 0x68,
0x78, 0x99, 0x4F, 0x5D, 0x53, 0x2A, 0xD4, 0x3F, 0x4D, 0x83, 0xFA, 0x67, 0x19, 0x54, 0x87, 0xAB,
0xFF, 0x41, 0x96, 0x08, 0xBE, 0xAD, 0xAB, 0xFE, 0x02, 0xF4, 0x99, 0xD6, 0xDE, 0xBF, 0x88, 0x86,
0x77, 0x65, 0x87, 0x78, 0xAF, 0x12, 0xC6, 0xF2, 0xA0, 0xAF, 0x9D, 0x3D, 0xC1, 0x0E, 0x28, 0x67,
0xB6, 0xA9, 0x95, 0x8A, 0xDF, 0xF4, 0x74, 0x45, 0x28, 0x20, 0xB5, 0xE6, 0x77, 0x12, 0xA0, 0x44,
0x9B, 0xF2, 0x8C, 0x42, 0x5C, 0xD0, 0x95, 0x4F, 0x63, 0x23, 0x1F, 0xB5, 0x3A, 0xF0, 0xB1, 0x6B,
0x7B, 0x1D, 0x82, 0x16, 0x76, 0x69, 0xD7, 0x99, 0x9A, 0x12, 0xCA, 0x45, 0x6D, 0x19, 0x76, 0x53,
0x77, 0xC3, 0x7E, 0x76, 0x03, 0xAA, 0xFB, 0xF5, 0xEE, 0x57, 0x67, 0xD7, 0xA3, 0x77, 0xA3, 0x75,
0x37, 0xEB, 0x5A, 0xCB, 0x6E, 0x96, 0x6F, 0xD4, 0x32, 0x43, 0x1A, 0x11, 0xA5, 0xD8, 0xDD, 0xD0,
0xEC, 0x77, 0x57, 0xA7, 0xFE, 0x89, 0x76, 0x96, 0x96, 0xD7, 0xDC, 0x07, 0x38, 0x44, 0x4D, 0x9D,
0xE8, 0x79, 0x7A, 0xDD, 0xCA, 0x05, 0x41, 0x7E, 0xBE, 0x93, 0xEF, 0x48, 0x84, 0x22, 0x34, 0x33,
0x32, 0xFD, 0x73, 0xE2, 0xA8, 0xA1, 0x5B, 0x67, 0xFB, 0x4C, 0x71, 0xBE, 0x72, 0xF1, 0x47, 0xC5,
0xB2, 0xC0, 0xE9, 0x1D, 0xCE, 0x1D, 0xFE, 0x01, 0x22, 0xB6, 0x85, 0xC2, 0xFD, 0x9B, 0x97, 0x88,
0x28, 0xCD, 0xC3, 0xCC, 0x8B, 0xB4, 0xF9, 0xE6, 0x46, 0x46, 0xFC, 0xD5, 0x27, 0x34, 0x72, 0x6B,
0x2D, 0x64, 0xAB, 0xE1, 0x5D, 0x6D, 0x15, 0x0D, 0x0C, 0x55, 0xF0, 0xE1, 0x0B, 0xBC, 0xAF, 0xAD,
0x6E, 0x59, 0xA3, 0xC9, 0xEA, 0x6D, 0xE9, 0x99, 0x36, 0x70, 0x32, 0x62, 0x2F, 0xFC, 0x78, 0xEC,
0x00, 0xAC, 0x5C, 0x32, 0x4F, 0x34, 0xDA, 0x73, 0xF8, 0xE8, 0x71, 0xA3, 0x47, 0x1C, 0xB1, 0xB7,
0xB6, 0x8C, 0x74, 0x75, 0x72, 0xCC, 0x36, 0x55, 0x1B, 0xA1, 0x5C, 0x22, 0xC7, 0x9E, 0x3D, 0xCC,
0x6B, 0xC6, 0x78, 0x0E, 0x3B, 0x36, 0x67, 0xE6, 0x8C, 0xED, 0xCB, 0x16, 0x2E, 0xD8, 0x17, 0xB4,
0x78, 0xD1, 0x81, 0xE0, 0xE5, 0x8B, 0xAE, 0xF6, 0xEC, 0x66, 0xFE, 0x41, 0xAC, 0x2B, 0xC0, 0x4B,
0xE7, 0x4E, 0xED, 0x7D, 0x55, 0xF7, 0xDC, 0xEC, 0x59, 0x71, 0x66, 0xCF, 0xF4, 0x87, 0x77, 0xAC,
0x53, 0x12, 0x6E, 0x77, 0xCF, 0xCD, 0x4C, 0xEC, 0xEF, 0x3D, 0x7E, 0x4C, 0x4E, 0xDB, 0xD6, 0xAD,
0xD1, 0xDB, 0x6B, 0x78, 0xFC, 0x9E, 0x1D, 0x9B, 0x74, 0x9C, 0x1D, 0xED, 0x60, 0xF2, 0x44, 0x0F,
0x8D, 0xD5, 0x41, 0x33, 0xE1, 0xE6, 0xE5, 0x23, 0x90, 0x9C, 0x14, 0xE3, 0x24, 0xD3, 0x13, 0xFD,
0xD2, 0xB3, 0x7B, 0xB7, 0xC6, 0x75, 0x2B, 0x96, 0x98, 0x07, 0xCC, 0x9C, 0x0E, 0x39, 0x19, 0x0F,
0xE1, 0x5E, 0xCC, 0x2D, 0x78, 0xFF, 0xF6, 0x2D, 0x8D, 0x7F, 0x75, 0x44, 0xA6, 0xFE, 0x33, 0x59,
0x1E, 0x47, 0xEE, 0x2B, 0x68, 0x6E, 0xA8, 0x83, 0x77, 0xF5, 0xF5, 0xF0, 0xFE, 0xBF, 0x43, 0x5D,
0x3D, 0xEF, 0xA7, 0xE6, 0xDF, 0xE0, 0x43, 0xF3, 0x07, 0x1E, 0xFC, 0xF9, 0xD3, 0x3B, 0x9A, 0x37,
0x7F, 0x81, 0x07, 0xF4, 0x92, 0x00, 0x7F, 0x7F, 0xD8, 0xB0, 0x76, 0x15, 0xF8, 0x79, 0x8F, 0x86,
0xF3, 0x27, 0x0F, 0x7A, 0x3A, 0xF5, 0xE9, 0xF7, 0x51, 0xA0, 0xA3, 0xFB, 0xC7, 0x81, 0xBD, 0xDB,
0xE7, 0xDC, 0xBE, 0x7A, 0x86, 0x57, 0x9C, 0x97, 0x0E, 0xE5, 0xCF, 0x4A, 0xA1, 0xFA, 0xC5, 0x63,
0xCA, 0x9D, 0x72, 0x5D, 0xA7, 0x7E, 0x8E, 0x79, 0x06, 0x2A, 0xFD, 0x9F, 0x92, 0x12, 0xEE, 0xD9,
0x97, 0x3F, 0x2D, 0x82, 0xA7, 0x45, 0x19, 0x90, 0xF6, 0xE0, 0x36, 0x24, 0xC6, 0xDD, 0x82, 0xE2,
0xFC, 0x8C, 0xD6, 0x7E, 0xBE, 0xD3, 0x6E, 0x75, 0xA0, 0x48, 0x18, 0x3D, 0xDC, 0xE3, 0xD8, 0xBA,
0x90, 0xE5, 0xD0, 0xCF, 0xA1, 0x17, 0x78, 0x8F, 0x1F, 0x0A, 0x21, 0xCB, 0x66, 0x42, 0xC0, 0x2C,
0x3F, 0x08, 0x9C, 0x3B, 0xDF, 0x5A, 0x5F, 0xAE, 0x6E, 0xB6, 0xB6, 0x30, 0xAF, 0xDE, 0xBE, 0x71,
0x93, 0x71, 0xF0, 0x92, 0xC5, 0xF0, 0xE3, 0x89, 0xA3, 0x50, 0x90, 0x9B, 0x03, 0x3F, 0xBD, 0x7F,
0xC7, 0x7B, 0xF7, 0xE6, 0x0D, 0xFC, 0xFC, 0xB6, 0x19, 0xDE, 0x10, 0xE1, 0xD7, 0x14, 0xA2, 0x5F,
0x23, 0xCB, 0x3C, 0xFB, 0xA6, 0xF1, 0x35, 0x85, 0xFC, 0x7B, 0xC2, 0xBB, 0x7F, 0xC7, 0x6B, 0x42,
0xF3, 0xAF, 0xF0, 0xE6, 0x75, 0x15, 0x34, 0x56, 0xDE, 0x6A, 0x05, 0x1F, 0xA8, 0x35, 0x23, 0xF0,
0x3E, 0xBE, 0x6B, 0xA6, 0x5C, 0x29, 0x85, 0xD0, 0xD5, 0xC1, 0x10, 0xB4, 0x68, 0x0E, 0x1C, 0x3B,
0xB4, 0xAB, 0x97, 0x43, 0x6F, 0xBB, 0x26, 0xA5, 0x54, 0xF6, 0xEA, 0xD6, 0xF5, 0x0B, 0xC6, 0x51,
0x97, 0x4F, 0x43, 0x76, 0xFA, 0x03, 0x78, 0x54, 0x94, 0x0D, 0x4F, 0x8A, 0xF2, 0xE0, 0x49, 0x71,
0x36, 0xDF, 0xA2, 0x7B, 0x8F, 0x52, 0xC7, 0xBE, 0x0E, 0xF5, 0xF7, 0xEF, 0xDC, 0xB4, 0x48, 0x4B,
0x8C, 0x83, 0xBC, 0xB4, 0x04, 0xC8, 0x78, 0x18, 0x03, 0x19, 0x49, 0xF7, 0xA0, 0x30, 0x27, 0x59,
0xC7, 0x77, 0x8A, 0xF7, 0x03, 0xED, 0x2E, 0xDA, 0x38, 0x63, 0xEA, 0x94, 0x53, 0x9B, 0x37, 0x84,
0x69, 0xCC, 0x9D, 0xE9, 0x0B, 0x53, 0xBC, 0x87, 0xC3, 0xF2, 0x85, 0xBE, 0x30, 0xB0, 0x6F, 0x7F,
0x18, 0xE0, 0xE0, 0x64, 0x43, 0xE1, 0xDC, 0x64, 0x61, 0xDE, 0xFD, 0xB7, 0x25, 0x0B, 0x16, 0x38,
0xAF, 0x5C, 0xBA, 0x18, 0x16, 0x07, 0x06, 0xC0, 0x77, 0xEB, 0x57, 0xC1, 0x89, 0x23, 0x7B, 0xC1,
0x77, 0xC6, 0x14, 0x88, 0x8E, 0xBC, 0x0A, 0x7F, 0xFC, 0xFE, 0x3B, 0x47, 0x9A, 0x79, 0xFA, 0x5F,
0xF1, 0x86, 0xBC, 0xFB, 0xF6, 0xD5, 0x2B, 0x78, 0xF7, 0x8A, 0x48, 0xFF, 0x37, 0xF8, 0xF0, 0x0E,
0x35, 0x1A, 0x9E, 0xC7, 0x41, 0x65, 0xE1, 0x09, 0x0D, 0x78, 0x47, 0x8D, 0x37, 0xC3, 0x7B, 0x22,
0xFE, 0xEB, 0xDB, 0x26, 0xF8, 0xF3, 0xE7, 0xF7, 0x10, 0xB2, 0x34, 0x00, 0xC6, 0x7A, 0xBA, 0xB9,
0x74, 0x37, 0x36, 0xF9, 0xD8, 0xAB, 0xA7, 0x55, 0x7E, 0x4E, 0x72, 0xAC, 0x90, 0x79, 0x2F, 0x31,
0xFE, 0x0E, 0x64, 0xA6, 0xC4, 0x51, 0x5E, 0x5D, 0x84, 0xFB, 0x51, 0x17, 0xB5, 0x0C, 0xE4, 0xB2,
0xC2, 0x11, 0x43, 0xDC, 0x9F, 0x15, 0xA4, 0xC5, 0xEB, 0x3F, 0xCA, 0x4D, 0x81, 0x67, 0x74, 0xCF,
0xB3, 0xE2, 0x0C, 0x28, 0xC9, 0x7D, 0x08, 0x2F, 0x1E, 0x65, 0x6A, 0xCE, 0xF2, 0x9D, 0x70, 0x5F,
0x57, 0x53, 0x13, 0x7D, 0x27, 0x4D, 0x3C, 0xB5, 0x6A, 0xF9, 0x22, 0x8D, 0xF5, 0xAB, 0x57, 0xC0,
0x9E, 0xDD, 0x3F, 0xC0, 0xC6, 0xD0, 0x75, 0x30, 0xD4, 0xD9, 0x19, 0x46, 0xB8, 0xB9, 0xD9, 0x98,
0x9B, 0x98, 0x36, 0x9A, 0x18, 0x28, 0xD1, 0x6F, 0xD2, 0xB8, 0xE9, 0xAB, 0x83, 0x96, 0x74, 0x08,
0x5B, 0xB3, 0xBA, 0xE3, 0xE6, 0x0D, 0xAB, 0x3A, 0x6C, 0xFB, 0x7E, 0x1D, 0xF4, 0x75, 0xB4, 0x85,
0xD3, 0xC7, 0x23, 0xB8, 0xBF, 0x48, 0xE2, 0xCF, 0x1F, 0xFE, 0x1D, 0xBF, 0xFC, 0x04, 0xBF, 0xBF,
0x7F, 0x4B, 0xA4, 0x49, 0xA0, 0x1A, 0x49, 0xA0, 0xFE, 0x0D, 0xE4, 0xFD, 0x66, 0x46, 0xBA, 0x1E,
0x1A, 0x8A, 0x4F, 0xB7, 0xAD, 0xC9, 0x3F, 0xDE, 0x19, 0x9A, 0xEA, 0x28, 0x4F, 0xEA, 0xEA, 0x78,
0xEC, 0xF8, 0x86, 0x72, 0xE6, 0xE3, 0xFB, 0x37, 0x10, 0x7B, 0xEB, 0x3A, 0xF8, 0x78, 0x8F, 0x71,
0x95, 0x8B, 0xC4, 0xE8, 0x39, 0x74, 0x48, 0xDC, 0x4F, 0x6F, 0x6A, 0x3A, 0x65, 0x26, 0xDE, 0x83,
0x95, 0x4B, 0xE7, 0x43, 0x41, 0x4E, 0x22, 0xC4, 0xDF, 0xB9, 0x0A, 0xC7, 0xF6, 0xEF, 0x68, 0x27,
0x16, 0xEA, 0xA5, 0x4E, 0x18, 0x37, 0xF6, 0x49, 0xC5, 0xD3, 0x42, 0xF9, 0x4F, 0xCD, 0xD5, 0x90,
0x10, 0x13, 0x09, 0x77, 0xAE, 0x9C, 0x85, 0x57, 0xE5, 0x8F, 0xE1, 0xA7, 0x86, 0x0A, 0xC1, 0xFC,
0x99, 0xBE, 0x19, 0xBA, 0x9D, 0xB5, 0xB0, 0xAF, 0x9D, 0xED, 0xB1, 0x4D, 0x44, 0x72, 0xDF, 0xCE,
0xED, 0xF0, 0xC3, 0xF6, 0xEF, 0x21, 0x35, 0x35, 0x05, 0x9C, 0xED, 0x49, 0x28, 0xED, 0x6D, 0x7B,
0xF7, 0x30, 0x32, 0x69, 0x50, 0xC8, 0x94, 0xD8, 0xD7, 0xD6, 0xE6, 0xF1, 0x98, 0x11, 0x9E, 0xD1,
0xE3, 0x46, 0x8F, 0xBA, 0x3D, 0x61, 0xCC, 0xF0, 0xA8, 0x59, 0xBE, 0xDE, 0xC1, 0xCE, 0x03, 0x1C,
0x44, 0x3F, 0x9E, 0x3C, 0xF2, 0x1F, 0x09, 0xFF, 0xF1, 0xFE, 0xDD, 0x7F, 0x20, 0x4C, 0x53, 0xD3,
0x9B, 0x77, 0xD0, 0xF4, 0xEC, 0x8E, 0x46, 0x7D, 0xA2, 0x5F, 0x87, 0xDA, 0x9C, 0x8D, 0xED, 0x3F,
0x13, 0xE6, 0xF0, 0x0B, 0xE5, 0x0C, 0x7E, 0xFC, 0x05, 0xB2, 0x93, 0x1E, 0x42, 0xE8, 0xCA, 0xA0,
0xE9, 0xDA, 0x9D, 0xBA, 0xA0, 0xBF, 0x9F, 0xCF, 0x0D, 0xF6, 0xC2, 0x63, 0x87, 0x0F, 0xC2, 0x2C,
0x9F, 0x89, 0x50, 0x5B, 0x59, 0x0A, 0xD9, 0x69, 0xF1, 0xB0, 0x2E, 0x78, 0x59, 0x1B, 0xA1, 0x8E,
0xCE, 0x83, 0x69, 0xDE, 0xE3, 0x5F, 0x7C, 0x68, 0xAC, 0x94, 0x17, 0x65, 0xA5, 0x00, 0x6D, 0x18,
0xF6, 0x6E, 0xD9, 0x00, 0xCF, 0x1E, 0xE5, 0x41, 0xCD, 0xCB, 0x47, 0xAD, 0xE7, 0xCC, 0x9A, 0x7E,
0xB5, 0x7D, 0x9B, 0xF6, 0xE8, 0xEE, 0xE2, 0x12, 0xFB, 0x20, 0xF6, 0x6E, 0xAF, 0x9D, 0xDB, 0x36,
0x1B, 0x6C, 0xDD, 0xF2, 0x5D, 0xDB, 0x9C, 0x9C, 0x6C, 0xD8, 0xB2, 0x39, 0x1C, 0xCC, 0x4D, 0x54,
0xD6, 0xA6, 0x06, 0xEA, 0x06, 0x7D, 0xEA, 0xAE, 0x54, 0x64, 0x5C, 0xF6, 0xC7, 0x77, 0x89, 0x9E,
0x08, 0x59, 0x54, 0x58, 0xF5, 0xB4, 0x78, 0xE7, 0x35, 0x79, 0x82, 0xD5, 0xAD, 0xA8, 0xEB, 0x44,
0xF8, 0xCF, 0xAF, 0x12, 0x66, 0xD1, 0xC8, 0x22, 0xF3, 0x6B, 0x44, 0x3F, 0x81, 0xF7, 0xE6, 0xCD,
0x7B, 0x78, 0xFD, 0xEC, 0xB6, 0x46, 0x4D, 0xC2, 0x88, 0xD6, 0x35, 0x69, 0xFE, 0xF0, 0x17, 0xD9,
0xD7, 0xB5, 0x35, 0x90, 0x95, 0xF4, 0x00, 0x8A, 0x33, 0x53, 0x61, 0xD3, 0x9A, 0xE5, 0xBC, 0xB1,
0x9E, 0x83, 0x6E, 0x30, 0xC1, 0x19, 0xE5, 0xE9, 0x59, 0xB0, 0xEB, 0x87, 0x6D, 0xDD, 0x86, 0x0D,
0x1A, 0xA4, 0x33, 0x77, 0xE6, 0x34, 0x93, 0xC2, 0xDC, 0x14, 0x31, 0x33, 0xC0, 0xCA, 0x25, 0x0B,
0x5B, 0x77, 0x6C, 0xD7, 0xE1, 0xAE, 0xC7, 0xE0, 0x41, 0xCD, 0xB7, 0xAE, 0x9D, 0x1F, 0xB8, 0x78,
0xC1, 0xFC, 0x8E, 0x23, 0x3D, 0x86, 0x6A, 0x1D, 0xDD, 0xB3, 0xAD, 0x6D, 0x5C, 0xD4, 0x25, 0x28,
0x2D, 0x48, 0x81, 0x99, 0xBE, 0x93, 0xAE, 0x69, 0x76, 0xEC, 0x4A, 0xC3, 0x3E, 0xB5, 0xA1, 0xC6,
0xA6, 0xEF, 0x25, 0x7A, 0x7A, 0x6F, 0xFC, 0x7C, 0xA7, 0x84, 0x9F, 0xF9, 0xF1, 0x38, 0x1C, 0x3F,
0xB2, 0x1F, 0x0E, 0xED, 0xD8, 0xCC, 0x8B, 0xD8, 0xB3, 0x7D, 0x56, 0xD8, 0xEA, 0x90, 0xBD, 0x94,
0x41, 0x3B, 0x7B, 0xF7, 0xB4, 0xD8, 0x4B, 0x02, 0x76, 0x60, 0xE4, 0x60, 0xF7, 0x1F, 0x42, 0xD7,
0x86, 0xDA, 0x9D, 0x3F, 0x1B, 0xC1, 0xFB, 0xE3, 0x8F, 0x9F, 0xE1, 0xF7, 0x9F, 0xDF, 0xFC, 0xB7,
0x78, 0xFF, 0x9A, 0x72, 0xF8, 0xEB, 0x64, 0x39, 0xB4, 0x10, 0xBE, 0x05, 0x35, 0x09, 0x43, 0xA1,
0x26, 0xD5, 0xA7, 0x85, 0x70, 0x33, 0x49, 0x77, 0x7D, 0x65, 0x05, 0x2C, 0xF6, 0x9F, 0x0C, 0xF3,
0x7C, 0xC7, 0xC1, 0xF2, 0x80, 0x69, 0x30, 0xC7, 0x67, 0xDC, 0x6C, 0x0B, 0x33, 0xD3, 0xE7, 0x22,
0x81, 0x00, 0x75, 0xBA, 0x6A, 0x15, 0x2B, 0xA5, 0xAA, 0x94, 0x9E, 0xDD, 0xCC, 0x4A, 0x13, 0xE3,
0x63, 0x7A, 0x65, 0x67, 0xA6, 0xB3, 0x9F, 0x38, 0x3A, 0x75, 0x37, 0x31, 0x28, 0xD1, 0x13, 0x08,
0xB1, 0xBB, 0xA9, 0x71, 0x99, 0xB5, 0xA5, 0x75, 0xB4, 0xA1, 0x4A, 0x3F, 0x79, 0xF3, 0x9A, 0xA0,
0xE1, 0x51, 0x97, 0x4E, 0xC3, 0xD3, 0x47, 0xB9, 0x10, 0xB4, 0x6C, 0xF1, 0x04, 0x47, 0x7B, 0x87,
0x8B, 0x36, 0x16, 0xE6, 0x4F, 0x8C, 0x55, 0xFA, 0x55, 0x66, 0xFA, 0x86, 0xE5, 0xEB, 0x42, 0x82,
0x66, 0x9F, 0x3F, 0x75, 0x04, 0x4E, 0x1C, 0xDE, 0x0B, 0x64, 0x1C, 0x38, 0x71, 0x60, 0x17, 0xE5,
0xF4, 0x5A, 0x18, 0x31, 0xC8, 0x0D, 0xEC, 0xAC, 0x2C, 0xC1, 0xC6, 0xB2, 0x27, 0x8C, 0x1C, 0x32,
0x18, 0xA2, 0xCF, 0xEC, 0x01, 0xAC, 0x4A, 0x84, 0x3F, 0x7E, 0xFB, 0xC0, 0xFB, 0x1A, 0x51, 0x0E,
0xBF, 0xBC, 0x81, 0x8F, 0x1F, 0x98, 0x8A, 0xFF, 0xA7, 0x90, 0xFE, 0x4C, 0x78, 0x18, 0x11, 0x9E,
0xFE, 0x0F, 0xC2, 0x0D, 0x55, 0x95, 0xB0, 0x79, 0xED, 0x12, 0xD8, 0x10, 0x3C, 0x1F, 0x36, 0xAD,
0x5E, 0x08, 0xAB, 0x97, 0xFA, 0x83, 0x97, 0xA7, 0xBB, 0xD5, 0xB8, 0x11, 0x83, 0x83, 0x27, 0x8E,
0x1D, 0x5D, 0xEE, 0xDA, 0xAF, 0x4F, 0xDE, 0xD4, 0x71, 0x83, 0x7D, 0xB3, 0x53, 0x13, 0xDA, 0xEC,
0xDD, 0xB5, 0x15, 0x24, 0x3A, 0x1D, 0x34, 0xC6, 0x79, 0xB8, 0xB9, 0x8F, 0x1C, 0xE2, 0xBA, 0xA5,
0x9F, 0xBD, 0x4D, 0x45, 0x77, 0x33, 0x13, 0x74, 0x71, 0xEC, 0x73, 0x7F, 0xF7, 0xA6, 0xD5, 0x3D,
0xA2, 0x2F, 0x9D, 0x02, 0x56, 0xA6, 0xD6, 0x84, 0x84, 0xC0, 0xF4, 0x29, 0x93, 0xDA, 0x4D, 0x1C,
0x33, 0x58, 0x3D, 0xD7, 0x67, 0x6C, 0xF7, 0x79, 0x3E, 0xDE, 0xA6, 0x57, 0xCE, 0x9F, 0x6D, 0xFB,
0xB2, 0xAC, 0x14, 0xD2, 0x1E, 0xDE, 0x87, 0xC3, 0x3B, 0xBF, 0x83, 0xE3, 0xFB, 0x77, 0x42, 0xF8,
0xBA, 0x35, 0xFF, 0x44, 0xD8, 0x73, 0xD0, 0x20, 0x28, 0x8B, 0x3F, 0x02, 0x7F, 0x54, 0x3C, 0x80,
0x3F, 0x7E, 0xFD, 0xF0, 0x75, 0xB2, 0x0C, 0x44, 0xF8, 0xB7, 0xF7, 0x4D, 0xFF, 0x33, 0xC2, 0x9C,
0x20, 0xFC, 0x7F, 0x03, 0x84, 0xFF, 0x02, 0x5A, 0x10, 0xCA, 0x4C, 0xBE, 0xF8, 0xEB, 0xA7, 0x00,
0x00, 0x00, 0x00, 0x49, 0x45, 0x4E, 0x44, 0xAE, 0x42, 0x60, 0x82
};
const int doodleR_size = 12347;
|
the_stack_data/247017678.c
|
#include <stdio.h>
int main() {
printf("Hello world");
return 0;
}
|
the_stack_data/73718.c
|
#include <stdlib.h>
#include <math.h>
double do_pair_sum(double* restrict var, long ncells)
{
// Pair-wise sum
double *pwsum = (double *)malloc(ncells/2*sizeof(double));
long nmax = ncells/2;
for (long i = 0; i<nmax; i++){
pwsum[i] = var[i*2]+var[i*2+1];
}
for (long j = 1; j<log2(ncells); j++){
nmax /= 2;
for (long i = 0; i<nmax; i++){
pwsum[i] = pwsum[i*2]+pwsum[i*2+1];
}
}
double sum = pwsum[0];
free(pwsum);
return(sum);
}
|
the_stack_data/26699900.c
|
/* This file is part of The Firekylin Operating System.
*
* Copyright 2016 Liuxiaofeng
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <stdint.h>
uint64_t __umoddi3(uint64_t a, uint64_t b)
{
if (b == 0)
return (uint64_t) -1;
while (a > b)
a = a - b;
return a;
}
|
the_stack_data/75138995.c
|
#include <stdio.h>
#include <stdlib.h>
#define SIZE 100
char* turn(char *p,double *z){
while(*p>='0' && *p<='9'){
*z=(*z)*10;
*z+=(*p)-'0';
++p;
}
return p;
}
int main()
{
double first;
while(scanf("%lf",&first)!=EOF){
char str[SIZE];
char *p=str;
double y=0,z=0;
gets(str);
switch(*p){
case 'h':
++p;
switch(*p){
case 'o':
printf("%.0f\n",first*3600000);
break;
default:
p=turn(p,&y);
++p;
switch(*p){
case '\0':
printf("%.0f\n",(first*60+y)*60000);
break;
default:
p=turn(p,&z);
printf("%.0f\n",(first*60+y)*60000+z*1000);
break;
}
break;
}
break;
case 'm':
++p;
switch(*p){
case 'i':
printf("%.0f\n",first*60000);
break;
case 's':
printf("%.0f\n",first);
break;
default:
p=turn(p,&z);
printf("%.0f\n",(first*60+z)*1000);
break;
}
break;
case 's':
printf("%.0f\n",first*1000);
break;
}
}
}
|
the_stack_data/176704420.c
|
/*
* This program allows to get the 1s-complement and 2s-complement
* for a binary numbered string. More information on this can be
* found on the following link:-
* http://www.geeksforgeeks.org/1s-2s-complement-binary-number/
*/
#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
#include<stdbool.h>
#include<string.h>
/*
* This function checks if the given number string has only
* binary character symbols '0' and '1'. If the string comprises
* of any other characters, then this function returns 'false'
* otherwise this function returns 'true'. The time complexity of
* this function is O(n), where 'n' is the number of characters
* in the number string.
*/
bool check_if_string_is_binary (char* bin_num)
{
int len, i;
/*
* If the number string is NULL or has zero length,
* then return 'false'.
*/
if (!bin_num || !strlen(bin_num)) {
return(false);
}
i = 0;
while (bin_num[i]) {
/*
* If the character symbol is not one of '0' or '1', then
* return 'false' from this function
*/
if ((bin_num[i] != '0') && (bin_num[i] != '1')) {
return(false);
}
++i;
}
/*
* Return 'true' in case this is binary string
*/
return(true);
}
/*
* This function returns a 1s complement string for the binary
* number string. The time complexity of this function is O(n),
* where 'n' is the number of characters in the number string.
*/
char* get_1s_complement_for_binary_number_str (char* bin_num)
{
int len, i;
char* ones_complement;
/*
* If the number string is NULL or has zero length,
* then return NULL
*/
if (!bin_num || !strlen(bin_num)) {
return(NULL);
}
/*
* If the number string doesn't contain binary symbols,
* then return NULL
*/
if (!check_if_string_is_binary(bin_num)) {
return(NULL);
}
len = strlen(bin_num);
/*
* Allocate buffer space for ones complement string
*/
ones_complement = (char*)malloc(sizeof(char) * (len + 1));
/*
* If the allocated string is NULL, then return NULL
* from this function
*/
if (!ones_complement) {
return(NULL);
}
memset(ones_complement, 0, sizeof(char) * (len + 1));
/*
* Walk the binary string backwards and compute the ones
* complement
*/
for (i = len-1; i >= 0; --i) {
/*
* If the character is '0' in the binary string,
* then add '1' in the ones complement string otherwise
* add '0'
*/
if (bin_num[i] == '0') {
ones_complement[i] = '1';
} else {
ones_complement[i] = '0';
}
}
/*
* Return the ones complement string
*/
return(ones_complement);
}
/*
* This function returns a 2s complement string for the binary
* number string. The time complexity of this function is O(n),
* where 'n' is the number of characters in the number string.
*/
char* get_2s_complement_for_binary_number_str (char* bin_num)
{
int len, i;
char* twos_complement;
char* ones_complement;
char carry;
/*
* If the number string is NULL or has zero length,
* then return NULL
*/
if (!bin_num || !strlen(bin_num)) {
return(NULL);
}
/*
* If the number string doesn't contain binary symbols,
* then return NULL
*/
if (!check_if_string_is_binary(bin_num)) {
return(NULL);
}
/*
* Get the ones complement for binary number string
*/
ones_complement = get_1s_complement_for_binary_number_str(bin_num);
/*
* If getting the ones complement fails, then return NULL from
* the function
*/
if (!ones_complement) {
return(NULL);
}
len = strlen(bin_num);
/*
* Allocate buffer space for twos complement string
*/
twos_complement = (char*)malloc(sizeof(char) * (len + 1));
/*
* If the allocated string is NULL, then return NULL
* from this function
*/
if (!twos_complement) {
/*
* Free the ones complement string before returning from this
* this function
*/
free(ones_complement);
return(NULL);
}
memset(twos_complement, 0, sizeof(char) * (len + 1));
/*
* Walk the binary string backwards and compute the twos
* complement. The carry is set to one because we need to
* add one to ones complement
*/
carry = '1';
for (i = len - 1; i >= 0; --i) {
/*
* Take the xor of carry and ones complement string
* and store in twos complement string
*/
twos_complement[i] = '0'+ ((ones_complement[i] - '0') ^
(carry - '0'));
/*
* Set the 'carry' as and operation of ones complement
* and carry
*/
carry = '0' + ((ones_complement[i] - '0') & (carry - '0'));
}
/*
* Free ones complement string
*/
free(ones_complement);
/*
* Return the twos complement string
*/
return(twos_complement);
}
int main ()
{
/*
* Test 0: Test a 1s and 2s complement for a positive number
* binary string
*/
char* bin_num0 = "0101";
char* exp_1s_com0 = "1010";
char* exp_2s_com0 = "1011";
char* act_1s_com0 = get_1s_complement_for_binary_number_str(bin_num0);
char* act_2s_com0 = get_2s_complement_for_binary_number_str(bin_num0);
assert(0 == strcmp(exp_1s_com0, act_1s_com0));
assert(0 == strcmp(exp_2s_com0, act_2s_com0));
/*
* Test 1: Test a 1s and 2s complement for another positive number
* binary string
*/
char* bin_num1 = "00111111";
char* exp_1s_com1 = "11000000";
char* exp_2s_com1 = "11000001";
char* act_1s_com1 = get_1s_complement_for_binary_number_str(bin_num1);
char* act_2s_com1 = get_2s_complement_for_binary_number_str(bin_num1);
assert(0 == strcmp(exp_1s_com1, act_1s_com1));
assert(0 == strcmp(exp_2s_com1, act_2s_com1));
/*
* Test 2: Test a 1s and 2s complement for a non-binary number
* string
*/
char* bin_num2 = "21111111";
char* exp_1s_com2 = NULL;
char* exp_2s_com2 = NULL;
char* act_1s_com2 = get_1s_complement_for_binary_number_str(bin_num2);
char* act_2s_com2 = get_2s_complement_for_binary_number_str(bin_num2);
assert(exp_1s_com2 == act_1s_com2);
assert(exp_2s_com2 == act_2s_com2);
/*
* Test 3: Test a 1s and 2s complement for NULL binary number
* string
*/
char* bin_num3 = NULL;
char* exp_1s_com3 = NULL;
char* exp_2s_com3 = NULL;
char* act_1s_com3 = get_1s_complement_for_binary_number_str(bin_num3);
char* act_2s_com3 = get_2s_complement_for_binary_number_str(bin_num3);
assert(exp_1s_com3 == act_1s_com3);
assert(exp_2s_com3 == act_2s_com3);
/*
* Test 4: Test a 1s and 2s complement for an empty binary number
* string
*/
char* bin_num4 = "";
char* exp_1s_com4 = NULL;
char* exp_2s_com4 = NULL;
char* act_1s_com4 = get_1s_complement_for_binary_number_str(bin_num4);
char* act_2s_com4 = get_2s_complement_for_binary_number_str(bin_num4);
assert(exp_1s_com4 == act_1s_com4);
assert(exp_2s_com4 == act_2s_com4);
return(0);
}
|
the_stack_data/72490.c
|
#include <stdlib.h> // malloc
#include "./string.h"
int ToLower(char a);
/*
Pasudo Code strcpy:
1. set i = 0, j = 0;
2. while src[i] is not NULL will iterate
2.1 dest[j] = src[i]
2.2 i++
2.3 j++
3. set dest[j] = '\0'
4. return dest
*/
char *strcpy(char *dest, const char *src)
{
int i = 0, j = 0;
while (src[i] != '\0')
{
dest[j] = src[i];
i++;
j++;
}
dest[j] = '\0';
return (dest);
}
/*
Pasudo Code strncpy:
1. set i = 0
2. for i < n and src[i] != '\0'
2.1 set dest[i] = src[i]
3. while i <n
3.1 dest[i] = '\0'
3.2 i++
4. return dest
*/
char *strncpy(char *dest, const char *src, size_t n)
{
size_t i = 0;
for (i = 0; i < n && src[i] != '\0'; i++)
{
dest[i] = src[i];
}
dest[i] = '\0';
return (dest);
}
/*Appends the string pointed to, by src to the end of the string pointed to by dest.
1. set char *temp = dest +str(dest)
2. while *src != '\0
2.1 *temp = *src
2.2 temp++;
2.3 src++;
3. *temp = '\0'
4. return dest
*/
char *strcat(char *dest, const char *src)
{
char *temp = dest + (strlen(dest));
int size = strlen(src);
int i = 0;
while (i < size)
{
*temp = *src;
temp++;
src++;
i++;
}
*temp = '\0';
return (dest);
}
/*Appends the string pointed to, by src to the end of the string pointed to, by dest up to n characters long.
1. set char *temp = dest +strlen(dest)
2. while *src != '\0' AND n > o
2.1 *temp = *src
2.2 temp++
2.3 src++
2.4 n--
3. *temp = '\0'
4. return dest
*/
char *strncat(char *dest, const char *src, size_t n)
{
char *temp = dest + strlen(dest);
while (*src != '\0' && n>0)
{
*temp = *src;
temp++;
src++;
n--;
}
*temp = '\0';
return (dest);
}
//Searches for the first occurrence of the character c (an unsigned char) in the string pointed to, by the argument str.
/*
1. set char temp - src
2. while *temp != NULL
2.1 if temp == c
2.1.1 return temp
2.2 ++temp
3. return NULL
*/
char *strchr(const char *str, int c)
{
char *temp = (char *)str;
while (*temp != '\0')
{
if (*temp == c)
{
return temp;
}
++temp;
}
return (NULL);
}
/*Calculates the length of the initial segment of str1 which consists entirely of characters in str2.
1. set size_t size = 0
2. while *str1 != '\0'
2.1 if strchr(str2, *str1)
2.1.2 size++
2.2 str1++
3. retur size_t
*/
size_t strspn(const char *str1, const char *str2)
{
size_t size = 0;
while (*str1 != '\0')
{
if (strchr(str2, *str1) != NULL)
{
size++;
}
str1++;
}
return (size);
}
/*Finds the first occurrence of the entire string needle (not including the terminating null character) which appears in the string haystack.
1. set int i = 0, j = o ,TempIndex
2. set const char * TempPointer = NULL
3. for i < strlen(haystack)
3.1 if haystack[i] == needle[j]
3.1.1 TempPointer = &haystack[i]
3.1.2 TempIndex = i
3.1.3 while haystack[i] == needle[j]
3.1.3.1 i++
3.1.3.2 j++
3.1.4 if j == strlen(neddle)
3.1.4.1 return (TempPointer)
3.1.4 i = TempIndex
3.1.5 j = 0
4. return (NULL)
*/
char *strstr(const char *haystack, const char *needle)
{
int i = 0;
int j = 0;
int TempIndex = 0;
char * TempPointer = NULL;
for ( i = 0; i < strlen(haystack); i++)
{
if (haystack[i] == needle[j])
{
TempPointer = (char *)&haystack[i];
TempIndex = i;
while (haystack[i] == needle[j] && needle[j] != '\0')
{
i++;
j++;
}
if (j == (strlen(needle)))
{
return (TempPointer);
}
i = TempIndex;
j = 0;
}
}
return (NULL);
}
/*Breaks string str into a series of tokens separated by delim.
1. if str != null
1.2 set static varibles:
static char *string = str
static int index = 0
Itirate on delim[i]:
if delim[i] in string
*/
char *strtok(char *str, const char *delim)
{
static char *string;
static int index;
static int size;
static char *EndString;
int i = 0;
char *PointerDelim = NULL;
char *Token = NULL;
char *TempToken = NULL;
if(str != NULL)
{
string = str;
index = 0;
size = strlen(str);
EndString = str + size;
}
if (string == EndString)
{
return (NULL);
}
for ( i = 0; i < strlen(delim); i++)
{
PointerDelim = strchr(string, delim[i]);
if (PointerDelim != NULL)
{
break;
}
}
if(PointerDelim == NULL)
{
if(*string != '\0' && index != 0)
{
PointerDelim = string + (size - index);
}
else
{
return (NULL);
}
}
Token = (char *)malloc(sizeof(char) * (PointerDelim - string + 1));
if(Token == NULL)
{
printf("ERROR allocation memory in malloc.\n");
exit(0);
}
else
{
TempToken = Token;
while(string != PointerDelim)
{
*Token = *string;
Token++;
string++;
index++;
}
if( string != EndString)
{
*string = '\0';
string++;
index++;
}
*Token = '\0';
return (TempToken);
}
}
/*compares string1 and string2 without sensitivity to case. All alphabetic characters in string1 and string2 are converted to lowercase before comparison.
1. while *string != NULL AND (ToLower(*string1)- ToLower(*string2)) == 0
1.1 string1++;
1.2 string2++;
2. return (ToLower(*string1) - ToLower(*string2))
*/
int strcasecmp(const char *string1, const char *string2)
{
while ((ToLower(*string1)- ToLower(*string2)) == 0 && *string1 != '\0')
{
string1++;
string2++;
}
return (ToLower(*string1) - ToLower(*string2));
}
|
the_stack_data/218893684.c
|
/*
20080913
D. J. Bernstein
Public domain.
*/
#include "sha512.h"
//extern int crypto_hashblocks(unsigned char *statebytes,const unsigned char *in,unsigned long long inlen);
#define blocks crypto_hashblocks
typedef unsigned long long uint64;
static const unsigned char iv[64] = {
0x6a,0x09,0xe6,0x67,0xf3,0xbc,0xc9,0x08,
0xbb,0x67,0xae,0x85,0x84,0xca,0xa7,0x3b,
0x3c,0x6e,0xf3,0x72,0xfe,0x94,0xf8,0x2b,
0xa5,0x4f,0xf5,0x3a,0x5f,0x1d,0x36,0xf1,
0x51,0x0e,0x52,0x7f,0xad,0xe6,0x82,0xd1,
0x9b,0x05,0x68,0x8c,0x2b,0x3e,0x6c,0x1f,
0x1f,0x83,0xd9,0xab,0xfb,0x41,0xbd,0x6b,
0x5b,0xe0,0xcd,0x19,0x13,0x7e,0x21,0x79
} ;
static uint64 load_bigendian(const unsigned char *x)
{
return
(uint64) (x[7]) \
| (((uint64) (x[6])) << 8) \
| (((uint64) (x[5])) << 16) \
| (((uint64) (x[4])) << 24) \
| (((uint64) (x[3])) << 32) \
| (((uint64) (x[2])) << 40) \
| (((uint64) (x[1])) << 48) \
| (((uint64) (x[0])) << 56)
;
}
static void store_bigendian(unsigned char *x,uint64 u)
{
x[7] = u; u >>= 8;
x[6] = u; u >>= 8;
x[5] = u; u >>= 8;
x[4] = u; u >>= 8;
x[3] = u; u >>= 8;
x[2] = u; u >>= 8;
x[1] = u; u >>= 8;
x[0] = u;
}
#define SHR(x,c) ((x) >> (c))
#define ROTR(x,c) (((x) >> (c)) | ((x) << (64 - (c))))
#define Ch(x,y,z) ((x & y) ^ (~x & z))
#define Maj(x,y,z) ((x & y) ^ (x & z) ^ (y & z))
#define Sigma0(x) (ROTR(x,28) ^ ROTR(x,34) ^ ROTR(x,39))
#define Sigma1(x) (ROTR(x,14) ^ ROTR(x,18) ^ ROTR(x,41))
#define sigma0(x) (ROTR(x, 1) ^ ROTR(x, 8) ^ SHR(x,7))
#define sigma1(x) (ROTR(x,19) ^ ROTR(x,61) ^ SHR(x,6))
#define M(w0,w14,w9,w1) w0 = sigma1(w14) + w9 + sigma0(w1) + w0;
#define EXPAND \
M(w0 ,w14,w9 ,w1 ) \
M(w1 ,w15,w10,w2 ) \
M(w2 ,w0 ,w11,w3 ) \
M(w3 ,w1 ,w12,w4 ) \
M(w4 ,w2 ,w13,w5 ) \
M(w5 ,w3 ,w14,w6 ) \
M(w6 ,w4 ,w15,w7 ) \
M(w7 ,w5 ,w0 ,w8 ) \
M(w8 ,w6 ,w1 ,w9 ) \
M(w9 ,w7 ,w2 ,w10) \
M(w10,w8 ,w3 ,w11) \
M(w11,w9 ,w4 ,w12) \
M(w12,w10,w5 ,w13) \
M(w13,w11,w6 ,w14) \
M(w14,w12,w7 ,w15) \
M(w15,w13,w8 ,w0 )
#define F(w,k) \
T1 = h + Sigma1(e) + Ch(e,f,g) + k + w; \
T2 = Sigma0(a) + Maj(a,b,c); \
h = g; \
g = f; \
f = e; \
e = d + T1; \
d = c; \
c = b; \
b = a; \
a = T1 + T2;
int crypto_hashblocks(unsigned char *statebytes,const unsigned char *in,unsigned long long inlen)
{
uint64 state[8];
uint64 a;
uint64 b;
uint64 c;
uint64 d;
uint64 e;
uint64 f;
uint64 g;
uint64 h;
uint64 T1;
uint64 T2;
a = load_bigendian(statebytes + 0); state[0] = a;
b = load_bigendian(statebytes + 8); state[1] = b;
c = load_bigendian(statebytes + 16); state[2] = c;
d = load_bigendian(statebytes + 24); state[3] = d;
e = load_bigendian(statebytes + 32); state[4] = e;
f = load_bigendian(statebytes + 40); state[5] = f;
g = load_bigendian(statebytes + 48); state[6] = g;
h = load_bigendian(statebytes + 56); state[7] = h;
while (inlen >= 128) {
uint64 w0 = load_bigendian(in + 0);
uint64 w1 = load_bigendian(in + 8);
uint64 w2 = load_bigendian(in + 16);
uint64 w3 = load_bigendian(in + 24);
uint64 w4 = load_bigendian(in + 32);
uint64 w5 = load_bigendian(in + 40);
uint64 w6 = load_bigendian(in + 48);
uint64 w7 = load_bigendian(in + 56);
uint64 w8 = load_bigendian(in + 64);
uint64 w9 = load_bigendian(in + 72);
uint64 w10 = load_bigendian(in + 80);
uint64 w11 = load_bigendian(in + 88);
uint64 w12 = load_bigendian(in + 96);
uint64 w13 = load_bigendian(in + 104);
uint64 w14 = load_bigendian(in + 112);
uint64 w15 = load_bigendian(in + 120);
F(w0 ,0x428a2f98d728ae22ULL)
F(w1 ,0x7137449123ef65cdULL)
F(w2 ,0xb5c0fbcfec4d3b2fULL)
F(w3 ,0xe9b5dba58189dbbcULL)
F(w4 ,0x3956c25bf348b538ULL)
F(w5 ,0x59f111f1b605d019ULL)
F(w6 ,0x923f82a4af194f9bULL)
F(w7 ,0xab1c5ed5da6d8118ULL)
F(w8 ,0xd807aa98a3030242ULL)
F(w9 ,0x12835b0145706fbeULL)
F(w10,0x243185be4ee4b28cULL)
F(w11,0x550c7dc3d5ffb4e2ULL)
F(w12,0x72be5d74f27b896fULL)
F(w13,0x80deb1fe3b1696b1ULL)
F(w14,0x9bdc06a725c71235ULL)
F(w15,0xc19bf174cf692694ULL)
EXPAND
F(w0 ,0xe49b69c19ef14ad2ULL)
F(w1 ,0xefbe4786384f25e3ULL)
F(w2 ,0x0fc19dc68b8cd5b5ULL)
F(w3 ,0x240ca1cc77ac9c65ULL)
F(w4 ,0x2de92c6f592b0275ULL)
F(w5 ,0x4a7484aa6ea6e483ULL)
F(w6 ,0x5cb0a9dcbd41fbd4ULL)
F(w7 ,0x76f988da831153b5ULL)
F(w8 ,0x983e5152ee66dfabULL)
F(w9 ,0xa831c66d2db43210ULL)
F(w10,0xb00327c898fb213fULL)
F(w11,0xbf597fc7beef0ee4ULL)
F(w12,0xc6e00bf33da88fc2ULL)
F(w13,0xd5a79147930aa725ULL)
F(w14,0x06ca6351e003826fULL)
F(w15,0x142929670a0e6e70ULL)
EXPAND
F(w0 ,0x27b70a8546d22ffcULL)
F(w1 ,0x2e1b21385c26c926ULL)
F(w2 ,0x4d2c6dfc5ac42aedULL)
F(w3 ,0x53380d139d95b3dfULL)
F(w4 ,0x650a73548baf63deULL)
F(w5 ,0x766a0abb3c77b2a8ULL)
F(w6 ,0x81c2c92e47edaee6ULL)
F(w7 ,0x92722c851482353bULL)
F(w8 ,0xa2bfe8a14cf10364ULL)
F(w9 ,0xa81a664bbc423001ULL)
F(w10,0xc24b8b70d0f89791ULL)
F(w11,0xc76c51a30654be30ULL)
F(w12,0xd192e819d6ef5218ULL)
F(w13,0xd69906245565a910ULL)
F(w14,0xf40e35855771202aULL)
F(w15,0x106aa07032bbd1b8ULL)
EXPAND
F(w0 ,0x19a4c116b8d2d0c8ULL)
F(w1 ,0x1e376c085141ab53ULL)
F(w2 ,0x2748774cdf8eeb99ULL)
F(w3 ,0x34b0bcb5e19b48a8ULL)
F(w4 ,0x391c0cb3c5c95a63ULL)
F(w5 ,0x4ed8aa4ae3418acbULL)
F(w6 ,0x5b9cca4f7763e373ULL)
F(w7 ,0x682e6ff3d6b2b8a3ULL)
F(w8 ,0x748f82ee5defb2fcULL)
F(w9 ,0x78a5636f43172f60ULL)
F(w10,0x84c87814a1f0ab72ULL)
F(w11,0x8cc702081a6439ecULL)
F(w12,0x90befffa23631e28ULL)
F(w13,0xa4506cebde82bde9ULL)
F(w14,0xbef9a3f7b2c67915ULL)
F(w15,0xc67178f2e372532bULL)
EXPAND
F(w0 ,0xca273eceea26619cULL)
F(w1 ,0xd186b8c721c0c207ULL)
F(w2 ,0xeada7dd6cde0eb1eULL)
F(w3 ,0xf57d4f7fee6ed178ULL)
F(w4 ,0x06f067aa72176fbaULL)
F(w5 ,0x0a637dc5a2c898a6ULL)
F(w6 ,0x113f9804bef90daeULL)
F(w7 ,0x1b710b35131c471bULL)
F(w8 ,0x28db77f523047d84ULL)
F(w9 ,0x32caab7b40c72493ULL)
F(w10,0x3c9ebe0a15c9bebcULL)
F(w11,0x431d67c49c100d4cULL)
F(w12,0x4cc5d4becb3e42b6ULL)
F(w13,0x597f299cfc657e2aULL)
F(w14,0x5fcb6fab3ad6faecULL)
F(w15,0x6c44198c4a475817ULL)
a += state[0];
b += state[1];
c += state[2];
d += state[3];
e += state[4];
f += state[5];
g += state[6];
h += state[7];
state[0] = a;
state[1] = b;
state[2] = c;
state[3] = d;
state[4] = e;
state[5] = f;
state[6] = g;
state[7] = h;
in += 128;
inlen -= 128;
}
store_bigendian(statebytes + 0,state[0]);
store_bigendian(statebytes + 8,state[1]);
store_bigendian(statebytes + 16,state[2]);
store_bigendian(statebytes + 24,state[3]);
store_bigendian(statebytes + 32,state[4]);
store_bigendian(statebytes + 40,state[5]);
store_bigendian(statebytes + 48,state[6]);
store_bigendian(statebytes + 56,state[7]);
return inlen;
}
int crypto_hash_sha512(unsigned char *out,const unsigned char *in,unsigned long long inlen)
{
unsigned char h[64];
unsigned char padded[256];
int i;
unsigned long long bytes = inlen;
for (i = 0;i < 64;++i) h[i] = iv[i];
blocks(h,in,inlen);
in += inlen;
inlen &= 127;
in -= inlen;
for (i = 0;i < inlen;++i) padded[i] = in[i];
padded[inlen] = 0x80;
if (inlen < 112) {
for (i = inlen + 1;i < 119;++i) padded[i] = 0;
padded[119] = bytes >> 61;
padded[120] = bytes >> 53;
padded[121] = bytes >> 45;
padded[122] = bytes >> 37;
padded[123] = bytes >> 29;
padded[124] = bytes >> 21;
padded[125] = bytes >> 13;
padded[126] = bytes >> 5;
padded[127] = bytes << 3;
blocks(h,padded,128);
} else {
for (i = inlen + 1;i < 247;++i) padded[i] = 0;
padded[247] = bytes >> 61;
padded[248] = bytes >> 53;
padded[249] = bytes >> 45;
padded[250] = bytes >> 37;
padded[251] = bytes >> 29;
padded[252] = bytes >> 21;
padded[253] = bytes >> 13;
padded[254] = bytes >> 5;
padded[255] = bytes << 3;
blocks(h,padded,256);
}
for (i = 0;i < 64;++i) out[i] = h[i];
return 0;
}
|
the_stack_data/214440.c
|
#include <omp.h>
#include <stdlib.h>
int
main (void)
{
int i = 0, j = 0, k = 0, l = 0;
#pragma omp parallel num_threads(4) reduction(-:i) reduction(|:k) \
reduction(^:l)
{
if (i != 0 || k != 0 || l != 0)
#pragma omp atomic
j |= 1;
if (omp_get_num_threads () != 4)
#pragma omp atomic
j |= 2;
i = omp_get_thread_num ();
k = 1 << (2 * i);
l = 0xea << (3 * i);
}
if (j & 1)
abort ();
if ((j & 2) == 0)
{
if (i != (0 + 1 + 2 + 3))
abort ();
if (k != 0x55)
abort ();
if (l != 0x1e93a)
abort ();
}
return 0;
}
|
the_stack_data/156394054.c
|
#include <pthread.h>
#include <unistd.h>
#include <stdlib.h>
#include <stdio.h>
void *threadFunc(void* arg) {
int i;
for (i = 0; i < 3;i++){
printf("I'm threadFunc: %d\n", i);
sleep(1);
}
return NULL;
}
int main(void){
pthread_t thread;
int i;
if(pthread_create(&thread, NULL, threadFunc, NULL) != 0){
printf("Error: Faild to createb new thread.\n");
exit(1);
}
for (i = 0; i < 5; i++) {
printf("I'm main: %d\n", i);
sleep(1);
}
return 0;
}
|
the_stack_data/37637809.c
|
#include <stdio.h>
int main()
{
int a,b,s=0,n,t,i;
scanf("%d",&n);
for(i=1; i<=n; i++)
{
scanf("%d",&a);
for(t=2; t<a; t++)
{
if(a%t==0)
s++;
}
if(s==0) printf("%d eh primo\n",a);
else printf("%d nao eh primo\n",a);
s=0;
}
return 0;
}
|
the_stack_data/15763670.c
|
#include <stdio.h>
int main(void) {
float dolar_price, valor_convertido, valor_real = 0;
printf("Reais a converter:\n");
scanf("%f", &valor_real);
printf("Digite a cotação do dolar:\n");
scanf("%f", &dolar_price);
valor_convertido = (valor_real / dolar_price);
printf("O valor R${%.2f} em dolares americanos é US${%.2f}\n", valor_real, valor_convertido);
}
|
the_stack_data/225142395.c
|
#define _GNU_SOURCE 52
#include<dlfcn.h>/*s*/
#i\
nc\
lu\
de<string.h>/*('-' )*/
#include<sys/mman.h>/*
h*/
#i\
nc\
lude<stdlib.h>/*('')*/
#include<unistd.h>/**/
#i\
nc\
lu\
de\
<s\
td\
io\
.h>
#d\
ef\
ine A return/*( '-')*/
char T[]="stdout!dlsy"
"m!lseek!stderr!mmap!\
__libc_start_main",t,*H,**P,*O;
#define I int/*('-')*/
#define e(c,m)c?exit(\
(/*
ELF
ELF
ELF
ELF
*/perror\
(m),1)):1
I*Y(I*h,char*p){A dlsym(h?h:RTLD_DEFAULT,p);}
I*E,i,k,F,L;
I*W(void*a,size_t l,I p,I f,I d,I o){A mmap(a,l,p,(f&31)|(f&32?MAP_ANON:0),d,o);}
I*__rawmemchr(I*s,I c){A memchr(s,c,1<<30);}
I*V,J,D[99],M,Q,N,*K;
I X(I f,I o,I w){A lseek(f,o,w);}
;;I Z(I(*m)()){exit(m(Q,P,0));}
void*U[]={0,Y,X,0,W,Z};
I main(I S,char**R){
Q=S-1;P=R+1;e(!Q,"Usage: elf <elf>");F=fileno(fopen(*P,"r"));E=W(0,N=4095,7,S=MAP_PRIVATE,F,0);L=512;
e(7417633*159-*E,"not");e(E[4]-L*384-2,"\
not"" i\
386"" e\
xec");
;;
for(K=E+=13;K<E+E[-2]%65536*8;K+=8){U[3]=&stderr;O=(char*)K[2];
;
if(*K==1)O/**/-=M=K[2]&N,e(W(O,J=(K[5]+M+N)&~N,7,S|MAP_FIXED,F,K[1]-M)==MAP_FAILED,"mma\
p"),L=K[4]/**/+M,/*i"n*/*U=&std\
out,mem\
set(O+L,0,J-L);;
if(*K==2){I*G;for(;*O;O+=8)D[*O&63]=1[(I*)O];e(!D[6]|!D[5],"inv\
ali"/*h"*/"d");;for(i=-D[2];i<D[18];i+=8)t=M=1[V=(I*)((i<0?D[23]+D[2]:D[17])+i)],V=(I*)*V,O=strstr(T,H=*((char**)D[6]+M/256*4)+D[5]),G=O?U[(O-T)/6]:Y(0,H),*V=t-5?(t<7)**V+t%2*(I)G:*G;}}A(((I(*)())E[-7])());}
|
the_stack_data/179829499.c
|
#include <stdio.h>
#include <string.h>
int wcount(char *s)
{
int n = 0, i, k = strlen(s);
for (i = 0; i < k - 1; i++)
{
if (s[i] != ' ')
{
n++;
}
}
return n;
}
int main()
{
char s[1024];
fgets(s,1024,stdin);
fputs(wcount(s), stdout);
return 0;
}
|
the_stack_data/11075097.c
|
/*Program to illustrate a structure*/
#include <stdio.h>
int main ( void )
{
//Defining structure for storing a date
struct date
{
int day ;
int month ;
int year ;
} ;
//Declaring date structure variable
struct date today ;
//Assgining values
today.month = 04 ;
today.day = 30 ;
today.year = 2007 ;
//Printing the date
printf ( "The date today is %i/%i/%.2i, in the %ist century\n", today.month, today.day, today.year % 100, today.year / 100 + 1 ) ;
return 0 ;
}
|
the_stack_data/523541.c
|
#include <stdio.h>
int main() {
char* curso = "Ciencia da Computacao"; // curso a ser imprimido
int n; // número de cursos da lista
int i;
// alocar memória à lista
char lista[scanf("%d", &n)][100];
for (i = 0; n >= 0; n--, i++)
fgets(lista[n], sizeof(lista[n]), stdin);
printf("%s\n", curso);
}
|
the_stack_data/83304.c
|
void bar (void);
void
foo (int *diff)
{
double deltay = 0.0;
int Stangent = 0;
int mindiff;
int Sflipped = 0;
int i;
int Sturn, Snofit;
Sturn = 1;
if (Sturn)
Stangent = 1;
if (Sturn)
{
Sflipped = 0;
Snofit = 1;
while (Snofit)
{
Snofit = 0;
mindiff = 0;
for (i = 0; i < 4; i++)
mindiff = diff[i];
while (!Snofit && (mindiff < 0.0))
{
deltay = (Stangent ? deltay : 0.0);
if (deltay < 0.0)
Snofit = 1;
for (i = 0; i < 4; i++)
{
}
}
if (Snofit)
if (Sflipped)
break;
}
if (Snofit)
bar ();
}
}
|
the_stack_data/232954919.c
|
/* { dg-do compile { target { ! ia32 } } } */
/* { dg-skip-if "" { *-*-* } { "-march=*" } { "-march=atom" } } */
/* { dg-options "-O2 -fomit-frame-pointer -march=atom" } */
/* { dg-final { scan-assembler-times "nop" 4 { target { ! x86_64-*-mingw* } } } } */
/* { dg-final { scan-assembler-times "nop" 2 { target { x86_64-*-mingw* } } } } */
/* { dg-final { scan-assembler-not "rep" } } */
extern void bar (void);
void
foo (int x)
{
if (x)
bar ();
}
|
the_stack_data/1132764.c
|
#include <stdlib.h>
#include <unistd.h>
#include <stdio.h>
#include <string.h>
int main() {
int control;
char buf1[64];
control = 32;
read(STDIN_FILENO, buf1, 80);
return 0;
}
|
the_stack_data/115764724.c
|
#define _XOPEN_SOURCE 700
#include <errno.h>
#include <fcntl.h>
#include <ftw.h>
#include <stdio.h>
#include <string.h>
#include <sqlite3.h>
#include <sys/mman.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <unistd.h>
#define LEN(x) (sizeof(x)/sizeof((x)[0]))
#define INSERT_QUERY "INSERT INTO library VALUES (?, ?)"
static sqlite3 *db;
static sqlite3_stmt *insert_stmt;
static char *suffixes[] = {
".h",
".c",
".S",
".sh",
".txt"
};
static int
step(const char *path, const struct stat *sb, int flag, struct FTW *ftwbuf)
{
size_t plen;
size_t i;
int fd;
char *fbuf;
int rc;
if(flag != FTW_F) {
return 0;
}
plen = strlen(path);
for(i = 0; i < LEN(suffixes); i++) {
size_t slen = strlen(suffixes[i]);
if(plen > slen && !memcmp(path + plen - slen, suffixes[i], slen)) {
break;
}
}
if(i == LEN(suffixes)) {
return 0;
}
if(sqlite3_reset(insert_stmt) != SQLITE_OK) {
fprintf(stderr, "sqlite3_reset failed: %s\n", sqlite3_errmsg(db));
return -1;
}
if(sqlite3_bind_text(insert_stmt, 1, path, strlen(path), SQLITE_TRANSIENT) != SQLITE_OK) {
fprintf(stderr, "sqlite3_bind_text path failed: %s\n", sqlite3_errmsg(db));
return -1;
}
fd = open(path, O_RDONLY);
if(fd < 0) {
fprintf(stderr, "open %s failed: %s\n", path, strerror(errno));
return -1;
}
fbuf = mmap(NULL, sb->st_size, PROT_READ, MAP_SHARED, fd, 0);
if(fbuf == NULL) {
fprintf(stderr, "mmap %s failed: %s\n", path, strerror(errno));
return -1;
}
rc = sqlite3_bind_text(insert_stmt, 2, fbuf, sb->st_size, SQLITE_TRANSIENT);
munmap(fbuf, sb->st_size);
close(fd);
if(rc != SQLITE_OK) {
fprintf(stderr, "sqlite3_bind_text body failed: %s\n", sqlite3_errmsg(db));
return -1;
}
if(sqlite3_step(insert_stmt) != SQLITE_DONE) {
fprintf(stderr, "sqlite3_step failed: %s\n", sqlite3_errmsg(db));
return -1;
}
return 0;
}
int
main(int argc, char *argv[])
{
int rc = -1;
char *err = 0;
if(sqlite3_open(argv[1], &db) != SQLITE_OK) {
fprintf(stderr, "sqlite3_open failed: %s\n", sqlite3_errmsg(db));
goto out_close_db;
}
if(sqlite3_exec(db, "CREATE VIRTUAL TABLE library USING fts5(path, content)", NULL, NULL, &err) != SQLITE_OK) {
fprintf(stderr, "sqlite3_exec failed: %s\n", err);
sqlite3_free(err);
goto out_close_db;
}
if(sqlite3_prepare_v2(db, INSERT_QUERY, sizeof(INSERT_QUERY), &insert_stmt, NULL) != SQLITE_OK) {
fprintf(stderr, "sqlite3_prepare_v2 failed: %s\n", sqlite3_errmsg(db));
goto out_close_db;
}
rc = nftw(argv[2], step, 16, 0);
if(rc) {
fprintf(stderr, "ntfw failed: %s\n", strerror(errno));
}
sqlite3_finalize(insert_stmt);
out_close_db:
sqlite3_close(db);
return rc;
}
|
the_stack_data/63642.c
|
/*
module: tmatch.c
author: egm
date: 10/30/86
purpose: match templates ala the c shell
routines:
tmatch, checkrange
*/
/*
* Copyrights:
*
* Copyright (c) 1996 Smithsonian Astrophysical Observatory
*
* Permission to use, copy, modify, distribute, and sell this
* software and its documentation for any purpose is hereby
* granted without fee, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting docu-
* mentation, and that the name of the Smithsonian Astro-
* physical Observatory not be used in advertising or publicity
* pertaining to distribution of the software without specific,
* written prior permission. The Smithsonian Astrophysical
* Observatory makes no representations about the suitability
* of this software for any purpose. It is provided "as is"
* without express or implied warranty.
* THE SMITHSONIAN ASTROPHYSICAL OBSERVATORY DISCLAIMS ALL
* WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
* EVENT SHALL THE SMITHSONIAN ASTROPHYSICAL OBSERVATORY BE
* LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES
* OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA
* OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
* OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH
* THE USE OR PERFORMANCE OF THIS SOFTWARE.
*
*/
#include <stdio.h>
#include <string.h>
/* #define DEBUG */
#define ALL '*'
#define ANY '?'
#define RANGE '['
#define ENDRANGE ']'
#define RANGEDELIM '-'
#define NOTRANGE '~'
#define EOS '\0'
#define TRUE 1
#define FALSE 0
#define ERROR 1
/*
tmatch - match string to a template
return non-zero if match, zero otherwise
the legal meta characters in a template are just like the
C-shell meta characters, i.e:
? match any character, but there must be one
* match anything, or nothing
[<c>...] match an inclusive set
*/
int tmatch(string, template)
char *string;
char *template;
{
char *lastmeta=0;
char *nonabsorbed=0;
int sptr=0;
int tptr=0;
/* loop through string and template */
while( (template[tptr] != EOS) || (string[sptr] != EOS) ){
#ifdef DEBUG
printf("s,t: %s,%s\n", &string[sptr], &template[tptr]);
#endif
/* if exact match, just bump both pointers */
if( string[sptr] == template[tptr] ){
sptr++; tptr++; continue;
}
/* if range character, check ranges */
if( template[tptr] == RANGE ){
if( checkrange(template, &tptr, string[sptr]) == FALSE ){
/* no match - was there a meta character before */
if( lastmeta == 0 ) return(FALSE);
/* if so, back up to it and try again */
template = lastmeta; tptr=0;
/* begin checking at the non-absorbed point */
string = nonabsorbed; sptr=0;
continue;
}
/* got a match, so bump past */
else{
sptr++; continue;
}
}
/* if ANY, any character if fine, but there must be one */
if( template[tptr] == ANY ){
if( string[sptr] == EOS )
return(FALSE);
else{
sptr++; tptr++; continue;
}
}
/* if ALL, we can match anything */
if( template[tptr] == ALL ){
/* remember where the * is */
lastmeta = &template[tptr];
tptr++;
/* no more template after this means a win */
if( template[tptr] == EOS ) return(TRUE);
/* if the next template char is not a meta,
we skip up to its match in the string */
if( template[tptr] == RANGE){
while( checkrange(template, &tptr, string[sptr]) == FALSE ){
/* missing the next template char */
if( string[sptr] == EOS ) return(FALSE);
sptr++;
}
/* remember the first non-absorbed character */
nonabsorbed = &string[sptr];nonabsorbed++;
sptr++;
continue;
}
/* skip past characters, if next template char is not a meta */
else if( template[tptr] != ANY && template[tptr] != ALL ){
while(string[sptr] != template[tptr]){
/* not finding the next template char
is bad */
if( string[sptr] == EOS ) return(FALSE);
sptr++;
}
/* remember the first non-absorbed character */
nonabsorbed = &string[sptr];nonabsorbed++;
continue;
}
else{
/* remember the first non-absorbed character */
nonabsorbed = &string[sptr];nonabsorbed++;
continue;
}
}
/* no match, no meta char - see if we once had a meta */
else{
if( lastmeta == 0 ) return(FALSE);
/* if so, back up to it and try again */
template = lastmeta; tptr=0;
/* begin checking at the non-absorbed point */
string = nonabsorbed; sptr=0;
continue;
}
}
/* matched to the nulls - we win */
return(TRUE);
}
/*
checkrange - see if character is in specified range
*/
int checkrange(template, ptr, c)
char *template;
int *ptr;
int c;
{
int inrange, notrange;
char lorange, hirange;
int tptr;
tptr = *ptr;
/* make sure we have a close bracket */
if( strchr(&template[tptr], ENDRANGE) == (char *)0 )
return(FALSE);
/* check for negation - match if not in range */
if( template [tptr+1] == NOTRANGE ){
notrange = 1; tptr++;
}
else
notrange = 0;
/* start pessimistically */
inrange = 0;
/* point past RANGE character */
tptr++;
while( template[tptr] != ENDRANGE ){
/* get lo range */
lorange = template[tptr];
/* and hi range */
tptr++;
if( template[tptr] != RANGEDELIM )
hirange = lorange;
else{
tptr++;hirange = template[tptr];tptr++;
}
if( (c>=lorange) && (c<=hirange) ){
inrange = 1; break;
}
}
/* only exclusive OR of inrange and notrange is ok */
if( (inrange ^ notrange) ==0 )
return(FALSE);
else{
*ptr = strchr(&template[tptr],']') - template + 1;
return(TRUE);
}
}
|
the_stack_data/44104.c
|
#ifdef GENERATE_TRACE
#if defined(HAS_UNISTD_H)
#include <unistd.h>
#endif
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <string.h>
#include "bdd.h"
#ifndef EXIT_FAILURE
#define EXIT_FAILURE -1
#endif
/* Simple trace file generation */
#define FAST_MALLOC
#ifdef FAST_MALLOC
static char* bufferStart = 0;
static char* bufferPtr = 0;
static char* bufferEnd = 0;
static int startSize = 1<<16;
static void grow_malloc(int sz)
{
int oldSize, newSize;
oldSize = bufferEnd - bufferStart;
newSize = oldSize*2;
if (newSize < oldSize+sz) newSize = oldSize+sz;
if (newSize < startSize) newSize = startSize;
bufferStart = malloc(newSize);
assert(bufferStart);
bufferPtr = bufferStart;
bufferEnd = bufferStart + newSize;
}
static __inline__ void * xmalloc(int sz)
{
void * retval;
if (bufferEnd - bufferPtr < sz) {
grow_malloc(sz);
}
retval = bufferPtr;
bufferPtr += sz;
return retval;
}
#else
static __inline__ void * xmalloc(int sz)
{
void * retval = malloc(sz);
assert(retval);
return retval;
}
#endif
FILE * tracefp;
const char * trace_fname;
#define NR_TABLE (1<<16)
#define HASH_MASK ((NR_TABLE)-1)
struct bdd_decl
{
struct bdd_decl * next;
union
{
BDD bval;
bddPair * pval;
};
int is_pair, is_collected;
const char * identifier;
};
struct bdd_decl * decltbl[NR_TABLE];
struct bdd_arg
{
struct bdd_arg * next;
enum arg_type type;
union
{
const char * ident; /* T_BDD, T_BDD_PAIR */
struct /* T_BDD_PTR */
{
BDD * barr;
int blen;
};
struct /* T_INT_PTR */
{
int * iarr;
int len;
};
char * str; /* T_CHAR_PTR */
int i; /* T_INT */
};
};
struct bdd_function
{
struct bdd_function * next, * prev;
const char * fn_ident;
struct bdd_arg * args; /* NULL if void */
const char * retval;
};
struct bdd_function * currfn;
struct bdd_function * bddfns;
const char * last_id;
static unsigned long hash_bdd(BDD b)
{
return (unsigned long)b & HASH_MASK;
}
static unsigned long hash_bddpair(bddPair * p)
{
unsigned long tmp = (unsigned long)p;
return tmp & HASH_MASK;
}
static __inline__ int id_done(const char * id)
{
const char * pos = id + 4; /* skip _bdd header */
while(*pos == 'z') pos++;
if(*pos == '\0') return 1;
return 0;
}
static const char * genid(void)
{
char * retval;
int i,j;
if(!last_id)
{
retval = "_bdda";
} else if(id_done(last_id))
{
retval = xmalloc(strlen(last_id) + 2);
memcpy(retval,"_bdd",4);
memset(retval+4,'a',strlen(last_id)-4 + 1);
retval[strlen(last_id)+1] = '\0';
} else
{
for(i = 4; last_id[i] == 'z' ; i++) ;
retval = strdup(last_id);
for(j = 4; j < i; j++)
retval[j] = 'a';
retval[i]++;
}
last_id = retval;
return retval;
}
static struct bdd_decl * lookup_bdd(enum arg_type type, void * arg)
{
struct bdd_decl * d;
if(type == T_BDD)
{
BDD b = (BDD) arg;
d = decltbl[hash_bdd(b)];
while(d)
{
if(!(d->is_pair) && d->bval == b && !d->is_collected)
return d;
d = d->next;
}
} else if(type == T_BDD_PAIR)
{
bddPair * p = (bddPair *) arg;
d = decltbl[hash_bddpair(p)];
while(d)
{
if( d->is_pair && d->pval == p & !d->is_collected)
{
return d;
}
d = d->next;
}
} else assert(0);
return NULL;
}
static const char * lookup_bdd_ident(enum arg_type type, void * arg)
{
struct bdd_decl * d;
if(type == T_BDD)
{
BDD b = (BDD) arg;
if(b == bddtrue) return "bddtrue";
if(b == bddfalse) return "bddfalse";
}
d = lookup_bdd(type,arg);
if(!d) return NULL;
return d->identifier;
}
void trace_init(const char * filename)
{
tracefp = fopen(filename,"w");
if(!tracefp)
{
fprintf(stderr,"Unable to open file %s for tracing\n",filename);
exit(EXIT_FAILURE);
}
atexit(output_trace);
memset(decltbl, 0, sizeof(decltbl));
currfn = NULL;
bddfns = NULL;
}
void trace_begin_function(const char * fn)
{
assert(!currfn);
currfn = xmalloc(sizeof(struct bdd_function));
currfn->fn_ident = fn;
currfn->retval = NULL;
currfn->args = NULL;
currfn->next = currfn->prev = currfn;
}
void trace_end_function(void)
{
if(bddfns == NULL) bddfns = currfn;
else
{
bddfns->prev->next = currfn;
currfn->next = bddfns;
currfn->prev = bddfns->prev;
bddfns->prev = currfn;
}
currfn = NULL;
}
void trace_add_bdd(enum arg_type type, void * retval)
{
if(!lookup_bdd_ident(type,retval))
{
struct bdd_decl * d = xmalloc(sizeof(struct bdd_decl));
d->identifier = genid();
d->is_pair = type == T_BDD_PAIR;
d->is_collected = 0;
if(type == T_BDD)
{
BDD b = (BDD) retval;
d->bval = b;
d->next = decltbl[hash_bdd(b)];
decltbl[hash_bdd(b)] = d;
}
else
{
bddPair * p = (bddPair *) retval;
if(!p)
{
printf("ERROR at %s\n",__func__);
return;
}
d->pval = p;
d->next = decltbl[hash_bddpair(p)];
decltbl[hash_bddpair(p)] = d;
}
}
}
void trace_del_bdd(enum arg_type type, void * arg)
{
struct bdd_decl * d = lookup_bdd(type,arg);
if(d)
{
if(type == T_BDD_PAIR)
printf("removing pair\n");
d->is_collected = 1;
}
}
void * trace_end_function_bdd(enum arg_type type, void * retval)
{
const char * id;
trace_add_bdd(type,retval);
id = lookup_bdd_ident(type,retval);
assert(id);
currfn->retval = id;
trace_end_function();
return retval;
}
void trace_add_arg(enum arg_type type, void * arg1, void * arg2)
{
struct bdd_arg *a = xmalloc(sizeof(struct bdd_arg));
a->next = NULL;
a->type = type;
switch(type)
{
case T_INT:
a->i = (int) arg1;
break;
case T_INT_PTR:
a->len = (int) arg2;
a->iarr = xmalloc(a->len * sizeof(int));
memcpy(a->iarr,arg1,a->len * sizeof(int));
break;
case T_CHAR_PTR:
a->str = strdup((char *)arg1);
break;
case T_BDD:
case T_BDD_PAIR:
a->ident = lookup_bdd_ident(type,arg1);
assert(a->ident);
break;
case T_BDD_LOAD:
{
BDD b = (BDD) arg1;
trace_add_bdd(T_BDD,(void *)b);
a->ident = lookup_bdd_ident(T_BDD,(void *)b);
assert(a->ident);
break;
}
case T_BDD_PTR:
{
int i;
a->blen = (int) arg2;
a->barr = malloc(sizeof(BDD) * a->blen);
memcpy(a->barr,arg1,sizeof(BDD) * a->blen);
/* broken code manufactures bdds and then
* passes them as aray elements. bleh
*/
for(i = 0; i < a->blen; i++)
{
trace_add_bdd(T_BDD,(void *)a->barr[i]);
}
break;
}
default:
assert(0);
}
if(currfn->args == NULL) currfn->args = a;
else
{
struct bdd_arg * c = currfn->args;
while(c->next) c = c->next;
c->next = a;
}
}
static void print_args(struct bdd_arg * args)
{
struct bdd_arg * a = args;
while(a)
{
switch(a->type)
{
case T_INT:
fprintf(tracefp,"%d",a->i);
break;
case T_INT_PTR:
{
int i;
fprintf(tracefp,"(int []) { ");
for(i = 0; i < a->len; i++)
fprintf(tracefp,"%d,",
a->iarr[i]);
fprintf(tracefp,"}");
break;
}
case T_CHAR_PTR:
fprintf(tracefp,"\"%s\"",a->str);
break;
case T_BDD:
case T_BDD_PAIR:
fprintf(tracefp,"%s",a->ident);
break;
case T_BDD_LOAD:
fprintf(tracefp,"&%s",a->ident);
break;
case T_BDD_PTR:
{
int i;
fprintf(tracefp, "(BDD []) {");
for(i = 0; i < a->blen; i++)
{
fprintf(tracefp,"%s,",
lookup_bdd_ident(T_BDD,(void *)a->barr[i]));
}
fprintf(tracefp,"}");
break;
}
default: assert(0);
}
if(a->next)
fprintf(tracefp,",");
a = a->next;
}
}
void emit_header(void)
{
fprintf(tracefp,"#include \"bdd.h\"\n");
fprintf(tracefp,"int main(void)\n{\n");
}
void emit_trailer(void)
{
fprintf(tracefp,"return 0; }\n");
}
void output_trace(void)
{
int i, first;
struct bdd_function * f;
if(trace_outputted) return;
trace_outputted = 1;
first = 0;
emit_header();
for(i = 0; i < NR_TABLE; i++)
{
struct bdd_decl * d = decltbl[i];
while(d)
{
if(d->is_pair)
fprintf(tracefp,"\tbddPair *");
else
fprintf(tracefp,"\tBDD ");
fprintf(tracefp,"%s;\n",d->identifier);
d = d->next;
}
}
f = bddfns;
while(f != bddfns || !first)
{
if(f->retval && strcmp(f->retval,"bddtrue")
&& strcmp(f->retval,"bddfalse"))
fprintf(tracefp,"\n\t%s = ", f->retval);
else
fprintf(tracefp,"\n\t");
fprintf(tracefp, f->fn_ident);
fprintf(tracefp,"(");
print_args(f->args);
fprintf(tracefp,");");
f = f->next;
first = 1;
}
emit_trailer();
}
#endif // GENERATE_TRACE
|
the_stack_data/90762861.c
|
/*******************************************************************************
*
* File: scatter.c
* Description: Scatter access pattern.
*
* Author: Alif Ahmed
* Email: [email protected]
* Updated: Aug 06, 2019
*
******************************************************************************/
#include <stdlib.h>
#include <stdio.h>
#define N 10000
static int a[N];
static int b[N];
static int idx[N];
// initialize
void init(){
for(int i = 0; i < N; ++i){
b[i] = 2;
idx[i] = rand() % N;
}
}
//scatter kernel
void scatter(){
for(int i = 0; i < N; ++i){
a[idx[i]] = b[i];
}
}
//sum
int getSum(const int* arr){
int sum = 0;
for(int i = 0; i < N; ++i){
sum += arr[i];
}
return sum;
}
int main(int argc, const char** argv) {
// initialize
init();
// call gather kernel
scatter();
// print result
printf("%d\n", getSum(a));
return 0;
}
|
the_stack_data/152671.c
|
#include <malloc.h>
#include "stdio.h"
int main() {
printf("Please, input the number of elements in the array:\n");
int N;
scanf("%d", &N);
int* array = malloc(sizeof(int)*N);
for (int i = 0; i < N; ++i) {
array[i] = i;
}
for (int i = 0; i < N; ++i) {
printf("ptr[%d] == %d\n", i, array[i]);
}
free(array);
printf("Memory is freed!");
}
|
the_stack_data/193893644.c
|
extern int foo2(void);
extern int foo3(void);
int foo3(void)
{
return foo2();
}
|
the_stack_data/54824510.c
|
/*Waiting for Input from Multiple Sources*/
#include <sys/time.h>
#include <sys/types.h>
#include <unistd.h>
#include <fcntl.h>
#include <stdio.h>
#include <stdlib.h>
int open_input_source(char *);
void handle_input_from_source(int);
int max(int, int);
int main(int argc, char **argv)
{
int fd1, fd2; /* input sources 1 and 2 */
fd_set readfs; /* file descriptor set */
int maxfd; /* maximum file desciptor used */
int loop=1; /* loop while TRUE */
int res;
struct timeval Timeout;
/* open_input_source opens a device, sets the port correctly, and
returns a file descriptor */
fd1 = open_input_source("/dev/ttyS1"); /* COM2 */
if (fd1<0) exit(0);
fd2 = open_input_source("/dev/ttyS2"); /* COM3 */
if (fd2<0) exit(0);
maxfd = max (fd1, fd2)+1; /* maximum bit entry (fd) to test */
/* loop for input */
while (loop) {
// set timeout value within input loop
Timeout.tv_usec = 0; // milliseconds
Timeout.tv_sec = 3; // seconds
FD_SET(fd1, &readfs); /* set testing for source 1 */
FD_SET(fd2, &readfs); /* set testing for source 2 */
/* block until input becomes available */
res = select(maxfd, &readfs, NULL, NULL, &Timeout);
//number of file descriptors with input = 0,
//timeout occurred.
if (res == 0) {
printf("Timeout occured\n");
exit(1);
}
if (FD_ISSET(fd1, &readfs)) /* input from source 1 available */
handle_input_from_source(fd1);
if (FD_ISSET(fd2, &readfs)) /* input from source 2 available */
handle_input_from_source(fd2);
}
close(fd1);
close(fd2);
}
/*
*/
int open_input_source(char * port)
{
int fd = 0;
/* open the device to be non-blocking (read will return immediatly) */
fd = open(port, O_RDWR | O_NOCTTY | O_NONBLOCK);
if (fd <0) {
perror(port);
return -1;
}
else
return fd;
}
void handle_input_from_source(int fd)
{
int res = 0, i;
char buf[255];
res = read(fd,buf,255);
buf[res]=0;
for (i = 0; i < res; i++) printf("%c", buf[i]);
}
int max(int i1, int i2)
{
if (i1 > i2)
return i1;
else
return i2;
}
|
the_stack_data/29825792.c
|
void compute(unsigned long **a, unsigned long **b, unsigned long **c, unsigned long **d, int N, int num_threads) {
// perform loop fusion to transform this loop and parallelize it with OpenMP
#pragma omp parallel for
for (int i = 1; i < N; i++) {
for (int j = 1; j < N; j++) {
a[i][j] = 2 * b[i][j];
d[i][j] = a[i][j] * c[i][j];
}
for (int j=1; j<N;++j)
c[i][j - 1] = a[i][j-1] - a[i][j+1];
}
}
|
the_stack_data/32982.c
|
/*
* POK header
*
* The following file is a part of the POK project. Any modification should
* made according to the POK licence. You CANNOT use this file or a part of
* this file is this part of a file for your own project
*
* For more information on the POK licence, please see our LICENCE FILE
*
* Please follow the coding guidelines described in doc/CODING_GUIDELINES
*
* Copyright (c) 2007-2009 POK team
*
* Created by julien on Thu Jan 15 23:34:13 2009
*/
#if defined(POK_NEEDS_EVENTS) || defined(POK_NEEDS_BUFFERS) || defined(POK_NEEDS_BLACKBOARDS)
#include <types.h>
#include <errno.h>
#include <core/event.h>
#include <core/syscall.h>
#include <core/lockobj.h>
pok_ret_t pok_event_signal(pok_event_id_t id) {
pok_lockobj_lockattr_t lockattr;
lockattr.operation = LOCKOBJ_OPERATION_SIGNAL;
lockattr.obj_kind = POK_LOCKOBJ_KIND_EVENT;
return pok_syscall2(POK_SYSCALL_LOCKOBJ_OPERATION, (uint32_t)id, (uint32_t)&lockattr);
}
#endif
|
the_stack_data/75137983.c
|
/* Example: C program to find area of a circle */
#include <stdio.h>
#define PI 3.14159
int main()
{
float r, a, c;
printf("Enter radius (in mm):\n");
scanf("%f", &r);
while (r != 0) {
r /= 25.4;
a = PI * r * r;
c = PI * r * 2;
printf("Circle's area is %3.2f (sq in).\n", a);
printf("Its circumference is %3.2f (in).\n", c);
printf("Enter radius (in mm):\n");
scanf("%f", &r);
}
printf("Exit\n");
}
|
the_stack_data/54825698.c
|
#include <stddef.h>
#include <stdint.h>
#define N 10
struct A {
int x;
struct B {
int y, z;
} b;
};
struct A a[N];
uint8_t pages[N][4096];
uint8_t buffer[N];
__attribute__((naked))
void mret(void)
{
asm volatile("mret");
}
__attribute__((noinline))
void *memset(void *p, int c, size_t len)
{
char *s = p;
size_t i;
for (i = 0; i < len; ++i)
s[i] = c;
return p;
}
void test_byte_buffer(void)
{
memset(buffer, 0, N);
}
void test_a0(void)
{
memset(a, 0, sizeof(struct A));
}
void test_ai(size_t i)
{
if (i < N)
memset(&a[i], 0, sizeof(struct A));
}
void test_an(void)
{
memset(a, 0, sizeof(a));
}
void test_b(size_t i)
{
if (i < N)
memset(&a[i].b, 0, sizeof(struct B));
}
void test_b_z(size_t i)
{
if (i < N)
memset(&a[i].b.z, 0, sizeof(int));
}
void test_pages(size_t lower, size_t upper)
{
if (lower <= upper && upper <= N)
memset(&pages[lower], 0, (upper - lower) * 4096);
}
void test_buggy_too_large_a(void)
{
memset(a, 0, sizeof(a) + sizeof(struct A));
}
void test_buggy_too_large_b(size_t i)
{
memset(&a[0].b.z, 0, sizeof(struct B));
}
void test_buggy_out_of_bounds(size_t i)
{
memset(&a[i], 0, sizeof(struct A));
}
|
the_stack_data/57951060.c
|
#include <stdio.h>
int main ()
{
int num[100],n,i=0,temp,j;
printf("How many number you want : ");
scanf("%d", &n);
for(i=0; i<n; i++)
{
scanf("%d",&num[i]);
}
for (i=0; i<n; i++)
{
for(j=0; j<n-1; j++)
{
if(num[j]<num[j+1])
{
temp=num[j];
num[j]=num[j+1];
num[j+1]=temp;
}
}
}
printf("Descending order array : ");
for (i=0; i<n; i++)
{
printf("%d , ",num[i]);
}
return 0 ;
}
|
the_stack_data/82949027.c
|
/*
(BOCA:L2_15)
Problema: Faça um programa para imprimir a quantidade de números negativos, a quantidade de números positivos, a soma dos negativos e a soma dos positivos de uma sequência de números. O programa deverá ler números da entrada padrão (um por vez) enquanto ainda tiverem números para serem lidos. Considere que os números estão entre -100 e 100.
Entrada: uma sequência números inteiros separados por esumPositiveaço e terminada por um caractere diferente de white-space (ver ajuda do scanf).
Saída: a quantidade de números negativos da sequência, a quantidade de números positivos da sequência, a soma dos números negativos da sequência e a soma dos números positivos da sequência.
*/
#include <stdio.h>
//function that ckecks if 'c' is a white-space
int differentWhiteSpace(char c);
int main(void)
{
int i, sumPositive = 0, sumNegative = 0, qtdNegative = 0, qtdPositive = 0, number;
for (i = 0; i < 100; i++)
{
scanf("%d", &number);
if (differentWhiteSpace(number))
break;
//if the number entered is greater than 0
else if (number > 0)
{
sumPositive += number;
qtdPositive++;
number = 0;
}
//if the number entered is less than 0
else if (number < 0)
{
sumNegative += number;
qtdNegative++;
number = 0;
}
}
//displaying results
printf("%d %d %d %d", qtdNegative, qtdPositive, sumNegative, sumPositive);
return 0;
}
int differentWhiteSpace(char c)
{
if ((c < -100) || (c > 100))
{
if ((c != '\n') || (c != '\t') || (c != ' ') || (c != '\v') || (c != '\f') || (c != '\r'))
return 1;
}
else
return 0;
}
|
the_stack_data/31759.c
|
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_memset.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: smaccary <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2019/11/05 08:37:01 by smaccary #+# #+# */
/* Updated: 2019/11/18 16:31:40 by smaccary ### ########.fr */
/* */
/* ************************************************************************** */
#include <stddef.h>
void *ft_memset(void *b, int c, size_t len)
{
while (--len + 1)
((unsigned char *)b)[len] = c;
return ((void *)b);
}
|
the_stack_data/32951493.c
|
/* Texture twiddler/detwiddler for PowerVR
(c)2000 Dan Potter
Greets to PlanetWeb ;-)
*/
#include <stdio.h>
#include <stdlib.h>
#ifdef DREAMCAST
#include "AURAE/AURAE.h"
#include "AURAE/DC/DC.h"
/* Size of the texture */
static int imgsize;
/* Linear I/O pointer */
static int ptr = 0;
/* Twiddled texture */
static unsigned char *twiddled = NULL;
/* Normal texture */
static unsigned char *detwiddled = NULL;
static unsigned short *twiddleds = NULL;
/* Normal texture */
static unsigned short *detwiddleds = NULL;
void twsubdivide_and_move(int x1, int y1, int size)
{
if(size == 1) twiddled[ptr++] = detwiddled[(y1*imgsize)+x1];
else
{
int ns = size>>1;
twsubdivide_and_move(x1, y1, ns);
twsubdivide_and_move(x1, y1+ns, ns);
twsubdivide_and_move(x1+ns, y1, ns);
twsubdivide_and_move(x1+ns, y1+ns, ns);
}
}
void twsubdivide_and_move_s(int x1, int y1, int size)
{
if(size == 1) twiddleds[ptr++] = detwiddleds[(y1*imgsize)+x1];
else
{
int ns = size>>1;
twsubdivide_and_move_s(x1, y1, ns);
twsubdivide_and_move_s(x1, y1+ns, ns);
twsubdivide_and_move_s(x1+ns, y1, ns);
twsubdivide_and_move_s(x1+ns, y1+ns, ns);
}
}
void DC_twiddle_encode(AURAE_Texture *texture)
{
ptr = 0;
imgsize = texture->w;
/*
twiddled = texture->pixel;
detwiddled = malloc(imgsize*imgsize*2);
*/
detwiddleds =detwiddled = texture->pixel;
twiddleds = twiddled = malloc((imgsize*imgsize)<<1);
/* Encode mode */
if(texture->format == AURAE_FORMAT_8BPP)
twsubdivide_and_move(0, 0, imgsize);
else
twsubdivide_and_move_s(0, 0, imgsize);
free(texture->pixel);
texture->pixel = twiddled;
texture->psm |= TA_TEXTURE_TWILLED;
}
#endif
|
the_stack_data/138160.c
|
/* Copyright (C) 2000, 2001 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
The GNU C Library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with the GNU C Library; if not, see
<http://www.gnu.org/licenses/>. */
#include <errno.h>
#include <time.h>
#include <unistd.h>
int
clock_getcpuclockid (pid_t pid, clockid_t *clock_id)
{
/* We don't allow any process ID but our own. */
if (pid != 0 && pid != getpid ())
return EPERM;
#ifdef CLOCK_PROCESS_CPUTIME_ID
/* Store the number. */
*clock_id = CLOCK_PROCESS_CPUTIME_ID;
return 0;
#else
/* We don't have a timer for that. */
return ENOENT;
#endif
}
|
the_stack_data/17397.c
|
//write a c program to set a semaphore with positive alue and seubsequenty create a child process. the child process uses the atomic operation semop to set the semaphore value zero and goes to sleep mode for a while.on the other hand parent process continousley pronts the semaphore value.
#include<stdio.h>
#include<stdlib.h>
#include<sys/types.h>
#include<unistd.h>
#include<sys/ipc.h>
#include<sys/sem.h>
int main(){
int i,n,val=1;
key_t key=2;
int semid=semget(key,1,0666|IPC_CREAT);
int flag=semctl(semid,0,SETVAL,1);
if(flag == -1){
printf("Semaphore control failed");
return 1;
}
pid_t pid=fork();
if(pid==-1)
printf("child process creation failed");
if(pid==0){
int op;
sleep(1);
struct sembuf *mysem=(struct sembuf *) malloc(1*sizeof(struct sembuf));
/*
structure of sembuf defined in :
unsigned short sem_num; // semaphore number
short sem_op; // semaphore operation
short sem_flg; // operation flags =
*/
printf("\ninside child process. setting semaphore to 0");
mysem[0].sem_num=0; //operate on semaphore 0
mysem[0].sem_op=-1; //wait for value to be -1
//function definition : int semop(int semid, struct sembuf *sops, unsigned nsops);
op = semop(semid,mysem,1);
}
else{
printf("\ninside parent process. continuosly printing value of semaphore");
while(val==1){
// sleep(1);
val=semctl(semid,0,GETVAL);
if(val == -1){
printf("Semaphore control failed");
return 1;
}
printf("semaphore val = %d\n",val);
}
semctl(semid,0,IPC_RMID);
}
return 0;
}
|
the_stack_data/215768864.c
|
/* UNIX V7 source code: see /COPYRIGHT or www.tuhs.org for details. */
#include "stdio.h"
makpipe()
{
int f[2];
pipe(f);
if (fork()==0) {
close(f[1]);
close(0);
dup(f[0]);
close(f[0]);
execl ("/bin/sh", "sh", "-i", 0);
execl ("/usr/bin/sh", "sh", "-i", 0);
write(2,"Exec error\n",11);
}
close(f[0]);
sleep(2); /* so shell won't eat up too much input */
return(f[1]);
}
|
the_stack_data/192332040.c
|
/* LibTomCrypt, modular cryptographic library -- Tom St Denis
*
* LibTomCrypt is a library that provides various cryptographic
* algorithms in a highly modular and flexible manner.
*
* The library is free for all purposes without any express
* guarantee it works.
*/
/**
@file sober128tab.c
SOBER-128 Tables
*/
#ifdef __LTC_SOBER128TAB_C__
/* $ID$ */
/* @(#)TuringMultab.h 1.3 (QUALCOMM) 02/09/03 */
/* Multiplication table for Turing using 0xD02B4367 */
static const ulong32 Multab[256] = {
0x00000000, 0xD02B4367, 0xED5686CE, 0x3D7DC5A9,
0x97AC41D1, 0x478702B6, 0x7AFAC71F, 0xAAD18478,
0x631582EF, 0xB33EC188, 0x8E430421, 0x5E684746,
0xF4B9C33E, 0x24928059, 0x19EF45F0, 0xC9C40697,
0xC62A4993, 0x16010AF4, 0x2B7CCF5D, 0xFB578C3A,
0x51860842, 0x81AD4B25, 0xBCD08E8C, 0x6CFBCDEB,
0xA53FCB7C, 0x7514881B, 0x48694DB2, 0x98420ED5,
0x32938AAD, 0xE2B8C9CA, 0xDFC50C63, 0x0FEE4F04,
0xC154926B, 0x117FD10C, 0x2C0214A5, 0xFC2957C2,
0x56F8D3BA, 0x86D390DD, 0xBBAE5574, 0x6B851613,
0xA2411084, 0x726A53E3, 0x4F17964A, 0x9F3CD52D,
0x35ED5155, 0xE5C61232, 0xD8BBD79B, 0x089094FC,
0x077EDBF8, 0xD755989F, 0xEA285D36, 0x3A031E51,
0x90D29A29, 0x40F9D94E, 0x7D841CE7, 0xADAF5F80,
0x646B5917, 0xB4401A70, 0x893DDFD9, 0x59169CBE,
0xF3C718C6, 0x23EC5BA1, 0x1E919E08, 0xCEBADD6F,
0xCFA869D6, 0x1F832AB1, 0x22FEEF18, 0xF2D5AC7F,
0x58042807, 0x882F6B60, 0xB552AEC9, 0x6579EDAE,
0xACBDEB39, 0x7C96A85E, 0x41EB6DF7, 0x91C02E90,
0x3B11AAE8, 0xEB3AE98F, 0xD6472C26, 0x066C6F41,
0x09822045, 0xD9A96322, 0xE4D4A68B, 0x34FFE5EC,
0x9E2E6194, 0x4E0522F3, 0x7378E75A, 0xA353A43D,
0x6A97A2AA, 0xBABCE1CD, 0x87C12464, 0x57EA6703,
0xFD3BE37B, 0x2D10A01C, 0x106D65B5, 0xC04626D2,
0x0EFCFBBD, 0xDED7B8DA, 0xE3AA7D73, 0x33813E14,
0x9950BA6C, 0x497BF90B, 0x74063CA2, 0xA42D7FC5,
0x6DE97952, 0xBDC23A35, 0x80BFFF9C, 0x5094BCFB,
0xFA453883, 0x2A6E7BE4, 0x1713BE4D, 0xC738FD2A,
0xC8D6B22E, 0x18FDF149, 0x258034E0, 0xF5AB7787,
0x5F7AF3FF, 0x8F51B098, 0xB22C7531, 0x62073656,
0xABC330C1, 0x7BE873A6, 0x4695B60F, 0x96BEF568,
0x3C6F7110, 0xEC443277, 0xD139F7DE, 0x0112B4B9,
0xD31DD2E1, 0x03369186, 0x3E4B542F, 0xEE601748,
0x44B19330, 0x949AD057, 0xA9E715FE, 0x79CC5699,
0xB008500E, 0x60231369, 0x5D5ED6C0, 0x8D7595A7,
0x27A411DF, 0xF78F52B8, 0xCAF29711, 0x1AD9D476,
0x15379B72, 0xC51CD815, 0xF8611DBC, 0x284A5EDB,
0x829BDAA3, 0x52B099C4, 0x6FCD5C6D, 0xBFE61F0A,
0x7622199D, 0xA6095AFA, 0x9B749F53, 0x4B5FDC34,
0xE18E584C, 0x31A51B2B, 0x0CD8DE82, 0xDCF39DE5,
0x1249408A, 0xC26203ED, 0xFF1FC644, 0x2F348523,
0x85E5015B, 0x55CE423C, 0x68B38795, 0xB898C4F2,
0x715CC265, 0xA1778102, 0x9C0A44AB, 0x4C2107CC,
0xE6F083B4, 0x36DBC0D3, 0x0BA6057A, 0xDB8D461D,
0xD4630919, 0x04484A7E, 0x39358FD7, 0xE91ECCB0,
0x43CF48C8, 0x93E40BAF, 0xAE99CE06, 0x7EB28D61,
0xB7768BF6, 0x675DC891, 0x5A200D38, 0x8A0B4E5F,
0x20DACA27, 0xF0F18940, 0xCD8C4CE9, 0x1DA70F8E,
0x1CB5BB37, 0xCC9EF850, 0xF1E33DF9, 0x21C87E9E,
0x8B19FAE6, 0x5B32B981, 0x664F7C28, 0xB6643F4F,
0x7FA039D8, 0xAF8B7ABF, 0x92F6BF16, 0x42DDFC71,
0xE80C7809, 0x38273B6E, 0x055AFEC7, 0xD571BDA0,
0xDA9FF2A4, 0x0AB4B1C3, 0x37C9746A, 0xE7E2370D,
0x4D33B375, 0x9D18F012, 0xA06535BB, 0x704E76DC,
0xB98A704B, 0x69A1332C, 0x54DCF685, 0x84F7B5E2,
0x2E26319A, 0xFE0D72FD, 0xC370B754, 0x135BF433,
0xDDE1295C, 0x0DCA6A3B, 0x30B7AF92, 0xE09CECF5,
0x4A4D688D, 0x9A662BEA, 0xA71BEE43, 0x7730AD24,
0xBEF4ABB3, 0x6EDFE8D4, 0x53A22D7D, 0x83896E1A,
0x2958EA62, 0xF973A905, 0xC40E6CAC, 0x14252FCB,
0x1BCB60CF, 0xCBE023A8, 0xF69DE601, 0x26B6A566,
0x8C67211E, 0x5C4C6279, 0x6131A7D0, 0xB11AE4B7,
0x78DEE220, 0xA8F5A147, 0x958864EE, 0x45A32789,
0xEF72A3F1, 0x3F59E096, 0x0224253F, 0xD20F6658,
};
/* $ID$ */
/* Sbox for SOBER-128 */
/*
* This is really the combination of two SBoxes; the least significant
* 24 bits comes from:
* 8->32 Sbox generated by Millan et. al. at Queensland University of
* Technology. See: E. Dawson, W. Millan, L. Burnett, G. Carter,
* "On the Design of 8*32 S-boxes". Unpublished report, by the
* Information Systems Research Centre,
* Queensland University of Technology, 1999.
*
* The most significant 8 bits are the Skipjack "F table", which can be
* found at http://csrc.nist.gov/CryptoToolkit/skipjack/skipjack.pdf .
* In this optimised table, though, the intent is to XOR the word from
* the table selected by the high byte with the input word. Thus, the
* high byte is actually the Skipjack F-table entry XORED with its
* table index.
*/
static const ulong32 Sbox[256] = {
0xa3aa1887, 0xd65e435c, 0x0b65c042, 0x800e6ef4,
0xfc57ee20, 0x4d84fed3, 0xf066c502, 0xf354e8ae,
0xbb2ee9d9, 0x281f38d4, 0x1f829b5d, 0x735cdf3c,
0x95864249, 0xbc2e3963, 0xa1f4429f, 0xf6432c35,
0xf7f40325, 0x3cc0dd70, 0x5f973ded, 0x9902dc5e,
0xda175b42, 0x590012bf, 0xdc94d78c, 0x39aab26b,
0x4ac11b9a, 0x8c168146, 0xc3ea8ec5, 0x058ac28f,
0x52ed5c0f, 0x25b4101c, 0x5a2db082, 0x370929e1,
0x2a1843de, 0xfe8299fc, 0x202fbc4b, 0x833915dd,
0x33a803fa, 0xd446b2de, 0x46233342, 0x4fcee7c3,
0x3ad607ef, 0x9e97ebab, 0x507f859b, 0xe81f2e2f,
0xc55b71da, 0xd7e2269a, 0x1339c3d1, 0x7ca56b36,
0xa6c9def2, 0xb5c9fc5f, 0x5927b3a3, 0x89a56ddf,
0xc625b510, 0x560f85a7, 0xace82e71, 0x2ecb8816,
0x44951e2a, 0x97f5f6af, 0xdfcbc2b3, 0xce4ff55d,
0xcb6b6214, 0x2b0b83e3, 0x549ea6f5, 0x9de041af,
0x792f1f17, 0xf73b99ee, 0x39a65ec0, 0x4c7016c6,
0x857709a4, 0xd6326e01, 0xc7b280d9, 0x5cfb1418,
0xa6aff227, 0xfd548203, 0x506b9d96, 0xa117a8c0,
0x9cd5bf6e, 0xdcee7888, 0x61fcfe64, 0xf7a193cd,
0x050d0184, 0xe8ae4930, 0x88014f36, 0xd6a87088,
0x6bad6c2a, 0x1422c678, 0xe9204de7, 0xb7c2e759,
0x0200248e, 0x013b446b, 0xda0d9fc2, 0x0414a895,
0x3a6cc3a1, 0x56fef170, 0x86c19155, 0xcf7b8a66,
0x551b5e69, 0xb4a8623e, 0xa2bdfa35, 0xc4f068cc,
0x573a6acd, 0x6355e936, 0x03602db9, 0x0edf13c1,
0x2d0bb16d, 0x6980b83c, 0xfeb23763, 0x3dd8a911,
0x01b6bc13, 0xf55579d7, 0xf55c2fa8, 0x19f4196e,
0xe7db5476, 0x8d64a866, 0xc06e16ad, 0xb17fc515,
0xc46feb3c, 0x8bc8a306, 0xad6799d9, 0x571a9133,
0x992466dd, 0x92eb5dcd, 0xac118f50, 0x9fafb226,
0xa1b9cef3, 0x3ab36189, 0x347a19b1, 0x62c73084,
0xc27ded5c, 0x6c8bc58f, 0x1cdde421, 0xed1e47fb,
0xcdcc715e, 0xb9c0ff99, 0x4b122f0f, 0xc4d25184,
0xaf7a5e6c, 0x5bbf18bc, 0x8dd7c6e0, 0x5fb7e420,
0x521f523f, 0x4ad9b8a2, 0xe9da1a6b, 0x97888c02,
0x19d1e354, 0x5aba7d79, 0xa2cc7753, 0x8c2d9655,
0x19829da1, 0x531590a7, 0x19c1c149, 0x3d537f1c,
0x50779b69, 0xed71f2b7, 0x463c58fa, 0x52dc4418,
0xc18c8c76, 0xc120d9f0, 0xafa80d4d, 0x3b74c473,
0xd09410e9, 0x290e4211, 0xc3c8082b, 0x8f6b334a,
0x3bf68ed2, 0xa843cc1b, 0x8d3c0ff3, 0x20e564a0,
0xf8f55a4f, 0x2b40f8e7, 0xfea7f15f, 0xcf00fe21,
0x8a6d37d6, 0xd0d506f1, 0xade00973, 0xefbbde36,
0x84670fa8, 0xfa31ab9e, 0xaedab618, 0xc01f52f5,
0x6558eb4f, 0x71b9e343, 0x4b8d77dd, 0x8cb93da6,
0x740fd52d, 0x425412f8, 0xc5a63360, 0x10e53ad0,
0x5a700f1c, 0x8324ed0b, 0xe53dc1ec, 0x1a366795,
0x6d549d15, 0xc5ce46d7, 0xe17abe76, 0x5f48e0a0,
0xd0f07c02, 0x941249b7, 0xe49ed6ba, 0x37a47f78,
0xe1cfffbd, 0xb007ca84, 0xbb65f4da, 0xb59f35da,
0x33d2aa44, 0x417452ac, 0xc0d674a7, 0x2d61a46a,
0xdc63152a, 0x3e12b7aa, 0x6e615927, 0xa14fb118,
0xa151758d, 0xba81687b, 0xe152f0b3, 0x764254ed,
0x34c77271, 0x0a31acab, 0x54f94aec, 0xb9e994cd,
0x574d9e81, 0x5b623730, 0xce8a21e8, 0x37917f0b,
0xe8a9b5d6, 0x9697adf8, 0xf3d30431, 0x5dcac921,
0x76b35d46, 0xaa430a36, 0xc2194022, 0x22bca65e,
0xdaec70ba, 0xdfaea8cc, 0x777bae8b, 0x242924d5,
0x1f098a5a, 0x4b396b81, 0x55de2522, 0x435c1cb8,
0xaeb8fe1d, 0x9db3c697, 0x5b164f83, 0xe0c16376,
0xa319224c, 0xd0203b35, 0x433ac0fe, 0x1466a19a,
0x45f0b24f, 0x51fda998, 0xc0d52d71, 0xfa0896a8,
0xf9e6053f, 0xa4b0d300, 0xd499cbcc, 0xb95e3d40,
};
#endif /* __LTC_SOBER128TAB_C__ */
/* ref: tag: v1.18.2, master */
/* git commit: 7e7eb695d581782f04b24dc444cbfde86af59853 */
/* commit time: 2018-07-01 22:49:01 +0200 */
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.