dwarf-synthesis/testsuite/csmith/gcc_O1/93.c

123 lines
3.5 KiB
C

/*
* This is a RANDOMLY GENERATED PROGRAM.
*
* Generator: csmith 2.3.0
* Git version: 30dccd7
* Options: (none)
* Seed: 14933609847687001510
*/
#include "csmith.h"
static long __undefined;
/* --- Struct/Union Declarations --- */
/* --- GLOBAL VARIABLES --- */
static volatile int32_t g_3 = (-1L);/* VOLATILE GLOBAL g_3 */
static volatile int32_t g_4 = 0xBB8BFFBEL;/* VOLATILE GLOBAL g_4 */
static volatile int32_t g_5[8] = {(-9L),(-9L),(-9L),(-9L),(-9L),(-9L),(-9L),(-9L)};
static int32_t g_6[1] = {1L};
/* --- FORWARD DECLARATIONS --- */
const int64_t func_1(void);
/* --- FUNCTIONS --- */
/* ------------------------------------------ */
/*
* reads : g_6
* writes: g_6
*/
const int64_t func_1(void)
{ /* block id: 0 */
int32_t l_2[3][4][4] = {{{0xF0B101AAL,(-6L),0xF0B101AAL,(-6L)},{0xF0B101AAL,(-6L),0xF0B101AAL,(-6L)},{0xF0B101AAL,(-6L),0xF0B101AAL,(-6L)},{0xF0B101AAL,(-6L),0xF0B101AAL,(-6L)}},{{0xF0B101AAL,(-6L),0xF0B101AAL,(-6L)},{0xF0B101AAL,(-6L),0xF0B101AAL,(-6L)},{0xF0B101AAL,(-6L),0xF0B101AAL,(-6L)},{0xF0B101AAL,(-6L),0xF0B101AAL,(-6L)}},{{0xF0B101AAL,(-6L),0xF0B101AAL,(-6L)},{0xF0B101AAL,(-6L),0xF0B101AAL,(-6L)},{0xF0B101AAL,(-6L),0xF0B101AAL,(-6L)},{0xF0B101AAL,(-6L),0xF0B101AAL,(-6L)}}};
int i, j, k;
for (g_6[0] = 0; (g_6[0] <= 2); g_6[0] += 1)
{ /* block id: 3 */
return l_2[0][3][0];
}
return g_6[0];
}
/* ---------------------------------------- */
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();
transparent_crc(g_3, "g_3", print_hash_value);
transparent_crc(g_4, "g_4", print_hash_value);
for (i = 0; i < 8; i++)
{
transparent_crc(g_5[i], "g_5[i]", print_hash_value);
if (print_hash_value) printf("index = [%d]\n", i);
}
for (i = 0; i < 1; i++)
{
transparent_crc(g_6[i], "g_6[i]", print_hash_value);
if (print_hash_value) printf("index = [%d]\n", i);
}
platform_main_end(crc32_context ^ 0xFFFFFFFFUL, print_hash_value);
return 0;
}
/************************ statistics *************************
XXX max struct depth: -1
breakdown:
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: 2
depth: 2, occurrence: 1
XXX total number of pointers: 0
XXX times a non-volatile is read: 3
XXX times a non-volatile is write: 1
XXX times a volatile is read: 0
XXX times read thru a pointer: 0
XXX times a volatile is write: 0
XXX times written thru a pointer: 0
XXX times a volatile is available for access: 4
XXX percentage of non-volatile access: 100
XXX forward jumps: 0
XXX backward jumps: 0
XXX stmts: 3
XXX max block depth: 1
breakdown:
depth: 0, occurrence: 2
depth: 1, occurrence: 1
XXX percentage a fresh-made variable is used: 0
XXX percentage an existing variable is used: 100
FYI: the random generator makes assumptions about the integer size. See platform.info for more details.
********************* end of statistics **********************/