Dataset Viewer
Auto-converted to Parquet Duplicate
dataset
stringclasses
1 value
file
stringlengths
27
83
fun_name
stringlengths
7
83
llvm_ir_function
stringlengths
61
8.29k
label
stringclasses
2 values
juliet-test-suite-c
CWE134_Uncontrolled_Format_String__char_console_fprintf_14-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 0, i64* %sv_0, align 8 %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = bitcast i64* %sv_0 to i8* %5 = ptrtoint i64* %sv_0 to i64 store i64 8247343692658534758, i64* %sv_0, align 8 %6 = add i64 %5, 8 %7 = inttoptr i64 %6 to i64* store i64 32777976880262761, i64* %7, align 8 %8 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8 %9 = call i32 (%_IO_FILE*, i8*, ...) @fprintf(%_IO_FILE* %8, i8* nonnull %4) br label LBL_2 LBL_2: %10 = call i64 @FUNC(i64 40) %11 = icmp eq i64 %0, %10 store i64 0, i64* %rax.0.reg2mem br i1 %11, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %sv_0, { 1, 0, 2, 3 } uselistorder i32 (%_IO_FILE*, i8*, ...)* @fprintf, { 3, 2, 1, 0, 4 } uselistorder %_IO_FILE** @gv_1, { 3, 2, 1, 0 } uselistorder i32 5, { 1, 0, 2, 3, 4, 5, 6, 7 } uselistorder i32* @gv_0, { 5, 0, 4, 3, 2, 1 } uselistorder label LBL_2, { 1, 0 } }
0
juliet-test-suite-c
CWE127_Buffer_Underread__char_alloca_cpy_05-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i8*, align 8 %sv_2 = alloca i8*, align 8 %0 = ptrtoint i8** %sv_2 to i64 %1 = call i64 @FUNC(i64 40) %2 = add i64 %0, -97 %3 = and i64 %2, -16 %4 = inttoptr i64 %3 to i8* store i8* %4, i8** %sv_1, align 8 %5 = inttoptr i64 %3 to i64* %6 = call i64* @memset(i64* %5, i32 65, i32 99) %7 = add i64 %3, 99 %8 = inttoptr i64 %7 to i8* store i8 0, i8* %8, align 1 %9 = load i32, i32* @gv_0, align 4 %10 = icmp eq i32 %9, 0 br i1 %10, label LBL_2, label LBL_1 LBL_1: %11 = load i8*, i8** %sv_1, align 8 %12 = ptrtoint i8* %11 to i64 %13 = bitcast i8** %sv_2 to i64* store i64 %12, i64* %13, align 8 br label LBL_2 LBL_2: %14 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 199) %15 = load i8*, i8** %sv_2, align 8 %16 = bitcast i64* %sv_0 to i8* %17 = call i8* @strcpy(i8* nonnull %16, i8* %15) %18 = ptrtoint i64* %sv_0 to i64 %19 = call i64 @FUNC(i64 %18) %20 = call i64 @FUNC(i64 40) %21 = icmp eq i64 %1, %20 store i64 0, i64* %rax.0.reg2mem br i1 %21, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %3, { 1, 0, 2 } uselistorder i8** %sv_2, { 2, 0, 1 } uselistorder i64* %sv_0, { 2, 0, 1 } uselistorder i8* (i8*, i8*)* @strcpy, { 1, 0, 2 } uselistorder i64* (i64*, i32, i32)* @memset, { 3, 2, 1, 0, 4 } }
0
juliet-test-suite-c
CWE190_Integer_Overflow__short_rand_square_04-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = call i32 @rand() %1 = urem i32 %0, 2 %2 = icmp eq i32 %1, 0 %3 = call i32 @rand() %4 = call i32 @rand() %5 = mul i32 %4, 32768 %6 = call i32 @rand() %7 = xor i32 %6, %5 %8 = sext i1 %2 to i32 %storemerge.in = xor i32 %7, %8 %sext = mul i32 %storemerge.in, 65536 %9 = ashr exact i32 %sext, 16 %10 = trunc i32 %9 to i16 %11 = sub i16 0, %10 %12 = icmp slt i16 %11, 0 %13 = icmp eq i1 %12, false %14 = zext i16 %11 to i32 %15 = select i1 %13, i32 %14, i32 %9 %16 = trunc i32 %15 to i16 %17 = icmp ult i16 %16, 182 br i1 %17, label LBL_1, label LBL_2 LBL_1: %18 = urem i32 %9, 65536 %sext2 = mul i32 %18, %sext %19 = ashr exact i32 %sext2, 16 %20 = zext i32 %19 to i64 %21 = call i64 @FUNC(i64 %20) store i64 %21, i64* %rax.0.reg2mem br label LBL_3 LBL_2: %22 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_0 to i64)) store i64 %22, i64* %rax.0.reg2mem br label LBL_3 LBL_3: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %9, { 0, 2, 1 } uselistorder i32 %sext, { 1, 0 } uselistorder i32 65536, { 2, 0, 3, 1 } }
0
juliet-test-suite-c
CWE191_Integer_Underflow__unsigned_int_rand_sub_31-good
goodB2G
define i64 @FUNC() local_unnamed_addr { LBL_0: %storemerge.reg2mem = alloca i64 %0 = call i32 @rand() %1 = urem i32 %0, 2 %2 = icmp eq i32 %1, 0 %3 = call i32 @rand() %4 = mul i32 %3, 1073741824 %5 = call i32 @rand() %6 = mul i32 %5, 32768 %7 = xor i32 %6, %4 %8 = call i32 @rand() %9 = xor i32 %7, %8 %10 = sext i1 %2 to i32 %storemerge2.in = xor i32 %9, %10 %11 = icmp eq i32 %storemerge2.in, 0 br i1 %11, label LBL_2, label LBL_1 LBL_1: %12 = add i32 %storemerge2.in, -1 %13 = zext i32 %12 to i64 %14 = call i64 @FUNC(i64 %13) store i64 %14, i64* %storemerge.reg2mem br label LBL_3 LBL_2: %15 = call i64 @FUNC(i64 ptrtoint ([48 x i8]* @gv_0 to i64)) store i64 %15, i64* %storemerge.reg2mem br label LBL_3 LBL_3: %storemerge.reload = load i64, i64* %storemerge.reg2mem ret i64 %storemerge.reload uselistorder i32 %storemerge2.in, { 1, 0 } uselistorder i64* %storemerge.reg2mem, { 0, 2, 1 } uselistorder i64 (i64)* @printUnsignedLine, { 1, 0 } }
0
juliet-test-suite-c
CWE401_Memory_Leak__malloc_realloc_twoIntsStruct_12-bad
CWE401_Memory_Leak__malloc_realloc_twoIntsStruct_12_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %0 = call i64 @FUNC() %1 = trunc i64 %0 to i32 %2 = icmp eq i32 %1, 0 %3 = call i64* @malloc(i32 ptrtoint (i32* @gv_0 to i32)) %4 = ptrtoint i64* %3 to i64 %5 = icmp eq i64* %3, null %6 = icmp eq i1 %5, false br i1 %2, label LBL_5, label LBL_1 LBL_1: br i1 %6, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %7 = bitcast i64* %3 to i32* store i32 0, i32* %7, align 4 %8 = add i64 %4, 4 %9 = inttoptr i64 %8 to i32* store i32 0, i32* %9, align 4 %10 = call i64 @FUNC(i64 %4) %11 = call i64* @realloc(i64* %3, i32 1040000) %12 = ptrtoint i64* %11 to i64 %13 = icmp eq i64* %11, null store i64 %12, i64* %rax.0.reg2mem br i1 %13, label LBL_10, label LBL_4 LBL_4: %14 = bitcast i64* %11 to i32* store i32 1, i32* %14, align 4 %15 = add i64 %12, 4 %16 = inttoptr i64 %15 to i32* store i32 1, i32* %16, align 4 %17 = call i64 @FUNC(i64 %12) call void @free(i64* nonnull %11) store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_10 LBL_5: br i1 %6, label LBL_7, label LBL_6 LBL_6: call void @exit(i32 -1) unreachable LBL_7: %18 = bitcast i64* %3 to i32* store i32 0, i32* %18, align 4 %19 = add i64 %4, 4 %20 = inttoptr i64 %19 to i32* store i32 0, i32* %20, align 4 %21 = call i64 @FUNC(i64 %4) %22 = call i64* @realloc(i64* %3, i32 1040000) %23 = icmp eq i64* %22, null store i64 %4, i64* %sv_0.0.reg2mem br i1 %23, label LBL_9, label LBL_8 LBL_8: %24 = ptrtoint i64* %22 to i64 %25 = bitcast i64* %22 to i32* store i32 1, i32* %25, align 4 %26 = add i64 %24, 4 %27 = inttoptr i64 %26 to i32* store i32 1, i32* %27, align 4 %28 = call i64 @FUNC(i64 %24) store i64 %24, i64* %sv_0.0.reg2mem br label LBL_9 LBL_9: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %29 = inttoptr i64 %sv_0.0.reload to i64* call void @free(i64* %29) store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_10 LBL_10: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %24, { 0, 2, 1 } uselistorder i64* %22, { 0, 2, 1 } uselistorder i64 %12, { 1, 2, 0 } uselistorder i1 %6, { 1, 0 } uselistorder i64 %4, { 0, 3, 4, 1, 2 } uselistorder i64* %rax.0.reg2mem, { 0, 3, 1, 2 } uselistorder i64* (i64*, i32)* @realloc, { 1, 0, 2 } uselistorder i64 (i64)* @printStructLine, { 3, 2, 1, 0 } uselistorder void (i32)* @exit, { 1, 0, 2 } uselistorder i64* null, { 0, 2, 1 } }
1
juliet-test-suite-c
CWE78_OS_Command_Injection__char_file_execl_04-bad
CWE78_OS_Command_Injection__char_file_execl_04_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 2126700, i64* %sv_0, align 8 %1 = bitcast i64* %sv_0 to i8* %2 = call i32 @strlen(i8* nonnull %1) %3 = sext i32 %2 to i64 %4 = sub nsw i64 100, %3 %5 = icmp ult i64 %4, 2 br i1 %5, label LBL_5, label LBL_1 LBL_1: %6 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @gv_1, i64 0, i64 0)) %7 = icmp eq %_IO_FILE* %6, null br i1 %7, label LBL_5, label LBL_2 LBL_2: %8 = sub i32 100, %2 %9 = ptrtoint i64* %sv_0 to i64 %10 = add i64 %3, %9 %11 = inttoptr i64 %10 to i8* %12 = call i8* @fgets(i8* %11, i32 %8, %_IO_FILE* nonnull %6) %13 = icmp eq i8* %12, null %14 = icmp eq i1 %13, false br i1 %14, label LBL_4, label LBL_3 LBL_3: %15 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_2 to i64)) store i8 0, i8* %11, align 1 br label LBL_4 LBL_4: %16 = call i32 @fclose(%_IO_FILE* nonnull %6) br label LBL_5 LBL_5: %17 = call i32 (i8*, i8*, ...) @execl(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @gv_3, i64 0, i64 0), i8* getelementptr inbounds ([8 x i8], [8 x i8]* @gv_3, i64 0, i64 0)) %18 = call i64 @FUNC(i64 40) %19 = icmp eq i64 %0, %18 store i64 0, i64* %rax.0.reg2mem br i1 %19, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload }
1
juliet-test-suite-c
CWE124_Buffer_Underwrite__CWE839_connect_socket_31-bad
CWE124_Buffer_Underwrite__CWE839_connect_socket_31_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %indvars.iv.reg2mem = alloca i64 %sv_0.034.reg2mem = alloca i32 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %sv_3 = alloca i64, align 8 %0 = ptrtoint i64* %sv_3 to i64 %1 = call i64 @FUNC(i64 40) %2 = call i32 @socket(i32 2, i32 1, i32 6) %3 = icmp eq i32 %2, -1 br i1 %3, label LBL_1, label LBL_2 LBL_1: store i64 0, i64* %sv_2, align 8 store i32 -1, i32* %sv_0.034.reg2mem br label LBL_6 LBL_2: %4 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16) store i64 2, i64* %sv_2, align 8 %5 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0)) %6 = call i16 @htons(i16 27015) %7 = bitcast i64* %sv_2 to %sockaddr* %8 = call i32 @connect(i32 %2, %sockaddr* nonnull %7, i32 16) %9 = icmp eq i32 %8, -1 br i1 %9, label LBL_15, label LBL_3 LBL_3: %10 = call i32 @recv(i32 %2, i64* nonnull %sv_1, i32 13, i32 0) %11 = add i32 %10, 1 %12 = icmp ult i32 %11, 2 br i1 %12, label LBL_15, label LBL_5 LBL_4: %13 = call i32 @close(i32 %2) store i64 0, i64* %sv_2, align 8 store i32 -1, i32* %sv_0.034.reg2mem br label LBL_6 LBL_5: %14 = sext i32 %10 to i64 %15 = add i64 %0, -22 %16 = add i64 %15, %14 %17 = inttoptr i64 %16 to i8* store i8 0, i8* %17, align 1 %18 = bitcast i64* %sv_1 to i8* %19 = call i32 @atoi(i8* nonnull %18) %20 = call i32 @close(i32 %2) store i64 0, i64* %sv_2, align 8 %21 = icmp sgt i32 %19, 9 store i32 %19, i32* %sv_0.034.reg2mem br i1 %21, label LBL_8, label LBL_6 LBL_6: %sv_0.034.reload = load i32, i32* %sv_0.034.reg2mem %22 = sext i32 %sv_0.034.reload to i64 %23 = mul i64 %22, 4 %24 = add i64 %0, -64 %25 = add i64 %23, %24 %26 = inttoptr i64 %25 to i32* store i32 1, i32* %26, align 4 store i64 0, i64* %indvars.iv.reg2mem br label LBL_7 LBL_7: %indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem %27 = mul i64 %indvars.iv.reload, 4 %28 = add i64 %27, %24 %29 = inttoptr i64 %28 to i32* %30 = load i32, i32* %29, align 4 %31 = zext i32 %30 to i64 %32 = call i64 @FUNC(i64 %31) %indvars.iv.next = add nuw nsw i64 %indvars.iv.reload, 1 %exitcond = icmp eq i64 %indvars.iv.next, 10 store i64 %indvars.iv.next, i64* %indvars.iv.reg2mem br i1 %exitcond, label LBL_9, label LBL_7 LBL_8: %33 = call i64 @FUNC(i64 ptrtoint ([32 x i8]* @gv_1 to i64)) br label LBL_9 LBL_9: %34 = call i64 @FUNC(i64 40) %35 = icmp eq i64 %1, %34 store i64 0, i64* %rax.0.reg2mem br i1 %35, label LBL_11, label LBL_10 LBL_10: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_11 LBL_11: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %10, { 1, 0 } uselistorder i32 %2, { 3, 0, 1, 2, 4 } uselistorder i64 %0, { 1, 0 } uselistorder i64* %sv_2, { 4, 0, 2, 5, 3, 1 } uselistorder i32* %sv_0.034.reg2mem, { 0, 2, 1, 3 } uselistorder i64* %indvars.iv.reg2mem, { 1, 0, 2 } uselistorder i32 (i32)* @close, { 1, 0, 2 } uselistorder i32 -1, { 0, 2, 1, 3 } uselistorder label LBL_9, { 1, 0 } uselistorder label LBL_6, { 2, 0, 1 } }
1
juliet-test-suite-c
CWE78_OS_Command_Injection__char_connect_socket_execl_03-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 2126700, i64* %sv_0, align 8 %1 = ptrtoint i64* %sv_0 to i64 %2 = bitcast i64* %sv_0 to i8* %3 = call i32 @strlen(i8* nonnull %2) %4 = sext i32 %3 to i64 %5 = add i64 %4, %1 %6 = inttoptr i64 %5 to i32* store i32 2764330, i32* %6, align 4 %7 = call i32 (i8*, i8*, ...) @execl(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([8 x i8], [8 x i8]* @gv_0, i64 0, i64 0)) %8 = call i64 @FUNC(i64 40) %9 = icmp eq i64 %0, %8 store i64 0, i64* %rax.0.reg2mem br i1 %9, label LBL_2, label LBL_1 LBL_1: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 (i8*, i8*, ...)* @execl, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE134_Uncontrolled_Format_String__char_file_printf_04-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 0, i64* %sv_0, align 8 %1 = bitcast i64* %sv_0 to i8* %2 = call i32 @strlen(i8* nonnull %1) %3 = sext i32 %2 to i64 %4 = sub nsw i64 100, %3 %5 = icmp ult i64 %4, 2 br i1 %5, label LBL_5, label LBL_1 LBL_1: %6 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @gv_1, i64 0, i64 0)) %7 = icmp eq %_IO_FILE* %6, null br i1 %7, label LBL_5, label LBL_2 LBL_2: %8 = sub i32 100, %2 %9 = ptrtoint i64* %sv_0 to i64 %10 = add i64 %3, %9 %11 = inttoptr i64 %10 to i8* %12 = call i8* @fgets(i8* %11, i32 %8, %_IO_FILE* nonnull %6) %13 = icmp eq i8* %12, null %14 = icmp eq i1 %13, false br i1 %14, label LBL_4, label LBL_3 LBL_3: %15 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_2 to i64)) store i8 0, i8* %11, align 1 br label LBL_4 LBL_4: %16 = call i32 @fclose(%_IO_FILE* nonnull %6) br label LBL_5 LBL_5: %17 = call i32 @puts(i8* nonnull %1) %18 = call i64 @FUNC(i64 40) %19 = icmp eq i64 %0, %18 store i64 0, i64* %rax.0.reg2mem br i1 %19, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder label LBL_5, { 2, 1, 0 } }
0
juliet-test-suite-c
CWE127_Buffer_Underread__malloc_char_loop_02-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge1.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64* @malloc(i32 100) %2 = icmp eq i64* %1, null %3 = icmp eq i1 %2, false br i1 %3, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 -1) unreachable LBL_2: %4 = ptrtoint i64* %1 to i64 %5 = call i64* @memset(i64* %1, i32 65, i32 99) %6 = add i64 %4, 99 %7 = inttoptr i64 %6 to i8* store i8 0, i8* %7, align 1 %8 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99) %9 = ptrtoint i64* %sv_0 to i64 store i64 0, i64* %storemerge1.reg2mem br label LBL_3 LBL_3: %storemerge1.reload = load i64, i64* %storemerge1.reg2mem %10 = add i64 %storemerge1.reload, %4 %11 = inttoptr i64 %10 to i8* %12 = load i8, i8* %11, align 1 %13 = add i64 %storemerge1.reload, %9 %14 = inttoptr i64 %13 to i8* store i8 %12, i8* %14, align 1 %15 = add nuw nsw i64 %storemerge1.reload, 1 %exitcond = icmp eq i64 %15, 100 store i64 %15, i64* %storemerge1.reg2mem br i1 %exitcond, label LBL_4, label LBL_3 LBL_4: %16 = call i64 @FUNC(i64* nonnull %sv_0) %17 = call i64 @FUNC(i64 40) %18 = icmp eq i64 %0, %17 store i64 0, i64* %rax.0.reg2mem br i1 %18, label LBL_6, label LBL_5 LBL_5: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_6 LBL_6: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %storemerge1.reload, { 0, 2, 1 } uselistorder i64* %1, { 0, 2, 1 } uselistorder i64* %sv_0, { 0, 2, 1 } uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE400_Resource_Exhaustion__fscanf_sleep_02-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i32, align 4 %0 = call i64 @FUNC(i64 40) store i32 -1, i32* %sv_0, align 4 %1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i32* nonnull %sv_0) %3 = load i32, i32* %sv_0, align 4 %4 = icmp slt i32 %3, 1 %5 = icmp sgt i32 %3, ptrtoint (i1* @gv_2 to i32) %or.cond = or i1 %4, %5 br i1 %or.cond, label LBL_2, label LBL_1 LBL_1: %6 = call i32 @usleep(i32 %3) %7 = call i64 @FUNC(i64 ptrtoint ([14 x i8]* @gv_3 to i64)) br label LBL_3 LBL_2: %8 = call i64 @FUNC(i64 ptrtoint ([20 x i8]* @gv_4 to i64)) br label LBL_3 LBL_3: %9 = call i64 @FUNC(i64 40) %10 = icmp eq i64 %0, %9 store i64 0, i64* %rax.0.reg2mem br i1 %10, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32* %sv_0, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE135_08-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i8*, align 8 %0 = call i64 @FUNC(i64 40) store i8* null, i8** %sv_0, align 8 %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64)) br label LBL_3 LBL_2: store i8* getelementptr inbounds ([43 x i8], [43 x i8]* @gv_1, i64 0, i64 0), i8** %sv_0, align 8 br label LBL_3 LBL_3: %5 = call i64 @FUNC() %6 = trunc i64 %5 to i32 %7 = icmp eq i32 %6, 0 br i1 %7, label LBL_5, label LBL_4 LBL_4: %8 = ptrtoint i8** %sv_0 to i64 %9 = load i8*, i8** %sv_0, align 8 %10 = call i32 @strlen(i8* %9) %11 = sext i32 %10 to i64 %12 = add nsw i64 %11, 24 %13 = udiv i64 %12, 16 %14 = mul i64 %13, 16 %15 = and i64 %14, -4096 %16 = and i64 %14, 4080 %17 = add i64 %8, 15 %18 = sub i64 %17, %16 %19 = sub i64 %18, %15 %20 = and i64 %19, -16 %21 = load i8*, i8** %sv_0, align 8 %22 = inttoptr i64 %20 to i8* %23 = call i8* @strcpy(i8* %22, i8* %21) %24 = call i64 @FUNC(i64 %20) br label LBL_5 LBL_5: %25 = call i64 @FUNC(i64 40) %26 = icmp eq i64 %0, %25 store i64 0, i64* %rax.0.reg2mem br i1 %26, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %20, { 1, 0 } uselistorder i64 %14, { 1, 0 } uselistorder i8** %sv_0, { 4, 3, 0, 2, 1 } uselistorder i64 ()* @staticReturnsFalse, { 1, 0 } }
0
juliet-test-suite-c
CWE398_Poor_Code_Quality__empty_for_12-bad
CWE398_Poor_Code_Quality__empty_for_12_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %storemerge1.reg2mem = alloca i64 %storemerge23.reg2mem = alloca i32 %0 = call i64 @FUNC() %1 = trunc i64 %0 to i32 %2 = icmp eq i32 %1, 0 store i32 0, i32* %storemerge23.reg2mem br i1 %2, label LBL_2, label LBL_1 LBL_1: %3 = call i64 @FUNC(i64 ptrtoint ([17 x i8]* @gv_0 to i64)) store i64 %3, i64* %storemerge1.reg2mem br label LBL_4 LBL_2: %storemerge23.reload = load i32, i32* %storemerge23.reg2mem %4 = call i64 @FUNC(i64 ptrtoint ([25 x i8]* @gv_1 to i64)) %5 = add nuw nsw i32 %storemerge23.reload, 1 %exitcond = icmp eq i32 %5, 10 store i32 %5, i32* %storemerge23.reg2mem br i1 %exitcond, label LBL_3, label LBL_2 LBL_3: %6 = call i64 @FUNC(i64 ptrtoint ([18 x i8]* @gv_2 to i64)) store i64 %6, i64* %storemerge1.reg2mem br label LBL_4 LBL_4: %storemerge1.reload = load i64, i64* %storemerge1.reg2mem ret i64 %storemerge1.reload uselistorder i32* %storemerge23.reg2mem, { 2, 0, 1 } uselistorder i64* %storemerge1.reg2mem, { 0, 2, 1 } uselistorder label LBL_2, { 1, 0 } }
1
juliet-test-suite-c
CWE563_Unused_Variable__unused_value_int64_t_05-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = load i32, i32* @gv_0, align 4 %1 = icmp eq i32 %0, 0 store i64 0, i64* %rax.0.reg2mem br i1 %1, label LBL_2, label LBL_1 LBL_1: %2 = call i64 @FUNC(i64 5) store i64 %2, i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload }
0
juliet-test-suite-c
CWE124_Buffer_Underwrite__CWE839_fgets_08-bad
CWE124_Buffer_Underwrite__CWE839_fgets_08_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %indvars.iv.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i32 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 store i32 -1, i32* %sv_0.0.reg2mem br i1 %3, label LBL_4, label LBL_1 LBL_1: store i64 0, i64* %sv_1, align 8 %4 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %5 = bitcast i64* %sv_1 to i8* %6 = call i8* @fgets(i8* nonnull %5, i32 14, %_IO_FILE* %4) %7 = icmp eq i8* %6, null br i1 %7, label LBL_3, label LBL_2 LBL_2: %8 = call i32 @atoi(i8* nonnull %5) store i32 %8, i32* %sv_0.0.reg2mem br label LBL_4 LBL_3: %9 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64)) store i32 -1, i32* %sv_0.0.reg2mem br label LBL_4 LBL_4: %10 = call i64 @FUNC() %11 = trunc i64 %10 to i32 %12 = icmp eq i32 %11, 0 br i1 %12, label LBL_9, label LBL_5 LBL_5: %sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem %13 = icmp sgt i32 %sv_0.0.reload, 9 br i1 %13, label LBL_8, label LBL_6 LBL_6: %14 = ptrtoint i64* %sv_2 to i64 %15 = sext i32 %sv_0.0.reload to i64 %16 = mul i64 %15, 4 %17 = add i64 %14, -64 %18 = add i64 %16, %17 %19 = inttoptr i64 %18 to i32* store i32 1, i32* %19, align 4 store i64 0, i64* %indvars.iv.reg2mem br label LBL_7 LBL_7: %indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem %20 = mul i64 %indvars.iv.reload, 4 %21 = add i64 %20, %17 %22 = inttoptr i64 %21 to i32* %23 = load i32, i32* %22, align 4 %24 = zext i32 %23 to i64 %25 = call i64 @FUNC(i64 %24) %indvars.iv.next = add nuw nsw i64 %indvars.iv.reload, 1 %exitcond = icmp eq i64 %indvars.iv.next, 10 store i64 %indvars.iv.next, i64* %indvars.iv.reg2mem br i1 %exitcond, label LBL_9, label LBL_7 LBL_8: %26 = call i64 @FUNC(i64 ptrtoint ([32 x i8]* @gv_2 to i64)) br label LBL_9 LBL_9: %27 = call i64 @FUNC(i64 40) %28 = icmp eq i64 %0, %27 store i64 0, i64* %rax.0.reg2mem br i1 %28, label LBL_11, label LBL_10 LBL_10: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_11 LBL_11: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32* %sv_0.0.reg2mem, { 0, 2, 1, 3 } uselistorder i64* %indvars.iv.reg2mem, { 1, 0, 2 } uselistorder i64 ()* @staticReturnsTrue, { 1, 0 } uselistorder label LBL_9, { 1, 0, 2 } }
1
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE806_char_snprintf_02-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64* @malloc(i32 100) %2 = icmp eq i64* %1, null %3 = icmp eq i1 %2, false br i1 %3, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 -1) unreachable LBL_2: %4 = bitcast i64* %1 to i8* %5 = call i64* @memset(i64* %1, i32 65, i32 49) %6 = ptrtoint i64* %1 to i64 %7 = add i64 %6, 49 %8 = inttoptr i64 %7 to i8* store i8 0, i8* %8, align 1 store i64 0, i64* %sv_0, align 8 %9 = call i32 @strlen(i8* %4) %10 = bitcast i64* %sv_0 to i8* %11 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* nonnull %10, i32 %9, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_0, i64 0, i64 0), i64* %1) %12 = call i64 @FUNC(i64 %6) call void @free(i64* %1) %13 = call i64 @FUNC(i64 40) %14 = icmp eq i64 %0, %13 store i64 0, i64* %rax.0.reg2mem br i1 %14, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %1, { 0, 1, 2, 3, 5, 4 } uselistorder void (i64*)* @free, { 1, 0, 2 } uselistorder i32 (i8*, i32, i8*, ...)* @snprintf, { 1, 0, 2 } uselistorder i32 (i8*)* @strlen, { 1, 0, 2 } uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 } uselistorder void (i32)* @exit, { 1, 0, 2 } uselistorder i64* (i32)* @malloc, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE134_Uncontrolled_Format_String__char_file_fprintf_17-bad
CWE134_Uncontrolled_Format_String__char_file_fprintf_17_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 0, i64* %sv_0, align 8 %1 = bitcast i64* %sv_0 to i8* %2 = call i32 @strlen(i8* nonnull %1) %3 = sext i32 %2 to i64 %4 = sub nsw i64 100, %3 %5 = icmp ult i64 %4, 2 br i1 %5, label LBL_5, label LBL_1 LBL_1: %6 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @gv_1, i64 0, i64 0)) %7 = icmp eq %_IO_FILE* %6, null br i1 %7, label LBL_5, label LBL_2 LBL_2: %8 = ptrtoint i64* %sv_0 to i64 %9 = sub i32 100, %2 %10 = add i64 %3, %8 %11 = inttoptr i64 %10 to i8* %12 = call i8* @fgets(i8* %11, i32 %9, %_IO_FILE* nonnull %6) %13 = icmp eq i8* %12, null %14 = icmp eq i1 %13, false br i1 %14, label LBL_4, label LBL_3 LBL_3: %15 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_2 to i64)) store i8 0, i8* %11, align 1 br label LBL_4 LBL_4: %16 = call i32 @fclose(%_IO_FILE* nonnull %6) br label LBL_5 LBL_5: %17 = load %_IO_FILE*, %_IO_FILE** @gv_3, align 8 %18 = call i32 (%_IO_FILE*, i8*, ...) @fprintf(%_IO_FILE* %17, i8* nonnull %1) %19 = call i64 @FUNC(i64 40) %20 = icmp eq i64 %0, %19 store i64 0, i64* %rax.0.reg2mem br i1 %20, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder %_IO_FILE** @gv_3, { 1, 0 } uselistorder i8 0, { 1, 2, 0 } }
1
juliet-test-suite-c
CWE457_Use_of_Uninitialized_Variable__struct_array_malloc_no_init_07-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.2.reg2mem = alloca i64 %indvars.iv.reg2mem = alloca i64 %indvars.iv5.reg2mem = alloca i64 %0 = call i64* @malloc(i32 80) %1 = icmp eq i64* %0, null %2 = icmp eq i1 %1, false br i1 %2, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 -1) unreachable LBL_2: %3 = ptrtoint i64* %0 to i64 %4 = load i32, i32* @gv_0, align 4 %5 = zext i32 %4 to i64 %6 = icmp eq i32 %4, 5 %7 = icmp eq i1 %6, false store i64 0, i64* %indvars.iv5.reg2mem store i64 %5, i64* %rax.2.reg2mem br i1 %7, label LBL_5, label LBL_3 LBL_3: %indvars.iv5.reload = load i64, i64* %indvars.iv5.reg2mem %8 = mul i64 %indvars.iv5.reload, 8 %9 = add i64 %8, %3 %10 = inttoptr i64 %9 to i32* %11 = trunc i64 %indvars.iv5.reload to i32 store i32 %11, i32* %10, align 4 %12 = add i64 %9, 4 %13 = inttoptr i64 %12 to i32* store i32 %11, i32* %13, align 4 %indvars.iv.next6 = add nuw nsw i64 %indvars.iv5.reload, 1 %exitcond7 = icmp eq i64 %indvars.iv.next6, 10 store i64 %indvars.iv.next6, i64* %indvars.iv5.reg2mem store i64 0, i64* %indvars.iv.reg2mem br i1 %exitcond7, label LBL_4, label LBL_3 LBL_4: %indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem %14 = mul i64 %indvars.iv.reload, 8 %15 = add i64 %14, %3 %16 = inttoptr i64 %15 to i32* %17 = load i32, i32* %16, align 4 %18 = zext i32 %17 to i64 %19 = call i64 @FUNC(i64 %18) %20 = add i64 %15, 4 %21 = inttoptr i64 %20 to i32* %22 = load i32, i32* %21, align 4 %23 = zext i32 %22 to i64 %24 = call i64 @FUNC(i64 %23) %indvars.iv.next = add nuw nsw i64 %indvars.iv.reload, 1 %exitcond = icmp eq i64 %indvars.iv.next, 10 store i64 %indvars.iv.next, i64* %indvars.iv.reg2mem store i64 %24, i64* %rax.2.reg2mem br i1 %exitcond, label LBL_5, label LBL_4 LBL_5: %rax.2.reload = load i64, i64* %rax.2.reg2mem ret i64 %rax.2.reload uselistorder i64* %0, { 1, 0 } uselistorder i64* %indvars.iv5.reg2mem, { 2, 0, 1 } uselistorder i64* %indvars.iv.reg2mem, { 2, 0, 1 } uselistorder label LBL_4, { 1, 0 } uselistorder label LBL_3, { 1, 0 } }
0
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_dest_char_cpy_07-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i8* %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false store i8* null, i8** %sv_0.0.reg2mem br i1 %3, label LBL_4, label LBL_1 LBL_1: %4 = call i64* @malloc(i32 100) %5 = icmp eq i64* %4, null %6 = icmp eq i1 %5, false br i1 %6, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %7 = bitcast i64* %4 to i8* store i8 0, i8* %7, align 1 store i8* %7, i8** %sv_0.0.reg2mem br label LBL_4 LBL_4: %sv_0.0.reload = load i8*, i8** %sv_0.0.reg2mem %8 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99) %9 = bitcast i64* %sv_1 to i8* %10 = call i8* @strcpy(i8* %sv_0.0.reload, i8* nonnull %9) %11 = ptrtoint i8* %sv_0.0.reload to i64 %12 = call i64 @FUNC(i64 %11) %13 = bitcast i8* %sv_0.0.reload to i64* call void @free(i64* %13) %14 = call i64 @FUNC(i64 40) %15 = icmp eq i64 %0, %14 store i64 0, i64* %rax.0.reg2mem br i1 %15, label LBL_6, label LBL_5 LBL_5: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_6 LBL_6: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %4, { 1, 0 } uselistorder void (i64*)* @free, { 1, 0, 2 } uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 } uselistorder i32* @gv_0, { 1, 0 } }
0
juliet-test-suite-c
CWE369_Divide_by_Zero__int_fscanf_divide_03-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i32, align 4 %0 = call i64 @FUNC(i64 40) store i32 -1, i32* %sv_0, align 4 %1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i32* nonnull %sv_0) %3 = load i32, i32* %sv_0, align 4 %4 = icmp eq i32 %3, 0 br i1 %4, label LBL_2, label LBL_1 LBL_1: %5 = udiv i32 100, %3 %6 = zext i32 %5 to i64 %7 = call i64 @FUNC(i64 %6) br label LBL_3 LBL_2: %8 = call i64 @FUNC(i64 ptrtoint ([38 x i8]* @gv_2 to i64)) br label LBL_3 LBL_3: %9 = call i64 @FUNC(i64 40) %10 = icmp eq i64 %0, %9 store i64 0, i64* %rax.0.reg2mem br i1 %10, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32* %sv_0, { 1, 0, 2 } uselistorder %_IO_FILE** @gv_0, { 1, 0 } }
0
juliet-test-suite-c
CWE667_Improper_Locking__basic_12-bad
CWE667_Improper_Locking__basic_12_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %storemerge.reg2mem = alloca i64 %0 = call i64 @FUNC() %1 = trunc i64 %0 to i32 %2 = icmp eq i32 %1, 0 %3 = call i64 @FUNC(i64 ptrtoint ([17 x i8]* @gv_0 to i64)) br i1 %2, label LBL_4, label LBL_1 LBL_1: %4 = call i64 @FUNC(i64 ptrtoint (i32* @gv_1 to i64)) %5 = trunc i64 %4 to i32 %6 = icmp eq i32 %5, 0 %7 = icmp eq i1 %6, false br i1 %7, label LBL_3, label LBL_2 LBL_2: %8 = call i64 @FUNC(i64 ptrtoint ([22 x i8]* @gv_2 to i64)) call void @exit(i32 1) unreachable LBL_3: %9 = call i64 @FUNC(i64 ptrtoint ([18 x i8]* @gv_3 to i64)) %10 = load i32, i32* @gv_1, align 4 %11 = sext i32 %10 to i64 %12 = call i64 @FUNC(i64 %11) store i64 %12, i64* %storemerge.reg2mem br label LBL_7 LBL_4: %13 = call i64 @FUNC(i64 ptrtoint (i32* @gv_4 to i64)) %14 = trunc i64 %13 to i32 %15 = icmp eq i32 %14, 0 %16 = icmp eq i1 %15, false br i1 %16, label LBL_6, label LBL_5 LBL_5: %17 = call i64 @FUNC(i64 ptrtoint ([22 x i8]* @gv_2 to i64)) call void @exit(i32 1) unreachable LBL_6: %18 = call i64 @FUNC(i64 ptrtoint ([18 x i8]* @gv_3 to i64)) %19 = load i32, i32* @gv_4, align 4 %20 = sext i32 %19 to i64 %21 = call i64 @FUNC(i64 %20) %22 = call i64 @FUNC(i64 ptrtoint ([18 x i8]* @gv_5 to i64)) %23 = load i32, i32* @gv_4, align 4 %24 = sext i32 %23 to i64 %25 = call i64 @FUNC(i64 %24) %26 = call i64 @FUNC(i64 ptrtoint ([19 x i8]* @gv_6 to i64)) %27 = load i32, i32* @gv_4, align 4 %28 = sext i32 %27 to i64 %29 = call i64 @FUNC(i64 %28) store i64 %29, i64* %storemerge.reg2mem br label LBL_7 LBL_7: %storemerge.reload = load i64, i64* %storemerge.reg2mem ret i64 %storemerge.reload uselistorder i64* %storemerge.reg2mem, { 0, 2, 1 } uselistorder i32* @gv_4, { 3, 2, 1, 0 } uselistorder i64 (i64)* @stdThreadLockAcquire, { 1, 0 } uselistorder void (i32)* @exit, { 1, 0, 2 } uselistorder i64 (i64)* @stdThreadLockCreate, { 1, 0 } uselistorder i32* @gv_1, { 1, 0 } }
1
juliet-test-suite-c
CWE191_Integer_Underflow__int_listen_socket_postdec_16-good
goodB2G
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0368.reg2mem = alloca i32 %sv_0.0.ph.reg2mem = alloca i32 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %sv_3 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i32 @socket(i32 2, i32 1, i32 6) %2 = icmp eq i32 %1, -1 store i32 0, i32* %sv_0.0368.reg2mem br i1 %2, label LBL_8, label LBL_1 LBL_1: %3 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16) store i64 2, i64* %sv_2, align 8 %4 = call i16 @htons(i16 27015) %5 = bitcast i64* %sv_2 to %sockaddr* %6 = call i32 @bind(i32 %1, %sockaddr* nonnull %5, i32 16) %7 = icmp eq i32 %6, -1 br i1 %7, label LBL_6, label LBL_2 LBL_2: %8 = call i32 @listen(i32 %1, i32 5) %9 = icmp eq i32 %8, -1 br i1 %9, label LBL_6, label LBL_3 LBL_3: %10 = call i32 @accept(i32 %1, %sockaddr* null, i32* null) %11 = icmp eq i32 %10, -1 br i1 %11, label LBL_6, label LBL_4 LBL_4: %12 = call i32 @recv(i32 %10, i64* nonnull %sv_1, i32 13, i32 0) %13 = add i32 %12, 1 %14 = icmp ult i32 %13, 2 store i32 0, i32* %sv_0.0.ph.reg2mem br i1 %14, label LBL_7, label LBL_5 LBL_5: %15 = ptrtoint i64* %sv_3 to i64 %16 = sext i32 %12 to i64 %17 = add i64 %15, -22 %18 = add i64 %17, %16 %19 = inttoptr i64 %18 to i8* store i8 0, i8* %19, align 1 %20 = bitcast i64* %sv_1 to i8* %21 = call i32 @atoi(i8* nonnull %20) store i32 %21, i32* %sv_0.0.ph.reg2mem br label LBL_7 LBL_6: %22 = call i32 @close(i32 %1) store i32 0, i32* %sv_0.0368.reg2mem br label LBL_8 LBL_7: %sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem %23 = call i32 @close(i32 %1) %24 = call i32 @close(i32 %10) %25 = icmp eq i32 %sv_0.0.ph.reload, -2147483648 store i32 %sv_0.0.ph.reload, i32* %sv_0.0368.reg2mem br i1 %25, label LBL_9, label LBL_8 LBL_8: %sv_0.0368.reload = load i32, i32* %sv_0.0368.reg2mem %26 = add i32 %sv_0.0368.reload, -1 %27 = zext i32 %26 to i64 %28 = call i64 @FUNC(i64 %27) br label LBL_10 LBL_9: %29 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_0 to i64)) br label LBL_10 LBL_10: %30 = call i64 @FUNC(i64 40) %31 = icmp eq i64 %0, %30 store i64 0, i64* %rax.0.reg2mem br i1 %31, label LBL_12, label LBL_11 LBL_11: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_12 LBL_12: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %12, { 1, 0 } uselistorder i32 %1, { 4, 0, 1, 2, 3, 5 } uselistorder i64* %sv_2, { 0, 2, 1 } uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 2, 1 } uselistorder i32* %sv_0.0368.reg2mem, { 0, 3, 2, 1 } uselistorder i32 (i32)* @close, { 2, 1, 0, 3 } uselistorder label LBL_8, { 2, 1, 0 } uselistorder label LBL_7, { 1, 0 } }
0
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE806_char_memmove_03-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64* @malloc(i32 100) %2 = icmp eq i64* %1, null %3 = icmp eq i1 %2, false br i1 %3, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 -1) unreachable LBL_2: %4 = bitcast i64* %1 to i8* %5 = call i64* @memset(i64* %1, i32 65, i32 49) %6 = ptrtoint i64* %1 to i64 %7 = add i64 %6, 49 %8 = inttoptr i64 %7 to i8* store i8 0, i8* %8, align 1 store i64 0, i64* %sv_0, align 8 %9 = call i32 @strlen(i8* %4) %10 = call i64* @memmove(i64* nonnull %sv_0, i64* %1, i32 %9) %11 = call i64 @FUNC(i64 %6) call void @free(i64* %1) %12 = call i64 @FUNC(i64 40) %13 = icmp eq i64 %0, %12 store i64 0, i64* %rax.0.reg2mem br i1 %13, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %1, { 0, 1, 2, 3, 5, 4 } uselistorder void (i64*)* @free, { 1, 0, 2 } uselistorder i64* (i64*, i64*, i32)* @memmove, { 1, 0, 2 } uselistorder i32 (i8*)* @strlen, { 1, 0, 2 } uselistorder i64* (i32)* @malloc, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE457_Use_of_Uninitialized_Variable__int_array_alloca_no_init_08-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %indvars.iv.reg2mem = alloca i64 %indvars.iv4.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = ptrtoint i64* %sv_0 to i64 %1 = call i64 @FUNC(i64 40) %2 = add i64 %0, -33 %3 = and i64 %2, -16 %4 = call i64 @FUNC() %5 = trunc i64 %4 to i32 %6 = icmp eq i32 %5, 0 store i64 0, i64* %indvars.iv4.reg2mem br i1 %6, label LBL_2, label LBL_1 LBL_1: %7 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64)) br label LBL_3 LBL_2: %indvars.iv4.reload = load i64, i64* %indvars.iv4.reg2mem %8 = mul i64 %indvars.iv4.reload, 4 %9 = add i64 %8, %3 %10 = inttoptr i64 %9 to i32* %11 = trunc i64 %indvars.iv4.reload to i32 store i32 %11, i32* %10, align 4 %indvars.iv.next5 = add nuw nsw i64 %indvars.iv4.reload, 1 %exitcond6 = icmp eq i64 %indvars.iv.next5, 10 store i64 %indvars.iv.next5, i64* %indvars.iv4.reg2mem br i1 %exitcond6, label LBL_3, label LBL_2 LBL_3: %12 = call i64 @FUNC() %13 = trunc i64 %12 to i32 %14 = icmp eq i32 %13, 0 store i64 0, i64* %indvars.iv.reg2mem br i1 %14, label LBL_5, label LBL_4 LBL_4: %indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem %15 = mul i64 %indvars.iv.reload, 4 %16 = add i64 %15, %3 %17 = inttoptr i64 %16 to i32* %18 = load i32, i32* %17, align 4 %19 = zext i32 %18 to i64 %20 = call i64 @FUNC(i64 %19) %indvars.iv.next = add nuw nsw i64 %indvars.iv.reload, 1 %exitcond = icmp eq i64 %indvars.iv.next, 10 store i64 %indvars.iv.next, i64* %indvars.iv.reg2mem br i1 %exitcond, label LBL_5, label LBL_4 LBL_5: %21 = call i64 @FUNC(i64 40) %22 = icmp eq i64 %1, %21 store i64 0, i64* %rax.0.reg2mem br i1 %22, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %indvars.iv4.reg2mem, { 2, 0, 1 } uselistorder i64* %indvars.iv.reg2mem, { 2, 0, 1 } uselistorder i64 ()* @staticReturnsFalse, { 1, 0 } uselistorder label LBL_4, { 1, 0 } uselistorder label LBL_2, { 1, 0 } }
0
juliet-test-suite-c
CWE190_Integer_Overflow__int_fgets_preinc_12-good
goodB2G
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i32 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 store i64 0, i64* %sv_1, align 8 %4 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %5 = bitcast i64* %sv_1 to i8* %6 = call i8* @fgets(i8* nonnull %5, i32 14, %_IO_FILE* %4) %7 = icmp eq i8* %6, null br i1 %3, label LBL_4, label LBL_1 LBL_1: br i1 %7, label LBL_3, label LBL_2 LBL_2: %8 = call i32 @atoi(i8* nonnull %5) store i32 %8, i32* %sv_0.0.reg2mem br label LBL_7 LBL_3: %9 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64)) store i32 0, i32* %sv_0.0.reg2mem br label LBL_7 LBL_4: br i1 %7, label LBL_6, label LBL_5 LBL_5: %10 = call i32 @atoi(i8* nonnull %5) store i32 %10, i32* %sv_0.0.reg2mem br label LBL_7 LBL_6: %11 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64)) store i32 0, i32* %sv_0.0.reg2mem br label LBL_7 LBL_7: %sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem %12 = call i64 @FUNC() %13 = trunc i64 %12 to i32 %14 = icmp eq i32 %13, 0 %15 = icmp eq i32 %sv_0.0.reload, 2147483647 br i1 %14, label LBL_11, label LBL_8 LBL_8: br i1 %15, label LBL_10, label LBL_9 LBL_9: %16 = add i32 %sv_0.0.reload, 1 %17 = zext i32 %16 to i64 %18 = call i64 @FUNC(i64 %17) br label LBL_14 LBL_10: %19 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_2 to i64)) br label LBL_14 LBL_11: br i1 %15, label LBL_13, label LBL_12 LBL_12: %20 = add i32 %sv_0.0.reload, 1 %21 = zext i32 %20 to i64 %22 = call i64 @FUNC(i64 %21) br label LBL_14 LBL_13: %23 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_2 to i64)) br label LBL_14 LBL_14: %24 = call i64 @FUNC(i64 40) %25 = icmp eq i64 %0, %24 store i64 0, i64* %rax.0.reg2mem br i1 %25, label LBL_16, label LBL_15 LBL_15: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_16 LBL_16: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i1 %15, { 1, 0 } uselistorder i32 %sv_0.0.reload, { 1, 0, 2 } uselistorder i1 %7, { 1, 0 } uselistorder i8* %5, { 1, 0, 2 } uselistorder i32* %sv_0.0.reg2mem, { 0, 4, 3, 2, 1 } }
0
juliet-test-suite-c
CWE758_Undefined_Behavior__char_alloca_use_05-bad
CWE758_Undefined_Behavior__char_alloca_use_05_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 0 br i1 %2, label LBL_2, label LBL_1 LBL_1: %3 = ptrtoint i64* %sv_0 to i64 %4 = add i64 %3, -1 %5 = and i64 %4, -16 %6 = inttoptr i64 %5 to i8* %7 = load i8, i8* %6, align 16 %8 = sext i8 %7 to i64 %9 = and i64 %8, 4294967295 %10 = call i64 @FUNC(i64 %9) br label LBL_2 LBL_2: %11 = call i64 @FUNC(i64 40) %12 = icmp eq i64 %0, %11 store i64 0, i64* %rax.0.reg2mem br i1 %12, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload }
1
juliet-test-suite-c
CWE401_Memory_Leak__int64_t_realloc_32-bad
CWE401_Memory_Leak__int64_t_realloc_32_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = call i64 @FUNC(i64 40) %1 = call i64* @realloc(i64* null, i32 ptrtoint (i32* @gv_0 to i32)) %2 = icmp eq i64* %1, null %3 = icmp eq i1 %2, false br i1 %3, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 -1) unreachable LBL_2: store i64 5, i64* %1, align 8 %4 = call i64 @FUNC(i64 5) %5 = call i64 @FUNC(i64 40) %6 = icmp eq i64 %0, %5 store i64 0, i64* %rax.0.reg2mem br i1 %6, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload }
1
juliet-test-suite-c
CWE190_Integer_Overflow__unsigned_int_fscanf_multiply_05-bad
CWE190_Integer_Overflow__unsigned_int_fscanf_multiply_05_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i32, align 4 %0 = call i64 @FUNC(i64 40) store i32 0, i32* %sv_0, align 4 %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 0 br i1 %2, label LBL_3, label LBL_1 LBL_1: %3 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8 %4 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %3, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_2, i64 0, i64 0), i32* nonnull %sv_0) %.pre = load i32, i32* @gv_0, align 4 %.pre3 = load i32, i32* %sv_0, align 4 %phitmp = icmp eq i32 %.pre, 0 %5 = icmp eq i32 %.pre3, 0 %or.cond = or i1 %phitmp, %5 br i1 %or.cond, label LBL_3, label LBL_2 LBL_2: %6 = mul i32 %.pre3, 2 %7 = zext i32 %6 to i64 %8 = call i64 @FUNC(i64 %7) br label LBL_3 LBL_3: %9 = call i64 @FUNC(i64 40) %10 = icmp eq i64 %0, %9 store i64 0, i64* %rax.0.reg2mem br i1 %10, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32* %sv_0, { 0, 2, 1 } uselistorder %_IO_FILE** @gv_1, { 1, 0 } uselistorder label LBL_3, { 1, 2, 0 } }
1
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE805_char_alloca_snprintf_15-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %0 = ptrtoint i64* %sv_1 to i64 %1 = call i64 @FUNC(i64 40) %2 = add i64 %0, -161 %3 = and i64 %2, -16 %4 = inttoptr i64 %3 to i8* store i8 0, i8* %4, align 16 %5 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99) %6 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* %4, i32 100, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_0, i64 0, i64 0), i64* nonnull %sv_0) %7 = call i64 @FUNC(i64 %3) %8 = call i64 @FUNC(i64 40) %9 = icmp eq i64 %1, %8 store i64 0, i64* %rax.0.reg2mem br i1 %9, label LBL_2, label LBL_1 LBL_1: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %3, { 1, 0 } }
0
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE805_int_alloca_memmove_17-good
goodG2B
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge.reg2mem = alloca i32 %sv_0.0.reg2mem = alloca i64 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %0 = ptrtoint i64* %sv_2 to i64 %1 = call i64 @FUNC(i64 40) %2 = add i64 %0, -609 %3 = and i64 %2, -16 store i32 0, i32* %storemerge.reg2mem br label LBL_1 LBL_1: %storemerge.reload = load i32, i32* %storemerge.reg2mem %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %4 = add nuw nsw i32 %storemerge.reload, 1 %exitcond = icmp eq i32 %4, 2 store i64 %3, i64* %sv_0.0.reg2mem store i32 %4, i32* %storemerge.reg2mem br i1 %exitcond, label LBL_2, label LBL_1 LBL_2: %5 = bitcast i64* %sv_1 to i8* call void @FUNC(i8* nonnull %5, i64 0, i64 50) %6 = inttoptr i64 %sv_0.0.reload to i64* %7 = call i64* @memmove(i64* %6, i64* nonnull %sv_1, i32 400) %8 = inttoptr i64 %sv_0.0.reload to i32* %9 = load i32, i32* %8, align 4 %10 = zext i32 %9 to i64 %11 = call i64 @FUNC(i64 %10) %12 = call i64 @FUNC(i64 40) %13 = icmp eq i64 %1, %12 store i64 0, i64* %rax.0.reg2mem br i1 %13, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %sv_0.0.reg2mem, { 1, 0 } uselistorder i32* %storemerge.reg2mem, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE483_Incorrect_Block_Delimitation__semicolon_12-bad
CWE483_Incorrect_Block_Delimitation__semicolon_12_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.1.reg2mem = alloca i64 %0 = call i64 @FUNC() %1 = trunc i64 %0 to i32 %2 = icmp eq i32 %1, 0 %3 = call i32 @rand() br i1 %2, label LBL_2, label LBL_1 LBL_1: %4 = call i64 @FUNC(i64 ptrtoint ([7 x i8]* @gv_0 to i64)) %5 = call i64 @FUNC(i64 ptrtoint ([9 x i8]* @gv_1 to i64)) store i64 %5, i64* %rax.1.reg2mem br label LBL_4 LBL_2: %6 = srem i32 %3, 3 %7 = zext i32 %6 to i64 %8 = icmp eq i32 %6, 0 %9 = icmp eq i1 %8, false store i64 %7, i64* %rax.1.reg2mem br i1 %9, label LBL_4, label LBL_3 LBL_3: %10 = call i64 @FUNC(i64 ptrtoint ([7 x i8]* @gv_0 to i64)) %11 = call i64 @FUNC(i64 ptrtoint ([9 x i8]* @gv_1 to i64)) store i64 %11, i64* %rax.1.reg2mem br label LBL_4 LBL_4: %rax.1.reload = load i64, i64* %rax.1.reg2mem ret i64 %rax.1.reload uselistorder i32 %6, { 1, 0 } uselistorder i64* %rax.1.reg2mem, { 0, 3, 1, 2 } uselistorder label LBL_4, { 1, 0, 2 } }
1
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE129_connect_socket_07-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %indvars.iv.reg2mem = alloca i64 %indvars.iv5.reg2mem = alloca i64 %sv_0.08.reg2mem = alloca i32 %0 = load i32, i32* @gv_0, align 4 %1 = icmp eq i32 %0, 5 store i32 7, i32* %sv_0.08.reg2mem br i1 %1, label LBL_2, label LBL_1 LBL_1: %2 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64)) %.pre = load i32, i32* @gv_0, align 4 %3 = zext i32 %.pre to i64 %4 = icmp eq i32 %.pre, 5 %5 = icmp eq i1 %4, false store i32 -1, i32* %sv_0.08.reg2mem store i64 %3, i64* %rax.0.reg2mem br i1 %5, label LBL_10, label LBL_2 LBL_2: %sv_0.08.reload = load i32, i32* %sv_0.08.reg2mem %6 = call i64* @malloc(i32 40) %7 = ptrtoint i64* %6 to i64 %8 = icmp eq i64* %6, null %9 = icmp eq i1 %8, false store i64 0, i64* %indvars.iv5.reg2mem br i1 %9, label LBL_4, label LBL_3 LBL_3: call void @exit(i32 -1) unreachable LBL_4: %indvars.iv5.reload = load i64, i64* %indvars.iv5.reg2mem %10 = mul i64 %indvars.iv5.reload, 4 %11 = add i64 %10, %7 %12 = inttoptr i64 %11 to i32* store i32 0, i32* %12, align 4 %indvars.iv.next6 = add nuw nsw i64 %indvars.iv5.reload, 1 %exitcond7 = icmp eq i64 %indvars.iv.next6, 10 store i64 %indvars.iv.next6, i64* %indvars.iv5.reg2mem br i1 %exitcond7, label LBL_5, label LBL_4 LBL_5: %13 = icmp slt i32 %sv_0.08.reload, 0 br i1 %13, label LBL_8, label LBL_6 LBL_6: %14 = sext i32 %sv_0.08.reload to i64 %15 = mul i64 %14, 4 %16 = add i64 %15, %7 %17 = inttoptr i64 %16 to i32* store i32 1, i32* %17, align 4 store i64 0, i64* %indvars.iv.reg2mem br label LBL_7 LBL_7: %indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem %18 = mul i64 %indvars.iv.reload, 4 %19 = add i64 %18, %7 %20 = inttoptr i64 %19 to i32* %21 = load i32, i32* %20, align 4 %22 = zext i32 %21 to i64 %23 = call i64 @FUNC(i64 %22) %indvars.iv.next = add nuw nsw i64 %indvars.iv.reload, 1 %exitcond = icmp eq i64 %indvars.iv.next, 10 store i64 %indvars.iv.next, i64* %indvars.iv.reg2mem br i1 %exitcond, label LBL_9, label LBL_7 LBL_8: %24 = call i64 @FUNC(i64 ptrtoint ([32 x i8]* @gv_2 to i64)) br label LBL_9 LBL_9: call void @free(i64* %6) store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_10 LBL_10: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %7, { 0, 2, 1 } uselistorder i32* %sv_0.08.reg2mem, { 0, 2, 1 } uselistorder i64* %indvars.iv5.reg2mem, { 2, 0, 1 } uselistorder i64* %indvars.iv.reg2mem, { 1, 0, 2 } uselistorder label LBL_9, { 1, 0 } uselistorder label LBL_4, { 1, 0 } uselistorder label LBL_2, { 1, 0 } }
0
juliet-test-suite-c
CWE675_Duplicate_Operations_on_Resource__open_05-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = load i32, i32* @gv_0, align 4 %1 = icmp eq i32 %0, 0 store i64 0, i64* %rax.0.reg2mem br i1 %1, label LBL_2, label LBL_1 LBL_1: %2 = call i32 (i8*, i32, ...) @open(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @gv_1, i64 0, i64 0), i32 66) %3 = call i32 @close(i32 %2) %4 = sext i32 %3 to i64 store i64 %4, i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload }
0
juliet-test-suite-c
CWE127_Buffer_Underread__char_declare_memmove_14-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64* @memset(i64* nonnull %sv_2, i32 65, i32 99) %2 = load i32, i32* inttoptr (i64 16404 to i32*), align 4 %3 = icmp eq i32 %2, 5 br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64)) br label LBL_3 LBL_2: %5 = ptrtoint i64* %sv_2 to i64 store i64 %5, i64* %sv_0.0.reg2mem br label LBL_3 LBL_3: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %6 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99) %7 = inttoptr i64 %sv_0.0.reload to i64* %8 = call i64* @memmove(i64* nonnull %sv_1, i64* %7, i32 100) %9 = ptrtoint i64* %sv_1 to i64 %10 = call i64 @FUNC(i64 %9) %11 = call i64 @FUNC(i64 40) %12 = icmp eq i64 %0, %11 store i64 0, i64* %rax.0.reg2mem br i1 %12, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %sv_2, { 1, 0 } uselistorder i64* %sv_1, { 2, 0, 1 } }
0
juliet-test-suite-c
CWE457_Use_of_Uninitialized_Variable__struct_array_malloc_no_init_07-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.1.reg2mem = alloca i64 %indvars.iv.reg2mem = alloca i64 %indvars.iv5.reg2mem = alloca i64 %0 = call i64* @malloc(i32 80) %1 = icmp eq i64* %0, null %2 = icmp eq i1 %1, false br i1 %2, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 -1) unreachable LBL_2: %3 = ptrtoint i64* %0 to i64 %4 = load i32, i32* @gv_0, align 4 %5 = icmp eq i32 %4, 5 store i64 0, i64* %indvars.iv5.reg2mem br i1 %5, label LBL_4, label LBL_3 LBL_3: %6 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64)) br label LBL_5 LBL_4: %indvars.iv5.reload = load i64, i64* %indvars.iv5.reg2mem %7 = mul i64 %indvars.iv5.reload, 8 %8 = add i64 %7, %3 %9 = inttoptr i64 %8 to i32* %10 = trunc i64 %indvars.iv5.reload to i32 store i32 %10, i32* %9, align 4 %11 = add i64 %8, 4 %12 = inttoptr i64 %11 to i32* store i32 %10, i32* %12, align 4 %indvars.iv.next6 = add nuw nsw i64 %indvars.iv5.reload, 1 %exitcond7 = icmp eq i64 %indvars.iv.next6, 10 store i64 %indvars.iv.next6, i64* %indvars.iv5.reg2mem br i1 %exitcond7, label LBL_5, label LBL_4 LBL_5: %13 = load i32, i32* @gv_0, align 4 %14 = zext i32 %13 to i64 %15 = icmp eq i32 %13, 5 %16 = icmp eq i1 %15, false store i64 0, i64* %indvars.iv.reg2mem store i64 %14, i64* %rax.1.reg2mem br i1 %16, label LBL_7, label LBL_6 LBL_6: %indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem %17 = mul i64 %indvars.iv.reload, 8 %18 = add i64 %17, %3 %19 = inttoptr i64 %18 to i32* %20 = load i32, i32* %19, align 4 %21 = zext i32 %20 to i64 %22 = call i64 @FUNC(i64 %21) %23 = add i64 %18, 4 %24 = inttoptr i64 %23 to i32* %25 = load i32, i32* %24, align 4 %26 = zext i32 %25 to i64 %27 = call i64 @FUNC(i64 %26) %indvars.iv.next = add nuw nsw i64 %indvars.iv.reload, 1 %exitcond = icmp eq i64 %indvars.iv.next, 10 store i64 %indvars.iv.next, i64* %indvars.iv.reg2mem store i64 %27, i64* %rax.1.reg2mem br i1 %exitcond, label LBL_7, label LBL_6 LBL_7: %rax.1.reload = load i64, i64* %rax.1.reg2mem ret i64 %rax.1.reload uselistorder i64* %0, { 1, 0 } uselistorder i64* %indvars.iv5.reg2mem, { 2, 0, 1 } uselistorder i64* %indvars.iv.reg2mem, { 2, 0, 1 } uselistorder label LBL_6, { 1, 0 } uselistorder label LBL_4, { 1, 0 } }
0
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__CWE131_memcpy_07-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false store i64 0, i64* %sv_0.0.reg2mem br i1 %3, label LBL_3, label LBL_1 LBL_1: %4 = call i64* @malloc(i32 40) %5 = ptrtoint i64* %4 to i64 %6 = icmp eq i64* %4, null %7 = icmp eq i1 %6, false store i64 %5, i64* %sv_0.0.reg2mem br i1 %7, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem store i64 0, i64* %sv_1, align 8 %8 = inttoptr i64 %sv_0.0.reload to i64* %9 = call i64* @memcpy(i64* %8, i64* nonnull %sv_1, i32 40) %10 = inttoptr i64 %sv_0.0.reload to i32* %11 = load i32, i32* %10, align 4 %12 = zext i32 %11 to i64 %13 = call i64 @FUNC(i64 %12) call void @free(i64* %8) %14 = call i64 @FUNC(i64 40) %15 = icmp eq i64 %0, %14 store i64 0, i64* %rax.0.reg2mem br i1 %15, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder void (i64*)* @free, { 1, 0, 2 } uselistorder i64 (i64)* @printIntLine, { 1, 0 } uselistorder i64* (i32)* @malloc, { 1, 0, 2 } uselistorder i32 40, { 0, 1, 3, 2 } uselistorder i32* @gv_0, { 1, 0 } }
0
juliet-test-suite-c
CWE123_Write_What_Where_Condition__connect_socket_08-bad
CWE123_Write_What_Where_Condition__connect_socket_08_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = ptrtoint i64* %sv_2 to i64 store i64 %1, i64* %sv_1, align 8 %2 = ptrtoint i64* %sv_1 to i64 store i64 %2, i64* %sv_2, align 8 %3 = call i64 @FUNC() %4 = trunc i64 %3 to i32 %5 = icmp eq i32 %4, 0 br i1 %5, label LBL_5, label LBL_1 LBL_1: %6 = call i32 @socket(i32 2, i32 1, i32 6) %cond = icmp eq i32 %6, -1 br i1 %cond, label LBL_5, label LBL_2 LBL_2: %7 = call i64* @memset(i64* nonnull %sv_0, i32 0, i32 16) store i64 2, i64* %sv_0, align 8 %8 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0)) %9 = call i16 @htons(i16 27015) %10 = bitcast i64* %sv_0 to %sockaddr* %11 = call i32 @connect(i32 %6, %sockaddr* nonnull %10, i32 16) %12 = icmp eq i32 %11, -1 br i1 %12, label LBL_4, label LBL_3 LBL_3: %13 = call i32 @recv(i32 %6, i64* nonnull %sv_1, i32 16, i32 0) br label LBL_4 LBL_4: %14 = call i32 @close(i32 %6) br label LBL_5 LBL_5: store i64 %1, i64* @gv_1, align 8 %15 = load i64, i64* %sv_1, align 8 store i64 %15, i64* @gv_2, align 8 store i64 %15, i64* %sv_2, align 8 %16 = add i64 %15, 8 %17 = inttoptr i64 %16 to i64* store i64 %1, i64* %17, align 8 %18 = call i64 @FUNC(i64 40) %19 = icmp eq i64 %0, %18 store i64 0, i64* %rax.0.reg2mem br i1 %19, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %6, { 3, 1, 2, 0 } uselistorder i64* %sv_1, { 1, 0, 2, 3 } uselistorder i64* %sv_0, { 0, 2, 1 } uselistorder i32 -1, { 1, 0 } uselistorder label LBL_5, { 1, 0, 2 } }
1
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE805_int_declare_memcpy_09-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = bitcast i64* %sv_0 to i8* call void @FUNC(i8* nonnull %1, i64 0, i64 50) %2 = call i64* @memcpy(i64* nonnull %sv_1, i64* nonnull %sv_0, i32 400) %3 = bitcast i64* %sv_1 to i32* %4 = load i32, i32* %3, align 8 %5 = zext i32 %4 to i64 %6 = call i64 @FUNC(i64 %5) %7 = call i64 @FUNC(i64 40) %8 = icmp eq i64 %0, %7 store i64 0, i64* %rax.0.reg2mem br i1 %8, label LBL_2, label LBL_1 LBL_1: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 (i64)* @printIntLine, { 1, 0 } }
0
juliet-test-suite-c
CWE126_Buffer_Overread__CWE129_large_13-bad
CWE126_Buffer_Overread__CWE129_large_13_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* inttoptr (i64 8372 to i32*), align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = ptrtoint i64* %sv_0 to i64 %5 = add i64 %4, -8 %6 = inttoptr i64 %5 to i32* %7 = load i32, i32* %6, align 8 %8 = zext i32 %7 to i64 %9 = call i64 @FUNC(i64 %8) br label LBL_3 LBL_2: %10 = call i64 @FUNC(i64 ptrtoint ([31 x i8]* @gv_0 to i64)) br label LBL_3 LBL_3: %11 = call i64 @FUNC(i64 40) %12 = icmp eq i64 %0, %11 store i64 0, i64* %rax.0.reg2mem br i1 %12, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload }
1
juliet-test-suite-c
CWE191_Integer_Underflow__int64_t_min_sub_11-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %0 = call i64 @FUNC() %1 = trunc i64 %0 to i32 %2 = icmp eq i32 %1, 0 store i64 -3, i64* %sv_0.0.reg2mem br i1 %2, label LBL_2, label LBL_1 LBL_1: %3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64)) store i64 -1, i64* %sv_0.0.reg2mem br label LBL_2 LBL_2: %4 = call i64 @FUNC() %5 = trunc i64 %4 to i32 %6 = icmp eq i32 %5, 0 store i64 %4, i64* %rax.0.reg2mem br i1 %6, label LBL_4, label LBL_3 LBL_3: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %7 = call i64 @FUNC(i64 %sv_0.0.reload) store i64 %7, i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %sv_0.0.reg2mem, { 0, 2, 1 } uselistorder i64 ()* @globalReturnsFalse, { 1, 0 } uselistorder label LBL_2, { 1, 0 } }
0
juliet-test-suite-c
CWE690_NULL_Deref_From_Return__char_realloc_12-good
goodB2G
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = call i64* @realloc(i64* null, i32 20) %1 = ptrtoint i64* %0 to i64 %2 = call i64 @FUNC() %3 = trunc i64 %2 to i32 %4 = icmp eq i32 %3, 0 %5 = icmp eq i64* %0, null br i1 %4, label LBL_3, label LBL_1 LBL_1: store i64 %2, i64* %rax.0.reg2mem br i1 %5, label LBL_5, label LBL_2 LBL_2: store i64 7596553777019711049, i64* %0, align 8 %6 = add i64 %1, 8 %7 = inttoptr i64 %6 to i16* store i16 25978, i16* %7, align 2 %8 = add i64 %1, 10 %9 = inttoptr i64 %8 to i8* store i8 0, i8* %9, align 1 %10 = call i64 @FUNC(i64 %1) call void @free(i64* nonnull %0) store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_3: store i64 %2, i64* %rax.0.reg2mem br i1 %5, label LBL_5, label LBL_4 LBL_4: store i64 7596553777019711049, i64* %0, align 8 %11 = add i64 %1, 8 %12 = inttoptr i64 %11 to i16* store i16 25978, i16* %12, align 2 %13 = add i64 %1, 10 %14 = inttoptr i64 %13 to i8* store i8 0, i8* %14, align 1 %15 = call i64 @FUNC(i64 %1) call void @free(i64* nonnull %0) store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %2, { 1, 0, 2 } uselistorder i64 %1, { 1, 3, 2, 0, 5, 4 } uselistorder i64* %rax.0.reg2mem, { 0, 3, 4, 1, 2 } uselistorder void (i64*)* @free, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE124_Buffer_Underwrite__malloc_char_cpy_17-good
goodG2B
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i8*, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64* @malloc(i32 100) %2 = bitcast i64* %1 to i8* store i8* %2, i8** %sv_1, align 8 %3 = icmp eq i64* %1, null %4 = icmp eq i1 %3, false br i1 %4, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 -1) unreachable LBL_2: %5 = call i64* @memset(i64* %1, i32 65, i32 99) %6 = ptrtoint i64* %1 to i64 %7 = add i64 %6, 99 %8 = inttoptr i64 %7 to i8* store i8 0, i8* %8, align 1 %9 = load i8*, i8** %sv_1, align 8 %10 = ptrtoint i8* %9 to i64 %11 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99) %12 = bitcast i64* %sv_0 to i8* %13 = call i8* @strcpy(i8* %9, i8* nonnull %12) %14 = call i64 @FUNC(i64 %10) %15 = call i64 @FUNC(i64 40) %16 = icmp eq i64 %0, %15 store i64 0, i64* %rax.0.reg2mem br i1 %16, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 99, { 1, 0 } }
0
juliet-test-suite-c
CWE190_Integer_Overflow__char_max_postinc_14-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = load i32, i32* @gv_0, align 4 %1 = zext i32 %0 to i64 %2 = icmp eq i32 %0, 5 %3 = icmp eq i1 %2, false store i64 %1, i64* %rax.0.reg2mem br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = call i64 @FUNC(i64 3) store i64 %4, i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 (i64)* @printHexCharLine, { 2, 1, 0 } uselistorder i64 3, { 1, 0 } uselistorder i32 5, { 0, 1, 2, 3, 5, 4, 6 } uselistorder i32* @gv_0, { 4, 0, 3, 2, 1 } }
0
juliet-test-suite-c
CWE197_Numeric_Truncation_Error__short_fscanf_08-bad
CWE197_Numeric_Truncation_Error__short_fscanf_08_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %.reg2mem = alloca i64 %sv_0 = alloca i16, align 2 %0 = call i64 @FUNC(i64 40) store i16 -1, i16* %sv_0, align 2 %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 store i64 4294967295, i64* %.reg2mem br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %5 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %4, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_1, i64 0, i64 0), i16* nonnull %sv_0) %.pre = load i16, i16* %sv_0, align 2 %phitmp = zext i16 %.pre to i32 %phitmp1 = mul i32 %phitmp, 16777216 %phitmp2 = ashr exact i32 %phitmp1, 24 %phitmp3 = zext i32 %phitmp2 to i64 store i64 %phitmp3, i64* %.reg2mem br label LBL_2 LBL_2: %.reload = load i64, i64* %.reg2mem %6 = call i64 @FUNC(i64 %.reload) %7 = call i64 @FUNC(i64 40) %8 = icmp eq i64 %0, %7 store i64 0, i64* %rax.0.reg2mem br i1 %8, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %.reg2mem, { 0, 2, 1 } }
1
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE806_char_declare_ncat_06-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = bitcast i64* %sv_1 to i8* %2 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 49) %3 = ptrtoint i64* %sv_1 to i64 %4 = add i64 %3, 49 %5 = inttoptr i64 %4 to i8* store i8 0, i8* %5, align 1 store i64 0, i64* %sv_0, align 8 %6 = call i32 @strlen(i8* nonnull %1) %7 = bitcast i64* %sv_0 to i8* %8 = call i8* @strncat(i8* nonnull %7, i8* nonnull %1, i32 %6) %9 = call i64 @FUNC(i64 %3) %10 = call i64 @FUNC(i64 40) %11 = icmp eq i64 %0, %10 store i64 0, i64* %rax.0.reg2mem br i1 %11, label LBL_2, label LBL_1 LBL_1: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i8* %1, { 1, 0 } uselistorder i8* (i8*, i8*, i32)* @strncat, { 1, 0, 2 } uselistorder i32 (i8*)* @strlen, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE191_Integer_Underflow__char_rand_postdec_14-bad
CWE191_Integer_Underflow__char_rand_postdec_14_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %0 = load i32, i32* inttoptr (i64 16404 to i32*), align 4 %1 = icmp eq i32 %0, 5 %2 = icmp eq i1 %1, false store i64 31, i64* %sv_0.0.reg2mem br i1 %2, label LBL_2, label LBL_1 LBL_1: %3 = call i32 @rand() %4 = urem i32 %3, 2 %5 = icmp eq i32 %4, 0 %6 = call i32 @rand() %7 = call i32 @rand() %8 = call i32 @rand() %9 = sext i1 %5 to i32 %storemerge = xor i32 %8, %9 %sext = mul i32 %storemerge, 16777216 %phitmp = add i32 %sext, -16777216 %phitmp3 = ashr exact i32 %phitmp, 24 %phitmp4 = zext i32 %phitmp3 to i64 store i64 %phitmp4, i64* %sv_0.0.reg2mem br label LBL_2 LBL_2: %10 = load i32, i32* @gv_0, align 4 %11 = zext i32 %10 to i64 %12 = icmp eq i32 %10, 5 %13 = icmp eq i1 %12, false store i64 %11, i64* %rax.0.reg2mem br i1 %13, label LBL_4, label LBL_3 LBL_3: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %14 = call i64 @FUNC(i64 %sv_0.0.reload) store i64 %14, i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload }
1
juliet-test-suite-c
CWE194_Unexpected_Sign_Extension__connect_socket_strncpy_08-bad
CWE194_Unexpected_Sign_Extension__connect_socket_strncpy_08_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.1.reg2mem = alloca i32 %sv_0.0.ph.reg2mem = alloca i32 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %sv_3 = alloca i64, align 8 %sv_4 = alloca i64, align 8 %0 = ptrtoint i64* %sv_4 to i64 %1 = call i64 @FUNC(i64 40) %2 = call i64 @FUNC() %3 = trunc i64 %2 to i32 %4 = icmp eq i32 %3, 0 store i32 0, i32* %sv_0.1.reg2mem br i1 %4, label LBL_7, label LBL_1 LBL_1: %5 = call i32 @socket(i32 2, i32 1, i32 6) %6 = icmp eq i32 %5, -1 store i32 0, i32* %sv_0.1.reg2mem br i1 %6, label LBL_7, label LBL_2 LBL_2: %7 = call i64* @memset(i64* nonnull %sv_3, i32 0, i32 16) store i64 2, i64* %sv_3, align 8 %8 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0)) %9 = call i16 @htons(i16 27015) %10 = bitcast i64* %sv_3 to %sockaddr* %11 = call i32 @connect(i32 %5, %sockaddr* nonnull %10, i32 16) %12 = icmp eq i32 %11, -1 store i32 0, i32* %sv_0.0.ph.reg2mem br i1 %12, label LBL_6, label LBL_3 LBL_3: %13 = call i32 @recv(i32 %5, i64* nonnull %sv_2, i32 7, i32 0) %14 = add i32 %13, 1 %15 = icmp ult i32 %14, 2 store i32 0, i32* %sv_0.0.ph.reg2mem br i1 %15, label LBL_6, label LBL_4 LBL_4: %16 = sext i32 %13 to i64 %17 = add i64 %0, -112 %18 = add i64 %17, %16 %19 = inttoptr i64 %18 to i8* store i8 0, i8* %19, align 1 %20 = bitcast i64* %sv_2 to i8* %21 = call i32 @atoi(i8* nonnull %20) %.off = add i32 %21, 32768 %22 = icmp ult i32 %.off, 65536 store i32 -1, i32* %sv_0.0.ph.reg2mem br i1 %22, label LBL_5, label LBL_6 LBL_5: %sext3 = mul i32 %21, 65536 %23 = ashr exact i32 %sext3, 16 store i32 %23, i32* %sv_0.0.ph.reg2mem br label LBL_6 LBL_6: %sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem %24 = call i32 @close(i32 %5) store i32 %sv_0.0.ph.reload, i32* %sv_0.1.reg2mem br label LBL_7 LBL_7: %sv_0.1.reload = load i32, i32* %sv_0.1.reg2mem store i64 0, i64* %sv_2, align 8 %25 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99) %26 = trunc i32 %sv_0.1.reload to i16 %27 = icmp sgt i16 %26, 99 br i1 %27, label LBL_9, label LBL_8 LBL_8: %28 = bitcast i64* %sv_2 to i8* %29 = bitcast i64* %sv_1 to i8* %30 = call i8* @strncpy(i8* nonnull %28, i8* nonnull %29, i32 %sv_0.1.reload) %31 = sext i32 %sv_0.1.reload to i64 %32 = add i64 %0, -112 %33 = add i64 %32, %31 %34 = inttoptr i64 %33 to i8* store i8 0, i8* %34, align 1 br label LBL_9 LBL_9: %35 = call i64 @FUNC(i64* nonnull %sv_2) %36 = call i64 @FUNC(i64 40) %37 = icmp eq i64 %1, %36 store i64 0, i64* %rax.0.reg2mem br i1 %37, label LBL_11, label LBL_10 LBL_10: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_11 LBL_11: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %sv_0.1.reload, { 1, 2, 0 } uselistorder i32 %13, { 1, 0 } uselistorder i32 %5, { 2, 0, 1, 3 } uselistorder i64 %0, { 1, 0 } uselistorder i64* %sv_3, { 0, 2, 1 } uselistorder i64* %sv_2, { 0, 1, 4, 2, 3 } uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 3, 4, 2, 1 } uselistorder i32* %sv_0.1.reg2mem, { 0, 2, 1, 3 } uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 } uselistorder label LBL_7, { 1, 0, 2 } uselistorder label LBL_6, { 2, 0, 3, 1 } }
1
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE805_char_declare_snprintf_04-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = bitcast i64* %sv_1 to i8* store i8 0, i8* %1, align 8 %2 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99) %3 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* nonnull %1, i32 100, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_0, i64 0, i64 0), i64* nonnull %sv_0) %4 = ptrtoint i64* %sv_1 to i64 %5 = call i64 @FUNC(i64 %4) %6 = call i64 @FUNC(i64 40) %7 = icmp eq i64 %0, %6 store i64 0, i64* %rax.0.reg2mem br i1 %7, label LBL_2, label LBL_1 LBL_1: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 (i8*, i32, i8*, ...)* @snprintf, { 1, 0, 2 } uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE191_Integer_Underflow__short_fscanf_multiply_11-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i16, align 2 %0 = call i64 @FUNC(i64 40) store i16 0, i16* %sv_0, align 2 %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %5 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %4, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_1, i64 0, i64 0), i16* nonnull %sv_0) br label LBL_2 LBL_2: %6 = call i64 @FUNC() %7 = trunc i64 %6 to i32 %8 = icmp eq i32 %7, 0 br i1 %8, label LBL_7, label LBL_3 LBL_3: %9 = load i16, i16* %sv_0, align 2 %10 = icmp slt i16 %9, 0 %11 = icmp eq i1 %10, false br i1 %11, label LBL_7, label LBL_4 LBL_4: %12 = icmp slt i16 %9, -16383 br i1 %12, label LBL_6, label LBL_5 LBL_5: %13 = mul i16 %9, 2 %14 = sext i16 %13 to i64 %15 = and i64 %14, 4294967294 %16 = call i64 @FUNC(i64 %15) br label LBL_7 LBL_6: %17 = call i64 @FUNC(i64 ptrtoint ([51 x i8]* @gv_2 to i64)) br label LBL_7 LBL_7: %18 = call i64 @FUNC(i64 40) %19 = icmp eq i64 %0, %18 store i64 0, i64* %rax.0.reg2mem br i1 %19, label LBL_9, label LBL_8 LBL_8: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_9 LBL_9: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i16* %sv_0, { 1, 0, 2 } uselistorder %_IO_FILE** @gv_0, { 1, 0 } }
0
juliet-test-suite-c
CWE400_Resource_Exhaustion__connect_socket_sleep_11-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i32 %0 = call i64 @FUNC() %1 = trunc i64 %0 to i32 %2 = icmp eq i32 %1, 0 store i32 20, i32* %sv_0.0.reg2mem br i1 %2, label LBL_2, label LBL_1 LBL_1: %3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64)) store i32 -1, i32* %sv_0.0.reg2mem br label LBL_2 LBL_2: %4 = call i64 @FUNC() %5 = trunc i64 %4 to i32 %6 = icmp eq i32 %5, 0 store i64 %4, i64* %rax.0.reg2mem br i1 %6, label LBL_4, label LBL_3 LBL_3: %sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem %7 = call i32 @usleep(i32 %sv_0.0.reload) %8 = call i64 @FUNC(i64 ptrtoint ([29 x i8]* @gv_1 to i64)) store i64 %8, i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32* %sv_0.0.reg2mem, { 0, 2, 1 } uselistorder i64 ()* @globalReturnsFalse, { 1, 0 } uselistorder label LBL_2, { 1, 0 } }
0
juliet-test-suite-c
CWE400_Resource_Exhaustion__fscanf_for_loop_02-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge2.reg2mem = alloca i64 %sv_0 = alloca i32, align 4 %0 = call i64 @FUNC(i64 40) store i32 -1, i32* %sv_0, align 4 %1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i32* nonnull %sv_0) %3 = load i32, i32* %sv_0, align 4 %.off = add i32 %3, -1 %4 = icmp ugt i32 %.off, 19 store i64 0, i64* %storemerge2.reg2mem br i1 %4, label LBL_2, label LBL_1 LBL_1: %storemerge2.reload = load i64, i64* %storemerge2.reg2mem %5 = call i64 @FUNC(i64 ptrtoint ([6 x i8]* @gv_2 to i64)) %6 = add nuw i64 %storemerge2.reload, 1 %7 = load i32, i32* %sv_0, align 4 %8 = sext i32 %7 to i64 %9 = icmp ult i64 %6, %8 store i64 %6, i64* %storemerge2.reg2mem br i1 %9, label LBL_1, label LBL_2 LBL_2: %10 = call i64 @FUNC(i64 40) %11 = icmp eq i64 %0, %10 store i64 0, i64* %rax.0.reg2mem br i1 %11, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32* %sv_0, { 1, 2, 0, 3 } uselistorder i64* %storemerge2.reg2mem, { 2, 0, 1 } uselistorder %_IO_FILE** @gv_0, { 1, 0 } uselistorder i32 -1, { 0, 2, 1, 3 } uselistorder label LBL_1, { 1, 0 } }
0
juliet-test-suite-c
CWE416_Use_After_Free__malloc_free_char_05-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %0 = load i32, i32* @gv_0, align 4 %1 = icmp eq i32 %0, 0 br i1 %1, label LBL_2, label LBL_1 LBL_1: %2 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64)) store i64 0, i64* %sv_0.0.reg2mem br label LBL_5 LBL_2: %3 = call i64* @malloc(i32 100) %4 = icmp eq i64* %3, null %5 = icmp eq i1 %4, false br i1 %5, label LBL_4, label LBL_3 LBL_3: call void @exit(i32 -1) unreachable LBL_4: %6 = ptrtoint i64* %3 to i64 %7 = call i64* @memset(i64* %3, i32 65, i32 99) %8 = add i64 %6, 99 %9 = inttoptr i64 %8 to i8* store i8 0, i8* %9, align 1 store i64 %6, i64* %sv_0.0.reg2mem br label LBL_5 LBL_5: %10 = load i32, i32* @gv_2, align 4 %11 = icmp eq i32 %10, 0 store i64 0, i64* %rax.0.reg2mem br i1 %11, label LBL_7, label LBL_6 LBL_6: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %12 = call i64 @FUNC(i64 %sv_0.0.reload) store i64 %12, i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %3, { 0, 2, 1 } uselistorder i64* %sv_0.0.reg2mem, { 0, 2, 1 } uselistorder i32* @gv_0, { 1, 0 } }
0
juliet-test-suite-c
CWE401_Memory_Leak__malloc_realloc_struct_twoIntsStruct_14-bad
CWE401_Memory_Leak__malloc_realloc_struct_twoIntsStruct_14_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = load i32, i32* inttoptr (i64 16404 to i32*), align 4 %1 = zext i32 %0 to i64 %2 = icmp eq i32 %0, 5 %3 = icmp eq i1 %2, false store i64 %1, i64* %rax.0.reg2mem br i1 %3, label LBL_5, label LBL_1 LBL_1: %4 = call i64* @malloc(i32 ptrtoint (i32* @gv_0 to i32)) %5 = icmp eq i64* %4, null %6 = icmp eq i1 %5, false br i1 %6, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %7 = ptrtoint i64* %4 to i64 %8 = bitcast i64* %4 to i32* store i32 0, i32* %8, align 4 %9 = add i64 %7, 4 %10 = inttoptr i64 %9 to i32* store i32 0, i32* %10, align 4 %11 = call i64 @FUNC(i64 %7) %12 = call i64* @realloc(i64* %4, i32 1040000) %13 = ptrtoint i64* %12 to i64 %14 = icmp eq i64* %12, null store i64 %13, i64* %rax.0.reg2mem br i1 %14, label LBL_5, label LBL_4 LBL_4: %15 = bitcast i64* %12 to i32* store i32 1, i32* %15, align 4 %16 = add i64 %13, 4 %17 = inttoptr i64 %16 to i32* store i32 1, i32* %17, align 4 %18 = call i64 @FUNC(i64 %13) call void @free(i64* nonnull %12) store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %13, { 1, 2, 0 } uselistorder i64* %4, { 0, 1, 3, 2 } uselistorder i64 (i64)* @printStructLine, { 1, 0 } }
1
juliet-test-suite-c
CWE123_Write_What_Where_Condition__listen_socket_08-bad
CWE123_Write_What_Where_Condition__listen_socket_08_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = ptrtoint i64* %sv_2 to i64 store i64 %1, i64* %sv_1, align 8 %2 = ptrtoint i64* %sv_1 to i64 store i64 %2, i64* %sv_2, align 8 %3 = call i64 @FUNC() %4 = trunc i64 %3 to i32 %5 = icmp eq i32 %4, 0 br i1 %5, label LBL_7, label LBL_1 LBL_1: %6 = call i32 @socket(i32 2, i32 1, i32 6) %7 = icmp eq i32 %6, -1 br i1 %7, label LBL_7, label LBL_2 LBL_2: %8 = call i64* @memset(i64* nonnull %sv_0, i32 0, i32 16) store i64 2, i64* %sv_0, align 8 %9 = call i16 @htons(i16 27015) %10 = bitcast i64* %sv_0 to %sockaddr* %11 = call i32 @bind(i32 %6, %sockaddr* nonnull %10, i32 16) %12 = icmp eq i32 %11, -1 br i1 %12, label LBL_5, label LBL_3 LBL_3: %13 = call i32 @listen(i32 %6, i32 5) %14 = icmp eq i32 %13, -1 br i1 %14, label LBL_5, label LBL_4 LBL_4: %15 = call i32 @accept(i32 %6, %sockaddr* null, i32* null) %16 = icmp eq i32 %15, -1 br i1 %16, label LBL_5, label LBL_6 LBL_5: %17 = call i32 @close(i32 %6) br label LBL_7 LBL_6: %18 = call i32 @recv(i32 %15, i64* nonnull %sv_1, i32 16, i32 0) %19 = call i32 @close(i32 %6) %20 = call i32 @close(i32 %15) br label LBL_7 LBL_7: store i64 %1, i64* @gv_0, align 8 %21 = load i64, i64* %sv_1, align 8 store i64 %21, i64* @gv_1, align 8 store i64 %21, i64* %sv_2, align 8 %22 = add i64 %21, 8 %23 = inttoptr i64 %22 to i64* store i64 %1, i64* %23, align 8 %24 = call i64 @FUNC(i64 40) %25 = icmp eq i64 %0, %24 store i64 0, i64* %rax.0.reg2mem br i1 %25, label LBL_9, label LBL_8 LBL_8: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_9 LBL_9: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %6, { 4, 0, 1, 2, 3, 5 } uselistorder i64* %sv_1, { 1, 0, 2, 3 } uselistorder i64* %sv_0, { 0, 2, 1 } uselistorder i32 (i32)* @close, { 2, 1, 0, 3 } uselistorder label LBL_7, { 2, 1, 0, 3 } }
1
juliet-test-suite-c
CWE563_Unused_Variable__unused_value_struct_01-good
goodB2G
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 0, i64* %sv_0, align 8 %1 = call i64 @FUNC(i64* nonnull %sv_0) %2 = call i64 @FUNC(i64 40) %3 = icmp eq i64 %0, %2 store i64 0, i64* %rax.0.reg2mem br i1 %3, label LBL_2, label LBL_1 LBL_1: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 (i64*)* @printStructLine, { 2, 1, 0 } }
0
juliet-test-suite-c
CWE191_Integer_Underflow__int64_t_fscanf_multiply_11-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = call i64 @FUNC() %1 = trunc i64 %0 to i32 %2 = icmp eq i32 %1, 0 %3 = call i64 @FUNC() %4 = trunc i64 %3 to i32 %5 = icmp eq i32 %4, 0 %or.cond = or i1 %2, %5 store i64 %3, i64* %rax.0.reg2mem br i1 %or.cond, label LBL_2, label LBL_1 LBL_1: %6 = call i64 @FUNC(i64 -4) store i64 %6, i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 (i64)* @printLongLongLine, { 3, 2, 1, 0 } uselistorder i64 ()* @globalReturnsTrue, { 5, 4, 3, 2, 1, 0 } }
0
juliet-test-suite-c
CWE191_Integer_Underflow__short_fscanf_postdec_09-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i16, align 2 %0 = call i64 @FUNC(i64 40) store i16 0, i16* %sv_0, align 2 %1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_1, i64 0, i64 0), i16* nonnull %sv_0) %3 = load i16, i16* %sv_0, align 2 %4 = icmp eq i16 %3, -32768 br i1 %4, label LBL_2, label LBL_1 LBL_1: %5 = add i16 %3, -1 store i16 %5, i16* %sv_0, align 2 %6 = sext i16 %5 to i64 %7 = and i64 %6, 4294967295 %8 = call i64 @FUNC(i64 %7) br label LBL_3 LBL_2: %9 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_2 to i64)) br label LBL_3 LBL_3: %10 = call i64 @FUNC(i64 40) %11 = icmp eq i64 %0, %10 store i64 0, i64* %rax.0.reg2mem br i1 %11, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i16* %sv_0, { 1, 2, 0, 3 } uselistorder i32 (%_IO_FILE*, i8*, ...)* @fscanf, { 1, 0, 2 } uselistorder %_IO_FILE** @gv_0, { 1, 0 } }
0
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_src_char_cat_14-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %.pre-phi.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64* @malloc(i32 100) %2 = icmp eq i64* %1, null %3 = icmp eq i1 %2, false br i1 %3, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 -1) unreachable LBL_2: %4 = load i32, i32* inttoptr (i64 16404 to i32*), align 4 %5 = icmp eq i32 %4, 5 br i1 %5, label LBL_4, label LBL_3 LBL_3: %6 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64)) %.pre = ptrtoint i64* %1 to i64 store i64 %.pre, i64* %.pre-phi.reg2mem br label LBL_5 LBL_4: %7 = call i64* @memset(i64* %1, i32 65, i32 49) %8 = ptrtoint i64* %1 to i64 %9 = add i64 %8, 49 %10 = inttoptr i64 %9 to i8* store i8 0, i8* %10, align 1 store i64 %8, i64* %.pre-phi.reg2mem br label LBL_5 LBL_5: %11 = bitcast i64* %1 to i8* %.pre-phi.reload = load i64, i64* %.pre-phi.reg2mem store i64 0, i64* %sv_0, align 8 %12 = bitcast i64* %sv_0 to i8* %13 = call i8* @strcat(i8* nonnull %12, i8* %11) %14 = call i64 @FUNC(i64 %.pre-phi.reload) call void @free(i64* %1) %15 = call i64 @FUNC(i64 40) %16 = icmp eq i64 %0, %15 store i64 0, i64* %rax.0.reg2mem br i1 %16, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %1, { 2, 5, 1, 3, 0, 4 } uselistorder i64* %.pre-phi.reg2mem, { 0, 2, 1 } }
0
juliet-test-suite-c
CWE590_Free_Memory_Not_on_Heap__free_struct_alloca_07-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %sv_0.0.reg2mem = alloca i64 %storemerge1.reg2mem = alloca i64 %0 = load i32, i32* @gv_0, align 4 %1 = icmp eq i32 %0, 5 br i1 %1, label LBL_2, label LBL_1 LBL_1: %2 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64)) store i64 0, i64* %sv_0.0.reg2mem br label LBL_5 LBL_2: %3 = call i64* @malloc(i32 ptrtoint (i32* @gv_2 to i32)) %4 = ptrtoint i64* %3 to i64 %5 = icmp eq i64* %3, null %6 = icmp eq i1 %5, false store i64 0, i64* %storemerge1.reg2mem br i1 %6, label LBL_4, label LBL_3 LBL_3: %7 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_3 to i64)) call void @exit(i32 1) unreachable LBL_4: %storemerge1.reload = load i64, i64* %storemerge1.reg2mem %8 = mul i64 %storemerge1.reload, 8 %9 = add i64 %8, %4 %10 = inttoptr i64 %9 to i32* store i32 1, i32* %10, align 4 %11 = add i64 %9, 4 %12 = inttoptr i64 %11 to i32* store i32 1, i32* %12, align 4 %13 = add nuw nsw i64 %storemerge1.reload, 1 %exitcond = icmp eq i64 %13, 100 store i64 %13, i64* %storemerge1.reg2mem store i64 %4, i64* %sv_0.0.reg2mem br i1 %exitcond, label LBL_5, label LBL_4 LBL_5: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %14 = call i64 @FUNC(i64 %sv_0.0.reload) %15 = inttoptr i64 %sv_0.0.reload to i64* call void @free(i64* %15) ret i64 ptrtoint (i32* @1 to i64) uselistorder i64* %storemerge1.reg2mem, { 2, 0, 1 } uselistorder label LBL_4, { 1, 0 } }
0
juliet-test-suite-c
CWE195_Signed_to_Unsigned_Conversion_Error__connect_socket_memcpy_05-bad
CWE195_Signed_to_Unsigned_Conversion_Error__connect_socket_memcpy_05_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.13.reg2mem = alloca i32 %sv_0.0.ph.reg2mem = alloca i32 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %sv_3 = alloca i64, align 8 %sv_4 = alloca i64, align 8 %0 = ptrtoint i64* %sv_4 to i64 %1 = call i64 @FUNC(i64 40) %2 = load i32, i32* @gv_0, align 4 %3 = icmp eq i32 %2, 0 br i1 %3, label LBL_5, label LBL_1 LBL_1: %4 = call i32 @socket(i32 2, i32 1, i32 6) %5 = icmp eq i32 %4, -1 br i1 %5, label LBL_5, label LBL_2 LBL_2: %6 = call i64* @memset(i64* nonnull %sv_3, i32 0, i32 16) store i64 2, i64* %sv_3, align 8 %7 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_1, i64 0, i64 0)) %8 = call i16 @htons(i16 27015) %9 = bitcast i64* %sv_3 to %sockaddr* %10 = call i32 @connect(i32 %4, %sockaddr* nonnull %9, i32 16) %11 = icmp eq i32 %10, -1 store i32 -1, i32* %sv_0.0.ph.reg2mem br i1 %11, label LBL_6, label LBL_3 LBL_3: %12 = call i32 @recv(i32 %4, i64* nonnull %sv_2, i32 13, i32 0) %13 = add i32 %12, 1 %14 = icmp ult i32 %13, 2 store i32 -1, i32* %sv_0.0.ph.reg2mem br i1 %14, label LBL_6, label LBL_4 LBL_4: %15 = sext i32 %12 to i64 %16 = add i64 %0, -112 %17 = add i64 %16, %15 %18 = inttoptr i64 %17 to i8* store i8 0, i8* %18, align 1 %19 = bitcast i64* %sv_2 to i8* %20 = call i32 @atoi(i8* nonnull %19) store i32 %20, i32* %sv_0.0.ph.reg2mem br label LBL_6 LBL_5: store i64 0, i64* %sv_2, align 8 %21 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99) store i32 -1, i32* %sv_0.13.reg2mem br label LBL_7 LBL_6: %sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem %22 = call i32 @close(i32 %4) store i64 0, i64* %sv_2, align 8 %23 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99) %24 = icmp sgt i32 %sv_0.0.ph.reload, 99 store i32 %sv_0.0.ph.reload, i32* %sv_0.13.reg2mem br i1 %24, label LBL_8, label LBL_7 LBL_7: %sv_0.13.reload = load i32, i32* %sv_0.13.reg2mem %25 = call i64* @memcpy(i64* nonnull %sv_2, i64* nonnull %sv_1, i32 %sv_0.13.reload) %26 = sext i32 %sv_0.13.reload to i64 %27 = add i64 %0, -112 %28 = add i64 %27, %26 %29 = inttoptr i64 %28 to i8* store i8 0, i8* %29, align 1 br label LBL_8 LBL_8: %30 = call i64 @FUNC(i64* nonnull %sv_2) %31 = call i64 @FUNC(i64 40) %32 = icmp eq i64 %1, %31 store i64 0, i64* %rax.0.reg2mem br i1 %32, label LBL_10, label LBL_9 LBL_9: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_10 LBL_10: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %sv_0.13.reload, { 1, 0 } uselistorder i32 %12, { 1, 0 } uselistorder i32 %4, { 2, 0, 1, 3 } uselistorder i64 %0, { 1, 0 } uselistorder i64* %sv_3, { 0, 2, 1 } uselistorder i64* %sv_2, { 1, 2, 5, 0, 3, 4 } uselistorder i64* %sv_1, { 1, 2, 0 } uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 3, 2, 1 } uselistorder i32 99, { 2, 1, 0 } uselistorder i32 65, { 1, 0 } uselistorder i64* (i64*, i32, i32)* @memset, { 2, 0, 1, 3 } uselistorder i32 -1, { 0, 2, 1, 3, 4 } uselistorder label LBL_7, { 1, 0 } uselistorder label LBL_6, { 1, 0, 2 } uselistorder label LBL_5, { 1, 0 } }
1
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_int64_t_memmove_10-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 0 store i64 0, i64* %sv_0.0.reg2mem br i1 %2, label LBL_3, label LBL_1 LBL_1: %3 = call i64* @malloc(i32 ptrtoint (i32* @gv_1 to i32)) %4 = ptrtoint i64* %3 to i64 %5 = icmp eq i64* %3, null %6 = icmp eq i1 %5, false store i64 %4, i64* %sv_0.0.reg2mem br i1 %6, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %7 = bitcast i64* %sv_1 to i8* call void @FUNC(i8* nonnull %7, i64 0, i64 100) %8 = inttoptr i64 %sv_0.0.reload to i64* %9 = call i64* @memmove(i64* %8, i64* nonnull %sv_1, i32 ptrtoint (i32* @gv_1 to i32)) %10 = load i64, i64* %8, align 8 %11 = call i64 @FUNC(i64 %10) call void @free(i64* %8) %12 = call i64 @FUNC(i64 40) %13 = icmp eq i64 %0, %12 store i64 0, i64* %rax.0.reg2mem br i1 %13, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder void (i64*)* @free, { 1, 0, 2 } uselistorder i64 (i64)* @printLongLongLine, { 1, 0 } uselistorder i64* (i64*, i64*, i32)* @memmove, { 1, 0, 2 } uselistorder void (i32)* @exit, { 1, 0, 2 } uselistorder i64* (i32)* @malloc, { 1, 0, 2 } uselistorder i32 ptrtoint (i32* @gv_1 to i32), { 0, 1, 3, 2 } }
0
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_struct_loop_13-bad
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_struct_loop_13_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge2.reg2mem = alloca i64 %storemerge13.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* inttoptr (i64 8336 to i32*), align 16 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false store i64 0, i64* %sv_0.0.reg2mem br i1 %3, label LBL_3, label LBL_1 LBL_1: %4 = call i64* @malloc(i32 400) %5 = ptrtoint i64* %4 to i64 %6 = icmp eq i64* %4, null %7 = icmp eq i1 %6, false store i64 %5, i64* %sv_0.0.reg2mem br i1 %7, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %8 = ptrtoint i64* %sv_1 to i64 %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %9 = add i64 %8, -816 %10 = add i64 %8, -812 store i64 0, i64* %storemerge13.reg2mem br label LBL_4 LBL_4: %storemerge13.reload = load i64, i64* %storemerge13.reg2mem %11 = mul i64 %storemerge13.reload, 8 %12 = add i64 %11, %9 %13 = inttoptr i64 %12 to i32* store i32 0, i32* %13, align 8 %14 = add i64 %10, %11 %15 = inttoptr i64 %14 to i32* store i32 0, i32* %15, align 4 %16 = add nuw nsw i64 %storemerge13.reload, 1 %exitcond4 = icmp eq i64 %16, 100 store i64 %16, i64* %storemerge13.reg2mem store i64 0, i64* %storemerge2.reg2mem br i1 %exitcond4, label LBL_5, label LBL_4 LBL_5: %storemerge2.reload = load i64, i64* %storemerge2.reg2mem %17 = mul i64 %storemerge2.reload, 8 %18 = add i64 %17, %sv_0.0.reload %19 = add i64 %17, %9 %20 = inttoptr i64 %19 to i64* %21 = load i64, i64* %20, align 8 %22 = inttoptr i64 %18 to i64* store i64 %21, i64* %22, align 8 %23 = add nuw nsw i64 %storemerge2.reload, 1 %exitcond = icmp eq i64 %23, 100 store i64 %23, i64* %storemerge2.reg2mem br i1 %exitcond, label LBL_6, label LBL_5 LBL_6: %24 = call i64 @FUNC(i64 %sv_0.0.reload) %25 = inttoptr i64 %sv_0.0.reload to i64* call void @free(i64* %25) %26 = call i64 @FUNC(i64 40) %27 = icmp eq i64 %0, %26 store i64 0, i64* %rax.0.reg2mem br i1 %27, label LBL_8, label LBL_7 LBL_7: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_8 LBL_8: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %17, { 1, 0 } uselistorder i64 %11, { 1, 0 } uselistorder i64* %storemerge13.reg2mem, { 1, 0, 2 } uselistorder i64* %storemerge2.reg2mem, { 2, 0, 1 } uselistorder i64 100, { 1, 0 } uselistorder label LBL_5, { 1, 0 } }
1
juliet-test-suite-c
CWE191_Integer_Underflow__short_fscanf_multiply_03-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i16, align 2 %0 = call i64 @FUNC(i64 40) store i16 0, i16* %sv_0, align 2 %1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_1, i64 0, i64 0), i16* nonnull %sv_0) %3 = load i16, i16* %sv_0, align 2 %4 = icmp slt i16 %3, 0 %5 = icmp eq i1 %4, false br i1 %5, label LBL_4, label LBL_1 LBL_1: %6 = icmp slt i16 %3, -16383 br i1 %6, label LBL_3, label LBL_2 LBL_2: %7 = mul i16 %3, 2 %8 = sext i16 %7 to i64 %9 = and i64 %8, 4294967294 %10 = call i64 @FUNC(i64 %9) br label LBL_4 LBL_3: %11 = call i64 @FUNC(i64 ptrtoint ([51 x i8]* @gv_2 to i64)) br label LBL_4 LBL_4: %12 = call i64 @FUNC(i64 40) %13 = icmp eq i64 %0, %12 store i64 0, i64* %rax.0.reg2mem br i1 %13, label LBL_6, label LBL_5 LBL_5: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_6 LBL_6: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i16* %sv_0, { 1, 0, 2 } uselistorder i32 (%_IO_FILE*, i8*, ...)* @fscanf, { 1, 0, 2 } uselistorder %_IO_FILE** @gv_0, { 1, 0 } }
0
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE806_char_declare_ncat_06-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = bitcast i64* %sv_1 to i8* %2 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 49) %3 = ptrtoint i64* %sv_1 to i64 %4 = add i64 %3, 49 %5 = inttoptr i64 %4 to i8* store i8 0, i8* %5, align 1 store i64 0, i64* %sv_0, align 8 %6 = call i32 @strlen(i8* nonnull %1) %7 = bitcast i64* %sv_0 to i8* %8 = call i8* @strncat(i8* nonnull %7, i8* nonnull %1, i32 %6) %9 = call i64 @FUNC(i64 %3) %10 = call i64 @FUNC(i64 40) %11 = icmp eq i64 %0, %10 store i64 0, i64* %rax.0.reg2mem br i1 %11, label LBL_2, label LBL_1 LBL_1: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i8* %1, { 1, 0 } }
0
juliet-test-suite-c
CWE758_Undefined_Behavior__char_pointer_alloca_use_08-bad
CWE758_Undefined_Behavior__char_pointer_alloca_use_08_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = ptrtoint i64* %sv_0 to i64 %5 = add i64 %4, -1 %6 = and i64 %5, -16 %7 = inttoptr i64 %6 to i64* %8 = load i64, i64* %7, align 16 %9 = call i64 @FUNC(i64 %8) br label LBL_2 LBL_2: %10 = call i64 @FUNC(i64 40) %11 = icmp eq i64 %0, %10 store i64 0, i64* %rax.0.reg2mem br i1 %11, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload }
1
juliet-test-suite-c
CWE457_Use_of_Uninitialized_Variable__double_pointer_08-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = call i64 @FUNC() %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 store i64 %1, i64* %rax.0.reg2mem br i1 %3, label LBL_4, label LBL_1 LBL_1: %4 = call i64* @malloc(i32 8) %5 = icmp eq i64* %4, null %6 = icmp eq i1 %5, false br i1 %6, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %7 = call i128 @FUNC(i64 4617315517961601024) %8 = call i64 @__asm_movsd.1(i128 %7) store i64 %8, i64* %4, align 8 %9 = call i128 @FUNC(i64 %8) %10 = call i64 @FUNC() store i64 %10, i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload }
0
juliet-test-suite-c
CWE190_Integer_Overflow__short_fscanf_postinc_17-good
goodB2G
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i16, align 2 %0 = call i64 @FUNC(i64 40) store i16 0, i16* %sv_0, align 2 %1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_1, i64 0, i64 0), i16* nonnull %sv_0) %3 = load i16, i16* %sv_0, align 2 %4 = icmp eq i16 %3, 32767 br i1 %4, label LBL_2, label LBL_1 LBL_1: %5 = add i16 %3, 1 store i16 %5, i16* %sv_0, align 2 %6 = sext i16 %5 to i64 %7 = and i64 %6, 4294967295 %8 = call i64 @FUNC(i64 %7) br label LBL_3 LBL_2: %9 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_2 to i64)) br label LBL_3 LBL_3: %10 = call i64 @FUNC(i64 40) %11 = icmp eq i64 %0, %10 store i64 0, i64* %rax.0.reg2mem br i1 %11, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i16* %sv_0, { 1, 2, 0, 3 } uselistorder label LBL_3, { 1, 0 } }
0
juliet-test-suite-c
CWE126_Buffer_Overread__CWE170_char_memcpy_05-bad
CWE126_Buffer_Overread__CWE170_char_memcpy_05_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 0 br i1 %2, label LBL_2, label LBL_1 LBL_1: %3 = call i64* @memset(i64* nonnull %sv_0, i32 65, i32 149) %4 = call i64* @memcpy(i64* nonnull %sv_1, i64* nonnull %sv_0, i32 99) %5 = call i64 @FUNC(i64* nonnull %sv_1) br label LBL_2 LBL_2: %6 = call i64 @FUNC(i64 40) %7 = icmp eq i64 %0, %6 store i64 0, i64* %rax.0.reg2mem br i1 %7, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload }
1
juliet-test-suite-c
CWE369_Divide_by_Zero__float_fscanf_13-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = alloca i128 %rax.0.reg2mem = alloca i64 %.reg2mem = alloca i32 %1 = load i128, i128* %0 %sv_0 = alloca i32, align 4 %2 = call i64 @FUNC(i64 40) %3 = call i128 @FUNC(i128 %1, i128 %1) %4 = call i64 @FUNC(i128 %3) %5 = trunc i64 %4 to i32 store i32 %5, i32* %sv_0, align 4 %6 = load i32, i32* inttoptr (i64 8448 to i32*), align 256 %7 = icmp eq i32 %6, 5 %8 = icmp eq i1 %7, false store i32 %5, i32* %.reg2mem br i1 %8, label LBL_2, label LBL_1 LBL_1: %9 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %10 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %9, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i32* nonnull %sv_0) %.pre = load i32, i32* %sv_0, align 4 store i32 %.pre, i32* %.reg2mem br label LBL_2 LBL_2: %.reload = load i32, i32* %.reg2mem %11 = call i128 @__asm_movss.1(i32 %.reload) %12 = call i128 @__asm_movss.1(i32 2147483647) %13 = call i128 @FUNC(i128 %11, i128 %12) %14 = call i128 @FUNC(i128 %13) %15 = load i128, i128* @gv_2, align 8 call void @FUNC(i128 %14, i128 %15) %16 = call i64 @FUNC(i64 ptrtoint ([38 x i8]* @gv_3 to i64)) %17 = call i64 @FUNC(i64 40) %18 = icmp eq i64 %2, %17 store i64 0, i64* %rax.0.reg2mem br i1 %18, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32* %.reg2mem, { 0, 2, 1 } }
0
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE805_struct_declare_memcpy_13-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge1.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %sv_3 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* inttoptr (i64 8360 to i32*), align 8 %2 = icmp eq i32 %1, 5 br i1 %2, label LBL_2, label LBL_1 LBL_1: %3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64)) br label LBL_3 LBL_2: %4 = ptrtoint i64* %sv_2 to i64 store i64 %4, i64* %sv_0.0.reg2mem br label LBL_3 LBL_3: %5 = ptrtoint i64* %sv_3 to i64 %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem store i64 0, i64* %storemerge1.reg2mem br label LBL_4 LBL_4: %storemerge1.reload = load i64, i64* %storemerge1.reg2mem %6 = mul i64 %storemerge1.reload, 8 %7 = add i64 %6, %5 %8 = add i64 %7, -816 %9 = inttoptr i64 %8 to i32* store i32 0, i32* %9, align 8 %10 = add i64 %7, -812 %11 = inttoptr i64 %10 to i32* store i32 0, i32* %11, align 4 %12 = add nuw nsw i64 %storemerge1.reload, 1 %exitcond = icmp eq i64 %12, 100 store i64 %12, i64* %storemerge1.reg2mem br i1 %exitcond, label LBL_5, label LBL_4 LBL_5: %13 = inttoptr i64 %sv_0.0.reload to i64* %14 = call i64* @memcpy(i64* %13, i64* nonnull %sv_1, i32 ptrtoint (i32* @gv_1 to i32)) %15 = call i64 @FUNC(i64 %sv_0.0.reload) %16 = call i64 @FUNC(i64 40) %17 = icmp eq i64 %0, %16 store i64 0, i64* %rax.0.reg2mem br i1 %17, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE805_struct_declare_memmove_17-good
goodG2B
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge2.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = ptrtoint i64* %sv_2 to i64 store i64 0, i64* %storemerge2.reg2mem br label LBL_1 LBL_1: %storemerge2.reload = load i64, i64* %storemerge2.reg2mem %2 = mul i64 %storemerge2.reload, 8 %3 = add i64 %2, %1 %4 = add i64 %3, -816 %5 = inttoptr i64 %4 to i32* store i32 0, i32* %5, align 8 %6 = add i64 %3, -812 %7 = inttoptr i64 %6 to i32* store i32 0, i32* %7, align 4 %8 = add nuw nsw i64 %storemerge2.reload, 1 %exitcond = icmp eq i64 %8, 100 store i64 %8, i64* %storemerge2.reg2mem br i1 %exitcond, label LBL_2, label LBL_1 LBL_2: %9 = ptrtoint i64* %sv_1 to i64 %10 = call i64* @memmove(i64* nonnull %sv_1, i64* nonnull %sv_0, i32 ptrtoint (i32* @gv_0 to i32)) %11 = call i64 @FUNC(i64 %9) %12 = call i64 @FUNC(i64 40) %13 = icmp eq i64 %0, %12 store i64 0, i64* %rax.0.reg2mem br i1 %13, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %storemerge2.reg2mem, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE457_Use_of_Uninitialized_Variable__struct_pointer_13-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %storemerge.reg2mem = alloca i64 %0 = load i32, i32* inttoptr (i64 8360 to i32*), align 8 %1 = icmp eq i32 %0, 5 br i1 %1, label LBL_2, label LBL_1 LBL_1: %2 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64)) store i64 %2, i64* %storemerge.reg2mem br label LBL_5 LBL_2: %3 = call i64* @malloc(i32 8) %4 = icmp eq i64* %3, null %5 = icmp eq i1 %4, false br i1 %5, label LBL_4, label LBL_3 LBL_3: call void @exit(i32 -1) unreachable LBL_4: %6 = bitcast i64* %3 to i32* store i32 5, i32* %6, align 4 %7 = ptrtoint i64* %3 to i64 %8 = add i64 %7, 4 %9 = inttoptr i64 %8 to i32* store i32 6, i32* %9, align 4 %10 = load i32, i32* %6, align 4 %11 = zext i32 %10 to i64 %12 = call i64 @FUNC(i64 %11) %13 = load i32, i32* %9, align 4 %14 = zext i32 %13 to i64 %15 = call i64 @FUNC(i64 %14) store i64 %15, i64* %storemerge.reg2mem br label LBL_5 LBL_5: %storemerge.reload = load i64, i64* %storemerge.reg2mem ret i64 %storemerge.reload uselistorder i64* %3, { 0, 2, 1 } uselistorder i64* %storemerge.reg2mem, { 0, 2, 1 } }
0
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE805_char_declare_snprintf_02-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = ptrtoint i64* %sv_1 to i64 %2 = bitcast i64* %sv_1 to i8* store i8 0, i8* %2, align 8 %3 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99) %4 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* nonnull %2, i32 100, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_0, i64 0, i64 0), i64* nonnull %sv_0) %5 = call i64 @FUNC(i64 %1) %6 = call i64 @FUNC(i64 40) %7 = icmp eq i64 %0, %6 store i64 0, i64* %rax.0.reg2mem br i1 %7, label LBL_2, label LBL_1 LBL_1: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 (i8*, i32, i8*, ...)* @snprintf, { 1, 0, 2 } uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE193_char_memmove_17-good
goodG2B
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64* @malloc(i32 11) %2 = icmp eq i64* %1, null %3 = icmp eq i1 %2, false br i1 %3, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 -1) unreachable LBL_2: %4 = ptrtoint i64* %1 to i64 store i64 4702111234474983745, i64* %sv_0, align 8 %5 = bitcast i64* %sv_0 to i8* %6 = call i32 @strlen(i8* nonnull %5) %7 = add i32 %6, 1 %8 = call i64* @memmove(i64* %1, i64* nonnull %sv_0, i32 %7) %9 = call i64 @FUNC(i64 %4) call void @free(i64* %1) %10 = call i64 @FUNC(i64 40) %11 = icmp eq i64 %0, %10 store i64 0, i64* %rax.0.reg2mem br i1 %11, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload }
0
juliet-test-suite-c
CWE563_Unused_Variable__unused_value_char_16-good
goodG2B
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = call i64 @FUNC(i64 67) %1 = call i64 @FUNC(i64 90) ret i64 %1 uselistorder i64 (i64)* @printHexCharLine, { 2, 1, 0 } }
0
juliet-test-suite-c
CWE369_Divide_by_Zero__float_fgets_07-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = alloca i128 %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i32 %.reg2mem = alloca i32 %sv_0.0.ph.reg2mem = alloca i32 %1 = load i128, i128* %0 %sv_1 = alloca i64, align 8 %2 = call i64 @FUNC(i64 40) %3 = call i128 @FUNC(i128 %1, i128 %1) %4 = call i64 @FUNC(i128 %3) %5 = trunc i64 %4 to i32 %6 = load i32, i32* @gv_0, align 4 %7 = icmp eq i32 %6, 5 %8 = icmp eq i1 %7, false store i32 %6, i32* %.reg2mem store i32 %5, i32* %sv_0.0.reg2mem br i1 %8, label LBL_5, label LBL_1 LBL_1: %9 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8 %10 = bitcast i64* %sv_1 to i8* %11 = call i8* @fgets(i8* nonnull %10, i32 20, %_IO_FILE* %9) %12 = icmp eq i8* %11, null br i1 %12, label LBL_3, label LBL_2 LBL_2: %13 = call double @atof(i8* nonnull %10) %14 = fptrunc double %13 to float %15 = bitcast float %14 to i32 %16 = sext i32 %15 to i128 %17 = call i128 @FUNC(i128 %16) %18 = call i64 @FUNC(i128 %17) %19 = trunc i64 %18 to i32 store i32 %19, i32* %sv_0.0.ph.reg2mem br label LBL_4 LBL_3: %20 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_2 to i64)) store i32 %5, i32* %sv_0.0.ph.reg2mem br label LBL_4 LBL_4: %sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem %.pr = load i32, i32* @gv_0, align 4 store i32 %.pr, i32* %.reg2mem store i32 %sv_0.0.ph.reload, i32* %sv_0.0.reg2mem br label LBL_5 LBL_5: %.reload = load i32, i32* %.reg2mem %21 = icmp eq i32 %.reload, 5 br i1 %21, label LBL_7, label LBL_6 LBL_6: %22 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_3 to i64)) br label LBL_8 LBL_7: %sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem %23 = call i128 @__asm_movss.1(i32 %sv_0.0.reload) %24 = call i128 @__asm_movss.1(i32 2147483647) %25 = call i128 @FUNC(i128 %23, i128 %24) %26 = call i128 @FUNC(i128 %25) %27 = load i128, i128* @gv_4, align 8 call void @FUNC(i128 %26, i128 %27) %28 = call i64 @FUNC(i64 ptrtoint ([38 x i8]* @gv_5 to i64)) br label LBL_8 LBL_8: %29 = call i64 @FUNC(i64 40) %30 = icmp eq i64 %2, %29 store i64 0, i64* %rax.0.reg2mem br i1 %30, label LBL_10, label LBL_9 LBL_9: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_10 LBL_10: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %5, { 1, 0 } uselistorder i32* %.reg2mem, { 0, 2, 1 } uselistorder i32* %sv_0.0.reg2mem, { 0, 2, 1 } uselistorder label LBL_4, { 1, 0 } }
0
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE193_char_memmove_10-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 0 store i64 0, i64* %sv_0.0.reg2mem br i1 %2, label LBL_3, label LBL_1 LBL_1: %3 = call i64* @malloc(i32 11) %4 = ptrtoint i64* %3 to i64 %5 = icmp eq i64* %3, null %6 = icmp eq i1 %5, false store i64 %4, i64* %sv_0.0.reg2mem br i1 %6, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem store i64 4702111234474983745, i64* %sv_1, align 8 %7 = bitcast i64* %sv_1 to i8* %8 = call i32 @strlen(i8* nonnull %7) %9 = add i32 %8, 1 %10 = inttoptr i64 %sv_0.0.reload to i64* %11 = call i64* @memmove(i64* %10, i64* nonnull %sv_1, i32 %9) %12 = call i64 @FUNC(i64 %sv_0.0.reload) call void @free(i64* %10) %13 = call i64 @FUNC(i64 40) %14 = icmp eq i64 %0, %13 store i64 0, i64* %rax.0.reg2mem br i1 %14, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder void (i64*)* @free, { 1, 0, 2 } uselistorder i64* (i64*, i64*, i32)* @memmove, { 1, 0, 2 } uselistorder i64* (i32)* @malloc, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE193_char_alloca_memcpy_12-bad
CWE121_Stack_Based_Buffer_Overflow__CWE193_char_alloca_memcpy_12_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %0 = ptrtoint i64* %sv_1 to i64 %1 = call i64 @FUNC(i64 40) %2 = call i64 @FUNC() %3 = trunc i64 %2 to i32 %4 = icmp eq i32 %3, 0 br i1 %4, label LBL_2, label LBL_1 LBL_1: %5 = add i64 %0, -17 %6 = and i64 %5, -16 store i64 %6, i64* %sv_1, align 8 %7 = inttoptr i64 %6 to i8* store i8 0, i8* %7, align 16 br label LBL_3 LBL_2: %8 = add i64 %0, -49 %9 = and i64 %8, -16 store i64 %9, i64* %sv_1, align 8 %10 = inttoptr i64 %9 to i8* store i8 0, i8* %10, align 16 br label LBL_3 LBL_3: store i64 4702111234474983745, i64* %sv_0, align 8 %11 = bitcast i64* %sv_0 to i8* %12 = call i32 @strlen(i8* nonnull %11) %13 = add i32 %12, 1 %14 = load i64, i64* %sv_1, align 8 %15 = inttoptr i64 %14 to i64* %16 = call i64* @memcpy(i64* %15, i64* nonnull %sv_0, i32 %13) %17 = load i64, i64* %sv_1, align 8 %18 = call i64 @FUNC(i64 %17) %19 = call i64 @FUNC(i64 40) %20 = icmp eq i64 %1, %19 store i64 0, i64* %rax.0.reg2mem br i1 %20, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %9, { 1, 0 } uselistorder i64 %6, { 1, 0 } }
1
juliet-test-suite-c
CWE190_Integer_Overflow__int_connect_socket_add_02-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = call i64 @FUNC(i64 3) ret i64 %0 uselistorder i64 (i64)* @printIntLine, { 3, 2, 1, 0 } }
0
juliet-test-suite-c
CWE191_Integer_Underflow__char_fscanf_multiply_17-bad
CWE191_Integer_Underflow__char_fscanf_multiply_17_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i8, align 1 %0 = call i64 @FUNC(i64 40) store i8 32, i8* %sv_0, align 1 %1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i8* nonnull %sv_0) %3 = load i8, i8* %sv_0, align 1 %4 = icmp slt i8 %3, 0 %5 = icmp eq i1 %4, false br i1 %5, label LBL_2, label LBL_1 LBL_1: %6 = mul i8 %3, 2 %7 = sext i8 %6 to i64 %8 = and i64 %7, 4294967294 %9 = call i64 @FUNC(i64 %8) br label LBL_2 LBL_2: %10 = call i64 @FUNC(i64 40) %11 = icmp eq i64 %0, %10 store i64 0, i64* %rax.0.reg2mem br i1 %11, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i8* %sv_0, { 1, 0, 2 } uselistorder i8 0, { 1, 2, 0 } uselistorder label LBL_2, { 1, 0 } }
1
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE193_char_cpy_14-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i8* %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4 %2 = icmp eq i32 %1, 5 br i1 %2, label LBL_2, label LBL_1 LBL_1: %3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64)) store i8* null, i8** %sv_0.0.reg2mem br label LBL_4 LBL_2: %4 = call i64* @malloc(i32 11) %5 = bitcast i64* %4 to i8* %6 = icmp eq i64* %4, null %7 = icmp eq i1 %6, false store i8* %5, i8** %sv_0.0.reg2mem br i1 %7, label LBL_4, label LBL_3 LBL_3: call void @exit(i32 -1) unreachable LBL_4: %sv_0.0.reload = load i8*, i8** %sv_0.0.reg2mem store i64 4702111234474983745, i64* %sv_1, align 8 %8 = bitcast i64* %sv_1 to i8* %9 = call i8* @strcpy(i8* %sv_0.0.reload, i8* nonnull %8) %10 = ptrtoint i8* %sv_0.0.reload to i64 %11 = call i64 @FUNC(i64 %10) %12 = bitcast i8* %sv_0.0.reload to i64* call void @free(i64* %12) %13 = call i64 @FUNC(i64 40) %14 = icmp eq i64 %0, %13 store i64 0, i64* %rax.0.reg2mem br i1 %14, label LBL_6, label LBL_5 LBL_5: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_6 LBL_6: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i8** %sv_0.0.reg2mem, { 0, 2, 1 } }
0
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE806_char_memcpy_07-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %.pre-phi.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64* @malloc(i32 100) %2 = icmp eq i64* %1, null %3 = icmp eq i1 %2, false br i1 %3, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 -1) unreachable LBL_2: %4 = load i32, i32* @gv_0, align 4 %5 = icmp eq i32 %4, 5 br i1 %5, label LBL_4, label LBL_3 LBL_3: %6 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64)) %.pre = ptrtoint i64* %1 to i64 store i64 %.pre, i64* %.pre-phi.reg2mem br label LBL_5 LBL_4: %7 = call i64* @memset(i64* %1, i32 65, i32 49) %8 = ptrtoint i64* %1 to i64 %9 = add i64 %8, 49 %10 = inttoptr i64 %9 to i8* store i8 0, i8* %10, align 1 store i64 %8, i64* %.pre-phi.reg2mem br label LBL_5 LBL_5: %11 = bitcast i64* %1 to i8* %.pre-phi.reload = load i64, i64* %.pre-phi.reg2mem store i64 0, i64* %sv_0, align 8 %12 = call i32 @strlen(i8* %11) %13 = call i64* @memcpy(i64* nonnull %sv_0, i64* %1, i32 %12) %14 = call i64 @FUNC(i64 %.pre-phi.reload) call void @free(i64* %1) %15 = call i64 @FUNC(i64 40) %16 = icmp eq i64 %0, %15 store i64 0, i64* %rax.0.reg2mem br i1 %16, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %1, { 2, 3, 6, 1, 4, 0, 5 } uselistorder i64* %.pre-phi.reg2mem, { 0, 2, 1 } }
0
juliet-test-suite-c
CWE191_Integer_Underflow__unsigned_int_min_sub_11-bad
CWE191_Integer_Underflow__unsigned_int_min_sub_11_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = call i64 @FUNC() %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 store i64 %1, i64* %rax.0.reg2mem br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = call i64 @FUNC(i64 4294967295) store i64 %4, i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 ()* @globalReturnsTrue, { 1, 0 } }
1
juliet-test-suite-c
CWE690_NULL_Deref_From_Return__struct_calloc_05-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = call i64* @calloc(i32 1, i32 8) %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 0 br i1 %2, label LBL_2, label LBL_1 LBL_1: %3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64)) store i64 %3, i64* %rax.0.reg2mem br label LBL_4 LBL_2: %4 = icmp eq i64* %0, null store i64 0, i64* %rax.0.reg2mem br i1 %4, label LBL_4, label LBL_3 LBL_3: %5 = ptrtoint i64* %0 to i64 %6 = bitcast i64* %0 to i32* store i32 1, i32* %6, align 4 %7 = add i64 %5, 4 %8 = inttoptr i64 %7 to i32* store i32 1, i32* %8, align 4 %9 = call i64 @FUNC(i64 %5) call void @free(i64* nonnull %0) store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %0, { 0, 1, 3, 2 } uselistorder i64* %rax.0.reg2mem, { 0, 2, 3, 1 } }
0
juliet-test-suite-c
CWE369_Divide_by_Zero__int_fscanf_modulo_12-good
goodB2G
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i32, align 4 %0 = call i64 @FUNC(i64 40) store i32 -1, i32* %sv_0, align 4 %1 = call i64 @FUNC() %2 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %3 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %2, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i32* nonnull %sv_0) %4 = call i64 @FUNC() %5 = trunc i64 %4 to i32 %6 = icmp eq i32 %5, 0 %7 = load i32, i32* %sv_0, align 4 %8 = icmp eq i32 %7, 0 br i1 %6, label LBL_4, label LBL_1 LBL_1: br i1 %8, label LBL_3, label LBL_2 LBL_2: %9 = urem i32 100, %7 %10 = zext i32 %9 to i64 %11 = call i64 @FUNC(i64 %10) br label LBL_7 LBL_3: %12 = call i64 @FUNC(i64 ptrtoint ([38 x i8]* @gv_2 to i64)) br label LBL_7 LBL_4: br i1 %8, label LBL_6, label LBL_5 LBL_5: %13 = urem i32 100, %7 %14 = zext i32 %13 to i64 %15 = call i64 @FUNC(i64 %14) br label LBL_7 LBL_6: %16 = call i64 @FUNC(i64 ptrtoint ([38 x i8]* @gv_2 to i64)) br label LBL_7 LBL_7: %17 = call i64 @FUNC(i64 40) %18 = icmp eq i64 %0, %17 store i64 0, i64* %rax.0.reg2mem br i1 %18, label LBL_9, label LBL_8 LBL_8: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_9 LBL_9: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i1 %8, { 1, 0 } uselistorder i32 %7, { 1, 0, 2 } uselistorder i32* %sv_0, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE805_int_alloca_memcpy_13-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* inttoptr (i64 8360 to i32*), align 8 %2 = icmp eq i32 %1, 5 br i1 %2, label LBL_2, label LBL_1 LBL_1: %3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64)) br label LBL_3 LBL_2: %4 = ptrtoint i64* %sv_2 to i64 %5 = add i64 %4, -609 %6 = and i64 %5, -16 store i64 %6, i64* %sv_0.0.reg2mem br label LBL_3 LBL_3: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %7 = bitcast i64* %sv_1 to i8* call void @FUNC(i8* nonnull %7, i64 0, i64 50) %8 = inttoptr i64 %sv_0.0.reload to i64* %9 = call i64* @memcpy(i64* %8, i64* nonnull %sv_1, i32 400) %10 = inttoptr i64 %sv_0.0.reload to i32* %11 = load i32, i32* %10, align 4 %12 = zext i32 %11 to i64 %13 = call i64 @FUNC(i64 %12) %14 = call i64 @FUNC(i64 40) %15 = icmp eq i64 %0, %14 store i64 0, i64* %rax.0.reg2mem br i1 %15, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload }
0
juliet-test-suite-c
CWE253_Incorrect_Check_of_Function_Return_Value__char_remove_14-bad
CWE253_Incorrect_Check_of_Function_Return_Value__char_remove_14_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = load i32, i32* inttoptr (i64 16404 to i32*), align 4 %1 = zext i32 %0 to i64 %2 = icmp eq i32 %0, 5 %3 = icmp eq i1 %2, false store i64 %1, i64* %rax.0.reg2mem br i1 %3, label LBL_3, label LBL_1 LBL_1: %4 = call i32 @remove(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @gv_0, i64 0, i64 0)) %5 = sext i32 %4 to i64 %6 = icmp eq i32 %4, 0 %7 = icmp eq i1 %6, false store i64 %5, i64* %rax.0.reg2mem br i1 %7, label LBL_3, label LBL_2 LBL_2: %8 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_1 to i64)) store i64 %8, i64* %rax.0.reg2mem br label LBL_3 LBL_3: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload }
1
juliet-test-suite-c
CWE416_Use_After_Free__malloc_free_char_12-good
goodB2G
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = call i64 @FUNC() %1 = trunc i64 %0 to i32 %2 = icmp eq i32 %1, 0 %3 = call i64* @malloc(i32 100) %4 = ptrtoint i64* %3 to i64 %5 = icmp eq i64* %3, null %6 = icmp eq i1 %5, false br i1 %2, label LBL_4, label LBL_1 LBL_1: br i1 %6, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %7 = call i64* @memset(i64* %3, i32 65, i32 99) %8 = add i64 %4, 99 %9 = inttoptr i64 %8 to i8* store i8 0, i8* %9, align 1 call void @free(i64* %3) br label LBL_7 LBL_4: br i1 %6, label LBL_6, label LBL_5 LBL_5: call void @exit(i32 -1) unreachable LBL_6: %10 = call i64* @memset(i64* %3, i32 65, i32 99) %11 = add i64 %4, 99 %12 = inttoptr i64 %11 to i8* store i8 0, i8* %12, align 1 call void @free(i64* %3) br label LBL_7 LBL_7: %13 = call i64 @FUNC() ret i64 %13 uselistorder i1 %6, { 1, 0 } uselistorder i64 %4, { 1, 0 } uselistorder i64* %3, { 0, 3, 1, 2, 4, 5 } uselistorder void (i64*)* @free, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE193_char_alloca_memcpy_07-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = ptrtoint i64* %sv_1 to i64 %5 = add i64 %4, -49 %6 = and i64 %5, -16 store i64 %6, i64* %sv_1, align 8 %7 = inttoptr i64 %6 to i8* store i8 0, i8* %7, align 16 br label LBL_2 LBL_2: store i64 4702111234474983745, i64* %sv_0, align 8 %8 = bitcast i64* %sv_0 to i8* %9 = call i32 @strlen(i8* nonnull %8) %10 = add i32 %9, 1 %11 = load i64, i64* %sv_1, align 8 %12 = inttoptr i64 %11 to i64* %13 = call i64* @memcpy(i64* %12, i64* nonnull %sv_0, i32 %10) %14 = load i64, i64* %sv_1, align 8 %15 = call i64 @FUNC(i64 %14) %16 = call i64 @FUNC(i64 40) %17 = icmp eq i64 %0, %16 store i64 0, i64* %rax.0.reg2mem br i1 %17, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %6, { 1, 0 } uselistorder i64* (i64*, i64*, i32)* @memcpy, { 1, 0, 2 } uselistorder i32 (i8*)* @strlen, { 1, 0, 2 } uselistorder i32* @gv_0, { 1, 0 } }
0
juliet-test-suite-c
CWE369_Divide_by_Zero__float_connect_socket_17-good
goodG2B
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = alloca i128 %1 = load i128, i128* %0 %2 = load i128, i128* %0 %3 = call i128 @FUNC(i128 %2, i128 %2) %4 = call i64 @FUNC(i128 %3) %5 = call i128 @__asm_movss.1(i32 1073741824) %6 = call i64 @FUNC(i128 %5) %sv_0.0.le = trunc i64 %6 to i32 %7 = call i128 @FUNC(i128 %1, i128 %1) %8 = call i128 @__asm_cvtss2sd.2(i32 %sv_0.0.le) %9 = call i128 @FUNC(i64 4636737291354636288) %10 = call i128 @FUNC(i128 %9, i128 %8) %11 = call i32 @FUNC(i128 %10) %12 = zext i32 %11 to i64 %13 = call i64 @FUNC(i64 %12) ret i64 %13 uselistorder i128* %0, { 1, 0 } }
0
juliet-test-suite-c
CWE190_Integer_Overflow__int64_t_fscanf_add_11-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 0, i64* %sv_0, align 8 %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %5 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %4, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_1, i64 0, i64 0), i64* nonnull %sv_0) br label LBL_2 LBL_2: %6 = call i64 @FUNC() %7 = trunc i64 %6 to i32 %8 = icmp eq i32 %7, 0 br i1 %8, label LBL_6, label LBL_3 LBL_3: %9 = load i64, i64* %sv_0, align 8 %10 = icmp eq i64 %9, 9223372036854775807 br i1 %10, label LBL_5, label LBL_4 LBL_4: %11 = add i64 %9, 1 %12 = call i64 @FUNC(i64 %11) br label LBL_6 LBL_5: %13 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_2 to i64)) br label LBL_6 LBL_6: %14 = call i64 @FUNC(i64 40) %15 = icmp eq i64 %0, %14 store i64 0, i64* %rax.0.reg2mem br i1 %15, label LBL_8, label LBL_7 LBL_7: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_8 LBL_8: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %sv_0, { 1, 0, 2 } uselistorder %_IO_FILE** @gv_0, { 1, 0 } }
0
juliet-test-suite-c
CWE190_Integer_Overflow__unsigned_int_fscanf_add_10-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = load i32, i32* @gv_0, align 4 %1 = icmp eq i32 %0, 0 store i64 0, i64* %rax.0.reg2mem br i1 %1, label LBL_2, label LBL_1 LBL_1: %2 = call i64 @FUNC(i64 3) store i64 %2, i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 (i64)* @printUnsignedLine, { 3, 2, 1, 0 } uselistorder i64 3, { 1, 0 } uselistorder i32* @gv_0, { 4, 3, 0, 2, 1 } }
0
juliet-test-suite-c
CWE427_Uncontrolled_Search_Path_Element__char_connect_socket_13-bad
CWE427_Uncontrolled_Search_Path_Element__char_connect_socket_13_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = alloca i1 %rax.0.reg2mem = alloca i64 %1 = load i1, i1* %0 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %2 = call i64 @FUNC(i64 40) store i64 263206486352, i64* %sv_2, align 8 %3 = ptrtoint i64* %sv_1 to i64 %4 = bitcast i64* %sv_1 to i8* call void @FUNC(i8* nonnull %4, i64 0, i64 29) %5 = select i1 %1, i64 -232, i64 232 %6 = add i64 %5, %3 %7 = inttoptr i64 %6 to i16* store i16 0, i16* %7, align 8 %8 = bitcast i64* %sv_2 to i8* %9 = load i32, i32* inttoptr (i64 8348 to i32*), align 4 %10 = icmp eq i32 %9, 5 %11 = icmp eq i1 %10, false br i1 %11, label LBL_9, label LBL_1 LBL_1: %12 = call i32 @strlen(i8* nonnull %8) %13 = call i32 @socket(i32 2, i32 1, i32 6) %cond = icmp eq i32 %13, -1 br i1 %cond, label LBL_9, label LBL_2 LBL_2: %14 = call i64* @memset(i64* nonnull %sv_0, i32 0, i32 16) store i64 2, i64* %sv_0, align 8 %15 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0)) %16 = call i16 @htons(i16 27015) %17 = bitcast i64* %sv_0 to %sockaddr* %18 = call i32 @connect(i32 %13, %sockaddr* nonnull %17, i32 16) %19 = icmp eq i32 %18, -1 br i1 %19, label LBL_8, label LBL_3 LBL_3: %20 = sext i32 %12 to i64 %21 = ptrtoint i64* %sv_2 to i64 %22 = add i64 %20, %21 %23 = inttoptr i64 %22 to i64* %24 = sub i32 249, %12 %25 = call i32 @recv(i32 %13, i64* %23, i32 %24, i32 0) %26 = add i32 %25, 1 %27 = icmp ult i32 %26, 2 br i1 %27, label LBL_8, label LBL_4 LBL_4: %28 = sext i32 %25 to i64 %29 = add i64 %22, %28 %30 = inttoptr i64 %29 to i8* store i8 0, i8* %30, align 1 %31 = call i8* @strchr(i8* nonnull %8, i32 13) %32 = icmp eq i8* %31, null br i1 %32, label LBL_6, label LBL_5 LBL_5: store i8 0, i8* %31, align 1 br label LBL_6 LBL_6: %33 = call i8* @strchr(i8* nonnull %8, i32 10) %34 = icmp eq i8* %33, null br i1 %34, label LBL_8, label LBL_7 LBL_7: store i8 0, i8* %33, align 1 br label LBL_8 LBL_8: %35 = call i32 @close(i32 %13) br label LBL_9 LBL_9: %36 = call i32 @putenv(i8* nonnull %8) %37 = call i64 @FUNC(i64 40) %38 = icmp eq i64 %2, %37 store i64 0, i64* %rax.0.reg2mem br i1 %38, label LBL_11, label LBL_10 LBL_10: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_11 LBL_11: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %25, { 1, 0 } uselistorder i32 %13, { 3, 1, 2, 0 } uselistorder i8* %8, { 3, 0, 1, 2 } uselistorder i64* %sv_0, { 0, 2, 1 } uselistorder i8* (i8*, i32)* @strchr, { 1, 0, 2 } uselistorder i32 -1, { 1, 0 } uselistorder label LBL_9, { 1, 0, 2 } uselistorder label LBL_8, { 2, 1, 0, 3 } }
1
juliet-test-suite-c
CWE191_Integer_Underflow__short_min_sub_05-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = load i32, i32* @gv_0, align 4 %1 = icmp eq i32 %0, 0 br i1 %1, label LBL_2, label LBL_1 LBL_1: %2 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64)) store i64 %2, i64* %rax.0.reg2mem br label LBL_5 LBL_2: %3 = load i32, i32* @gv_2, align 4 %4 = icmp eq i32 %3, 0 %spec.store.select = select i1 %4, i32 0, i32 -32768 %5 = trunc i32 %spec.store.select to i16 %6 = icmp eq i16 %5, -32768 br i1 %6, label LBL_4, label LBL_3 LBL_3: %7 = mul i32 %spec.store.select, 65536 %sext = add i32 %7, -65536 %8 = ashr exact i32 %sext, 16 %9 = zext i32 %8 to i64 %10 = call i64 @FUNC(i64 %9) store i64 %10, i64* %rax.0.reg2mem br label LBL_5 LBL_4: %11 = call i64 @FUNC(i64 ptrtoint ([48 x i8]* @gv_3 to i64)) store i64 %11, i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %rax.0.reg2mem, { 0, 3, 2, 1 } }
0
juliet-test-suite-c
CWE400_Resource_Exhaustion__listen_socket_sleep_05-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.1.reg2mem = alloca i32 %sv_0.0.ph.reg2mem = alloca i32 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %sv_3 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 0 store i32 -1, i32* %sv_0.1.reg2mem br i1 %2, label LBL_9, label LBL_1 LBL_1: %3 = call i32 @socket(i32 2, i32 1, i32 6) %4 = icmp eq i32 %3, -1 store i32 -1, i32* %sv_0.1.reg2mem br i1 %4, label LBL_9, label LBL_2 LBL_2: %5 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16) store i64 2, i64* %sv_2, align 8 %6 = call i16 @htons(i16 27015) %7 = bitcast i64* %sv_2 to %sockaddr* %8 = call i32 @bind(i32 %3, %sockaddr* nonnull %7, i32 16) %9 = icmp eq i32 %8, -1 br i1 %9, label LBL_7, label LBL_3 LBL_3: %10 = call i32 @listen(i32 %3, i32 5) %11 = icmp eq i32 %10, -1 br i1 %11, label LBL_7, label LBL_4 LBL_4: %12 = call i32 @accept(i32 %3, %sockaddr* null, i32* null) %13 = icmp eq i32 %12, -1 br i1 %13, label LBL_7, label LBL_5 LBL_5: %14 = call i32 @recv(i32 %12, i64* nonnull %sv_1, i32 13, i32 0) %15 = add i32 %14, 1 %16 = icmp ult i32 %15, 2 store i32 -1, i32* %sv_0.0.ph.reg2mem br i1 %16, label LBL_8, label LBL_6 LBL_6: %17 = ptrtoint i64* %sv_3 to i64 %18 = sext i32 %14 to i64 %19 = add i64 %17, -22 %20 = add i64 %19, %18 %21 = inttoptr i64 %20 to i8* store i8 0, i8* %21, align 1 %22 = bitcast i64* %sv_1 to i8* %23 = call i32 @atoi(i8* nonnull %22) store i32 %23, i32* %sv_0.0.ph.reg2mem br label LBL_8 LBL_7: %24 = call i32 @close(i32 %3) store i32 -1, i32* %sv_0.1.reg2mem br label LBL_9 LBL_8: %sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem %25 = call i32 @close(i32 %3) %26 = call i32 @close(i32 %12) store i32 %sv_0.0.ph.reload, i32* %sv_0.1.reg2mem br label LBL_9 LBL_9: %27 = load i32, i32* @gv_1, align 4 %28 = icmp eq i32 %27, 0 br i1 %28, label LBL_11, label LBL_10 LBL_10: %29 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_2 to i64)) br label LBL_14 LBL_11: %sv_0.1.reload = load i32, i32* %sv_0.1.reg2mem %30 = icmp slt i32 %sv_0.1.reload, 1 %31 = icmp sgt i32 %sv_0.1.reload, ptrtoint (i1* @gv_3 to i32) %or.cond4 = or i1 %30, %31 br i1 %or.cond4, label LBL_13, label LBL_12 LBL_12: %32 = call i32 @usleep(i32 %sv_0.1.reload) %33 = call i64 @FUNC(i64 ptrtoint ([14 x i8]* @gv_4 to i64)) br label LBL_14 LBL_13: %34 = call i64 @FUNC(i64 ptrtoint ([20 x i8]* @gv_5 to i64)) br label LBL_14 LBL_14: %35 = call i64 @FUNC(i64 40) %36 = icmp eq i64 %0, %35 store i64 0, i64* %rax.0.reg2mem br i1 %36, label LBL_16, label LBL_15 LBL_15: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_16 LBL_16: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %14, { 1, 0 } uselistorder i32 %3, { 4, 0, 1, 2, 3, 5 } uselistorder i64* %sv_2, { 0, 2, 1 } uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 2, 1 } uselistorder i32* %sv_0.1.reg2mem, { 0, 3, 2, 1, 4 } uselistorder label LBL_9, { 2, 1, 0, 3 } }
0
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_struct_memmove_14-bad
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_struct_memmove_14_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge1.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false store i64 0, i64* %sv_0.0.reg2mem br i1 %3, label LBL_3, label LBL_1 LBL_1: %4 = call i64* @malloc(i32 400) %5 = ptrtoint i64* %4 to i64 %6 = icmp eq i64* %4, null %7 = icmp eq i1 %6, false store i64 %5, i64* %sv_0.0.reg2mem br i1 %7, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %8 = ptrtoint i64* %sv_2 to i64 %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem store i64 0, i64* %storemerge1.reg2mem br label LBL_4 LBL_4: %storemerge1.reload = load i64, i64* %storemerge1.reg2mem %9 = mul i64 %storemerge1.reload, 8 %10 = add i64 %9, %8 %11 = add i64 %10, -816 %12 = inttoptr i64 %11 to i32* store i32 0, i32* %12, align 8 %13 = add i64 %10, -812 %14 = inttoptr i64 %13 to i32* store i32 0, i32* %14, align 4 %15 = add nuw nsw i64 %storemerge1.reload, 1 %exitcond = icmp eq i64 %15, 100 store i64 %15, i64* %storemerge1.reg2mem br i1 %exitcond, label LBL_5, label LBL_4 LBL_5: %16 = inttoptr i64 %sv_0.0.reload to i64* %17 = call i64* @memmove(i64* %16, i64* nonnull %sv_1, i32 ptrtoint (i32* @gv_0 to i32)) %18 = call i64 @FUNC(i64 %sv_0.0.reload) call void @free(i64* %16) %19 = call i64 @FUNC(i64 40) %20 = icmp eq i64 %0, %19 store i64 0, i64* %rax.0.reg2mem br i1 %20, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 } }
1
juliet-test-suite-c
CWE190_Integer_Overflow__int64_t_fscanf_postinc_17-good
goodB2G
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 0, i64* %sv_0, align 8 %1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_1, i64 0, i64 0), i64* nonnull %sv_0) %3 = load i64, i64* %sv_0, align 8 %4 = icmp eq i64 %3, 9223372036854775807 br i1 %4, label LBL_2, label LBL_1 LBL_1: %5 = add i64 %3, 1 store i64 %5, i64* %sv_0, align 8 %6 = call i64 @FUNC(i64 %5) br label LBL_3 LBL_2: %7 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_2 to i64)) br label LBL_3 LBL_3: %8 = call i64 @FUNC(i64 40) %9 = icmp eq i64 %0, %8 store i64 0, i64* %rax.0.reg2mem br i1 %9, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %sv_0, { 1, 2, 0, 3 } uselistorder label LBL_3, { 1, 0 } }
0
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_int_memcpy_07-bad
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_int_memcpy_07_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false store i64 0, i64* %sv_0.0.reg2mem br i1 %3, label LBL_3, label LBL_1 LBL_1: %4 = call i64* @malloc(i32 200) %5 = ptrtoint i64* %4 to i64 %6 = icmp eq i64* %4, null %7 = icmp eq i1 %6, false store i64 %5, i64* %sv_0.0.reg2mem br i1 %7, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %8 = bitcast i64* %sv_1 to i8* call void @FUNC(i8* nonnull %8, i64 0, i64 50) %9 = inttoptr i64 %sv_0.0.reload to i64* %10 = call i64* @memcpy(i64* %9, i64* nonnull %sv_1, i32 400) %11 = inttoptr i64 %sv_0.0.reload to i32* %12 = load i32, i32* %11, align 4 %13 = zext i32 %12 to i64 %14 = call i64 @FUNC(i64 %13) call void @free(i64* %9) %15 = call i64 @FUNC(i64 40) %16 = icmp eq i64 %0, %15 store i64 0, i64* %rax.0.reg2mem br i1 %16, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload }
1
juliet-test-suite-c
CWE190_Integer_Overflow__int_rand_multiply_12-bad
CWE190_Integer_Overflow__int_rand_multiply_12_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge1.reg2mem = alloca i32 %0 = call i64 @FUNC() %1 = trunc i64 %0 to i32 %2 = icmp eq i32 %1, 0 store i32 2, i32* %storemerge1.reg2mem br i1 %2, label LBL_2, label LBL_1 LBL_1: %3 = call i32 @rand() %4 = urem i32 %3, 2 %5 = icmp eq i32 %4, 0 %6 = call i32 @rand() %7 = mul i32 %6, 1073741824 %8 = call i32 @rand() %9 = mul i32 %8, 32768 %10 = xor i32 %9, %7 %11 = call i32 @rand() %12 = xor i32 %10, %11 %13 = sext i1 %5 to i32 %storemerge.in = xor i32 %12, %13 store i32 %storemerge.in, i32* %storemerge1.reg2mem br label LBL_2 LBL_2: %storemerge1.reload = load i32, i32* %storemerge1.reg2mem %14 = call i64 @FUNC() %15 = trunc i64 %14 to i32 %16 = icmp eq i32 %15, 0 %17 = icmp slt i32 %storemerge1.reload, 1 br i1 %16, label LBL_5, label LBL_3 LBL_3: store i64 %14, i64* %rax.0.reg2mem br i1 %17, label LBL_9, label LBL_4 LBL_4: %18 = mul i32 %storemerge1.reload, 2 %19 = zext i32 %18 to i64 %20 = call i64 @FUNC(i64 %19) store i64 %20, i64* %rax.0.reg2mem br label LBL_9 LBL_5: store i64 %14, i64* %rax.0.reg2mem br i1 %17, label LBL_9, label LBL_6 LBL_6: %21 = icmp sgt i32 %storemerge1.reload, 1073741822 br i1 %21, label LBL_8, label LBL_7 LBL_7: %22 = mul i32 %storemerge1.reload, 2 %23 = zext i32 %22 to i64 %24 = call i64 @FUNC(i64 %23) store i64 %24, i64* %rax.0.reg2mem br label LBL_9 LBL_8: %25 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_0 to i64)) store i64 %25, i64* %rax.0.reg2mem br label LBL_9 LBL_9: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i1 %17, { 1, 0 } uselistorder i64 %14, { 1, 0, 2 } uselistorder i32 %storemerge1.reload, { 3, 0, 2, 1 } uselistorder i32* %storemerge1.reg2mem, { 0, 2, 1 } uselistorder i64* %rax.0.reg2mem, { 0, 4, 3, 5, 1, 2 } uselistorder i64 (i64)* @printIntLine, { 1, 0 } uselistorder i64 ()* @globalReturnsTrueOrFalse, { 1, 0 } uselistorder label LBL_2, { 1, 0 } }
1
juliet-test-suite-c
CWE134_Uncontrolled_Format_String__char_file_snprintf_14-bad
CWE134_Uncontrolled_Format_String__char_file_snprintf_14_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 0, i64* %sv_1, align 8 %1 = bitcast i64* %sv_1 to i8* %2 = load i32, i32* inttoptr (i64 16404 to i32*), align 4 %3 = icmp eq i32 %2, 5 %4 = icmp eq i1 %3, false br i1 %4, label LBL_6, label LBL_1 LBL_1: %5 = call i32 @strlen(i8* nonnull %1) %6 = sext i32 %5 to i64 %7 = sub nsw i64 100, %6 %8 = icmp ult i64 %7, 2 br i1 %8, label LBL_6, label LBL_2 LBL_2: %9 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @gv_1, i64 0, i64 0)) %10 = icmp eq %_IO_FILE* %9, null br i1 %10, label LBL_6, label LBL_3 LBL_3: %11 = sub i32 100, %5 %12 = ptrtoint i64* %sv_1 to i64 %13 = add i64 %6, %12 %14 = inttoptr i64 %13 to i8* %15 = call i8* @fgets(i8* %14, i32 %11, %_IO_FILE* nonnull %9) %16 = icmp eq i8* %15, null %17 = icmp eq i1 %16, false br i1 %17, label LBL_5, label LBL_4 LBL_4: %18 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_2 to i64)) store i8 0, i8* %14, align 1 br label LBL_5 LBL_5: %19 = call i32 @fclose(%_IO_FILE* nonnull %9) br label LBL_6 LBL_6: %20 = load i32, i32* @gv_3, align 4 %21 = icmp eq i32 %20, 5 %22 = icmp eq i1 %21, false br i1 %22, label LBL_8, label LBL_7 LBL_7: store i64 0, i64* %sv_0, align 8 %23 = bitcast i64* %sv_0 to i8* %24 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* nonnull %23, i32 99, i8* nonnull %1) %25 = ptrtoint i64* %sv_0 to i64 %26 = call i64 @FUNC(i64 %25) br label LBL_8 LBL_8: %27 = call i64 @FUNC(i64 40) %28 = icmp eq i64 %0, %27 store i64 0, i64* %rax.0.reg2mem br i1 %28, label LBL_10, label LBL_9 LBL_9: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_10 LBL_10: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %sv_0, { 1, 0, 2 } }
1
End of preview. Expand in Data Studio

