dwarf-synthesis/testsuite/csmith/clang_O2/11.c

152 lines
3.8 KiB
C

/*
* This is a RANDOMLY GENERATED PROGRAM.
*
* Generator: csmith 2.3.0
* Git version: 30dccd7
* Options: (none)
* Seed: 1303608952689869277
*/
#include "csmith.h"
static long __undefined;
/* --- Struct/Union Declarations --- */
/* --- GLOBAL VARIABLES --- */
static int16_t g_2[7] = {0x37BCL,0x642CL,0x37BCL,0x37BCL,0x642CL,0x37BCL,0x37BCL};
static int32_t g_4[4] = {5L,5L,5L,5L};
static int32_t g_6 = (-1L);
static int32_t * const volatile g_5 = &g_6;/* VOLATILE GLOBAL g_5 */
static int32_t *g_10 = (void*)0;
/* --- FORWARD DECLARATIONS --- */
int64_t func_1(void);
int32_t * func_7(int32_t * p_8);
/* --- FUNCTIONS --- */
/* ------------------------------------------ */
/*
* reads : g_2 g_4 g_5
* writes: g_4 g_6 g_10
*/
int64_t func_1(void)
{ /* block id: 0 */
int32_t *l_3 = &g_4[3];
(*g_5) = ((*l_3) |= g_2[4]);
g_10 = func_7(&g_4[0]);
return g_4[0];
}
/* ------------------------------------------ */
/*
* reads :
* writes:
*/
int32_t * func_7(int32_t * p_8)
{ /* block id: 3 */
int32_t *l_9 = &g_4[0];
return l_9;
}
/* ---------------------------------------- */
int main (int argc, char* argv[])
{
int i;
int print_hash_value = 0;
if (argc == 2 && strcmp(argv[1], "1") == 0) print_hash_value = 1;
platform_main_begin();
crc32_gentab();
func_1();
for (i = 0; i < 7; i++)
{
transparent_crc(g_2[i], "g_2[i]", print_hash_value);
if (print_hash_value) printf("index = [%d]\n", i);
}
for (i = 0; i < 4; i++)
{
transparent_crc(g_4[i], "g_4[i]", print_hash_value);
if (print_hash_value) printf("index = [%d]\n", i);
}
transparent_crc(g_6, "g_6", print_hash_value);
platform_main_end(crc32_context ^ 0xFFFFFFFFUL, print_hash_value);
return 0;
}
/************************ statistics *************************
XXX max struct depth: 0
breakdown:
depth: 0, occurrence: 3
XXX total union variables: 0
XXX non-zero bitfields defined in structs: 0
XXX zero bitfields defined in structs: 0
XXX const bitfields defined in structs: 0
XXX volatile bitfields defined in structs: 0
XXX structs with bitfields in the program: 0
breakdown:
XXX full-bitfields structs in the program: 0
breakdown:
XXX times a bitfields struct's address is taken: 0
XXX times a bitfields struct on LHS: 0
XXX times a bitfields struct on RHS: 0
XXX times a single bitfield on LHS: 0
XXX times a single bitfield on RHS: 0
XXX max expression depth: 2
breakdown:
depth: 1, occurrence: 4
depth: 2, occurrence: 2
XXX total number of pointers: 4
XXX times a variable address is taken: 4
XXX times a pointer is dereferenced on RHS: 0
breakdown:
XXX times a pointer is dereferenced on LHS: 2
breakdown:
depth: 1, occurrence: 2
XXX times a pointer is compared with null: 0
XXX times a pointer is compared with address of another variable: 0
XXX times a pointer is compared with another pointer: 0
XXX times a pointer is qualified to be dereferenced: 3
XXX max dereference level: 1
breakdown:
level: 0, occurrence: 0
level: 1, occurrence: 4
XXX number of pointers point to pointers: 0
XXX number of pointers point to scalars: 4
XXX number of pointers point to structs: 0
XXX percent of pointers has null in alias set: 25
XXX average alias set size: 1.25
XXX times a non-volatile is read: 3
XXX times a non-volatile is write: 4
XXX times a volatile is read: 0
XXX times read thru a pointer: 0
XXX times a volatile is write: 1
XXX times written thru a pointer: 0
XXX times a volatile is available for access: 0
XXX percentage of non-volatile access: 87.5
XXX forward jumps: 0
XXX backward jumps: 0
XXX stmts: 4
XXX max block depth: 0
breakdown:
depth: 0, occurrence: 4
XXX percentage a fresh-made variable is used: 60
XXX percentage an existing variable is used: 40
********************* end of statistics **********************/