dwarf-synthesis/testsuite/csmith/clang_O1/06.c

140 lines
3.7 KiB
C

/*
* This is a RANDOMLY GENERATED PROGRAM.
*
* Generator: csmith 2.3.0
* Git version: 30dccd7
* Options: (none)
* Seed: 13930343148203463444
*/
#include "csmith.h"
static long __undefined;
/* --- Struct/Union Declarations --- */
union U0 {
signed f0 : 24;
uint16_t f1;
unsigned f2 : 27;
uint32_t f3;
uint8_t f4;
};
/* --- GLOBAL VARIABLES --- */
static int32_t g_3[4][4] = {{0xF7FBF212L,0xF7FBF212L,0xF7FBF212L,0xF7FBF212L},{0xF7FBF212L,0xF7FBF212L,0xF7FBF212L,0xF7FBF212L},{0xF7FBF212L,0xF7FBF212L,0xF7FBF212L,0xF7FBF212L},{0xF7FBF212L,0xF7FBF212L,0xF7FBF212L,0xF7FBF212L}};
static volatile uint16_t g_4 = 4UL;/* VOLATILE GLOBAL g_4 */
/* --- FORWARD DECLARATIONS --- */
union U0 func_1(void);
/* --- FUNCTIONS --- */
/* ------------------------------------------ */
/*
* reads : g_4
* writes: g_4
*/
union U0 func_1(void)
{ /* block id: 0 */
int32_t *l_2[7];
union U0 l_7[1][4] = {{{0x3DFAD5BEL},{0x3DFAD5BEL},{0x3DFAD5BEL},{0x3DFAD5BEL}}};
int i, j;
for (i = 0; i < 7; i++)
l_2[i] = &g_3[2][3];
g_4++;
return l_7[0][0];
}
/* ---------------------------------------- */
int main (int argc, char* argv[])
{
int i, j;
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 < 4; i++)
{
for (j = 0; j < 4; j++)
{
transparent_crc(g_3[i][j], "g_3[i][j]", print_hash_value);
if (print_hash_value) printf("index = [%d][%d]\n", i, j);
}
}
transparent_crc(g_4, "g_4", print_hash_value);
platform_main_end(crc32_context ^ 0xFFFFFFFFUL, print_hash_value);
return 0;
}
/************************ statistics *************************
XXX max struct depth: 0
breakdown:
depth: 0, occurrence: 2
XXX total union variables: 1
XXX non-zero bitfields defined in structs: 2
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: 1
breakdown:
indirect level: 0, occurrence: 1
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: 1
XXX times a single bitfield on LHS: 0
XXX times a single bitfield on RHS: 0
XXX max expression depth: 1
breakdown:
depth: 1, occurrence: 3
XXX total number of pointers: 1
XXX times a variable address is taken: 1
XXX times a pointer is dereferenced on RHS: 0
breakdown:
XXX times a pointer is dereferenced on LHS: 0
breakdown:
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: 33
XXX number of pointers point to pointers: 0
XXX number of pointers point to scalars: 1
XXX number of pointers point to structs: 0
XXX percent of pointers has null in alias set: 0
XXX average alias set size: 1
XXX times a non-volatile is read: 1
XXX times a non-volatile is write: 0
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: 50
XXX forward jumps: 0
XXX backward jumps: 0
XXX stmts: 2
XXX max block depth: 0
breakdown:
depth: 0, occurrence: 2
XXX percentage a fresh-made variable is used: 22.2
XXX percentage an existing variable is used: 77.8
FYI: the random generator makes assumptions about the integer size. See platform.info for more details.
********************* end of statistics **********************/