Juliet_LLVM Dataset

Hugging Face

Dataset Summary

Juliet_LLVM is a dataset of compiled C functions from the Juliet Test Suite (as organized in the GitHub repository ), translated into LLVM Intermediate Representation (IR) after pre-process phase. It is designed for training and evaluating machine learning models on the task of binary vulnerability detection. Each function is labeled as either vulnerable or non-vulnerable and is presented in an architecture-agnostic, semantically rich format.

This LLVM version allows models to be trained and tested on realistic, compiler-transformed code — reflecting how such models would be deployed in real-world binary analysis scenarios.

This dataset supports experiments described in our paper and follows the same compilation, splitting, and evaluation procedures.

Key Features

  • ✅ Based on the Juliet Test Suite, a standard benchmark for vulnerability detection
  • LLVM IR representation of each function (field: llvm_ir_function)
  • ✅ Predefined train, validation, and test splits
  • Binary vulnerability labels (label) for classification
  • ✅ Includes metadata: original file and function name
  • ✅ Efficiently stored as Parquet files for fast loading and processing

Dataset Structure

Each record contains:

  • dataset: The origin source, always "Juliet" for this dataset
  • file: Source file from the Juliet suite
  • fun_name: The name of the function
  • llvm_ir_function: The LLVM IR pre-processed code for the function
  • label: "1" for vulnerable, "0" for non-vulnerable
  • split: One of "train", "validation", or "test"

