file
stringlengths 18
26
| data
stringlengths 3
1.04M
|
|---|---|
the_stack_data/3263169.c
|
#include<stdio.h>
main()
{
printf("Hello world!");
}
|
the_stack_data/62638205.c
|
/* $NetBSD: pure_calc.tab.c,v 1.5 2021/02/20 22:57:57 christos Exp $ */
/* original parser id follows */
/* yysccsid[] = "@(#)yaccpar 1.9 (Berkeley) 02/21/93" */
/* (use YYMAJOR/YYMINOR for ifdefs dependent on parser version) */
#define YYBYACC 1
#define YYMAJOR 2
#define YYMINOR 0
#define YYCHECK "yyyymmdd"
#define YYEMPTY (-1)
#define yyclearin (yychar = YYEMPTY)
#define yyerrok (yyerrflag = 0)
#define YYRECOVERING() (yyerrflag != 0)
#define YYENOMEM (-2)
#define YYEOF 0
#undef YYBTYACC
#define YYBTYACC 0
#define YYDEBUGSTR YYPREFIX "debug"
#ifndef yyparse
#define yyparse calc_parse
#endif /* yyparse */
#ifndef yylex
#define yylex calc_lex
#endif /* yylex */
#ifndef yyerror
#define yyerror calc_error
#endif /* yyerror */
#ifndef yychar
#define yychar calc_char
#endif /* yychar */
#ifndef yyval
#define yyval calc_val
#endif /* yyval */
#ifndef yylval
#define yylval calc_lval
#endif /* yylval */
#ifndef yydebug
#define yydebug calc_debug
#endif /* yydebug */
#ifndef yynerrs
#define yynerrs calc_nerrs
#endif /* yynerrs */
#ifndef yyerrflag
#define yyerrflag calc_errflag
#endif /* yyerrflag */
#ifndef yylhs
#define yylhs calc_lhs
#endif /* yylhs */
#ifndef yylen
#define yylen calc_len
#endif /* yylen */
#ifndef yydefred
#define yydefred calc_defred
#endif /* yydefred */
#ifndef yystos
#define yystos calc_stos
#endif /* yystos */
#ifndef yydgoto
#define yydgoto calc_dgoto
#endif /* yydgoto */
#ifndef yysindex
#define yysindex calc_sindex
#endif /* yysindex */
#ifndef yyrindex
#define yyrindex calc_rindex
#endif /* yyrindex */
#ifndef yygindex
#define yygindex calc_gindex
#endif /* yygindex */
#ifndef yytable
#define yytable calc_table
#endif /* yytable */
#ifndef yycheck
#define yycheck calc_check
#endif /* yycheck */
#ifndef yyname
#define yyname calc_name
#endif /* yyname */
#ifndef yyrule
#define yyrule calc_rule
#endif /* yyrule */
#if YYBTYACC
#ifndef yycindex
#define yycindex calc_cindex
#endif /* yycindex */
#ifndef yyctable
#define yyctable calc_ctable
#endif /* yyctable */
#endif /* YYBTYACC */
#define YYPREFIX "calc_"
#define YYPURE 1
#line 2 "pure_calc.y"
# include <stdio.h>
# include <ctype.h>
int regs[26];
int base;
#ifdef YYBISON
#define YYSTYPE int
#define YYLEX_PARAM &yylval
#define YYLEX_DECL() yylex(YYSTYPE *yylval)
#define YYERROR_DECL() yyerror(const char *s)
int YYLEX_DECL();
static void YYERROR_DECL();
#endif
#line 137 "pure_calc.tab.c"
#if ! defined(YYSTYPE) && ! defined(YYSTYPE_IS_DECLARED)
/* Default: YYSTYPE is the semantic value type. */
typedef int YYSTYPE;
# define YYSTYPE_IS_DECLARED 1
#endif
/* compatibility with bison */
#ifdef YYPARSE_PARAM
/* compatibility with FreeBSD */
# ifdef YYPARSE_PARAM_TYPE
# define YYPARSE_DECL() yyparse(YYPARSE_PARAM_TYPE YYPARSE_PARAM)
# else
# define YYPARSE_DECL() yyparse(void *YYPARSE_PARAM)
# endif
#else
# define YYPARSE_DECL() yyparse(void)
#endif
/* Parameters sent to lex. */
#ifdef YYLEX_PARAM
# ifdef YYLEX_PARAM_TYPE
# define YYLEX_DECL() yylex(YYSTYPE *yylval, YYLEX_PARAM_TYPE YYLEX_PARAM)
# else
# define YYLEX_DECL() yylex(YYSTYPE *yylval, void * YYLEX_PARAM)
# endif
# define YYLEX yylex(&yylval, YYLEX_PARAM)
#else
# define YYLEX_DECL() yylex(YYSTYPE *yylval)
# define YYLEX yylex(&yylval)
#endif
/* Parameters sent to yyerror. */
#ifndef YYERROR_DECL
#define YYERROR_DECL() yyerror(const char *s)
#endif
#ifndef YYERROR_CALL
#define YYERROR_CALL(msg) yyerror(msg)
#endif
extern int YYPARSE_DECL();
#define DIGIT 257
#define LETTER 258
#define UMINUS 259
#define YYERRCODE 256
typedef short YYINT;
static const YYINT calc_lhs[] = { -1,
0, 0, 0, 1, 1, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 3, 3,
};
static const YYINT calc_len[] = { 2,
0, 3, 3, 1, 3, 3, 3, 3, 3, 3,
3, 3, 3, 2, 1, 1, 1, 2,
};
static const YYINT calc_defred[] = { 1,
0, 0, 17, 0, 0, 0, 0, 0, 0, 3,
0, 15, 14, 0, 2, 0, 0, 0, 0, 0,
0, 0, 18, 0, 6, 0, 0, 0, 0, 9,
10, 11,
};
#if defined(YYDESTRUCT_CALL) || defined(YYSTYPE_TOSTRING)
static const YYINT calc_stos[] = { 0,
261, 256, 257, 258, 45, 40, 262, 263, 264, 10,
61, 258, 263, 263, 10, 124, 38, 43, 45, 42,
47, 37, 257, 263, 41, 263, 263, 263, 263, 263,
263, 263,
};
#endif /* YYDESTRUCT_CALL || YYSTYPE_TOSTRING */
static const YYINT calc_dgoto[] = { 1,
7, 8, 9,
};
static const YYINT calc_sindex[] = { 0,
-40, -7, 0, -55, -38, -38, 1, -29, -247, 0,
-38, 0, 0, 22, 0, -38, -38, -38, -38, -38,
-38, -38, 0, -29, 0, 51, 60, -20, -20, 0,
0, 0,
};
static const YYINT calc_rindex[] = { 0,
0, 0, 0, 2, 0, 0, 0, 9, -9, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 10, 0, -6, 14, 5, 13, 0,
0, 0,
};
#if YYBTYACC
static const YYINT calc_cindex[] = { 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0,
};
#endif
static const YYINT calc_gindex[] = { 0,
0, 65, 0,
};
#define YYTABLESIZE 220
static const YYINT calc_table[] = { 6,
16, 6, 10, 13, 5, 11, 5, 22, 17, 23,
15, 15, 20, 18, 7, 19, 22, 21, 4, 5,
0, 20, 8, 12, 0, 0, 21, 16, 16, 0,
0, 16, 16, 16, 13, 16, 0, 16, 15, 15,
0, 0, 7, 15, 15, 7, 15, 7, 15, 7,
8, 12, 0, 8, 12, 8, 0, 8, 22, 17,
0, 0, 25, 20, 18, 0, 19, 0, 21, 13,
14, 0, 0, 0, 0, 24, 0, 0, 0, 0,
26, 27, 28, 29, 30, 31, 32, 22, 17, 0,
0, 0, 20, 18, 16, 19, 22, 21, 0, 0,
0, 20, 18, 0, 19, 0, 21, 0, 0, 0,
0, 0, 0, 0, 16, 0, 0, 13, 0, 0,
0, 0, 0, 0, 0, 15, 0, 0, 7, 0,
0, 0, 0, 0, 0, 0, 8, 12, 0, 0,
0, 0, 0, 0, 0, 16, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 2, 3, 4, 3, 12,
};
static const YYINT calc_check[] = { 40,
10, 40, 10, 10, 45, 61, 45, 37, 38, 257,
10, 10, 42, 43, 10, 45, 37, 47, 10, 10,
-1, 42, 10, 10, -1, -1, 47, 37, 38, -1,
-1, 41, 42, 43, 41, 45, -1, 47, 37, 38,
-1, -1, 38, 42, 43, 41, 45, 43, 47, 45,
38, 38, -1, 41, 41, 43, -1, 45, 37, 38,
-1, -1, 41, 42, 43, -1, 45, -1, 47, 5,
6, -1, -1, -1, -1, 11, -1, -1, -1, -1,
16, 17, 18, 19, 20, 21, 22, 37, 38, -1,
-1, -1, 42, 43, 124, 45, 37, 47, -1, -1,
-1, 42, 43, -1, 45, -1, 47, -1, -1, -1,
-1, -1, -1, -1, 124, -1, -1, 124, -1, -1,
-1, -1, -1, -1, -1, 124, -1, -1, 124, -1,
-1, -1, -1, -1, -1, -1, 124, 124, -1, -1,
-1, -1, -1, -1, -1, 124, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, 256, 257, 258, 257, 258,
};
#if YYBTYACC
static const YYINT calc_ctable[] = { -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1,
};
#endif
#define YYFINAL 1
#ifndef YYDEBUG
#define YYDEBUG 0
#endif
#define YYMAXTOKEN 259
#define YYUNDFTOKEN 265
#define YYTRANSLATE(a) ((a) > YYMAXTOKEN ? YYUNDFTOKEN : (a))
#if YYDEBUG
static const char *const calc_name[] = {
"$end",0,0,0,0,0,0,0,0,0,"'\\n'",0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,"'%'","'&'",0,"'('","')'","'*'","'+'",0,"'-'",0,"'/'",0,0,0,0,0,0,0,0,0,0,
0,0,0,"'='",0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,"'|'",0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,"error","DIGIT","LETTER","UMINUS","$accept","list","stat","expr","number",
"illegal-symbol",
};
static const char *const calc_rule[] = {
"$accept : list",
"list :",
"list : list stat '\\n'",
"list : list error '\\n'",
"stat : expr",
"stat : LETTER '=' expr",
"expr : '(' expr ')'",
"expr : expr '+' expr",
"expr : expr '-' expr",
"expr : expr '*' expr",
"expr : expr '/' expr",
"expr : expr '%' expr",
"expr : expr '&' expr",
"expr : expr '|' expr",
"expr : '-' expr",
"expr : LETTER",
"expr : number",
"number : DIGIT",
"number : number DIGIT",
};
#endif
#if YYDEBUG
int yydebug;
#endif
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
#ifndef YYLLOC_DEFAULT
#define YYLLOC_DEFAULT(loc, rhs, n) \
do \
{ \
if (n == 0) \
{ \
(loc).first_line = YYRHSLOC(rhs, 0).last_line; \
(loc).first_column = YYRHSLOC(rhs, 0).last_column; \
(loc).last_line = YYRHSLOC(rhs, 0).last_line; \
(loc).last_column = YYRHSLOC(rhs, 0).last_column; \
} \
else \
{ \
(loc).first_line = YYRHSLOC(rhs, 1).first_line; \
(loc).first_column = YYRHSLOC(rhs, 1).first_column; \
(loc).last_line = YYRHSLOC(rhs, n).last_line; \
(loc).last_column = YYRHSLOC(rhs, n).last_column; \
} \
} while (0)
#endif /* YYLLOC_DEFAULT */
#endif /* defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) */
#if YYBTYACC
#ifndef YYLVQUEUEGROWTH
#define YYLVQUEUEGROWTH 32
#endif
#endif /* YYBTYACC */
/* define the initial stack-sizes */
#ifdef YYSTACKSIZE
#undef YYMAXDEPTH
#define YYMAXDEPTH YYSTACKSIZE
#else
#ifdef YYMAXDEPTH
#define YYSTACKSIZE YYMAXDEPTH
#else
#define YYSTACKSIZE 10000
#define YYMAXDEPTH 10000
#endif
#endif
#ifndef YYINITSTACKSIZE
#define YYINITSTACKSIZE 200
#endif
typedef struct {
unsigned stacksize;
YYINT *s_base;
YYINT *s_mark;
YYINT *s_last;
YYSTYPE *l_base;
YYSTYPE *l_mark;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
YYLTYPE *p_base;
YYLTYPE *p_mark;
#endif
} YYSTACKDATA;
#if YYBTYACC
struct YYParseState_s
{
struct YYParseState_s *save; /* Previously saved parser state */
YYSTACKDATA yystack; /* saved parser stack */
int state; /* saved parser state */
int errflag; /* saved error recovery status */
int lexeme; /* saved index of the conflict lexeme in the lexical queue */
YYINT ctry; /* saved index in yyctable[] for this conflict */
};
typedef struct YYParseState_s YYParseState;
#endif /* YYBTYACC */
#line 72 "pure_calc.y"
/* start of programs */
#ifdef YYBYACC
static int YYLEX_DECL();
#endif
int
main (void)
{
while(!feof(stdin)) {
yyparse();
}
return 0;
}
static void
YYERROR_DECL()
{
fprintf(stderr, "%s\n", s);
}
int
YYLEX_DECL()
{
/* lexical analysis routine */
/* returns LETTER for a lower case letter, yylval = 0 through 25 */
/* return DIGIT for a digit, yylval = 0 through 9 */
/* all other characters are returned immediately */
int c;
while( (c=getchar()) == ' ' ) { /* skip blanks */ }
/* c is now nonblank */
if( islower( c )) {
*yylval = c - 'a';
return ( LETTER );
}
if( isdigit( c )) {
*yylval = c - '0';
return ( DIGIT );
}
return( c );
}
#line 473 "pure_calc.tab.c"
/* For use in generated program */
#define yydepth (int)(yystack.s_mark - yystack.s_base)
#if YYBTYACC
#define yytrial (yyps->save)
#endif /* YYBTYACC */
#if YYDEBUG
#include <stdio.h> /* needed for printf */
#endif
#include <stdlib.h> /* needed for malloc, etc */
#include <string.h> /* needed for memset */
/* allocate initial stack or double stack size, up to YYMAXDEPTH */
static int yygrowstack(YYSTACKDATA *data)
{
int i;
unsigned newsize;
YYINT *newss;
YYSTYPE *newvs;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
YYLTYPE *newps;
#endif
if ((newsize = data->stacksize) == 0)
newsize = YYINITSTACKSIZE;
else if (newsize >= YYMAXDEPTH)
return YYENOMEM;
else if ((newsize *= 2) > YYMAXDEPTH)
newsize = YYMAXDEPTH;
i = (int) (data->s_mark - data->s_base);
newss = (YYINT *)realloc(data->s_base, newsize * sizeof(*newss));
if (newss == 0)
return YYENOMEM;
data->s_base = newss;
data->s_mark = newss + i;
newvs = (YYSTYPE *)realloc(data->l_base, newsize * sizeof(*newvs));
if (newvs == 0)
return YYENOMEM;
data->l_base = newvs;
data->l_mark = newvs + i;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
newps = (YYLTYPE *)realloc(data->p_base, newsize * sizeof(*newps));
if (newps == 0)
return YYENOMEM;
data->p_base = newps;
data->p_mark = newps + i;
#endif
data->stacksize = newsize;
data->s_last = data->s_base + newsize - 1;
#if YYDEBUG
if (yydebug)
fprintf(stderr, "%sdebug: stack size increased to %d\n", YYPREFIX, newsize);
#endif
return 0;
}
#if YYPURE || defined(YY_NO_LEAKS)
static void yyfreestack(YYSTACKDATA *data)
{
free(data->s_base);
free(data->l_base);
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
free(data->p_base);
#endif
memset(data, 0, sizeof(*data));
}
#else
#define yyfreestack(data) /* nothing */
#endif /* YYPURE || defined(YY_NO_LEAKS) */
#if YYBTYACC
static YYParseState *
yyNewState(unsigned size)
{
YYParseState *p = (YYParseState *) malloc(sizeof(YYParseState));
if (p == NULL) return NULL;
p->yystack.stacksize = size;
if (size == 0)
{
p->yystack.s_base = NULL;
p->yystack.l_base = NULL;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
p->yystack.p_base = NULL;
#endif
return p;
}
p->yystack.s_base = (YYINT *) malloc(size * sizeof(YYINT));
if (p->yystack.s_base == NULL) return NULL;
p->yystack.l_base = (YYSTYPE *) malloc(size * sizeof(YYSTYPE));
if (p->yystack.l_base == NULL) return NULL;
memset(p->yystack.l_base, 0, size * sizeof(YYSTYPE));
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
p->yystack.p_base = (YYLTYPE *) malloc(size * sizeof(YYLTYPE));
if (p->yystack.p_base == NULL) return NULL;
memset(p->yystack.p_base, 0, size * sizeof(YYLTYPE));
#endif
return p;
}
static void
yyFreeState(YYParseState *p)
{
yyfreestack(&p->yystack);
free(p);
}
#endif /* YYBTYACC */
#define YYABORT goto yyabort
#define YYREJECT goto yyabort
#define YYACCEPT goto yyaccept
#define YYERROR goto yyerrlab
#if YYBTYACC
#define YYVALID do { if (yyps->save) goto yyvalid; } while(0)
#define YYVALID_NESTED do { if (yyps->save && \
yyps->save->save == 0) goto yyvalid; } while(0)
#endif /* YYBTYACC */
int
YYPARSE_DECL()
{
int yyerrflag;
int yychar;
YYSTYPE yyval;
YYSTYPE yylval;
int yynerrs;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
YYLTYPE yyloc; /* position returned by actions */
YYLTYPE yylloc; /* position from the lexer */
#endif
/* variables for the parser stack */
YYSTACKDATA yystack;
#if YYBTYACC
/* Current parser state */
static YYParseState *yyps = 0;
/* yypath != NULL: do the full parse, starting at *yypath parser state. */
static YYParseState *yypath = 0;
/* Base of the lexical value queue */
static YYSTYPE *yylvals = 0;
/* Current position at lexical value queue */
static YYSTYPE *yylvp = 0;
/* End position of lexical value queue */
static YYSTYPE *yylve = 0;
/* The last allocated position at the lexical value queue */
static YYSTYPE *yylvlim = 0;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
/* Base of the lexical position queue */
static YYLTYPE *yylpsns = 0;
/* Current position at lexical position queue */
static YYLTYPE *yylpp = 0;
/* End position of lexical position queue */
static YYLTYPE *yylpe = 0;
/* The last allocated position at the lexical position queue */
static YYLTYPE *yylplim = 0;
#endif
/* Current position at lexical token queue */
static YYINT *yylexp = 0;
static YYINT *yylexemes = 0;
#endif /* YYBTYACC */
int yym, yyn, yystate, yyresult;
#if YYBTYACC
int yynewerrflag;
YYParseState *yyerrctx = NULL;
#endif /* YYBTYACC */
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
YYLTYPE yyerror_loc_range[3]; /* position of error start/end (0 unused) */
#endif
#if YYDEBUG
const char *yys;
if ((yys = getenv("YYDEBUG")) != 0)
{
yyn = *yys;
if (yyn >= '0' && yyn <= '9')
yydebug = yyn - '0';
}
if (yydebug)
fprintf(stderr, "%sdebug[<# of symbols on state stack>]\n", YYPREFIX);
#endif
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
memset(yyerror_loc_range, 0, sizeof(yyerror_loc_range));
#endif
yyerrflag = 0;
yychar = 0;
memset(&yyval, 0, sizeof(yyval));
memset(&yylval, 0, sizeof(yylval));
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
memset(&yyloc, 0, sizeof(yyloc));
memset(&yylloc, 0, sizeof(yylloc));
#endif
#if YYBTYACC
yyps = yyNewState(0); if (yyps == 0) goto yyenomem;
yyps->save = 0;
#endif /* YYBTYACC */
yym = 0;
yyn = 0;
yynerrs = 0;
yyerrflag = 0;
yychar = YYEMPTY;
yystate = 0;
#if YYPURE
memset(&yystack, 0, sizeof(yystack));
#endif
if (yystack.s_base == NULL && yygrowstack(&yystack) == YYENOMEM) goto yyoverflow;
yystack.s_mark = yystack.s_base;
yystack.l_mark = yystack.l_base;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
yystack.p_mark = yystack.p_base;
#endif
yystate = 0;
*yystack.s_mark = 0;
yyloop:
if ((yyn = yydefred[yystate]) != 0) goto yyreduce;
if (yychar < 0)
{
#if YYBTYACC
do {
if (yylvp < yylve)
{
/* we're currently re-reading tokens */
yylval = *yylvp++;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
yylloc = *yylpp++;
#endif
yychar = *yylexp++;
break;
}
if (yyps->save)
{
/* in trial mode; save scanner results for future parse attempts */
if (yylvp == yylvlim)
{ /* Enlarge lexical value queue */
size_t p = (size_t) (yylvp - yylvals);
size_t s = (size_t) (yylvlim - yylvals);
s += YYLVQUEUEGROWTH;
if ((yylexemes = (YYINT *)realloc(yylexemes, s * sizeof(YYINT))) == NULL) goto yyenomem;
if ((yylvals = (YYSTYPE *)realloc(yylvals, s * sizeof(YYSTYPE))) == NULL) goto yyenomem;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
if ((yylpsns = (YYLTYPE *)realloc(yylpsns, s * sizeof(YYLTYPE))) == NULL) goto yyenomem;
#endif
yylvp = yylve = yylvals + p;
yylvlim = yylvals + s;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
yylpp = yylpe = yylpsns + p;
yylplim = yylpsns + s;
#endif
yylexp = yylexemes + p;
}
*yylexp = (YYINT) YYLEX;
*yylvp++ = yylval;
yylve++;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
*yylpp++ = yylloc;
yylpe++;
#endif
yychar = *yylexp++;
break;
}
/* normal operation, no conflict encountered */
#endif /* YYBTYACC */
yychar = YYLEX;
#if YYBTYACC
} while (0);
#endif /* YYBTYACC */
if (yychar < 0) yychar = YYEOF;
#if YYDEBUG
if (yydebug)
{
if ((yys = yyname[YYTRANSLATE(yychar)]) == NULL) yys = yyname[YYUNDFTOKEN];
fprintf(stderr, "%s[%d]: state %d, reading token %d (%s)",
YYDEBUGSTR, yydepth, yystate, yychar, yys);
#ifdef YYSTYPE_TOSTRING
#if YYBTYACC
if (!yytrial)
#endif /* YYBTYACC */
fprintf(stderr, " <%s>", YYSTYPE_TOSTRING(yychar, yylval));
#endif
fputc('\n', stderr);
}
#endif
}
#if YYBTYACC
/* Do we have a conflict? */
if (((yyn = yycindex[yystate]) != 0) && (yyn += yychar) >= 0 &&
yyn <= YYTABLESIZE && yycheck[yyn] == (YYINT) yychar)
{
YYINT ctry;
if (yypath)
{
YYParseState *save;
#if YYDEBUG
if (yydebug)
fprintf(stderr, "%s[%d]: CONFLICT in state %d: following successful trial parse\n",
YYDEBUGSTR, yydepth, yystate);
#endif
/* Switch to the next conflict context */
save = yypath;
yypath = save->save;
save->save = NULL;
ctry = save->ctry;
if (save->state != yystate) YYABORT;
yyFreeState(save);
}
else
{
/* Unresolved conflict - start/continue trial parse */
YYParseState *save;
#if YYDEBUG
if (yydebug)
{
fprintf(stderr, "%s[%d]: CONFLICT in state %d. ", YYDEBUGSTR, yydepth, yystate);
if (yyps->save)
fputs("ALREADY in conflict, continuing trial parse.\n", stderr);
else
fputs("Starting trial parse.\n", stderr);
}
#endif
save = yyNewState((unsigned)(yystack.s_mark - yystack.s_base + 1));
if (save == NULL) goto yyenomem;
save->save = yyps->save;
save->state = yystate;
save->errflag = yyerrflag;
save->yystack.s_mark = save->yystack.s_base + (yystack.s_mark - yystack.s_base);
memcpy (save->yystack.s_base, yystack.s_base, (size_t) (yystack.s_mark - yystack.s_base + 1) * sizeof(YYINT));
save->yystack.l_mark = save->yystack.l_base + (yystack.l_mark - yystack.l_base);
memcpy (save->yystack.l_base, yystack.l_base, (size_t) (yystack.l_mark - yystack.l_base + 1) * sizeof(YYSTYPE));
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
save->yystack.p_mark = save->yystack.p_base + (yystack.p_mark - yystack.p_base);
memcpy (save->yystack.p_base, yystack.p_base, (size_t) (yystack.p_mark - yystack.p_base + 1) * sizeof(YYLTYPE));
#endif
ctry = yytable[yyn];
if (yyctable[ctry] == -1)
{
#if YYDEBUG
if (yydebug && yychar >= YYEOF)
fprintf(stderr, "%s[%d]: backtracking 1 token\n", YYDEBUGSTR, yydepth);
#endif
ctry++;
}
save->ctry = ctry;
if (yyps->save == NULL)
{
/* If this is a first conflict in the stack, start saving lexemes */
if (!yylexemes)
{
yylexemes = (YYINT *) malloc((YYLVQUEUEGROWTH) * sizeof(YYINT));
if (yylexemes == NULL) goto yyenomem;
yylvals = (YYSTYPE *) malloc((YYLVQUEUEGROWTH) * sizeof(YYSTYPE));
if (yylvals == NULL) goto yyenomem;
yylvlim = yylvals + YYLVQUEUEGROWTH;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
yylpsns = (YYLTYPE *) malloc((YYLVQUEUEGROWTH) * sizeof(YYLTYPE));
if (yylpsns == NULL) goto yyenomem;
yylplim = yylpsns + YYLVQUEUEGROWTH;
#endif
}
if (yylvp == yylve)
{
yylvp = yylve = yylvals;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
yylpp = yylpe = yylpsns;
#endif
yylexp = yylexemes;
if (yychar >= YYEOF)
{
*yylve++ = yylval;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
*yylpe++ = yylloc;
#endif
*yylexp = (YYINT) yychar;
yychar = YYEMPTY;
}
}
}
if (yychar >= YYEOF)
{
yylvp--;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
yylpp--;
#endif
yylexp--;
yychar = YYEMPTY;
}
save->lexeme = (int) (yylvp - yylvals);
yyps->save = save;
}
if (yytable[yyn] == ctry)
{
#if YYDEBUG
if (yydebug)
fprintf(stderr, "%s[%d]: state %d, shifting to state %d\n",
YYDEBUGSTR, yydepth, yystate, yyctable[ctry]);
#endif
if (yychar < 0)
{
yylvp++;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
yylpp++;
#endif
yylexp++;
}
if (yystack.s_mark >= yystack.s_last && yygrowstack(&yystack) == YYENOMEM)
goto yyoverflow;
yystate = yyctable[ctry];
*++yystack.s_mark = (YYINT) yystate;
*++yystack.l_mark = yylval;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
*++yystack.p_mark = yylloc;
#endif
yychar = YYEMPTY;
if (yyerrflag > 0) --yyerrflag;
goto yyloop;
}
else
{
yyn = yyctable[ctry];
goto yyreduce;
}
} /* End of code dealing with conflicts */
#endif /* YYBTYACC */
if (((yyn = yysindex[yystate]) != 0) && (yyn += yychar) >= 0 &&
yyn <= YYTABLESIZE && yycheck[yyn] == (YYINT) yychar)
{
#if YYDEBUG
if (yydebug)
fprintf(stderr, "%s[%d]: state %d, shifting to state %d\n",
YYDEBUGSTR, yydepth, yystate, yytable[yyn]);
#endif
if (yystack.s_mark >= yystack.s_last && yygrowstack(&yystack) == YYENOMEM) goto yyoverflow;
yystate = yytable[yyn];
*++yystack.s_mark = yytable[yyn];
*++yystack.l_mark = yylval;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
*++yystack.p_mark = yylloc;
#endif
yychar = YYEMPTY;
if (yyerrflag > 0) --yyerrflag;
goto yyloop;
}
if (((yyn = yyrindex[yystate]) != 0) && (yyn += yychar) >= 0 &&
yyn <= YYTABLESIZE && yycheck[yyn] == (YYINT) yychar)
{
yyn = yytable[yyn];
goto yyreduce;
}
if (yyerrflag != 0) goto yyinrecovery;
#if YYBTYACC
yynewerrflag = 1;
goto yyerrhandler;
goto yyerrlab; /* redundant goto avoids 'unused label' warning */
yyerrlab:
/* explicit YYERROR from an action -- pop the rhs of the rule reduced
* before looking for error recovery */
yystack.s_mark -= yym;
yystate = *yystack.s_mark;
yystack.l_mark -= yym;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
yystack.p_mark -= yym;
#endif
yynewerrflag = 0;
yyerrhandler:
while (yyps->save)
{
int ctry;
YYParseState *save = yyps->save;
#if YYDEBUG
if (yydebug)
fprintf(stderr, "%s[%d]: ERROR in state %d, CONFLICT BACKTRACKING to state %d, %d tokens\n",
YYDEBUGSTR, yydepth, yystate, yyps->save->state,
(int)(yylvp - yylvals - yyps->save->lexeme));
#endif
/* Memorize most forward-looking error state in case it's really an error. */
if (yyerrctx == NULL || yyerrctx->lexeme < yylvp - yylvals)
{
/* Free old saved error context state */
if (yyerrctx) yyFreeState(yyerrctx);
/* Create and fill out new saved error context state */
yyerrctx = yyNewState((unsigned)(yystack.s_mark - yystack.s_base + 1));
if (yyerrctx == NULL) goto yyenomem;
yyerrctx->save = yyps->save;
yyerrctx->state = yystate;
yyerrctx->errflag = yyerrflag;
yyerrctx->yystack.s_mark = yyerrctx->yystack.s_base + (yystack.s_mark - yystack.s_base);
memcpy (yyerrctx->yystack.s_base, yystack.s_base, (size_t) (yystack.s_mark - yystack.s_base + 1) * sizeof(YYINT));
yyerrctx->yystack.l_mark = yyerrctx->yystack.l_base + (yystack.l_mark - yystack.l_base);
memcpy (yyerrctx->yystack.l_base, yystack.l_base, (size_t) (yystack.l_mark - yystack.l_base + 1) * sizeof(YYSTYPE));
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
yyerrctx->yystack.p_mark = yyerrctx->yystack.p_base + (yystack.p_mark - yystack.p_base);
memcpy (yyerrctx->yystack.p_base, yystack.p_base, (size_t) (yystack.p_mark - yystack.p_base + 1) * sizeof(YYLTYPE));
#endif
yyerrctx->lexeme = (int) (yylvp - yylvals);
}
yylvp = yylvals + save->lexeme;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
yylpp = yylpsns + save->lexeme;
#endif
yylexp = yylexemes + save->lexeme;
yychar = YYEMPTY;
yystack.s_mark = yystack.s_base + (save->yystack.s_mark - save->yystack.s_base);
memcpy (yystack.s_base, save->yystack.s_base, (size_t) (yystack.s_mark - yystack.s_base + 1) * sizeof(YYINT));
yystack.l_mark = yystack.l_base + (save->yystack.l_mark - save->yystack.l_base);
memcpy (yystack.l_base, save->yystack.l_base, (size_t) (yystack.l_mark - yystack.l_base + 1) * sizeof(YYSTYPE));
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
yystack.p_mark = yystack.p_base + (save->yystack.p_mark - save->yystack.p_base);
memcpy (yystack.p_base, save->yystack.p_base, (size_t) (yystack.p_mark - yystack.p_base + 1) * sizeof(YYLTYPE));
#endif
ctry = ++save->ctry;
yystate = save->state;
/* We tried shift, try reduce now */
if ((yyn = yyctable[ctry]) >= 0) goto yyreduce;
yyps->save = save->save;
save->save = NULL;
yyFreeState(save);
/* Nothing left on the stack -- error */
if (!yyps->save)
{
#if YYDEBUG
if (yydebug)
fprintf(stderr, "%sdebug[%d,trial]: trial parse FAILED, entering ERROR mode\n",
YYPREFIX, yydepth);
#endif
/* Restore state as it was in the most forward-advanced error */
yylvp = yylvals + yyerrctx->lexeme;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
yylpp = yylpsns + yyerrctx->lexeme;
#endif
yylexp = yylexemes + yyerrctx->lexeme;
yychar = yylexp[-1];
yylval = yylvp[-1];
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
yylloc = yylpp[-1];
#endif
yystack.s_mark = yystack.s_base + (yyerrctx->yystack.s_mark - yyerrctx->yystack.s_base);
memcpy (yystack.s_base, yyerrctx->yystack.s_base, (size_t) (yystack.s_mark - yystack.s_base + 1) * sizeof(YYINT));
yystack.l_mark = yystack.l_base + (yyerrctx->yystack.l_mark - yyerrctx->yystack.l_base);
memcpy (yystack.l_base, yyerrctx->yystack.l_base, (size_t) (yystack.l_mark - yystack.l_base + 1) * sizeof(YYSTYPE));
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
yystack.p_mark = yystack.p_base + (yyerrctx->yystack.p_mark - yyerrctx->yystack.p_base);
memcpy (yystack.p_base, yyerrctx->yystack.p_base, (size_t) (yystack.p_mark - yystack.p_base + 1) * sizeof(YYLTYPE));
#endif
yystate = yyerrctx->state;
yyFreeState(yyerrctx);
yyerrctx = NULL;
}
yynewerrflag = 1;
}
if (yynewerrflag == 0) goto yyinrecovery;
#endif /* YYBTYACC */
YYERROR_CALL("syntax error");
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
yyerror_loc_range[1] = yylloc; /* lookahead position is error start position */
#endif
#if !YYBTYACC
goto yyerrlab; /* redundant goto avoids 'unused label' warning */
yyerrlab:
#endif
++yynerrs;
yyinrecovery:
if (yyerrflag < 3)
{
yyerrflag = 3;
for (;;)
{
if (((yyn = yysindex[*yystack.s_mark]) != 0) && (yyn += YYERRCODE) >= 0 &&
yyn <= YYTABLESIZE && yycheck[yyn] == (YYINT) YYERRCODE)
{
#if YYDEBUG
if (yydebug)
fprintf(stderr, "%s[%d]: state %d, error recovery shifting to state %d\n",
YYDEBUGSTR, yydepth, *yystack.s_mark, yytable[yyn]);
#endif
if (yystack.s_mark >= yystack.s_last && yygrowstack(&yystack) == YYENOMEM) goto yyoverflow;
yystate = yytable[yyn];
*++yystack.s_mark = yytable[yyn];
*++yystack.l_mark = yylval;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
/* lookahead position is error end position */
yyerror_loc_range[2] = yylloc;
YYLLOC_DEFAULT(yyloc, yyerror_loc_range, 2); /* position of error span */
*++yystack.p_mark = yyloc;
#endif
goto yyloop;
}
else
{
#if YYDEBUG
if (yydebug)
fprintf(stderr, "%s[%d]: error recovery discarding state %d\n",
YYDEBUGSTR, yydepth, *yystack.s_mark);
#endif
if (yystack.s_mark <= yystack.s_base) goto yyabort;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
/* the current TOS position is the error start position */
yyerror_loc_range[1] = *yystack.p_mark;
#endif
#if defined(YYDESTRUCT_CALL)
#if YYBTYACC
if (!yytrial)
#endif /* YYBTYACC */
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
YYDESTRUCT_CALL("error: discarding state",
yystos[*yystack.s_mark], yystack.l_mark, yystack.p_mark);
#else
YYDESTRUCT_CALL("error: discarding state",
yystos[*yystack.s_mark], yystack.l_mark);
#endif /* defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) */
#endif /* defined(YYDESTRUCT_CALL) */
--yystack.s_mark;
--yystack.l_mark;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
--yystack.p_mark;
#endif
}
}
}
else
{
if (yychar == YYEOF) goto yyabort;
#if YYDEBUG
if (yydebug)
{
if ((yys = yyname[YYTRANSLATE(yychar)]) == NULL) yys = yyname[YYUNDFTOKEN];
fprintf(stderr, "%s[%d]: state %d, error recovery discarding token %d (%s)\n",
YYDEBUGSTR, yydepth, yystate, yychar, yys);
}
#endif
#if defined(YYDESTRUCT_CALL)
#if YYBTYACC
if (!yytrial)
#endif /* YYBTYACC */
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
YYDESTRUCT_CALL("error: discarding token", yychar, &yylval, &yylloc);
#else
YYDESTRUCT_CALL("error: discarding token", yychar, &yylval);
#endif /* defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) */
#endif /* defined(YYDESTRUCT_CALL) */
yychar = YYEMPTY;
goto yyloop;
}
yyreduce:
yym = yylen[yyn];
#if YYDEBUG
if (yydebug)
{
fprintf(stderr, "%s[%d]: state %d, reducing by rule %d (%s)",
YYDEBUGSTR, yydepth, yystate, yyn, yyrule[yyn]);
#ifdef YYSTYPE_TOSTRING
#if YYBTYACC
if (!yytrial)
#endif /* YYBTYACC */
if (yym > 0)
{
int i;
fputc('<', stderr);
for (i = yym; i > 0; i--)
{
if (i != yym) fputs(", ", stderr);
fputs(YYSTYPE_TOSTRING(yystos[yystack.s_mark[1-i]],
yystack.l_mark[1-i]), stderr);
}
fputc('>', stderr);
}
#endif
fputc('\n', stderr);
}
#endif
if (yym > 0)
yyval = yystack.l_mark[1-yym];
else
memset(&yyval, 0, sizeof yyval);
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
/* Perform position reduction */
memset(&yyloc, 0, sizeof(yyloc));
#if YYBTYACC
if (!yytrial)
#endif /* YYBTYACC */
{
YYLLOC_DEFAULT(yyloc, &yystack.p_mark[-yym], yym);
/* just in case YYERROR is invoked within the action, save
the start of the rhs as the error start position */
yyerror_loc_range[1] = yystack.p_mark[1-yym];
}
#endif
switch (yyn)
{
case 3:
#line 34 "pure_calc.y"
{ yyerrok ; }
break;
case 4:
#line 38 "pure_calc.y"
{ printf("%d\n",yystack.l_mark[0]);}
break;
case 5:
#line 40 "pure_calc.y"
{ regs[yystack.l_mark[-2]] = yystack.l_mark[0]; }
break;
case 6:
#line 44 "pure_calc.y"
{ yyval = yystack.l_mark[-1]; }
break;
case 7:
#line 46 "pure_calc.y"
{ yyval = yystack.l_mark[-2] + yystack.l_mark[0]; }
break;
case 8:
#line 48 "pure_calc.y"
{ yyval = yystack.l_mark[-2] - yystack.l_mark[0]; }
break;
case 9:
#line 50 "pure_calc.y"
{ yyval = yystack.l_mark[-2] * yystack.l_mark[0]; }
break;
case 10:
#line 52 "pure_calc.y"
{ yyval = yystack.l_mark[-2] / yystack.l_mark[0]; }
break;
case 11:
#line 54 "pure_calc.y"
{ yyval = yystack.l_mark[-2] % yystack.l_mark[0]; }
break;
case 12:
#line 56 "pure_calc.y"
{ yyval = yystack.l_mark[-2] & yystack.l_mark[0]; }
break;
case 13:
#line 58 "pure_calc.y"
{ yyval = yystack.l_mark[-2] | yystack.l_mark[0]; }
break;
case 14:
#line 60 "pure_calc.y"
{ yyval = - yystack.l_mark[0]; }
break;
case 15:
#line 62 "pure_calc.y"
{ yyval = regs[yystack.l_mark[0]]; }
break;
case 17:
#line 67 "pure_calc.y"
{ yyval = yystack.l_mark[0]; base = (yystack.l_mark[0]==0) ? 8 : 10; }
break;
case 18:
#line 69 "pure_calc.y"
{ yyval = base * yystack.l_mark[-1] + yystack.l_mark[0]; }
break;
#line 1264 "pure_calc.tab.c"
default:
break;
}
yystack.s_mark -= yym;
yystate = *yystack.s_mark;
yystack.l_mark -= yym;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
yystack.p_mark -= yym;
#endif
yym = yylhs[yyn];
if (yystate == 0 && yym == 0)
{
#if YYDEBUG
if (yydebug)
{
fprintf(stderr, "%s[%d]: after reduction, ", YYDEBUGSTR, yydepth);
#ifdef YYSTYPE_TOSTRING
#if YYBTYACC
if (!yytrial)
#endif /* YYBTYACC */
fprintf(stderr, "result is <%s>, ", YYSTYPE_TOSTRING(yystos[YYFINAL], yyval));
#endif
fprintf(stderr, "shifting from state 0 to final state %d\n", YYFINAL);
}
#endif
yystate = YYFINAL;
*++yystack.s_mark = YYFINAL;
*++yystack.l_mark = yyval;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
*++yystack.p_mark = yyloc;
#endif
if (yychar < 0)
{
#if YYBTYACC
do {
if (yylvp < yylve)
{
/* we're currently re-reading tokens */
yylval = *yylvp++;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
yylloc = *yylpp++;
#endif
yychar = *yylexp++;
break;
}
if (yyps->save)
{
/* in trial mode; save scanner results for future parse attempts */
if (yylvp == yylvlim)
{ /* Enlarge lexical value queue */
size_t p = (size_t) (yylvp - yylvals);
size_t s = (size_t) (yylvlim - yylvals);
s += YYLVQUEUEGROWTH;
if ((yylexemes = (YYINT *)realloc(yylexemes, s * sizeof(YYINT))) == NULL)
goto yyenomem;
if ((yylvals = (YYSTYPE *)realloc(yylvals, s * sizeof(YYSTYPE))) == NULL)
goto yyenomem;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
if ((yylpsns = (YYLTYPE *)realloc(yylpsns, s * sizeof(YYLTYPE))) == NULL)
goto yyenomem;
#endif
yylvp = yylve = yylvals + p;
yylvlim = yylvals + s;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
yylpp = yylpe = yylpsns + p;
yylplim = yylpsns + s;
#endif
yylexp = yylexemes + p;
}
*yylexp = (YYINT) YYLEX;
*yylvp++ = yylval;
yylve++;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
*yylpp++ = yylloc;
yylpe++;
#endif
yychar = *yylexp++;
break;
}
/* normal operation, no conflict encountered */
#endif /* YYBTYACC */
yychar = YYLEX;
#if YYBTYACC
} while (0);
#endif /* YYBTYACC */
if (yychar < 0) yychar = YYEOF;
#if YYDEBUG
if (yydebug)
{
if ((yys = yyname[YYTRANSLATE(yychar)]) == NULL) yys = yyname[YYUNDFTOKEN];
fprintf(stderr, "%s[%d]: state %d, reading token %d (%s)\n",
YYDEBUGSTR, yydepth, YYFINAL, yychar, yys);
}
#endif
}
if (yychar == YYEOF) goto yyaccept;
goto yyloop;
}
if (((yyn = yygindex[yym]) != 0) && (yyn += yystate) >= 0 &&
yyn <= YYTABLESIZE && yycheck[yyn] == (YYINT) yystate)
yystate = yytable[yyn];
else
yystate = yydgoto[yym];
#if YYDEBUG
if (yydebug)
{
fprintf(stderr, "%s[%d]: after reduction, ", YYDEBUGSTR, yydepth);
#ifdef YYSTYPE_TOSTRING
#if YYBTYACC
if (!yytrial)
#endif /* YYBTYACC */
fprintf(stderr, "result is <%s>, ", YYSTYPE_TOSTRING(yystos[yystate], yyval));
#endif
fprintf(stderr, "shifting from state %d to state %d\n", *yystack.s_mark, yystate);
}
#endif
if (yystack.s_mark >= yystack.s_last && yygrowstack(&yystack) == YYENOMEM) goto yyoverflow;
*++yystack.s_mark = (YYINT) yystate;
*++yystack.l_mark = yyval;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
*++yystack.p_mark = yyloc;
#endif
goto yyloop;
#if YYBTYACC
/* Reduction declares that this path is valid. Set yypath and do a full parse */
yyvalid:
if (yypath) YYABORT;
while (yyps->save)
{
YYParseState *save = yyps->save;
yyps->save = save->save;
save->save = yypath;
yypath = save;
}
#if YYDEBUG
if (yydebug)
fprintf(stderr, "%s[%d]: state %d, CONFLICT trial successful, backtracking to state %d, %d tokens\n",
YYDEBUGSTR, yydepth, yystate, yypath->state, (int)(yylvp - yylvals - yypath->lexeme));
#endif
if (yyerrctx)
{
yyFreeState(yyerrctx);
yyerrctx = NULL;
}
yylvp = yylvals + yypath->lexeme;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
yylpp = yylpsns + yypath->lexeme;
#endif
yylexp = yylexemes + yypath->lexeme;
yychar = YYEMPTY;
yystack.s_mark = yystack.s_base + (yypath->yystack.s_mark - yypath->yystack.s_base);
memcpy (yystack.s_base, yypath->yystack.s_base, (size_t) (yystack.s_mark - yystack.s_base + 1) * sizeof(YYINT));
yystack.l_mark = yystack.l_base + (yypath->yystack.l_mark - yypath->yystack.l_base);
memcpy (yystack.l_base, yypath->yystack.l_base, (size_t) (yystack.l_mark - yystack.l_base + 1) * sizeof(YYSTYPE));
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
yystack.p_mark = yystack.p_base + (yypath->yystack.p_mark - yypath->yystack.p_base);
memcpy (yystack.p_base, yypath->yystack.p_base, (size_t) (yystack.p_mark - yystack.p_base + 1) * sizeof(YYLTYPE));
#endif
yystate = yypath->state;
goto yyloop;
#endif /* YYBTYACC */
yyoverflow:
YYERROR_CALL("yacc stack overflow");
#if YYBTYACC
goto yyabort_nomem;
yyenomem:
YYERROR_CALL("memory exhausted");
yyabort_nomem:
#endif /* YYBTYACC */
yyresult = 2;
goto yyreturn;
yyabort:
yyresult = 1;
goto yyreturn;
yyaccept:
#if YYBTYACC
if (yyps->save) goto yyvalid;
#endif /* YYBTYACC */
yyresult = 0;
yyreturn:
#if defined(YYDESTRUCT_CALL)
if (yychar != YYEOF && yychar != YYEMPTY)
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
YYDESTRUCT_CALL("cleanup: discarding token", yychar, &yylval, &yylloc);
#else
YYDESTRUCT_CALL("cleanup: discarding token", yychar, &yylval);
#endif /* defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) */
{
YYSTYPE *pv;
#if defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED)
YYLTYPE *pp;
for (pv = yystack.l_base, pp = yystack.p_base; pv <= yystack.l_mark; ++pv, ++pp)
YYDESTRUCT_CALL("cleanup: discarding state",
yystos[*(yystack.s_base + (pv - yystack.l_base))], pv, pp);
#else
for (pv = yystack.l_base; pv <= yystack.l_mark; ++pv)
YYDESTRUCT_CALL("cleanup: discarding state",
yystos[*(yystack.s_base + (pv - yystack.l_base))], pv);
#endif /* defined(YYLTYPE) || defined(YYLTYPE_IS_DECLARED) */
}
#endif /* defined(YYDESTRUCT_CALL) */
#if YYBTYACC
if (yyerrctx)
{
yyFreeState(yyerrctx);
yyerrctx = NULL;
}
while (yyps)
{
YYParseState *save = yyps;
yyps = save->save;
save->save = NULL;
yyFreeState(save);
}
while (yypath)
{
YYParseState *save = yypath;
yypath = save->save;
save->save = NULL;
yyFreeState(save);
}
#endif /* YYBTYACC */
yyfreestack(&yystack);
return (yyresult);
}
|
the_stack_data/78238.c
|
#include<stdio.h>
int main()
{
int n, m, i=1;
printf("Enter n\n");
scanf("%d", &n);
printf("Enter m\n");
scanf("%d", &m);
printf("The multiplication table of %d is\n",n);
while(i<=m)
{
printf("%d*%d=%d\n", i, n, (i*n));
i++;
}
return 0;
}
|
the_stack_data/242331895.c
|
/* { dg-do run } */
/* { dg-require-effective-target split_stack } */
/* { dg-options "-fsplit-stack" } */
/* This test is like split-3.c, but tests with a smaller stack frame,
since that uses a different prologue. */
#include <stdarg.h>
#include <stdlib.h>
/* Use a noinline function to ensure that the buffer is not removed
from the stack. */
static void use_buffer (char *buf) __attribute__ ((noinline));
static void
use_buffer (char *buf)
{
buf[0] = '\0';
}
/* When using gold, the call to abort will force a stack split. */
static void
down (int i, ...)
{
char buf[1];
va_list ap;
va_start (ap, i);
if (va_arg (ap, int) != 1
|| va_arg (ap, int) != 2
|| va_arg (ap, int) != 3
|| va_arg (ap, int) != 4
|| va_arg (ap, int) != 5
|| va_arg (ap, int) != 6
|| va_arg (ap, int) != 7
|| va_arg (ap, int) != 8
|| va_arg (ap, int) != 9
|| va_arg (ap, int) != 10)
abort ();
if (i > 0)
{
use_buffer (buf);
down (i - 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10);
}
}
int
main (void)
{
down (1000, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10);
return 0;
}
|
the_stack_data/154828164.c
|
///////////////////////////////////////////////////////////
//
// Function Name : Fact()
// Input : Integer
// Output : Integer
// Description : Accept Number From User & Find the Factorial Using Whileloop
// Author : Prasad Dangare
// Date : 02 Mar 2021
//
///////////////////////////////////////////////////////////
#include <stdio.h>
int Fact(int iNo)
{
int iMult = 1;
if(iNo < 0)
{
iNo =- iNo;
}
while(iNo > 0)
{
iMult = iMult * iNo;
iNo--;
}
return iMult;
}
int main()
{
int ivalue = 0;
int iRet = 0;
printf("Enter Number : ");
scanf("%d", &ivalue);
iRet = Fact(ivalue);
printf("Result Is %d", iRet);
return 0;
}
|
the_stack_data/797639.c
|
/* PR middle-end/51590 */
/* { dg-do compile } */
struct S { long a, b; };
extern void baz (char *);
static void
bar (struct S *x)
{
char c[8];
int i;
for (i = 0; i < 8; i++)
c[i] = x->a >> ((7 - i) * 8);
baz (c);
}
void
foo (const char *x, struct S *y)
{
struct S d = *y;
int i;
for (i = 0; *x; x++)
i++;
if (i != 1)
return;
bar (&d);
}
|
the_stack_data/12529.c
|
#include <stdio.h>
#define LOWER 0 /* lC-mite inferior de la tabla */
#define UPPER 300 /* lC-mite superior */
#define STEP 20 /* tamaC1o del incremento */
main ()
{
int fahr;
for (fahr = LOWER; fahr <= UPPER; fahr = fahr + STEP)
printf ("%3d %6.1f\n", fahr, (5.0 / 9.0) * (fahr - 32));
}
|
the_stack_data/136076691.c
|
/*
Copyright (c) 2017, Lawrence Livermore National Security, LLC.
Produced at the Lawrence Livermore National Laboratory
Written by Chunhua Liao, Pei-Hung Lin, Joshua Asplund,
Markus Schordan, and Ian Karlin
(email: [email protected], [email protected], [email protected],
[email protected], [email protected])
LLNL-CODE-732144
All rights reserved.
This file is part of DataRaceBench. For details, see
https://github.com/LLNL/dataracebench. Please also see the LICENSE file
for our additional BSD notice.
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 disclaimer below.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the disclaimer (as noted below)
in the documentation and/or other materials provided with the
distribution.
* Neither the name of the LLNS/LLNL 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 LAWRENCE LIVERMORE NATIONAL
SECURITY, LLC, THE U.S. DEPARTMENT OF ENERGY 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.
*/
/*
Two pointers have a distance of 12 (xa2 - xa1 = 12).
They are used as base addresses for indirect array accesses using an index set (another array).
The index set has two indices with distance of 12 :
indexSet[1]- indexSet[0] = 533 - 521 = 12
So xa1[idx] and xa2[idx] may cause loop carried dependence for N=0 and N=3.
We use the default loop scheduling (static even) in OpenMP.
It is possible that two dependent iterations will be scheduled
within a same chunk to a same thread. So there is no runtime data races.
N is 180, two iteraions with N=0 and N= 1 have loop carried dependences.
For static even scheduling, we must have at least 180 threads (180/180=1 iterations)
so iteration 0 and 1 will be scheduled to two different threads.
Data race pair: xa1[idx]@128:5 vs. xa2[idx]@129:5
*/
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#define N 180
int indexSet[N] = {
521, 533, 525, 527, 529, 531, // 521+12=533
547, 549, 551, 553, 555, 557,
573, 575, 577, 579, 581, 583,
599, 601, 603, 605, 607, 609,
625, 627, 629, 631, 633, 635,
651, 653, 655, 657, 659, 661,
859, 861, 863, 865, 867, 869,
885, 887, 889, 891, 893, 895,
911, 913, 915, 917, 919, 921,
937, 939, 941, 943, 945, 947,
963, 965, 967, 969, 971, 973,
989, 991, 993, 995, 997, 999,
1197, 1199, 1201, 1203, 1205, 1207,
1223, 1225, 1227, 1229, 1231, 1233,
1249, 1251, 1253, 1255, 1257, 1259,
1275, 1277, 1279, 1281, 1283, 1285,
1301, 1303, 1305, 1307, 1309, 1311,
1327, 1329, 1331, 1333, 1335, 1337,
1535, 1537, 1539, 1541, 1543, 1545,
1561, 1563, 1565, 1567, 1569, 1571,
1587, 1589, 1591, 1593, 1595, 1597,
1613, 1615, 1617, 1619, 1621, 1623,
1639, 1641, 1643, 1645, 1647, 1649,
1665, 1667, 1669, 1671, 1673, 1675,
1873, 1875, 1877, 1879, 1881, 1883,
1899, 1901, 1903, 1905, 1907, 1909,
1925, 1927, 1929, 1931, 1933, 1935,
1951, 1953, 1955, 1957, 1959, 1961,
1977, 1979, 1981, 1983, 1985, 1987,
2003, 2005, 2007, 2009, 2011, 2013};
int main (int argc, char* argv[])
{
double * base = (double*) malloc(sizeof(double)* (2013+12+1));
if (base == 0)
{
printf ("Error in malloc(). Aborting ...\n");
return 1;
}
double * xa1 = base;
double * xa2 = xa1 + 12;
int i;
// initialize segments touched by indexSet
for (i =521; i<= 2025; ++i)
{
base[i]=0.5*i;
}
#pragma omp parallel for // default static even scheduling may not trigger data race!
for (i =0; i< N; ++i)
{
int idx = indexSet[i];
xa1[idx]+= 1.0;
xa2[idx]+= 3.0;
}
printf("x1[999]=%f xa2[1285]=%f\n", xa1[999], xa2[1285]);
free (base);
return 0;
}
|
the_stack_data/122692.c
|
/*
* Title:
* Description: Write a C program segment to display the index of the smallest and the largest numbers in an array x of 20 integers. Assume array x already has values assigned to each element.
* Assignment: Review Question 5
* Link to assignment: In the book
*
* Programmer: Sebastian Livoni Larsen
* Date completed: October 21, 2021
* Instructor: Kurt Nørmark * Class: AAL E21
*/
#include <stdio.h>
#include <stdlib.h>
#define SIZE 20
void display_min_and_max(int x[], int size);
int main(void) {
int x[SIZE] = {9, 8, 7, 6, 5, 4, 3, 2, 1, 21, 20, 19, 18, 17, 16, 15, 14, 13, 12, 11};
display_min_and_max(x, SIZE);
}
void display_min_and_max(int x[], int size) {
int min, max, min_index, max_index;
for (int i = 0; i < size; i++) {
if (x[i] > max) {
max = x[i];
max_index = i;
}
if (x[i] < min) {
min = x[i];
min_index = i;
}
}
printf("Max is at index %d - min is at index %d\n", max_index, min_index);
}
|
the_stack_data/1055536.c
|
/* origin: FreeBSD /usr/src/lib/msun/src/e_sqrt.c */
/*
* ====================================================
* Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
*
* Developed at SunSoft, a Sun Microsystems, Inc. business.
* Permission to use, copy, modify, and distribute this
* software is freely granted, provided that this notice
* is preserved.
* ====================================================
*/
/* sqrt(x)
* Return correctly rounded sqrt.
* ------------------------------------------
* | Use the hardware sqrt if you have one |
* ------------------------------------------
* Method:
* Bit by bit method using integer arithmetic. (Slow, but portable)
* 1. Normalization
* Scale x to y in [1,4) with even powers of 2:
* find an integer k such that 1 <= (y=x*2^(2k)) < 4, then
* sqrt(x) = 2^k * sqrt(y)
* 2. Bit by bit computation
* Let q = sqrt(y) truncated to i bit after binary point (q = 1),
* i 0
* i+1 2
* s = 2*q , and y = 2 * ( y - q ). (1)
* i i i i
*
* To compute q from q , one checks whether
* i+1 i
*
* -(i+1) 2
* (q + 2 ) <= y. (2)
* i
* -(i+1)
* If (2) is false, then q = q ; otherwise q = q + 2 .
* i+1 i i+1 i
*
* With some algebric manipulation, it is not difficult to see
* that (2) is equivalent to
* -(i+1)
* s + 2 <= y (3)
* i i
*
* The advantage of (3) is that s and y can be computed by
* i i
* the following recurrence formula:
* if (3) is false
*
* s = s , y = y ; (4)
* i+1 i i+1 i
*
* otherwise,
* -i -(i+1)
* s = s + 2 , y = y - s - 2 (5)
* i+1 i i+1 i i
*
* One may easily use induction to prove (4) and (5).
* Note. Since the left hand side of (3) contain only i+2 bits,
* it does not necessary to do a full (53-bit) comparison
* in (3).
* 3. Final rounding
* After generating the 53 bits result, we compute one more bit.
* Together with the remainder, we can decide whether the
* result is exact, bigger than 1/2ulp, or less than 1/2ulp
* (it will never equal to 1/2ulp).
* The rounding mode can be detected by checking whether
* huge + tiny is equal to huge, and whether huge - tiny is
* equal to huge for some floating point number "huge" and "tiny".
*
* Special cases:
* sqrt(+-0) = +-0 ... exact
* sqrt(inf) = inf
* sqrt(-ve) = NaN ... with invalid signal
* sqrt(NaN) = NaN ... with invalid signal for signaling NaN
*/
#include <stdint.h>
/* Set a double from two 32 bit ints. */
#define INSERT_WORDS(d,hi,lo) \
do { \
union {double f; uint64_t i;} __u; \
__u.i = ((uint64_t)(hi)<<32) | (uint32_t)(lo); \
(d) = __u.f; \
} while (0)
/* Get two 32 bit ints from a double. */
#define EXTRACT_WORDS(hi,lo,d) \
do { \
union {double f; uint64_t i;} __u; \
__u.f = (d); \
(hi) = __u.i >> 32; \
(lo) = (uint32_t)__u.i; \
} while (0)
static const double tiny = 1.0e-300;
double my_sqrt(double x)
{
double z;
int32_t sign = (int)0x80000000;
int32_t ix0,s0,q,m,t,i;
uint32_t r,t1,s1,ix1,q1;
EXTRACT_WORDS(ix0, ix1, x);
/* take care of Inf and NaN */
if ((ix0&0x7ff00000) == 0x7ff00000) {
return x*x + x; /* sqrt(NaN)=NaN, sqrt(+inf)=+inf, sqrt(-inf)=sNaN */
}
/* take care of zero */
if (ix0 <= 0) {
if (((ix0&~sign)|ix1) == 0)
return x; /* sqrt(+-0) = +-0 */
if (ix0 < 0)
return (x-x)/(x-x); /* sqrt(-ve) = sNaN */
}
/* normalize x */
m = ix0>>20;
if (m == 0) { /* subnormal x */
while (ix0 == 0) {
m -= 21;
ix0 |= (ix1>>11);
ix1 <<= 21;
}
for (i=0; (ix0&0x00100000) == 0; i++)
ix0<<=1;
m -= i - 1;
ix0 |= ix1>>(32-i);
ix1 <<= i;
}
m -= 1023; /* unbias exponent */
ix0 = (ix0&0x000fffff)|0x00100000;
if (m & 1) { /* odd m, double x to make it even */
ix0 += ix0 + ((ix1&sign)>>31);
ix1 += ix1;
}
m >>= 1; /* m = [m/2] */
/* generate sqrt(x) bit by bit */
ix0 += ix0 + ((ix1&sign)>>31);
ix1 += ix1;
q = q1 = s0 = s1 = 0; /* [q,q1] = sqrt(x) */
r = 0x00200000; /* r = moving bit from right to left */
while (r != 0) {
t = s0 + r;
if (t <= ix0) {
s0 = t + r;
ix0 -= t;
q += r;
}
ix0 += ix0 + ((ix1&sign)>>31);
ix1 += ix1;
r >>= 1;
}
r = sign;
while (r != 0) {
t1 = s1 + r;
t = s0;
if (t < ix0 || (t == ix0 && t1 <= ix1)) {
s1 = t1 + r;
if ((t1&sign) == sign && (s1&sign) == 0)
s0++;
ix0 -= t;
if (ix1 < t1)
ix0--;
ix1 -= t1;
q1 += r;
}
ix0 += ix0 + ((ix1&sign)>>31);
ix1 += ix1;
r >>= 1;
}
/* use floating add to find out rounding direction */
if ((ix0|ix1) != 0) {
z = 1.0 - tiny; /* raise inexact flag */
if (z >= 1.0) {
z = 1.0 + tiny;
if (q1 == (uint32_t)0xffffffff) {
q1 = 0;
q++;
} else if (z > 1.0) {
if (q1 == (uint32_t)0xfffffffe)
q++;
q1 += 2;
} else
q1 += q1 & 1;
}
}
ix0 = (q>>1) + 0x3fe00000;
ix1 = q1>>1;
if (q&1)
ix1 |= sign;
ix0 += m << 20;
INSERT_WORDS(z, ix0, ix1);
return z;
}
|
the_stack_data/57948949.c
|
#include <stdio.h>
#undef EOF
#define EOF 'A'
int igetline(char *s,int size)
{
int c,i;
for(i=0;i<size-1&&(c=getchar())!=EOF&&c!='\n';++i)
s[i]=c;
if(c=='\n')
{
s[i]=(char)c;
++i;
}
s[i]='\0';
return i;
}
|
the_stack_data/42961.c
|
/* GIMP RGB C-Source image dump (Arduino_UNO_Rev3_Ok.c) */
/* 1. Comment out exported struct */
// static const struct {
// unsigned int width;
// unsigned int height;
// unsigned int bytes_per_pixel; /* 2:RGB16, 3:RGB, 4:RGBA */
// unsigned char pixel_data[100 * 71 * 2 + 1];
// } gimp_image = {
// 100, 71, 2,
/* 2. Add PROGMEM data declaration */
/* 3. Fix the file tail */
#ifdef __AVR__
#include <avr/io.h>
#include <avr/pgmspace.h>
#elif defined(ESP8266)
#include <pgmspace.h>
#elif defined(__IMXRT1052__) || defined(__IMXRT1062__)
// PROGMEM is defefind for T4 to place data in specific memory section
#undef PROGMEM
#define PROGMEM
#else
#define PROGMEM
#endif
static const unsigned char Arduino_UNO_Rev3_Ok[] PROGMEM =
"\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377"
"\377\377\377\367<\337\034\327\034\327\034\327<\337<\327<\337<\337<\327<\327"
"<\337<\327<\327<\327\034\327<\327<\327=\327\\\327\\\317<\327\\\327<\337<\337"
"<\337<\337<\337<\337<\337<\337<\327<\337\236\367\277\367\277\367=\337<\337"
"<\337<\337<\337<\337<\337<\337<\337\034\337<\337<\337<\327<\327<\327<\337"
"\\\337<\327<\327<\327]\337\\\327\\\337]\327<\327\\\327<\327<\327=\327<\327"
"<\327]\327<\327\\\327<\327=\327=\327<\327=\327\\\327<\327<\327]\327=\327"
"=\327<\327<\327\\\327]\327\337\367\377\367\337\377\377\377\377\377\377\377"
"\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\376\377"
"\232\276\267\215X\246\326\225\071\276z\326z\316z\316\232\316z\316z\306\071"
"\306v\235u\225\370\235\327\205\267\215VeP\024PD\222\\P$NSnk\257s\216k\217"
"k\317s\216k\216k\317s\217knk\257s\320{\216kNc\217s\217k\217s\257s\216kNk"
"\257s\257s\217k\320s\257s\216k\317snkNcnk\216knknk\314R\015[Nc\314Z\015[-c"
"\015[-c-[Nc\314R\254R-c\015[-c\015[\015[,[\014[-[\014[\015[\014[-[-[-[\014S\314R\354"
"Rr\224\377\367\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377"
"\377\377\377\377\377\377\377\377\377\337\377\027\226\263l\363\234\367\305"
"Y\306\030\276\031\306\071\306z\316z\316\370\275v\245\323\224\027\306\323\234"
"\321Lq\004\217\013\222t\231\306y\316u\235\354ZD!E)Mk(Bf)jJ\014c%)E)\216sE)E)"
"\253ZjR%!\307\071\014c\344\040\004!\313Z\247\071E)\010BjR%!\004!\314Z\004!%)jJ)B$!\206"
")\015c\317sMc\303\030\344\030\253R\206\061\004!\350\071jJ\004!\344\030\253RE!\004\031"
"JJ\310\071$\031\207\061\313Z\004\031\004\031\213R\206\061%)\010BIJ\344\030\004!\014S\272"
"\276\337\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377"
"\377\377\377\377\377\377\377\337\377\273\276\323d\267\255Q|\330\265\273\316"
"y\306y\316y\316\030\276\370\275\327\265\360\203T\225\025\215Q,q\004-\013Q\204"
"\024\245\327\275\267\275\216kIJ)Jnk\253ZIJ\314ZnkiJ\212R\257s)B\313Z\015c\314"
"Z)B\010BMk\350\071\010BnkIJ\010B\213R\014c\010B\350\071nk\206\061\347\071\313ZJJ\206"
"\061\247\071\217s\360{-c\247\061\307\071\314Z\350\071\206\061IJ\212Rf\061E!\014["
"E!\206\061\213R\351Af)\206\061\253ZE)\243\030\254ZF)\004!\350\071)J\344\040\303"
"\020\015S\071\266\276\367\377\377\377\377\377\377\377\377\377\377\377\377\377"
"\377\377\377\377\377\377\377\337\377\277\377\232\276\064\205\367\235u\225"
"\031\276\334\336y\316\271\326\271\326X\316\030\276z\306\317sl;P,q\004\222\004m"
"\023\223\214Z\316\374\336\333\336\353Z-c\354ZIB\212RMk\313Z\212J\317k\320"
"sjB\223\224\324\214\324\224\253R\014[,[\010\062M[mc\212J\313RM[\014[\212J\256"
"cm[jJ\354RM[\212J\313R\354R\313J\350\061(\062):\353R\313RI:\313JM[\253BjBM"
"[\354RJ:\015S\014[iB\252JM[\353RiB\014[\353RiB\014S\257c\252J\313J\360k\014S\253"
"B\367\245\236\367\337\377\377\377\377\377\377\377\377\377\377\377\377\377"
"\377\377\377\377\377\377\377\377\277\377\232\276u\215\273\336\367\275\030"
"\276\373\326y\316\272\326\332\336\231\326\370\265Y\306nk\323d\262,\221\014"
"r\024\360\033\222d\273\316=\337\266\235(\"\202\010a\010a\000a\010a\000a\010\343\000E"
"\011E\011e\021\217k\364\214\324\204\020l\216[\216[\257[\216cn[\257c\257[n[\256"
"[\257c\216[\216[\216[n[n[\216[\216[nSnS\257c\360c\256[\216[mS\256[nSmS\353"
":\354B\313:\353:\014C\313:\253B\354Z\353B\313BMKMK\354B\014K\353:\013;\014;M"
"KMK,CMK\253\"\326\235^\367\276\367\377\377\377\377\377\377\377\377\377\377"
"\377\377\377\377\377\377\377\377\337\377\276\377\232\276\064\205\327\245v"
"\245\071\276=\347X\306\231\326\271\336\266\275\327\275\233\316\257k\017\024"
"r\024\317\033\327\245\367\245r\\\260[\061\204\320[\317[HJ\206\061a\010$)\206\061"
"E)e\031\246\011\306\011\206\021\324\214\330\245\330\245\353:i\"\353:(\002\212\""
"i\"\211\"(\002\007\002\251\"\010\002\216S\014;'\002\252\062\013C'\002H\032\313:i*\007\002\007\002"
"\007\002\212\062\347\011\007\002I\"\353B\347\001(\032i\062(\032\347\001I*\312:\245\011H*\312"
":\347\001(\032I*\212*\347\001\346\001\211\"\007\002\353\062\216[\007\002\353\012\226\235]"
"\357\276\367\337\377\377\377\377\377\377\377\377\377\377\377\377\377\377"
"\377\377\377\377\377\277\377\333\306\267\235\070\256\024\215\232\316\034\337"
"\333\326\327\275U\255\266\265Z\316\374\326\320{\360k\065\205\353\002\070\306"
"\030\316\263|\260[r\224Nc\314J\262\234\307\071\347\071ns\257{\206\061E\021nK\263"
"l\307\011\370\255r|\267\235-;\226\215\065\205i\022\364t\323t\061d\360S\222t\323"
"t\253\"\327\235v\215I\002\364\204\226\225M;\020d\327\225\222li\002I\002H\012U\205"
"Q\\H\002\263|\327\235\252*\020\\\263|\060\\I\022\024\205\262|'\012\222t\064\205\212"
"*qd\020d\322t\313\062\323t\364|\350\001U\205u\225\353B\353\022\226\235=\347\236"
"\367\337\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377"
"\377\337\377\277\377Y\246\222\\\327\265\267\275\373\336\034\337\233\316\232"
"\316z\316z\306\071\306\232\316u\255x\316\064\235\253\012r\214\263\224\216KI"
"\062\343\030\344\040)J\307\071\303\030\247\061E)%)\343\020H*mKRl\212\032z\276\267"
"\235{\276\357C\013\003\360C,\013\354\002,\033\357;\014\003\353\002\317C,\003\216\063\360"
"K,\003,\023\320C,\003\354\002\013\003\013\003\013\003\013\003\013\003\013\013\353\002\353\002\312\002\317"
"C\353\002\353\002\216C\312\002\353\002\252\012\353\032\312\002i\002\317C\353\002\312\002\353"
"\012\353\012\313\002\352\012\353\012\013\003\353\022\215CMCM+\225\235\034\347\236\367"
"\337\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377"
"\337\377\336\377\027\216\060\034\030\246\322tq|\024\235\024\235\223\214\262\224"
"\263\224\364\234\024\235\317sU\235\364\204n+.S\354Z\213\"\252:E)%!jR\307\071"
"f))B\010BE)\004!\313B\222t\330\235\353\032\374\316\327\245\274\306qL\030\216\370"
"\225\315\023\226}\267\205\363\\\363T\226\215Uu\017$\027\206\327\215\215\003\215"
"\003\323T\256\003\216\003\216\003\216\003\216\003\216\003\216\003\215\003\215\003\215\003m\013\222"
"Ln\003m\003\323\\L\003m\003M\003L\003M\003\014\003\323\\M\003m\003m\003m\003\216\023\330\225\364lm"
"\003r\\\226\205\256\033m\013v\235<\347~\357\337\377\377\377\377\377\377\377\377"
"\377\377\377\377\377\377\377\377\377\336\377\276\367\030\216r\004\357\013\222"
"Ty\306X\306\023\215\262t\263\224\364\224\024\235\360{\320c\015\003\015\013\360\063"
"V\235\327\255\021\\M[\060\204IJ\015c\024\255\313R\253R\360\203\020\204\010:I\032"
"\023m\327\215M\023=\317\232\276\374\316QL\357\013P\004\060\014\060\004\060\014P\004P\004"
"u]\357\003\060\004\263L\263D\020\004/\004\017\014/\004\020\004\017\004\017\004\017\004\017\004\360\003\357"
"\013\357\003\017\004\017\004\357\003\357\003\357\003\357\003\357\003\357\003\317\003\316\003\317\003"
"\256\003\216\013\317\003\357\003\357\003\357\003\357\013\262T\017,\017\004P\064Tm\357\003\257"
"\013\226\225\034\347\236\367\277\367\236\367]\357]\357]\357]\357]\357]\357"
"]\357<\357=\347\327\225\322T\322Tz\266\027\316W\316\333\316\027\246U\255\030"
"\306z\316\323\244\323|n\003N\003\216#U\245\326\275\257S\360c\350\071\314Z-[ns"
"\252R\314ZNk\212R\212J\354\"\323d\232\246\061$\323dU\205\266\255T\235\023\225"
"qdT]\064]\064]\024e\023]\225m\363\\\064]\064e\064e\024]\024]\023]\023]\023]\363\\\363"
"\\\363d\363\\\023e\222<P\004\061\004P\004P\004P\004P\004P\004\060\004\060\004\060\004\017\004\060\004\020"
"\004\060\004\060\004P\004Q\004P\004\060\004\070\216\226u\060\014\064]\070\236P\004\317\023\225\235"
"\034\347~\357\276\367\226\275u\265\030\316\232\336\332\346\373\346\034\357\034"
"\357\033\357<\367<\357<\367\\\367<\357\\\367}\357<\367]\357<\357<\357<\357"
"\231\326\357S\360\033N\003\216#\232\306\272\326\364|\257S\212B\253B)*-[\212"
"J\247!\257cIB\010:\313\002\257#\020\064\322\024\262\034\020\064\226\245q\234\326\265"
"\334\336\272\266\333\316\272\266\273\276=\317\272\266y\256\034\317\373\276"
"\333\316\237\357~\347=\337\236\347\272\276y\266\333\276y\256\272\276\374"
"\326\030\226\262\004\221\004\222\004q\004r\004q\004q\004q\004q\004p\004P\004P\004P\004p\004q\004\221\004\221"
"\004\221\004P\004\070\206\064M\261\004\225m\272\246\221\004\360\013\226\225\035\347~\357"
"\277\367U\255\322\244\326\305\027\306X\316\272\336\272\336\333\336\373\346"
"\373\346\373\346\\\357<\357\034\347]\357]\357<\357\034\347\033\347\034\347<\357"
"\367\305+\063M\033\260\033\216#\357S\060T\222L\360;(\012\010\012\060T\020l\357{\256"
"K\320k\020t\216[\257;n\003\061,\322\034\363\014\222$\222T\322d\236\347\236\357"
"\272\246\373\276\272\246\333\256\333\266\273\256\034\277\374\276\333\256z"
"\246~\337\236\347\236\347\236\347\333\276]\307y\246\034\277\034\317\236\337"
"\272\246\266]\226]\225]\225]\225]\225]\225]\226]\226]\225]u]v]\226]\226]"
"\226]\226]\266]\226]\226]\266e\226]\266]\266e\327m\221\024\020\014\266\225\035"
"\357~\357\276\367U\255\064\255\326\305\027\306y\326\231\326\332\336\333\346"
"\332\336\333\336<\357\034\347]\357\\\357<\357<\357\373\346\033\347\373\346"
"<\357\034\347\070\306i:\010\002\216#\323lrt\222t\320;N\013\014\023n#Rd\272\326\373"
"\326n\063V\235\033\337\064\215\061L\320#\061$\064M\023-RdX\316\371\336x\306V\235"
"\323D\323\064\363\064\322\064\322\064\323\064\323\064\322\064\322\064\322\064\322"
",\322,\322,\323\064\263,\263,\263\064\262\064\262\064\222\064\262,\262,\262\064"
"\262,\262,\222,\222,\262,\262,\262,\222,\221,\222,\221,\262,\262,\262,\322"
",\322,\322,\262,\262,\222\064\262,\262,q\014\360\013\266\225=\357~\357\276\367"
"U\265\064\255\326\305\030\316X\316\272\336\231\326\232\336\373\346\373\346"
"\034\347\034\347\034\347<\357\373\346\373\346\373\346\373\346\373\346<\357\373"
"\346\027\306\252B\212\022j\012\221\214\023\255\063\245\222lrD\257#\317\033\262"
"T\070\276\071\276n\023\364\204\034\337\263tqT\021,\062$\226}\030~\222l\271\326\270"
"\336W\316v\235\317\063\221T\020\004\262\004\322\004\322\004\262\004\262\014\262\004\262"
"\004\262\004\262\004\222\014\262\004\261\004\262\004\261\004\221\004\221\004T]\327\205\363D"
"q\004q\004\221\004p\004p\004q\004\221\004q\004q\004q\004q\004q\004q\004q\004\222\004q\004\221\004\221\004\222"
"\004\222\004\222\004\222\004\221\004\221\004\020\014\226\225<\347}\357\276\367U\265\064"
"\255\225\275\326\305\030\316y\326y\326\232\336\272\336\034\347\033\347<\357"
"<\357\034\347\034\347<\357\333\336\272\336\373\346]\357\\\357\326\305i\062\010"
"\012,\023qd\257;\323l\223T\217\003\360#\320#\025]\060<\257#\321#QD\257#QT\360c"
"\357#\021$\262T\021<\257\033rd\313B\216[\360Cq<\061l\317\023\323\004\222\014\262"
"\014\327}y\236\071\236U]\262\004\262\004\322\004\221\004ueY\236\071\246\266m\220\004\326"
"u\272\256\266m\221\004q\004q\004q\004q\004q\004\221\004q\004q\004q\004q\004q\004q\004\221\004\221\004\221"
"\004\221\004\221\004\221\004\221\004\221\004\221\004q\004Q$\017\014u\215<\347~\357\236\367"
"T\255\064\265\266\305\027\316\070\316\231\326\373\346\272\336\332\336\033\347"
"\373\346\373\346\373\346\333\336<\357\034\347\373\346\333\336\373\346\034\347"
"<\357u\265\357s\350\011\252\012\257;\216\063\020L\021\064\022$\223T\065u\263d\231"
"\276\373\316\061<\267\235\374\336\064\205\323\\\020,\021,\020DrLq,\262tIR\316"
"srTq\064\360\063\061\064P\014\023=<\307\236\357}\337\236\337\237\347\272\256\262"
"\034\262\064\273\276\237\347~\337}\337\277\347\374\306\266u\370\205\225]q\004"
"q\004q\004q\004q\004q\004q\004q\004q\004q\004q\004q\004q\004q\004q\004\222\004\222\004\222\004\221\004\222\004"
"\221\004\261\004\221\024\363\\\017$\263\\=\347]\367\236\357U\265u\265\367\305\027"
"\316\070\316\070\316\272\336\232\336\272\336\373\346\373\346\333\336<\357\034"
"\347\373\346\373\346\373\346\373\346\333\336\373\346<\357\266\275q\204I\032"
"(\012\021|\222\214\226\255\256C\061,\263\\\064u\263d\374\326\236\357\357\063\367"
"\245\236\367U\215rL\021,\062,\257\003\257\003Q,\221|\216\203\316{rTrD\222D\323"
"T\360#\333\306~\337\225m\222$\263\064\070\226\236\347\272\256\333\276~\337"
"\027\216\221,q$\227\205\236\337z\266q\014q\004q\004q\004q\004q\004q\004q\004q\004q\004q\004q\004"
"q\004q\004q\004\221\004q\004\221\004\261\004\261\004\262\004\262\004\262\004\262\004\221\004\221\004"
"Q\014\357\003\327\215~\357\275\367T\255U\265\326\305\367\305\027\306\231\326"
"\231\326\231\326y\326\232\336\231\326\232\336\373\346\333\346\333\336\333"
"\346\333\346\272\336\373\346\373\346\033\347\266\275\262\204i\032(\012\320c"
"\353J\257k\217;R$\363d\026\205\065e\024m\065u\263\\\323dU\215\363d\222D\020,\061"
"$\257\013\260\003\317\023\262|\014k\316kQTr<sT\060T\222T\276\347\027\206\222\024"
"\221$\221\034\221\004\030\226\236\357\236\357\326}\221\014\367\215\266\205\261"
"\004\071\236~\337\222,q\004\221\004q\004q\004q\004q\004q\004q\004q\004q\004q\004q\004q\004q\004q\004\222\004"
"\221\004\221\004\222\004\221\004\262\004\262\004\262\004\261\004\222\004q\004P\004\360\013\030\216"
"\236\367T\255\064\265\266\275\367\305\027\306\070\316y\326\070\316Y\326y\326"
"\272\336\231\326\272\336\333\336\272\336\232\336\373\346\373\346\333\336"
"\232\326\332\336\266\275\322\214\010\022m\063\357c\060t\322\224qT\061,\317#\061"
"$\217\033.\033M#\317;\257C\357;\257;\257#\020,\021$\262L\364T\222<\364|\354R"
"Q\204\024U\024U\060<\222T\364t\236\357Ue\266e~\277~\307\023E\221$}\337]\327\221"
"\034ve~\327~\327\024M\266}~\357\323\064q\004\221\004q\004q\004q\004q\004q\004\221\004q\004q\004"
"q\004q\004q\004q\004q\014\221\014P\004P\004\222\004\221\004\222\004\262\004\262\004\262\004q\004\020\004"
"\317\003\360\013\060\024Y\256\064\255T\265\326\305\027\316Y\326\070\316Y\326Y\326"
"\070\316\070\316X\316Y\326\232\336\070\316y\326\332\336\332\336Y\316\232\336"
"\272\336\272\336u\265\363\234I\032\212\012\313:\020\204q\214\256+R,\360\033\021"
"$rD\260SN[\360k\317k\360s\217c\354\"\021\064\324d\363t\262d\020L\063\215S\235"
"\064\235qd\360CPT\062\064QD\236\347Y\236\262\004q\004q\004\261\024\272\256~\347~\357"
"Y\236\221\004\225uUm\221\004\272\256^\337\221\024\221\004q\004\221\004q\004q\004q\004q\004q"
"\004q\004q\004q\004q\004\221\004q\014qT\063\235\264\235\063\205\222d\064U\064U\363D\322\004"
"\222\004\317\003-#-\063L#\317\013\226}U\265\024\255\266\275\070\316\070\316\030\316"
"\030\316Y\326\070\316\030\316\027\316y\326X\316\231\326\231\326y\326\231\326"
"Y\316y\326z\326z\336u\265\215k\307\001\253\022\312*\262\214\262\234\256+\061"
",\021,\021$\360KNcNcMcNcNc.c\217c\360;\030\246\065\205Y\246\226\225\331\336\267"
"\366\267\336\065\235\263TrD\061<R\064z\266\276\337\071\236\064UTm\333\276~\357"
"\067\216y\236~\357\272\266Te\064]z\256\236\337\070\226q\004q\004q\004q\004q\004Q\004q\004"
"q\004q\004\221\004q\004q\004q\004\222\004\020\024V\225\227\346\327\346w\326\322\224Y\246"
"\034\277\232\236\221\004\061\014\313\"\014S\317{\357s\257;Uu\064\255\024\255\266"
"\305\367\305\326\305\266\275\030\316\367\305\326\305\367\305\266\275\027\316"
"X\326\027\306X\316\070\316\272\336\232\326y\326y\326\070\316\064\255H:\307\001"
"\253\022\317S\360\203\263\234m+R,r\064\061$\323t\015c-c-c.c.cN[NcqD\263T\323"
"d\223L\320C\020d\356k\017tQT\263L\222T\060\\\021\034\322$\232\256\236\347\276"
"\347\237\357\236\327\367\205r\014\222\014\030\226~\337\276\347\236\357~\347"
"Y\236\221\014\221\004q\004p\004q\004q\004p\004p\004q\004q\004q\004q\004q\004\221\004\221\004\020$\061T\316"
"k\356cMKr\\\362<\322\064\262,\221\004\357\013\014C\064\255y\306\070\316\262|Tu\064"
"\255\323\244u\265u\275\327\305\266\305\226\275u\265\266\305\225\275\266\305"
"\367\305\027\316\070\316\030\316\070\316\030\316\070\316\027\316\367\305\070\316"
"T\265hB\307\001J\002\313\032mC\317Sq<\361#r\064Q<\064\215-c-c-c.k.c\015c-[RL\365"
"d\262T\020<rTU\215t\245t\225V\205\061<\061<\323d\363\064\262\014\262\014\023=\226"
"u\226e\222$\262\014\261\004\221\004p\014q,um\225m\262\064q\004p\014q\004p\004p\004P\004q\004"
"q\004q\004\221\004q\004Q\014q\004\221\004\221\004q\014\360\023\061,U\225IBR\204\357+\061\024"
"Q\004\221\014\261\004\360\013rt\273\326=\347=\357U\225\064uT\265Q\224\064\255\323"
"\244\363\254T\265\363\244\064\255\064\265u\275T\265T\265\226\275\327\275\367"
"\305\030\316\366\305\070\316\027\316\327\305u\265\322\244\013S\014\063\216K\061"
"t\324\214\024\205\257\063\061\064\222L\065e\024\225Nc-c-c.c.c.cM[QT\233\266Y\266"
"\232\256u\225\031\347\070\357\331\346u\235\357K\221dr<P$\322T\030\226U}z\256"
"U}\231\256\064}u\205\266\215\226\215z\256\266\215\024}V\205X\246\065}\020,\020"
"$\357#\357#\020$\020$\020$\020$\360#R<\360\033\360\013\060\014\060\014\217\023\061<\263"
"\214+c\060t\360;\061<\021<\257\023Q\004\061\014M#Y\276]\347\232\306\017<UmT\265\017"
"\214\060\224p\234\017\214q\234P\224P\224p\224\321\234p\224\322\244\023\255\363"
"\244\064\255\065\265\225\275T\265\063\255\023\255\322\244\356\213\312:\253\022"
"L#U\225M[U\245\317K\317\033\364L\323T\262tNcNk-cMkMk.cMcr\\\364d\364d\364"
"\\\323d\023}\362|\322\204\323l\223D\222D\263D\323\\\030\256\033\317\030\256\333"
"\316\071\266\267\245\232\276\031\266Y\266qt\370\255\070\266\232\306\232\306"
"\225\225Y\266\222TrTrT\222TrT\222LqD\360\063\020\064\257+\257+\061\064Q<Q<\062"
"<\060D\323\214+c\020|\061D\061<\317;\317#\257\013P\004\020\014\256\013\360\063\223D"
"\221\064\025u\367\305\367\305\367\305\367\305\367\305\327\305\327\305\367\305"
"\367\305\327\315\027\276\267\265\266\265\266\275\326\305\326\305\326\305\327"
"\275\367\265\327\265\326\265\323\234\014Kj\012\353\012\061\\\223T\364\\\364T"
"\223<r<\263L\323t-c.c.c.c.c-cM[\061LQ<Q<\323T\263L\263Tq\\qT\263L\262L\222"
"LqDsTZ\256Y\256y\256X\256\027\236\373\276\266\225\232\266Y\256\027\236\373"
"\306Y\246v\235\327\255\273\306\267\215\222TrTrT\222TrL\222L\360\063\217\033"
"\360\063Q<\360\063\020\064\020<\020\064\061\064\020<\323\214\307\071\020|\317+\317;\060"
"\\\015\013\020\064\360;Uu\363d\364l\266m\316\013\025u\377\377\277\367\236\367<"
"\347\272\326\232\326y\316\071\306\030\276\267\275pdi\002\306\001\216khR\220\234"
"\315{\247\001f\001\206\001\206\001\306\001\347\001\212\012m\023\357C\020<\061<r<r<\020,\262"
"D\222LnS\317k\020tL[,[,SmK\323T\263T\223DQ\064\061D\363|\022\235\262\214\060T"
"\221\\\221D\323D\060<\017<\317#\216\023\256\023\256\013\256\023\357\033\317\023\257"
"\023\216\023\215\003\256\013/\014\017,/\034\060\034P\024P\024P\024P\024P\024P\024P\024\256"
"\023\361;\323<P\034Q,R\064\317#\020D\060\064r\\\357K\256C\221$\060\034\217\033\025"
"U\316\033\215\033rdQdql\262\\\356\013\025m\377\377\337\377\337\377~\367\034\347"
"\373\336\333\336y\316\070\306\327\305Pd\211\012H\002P\204\221\224\326\305\020"
"|\307\001\347\001\347\001\007\002\350\001(\002-#\013\013\216K\317CQ\064q,\020,\262$q\014\222"
"\004\317#\316+\317\063\060L\060T\060T\061TQLQ<Q\064Q$rD\367\245o\214P\214\322d\322"
"\\\363$\360\023\317K\061d\021<\061LrLrTQLQLrLQLQLqD\021Dn+\256S/\064\060\004\060\004"
"P\004P\004P\004P\004\060\004P\004Q\034\363\064p\004q\004P\004\060\004\256\003\360S\256;\061<\020<r<Q"
"\034q\014\216\023q,j*\013S\313J\314J\021|Mc\216\063\024m\377\377\377\377\337\377"
"\276\367]\357<\347\034\347\272\326Y\316\367\275Pl\252\002H\002(\012\060|\017t\010"
"\032\347\001\347\001\010\002(\002\010\002i\012\313\022\317[\221\214\222\214Q\\UE\363T\261"
"Tq\\\357;\060T\216\063\223d\223dQT\263l\364t\222T\360#\361#\061D\020\064\264\204"
"O|q|\020D\021\034\360\023QL\231\276\273\306\273\306\333\306\334\326\374\316\333"
"\326\333\316\374\316\374\316\070\246\065u\364l\324l\323d\063]UUT]\061\014\060\004"
"\060\004P\004\060\004P\004P\004P\004P\004Q\004P\004P\004\060\014\360+\262DP\034\360C\225\215\065\215"
"\257+\217#\020$\206!\252R\014c)B\354Z\020\204i\032\024u\377\377\377\377\377\377"
"\337\377\276\367}\357<\347\373\336y\316\030\306ql\353\012\252\022\215S\020t\357"
"s\256c,K\353\032\353\012,\033,\033\013\023\014\023\323\214\063\245\022\245\323|\263"
"\024\266\235\071\306\232\326\060|\030\276\222\214\363\214V\255\323\204\027\306"
"\231\326\060|\060<\357\033\317KpT\367\255\061\245T\255\360[\222d\357+\320C^\357"
"~\347\374\336\374\326\233\316=\327=\347Z\306\375\336~\347\330\255\060T\226"
"\215qT\222d\364t\357\023\064MP\014\355#\017\024\060\004P\004\060\004P\004P\004P\004P\004\060\004"
"\060\004P\004\060\004\060\004P\004\061d\272\326\027\306\261\\Q$\017\024\206!E)\307\071jJ\212"
"R$!\212\"\364t\377\377\377\377\377\377\377\377\337\377\276\367}\357\034\347"
"\232\326\071\306\262lM\033\353\032\366\275\026\316R\275\024\316Ns++,C,\003,\003m\013"
"\217+\317;q<\263D\024=\023\015\064u\221d\216S\060d\363t\222l\262d\222l\060T\317"
"[\060L\364t\360+\317#O\013n\033\065\215\223d\020<\256#r\\\220#-\023\237\357^\347"
"Y\276\367\245\226\225u\225\273\276z\256\070\236^\347Y\236\023m\071\256\327\225"
"Q\\y\266\216\033\262\\P\014\017D\060,\060\004P\004\060\004P\004P\004P\004\060\004\060\004P\004\060\004"
"\060\004\060\004P\004\360S\024\245U\255\317Kn#Q$\247\031e\061\307\071\253R\010B\205)\252"
"*\024m\377\377\377\377\377\377\377\377\377\377\337\377\276\367]\357\333\336"
"\232\326\363t\216\033m+\226\326V\377\067\377x\377\251Z\316\033\020\064\353*\256"
"C\023m\357+\257\033\322\024\363\004\023\005\023%\070\256\231\316\231\326\271\316\231"
"\326\231\306X\306\231\306y\316y\316\070\266\323d\316\033\222\\Y\256\023u<\337"
"\024\225X\266\071\256n#-\003M\033\277\347^\347\266\225\071\266\031\266V\245\374"
"\316\327\225z\256^\347\070\236\363T\070\226\267\205\364ty\256N#\222d\360\023"
"\017\014\060\004P\004\060\004\060\004P\004\060\004\060\004\060\004\060\004\060\004\060\004\060\004\060\004P\004QD"
"r\204\222\214\017$\216\013\017$F!\350A,cJJ-c\317{i\"\364t\377\377\377\377\377"
"\377\377\377\377\377\377\377\276\367}\357\034\347\333\336\064}\316\023\357\023"
"\214k\356\213\213s\254\203lK\357\033l\033jJ\357{\266\245\357+\317\033\323\024"
"\363\014\064\005\366\245\231\326\034\357\373\346\333\346\332\346\332\336\373\346"
"\373\346\373\346\332\336X\326U\255Pd\262t\327\225\221l\035\347\363\244\\\357"
"\060lPD\263LQL~\357^\347\236\357\237\357~\347\236\357\236\347\236\347~\347"
"~\347\071\236q,q,q\064\257;\360C\020D\263d\216+\216\033\216\023/\014\060\004\060\004"
"P\004\060\004P\004\060\004/\004\060\004\060\004\060\004\060\004\060\004\215\023\011B\010:\216\033\216\023"
"\017$\207)e)\010BjRJJIJ\212*\364t\377\377\377\377\377\377\377\377\377\377\377"
"\377\337\377\236\367]\357<\347u\205\020\024q\024o\204\315\203\021\255N\224\013"
"#\323l\266\255*J\354J\263\\\360\063\222\034\362\004\064\005\023%\363\244\034\347\272"
"\336\272\336\231\326\272\336\272\336\272\336\272\336\332\336\232\336\271"
"\316\030\306\317s\017\064-\023\363l\070\266\317k\030\266v\225\216#.\003-\003sl\363"
"|\263|\024u\324l\064e\064e\064e\064]\064e\363T\024E\024M\323L\023]qT\262\\\060LM\033"
"\360C\320;\216\063\256\033\060\014\060\004P\004\060\004\060\004/\004/\004/\004\060\004\060\004P\014\020"
"\\u\265u\255m+\216\023\060\034E\031e)\246\061jJIB$!\252\"\364l\377\377\377\377"
"\377\377\377\377\377\377\377\377\337\377\276\367\235\357}\357\266\205q\034"
"\221\024\315kO\234\355\213\016\214\016\\\222D\364\204\212Bmk\064\215\323L\061"
"$\023\015\064\005\024=\362\244\373\336\272\336\332\336\272\336\332\336\332\336"
"\332\336\272\336\332\336\333\336\272\336Y\316\253R\323\\u}\024m\065u\064\205"
"rdqT\061\064n\023\015\003n+\020TQT\357#\360#\222\024\222\004\222\014q\014\060\024\020d\357"
"kQl\020l\316\023\061\024\217\033\257#\257\063\020LM#mC\216;\357\013\060\004\060\004\060"
"\004\060\004\020\004\020\004\060\004\060\004\060\004P\014\021d\364\234\323\214\216\063\216\033P\034"
"\206!)JiJjJMk\014c\252*\364t\377\377\377\377\377\377\377\377\377\377\377\377"
"\337\377\337\377\236\367\236\367\327\205\222\034q\034\067\306;\357[\357\\\357"
"t\235\222\064\261\024\253\032\060dv\205Q\064r\064Q<\022%\023\025\225\245\070\316y\326"
"y\326\232\336\272\336\332\336\332\346\373\346\332\336\332\336\232\336\023"
"\245mcrL\327\235QL\363|Mk\263\214\216\023N\003\017,\317+\360S-\023\317\033\360"
"+\020\024q\004\221\004\221\004\221\004P\064\363\244\221\234P\224\017\214\255+P\004\060\034"
"\216\033\256#\317K\354\032m\063\317C\060,\017\014\357\003\356\003\316\003\316\003\316\003"
"\017\014\060\024\357\003\356\003\216\023\017\\M\063Q,\216\013\020\034f!e)\313Z)BIB\313"
"Z\253\062\364l\377\377\377\377\377\377\377\377\377\377\377\377\377\377\337"
"\377\276\367\236\367\370\215\222\034\221$\026\276\271\326\265\265\271\326Q"
"\214\322\064QD\362\004\362\014\323\014R\024Q$\263T\063\065T\005\322D\226\255\033\347"
"\373\346\373\336\332\336\372\336\033\347\272\336\231\336y\326\224\265\316"
"k\215;\263L\071\246\262<\024\225\262\224\222\214QT\021DQ<M\023\262\\\354\012\317"
"\033\360+\357\023q\004\221\004\221\004q\004P,\015ciJ(B\212Zl\033P\004\060\014\020\024\216\033"
"\020,QD\061L\061L\327\225\071\256y\256X\246\031\246Y\246\071\256\327\215\222l\327"
"\215\267\215\060D\060T\257;\060$n\013\020\034e\031\303\020E!iB\347\061\206\031\353"
"\032\024m\377\377\377\377\377\377\377\377\377\377\377\377\377\377\337\377\276"
"\367\276\367\370\215\262\034\262$u\215\226\245\225\225\266\235\065}\023%TM\363"
"\014\023\015\024\005q\004Q$\262\034\063\005\064\005\023\005p\024\256+L\063,C\215S\256c\317k\020"
"t\061t\222|\316c\253\062\020<r,Ue\024M\363\214/|\222\214\060L-\003\357\033.\013\317"
"#-\023\320#\317+\357\023\221\014q\004\221\004\221\004q\014\061d\014CmC\222t/\014P\004qT"
"\357C\216K\257S\354\032rL\222L\323d\024uTu\363l\065u\064u\323l\323d\323\\\023"
"m\364lqD\060DQDQ<\222<\357\023(\012\307\021\247\011\347\001\007\002i\002L\003\364l\377\377"
"\377\377\377\377\377\377\377\377\377\377\377\377\337\377\337\377\276\367"
"\030\216\262\034\323\024\322\014\322\034\362\024\323\034\323\024\364\004\023\005\363\004"
"\023\005\024\005Q\014R,Q$\363\034\024\015\064\005\023\015\222\024\320+\317#\360C\256K\256"
"K\216K\317K\317C\320CrLr<\263<\324L\324Lt\205\353Z\364\224\360CN\003\061,-\003"
"\360#M\013\317#\257#\257#Q\034\221\004\221\004q\004\020\024\263\204U\245\263\214V\245"
"\256\033P\024\221|\326\275T\255\222tq,\317\023m\023M\033M\023m\023M\023M\023L\023M"
"\013M\023m\013m\023n\023n\023n\023\216\023\216\023\216\023M\013\021D\216+\216\023m\003m"
"\003\316\003\357\003\364l\377\377\377\377\377\377\377\377\377\377\377\377\377\377"
"\337\377\337\377\337\367\030\216\262\034\322\034\222<\363\004\023\005\363\004\063\005"
"\023\005\023\005\363\004\221,\363\034\061\014\257\033RLQ\064\363\024\023\005\363\024q$Q\064"
"Q\064\257Cr\\rd\363\\\064UuM\024U\222dQ,r\064\317#\060\064\261\\\360;\020L\222L"
"\263Dn#QDn\033-\023\257#\354\012\320\063\317\063r,\221\034\221\014\060\034\221\\Q"
"\\qdqd\256\033\221\014\262T\256\063\256;\320KP\024\357+\222L\323D\262Dr\\\222"
"D\262D\262D\262D\222D\262<\222D\222D\262D\262<\262<\323<\263<\060,\317+\017"
"$\357\003\017\004\357\003\060\004\017\004\364l\377\377\377\377\377\377\377\377\377\377"
"\377\377\377\377\337\377\337\377\277\367\030\216\262\034\362,\322\\\322\014"
"\363\004\322\004\323\014\363\004\322\004\262\004\221L\322,Q\014-\003\360S\020L\322\024\023"
"\015\021\034r\064qd\364\234,[\014[,c,[\322\214Qdq<\363\\\363$\360\033r<rL\322\\"
"\061\034\021D\313\062\313\062-;-C\354:-CnC-C\015C\257K-K\015C\317KNCnC\016CnC-C-"
"Cn;M;\216;M;\014;-;\015Cm;\253:-K\253R\252\062\313\062m;\014;\313:mC,;j\062\014"
"\063m;\313:\014Cm;\354\062\253:\014\063\357\023\060\004\060\004q\004P\004\065m\377\377\377"
"\377\377\377\377\377\377\377\377\377\377\377\337\377\337\377\337\367\030\216"
"\221\024\363\024\363\014\362\004\362\014\060<\261,\216;mCL;mK\216C\222t\020T\262"
"t\256\033Q$q\034\061$\222<\266\245\064\245\353R\313R\313Z\313Z\363\244u\235\064"
"]\323T\224\\\263T\323L\223T\261LR<\253*mk\256s%!Mk\020\204\206\061iJ\357{\313"
"Z\206\061\316{\256s\303\020\014c\357{\347\071iJ\317{\014c\004!mk\256s\344\030\253"
"R\316{HJ\306\071\357{,k\303\030Mk\256{$)\313Z\256s\253Z\246\071\317{mk\303\030"
"ms\357{\246\061\212R\357\203(J\215\023P\004q\004\221\004q\014Um\377\377\377\377\377"
"\377\377\377\377\377\377\377\377\377\337\377\337\377\337\367\030\216\262\034"
"\363\024\323\004\363\004\262$\364Tp,)B\307A\010:)J\266\265T\255\332\336z\306\322"
"D\364L\363<\357\033\061$u\205\323\234\252Z\253R\212R\313Z\023\235\064\225\264"
"<r\064R<Q<\262d\260#\025=\222<\354BQ\214\262\224\354Z\262\234\024\245-c\020\204"
"\024\245\021\214ns\024\245\263\234-k\222\224\064\245\216s\360\203\064\245R\214"
"\355b\323\234\263\234\014c\061\214\363\234\217sns\364\244Q\214\253R\222\224"
"\323\234\354Z\317{\364\234\360{\354b\024\245\222\224\212Rr\224\363\234\014"
"cnk\262\224)B,\023\060\004\221\004\262\004\221\014Uu\377\377\377\377\377\377\377\377"
"\377\377\377\377\377\377\337\377\337\377\337\377\030\216\262\034\023\025\362"
"\004\327}\033\327\373\316\034\317\350IHJIJjJi:qt\222|\024\205q<\323D\060$\364\064"
"\320\023\323d\023\205\253BjJjB\212B\364|\323t\222D\360+\322DQ<\322d\360\033"
"\363\024q\024\355:\350\071)B\011B\011:\011B\351\071\350\071\350\071\350\071\011:\011"
"B\350\071\350\071)B*B*B*B)B\351\071\351\071\310\071\350\071\350\071\011B\350\071\350"
"\071\310\071\310\061\310\061\310\061\310\061\310\061\310\061\310\071\310\071\351\071"
"\011B\011:\011:\011B)BJJ)B*BkJ)B\353\022\020\004\221\004\262\004q\014uu\377\377\377\377"
"\377\377\377\377\377\377\377\377\377\377\337\377\337\377\337\377\030\216\262"
"\034\322\024\262\014\367\205\030\306\272\326\236\367)J)JiJIR\252B\064\205\364"
"\204\222t\222\034\363\004\363\034Q\034\263$q\024\061\014\222\014q\014q\014Q\014\262\024"
"\020<qd\021\034\363$R$\262,\061\034\362\004r\014\253\062F)\207\061\247\061\247\061\207"
"\061F)E)\206\061\307\071\011B\310\071F)F)\247\061\011B)B\011B\011:\350\071IJjJ\212"
"R\213R\213R\253R\253R\213R\350\071\351\071\310\071\350\071\310\071\310\071)BJB"
"jJ\213RjJ\011:\011:IBIBJB\011:Nk):\313\022\357\003\261\004\222$q,vu\377\377\377\377"
"\377\377\377\377\377\377\377\377\377\377\337\377\337\377\337\367\030\216\222"
"\034\322<qT\266\205\326\275\272\326\235\367IB)J)JIJ\363\234\362\224\333\336"
"\267\255p\034\363\024p<R,\223\024q\024\020\014\363\014\322\014\363\014\262\014\322"
"\014\221$\222L\323,\323\024P\014r,\017\024\322\004Q\024\354:\005!E)F)F)E)%)%)\247\061"
"\310\071\247\061\350\071\247\071F)\207\061\350\071\011B)B\011B\350\071)B\212RjRjJ"
"jJjJjJjJ\011BJB)B)B*B\351\071\213R\253R\247\061\307\071\212JjJ\011:*B*BJB)B)B"
"):\313\022\357\003\221\004\222<\221DUu\377\377\377\377\377\377\377\377\377\377"
"\377\377\377\377\337\377\337\377\337\367\030\216\221\024\322\024\024E\226}\327"
"\275\232\326~\367\010J)JJRIJ\014[ql\360sT\205\221\034\363\024\023U\221$\323\034"
"Q\034\060\024\024eu\215\020,\061T\360[\317K\316S\023}\024urL\024}\317+\261\004\060\024"
"\253\062\344\040\344\030\004!%)\004!\004!\004)\247\061\303\030\243\030\303\030\350\071f)"
"\247\061\350\071)B\213R\253RJJ\313Z\354Z\314Z\313Z\354Z\354Z\313Z\354Z\314"
"Z\213R\313ZjJjJ\011:jJ\004!\243\020\243\020f\061jJ)BJBJJJB\011:\310\071\010:\313\022"
"\317\003\221\004\262\004\221\004vu\377\377\377\377\377\377\377\377\377\377\377\377"
"\377\377\337\377\337\377\337\367\027\216\262\034\323\014\322\014\266}y\316x\316"
"\272\306\307IHJjR)B\350)\262l\323t\363d\323\024\363\004\023\015\222\024\323\034"
"q$\360\023QdT\245\357\063\364|\014[\253R\213R\060t\262l\317C\265\265\015\023\262"
"\004\061\024\253:\344\040\343\030\004!E)\004!\303\040\004!\206\061\344\040\303\030\303\030"
"\350\071\206\061\247\061\350\071*BjJ\212JJJ\253R\253R\253Z\253R\253R\253R\212"
"R\313Z\253R\212R\253RJJJJ\011:\011B\243\020\243\030\242\020\005!\213R\011BJBjJ*B"
"\351\071\207\061JJ\313\022\317\003q\004\322\004\222\014vu\377\377\377\377\377\377\377"
"\377\377\377\377\377\377\377\337\377\337\377\337\367\027\216\221\034\262\014"
"\322\004\323\064v]\064e\322L\011B)B)RIJ\023\235\363\234\272\326\232\316\222$\362"
"\004\024\005q\014\263$P\024R,\017\\\224\265\216+\323\204\256s\313b\253J\221<\323"
"<\020\064\026\306n#\261\004\061\024\314:\005!\004!%)F\061\004!\344\040%)\206\061E)\303\030"
"\350\071\010Bf\061\350\071JJjJ\253R\014c\212R\212J\314Z\354Z\014c\213R-k\014c\014"
"c\014c\014c\354b\314ZjJ)B\310\071\247\061\243\020%)JJkJ\011BJBJJjJ\011:\247\061J"
"B\313\032\316\003\221\004\262\004\262\014Uu\377\377\377\377\377\377\377\377\377\377"
"\377\377\377\377\337\377\337\377\336\367\367\215r\034\322\014\322\004\263\014"
"\322\014PL\262\064g!\206)E)e)\212:\256[Qlv\225\221\034\323\004\023\005r\014\263\034"
"\216\003\060$\263|\363\224\322D\227\235\317s\354b\353Zu\245Qd\363\\\323\234"
"\222L\016<\020,\015C%)\004!\004!F)%)\344\040E)f\061\307\071\253RJJ\310\071\207\061\350"
"\071JJJJjR\253R\213RjJjJ\213R\253RjJ\313Z\353b,c\014c\353b\354bIJ\011B\310\071"
"\247\061)BjJ\253R\213RjJ\350\071\011B*B)B\011:\350\071):\312\032\256\003p\004\262\004"
"\221\014vu\377\377\377\377\377\377\377\377\377\377\377\377\377\377\337\377"
"\337\367\277\377\367\225\263,\023=\262L\362\024\363\014\362\014\363\014P\014/\014"
"/\014\317C\221,\020\034q\034\261\024\322\004\362\004\023\005r\014\262\034o\013N\003\014\033"
"m;q,\020<\357\063I\032\353\"\221<\262<r\064pT\222\064\023U\020\034NCE)%!\004!%!%)E"
")\206\061\206\061\207\061\310\071\310\071\207\061\206\061\247\061\310\071\310\071\247"
"\061\247\061\310\061\310\061\310\071\310\071\310\071\310\071\213R\212R\212RjJ\212"
"R\010B\207\061\206\061f)\206)\206\061\247\061\310\071\310\071\310\071\247\061\310"
"\071\350\071\350\071\350\071\350\071):\312\032\256\003p\004\262\004\221\014uu\377\377"
"\377\377\377\377\377\377\377\377\377\377}\357\030\306\327\275\367\275\323"
"|\357K\262d\323\204\023U\064]\064U\025U\064E\024M\024M\363l\023UQ<\360;q,\262\014"
"\322\004\023\015\222\014\263$-\003\015\013\323|\370\265\061Tq,q\014\222\004\323\004\262"
"\004\261,\222tY\276\361c\222,\060\024\015C\313Z\313Z\350A\014c-c\350A\253R-k\212"
"R\010B-c\014c\350\071\313Z-k\010B)J-k\252R\307\071\014c\014c\206\061\212R\354Z\010"
"B\307\071\354Z\212Rf\061\313Z\354Z\206\061)B\354ZJJ\350\071\313Z\252R\350\071"
"\212R\313Z)BIJ\253RIB\353\032\256\003q\004\262\004\221\014vu\377\377\377\377\377"
"\377\377\377\377\377\377\377\333\336\354Z\314b-c-c\347\071,[mk\317{\360\203"
"\360{\256s\215c\014c\353R,[N[j:q\\\262T\322\024\363\004\023\005\222\014r\064-Cn[\024"
"\235\327\275\257kMC\017$\261$\262$\357;\014K\222\224\226\265\357{\014K\215C"
"j\062Q\214\323\234\303\030\024\245\226\265\307\071\317{v\255\020\204\010B\226\265"
"\024\245\243\020\263\224\226\265\212R\256sv\265q\214e)U\255U\255\344\030q\214"
"\226\265Mk\354Zv\255\263\224\344\030\065\245\226\265\307\071\060\204\226\265"
"\020\204(B\226\265\024\245\243\020\024\245\267\265\313Z\256su\255%!\312\022\317"
"\003q\004\262\004q\014vu\377\377\377\377\377\377\377\377\377\377\377\377\272\326"
"\354b\015c\314Z-cE)E)e)e)\205)\206\061\206\061\206)E)%)E!E)\206\061\347\071F!"
"m\013\323\014\023\005\262\024nK\364\234<\347\337\377\337\377\276\367U\245\212:"
"\060d\020d\317{\033\337\235\367\337\377\337\377z\316\354Z\015[\353Z\353Z\313"
"R\313Z\313R\313R\014[\354Z\313R\253R\313R\253R\313R\353R\253R\253R\253R\253"
"JjJ\253R\313Z\253R\253R\253R\313R\212J\213RjJ\252R\313R\313R\252RjJ\212J"
"\212JiJIBiJjJJBjJIBIBiJiJ\252J,\033\317\003q\004q\034q\024vu\377\377\377\377\377"
"\377\377\377\377\377\377\377\232\326\354b-c-c-cf\061\247\061\206\061f\061E)E"
")E)E)E)E)%)E)E)e)\344\040\211\"\221\014\064\005\262\034\222\214\236\377\067\306"
"\276\367\337\377}\357\232\326\263\224,;\216[]\347\273\326\034\347\337\377"
"\276\367\232\326\330\275\247\061e\021\242\010E!%\031E\021D\001e\001e\001e\001e\001e\001E\011"
"E\011D\011$\001e\001$\001d\001\255k\312Z\212ZIJD\001e\001E\001e\001d\001\003\001\004\001E\001D\001\004\011E"
"\001E\001\004\011\004\001d\001\004\001$\011e\001D\001\004\011D\001E\001\004\001\206\011,\003\317\003\220\004qD\222"
"D\226u\377\377\377\377\377\377\377\377\377\377\377\377Y\316\015c-cNk\015c\061"
"\204R\214\260{-c\015c\014c\014c\014c\313Z\253Z\253Z\213R\212RIBHB\364\234\257"
";\023\025\364$z\316\276\367\231\326<\357\236\357]\357\273\336\232\326\014KV"
"\245\337\377\033\337<\347\034\347}\357\333\336\374\336\354Z\252\032\010\032\347"
"\031I\032\007\022i\012i\012\007\012\007\022\007\012\007\012\347\021\010\032\007\032\247\031\206\031"
"%\011\007\032I:\212B\211:\353J(\022H\012i\002i\002H\002\206\031\206\021\010\022\307\021\206"
"\021\010\022\347\021\206\021\246\021(\022\206\021\246\021\007\012\306\021e\021\347\021\347"
"\021\206\021\010\022M\003m\003\256\013\020\034\221\024\226u\377\377\377\377\377\377\377"
"\377\377\377\377\377\030\306\015c.c\015c\014c\031\306\031\306\330\275\066\245\065"
"\245V\255V\255w\265V\255V\255v\265\062\214\025\245\263\224Lc\060\214\071\276"
"Q\034\363\034]\337\337\377\332\336<\347]\357<\357\373\346\333\336M[\030\306"
"\276\367\\\347]\357]\357\\\357\272\326\034\337\361{\215\033\216;m;\212\022\257"
"K\313\"\216+UuUuum\024u\064\205\023}\262|\323\204\226\235\030\256\367\235\370"
"\255Y\246\327\225z\266v\225\330\245\353\"\354\062\263l\370\255\071\256\070\236"
"\030\236z\276\273\276\266\225Y\266z\276\232\276\330\255\071\256\370\235\024"
"u\364\204\064u\064m\364|\065u-#-;nS\256;\020\024\266u\377\377\377\377\377\377"
"\377\377\377\377\377\377\327\275Nk-c\015c\354Zr\214s\214\062\204\021\204\062"
"\204R\214\263\224\324\234\364\234\364\234\065\245\223\224\365\234\263\224"
"\017\204\357{\071\306\360\063\262,\034\337\276\377\332\326\\\357Y\316<\357\374"
"\346\273\326MS\327\265\337\367\034\347]\357\373\336\373\336\373\336\232\316"
"\256kl\023uu\323l\317\063\263t\065}\256+\060\034p\014Q\014\216#\267\245\030\276\363"
"\234\327\275\070\266\070\256\070\256y\266u\205\327\225\232\276U\215\272\256"
"\060L\317S\024}\266\235\327\235\327\225\226\225\070\266\334\306\266\225\071\266"
"z\306]\327Y\266\266\225\370\225\256\023M\033/\024\020\024n\033n\033\014;Q\214T\245"
"\024\245PT\326\205\377\377\377\377\377\377\377\377\377\377\377\377\266\265"
"-k.c\015c\253Z\354Z\015c\354Z\314Z\314Z\253R\314Z\314Z\314Z\213R\213R\014[N"
"kLk\315\203r\224Z\306\324L\060\064\025\245\231\316Y\316\030\306\030\306\327\275"
"\226\255\222\214\350!r\214\071\276\030\306\370\275\327\265\226\255u\245\262"
"\214\347)M\023\267\205\027~\360\033\064m\070\246q<\317+\262D\221\014\360\033\363"
"|\061|\216kQ\204\364\204\327\225\367\215\326}\266\205\266\205\226\205u\205"
"\226\205\357\063\020L\323T\226\215u\205\267\205\267\205u\215\226\215\266}\226"
"\215\226\205\266\205u\205v\215\225m\017\014o#P\024Q\024\257#\216#qt\232\316<"
"\347\034\337v\235\326}\377\377\377\377\377\377\377\377\377\377\377\377\226"
"\265-c\015c\015c\314Zr\214\223\214\062\204\361{\360{\320s\260s\320{nknknk\014"
"c\355b\216s\017\214\065\235\256K\061\034\262\064Nc\064\235\364\234\363\224\263"
"\224\263\214\222\224\253R(*\252B\323\234\323\224\323\224\263\224r\214R\204"
"IB\205!\215+\327\205\030~\222\024\363d\030\236\020,Q<\070\236\023E\221\024\060\034"
"\216\023\222\064\262L\023M\363D\322D\323D\362<q$Vu\324l\221\014r\024\322$\221"
"\014\064mZ\266Ue\060$\065}\370}P\014v\215\327\215\322\064\364t\030\236veq\064\071"
"\256y\226P\034\064u\071\246\024\205>\357~\367~\367\023u\327\205\377\377\377\377"
"\377\377\377\377\377\377\377\377\024\245\015c\355b\015c\313Z\061\204\263\224"
"r\204\223\214s\214s\214\324\224\025\235\223\214\264\224\025\235\320sok\360"
"{\211J\313*\017\014R\014q$\015K\354ZU\245\267\275\226\255\262\204\313R\350\061"
"i*\313:)B\222\214\266\255\370\275q\204I:%\031H*\020T\225}\327u\262\014\262\\"
"\226}\262,\317\033\030\216\064e\262\024\323l\024u\266\205\337\347]\347}\337\\"
"\327}\337\277\357\363DUm\065u\262\034\222\004\262\004\221\014\322\\\370\255uer,"
"\025}vu\220\004\222d\023m\262\064\363\\\020TUe\060\014\323t\064m\262\034\226\205\363"
"l\060\064u\205Y\266\363t\322<\071\216\377\377\377\377\377\377\377\377\377\377"
"\377\377\323\234\354b\015c\015c\313Z\350\071JJJJJJJJJJ\212R\253Z\314Z\314Z\014"
"c\015c\314ZJJ\343\020,\003\020\014\263\004\222\024\257#\214\013\353\"\323\204v\245"
"\010\022\307\011(\002M\003\215\013i\012\252\022\256c\030\276\313:\007\002H\002L\013\020\014\267"
"u\367u\222\024\323ly\246\363$\020\034v}\065]\262\034\226\205\323l\326\215\236"
"\357\373\306\333\306Y\266=\327\277\347\363D\025u\263T\321\014\262\014\322\004"
"\322\004\024e\272\266ueQ\034y\246Y\236\221\024\267\225\272\256\262$\364t\272\276"
"\226eq,Y\256Y\236\221\024\327\225\273\266\363,R\024r$\064E\262,\232\256\377"
"\377\377\377\377\377\377\377\377\377\377\377r\224\253Z\314Z\314ZjR\212R\314"
"Z\353Z\354Z\354b\354Z\354b\354Z\354b\314b\313Z\253Z\212RjJ\307\021M\013N\023"
"\317#Q\034\223\064q\034\020\024M+L+\252\022\212\032L\033\357\033\017\024m+\256++\033"
"\256\023K\013,\013\215\033\060\024\221\004\225]\226]\262\034\363\\\330\225\362$\020"
"\034\024]\024U\322\034UuR\\\367\205\236\357\237\357\276\357\276\357\236\357\276"
"\347\023=Um\263T\322\034\362\004\363\004\362\004\060,U}\266]P\014\323d\027~q\024\060D"
"\367\215\322$\020,U\205\265U\060\034\323l\027~\322\024QL\367\215\023\035\261\004\222"
"\014q\014\262<\034\317\377\377\377\377\377\377\377\377\377\377\377\377\034\347"
"\232\326\071\316\266\255-S,CH*\251R,k\211JHRj:\253J\323\234U\255\364\244\360"
"\203\216s\212\062i\002\353\"\317c\020|q|\020\064\262$r\034\262Dz\316\020\204\212"
"R\354RMS\014K\360{\373\326\267\265\017\004\316#\014\063\314:\216;\060\064QT\364l"
"\020D\317;\223l\222L\216\063\262\\r\\\263TPL\061L\266\215=\337\035\337=\337\035"
"\337=\337=\337\323\\\061LQL\262LQ,\060$Q,\357\063\320K\263TQD\360CrT\222L\360"
"C\020T\262L\360;\060L\262T\061L\320C\222\\\262L\320CQT\263TQD\061\024\221\064\030"
"\256=\347\377\377\377\377\377\377\377\377\377\377\377\377\337\377\276\367"
"]\367\232\326\017Tql\007\002\350Jo\224\355{gJh\012mK\332\326X\306\070\316\226\275"
"\262\234LC\252\002\060lT\255\370\305\071\306\024\205\322\024\263\034\262TY\306u"
"\265IJIJIJ\212R\212ZP\214\323\234\221\004\256;\313J-c\253RJB\015c\314RjB\014"
"[\015c\212B\313J,[\313R\212B\014[\015[JB\313Z\014[\253R\253R\015[\314RkJ\313R"
"\014[JBI:\212B\212B\212B\354R\313J\212J\253R\253JI:JJ\253R\252B)B\213JiBj"
"B\213R\253J\212B):\212B*BjBP\064\327\245\333\336\236\367\377\377\377\377\377"
"\377\377\377\377\377\377\377\337\377\276\367}\357\373\326\222trd\210\002\310"
"*\010S\351Z\311:\013\013,+\327\265\030\306\370\275\030\276\063\225\014#M\013\323"
"\214\272\326\034\347<\347\367\235\323\014\064\015q<}\347\030\306(B\211RjRiR\353"
"bt\255\326\255\322\014\360;\243\030\000\010%!\005!A\000\203\030E)a\010\202\020%)\344"
"\040\040\010\344\030%)A\010\201\010\206\061\304\030b\010E)\004!a\010\303\030\206\061\202"
"\020a\020e))JJJ\213R\247\071a\010b\020F)\243\020A\010\004!\004!b\010\242\030E)\202\020"
"a\020%!\344\030A\000\344\040%!\201\010\303\020):\065\205\272\326\236\357\277\377"
"\377\377\377\377\377\377\377\377\377\377\377\377\337\377\276\367}\367\034"
"\337\024}\323l+\013m\033\256\063\357;\357\033\357\023\357\023\356;\027\256\231\316"
"\327\245\256\063\356\023/\014\060T\373\326\235\357]\347\362T\024\025\063\005\262,"
"\367\235U\215\256[\353:\252\062\252:\013Kt\215\267\215\023\025\360;IBjJ)B\307"
"\071\212JjJf\061\212JjJ\350\071\010:jJIB\206)IBIB\307\071(B)J\010B\247\071)B\310"
"\071\247\071)B)B\247\061\010:IB\347\071\307\061\010:\350\071\206\061\307\061\010:\206"
"\061f)\010:\247\061\206)\207\061\247\061\247\061f)\307\071f\061f\061\247\071\247\071"
"J:\367\245]\357\276\367\337\377\377\377\377\377\377\377\377\377\377\377\377"
"\377\337\377\276\367\235\357]\357\266\215P$\060,\060$P$P$Q$q$Q\034q\034\222\064"
"\221\064\261\064q\034q\034\222\034\222\014\362\064T]\023\065\023\035\363\024\363\024\363"
"\034\023%\362,\221\034q\024P\024P\024P\024\322$\023%\063\015\221$\256\063\216\063\255"
"\063l+\255\063\255\063m+\316;\256\063\215+\255\063\316;\256\063\215#\256;\316\063"
"\262t:\306Z\276Z\276Z\276Z\276Z\276\316;\215;m\063M+,#,#\014#L\063m;m\063,+M"
"\063M\063,+,+M\063L\063L\063M\063L\063,\063,+,\063,+,\063M\063M\063\255\063\272\306\235"
"\367\276\367\337\377\377\377\377\377\377\377\377\377\377\377\377\377\337"
"\377\337\377\276\367]\367<\337\070\266\225\225\225\225\226\235\266\235\266"
"\235\326\235\266\235\266\235\265\225\266\235\266\235\266\235\266\235\326"
"\225\326\235\027\236x\246\071\266\030\246\367\235\367\235\327\245\367\235\367"
"\245\367\235\367\235\367\235\370\235\370\235\370\235\030\236\370\245\367\245"
"\326\245\266\235\266\245\266\245\266\245\266\245\266\235\266\235\266\235"
"\266\245\266\245\266\245\266\245\266\245\266\235\327\235\367\255y\306y\306"
"z\306z\306\232\306y\306\266\245\266\235\266\245\266\235\266\235\226\235\226"
"\235\225\235\226\235\225\235\225\235u\235u\235u\235u\235u\225u\225u\225u"
"\225U\225u\225U\225U\225T\225T\225\064\225\064\215\266\225\034\347\236\367\276"
"\367\337\377"//,
// };
;
|
the_stack_data/48574307.c
|
int g()
{
return 55;
}
int f(int a, int b)
{
return b;
}
int main()
{
return g();
}
|
the_stack_data/90764004.c
|
#include <stdio.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
#include <fcntl.h>
#define CHUNK_SIZE 64
int main(int argc, char* argv[]){
if(argc < 3){
printf("Invalid number of arguments. \n");
return -1;
}
char chunk[CHUNK_SIZE];
ssize_t nRead;
int sourceFileFD = open(argv[1],O_RDONLY);
int destFileFD= open(argv[2],O_WRONLY | O_CREAT | O_EXCL,0644);
if((sourceFileFD== -1) || (destFileFD == -1))
return -2;
while( (nRead = read(sourceFileFD,chunk,CHUNK_SIZE)) != 0)
write(destFileFD,chunk,nRead);
close(sourceFileFD);
close(destFileFD);
return 0;
}
|
the_stack_data/182952326.c
|
// Test zero-size allocations -- shouldn't cause division by zero, that kind
// of thing.
#include <stdlib.h>
int main(void)
{
free(malloc(0));
free(malloc(0));
free(malloc(0));
free(malloc(0));
free(malloc(0));
free(malloc(0));
free(malloc(0));
free(malloc(0));
free(malloc(0));
free(malloc(0));
return 0;
}
|
the_stack_data/23692.c
|
// RUN: %clang_cc1 -analyze -analyzer-checker=core -analyzer-output=text -analyzer-config suppress-null-return-paths=false -verify %s
// RUN: %clang_cc1 -analyze -analyzer-checker=core -analyzer-output=plist-multi-file -analyzer-config suppress-null-return-paths=false -analyzer-config path-diagnostics-alternate=false %s -o %t.plist
// RUN: FileCheck --input-file=%t.plist %s
void zero(int **p) {
*p = 0;
// expected-note@-1 {{Null pointer value stored to 'a'}}
}
void testZero(int *a) {
zero(&a);
// expected-note@-1 {{Calling 'zero'}}
// expected-note@-2 {{Returning from 'zero'}}
*a = 1; // expected-warning{{Dereference of null pointer}}
// expected-note@-1 {{Dereference of null pointer (loaded from variable 'a')}}
}
void testCheck(int *a) {
if (a) {
// expected-note@-1 + {{Assuming 'a' is null}}
// expected-note@-2 + {{Taking false branch}}
;
}
*a = 1; // expected-warning{{Dereference of null pointer}}
// expected-note@-1 {{Dereference of null pointer (loaded from variable 'a')}}
}
int *getPointer();
void testInitCheck() {
int *a = getPointer();
// expected-note@-1 {{'a' initialized here}}
if (a) {
// expected-note@-1 + {{Assuming 'a' is null}}
// expected-note@-2 + {{Taking false branch}}
;
}
*a = 1; // expected-warning{{Dereference of null pointer}}
// expected-note@-1 {{Dereference of null pointer (loaded from variable 'a')}}
}
void testStoreCheck(int *a) {
a = getPointer();
// expected-note@-1 {{Value assigned to 'a'}}
if (a) {
// expected-note@-1 + {{Assuming 'a' is null}}
// expected-note@-2 + {{Taking false branch}}
;
}
*a = 1; // expected-warning{{Dereference of null pointer}}
// expected-note@-1 {{Dereference of null pointer (loaded from variable 'a')}}
}
int *getZero() {
int *p = 0;
// expected-note@-1 + {{'p' initialized to a null pointer value}}
// ^ This note checks that we add a second visitor for the return value.
return p;
// expected-note@-1 + {{Returning null pointer (loaded from 'p')}}
}
void testReturnZero() {
*getZero() = 1; // expected-warning{{Dereference of null pointer}}
// expected-note@-1 {{Calling 'getZero'}}
// expected-note@-2 {{Returning from 'getZero'}}
// expected-note@-3 {{Dereference of null pointer}}
}
int testReturnZero2() {
return *getZero(); // expected-warning{{Dereference of null pointer}}
// expected-note@-1 {{Calling 'getZero'}}
// expected-note@-2 {{Returning from 'getZero'}}
// expected-note@-3 {{Dereference of null pointer}}
}
void testInitZero() {
int *a = getZero();
// expected-note@-1 {{Calling 'getZero'}}
// expected-note@-2 {{Returning from 'getZero'}}
// expected-note@-3 {{'a' initialized to a null pointer value}}
*a = 1; // expected-warning{{Dereference of null pointer}}
// expected-note@-1 {{Dereference of null pointer (loaded from variable 'a')}}
}
void testStoreZero(int *a) {
a = getZero();
// expected-note@-1 {{Calling 'getZero'}}
// expected-note@-2 {{Returning from 'getZero'}}
// expected-note@-3 {{Null pointer value stored to 'a'}}
*a = 1; // expected-warning{{Dereference of null pointer}}
// expected-note@-1 {{Dereference of null pointer (loaded from variable 'a')}}
}
void usePointer(int *p) {
*p = 1; // expected-warning{{Dereference of null pointer}}
// expected-note@-1 {{Dereference of null pointer}}
}
void testUseOfNullPointer() {
// Test the case where an argument expression is itself a call.
usePointer(getZero());
// expected-note@-1 {{Calling 'getZero'}}
// expected-note@-2 {{Returning from 'getZero'}}
// expected-note@-3 {{Passing null pointer value via 1st parameter 'p'}}
// expected-note@-4 {{Calling 'usePointer'}}
}
struct X { char *p; };
void setFieldToNull(struct X *x) {
x->p = 0; // expected-note {{Null pointer value stored to field 'p'}}
}
int testSetFieldToNull(struct X *x) {
setFieldToNull(x); // expected-note {{Calling 'setFieldToNull'}}
// expected-note@-1{{Returning from 'setFieldToNull'}}
return *x->p;
// expected-warning@-1 {{Dereference of null pointer (loaded from field 'p')}}
// expected-note@-2 {{Dereference of null pointer (loaded from field 'p')}}
}
struct Outer {
struct Inner {
int *p;
} inner;
};
void test(struct Outer *wrapperPtr) {
wrapperPtr->inner.p = 0; // expected-note {{Null pointer value stored to field 'p'}}
*wrapperPtr->inner.p = 1; //expected-warning {{Dereference of null pointer (loaded from field 'p')}}
// expected-note@-1 {{Dereference of null pointer (loaded from field 'p')}}
}
void test4(int **p) {
if (*p) return; // expected-note {{Taking false branch}}
// expected-note@-1 {{Assuming pointer value is null}}
**p = 1; // expected-warning {{Dereference of null pointer}}
// expected-note@-1 {{Dereference of null pointer}}
}
// CHECK: <key>diagnostics</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>path</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>11</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>11</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>11</integer>
// CHECK-NEXT: <key>col</key><integer>10</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Calling 'zero'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Calling 'zero'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>5</integer>
// CHECK-NEXT: <key>col</key><integer>1</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Entered call from 'testZero'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Entered call from 'testZero'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>5</integer>
// CHECK-NEXT: <key>col</key><integer>1</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>5</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>6</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>6</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>6</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>6</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>6</integer>
// CHECK-NEXT: <key>col</key><integer>8</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Null pointer value stored to 'a'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Null pointer value stored to 'a'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>11</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>11</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>11</integer>
// CHECK-NEXT: <key>col</key><integer>10</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Returning from 'zero'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Returning from 'zero'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>11</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>11</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>14</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>14</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>14</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>14</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>14</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Dereference of null pointer (loaded from variable 'a')</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Dereference of null pointer (loaded from variable 'a')</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>description</key><string>Dereference of null pointer (loaded from variable 'a')</string>
// CHECK-NEXT: <key>category</key><string>Logic error</string>
// CHECK-NEXT: <key>type</key><string>Dereference of null pointer</string>
// CHECK-NEXT: <key>check_name</key><string>core.NullDereference</string>
// CHECK-NEXT: <key>issue_context_kind</key><string>function</string>
// CHECK-NEXT: <key>issue_context</key><string>testZero</string>
// CHECK-NEXT: <key>issue_hash</key><string>4</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>14</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>path</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>19</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>19</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>19</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>19</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>19</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>19</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>19</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Assuming 'a' is null</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Assuming 'a' is null</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>19</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>19</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>24</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>24</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>24</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>24</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>24</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>24</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>24</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>24</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>24</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Dereference of null pointer (loaded from variable 'a')</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Dereference of null pointer (loaded from variable 'a')</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>description</key><string>Dereference of null pointer (loaded from variable 'a')</string>
// CHECK-NEXT: <key>category</key><string>Logic error</string>
// CHECK-NEXT: <key>type</key><string>Dereference of null pointer</string>
// CHECK-NEXT: <key>check_name</key><string>core.NullDereference</string>
// CHECK-NEXT: <key>issue_context_kind</key><string>function</string>
// CHECK-NEXT: <key>issue_context</key><string>testCheck</string>
// CHECK-NEXT: <key>issue_hash</key><string>6</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>24</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>path</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>32</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>32</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>32</integer>
// CHECK-NEXT: <key>col</key><integer>8</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>'a' initialized here</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>'a' initialized here</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>32</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>32</integer>
// CHECK-NEXT: <key>col</key><integer>5</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>34</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>34</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>34</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>34</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>34</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>34</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>34</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>34</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>34</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Assuming 'a' is null</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Assuming 'a' is null</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>34</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>34</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>39</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>39</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>39</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>39</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>39</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>39</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>39</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>39</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>39</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Dereference of null pointer (loaded from variable 'a')</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Dereference of null pointer (loaded from variable 'a')</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>description</key><string>Dereference of null pointer (loaded from variable 'a')</string>
// CHECK-NEXT: <key>category</key><string>Logic error</string>
// CHECK-NEXT: <key>type</key><string>Dereference of null pointer</string>
// CHECK-NEXT: <key>check_name</key><string>core.NullDereference</string>
// CHECK-NEXT: <key>issue_context_kind</key><string>function</string>
// CHECK-NEXT: <key>issue_context</key><string>testInitCheck</string>
// CHECK-NEXT: <key>issue_hash</key><string>8</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>39</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>path</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>44</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>44</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>44</integer>
// CHECK-NEXT: <key>col</key><integer>18</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Value assigned to 'a'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Value assigned to 'a'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>44</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>44</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>46</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>46</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>46</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>46</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>46</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>46</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>46</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>46</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>46</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Assuming 'a' is null</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Assuming 'a' is null</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>46</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>46</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>51</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>51</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>51</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>51</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>51</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>51</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>51</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>51</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>51</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Dereference of null pointer (loaded from variable 'a')</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Dereference of null pointer (loaded from variable 'a')</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>description</key><string>Dereference of null pointer (loaded from variable 'a')</string>
// CHECK-NEXT: <key>category</key><string>Logic error</string>
// CHECK-NEXT: <key>type</key><string>Dereference of null pointer</string>
// CHECK-NEXT: <key>check_name</key><string>core.NullDereference</string>
// CHECK-NEXT: <key>issue_context_kind</key><string>function</string>
// CHECK-NEXT: <key>issue_context</key><string>testStoreCheck</string>
// CHECK-NEXT: <key>issue_hash</key><string>8</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>51</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>path</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>65</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>65</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>65</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>65</integer>
// CHECK-NEXT: <key>col</key><integer>10</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>65</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>65</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>65</integer>
// CHECK-NEXT: <key>col</key><integer>12</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Calling 'getZero'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Calling 'getZero'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>56</integer>
// CHECK-NEXT: <key>col</key><integer>1</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Entered call from 'testReturnZero'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Entered call from 'testReturnZero'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>56</integer>
// CHECK-NEXT: <key>col</key><integer>1</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>56</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>5</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>8</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>'p' initialized to a null pointer value</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>'p' initialized to a null pointer value</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>5</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>8</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>10</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Returning null pointer (loaded from 'p')</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Returning null pointer (loaded from 'p')</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>65</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>65</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>65</integer>
// CHECK-NEXT: <key>col</key><integer>12</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Returning from 'getZero'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Returning from 'getZero'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>65</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>65</integer>
// CHECK-NEXT: <key>col</key><integer>10</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>65</integer>
// CHECK-NEXT: <key>col</key><integer>14</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>65</integer>
// CHECK-NEXT: <key>col</key><integer>14</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>65</integer>
// CHECK-NEXT: <key>col</key><integer>14</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>65</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>65</integer>
// CHECK-NEXT: <key>col</key><integer>16</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Dereference of null pointer</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Dereference of null pointer</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>description</key><string>Dereference of null pointer</string>
// CHECK-NEXT: <key>category</key><string>Logic error</string>
// CHECK-NEXT: <key>type</key><string>Dereference of null pointer</string>
// CHECK-NEXT: <key>check_name</key><string>core.NullDereference</string>
// CHECK-NEXT: <key>issue_context_kind</key><string>function</string>
// CHECK-NEXT: <key>issue_context</key><string>testReturnZero</string>
// CHECK-NEXT: <key>issue_hash</key><string>1</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>65</integer>
// CHECK-NEXT: <key>col</key><integer>14</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>path</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>72</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>72</integer>
// CHECK-NEXT: <key>col</key><integer>8</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>72</integer>
// CHECK-NEXT: <key>col</key><integer>11</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>72</integer>
// CHECK-NEXT: <key>col</key><integer>17</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>72</integer>
// CHECK-NEXT: <key>col</key><integer>11</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>72</integer>
// CHECK-NEXT: <key>col</key><integer>11</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>72</integer>
// CHECK-NEXT: <key>col</key><integer>19</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Calling 'getZero'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Calling 'getZero'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>56</integer>
// CHECK-NEXT: <key>col</key><integer>1</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Entered call from 'testReturnZero2'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Entered call from 'testReturnZero2'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>56</integer>
// CHECK-NEXT: <key>col</key><integer>1</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>56</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>5</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>8</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>'p' initialized to a null pointer value</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>'p' initialized to a null pointer value</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>5</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>8</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>10</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Returning null pointer (loaded from 'p')</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Returning null pointer (loaded from 'p')</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>72</integer>
// CHECK-NEXT: <key>col</key><integer>11</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>72</integer>
// CHECK-NEXT: <key>col</key><integer>11</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>72</integer>
// CHECK-NEXT: <key>col</key><integer>19</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Returning from 'getZero'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Returning from 'getZero'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>72</integer>
// CHECK-NEXT: <key>col</key><integer>11</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>72</integer>
// CHECK-NEXT: <key>col</key><integer>17</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>72</integer>
// CHECK-NEXT: <key>col</key><integer>10</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>72</integer>
// CHECK-NEXT: <key>col</key><integer>10</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>72</integer>
// CHECK-NEXT: <key>col</key><integer>10</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>72</integer>
// CHECK-NEXT: <key>col</key><integer>10</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>72</integer>
// CHECK-NEXT: <key>col</key><integer>19</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Dereference of null pointer</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Dereference of null pointer</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>description</key><string>Dereference of null pointer</string>
// CHECK-NEXT: <key>category</key><string>Logic error</string>
// CHECK-NEXT: <key>type</key><string>Dereference of null pointer</string>
// CHECK-NEXT: <key>check_name</key><string>core.NullDereference</string>
// CHECK-NEXT: <key>issue_context_kind</key><string>function</string>
// CHECK-NEXT: <key>issue_context</key><string>testReturnZero2</string>
// CHECK-NEXT: <key>issue_hash</key><string>1</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>72</integer>
// CHECK-NEXT: <key>col</key><integer>10</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>path</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>79</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>79</integer>
// CHECK-NEXT: <key>col</key><integer>5</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>79</integer>
// CHECK-NEXT: <key>col</key><integer>12</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>79</integer>
// CHECK-NEXT: <key>col</key><integer>18</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>79</integer>
// CHECK-NEXT: <key>col</key><integer>12</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>79</integer>
// CHECK-NEXT: <key>col</key><integer>12</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>79</integer>
// CHECK-NEXT: <key>col</key><integer>20</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Calling 'getZero'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Calling 'getZero'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>56</integer>
// CHECK-NEXT: <key>col</key><integer>1</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Entered call from 'testInitZero'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Entered call from 'testInitZero'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>56</integer>
// CHECK-NEXT: <key>col</key><integer>1</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>56</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>5</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>8</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>'p' initialized to a null pointer value</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>'p' initialized to a null pointer value</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>5</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>8</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>10</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Returning null pointer (loaded from 'p')</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Returning null pointer (loaded from 'p')</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>79</integer>
// CHECK-NEXT: <key>col</key><integer>12</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>79</integer>
// CHECK-NEXT: <key>col</key><integer>12</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>79</integer>
// CHECK-NEXT: <key>col</key><integer>20</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Returning from 'getZero'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Returning from 'getZero'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>79</integer>
// CHECK-NEXT: <key>col</key><integer>12</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>79</integer>
// CHECK-NEXT: <key>col</key><integer>18</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>79</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>79</integer>
// CHECK-NEXT: <key>col</key><integer>5</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>79</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>79</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>79</integer>
// CHECK-NEXT: <key>col</key><integer>8</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>'a' initialized to a null pointer value</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>'a' initialized to a null pointer value</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>79</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>79</integer>
// CHECK-NEXT: <key>col</key><integer>5</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>83</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>83</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>83</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>83</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>83</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Dereference of null pointer (loaded from variable 'a')</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Dereference of null pointer (loaded from variable 'a')</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>description</key><string>Dereference of null pointer (loaded from variable 'a')</string>
// CHECK-NEXT: <key>category</key><string>Logic error</string>
// CHECK-NEXT: <key>type</key><string>Dereference of null pointer</string>
// CHECK-NEXT: <key>check_name</key><string>core.NullDereference</string>
// CHECK-NEXT: <key>issue_context_kind</key><string>function</string>
// CHECK-NEXT: <key>issue_context</key><string>testInitZero</string>
// CHECK-NEXT: <key>issue_hash</key><string>5</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>83</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>path</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>88</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>88</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>88</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>88</integer>
// CHECK-NEXT: <key>col</key><integer>13</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>88</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>88</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>88</integer>
// CHECK-NEXT: <key>col</key><integer>15</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Calling 'getZero'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Calling 'getZero'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>56</integer>
// CHECK-NEXT: <key>col</key><integer>1</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Entered call from 'testStoreZero'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Entered call from 'testStoreZero'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>56</integer>
// CHECK-NEXT: <key>col</key><integer>1</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>56</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>5</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>8</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>'p' initialized to a null pointer value</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>'p' initialized to a null pointer value</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>5</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>8</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>10</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Returning null pointer (loaded from 'p')</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Returning null pointer (loaded from 'p')</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>88</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>88</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>88</integer>
// CHECK-NEXT: <key>col</key><integer>15</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Returning from 'getZero'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Returning from 'getZero'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>88</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>88</integer>
// CHECK-NEXT: <key>col</key><integer>13</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>88</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>88</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>88</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>88</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>88</integer>
// CHECK-NEXT: <key>col</key><integer>15</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Null pointer value stored to 'a'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Null pointer value stored to 'a'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>88</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>88</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>92</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>92</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>92</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>92</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>92</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Dereference of null pointer (loaded from variable 'a')</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Dereference of null pointer (loaded from variable 'a')</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>description</key><string>Dereference of null pointer (loaded from variable 'a')</string>
// CHECK-NEXT: <key>category</key><string>Logic error</string>
// CHECK-NEXT: <key>type</key><string>Dereference of null pointer</string>
// CHECK-NEXT: <key>check_name</key><string>core.NullDereference</string>
// CHECK-NEXT: <key>issue_context_kind</key><string>function</string>
// CHECK-NEXT: <key>issue_context</key><string>testStoreZero</string>
// CHECK-NEXT: <key>issue_hash</key><string>5</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>92</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>path</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>103</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>103</integer>
// CHECK-NEXT: <key>col</key><integer>12</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>103</integer>
// CHECK-NEXT: <key>col</key><integer>14</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>103</integer>
// CHECK-NEXT: <key>col</key><integer>20</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>103</integer>
// CHECK-NEXT: <key>col</key><integer>14</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>103</integer>
// CHECK-NEXT: <key>col</key><integer>14</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>103</integer>
// CHECK-NEXT: <key>col</key><integer>22</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Calling 'getZero'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Calling 'getZero'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>56</integer>
// CHECK-NEXT: <key>col</key><integer>1</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Entered call from 'testUseOfNullPointer'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Entered call from 'testUseOfNullPointer'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>56</integer>
// CHECK-NEXT: <key>col</key><integer>1</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>56</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>5</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>8</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>'p' initialized to a null pointer value</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>'p' initialized to a null pointer value</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>57</integer>
// CHECK-NEXT: <key>col</key><integer>5</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>8</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>60</integer>
// CHECK-NEXT: <key>col</key><integer>10</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Returning null pointer (loaded from 'p')</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Returning null pointer (loaded from 'p')</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>103</integer>
// CHECK-NEXT: <key>col</key><integer>14</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>103</integer>
// CHECK-NEXT: <key>col</key><integer>14</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>103</integer>
// CHECK-NEXT: <key>col</key><integer>22</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Returning from 'getZero'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Returning from 'getZero'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>103</integer>
// CHECK-NEXT: <key>col</key><integer>14</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>103</integer>
// CHECK-NEXT: <key>col</key><integer>14</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>103</integer>
// CHECK-NEXT: <key>col</key><integer>22</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Passing null pointer value via 1st parameter 'p'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Passing null pointer value via 1st parameter 'p'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>103</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>103</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>103</integer>
// CHECK-NEXT: <key>col</key><integer>23</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Calling 'usePointer'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Calling 'usePointer'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>96</integer>
// CHECK-NEXT: <key>col</key><integer>1</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Entered call from 'testUseOfNullPointer'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Entered call from 'testUseOfNullPointer'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>96</integer>
// CHECK-NEXT: <key>col</key><integer>1</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>96</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>97</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>97</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>97</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>97</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>97</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>97</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>97</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>97</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>97</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Dereference of null pointer (loaded from variable 'p')</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Dereference of null pointer (loaded from variable 'p')</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>description</key><string>Dereference of null pointer (loaded from variable 'p')</string>
// CHECK-NEXT: <key>category</key><string>Logic error</string>
// CHECK-NEXT: <key>type</key><string>Dereference of null pointer</string>
// CHECK-NEXT: <key>check_name</key><string>core.NullDereference</string>
// CHECK-NEXT: <key>issue_context_kind</key><string>function</string>
// CHECK-NEXT: <key>issue_context</key><string>usePointer</string>
// CHECK-NEXT: <key>issue_hash</key><string>1</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>97</integer>
// CHECK-NEXT: <key>col</key><integer>6</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>path</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>117</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>117</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>117</integer>
// CHECK-NEXT: <key>col</key><integer>19</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Calling 'setFieldToNull'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Calling 'setFieldToNull'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>112</integer>
// CHECK-NEXT: <key>col</key><integer>1</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Entered call from 'testSetFieldToNull'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Entered call from 'testSetFieldToNull'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>112</integer>
// CHECK-NEXT: <key>col</key><integer>1</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>112</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>113</integer>
// CHECK-NEXT: <key>col</key><integer>2</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>113</integer>
// CHECK-NEXT: <key>col</key><integer>2</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>113</integer>
// CHECK-NEXT: <key>col</key><integer>2</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>113</integer>
// CHECK-NEXT: <key>col</key><integer>2</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>113</integer>
// CHECK-NEXT: <key>col</key><integer>9</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>1</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Null pointer value stored to field 'p'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Null pointer value stored to field 'p'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>117</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>117</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>117</integer>
// CHECK-NEXT: <key>col</key><integer>19</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Returning from 'setFieldToNull'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Returning from 'setFieldToNull'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>117</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>117</integer>
// CHECK-NEXT: <key>col</key><integer>16</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>119</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>119</integer>
// CHECK-NEXT: <key>col</key><integer>8</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>119</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>119</integer>
// CHECK-NEXT: <key>col</key><integer>8</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>119</integer>
// CHECK-NEXT: <key>col</key><integer>10</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>119</integer>
// CHECK-NEXT: <key>col</key><integer>10</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>119</integer>
// CHECK-NEXT: <key>col</key><integer>10</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>119</integer>
// CHECK-NEXT: <key>col</key><integer>14</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>119</integer>
// CHECK-NEXT: <key>col</key><integer>14</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Dereference of null pointer (loaded from field 'p')</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Dereference of null pointer (loaded from field 'p')</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>description</key><string>Dereference of null pointer (loaded from field 'p')</string>
// CHECK-NEXT: <key>category</key><string>Logic error</string>
// CHECK-NEXT: <key>type</key><string>Dereference of null pointer</string>
// CHECK-NEXT: <key>check_name</key><string>core.NullDereference</string>
// CHECK-NEXT: <key>issue_context_kind</key><string>function</string>
// CHECK-NEXT: <key>issue_context</key><string>testSetFieldToNull</string>
// CHECK-NEXT: <key>issue_hash</key><string>3</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>119</integer>
// CHECK-NEXT: <key>col</key><integer>10</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>path</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>131</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>131</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>131</integer>
// CHECK-NEXT: <key>col</key><integer>25</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Null pointer value stored to field 'p'</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Null pointer value stored to field 'p'</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>131</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>131</integer>
// CHECK-NEXT: <key>col</key><integer>12</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>132</integer>
// CHECK-NEXT: <key>col</key><integer>24</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>132</integer>
// CHECK-NEXT: <key>col</key><integer>24</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>132</integer>
// CHECK-NEXT: <key>col</key><integer>24</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>132</integer>
// CHECK-NEXT: <key>col</key><integer>22</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>132</integer>
// CHECK-NEXT: <key>col</key><integer>22</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Dereference of null pointer (loaded from field 'p')</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Dereference of null pointer (loaded from field 'p')</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>description</key><string>Dereference of null pointer (loaded from field 'p')</string>
// CHECK-NEXT: <key>category</key><string>Logic error</string>
// CHECK-NEXT: <key>type</key><string>Dereference of null pointer</string>
// CHECK-NEXT: <key>check_name</key><string>core.NullDereference</string>
// CHECK-NEXT: <key>issue_context_kind</key><string>function</string>
// CHECK-NEXT: <key>issue_context</key><string>test</string>
// CHECK-NEXT: <key>issue_hash</key><string>2</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>132</integer>
// CHECK-NEXT: <key>col</key><integer>24</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>path</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>137</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>137</integer>
// CHECK-NEXT: <key>col</key><integer>4</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>137</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>137</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>137</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>137</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>137</integer>
// CHECK-NEXT: <key>col</key><integer>8</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Assuming pointer value is null</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Assuming pointer value is null</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>137</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>137</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>139</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>139</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>control</string>
// CHECK-NEXT: <key>edges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>start</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>139</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>139</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>end</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>139</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>139</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>kind</key><string>event</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>139</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <key>ranges</key>
// CHECK-NEXT: <array>
// CHECK-NEXT: <array>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>139</integer>
// CHECK-NEXT: <key>col</key><integer>3</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>139</integer>
// CHECK-NEXT: <key>col</key><integer>9</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>depth</key><integer>0</integer>
// CHECK-NEXT: <key>extended_message</key>
// CHECK-NEXT: <string>Dereference of null pointer</string>
// CHECK-NEXT: <key>message</key>
// CHECK-NEXT: <string>Dereference of null pointer</string>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
// CHECK-NEXT: <key>description</key><string>Dereference of null pointer</string>
// CHECK-NEXT: <key>category</key><string>Logic error</string>
// CHECK-NEXT: <key>type</key><string>Dereference of null pointer</string>
// CHECK-NEXT: <key>check_name</key><string>core.NullDereference</string>
// CHECK-NEXT: <key>issue_context_kind</key><string>function</string>
// CHECK-NEXT: <key>issue_context</key><string>test4</string>
// CHECK-NEXT: <key>issue_hash</key><string>3</string>
// CHECK-NEXT: <key>location</key>
// CHECK-NEXT: <dict>
// CHECK-NEXT: <key>line</key><integer>139</integer>
// CHECK-NEXT: <key>col</key><integer>7</integer>
// CHECK-NEXT: <key>file</key><integer>0</integer>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </dict>
// CHECK-NEXT: </array>
|
the_stack_data/37636643.c
|
/* $OpenBSD: reallocarray.c,v 1.1 2014/05/08 21:43:49 deraadt Exp $ */
/*
* Copyright (c) 2008 Otto Moerbeek <[email protected]>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <errno.h>
#include <stdint.h>
#include <stdlib.h>
/*
* This is sqrt(SIZE_MAX+1), as s1*s2 <= SIZE_MAX
* if both s1 < MUL_NO_OVERFLOW and s2 < MUL_NO_OVERFLOW
*/
#define MUL_NO_OVERFLOW ((size_t)1 << (sizeof(size_t) * 4))
void *
reallocarray(void *optr, size_t nmemb, size_t size)
{
if ((nmemb >= MUL_NO_OVERFLOW || size >= MUL_NO_OVERFLOW) &&
nmemb > 0 && UINT64_MAX / nmemb < size) {
errno = ENOMEM;
return NULL;
}
return realloc(optr, size * nmemb);
}
|
the_stack_data/143961.c
|
main()
{
int i = 10;
printf(" %d %d %d \n", ++i, i++, ++i);
}
|
the_stack_data/181393216.c
|
#define _GNU_SOURCE
#include <fcntl.h>
#include <regex.h>
#include <setjmp.h>
#include <signal.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/mman.h>
#include <unistd.h>
#define DEFAULT_MD_LEN 128
#define PAGE_SIZE 0x1000
#define PAGE_SIZE_MASK (~(0xfff))
typedef struct tag_MMAP_Node {
unsigned long Start_P;
unsigned long Start_V;
unsigned long length;
unsigned long refcount;
struct tag_MMAP_Node *next;
} TMMAP_Node_t;
TMMAP_Node_t *pTMMAPNode = NULL;
int fd = -1;
const char dev[] = "/dev/mem";
jmp_buf *sigbus_jmp; // global
//************************************************************
void print_bin(unsigned long data) {
int i;
unsigned long ulbit;
for (i = 7; i >= 0; i--) {
ulbit = data >> i;
if (ulbit & 1)
printf("1");
else
printf("0");
}
}
//************************************************************
void signal_handler(int sig) {
if (sig == SIGBUS) {
// printf("signal_handler SIGBUS!\n");
if (sigbus_jmp)
siglongjmp(*sigbus_jmp, 1);
// no one to catch the error, so abort
abort();
}
}
//************************************************************
int set_handler() {
struct sigaction act;
memset(&act, 0, sizeof(act));
act.sa_sigaction = (void *)signal_handler;
act.sa_flags = SA_SIGINFO;
if (sigaction(SIGBUS, &act, 0)) {
perror("sigaction");
return -1;
}
return 0;
}
//************************************************************
void *memmap(unsigned long phy_addr, unsigned long size) {
unsigned long phy_addr_in_page;
unsigned long page_diff;
unsigned long size_in_page;
unsigned long value = 0;
TMMAP_Node_t *pTmp;
TMMAP_Node_t *pNew;
void *addr = NULL;
if (size == 0) {
printf("memmap():size can't be zero!\n");
return NULL;
}
/* проверить, было ли преобразовано пространство физической памяти */
pTmp = pTMMAPNode;
while (pTmp != NULL) {
if ((phy_addr >= pTmp->Start_P) &&
((phy_addr + size) <= (pTmp->Start_P + pTmp->length))) {
pTmp->refcount++; /* referrence count increase by 1 */
return (void *)(pTmp->Start_V + phy_addr - pTmp->Start_P);
}
pTmp = pTmp->next;
}
/* not mmaped yet */
if (fd < 0) {
/* dev not opened yet, so open it */
fd = open(dev, O_RDWR | O_SYNC);
if (fd < 0) {
printf("memmap():open %s error!\n", dev);
return NULL;
}
}
/* addr align in page_size(4K) */
phy_addr_in_page = phy_addr & PAGE_SIZE_MASK;
page_diff = phy_addr - phy_addr_in_page;
/* size in page_size */
size_in_page = ((size + page_diff - 1) & PAGE_SIZE_MASK) + PAGE_SIZE;
addr = mmap((void *)0, size_in_page, PROT_READ | PROT_WRITE, MAP_SHARED, fd,
phy_addr_in_page);
if (addr == MAP_FAILED) {
printf("memmap():mmap @ 0x%lx error!\n", phy_addr_in_page);
return NULL;
}
/* add this mmap to MMAP Node */
pNew = (TMMAP_Node_t *)malloc(sizeof(TMMAP_Node_t));
if (NULL == pNew) {
printf("memmap():malloc new node failed!\n");
return NULL;
}
pNew->Start_P = phy_addr_in_page;
pNew->Start_V = (unsigned long)addr;
pNew->length = size_in_page;
pNew->refcount = 1;
pNew->next = NULL;
if (pTMMAPNode == NULL) {
pTMMAPNode = pNew;
} else {
pTmp = pTMMAPNode;
while (pTmp->next != NULL) {
pTmp = pTmp->next;
}
pTmp->next = pNew;
}
return (void *)(addr + page_diff);
}
//************************************************************
unsigned long GetValueRegister(unsigned long adress) {
void *pMem = NULL;
unsigned long value = -1;
jmp_buf sigbus_jmpbuf;
sigbus_jmp = &sigbus_jmpbuf;
if (sigsetjmp(sigbus_jmpbuf, 1) == 0) {
pMem = memmap(adress, DEFAULT_MD_LEN);
if (pMem == NULL) {
printf("memmap failed!\n");
return -1;
}
value = *(unsigned int *)pMem; //читаем региср
}
return value;
}
//************************************************************
int SetValueRegister(unsigned long adress, unsigned long value) {
void *pMem = NULL;
pMem = memmap(adress, DEFAULT_MD_LEN);
if (pMem == NULL) {
printf("memmap failed!\n");
return -1;
}
*(unsigned int *)pMem = value; //пишем в регистр
return 0;
}
//************************************************************
void get_chip_gpio_adress(unsigned long *Chip_Id, unsigned long *GPIO_Groups,
unsigned long *GPIO_Base,
unsigned long *GPIO_Offset) {
*GPIO_Offset = 0x10000;
switch (*Chip_Id) {
//-------------------------------------------
// Default: 0x3516A100 одна группа
// Hi3516Av100 A7 @ 600 MHz 0x2014_0000
case 0x3516A100:
*GPIO_Groups = 17; //пропустить G15
*GPIO_Base = 0x20140000;
break;
// Default: 0x3516A100
// Hi3516Dv100 A7 @600 MHz 0x2014_0000
case 0x3516D100:
*GPIO_Groups = 15;
*GPIO_Base = 0x20140000;
break;
//-------------------------------------------
// Hi3518Ev100 ARM926 @ 440 MHz 0x2014_0000
case 0x35180100:
*GPIO_Groups = 12;
*GPIO_Base = 0x20140000;
break;
//-------------------------------------------
// Hi3516Cv100 ARM926 @ 440 MHz 0x2014_0000
case 0x3516C100:
*GPIO_Groups = 12;
*GPIO_Base = 0x20140000;
break;
//-------------------------------------------
// Default: 0x3516C300
// Hi3516Cv300 ARM926 @ 800 MHz 0x1214_0000
case 0x3516C300:
*GPIO_Groups = 9;
*GPIO_Base = 0x12140000;
break;
case 0x3516A300:
*GPIO_Groups = 12;
*GPIO_Base = 0x120D0000;
break;
//-------------------------------------------
// Default: 0x3516E200
// Hi3516Ev200 A7 @ 900MHz 0x120B_0000
case 0x3516E200:
*GPIO_Groups = 9;
*GPIO_Base = 0x120B0000;
*GPIO_Offset = 0x1000;
break;
//-------------------------------------------
// Default: 0x3516E300
// Hi3516Ev300 A7 @ 900MHz 0x120B_0000
case 0x3516E300:
*GPIO_Groups = 10;
*GPIO_Base = 0x120B0000;
*GPIO_Offset = 0x1000;
break;
//-------------------------------------------
// Default: 0x3518E200 одна группа
// Hi3516Cv200 ARM926 @ 540 MHz 0x2014_0000
case 0x3516C200:
*GPIO_Groups = 9;
*GPIO_Base = 0x20140000;
break;
// Default: 0x3518E200
// Hi3518Ev200 ARM926 @ 540 MHz 0x2014_0000
case 0x3518E200:
*GPIO_Groups = 9;
*GPIO_Base = 0x20140000;
break;
// Default: 0x3518E200
// Hi3518Ev201 ARM926 @ 540 MHz 0x2014_0000
case 0x3518E201:
*GPIO_Groups = 9;
*GPIO_Base = 0x20140000;
break;
//-------------------------------------------
case 0x35350100:
*GPIO_Groups = 15;
*GPIO_Base = 0x20150000;
break;
//-------------------------------------------
case 0x3536C100:
*GPIO_Groups = 14; //пропустить G4
*GPIO_Base = 0x12150000;
break;
//-------------------------------------------
case 0x3536D100:
*GPIO_Groups = 6;
*GPIO_Base = 0x12150000;
break;
//-------------------------------------------
case 0x72050200:
*GPIO_Groups = 9;
*GPIO_Base = 0x120B0000;
*GPIO_Offset = 0x1000;
break;
case 0x72050300:
*GPIO_Groups = 10;
*GPIO_Base = 0x120B0000;
*GPIO_Offset = 0x1000;
break;
case 0x72020300:
*GPIO_Groups = 9;
*GPIO_Base = 0x120B0000;
*GPIO_Offset = 0x1000;
break;
case 0x76050100:
*GPIO_Groups = 10;
*GPIO_Base = 0x120B0000;
*GPIO_Offset = 0x1000;
break;
//-------------------------------------------
default:
*GPIO_Groups = 0;
*GPIO_Base = 0;
*GPIO_Offset = 0;
break;
//---------------------------------
}
}
#define MAX_ERROR_MSG 0x1000
static int compile_regex(regex_t *r, const char *regex_text) {
int status = regcomp(r, regex_text, REG_EXTENDED | REG_NEWLINE | REG_ICASE);
if (status != 0) {
char error_message[MAX_ERROR_MSG];
regerror(status, r, error_message, MAX_ERROR_MSG);
printf("Regex error compiling '%s': %s\n", regex_text, error_message);
return -1;
}
return 1;
}
bool get_regex_line_from_file(const char *filename, const char *re, char *buf,
size_t buflen) {
long res = false;
FILE *f = fopen(filename, "r");
if (!f)
return false;
regex_t regex;
regmatch_t matches[2];
if (!compile_regex(®ex, re))
goto exit;
char *line = NULL;
size_t len = 0;
ssize_t read;
while ((read = getline(&line, &len, f)) != -1) {
if (regexec(®ex, line, sizeof(matches) / sizeof(matches[0]),
(regmatch_t *)&matches, 0) == 0) {
regoff_t start = matches[1].rm_so;
regoff_t end = matches[1].rm_eo;
line[end] = 0;
strncpy(buf, line + start, buflen);
res = true;
break;
}
}
if (line)
free(line);
exit:
regfree(®ex);
fclose(f);
return res;
}
static long get_uart0_address() {
char buf[256];
bool res = get_regex_line_from_file(
"/proc/iomem", "^([0-9a-f]+)-[0-9a-f]+ : .*uart[@:][0-9]", buf,
sizeof(buf));
if (!res) {
return -1;
}
return strtol(buf, NULL, 16);
}
//************************************************************
void get_chip_id(unsigned long *Chip_Id, char *cpu, char *hardware) {
unsigned long SCBASE;
unsigned long SCSYSID0 = 0xEE0;
unsigned long SCSYSID1 = 0xEE4;
unsigned long SCSYSID2 = 0xEE8;
unsigned long SCSYSID3 = 0xEEC;
unsigned long Chip_Ver;
unsigned long Val;
char Buffer[4096];
int i;
long uart_base = get_uart0_address();
switch (uart_base) {
// hi3516cv300
case 0x12100000:
// hi3516ev200
case 0x120a0000:
case 0x12040000:
SCBASE = 0x12020000;
break;
// hi3536c
case 0x12080000:
SCBASE = 0x12050000;
break;
// hi3516cv100
// hi3518ev200
default:
SCBASE = 0x20050000;
}
//---------------------------------------------
if ((GetValueRegister(SCBASE + SCSYSID0) & 0xFF000000) >> 24 == 0x35 ||
(GetValueRegister(SCBASE + SCSYSID0) & 0xFF000000) >> 24 == 0x72 ||
(GetValueRegister(SCBASE + SCSYSID0) & 0xFF000000) >> 24 == 0x76)
//если старший байт соответсвует сигнатуре значит все ID в одном регистре
{
*Chip_Id = GetValueRegister(SCBASE + SCSYSID0);
Chip_Ver = 0;
} else {
Chip_Ver = (GetValueRegister(SCBASE + SCSYSID0) & 0xFF000000) >>
24; //старший байт регистра может быть версия чипа
SCSYSID0 = GetValueRegister(SCBASE + SCSYSID0) &
0xFF; //читаем младший байт регистра
SCSYSID1 = GetValueRegister(SCBASE + SCSYSID1) &
0xFF; //читаем младший байт регистра
SCSYSID2 = GetValueRegister(SCBASE + SCSYSID2) &
0xFF; //читаем младший байт регистра
SCSYSID3 = GetValueRegister(SCBASE + SCSYSID3) &
0xFF; //читаем младший байт регистра
*Chip_Id =
(SCSYSID3 << 24) + (SCSYSID2 << 16) + (SCSYSID1 << 8) + (SCSYSID0);
}
//---------------------------------------------
if ((*Chip_Id == 0x3518E200) & (Chip_Ver == 0x01))
*Chip_Id = 0x3516C200;
if ((*Chip_Id == 0x3518E200) & (Chip_Ver == 0x02))
*Chip_Id = 0x3518E200;
if ((*Chip_Id == 0x3518E200) & (Chip_Ver == 0x03))
*Chip_Id = 0x3518E201;
//---------------------------------------------
if ((*Chip_Id == 0x3516A100) & (Chip_Ver == 0x01))
*Chip_Id = 0x3516A100;
if ((*Chip_Id == 0x3516A100) & (Chip_Ver == 0x02))
*Chip_Id = 0x3516D100;
//---------------------------------------------
switch (*Chip_Id) {
//-------------------------------------------
// Default: 0x3516A100
case 0x3516A100:
sprintf(cpu, "Hi3516Av100");
sprintf(hardware, "A7 @ 600 MHz");
break;
//-------------------------------------------
// Default: 0x3516A100
case 0x3516D100:
sprintf(cpu, "Hi3516Dv100");
sprintf(hardware, "A7 @ 600 MHz");
break;
//-------------------------------------------
// Default: 0x35180100
case 0x35180100:
sprintf(cpu, "Hi3518Ev100");
sprintf(hardware, "ARM926 @ 440 MHz");
break;
//-------------------------------------------
case 0x3516C100:
sprintf(cpu, "Hi3516Cv100");
sprintf(hardware, "ARM926 @ 440 MHz");
break;
//-------------------------------------------
// Default: 0x3516C300
case 0x3516C300:
sprintf(cpu, "Hi3516Cv300");
sprintf(hardware, "ARM926 @ 800 MHz");
break;
case 0x3516A300:
sprintf(cpu, "Hi3516Av300");
sprintf(hardware, "A7 dual core @ 900MHz");
break;
//-------------------------------------------
// Default: 0x3516E200
case 0x3516E200:
sprintf(cpu, "Hi3516Ev200");
sprintf(hardware, "A7 @ 900MHz");
break;
//-------------------------------------------
// Default: 0x3516E300
case 0x3516E300:
sprintf(cpu, "Hi3516Ev300");
sprintf(hardware, "A7 @ 900MHz");
break;
//-------------------------------------------
// Default: 0x3518E200 одна группа
case 0x3516C200:
sprintf(cpu, "Hi3516Cv200");
sprintf(hardware, "ARM926 @ 540 MHz");
break;
// Default: 0x3518E200
case 0x3518E200:
sprintf(cpu, "Hi3518Ev200");
sprintf(hardware, "ARM926 @ 540 MHz");
break;
// Default: 0x3518E200
case 0x3518E201:
sprintf(cpu, "Hi3518Ev201");
sprintf(hardware, "ARM926 @ 540 MHz");
break;
//-------------------------------------------
case 0x35350100:
sprintf(cpu, "Hi3535v100");
sprintf(hardware, "A9 dual-core @ 900 MHz");
break;
//-------------------------------------------
case 0xBDA9D100:
sprintf(cpu, "Hi3536Cv100");
sprintf(hardware, "A7 dual-core @ 1.3 GHz");
break;
//-------------------------------------------
case 0x3536D100:
sprintf(cpu, "Hi3536Dv100");
sprintf(hardware, "A7 @ 850 MHz");
break;
//-------------------------------------------
case 0x72050200:
sprintf(cpu, "Gk7205v200");
sprintf(hardware, "A7 @ 900MHz");
break;
//-------------------------------------------
case 0x72050300:
sprintf(cpu, "Gk7205v300");
sprintf(hardware, "A7 @ 900MHz");
break;
//-------------------------------------------
case 0x72020300:
sprintf(cpu, "Gk7202v300");
sprintf(hardware, "A7 @ 900MHz");
break;
//-------------------------------------------
case 0x76050100:
sprintf(cpu, "Gk7605v100");
sprintf(hardware, "A7 @ 900MHz");
break;
//-------------------------------------------
default: //чип не поддерживается
sprintf(cpu, "unknown");
sprintf(hardware, "unknown");
break;
//---------------------------------
}
}
//************************************************************
int main(int argc, char *argv[]) {
unsigned long Chip_Id = 0;
char CPU[50] = {""};
char HARDWARE[50] = {""};
unsigned long GPIO_Groups, GPIO_Base, GPIO_Offset;
unsigned long adress = 0;
unsigned long direct = 0;
unsigned long value = 0;
unsigned long OldValue[20];
int bit, old_bit, new_bit;
int i, group, mask;
int HeaderByte, Skip, SkipPin;
//---------------------------------------------------------------
if (set_handler() == -1) {
printf("Set handler Error!\n");
return 0;
}
get_chip_id(&Chip_Id, &CPU[0], &HARDWARE[0]);
printf("To skip pin use: %s 12 14 ...\n", argv[0]);
printf("================ Hisilicon GPIO Scaner (2021) OpenIPC.org collective "
"=================\n");
printf("Chip_Id: 0x%08lX, CPU: %s, Hardware: %s\n", Chip_Id, CPU, HARDWARE);
if (!strcmp(CPU, "unknown")) //чип не поддерживается
{
printf("This CPU not support!\n");
return 0;
}
get_chip_gpio_adress(&Chip_Id, &GPIO_Groups, &GPIO_Base, &GPIO_Offset);
//-----------------------------
for (group = 0; group < GPIO_Groups; group++) {
adress = GPIO_Base + (group * GPIO_Offset) + 0x3fc; //регистр данных портов
value = GetValueRegister(adress);
OldValue[group] = value; //запоминаем в массив значение
printf("Gr:%2d, Addr:0x%08lX, Data:0x%02lX = 0b", group, adress, value);
print_bin(value); //выводим бинарный вид
adress =
GPIO_Base + (group * GPIO_Offset) + 0x400; //регистр направления портов
direct = GetValueRegister(adress);
printf(", Addr:0x%08lX, Dir:0x%02lX = 0b", adress, direct);
print_bin(direct);
printf("\n");
}
if (argc > 1) {
printf("-------------------------------------------------------------------"
"-------------------\n");
for (i = 1; i < argc; i++)
printf("Skip Pin: GPIO%s\n", argv[i]);
}
printf("---------------------------------------------------------------------"
"-----------------\n");
printf("While change value...\n");
//-----------------------------
while (1) {
for (group = 0; group < GPIO_Groups; group++) {
adress =
GPIO_Base + (group * GPIO_Offset) + 0x3fc; //регистр данных портов
value = GetValueRegister(adress);
if (OldValue[group] != value) //старый и новый байты не равны
{
HeaderByte = 0;
for (bit = 7; bit >= 0; bit--) //цикл побитного сравнения
{
old_bit = (OldValue[group] >> bit) & 1;
new_bit = (value >> bit) & 1;
Skip = 0;
//-------------------------------
if (argc > 1) //Есть пин для пропуска
{
for (i = 1; i < argc; i++) {
SkipPin = atoi(argv[i]);
if (((group * 8) + bit) == SkipPin)
Skip = 1;
}
}
//-------------------------------
if (Skip == 0) {
if (old_bit != new_bit) {
if (HeaderByte == 0) //еще не выводили заголовок измененения байта
{
printf("-------------------------------------------------------"
"-------------------------------\n");
printf("Gr:%d, Addr:0x%08lX, Data:0x%02lX = 0b", group, adress,
OldValue[group]);
print_bin(OldValue[group]);
printf(" --> 0x%02lX = 0b", value);
print_bin(value);
printf("\n");
HeaderByte = 1;
}
adress = GPIO_Base + (group * GPIO_Offset) +
0x400; //регистр направления портов
direct = GetValueRegister(adress);
direct = (direct >> bit) &
1; //получили бит направления порта 0-вход 1-выход
adress = GPIO_Base + (group * GPIO_Offset) + (1 << (bit + 2));
if (direct == 1) {
mask = value & 1 << bit;
printf("Mask: \"himm 0x%08lX 0x%02X\", GPIO%d_%d, GPIO%d, "
"Dir:Output, Level:%d\n",
adress, mask, group, bit, (group * 8) + bit, new_bit);
} else {
mask = value & 1 << bit;
printf("Mask: \"himm 0x%08lX 0x%02X\", GPIO%d_%d, GPIO%d, "
"Dir:Input, Level:%d\n",
adress, mask, group, bit, (group * 8) + bit, new_bit);
}
}
}
}
OldValue[group] = value; //запоминаем новое значение
}
}
usleep(100000);
}
return 0;
}
|
the_stack_data/1065505.c
|
/*
* Author: David Robert Nadeau
* Site: http://NadeauSoftware.com/
* License: Creative Commons Attribution 3.0 Unported License
* http://creativecommons.org/licenses/by/3.0/deed.en_US
*/
/*
* Modified by Tom van Dijk to remove WIN32 and solaris code
*/
#if defined(__APPLE__) && defined(__MACH__)
#include <unistd.h>
#include <sys/resource.h>
#include <mach/mach.h>
#elif defined(__linux__) || defined(__linux) || defined(linux) || defined(__gnu_linux__)
#include <unistd.h>
#include <sys/resource.h>
#include <stdio.h>
#else
#error "Cannot define getPeakRSS( ) or getCurrentRSS( ) for an unknown OS."
#endif
/**
* Returns the peak (maximum so far) resident set size (physical
* memory use) measured in bytes, or zero if the value cannot be
* determined on this OS.
*/
size_t
getPeakRSS()
{
struct rusage rusage;
getrusage(RUSAGE_SELF, &rusage);
#if defined(__APPLE__) && defined(__MACH__)
return (size_t)rusage.ru_maxrss;
#else
return (size_t)(rusage.ru_maxrss * 1024L);
#endif
}
/**
* Returns the current resident set size (physical memory use) measured
* in bytes, or zero if the value cannot be determined on this OS.
*/
size_t
getCurrentRSS()
{
#if defined(__APPLE__) && defined(__MACH__)
/* OSX ------------------------------------------------------ */
struct mach_task_basic_info info;
mach_msg_type_number_t infoCount = MACH_TASK_BASIC_INFO_COUNT;
if (task_info(mach_task_self(), MACH_TASK_BASIC_INFO, (task_info_t)&info, &infoCount) != KERN_SUCCESS)
return (size_t)0L; /* Can't access? */
return (size_t)info.resident_size;
#else
/* Linux ---------------------------------------------------- */
long rss = 0L;
FILE *fp = NULL;
if ((fp = fopen("/proc/self/statm", "r")) == NULL)
return (size_t)0L; /* Can't open? */
if (fscanf(fp, "%*s%ld", &rss) != 1) {
fclose(fp);
return (size_t)0L; /* Can't read? */
}
fclose(fp);
return (size_t)rss * (size_t)sysconf(_SC_PAGESIZE);
#endif
}
|
the_stack_data/200143130.c
|
#include <stdio.h>
#include <stdlib.h>
/* 使用指针作为参数，可以实现交换两个变量的值 */
void alter(int * p)
{
p = (int *)malloc(sizeof(int)); /* 分配一块内存，该内存用于存储一个整型变量 */
*p = 100; /* 将该变量值设置为100 */
}
int main(void)
{
int a;
int *p;
a = 10; /* 变量a */
p = &a; /* 指针p指向变量a */
printf("p : 0x%x, *p %d\n", p, *p);
alter(p); /* 更改指针变量本身的值 */
printf("p : 0x%x, *p %d\n", p, *p);
return 0;
}
|
the_stack_data/98576415.c
|
/*
** EPITECH PROJECT, 2018
** get_nbrlen
** File description:
** Get the length of a number in characters
*/
int get_nbrlen(long int nbr)
{
int len = 0;
do {
nbr /= 10;
len++;
} while (nbr > 0);
return (len);
}
|
the_stack_data/113529.c
|
int f(int a) {
return a;
}
void cast() {
int (*a)(int a) = &f;
void * (*b)(int ) = (void *(*)(int ))a;
(void)b;
}
|
the_stack_data/72952.c
|
#include <stdio.h>
#include <stdlib.h>
/**
* string_nconcat - function that concatenates tow strings
* @s1: pointer for the firts string
* @s2: pointer for the second string
* @n: firts n bytes of s2
* Return: pointer
*/
char *string_nconcat(char *s1, char *s2, unsigned int n)
{
unsigned int i = 0, j = 0, a = 0, b = 0, m = 0;
char *p;
if (s1 == NULL)
s1 = "";
if (s2 == NULL)
s2 = "";
while (*(s1 + i))
i++;
while (*(s2 + j))
j++;
if (n >= j)
n = j;
else if (n == 0)
j = 0;
p = malloc((sizeof(char) * i + sizeof(char) * n + 1));
if (p == NULL)
return (NULL);
for (; a <= i; a++)
*(p + a) = *(s1 + a);
for (b = i; b < (i + n); b++)
{
*(p + b) = *(s2 + m);
m++;
}
*(p + b) = '\0';
return (p);
}
|
the_stack_data/75138457.c
|
/****************************************************************
Copyright (C) 2014 Sean Guo. All rights reserved.
> File Name: < unix_client.c >
> Author: < Sean Guo >
> Mail: < [email protected] >
> Created Time: < 2014/07/06 >
> Last Changed:
> Description:
****************************************************************/
#include <stdio.h>
#include <string.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <arpa/inet.h>
#include <netinet/in.h>
#include <unistd.h>
#include <sys/un.h>
#define UNIX_SOCKET "/tmp/unix_socket"
int main(int argc,char **argv)
{
int sockfd;
struct sockaddr_un addr;
char path[104] = UNIX_SOCKET;
int len;
//客户端创建UNIX域socket(同服务器)
sockfd = socket(AF_UNIX, SOCK_STREAM, 0);
if(sockfd == -1)
{
printf("create socket failed.\n");
return -1;
}
//客户端调用connect连接服务器
bzero(&addr, sizeof(addr));
addr.sun_family = AF_UNIX;
strcpy((void*)&addr.sun_path, UNIX_SOCKET);
if(connect(sockfd,(struct sockaddr *)&addr, sizeof(addr)) == -1)
{
printf("connect error.\n");
return 1;
}
printf("write messages to echo server.\n");
do
{
char buf[512];
int n;
printf("> ");
fgets(buf, 512, stdin); //从终端读取出用户的输入, 发送给服务器.
if(send(sockfd,buf,strlen(buf),0) == -1)
{
printf("send error\n");
break;
}
if((n = recv(sockfd,buf,512,0)) <= 0) //接收服务器的应答
{
printf("receive error\n");
break;
}
else
{
buf[n] = '\0';
printf("server> %s", buf);
}
} while(1);
close(sockfd);
return 0;
}
|
the_stack_data/45449188.c
|
#include <stdio.h>
int main() {
int n, i, pom, zname;
scanf("%d", &n);
for (i = n + 1;; i++) {
pom = i;
zname = 1;
while (pom > 0) {
if ((pom % 10 != 7) && (pom % 10 != 9)) {
zname = 0;
break;
}
pom /= 10;
}
if (zname) {
printf("%d", i);
break;
}
}
return 0;
}
|
the_stack_data/12637924.c
|
// Check if comparation is nondet
int main(void) {
int p; // unique stack addr
int q; // unique stack addr;
__ESBMC_assume(&p < &q);
if(&p > &q) __ESBMC_assert(0,"p shouldn't be greater than q");
return 0;
}
|
the_stack_data/57347.c
|
//Credits: serenity os
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#ifdef DEBUG
void
__assertion_failed (
const char* msg,
const char* file,
unsigned line,
const char* func )
{
printf ("USERSPACE(%d) ASSERTION FAILED: ", getpid() );
printf (" %s \n %s:%u in %s \n", msg, file, line, func );
stdlib_die ( "__assertion_failed: *hang");
// Suspended.
// fprintf (stderr, "ASSERTION FAILED: %s\n%s:%u in %s\n", msg, file, line, func);
//abort ();
//for (;;)
}
#endif
/*
static int
fmtassert(char *buf, size_t len, const char *file, int line,
const char *function, const char *failedexpr);
static int
fmtassert(char *buf, size_t len, const char *file, int line,
const char *function, const char *failedexpr)
{
return snprintf_ss(buf, len,
"assertion \"%s\" failed: file \"%s\", line %d%s%s%s\n",
failedexpr, file, line,
function ? ", function \"" : "",
function ? function : "",
function ? "\"" : "");
}
*/
/*
void
__assert13(const char *file, int line, const char *function,
const char *failedexpr);
void
__assert13(const char *file, int line, const char *function,
const char *failedexpr)
{
char buf[1024];
int l = fmtassert(buf, sizeof(buf), file, line, function, failedexpr);
if (l < 0)
abort();
(void)write(STDERR_FILENO, buf, (size_t)l);
abort();
//NOTREACHED
}
*/
/*
void
__assert(const char *file, int line, const char *failedexpr);
void
__assert(const char *file, int line, const char *failedexpr)
{
__assert13(file, line, NULL, failedexpr);
//NOTREACHED
}
*/
enum {
DIAGASSERT_ABORT = 1<<0,
DIAGASSERT_STDERR = 1<<1,
DIAGASSERT_SYSLOG = 1<<2
};
static int diagassert_flags = -1;
/*
void
__diagassert13(const char *file, int line, const char *function,
const char *failedexpr);
void
__diagassert13(const char *file, int line, const char *function,
const char *failedexpr)
{
//#todo
}
*/
/*
void
__diagassert(const char *file, int line, const char *failedexpr);
void
__diagassert(const char *file, int line, const char *failedexpr)
{
__diagassert13(file, line, NULL, failedexpr);
}
*/
|
the_stack_data/70401.c
|
#include <stdio.h>
int main (void)
{
int myinteger = 4;
printf("I have assigned a value of %i to the variable myinteger\n", myinteger);
return 0;
}
|
the_stack_data/577.c
|
// Q. 17 DSA Major, Create Binary Search Tree the displays the given figure below.
// 10
// \
// 30
// / \
// 25 40
// \
// 45
// Shashwat Sharma 20bcs075
#include<stdio.h>
#include<stdlib.h>
struct node
{
int key;
struct node *left;
struct node *right;
};
struct node *getNewNode(int val)
{
struct node *newNode = malloc(sizeof(struct node));
newNode->key = val;
newNode->left = NULL;
newNode->right = NULL;
return newNode;
}
struct node *insert(struct node *root, int val)
{
if(root == NULL)
return getNewNode(val);
if(root->key < val)
root->right = insert(root->right,val);
else if(root->key > val)
root->left = insert(root->left,val);
return root;
}
// To display the exact tree as the figure, preorder traversal is used
void preorder(struct node *root)
{
if(root == NULL)
return;
//visit the root
printf("%d",root->key);
//traverse the left subtree
preorder(root->left);
//traverse the right subtree
preorder(root->right);
}
int main()
{
struct node *root = NULL;
int i,a,b,c,n;
// inserting elements of tree
root = insert(root,10);
root = insert(root,30);
root = insert(root,25);
root = insert(root,40);
root = insert(root,45);
printf("\nBinary Search Tree as given in question : \n");
preorder(root);
printf("\n");
return 0;
}
|
the_stack_data/639837.c
|
#define NMOUNT 16
#define NAMSIZ 32
struct mtab {
char file[NAMSIZ];
char spec[NAMSIZ];
} mtab[NMOUNT];
main(argc, argv)
char **argv;
{
register struct mtab *mp;
register char *p1, *p2;
int mf;
sync();
mf = open("/etc/mtab", 0);
read(mf, (char *)mtab, NMOUNT*2*NAMSIZ);
if(argc != 2) {
printf("arg count\n");
return(1);
}
if (umount(argv[1]) < 0) {
perror("umount");
return(1);
}
p1 = argv[1];
while(*p1++)
;
p1--;
while(*--p1 == '/')
*p1 = '\0';
while(p1 > argv[1] && *--p1 != '/')
;
if(*p1 == '/')
p1++;
argv[1] = p1;
for (mp = mtab; mp < &mtab[NMOUNT]; mp++) {
p1 = argv[1];
p2 = &mp->spec[0];
while (*p1++ == *p2)
if (*p2++ == 0) {
for (p1 = mp->file; p1 < &mp->file[NAMSIZ*2];)
*p1++ = 0;
mp = &mtab[NMOUNT];
while ((--mp)->file[0] == 0);
mf = creat("/etc/mtab", 0644);
write(mf, (char *)mtab, (mp-mtab+1)*2*NAMSIZ);
return(0);
}
}
printf("%s not in mount table\n", argv[1]);
return(1);
}
|
the_stack_data/18888408.c
|
#include <stdio.h>
#include <stdlib.h>
/*
* This stores the total number of books in each shelf.
*/
int* total_number_of_books;
/*
* This stores the total number of pages in each book of each shelf.
* The rows represent the shelves and the columns represent the books.
*/
int** total_number_of_pages;
int main()
{
int total_number_of_shelves;
scanf("%d", &total_number_of_shelves);
int total_number_of_queries;
scanf("%d", &total_number_of_queries);
total_number_of_pages = (int **)malloc(total_number_of_shelves * sizeof(int*));
total_number_of_books = (int *) malloc(total_number_of_shelves * sizeof(int));
for(int i = 0; i < total_number_of_shelves; i ++) {
total_number_of_books[i] = 0;
}
while (total_number_of_queries--) {
int type_of_query;
scanf("%d", &type_of_query);
if (type_of_query == 1) {
int x, y;
scanf("%d %d", &x, &y);
if(*(total_number_of_pages + x)) {
*(total_number_of_pages + x) = (int *)realloc(*(total_number_of_pages + x), (total_number_of_books[x] + 1) * sizeof(int));
total_number_of_pages[x][total_number_of_books[x]] = y;
}
else {
*(total_number_of_pages + x) = (int *)malloc(sizeof(int));
**(total_number_of_pages + x) = y;
}
total_number_of_books[x]++;
} else if (type_of_query == 2) {
int x, y;
scanf("%d %d", &x, &y);
printf("%d\n", *(*(total_number_of_pages + x) + y));
} else {
int x;
scanf("%d", &x);
printf("%d\n", *(total_number_of_books + x));
}
}
if (total_number_of_books) {
free(total_number_of_books);
}
for (int i = 0; i < total_number_of_shelves; i++) {
if (*(total_number_of_pages + i)) {
free(*(total_number_of_pages + i));
}
}
if (total_number_of_pages) {
free(total_number_of_pages);
}
return 0;
}
|
the_stack_data/98574946.c
|
// RUN: clang-cc -triple i386-pc-linux-gnu -verify -emit-llvm -o - %s | FileCheck %s
typedef __INTPTR_TYPE__ intptr_t;
// Brace-enclosed string array initializers
char a[] = { "asdf" };
// Double-implicit-conversions of array/functions (not legal C, but
// clang accepts it for gcc compat).
intptr_t b = a; // expected-warning {{incompatible pointer to integer conversion}}
int c();
void *d = c;
intptr_t e = c; // expected-warning {{incompatible pointer to integer conversion}}
int f, *g = __extension__ &f, *h = (1 != 1) ? &f : &f;
union s2 {
struct {
struct { } *f0;
} f0;
};
int g0 = (int)(&(((union s2 *) 0)->f0.f0) - 0);
// CHECK: @g1x = global {{%.}} { double 1.000000e+00{{[0]*}}, double 0.000000e+00{{[0]*}} }
_Complex double g1x = 1.0f;
// CHECK: @g1y = global {{%.}} { double 0.000000e+00{{[0]*}}, double 1.000000e+00{{[0]*}} }
_Complex double g1y = 1.0fi;
// CHECK: @g1 = global {{%.}} { i8 1, i8 10 }
_Complex char g1 = (char) 1 + (char) 10 * 1i;
// CHECK: @g2 = global %2 { i32 1, i32 10 }
_Complex int g2 = 1 + 10i;
// CHECK: @g3 = global {{%.}} { float 1.000000e+00{{[0]*}}, float 1.000000e+0{{[0]*}}1 }
_Complex float g3 = 1.0 + 10.0i;
// CHECK: @g4 = global {{%.}} { double 1.000000e+00{{[0]*}}, double 1.000000e+0{{[0]*}}1 }
_Complex double g4 = 1.0 + 10.0i;
// CHECK: @g5 = global %2 zeroinitializer
_Complex int g5 = (2 + 3i) == (5 + 7i);
// CHECK: @g6 = global {{%.}} { double -1.100000e+0{{[0]*}}1, double 2.900000e+0{{[0]*}}1 }
_Complex double g6 = (2.0 + 3.0i) * (5.0 + 7.0i);
// CHECK: @g7 = global i32 1
int g7 = (2 + 3i) * (5 + 7i) == (-11 + 29i);
// CHECK: @g8 = global i32 1
int g8 = (2.0 + 3.0i) * (5.0 + 7.0i) == (-11.0 + 29.0i);
// CHECK: @g9 = global i32 0
int g9 = (2 + 3i) * (5 + 7i) != (-11 + 29i);
// CHECK: @g10 = global i32 0
int g10 = (2.0 + 3.0i) * (5.0 + 7.0i) != (-11.0 + 29.0i);
// PR5108
// CHECK: @gv1 = global %4 <{ i32 0, i8 7 }>, align 1
struct {
unsigned long a;
unsigned long b:3;
} __attribute__((__packed__)) gv1 = { .a = 0x0, .b = 7, };
// PR5118
// CHECK: @gv2 = global %5 <{ i8 1, i8* null }>, align 1
struct {
unsigned char a;
char *b;
} __attribute__((__packed__)) gv2 = { 1, (void*)0 };
// Global references
// CHECK: @g11.l0 = internal global i32 ptrtoint (i32 ()* @g11 to i32)
long g11() {
static long l0 = (long) g11;
return l0;
}
// CHECK: @g12 = global i32 ptrtoint (i8* @g12_tmp to i32)
static char g12_tmp;
long g12 = (long) &g12_tmp;
// CHECK: @g13 = global [1 x %struct.g13_s0] [%struct.g13_s0 { i32 ptrtoint (i8* @g12_tmp to i32) }]
struct g13_s0 {
long a;
};
struct g13_s0 g13[] = {
{ (long) &g12_tmp }
};
// CHECK: @g14 = global i8* inttoptr (i64 100 to i8*)
void *g14 = (void*) 100;
// CHECK: @g15 = global i32 -1
int g15 = (int) (char) ((void*) 0 + 255);
// CHECK: @g16 = global i64 4294967295
long long g16 = (long long) ((void*) 0xFFFFFFFF);
// CHECK: @g17 = global i32* @g15
int *g17 = (int *) ((long) &g15);
// CHECK: @g18.p = internal global [1 x i32*] [i32* @g19]
void g18(void) {
extern int g19;
static int *p[] = { &g19 };
}
// CHECK: @g20.l0 = internal global %struct.g20_s1 { %struct.g20_s0* null, %struct.g20_s0** getelementptr inbounds (%struct.g20_s1* @g20.l0, i32 0, i32 0) }
struct g20_s0;
struct g20_s1 {
struct g20_s0 *f0, **f1;
};
void *g20(void) {
static struct g20_s1 l0 = { ((void*) 0), &l0.f0 };
return l0.f1;
}
// PR4108
struct g21 {int g21;};
const struct g21 g21 = (struct g21){1};
// PR5474
struct g22 {int x;} __attribute((packed));
struct g23 {char a; short b; char c; struct g22 d;};
struct g23 g24 = {1,2,3,4};
// CHECK: @__func__.g25 = private constant [4 x i8] c"g25\00"
// CHECK: @g25.g26 = internal global i8* getelementptr inbounds ([4 x i8]* @__func__.g25, i32 0, i32 0)
int g25() {
static const char *g26 = __func__;
return *g26;
}
|
the_stack_data/28262971.c
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <errno.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <netdb.h>
#include <pthread.h>
extern int globalMyID;
//last time you heard from each node. TODO: you will want to monitor this
//in order to realize when a neighbor has gotten cut off from you.
extern struct timeval globalLastHeartbeat[256];
//our all-purpose UDP socket, to be bound to 10.1.1.globalMyID, port 7777
extern int globalSocketUDP;
//pre-filled for sending to 10.1.1.0 - 255, port 7777
extern struct sockaddr_in globalNodeAddrs[256];
//Yes, this is terrible. It's also terrible that, in Linux, a socket
//can't receive broadcast packets unless it's bound to INADDR_ANY,
//which we can't do in this assignment.
void hackyBroadcast(const char* buf, int length)
{
int i;
for(i=0;i<256;i++)
if(i != globalMyID) //(although with a real broadcast you would also get the packet yourself)
sendto(globalSocketUDP, buf, length, 0,
(struct sockaddr*)&globalNodeAddrs[i], sizeof(globalNodeAddrs[i]));
}
void* announceToNeighbors(void* unusedParam)
{
struct timespec sleepFor;
sleepFor.tv_sec = 0;
sleepFor.tv_nsec = 300 * 1000 * 1000; //300 ms
while(1)
{
hackyBroadcast("HEREIAM", 7);
nanosleep(&sleepFor, 0);
}
}
void listenForNeighbors()
{
char fromAddr[100];
struct sockaddr_in theirAddr;
socklen_t theirAddrLen;
unsigned char recvBuf[1000];
int bytesRecvd;
while(1)
{
theirAddrLen = sizeof(theirAddr);
if ((bytesRecvd = recvfrom(globalSocketUDP, recvBuf, 1000 , 0,
(struct sockaddr*)&theirAddr, &theirAddrLen)) == -1)
{
perror("connectivity listener: recvfrom failed");
exit(1);
}
inet_ntop(AF_INET, &theirAddr.sin_addr, fromAddr, 100);
short int heardFrom = -1;
if(strstr(fromAddr, "10.1.1."))
{
heardFrom = atoi(
strchr(strchr(strchr(fromAddr,'.')+1,'.')+1,'.')+1);
//TODO: this node can consider heardFrom to be directly connected to it; do any such logic now.
//record that we heard from heardFrom just now.
gettimeofday(&globalLastHeartbeat[heardFrom], 0);
}
//Is it a packet from the manager? (see mp2 specification for more details)
//send format: 'send'<4 ASCII bytes>, destID<net order 2 byte signed>, <some ASCII message>
if(!strncmp(recvBuf, "send", 4))
{
//TODO send the requested message to the requested destination node
// ...
}
//'cost'<4 ASCII bytes>, destID<net order 2 byte signed> newCost<net order 4 byte signed>
else if(!strncmp(recvBuf, "cost", 4))
{
//TODO record the cost change (remember, the link might currently be down! in that case,
//this is the new cost you should treat it as having once it comes back up.)
// ...
}
//TODO now check for the various types of packets you use in your own protocol
//else if(!strncmp(recvBuf, "your other message types", ))
// ...
}
//(should never reach here)
close(globalSocketUDP);
}
|
the_stack_data/206393089.c
|
extern int abort();
typedef int (*frob)();
frob f[] = {abort};
main()
{
exit(0);
}
|
the_stack_data/90147.c
|
//
// Created by zhangrxiang on 2017/1/8 19:00.
// Location Wuxi
//
//C 库函数 char *strchr(const char *str, int c)
// 在参数 str 所指向的字符串中搜索第一次出现字符 c（一个无符号字符）的位置。
#include <string.h>
#include <stdio.h>
int strchr_main(){
char zing[20];
strcpy(zing,"I like you");
char *string = strchr(zing, ' ');
printf("%s",string);
// like you
// 该函数返回在字符串 str 中第一次出现字符 c 的位置，如果未找到该字符则返回 NULL。
}
|
the_stack_data/71789.c
|
#include <stdlib.h>
int main()
{
int j=1081;
struct
{
signed int m:11;
}l;
if((l.m=j)==j)abort();
exit(0);
}
|
the_stack_data/206392301.c
|
#include <stdio.h>
#include <stdlib.h>
int main(int argc, char const *argv[])
{
//Este é um comentario em linha
printf("Aprendendo Comentarios na Linguagem C\n");
/*
Este é um
grande bloco
de comentarios
*/
return 0;
}
|
the_stack_data/1268700.c
|
#include <stdio.h>
#include <stdlib.h>
int main()
{
int num[]={24,34,12,44,56,17};
int i, *j;
j=&num[0];
for(i=0;i<=5;i++)
{
printf("Address = %u ", j);
printf("element = %d\n", *j);
j++;
}
return 0;
}
|
the_stack_data/86073941.c
|
#include <stdio.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <unistd.h>
int main(int argc, char *argv[])
{
int sockfd;
int len;
struct sockaddr_in address;
int result;
char ch = 'A';
sockfd = socket(AF_INET, SOCK_STREAM, 0);
address.sin_family = AF_INET;
address.sin_addr.s_addr = inet_addr("127.0.0.1");
address.sin_port = htons(9734);
len = sizeof(address);
result = connect(sockfd, (struct sockaddr *)&address, len);
if (result == -1)
{
perror("oops: client1");
exit(1);
}
write(sockfd, &ch, 1);
read(sockfd, &ch, 1);
printf("char from server = %c\n", ch);
close(sockfd);
exit(0);
}
|
the_stack_data/855766.c
|
#include <syslog.h>
#include <stdio.h>
#include <stdlib.h>
int main(int argc, char *argv[]) {
printf("LOG_EMERG %d\n", LOG_EMERG );
printf("LOG_ALERT %d\n", LOG_ALERT );
printf("LOG_CRIT %d\n", LOG_CRIT );
printf("LOG_ERR %d\n", LOG_ERR );
printf("LOG_WARNING %d\n", LOG_WARNING );
printf("LOG_NOTICE %d\n", LOG_NOTICE );
printf("LOG_INFO %d\n", LOG_INFO );
printf("LOG_DEBUG %d\n", LOG_DEBUG );
openlog("test", LOG_PERROR | LOG_PID, LOG_USER);
syslog(LOG_EMERG , "LOG_EMERG ");
syslog(LOG_ALERT , "LOG_ALERT ");
syslog(LOG_CRIT , "LOG_CRIT ");
syslog(LOG_ERR , "LOG_ERR ");
syslog(LOG_WARNING , "LOG_WARNING ");
syslog(LOG_NOTICE , "LOG_NOTICE ");
syslog(LOG_INFO , "LOG_INFO ");
syslog(LOG_DEBUG , "LOG_DEBUG ");
closelog();
return 0;
}
|
the_stack_data/156389189.c
|
/*
* Proccgi
*
* Reads form variables and dumps them on standard output.
* Distributed by the GNU General Public License. Use and be happy.
*
* Frank Pilhofer
* [email protected]
*
* Last changed 11/06/1997
*/
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <ctype.h>
#include <memory.h>
/*
* Duplicate string
*/
char *
FP_strdup (char *string)
{
char *result;
if (string == NULL)
return NULL;
if ((result = (char *) malloc (strlen (string) + 1)) == NULL) {
fprintf (stderr, "proccgi -- out of memory dupping %d bytes\n",
(int) strlen (string));
return NULL;
}
strcpy (result, string);
return result;
}
/*
* Read CGI input
*/
char *
LoadInput (void)
{
char *result, *method, *p;
int length, ts;
if ((method = getenv ("REQUEST_METHOD")) == NULL) {
return NULL;
}
if (strcmp (method, "GET") == 0) {
if ((p = getenv ("QUERY_STRING")) == NULL)
return NULL;
else
result = FP_strdup (p);
}
else if (strcmp (method, "POST") == 0) {
if ((length = atoi (getenv ("CONTENT_LENGTH"))) == 0)
return NULL;
if ((result = malloc (length + 1)) == NULL) {
fprintf (stderr, "proccgi -- out of memory allocating %d bytes\n",
length);
return NULL;
}
if ((ts = fread (result, sizeof (char), length, stdin)) < length) {
fprintf (stderr, "proccgi -- error reading post data, %d bytes read, %d expedted\n",
ts, length);
}
result[length] = '\0';
}
else {
return NULL;
}
return result;
}
/*
* Parse + and %XX in CGI data
*/
char *
ParseString (char *instring)
{
char *ptr1=instring, *ptr2=instring;
if (instring == NULL)
return instring;
while (isspace (*ptr1))
ptr1++;
while (*ptr1) {
if (*ptr1 == '+') {
ptr1++; *ptr2++=' ';
}
else if (*ptr1 == '%' && isxdigit (*(ptr1+1)) && isxdigit (*(ptr1+2))) {
ptr1++;
*ptr2 = ((*ptr1>='0'&&*ptr1<='9')?(*ptr1-'0'):((char)toupper(*ptr1)-'A'+10)) << 4;
ptr1++;
*ptr2++ |= ((*ptr1>='0'&&*ptr1<='9')?(*ptr1-'0'):((char)toupper(*ptr1)-'A'+10));
ptr1++;
}
else
*ptr2++ = *ptr1++;
}
while (ptr2>instring && isspace(*(ptr2-1)))
ptr2--;
*ptr2 = '\0';
return instring;
}
/*
* break into attribute/value pair. Mustn't use strtok, which is
* already used one level below. We assume that the attribute doesn't
* have any special characters.
*/
void
HandleString (char *input)
{
char *data, *ptr, *p2;
if (input == NULL) {
return;
}
data = FP_strdup (input);
ptr = ParseString (data);
/*
* Security:
*
* only accept all-alphanumeric attributes, and don't accept empty
* values
*/
if (!isalpha(*ptr) && *ptr != '_') {free (data); return;}
ptr++;
while (isalnum(*ptr) || *ptr == '_') ptr++;
if (*ptr != '=') {free (data); return;}
*ptr = '\0';
p2 = ptr+1;
fprintf (stdout, "export FORM_%s=\"", data);
/*
* escape value
*/
while (*p2) {
switch (*p2) {
case '"': case '\\': case '`': case '$':
putc ('\\', stdout);
default:
putc (*p2, stdout);
break;
}
p2++;
}
putc ('"', stdout);
putc ('\n', stdout);
*ptr = '=';
free (data);
}
int
main (int argc, char *argv[])
{
char *ptr, *data = LoadInput();
int i;
/*
* Handle CGI data
*/
if (data) {
ptr = strtok (data, "&");
while (ptr) {
HandleString (ptr);
ptr = strtok (NULL, "&");
}
free (data);
}
/*
* Add Path info
*/
if (getenv ("PATH_INFO") != NULL) {
data = FP_strdup (getenv ("PATH_INFO"));
ptr = strtok (data, "/");
while (ptr) {
HandleString (ptr);
ptr = strtok (NULL, "/");
}
free (data);
}
/*
* Add args
*/
for (i=1; i<argc; i++) {
HandleString (argv[i]);
}
/*
* done
*/
return 0;
}
|
the_stack_data/93888545.c
|
#include <stdio.h>
#include <stdbool.h>
/*04.Declare a variable called isFemale and assign an appropriate value corresponding to your gender. Print it on the
console.*/
int main()
{
bool isFamele = false;
printf("%s\n", isFamele ? "true" : "false");
return 0;
}
|
the_stack_data/20849.c
|
#include <ctype.h>
int toupper(int c)
{
if (islower(c)) return c & 0x5f;
return c;
}
|
the_stack_data/141432.c
|
/*
* Copyright (C) 2008 The Android Open Source Project
*
* 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.
*/
static const char* process_name = "unknown";
const char* get_process_name(void) {
return process_name;
}
|
the_stack_data/49183.c
|
// Prints char
#include <stdio.h>
int main(void)
{
char c = '#';
printf("%c\n", c);
}
|
the_stack_data/520658.c
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <CL/cl.h>
unsigned char *read_buffer(char *file_name, size_t *size_ptr)
{
FILE *f;
unsigned char *buf;
size_t size;
/* Open file */
f = fopen(file_name, "rb");
if (!f)
return NULL;
/* Obtain file size */
fseek(f, 0, SEEK_END);
size = ftell(f);
fseek(f, 0, SEEK_SET);
/* Allocate and read buffer */
buf = malloc(size + 1);
fread(buf, 1, size, f);
buf[size] = '\0';
/* Return size of buffer */
if (size_ptr)
*size_ptr = size;
/* Return buffer */
return buf;
}
void write_buffer(char *file_name, const char *buffer, size_t buffer_size)
{
FILE *f;
/* Open file */
f = fopen(file_name, "w+");
/* Write buffer */
if(buffer)
fwrite(buffer, 1, buffer_size, f);
/* Close file */
fclose(f);
}
int main(int argc, char const *argv[])
{
/* Get platform */
cl_platform_id platform;
cl_uint num_platforms;
cl_int ret = clGetPlatformIDs(1, &platform, &num_platforms);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clGetPlatformIDs' failed\n");
exit(1);
}
printf("Number of platforms: %d\n", num_platforms);
printf("platform=%p\n", platform);
/* Get platform name */
char platform_name[100];
ret = clGetPlatformInfo(platform, CL_PLATFORM_NAME, sizeof(platform_name), platform_name, NULL);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clGetPlatformInfo' failed\n");
exit(1);
}
printf("platform.name='%s'\n\n", platform_name);
/* Get device */
cl_device_id device;
cl_uint num_devices;
ret = clGetDeviceIDs(platform, CL_DEVICE_TYPE_GPU, 1, &device, &num_devices);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clGetDeviceIDs' failed\n");
exit(1);
}
printf("Number of devices: %d\n", num_devices);
printf("device=%p\n", device);
/* Get device name */
char device_name[100];
ret = clGetDeviceInfo(device, CL_DEVICE_NAME, sizeof(device_name),
device_name, NULL);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clGetDeviceInfo' failed\n");
exit(1);
}
printf("device.name='%s'\n", device_name);
printf("\n");
/* Create a Context Object */
cl_context context;
context = clCreateContext(NULL, 1, &device, NULL, NULL, &ret);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clCreateContext' failed\n");
exit(1);
}
printf("context=%p\n", context);
/* Create a Command Queue Object*/
cl_command_queue command_queue;
command_queue = clCreateCommandQueue(context, device, 0, &ret);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clCreateCommandQueue' failed\n");
exit(1);
}
printf("command_queue=%p\n", command_queue);
printf("\n");
/* Program source */
unsigned char *source_code;
size_t source_length;
/* Read program from 'native_recip_float16.cl' */
source_code = read_buffer("native_recip_float16.cl", &source_length);
/* Create a program */
cl_program program;
program = clCreateProgramWithSource(context, 1, (const char **)&source_code, &source_length, &ret);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clCreateProgramWithSource' failed\n");
exit(1);
}
printf("program=%p\n", program);
/* Build program */
ret = clBuildProgram(program, 1, &device, NULL, NULL, NULL);
if (ret != CL_SUCCESS )
{
size_t size;
char *log;
/* Get log size */
clGetProgramBuildInfo(program, device, CL_PROGRAM_BUILD_LOG,0, NULL, &size);
/* Allocate log and print */
log = malloc(size);
clGetProgramBuildInfo(program, device, CL_PROGRAM_BUILD_LOG,size, log, NULL);
printf("error: call to 'clBuildProgram' failed:\n%s\n", log);
/* Free log and exit */
free(log);
exit(1);
}
printf("program built\n");
printf("\n");
/* Create a Kernel Object */
cl_kernel kernel;
kernel = clCreateKernel(program, "native_recip_float16", &ret);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clCreateKernel' failed\n");
exit(1);
}
/* Create and allocate host buffers */
size_t num_elem = 10;
/* Create and init host side src buffer 0 */
cl_float16 *src_0_host_buffer;
src_0_host_buffer = malloc(num_elem * sizeof(cl_float16));
for (int i = 0; i < num_elem; i++)
src_0_host_buffer[i] = (cl_float16){{2.0, 2.0, 2.0, 2.0, 2.0, 2.0, 2.0, 2.0, 2.0, 2.0, 2.0, 2.0, 2.0, 2.0, 2.0, 2.0}};
/* Create and init device side src buffer 0 */
cl_mem src_0_device_buffer;
src_0_device_buffer = clCreateBuffer(context, CL_MEM_READ_ONLY, num_elem * sizeof(cl_float16), NULL, &ret);
if (ret != CL_SUCCESS)
{
printf("error: could not create source buffer\n");
exit(1);
}
ret = clEnqueueWriteBuffer(command_queue, src_0_device_buffer, CL_TRUE, 0, num_elem * sizeof(cl_float16), src_0_host_buffer, 0, NULL, NULL);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clEnqueueWriteBuffer' failed\n");
exit(1);
}
/* Create host dst buffer */
cl_float16 *dst_host_buffer;
dst_host_buffer = malloc(num_elem * sizeof(cl_float16));
memset((void *)dst_host_buffer, 1, num_elem * sizeof(cl_float16));
/* Create device dst buffer */
cl_mem dst_device_buffer;
dst_device_buffer = clCreateBuffer(context, CL_MEM_WRITE_ONLY, num_elem *sizeof(cl_float16), NULL, &ret);
if (ret != CL_SUCCESS)
{
printf("error: could not create dst buffer\n");
exit(1);
}
/* Set kernel arguments */
ret = CL_SUCCESS;
ret |= clSetKernelArg(kernel, 0, sizeof(cl_mem), &src_0_device_buffer);
ret |= clSetKernelArg(kernel, 1, sizeof(cl_mem), &dst_device_buffer);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clSetKernelArg' failed\n");
exit(1);
}
/* Launch the kernel */
size_t global_work_size = num_elem;
size_t local_work_size = num_elem;
ret = clEnqueueNDRangeKernel(command_queue, kernel, 1, NULL, &global_work_size, &local_work_size, 0, NULL, NULL);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clEnqueueNDRangeKernel' failed\n");
exit(1);
}
/* Wait for it to finish */
clFinish(command_queue);
/* Read results from GPU */
ret = clEnqueueReadBuffer(command_queue, dst_device_buffer, CL_TRUE,0, num_elem * sizeof(cl_float16), dst_host_buffer, 0, NULL, NULL);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clEnqueueReadBuffer' failed\n");
exit(1);
}
/* Dump dst buffer to file */
char dump_file[100];
sprintf((char *)&dump_file, "%s.result", argv[0]);
write_buffer(dump_file, (const char *)dst_host_buffer, num_elem * sizeof(cl_float16));
printf("Result dumped to %s\n", dump_file);
/* Free host dst buffer */
free(dst_host_buffer);
/* Free device dst buffer */
ret = clReleaseMemObject(dst_device_buffer);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clReleaseMemObject' failed\n");
exit(1);
}
/* Free host side src buffer 0 */
free(src_0_host_buffer);
/* Free device side src buffer 0 */
ret = clReleaseMemObject(src_0_device_buffer);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clReleaseMemObject' failed\n");
exit(1);
}
/* Release kernel */
ret = clReleaseKernel(kernel);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clReleaseKernel' failed\n");
exit(1);
}
/* Release program */
ret = clReleaseProgram(program);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clReleaseProgram' failed\n");
exit(1);
}
/* Release command queue */
ret = clReleaseCommandQueue(command_queue);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clReleaseCommandQueue' failed\n");
exit(1);
}
/* Release context */
ret = clReleaseContext(context);
if (ret != CL_SUCCESS)
{
printf("error: call to 'clReleaseContext' failed\n");
exit(1);
}
return 0;
}
|
the_stack_data/169362.c
|
#include<stdio.h>
int comb_num(int, int);
int main()
{
int m, n;
scanf("%d%d", &m, &n);
printf("%d", comb_num(m, n));
return 0;
}
int comb_num(int m, int n)
{
if ( m<n || m<1 || n<1 ) return 0;
if ( n == 1 ) return m;
if ( n == m ) return 1;
return comb_num(m-1, n) + comb_num(m-1, n-1);
}
|
the_stack_data/126703570.c
|
/*
* Copyright 2011 The Emscripten Authors. All rights reserved.
* Emscripten is available under two separate licenses, the MIT license and the
* University of Illinois/NCSA Open Source License. Both these licenses can be
* found in the LICENSE file.
*/
#include <stdio.h>
#include <errno.h>
#include <unistd.h>
int main() {
int vals[] = {
_CS_PATH,
_CS_POSIX_V6_WIDTH_RESTRICTED_ENVS,
_CS_GNU_LIBC_VERSION,
_CS_GNU_LIBPTHREAD_VERSION,
_CS_POSIX_V6_ILP32_OFF32_LIBS,
_CS_POSIX_V6_ILP32_OFFBIG_LIBS,
_CS_POSIX_V6_LP64_OFF64_CFLAGS,
_CS_POSIX_V6_LP64_OFF64_LDFLAGS,
_CS_POSIX_V6_LP64_OFF64_LIBS,
_CS_POSIX_V6_LPBIG_OFFBIG_CFLAGS,
_CS_POSIX_V6_LPBIG_OFFBIG_LDFLAGS,
_CS_POSIX_V6_LPBIG_OFFBIG_LIBS,
_CS_POSIX_V6_ILP32_OFF32_CFLAGS,
_CS_POSIX_V6_ILP32_OFF32_LDFLAGS,
_CS_POSIX_V6_ILP32_OFFBIG_LDFLAGS,
_CS_POSIX_V6_ILP32_OFFBIG_CFLAGS
};
const char* names[] = {
"_CS_PATH",
"_CS_POSIX_V6_WIDTH_RESTRICTED_ENVS",
"_CS_GNU_LIBC_VERSION",
"_CS_GNU_LIBPTHREAD_VERSION",
"_CS_POSIX_V6_ILP32_OFF32_LIBS",
"_CS_POSIX_V6_ILP32_OFFBIG_LIBS",
"_CS_POSIX_V6_LP64_OFF64_CFLAGS",
"_CS_POSIX_V6_LP64_OFF64_LDFLAGS",
"_CS_POSIX_V6_LP64_OFF64_LIBS",
"_CS_POSIX_V6_LPBIG_OFFBIG_CFLAGS",
"_CS_POSIX_V6_LPBIG_OFFBIG_LDFLAGS",
"_CS_POSIX_V6_LPBIG_OFFBIG_LIBS",
"_CS_POSIX_V6_ILP32_OFF32_CFLAGS",
"_CS_POSIX_V6_ILP32_OFF32_LDFLAGS",
"_CS_POSIX_V6_ILP32_OFFBIG_LDFLAGS",
"_CS_POSIX_V6_ILP32_OFFBIG_CFLAGS"
};
char buffer[256];
for (int i = 0; i < sizeof vals / sizeof vals[0]; i++) {
printf("ret: %zi\n", confstr(vals[i], buffer, 256));
printf("%s: %s\n", names[i], buffer);
printf("errno: %d\n\n", errno);
errno = 0;
}
printf("(invalid) ret: %zi\n", confstr(-123, buffer, 256));
printf("errno: %d\n", errno);
return 0;
}
|
the_stack_data/46195.c
|
/**
* @file
* @brief A program to determine if a string is a palindrome or not
*/
#include <assert.h> // for assert function (for tests)
#include <stdbool.h> // for bool data type
#include <string.h> // for strlen function
/**
* @brief Determines if the input `string` is a palindrome or not
* @param string the string (array of characters) to be checked
* @returns true if `string` is a palindrome
* @returns false if `string` is not a palindrome
*/
bool isPalindrome(const char string[]) {
int lengthOfString = strlen(string); // the length of `string`
// iterates over the `string`
for(int i = 0; i < lengthOfString / 2; i++) {
// checks if elements at adjacent ends of `string` are different
if(string[i] != string[lengthOfString - i - 1]) {
// if they are different,
return false;
}
}
// otherwise,
return true;
}
/**
* @brief Self-test Implementations
* @returns void
*/
void test(void) {
char *str = "abbbba";
assert(isPalindrome(str) == true);
str = "randy";
assert(isPalindrome(str) == false);
}
/**
* @brief Main function
* @returns 0 on exit
*/
int main(void) {
test(); // runs self-test implementation of the program
return 0;
}
|
the_stack_data/81395.c
|
// Copyright 2015 ChaiShushan <chaishushan{AT}gmail.com>. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
#ifndef CAPI_EXPORT
# if defined(__EMSCRIPTEN__)
# include <emscripten.h>
# if defined(__cplusplus)
# define CAPI_EXPORT(rettype) extern "C" rettype EMSCRIPTEN_KEEPALIVE
# else
# define CAPI_EXPORT(rettype) rettype EMSCRIPTEN_KEEPALIVE
# endif
# else
# if defined(__cplusplus)
# define CAPI_EXPORT(rettype) extern "C" rettype
# else
# define CAPI_EXPORT(rettype) rettype
# endif
# endif
#endif
extern int src, debug;
extern int main(int argc, char **argv);
CAPI_EXPORT(int) c4Run(char* filename, int printSource, int isDebugMode) {
int argc = 1;
char *argv[] = { "c4", "", "", "" };
src = 0;
debug = 0;
if(printSource) {
argv[argc++] = "-s";
}
if(isDebugMode) {
argv[argc++] = "-d";
}
if(filename != 0) {
argv[argc++] = filename;
}
return main(argc, argv);
}
|
the_stack_data/101920.c
|
extern int __VERIFIER_nondet_int();
extern void __VERIFIER_error();
int fibo1(int n) {
if (n < 1) {
return 0;
} else if (n == 1) {
return 1;
} else {
return fibo2(n-1) + fibo2(n-2);
}
}
int fibo2(int n) {
if (n < 1) {
return 0;
} else if (n == 1) {
return 1;
} else {
return fibo1(n-1) + fibo1(n-2);
}
}
// fibo 1-30
// 1, 1, 2, 3, 5,
// 8, 13, 21, 34, 55,
// 89, 144, 233, 377, 610,
// 987, 1597, 2584, 4181, 6765,
// 10946, 17711, 28657, 46368, 75025,
// 121393, 196418, 317811, 514229, 832040
int main() {
int x = 5;
int result = fibo1(x);
if (result == 5) {
__VERIFIER_error();
}
return 0;
}
|
the_stack_data/232956988.c
|
#include <stdlib.h>
char * ptsname(int fildes)
{
return NULL;
}
/*
XOPEN(400)
*/
|
the_stack_data/93887553.c
|
#include<stdio.h>
// Implement insertion sort
void swap(int *a, int *b) {
int temp = *a;
*a = *b;
*b = temp;
}
// NOTE: In c language, it is impossible to get the length of array
// after you pass the array into a function.
// For example,
// void sort(int array) {
// int i, j;
// size_t len = sizeof(array) / sizeof(int);
// the value of len would not fit our expectation
// }
void sort(int array[], size_t len) {
int i, j, temp;
for (i = 1; i < len; i ++) {
temp = array[i];
for (j = i - 1; j >= 0 && array[j] > temp; j --) {
array[j+1] = array[j];
}
array[j + 1] = temp;
}
}
void printArr(int array[], size_t len) {
int i = 0;
for (i = 0; i < len; i ++) {
printf("%d ", array[i]);
}
}
int main(void) {
// 7
int testArr[] = {2, 61, 23, 231, 51, 56, 66};
printArr(testArr, sizeof(testArr) / sizeof(int));
printf("\n");
sort(testArr, sizeof(testArr) / sizeof(int));
printf("\n");
printArr(testArr, sizeof(testArr) / sizeof(int));
return 0;
}
|
the_stack_data/122015397.c
|
/* Jonathan Frech, 9th, 12th of June 2020 */
#include <stdlib.h>
#include <stdio.h>
#include <stdint.h>
#include <stdbool.h>
#include <string.h>
#include <time.h>
typedef enum { UNKNOWN, AIR, WALL, START, END } tile_t;
typedef struct { size_t w, h; tile_t *data; bool found_end; } maze_t;
maze_t *malloc_maze(size_t w, size_t h) {
tile_t *data = malloc(w * h * sizeof *data);
if (!data) return NULL;
for (size_t j = 0; j < w * h; j++)
data[j] = UNKNOWN;
maze_t *maze = malloc(sizeof *maze);
if (!maze) return free(data), NULL;
maze->data = data, maze->w = w, maze->h = h; maze->found_end = false;
return maze; }
void free_maze(maze_t *maze) {
free(maze->data), free(maze); }
void add_border(maze_t *maze) {
for (size_t x = 0; x < maze->w; x++)
maze->data[x + maze->w* 0]
= maze->data[x + maze->w* (maze->h-1)] = WALL;
for (size_t y = 0; y < maze->h; y++)
maze->data[0 + maze->w* y]
= maze->data[(maze->w-1) + maze->w* y] = WALL; }
size_t add_start(maze_t *maze) {
size_t s = rand() % (maze->w-2) + 1;
maze->data[s + maze->w* 0] = START;
return s; }
void print_maze(maze_t *maze) {
for (size_t y = 0; y < maze->h; y++) {
for (size_t x = 0; x < maze->w; x++) {
tile_t t = maze->data[x +maze->w* y];
if (t == AIR || t == START || t == END)
printf("\33[47m \33[0m");
else if (t == WALL)
printf("\33[100m \33[0m");
else if (t == UNKNOWN)
printf("\33[40m? \33[0m");
else
printf("\33[101m??\33[0m"); }
printf("\n"); } }
void print_maze_ppm(maze_t *maze) {
printf("P1\n%zu %zu\n", maze->w, maze->h);
for (size_t y = 0; y < maze->h; y++) {
for (size_t x = 0; x < maze->w; x++)
printf("%s%d", x ? " " : "", (maze->data[x +maze->w* y] == WALL));
printf("\n"); } }
void surrounding(size_t x, size_t y, maze_t *maze,
tile_t *u, tile_t *d, tile_t *l, tile_t *r) {
*u = maze->data[ x + maze->w* (y-1)];
*d = maze->data[ x + maze->w* (y+1)];
*l = maze->data[(x-1) + maze->w* y ];
*r = maze->data[(x+1) + maze->w* y ]; }
size_t number_of_surrounding_air(size_t x, size_t y, maze_t *maze) {
tile_t surrounding[8] = {
maze->data[ (x-1) + maze->w* (y )],
maze->data[ (x+1) + maze->w* (y )],
maze->data[ (x ) + maze->w* (y-1)],
maze->data[ (x ) + maze->w* (y+1)],
maze->data[ (x-1) + maze->w* (y-1)],
maze->data[ (x-1) + maze->w* (y+1)],
maze->data[ (x+1) + maze->w* (y-1)],
maze->data[ (x+1) + maze->w* (y+1)],
};
size_t n = 0;
for (size_t j = 0; j < 8; j++)
n += surrounding[j] == AIR;
return n; }
char all_directions[24][5] = {
"ruld", "urld", "lurd", "ulrd", "lrud", "rlud", "dlur", "ldur", "ludr",
"dulr", "udlr", "uldr", "drul", "rdul", "rudl", "durl", "udrl", "urdl",
"drlu", "rdlu", "rldu", "dlru", "ldru", "lrdu" };
void walk(size_t x, size_t y, maze_t *maze) {
maze->data[x +maze->w* y] = AIR;
if (y == maze->h-2 && !maze->found_end) {
maze->found_end = true;
maze->data[x +maze->w* (y+1)] = END; }
for (char *dirs = all_directions[rand() % 24]; *dirs; dirs++) {
size_t x_ = x, y_ = y, n = 0;
switch (*dirs) {
case 'u':
y_--;
n += maze->data[ (x_-1) +maze->w* (y_+1)] == AIR;
n += maze->data[ (x_ ) +maze->w* (y_+1)] == AIR;
n += maze->data[ (x_+1) +maze->w* (y_+1)] == AIR;
break;
case 'd':
y_++;
n += maze->data[ (x_-1) +maze->w* (y_-1)] == AIR;
n += maze->data[ (x_ ) +maze->w* (y_-1)] == AIR;
n += maze->data[ (x_+1) +maze->w* (y_-1)] == AIR;
break;
case 'l':
x_--;
n += maze->data[ (x_+1) +maze->w* (y_-1)] == AIR;
n += maze->data[ (x_+1) +maze->w* (y_ )] == AIR;
n += maze->data[ (x_+1) +maze->w* (y_+1)] == AIR;
break;
case 'r':
x_++;
n += maze->data[ (x_-1) +maze->w* (y_-1)] == AIR;
n += maze->data[ (x_-1) +maze->w* (y_ )] == AIR;
n += maze->data[ (x_-1) +maze->w* (y_+1)] == AIR;
break;
}
if (maze->data[x_ +maze->w* y_] != UNKNOWN)
continue;
if (number_of_surrounding_air(x_, y_, maze) - n == 0)
walk(x_, y_, maze); } }
void mystify_air(maze_t *maze) {
for (size_t y = 0; y < maze->h; y++)
for (size_t x = 0; x < maze->w; x++)
if (maze->data[x +maze->w* y] == AIR)
maze->data[x +maze->w* y] = UNKNOWN; }
void turn_unknowns_into_walls(maze_t *maze) {
for (size_t j = 0; j < maze->w*maze->h; j++)
if (maze->data[j] == UNKNOWN)
maze->data[j] = WALL; }
void print_usage() {
printf("Usage: maze [--ppm] <w> <h>\n"); }
int main(int argc, char **argv) {
if (argc < 2) return print_usage(), EXIT_FAILURE;
bool ppm = strcmp(argv[1], "--ppm") == 0;
long w_, h_;
if (ppm) {
if (argc != 4) return print_usage(), EXIT_FAILURE;
w_ = atol(argv[2]), h_ = atol(argv[3]); }
else {
if (argc != 3) return print_usage(), EXIT_FAILURE;
w_ = atol(argv[1]), h_ = atol(argv[2]); }
if (w_ < 3 || h_ < 3)
return print_usage(), EXIT_FAILURE;
size_t w = (size_t) w_, h = (size_t) h_;
srand(time(NULL));
maze_t *maze = malloc_maze(w, h);
if (!maze)
return fprintf(stderr, "Memory allocation failed.\n"), EXIT_FAILURE;
add_border(maze);
size_t s = add_start(maze);
while (!maze->found_end) {
mystify_air(maze);
walk(s, 1, maze); }
turn_unknowns_into_walls(maze);
if (ppm)
print_maze_ppm(maze);
else
print_maze(maze);
free_maze(maze);
return EXIT_SUCCESS; }
|
the_stack_data/154830607.c
|
/*
* Copyright (c) Huawei Technologies Co., Ltd. 2012-2021. All rights reserved.
*/
static char **file_list = 0;
static char *stdin_argv[] = { (char *)"-", 0 };
static void set_file_list(char **list) {
if (!list)
file_list = stdin_argv;
else
file_list = list;
}
|
the_stack_data/151568.c
|
void
fpEq (double x, double y)
{
if (x != y)
abort ();
}
void
fpTest (double x, double y)
{
double result1 = (35.7 * 100.0) / 45.0;
double result2 = (x * 100.0) / y;
fpEq (result1, result2);
}
main ()
{
fpTest (35.7, 45.0);
exit (0);
}
|
the_stack_data/30913.c
|
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
int euclid_gcd_naive(int a, int b)
{
int dividend = a >= b ? a : b;
int divisor = a <= b ? a : b;
while (divisor != 0)
{
int remainder = dividend % divisor;
dividend = divisor;
divisor = remainder;
}
return dividend;
}
int euclid_gcd_compressed(int a, int b)
{
while (b != 0)
{
int remainder = a % b;
a = b;
b = remainder;
}
return a;
}
int euclid_recursive(int a, int b)
{
return b == 0 ? a : euclid_recursive(b, a % b);
}
int main()
{
int a = 105;
int b = 350;
int gcd_naive = euclid_gcd_naive(a, b);
int gcd_compressed = euclid_gcd_compressed(a, b);
int gcd_recursive = euclid_recursive(a, b);
printf("gcd(%d,%d) = %d\n", a, b, gcd_naive);
printf("gcd(%d,%d) = %d\n", a, b, gcd_compressed);
printf("gcd(%d,%d) = %d\n", a, b, euclid_recursive(a, b));
}
|
the_stack_data/1109277.c
|
/* Using getchar() to write words.
It's best to type 4 characters on one line.*/
#include <stdio.h>
int main() {
printf("Enter 5 characters:\n");
char arr[5];
for (int i = 0; i < 5; i++) { // on every loop put the entered char into an array index.
arr[i] = getchar();
}
printf("\nThe result:\n");
for (int j = 0; j < 5; j++) { // on every loop print the arrays' index number
printf("%c", arr[j]);
}
printf("\n");
}
|
the_stack_data/125140289.c
|
/*
ID:lindong6
PROG:friday
LANG:C++
*/
#include <stdio.h>
int days[13]={0,31,0,31,30,31,30,31,31,30,31,30,31};
int week[8]={0,0,0,0,0,0,0,0};
int isMore(int year){
return (year%400==0||(year%4==0&&year%100!=0));
}
int main(){
freopen("friday.in","r",stdin);
freopen("friday.out","w",stdout);
int year=1900,mon=1,day=1,weekday=1,N;
scanf("%d",&N);
while(year<1900+N){
days[2]=isMore(year)?29:28;
while(mon<=12){
int DAYinMON=days[mon];
while(day<=DAYinMON){
if(day==13)week[weekday%7]++;
day++;weekday++;
}
day=1;
mon++;
}
mon=1;
year++;
}
printf("%d %d %d %d %d %d %d\n",week[6],week[0],week[1],week[2],week[3],week[4],week[5]);
return 0;
}
|
the_stack_data/18886796.c
|
/* { dg-do compile } */
/* { dg-options "-O1 -fdump-tree-dom3" } */
/* LLVM LOCAL test not applicable */
/* { dg-require-fdump "" } */
extern void abort (void);
typedef unsigned int size_t;
struct rtx_def;
typedef struct rtx_def *rtx;
typedef union varray_data_tag
{
struct reg_info_def *reg[1];
} varray_data;
struct varray_head_tag
{
size_t num_elements;
varray_data data;
};
typedef struct varray_head_tag *varray_type;
typedef struct reg_info_def
{
} reg_info;
extern varray_type reg_n_info;
static rtx *reg_base_value;
static rtx *new_reg_base_value;
rtx
blah (unsigned int regno)
{
if (new_reg_base_value[regno] && ((*(
{
if (regno >=
reg_n_info->
num_elements)
abort ();
®_n_info->data.reg[regno];}
))))
return reg_base_value[regno];
}
/* If we have more than 1 cast to a struct rtx_def * *, then we failed to
eliminate some useless typecasting. The first type cast is needed
to convert the unsigned int regno parameter into a struct rtx_def **. */
/* { dg-final { scan-tree-dump-times "\\(struct rtx_def \\* \\*\\)" 1 "dom3"} } */
/* { dg-final { cleanup-tree-dump "dom3" } } */
|
the_stack_data/1240050.c
|
/*
Copyright (c) 2017, Massachusetts Institute of Technology All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright notice, this
list of conditions and the following disclaimer in the documentation and/or
other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 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.
*/
// issort.c
//-------------------------------------------------------------------------
// Stuart Sherman
// MIT / PSFC
// Cambridge, MA 02139 USA
//
// This is a port of the MDSplus system software from VMS to Linux,
// specifically:
// CAMAC subsystem, ie libCamShr.so and verbs.c for CTS.
//-------------------------------------------------------------------------
// $Id$
//-------------------------------------------------------------------------
//-------------------------------------------------------------------------
// include files
//-------------------------------------------------------------------------
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <errno.h>
#include <fcntl.h>
#include <sys/ipc.h>
#include <sys/mman.h>
#include <sys/sem.h>
#include <sys/stat.h>
#include <sys/types.h>
//-------------------------------------------------------------------------
// issort()
// Thu Jan 11 13:49:03 EST 2001
//-------------------------------------------------------------------------
// insertion sort
// The entry to be inserted is in the first location, subsequent entries
// are sorted. Only 1 pass through the list is needed, so algorithm is
// fairly fast.
//-------------------------------------------------------------------------
// input: see parameter list
// output: always 0
//-------------------------------------------------------------------------
// NB! Copied from : "Mastering Algorithms with C", Kyle Loudon,
// O'Reilly & Associates, (c) 1999
// ISBN: 1-56592-453-3
//-------------------------------------------------------------------------
int issort(void *data, int size, int esize,
int (*compare)(const void *key1, const void *key2))
{
void *key;
char *a = data;
int i, j;
// Allocate storage for the key element.
if ((key = (char *)malloc(esize)) == NULL)
return -1;
// Repeatedly insert a key element among the sorted elements.
for (j = 1; j < size; ++j)
{
memcpy(key, &a[j * esize], esize);
i = j - 1;
// Determine the position at which to insert the key element.
while (i >= 0 && compare(&a[i * esize], key) > 0)
{
memcpy(&a[(i + 1) * esize], &a[i * esize], esize);
i--;
}
memcpy(&a[(i + 1) * esize], key, esize);
}
// Free the storage allocated for sorting.
free(key);
return 0;
}
|
the_stack_data/757216.c
|
/* Exercise 1 - Calculations
Write a C program to input marks of two subjects. Calculate and print the average of the two marks. */
#include <stdio.h>
int main(void) {
int mark1,mark2,total;
float avg;
printf("Enter Marks for Subject 1 :");
scanf("%d",&mark1);
printf("Enter Marks for Subject 2 :");
scanf("%d",&mark2);
total=mark1+mark2;
avg = total/2.0;
printf("Average : %.2f",avg);
return 0;
}
|
the_stack_data/125141101.c
|
//Calcul de la variança d'un nombre n d'elements
#include<stdio.h>
#include<stdlib.h>
int main()
{
double n; /*nombre de mostres: SEMPRE FLOAT o DOUBLE*/
int i;
double var, mitjana;
double *dades; //creo un vector amb les dades, de dimensió que dirà l'usuari
int resposta;
printf("Digues el nombre d'elements dels que vols calcular la variança:\n");
scanf("%lf", &n);
dades=calloc(n,sizeof(double));
if (dades==NULL)
{
printf("Hi ha un error");
free(dades);
return 1;
}
printf("Vols introduir les dades manualment? 1 si, 2 no.\n");
scanf("%d", &resposta);
if (resposta==1) {
for (i=0; i<=(n-1); i++) //emplenem les caselles del vector
{
printf("Escriu el nombre %d:", i+1);
scanf("%lf", &dades[i]);
}
}
else if (resposta==2) {
for (i=0; i<=(n-1); i++)
{
dades[i]=i;
}
}
else {
printf ("Has triat una opcio que no es valida");
return 0;
}
mitjana=0;
for (i=0; i<=(n-1); i++)
{
mitjana=(1./n)*(dades[i]) + mitjana; //COMPTE: si divivim enter per enter (1 entre n-1) fa la divisió entera, i p.ex, 1/2=0! Hem de posar "1."
}
printf("La mitjana dels nombres es: %.16f\n", mitjana);
var=0;
for (i=0; i<=(n-1); i++)
{
var=(1./(n-1))*((dades[i]-mitjana)*(dades[i]-mitjana)) + var;
}
printf("La variança dels nombres es %.16f\n", var);
//Alliberem la memòria del vector dades
free(dades);
dades=NULL;
return 0;
}
|
the_stack_data/58351.c
|
/*
* Copyright 2008-2016 The OpenSSL Project Authors. All Rights Reserved.
*
* Licensed under the OpenSSL license (the "License"). You may not use
* this file except in compliance with the License. You can obtain a copy
* in the file LICENSE in the source distribution or at
* https://www.openssl.org/source/license.html
*/
/* Simple S/MIME verification example */
#include <openssl/pem.h>
#include <openssl/cms.h>
#include <openssl/err.h>
int main(int argc, char **argv)
{
BIO *in = NULL, *out = NULL, *tbio = NULL, *cont = NULL;
X509_STORE *st = NULL;
X509 *cacert = NULL;
CMS_ContentInfo *cms = NULL;
int ret = 1;
OpenSSL_add_all_algorithms();
ERR_load_crypto_strings();
/* Set up trusted CA certificate store */
st = X509_STORE_new();
/* Read in CA certificate */
tbio = BIO_new_file("cacert.pem", "r");
if (!tbio)
goto err;
cacert = PEM_read_bio_X509(tbio, NULL, 0, NULL);
if (!cacert)
goto err;
if (!X509_STORE_add_cert(st, cacert))
goto err;
/* Open message being verified */
in = BIO_new_file("smout.txt", "r");
if (!in)
goto err;
/* parse message */
cms = SMIME_read_CMS(in, &cont);
if (!cms)
goto err;
/* File to output verified content to */
out = BIO_new_file("smver.txt", "w");
if (!out)
goto err;
if (!CMS_verify(cms, NULL, st, cont, out, 0)) {
fprintf(stderr, "Verification Failure\n");
goto err;
}
fprintf(stderr, "Verification Successful\n");
ret = 0;
err:
if (ret) {
fprintf(stderr, "Error Verifying Data\n");
ERR_print_errors_fp(stderr);
}
CMS_ContentInfo_free(cms);
X509_free(cacert);
BIO_free(in);
BIO_free(out);
BIO_free(tbio);
return ret;
}
|
the_stack_data/54826581.c
|
#include<stdio.h>
//使用指针作为函数参数
//交换两个数位置
void swap(int *a,int *b){
int s = *a;
*a = *b;
*b = s;
}
int main(){
int a = 1;
int b = 2;
swap(&a,&b);
printf("a = %d\nb = %d\n",a,b);
int s[10];
int (*p)[5] = &s;
getchar();
}
|
the_stack_data/75137441.c
|
#include <stdio.h>
int max(int s1, int s2);
int min(int s1, int s2);
int main()
{
int a, b;
printf("iki sayi girin: ");
;
scanf("%d %d", &a, &b);
printf("sayilardan kucuk olan: %d\n", min(a, b));
printf("sayilardan buyuk olan: %d\n", max(a, b));
return 0;
}
int max(int s1, int s2)
{
if (s1 > s2)
return s1;
else
return s2;
}
int min(int s1, int s2)
{
if (s1 < s2)
return s1;
else
return s2;
}
|
the_stack_data/32440.c
|
/* This program illustrates a number of perhaps confusing features of
* signal delivery. It shows how signals can be blocked, how pending
* signals are merged, how you can jump out of a signal handler into
* another, how resetting signal handlers differ from non-resetting signal
* handlers and how to check whether or not pending signals are of a
* certain type.
*
* You want to run this program a number of times to illustrate all of the
* different features. Hopefully the commentary in the code below will
* help you remember all the things you want to demonstrate.
*/
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#ifndef SLEEP
#define SLEEP 5
#endif
int s = 0;
void
sig_quit_reset(int signo) {
fprintf(stderr, "sig_quit_reset: caught SIGQUIT (%d), sleeping and resetting.\n", ++s);
sleep(SLEEP);
if (signal(SIGQUIT, SIG_DFL) == SIG_ERR) {
fprintf(stderr, "can't reset SIGQUIT\n");
exit(1);
}
fprintf(stderr, "sig_quit_reset: restored SIGQUIT handler to default.\n");
}
void
sig_quit(int signo) {
fprintf(stderr, "sig_quit: caught SIGQUIT (%d), now sleeping\n", ++s);
sleep(SLEEP);
fprintf(stderr, "sig_quit: exiting (%d)\n", s);
}
void
sig_int(int signo) {
fprintf(stderr, "sig_int: caught SIGINT (%d), returning immediately\n", ++s);
}
int main() {
sigset_t newmask, oldmask, pendmask;
int ismember = 0;
printf("\n=> Establishing initial signal hander via signal(3).\n");
if(signal(SIGQUIT, sig_quit) == SIG_ERR) {
fprintf(stderr, "can't set signal handler\n");
exit(1);
}
if(signal(SIGINT, sig_int) == SIG_ERR) {
fprintf(stderr, "can't set signal handler\n");
exit(1);
}
/* Hit ^\ to jump into sig_quit.
* Hit ^\ again and note that we're not interrupting the sleep
* inside the sig_quit handler. However, the signal gets
* delivered once sig_quit finishes, so we re-enter sig_quit.
*
* Multiple signals of the same kind are merged, so hitting ^\
* multiple times while in sig_quit only yields a single signal
* being delivered after we finish in sig_quit.
*
* However: hit ^\, then ^C and note that sig_int executes
* immediately. We were transferred out of sig_quit, then
* returned immediately back into sig_quit.
*
* If we start with one ^\ followed by ^C, then we immediately
* move on establishing the resetting signal handler; if we hit ^\
* multiple times followed by ^C, then our first ^\ is caught, the
* subsequent ones are merged and queued, sig_int is executed and
* the queued ^\ delivered.
*/
sleep(SLEEP);
printf("\n=> Time for a second interruption.\n");
sleep(SLEEP);
printf("\n=> Establishing a resetting signal hander via signal(3).\n");
if(signal(SIGQUIT, sig_quit_reset) == SIG_ERR) {
fprintf(stderr, "can't set signal handler\n");
exit(1);
}
/* If we repeat the same thing here, things are rather different:
* Hit ^\ and we jump into sig_quit_reset, which resets the signal
* disposition to the original default (which is to quit with a
* core dump). If you hit ^\ while in sig_quit_reset, the signal
* is queued and delivered as soon as the signal handler
* terminates. At that point, however, the default signal handler
* has been installed, and the program exits.
*
* If we do not deliver a second ^\, then we establish a blocking
* mask for this signal, allowing multiple subsequent ^\ to be
* blocked. We then report on whether or not we have any, and
* finally unblock them, ready to be delivered (to the default
* handler).
*/
sleep(SLEEP);
printf("\n=> Time for a second interruption.\n");
sleep(SLEEP);
sigemptyset(&newmask);
sigaddset(&newmask, SIGQUIT);
printf("\n=> Blocking delivery of SIGQUIT...\n");
if (sigprocmask(SIG_BLOCK, &newmask, &oldmask) < 0) {
fprintf(stderr, "SIG_BLOCK error\n");
exit(1);
}
printf("\n=> Now going to sleep for %d seconds...\n", SLEEP);
sleep(SLEEP);
printf("\n=> Checking if any signals are pending...\n");
if (sigpending(&pendmask) < 0) {
fprintf(stderr, "sigpending error\n");
exit(1);
}
ismember = sigismember(&pendmask, SIGQUIT);
if (ismember < 0) {
fprintf(stderr, "sigismember error\n");
exit(1);
} else if (ismember == 1) {
printf("Pending SIGQUIT found.\n");
}
printf("\n=> Unblocking SIGQUIT...\n");
if (sigprocmask(SIG_SETMASK, &oldmask, NULL) < 0) {
fprintf(stderr, "SIG_SETMASK error\n");
exit(1);
}
printf("SIGQUIT unblocked - sleeping some more...\n");
/* Finally, if we have not delivered a second ^\ after the
* resetting handler, then we get here and can simply deliver
* another ^\ now, exiting the program.
*/
sleep(SLEEP);
printf("Now exiting.\n");
exit(0);
}
|
the_stack_data/15306.c
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#define MAX_SIZE 1000
int main ()
{
char command[MAX_SIZE];
char* argv[MAX_SIZE];
printf("PythOff Shell 1.0.0, all rights reserved.\nPress Ctrl+C to exit.\n");
while(1)
{
for(int i=0; i<MAX_SIZE; i++)
{
command[i] = '\0';
argv[i] = NULL;
}
fgets(command, sizeof(command), stdin);
int wc = 0, cc = 0;
argv[0] = (char*) malloc(MAX_SIZE);
for(int i=0; i<strlen(command)-1; i++)
{
// printf("processing character %c\n", command[i]);
if(command[i] == ' ')
{
argv[wc++][cc] = '\0';
argv[wc] = (char*) malloc(MAX_SIZE);
cc = 0;
}
else
{
argv[wc][cc++] = command[i];
}
}
if(fork() == 0)
{
execvp(argv[0], argv);
}
}
}
|
the_stack_data/12638932.c
|
//Checks the memory allocation of extern variables in 3 files
//bar.c: 2 external declarations and one local variable
extern int i;
extern int foobar;
void bar()
{
int bar;
foobar = 10;
}
|
the_stack_data/1144220.c
|
// REQUIRES: powerpc-registered-target
// RUN: %clang -S -emit-llvm -DNO_WARN_X86_INTRINSICS -target powerpc64-gnu-linux %s -Xclang -verify -o - | FileCheck %s
// RUN: %clang -S -emit-llvm -DNO_WARN_X86_INTRINSICS -target powerpc64-gnu-linux %s -Xclang -verify -x c++ -o - | FileCheck %s
// expected-no-diagnostics
// RUN: not %clang -S -emit-llvm -target powerpc64-gnu-linux %s -o /dev/null 2>&1 | FileCheck %s -check-prefix=CHECK-ERROR
#include <mmintrin.h>
// CHECK-ERROR: mmintrin.h:{{[0-9]+}}:{{[0-9]+}}: error: "Please read comment above. Use -DNO_WARN_X86_INTRINSICS to disable this error."
// CHECK: target triple = "powerpc64-
// CHECK: !llvm.module.flags =
|
the_stack_data/192331359.c
|
#include <stdio.h>
#define MAXSIZE 100
void sub(int A[], int B[]){
int i=0, j;
while(B[i]!=-1){
j=0;
while(A[j]!=-1){
if(A[j]==B[i])
A[j]=-2;
j++;
}
i++;
}
}
int main(){
int A[MAXSIZE], B[MAXSIZE];
int i=0;
do{
scanf("%d", &A[i]);
}while (A[i++]!=-1);
i=0;
do{
scanf("%d", &B[i]);
}while (B[i++]!=-1);
sub(A, B);
i=0;
while(A[i]!=-1){
if(A[i]!=-2)
printf("%d ", A[i]);
i++;
}
}
|
the_stack_data/563591.c
|
#include<stdio.h>
int main(void){
int comp;
scanf("%d",&comp);
int v[comp*2];
for(int i=0;i<(comp*2);i++){
scanf("%d",&v[i]);
}
int somaLancamentos[comp];
return 0;
}
|
the_stack_data/1234585.c
|
/*
* vmstat.c - statistics gathering code for vm.c
*
* Copyright (c) 2005-2019 Shiro Kawai <[email protected]>
*
* 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 authors nor the names of its contributors
* may be used to endorse or promote products derived from this
* software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
* TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/* This file is included from vm.c */
#ifdef COUNT_INSN_FREQUENCY
/* for statistics */
static u_long insn1_freq[SCM_VM_NUM_INSNS];
static u_long insn2_freq[SCM_VM_NUM_INSNS][SCM_VM_NUM_INSNS];
#define LREF_FREQ_COUNT_MAX 10
static u_long lref_freq[LREF_FREQ_COUNT_MAX][LREF_FREQ_COUNT_MAX];
static u_long lset_freq[LREF_FREQ_COUNT_MAX][LREF_FREQ_COUNT_MAX];
static ScmWord fetch_insn_counting(ScmVM *vm, ScmWord code)
{
if (vm->base && vm->pc != vm->base->code) {
insn2_freq[SCM_VM_INSN_CODE(code)][SCM_VM_INSN_CODE(*vm->pc)]++;
}
code = *vm->pc++;
insn1_freq[SCM_VM_INSN_CODE(code)]++;
switch (SCM_VM_INSN_CODE(code)) {
case SCM_VM_LREF0: lref_freq[0][0]++; break;
case SCM_VM_LREF1: lref_freq[0][1]++; break;
case SCM_VM_LREF2: lref_freq[0][2]++; break;
case SCM_VM_LREF3: lref_freq[0][3]++; break;
case SCM_VM_LREF4: lref_freq[0][4]++; break;
case SCM_VM_LREF10: lref_freq[1][0]++; break;
case SCM_VM_LREF11: lref_freq[1][1]++; break;
case SCM_VM_LREF12: lref_freq[1][2]++; break;
case SCM_VM_LREF13: lref_freq[1][3]++; break;
case SCM_VM_LREF14: lref_freq[1][4]++; break;
case SCM_VM_LREF:
{
int dep = SCM_VM_INSN_ARG0(code);
int off = SCM_VM_INSN_ARG1(code);
if (dep >= LREF_FREQ_COUNT_MAX) dep=LREF_FREQ_COUNT_MAX-1;
if (off >= LREF_FREQ_COUNT_MAX) off=LREF_FREQ_COUNT_MAX-1;
lref_freq[dep][off]++;
break;
}
case SCM_VM_LSET0: lset_freq[0][0]++; break;
case SCM_VM_LSET1: lset_freq[0][1]++; break;
case SCM_VM_LSET2: lset_freq[0][2]++; break;
case SCM_VM_LSET3: lset_freq[0][3]++; break;
case SCM_VM_LSET4: lset_freq[0][4]++; break;
case SCM_VM_LSET:
{
int dep = SCM_VM_INSN_ARG0(code);
int off = SCM_VM_INSN_ARG1(code);
if (dep >= LREF_FREQ_COUNT_MAX) dep=LREF_FREQ_COUNT_MAX-1;
if (off >= LREF_FREQ_COUNT_MAX) off=LREF_FREQ_COUNT_MAX-1;
lset_freq[dep][off]++;
break;
}
}
return code;
}
static void dump_insn_frequency(void *data)
{
Scm_Printf(SCM_CUROUT, "(:instruction-frequencies (");
for (int i=0; i<SCM_VM_NUM_INSNS; i++) {
Scm_Printf(SCM_CUROUT, "(%s %d", Scm_VMInsnName(i), insn1_freq[i]);
for (int j=0; j<SCM_VM_NUM_INSNS; j++) {
Scm_Printf(SCM_CUROUT, " %d", insn2_freq[i][j]);
}
Scm_Printf(SCM_CUROUT, ")\n");
}
Scm_Printf(SCM_CUROUT, ")\n :lref-frequencies (");
for (int i=0; i<LREF_FREQ_COUNT_MAX; i++) {
Scm_Printf(SCM_CUROUT, "(");
for (int j=0; j<LREF_FREQ_COUNT_MAX; j++) {
Scm_Printf(SCM_CUROUT, "%d ", lref_freq[i][j]);
}
Scm_Printf(SCM_CUROUT, ")\n");
}
Scm_Printf(SCM_CUROUT, ")\n :lset-frequencies (");
for (int i=0; i<LREF_FREQ_COUNT_MAX; i++) {
Scm_Printf(SCM_CUROUT, "(");
for (int j=0; j<LREF_FREQ_COUNT_MAX; j++) {
Scm_Printf(SCM_CUROUT, "%d ", lset_freq[i][j]);
}
Scm_Printf(SCM_CUROUT, ")\n");
}
Scm_Printf(SCM_CUROUT, ")\n");
Scm_Printf(SCM_CUROUT, ")\n");
}
#endif /*COUNT_INSN_FREQUENCY*/
|
the_stack_data/232955753.c
|
#if defined DONT_INCLUDE_TEMPLATE_CODE
/* DONT BOTHER COMPILING THIS FILE UNLESS WE ARE USING G++ >= 260
AND -fno-implicit-templates AND -DDONT_INCLUDE_TEMPLATE_CODE */
#undef DONT_INCLUDE_TEMPLATE_CODE
#include <omega/PT-omega.c>
// If we needed other templates, we would put them here
#endif
|
the_stack_data/51700409.c
|
#include <stdio.h>
int main()
{
int num1 = 22;
char char1 = 'f';
char *ptr1 = &char1;
int *ptr2= &num1;
char *ptr3 = &char1;
printf(" %p is address \n ", ptr1 );
printf(" %d is content \n", num1 );
printf(" %p is content confirmed \n", &num1);
printf(" %p is char address \n", ptr2 );
printf(" %c is char content \n", char1);
printf(" %p is content confirmed \n", &char1);
printf("%p is confirmed ptr3 \n", ptr3);
printf("%c is confirmed Cptr3 \n", &ptr3);
printf("%d is confirmed Dptr3 \n", &ptr3);
flushall();
getchar();
return(0);
}
|
the_stack_data/92326357.c
|
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
/**
* Name: Thomas Rokicki
* Date: Feb 19
* Prog: Exam1
*/
void run(void);
bool userWishesToContinue(void);
void clean_stdin(void);
const int SAFE_LIMIT = 100000000;
int main(void) {
do {
run();
} while (userWishesToContinue());
printf("Have a good night!");
return EXIT_SUCCESS;
}
/**
* Continuous function
*/
void run(void) {
int user_limit;
printf("Enter an upper limit: ");
scanf("%d", &user_limit);
if (user_limit > SAFE_LIMIT) { // Ensure the limit is not massive
printf("ERROR: Limit is %d, your value has been set to 5000.",
SAFE_LIMIT);
user_limit = SAFE_LIMIT;
}
fib(user_limit);
printf("\n");
fib_recursive(0, 0, user_limit);
printf("\n");
printf("%d", fib_return(1, 1, user_limit));
}
void fib(int user_limit) {
if (user_limit < 1) { // Ensure the limit is not too low
printf(
"ERROR: Your limit cannot be less than 1. Limit has been set to 1");
user_limit = 1;
}
int one = 0, two = 1, num = one + two;
// 0 1 1 2 3 5 8 13
printf("\n0 1 "); // first value always
while (num < user_limit) {
num = one + two;
if (num <= user_limit) {
printf("%d ", num);
one = two;
two = num;
}
}
}
void fib_recursive(int first, int second, int limit) {
//init
if(first == 0 && second == 0) {
printf("0 1");
fib_recursive(0, 1, limit);
return;
}
int added = first + second;
if (added < limit) {
printf(" %d", added);
fib_recursive(second, added, limit);
} else if (added > limit) {
printf(" %d - FINISHED", second);
return;
} else if (added == limit) {
printf(" %d - FINISHED", added);
return;
} else {
return; // shouldnt happen
}
}
int fib_return(int first, int second, int limit) {
int added = first + second;
if(added > limit) {
return second;
} else {
return fib_return(second, added, limit);
}
}
/**
* Function to check if the user would like to continue
*/
bool userWishesToContinue(void) {
char user_input;
printf("\nDo you wish to continue? Enter 'y' or 'n' \n");
scanf("%s", &user_input);
void clean_stdin(void);
if (user_input == 'y') {
return true;
} else if (user_input == 'n') {
return false;
} else {
printf("\nInvalid input.\n");
return userWishesToContinue();
}
}
/**
* For flushing the buffer
*/
void clean_stdin(void) {
int c;
do {
c = getchar();
} while (c != '\n' && c != EOF);
}
|
the_stack_data/126701823.c
|
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
#include <math.h>
#define forr(i, a, b) for(int i=a;i<b;i++)
#define forp(i, a, b) for(int i=a;i<=b;i++)
#define times(n) int _##n=n;while(_##n--)
#define mset(d, v) memset(d,v,sizeof(d))
#define min(a, b) (((a)<=(b))?(a):(b))
#define swap(a, b) (a)^=(b)^=(a)^=(b)
#define input(x) scanf("%d",&x)
#define read(x) int x;input(x)
#define prtl() putchar('\n')
#define prti(x) printf("%d", x)
#define prta(x, a, b) forr(i,a,b){if(i!=a)putchar(' ');prti(x[i]);}
int cmp(const void* a,const void *b){return *((int*)a)-*((int*)b);}
#define N 100000
/* Reversing Linked List (25) */
typedef struct node {
int data, next;
} Node;
Node nodes[N];
int main() {
read(addr0); read(n); read(k);
forr(i, 0, n) {
read(addr);
input(nodes[addr].data);
input(nodes[addr].next);
}
int addr = addr0, lastaddr = -1;
while (addr != -1) {
int p = addr, cnt = k;
while (p!=-1 && cnt) {
p = nodes[p].next;
cnt--;
}
if (!cnt) { // reversible
int q = addr;
times (k) {
int r = nodes[q].next;
nodes[q].next = p; // magic shifting
p = q; // p moves backward to head
q = r; // q moves forward to next addr
}
if (addr == addr0) addr0 = p; // update linklist head
if (lastaddr != -1) // magic fix linkage
nodes[lastaddr].next = p;
lastaddr = addr;
addr = q;
} else break;
}
int p = addr0;
while (p != -1) {
printf("%05d %d ", p, nodes[p].data);
if (nodes[p].next != -1) printf("%05d", nodes[p].next);
else printf("-1");
prtl();
p = nodes[p].next;
}
}
|
the_stack_data/64199548.c
|
int ft_str_is_alpha(char *str)
{
int i;
i = 0;
if (str[0] == '\0')
{
return (1);
}
while (str[i] != '\0')
{
if ((str[i] < 'A' || str[i] > 'Z') && (str[i] < 'a' || str[i] > 'z'))
{
return (0);
}
i++;
}
return (1);
}
|
the_stack_data/104826847.c
|
#include <stdio.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include <signal.h>
#include <fcntl.h>
#include <ctype.h>
long received = 0;
long bandwith;
// Handler for SIGUSR1-signal.
void sig_handler(int signum){
// As it is called once every second, not nescessary for now to divide by elapsed time ( 1 sec ) - Might want to change this for higher accuracy/ error handling"
printf("Bandwidth (B/s): %ld \n", bandwith);
bandwith = 0;
alarm(1);
}
// Handler for SIGUSR1-signal.
void sigusr_handler(int signum){
printf("Current accumulated received bytes: %ld \n", received);
}
int run(size_t block_size){
// Initializing file descriptor for child and parent.
int number_of_bytes, fd_child, fd_parent;
// Initializing name for the named pipe
char named_pipe[15];
sprintf(named_pipe, "%d", getpid());
strcat(named_pipe, "named_pipe");
// Initializing pid
pid_t childpid;
// Filling string of length block size with data
char *str = malloc(block_size);
memset(str, 'a', block_size-1);
str[block_size] = '\0';
// Initializing readbuffer with data.
char *readbuffer = malloc(block_size);
memset(readbuffer, 'd', block_size-1);
readbuffer[block_size] = '\0';
// Binding the two signals to the correct handler.
signal(SIGALRM, sig_handler);
signal(SIGUSR1, sigusr_handler);
// Initializing named pipe with error-handling
if (mkfifo(named_pipe, 0666) != 0){
printf("pid %d \n", getpid());
perror("PIPE");
exit(1);
}
// Forking with error-handling.
if((childpid = fork()) == -1){
perror("Fork");
exit(1);
}
if(childpid == 0){
// Child-prosess opens pipe for writing only
fd_child = open(named_pipe, O_WRONLY);
while(1){
// Writing str to fd_child (named pipe)
if (write(fd_child, str, (strlen(str) + 1)) == -1){
printf("Error %d", errno);
exit(1);
}
}
// Closing file descriptor
close(fd_child);
exit(0);
}
else{
printf("PARENTPROCESS PID %d \n", getpid());
// Parent-process opens pipe only for reading.
fd_parent = open(named_pipe, O_RDONLY);
alarm(1); // Setting first alarm
while (1){
// Reading content of fd_parent (named pipe) into readbuffer with error-handling.
number_of_bytes = read(fd_parent, readbuffer, strlen(readbuffer) + 1);
if (number_of_bytes == -1) {
printf("Error %d", errno);
exit(1);
}
received += number_of_bytes;
bandwith += number_of_bytes;
//printf("Cummulative bytes is %d and string is %s \n", received, readbuffer);
}
// Closing file descriptor
close(fd_parent);
exit(0);
}
}
// Main takes block size as argument.
int main( int argc, char *argv[] ) {
// If no argument is given this is the standard size.
size_t block_size = 1000;
if (argc > 2) {
printf("Too many arguments. Program takes only one argument!\n");
exit(EXIT_FAILURE);
}
else if ( argc < 2) {
printf("No argument given. Using standard block size of 1000 bytes.\n");
}
else {
//Checking that input is a valid number
int i = 0;
while( i < strlen( argv[1] )){
if (! isdigit( argv[1][i] ) ){
printf( "Argument must be a valid number!\n" );
exit( EXIT_FAILURE );
}
i++;
}
block_size = strtoul( argv[1], NULL, 10 );
}
printf("___Benchmark___\n");
printf("Blocksize: %ld\n\n", block_size);
run(block_size);
}
|
the_stack_data/1094291.c
|
/*
Considere a estrutura a seguir para armazenar dados de um time de futebol:
struct TimeFutebol {
char *nome;
int pontos, gols, vitorias, derrotas, empates;
};
Escreva um programa que leia os dados de um time de futebol e armazene em uma estrutura struct TimeFutebol.
Após preencher os dados, chame a função imprimir e passe a estrutura preenchida.
Essa função, que já está implementada no sistema de correção automática,
irá imprimir os dados do time de futebol.
Protótipo da função imprimir:
void imprimir(struct TimeFutebol dados_time);
Importante: Não use variáveis globais. Não use printf/puts/fprintf.
Neste exercício, pode usar stdio.h e stdlib.h. A impressão deve ser feita com a função imprimir.
A definição da struct TimeFutebol já existe no sistema de correção automática
(portanto, não inclua a definição da struct no código submetido).
A função imprimir também já existe no sistema de correção.
É necessário incluir a seguinte linha no início do código programa:
#include "estruturas.h"
*/
//#include "estruturas.h"
#include <stdio.h>
#include <stdlib.h>
struct TimeFutebol {
char *nome;
int pontos, gols, vitorias, derrotas, empates;
};
int main() {
struct TimeFutebol dados;
dados.nome = malloc(sizeof(char) * 100);
scanf("%s %d %d %d %d %d",
dados.nome, &dados.pontos, &dados.gols, &dados.vitorias, &dados.derrotas, &dados.empates);
//imprimir(dados);
printf("%s %d %d %d %d %d",
dados.nome, dados.pontos, dados.gols, dados.vitorias, dados.derrotas,dados.empates);
free(dados.nome);
return 0;
}
|
the_stack_data/73575215.c
|
#include <math.h>
double v_norm( double *A, double *C )
/*********************************************************/
/* Vector(B)=Vektor(A)/|A| */
/*********************************************************/
{
double B;
B = sqrt(A[0]*A[0]+A[1]*A[1]+A[2]*A[2]);
C[0]=A[0]/B;
C[1]=A[1]/B;
C[2]=A[2]/B;
return(B);
}
|
the_stack_data/62808.c
|
void binary_loop(void)
{
char *entry[2];
int k;
k = 0;
while (get_next_line(0, entry[k]) == 1)
{
if (k)
ft_place_entry(&entry);
else if (entry[k][0] == '\0')
break ;
k = (k ? 0 : 1);
}
}
|
the_stack_data/124335.c
|
/*
* Generate a header file for hardcoded ff_cos_* tables
*
* Copyright (c) 2009 Reimar Döffinger <[email protected]>
*
* This file is part of FFmpeg.
*
* FFmpeg 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.
*
* FFmpeg 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 FFmpeg; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <stdio.h>
#include <string.h>
#include <math.h>
#ifndef M_PI
#define M_PI 3.14159265358979323846
#endif
#define BITS 16
#define FLOATFMT "%.18e"
#define FIXEDFMT "%6d"
static int clip_f15(int v)
{
return v < -32767 ? -32767 :
v > 32767 ? 32767 :
v;
}
static void printval(double val, int fixed)
{
if (fixed)
printf(" "FIXEDFMT",", clip_f15(lrint(val * (double)(1<<15))));
else
printf(" "FLOATFMT",", val);
}
int main(int argc, char *argv[])
{
int i, j;
int do_sin = argc > 1 && !strcmp(argv[1], "sin");
int fixed = argc > 1 && strstr(argv[1], "fixed");
double (*func)(double) = do_sin ? sin : cos;
printf("/* This file was automatically generated. */\n");
printf("#define CONFIG_FFT_FLOAT %d\n", !fixed);
printf("#include \"libavcodec/%s\"\n", do_sin ? "rdft.h" : "fft.h");
for (i = 4; i <= BITS; i++) {
int m = 1 << i;
double freq = 2*M_PI/m;
printf("%s(%i) = {\n ", do_sin ? "SINTABLE" : "COSTABLE", m);
for (j = 0; j < m/2 - 1; j++) {
int idx = j > m/4 ? m/2 - j : j;
if (do_sin && j >= m/4)
idx = m/4 - j;
printval(func(idx*freq), fixed);
if ((j & 3) == 3)
printf("\n ");
}
printval(func(do_sin ? -(m/4 - 1)*freq : freq), fixed);
printf("\n};\n");
}
return 0;
}
|
the_stack_data/162642335.c
|
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
static inline int min(int a, int b)
{
return a < b ? a : b;
}
static inline int max(int a, int b)
{
return a > b ? a : b;
}
static int maxProduct(int* nums, int numsSize)
{
int i, maximum = INT_MIN;
int dp_min = 1;
int dp_max = 1;
/* dp records the min or max result of subarray nums[0...i] */
for (i = 0; i < numsSize; i++) {
int prev_min = dp_min;
int prev_max = dp_max;
dp_min = min(nums[i], min(prev_min * nums[i], prev_max * nums[i]));
dp_max = max(nums[i], max(prev_min * nums[i], prev_max * nums[i]));
maximum = max(dp_max, maximum);
}
return maximum;
}
int main(int argc, char **argv)
{
int i, count = argc - 1;
int *nums = malloc(count * sizeof(int));
for (i = 0; i < count; i++) {
nums[i] = atoi(argv[i + 1]);
}
printf("%d\n", maxProduct(nums, count));
return 0;
}
|
the_stack_data/103473.c
|
/* This testcase is part of GDB, the GNU debugger.
Copyright 2005-2014 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <stdio.h>
int x;
void bar()
{
x--;
}
void foo()
{
x++;
}
int main()
{
foo();
bar();
return 0;
}
|
the_stack_data/93887418.c
|
/* C program for Memoized version for nth Fibonacci number */
#include<stdio.h>
#define NIL -1
#define MAX 100
int lookup[MAX];
/* Function to initialize NIL values in lookup table */
void _initialize()
{
int i;
for (i = 0; i < MAX; i++)
lookup[i] = NIL;
}
/* function for nth Fibonacci number */
int fib(int n)
{
if (lookup[n] == NIL)
{
if (n <= 1)
lookup[n] = n;
else
lookup[n] = fib(n-1) + fib(n-2);
}
return lookup[n];
}
int main ()
{
int n = 40;
_initialize();
printf("Fibonacci number is %d ", fib(n));
return 0;
}
|
the_stack_data/211080588.c
|
//
// simplest_yuv444_split.c
// simplest_yuv444_split
//
// Created by angle on 21/03/2018.
// Copyright © 2018 angle. All rights reserved.
//
#include <stdio.h>
//add
#include <stdlib.h>
#include <string.h>
/**
Splicing string exp: splicingString_f("123","456") out:"123456"
@param string_1 string on the left
@param string_2 string on the right
@return new string
*/
char * splicingString_f (char *string_1, char *string_2) {
size_t len = strlen(string_1) + strlen(string_2) + 1;
char * p;
p = (char * ) malloc (len);
memset ( p , 0 , len);
strcpy ( p, string_1);
strcat ( p, string_2);
return p;
}
/**
* Split Y, U, V planes in YUV444P file.
* @param url Location of YUV file.
* @param w Width of Input YUV file.
* @param h Height of Input YUV file.
* @param outUrl Location of outPut YUV file.
* @param num Number of frames to process.
*
*/
int simplest_yuv444_split(char *url, int w, int h,int num, char *outUrl) {
FILE *fp=fopen(url,"rb+");
FILE *fp1=fopen(splicingString_f(outUrl, "output_444_y.y"),"wb+");
FILE *fp2=fopen(splicingString_f(outUrl, "output_444_u.y"),"wb+");
FILE *fp3=fopen(splicingString_f(outUrl, "output_444_v.y"),"wb+");
unsigned char *pic=(unsigned char *)malloc(w*h*3);
if (fp != NULL && fp1 != NULL && fp2 != NULL && fp3 != NULL) {
for(int i=0;i<num;i++){
fread(pic,1,w*h*3,fp);
//Y
fwrite(pic,1,w*h,fp1);
//U
fwrite(pic+w*h,1,w*h,fp2);
//V
fwrite(pic+w*h*2,1,w*h,fp3);
}
free(pic);
fclose(fp);
fclose(fp1);
fclose(fp2);
fclose(fp3);
fp = NULL;
fp1 = NULL;
fp2 = NULL;
fp3 = NULL;
return 1;
}else {
return 0;
}
}
|
the_stack_data/187642671.c
|
/** @file paex_write_sine.c
@ingroup examples_src
@brief Play a sine wave for several seconds using the blocking API (Pa_WriteStream())
@author Ross Bencina <[email protected]>
@author Phil Burk <[email protected]>
*/
/*
* $Id$
*
* This program uses the PortAudio Portable Audio Library.
* For more information see: http://www.portaudio.com/
* Copyright (c) 1999-2000 Ross Bencina and Phil Burk
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files
* (the "Software"), to deal in the Software without restriction,
* including without limitation the rights to use, copy, modify, merge,
* publish, distribute, sublicense, and/or sell copies of the Software,
* and to permit persons to whom the Software is furnished to do so,
* subject to the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR
* ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
* CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
/*
* The text above constitutes the entire PortAudio license; however,
* the PortAudio community also makes the following non-binding requests:
*
* Any person wishing to distribute modifications to the Software is
* requested to send the modifications to the original developer so that
* they can be incorporated into the canonical version. It is also
* requested that these non-binding requests be included along with the
* license above.
*/
#include <stdio.h>
#include <math.h>
#include "portaudio.h"
#define NUM_SECONDS (5)
#define SAMPLE_RATE (44100)
#define FRAMES_PER_BUFFER (1024)
#ifndef M_PI
#define M_PI (3.14159265)
#endif
#define TABLE_SIZE (200)
int main(void);
int main(void)
{
PaStreamParameters outputParameters;
PaStream *stream;
PaError err;
float buffer[FRAMES_PER_BUFFER][2]; /* stereo output buffer */
float sine[TABLE_SIZE]; /* sine wavetable */
int left_phase = 0;
int right_phase = 0;
int left_inc = 1;
int right_inc = 3; /* higher pitch so we can distinguish left and right. */
int i, j, k;
int bufferCount;
printf("PortAudio Test: output sine wave. SR = %d, BufSize = %d\n", SAMPLE_RATE, FRAMES_PER_BUFFER);
/* initialise sinusoidal wavetable */
for( i=0; i<TABLE_SIZE; i++ )
{
sine[i] = (float) sin( ((double)i/(double)TABLE_SIZE) * M_PI * 2. );
}
err = Pa_Initialize();
if( err != paNoError ) goto error;
outputParameters.device = Pa_GetDefaultOutputDevice(); /* default output device */
if (outputParameters.device == paNoDevice) {
fprintf(stderr,"Error: No default output device.\n");
goto error;
}
outputParameters.channelCount = 2; /* stereo output */
outputParameters.sampleFormat = paFloat32; /* 32 bit floating point output */
outputParameters.suggestedLatency = Pa_GetDeviceInfo( outputParameters.device )->defaultLowOutputLatency;
outputParameters.hostApiSpecificStreamInfo = NULL;
err = Pa_OpenStream(
&stream,
NULL, /* no input */
&outputParameters,
SAMPLE_RATE,
FRAMES_PER_BUFFER,
paClipOff, /* we won't output out of range samples so don't bother clipping them */
NULL, /* no callback, use blocking API */
NULL ); /* no callback, so no callback userData */
if( err != paNoError ) goto error;
printf( "Play 3 times, higher each time.\n" );
for( k=0; k < 3; ++k )
{
err = Pa_StartStream( stream );
if( err != paNoError ) goto error;
printf("Play for %d seconds.\n", NUM_SECONDS );
bufferCount = ((NUM_SECONDS * SAMPLE_RATE) / FRAMES_PER_BUFFER);
for( i=0; i < bufferCount; i++ )
{
for( j=0; j < FRAMES_PER_BUFFER; j++ )
{
buffer[j][0] = sine[left_phase]; /* left */
buffer[j][1] = sine[right_phase]; /* right */
left_phase += left_inc;
if( left_phase >= TABLE_SIZE ) left_phase -= TABLE_SIZE;
right_phase += right_inc;
if( right_phase >= TABLE_SIZE ) right_phase -= TABLE_SIZE;
}
err = Pa_WriteStream( stream, buffer, FRAMES_PER_BUFFER );
if( err != paNoError ) goto error;
}
err = Pa_StopStream( stream );
if( err != paNoError ) goto error;
++left_inc;
++right_inc;
Pa_Sleep( 1000 );
}
err = Pa_CloseStream( stream );
if( err != paNoError ) goto error;
Pa_Terminate();
printf("Test finished.\n");
return err;
error:
Pa_Terminate();
fprintf( stderr, "An error occured while using the portaudio stream\n" );
fprintf( stderr, "Error number: %d\n", err );
fprintf( stderr, "Error message: %s\n", Pa_GetErrorText( err ) );
return err;
}
|
the_stack_data/47356.c
|
#include <stdio.h>
int maxSubArray(int* nums, int numsSize) {
int max = nums[0], sum = nums[0];
for (int i = 1; i < numsSize; i++) {
sum += nums[i];
if (sum < nums[i]) sum = nums[i];
if (max < sum) max = sum;
}
return max;
}
int main() {
int arr1[9] = {-2, 1, -3, 4, -1, 2, 1, -5, 4};
int arr2[1] = {-1};
int arr3[2] = {-2, 1};
printf(">>> maxSubArray(arr1) = %d\n", maxSubArray(arr1, 9));
printf(">>> maxSubArray(arr2) = %d\n", maxSubArray(arr2, 1));
printf(">>> maxSubArray(arr3) = %d\n", maxSubArray(arr3, 2));
return 0;
}
|
the_stack_data/60410.c
|
#include <stdio.h>
int findNumOfDec(double x) {
char buffer[128];
int pos, num;
sprintf(buffer, "%.14f", x);
pos = 0;
num = 0;
while (buffer[pos] != 0 && buffer[pos] != '.') {
pos++;
}
if (buffer[pos] != 0) {
pos++; // skip over the decimal
while (buffer[pos] != 0) {
pos++; // find the end of the string
}
pos--; //reverse past the null sentiel
while (buffer[pos] == '0') {
pos--; // reverse past any zeros
}
while (buffer[pos] != '.') {
num++;
pos--; // only count decimals from this point
}
}
return num;
}
void test(double x) {
int num = findNumOfDec(x);
printf("%f has %d decimals\n", x, num);
}
int main() {
test(12.0);
test(12.345);
test(12.345555555555);
test(12.3450);
test(12.34555555555555555555);
test(1.2345e+54);
return 0;
}
|
the_stack_data/974108.c
|
#include <stdio.h>
int main(){
long int i,end;
long int a=1,b=2,n=0,result=0;
for (i=0; a<4000000; i++){
printf("%ld, ",a);
a%2 == 0 ? result += a : 0 ; // 验证是否为偶数
// 斐波那契数列生成
n = a + b;
a = b;
b = n;
}
printf("\n偶数和: %ld",result);
return 0;
}
|
the_stack_data/211081600.c
|
// $Id$
// http://research.microsoft.com/en-us/um/people/sumitg/benchmarks/pa.html.
#include <stdlib.h>
#define assume(c) {if (!(c)) exit(0);}
#define assert(c) {if (!(c)) exit(1);}
void ex1b(int x, int n, int m) {
assume(n > 0);
x = 0;
m = 0;
while (x < n) {
if (rand())
m = x;
x = x + 1;
}
assert(m >= 0 && m < n);
}
/*
* Predicate Set S:
* x <= 0, x > 0, x < 0, x >= 0,
* m <= 0, m > 0, m < 0, m >= 0,
* x - m <= 0, x - m > 0, x - m < 0, x - m >= 0,
* x - n <= 0, x - n > 0, x - n < 0, x - n >= 0,
* n - m <= 0, n - m > 0, n - m < 0, n - m >= 0,
*/
|
the_stack_data/561989.c
|
/*
A C-program for MT19937, with initialization improved 2002/1/26.
Coded by Takuji Nishimura and Makoto Matsumoto.
Before using, initialize the state by using init_genrand(seed)
or init_by_array(init_key, key_length).
Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The names of its contributors may not be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
Any feedback is very welcome.
http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)
*/
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
/* Period parameters */
#define N 624
#define M 397
#define MATRIX_A 0x9908b0dfUL /* constant vector a */
#define UPPER_MASK 0x80000000UL /* most significant w-r bits */
#define LOWER_MASK 0x7fffffffUL /* least significant r bits */
static unsigned long mt[N]; /* the array for the state vector */
static int mti=N+1; /* mti==N+1 means mt[N] is not initialized */
/* initializes mt[N] with a seed */
void init_genrand(unsigned long s)
{
mt[0]= s & 0xffffffffUL;
for (mti=1; mti<N; mti++) {
mt[mti] =
(1812433253UL * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti);
/* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
/* In the previous versions, MSBs of the seed affect */
/* only MSBs of the array mt[]. */
/* 2002/01/09 modified by Makoto Matsumoto */
mt[mti] &= 0xffffffffUL;
/* for >32 bit machines */
}
}
/* initialize by an array with array-length */
/* init_key is the array for initializing keys */
/* key_length is its length */
/* slight change for C++, 2004/2/26 */
void init_by_array(unsigned long init_key[], int key_length)
{
int i, j, k;
init_genrand(19650218UL);
i=1; j=0;
k = (N>key_length ? N : key_length);
for (; k; k--) {
mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1664525UL))
+ init_key[j] + j; /* non linear */
mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
i++; j++;
if (i>=N) { mt[0] = mt[N-1]; i=1; }
if (j>=key_length) j=0;
}
for (k=N-1; k; k--) {
mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1566083941UL))
- i; /* non linear */
mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
i++;
if (i>=N) { mt[0] = mt[N-1]; i=1; }
}
mt[0] = 0x80000000UL; /* MSB is 1; assuring non-zero initial array */
}
/* generates a random number on [0,0xffffffff]-interval */
unsigned long genrand_int32(void)
{
unsigned long y;
static unsigned long mag01[2]={0x0UL, MATRIX_A};
/* mag01[x] = x * MATRIX_A for x=0,1 */
if (mti >= N) { /* generate N words at one time */
int kk;
if (mti == N+1) /* if init_genrand() has not been called, */
init_genrand(5489UL); /* a default initial seed is used */
for (kk=0;kk<N-M;kk++) {
y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
mt[kk] = mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1UL];
}
for (;kk<N-1;kk++) {
y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
mt[kk] = mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1UL];
}
y = (mt[N-1]&UPPER_MASK)|(mt[0]&LOWER_MASK);
mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1UL];
mti = 0;
}
y = mt[mti++];
/* Tempering */
y ^= (y >> 11);
y ^= (y << 7) & 0x9d2c5680UL;
y ^= (y << 15) & 0xefc60000UL;
y ^= (y >> 18);
return y;
}
/* generates a random number on [0,0x7fffffff]-interval */
long genrand_int31(void)
{
return (long)(genrand_int32()>>1);
}
/* generates a random number on [0,1]-real-interval */
double genrand_real1(void)
{
return genrand_int32()*(1.0/4294967295.0);
/* divided by 2^32-1 */
}
/* generates a random number on [0,1)-real-interval */
double genrand_real2(void)
{
return genrand_int32()*(1.0/4294967296.0);
/* divided by 2^32 */
}
/* generates a random number on (0,1)-real-interval */
double genrand_real3(void)
{
return (((double)genrand_int32()) + 0.5)*(1.0/4294967296.0);
/* divided by 2^32 */
}
/* generates a random number on [0,1) with 53-bit resolution*/
double genrand_res53(void)
{
unsigned long a=genrand_int32()>>5, b=genrand_int32()>>6;
return(a*67108864.0+b)*(1.0/9007199254740992.0);
}
/* These real versions are due to Isaku Wada, 2002/01/09 added */
/* Function 'main' modified by Michael J. Quinn, 6 March 2006 */
#define LEN 4
int main(int argc, char *argv[])
{
float *a;
FILE *fptr;
int i, j;
int rows, cols;
unsigned long length = LEN;
unsigned long init[LEN];
int sum;
if (argc != 4) {
printf ("Correct syntax: %s <name> <rows> <cols>\n", argv[0]);
exit (-1);
}
rows = atoi (argv[2]);
cols = atoi (argv[3]);
sum = 0;
for (i = 0; i < strlen(argv[1]); i++) sum += argv[1][i];
printf ("Generating %d by %d matrix for file '%s'\n", rows, cols, argv[1]);
a = (float *) malloc (rows * cols * sizeof(float));
for (i = 0; i < LEN; i++) init[i] = sum;
init_by_array(init, length);
for (i = 0; i < rows * cols; i++)
a[i] = genrand_real2();
fptr = fopen (argv[1], "w");
fwrite (&rows, sizeof(int), 1, fptr);
fwrite (&cols, sizeof(int), 1, fptr);
fwrite (a, sizeof(float), rows*cols, fptr);
fclose (fptr);
}
|
the_stack_data/93886790.c
|
#ifdef TEST
#include "unity.h"
#include "test_assert_with_exception.h"
#include "uz_PMSM_config.h"
struct uz_PMSM_t config = {0};
void setUp(void)
{
config.R_ph_Ohm = 0.08f;
config.Ld_Henry = 0.00027f;
config.Lq_Henry = 0.00027f;
config.Psi_PM_Vs = 0.0082f;
config.polePairs = 4.0f;
config.J_kg_m_squared = 0.00001773f;
config.I_max_Ampere = 20.0f;
}
void test_uz_PMSM_config_assert_R_ph(void){
setUp();
config.R_ph_Ohm = -0.08f;
TEST_ASSERT_FAIL_ASSERT(uz_PMSM_config_assert(config));
config.R_ph_Ohm = 0.0f;
TEST_ASSERT_FAIL_ASSERT(uz_PMSM_config_assert(config));
}
void test_uz_PMSM_config_assert_Ld(void){
setUp();
config.Ld_Henry = -0.08f;
TEST_ASSERT_FAIL_ASSERT(uz_PMSM_config_assert(config));
config.Ld_Henry = 0.0f;
TEST_ASSERT_FAIL_ASSERT(uz_PMSM_config_assert(config));
}
void test_uz_PMSM_config_assert_Lq(void){
setUp();
config.Lq_Henry = -0.08f;
TEST_ASSERT_FAIL_ASSERT(uz_PMSM_config_assert(config));
config.Lq_Henry = 0.0f;
TEST_ASSERT_FAIL_ASSERT(uz_PMSM_config_assert(config));
}
void test_uz_PMSM_config_assert_Psi_PM(void){
setUp();
config.Psi_PM_Vs = -0.08f;
TEST_ASSERT_FAIL_ASSERT(uz_PMSM_config_assert(config));
}
void test_uz_PMSM_config_assert_polePairs(void){
setUp();
config.polePairs = -2.0f;
TEST_ASSERT_FAIL_ASSERT(uz_PMSM_config_assert(config));
config.polePairs = 0.0f;
TEST_ASSERT_FAIL_ASSERT(uz_PMSM_config_assert(config));
config.polePairs = 0.5f;
TEST_ASSERT_FAIL_ASSERT(uz_PMSM_config_assert(config));
}
void test_uz_PMSM_config_assert_J(void){
setUp();
config.J_kg_m_squared = -0.08f;
TEST_ASSERT_FAIL_ASSERT(uz_PMSM_config_assert(config));
config.J_kg_m_squared = 0.0f;
TEST_ASSERT_FAIL_ASSERT(uz_PMSM_config_assert(config));
}
void test_uz_PMSM_config_assert_I_max(void){
setUp();
config.I_max_Ampere = -5.08f;
TEST_ASSERT_FAIL_ASSERT(uz_PMSM_config_assert(config));
config.I_max_Ampere = 0.0f;
TEST_ASSERT_FAIL_ASSERT(uz_PMSM_config_assert(config));
}
#endif // TEST
|
the_stack_data/61798.c
|
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#define LEN 100
int main(int argc, char *argv[])
{
FILE *in, *out;
char name[LEN];
int ch;
//int count = 0;
if (argc < 2)
{
fprintf(stderr, "Usage: %s filename\n", *argv);
exit(EXIT_FAILURE);
}
if ((in = fopen(*(argv+1), "r")) == NULL)
{
fprintf(stderr, "I couldn't open file \"%s\"\n", *(argv+1));
exit(EXIT_FAILURE);
}
strncpy(name, *(argv+1), LEN - 5);
strcat(name, ".red");
if ((out = fopen(name, "w")) == NULL)
{
fprintf(stderr, "Can't create output file.\n");
exit(EXIT_FAILURE);
}
while ((ch = getc(in)) != EOF)
if (isdigit(ch))
putc(ch, out);
if (fclose(in) != 0 || fclose(out) != 0)
fprintf(stderr, "Error in closing files\n");
return 0;
}
|
the_stack_data/426770.c
|
// This file is part of KASLD - https://github.com/bcoles/kasld
//
// Find start of kernel virtual address space (CONFIG_PAGE_OFFSET)
// on 32-bit systems by mapping a page at 0x10000000 increments
// across the entire 32-bit address space (until failure).
//
// Usually vmsplit is located at 3GB (0xc0000000) on 32-bit systems;
// however, embedded systems may make use of a lower vmsplit.
//
// References:
// https://cateee.net/lkddb/web-lkddb/PAGE_OFFSET.html
// https://elixir.bootlin.com/linux/v5.10/source/arch/arm/Kconfig
// https://elixir.bootlin.com/linux/v5.10/source/arch/x86/Kconfig
// ---
// <[email protected]>
#define _GNU_SOURCE
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/mman.h>
#include <unistd.h>
unsigned long find_kernel_address_space_start(void) {
unsigned long i;
printf("[.] searching for kernel virtual address space start ...\n");
for (i = 0x10000000; i < 0xf0000000; i += 0x10000000) {
if (mmap((void *)i, 0x1000, PROT_READ,
MAP_PRIVATE | MAP_ANONYMOUS | MAP_FIXED, -1, 0) == MAP_FAILED)
return i;
munmap((void *)i, 0x1000);
}
printf("[-] Could not locate kernel virtual address space\n");
return 0;
}
int main(int argc, char **argv) {
unsigned long addr = find_kernel_address_space_start();
if (!addr)
return 1;
printf("kernel virtual address start: %lx\n", addr);
return 0;
}
|
the_stack_data/80156.c
|
/* This testcase is part of GDB, the GNU debugger.
Copyright 2011-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 volatile int v;
static void __attribute__((noinline, noclone))
e (int i, double j)
{
v = 0;
}
static int __attribute__((noinline, noclone))
data (void)
{
return 10;
}
static int __attribute__((noinline, noclone))
data2 (void)
{
return 20;
}
static int __attribute__((noinline, noclone))
different (int val)
{
val++;
e (val, val);
asm ("breakhere_different:");
return val;
}
static int __attribute__((noinline, noclone))
validity (int lost, int born)
{
lost = data ();
e (0, 0.0);
asm ("breakhere_validity:");
return born;
}
static void __attribute__((noinline, noclone))
invalid (int inv)
{
e (0, 0.0);
asm ("breakhere_invalid:");
}
int
main ()
{
different (5);
validity (5, data ());
invalid (data2 ());
return 0;
}
|
the_stack_data/18887555.c
|
/* ./.libs/lt-lzmadec.c - temporary wrapper executable for .libs/lzmadec
Generated by libtool (GNU libtool) 2.4.2
The lzmadec program cannot be directly executed until all the libtool
libraries that it depends on are installed.
This wrapper executable should never be moved out of the build directory.
If it is, it will not operate correctly.
*/
#ifdef _MSC_VER
# define _CRT_SECURE_NO_DEPRECATE 1
#endif
#include <stdio.h>
#include <stdlib.h>
#ifdef _MSC_VER
# include <direct.h>
# include <process.h>
# include <io.h>
#else
# include <unistd.h>
# include <stdint.h>
# ifdef __CYGWIN__
# include <io.h>
# endif
#endif
#include <malloc.h>
#include <stdarg.h>
#include <assert.h>
#include <string.h>
#include <ctype.h>
#include <errno.h>
#include <fcntl.h>
#include <sys/stat.h>
/* declarations of non-ANSI functions */
#if defined(__MINGW32__)
# ifdef __STRICT_ANSI__
int _putenv (const char *);
# endif
#elif defined(__CYGWIN__)
# ifdef __STRICT_ANSI__
char *realpath (const char *, char *);
int putenv (char *);
int setenv (const char *, const char *, int);
# endif
/* #elif defined (other platforms) ... */
#endif
/* portability defines, excluding path handling macros */
#if defined(_MSC_VER)
# define setmode _setmode
# define stat _stat
# define chmod _chmod
# define getcwd _getcwd
# define putenv _putenv
# define S_IXUSR _S_IEXEC
# ifndef _INTPTR_T_DEFINED
# define _INTPTR_T_DEFINED
# define intptr_t int
# endif
#elif defined(__MINGW32__)
# define setmode _setmode
# define stat _stat
# define chmod _chmod
# define getcwd _getcwd
# define putenv _putenv
#elif defined(__CYGWIN__)
# define HAVE_SETENV
# define FOPEN_WB "wb"
/* #elif defined (other platforms) ... */
#endif
#if defined(PATH_MAX)
# define LT_PATHMAX PATH_MAX
#elif defined(MAXPATHLEN)
# define LT_PATHMAX MAXPATHLEN
#else
# define LT_PATHMAX 1024
#endif
#ifndef S_IXOTH
# define S_IXOTH 0
#endif
#ifndef S_IXGRP
# define S_IXGRP 0
#endif
/* path handling portability macros */
#ifndef DIR_SEPARATOR
# define DIR_SEPARATOR '/'
# define PATH_SEPARATOR ':'
#endif
#if defined (_WIN32) || defined (__MSDOS__) || defined (__DJGPP__) || \
defined (__OS2__)
# define HAVE_DOS_BASED_FILE_SYSTEM
# define FOPEN_WB "wb"
# ifndef DIR_SEPARATOR_2
# define DIR_SEPARATOR_2 '\\'
# endif
# ifndef PATH_SEPARATOR_2
# define PATH_SEPARATOR_2 ';'
# endif
#endif
#ifndef DIR_SEPARATOR_2
# define IS_DIR_SEPARATOR(ch) ((ch) == DIR_SEPARATOR)
#else /* DIR_SEPARATOR_2 */
# define IS_DIR_SEPARATOR(ch) \
(((ch) == DIR_SEPARATOR) || ((ch) == DIR_SEPARATOR_2))
#endif /* DIR_SEPARATOR_2 */
#ifndef PATH_SEPARATOR_2
# define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR)
#else /* PATH_SEPARATOR_2 */
# define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR_2)
#endif /* PATH_SEPARATOR_2 */
#ifndef FOPEN_WB
# define FOPEN_WB "w"
#endif
#ifndef _O_BINARY
# define _O_BINARY 0
#endif
#define XMALLOC(type, num) ((type *) xmalloc ((num) * sizeof(type)))
#define XFREE(stale) do { \
if (stale) { free ((void *) stale); stale = 0; } \
} while (0)
#if defined(LT_DEBUGWRAPPER)
static int lt_debug = 1;
#else
static int lt_debug = 0;
#endif
const char *program_name = "libtool-wrapper"; /* in case xstrdup fails */
void *xmalloc (size_t num);
char *xstrdup (const char *string);
const char *base_name (const char *name);
char *find_executable (const char *wrapper);
char *chase_symlinks (const char *pathspec);
int make_executable (const char *path);
int check_executable (const char *path);
char *strendzap (char *str, const char *pat);
void lt_debugprintf (const char *file, int line, const char *fmt, ...);
void lt_fatal (const char *file, int line, const char *message, ...);
static const char *nonnull (const char *s);
static const char *nonempty (const char *s);
void lt_setenv (const char *name, const char *value);
char *lt_extend_str (const char *orig_value, const char *add, int to_end);
void lt_update_exe_path (const char *name, const char *value);
void lt_update_lib_path (const char *name, const char *value);
char **prepare_spawn (char **argv);
void lt_dump_script (FILE *f);
volatile const char * MAGIC_EXE = "%%%MAGIC EXE variable%%%";
const char * LIB_PATH_VARNAME = "PATH";
const char * LIB_PATH_VALUE = "/home/liblzma-master/src/liblzma/.libs:/usr/lib:";
const char * EXE_PATH_VARNAME = "PATH";
const char * EXE_PATH_VALUE = "/home/liblzma-master/src/liblzma/.libs:/usr/local/lib:/usr/local/bin:";
const char * TARGET_PROGRAM_NAME = "lzmadec"; /* hopefully, no .exe */
#define LTWRAPPER_OPTION_PREFIX "--lt-"
static const char *ltwrapper_option_prefix = LTWRAPPER_OPTION_PREFIX;
static const char *dumpscript_opt = LTWRAPPER_OPTION_PREFIX "dump-script";
static const char *debug_opt = LTWRAPPER_OPTION_PREFIX "debug";
int
main (int argc, char *argv[])
{
char **newargz;
int newargc;
char *tmp_pathspec;
char *actual_cwrapper_path;
char *actual_cwrapper_name;
char *target_name;
char *lt_argv_zero;
intptr_t rval = 127;
int i;
program_name = (char *) xstrdup (base_name (argv[0]));
newargz = XMALLOC (char *, argc + 1);
/* very simple arg parsing; don't want to rely on getopt
* also, copy all non cwrapper options to newargz, except
* argz[0], which is handled differently
*/
newargc=0;
for (i = 1; i < argc; i++)
{
if (strcmp (argv[i], dumpscript_opt) == 0)
{
setmode(1,_O_BINARY);
lt_dump_script (stdout);
return 0;
}
if (strcmp (argv[i], debug_opt) == 0)
{
lt_debug = 1;
continue;
}
if (strcmp (argv[i], ltwrapper_option_prefix) == 0)
{
/* however, if there is an option in the LTWRAPPER_OPTION_PREFIX
namespace, but it is not one of the ones we know about and
have already dealt with, above (inluding dump-script), then
report an error. Otherwise, targets might begin to believe
they are allowed to use options in the LTWRAPPER_OPTION_PREFIX
namespace. The first time any user complains about this, we'll
need to make LTWRAPPER_OPTION_PREFIX a configure-time option
or a configure.ac-settable value.
*/
lt_fatal (__FILE__, __LINE__,
"unrecognized %s option: '%s'",
ltwrapper_option_prefix, argv[i]);
}
/* otherwise ... */
newargz[++newargc] = xstrdup (argv[i]);
}
newargz[++newargc] = NULL;
/* The GNU banner must be the first non-error debug message */
lt_debugprintf (__FILE__, __LINE__, "libtool wrapper (GNU libtool) 2.4.2\n");
lt_debugprintf (__FILE__, __LINE__, "(main) argv[0]: %s\n", argv[0]);
lt_debugprintf (__FILE__, __LINE__, "(main) program_name: %s\n", program_name);
tmp_pathspec = find_executable (argv[0]);
if (tmp_pathspec == NULL)
lt_fatal (__FILE__, __LINE__, "couldn't find %s", argv[0]);
lt_debugprintf (__FILE__, __LINE__,
"(main) found exe (before symlink chase) at: %s\n",
tmp_pathspec);
actual_cwrapper_path = chase_symlinks (tmp_pathspec);
lt_debugprintf (__FILE__, __LINE__,
"(main) found exe (after symlink chase) at: %s\n",
actual_cwrapper_path);
XFREE (tmp_pathspec);
actual_cwrapper_name = xstrdup (base_name (actual_cwrapper_path));
strendzap (actual_cwrapper_path, actual_cwrapper_name);
/* wrapper name transforms */
strendzap (actual_cwrapper_name, ".exe");
tmp_pathspec = lt_extend_str (actual_cwrapper_name, ".exe", 1);
XFREE (actual_cwrapper_name);
actual_cwrapper_name = tmp_pathspec;
tmp_pathspec = 0;
/* target_name transforms -- use actual target program name; might have lt- prefix */
target_name = xstrdup (base_name (TARGET_PROGRAM_NAME));
strendzap (target_name, ".exe");
tmp_pathspec = lt_extend_str (target_name, ".exe", 1);
XFREE (target_name);
target_name = tmp_pathspec;
tmp_pathspec = 0;
lt_debugprintf (__FILE__, __LINE__,
"(main) libtool target name: %s\n",
target_name);
newargz[0] =
XMALLOC (char, (strlen (actual_cwrapper_path) +
strlen (".libs") + 1 + strlen (actual_cwrapper_name) + 1));
strcpy (newargz[0], actual_cwrapper_path);
strcat (newargz[0], ".libs");
strcat (newargz[0], "/");
/* stop here, and copy so we don't have to do this twice */
tmp_pathspec = xstrdup (newargz[0]);
/* do NOT want the lt- prefix here, so use actual_cwrapper_name */
strcat (newargz[0], actual_cwrapper_name);
/* DO want the lt- prefix here if it exists, so use target_name */
lt_argv_zero = lt_extend_str (tmp_pathspec, target_name, 1);
XFREE (tmp_pathspec);
tmp_pathspec = NULL;
XFREE (target_name);
XFREE (actual_cwrapper_path);
XFREE (actual_cwrapper_name);
lt_setenv ("BIN_SH", "xpg4"); /* for Tru64 */
lt_setenv ("DUALCASE", "1"); /* for MSK sh */
/* Update the DLL searchpath. EXE_PATH_VALUE ($dllsearchpath) must
be prepended before (that is, appear after) LIB_PATH_VALUE ($temp_rpath)
because on Windows, both *_VARNAMEs are PATH but uninstalled
libraries must come first. */
lt_update_exe_path (EXE_PATH_VARNAME, EXE_PATH_VALUE);
lt_update_lib_path (LIB_PATH_VARNAME, LIB_PATH_VALUE);
lt_debugprintf (__FILE__, __LINE__, "(main) lt_argv_zero: %s\n",
nonnull (lt_argv_zero));
for (i = 0; i < newargc; i++)
{
lt_debugprintf (__FILE__, __LINE__, "(main) newargz[%d]: %s\n",
i, nonnull (newargz[i]));
}
execv (lt_argv_zero, newargz);
return rval; /* =127, but avoids unused variable warning */
}
void *
xmalloc (size_t num)
{
void *p = (void *) malloc (num);
if (!p)
lt_fatal (__FILE__, __LINE__, "memory exhausted");
return p;
}
char *
xstrdup (const char *string)
{
return string ? strcpy ((char *) xmalloc (strlen (string) + 1),
string) : NULL;
}
const char *
base_name (const char *name)
{
const char *base;
#if defined (HAVE_DOS_BASED_FILE_SYSTEM)
/* Skip over the disk name in MSDOS pathnames. */
if (isalpha ((unsigned char) name[0]) && name[1] == ':')
name += 2;
#endif
for (base = name; *name; name++)
if (IS_DIR_SEPARATOR (*name))
base = name + 1;
return base;
}
int
check_executable (const char *path)
{
struct stat st;
lt_debugprintf (__FILE__, __LINE__, "(check_executable): %s\n",
nonempty (path));
if ((!path) || (!*path))
return 0;
if ((stat (path, &st) >= 0)
&& (st.st_mode & (S_IXUSR | S_IXGRP | S_IXOTH)))
return 1;
else
return 0;
}
int
make_executable (const char *path)
{
int rval = 0;
struct stat st;
lt_debugprintf (__FILE__, __LINE__, "(make_executable): %s\n",
nonempty (path));
if ((!path) || (!*path))
return 0;
if (stat (path, &st) >= 0)
{
rval = chmod (path, st.st_mode | S_IXOTH | S_IXGRP | S_IXUSR);
}
return rval;
}
/* Searches for the full path of the wrapper. Returns
newly allocated full path name if found, NULL otherwise
Does not chase symlinks, even on platforms that support them.
*/
char *
find_executable (const char *wrapper)
{
int has_slash = 0;
const char *p;
const char *p_next;
/* static buffer for getcwd */
char tmp[LT_PATHMAX + 1];
int tmp_len;
char *concat_name;
lt_debugprintf (__FILE__, __LINE__, "(find_executable): %s\n",
nonempty (wrapper));
if ((wrapper == NULL) || (*wrapper == '\0'))
return NULL;
/* Absolute path? */
#if defined (HAVE_DOS_BASED_FILE_SYSTEM)
if (isalpha ((unsigned char) wrapper[0]) && wrapper[1] == ':')
{
concat_name = xstrdup (wrapper);
if (check_executable (concat_name))
return concat_name;
XFREE (concat_name);
}
else
{
#endif
if (IS_DIR_SEPARATOR (wrapper[0]))
{
concat_name = xstrdup (wrapper);
if (check_executable (concat_name))
return concat_name;
XFREE (concat_name);
}
#if defined (HAVE_DOS_BASED_FILE_SYSTEM)
}
#endif
for (p = wrapper; *p; p++)
if (*p == '/')
{
has_slash = 1;
break;
}
if (!has_slash)
{
/* no slashes; search PATH */
const char *path = getenv ("PATH");
if (path != NULL)
{
for (p = path; *p; p = p_next)
{
const char *q;
size_t p_len;
for (q = p; *q; q++)
if (IS_PATH_SEPARATOR (*q))
break;
p_len = q - p;
p_next = (*q == '\0' ? q : q + 1);
if (p_len == 0)
{
/* empty path: current directory */
if (getcwd (tmp, LT_PATHMAX) == NULL)
lt_fatal (__FILE__, __LINE__, "getcwd failed: %s",
nonnull (strerror (errno)));
tmp_len = strlen (tmp);
concat_name =
XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1);
memcpy (concat_name, tmp, tmp_len);
concat_name[tmp_len] = '/';
strcpy (concat_name + tmp_len + 1, wrapper);
}
else
{
concat_name =
XMALLOC (char, p_len + 1 + strlen (wrapper) + 1);
memcpy (concat_name, p, p_len);
concat_name[p_len] = '/';
strcpy (concat_name + p_len + 1, wrapper);
}
if (check_executable (concat_name))
return concat_name;
XFREE (concat_name);
}
}
/* not found in PATH; assume curdir */
}
/* Relative path | not found in path: prepend cwd */
if (getcwd (tmp, LT_PATHMAX) == NULL)
lt_fatal (__FILE__, __LINE__, "getcwd failed: %s",
nonnull (strerror (errno)));
tmp_len = strlen (tmp);
concat_name = XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1);
memcpy (concat_name, tmp, tmp_len);
concat_name[tmp_len] = '/';
strcpy (concat_name + tmp_len + 1, wrapper);
if (check_executable (concat_name))
return concat_name;
XFREE (concat_name);
return NULL;
}
char *
chase_symlinks (const char *pathspec)
{
#ifndef S_ISLNK
return xstrdup (pathspec);
#else
char buf[LT_PATHMAX];
struct stat s;
char *tmp_pathspec = xstrdup (pathspec);
char *p;
int has_symlinks = 0;
while (strlen (tmp_pathspec) && !has_symlinks)
{
lt_debugprintf (__FILE__, __LINE__,
"checking path component for symlinks: %s\n",
tmp_pathspec);
if (lstat (tmp_pathspec, &s) == 0)
{
if (S_ISLNK (s.st_mode) != 0)
{
has_symlinks = 1;
break;
}
/* search backwards for last DIR_SEPARATOR */
p = tmp_pathspec + strlen (tmp_pathspec) - 1;
while ((p > tmp_pathspec) && (!IS_DIR_SEPARATOR (*p)))
p--;
if ((p == tmp_pathspec) && (!IS_DIR_SEPARATOR (*p)))
{
/* no more DIR_SEPARATORS left */
break;
}
*p = '\0';
}
else
{
lt_fatal (__FILE__, __LINE__,
"error accessing file \"%s\": %s",
tmp_pathspec, nonnull (strerror (errno)));
}
}
XFREE (tmp_pathspec);
if (!has_symlinks)
{
return xstrdup (pathspec);
}
tmp_pathspec = realpath (pathspec, buf);
if (tmp_pathspec == 0)
{
lt_fatal (__FILE__, __LINE__,
"could not follow symlinks for %s", pathspec);
}
return xstrdup (tmp_pathspec);
#endif
}
char *
strendzap (char *str, const char *pat)
{
size_t len, patlen;
assert (str != NULL);
assert (pat != NULL);
len = strlen (str);
patlen = strlen (pat);
if (patlen <= len)
{
str += len - patlen;
if (strcmp (str, pat) == 0)
*str = '\0';
}
return str;
}
void
lt_debugprintf (const char *file, int line, const char *fmt, ...)
{
va_list args;
if (lt_debug)
{
(void) fprintf (stderr, "%s:%s:%d: ", program_name, file, line);
va_start (args, fmt);
(void) vfprintf (stderr, fmt, args);
va_end (args);
}
}
static void
lt_error_core (int exit_status, const char *file,
int line, const char *mode,
const char *message, va_list ap)
{
fprintf (stderr, "%s:%s:%d: %s: ", program_name, file, line, mode);
vfprintf (stderr, message, ap);
fprintf (stderr, ".\n");
if (exit_status >= 0)
exit (exit_status);
}
void
lt_fatal (const char *file, int line, const char *message, ...)
{
va_list ap;
va_start (ap, message);
lt_error_core (EXIT_FAILURE, file, line, "FATAL", message, ap);
va_end (ap);
}
static const char *
nonnull (const char *s)
{
return s ? s : "(null)";
}
static const char *
nonempty (const char *s)
{
return (s && !*s) ? "(empty)" : nonnull (s);
}
void
lt_setenv (const char *name, const char *value)
{
lt_debugprintf (__FILE__, __LINE__,
"(lt_setenv) setting '%s' to '%s'\n",
nonnull (name), nonnull (value));
{
#ifdef HAVE_SETENV
/* always make a copy, for consistency with !HAVE_SETENV */
char *str = xstrdup (value);
setenv (name, str, 1);
#else
int len = strlen (name) + 1 + strlen (value) + 1;
char *str = XMALLOC (char, len);
sprintf (str, "%s=%s", name, value);
if (putenv (str) != EXIT_SUCCESS)
{
XFREE (str);
}
#endif
}
}
char *
lt_extend_str (const char *orig_value, const char *add, int to_end)
{
char *new_value;
if (orig_value && *orig_value)
{
int orig_value_len = strlen (orig_value);
int add_len = strlen (add);
new_value = XMALLOC (char, add_len + orig_value_len + 1);
if (to_end)
{
strcpy (new_value, orig_value);
strcpy (new_value + orig_value_len, add);
}
else
{
strcpy (new_value, add);
strcpy (new_value + add_len, orig_value);
}
}
else
{
new_value = xstrdup (add);
}
return new_value;
}
void
lt_update_exe_path (const char *name, const char *value)
{
lt_debugprintf (__FILE__, __LINE__,
"(lt_update_exe_path) modifying '%s' by prepending '%s'\n",
nonnull (name), nonnull (value));
if (name && *name && value && *value)
{
char *new_value = lt_extend_str (getenv (name), value, 0);
/* some systems can't cope with a ':'-terminated path #' */
int len = strlen (new_value);
while (((len = strlen (new_value)) > 0) && IS_PATH_SEPARATOR (new_value[len-1]))
{
new_value[len-1] = '\0';
}
lt_setenv (name, new_value);
XFREE (new_value);
}
}
void
lt_update_lib_path (const char *name, const char *value)
{
lt_debugprintf (__FILE__, __LINE__,
"(lt_update_lib_path) modifying '%s' by prepending '%s'\n",
nonnull (name), nonnull (value));
if (name && *name && value && *value)
{
char *new_value = lt_extend_str (getenv (name), value, 0);
lt_setenv (name, new_value);
XFREE (new_value);
}
}
void lt_dump_script (FILE* f)
{
fputs ("#! /bin/sh\n", f);
fputs ("\n", f);
fputs ("# lzmadec - temporary wrapper script for .libs/lzmadec\n", f);
fputs ("# Generated by libtool (GNU libtool) 2.4.2\n", f);
fputs ("#\n", f);
fputs ("# The lzmadec program cannot be directly executed until all the libtool\n", f);
fputs ("# libraries that it depends on are installed.\n", f);
fputs ("#\n", f);
fputs ("# This wrapper script should never be moved out of the build directory.\n", f);
fputs ("# If it is, it will not operate correctly.\n", f);
fputs ("\n", f);
fputs ("# Sed substitution that helps us do robust quoting. It backslashifies\n", f);
fputs ("# metacharacters that are still active within double-quoted strings.\n", f);
fputs ("sed_quote_subst='s/\\([`\"$\\\\]\\)/\\\\\\1/g'\n", f);
fputs ("\n", f);
fputs ("# Be Bourne compatible\n", f);
fputs ("if test -n \"${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then\n", f);
fputs (" emulate sh\n", f);
fputs (" NULLCMD=:\n", f);
fputs (" # Zsh 3.x and 4.x performs word splitting on ${1+\"$@\"}, which\n", f);
fputs (" # is contrary to our usage. Disable this feature.\n", f);
fputs (" alias -g '${1+\"$@\"}'='\"$@\"'\n", f);
fputs (" setopt NO_GLOB_SUBST\n", f);
fputs ("else\n", f);
fputs (" case `(set -o) 2>/dev/null` in *posix*) set -o posix;; esac\n", f);
fputs ("fi\n", f);
fputs ("BIN_SH=xpg4; export BIN_SH # for Tru64\n", f);
fputs ("DUALCASE=1; export DUALCASE # for MKS sh\n", f);
fputs ("\n", f);
fputs ("# The HP-UX ksh and POSIX shell print the target directory to stdout\n", f);
fputs ("# if CDPATH is set.\n", f);
fputs ("(unset CDPATH) >/dev/null 2>&1 && unset CDPATH\n", f);
fputs ("\n", f);
fputs ("relink_command=\"\"\n", f);
fputs ("\n", f);
fputs ("# This environment variable determines our operation mode.\n", f);
fputs ("if test \"$libtool_install_magic\" = \"%%%MAGIC variable%%%\"; then\n", f);
fputs (" # install mode needs the following variables:\n", f);
fputs (" generated_by_libtool_version='2.4.2'\n", f);
fputs (" notinst_deplibs=' ../../src/liblzma/liblzma.la /usr/lib/libintl.la /usr/lib/l", f);
fputs ("ibiconv.la'\n", f);
fputs ("else\n", f);
fputs (" # When we are sourced in execute mode, $file and $ECHO are already set.\n", f);
fputs (" if test \"$libtool_execute_magic\" != \"%%%MAGIC variable%%%\"; then\n", f);
fputs (" file=\"$0\"\n", f);
fputs ("\n", f);
fputs ("# A function that is used when there is no print builtin or printf.\n", f);
fputs ("func_fallback_echo ()\n", f);
fputs ("{\n", f);
fputs (" eval 'cat <<_LTECHO_EOF\n", f);
fputs ("$1\n", f);
fputs ("_LTECHO_EOF'\n", f);
fputs ("}\n", f);
fputs (" ECHO=\"printf %s\\\\n\"\n", f);
fputs (" fi\n", f);
fputs ("\n", f);
fputs ("# Very basic option parsing. These options are (a) specific to\n", f);
fputs ("# the libtool wrapper, (b) are identical between the wrapper\n", f);
fputs ("# /script/ and the wrapper /executable/ which is used only on\n", f);
fputs ("# windows platforms, and (c) all begin with the string --lt-\n", f);
fputs ("# (application programs are unlikely to have options which match\n", f);
fputs ("# this pattern).\n", f);
fputs ("#\n", f);
fputs ("# There are only two supported options: --lt-debug and\n", f);
fputs ("# --lt-dump-script. There is, deliberately, no --lt-help.\n", f);
fputs ("#\n", f);
fputs ("# The first argument to this parsing function should be the\n", f);
fputs ("# script's ../../libtool value, followed by yes.\n", f);
fputs ("lt_option_debug=\n", f);
fputs ("func_parse_lt_options ()\n", f);
fputs ("{\n", f);
fputs (" lt_script_arg0=$0\n", f);
fputs (" shift\n", f);
fputs (" for lt_opt\n", f);
fputs (" do\n", f);
fputs (" case \"$lt_opt\" in\n", f);
fputs (" --lt-debug) lt_option_debug=1 ;;\n", f);
fputs (" --lt-dump-script)\n", f);
fputs (" lt_dump_D=`$ECHO \"X$lt_script_arg0\" | /usr/bin/sed -e 's/^X//' -e 's%/[", f);
fputs ("^/]*$%%'`\n", f);
fputs (" test \"X$lt_dump_D\" = \"X$lt_script_arg0\" && lt_dump_D=.\n", f);
fputs (" lt_dump_F=`$ECHO \"X$lt_script_arg0\" | /usr/bin/sed -e 's/^X//' -e 's%^.", f);
fputs ("*/%%'`\n", f);
fputs (" cat \"$lt_dump_D/$lt_dump_F\"\n", f);
fputs (" exit 0\n", f);
fputs (" ;;\n", f);
fputs (" --lt-*)\n", f);
fputs (" $ECHO \"Unrecognized --lt- option: '$lt_opt'\" 1>&2\n", f);
fputs (" exit 1\n", f);
fputs (" ;;\n", f);
fputs (" esac\n", f);
fputs (" done\n", f);
fputs ("\n", f);
fputs (" # Print the debug banner immediately:\n", f);
fputs (" if test -n \"$lt_option_debug\"; then\n", f);
fputs (" echo \"lzmadec:lzmadec:${LINENO}: libtool wrapper (GNU libtool) 2.4.2\" 1>&2\n", f);
fputs (" fi\n", f);
fputs ("}\n", f);
fputs ("\n", f);
fputs ("# Used when --lt-debug. Prints its arguments to stdout\n", f);
fputs ("# (redirection is the responsibility of the caller)\n", f);
fputs ("func_lt_dump_args ()\n", f);
fputs ("{\n", f);
fputs (" lt_dump_args_N=1;\n", f);
fputs (" for lt_arg\n", f);
fputs (" do\n", f);
fputs (" $ECHO \"lzmadec:lzmadec:${LINENO}: newargv[$lt_dump_args_N]: $lt_arg\"\n", f);
fputs (" lt_dump_args_N=`expr $lt_dump_args_N + 1`\n", f);
fputs (" done\n", f);
fputs ("}\n", f);
fputs ("\n", f);
fputs ("# Core function for launching the target application\n", f);
fputs ("func_exec_program_core ()\n", f);
fputs ("{\n", f);
fputs ("\n", f);
fputs (" if test -n \"$lt_option_debug\"; then\n", f);
fputs (" $ECHO \"lzmadec:lzmadec:${LINENO}: newargv[0]: $progdir/$program\" 1>&2\n", f);
fputs (" func_lt_dump_args ${1+\"$@\"} 1>&2\n", f);
fputs (" fi\n", f);
fputs (" exec \"$progdir/$program\" ${1+\"$@\"}\n", f);
fputs ("\n", f);
fputs (" $ECHO \"$0: cannot exec $program $*\" 1>&2\n", f);
fputs (" exit 1\n", f);
fputs ("}\n", f);
fputs ("\n", f);
fputs ("# A function to encapsulate launching the target application\n", f);
fputs ("# Strips options in the --lt-* namespace from $@ and\n", f);
fputs ("# launches target application with the remaining arguments.\n", f);
fputs ("func_exec_program ()\n", f);
fputs ("{\n", f);
fputs (" case \" $* \" in\n", f);
fputs (" *\\ --lt-*)\n", f);
fputs (" for lt_wr_arg\n", f);
fputs (" do\n", f);
fputs (" case $lt_wr_arg in\n", f);
fputs (" --lt-*) ;;\n", f);
fputs (" *) set x \"$@\" \"$lt_wr_arg\"; shift;;\n", f);
fputs (" esac\n", f);
fputs (" shift\n", f);
fputs (" done ;;\n", f);
fputs (" esac\n", f);
fputs (" func_exec_program_core ${1+\"$@\"}\n", f);
fputs ("}\n", f);
fputs ("\n", f);
fputs (" # Parse options\n", f);
fputs (" func_parse_lt_options \"$0\" ${1+\"$@\"}\n", f);
fputs ("\n", f);
fputs (" # Find the directory that this script lives in.\n", f);
fputs (" thisdir=`$ECHO \"$file\" | /usr/bin/sed 's%/[^/]*$%%'`\n", f);
fputs (" test \"x$thisdir\" = \"x$file\" && thisdir=.\n", f);
fputs ("\n", f);
fputs (" # Follow symbolic links until we get to the real thisdir.\n", f);
fputs (" file=`ls -ld \"$file\" | /usr/bin/sed -n 's/.*-> //p'`\n", f);
fputs (" while test -n \"$file\"; do\n", f);
fputs (" destdir=`$ECHO \"$file\" | /usr/bin/sed 's%/[^/]*$%%'`\n", f);
fputs ("\n", f);
fputs (" # If there was a directory component, then change thisdir.\n", f);
fputs (" if test \"x$destdir\" != \"x$file\"; then\n", f);
fputs (" case \"$destdir\" in\n", f);
fputs (" [\\\\/]* | [A-Za-z]:[\\\\/]*) thisdir=\"$destdir\" ;;\n", f);
fputs (" *) thisdir=\"$thisdir/$destdir\" ;;\n", f);
fputs (" esac\n", f);
fputs (" fi\n", f);
fputs ("\n", f);
fputs (" file=`$ECHO \"$file\" | /usr/bin/sed 's%^.*/%%'`\n", f);
fputs (" file=`ls -ld \"$thisdir/$file\" | /usr/bin/sed -n 's/.*-> //p'`\n", f);
fputs (" done\n", f);
fputs ("\n", f);
fputs (" # Usually 'no', except on cygwin/mingw when embedded into\n", f);
fputs (" # the cwrapper.\n", f);
fputs (" WRAPPER_SCRIPT_BELONGS_IN_OBJDIR=yes\n", f);
fputs (" if test \"$WRAPPER_SCRIPT_BELONGS_IN_OBJDIR\" = \"yes\"; then\n", f);
fputs (" # special case for '.'\n", f);
fputs (" if test \"$thisdir\" = \".\"; then\n", f);
fputs (" thisdir=`pwd`\n", f);
fputs (" fi\n", f);
fputs (" # remove .libs from thisdir\n", f);
fputs (" case \"$thisdir\" in\n", f);
fputs (" *[\\\\/].libs ) thisdir=`$ECHO \"$thisdir\" | /usr/bin/sed 's%[\\\\/][^\\\\/]*$%%'`", f);
fputs (" ;;\n", f);
fputs (" .libs ) thisdir=. ;;\n", f);
fputs (" esac\n", f);
fputs (" fi\n", f);
fputs ("\n", f);
fputs (" # Try to get the absolute directory name.\n", f);
fputs (" absdir=`cd \"$thisdir\" && pwd`\n", f);
fputs (" test -n \"$absdir\" && thisdir=\"$absdir\"\n", f);
fputs ("\n", f);
fputs (" program='lzmadec'\n", f);
fputs (" progdir=\"$thisdir/.libs\"\n", f);
fputs ("\n", f);
fputs ("\n", f);
fputs (" if test -f \"$progdir/$program\"; then\n", f);
fputs (" # Add the dll search path components to the executable PATH\n", f);
fputs (" PATH=/home/liblzma-master/src/liblzma/.libs:/usr/local/lib:/usr/local/bin:$", f);
fputs ("PATH\n", f);
fputs ("\n", f);
fputs (" # Add our own library path to PATH\n", f);
fputs (" PATH=\"/home/liblzma-master/src/liblzma/.libs:/usr/lib:$PATH\"\n", f);
fputs ("\n", f);
fputs (" # Some systems cannot cope with colon-terminated PATH\n", f);
fputs (" # The second colon is a workaround for a bug in BeOS R4 sed\n", f);
fputs (" PATH=`$ECHO \"$PATH\" | /usr/bin/sed 's/::*$//'`\n", f);
fputs ("\n", f);
fputs (" export PATH\n", f);
fputs ("\n", f);
fputs (" if test \"$libtool_execute_magic\" != \"%%%MAGIC variable%%%\"; then\n", f);
fputs (" # Run the actual program with our arguments.\n", f);
fputs (" func_exec_program ${1+\"$@\"}\n", f);
fputs (" fi\n", f);
fputs (" else\n", f);
fputs (" # The program doesn't exist.\n", f);
fputs (" $ECHO \"$0: error: \\`$progdir/$program' does not exist\" 1>&2\n", f);
fputs (" $ECHO \"This script is just a wrapper for $program.\" 1>&2\n", f);
fputs (" $ECHO \"See the libtool documentation for more information.\" 1>&2\n", f);
fputs (" exit 1\n", f);
fputs (" fi\n", f);
fputs ("fi\n", f);
}
|
the_stack_data/290900.c
|
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_isalpha.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: rlambert <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2014/11/04 15:58:40 by rlambert #+# #+# */
/* Updated: 2014/11/06 19:19:44 by rlambert ### ########.fr */
/* */
/* ************************************************************************** */
int ft_isalpha(int c)
{
return (('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z'));
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.