Split Information

This dataset is split into three subsets:

  • train: Used for training the models
  • validation: Used for hyperparameter tuning and model selection
  • test: Held out for final evaluation and benchmarking

✅ These splits match exactly the partitioning used in our paper experiments, allowing reproducibility and direct comparison with our reported results. Each split is disjoint and ensures no function-level overlap between sets.

Format

This dataset is stored in Apache Parquet format under the default configuration. It adheres to the Croissant schema and includes metadata for fields and splits.

Usage

You can load the dataset using the Hugging Face 🤗 datasets library:

from datasets import load_dataset

# Load train split
train_ds = load_dataset("compAgent/Juliet_LLVM", split="train")
print(train_ds[0])
{
  "dataset": "Juliet",
  "file": "CWE121/s01.c",
  "fun_name": "CWE121_bad",
  "llvm_ir_function": "define dso_local void @CWE121_bad() { ... }",
  "label": "1",
  "split": "train"
}

License

This dataset is released under the GPL-3.0.

Related Work

Juliet Test Suite — the original source of these functions.

Juliet Test Suite GitHub repository - the GitHub repository we took the Juliet Test Suite dataset from.

Citation

@misc{juliet_llvm,
  author       = {Compote},
  title        = {Juliet_LLVM: A Dataset of Vulnerable and Non-Vulnerable Functions from the Juliet Suite in LLVM IR},
  howpublished = {\url{https://huggingface.co/datasets/compAgent/Juliet_LLVM}},
  year         = {2025}
}
Downloads last month
36